Coverage Report

Created: 2026-03-10 08:46

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