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