1 /* Inferior process information for the remote server for GDB.
2 Copyright (C) 2002-2015 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
);
145 gdb_id_to_thread_id (ptid_t gdb_id
)
147 struct thread_info
*thread
= find_thread_ptid (gdb_id
);
149 return thread
? thread
->entry
.id
: null_ptid
;
153 free_one_thread (struct inferior_list_entry
*inf
)
155 struct thread_info
*thread
= get_thread (inf
);
156 free_register_cache (inferior_regcache_data (thread
));
161 remove_thread (struct thread_info
*thread
)
163 if (thread
->btrace
!= NULL
)
164 target_disable_btrace (thread
->btrace
);
166 discard_queued_stop_replies (ptid_of (thread
));
167 remove_inferior (&all_threads
, (struct inferior_list_entry
*) thread
);
168 free_one_thread (&thread
->entry
);
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
175 struct inferior_list_entry
*
176 get_first_inferior (struct inferior_list
*list
)
178 if (list
->head
!= NULL
)
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. */
186 struct inferior_list_entry
*
187 find_inferior (struct inferior_list
*list
,
188 int (*func
) (struct inferior_list_entry
*, void *), void *arg
)
190 struct inferior_list_entry
*inf
= list
->head
;
194 struct inferior_list_entry
*next
;
197 if ((*func
) (inf
, arg
))
205 struct inferior_list_entry
*
206 find_inferior_id (struct inferior_list
*list
, ptid_t id
)
208 struct inferior_list_entry
*inf
= list
->head
;
212 if (ptid_equal (inf
->id
, id
))
221 inferior_target_data (struct thread_info
*inferior
)
223 return inferior
->target_data
;
227 set_inferior_target_data (struct thread_info
*inferior
, void *data
)
229 inferior
->target_data
= data
;
233 inferior_regcache_data (struct thread_info
*inferior
)
235 return inferior
->regcache_data
;
239 set_inferior_regcache_data (struct thread_info
*inferior
, struct regcache
*data
)
241 inferior
->regcache_data
= data
;
244 /* Return true if LIST has exactly one entry. */
247 one_inferior_p (struct inferior_list
*list
)
249 return list
->head
!= NULL
&& list
->head
== list
->tail
;
252 /* Reset head,tail of LIST, assuming all entries have already been freed. */
255 clear_inferior_list (struct inferior_list
*list
)
262 clear_inferiors (void)
264 for_each_inferior (&all_threads
, free_one_thread
);
265 clear_inferior_list (&all_threads
);
269 current_thread
= NULL
;
272 struct process_info
*
273 add_process (int pid
, int attached
)
275 struct process_info
*process
= XCNEW (struct process_info
);
277 process
->entry
.id
= pid_to_ptid (pid
);
278 process
->attached
= attached
;
280 add_inferior_to_list (&all_processes
, &process
->entry
);
285 /* Remove a process from the common process list and free the memory
287 The caller is responsible for freeing private data first. */
290 remove_process (struct process_info
*process
)
292 clear_symbol_cache (&process
->symbol_cache
);
293 free_all_breakpoints (process
);
294 remove_inferior (&all_processes
, &process
->entry
);
298 struct process_info
*
299 find_process_pid (int pid
)
301 return (struct process_info
*)
302 find_inferior_id (&all_processes
, pid_to_ptid (pid
));
305 /* Wrapper around get_first_inferior to return a struct process_info *. */
307 struct process_info
*
308 get_first_process (void)
310 return (struct process_info
*) get_first_inferior (&all_processes
);
313 /* Return non-zero if INF, a struct process_info, was started by us,
314 i.e. not attached to. */
317 started_inferior_callback (struct inferior_list_entry
*entry
, void *args
)
319 struct process_info
*process
= (struct process_info
*) entry
;
321 return ! process
->attached
;
324 /* Return non-zero if there are any inferiors that we have created
325 (as opposed to attached-to). */
328 have_started_inferiors_p (void)
330 return (find_inferior (&all_processes
, started_inferior_callback
, NULL
)
334 /* Return non-zero if INF, a struct process_info, was attached to. */
337 attached_inferior_callback (struct inferior_list_entry
*entry
, void *args
)
339 struct process_info
*process
= (struct process_info
*) entry
;
341 return process
->attached
;
344 /* Return non-zero if there are any inferiors that we have attached to. */
347 have_attached_inferiors_p (void)
349 return (find_inferior (&all_processes
, attached_inferior_callback
, NULL
)
353 struct process_info
*
354 get_thread_process (struct thread_info
*thread
)
356 int pid
= ptid_get_pid (thread
->entry
.id
);
357 return find_process_pid (pid
);
360 struct process_info
*
361 current_process (void)
363 gdb_assert (current_thread
!= NULL
);
364 return get_thread_process (current_thread
);