gdb/gdbserver/inferiors.c

   1 /* Inferior process information for the remote server for GDB.
   2    Copyright (C) 2002-2013 Free Software Foundation, Inc.
   3
   4    Contributed by MontaVista Software.
   5
   6    This file is part of GDB.
   7
   8    This program is free software; you can redistribute it and/or modify
   9    it under the terms of the GNU General Public License as published by
  10    the Free Software Foundation; either version 3 of the License, or
  11    (at your option) any later version.
  12
  13    This program is distributed in the hope that it will be useful,
  14    but WITHOUT ANY WARRANTY; without even the implied warranty of
  15    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16    GNU General Public License for more details.
  17
  18    You should have received a copy of the GNU General Public License
  19    along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
  20
  21 #include <stdlib.h>
  22
  23 #include "server.h"
  24 #include "gdbthread.h"
  25
  26 struct inferior_list all_processes;
  27 struct inferior_list all_threads;
  28
  29 struct thread_info *current_inferior;
  30
  31 #define get_thread(inf) ((struct thread_info *)(inf))
  32
  33 void
  34 add_inferior_to_list (struct inferior_list *list,
  35                       struct inferior_list_entry *new_inferior)
  36 {
  37   new_inferior->next = NULL;
  38   if (list->tail != NULL)
  39     list->tail->next = new_inferior;
  40   else
  41     list->head = new_inferior;
  42   list->tail = new_inferior;
  43 }
  44
  45 /* Invoke ACTION for each inferior in LIST.  */
  46
  47 void
  48 for_each_inferior (struct inferior_list *list,
  49                    void (*action) (struct inferior_list_entry *))
  50 {
  51   struct inferior_list_entry *cur = list->head, *next;
  52
  53   while (cur != NULL)
  54     {
  55       next = cur->next;
  56       (*action) (cur);
  57       cur = next;
  58     }
  59 }
  60
  61 void
  62 remove_inferior (struct inferior_list *list,
  63                  struct inferior_list_entry *entry)
  64 {
  65   struct inferior_list_entry **cur;
  66
  67   if (list->head == entry)
  68     {
  69       list->head = entry->next;
  70       if (list->tail == entry)
  71         list->tail = list->head;
  72       return;
  73     }
  74
  75   cur = &list->head;
  76   while (*cur && (*cur)->next != entry)
  77     cur = &(*cur)->next;
  78
  79   if (*cur == NULL)
  80     return;
  81
  82   (*cur)->next = entry->next;
  83
  84   if (list->tail == entry)
  85     list->tail = *cur;
  86 }
  87
  88 void
  89 add_thread (ptid_t thread_id, void *target_data)
  90 {
  91   struct thread_info *new_thread = xmalloc (sizeof (*new_thread));
  92
  93   memset (new_thread, 0, sizeof (*new_thread));
  94
  95   new_thread->entry.id = thread_id;
  96   new_thread->last_resume_kind = resume_continue;
  97   new_thread->last_status.kind = TARGET_WAITKIND_IGNORE;
  98
  99   add_inferior_to_list (&all_threads, & new_thread->entry);
 100
 101   if (current_inferior == NULL)
 102     current_inferior = new_thread;
 103
 104   new_thread->target_data = target_data;
 105 }
 106
 107 ptid_t
 108 thread_id_to_gdb_id (ptid_t thread_id)
 109 {
 110   struct inferior_list_entry *inf = all_threads.head;
 111
 112   while (inf != NULL)
 113     {
 114       if (ptid_equal (inf->id, thread_id))
 115         return thread_id;
 116       inf = inf->next;
 117     }
 118
 119   return null_ptid;
 120 }
 121
 122 ptid_t
 123 thread_to_gdb_id (struct thread_info *thread)
 124 {
 125   return thread->entry.id;
 126 }
 127
 128 struct thread_info *
 129 find_thread_ptid (ptid_t ptid)
 130 {
 131   struct inferior_list_entry *inf = all_threads.head;
 132
 133   while (inf != NULL)
 134     {
 135       struct thread_info *thread = get_thread (inf);
 136       if (ptid_equal (thread->entry.id, ptid))
 137         return thread;
 138       inf = inf->next;
 139     }
 140
 141   return NULL;
 142 }
 143
 144 ptid_t
 145 gdb_id_to_thread_id (ptid_t gdb_id)
 146 {
 147   struct thread_info *thread = find_thread_ptid (gdb_id);
 148
 149   return thread ? thread->entry.id : null_ptid;
 150 }
 151
 152 static void
 153 free_one_thread (struct inferior_list_entry *inf)
 154 {
 155   struct thread_info *thread = get_thread (inf);
 156   free_register_cache (inferior_regcache_data (thread));
 157   free (thread);
 158 }
 159
 160 void
 161 remove_thread (struct thread_info *thread)
 162 {
 163   if (thread->btrace != NULL)
 164     target_disable_btrace (thread->btrace);
 165
 166   remove_inferior (&all_threads, (struct inferior_list_entry *) thread);
 167   free_one_thread (&thread->entry);
 168 }
 169
 170 /* Find the first inferior_list_entry E in LIST for which FUNC (E, ARG)
 171    returns non-zero.  If no entry is found then return NULL.  */
 172
 173 struct inferior_list_entry *
 174 find_inferior (struct inferior_list *list,
 175                int (*func) (struct inferior_list_entry *, void *), void *arg)
 176 {
 177   struct inferior_list_entry *inf = list->head;
 178
 179   while (inf != NULL)
 180     {
 181       struct inferior_list_entry *next;
 182
 183       next = inf->next;
 184       if ((*func) (inf, arg))
 185         return inf;
 186       inf = next;
 187     }
 188
 189   return NULL;
 190 }
 191
 192 struct inferior_list_entry *
 193 find_inferior_id (struct inferior_list *list, ptid_t id)
 194 {
 195   struct inferior_list_entry *inf = list->head;
 196
 197   while (inf != NULL)
 198     {
 199       if (ptid_equal (inf->id, id))
 200         return inf;
 201       inf = inf->next;
 202     }
 203
 204   return NULL;
 205 }
 206
 207 void *
 208 inferior_target_data (struct thread_info *inferior)
 209 {
 210   return inferior->target_data;
 211 }
 212
 213 void
 214 set_inferior_target_data (struct thread_info *inferior, void *data)
 215 {
 216   inferior->target_data = data;
 217 }
 218
 219 void *
 220 inferior_regcache_data (struct thread_info *inferior)
 221 {
 222   return inferior->regcache_data;
 223 }
 224
 225 void
 226 set_inferior_regcache_data (struct thread_info *inferior, void *data)
 227 {
 228   inferior->regcache_data = data;
 229 }
 230
 231 #define clear_list(LIST) \
 232   do { (LIST)->head = (LIST)->tail = NULL; } while (0)
 233
 234 void
 235 clear_inferiors (void)
 236 {
 237   for_each_inferior (&all_threads, free_one_thread);
 238   clear_list (&all_threads);
 239
 240   clear_dlls ();
 241
 242   current_inferior = NULL;
 243 }
 244
 245 struct process_info *
 246 add_process (int pid, int attached)
 247 {
 248   struct process_info *process;
 249
 250   process = xcalloc (1, sizeof (*process));
 251
 252   process->head.id = pid_to_ptid (pid);
 253   process->attached = attached;
 254
 255   add_inferior_to_list (&all_processes, &process->head);
 256
 257   return process;
 258 }
 259
 260 /* Remove a process from the common process list and free the memory
 261    allocated for it.
 262    The caller is responsible for freeing private data first.  */
 263
 264 void
 265 remove_process (struct process_info *process)
 266 {
 267   clear_symbol_cache (&process->symbol_cache);
 268   free_all_breakpoints (process);
 269   remove_inferior (&all_processes, &process->head);
 270   free (process);
 271 }
 272
 273 struct process_info *
 274 find_process_pid (int pid)
 275 {
 276   return (struct process_info *)
 277     find_inferior_id (&all_processes, pid_to_ptid (pid));
 278 }
 279
 280 /* Return non-zero if INF, a struct process_info, was started by us,
 281    i.e. not attached to.  */
 282
 283 static int
 284 started_inferior_callback (struct inferior_list_entry *entry, void *args)
 285 {
 286   struct process_info *process = (struct process_info *) entry;
 287
 288   return ! process->attached;
 289 }
 290
 291 /* Return non-zero if there are any inferiors that we have created
 292    (as opposed to attached-to).  */
 293
 294 int
 295 have_started_inferiors_p (void)
 296 {
 297   return (find_inferior (&all_processes, started_inferior_callback, NULL)
 298           != NULL);
 299 }
 300
 301 /* Return non-zero if INF, a struct process_info, was attached to.  */
 302
 303 static int
 304 attached_inferior_callback (struct inferior_list_entry *entry, void *args)
 305 {
 306   struct process_info *process = (struct process_info *) entry;
 307
 308   return process->attached;
 309 }
 310
 311 /* Return non-zero if there are any inferiors that we have attached to.  */
 312
 313 int
 314 have_attached_inferiors_p (void)
 315 {
 316   return (find_inferior (&all_processes, attached_inferior_callback, NULL)
 317           != NULL);
 318 }
 319
 320 struct process_info *
 321 get_thread_process (struct thread_info *thread)
 322 {
 323   int pid = ptid_get_pid (thread->entry.id);
 324   return find_process_pid (pid);
 325 }
 326
 327 struct process_info *
 328 current_process (void)
 329 {
 330   if (current_inferior == NULL)
 331     fatal ("Current inferior requested, but current_inferior is NULL\n");
 332
 333   return get_thread_process (current_inferior);
 334 }