Use thread_info and inferior pointers more throughout
[deliverable/binutils-gdb.git] / gdb / inferior.c
CommitLineData
b77209e0
PA
1/* Multi-process control for GDB, the GNU debugger.
2
e2882c85 3 Copyright (C) 2008-2018 Free Software Foundation, Inc.
b77209e0
PA
4
5 This file is part of GDB.
6
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
11
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>. */
19
20#include "defs.h"
6c95b8df 21#include "exec.h"
b77209e0
PA
22#include "inferior.h"
23#include "target.h"
24#include "command.h"
06da564e 25#include "completer.h"
b77209e0
PA
26#include "gdbcmd.h"
27#include "gdbthread.h"
28#include "ui-out.h"
76727919 29#include "observable.h"
6c95b8df
PA
30#include "gdbcore.h"
31#include "symfile.h"
3f81c18a 32#include "environ.h"
c82c0b55 33#include "cli/cli-utils.h"
be34f849 34#include "continuations.h"
6ecd4729
PA
35#include "arch-utils.h"
36#include "target-descriptions.h"
47902076 37#include "readline/tilde.h"
5ed8105e 38#include "progspace-and-thread.h"
b77209e0 39
8e260fc0
TT
40/* Keep a registry of per-inferior data-pointers required by other GDB
41 modules. */
42
6b81941e 43DEFINE_REGISTRY (inferior, REGISTRY_ACCESS_FIELD)
6c95b8df
PA
44
45struct inferior *inferior_list = NULL;
b77209e0
PA
46static int highest_inferior_num;
47
f67c0c91
SDJ
48/* See inferior.h. */
49int print_inferior_events = 1;
b77209e0 50
3a3fd0fd
PA
51/* The Current Inferior. This is a strong reference. I.e., whenever
52 an inferior is the current inferior, its refcount is
53 incremented. */
6c95b8df
PA
54static struct inferior *current_inferior_ = NULL;
55
b77209e0
PA
56struct inferior*
57current_inferior (void)
58{
6c95b8df
PA
59 return current_inferior_;
60}
61
62void
63set_current_inferior (struct inferior *inf)
64{
65 /* There's always an inferior. */
66 gdb_assert (inf != NULL);
67
3a3fd0fd
PA
68 inf->incref ();
69 current_inferior_->decref ();
6c95b8df
PA
70 current_inferior_ = inf;
71}
72
089354bb
SM
73private_inferior::~private_inferior () = default;
74
0550c955 75inferior::~inferior ()
b77209e0 76{
0550c955
PA
77 inferior *inf = this;
78
e0ba6746 79 discard_all_inferior_continuations (inf);
6c95b8df 80 inferior_free_data (inf);
3f81c18a
VP
81 xfree (inf->args);
82 xfree (inf->terminal);
6ecd4729 83 target_desc_info_free (inf->tdesc_info);
0550c955
PA
84}
85
86inferior::inferior (int pid_)
87 : num (++highest_inferior_num),
88 pid (pid_),
9a6c7d9c 89 environment (gdb_environ::from_host_environ ()),
0550c955
PA
90 registry_data ()
91{
0550c955 92 inferior_alloc_data (this);
b77209e0
PA
93}
94
b77209e0
PA
95struct inferior *
96add_inferior_silent (int pid)
97{
0550c955 98 inferior *inf = new inferior (pid);
b05b1202
PA
99
100 if (inferior_list == NULL)
101 inferior_list = inf;
102 else
103 {
0550c955 104 inferior *last;
b05b1202
PA
105
106 for (last = inferior_list; last->next != NULL; last = last->next)
107 ;
108 last->next = inf;
109 }
b77209e0 110
76727919 111 gdb::observers::inferior_added.notify (inf);
a79b8f6e 112
6c95b8df
PA
113 if (pid != 0)
114 inferior_appeared (inf, pid);
a562dc8f 115
b77209e0
PA
116 return inf;
117}
118
119struct inferior *
120add_inferior (int pid)
121{
122 struct inferior *inf = add_inferior_silent (pid);
123
124 if (print_inferior_events)
f67c0c91
SDJ
125 printf_unfiltered (_("[New inferior %d (%s)]\n"),
126 inf->num,
127 target_pid_to_str (pid_to_ptid (pid)));
b77209e0
PA
128
129 return inf;
130}
131
132struct delete_thread_of_inferior_arg
133{
134 int pid;
135 int silent;
136};
137
138static int
139delete_thread_of_inferior (struct thread_info *tp, void *data)
140{
9a3c8263
SM
141 struct delete_thread_of_inferior_arg *arg
142 = (struct delete_thread_of_inferior_arg *) data;
b77209e0
PA
143
144 if (ptid_get_pid (tp->ptid) == arg->pid)
145 {
146 if (arg->silent)
00431a78 147 delete_thread_silent (tp);
b77209e0 148 else
00431a78 149 delete_thread (tp);
b77209e0
PA
150 }
151
152 return 0;
153}
154
a79b8f6e 155void
7a41607e 156delete_inferior (struct inferior *todel)
b77209e0
PA
157{
158 struct inferior *inf, *infprev;
6c95b8df 159 struct delete_thread_of_inferior_arg arg;
b77209e0
PA
160
161 infprev = NULL;
162
163 for (inf = inferior_list; inf; infprev = inf, inf = inf->next)
6c95b8df 164 if (inf == todel)
b77209e0
PA
165 break;
166
167 if (!inf)
168 return;
169
6c95b8df 170 arg.pid = inf->pid;
7a41607e 171 arg.silent = 1;
b77209e0
PA
172
173 iterate_over_threads (delete_thread_of_inferior, &arg);
4a92f99b 174
7e1789f5
PA
175 if (infprev)
176 infprev->next = inf->next;
177 else
178 inferior_list = inf->next;
179
76727919 180 gdb::observers::inferior_removed.notify (inf);
a79b8f6e 181
7a41607e
SM
182 /* If this program space is rendered useless, remove it. */
183 if (program_space_empty_p (inf->pspace))
184 delete_program_space (inf->pspace);
ef3f321b 185
0550c955 186 delete inf;
ef3f321b
SM
187}
188
6c95b8df
PA
189/* If SILENT then be quiet -- don't announce a inferior exit, or the
190 exit of its threads. */
191
192static void
193exit_inferior_1 (struct inferior *inftoex, int silent)
194{
195 struct inferior *inf;
196 struct delete_thread_of_inferior_arg arg;
197
198 for (inf = inferior_list; inf; inf = inf->next)
199 if (inf == inftoex)
200 break;
201
202 if (!inf)
203 return;
204
205 arg.pid = inf->pid;
206 arg.silent = silent;
207
208 iterate_over_threads (delete_thread_of_inferior, &arg);
209
76727919 210 gdb::observers::inferior_exit.notify (inf);
6c95b8df
PA
211
212 inf->pid = 0;
e714e1bf 213 inf->fake_pid_p = 0;
ef4a3395
PA
214 inf->priv = NULL;
215
6c95b8df
PA
216 if (inf->vfork_parent != NULL)
217 {
218 inf->vfork_parent->vfork_child = NULL;
219 inf->vfork_parent = NULL;
220 }
68c9da30
PA
221 if (inf->vfork_child != NULL)
222 {
223 inf->vfork_child->vfork_parent = NULL;
224 inf->vfork_child = NULL;
225 }
8cf64490 226
68c9da30 227 inf->pending_detach = 0;
85046ae2
YQ
228 /* Reset it. */
229 inf->control = {NO_STOP_QUIETLY};
6c95b8df
PA
230}
231
232void
00431a78 233exit_inferior (inferior *inf)
6c95b8df 234{
00431a78 235 int pid = inf->pid;
6c95b8df 236 exit_inferior_1 (inf, 0);
6c95b8df
PA
237}
238
239void
240exit_inferior_silent (int pid)
241{
242 struct inferior *inf = find_inferior_pid (pid);
abbb1732 243
6c95b8df
PA
244 exit_inferior_1 (inf, 1);
245}
246
00431a78
PA
247void
248exit_inferior_silent (inferior *inf)
249{
250 exit_inferior_1 (inf, 1);
251}
252
6c95b8df
PA
253void
254exit_inferior_num_silent (int num)
255{
256 struct inferior *inf = find_inferior_id (num);
257
258 exit_inferior_1 (inf, 1);
b77209e0
PA
259}
260
bc09b0c1
SM
261/* See inferior.h. */
262
b77209e0 263void
bc09b0c1 264detach_inferior (inferior *inf)
b77209e0 265{
bc09b0c1
SM
266 /* Save the pid, since exit_inferior_1 will reset it. */
267 int pid = inf->pid;
abbb1732 268
3b462ec2 269 exit_inferior_1 (inf, 0);
b77209e0
PA
270
271 if (print_inferior_events)
f67c0c91
SDJ
272 printf_unfiltered (_("[Inferior %d (%s) detached]\n"),
273 inf->num,
274 target_pid_to_str (pid_to_ptid (pid)));
b77209e0
PA
275}
276
6c95b8df
PA
277void
278inferior_appeared (struct inferior *inf, int pid)
279{
280 inf->pid = pid;
2ddf4301
SM
281 inf->has_exit_code = 0;
282 inf->exit_code = 0;
6c95b8df 283
76727919 284 gdb::observers::inferior_appeared.notify (inf);
6c95b8df
PA
285}
286
82f73884
PA
287void
288discard_all_inferiors (void)
289{
6c95b8df 290 struct inferior *inf;
82f73884 291
6c95b8df 292 for (inf = inferior_list; inf; inf = inf->next)
82f73884 293 {
6c95b8df 294 if (inf->pid != 0)
00431a78 295 exit_inferior_silent (inf);
82f73884
PA
296 }
297}
298
6c95b8df 299struct inferior *
b77209e0
PA
300find_inferior_id (int num)
301{
302 struct inferior *inf;
303
304 for (inf = inferior_list; inf; inf = inf->next)
305 if (inf->num == num)
306 return inf;
307
308 return NULL;
309}
310
311struct inferior *
312find_inferior_pid (int pid)
313{
314 struct inferior *inf;
315
6c95b8df
PA
316 /* Looking for inferior pid == 0 is always wrong, and indicative of
317 a bug somewhere else. There may be more than one with pid == 0,
318 for instance. */
319 gdb_assert (pid != 0);
320
b77209e0
PA
321 for (inf = inferior_list; inf; inf = inf->next)
322 if (inf->pid == pid)
323 return inf;
324
325 return NULL;
326}
327
c9657e70
SM
328/* See inferior.h */
329
330struct inferior *
331find_inferior_ptid (ptid_t ptid)
332{
333 return find_inferior_pid (ptid_get_pid (ptid));
334}
335
32990ada 336/* See inferior.h. */
6c95b8df
PA
337
338struct inferior *
339find_inferior_for_program_space (struct program_space *pspace)
340{
32990ada
PA
341 struct inferior *inf = current_inferior ();
342
343 if (inf->pspace == pspace)
344 return inf;
6c95b8df
PA
345
346 for (inf = inferior_list; inf != NULL; inf = inf->next)
347 {
348 if (inf->pspace == pspace)
349 return inf;
350 }
351
352 return NULL;
353}
354
b77209e0
PA
355struct inferior *
356iterate_over_inferiors (int (*callback) (struct inferior *, void *),
357 void *data)
358{
359 struct inferior *inf, *infnext;
360
361 for (inf = inferior_list; inf; inf = infnext)
362 {
363 infnext = inf->next;
364 if ((*callback) (inf, data))
365 return inf;
366 }
367
368 return NULL;
369}
370
b77209e0
PA
371int
372have_inferiors (void)
373{
6c95b8df
PA
374 struct inferior *inf;
375
376 for (inf = inferior_list; inf; inf = inf->next)
377 if (inf->pid != 0)
378 return 1;
379
380 return 0;
b77209e0
PA
381}
382
8020350c
DB
383/* Return the number of live inferiors. We account for the case
384 where an inferior might have a non-zero pid but no threads, as
385 in the middle of a 'mourn' operation. */
386
c35b1492 387int
8020350c 388number_of_live_inferiors (void)
c35b1492 389{
cd2effb2 390 struct inferior *inf;
8020350c 391 int num_inf = 0;
6c95b8df 392
cd2effb2
JK
393 for (inf = inferior_list; inf; inf = inf->next)
394 if (inf->pid != 0)
395 {
396 struct thread_info *tp;
8020350c
DB
397
398 ALL_NON_EXITED_THREADS (tp)
399 if (tp && ptid_get_pid (tp->ptid) == inf->pid)
400 if (target_has_execution_1 (tp->ptid))
401 {
402 /* Found a live thread in this inferior, go to the next
403 inferior. */
404 ++num_inf;
405 break;
406 }
cd2effb2
JK
407 }
408
8020350c
DB
409 return num_inf;
410}
411
412/* Return true if there is at least one live inferior. */
413
414int
415have_live_inferiors (void)
416{
417 return number_of_live_inferiors () > 0;
6c95b8df
PA
418}
419
bed8455c
DE
420/* Prune away any unused inferiors, and then prune away no longer used
421 program spaces. */
6c95b8df
PA
422
423void
424prune_inferiors (void)
425{
426 struct inferior *ss, **ss_link;
6c95b8df
PA
427
428 ss = inferior_list;
429 ss_link = &inferior_list;
430 while (ss)
431 {
3a3fd0fd 432 if (!ss->deletable ()
6c95b8df
PA
433 || !ss->removable
434 || ss->pid != 0)
435 {
436 ss_link = &ss->next;
437 ss = *ss_link;
438 continue;
439 }
440
441 *ss_link = ss->next;
7a41607e 442 delete_inferior (ss);
6c95b8df
PA
443 ss = *ss_link;
444 }
6c95b8df
PA
445}
446
447/* Simply returns the count of inferiors. */
448
449int
450number_of_inferiors (void)
451{
452 struct inferior *inf;
453 int count = 0;
454
455 for (inf = inferior_list; inf != NULL; inf = inf->next)
456 count++;
457
458 return count;
c35b1492
PA
459}
460
db2b9fdd
PA
461/* Converts an inferior process id to a string. Like
462 target_pid_to_str, but special cases the null process. */
463
7a114964 464static const char *
db2b9fdd
PA
465inferior_pid_to_str (int pid)
466{
467 if (pid != 0)
468 return target_pid_to_str (pid_to_ptid (pid));
469 else
470 return _("<null>");
471}
472
4034d0ff
AT
473/* See inferior.h. */
474
475void
476print_selected_inferior (struct ui_out *uiout)
477{
4034d0ff 478 struct inferior *inf = current_inferior ();
53488a6e 479 const char *filename = inf->pspace->pspace_exec_filename;
112e8700 480
53488a6e
TS
481 if (filename == NULL)
482 filename = _("<noexec>");
112e8700
SM
483
484 uiout->message (_("[Switching to inferior %d [%s] (%s)]\n"),
53488a6e 485 inf->num, inferior_pid_to_str (inf->pid), filename);
4034d0ff
AT
486}
487
b77209e0
PA
488/* Prints the list of inferiors and their details on UIOUT. This is a
489 version of 'info_inferior_command' suitable for use from MI.
490
c82c0b55
MS
491 If REQUESTED_INFERIORS is not NULL, it's a list of GDB ids of the
492 inferiors that should be printed. Otherwise, all inferiors are
493 printed. */
494
495static void
1d12d88f 496print_inferior (struct ui_out *uiout, const char *requested_inferiors)
b77209e0
PA
497{
498 struct inferior *inf;
8bb318c6 499 int inf_count = 0;
b77209e0 500
8bb318c6
TT
501 /* Compute number of inferiors we will print. */
502 for (inf = inferior_list; inf; inf = inf->next)
503 {
c82c0b55 504 if (!number_is_in_list (requested_inferiors, inf->num))
8bb318c6
TT
505 continue;
506
507 ++inf_count;
508 }
509
510 if (inf_count == 0)
511 {
112e8700 512 uiout->message ("No inferiors.\n");
8bb318c6
TT
513 return;
514 }
515
4a2b031d 516 ui_out_emit_table table_emitter (uiout, 4, inf_count, "inferiors");
112e8700
SM
517 uiout->table_header (1, ui_left, "current", "");
518 uiout->table_header (4, ui_left, "number", "Num");
519 uiout->table_header (17, ui_left, "target-id", "Description");
520 uiout->table_header (17, ui_left, "exec", "Executable");
b77209e0 521
112e8700 522 uiout->table_body ();
b77209e0
PA
523 for (inf = inferior_list; inf; inf = inf->next)
524 {
c82c0b55 525 if (!number_is_in_list (requested_inferiors, inf->num))
b77209e0
PA
526 continue;
527
2e783024 528 ui_out_emit_tuple tuple_emitter (uiout, NULL);
b77209e0 529
6c95b8df 530 if (inf == current_inferior ())
112e8700 531 uiout->field_string ("current", "*");
b77209e0 532 else
112e8700 533 uiout->field_skip ("current");
b77209e0 534
112e8700 535 uiout->field_int ("number", inf->num);
6c95b8df 536
112e8700 537 uiout->field_string ("target-id", inferior_pid_to_str (inf->pid));
6c95b8df 538
1f0c4988 539 if (inf->pspace->pspace_exec_filename != NULL)
112e8700 540 uiout->field_string ("exec", inf->pspace->pspace_exec_filename);
6c95b8df 541 else
112e8700 542 uiout->field_skip ("exec");
6c95b8df
PA
543
544 /* Print extra info that isn't really fit to always present in
545 tabular form. Currently we print the vfork parent/child
546 relationships, if any. */
547 if (inf->vfork_parent)
548 {
112e8700
SM
549 uiout->text (_("\n\tis vfork child of inferior "));
550 uiout->field_int ("vfork-parent", inf->vfork_parent->num);
6c95b8df
PA
551 }
552 if (inf->vfork_child)
553 {
112e8700
SM
554 uiout->text (_("\n\tis vfork parent of inferior "));
555 uiout->field_int ("vfork-child", inf->vfork_child->num);
6c95b8df 556 }
b77209e0 557
112e8700 558 uiout->text ("\n");
b77209e0 559 }
b77209e0
PA
560}
561
2277426b 562static void
e503b191 563detach_inferior_command (const char *args, int from_tty)
2277426b 564{
2277426b 565 if (!args || !*args)
af624141 566 error (_("Requires argument (inferior id(s) to detach)"));
2277426b 567
bfd28288
PA
568 number_or_range_parser parser (args);
569 while (!parser.finished ())
af624141 570 {
bfd28288 571 int num = parser.get_number ();
2277426b 572
00431a78
PA
573 inferior *inf = find_inferior_id (num);
574 if (inf == NULL)
af624141
MS
575 {
576 warning (_("Inferior ID %d not known."), num);
577 continue;
578 }
2277426b 579
00431a78 580 if (inf->pid == 0)
e3ae3c43
PP
581 {
582 warning (_("Inferior ID %d is not running."), num);
583 continue;
584 }
2277426b 585
00431a78
PA
586 thread_info *tp = any_thread_of_inferior (inf);
587 if (tp == NULL)
af624141
MS
588 {
589 warning (_("Inferior ID %d has no threads."), num);
590 continue;
591 }
2277426b 592
00431a78 593 switch_to_thread (tp);
2277426b 594
af624141
MS
595 detach_command (NULL, from_tty);
596 }
2277426b
PA
597}
598
599static void
e503b191 600kill_inferior_command (const char *args, int from_tty)
2277426b 601{
2277426b 602 if (!args || !*args)
af624141 603 error (_("Requires argument (inferior id(s) to kill)"));
2277426b 604
bfd28288
PA
605 number_or_range_parser parser (args);
606 while (!parser.finished ())
af624141 607 {
bfd28288 608 int num = parser.get_number ();
2277426b 609
00431a78
PA
610 inferior *inf = find_inferior_id (num);
611 if (inf == NULL)
af624141
MS
612 {
613 warning (_("Inferior ID %d not known."), num);
614 continue;
615 }
2277426b 616
00431a78 617 if (inf->pid == 0)
e3ae3c43
PP
618 {
619 warning (_("Inferior ID %d is not running."), num);
620 continue;
621 }
2277426b 622
00431a78
PA
623 thread_info *tp = any_thread_of_inferior (inf);
624 if (tp == NULL)
af624141
MS
625 {
626 warning (_("Inferior ID %d has no threads."), num);
627 continue;
628 }
2277426b 629
00431a78 630 switch_to_thread (tp);
2277426b 631
af624141
MS
632 target_kill ();
633 }
2277426b
PA
634
635 bfd_cache_close_all ();
636}
637
638static void
e503b191 639inferior_command (const char *args, int from_tty)
2277426b 640{
6c95b8df
PA
641 struct inferior *inf;
642 int num;
2277426b
PA
643
644 num = parse_and_eval_long (args);
645
6c95b8df
PA
646 inf = find_inferior_id (num);
647 if (inf == NULL)
2277426b
PA
648 error (_("Inferior ID %d not known."), num);
649
6c95b8df 650 if (inf->pid != 0)
2277426b 651 {
00431a78 652 if (inf != current_inferior ())
6c95b8df 653 {
00431a78
PA
654 thread_info *tp = any_thread_of_inferior (inf);
655 if (tp == NULL)
6c95b8df 656 error (_("Inferior has no threads."));
2277426b 657
00431a78 658 switch_to_thread (tp);
6c95b8df
PA
659 }
660
76727919 661 gdb::observers::user_selected_context_changed.notify
4034d0ff
AT
662 (USER_SELECTED_INFERIOR
663 | USER_SELECTED_THREAD
664 | USER_SELECTED_FRAME);
2277426b 665 }
6c95b8df
PA
666 else
667 {
6c95b8df 668 set_current_inferior (inf);
00431a78 669 switch_to_no_thread ();
6c95b8df 670 set_current_program_space (inf->pspace);
2277426b 671
76727919
TT
672 gdb::observers::user_selected_context_changed.notify
673 (USER_SELECTED_INFERIOR);
2277426b
PA
674 }
675}
676
b77209e0
PA
677/* Print information about currently known inferiors. */
678
679static void
1d12d88f 680info_inferiors_command (const char *args, int from_tty)
b77209e0 681{
79a45e25 682 print_inferior (current_uiout, args);
b77209e0
PA
683}
684
6c95b8df
PA
685/* remove-inferior ID */
686
70221824 687static void
0b39b52e 688remove_inferior_command (const char *args, int from_tty)
6c95b8df 689{
af624141
MS
690 if (args == NULL || *args == '\0')
691 error (_("Requires an argument (inferior id(s) to remove)"));
6c95b8df 692
bfd28288
PA
693 number_or_range_parser parser (args);
694 while (!parser.finished ())
af624141 695 {
bfd28288
PA
696 int num = parser.get_number ();
697 struct inferior *inf = find_inferior_id (num);
6c95b8df 698
af624141
MS
699 if (inf == NULL)
700 {
701 warning (_("Inferior ID %d not known."), num);
702 continue;
703 }
704
3a3fd0fd 705 if (!inf->deletable ())
af624141 706 {
eb2332d7 707 warning (_("Can not remove current inferior %d."), num);
af624141
MS
708 continue;
709 }
8fa067af 710
af624141
MS
711 if (inf->pid != 0)
712 {
713 warning (_("Can not remove active inferior %d."), num);
714 continue;
715 }
6c95b8df 716
7a41607e 717 delete_inferior (inf);
af624141 718 }
6c95b8df
PA
719}
720
a79b8f6e
VP
721struct inferior *
722add_inferior_with_spaces (void)
723{
724 struct address_space *aspace;
725 struct program_space *pspace;
726 struct inferior *inf;
6ecd4729 727 struct gdbarch_info info;
a79b8f6e
VP
728
729 /* If all inferiors share an address space on this system, this
730 doesn't really return a new address space; otherwise, it
731 really does. */
732 aspace = maybe_new_address_space ();
564b1e3f 733 pspace = new program_space (aspace);
a79b8f6e
VP
734 inf = add_inferior (0);
735 inf->pspace = pspace;
736 inf->aspace = pspace->aspace;
737
6ecd4729
PA
738 /* Setup the inferior's initial arch, based on information obtained
739 from the global "set ..." options. */
740 gdbarch_info_init (&info);
741 inf->gdbarch = gdbarch_find_by_info (info);
742 /* The "set ..." options reject invalid settings, so we should
743 always have a valid arch by now. */
744 gdb_assert (inf->gdbarch != NULL);
745
a79b8f6e
VP
746 return inf;
747}
6c95b8df
PA
748
749/* add-inferior [-copies N] [-exec FILENAME] */
750
70221824 751static void
0b39b52e 752add_inferior_command (const char *args, int from_tty)
6c95b8df
PA
753{
754 int i, copies = 1;
773a1edc 755 gdb::unique_xmalloc_ptr<char> exec;
ecf45d2c 756 symfile_add_flags add_flags = 0;
6c95b8df 757
ecf45d2c
SL
758 if (from_tty)
759 add_flags |= SYMFILE_VERBOSE;
760
6c95b8df
PA
761 if (args)
762 {
773a1edc 763 gdb_argv built_argv (args);
6c95b8df 764
773a1edc 765 for (char **argv = built_argv.get (); *argv != NULL; argv++)
6c95b8df
PA
766 {
767 if (**argv == '-')
768 {
769 if (strcmp (*argv, "-copies") == 0)
770 {
771 ++argv;
772 if (!*argv)
773 error (_("No argument to -copies"));
774 copies = parse_and_eval_long (*argv);
775 }
776 else if (strcmp (*argv, "-exec") == 0)
777 {
778 ++argv;
779 if (!*argv)
780 error (_("No argument to -exec"));
773a1edc 781 exec.reset (tilde_expand (*argv));
6c95b8df
PA
782 }
783 }
784 else
785 error (_("Invalid argument"));
786 }
787 }
788
5ed8105e 789 scoped_restore_current_pspace_and_thread restore_pspace_thread;
6c95b8df
PA
790
791 for (i = 0; i < copies; ++i)
792 {
a79b8f6e 793 struct inferior *inf = add_inferior_with_spaces ();
6c95b8df
PA
794
795 printf_filtered (_("Added inferior %d\n"), inf->num);
796
797 if (exec != NULL)
798 {
799 /* Switch over temporarily, while reading executable and
1777feb0 800 symbols.q. */
a79b8f6e 801 set_current_program_space (inf->pspace);
6c95b8df 802 set_current_inferior (inf);
00431a78 803 switch_to_no_thread ();
6c95b8df 804
773a1edc
TT
805 exec_file_attach (exec.get (), from_tty);
806 symbol_file_add_main (exec.get (), add_flags);
6c95b8df
PA
807 }
808 }
6c95b8df
PA
809}
810
811/* clone-inferior [-copies N] [ID] */
812
70221824 813static void
0b39b52e 814clone_inferior_command (const char *args, int from_tty)
6c95b8df
PA
815{
816 int i, copies = 1;
6c95b8df 817 struct inferior *orginf = NULL;
6c95b8df
PA
818
819 if (args)
820 {
773a1edc 821 gdb_argv built_argv (args);
6c95b8df 822
773a1edc 823 char **argv = built_argv.get ();
6c95b8df
PA
824 for (; *argv != NULL; argv++)
825 {
826 if (**argv == '-')
827 {
828 if (strcmp (*argv, "-copies") == 0)
829 {
830 ++argv;
831 if (!*argv)
832 error (_("No argument to -copies"));
833 copies = parse_and_eval_long (*argv);
834
835 if (copies < 0)
836 error (_("Invalid copies number"));
837 }
838 }
839 else
840 {
841 if (orginf == NULL)
842 {
843 int num;
844
845 /* The first non-option (-) argument specified the
846 program space ID. */
847 num = parse_and_eval_long (*argv);
848 orginf = find_inferior_id (num);
849
850 if (orginf == NULL)
851 error (_("Inferior ID %d not known."), num);
852 continue;
853 }
854 else
855 error (_("Invalid argument"));
856 }
857 }
858 }
859
860 /* If no inferior id was specified, then the user wants to clone the
861 current inferior. */
862 if (orginf == NULL)
863 orginf = current_inferior ();
864
5ed8105e 865 scoped_restore_current_pspace_and_thread restore_pspace_thread;
6c95b8df
PA
866
867 for (i = 0; i < copies; ++i)
868 {
869 struct address_space *aspace;
870 struct program_space *pspace;
871 struct inferior *inf;
872
873 /* If all inferiors share an address space on this system, this
874 doesn't really return a new address space; otherwise, it
875 really does. */
876 aspace = maybe_new_address_space ();
564b1e3f 877 pspace = new program_space (aspace);
6c95b8df
PA
878 inf = add_inferior (0);
879 inf->pspace = pspace;
880 inf->aspace = pspace->aspace;
6ecd4729
PA
881 inf->gdbarch = orginf->gdbarch;
882
883 /* If the original inferior had a user specified target
884 description, make the clone use it too. */
885 if (target_desc_info_from_user_p (inf->tdesc_info))
886 copy_inferior_target_desc_info (inf, orginf);
6c95b8df
PA
887
888 printf_filtered (_("Added inferior %d.\n"), inf->num);
889
890 set_current_inferior (inf);
00431a78 891 switch_to_no_thread ();
6c95b8df
PA
892 clone_program_space (pspace, orginf->pspace);
893 }
6c95b8df
PA
894}
895
b77209e0
PA
896/* Print notices when new inferiors are created and die. */
897static void
898show_print_inferior_events (struct ui_file *file, int from_tty,
899 struct cmd_list_element *c, const char *value)
900{
901 fprintf_filtered (file, _("Printing of inferior events is %s.\n"), value);
902}
903
e3940304
PA
904/* Return a new value for the selected inferior's id. */
905
906static struct value *
907inferior_id_make_value (struct gdbarch *gdbarch, struct internalvar *var,
908 void *ignore)
909{
910 struct inferior *inf = current_inferior ();
911
912 return value_from_longest (builtin_type (gdbarch)->builtin_int, inf->num);
913}
914
915/* Implementation of `$_inferior' variable. */
916
917static const struct internalvar_funcs inferior_funcs =
918{
919 inferior_id_make_value,
920 NULL,
921 NULL
922};
923
6c95b8df
PA
924\f
925
6c95b8df
PA
926void
927initialize_inferiors (void)
928{
06da564e
EZ
929 struct cmd_list_element *c = NULL;
930
6c95b8df
PA
931 /* There's always one inferior. Note that this function isn't an
932 automatic _initialize_foo function, since other _initialize_foo
933 routines may need to install their per-inferior data keys. We
934 can only allocate an inferior when all those modules have done
935 that. Do this after initialize_progspace, due to the
936 current_program_space reference. */
f67c0c91 937 current_inferior_ = add_inferior_silent (0);
3a3fd0fd 938 current_inferior_->incref ();
6c95b8df
PA
939 current_inferior_->pspace = current_program_space;
940 current_inferior_->aspace = current_program_space->aspace;
6ecd4729
PA
941 /* The architecture will be initialized shortly, by
942 initialize_current_architecture. */
6c95b8df 943
a3c25011
TT
944 add_info ("inferiors", info_inferiors_command,
945 _("Print a list of inferiors being managed.\n\
946Usage: info inferiors [ID]...\n\
947If IDs are specified, the list is limited to just those inferiors.\n\
948By default all inferiors are displayed."));
b77209e0 949
06da564e 950 c = add_com ("add-inferior", no_class, add_inferior_command, _("\
6c95b8df 951Add a new inferior.\n\
a3c25011 952Usage: add-inferior [-copies N] [-exec FILENAME]\n\
af624141 953N is the optional number of inferiors to add, default is 1.\n\
6c95b8df
PA
954FILENAME is the file name of the executable to use\n\
955as main program."));
06da564e 956 set_cmd_completer (c, filename_completer);
6c95b8df 957
af624141
MS
958 add_com ("remove-inferiors", no_class, remove_inferior_command, _("\
959Remove inferior ID (or list of IDs).\n\
960Usage: remove-inferiors ID..."));
6c95b8df
PA
961
962 add_com ("clone-inferior", no_class, clone_inferior_command, _("\
963Clone inferior ID.\n\
a3c25011 964Usage: clone-inferior [-copies N] [ID]\n\
6c95b8df
PA
965Add N copies of inferior ID. The new inferior has the same\n\
966executable loaded as the copied inferior. If -copies is not specified,\n\
967adds 1 copy. If ID is not specified, it is the current inferior\n\
968that is cloned."));
2277426b 969
af624141 970 add_cmd ("inferiors", class_run, detach_inferior_command, _("\
a3c25011
TT
971Detach from inferior ID (or list of IDS).\n\
972Usage; detach inferiors ID..."),
2277426b
PA
973 &detachlist);
974
af624141 975 add_cmd ("inferiors", class_run, kill_inferior_command, _("\
a3c25011
TT
976Kill inferior ID (or list of IDs).\n\
977Usage: kill inferiors ID..."),
2277426b
PA
978 &killlist);
979
980 add_cmd ("inferior", class_run, inferior_command, _("\
981Use this command to switch between inferiors.\n\
a3c25011 982Usage: inferior ID\n\
2277426b
PA
983The new inferior ID must be currently known."),
984 &cmdlist);
6c95b8df
PA
985
986 add_setshow_boolean_cmd ("inferior-events", no_class,
987 &print_inferior_events, _("\
988Set printing of inferior events (e.g., inferior start and exit)."), _("\
989Show printing of inferior events (e.g., inferior start and exit)."), NULL,
990 NULL,
991 show_print_inferior_events,
992 &setprintlist, &showprintlist);
993
e3940304 994 create_internalvar_type_lazy ("_inferior", &inferior_funcs, NULL);
b77209e0 995}
This page took 0.948729 seconds and 4 git commands to generate.