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