gdb/gdbserver/inferiors.c

   1 /* Inferior process information for the remote server for GDB.
   2    Copyright (C) 2002-2015 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 "server.h"
  22 #include "gdbthread.h"
  23 #include "dll.h"
  24
  25 struct inferior_list all_processes;
  26 struct inferior_list all_threads;
  27
  28 struct thread_info *current_thread;
  29
  30 #define get_thread(inf) ((struct thread_info *)(inf))
  31
  32 void
  33 add_inferior_to_list (struct inferior_list *list,
  34                       struct inferior_list_entry *new_inferior)
  35 {
  36   new_inferior->next = NULL;
  37   if (list->tail != NULL)
  38     list->tail->next = new_inferior;
  39   else
  40     list->head = new_inferior;
  41   list->tail = new_inferior;
  42 }
  43
  44 /* Invoke ACTION for each inferior in LIST.  */
  45
  46 void
  47 for_each_inferior (struct inferior_list *list,
  48                    void (*action) (struct inferior_list_entry *))
  49 {
  50   struct inferior_list_entry *cur = list->head, *next;
  51
  52   while (cur != NULL)
  53     {
  54       next = cur->next;
  55       (*action) (cur);
  56       cur = next;
  57     }
  58 }
  59
  60 /* Invoke ACTION for each inferior in LIST, passing DATA to ACTION.  */
  61
  62 void
  63 for_each_inferior_with_data (struct inferior_list *list,
  64                              void (*action) (struct inferior_list_entry *,
  65                                              void *),
  66                              void *data)
  67 {
  68   struct inferior_list_entry *cur = list->head, *next;
  69
  70   while (cur != NULL)
  71     {
  72       next = cur->next;
  73       (*action) (cur, data);
  74       cur = next;
  75     }
  76 }
  77
  78 void
  79 remove_inferior (struct inferior_list *list,
  80                  struct inferior_list_entry *entry)
  81 {
  82   struct inferior_list_entry **cur;
  83
  84   if (list->head == entry)
  85     {
  86       list->head = entry->next;
  87       if (list->tail == entry)
  88         list->tail = list->head;
  89       return;
  90     }
  91
  92   cur = &list->head;
  93   while (*cur && (*cur)->next != entry)
  94     cur = &(*cur)->next;
  95
  96   if (*cur == NULL)
  97     return;
  98
  99   (*cur)->next = entry->next;
 100
 101   if (list->tail == entry)
 102     list->tail = *cur;
 103 }
 104
 105 struct thread_info *
 106 add_thread (ptid_t thread_id, void *target_data)
 107 {
 108   struct thread_info *new_thread = XCNEW (struct thread_info);
 109
 110   new_thread->entry.id = thread_id;
 111   new_thread->last_resume_kind = resume_continue;
 112   new_thread->last_status.kind = TARGET_WAITKIND_IGNORE;
 113
 114   add_inferior_to_list (&all_threads, &new_thread->entry);
 115
 116   if (current_thread == NULL)
 117     current_thread = new_thread;
 118
 119   new_thread->target_data = target_data;
 120
 121   return new_thread;
 122 }
 123
 124 ptid_t
 125 thread_to_gdb_id (struct thread_info *thread)
 126 {
 127   return thread->entry.id;
 128 }
 129
 130 /* Wrapper around get_first_inferior to return a struct thread_info *.  */
 131
 132 struct thread_info *
 133 get_first_thread (void)
 134 {
 135   return (struct thread_info *) get_first_inferior (&all_threads);
 136 }
 137
 138 struct thread_info *
 139 find_thread_ptid (ptid_t ptid)
 140 {
 141   return (struct thread_info *) find_inferior_id (&all_threads, ptid);
 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   discard_queued_stop_replies (ptid_of (thread));
 167   remove_inferior (&all_threads, (struct inferior_list_entry *) thread);
 168   free_one_thread (&thread->entry);
 169 }
 170
 171 /* Return a pointer to the first inferior in LIST, or NULL if there isn't one.
 172    This is for cases where the caller needs a thread, but doesn't care
 173    which one.  */
 174
 175 struct inferior_list_entry *
 176 get_first_inferior (struct inferior_list *list)
 177 {
 178   if (list->head != NULL)
 179     return list->head;
 180   return NULL;
 181 }
 182
 183 /* Find the first inferior_list_entry E in LIST for which FUNC (E, ARG)
 184    returns non-zero.  If no entry is found then return NULL.  */
 185
 186 struct inferior_list_entry *
 187 find_inferior (struct inferior_list *list,
 188                int (*func) (struct inferior_list_entry *, void *), void *arg)
 189 {
 190   struct inferior_list_entry *inf = list->head;
 191
 192   while (inf != NULL)
 193     {
 194       struct inferior_list_entry *next;
 195
 196       next = inf->next;
 197       if ((*func) (inf, arg))
 198         return inf;
 199       inf = next;
 200     }
 201
 202   return NULL;
 203 }
 204
 205 struct inferior_list_entry *
 206 find_inferior_id (struct inferior_list *list, ptid_t id)
 207 {
 208   struct inferior_list_entry *inf = list->head;
 209
 210   while (inf != NULL)
 211     {
 212       if (ptid_equal (inf->id, id))
 213         return inf;
 214       inf = inf->next;
 215     }
 216
 217   return NULL;
 218 }
 219
 220 void *
 221 inferior_target_data (struct thread_info *inferior)
 222 {
 223   return inferior->target_data;
 224 }
 225
 226 void
 227 set_inferior_target_data (struct thread_info *inferior, void *data)
 228 {
 229   inferior->target_data = data;
 230 }
 231
 232 struct regcache *
 233 inferior_regcache_data (struct thread_info *inferior)
 234 {
 235   return inferior->regcache_data;
 236 }
 237
 238 void
 239 set_inferior_regcache_data (struct thread_info *inferior, struct regcache *data)
 240 {
 241   inferior->regcache_data = data;
 242 }
 243
 244 /* Return true if LIST has exactly one entry.  */
 245
 246 int
 247 one_inferior_p (struct inferior_list *list)
 248 {
 249   return list->head != NULL && list->head == list->tail;
 250 }
 251
 252 /* Reset head,tail of LIST, assuming all entries have already been freed.  */
 253
 254 void
 255 clear_inferior_list (struct inferior_list *list)
 256 {
 257   list->head = NULL;
 258   list->tail = NULL;
 259 }
 260
 261 void
 262 clear_inferiors (void)
 263 {
 264   for_each_inferior (&all_threads, free_one_thread);
 265   clear_inferior_list (&all_threads);
 266
 267   clear_dlls ();
 268
 269   current_thread = NULL;
 270 }
 271
 272 struct process_info *
 273 add_process (int pid, int attached)
 274 {
 275   struct process_info *process = XCNEW (struct process_info);
 276
 277   process->entry.id = pid_to_ptid (pid);
 278   process->attached = attached;
 279
 280   add_inferior_to_list (&all_processes, &process->entry);
 281
 282   return process;
 283 }
 284
 285 /* Remove a process from the common process list and free the memory
 286    allocated for it.
 287    The caller is responsible for freeing private data first.  */
 288
 289 void
 290 remove_process (struct process_info *process)
 291 {
 292   clear_symbol_cache (&process->symbol_cache);
 293   free_all_breakpoints (process);
 294   remove_inferior (&all_processes, &process->entry);
 295   free (process);
 296 }
 297
 298 struct process_info *
 299 find_process_pid (int pid)
 300 {
 301   return (struct process_info *)
 302     find_inferior_id (&all_processes, pid_to_ptid (pid));
 303 }
 304
 305 /* Wrapper around get_first_inferior to return a struct process_info *.  */
 306
 307 struct process_info *
 308 get_first_process (void)
 309 {
 310   return (struct process_info *) get_first_inferior (&all_processes);
 311 }
 312
 313 /* Return non-zero if INF, a struct process_info, was started by us,
 314    i.e. not attached to.  */
 315
 316 static int
 317 started_inferior_callback (struct inferior_list_entry *entry, void *args)
 318 {
 319   struct process_info *process = (struct process_info *) entry;
 320
 321   return ! process->attached;
 322 }
 323
 324 /* Return non-zero if there are any inferiors that we have created
 325    (as opposed to attached-to).  */
 326
 327 int
 328 have_started_inferiors_p (void)
 329 {
 330   return (find_inferior (&all_processes, started_inferior_callback, NULL)
 331           != NULL);
 332 }
 333
 334 /* Return non-zero if INF, a struct process_info, was attached to.  */
 335
 336 static int
 337 attached_inferior_callback (struct inferior_list_entry *entry, void *args)
 338 {
 339   struct process_info *process = (struct process_info *) entry;
 340
 341   return process->attached;
 342 }
 343
 344 /* Return non-zero if there are any inferiors that we have attached to.  */
 345
 346 int
 347 have_attached_inferiors_p (void)
 348 {
 349   return (find_inferior (&all_processes, attached_inferior_callback, NULL)
 350           != NULL);
 351 }
 352
 353 struct process_info *
 354 get_thread_process (struct thread_info *thread)
 355 {
 356   int pid = ptid_get_pid (thread->entry.id);
 357   return find_process_pid (pid);
 358 }
 359
 360 struct process_info *
 361 current_process (void)
 362 {
 363   gdb_assert (current_thread != NULL);
 364   return get_thread_process (current_thread);
 365 }