old-cross-binutils/ld/mri.c

317 lines
7 KiB
C
Raw Normal View History

1999-05-03 07:29:11 +00:00
/* mri.c -- handle MRI style linker scripts
Copyright 1991, 1992, 1993, 1994, 1996, 1997, 1998, 1999, 2000, 2002,
2003, 2004 Free Software Foundation, Inc.
1999-05-03 07:29:11 +00:00
This file is part of GLD, the Gnu Linker.
GLD 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 2, or (at your option)
any later version.
GLD 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 GLD; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
2000-09-10 19:53:58 +00:00
02111-1307, USA.
1999-05-03 07:29:11 +00:00
2000-09-10 19:53:58 +00:00
This bit does the tree decoration when MRI style link scripts
are parsed.
1999-05-03 07:29:11 +00:00
2000-09-10 19:53:58 +00:00
Contributed by Steve Chamberlain <sac@cygnus.com>. */
1999-05-03 07:29:11 +00:00
#include "bfd.h"
#include "sysdep.h"
1999-05-03 07:29:11 +00:00
#include "ld.h"
#include "ldexp.h"
#include "ldlang.h"
#include "ldmisc.h"
#include "mri.h"
#include <ldgram.h>
1999-05-03 07:29:11 +00:00
#include "libiberty.h"
struct section_name_struct {
1999-05-03 07:29:11 +00:00
struct section_name_struct *next;
const char *name;
const char *alias;
1999-05-03 07:29:11 +00:00
etree_type *vma;
etree_type *align;
etree_type *subalign;
int ok_to_load;
2000-09-10 19:53:58 +00:00
};
1999-05-03 07:29:11 +00:00
unsigned int symbol_truncate = 10000;
struct section_name_struct *order;
struct section_name_struct *only_load;
struct section_name_struct *address;
struct section_name_struct *alias;
struct section_name_struct *alignment;
struct section_name_struct *subalignment;
static struct section_name_struct **
2003-06-28 05:28:54 +00:00
lookup (const char *name, struct section_name_struct **list)
1999-05-03 07:29:11 +00:00
{
struct section_name_struct **ptr = list;
while (*ptr)
2000-09-10 19:53:58 +00:00
{
if (strcmp (name, (*ptr)->name) == 0)
/* If this is a match, delete it, we only keep the last instance
of any name. */
*ptr = (*ptr)->next;
else
ptr = &((*ptr)->next);
1999-05-03 07:29:11 +00:00
}
2003-06-28 05:28:54 +00:00
*ptr = xmalloc (sizeof (struct section_name_struct));
1999-05-03 07:29:11 +00:00
return ptr;
}
static void
2003-06-28 05:28:54 +00:00
mri_add_to_list (struct section_name_struct **list,
const char *name,
etree_type *vma,
const char *zalias,
etree_type *align,
etree_type *subalign)
1999-05-03 07:29:11 +00:00
{
struct section_name_struct **ptr = lookup (name, list);
1999-05-03 07:29:11 +00:00
(*ptr)->name = name;
(*ptr)->vma = vma;
2003-06-28 05:28:54 +00:00
(*ptr)->next = NULL;
1999-05-03 07:29:11 +00:00
(*ptr)->ok_to_load = 0;
(*ptr)->alias = zalias;
(*ptr)->align = align;
(*ptr)->subalign = subalign;
}
void
2003-06-28 05:28:54 +00:00
mri_output_section (const char *name, etree_type *vma)
1999-05-03 07:29:11 +00:00
{
mri_add_to_list (&address, name, vma, 0, 0, 0);
1999-05-03 07:29:11 +00:00
}
2000-09-10 19:53:58 +00:00
/* If any ABSOLUTE <name> are in the script, only load those files
marked thus. */
1999-05-03 07:29:11 +00:00
void
2003-06-28 05:28:54 +00:00
mri_only_load (const char *name)
1999-05-03 07:29:11 +00:00
{
mri_add_to_list (&only_load, name, 0, 0, 0, 0);
1999-05-03 07:29:11 +00:00
}
void
2003-06-28 05:28:54 +00:00
mri_base (etree_type *exp)
1999-05-03 07:29:11 +00:00
{
base = exp;
}
static int done_tree = 0;
void
2003-06-28 05:28:54 +00:00
mri_draw_tree (void)
1999-05-03 07:29:11 +00:00
{
2000-09-10 19:53:58 +00:00
if (done_tree)
return;
/* Now build the statements for the ldlang machine. */
1999-05-03 07:29:11 +00:00
/* Attach the addresses of any which have addresses,
2000-09-10 19:53:58 +00:00
and add the ones not mentioned. */
2003-06-28 05:28:54 +00:00
if (address != NULL)
1999-05-03 07:29:11 +00:00
{
2000-09-10 19:53:58 +00:00
struct section_name_struct *alist;
struct section_name_struct *olist;
2003-06-28 05:28:54 +00:00
if (order == NULL)
2000-09-10 19:53:58 +00:00
order = address;
for (alist = address;
2003-06-28 05:28:54 +00:00
alist != NULL;
alist = alist->next)
1999-05-03 07:29:11 +00:00
{
2000-09-10 19:53:58 +00:00
int done = 0;
2003-06-28 05:28:54 +00:00
for (olist = order; done == 0 && olist != NULL; olist = olist->next)
2000-09-10 19:53:58 +00:00
{
if (strcmp (alist->name, olist->name) == 0)
2000-09-10 19:53:58 +00:00
{
olist->vma = alist->vma;
done = 1;
}
}
2000-09-10 19:53:58 +00:00
if (!done)
{
/* Add this onto end of order list. */
mri_add_to_list (&order, alist->name, alist->vma, 0, 0, 0);
2000-09-10 19:53:58 +00:00
}
1999-05-03 07:29:11 +00:00
}
}
/* If we're only supposed to load a subset of them in, then prune
the list. */
2003-06-28 05:28:54 +00:00
if (only_load != NULL)
1999-05-03 07:29:11 +00:00
{
2000-09-10 19:53:58 +00:00
struct section_name_struct *ptr1;
struct section_name_struct *ptr2;
2003-06-28 05:28:54 +00:00
if (order == NULL)
2000-09-10 19:53:58 +00:00
order = only_load;
2000-09-10 19:53:58 +00:00
/* See if this name is in the list, if it is then we can load it. */
for (ptr1 = only_load; ptr1; ptr1 = ptr1->next)
for (ptr2 = order; ptr2; ptr2 = ptr2->next)
2000-09-10 19:53:58 +00:00
if (strcmp (ptr2->name, ptr1->name) == 0)
ptr2->ok_to_load = 1;
1999-05-03 07:29:11 +00:00
}
else
2000-09-10 19:53:58 +00:00
{
/* No only load list, so everything is ok to load. */
struct section_name_struct *ptr;
for (ptr = order; ptr; ptr = ptr->next)
2000-09-10 19:53:58 +00:00
ptr->ok_to_load = 1;
}
1999-05-03 07:29:11 +00:00
2000-09-10 19:53:58 +00:00
/* Create the order of sections to load. */
2003-06-28 05:28:54 +00:00
if (order != NULL)
1999-05-03 07:29:11 +00:00
{
2000-09-10 19:53:58 +00:00
/* Been told to output the sections in a certain order. */
struct section_name_struct *p = order;
while (p)
2000-09-10 19:53:58 +00:00
{
struct section_name_struct *aptr;
etree_type *align = 0;
etree_type *subalign = 0;
struct wildcard_list *tmp;
2000-09-10 19:53:58 +00:00
/* See if an alignment has been specified. */
for (aptr = alignment; aptr; aptr = aptr->next)
2000-09-10 19:53:58 +00:00
if (strcmp (aptr->name, p->name) == 0)
align = aptr->align;
2000-09-10 19:53:58 +00:00
for (aptr = subalignment; aptr; aptr = aptr->next)
2000-09-10 19:53:58 +00:00
if (strcmp (aptr->name, p->name) == 0)
subalign = aptr->subalign;
2000-09-10 19:53:58 +00:00
if (base == 0)
base = p->vma ? p->vma : exp_nameop (NAME, ".");
2000-09-10 19:53:58 +00:00
lang_enter_output_section_statement (p->name, base,
p->ok_to_load ? 0 : noload_section,
* ldgram.y (sect_constraint): New. (ONLY_IF_RO, ONLY_IF_RW): New tokens. (section): Add sect_constraint. Pass additional argument to lang_enter_output_section_statement. * mri.c (mri_draw_tree): Pass additional argument to lang_enter_output_section_statement. * emultempl/pe.em (place_orphan): Likewise. (output_prev_sec_find): Disregard output section statements with constraint == -1. * emultempl/mmo.em (output_prev_sec_find): Likewise. (mmo_place_orphan): Pass additional argument to lang_enter_output_section_statement. * emultempl/elf32.em (output_prev_sec_find): Disregard output section statements with constraint == -1. (place_orphan): Pass additional argument to lang_enter_output_section_statement. * ldlang.c (lang_enter_overlay_section): Likewise. (lang_output_section_find_1): New. (lang_output_section_find): Use it. (lang_output_section_statement_lookup_1): New. (lang_output_section_statement_lookup): Use it. (check_section_callback, check_input_sections): New. (map_input_to_output_sections): Check if all input sections are readonly if ONLY_IF_RO or ONLY_IF_RW was seen. (strip_excluded_output_sections): Disregard output section statements with constraint == -1. (lang_record_phdrs): Likewise. (lang_enter_output_section_statement): Add constraint argument. Use lang_output_section_statement_lookup_1. * ldlang.h (lang_output_section_statement_type): Add constraint and all_input_readonly fields. (lang_enter_output_section_statement): Adjust prototype. * ldlex.l (ONLY_IF_RO, ONLY_IF_RW): New tokens. * scripttempl/elf.sc (.eh_frame, .gcc_except_table): Move into text segment if all input sections are readonly.
2004-05-19 14:01:14 +00:00
align, subalign, NULL, 0);
2000-09-10 19:53:58 +00:00
base = 0;
2003-06-28 05:28:54 +00:00
tmp = xmalloc (sizeof *tmp);
tmp->next = NULL;
tmp->spec.name = p->name;
tmp->spec.exclude_name_list = NULL;
ld/ 2004-10-04 H.J. Lu <hongjiu.lu@intel.com> * NEWS: Mention SORT_BY_NAME, SORT_BY_ALIGNMENT and --sort-section name|alignment. * ld.texinfo: Document SORT_BY_NAME, SORT_BY_ALIGNMENT and --sort-section name|alignment. * ld.h (sort_type): New enum. (wildcard_spec): Change the type of `sorted' to sort_type. * ldgram.y (SORT): Removed. (SORT_BY_NAME): Added. (SORT_BY_ALIGNMENT): Added. (wildcard_spec): Updated `sorted'. Handle SORT_BY_NAME and SORT_BY_ALIGNMENT. (input_section_spec_no_keep): Updated `sorted'. (statement): Replace SORT with SORT_BY_NAME. * ldlang.c (compare_section): New function to compare 2 sections with different sorting schemes. (wild_sort): Updated. Use compare_section. (update_wild_statements): New function. (lang_process): Call update_wild_statements before map_input_to_output_sections. * ldlex.l (SORT_BY_NAME): New. (SORT_BY_ALIGNMENT): New. (SORT): Return SORT_BY_NAME. * ldmain.c (sort_section): New. Defined. (main): Initialize it to none. * lexsup.c (option_values): Add OPTION_SORT_SECTION. (ld_options): Add an entry for OPTION_SORT_SECTION. (parse_args): Handle OPTION_SORT_SECTION. * mri.c (mri_draw_tree): Updated `sorted'. ld/testsuite/ 2004-10-04 H.J. Lu <hongjiu.lu@intel.com> * ld-scripts/sort.exp: New file for section sorting tests. * ld-scripts/sort_b_a.d: Likewise * ld-scripts/sort_b_a.s: Likewise * ld-scripts/sort_b_a.t: Likewise * ld-scripts/sort_b_a_a-1.d: Likewise * ld-scripts/sort_b_a_a-2.d: Likewise * ld-scripts/sort_b_a_a-3.d: Likewise * ld-scripts/sort_b_a_a.t: Likewise * ld-scripts/sort_b_a_n-1.d: Likewise * ld-scripts/sort_b_a_n-2.d: Likewise * ld-scripts/sort_b_a_n-3.d: Likewise * ld-scripts/sort_b_a_n.t: Likewise * ld-scripts/sort_b_n.d: Likewise * ld-scripts/sort_b_n.s: Likewise * ld-scripts/sort_b_n.t: Likewise * ld-scripts/sort_b_n_a-1.d: Likewise * ld-scripts/sort_b_n_a-2.d: Likewise * ld-scripts/sort_b_n_a-3.d: Likewise * ld-scripts/sort_b_n_a.t: Likewise * ld-scripts/sort_b_n_n-1.d: Likewise * ld-scripts/sort_b_n_n-2.d: Likewise * ld-scripts/sort_b_n_n-3.d: Likewise * ld-scripts/sort_b_n_n.t: Likewise * ld-scripts/sort_n_a-a.s: Likewise * ld-scripts/sort_n_a-b.s: Likewise * ld-scripts/sort_no-1.d: Likewise * ld-scripts/sort_no-2.d: Likewise * ld-scripts/sort_no.t: Likewise
2004-10-04 16:45:51 +00:00
tmp->spec.sorted = none;
lang_add_wild (NULL, tmp, FALSE);
2000-09-10 19:53:58 +00:00
/* If there is an alias for this section, add it too. */
for (aptr = alias; aptr; aptr = aptr->next)
if (strcmp (aptr->alias, p->name) == 0)
{
2003-06-28 05:28:54 +00:00
tmp = xmalloc (sizeof *tmp);
tmp->next = NULL;
tmp->spec.name = aptr->name;
tmp->spec.exclude_name_list = NULL;
ld/ 2004-10-04 H.J. Lu <hongjiu.lu@intel.com> * NEWS: Mention SORT_BY_NAME, SORT_BY_ALIGNMENT and --sort-section name|alignment. * ld.texinfo: Document SORT_BY_NAME, SORT_BY_ALIGNMENT and --sort-section name|alignment. * ld.h (sort_type): New enum. (wildcard_spec): Change the type of `sorted' to sort_type. * ldgram.y (SORT): Removed. (SORT_BY_NAME): Added. (SORT_BY_ALIGNMENT): Added. (wildcard_spec): Updated `sorted'. Handle SORT_BY_NAME and SORT_BY_ALIGNMENT. (input_section_spec_no_keep): Updated `sorted'. (statement): Replace SORT with SORT_BY_NAME. * ldlang.c (compare_section): New function to compare 2 sections with different sorting schemes. (wild_sort): Updated. Use compare_section. (update_wild_statements): New function. (lang_process): Call update_wild_statements before map_input_to_output_sections. * ldlex.l (SORT_BY_NAME): New. (SORT_BY_ALIGNMENT): New. (SORT): Return SORT_BY_NAME. * ldmain.c (sort_section): New. Defined. (main): Initialize it to none. * lexsup.c (option_values): Add OPTION_SORT_SECTION. (ld_options): Add an entry for OPTION_SORT_SECTION. (parse_args): Handle OPTION_SORT_SECTION. * mri.c (mri_draw_tree): Updated `sorted'. ld/testsuite/ 2004-10-04 H.J. Lu <hongjiu.lu@intel.com> * ld-scripts/sort.exp: New file for section sorting tests. * ld-scripts/sort_b_a.d: Likewise * ld-scripts/sort_b_a.s: Likewise * ld-scripts/sort_b_a.t: Likewise * ld-scripts/sort_b_a_a-1.d: Likewise * ld-scripts/sort_b_a_a-2.d: Likewise * ld-scripts/sort_b_a_a-3.d: Likewise * ld-scripts/sort_b_a_a.t: Likewise * ld-scripts/sort_b_a_n-1.d: Likewise * ld-scripts/sort_b_a_n-2.d: Likewise * ld-scripts/sort_b_a_n-3.d: Likewise * ld-scripts/sort_b_a_n.t: Likewise * ld-scripts/sort_b_n.d: Likewise * ld-scripts/sort_b_n.s: Likewise * ld-scripts/sort_b_n.t: Likewise * ld-scripts/sort_b_n_a-1.d: Likewise * ld-scripts/sort_b_n_a-2.d: Likewise * ld-scripts/sort_b_n_a-3.d: Likewise * ld-scripts/sort_b_n_a.t: Likewise * ld-scripts/sort_b_n_n-1.d: Likewise * ld-scripts/sort_b_n_n-2.d: Likewise * ld-scripts/sort_b_n_n-3.d: Likewise * ld-scripts/sort_b_n_n.t: Likewise * ld-scripts/sort_n_a-a.s: Likewise * ld-scripts/sort_n_a-b.s: Likewise * ld-scripts/sort_no-1.d: Likewise * ld-scripts/sort_no-2.d: Likewise * ld-scripts/sort_no.t: Likewise
2004-10-04 16:45:51 +00:00
tmp->spec.sorted = none;
lang_add_wild (NULL, tmp, FALSE);
}
2000-09-10 19:53:58 +00:00
2003-06-28 05:28:54 +00:00
lang_leave_output_section_statement (0, "*default*", NULL, NULL);
2000-09-10 19:53:58 +00:00
p = p->next;
1999-05-03 07:29:11 +00:00
}
}
done_tree = 1;
}
2000-09-10 19:53:58 +00:00
1999-05-03 07:29:11 +00:00
void
2003-06-28 05:28:54 +00:00
mri_load (const char *name)
1999-05-03 07:29:11 +00:00
{
base = 0;
2003-06-28 05:28:54 +00:00
lang_add_input_file (name, lang_input_file_is_file_enum, NULL);
1999-05-03 07:29:11 +00:00
}
void
2003-06-28 05:28:54 +00:00
mri_order (const char *name)
1999-05-03 07:29:11 +00:00
{
mri_add_to_list (&order, name, 0, 0, 0, 0);
1999-05-03 07:29:11 +00:00
}
void
2003-06-28 05:28:54 +00:00
mri_alias (const char *want, const char *is, int isn)
1999-05-03 07:29:11 +00:00
{
2000-09-10 19:53:58 +00:00
if (!is)
{
char buf[20];
2000-09-10 19:53:58 +00:00
/* Some sections are digits. */
sprintf (buf, "%d", isn);
2000-09-10 19:53:58 +00:00
is = xstrdup (buf);
2000-09-10 19:53:58 +00:00
if (is == NULL)
abort ();
}
mri_add_to_list (&alias, is, 0, want, 0, 0);
1999-05-03 07:29:11 +00:00
}
void
2003-06-28 05:28:54 +00:00
mri_name (const char *name)
1999-05-03 07:29:11 +00:00
{
2000-09-10 19:53:58 +00:00
lang_add_output (name, 1);
1999-05-03 07:29:11 +00:00
}
void
2003-06-28 05:28:54 +00:00
mri_format (const char *name)
1999-05-03 07:29:11 +00:00
{
2000-09-10 19:53:58 +00:00
if (strcmp (name, "S") == 0)
2003-06-28 05:28:54 +00:00
lang_add_output_format ("srec", NULL, NULL, 1);
2000-09-10 19:53:58 +00:00
else if (strcmp (name, "IEEE") == 0)
2003-06-28 05:28:54 +00:00
lang_add_output_format ("ieee", NULL, NULL, 1);
2000-09-10 19:53:58 +00:00
else if (strcmp (name, "COFF") == 0)
2003-06-28 05:28:54 +00:00
lang_add_output_format ("coff-m68k", NULL, NULL, 1);
2000-09-10 19:53:58 +00:00
else
einfo (_("%P%F: unknown format type %s\n"), name);
1999-05-03 07:29:11 +00:00
}
void
2003-06-28 05:28:54 +00:00
mri_public (const char *name, etree_type *exp)
1999-05-03 07:29:11 +00:00
{
2000-09-10 19:53:58 +00:00
lang_add_assignment (exp_assop ('=', name, exp));
1999-05-03 07:29:11 +00:00
}
void
2003-06-28 05:28:54 +00:00
mri_align (const char *name, etree_type *exp)
1999-05-03 07:29:11 +00:00
{
mri_add_to_list (&alignment, name, 0, 0, exp, 0);
1999-05-03 07:29:11 +00:00
}
void
2003-06-28 05:28:54 +00:00
mri_alignmod (const char *name, etree_type *exp)
1999-05-03 07:29:11 +00:00
{
mri_add_to_list (&subalignment, name, 0, 0, 0, exp);
1999-05-03 07:29:11 +00:00
}
void
2003-06-28 05:28:54 +00:00
mri_truncate (unsigned int exp)
1999-05-03 07:29:11 +00:00
{
symbol_truncate = exp;
}