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 = xmalloc (sizeof (*new_thread));
 109
 110   memset (new_thread, 0, sizeof (*new_thread));
 111
 112   new_thread->entry.id = thread_id;
 113   new_thread->last_resume_kind = resume_continue;
 114   new_thread->last_status.kind = TARGET_WAITKIND_IGNORE;
 115
 116   add_inferior_to_list (&all_threads, &new_thread->entry);
 117
 118   if (current_thread == NULL)
 119     current_thread = new_thread;
 120
 121   new_thread->target_data = target_data;
 122
 123   return new_thread;
 124 }
 125
 126 ptid_t
 127 thread_to_gdb_id (struct thread_info *thread)
 128 {
 129   return thread->entry.id;
 130 }
 131
 132 /* Wrapper around get_first_inferior to return a struct thread_info *.  */
 133
 134 struct thread_info *
 135 get_first_thread (void)
 136 {
 137   return (struct thread_info *) get_first_inferior (&all_threads);
 138 }
 139
 140 struct thread_info *
 141 find_thread_ptid (ptid_t ptid)
 142 {
 143   return (struct thread_info *) find_inferior_id (&all_threads, ptid);
 144 }
 145
 146 ptid_t
 147 gdb_id_to_thread_id (ptid_t gdb_id)
 148 {
 149   struct thread_info *thread = find_thread_ptid (gdb_id);
 150
 151   return thread ? thread->entry.id : null_ptid;
 152 }
 153
 154 static void
 155 free_one_thread (struct inferior_list_entry *inf)
 156 {
 157   struct thread_info *thread = get_thread (inf);
 158   free_register_cache (inferior_regcache_data (thread));
 159   free (thread);
 160 }
 161
 162 void
 163 remove_thread (struct thread_info *thread)
 164 {
 165   if (thread->btrace != NULL)
 166     target_disable_btrace (thread->btrace);
 167
 168   discard_queued_stop_replies (ptid_of (thread));
 169   remove_inferior (&all_threads, (struct inferior_list_entry *) thread);
 170   free_one_thread (&thread->entry);
 171 }
 172
 173 /* Return a pointer to the first inferior in LIST, or NULL if there isn't one.
 174    This is for cases where the caller needs a thread, but doesn't care
 175    which one.  */
 176
 177 struct inferior_list_entry *
 178 get_first_inferior (struct inferior_list *list)
 179 {
 180   if (list->head != NULL)
 181     return list->head;
 182   return NULL;
 183 }
 184
 185 /* Find the first inferior_list_entry E in LIST for which FUNC (E, ARG)
 186    returns non-zero.  If no entry is found then return NULL.  */
 187
 188 struct inferior_list_entry *
 189 find_inferior (struct inferior_list *list,
 190                int (*func) (struct inferior_list_entry *, void *), void *arg)
 191 {
 192   struct inferior_list_entry *inf = list->head;
 193
 194   while (inf != NULL)
 195     {
 196       struct inferior_list_entry *next;
 197
 198       next = inf->next;
 199       if ((*func) (inf, arg))
 200         return inf;
 201       inf = next;
 202     }
 203
 204   return NULL;
 205 }
 206
 207 struct inferior_list_entry *
 208 find_inferior_id (struct inferior_list *list, ptid_t id)
 209 {
 210   struct inferior_list_entry *inf = list->head;
 211
 212   while (inf != NULL)
 213     {
 214       if (ptid_equal (inf->id, id))
 215         return inf;
 216       inf = inf->next;
 217     }
 218
 219   return NULL;
 220 }
 221
 222 void *
 223 inferior_target_data (struct thread_info *inferior)
 224 {
 225   return inferior->target_data;
 226 }
 227
 228 void
 229 set_inferior_target_data (struct thread_info *inferior, void *data)
 230 {
 231   inferior->target_data = data;
 232 }
 233
 234 struct regcache *
 235 inferior_regcache_data (struct thread_info *inferior)
 236 {
 237   return inferior->regcache_data;
 238 }
 239
 240 void
 241 set_inferior_regcache_data (struct thread_info *inferior, struct regcache *data)
 242 {
 243   inferior->regcache_data = data;
 244 }
 245
 246 /* Return true if LIST has exactly one entry.  */
 247
 248 int
 249 one_inferior_p (struct inferior_list *list)
 250 {
 251   return list->head != NULL && list->head == list->tail;
 252 }
 253
 254 /* Reset head,tail of LIST, assuming all entries have already been freed.  */
 255
 256 void
 257 clear_inferior_list (struct inferior_list *list)
 258 {
 259   list->head = NULL;
 260   list->tail = NULL;
 261 }
 262
 263 void
 264 clear_inferiors (void)
 265 {
 266   for_each_inferior (&all_threads, free_one_thread);
 267   clear_inferior_list (&all_threads);
 268
 269   clear_dlls ();
 270
 271   current_thread = NULL;
 272 }
 273
 274 struct process_info *
 275 add_process (int pid, int attached)
 276 {
 277   struct process_info *process;
 278
 279   process = xcalloc (1, sizeof (*process));
 280
 281   process->entry.id = pid_to_ptid (pid);
 282   process->attached = attached;
 283
 284   add_inferior_to_list (&all_processes, &process->entry);
 285
 286   return process;
 287 }
 288
 289 /* Remove a process from the common process list and free the memory
 290    allocated for it.
 291    The caller is responsible for freeing private data first.  */
 292
 293 void
 294 remove_process (struct process_info *process)
 295 {
 296   clear_symbol_cache (&process->symbol_cache);
 297   free_all_breakpoints (process);
 298   remove_inferior (&all_processes, &process->entry);
 299   free (process);
 300 }
 301
 302 struct process_info *
 303 find_process_pid (int pid)
 304 {
 305   return (struct process_info *)
 306     find_inferior_id (&all_processes, pid_to_ptid (pid));
 307 }
 308
 309 /* Return non-zero if INF, a struct process_info, was started by us,
 310    i.e. not attached to.  */
 311
 312 static int
 313 started_inferior_callback (struct inferior_list_entry *entry, void *args)
 314 {
 315   struct process_info *process = (struct process_info *) entry;
 316
 317   return ! process->attached;
 318 }
 319
 320 /* Return non-zero if there are any inferiors that we have created
 321    (as opposed to attached-to).  */
 322
 323 int
 324 have_started_inferiors_p (void)
 325 {
 326   return (find_inferior (&all_processes, started_inferior_callback, NULL)
 327           != NULL);
 328 }
 329
 330 /* Return non-zero if INF, a struct process_info, was attached to.  */
 331
 332 static int
 333 attached_inferior_callback (struct inferior_list_entry *entry, void *args)
 334 {
 335   struct process_info *process = (struct process_info *) entry;
 336
 337   return process->attached;
 338 }
 339
 340 /* Return non-zero if there are any inferiors that we have attached to.  */
 341
 342 int
 343 have_attached_inferiors_p (void)
 344 {
 345   return (find_inferior (&all_processes, attached_inferior_callback, NULL)
 346           != NULL);
 347 }
 348
 349 struct process_info *
 350 get_thread_process (struct thread_info *thread)
 351 {
 352   int pid = ptid_get_pid (thread->entry.id);
 353   return find_process_pid (pid);
 354 }
 355
 356 struct process_info *
 357 current_process (void)
 358 {
 359   gdb_assert (current_thread != NULL);
 360   return get_thread_process (current_thread);
 361 }