gdb: sim: add command line completion
[deliverable/binutils-gdb.git] / ld / ldlang.c
CommitLineData
252b5132 1/* Linker command language support.
a2b64bed 2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
ea7c2e6c 3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
252b5132
RH
4 Free Software Foundation, Inc.
5
f96b4a7b 6 This file is part of the GNU Binutils.
252b5132 7
f96b4a7b 8 This program is free software; you can redistribute it and/or modify
53b2a62f 9 it under the terms of the GNU General Public License as published by
f96b4a7b
NC
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
252b5132 12
f96b4a7b 13 This program is distributed in the hope that it will be useful,
53b2a62f
NC
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
252b5132 17
53b2a62f 18 You should have received a copy of the GNU General Public License
f96b4a7b
NC
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 MA 02110-1301, USA. */
252b5132 22
252b5132 23#include "sysdep.h"
3db64b00 24#include "bfd.h"
252b5132 25#include "libiberty.h"
42627821 26#include "filenames.h"
3882b010 27#include "safe-ctype.h"
252b5132
RH
28#include "obstack.h"
29#include "bfdlink.h"
30
31#include "ld.h"
32#include "ldmain.h"
252b5132
RH
33#include "ldexp.h"
34#include "ldlang.h"
df2a7313 35#include <ldgram.h>
252b5132
RH
36#include "ldlex.h"
37#include "ldmisc.h"
38#include "ldctor.h"
39#include "ldfile.h"
b71e2778 40#include "ldemul.h"
252b5132
RH
41#include "fnmatch.h"
42#include "demangle.h"
108ba305 43#include "hashtab.h"
5d3236ee
DK
44#include "libbfd.h"
45#ifdef ENABLE_PLUGINS
46#include "plugin.h"
47#endif /* ENABLE_PLUGINS */
252b5132 48
7abb6dea 49#ifndef offsetof
cf888e70 50#define offsetof(TYPE, MEMBER) ((size_t) & (((TYPE*) 0)->MEMBER))
7abb6dea
AM
51#endif
52
cf888e70 53/* Locals variables. */
252b5132 54static struct obstack stat_obstack;
35835446 55static struct obstack map_obstack;
252b5132
RH
56
57#define obstack_chunk_alloc xmalloc
58#define obstack_chunk_free free
8be573a7 59static const char *entry_symbol_default = "start";
b34976b6 60static bfd_boolean placed_commons = FALSE;
8423293d 61static bfd_boolean stripped_excluded_sections = FALSE;
252b5132 62static lang_output_section_statement_type *default_common_section;
b34976b6 63static bfd_boolean map_option_f;
252b5132
RH
64static bfd_vma print_dot;
65static lang_input_statement_type *first_file;
5f992e62 66static const char *current_target;
252b5132 67static lang_statement_list_type statement_list;
420e579c 68static struct bfd_hash_table lang_definedness_table;
bde18da4
AM
69static lang_statement_list_type *stat_save[10];
70static lang_statement_list_type **stat_save_ptr = &stat_save[0];
c4b78195
NC
71static struct unique_sections *unique_section_list;
72static bfd_boolean ldlang_sysrooted_script = FALSE;
252b5132 73
cf888e70 74/* Forward declarations. */
a431bc2e 75static void exp_init_os (etree_type *);
35835446 76static void init_map_userdata (bfd *, asection *, void *);
1579bae1 77static lang_input_statement_type *lookup_name (const char *);
420e579c
HPN
78static struct bfd_hash_entry *lang_definedness_newfunc
79 (struct bfd_hash_entry *, struct bfd_hash_table *, const char *);
1579bae1 80static void insert_undefined (const char *);
35835446 81static bfd_boolean sort_def_symbol (struct bfd_link_hash_entry *, void *);
1579bae1
AM
82static void print_statement (lang_statement_union_type *,
83 lang_output_section_statement_type *);
84static void print_statement_list (lang_statement_union_type *,
85 lang_output_section_statement_type *);
86static void print_statements (void);
d64703c6 87static void print_input_section (asection *, bfd_boolean);
1579bae1 88static bfd_boolean lang_one_common (struct bfd_link_hash_entry *, void *);
8543fde5
DK
89#ifdef ENABLE_PLUGINS
90static void lang_list_insert_after (lang_statement_list_type *destlist,
91 lang_statement_list_type *srclist,
92 lang_statement_union_type **field);
93static void lang_list_remove_tail (lang_statement_list_type *destlist,
94 lang_statement_list_type *origlist);
95#endif /* ENABLE_PLUGINS */
1579bae1
AM
96static void lang_record_phdrs (void);
97static void lang_do_version_exports_section (void);
55255dae
L
98static void lang_finalize_version_expr_head
99 (struct bfd_elf_version_expr_head *);
1579bae1 100
cf888e70 101/* Exported variables. */
8be573a7 102const char *output_target;
252b5132 103lang_output_section_statement_type *abs_output_section;
aea4bd9d 104lang_statement_list_type lang_output_section_statement;
252b5132 105lang_statement_list_type *stat_ptr = &statement_list;
87f2a346 106lang_statement_list_type file_chain = { NULL, NULL };
dc27aea4 107lang_statement_list_type input_file_chain;
e3e942e9 108struct bfd_sym_chain entry_symbol = { NULL, NULL };
1e281515 109const char *entry_section = ".text";
b34976b6 110bfd_boolean entry_from_cmdline;
24898b70 111bfd_boolean undef_from_cmdline;
b34976b6
AM
112bfd_boolean lang_has_input_file = FALSE;
113bfd_boolean had_output_filename = FALSE;
114bfd_boolean lang_float_flag = FALSE;
115bfd_boolean delete_output_file_on_failure = FALSE;
f5ff60a6 116struct lang_phdr *lang_phdr_list;
252b5132 117struct lang_nocrossrefs *nocrossref_list;
c4b78195 118bfd_boolean missing_file = FALSE;
e9ee469a
AM
119
120 /* Functions that traverse the linker script and might evaluate
121 DEFINED() need to increment this. */
420e579c 122int lang_statement_iteration = 0;
252b5132
RH
123
124etree_type *base; /* Relocation base - or null */
125
61f5d054
L
126/* Return TRUE if the PATTERN argument is a wildcard pattern.
127 Although backslashes are treated specially if a pattern contains
128 wildcards, we do not consider the mere presence of a backslash to
129 be enough to cause the pattern to be treated as a wildcard.
130 That lets us handle DOS filenames more naturally. */
131#define wildcardp(pattern) (strpbrk ((pattern), "?*[") != NULL)
132
d1778b88 133#define new_stat(x, y) \
1579bae1 134 (x##_type *) new_statement (x##_enum, sizeof (x##_type), y)
252b5132 135
d1778b88
AM
136#define outside_section_address(q) \
137 ((q)->output_offset + (q)->output_section->vma)
252b5132 138
d1778b88
AM
139#define outside_symbol_address(q) \
140 ((q)->value + outside_section_address (q->section))
252b5132
RH
141
142#define SECTION_NAME_MAP_LENGTH (16)
143
1579bae1
AM
144void *
145stat_alloc (size_t size)
252b5132
RH
146{
147 return obstack_alloc (&stat_obstack, size);
148}
149
97407faf
AM
150static int
151name_match (const char *pattern, const char *name)
152{
153 if (wildcardp (pattern))
154 return fnmatch (pattern, name, 0);
155 return strcmp (pattern, name);
156}
157
158/* If PATTERN is of the form archive:file, return a pointer to the
159 separator. If not, return NULL. */
160
161static char *
162archive_path (const char *pattern)
163{
164 char *p = NULL;
165
166 if (link_info.path_separator == 0)
167 return p;
168
169 p = strchr (pattern, link_info.path_separator);
170#ifdef HAVE_DOS_BASED_FILE_SYSTEM
171 if (p == NULL || link_info.path_separator != ':')
172 return p;
173
174 /* Assume a match on the second char is part of drive specifier,
175 as in "c:\silly.dos". */
967928e9 176 if (p == pattern + 1 && ISALPHA (*pattern))
97407faf
AM
177 p = strchr (p + 1, link_info.path_separator);
178#endif
179 return p;
180}
181
967928e9
AM
182/* Given that FILE_SPEC results in a non-NULL SEP result from archive_path,
183 return whether F matches FILE_SPEC. */
184
185static bfd_boolean
186input_statement_is_archive_path (const char *file_spec, char *sep,
187 lang_input_statement_type *f)
188{
189 bfd_boolean match = FALSE;
190
191 if ((*(sep + 1) == 0
192 || name_match (sep + 1, f->filename) == 0)
193 && ((sep != file_spec)
194 == (f->the_bfd != NULL && f->the_bfd->my_archive != NULL)))
195 {
196 match = TRUE;
197
198 if (sep != file_spec)
199 {
200 const char *aname = f->the_bfd->my_archive->filename;
201 *sep = 0;
202 match = name_match (file_spec, aname) == 0;
203 *sep = link_info.path_separator;
204 }
205 }
206 return match;
207}
208
8a99a385 209static bfd_boolean
d0bf826b
AM
210unique_section_p (const asection *sec,
211 const lang_output_section_statement_type *os)
577a0623
AM
212{
213 struct unique_sections *unam;
d0d6a25b 214 const char *secnam;
577a0623 215
d0d6a25b
AM
216 if (link_info.relocatable
217 && sec->owner != NULL
218 && bfd_is_group_section (sec->owner, sec))
d0bf826b
AM
219 return !(os != NULL
220 && strcmp (os->name, DISCARD_SECTION_NAME) == 0);
d0d6a25b
AM
221
222 secnam = sec->name;
577a0623 223 for (unam = unique_section_list; unam; unam = unam->next)
97407faf
AM
224 if (name_match (unam->name, secnam) == 0)
225 return TRUE;
577a0623 226
b34976b6 227 return FALSE;
577a0623
AM
228}
229
08da4cac 230/* Generic traversal routines for finding matching sections. */
4dec4d4e 231
72223188
JJ
232/* Try processing a section against a wildcard. This just calls
233 the callback unless the filename exclusion list is present
234 and excludes the file. It's hardly ever present so this
235 function is very fast. */
236
4dec4d4e 237static void
72223188
JJ
238walk_wild_consider_section (lang_wild_statement_type *ptr,
239 lang_input_statement_type *file,
240 asection *s,
241 struct wildcard_list *sec,
242 callback_t callback,
243 void *data)
4dec4d4e 244{
72223188
JJ
245 struct name_list *list_tmp;
246
97407faf 247 /* Don't process sections from files which were excluded. */
72223188
JJ
248 for (list_tmp = sec->spec.exclude_name_list;
249 list_tmp;
250 list_tmp = list_tmp->next)
251 {
967928e9 252 char *p = archive_path (list_tmp->name);
b6bf44ba 253
967928e9 254 if (p != NULL)
72223188 255 {
967928e9
AM
256 if (input_statement_is_archive_path (list_tmp->name, p, file))
257 return;
72223188
JJ
258 }
259
967928e9
AM
260 else if (name_match (list_tmp->name, file->filename) == 0)
261 return;
262
263 /* FIXME: Perhaps remove the following at some stage? Matching
264 unadorned archives like this was never documented and has
265 been superceded by the archive:path syntax. */
266 else if (file->the_bfd != NULL
267 && file->the_bfd->my_archive != NULL
268 && name_match (list_tmp->name,
269 file->the_bfd->my_archive->filename) == 0)
270 return;
72223188
JJ
271 }
272
967928e9 273 (*callback) (ptr, sec, s, file, data);
72223188
JJ
274}
275
276/* Lowest common denominator routine that can handle everything correctly,
277 but slowly. */
278
279static void
280walk_wild_section_general (lang_wild_statement_type *ptr,
281 lang_input_statement_type *file,
282 callback_t callback,
283 void *data)
284{
285 asection *s;
286 struct wildcard_list *sec;
b6bf44ba
AM
287
288 for (s = file->the_bfd->sections; s != NULL; s = s->next)
4dec4d4e 289 {
b6bf44ba 290 sec = ptr->section_list;
2181f54f
AM
291 if (sec == NULL)
292 (*callback) (ptr, sec, s, file, data);
293
294 while (sec != NULL)
08da4cac 295 {
b34976b6 296 bfd_boolean skip = FALSE;
2181f54f 297
72223188 298 if (sec->spec.name != NULL)
b6bf44ba 299 {
2181f54f
AM
300 const char *sname = bfd_get_section_name (file->the_bfd, s);
301
97407faf 302 skip = name_match (sec->spec.name, sname) != 0;
b6bf44ba 303 }
4dec4d4e 304
b6bf44ba 305 if (!skip)
72223188 306 walk_wild_consider_section (ptr, file, s, sec, callback, data);
4dec4d4e 307
2181f54f 308 sec = sec->next;
4dec4d4e
RH
309 }
310 }
311}
312
72223188
JJ
313/* Routines to find a single section given its name. If there's more
314 than one section with that name, we report that. */
315
316typedef struct
317{
318 asection *found_section;
319 bfd_boolean multiple_sections_found;
320} section_iterator_callback_data;
321
322static bfd_boolean
91d6fa6a 323section_iterator_callback (bfd *abfd ATTRIBUTE_UNUSED, asection *s, void *data)
72223188 324{
1e9cc1c2 325 section_iterator_callback_data *d = (section_iterator_callback_data *) data;
72223188
JJ
326
327 if (d->found_section != NULL)
328 {
329 d->multiple_sections_found = TRUE;
330 return TRUE;
331 }
332
333 d->found_section = s;
334 return FALSE;
335}
336
337static asection *
338find_section (lang_input_statement_type *file,
339 struct wildcard_list *sec,
340 bfd_boolean *multiple_sections_found)
341{
342 section_iterator_callback_data cb_data = { NULL, FALSE };
343
329c1c86 344 bfd_get_section_by_name_if (file->the_bfd, sec->spec.name,
72223188
JJ
345 section_iterator_callback, &cb_data);
346 *multiple_sections_found = cb_data.multiple_sections_found;
347 return cb_data.found_section;
348}
349
350/* Code for handling simple wildcards without going through fnmatch,
351 which can be expensive because of charset translations etc. */
352
353/* A simple wild is a literal string followed by a single '*',
354 where the literal part is at least 4 characters long. */
355
356static bfd_boolean
357is_simple_wild (const char *name)
358{
359 size_t len = strcspn (name, "*?[");
360 return len >= 4 && name[len] == '*' && name[len + 1] == '\0';
361}
362
363static bfd_boolean
364match_simple_wild (const char *pattern, const char *name)
365{
366 /* The first four characters of the pattern are guaranteed valid
367 non-wildcard characters. So we can go faster. */
368 if (pattern[0] != name[0] || pattern[1] != name[1]
369 || pattern[2] != name[2] || pattern[3] != name[3])
370 return FALSE;
371
372 pattern += 4;
373 name += 4;
374 while (*pattern != '*')
375 if (*name++ != *pattern++)
376 return FALSE;
377
378 return TRUE;
379}
380
02ecc8e9
L
381/* Return the numerical value of the init_priority attribute from
382 section name NAME. */
383
384static unsigned long
385get_init_priority (const char *name)
386{
387 char *end;
388 unsigned long init_priority;
389
390 /* GCC uses the following section names for the init_priority
391 attribute with numerical values 101 and 65535 inclusive. A
392 lower value means a higher priority.
393
394 1: .init_array.NNNN/.fini_array.NNNN: Where NNNN is the
395 decimal numerical value of the init_priority attribute.
396 The order of execution in .init_array is forward and
397 .fini_array is backward.
398 2: .ctors.NNNN/.ctors.NNNN: Where NNNN is 65535 minus the
399 decimal numerical value of the init_priority attribute.
400 The order of execution in .ctors is backward and .dtors
401 is forward.
402 */
403 if (strncmp (name, ".init_array.", 12) == 0
404 || strncmp (name, ".fini_array.", 12) == 0)
405 {
406 init_priority = strtoul (name + 12, &end, 10);
407 return *end ? 0 : init_priority;
408 }
409 else if (strncmp (name, ".ctors.", 7) == 0
410 || strncmp (name, ".dtors.", 7) == 0)
411 {
412 init_priority = strtoul (name + 7, &end, 10);
413 return *end ? 0 : 65535 - init_priority;
414 }
415
416 return 0;
417}
418
50c77e5d
NC
419/* Compare sections ASEC and BSEC according to SORT. */
420
421static int
422compare_section (sort_type sort, asection *asec, asection *bsec)
423{
424 int ret;
02ecc8e9 425 unsigned long ainit_priority, binit_priority;
50c77e5d
NC
426
427 switch (sort)
428 {
429 default:
430 abort ();
431
02ecc8e9
L
432 case by_init_priority:
433 ainit_priority
434 = get_init_priority (bfd_get_section_name (asec->owner, asec));
435 binit_priority
436 = get_init_priority (bfd_get_section_name (bsec->owner, bsec));
437 if (ainit_priority == 0 || binit_priority == 0)
438 goto sort_by_name;
439 ret = ainit_priority - binit_priority;
440 if (ret)
441 break;
442 else
443 goto sort_by_name;
444
50c77e5d
NC
445 case by_alignment_name:
446 ret = (bfd_section_alignment (bsec->owner, bsec)
447 - bfd_section_alignment (asec->owner, asec));
448 if (ret)
449 break;
450 /* Fall through. */
451
452 case by_name:
02ecc8e9 453sort_by_name:
50c77e5d
NC
454 ret = strcmp (bfd_get_section_name (asec->owner, asec),
455 bfd_get_section_name (bsec->owner, bsec));
456 break;
457
458 case by_name_alignment:
459 ret = strcmp (bfd_get_section_name (asec->owner, asec),
460 bfd_get_section_name (bsec->owner, bsec));
461 if (ret)
462 break;
463 /* Fall through. */
464
465 case by_alignment:
466 ret = (bfd_section_alignment (bsec->owner, bsec)
467 - bfd_section_alignment (asec->owner, asec));
468 break;
469 }
470
471 return ret;
472}
473
329c1c86 474/* Build a Binary Search Tree to sort sections, unlike insertion sort
50c77e5d
NC
475 used in wild_sort(). BST is considerably faster if the number of
476 of sections are large. */
477
478static lang_section_bst_type **
479wild_sort_fast (lang_wild_statement_type *wild,
329c1c86
AM
480 struct wildcard_list *sec,
481 lang_input_statement_type *file ATTRIBUTE_UNUSED,
482 asection *section)
50c77e5d 483{
329c1c86 484 lang_section_bst_type **tree;
50c77e5d 485
e6f2cbf5 486 tree = &wild->tree;
50c77e5d 487 if (!wild->filenames_sorted
329c1c86 488 && (sec == NULL || sec->spec.sorted == none))
50c77e5d
NC
489 {
490 /* Append at the right end of tree. */
491 while (*tree)
329c1c86 492 tree = &((*tree)->right);
50c77e5d
NC
493 return tree;
494 }
495
329c1c86 496 while (*tree)
50c77e5d
NC
497 {
498 /* Find the correct node to append this section. */
329c1c86
AM
499 if (compare_section (sec->spec.sorted, section, (*tree)->section) < 0)
500 tree = &((*tree)->left);
501 else
502 tree = &((*tree)->right);
50c77e5d
NC
503 }
504
505 return tree;
506}
507
508/* Use wild_sort_fast to build a BST to sort sections. */
509
510static void
511output_section_callback_fast (lang_wild_statement_type *ptr,
329c1c86
AM
512 struct wildcard_list *sec,
513 asection *section,
514 lang_input_statement_type *file,
d0bf826b 515 void *output)
50c77e5d
NC
516{
517 lang_section_bst_type *node;
518 lang_section_bst_type **tree;
d0bf826b 519 lang_output_section_statement_type *os;
50c77e5d 520
d0bf826b
AM
521 os = (lang_output_section_statement_type *) output;
522
523 if (unique_section_p (section, os))
50c77e5d
NC
524 return;
525
1e9cc1c2 526 node = (lang_section_bst_type *) xmalloc (sizeof (lang_section_bst_type));
50c77e5d
NC
527 node->left = 0;
528 node->right = 0;
529 node->section = section;
530
531 tree = wild_sort_fast (ptr, sec, file, section);
532 if (tree != NULL)
533 *tree = node;
534}
535
536/* Convert a sorted sections' BST back to list form. */
537
538static void
329c1c86
AM
539output_section_callback_tree_to_list (lang_wild_statement_type *ptr,
540 lang_section_bst_type *tree,
541 void *output)
50c77e5d
NC
542{
543 if (tree->left)
544 output_section_callback_tree_to_list (ptr, tree->left, output);
545
329c1c86
AM
546 lang_add_section (&ptr->children, tree->section,
547 (lang_output_section_statement_type *) output);
50c77e5d
NC
548
549 if (tree->right)
550 output_section_callback_tree_to_list (ptr, tree->right, output);
551
552 free (tree);
553}
554
72223188
JJ
555/* Specialized, optimized routines for handling different kinds of
556 wildcards */
557
558static void
559walk_wild_section_specs1_wild0 (lang_wild_statement_type *ptr,
560 lang_input_statement_type *file,
561 callback_t callback,
562 void *data)
563{
564 /* We can just do a hash lookup for the section with the right name.
565 But if that lookup discovers more than one section with the name
566 (should be rare), we fall back to the general algorithm because
567 we would otherwise have to sort the sections to make sure they
568 get processed in the bfd's order. */
569 bfd_boolean multiple_sections_found;
570 struct wildcard_list *sec0 = ptr->handler_data[0];
571 asection *s0 = find_section (file, sec0, &multiple_sections_found);
572
573 if (multiple_sections_found)
574 walk_wild_section_general (ptr, file, callback, data);
575 else if (s0)
576 walk_wild_consider_section (ptr, file, s0, sec0, callback, data);
577}
578
579static void
580walk_wild_section_specs1_wild1 (lang_wild_statement_type *ptr,
581 lang_input_statement_type *file,
582 callback_t callback,
583 void *data)
584{
585 asection *s;
586 struct wildcard_list *wildsec0 = ptr->handler_data[0];
587
588 for (s = file->the_bfd->sections; s != NULL; s = s->next)
589 {
590 const char *sname = bfd_get_section_name (file->the_bfd, s);
591 bfd_boolean skip = !match_simple_wild (wildsec0->spec.name, sname);
592
593 if (!skip)
594 walk_wild_consider_section (ptr, file, s, wildsec0, callback, data);
595 }
596}
597
598static void
599walk_wild_section_specs2_wild1 (lang_wild_statement_type *ptr,
600 lang_input_statement_type *file,
601 callback_t callback,
602 void *data)
603{
604 asection *s;
605 struct wildcard_list *sec0 = ptr->handler_data[0];
606 struct wildcard_list *wildsec1 = ptr->handler_data[1];
607 bfd_boolean multiple_sections_found;
608 asection *s0 = find_section (file, sec0, &multiple_sections_found);
609
610 if (multiple_sections_found)
611 {
612 walk_wild_section_general (ptr, file, callback, data);
613 return;
614 }
615
616 /* Note that if the section was not found, s0 is NULL and
617 we'll simply never succeed the s == s0 test below. */
618 for (s = file->the_bfd->sections; s != NULL; s = s->next)
619 {
620 /* Recall that in this code path, a section cannot satisfy more
621 than one spec, so if s == s0 then it cannot match
622 wildspec1. */
623 if (s == s0)
624 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
625 else
626 {
627 const char *sname = bfd_get_section_name (file->the_bfd, s);
628 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
629
630 if (!skip)
631 walk_wild_consider_section (ptr, file, s, wildsec1, callback,
632 data);
633 }
634 }
635}
636
637static void
638walk_wild_section_specs3_wild2 (lang_wild_statement_type *ptr,
639 lang_input_statement_type *file,
640 callback_t callback,
641 void *data)
642{
643 asection *s;
644 struct wildcard_list *sec0 = ptr->handler_data[0];
645 struct wildcard_list *wildsec1 = ptr->handler_data[1];
646 struct wildcard_list *wildsec2 = ptr->handler_data[2];
647 bfd_boolean multiple_sections_found;
648 asection *s0 = find_section (file, sec0, &multiple_sections_found);
649
650 if (multiple_sections_found)
651 {
652 walk_wild_section_general (ptr, file, callback, data);
653 return;
654 }
655
656 for (s = file->the_bfd->sections; s != NULL; s = s->next)
657 {
658 if (s == s0)
659 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
660 else
661 {
662 const char *sname = bfd_get_section_name (file->the_bfd, s);
663 bfd_boolean skip = !match_simple_wild (wildsec1->spec.name, sname);
664
665 if (!skip)
666 walk_wild_consider_section (ptr, file, s, wildsec1, callback, data);
667 else
668 {
669 skip = !match_simple_wild (wildsec2->spec.name, sname);
670 if (!skip)
671 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
672 data);
673 }
674 }
675 }
676}
677
678static void
679walk_wild_section_specs4_wild2 (lang_wild_statement_type *ptr,
680 lang_input_statement_type *file,
681 callback_t callback,
682 void *data)
683{
684 asection *s;
685 struct wildcard_list *sec0 = ptr->handler_data[0];
686 struct wildcard_list *sec1 = ptr->handler_data[1];
687 struct wildcard_list *wildsec2 = ptr->handler_data[2];
688 struct wildcard_list *wildsec3 = ptr->handler_data[3];
689 bfd_boolean multiple_sections_found;
690 asection *s0 = find_section (file, sec0, &multiple_sections_found), *s1;
691
692 if (multiple_sections_found)
693 {
694 walk_wild_section_general (ptr, file, callback, data);
695 return;
696 }
697
698 s1 = find_section (file, sec1, &multiple_sections_found);
699 if (multiple_sections_found)
700 {
701 walk_wild_section_general (ptr, file, callback, data);
702 return;
703 }
704
705 for (s = file->the_bfd->sections; s != NULL; s = s->next)
706 {
707 if (s == s0)
708 walk_wild_consider_section (ptr, file, s, sec0, callback, data);
709 else
710 if (s == s1)
711 walk_wild_consider_section (ptr, file, s, sec1, callback, data);
712 else
713 {
714 const char *sname = bfd_get_section_name (file->the_bfd, s);
715 bfd_boolean skip = !match_simple_wild (wildsec2->spec.name,
716 sname);
717
718 if (!skip)
719 walk_wild_consider_section (ptr, file, s, wildsec2, callback,
720 data);
721 else
722 {
723 skip = !match_simple_wild (wildsec3->spec.name, sname);
724 if (!skip)
725 walk_wild_consider_section (ptr, file, s, wildsec3,
726 callback, data);
727 }
728 }
729 }
730}
731
732static void
733walk_wild_section (lang_wild_statement_type *ptr,
734 lang_input_statement_type *file,
735 callback_t callback,
736 void *data)
737{
738 if (file->just_syms_flag)
739 return;
740
741 (*ptr->walk_wild_section_handler) (ptr, file, callback, data);
742}
743
744/* Returns TRUE when name1 is a wildcard spec that might match
745 something name2 can match. We're conservative: we return FALSE
746 only if the prefixes of name1 and name2 are different up to the
747 first wildcard character. */
748
749static bfd_boolean
750wild_spec_can_overlap (const char *name1, const char *name2)
751{
752 size_t prefix1_len = strcspn (name1, "?*[");
753 size_t prefix2_len = strcspn (name2, "?*[");
754 size_t min_prefix_len;
755
756 /* Note that if there is no wildcard character, then we treat the
757 terminating 0 as part of the prefix. Thus ".text" won't match
758 ".text." or ".text.*", for example. */
759 if (name1[prefix1_len] == '\0')
760 prefix1_len++;
761 if (name2[prefix2_len] == '\0')
762 prefix2_len++;
763
764 min_prefix_len = prefix1_len < prefix2_len ? prefix1_len : prefix2_len;
765
766 return memcmp (name1, name2, min_prefix_len) == 0;
767}
768
769/* Select specialized code to handle various kinds of wildcard
770 statements. */
771
772static void
773analyze_walk_wild_section_handler (lang_wild_statement_type *ptr)
774{
775 int sec_count = 0;
776 int wild_name_count = 0;
777 struct wildcard_list *sec;
778 int signature;
779 int data_counter;
780
781 ptr->walk_wild_section_handler = walk_wild_section_general;
7544697a
AM
782 ptr->handler_data[0] = NULL;
783 ptr->handler_data[1] = NULL;
784 ptr->handler_data[2] = NULL;
785 ptr->handler_data[3] = NULL;
e6f2cbf5 786 ptr->tree = NULL;
72223188
JJ
787
788 /* Count how many wildcard_specs there are, and how many of those
789 actually use wildcards in the name. Also, bail out if any of the
790 wildcard names are NULL. (Can this actually happen?
791 walk_wild_section used to test for it.) And bail out if any
792 of the wildcards are more complex than a simple string
793 ending in a single '*'. */
794 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
795 {
796 ++sec_count;
797 if (sec->spec.name == NULL)
798 return;
799 if (wildcardp (sec->spec.name))
800 {
801 ++wild_name_count;
802 if (!is_simple_wild (sec->spec.name))
803 return;
804 }
805 }
806
807 /* The zero-spec case would be easy to optimize but it doesn't
808 happen in practice. Likewise, more than 4 specs doesn't
809 happen in practice. */
810 if (sec_count == 0 || sec_count > 4)
811 return;
812
813 /* Check that no two specs can match the same section. */
814 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
815 {
816 struct wildcard_list *sec2;
817 for (sec2 = sec->next; sec2 != NULL; sec2 = sec2->next)
818 {
819 if (wild_spec_can_overlap (sec->spec.name, sec2->spec.name))
820 return;
821 }
822 }
823
824 signature = (sec_count << 8) + wild_name_count;
825 switch (signature)
826 {
827 case 0x0100:
828 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild0;
829 break;
830 case 0x0101:
831 ptr->walk_wild_section_handler = walk_wild_section_specs1_wild1;
832 break;
833 case 0x0201:
834 ptr->walk_wild_section_handler = walk_wild_section_specs2_wild1;
835 break;
836 case 0x0302:
837 ptr->walk_wild_section_handler = walk_wild_section_specs3_wild2;
838 break;
839 case 0x0402:
840 ptr->walk_wild_section_handler = walk_wild_section_specs4_wild2;
841 break;
842 default:
843 return;
844 }
845
846 /* Now fill the data array with pointers to the specs, first the
847 specs with non-wildcard names, then the specs with wildcard
848 names. It's OK to process the specs in different order from the
849 given order, because we've already determined that no section
850 will match more than one spec. */
851 data_counter = 0;
852 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
853 if (!wildcardp (sec->spec.name))
854 ptr->handler_data[data_counter++] = sec;
855 for (sec = ptr->section_list; sec != NULL; sec = sec->next)
856 if (wildcardp (sec->spec.name))
857 ptr->handler_data[data_counter++] = sec;
858}
859
4dec4d4e
RH
860/* Handle a wild statement for a single file F. */
861
862static void
1579bae1
AM
863walk_wild_file (lang_wild_statement_type *s,
864 lang_input_statement_type *f,
865 callback_t callback,
866 void *data)
4dec4d4e
RH
867{
868 if (f->the_bfd == NULL
869 || ! bfd_check_format (f->the_bfd, bfd_archive))
b6bf44ba 870 walk_wild_section (s, f, callback, data);
4dec4d4e
RH
871 else
872 {
873 bfd *member;
874
875 /* This is an archive file. We must map each member of the
876 archive separately. */
1579bae1 877 member = bfd_openr_next_archived_file (f->the_bfd, NULL);
4dec4d4e
RH
878 while (member != NULL)
879 {
880 /* When lookup_name is called, it will call the add_symbols
881 entry point for the archive. For each element of the
882 archive which is included, BFD will call ldlang_add_file,
883 which will set the usrdata field of the member to the
884 lang_input_statement. */
885 if (member->usrdata != NULL)
886 {
1e9cc1c2
NC
887 walk_wild_section (s,
888 (lang_input_statement_type *) member->usrdata,
889 callback, data);
4dec4d4e
RH
890 }
891
892 member = bfd_openr_next_archived_file (f->the_bfd, member);
893 }
894 }
895}
896
897static void
1579bae1 898walk_wild (lang_wild_statement_type *s, callback_t callback, void *data)
4dec4d4e 899{
b6bf44ba 900 const char *file_spec = s->filename;
97407faf 901 char *p;
b6bf44ba
AM
902
903 if (file_spec == NULL)
4dec4d4e
RH
904 {
905 /* Perform the iteration over all files in the list. */
e50d8076 906 LANG_FOR_EACH_INPUT_STATEMENT (f)
4dec4d4e 907 {
b6bf44ba 908 walk_wild_file (s, f, callback, data);
4dec4d4e
RH
909 }
910 }
97407faf
AM
911 else if ((p = archive_path (file_spec)) != NULL)
912 {
913 LANG_FOR_EACH_INPUT_STATEMENT (f)
914 {
967928e9
AM
915 if (input_statement_is_archive_path (file_spec, p, f))
916 walk_wild_file (s, f, callback, data);
97407faf
AM
917 }
918 }
b6bf44ba 919 else if (wildcardp (file_spec))
4dec4d4e 920 {
e50d8076 921 LANG_FOR_EACH_INPUT_STATEMENT (f)
4dec4d4e 922 {
68bbb9f7 923 if (fnmatch (file_spec, f->filename, 0) == 0)
b6bf44ba 924 walk_wild_file (s, f, callback, data);
4dec4d4e
RH
925 }
926 }
927 else
928 {
e50d8076
NC
929 lang_input_statement_type *f;
930
4dec4d4e 931 /* Perform the iteration over a single file. */
b6bf44ba 932 f = lookup_name (file_spec);
6770ec8c 933 if (f)
b6bf44ba 934 walk_wild_file (s, f, callback, data);
4dec4d4e 935 }
5f992e62
AM
936}
937
08da4cac 938/* lang_for_each_statement walks the parse tree and calls the provided
8658f989
AM
939 function for each node, except those inside output section statements
940 with constraint set to -1. */
252b5132 941
8658f989 942void
1579bae1
AM
943lang_for_each_statement_worker (void (*func) (lang_statement_union_type *),
944 lang_statement_union_type *s)
252b5132 945{
1579bae1 946 for (; s != NULL; s = s->header.next)
252b5132
RH
947 {
948 func (s);
949
950 switch (s->header.type)
951 {
952 case lang_constructors_statement_enum:
953 lang_for_each_statement_worker (func, constructor_list.head);
954 break;
955 case lang_output_section_statement_enum:
8658f989
AM
956 if (s->output_section_statement.constraint != -1)
957 lang_for_each_statement_worker
958 (func, s->output_section_statement.children.head);
252b5132
RH
959 break;
960 case lang_wild_statement_enum:
6feb9908
AM
961 lang_for_each_statement_worker (func,
962 s->wild_statement.children.head);
252b5132
RH
963 break;
964 case lang_group_statement_enum:
965 lang_for_each_statement_worker (func,
966 s->group_statement.children.head);
967 break;
968 case lang_data_statement_enum:
969 case lang_reloc_statement_enum:
970 case lang_object_symbols_statement_enum:
971 case lang_output_statement_enum:
972 case lang_target_statement_enum:
973 case lang_input_section_enum:
974 case lang_input_statement_enum:
975 case lang_assignment_statement_enum:
976 case lang_padding_statement_enum:
977 case lang_address_statement_enum:
978 case lang_fill_statement_enum:
53d25da6 979 case lang_insert_statement_enum:
252b5132
RH
980 break;
981 default:
982 FAIL ();
983 break;
984 }
985 }
986}
987
988void
1579bae1 989lang_for_each_statement (void (*func) (lang_statement_union_type *))
252b5132 990{
08da4cac 991 lang_for_each_statement_worker (func, statement_list.head);
252b5132
RH
992}
993
994/*----------------------------------------------------------------------*/
08da4cac 995
252b5132 996void
1579bae1 997lang_list_init (lang_statement_list_type *list)
252b5132 998{
1579bae1 999 list->head = NULL;
252b5132
RH
1000 list->tail = &list->head;
1001}
1002
bde18da4
AM
1003void
1004push_stat_ptr (lang_statement_list_type *new_ptr)
1005{
1006 if (stat_save_ptr >= stat_save + sizeof (stat_save) / sizeof (stat_save[0]))
1007 abort ();
1008 *stat_save_ptr++ = stat_ptr;
1009 stat_ptr = new_ptr;
1010}
1011
1012void
1013pop_stat_ptr (void)
1014{
1015 if (stat_save_ptr <= stat_save)
1016 abort ();
1017 stat_ptr = *--stat_save_ptr;
1018}
1019
08da4cac 1020/* Build a new statement node for the parse tree. */
252b5132 1021
08da4cac 1022static lang_statement_union_type *
1579bae1
AM
1023new_statement (enum statement_enum type,
1024 size_t size,
1025 lang_statement_list_type *list)
252b5132 1026{
d3ce72d0 1027 lang_statement_union_type *new_stmt;
252b5132 1028
d3ce72d0
NC
1029 new_stmt = (lang_statement_union_type *) stat_alloc (size);
1030 new_stmt->header.type = type;
1031 new_stmt->header.next = NULL;
1032 lang_statement_append (list, new_stmt, &new_stmt->header.next);
1033 return new_stmt;
252b5132
RH
1034}
1035
08da4cac
KH
1036/* Build a new input file node for the language. There are several
1037 ways in which we treat an input file, eg, we only look at symbols,
1038 or prefix it with a -l etc.
252b5132 1039
08da4cac 1040 We can be supplied with requests for input files more than once;
396a2467 1041 they may, for example be split over several lines like foo.o(.text)
d1778b88 1042 foo.o(.data) etc, so when asked for a file we check that we haven't
08da4cac 1043 got it already so we don't duplicate the bfd. */
252b5132 1044
252b5132 1045static lang_input_statement_type *
1579bae1
AM
1046new_afile (const char *name,
1047 lang_input_file_enum_type file_type,
1048 const char *target,
1049 bfd_boolean add_to_list)
252b5132
RH
1050{
1051 lang_input_statement_type *p;
1052
1053 if (add_to_list)
d3ce72d0 1054 p = (lang_input_statement_type *) new_stat (lang_input_statement, stat_ptr);
252b5132
RH
1055 else
1056 {
d3ce72d0
NC
1057 p = (lang_input_statement_type *)
1058 stat_alloc (sizeof (lang_input_statement_type));
bd4d42c1 1059 p->header.type = lang_input_statement_enum;
252b5132
RH
1060 p->header.next = NULL;
1061 }
1062
b34976b6 1063 lang_has_input_file = TRUE;
252b5132 1064 p->target = target;
e3f2db7f 1065 p->sysrooted = FALSE;
bcb674cf
RS
1066
1067 if (file_type == lang_input_file_is_l_enum
1068 && name[0] == ':' && name[1] != '\0')
1069 {
1070 file_type = lang_input_file_is_search_file_enum;
1071 name = name + 1;
1072 }
1073
252b5132
RH
1074 switch (file_type)
1075 {
1076 case lang_input_file_is_symbols_only_enum:
1077 p->filename = name;
b7f95647 1078 p->maybe_archive = FALSE;
b34976b6 1079 p->real = TRUE;
252b5132 1080 p->local_sym_name = name;
b34976b6
AM
1081 p->just_syms_flag = TRUE;
1082 p->search_dirs_flag = FALSE;
252b5132
RH
1083 break;
1084 case lang_input_file_is_fake_enum:
1085 p->filename = name;
b7f95647 1086 p->maybe_archive = FALSE;
b34976b6 1087 p->real = FALSE;
252b5132 1088 p->local_sym_name = name;
b34976b6
AM
1089 p->just_syms_flag = FALSE;
1090 p->search_dirs_flag = FALSE;
252b5132
RH
1091 break;
1092 case lang_input_file_is_l_enum:
b7f95647 1093 p->maybe_archive = TRUE;
252b5132 1094 p->filename = name;
b34976b6 1095 p->real = TRUE;
ff7a0acf 1096 p->local_sym_name = concat ("-l", name, (const char *) NULL);
b34976b6
AM
1097 p->just_syms_flag = FALSE;
1098 p->search_dirs_flag = TRUE;
252b5132
RH
1099 break;
1100 case lang_input_file_is_marker_enum:
1101 p->filename = name;
b7f95647 1102 p->maybe_archive = FALSE;
b34976b6 1103 p->real = FALSE;
252b5132 1104 p->local_sym_name = name;
b34976b6
AM
1105 p->just_syms_flag = FALSE;
1106 p->search_dirs_flag = TRUE;
252b5132
RH
1107 break;
1108 case lang_input_file_is_search_file_enum:
e3f2db7f 1109 p->sysrooted = ldlang_sysrooted_script;
252b5132 1110 p->filename = name;
b7f95647 1111 p->maybe_archive = FALSE;
b34976b6 1112 p->real = TRUE;
252b5132 1113 p->local_sym_name = name;
b34976b6
AM
1114 p->just_syms_flag = FALSE;
1115 p->search_dirs_flag = TRUE;
252b5132
RH
1116 break;
1117 case lang_input_file_is_file_enum:
1118 p->filename = name;
b7f95647 1119 p->maybe_archive = FALSE;
b34976b6 1120 p->real = TRUE;
252b5132 1121 p->local_sym_name = name;
b34976b6
AM
1122 p->just_syms_flag = FALSE;
1123 p->search_dirs_flag = FALSE;
252b5132
RH
1124 break;
1125 default:
1126 FAIL ();
1127 }
1579bae1 1128 p->the_bfd = NULL;
1579bae1
AM
1129 p->next_real_file = NULL;
1130 p->next = NULL;
252b5132 1131 p->dynamic = config.dynamic_link;
ddbb8a31
NC
1132 p->add_DT_NEEDED_for_dynamic = add_DT_NEEDED_for_dynamic;
1133 p->add_DT_NEEDED_for_regular = add_DT_NEEDED_for_regular;
252b5132 1134 p->whole_archive = whole_archive;
b34976b6 1135 p->loaded = FALSE;
c4b78195 1136 p->missing_file = FALSE;
8543fde5
DK
1137#ifdef ENABLE_PLUGINS
1138 p->claimed = FALSE;
1139 p->claim_archive = FALSE;
1140#endif /* ENABLE_PLUGINS */
c4b78195 1141
252b5132
RH
1142 lang_statement_append (&input_file_chain,
1143 (lang_statement_union_type *) p,
1144 &p->next_real_file);
1145 return p;
1146}
1147
1148lang_input_statement_type *
1579bae1
AM
1149lang_add_input_file (const char *name,
1150 lang_input_file_enum_type file_type,
1151 const char *target)
252b5132 1152{
b34976b6 1153 return new_afile (name, file_type, target, TRUE);
252b5132
RH
1154}
1155
409d7240 1156struct out_section_hash_entry
750877ba
L
1157{
1158 struct bfd_hash_entry root;
409d7240 1159 lang_statement_union_type s;
750877ba
L
1160};
1161
1162/* The hash table. */
1163
409d7240 1164static struct bfd_hash_table output_section_statement_table;
750877ba 1165
384a9dda 1166/* Support routines for the hash table used by lang_output_section_find,
750877ba
L
1167 initialize the table, fill in an entry and remove the table. */
1168
1169static struct bfd_hash_entry *
329c1c86 1170output_section_statement_newfunc (struct bfd_hash_entry *entry,
409d7240
AM
1171 struct bfd_hash_table *table,
1172 const char *string)
750877ba 1173{
384a9dda 1174 lang_output_section_statement_type **nextp;
409d7240 1175 struct out_section_hash_entry *ret;
384a9dda
AM
1176
1177 if (entry == NULL)
1178 {
1e9cc1c2
NC
1179 entry = (struct bfd_hash_entry *) bfd_hash_allocate (table,
1180 sizeof (*ret));
384a9dda
AM
1181 if (entry == NULL)
1182 return entry;
1183 }
1184
1185 entry = bfd_hash_newfunc (entry, table, string);
1186 if (entry == NULL)
1187 return entry;
1188
409d7240
AM
1189 ret = (struct out_section_hash_entry *) entry;
1190 memset (&ret->s, 0, sizeof (ret->s));
1191 ret->s.header.type = lang_output_section_statement_enum;
1192 ret->s.output_section_statement.subsection_alignment = -1;
1193 ret->s.output_section_statement.section_alignment = -1;
1194 ret->s.output_section_statement.block_value = 1;
1195 lang_list_init (&ret->s.output_section_statement.children);
1196 lang_statement_append (stat_ptr, &ret->s, &ret->s.header.next);
384a9dda 1197
218868ba
AM
1198 /* For every output section statement added to the list, except the
1199 first one, lang_output_section_statement.tail points to the "next"
1200 field of the last element of the list. */
1201 if (lang_output_section_statement.head != NULL)
409d7240
AM
1202 ret->s.output_section_statement.prev
1203 = ((lang_output_section_statement_type *)
1204 ((char *) lang_output_section_statement.tail
1205 - offsetof (lang_output_section_statement_type, next)));
218868ba 1206
384a9dda
AM
1207 /* GCC's strict aliasing rules prevent us from just casting the
1208 address, so we store the pointer in a variable and cast that
1209 instead. */
409d7240 1210 nextp = &ret->s.output_section_statement.next;
384a9dda 1211 lang_statement_append (&lang_output_section_statement,
409d7240 1212 &ret->s,
384a9dda
AM
1213 (lang_statement_union_type **) nextp);
1214 return &ret->root;
750877ba
L
1215}
1216
1217static void
409d7240 1218output_section_statement_table_init (void)
750877ba 1219{
409d7240
AM
1220 if (!bfd_hash_table_init_n (&output_section_statement_table,
1221 output_section_statement_newfunc,
1222 sizeof (struct out_section_hash_entry),
66eb6687 1223 61))
384a9dda 1224 einfo (_("%P%F: can not create hash table: %E\n"));
750877ba
L
1225}
1226
1227static void
409d7240 1228output_section_statement_table_free (void)
750877ba 1229{
409d7240 1230 bfd_hash_table_free (&output_section_statement_table);
750877ba
L
1231}
1232
08da4cac
KH
1233/* Build enough state so that the parser can build its tree. */
1234
252b5132 1235void
1579bae1 1236lang_init (void)
252b5132
RH
1237{
1238 obstack_begin (&stat_obstack, 1000);
1239
1240 stat_ptr = &statement_list;
1241
409d7240 1242 output_section_statement_table_init ();
750877ba 1243
252b5132
RH
1244 lang_list_init (stat_ptr);
1245
1246 lang_list_init (&input_file_chain);
1247 lang_list_init (&lang_output_section_statement);
1248 lang_list_init (&file_chain);
1579bae1
AM
1249 first_file = lang_add_input_file (NULL, lang_input_file_is_marker_enum,
1250 NULL);
08da4cac 1251 abs_output_section =
66c103b7 1252 lang_output_section_statement_lookup (BFD_ABS_SECTION_NAME, 0, TRUE);
252b5132
RH
1253
1254 abs_output_section->bfd_section = bfd_abs_section_ptr;
420e579c
HPN
1255
1256 /* The value "3" is ad-hoc, somewhat related to the expected number of
1257 DEFINED expressions in a linker script. For most default linker
1258 scripts, there are none. Why a hash table then? Well, it's somewhat
1259 simpler to re-use working machinery than using a linked list in terms
1260 of code-complexity here in ld, besides the initialization which just
1261 looks like other code here. */
688c58f3 1262 if (!bfd_hash_table_init_n (&lang_definedness_table,
66eb6687
AM
1263 lang_definedness_newfunc,
1264 sizeof (struct lang_definedness_hash_entry),
1265 3))
384a9dda 1266 einfo (_("%P%F: can not create hash table: %E\n"));
252b5132
RH
1267}
1268
750877ba
L
1269void
1270lang_finish (void)
1271{
409d7240 1272 output_section_statement_table_free ();
750877ba
L
1273}
1274
252b5132 1275/*----------------------------------------------------------------------
08da4cac
KH
1276 A region is an area of memory declared with the
1277 MEMORY { name:org=exp, len=exp ... }
1278 syntax.
252b5132 1279
08da4cac 1280 We maintain a list of all the regions here.
252b5132 1281
08da4cac 1282 If no regions are specified in the script, then the default is used
a747ee4d
NC
1283 which is created when looked up to be the entire data space.
1284
1285 If create is true we are creating a region inside a MEMORY block.
1286 In this case it is probably an error to create a region that has
1287 already been created. If we are not inside a MEMORY block it is
1288 dubious to use an undeclared region name (except DEFAULT_MEMORY_REGION)
4a93e180 1289 and so we issue a warning.
1e0061d2 1290
4a93e180
NC
1291 Each region has at least one name. The first name is either
1292 DEFAULT_MEMORY_REGION or the name given in the MEMORY block. You can add
1293 alias names to an existing region within a script with
1294 REGION_ALIAS (alias, region_name). Each name corresponds to at most one
1295 region. */
252b5132
RH
1296
1297static lang_memory_region_type *lang_memory_region_list;
6feb9908
AM
1298static lang_memory_region_type **lang_memory_region_list_tail
1299 = &lang_memory_region_list;
252b5132
RH
1300
1301lang_memory_region_type *
a747ee4d 1302lang_memory_region_lookup (const char *const name, bfd_boolean create)
252b5132 1303{
4a93e180
NC
1304 lang_memory_region_name *n;
1305 lang_memory_region_type *r;
d3ce72d0 1306 lang_memory_region_type *new_region;
252b5132 1307
9f88b410
RS
1308 /* NAME is NULL for LMA memspecs if no region was specified. */
1309 if (name == NULL)
1310 return NULL;
1311
4a93e180
NC
1312 for (r = lang_memory_region_list; r != NULL; r = r->next)
1313 for (n = &r->name_list; n != NULL; n = n->next)
1314 if (strcmp (n->name, name) == 0)
1315 {
1316 if (create)
1317 einfo (_("%P:%S: warning: redeclaration of memory region `%s'\n"),
1318 name);
1319 return r;
1320 }
252b5132 1321
a747ee4d 1322 if (!create && strcmp (name, DEFAULT_MEMORY_REGION))
4a93e180 1323 einfo (_("%P:%S: warning: memory region `%s' not declared\n"), name);
a747ee4d 1324
d3ce72d0
NC
1325 new_region = (lang_memory_region_type *)
1326 stat_alloc (sizeof (lang_memory_region_type));
252b5132 1327
d3ce72d0
NC
1328 new_region->name_list.name = xstrdup (name);
1329 new_region->name_list.next = NULL;
1330 new_region->next = NULL;
1331 new_region->origin = 0;
1332 new_region->length = ~(bfd_size_type) 0;
1333 new_region->current = 0;
1334 new_region->last_os = NULL;
1335 new_region->flags = 0;
1336 new_region->not_flags = 0;
1337 new_region->had_full_message = FALSE;
252b5132 1338
d3ce72d0
NC
1339 *lang_memory_region_list_tail = new_region;
1340 lang_memory_region_list_tail = &new_region->next;
66e28d60 1341
d3ce72d0 1342 return new_region;
252b5132
RH
1343}
1344
4a93e180
NC
1345void
1346lang_memory_region_alias (const char * alias, const char * region_name)
1347{
1348 lang_memory_region_name * n;
1349 lang_memory_region_type * r;
1350 lang_memory_region_type * region;
1351
1352 /* The default region must be unique. This ensures that it is not necessary
1353 to iterate through the name list if someone wants the check if a region is
1354 the default memory region. */
1355 if (strcmp (region_name, DEFAULT_MEMORY_REGION) == 0
1356 || strcmp (alias, DEFAULT_MEMORY_REGION) == 0)
1357 einfo (_("%F%P:%S: error: alias for default memory region\n"));
1358
1359 /* Look for the target region and check if the alias is not already
1360 in use. */
1361 region = NULL;
1362 for (r = lang_memory_region_list; r != NULL; r = r->next)
1363 for (n = &r->name_list; n != NULL; n = n->next)
1364 {
1365 if (region == NULL && strcmp (n->name, region_name) == 0)
1366 region = r;
1367 if (strcmp (n->name, alias) == 0)
1368 einfo (_("%F%P:%S: error: redefinition of memory region "
1369 "alias `%s'\n"),
1370 alias);
1371 }
1372
1373 /* Check if the target region exists. */
1374 if (region == NULL)
1375 einfo (_("%F%P:%S: error: memory region `%s' "
1376 "for alias `%s' does not exist\n"),
1377 region_name,
1378 alias);
1379
1380 /* Add alias to region name list. */
1e9cc1c2 1381 n = (lang_memory_region_name *) stat_alloc (sizeof (lang_memory_region_name));
4a93e180
NC
1382 n->name = xstrdup (alias);
1383 n->next = region->name_list.next;
1384 region->name_list.next = n;
1385}
1386
5f992e62 1387static lang_memory_region_type *
4a93e180 1388lang_memory_default (asection * section)
252b5132
RH
1389{
1390 lang_memory_region_type *p;
1391
1392 flagword sec_flags = section->flags;
1393
1394 /* Override SEC_DATA to mean a writable section. */
1395 if ((sec_flags & (SEC_ALLOC | SEC_READONLY | SEC_CODE)) == SEC_ALLOC)
1396 sec_flags |= SEC_DATA;
1397
1579bae1 1398 for (p = lang_memory_region_list; p != NULL; p = p->next)
252b5132
RH
1399 {
1400 if ((p->flags & sec_flags) != 0
1401 && (p->not_flags & sec_flags) == 0)
1402 {
1403 return p;
1404 }
1405 }
a747ee4d 1406 return lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
252b5132
RH
1407}
1408
d127ecce
AM
1409/* Find or create an output_section_statement with the given NAME.
1410 If CONSTRAINT is non-zero match one with that constraint, otherwise
1411 match any non-negative constraint. If CREATE, always make a
1412 new output_section_statement for SPECIAL CONSTRAINT. */
1413
384a9dda 1414lang_output_section_statement_type *
d127ecce 1415lang_output_section_statement_lookup (const char *name,
66c103b7
AM
1416 int constraint,
1417 bfd_boolean create)
252b5132 1418{
409d7240 1419 struct out_section_hash_entry *entry;
252b5132 1420
409d7240
AM
1421 entry = ((struct out_section_hash_entry *)
1422 bfd_hash_lookup (&output_section_statement_table, name,
66c103b7 1423 create, FALSE));
384a9dda
AM
1424 if (entry == NULL)
1425 {
66c103b7
AM
1426 if (create)
1427 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
384a9dda
AM
1428 return NULL;
1429 }
252b5132 1430
409d7240 1431 if (entry->s.output_section_statement.name != NULL)
252b5132 1432 {
384a9dda
AM
1433 /* We have a section of this name, but it might not have the correct
1434 constraint. */
66c103b7 1435 struct out_section_hash_entry *last_ent;
66c103b7 1436
d127ecce 1437 name = entry->s.output_section_statement.name;
8a99a385
AM
1438 if (create && constraint == SPECIAL)
1439 /* Not traversing to the end reverses the order of the second
1440 and subsequent SPECIAL sections in the hash table chain,
1441 but that shouldn't matter. */
1442 last_ent = entry;
1443 else
1444 do
1445 {
d127ecce
AM
1446 if (constraint == entry->s.output_section_statement.constraint
1447 || (constraint == 0
1448 && entry->s.output_section_statement.constraint >= 0))
8a99a385
AM
1449 return &entry->s.output_section_statement;
1450 last_ent = entry;
1451 entry = (struct out_section_hash_entry *) entry->root.next;
1452 }
1453 while (entry != NULL
d127ecce 1454 && name == entry->s.output_section_statement.name);
252b5132 1455
66c103b7
AM
1456 if (!create)
1457 return NULL;
1458
409d7240
AM
1459 entry
1460 = ((struct out_section_hash_entry *)
1461 output_section_statement_newfunc (NULL,
1462 &output_section_statement_table,
1463 name));
750877ba 1464 if (entry == NULL)
384a9dda
AM
1465 {
1466 einfo (_("%P%F: failed creating section `%s': %E\n"), name);
1467 return NULL;
1468 }
1469 entry->root = last_ent->root;
1470 last_ent->root.next = &entry->root;
252b5132 1471 }
384a9dda 1472
409d7240
AM
1473 entry->s.output_section_statement.name = name;
1474 entry->s.output_section_statement.constraint = constraint;
1475 return &entry->s.output_section_statement;
252b5132
RH
1476}
1477
d127ecce
AM
1478/* Find the next output_section_statement with the same name as OS.
1479 If CONSTRAINT is non-zero, find one with that constraint otherwise
1480 match any non-negative constraint. */
1481
1482lang_output_section_statement_type *
1483next_matching_output_section_statement (lang_output_section_statement_type *os,
1484 int constraint)
1485{
1486 /* All output_section_statements are actually part of a
1487 struct out_section_hash_entry. */
1488 struct out_section_hash_entry *entry = (struct out_section_hash_entry *)
1489 ((char *) os
1490 - offsetof (struct out_section_hash_entry, s.output_section_statement));
1491 const char *name = os->name;
1492
1493 ASSERT (name == entry->root.string);
1494 do
1495 {
1496 entry = (struct out_section_hash_entry *) entry->root.next;
1497 if (entry == NULL
1498 || name != entry->s.output_section_statement.name)
1499 return NULL;
1500 }
1501 while (constraint != entry->s.output_section_statement.constraint
1502 && (constraint != 0
1503 || entry->s.output_section_statement.constraint < 0));
1504
1505 return &entry->s.output_section_statement;
1506}
1507
afd7a018
AM
1508/* A variant of lang_output_section_find used by place_orphan.
1509 Returns the output statement that should precede a new output
1510 statement for SEC. If an exact match is found on certain flags,
1511 sets *EXACT too. */
1512
1513lang_output_section_statement_type *
1514lang_output_section_find_by_flags (const asection *sec,
390fbbf1
AM
1515 lang_output_section_statement_type **exact,
1516 lang_match_sec_type_func match_type)
afd7a018
AM
1517{
1518 lang_output_section_statement_type *first, *look, *found;
1519 flagword flags;
1520
1521 /* We know the first statement on this list is *ABS*. May as well
1522 skip it. */
1523 first = &lang_output_section_statement.head->output_section_statement;
1524 first = first->next;
1525
1526 /* First try for an exact match. */
1527 found = NULL;
1528 for (look = first; look; look = look->next)
1529 {
1530 flags = look->flags;
1531 if (look->bfd_section != NULL)
ecca9871
L
1532 {
1533 flags = look->bfd_section->flags;
f13a99db
AM
1534 if (match_type && !match_type (link_info.output_bfd,
1535 look->bfd_section,
390fbbf1 1536 sec->owner, sec))
ecca9871
L
1537 continue;
1538 }
afd7a018
AM
1539 flags ^= sec->flags;
1540 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD | SEC_READONLY
1541 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1542 found = look;
1543 }
1544 if (found != NULL)
1545 {
390fbbf1
AM
1546 if (exact != NULL)
1547 *exact = found;
afd7a018
AM
1548 return found;
1549 }
1550
07890c07
AM
1551 if ((sec->flags & SEC_CODE) != 0
1552 && (sec->flags & SEC_ALLOC) != 0)
afd7a018
AM
1553 {
1554 /* Try for a rw code section. */
1555 for (look = first; look; look = look->next)
1556 {
1557 flags = look->flags;
1558 if (look->bfd_section != NULL)
ecca9871
L
1559 {
1560 flags = look->bfd_section->flags;
f13a99db
AM
1561 if (match_type && !match_type (link_info.output_bfd,
1562 look->bfd_section,
390fbbf1 1563 sec->owner, sec))
ecca9871
L
1564 continue;
1565 }
afd7a018
AM
1566 flags ^= sec->flags;
1567 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1568 | SEC_CODE | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1569 found = look;
1570 }
afd7a018 1571 }
07890c07
AM
1572 else if ((sec->flags & (SEC_READONLY | SEC_THREAD_LOCAL)) != 0
1573 && (sec->flags & SEC_ALLOC) != 0)
afd7a018
AM
1574 {
1575 /* .rodata can go after .text, .sdata2 after .rodata. */
1576 for (look = first; look; look = look->next)
1577 {
1578 flags = look->flags;
1579 if (look->bfd_section != NULL)
ecca9871
L
1580 {
1581 flags = look->bfd_section->flags;
f13a99db
AM
1582 if (match_type && !match_type (link_info.output_bfd,
1583 look->bfd_section,
390fbbf1 1584 sec->owner, sec))
ecca9871
L
1585 continue;
1586 }
afd7a018
AM
1587 flags ^= sec->flags;
1588 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1589 | SEC_READONLY))
1590 && !(look->flags & (SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1591 found = look;
1592 }
afd7a018 1593 }
07890c07
AM
1594 else if ((sec->flags & SEC_SMALL_DATA) != 0
1595 && (sec->flags & SEC_ALLOC) != 0)
afd7a018
AM
1596 {
1597 /* .sdata goes after .data, .sbss after .sdata. */
1598 for (look = first; look; look = look->next)
1599 {
1600 flags = look->flags;
1601 if (look->bfd_section != NULL)
ecca9871
L
1602 {
1603 flags = look->bfd_section->flags;
f13a99db
AM
1604 if (match_type && !match_type (link_info.output_bfd,
1605 look->bfd_section,
390fbbf1 1606 sec->owner, sec))
ecca9871
L
1607 continue;
1608 }
afd7a018
AM
1609 flags ^= sec->flags;
1610 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1611 | SEC_THREAD_LOCAL))
1612 || ((look->flags & SEC_SMALL_DATA)
1613 && !(sec->flags & SEC_HAS_CONTENTS)))
1614 found = look;
1615 }
afd7a018 1616 }
07890c07
AM
1617 else if ((sec->flags & SEC_HAS_CONTENTS) != 0
1618 && (sec->flags & SEC_ALLOC) != 0)
afd7a018
AM
1619 {
1620 /* .data goes after .rodata. */
1621 for (look = first; look; look = look->next)
1622 {
1623 flags = look->flags;
1624 if (look->bfd_section != NULL)
ecca9871
L
1625 {
1626 flags = look->bfd_section->flags;
f13a99db
AM
1627 if (match_type && !match_type (link_info.output_bfd,
1628 look->bfd_section,
390fbbf1 1629 sec->owner, sec))
ecca9871
L
1630 continue;
1631 }
afd7a018
AM
1632 flags ^= sec->flags;
1633 if (!(flags & (SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD
1634 | SEC_SMALL_DATA | SEC_THREAD_LOCAL)))
1635 found = look;
1636 }
afd7a018 1637 }
07890c07 1638 else if ((sec->flags & SEC_ALLOC) != 0)
afd7a018 1639 {
07890c07 1640 /* .bss goes after any other alloc section. */
390fbbf1 1641 for (look = first; look; look = look->next)
ecca9871 1642 {
390fbbf1
AM
1643 flags = look->flags;
1644 if (look->bfd_section != NULL)
1645 {
1646 flags = look->bfd_section->flags;
f13a99db
AM
1647 if (match_type && !match_type (link_info.output_bfd,
1648 look->bfd_section,
390fbbf1
AM
1649 sec->owner, sec))
1650 continue;
1651 }
1652 flags ^= sec->flags;
1653 if (!(flags & SEC_ALLOC))
1654 found = look;
ecca9871 1655 }
afd7a018 1656 }
07890c07
AM
1657 else
1658 {
1659 /* non-alloc go last. */
1660 for (look = first; look; look = look->next)
1661 {
1662 flags = look->flags;
1663 if (look->bfd_section != NULL)
1664 flags = look->bfd_section->flags;
1665 flags ^= sec->flags;
1666 if (!(flags & SEC_DEBUGGING))
1667 found = look;
1668 }
1669 return found;
1670 }
afd7a018 1671
390fbbf1
AM
1672 if (found || !match_type)
1673 return found;
1674
1675 return lang_output_section_find_by_flags (sec, NULL, NULL);
afd7a018
AM
1676}
1677
1678/* Find the last output section before given output statement.
1679 Used by place_orphan. */
1680
1681static asection *
1682output_prev_sec_find (lang_output_section_statement_type *os)
1683{
afd7a018
AM
1684 lang_output_section_statement_type *lookup;
1685
218868ba 1686 for (lookup = os->prev; lookup != NULL; lookup = lookup->prev)
afd7a018 1687 {
66c103b7 1688 if (lookup->constraint < 0)
afd7a018 1689 continue;
afd7a018
AM
1690
1691 if (lookup->bfd_section != NULL && lookup->bfd_section->owner != NULL)
218868ba 1692 return lookup->bfd_section;
afd7a018
AM
1693 }
1694
1695 return NULL;
1696}
1697
53d25da6
AM
1698/* Look for a suitable place for a new output section statement. The
1699 idea is to skip over anything that might be inside a SECTIONS {}
1700 statement in a script, before we find another output section
1701 statement. Assignments to "dot" before an output section statement
0fa4d7cf
AM
1702 are assumed to belong to it, except in two cases; The first
1703 assignment to dot, and assignments before non-alloc sections.
1704 Otherwise we might put an orphan before . = . + SIZEOF_HEADERS or
1705 similar assignments that set the initial address, or we might
1706 insert non-alloc note sections among assignments setting end of
1707 image symbols. */
53d25da6
AM
1708
1709static lang_statement_union_type **
1710insert_os_after (lang_output_section_statement_type *after)
1711{
1712 lang_statement_union_type **where;
1713 lang_statement_union_type **assign = NULL;
1714 bfd_boolean ignore_first;
1715
1716 ignore_first
1717 = after == &lang_output_section_statement.head->output_section_statement;
1718
1719 for (where = &after->header.next;
1720 *where != NULL;
1721 where = &(*where)->header.next)
1722 {
1723 switch ((*where)->header.type)
1724 {
1725 case lang_assignment_statement_enum:
1726 if (assign == NULL)
1727 {
1728 lang_assignment_statement_type *ass;
1729
1730 ass = &(*where)->assignment_statement;
1731 if (ass->exp->type.node_class != etree_assert
1732 && ass->exp->assign.dst[0] == '.'
1733 && ass->exp->assign.dst[1] == 0
1734 && !ignore_first)
1735 assign = where;
1736 }
1737 ignore_first = FALSE;
1738 continue;
1739 case lang_wild_statement_enum:
1740 case lang_input_section_enum:
1741 case lang_object_symbols_statement_enum:
1742 case lang_fill_statement_enum:
1743 case lang_data_statement_enum:
1744 case lang_reloc_statement_enum:
1745 case lang_padding_statement_enum:
1746 case lang_constructors_statement_enum:
1747 assign = NULL;
1748 continue;
1749 case lang_output_section_statement_enum:
1750 if (assign != NULL)
0fa4d7cf
AM
1751 {
1752 asection *s = (*where)->output_section_statement.bfd_section;
1753
249b2a84
L
1754 if (s == NULL
1755 || s->map_head.s == NULL
1756 || (s->flags & SEC_ALLOC) != 0)
0fa4d7cf
AM
1757 where = assign;
1758 }
53d25da6
AM
1759 break;
1760 case lang_input_statement_enum:
1761 case lang_address_statement_enum:
1762 case lang_target_statement_enum:
1763 case lang_output_statement_enum:
1764 case lang_group_statement_enum:
1765 case lang_insert_statement_enum:
1766 continue;
1767 }
1768 break;
1769 }
1770
1771 return where;
1772}
1773
afd7a018 1774lang_output_section_statement_type *
7b986e99 1775lang_insert_orphan (asection *s,
afd7a018 1776 const char *secname,
8a99a385 1777 int constraint,
afd7a018
AM
1778 lang_output_section_statement_type *after,
1779 struct orphan_save *place,
1780 etree_type *address,
1781 lang_statement_list_type *add_child)
1782{
afd7a018
AM
1783 lang_statement_list_type add;
1784 const char *ps;
afd7a018
AM
1785 lang_output_section_statement_type *os;
1786 lang_output_section_statement_type **os_tail;
1787
afd7a018
AM
1788 /* If we have found an appropriate place for the output section
1789 statements for this orphan, add them to our own private list,
1790 inserting them later into the global statement list. */
1791 if (after != NULL)
1792 {
bde18da4
AM
1793 lang_list_init (&add);
1794 push_stat_ptr (&add);
afd7a018
AM
1795 }
1796
011aa75f
AM
1797 if (link_info.relocatable || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0)
1798 address = exp_intop (0);
1799
1800 os_tail = ((lang_output_section_statement_type **)
1801 lang_output_section_statement.tail);
1e9cc1c2
NC
1802 os = lang_enter_output_section_statement (secname, address, normal_section,
1803 NULL, NULL, NULL, constraint);
011aa75f 1804
afd7a018 1805 ps = NULL;
011aa75f 1806 if (config.build_constructors && *os_tail == os)
afd7a018
AM
1807 {
1808 /* If the name of the section is representable in C, then create
1809 symbols to mark the start and the end of the section. */
1810 for (ps = secname; *ps != '\0'; ps++)
1811 if (! ISALNUM ((unsigned char) *ps) && *ps != '_')
1812 break;
1813 if (*ps == '\0')
1814 {
1815 char *symname;
1816 etree_type *e_align;
1817
1818 symname = (char *) xmalloc (ps - secname + sizeof "__start_" + 1);
f13a99db 1819 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
afd7a018
AM
1820 sprintf (symname + (symname[0] != 0), "__start_%s", secname);
1821 e_align = exp_unop (ALIGN_K,
1822 exp_intop ((bfd_vma) 1 << s->alignment_power));
2e57b2af 1823 lang_add_assignment (exp_assign (".", e_align));
34711ca3 1824 lang_add_assignment (exp_provide (symname,
011aa75f
AM
1825 exp_unop (ABSOLUTE,
1826 exp_nameop (NAME, ".")),
34711ca3 1827 FALSE));
afd7a018
AM
1828 }
1829 }
1830
afd7a018
AM
1831 if (add_child == NULL)
1832 add_child = &os->children;
7b986e99 1833 lang_add_section (add_child, s, os);
afd7a018 1834
f77c3948
DJ
1835 if (after && (s->flags & (SEC_LOAD | SEC_ALLOC)) != 0)
1836 {
1837 const char *region = (after->region
1838 ? after->region->name_list.name
1839 : DEFAULT_MEMORY_REGION);
1840 const char *lma_region = (after->lma_region
1841 ? after->lma_region->name_list.name
1842 : NULL);
1843 lang_leave_output_section_statement (NULL, region, after->phdrs,
1844 lma_region);
1845 }
1846 else
1847 lang_leave_output_section_statement (NULL, DEFAULT_MEMORY_REGION, NULL,
1848 NULL);
afd7a018 1849
011aa75f 1850 if (ps != NULL && *ps == '\0')
afd7a018
AM
1851 {
1852 char *symname;
1853
afd7a018 1854 symname = (char *) xmalloc (ps - secname + sizeof "__stop_" + 1);
f13a99db 1855 symname[0] = bfd_get_symbol_leading_char (link_info.output_bfd);
afd7a018 1856 sprintf (symname + (symname[0] != 0), "__stop_%s", secname);
34711ca3
AM
1857 lang_add_assignment (exp_provide (symname,
1858 exp_nameop (NAME, "."),
1859 FALSE));
afd7a018
AM
1860 }
1861
1862 /* Restore the global list pointer. */
1863 if (after != NULL)
bde18da4 1864 pop_stat_ptr ();
afd7a018
AM
1865
1866 if (after != NULL && os->bfd_section != NULL)
1867 {
5daa8fe7 1868 asection *snew, *as;
afd7a018
AM
1869
1870 snew = os->bfd_section;
1871
1872 /* Shuffle the bfd section list to make the output file look
1873 neater. This is really only cosmetic. */
1874 if (place->section == NULL
1875 && after != (&lang_output_section_statement.head
1876 ->output_section_statement))
1877 {
1878 asection *bfd_section = after->bfd_section;
1879
1880 /* If the output statement hasn't been used to place any input
1881 sections (and thus doesn't have an output bfd_section),
1882 look for the closest prior output statement having an
1883 output section. */
1884 if (bfd_section == NULL)
1885 bfd_section = output_prev_sec_find (after);
1886
1887 if (bfd_section != NULL && bfd_section != snew)
1888 place->section = &bfd_section->next;
1889 }
1890
1891 if (place->section == NULL)
f13a99db 1892 place->section = &link_info.output_bfd->sections;
afd7a018 1893
5daa8fe7 1894 as = *place->section;
5e542ba7
MS
1895
1896 if (!as)
329c1c86
AM
1897 {
1898 /* Put the section at the end of the list. */
5e542ba7
MS
1899
1900 /* Unlink the section. */
f13a99db 1901 bfd_section_list_remove (link_info.output_bfd, snew);
5e542ba7
MS
1902
1903 /* Now tack it back on in the right place. */
f13a99db 1904 bfd_section_list_append (link_info.output_bfd, snew);
329c1c86 1905 }
5e542ba7 1906 else if (as != snew && as->prev != snew)
5daa8fe7
L
1907 {
1908 /* Unlink the section. */
f13a99db 1909 bfd_section_list_remove (link_info.output_bfd, snew);
afd7a018 1910
5daa8fe7 1911 /* Now tack it back on in the right place. */
f13a99db 1912 bfd_section_list_insert_before (link_info.output_bfd, as, snew);
5daa8fe7 1913 }
afd7a018
AM
1914
1915 /* Save the end of this list. Further ophans of this type will
1916 follow the one we've just added. */
1917 place->section = &snew->next;
1918
1919 /* The following is non-cosmetic. We try to put the output
1920 statements in some sort of reasonable order here, because they
1921 determine the final load addresses of the orphan sections.
1922 In addition, placing output statements in the wrong order may
1923 require extra segments. For instance, given a typical
1924 situation of all read-only sections placed in one segment and
1925 following that a segment containing all the read-write
1926 sections, we wouldn't want to place an orphan read/write
1927 section before or amongst the read-only ones. */
1928 if (add.head != NULL)
1929 {
1930 lang_output_section_statement_type *newly_added_os;
1931
1932 if (place->stmt == NULL)
1933 {
53d25da6 1934 lang_statement_union_type **where = insert_os_after (after);
afd7a018
AM
1935
1936 *add.tail = *where;
1937 *where = add.head;
1938
1939 place->os_tail = &after->next;
1940 }
1941 else
1942 {
1943 /* Put it after the last orphan statement we added. */
1944 *add.tail = *place->stmt;
1945 *place->stmt = add.head;
1946 }
1947
1948 /* Fix the global list pointer if we happened to tack our
1949 new list at the tail. */
bde18da4
AM
1950 if (*stat_ptr->tail == add.head)
1951 stat_ptr->tail = add.tail;
afd7a018
AM
1952
1953 /* Save the end of this list. */
1954 place->stmt = add.tail;
1955
1956 /* Do the same for the list of output section statements. */
1957 newly_added_os = *os_tail;
1958 *os_tail = NULL;
218868ba
AM
1959 newly_added_os->prev = (lang_output_section_statement_type *)
1960 ((char *) place->os_tail
1961 - offsetof (lang_output_section_statement_type, next));
afd7a018 1962 newly_added_os->next = *place->os_tail;
218868ba
AM
1963 if (newly_added_os->next != NULL)
1964 newly_added_os->next->prev = newly_added_os;
afd7a018
AM
1965 *place->os_tail = newly_added_os;
1966 place->os_tail = &newly_added_os->next;
1967
1968 /* Fixing the global list pointer here is a little different.
1969 We added to the list in lang_enter_output_section_statement,
1970 trimmed off the new output_section_statment above when
1971 assigning *os_tail = NULL, but possibly added it back in
1972 the same place when assigning *place->os_tail. */
1973 if (*os_tail == NULL)
1974 lang_output_section_statement.tail
1975 = (lang_statement_union_type **) os_tail;
1976 }
1977 }
1978 return os;
1979}
1980
252b5132 1981static void
1579bae1 1982lang_map_flags (flagword flag)
252b5132
RH
1983{
1984 if (flag & SEC_ALLOC)
1985 minfo ("a");
1986
1987 if (flag & SEC_CODE)
1988 minfo ("x");
1989
1990 if (flag & SEC_READONLY)
1991 minfo ("r");
1992
1993 if (flag & SEC_DATA)
1994 minfo ("w");
1995
1996 if (flag & SEC_LOAD)
1997 minfo ("l");
1998}
1999
2000void
1579bae1 2001lang_map (void)
252b5132
RH
2002{
2003 lang_memory_region_type *m;
4d4920ec 2004 bfd_boolean dis_header_printed = FALSE;
35835446 2005 bfd *p;
252b5132 2006
4d4920ec
EB
2007 LANG_FOR_EACH_INPUT_STATEMENT (file)
2008 {
2009 asection *s;
2010
2011 if ((file->the_bfd->flags & (BFD_LINKER_CREATED | DYNAMIC)) != 0
2012 || file->just_syms_flag)
2013 continue;
2014
2015 for (s = file->the_bfd->sections; s != NULL; s = s->next)
a14a5de3 2016 if ((s->output_section == NULL
f13a99db 2017 || s->output_section->owner != link_info.output_bfd)
a14a5de3 2018 && (s->flags & (SEC_LINKER_CREATED | SEC_KEEP)) == 0)
4d4920ec
EB
2019 {
2020 if (! dis_header_printed)
2021 {
2022 fprintf (config.map_file, _("\nDiscarded input sections\n\n"));
2023 dis_header_printed = TRUE;
2024 }
2025
d64703c6 2026 print_input_section (s, TRUE);
4d4920ec
EB
2027 }
2028 }
2029
252b5132
RH
2030 minfo (_("\nMemory Configuration\n\n"));
2031 fprintf (config.map_file, "%-16s %-18s %-18s %s\n",
2032 _("Name"), _("Origin"), _("Length"), _("Attributes"));
2033
1579bae1 2034 for (m = lang_memory_region_list; m != NULL; m = m->next)
252b5132
RH
2035 {
2036 char buf[100];
2037 int len;
2038
4a93e180 2039 fprintf (config.map_file, "%-16s ", m->name_list.name);
252b5132
RH
2040
2041 sprintf_vma (buf, m->origin);
2042 minfo ("0x%s ", buf);
2043 len = strlen (buf);
2044 while (len < 16)
2045 {
2046 print_space ();
2047 ++len;
2048 }
2049
2050 minfo ("0x%V", m->length);
2051 if (m->flags || m->not_flags)
2052 {
2053#ifndef BFD64
2054 minfo (" ");
2055#endif
2056 if (m->flags)
2057 {
2058 print_space ();
2059 lang_map_flags (m->flags);
2060 }
2061
2062 if (m->not_flags)
2063 {
2064 minfo (" !");
2065 lang_map_flags (m->not_flags);
2066 }
2067 }
2068
2069 print_nl ();
2070 }
2071
2072 fprintf (config.map_file, _("\nLinker script and memory map\n\n"));
2073
c0f00686 2074 if (! link_info.reduce_memory_overheads)
35835446
JR
2075 {
2076 obstack_begin (&map_obstack, 1000);
2077 for (p = link_info.input_bfds; p != (bfd *) NULL; p = p->link_next)
2078 bfd_map_over_sections (p, init_map_userdata, 0);
2079 bfd_link_hash_traverse (link_info.hash, sort_def_symbol, 0);
2080 }
a1438fce 2081 lang_statement_iteration ++;
252b5132
RH
2082 print_statements ();
2083}
2084
35835446 2085static void
967928e9
AM
2086init_map_userdata (bfd *abfd ATTRIBUTE_UNUSED,
2087 asection *sec,
2088 void *data ATTRIBUTE_UNUSED)
35835446
JR
2089{
2090 fat_section_userdata_type *new_data
2091 = ((fat_section_userdata_type *) (stat_alloc
2092 (sizeof (fat_section_userdata_type))));
2093
2094 ASSERT (get_userdata (sec) == NULL);
2095 get_userdata (sec) = new_data;
2096 new_data->map_symbol_def_tail = &new_data->map_symbol_def_head;
02688209 2097 new_data->map_symbol_def_count = 0;
35835446
JR
2098}
2099
2100static bfd_boolean
967928e9
AM
2101sort_def_symbol (struct bfd_link_hash_entry *hash_entry,
2102 void *info ATTRIBUTE_UNUSED)
35835446 2103{
a05e447f
AM
2104 if (hash_entry->type == bfd_link_hash_warning)
2105 hash_entry = (struct bfd_link_hash_entry *) hash_entry->u.i.link;
2106
35835446
JR
2107 if (hash_entry->type == bfd_link_hash_defined
2108 || hash_entry->type == bfd_link_hash_defweak)
2109 {
2110 struct fat_user_section_struct *ud;
2111 struct map_symbol_def *def;
2112
1e9cc1c2
NC
2113 ud = (struct fat_user_section_struct *)
2114 get_userdata (hash_entry->u.def.section);
35835446
JR
2115 if (! ud)
2116 {
2117 /* ??? What do we have to do to initialize this beforehand? */
2118 /* The first time we get here is bfd_abs_section... */
2119 init_map_userdata (0, hash_entry->u.def.section, 0);
1e9cc1c2
NC
2120 ud = (struct fat_user_section_struct *)
2121 get_userdata (hash_entry->u.def.section);
35835446
JR
2122 }
2123 else if (!ud->map_symbol_def_tail)
2124 ud->map_symbol_def_tail = &ud->map_symbol_def_head;
afd7a018 2125
1e9cc1c2 2126 def = (struct map_symbol_def *) obstack_alloc (&map_obstack, sizeof *def);
35835446 2127 def->entry = hash_entry;
76d7af2d 2128 *(ud->map_symbol_def_tail) = def;
35835446 2129 ud->map_symbol_def_tail = &def->next;
02688209 2130 ud->map_symbol_def_count++;
35835446
JR
2131 }
2132 return TRUE;
2133}
2134
252b5132
RH
2135/* Initialize an output section. */
2136
2137static void
dfa7b0b8 2138init_os (lang_output_section_statement_type *s, flagword flags)
252b5132 2139{
252b5132 2140 if (strcmp (s->name, DISCARD_SECTION_NAME) == 0)
6f9efd97 2141 einfo (_("%P%F: Illegal use of `%s' section\n"), DISCARD_SECTION_NAME);
252b5132 2142
8a99a385
AM
2143 if (s->constraint != SPECIAL)
2144 s->bfd_section = bfd_get_section_by_name (link_info.output_bfd, s->name);
1579bae1 2145 if (s->bfd_section == NULL)
8a99a385
AM
2146 s->bfd_section = bfd_make_section_anyway_with_flags (link_info.output_bfd,
2147 s->name, flags);
1579bae1 2148 if (s->bfd_section == NULL)
252b5132
RH
2149 {
2150 einfo (_("%P%F: output format %s cannot represent section called %s\n"),
f13a99db 2151 link_info.output_bfd->xvec->name, s->name);
252b5132
RH
2152 }
2153 s->bfd_section->output_section = s->bfd_section;
252b5132 2154 s->bfd_section->output_offset = 0;
e0f6802f 2155
c0f00686 2156 if (!link_info.reduce_memory_overheads)
72223188 2157 {
d3ce72d0
NC
2158 fat_section_userdata_type *new_userdata = (fat_section_userdata_type *)
2159 stat_alloc (sizeof (fat_section_userdata_type));
2160 memset (new_userdata, 0, sizeof (fat_section_userdata_type));
2161 get_userdata (s->bfd_section) = new_userdata;
72223188
JJ
2162 }
2163
a431bc2e
AM
2164 /* If there is a base address, make sure that any sections it might
2165 mention are initialized. */
2166 if (s->addr_tree != NULL)
2167 exp_init_os (s->addr_tree);
2168
2169 if (s->load_base != NULL)
2170 exp_init_os (s->load_base);
2171
7270c5ed
AM
2172 /* If supplied an alignment, set it. */
2173 if (s->section_alignment != -1)
2174 s->bfd_section->alignment_power = s->section_alignment;
252b5132
RH
2175}
2176
2177/* Make sure that all output sections mentioned in an expression are
2178 initialized. */
2179
2180static void
1579bae1 2181exp_init_os (etree_type *exp)
252b5132
RH
2182{
2183 switch (exp->type.node_class)
2184 {
2185 case etree_assign:
9f4fb502 2186 case etree_provide:
252b5132
RH
2187 exp_init_os (exp->assign.src);
2188 break;
2189
2190 case etree_binary:
2191 exp_init_os (exp->binary.lhs);
2192 exp_init_os (exp->binary.rhs);
2193 break;
2194
2195 case etree_trinary:
2196 exp_init_os (exp->trinary.cond);
2197 exp_init_os (exp->trinary.lhs);
2198 exp_init_os (exp->trinary.rhs);
2199 break;
2200
b6ca8815
NS
2201 case etree_assert:
2202 exp_init_os (exp->assert_s.child);
2203 break;
afd7a018 2204
252b5132
RH
2205 case etree_unary:
2206 exp_init_os (exp->unary.child);
2207 break;
2208
2209 case etree_name:
2210 switch (exp->type.node_code)
2211 {
2212 case ADDR:
2213 case LOADADDR:
2214 case SIZEOF:
2215 {
2216 lang_output_section_statement_type *os;
2217
2218 os = lang_output_section_find (exp->name.name);
2219 if (os != NULL && os->bfd_section == NULL)
dfa7b0b8 2220 init_os (os, 0);
252b5132
RH
2221 }
2222 }
2223 break;
2224
2225 default:
2226 break;
2227 }
2228}
9503fd87 2229\f
252b5132 2230static void
1579bae1 2231section_already_linked (bfd *abfd, asection *sec, void *data)
252b5132 2232{
1e9cc1c2 2233 lang_input_statement_type *entry = (lang_input_statement_type *) data;
252b5132
RH
2234
2235 /* If we are only reading symbols from this object, then we want to
2236 discard all sections. */
2237 if (entry->just_syms_flag)
2238 {
1449d79b 2239 bfd_link_just_syms (abfd, sec, &link_info);
252b5132
RH
2240 return;
2241 }
2242
ace66bb2 2243 if (!(abfd->flags & DYNAMIC))
c0f00686 2244 bfd_section_already_linked (abfd, sec, &link_info);
252b5132
RH
2245}
2246\f
2247/* The wild routines.
2248
2249 These expand statements like *(.text) and foo.o to a list of
2250 explicit actions, like foo.o(.text), bar.o(.text) and
2251 foo.o(.text, .data). */
2252
252b5132
RH
2253/* Add SECTION to the output section OUTPUT. Do this by creating a
2254 lang_input_section statement which is placed at PTR. FILE is the
2255 input file which holds SECTION. */
2256
2257void
1579bae1
AM
2258lang_add_section (lang_statement_list_type *ptr,
2259 asection *section,
7b986e99 2260 lang_output_section_statement_type *output)
252b5132 2261{
164e712d 2262 flagword flags = section->flags;
b34976b6 2263 bfd_boolean discard;
dfa7b0b8 2264 lang_input_section_type *new_section;
252b5132 2265
e49f5022 2266 /* Discard sections marked with SEC_EXCLUDE. */
b3096250 2267 discard = (flags & SEC_EXCLUDE) != 0;
252b5132
RH
2268
2269 /* Discard input sections which are assigned to a section named
2270 DISCARD_SECTION_NAME. */
2271 if (strcmp (output->name, DISCARD_SECTION_NAME) == 0)
b34976b6 2272 discard = TRUE;
252b5132
RH
2273
2274 /* Discard debugging sections if we are stripping debugging
2275 information. */
2276 if ((link_info.strip == strip_debugger || link_info.strip == strip_all)
2277 && (flags & SEC_DEBUGGING) != 0)
b34976b6 2278 discard = TRUE;
252b5132
RH
2279
2280 if (discard)
2281 {
2282 if (section->output_section == NULL)
2283 {
2284 /* This prevents future calls from assigning this section. */
2285 section->output_section = bfd_abs_section_ptr;
2286 }
2287 return;
2288 }
2289
dfa7b0b8
AM
2290 if (section->output_section != NULL)
2291 return;
252b5132 2292
dfa7b0b8
AM
2293 /* We don't copy the SEC_NEVER_LOAD flag from an input section
2294 to an output section, because we want to be able to include a
2295 SEC_NEVER_LOAD section in the middle of an otherwise loaded
2296 section (I don't know why we want to do this, but we do).
2297 build_link_order in ldwrite.c handles this case by turning
2298 the embedded SEC_NEVER_LOAD section into a fill. */
2299 flags &= ~ SEC_NEVER_LOAD;
8423293d 2300
dfa7b0b8
AM
2301 /* If final link, don't copy the SEC_LINK_ONCE flags, they've
2302 already been processed. One reason to do this is that on pe
2303 format targets, .text$foo sections go into .text and it's odd
2304 to see .text with SEC_LINK_ONCE set. */
252b5132 2305
dfa7b0b8 2306 if (!link_info.relocatable)
0814be7d 2307 flags &= ~(SEC_LINK_ONCE | SEC_LINK_DUPLICATES | SEC_RELOC);
252b5132 2308
dfa7b0b8
AM
2309 switch (output->sectype)
2310 {
2311 case normal_section:
2312 case overlay_section:
2313 break;
2314 case noalloc_section:
2315 flags &= ~SEC_ALLOC;
2316 break;
2317 case noload_section:
2318 flags &= ~SEC_LOAD;
2319 flags |= SEC_NEVER_LOAD;
f4eaaf7f
AM
2320 /* Unfortunately GNU ld has managed to evolve two different
2321 meanings to NOLOAD in scripts. ELF gets a .bss style noload,
2322 alloc, no contents section. All others get a noload, noalloc
2323 section. */
2324 if (bfd_get_flavour (link_info.output_bfd) == bfd_target_elf_flavour)
2e76e85a 2325 flags &= ~SEC_HAS_CONTENTS;
f4eaaf7f
AM
2326 else
2327 flags &= ~SEC_ALLOC;
dfa7b0b8
AM
2328 break;
2329 }
252b5132 2330
dfa7b0b8
AM
2331 if (output->bfd_section == NULL)
2332 init_os (output, flags);
252b5132 2333
dfa7b0b8
AM
2334 /* If SEC_READONLY is not set in the input section, then clear
2335 it from the output section. */
2336 output->bfd_section->flags &= flags | ~SEC_READONLY;
252b5132 2337
dfa7b0b8
AM
2338 if (output->bfd_section->linker_has_input)
2339 {
2340 /* Only set SEC_READONLY flag on the first input section. */
2341 flags &= ~ SEC_READONLY;
252b5132 2342
f5fa8ca2 2343 /* Keep SEC_MERGE and SEC_STRINGS only if they are the same. */
dfa7b0b8
AM
2344 if ((output->bfd_section->flags & (SEC_MERGE | SEC_STRINGS))
2345 != (flags & (SEC_MERGE | SEC_STRINGS))
2346 || ((flags & SEC_MERGE) != 0
2347 && output->bfd_section->entsize != section->entsize))
f5fa8ca2 2348 {
afd7a018 2349 output->bfd_section->flags &= ~ (SEC_MERGE | SEC_STRINGS);
f5fa8ca2
JJ
2350 flags &= ~ (SEC_MERGE | SEC_STRINGS);
2351 }
dfa7b0b8
AM
2352 }
2353 output->bfd_section->flags |= flags;
f5fa8ca2 2354
dfa7b0b8
AM
2355 if (!output->bfd_section->linker_has_input)
2356 {
2357 output->bfd_section->linker_has_input = 1;
2358 /* This must happen after flags have been updated. The output
2359 section may have been created before we saw its first input
2360 section, eg. for a data statement. */
2361 bfd_init_private_section_data (section->owner, section,
2362 link_info.output_bfd,
2363 output->bfd_section,
2364 &link_info);
2365 if ((flags & SEC_MERGE) != 0)
afd7a018 2366 output->bfd_section->entsize = section->entsize;
dfa7b0b8 2367 }
f5fa8ca2 2368
dfa7b0b8
AM
2369 if ((flags & SEC_TIC54X_BLOCK) != 0
2370 && bfd_get_arch (section->owner) == bfd_arch_tic54x)
2371 {
2372 /* FIXME: This value should really be obtained from the bfd... */
2373 output->block_value = 128;
2374 }
252b5132 2375
dfa7b0b8
AM
2376 if (section->alignment_power > output->bfd_section->alignment_power)
2377 output->bfd_section->alignment_power = section->alignment_power;
9e41f973 2378
dfa7b0b8 2379 section->output_section = output->bfd_section;
252b5132 2380
dfa7b0b8
AM
2381 if (!link_info.relocatable
2382 && !stripped_excluded_sections)
2383 {
2384 asection *s = output->bfd_section->map_tail.s;
2385 output->bfd_section->map_tail.s = section;
2386 section->map_head.s = NULL;
2387 section->map_tail.s = s;
2388 if (s != NULL)
2389 s->map_head.s = section;
2390 else
2391 output->bfd_section->map_head.s = section;
252b5132 2392 }
dfa7b0b8
AM
2393
2394 /* Add a section reference to the list. */
2395 new_section = new_stat (lang_input_section, ptr);
2396 new_section->section = section;
252b5132
RH
2397}
2398
2399/* Handle wildcard sorting. This returns the lang_input_section which
2400 should follow the one we are going to create for SECTION and FILE,
2401 based on the sorting requirements of WILD. It returns NULL if the
2402 new section should just go at the end of the current list. */
2403
2404static lang_statement_union_type *
1579bae1
AM
2405wild_sort (lang_wild_statement_type *wild,
2406 struct wildcard_list *sec,
2407 lang_input_statement_type *file,
2408 asection *section)
252b5132 2409{
252b5132
RH
2410 lang_statement_union_type *l;
2411
bcaa7b3e
L
2412 if (!wild->filenames_sorted
2413 && (sec == NULL || sec->spec.sorted == none))
252b5132
RH
2414 return NULL;
2415
bba1a0c0 2416 for (l = wild->children.head; l != NULL; l = l->header.next)
252b5132
RH
2417 {
2418 lang_input_section_type *ls;
2419
2420 if (l->header.type != lang_input_section_enum)
2421 continue;
2422 ls = &l->input_section;
2423
2424 /* Sorting by filename takes precedence over sorting by section
afd7a018 2425 name. */
252b5132
RH
2426
2427 if (wild->filenames_sorted)
2428 {
2429 const char *fn, *ln;
b34976b6 2430 bfd_boolean fa, la;
252b5132
RH
2431 int i;
2432
2433 /* The PE support for the .idata section as generated by
afd7a018
AM
2434 dlltool assumes that files will be sorted by the name of
2435 the archive and then the name of the file within the
2436 archive. */
252b5132
RH
2437
2438 if (file->the_bfd != NULL
2439 && bfd_my_archive (file->the_bfd) != NULL)
2440 {
2441 fn = bfd_get_filename (bfd_my_archive (file->the_bfd));
b34976b6 2442 fa = TRUE;
252b5132
RH
2443 }
2444 else
2445 {
2446 fn = file->filename;
b34976b6 2447 fa = FALSE;
252b5132
RH
2448 }
2449
7b986e99 2450 if (bfd_my_archive (ls->section->owner) != NULL)
252b5132 2451 {
7b986e99 2452 ln = bfd_get_filename (bfd_my_archive (ls->section->owner));
b34976b6 2453 la = TRUE;
252b5132
RH
2454 }
2455 else
2456 {
7b986e99 2457 ln = ls->section->owner->filename;
b34976b6 2458 la = FALSE;
252b5132
RH
2459 }
2460
42627821 2461 i = filename_cmp (fn, ln);
252b5132
RH
2462 if (i > 0)
2463 continue;
2464 else if (i < 0)
2465 break;
2466
2467 if (fa || la)
2468 {
2469 if (fa)
2470 fn = file->filename;
2471 if (la)
7b986e99 2472 ln = ls->section->owner->filename;
252b5132 2473
42627821 2474 i = filename_cmp (fn, ln);
252b5132
RH
2475 if (i > 0)
2476 continue;
2477 else if (i < 0)
2478 break;
2479 }
2480 }
2481
2482 /* Here either the files are not sorted by name, or we are
afd7a018 2483 looking at the sections for this file. */
252b5132 2484
bcaa7b3e 2485 if (sec != NULL && sec->spec.sorted != none)
32124d5b
AM
2486 if (compare_section (sec->spec.sorted, section, ls->section) < 0)
2487 break;
252b5132
RH
2488 }
2489
2490 return l;
2491}
2492
2493/* Expand a wild statement for a particular FILE. SECTION may be
2494 NULL, in which case it is a wild card. */
2495
2496static void
1579bae1
AM
2497output_section_callback (lang_wild_statement_type *ptr,
2498 struct wildcard_list *sec,
2499 asection *section,
2500 lang_input_statement_type *file,
2501 void *output)
4dec4d4e
RH
2502{
2503 lang_statement_union_type *before;
d0bf826b
AM
2504 lang_output_section_statement_type *os;
2505
2506 os = (lang_output_section_statement_type *) output;
5f992e62 2507
b6bf44ba 2508 /* Exclude sections that match UNIQUE_SECTION_LIST. */
d0bf826b 2509 if (unique_section_p (section, os))
b6bf44ba
AM
2510 return;
2511
b6bf44ba 2512 before = wild_sort (ptr, sec, file, section);
5f992e62 2513
4dec4d4e
RH
2514 /* Here BEFORE points to the lang_input_section which
2515 should follow the one we are about to add. If BEFORE
2516 is NULL, then the section should just go at the end
2517 of the current list. */
5f992e62 2518
4dec4d4e 2519 if (before == NULL)
d0bf826b 2520 lang_add_section (&ptr->children, section, os);
4dec4d4e 2521 else
252b5132 2522 {
4dec4d4e
RH
2523 lang_statement_list_type list;
2524 lang_statement_union_type **pp;
5f992e62 2525
4dec4d4e 2526 lang_list_init (&list);
d0bf826b 2527 lang_add_section (&list, section, os);
5f992e62 2528
4dec4d4e
RH
2529 /* If we are discarding the section, LIST.HEAD will
2530 be NULL. */
2531 if (list.head != NULL)
252b5132 2532 {
bba1a0c0 2533 ASSERT (list.head->header.next == NULL);
5f992e62 2534
4dec4d4e
RH
2535 for (pp = &ptr->children.head;
2536 *pp != before;
bba1a0c0 2537 pp = &(*pp)->header.next)
4dec4d4e 2538 ASSERT (*pp != NULL);
5f992e62 2539
bba1a0c0 2540 list.head->header.next = *pp;
4dec4d4e 2541 *pp = list.head;
252b5132
RH
2542 }
2543 }
2544}
2545
0841712e
JJ
2546/* Check if all sections in a wild statement for a particular FILE
2547 are readonly. */
2548
2549static void
2550check_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
2551 struct wildcard_list *sec ATTRIBUTE_UNUSED,
2552 asection *section,
2553 lang_input_statement_type *file ATTRIBUTE_UNUSED,
d0bf826b 2554 void *output)
0841712e 2555{
d0bf826b
AM
2556 lang_output_section_statement_type *os;
2557
2558 os = (lang_output_section_statement_type *) output;
2559
0841712e 2560 /* Exclude sections that match UNIQUE_SECTION_LIST. */
d0bf826b 2561 if (unique_section_p (section, os))
0841712e
JJ
2562 return;
2563
6feb9908 2564 if (section->output_section == NULL && (section->flags & SEC_READONLY) == 0)
d0bf826b 2565 os->all_input_readonly = FALSE;
0841712e
JJ
2566}
2567
252b5132
RH
2568/* This is passed a file name which must have been seen already and
2569 added to the statement tree. We will see if it has been opened
2570 already and had its symbols read. If not then we'll read it. */
2571
2572static lang_input_statement_type *
1579bae1 2573lookup_name (const char *name)
252b5132
RH
2574{
2575 lang_input_statement_type *search;
2576
2577 for (search = (lang_input_statement_type *) input_file_chain.head;
1579bae1 2578 search != NULL;
252b5132
RH
2579 search = (lang_input_statement_type *) search->next_real_file)
2580 {
0013291d
NC
2581 /* Use the local_sym_name as the name of the file that has
2582 already been loaded as filename might have been transformed
2583 via the search directory lookup mechanism. */
87aa7f19 2584 const char *filename = search->local_sym_name;
0013291d 2585
0013291d 2586 if (filename != NULL
42627821 2587 && filename_cmp (filename, name) == 0)
252b5132
RH
2588 break;
2589 }
2590
1579bae1 2591 if (search == NULL)
6feb9908
AM
2592 search = new_afile (name, lang_input_file_is_search_file_enum,
2593 default_target, FALSE);
252b5132
RH
2594
2595 /* If we have already added this file, or this file is not real
87aa7f19
AM
2596 don't add this file. */
2597 if (search->loaded || !search->real)
252b5132
RH
2598 return search;
2599
1579bae1 2600 if (! load_symbols (search, NULL))
6770ec8c 2601 return NULL;
252b5132
RH
2602
2603 return search;
2604}
2605
b58f81ae
DJ
2606/* Save LIST as a list of libraries whose symbols should not be exported. */
2607
2608struct excluded_lib
2609{
2610 char *name;
2611 struct excluded_lib *next;
2612};
2613static struct excluded_lib *excluded_libs;
2614
2615void
2616add_excluded_libs (const char *list)
2617{
2618 const char *p = list, *end;
2619
2620 while (*p != '\0')
2621 {
2622 struct excluded_lib *entry;
2623 end = strpbrk (p, ",:");
2624 if (end == NULL)
2625 end = p + strlen (p);
1e9cc1c2 2626 entry = (struct excluded_lib *) xmalloc (sizeof (*entry));
b58f81ae 2627 entry->next = excluded_libs;
1e9cc1c2 2628 entry->name = (char *) xmalloc (end - p + 1);
b58f81ae
DJ
2629 memcpy (entry->name, p, end - p);
2630 entry->name[end - p] = '\0';
2631 excluded_libs = entry;
2632 if (*end == '\0')
329c1c86 2633 break;
b58f81ae
DJ
2634 p = end + 1;
2635 }
2636}
2637
2638static void
2639check_excluded_libs (bfd *abfd)
2640{
2641 struct excluded_lib *lib = excluded_libs;
2642
2643 while (lib)
2644 {
2645 int len = strlen (lib->name);
2646 const char *filename = lbasename (abfd->filename);
2647
2648 if (strcmp (lib->name, "ALL") == 0)
2649 {
2650 abfd->no_export = TRUE;
2651 return;
2652 }
2653
42627821 2654 if (filename_ncmp (lib->name, filename, len) == 0
b58f81ae
DJ
2655 && (filename[len] == '\0'
2656 || (filename[len] == '.' && filename[len + 1] == 'a'
2657 && filename[len + 2] == '\0')))
2658 {
2659 abfd->no_export = TRUE;
2660 return;
2661 }
2662
2663 lib = lib->next;
2664 }
2665}
2666
252b5132
RH
2667/* Get the symbols for an input file. */
2668
e9f53129 2669bfd_boolean
1579bae1
AM
2670load_symbols (lang_input_statement_type *entry,
2671 lang_statement_list_type *place)
252b5132
RH
2672{
2673 char **matching;
2674
2675 if (entry->loaded)
b34976b6 2676 return TRUE;
252b5132
RH
2677
2678 ldfile_open_file (entry);
2679
c4b78195
NC
2680 /* Do not process further if the file was missing. */
2681 if (entry->missing_file)
2682 return TRUE;
2683
252b5132
RH
2684 if (! bfd_check_format (entry->the_bfd, bfd_archive)
2685 && ! bfd_check_format_matches (entry->the_bfd, bfd_object, &matching))
2686 {
2687 bfd_error_type err;
e3f2db7f 2688 bfd_boolean save_ldlang_sysrooted_script;
ddbb8a31
NC
2689 bfd_boolean save_add_DT_NEEDED_for_regular;
2690 bfd_boolean save_add_DT_NEEDED_for_dynamic;
2691 bfd_boolean save_whole_archive;
b7a26f91 2692
252b5132 2693 err = bfd_get_error ();
884fb58e
NC
2694
2695 /* See if the emulation has some special knowledge. */
2696 if (ldemul_unrecognized_file (entry))
b34976b6 2697 return TRUE;
884fb58e 2698
252b5132
RH
2699 if (err == bfd_error_file_ambiguously_recognized)
2700 {
2701 char **p;
2702
2703 einfo (_("%B: file not recognized: %E\n"), entry->the_bfd);
2704 einfo (_("%B: matching formats:"), entry->the_bfd);
2705 for (p = matching; *p != NULL; p++)
2706 einfo (" %s", *p);
2707 einfo ("%F\n");
2708 }
2709 else if (err != bfd_error_file_not_recognized
2710 || place == NULL)
967928e9 2711 einfo (_("%F%B: file not recognized: %E\n"), entry->the_bfd);
b7a26f91 2712
252b5132
RH
2713 bfd_close (entry->the_bfd);
2714 entry->the_bfd = NULL;
2715
252b5132 2716 /* Try to interpret the file as a linker script. */
252b5132
RH
2717 ldfile_open_command_file (entry->filename);
2718
bde18da4 2719 push_stat_ptr (place);
e3f2db7f
AO
2720 save_ldlang_sysrooted_script = ldlang_sysrooted_script;
2721 ldlang_sysrooted_script = entry->sysrooted;
ddbb8a31
NC
2722 save_add_DT_NEEDED_for_regular = add_DT_NEEDED_for_regular;
2723 add_DT_NEEDED_for_regular = entry->add_DT_NEEDED_for_regular;
2724 save_add_DT_NEEDED_for_dynamic = add_DT_NEEDED_for_dynamic;
2725 add_DT_NEEDED_for_dynamic = entry->add_DT_NEEDED_for_dynamic;
fc1ed737
AM
2726 save_whole_archive = whole_archive;
2727 whole_archive = entry->whole_archive;
252b5132 2728
b34976b6 2729 ldfile_assumed_script = TRUE;
252b5132 2730 parser_input = input_script;
532345f2
L
2731 /* We want to use the same -Bdynamic/-Bstatic as the one for
2732 ENTRY. */
2733 config.dynamic_link = entry->dynamic;
252b5132 2734 yyparse ();
b34976b6 2735 ldfile_assumed_script = FALSE;
252b5132 2736
e3f2db7f 2737 ldlang_sysrooted_script = save_ldlang_sysrooted_script;
ddbb8a31
NC
2738 add_DT_NEEDED_for_regular = save_add_DT_NEEDED_for_regular;
2739 add_DT_NEEDED_for_dynamic = save_add_DT_NEEDED_for_dynamic;
fc1ed737 2740 whole_archive = save_whole_archive;
bde18da4 2741 pop_stat_ptr ();
252b5132 2742
bde18da4 2743 return TRUE;
252b5132
RH
2744 }
2745
2746 if (ldemul_recognized_file (entry))
b34976b6 2747 return TRUE;
252b5132
RH
2748
2749 /* We don't call ldlang_add_file for an archive. Instead, the
2750 add_symbols entry point will call ldlang_add_file, via the
2751 add_archive_element callback, for each element of the archive
2752 which is used. */
2753 switch (bfd_get_format (entry->the_bfd))
2754 {
2755 default:
2756 break;
2757
2758 case bfd_object:
2759 ldlang_add_file (entry);
2760 if (trace_files || trace_file_tries)
2761 info_msg ("%I\n", entry);
2762 break;
2763
2764 case bfd_archive:
b58f81ae
DJ
2765 check_excluded_libs (entry->the_bfd);
2766
252b5132
RH
2767 if (entry->whole_archive)
2768 {
b7a26f91 2769 bfd *member = NULL;
b34976b6 2770 bfd_boolean loaded = TRUE;
6770ec8c
NC
2771
2772 for (;;)
252b5132 2773 {
5d3236ee 2774 bfd *subsbfd;
6770ec8c
NC
2775 member = bfd_openr_next_archived_file (entry->the_bfd, member);
2776
2777 if (member == NULL)
2778 break;
b7a26f91 2779
252b5132 2780 if (! bfd_check_format (member, bfd_object))
6770ec8c
NC
2781 {
2782 einfo (_("%F%B: member %B in archive is not an object\n"),
2783 entry->the_bfd, member);
b34976b6 2784 loaded = FALSE;
6770ec8c
NC
2785 }
2786
db0ca79f 2787 subsbfd = member;
46105645
AM
2788 if (!(*link_info.callbacks
2789 ->add_archive_element) (&link_info, member,
2790 "--whole-archive", &subsbfd))
252b5132 2791 abort ();
6770ec8c 2792
5d3236ee
DK
2793 /* Potentially, the add_archive_element hook may have set a
2794 substitute BFD for us. */
46105645 2795 if (!bfd_link_add_symbols (subsbfd, &link_info))
6770ec8c
NC
2796 {
2797 einfo (_("%F%B: could not read symbols: %E\n"), member);
b34976b6 2798 loaded = FALSE;
6770ec8c 2799 }
252b5132
RH
2800 }
2801
6770ec8c
NC
2802 entry->loaded = loaded;
2803 return loaded;
252b5132 2804 }
6770ec8c 2805 break;
252b5132
RH
2806 }
2807
03bdc404 2808 if (bfd_link_add_symbols (entry->the_bfd, &link_info))
b34976b6 2809 entry->loaded = TRUE;
6770ec8c 2810 else
252b5132
RH
2811 einfo (_("%F%B: could not read symbols: %E\n"), entry->the_bfd);
2812
6770ec8c 2813 return entry->loaded;
252b5132
RH
2814}
2815
b6bf44ba
AM
2816/* Handle a wild statement. S->FILENAME or S->SECTION_LIST or both
2817 may be NULL, indicating that it is a wildcard. Separate
2818 lang_input_section statements are created for each part of the
2819 expansion; they are added after the wild statement S. OUTPUT is
2820 the output section. */
252b5132
RH
2821
2822static void
1579bae1
AM
2823wild (lang_wild_statement_type *s,
2824 const char *target ATTRIBUTE_UNUSED,
2825 lang_output_section_statement_type *output)
252b5132 2826{
b6bf44ba 2827 struct wildcard_list *sec;
252b5132 2828
50c77e5d 2829 if (s->handler_data[0]
329c1c86 2830 && s->handler_data[0]->spec.sorted == by_name
50c77e5d
NC
2831 && !s->filenames_sorted)
2832 {
329c1c86
AM
2833 lang_section_bst_type *tree;
2834
50c77e5d
NC
2835 walk_wild (s, output_section_callback_fast, output);
2836
e6f2cbf5 2837 tree = s->tree;
329c1c86 2838 if (tree)
e6f2cbf5
L
2839 {
2840 output_section_callback_tree_to_list (s, tree, output);
2841 s->tree = NULL;
2842 }
50c77e5d 2843 }
329c1c86 2844 else
50c77e5d 2845 walk_wild (s, output_section_callback, output);
b6bf44ba 2846
abe6ac95
AM
2847 if (default_common_section == NULL)
2848 for (sec = s->section_list; sec != NULL; sec = sec->next)
b6bf44ba
AM
2849 if (sec->spec.name != NULL && strcmp (sec->spec.name, "COMMON") == 0)
2850 {
2851 /* Remember the section that common is going to in case we
b7a26f91 2852 later get something which doesn't know where to put it. */
b6bf44ba 2853 default_common_section = output;
abe6ac95 2854 break;
b6bf44ba 2855 }
252b5132
RH
2856}
2857
b34976b6 2858/* Return TRUE iff target is the sought target. */
08da4cac 2859
e50d8076 2860static int
1579bae1 2861get_target (const bfd_target *target, void *data)
e50d8076 2862{
1e9cc1c2 2863 const char *sought = (const char *) data;
5f992e62 2864
e50d8076
NC
2865 return strcmp (target->name, sought) == 0;
2866}
2867
2868/* Like strcpy() but convert to lower case as well. */
08da4cac 2869
e50d8076 2870static void
1579bae1 2871stricpy (char *dest, char *src)
e50d8076
NC
2872{
2873 char c;
5f992e62 2874
08da4cac 2875 while ((c = *src++) != 0)
3882b010 2876 *dest++ = TOLOWER (c);
e50d8076 2877
08da4cac 2878 *dest = 0;
e50d8076
NC
2879}
2880
396a2467 2881/* Remove the first occurrence of needle (if any) in haystack
e50d8076 2882 from haystack. */
08da4cac 2883
e50d8076 2884static void
1579bae1 2885strcut (char *haystack, char *needle)
e50d8076
NC
2886{
2887 haystack = strstr (haystack, needle);
5f992e62 2888
e50d8076
NC
2889 if (haystack)
2890 {
08da4cac 2891 char *src;
e50d8076 2892
08da4cac
KH
2893 for (src = haystack + strlen (needle); *src;)
2894 *haystack++ = *src++;
5f992e62 2895
08da4cac 2896 *haystack = 0;
e50d8076
NC
2897 }
2898}
2899
2900/* Compare two target format name strings.
2901 Return a value indicating how "similar" they are. */
08da4cac 2902
e50d8076 2903static int
1579bae1 2904name_compare (char *first, char *second)
e50d8076 2905{
08da4cac
KH
2906 char *copy1;
2907 char *copy2;
2908 int result;
5f992e62 2909
1e9cc1c2
NC
2910 copy1 = (char *) xmalloc (strlen (first) + 1);
2911 copy2 = (char *) xmalloc (strlen (second) + 1);
e50d8076
NC
2912
2913 /* Convert the names to lower case. */
2914 stricpy (copy1, first);
2915 stricpy (copy2, second);
2916
1579bae1 2917 /* Remove size and endian strings from the name. */
e50d8076
NC
2918 strcut (copy1, "big");
2919 strcut (copy1, "little");
2920 strcut (copy2, "big");
2921 strcut (copy2, "little");
2922
2923 /* Return a value based on how many characters match,
2924 starting from the beginning. If both strings are
2925 the same then return 10 * their length. */
08da4cac
KH
2926 for (result = 0; copy1[result] == copy2[result]; result++)
2927 if (copy1[result] == 0)
e50d8076
NC
2928 {
2929 result *= 10;
2930 break;
2931 }
5f992e62 2932
e50d8076
NC
2933 free (copy1);
2934 free (copy2);
2935
2936 return result;
2937}
2938
2939/* Set by closest_target_match() below. */
08da4cac 2940static const bfd_target *winner;
e50d8076
NC
2941
2942/* Scan all the valid bfd targets looking for one that has the endianness
2943 requirement that was specified on the command line, and is the nearest
2944 match to the original output target. */
08da4cac 2945
e50d8076 2946static int
1579bae1 2947closest_target_match (const bfd_target *target, void *data)
e50d8076 2948{
1e9cc1c2 2949 const bfd_target *original = (const bfd_target *) data;
5f992e62 2950
08da4cac
KH
2951 if (command_line.endian == ENDIAN_BIG
2952 && target->byteorder != BFD_ENDIAN_BIG)
e50d8076 2953 return 0;
5f992e62 2954
08da4cac
KH
2955 if (command_line.endian == ENDIAN_LITTLE
2956 && target->byteorder != BFD_ENDIAN_LITTLE)
e50d8076
NC
2957 return 0;
2958
2959 /* Must be the same flavour. */
2960 if (target->flavour != original->flavour)
2961 return 0;
2962
de7dd2bd 2963 /* Ignore generic big and little endian elf vectors. */
967928e9 2964 if (strcmp (target->name, "elf32-big") == 0
de7dd2bd
NC
2965 || strcmp (target->name, "elf64-big") == 0
2966 || strcmp (target->name, "elf32-little") == 0
2967 || strcmp (target->name, "elf64-little") == 0)
2968 return 0;
2969
e50d8076
NC
2970 /* If we have not found a potential winner yet, then record this one. */
2971 if (winner == NULL)
2972 {
2973 winner = target;
2974 return 0;
2975 }
2976
2977 /* Oh dear, we now have two potential candidates for a successful match.
4de2d33d 2978 Compare their names and choose the better one. */
d1778b88
AM
2979 if (name_compare (target->name, original->name)
2980 > name_compare (winner->name, original->name))
e50d8076
NC
2981 winner = target;
2982
2983 /* Keep on searching until wqe have checked them all. */
2984 return 0;
2985}
2986
2987/* Return the BFD target format of the first input file. */
08da4cac 2988
e50d8076 2989static char *
1579bae1 2990get_first_input_target (void)
e50d8076 2991{
08da4cac 2992 char *target = NULL;
e50d8076
NC
2993
2994 LANG_FOR_EACH_INPUT_STATEMENT (s)
2995 {
2996 if (s->header.type == lang_input_statement_enum
2997 && s->real)
2998 {
2999 ldfile_open_file (s);
5f992e62 3000
e50d8076
NC
3001 if (s->the_bfd != NULL
3002 && bfd_check_format (s->the_bfd, bfd_object))
3003 {
3004 target = bfd_get_target (s->the_bfd);
5f992e62 3005
e50d8076
NC
3006 if (target != NULL)
3007 break;
3008 }
3009 }
3010 }
5f992e62 3011
e50d8076
NC
3012 return target;
3013}
3014
599917b8 3015const char *
1579bae1 3016lang_get_output_target (void)
599917b8
JJ
3017{
3018 const char *target;
3019
3020 /* Has the user told us which output format to use? */
1579bae1 3021 if (output_target != NULL)
599917b8
JJ
3022 return output_target;
3023
3024 /* No - has the current target been set to something other than
3025 the default? */
3026 if (current_target != default_target)
3027 return current_target;
3028
3029 /* No - can we determine the format of the first input file? */
3030 target = get_first_input_target ();
3031 if (target != NULL)
3032 return target;
3033
3034 /* Failed - use the default output target. */
3035 return default_target;
3036}
3037
252b5132
RH
3038/* Open the output file. */
3039
f13a99db 3040static void
1579bae1 3041open_output (const char *name)
252b5132 3042{
599917b8 3043 output_target = lang_get_output_target ();
5f992e62 3044
08da4cac
KH
3045 /* Has the user requested a particular endianness on the command
3046 line? */
e50d8076
NC
3047 if (command_line.endian != ENDIAN_UNSET)
3048 {
08da4cac 3049 const bfd_target *target;
1b69a0bf 3050 enum bfd_endian desired_endian;
e50d8076
NC
3051
3052 /* Get the chosen target. */
1579bae1 3053 target = bfd_search_for_target (get_target, (void *) output_target);
e50d8076 3054
c13b1b77
NC
3055 /* If the target is not supported, we cannot do anything. */
3056 if (target != NULL)
e50d8076 3057 {
c13b1b77
NC
3058 if (command_line.endian == ENDIAN_BIG)
3059 desired_endian = BFD_ENDIAN_BIG;
e50d8076 3060 else
c13b1b77 3061 desired_endian = BFD_ENDIAN_LITTLE;
5f992e62
AM
3062
3063 /* See if the target has the wrong endianness. This should
3064 not happen if the linker script has provided big and
3065 little endian alternatives, but some scrips don't do
3066 this. */
c13b1b77 3067 if (target->byteorder != desired_endian)
e50d8076 3068 {
c13b1b77
NC
3069 /* If it does, then see if the target provides
3070 an alternative with the correct endianness. */
3071 if (target->alternative_target != NULL
3072 && (target->alternative_target->byteorder == desired_endian))
3073 output_target = target->alternative_target->name;
e50d8076 3074 else
c13b1b77 3075 {
5f992e62
AM
3076 /* Try to find a target as similar as possible to
3077 the default target, but which has the desired
3078 endian characteristic. */
1579bae1
AM
3079 bfd_search_for_target (closest_target_match,
3080 (void *) target);
5f992e62
AM
3081
3082 /* Oh dear - we could not find any targets that
3083 satisfy our requirements. */
c13b1b77 3084 if (winner == NULL)
6feb9908
AM
3085 einfo (_("%P: warning: could not find any targets"
3086 " that match endianness requirement\n"));
c13b1b77
NC
3087 else
3088 output_target = winner->name;
3089 }
e50d8076
NC
3090 }
3091 }
252b5132 3092 }
5f992e62 3093
f13a99db 3094 link_info.output_bfd = bfd_openw (name, output_target);
252b5132 3095
f13a99db 3096 if (link_info.output_bfd == NULL)
252b5132
RH
3097 {
3098 if (bfd_get_error () == bfd_error_invalid_target)
e50d8076
NC
3099 einfo (_("%P%F: target %s not found\n"), output_target);
3100
252b5132
RH
3101 einfo (_("%P%F: cannot open output file %s: %E\n"), name);
3102 }
3103
b34976b6 3104 delete_output_file_on_failure = TRUE;
252b5132 3105
f13a99db 3106 if (! bfd_set_format (link_info.output_bfd, bfd_object))
252b5132 3107 einfo (_("%P%F:%s: can not make object file: %E\n"), name);
f13a99db 3108 if (! bfd_set_arch_mach (link_info.output_bfd,
252b5132
RH
3109 ldfile_output_architecture,
3110 ldfile_output_machine))
3111 einfo (_("%P%F:%s: can not set architecture: %E\n"), name);
3112
f13a99db 3113 link_info.hash = bfd_link_hash_table_create (link_info.output_bfd);
1579bae1 3114 if (link_info.hash == NULL)
384a9dda 3115 einfo (_("%P%F: can not create hash table: %E\n"));
252b5132 3116
f13a99db 3117 bfd_set_gp_size (link_info.output_bfd, g_switch_value);
252b5132
RH
3118}
3119
252b5132 3120static void
1579bae1 3121ldlang_open_output (lang_statement_union_type *statement)
252b5132
RH
3122{
3123 switch (statement->header.type)
3124 {
3125 case lang_output_statement_enum:
f13a99db
AM
3126 ASSERT (link_info.output_bfd == NULL);
3127 open_output (statement->output_statement.name);
252b5132 3128 ldemul_set_output_arch ();
1049f94e 3129 if (config.magic_demand_paged && !link_info.relocatable)
f13a99db 3130 link_info.output_bfd->flags |= D_PAGED;
252b5132 3131 else
f13a99db 3132 link_info.output_bfd->flags &= ~D_PAGED;
252b5132 3133 if (config.text_read_only)
f13a99db 3134 link_info.output_bfd->flags |= WP_TEXT;
252b5132 3135 else
f13a99db 3136 link_info.output_bfd->flags &= ~WP_TEXT;
252b5132 3137 if (link_info.traditional_format)
f13a99db 3138 link_info.output_bfd->flags |= BFD_TRADITIONAL_FORMAT;
252b5132 3139 else
f13a99db 3140 link_info.output_bfd->flags &= ~BFD_TRADITIONAL_FORMAT;
252b5132
RH
3141 break;
3142
3143 case lang_target_statement_enum:
3144 current_target = statement->target_statement.target;
3145 break;
3146 default:
3147 break;
3148 }
3149}
3150
e5caa5e0
AM
3151/* Convert between addresses in bytes and sizes in octets.
3152 For currently supported targets, octets_per_byte is always a power
3153 of two, so we can use shifts. */
3154#define TO_ADDR(X) ((X) >> opb_shift)
3155#define TO_SIZE(X) ((X) << opb_shift)
3156
3157/* Support the above. */
3158static unsigned int opb_shift = 0;
3159
3160static void
3161init_opb (void)
3162{
3163 unsigned x = bfd_arch_mach_octets_per_byte (ldfile_output_architecture,
3164 ldfile_output_machine);
3165 opb_shift = 0;
3166 if (x > 1)
3167 while ((x & 1) == 0)
3168 {
3169 x >>= 1;
3170 ++opb_shift;
3171 }
3172 ASSERT (x == 1);
3173}
3174
252b5132
RH
3175/* Open all the input files. */
3176
3177static void
1579bae1 3178open_input_bfds (lang_statement_union_type *s, bfd_boolean force)
252b5132 3179{
1579bae1 3180 for (; s != NULL; s = s->header.next)
252b5132
RH
3181 {
3182 switch (s->header.type)
3183 {
3184 case lang_constructors_statement_enum:
3185 open_input_bfds (constructor_list.head, force);
3186 break;
3187 case lang_output_section_statement_enum:
3188 open_input_bfds (s->output_section_statement.children.head, force);
3189 break;
3190 case lang_wild_statement_enum:
08da4cac 3191 /* Maybe we should load the file's symbols. */
252b5132 3192 if (s->wild_statement.filename
97407faf
AM
3193 && !wildcardp (s->wild_statement.filename)
3194 && !archive_path (s->wild_statement.filename))
4a43e768 3195 lookup_name (s->wild_statement.filename);
252b5132
RH
3196 open_input_bfds (s->wild_statement.children.head, force);
3197 break;
3198 case lang_group_statement_enum:
3199 {
3200 struct bfd_link_hash_entry *undefs;
3201
3202 /* We must continually search the entries in the group
08da4cac
KH
3203 until no new symbols are added to the list of undefined
3204 symbols. */
252b5132
RH
3205
3206 do
3207 {
3208 undefs = link_info.hash->undefs_tail;
b34976b6 3209 open_input_bfds (s->group_statement.children.head, TRUE);
252b5132
RH
3210 }
3211 while (undefs != link_info.hash->undefs_tail);
3212 }
3213 break;
3214 case lang_target_statement_enum:
3215 current_target = s->target_statement.target;
3216 break;
3217 case lang_input_statement_enum:
e50d8076 3218 if (s->input_statement.real)
252b5132 3219 {
bde18da4 3220 lang_statement_union_type **os_tail;
252b5132
RH
3221 lang_statement_list_type add;
3222
3223 s->input_statement.target = current_target;
3224
3225 /* If we are being called from within a group, and this
afd7a018
AM
3226 is an archive which has already been searched, then
3227 force it to be researched unless the whole archive
cd4c806a 3228 has been loaded already. */
252b5132 3229 if (force
cd4c806a 3230 && !s->input_statement.whole_archive
252b5132
RH
3231 && s->input_statement.loaded
3232 && bfd_check_format (s->input_statement.the_bfd,
3233 bfd_archive))
b34976b6 3234 s->input_statement.loaded = FALSE;
252b5132 3235
bde18da4 3236 os_tail = lang_output_section_statement.tail;
d1778b88 3237 lang_list_init (&add);
1276aefa 3238
6770ec8c 3239 if (! load_symbols (&s->input_statement, &add))
b34976b6 3240 config.make_executable = FALSE;
252b5132
RH
3241
3242 if (add.head != NULL)
3243 {
bde18da4
AM
3244 /* If this was a script with output sections then
3245 tack any added statements on to the end of the
3246 list. This avoids having to reorder the output
3247 section statement list. Very likely the user
3248 forgot -T, and whatever we do here will not meet
3249 naive user expectations. */
3250 if (os_tail != lang_output_section_statement.tail)
3251 {
3252 einfo (_("%P: warning: %s contains output sections;"
3253 " did you forget -T?\n"),
3254 s->input_statement.filename);
3255 *stat_ptr->tail = add.head;
3256 stat_ptr->tail = add.tail;
3257 }
3258 else
3259 {
3260 *add.tail = s->header.next;
3261 s->header.next = add.head;
3262 }
252b5132
RH
3263 }
3264 }
3265 break;
e759c116 3266 case lang_assignment_statement_enum:
01554a74
AM
3267 if (s->assignment_statement.exp->assign.hidden)
3268 /* This is from a --defsym on the command line. */
3269 exp_fold_tree_no_dot (s->assignment_statement.exp);
e759c116 3270 break;
252b5132
RH
3271 default:
3272 break;
3273 }
3274 }
c4b78195
NC
3275
3276 /* Exit if any of the files were missing. */
3277 if (missing_file)
3278 einfo ("%F");
252b5132
RH
3279}
3280
420e579c
HPN
3281/* Add a symbol to a hash of symbols used in DEFINED (NAME) expressions. */
3282
3283void
3284lang_track_definedness (const char *name)
3285{
3286 if (bfd_hash_lookup (&lang_definedness_table, name, TRUE, FALSE) == NULL)
3287 einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name);
3288}
3289
3290/* New-function for the definedness hash table. */
3291
3292static struct bfd_hash_entry *
3293lang_definedness_newfunc (struct bfd_hash_entry *entry,
3294 struct bfd_hash_table *table ATTRIBUTE_UNUSED,
3295 const char *name ATTRIBUTE_UNUSED)
3296{
3297 struct lang_definedness_hash_entry *ret
3298 = (struct lang_definedness_hash_entry *) entry;
3299
3300 if (ret == NULL)
3301 ret = (struct lang_definedness_hash_entry *)
3302 bfd_hash_allocate (table, sizeof (struct lang_definedness_hash_entry));
3303
3304 if (ret == NULL)
3305 einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name);
3306
3307 ret->iteration = -1;
3308 return &ret->root;
3309}
3310
3311/* Return the iteration when the definition of NAME was last updated. A
3312 value of -1 means that the symbol is not defined in the linker script
3313 or the command line, but may be defined in the linker symbol table. */
3314
3315int
3316lang_symbol_definition_iteration (const char *name)
3317{
3318 struct lang_definedness_hash_entry *defentry
3319 = (struct lang_definedness_hash_entry *)
3320 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
3321
3322 /* We've already created this one on the presence of DEFINED in the
3323 script, so it can't be NULL unless something is borked elsewhere in
3324 the code. */
3325 if (defentry == NULL)
3326 FAIL ();
3327
3328 return defentry->iteration;
3329}
3330
3331/* Update the definedness state of NAME. */
3332
3333void
3334lang_update_definedness (const char *name, struct bfd_link_hash_entry *h)
3335{
3336 struct lang_definedness_hash_entry *defentry
3337 = (struct lang_definedness_hash_entry *)
3338 bfd_hash_lookup (&lang_definedness_table, name, FALSE, FALSE);
3339
3340 /* We don't keep track of symbols not tested with DEFINED. */
3341 if (defentry == NULL)
3342 return;
3343
3344 /* If the symbol was already defined, and not from an earlier statement
3345 iteration, don't update the definedness iteration, because that'd
3346 make the symbol seem defined in the linker script at this point, and
3347 it wasn't; it was defined in some object. If we do anyway, DEFINED
3348 would start to yield false before this point and the construct "sym =
3349 DEFINED (sym) ? sym : X;" would change sym to X despite being defined
3350 in an object. */
3351 if (h->type != bfd_link_hash_undefined
3352 && h->type != bfd_link_hash_common
3353 && h->type != bfd_link_hash_new
3354 && defentry->iteration == -1)
3355 return;
3356
3357 defentry->iteration = lang_statement_iteration;
3358}
3359
08da4cac 3360/* Add the supplied name to the symbol table as an undefined reference.
fcf0e35b
AM
3361 This is a two step process as the symbol table doesn't even exist at
3362 the time the ld command line is processed. First we put the name
3363 on a list, then, once the output file has been opened, transfer the
3364 name to the symbol table. */
3365
e3e942e9 3366typedef struct bfd_sym_chain ldlang_undef_chain_list_type;
252b5132 3367
e3e942e9 3368#define ldlang_undef_chain_list_head entry_symbol.next
252b5132
RH
3369
3370void
24898b70 3371ldlang_add_undef (const char *const name, bfd_boolean cmdline)
252b5132 3372{
24898b70 3373 ldlang_undef_chain_list_type *new_undef;
252b5132 3374
24898b70
AM
3375 undef_from_cmdline = undef_from_cmdline || cmdline;
3376 new_undef = (ldlang_undef_chain_list_type *) stat_alloc (sizeof (*new_undef));
d3ce72d0
NC
3377 new_undef->next = ldlang_undef_chain_list_head;
3378 ldlang_undef_chain_list_head = new_undef;
252b5132 3379
d3ce72d0 3380 new_undef->name = xstrdup (name);
fcf0e35b 3381
f13a99db 3382 if (link_info.output_bfd != NULL)
d3ce72d0 3383 insert_undefined (new_undef->name);
fcf0e35b
AM
3384}
3385
3386/* Insert NAME as undefined in the symbol table. */
3387
3388static void
1579bae1 3389insert_undefined (const char *name)
fcf0e35b
AM
3390{
3391 struct bfd_link_hash_entry *h;
3392
b34976b6 3393 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, FALSE, TRUE);
1579bae1 3394 if (h == NULL)
fcf0e35b
AM
3395 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
3396 if (h->type == bfd_link_hash_new)
3397 {
3398 h->type = bfd_link_hash_undefined;
3399 h->u.undef.abfd = NULL;
3400 bfd_link_add_undef (link_info.hash, h);
3401 }
252b5132
RH
3402}
3403
3404/* Run through the list of undefineds created above and place them
3405 into the linker hash table as undefined symbols belonging to the
08da4cac
KH
3406 script file. */
3407
252b5132 3408static void
1579bae1 3409lang_place_undefineds (void)
252b5132
RH
3410{
3411 ldlang_undef_chain_list_type *ptr;
3412
1579bae1
AM
3413 for (ptr = ldlang_undef_chain_list_head; ptr != NULL; ptr = ptr->next)
3414 insert_undefined (ptr->name);
252b5132
RH
3415}
3416
0841712e
JJ
3417/* Check for all readonly or some readwrite sections. */
3418
3419static void
6feb9908
AM
3420check_input_sections
3421 (lang_statement_union_type *s,
3422 lang_output_section_statement_type *output_section_statement)
0841712e
JJ
3423{
3424 for (; s != (lang_statement_union_type *) NULL; s = s->header.next)
3425 {
3426 switch (s->header.type)
967928e9
AM
3427 {
3428 case lang_wild_statement_enum:
3429 walk_wild (&s->wild_statement, check_section_callback,
3430 output_section_statement);
3431 if (! output_section_statement->all_input_readonly)
3432 return;
3433 break;
3434 case lang_constructors_statement_enum:
3435 check_input_sections (constructor_list.head,
3436 output_section_statement);
3437 if (! output_section_statement->all_input_readonly)
3438 return;
3439 break;
3440 case lang_group_statement_enum:
3441 check_input_sections (s->group_statement.children.head,
3442 output_section_statement);
3443 if (! output_section_statement->all_input_readonly)
3444 return;
3445 break;
3446 default:
3447 break;
3448 }
0841712e
JJ
3449 }
3450}
3451
bcaa7b3e
L
3452/* Update wildcard statements if needed. */
3453
3454static void
3455update_wild_statements (lang_statement_union_type *s)
3456{
3457 struct wildcard_list *sec;
3458
3459 switch (sort_section)
3460 {
3461 default:
3462 FAIL ();
3463
3464 case none:
3465 break;
3466
3467 case by_name:
3468 case by_alignment:
3469 for (; s != NULL; s = s->header.next)
3470 {
3471 switch (s->header.type)
3472 {
3473 default:
3474 break;
3475
3476 case lang_wild_statement_enum:
3477 sec = s->wild_statement.section_list;
0d0999db
L
3478 for (sec = s->wild_statement.section_list; sec != NULL;
3479 sec = sec->next)
bcaa7b3e
L
3480 {
3481 switch (sec->spec.sorted)
3482 {
3483 case none:
3484 sec->spec.sorted = sort_section;
3485 break;
3486 case by_name:
3487 if (sort_section == by_alignment)
3488 sec->spec.sorted = by_name_alignment;
3489 break;
3490 case by_alignment:
3491 if (sort_section == by_name)
3492 sec->spec.sorted = by_alignment_name;
3493 break;
3494 default:
3495 break;
3496 }
3497 }
3498 break;
3499
3500 case lang_constructors_statement_enum:
3501 update_wild_statements (constructor_list.head);
3502 break;
3503
3504 case lang_output_section_statement_enum:
3505 update_wild_statements
3506 (s->output_section_statement.children.head);
3507 break;
3508
3509 case lang_group_statement_enum:
3510 update_wild_statements (s->group_statement.children.head);
3511 break;
3512 }
3513 }
3514 break;
3515 }
3516}
3517
396a2467 3518/* Open input files and attach to output sections. */
08da4cac 3519
252b5132 3520static void
1579bae1
AM
3521map_input_to_output_sections
3522 (lang_statement_union_type *s, const char *target,
afd7a018 3523 lang_output_section_statement_type *os)
252b5132 3524{
1579bae1 3525 for (; s != NULL; s = s->header.next)
252b5132 3526 {
dfa7b0b8
AM
3527 lang_output_section_statement_type *tos;
3528 flagword flags;
3529
252b5132
RH
3530 switch (s->header.type)
3531 {
252b5132 3532 case lang_wild_statement_enum:
afd7a018 3533 wild (&s->wild_statement, target, os);
abc6ab0a 3534 break;
252b5132
RH
3535 case lang_constructors_statement_enum:
3536 map_input_to_output_sections (constructor_list.head,
3537 target,
afd7a018 3538 os);
252b5132
RH
3539 break;
3540 case lang_output_section_statement_enum:
dfa7b0b8
AM
3541 tos = &s->output_section_statement;
3542 if (tos->constraint != 0)
0841712e 3543 {
dfa7b0b8
AM
3544 if (tos->constraint != ONLY_IF_RW
3545 && tos->constraint != ONLY_IF_RO)
0841712e 3546 break;
dfa7b0b8
AM
3547 tos->all_input_readonly = TRUE;
3548 check_input_sections (tos->children.head, tos);
3549 if (tos->all_input_readonly != (tos->constraint == ONLY_IF_RO))
0841712e 3550 {
dfa7b0b8 3551 tos->constraint = -1;
0841712e
JJ
3552 break;
3553 }
3554 }
dfa7b0b8 3555 map_input_to_output_sections (tos->children.head,
252b5132 3556 target,
dfa7b0b8 3557 tos);
a431bc2e
AM
3558 break;
3559 case lang_output_statement_enum:
252b5132
RH
3560 break;
3561 case lang_target_statement_enum:
3562 target = s->target_statement.target;
3563 break;
3564 case lang_group_statement_enum:
3565 map_input_to_output_sections (s->group_statement.children.head,
3566 target,
afd7a018 3567 os);
252b5132 3568 break;
384d938f
NS
3569 case lang_data_statement_enum:
3570 /* Make sure that any sections mentioned in the expression
3571 are initialized. */
3572 exp_init_os (s->data_statement.exp);
2e76e85a
AM
3573 /* The output section gets CONTENTS, ALLOC and LOAD, but
3574 these may be overridden by the script. */
dfa7b0b8
AM
3575 flags = SEC_HAS_CONTENTS | SEC_ALLOC | SEC_LOAD;
3576 switch (os->sectype)
3577 {
3578 case normal_section:
3579 case overlay_section:
3580 break;
3581 case noalloc_section:
3582 flags = SEC_HAS_CONTENTS;
3583 break;
3584 case noload_section:
f4eaaf7f
AM
3585 if (bfd_get_flavour (link_info.output_bfd)
3586 == bfd_target_elf_flavour)
3587 flags = SEC_NEVER_LOAD | SEC_ALLOC;
3588 else
3589 flags = SEC_NEVER_LOAD | SEC_HAS_CONTENTS;
dfa7b0b8
AM
3590 break;
3591 }
a431bc2e 3592 if (os->bfd_section == NULL)
dfa7b0b8 3593 init_os (os, flags);
a431bc2e
AM
3594 else
3595 os->bfd_section->flags |= flags;
afd7a018 3596 break;
252b5132 3597 case lang_input_section_enum:
e0f6802f
AM
3598 break;
3599 case lang_fill_statement_enum:
252b5132 3600 case lang_object_symbols_statement_enum:
252b5132
RH
3601 case lang_reloc_statement_enum:
3602 case lang_padding_statement_enum:
3603 case lang_input_statement_enum:
afd7a018 3604 if (os != NULL && os->bfd_section == NULL)
dfa7b0b8 3605 init_os (os, 0);
252b5132
RH
3606 break;
3607 case lang_assignment_statement_enum:
afd7a018 3608 if (os != NULL && os->bfd_section == NULL)
dfa7b0b8 3609 init_os (os, 0);
252b5132
RH
3610
3611 /* Make sure that any sections mentioned in the assignment
08da4cac 3612 are initialized. */
252b5132
RH
3613 exp_init_os (s->assignment_statement.exp);
3614 break;
252b5132 3615 case lang_address_statement_enum:
a431bc2e
AM
3616 /* Mark the specified section with the supplied address.
3617 If this section was actually a segment marker, then the
3618 directive is ignored if the linker script explicitly
3619 processed the segment marker. Originally, the linker
3620 treated segment directives (like -Ttext on the
3621 command-line) as section directives. We honor the
3622 section directive semantics for backwards compatibilty;
3623 linker scripts that do not specifically check for
3624 SEGMENT_START automatically get the old semantics. */
329c1c86 3625 if (!s->address_statement.segment
ba916c8a
MM
3626 || !s->address_statement.segment->used)
3627 {
dfa7b0b8
AM
3628 const char *name = s->address_statement.section_name;
3629
3630 /* Create the output section statement here so that
3631 orphans with a set address will be placed after other
3632 script sections. If we let the orphan placement code
3633 place them in amongst other sections then the address
3634 will affect following script sections, which is
3635 likely to surprise naive users. */
3636 tos = lang_output_section_statement_lookup (name, 0, TRUE);
3637 tos->addr_tree = s->address_statement.address;
3638 if (tos->bfd_section == NULL)
3639 init_os (tos, 0);
ba916c8a 3640 }
252b5132 3641 break;
53d25da6
AM
3642 case lang_insert_statement_enum:
3643 break;
3644 }
3645 }
3646}
3647
3648/* An insert statement snips out all the linker statements from the
3649 start of the list and places them after the output section
3650 statement specified by the insert. This operation is complicated
3651 by the fact that we keep a doubly linked list of output section
3652 statements as well as the singly linked list of all statements. */
3653
3654static void
3655process_insert_statements (void)
3656{
3657 lang_statement_union_type **s;
3658 lang_output_section_statement_type *first_os = NULL;
3659 lang_output_section_statement_type *last_os = NULL;
66c103b7 3660 lang_output_section_statement_type *os;
53d25da6
AM
3661
3662 /* "start of list" is actually the statement immediately after
3663 the special abs_section output statement, so that it isn't
3664 reordered. */
3665 s = &lang_output_section_statement.head;
3666 while (*(s = &(*s)->header.next) != NULL)
3667 {
3668 if ((*s)->header.type == lang_output_section_statement_enum)
3669 {
3670 /* Keep pointers to the first and last output section
3671 statement in the sequence we may be about to move. */
d2ae7be0
AM
3672 os = &(*s)->output_section_statement;
3673
3674 ASSERT (last_os == NULL || last_os->next == os);
3675 last_os = os;
66c103b7
AM
3676
3677 /* Set constraint negative so that lang_output_section_find
3678 won't match this output section statement. At this
3679 stage in linking constraint has values in the range
3680 [-1, ONLY_IN_RW]. */
3681 last_os->constraint = -2 - last_os->constraint;
53d25da6
AM
3682 if (first_os == NULL)
3683 first_os = last_os;
3684 }
3685 else if ((*s)->header.type == lang_insert_statement_enum)
3686 {
3687 lang_insert_statement_type *i = &(*s)->insert_statement;
3688 lang_output_section_statement_type *where;
53d25da6
AM
3689 lang_statement_union_type **ptr;
3690 lang_statement_union_type *first;
3691
3692 where = lang_output_section_find (i->where);
3693 if (where != NULL && i->is_before)
3694 {
967928e9 3695 do
53d25da6 3696 where = where->prev;
66c103b7 3697 while (where != NULL && where->constraint < 0);
53d25da6
AM
3698 }
3699 if (where == NULL)
3700 {
66c103b7
AM
3701 einfo (_("%F%P: %s not found for insert\n"), i->where);
3702 return;
53d25da6
AM
3703 }
3704
3705 /* Deal with reordering the output section statement list. */
3706 if (last_os != NULL)
3707 {
3708 asection *first_sec, *last_sec;
29183214 3709 struct lang_output_section_statement_struct **next;
53d25da6
AM
3710
3711 /* Snip out the output sections we are moving. */
3712 first_os->prev->next = last_os->next;
3713 if (last_os->next == NULL)
29183214
L
3714 {
3715 next = &first_os->prev->next;
3716 lang_output_section_statement.tail
3717 = (lang_statement_union_type **) next;
3718 }
53d25da6
AM
3719 else
3720 last_os->next->prev = first_os->prev;
3721 /* Add them in at the new position. */
3722 last_os->next = where->next;
3723 if (where->next == NULL)
29183214
L
3724 {
3725 next = &last_os->next;
3726 lang_output_section_statement.tail
3727 = (lang_statement_union_type **) next;
3728 }
53d25da6
AM
3729 else
3730 where->next->prev = last_os;
3731 first_os->prev = where;
3732 where->next = first_os;
3733
3734 /* Move the bfd sections in the same way. */
3735 first_sec = NULL;
3736 last_sec = NULL;
3737 for (os = first_os; os != NULL; os = os->next)
3738 {
66c103b7 3739 os->constraint = -2 - os->constraint;
53d25da6
AM
3740 if (os->bfd_section != NULL
3741 && os->bfd_section->owner != NULL)
3742 {
3743 last_sec = os->bfd_section;
3744 if (first_sec == NULL)
3745 first_sec = last_sec;
3746 }
3747 if (os == last_os)
3748 break;
3749 }
3750 if (last_sec != NULL)
3751 {
3752 asection *sec = where->bfd_section;
3753 if (sec == NULL)
3754 sec = output_prev_sec_find (where);
3755
3756 /* The place we want to insert must come after the
3757 sections we are moving. So if we find no
3758 section or if the section is the same as our
3759 last section, then no move is needed. */
3760 if (sec != NULL && sec != last_sec)
3761 {
3762 /* Trim them off. */
3763 if (first_sec->prev != NULL)
3764 first_sec->prev->next = last_sec->next;
3765 else
f13a99db 3766 link_info.output_bfd->sections = last_sec->next;
53d25da6
AM
3767 if (last_sec->next != NULL)
3768 last_sec->next->prev = first_sec->prev;
3769 else
f13a99db 3770 link_info.output_bfd->section_last = first_sec->prev;
53d25da6
AM
3771 /* Add back. */
3772 last_sec->next = sec->next;
3773 if (sec->next != NULL)
3774 sec->next->prev = last_sec;
3775 else
f13a99db 3776 link_info.output_bfd->section_last = last_sec;
53d25da6
AM
3777 first_sec->prev = sec;
3778 sec->next = first_sec;
3779 }
3780 }
3781
3782 first_os = NULL;
3783 last_os = NULL;
3784 }
3785
3786 ptr = insert_os_after (where);
3787 /* Snip everything after the abs_section output statement we
3788 know is at the start of the list, up to and including
3789 the insert statement we are currently processing. */
3790 first = lang_output_section_statement.head->header.next;
3791 lang_output_section_statement.head->header.next = (*s)->header.next;
3792 /* Add them back where they belong. */
3793 *s = *ptr;
3794 if (*s == NULL)
3795 statement_list.tail = s;
3796 *ptr = first;
3797 s = &lang_output_section_statement.head;
252b5132
RH
3798 }
3799 }
66c103b7
AM
3800
3801 /* Undo constraint twiddling. */
3802 for (os = first_os; os != NULL; os = os->next)
3803 {
3804 os->constraint = -2 - os->constraint;
3805 if (os == last_os)
3806 break;
3807 }
252b5132
RH
3808}
3809
4bd5a393
AM
3810/* An output section might have been removed after its statement was
3811 added. For example, ldemul_before_allocation can remove dynamic
3812 sections if they turn out to be not needed. Clean them up here. */
3813
8423293d 3814void
1579bae1 3815strip_excluded_output_sections (void)
4bd5a393 3816{
afd7a018 3817 lang_output_section_statement_type *os;
4bd5a393 3818
046183de 3819 /* Run lang_size_sections (if not already done). */
e9ee469a
AM
3820 if (expld.phase != lang_mark_phase_enum)
3821 {
3822 expld.phase = lang_mark_phase_enum;
3823 expld.dataseg.phase = exp_dataseg_none;
3824 one_lang_size_sections_pass (NULL, FALSE);
3825 lang_reset_memory_regions ();
3826 }
3827
afd7a018
AM
3828 for (os = &lang_output_section_statement.head->output_section_statement;
3829 os != NULL;
3830 os = os->next)
4bd5a393 3831 {
75ff4589
L
3832 asection *output_section;
3833 bfd_boolean exclude;
4bd5a393 3834
66c103b7 3835 if (os->constraint < 0)
0841712e 3836 continue;
8423293d 3837
75ff4589
L
3838 output_section = os->bfd_section;
3839 if (output_section == NULL)
8423293d
AM
3840 continue;
3841
32124d5b
AM
3842 exclude = (output_section->rawsize == 0
3843 && (output_section->flags & SEC_KEEP) == 0
f13a99db 3844 && !bfd_section_removed_from_list (link_info.output_bfd,
32124d5b
AM
3845 output_section));
3846
3847 /* Some sections have not yet been sized, notably .gnu.version,
3848 .dynsym, .dynstr and .hash. These all have SEC_LINKER_CREATED
3849 input sections, so don't drop output sections that have such
3850 input sections unless they are also marked SEC_EXCLUDE. */
3851 if (exclude && output_section->map_head.s != NULL)
75ff4589
L
3852 {
3853 asection *s;
8423293d 3854
32124d5b
AM
3855 for (s = output_section->map_head.s; s != NULL; s = s->map_head.s)
3856 if ((s->flags & SEC_LINKER_CREATED) != 0
3857 && (s->flags & SEC_EXCLUDE) == 0)
e9ee469a
AM
3858 {
3859 exclude = FALSE;
3860 break;
3861 }
75ff4589 3862 }
8423293d 3863
32124d5b
AM
3864 /* TODO: Don't just junk map_head.s, turn them into link_orders. */
3865 output_section->map_head.link_order = NULL;
3866 output_section->map_tail.link_order = NULL;
3867
3868 if (exclude)
4bd5a393 3869 {
e9ee469a
AM
3870 /* We don't set bfd_section to NULL since bfd_section of the
3871 removed output section statement may still be used. */
3d263d86
AM
3872 if (!os->section_relative_symbol
3873 && !os->update_dot_tree)
74541ad4 3874 os->ignored = TRUE;
e9ee469a 3875 output_section->flags |= SEC_EXCLUDE;
f13a99db
AM
3876 bfd_section_list_remove (link_info.output_bfd, output_section);
3877 link_info.output_bfd->section_count--;
4bd5a393
AM
3878 }
3879 }
8423293d
AM
3880
3881 /* Stop future calls to lang_add_section from messing with map_head
3882 and map_tail link_order fields. */
3883 stripped_excluded_sections = TRUE;
4bd5a393
AM
3884}
3885
252b5132 3886static void
1579bae1
AM
3887print_output_section_statement
3888 (lang_output_section_statement_type *output_section_statement)
252b5132
RH
3889{
3890 asection *section = output_section_statement->bfd_section;
3891 int len;
3892
3893 if (output_section_statement != abs_output_section)
3894 {
3895 minfo ("\n%s", output_section_statement->name);
3896
3897 if (section != NULL)
3898 {
3899 print_dot = section->vma;
3900
3901 len = strlen (output_section_statement->name);
3902 if (len >= SECTION_NAME_MAP_LENGTH - 1)
3903 {
3904 print_nl ();
3905 len = 0;
3906 }
3907 while (len < SECTION_NAME_MAP_LENGTH)
3908 {
3909 print_space ();
3910 ++len;
3911 }
3912
eea6121a 3913 minfo ("0x%V %W", section->vma, section->size);
252b5132 3914
67f744f3
AM
3915 if (section->vma != section->lma)
3916 minfo (_(" load address 0x%V"), section->lma);
5590fba9
NC
3917
3918 if (output_section_statement->update_dot_tree != NULL)
3919 exp_fold_tree (output_section_statement->update_dot_tree,
3920 bfd_abs_section_ptr, &print_dot);
252b5132
RH
3921 }
3922
3923 print_nl ();
3924 }
3925
3926 print_statement_list (output_section_statement->children.head,
3927 output_section_statement);
3928}
3929
3b83e13a
NC
3930/* Scan for the use of the destination in the right hand side
3931 of an expression. In such cases we will not compute the
3932 correct expression, since the value of DST that is used on
3933 the right hand side will be its final value, not its value
3934 just before this expression is evaluated. */
329c1c86 3935
3b83e13a
NC
3936static bfd_boolean
3937scan_for_self_assignment (const char * dst, etree_type * rhs)
3938{
3939 if (rhs == NULL || dst == NULL)
3940 return FALSE;
3941
3942 switch (rhs->type.node_class)
3943 {
3944 case etree_binary:
e759c116
AM
3945 return (scan_for_self_assignment (dst, rhs->binary.lhs)
3946 || scan_for_self_assignment (dst, rhs->binary.rhs));
3b83e13a
NC
3947
3948 case etree_trinary:
e759c116
AM
3949 return (scan_for_self_assignment (dst, rhs->trinary.lhs)
3950 || scan_for_self_assignment (dst, rhs->trinary.rhs));
3b83e13a
NC
3951
3952 case etree_assign:
3953 case etree_provided:
3954 case etree_provide:
3955 if (strcmp (dst, rhs->assign.dst) == 0)
3956 return TRUE;
3957 return scan_for_self_assignment (dst, rhs->assign.src);
3958
3959 case etree_unary:
3960 return scan_for_self_assignment (dst, rhs->unary.child);
3961
3962 case etree_value:
3963 if (rhs->value.str)
3964 return strcmp (dst, rhs->value.str) == 0;
3965 return FALSE;
3966
3967 case etree_name:
3968 if (rhs->name.name)
3969 return strcmp (dst, rhs->name.name) == 0;
3970 return FALSE;
3971
3972 default:
3973 break;
3974 }
3975
3976 return FALSE;
3977}
3978
3979
252b5132 3980static void
1579bae1
AM
3981print_assignment (lang_assignment_statement_type *assignment,
3982 lang_output_section_statement_type *output_section)
252b5132 3983{
3b83e13a
NC
3984 unsigned int i;
3985 bfd_boolean is_dot;
3986 bfd_boolean computation_is_valid = TRUE;
afd7a018 3987 etree_type *tree;
8658f989 3988 asection *osec;
252b5132
RH
3989
3990 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
3991 print_space ();
3992
afd7a018
AM
3993 if (assignment->exp->type.node_class == etree_assert)
3994 {
3b83e13a 3995 is_dot = FALSE;
afd7a018 3996 tree = assignment->exp->assert_s.child;
3b83e13a 3997 computation_is_valid = TRUE;
afd7a018
AM
3998 }
3999 else
4000 {
4001 const char *dst = assignment->exp->assign.dst;
3b83e13a
NC
4002
4003 is_dot = (dst[0] == '.' && dst[1] == 0);
afd7a018 4004 tree = assignment->exp->assign.src;
e759c116 4005 computation_is_valid = is_dot || !scan_for_self_assignment (dst, tree);
afd7a018
AM
4006 }
4007
8658f989
AM
4008 osec = output_section->bfd_section;
4009 if (osec == NULL)
4010 osec = bfd_abs_section_ptr;
4011 exp_fold_tree (tree, osec, &print_dot);
e9ee469a 4012 if (expld.result.valid_p)
7b17f854 4013 {
7b17f854
RS
4014 bfd_vma value;
4015
3b83e13a
NC
4016 if (computation_is_valid)
4017 {
e9ee469a 4018 value = expld.result.value;
10dbd1f3 4019
7542af2a 4020 if (expld.result.section != NULL)
e9ee469a 4021 value += expld.result.section->vma;
7b17f854 4022
3b83e13a
NC
4023 minfo ("0x%V", value);
4024 if (is_dot)
4025 print_dot = value;
4026 }
4027 else
4028 {
4029 struct bfd_link_hash_entry *h;
4030
4031 h = bfd_link_hash_lookup (link_info.hash, assignment->exp->assign.dst,
4032 FALSE, FALSE, TRUE);
4033 if (h)
4034 {
10dbd1f3
NC
4035 value = h->u.def.value;
4036
7542af2a 4037 if (expld.result.section != NULL)
a1438fce 4038 value += expld.result.section->vma;
3b83e13a
NC
4039
4040 minfo ("[0x%V]", value);
4041 }
4042 else
4043 minfo ("[unresolved]");
4044 }
7b17f854 4045 }
252b5132
RH
4046 else
4047 {
4048 minfo ("*undef* ");
4049#ifdef BFD64
4050 minfo (" ");
4051#endif
4052 }
4053
4054 minfo (" ");
252b5132 4055 exp_print_tree (assignment->exp);
252b5132
RH
4056 print_nl ();
4057}
4058
4059static void
1579bae1 4060print_input_statement (lang_input_statement_type *statm)
252b5132 4061{
967928e9
AM
4062 if (statm->filename != NULL
4063 && (statm->the_bfd == NULL
4064 || (statm->the_bfd->flags & BFD_LINKER_CREATED) == 0))
906e58ca 4065 fprintf (config.map_file, "LOAD %s\n", statm->filename);
252b5132
RH
4066}
4067
4068/* Print all symbols defined in a particular section. This is called
35835446 4069 via bfd_link_hash_traverse, or by print_all_symbols. */
252b5132 4070
b34976b6 4071static bfd_boolean
1579bae1 4072print_one_symbol (struct bfd_link_hash_entry *hash_entry, void *ptr)
252b5132 4073{
1e9cc1c2 4074 asection *sec = (asection *) ptr;
252b5132
RH
4075
4076 if ((hash_entry->type == bfd_link_hash_defined
4077 || hash_entry->type == bfd_link_hash_defweak)
4078 && sec == hash_entry->u.def.section)
4079 {
4080 int i;
4081
4082 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4083 print_space ();
4084 minfo ("0x%V ",
4085 (hash_entry->u.def.value
4086 + hash_entry->u.def.section->output_offset
4087 + hash_entry->u.def.section->output_section->vma));
4088
4089 minfo (" %T\n", hash_entry->root.string);
4090 }
4091
b34976b6 4092 return TRUE;
252b5132
RH
4093}
4094
02688209
TG
4095static int
4096hash_entry_addr_cmp (const void *a, const void *b)
4097{
4098 const struct bfd_link_hash_entry *l = *(const struct bfd_link_hash_entry **)a;
4099 const struct bfd_link_hash_entry *r = *(const struct bfd_link_hash_entry **)b;
4100
4101 if (l->u.def.value < r->u.def.value)
4102 return -1;
4103 else if (l->u.def.value > r->u.def.value)
4104 return 1;
4105 else
4106 return 0;
4107}
4108
35835446 4109static void
e0f6802f 4110print_all_symbols (asection *sec)
35835446 4111{
1e9cc1c2
NC
4112 struct fat_user_section_struct *ud =
4113 (struct fat_user_section_struct *) get_userdata (sec);
35835446 4114 struct map_symbol_def *def;
02688209
TG
4115 struct bfd_link_hash_entry **entries;
4116 unsigned int i;
35835446 4117
afd7a018
AM
4118 if (!ud)
4119 return;
4120
35835446 4121 *ud->map_symbol_def_tail = 0;
1e0061d2 4122
02688209 4123 /* Sort the symbols by address. */
1e9cc1c2
NC
4124 entries = (struct bfd_link_hash_entry **)
4125 obstack_alloc (&map_obstack, ud->map_symbol_def_count * sizeof (*entries));
02688209
TG
4126
4127 for (i = 0, def = ud->map_symbol_def_head; def; def = def->next, i++)
4128 entries[i] = def->entry;
4129
4130 qsort (entries, ud->map_symbol_def_count, sizeof (*entries),
4131 hash_entry_addr_cmp);
4132
4133 /* Print the symbols. */
4134 for (i = 0; i < ud->map_symbol_def_count; i++)
4135 print_one_symbol (entries[i], sec);
4136
4137 obstack_free (&map_obstack, entries);
35835446
JR
4138}
4139
252b5132
RH
4140/* Print information about an input section to the map file. */
4141
4142static void
d64703c6 4143print_input_section (asection *i, bfd_boolean is_discarded)
252b5132 4144{
eea6121a 4145 bfd_size_type size = i->size;
abe6ac95
AM
4146 int len;
4147 bfd_vma addr;
e5caa5e0
AM
4148
4149 init_opb ();
4d4920ec 4150
abe6ac95
AM
4151 print_space ();
4152 minfo ("%s", i->name);
252b5132 4153
abe6ac95
AM
4154 len = 1 + strlen (i->name);
4155 if (len >= SECTION_NAME_MAP_LENGTH - 1)
4156 {
4157 print_nl ();
4158 len = 0;
4159 }
4160 while (len < SECTION_NAME_MAP_LENGTH)
4161 {
57ceae94 4162 print_space ();
abe6ac95
AM
4163 ++len;
4164 }
252b5132 4165
f13a99db
AM
4166 if (i->output_section != NULL
4167 && i->output_section->owner == link_info.output_bfd)
abe6ac95
AM
4168 addr = i->output_section->vma + i->output_offset;
4169 else
4170 {
4171 addr = print_dot;
d64703c6
TG
4172 if (!is_discarded)
4173 size = 0;
abe6ac95 4174 }
252b5132 4175
abe6ac95 4176 minfo ("0x%V %W %B\n", addr, TO_ADDR (size), i->owner);
252b5132 4177
abe6ac95
AM
4178 if (size != i->rawsize && i->rawsize != 0)
4179 {
4180 len = SECTION_NAME_MAP_LENGTH + 3;
252b5132 4181#ifdef BFD64
abe6ac95 4182 len += 16;
252b5132 4183#else
abe6ac95 4184 len += 8;
252b5132 4185#endif
abe6ac95
AM
4186 while (len > 0)
4187 {
4188 print_space ();
4189 --len;
57ceae94
AM
4190 }
4191
abe6ac95
AM
4192 minfo (_("%W (size before relaxing)\n"), i->rawsize);
4193 }
252b5132 4194
f13a99db
AM
4195 if (i->output_section != NULL
4196 && i->output_section->owner == link_info.output_bfd)
abe6ac95 4197 {
c0f00686 4198 if (link_info.reduce_memory_overheads)
abe6ac95
AM
4199 bfd_link_hash_traverse (link_info.hash, print_one_symbol, i);
4200 else
4201 print_all_symbols (i);
4202
5590fba9
NC
4203 /* Update print_dot, but make sure that we do not move it
4204 backwards - this could happen if we have overlays and a
4205 later overlay is shorter than an earier one. */
4206 if (addr + TO_ADDR (size) > print_dot)
4207 print_dot = addr + TO_ADDR (size);
252b5132
RH
4208 }
4209}
4210
4211static void
1579bae1 4212print_fill_statement (lang_fill_statement_type *fill)
252b5132 4213{
2c382fb6
AM
4214 size_t size;
4215 unsigned char *p;
4216 fputs (" FILL mask 0x", config.map_file);
4217 for (p = fill->fill->data, size = fill->fill->size; size != 0; p++, size--)
4218 fprintf (config.map_file, "%02x", *p);
4219 fputs ("\n", config.map_file);
252b5132
RH
4220}
4221
4222static void
1579bae1 4223print_data_statement (lang_data_statement_type *data)
252b5132
RH
4224{
4225 int i;
4226 bfd_vma addr;
4227 bfd_size_type size;
4228 const char *name;
4229
e5caa5e0 4230 init_opb ();
252b5132
RH
4231 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4232 print_space ();
4233
7fabd029 4234 addr = data->output_offset;
252b5132
RH
4235 if (data->output_section != NULL)
4236 addr += data->output_section->vma;
4237
4238 switch (data->type)
4239 {
4240 default:
4241 abort ();
4242 case BYTE:
4243 size = BYTE_SIZE;
4244 name = "BYTE";
4245 break;
4246 case SHORT:
4247 size = SHORT_SIZE;
4248 name = "SHORT";
4249 break;
4250 case LONG:
4251 size = LONG_SIZE;
4252 name = "LONG";
4253 break;
4254 case QUAD:
4255 size = QUAD_SIZE;
4256 name = "QUAD";
4257 break;
4258 case SQUAD:
4259 size = QUAD_SIZE;
4260 name = "SQUAD";
4261 break;
4262 }
4263
4264 minfo ("0x%V %W %s 0x%v", addr, size, name, data->value);
4265
4266 if (data->exp->type.node_class != etree_value)
4267 {
4268 print_space ();
4269 exp_print_tree (data->exp);
4270 }
4271
4272 print_nl ();
4273
e5caa5e0 4274 print_dot = addr + TO_ADDR (size);
252b5132
RH
4275}
4276
4277/* Print an address statement. These are generated by options like
4278 -Ttext. */
4279
4280static void
1579bae1 4281print_address_statement (lang_address_statement_type *address)
252b5132
RH
4282{
4283 minfo (_("Address of section %s set to "), address->section_name);
4284 exp_print_tree (address->address);
4285 print_nl ();
4286}
4287
4288/* Print a reloc statement. */
4289
4290static void
1579bae1 4291print_reloc_statement (lang_reloc_statement_type *reloc)
252b5132
RH
4292{
4293 int i;
4294 bfd_vma addr;
4295 bfd_size_type size;
4296
e5caa5e0 4297 init_opb ();
252b5132
RH
4298 for (i = 0; i < SECTION_NAME_MAP_LENGTH; i++)
4299 print_space ();
4300
7fabd029 4301 addr = reloc->output_offset;
252b5132
RH
4302 if (reloc->output_section != NULL)
4303 addr += reloc->output_section->vma;
4304
4305 size = bfd_get_reloc_size (reloc->howto);
4306
4307 minfo ("0x%V %W RELOC %s ", addr, size, reloc->howto->name);
4308
4309 if (reloc->name != NULL)
4310 minfo ("%s+", reloc->name);
4311 else
4312 minfo ("%s+", reloc->section->name);
4313
4314 exp_print_tree (reloc->addend_exp);
4315
4316 print_nl ();
4317
e5caa5e0 4318 print_dot = addr + TO_ADDR (size);
5f992e62 4319}
252b5132
RH
4320
4321static void
1579bae1 4322print_padding_statement (lang_padding_statement_type *s)
252b5132
RH
4323{
4324 int len;
4325 bfd_vma addr;
4326
e5caa5e0 4327 init_opb ();
252b5132
RH
4328 minfo (" *fill*");
4329
4330 len = sizeof " *fill*" - 1;
4331 while (len < SECTION_NAME_MAP_LENGTH)
4332 {
4333 print_space ();
4334 ++len;
4335 }
4336
4337 addr = s->output_offset;
4338 if (s->output_section != NULL)
4339 addr += s->output_section->vma;
5f9b8920 4340 minfo ("0x%V %W ", addr, (bfd_vma) s->size);
252b5132 4341
2c382fb6
AM
4342 if (s->fill->size != 0)
4343 {
4344 size_t size;
4345 unsigned char *p;
4346 for (p = s->fill->data, size = s->fill->size; size != 0; p++, size--)
4347 fprintf (config.map_file, "%02x", *p);
4348 }
252b5132
RH
4349
4350 print_nl ();
4351
e5caa5e0 4352 print_dot = addr + TO_ADDR (s->size);
252b5132
RH
4353}
4354
4355static void
1579bae1
AM
4356print_wild_statement (lang_wild_statement_type *w,
4357 lang_output_section_statement_type *os)
252b5132 4358{
b6bf44ba
AM
4359 struct wildcard_list *sec;
4360
252b5132
RH
4361 print_space ();
4362
4363 if (w->filenames_sorted)
4364 minfo ("SORT(");
08da4cac 4365 if (w->filename != NULL)
252b5132
RH
4366 minfo ("%s", w->filename);
4367 else
4368 minfo ("*");
4369 if (w->filenames_sorted)
4370 minfo (")");
4371
4372 minfo ("(");
b6bf44ba
AM
4373 for (sec = w->section_list; sec; sec = sec->next)
4374 {
4375 if (sec->spec.sorted)
4376 minfo ("SORT(");
4377 if (sec->spec.exclude_name_list != NULL)
4378 {
4379 name_list *tmp;
34786259 4380 minfo ("EXCLUDE_FILE(%s", sec->spec.exclude_name_list->name);
b6bf44ba 4381 for (tmp = sec->spec.exclude_name_list->next; tmp; tmp = tmp->next)
34786259
AM
4382 minfo (" %s", tmp->name);
4383 minfo (") ");
b6bf44ba
AM
4384 }
4385 if (sec->spec.name != NULL)
4386 minfo ("%s", sec->spec.name);
4387 else
4388 minfo ("*");
4389 if (sec->spec.sorted)
4390 minfo (")");
34786259
AM
4391 if (sec->next)
4392 minfo (" ");
b6bf44ba 4393 }
252b5132
RH
4394 minfo (")");
4395
4396 print_nl ();
4397
4398 print_statement_list (w->children.head, os);
4399}
4400
4401/* Print a group statement. */
4402
4403static void
1579bae1
AM
4404print_group (lang_group_statement_type *s,
4405 lang_output_section_statement_type *os)
252b5132
RH
4406{
4407 fprintf (config.map_file, "START GROUP\n");
4408 print_statement_list (s->children.head, os);
4409 fprintf (config.map_file, "END GROUP\n");
4410}
4411
4412/* Print the list of statements in S.
4413 This can be called for any statement type. */
4414
4415static void
1579bae1
AM
4416print_statement_list (lang_statement_union_type *s,
4417 lang_output_section_statement_type *os)
252b5132
RH
4418{
4419 while (s != NULL)
4420 {
4421 print_statement (s, os);
bba1a0c0 4422 s = s->header.next;
252b5132
RH
4423 }
4424}
4425
4426/* Print the first statement in statement list S.
4427 This can be called for any statement type. */
4428
4429static void
1579bae1
AM
4430print_statement (lang_statement_union_type *s,
4431 lang_output_section_statement_type *os)
252b5132
RH
4432{
4433 switch (s->header.type)
4434 {
4435 default:
4436 fprintf (config.map_file, _("Fail with %d\n"), s->header.type);
4437 FAIL ();
4438 break;
4439 case lang_constructors_statement_enum:
4440 if (constructor_list.head != NULL)
4441 {
4442 if (constructors_sorted)
4443 minfo (" SORT (CONSTRUCTORS)\n");
4444 else
4445 minfo (" CONSTRUCTORS\n");
4446 print_statement_list (constructor_list.head, os);
4447 }
4448 break;
4449 case lang_wild_statement_enum:
4450 print_wild_statement (&s->wild_statement, os);
4451 break;
4452 case lang_address_statement_enum:
4453 print_address_statement (&s->address_statement);
4454 break;
4455 case lang_object_symbols_statement_enum:
4456 minfo (" CREATE_OBJECT_SYMBOLS\n");
4457 break;
4458 case lang_fill_statement_enum:
4459 print_fill_statement (&s->fill_statement);
4460 break;
4461 case lang_data_statement_enum:
4462 print_data_statement (&s->data_statement);
4463 break;
4464 case lang_reloc_statement_enum:
4465 print_reloc_statement (&s->reloc_statement);
4466 break;
4467 case lang_input_section_enum:
d64703c6 4468 print_input_section (s->input_section.section, FALSE);
252b5132
RH
4469 break;
4470 case lang_padding_statement_enum:
4471 print_padding_statement (&s->padding_statement);
4472 break;
4473 case lang_output_section_statement_enum:
4474 print_output_section_statement (&s->output_section_statement);
4475 break;
4476 case lang_assignment_statement_enum:
4477 print_assignment (&s->assignment_statement, os);
4478 break;
4479 case lang_target_statement_enum:
4480 fprintf (config.map_file, "TARGET(%s)\n", s->target_statement.target);
4481 break;
4482 case lang_output_statement_enum:
4483 minfo ("OUTPUT(%s", s->output_statement.name);
4484 if (output_target != NULL)
4485 minfo (" %s", output_target);
4486 minfo (")\n");
4487 break;
4488 case lang_input_statement_enum:
4489 print_input_statement (&s->input_statement);
4490 break;
4491 case lang_group_statement_enum:
4492 print_group (&s->group_statement, os);
4493 break;
53d25da6
AM
4494 case lang_insert_statement_enum:
4495 minfo ("INSERT %s %s\n",
4496 s->insert_statement.is_before ? "BEFORE" : "AFTER",
4497 s->insert_statement.where);
4498 break;
252b5132
RH
4499 }
4500}
4501
4502static void
1579bae1 4503print_statements (void)
252b5132
RH
4504{
4505 print_statement_list (statement_list.head, abs_output_section);
4506}
4507
4508/* Print the first N statements in statement list S to STDERR.
4509 If N == 0, nothing is printed.
4510 If N < 0, the entire list is printed.
4511 Intended to be called from GDB. */
4512
4513void
1579bae1 4514dprint_statement (lang_statement_union_type *s, int n)
252b5132
RH
4515{
4516 FILE *map_save = config.map_file;
4517
4518 config.map_file = stderr;
4519
4520 if (n < 0)
4521 print_statement_list (s, abs_output_section);
4522 else
4523 {
4524 while (s && --n >= 0)
4525 {
4526 print_statement (s, abs_output_section);
bba1a0c0 4527 s = s->header.next;
252b5132
RH
4528 }
4529 }
4530
4531 config.map_file = map_save;
4532}
4533
b3327aad 4534static void
1579bae1
AM
4535insert_pad (lang_statement_union_type **ptr,
4536 fill_type *fill,
4537 unsigned int alignment_needed,
4538 asection *output_section,
4539 bfd_vma dot)
252b5132 4540{
2c382fb6 4541 static fill_type zero_fill = { 1, { 0 } };
e9ee469a 4542 lang_statement_union_type *pad = NULL;
b3327aad 4543
e9ee469a
AM
4544 if (ptr != &statement_list.head)
4545 pad = ((lang_statement_union_type *)
4546 ((char *) ptr - offsetof (lang_statement_union_type, header.next)));
4547 if (pad != NULL
4548 && pad->header.type == lang_padding_statement_enum
4549 && pad->padding_statement.output_section == output_section)
4550 {
4551 /* Use the existing pad statement. */
4552 }
4553 else if ((pad = *ptr) != NULL
906e58ca
NC
4554 && pad->header.type == lang_padding_statement_enum
4555 && pad->padding_statement.output_section == output_section)
252b5132 4556 {
e9ee469a 4557 /* Use the existing pad statement. */
252b5132 4558 }
b3327aad 4559 else
252b5132 4560 {
b3327aad 4561 /* Make a new padding statement, linked into existing chain. */
1e9cc1c2
NC
4562 pad = (lang_statement_union_type *)
4563 stat_alloc (sizeof (lang_padding_statement_type));
b3327aad
AM
4564 pad->header.next = *ptr;
4565 *ptr = pad;
4566 pad->header.type = lang_padding_statement_enum;
4567 pad->padding_statement.output_section = output_section;
1579bae1 4568 if (fill == NULL)
2c382fb6 4569 fill = &zero_fill;
b3327aad 4570 pad->padding_statement.fill = fill;
252b5132 4571 }
b3327aad
AM
4572 pad->padding_statement.output_offset = dot - output_section->vma;
4573 pad->padding_statement.size = alignment_needed;
eea6121a 4574 output_section->size += alignment_needed;
252b5132
RH
4575}
4576
08da4cac
KH
4577/* Work out how much this section will move the dot point. */
4578
252b5132 4579static bfd_vma
6feb9908
AM
4580size_input_section
4581 (lang_statement_union_type **this_ptr,
4582 lang_output_section_statement_type *output_section_statement,
4583 fill_type *fill,
4584 bfd_vma dot)
252b5132
RH
4585{
4586 lang_input_section_type *is = &((*this_ptr)->input_section);
4587 asection *i = is->section;
4588
7b986e99
AM
4589 if (!((lang_input_statement_type *) i->owner->usrdata)->just_syms_flag
4590 && (i->flags & SEC_EXCLUDE) == 0)
252b5132 4591 {
b3327aad
AM
4592 unsigned int alignment_needed;
4593 asection *o;
4594
4595 /* Align this section first to the input sections requirement,
4596 then to the output section's requirement. If this alignment
4597 is greater than any seen before, then record it too. Perform
4598 the alignment by inserting a magic 'padding' statement. */
4599
252b5132 4600 if (output_section_statement->subsection_alignment != -1)
b3327aad
AM
4601 i->alignment_power = output_section_statement->subsection_alignment;
4602
4603 o = output_section_statement->bfd_section;
4604 if (o->alignment_power < i->alignment_power)
4605 o->alignment_power = i->alignment_power;
252b5132 4606
b3327aad
AM
4607 alignment_needed = align_power (dot, i->alignment_power) - dot;
4608
4609 if (alignment_needed != 0)
4610 {
e5caa5e0 4611 insert_pad (this_ptr, fill, TO_SIZE (alignment_needed), o, dot);
b3327aad
AM
4612 dot += alignment_needed;
4613 }
252b5132 4614
08da4cac 4615 /* Remember where in the output section this input section goes. */
252b5132 4616
b3327aad 4617 i->output_offset = dot - o->vma;
252b5132 4618
08da4cac 4619 /* Mark how big the output section must be to contain this now. */
eea6121a
AM
4620 dot += TO_ADDR (i->size);
4621 o->size = TO_SIZE (dot - o->vma);
252b5132
RH
4622 }
4623 else
4624 {
4625 i->output_offset = i->vma - output_section_statement->bfd_section->vma;
4626 }
4627
4628 return dot;
4629}
4630
5daa8fe7
L
4631static int
4632sort_sections_by_lma (const void *arg1, const void *arg2)
4633{
4634 const asection *sec1 = *(const asection **) arg1;
4635 const asection *sec2 = *(const asection **) arg2;
4636
4637 if (bfd_section_lma (sec1->owner, sec1)
4638 < bfd_section_lma (sec2->owner, sec2))
4639 return -1;
4640 else if (bfd_section_lma (sec1->owner, sec1)
4641 > bfd_section_lma (sec2->owner, sec2))
4642 return 1;
7f6a71ff
JM
4643 else if (sec1->id < sec2->id)
4644 return -1;
4645 else if (sec1->id > sec2->id)
4646 return 1;
5daa8fe7
L
4647
4648 return 0;
4649}
4650
eea6121a 4651#define IGNORE_SECTION(s) \
f4eaaf7f
AM
4652 ((s->flags & SEC_ALLOC) == 0 \
4653 || ((s->flags & SEC_THREAD_LOCAL) != 0 \
de7f8cc8 4654 && (s->flags & SEC_LOAD) == 0))
d1778b88 4655
252b5132 4656/* Check to see if any allocated sections overlap with other allocated
afd7a018 4657 sections. This can happen if a linker script specifies the output
20e56351
DJ
4658 section addresses of the two sections. Also check whether any memory
4659 region has overflowed. */
08da4cac 4660
252b5132 4661static void
1579bae1 4662lang_check_section_addresses (void)
252b5132 4663{
f4427a75 4664 asection *s, *p;
5daa8fe7
L
4665 asection **sections, **spp;
4666 unsigned int count;
4667 bfd_vma s_start;
4668 bfd_vma s_end;
f4427a75
AM
4669 bfd_vma p_start;
4670 bfd_vma p_end;
5daa8fe7 4671 bfd_size_type amt;
20e56351 4672 lang_memory_region_type *m;
5daa8fe7 4673
f13a99db 4674 if (bfd_count_sections (link_info.output_bfd) <= 1)
5daa8fe7
L
4675 return;
4676
f13a99db 4677 amt = bfd_count_sections (link_info.output_bfd) * sizeof (asection *);
1e9cc1c2 4678 sections = (asection **) xmalloc (amt);
252b5132
RH
4679
4680 /* Scan all sections in the output list. */
5daa8fe7 4681 count = 0;
f13a99db 4682 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
33275c22 4683 {
5daa8fe7 4684 /* Only consider loadable sections with real contents. */
f4eaaf7f 4685 if (!(s->flags & SEC_LOAD)
e50d6125 4686 || !(s->flags & SEC_ALLOC)
ec6d26be 4687 || s->size == 0)
33275c22 4688 continue;
5f992e62 4689
5daa8fe7
L
4690 sections[count] = s;
4691 count++;
4692 }
329c1c86 4693
5daa8fe7
L
4694 if (count <= 1)
4695 return;
5f992e62 4696
5daa8fe7
L
4697 qsort (sections, (size_t) count, sizeof (asection *),
4698 sort_sections_by_lma);
5f992e62 4699
5daa8fe7
L
4700 spp = sections;
4701 s = *spp++;
f4427a75 4702 s_start = s->lma;
5daa8fe7
L
4703 s_end = s_start + TO_ADDR (s->size) - 1;
4704 for (count--; count; count--)
4705 {
4706 /* We must check the sections' LMA addresses not their VMA
4707 addresses because overlay sections can have overlapping VMAs
4708 but they must have distinct LMAs. */
f4427a75
AM
4709 p = s;
4710 p_start = s_start;
4711 p_end = s_end;
5daa8fe7 4712 s = *spp++;
f4427a75 4713 s_start = s->lma;
5daa8fe7 4714 s_end = s_start + TO_ADDR (s->size) - 1;
5f992e62 4715
f4427a75
AM
4716 /* Look for an overlap. We have sorted sections by lma, so we
4717 know that s_start >= p_start. Besides the obvious case of
4718 overlap when the current section starts before the previous
4719 one ends, we also must have overlap if the previous section
4720 wraps around the address space. */
4721 if (s_start <= p_end
4722 || p_end < p_start)
ec6d26be 4723 einfo (_("%X%P: section %s loaded at [%V,%V] overlaps section %s loaded at [%V,%V]\n"),
f4427a75 4724 s->name, s_start, s_end, p->name, p_start, p_end);
33275c22 4725 }
5daa8fe7
L
4726
4727 free (sections);
20e56351
DJ
4728
4729 /* If any memory region has overflowed, report by how much.
4730 We do not issue this diagnostic for regions that had sections
4731 explicitly placed outside their bounds; os_region_check's
4732 diagnostics are adequate for that case.
4733
4734 FIXME: It is conceivable that m->current - (m->origin + m->length)
4735 might overflow a 32-bit integer. There is, alas, no way to print
4736 a bfd_vma quantity in decimal. */
4737 for (m = lang_memory_region_list; m; m = m->next)
4738 if (m->had_full_message)
4a93e180
NC
4739 einfo (_("%X%P: region `%s' overflowed by %ld bytes\n"),
4740 m->name_list.name, (long)(m->current - (m->origin + m->length)));
20e56351 4741
252b5132
RH
4742}
4743
562d3460
TW
4744/* Make sure the new address is within the region. We explicitly permit the
4745 current address to be at the exact end of the region when the address is
4746 non-zero, in case the region is at the end of addressable memory and the
5f992e62 4747 calculation wraps around. */
562d3460
TW
4748
4749static void
1579bae1 4750os_region_check (lang_output_section_statement_type *os,
6bdafbeb 4751 lang_memory_region_type *region,
1579bae1 4752 etree_type *tree,
91d6fa6a 4753 bfd_vma rbase)
562d3460
TW
4754{
4755 if ((region->current < region->origin
4756 || (region->current - region->origin > region->length))
4757 && ((region->current != region->origin + region->length)
91d6fa6a 4758 || rbase == 0))
562d3460 4759 {
1579bae1 4760 if (tree != NULL)
b7a26f91 4761 {
4a93e180
NC
4762 einfo (_("%X%P: address 0x%v of %B section `%s'"
4763 " is not within region `%s'\n"),
b7a26f91
KH
4764 region->current,
4765 os->bfd_section->owner,
4766 os->bfd_section->name,
4a93e180 4767 region->name_list.name);
b7a26f91 4768 }
20e56351 4769 else if (!region->had_full_message)
b7a26f91 4770 {
20e56351
DJ
4771 region->had_full_message = TRUE;
4772
4a93e180 4773 einfo (_("%X%P: %B section `%s' will not fit in region `%s'\n"),
b7a26f91 4774 os->bfd_section->owner,
20e56351 4775 os->bfd_section->name,
4a93e180 4776 region->name_list.name);
b7a26f91 4777 }
562d3460
TW
4778 }
4779}
4780
252b5132
RH
4781/* Set the sizes for all the output sections. */
4782
2d20f7bf 4783static bfd_vma
1579bae1 4784lang_size_sections_1
e535e147 4785 (lang_statement_union_type **prev,
1579bae1 4786 lang_output_section_statement_type *output_section_statement,
1579bae1
AM
4787 fill_type *fill,
4788 bfd_vma dot,
4789 bfd_boolean *relax,
4790 bfd_boolean check_regions)
252b5132 4791{
e535e147
AM
4792 lang_statement_union_type *s;
4793
252b5132 4794 /* Size up the sections from their constituent parts. */
e535e147 4795 for (s = *prev; s != NULL; s = s->header.next)
252b5132
RH
4796 {
4797 switch (s->header.type)
4798 {
4799 case lang_output_section_statement_enum:
4800 {
e9ee469a 4801 bfd_vma newdot, after;
d1778b88 4802 lang_output_section_statement_type *os;
cde9e0be 4803 lang_memory_region_type *r;
c5b0a9ef 4804 int section_alignment = 0;
252b5132 4805
d1778b88 4806 os = &s->output_section_statement;
8658f989
AM
4807 if (os->constraint == -1)
4808 break;
4809
fd68d03d
AM
4810 /* FIXME: We shouldn't need to zero section vmas for ld -r
4811 here, in lang_insert_orphan, or in the default linker scripts.
4812 This is covering for coff backend linker bugs. See PR6945. */
4813 if (os->addr_tree == NULL
4814 && link_info.relocatable
4815 && (bfd_get_flavour (link_info.output_bfd)
4816 == bfd_target_coff_flavour))
eceda120 4817 os->addr_tree = exp_intop (0);
a5df8c84
AM
4818 if (os->addr_tree != NULL)
4819 {
cde9e0be 4820 os->processed_vma = FALSE;
a5df8c84 4821 exp_fold_tree (os->addr_tree, bfd_abs_section_ptr, &dot);
a5df8c84 4822
3bf9618b 4823 if (expld.result.valid_p)
7542af2a
AM
4824 {
4825 dot = expld.result.value;
4826 if (expld.result.section != NULL)
4827 dot += expld.result.section->vma;
4828 }
3bf9618b 4829 else if (expld.phase != lang_mark_phase_enum)
a5df8c84
AM
4830 einfo (_("%F%S: non constant or forward reference"
4831 " address expression for section %s\n"),
4832 os->name);
a5df8c84
AM
4833 }
4834
e9ee469a 4835 if (os->bfd_section == NULL)
75ff4589 4836 /* This section was removed or never actually created. */
252b5132
RH
4837 break;
4838
4839 /* If this is a COFF shared library section, use the size and
4840 address from the input section. FIXME: This is COFF
4841 specific; it would be cleaner if there were some other way
4842 to do this, but nothing simple comes to mind. */
f13a99db
AM
4843 if (((bfd_get_flavour (link_info.output_bfd)
4844 == bfd_target_ecoff_flavour)
4845 || (bfd_get_flavour (link_info.output_bfd)
4846 == bfd_target_coff_flavour))
ebe372c1 4847 && (os->bfd_section->flags & SEC_COFF_SHARED_LIBRARY) != 0)
252b5132 4848 {
08da4cac 4849 asection *input;
252b5132
RH
4850
4851 if (os->children.head == NULL
bba1a0c0 4852 || os->children.head->header.next != NULL
6feb9908
AM
4853 || (os->children.head->header.type
4854 != lang_input_section_enum))
4855 einfo (_("%P%X: Internal error on COFF shared library"
4856 " section %s\n"), os->name);
252b5132
RH
4857
4858 input = os->children.head->input_section.section;
4859 bfd_set_section_vma (os->bfd_section->owner,
4860 os->bfd_section,
4861 bfd_section_vma (input->owner, input));
eea6121a 4862 os->bfd_section->size = input->size;
252b5132
RH
4863 break;
4864 }
4865
a5df8c84 4866 newdot = dot;
252b5132
RH
4867 if (bfd_is_abs_section (os->bfd_section))
4868 {
4869 /* No matter what happens, an abs section starts at zero. */
4870 ASSERT (os->bfd_section->vma == 0);
4871 }
4872 else
4873 {
1579bae1 4874 if (os->addr_tree == NULL)
252b5132
RH
4875 {
4876 /* No address specified for this section, get one
4877 from the region specification. */
1579bae1 4878 if (os->region == NULL
6feb9908 4879 || ((os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD))
4a93e180
NC
4880 && os->region->name_list.name[0] == '*'
4881 && strcmp (os->region->name_list.name,
6feb9908 4882 DEFAULT_MEMORY_REGION) == 0))
252b5132
RH
4883 {
4884 os->region = lang_memory_default (os->bfd_section);
4885 }
4886
4887 /* If a loadable section is using the default memory
4888 region, and some non default memory regions were
66184979 4889 defined, issue an error message. */
f0636a44
AM
4890 if (!os->ignored
4891 && !IGNORE_SECTION (os->bfd_section)
1049f94e 4892 && ! link_info.relocatable
cf888e70 4893 && check_regions
4a93e180 4894 && strcmp (os->region->name_list.name,
6feb9908 4895 DEFAULT_MEMORY_REGION) == 0
252b5132 4896 && lang_memory_region_list != NULL
4a93e180 4897 && (strcmp (lang_memory_region_list->name_list.name,
a747ee4d 4898 DEFAULT_MEMORY_REGION) != 0
e9ee469a
AM
4899 || lang_memory_region_list->next != NULL)
4900 && expld.phase != lang_mark_phase_enum)
66184979
NC
4901 {
4902 /* By default this is an error rather than just a
4903 warning because if we allocate the section to the
4904 default memory region we can end up creating an
07f3b6ad
KH
4905 excessively large binary, or even seg faulting when
4906 attempting to perform a negative seek. See
6feb9908 4907 sources.redhat.com/ml/binutils/2003-04/msg00423.html
66184979
NC
4908 for an example of this. This behaviour can be
4909 overridden by the using the --no-check-sections
4910 switch. */
4911 if (command_line.check_section_addresses)
6feb9908
AM
4912 einfo (_("%P%F: error: no memory region specified"
4913 " for loadable section `%s'\n"),
f13a99db 4914 bfd_get_section_name (link_info.output_bfd,
66184979
NC
4915 os->bfd_section));
4916 else
6feb9908
AM
4917 einfo (_("%P: warning: no memory region specified"
4918 " for loadable section `%s'\n"),
f13a99db 4919 bfd_get_section_name (link_info.output_bfd,
66184979
NC
4920 os->bfd_section));
4921 }
252b5132 4922
e9ee469a 4923 newdot = os->region->current;
c5b0a9ef 4924 section_alignment = os->bfd_section->alignment_power;
252b5132 4925 }
94b50910 4926 else
c5b0a9ef 4927 section_alignment = os->section_alignment;
5f992e62 4928
7270c5ed 4929 /* Align to what the section needs. */
c5b0a9ef 4930 if (section_alignment > 0)
94b50910
AM
4931 {
4932 bfd_vma savedot = newdot;
c5b0a9ef 4933 newdot = align_power (newdot, section_alignment);
252b5132 4934
94b50910
AM
4935 if (newdot != savedot
4936 && (config.warn_section_align
4937 || os->addr_tree != NULL)
4938 && expld.phase != lang_mark_phase_enum)
4939 einfo (_("%P: warning: changing start of section"
4940 " %s by %lu bytes\n"),
4941 os->name, (unsigned long) (newdot - savedot));
4942 }
252b5132 4943
eceda120 4944 bfd_set_section_vma (0, os->bfd_section, newdot);
5f992e62 4945
252b5132
RH
4946 os->bfd_section->output_offset = 0;
4947 }
4948
e535e147 4949 lang_size_sections_1 (&os->children.head, os,
e9ee469a
AM
4950 os->fill, newdot, relax, check_regions);
4951
cde9e0be 4952 os->processed_vma = TRUE;
e9ee469a
AM
4953
4954 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
2f475487
AM
4955 /* Except for some special linker created sections,
4956 no output section should change from zero size
4957 after strip_excluded_output_sections. A non-zero
4958 size on an ignored section indicates that some
4959 input section was not sized early enough. */
4960 ASSERT (os->bfd_section->size == 0);
cde9e0be 4961 else
e9ee469a 4962 {
cde9e0be
AM
4963 dot = os->bfd_section->vma;
4964
4965 /* Put the section within the requested block size, or
4966 align at the block boundary. */
4967 after = ((dot
4968 + TO_ADDR (os->bfd_section->size)
4969 + os->block_value - 1)
4970 & - (bfd_vma) os->block_value);
4971
4972 os->bfd_section->size = TO_SIZE (after - os->bfd_section->vma);
4973 }
4974
4975 /* Set section lma. */
4976 r = os->region;
4977 if (r == NULL)
4978 r = lang_memory_region_lookup (DEFAULT_MEMORY_REGION, FALSE);
4979
4980 if (os->load_base)
4981 {
4982 bfd_vma lma = exp_get_abs_int (os->load_base, 0, "load base");
4983 os->bfd_section->lma = lma;
e9ee469a 4984 }
07dfcf38 4985 else if (os->lma_region != NULL)
cde9e0be
AM
4986 {
4987 bfd_vma lma = os->lma_region->current;
e9ee469a 4988
c5b0a9ef
AM
4989 if (section_alignment > 0)
4990 lma = align_power (lma, section_alignment);
cde9e0be
AM
4991 os->bfd_section->lma = lma;
4992 }
dc0b6aa0
AM
4993 else if (r->last_os != NULL
4994 && (os->bfd_section->flags & SEC_ALLOC) != 0)
cde9e0be
AM
4995 {
4996 bfd_vma lma;
4997 asection *last;
4998
4999 last = r->last_os->output_section_statement.bfd_section;
dc0b6aa0
AM
5000
5001 /* A backwards move of dot should be accompanied by
5002 an explicit assignment to the section LMA (ie.
91eb6c46 5003 os->load_base set) because backwards moves can
dc0b6aa0 5004 create overlapping LMAs. */
264b6205 5005 if (dot < last->vma
91eb6c46
AM
5006 && os->bfd_section->size != 0
5007 && dot + os->bfd_section->size <= last->vma)
dc0b6aa0 5008 {
dc0b6aa0
AM
5009 /* If dot moved backwards then leave lma equal to
5010 vma. This is the old default lma, which might
5011 just happen to work when the backwards move is
91eb6c46
AM
5012 sufficiently large. Nag if this changes anything,
5013 so people can fix their linker scripts. */
5014
5015 if (last->vma != last->lma)
5016 einfo (_("%P: warning: dot moved backwards before `%s'\n"),
5017 os->name);
dc0b6aa0
AM
5018 }
5019 else
cde9e0be 5020 {
152d792f
AM
5021 /* If this is an overlay, set the current lma to that
5022 at the end of the previous section. */
5023 if (os->sectype == overlay_section)
cde9e0be
AM
5024 lma = last->lma + last->size;
5025
5026 /* Otherwise, keep the same lma to vma relationship
5027 as the previous section. */
5028 else
5029 lma = dot + last->lma - last->vma;
5030
c5b0a9ef
AM
5031 if (section_alignment > 0)
5032 lma = align_power (lma, section_alignment);
cde9e0be
AM
5033 os->bfd_section->lma = lma;
5034 }
5035 }
5036 os->processed_lma = TRUE;
5f992e62 5037
cde9e0be
AM
5038 if (bfd_is_abs_section (os->bfd_section) || os->ignored)
5039 break;
252b5132 5040
cde9e0be
AM
5041 /* Keep track of normal sections using the default
5042 lma region. We use this to set the lma for
5043 following sections. Overlays or other linker
5044 script assignment to lma might mean that the
dc0b6aa0
AM
5045 default lma == vma is incorrect.
5046 To avoid warnings about dot moving backwards when using
5047 -Ttext, don't start tracking sections until we find one
5048 of non-zero size or with lma set differently to vma. */
cde9e0be
AM
5049 if (((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5050 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0)
dc0b6aa0
AM
5051 && (os->bfd_section->flags & SEC_ALLOC) != 0
5052 && (os->bfd_section->size != 0
264b6205
AM
5053 || (r->last_os == NULL
5054 && os->bfd_section->vma != os->bfd_section->lma)
5055 || (r->last_os != NULL
5056 && dot >= (r->last_os->output_section_statement
ea0c3cd5 5057 .bfd_section->vma)))
cde9e0be
AM
5058 && os->lma_region == NULL
5059 && !link_info.relocatable)
5060 r->last_os = s;
9f88b410 5061
e5caec89
NS
5062 /* .tbss sections effectively have zero size. */
5063 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5064 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
5065 || link_info.relocatable)
eea6121a 5066 dot += TO_ADDR (os->bfd_section->size);
e5caec89 5067
9f88b410 5068 if (os->update_dot_tree != 0)
e9ee469a 5069 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
9f88b410 5070
252b5132
RH
5071 /* Update dot in the region ?
5072 We only do this if the section is going to be allocated,
5073 since unallocated sections do not contribute to the region's
2e76e85a 5074 overall size in memory. */
1579bae1 5075 if (os->region != NULL
2e76e85a 5076 && (os->bfd_section->flags & (SEC_ALLOC | SEC_LOAD)))
252b5132
RH
5077 {
5078 os->region->current = dot;
5f992e62 5079
cf888e70
NC
5080 if (check_regions)
5081 /* Make sure the new address is within the region. */
5082 os_region_check (os, os->region, os->addr_tree,
5083 os->bfd_section->vma);
08da4cac 5084
a2cab753
NS
5085 if (os->lma_region != NULL && os->lma_region != os->region
5086 && (os->bfd_section->flags & SEC_LOAD))
08da4cac 5087 {
cde9e0be
AM
5088 os->lma_region->current
5089 = os->bfd_section->lma + TO_ADDR (os->bfd_section->size);
66e28d60 5090
cf888e70
NC
5091 if (check_regions)
5092 os_region_check (os, os->lma_region, NULL,
cde9e0be 5093 os->bfd_section->lma);
08da4cac 5094 }
252b5132
RH
5095 }
5096 }
5097 break;
5098
5099 case lang_constructors_statement_enum:
e535e147 5100 dot = lang_size_sections_1 (&constructor_list.head,
2d20f7bf 5101 output_section_statement,
cf888e70 5102 fill, dot, relax, check_regions);
252b5132
RH
5103 break;
5104
5105 case lang_data_statement_enum:
5106 {
5107 unsigned int size = 0;
5108
7fabd029 5109 s->data_statement.output_offset =
08da4cac 5110 dot - output_section_statement->bfd_section->vma;
252b5132
RH
5111 s->data_statement.output_section =
5112 output_section_statement->bfd_section;
5113
1b493742
NS
5114 /* We might refer to provided symbols in the expression, and
5115 need to mark them as needed. */
e9ee469a 5116 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
1b493742 5117
252b5132
RH
5118 switch (s->data_statement.type)
5119 {
08da4cac
KH
5120 default:
5121 abort ();
252b5132
RH
5122 case QUAD:
5123 case SQUAD:
5124 size = QUAD_SIZE;
5125 break;
5126 case LONG:
5127 size = LONG_SIZE;
5128 break;
5129 case SHORT:
5130 size = SHORT_SIZE;
5131 break;
5132 case BYTE:
5133 size = BYTE_SIZE;
5134 break;
5135 }
e5caa5e0
AM
5136 if (size < TO_SIZE ((unsigned) 1))
5137 size = TO_SIZE ((unsigned) 1);
5138 dot += TO_ADDR (size);
eea6121a 5139 output_section_statement->bfd_section->size += size;
252b5132
RH
5140 }
5141 break;
5142
5143 case lang_reloc_statement_enum:
5144 {
5145 int size;
5146
7fabd029 5147 s->reloc_statement.output_offset =
252b5132
RH
5148 dot - output_section_statement->bfd_section->vma;
5149 s->reloc_statement.output_section =
5150 output_section_statement->bfd_section;
5151 size = bfd_get_reloc_size (s->reloc_statement.howto);
e5caa5e0 5152 dot += TO_ADDR (size);
eea6121a 5153 output_section_statement->bfd_section->size += size;
252b5132
RH
5154 }
5155 break;
5f992e62 5156
252b5132 5157 case lang_wild_statement_enum:
e535e147 5158 dot = lang_size_sections_1 (&s->wild_statement.children.head,
2d20f7bf 5159 output_section_statement,
cf888e70 5160 fill, dot, relax, check_regions);
252b5132
RH
5161 break;
5162
5163 case lang_object_symbols_statement_enum:
5164 link_info.create_object_symbols_section =
5165 output_section_statement->bfd_section;
5166 break;
e9ee469a 5167
252b5132
RH
5168 case lang_output_statement_enum:
5169 case lang_target_statement_enum:
5170 break;
e9ee469a 5171
252b5132
RH
5172 case lang_input_section_enum:
5173 {
5174 asection *i;
5175
e535e147 5176 i = s->input_section.section;
eea6121a 5177 if (relax)
252b5132 5178 {
b34976b6 5179 bfd_boolean again;
252b5132
RH
5180
5181 if (! bfd_relax_section (i->owner, i, &link_info, &again))
5182 einfo (_("%P%F: can't relax section: %E\n"));
5183 if (again)
b34976b6 5184 *relax = TRUE;
252b5132 5185 }
b3327aad
AM
5186 dot = size_input_section (prev, output_section_statement,
5187 output_section_statement->fill, dot);
252b5132
RH
5188 }
5189 break;
e9ee469a 5190
252b5132
RH
5191 case lang_input_statement_enum:
5192 break;
e9ee469a 5193
252b5132 5194 case lang_fill_statement_enum:
08da4cac
KH
5195 s->fill_statement.output_section =
5196 output_section_statement->bfd_section;
252b5132
RH
5197
5198 fill = s->fill_statement.fill;
5199 break;
e9ee469a 5200
252b5132
RH
5201 case lang_assignment_statement_enum:
5202 {
5203 bfd_vma newdot = dot;
49c13adb 5204 etree_type *tree = s->assignment_statement.exp;
252b5132 5205
b10a8ae0
L
5206 expld.dataseg.relro = exp_dataseg_relro_none;
5207
49c13adb 5208 exp_fold_tree (tree,
408082ec 5209 output_section_statement->bfd_section,
252b5132
RH
5210 &newdot);
5211
b10a8ae0
L
5212 if (expld.dataseg.relro == exp_dataseg_relro_start)
5213 {
5214 if (!expld.dataseg.relro_start_stat)
5215 expld.dataseg.relro_start_stat = s;
5216 else
5217 {
5218 ASSERT (expld.dataseg.relro_start_stat == s);
5219 }
5220 }
5221 else if (expld.dataseg.relro == exp_dataseg_relro_end)
5222 {
5223 if (!expld.dataseg.relro_end_stat)
5224 expld.dataseg.relro_end_stat = s;
5225 else
5226 {
5227 ASSERT (expld.dataseg.relro_end_stat == s);
5228 }
5229 }
5230 expld.dataseg.relro = exp_dataseg_relro_none;
5231
49c13adb 5232 /* This symbol is relative to this section. */
a14a5de3 5233 if ((tree->type.node_class == etree_provided
49c13adb
L
5234 || tree->type.node_class == etree_assign)
5235 && (tree->assign.dst [0] != '.'
5236 || tree->assign.dst [1] != '\0'))
5237 output_section_statement->section_relative_symbol = 1;
5238
85852e36 5239 if (!output_section_statement->ignored)
252b5132 5240 {
252b5132
RH
5241 if (output_section_statement == abs_output_section)
5242 {
5243 /* If we don't have an output section, then just adjust
5244 the default memory address. */
6feb9908
AM
5245 lang_memory_region_lookup (DEFAULT_MEMORY_REGION,
5246 FALSE)->current = newdot;
252b5132 5247 }
85852e36 5248 else if (newdot != dot)
252b5132 5249 {
b3327aad
AM
5250 /* Insert a pad after this statement. We can't
5251 put the pad before when relaxing, in case the
5252 assignment references dot. */
e5caa5e0 5253 insert_pad (&s->header.next, fill, TO_SIZE (newdot - dot),
b3327aad
AM
5254 output_section_statement->bfd_section, dot);
5255
5256 /* Don't neuter the pad below when relaxing. */
5257 s = s->header.next;
9dfc8ab2 5258
e9ee469a
AM
5259 /* If dot is advanced, this implies that the section
5260 should have space allocated to it, unless the
5261 user has explicitly stated that the section
2e76e85a 5262 should not be allocated. */
f4eaaf7f
AM
5263 if (output_section_statement->sectype != noalloc_section
5264 && (output_section_statement->sectype != noload_section
5265 || (bfd_get_flavour (link_info.output_bfd)
5266 == bfd_target_elf_flavour)))
e9ee469a
AM
5267 output_section_statement->bfd_section->flags |= SEC_ALLOC;
5268 }
252b5132
RH
5269 dot = newdot;
5270 }
5271 }
5272 break;
5273
5274 case lang_padding_statement_enum:
c0c330a7
AM
5275 /* If this is the first time lang_size_sections is called,
5276 we won't have any padding statements. If this is the
5277 second or later passes when relaxing, we should allow
5278 padding to shrink. If padding is needed on this pass, it
5279 will be added back in. */
5280 s->padding_statement.size = 0;
6e814ff8
AM
5281
5282 /* Make sure output_offset is valid. If relaxation shrinks
5283 the section and this pad isn't needed, it's possible to
5284 have output_offset larger than the final size of the
5285 section. bfd_set_section_contents will complain even for
5286 a pad size of zero. */
5287 s->padding_statement.output_offset
5288 = dot - output_section_statement->bfd_section->vma;
252b5132
RH
5289 break;
5290
5291 case lang_group_statement_enum:
e535e147 5292 dot = lang_size_sections_1 (&s->group_statement.children.head,
2d20f7bf 5293 output_section_statement,
cf888e70 5294 fill, dot, relax, check_regions);
252b5132
RH
5295 break;
5296
53d25da6 5297 case lang_insert_statement_enum:
252b5132
RH
5298 break;
5299
c0c330a7 5300 /* We can only get here when relaxing is turned on. */
252b5132
RH
5301 case lang_address_statement_enum:
5302 break;
53d25da6
AM
5303
5304 default:
5305 FAIL ();
5306 break;
252b5132
RH
5307 }
5308 prev = &s->header.next;
5309 }
5310 return dot;
5311}
5312
591a748a
NC
5313/* Callback routine that is used in _bfd_elf_map_sections_to_segments.
5314 The BFD library has set NEW_SEGMENT to TRUE iff it thinks that
5315 CURRENT_SECTION and PREVIOUS_SECTION ought to be placed into different
5316 segments. We are allowed an opportunity to override this decision. */
2889e75b
NC
5317
5318bfd_boolean
5319ldlang_override_segment_assignment (struct bfd_link_info * info ATTRIBUTE_UNUSED,
5320 bfd * abfd ATTRIBUTE_UNUSED,
5321 asection * current_section,
5322 asection * previous_section,
5323 bfd_boolean new_segment)
5324{
5325 lang_output_section_statement_type * cur;
5326 lang_output_section_statement_type * prev;
591a748a
NC
5327
5328 /* The checks below are only necessary when the BFD library has decided
5329 that the two sections ought to be placed into the same segment. */
2889e75b
NC
5330 if (new_segment)
5331 return TRUE;
5332
5333 /* Paranoia checks. */
5334 if (current_section == NULL || previous_section == NULL)
5335 return new_segment;
5336
5337 /* Find the memory regions associated with the two sections.
5338 We call lang_output_section_find() here rather than scanning the list
5339 of output sections looking for a matching section pointer because if
591a748a 5340 we have a large number of sections then a hash lookup is faster. */
2889e75b
NC
5341 cur = lang_output_section_find (current_section->name);
5342 prev = lang_output_section_find (previous_section->name);
5343
591a748a 5344 /* More paranoia. */
2889e75b
NC
5345 if (cur == NULL || prev == NULL)
5346 return new_segment;
5347
5348 /* If the regions are different then force the sections to live in
591a748a
NC
5349 different segments. See the email thread starting at the following
5350 URL for the reasons why this is necessary:
2889e75b
NC
5351 http://sourceware.org/ml/binutils/2007-02/msg00216.html */
5352 return cur->region != prev->region;
5353}
5354
e9ee469a
AM
5355void
5356one_lang_size_sections_pass (bfd_boolean *relax, bfd_boolean check_regions)
2d20f7bf 5357{
420e579c 5358 lang_statement_iteration++;
e535e147
AM
5359 lang_size_sections_1 (&statement_list.head, abs_output_section,
5360 0, 0, relax, check_regions);
e9ee469a 5361}
420e579c 5362
e9ee469a
AM
5363void
5364lang_size_sections (bfd_boolean *relax, bfd_boolean check_regions)
5365{
5366 expld.phase = lang_allocating_phase_enum;
5367 expld.dataseg.phase = exp_dataseg_none;
5368
5369 one_lang_size_sections_pass (relax, check_regions);
5370 if (expld.dataseg.phase == exp_dataseg_end_seen
5371 && link_info.relro && expld.dataseg.relro_end)
8c37241b
JJ
5372 {
5373 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_RELRO_END pair was seen, try
e9ee469a 5374 to put expld.dataseg.relro on a (common) page boundary. */
2b60860a 5375 bfd_vma min_base, old_base, relro_end, maxpage;
8c37241b 5376
e9ee469a 5377 expld.dataseg.phase = exp_dataseg_relro_adjust;
e9ee469a 5378 maxpage = expld.dataseg.maxpagesize;
2b60860a
JK
5379 /* MIN_BASE is the absolute minimum address we are allowed to start the
5380 read-write segment (byte before will be mapped read-only). */
5381 min_base = (expld.dataseg.min_base + maxpage - 1) & ~(maxpage - 1);
5382 /* OLD_BASE is the address for a feasible minimum address which will
5383 still not cause a data overlap inside MAXPAGE causing file offset skip
5384 by MAXPAGE. */
5385 old_base = expld.dataseg.base;
e9ee469a
AM
5386 expld.dataseg.base += (-expld.dataseg.relro_end
5387 & (expld.dataseg.pagesize - 1));
a4f5ad88 5388 /* Compute the expected PT_GNU_RELRO segment end. */
967928e9
AM
5389 relro_end = ((expld.dataseg.relro_end + expld.dataseg.pagesize - 1)
5390 & ~(expld.dataseg.pagesize - 1));
2b60860a 5391 if (min_base + maxpage < expld.dataseg.base)
e3070fef 5392 {
e9ee469a 5393 expld.dataseg.base -= maxpage;
e3070fef
JJ
5394 relro_end -= maxpage;
5395 }
f86a8756 5396 lang_reset_memory_regions ();
e9ee469a
AM
5397 one_lang_size_sections_pass (relax, check_regions);
5398 if (expld.dataseg.relro_end > relro_end)
a4f5ad88
JJ
5399 {
5400 /* The alignment of sections between DATA_SEGMENT_ALIGN
5401 and DATA_SEGMENT_RELRO_END caused huge padding to be
2b60860a
JK
5402 inserted at DATA_SEGMENT_RELRO_END. Try to start a bit lower so
5403 that the section alignments will fit in. */
a4f5ad88
JJ
5404 asection *sec;
5405 unsigned int max_alignment_power = 0;
5406
5407 /* Find maximum alignment power of sections between
5408 DATA_SEGMENT_ALIGN and DATA_SEGMENT_RELRO_END. */
f13a99db 5409 for (sec = link_info.output_bfd->sections; sec; sec = sec->next)
e9ee469a
AM
5410 if (sec->vma >= expld.dataseg.base
5411 && sec->vma < expld.dataseg.relro_end
a4f5ad88
JJ
5412 && sec->alignment_power > max_alignment_power)
5413 max_alignment_power = sec->alignment_power;
5414
e9ee469a 5415 if (((bfd_vma) 1 << max_alignment_power) < expld.dataseg.pagesize)
a4f5ad88 5416 {
2b60860a 5417 if (expld.dataseg.base - (1 << max_alignment_power) < old_base)
e9ee469a
AM
5418 expld.dataseg.base += expld.dataseg.pagesize;
5419 expld.dataseg.base -= (1 << max_alignment_power);
f86a8756 5420 lang_reset_memory_regions ();
e9ee469a 5421 one_lang_size_sections_pass (relax, check_regions);
a4f5ad88
JJ
5422 }
5423 }
e9ee469a
AM
5424 link_info.relro_start = expld.dataseg.base;
5425 link_info.relro_end = expld.dataseg.relro_end;
8c37241b 5426 }
e9ee469a 5427 else if (expld.dataseg.phase == exp_dataseg_end_seen)
2d20f7bf
JJ
5428 {
5429 /* If DATA_SEGMENT_ALIGN DATA_SEGMENT_END pair was seen, check whether
5430 a page could be saved in the data segment. */
5431 bfd_vma first, last;
5432
e9ee469a
AM
5433 first = -expld.dataseg.base & (expld.dataseg.pagesize - 1);
5434 last = expld.dataseg.end & (expld.dataseg.pagesize - 1);
2d20f7bf 5435 if (first && last
e9ee469a
AM
5436 && ((expld.dataseg.base & ~(expld.dataseg.pagesize - 1))
5437 != (expld.dataseg.end & ~(expld.dataseg.pagesize - 1)))
5438 && first + last <= expld.dataseg.pagesize)
2d20f7bf 5439 {
e9ee469a 5440 expld.dataseg.phase = exp_dataseg_adjust;
f86a8756 5441 lang_reset_memory_regions ();
e9ee469a 5442 one_lang_size_sections_pass (relax, check_regions);
2d20f7bf 5443 }
ea7c2e6c
AM
5444 else
5445 expld.dataseg.phase = exp_dataseg_done;
2d20f7bf 5446 }
ea7c2e6c
AM
5447 else
5448 expld.dataseg.phase = exp_dataseg_done;
2d20f7bf
JJ
5449}
5450
420e579c
HPN
5451/* Worker function for lang_do_assignments. Recursiveness goes here. */
5452
5453static bfd_vma
66e28d60
AM
5454lang_do_assignments_1 (lang_statement_union_type *s,
5455 lang_output_section_statement_type *current_os,
5456 fill_type *fill,
5457 bfd_vma dot)
252b5132 5458{
1579bae1 5459 for (; s != NULL; s = s->header.next)
252b5132
RH
5460 {
5461 switch (s->header.type)
5462 {
5463 case lang_constructors_statement_enum:
420e579c 5464 dot = lang_do_assignments_1 (constructor_list.head,
66e28d60 5465 current_os, fill, dot);
252b5132
RH
5466 break;
5467
5468 case lang_output_section_statement_enum:
5469 {
d1778b88 5470 lang_output_section_statement_type *os;
252b5132 5471
d1778b88 5472 os = &(s->output_section_statement);
75ff4589 5473 if (os->bfd_section != NULL && !os->ignored)
252b5132
RH
5474 {
5475 dot = os->bfd_section->vma;
66e28d60 5476
cde9e0be 5477 lang_do_assignments_1 (os->children.head, os, os->fill, dot);
66e28d60 5478
3737f867
JJ
5479 /* .tbss sections effectively have zero size. */
5480 if ((os->bfd_section->flags & SEC_HAS_CONTENTS) != 0
5481 || (os->bfd_section->flags & SEC_THREAD_LOCAL) == 0
5482 || link_info.relocatable)
cde9e0be 5483 dot += TO_ADDR (os->bfd_section->size);
5590fba9
NC
5484
5485 if (os->update_dot_tree != NULL)
5486 exp_fold_tree (os->update_dot_tree, bfd_abs_section_ptr, &dot);
252b5132
RH
5487 }
5488 }
5489 break;
e9ee469a 5490
252b5132
RH
5491 case lang_wild_statement_enum:
5492
420e579c 5493 dot = lang_do_assignments_1 (s->wild_statement.children.head,
66e28d60 5494 current_os, fill, dot);
252b5132
RH
5495 break;
5496
5497 case lang_object_symbols_statement_enum:
5498 case lang_output_statement_enum:
5499 case lang_target_statement_enum:
252b5132 5500 break;
e9ee469a 5501
252b5132 5502 case lang_data_statement_enum:
e9ee469a
AM
5503 exp_fold_tree (s->data_statement.exp, bfd_abs_section_ptr, &dot);
5504 if (expld.result.valid_p)
7542af2a
AM
5505 {
5506 s->data_statement.value = expld.result.value;
5507 if (expld.result.section != NULL)
5508 s->data_statement.value += expld.result.section->vma;
5509 }
e9ee469a
AM
5510 else
5511 einfo (_("%F%P: invalid data statement\n"));
b7a26f91
KH
5512 {
5513 unsigned int size;
08da4cac
KH
5514 switch (s->data_statement.type)
5515 {
5516 default:
5517 abort ();
5518 case QUAD:
5519 case SQUAD:
5520 size = QUAD_SIZE;
5521 break;
5522 case LONG:
5523 size = LONG_SIZE;
5524 break;
5525 case SHORT:
5526 size = SHORT_SIZE;
5527 break;
5528 case BYTE:
5529 size = BYTE_SIZE;
5530 break;
5531 }
e5caa5e0
AM
5532 if (size < TO_SIZE ((unsigned) 1))
5533 size = TO_SIZE ((unsigned) 1);
5534 dot += TO_ADDR (size);
08da4cac 5535 }
252b5132
RH
5536 break;
5537
5538 case lang_reloc_statement_enum:
e9ee469a
AM
5539 exp_fold_tree (s->reloc_statement.addend_exp,
5540 bfd_abs_section_ptr, &dot);
5541 if (expld.result.valid_p)
5542 s->reloc_statement.addend_value = expld.result.value;
5543 else
5544 einfo (_("%F%P: invalid reloc statement\n"));
e5caa5e0 5545 dot += TO_ADDR (bfd_get_reloc_size (s->reloc_statement.howto));
252b5132
RH
5546 break;
5547
5548 case lang_input_section_enum:
5549 {
5550 asection *in = s->input_section.section;
5551
57ceae94 5552 if ((in->flags & SEC_EXCLUDE) == 0)
eea6121a 5553 dot += TO_ADDR (in->size);
252b5132
RH
5554 }
5555 break;
5556
5557 case lang_input_statement_enum:
5558 break;
e9ee469a 5559
252b5132
RH
5560 case lang_fill_statement_enum:
5561 fill = s->fill_statement.fill;
5562 break;
252b5132 5563
e9ee469a
AM
5564 case lang_assignment_statement_enum:
5565 exp_fold_tree (s->assignment_statement.exp,
66e28d60 5566 current_os->bfd_section,
e9ee469a 5567 &dot);
252b5132 5568 break;
e9ee469a 5569
252b5132 5570 case lang_padding_statement_enum:
e5caa5e0 5571 dot += TO_ADDR (s->padding_statement.size);
252b5132
RH
5572 break;
5573
5574 case lang_group_statement_enum:
420e579c 5575 dot = lang_do_assignments_1 (s->group_statement.children.head,
66e28d60 5576 current_os, fill, dot);
252b5132
RH
5577 break;
5578
53d25da6 5579 case lang_insert_statement_enum:
252b5132 5580 break;
e9ee469a 5581
252b5132
RH
5582 case lang_address_statement_enum:
5583 break;
53d25da6
AM
5584
5585 default:
5586 FAIL ();
5587 break;
252b5132 5588 }
252b5132
RH
5589 }
5590 return dot;
5591}
5592
f2241121 5593void
e9ee469a 5594lang_do_assignments (void)
420e579c 5595{
420e579c 5596 lang_statement_iteration++;
e9ee469a 5597 lang_do_assignments_1 (statement_list.head, abs_output_section, NULL, 0);
420e579c
HPN
5598}
5599
252b5132
RH
5600/* Fix any .startof. or .sizeof. symbols. When the assemblers see the
5601 operator .startof. (section_name), it produces an undefined symbol
5602 .startof.section_name. Similarly, when it sees
5603 .sizeof. (section_name), it produces an undefined symbol
5604 .sizeof.section_name. For all the output sections, we look for
5605 such symbols, and set them to the correct value. */
5606
5607static void
1579bae1 5608lang_set_startof (void)
252b5132
RH
5609{
5610 asection *s;
5611
1049f94e 5612 if (link_info.relocatable)
252b5132
RH
5613 return;
5614
f13a99db 5615 for (s = link_info.output_bfd->sections; s != NULL; s = s->next)
252b5132
RH
5616 {
5617 const char *secname;
5618 char *buf;
5619 struct bfd_link_hash_entry *h;
5620
f13a99db 5621 secname = bfd_get_section_name (link_info.output_bfd, s);
1e9cc1c2 5622 buf = (char *) xmalloc (10 + strlen (secname));
252b5132
RH
5623
5624 sprintf (buf, ".startof.%s", secname);
b34976b6 5625 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
252b5132
RH
5626 if (h != NULL && h->type == bfd_link_hash_undefined)
5627 {
5628 h->type = bfd_link_hash_defined;
f13a99db 5629 h->u.def.value = bfd_get_section_vma (link_info.output_bfd, s);
252b5132
RH
5630 h->u.def.section = bfd_abs_section_ptr;
5631 }
5632
5633 sprintf (buf, ".sizeof.%s", secname);
b34976b6 5634 h = bfd_link_hash_lookup (link_info.hash, buf, FALSE, FALSE, TRUE);
252b5132
RH
5635 if (h != NULL && h->type == bfd_link_hash_undefined)
5636 {
5637 h->type = bfd_link_hash_defined;
eea6121a 5638 h->u.def.value = TO_ADDR (s->size);
252b5132
RH
5639 h->u.def.section = bfd_abs_section_ptr;
5640 }
5641
5642 free (buf);
5643 }
5644}
5645
5646static void
750877ba 5647lang_end (void)
252b5132
RH
5648{
5649 struct bfd_link_hash_entry *h;
b34976b6 5650 bfd_boolean warn;
252b5132 5651
ac69cbc6 5652 if ((link_info.relocatable && !link_info.gc_sections)
4bf27aa9 5653 || (link_info.shared && !link_info.executable))
71934f94 5654 warn = entry_from_cmdline;
252b5132 5655 else
b34976b6 5656 warn = TRUE;
252b5132 5657
ac69cbc6
TG
5658 /* Force the user to specify a root when generating a relocatable with
5659 --gc-sections. */
5660 if (link_info.gc_sections && link_info.relocatable
24898b70 5661 && !(entry_from_cmdline || undef_from_cmdline))
ac69cbc6
TG
5662 einfo (_("%P%F: gc-sections requires either an entry or "
5663 "an undefined symbol\n"));
5664
1579bae1 5665 if (entry_symbol.name == NULL)
252b5132 5666 {
a359509e
ZW
5667 /* No entry has been specified. Look for the default entry, but
5668 don't warn if we don't find it. */
5669 entry_symbol.name = entry_symbol_default;
b34976b6 5670 warn = FALSE;
252b5132
RH
5671 }
5672
e3e942e9 5673 h = bfd_link_hash_lookup (link_info.hash, entry_symbol.name,
b34976b6 5674 FALSE, FALSE, TRUE);
1579bae1 5675 if (h != NULL
252b5132
RH
5676 && (h->type == bfd_link_hash_defined
5677 || h->type == bfd_link_hash_defweak)
5678 && h->u.def.section->output_section != NULL)
5679 {
5680 bfd_vma val;
5681
5682 val = (h->u.def.value
f13a99db 5683 + bfd_get_section_vma (link_info.output_bfd,
252b5132
RH
5684 h->u.def.section->output_section)
5685 + h->u.def.section->output_offset);
f13a99db 5686 if (! bfd_set_start_address (link_info.output_bfd, val))
e3e942e9 5687 einfo (_("%P%F:%s: can't set start address\n"), entry_symbol.name);
252b5132
RH
5688 }
5689 else
5690 {
5691 bfd_vma val;
5f992e62 5692 const char *send;
252b5132
RH
5693
5694 /* We couldn't find the entry symbol. Try parsing it as a
afd7a018 5695 number. */
e3e942e9 5696 val = bfd_scan_vma (entry_symbol.name, &send, 0);
252b5132
RH
5697 if (*send == '\0')
5698 {
f13a99db 5699 if (! bfd_set_start_address (link_info.output_bfd, val))
252b5132
RH
5700 einfo (_("%P%F: can't set start address\n"));
5701 }
5702 else
5703 {
5704 asection *ts;
5705
5706 /* Can't find the entry symbol, and it's not a number. Use
5707 the first address in the text section. */
f13a99db 5708 ts = bfd_get_section_by_name (link_info.output_bfd, entry_section);
1579bae1 5709 if (ts != NULL)
252b5132
RH
5710 {
5711 if (warn)
6feb9908
AM
5712 einfo (_("%P: warning: cannot find entry symbol %s;"
5713 " defaulting to %V\n"),
e3e942e9 5714 entry_symbol.name,
f13a99db
AM
5715 bfd_get_section_vma (link_info.output_bfd, ts));
5716 if (!(bfd_set_start_address
5717 (link_info.output_bfd,
5718 bfd_get_section_vma (link_info.output_bfd, ts))))
252b5132
RH
5719 einfo (_("%P%F: can't set start address\n"));
5720 }
5721 else
5722 {
5723 if (warn)
6feb9908
AM
5724 einfo (_("%P: warning: cannot find entry symbol %s;"
5725 " not setting start address\n"),
e3e942e9 5726 entry_symbol.name);
252b5132
RH
5727 }
5728 }
5729 }
420e579c 5730
7115639b
AM
5731 /* Don't bfd_hash_table_free (&lang_definedness_table);
5732 map file output may result in a call of lang_track_definedness. */
252b5132
RH
5733}
5734
5735/* This is a small function used when we want to ignore errors from
5736 BFD. */
5737
5738static void
87f2a346 5739ignore_bfd_errors (const char *s ATTRIBUTE_UNUSED, ...)
252b5132
RH
5740{
5741 /* Don't do anything. */
5742}
5743
5744/* Check that the architecture of all the input files is compatible
5745 with the output file. Also call the backend to let it do any
5746 other checking that is needed. */
5747
5748static void
1579bae1 5749lang_check (void)
252b5132
RH
5750{
5751 lang_statement_union_type *file;
5752 bfd *input_bfd;
5f992e62 5753 const bfd_arch_info_type *compatible;
252b5132 5754
1579bae1 5755 for (file = file_chain.head; file != NULL; file = file->input_statement.next)
252b5132 5756 {
422b6f14
DK
5757#ifdef ENABLE_PLUGINS
5758 /* Don't check format of files claimed by plugin. */
5759 if (file->input_statement.claimed)
5760 continue;
5761#endif /* ENABLE_PLUGINS */
252b5132 5762 input_bfd = file->input_statement.the_bfd;
6feb9908 5763 compatible
f13a99db 5764 = bfd_arch_get_compatible (input_bfd, link_info.output_bfd,
6feb9908 5765 command_line.accept_unknown_input_arch);
30cba025
AM
5766
5767 /* In general it is not possible to perform a relocatable
5768 link between differing object formats when the input
5769 file has relocations, because the relocations in the
5770 input format may not have equivalent representations in
5771 the output format (and besides BFD does not translate
5772 relocs for other link purposes than a final link). */
1049f94e 5773 if ((link_info.relocatable || link_info.emitrelocations)
30cba025 5774 && (compatible == NULL
f13a99db
AM
5775 || (bfd_get_flavour (input_bfd)
5776 != bfd_get_flavour (link_info.output_bfd)))
30cba025
AM
5777 && (bfd_get_file_flags (input_bfd) & HAS_RELOC) != 0)
5778 {
6feb9908
AM
5779 einfo (_("%P%F: Relocatable linking with relocations from"
5780 " format %s (%B) to format %s (%B) is not supported\n"),
30cba025 5781 bfd_get_target (input_bfd), input_bfd,
f13a99db 5782 bfd_get_target (link_info.output_bfd), link_info.output_bfd);
30cba025
AM
5783 /* einfo with %F exits. */
5784 }
5785
252b5132
RH
5786 if (compatible == NULL)
5787 {
5788 if (command_line.warn_mismatch)
9e7750f2 5789 einfo (_("%P%X: %s architecture of input file `%B'"
6feb9908 5790 " is incompatible with %s output\n"),
252b5132 5791 bfd_printable_name (input_bfd), input_bfd,
f13a99db 5792 bfd_printable_name (link_info.output_bfd));
252b5132 5793 }
b9247304 5794 else if (bfd_count_sections (input_bfd))
252b5132 5795 {
b9247304 5796 /* If the input bfd has no contents, it shouldn't set the
b7a26f91 5797 private data of the output bfd. */
b9247304 5798
252b5132
RH
5799 bfd_error_handler_type pfn = NULL;
5800
5801 /* If we aren't supposed to warn about mismatched input
afd7a018
AM
5802 files, temporarily set the BFD error handler to a
5803 function which will do nothing. We still want to call
5804 bfd_merge_private_bfd_data, since it may set up
5805 information which is needed in the output file. */
252b5132
RH
5806 if (! command_line.warn_mismatch)
5807 pfn = bfd_set_error_handler (ignore_bfd_errors);
f13a99db 5808 if (! bfd_merge_private_bfd_data (input_bfd, link_info.output_bfd))
252b5132
RH
5809 {
5810 if (command_line.warn_mismatch)
6feb9908
AM
5811 einfo (_("%P%X: failed to merge target specific data"
5812 " of file %B\n"), input_bfd);
252b5132
RH
5813 }
5814 if (! command_line.warn_mismatch)
5815 bfd_set_error_handler (pfn);
5816 }
5817 }
5818}
5819
5820/* Look through all the global common symbols and attach them to the
5821 correct section. The -sort-common command line switch may be used
de7dd2bd 5822 to roughly sort the entries by alignment. */
252b5132
RH
5823
5824static void
1579bae1 5825lang_common (void)
252b5132 5826{
4818e05f
AM
5827 if (command_line.inhibit_common_definition)
5828 return;
1049f94e 5829 if (link_info.relocatable
252b5132
RH
5830 && ! command_line.force_common_definition)
5831 return;
5832
5833 if (! config.sort_common)
1579bae1 5834 bfd_link_hash_traverse (link_info.hash, lang_one_common, NULL);
252b5132
RH
5835 else
5836 {
de7dd2bd
NC
5837 unsigned int power;
5838
5839 if (config.sort_common == sort_descending)
967928e9
AM
5840 {
5841 for (power = 4; power > 0; power--)
5842 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5843
5844 power = 0;
5845 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5846 }
de7dd2bd 5847 else
967928e9
AM
5848 {
5849 for (power = 0; power <= 4; power++)
5850 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
252b5132 5851
967928e9 5852 power = UINT_MAX;
de7dd2bd
NC
5853 bfd_link_hash_traverse (link_info.hash, lang_one_common, &power);
5854 }
252b5132
RH
5855 }
5856}
5857
5858/* Place one common symbol in the correct section. */
5859
b34976b6 5860static bfd_boolean
1579bae1 5861lang_one_common (struct bfd_link_hash_entry *h, void *info)
252b5132
RH
5862{
5863 unsigned int power_of_two;
5864 bfd_vma size;
5865 asection *section;
5866
5867 if (h->type != bfd_link_hash_common)
b34976b6 5868 return TRUE;
252b5132
RH
5869
5870 size = h->u.c.size;
5871 power_of_two = h->u.c.p->alignment_power;
5872
de7dd2bd
NC
5873 if (config.sort_common == sort_descending
5874 && power_of_two < *(unsigned int *) info)
5875 return TRUE;
5876 else if (config.sort_common == sort_ascending
967928e9 5877 && power_of_two > *(unsigned int *) info)
b34976b6 5878 return TRUE;
252b5132
RH
5879
5880 section = h->u.c.p->section;
3023e3f6
RS
5881 if (!bfd_define_common_symbol (link_info.output_bfd, &link_info, h))
5882 einfo (_("%P%F: Could not define common symbol `%T': %E\n"),
5883 h->root.string);
252b5132
RH
5884
5885 if (config.map_file != NULL)
5886 {
b34976b6 5887 static bfd_boolean header_printed;
252b5132
RH
5888 int len;
5889 char *name;
5890 char buf[50];
5891
5892 if (! header_printed)
5893 {
5894 minfo (_("\nAllocating common symbols\n"));
5895 minfo (_("Common symbol size file\n\n"));
b34976b6 5896 header_printed = TRUE;
252b5132
RH
5897 }
5898
f13a99db 5899 name = bfd_demangle (link_info.output_bfd, h->root.string,
73705ac3 5900 DMGL_ANSI | DMGL_PARAMS);
d7d4c8de
AM
5901 if (name == NULL)
5902 {
5903 minfo ("%s", h->root.string);
5904 len = strlen (h->root.string);
5905 }
5906 else
5907 {
5908 minfo ("%s", name);
5909 len = strlen (name);
5910 free (name);
5911 }
252b5132
RH
5912
5913 if (len >= 19)
5914 {
5915 print_nl ();
5916 len = 0;
5917 }
5918 while (len < 20)
5919 {
5920 print_space ();
5921 ++len;
5922 }
5923
5924 minfo ("0x");
5925 if (size <= 0xffffffff)
5926 sprintf (buf, "%lx", (unsigned long) size);
5927 else
5928 sprintf_vma (buf, size);
5929 minfo ("%s", buf);
5930 len = strlen (buf);
5931
5932 while (len < 16)
5933 {
5934 print_space ();
5935 ++len;
5936 }
5937
5938 minfo ("%B\n", section->owner);
5939 }
5940
b34976b6 5941 return TRUE;
252b5132
RH
5942}
5943
08da4cac
KH
5944/* Run through the input files and ensure that every input section has
5945 somewhere to go. If one is found without a destination then create
5946 an input request and place it into the statement tree. */
252b5132
RH
5947
5948static void
1579bae1 5949lang_place_orphans (void)
252b5132 5950{
e50d8076 5951 LANG_FOR_EACH_INPUT_STATEMENT (file)
252b5132
RH
5952 {
5953 asection *s;
5954
1579bae1 5955 for (s = file->the_bfd->sections; s != NULL; s = s->next)
252b5132 5956 {
1579bae1 5957 if (s->output_section == NULL)
252b5132 5958 {
396a2467 5959 /* This section of the file is not attached, root
afd7a018 5960 around for a sensible place for it to go. */
252b5132
RH
5961
5962 if (file->just_syms_flag)
1449d79b
AM
5963 bfd_link_just_syms (file->the_bfd, s, &link_info);
5964 else if ((s->flags & SEC_EXCLUDE) != 0)
164e712d 5965 s->output_section = bfd_abs_section_ptr;
252b5132
RH
5966 else if (strcmp (s->name, "COMMON") == 0)
5967 {
5968 /* This is a lonely common section which must have
5969 come from an archive. We attach to the section
5970 with the wildcard. */
1049f94e 5971 if (! link_info.relocatable
252b5132
RH
5972 || command_line.force_common_definition)
5973 {
5974 if (default_common_section == NULL)
66c103b7
AM
5975 default_common_section
5976 = lang_output_section_statement_lookup (".bss", 0,
5977 TRUE);
39dcfe18 5978 lang_add_section (&default_common_section->children, s,
7b986e99 5979 default_common_section);
252b5132
RH
5980 }
5981 }
252b5132
RH
5982 else
5983 {
bcacc0f5 5984 const char *name = s->name;
8a99a385 5985 int constraint = 0;
252b5132 5986
d0bf826b
AM
5987 if (config.unique_orphan_sections
5988 || unique_section_p (s, NULL))
8a99a385 5989 constraint = SPECIAL;
bcacc0f5 5990
8a99a385 5991 if (!ldemul_place_orphan (s, name, constraint))
bcacc0f5
AM
5992 {
5993 lang_output_section_statement_type *os;
8a99a385
AM
5994 os = lang_output_section_statement_lookup (name,
5995 constraint,
bcacc0f5 5996 TRUE);
30920cab
AM
5997 if (os->addr_tree == NULL
5998 && (link_info.relocatable
5999 || (s->flags & (SEC_LOAD | SEC_ALLOC)) == 0))
6000 os->addr_tree = exp_intop (0);
bcacc0f5
AM
6001 lang_add_section (&os->children, s, os);
6002 }
252b5132
RH
6003 }
6004 }
6005 }
6006 }
6007}
6008
252b5132 6009void
1579bae1 6010lang_set_flags (lang_memory_region_type *ptr, const char *flags, int invert)
252b5132 6011{
aa8804e4 6012 flagword *ptr_flags;
252b5132 6013
aa8804e4 6014 ptr_flags = invert ? &ptr->not_flags : &ptr->flags;
252b5132
RH
6015 while (*flags)
6016 {
6017 switch (*flags)
6018 {
252b5132
RH
6019 case 'A': case 'a':
6020 *ptr_flags |= SEC_ALLOC;
6021 break;
6022
6023 case 'R': case 'r':
6024 *ptr_flags |= SEC_READONLY;
6025 break;
6026
6027 case 'W': case 'w':
6028 *ptr_flags |= SEC_DATA;
6029 break;
6030
6031 case 'X': case 'x':
6032 *ptr_flags |= SEC_CODE;
6033 break;
6034
6035 case 'L': case 'l':
6036 case 'I': case 'i':
6037 *ptr_flags |= SEC_LOAD;
6038 break;
6039
6040 default:
6041 einfo (_("%P%F: invalid syntax in flags\n"));
6042 break;
6043 }
6044 flags++;
6045 }
6046}
6047
6048/* Call a function on each input file. This function will be called
6049 on an archive, but not on the elements. */
6050
6051void
1579bae1 6052lang_for_each_input_file (void (*func) (lang_input_statement_type *))
252b5132
RH
6053{
6054 lang_input_statement_type *f;
6055
6056 for (f = (lang_input_statement_type *) input_file_chain.head;
6057 f != NULL;
6058 f = (lang_input_statement_type *) f->next_real_file)
6059 func (f);
6060}
6061
6062/* Call a function on each file. The function will be called on all
6063 the elements of an archive which are included in the link, but will
6064 not be called on the archive file itself. */
6065
6066void
1579bae1 6067lang_for_each_file (void (*func) (lang_input_statement_type *))
252b5132 6068{
e50d8076 6069 LANG_FOR_EACH_INPUT_STATEMENT (f)
252b5132
RH
6070 {
6071 func (f);
6072 }
6073}
6074
252b5132 6075void
1579bae1 6076ldlang_add_file (lang_input_statement_type *entry)
252b5132 6077{
252b5132
RH
6078 lang_statement_append (&file_chain,
6079 (lang_statement_union_type *) entry,
6080 &entry->next);
6081
6082 /* The BFD linker needs to have a list of all input BFDs involved in
6083 a link. */
1579bae1 6084 ASSERT (entry->the_bfd->link_next == NULL);
f13a99db 6085 ASSERT (entry->the_bfd != link_info.output_bfd);
a9a4c53e
AM
6086
6087 *link_info.input_bfds_tail = entry->the_bfd;
6088 link_info.input_bfds_tail = &entry->the_bfd->link_next;
1579bae1 6089 entry->the_bfd->usrdata = entry;
252b5132
RH
6090 bfd_set_gp_size (entry->the_bfd, g_switch_value);
6091
6092 /* Look through the sections and check for any which should not be
6093 included in the link. We need to do this now, so that we can
6094 notice when the backend linker tries to report multiple
6095 definition errors for symbols which are in sections we aren't
6096 going to link. FIXME: It might be better to entirely ignore
6097 symbols which are defined in sections which are going to be
6098 discarded. This would require modifying the backend linker for
6099 each backend which might set the SEC_LINK_ONCE flag. If we do
6100 this, we should probably handle SEC_EXCLUDE in the same way. */
6101
1579bae1 6102 bfd_map_over_sections (entry->the_bfd, section_already_linked, entry);
252b5132
RH
6103}
6104
6105void
1579bae1 6106lang_add_output (const char *name, int from_script)
252b5132
RH
6107{
6108 /* Make -o on command line override OUTPUT in script. */
7c519c12 6109 if (!had_output_filename || !from_script)
252b5132
RH
6110 {
6111 output_filename = name;
b34976b6 6112 had_output_filename = TRUE;
252b5132
RH
6113 }
6114}
6115
252b5132
RH
6116static lang_output_section_statement_type *current_section;
6117
6118static int
1579bae1 6119topower (int x)
252b5132
RH
6120{
6121 unsigned int i = 1;
6122 int l;
6123
6124 if (x < 0)
6125 return -1;
6126
5f992e62 6127 for (l = 0; l < 32; l++)
252b5132
RH
6128 {
6129 if (i >= (unsigned int) x)
6130 return l;
6131 i <<= 1;
6132 }
6133
6134 return 0;
6135}
6136
aea4bd9d 6137lang_output_section_statement_type *
1579bae1
AM
6138lang_enter_output_section_statement (const char *output_section_statement_name,
6139 etree_type *address_exp,
6140 enum section_type sectype,
1579bae1
AM
6141 etree_type *align,
6142 etree_type *subalign,
0841712e
JJ
6143 etree_type *ebase,
6144 int constraint)
252b5132
RH
6145{
6146 lang_output_section_statement_type *os;
6147
66c103b7
AM
6148 os = lang_output_section_statement_lookup (output_section_statement_name,
6149 constraint, TRUE);
967928e9 6150 current_section = os;
252b5132 6151
1579bae1 6152 if (os->addr_tree == NULL)
08da4cac
KH
6153 {
6154 os->addr_tree = address_exp;
6155 }
252b5132
RH
6156 os->sectype = sectype;
6157 if (sectype != noload_section)
6158 os->flags = SEC_NO_FLAGS;
6159 else
6160 os->flags = SEC_NEVER_LOAD;
e5caa5e0 6161 os->block_value = 1;
66c103b7
AM
6162
6163 /* Make next things chain into subchain of this. */
bde18da4 6164 push_stat_ptr (&os->children);
252b5132 6165
08da4cac 6166 os->subsection_alignment =
e9ee469a 6167 topower (exp_get_value_int (subalign, -1, "subsection alignment"));
08da4cac 6168 os->section_alignment =
e9ee469a 6169 topower (exp_get_value_int (align, -1, "section alignment"));
252b5132
RH
6170
6171 os->load_base = ebase;
aea4bd9d 6172 return os;
252b5132
RH
6173}
6174
252b5132 6175void
1579bae1 6176lang_final (void)
252b5132 6177{
d3ce72d0
NC
6178 lang_output_statement_type *new_stmt;
6179
6180 new_stmt = new_stat (lang_output_statement, stat_ptr);
6181 new_stmt->name = output_filename;
252b5132 6182
252b5132
RH
6183}
6184
08da4cac
KH
6185/* Reset the current counters in the regions. */
6186
e3dc8847 6187void
1579bae1 6188lang_reset_memory_regions (void)
252b5132
RH
6189{
6190 lang_memory_region_type *p = lang_memory_region_list;
b3327aad 6191 asection *o;
e9ee469a 6192 lang_output_section_statement_type *os;
252b5132 6193
1579bae1 6194 for (p = lang_memory_region_list; p != NULL; p = p->next)
252b5132 6195 {
252b5132 6196 p->current = p->origin;
66e28d60 6197 p->last_os = NULL;
252b5132 6198 }
b3327aad 6199
e9ee469a
AM
6200 for (os = &lang_output_section_statement.head->output_section_statement;
6201 os != NULL;
6202 os = os->next)
cde9e0be
AM
6203 {
6204 os->processed_vma = FALSE;
6205 os->processed_lma = FALSE;
6206 }
e9ee469a 6207
f13a99db 6208 for (o = link_info.output_bfd->sections; o != NULL; o = o->next)
1a23a9e6
AM
6209 {
6210 /* Save the last size for possible use by bfd_relax_section. */
6211 o->rawsize = o->size;
6212 o->size = 0;
6213 }
252b5132
RH
6214}
6215
164e712d 6216/* Worker for lang_gc_sections_1. */
252b5132
RH
6217
6218static void
1579bae1
AM
6219gc_section_callback (lang_wild_statement_type *ptr,
6220 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6221 asection *section,
6222 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6223 void *data ATTRIBUTE_UNUSED)
252b5132 6224{
164e712d
AM
6225 /* If the wild pattern was marked KEEP, the member sections
6226 should be as well. */
4dec4d4e
RH
6227 if (ptr->keep_sections)
6228 section->flags |= SEC_KEEP;
252b5132
RH
6229}
6230
252b5132
RH
6231/* Iterate over sections marking them against GC. */
6232
6233static void
1579bae1 6234lang_gc_sections_1 (lang_statement_union_type *s)
252b5132 6235{
1579bae1 6236 for (; s != NULL; s = s->header.next)
252b5132
RH
6237 {
6238 switch (s->header.type)
6239 {
6240 case lang_wild_statement_enum:
164e712d 6241 walk_wild (&s->wild_statement, gc_section_callback, NULL);
abc6ab0a 6242 break;
252b5132
RH
6243 case lang_constructors_statement_enum:
6244 lang_gc_sections_1 (constructor_list.head);
6245 break;
6246 case lang_output_section_statement_enum:
6247 lang_gc_sections_1 (s->output_section_statement.children.head);
6248 break;
6249 case lang_group_statement_enum:
6250 lang_gc_sections_1 (s->group_statement.children.head);
6251 break;
6252 default:
6253 break;
6254 }
6255 }
6256}
6257
6258static void
1579bae1 6259lang_gc_sections (void)
252b5132 6260{
252b5132
RH
6261 /* Keep all sections so marked in the link script. */
6262
6263 lang_gc_sections_1 (statement_list.head);
6264
9ca57817
AM
6265 /* SEC_EXCLUDE is ignored when doing a relocatable link, except in
6266 the special case of debug info. (See bfd/stabs.c)
6267 Twiddle the flag here, to simplify later linker code. */
6268 if (link_info.relocatable)
6269 {
6270 LANG_FOR_EACH_INPUT_STATEMENT (f)
6271 {
6272 asection *sec;
6273 for (sec = f->the_bfd->sections; sec != NULL; sec = sec->next)
6274 if ((sec->flags & SEC_DEBUGGING) == 0)
6275 sec->flags &= ~SEC_EXCLUDE;
6276 }
6277 }
6278
57316bff 6279 if (link_info.gc_sections)
f13a99db 6280 bfd_gc_sections (link_info.output_bfd, &link_info);
252b5132
RH
6281}
6282
b10a8ae0
L
6283/* Worker for lang_find_relro_sections_1. */
6284
6285static void
6286find_relro_section_callback (lang_wild_statement_type *ptr ATTRIBUTE_UNUSED,
6287 struct wildcard_list *sec ATTRIBUTE_UNUSED,
6288 asection *section,
6289 lang_input_statement_type *file ATTRIBUTE_UNUSED,
6290 void *data)
6291{
6292 /* Discarded, excluded and ignored sections effectively have zero
6293 size. */
6294 if (section->output_section != NULL
f13a99db 6295 && section->output_section->owner == link_info.output_bfd
b10a8ae0
L
6296 && (section->output_section->flags & SEC_EXCLUDE) == 0
6297 && !IGNORE_SECTION (section)
6298 && section->size != 0)
6299 {
6300 bfd_boolean *has_relro_section = (bfd_boolean *) data;
6301 *has_relro_section = TRUE;
6302 }
6303}
6304
6305/* Iterate over sections for relro sections. */
6306
6307static void
6308lang_find_relro_sections_1 (lang_statement_union_type *s,
6309 bfd_boolean *has_relro_section)
6310{
6311 if (*has_relro_section)
6312 return;
6313
6314 for (; s != NULL; s = s->header.next)
6315 {
6316 if (s == expld.dataseg.relro_end_stat)
6317 break;
6318
6319 switch (s->header.type)
6320 {
6321 case lang_wild_statement_enum:
6322 walk_wild (&s->wild_statement,
6323 find_relro_section_callback,
6324 has_relro_section);
6325 break;
6326 case lang_constructors_statement_enum:
6327 lang_find_relro_sections_1 (constructor_list.head,
6328 has_relro_section);
6329 break;
6330 case lang_output_section_statement_enum:
6331 lang_find_relro_sections_1 (s->output_section_statement.children.head,
6332 has_relro_section);
6333 break;
6334 case lang_group_statement_enum:
6335 lang_find_relro_sections_1 (s->group_statement.children.head,
6336 has_relro_section);
6337 break;
6338 default:
6339 break;
6340 }
6341 }
6342}
6343
6344static void
6345lang_find_relro_sections (void)
6346{
6347 bfd_boolean has_relro_section = FALSE;
6348
6349 /* Check all sections in the link script. */
6350
6351 lang_find_relro_sections_1 (expld.dataseg.relro_start_stat,
6352 &has_relro_section);
6353
6354 if (!has_relro_section)
6355 link_info.relro = FALSE;
6356}
6357
fbbc3759
L
6358/* Relax all sections until bfd_relax_section gives up. */
6359
eaeb0a9d
AM
6360void
6361lang_relax_sections (bfd_boolean need_layout)
fbbc3759 6362{
28d5f677 6363 if (RELAXATION_ENABLED)
fbbc3759 6364 {
eaeb0a9d
AM
6365 /* We may need more than one relaxation pass. */
6366 int i = link_info.relax_pass;
fbbc3759 6367
eaeb0a9d
AM
6368 /* The backend can use it to determine the current pass. */
6369 link_info.relax_pass = 0;
fbbc3759 6370
eaeb0a9d
AM
6371 while (i--)
6372 {
6373 /* Keep relaxing until bfd_relax_section gives up. */
6374 bfd_boolean relax_again;
fbbc3759 6375
eaeb0a9d
AM
6376 link_info.relax_trip = -1;
6377 do
6378 {
6379 link_info.relax_trip++;
6380
6381 /* Note: pe-dll.c does something like this also. If you find
6382 you need to change this code, you probably need to change
6383 pe-dll.c also. DJ */
6384
6385 /* Do all the assignments with our current guesses as to
6386 section sizes. */
6387 lang_do_assignments ();
6388
6389 /* We must do this after lang_do_assignments, because it uses
6390 size. */
6391 lang_reset_memory_regions ();
6392
6393 /* Perform another relax pass - this time we know where the
6394 globals are, so can make a better guess. */
6395 relax_again = FALSE;
6396 lang_size_sections (&relax_again, FALSE);
6397 }
6398 while (relax_again);
6399
6400 link_info.relax_pass++;
6401 }
6402 need_layout = TRUE;
6403 }
fbbc3759 6404
eaeb0a9d
AM
6405 if (need_layout)
6406 {
6407 /* Final extra sizing to report errors. */
6408 lang_do_assignments ();
6409 lang_reset_memory_regions ();
6410 lang_size_sections (NULL, TRUE);
fbbc3759 6411 }
fbbc3759
L
6412}
6413
8543fde5
DK
6414#ifdef ENABLE_PLUGINS
6415/* Find the insert point for the plugin's replacement files. We
6416 place them after the first claimed real object file, or if the
6417 first claimed object is an archive member, after the last real
6418 object file immediately preceding the archive. In the event
6419 no objects have been claimed at all, we return the first dummy
6420 object file on the list as the insert point; that works, but
6421 the callee must be careful when relinking the file_chain as it
6422 is not actually on that chain, only the statement_list and the
6423 input_file list; in that case, the replacement files must be
6424 inserted at the head of the file_chain. */
6425
6426static lang_input_statement_type *
6427find_replacements_insert_point (void)
6428{
6429 lang_input_statement_type *claim1, *lastobject;
6430 lastobject = &input_file_chain.head->input_statement;
6431 for (claim1 = &file_chain.head->input_statement;
6432 claim1 != NULL;
6433 claim1 = &claim1->next->input_statement)
6434 {
6435 if (claim1->claimed)
6436 return claim1->claim_archive ? lastobject : claim1;
6437 /* Update lastobject if this is a real object file. */
6438 if (claim1->the_bfd && (claim1->the_bfd->my_archive == NULL))
6439 lastobject = claim1;
6440 }
6441 /* No files were claimed by the plugin. Choose the last object
6442 file found on the list (maybe the first, dummy entry) as the
6443 insert point. */
6444 return lastobject;
6445}
6446#endif /* ENABLE_PLUGINS */
6447
252b5132 6448void
1579bae1 6449lang_process (void)
252b5132 6450{
55255dae 6451 /* Finalize dynamic list. */
40b36307
L
6452 if (link_info.dynamic_list)
6453 lang_finalize_version_expr_head (&link_info.dynamic_list->head);
55255dae 6454
252b5132
RH
6455 current_target = default_target;
6456
08da4cac
KH
6457 /* Open the output file. */
6458 lang_for_each_statement (ldlang_open_output);
e5caa5e0 6459 init_opb ();
252b5132
RH
6460
6461 ldemul_create_output_section_statements ();
6462
08da4cac 6463 /* Add to the hash table all undefineds on the command line. */
252b5132
RH
6464 lang_place_undefineds ();
6465
082b7297
L
6466 if (!bfd_section_already_linked_table_init ())
6467 einfo (_("%P%F: Failed to create hash table\n"));
9503fd87 6468
08da4cac 6469 /* Create a bfd for each input file. */
252b5132 6470 current_target = default_target;
b34976b6 6471 open_input_bfds (statement_list.head, FALSE);
252b5132 6472
5d3236ee 6473#ifdef ENABLE_PLUGINS
8543fde5 6474 if (plugin_active_plugins_p ())
f84854b6 6475 {
8543fde5
DK
6476 lang_statement_list_type added;
6477 lang_statement_list_type files, inputfiles;
f84854b6
L
6478 /* Now all files are read, let the plugin(s) decide if there
6479 are any more to be added to the link before we call the
8543fde5
DK
6480 emulation's after_open hook. We create a private list of
6481 input statements for this purpose, which we will eventually
6482 insert into the global statment list after the first claimed
6483 file. */
6484 added = *stat_ptr;
6485 /* We need to manipulate all three chains in synchrony. */
6486 files = file_chain;
6487 inputfiles = input_file_chain;
f84854b6
L
6488 if (plugin_call_all_symbols_read ())
6489 einfo (_("%P%F: %s: plugin reported error after all symbols read\n"),
6490 plugin_error_plugin ());
8543fde5
DK
6491 /* Open any newly added files, updating the file chains. */
6492 open_input_bfds (added.head, FALSE);
6493 /* Restore the global list pointer now they have all been added. */
6494 lang_list_remove_tail (stat_ptr, &added);
6495 /* And detach the fresh ends of the file lists. */
6496 lang_list_remove_tail (&file_chain, &files);
6497 lang_list_remove_tail (&input_file_chain, &inputfiles);
6498 /* Were any new files added? */
6499 if (added.head != NULL)
6500 {
6501 /* If so, we will insert them into the statement list immediately
6502 after the first input file that was claimed by the plugin. */
6503 lang_input_statement_type *claim1 = find_replacements_insert_point ();
6504 /* If a plugin adds input files without having claimed any, we
6505 don't really have a good idea where to place them. Just putting
6506 them at the start or end of the list is liable to leave them
6507 outside the crtbegin...crtend range. */
6508 ASSERT (claim1 != NULL);
6509 /* Splice the new statement list into the old one after claim1. */
6510 lang_list_insert_after (stat_ptr, &added, &claim1->header.next);
6511 /* Likewise for the file chains. */
6512 lang_list_insert_after (&input_file_chain, &inputfiles,
6513 &claim1->next_real_file);
6514 /* We must be careful when relinking file_chain; we may need to
6515 insert the new files at the head of the list if the insert
6516 point chosen is the dummy first input file. */
6517 if (claim1->filename)
6518 lang_list_insert_after (&file_chain, &files, &claim1->next);
6519 else
6520 lang_list_insert_after (&file_chain, &files, &file_chain.head);
6521 }
f84854b6 6522 }
5d3236ee
DK
6523#endif /* ENABLE_PLUGINS */
6524
e3e942e9
AM
6525 link_info.gc_sym_list = &entry_symbol;
6526 if (entry_symbol.name == NULL)
6527 link_info.gc_sym_list = ldlang_undef_chain_list_head;
6528
252b5132
RH
6529 ldemul_after_open ();
6530
082b7297 6531 bfd_section_already_linked_table_free ();
9503fd87 6532
252b5132
RH
6533 /* Make sure that we're not mixing architectures. We call this
6534 after all the input files have been opened, but before we do any
6535 other processing, so that any operations merge_private_bfd_data
6536 does on the output file will be known during the rest of the
6537 link. */
6538 lang_check ();
6539
6540 /* Handle .exports instead of a version script if we're told to do so. */
6541 if (command_line.version_exports_section)
6542 lang_do_version_exports_section ();
6543
6544 /* Build all sets based on the information gathered from the input
6545 files. */
6546 ldctor_build_sets ();
6547
6548 /* Remove unreferenced sections if asked to. */
164e712d 6549 lang_gc_sections ();
252b5132 6550
08da4cac 6551 /* Size up the common data. */
252b5132
RH
6552 lang_common ();
6553
bcaa7b3e
L
6554 /* Update wild statements. */
6555 update_wild_statements (statement_list.head);
6556
252b5132 6557 /* Run through the contours of the script and attach input sections
08da4cac 6558 to the correct output sections. */
e759c116 6559 lang_statement_iteration++;
1579bae1 6560 map_input_to_output_sections (statement_list.head, NULL, NULL);
252b5132 6561
53d25da6
AM
6562 process_insert_statements ();
6563
08da4cac 6564 /* Find any sections not attached explicitly and handle them. */
252b5132
RH
6565 lang_place_orphans ();
6566
1049f94e 6567 if (! link_info.relocatable)
862120bd 6568 {
57ceae94
AM
6569 asection *found;
6570
6571 /* Merge SEC_MERGE sections. This has to be done after GC of
6572 sections, so that GCed sections are not merged, but before
6573 assigning dynamic symbols, since removing whole input sections
6574 is hard then. */
f13a99db 6575 bfd_merge_sections (link_info.output_bfd, &link_info);
57ceae94 6576
862120bd 6577 /* Look for a text section and set the readonly attribute in it. */
f13a99db 6578 found = bfd_get_section_by_name (link_info.output_bfd, ".text");
862120bd 6579
1579bae1 6580 if (found != NULL)
862120bd
AM
6581 {
6582 if (config.text_read_only)
6583 found->flags |= SEC_READONLY;
6584 else
6585 found->flags &= ~SEC_READONLY;
6586 }
6587 }
6588
6589 /* Do anything special before sizing sections. This is where ELF
6590 and other back-ends size dynamic sections. */
252b5132
RH
6591 ldemul_before_allocation ();
6592
6593 /* We must record the program headers before we try to fix the
6594 section positions, since they will affect SIZEOF_HEADERS. */
6595 lang_record_phdrs ();
6596
b10a8ae0
L
6597 /* Check relro sections. */
6598 if (link_info.relro && ! link_info.relocatable)
6599 lang_find_relro_sections ();
6600
b3327aad 6601 /* Size up the sections. */
28d5f677 6602 lang_size_sections (NULL, ! RELAXATION_ENABLED);
b3327aad 6603
252b5132 6604 /* See if anything special should be done now we know how big
eaeb0a9d 6605 everything is. This is where relaxation is done. */
252b5132
RH
6606 ldemul_after_allocation ();
6607
6608 /* Fix any .startof. or .sizeof. symbols. */
6609 lang_set_startof ();
6610
08da4cac
KH
6611 /* Do all the assignments, now that we know the final resting places
6612 of all the symbols. */
ea7c2e6c 6613 expld.phase = lang_final_phase_enum;
e9ee469a 6614 lang_do_assignments ();
252b5132 6615
8ded5a0f
AM
6616 ldemul_finish ();
6617
252b5132 6618 /* Make sure that the section addresses make sense. */
662ef24b 6619 if (command_line.check_section_addresses)
252b5132 6620 lang_check_section_addresses ();
5f992e62 6621
750877ba 6622 lang_end ();
252b5132
RH
6623}
6624
6625/* EXPORTED TO YACC */
6626
6627void
1579bae1
AM
6628lang_add_wild (struct wildcard_spec *filespec,
6629 struct wildcard_list *section_list,
6630 bfd_boolean keep_sections)
252b5132 6631{
b6bf44ba 6632 struct wildcard_list *curr, *next;
d3ce72d0 6633 lang_wild_statement_type *new_stmt;
b6bf44ba
AM
6634
6635 /* Reverse the list as the parser puts it back to front. */
6636 for (curr = section_list, section_list = NULL;
6637 curr != NULL;
6638 section_list = curr, curr = next)
6639 {
6640 if (curr->spec.name != NULL && strcmp (curr->spec.name, "COMMON") == 0)
b34976b6 6641 placed_commons = TRUE;
252b5132 6642
b6bf44ba
AM
6643 next = curr->next;
6644 curr->next = section_list;
6645 }
6646
6647 if (filespec != NULL && filespec->name != NULL)
252b5132 6648 {
b6bf44ba
AM
6649 if (strcmp (filespec->name, "*") == 0)
6650 filespec->name = NULL;
6651 else if (! wildcardp (filespec->name))
b34976b6 6652 lang_has_input_file = TRUE;
252b5132 6653 }
b6bf44ba 6654
d3ce72d0
NC
6655 new_stmt = new_stat (lang_wild_statement, stat_ptr);
6656 new_stmt->filename = NULL;
6657 new_stmt->filenames_sorted = FALSE;
b6bf44ba 6658 if (filespec != NULL)
252b5132 6659 {
d3ce72d0
NC
6660 new_stmt->filename = filespec->name;
6661 new_stmt->filenames_sorted = filespec->sorted == by_name;
252b5132 6662 }
d3ce72d0
NC
6663 new_stmt->section_list = section_list;
6664 new_stmt->keep_sections = keep_sections;
6665 lang_list_init (&new_stmt->children);
6666 analyze_walk_wild_section_handler (new_stmt);
252b5132
RH
6667}
6668
6669void
ba916c8a
MM
6670lang_section_start (const char *name, etree_type *address,
6671 const segment_type *segment)
252b5132 6672{
d1778b88 6673 lang_address_statement_type *ad;
252b5132 6674
d1778b88 6675 ad = new_stat (lang_address_statement, stat_ptr);
252b5132
RH
6676 ad->section_name = name;
6677 ad->address = address;
ba916c8a 6678 ad->segment = segment;
252b5132
RH
6679}
6680
6681/* Set the start symbol to NAME. CMDLINE is nonzero if this is called
6682 because of a -e argument on the command line, or zero if this is
6683 called by ENTRY in a linker script. Command line arguments take
6684 precedence. */
6685
6686void
1579bae1 6687lang_add_entry (const char *name, bfd_boolean cmdline)
252b5132 6688{
e3e942e9 6689 if (entry_symbol.name == NULL
252b5132
RH
6690 || cmdline
6691 || ! entry_from_cmdline)
6692 {
e3e942e9 6693 entry_symbol.name = name;
252b5132
RH
6694 entry_from_cmdline = cmdline;
6695 }
6696}
6697
a359509e
ZW
6698/* Set the default start symbol to NAME. .em files should use this,
6699 not lang_add_entry, to override the use of "start" if neither the
6700 linker script nor the command line specifies an entry point. NAME
6701 must be permanently allocated. */
6702void
6703lang_default_entry (const char *name)
6704{
6705 entry_symbol_default = name;
6706}
6707
252b5132 6708void
1579bae1 6709lang_add_target (const char *name)
252b5132 6710{
d3ce72d0 6711 lang_target_statement_type *new_stmt;
252b5132 6712
d3ce72d0
NC
6713 new_stmt = new_stat (lang_target_statement, stat_ptr);
6714 new_stmt->target = name;
252b5132
RH
6715}
6716
6717void
1579bae1 6718lang_add_map (const char *name)
252b5132
RH
6719{
6720 while (*name)
6721 {
6722 switch (*name)
6723 {
08da4cac 6724 case 'F':
b34976b6 6725 map_option_f = TRUE;
252b5132
RH
6726 break;
6727 }
6728 name++;
6729 }
6730}
6731
6732void
1579bae1 6733lang_add_fill (fill_type *fill)
252b5132 6734{
d3ce72d0 6735 lang_fill_statement_type *new_stmt;
252b5132 6736
d3ce72d0
NC
6737 new_stmt = new_stat (lang_fill_statement, stat_ptr);
6738 new_stmt->fill = fill;
252b5132
RH
6739}
6740
6741void
1579bae1 6742lang_add_data (int type, union etree_union *exp)
252b5132 6743{
d3ce72d0 6744 lang_data_statement_type *new_stmt;
252b5132 6745
d3ce72d0
NC
6746 new_stmt = new_stat (lang_data_statement, stat_ptr);
6747 new_stmt->exp = exp;
6748 new_stmt->type = type;
252b5132
RH
6749}
6750
6751/* Create a new reloc statement. RELOC is the BFD relocation type to
6752 generate. HOWTO is the corresponding howto structure (we could
6753 look this up, but the caller has already done so). SECTION is the
6754 section to generate a reloc against, or NAME is the name of the
6755 symbol to generate a reloc against. Exactly one of SECTION and
6756 NAME must be NULL. ADDEND is an expression for the addend. */
6757
6758void
1579bae1
AM
6759lang_add_reloc (bfd_reloc_code_real_type reloc,
6760 reloc_howto_type *howto,
6761 asection *section,
6762 const char *name,
6763 union etree_union *addend)
252b5132
RH
6764{
6765 lang_reloc_statement_type *p = new_stat (lang_reloc_statement, stat_ptr);
5f992e62 6766
252b5132
RH
6767 p->reloc = reloc;
6768 p->howto = howto;
6769 p->section = section;
6770 p->name = name;
6771 p->addend_exp = addend;
6772
6773 p->addend_value = 0;
6774 p->output_section = NULL;
7fabd029 6775 p->output_offset = 0;
252b5132
RH
6776}
6777
6778lang_assignment_statement_type *
1579bae1 6779lang_add_assignment (etree_type *exp)
252b5132 6780{
d3ce72d0 6781 lang_assignment_statement_type *new_stmt;
252b5132 6782
d3ce72d0
NC
6783 new_stmt = new_stat (lang_assignment_statement, stat_ptr);
6784 new_stmt->exp = exp;
6785 return new_stmt;
252b5132
RH
6786}
6787
6788void
1579bae1 6789lang_add_attribute (enum statement_enum attribute)
252b5132 6790{
bd4d42c1 6791 new_statement (attribute, sizeof (lang_statement_header_type), stat_ptr);
252b5132
RH
6792}
6793
6794void
1579bae1 6795lang_startup (const char *name)
252b5132 6796{
1e915804 6797 if (first_file->filename != NULL)
252b5132 6798 {
4520f868 6799 einfo (_("%P%F: multiple STARTUP files\n"));
252b5132
RH
6800 }
6801 first_file->filename = name;
6802 first_file->local_sym_name = name;
b34976b6 6803 first_file->real = TRUE;
252b5132
RH
6804}
6805
6806void
1579bae1 6807lang_float (bfd_boolean maybe)
252b5132
RH
6808{
6809 lang_float_flag = maybe;
6810}
6811
ee3cc2e2
RS
6812
6813/* Work out the load- and run-time regions from a script statement, and
6814 store them in *LMA_REGION and *REGION respectively.
6815
a747ee4d
NC
6816 MEMSPEC is the name of the run-time region, or the value of
6817 DEFAULT_MEMORY_REGION if the statement didn't specify one.
6818 LMA_MEMSPEC is the name of the load-time region, or null if the
6819 statement didn't specify one.HAVE_LMA_P is TRUE if the statement
6820 had an explicit load address.
ee3cc2e2
RS
6821
6822 It is an error to specify both a load region and a load address. */
6823
6824static void
6bdafbeb
NC
6825lang_get_regions (lang_memory_region_type **region,
6826 lang_memory_region_type **lma_region,
1579bae1
AM
6827 const char *memspec,
6828 const char *lma_memspec,
6bdafbeb
NC
6829 bfd_boolean have_lma,
6830 bfd_boolean have_vma)
ee3cc2e2 6831{
a747ee4d 6832 *lma_region = lang_memory_region_lookup (lma_memspec, FALSE);
ee3cc2e2 6833
6feb9908
AM
6834 /* If no runtime region or VMA has been specified, but the load region
6835 has been specified, then use the load region for the runtime region
6836 as well. */
6bdafbeb
NC
6837 if (lma_memspec != NULL
6838 && ! have_vma
6839 && strcmp (memspec, DEFAULT_MEMORY_REGION) == 0)
ee3cc2e2
RS
6840 *region = *lma_region;
6841 else
a747ee4d 6842 *region = lang_memory_region_lookup (memspec, FALSE);
ee3cc2e2 6843
6bdafbeb 6844 if (have_lma && lma_memspec != 0)
ee3cc2e2
RS
6845 einfo (_("%X%P:%S: section has both a load address and a load region\n"));
6846}
6847
252b5132 6848void
6bdafbeb
NC
6849lang_leave_output_section_statement (fill_type *fill, const char *memspec,
6850 lang_output_section_phdr_list *phdrs,
6851 const char *lma_memspec)
252b5132 6852{
ee3cc2e2
RS
6853 lang_get_regions (&current_section->region,
6854 &current_section->lma_region,
6855 memspec, lma_memspec,
6bdafbeb
NC
6856 current_section->load_base != NULL,
6857 current_section->addr_tree != NULL);
113e6845
NS
6858
6859 /* If this section has no load region or base, but has the same
6860 region as the previous section, then propagate the previous
6861 section's load region. */
6862
6863 if (!current_section->lma_region && !current_section->load_base
6864 && current_section->region == current_section->prev->region)
6865 current_section->lma_region = current_section->prev->lma_region;
1e0061d2 6866
252b5132 6867 current_section->fill = fill;
252b5132 6868 current_section->phdrs = phdrs;
bde18da4 6869 pop_stat_ptr ();
252b5132
RH
6870}
6871
08da4cac
KH
6872/* Create an absolute symbol with the given name with the value of the
6873 address of first byte of the section named.
6874
6875 If the symbol already exists, then do nothing. */
252b5132 6876
252b5132 6877void
1579bae1 6878lang_abs_symbol_at_beginning_of (const char *secname, const char *name)
252b5132
RH
6879{
6880 struct bfd_link_hash_entry *h;
6881
b34976b6 6882 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
1579bae1 6883 if (h == NULL)
252b5132
RH
6884 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6885
6886 if (h->type == bfd_link_hash_new
6887 || h->type == bfd_link_hash_undefined)
6888 {
6889 asection *sec;
6890
6891 h->type = bfd_link_hash_defined;
6892
f13a99db 6893 sec = bfd_get_section_by_name (link_info.output_bfd, secname);
1579bae1 6894 if (sec == NULL)
252b5132
RH
6895 h->u.def.value = 0;
6896 else
f13a99db 6897 h->u.def.value = bfd_get_section_vma (link_info.output_bfd, sec);
252b5132
RH
6898
6899 h->u.def.section = bfd_abs_section_ptr;
6900 }
6901}
6902
08da4cac
KH
6903/* Create an absolute symbol with the given name with the value of the
6904 address of the first byte after the end of the section named.
6905
6906 If the symbol already exists, then do nothing. */
252b5132 6907
252b5132 6908void
1579bae1 6909lang_abs_symbol_at_end_of (const char *secname, const char *name)
252b5132
RH
6910{
6911 struct bfd_link_hash_entry *h;
6912
b34976b6 6913 h = bfd_link_hash_lookup (link_info.hash, name, TRUE, TRUE, TRUE);
1579bae1 6914 if (h == NULL)
252b5132
RH
6915 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
6916
6917 if (h->type == bfd_link_hash_new
6918 || h->type == bfd_link_hash_undefined)
6919 {
6920 asection *sec;
6921
6922 h->type = bfd_link_hash_defined;
6923
f13a99db 6924 sec = bfd_get_section_by_name (link_info.output_bfd, secname);
1579bae1 6925 if (sec == NULL)
252b5132
RH
6926 h->u.def.value = 0;
6927 else
f13a99db 6928 h->u.def.value = (bfd_get_section_vma (link_info.output_bfd, sec)
eea6121a 6929 + TO_ADDR (sec->size));
252b5132
RH
6930
6931 h->u.def.section = bfd_abs_section_ptr;
6932 }
6933}
6934
6935void
1579bae1
AM
6936lang_statement_append (lang_statement_list_type *list,
6937 lang_statement_union_type *element,
6938 lang_statement_union_type **field)
252b5132
RH
6939{
6940 *(list->tail) = element;
6941 list->tail = field;
6942}
6943
8543fde5
DK
6944#ifdef ENABLE_PLUGINS
6945/* Insert SRCLIST into DESTLIST after given element by chaining
6946 on FIELD as the next-pointer. (Counterintuitively does not need
6947 a pointer to the actual after-node itself, just its chain field.) */
6948
6949static void
6950lang_list_insert_after (lang_statement_list_type *destlist,
6951 lang_statement_list_type *srclist,
6952 lang_statement_union_type **field)
6953{
6954 *(srclist->tail) = *field;
6955 *field = srclist->head;
6956 if (destlist->tail == field)
6957 destlist->tail = srclist->tail;
6958}
6959
6960/* Detach new nodes added to DESTLIST since the time ORIGLIST
6961 was taken as a copy of it and leave them in ORIGLIST. */
6962
6963static void
6964lang_list_remove_tail (lang_statement_list_type *destlist,
6965 lang_statement_list_type *origlist)
6966{
6967 union lang_statement_union **savetail;
6968 /* Check that ORIGLIST really is an earlier state of DESTLIST. */
6969 ASSERT (origlist->head == destlist->head);
6970 savetail = origlist->tail;
6971 origlist->head = *(savetail);
6972 origlist->tail = destlist->tail;
6973 destlist->tail = savetail;
6974 *savetail = NULL;
6975}
6976#endif /* ENABLE_PLUGINS */
6977
252b5132
RH
6978/* Set the output format type. -oformat overrides scripts. */
6979
6980void
1579bae1
AM
6981lang_add_output_format (const char *format,
6982 const char *big,
6983 const char *little,
6984 int from_script)
252b5132
RH
6985{
6986 if (output_target == NULL || !from_script)
6987 {
6988 if (command_line.endian == ENDIAN_BIG
6989 && big != NULL)
6990 format = big;
6991 else if (command_line.endian == ENDIAN_LITTLE
6992 && little != NULL)
6993 format = little;
6994
6995 output_target = format;
6996 }
6997}
6998
53d25da6
AM
6999void
7000lang_add_insert (const char *where, int is_before)
7001{
d3ce72d0 7002 lang_insert_statement_type *new_stmt;
53d25da6 7003
d3ce72d0
NC
7004 new_stmt = new_stat (lang_insert_statement, stat_ptr);
7005 new_stmt->where = where;
7006 new_stmt->is_before = is_before;
53d25da6
AM
7007 saved_script_handle = previous_script_handle;
7008}
7009
252b5132
RH
7010/* Enter a group. This creates a new lang_group_statement, and sets
7011 stat_ptr to build new statements within the group. */
7012
7013void
1579bae1 7014lang_enter_group (void)
252b5132
RH
7015{
7016 lang_group_statement_type *g;
7017
7018 g = new_stat (lang_group_statement, stat_ptr);
7019 lang_list_init (&g->children);
bde18da4 7020 push_stat_ptr (&g->children);
252b5132
RH
7021}
7022
7023/* Leave a group. This just resets stat_ptr to start writing to the
7024 regular list of statements again. Note that this will not work if
7025 groups can occur inside anything else which can adjust stat_ptr,
7026 but currently they can't. */
7027
7028void
1579bae1 7029lang_leave_group (void)
252b5132 7030{
bde18da4 7031 pop_stat_ptr ();
252b5132
RH
7032}
7033
7034/* Add a new program header. This is called for each entry in a PHDRS
7035 command in a linker script. */
7036
7037void
1579bae1
AM
7038lang_new_phdr (const char *name,
7039 etree_type *type,
7040 bfd_boolean filehdr,
7041 bfd_boolean phdrs,
7042 etree_type *at,
7043 etree_type *flags)
252b5132
RH
7044{
7045 struct lang_phdr *n, **pp;
5c1a3f0f 7046 bfd_boolean hdrs;
252b5132 7047
1e9cc1c2 7048 n = (struct lang_phdr *) stat_alloc (sizeof (struct lang_phdr));
252b5132
RH
7049 n->next = NULL;
7050 n->name = name;
e9ee469a 7051 n->type = exp_get_value_int (type, 0, "program header type");
252b5132
RH
7052 n->filehdr = filehdr;
7053 n->phdrs = phdrs;
7054 n->at = at;
7055 n->flags = flags;
1e0061d2 7056
5c1a3f0f 7057 hdrs = n->type == 1 && (phdrs || filehdr);
252b5132
RH
7058
7059 for (pp = &lang_phdr_list; *pp != NULL; pp = &(*pp)->next)
4100cea3
AM
7060 if (hdrs
7061 && (*pp)->type == 1
7062 && !((*pp)->filehdr || (*pp)->phdrs))
5c1a3f0f 7063 {
4100cea3 7064 einfo (_("%X%P:%S: PHDRS and FILEHDR are not supported when prior PT_LOAD headers lack them\n"));
5c1a3f0f
NS
7065 hdrs = FALSE;
7066 }
7067
252b5132
RH
7068 *pp = n;
7069}
7070
7071/* Record the program header information in the output BFD. FIXME: We
7072 should not be calling an ELF specific function here. */
7073
7074static void
1579bae1 7075lang_record_phdrs (void)
252b5132
RH
7076{
7077 unsigned int alc;
7078 asection **secs;
6bdafbeb 7079 lang_output_section_phdr_list *last;
252b5132 7080 struct lang_phdr *l;
afd7a018 7081 lang_output_section_statement_type *os;
252b5132
RH
7082
7083 alc = 10;
1e9cc1c2 7084 secs = (asection **) xmalloc (alc * sizeof (asection *));
252b5132 7085 last = NULL;
591a748a 7086
252b5132
RH
7087 for (l = lang_phdr_list; l != NULL; l = l->next)
7088 {
7089 unsigned int c;
7090 flagword flags;
7091 bfd_vma at;
7092
7093 c = 0;
afd7a018
AM
7094 for (os = &lang_output_section_statement.head->output_section_statement;
7095 os != NULL;
7096 os = os->next)
252b5132 7097 {
6bdafbeb 7098 lang_output_section_phdr_list *pl;
252b5132 7099
66c103b7 7100 if (os->constraint < 0)
0841712e 7101 continue;
252b5132
RH
7102
7103 pl = os->phdrs;
7104 if (pl != NULL)
7105 last = pl;
7106 else
7107 {
7108 if (os->sectype == noload_section
7109 || os->bfd_section == NULL
7110 || (os->bfd_section->flags & SEC_ALLOC) == 0)
7111 continue;
591a748a 7112
7512c397
AM
7113 /* Don't add orphans to PT_INTERP header. */
7114 if (l->type == 3)
7115 continue;
7116
e9442572 7117 if (last == NULL)
591a748a
NC
7118 {
7119 lang_output_section_statement_type * tmp_os;
7120
7121 /* If we have not run across a section with a program
7122 header assigned to it yet, then scan forwards to find
7123 one. This prevents inconsistencies in the linker's
7124 behaviour when a script has specified just a single
7125 header and there are sections in that script which are
7126 not assigned to it, and which occur before the first
7127 use of that header. See here for more details:
7128 http://sourceware.org/ml/binutils/2007-02/msg00291.html */
7129 for (tmp_os = os; tmp_os; tmp_os = tmp_os->next)
7130 if (tmp_os->phdrs)
e9442572
AM
7131 {
7132 last = tmp_os->phdrs;
7133 break;
7134 }
7135 if (last == NULL)
7136 einfo (_("%F%P: no sections assigned to phdrs\n"));
591a748a 7137 }
e9442572 7138 pl = last;
252b5132
RH
7139 }
7140
7141 if (os->bfd_section == NULL)
7142 continue;
7143
7144 for (; pl != NULL; pl = pl->next)
7145 {
7146 if (strcmp (pl->name, l->name) == 0)
7147 {
7148 if (c >= alc)
7149 {
7150 alc *= 2;
1e9cc1c2
NC
7151 secs = (asection **) xrealloc (secs,
7152 alc * sizeof (asection *));
252b5132
RH
7153 }
7154 secs[c] = os->bfd_section;
7155 ++c;
b34976b6 7156 pl->used = TRUE;
252b5132
RH
7157 }
7158 }
7159 }
7160
7161 if (l->flags == NULL)
7162 flags = 0;
7163 else
e9ee469a 7164 flags = exp_get_vma (l->flags, 0, "phdr flags");
252b5132
RH
7165
7166 if (l->at == NULL)
7167 at = 0;
7168 else
e9ee469a 7169 at = exp_get_vma (l->at, 0, "phdr load address");
252b5132 7170
f13a99db 7171 if (! bfd_record_phdr (link_info.output_bfd, l->type,
d1778b88 7172 l->flags != NULL, flags, l->at != NULL,
252b5132
RH
7173 at, l->filehdr, l->phdrs, c, secs))
7174 einfo (_("%F%P: bfd_record_phdr failed: %E\n"));
7175 }
7176
7177 free (secs);
7178
7179 /* Make sure all the phdr assignments succeeded. */
afd7a018
AM
7180 for (os = &lang_output_section_statement.head->output_section_statement;
7181 os != NULL;
7182 os = os->next)
252b5132 7183 {
6bdafbeb 7184 lang_output_section_phdr_list *pl;
252b5132 7185
66c103b7 7186 if (os->constraint < 0
afd7a018 7187 || os->bfd_section == NULL)
252b5132
RH
7188 continue;
7189
afd7a018 7190 for (pl = os->phdrs;
252b5132
RH
7191 pl != NULL;
7192 pl = pl->next)
7193 if (! pl->used && strcmp (pl->name, "NONE") != 0)
7194 einfo (_("%X%P: section `%s' assigned to non-existent phdr `%s'\n"),
afd7a018 7195 os->name, pl->name);
252b5132
RH
7196 }
7197}
7198
7199/* Record a list of sections which may not be cross referenced. */
7200
7201void
6bdafbeb 7202lang_add_nocrossref (lang_nocrossref_type *l)
252b5132
RH
7203{
7204 struct lang_nocrossrefs *n;
7205
1e9cc1c2 7206 n = (struct lang_nocrossrefs *) xmalloc (sizeof *n);
252b5132
RH
7207 n->next = nocrossref_list;
7208 n->list = l;
7209 nocrossref_list = n;
7210
7211 /* Set notice_all so that we get informed about all symbols. */
b34976b6 7212 link_info.notice_all = TRUE;
252b5132
RH
7213}
7214\f
7215/* Overlay handling. We handle overlays with some static variables. */
7216
7217/* The overlay virtual address. */
7218static etree_type *overlay_vma;
7e7d5768
AM
7219/* And subsection alignment. */
7220static etree_type *overlay_subalign;
252b5132 7221
252b5132
RH
7222/* An expression for the maximum section size seen so far. */
7223static etree_type *overlay_max;
7224
7225/* A list of all the sections in this overlay. */
7226
89cdebba 7227struct overlay_list {
252b5132
RH
7228 struct overlay_list *next;
7229 lang_output_section_statement_type *os;
7230};
7231
7232static struct overlay_list *overlay_list;
7233
7234/* Start handling an overlay. */
7235
7236void
7e7d5768 7237lang_enter_overlay (etree_type *vma_expr, etree_type *subalign)
252b5132
RH
7238{
7239 /* The grammar should prevent nested overlays from occurring. */
7e7d5768
AM
7240 ASSERT (overlay_vma == NULL
7241 && overlay_subalign == NULL
7242 && overlay_max == NULL);
252b5132
RH
7243
7244 overlay_vma = vma_expr;
7e7d5768 7245 overlay_subalign = subalign;
252b5132
RH
7246}
7247
7248/* Start a section in an overlay. We handle this by calling
9f88b410
RS
7249 lang_enter_output_section_statement with the correct VMA.
7250 lang_leave_overlay sets up the LMA and memory regions. */
252b5132
RH
7251
7252void
1579bae1 7253lang_enter_overlay_section (const char *name)
252b5132
RH
7254{
7255 struct overlay_list *n;
7256 etree_type *size;
7257
152d792f 7258 lang_enter_output_section_statement (name, overlay_vma, overlay_section,
0841712e 7259 0, overlay_subalign, 0, 0);
252b5132 7260
9f88b410 7261 /* If this is the first section, then base the VMA of future
252b5132
RH
7262 sections on this one. This will work correctly even if `.' is
7263 used in the addresses. */
7264 if (overlay_list == NULL)
9f88b410 7265 overlay_vma = exp_nameop (ADDR, name);
252b5132
RH
7266
7267 /* Remember the section. */
1e9cc1c2 7268 n = (struct overlay_list *) xmalloc (sizeof *n);
252b5132
RH
7269 n->os = current_section;
7270 n->next = overlay_list;
7271 overlay_list = n;
7272
7273 size = exp_nameop (SIZEOF, name);
7274
252b5132
RH
7275 /* Arrange to work out the maximum section end address. */
7276 if (overlay_max == NULL)
7277 overlay_max = size;
7278 else
7279 overlay_max = exp_binop (MAX_K, overlay_max, size);
7280}
7281
7282/* Finish a section in an overlay. There isn't any special to do
7283 here. */
7284
7285void
1579bae1 7286lang_leave_overlay_section (fill_type *fill,
6bdafbeb 7287 lang_output_section_phdr_list *phdrs)
252b5132
RH
7288{
7289 const char *name;
7290 char *clean, *s2;
7291 const char *s1;
7292 char *buf;
7293
7294 name = current_section->name;
7295
a747ee4d
NC
7296 /* For now, assume that DEFAULT_MEMORY_REGION is the run-time memory
7297 region and that no load-time region has been specified. It doesn't
7298 really matter what we say here, since lang_leave_overlay will
7299 override it. */
7300 lang_leave_output_section_statement (fill, DEFAULT_MEMORY_REGION, phdrs, 0);
252b5132
RH
7301
7302 /* Define the magic symbols. */
7303
1e9cc1c2 7304 clean = (char *) xmalloc (strlen (name) + 1);
252b5132
RH
7305 s2 = clean;
7306 for (s1 = name; *s1 != '\0'; s1++)
3882b010 7307 if (ISALNUM (*s1) || *s1 == '_')
252b5132
RH
7308 *s2++ = *s1;
7309 *s2 = '\0';
7310
1e9cc1c2 7311 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_start_");
252b5132 7312 sprintf (buf, "__load_start_%s", clean);
34711ca3
AM
7313 lang_add_assignment (exp_provide (buf,
7314 exp_nameop (LOADADDR, name),
7315 FALSE));
252b5132 7316
1e9cc1c2 7317 buf = (char *) xmalloc (strlen (clean) + sizeof "__load_stop_");
252b5132 7318 sprintf (buf, "__load_stop_%s", clean);
34711ca3
AM
7319 lang_add_assignment (exp_provide (buf,
7320 exp_binop ('+',
7321 exp_nameop (LOADADDR, name),
7322 exp_nameop (SIZEOF, name)),
7323 FALSE));
252b5132
RH
7324
7325 free (clean);
7326}
7327
7328/* Finish an overlay. If there are any overlay wide settings, this
7329 looks through all the sections in the overlay and sets them. */
7330
7331void
1579bae1
AM
7332lang_leave_overlay (etree_type *lma_expr,
7333 int nocrossrefs,
7334 fill_type *fill,
7335 const char *memspec,
6bdafbeb 7336 lang_output_section_phdr_list *phdrs,
1579bae1 7337 const char *lma_memspec)
252b5132
RH
7338{
7339 lang_memory_region_type *region;
562d3460 7340 lang_memory_region_type *lma_region;
252b5132 7341 struct overlay_list *l;
6bdafbeb 7342 lang_nocrossref_type *nocrossref;
252b5132 7343
ee3cc2e2
RS
7344 lang_get_regions (&region, &lma_region,
7345 memspec, lma_memspec,
6bdafbeb 7346 lma_expr != NULL, FALSE);
562d3460 7347
252b5132
RH
7348 nocrossref = NULL;
7349
9f88b410
RS
7350 /* After setting the size of the last section, set '.' to end of the
7351 overlay region. */
7352 if (overlay_list != NULL)
7353 overlay_list->os->update_dot_tree
2e57b2af 7354 = exp_assign (".", exp_binop ('+', overlay_vma, overlay_max));
9f88b410 7355
252b5132
RH
7356 l = overlay_list;
7357 while (l != NULL)
7358 {
7359 struct overlay_list *next;
7360
1579bae1 7361 if (fill != NULL && l->os->fill == NULL)
252b5132 7362 l->os->fill = fill;
1545243b 7363
9f88b410
RS
7364 l->os->region = region;
7365 l->os->lma_region = lma_region;
7366
7367 /* The first section has the load address specified in the
7368 OVERLAY statement. The rest are worked out from that.
7369 The base address is not needed (and should be null) if
7370 an LMA region was specified. */
7371 if (l->next == 0)
152d792f
AM
7372 {
7373 l->os->load_base = lma_expr;
7374 l->os->sectype = normal_section;
7375 }
252b5132
RH
7376 if (phdrs != NULL && l->os->phdrs == NULL)
7377 l->os->phdrs = phdrs;
7378
9f88b410 7379 if (nocrossrefs)
252b5132 7380 {
6bdafbeb 7381 lang_nocrossref_type *nc;
252b5132 7382
1e9cc1c2 7383 nc = (lang_nocrossref_type *) xmalloc (sizeof *nc);
252b5132
RH
7384 nc->name = l->os->name;
7385 nc->next = nocrossref;
7386 nocrossref = nc;
7387 }
7388
7389 next = l->next;
7390 free (l);
7391 l = next;
7392 }
7393
7394 if (nocrossref != NULL)
7395 lang_add_nocrossref (nocrossref);
7396
252b5132 7397 overlay_vma = NULL;
252b5132
RH
7398 overlay_list = NULL;
7399 overlay_max = NULL;
7400}
7401\f
7402/* Version handling. This is only useful for ELF. */
7403
7404/* This global variable holds the version tree that we build. */
7405
7406struct bfd_elf_version_tree *lang_elf_version_info;
7407
108ba305
JJ
7408/* If PREV is NULL, return first version pattern matching particular symbol.
7409 If PREV is non-NULL, return first version pattern matching particular
7410 symbol after PREV (previously returned by lang_vers_match). */
252b5132 7411
108ba305
JJ
7412static struct bfd_elf_version_expr *
7413lang_vers_match (struct bfd_elf_version_expr_head *head,
7414 struct bfd_elf_version_expr *prev,
7415 const char *sym)
252b5132 7416{
93252b1c 7417 const char *c_sym;
108ba305
JJ
7418 const char *cxx_sym = sym;
7419 const char *java_sym = sym;
7420 struct bfd_elf_version_expr *expr = NULL;
93252b1c
MF
7421 enum demangling_styles curr_style;
7422
7423 curr_style = CURRENT_DEMANGLING_STYLE;
7424 cplus_demangle_set_style (no_demangling);
7425 c_sym = bfd_demangle (link_info.output_bfd, sym, DMGL_NO_OPTS);
7426 if (!c_sym)
7427 c_sym = sym;
7428 cplus_demangle_set_style (curr_style);
252b5132 7429
108ba305 7430 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
252b5132 7431 {
93252b1c
MF
7432 cxx_sym = bfd_demangle (link_info.output_bfd, sym,
7433 DMGL_PARAMS | DMGL_ANSI);
108ba305
JJ
7434 if (!cxx_sym)
7435 cxx_sym = sym;
252b5132 7436 }
df816215 7437 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
252b5132 7438 {
93252b1c 7439 java_sym = bfd_demangle (link_info.output_bfd, sym, DMGL_JAVA);
108ba305
JJ
7440 if (!java_sym)
7441 java_sym = sym;
252b5132
RH
7442 }
7443
ae5a3597 7444 if (head->htab && (prev == NULL || prev->literal))
252b5132 7445 {
108ba305
JJ
7446 struct bfd_elf_version_expr e;
7447
7448 switch (prev ? prev->mask : 0)
7449 {
967928e9
AM
7450 case 0:
7451 if (head->mask & BFD_ELF_VERSION_C_TYPE)
7452 {
93252b1c 7453 e.pattern = c_sym;
1e9cc1c2
NC
7454 expr = (struct bfd_elf_version_expr *)
7455 htab_find ((htab_t) head->htab, &e);
93252b1c 7456 while (expr && strcmp (expr->pattern, c_sym) == 0)
967928e9
AM
7457 if (expr->mask == BFD_ELF_VERSION_C_TYPE)
7458 goto out_ret;
7459 else
7460 expr = expr->next;
7461 }
7462 /* Fallthrough */
7463 case BFD_ELF_VERSION_C_TYPE:
7464 if (head->mask & BFD_ELF_VERSION_CXX_TYPE)
7465 {
ae5a3597 7466 e.pattern = cxx_sym;
1e9cc1c2
NC
7467 expr = (struct bfd_elf_version_expr *)
7468 htab_find ((htab_t) head->htab, &e);
ae5a3597 7469 while (expr && strcmp (expr->pattern, cxx_sym) == 0)
967928e9
AM
7470 if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7471 goto out_ret;
7472 else
7473 expr = expr->next;
7474 }
7475 /* Fallthrough */
7476 case BFD_ELF_VERSION_CXX_TYPE:
7477 if (head->mask & BFD_ELF_VERSION_JAVA_TYPE)
7478 {
ae5a3597 7479 e.pattern = java_sym;
1e9cc1c2
NC
7480 expr = (struct bfd_elf_version_expr *)
7481 htab_find ((htab_t) head->htab, &e);
ae5a3597 7482 while (expr && strcmp (expr->pattern, java_sym) == 0)
967928e9
AM
7483 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7484 goto out_ret;
7485 else
7486 expr = expr->next;
7487 }
7488 /* Fallthrough */
7489 default:
7490 break;
108ba305 7491 }
252b5132 7492 }
108ba305
JJ
7493
7494 /* Finally, try the wildcards. */
ae5a3597 7495 if (prev == NULL || prev->literal)
108ba305 7496 expr = head->remaining;
252b5132 7497 else
108ba305 7498 expr = prev->next;
86043bbb 7499 for (; expr; expr = expr->next)
252b5132 7500 {
108ba305
JJ
7501 const char *s;
7502
86043bbb
MM
7503 if (!expr->pattern)
7504 continue;
7505
108ba305
JJ
7506 if (expr->pattern[0] == '*' && expr->pattern[1] == '\0')
7507 break;
7508
7509 if (expr->mask == BFD_ELF_VERSION_JAVA_TYPE)
7510 s = java_sym;
7511 else if (expr->mask == BFD_ELF_VERSION_CXX_TYPE)
7512 s = cxx_sym;
7513 else
93252b1c 7514 s = c_sym;
5e35cbc2 7515 if (fnmatch (expr->pattern, s, 0) == 0)
108ba305 7516 break;
252b5132
RH
7517 }
7518
967928e9 7519 out_ret:
93252b1c
MF
7520 if (c_sym != sym)
7521 free ((char *) c_sym);
108ba305
JJ
7522 if (cxx_sym != sym)
7523 free ((char *) cxx_sym);
7524 if (java_sym != sym)
7525 free ((char *) java_sym);
7526 return expr;
252b5132
RH
7527}
7528
5e35cbc2 7529/* Return NULL if the PATTERN argument is a glob pattern, otherwise,
ae5a3597 7530 return a pointer to the symbol name with any backslash quotes removed. */
5e35cbc2
L
7531
7532static const char *
7533realsymbol (const char *pattern)
7534{
7535 const char *p;
7536 bfd_boolean changed = FALSE, backslash = FALSE;
1e9cc1c2 7537 char *s, *symbol = (char *) xmalloc (strlen (pattern) + 1);
5e35cbc2
L
7538
7539 for (p = pattern, s = symbol; *p != '\0'; ++p)
7540 {
7541 /* It is a glob pattern only if there is no preceding
7542 backslash. */
5e35cbc2
L
7543 if (backslash)
7544 {
7545 /* Remove the preceding backslash. */
7546 *(s - 1) = *p;
ae5a3597 7547 backslash = FALSE;
5e35cbc2
L
7548 changed = TRUE;
7549 }
7550 else
ae5a3597
AM
7551 {
7552 if (*p == '?' || *p == '*' || *p == '[')
7553 {
7554 free (symbol);
7555 return NULL;
7556 }
5e35cbc2 7557
ae5a3597
AM
7558 *s++ = *p;
7559 backslash = *p == '\\';
7560 }
5e35cbc2
L
7561 }
7562
7563 if (changed)
7564 {
7565 *s = '\0';
7566 return symbol;
7567 }
7568 else
7569 {
7570 free (symbol);
7571 return pattern;
7572 }
7573}
7574
d3ce72d0 7575/* This is called for each variable name or match expression. NEW_NAME is
86043bbb
MM
7576 the name of the symbol to match, or, if LITERAL_P is FALSE, a glob
7577 pattern to be matched against symbol names. */
252b5132
RH
7578
7579struct bfd_elf_version_expr *
1579bae1 7580lang_new_vers_pattern (struct bfd_elf_version_expr *orig,
d3ce72d0 7581 const char *new_name,
86043bbb
MM
7582 const char *lang,
7583 bfd_boolean literal_p)
252b5132
RH
7584{
7585 struct bfd_elf_version_expr *ret;
7586
d3ce72d0 7587 ret = (struct bfd_elf_version_expr *) xmalloc (sizeof *ret);
252b5132 7588 ret->next = orig;
31941635
L
7589 ret->symver = 0;
7590 ret->script = 0;
ae5a3597 7591 ret->literal = TRUE;
d3ce72d0 7592 ret->pattern = literal_p ? new_name : realsymbol (new_name);
ae5a3597
AM
7593 if (ret->pattern == NULL)
7594 {
d3ce72d0 7595 ret->pattern = new_name;
ae5a3597
AM
7596 ret->literal = FALSE;
7597 }
252b5132
RH
7598
7599 if (lang == NULL || strcasecmp (lang, "C") == 0)
108ba305 7600 ret->mask = BFD_ELF_VERSION_C_TYPE;
252b5132 7601 else if (strcasecmp (lang, "C++") == 0)
108ba305 7602 ret->mask = BFD_ELF_VERSION_CXX_TYPE;
252b5132 7603 else if (strcasecmp (lang, "Java") == 0)
108ba305 7604 ret->mask = BFD_ELF_VERSION_JAVA_TYPE;
252b5132
RH
7605 else
7606 {
7607 einfo (_("%X%P: unknown language `%s' in version information\n"),
7608 lang);
108ba305 7609 ret->mask = BFD_ELF_VERSION_C_TYPE;
252b5132
RH
7610 }
7611
fac1652d 7612 return ldemul_new_vers_pattern (ret);
252b5132
RH
7613}
7614
7615/* This is called for each set of variable names and match
7616 expressions. */
7617
7618struct bfd_elf_version_tree *
1579bae1
AM
7619lang_new_vers_node (struct bfd_elf_version_expr *globals,
7620 struct bfd_elf_version_expr *locals)
252b5132
RH
7621{
7622 struct bfd_elf_version_tree *ret;
7623
1e9cc1c2 7624 ret = (struct bfd_elf_version_tree *) xcalloc (1, sizeof *ret);
108ba305
JJ
7625 ret->globals.list = globals;
7626 ret->locals.list = locals;
7627 ret->match = lang_vers_match;
252b5132 7628 ret->name_indx = (unsigned int) -1;
252b5132
RH
7629 return ret;
7630}
7631
7632/* This static variable keeps track of version indices. */
7633
7634static int version_index;
7635
108ba305
JJ
7636static hashval_t
7637version_expr_head_hash (const void *p)
7638{
1e9cc1c2
NC
7639 const struct bfd_elf_version_expr *e =
7640 (const struct bfd_elf_version_expr *) p;
108ba305 7641
ae5a3597 7642 return htab_hash_string (e->pattern);
108ba305
JJ
7643}
7644
7645static int
7646version_expr_head_eq (const void *p1, const void *p2)
7647{
1e9cc1c2
NC
7648 const struct bfd_elf_version_expr *e1 =
7649 (const struct bfd_elf_version_expr *) p1;
7650 const struct bfd_elf_version_expr *e2 =
7651 (const struct bfd_elf_version_expr *) p2;
108ba305 7652
ae5a3597 7653 return strcmp (e1->pattern, e2->pattern) == 0;
108ba305
JJ
7654}
7655
7656static void
7657lang_finalize_version_expr_head (struct bfd_elf_version_expr_head *head)
7658{
7659 size_t count = 0;
7660 struct bfd_elf_version_expr *e, *next;
7661 struct bfd_elf_version_expr **list_loc, **remaining_loc;
7662
7663 for (e = head->list; e; e = e->next)
7664 {
ae5a3597 7665 if (e->literal)
108ba305
JJ
7666 count++;
7667 head->mask |= e->mask;
7668 }
7669
7670 if (count)
7671 {
7672 head->htab = htab_create (count * 2, version_expr_head_hash,
7673 version_expr_head_eq, NULL);
7674 list_loc = &head->list;
7675 remaining_loc = &head->remaining;
7676 for (e = head->list; e; e = next)
7677 {
7678 next = e->next;
ae5a3597 7679 if (!e->literal)
108ba305
JJ
7680 {
7681 *remaining_loc = e;
7682 remaining_loc = &e->next;
7683 }
7684 else
7685 {
1e9cc1c2 7686 void **loc = htab_find_slot ((htab_t) head->htab, e, INSERT);
108ba305
JJ
7687
7688 if (*loc)
7689 {
7690 struct bfd_elf_version_expr *e1, *last;
7691
1e9cc1c2 7692 e1 = (struct bfd_elf_version_expr *) *loc;
108ba305
JJ
7693 last = NULL;
7694 do
7695 {
7696 if (e1->mask == e->mask)
7697 {
7698 last = NULL;
7699 break;
7700 }
7701 last = e1;
7702 e1 = e1->next;
7703 }
ae5a3597 7704 while (e1 && strcmp (e1->pattern, e->pattern) == 0);
108ba305
JJ
7705
7706 if (last == NULL)
7707 {
7708 /* This is a duplicate. */
7709 /* FIXME: Memory leak. Sometimes pattern is not
7710 xmalloced alone, but in larger chunk of memory. */
ae5a3597 7711 /* free (e->pattern); */
108ba305
JJ
7712 free (e);
7713 }
7714 else
7715 {
7716 e->next = last->next;
7717 last->next = e;
7718 }
7719 }
7720 else
7721 {
7722 *loc = e;
7723 *list_loc = e;
7724 list_loc = &e->next;
7725 }
7726 }
7727 }
7728 *remaining_loc = NULL;
7729 *list_loc = head->remaining;
7730 }
7731 else
7732 head->remaining = head->list;
7733}
7734
252b5132
RH
7735/* This is called when we know the name and dependencies of the
7736 version. */
7737
7738void
1579bae1
AM
7739lang_register_vers_node (const char *name,
7740 struct bfd_elf_version_tree *version,
7741 struct bfd_elf_version_deps *deps)
252b5132
RH
7742{
7743 struct bfd_elf_version_tree *t, **pp;
7744 struct bfd_elf_version_expr *e1;
7745
6b9b879a
JJ
7746 if (name == NULL)
7747 name = "";
7748
7749 if ((name[0] == '\0' && lang_elf_version_info != NULL)
7750 || (lang_elf_version_info && lang_elf_version_info->name[0] == '\0'))
7751 {
6feb9908
AM
7752 einfo (_("%X%P: anonymous version tag cannot be combined"
7753 " with other version tags\n"));
5ed6aba4 7754 free (version);
6b9b879a
JJ
7755 return;
7756 }
7757
252b5132
RH
7758 /* Make sure this node has a unique name. */
7759 for (t = lang_elf_version_info; t != NULL; t = t->next)
7760 if (strcmp (t->name, name) == 0)
7761 einfo (_("%X%P: duplicate version tag `%s'\n"), name);
7762
108ba305
JJ
7763 lang_finalize_version_expr_head (&version->globals);
7764 lang_finalize_version_expr_head (&version->locals);
7765
252b5132
RH
7766 /* Check the global and local match names, and make sure there
7767 aren't any duplicates. */
7768
108ba305 7769 for (e1 = version->globals.list; e1 != NULL; e1 = e1->next)
252b5132
RH
7770 {
7771 for (t = lang_elf_version_info; t != NULL; t = t->next)
7772 {
7773 struct bfd_elf_version_expr *e2;
7774
ae5a3597 7775 if (t->locals.htab && e1->literal)
108ba305 7776 {
1e9cc1c2
NC
7777 e2 = (struct bfd_elf_version_expr *)
7778 htab_find ((htab_t) t->locals.htab, e1);
ae5a3597 7779 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
108ba305
JJ
7780 {
7781 if (e1->mask == e2->mask)
6feb9908 7782 einfo (_("%X%P: duplicate expression `%s'"
ae5a3597 7783 " in version information\n"), e1->pattern);
108ba305
JJ
7784 e2 = e2->next;
7785 }
7786 }
ae5a3597 7787 else if (!e1->literal)
108ba305 7788 for (e2 = t->locals.remaining; e2 != NULL; e2 = e2->next)
6feb9908
AM
7789 if (strcmp (e1->pattern, e2->pattern) == 0
7790 && e1->mask == e2->mask)
7791 einfo (_("%X%P: duplicate expression `%s'"
7792 " in version information\n"), e1->pattern);
252b5132
RH
7793 }
7794 }
7795
108ba305 7796 for (e1 = version->locals.list; e1 != NULL; e1 = e1->next)
252b5132
RH
7797 {
7798 for (t = lang_elf_version_info; t != NULL; t = t->next)
7799 {
7800 struct bfd_elf_version_expr *e2;
7801
ae5a3597 7802 if (t->globals.htab && e1->literal)
108ba305 7803 {
1e9cc1c2
NC
7804 e2 = (struct bfd_elf_version_expr *)
7805 htab_find ((htab_t) t->globals.htab, e1);
ae5a3597 7806 while (e2 && strcmp (e1->pattern, e2->pattern) == 0)
108ba305
JJ
7807 {
7808 if (e1->mask == e2->mask)
6feb9908
AM
7809 einfo (_("%X%P: duplicate expression `%s'"
7810 " in version information\n"),
ae5a3597 7811 e1->pattern);
108ba305
JJ
7812 e2 = e2->next;
7813 }
7814 }
ae5a3597 7815 else if (!e1->literal)
108ba305 7816 for (e2 = t->globals.remaining; e2 != NULL; e2 = e2->next)
6feb9908
AM
7817 if (strcmp (e1->pattern, e2->pattern) == 0
7818 && e1->mask == e2->mask)
7819 einfo (_("%X%P: duplicate expression `%s'"
7820 " in version information\n"), e1->pattern);
252b5132
RH
7821 }
7822 }
7823
7824 version->deps = deps;
7825 version->name = name;
6b9b879a
JJ
7826 if (name[0] != '\0')
7827 {
7828 ++version_index;
7829 version->vernum = version_index;
7830 }
7831 else
7832 version->vernum = 0;
252b5132
RH
7833
7834 for (pp = &lang_elf_version_info; *pp != NULL; pp = &(*pp)->next)
7835 ;
7836 *pp = version;
7837}
7838
7839/* This is called when we see a version dependency. */
7840
7841struct bfd_elf_version_deps *
1579bae1 7842lang_add_vers_depend (struct bfd_elf_version_deps *list, const char *name)
252b5132
RH
7843{
7844 struct bfd_elf_version_deps *ret;
7845 struct bfd_elf_version_tree *t;
7846
1e9cc1c2 7847 ret = (struct bfd_elf_version_deps *) xmalloc (sizeof *ret);
252b5132
RH
7848 ret->next = list;
7849
7850 for (t = lang_elf_version_info; t != NULL; t = t->next)
7851 {
7852 if (strcmp (t->name, name) == 0)
7853 {
7854 ret->version_needed = t;
7855 return ret;
7856 }
7857 }
7858
7859 einfo (_("%X%P: unable to find version dependency `%s'\n"), name);
7860
1e0061d2 7861 ret->version_needed = NULL;
252b5132
RH
7862 return ret;
7863}
7864
7865static void
1579bae1 7866lang_do_version_exports_section (void)
252b5132
RH
7867{
7868 struct bfd_elf_version_expr *greg = NULL, *lreg;
7869
7870 LANG_FOR_EACH_INPUT_STATEMENT (is)
7871 {
7872 asection *sec = bfd_get_section_by_name (is->the_bfd, ".exports");
7873 char *contents, *p;
7874 bfd_size_type len;
7875
7876 if (sec == NULL)
b7a26f91 7877 continue;
252b5132 7878
eea6121a 7879 len = sec->size;
1e9cc1c2 7880 contents = (char *) xmalloc (len);
252b5132 7881 if (!bfd_get_section_contents (is->the_bfd, sec, contents, 0, len))
6f9efd97 7882 einfo (_("%X%P: unable to read .exports section contents\n"), sec);
252b5132
RH
7883
7884 p = contents;
89cdebba 7885 while (p < contents + len)
252b5132 7886 {
86043bbb 7887 greg = lang_new_vers_pattern (greg, p, NULL, FALSE);
252b5132
RH
7888 p = strchr (p, '\0') + 1;
7889 }
7890
7891 /* Do not free the contents, as we used them creating the regex. */
7892
7893 /* Do not include this section in the link. */
a14a5de3 7894 sec->flags |= SEC_EXCLUDE | SEC_KEEP;
252b5132
RH
7895 }
7896
86043bbb 7897 lreg = lang_new_vers_pattern (NULL, "*", NULL, FALSE);
252b5132
RH
7898 lang_register_vers_node (command_line.version_exports_section,
7899 lang_new_vers_node (greg, lreg), NULL);
7900}
577a0623
AM
7901
7902void
1579bae1 7903lang_add_unique (const char *name)
577a0623
AM
7904{
7905 struct unique_sections *ent;
7906
7907 for (ent = unique_section_list; ent; ent = ent->next)
7908 if (strcmp (ent->name, name) == 0)
7909 return;
7910
1e9cc1c2 7911 ent = (struct unique_sections *) xmalloc (sizeof *ent);
577a0623
AM
7912 ent->name = xstrdup (name);
7913 ent->next = unique_section_list;
7914 unique_section_list = ent;
7915}
55255dae
L
7916
7917/* Append the list of dynamic symbols to the existing one. */
7918
7919void
7920lang_append_dynamic_list (struct bfd_elf_version_expr *dynamic)
7921{
40b36307 7922 if (link_info.dynamic_list)
55255dae 7923 {
07806542
JJ
7924 struct bfd_elf_version_expr *tail;
7925 for (tail = dynamic; tail->next != NULL; tail = tail->next)
7926 ;
40b36307
L
7927 tail->next = link_info.dynamic_list->head.list;
7928 link_info.dynamic_list->head.list = dynamic;
55255dae
L
7929 }
7930 else
7931 {
7932 struct bfd_elf_dynamic_list *d;
7933
1e9cc1c2 7934 d = (struct bfd_elf_dynamic_list *) xcalloc (1, sizeof *d);
55255dae
L
7935 d->head.list = dynamic;
7936 d->match = lang_vers_match;
40b36307 7937 link_info.dynamic_list = d;
55255dae
L
7938 }
7939}
7940
7941/* Append the list of C++ typeinfo dynamic symbols to the existing
7942 one. */
7943
7944void
7945lang_append_dynamic_list_cpp_typeinfo (void)
7946{
7947 const char * symbols [] =
7948 {
7949 "typeinfo name for*",
7950 "typeinfo for*"
7951 };
7952 struct bfd_elf_version_expr *dynamic = NULL;
7953 unsigned int i;
7954
7955 for (i = 0; i < ARRAY_SIZE (symbols); i++)
7956 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
7957 FALSE);
7958
7959 lang_append_dynamic_list (dynamic);
7960}
40b36307
L
7961
7962/* Append the list of C++ operator new and delete dynamic symbols to the
7963 existing one. */
7964
7965void
7966lang_append_dynamic_list_cpp_new (void)
7967{
7968 const char * symbols [] =
7969 {
7970 "operator new*",
7971 "operator delete*"
7972 };
7973 struct bfd_elf_version_expr *dynamic = NULL;
7974 unsigned int i;
7975
7976 for (i = 0; i < ARRAY_SIZE (symbols); i++)
7977 dynamic = lang_new_vers_pattern (dynamic, symbols [i], "C++",
7978 FALSE);
7979
7980 lang_append_dynamic_list (dynamic);
7981}
01554a74
AM
7982
7983/* Scan a space and/or comma separated string of features. */
7984
7985void
7986lang_ld_feature (char *str)
7987{
7988 char *p, *q;
7989
7990 p = str;
7991 while (*p)
7992 {
7993 char sep;
7994 while (*p == ',' || ISSPACE (*p))
7995 ++p;
7996 if (!*p)
7997 break;
7998 q = p + 1;
7999 while (*q && *q != ',' && !ISSPACE (*q))
8000 ++q;
8001 sep = *q;
8002 *q = 0;
8003 if (strcasecmp (p, "SANE_EXPR") == 0)
8004 config.sane_expr = TRUE;
8005 else
8006 einfo (_("%X%P: unknown feature `%s'\n"), p);
8007 *q = sep;
8008 p = q;
8009 }
8010}
This page took 1.318985 seconds and 4 git commands to generate.