1ff6de0312
This is quite complicated because the CTF section's contents depend on the final contents of the symtab and strtab, because it has two sections whose contents are shuffled to be in 1:1 correspondence with the symtab, and an internal strtab that gets deduplicated against the ELF strtab (with offsets adjusted to point into the ELF strtab instead). It is also compressed if large enough, so its size depends on its contents! So we cannot construct it as early as most sections: we cannot even *begin* construction until after the symtab and strtab are finalized. Thankfully there is already one section treated similarly: compressed debugging sections: the only differences are that compressed debugging sections have extra handling to deal with their changing name if compressed (CTF sections are always called ".ctf" for now, though we have reserved ".ctf.*" against future use), and that compressed debugging sections have previously-uncompressed content which has to be stashed away for later compression, while CTF sections have no content at all until we generate it (very late). BFD also cannot do the link itself: libctf knows how to do it, and BFD cannot call libctf directly because libctf already depends on bfd for file I/O. So we have to use a pair of callbacks, one, examine_strtab, which allows a caller to examine the symtab and strtab after finalization (called from elf_link_swap_symbols_out(), right before the symtabs are written, and after the strtab has been finalized), and one which actually does the emission (called emit_ctf simply because it is grouped with a bunch of section-specific late-emission function calls at the bottom of bfd_elf_final_link, and a section-specific name seems best for that). emit_ctf is actually called *twice*: once from lang_process if the emulation suggests that this bfd target does not examine the symtab or strtab, and once via a bfd callback if it does. (This means that non-ELF targets still get CTF emitted, even though the late CTF emission stage is never called for them). v2: merged with non-ELF support patch: slight commit message adjustments. v3: do not spend time merging CTF, or crash, if the CTF section is explicitly discarded. Do not try to merge or compress CTF unless linking. v4: add CTF_COMPRESSION_THRESHOLD. Annul the freed input ctf_file_t's after writeout: set SEC_IN_MEMORY on the output contents so a future bfd enhancement knows it could free it. Add SEC_LINKER_CREATED | SEC_KEEP to avoid having to add .ctf to the linker script. Drop now-unnecessary ldlang.h-level elf-bfd.h include and hackery around it. Adapt to elf32.em->elf.em and elf-generic.em->ldelf*.c changes. v5: fix tabdamage. Drop #inclusions in .h files: include in .c files, .em files, and use struct forwards instead. Use bfd_section_is_ctf inline function rather than SECTION_IS_CTF macro. Move a few comments. * Makefile.def (dependencies): all-ld depends on all-libctf. * Makefile.in: Regenerated. include/ * bfdlink.h (elf_strtab_hash): New forward. (elf_sym_strtab): Likewise. (struct bfd_link_callbacks <examine_strtab>): New. (struct bfd_link_callbacks <emit_ctf>): Likewise. bfd/ * elf-bfd.h (bfd_section_is_ctf): New inline function. * elf.c (special_sections_c): Add ".ctf". (assign_file_positions_for_non_load_sections): Note that compressed debugging sections etc are not assigned here. Treat CTF sections like SEC_ELF_COMPRESS sections when is_linker_output: sh_offset -1. (assign_file_positions_except_relocs): Likewise. (find_section_in_list): Note that debugging and CTF sections, as well as reloc sections, are assigned later. (_bfd_elf_assign_file_positions_for_non_load): CTF sections get their size and contents updated. (_bfd_elf_set_section_contents): Skip CTF sections: unlike compressed sections, they have no uncompressed content to copy at this stage. * elflink.c (elf_link_swap_symbols_out): Call the examine_strtab callback right before the strtab is written out. (bfd_elf_final_link): Don't cache the section contents of CTF sections: they are not populated yet. Call the emit_ctf callback right at the end, after all the symbols and strings are flushed out. ld/ * ldlang.h: (struct lang_input_statement_struct): Add the_ctf. (struct elf_sym_strtab): Add forward. (struct elf_strtab_hash): Likewise. (ldlang_ctf_apply_strsym): Declare. (ldlang_write_ctf_late): Likewise. * ldemul.h (ldemul_emit_ctf_early): New. (ldemul_examine_strtab_for_ctf): Likewise. (ld_emulation_xfer_type) <emit_ctf_early>: Likewise. (ld_emulation_xfer_type) <examine_strtab_for_ctf>: Likewise. * ldemul.c (ldemul_emit_ctf_early): New. (ldemul_examine_strtab_for_ctf): Likewise. * ldlang.c: Include ctf-api.h. (CTF_COMPRESSION_THRESHOLD): New. (ctf_output): New. Initialized in... (ldlang_open_ctf): ... this new function. Open all the CTF sections in the input files: mark them non-loaded and empty so as not to copy their contents to the output, but linker-created so the section gets created in the target. (ldlang_merge_ctf): New, merge types via ctf_link_add_ctf and ctf_link. (ldlang_ctf_apply_strsym): New, an examine_strtab callback: wrap ldemul_examine_strtab_for_ctf. (lang_write_ctf): New, write out the CTF section. (ldlang_write_ctf_late): New, late call via bfd's emit_ctf hook. (lang_process): Call ldlang_open_ctf, ldlang_merge_ctf, and lang_write_ctf. * ldmain.c (link_callbacks): Add ldlang_ctf_apply_strsym, ldlang_write_ctf_late. * emultempl/aix.em: Add ctf-api.h. * emultempl/armcoff.em: Likewise. * emultempl/beos.em: Likewise. * emultempl/elf.em: Likewise. * emultempl/generic.em: Likewise. * emultempl/linux.em: Likewise. * emultempl/msp430.em: Likewise. * emultempl/pe.em: Likewise. * emultempl/pep.em: Likewise. * emultempl/ticoff.em: Likewise. * emultempl/vanilla.em: Likewise. * ldcref.c: Likewise. * ldctor.c: Likewise. * ldelf.c: Likewise. * ldelfgen.c: Likewise. * ldemul.c: Likewise. * ldexp.c: Likewise. * ldfile.c: Likewise. * ldgram.c: Likewise. * ldlex.l: Likewise. * ldmain.c: Likewise. * ldmisc.c: Likewise. * ldver.c: Likewise. * ldwrite.c: Likewise. * lexsup.c: Likewise. * mri.c: Likewise. * pe-dll.c: Likewise. * plugin.c: Likewise. * ldelfgen.c (ldelf_emit_ctf_early): New. (ldelf_examine_strtab_for_ctf): tell libctf about the symtab and strtab. (struct ctf_strsym_iter_cb_arg): New, state to do so. (ldelf_ctf_strtab_iter_cb): New: tell libctf about each string in the strtab in turn. (ldelf_ctf_symbols_iter_cb): New, tell libctf about each symbol in the symtab in turn. * ldelfgen.h (struct elf_sym_strtab): Add forward. (struct elf_strtab_hash): Likewise. (struct ctf_file): Likewise. (ldelf_emit_ctf_early): Declare. (ldelf_examine_strtab_for_ctf): Likewise. * emultempl/elf-generic.em (LDEMUL_EMIT_CTF_EARLY): Set it. (LDEMUL_EXAMINE_STRTAB_FOR_CTF): Likewise. * emultempl/aix.em (ld_${EMULATION_NAME}_emulation): Add emit_ctf_early and examine_strtab_for_ctf, NULL by default. * emultempl/armcoff.em (ld_${EMULATION_NAME}_emulation): Likewise. * emultempl/beos.em (ld_${EMULATION_NAME}_emulation): Likewise. * emultempl/elf.em (ld_${EMULATION_NAME}_emulation): Likewise. * emultempl/generic.em (ld_${EMULATION_NAME}_emulation): Likewise. * emultempl/linux.em (ld_${EMULATION_NAME}_emulation): Likewise. * emultempl/msp430.em (ld_${EMULATION_NAME}_emulation): Likewise. * emultempl/pe.em (ld_${EMULATION_NAME}_emulation): Likewise. * emultempl/pep.em (ld_${EMULATION_NAME}_emulation): Likewise. * emultempl/ticoff.em (ld_${EMULATION_NAME}_emulation): Likewise. * emultempl/vanilla.em (ld_vanilla_emulation): Likewise. * Makefile.am: Pull in libctf (and zlib, a transitive requirement for compressed CTF section emission). Pass it on to DejaGNU. * configure.ac: Add AM_ZLIB. * aclocal.m4: Added zlib.m4. * Makefile.in: Regenerated. * testsuite/ld-bootstrap/bootstrap.exp: Use it when relinking ld.
594 lines
16 KiB
C
594 lines
16 KiB
C
/* ldwrite.c -- write out the linked file
|
|
Copyright (C) 1991-2019 Free Software Foundation, Inc.
|
|
Written by Steve Chamberlain sac@cygnus.com
|
|
|
|
This file is part of the GNU Binutils.
|
|
|
|
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, write to the Free Software
|
|
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
|
|
MA 02110-1301, USA. */
|
|
|
|
#include "sysdep.h"
|
|
#include "bfd.h"
|
|
#include "bfdlink.h"
|
|
#include "libiberty.h"
|
|
#include "ctf-api.h"
|
|
#include "safe-ctype.h"
|
|
|
|
#include "ld.h"
|
|
#include "ldexp.h"
|
|
#include "ldlang.h"
|
|
#include "ldwrite.h"
|
|
#include "ldmisc.h"
|
|
#include <ldgram.h>
|
|
#include "ldmain.h"
|
|
|
|
/* Build link_order structures for the BFD linker. */
|
|
|
|
static void
|
|
build_link_order (lang_statement_union_type *statement)
|
|
{
|
|
switch (statement->header.type)
|
|
{
|
|
case lang_data_statement_enum:
|
|
{
|
|
asection *output_section;
|
|
struct bfd_link_order *link_order;
|
|
bfd_vma value;
|
|
bfd_boolean big_endian = FALSE;
|
|
|
|
output_section = statement->data_statement.output_section;
|
|
ASSERT (output_section->owner == link_info.output_bfd);
|
|
|
|
if (!((output_section->flags & SEC_HAS_CONTENTS) != 0
|
|
|| ((output_section->flags & SEC_LOAD) != 0
|
|
&& (output_section->flags & SEC_THREAD_LOCAL))))
|
|
break;
|
|
|
|
link_order = bfd_new_link_order (link_info.output_bfd, output_section);
|
|
if (link_order == NULL)
|
|
einfo (_("%F%P: bfd_new_link_order failed\n"));
|
|
|
|
link_order->type = bfd_data_link_order;
|
|
link_order->offset = statement->data_statement.output_offset;
|
|
link_order->u.data.contents = (bfd_byte *) xmalloc (QUAD_SIZE);
|
|
|
|
value = statement->data_statement.value;
|
|
|
|
/* If the endianness of the output BFD is not known, then we
|
|
base the endianness of the data on the first input file.
|
|
By convention, the bfd_put routines for an unknown
|
|
endianness are big endian, so we must swap here if the
|
|
input file is little endian. */
|
|
if (bfd_big_endian (link_info.output_bfd))
|
|
big_endian = TRUE;
|
|
else if (bfd_little_endian (link_info.output_bfd))
|
|
big_endian = FALSE;
|
|
else
|
|
{
|
|
bfd_boolean swap;
|
|
|
|
swap = FALSE;
|
|
if (command_line.endian == ENDIAN_BIG)
|
|
big_endian = TRUE;
|
|
else if (command_line.endian == ENDIAN_LITTLE)
|
|
{
|
|
big_endian = FALSE;
|
|
swap = TRUE;
|
|
}
|
|
else if (command_line.endian == ENDIAN_UNSET)
|
|
{
|
|
big_endian = TRUE;
|
|
{
|
|
LANG_FOR_EACH_INPUT_STATEMENT (s)
|
|
{
|
|
if (s->the_bfd != NULL)
|
|
{
|
|
if (bfd_little_endian (s->the_bfd))
|
|
{
|
|
big_endian = FALSE;
|
|
swap = TRUE;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
if (swap)
|
|
{
|
|
bfd_byte buffer[8];
|
|
|
|
switch (statement->data_statement.type)
|
|
{
|
|
case QUAD:
|
|
case SQUAD:
|
|
if (sizeof (bfd_vma) >= QUAD_SIZE)
|
|
{
|
|
bfd_putl64 (value, buffer);
|
|
value = bfd_getb64 (buffer);
|
|
break;
|
|
}
|
|
/* Fall through. */
|
|
case LONG:
|
|
bfd_putl32 (value, buffer);
|
|
value = bfd_getb32 (buffer);
|
|
break;
|
|
case SHORT:
|
|
bfd_putl16 (value, buffer);
|
|
value = bfd_getb16 (buffer);
|
|
break;
|
|
case BYTE:
|
|
break;
|
|
default:
|
|
abort ();
|
|
}
|
|
}
|
|
}
|
|
|
|
ASSERT (output_section->owner == link_info.output_bfd);
|
|
switch (statement->data_statement.type)
|
|
{
|
|
case QUAD:
|
|
case SQUAD:
|
|
if (sizeof (bfd_vma) >= QUAD_SIZE)
|
|
bfd_put_64 (link_info.output_bfd, value,
|
|
link_order->u.data.contents);
|
|
else
|
|
{
|
|
bfd_vma high;
|
|
|
|
if (statement->data_statement.type == QUAD)
|
|
high = 0;
|
|
else if ((value & 0x80000000) == 0)
|
|
high = 0;
|
|
else
|
|
high = (bfd_vma) -1;
|
|
bfd_put_32 (link_info.output_bfd, high,
|
|
(link_order->u.data.contents
|
|
+ (big_endian ? 0 : 4)));
|
|
bfd_put_32 (link_info.output_bfd, value,
|
|
(link_order->u.data.contents
|
|
+ (big_endian ? 4 : 0)));
|
|
}
|
|
link_order->size = QUAD_SIZE;
|
|
break;
|
|
case LONG:
|
|
bfd_put_32 (link_info.output_bfd, value,
|
|
link_order->u.data.contents);
|
|
link_order->size = LONG_SIZE;
|
|
break;
|
|
case SHORT:
|
|
bfd_put_16 (link_info.output_bfd, value,
|
|
link_order->u.data.contents);
|
|
link_order->size = SHORT_SIZE;
|
|
break;
|
|
case BYTE:
|
|
bfd_put_8 (link_info.output_bfd, value,
|
|
link_order->u.data.contents);
|
|
link_order->size = BYTE_SIZE;
|
|
break;
|
|
default:
|
|
abort ();
|
|
}
|
|
link_order->u.data.size = link_order->size;
|
|
}
|
|
break;
|
|
|
|
case lang_reloc_statement_enum:
|
|
{
|
|
lang_reloc_statement_type *rs;
|
|
asection *output_section;
|
|
struct bfd_link_order *link_order;
|
|
|
|
rs = &statement->reloc_statement;
|
|
|
|
output_section = rs->output_section;
|
|
ASSERT (output_section->owner == link_info.output_bfd);
|
|
|
|
if (!((output_section->flags & SEC_HAS_CONTENTS) != 0
|
|
|| ((output_section->flags & SEC_LOAD) != 0
|
|
&& (output_section->flags & SEC_THREAD_LOCAL))))
|
|
break;
|
|
|
|
link_order = bfd_new_link_order (link_info.output_bfd, output_section);
|
|
if (link_order == NULL)
|
|
einfo (_("%F%P: bfd_new_link_order failed\n"));
|
|
|
|
link_order->offset = rs->output_offset;
|
|
link_order->size = bfd_get_reloc_size (rs->howto);
|
|
|
|
link_order->u.reloc.p = (struct bfd_link_order_reloc *)
|
|
xmalloc (sizeof (struct bfd_link_order_reloc));
|
|
|
|
link_order->u.reloc.p->reloc = rs->reloc;
|
|
link_order->u.reloc.p->addend = rs->addend_value;
|
|
|
|
if (rs->name == NULL)
|
|
{
|
|
link_order->type = bfd_section_reloc_link_order;
|
|
if (rs->section->owner == link_info.output_bfd)
|
|
link_order->u.reloc.p->u.section = rs->section;
|
|
else
|
|
{
|
|
link_order->u.reloc.p->u.section = rs->section->output_section;
|
|
link_order->u.reloc.p->addend += rs->section->output_offset;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
link_order->type = bfd_symbol_reloc_link_order;
|
|
link_order->u.reloc.p->u.name = rs->name;
|
|
}
|
|
}
|
|
break;
|
|
|
|
case lang_input_section_enum:
|
|
{
|
|
/* Create a new link_order in the output section with this
|
|
attached */
|
|
asection *i = statement->input_section.section;
|
|
|
|
if (i->sec_info_type != SEC_INFO_TYPE_JUST_SYMS
|
|
&& (i->flags & SEC_EXCLUDE) == 0)
|
|
{
|
|
asection *output_section = i->output_section;
|
|
struct bfd_link_order *link_order;
|
|
|
|
ASSERT (output_section->owner == link_info.output_bfd);
|
|
|
|
if (!((output_section->flags & SEC_HAS_CONTENTS) != 0
|
|
|| ((output_section->flags & SEC_LOAD) != 0
|
|
&& (output_section->flags & SEC_THREAD_LOCAL))))
|
|
break;
|
|
|
|
link_order = bfd_new_link_order (link_info.output_bfd,
|
|
output_section);
|
|
if (link_order == NULL)
|
|
einfo (_("%F%P: bfd_new_link_order failed\n"));
|
|
|
|
if ((i->flags & SEC_NEVER_LOAD) != 0
|
|
&& (i->flags & SEC_DEBUGGING) == 0)
|
|
{
|
|
/* We've got a never load section inside one which is
|
|
going to be output, we'll change it into a fill. */
|
|
link_order->type = bfd_data_link_order;
|
|
link_order->u.data.contents = (unsigned char *) "";
|
|
link_order->u.data.size = 1;
|
|
}
|
|
else
|
|
{
|
|
link_order->type = bfd_indirect_link_order;
|
|
link_order->u.indirect.section = i;
|
|
ASSERT (i->output_section == output_section);
|
|
}
|
|
link_order->size = i->size;
|
|
link_order->offset = i->output_offset;
|
|
}
|
|
}
|
|
break;
|
|
|
|
case lang_padding_statement_enum:
|
|
/* Make a new link_order with the right filler */
|
|
{
|
|
asection *output_section;
|
|
struct bfd_link_order *link_order;
|
|
|
|
output_section = statement->padding_statement.output_section;
|
|
ASSERT (statement->padding_statement.output_section->owner
|
|
== link_info.output_bfd);
|
|
|
|
if (!((output_section->flags & SEC_HAS_CONTENTS) != 0
|
|
|| ((output_section->flags & SEC_LOAD) != 0
|
|
&& (output_section->flags & SEC_THREAD_LOCAL))))
|
|
break;
|
|
|
|
link_order = bfd_new_link_order (link_info.output_bfd,
|
|
output_section);
|
|
if (link_order == NULL)
|
|
einfo (_("%F%P: bfd_new_link_order failed\n"));
|
|
link_order->type = bfd_data_link_order;
|
|
link_order->size = statement->padding_statement.size;
|
|
link_order->offset = statement->padding_statement.output_offset;
|
|
link_order->u.data.contents = statement->padding_statement.fill->data;
|
|
link_order->u.data.size = statement->padding_statement.fill->size;
|
|
}
|
|
break;
|
|
|
|
default:
|
|
/* All the other ones fall through */
|
|
break;
|
|
}
|
|
}
|
|
|
|
/* Return true if NAME is the name of an unsplittable section. These
|
|
are the stabs strings, dwarf strings. */
|
|
|
|
static bfd_boolean
|
|
unsplittable_name (const char *name)
|
|
{
|
|
if (CONST_STRNEQ (name, ".stab"))
|
|
{
|
|
/* There are several stab like string sections. We pattern match on
|
|
".stab...str" */
|
|
unsigned len = strlen (name);
|
|
if (strcmp (&name[len-3], "str") == 0)
|
|
return TRUE;
|
|
}
|
|
else if (strcmp (name, "$GDB_STRINGS$") == 0)
|
|
return TRUE;
|
|
return FALSE;
|
|
}
|
|
|
|
/* Wander around the input sections, make sure that
|
|
we'll never try and create an output section with more relocs
|
|
than will fit.. Do this by always assuming the worst case, and
|
|
creating new output sections with all the right bits. */
|
|
#define TESTIT 1
|
|
static asection *
|
|
clone_section (bfd *abfd, asection *s, const char *name, int *count)
|
|
{
|
|
char *tname;
|
|
char *sname;
|
|
unsigned int len;
|
|
asection *n;
|
|
struct bfd_link_hash_entry *h;
|
|
|
|
/* Invent a section name from the section name and a dotted numeric
|
|
suffix. */
|
|
len = strlen (name);
|
|
tname = (char *) xmalloc (len + 1);
|
|
memcpy (tname, name, len + 1);
|
|
/* Remove a dotted number suffix, from a previous split link. */
|
|
while (len && ISDIGIT (tname[len-1]))
|
|
len--;
|
|
if (len > 1 && tname[len-1] == '.')
|
|
/* It was a dotted number. */
|
|
tname[len-1] = 0;
|
|
|
|
/* We want to use the whole of the original section name for the
|
|
split name, but coff can be restricted to 8 character names. */
|
|
if (bfd_family_coff (abfd) && strlen (tname) > 5)
|
|
{
|
|
/* Some section names cannot be truncated, as the name is
|
|
used to locate some other section. */
|
|
if (CONST_STRNEQ (name, ".stab")
|
|
|| strcmp (name, "$GDB_SYMBOLS$") == 0)
|
|
{
|
|
einfo (_ ("%F%P: cannot create split section name for %s\n"), name);
|
|
/* Silence gcc warnings. einfo exits, so we never reach here. */
|
|
return NULL;
|
|
}
|
|
tname[5] = 0;
|
|
}
|
|
|
|
if ((sname = bfd_get_unique_section_name (abfd, tname, count)) == NULL
|
|
|| (n = bfd_make_section_anyway (abfd, sname)) == NULL
|
|
|| (h = bfd_link_hash_lookup (link_info.hash,
|
|
sname, TRUE, TRUE, FALSE)) == NULL)
|
|
{
|
|
einfo (_("%F%P: clone section failed: %E\n"));
|
|
/* Silence gcc warnings. einfo exits, so we never reach here. */
|
|
return NULL;
|
|
}
|
|
free (tname);
|
|
|
|
/* Set up section symbol. */
|
|
h->type = bfd_link_hash_defined;
|
|
h->u.def.value = 0;
|
|
h->u.def.section = n;
|
|
|
|
n->flags = s->flags;
|
|
n->vma = s->vma;
|
|
n->user_set_vma = s->user_set_vma;
|
|
n->lma = s->lma;
|
|
n->size = 0;
|
|
n->output_offset = s->output_offset;
|
|
n->output_section = n;
|
|
n->orelocation = 0;
|
|
n->reloc_count = 0;
|
|
n->alignment_power = s->alignment_power;
|
|
|
|
bfd_copy_private_section_data (abfd, s, abfd, n);
|
|
|
|
return n;
|
|
}
|
|
|
|
#if TESTING
|
|
static void
|
|
ds (asection *s)
|
|
{
|
|
struct bfd_link_order *l = s->map_head.link_order;
|
|
printf ("vma %x size %x\n", s->vma, s->size);
|
|
while (l)
|
|
{
|
|
if (l->type == bfd_indirect_link_order)
|
|
printf ("%8x %s\n", l->offset, l->u.indirect.section->owner->filename);
|
|
else
|
|
printf (_("%8x something else\n"), l->offset);
|
|
l = l->next;
|
|
}
|
|
printf ("\n");
|
|
}
|
|
|
|
dump (char *s, asection *a1, asection *a2)
|
|
{
|
|
printf ("%s\n", s);
|
|
ds (a1);
|
|
ds (a2);
|
|
}
|
|
|
|
static void
|
|
sanity_check (bfd *abfd)
|
|
{
|
|
asection *s;
|
|
for (s = abfd->sections; s; s = s->next)
|
|
{
|
|
struct bfd_link_order *p;
|
|
bfd_vma prev = 0;
|
|
for (p = s->map_head.link_order; p; p = p->next)
|
|
{
|
|
if (p->offset > 100000)
|
|
abort ();
|
|
if (p->offset < prev)
|
|
abort ();
|
|
prev = p->offset;
|
|
}
|
|
}
|
|
}
|
|
#else
|
|
#define sanity_check(a)
|
|
#define dump(a, b, c)
|
|
#endif
|
|
|
|
static void
|
|
split_sections (bfd *abfd, struct bfd_link_info *info)
|
|
{
|
|
asection *original_sec;
|
|
int nsecs = abfd->section_count;
|
|
sanity_check (abfd);
|
|
/* Look through all the original sections. */
|
|
for (original_sec = abfd->sections;
|
|
original_sec && nsecs;
|
|
original_sec = original_sec->next, nsecs--)
|
|
{
|
|
int count = 0;
|
|
unsigned int lines = 0;
|
|
unsigned int relocs = 0;
|
|
bfd_size_type sec_size = 0;
|
|
struct bfd_link_order *l;
|
|
struct bfd_link_order *p;
|
|
bfd_vma vma = original_sec->vma;
|
|
asection *cursor = original_sec;
|
|
|
|
/* Count up the relocations and line entries to see if anything
|
|
would be too big to fit. Accumulate section size too. */
|
|
for (l = NULL, p = cursor->map_head.link_order; p != NULL; p = l->next)
|
|
{
|
|
unsigned int thislines = 0;
|
|
unsigned int thisrelocs = 0;
|
|
bfd_size_type thissize = 0;
|
|
if (p->type == bfd_indirect_link_order)
|
|
{
|
|
asection *sec;
|
|
|
|
sec = p->u.indirect.section;
|
|
|
|
if (info->strip == strip_none
|
|
|| info->strip == strip_some)
|
|
thislines = sec->lineno_count;
|
|
|
|
if (bfd_link_relocatable (info))
|
|
thisrelocs = sec->reloc_count;
|
|
|
|
thissize = sec->size;
|
|
|
|
}
|
|
else if (bfd_link_relocatable (info)
|
|
&& (p->type == bfd_section_reloc_link_order
|
|
|| p->type == bfd_symbol_reloc_link_order))
|
|
thisrelocs++;
|
|
|
|
if (l != NULL
|
|
&& (thisrelocs + relocs >= config.split_by_reloc
|
|
|| thislines + lines >= config.split_by_reloc
|
|
|| (thissize + sec_size >= config.split_by_file))
|
|
&& !unsplittable_name (cursor->name))
|
|
{
|
|
/* Create a new section and put this link order and the
|
|
following link orders into it. */
|
|
bfd_vma shift_offset;
|
|
asection *n;
|
|
|
|
n = clone_section (abfd, cursor, original_sec->name, &count);
|
|
|
|
/* Attach the link orders to the new section and snip
|
|
them off from the old section. */
|
|
n->map_head.link_order = p;
|
|
n->map_tail.link_order = cursor->map_tail.link_order;
|
|
cursor->map_tail.link_order = l;
|
|
l->next = NULL;
|
|
l = p;
|
|
|
|
/* Change the size of the original section and
|
|
update the vma of the new one. */
|
|
|
|
dump ("before snip", cursor, n);
|
|
|
|
shift_offset = p->offset;
|
|
n->size = cursor->size - shift_offset;
|
|
cursor->size = shift_offset;
|
|
|
|
vma += shift_offset;
|
|
n->lma = n->vma = vma;
|
|
|
|
/* Run down the chain and change the output section to
|
|
the right one, update the offsets too. */
|
|
do
|
|
{
|
|
p->offset -= shift_offset;
|
|
if (p->type == bfd_indirect_link_order)
|
|
{
|
|
p->u.indirect.section->output_section = n;
|
|
p->u.indirect.section->output_offset = p->offset;
|
|
}
|
|
p = p->next;
|
|
}
|
|
while (p);
|
|
|
|
dump ("after snip", cursor, n);
|
|
cursor = n;
|
|
relocs = thisrelocs;
|
|
lines = thislines;
|
|
sec_size = thissize;
|
|
}
|
|
else
|
|
{
|
|
l = p;
|
|
relocs += thisrelocs;
|
|
lines += thislines;
|
|
sec_size += thissize;
|
|
}
|
|
}
|
|
}
|
|
sanity_check (abfd);
|
|
}
|
|
|
|
/* Call BFD to write out the linked file. */
|
|
|
|
void
|
|
ldwrite (void)
|
|
{
|
|
/* Reset error indicator, which can typically something like invalid
|
|
format from opening up the .o files. */
|
|
bfd_set_error (bfd_error_no_error);
|
|
lang_clear_os_map ();
|
|
lang_for_each_statement (build_link_order);
|
|
|
|
if (config.split_by_reloc != (unsigned) -1
|
|
|| config.split_by_file != (bfd_size_type) -1)
|
|
split_sections (link_info.output_bfd, &link_info);
|
|
if (!bfd_final_link (link_info.output_bfd, &link_info))
|
|
{
|
|
/* If there was an error recorded, print it out. Otherwise assume
|
|
an appropriate error message like unknown symbol was printed
|
|
out. */
|
|
|
|
if (bfd_get_error () != bfd_error_no_error)
|
|
einfo (_("%F%P: final link failed: %E\n"));
|
|
else
|
|
xexit (1);
|
|
}
|
|
}
|