mirror of
https://sourceware.org/git/binutils-gdb.git
synced 2024-11-27 03:51:15 +08:00
c7defc5386
This patch adds support in GAS to create generic GAS instructions (a.k.a., the ginsn) for the x86 backend (AMD64 ABI only at this time). Using this ginsn infrastructure, GAS can then synthesize CFI for hand-written asm for x86_64. A ginsn is a target-independent representation of the machine instructions. One machine instruction may need one or more ginsn. This patch also adds skeleton support for printing ginsn in the listing output for debugging purposes. Since the current use-case of ginsn is to synthesize CFI, the x86 target needs to generate ginsns necessary for the following machine instructions only: - All change of flow instructions, including all conditional and unconditional branches, call and return from functions. - All register saves and unsaves to the stack. - All instructions affecting the two registers that could potentially be used as the base register for CFA tracking. For SCFI, the base register for CFA tracking is limited to REG_SP and REG_FP only for now. The representation of ginsn is kept simple: - GAS instruction has GINSN_NUM_SRC_OPNDS (defined to be 2 at this time) number of source operands and one destination operand at this time. - GAS instruction uses DWARF register numbers in its representation and does not track register size. - GAS instructions carry location information (file name and line number). - GAS instructions are ID's with a natural number in order of their addtion to the list. This can be used as a proxy for the static program order of the corresponding machine instructions. Note that, GAS instruction (ginsn) format does not support GINSN_TYPE_PUSH and GINSN_TYPE_POP. Some architectures, like aarch64, do not have push and pop instructions, but rather STP/LDP/STR/LDR etc. instructions. Further these instructions have a variety of addressing modes, like offset, pre-indexing and post-indexing etc. Among other things, one of differences in these addressing modes is _when_ the addr register is updated with the result of the address calculation: before or after the memory operation. To best support such needs, the generic instructions like GINSN_TYPE_LOAD, GINSN_TYPE_STORE together with GINSN_TYPE_ADD, and GINSN_TYPE_SUB may be used. The functionality provided in ginsn.c and scfi.c is compiled in when a target defines TARGET_USE_SCFI and TARGET_USE_GINSN. This can be revisited later when there are other use-cases of creating ginsn's in GAS, apart from the current use-case of synthesizing CFI for hand-written asm. Support is added only for System V AMD64 ABI for ELF at this time. If the user enables SCFI with --32, GAS issues an error: "Fatal error: SCFI is not supported for this ABI" For synthesizing (DWARF) CFI, the SCFI machinery requires the programmer to adhere to some pre-requisites for their asm: - Hand-written asm block must begin with a .type foo, @function It is highly recommended to, additionally, also ensure that: - Hand-written asm block ends with a .size foo, .-foo The SCFI machinery encodes some rules which align with the standard calling convention specified by the ABI. Apart from the rules, the SCFI machinery employs some heuristics. For example: - The base register for CFA tracking may be either REG_SP or REG_FP. - If the base register for CFA tracking is REG_SP, the precise amount of stack usage (and hence, the value of REG_SP) must be known at all times. - If using dynamic stack allocation, the function must switch to FP-based CFA. This means using instructions like the following (in AMD64) in prologue: pushq %rbp movq %rsp, %rbp and analogous instructions in epilogue. - Save and Restore of callee-saved registers must be symmetrical. However, the SCFI machinery at this time only warns if any such asymmetry is seen. These heuristics/rules are architecture-independent and are meant to employed for all architectures/ABIs using SCFI in the future. gas/ * Makefile.am: Add new files. * Makefile.in: Regenerated. * as.c (defined): Handle documentation and listing option for ginsns and SCFI. * config/obj-elf.c (obj_elf_size): Invoke ginsn_data_end. (obj_elf_type): Invoke ginsn_data_begin. * config/tc-i386.c (x86_scfi_callee_saved_p): New function. (ginsn_prefix_66H_p): Likewise. (ginsn_dw2_regnum): Likewise. (x86_ginsn_addsub_reg_mem): Likewise. (x86_ginsn_addsub_mem_reg): Likewise. (x86_ginsn_alu_imm): Likewise. (x86_ginsn_move): Likewise. (x86_ginsn_lea): Likewise. (x86_ginsn_jump): Likewise. (x86_ginsn_jump_cond): Likewise. (x86_ginsn_enter): Likewise. (x86_ginsn_safe_to_skip): Likewise. (x86_ginsn_unhandled): Likewise. (x86_ginsn_new): New functionality to generate ginsns. (md_assemble): Invoke x86_ginsn_new. (s_insn): Likewise. (i386_target_format): Add hard error for usage of SCFI with non AMD64 ABIs. * config/tc-i386.h (TARGET_USE_GINSN): New definition. (TARGET_USE_SCFI): Likewise. (SCFI_MAX_REG_ID): Likewise. (REG_FP): Likewise. (REG_SP): Likewise. (SCFI_INIT_CFA_OFFSET): Likewise. (SCFI_CALLEE_SAVED_REG_P): Likewise. (x86_scfi_callee_saved_p): Likewise. * gas/listing.h (LISTING_GINSN_SCFI): New define for ginsn and SCFI. * gas/read.c (read_a_source_file): Close SCFI processing at end of file read. * gas/scfidw2gen.c (scfi_process_cfi_label): Add implementation. (scfi_process_cfi_signal_frame): Likewise. * subsegs.h (struct frch_ginsn_data): New forward declaration. (struct frchain): New member for ginsn data. * gas/subsegs.c (subseg_set_rest): Initialize the new member. * symbols.c (colon): Invoke ginsn_frob_label to convey user-defined labels to ginsn infrastructure. * ginsn.c: New file. * ginsn.h: New file. * scfi.c: New file. * scfi.h: New file.
346 lines
8.5 KiB
C
346 lines
8.5 KiB
C
/* subsegs.c - subsegments -
|
||
Copyright (C) 1987-2024 Free Software Foundation, Inc.
|
||
|
||
This file is part of GAS, the GNU Assembler.
|
||
|
||
GAS 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, or (at your option)
|
||
any later version.
|
||
|
||
GAS 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 GAS; see the file COPYING. If not, write to the Free
|
||
Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
|
||
02110-1301, USA. */
|
||
|
||
/* Segments & sub-segments. */
|
||
|
||
#include "as.h"
|
||
|
||
#include "subsegs.h"
|
||
#include "obstack.h"
|
||
|
||
frchainS *frchain_now;
|
||
|
||
static struct obstack frchains;
|
||
|
||
static fragS dummy_frag;
|
||
|
||
|
||
void
|
||
subsegs_begin (void)
|
||
{
|
||
obstack_begin (&frchains, chunksize);
|
||
#if __GNUC__ >= 2
|
||
obstack_alignment_mask (&frchains) = __alignof__ (frchainS) - 1;
|
||
#endif
|
||
|
||
frchain_now = NULL; /* Warn new_subseg() that we are booting. */
|
||
frag_now = &dummy_frag;
|
||
}
|
||
|
||
void
|
||
subsegs_end (struct obstack **obs)
|
||
{
|
||
for (; *obs; obs++)
|
||
_obstack_free (*obs, NULL);
|
||
_obstack_free (&frchains, NULL);
|
||
bfd_set_section_userdata (bfd_abs_section_ptr, NULL);
|
||
bfd_set_section_userdata (bfd_und_section_ptr, NULL);
|
||
}
|
||
|
||
static void
|
||
alloc_seginfo (segT seg)
|
||
{
|
||
segment_info_type *seginfo;
|
||
|
||
seginfo = obstack_alloc (¬es, sizeof (*seginfo));
|
||
memset (seginfo, 0, sizeof (*seginfo));
|
||
bfd_set_section_userdata (seg, seginfo);
|
||
}
|
||
/*
|
||
* subseg_change()
|
||
*
|
||
* Change the subsegment we are in, BUT DO NOT MAKE A NEW FRAG for the
|
||
* subsegment. If we are already in the correct subsegment, change nothing.
|
||
* This is used eg as a worker for subseg_set [which does make a new frag_now]
|
||
* and for changing segments after we have read the source. We construct eg
|
||
* fixSs even after the source file is read, so we do have to keep the
|
||
* segment context correct.
|
||
*/
|
||
void
|
||
subseg_change (segT seg, int subseg)
|
||
{
|
||
now_seg = seg;
|
||
now_subseg = subseg;
|
||
|
||
if (!seg_info (seg))
|
||
alloc_seginfo (seg);
|
||
}
|
||
|
||
static void
|
||
subseg_set_rest (segT seg, subsegT subseg)
|
||
{
|
||
frchainS *frcP; /* crawl frchain chain */
|
||
frchainS **lastPP; /* address of last pointer */
|
||
frchainS *newP; /* address of new frchain */
|
||
segment_info_type *seginfo;
|
||
|
||
mri_common_symbol = NULL;
|
||
|
||
if (frag_now && frchain_now)
|
||
frchain_now->frch_frag_now = frag_now;
|
||
|
||
gas_assert (frchain_now == 0
|
||
|| frchain_now->frch_last == frag_now);
|
||
|
||
subseg_change (seg, (int) subseg);
|
||
|
||
seginfo = seg_info (seg);
|
||
|
||
/* Should the section symbol be kept? */
|
||
if (bfd_keep_unused_section_symbols (stdoutput))
|
||
seg->symbol->flags |= BSF_SECTION_SYM_USED;
|
||
|
||
/* Attempt to find or make a frchain for that subsection.
|
||
We keep the list sorted by subsection number. */
|
||
for (frcP = *(lastPP = &seginfo->frchainP);
|
||
frcP != NULL;
|
||
frcP = *(lastPP = &frcP->frch_next))
|
||
if (frcP->frch_subseg >= subseg)
|
||
break;
|
||
|
||
if (frcP == NULL || frcP->frch_subseg != subseg)
|
||
{
|
||
/* This should be the only code that creates a frchainS. */
|
||
|
||
newP = (frchainS *) obstack_alloc (&frchains, sizeof (frchainS));
|
||
newP->frch_subseg = subseg;
|
||
newP->fix_root = NULL;
|
||
newP->fix_tail = NULL;
|
||
obstack_begin (&newP->frch_obstack, chunksize);
|
||
#if __GNUC__ >= 2
|
||
obstack_alignment_mask (&newP->frch_obstack) = __alignof__ (fragS) - 1;
|
||
#endif
|
||
newP->frch_frag_now = frag_alloc (&newP->frch_obstack);
|
||
newP->frch_frag_now->fr_type = rs_fill;
|
||
newP->frch_cfi_data = NULL;
|
||
newP->frch_ginsn_data = NULL;
|
||
|
||
newP->frch_root = newP->frch_last = newP->frch_frag_now;
|
||
|
||
*lastPP = newP;
|
||
newP->frch_next = frcP;
|
||
frcP = newP;
|
||
}
|
||
|
||
frchain_now = frcP;
|
||
frag_now = frcP->frch_frag_now;
|
||
|
||
gas_assert (frchain_now->frch_last == frag_now);
|
||
}
|
||
|
||
/*
|
||
* subseg_set(segT, subsegT)
|
||
*
|
||
* If you attempt to change to the current subsegment, nothing happens.
|
||
*
|
||
* In: segT, subsegT code for new subsegment.
|
||
* frag_now -> incomplete frag for current subsegment.
|
||
* If frag_now==NULL, then there is no old, incomplete frag, so
|
||
* the old frag is not closed off.
|
||
*
|
||
* Out: now_subseg, now_seg updated.
|
||
* Frchain_now points to the (possibly new) struct frchain for this
|
||
* sub-segment.
|
||
*/
|
||
|
||
segT
|
||
subseg_get (const char *segname, int force_new)
|
||
{
|
||
segT secptr;
|
||
const char *now_seg_name = now_seg ? bfd_section_name (now_seg) : 0;
|
||
|
||
if (!force_new
|
||
&& now_seg_name
|
||
&& (now_seg_name == segname
|
||
|| !strcmp (now_seg_name, segname)))
|
||
return now_seg;
|
||
|
||
if (!force_new)
|
||
secptr = bfd_make_section_old_way (stdoutput, segname);
|
||
else
|
||
secptr = bfd_make_section_anyway (stdoutput, segname);
|
||
|
||
if (!seg_info (secptr))
|
||
{
|
||
secptr->output_section = secptr;
|
||
alloc_seginfo (secptr);
|
||
}
|
||
return secptr;
|
||
}
|
||
|
||
segT
|
||
subseg_new (const char *segname, subsegT subseg)
|
||
{
|
||
segT secptr;
|
||
|
||
secptr = subseg_get (segname, 0);
|
||
subseg_set_rest (secptr, subseg);
|
||
return secptr;
|
||
}
|
||
|
||
/* Like subseg_new, except a new section is always created, even if
|
||
a section with that name already exists. */
|
||
segT
|
||
subseg_force_new (const char *segname, subsegT subseg)
|
||
{
|
||
segT secptr;
|
||
|
||
secptr = subseg_get (segname, 1);
|
||
subseg_set_rest (secptr, subseg);
|
||
return secptr;
|
||
}
|
||
|
||
void
|
||
subseg_set (segT secptr, subsegT subseg)
|
||
{
|
||
if (! (secptr == now_seg && subseg == now_subseg))
|
||
subseg_set_rest (secptr, subseg);
|
||
mri_common_symbol = NULL;
|
||
}
|
||
|
||
#ifndef obj_sec_sym_ok_for_reloc
|
||
#define obj_sec_sym_ok_for_reloc(SEC) 0
|
||
#endif
|
||
|
||
symbolS *
|
||
section_symbol (segT sec)
|
||
{
|
||
segment_info_type *seginfo = seg_info (sec);
|
||
symbolS *s;
|
||
|
||
if (seginfo == 0)
|
||
abort ();
|
||
if (seginfo->sym)
|
||
return seginfo->sym;
|
||
|
||
#ifndef EMIT_SECTION_SYMBOLS
|
||
#define EMIT_SECTION_SYMBOLS 1
|
||
#endif
|
||
|
||
if (! EMIT_SECTION_SYMBOLS || symbol_table_frozen)
|
||
{
|
||
/* Here we know it won't be going into the symbol table. */
|
||
s = symbol_create (sec->symbol->name, sec, &zero_address_frag, 0);
|
||
}
|
||
else
|
||
{
|
||
segT seg;
|
||
s = symbol_find (sec->symbol->name);
|
||
/* We have to make sure it is the right symbol when we
|
||
have multiple sections with the same section name. */
|
||
if (s == NULL
|
||
|| ((seg = S_GET_SEGMENT (s)) != sec
|
||
&& seg != undefined_section))
|
||
s = symbol_new (sec->symbol->name, sec, &zero_address_frag, 0);
|
||
else if (seg == undefined_section)
|
||
{
|
||
S_SET_SEGMENT (s, sec);
|
||
symbol_set_frag (s, &zero_address_frag);
|
||
}
|
||
}
|
||
|
||
S_CLEAR_EXTERNAL (s);
|
||
|
||
/* Use the BFD section symbol, if possible. */
|
||
if (obj_sec_sym_ok_for_reloc (sec))
|
||
symbol_set_bfdsym (s, sec->symbol);
|
||
else
|
||
symbol_get_bfdsym (s)->flags |= BSF_SECTION_SYM;
|
||
|
||
seginfo->sym = s;
|
||
return s;
|
||
}
|
||
|
||
/* Return whether the specified segment is thought to hold text. */
|
||
|
||
int
|
||
subseg_text_p (segT sec)
|
||
{
|
||
return (bfd_section_flags (sec) & SEC_CODE) != 0;
|
||
}
|
||
|
||
/* Return non zero if SEC has at least one byte of data. It is
|
||
possible that we'll return zero even on a non-empty section because
|
||
we don't know all the fragment types, and it is possible that an
|
||
fr_fix == 0 one still contributes data. Think of this as
|
||
seg_definitely_not_empty_p. */
|
||
|
||
int
|
||
seg_not_empty_p (segT sec ATTRIBUTE_UNUSED)
|
||
{
|
||
segment_info_type *seginfo = seg_info (sec);
|
||
frchainS *chain;
|
||
fragS *frag;
|
||
|
||
if (!seginfo)
|
||
return 0;
|
||
|
||
for (chain = seginfo->frchainP; chain; chain = chain->frch_next)
|
||
{
|
||
for (frag = chain->frch_root; frag; frag = frag->fr_next)
|
||
if (frag->fr_fix)
|
||
return 1;
|
||
if (obstack_next_free (&chain->frch_obstack)
|
||
!= chain->frch_last->fr_literal)
|
||
return 1;
|
||
}
|
||
return 0;
|
||
}
|
||
|
||
void
|
||
subsegs_print_statistics (FILE *file)
|
||
{
|
||
frchainS *frchp;
|
||
asection *s;
|
||
|
||
/* PR 20897 - check to see if the output bfd was actually created. */
|
||
if (stdoutput == NULL)
|
||
return;
|
||
|
||
fprintf (file, "frag chains:\n");
|
||
for (s = stdoutput->sections; s; s = s->next)
|
||
{
|
||
segment_info_type *seginfo;
|
||
|
||
/* Skip gas-internal sections. */
|
||
if (segment_name (s)[0] == '*')
|
||
continue;
|
||
|
||
seginfo = seg_info (s);
|
||
if (!seginfo)
|
||
continue;
|
||
|
||
for (frchp = seginfo->frchainP; frchp; frchp = frchp->frch_next)
|
||
{
|
||
int count = 0;
|
||
fragS *fragp;
|
||
|
||
for (fragp = frchp->frch_root; fragp; fragp = fragp->fr_next)
|
||
count++;
|
||
|
||
fprintf (file, "\n");
|
||
fprintf (file, "\t%p %-10s\t%10d frags\n", (void *) frchp,
|
||
segment_name (s), count);
|
||
}
|
||
}
|
||
}
|
||
|
||
/* end of subsegs.c */
|