gdb/gdbserver/inferiors.c

   1 /* Inferior process information for the remote server for GDB.
   2    Copyright 2002
   3    Free Software Foundation, Inc.
   4
   5    Contributed by MontaVista Software.
   6
   7    This file is part of GDB.
   8
   9    This program is free software; you can redistribute it and/or modify
  10    it under the terms of the GNU General Public License as published by
  11    the Free Software Foundation; either version 2 of the License, or
  12    (at your option) any later version.
  13
  14    This program is distributed in the hope that it will be useful,
  15    but WITHOUT ANY WARRANTY; without even the implied warranty of
  16    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  17    GNU General Public License for more details.
  18
  19    You should have received a copy of the GNU General Public License
  20    along with this program; if not, write to the Free Software
  21    Foundation, Inc., 59 Temple Place - Suite 330,
  22    Boston, MA 02111-1307, USA.  */
  23
  24 #include <stdlib.h>
  25
  26 #include "server.h"
  27
  28 struct inferior_info
  29 {
  30   int pid;
  31   void *target_data;
  32   void *regcache_data;
  33   struct inferior_info *next;
  34 };
  35
  36 static struct inferior_info *inferiors;
  37 struct inferior_info *current_inferior;
  38 int signal_pid;
  39
  40 void
  41 add_inferior (int pid)
  42 {
  43   struct inferior_info *new_inferior
  44     = (struct inferior_info *) malloc (sizeof (*new_inferior));
  45
  46   memset (new_inferior, 0, sizeof (*new_inferior));
  47
  48   new_inferior->pid = pid;
  49
  50   new_inferior->next = inferiors;
  51   inferiors = new_inferior;
  52
  53   if (current_inferior == NULL)
  54     current_inferior = inferiors;
  55
  56   create_register_cache (new_inferior);
  57
  58   if (signal_pid == 0)
  59     signal_pid = pid;
  60 }
  61
  62 void
  63 clear_inferiors (void)
  64 {
  65   struct inferior_info *inf = inferiors, *next_inf;
  66
  67   while (inf)
  68     {
  69       next_inf = inf->next;
  70
  71       if (inf->target_data)
  72         free (inf->target_data);
  73       if (inf->regcache_data)
  74         free_register_cache (inf);
  75
  76       free (inf);
  77       inf = next_inf;
  78     }
  79
  80   inferiors = NULL;
  81 }
  82
  83 void *
  84 inferior_target_data (struct inferior_info *inferior)
  85 {
  86   return inferior->target_data;
  87 }
  88
  89 void
  90 set_inferior_target_data (struct inferior_info *inferior, void *data)
  91 {
  92   inferior->target_data = data;
  93 }
  94
  95 void *
  96 inferior_regcache_data (struct inferior_info *inferior)
  97 {
  98   return inferior->regcache_data;
  99 }
 100
 101 void
 102 set_inferior_regcache_data (struct inferior_info *inferior, void *data)
 103 {
 104   inferior->regcache_data = data;
 105 }