Coverage Report

Created: 2023-08-28 06:31

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