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