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