BFD_FAKE_SECTIONS formatting
[deliverable/binutils-gdb.git] / bfd / section.c
1 /* Object file "section" support for the BFD library.
2 Copyright (C) 1990-2020 Free Software Foundation, Inc.
3 Written by Cygnus Support.
4
5 This file is part of BFD, the Binary File Descriptor library.
6
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
11
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
20 MA 02110-1301, USA. */
21
22 /*
23 SECTION
24 Sections
25
26 The raw data contained within a BFD is maintained through the
27 section abstraction. A single BFD may have any number of
28 sections. It keeps hold of them by pointing to the first;
29 each one points to the next in the list.
30
31 Sections are supported in BFD in <<section.c>>.
32
33 @menu
34 @* Section Input::
35 @* Section Output::
36 @* typedef asection::
37 @* section prototypes::
38 @end menu
39
40 INODE
41 Section Input, Section Output, Sections, Sections
42 SUBSECTION
43 Section input
44
45 When a BFD is opened for reading, the section structures are
46 created and attached to the BFD.
47
48 Each section has a name which describes the section in the
49 outside world---for example, <<a.out>> would contain at least
50 three sections, called <<.text>>, <<.data>> and <<.bss>>.
51
52 Names need not be unique; for example a COFF file may have several
53 sections named <<.data>>.
54
55 Sometimes a BFD will contain more than the ``natural'' number of
56 sections. A back end may attach other sections containing
57 constructor data, or an application may add a section (using
58 <<bfd_make_section>>) to the sections attached to an already open
59 BFD. For example, the linker creates an extra section
60 <<COMMON>> for each input file's BFD to hold information about
61 common storage.
62
63 The raw data is not necessarily read in when
64 the section descriptor is created. Some targets may leave the
65 data in place until a <<bfd_get_section_contents>> call is
66 made. Other back ends may read in all the data at once. For
67 example, an S-record file has to be read once to determine the
68 size of the data.
69
70 INODE
71 Section Output, typedef asection, Section Input, Sections
72
73 SUBSECTION
74 Section output
75
76 To write a new object style BFD, the various sections to be
77 written have to be created. They are attached to the BFD in
78 the same way as input sections; data is written to the
79 sections using <<bfd_set_section_contents>>.
80
81 Any program that creates or combines sections (e.g., the assembler
82 and linker) must use the <<asection>> fields <<output_section>> and
83 <<output_offset>> to indicate the file sections to which each
84 section must be written. (If the section is being created from
85 scratch, <<output_section>> should probably point to the section
86 itself and <<output_offset>> should probably be zero.)
87
88 The data to be written comes from input sections attached
89 (via <<output_section>> pointers) to
90 the output sections. The output section structure can be
91 considered a filter for the input section: the output section
92 determines the vma of the output data and the name, but the
93 input section determines the offset into the output section of
94 the data to be written.
95
96 E.g., to create a section "O", starting at 0x100, 0x123 long,
97 containing two subsections, "A" at offset 0x0 (i.e., at vma
98 0x100) and "B" at offset 0x20 (i.e., at vma 0x120) the <<asection>>
99 structures would look like:
100
101 | section name "A"
102 | output_offset 0x00
103 | size 0x20
104 | output_section -----------> section name "O"
105 | | vma 0x100
106 | section name "B" | size 0x123
107 | output_offset 0x20 |
108 | size 0x103 |
109 | output_section --------|
110
111 SUBSECTION
112 Link orders
113
114 The data within a section is stored in a @dfn{link_order}.
115 These are much like the fixups in <<gas>>. The link_order
116 abstraction allows a section to grow and shrink within itself.
117
118 A link_order knows how big it is, and which is the next
119 link_order and where the raw data for it is; it also points to
120 a list of relocations which apply to it.
121
122 The link_order is used by the linker to perform relaxing on
123 final code. The compiler creates code which is as big as
124 necessary to make it work without relaxing, and the user can
125 select whether to relax. Sometimes relaxing takes a lot of
126 time. The linker runs around the relocations to see if any
127 are attached to data which can be shrunk, if so it does it on
128 a link_order by link_order basis.
129
130 */
131
132 #include "sysdep.h"
133 #include "bfd.h"
134 #include "libbfd.h"
135 #include "bfdlink.h"
136
137 /*
138 DOCDD
139 INODE
140 typedef asection, section prototypes, Section Output, Sections
141 SUBSECTION
142 typedef asection
143
144 Here is the section structure:
145
146 CODE_FRAGMENT
147 .
148 .typedef struct bfd_section
149 .{
150 . {* The name of the section; the name isn't a copy, the pointer is
151 . the same as that passed to bfd_make_section. *}
152 . const char *name;
153 .
154 . {* A unique sequence number. *}
155 . unsigned int id;
156 .
157 . {* A unique section number which can be used by assembler to
158 . distinguish different sections with the same section name. *}
159 . unsigned int section_id;
160 .
161 . {* Which section in the bfd; 0..n-1 as sections are created in a bfd. *}
162 . unsigned int index;
163 .
164 . {* The next section in the list belonging to the BFD, or NULL. *}
165 . struct bfd_section *next;
166 .
167 . {* The previous section in the list belonging to the BFD, or NULL. *}
168 . struct bfd_section *prev;
169 .
170 . {* The field flags contains attributes of the section. Some
171 . flags are read in from the object file, and some are
172 . synthesized from other information. *}
173 . flagword flags;
174 .
175 .#define SEC_NO_FLAGS 0x0
176 .
177 . {* Tells the OS to allocate space for this section when loading.
178 . This is clear for a section containing debug information only. *}
179 .#define SEC_ALLOC 0x1
180 .
181 . {* Tells the OS to load the section from the file when loading.
182 . This is clear for a .bss section. *}
183 .#define SEC_LOAD 0x2
184 .
185 . {* The section contains data still to be relocated, so there is
186 . some relocation information too. *}
187 .#define SEC_RELOC 0x4
188 .
189 . {* A signal to the OS that the section contains read only data. *}
190 .#define SEC_READONLY 0x8
191 .
192 . {* The section contains code only. *}
193 .#define SEC_CODE 0x10
194 .
195 . {* The section contains data only. *}
196 .#define SEC_DATA 0x20
197 .
198 . {* The section will reside in ROM. *}
199 .#define SEC_ROM 0x40
200 .
201 . {* The section contains constructor information. This section
202 . type is used by the linker to create lists of constructors and
203 . destructors used by <<g++>>. When a back end sees a symbol
204 . which should be used in a constructor list, it creates a new
205 . section for the type of name (e.g., <<__CTOR_LIST__>>), attaches
206 . the symbol to it, and builds a relocation. To build the lists
207 . of constructors, all the linker has to do is catenate all the
208 . sections called <<__CTOR_LIST__>> and relocate the data
209 . contained within - exactly the operations it would peform on
210 . standard data. *}
211 .#define SEC_CONSTRUCTOR 0x80
212 .
213 . {* The section has contents - a data section could be
214 . <<SEC_ALLOC>> | <<SEC_HAS_CONTENTS>>; a debug section could be
215 . <<SEC_HAS_CONTENTS>> *}
216 .#define SEC_HAS_CONTENTS 0x100
217 .
218 . {* An instruction to the linker to not output the section
219 . even if it has information which would normally be written. *}
220 .#define SEC_NEVER_LOAD 0x200
221 .
222 . {* The section contains thread local data. *}
223 .#define SEC_THREAD_LOCAL 0x400
224 .
225 . {* The section's size is fixed. Generic linker code will not
226 . recalculate it and it is up to whoever has set this flag to
227 . get the size right. *}
228 .#define SEC_FIXED_SIZE 0x800
229 .
230 . {* The section contains common symbols (symbols may be defined
231 . multiple times, the value of a symbol is the amount of
232 . space it requires, and the largest symbol value is the one
233 . used). Most targets have exactly one of these (which we
234 . translate to bfd_com_section_ptr), but ECOFF has two. *}
235 .#define SEC_IS_COMMON 0x1000
236 .
237 . {* The section contains only debugging information. For
238 . example, this is set for ELF .debug and .stab sections.
239 . strip tests this flag to see if a section can be
240 . discarded. *}
241 .#define SEC_DEBUGGING 0x2000
242 .
243 . {* The contents of this section are held in memory pointed to
244 . by the contents field. This is checked by bfd_get_section_contents,
245 . and the data is retrieved from memory if appropriate. *}
246 .#define SEC_IN_MEMORY 0x4000
247 .
248 . {* The contents of this section are to be excluded by the
249 . linker for executable and shared objects unless those
250 . objects are to be further relocated. *}
251 .#define SEC_EXCLUDE 0x8000
252 .
253 . {* The contents of this section are to be sorted based on the sum of
254 . the symbol and addend values specified by the associated relocation
255 . entries. Entries without associated relocation entries will be
256 . appended to the end of the section in an unspecified order. *}
257 .#define SEC_SORT_ENTRIES 0x10000
258 .
259 . {* When linking, duplicate sections of the same name should be
260 . discarded, rather than being combined into a single section as
261 . is usually done. This is similar to how common symbols are
262 . handled. See SEC_LINK_DUPLICATES below. *}
263 .#define SEC_LINK_ONCE 0x20000
264 .
265 . {* If SEC_LINK_ONCE is set, this bitfield describes how the linker
266 . should handle duplicate sections. *}
267 .#define SEC_LINK_DUPLICATES 0xc0000
268 .
269 . {* This value for SEC_LINK_DUPLICATES means that duplicate
270 . sections with the same name should simply be discarded. *}
271 .#define SEC_LINK_DUPLICATES_DISCARD 0x0
272 .
273 . {* This value for SEC_LINK_DUPLICATES means that the linker
274 . should warn if there are any duplicate sections, although
275 . it should still only link one copy. *}
276 .#define SEC_LINK_DUPLICATES_ONE_ONLY 0x40000
277 .
278 . {* This value for SEC_LINK_DUPLICATES means that the linker
279 . should warn if any duplicate sections are a different size. *}
280 .#define SEC_LINK_DUPLICATES_SAME_SIZE 0x80000
281 .
282 . {* This value for SEC_LINK_DUPLICATES means that the linker
283 . should warn if any duplicate sections contain different
284 . contents. *}
285 .#define SEC_LINK_DUPLICATES_SAME_CONTENTS \
286 . (SEC_LINK_DUPLICATES_ONE_ONLY | SEC_LINK_DUPLICATES_SAME_SIZE)
287 .
288 . {* This section was created by the linker as part of dynamic
289 . relocation or other arcane processing. It is skipped when
290 . going through the first-pass output, trusting that someone
291 . else up the line will take care of it later. *}
292 .#define SEC_LINKER_CREATED 0x100000
293 .
294 . {* This section contains a section ID to distinguish different
295 . sections with the same section name. *}
296 .#define SEC_ASSEMBLER_SECTION_ID 0x100000
297 .
298 . {* This section should not be subject to garbage collection.
299 . Also set to inform the linker that this section should not be
300 . listed in the link map as discarded. *}
301 .#define SEC_KEEP 0x200000
302 .
303 . {* This section contains "short" data, and should be placed
304 . "near" the GP. *}
305 .#define SEC_SMALL_DATA 0x400000
306 .
307 . {* Attempt to merge identical entities in the section.
308 . Entity size is given in the entsize field. *}
309 .#define SEC_MERGE 0x800000
310 .
311 . {* If given with SEC_MERGE, entities to merge are zero terminated
312 . strings where entsize specifies character size instead of fixed
313 . size entries. *}
314 .#define SEC_STRINGS 0x1000000
315 .
316 . {* This section contains data about section groups. *}
317 .#define SEC_GROUP 0x2000000
318 .
319 . {* The section is a COFF shared library section. This flag is
320 . only for the linker. If this type of section appears in
321 . the input file, the linker must copy it to the output file
322 . without changing the vma or size. FIXME: Although this
323 . was originally intended to be general, it really is COFF
324 . specific (and the flag was renamed to indicate this). It
325 . might be cleaner to have some more general mechanism to
326 . allow the back end to control what the linker does with
327 . sections. *}
328 .#define SEC_COFF_SHARED_LIBRARY 0x4000000
329 .
330 . {* This input section should be copied to output in reverse order
331 . as an array of pointers. This is for ELF linker internal use
332 . only. *}
333 .#define SEC_ELF_REVERSE_COPY 0x4000000
334 .
335 . {* This section contains data which may be shared with other
336 . executables or shared objects. This is for COFF only. *}
337 .#define SEC_COFF_SHARED 0x8000000
338 .
339 . {* This section should be compressed. This is for ELF linker
340 . internal use only. *}
341 .#define SEC_ELF_COMPRESS 0x8000000
342 .
343 . {* When a section with this flag is being linked, then if the size of
344 . the input section is less than a page, it should not cross a page
345 . boundary. If the size of the input section is one page or more,
346 . it should be aligned on a page boundary. This is for TI
347 . TMS320C54X only. *}
348 .#define SEC_TIC54X_BLOCK 0x10000000
349 .
350 . {* This section should be renamed. This is for ELF linker
351 . internal use only. *}
352 .#define SEC_ELF_RENAME 0x10000000
353 .
354 . {* Conditionally link this section; do not link if there are no
355 . references found to any symbol in the section. This is for TI
356 . TMS320C54X only. *}
357 .#define SEC_TIC54X_CLINK 0x20000000
358 .
359 . {* This section contains vliw code. This is for Toshiba MeP only. *}
360 .#define SEC_MEP_VLIW 0x20000000
361 .
362 . {* All symbols, sizes and relocations in this section are octets
363 . instead of bytes. Required for DWARF debug sections as DWARF
364 . information is organized in octets, not bytes. *}
365 .#define SEC_ELF_OCTETS 0x40000000
366 .
367 . {* Indicate that section has the no read flag set. This happens
368 . when memory read flag isn't set. *}
369 .#define SEC_COFF_NOREAD 0x40000000
370 .
371 . {* Indicate that section has the purecode flag set. *}
372 .#define SEC_ELF_PURECODE 0x80000000
373 .
374 . {* End of section flags. *}
375 .
376 . {* Some internal packed boolean fields. *}
377 .
378 . {* See the vma field. *}
379 . unsigned int user_set_vma : 1;
380 .
381 . {* A mark flag used by some of the linker backends. *}
382 . unsigned int linker_mark : 1;
383 .
384 . {* Another mark flag used by some of the linker backends. Set for
385 . output sections that have an input section. *}
386 . unsigned int linker_has_input : 1;
387 .
388 . {* Mark flag used by some linker backends for garbage collection. *}
389 . unsigned int gc_mark : 1;
390 .
391 . {* Section compression status. *}
392 . unsigned int compress_status : 2;
393 .#define COMPRESS_SECTION_NONE 0
394 .#define COMPRESS_SECTION_DONE 1
395 .#define DECOMPRESS_SECTION_SIZED 2
396 .
397 . {* The following flags are used by the ELF linker. *}
398 .
399 . {* Mark sections which have been allocated to segments. *}
400 . unsigned int segment_mark : 1;
401 .
402 . {* Type of sec_info information. *}
403 . unsigned int sec_info_type:3;
404 .#define SEC_INFO_TYPE_NONE 0
405 .#define SEC_INFO_TYPE_STABS 1
406 .#define SEC_INFO_TYPE_MERGE 2
407 .#define SEC_INFO_TYPE_EH_FRAME 3
408 .#define SEC_INFO_TYPE_JUST_SYMS 4
409 .#define SEC_INFO_TYPE_TARGET 5
410 .#define SEC_INFO_TYPE_EH_FRAME_ENTRY 6
411 .
412 . {* Nonzero if this section uses RELA relocations, rather than REL. *}
413 . unsigned int use_rela_p:1;
414 .
415 . {* Bits used by various backends. The generic code doesn't touch
416 . these fields. *}
417 .
418 . unsigned int sec_flg0:1;
419 . unsigned int sec_flg1:1;
420 . unsigned int sec_flg2:1;
421 . unsigned int sec_flg3:1;
422 . unsigned int sec_flg4:1;
423 . unsigned int sec_flg5:1;
424 .
425 . {* End of internal packed boolean fields. *}
426 .
427 . {* The virtual memory address of the section - where it will be
428 . at run time. The symbols are relocated against this. The
429 . user_set_vma flag is maintained by bfd; if it's not set, the
430 . backend can assign addresses (for example, in <<a.out>>, where
431 . the default address for <<.data>> is dependent on the specific
432 . target and various flags). *}
433 . bfd_vma vma;
434 .
435 . {* The load address of the section - where it would be in a
436 . rom image; really only used for writing section header
437 . information. *}
438 . bfd_vma lma;
439 .
440 . {* The size of the section in *octets*, as it will be output.
441 . Contains a value even if the section has no contents (e.g., the
442 . size of <<.bss>>). *}
443 . bfd_size_type size;
444 .
445 . {* For input sections, the original size on disk of the section, in
446 . octets. This field should be set for any section whose size is
447 . changed by linker relaxation. It is required for sections where
448 . the linker relaxation scheme doesn't cache altered section and
449 . reloc contents (stabs, eh_frame, SEC_MERGE, some coff relaxing
450 . targets), and thus the original size needs to be kept to read the
451 . section multiple times. For output sections, rawsize holds the
452 . section size calculated on a previous linker relaxation pass. *}
453 . bfd_size_type rawsize;
454 .
455 . {* The compressed size of the section in octets. *}
456 . bfd_size_type compressed_size;
457 .
458 . {* Relaxation table. *}
459 . struct relax_table *relax;
460 .
461 . {* Count of used relaxation table entries. *}
462 . int relax_count;
463 .
464 .
465 . {* If this section is going to be output, then this value is the
466 . offset in *bytes* into the output section of the first byte in the
467 . input section (byte ==> smallest addressable unit on the
468 . target). In most cases, if this was going to start at the
469 . 100th octet (8-bit quantity) in the output section, this value
470 . would be 100. However, if the target byte size is 16 bits
471 . (bfd_octets_per_byte is "2"), this value would be 50. *}
472 . bfd_vma output_offset;
473 .
474 . {* The output section through which to map on output. *}
475 . struct bfd_section *output_section;
476 .
477 . {* The alignment requirement of the section, as an exponent of 2 -
478 . e.g., 3 aligns to 2^3 (or 8). *}
479 . unsigned int alignment_power;
480 .
481 . {* If an input section, a pointer to a vector of relocation
482 . records for the data in this section. *}
483 . struct reloc_cache_entry *relocation;
484 .
485 . {* If an output section, a pointer to a vector of pointers to
486 . relocation records for the data in this section. *}
487 . struct reloc_cache_entry **orelocation;
488 .
489 . {* The number of relocation records in one of the above. *}
490 . unsigned reloc_count;
491 .
492 . {* Information below is back end specific - and not always used
493 . or updated. *}
494 .
495 . {* File position of section data. *}
496 . file_ptr filepos;
497 .
498 . {* File position of relocation info. *}
499 . file_ptr rel_filepos;
500 .
501 . {* File position of line data. *}
502 . file_ptr line_filepos;
503 .
504 . {* Pointer to data for applications. *}
505 . void *userdata;
506 .
507 . {* If the SEC_IN_MEMORY flag is set, this points to the actual
508 . contents. *}
509 . unsigned char *contents;
510 .
511 . {* Attached line number information. *}
512 . alent *lineno;
513 .
514 . {* Number of line number records. *}
515 . unsigned int lineno_count;
516 .
517 . {* Entity size for merging purposes. *}
518 . unsigned int entsize;
519 .
520 . {* Points to the kept section if this section is a link-once section,
521 . and is discarded. *}
522 . struct bfd_section *kept_section;
523 .
524 . {* When a section is being output, this value changes as more
525 . linenumbers are written out. *}
526 . file_ptr moving_line_filepos;
527 .
528 . {* What the section number is in the target world. *}
529 . int target_index;
530 .
531 . void *used_by_bfd;
532 .
533 . {* If this is a constructor section then here is a list of the
534 . relocations created to relocate items within it. *}
535 . struct relent_chain *constructor_chain;
536 .
537 . {* The BFD which owns the section. *}
538 . bfd *owner;
539 .
540 . {* A symbol which points at this section only. *}
541 . struct bfd_symbol *symbol;
542 . struct bfd_symbol **symbol_ptr_ptr;
543 .
544 . {* Early in the link process, map_head and map_tail are used to build
545 . a list of input sections attached to an output section. Later,
546 . output sections use these fields for a list of bfd_link_order
547 . structs. The linked_to_symbol_name field is for ELF assembler
548 . internal use. *}
549 . union {
550 . struct bfd_link_order *link_order;
551 . struct bfd_section *s;
552 . const char *linked_to_symbol_name;
553 . } map_head, map_tail;
554 . {* Points to the output section this section is already assigned to, if any.
555 . This is used when support for non-contiguous memory regions is enabled. *}
556 . struct bfd_section *already_assigned;
557 .
558 .} asection;
559 .
560 .{* Relax table contains information about instructions which can
561 . be removed by relaxation -- replacing a long address with a
562 . short address. *}
563 .struct relax_table {
564 . {* Address where bytes may be deleted. *}
565 . bfd_vma addr;
566 .
567 . {* Number of bytes to be deleted. *}
568 . int size;
569 .};
570 .
571 .static inline const char *
572 .bfd_section_name (const asection *sec)
573 .{
574 . return sec->name;
575 .}
576 .
577 .static inline bfd_size_type
578 .bfd_section_size (const asection *sec)
579 .{
580 . return sec->size;
581 .}
582 .
583 .static inline bfd_vma
584 .bfd_section_vma (const asection *sec)
585 .{
586 . return sec->vma;
587 .}
588 .
589 .static inline bfd_vma
590 .bfd_section_lma (const asection *sec)
591 .{
592 . return sec->lma;
593 .}
594 .
595 .static inline unsigned int
596 .bfd_section_alignment (const asection *sec)
597 .{
598 . return sec->alignment_power;
599 .}
600 .
601 .static inline flagword
602 .bfd_section_flags (const asection *sec)
603 .{
604 . return sec->flags;
605 .}
606 .
607 .static inline void *
608 .bfd_section_userdata (const asection *sec)
609 .{
610 . return sec->userdata;
611 .}
612 .static inline bfd_boolean
613 .bfd_is_com_section (const asection *sec)
614 .{
615 . return (sec->flags & SEC_IS_COMMON) != 0;
616 .}
617 .
618 .{* Note: the following are provided as inline functions rather than macros
619 . because not all callers use the return value. A macro implementation
620 . would use a comma expression, eg: "((ptr)->foo = val, TRUE)" and some
621 . compilers will complain about comma expressions that have no effect. *}
622 .static inline bfd_boolean
623 .bfd_set_section_userdata (asection *sec, void *val)
624 .{
625 . sec->userdata = val;
626 . return TRUE;
627 .}
628 .
629 .static inline bfd_boolean
630 .bfd_set_section_vma (asection *sec, bfd_vma val)
631 .{
632 . sec->vma = sec->lma = val;
633 . sec->user_set_vma = TRUE;
634 . return TRUE;
635 .}
636 .
637 .static inline bfd_boolean
638 .bfd_set_section_lma (asection *sec, bfd_vma val)
639 .{
640 . sec->lma = val;
641 . return TRUE;
642 .}
643 .
644 .static inline bfd_boolean
645 .bfd_set_section_alignment (asection *sec, unsigned int val)
646 .{
647 . sec->alignment_power = val;
648 . return TRUE;
649 .}
650 .
651 .{* These sections are global, and are managed by BFD. The application
652 . and target back end are not permitted to change the values in
653 . these sections. *}
654 .extern asection _bfd_std_section[4];
655 .
656 .#define BFD_ABS_SECTION_NAME "*ABS*"
657 .#define BFD_UND_SECTION_NAME "*UND*"
658 .#define BFD_COM_SECTION_NAME "*COM*"
659 .#define BFD_IND_SECTION_NAME "*IND*"
660 .
661 .{* Pointer to the common section. *}
662 .#define bfd_com_section_ptr (&_bfd_std_section[0])
663 .{* Pointer to the undefined section. *}
664 .#define bfd_und_section_ptr (&_bfd_std_section[1])
665 .{* Pointer to the absolute section. *}
666 .#define bfd_abs_section_ptr (&_bfd_std_section[2])
667 .{* Pointer to the indirect section. *}
668 .#define bfd_ind_section_ptr (&_bfd_std_section[3])
669 .
670 .static inline bfd_boolean
671 .bfd_is_und_section (const asection *sec)
672 .{
673 . return sec == bfd_und_section_ptr;
674 .}
675 .
676 .static inline bfd_boolean
677 .bfd_is_abs_section (const asection *sec)
678 .{
679 . return sec == bfd_abs_section_ptr;
680 .}
681 .
682 .static inline bfd_boolean
683 .bfd_is_ind_section (const asection *sec)
684 .{
685 . return sec == bfd_ind_section_ptr;
686 .}
687 .
688 .static inline bfd_boolean
689 .bfd_is_const_section (const asection *sec)
690 .{
691 . return sec >= bfd_abs_section_ptr && sec <= bfd_ind_section_ptr;
692 .}
693 .
694 .{* Return TRUE if input section SEC has been discarded. *}
695 .static inline bfd_boolean
696 .discarded_section (const asection *sec)
697 .{
698 . return (!bfd_is_abs_section (sec)
699 . && bfd_is_abs_section (sec->output_section)
700 . && sec->sec_info_type != SEC_INFO_TYPE_MERGE
701 . && sec->sec_info_type != SEC_INFO_TYPE_JUST_SYMS);
702 .}
703 .
704 .#define BFD_FAKE_SECTION(SEC, SYM, NAME, IDX, FLAGS) \
705 . {* name, id, section_id, index, next, prev, flags, user_set_vma, *} \
706 . { NAME, IDX, 0, 0, NULL, NULL, FLAGS, 0, \
707 . \
708 . {* linker_mark, linker_has_input, gc_mark, decompress_status, *} \
709 . 0, 0, 1, 0, \
710 . \
711 . {* segment_mark, sec_info_type, use_rela_p, *} \
712 . 0, 0, 0, \
713 . \
714 . {* sec_flg0, sec_flg1, sec_flg2, sec_flg3, sec_flg4, sec_flg5, *} \
715 . 0, 0, 0, 0, 0, 0, \
716 . \
717 . {* vma, lma, size, rawsize, compressed_size, relax, relax_count, *} \
718 . 0, 0, 0, 0, 0, 0, 0, \
719 . \
720 . {* output_offset, output_section, alignment_power, *} \
721 . 0, &SEC, 0, \
722 . \
723 . {* relocation, orelocation, reloc_count, filepos, rel_filepos, *} \
724 . NULL, NULL, 0, 0, 0, \
725 . \
726 . {* line_filepos, userdata, contents, lineno, lineno_count, *} \
727 . 0, NULL, NULL, NULL, 0, \
728 . \
729 . {* entsize, kept_section, moving_line_filepos, *} \
730 . 0, NULL, 0, \
731 . \
732 . {* target_index, used_by_bfd, constructor_chain, owner, *} \
733 . 0, NULL, NULL, NULL, \
734 . \
735 . {* symbol, symbol_ptr_ptr, *} \
736 . (struct bfd_symbol *) SYM, &SEC.symbol, \
737 . \
738 . {* map_head, map_tail, already_assigned *} \
739 . { NULL }, { NULL }, NULL \
740 . \
741 . }
742 .
743 .{* We use a macro to initialize the static asymbol structures because
744 . traditional C does not permit us to initialize a union member while
745 . gcc warns if we don't initialize it.
746 . the_bfd, name, value, attr, section [, udata] *}
747 .#ifdef __STDC__
748 .#define GLOBAL_SYM_INIT(NAME, SECTION) \
749 . { 0, NAME, 0, BSF_SECTION_SYM, SECTION, { 0 }}
750 .#else
751 .#define GLOBAL_SYM_INIT(NAME, SECTION) \
752 . { 0, NAME, 0, BSF_SECTION_SYM, SECTION }
753 .#endif
754 .
755 */
756
757 /* These symbols are global, not specific to any BFD. Therefore, anything
758 that tries to change them is broken, and should be repaired. */
759
760 static const asymbol global_syms[] =
761 {
762 GLOBAL_SYM_INIT (BFD_COM_SECTION_NAME, bfd_com_section_ptr),
763 GLOBAL_SYM_INIT (BFD_UND_SECTION_NAME, bfd_und_section_ptr),
764 GLOBAL_SYM_INIT (BFD_ABS_SECTION_NAME, bfd_abs_section_ptr),
765 GLOBAL_SYM_INIT (BFD_IND_SECTION_NAME, bfd_ind_section_ptr)
766 };
767
768 #define STD_SECTION(NAME, IDX, FLAGS) \
769 BFD_FAKE_SECTION(_bfd_std_section[IDX], &global_syms[IDX], NAME, IDX, FLAGS)
770
771 asection _bfd_std_section[] = {
772 STD_SECTION (BFD_COM_SECTION_NAME, 0, SEC_IS_COMMON),
773 STD_SECTION (BFD_UND_SECTION_NAME, 1, 0),
774 STD_SECTION (BFD_ABS_SECTION_NAME, 2, 0),
775 STD_SECTION (BFD_IND_SECTION_NAME, 3, 0)
776 };
777 #undef STD_SECTION
778
779 /* Initialize an entry in the section hash table. */
780
781 struct bfd_hash_entry *
782 bfd_section_hash_newfunc (struct bfd_hash_entry *entry,
783 struct bfd_hash_table *table,
784 const char *string)
785 {
786 /* Allocate the structure if it has not already been allocated by a
787 subclass. */
788 if (entry == NULL)
789 {
790 entry = (struct bfd_hash_entry *)
791 bfd_hash_allocate (table, sizeof (struct section_hash_entry));
792 if (entry == NULL)
793 return entry;
794 }
795
796 /* Call the allocation method of the superclass. */
797 entry = bfd_hash_newfunc (entry, table, string);
798 if (entry != NULL)
799 memset (&((struct section_hash_entry *) entry)->section, 0,
800 sizeof (asection));
801
802 return entry;
803 }
804
805 #define section_hash_lookup(table, string, create, copy) \
806 ((struct section_hash_entry *) \
807 bfd_hash_lookup ((table), (string), (create), (copy)))
808
809 /* Create a symbol whose only job is to point to this section. This
810 is useful for things like relocs which are relative to the base
811 of a section. */
812
813 bfd_boolean
814 _bfd_generic_new_section_hook (bfd *abfd, asection *newsect)
815 {
816 newsect->symbol = bfd_make_empty_symbol (abfd);
817 if (newsect->symbol == NULL)
818 return FALSE;
819
820 newsect->symbol->name = newsect->name;
821 newsect->symbol->value = 0;
822 newsect->symbol->section = newsect;
823 newsect->symbol->flags = BSF_SECTION_SYM;
824
825 newsect->symbol_ptr_ptr = &newsect->symbol;
826 return TRUE;
827 }
828
829 unsigned int _bfd_section_id = 0x10; /* id 0 to 3 used by STD_SECTION. */
830
831 /* Initializes a new section. NEWSECT->NAME is already set. */
832
833 static asection *
834 bfd_section_init (bfd *abfd, asection *newsect)
835 {
836 newsect->id = _bfd_section_id;
837 newsect->index = abfd->section_count;
838 newsect->owner = abfd;
839
840 if (! BFD_SEND (abfd, _new_section_hook, (abfd, newsect)))
841 return NULL;
842
843 _bfd_section_id++;
844 abfd->section_count++;
845 bfd_section_list_append (abfd, newsect);
846 return newsect;
847 }
848
849 /*
850 DOCDD
851 INODE
852 section prototypes, , typedef asection, Sections
853 SUBSECTION
854 Section prototypes
855
856 These are the functions exported by the section handling part of BFD.
857 */
858
859 /*
860 FUNCTION
861 bfd_section_list_clear
862
863 SYNOPSIS
864 void bfd_section_list_clear (bfd *);
865
866 DESCRIPTION
867 Clears the section list, and also resets the section count and
868 hash table entries.
869 */
870
871 void
872 bfd_section_list_clear (bfd *abfd)
873 {
874 abfd->sections = NULL;
875 abfd->section_last = NULL;
876 abfd->section_count = 0;
877 memset (abfd->section_htab.table, 0,
878 abfd->section_htab.size * sizeof (struct bfd_hash_entry *));
879 abfd->section_htab.count = 0;
880 }
881
882 /*
883 FUNCTION
884 bfd_get_section_by_name
885
886 SYNOPSIS
887 asection *bfd_get_section_by_name (bfd *abfd, const char *name);
888
889 DESCRIPTION
890 Return the most recently created section attached to @var{abfd}
891 named @var{name}. Return NULL if no such section exists.
892 */
893
894 asection *
895 bfd_get_section_by_name (bfd *abfd, const char *name)
896 {
897 struct section_hash_entry *sh;
898
899 sh = section_hash_lookup (&abfd->section_htab, name, FALSE, FALSE);
900 if (sh != NULL)
901 return &sh->section;
902
903 return NULL;
904 }
905
906 /*
907 FUNCTION
908 bfd_get_next_section_by_name
909
910 SYNOPSIS
911 asection *bfd_get_next_section_by_name (bfd *ibfd, asection *sec);
912
913 DESCRIPTION
914 Given @var{sec} is a section returned by @code{bfd_get_section_by_name},
915 return the next most recently created section attached to the same
916 BFD with the same name, or if no such section exists in the same BFD and
917 IBFD is non-NULL, the next section with the same name in any input
918 BFD following IBFD. Return NULL on finding no section.
919 */
920
921 asection *
922 bfd_get_next_section_by_name (bfd *ibfd, asection *sec)
923 {
924 struct section_hash_entry *sh;
925 const char *name;
926 unsigned long hash;
927
928 sh = ((struct section_hash_entry *)
929 ((char *) sec - offsetof (struct section_hash_entry, section)));
930
931 hash = sh->root.hash;
932 name = sec->name;
933 for (sh = (struct section_hash_entry *) sh->root.next;
934 sh != NULL;
935 sh = (struct section_hash_entry *) sh->root.next)
936 if (sh->root.hash == hash
937 && strcmp (sh->root.string, name) == 0)
938 return &sh->section;
939
940 if (ibfd != NULL)
941 {
942 while ((ibfd = ibfd->link.next) != NULL)
943 {
944 asection *s = bfd_get_section_by_name (ibfd, name);
945 if (s != NULL)
946 return s;
947 }
948 }
949
950 return NULL;
951 }
952
953 /*
954 FUNCTION
955 bfd_get_linker_section
956
957 SYNOPSIS
958 asection *bfd_get_linker_section (bfd *abfd, const char *name);
959
960 DESCRIPTION
961 Return the linker created section attached to @var{abfd}
962 named @var{name}. Return NULL if no such section exists.
963 */
964
965 asection *
966 bfd_get_linker_section (bfd *abfd, const char *name)
967 {
968 asection *sec = bfd_get_section_by_name (abfd, name);
969
970 while (sec != NULL && (sec->flags & SEC_LINKER_CREATED) == 0)
971 sec = bfd_get_next_section_by_name (NULL, sec);
972 return sec;
973 }
974
975 /*
976 FUNCTION
977 bfd_get_section_by_name_if
978
979 SYNOPSIS
980 asection *bfd_get_section_by_name_if
981 (bfd *abfd,
982 const char *name,
983 bfd_boolean (*func) (bfd *abfd, asection *sect, void *obj),
984 void *obj);
985
986 DESCRIPTION
987 Call the provided function @var{func} for each section
988 attached to the BFD @var{abfd} whose name matches @var{name},
989 passing @var{obj} as an argument. The function will be called
990 as if by
991
992 | func (abfd, the_section, obj);
993
994 It returns the first section for which @var{func} returns true,
995 otherwise <<NULL>>.
996
997 */
998
999 asection *
1000 bfd_get_section_by_name_if (bfd *abfd, const char *name,
1001 bfd_boolean (*operation) (bfd *,
1002 asection *,
1003 void *),
1004 void *user_storage)
1005 {
1006 struct section_hash_entry *sh;
1007 unsigned long hash;
1008
1009 sh = section_hash_lookup (&abfd->section_htab, name, FALSE, FALSE);
1010 if (sh == NULL)
1011 return NULL;
1012
1013 hash = sh->root.hash;
1014 for (; sh != NULL; sh = (struct section_hash_entry *) sh->root.next)
1015 if (sh->root.hash == hash
1016 && strcmp (sh->root.string, name) == 0
1017 && (*operation) (abfd, &sh->section, user_storage))
1018 return &sh->section;
1019
1020 return NULL;
1021 }
1022
1023 /*
1024 FUNCTION
1025 bfd_get_unique_section_name
1026
1027 SYNOPSIS
1028 char *bfd_get_unique_section_name
1029 (bfd *abfd, const char *templat, int *count);
1030
1031 DESCRIPTION
1032 Invent a section name that is unique in @var{abfd} by tacking
1033 a dot and a digit suffix onto the original @var{templat}. If
1034 @var{count} is non-NULL, then it specifies the first number
1035 tried as a suffix to generate a unique name. The value
1036 pointed to by @var{count} will be incremented in this case.
1037 */
1038
1039 char *
1040 bfd_get_unique_section_name (bfd *abfd, const char *templat, int *count)
1041 {
1042 int num;
1043 unsigned int len;
1044 char *sname;
1045
1046 len = strlen (templat);
1047 sname = (char *) bfd_malloc (len + 8);
1048 if (sname == NULL)
1049 return NULL;
1050 memcpy (sname, templat, len);
1051 num = 1;
1052 if (count != NULL)
1053 num = *count;
1054
1055 do
1056 {
1057 /* If we have a million sections, something is badly wrong. */
1058 if (num > 999999)
1059 abort ();
1060 sprintf (sname + len, ".%d", num++);
1061 }
1062 while (section_hash_lookup (&abfd->section_htab, sname, FALSE, FALSE));
1063
1064 if (count != NULL)
1065 *count = num;
1066 return sname;
1067 }
1068
1069 /*
1070 FUNCTION
1071 bfd_make_section_old_way
1072
1073 SYNOPSIS
1074 asection *bfd_make_section_old_way (bfd *abfd, const char *name);
1075
1076 DESCRIPTION
1077 Create a new empty section called @var{name}
1078 and attach it to the end of the chain of sections for the
1079 BFD @var{abfd}. An attempt to create a section with a name which
1080 is already in use returns its pointer without changing the
1081 section chain.
1082
1083 It has the funny name since this is the way it used to be
1084 before it was rewritten....
1085
1086 Possible errors are:
1087 o <<bfd_error_invalid_operation>> -
1088 If output has already started for this BFD.
1089 o <<bfd_error_no_memory>> -
1090 If memory allocation fails.
1091
1092 */
1093
1094 asection *
1095 bfd_make_section_old_way (bfd *abfd, const char *name)
1096 {
1097 asection *newsect;
1098
1099 if (abfd->output_has_begun)
1100 {
1101 bfd_set_error (bfd_error_invalid_operation);
1102 return NULL;
1103 }
1104
1105 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0)
1106 newsect = bfd_abs_section_ptr;
1107 else if (strcmp (name, BFD_COM_SECTION_NAME) == 0)
1108 newsect = bfd_com_section_ptr;
1109 else if (strcmp (name, BFD_UND_SECTION_NAME) == 0)
1110 newsect = bfd_und_section_ptr;
1111 else if (strcmp (name, BFD_IND_SECTION_NAME) == 0)
1112 newsect = bfd_ind_section_ptr;
1113 else
1114 {
1115 struct section_hash_entry *sh;
1116
1117 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
1118 if (sh == NULL)
1119 return NULL;
1120
1121 newsect = &sh->section;
1122 if (newsect->name != NULL)
1123 {
1124 /* Section already exists. */
1125 return newsect;
1126 }
1127
1128 newsect->name = name;
1129 return bfd_section_init (abfd, newsect);
1130 }
1131
1132 /* Call new_section_hook when "creating" the standard abs, com, und
1133 and ind sections to tack on format specific section data.
1134 Also, create a proper section symbol. */
1135 if (! BFD_SEND (abfd, _new_section_hook, (abfd, newsect)))
1136 return NULL;
1137 return newsect;
1138 }
1139
1140 /*
1141 FUNCTION
1142 bfd_make_section_anyway_with_flags
1143
1144 SYNOPSIS
1145 asection *bfd_make_section_anyway_with_flags
1146 (bfd *abfd, const char *name, flagword flags);
1147
1148 DESCRIPTION
1149 Create a new empty section called @var{name} and attach it to the end of
1150 the chain of sections for @var{abfd}. Create a new section even if there
1151 is already a section with that name. Also set the attributes of the
1152 new section to the value @var{flags}.
1153
1154 Return <<NULL>> and set <<bfd_error>> on error; possible errors are:
1155 o <<bfd_error_invalid_operation>> - If output has already started for @var{abfd}.
1156 o <<bfd_error_no_memory>> - If memory allocation fails.
1157 */
1158
1159 sec_ptr
1160 bfd_make_section_anyway_with_flags (bfd *abfd, const char *name,
1161 flagword flags)
1162 {
1163 struct section_hash_entry *sh;
1164 asection *newsect;
1165
1166 if (abfd->output_has_begun)
1167 {
1168 bfd_set_error (bfd_error_invalid_operation);
1169 return NULL;
1170 }
1171
1172 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
1173 if (sh == NULL)
1174 return NULL;
1175
1176 newsect = &sh->section;
1177 if (newsect->name != NULL)
1178 {
1179 /* We are making a section of the same name. Put it in the
1180 section hash table. Even though we can't find it directly by a
1181 hash lookup, we'll be able to find the section by traversing
1182 sh->root.next quicker than looking at all the bfd sections. */
1183 struct section_hash_entry *new_sh;
1184 new_sh = (struct section_hash_entry *)
1185 bfd_section_hash_newfunc (NULL, &abfd->section_htab, name);
1186 if (new_sh == NULL)
1187 return NULL;
1188
1189 new_sh->root = sh->root;
1190 sh->root.next = &new_sh->root;
1191 newsect = &new_sh->section;
1192 }
1193
1194 newsect->flags = flags;
1195 newsect->name = name;
1196 return bfd_section_init (abfd, newsect);
1197 }
1198
1199 /*
1200 FUNCTION
1201 bfd_make_section_anyway
1202
1203 SYNOPSIS
1204 asection *bfd_make_section_anyway (bfd *abfd, const char *name);
1205
1206 DESCRIPTION
1207 Create a new empty section called @var{name} and attach it to the end of
1208 the chain of sections for @var{abfd}. Create a new section even if there
1209 is already a section with that name.
1210
1211 Return <<NULL>> and set <<bfd_error>> on error; possible errors are:
1212 o <<bfd_error_invalid_operation>> - If output has already started for @var{abfd}.
1213 o <<bfd_error_no_memory>> - If memory allocation fails.
1214 */
1215
1216 sec_ptr
1217 bfd_make_section_anyway (bfd *abfd, const char *name)
1218 {
1219 return bfd_make_section_anyway_with_flags (abfd, name, 0);
1220 }
1221
1222 /*
1223 FUNCTION
1224 bfd_make_section_with_flags
1225
1226 SYNOPSIS
1227 asection *bfd_make_section_with_flags
1228 (bfd *, const char *name, flagword flags);
1229
1230 DESCRIPTION
1231 Like <<bfd_make_section_anyway>>, but return <<NULL>> (without calling
1232 bfd_set_error ()) without changing the section chain if there is already a
1233 section named @var{name}. Also set the attributes of the new section to
1234 the value @var{flags}. If there is an error, return <<NULL>> and set
1235 <<bfd_error>>.
1236 */
1237
1238 asection *
1239 bfd_make_section_with_flags (bfd *abfd, const char *name,
1240 flagword flags)
1241 {
1242 struct section_hash_entry *sh;
1243 asection *newsect;
1244
1245 if (abfd == NULL || name == NULL || abfd->output_has_begun)
1246 {
1247 bfd_set_error (bfd_error_invalid_operation);
1248 return NULL;
1249 }
1250
1251 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0
1252 || strcmp (name, BFD_COM_SECTION_NAME) == 0
1253 || strcmp (name, BFD_UND_SECTION_NAME) == 0
1254 || strcmp (name, BFD_IND_SECTION_NAME) == 0)
1255 return NULL;
1256
1257 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
1258 if (sh == NULL)
1259 return NULL;
1260
1261 newsect = &sh->section;
1262 if (newsect->name != NULL)
1263 {
1264 /* Section already exists. */
1265 return NULL;
1266 }
1267
1268 newsect->name = name;
1269 newsect->flags = flags;
1270 return bfd_section_init (abfd, newsect);
1271 }
1272
1273 /*
1274 FUNCTION
1275 bfd_make_section
1276
1277 SYNOPSIS
1278 asection *bfd_make_section (bfd *, const char *name);
1279
1280 DESCRIPTION
1281 Like <<bfd_make_section_anyway>>, but return <<NULL>> (without calling
1282 bfd_set_error ()) without changing the section chain if there is already a
1283 section named @var{name}. If there is an error, return <<NULL>> and set
1284 <<bfd_error>>.
1285 */
1286
1287 asection *
1288 bfd_make_section (bfd *abfd, const char *name)
1289 {
1290 return bfd_make_section_with_flags (abfd, name, 0);
1291 }
1292
1293 /*
1294 FUNCTION
1295 bfd_set_section_flags
1296
1297 SYNOPSIS
1298 bfd_boolean bfd_set_section_flags (asection *sec, flagword flags);
1299
1300 DESCRIPTION
1301 Set the attributes of the section @var{sec} to the value @var{flags}.
1302 Return <<TRUE>> on success, <<FALSE>> on error. Possible error
1303 returns are:
1304
1305 o <<bfd_error_invalid_operation>> -
1306 The section cannot have one or more of the attributes
1307 requested. For example, a .bss section in <<a.out>> may not
1308 have the <<SEC_HAS_CONTENTS>> field set.
1309
1310 */
1311
1312 bfd_boolean
1313 bfd_set_section_flags (asection *section, flagword flags)
1314 {
1315 section->flags = flags;
1316 return TRUE;
1317 }
1318
1319 /*
1320 FUNCTION
1321 bfd_rename_section
1322
1323 SYNOPSIS
1324 void bfd_rename_section
1325 (asection *sec, const char *newname);
1326
1327 DESCRIPTION
1328 Rename section @var{sec} to @var{newname}.
1329 */
1330
1331 void
1332 bfd_rename_section (asection *sec, const char *newname)
1333 {
1334 struct section_hash_entry *sh;
1335
1336 sh = (struct section_hash_entry *)
1337 ((char *) sec - offsetof (struct section_hash_entry, section));
1338 sh->section.name = newname;
1339 bfd_hash_rename (&sec->owner->section_htab, newname, &sh->root);
1340 }
1341
1342 /*
1343 FUNCTION
1344 bfd_map_over_sections
1345
1346 SYNOPSIS
1347 void bfd_map_over_sections
1348 (bfd *abfd,
1349 void (*func) (bfd *abfd, asection *sect, void *obj),
1350 void *obj);
1351
1352 DESCRIPTION
1353 Call the provided function @var{func} for each section
1354 attached to the BFD @var{abfd}, passing @var{obj} as an
1355 argument. The function will be called as if by
1356
1357 | func (abfd, the_section, obj);
1358
1359 This is the preferred method for iterating over sections; an
1360 alternative would be to use a loop:
1361
1362 | asection *p;
1363 | for (p = abfd->sections; p != NULL; p = p->next)
1364 | func (abfd, p, ...)
1365
1366 */
1367
1368 void
1369 bfd_map_over_sections (bfd *abfd,
1370 void (*operation) (bfd *, asection *, void *),
1371 void *user_storage)
1372 {
1373 asection *sect;
1374 unsigned int i = 0;
1375
1376 for (sect = abfd->sections; sect != NULL; i++, sect = sect->next)
1377 (*operation) (abfd, sect, user_storage);
1378
1379 if (i != abfd->section_count) /* Debugging */
1380 abort ();
1381 }
1382
1383 /*
1384 FUNCTION
1385 bfd_sections_find_if
1386
1387 SYNOPSIS
1388 asection *bfd_sections_find_if
1389 (bfd *abfd,
1390 bfd_boolean (*operation) (bfd *abfd, asection *sect, void *obj),
1391 void *obj);
1392
1393 DESCRIPTION
1394 Call the provided function @var{operation} for each section
1395 attached to the BFD @var{abfd}, passing @var{obj} as an
1396 argument. The function will be called as if by
1397
1398 | operation (abfd, the_section, obj);
1399
1400 It returns the first section for which @var{operation} returns true.
1401
1402 */
1403
1404 asection *
1405 bfd_sections_find_if (bfd *abfd,
1406 bfd_boolean (*operation) (bfd *, asection *, void *),
1407 void *user_storage)
1408 {
1409 asection *sect;
1410
1411 for (sect = abfd->sections; sect != NULL; sect = sect->next)
1412 if ((*operation) (abfd, sect, user_storage))
1413 break;
1414
1415 return sect;
1416 }
1417
1418 /*
1419 FUNCTION
1420 bfd_set_section_size
1421
1422 SYNOPSIS
1423 bfd_boolean bfd_set_section_size (asection *sec, bfd_size_type val);
1424
1425 DESCRIPTION
1426 Set @var{sec} to the size @var{val}. If the operation is
1427 ok, then <<TRUE>> is returned, else <<FALSE>>.
1428
1429 Possible error returns:
1430 o <<bfd_error_invalid_operation>> -
1431 Writing has started to the BFD, so setting the size is invalid.
1432
1433 */
1434
1435 bfd_boolean
1436 bfd_set_section_size (asection *sec, bfd_size_type val)
1437 {
1438 /* Once you've started writing to any section you cannot create or change
1439 the size of any others. */
1440
1441 if (sec->owner == NULL || sec->owner->output_has_begun)
1442 {
1443 bfd_set_error (bfd_error_invalid_operation);
1444 return FALSE;
1445 }
1446
1447 sec->size = val;
1448 return TRUE;
1449 }
1450
1451 /*
1452 FUNCTION
1453 bfd_set_section_contents
1454
1455 SYNOPSIS
1456 bfd_boolean bfd_set_section_contents
1457 (bfd *abfd, asection *section, const void *data,
1458 file_ptr offset, bfd_size_type count);
1459
1460 DESCRIPTION
1461 Sets the contents of the section @var{section} in BFD
1462 @var{abfd} to the data starting in memory at @var{location}.
1463 The data is written to the output section starting at offset
1464 @var{offset} for @var{count} octets.
1465
1466 Normally <<TRUE>> is returned, but <<FALSE>> is returned if
1467 there was an error. Possible error returns are:
1468 o <<bfd_error_no_contents>> -
1469 The output section does not have the <<SEC_HAS_CONTENTS>>
1470 attribute, so nothing can be written to it.
1471 o <<bfd_error_bad_value>> -
1472 The section is unable to contain all of the data.
1473 o <<bfd_error_invalid_operation>> -
1474 The BFD is not writeable.
1475 o and some more too.
1476
1477 This routine is front end to the back end function
1478 <<_bfd_set_section_contents>>.
1479
1480 */
1481
1482 bfd_boolean
1483 bfd_set_section_contents (bfd *abfd,
1484 sec_ptr section,
1485 const void *location,
1486 file_ptr offset,
1487 bfd_size_type count)
1488 {
1489 bfd_size_type sz;
1490
1491 if (!(bfd_section_flags (section) & SEC_HAS_CONTENTS))
1492 {
1493 bfd_set_error (bfd_error_no_contents);
1494 return FALSE;
1495 }
1496
1497 sz = section->size;
1498 if ((bfd_size_type) offset > sz
1499 || count > sz
1500 || offset + count > sz
1501 || count != (size_t) count)
1502 {
1503 bfd_set_error (bfd_error_bad_value);
1504 return FALSE;
1505 }
1506
1507 if (!bfd_write_p (abfd))
1508 {
1509 bfd_set_error (bfd_error_invalid_operation);
1510 return FALSE;
1511 }
1512
1513 /* Record a copy of the data in memory if desired. */
1514 if (section->contents
1515 && location != section->contents + offset)
1516 memcpy (section->contents + offset, location, (size_t) count);
1517
1518 if (BFD_SEND (abfd, _bfd_set_section_contents,
1519 (abfd, section, location, offset, count)))
1520 {
1521 abfd->output_has_begun = TRUE;
1522 return TRUE;
1523 }
1524
1525 return FALSE;
1526 }
1527
1528 /*
1529 FUNCTION
1530 bfd_get_section_contents
1531
1532 SYNOPSIS
1533 bfd_boolean bfd_get_section_contents
1534 (bfd *abfd, asection *section, void *location, file_ptr offset,
1535 bfd_size_type count);
1536
1537 DESCRIPTION
1538 Read data from @var{section} in BFD @var{abfd}
1539 into memory starting at @var{location}. The data is read at an
1540 offset of @var{offset} from the start of the input section,
1541 and is read for @var{count} bytes.
1542
1543 If the contents of a constructor with the <<SEC_CONSTRUCTOR>>
1544 flag set are requested or if the section does not have the
1545 <<SEC_HAS_CONTENTS>> flag set, then the @var{location} is filled
1546 with zeroes. If no errors occur, <<TRUE>> is returned, else
1547 <<FALSE>>.
1548
1549 */
1550 bfd_boolean
1551 bfd_get_section_contents (bfd *abfd,
1552 sec_ptr section,
1553 void *location,
1554 file_ptr offset,
1555 bfd_size_type count)
1556 {
1557 bfd_size_type sz;
1558
1559 if (section->flags & SEC_CONSTRUCTOR)
1560 {
1561 memset (location, 0, (size_t) count);
1562 return TRUE;
1563 }
1564
1565 if (abfd->direction != write_direction && section->rawsize != 0)
1566 sz = section->rawsize;
1567 else
1568 sz = section->size;
1569 if ((bfd_size_type) offset > sz
1570 || count > sz
1571 || offset + count > sz
1572 || count != (size_t) count)
1573 {
1574 bfd_set_error (bfd_error_bad_value);
1575 return FALSE;
1576 }
1577
1578 if (count == 0)
1579 /* Don't bother. */
1580 return TRUE;
1581
1582 if ((section->flags & SEC_HAS_CONTENTS) == 0)
1583 {
1584 memset (location, 0, (size_t) count);
1585 return TRUE;
1586 }
1587
1588 if ((section->flags & SEC_IN_MEMORY) != 0)
1589 {
1590 if (section->contents == NULL)
1591 {
1592 /* This can happen because of errors earlier on in the linking process.
1593 We do not want to seg-fault here, so clear the flag and return an
1594 error code. */
1595 section->flags &= ~ SEC_IN_MEMORY;
1596 bfd_set_error (bfd_error_invalid_operation);
1597 return FALSE;
1598 }
1599
1600 memmove (location, section->contents + offset, (size_t) count);
1601 return TRUE;
1602 }
1603
1604 return BFD_SEND (abfd, _bfd_get_section_contents,
1605 (abfd, section, location, offset, count));
1606 }
1607
1608 /*
1609 FUNCTION
1610 bfd_malloc_and_get_section
1611
1612 SYNOPSIS
1613 bfd_boolean bfd_malloc_and_get_section
1614 (bfd *abfd, asection *section, bfd_byte **buf);
1615
1616 DESCRIPTION
1617 Read all data from @var{section} in BFD @var{abfd}
1618 into a buffer, *@var{buf}, malloc'd by this function.
1619 */
1620
1621 bfd_boolean
1622 bfd_malloc_and_get_section (bfd *abfd, sec_ptr sec, bfd_byte **buf)
1623 {
1624 *buf = NULL;
1625 return bfd_get_full_section_contents (abfd, sec, buf);
1626 }
1627 /*
1628 FUNCTION
1629 bfd_copy_private_section_data
1630
1631 SYNOPSIS
1632 bfd_boolean bfd_copy_private_section_data
1633 (bfd *ibfd, asection *isec, bfd *obfd, asection *osec);
1634
1635 DESCRIPTION
1636 Copy private section information from @var{isec} in the BFD
1637 @var{ibfd} to the section @var{osec} in the BFD @var{obfd}.
1638 Return <<TRUE>> on success, <<FALSE>> on error. Possible error
1639 returns are:
1640
1641 o <<bfd_error_no_memory>> -
1642 Not enough memory exists to create private data for @var{osec}.
1643
1644 .#define bfd_copy_private_section_data(ibfd, isection, obfd, osection) \
1645 . BFD_SEND (obfd, _bfd_copy_private_section_data, \
1646 . (ibfd, isection, obfd, osection))
1647 */
1648
1649 /*
1650 FUNCTION
1651 bfd_generic_is_group_section
1652
1653 SYNOPSIS
1654 bfd_boolean bfd_generic_is_group_section (bfd *, const asection *sec);
1655
1656 DESCRIPTION
1657 Returns TRUE if @var{sec} is a member of a group.
1658 */
1659
1660 bfd_boolean
1661 bfd_generic_is_group_section (bfd *abfd ATTRIBUTE_UNUSED,
1662 const asection *sec ATTRIBUTE_UNUSED)
1663 {
1664 return FALSE;
1665 }
1666
1667 /*
1668 FUNCTION
1669 bfd_generic_group_name
1670
1671 SYNOPSIS
1672 const char *bfd_generic_group_name (bfd *, const asection *sec);
1673
1674 DESCRIPTION
1675 Returns group name if @var{sec} is a member of a group.
1676 */
1677
1678 const char *
1679 bfd_generic_group_name (bfd *abfd ATTRIBUTE_UNUSED,
1680 const asection *sec ATTRIBUTE_UNUSED)
1681 {
1682 return NULL;
1683 }
1684
1685 /*
1686 FUNCTION
1687 bfd_generic_discard_group
1688
1689 SYNOPSIS
1690 bfd_boolean bfd_generic_discard_group (bfd *abfd, asection *group);
1691
1692 DESCRIPTION
1693 Remove all members of @var{group} from the output.
1694 */
1695
1696 bfd_boolean
1697 bfd_generic_discard_group (bfd *abfd ATTRIBUTE_UNUSED,
1698 asection *group ATTRIBUTE_UNUSED)
1699 {
1700 return TRUE;
1701 }
1702
1703 bfd_boolean
1704 _bfd_nowrite_set_section_contents (bfd *abfd,
1705 sec_ptr section ATTRIBUTE_UNUSED,
1706 const void *location ATTRIBUTE_UNUSED,
1707 file_ptr offset ATTRIBUTE_UNUSED,
1708 bfd_size_type count ATTRIBUTE_UNUSED)
1709 {
1710 return _bfd_bool_bfd_false_error (abfd);
1711 }
This page took 0.068934 seconds and 4 git commands to generate.