Move the symbol-file-from-memory functions into their own file.
[deliverable/binutils-gdb.git] / bfd / section.c
CommitLineData
252b5132 1/* Object file "section" support for the BFD library.
7898deda 2 Copyright 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
72adc230 3 2000, 2001, 2002, 2003, 2004
252b5132
RH
4 Free Software Foundation, Inc.
5 Written by Cygnus Support.
6
7This file is part of BFD, the Binary File Descriptor library.
8
9This program is free software; you can redistribute it and/or modify
10it under the terms of the GNU General Public License as published by
11the Free Software Foundation; either version 2 of the License, or
12(at your option) any later version.
13
14This program is distributed in the hope that it will be useful,
15but WITHOUT ANY WARRANTY; without even the implied warranty of
16MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17GNU General Public License for more details.
18
19You should have received a copy of the GNU General Public License
20along with this program; if not, write to the Free Software
21Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
22
23/*
24SECTION
25 Sections
26
27 The raw data contained within a BFD is maintained through the
28 section abstraction. A single BFD may have any number of
29 sections. It keeps hold of them by pointing to the first;
30 each one points to the next in the list.
31
32 Sections are supported in BFD in <<section.c>>.
33
34@menu
35@* Section Input::
36@* Section Output::
37@* typedef asection::
38@* section prototypes::
39@end menu
40
41INODE
42Section Input, Section Output, Sections, Sections
43SUBSECTION
44 Section input
45
46 When a BFD is opened for reading, the section structures are
47 created and attached to the BFD.
48
49 Each section has a name which describes the section in the
50 outside world---for example, <<a.out>> would contain at least
51 three sections, called <<.text>>, <<.data>> and <<.bss>>.
52
53 Names need not be unique; for example a COFF file may have several
54 sections named <<.data>>.
55
56 Sometimes a BFD will contain more than the ``natural'' number of
57 sections. A back end may attach other sections containing
58 constructor data, or an application may add a section (using
59 <<bfd_make_section>>) to the sections attached to an already open
60 BFD. For example, the linker creates an extra section
61 <<COMMON>> for each input file's BFD to hold information about
62 common storage.
63
64 The raw data is not necessarily read in when
65 the section descriptor is created. Some targets may leave the
66 data in place until a <<bfd_get_section_contents>> call is
67 made. Other back ends may read in all the data at once. For
68 example, an S-record file has to be read once to determine the
69 size of the data. An IEEE-695 file doesn't contain raw data in
70 sections, but data and relocation expressions intermixed, so
71 the data area has to be parsed to get out the data and
72 relocations.
73
74INODE
75Section Output, typedef asection, Section Input, Sections
76
77SUBSECTION
78 Section output
79
80 To write a new object style BFD, the various sections to be
81 written have to be created. They are attached to the BFD in
82 the same way as input sections; data is written to the
83 sections using <<bfd_set_section_contents>>.
84
85 Any program that creates or combines sections (e.g., the assembler
86 and linker) must use the <<asection>> fields <<output_section>> and
87 <<output_offset>> to indicate the file sections to which each
88 section must be written. (If the section is being created from
89 scratch, <<output_section>> should probably point to the section
90 itself and <<output_offset>> should probably be zero.)
91
92 The data to be written comes from input sections attached
93 (via <<output_section>> pointers) to
94 the output sections. The output section structure can be
95 considered a filter for the input section: the output section
96 determines the vma of the output data and the name, but the
97 input section determines the offset into the output section of
98 the data to be written.
99
100 E.g., to create a section "O", starting at 0x100, 0x123 long,
101 containing two subsections, "A" at offset 0x0 (i.e., at vma
102 0x100) and "B" at offset 0x20 (i.e., at vma 0x120) the <<asection>>
103 structures would look like:
104
105| section name "A"
106| output_offset 0x00
107| size 0x20
108| output_section -----------> section name "O"
109| | vma 0x100
110| section name "B" | size 0x123
111| output_offset 0x20 |
112| size 0x103 |
113| output_section --------|
114
252b5132
RH
115SUBSECTION
116 Link orders
117
118 The data within a section is stored in a @dfn{link_order}.
119 These are much like the fixups in <<gas>>. The link_order
120 abstraction allows a section to grow and shrink within itself.
121
122 A link_order knows how big it is, and which is the next
123 link_order and where the raw data for it is; it also points to
124 a list of relocations which apply to it.
125
126 The link_order is used by the linker to perform relaxing on
127 final code. The compiler creates code which is as big as
128 necessary to make it work without relaxing, and the user can
129 select whether to relax. Sometimes relaxing takes a lot of
130 time. The linker runs around the relocations to see if any
131 are attached to data which can be shrunk, if so it does it on
132 a link_order by link_order basis.
133
134*/
135
252b5132
RH
136#include "bfd.h"
137#include "sysdep.h"
138#include "libbfd.h"
139#include "bfdlink.h"
140
141/*
142DOCDD
143INODE
144typedef asection, section prototypes, Section Output, Sections
145SUBSECTION
146 typedef asection
147
148 Here is the section structure:
149
150CODE_FRAGMENT
151.
52b219b5
AM
152.{* This structure is used for a comdat section, as in PE. A comdat
153. section is associated with a particular symbol. When the linker
154. sees a comdat section, it keeps only one of the sections with a
155. given name and associated with a given symbol. *}
022a5af4
ILT
156.
157.struct bfd_comdat_info
158.{
159. {* The name of the symbol associated with a comdat section. *}
160. const char *name;
161.
162. {* The local symbol table index of the symbol associated with a
163. comdat section. This is only meaningful to the object file format
164. specific code; it is not an index into the list returned by
165. bfd_canonicalize_symtab. *}
166. long symbol;
022a5af4
ILT
167.};
168.
198beae2 169.typedef struct bfd_section
252b5132 170.{
52b219b5
AM
171. {* The name of the section; the name isn't a copy, the pointer is
172. the same as that passed to bfd_make_section. *}
52b219b5
AM
173. const char *name;
174.
175. {* A unique sequence number. *}
52b219b5 176. int id;
252b5132 177.
dbb410c3 178. {* Which section in the bfd; 0..n-1 as sections are created in a bfd. *}
52b219b5 179. int index;
252b5132 180.
52b219b5 181. {* The next section in the list belonging to the BFD, or NULL. *}
198beae2 182. struct bfd_section *next;
252b5132 183.
52b219b5
AM
184. {* The field flags contains attributes of the section. Some
185. flags are read in from the object file, and some are
186. synthesized from other information. *}
52b219b5 187. flagword flags;
252b5132
RH
188.
189.#define SEC_NO_FLAGS 0x000
190.
52b219b5
AM
191. {* Tells the OS to allocate space for this section when loading.
192. This is clear for a section containing debug information only. *}
252b5132
RH
193.#define SEC_ALLOC 0x001
194.
52b219b5
AM
195. {* Tells the OS to load the section from the file when loading.
196. This is clear for a .bss section. *}
252b5132
RH
197.#define SEC_LOAD 0x002
198.
52b219b5
AM
199. {* The section contains data still to be relocated, so there is
200. some relocation information too. *}
252b5132
RH
201.#define SEC_RELOC 0x004
202.
65db3b0d
RH
203. {* ELF reserves 4 processor specific bits and 8 operating system
204. specific bits in sh_flags; at present we can get away with just
205. one in communicating between the assembler and BFD, but this
206. isn't a good long-term solution. *}
207.#define SEC_ARCH_BIT_0 0x008
252b5132 208.
52b219b5 209. {* A signal to the OS that the section contains read only data. *}
252b5132
RH
210.#define SEC_READONLY 0x010
211.
52b219b5 212. {* The section contains code only. *}
252b5132
RH
213.#define SEC_CODE 0x020
214.
52b219b5 215. {* The section contains data only. *}
252b5132
RH
216.#define SEC_DATA 0x040
217.
52b219b5 218. {* The section will reside in ROM. *}
252b5132
RH
219.#define SEC_ROM 0x080
220.
52b219b5
AM
221. {* The section contains constructor information. This section
222. type is used by the linker to create lists of constructors and
223. destructors used by <<g++>>. When a back end sees a symbol
224. which should be used in a constructor list, it creates a new
225. section for the type of name (e.g., <<__CTOR_LIST__>>), attaches
226. the symbol to it, and builds a relocation. To build the lists
227. of constructors, all the linker has to do is catenate all the
228. sections called <<__CTOR_LIST__>> and relocate the data
229. contained within - exactly the operations it would peform on
230. standard data. *}
252b5132
RH
231.#define SEC_CONSTRUCTOR 0x100
232.
52b219b5
AM
233. {* The section has contents - a data section could be
234. <<SEC_ALLOC>> | <<SEC_HAS_CONTENTS>>; a debug section could be
235. <<SEC_HAS_CONTENTS>> *}
252b5132
RH
236.#define SEC_HAS_CONTENTS 0x200
237.
52b219b5
AM
238. {* An instruction to the linker to not output the section
239. even if it has information which would normally be written. *}
252b5132
RH
240.#define SEC_NEVER_LOAD 0x400
241.
52b219b5
AM
242. {* The section is a COFF shared library section. This flag is
243. only for the linker. If this type of section appears in
244. the input file, the linker must copy it to the output file
245. without changing the vma or size. FIXME: Although this
246. was originally intended to be general, it really is COFF
247. specific (and the flag was renamed to indicate this). It
248. might be cleaner to have some more general mechanism to
249. allow the back end to control what the linker does with
250. sections. *}
252b5132
RH
251.#define SEC_COFF_SHARED_LIBRARY 0x800
252.
13ae64f3
JJ
253. {* The section contains thread local data. *}
254.#define SEC_THREAD_LOCAL 0x1000
255.
1bd91689
AM
256. {* The section has GOT references. This flag is only for the
257. linker, and is currently only used by the elf32-hppa back end.
258. It will be set if global offset table references were detected
259. in this section, which indicate to the linker that the section
260. contains PIC code, and must be handled specially when doing a
261. static link. *}
262.#define SEC_HAS_GOT_REF 0x4000
263.
52b219b5
AM
264. {* The section contains common symbols (symbols may be defined
265. multiple times, the value of a symbol is the amount of
266. space it requires, and the largest symbol value is the one
267. used). Most targets have exactly one of these (which we
268. translate to bfd_com_section_ptr), but ECOFF has two. *}
252b5132
RH
269.#define SEC_IS_COMMON 0x8000
270.
52b219b5
AM
271. {* The section contains only debugging information. For
272. example, this is set for ELF .debug and .stab sections.
273. strip tests this flag to see if a section can be
274. discarded. *}
252b5132
RH
275.#define SEC_DEBUGGING 0x10000
276.
52b219b5
AM
277. {* The contents of this section are held in memory pointed to
278. by the contents field. This is checked by bfd_get_section_contents,
279. and the data is retrieved from memory if appropriate. *}
252b5132
RH
280.#define SEC_IN_MEMORY 0x20000
281.
52b219b5
AM
282. {* The contents of this section are to be excluded by the
283. linker for executable and shared objects unless those
284. objects are to be further relocated. *}
252b5132
RH
285.#define SEC_EXCLUDE 0x40000
286.
dbb410c3
AM
287. {* The contents of this section are to be sorted based on the sum of
288. the symbol and addend values specified by the associated relocation
289. entries. Entries without associated relocation entries will be
290. appended to the end of the section in an unspecified order. *}
252b5132
RH
291.#define SEC_SORT_ENTRIES 0x80000
292.
52b219b5
AM
293. {* When linking, duplicate sections of the same name should be
294. discarded, rather than being combined into a single section as
295. is usually done. This is similar to how common symbols are
296. handled. See SEC_LINK_DUPLICATES below. *}
252b5132
RH
297.#define SEC_LINK_ONCE 0x100000
298.
52b219b5
AM
299. {* If SEC_LINK_ONCE is set, this bitfield describes how the linker
300. should handle duplicate sections. *}
252b5132
RH
301.#define SEC_LINK_DUPLICATES 0x600000
302.
52b219b5
AM
303. {* This value for SEC_LINK_DUPLICATES means that duplicate
304. sections with the same name should simply be discarded. *}
252b5132
RH
305.#define SEC_LINK_DUPLICATES_DISCARD 0x0
306.
52b219b5
AM
307. {* This value for SEC_LINK_DUPLICATES means that the linker
308. should warn if there are any duplicate sections, although
309. it should still only link one copy. *}
252b5132
RH
310.#define SEC_LINK_DUPLICATES_ONE_ONLY 0x200000
311.
52b219b5
AM
312. {* This value for SEC_LINK_DUPLICATES means that the linker
313. should warn if any duplicate sections are a different size. *}
252b5132
RH
314.#define SEC_LINK_DUPLICATES_SAME_SIZE 0x400000
315.
52b219b5
AM
316. {* This value for SEC_LINK_DUPLICATES means that the linker
317. should warn if any duplicate sections contain different
318. contents. *}
252b5132
RH
319.#define SEC_LINK_DUPLICATES_SAME_CONTENTS 0x600000
320.
52b219b5
AM
321. {* This section was created by the linker as part of dynamic
322. relocation or other arcane processing. It is skipped when
323. going through the first-pass output, trusting that someone
324. else up the line will take care of it later. *}
252b5132
RH
325.#define SEC_LINKER_CREATED 0x800000
326.
52b219b5 327. {* This section should not be subject to garbage collection. *}
252b5132
RH
328.#define SEC_KEEP 0x1000000
329.
52b219b5
AM
330. {* This section contains "short" data, and should be placed
331. "near" the GP. *}
851edbaf 332.#define SEC_SMALL_DATA 0x2000000
0c3ff40b 333.
52b219b5
AM
334. {* This section contains data which may be shared with other
335. executables or shared objects. *}
bd826630
ILT
336.#define SEC_SHARED 0x4000000
337.
52b219b5
AM
338. {* When a section with this flag is being linked, then if the size of
339. the input section is less than a page, it should not cross a page
340. boundary. If the size of the input section is one page or more, it
341. should be aligned on a page boundary. *}
34cbe64e
TW
342.#define SEC_BLOCK 0x8000000
343.
52b219b5
AM
344. {* Conditionally link this section; do not link if there are no
345. references found to any symbol in the section. *}
34cbe64e
TW
346.#define SEC_CLINK 0x10000000
347.
2dd439c5
L
348. {* Attempt to merge identical entities in the section.
349. Entity size is given in the entsize field. *}
350.#define SEC_MERGE 0x20000000
351.
352. {* If given with SEC_MERGE, entities to merge are zero terminated
353. strings where entsize specifies character size instead of fixed
354. size entries. *}
355.#define SEC_STRINGS 0x40000000
356.
dbb410c3
AM
357. {* This section contains data about section groups. *}
358.#define SEC_GROUP 0x80000000
359.
52b219b5 360. {* End of section flags. *}
252b5132 361.
52b219b5 362. {* Some internal packed boolean fields. *}
252b5132 363.
52b219b5
AM
364. {* See the vma field. *}
365. unsigned int user_set_vma : 1;
252b5132 366.
52b219b5
AM
367. {* Whether relocations have been processed. *}
368. unsigned int reloc_done : 1;
252b5132 369.
52b219b5
AM
370. {* A mark flag used by some of the linker backends. *}
371. unsigned int linker_mark : 1;
252b5132 372.
d1778b88 373. {* Another mark flag used by some of the linker backends. Set for
08da05b0 374. output sections that have an input section. *}
d1778b88
AM
375. unsigned int linker_has_input : 1;
376.
52b219b5
AM
377. {* A mark flag used by some linker backends for garbage collection. *}
378. unsigned int gc_mark : 1;
252b5132 379.
68bfbfcc
AM
380. {* The following flags are used by the ELF linker. *}
381.
382. {* Mark sections which have been allocated to segments. *}
bc67d8a6
NC
383. unsigned int segment_mark : 1;
384.
68bfbfcc
AM
385. {* Type of sec_info information. *}
386. unsigned int sec_info_type:3;
387.#define ELF_INFO_TYPE_NONE 0
388.#define ELF_INFO_TYPE_STABS 1
389.#define ELF_INFO_TYPE_MERGE 2
390.#define ELF_INFO_TYPE_EH_FRAME 3
391.#define ELF_INFO_TYPE_JUST_SYMS 4
392.
393. {* Nonzero if this section uses RELA relocations, rather than REL. *}
394. unsigned int use_rela_p:1;
395.
396. {* Bits used by various backends. *}
397. unsigned int has_tls_reloc:1;
398.
c7996ad6
L
399. {* Nonzero if this section needs the relax finalize pass. *}
400. unsigned int need_finalize_relax:1;
401.
ad8e1ba5
AM
402. {* Nonzero if this section has a gp reloc. *}
403. unsigned int has_gp_reloc:1;
404.
9c3ed942 405. {* Unused bits. *}
68bfbfcc
AM
406. unsigned int flag13:1;
407. unsigned int flag14:1;
408. unsigned int flag15:1;
409. unsigned int flag16:4;
410. unsigned int flag20:4;
411. unsigned int flag24:8;
412.
52b219b5 413. {* End of internal packed boolean fields. *}
252b5132 414.
52b219b5
AM
415. {* The virtual memory address of the section - where it will be
416. at run time. The symbols are relocated against this. The
417. user_set_vma flag is maintained by bfd; if it's not set, the
418. backend can assign addresses (for example, in <<a.out>>, where
419. the default address for <<.data>> is dependent on the specific
420. target and various flags). *}
52b219b5 421. bfd_vma vma;
252b5132 422.
52b219b5
AM
423. {* The load address of the section - where it would be in a
424. rom image; really only used for writing section header
b5f79c76 425. information. *}
52b219b5 426. bfd_vma lma;
252b5132 427.
52b219b5
AM
428. {* The size of the section in octets, as it will be output.
429. Contains a value even if the section has no contents (e.g., the
430. size of <<.bss>>). This will be filled in after relocation. *}
52b219b5 431. bfd_size_type _cooked_size;
252b5132 432.
52b219b5
AM
433. {* The original size on disk of the section, in octets. Normally this
434. value is the same as the size, but if some relaxing has
435. been done, then this value will be bigger. *}
52b219b5 436. bfd_size_type _raw_size;
252b5132 437.
52b219b5
AM
438. {* If this section is going to be output, then this value is the
439. offset in *bytes* into the output section of the first byte in the
440. input section (byte ==> smallest addressable unit on the
441. target). In most cases, if this was going to start at the
442. 100th octet (8-bit quantity) in the output section, this value
443. would be 100. However, if the target byte size is 16 bits
444. (bfd_octets_per_byte is "2"), this value would be 50. *}
52b219b5 445. bfd_vma output_offset;
252b5132 446.
52b219b5 447. {* The output section through which to map on output. *}
198beae2 448. struct bfd_section *output_section;
252b5132 449.
52b219b5
AM
450. {* The alignment requirement of the section, as an exponent of 2 -
451. e.g., 3 aligns to 2^3 (or 8). *}
52b219b5 452. unsigned int alignment_power;
252b5132 453.
52b219b5
AM
454. {* If an input section, a pointer to a vector of relocation
455. records for the data in this section. *}
52b219b5 456. struct reloc_cache_entry *relocation;
252b5132 457.
52b219b5
AM
458. {* If an output section, a pointer to a vector of pointers to
459. relocation records for the data in this section. *}
52b219b5 460. struct reloc_cache_entry **orelocation;
252b5132 461.
b5f79c76 462. {* The number of relocation records in one of the above. *}
52b219b5 463. unsigned reloc_count;
252b5132 464.
52b219b5
AM
465. {* Information below is back end specific - and not always used
466. or updated. *}
252b5132 467.
52b219b5 468. {* File position of section data. *}
52b219b5 469. file_ptr filepos;
252b5132 470.
52b219b5 471. {* File position of relocation info. *}
52b219b5 472. file_ptr rel_filepos;
252b5132 473.
52b219b5 474. {* File position of line data. *}
52b219b5 475. file_ptr line_filepos;
252b5132 476.
52b219b5 477. {* Pointer to data for applications. *}
c58b9523 478. void *userdata;
252b5132 479.
52b219b5
AM
480. {* If the SEC_IN_MEMORY flag is set, this points to the actual
481. contents. *}
482. unsigned char *contents;
252b5132 483.
52b219b5 484. {* Attached line number information. *}
52b219b5 485. alent *lineno;
252b5132 486.
52b219b5 487. {* Number of line number records. *}
52b219b5 488. unsigned int lineno_count;
252b5132 489.
2dd439c5 490. {* Entity size for merging purposes. *}
2dd439c5
L
491. unsigned int entsize;
492.
52b219b5 493. {* Optional information about a COMDAT entry; NULL if not COMDAT. *}
52b219b5 494. struct bfd_comdat_info *comdat;
022a5af4 495.
f97b9cb8
L
496. {* Points to the kept section if this section is a link-once section,
497. and is discarded. *}
198beae2 498. struct bfd_section *kept_section;
f97b9cb8 499.
52b219b5
AM
500. {* When a section is being output, this value changes as more
501. linenumbers are written out. *}
52b219b5 502. file_ptr moving_line_filepos;
252b5132 503.
52b219b5 504. {* What the section number is in the target world. *}
52b219b5 505. int target_index;
252b5132 506.
c58b9523 507. void *used_by_bfd;
252b5132 508.
52b219b5
AM
509. {* If this is a constructor section then here is a list of the
510. relocations created to relocate items within it. *}
52b219b5 511. struct relent_chain *constructor_chain;
252b5132 512.
52b219b5 513. {* The BFD which owns the section. *}
52b219b5 514. bfd *owner;
252b5132 515.
b5f79c76 516. {* A symbol which points at this section only. *}
fc0a2244
AC
517. struct bfd_symbol *symbol;
518. struct bfd_symbol **symbol_ptr_ptr;
252b5132 519.
52b219b5
AM
520. struct bfd_link_order *link_order_head;
521. struct bfd_link_order *link_order_tail;
b5f79c76 522.} asection;
252b5132 523.
52b219b5
AM
524.{* These sections are global, and are managed by BFD. The application
525. and target back end are not permitted to change the values in
526. these sections. New code should use the section_ptr macros rather
527. than referring directly to the const sections. The const sections
528. may eventually vanish. *}
252b5132
RH
529.#define BFD_ABS_SECTION_NAME "*ABS*"
530.#define BFD_UND_SECTION_NAME "*UND*"
531.#define BFD_COM_SECTION_NAME "*COM*"
532.#define BFD_IND_SECTION_NAME "*IND*"
533.
b5f79c76 534.{* The absolute section. *}
2f89ff8d 535.extern asection bfd_abs_section;
252b5132
RH
536.#define bfd_abs_section_ptr ((asection *) &bfd_abs_section)
537.#define bfd_is_abs_section(sec) ((sec) == bfd_abs_section_ptr)
b5f79c76 538.{* Pointer to the undefined section. *}
2f89ff8d 539.extern asection bfd_und_section;
252b5132
RH
540.#define bfd_und_section_ptr ((asection *) &bfd_und_section)
541.#define bfd_is_und_section(sec) ((sec) == bfd_und_section_ptr)
b5f79c76 542.{* Pointer to the common section. *}
2f89ff8d 543.extern asection bfd_com_section;
252b5132 544.#define bfd_com_section_ptr ((asection *) &bfd_com_section)
b5f79c76 545.{* Pointer to the indirect section. *}
2f89ff8d 546.extern asection bfd_ind_section;
252b5132
RH
547.#define bfd_ind_section_ptr ((asection *) &bfd_ind_section)
548.#define bfd_is_ind_section(sec) ((sec) == bfd_ind_section_ptr)
549.
84c254c6
NC
550.#define bfd_is_const_section(SEC) \
551. ( ((SEC) == bfd_abs_section_ptr) \
552. || ((SEC) == bfd_und_section_ptr) \
553. || ((SEC) == bfd_com_section_ptr) \
554. || ((SEC) == bfd_ind_section_ptr))
555.
fc0a2244
AC
556.extern const struct bfd_symbol * const bfd_abs_symbol;
557.extern const struct bfd_symbol * const bfd_com_symbol;
558.extern const struct bfd_symbol * const bfd_und_symbol;
559.extern const struct bfd_symbol * const bfd_ind_symbol;
252b5132 560.#define bfd_get_section_size_before_reloc(section) \
a7f49d81 561. ((section)->_raw_size)
252b5132 562.#define bfd_get_section_size_after_reloc(section) \
f6af82bd
AM
563. ((section)->reloc_done ? (section)->_cooked_size \
564. : (abort (), (bfd_size_type) 1))
9e7b37b3
AM
565.
566.{* Macros to handle insertion and deletion of a bfd's sections. These
567. only handle the list pointers, ie. do not adjust section_count,
568. target_index etc. *}
569.#define bfd_section_list_remove(ABFD, PS) \
570. do \
571. { \
572. asection **_ps = PS; \
573. asection *_s = *_ps; \
574. *_ps = _s->next; \
575. if (_s->next == NULL) \
576. (ABFD)->section_tail = _ps; \
577. } \
578. while (0)
579.#define bfd_section_list_insert(ABFD, PS, S) \
580. do \
581. { \
582. asection **_ps = PS; \
583. asection *_s = S; \
584. _s->next = *_ps; \
585. *_ps = _s; \
586. if (_s->next == NULL) \
587. (ABFD)->section_tail = &_s->next; \
588. } \
589. while (0)
590.
252b5132
RH
591*/
592
22bc497d
ILT
593/* We use a macro to initialize the static asymbol structures because
594 traditional C does not permit us to initialize a union member while
595 gcc warns if we don't initialize it. */
596 /* the_bfd, name, value, attr, section [, udata] */
597#ifdef __STDC__
598#define GLOBAL_SYM_INIT(NAME, SECTION) \
599 { 0, NAME, 0, BSF_SECTION_SYM, (asection *) SECTION, { 0 }}
600#else
601#define GLOBAL_SYM_INIT(NAME, SECTION) \
602 { 0, NAME, 0, BSF_SECTION_SYM, (asection *) SECTION }
603#endif
604
252b5132
RH
605/* These symbols are global, not specific to any BFD. Therefore, anything
606 that tries to change them is broken, and should be repaired. */
22bc497d 607
252b5132
RH
608static const asymbol global_syms[] =
609{
22bc497d
ILT
610 GLOBAL_SYM_INIT (BFD_COM_SECTION_NAME, &bfd_com_section),
611 GLOBAL_SYM_INIT (BFD_UND_SECTION_NAME, &bfd_und_section),
612 GLOBAL_SYM_INIT (BFD_ABS_SECTION_NAME, &bfd_abs_section),
613 GLOBAL_SYM_INIT (BFD_IND_SECTION_NAME, &bfd_ind_section)
252b5132
RH
614};
615
bc67d8a6
NC
616#define STD_SECTION(SEC, FLAGS, SYM, NAME, IDX) \
617 const asymbol * const SYM = (asymbol *) &global_syms[IDX]; \
2f89ff8d 618 asection SEC = \
3df7b4e2
AM
619 /* name, id, index, next, flags, user_set_vma, reloc_done, */ \
620 { NAME, IDX, 0, NULL, FLAGS, 0, 0, \
52b219b5 621 \
d1778b88
AM
622 /* linker_mark, linker_has_input, gc_mark, segment_mark, */ \
623 0, 0, 1, 0, \
624 \
ad8e1ba5
AM
625 /* sec_info_type, use_rela_p, has_tls_reloc, */ \
626 0, 0, 0, \
627 \
628 /* need_finalize_relax, has_gp_reloc, */ \
629 0, 0, \
68bfbfcc
AM
630 \
631 /* flag13, flag14, flag15, flag16, flag20, flag24, */ \
632 0, 0, 0, 0, 0, 0, \
633 \
d1778b88
AM
634 /* vma, lma, _cooked_size, _raw_size, */ \
635 0, 0, 0, 0, \
52b219b5 636 \
d1778b88 637 /* output_offset, output_section, alignment_power, */ \
198beae2 638 0, (struct bfd_section *) &SEC, 0, \
52b219b5
AM
639 \
640 /* relocation, orelocation, reloc_count, filepos, rel_filepos, */ \
641 NULL, NULL, 0, 0, 0, \
642 \
643 /* line_filepos, userdata, contents, lineno, lineno_count, */ \
644 0, NULL, NULL, NULL, 0, \
645 \
f97b9cb8
L
646 /* entsize, comdat, kept_section, moving_line_filepos, */ \
647 0, NULL, NULL, 0, \
52b219b5 648 \
767e4b0d
JJ
649 /* target_index, used_by_bfd, constructor_chain, owner, */ \
650 0, NULL, NULL, NULL, \
52b219b5
AM
651 \
652 /* symbol, */ \
fc0a2244 653 (struct bfd_symbol *) &global_syms[IDX], \
52b219b5
AM
654 \
655 /* symbol_ptr_ptr, */ \
fc0a2244 656 (struct bfd_symbol **) &SYM, \
52b219b5
AM
657 \
658 /* link_order_head, link_order_tail */ \
659 NULL, NULL \
022a5af4 660 }
252b5132
RH
661
662STD_SECTION (bfd_com_section, SEC_IS_COMMON, bfd_com_symbol,
663 BFD_COM_SECTION_NAME, 0);
664STD_SECTION (bfd_und_section, 0, bfd_und_symbol, BFD_UND_SECTION_NAME, 1);
665STD_SECTION (bfd_abs_section, 0, bfd_abs_symbol, BFD_ABS_SECTION_NAME, 2);
666STD_SECTION (bfd_ind_section, 0, bfd_ind_symbol, BFD_IND_SECTION_NAME, 3);
667#undef STD_SECTION
668
73e87d70
AM
669struct section_hash_entry
670{
671 struct bfd_hash_entry root;
672 asection section;
673};
674
675/* Initialize an entry in the section hash table. */
676
677struct bfd_hash_entry *
c58b9523
AM
678bfd_section_hash_newfunc (struct bfd_hash_entry *entry,
679 struct bfd_hash_table *table,
680 const char *string)
73e87d70
AM
681{
682 /* Allocate the structure if it has not already been allocated by a
683 subclass. */
684 if (entry == NULL)
685 {
d45913a0
DA
686 entry = (struct bfd_hash_entry *)
687 bfd_hash_allocate (table, sizeof (struct section_hash_entry));
73e87d70
AM
688 if (entry == NULL)
689 return entry;
690 }
691
692 /* Call the allocation method of the superclass. */
693 entry = bfd_hash_newfunc (entry, table, string);
694 if (entry != NULL)
c58b9523
AM
695 memset (&((struct section_hash_entry *) entry)->section, 0,
696 sizeof (asection));
73e87d70
AM
697
698 return entry;
699}
700
701#define section_hash_lookup(table, string, create, copy) \
702 ((struct section_hash_entry *) \
703 bfd_hash_lookup ((table), (string), (create), (copy)))
704
705/* Initializes a new section. NEWSECT->NAME is already set. */
706
73e87d70 707static asection *
c58b9523 708bfd_section_init (bfd *abfd, asection *newsect)
73e87d70
AM
709{
710 static int section_id = 0x10; /* id 0 to 3 used by STD_SECTION. */
711
712 newsect->id = section_id;
713 newsect->index = abfd->section_count;
73e87d70 714 newsect->owner = abfd;
73e87d70
AM
715
716 /* Create a symbol whose only job is to point to this section. This
717 is useful for things like relocs which are relative to the base
718 of a section. */
719 newsect->symbol = bfd_make_empty_symbol (abfd);
720 if (newsect->symbol == NULL)
721 return NULL;
722
723 newsect->symbol->name = newsect->name;
724 newsect->symbol->value = 0;
725 newsect->symbol->section = newsect;
726 newsect->symbol->flags = BSF_SECTION_SYM;
727
728 newsect->symbol_ptr_ptr = &newsect->symbol;
729
730 if (! BFD_SEND (abfd, _new_section_hook, (abfd, newsect)))
731 return NULL;
732
733 section_id++;
734 abfd->section_count++;
735 *abfd->section_tail = newsect;
736 abfd->section_tail = &newsect->next;
737 return newsect;
738}
739
252b5132
RH
740/*
741DOCDD
742INODE
743section prototypes, , typedef asection, Sections
744SUBSECTION
745 Section prototypes
746
747These are the functions exported by the section handling part of BFD.
748*/
749
9e7b37b3
AM
750/*
751FUNCTION
752 bfd_section_list_clear
753
754SYNOPSIS
755 void bfd_section_list_clear (bfd *);
756
757DESCRIPTION
758 Clears the section list, and also resets the section count and
759 hash table entries.
760*/
761
762void
c58b9523 763bfd_section_list_clear (bfd *abfd)
9e7b37b3
AM
764{
765 abfd->sections = NULL;
766 abfd->section_tail = &abfd->sections;
767 abfd->section_count = 0;
c58b9523 768 memset (abfd->section_htab.table, 0,
9e7b37b3
AM
769 abfd->section_htab.size * sizeof (struct bfd_hash_entry *));
770}
771
252b5132
RH
772/*
773FUNCTION
774 bfd_get_section_by_name
775
776SYNOPSIS
c58b9523 777 asection *bfd_get_section_by_name (bfd *abfd, const char *name);
252b5132
RH
778
779DESCRIPTION
780 Run through @var{abfd} and return the one of the
781 <<asection>>s whose name matches @var{name}, otherwise <<NULL>>.
782 @xref{Sections}, for more information.
783
784 This should only be used in special cases; the normal way to process
785 all sections of a given name is to use <<bfd_map_over_sections>> and
786 <<strcmp>> on the name (or better yet, base it on the section flags
787 or something else) for each section.
788*/
789
790asection *
c58b9523 791bfd_get_section_by_name (bfd *abfd, const char *name)
252b5132 792{
73e87d70
AM
793 struct section_hash_entry *sh;
794
b34976b6 795 sh = section_hash_lookup (&abfd->section_htab, name, FALSE, FALSE);
73e87d70
AM
796 if (sh != NULL)
797 return &sh->section;
252b5132 798
252b5132
RH
799 return NULL;
800}
801
1bd91689
AM
802/*
803FUNCTION
804 bfd_get_unique_section_name
805
806SYNOPSIS
c58b9523
AM
807 char *bfd_get_unique_section_name
808 (bfd *abfd, const char *templat, int *count);
1bd91689
AM
809
810DESCRIPTION
811 Invent a section name that is unique in @var{abfd} by tacking
77cb06e9
AM
812 a dot and a digit suffix onto the original @var{templat}. If
813 @var{count} is non-NULL, then it specifies the first number
814 tried as a suffix to generate a unique name. The value
815 pointed to by @var{count} will be incremented in this case.
1bd91689
AM
816*/
817
818char *
c58b9523 819bfd_get_unique_section_name (bfd *abfd, const char *templat, int *count)
1bd91689
AM
820{
821 int num;
822 unsigned int len;
823 char *sname;
824
a966dba9 825 len = strlen (templat);
c58b9523 826 sname = bfd_malloc (len + 8);
b3ea3584
AM
827 if (sname == NULL)
828 return NULL;
d4c88bbb 829 memcpy (sname, templat, len);
1bd91689
AM
830 num = 1;
831 if (count != NULL)
832 num = *count;
833
834 do
835 {
836 /* If we have a million sections, something is badly wrong. */
837 if (num > 999999)
838 abort ();
77cb06e9 839 sprintf (sname + len, ".%d", num++);
1bd91689 840 }
b34976b6 841 while (section_hash_lookup (&abfd->section_htab, sname, FALSE, FALSE));
1bd91689
AM
842
843 if (count != NULL)
844 *count = num;
845 return sname;
846}
847
252b5132
RH
848/*
849FUNCTION
850 bfd_make_section_old_way
851
852SYNOPSIS
c58b9523 853 asection *bfd_make_section_old_way (bfd *abfd, const char *name);
252b5132
RH
854
855DESCRIPTION
856 Create a new empty section called @var{name}
857 and attach it to the end of the chain of sections for the
858 BFD @var{abfd}. An attempt to create a section with a name which
859 is already in use returns its pointer without changing the
860 section chain.
861
862 It has the funny name since this is the way it used to be
863 before it was rewritten....
864
865 Possible errors are:
866 o <<bfd_error_invalid_operation>> -
867 If output has already started for this BFD.
868 o <<bfd_error_no_memory>> -
869 If memory allocation fails.
870
871*/
872
252b5132 873asection *
c58b9523 874bfd_make_section_old_way (bfd *abfd, const char *name)
252b5132 875{
73e87d70
AM
876 struct section_hash_entry *sh;
877 asection *newsect;
878
879 if (abfd->output_has_begun)
880 {
881 bfd_set_error (bfd_error_invalid_operation);
882 return NULL;
883 }
884
885 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0)
886 return bfd_abs_section_ptr;
887
888 if (strcmp (name, BFD_COM_SECTION_NAME) == 0)
889 return bfd_com_section_ptr;
890
891 if (strcmp (name, BFD_UND_SECTION_NAME) == 0)
892 return bfd_und_section_ptr;
893
894 if (strcmp (name, BFD_IND_SECTION_NAME) == 0)
895 return bfd_ind_section_ptr;
896
b34976b6 897 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
73e87d70
AM
898 if (sh == NULL)
899 return NULL;
900
901 newsect = &sh->section;
902 if (newsect->name != NULL)
252b5132 903 {
73e87d70
AM
904 /* Section already exists. */
905 return newsect;
252b5132 906 }
73e87d70
AM
907
908 newsect->name = name;
909 return bfd_section_init (abfd, newsect);
252b5132
RH
910}
911
912/*
913FUNCTION
914 bfd_make_section_anyway
915
916SYNOPSIS
c58b9523 917 asection *bfd_make_section_anyway (bfd *abfd, const char *name);
252b5132
RH
918
919DESCRIPTION
920 Create a new empty section called @var{name} and attach it to the end of
921 the chain of sections for @var{abfd}. Create a new section even if there
922 is already a section with that name.
923
924 Return <<NULL>> and set <<bfd_error>> on error; possible errors are:
925 o <<bfd_error_invalid_operation>> - If output has already started for @var{abfd}.
926 o <<bfd_error_no_memory>> - If memory allocation fails.
927*/
928
929sec_ptr
c58b9523 930bfd_make_section_anyway (bfd *abfd, const char *name)
252b5132 931{
73e87d70 932 struct section_hash_entry *sh;
252b5132 933 asection *newsect;
252b5132
RH
934
935 if (abfd->output_has_begun)
936 {
937 bfd_set_error (bfd_error_invalid_operation);
938 return NULL;
939 }
940
b34976b6 941 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
73e87d70 942 if (sh == NULL)
252b5132
RH
943 return NULL;
944
73e87d70
AM
945 newsect = &sh->section;
946 if (newsect->name != NULL)
4d7ce4dd 947 {
72adc230
AM
948 /* We are making a section of the same name. Put it in the
949 section hash table. Even though we can't find it directly by a
950 hash lookup, we'll be able to find the section by traversing
951 sh->root.next quicker than looking at all the bfd sections. */
952 struct section_hash_entry *new_sh;
953 new_sh = (struct section_hash_entry *)
954 bfd_section_hash_newfunc (NULL, &abfd->section_htab, name);
955 if (new_sh == NULL)
73e87d70 956 return NULL;
72adc230 957
73499ab8 958 new_sh->root = sh->root;
72adc230
AM
959 sh->root.next = &new_sh->root;
960 newsect = &new_sh->section;
252b5132
RH
961 }
962
73e87d70
AM
963 newsect->name = name;
964 return bfd_section_init (abfd, newsect);
252b5132
RH
965}
966
967/*
968FUNCTION
969 bfd_make_section
970
971SYNOPSIS
c58b9523 972 asection *bfd_make_section (bfd *, const char *name);
252b5132
RH
973
974DESCRIPTION
975 Like <<bfd_make_section_anyway>>, but return <<NULL>> (without calling
976 bfd_set_error ()) without changing the section chain if there is already a
977 section named @var{name}. If there is an error, return <<NULL>> and set
978 <<bfd_error>>.
979*/
980
981asection *
c58b9523 982bfd_make_section (bfd *abfd, const char *name)
252b5132 983{
73e87d70
AM
984 struct section_hash_entry *sh;
985 asection *newsect;
252b5132 986
73e87d70 987 if (abfd->output_has_begun)
252b5132 988 {
73e87d70
AM
989 bfd_set_error (bfd_error_invalid_operation);
990 return NULL;
252b5132
RH
991 }
992
73e87d70
AM
993 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0
994 || strcmp (name, BFD_COM_SECTION_NAME) == 0
995 || strcmp (name, BFD_UND_SECTION_NAME) == 0
996 || strcmp (name, BFD_IND_SECTION_NAME) == 0)
997 return NULL;
252b5132 998
b34976b6 999 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
73e87d70
AM
1000 if (sh == NULL)
1001 return NULL;
1002
1003 newsect = &sh->section;
1004 if (newsect->name != NULL)
252b5132 1005 {
73e87d70 1006 /* Section already exists. */
003d627e 1007 return NULL;
252b5132
RH
1008 }
1009
73e87d70
AM
1010 newsect->name = name;
1011 return bfd_section_init (abfd, newsect);
252b5132
RH
1012}
1013
252b5132
RH
1014/*
1015FUNCTION
1016 bfd_set_section_flags
1017
1018SYNOPSIS
c58b9523
AM
1019 bfd_boolean bfd_set_section_flags
1020 (bfd *abfd, asection *sec, flagword flags);
252b5132
RH
1021
1022DESCRIPTION
1023 Set the attributes of the section @var{sec} in the BFD
b34976b6
AM
1024 @var{abfd} to the value @var{flags}. Return <<TRUE>> on success,
1025 <<FALSE>> on error. Possible error returns are:
252b5132
RH
1026
1027 o <<bfd_error_invalid_operation>> -
1028 The section cannot have one or more of the attributes
1029 requested. For example, a .bss section in <<a.out>> may not
1030 have the <<SEC_HAS_CONTENTS>> field set.
1031
1032*/
1033
b34976b6 1034bfd_boolean
c58b9523
AM
1035bfd_set_section_flags (bfd *abfd ATTRIBUTE_UNUSED,
1036 sec_ptr section,
1037 flagword flags)
252b5132
RH
1038{
1039#if 0
1040 /* If you try to copy a text section from an input file (where it
1041 has the SEC_CODE flag set) to an output file, this loses big if
1042 the bfd_applicable_section_flags (abfd) doesn't have the SEC_CODE
1043 set - which it doesn't, at least not for a.out. FIXME */
1044
1045 if ((flags & bfd_applicable_section_flags (abfd)) != flags)
1046 {
1047 bfd_set_error (bfd_error_invalid_operation);
b34976b6 1048 return FALSE;
252b5132
RH
1049 }
1050#endif
1051
1052 section->flags = flags;
b34976b6 1053 return TRUE;
252b5132
RH
1054}
1055
252b5132
RH
1056/*
1057FUNCTION
1058 bfd_map_over_sections
1059
1060SYNOPSIS
c58b9523
AM
1061 void bfd_map_over_sections
1062 (bfd *abfd,
1063 void (*func) (bfd *abfd, asection *sect, void *obj),
1064 void *obj);
252b5132
RH
1065
1066DESCRIPTION
1067 Call the provided function @var{func} for each section
1068 attached to the BFD @var{abfd}, passing @var{obj} as an
1069 argument. The function will be called as if by
1070
c58b9523 1071| func (abfd, the_section, obj);
252b5132 1072
7dee875e 1073 This is the preferred method for iterating over sections; an
252b5132
RH
1074 alternative would be to use a loop:
1075
1076| section *p;
1077| for (p = abfd->sections; p != NULL; p = p->next)
c58b9523 1078| func (abfd, p, ...)
252b5132 1079
252b5132
RH
1080*/
1081
252b5132 1082void
c58b9523
AM
1083bfd_map_over_sections (bfd *abfd,
1084 void (*operation) (bfd *, asection *, void *),
1085 void *user_storage)
252b5132
RH
1086{
1087 asection *sect;
1088 unsigned int i = 0;
1089
1090 for (sect = abfd->sections; sect != NULL; i++, sect = sect->next)
1091 (*operation) (abfd, sect, user_storage);
1092
1093 if (i != abfd->section_count) /* Debugging */
1094 abort ();
1095}
1096
bc87dd2e
L
1097/*
1098FUNCTION
1099 bfd_sections_find_if
1100
1101SYNOPSIS
1102 asection *bfd_sections_find_if
1103 (bfd *abfd,
1104 bfd_boolean (*func) (bfd *abfd, asection *sect, void *obj),
1105 void *obj);
1106
1107DESCRIPTION
1108 Call the provided function @var{func} for each section
1109 attached to the BFD @var{abfd}, passing @var{obj} as an
1110 argument. The function will be called as if by
1111
1112| func (abfd, the_section, obj);
1113
1114 It returns the first section for which @var{func} returns true.
1115
1116*/
1117
1118asection *
1119bfd_sections_find_if (bfd *abfd,
1120 bfd_boolean (*operation) (bfd *, asection *, void *),
1121 void *user_storage)
1122{
1123 asection *sect;
1124
1125 for (sect = abfd->sections; sect != NULL; sect = sect->next)
1126 if ((*operation) (abfd, sect, user_storage))
1127 break;
1128
1129 return sect;
1130}
1131
252b5132
RH
1132/*
1133FUNCTION
1134 bfd_set_section_size
1135
1136SYNOPSIS
c58b9523
AM
1137 bfd_boolean bfd_set_section_size
1138 (bfd *abfd, asection *sec, bfd_size_type val);
252b5132
RH
1139
1140DESCRIPTION
1141 Set @var{sec} to the size @var{val}. If the operation is
b34976b6 1142 ok, then <<TRUE>> is returned, else <<FALSE>>.
252b5132
RH
1143
1144 Possible error returns:
1145 o <<bfd_error_invalid_operation>> -
1146 Writing has started to the BFD, so setting the size is invalid.
1147
1148*/
1149
b34976b6 1150bfd_boolean
c58b9523 1151bfd_set_section_size (bfd *abfd, sec_ptr ptr, bfd_size_type val)
252b5132
RH
1152{
1153 /* Once you've started writing to any section you cannot create or change
7b82c249 1154 the size of any others. */
252b5132
RH
1155
1156 if (abfd->output_has_begun)
1157 {
1158 bfd_set_error (bfd_error_invalid_operation);
b34976b6 1159 return FALSE;
252b5132
RH
1160 }
1161
1162 ptr->_cooked_size = val;
1163 ptr->_raw_size = val;
1164
b34976b6 1165 return TRUE;
252b5132
RH
1166}
1167
1168/*
1169FUNCTION
1170 bfd_set_section_contents
1171
1172SYNOPSIS
c58b9523 1173 bfd_boolean bfd_set_section_contents
85302095
AC
1174 (bfd *abfd, asection *section, const void *data,
1175 file_ptr offset, bfd_size_type count);
252b5132 1176
252b5132
RH
1177DESCRIPTION
1178 Sets the contents of the section @var{section} in BFD
1179 @var{abfd} to the data starting in memory at @var{data}. The
1180 data is written to the output section starting at offset
9a968f43 1181 @var{offset} for @var{count} octets.
252b5132 1182
b34976b6 1183 Normally <<TRUE>> is returned, else <<FALSE>>. Possible error
252b5132
RH
1184 returns are:
1185 o <<bfd_error_no_contents>> -
1186 The output section does not have the <<SEC_HAS_CONTENTS>>
1187 attribute, so nothing can be written to it.
1188 o and some more too
1189
1190 This routine is front end to the back end function
1191 <<_bfd_set_section_contents>>.
1192
252b5132
RH
1193*/
1194
c58b9523
AM
1195#define bfd_get_section_size_now(abfd, sec) \
1196 (sec->reloc_done \
1197 ? bfd_get_section_size_after_reloc (sec) \
1198 : bfd_get_section_size_before_reloc (sec))
252b5132 1199
b34976b6 1200bfd_boolean
c58b9523
AM
1201bfd_set_section_contents (bfd *abfd,
1202 sec_ptr section,
85302095 1203 const void *location,
c58b9523
AM
1204 file_ptr offset,
1205 bfd_size_type count)
252b5132
RH
1206{
1207 bfd_size_type sz;
1208
1209 if (!(bfd_get_section_flags (abfd, section) & SEC_HAS_CONTENTS))
1210 {
1211 bfd_set_error (bfd_error_no_contents);
b34976b6 1212 return FALSE;
252b5132
RH
1213 }
1214
dc810e39
AM
1215 sz = bfd_get_section_size_now (abfd, section);
1216 if ((bfd_size_type) offset > sz
1217 || count > sz
1218 || offset + count > sz
1219 || count != (size_t) count)
252b5132 1220 {
252b5132 1221 bfd_set_error (bfd_error_bad_value);
b34976b6 1222 return FALSE;
252b5132 1223 }
252b5132
RH
1224
1225 switch (abfd->direction)
1226 {
1227 case read_direction:
1228 case no_direction:
1229 bfd_set_error (bfd_error_invalid_operation);
b34976b6 1230 return FALSE;
252b5132
RH
1231
1232 case write_direction:
1233 break;
1234
1235 case both_direction:
1236 /* File is opened for update. `output_has_begun' some time ago when
1237 the file was created. Do not recompute sections sizes or alignments
1238 in _bfd_set_section_content. */
b34976b6 1239 abfd->output_has_begun = TRUE;
252b5132
RH
1240 break;
1241 }
1242
9a951beb
RH
1243 /* Record a copy of the data in memory if desired. */
1244 if (section->contents
c58b9523 1245 && location != section->contents + offset)
dc810e39 1246 memcpy (section->contents + offset, location, (size_t) count);
9a951beb 1247
252b5132
RH
1248 if (BFD_SEND (abfd, _bfd_set_section_contents,
1249 (abfd, section, location, offset, count)))
1250 {
b34976b6
AM
1251 abfd->output_has_begun = TRUE;
1252 return TRUE;
252b5132
RH
1253 }
1254
b34976b6 1255 return FALSE;
252b5132
RH
1256}
1257
1258/*
1259FUNCTION
1260 bfd_get_section_contents
1261
1262SYNOPSIS
c58b9523
AM
1263 bfd_boolean bfd_get_section_contents
1264 (bfd *abfd, asection *section, void *location, file_ptr offset,
1265 bfd_size_type count);
252b5132
RH
1266
1267DESCRIPTION
1268 Read data from @var{section} in BFD @var{abfd}
1269 into memory starting at @var{location}. The data is read at an
1270 offset of @var{offset} from the start of the input section,
1271 and is read for @var{count} bytes.
1272
1273 If the contents of a constructor with the <<SEC_CONSTRUCTOR>>
1274 flag set are requested or if the section does not have the
1275 <<SEC_HAS_CONTENTS>> flag set, then the @var{location} is filled
b34976b6
AM
1276 with zeroes. If no errors occur, <<TRUE>> is returned, else
1277 <<FALSE>>.
252b5132 1278
252b5132 1279*/
b34976b6 1280bfd_boolean
c58b9523
AM
1281bfd_get_section_contents (bfd *abfd,
1282 sec_ptr section,
1283 void *location,
1284 file_ptr offset,
1285 bfd_size_type count)
252b5132
RH
1286{
1287 bfd_size_type sz;
1288
1289 if (section->flags & SEC_CONSTRUCTOR)
1290 {
dc810e39 1291 memset (location, 0, (size_t) count);
b34976b6 1292 return TRUE;
252b5132
RH
1293 }
1294
b34976b6 1295 /* Even if reloc_done is TRUE, this function reads unrelocated
dc810e39
AM
1296 contents, so we want the raw size. */
1297 sz = section->_raw_size;
1298 if ((bfd_size_type) offset > sz
1299 || count > sz
1300 || offset + count > sz
1301 || count != (size_t) count)
252b5132 1302 {
252b5132 1303 bfd_set_error (bfd_error_bad_value);
b34976b6 1304 return FALSE;
252b5132 1305 }
252b5132
RH
1306
1307 if (count == 0)
1308 /* Don't bother. */
b34976b6 1309 return TRUE;
252b5132
RH
1310
1311 if ((section->flags & SEC_HAS_CONTENTS) == 0)
1312 {
dc810e39 1313 memset (location, 0, (size_t) count);
b34976b6 1314 return TRUE;
252b5132
RH
1315 }
1316
1317 if ((section->flags & SEC_IN_MEMORY) != 0)
1318 {
1319 memcpy (location, section->contents + offset, (size_t) count);
b34976b6 1320 return TRUE;
252b5132
RH
1321 }
1322
1323 return BFD_SEND (abfd, _bfd_get_section_contents,
1324 (abfd, section, location, offset, count));
1325}
1326
1327/*
1328FUNCTION
1329 bfd_copy_private_section_data
1330
1331SYNOPSIS
c58b9523
AM
1332 bfd_boolean bfd_copy_private_section_data
1333 (bfd *ibfd, asection *isec, bfd *obfd, asection *osec);
252b5132
RH
1334
1335DESCRIPTION
1336 Copy private section information from @var{isec} in the BFD
1337 @var{ibfd} to the section @var{osec} in the BFD @var{obfd}.
b34976b6 1338 Return <<TRUE>> on success, <<FALSE>> on error. Possible error
252b5132
RH
1339 returns are:
1340
1341 o <<bfd_error_no_memory>> -
1342 Not enough memory exists to create private data for @var{osec}.
1343
1344.#define bfd_copy_private_section_data(ibfd, isection, obfd, osection) \
1345. BFD_SEND (obfd, _bfd_copy_private_section_data, \
1346. (ibfd, isection, obfd, osection))
1347*/
1348
1349/*
1350FUNCTION
1351 _bfd_strip_section_from_output
1352
1353SYNOPSIS
1354 void _bfd_strip_section_from_output
c58b9523 1355 (struct bfd_link_info *info, asection *section);
252b5132
RH
1356
1357DESCRIPTION
7f8d5fc9 1358 Remove @var{section} from the output. If the output section
bc0ba537
AM
1359 becomes empty, remove it from the output bfd.
1360
1361 This function won't actually do anything except twiddle flags
1362 if called too late in the linking process, when it's not safe
1363 to remove sections.
252b5132
RH
1364*/
1365void
c58b9523 1366_bfd_strip_section_from_output (struct bfd_link_info *info, asection *s)
252b5132 1367{
bc0ba537
AM
1368 asection *os;
1369 asection *is;
1370 bfd *abfd;
252b5132 1371
bc0ba537 1372 s->flags |= SEC_EXCLUDE;
7f8d5fc9 1373
bc0ba537
AM
1374 /* If the section wasn't assigned to an output section, or the
1375 section has been discarded by the linker script, there's nothing
1376 more to do. */
252b5132 1377 os = s->output_section;
bc0ba537 1378 if (os == NULL || os->owner == NULL)
2f484710
HPN
1379 return;
1380
bc0ba537
AM
1381 /* If the output section has other (non-excluded) input sections, we
1382 can't remove it. */
1383 for (abfd = info->input_bfds; abfd != NULL; abfd = abfd->link_next)
1384 for (is = abfd->sections; is != NULL; is = is->next)
1385 if (is->output_section == os && (is->flags & SEC_EXCLUDE) == 0)
1386 return;
7f8d5fc9 1387
bc0ba537
AM
1388 /* If the output section is empty, flag it for removal too.
1389 See ldlang.c:strip_excluded_output_sections for the action. */
1390 os->flags |= SEC_EXCLUDE;
252b5132 1391}
b885599b 1392
72adc230
AM
1393/*
1394FUNCTION
1395 bfd_generic_is_group_section
1396
1397SYNOPSIS
1398 bfd_boolean bfd_generic_is_group_section (bfd *, const asection *sec);
1399
1400DESCRIPTION
1401 Returns TRUE if @var{sec} is a member of a group.
1402*/
1403
1404bfd_boolean
1405bfd_generic_is_group_section (bfd *abfd ATTRIBUTE_UNUSED,
1406 const asection *sec ATTRIBUTE_UNUSED)
1407{
1408 return FALSE;
1409}
1410
b885599b
AM
1411/*
1412FUNCTION
e61463e1 1413 bfd_generic_discard_group
b885599b
AM
1414
1415SYNOPSIS
b34976b6 1416 bfd_boolean bfd_generic_discard_group (bfd *abfd, asection *group);
b885599b
AM
1417
1418DESCRIPTION
1419 Remove all members of @var{group} from the output.
1420*/
1421
b34976b6 1422bfd_boolean
c58b9523
AM
1423bfd_generic_discard_group (bfd *abfd ATTRIBUTE_UNUSED,
1424 asection *group ATTRIBUTE_UNUSED)
b885599b 1425{
b34976b6 1426 return TRUE;
b885599b 1427}
This page took 0.374643 seconds and 4 git commands to generate.