1 /* Inferior process information for the remote server for GDB.
2 Copyright (C) 2002-2017 Free Software Foundation, Inc.
4 Contributed by MontaVista Software.
6 This file is part of GDB.
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.
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.
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/>. */
22 #include "gdbthread.h"
25 struct inferior_list all_processes
;
26 struct inferior_list all_threads
;
28 struct thread_info
*current_thread
;
30 #define get_thread(inf) ((struct thread_info *)(inf))
33 add_inferior_to_list (struct inferior_list
*list
,
34 struct inferior_list_entry
*new_inferior
)
36 new_inferior
->next
= NULL
;
37 if (list
->tail
!= NULL
)
38 list
->tail
->next
= new_inferior
;
40 list
->head
= new_inferior
;
41 list
->tail
= new_inferior
;
44 /* Invoke ACTION for each inferior in LIST. */
47 for_each_inferior (struct inferior_list
*list
,
48 void (*action
) (struct inferior_list_entry
*))
50 struct inferior_list_entry
*cur
= list
->head
, *next
;
60 /* Invoke ACTION for each inferior in LIST, passing DATA to ACTION. */
63 for_each_inferior_with_data (struct inferior_list
*list
,
64 void (*action
) (struct inferior_list_entry
*,
68 struct inferior_list_entry
*cur
= list
->head
, *next
;
73 (*action
) (cur
, data
);
79 remove_inferior (struct inferior_list
*list
,
80 struct inferior_list_entry
*entry
)
82 struct inferior_list_entry
**cur
;
84 if (list
->head
== entry
)
86 list
->head
= entry
->next
;
87 if (list
->tail
== entry
)
88 list
->tail
= list
->head
;
93 while (*cur
&& (*cur
)->next
!= entry
)
99 (*cur
)->next
= entry
->next
;
101 if (list
->tail
== entry
)
106 add_thread (ptid_t thread_id
, void *target_data
)
108 struct thread_info
*new_thread
= XCNEW (struct thread_info
);
110 new_thread
->entry
.id
= thread_id
;
111 new_thread
->last_resume_kind
= resume_continue
;
112 new_thread
->last_status
.kind
= TARGET_WAITKIND_IGNORE
;
114 add_inferior_to_list (&all_threads
, &new_thread
->entry
);
116 if (current_thread
== NULL
)
117 current_thread
= new_thread
;
119 new_thread
->target_data
= target_data
;
125 thread_to_gdb_id (struct thread_info
*thread
)
127 return thread
->entry
.id
;
130 /* Wrapper around get_first_inferior to return a struct thread_info *. */
133 get_first_thread (void)
135 return (struct thread_info
*) get_first_inferior (&all_threads
);
139 find_thread_ptid (ptid_t ptid
)
141 return (struct thread_info
*) find_inferior_id (&all_threads
, ptid
);
144 /* Find a thread associated with the given PROCESS, or NULL if no
145 such thread exists. */
147 static struct thread_info
*
148 find_thread_process (const struct process_info
*const process
)
150 return find_any_thread_of_pid (process
->entry
.id
.pid ());
153 /* Helper for find_any_thread_of_pid. Returns true if a thread
157 thread_of_pid (struct inferior_list_entry
*entry
, void *pid_p
)
159 int pid
= *(int *) pid_p
;
161 return (ptid_get_pid (entry
->id
) == pid
);
164 /* See gdbthread.h. */
167 find_any_thread_of_pid (int pid
)
169 struct inferior_list_entry
*entry
;
171 entry
= find_inferior (&all_threads
, thread_of_pid
, &pid
);
173 return (struct thread_info
*) entry
;
177 free_one_thread (struct inferior_list_entry
*inf
)
179 struct thread_info
*thread
= get_thread (inf
);
180 free_register_cache (thread_regcache_data (thread
));
185 remove_thread (struct thread_info
*thread
)
187 if (thread
->btrace
!= NULL
)
188 target_disable_btrace (thread
->btrace
);
190 discard_queued_stop_replies (ptid_of (thread
));
191 remove_inferior (&all_threads
, (struct inferior_list_entry
*) thread
);
192 free_one_thread (&thread
->entry
);
193 if (current_thread
== thread
)
194 current_thread
= NULL
;
197 /* Return a pointer to the first inferior in LIST, or NULL if there isn't one.
198 This is for cases where the caller needs a thread, but doesn't care
201 struct inferior_list_entry
*
202 get_first_inferior (struct inferior_list
*list
)
204 if (list
->head
!= NULL
)
209 /* Find the first inferior_list_entry E in LIST for which FUNC (E, ARG)
210 returns non-zero. If no entry is found then return NULL. */
212 struct inferior_list_entry
*
213 find_inferior (struct inferior_list
*list
,
214 int (*func
) (struct inferior_list_entry
*, void *), void *arg
)
216 struct inferior_list_entry
*inf
= list
->head
;
220 struct inferior_list_entry
*next
;
223 if ((*func
) (inf
, arg
))
231 /* Find the random inferior_list_entry E in LIST for which FUNC (E, ARG)
232 returns non-zero. If no entry is found then return NULL. */
234 struct inferior_list_entry
*
235 find_inferior_in_random (struct inferior_list
*list
,
236 int (*func
) (struct inferior_list_entry
*, void *),
239 struct inferior_list_entry
*inf
= list
->head
;
243 /* First count how many interesting entries we have. */
246 struct inferior_list_entry
*next
;
249 if ((*func
) (inf
, arg
))
257 /* Now randomly pick an entry out of those. */
258 random_selector
= (int)
259 ((count
* (double) rand ()) / (RAND_MAX
+ 1.0));
264 struct inferior_list_entry
*next
;
267 if ((*func
) (inf
, arg
) && (random_selector
-- == 0))
272 gdb_assert_not_reached ("failed to find an inferior in random.");
276 struct inferior_list_entry
*
277 find_inferior_id (struct inferior_list
*list
, ptid_t id
)
279 struct inferior_list_entry
*inf
= list
->head
;
283 if (ptid_equal (inf
->id
, id
))
292 thread_target_data (struct thread_info
*thread
)
294 return thread
->target_data
;
298 thread_regcache_data (struct thread_info
*thread
)
300 return thread
->regcache_data
;
304 set_thread_regcache_data (struct thread_info
*thread
, struct regcache
*data
)
306 thread
->regcache_data
= data
;
309 /* Return true if LIST has exactly one entry. */
312 one_inferior_p (struct inferior_list
*list
)
314 return list
->head
!= NULL
&& list
->head
== list
->tail
;
317 /* Reset head,tail of LIST, assuming all entries have already been freed. */
320 clear_inferior_list (struct inferior_list
*list
)
327 clear_inferiors (void)
329 for_each_inferior (&all_threads
, free_one_thread
);
330 clear_inferior_list (&all_threads
);
334 current_thread
= NULL
;
337 struct process_info
*
338 add_process (int pid
, int attached
)
340 struct process_info
*process
= XCNEW (struct process_info
);
342 process
->entry
.id
= pid_to_ptid (pid
);
343 process
->attached
= attached
;
345 add_inferior_to_list (&all_processes
, &process
->entry
);
350 /* Remove a process from the common process list and free the memory
352 The caller is responsible for freeing private data first. */
355 remove_process (struct process_info
*process
)
357 clear_symbol_cache (&process
->symbol_cache
);
358 free_all_breakpoints (process
);
359 gdb_assert (find_thread_process (process
) == NULL
);
360 remove_inferior (&all_processes
, &process
->entry
);
361 VEC_free (int, process
->syscalls_to_catch
);
365 struct process_info
*
366 find_process_pid (int pid
)
368 return (struct process_info
*)
369 find_inferior_id (&all_processes
, pid_to_ptid (pid
));
372 /* Wrapper around get_first_inferior to return a struct process_info *. */
374 struct process_info
*
375 get_first_process (void)
377 return (struct process_info
*) get_first_inferior (&all_processes
);
380 /* Return non-zero if INF, a struct process_info, was started by us,
381 i.e. not attached to. */
384 started_inferior_callback (struct inferior_list_entry
*entry
, void *args
)
386 struct process_info
*process
= (struct process_info
*) entry
;
388 return ! process
->attached
;
391 /* Return non-zero if there are any inferiors that we have created
392 (as opposed to attached-to). */
395 have_started_inferiors_p (void)
397 return (find_inferior (&all_processes
, started_inferior_callback
, NULL
)
401 /* Return non-zero if INF, a struct process_info, was attached to. */
404 attached_inferior_callback (struct inferior_list_entry
*entry
, void *args
)
406 struct process_info
*process
= (struct process_info
*) entry
;
408 return process
->attached
;
411 /* Return non-zero if there are any inferiors that we have attached to. */
414 have_attached_inferiors_p (void)
416 return (find_inferior (&all_processes
, attached_inferior_callback
, NULL
)
420 struct process_info
*
421 get_thread_process (const struct thread_info
*thread
)
423 int pid
= ptid_get_pid (thread
->entry
.id
);
424 return find_process_pid (pid
);
427 struct process_info
*
428 current_process (void)
430 gdb_assert (current_thread
!= NULL
);
431 return get_thread_process (current_thread
);
435 do_restore_current_thread_cleanup (void *arg
)
437 current_thread
= (struct thread_info
*) arg
;
441 make_cleanup_restore_current_thread (void)
443 return make_cleanup (do_restore_current_thread_cleanup
, current_thread
);
446 /* See common/common-gdbthread.h. */
449 switch_to_thread (ptid_t ptid
)
451 if (!ptid_equal (ptid
, minus_one_ptid
))
452 current_thread
= find_thread_ptid (ptid
);