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