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