binutils-gdb/ld/mri.c

367 lines
8.5 KiB
C
Raw Normal View History

1999-05-03 09:29:11 +02:00
/* mri.c -- handle MRI style linker scripts
Copyright 1991, 1992, 1993, 1994, 1996, 1997, 1998, 1999, 2000, 2002
2000-09-10 21:53:58 +02:00
Free Software Foundation, Inc.
1999-05-03 09:29:11 +02: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 21:53:58 +02:00
02111-1307, USA.
1999-05-03 09:29:11 +02:00
2000-09-10 21:53:58 +02:00
This bit does the tree decoration when MRI style link scripts
are parsed.
1999-05-03 09:29:11 +02:00
2000-09-10 21:53:58 +02:00
Contributed by Steve Chamberlain <sac@cygnus.com>. */
1999-05-03 09:29:11 +02:00
#include "bfd.h"
#include "sysdep.h"
1999-05-03 09:29:11 +02:00
#include "ld.h"
#include "ldexp.h"
#include "ldlang.h"
#include "ldmisc.h"
#include "mri.h"
#include <ldgram.h>
1999-05-03 09:29:11 +02:00
#include "libiberty.h"
struct section_name_struct {
1999-05-03 09:29:11 +02:00
struct section_name_struct *next;
const char *name;
const char *alias;
1999-05-03 09:29:11 +02:00
etree_type *vma;
etree_type *align;
etree_type *subalign;
int ok_to_load;
2000-09-10 21:53:58 +02:00
};
1999-05-03 09:29:11 +02: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 **lookup
PARAMS ((const char *name, struct section_name_struct **list));
static void mri_add_to_list PARAMS ((struct section_name_struct **list,
const char *name, etree_type *vma,
const char *zalias, etree_type *align,
etree_type *subalign));
static struct section_name_struct **
lookup (name, list)
const char *name;
1999-05-03 09:29:11 +02:00
struct section_name_struct **list;
{
struct section_name_struct **ptr = list;
while (*ptr)
2000-09-10 21:53:58 +02: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 09:29:11 +02:00
}
2000-09-10 21:53:58 +02:00
*ptr = (struct section_name_struct *) xmalloc (sizeof (struct section_name_struct));
1999-05-03 09:29:11 +02:00
return ptr;
}
static void
mri_add_to_list (list, name, vma, zalias, align, subalign)
struct section_name_struct **list;
const char *name;
1999-05-03 09:29:11 +02:00
etree_type *vma;
const char *zalias;
1999-05-03 09:29:11 +02:00
etree_type *align;
etree_type *subalign;
{
struct section_name_struct **ptr = lookup (name, list);
1999-05-03 09:29:11 +02:00
(*ptr)->name = name;
(*ptr)->vma = vma;
2000-09-10 21:53:58 +02:00
(*ptr)->next = (struct section_name_struct *) NULL;
1999-05-03 09:29:11 +02:00
(*ptr)->ok_to_load = 0;
(*ptr)->alias = zalias;
(*ptr)->align = align;
(*ptr)->subalign = subalign;
}
void
mri_output_section (name, vma)
const char *name;
1999-05-03 09:29:11 +02:00
etree_type *vma;
{
mri_add_to_list (&address, name, vma, 0, 0, 0);
1999-05-03 09:29:11 +02:00
}
2000-09-10 21:53:58 +02:00
/* If any ABSOLUTE <name> are in the script, only load those files
marked thus. */
1999-05-03 09:29:11 +02:00
void
mri_only_load (name)
const char *name;
1999-05-03 09:29:11 +02:00
{
mri_add_to_list (&only_load, name, 0, 0, 0, 0);
1999-05-03 09:29:11 +02:00
}
void
mri_base (exp)
etree_type *exp;
{
base = exp;
}
static int done_tree = 0;
void
mri_draw_tree ()
{
2000-09-10 21:53:58 +02:00
if (done_tree)
return;
#if 0 /* We don't bother with memory regions. */
/* Create the regions. */
{
lang_memory_region_type *r;
2000-09-10 21:53:58 +02:00
r = lang_memory_region_lookup("long");
r->current = r->origin = exp_get_vma (base, (bfd_vma)0, "origin",
lang_first_phase_enum);
r->length = (bfd_size_type) exp_get_vma (0, (bfd_vma) ~((bfd_size_type)0),
"length", lang_first_phase_enum);
}
1999-05-03 09:29:11 +02:00
#endif
2000-09-10 21:53:58 +02:00
/* Now build the statements for the ldlang machine. */
1999-05-03 09:29:11 +02:00
/* Attach the addresses of any which have addresses,
2000-09-10 21:53:58 +02:00
and add the ones not mentioned. */
if (address != (struct section_name_struct *) NULL)
1999-05-03 09:29:11 +02:00
{
2000-09-10 21:53:58 +02:00
struct section_name_struct *alist;
struct section_name_struct *olist;
if (order == (struct section_name_struct *) NULL)
2000-09-10 21:53:58 +02:00
order = address;
for (alist = address;
alist != (struct section_name_struct *) NULL;
alist = alist->next)
1999-05-03 09:29:11 +02:00
{
2000-09-10 21:53:58 +02:00
int done = 0;
2000-09-10 21:53:58 +02:00
for (olist = order;
done == 0 && olist != (struct section_name_struct *) NULL;
olist = olist->next)
2000-09-10 21:53:58 +02:00
{
if (strcmp (alist->name, olist->name) == 0)
2000-09-10 21:53:58 +02:00
{
olist->vma = alist->vma;
done = 1;
}
}
2000-09-10 21:53:58 +02: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 21:53:58 +02:00
}
1999-05-03 09:29:11 +02:00
}
}
/* If we're only supposed to load a subset of them in, then prune
the list. */
if (only_load != (struct section_name_struct *) NULL)
1999-05-03 09:29:11 +02:00
{
2000-09-10 21:53:58 +02:00
struct section_name_struct *ptr1;
struct section_name_struct *ptr2;
if (order == (struct section_name_struct *) NULL)
2000-09-10 21:53:58 +02:00
order = only_load;
2000-09-10 21:53:58 +02: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 21:53:58 +02:00
if (strcmp (ptr2->name, ptr1->name) == 0)
ptr2->ok_to_load = 1;
1999-05-03 09:29:11 +02:00
}
else
2000-09-10 21:53:58 +02: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 21:53:58 +02:00
ptr->ok_to_load = 1;
}
1999-05-03 09:29:11 +02:00
2000-09-10 21:53:58 +02:00
/* Create the order of sections to load. */
if (order != (struct section_name_struct *) NULL)
1999-05-03 09:29:11 +02:00
{
2000-09-10 21:53:58 +02:00
/* Been told to output the sections in a certain order. */
struct section_name_struct *p = order;
while (p)
2000-09-10 21:53:58 +02:00
{
struct section_name_struct *aptr;
etree_type *align = 0;
etree_type *subalign = 0;
struct wildcard_list *tmp;
2000-09-10 21:53:58 +02:00
/* See if an alignment has been specified. */
for (aptr = alignment; aptr; aptr = aptr->next)
2000-09-10 21:53:58 +02:00
if (strcmp (aptr->name, p->name) == 0)
align = aptr->align;
2000-09-10 21:53:58 +02:00
for (aptr = subalignment; aptr; aptr = aptr->next)
2000-09-10 21:53:58 +02:00
if (strcmp (aptr->name, p->name) == 0)
subalign = aptr->subalign;
2000-09-10 21:53:58 +02:00
if (base == 0)
base = p->vma ? p->vma : exp_nameop (NAME, ".");
2000-09-10 21:53:58 +02:00
lang_enter_output_section_statement (p->name, base,
p->ok_to_load ? 0 : noload_section,
1, align, subalign,
(etree_type *) NULL);
base = 0;
tmp = (struct wildcard_list *) xmalloc (sizeof *tmp);
tmp->next = NULL;
tmp->spec.name = p->name;
tmp->spec.exclude_name_list = NULL;
tmp->spec.sorted = FALSE;
lang_add_wild (NULL, tmp, FALSE);
2000-09-10 21:53:58 +02: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)
{
tmp = (struct wildcard_list *) xmalloc (sizeof *tmp);
tmp->next = NULL;
tmp->spec.name = aptr->name;
tmp->spec.exclude_name_list = NULL;
tmp->spec.sorted = FALSE;
lang_add_wild (NULL, tmp, FALSE);
}
2000-09-10 21:53:58 +02:00
lang_leave_output_section_statement
(0, "*default*", (struct lang_output_section_phdr_list *) NULL,
NULL);
2000-09-10 21:53:58 +02:00
p = p->next;
1999-05-03 09:29:11 +02:00
}
}
done_tree = 1;
}
2000-09-10 21:53:58 +02:00
1999-05-03 09:29:11 +02:00
void
mri_load (name)
const char *name;
1999-05-03 09:29:11 +02:00
{
base = 0;
2000-09-10 21:53:58 +02:00
lang_add_input_file (name,
lang_input_file_is_file_enum, (char *) NULL);
#if 0
lang_leave_output_section_statement (0, "*default*");
2000-09-10 21:53:58 +02:00
#endif
1999-05-03 09:29:11 +02:00
}
void
mri_order (name)
const char *name;
1999-05-03 09:29:11 +02:00
{
mri_add_to_list (&order, name, 0, 0, 0, 0);
1999-05-03 09:29:11 +02:00
}
void
1999-05-03 09:29:11 +02:00
mri_alias (want, is, isn)
const char *want;
const char *is;
1999-05-03 09:29:11 +02:00
int isn;
{
2000-09-10 21:53:58 +02:00
if (!is)
{
char buf[20];
2000-09-10 21:53:58 +02:00
/* Some sections are digits. */
sprintf (buf, "%d", isn);
2000-09-10 21:53:58 +02:00
is = xstrdup (buf);
2000-09-10 21:53:58 +02:00
if (is == NULL)
abort ();
}
mri_add_to_list (&alias, is, 0, want, 0, 0);
1999-05-03 09:29:11 +02:00
}
void
1999-05-03 09:29:11 +02:00
mri_name (name)
const char *name;
1999-05-03 09:29:11 +02:00
{
2000-09-10 21:53:58 +02:00
lang_add_output (name, 1);
1999-05-03 09:29:11 +02:00
}
void
mri_format (name)
const char *name;
1999-05-03 09:29:11 +02:00
{
2000-09-10 21:53:58 +02:00
if (strcmp (name, "S") == 0)
lang_add_output_format ("srec", (char *) NULL, (char *) NULL, 1);
2000-09-10 21:53:58 +02:00
else if (strcmp (name, "IEEE") == 0)
lang_add_output_format ("ieee", (char *) NULL, (char *) NULL, 1);
2000-09-10 21:53:58 +02:00
else if (strcmp (name, "COFF") == 0)
lang_add_output_format ("coff-m68k", (char *) NULL, (char *) NULL, 1);
2000-09-10 21:53:58 +02:00
else
einfo (_("%P%F: unknown format type %s\n"), name);
1999-05-03 09:29:11 +02:00
}
void
mri_public (name, exp)
const char *name;
1999-05-03 09:29:11 +02:00
etree_type *exp;
{
2000-09-10 21:53:58 +02:00
lang_add_assignment (exp_assop ('=', name, exp));
1999-05-03 09:29:11 +02:00
}
void
1999-05-03 09:29:11 +02:00
mri_align (name, exp)
const char *name;
1999-05-03 09:29:11 +02:00
etree_type *exp;
{
mri_add_to_list (&alignment, name, 0, 0, exp, 0);
1999-05-03 09:29:11 +02:00
}
void
1999-05-03 09:29:11 +02:00
mri_alignmod (name, exp)
const char *name;
1999-05-03 09:29:11 +02:00
etree_type *exp;
{
mri_add_to_list (&subalignment, name, 0, 0, 0, exp);
1999-05-03 09:29:11 +02:00
}
void
1999-05-03 09:29:11 +02:00
mri_truncate (exp)
unsigned int exp;
{
symbol_truncate = exp;
}