1 /* Inferior process information for the remote server for GDB.
2 Copyright (C) 2002, 2005, 2007, 2008, 2009 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/>. */
27 struct inferior_list_entry entry
;
33 struct inferior_list all_processes
;
34 struct inferior_list all_threads
;
35 struct inferior_list all_dlls
;
38 struct thread_info
*current_inferior
;
43 ptid_t minus_one_ptid
;
45 /* Create a ptid given the necessary PID, LWP, and TID components. */
48 ptid_build (int pid
, long lwp
, long tid
)
58 /* Create a ptid from just a pid. */
63 return ptid_build (pid
, 0, 0);
66 /* Fetch the pid (process id) component from a ptid. */
69 ptid_get_pid (ptid_t ptid
)
74 /* Fetch the lwp (lightweight process) component from a ptid. */
77 ptid_get_lwp (ptid_t ptid
)
82 /* Fetch the tid (thread id) component from a ptid. */
85 ptid_get_tid (ptid_t ptid
)
90 /* ptid_equal() is used to test equality of two ptids. */
93 ptid_equal (ptid_t ptid1
, ptid_t ptid2
)
95 return (ptid1
.pid
== ptid2
.pid
96 && ptid1
.lwp
== ptid2
.lwp
97 && ptid1
.tid
== ptid2
.tid
);
100 /* Return true if this ptid represents a process. */
103 ptid_is_pid (ptid_t ptid
)
105 if (ptid_equal (minus_one_ptid
, ptid
))
107 if (ptid_equal (null_ptid
, ptid
))
110 return (ptid_get_pid (ptid
) != 0
111 && ptid_get_lwp (ptid
) == 0
112 && ptid_get_tid (ptid
) == 0);
115 #define get_thread(inf) ((struct thread_info *)(inf))
116 #define get_dll(inf) ((struct dll_info *)(inf))
119 add_inferior_to_list (struct inferior_list
*list
,
120 struct inferior_list_entry
*new_inferior
)
122 new_inferior
->next
= NULL
;
123 if (list
->tail
!= NULL
)
124 list
->tail
->next
= new_inferior
;
126 list
->head
= new_inferior
;
127 list
->tail
= new_inferior
;
131 for_each_inferior (struct inferior_list
*list
,
132 void (*action
) (struct inferior_list_entry
*))
134 struct inferior_list_entry
*cur
= list
->head
, *next
;
145 remove_inferior (struct inferior_list
*list
,
146 struct inferior_list_entry
*entry
)
148 struct inferior_list_entry
**cur
;
150 if (list
->head
== entry
)
152 list
->head
= entry
->next
;
153 if (list
->tail
== entry
)
154 list
->tail
= list
->head
;
159 while (*cur
&& (*cur
)->next
!= entry
)
165 (*cur
)->next
= entry
->next
;
167 if (list
->tail
== entry
)
172 add_thread (ptid_t thread_id
, void *target_data
)
174 struct thread_info
*new_thread
= xmalloc (sizeof (*new_thread
));
176 memset (new_thread
, 0, sizeof (*new_thread
));
178 new_thread
->entry
.id
= thread_id
;
180 add_inferior_to_list (&all_threads
, & new_thread
->entry
);
182 if (current_inferior
== NULL
)
183 current_inferior
= new_thread
;
185 new_thread
->target_data
= target_data
;
186 set_inferior_regcache_data (new_thread
, new_register_cache ());
190 thread_id_to_gdb_id (ptid_t thread_id
)
192 struct inferior_list_entry
*inf
= all_threads
.head
;
196 if (ptid_equal (inf
->id
, thread_id
))
205 thread_to_gdb_id (struct thread_info
*thread
)
207 return thread
->entry
.id
;
211 find_thread_pid (ptid_t ptid
)
213 struct inferior_list_entry
*inf
= all_threads
.head
;
217 struct thread_info
*thread
= get_thread (inf
);
218 if (ptid_equal (thread
->entry
.id
, ptid
))
227 gdb_id_to_thread_id (ptid_t gdb_id
)
229 struct thread_info
*thread
= find_thread_pid (gdb_id
);
231 return thread
? thread
->entry
.id
: null_ptid
;
235 free_one_thread (struct inferior_list_entry
*inf
)
237 struct thread_info
*thread
= get_thread (inf
);
238 free_register_cache (inferior_regcache_data (thread
));
243 remove_thread (struct thread_info
*thread
)
245 remove_inferior (&all_threads
, (struct inferior_list_entry
*) thread
);
246 free_one_thread (&thread
->entry
);
249 struct inferior_list_entry
*
250 find_inferior (struct inferior_list
*list
,
251 int (*func
) (struct inferior_list_entry
*, void *), void *arg
)
253 struct inferior_list_entry
*inf
= list
->head
;
257 struct inferior_list_entry
*next
;
260 if ((*func
) (inf
, arg
))
268 struct inferior_list_entry
*
269 find_inferior_id (struct inferior_list
*list
, ptid_t id
)
271 struct inferior_list_entry
*inf
= list
->head
;
275 if (ptid_equal (inf
->id
, id
))
284 inferior_target_data (struct thread_info
*inferior
)
286 return inferior
->target_data
;
290 set_inferior_target_data (struct thread_info
*inferior
, void *data
)
292 inferior
->target_data
= data
;
296 inferior_regcache_data (struct thread_info
*inferior
)
298 return inferior
->regcache_data
;
302 set_inferior_regcache_data (struct thread_info
*inferior
, void *data
)
304 inferior
->regcache_data
= data
;
308 free_one_dll (struct inferior_list_entry
*inf
)
310 struct dll_info
*dll
= get_dll (inf
);
311 if (dll
->name
!= NULL
)
316 /* Find a DLL with the same name and/or base address. A NULL name in
317 the key is ignored; so is an all-ones base address. */
320 match_dll (struct inferior_list_entry
*inf
, void *arg
)
322 struct dll_info
*iter
= (void *) inf
;
323 struct dll_info
*key
= arg
;
325 if (key
->base_addr
!= ~(CORE_ADDR
) 0
326 && iter
->base_addr
== key
->base_addr
)
328 else if (key
->name
!= NULL
329 && iter
->name
!= NULL
330 && strcmp (key
->name
, iter
->name
) == 0)
336 /* Record a newly loaded DLL at BASE_ADDR. */
339 loaded_dll (const char *name
, CORE_ADDR base_addr
)
341 struct dll_info
*new_dll
= xmalloc (sizeof (*new_dll
));
342 memset (new_dll
, 0, sizeof (*new_dll
));
344 new_dll
->entry
.id
= minus_one_ptid
;
346 new_dll
->name
= xstrdup (name
);
347 new_dll
->base_addr
= base_addr
;
349 add_inferior_to_list (&all_dlls
, &new_dll
->entry
);
353 /* Record that the DLL with NAME and BASE_ADDR has been unloaded. */
356 unloaded_dll (const char *name
, CORE_ADDR base_addr
)
358 struct dll_info
*dll
;
359 struct dll_info key_dll
;
361 /* Be careful not to put the key DLL in any list. */
362 key_dll
.name
= (char *) name
;
363 key_dll
.base_addr
= base_addr
;
365 dll
= (void *) find_inferior (&all_dlls
, match_dll
, &key_dll
);
366 remove_inferior (&all_dlls
, &dll
->entry
);
367 free_one_dll (&dll
->entry
);
371 #define clear_list(LIST) \
372 do { (LIST)->head = (LIST)->tail = NULL; } while (0)
375 clear_inferiors (void)
377 for_each_inferior (&all_threads
, free_one_thread
);
378 for_each_inferior (&all_dlls
, free_one_dll
);
380 clear_list (&all_threads
);
381 clear_list (&all_dlls
);
383 current_inferior
= NULL
;
386 /* Two utility functions for a truly degenerate inferior_list: a simple
390 add_pid_to_list (struct inferior_list
*list
, unsigned long pid
)
392 struct inferior_list_entry
*new_entry
;
394 new_entry
= xmalloc (sizeof (struct inferior_list_entry
));
395 new_entry
->id
= pid_to_ptid (pid
);
396 add_inferior_to_list (list
, new_entry
);
400 pull_pid_from_list (struct inferior_list
*list
, unsigned long pid
)
402 struct inferior_list_entry
*new_entry
;
404 new_entry
= find_inferior_id (list
, pid_to_ptid (pid
));
405 if (new_entry
== NULL
)
409 remove_inferior (list
, new_entry
);
415 struct process_info
*
416 add_process (int pid
, int attached
)
418 struct process_info
*process
;
420 process
= xcalloc (1, sizeof (*process
));
422 process
->head
.id
= pid_to_ptid (pid
);
423 process
->attached
= attached
;
425 add_inferior_to_list (&all_processes
, &process
->head
);
431 remove_process (struct process_info
*process
)
433 clear_symbol_cache (&process
->symbol_cache
);
434 free_all_breakpoints (process
);
435 remove_inferior (&all_processes
, &process
->head
);
438 struct process_info
*
439 find_process_pid (int pid
)
441 return (struct process_info
*)
442 find_inferior_id (&all_processes
, pid_to_ptid (pid
));
445 static struct process_info
*
446 get_thread_process (struct thread_info
*thread
)
448 int pid
= ptid_get_pid (thread
->entry
.id
);
449 return find_process_pid (pid
);
452 struct process_info
*
453 current_process (void)
455 if (current_inferior
== NULL
)
456 fatal ("Current inferior requested, but current_inferior is NULL\n");
458 return get_thread_process (current_inferior
);
462 initialize_inferiors (void)
464 null_ptid
= ptid_build (0, 0, 0);
465 minus_one_ptid
= ptid_build (-1, 0, 0);