gdb/inferior.c

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