28a520052ccd98f86639b0e3cb40061b906c0f18
[deliverable/binutils-gdb.git] / gdb / inferior.c
1 /* Multi-process control for GDB, the GNU debugger.
2
3 Copyright (C) 2008-2013 Free Software Foundation, Inc.
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"
21 #include "exec.h"
22 #include "inferior.h"
23 #include "target.h"
24 #include "command.h"
25 #include "completer.h"
26 #include "gdbcmd.h"
27 #include "gdbthread.h"
28 #include "ui-out.h"
29 #include "observer.h"
30 #include "gdbthread.h"
31 #include "gdbcore.h"
32 #include "symfile.h"
33 #include "environ.h"
34 #include "cli/cli-utils.h"
35 #include "continuations.h"
36 #include "arch-utils.h"
37 #include "target-descriptions.h"
38 #include "readline/tilde.h"
39
40 void _initialize_inferiors (void);
41
42 /* Keep a registry of per-inferior data-pointers required by other GDB
43 modules. */
44
45 DEFINE_REGISTRY (inferior, REGISTRY_ACCESS_FIELD)
46
47 struct inferior *inferior_list = NULL;
48 static int highest_inferior_num;
49
50 /* Print notices on inferior events (attach, detach, etc.), set with
51 `set print inferior-events'. */
52 static int print_inferior_events = 0;
53
54 /* The Current Inferior. */
55 static struct inferior *current_inferior_ = NULL;
56
57 struct inferior*
58 current_inferior (void)
59 {
60 return current_inferior_;
61 }
62
63 void
64 set_current_inferior (struct inferior *inf)
65 {
66 /* There's always an inferior. */
67 gdb_assert (inf != NULL);
68
69 current_inferior_ = inf;
70 }
71
72 /* A cleanups callback, helper for save_current_program_space
73 below. */
74
75 static void
76 restore_inferior (void *arg)
77 {
78 struct inferior *saved_inferior = arg;
79
80 set_current_inferior (saved_inferior);
81 }
82
83 /* Save the current program space so that it may be restored by a later
84 call to do_cleanups. Returns the struct cleanup pointer needed for
85 later doing the cleanup. */
86
87 struct cleanup *
88 save_current_inferior (void)
89 {
90 struct cleanup *old_chain = make_cleanup (restore_inferior,
91 current_inferior_);
92
93 return old_chain;
94 }
95
96 static void
97 free_inferior (struct inferior *inf)
98 {
99 discard_all_inferior_continuations (inf);
100 inferior_free_data (inf);
101 xfree (inf->args);
102 xfree (inf->terminal);
103 free_environ (inf->environment);
104 target_desc_info_free (inf->tdesc_info);
105 xfree (inf->private);
106 xfree (inf);
107 }
108
109 void
110 init_inferior_list (void)
111 {
112 struct inferior *inf, *infnext;
113
114 highest_inferior_num = 0;
115 if (!inferior_list)
116 return;
117
118 for (inf = inferior_list; inf; inf = infnext)
119 {
120 infnext = inf->next;
121 free_inferior (inf);
122 }
123
124 inferior_list = NULL;
125 }
126
127 struct inferior *
128 add_inferior_silent (int pid)
129 {
130 struct inferior *inf;
131
132 inf = xmalloc (sizeof (*inf));
133 memset (inf, 0, sizeof (*inf));
134 inf->pid = pid;
135
136 inf->control.stop_soon = NO_STOP_QUIETLY;
137
138 inf->num = ++highest_inferior_num;
139 inf->next = inferior_list;
140 inferior_list = inf;
141
142 inf->environment = make_environ ();
143 init_environ (inf->environment);
144
145 inferior_alloc_data (inf);
146
147 observer_notify_inferior_added (inf);
148
149 if (pid != 0)
150 inferior_appeared (inf, pid);
151
152 return inf;
153 }
154
155 struct inferior *
156 add_inferior (int pid)
157 {
158 struct inferior *inf = add_inferior_silent (pid);
159
160 if (print_inferior_events)
161 printf_unfiltered (_("[New inferior %d]\n"), pid);
162
163 return inf;
164 }
165
166 struct delete_thread_of_inferior_arg
167 {
168 int pid;
169 int silent;
170 };
171
172 static int
173 delete_thread_of_inferior (struct thread_info *tp, void *data)
174 {
175 struct delete_thread_of_inferior_arg *arg = data;
176
177 if (ptid_get_pid (tp->ptid) == arg->pid)
178 {
179 if (arg->silent)
180 delete_thread_silent (tp->ptid);
181 else
182 delete_thread (tp->ptid);
183 }
184
185 return 0;
186 }
187
188 /* If SILENT then be quiet -- don't announce a inferior death, or the
189 exit of its threads. */
190
191 void
192 delete_inferior_1 (struct inferior *todel, int silent)
193 {
194 struct inferior *inf, *infprev;
195 struct delete_thread_of_inferior_arg arg;
196
197 infprev = NULL;
198
199 for (inf = inferior_list; inf; infprev = inf, inf = inf->next)
200 if (inf == todel)
201 break;
202
203 if (!inf)
204 return;
205
206 arg.pid = inf->pid;
207 arg.silent = silent;
208
209 iterate_over_threads (delete_thread_of_inferior, &arg);
210
211 if (infprev)
212 infprev->next = inf->next;
213 else
214 inferior_list = inf->next;
215
216 observer_notify_inferior_removed (inf);
217
218 free_inferior (inf);
219 }
220
221 void
222 delete_inferior (int pid)
223 {
224 struct inferior *inf = find_inferior_pid (pid);
225
226 delete_inferior_1 (inf, 0);
227
228 if (print_inferior_events)
229 printf_unfiltered (_("[Inferior %d exited]\n"), pid);
230 }
231
232 void
233 delete_inferior_silent (int pid)
234 {
235 struct inferior *inf = find_inferior_pid (pid);
236
237 delete_inferior_1 (inf, 1);
238 }
239
240
241 /* If SILENT then be quiet -- don't announce a inferior exit, or the
242 exit of its threads. */
243
244 static void
245 exit_inferior_1 (struct inferior *inftoex, int silent)
246 {
247 struct inferior *inf;
248 struct delete_thread_of_inferior_arg arg;
249
250 for (inf = inferior_list; inf; inf = inf->next)
251 if (inf == inftoex)
252 break;
253
254 if (!inf)
255 return;
256
257 arg.pid = inf->pid;
258 arg.silent = silent;
259
260 iterate_over_threads (delete_thread_of_inferior, &arg);
261
262 /* Notify the observers before removing the inferior from the list,
263 so that the observers have a chance to look it up. */
264 observer_notify_inferior_exit (inf);
265
266 inf->pid = 0;
267 inf->fake_pid_p = 0;
268 if (inf->vfork_parent != NULL)
269 {
270 inf->vfork_parent->vfork_child = NULL;
271 inf->vfork_parent = NULL;
272 }
273 if (inf->vfork_child != NULL)
274 {
275 inf->vfork_child->vfork_parent = NULL;
276 inf->vfork_child = NULL;
277 }
278
279 inf->has_exit_code = 0;
280 inf->exit_code = 0;
281 inf->pending_detach = 0;
282 }
283
284 void
285 exit_inferior (int pid)
286 {
287 struct inferior *inf = find_inferior_pid (pid);
288
289 exit_inferior_1 (inf, 0);
290
291 if (print_inferior_events)
292 printf_unfiltered (_("[Inferior %d exited]\n"), pid);
293 }
294
295 void
296 exit_inferior_silent (int pid)
297 {
298 struct inferior *inf = find_inferior_pid (pid);
299
300 exit_inferior_1 (inf, 1);
301 }
302
303 void
304 exit_inferior_num_silent (int num)
305 {
306 struct inferior *inf = find_inferior_id (num);
307
308 exit_inferior_1 (inf, 1);
309 }
310
311 void
312 detach_inferior (int pid)
313 {
314 struct inferior *inf = find_inferior_pid (pid);
315
316 exit_inferior_1 (inf, 1);
317
318 if (print_inferior_events)
319 printf_unfiltered (_("[Inferior %d detached]\n"), pid);
320 }
321
322 void
323 inferior_appeared (struct inferior *inf, int pid)
324 {
325 inf->pid = pid;
326
327 observer_notify_inferior_appeared (inf);
328 }
329
330 void
331 discard_all_inferiors (void)
332 {
333 struct inferior *inf;
334
335 for (inf = inferior_list; inf; inf = inf->next)
336 {
337 if (inf->pid != 0)
338 exit_inferior_silent (inf->pid);
339 }
340 }
341
342 struct inferior *
343 find_inferior_id (int num)
344 {
345 struct inferior *inf;
346
347 for (inf = inferior_list; inf; inf = inf->next)
348 if (inf->num == num)
349 return inf;
350
351 return NULL;
352 }
353
354 struct inferior *
355 find_inferior_pid (int pid)
356 {
357 struct inferior *inf;
358
359 /* Looking for inferior pid == 0 is always wrong, and indicative of
360 a bug somewhere else. There may be more than one with pid == 0,
361 for instance. */
362 gdb_assert (pid != 0);
363
364 for (inf = inferior_list; inf; inf = inf->next)
365 if (inf->pid == pid)
366 return inf;
367
368 return NULL;
369 }
370
371 /* Find an inferior bound to PSPACE. */
372
373 struct inferior *
374 find_inferior_for_program_space (struct program_space *pspace)
375 {
376 struct inferior *inf;
377
378 for (inf = inferior_list; inf != NULL; inf = inf->next)
379 {
380 if (inf->pspace == pspace)
381 return inf;
382 }
383
384 return NULL;
385 }
386
387 struct inferior *
388 iterate_over_inferiors (int (*callback) (struct inferior *, void *),
389 void *data)
390 {
391 struct inferior *inf, *infnext;
392
393 for (inf = inferior_list; inf; inf = infnext)
394 {
395 infnext = inf->next;
396 if ((*callback) (inf, data))
397 return inf;
398 }
399
400 return NULL;
401 }
402
403 int
404 valid_gdb_inferior_id (int num)
405 {
406 struct inferior *inf;
407
408 for (inf = inferior_list; inf; inf = inf->next)
409 if (inf->num == num)
410 return 1;
411
412 return 0;
413 }
414
415 int
416 pid_to_gdb_inferior_id (int pid)
417 {
418 struct inferior *inf;
419
420 for (inf = inferior_list; inf; inf = inf->next)
421 if (inf->pid == pid)
422 return inf->num;
423
424 return 0;
425 }
426
427 int
428 gdb_inferior_id_to_pid (int num)
429 {
430 struct inferior *inferior = find_inferior_id (num);
431 if (inferior)
432 return inferior->pid;
433 else
434 return -1;
435 }
436
437 int
438 in_inferior_list (int pid)
439 {
440 struct inferior *inf;
441
442 for (inf = inferior_list; inf; inf = inf->next)
443 if (inf->pid == pid)
444 return 1;
445
446 return 0;
447 }
448
449 int
450 have_inferiors (void)
451 {
452 struct inferior *inf;
453
454 for (inf = inferior_list; inf; inf = inf->next)
455 if (inf->pid != 0)
456 return 1;
457
458 return 0;
459 }
460
461 int
462 have_live_inferiors (void)
463 {
464 struct inferior *inf;
465
466 for (inf = inferior_list; inf; inf = inf->next)
467 if (inf->pid != 0)
468 {
469 struct thread_info *tp;
470
471 tp = any_thread_of_process (inf->pid);
472 if (tp && target_has_execution_1 (tp->ptid))
473 break;
474 }
475
476 return inf != NULL;
477 }
478
479 /* Prune away automatically added program spaces that aren't required
480 anymore. */
481
482 void
483 prune_inferiors (void)
484 {
485 struct inferior *ss, **ss_link;
486 struct inferior *current = current_inferior ();
487
488 ss = inferior_list;
489 ss_link = &inferior_list;
490 while (ss)
491 {
492 if (ss == current
493 || !ss->removable
494 || ss->pid != 0)
495 {
496 ss_link = &ss->next;
497 ss = *ss_link;
498 continue;
499 }
500
501 *ss_link = ss->next;
502 delete_inferior_1 (ss, 1);
503 ss = *ss_link;
504 }
505
506 prune_program_spaces ();
507 }
508
509 /* Simply returns the count of inferiors. */
510
511 int
512 number_of_inferiors (void)
513 {
514 struct inferior *inf;
515 int count = 0;
516
517 for (inf = inferior_list; inf != NULL; inf = inf->next)
518 count++;
519
520 return count;
521 }
522
523 /* Converts an inferior process id to a string. Like
524 target_pid_to_str, but special cases the null process. */
525
526 static char *
527 inferior_pid_to_str (int pid)
528 {
529 if (pid != 0)
530 return target_pid_to_str (pid_to_ptid (pid));
531 else
532 return _("<null>");
533 }
534
535 /* Prints the list of inferiors and their details on UIOUT. This is a
536 version of 'info_inferior_command' suitable for use from MI.
537
538 If REQUESTED_INFERIORS is not NULL, it's a list of GDB ids of the
539 inferiors that should be printed. Otherwise, all inferiors are
540 printed. */
541
542 static void
543 print_inferior (struct ui_out *uiout, char *requested_inferiors)
544 {
545 struct inferior *inf;
546 struct cleanup *old_chain;
547 int inf_count = 0;
548
549 /* Compute number of inferiors we will print. */
550 for (inf = inferior_list; inf; inf = inf->next)
551 {
552 if (!number_is_in_list (requested_inferiors, inf->num))
553 continue;
554
555 ++inf_count;
556 }
557
558 if (inf_count == 0)
559 {
560 ui_out_message (uiout, 0, "No inferiors.\n");
561 return;
562 }
563
564 old_chain = make_cleanup_ui_out_table_begin_end (uiout, 4, inf_count,
565 "inferiors");
566 ui_out_table_header (uiout, 1, ui_left, "current", "");
567 ui_out_table_header (uiout, 4, ui_left, "number", "Num");
568 ui_out_table_header (uiout, 17, ui_left, "target-id", "Description");
569 ui_out_table_header (uiout, 17, ui_left, "exec", "Executable");
570
571 ui_out_table_body (uiout);
572 for (inf = inferior_list; inf; inf = inf->next)
573 {
574 struct cleanup *chain2;
575
576 if (!number_is_in_list (requested_inferiors, inf->num))
577 continue;
578
579 chain2 = make_cleanup_ui_out_tuple_begin_end (uiout, NULL);
580
581 if (inf == current_inferior ())
582 ui_out_field_string (uiout, "current", "*");
583 else
584 ui_out_field_skip (uiout, "current");
585
586 ui_out_field_int (uiout, "number", inf->num);
587
588 ui_out_field_string (uiout, "target-id",
589 inferior_pid_to_str (inf->pid));
590
591 if (inf->pspace->pspace_exec_filename != NULL)
592 ui_out_field_string (uiout, "exec", inf->pspace->pspace_exec_filename);
593 else
594 ui_out_field_skip (uiout, "exec");
595
596 /* Print extra info that isn't really fit to always present in
597 tabular form. Currently we print the vfork parent/child
598 relationships, if any. */
599 if (inf->vfork_parent)
600 {
601 ui_out_text (uiout, _("\n\tis vfork child of inferior "));
602 ui_out_field_int (uiout, "vfork-parent", inf->vfork_parent->num);
603 }
604 if (inf->vfork_child)
605 {
606 ui_out_text (uiout, _("\n\tis vfork parent of inferior "));
607 ui_out_field_int (uiout, "vfork-child", inf->vfork_child->num);
608 }
609
610 ui_out_text (uiout, "\n");
611 do_cleanups (chain2);
612 }
613
614 do_cleanups (old_chain);
615 }
616
617 static void
618 detach_inferior_command (char *args, int from_tty)
619 {
620 int num, pid;
621 struct thread_info *tp;
622 struct get_number_or_range_state state;
623
624 if (!args || !*args)
625 error (_("Requires argument (inferior id(s) to detach)"));
626
627 init_number_or_range (&state, args);
628 while (!state.finished)
629 {
630 num = get_number_or_range (&state);
631
632 if (!valid_gdb_inferior_id (num))
633 {
634 warning (_("Inferior ID %d not known."), num);
635 continue;
636 }
637
638 pid = gdb_inferior_id_to_pid (num);
639
640 tp = any_thread_of_process (pid);
641 if (!tp)
642 {
643 warning (_("Inferior ID %d has no threads."), num);
644 continue;
645 }
646
647 switch_to_thread (tp->ptid);
648
649 detach_command (NULL, from_tty);
650 }
651 }
652
653 static void
654 kill_inferior_command (char *args, int from_tty)
655 {
656 int num, pid;
657 struct thread_info *tp;
658 struct get_number_or_range_state state;
659
660 if (!args || !*args)
661 error (_("Requires argument (inferior id(s) to kill)"));
662
663 init_number_or_range (&state, args);
664 while (!state.finished)
665 {
666 num = get_number_or_range (&state);
667
668 if (!valid_gdb_inferior_id (num))
669 {
670 warning (_("Inferior ID %d not known."), num);
671 continue;
672 }
673
674 pid = gdb_inferior_id_to_pid (num);
675
676 tp = any_thread_of_process (pid);
677 if (!tp)
678 {
679 warning (_("Inferior ID %d has no threads."), num);
680 continue;
681 }
682
683 switch_to_thread (tp->ptid);
684
685 target_kill ();
686 }
687
688 bfd_cache_close_all ();
689 }
690
691 static void
692 inferior_command (char *args, int from_tty)
693 {
694 struct inferior *inf;
695 int num;
696
697 num = parse_and_eval_long (args);
698
699 inf = find_inferior_id (num);
700 if (inf == NULL)
701 error (_("Inferior ID %d not known."), num);
702
703 printf_filtered (_("[Switching to inferior %d [%s] (%s)]\n"),
704 inf->num,
705 inferior_pid_to_str (inf->pid),
706 (inf->pspace->pspace_exec_filename != NULL
707 ? inf->pspace->pspace_exec_filename
708 : _("<noexec>")));
709
710 if (inf->pid != 0)
711 {
712 if (inf->pid != ptid_get_pid (inferior_ptid))
713 {
714 struct thread_info *tp;
715
716 tp = any_thread_of_process (inf->pid);
717 if (!tp)
718 error (_("Inferior has no threads."));
719
720 switch_to_thread (tp->ptid);
721 }
722
723 printf_filtered (_("[Switching to thread %d (%s)] "),
724 pid_to_thread_id (inferior_ptid),
725 target_pid_to_str (inferior_ptid));
726 }
727 else
728 {
729 struct inferior *inf;
730
731 inf = find_inferior_id (num);
732 set_current_inferior (inf);
733 switch_to_thread (null_ptid);
734 set_current_program_space (inf->pspace);
735 }
736
737 if (inf->pid != 0 && is_running (inferior_ptid))
738 ui_out_text (current_uiout, "(running)\n");
739 else if (inf->pid != 0)
740 {
741 ui_out_text (current_uiout, "\n");
742 print_stack_frame (get_selected_frame (NULL), 1, SRC_AND_LOC, 1);
743 }
744 }
745
746 /* Print information about currently known inferiors. */
747
748 static void
749 info_inferiors_command (char *args, int from_tty)
750 {
751 print_inferior (current_uiout, args);
752 }
753
754 /* remove-inferior ID */
755
756 static void
757 remove_inferior_command (char *args, int from_tty)
758 {
759 int num;
760 struct inferior *inf;
761 struct get_number_or_range_state state;
762
763 if (args == NULL || *args == '\0')
764 error (_("Requires an argument (inferior id(s) to remove)"));
765
766 init_number_or_range (&state, args);
767 while (!state.finished)
768 {
769 num = get_number_or_range (&state);
770 inf = find_inferior_id (num);
771
772 if (inf == NULL)
773 {
774 warning (_("Inferior ID %d not known."), num);
775 continue;
776 }
777
778 if (inf == current_inferior ())
779 {
780 warning (_("Can not remove current symbol inferior %d."), num);
781 continue;
782 }
783
784 if (inf->pid != 0)
785 {
786 warning (_("Can not remove active inferior %d."), num);
787 continue;
788 }
789
790 delete_inferior_1 (inf, 1);
791 }
792 }
793
794 struct inferior *
795 add_inferior_with_spaces (void)
796 {
797 struct address_space *aspace;
798 struct program_space *pspace;
799 struct inferior *inf;
800 struct gdbarch_info info;
801
802 /* If all inferiors share an address space on this system, this
803 doesn't really return a new address space; otherwise, it
804 really does. */
805 aspace = maybe_new_address_space ();
806 pspace = add_program_space (aspace);
807 inf = add_inferior (0);
808 inf->pspace = pspace;
809 inf->aspace = pspace->aspace;
810
811 /* Setup the inferior's initial arch, based on information obtained
812 from the global "set ..." options. */
813 gdbarch_info_init (&info);
814 inf->gdbarch = gdbarch_find_by_info (info);
815 /* The "set ..." options reject invalid settings, so we should
816 always have a valid arch by now. */
817 gdb_assert (inf->gdbarch != NULL);
818
819 return inf;
820 }
821
822 /* add-inferior [-copies N] [-exec FILENAME] */
823
824 static void
825 add_inferior_command (char *args, int from_tty)
826 {
827 int i, copies = 1;
828 char *exec = NULL;
829 char **argv;
830 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
831
832 if (args)
833 {
834 argv = gdb_buildargv (args);
835 make_cleanup_freeargv (argv);
836
837 for (; *argv != NULL; argv++)
838 {
839 if (**argv == '-')
840 {
841 if (strcmp (*argv, "-copies") == 0)
842 {
843 ++argv;
844 if (!*argv)
845 error (_("No argument to -copies"));
846 copies = parse_and_eval_long (*argv);
847 }
848 else if (strcmp (*argv, "-exec") == 0)
849 {
850 ++argv;
851 if (!*argv)
852 error (_("No argument to -exec"));
853 exec = tilde_expand (*argv);
854 make_cleanup (xfree, exec);
855 }
856 }
857 else
858 error (_("Invalid argument"));
859 }
860 }
861
862 save_current_space_and_thread ();
863
864 for (i = 0; i < copies; ++i)
865 {
866 struct inferior *inf = add_inferior_with_spaces ();
867
868 printf_filtered (_("Added inferior %d\n"), inf->num);
869
870 if (exec != NULL)
871 {
872 /* Switch over temporarily, while reading executable and
873 symbols.q. */
874 set_current_program_space (inf->pspace);
875 set_current_inferior (inf);
876 switch_to_thread (null_ptid);
877
878 exec_file_attach (exec, from_tty);
879 symbol_file_add_main (exec, from_tty);
880 }
881 }
882
883 do_cleanups (old_chain);
884 }
885
886 /* clone-inferior [-copies N] [ID] */
887
888 static void
889 clone_inferior_command (char *args, int from_tty)
890 {
891 int i, copies = 1;
892 char **argv;
893 struct inferior *orginf = NULL;
894 struct cleanup *old_chain = make_cleanup (null_cleanup, NULL);
895
896 if (args)
897 {
898 argv = gdb_buildargv (args);
899 make_cleanup_freeargv (argv);
900
901 for (; *argv != NULL; argv++)
902 {
903 if (**argv == '-')
904 {
905 if (strcmp (*argv, "-copies") == 0)
906 {
907 ++argv;
908 if (!*argv)
909 error (_("No argument to -copies"));
910 copies = parse_and_eval_long (*argv);
911
912 if (copies < 0)
913 error (_("Invalid copies number"));
914 }
915 }
916 else
917 {
918 if (orginf == NULL)
919 {
920 int num;
921
922 /* The first non-option (-) argument specified the
923 program space ID. */
924 num = parse_and_eval_long (*argv);
925 orginf = find_inferior_id (num);
926
927 if (orginf == NULL)
928 error (_("Inferior ID %d not known."), num);
929 continue;
930 }
931 else
932 error (_("Invalid argument"));
933 }
934 }
935 }
936
937 /* If no inferior id was specified, then the user wants to clone the
938 current inferior. */
939 if (orginf == NULL)
940 orginf = current_inferior ();
941
942 save_current_space_and_thread ();
943
944 for (i = 0; i < copies; ++i)
945 {
946 struct address_space *aspace;
947 struct program_space *pspace;
948 struct inferior *inf;
949
950 /* If all inferiors share an address space on this system, this
951 doesn't really return a new address space; otherwise, it
952 really does. */
953 aspace = maybe_new_address_space ();
954 pspace = add_program_space (aspace);
955 inf = add_inferior (0);
956 inf->pspace = pspace;
957 inf->aspace = pspace->aspace;
958 inf->gdbarch = orginf->gdbarch;
959
960 /* If the original inferior had a user specified target
961 description, make the clone use it too. */
962 if (target_desc_info_from_user_p (inf->tdesc_info))
963 copy_inferior_target_desc_info (inf, orginf);
964
965 printf_filtered (_("Added inferior %d.\n"), inf->num);
966
967 set_current_inferior (inf);
968 switch_to_thread (null_ptid);
969 clone_program_space (pspace, orginf->pspace);
970 }
971
972 do_cleanups (old_chain);
973 }
974
975 /* Print notices when new inferiors are created and die. */
976 static void
977 show_print_inferior_events (struct ui_file *file, int from_tty,
978 struct cmd_list_element *c, const char *value)
979 {
980 fprintf_filtered (file, _("Printing of inferior events is %s.\n"), value);
981 }
982
983 \f
984
985 void
986 initialize_inferiors (void)
987 {
988 struct cmd_list_element *c = NULL;
989
990 /* There's always one inferior. Note that this function isn't an
991 automatic _initialize_foo function, since other _initialize_foo
992 routines may need to install their per-inferior data keys. We
993 can only allocate an inferior when all those modules have done
994 that. Do this after initialize_progspace, due to the
995 current_program_space reference. */
996 current_inferior_ = add_inferior (0);
997 current_inferior_->pspace = current_program_space;
998 current_inferior_->aspace = current_program_space->aspace;
999 /* The architecture will be initialized shortly, by
1000 initialize_current_architecture. */
1001
1002 add_info ("inferiors", info_inferiors_command,
1003 _("IDs of specified inferiors (all inferiors if no argument)."));
1004
1005 c = add_com ("add-inferior", no_class, add_inferior_command, _("\
1006 Add a new inferior.\n\
1007 Usage: add-inferior [-copies <N>] [-exec <FILENAME>]\n\
1008 N is the optional number of inferiors to add, default is 1.\n\
1009 FILENAME is the file name of the executable to use\n\
1010 as main program."));
1011 set_cmd_completer (c, filename_completer);
1012
1013 add_com ("remove-inferiors", no_class, remove_inferior_command, _("\
1014 Remove inferior ID (or list of IDs).\n\
1015 Usage: remove-inferiors ID..."));
1016
1017 add_com ("clone-inferior", no_class, clone_inferior_command, _("\
1018 Clone inferior ID.\n\
1019 Usage: clone-inferior [-copies <N>] [ID]\n\
1020 Add N copies of inferior ID. The new inferior has the same\n\
1021 executable loaded as the copied inferior. If -copies is not specified,\n\
1022 adds 1 copy. If ID is not specified, it is the current inferior\n\
1023 that is cloned."));
1024
1025 add_cmd ("inferiors", class_run, detach_inferior_command, _("\
1026 Detach from inferior ID (or list of IDS)."),
1027 &detachlist);
1028
1029 add_cmd ("inferiors", class_run, kill_inferior_command, _("\
1030 Kill inferior ID (or list of IDs)."),
1031 &killlist);
1032
1033 add_cmd ("inferior", class_run, inferior_command, _("\
1034 Use this command to switch between inferiors.\n\
1035 The new inferior ID must be currently known."),
1036 &cmdlist);
1037
1038 add_setshow_boolean_cmd ("inferior-events", no_class,
1039 &print_inferior_events, _("\
1040 Set printing of inferior events (e.g., inferior start and exit)."), _("\
1041 Show printing of inferior events (e.g., inferior start and exit)."), NULL,
1042 NULL,
1043 show_print_inferior_events,
1044 &setprintlist, &showprintlist);
1045
1046 }
This page took 0.06529 seconds and 4 git commands to generate.