1 /* Inferior process information for the remote server for GDB.
2 Copyright (C) 2002, 2005, 2007, 2008, 2009, 2010
3 Free Software Foundation, Inc.
5 Contributed by MontaVista Software.
7 This file is part of GDB.
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program. If not, see <http://www.gnu.org/licenses/>. */
28 struct inferior_list_entry entry
;
34 struct inferior_list all_processes
;
35 struct inferior_list all_threads
;
36 struct inferior_list all_dlls
;
39 struct thread_info
*current_inferior
;
44 ptid_t minus_one_ptid
;
46 /* Create a ptid given the necessary PID, LWP, and TID components. */
49 ptid_build (int pid
, long lwp
, long tid
)
59 /* Create a ptid from just a pid. */
64 return ptid_build (pid
, 0, 0);
67 /* Fetch the pid (process id) component from a ptid. */
70 ptid_get_pid (ptid_t ptid
)
75 /* Fetch the lwp (lightweight process) component from a ptid. */
78 ptid_get_lwp (ptid_t ptid
)
83 /* Fetch the tid (thread id) component from a ptid. */
86 ptid_get_tid (ptid_t ptid
)
91 /* ptid_equal() is used to test equality of two ptids. */
94 ptid_equal (ptid_t ptid1
, ptid_t ptid2
)
96 return (ptid1
.pid
== ptid2
.pid
97 && ptid1
.lwp
== ptid2
.lwp
98 && ptid1
.tid
== ptid2
.tid
);
101 /* Return true if this ptid represents a process. */
104 ptid_is_pid (ptid_t ptid
)
106 if (ptid_equal (minus_one_ptid
, ptid
))
108 if (ptid_equal (null_ptid
, ptid
))
111 return (ptid_get_pid (ptid
) != 0
112 && ptid_get_lwp (ptid
) == 0
113 && ptid_get_tid (ptid
) == 0);
116 #define get_thread(inf) ((struct thread_info *)(inf))
117 #define get_dll(inf) ((struct dll_info *)(inf))
120 add_inferior_to_list (struct inferior_list
*list
,
121 struct inferior_list_entry
*new_inferior
)
123 new_inferior
->next
= NULL
;
124 if (list
->tail
!= NULL
)
125 list
->tail
->next
= new_inferior
;
127 list
->head
= new_inferior
;
128 list
->tail
= new_inferior
;
131 /* Invoke ACTION for each inferior in LIST. */
134 for_each_inferior (struct inferior_list
*list
,
135 void (*action
) (struct inferior_list_entry
*))
137 struct inferior_list_entry
*cur
= list
->head
, *next
;
148 remove_inferior (struct inferior_list
*list
,
149 struct inferior_list_entry
*entry
)
151 struct inferior_list_entry
**cur
;
153 if (list
->head
== entry
)
155 list
->head
= entry
->next
;
156 if (list
->tail
== entry
)
157 list
->tail
= list
->head
;
162 while (*cur
&& (*cur
)->next
!= entry
)
168 (*cur
)->next
= entry
->next
;
170 if (list
->tail
== entry
)
175 add_thread (ptid_t thread_id
, void *target_data
)
177 struct thread_info
*new_thread
= xmalloc (sizeof (*new_thread
));
179 memset (new_thread
, 0, sizeof (*new_thread
));
181 new_thread
->entry
.id
= thread_id
;
183 add_inferior_to_list (&all_threads
, & new_thread
->entry
);
185 if (current_inferior
== NULL
)
186 current_inferior
= new_thread
;
188 new_thread
->target_data
= target_data
;
189 set_inferior_regcache_data (new_thread
, new_register_cache ());
193 thread_id_to_gdb_id (ptid_t thread_id
)
195 struct inferior_list_entry
*inf
= all_threads
.head
;
199 if (ptid_equal (inf
->id
, thread_id
))
208 thread_to_gdb_id (struct thread_info
*thread
)
210 return thread
->entry
.id
;
214 find_thread_ptid (ptid_t ptid
)
216 struct inferior_list_entry
*inf
= all_threads
.head
;
220 struct thread_info
*thread
= get_thread (inf
);
221 if (ptid_equal (thread
->entry
.id
, ptid
))
230 gdb_id_to_thread_id (ptid_t gdb_id
)
232 struct thread_info
*thread
= find_thread_ptid (gdb_id
);
234 return thread
? thread
->entry
.id
: null_ptid
;
238 free_one_thread (struct inferior_list_entry
*inf
)
240 struct thread_info
*thread
= get_thread (inf
);
241 free_register_cache (inferior_regcache_data (thread
));
246 remove_thread (struct thread_info
*thread
)
248 remove_inferior (&all_threads
, (struct inferior_list_entry
*) thread
);
249 free_one_thread (&thread
->entry
);
252 /* Find the first inferior_list_entry E in LIST for which FUNC (E, ARG)
253 returns non-zero. If no entry is found then return NULL. */
255 struct inferior_list_entry
*
256 find_inferior (struct inferior_list
*list
,
257 int (*func
) (struct inferior_list_entry
*, void *), void *arg
)
259 struct inferior_list_entry
*inf
= list
->head
;
263 struct inferior_list_entry
*next
;
266 if ((*func
) (inf
, arg
))
274 struct inferior_list_entry
*
275 find_inferior_id (struct inferior_list
*list
, ptid_t id
)
277 struct inferior_list_entry
*inf
= list
->head
;
281 if (ptid_equal (inf
->id
, id
))
290 inferior_target_data (struct thread_info
*inferior
)
292 return inferior
->target_data
;
296 set_inferior_target_data (struct thread_info
*inferior
, void *data
)
298 inferior
->target_data
= data
;
302 inferior_regcache_data (struct thread_info
*inferior
)
304 return inferior
->regcache_data
;
308 set_inferior_regcache_data (struct thread_info
*inferior
, void *data
)
310 inferior
->regcache_data
= data
;
314 free_one_dll (struct inferior_list_entry
*inf
)
316 struct dll_info
*dll
= get_dll (inf
);
317 if (dll
->name
!= NULL
)
322 /* Find a DLL with the same name and/or base address. A NULL name in
323 the key is ignored; so is an all-ones base address. */
326 match_dll (struct inferior_list_entry
*inf
, void *arg
)
328 struct dll_info
*iter
= (void *) inf
;
329 struct dll_info
*key
= arg
;
331 if (key
->base_addr
!= ~(CORE_ADDR
) 0
332 && iter
->base_addr
== key
->base_addr
)
334 else if (key
->name
!= NULL
335 && iter
->name
!= NULL
336 && strcmp (key
->name
, iter
->name
) == 0)
342 /* Record a newly loaded DLL at BASE_ADDR. */
345 loaded_dll (const char *name
, CORE_ADDR base_addr
)
347 struct dll_info
*new_dll
= xmalloc (sizeof (*new_dll
));
348 memset (new_dll
, 0, sizeof (*new_dll
));
350 new_dll
->entry
.id
= minus_one_ptid
;
352 new_dll
->name
= xstrdup (name
);
353 new_dll
->base_addr
= base_addr
;
355 add_inferior_to_list (&all_dlls
, &new_dll
->entry
);
359 /* Record that the DLL with NAME and BASE_ADDR has been unloaded. */
362 unloaded_dll (const char *name
, CORE_ADDR base_addr
)
364 struct dll_info
*dll
;
365 struct dll_info key_dll
;
367 /* Be careful not to put the key DLL in any list. */
368 key_dll
.name
= (char *) name
;
369 key_dll
.base_addr
= base_addr
;
371 dll
= (void *) find_inferior (&all_dlls
, match_dll
, &key_dll
);
374 /* For some inferiors we might get unloaded_dll events without having
375 a corresponding loaded_dll. In that case, the dll cannot be found
376 in ALL_DLL, and there is nothing further for us to do.
378 This has been observed when running 32bit executables on Windows64
379 (i.e. through WOW64, the interface between the 32bits and 64bits
380 worlds). In that case, the inferior always does some strange
381 unloading of unnamed dll. */
385 /* DLL has been found so remove the entry and free associated
387 remove_inferior (&all_dlls
, &dll
->entry
);
388 free_one_dll (&dll
->entry
);
393 #define clear_list(LIST) \
394 do { (LIST)->head = (LIST)->tail = NULL; } while (0)
397 clear_inferiors (void)
399 for_each_inferior (&all_threads
, free_one_thread
);
400 for_each_inferior (&all_dlls
, free_one_dll
);
402 clear_list (&all_threads
);
403 clear_list (&all_dlls
);
405 current_inferior
= NULL
;
408 /* Two utility functions for a truly degenerate inferior_list: a simple
412 add_pid_to_list (struct inferior_list
*list
, unsigned long pid
)
414 struct inferior_list_entry
*new_entry
;
416 new_entry
= xmalloc (sizeof (struct inferior_list_entry
));
417 new_entry
->id
= pid_to_ptid (pid
);
418 add_inferior_to_list (list
, new_entry
);
422 pull_pid_from_list (struct inferior_list
*list
, unsigned long pid
)
424 struct inferior_list_entry
*new_entry
;
426 new_entry
= find_inferior_id (list
, pid_to_ptid (pid
));
427 if (new_entry
== NULL
)
431 remove_inferior (list
, new_entry
);
437 struct process_info
*
438 add_process (int pid
, int attached
)
440 struct process_info
*process
;
442 process
= xcalloc (1, sizeof (*process
));
444 process
->head
.id
= pid_to_ptid (pid
);
445 process
->attached
= attached
;
447 add_inferior_to_list (&all_processes
, &process
->head
);
452 /* Remove a process from the common process list and free the memory
454 The caller is responsible for freeing private data first. */
457 remove_process (struct process_info
*process
)
459 clear_symbol_cache (&process
->symbol_cache
);
460 free_all_breakpoints (process
);
461 remove_inferior (&all_processes
, &process
->head
);
465 struct process_info
*
466 find_process_pid (int pid
)
468 return (struct process_info
*)
469 find_inferior_id (&all_processes
, pid_to_ptid (pid
));
472 /* Return non-zero if INF, a struct process_info, was started by us,
473 i.e. not attached to. */
476 started_inferior_callback (struct inferior_list_entry
*entry
, void *args
)
478 struct process_info
*process
= (struct process_info
*) entry
;
480 return ! process
->attached
;
483 /* Return non-zero if there are any inferiors that we have created
484 (as opposed to attached-to). */
487 have_started_inferiors_p (void)
489 return (find_inferior (&all_processes
, started_inferior_callback
, NULL
)
493 /* Return non-zero if INF, a struct process_info, was attached to. */
496 attached_inferior_callback (struct inferior_list_entry
*entry
, void *args
)
498 struct process_info
*process
= (struct process_info
*) entry
;
500 return process
->attached
;
503 /* Return non-zero if there are any inferiors that we have attached to. */
506 have_attached_inferiors_p (void)
508 return (find_inferior (&all_processes
, attached_inferior_callback
, NULL
)
512 struct process_info
*
513 get_thread_process (struct thread_info
*thread
)
515 int pid
= ptid_get_pid (thread
->entry
.id
);
516 return find_process_pid (pid
);
519 struct process_info
*
520 current_process (void)
522 if (current_inferior
== NULL
)
523 fatal ("Current inferior requested, but current_inferior is NULL\n");
525 return get_thread_process (current_inferior
);
529 initialize_inferiors (void)
531 null_ptid
= ptid_build (0, 0, 0);
532 minus_one_ptid
= ptid_build (-1, 0, 0);