elf bfd.h tidy
[deliverable/binutils-gdb.git] / ld / mri.c
1 /* mri.c -- handle MRI style linker scripts
2 Copyright (C) 1991-2019 Free Software Foundation, Inc.
3 Contributed by Steve Chamberlain <sac@cygnus.com>.
4
5 This file is part of the GNU Binutils.
6
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
11
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
20 MA 02110-1301, USA. */
21
22
23 /* This bit does the tree decoration when MRI style link scripts
24 are parsed. */
25
26 #include "sysdep.h"
27 #include "bfd.h"
28 #include "bfdlink.h"
29 #include "ld.h"
30 #include "ldexp.h"
31 #include "ldlang.h"
32 #include "ldmisc.h"
33 #include "mri.h"
34 #include <ldgram.h>
35 #include "libiberty.h"
36
37 struct section_name_struct {
38 struct section_name_struct *next;
39 const char *name;
40 const char *alias;
41 etree_type *vma;
42 etree_type *align;
43 etree_type *subalign;
44 int ok_to_load;
45 };
46
47 static unsigned int symbol_truncate = 10000;
48 static etree_type *base; /* Relocation base - or null */
49
50 static struct section_name_struct *order;
51 static struct section_name_struct *only_load;
52 static struct section_name_struct *address;
53 static struct section_name_struct *alias;
54
55 static struct section_name_struct *alignment;
56 static struct section_name_struct *subalignment;
57
58 static struct section_name_struct **
59 lookup (const char *name, struct section_name_struct **list)
60 {
61 struct section_name_struct **ptr = list;
62
63 while (*ptr)
64 {
65 if (strcmp (name, (*ptr)->name) == 0)
66 /* If this is a match, delete it, we only keep the last instance
67 of any name. */
68 *ptr = (*ptr)->next;
69 else
70 ptr = &((*ptr)->next);
71 }
72
73 *ptr = (struct section_name_struct *)
74 xmalloc (sizeof (struct section_name_struct));
75 return ptr;
76 }
77
78 static void
79 mri_add_to_list (struct section_name_struct **list,
80 const char *name,
81 etree_type *vma,
82 const char *zalias,
83 etree_type *align,
84 etree_type *subalign)
85 {
86 struct section_name_struct **ptr = lookup (name, list);
87
88 (*ptr)->name = name;
89 (*ptr)->vma = vma;
90 (*ptr)->next = NULL;
91 (*ptr)->ok_to_load = 0;
92 (*ptr)->alias = zalias;
93 (*ptr)->align = align;
94 (*ptr)->subalign = subalign;
95 }
96
97 void
98 mri_output_section (const char *name, etree_type *vma)
99 {
100 mri_add_to_list (&address, name, vma, 0, 0, 0);
101 }
102
103 /* If any ABSOLUTE <name> are in the script, only load those files
104 marked thus. */
105
106 void
107 mri_only_load (const char *name)
108 {
109 mri_add_to_list (&only_load, name, 0, 0, 0, 0);
110 }
111
112 void
113 mri_base (etree_type *exp)
114 {
115 base = exp;
116 }
117
118 static int done_tree = 0;
119
120 void
121 mri_draw_tree (void)
122 {
123 if (done_tree)
124 return;
125
126 /* Now build the statements for the ldlang machine. */
127
128 /* Attach the addresses of any which have addresses,
129 and add the ones not mentioned. */
130 if (address != NULL)
131 {
132 struct section_name_struct *alist;
133 struct section_name_struct *olist;
134
135 if (order == NULL)
136 order = address;
137
138 for (alist = address;
139 alist != NULL;
140 alist = alist->next)
141 {
142 int done = 0;
143
144 for (olist = order; done == 0 && olist != NULL; olist = olist->next)
145 {
146 if (strcmp (alist->name, olist->name) == 0)
147 {
148 olist->vma = alist->vma;
149 done = 1;
150 }
151 }
152
153 if (!done)
154 {
155 /* Add this onto end of order list. */
156 mri_add_to_list (&order, alist->name, alist->vma, 0, 0, 0);
157 }
158 }
159 }
160
161 /* If we're only supposed to load a subset of them in, then prune
162 the list. */
163 if (only_load != NULL)
164 {
165 struct section_name_struct *ptr1;
166 struct section_name_struct *ptr2;
167
168 if (order == NULL)
169 order = only_load;
170
171 /* See if this name is in the list, if it is then we can load it. */
172 for (ptr1 = only_load; ptr1; ptr1 = ptr1->next)
173 for (ptr2 = order; ptr2; ptr2 = ptr2->next)
174 if (strcmp (ptr2->name, ptr1->name) == 0)
175 ptr2->ok_to_load = 1;
176 }
177 else
178 {
179 /* No only load list, so everything is ok to load. */
180 struct section_name_struct *ptr;
181
182 for (ptr = order; ptr; ptr = ptr->next)
183 ptr->ok_to_load = 1;
184 }
185
186 /* Create the order of sections to load. */
187 if (order != NULL)
188 {
189 /* Been told to output the sections in a certain order. */
190 struct section_name_struct *p = order;
191
192 while (p)
193 {
194 struct section_name_struct *aptr;
195 etree_type *align = 0;
196 etree_type *subalign = 0;
197 struct wildcard_list *tmp;
198
199 /* See if an alignment has been specified. */
200 for (aptr = alignment; aptr; aptr = aptr->next)
201 if (strcmp (aptr->name, p->name) == 0)
202 align = aptr->align;
203
204 for (aptr = subalignment; aptr; aptr = aptr->next)
205 if (strcmp (aptr->name, p->name) == 0)
206 subalign = aptr->subalign;
207
208 if (base == 0)
209 base = p->vma ? p->vma : exp_nameop (NAME, ".");
210
211 lang_enter_output_section_statement (p->name, base,
212 p->ok_to_load ? normal_section : noload_section,
213 align, subalign, NULL, 0, 0);
214 base = 0;
215 tmp = (struct wildcard_list *) xmalloc (sizeof *tmp);
216 tmp->next = NULL;
217 tmp->spec.name = p->name;
218 tmp->spec.exclude_name_list = NULL;
219 tmp->spec.sorted = none;
220 tmp->spec.section_flag_list = NULL;
221 lang_add_wild (NULL, tmp, FALSE);
222
223 /* If there is an alias for this section, add it too. */
224 for (aptr = alias; aptr; aptr = aptr->next)
225 if (strcmp (aptr->alias, p->name) == 0)
226 {
227 tmp = (struct wildcard_list *) xmalloc (sizeof *tmp);
228 tmp->next = NULL;
229 tmp->spec.name = aptr->name;
230 tmp->spec.exclude_name_list = NULL;
231 tmp->spec.sorted = none;
232 tmp->spec.section_flag_list = NULL;
233 lang_add_wild (NULL, tmp, FALSE);
234 }
235
236 lang_leave_output_section_statement (0, "*default*", NULL, NULL);
237
238 p = p->next;
239 }
240 }
241
242 done_tree = 1;
243 }
244
245 void
246 mri_load (const char *name)
247 {
248 base = 0;
249 lang_add_input_file (name, lang_input_file_is_file_enum, NULL);
250 }
251
252 void
253 mri_order (const char *name)
254 {
255 mri_add_to_list (&order, name, 0, 0, 0, 0);
256 }
257
258 void
259 mri_alias (const char *want, const char *is, int isn)
260 {
261 if (!is)
262 {
263 char buf[20];
264
265 /* Some sections are digits. */
266 sprintf (buf, "%d", isn);
267
268 is = xstrdup (buf);
269
270 if (is == NULL)
271 abort ();
272 }
273
274 mri_add_to_list (&alias, is, 0, want, 0, 0);
275 }
276
277 void
278 mri_name (const char *name)
279 {
280 lang_add_output (name, 1);
281 }
282
283 void
284 mri_format (const char *name)
285 {
286 if (strcmp (name, "S") == 0)
287 lang_add_output_format ("srec", NULL, NULL, 1);
288
289 else
290 einfo (_("%F%P: unknown format type %s\n"), name);
291 }
292
293 void
294 mri_public (const char *name, etree_type *exp)
295 {
296 lang_add_assignment (exp_assign (name, exp, FALSE));
297 }
298
299 void
300 mri_align (const char *name, etree_type *exp)
301 {
302 mri_add_to_list (&alignment, name, 0, 0, exp, 0);
303 }
304
305 void
306 mri_alignmod (const char *name, etree_type *exp)
307 {
308 mri_add_to_list (&subalignment, name, 0, 0, 0, exp);
309 }
310
311 void
312 mri_truncate (unsigned int exp)
313 {
314 symbol_truncate = exp;
315 }
This page took 0.042798 seconds and 5 git commands to generate.