/* Inferior process information for the remote server for GDB.
- Copyright (C) 2002, 2005, 2007-2012 Free Software Foundation, Inc.
+ Copyright (C) 2002-2017 Free Software Foundation, Inc.
Contributed by MontaVista Software.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
-#include <stdlib.h>
-
#include "server.h"
+#include "gdbthread.h"
+#include "dll.h"
struct inferior_list all_processes;
struct inferior_list all_threads;
-struct thread_info *current_inferior;
+struct thread_info *current_thread;
#define get_thread(inf) ((struct thread_info *)(inf))
}
}
+/* Invoke ACTION for each inferior in LIST, passing DATA to ACTION. */
+
+void
+for_each_inferior_with_data (struct inferior_list *list,
+ void (*action) (struct inferior_list_entry *,
+ void *),
+ void *data)
+{
+ struct inferior_list_entry *cur = list->head, *next;
+
+ while (cur != NULL)
+ {
+ next = cur->next;
+ (*action) (cur, data);
+ cur = next;
+ }
+}
+
void
remove_inferior (struct inferior_list *list,
struct inferior_list_entry *entry)
list->tail = *cur;
}
-void
+struct thread_info *
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));
+ struct thread_info *new_thread = XCNEW (struct thread_info);
new_thread->entry.id = thread_id;
new_thread->last_resume_kind = resume_continue;
new_thread->last_status.kind = TARGET_WAITKIND_IGNORE;
- add_inferior_to_list (&all_threads, & new_thread->entry);
+ add_inferior_to_list (&all_threads, &new_thread->entry);
- if (current_inferior == NULL)
- current_inferior = new_thread;
+ if (current_thread == NULL)
+ current_thread = new_thread;
new_thread->target_data = target_data;
- set_inferior_regcache_data (new_thread, new_register_cache ());
-}
-ptid_t
-thread_id_to_gdb_id (ptid_t thread_id)
-{
- 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 new_thread;
}
-ptid_t
-thread_to_gdb_id (struct thread_info *thread)
+/* Wrapper around get_first_inferior to return a struct thread_info *. */
+
+struct thread_info *
+get_first_thread (void)
{
- return thread->entry.id;
+ return (struct thread_info *) get_first_inferior (&all_threads);
}
struct thread_info *
find_thread_ptid (ptid_t ptid)
{
- struct inferior_list_entry *inf = all_threads.head;
+ return (struct thread_info *) find_inferior_id (&all_threads, ptid);
+}
- while (inf != NULL)
- {
- struct thread_info *thread = get_thread (inf);
- if (ptid_equal (thread->entry.id, ptid))
- return thread;
- inf = inf->next;
- }
+/* Find a thread associated with the given PROCESS, or NULL if no
+ such thread exists. */
- return NULL;
+static struct thread_info *
+find_thread_process (const struct process_info *const process)
+{
+ return find_any_thread_of_pid (process->entry.id.pid ());
+}
+
+/* Helper for find_any_thread_of_pid. Returns true if a thread
+ matches a PID. */
+
+static int
+thread_of_pid (struct inferior_list_entry *entry, void *pid_p)
+{
+ int pid = *(int *) pid_p;
+
+ return (ptid_get_pid (entry->id) == pid);
}
-ptid_t
-gdb_id_to_thread_id (ptid_t gdb_id)
+/* See gdbthread.h. */
+
+struct thread_info *
+find_any_thread_of_pid (int pid)
{
- struct thread_info *thread = find_thread_ptid (gdb_id);
+ struct inferior_list_entry *entry;
- return thread ? thread->entry.id : null_ptid;
+ entry = find_inferior (&all_threads, thread_of_pid, &pid);
+
+ return (struct thread_info *) entry;
}
static void
free_one_thread (struct inferior_list_entry *inf)
{
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)
{
+ if (thread->btrace != NULL)
+ target_disable_btrace (thread->btrace);
+
+ discard_queued_stop_replies (ptid_of (thread));
remove_inferior (&all_threads, (struct inferior_list_entry *) thread);
free_one_thread (&thread->entry);
+ if (current_thread == thread)
+ current_thread = NULL;
+}
+
+/* Return a pointer to the first inferior in LIST, or NULL if there isn't one.
+ This is for cases where the caller needs a thread, but doesn't care
+ which one. */
+
+struct inferior_list_entry *
+get_first_inferior (struct inferior_list *list)
+{
+ if (list->head != NULL)
+ return list->head;
+ return NULL;
}
/* Find the first inferior_list_entry E in LIST for which FUNC (E, ARG)
return NULL;
}
+/* Find the random inferior_list_entry E in LIST for which FUNC (E, ARG)
+ returns non-zero. If no entry is found then return NULL. */
+
+struct inferior_list_entry *
+find_inferior_in_random (struct inferior_list *list,
+ int (*func) (struct inferior_list_entry *, void *),
+ void *arg)
+{
+ struct inferior_list_entry *inf = list->head;
+ int count = 0;
+ int random_selector;
+
+ /* First count how many interesting entries we have. */
+ while (inf != NULL)
+ {
+ struct inferior_list_entry *next;
+
+ next = inf->next;
+ if ((*func) (inf, arg))
+ count++;
+ inf = next;
+ }
+
+ if (count == 0)
+ return NULL;
+
+ /* Now randomly pick an entry out of those. */
+ random_selector = (int)
+ ((count * (double) rand ()) / (RAND_MAX + 1.0));
+
+ inf = list->head;
+ while (inf != NULL)
+ {
+ struct inferior_list_entry *next;
+
+ next = inf->next;
+ if ((*func) (inf, arg) && (random_selector-- == 0))
+ return inf;
+ inf = next;
+ }
+
+ gdb_assert_not_reached ("failed to find an inferior in random.");
+ return NULL;
+}
+
struct inferior_list_entry *
find_inferior_id (struct inferior_list *list, ptid_t id)
{
}
void *
-inferior_target_data (struct thread_info *inferior)
+thread_target_data (struct thread_info *thread)
{
- return inferior->target_data;
+ return thread->target_data;
+}
+
+struct regcache *
+thread_regcache_data (struct thread_info *thread)
+{
+ return thread->regcache_data;
}
void
-set_inferior_target_data (struct thread_info *inferior, void *data)
+set_thread_regcache_data (struct thread_info *thread, struct regcache *data)
{
- inferior->target_data = data;
+ thread->regcache_data = data;
}
-void *
-inferior_regcache_data (struct thread_info *inferior)
+/* Return true if LIST has exactly one entry. */
+
+int
+one_inferior_p (struct inferior_list *list)
{
- return inferior->regcache_data;
+ return list->head != NULL && list->head == list->tail;
}
+/* Reset head,tail of LIST, assuming all entries have already been freed. */
+
void
-set_inferior_regcache_data (struct thread_info *inferior, void *data)
+clear_inferior_list (struct inferior_list *list)
{
- inferior->regcache_data = data;
+ list->head = NULL;
+ list->tail = NULL;
}
-#define clear_list(LIST) \
- do { (LIST)->head = (LIST)->tail = NULL; } while (0)
-
void
clear_inferiors (void)
{
for_each_inferior (&all_threads, free_one_thread);
- clear_list (&all_threads);
+ clear_inferior_list (&all_threads);
clear_dlls ();
- current_inferior = NULL;
+ current_thread = NULL;
}
struct process_info *
add_process (int pid, int attached)
{
- struct process_info *process;
-
- process = xcalloc (1, sizeof (*process));
+ struct process_info *process = XCNEW (struct process_info);
- process->head.id = pid_to_ptid (pid);
+ process->entry.id = pid_to_ptid (pid);
process->attached = attached;
- add_inferior_to_list (&all_processes, &process->head);
+ add_inferior_to_list (&all_processes, &process->entry);
return process;
}
{
clear_symbol_cache (&process->symbol_cache);
free_all_breakpoints (process);
- remove_inferior (&all_processes, &process->head);
+ gdb_assert (find_thread_process (process) == NULL);
+ remove_inferior (&all_processes, &process->entry);
+ VEC_free (int, process->syscalls_to_catch);
free (process);
}
find_inferior_id (&all_processes, pid_to_ptid (pid));
}
+/* Wrapper around get_first_inferior to return a struct process_info *. */
+
+struct process_info *
+get_first_process (void)
+{
+ return (struct process_info *) get_first_inferior (&all_processes);
+}
+
/* Return non-zero if INF, a struct process_info, was started by us,
i.e. not attached to. */
}
struct process_info *
-get_thread_process (struct thread_info *thread)
+get_thread_process (const struct thread_info *thread)
{
int pid = ptid_get_pid (thread->entry.id);
return find_process_pid (pid);
struct process_info *
current_process (void)
{
- if (current_inferior == NULL)
- fatal ("Current inferior requested, but current_inferior is NULL\n");
+ gdb_assert (current_thread != NULL);
+ return get_thread_process (current_thread);
+}
+
+static void
+do_restore_current_thread_cleanup (void *arg)
+{
+ current_thread = (struct thread_info *) arg;
+}
+
+struct cleanup *
+make_cleanup_restore_current_thread (void)
+{
+ return make_cleanup (do_restore_current_thread_cleanup, current_thread);
+}
- return get_thread_process (current_inferior);
+/* See common/common-gdbthread.h. */
+
+void
+switch_to_thread (ptid_t ptid)
+{
+ if (!ptid_equal (ptid, minus_one_ptid))
+ current_thread = find_thread_ptid (ptid);
}
projects / deliverable / binutils-gdb.git / blobdiff