mirror of
https://sourceware.org/git/binutils-gdb.git
synced 2025-01-06 12:09:26 +08:00
1d506c26d9
This commit is the result of the following actions:
- Running gdb/copyright.py to update all of the copyright headers to
include 2024,
- Manually updating a few files the copyright.py script told me to
update, these files had copyright headers embedded within the
file,
- Regenerating gdbsupport/Makefile.in to refresh it's copyright
date,
- Using grep to find other files that still mentioned 2023. If
these files were updated last year from 2022 to 2023 then I've
updated them this year to 2024.
I'm sure I've probably missed some dates. Feel free to fix them up as
you spot them.
78 lines
2.1 KiB
C
78 lines
2.1 KiB
C
/* Target-dependent code for X86-based targets.
|
|
|
|
Copyright (C) 2018-2024 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 "x86-tdep.h"
|
|
#include "symtab.h"
|
|
|
|
|
|
/* Check whether NAME is included in NAMES[LO] (inclusive) to NAMES[HI]
|
|
(exclusive). */
|
|
|
|
static bool
|
|
x86_is_thunk_register_name (const char *name, const char * const *names,
|
|
int lo, int hi)
|
|
{
|
|
int reg;
|
|
for (reg = lo; reg < hi; ++reg)
|
|
if (strcmp (name, names[reg]) == 0)
|
|
return true;
|
|
|
|
return false;
|
|
}
|
|
|
|
/* See x86-tdep.h. */
|
|
|
|
bool
|
|
x86_in_indirect_branch_thunk (CORE_ADDR pc, const char * const *register_names,
|
|
int lo, int hi)
|
|
{
|
|
struct bound_minimal_symbol bmfun = lookup_minimal_symbol_by_pc (pc);
|
|
if (bmfun.minsym == nullptr)
|
|
return false;
|
|
|
|
const char *name = bmfun.minsym->linkage_name ();
|
|
if (name == nullptr)
|
|
return false;
|
|
|
|
/* Check the indirect return thunk first. */
|
|
if (strcmp (name, "__x86_return_thunk") == 0)
|
|
return true;
|
|
|
|
/* Then check a family of indirect call/jump thunks. */
|
|
static const char thunk[] = "__x86_indirect_thunk";
|
|
static const size_t length = sizeof (thunk) - 1;
|
|
if (strncmp (name, thunk, length) != 0)
|
|
return false;
|
|
|
|
/* If that's the complete name, we're in the memory thunk. */
|
|
name += length;
|
|
if (*name == '\0')
|
|
return true;
|
|
|
|
/* Check for suffixes. */
|
|
if (*name++ != '_')
|
|
return false;
|
|
|
|
if (x86_is_thunk_register_name (name, register_names, lo, hi))
|
|
return true;
|
|
|
|
return false;
|
|
}
|