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