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