mirror of
https://github.com/bminor/binutils-gdb.git
synced 2025-11-16 04:24:43 +00:00
The XSAVE function set is organized in state components, which are a set of registers or parts of registers. So-called XSAVE-supported features are organized using state-component bitmaps, each bit corresponding to a single state component. The Intel Software Developer's Manual uses the term xstate_bv for a state-component bitmap, which is defined as XCR0 | IA32_XSS. The control register XCR0 only contains a state-component bitmap that specifies user state components, while IA32_XSS contains a state-component bitmap that specifies supervisor state components. Until now, XCR0 is used as input for target description creation in GDB. However, a following patch will add userspace support for the CET shadow stack feature by Intel. The CET state is configured in IA32_XSS and consists of 2 state components: - State component 11 used for the 2 MSRs controlling user-mode functionality for CET (CET_U state) - State component 12 used for the 3 MSRs containing shadow-stack pointers for privilege levels 0-2 (CET_S state). Reading the CET shadow stack pointer register on linux requires a separate ptrace call using NT_X86_SHSTK. To pass the CET shadow stack enablement state we would like to pass the xstate_bv value instead of xcr0 for target description creation. To prepare for that, we rename the xcr0 mask values for target description creation to xstate_bv. However, this patch doesn't add any functional changes in GDB. Future states specified in IA32_XSS such as CET will create a combined xstate_bv_mask including xcr0 register value and its corresponding bit in the state component bitmap. This combined mask will then be used to create the target descriptions. Reviewed-By: Thiago Jung Bauermann <thiago.bauermann@linaro.org> Approved-By: Luis Machado <luis.machado@arm.com>
170 lines
4.6 KiB
C++
170 lines
4.6 KiB
C++
/* GNU/Linux/x86-64 specific low level interface, for the in-process
|
|
agent library for GDB.
|
|
|
|
Copyright (C) 2010-2025 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 <sys/mman.h>
|
|
#include "tracepoint.h"
|
|
#include "gdbsupport/x86-xstate.h"
|
|
#include "arch/amd64-linux-tdesc.h"
|
|
#include "arch/x86-linux-tdesc-features.h"
|
|
|
|
/* fast tracepoints collect registers. */
|
|
|
|
#define FT_CR_RIP 0
|
|
#define FT_CR_EFLAGS 1
|
|
#define FT_CR_R8 2
|
|
#define FT_CR_R9 3
|
|
#define FT_CR_R10 4
|
|
#define FT_CR_R11 5
|
|
#define FT_CR_R12 6
|
|
#define FT_CR_R13 7
|
|
#define FT_CR_R14 8
|
|
#define FT_CR_R15 9
|
|
#define FT_CR_RAX 10
|
|
#define FT_CR_RBX 11
|
|
#define FT_CR_RCX 12
|
|
#define FT_CR_RDX 13
|
|
#define FT_CR_RSI 14
|
|
#define FT_CR_RDI 15
|
|
#define FT_CR_RBP 16
|
|
#define FT_CR_RSP 17
|
|
|
|
static const int x86_64_ft_collect_regmap[] = {
|
|
FT_CR_RAX * 8, FT_CR_RBX * 8, FT_CR_RCX * 8, FT_CR_RDX * 8,
|
|
FT_CR_RSI * 8, FT_CR_RDI * 8, FT_CR_RBP * 8, FT_CR_RSP * 8,
|
|
FT_CR_R8 * 8, FT_CR_R9 * 8, FT_CR_R10 * 8, FT_CR_R11 * 8,
|
|
FT_CR_R12 * 8, FT_CR_R13 * 8, FT_CR_R14 * 8, FT_CR_R15 * 8,
|
|
FT_CR_RIP * 8, FT_CR_EFLAGS * 8
|
|
};
|
|
|
|
#define X86_64_NUM_FT_COLLECT_GREGS \
|
|
(sizeof (x86_64_ft_collect_regmap) / sizeof(x86_64_ft_collect_regmap[0]))
|
|
|
|
void
|
|
supply_fast_tracepoint_registers (struct regcache *regcache,
|
|
const unsigned char *buf)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < X86_64_NUM_FT_COLLECT_GREGS; i++)
|
|
supply_register (regcache, i,
|
|
((char *) buf) + x86_64_ft_collect_regmap[i]);
|
|
}
|
|
|
|
ULONGEST
|
|
get_raw_reg (const unsigned char *raw_regs, int regnum)
|
|
{
|
|
if (regnum >= X86_64_NUM_FT_COLLECT_GREGS)
|
|
return 0;
|
|
|
|
return *(ULONGEST *) (raw_regs + x86_64_ft_collect_regmap[regnum]);
|
|
}
|
|
|
|
/* Return target_desc to use for IPA, given the tdesc index passed by
|
|
gdbserver. */
|
|
|
|
const struct target_desc *
|
|
get_ipa_tdesc (int idx)
|
|
{
|
|
uint64_t xstate_bv = x86_linux_tdesc_idx_to_xstate_bv (idx);
|
|
|
|
#if defined __ILP32__
|
|
bool is_x32 = true;
|
|
#else
|
|
bool is_x32 = false;
|
|
#endif
|
|
|
|
return amd64_linux_read_description (xstate_bv, is_x32);
|
|
}
|
|
|
|
/* Allocate buffer for the jump pads. The branch instruction has a
|
|
reach of +/- 31-bit, and the executable is loaded at low addresses.
|
|
|
|
64-bit: Use MAP_32BIT to allocate in the first 2GB. Shared
|
|
libraries, being allocated at the top, are unfortunately out of
|
|
luck.
|
|
|
|
x32: Since MAP_32BIT is 64-bit only, do the placement manually.
|
|
Try allocating at '0x80000000 - SIZE' initially, decreasing until
|
|
we hit a free area. This ensures the executable is fully covered,
|
|
and is as close as possible to the shared libraries, which are
|
|
usually mapped at the top of the first 4GB of the address space.
|
|
*/
|
|
|
|
void *
|
|
alloc_jump_pad_buffer (size_t size)
|
|
{
|
|
#if __ILP32__
|
|
uintptr_t addr;
|
|
int pagesize;
|
|
|
|
pagesize = sysconf (_SC_PAGE_SIZE);
|
|
if (pagesize == -1)
|
|
perror_with_name ("sysconf");
|
|
|
|
addr = 0x80000000 - size;
|
|
|
|
/* size should already be page-aligned, but this can't hurt. */
|
|
addr &= ~(pagesize - 1);
|
|
|
|
/* Search for a free area. If we hit 0, we're out of luck. */
|
|
for (; addr; addr -= pagesize)
|
|
{
|
|
void *res;
|
|
|
|
/* No MAP_FIXED - we don't want to zap someone's mapping. */
|
|
res = mmap ((void *) addr, size,
|
|
PROT_READ | PROT_WRITE | PROT_EXEC,
|
|
MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
|
|
|
|
/* If we got what we wanted, return. */
|
|
if ((uintptr_t) res == addr)
|
|
return res;
|
|
|
|
/* If we got a mapping, but at a wrong address, undo it. */
|
|
if (res != MAP_FAILED)
|
|
munmap (res, size);
|
|
}
|
|
|
|
return NULL;
|
|
#else
|
|
void *res = mmap (NULL, size, PROT_READ | PROT_WRITE | PROT_EXEC,
|
|
MAP_PRIVATE | MAP_ANONYMOUS | MAP_32BIT, -1, 0);
|
|
|
|
if (res == MAP_FAILED)
|
|
return NULL;
|
|
|
|
return res;
|
|
#endif
|
|
}
|
|
|
|
void
|
|
initialize_low_tracepoint (void)
|
|
{
|
|
#if defined __ILP32__
|
|
for (int i = 0; i < x86_linux_x32_tdesc_count (); i++)
|
|
amd64_linux_read_description
|
|
(x86_linux_tdesc_idx_to_xstate_bv (i), true);
|
|
#else
|
|
for (int i = 0; i < x86_linux_amd64_tdesc_count (); i++)
|
|
amd64_linux_read_description
|
|
(x86_linux_tdesc_idx_to_xstate_bv (i), false);
|
|
#endif
|
|
}
|