X-Git-Url: http://drtracing.org/?a=blobdiff_plain;f=gdb%2Fgdbserver%2Finferiors.c;h=ad3df648f5b1c90c6d5d20c68ee89b0c02133d21;hb=cf4088a92f240b01e6db8f39a5a3abfa918f6f2c;hp=8d44d0160a2e717bcb38c5d60f0559c665ab70ab;hpb=5091eb23aa99df6443dc559d2da403ba7a24c406;p=deliverable%2Fbinutils-gdb.git
diff --git a/gdb/gdbserver/inferiors.c b/gdb/gdbserver/inferiors.c
index 8d44d0160a..ad3df648f5 100644
--- a/gdb/gdbserver/inferiors.c
+++ b/gdb/gdbserver/inferiors.c
@@ -1,5 +1,5 @@
/* Inferior process information for the remote server for GDB.
- Copyright (C) 2002, 2005, 2007, 2008, 2009 Free Software Foundation, Inc.
+ Copyright (C) 2002-2018 Free Software Foundation, Inc.
Contributed by MontaVista Software.
@@ -18,454 +18,226 @@
You should have received a copy of the GNU General Public License
along with this program. If not, see . */
-#include
-
#include "server.h"
+#include "gdbthread.h"
+#include "dll.h"
-struct thread_info
-{
- struct inferior_list_entry entry;
- void *target_data;
- void *regcache_data;
- unsigned int gdb_id;
-};
-
-struct inferior_list all_processes;
-struct inferior_list all_threads;
-struct inferior_list all_dlls;
-int dlls_changed;
-
-struct thread_info *current_inferior;
-
-
-/* Oft used ptids */
-ptid_t null_ptid;
-ptid_t minus_one_ptid;
-
-/* Create a ptid given the necessary PID, LWP, and TID components. */
-
-ptid_t
-ptid_build (int pid, long lwp, long tid)
-{
- ptid_t ptid;
-
- ptid.pid = pid;
- ptid.lwp = lwp;
- ptid.tid = tid;
- return ptid;
-}
-
-/* Create a ptid from just a pid. */
+std::list all_processes;
+std::list all_threads;
-ptid_t
-pid_to_ptid (int pid)
-{
- return ptid_build (pid, 0, 0);
-}
+struct thread_info *current_thread;
-/* Fetch the pid (process id) component from a ptid. */
-
-int
-ptid_get_pid (ptid_t ptid)
-{
- return ptid.pid;
-}
+/* The current working directory used to start the inferior. */
+static const char *current_inferior_cwd = NULL;
-/* Fetch the lwp (lightweight process) component from a ptid. */
-
-long
-ptid_get_lwp (ptid_t ptid)
+struct thread_info *
+add_thread (ptid_t thread_id, void *target_data)
{
- return ptid.lwp;
-}
+ struct thread_info *new_thread = XCNEW (struct thread_info);
-/* Fetch the tid (thread id) component from a ptid. */
+ new_thread->id = thread_id;
+ new_thread->last_resume_kind = resume_continue;
+ new_thread->last_status.kind = TARGET_WAITKIND_IGNORE;
-long
-ptid_get_tid (ptid_t ptid)
-{
- return ptid.tid;
-}
+ all_threads.push_back (new_thread);
-/* ptid_equal() is used to test equality of two ptids. */
+ if (current_thread == NULL)
+ current_thread = new_thread;
-int
-ptid_equal (ptid_t ptid1, ptid_t ptid2)
-{
- return (ptid1.pid == ptid2.pid
- && ptid1.lwp == ptid2.lwp
- && ptid1.tid == ptid2.tid);
-}
-
-/* Return true if this ptid represents a process. */
+ new_thread->target_data = target_data;
-int
-ptid_is_pid (ptid_t ptid)
-{
- if (ptid_equal (minus_one_ptid, ptid))
- return 0;
- if (ptid_equal (null_ptid, ptid))
- return 0;
-
- return (ptid_get_pid (ptid) != 0
- && ptid_get_lwp (ptid) == 0
- && ptid_get_tid (ptid) == 0);
+ return new_thread;
}
-#define get_thread(inf) ((struct thread_info *)(inf))
-#define get_dll(inf) ((struct dll_info *)(inf))
+/* See gdbthread.h. */
-void
-add_inferior_to_list (struct inferior_list *list,
- struct inferior_list_entry *new_inferior)
+struct thread_info *
+get_first_thread (void)
{
- new_inferior->next = NULL;
- if (list->tail != NULL)
- list->tail->next = new_inferior;
+ if (!all_threads.empty ())
+ return all_threads.front ();
else
- list->head = new_inferior;
- list->tail = new_inferior;
+ return NULL;
}
-void
-for_each_inferior (struct inferior_list *list,
- void (*action) (struct inferior_list_entry *))
-{
- struct inferior_list_entry *cur = list->head, *next;
-
- while (cur != NULL)
- {
- next = cur->next;
- (*action) (cur);
- cur = next;
- }
-}
-
-void
-remove_inferior (struct inferior_list *list,
- struct inferior_list_entry *entry)
+struct thread_info *
+find_thread_ptid (ptid_t ptid)
{
- struct inferior_list_entry **cur;
-
- if (list->head == entry)
- {
- list->head = entry->next;
- if (list->tail == entry)
- list->tail = list->head;
- return;
- }
-
- cur = &list->head;
- while (*cur && (*cur)->next != entry)
- cur = &(*cur)->next;
-
- if (*cur == NULL)
- return;
-
- (*cur)->next = entry->next;
-
- if (list->tail == entry)
- list->tail = *cur;
+ return find_thread ([&] (thread_info *thread) {
+ return thread->id == ptid;
+ });
}
-void
-add_thread (ptid_t thread_id, void *target_data)
-{
- struct thread_info *new_thread = xmalloc (sizeof (*new_thread));
-
- memset (new_thread, 0, sizeof (*new_thread));
-
- new_thread->entry.id = thread_id;
-
- add_inferior_to_list (&all_threads, & new_thread->entry);
-
- if (current_inferior == NULL)
- current_inferior = new_thread;
-
- new_thread->target_data = target_data;
- set_inferior_regcache_data (new_thread, new_register_cache ());
-}
+/* Find a thread associated with the given PROCESS, or NULL if no
+ such thread exists. */
-ptid_t
-thread_id_to_gdb_id (ptid_t thread_id)
+static struct thread_info *
+find_thread_process (const struct process_info *const process)
{
- struct inferior_list_entry *inf = all_threads.head;
-
- while (inf != NULL)
- {
- if (ptid_equal (inf->id, thread_id))
- return thread_id;
- inf = inf->next;
- }
-
- return null_ptid;
+ return find_any_thread_of_pid (process->pid);
}
-ptid_t
-thread_to_gdb_id (struct thread_info *thread)
-{
- return thread->entry.id;
-}
+/* See gdbthread.h. */
struct thread_info *
-find_thread_pid (ptid_t ptid)
+find_any_thread_of_pid (int pid)
{
- struct inferior_list_entry *inf = all_threads.head;
-
- while (inf != NULL)
- {
- struct thread_info *thread = get_thread (inf);
- if (ptid_equal (thread->entry.id, ptid))
- return thread;
- inf = inf->next;
- }
-
- return NULL;
-}
-
-ptid_t
-gdb_id_to_thread_id (ptid_t gdb_id)
-{
- struct thread_info *thread = find_thread_pid (gdb_id);
-
- return thread ? thread->entry.id : null_ptid;
+ return find_thread (pid, [] (thread_info *thread) {
+ return true;
+ });
}
static void
-free_one_thread (struct inferior_list_entry *inf)
+free_one_thread (thread_info *thread)
{
- struct thread_info *thread = get_thread (inf);
- free_register_cache (inferior_regcache_data (thread));
+ free_register_cache (thread_regcache_data (thread));
free (thread);
}
void
remove_thread (struct thread_info *thread)
{
- remove_inferior (&all_threads, (struct inferior_list_entry *) thread);
- free_one_thread (&thread->entry);
-}
-
-struct inferior_list_entry *
-find_inferior (struct inferior_list *list,
- int (*func) (struct inferior_list_entry *, void *), void *arg)
-{
- struct inferior_list_entry *inf = list->head;
-
- while (inf != NULL)
- {
- struct inferior_list_entry *next;
-
- next = inf->next;
- if ((*func) (inf, arg))
- return inf;
- inf = next;
- }
+ if (thread->btrace != NULL)
+ target_disable_btrace (thread->btrace);
- return NULL;
-}
-
-struct inferior_list_entry *
-find_inferior_id (struct inferior_list *list, ptid_t id)
-{
- struct inferior_list_entry *inf = list->head;
-
- while (inf != NULL)
- {
- if (ptid_equal (inf->id, id))
- return inf;
- inf = inf->next;
- }
-
- return NULL;
+ discard_queued_stop_replies (ptid_of (thread));
+ all_threads.remove (thread);
+ free_one_thread (thread);
+ if (current_thread == thread)
+ current_thread = NULL;
}
void *
-inferior_target_data (struct thread_info *inferior)
+thread_target_data (struct thread_info *thread)
{
- return inferior->target_data;
+ return thread->target_data;
}
-void
-set_inferior_target_data (struct thread_info *inferior, void *data)
+struct regcache *
+thread_regcache_data (struct thread_info *thread)
{
- inferior->target_data = data;
-}
-
-void *
-inferior_regcache_data (struct thread_info *inferior)
-{
- return inferior->regcache_data;
+ return thread->regcache_data;
}
void
-set_inferior_regcache_data (struct thread_info *inferior, void *data)
+set_thread_regcache_data (struct thread_info *thread, struct regcache *data)
{
- inferior->regcache_data = data;
+ thread->regcache_data = data;
}
-static void
-free_one_dll (struct inferior_list_entry *inf)
+void
+clear_inferiors (void)
{
- struct dll_info *dll = get_dll (inf);
- if (dll->name != NULL)
- free (dll->name);
- free (dll);
-}
+ for_each_thread (free_one_thread);
+ all_threads.clear ();
-/* Find a DLL with the same name and/or base address. A NULL name in
- the key is ignored; so is an all-ones base address. */
+ clear_dlls ();
-static int
-match_dll (struct inferior_list_entry *inf, void *arg)
-{
- struct dll_info *iter = (void *) inf;
- struct dll_info *key = arg;
-
- if (key->base_addr != ~(CORE_ADDR) 0
- && iter->base_addr == key->base_addr)
- return 1;
- else if (key->name != NULL
- && iter->name != NULL
- && strcmp (key->name, iter->name) == 0)
- return 1;
-
- return 0;
+ current_thread = NULL;
}
-/* Record a newly loaded DLL at BASE_ADDR. */
-
-void
-loaded_dll (const char *name, CORE_ADDR base_addr)
+struct process_info *
+add_process (int pid, int attached)
{
- struct dll_info *new_dll = xmalloc (sizeof (*new_dll));
- memset (new_dll, 0, sizeof (*new_dll));
-
- new_dll->entry.id = minus_one_ptid;
+ process_info *process = new process_info (pid, attached);
- new_dll->name = xstrdup (name);
- new_dll->base_addr = base_addr;
+ all_processes.push_back (process);
- add_inferior_to_list (&all_dlls, &new_dll->entry);
- dlls_changed = 1;
+ return process;
}
-/* Record that the DLL with NAME and BASE_ADDR has been unloaded. */
+/* Remove a process from the common process list and free the memory
+ allocated for it.
+ The caller is responsible for freeing private data first. */
void
-unloaded_dll (const char *name, CORE_ADDR base_addr)
+remove_process (struct process_info *process)
{
- struct dll_info *dll;
- struct dll_info key_dll;
-
- /* Be careful not to put the key DLL in any list. */
- key_dll.name = (char *) name;
- key_dll.base_addr = base_addr;
-
- dll = (void *) find_inferior (&all_dlls, match_dll, &key_dll);
- remove_inferior (&all_dlls, &dll->entry);
- free_one_dll (&dll->entry);
- dlls_changed = 1;
+ clear_symbol_cache (&process->symbol_cache);
+ free_all_breakpoints (process);
+ gdb_assert (find_thread_process (process) == NULL);
+ all_processes.remove (process);
+ delete process;
}
-#define clear_list(LIST) \
- do { (LIST)->head = (LIST)->tail = NULL; } while (0)
-
-void
-clear_inferiors (void)
+process_info *
+find_process_pid (int pid)
{
- for_each_inferior (&all_threads, free_one_thread);
- for_each_inferior (&all_dlls, free_one_dll);
+ return find_process ([&] (process_info *process) {
+ return process->pid == pid;
+ });
+}
- clear_list (&all_threads);
- clear_list (&all_dlls);
+/* Get the first process in the process list, or NULL if the list is empty. */
- current_inferior = NULL;
+process_info *
+get_first_process (void)
+{
+ if (!all_processes.empty ())
+ return all_processes.front ();
+ else
+ return NULL;
}
-/* Two utility functions for a truly degenerate inferior_list: a simple
- PID listing. */
+/* Return non-zero if there are any inferiors that we have created
+ (as opposed to attached-to). */
-void
-add_pid_to_list (struct inferior_list *list, unsigned long pid)
+int
+have_started_inferiors_p (void)
{
- struct inferior_list_entry *new_entry;
-
- new_entry = xmalloc (sizeof (struct inferior_list_entry));
- new_entry->id = pid_to_ptid (pid);
- add_inferior_to_list (list, new_entry);
+ return find_process ([] (process_info *process) {
+ return !process->attached;
+ }) != NULL;
}
+/* Return non-zero if there are any inferiors that we have attached to. */
+
int
-pull_pid_from_list (struct inferior_list *list, unsigned long pid)
+have_attached_inferiors_p (void)
{
- struct inferior_list_entry *new_entry;
-
- new_entry = find_inferior_id (list, pid_to_ptid (pid));
- if (new_entry == NULL)
- return 0;
- else
- {
- remove_inferior (list, new_entry);
- free (new_entry);
- return 1;
- }
+ return find_process ([] (process_info *process) {
+ return process->attached;
+ }) != NULL;
}
struct process_info *
-add_process (int pid, int attached)
+get_thread_process (const struct thread_info *thread)
{
- struct process_info *process;
-
- process = xcalloc (1, sizeof (*process));
-
- process->head.id = pid_to_ptid (pid);
- process->attached = attached;
-
- add_inferior_to_list (&all_processes, &process->head);
+ return find_process_pid (thread->id.pid ());
+}
- return process;
+struct process_info *
+current_process (void)
+{
+ gdb_assert (current_thread != NULL);
+ return get_thread_process (current_thread);
}
-/* Remove a process from the common process list and free the memory
- allocated for it.
- The caller is responsible for freeing private data first. */
+/* See common/common-gdbthread.h. */
void
-remove_process (struct process_info *process)
+switch_to_thread (ptid_t ptid)
{
- clear_symbol_cache (&process->symbol_cache);
- free_all_breakpoints (process);
- remove_inferior (&all_processes, &process->head);
- free (process);
+ gdb_assert (ptid != minus_one_ptid);
+ current_thread = find_thread_ptid (ptid);
}
-struct process_info *
-find_process_pid (int pid)
-{
- return (struct process_info *)
- find_inferior_id (&all_processes, pid_to_ptid (pid));
-}
+/* See common/common-inferior.h. */
-struct process_info *
-get_thread_process (struct thread_info *thread)
+const char *
+get_inferior_cwd ()
{
- int pid = ptid_get_pid (thread->entry.id);
- return find_process_pid (pid);
+ return current_inferior_cwd;
}
-struct process_info *
-current_process (void)
-{
- if (current_inferior == NULL)
- fatal ("Current inferior requested, but current_inferior is NULL\n");
-
- return get_thread_process (current_inferior);
-}
+/* See common/common-inferior.h. */
void
-initialize_inferiors (void)
+set_inferior_cwd (const char *cwd)
{
- null_ptid = ptid_build (0, 0, 0);
- minus_one_ptid = ptid_build (-1, 0, 0);
+ xfree ((void *) current_inferior_cwd);
+ if (cwd != NULL)
+ current_inferior_cwd = xstrdup (cwd);
+ else
+ current_inferior_cwd = NULL;
}