forked from Imagelibrary/binutils-gdb
757186093b
This patch implements a basic target_ops for Linux kernel support. In particular it models Linux tasks as GDB threads such that you are able to change to a given thread, get backtraces, disassemble the current frame etc.. Currently the target_ops is designed only to work with static targets, i.e. dumps. Thus it lacks implementation for hooks like to_wait, to_resume or to_store_registers. Furthermore the mapping between a CPU and the task_struct of the running task is only be done once at initialization. See cover letter for a detailed discussion. Nevertheless i made some design decisions different to Peter [1] which are worth discussing. Especially storing the private data in a htab (or std::unordered_map if i had the time...) instead of global variables makes the code much nicer and less memory consuming. [1] https://sourceware.org/ml/gdb-patches/2016-12/msg00382.html gdb/ChangeLog: * gdbarch.sh (lk_init_private): New hook. * gdbarch.h: Regenerated. * gdbarch.c: Regenerated. * lk-low.h: New file. * lk-low.c: New file. * lk-lists.h: New file. * lk-lists.c: New file. * Makefile.in (SFILES, ALLDEPFILES): Add lk-low.c and lk-lists.c. (HFILES_NO_SRCDIR): Add lk-low.h and lk-lists.h. (ALL_TARGET_OBS): Add lk-low.o (COMMON_OBS): Add lk-lists.o
48 lines
1.6 KiB
C
48 lines
1.6 KiB
C
/* Iterators for internal data structures of the Linux kernel.
|
|
|
|
Copyright (C) 2016 Free Software Foundation, Inc.
|
|
|
|
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 "defs.h"
|
|
|
|
#include "inferior.h"
|
|
#include "lk-lists.h"
|
|
#include "lk-low.h"
|
|
|
|
/* Returns next entry from struct list_head CURR while iterating field
|
|
SNAME->FNAME. */
|
|
|
|
CORE_ADDR
|
|
lk_list_head_next (CORE_ADDR curr, const char *sname, const char *fname)
|
|
{
|
|
CORE_ADDR next, next_prev;
|
|
|
|
/* We must always assume that the data we handle is corrupted. Thus use
|
|
curr->next->prev == curr as sanity check. */
|
|
next = lk_read_addr (curr + LK_OFFSET (list_head, next));
|
|
next_prev = lk_read_addr (next + LK_OFFSET (list_head, prev));
|
|
|
|
if (!curr || curr != next_prev)
|
|
{
|
|
error (_("Memory corruption detected while iterating list_head at "\
|
|
"0x%s belonging to list %s->%s."),
|
|
phex (curr, lk_builtin_type_size (unsigned_long)) , sname, fname);
|
|
}
|
|
|
|
return next;
|
|
}
|