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
;
124 /* Wrapper around get_first_inferior to return a struct thread_info *. */
127 get_first_thread (void)
129 return (struct thread_info
*) get_first_inferior (&all_threads
);
133 find_thread_ptid (ptid_t ptid
)
135 return (struct thread_info
*) find_inferior_id (&all_threads
, ptid
);
138 /* Find a thread associated with the given PROCESS, or NULL if no
139 such thread exists. */
141 static struct thread_info
*
142 find_thread_process (const struct process_info
*const process
)
144 return find_any_thread_of_pid (process
->entry
.id
.pid ());
147 /* Helper for find_any_thread_of_pid. Returns true if a thread
151 thread_of_pid (struct inferior_list_entry
*entry
, void *pid_p
)
153 int pid
= *(int *) pid_p
;
155 return (ptid_get_pid (entry
->id
) == pid
);
158 /* See gdbthread.h. */
161 find_any_thread_of_pid (int pid
)
163 struct inferior_list_entry
*entry
;
165 entry
= find_inferior (&all_threads
, thread_of_pid
, &pid
);
167 return (struct thread_info
*) entry
;
171 free_one_thread (struct inferior_list_entry
*inf
)
173 struct thread_info
*thread
= get_thread (inf
);
174 free_register_cache (thread_regcache_data (thread
));
179 remove_thread (struct thread_info
*thread
)
181 if (thread
->btrace
!= NULL
)
182 target_disable_btrace (thread
->btrace
);
184 discard_queued_stop_replies (ptid_of (thread
));
185 remove_inferior (&all_threads
, (struct inferior_list_entry
*) thread
);
186 free_one_thread (&thread
->entry
);
187 if (current_thread
== thread
)
188 current_thread
= NULL
;
191 /* Return a pointer to the first inferior in LIST, or NULL if there isn't one.
192 This is for cases where the caller needs a thread, but doesn't care
195 struct inferior_list_entry
*
196 get_first_inferior (struct inferior_list
*list
)
198 if (list
->head
!= NULL
)
203 /* Find the first inferior_list_entry E in LIST for which FUNC (E, ARG)
204 returns non-zero. If no entry is found then return NULL. */
206 struct inferior_list_entry
*
207 find_inferior (struct inferior_list
*list
,
208 int (*func
) (struct inferior_list_entry
*, void *), void *arg
)
210 struct inferior_list_entry
*inf
= list
->head
;
214 struct inferior_list_entry
*next
;
217 if ((*func
) (inf
, arg
))
225 /* Find the random inferior_list_entry E in LIST for which FUNC (E, ARG)
226 returns non-zero. If no entry is found then return NULL. */
228 struct inferior_list_entry
*
229 find_inferior_in_random (struct inferior_list
*list
,
230 int (*func
) (struct inferior_list_entry
*, void *),
233 struct inferior_list_entry
*inf
= list
->head
;
237 /* First count how many interesting entries we have. */
240 struct inferior_list_entry
*next
;
243 if ((*func
) (inf
, arg
))
251 /* Now randomly pick an entry out of those. */
252 random_selector
= (int)
253 ((count
* (double) rand ()) / (RAND_MAX
+ 1.0));
258 struct inferior_list_entry
*next
;
261 if ((*func
) (inf
, arg
) && (random_selector
-- == 0))
266 gdb_assert_not_reached ("failed to find an inferior in random.");
270 struct inferior_list_entry
*
271 find_inferior_id (struct inferior_list
*list
, ptid_t id
)
273 struct inferior_list_entry
*inf
= list
->head
;
277 if (ptid_equal (inf
->id
, id
))
286 thread_target_data (struct thread_info
*thread
)
288 return thread
->target_data
;
292 thread_regcache_data (struct thread_info
*thread
)
294 return thread
->regcache_data
;
298 set_thread_regcache_data (struct thread_info
*thread
, struct regcache
*data
)
300 thread
->regcache_data
= data
;
303 /* Return true if LIST has exactly one entry. */
306 one_inferior_p (struct inferior_list
*list
)
308 return list
->head
!= NULL
&& list
->head
== list
->tail
;
311 /* Reset head,tail of LIST, assuming all entries have already been freed. */
314 clear_inferior_list (struct inferior_list
*list
)
321 clear_inferiors (void)
323 for_each_inferior (&all_threads
, free_one_thread
);
324 clear_inferior_list (&all_threads
);
328 current_thread
= NULL
;
331 struct process_info
*
332 add_process (int pid
, int attached
)
334 struct process_info
*process
= XCNEW (struct process_info
);
336 process
->entry
.id
= pid_to_ptid (pid
);
337 process
->attached
= attached
;
339 add_inferior_to_list (&all_processes
, &process
->entry
);
344 /* Remove a process from the common process list and free the memory
346 The caller is responsible for freeing private data first. */
349 remove_process (struct process_info
*process
)
351 clear_symbol_cache (&process
->symbol_cache
);
352 free_all_breakpoints (process
);
353 gdb_assert (find_thread_process (process
) == NULL
);
354 remove_inferior (&all_processes
, &process
->entry
);
355 VEC_free (int, process
->syscalls_to_catch
);
359 struct process_info
*
360 find_process_pid (int pid
)
362 return (struct process_info
*)
363 find_inferior_id (&all_processes
, pid_to_ptid (pid
));
366 /* Wrapper around get_first_inferior to return a struct process_info *. */
368 struct process_info
*
369 get_first_process (void)
371 return (struct process_info
*) get_first_inferior (&all_processes
);
374 /* Return non-zero if INF, a struct process_info, was started by us,
375 i.e. not attached to. */
378 started_inferior_callback (struct inferior_list_entry
*entry
, void *args
)
380 struct process_info
*process
= (struct process_info
*) entry
;
382 return ! process
->attached
;
385 /* Return non-zero if there are any inferiors that we have created
386 (as opposed to attached-to). */
389 have_started_inferiors_p (void)
391 return (find_inferior (&all_processes
, started_inferior_callback
, NULL
)
395 /* Return non-zero if INF, a struct process_info, was attached to. */
398 attached_inferior_callback (struct inferior_list_entry
*entry
, void *args
)
400 struct process_info
*process
= (struct process_info
*) entry
;
402 return process
->attached
;
405 /* Return non-zero if there are any inferiors that we have attached to. */
408 have_attached_inferiors_p (void)
410 return (find_inferior (&all_processes
, attached_inferior_callback
, NULL
)
414 struct process_info
*
415 get_thread_process (const struct thread_info
*thread
)
417 int pid
= ptid_get_pid (thread
->entry
.id
);
418 return find_process_pid (pid
);
421 struct process_info
*
422 current_process (void)
424 gdb_assert (current_thread
!= NULL
);
425 return get_thread_process (current_thread
);
429 do_restore_current_thread_cleanup (void *arg
)
431 current_thread
= (struct thread_info
*) arg
;
435 make_cleanup_restore_current_thread (void)
437 return make_cleanup (do_restore_current_thread_cleanup
, current_thread
);
440 /* See common/common-gdbthread.h. */
443 switch_to_thread (ptid_t ptid
)
445 if (!ptid_equal (ptid
, minus_one_ptid
))
446 current_thread
= find_thread_ptid (ptid
);