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