RISC-V: Output mapping symbols with ISA string.
[binutils-gdb.git] / bfd / section.c
1 /* Object file "section" support for the BFD library.
2 Copyright (C) 1990-2022 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 . {* The next section in the list belonging to the BFD, or NULL. *}
155 . struct bfd_section *next;
156 .
157 . {* The previous section in the list belonging to the BFD, or NULL. *}
158 . struct bfd_section *prev;
159 .
160 . {* A unique sequence number. *}
161 . unsigned int id;
162 .
163 . {* A unique section number which can be used by assembler to
164 . distinguish different sections with the same section name. *}
165 . unsigned int section_id;
166 .
167 . {* Which section in the bfd; 0..n-1 as sections are created in a bfd. *}
168 . unsigned int index;
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_ZLIB 2
396 .#define DECOMPRESS_SECTION_ZSTD 3
397 .
398 . {* The following flags are used by the ELF linker. *}
399 .
400 . {* Mark sections which have been allocated to segments. *}
401 . unsigned int segment_mark : 1;
402 .
403 . {* Type of sec_info information. *}
404 . unsigned int sec_info_type:3;
405 .#define SEC_INFO_TYPE_NONE 0
406 .#define SEC_INFO_TYPE_STABS 1
407 .#define SEC_INFO_TYPE_MERGE 2
408 .#define SEC_INFO_TYPE_EH_FRAME 3
409 .#define SEC_INFO_TYPE_JUST_SYMS 4
410 .#define SEC_INFO_TYPE_TARGET 5
411 .#define SEC_INFO_TYPE_EH_FRAME_ENTRY 6
412 .
413 . {* Nonzero if this section uses RELA relocations, rather than REL. *}
414 . unsigned int use_rela_p:1;
415 .
416 . {* Bits used by various backends. The generic code doesn't touch
417 . these fields. *}
418 .
419 . unsigned int sec_flg0:1;
420 . unsigned int sec_flg1:1;
421 . unsigned int sec_flg2:1;
422 . unsigned int sec_flg3:1;
423 . unsigned int sec_flg4:1;
424 . unsigned int sec_flg5:1;
425 .
426 . {* End of internal packed boolean fields. *}
427 .
428 . {* The virtual memory address of the section - where it will be
429 . at run time. The symbols are relocated against this. The
430 . user_set_vma flag is maintained by bfd; if it's not set, the
431 . backend can assign addresses (for example, in <<a.out>>, where
432 . the default address for <<.data>> is dependent on the specific
433 . target and various flags). *}
434 . bfd_vma vma;
435 .
436 . {* The load address of the section - where it would be in a
437 . rom image; really only used for writing section header
438 . information. *}
439 . bfd_vma lma;
440 .
441 . {* The size of the section in *octets*, as it will be output.
442 . Contains a value even if the section has no contents (e.g., the
443 . size of <<.bss>>). *}
444 . bfd_size_type size;
445 .
446 . {* For input sections, the original size on disk of the section, in
447 . octets. This field should be set for any section whose size is
448 . changed by linker relaxation. It is required for sections where
449 . the linker relaxation scheme doesn't cache altered section and
450 . reloc contents (stabs, eh_frame, SEC_MERGE, some coff relaxing
451 . targets), and thus the original size needs to be kept to read the
452 . section multiple times. For output sections, rawsize holds the
453 . section size calculated on a previous linker relaxation pass. *}
454 . bfd_size_type rawsize;
455 .
456 . {* The compressed size of the section in octets. *}
457 . bfd_size_type compressed_size;
458 .
459 . {* If this section is going to be output, then this value is the
460 . offset in *bytes* into the output section of the first byte in the
461 . input section (byte ==> smallest addressable unit on the
462 . target). In most cases, if this was going to start at the
463 . 100th octet (8-bit quantity) in the output section, this value
464 . would be 100. However, if the target byte size is 16 bits
465 . (bfd_octets_per_byte is "2"), this value would be 50. *}
466 . bfd_vma output_offset;
467 .
468 . {* The output section through which to map on output. *}
469 . struct bfd_section *output_section;
470 .
471 . {* If an input section, a pointer to a vector of relocation
472 . records for the data in this section. *}
473 . struct reloc_cache_entry *relocation;
474 .
475 . {* If an output section, a pointer to a vector of pointers to
476 . relocation records for the data in this section. *}
477 . struct reloc_cache_entry **orelocation;
478 .
479 . {* The number of relocation records in one of the above. *}
480 . unsigned reloc_count;
481 .
482 . {* The alignment requirement of the section, as an exponent of 2 -
483 . e.g., 3 aligns to 2^3 (or 8). *}
484 . unsigned int alignment_power;
485 .
486 . {* Information below is back end specific - and not always used
487 . or updated. *}
488 .
489 . {* File position of section data. *}
490 . file_ptr filepos;
491 .
492 . {* File position of relocation info. *}
493 . file_ptr rel_filepos;
494 .
495 . {* File position of line data. *}
496 . file_ptr line_filepos;
497 .
498 . {* Pointer to data for applications. *}
499 . void *userdata;
500 .
501 . {* If the SEC_IN_MEMORY flag is set, this points to the actual
502 . contents. *}
503 . unsigned char *contents;
504 .
505 . {* Attached line number information. *}
506 . alent *lineno;
507 .
508 . {* Number of line number records. *}
509 . unsigned int lineno_count;
510 .
511 . {* Entity size for merging purposes. *}
512 . unsigned int entsize;
513 .
514 . {* Points to the kept section if this section is a link-once section,
515 . and is discarded. *}
516 . struct bfd_section *kept_section;
517 .
518 . {* When a section is being output, this value changes as more
519 . linenumbers are written out. *}
520 . file_ptr moving_line_filepos;
521 .
522 . {* What the section number is in the target world. *}
523 . int target_index;
524 .
525 . void *used_by_bfd;
526 .
527 . {* If this is a constructor section then here is a list of the
528 . relocations created to relocate items within it. *}
529 . struct relent_chain *constructor_chain;
530 .
531 . {* The BFD which owns the section. *}
532 . bfd *owner;
533 .
534 . {* A symbol which points at this section only. *}
535 . struct bfd_symbol *symbol;
536 . struct bfd_symbol **symbol_ptr_ptr;
537 .
538 . {* Early in the link process, map_head and map_tail are used to build
539 . a list of input sections attached to an output section. Later,
540 . output sections use these fields for a list of bfd_link_order
541 . structs. The linked_to_symbol_name field is for ELF assembler
542 . internal use. *}
543 . union {
544 . struct bfd_link_order *link_order;
545 . struct bfd_section *s;
546 . const char *linked_to_symbol_name;
547 . } map_head, map_tail;
548 .
549 . {* Points to the output section this section is already assigned to,
550 . if any. This is used when support for non-contiguous memory
551 . regions is enabled. *}
552 . struct bfd_section *already_assigned;
553 .
554 . {* Explicitly specified section type, if non-zero. *}
555 . unsigned int type;
556 .
557 .} asection;
558 .
559 .static inline const char *
560 .bfd_section_name (const asection *sec)
561 .{
562 . return sec->name;
563 .}
564 .
565 .static inline bfd_size_type
566 .bfd_section_size (const asection *sec)
567 .{
568 . return sec->size;
569 .}
570 .
571 .static inline bfd_vma
572 .bfd_section_vma (const asection *sec)
573 .{
574 . return sec->vma;
575 .}
576 .
577 .static inline bfd_vma
578 .bfd_section_lma (const asection *sec)
579 .{
580 . return sec->lma;
581 .}
582 .
583 .static inline unsigned int
584 .bfd_section_alignment (const asection *sec)
585 .{
586 . return sec->alignment_power;
587 .}
588 .
589 .static inline flagword
590 .bfd_section_flags (const asection *sec)
591 .{
592 . return sec->flags;
593 .}
594 .
595 .static inline void *
596 .bfd_section_userdata (const asection *sec)
597 .{
598 . return sec->userdata;
599 .}
600 .static inline bool
601 .bfd_is_com_section (const asection *sec)
602 .{
603 . return (sec->flags & SEC_IS_COMMON) != 0;
604 .}
605 .
606 .{* Note: the following are provided as inline functions rather than macros
607 . because not all callers use the return value. A macro implementation
608 . would use a comma expression, eg: "((ptr)->foo = val, TRUE)" and some
609 . compilers will complain about comma expressions that have no effect. *}
610 .static inline bool
611 .bfd_set_section_userdata (asection *sec, void *val)
612 .{
613 . sec->userdata = val;
614 . return true;
615 .}
616 .
617 .static inline bool
618 .bfd_set_section_vma (asection *sec, bfd_vma val)
619 .{
620 . sec->vma = sec->lma = val;
621 . sec->user_set_vma = true;
622 . return true;
623 .}
624 .
625 .static inline bool
626 .bfd_set_section_lma (asection *sec, bfd_vma val)
627 .{
628 . sec->lma = val;
629 . return true;
630 .}
631 .
632 .static inline bool
633 .bfd_set_section_alignment (asection *sec, unsigned int val)
634 .{
635 . if (val >= sizeof (bfd_vma) * 8 - 1)
636 . return false;
637 . sec->alignment_power = val;
638 . return true;
639 .}
640 .
641 .{* These sections are global, and are managed by BFD. The application
642 . and target back end are not permitted to change the values in
643 . these sections. *}
644 .extern asection _bfd_std_section[4];
645 .
646 .#define BFD_ABS_SECTION_NAME "*ABS*"
647 .#define BFD_UND_SECTION_NAME "*UND*"
648 .#define BFD_COM_SECTION_NAME "*COM*"
649 .#define BFD_IND_SECTION_NAME "*IND*"
650 .
651 .{* Pointer to the common section. *}
652 .#define bfd_com_section_ptr (&_bfd_std_section[0])
653 .{* Pointer to the undefined section. *}
654 .#define bfd_und_section_ptr (&_bfd_std_section[1])
655 .{* Pointer to the absolute section. *}
656 .#define bfd_abs_section_ptr (&_bfd_std_section[2])
657 .{* Pointer to the indirect section. *}
658 .#define bfd_ind_section_ptr (&_bfd_std_section[3])
659 .
660 .static inline bool
661 .bfd_is_und_section (const asection *sec)
662 .{
663 . return sec == bfd_und_section_ptr;
664 .}
665 .
666 .static inline bool
667 .bfd_is_abs_section (const asection *sec)
668 .{
669 . return sec == bfd_abs_section_ptr;
670 .}
671 .
672 .static inline bool
673 .bfd_is_ind_section (const asection *sec)
674 .{
675 . return sec == bfd_ind_section_ptr;
676 .}
677 .
678 .static inline bool
679 .bfd_is_const_section (const asection *sec)
680 .{
681 . return (sec >= _bfd_std_section
682 . && sec < _bfd_std_section + (sizeof (_bfd_std_section)
683 . / sizeof (_bfd_std_section[0])));
684 .}
685 .
686 .{* Return TRUE if input section SEC has been discarded. *}
687 .static inline bool
688 .discarded_section (const asection *sec)
689 .{
690 . return (!bfd_is_abs_section (sec)
691 . && bfd_is_abs_section (sec->output_section)
692 . && sec->sec_info_type != SEC_INFO_TYPE_MERGE
693 . && sec->sec_info_type != SEC_INFO_TYPE_JUST_SYMS);
694 .}
695 .
696 .#define BFD_FAKE_SECTION(SEC, SYM, NAME, IDX, FLAGS) \
697 . {* name, next, prev, id, section_id, index, flags, user_set_vma, *} \
698 . { NAME, NULL, NULL, IDX, 0, 0, FLAGS, 0, \
699 . \
700 . {* linker_mark, linker_has_input, gc_mark, decompress_status, *} \
701 . 0, 0, 1, 0, \
702 . \
703 . {* segment_mark, sec_info_type, use_rela_p, *} \
704 . 0, 0, 0, \
705 . \
706 . {* sec_flg0, sec_flg1, sec_flg2, sec_flg3, sec_flg4, sec_flg5, *} \
707 . 0, 0, 0, 0, 0, 0, \
708 . \
709 . {* vma, lma, size, rawsize, compressed_size, *} \
710 . 0, 0, 0, 0, 0, \
711 . \
712 . {* output_offset, output_section, relocation, orelocation, *} \
713 . 0, &SEC, NULL, NULL, \
714 . \
715 . {* reloc_count, alignment_power, filepos, rel_filepos, *} \
716 . 0, 0, 0, 0, \
717 . \
718 . {* line_filepos, userdata, contents, lineno, lineno_count, *} \
719 . 0, NULL, NULL, NULL, 0, \
720 . \
721 . {* entsize, kept_section, moving_line_filepos, *} \
722 . 0, NULL, 0, \
723 . \
724 . {* target_index, used_by_bfd, constructor_chain, owner, *} \
725 . 0, NULL, NULL, NULL, \
726 . \
727 . {* symbol, symbol_ptr_ptr, *} \
728 . (struct bfd_symbol *) SYM, &SEC.symbol, \
729 . \
730 . {* map_head, map_tail, already_assigned, type *} \
731 . { NULL }, { NULL }, NULL, 0 \
732 . \
733 . }
734 .
735 .{* We use a macro to initialize the static asymbol structures because
736 . traditional C does not permit us to initialize a union member while
737 . gcc warns if we don't initialize it.
738 . the_bfd, name, value, attr, section [, udata] *}
739 .#ifdef __STDC__
740 .#define GLOBAL_SYM_INIT(NAME, SECTION) \
741 . { 0, NAME, 0, BSF_SECTION_SYM, SECTION, { 0 }}
742 .#else
743 .#define GLOBAL_SYM_INIT(NAME, SECTION) \
744 . { 0, NAME, 0, BSF_SECTION_SYM, SECTION }
745 .#endif
746 .
747 */
748
749 /* These symbols are global, not specific to any BFD. Therefore, anything
750 that tries to change them is broken, and should be repaired. */
751
752 static const asymbol global_syms[] =
753 {
754 GLOBAL_SYM_INIT (BFD_COM_SECTION_NAME, bfd_com_section_ptr),
755 GLOBAL_SYM_INIT (BFD_UND_SECTION_NAME, bfd_und_section_ptr),
756 GLOBAL_SYM_INIT (BFD_ABS_SECTION_NAME, bfd_abs_section_ptr),
757 GLOBAL_SYM_INIT (BFD_IND_SECTION_NAME, bfd_ind_section_ptr)
758 };
759
760 #define STD_SECTION(NAME, IDX, FLAGS) \
761 BFD_FAKE_SECTION(_bfd_std_section[IDX], &global_syms[IDX], NAME, IDX, FLAGS)
762
763 asection _bfd_std_section[] = {
764 STD_SECTION (BFD_COM_SECTION_NAME, 0, SEC_IS_COMMON),
765 STD_SECTION (BFD_UND_SECTION_NAME, 1, 0),
766 STD_SECTION (BFD_ABS_SECTION_NAME, 2, 0),
767 STD_SECTION (BFD_IND_SECTION_NAME, 3, 0)
768 };
769 #undef STD_SECTION
770
771 /* Initialize an entry in the section hash table. */
772
773 struct bfd_hash_entry *
774 bfd_section_hash_newfunc (struct bfd_hash_entry *entry,
775 struct bfd_hash_table *table,
776 const char *string)
777 {
778 /* Allocate the structure if it has not already been allocated by a
779 subclass. */
780 if (entry == NULL)
781 {
782 entry = (struct bfd_hash_entry *)
783 bfd_hash_allocate (table, sizeof (struct section_hash_entry));
784 if (entry == NULL)
785 return entry;
786 }
787
788 /* Call the allocation method of the superclass. */
789 entry = bfd_hash_newfunc (entry, table, string);
790 if (entry != NULL)
791 memset (&((struct section_hash_entry *) entry)->section, 0,
792 sizeof (asection));
793
794 return entry;
795 }
796
797 #define section_hash_lookup(table, string, create, copy) \
798 ((struct section_hash_entry *) \
799 bfd_hash_lookup ((table), (string), (create), (copy)))
800
801 /* Create a symbol whose only job is to point to this section. This
802 is useful for things like relocs which are relative to the base
803 of a section. */
804
805 bool
806 _bfd_generic_new_section_hook (bfd *abfd, asection *newsect)
807 {
808 newsect->symbol = bfd_make_empty_symbol (abfd);
809 if (newsect->symbol == NULL)
810 return false;
811
812 newsect->symbol->name = newsect->name;
813 newsect->symbol->value = 0;
814 newsect->symbol->section = newsect;
815 newsect->symbol->flags = BSF_SECTION_SYM;
816
817 newsect->symbol_ptr_ptr = &newsect->symbol;
818 return true;
819 }
820
821 unsigned int _bfd_section_id = 0x10; /* id 0 to 3 used by STD_SECTION. */
822
823 /* Initializes a new section. NEWSECT->NAME is already set. */
824
825 static asection *
826 bfd_section_init (bfd *abfd, asection *newsect)
827 {
828 newsect->id = _bfd_section_id;
829 newsect->index = abfd->section_count;
830 newsect->owner = abfd;
831
832 if (! BFD_SEND (abfd, _new_section_hook, (abfd, newsect)))
833 return NULL;
834
835 _bfd_section_id++;
836 abfd->section_count++;
837 bfd_section_list_append (abfd, newsect);
838 return newsect;
839 }
840
841 /*
842 DOCDD
843 INODE
844 section prototypes, , typedef asection, Sections
845 SUBSECTION
846 Section prototypes
847
848 These are the functions exported by the section handling part of BFD.
849 */
850
851 /*
852 FUNCTION
853 bfd_section_list_clear
854
855 SYNOPSIS
856 void bfd_section_list_clear (bfd *);
857
858 DESCRIPTION
859 Clears the section list, and also resets the section count and
860 hash table entries.
861 */
862
863 void
864 bfd_section_list_clear (bfd *abfd)
865 {
866 abfd->sections = NULL;
867 abfd->section_last = NULL;
868 abfd->section_count = 0;
869 memset (abfd->section_htab.table, 0,
870 abfd->section_htab.size * sizeof (struct bfd_hash_entry *));
871 abfd->section_htab.count = 0;
872 }
873
874 /*
875 FUNCTION
876 bfd_get_section_by_name
877
878 SYNOPSIS
879 asection *bfd_get_section_by_name (bfd *abfd, const char *name);
880
881 DESCRIPTION
882 Return the most recently created section attached to @var{abfd}
883 named @var{name}. Return NULL if no such section exists.
884 */
885
886 asection *
887 bfd_get_section_by_name (bfd *abfd, const char *name)
888 {
889 struct section_hash_entry *sh;
890
891 if (name == NULL)
892 return NULL;
893
894 sh = section_hash_lookup (&abfd->section_htab, name, false, false);
895 if (sh != NULL)
896 return &sh->section;
897
898 return NULL;
899 }
900
901 /*
902 FUNCTION
903 bfd_get_next_section_by_name
904
905 SYNOPSIS
906 asection *bfd_get_next_section_by_name (bfd *ibfd, asection *sec);
907
908 DESCRIPTION
909 Given @var{sec} is a section returned by @code{bfd_get_section_by_name},
910 return the next most recently created section attached to the same
911 BFD with the same name, or if no such section exists in the same BFD and
912 IBFD is non-NULL, the next section with the same name in any input
913 BFD following IBFD. Return NULL on finding no section.
914 */
915
916 asection *
917 bfd_get_next_section_by_name (bfd *ibfd, asection *sec)
918 {
919 struct section_hash_entry *sh;
920 const char *name;
921 unsigned long hash;
922
923 sh = ((struct section_hash_entry *)
924 ((char *) sec - offsetof (struct section_hash_entry, section)));
925
926 hash = sh->root.hash;
927 name = sec->name;
928 for (sh = (struct section_hash_entry *) sh->root.next;
929 sh != NULL;
930 sh = (struct section_hash_entry *) sh->root.next)
931 if (sh->root.hash == hash
932 && strcmp (sh->root.string, name) == 0)
933 return &sh->section;
934
935 if (ibfd != NULL)
936 {
937 while ((ibfd = ibfd->link.next) != NULL)
938 {
939 asection *s = bfd_get_section_by_name (ibfd, name);
940 if (s != NULL)
941 return s;
942 }
943 }
944
945 return NULL;
946 }
947
948 /*
949 FUNCTION
950 bfd_get_linker_section
951
952 SYNOPSIS
953 asection *bfd_get_linker_section (bfd *abfd, const char *name);
954
955 DESCRIPTION
956 Return the linker created section attached to @var{abfd}
957 named @var{name}. Return NULL if no such section exists.
958 */
959
960 asection *
961 bfd_get_linker_section (bfd *abfd, const char *name)
962 {
963 asection *sec = bfd_get_section_by_name (abfd, name);
964
965 while (sec != NULL && (sec->flags & SEC_LINKER_CREATED) == 0)
966 sec = bfd_get_next_section_by_name (NULL, sec);
967 return sec;
968 }
969
970 /*
971 FUNCTION
972 bfd_get_section_by_name_if
973
974 SYNOPSIS
975 asection *bfd_get_section_by_name_if
976 (bfd *abfd,
977 const char *name,
978 bool (*func) (bfd *abfd, asection *sect, void *obj),
979 void *obj);
980
981 DESCRIPTION
982 Call the provided function @var{func} for each section
983 attached to the BFD @var{abfd} whose name matches @var{name},
984 passing @var{obj} as an argument. The function will be called
985 as if by
986
987 | func (abfd, the_section, obj);
988
989 It returns the first section for which @var{func} returns true,
990 otherwise <<NULL>>.
991
992 */
993
994 asection *
995 bfd_get_section_by_name_if (bfd *abfd, const char *name,
996 bool (*operation) (bfd *, asection *, void *),
997 void *user_storage)
998 {
999 struct section_hash_entry *sh;
1000 unsigned long hash;
1001
1002 if (name == NULL)
1003 return NULL;
1004
1005 sh = section_hash_lookup (&abfd->section_htab, name, false, false);
1006 if (sh == NULL)
1007 return NULL;
1008
1009 hash = sh->root.hash;
1010 for (; sh != NULL; sh = (struct section_hash_entry *) sh->root.next)
1011 if (sh->root.hash == hash
1012 && strcmp (sh->root.string, name) == 0
1013 && (*operation) (abfd, &sh->section, user_storage))
1014 return &sh->section;
1015
1016 return NULL;
1017 }
1018
1019 /*
1020 FUNCTION
1021 bfd_get_unique_section_name
1022
1023 SYNOPSIS
1024 char *bfd_get_unique_section_name
1025 (bfd *abfd, const char *templat, int *count);
1026
1027 DESCRIPTION
1028 Invent a section name that is unique in @var{abfd} by tacking
1029 a dot and a digit suffix onto the original @var{templat}. If
1030 @var{count} is non-NULL, then it specifies the first number
1031 tried as a suffix to generate a unique name. The value
1032 pointed to by @var{count} will be incremented in this case.
1033 */
1034
1035 char *
1036 bfd_get_unique_section_name (bfd *abfd, const char *templat, int *count)
1037 {
1038 int num;
1039 unsigned int len;
1040 char *sname;
1041
1042 len = strlen (templat);
1043 sname = (char *) bfd_malloc (len + 8);
1044 if (sname == NULL)
1045 return NULL;
1046 memcpy (sname, templat, len);
1047 num = 1;
1048 if (count != NULL)
1049 num = *count;
1050
1051 do
1052 {
1053 /* If we have a million sections, something is badly wrong. */
1054 if (num > 999999)
1055 abort ();
1056 sprintf (sname + len, ".%d", num++);
1057 }
1058 while (section_hash_lookup (&abfd->section_htab, sname, false, false));
1059
1060 if (count != NULL)
1061 *count = num;
1062 return sname;
1063 }
1064
1065 /*
1066 FUNCTION
1067 bfd_make_section_old_way
1068
1069 SYNOPSIS
1070 asection *bfd_make_section_old_way (bfd *abfd, const char *name);
1071
1072 DESCRIPTION
1073 Create a new empty section called @var{name}
1074 and attach it to the end of the chain of sections for the
1075 BFD @var{abfd}. An attempt to create a section with a name which
1076 is already in use returns its pointer without changing the
1077 section chain.
1078
1079 It has the funny name since this is the way it used to be
1080 before it was rewritten....
1081
1082 Possible errors are:
1083 o <<bfd_error_invalid_operation>> -
1084 If output has already started for this BFD.
1085 o <<bfd_error_no_memory>> -
1086 If memory allocation fails.
1087
1088 */
1089
1090 asection *
1091 bfd_make_section_old_way (bfd *abfd, const char *name)
1092 {
1093 asection *newsect;
1094
1095 if (abfd->output_has_begun)
1096 {
1097 bfd_set_error (bfd_error_invalid_operation);
1098 return NULL;
1099 }
1100
1101 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0)
1102 newsect = bfd_abs_section_ptr;
1103 else if (strcmp (name, BFD_COM_SECTION_NAME) == 0)
1104 newsect = bfd_com_section_ptr;
1105 else if (strcmp (name, BFD_UND_SECTION_NAME) == 0)
1106 newsect = bfd_und_section_ptr;
1107 else if (strcmp (name, BFD_IND_SECTION_NAME) == 0)
1108 newsect = bfd_ind_section_ptr;
1109 else
1110 {
1111 struct section_hash_entry *sh;
1112
1113 sh = section_hash_lookup (&abfd->section_htab, name, true, false);
1114 if (sh == NULL)
1115 return NULL;
1116
1117 newsect = &sh->section;
1118 if (newsect->name != NULL)
1119 {
1120 /* Section already exists. */
1121 return newsect;
1122 }
1123
1124 newsect->name = name;
1125 return bfd_section_init (abfd, newsect);
1126 }
1127
1128 /* Call new_section_hook when "creating" the standard abs, com, und
1129 and ind sections to tack on format specific section data.
1130 Also, create a proper section symbol. */
1131 if (! BFD_SEND (abfd, _new_section_hook, (abfd, newsect)))
1132 return NULL;
1133 return newsect;
1134 }
1135
1136 /*
1137 FUNCTION
1138 bfd_make_section_anyway_with_flags
1139
1140 SYNOPSIS
1141 asection *bfd_make_section_anyway_with_flags
1142 (bfd *abfd, const char *name, flagword flags);
1143
1144 DESCRIPTION
1145 Create a new empty section called @var{name} and attach it to the end of
1146 the chain of sections for @var{abfd}. Create a new section even if there
1147 is already a section with that name. Also set the attributes of the
1148 new section to the value @var{flags}.
1149
1150 Return <<NULL>> and set <<bfd_error>> on error; possible errors are:
1151 o <<bfd_error_invalid_operation>> - If output has already started for @var{abfd}.
1152 o <<bfd_error_no_memory>> - If memory allocation fails.
1153 */
1154
1155 sec_ptr
1156 bfd_make_section_anyway_with_flags (bfd *abfd, const char *name,
1157 flagword flags)
1158 {
1159 struct section_hash_entry *sh;
1160 asection *newsect;
1161
1162 if (abfd->output_has_begun)
1163 {
1164 bfd_set_error (bfd_error_invalid_operation);
1165 return NULL;
1166 }
1167
1168 sh = section_hash_lookup (&abfd->section_htab, name, true, false);
1169 if (sh == NULL)
1170 return NULL;
1171
1172 newsect = &sh->section;
1173 if (newsect->name != NULL)
1174 {
1175 /* We are making a section of the same name. Put it in the
1176 section hash table. Even though we can't find it directly by a
1177 hash lookup, we'll be able to find the section by traversing
1178 sh->root.next quicker than looking at all the bfd sections. */
1179 struct section_hash_entry *new_sh;
1180 new_sh = (struct section_hash_entry *)
1181 bfd_section_hash_newfunc (NULL, &abfd->section_htab, name);
1182 if (new_sh == NULL)
1183 return NULL;
1184
1185 new_sh->root = sh->root;
1186 sh->root.next = &new_sh->root;
1187 newsect = &new_sh->section;
1188 }
1189
1190 newsect->flags = flags;
1191 newsect->name = name;
1192 return bfd_section_init (abfd, newsect);
1193 }
1194
1195 /*
1196 FUNCTION
1197 bfd_make_section_anyway
1198
1199 SYNOPSIS
1200 asection *bfd_make_section_anyway (bfd *abfd, const char *name);
1201
1202 DESCRIPTION
1203 Create a new empty section called @var{name} and attach it to the end of
1204 the chain of sections for @var{abfd}. Create a new section even if there
1205 is already a section with that name.
1206
1207 Return <<NULL>> and set <<bfd_error>> on error; possible errors are:
1208 o <<bfd_error_invalid_operation>> - If output has already started for @var{abfd}.
1209 o <<bfd_error_no_memory>> - If memory allocation fails.
1210 */
1211
1212 sec_ptr
1213 bfd_make_section_anyway (bfd *abfd, const char *name)
1214 {
1215 return bfd_make_section_anyway_with_flags (abfd, name, 0);
1216 }
1217
1218 /*
1219 FUNCTION
1220 bfd_make_section_with_flags
1221
1222 SYNOPSIS
1223 asection *bfd_make_section_with_flags
1224 (bfd *, const char *name, flagword flags);
1225
1226 DESCRIPTION
1227 Like <<bfd_make_section_anyway>>, but return <<NULL>> (without calling
1228 bfd_set_error ()) without changing the section chain if there is already a
1229 section named @var{name}. Also set the attributes of the new section to
1230 the value @var{flags}. If there is an error, return <<NULL>> and set
1231 <<bfd_error>>.
1232 */
1233
1234 asection *
1235 bfd_make_section_with_flags (bfd *abfd, const char *name,
1236 flagword flags)
1237 {
1238 struct section_hash_entry *sh;
1239 asection *newsect;
1240
1241 if (abfd == NULL || name == NULL || abfd->output_has_begun)
1242 {
1243 bfd_set_error (bfd_error_invalid_operation);
1244 return NULL;
1245 }
1246
1247 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0
1248 || strcmp (name, BFD_COM_SECTION_NAME) == 0
1249 || strcmp (name, BFD_UND_SECTION_NAME) == 0
1250 || strcmp (name, BFD_IND_SECTION_NAME) == 0)
1251 return NULL;
1252
1253 sh = section_hash_lookup (&abfd->section_htab, name, true, false);
1254 if (sh == NULL)
1255 return NULL;
1256
1257 newsect = &sh->section;
1258 if (newsect->name != NULL)
1259 {
1260 /* Section already exists. */
1261 return NULL;
1262 }
1263
1264 newsect->name = name;
1265 newsect->flags = flags;
1266 return bfd_section_init (abfd, newsect);
1267 }
1268
1269 /*
1270 FUNCTION
1271 bfd_make_section
1272
1273 SYNOPSIS
1274 asection *bfd_make_section (bfd *, const char *name);
1275
1276 DESCRIPTION
1277 Like <<bfd_make_section_anyway>>, but return <<NULL>> (without calling
1278 bfd_set_error ()) without changing the section chain if there is already a
1279 section named @var{name}. If there is an error, return <<NULL>> and set
1280 <<bfd_error>>.
1281 */
1282
1283 asection *
1284 bfd_make_section (bfd *abfd, const char *name)
1285 {
1286 return bfd_make_section_with_flags (abfd, name, 0);
1287 }
1288
1289 /*
1290 FUNCTION
1291 bfd_set_section_flags
1292
1293 SYNOPSIS
1294 bool bfd_set_section_flags (asection *sec, flagword flags);
1295
1296 DESCRIPTION
1297 Set the attributes of the section @var{sec} to the value @var{flags}.
1298 Return <<TRUE>> on success, <<FALSE>> on error. Possible error
1299 returns are:
1300
1301 o <<bfd_error_invalid_operation>> -
1302 The section cannot have one or more of the attributes
1303 requested. For example, a .bss section in <<a.out>> may not
1304 have the <<SEC_HAS_CONTENTS>> field set.
1305
1306 */
1307
1308 bool
1309 bfd_set_section_flags (asection *section, flagword flags)
1310 {
1311 section->flags = flags;
1312 return true;
1313 }
1314
1315 /*
1316 FUNCTION
1317 bfd_rename_section
1318
1319 SYNOPSIS
1320 void bfd_rename_section
1321 (asection *sec, const char *newname);
1322
1323 DESCRIPTION
1324 Rename section @var{sec} to @var{newname}.
1325 */
1326
1327 void
1328 bfd_rename_section (asection *sec, const char *newname)
1329 {
1330 struct section_hash_entry *sh;
1331
1332 sh = (struct section_hash_entry *)
1333 ((char *) sec - offsetof (struct section_hash_entry, section));
1334 sh->section.name = newname;
1335 bfd_hash_rename (&sec->owner->section_htab, newname, &sh->root);
1336 }
1337
1338 /*
1339 FUNCTION
1340 bfd_map_over_sections
1341
1342 SYNOPSIS
1343 void bfd_map_over_sections
1344 (bfd *abfd,
1345 void (*func) (bfd *abfd, asection *sect, void *obj),
1346 void *obj);
1347
1348 DESCRIPTION
1349 Call the provided function @var{func} for each section
1350 attached to the BFD @var{abfd}, passing @var{obj} as an
1351 argument. The function will be called as if by
1352
1353 | func (abfd, the_section, obj);
1354
1355 This is the preferred method for iterating over sections; an
1356 alternative would be to use a loop:
1357
1358 | asection *p;
1359 | for (p = abfd->sections; p != NULL; p = p->next)
1360 | func (abfd, p, ...)
1361
1362 */
1363
1364 void
1365 bfd_map_over_sections (bfd *abfd,
1366 void (*operation) (bfd *, asection *, void *),
1367 void *user_storage)
1368 {
1369 asection *sect;
1370 unsigned int i = 0;
1371
1372 for (sect = abfd->sections; sect != NULL; i++, sect = sect->next)
1373 (*operation) (abfd, sect, user_storage);
1374
1375 if (i != abfd->section_count) /* Debugging */
1376 abort ();
1377 }
1378
1379 /*
1380 FUNCTION
1381 bfd_sections_find_if
1382
1383 SYNOPSIS
1384 asection *bfd_sections_find_if
1385 (bfd *abfd,
1386 bool (*operation) (bfd *abfd, asection *sect, void *obj),
1387 void *obj);
1388
1389 DESCRIPTION
1390 Call the provided function @var{operation} for each section
1391 attached to the BFD @var{abfd}, passing @var{obj} as an
1392 argument. The function will be called as if by
1393
1394 | operation (abfd, the_section, obj);
1395
1396 It returns the first section for which @var{operation} returns true.
1397
1398 */
1399
1400 asection *
1401 bfd_sections_find_if (bfd *abfd,
1402 bool (*operation) (bfd *, asection *, void *),
1403 void *user_storage)
1404 {
1405 asection *sect;
1406
1407 for (sect = abfd->sections; sect != NULL; sect = sect->next)
1408 if ((*operation) (abfd, sect, user_storage))
1409 break;
1410
1411 return sect;
1412 }
1413
1414 /*
1415 FUNCTION
1416 bfd_set_section_size
1417
1418 SYNOPSIS
1419 bool bfd_set_section_size (asection *sec, bfd_size_type val);
1420
1421 DESCRIPTION
1422 Set @var{sec} to the size @var{val}. If the operation is
1423 ok, then <<TRUE>> is returned, else <<FALSE>>.
1424
1425 Possible error returns:
1426 o <<bfd_error_invalid_operation>> -
1427 Writing has started to the BFD, so setting the size is invalid.
1428
1429 */
1430
1431 bool
1432 bfd_set_section_size (asection *sec, bfd_size_type val)
1433 {
1434 /* Once you've started writing to any section you cannot create or change
1435 the size of any others. */
1436
1437 if (sec->owner == NULL || sec->owner->output_has_begun)
1438 {
1439 bfd_set_error (bfd_error_invalid_operation);
1440 return false;
1441 }
1442
1443 sec->size = val;
1444 return true;
1445 }
1446
1447 /*
1448 FUNCTION
1449 bfd_set_section_contents
1450
1451 SYNOPSIS
1452 bool bfd_set_section_contents
1453 (bfd *abfd, asection *section, const void *data,
1454 file_ptr offset, bfd_size_type count);
1455
1456 DESCRIPTION
1457 Sets the contents of the section @var{section} in BFD
1458 @var{abfd} to the data starting in memory at @var{location}.
1459 The data is written to the output section starting at offset
1460 @var{offset} for @var{count} octets.
1461
1462 Normally <<TRUE>> is returned, but <<FALSE>> is returned if
1463 there was an error. Possible error returns are:
1464 o <<bfd_error_no_contents>> -
1465 The output section does not have the <<SEC_HAS_CONTENTS>>
1466 attribute, so nothing can be written to it.
1467 o <<bfd_error_bad_value>> -
1468 The section is unable to contain all of the data.
1469 o <<bfd_error_invalid_operation>> -
1470 The BFD is not writeable.
1471 o and some more too.
1472
1473 This routine is front end to the back end function
1474 <<_bfd_set_section_contents>>.
1475
1476 */
1477
1478 bool
1479 bfd_set_section_contents (bfd *abfd,
1480 sec_ptr section,
1481 const void *location,
1482 file_ptr offset,
1483 bfd_size_type count)
1484 {
1485 bfd_size_type sz;
1486
1487 if (!(bfd_section_flags (section) & SEC_HAS_CONTENTS))
1488 {
1489 bfd_set_error (bfd_error_no_contents);
1490 return false;
1491 }
1492
1493 sz = section->size;
1494 if ((bfd_size_type) offset > sz
1495 || count > sz - offset
1496 || count != (size_t) count)
1497 {
1498 bfd_set_error (bfd_error_bad_value);
1499 return false;
1500 }
1501
1502 if (!bfd_write_p (abfd))
1503 {
1504 bfd_set_error (bfd_error_invalid_operation);
1505 return false;
1506 }
1507
1508 /* Record a copy of the data in memory if desired. */
1509 if (section->contents
1510 && location != section->contents + offset)
1511 memcpy (section->contents + offset, location, (size_t) count);
1512
1513 if (BFD_SEND (abfd, _bfd_set_section_contents,
1514 (abfd, section, location, offset, count)))
1515 {
1516 abfd->output_has_begun = true;
1517 return true;
1518 }
1519
1520 return false;
1521 }
1522
1523 /*
1524 FUNCTION
1525 bfd_get_section_contents
1526
1527 SYNOPSIS
1528 bool bfd_get_section_contents
1529 (bfd *abfd, asection *section, void *location, file_ptr offset,
1530 bfd_size_type count);
1531
1532 DESCRIPTION
1533 Read data from @var{section} in BFD @var{abfd}
1534 into memory starting at @var{location}. The data is read at an
1535 offset of @var{offset} from the start of the input section,
1536 and is read for @var{count} bytes.
1537
1538 If the contents of a constructor with the <<SEC_CONSTRUCTOR>>
1539 flag set are requested or if the section does not have the
1540 <<SEC_HAS_CONTENTS>> flag set, then the @var{location} is filled
1541 with zeroes. If no errors occur, <<TRUE>> is returned, else
1542 <<FALSE>>.
1543
1544 */
1545 bool
1546 bfd_get_section_contents (bfd *abfd,
1547 sec_ptr section,
1548 void *location,
1549 file_ptr offset,
1550 bfd_size_type count)
1551 {
1552 bfd_size_type sz;
1553
1554 if (section->flags & SEC_CONSTRUCTOR)
1555 {
1556 memset (location, 0, (size_t) count);
1557 return true;
1558 }
1559
1560 if (abfd->direction != write_direction && section->rawsize != 0)
1561 sz = section->rawsize;
1562 else
1563 sz = section->size;
1564 if ((bfd_size_type) offset > sz
1565 || count > sz - offset
1566 || count != (size_t) count)
1567 {
1568 bfd_set_error (bfd_error_bad_value);
1569 return false;
1570 }
1571
1572 if (count == 0)
1573 /* Don't bother. */
1574 return true;
1575
1576 if ((section->flags & SEC_HAS_CONTENTS) == 0)
1577 {
1578 memset (location, 0, (size_t) count);
1579 return true;
1580 }
1581
1582 if ((section->flags & SEC_IN_MEMORY) != 0)
1583 {
1584 if (section->contents == NULL)
1585 {
1586 /* This can happen because of errors earlier on in the linking process.
1587 We do not want to seg-fault here, so clear the flag and return an
1588 error code. */
1589 section->flags &= ~ SEC_IN_MEMORY;
1590 bfd_set_error (bfd_error_invalid_operation);
1591 return false;
1592 }
1593
1594 memmove (location, section->contents + offset, (size_t) count);
1595 return true;
1596 }
1597
1598 return BFD_SEND (abfd, _bfd_get_section_contents,
1599 (abfd, section, location, offset, count));
1600 }
1601
1602 /*
1603 FUNCTION
1604 bfd_malloc_and_get_section
1605
1606 SYNOPSIS
1607 bool bfd_malloc_and_get_section
1608 (bfd *abfd, asection *section, bfd_byte **buf);
1609
1610 DESCRIPTION
1611 Read all data from @var{section} in BFD @var{abfd}
1612 into a buffer, *@var{buf}, malloc'd by this function.
1613 */
1614
1615 bool
1616 bfd_malloc_and_get_section (bfd *abfd, sec_ptr sec, bfd_byte **buf)
1617 {
1618 *buf = NULL;
1619 return bfd_get_full_section_contents (abfd, sec, buf);
1620 }
1621 /*
1622 FUNCTION
1623 bfd_copy_private_section_data
1624
1625 SYNOPSIS
1626 bool bfd_copy_private_section_data
1627 (bfd *ibfd, asection *isec, bfd *obfd, asection *osec);
1628
1629 DESCRIPTION
1630 Copy private section information from @var{isec} in the BFD
1631 @var{ibfd} to the section @var{osec} in the BFD @var{obfd}.
1632 Return <<TRUE>> on success, <<FALSE>> on error. Possible error
1633 returns are:
1634
1635 o <<bfd_error_no_memory>> -
1636 Not enough memory exists to create private data for @var{osec}.
1637
1638 .#define bfd_copy_private_section_data(ibfd, isection, obfd, osection) \
1639 . BFD_SEND (obfd, _bfd_copy_private_section_data, \
1640 . (ibfd, isection, obfd, osection))
1641 */
1642
1643 /*
1644 FUNCTION
1645 bfd_generic_is_group_section
1646
1647 SYNOPSIS
1648 bool bfd_generic_is_group_section (bfd *, const asection *sec);
1649
1650 DESCRIPTION
1651 Returns TRUE if @var{sec} is a member of a group.
1652 */
1653
1654 bool
1655 bfd_generic_is_group_section (bfd *abfd ATTRIBUTE_UNUSED,
1656 const asection *sec ATTRIBUTE_UNUSED)
1657 {
1658 return false;
1659 }
1660
1661 /*
1662 FUNCTION
1663 bfd_generic_group_name
1664
1665 SYNOPSIS
1666 const char *bfd_generic_group_name (bfd *, const asection *sec);
1667
1668 DESCRIPTION
1669 Returns group name if @var{sec} is a member of a group.
1670 */
1671
1672 const char *
1673 bfd_generic_group_name (bfd *abfd ATTRIBUTE_UNUSED,
1674 const asection *sec ATTRIBUTE_UNUSED)
1675 {
1676 return NULL;
1677 }
1678
1679 /*
1680 FUNCTION
1681 bfd_generic_discard_group
1682
1683 SYNOPSIS
1684 bool bfd_generic_discard_group (bfd *abfd, asection *group);
1685
1686 DESCRIPTION
1687 Remove all members of @var{group} from the output.
1688 */
1689
1690 bool
1691 bfd_generic_discard_group (bfd *abfd ATTRIBUTE_UNUSED,
1692 asection *group ATTRIBUTE_UNUSED)
1693 {
1694 return true;
1695 }
1696
1697 bool
1698 _bfd_nowrite_set_section_contents (bfd *abfd,
1699 sec_ptr section ATTRIBUTE_UNUSED,
1700 const void *location ATTRIBUTE_UNUSED,
1701 file_ptr offset ATTRIBUTE_UNUSED,
1702 bfd_size_type count ATTRIBUTE_UNUSED)
1703 {
1704 return _bfd_bool_bfd_false_error (abfd);
1705 }