mirror of
https://sourceware.org/git/binutils-gdb.git
synced 2025-01-12 12:16:04 +08:00
4d3bb80e5d
It happens often that we want to iterate or find threads restricted to a given pid. I think it's worth having an overload to help with this. Right now there is a single user of each of the find_thread and for_each_thread overload, but as we replace the usages of find_inferior with for_each_thread/find_thread, more usages will pop up. gdb/gdbserver/ChangeLog: * gdbthread.h (find_thread, for_each_thread): New functions. * inferiors.c (thread_of_pid): Remove. (find_any_thread_of_pid): Use find_thread. * linux-low.c (num_lwps): Use for_each_thread.
315 lines
6.8 KiB
C
315 lines
6.8 KiB
C
/* Inferior process information for the remote server for GDB.
|
|
Copyright (C) 2002-2017 Free Software Foundation, Inc.
|
|
|
|
Contributed by MontaVista Software.
|
|
|
|
This file is part of GDB.
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
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 "server.h"
|
|
#include "gdbthread.h"
|
|
#include "dll.h"
|
|
|
|
std::list<process_info *> all_processes;
|
|
std::list<thread_info *> all_threads;
|
|
|
|
struct thread_info *current_thread;
|
|
|
|
/* The current working directory used to start the inferior. */
|
|
static const char *current_inferior_cwd = NULL;
|
|
|
|
thread_info *
|
|
find_inferior (std::list<thread_info *> *thread_list,
|
|
int (*func) (thread_info *, void *),
|
|
void *arg)
|
|
{
|
|
gdb_assert (thread_list == &all_threads);
|
|
|
|
return find_thread ([&] (thread_info *thread) {
|
|
return func (thread, arg);
|
|
});
|
|
}
|
|
|
|
thread_info *
|
|
find_inferior_id (std::list<thread_info *> *thread_list, ptid_t id)
|
|
{
|
|
gdb_assert (thread_list == &all_threads);
|
|
|
|
return find_thread ([&] (thread_info *thread) {
|
|
return thread->id == id;
|
|
});
|
|
}
|
|
|
|
thread_info *
|
|
find_inferior_in_random (std::list<thread_info *> *thread_list,
|
|
int (*func) (thread_info *, void *),
|
|
void *arg)
|
|
{
|
|
gdb_assert (thread_list == &all_threads);
|
|
|
|
return find_thread_in_random ([&] (thread_info *thread) {
|
|
return func (thread, arg);
|
|
});
|
|
}
|
|
|
|
void
|
|
for_each_inferior (std::list<thread_info *> *thread_list,
|
|
void (*action) (thread_info *))
|
|
{
|
|
gdb_assert (thread_list == &all_threads);
|
|
|
|
for_each_thread ([&] (thread_info *thread) {
|
|
action (thread);
|
|
});
|
|
}
|
|
|
|
void
|
|
for_each_inferior_with_data (std::list<thread_info *> *thread_list,
|
|
void (*action) (thread_info *, void *),
|
|
void *data)
|
|
{
|
|
gdb_assert (thread_list == &all_threads);
|
|
|
|
for_each_thread ([&] (thread_info *thread) {
|
|
action (thread, data);
|
|
});
|
|
}
|
|
|
|
struct thread_info *
|
|
add_thread (ptid_t thread_id, void *target_data)
|
|
{
|
|
struct thread_info *new_thread = XCNEW (struct thread_info);
|
|
|
|
new_thread->id = thread_id;
|
|
new_thread->last_resume_kind = resume_continue;
|
|
new_thread->last_status.kind = TARGET_WAITKIND_IGNORE;
|
|
|
|
all_threads.push_back (new_thread);
|
|
|
|
if (current_thread == NULL)
|
|
current_thread = new_thread;
|
|
|
|
new_thread->target_data = target_data;
|
|
|
|
return new_thread;
|
|
}
|
|
|
|
/* See gdbthread.h. */
|
|
|
|
struct thread_info *
|
|
get_first_thread (void)
|
|
{
|
|
if (!all_threads.empty ())
|
|
return all_threads.front ();
|
|
else
|
|
return NULL;
|
|
}
|
|
|
|
struct thread_info *
|
|
find_thread_ptid (ptid_t ptid)
|
|
{
|
|
return (struct thread_info *) find_inferior_id (&all_threads, ptid);
|
|
}
|
|
|
|
/* Find a thread associated with the given PROCESS, or NULL if no
|
|
such thread exists. */
|
|
|
|
static struct thread_info *
|
|
find_thread_process (const struct process_info *const process)
|
|
{
|
|
return find_any_thread_of_pid (process->pid);
|
|
}
|
|
|
|
/* See gdbthread.h. */
|
|
|
|
struct thread_info *
|
|
find_any_thread_of_pid (int pid)
|
|
{
|
|
return find_thread (pid, [] (thread_info *thread) {
|
|
return true;
|
|
});
|
|
}
|
|
|
|
static void
|
|
free_one_thread (thread_info *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));
|
|
all_threads.remove (thread);
|
|
free_one_thread (thread);
|
|
if (current_thread == thread)
|
|
current_thread = NULL;
|
|
}
|
|
|
|
void *
|
|
thread_target_data (struct thread_info *thread)
|
|
{
|
|
return thread->target_data;
|
|
}
|
|
|
|
struct regcache *
|
|
thread_regcache_data (struct thread_info *thread)
|
|
{
|
|
return thread->regcache_data;
|
|
}
|
|
|
|
void
|
|
set_thread_regcache_data (struct thread_info *thread, struct regcache *data)
|
|
{
|
|
thread->regcache_data = data;
|
|
}
|
|
|
|
void
|
|
clear_inferiors (void)
|
|
{
|
|
for_each_inferior (&all_threads, free_one_thread);
|
|
all_threads.clear ();
|
|
|
|
clear_dlls ();
|
|
|
|
current_thread = NULL;
|
|
}
|
|
|
|
struct process_info *
|
|
add_process (int pid, int attached)
|
|
{
|
|
struct process_info *process = XCNEW (struct process_info);
|
|
|
|
process->pid = pid;
|
|
process->attached = attached;
|
|
|
|
all_processes.push_back (process);
|
|
|
|
return process;
|
|
}
|
|
|
|
/* 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
|
|
remove_process (struct process_info *process)
|
|
{
|
|
clear_symbol_cache (&process->symbol_cache);
|
|
free_all_breakpoints (process);
|
|
gdb_assert (find_thread_process (process) == NULL);
|
|
all_processes.remove (process);
|
|
VEC_free (int, process->syscalls_to_catch);
|
|
free (process);
|
|
}
|
|
|
|
process_info *
|
|
find_process_pid (int pid)
|
|
{
|
|
return find_process ([&] (process_info *process) {
|
|
return process->pid == pid;
|
|
});
|
|
}
|
|
|
|
/* Get the first process in the process list, or NULL if the list is empty. */
|
|
|
|
process_info *
|
|
get_first_process (void)
|
|
{
|
|
if (!all_processes.empty ())
|
|
return all_processes.front ();
|
|
else
|
|
return NULL;
|
|
}
|
|
|
|
/* Return non-zero if there are any inferiors that we have created
|
|
(as opposed to attached-to). */
|
|
|
|
int
|
|
have_started_inferiors_p (void)
|
|
{
|
|
return find_process ([] (process_info *process) {
|
|
return !process->attached;
|
|
}) != NULL;
|
|
}
|
|
|
|
/* Return non-zero if there are any inferiors that we have attached to. */
|
|
|
|
int
|
|
have_attached_inferiors_p (void)
|
|
{
|
|
return find_process ([] (process_info *process) {
|
|
return process->attached;
|
|
}) != NULL;
|
|
}
|
|
|
|
struct process_info *
|
|
get_thread_process (const struct thread_info *thread)
|
|
{
|
|
return find_process_pid (thread->id.pid ());
|
|
}
|
|
|
|
struct process_info *
|
|
current_process (void)
|
|
{
|
|
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);
|
|
}
|
|
|
|
/* See common/common-gdbthread.h. */
|
|
|
|
void
|
|
switch_to_thread (ptid_t ptid)
|
|
{
|
|
gdb_assert (ptid != minus_one_ptid);
|
|
current_thread = find_thread_ptid (ptid);
|
|
}
|
|
|
|
/* See common/common-inferior.h. */
|
|
|
|
const char *
|
|
get_inferior_cwd ()
|
|
{
|
|
return current_inferior_cwd;
|
|
}
|
|
|
|
/* See common/common-inferior.h. */
|
|
|
|
void
|
|
set_inferior_cwd (const char *cwd)
|
|
{
|
|
xfree ((void *) current_inferior_cwd);
|
|
if (cwd != NULL)
|
|
current_inferior_cwd = xstrdup (cwd);
|
|
else
|
|
current_inferior_cwd = NULL;
|
|
}
|