1 /* ldwrite.c -- write out the linked file
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 2000, 2002,
3 2003, 2004, 2005, 2006, 2007, 2008, 2010
4 Free Software Foundation, Inc.
5 Written by Steve Chamberlain sac@cygnus.com
7 This file is part of the GNU Binutils.
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
22 MA 02110-1301, USA. */
27 #include "libiberty.h"
28 #include "safe-ctype.h"
38 /* Build link_order structures for the BFD linker. */
41 build_link_order (lang_statement_union_type
*statement
)
43 switch (statement
->header
.type
)
45 case lang_data_statement_enum
:
47 asection
*output_section
;
48 struct bfd_link_order
*link_order
;
50 bfd_boolean big_endian
= FALSE
;
52 output_section
= statement
->data_statement
.output_section
;
53 ASSERT (output_section
->owner
== link_info
.output_bfd
);
55 if (!((output_section
->flags
& SEC_HAS_CONTENTS
) != 0
56 || ((output_section
->flags
& SEC_LOAD
) != 0
57 && (output_section
->flags
& SEC_THREAD_LOCAL
))))
60 link_order
= bfd_new_link_order (link_info
.output_bfd
, output_section
);
61 if (link_order
== NULL
)
62 einfo (_("%P%F: bfd_new_link_order failed\n"));
64 link_order
->type
= bfd_data_link_order
;
65 link_order
->offset
= statement
->data_statement
.output_offset
;
66 link_order
->u
.data
.contents
= (bfd_byte
*) xmalloc (QUAD_SIZE
);
68 value
= statement
->data_statement
.value
;
70 /* If the endianness of the output BFD is not known, then we
71 base the endianness of the data on the first input file.
72 By convention, the bfd_put routines for an unknown
73 endianness are big endian, so we must swap here if the
74 input file is little endian. */
75 if (bfd_big_endian (link_info
.output_bfd
))
77 else if (bfd_little_endian (link_info
.output_bfd
))
84 if (command_line
.endian
== ENDIAN_BIG
)
86 else if (command_line
.endian
== ENDIAN_LITTLE
)
91 else if (command_line
.endian
== ENDIAN_UNSET
)
95 LANG_FOR_EACH_INPUT_STATEMENT (s
)
97 if (s
->the_bfd
!= NULL
)
99 if (bfd_little_endian (s
->the_bfd
))
114 switch (statement
->data_statement
.type
)
118 if (sizeof (bfd_vma
) >= QUAD_SIZE
)
120 bfd_putl64 (value
, buffer
);
121 value
= bfd_getb64 (buffer
);
126 bfd_putl32 (value
, buffer
);
127 value
= bfd_getb32 (buffer
);
130 bfd_putl16 (value
, buffer
);
131 value
= bfd_getb16 (buffer
);
141 ASSERT (output_section
->owner
== link_info
.output_bfd
);
142 switch (statement
->data_statement
.type
)
146 if (sizeof (bfd_vma
) >= QUAD_SIZE
)
147 bfd_put_64 (link_info
.output_bfd
, value
,
148 link_order
->u
.data
.contents
);
153 if (statement
->data_statement
.type
== QUAD
)
155 else if ((value
& 0x80000000) == 0)
159 bfd_put_32 (link_info
.output_bfd
, high
,
160 (link_order
->u
.data
.contents
161 + (big_endian
? 0 : 4)));
162 bfd_put_32 (link_info
.output_bfd
, value
,
163 (link_order
->u
.data
.contents
164 + (big_endian
? 4 : 0)));
166 link_order
->size
= QUAD_SIZE
;
169 bfd_put_32 (link_info
.output_bfd
, value
,
170 link_order
->u
.data
.contents
);
171 link_order
->size
= LONG_SIZE
;
174 bfd_put_16 (link_info
.output_bfd
, value
,
175 link_order
->u
.data
.contents
);
176 link_order
->size
= SHORT_SIZE
;
179 bfd_put_8 (link_info
.output_bfd
, value
,
180 link_order
->u
.data
.contents
);
181 link_order
->size
= BYTE_SIZE
;
186 link_order
->u
.data
.size
= link_order
->size
;
190 case lang_reloc_statement_enum
:
192 lang_reloc_statement_type
*rs
;
193 asection
*output_section
;
194 struct bfd_link_order
*link_order
;
196 rs
= &statement
->reloc_statement
;
198 output_section
= rs
->output_section
;
199 ASSERT (output_section
->owner
== link_info
.output_bfd
);
201 if (!((output_section
->flags
& SEC_HAS_CONTENTS
) != 0
202 || ((output_section
->flags
& SEC_LOAD
) != 0
203 && (output_section
->flags
& SEC_THREAD_LOCAL
))))
206 link_order
= bfd_new_link_order (link_info
.output_bfd
, output_section
);
207 if (link_order
== NULL
)
208 einfo (_("%P%F: bfd_new_link_order failed\n"));
210 link_order
->offset
= rs
->output_offset
;
211 link_order
->size
= bfd_get_reloc_size (rs
->howto
);
213 link_order
->u
.reloc
.p
= (struct bfd_link_order_reloc
*)
214 xmalloc (sizeof (struct bfd_link_order_reloc
));
216 link_order
->u
.reloc
.p
->reloc
= rs
->reloc
;
217 link_order
->u
.reloc
.p
->addend
= rs
->addend_value
;
219 if (rs
->name
== NULL
)
221 link_order
->type
= bfd_section_reloc_link_order
;
222 if (rs
->section
->owner
== link_info
.output_bfd
)
223 link_order
->u
.reloc
.p
->u
.section
= rs
->section
;
226 link_order
->u
.reloc
.p
->u
.section
= rs
->section
->output_section
;
227 link_order
->u
.reloc
.p
->addend
+= rs
->section
->output_offset
;
232 link_order
->type
= bfd_symbol_reloc_link_order
;
233 link_order
->u
.reloc
.p
->u
.name
= rs
->name
;
238 case lang_input_section_enum
:
240 /* Create a new link_order in the output section with this
242 asection
*i
= statement
->input_section
.section
;
244 if (!((lang_input_statement_type
*) i
->owner
->usrdata
)->just_syms_flag
245 && (i
->flags
& SEC_EXCLUDE
) == 0)
247 asection
*output_section
= i
->output_section
;
248 struct bfd_link_order
*link_order
;
250 ASSERT (output_section
->owner
== link_info
.output_bfd
);
252 if (!((output_section
->flags
& SEC_HAS_CONTENTS
) != 0
253 || ((output_section
->flags
& SEC_LOAD
) != 0
254 && (output_section
->flags
& SEC_THREAD_LOCAL
))))
257 link_order
= bfd_new_link_order (link_info
.output_bfd
,
260 if ((i
->flags
& SEC_NEVER_LOAD
) != 0
261 && (i
->flags
& SEC_DEBUGGING
) == 0)
263 /* We've got a never load section inside one which is
264 going to be output, we'll change it into a fill. */
265 link_order
->type
= bfd_data_link_order
;
266 link_order
->u
.data
.contents
= (unsigned char *) "";
267 link_order
->u
.data
.size
= 1;
271 link_order
->type
= bfd_indirect_link_order
;
272 link_order
->u
.indirect
.section
= i
;
273 ASSERT (i
->output_section
== output_section
);
275 link_order
->size
= i
->size
;
276 link_order
->offset
= i
->output_offset
;
281 case lang_padding_statement_enum
:
282 /* Make a new link_order with the right filler */
284 asection
*output_section
;
285 struct bfd_link_order
*link_order
;
287 output_section
= statement
->padding_statement
.output_section
;
288 ASSERT (statement
->padding_statement
.output_section
->owner
289 == link_info
.output_bfd
);
291 if (!((output_section
->flags
& SEC_HAS_CONTENTS
) != 0
292 || ((output_section
->flags
& SEC_LOAD
) != 0
293 && (output_section
->flags
& SEC_THREAD_LOCAL
))))
296 link_order
= bfd_new_link_order (link_info
.output_bfd
,
298 link_order
->type
= bfd_data_link_order
;
299 link_order
->size
= statement
->padding_statement
.size
;
300 link_order
->offset
= statement
->padding_statement
.output_offset
;
301 link_order
->u
.data
.contents
= statement
->padding_statement
.fill
->data
;
302 link_order
->u
.data
.size
= statement
->padding_statement
.fill
->size
;
307 /* All the other ones fall through */
312 /* Return true if NAME is the name of an unsplittable section. These
313 are the stabs strings, dwarf strings. */
316 unsplittable_name (const char *name
)
318 if (CONST_STRNEQ (name
, ".stab"))
320 /* There are several stab like string sections. We pattern match on
322 unsigned len
= strlen (name
);
323 if (strcmp (&name
[len
-3], "str") == 0)
326 else if (strcmp (name
, "$GDB_STRINGS$") == 0)
331 /* Wander around the input sections, make sure that
332 we'll never try and create an output section with more relocs
333 than will fit.. Do this by always assuming the worst case, and
334 creating new output sections with all the right bits. */
337 clone_section (bfd
*abfd
, asection
*s
, const char *name
, int *count
)
343 struct bfd_link_hash_entry
*h
;
345 /* Invent a section name from the section name and a dotted numeric
348 tname
= (char *) xmalloc (len
+ 1);
349 memcpy (tname
, name
, len
+ 1);
350 /* Remove a dotted number suffix, from a previous split link. */
351 while (len
&& ISDIGIT (tname
[len
-1]))
353 if (len
> 1 && tname
[len
-1] == '.')
354 /* It was a dotted number. */
357 /* We want to use the whole of the original section name for the
358 split name, but coff can be restricted to 8 character names. */
359 if (bfd_family_coff (abfd
) && strlen (tname
) > 5)
361 /* Some section names cannot be truncated, as the name is
362 used to locate some other section. */
363 if (CONST_STRNEQ (name
, ".stab")
364 || strcmp (name
, "$GDB_SYMBOLS$") == 0)
366 einfo (_ ("%F%P: cannot create split section name for %s\n"), name
);
367 /* Silence gcc warnings. einfo exits, so we never reach here. */
373 if ((sname
= bfd_get_unique_section_name (abfd
, tname
, count
)) == NULL
374 || (n
= bfd_make_section_anyway (abfd
, sname
)) == NULL
375 || (h
= bfd_link_hash_lookup (link_info
.hash
,
376 sname
, TRUE
, TRUE
, FALSE
)) == NULL
)
378 einfo (_("%F%P: clone section failed: %E\n"));
379 /* Silence gcc warnings. einfo exits, so we never reach here. */
384 /* Set up section symbol. */
385 h
->type
= bfd_link_hash_defined
;
387 h
->u
.def
.section
= n
;
391 n
->user_set_vma
= s
->user_set_vma
;
394 n
->output_offset
= s
->output_offset
;
395 n
->output_section
= n
;
398 n
->alignment_power
= s
->alignment_power
;
400 bfd_copy_private_section_data (abfd
, s
, abfd
, n
);
409 struct bfd_link_order
*l
= s
->map_head
.link_order
;
410 printf ("vma %x size %x\n", s
->vma
, s
->size
);
413 if (l
->type
== bfd_indirect_link_order
)
415 printf ("%8x %s\n", l
->offset
, l
->u
.indirect
.section
->owner
->filename
);
419 printf (_("%8x something else\n"), l
->offset
);
426 dump (char *s
, asection
*a1
, asection
*a2
)
434 sanity_check (bfd
*abfd
)
437 for (s
= abfd
->sections
; s
; s
= s
->next
)
439 struct bfd_link_order
*p
;
441 for (p
= s
->map_head
.link_order
; p
; p
= p
->next
)
443 if (p
->offset
> 100000)
445 if (p
->offset
< prev
)
452 #define sanity_check(a)
453 #define dump(a, b, c)
457 split_sections (bfd
*abfd
, struct bfd_link_info
*info
)
459 asection
*original_sec
;
460 int nsecs
= abfd
->section_count
;
462 /* Look through all the original sections. */
463 for (original_sec
= abfd
->sections
;
464 original_sec
&& nsecs
;
465 original_sec
= original_sec
->next
, nsecs
--)
468 unsigned int lines
= 0;
469 unsigned int relocs
= 0;
470 bfd_size_type sec_size
= 0;
471 struct bfd_link_order
*l
;
472 struct bfd_link_order
*p
;
473 bfd_vma vma
= original_sec
->vma
;
474 asection
*cursor
= original_sec
;
476 /* Count up the relocations and line entries to see if anything
477 would be too big to fit. Accumulate section size too. */
478 for (l
= NULL
, p
= cursor
->map_head
.link_order
; p
!= NULL
; p
= l
->next
)
480 unsigned int thislines
= 0;
481 unsigned int thisrelocs
= 0;
482 bfd_size_type thissize
= 0;
483 if (p
->type
== bfd_indirect_link_order
)
487 sec
= p
->u
.indirect
.section
;
489 if (info
->strip
== strip_none
490 || info
->strip
== strip_some
)
491 thislines
= sec
->lineno_count
;
493 if (info
->relocatable
)
494 thisrelocs
= sec
->reloc_count
;
496 thissize
= sec
->size
;
499 else if (info
->relocatable
500 && (p
->type
== bfd_section_reloc_link_order
501 || p
->type
== bfd_symbol_reloc_link_order
))
505 && (thisrelocs
+ relocs
>= config
.split_by_reloc
506 || thislines
+ lines
>= config
.split_by_reloc
507 || (thissize
+ sec_size
>= config
.split_by_file
))
508 && !unsplittable_name (cursor
->name
))
510 /* Create a new section and put this link order and the
511 following link orders into it. */
512 bfd_vma shift_offset
;
515 n
= clone_section (abfd
, cursor
, original_sec
->name
, &count
);
517 /* Attach the link orders to the new section and snip
518 them off from the old section. */
519 n
->map_head
.link_order
= p
;
520 n
->map_tail
.link_order
= cursor
->map_tail
.link_order
;
521 cursor
->map_tail
.link_order
= l
;
525 /* Change the size of the original section and
526 update the vma of the new one. */
528 dump ("before snip", cursor
, n
);
530 shift_offset
= p
->offset
;
531 n
->size
= cursor
->size
- shift_offset
;
532 cursor
->size
= shift_offset
;
535 n
->lma
= n
->vma
= vma
;
537 /* Run down the chain and change the output section to
538 the right one, update the offsets too. */
541 p
->offset
-= shift_offset
;
542 if (p
->type
== bfd_indirect_link_order
)
544 p
->u
.indirect
.section
->output_section
= n
;
545 p
->u
.indirect
.section
->output_offset
= p
->offset
;
551 dump ("after snip", cursor
, n
);
560 relocs
+= thisrelocs
;
562 sec_size
+= thissize
;
569 /* Call BFD to write out the linked file. */
574 /* Reset error indicator, which can typically something like invalid
575 format from opening up the .o files. */
576 bfd_set_error (bfd_error_no_error
);
577 lang_for_each_statement (build_link_order
);
579 if (config
.split_by_reloc
!= (unsigned) -1
580 || config
.split_by_file
!= (bfd_size_type
) -1)
581 split_sections (link_info
.output_bfd
, &link_info
);
582 if (!bfd_final_link (link_info
.output_bfd
, &link_info
))
584 /* If there was an error recorded, print it out. Otherwise assume
585 an appropriate error message like unknown symbol was printed
588 if (bfd_get_error () != bfd_error_no_error
)
589 einfo (_("%F%P: final link failed: %E\n"));