aboutsummaryrefslogtreecommitdiff
path: root/gdb/gdbserver/inferiors.c
blob: 774798deae341ba02db184f36a9e685a66aa5e51 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
/* Inferior process information for the remote server for GDB.
   Copyright 2002
   Free Software Foundation, Inc.

   Contributed by MontaVista Software.

   This file is part of GDB.

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2 of the License, or
   (at your option) any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, USA.  */

#include <stdlib.h>

#include "server.h"

struct inferior_info
{
  int pid;
  void *target_data;
  void *regcache_data;
  struct inferior_info *next;
};

static struct inferior_info *inferiors;
struct inferior_info *current_inferior;
int signal_pid;

void
add_inferior (int pid)
{
  struct inferior_info *new_inferior
    = (struct inferior_info *) malloc (sizeof (*new_inferior));

  memset (new_inferior, 0, sizeof (*new_inferior));

  new_inferior->pid = pid;

  new_inferior->next = inferiors;
  inferiors = new_inferior;

  if (current_inferior == NULL)
    current_inferior = inferiors;

  create_register_cache (new_inferior);

  if (signal_pid == 0)
    signal_pid = pid;
}

void
clear_inferiors (void)
{
  struct inferior_info *inf = inferiors, *next_inf;

  while (inf)
    {
      next_inf = inf->next;

      if (inf->target_data)
	free (inf->target_data);
      if (inf->regcache_data)
	free_register_cache (inf);

      free (inf);
      inf = next_inf;
    }

  inferiors = NULL;
}

void *
inferior_target_data (struct inferior_info *inferior)
{
  return inferior->target_data;
}

void
set_inferior_target_data (struct inferior_info *inferior, void *data)
{
  inferior->target_data = data;
}

void *
inferior_regcache_data (struct inferior_info *inferior)
{
  return inferior->regcache_data;
}

void
set_inferior_regcache_data (struct inferior_info *inferior, void *data)
{
  inferior->regcache_data = data;
}