gdb/inferior.c

   1 /* Multi-process control for GDB, the GNU debugger.
   2
   3    Copyright (C) 2008 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 "inferior.h"
  22 #include "target.h"
  23 #include "command.h"
  24 #include "gdbcmd.h"
  25 #include "gdbthread.h"
  26 #include "ui-out.h"
  27
  28 void _initialize_inferiors (void);
  29
  30 static struct inferior *inferior_list = NULL;
  31 static int highest_inferior_num;
  32
  33 /* Print notices on inferior events (attach, detach, etc.), set with
  34    `set print inferior-events'.  */
  35 static int print_inferior_events = 0;
  36
  37 struct inferior*
  38 current_inferior (void)
  39 {
  40   struct inferior *inf = find_inferior_pid (ptid_get_pid (inferior_ptid));
  41   gdb_assert (inf);
  42   return inf;
  43 }
  44
  45 static void
  46 free_inferior (struct inferior *inf)
  47 {
  48   xfree (inf->private);
  49   xfree (inf);
  50 }
  51
  52 void
  53 init_inferior_list (void)
  54 {
  55   struct inferior *inf, *infnext;
  56
  57   highest_inferior_num = 0;
  58   if (!inferior_list)
  59     return;
  60
  61   for (inf = inferior_list; inf; inf = infnext)
  62     {
  63       infnext = inf->next;
  64       free_inferior (inf);
  65     }
  66
  67   inferior_list = NULL;
  68 }
  69
  70 struct inferior *
  71 add_inferior_silent (int pid)
  72 {
  73   struct inferior *inf;
  74
  75   inf = xmalloc (sizeof (*inf));
  76   memset (inf, 0, sizeof (*inf));
  77   inf->pid = pid;
  78
  79   inf->stop_soon = NO_STOP_QUIETLY;
  80
  81   inf->num = ++highest_inferior_num;
  82   inf->next = inferior_list;
  83   inferior_list = inf;
  84
  85   return inf;
  86 }
  87
  88 struct inferior *
  89 add_inferior (int pid)
  90 {
  91   struct inferior *inf = add_inferior_silent (pid);
  92
  93   if (print_inferior_events)
  94     printf_unfiltered (_("[New inferior %d]\n"), pid);
  95
  96   return inf;
  97 }
  98
  99 struct delete_thread_of_inferior_arg
 100 {
 101   int pid;
 102   int silent;
 103 };
 104
 105 static int
 106 delete_thread_of_inferior (struct thread_info *tp, void *data)
 107 {
 108   struct delete_thread_of_inferior_arg *arg = data;
 109
 110   if (ptid_get_pid (tp->ptid) == arg->pid)
 111     {
 112       if (arg->silent)
 113         delete_thread_silent (tp->ptid);
 114       else
 115         delete_thread (tp->ptid);
 116     }
 117
 118   return 0;
 119 }
 120
 121 /* If SILENT then be quiet -- don't announce a inferior death, or the
 122    exit of its threads.  */
 123 static void
 124 delete_inferior_1 (int pid, int silent)
 125 {
 126   struct inferior *inf, *infprev;
 127   struct delete_thread_of_inferior_arg arg = { pid, silent };
 128
 129   infprev = NULL;
 130
 131   for (inf = inferior_list; inf; infprev = inf, inf = inf->next)
 132     if (inf->pid == pid)
 133       break;
 134
 135   if (!inf)
 136     return;
 137
 138   if (infprev)
 139     infprev->next = inf->next;
 140   else
 141     inferior_list = inf->next;
 142
 143   free_inferior (inf);
 144
 145   arg.pid = pid;
 146   arg.silent = silent;
 147
 148   iterate_over_threads (delete_thread_of_inferior, &arg);
 149 }
 150
 151 void
 152 delete_inferior (int pid)
 153 {
 154   delete_inferior_1 (pid, 0);
 155
 156   if (print_inferior_events)
 157     printf_unfiltered (_("[Inferior %d exited]\n"), pid);
 158 }
 159
 160 void
 161 delete_inferior_silent (int pid)
 162 {
 163   delete_inferior_1 (pid, 1);
 164 }
 165
 166 void
 167 detach_inferior (int pid)
 168 {
 169   delete_inferior_1 (pid, 1);
 170
 171   if (print_inferior_events)
 172     printf_unfiltered (_("[Inferior %d detached]\n"), pid);
 173 }
 174
 175 void
 176 discard_all_inferiors (void)
 177 {
 178   struct inferior *inf, *infnext;
 179
 180   for (inf = inferior_list; inf; inf = infnext)
 181     {
 182       infnext = inf->next;
 183       delete_inferior_silent (inf->pid);
 184     }
 185 }
 186
 187 static struct inferior *
 188 find_inferior_id (int num)
 189 {
 190   struct inferior *inf;
 191
 192   for (inf = inferior_list; inf; inf = inf->next)
 193     if (inf->num == num)
 194       return inf;
 195
 196   return NULL;
 197 }
 198
 199 struct inferior *
 200 find_inferior_pid (int pid)
 201 {
 202   struct inferior *inf;
 203
 204   for (inf = inferior_list; inf; inf = inf->next)
 205     if (inf->pid == pid)
 206       return inf;
 207
 208   return NULL;
 209 }
 210
 211 struct inferior *
 212 iterate_over_inferiors (int (*callback) (struct inferior *, void *),
 213                         void *data)
 214 {
 215   struct inferior *inf, *infnext;
 216
 217   for (inf = inferior_list; inf; inf = infnext)
 218     {
 219       infnext = inf->next;
 220       if ((*callback) (inf, data))
 221         return inf;
 222     }
 223
 224   return NULL;
 225 }
 226
 227 int
 228 valid_gdb_inferior_id (int num)
 229 {
 230   struct inferior *inf;
 231
 232   for (inf = inferior_list; inf; inf = inf->next)
 233     if (inf->num == num)
 234       return 1;
 235
 236   return 0;
 237 }
 238
 239 int
 240 pid_to_gdb_inferior_id (int pid)
 241 {
 242   struct inferior *inf;
 243
 244   for (inf = inferior_list; inf; inf = inf->next)
 245     if (inf->pid == pid)
 246       return inf->num;
 247
 248   return 0;
 249 }
 250
 251 int
 252 gdb_inferior_id_to_pid (int num)
 253 {
 254   struct inferior *inferior = find_inferior_id (num);
 255   if (inferior)
 256     return inferior->pid;
 257   else
 258     return -1;
 259 }
 260
 261 int
 262 in_inferior_list (int pid)
 263 {
 264   struct inferior *inf;
 265
 266   for (inf = inferior_list; inf; inf = inf->next)
 267     if (inf->pid == pid)
 268       return 1;
 269
 270   return 0;
 271 }
 272
 273 int
 274 have_inferiors (void)
 275 {
 276   return inferior_list != NULL;
 277 }
 278
 279 /* Prints the list of inferiors and their details on UIOUT.  This is a
 280    version of 'info_inferior_command' suitable for use from MI.
 281
 282    If REQUESTED_INFERIOR is not -1, it's the GDB id of the inferior that
 283    should be printed.  Otherwise, all inferiors are printed.  */
 284 void
 285 print_inferior (struct ui_out *uiout, int requested_inferior)
 286 {
 287   struct inferior *inf;
 288   struct cleanup *old_chain;
 289
 290   old_chain = make_cleanup_ui_out_list_begin_end (uiout, "inferiors");
 291
 292   for (inf = inferior_list; inf; inf = inf->next)
 293     {
 294       struct cleanup *chain2;
 295
 296       if (requested_inferior != -1 && inf->num != requested_inferior)
 297         continue;
 298
 299       chain2 = make_cleanup_ui_out_tuple_begin_end (uiout, NULL);
 300
 301       if (inf->pid == ptid_get_pid (inferior_ptid))
 302         ui_out_text (uiout, "* ");
 303       else
 304         ui_out_text (uiout, "  ");
 305
 306       ui_out_field_int (uiout, "id", inf->num);
 307       ui_out_text (uiout, " ");
 308       ui_out_field_int (uiout, "target-id", inf->pid);
 309
 310       ui_out_text (uiout, "\n");
 311       do_cleanups (chain2);
 312     }
 313
 314   do_cleanups (old_chain);
 315 }
 316
 317 /* Print information about currently known inferiors.  */
 318
 319 static void
 320 info_inferiors_command (char *arg, int from_tty)
 321 {
 322   print_inferior (uiout, -1);
 323 }
 324
 325 /* Print notices when new inferiors are created and die.  */
 326 static void
 327 show_print_inferior_events (struct ui_file *file, int from_tty,
 328                            struct cmd_list_element *c, const char *value)
 329 {
 330   fprintf_filtered (file, _("Printing of inferior events is %s.\n"), value);
 331 }
 332
 333 void
 334 _initialize_inferiors (void)
 335 {
 336   add_info ("inferiors", info_inferiors_command,
 337             _("IDs of currently known inferiors."));
 338
 339   add_setshow_boolean_cmd ("inferior-events", no_class,
 340          &print_inferior_events, _("\
 341 Set printing of inferior events (e.g., inferior start and exit)."), _("\
 342 Show printing of inferior events (e.g., inferior start and exit)."), NULL,
 343          NULL,
 344          show_print_inferior_events,
 345          &setprintlist, &showprintlist);
 346 }