Convert to C90 and a few tweaks.
[binutils-gdb.git] / bfd / section.c
1 /* Object file "section" support for the BFD library.
2 Copyright 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000, 2001, 2002, 2003
4 Free Software Foundation, Inc.
5 Written by Cygnus Support.
6
7 This file is part of BFD, the Binary File Descriptor library.
8
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 2 of the License, or
12 (at your option) any later version.
13
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.
18
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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
22
23 /*
24 SECTION
25 Sections
26
27 The raw data contained within a BFD is maintained through the
28 section abstraction. A single BFD may have any number of
29 sections. It keeps hold of them by pointing to the first;
30 each one points to the next in the list.
31
32 Sections are supported in BFD in <<section.c>>.
33
34 @menu
35 @* Section Input::
36 @* Section Output::
37 @* typedef asection::
38 @* section prototypes::
39 @end menu
40
41 INODE
42 Section Input, Section Output, Sections, Sections
43 SUBSECTION
44 Section input
45
46 When a BFD is opened for reading, the section structures are
47 created and attached to the BFD.
48
49 Each section has a name which describes the section in the
50 outside world---for example, <<a.out>> would contain at least
51 three sections, called <<.text>>, <<.data>> and <<.bss>>.
52
53 Names need not be unique; for example a COFF file may have several
54 sections named <<.data>>.
55
56 Sometimes a BFD will contain more than the ``natural'' number of
57 sections. A back end may attach other sections containing
58 constructor data, or an application may add a section (using
59 <<bfd_make_section>>) to the sections attached to an already open
60 BFD. For example, the linker creates an extra section
61 <<COMMON>> for each input file's BFD to hold information about
62 common storage.
63
64 The raw data is not necessarily read in when
65 the section descriptor is created. Some targets may leave the
66 data in place until a <<bfd_get_section_contents>> call is
67 made. Other back ends may read in all the data at once. For
68 example, an S-record file has to be read once to determine the
69 size of the data. An IEEE-695 file doesn't contain raw data in
70 sections, but data and relocation expressions intermixed, so
71 the data area has to be parsed to get out the data and
72 relocations.
73
74 INODE
75 Section Output, typedef asection, Section Input, Sections
76
77 SUBSECTION
78 Section output
79
80 To write a new object style BFD, the various sections to be
81 written have to be created. They are attached to the BFD in
82 the same way as input sections; data is written to the
83 sections using <<bfd_set_section_contents>>.
84
85 Any program that creates or combines sections (e.g., the assembler
86 and linker) must use the <<asection>> fields <<output_section>> and
87 <<output_offset>> to indicate the file sections to which each
88 section must be written. (If the section is being created from
89 scratch, <<output_section>> should probably point to the section
90 itself and <<output_offset>> should probably be zero.)
91
92 The data to be written comes from input sections attached
93 (via <<output_section>> pointers) to
94 the output sections. The output section structure can be
95 considered a filter for the input section: the output section
96 determines the vma of the output data and the name, but the
97 input section determines the offset into the output section of
98 the data to be written.
99
100 E.g., to create a section "O", starting at 0x100, 0x123 long,
101 containing two subsections, "A" at offset 0x0 (i.e., at vma
102 0x100) and "B" at offset 0x20 (i.e., at vma 0x120) the <<asection>>
103 structures would look like:
104
105 | section name "A"
106 | output_offset 0x00
107 | size 0x20
108 | output_section -----------> section name "O"
109 | | vma 0x100
110 | section name "B" | size 0x123
111 | output_offset 0x20 |
112 | size 0x103 |
113 | output_section --------|
114
115 SUBSECTION
116 Link orders
117
118 The data within a section is stored in a @dfn{link_order}.
119 These are much like the fixups in <<gas>>. The link_order
120 abstraction allows a section to grow and shrink within itself.
121
122 A link_order knows how big it is, and which is the next
123 link_order and where the raw data for it is; it also points to
124 a list of relocations which apply to it.
125
126 The link_order is used by the linker to perform relaxing on
127 final code. The compiler creates code which is as big as
128 necessary to make it work without relaxing, and the user can
129 select whether to relax. Sometimes relaxing takes a lot of
130 time. The linker runs around the relocations to see if any
131 are attached to data which can be shrunk, if so it does it on
132 a link_order by link_order basis.
133
134 */
135
136 #include "bfd.h"
137 #include "sysdep.h"
138 #include "libbfd.h"
139 #include "bfdlink.h"
140
141 /*
142 DOCDD
143 INODE
144 typedef asection, section prototypes, Section Output, Sections
145 SUBSECTION
146 typedef asection
147
148 Here is the section structure:
149
150 CODE_FRAGMENT
151 .
152 .{* This structure is used for a comdat section, as in PE. A comdat
153 . section is associated with a particular symbol. When the linker
154 . sees a comdat section, it keeps only one of the sections with a
155 . given name and associated with a given symbol. *}
156 .
157 .struct bfd_comdat_info
158 .{
159 . {* The name of the symbol associated with a comdat section. *}
160 . const char *name;
161 .
162 . {* The local symbol table index of the symbol associated with a
163 . comdat section. This is only meaningful to the object file format
164 . specific code; it is not an index into the list returned by
165 . bfd_canonicalize_symtab. *}
166 . long symbol;
167 .};
168 .
169 .typedef struct sec
170 .{
171 . {* The name of the section; the name isn't a copy, the pointer is
172 . the same as that passed to bfd_make_section. *}
173 . const char *name;
174 .
175 . {* A unique sequence number. *}
176 . int id;
177 .
178 . {* Which section in the bfd; 0..n-1 as sections are created in a bfd. *}
179 . int index;
180 .
181 . {* The next section in the list belonging to the BFD, or NULL. *}
182 . struct sec *next;
183 .
184 . {* The field flags contains attributes of the section. Some
185 . flags are read in from the object file, and some are
186 . synthesized from other information. *}
187 . flagword flags;
188 .
189 .#define SEC_NO_FLAGS 0x000
190 .
191 . {* Tells the OS to allocate space for this section when loading.
192 . This is clear for a section containing debug information only. *}
193 .#define SEC_ALLOC 0x001
194 .
195 . {* Tells the OS to load the section from the file when loading.
196 . This is clear for a .bss section. *}
197 .#define SEC_LOAD 0x002
198 .
199 . {* The section contains data still to be relocated, so there is
200 . some relocation information too. *}
201 .#define SEC_RELOC 0x004
202 .
203 . {* ELF reserves 4 processor specific bits and 8 operating system
204 . specific bits in sh_flags; at present we can get away with just
205 . one in communicating between the assembler and BFD, but this
206 . isn't a good long-term solution. *}
207 .#define SEC_ARCH_BIT_0 0x008
208 .
209 . {* A signal to the OS that the section contains read only data. *}
210 .#define SEC_READONLY 0x010
211 .
212 . {* The section contains code only. *}
213 .#define SEC_CODE 0x020
214 .
215 . {* The section contains data only. *}
216 .#define SEC_DATA 0x040
217 .
218 . {* The section will reside in ROM. *}
219 .#define SEC_ROM 0x080
220 .
221 . {* The section contains constructor information. This section
222 . type is used by the linker to create lists of constructors and
223 . destructors used by <<g++>>. When a back end sees a symbol
224 . which should be used in a constructor list, it creates a new
225 . section for the type of name (e.g., <<__CTOR_LIST__>>), attaches
226 . the symbol to it, and builds a relocation. To build the lists
227 . of constructors, all the linker has to do is catenate all the
228 . sections called <<__CTOR_LIST__>> and relocate the data
229 . contained within - exactly the operations it would peform on
230 . standard data. *}
231 .#define SEC_CONSTRUCTOR 0x100
232 .
233 . {* The section has contents - a data section could be
234 . <<SEC_ALLOC>> | <<SEC_HAS_CONTENTS>>; a debug section could be
235 . <<SEC_HAS_CONTENTS>> *}
236 .#define SEC_HAS_CONTENTS 0x200
237 .
238 . {* An instruction to the linker to not output the section
239 . even if it has information which would normally be written. *}
240 .#define SEC_NEVER_LOAD 0x400
241 .
242 . {* The section is a COFF shared library section. This flag is
243 . only for the linker. If this type of section appears in
244 . the input file, the linker must copy it to the output file
245 . without changing the vma or size. FIXME: Although this
246 . was originally intended to be general, it really is COFF
247 . specific (and the flag was renamed to indicate this). It
248 . might be cleaner to have some more general mechanism to
249 . allow the back end to control what the linker does with
250 . sections. *}
251 .#define SEC_COFF_SHARED_LIBRARY 0x800
252 .
253 . {* The section contains thread local data. *}
254 .#define SEC_THREAD_LOCAL 0x1000
255 .
256 . {* The section has GOT references. This flag is only for the
257 . linker, and is currently only used by the elf32-hppa back end.
258 . It will be set if global offset table references were detected
259 . in this section, which indicate to the linker that the section
260 . contains PIC code, and must be handled specially when doing a
261 . static link. *}
262 .#define SEC_HAS_GOT_REF 0x4000
263 .
264 . {* The section contains common symbols (symbols may be defined
265 . multiple times, the value of a symbol is the amount of
266 . space it requires, and the largest symbol value is the one
267 . used). Most targets have exactly one of these (which we
268 . translate to bfd_com_section_ptr), but ECOFF has two. *}
269 .#define SEC_IS_COMMON 0x8000
270 .
271 . {* The section contains only debugging information. For
272 . example, this is set for ELF .debug and .stab sections.
273 . strip tests this flag to see if a section can be
274 . discarded. *}
275 .#define SEC_DEBUGGING 0x10000
276 .
277 . {* The contents of this section are held in memory pointed to
278 . by the contents field. This is checked by bfd_get_section_contents,
279 . and the data is retrieved from memory if appropriate. *}
280 .#define SEC_IN_MEMORY 0x20000
281 .
282 . {* The contents of this section are to be excluded by the
283 . linker for executable and shared objects unless those
284 . objects are to be further relocated. *}
285 .#define SEC_EXCLUDE 0x40000
286 .
287 . {* The contents of this section are to be sorted based on the sum of
288 . the symbol and addend values specified by the associated relocation
289 . entries. Entries without associated relocation entries will be
290 . appended to the end of the section in an unspecified order. *}
291 .#define SEC_SORT_ENTRIES 0x80000
292 .
293 . {* When linking, duplicate sections of the same name should be
294 . discarded, rather than being combined into a single section as
295 . is usually done. This is similar to how common symbols are
296 . handled. See SEC_LINK_DUPLICATES below. *}
297 .#define SEC_LINK_ONCE 0x100000
298 .
299 . {* If SEC_LINK_ONCE is set, this bitfield describes how the linker
300 . should handle duplicate sections. *}
301 .#define SEC_LINK_DUPLICATES 0x600000
302 .
303 . {* This value for SEC_LINK_DUPLICATES means that duplicate
304 . sections with the same name should simply be discarded. *}
305 .#define SEC_LINK_DUPLICATES_DISCARD 0x0
306 .
307 . {* This value for SEC_LINK_DUPLICATES means that the linker
308 . should warn if there are any duplicate sections, although
309 . it should still only link one copy. *}
310 .#define SEC_LINK_DUPLICATES_ONE_ONLY 0x200000
311 .
312 . {* This value for SEC_LINK_DUPLICATES means that the linker
313 . should warn if any duplicate sections are a different size. *}
314 .#define SEC_LINK_DUPLICATES_SAME_SIZE 0x400000
315 .
316 . {* This value for SEC_LINK_DUPLICATES means that the linker
317 . should warn if any duplicate sections contain different
318 . contents. *}
319 .#define SEC_LINK_DUPLICATES_SAME_CONTENTS 0x600000
320 .
321 . {* This section was created by the linker as part of dynamic
322 . relocation or other arcane processing. It is skipped when
323 . going through the first-pass output, trusting that someone
324 . else up the line will take care of it later. *}
325 .#define SEC_LINKER_CREATED 0x800000
326 .
327 . {* This section should not be subject to garbage collection. *}
328 .#define SEC_KEEP 0x1000000
329 .
330 . {* This section contains "short" data, and should be placed
331 . "near" the GP. *}
332 .#define SEC_SMALL_DATA 0x2000000
333 .
334 . {* This section contains data which may be shared with other
335 . executables or shared objects. *}
336 .#define SEC_SHARED 0x4000000
337 .
338 . {* When a section with this flag is being linked, then if the size of
339 . the input section is less than a page, it should not cross a page
340 . boundary. If the size of the input section is one page or more, it
341 . should be aligned on a page boundary. *}
342 .#define SEC_BLOCK 0x8000000
343 .
344 . {* Conditionally link this section; do not link if there are no
345 . references found to any symbol in the section. *}
346 .#define SEC_CLINK 0x10000000
347 .
348 . {* Attempt to merge identical entities in the section.
349 . Entity size is given in the entsize field. *}
350 .#define SEC_MERGE 0x20000000
351 .
352 . {* If given with SEC_MERGE, entities to merge are zero terminated
353 . strings where entsize specifies character size instead of fixed
354 . size entries. *}
355 .#define SEC_STRINGS 0x40000000
356 .
357 . {* This section contains data about section groups. *}
358 .#define SEC_GROUP 0x80000000
359 .
360 . {* End of section flags. *}
361 .
362 . {* Some internal packed boolean fields. *}
363 .
364 . {* See the vma field. *}
365 . unsigned int user_set_vma : 1;
366 .
367 . {* Whether relocations have been processed. *}
368 . unsigned int reloc_done : 1;
369 .
370 . {* A mark flag used by some of the linker backends. *}
371 . unsigned int linker_mark : 1;
372 .
373 . {* Another mark flag used by some of the linker backends. Set for
374 . output sections that have an input section. *}
375 . unsigned int linker_has_input : 1;
376 .
377 . {* A mark flag used by some linker backends for garbage collection. *}
378 . unsigned int gc_mark : 1;
379 .
380 . {* The following flags are used by the ELF linker. *}
381 .
382 . {* Mark sections which have been allocated to segments. *}
383 . unsigned int segment_mark : 1;
384 .
385 . {* Type of sec_info information. *}
386 . unsigned int sec_info_type:3;
387 .#define ELF_INFO_TYPE_NONE 0
388 .#define ELF_INFO_TYPE_STABS 1
389 .#define ELF_INFO_TYPE_MERGE 2
390 .#define ELF_INFO_TYPE_EH_FRAME 3
391 .#define ELF_INFO_TYPE_JUST_SYMS 4
392 .
393 . {* Nonzero if this section uses RELA relocations, rather than REL. *}
394 . unsigned int use_rela_p:1;
395 .
396 . {* Bits used by various backends. *}
397 . unsigned int has_tls_reloc:1;
398 .
399 . {* Nonzero if this section needs the relax finalize pass. *}
400 . unsigned int need_finalize_relax:1;
401 .
402 . {* Nonzero if this section has a gp reloc. *}
403 . unsigned int has_gp_reloc:1;
404 .
405 . {* Usused bits. *}
406 . unsigned int flag13:1;
407 . unsigned int flag14:1;
408 . unsigned int flag15:1;
409 . unsigned int flag16:4;
410 . unsigned int flag20:4;
411 . unsigned int flag24:8;
412 .
413 . {* End of internal packed boolean fields. *}
414 .
415 . {* The virtual memory address of the section - where it will be
416 . at run time. The symbols are relocated against this. The
417 . user_set_vma flag is maintained by bfd; if it's not set, the
418 . backend can assign addresses (for example, in <<a.out>>, where
419 . the default address for <<.data>> is dependent on the specific
420 . target and various flags). *}
421 . bfd_vma vma;
422 .
423 . {* The load address of the section - where it would be in a
424 . rom image; really only used for writing section header
425 . information. *}
426 . bfd_vma lma;
427 .
428 . {* The size of the section in octets, as it will be output.
429 . Contains a value even if the section has no contents (e.g., the
430 . size of <<.bss>>). This will be filled in after relocation. *}
431 . bfd_size_type _cooked_size;
432 .
433 . {* The original size on disk of the section, in octets. Normally this
434 . value is the same as the size, but if some relaxing has
435 . been done, then this value will be bigger. *}
436 . bfd_size_type _raw_size;
437 .
438 . {* If this section is going to be output, then this value is the
439 . offset in *bytes* into the output section of the first byte in the
440 . input section (byte ==> smallest addressable unit on the
441 . target). In most cases, if this was going to start at the
442 . 100th octet (8-bit quantity) in the output section, this value
443 . would be 100. However, if the target byte size is 16 bits
444 . (bfd_octets_per_byte is "2"), this value would be 50. *}
445 . bfd_vma output_offset;
446 .
447 . {* The output section through which to map on output. *}
448 . struct sec *output_section;
449 .
450 . {* The alignment requirement of the section, as an exponent of 2 -
451 . e.g., 3 aligns to 2^3 (or 8). *}
452 . unsigned int alignment_power;
453 .
454 . {* If an input section, a pointer to a vector of relocation
455 . records for the data in this section. *}
456 . struct reloc_cache_entry *relocation;
457 .
458 . {* If an output section, a pointer to a vector of pointers to
459 . relocation records for the data in this section. *}
460 . struct reloc_cache_entry **orelocation;
461 .
462 . {* The number of relocation records in one of the above. *}
463 . unsigned reloc_count;
464 .
465 . {* Information below is back end specific - and not always used
466 . or updated. *}
467 .
468 . {* File position of section data. *}
469 . file_ptr filepos;
470 .
471 . {* File position of relocation info. *}
472 . file_ptr rel_filepos;
473 .
474 . {* File position of line data. *}
475 . file_ptr line_filepos;
476 .
477 . {* Pointer to data for applications. *}
478 . void *userdata;
479 .
480 . {* If the SEC_IN_MEMORY flag is set, this points to the actual
481 . contents. *}
482 . unsigned char *contents;
483 .
484 . {* Attached line number information. *}
485 . alent *lineno;
486 .
487 . {* Number of line number records. *}
488 . unsigned int lineno_count;
489 .
490 . {* Entity size for merging purposes. *}
491 . unsigned int entsize;
492 .
493 . {* Optional information about a COMDAT entry; NULL if not COMDAT. *}
494 . struct bfd_comdat_info *comdat;
495 .
496 . {* Points to the kept section if this section is a link-once section,
497 . and is discarded. *}
498 . struct sec *kept_section;
499 .
500 . {* When a section is being output, this value changes as more
501 . linenumbers are written out. *}
502 . file_ptr moving_line_filepos;
503 .
504 . {* What the section number is in the target world. *}
505 . int target_index;
506 .
507 . void *used_by_bfd;
508 .
509 . {* If this is a constructor section then here is a list of the
510 . relocations created to relocate items within it. *}
511 . struct relent_chain *constructor_chain;
512 .
513 . {* The BFD which owns the section. *}
514 . bfd *owner;
515 .
516 . {* A symbol which points at this section only. *}
517 . struct symbol_cache_entry *symbol;
518 . struct symbol_cache_entry **symbol_ptr_ptr;
519 .
520 . struct bfd_link_order *link_order_head;
521 . struct bfd_link_order *link_order_tail;
522 .} asection;
523 .
524 .{* These sections are global, and are managed by BFD. The application
525 . and target back end are not permitted to change the values in
526 . these sections. New code should use the section_ptr macros rather
527 . than referring directly to the const sections. The const sections
528 . may eventually vanish. *}
529 .#define BFD_ABS_SECTION_NAME "*ABS*"
530 .#define BFD_UND_SECTION_NAME "*UND*"
531 .#define BFD_COM_SECTION_NAME "*COM*"
532 .#define BFD_IND_SECTION_NAME "*IND*"
533 .
534 .{* The absolute section. *}
535 .extern const asection bfd_abs_section;
536 .#define bfd_abs_section_ptr ((asection *) &bfd_abs_section)
537 .#define bfd_is_abs_section(sec) ((sec) == bfd_abs_section_ptr)
538 .{* Pointer to the undefined section. *}
539 .extern const asection bfd_und_section;
540 .#define bfd_und_section_ptr ((asection *) &bfd_und_section)
541 .#define bfd_is_und_section(sec) ((sec) == bfd_und_section_ptr)
542 .{* Pointer to the common section. *}
543 .extern const asection bfd_com_section;
544 .#define bfd_com_section_ptr ((asection *) &bfd_com_section)
545 .{* Pointer to the indirect section. *}
546 .extern const asection bfd_ind_section;
547 .#define bfd_ind_section_ptr ((asection *) &bfd_ind_section)
548 .#define bfd_is_ind_section(sec) ((sec) == bfd_ind_section_ptr)
549 .
550 .#define bfd_is_const_section(SEC) \
551 . ( ((SEC) == bfd_abs_section_ptr) \
552 . || ((SEC) == bfd_und_section_ptr) \
553 . || ((SEC) == bfd_com_section_ptr) \
554 . || ((SEC) == bfd_ind_section_ptr))
555 .
556 .extern const struct symbol_cache_entry * const bfd_abs_symbol;
557 .extern const struct symbol_cache_entry * const bfd_com_symbol;
558 .extern const struct symbol_cache_entry * const bfd_und_symbol;
559 .extern const struct symbol_cache_entry * const bfd_ind_symbol;
560 .#define bfd_get_section_size_before_reloc(section) \
561 . ((section)->reloc_done ? (abort (), (bfd_size_type) 1) \
562 . : (section)->_raw_size)
563 .#define bfd_get_section_size_after_reloc(section) \
564 . ((section)->reloc_done ? (section)->_cooked_size \
565 . : (abort (), (bfd_size_type) 1))
566 .
567 .{* Macros to handle insertion and deletion of a bfd's sections. These
568 . only handle the list pointers, ie. do not adjust section_count,
569 . target_index etc. *}
570 .#define bfd_section_list_remove(ABFD, PS) \
571 . do \
572 . { \
573 . asection **_ps = PS; \
574 . asection *_s = *_ps; \
575 . *_ps = _s->next; \
576 . if (_s->next == NULL) \
577 . (ABFD)->section_tail = _ps; \
578 . } \
579 . while (0)
580 .#define bfd_section_list_insert(ABFD, PS, S) \
581 . do \
582 . { \
583 . asection **_ps = PS; \
584 . asection *_s = S; \
585 . _s->next = *_ps; \
586 . *_ps = _s; \
587 . if (_s->next == NULL) \
588 . (ABFD)->section_tail = &_s->next; \
589 . } \
590 . while (0)
591 .
592 */
593
594 /* We use a macro to initialize the static asymbol structures because
595 traditional C does not permit us to initialize a union member while
596 gcc warns if we don't initialize it. */
597 /* the_bfd, name, value, attr, section [, udata] */
598 #ifdef __STDC__
599 #define GLOBAL_SYM_INIT(NAME, SECTION) \
600 { 0, NAME, 0, BSF_SECTION_SYM, (asection *) SECTION, { 0 }}
601 #else
602 #define GLOBAL_SYM_INIT(NAME, SECTION) \
603 { 0, NAME, 0, BSF_SECTION_SYM, (asection *) SECTION }
604 #endif
605
606 /* These symbols are global, not specific to any BFD. Therefore, anything
607 that tries to change them is broken, and should be repaired. */
608
609 static const asymbol global_syms[] =
610 {
611 GLOBAL_SYM_INIT (BFD_COM_SECTION_NAME, &bfd_com_section),
612 GLOBAL_SYM_INIT (BFD_UND_SECTION_NAME, &bfd_und_section),
613 GLOBAL_SYM_INIT (BFD_ABS_SECTION_NAME, &bfd_abs_section),
614 GLOBAL_SYM_INIT (BFD_IND_SECTION_NAME, &bfd_ind_section)
615 };
616
617 #define STD_SECTION(SEC, FLAGS, SYM, NAME, IDX) \
618 const asymbol * const SYM = (asymbol *) &global_syms[IDX]; \
619 const asection SEC = \
620 /* name, id, index, next, flags, user_set_vma, reloc_done, */ \
621 { NAME, IDX, 0, NULL, FLAGS, 0, 0, \
622 \
623 /* linker_mark, linker_has_input, gc_mark, segment_mark, */ \
624 0, 0, 1, 0, \
625 \
626 /* sec_info_type, use_rela_p, has_tls_reloc, */ \
627 0, 0, 0, \
628 \
629 /* need_finalize_relax, has_gp_reloc, */ \
630 0, 0, \
631 \
632 /* flag13, flag14, flag15, flag16, flag20, flag24, */ \
633 0, 0, 0, 0, 0, 0, \
634 \
635 /* vma, lma, _cooked_size, _raw_size, */ \
636 0, 0, 0, 0, \
637 \
638 /* output_offset, output_section, alignment_power, */ \
639 0, (struct sec *) &SEC, 0, \
640 \
641 /* relocation, orelocation, reloc_count, filepos, rel_filepos, */ \
642 NULL, NULL, 0, 0, 0, \
643 \
644 /* line_filepos, userdata, contents, lineno, lineno_count, */ \
645 0, NULL, NULL, NULL, 0, \
646 \
647 /* entsize, comdat, kept_section, moving_line_filepos, */ \
648 0, NULL, NULL, 0, \
649 \
650 /* target_index, used_by_bfd, constructor_chain, owner, */ \
651 0, NULL, NULL, NULL, \
652 \
653 /* symbol, */ \
654 (struct symbol_cache_entry *) &global_syms[IDX], \
655 \
656 /* symbol_ptr_ptr, */ \
657 (struct symbol_cache_entry **) &SYM, \
658 \
659 /* link_order_head, link_order_tail */ \
660 NULL, NULL \
661 }
662
663 STD_SECTION (bfd_com_section, SEC_IS_COMMON, bfd_com_symbol,
664 BFD_COM_SECTION_NAME, 0);
665 STD_SECTION (bfd_und_section, 0, bfd_und_symbol, BFD_UND_SECTION_NAME, 1);
666 STD_SECTION (bfd_abs_section, 0, bfd_abs_symbol, BFD_ABS_SECTION_NAME, 2);
667 STD_SECTION (bfd_ind_section, 0, bfd_ind_symbol, BFD_IND_SECTION_NAME, 3);
668 #undef STD_SECTION
669
670 struct section_hash_entry
671 {
672 struct bfd_hash_entry root;
673 asection section;
674 };
675
676 /* Initialize an entry in the section hash table. */
677
678 struct bfd_hash_entry *
679 bfd_section_hash_newfunc (struct bfd_hash_entry *entry,
680 struct bfd_hash_table *table,
681 const char *string)
682 {
683 /* Allocate the structure if it has not already been allocated by a
684 subclass. */
685 if (entry == NULL)
686 {
687 entry = (struct bfd_hash_entry *)
688 bfd_hash_allocate (table, sizeof (struct section_hash_entry));
689 if (entry == NULL)
690 return entry;
691 }
692
693 /* Call the allocation method of the superclass. */
694 entry = bfd_hash_newfunc (entry, table, string);
695 if (entry != NULL)
696 memset (&((struct section_hash_entry *) entry)->section, 0,
697 sizeof (asection));
698
699 return entry;
700 }
701
702 #define section_hash_lookup(table, string, create, copy) \
703 ((struct section_hash_entry *) \
704 bfd_hash_lookup ((table), (string), (create), (copy)))
705
706 /* Initializes a new section. NEWSECT->NAME is already set. */
707
708 static asection *bfd_section_init PARAMS ((bfd *, asection *));
709
710 static asection *
711 bfd_section_init (bfd *abfd, asection *newsect)
712 {
713 static int section_id = 0x10; /* id 0 to 3 used by STD_SECTION. */
714
715 newsect->id = section_id;
716 newsect->index = abfd->section_count;
717 newsect->owner = abfd;
718
719 /* Create a symbol whose only job is to point to this section. This
720 is useful for things like relocs which are relative to the base
721 of a section. */
722 newsect->symbol = bfd_make_empty_symbol (abfd);
723 if (newsect->symbol == NULL)
724 return NULL;
725
726 newsect->symbol->name = newsect->name;
727 newsect->symbol->value = 0;
728 newsect->symbol->section = newsect;
729 newsect->symbol->flags = BSF_SECTION_SYM;
730
731 newsect->symbol_ptr_ptr = &newsect->symbol;
732
733 if (! BFD_SEND (abfd, _new_section_hook, (abfd, newsect)))
734 return NULL;
735
736 section_id++;
737 abfd->section_count++;
738 *abfd->section_tail = newsect;
739 abfd->section_tail = &newsect->next;
740 return newsect;
741 }
742
743 /*
744 DOCDD
745 INODE
746 section prototypes, , typedef asection, Sections
747 SUBSECTION
748 Section prototypes
749
750 These are the functions exported by the section handling part of BFD.
751 */
752
753 /*
754 FUNCTION
755 bfd_section_list_clear
756
757 SYNOPSIS
758 void bfd_section_list_clear (bfd *);
759
760 DESCRIPTION
761 Clears the section list, and also resets the section count and
762 hash table entries.
763 */
764
765 void
766 bfd_section_list_clear (bfd *abfd)
767 {
768 abfd->sections = NULL;
769 abfd->section_tail = &abfd->sections;
770 abfd->section_count = 0;
771 memset (abfd->section_htab.table, 0,
772 abfd->section_htab.size * sizeof (struct bfd_hash_entry *));
773 }
774
775 /*
776 FUNCTION
777 bfd_get_section_by_name
778
779 SYNOPSIS
780 asection *bfd_get_section_by_name (bfd *abfd, const char *name);
781
782 DESCRIPTION
783 Run through @var{abfd} and return the one of the
784 <<asection>>s whose name matches @var{name}, otherwise <<NULL>>.
785 @xref{Sections}, for more information.
786
787 This should only be used in special cases; the normal way to process
788 all sections of a given name is to use <<bfd_map_over_sections>> and
789 <<strcmp>> on the name (or better yet, base it on the section flags
790 or something else) for each section.
791 */
792
793 asection *
794 bfd_get_section_by_name (bfd *abfd, const char *name)
795 {
796 struct section_hash_entry *sh;
797
798 sh = section_hash_lookup (&abfd->section_htab, name, FALSE, FALSE);
799 if (sh != NULL)
800 return &sh->section;
801
802 return NULL;
803 }
804
805 /*
806 FUNCTION
807 bfd_get_unique_section_name
808
809 SYNOPSIS
810 char *bfd_get_unique_section_name
811 (bfd *abfd, const char *templat, int *count);
812
813 DESCRIPTION
814 Invent a section name that is unique in @var{abfd} by tacking
815 a dot and a digit suffix onto the original @var{templat}. If
816 @var{count} is non-NULL, then it specifies the first number
817 tried as a suffix to generate a unique name. The value
818 pointed to by @var{count} will be incremented in this case.
819 */
820
821 char *
822 bfd_get_unique_section_name (bfd *abfd, const char *templat, int *count)
823 {
824 int num;
825 unsigned int len;
826 char *sname;
827
828 len = strlen (templat);
829 sname = bfd_malloc (len + 8);
830 if (sname == NULL)
831 return NULL;
832 memcpy (sname, templat, len);
833 num = 1;
834 if (count != NULL)
835 num = *count;
836
837 do
838 {
839 /* If we have a million sections, something is badly wrong. */
840 if (num > 999999)
841 abort ();
842 sprintf (sname + len, ".%d", num++);
843 }
844 while (section_hash_lookup (&abfd->section_htab, sname, FALSE, FALSE));
845
846 if (count != NULL)
847 *count = num;
848 return sname;
849 }
850
851 /*
852 FUNCTION
853 bfd_make_section_old_way
854
855 SYNOPSIS
856 asection *bfd_make_section_old_way (bfd *abfd, const char *name);
857
858 DESCRIPTION
859 Create a new empty section called @var{name}
860 and attach it to the end of the chain of sections for the
861 BFD @var{abfd}. An attempt to create a section with a name which
862 is already in use returns its pointer without changing the
863 section chain.
864
865 It has the funny name since this is the way it used to be
866 before it was rewritten....
867
868 Possible errors are:
869 o <<bfd_error_invalid_operation>> -
870 If output has already started for this BFD.
871 o <<bfd_error_no_memory>> -
872 If memory allocation fails.
873
874 */
875
876 asection *
877 bfd_make_section_old_way (bfd *abfd, const char *name)
878 {
879 struct section_hash_entry *sh;
880 asection *newsect;
881
882 if (abfd->output_has_begun)
883 {
884 bfd_set_error (bfd_error_invalid_operation);
885 return NULL;
886 }
887
888 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0)
889 return bfd_abs_section_ptr;
890
891 if (strcmp (name, BFD_COM_SECTION_NAME) == 0)
892 return bfd_com_section_ptr;
893
894 if (strcmp (name, BFD_UND_SECTION_NAME) == 0)
895 return bfd_und_section_ptr;
896
897 if (strcmp (name, BFD_IND_SECTION_NAME) == 0)
898 return bfd_ind_section_ptr;
899
900 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
901 if (sh == NULL)
902 return NULL;
903
904 newsect = &sh->section;
905 if (newsect->name != NULL)
906 {
907 /* Section already exists. */
908 return newsect;
909 }
910
911 newsect->name = name;
912 return bfd_section_init (abfd, newsect);
913 }
914
915 /*
916 FUNCTION
917 bfd_make_section_anyway
918
919 SYNOPSIS
920 asection *bfd_make_section_anyway (bfd *abfd, const char *name);
921
922 DESCRIPTION
923 Create a new empty section called @var{name} and attach it to the end of
924 the chain of sections for @var{abfd}. Create a new section even if there
925 is already a section with that name.
926
927 Return <<NULL>> and set <<bfd_error>> on error; possible errors are:
928 o <<bfd_error_invalid_operation>> - If output has already started for @var{abfd}.
929 o <<bfd_error_no_memory>> - If memory allocation fails.
930 */
931
932 sec_ptr
933 bfd_make_section_anyway (bfd *abfd, const char *name)
934 {
935 struct section_hash_entry *sh;
936 asection *newsect;
937
938 if (abfd->output_has_begun)
939 {
940 bfd_set_error (bfd_error_invalid_operation);
941 return NULL;
942 }
943
944 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
945 if (sh == NULL)
946 return NULL;
947
948 newsect = &sh->section;
949 if (newsect->name != NULL)
950 {
951 /* We are making a section of the same name. It can't go in
952 section_htab without generating a unique section name and
953 that would be pointless; We don't need to traverse the
954 hash table. */
955 newsect = bfd_zalloc (abfd, sizeof (asection));
956 if (newsect == NULL)
957 return NULL;
958 }
959
960 newsect->name = name;
961 return bfd_section_init (abfd, newsect);
962 }
963
964 /*
965 FUNCTION
966 bfd_make_section
967
968 SYNOPSIS
969 asection *bfd_make_section (bfd *, const char *name);
970
971 DESCRIPTION
972 Like <<bfd_make_section_anyway>>, but return <<NULL>> (without calling
973 bfd_set_error ()) without changing the section chain if there is already a
974 section named @var{name}. If there is an error, return <<NULL>> and set
975 <<bfd_error>>.
976 */
977
978 asection *
979 bfd_make_section (bfd *abfd, const char *name)
980 {
981 struct section_hash_entry *sh;
982 asection *newsect;
983
984 if (abfd->output_has_begun)
985 {
986 bfd_set_error (bfd_error_invalid_operation);
987 return NULL;
988 }
989
990 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0
991 || strcmp (name, BFD_COM_SECTION_NAME) == 0
992 || strcmp (name, BFD_UND_SECTION_NAME) == 0
993 || strcmp (name, BFD_IND_SECTION_NAME) == 0)
994 return NULL;
995
996 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
997 if (sh == NULL)
998 return NULL;
999
1000 newsect = &sh->section;
1001 if (newsect->name != NULL)
1002 {
1003 /* Section already exists. */
1004 return newsect;
1005 }
1006
1007 newsect->name = name;
1008 return bfd_section_init (abfd, newsect);
1009 }
1010
1011 /*
1012 FUNCTION
1013 bfd_set_section_flags
1014
1015 SYNOPSIS
1016 bfd_boolean bfd_set_section_flags
1017 (bfd *abfd, asection *sec, flagword flags);
1018
1019 DESCRIPTION
1020 Set the attributes of the section @var{sec} in the BFD
1021 @var{abfd} to the value @var{flags}. Return <<TRUE>> on success,
1022 <<FALSE>> on error. Possible error returns are:
1023
1024 o <<bfd_error_invalid_operation>> -
1025 The section cannot have one or more of the attributes
1026 requested. For example, a .bss section in <<a.out>> may not
1027 have the <<SEC_HAS_CONTENTS>> field set.
1028
1029 */
1030
1031 /*ARGSUSED*/
1032 bfd_boolean
1033 bfd_set_section_flags (bfd *abfd ATTRIBUTE_UNUSED,
1034 sec_ptr section,
1035 flagword flags)
1036 {
1037 #if 0
1038 /* If you try to copy a text section from an input file (where it
1039 has the SEC_CODE flag set) to an output file, this loses big if
1040 the bfd_applicable_section_flags (abfd) doesn't have the SEC_CODE
1041 set - which it doesn't, at least not for a.out. FIXME */
1042
1043 if ((flags & bfd_applicable_section_flags (abfd)) != flags)
1044 {
1045 bfd_set_error (bfd_error_invalid_operation);
1046 return FALSE;
1047 }
1048 #endif
1049
1050 section->flags = flags;
1051 return TRUE;
1052 }
1053
1054 /*
1055 FUNCTION
1056 bfd_map_over_sections
1057
1058 SYNOPSIS
1059 void bfd_map_over_sections
1060 (bfd *abfd,
1061 void (*func) (bfd *abfd, asection *sect, void *obj),
1062 void *obj);
1063
1064 DESCRIPTION
1065 Call the provided function @var{func} for each section
1066 attached to the BFD @var{abfd}, passing @var{obj} as an
1067 argument. The function will be called as if by
1068
1069 | func (abfd, the_section, obj);
1070
1071 This is the prefered method for iterating over sections; an
1072 alternative would be to use a loop:
1073
1074 | section *p;
1075 | for (p = abfd->sections; p != NULL; p = p->next)
1076 | func (abfd, p, ...)
1077
1078 */
1079
1080 /*VARARGS2*/
1081 void
1082 bfd_map_over_sections (bfd *abfd,
1083 void (*operation) (bfd *, asection *, void *),
1084 void *user_storage)
1085 {
1086 asection *sect;
1087 unsigned int i = 0;
1088
1089 for (sect = abfd->sections; sect != NULL; i++, sect = sect->next)
1090 (*operation) (abfd, sect, user_storage);
1091
1092 if (i != abfd->section_count) /* Debugging */
1093 abort ();
1094 }
1095
1096 /*
1097 FUNCTION
1098 bfd_set_section_size
1099
1100 SYNOPSIS
1101 bfd_boolean bfd_set_section_size
1102 (bfd *abfd, asection *sec, bfd_size_type val);
1103
1104 DESCRIPTION
1105 Set @var{sec} to the size @var{val}. If the operation is
1106 ok, then <<TRUE>> is returned, else <<FALSE>>.
1107
1108 Possible error returns:
1109 o <<bfd_error_invalid_operation>> -
1110 Writing has started to the BFD, so setting the size is invalid.
1111
1112 */
1113
1114 bfd_boolean
1115 bfd_set_section_size (bfd *abfd, sec_ptr ptr, bfd_size_type val)
1116 {
1117 /* Once you've started writing to any section you cannot create or change
1118 the size of any others. */
1119
1120 if (abfd->output_has_begun)
1121 {
1122 bfd_set_error (bfd_error_invalid_operation);
1123 return FALSE;
1124 }
1125
1126 ptr->_cooked_size = val;
1127 ptr->_raw_size = val;
1128
1129 return TRUE;
1130 }
1131
1132 /*
1133 FUNCTION
1134 bfd_set_section_contents
1135
1136 SYNOPSIS
1137 bfd_boolean bfd_set_section_contents
1138 (bfd *abfd, asection *section, void *data, file_ptr offset,
1139 bfd_size_type count);
1140
1141 DESCRIPTION
1142 Sets the contents of the section @var{section} in BFD
1143 @var{abfd} to the data starting in memory at @var{data}. The
1144 data is written to the output section starting at offset
1145 @var{offset} for @var{count} octets.
1146
1147 Normally <<TRUE>> is returned, else <<FALSE>>. Possible error
1148 returns are:
1149 o <<bfd_error_no_contents>> -
1150 The output section does not have the <<SEC_HAS_CONTENTS>>
1151 attribute, so nothing can be written to it.
1152 o and some more too
1153
1154 This routine is front end to the back end function
1155 <<_bfd_set_section_contents>>.
1156
1157 */
1158
1159 #define bfd_get_section_size_now(abfd, sec) \
1160 (sec->reloc_done \
1161 ? bfd_get_section_size_after_reloc (sec) \
1162 : bfd_get_section_size_before_reloc (sec))
1163
1164 bfd_boolean
1165 bfd_set_section_contents (bfd *abfd,
1166 sec_ptr section,
1167 void *location,
1168 file_ptr offset,
1169 bfd_size_type count)
1170 {
1171 bfd_size_type sz;
1172
1173 if (!(bfd_get_section_flags (abfd, section) & SEC_HAS_CONTENTS))
1174 {
1175 bfd_set_error (bfd_error_no_contents);
1176 return FALSE;
1177 }
1178
1179 sz = bfd_get_section_size_now (abfd, section);
1180 if ((bfd_size_type) offset > sz
1181 || count > sz
1182 || offset + count > sz
1183 || count != (size_t) count)
1184 {
1185 bfd_set_error (bfd_error_bad_value);
1186 return FALSE;
1187 }
1188
1189 switch (abfd->direction)
1190 {
1191 case read_direction:
1192 case no_direction:
1193 bfd_set_error (bfd_error_invalid_operation);
1194 return FALSE;
1195
1196 case write_direction:
1197 break;
1198
1199 case both_direction:
1200 /* File is opened for update. `output_has_begun' some time ago when
1201 the file was created. Do not recompute sections sizes or alignments
1202 in _bfd_set_section_content. */
1203 abfd->output_has_begun = TRUE;
1204 break;
1205 }
1206
1207 /* Record a copy of the data in memory if desired. */
1208 if (section->contents
1209 && location != section->contents + offset)
1210 memcpy (section->contents + offset, location, (size_t) count);
1211
1212 if (BFD_SEND (abfd, _bfd_set_section_contents,
1213 (abfd, section, location, offset, count)))
1214 {
1215 abfd->output_has_begun = TRUE;
1216 return TRUE;
1217 }
1218
1219 return FALSE;
1220 }
1221
1222 /*
1223 FUNCTION
1224 bfd_get_section_contents
1225
1226 SYNOPSIS
1227 bfd_boolean bfd_get_section_contents
1228 (bfd *abfd, asection *section, void *location, file_ptr offset,
1229 bfd_size_type count);
1230
1231 DESCRIPTION
1232 Read data from @var{section} in BFD @var{abfd}
1233 into memory starting at @var{location}. The data is read at an
1234 offset of @var{offset} from the start of the input section,
1235 and is read for @var{count} bytes.
1236
1237 If the contents of a constructor with the <<SEC_CONSTRUCTOR>>
1238 flag set are requested or if the section does not have the
1239 <<SEC_HAS_CONTENTS>> flag set, then the @var{location} is filled
1240 with zeroes. If no errors occur, <<TRUE>> is returned, else
1241 <<FALSE>>.
1242
1243 */
1244 bfd_boolean
1245 bfd_get_section_contents (bfd *abfd,
1246 sec_ptr section,
1247 void *location,
1248 file_ptr offset,
1249 bfd_size_type count)
1250 {
1251 bfd_size_type sz;
1252
1253 if (section->flags & SEC_CONSTRUCTOR)
1254 {
1255 memset (location, 0, (size_t) count);
1256 return TRUE;
1257 }
1258
1259 /* Even if reloc_done is TRUE, this function reads unrelocated
1260 contents, so we want the raw size. */
1261 sz = section->_raw_size;
1262 if ((bfd_size_type) offset > sz
1263 || count > sz
1264 || offset + count > sz
1265 || count != (size_t) count)
1266 {
1267 bfd_set_error (bfd_error_bad_value);
1268 return FALSE;
1269 }
1270
1271 if (count == 0)
1272 /* Don't bother. */
1273 return TRUE;
1274
1275 if ((section->flags & SEC_HAS_CONTENTS) == 0)
1276 {
1277 memset (location, 0, (size_t) count);
1278 return TRUE;
1279 }
1280
1281 if ((section->flags & SEC_IN_MEMORY) != 0)
1282 {
1283 memcpy (location, section->contents + offset, (size_t) count);
1284 return TRUE;
1285 }
1286
1287 return BFD_SEND (abfd, _bfd_get_section_contents,
1288 (abfd, section, location, offset, count));
1289 }
1290
1291 /*
1292 FUNCTION
1293 bfd_copy_private_section_data
1294
1295 SYNOPSIS
1296 bfd_boolean bfd_copy_private_section_data
1297 (bfd *ibfd, asection *isec, bfd *obfd, asection *osec);
1298
1299 DESCRIPTION
1300 Copy private section information from @var{isec} in the BFD
1301 @var{ibfd} to the section @var{osec} in the BFD @var{obfd}.
1302 Return <<TRUE>> on success, <<FALSE>> on error. Possible error
1303 returns are:
1304
1305 o <<bfd_error_no_memory>> -
1306 Not enough memory exists to create private data for @var{osec}.
1307
1308 .#define bfd_copy_private_section_data(ibfd, isection, obfd, osection) \
1309 . BFD_SEND (obfd, _bfd_copy_private_section_data, \
1310 . (ibfd, isection, obfd, osection))
1311 */
1312
1313 /*
1314 FUNCTION
1315 _bfd_strip_section_from_output
1316
1317 SYNOPSIS
1318 void _bfd_strip_section_from_output
1319 (struct bfd_link_info *info, asection *section);
1320
1321 DESCRIPTION
1322 Remove @var{section} from the output. If the output section
1323 becomes empty, remove it from the output bfd.
1324
1325 This function won't actually do anything except twiddle flags
1326 if called too late in the linking process, when it's not safe
1327 to remove sections.
1328 */
1329 void
1330 _bfd_strip_section_from_output (struct bfd_link_info *info, asection *s)
1331 {
1332 asection *os;
1333 asection *is;
1334 bfd *abfd;
1335
1336 s->flags |= SEC_EXCLUDE;
1337
1338 /* If the section wasn't assigned to an output section, or the
1339 section has been discarded by the linker script, there's nothing
1340 more to do. */
1341 os = s->output_section;
1342 if (os == NULL || os->owner == NULL)
1343 return;
1344
1345 /* If the output section has other (non-excluded) input sections, we
1346 can't remove it. */
1347 for (abfd = info->input_bfds; abfd != NULL; abfd = abfd->link_next)
1348 for (is = abfd->sections; is != NULL; is = is->next)
1349 if (is->output_section == os && (is->flags & SEC_EXCLUDE) == 0)
1350 return;
1351
1352 /* If the output section is empty, flag it for removal too.
1353 See ldlang.c:strip_excluded_output_sections for the action. */
1354 os->flags |= SEC_EXCLUDE;
1355 }
1356
1357 /*
1358 FUNCTION
1359 bfd_generic_discard_group
1360
1361 SYNOPSIS
1362 bfd_boolean bfd_generic_discard_group (bfd *abfd, asection *group);
1363
1364 DESCRIPTION
1365 Remove all members of @var{group} from the output.
1366 */
1367
1368 bfd_boolean
1369 bfd_generic_discard_group (bfd *abfd ATTRIBUTE_UNUSED,
1370 asection *group ATTRIBUTE_UNUSED)
1371 {
1372 return TRUE;
1373 }