gdb/inferior.c

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