gdb/inferior.c

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