6facfe2066dde5ef732cb99935b84e8072a14025
[deliverable/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 . PTR 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 . {* When a section is being output, this value changes as more
497 . linenumbers are written out. *}
498 . file_ptr moving_line_filepos;
499 .
500 . {* What the section number is in the target world. *}
501 . int target_index;
502 .
503 . PTR used_by_bfd;
504 .
505 . {* If this is a constructor section then here is a list of the
506 . relocations created to relocate items within it. *}
507 . struct relent_chain *constructor_chain;
508 .
509 . {* The BFD which owns the section. *}
510 . bfd *owner;
511 .
512 . {* A symbol which points at this section only. *}
513 . struct symbol_cache_entry *symbol;
514 . struct symbol_cache_entry **symbol_ptr_ptr;
515 .
516 . struct bfd_link_order *link_order_head;
517 . struct bfd_link_order *link_order_tail;
518 .} asection;
519 .
520 .{* These sections are global, and are managed by BFD. The application
521 . and target back end are not permitted to change the values in
522 . these sections. New code should use the section_ptr macros rather
523 . than referring directly to the const sections. The const sections
524 . may eventually vanish. *}
525 .#define BFD_ABS_SECTION_NAME "*ABS*"
526 .#define BFD_UND_SECTION_NAME "*UND*"
527 .#define BFD_COM_SECTION_NAME "*COM*"
528 .#define BFD_IND_SECTION_NAME "*IND*"
529 .
530 .{* The absolute section. *}
531 .extern const asection bfd_abs_section;
532 .#define bfd_abs_section_ptr ((asection *) &bfd_abs_section)
533 .#define bfd_is_abs_section(sec) ((sec) == bfd_abs_section_ptr)
534 .{* Pointer to the undefined section. *}
535 .extern const asection bfd_und_section;
536 .#define bfd_und_section_ptr ((asection *) &bfd_und_section)
537 .#define bfd_is_und_section(sec) ((sec) == bfd_und_section_ptr)
538 .{* Pointer to the common section. *}
539 .extern const asection bfd_com_section;
540 .#define bfd_com_section_ptr ((asection *) &bfd_com_section)
541 .{* Pointer to the indirect section. *}
542 .extern const asection bfd_ind_section;
543 .#define bfd_ind_section_ptr ((asection *) &bfd_ind_section)
544 .#define bfd_is_ind_section(sec) ((sec) == bfd_ind_section_ptr)
545 .
546 .#define bfd_is_const_section(SEC) \
547 . ( ((SEC) == bfd_abs_section_ptr) \
548 . || ((SEC) == bfd_und_section_ptr) \
549 . || ((SEC) == bfd_com_section_ptr) \
550 . || ((SEC) == bfd_ind_section_ptr))
551 .
552 .extern const struct symbol_cache_entry * const bfd_abs_symbol;
553 .extern const struct symbol_cache_entry * const bfd_com_symbol;
554 .extern const struct symbol_cache_entry * const bfd_und_symbol;
555 .extern const struct symbol_cache_entry * const bfd_ind_symbol;
556 .#define bfd_get_section_size_before_reloc(section) \
557 . ((section)->reloc_done ? (abort (), (bfd_size_type) 1) \
558 . : (section)->_raw_size)
559 .#define bfd_get_section_size_after_reloc(section) \
560 . ((section)->reloc_done ? (section)->_cooked_size \
561 . : (abort (), (bfd_size_type) 1))
562 .
563 .{* Macros to handle insertion and deletion of a bfd's sections. These
564 . only handle the list pointers, ie. do not adjust section_count,
565 . target_index etc. *}
566 .#define bfd_section_list_remove(ABFD, PS) \
567 . do \
568 . { \
569 . asection **_ps = PS; \
570 . asection *_s = *_ps; \
571 . *_ps = _s->next; \
572 . if (_s->next == NULL) \
573 . (ABFD)->section_tail = _ps; \
574 . } \
575 . while (0)
576 .#define bfd_section_list_insert(ABFD, PS, S) \
577 . do \
578 . { \
579 . asection **_ps = PS; \
580 . asection *_s = S; \
581 . _s->next = *_ps; \
582 . *_ps = _s; \
583 . if (_s->next == NULL) \
584 . (ABFD)->section_tail = &_s->next; \
585 . } \
586 . while (0)
587 .
588 */
589
590 /* We use a macro to initialize the static asymbol structures because
591 traditional C does not permit us to initialize a union member while
592 gcc warns if we don't initialize it. */
593 /* the_bfd, name, value, attr, section [, udata] */
594 #ifdef __STDC__
595 #define GLOBAL_SYM_INIT(NAME, SECTION) \
596 { 0, NAME, 0, BSF_SECTION_SYM, (asection *) SECTION, { 0 }}
597 #else
598 #define GLOBAL_SYM_INIT(NAME, SECTION) \
599 { 0, NAME, 0, BSF_SECTION_SYM, (asection *) SECTION }
600 #endif
601
602 /* These symbols are global, not specific to any BFD. Therefore, anything
603 that tries to change them is broken, and should be repaired. */
604
605 static const asymbol global_syms[] =
606 {
607 GLOBAL_SYM_INIT (BFD_COM_SECTION_NAME, &bfd_com_section),
608 GLOBAL_SYM_INIT (BFD_UND_SECTION_NAME, &bfd_und_section),
609 GLOBAL_SYM_INIT (BFD_ABS_SECTION_NAME, &bfd_abs_section),
610 GLOBAL_SYM_INIT (BFD_IND_SECTION_NAME, &bfd_ind_section)
611 };
612
613 #define STD_SECTION(SEC, FLAGS, SYM, NAME, IDX) \
614 const asymbol * const SYM = (asymbol *) &global_syms[IDX]; \
615 const asection SEC = \
616 /* name, id, index, next, flags, user_set_vma, reloc_done, */ \
617 { NAME, IDX, 0, NULL, FLAGS, 0, 0, \
618 \
619 /* linker_mark, linker_has_input, gc_mark, segment_mark, */ \
620 0, 0, 1, 0, \
621 \
622 /* sec_info_type, use_rela_p, has_tls_reloc, */ \
623 0, 0, 0, \
624 \
625 /* need_finalize_relax, has_gp_reloc, */ \
626 0, 0, \
627 \
628 /* flag13, flag14, flag15, flag16, flag20, flag24, */ \
629 0, 0, 0, 0, 0, 0, \
630 \
631 /* vma, lma, _cooked_size, _raw_size, */ \
632 0, 0, 0, 0, \
633 \
634 /* output_offset, output_section, alignment_power, */ \
635 0, (struct sec *) &SEC, 0, \
636 \
637 /* relocation, orelocation, reloc_count, filepos, rel_filepos, */ \
638 NULL, NULL, 0, 0, 0, \
639 \
640 /* line_filepos, userdata, contents, lineno, lineno_count, */ \
641 0, NULL, NULL, NULL, 0, \
642 \
643 /* entsize, comdat, moving_line_filepos, */ \
644 0, NULL, 0, \
645 \
646 /* target_index, used_by_bfd, constructor_chain, owner, */ \
647 0, NULL, NULL, NULL, \
648 \
649 /* symbol, */ \
650 (struct symbol_cache_entry *) &global_syms[IDX], \
651 \
652 /* symbol_ptr_ptr, */ \
653 (struct symbol_cache_entry **) &SYM, \
654 \
655 /* link_order_head, link_order_tail */ \
656 NULL, NULL \
657 }
658
659 STD_SECTION (bfd_com_section, SEC_IS_COMMON, bfd_com_symbol,
660 BFD_COM_SECTION_NAME, 0);
661 STD_SECTION (bfd_und_section, 0, bfd_und_symbol, BFD_UND_SECTION_NAME, 1);
662 STD_SECTION (bfd_abs_section, 0, bfd_abs_symbol, BFD_ABS_SECTION_NAME, 2);
663 STD_SECTION (bfd_ind_section, 0, bfd_ind_symbol, BFD_IND_SECTION_NAME, 3);
664 #undef STD_SECTION
665
666 struct section_hash_entry
667 {
668 struct bfd_hash_entry root;
669 asection section;
670 };
671
672 /* Initialize an entry in the section hash table. */
673
674 struct bfd_hash_entry *
675 bfd_section_hash_newfunc (entry, table, string)
676 struct bfd_hash_entry *entry;
677 struct bfd_hash_table *table;
678 const char *string;
679 {
680 /* Allocate the structure if it has not already been allocated by a
681 subclass. */
682 if (entry == NULL)
683 {
684 entry = (struct bfd_hash_entry *)
685 bfd_hash_allocate (table, sizeof (struct section_hash_entry));
686 if (entry == NULL)
687 return entry;
688 }
689
690 /* Call the allocation method of the superclass. */
691 entry = bfd_hash_newfunc (entry, table, string);
692 if (entry != NULL)
693 {
694 memset ((PTR) &((struct section_hash_entry *) entry)->section,
695 0, sizeof (asection));
696 }
697
698 return entry;
699 }
700
701 #define section_hash_lookup(table, string, create, copy) \
702 ((struct section_hash_entry *) \
703 bfd_hash_lookup ((table), (string), (create), (copy)))
704
705 /* Initializes a new section. NEWSECT->NAME is already set. */
706
707 static asection *bfd_section_init PARAMS ((bfd *, asection *));
708
709 static asection *
710 bfd_section_init (abfd, newsect)
711 bfd *abfd;
712 asection *newsect;
713 {
714 static int section_id = 0x10; /* id 0 to 3 used by STD_SECTION. */
715
716 newsect->id = section_id;
717 newsect->index = abfd->section_count;
718 newsect->owner = abfd;
719
720 /* Create a symbol whose only job is to point to this section. This
721 is useful for things like relocs which are relative to the base
722 of a section. */
723 newsect->symbol = bfd_make_empty_symbol (abfd);
724 if (newsect->symbol == NULL)
725 return NULL;
726
727 newsect->symbol->name = newsect->name;
728 newsect->symbol->value = 0;
729 newsect->symbol->section = newsect;
730 newsect->symbol->flags = BSF_SECTION_SYM;
731
732 newsect->symbol_ptr_ptr = &newsect->symbol;
733
734 if (! BFD_SEND (abfd, _new_section_hook, (abfd, newsect)))
735 return NULL;
736
737 section_id++;
738 abfd->section_count++;
739 *abfd->section_tail = newsect;
740 abfd->section_tail = &newsect->next;
741 return newsect;
742 }
743
744 /*
745 DOCDD
746 INODE
747 section prototypes, , typedef asection, Sections
748 SUBSECTION
749 Section prototypes
750
751 These are the functions exported by the section handling part of BFD.
752 */
753
754 /*
755 FUNCTION
756 bfd_section_list_clear
757
758 SYNOPSIS
759 void bfd_section_list_clear (bfd *);
760
761 DESCRIPTION
762 Clears the section list, and also resets the section count and
763 hash table entries.
764 */
765
766 void
767 bfd_section_list_clear (abfd)
768 bfd *abfd;
769 {
770 abfd->sections = NULL;
771 abfd->section_tail = &abfd->sections;
772 abfd->section_count = 0;
773 memset ((PTR) abfd->section_htab.table, 0,
774 abfd->section_htab.size * sizeof (struct bfd_hash_entry *));
775 }
776
777 /*
778 FUNCTION
779 bfd_get_section_by_name
780
781 SYNOPSIS
782 asection *bfd_get_section_by_name(bfd *abfd, const char *name);
783
784 DESCRIPTION
785 Run through @var{abfd} and return the one of the
786 <<asection>>s whose name matches @var{name}, otherwise <<NULL>>.
787 @xref{Sections}, for more information.
788
789 This should only be used in special cases; the normal way to process
790 all sections of a given name is to use <<bfd_map_over_sections>> and
791 <<strcmp>> on the name (or better yet, base it on the section flags
792 or something else) for each section.
793 */
794
795 asection *
796 bfd_get_section_by_name (abfd, name)
797 bfd *abfd;
798 const char *name;
799 {
800 struct section_hash_entry *sh;
801
802 sh = section_hash_lookup (&abfd->section_htab, name, FALSE, FALSE);
803 if (sh != NULL)
804 return &sh->section;
805
806 return NULL;
807 }
808
809 /*
810 FUNCTION
811 bfd_get_unique_section_name
812
813 SYNOPSIS
814 char *bfd_get_unique_section_name(bfd *abfd,
815 const char *templat,
816 int *count);
817
818 DESCRIPTION
819 Invent a section name that is unique in @var{abfd} by tacking
820 a dot and a digit suffix onto the original @var{templat}. If
821 @var{count} is non-NULL, then it specifies the first number
822 tried as a suffix to generate a unique name. The value
823 pointed to by @var{count} will be incremented in this case.
824 */
825
826 char *
827 bfd_get_unique_section_name (abfd, templat, count)
828 bfd *abfd;
829 const char *templat;
830 int *count;
831 {
832 int num;
833 unsigned int len;
834 char *sname;
835
836 len = strlen (templat);
837 sname = bfd_malloc ((bfd_size_type) len + 8);
838 if (sname == NULL)
839 return NULL;
840 memcpy (sname, templat, len);
841 num = 1;
842 if (count != NULL)
843 num = *count;
844
845 do
846 {
847 /* If we have a million sections, something is badly wrong. */
848 if (num > 999999)
849 abort ();
850 sprintf (sname + len, ".%d", num++);
851 }
852 while (section_hash_lookup (&abfd->section_htab, sname, FALSE, FALSE));
853
854 if (count != NULL)
855 *count = num;
856 return sname;
857 }
858
859 /*
860 FUNCTION
861 bfd_make_section_old_way
862
863 SYNOPSIS
864 asection *bfd_make_section_old_way(bfd *abfd, const char *name);
865
866 DESCRIPTION
867 Create a new empty section called @var{name}
868 and attach it to the end of the chain of sections for the
869 BFD @var{abfd}. An attempt to create a section with a name which
870 is already in use returns its pointer without changing the
871 section chain.
872
873 It has the funny name since this is the way it used to be
874 before it was rewritten....
875
876 Possible errors are:
877 o <<bfd_error_invalid_operation>> -
878 If output has already started for this BFD.
879 o <<bfd_error_no_memory>> -
880 If memory allocation fails.
881
882 */
883
884 asection *
885 bfd_make_section_old_way (abfd, name)
886 bfd *abfd;
887 const char *name;
888 {
889 struct section_hash_entry *sh;
890 asection *newsect;
891
892 if (abfd->output_has_begun)
893 {
894 bfd_set_error (bfd_error_invalid_operation);
895 return NULL;
896 }
897
898 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0)
899 return bfd_abs_section_ptr;
900
901 if (strcmp (name, BFD_COM_SECTION_NAME) == 0)
902 return bfd_com_section_ptr;
903
904 if (strcmp (name, BFD_UND_SECTION_NAME) == 0)
905 return bfd_und_section_ptr;
906
907 if (strcmp (name, BFD_IND_SECTION_NAME) == 0)
908 return bfd_ind_section_ptr;
909
910 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
911 if (sh == NULL)
912 return NULL;
913
914 newsect = &sh->section;
915 if (newsect->name != NULL)
916 {
917 /* Section already exists. */
918 return newsect;
919 }
920
921 newsect->name = name;
922 return bfd_section_init (abfd, newsect);
923 }
924
925 /*
926 FUNCTION
927 bfd_make_section_anyway
928
929 SYNOPSIS
930 asection *bfd_make_section_anyway(bfd *abfd, const char *name);
931
932 DESCRIPTION
933 Create a new empty section called @var{name} and attach it to the end of
934 the chain of sections for @var{abfd}. Create a new section even if there
935 is already a section with that name.
936
937 Return <<NULL>> and set <<bfd_error>> on error; possible errors are:
938 o <<bfd_error_invalid_operation>> - If output has already started for @var{abfd}.
939 o <<bfd_error_no_memory>> - If memory allocation fails.
940 */
941
942 sec_ptr
943 bfd_make_section_anyway (abfd, name)
944 bfd *abfd;
945 const char *name;
946 {
947 struct section_hash_entry *sh;
948 asection *newsect;
949
950 if (abfd->output_has_begun)
951 {
952 bfd_set_error (bfd_error_invalid_operation);
953 return NULL;
954 }
955
956 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
957 if (sh == NULL)
958 return NULL;
959
960 newsect = &sh->section;
961 if (newsect->name != NULL)
962 {
963 /* We are making a section of the same name. It can't go in
964 section_htab without generating a unique section name and
965 that would be pointless; We don't need to traverse the
966 hash table. */
967 newsect = (asection *) bfd_zalloc (abfd, sizeof (asection));
968 if (newsect == NULL)
969 return NULL;
970 }
971
972 newsect->name = name;
973 return bfd_section_init (abfd, newsect);
974 }
975
976 /*
977 FUNCTION
978 bfd_make_section
979
980 SYNOPSIS
981 asection *bfd_make_section(bfd *, const char *name);
982
983 DESCRIPTION
984 Like <<bfd_make_section_anyway>>, but return <<NULL>> (without calling
985 bfd_set_error ()) without changing the section chain if there is already a
986 section named @var{name}. If there is an error, return <<NULL>> and set
987 <<bfd_error>>.
988 */
989
990 asection *
991 bfd_make_section (abfd, name)
992 bfd *abfd;
993 const char *name;
994 {
995 struct section_hash_entry *sh;
996 asection *newsect;
997
998 if (abfd->output_has_begun)
999 {
1000 bfd_set_error (bfd_error_invalid_operation);
1001 return NULL;
1002 }
1003
1004 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0
1005 || strcmp (name, BFD_COM_SECTION_NAME) == 0
1006 || strcmp (name, BFD_UND_SECTION_NAME) == 0
1007 || strcmp (name, BFD_IND_SECTION_NAME) == 0)
1008 return NULL;
1009
1010 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
1011 if (sh == NULL)
1012 return NULL;
1013
1014 newsect = &sh->section;
1015 if (newsect->name != NULL)
1016 {
1017 /* Section already exists. */
1018 return newsect;
1019 }
1020
1021 newsect->name = name;
1022 return bfd_section_init (abfd, newsect);
1023 }
1024
1025 /*
1026 FUNCTION
1027 bfd_set_section_flags
1028
1029 SYNOPSIS
1030 bfd_boolean bfd_set_section_flags (bfd *abfd, asection *sec, flagword flags);
1031
1032 DESCRIPTION
1033 Set the attributes of the section @var{sec} in the BFD
1034 @var{abfd} to the value @var{flags}. Return <<TRUE>> on success,
1035 <<FALSE>> on error. Possible error returns are:
1036
1037 o <<bfd_error_invalid_operation>> -
1038 The section cannot have one or more of the attributes
1039 requested. For example, a .bss section in <<a.out>> may not
1040 have the <<SEC_HAS_CONTENTS>> field set.
1041
1042 */
1043
1044 /*ARGSUSED*/
1045 bfd_boolean
1046 bfd_set_section_flags (abfd, section, flags)
1047 bfd *abfd ATTRIBUTE_UNUSED;
1048 sec_ptr section;
1049 flagword flags;
1050 {
1051 #if 0
1052 /* If you try to copy a text section from an input file (where it
1053 has the SEC_CODE flag set) to an output file, this loses big if
1054 the bfd_applicable_section_flags (abfd) doesn't have the SEC_CODE
1055 set - which it doesn't, at least not for a.out. FIXME */
1056
1057 if ((flags & bfd_applicable_section_flags (abfd)) != flags)
1058 {
1059 bfd_set_error (bfd_error_invalid_operation);
1060 return FALSE;
1061 }
1062 #endif
1063
1064 section->flags = flags;
1065 return TRUE;
1066 }
1067
1068 /*
1069 FUNCTION
1070 bfd_map_over_sections
1071
1072 SYNOPSIS
1073 void bfd_map_over_sections(bfd *abfd,
1074 void (*func) (bfd *abfd,
1075 asection *sect,
1076 PTR obj),
1077 PTR obj);
1078
1079 DESCRIPTION
1080 Call the provided function @var{func} for each section
1081 attached to the BFD @var{abfd}, passing @var{obj} as an
1082 argument. The function will be called as if by
1083
1084 | func(abfd, the_section, obj);
1085
1086 This is the prefered method for iterating over sections; an
1087 alternative would be to use a loop:
1088
1089 | section *p;
1090 | for (p = abfd->sections; p != NULL; p = p->next)
1091 | func(abfd, p, ...)
1092
1093 */
1094
1095 /*VARARGS2*/
1096 void
1097 bfd_map_over_sections (abfd, operation, user_storage)
1098 bfd *abfd;
1099 void (*operation) PARAMS ((bfd * abfd, asection * sect, PTR obj));
1100 PTR user_storage;
1101 {
1102 asection *sect;
1103 unsigned int i = 0;
1104
1105 for (sect = abfd->sections; sect != NULL; i++, sect = sect->next)
1106 (*operation) (abfd, sect, user_storage);
1107
1108 if (i != abfd->section_count) /* Debugging */
1109 abort ();
1110 }
1111
1112 /*
1113 FUNCTION
1114 bfd_set_section_size
1115
1116 SYNOPSIS
1117 bfd_boolean bfd_set_section_size (bfd *abfd, asection *sec, bfd_size_type val);
1118
1119 DESCRIPTION
1120 Set @var{sec} to the size @var{val}. If the operation is
1121 ok, then <<TRUE>> is returned, else <<FALSE>>.
1122
1123 Possible error returns:
1124 o <<bfd_error_invalid_operation>> -
1125 Writing has started to the BFD, so setting the size is invalid.
1126
1127 */
1128
1129 bfd_boolean
1130 bfd_set_section_size (abfd, ptr, val)
1131 bfd *abfd;
1132 sec_ptr ptr;
1133 bfd_size_type val;
1134 {
1135 /* Once you've started writing to any section you cannot create or change
1136 the size of any others. */
1137
1138 if (abfd->output_has_begun)
1139 {
1140 bfd_set_error (bfd_error_invalid_operation);
1141 return FALSE;
1142 }
1143
1144 ptr->_cooked_size = val;
1145 ptr->_raw_size = val;
1146
1147 return TRUE;
1148 }
1149
1150 /*
1151 FUNCTION
1152 bfd_set_section_contents
1153
1154 SYNOPSIS
1155 bfd_boolean bfd_set_section_contents (bfd *abfd, asection *section,
1156 PTR data, file_ptr offset,
1157 bfd_size_type count);
1158
1159 DESCRIPTION
1160 Sets the contents of the section @var{section} in BFD
1161 @var{abfd} to the data starting in memory at @var{data}. The
1162 data is written to the output section starting at offset
1163 @var{offset} for @var{count} octets.
1164
1165 Normally <<TRUE>> is returned, else <<FALSE>>. Possible error
1166 returns are:
1167 o <<bfd_error_no_contents>> -
1168 The output section does not have the <<SEC_HAS_CONTENTS>>
1169 attribute, so nothing can be written to it.
1170 o and some more too
1171
1172 This routine is front end to the back end function
1173 <<_bfd_set_section_contents>>.
1174
1175 */
1176
1177 #define bfd_get_section_size_now(abfd,sec) \
1178 (sec->reloc_done \
1179 ? bfd_get_section_size_after_reloc (sec) \
1180 : bfd_get_section_size_before_reloc (sec))
1181
1182 bfd_boolean
1183 bfd_set_section_contents (abfd, section, location, offset, count)
1184 bfd *abfd;
1185 sec_ptr section;
1186 PTR location;
1187 file_ptr offset;
1188 bfd_size_type count;
1189 {
1190 bfd_size_type sz;
1191
1192 if (!(bfd_get_section_flags (abfd, section) & SEC_HAS_CONTENTS))
1193 {
1194 bfd_set_error (bfd_error_no_contents);
1195 return FALSE;
1196 }
1197
1198 sz = bfd_get_section_size_now (abfd, section);
1199 if ((bfd_size_type) offset > sz
1200 || count > sz
1201 || offset + count > sz
1202 || count != (size_t) count)
1203 {
1204 bfd_set_error (bfd_error_bad_value);
1205 return FALSE;
1206 }
1207
1208 switch (abfd->direction)
1209 {
1210 case read_direction:
1211 case no_direction:
1212 bfd_set_error (bfd_error_invalid_operation);
1213 return FALSE;
1214
1215 case write_direction:
1216 break;
1217
1218 case both_direction:
1219 /* File is opened for update. `output_has_begun' some time ago when
1220 the file was created. Do not recompute sections sizes or alignments
1221 in _bfd_set_section_content. */
1222 abfd->output_has_begun = TRUE;
1223 break;
1224 }
1225
1226 /* Record a copy of the data in memory if desired. */
1227 if (section->contents
1228 && location != (PTR) (section->contents + offset))
1229 memcpy (section->contents + offset, location, (size_t) count);
1230
1231 if (BFD_SEND (abfd, _bfd_set_section_contents,
1232 (abfd, section, location, offset, count)))
1233 {
1234 abfd->output_has_begun = TRUE;
1235 return TRUE;
1236 }
1237
1238 return FALSE;
1239 }
1240
1241 /*
1242 FUNCTION
1243 bfd_get_section_contents
1244
1245 SYNOPSIS
1246 bfd_boolean bfd_get_section_contents (bfd *abfd, asection *section,
1247 PTR location, file_ptr offset,
1248 bfd_size_type count);
1249
1250 DESCRIPTION
1251 Read data from @var{section} in BFD @var{abfd}
1252 into memory starting at @var{location}. The data is read at an
1253 offset of @var{offset} from the start of the input section,
1254 and is read for @var{count} bytes.
1255
1256 If the contents of a constructor with the <<SEC_CONSTRUCTOR>>
1257 flag set are requested or if the section does not have the
1258 <<SEC_HAS_CONTENTS>> flag set, then the @var{location} is filled
1259 with zeroes. If no errors occur, <<TRUE>> is returned, else
1260 <<FALSE>>.
1261
1262 */
1263 bfd_boolean
1264 bfd_get_section_contents (abfd, section, location, offset, count)
1265 bfd *abfd;
1266 sec_ptr section;
1267 PTR location;
1268 file_ptr offset;
1269 bfd_size_type count;
1270 {
1271 bfd_size_type sz;
1272
1273 if (section->flags & SEC_CONSTRUCTOR)
1274 {
1275 memset (location, 0, (size_t) count);
1276 return TRUE;
1277 }
1278
1279 /* Even if reloc_done is TRUE, this function reads unrelocated
1280 contents, so we want the raw size. */
1281 sz = section->_raw_size;
1282 if ((bfd_size_type) offset > sz
1283 || count > sz
1284 || offset + count > sz
1285 || count != (size_t) count)
1286 {
1287 bfd_set_error (bfd_error_bad_value);
1288 return FALSE;
1289 }
1290
1291 if (count == 0)
1292 /* Don't bother. */
1293 return TRUE;
1294
1295 if ((section->flags & SEC_HAS_CONTENTS) == 0)
1296 {
1297 memset (location, 0, (size_t) count);
1298 return TRUE;
1299 }
1300
1301 if ((section->flags & SEC_IN_MEMORY) != 0)
1302 {
1303 memcpy (location, section->contents + offset, (size_t) count);
1304 return TRUE;
1305 }
1306
1307 return BFD_SEND (abfd, _bfd_get_section_contents,
1308 (abfd, section, location, offset, count));
1309 }
1310
1311 /*
1312 FUNCTION
1313 bfd_copy_private_section_data
1314
1315 SYNOPSIS
1316 bfd_boolean bfd_copy_private_section_data (bfd *ibfd, asection *isec,
1317 bfd *obfd, asection *osec);
1318
1319 DESCRIPTION
1320 Copy private section information from @var{isec} in the BFD
1321 @var{ibfd} to the section @var{osec} in the BFD @var{obfd}.
1322 Return <<TRUE>> on success, <<FALSE>> on error. Possible error
1323 returns are:
1324
1325 o <<bfd_error_no_memory>> -
1326 Not enough memory exists to create private data for @var{osec}.
1327
1328 .#define bfd_copy_private_section_data(ibfd, isection, obfd, osection) \
1329 . BFD_SEND (obfd, _bfd_copy_private_section_data, \
1330 . (ibfd, isection, obfd, osection))
1331 */
1332
1333 /*
1334 FUNCTION
1335 _bfd_strip_section_from_output
1336
1337 SYNOPSIS
1338 void _bfd_strip_section_from_output
1339 (struct bfd_link_info *info, asection *section);
1340
1341 DESCRIPTION
1342 Remove @var{section} from the output. If the output section
1343 becomes empty, remove it from the output bfd.
1344
1345 This function won't actually do anything except twiddle flags
1346 if called too late in the linking process, when it's not safe
1347 to remove sections.
1348 */
1349 void
1350 _bfd_strip_section_from_output (info, s)
1351 struct bfd_link_info *info;
1352 asection *s;
1353 {
1354 asection *os;
1355 asection *is;
1356 bfd *abfd;
1357
1358 s->flags |= SEC_EXCLUDE;
1359
1360 /* If the section wasn't assigned to an output section, or the
1361 section has been discarded by the linker script, there's nothing
1362 more to do. */
1363 os = s->output_section;
1364 if (os == NULL || os->owner == NULL)
1365 return;
1366
1367 /* If the output section has other (non-excluded) input sections, we
1368 can't remove it. */
1369 for (abfd = info->input_bfds; abfd != NULL; abfd = abfd->link_next)
1370 for (is = abfd->sections; is != NULL; is = is->next)
1371 if (is->output_section == os && (is->flags & SEC_EXCLUDE) == 0)
1372 return;
1373
1374 /* If the output section is empty, flag it for removal too.
1375 See ldlang.c:strip_excluded_output_sections for the action. */
1376 os->flags |= SEC_EXCLUDE;
1377 }
1378
1379 /*
1380 FUNCTION
1381 bfd_generic_discard_group
1382
1383 SYNOPSIS
1384 bfd_boolean bfd_generic_discard_group (bfd *abfd, asection *group);
1385
1386 DESCRIPTION
1387 Remove all members of @var{group} from the output.
1388 */
1389
1390 bfd_boolean
1391 bfd_generic_discard_group (abfd, group)
1392 bfd *abfd ATTRIBUTE_UNUSED;
1393 asection *group ATTRIBUTE_UNUSED;
1394 {
1395 return TRUE;
1396 }
This page took 0.082302 seconds and 4 git commands to generate.