bfd/
[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,
68bfbfcc 3 2000, 2001, 2002, 2003
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.
252b5132
RH
169.typedef struct sec
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. *}
52b219b5 182. struct sec *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.
68bfbfcc 405. {* Usused 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. *}
52b219b5 448. struct sec *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. *}
52b219b5 478. PTR 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. *}
498. struct sec *kept_section;
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.
52b219b5 507. PTR 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. *}
52b219b5
AM
517. struct symbol_cache_entry *symbol;
518. struct symbol_cache_entry **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. *}
252b5132
RH
535.extern const asection bfd_abs_section;
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. *}
252b5132
RH
539.extern const asection bfd_und_section;
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. *}
252b5132
RH
543.extern const asection bfd_com_section;
544.#define bfd_com_section_ptr ((asection *) &bfd_com_section)
b5f79c76 545.{* Pointer to the indirect section. *}
252b5132
RH
546.extern const asection bfd_ind_section;
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.
252b5132
RH
556.extern const struct symbol_cache_entry * const bfd_abs_symbol;
557.extern const struct symbol_cache_entry * const bfd_com_symbol;
558.extern const struct symbol_cache_entry * const bfd_und_symbol;
559.extern const struct symbol_cache_entry * const bfd_ind_symbol;
560.#define bfd_get_section_size_before_reloc(section) \
f6af82bd
AM
561. ((section)->reloc_done ? (abort (), (bfd_size_type) 1) \
562. : (section)->_raw_size)
252b5132 563.#define bfd_get_section_size_after_reloc(section) \
f6af82bd
AM
564. ((section)->reloc_done ? (section)->_cooked_size \
565. : (abort (), (bfd_size_type) 1))
9e7b37b3
AM
566.
567.{* Macros to handle insertion and deletion of a bfd's sections. These
568. only handle the list pointers, ie. do not adjust section_count,
569. target_index etc. *}
570.#define bfd_section_list_remove(ABFD, PS) \
571. do \
572. { \
573. asection **_ps = PS; \
574. asection *_s = *_ps; \
575. *_ps = _s->next; \
576. if (_s->next == NULL) \
577. (ABFD)->section_tail = _ps; \
578. } \
579. while (0)
580.#define bfd_section_list_insert(ABFD, PS, S) \
581. do \
582. { \
583. asection **_ps = PS; \
584. asection *_s = S; \
585. _s->next = *_ps; \
586. *_ps = _s; \
587. if (_s->next == NULL) \
588. (ABFD)->section_tail = &_s->next; \
589. } \
590. while (0)
591.
252b5132
RH
592*/
593
22bc497d
ILT
594/* We use a macro to initialize the static asymbol structures because
595 traditional C does not permit us to initialize a union member while
596 gcc warns if we don't initialize it. */
597 /* the_bfd, name, value, attr, section [, udata] */
598#ifdef __STDC__
599#define GLOBAL_SYM_INIT(NAME, SECTION) \
600 { 0, NAME, 0, BSF_SECTION_SYM, (asection *) SECTION, { 0 }}
601#else
602#define GLOBAL_SYM_INIT(NAME, SECTION) \
603 { 0, NAME, 0, BSF_SECTION_SYM, (asection *) SECTION }
604#endif
605
252b5132
RH
606/* These symbols are global, not specific to any BFD. Therefore, anything
607 that tries to change them is broken, and should be repaired. */
22bc497d 608
252b5132
RH
609static const asymbol global_syms[] =
610{
22bc497d
ILT
611 GLOBAL_SYM_INIT (BFD_COM_SECTION_NAME, &bfd_com_section),
612 GLOBAL_SYM_INIT (BFD_UND_SECTION_NAME, &bfd_und_section),
613 GLOBAL_SYM_INIT (BFD_ABS_SECTION_NAME, &bfd_abs_section),
614 GLOBAL_SYM_INIT (BFD_IND_SECTION_NAME, &bfd_ind_section)
252b5132
RH
615};
616
bc67d8a6
NC
617#define STD_SECTION(SEC, FLAGS, SYM, NAME, IDX) \
618 const asymbol * const SYM = (asymbol *) &global_syms[IDX]; \
619 const asection SEC = \
3df7b4e2
AM
620 /* name, id, index, next, flags, user_set_vma, reloc_done, */ \
621 { NAME, IDX, 0, NULL, FLAGS, 0, 0, \
52b219b5 622 \
d1778b88
AM
623 /* linker_mark, linker_has_input, gc_mark, segment_mark, */ \
624 0, 0, 1, 0, \
625 \
ad8e1ba5
AM
626 /* sec_info_type, use_rela_p, has_tls_reloc, */ \
627 0, 0, 0, \
628 \
629 /* need_finalize_relax, has_gp_reloc, */ \
630 0, 0, \
68bfbfcc
AM
631 \
632 /* flag13, flag14, flag15, flag16, flag20, flag24, */ \
633 0, 0, 0, 0, 0, 0, \
634 \
d1778b88
AM
635 /* vma, lma, _cooked_size, _raw_size, */ \
636 0, 0, 0, 0, \
52b219b5 637 \
d1778b88
AM
638 /* output_offset, output_section, alignment_power, */ \
639 0, (struct sec *) &SEC, 0, \
52b219b5
AM
640 \
641 /* relocation, orelocation, reloc_count, filepos, rel_filepos, */ \
642 NULL, NULL, 0, 0, 0, \
643 \
644 /* line_filepos, userdata, contents, lineno, lineno_count, */ \
645 0, NULL, NULL, NULL, 0, \
646 \
f97b9cb8
L
647 /* entsize, comdat, kept_section, moving_line_filepos, */ \
648 0, NULL, NULL, 0, \
52b219b5 649 \
767e4b0d
JJ
650 /* target_index, used_by_bfd, constructor_chain, owner, */ \
651 0, NULL, NULL, NULL, \
52b219b5
AM
652 \
653 /* symbol, */ \
654 (struct symbol_cache_entry *) &global_syms[IDX], \
655 \
656 /* symbol_ptr_ptr, */ \
657 (struct symbol_cache_entry **) &SYM, \
658 \
659 /* link_order_head, link_order_tail */ \
660 NULL, NULL \
022a5af4 661 }
252b5132
RH
662
663STD_SECTION (bfd_com_section, SEC_IS_COMMON, bfd_com_symbol,
664 BFD_COM_SECTION_NAME, 0);
665STD_SECTION (bfd_und_section, 0, bfd_und_symbol, BFD_UND_SECTION_NAME, 1);
666STD_SECTION (bfd_abs_section, 0, bfd_abs_symbol, BFD_ABS_SECTION_NAME, 2);
667STD_SECTION (bfd_ind_section, 0, bfd_ind_symbol, BFD_IND_SECTION_NAME, 3);
668#undef STD_SECTION
669
73e87d70
AM
670struct section_hash_entry
671{
672 struct bfd_hash_entry root;
673 asection section;
674};
675
676/* Initialize an entry in the section hash table. */
677
678struct bfd_hash_entry *
679bfd_section_hash_newfunc (entry, table, string)
680 struct bfd_hash_entry *entry;
681 struct bfd_hash_table *table;
682 const char *string;
683{
684 /* Allocate the structure if it has not already been allocated by a
685 subclass. */
686 if (entry == NULL)
687 {
d45913a0
DA
688 entry = (struct bfd_hash_entry *)
689 bfd_hash_allocate (table, sizeof (struct section_hash_entry));
73e87d70
AM
690 if (entry == NULL)
691 return entry;
692 }
693
694 /* Call the allocation method of the superclass. */
695 entry = bfd_hash_newfunc (entry, table, string);
696 if (entry != NULL)
697 {
698 memset ((PTR) &((struct section_hash_entry *) entry)->section,
699 0, sizeof (asection));
700 }
701
702 return entry;
703}
704
705#define section_hash_lookup(table, string, create, copy) \
706 ((struct section_hash_entry *) \
707 bfd_hash_lookup ((table), (string), (create), (copy)))
708
709/* Initializes a new section. NEWSECT->NAME is already set. */
710
711static asection *bfd_section_init PARAMS ((bfd *, asection *));
712
713static asection *
714bfd_section_init (abfd, newsect)
715 bfd *abfd;
716 asection *newsect;
717{
718 static int section_id = 0x10; /* id 0 to 3 used by STD_SECTION. */
719
720 newsect->id = section_id;
721 newsect->index = abfd->section_count;
73e87d70 722 newsect->owner = abfd;
73e87d70
AM
723
724 /* Create a symbol whose only job is to point to this section. This
725 is useful for things like relocs which are relative to the base
726 of a section. */
727 newsect->symbol = bfd_make_empty_symbol (abfd);
728 if (newsect->symbol == NULL)
729 return NULL;
730
731 newsect->symbol->name = newsect->name;
732 newsect->symbol->value = 0;
733 newsect->symbol->section = newsect;
734 newsect->symbol->flags = BSF_SECTION_SYM;
735
736 newsect->symbol_ptr_ptr = &newsect->symbol;
737
738 if (! BFD_SEND (abfd, _new_section_hook, (abfd, newsect)))
739 return NULL;
740
741 section_id++;
742 abfd->section_count++;
743 *abfd->section_tail = newsect;
744 abfd->section_tail = &newsect->next;
745 return newsect;
746}
747
252b5132
RH
748/*
749DOCDD
750INODE
751section prototypes, , typedef asection, Sections
752SUBSECTION
753 Section prototypes
754
755These are the functions exported by the section handling part of BFD.
756*/
757
9e7b37b3
AM
758/*
759FUNCTION
760 bfd_section_list_clear
761
762SYNOPSIS
763 void bfd_section_list_clear (bfd *);
764
765DESCRIPTION
766 Clears the section list, and also resets the section count and
767 hash table entries.
768*/
769
770void
771bfd_section_list_clear (abfd)
772 bfd *abfd;
773{
774 abfd->sections = NULL;
775 abfd->section_tail = &abfd->sections;
776 abfd->section_count = 0;
777 memset ((PTR) abfd->section_htab.table, 0,
778 abfd->section_htab.size * sizeof (struct bfd_hash_entry *));
779}
780
252b5132
RH
781/*
782FUNCTION
783 bfd_get_section_by_name
784
785SYNOPSIS
52b219b5 786 asection *bfd_get_section_by_name(bfd *abfd, const char *name);
252b5132
RH
787
788DESCRIPTION
789 Run through @var{abfd} and return the one of the
790 <<asection>>s whose name matches @var{name}, otherwise <<NULL>>.
791 @xref{Sections}, for more information.
792
793 This should only be used in special cases; the normal way to process
794 all sections of a given name is to use <<bfd_map_over_sections>> and
795 <<strcmp>> on the name (or better yet, base it on the section flags
796 or something else) for each section.
797*/
798
799asection *
800bfd_get_section_by_name (abfd, name)
801 bfd *abfd;
52b219b5 802 const char *name;
252b5132 803{
73e87d70
AM
804 struct section_hash_entry *sh;
805
b34976b6 806 sh = section_hash_lookup (&abfd->section_htab, name, FALSE, FALSE);
73e87d70
AM
807 if (sh != NULL)
808 return &sh->section;
252b5132 809
252b5132
RH
810 return NULL;
811}
812
1bd91689
AM
813/*
814FUNCTION
815 bfd_get_unique_section_name
816
817SYNOPSIS
818 char *bfd_get_unique_section_name(bfd *abfd,
a966dba9 819 const char *templat,
1bd91689
AM
820 int *count);
821
822DESCRIPTION
823 Invent a section name that is unique in @var{abfd} by tacking
77cb06e9
AM
824 a dot and a digit suffix onto the original @var{templat}. If
825 @var{count} is non-NULL, then it specifies the first number
826 tried as a suffix to generate a unique name. The value
827 pointed to by @var{count} will be incremented in this case.
1bd91689
AM
828*/
829
830char *
a966dba9 831bfd_get_unique_section_name (abfd, templat, count)
1bd91689 832 bfd *abfd;
a966dba9 833 const char *templat;
1bd91689
AM
834 int *count;
835{
836 int num;
837 unsigned int len;
838 char *sname;
839
a966dba9 840 len = strlen (templat);
dc810e39 841 sname = bfd_malloc ((bfd_size_type) len + 8);
b3ea3584
AM
842 if (sname == NULL)
843 return NULL;
d4c88bbb 844 memcpy (sname, templat, len);
1bd91689
AM
845 num = 1;
846 if (count != NULL)
847 num = *count;
848
849 do
850 {
851 /* If we have a million sections, something is badly wrong. */
852 if (num > 999999)
853 abort ();
77cb06e9 854 sprintf (sname + len, ".%d", num++);
1bd91689 855 }
b34976b6 856 while (section_hash_lookup (&abfd->section_htab, sname, FALSE, FALSE));
1bd91689
AM
857
858 if (count != NULL)
859 *count = num;
860 return sname;
861}
862
252b5132
RH
863/*
864FUNCTION
865 bfd_make_section_old_way
866
867SYNOPSIS
52b219b5 868 asection *bfd_make_section_old_way(bfd *abfd, const char *name);
252b5132
RH
869
870DESCRIPTION
871 Create a new empty section called @var{name}
872 and attach it to the end of the chain of sections for the
873 BFD @var{abfd}. An attempt to create a section with a name which
874 is already in use returns its pointer without changing the
875 section chain.
876
877 It has the funny name since this is the way it used to be
878 before it was rewritten....
879
880 Possible errors are:
881 o <<bfd_error_invalid_operation>> -
882 If output has already started for this BFD.
883 o <<bfd_error_no_memory>> -
884 If memory allocation fails.
885
886*/
887
252b5132
RH
888asection *
889bfd_make_section_old_way (abfd, name)
890 bfd *abfd;
52b219b5 891 const char *name;
252b5132 892{
73e87d70
AM
893 struct section_hash_entry *sh;
894 asection *newsect;
895
896 if (abfd->output_has_begun)
897 {
898 bfd_set_error (bfd_error_invalid_operation);
899 return NULL;
900 }
901
902 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0)
903 return bfd_abs_section_ptr;
904
905 if (strcmp (name, BFD_COM_SECTION_NAME) == 0)
906 return bfd_com_section_ptr;
907
908 if (strcmp (name, BFD_UND_SECTION_NAME) == 0)
909 return bfd_und_section_ptr;
910
911 if (strcmp (name, BFD_IND_SECTION_NAME) == 0)
912 return bfd_ind_section_ptr;
913
b34976b6 914 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
73e87d70
AM
915 if (sh == NULL)
916 return NULL;
917
918 newsect = &sh->section;
919 if (newsect->name != NULL)
252b5132 920 {
73e87d70
AM
921 /* Section already exists. */
922 return newsect;
252b5132 923 }
73e87d70
AM
924
925 newsect->name = name;
926 return bfd_section_init (abfd, newsect);
252b5132
RH
927}
928
929/*
930FUNCTION
931 bfd_make_section_anyway
932
933SYNOPSIS
52b219b5 934 asection *bfd_make_section_anyway(bfd *abfd, const char *name);
252b5132
RH
935
936DESCRIPTION
937 Create a new empty section called @var{name} and attach it to the end of
938 the chain of sections for @var{abfd}. Create a new section even if there
939 is already a section with that name.
940
941 Return <<NULL>> and set <<bfd_error>> on error; possible errors are:
942 o <<bfd_error_invalid_operation>> - If output has already started for @var{abfd}.
943 o <<bfd_error_no_memory>> - If memory allocation fails.
944*/
945
946sec_ptr
947bfd_make_section_anyway (abfd, name)
948 bfd *abfd;
52b219b5 949 const char *name;
252b5132 950{
73e87d70 951 struct section_hash_entry *sh;
252b5132 952 asection *newsect;
252b5132
RH
953
954 if (abfd->output_has_begun)
955 {
956 bfd_set_error (bfd_error_invalid_operation);
957 return NULL;
958 }
959
b34976b6 960 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
73e87d70 961 if (sh == NULL)
252b5132
RH
962 return NULL;
963
73e87d70
AM
964 newsect = &sh->section;
965 if (newsect->name != NULL)
4d7ce4dd 966 {
73e87d70
AM
967 /* We are making a section of the same name. It can't go in
968 section_htab without generating a unique section name and
969 that would be pointless; We don't need to traverse the
970 hash table. */
971 newsect = (asection *) bfd_zalloc (abfd, sizeof (asection));
972 if (newsect == NULL)
973 return NULL;
252b5132
RH
974 }
975
73e87d70
AM
976 newsect->name = name;
977 return bfd_section_init (abfd, newsect);
252b5132
RH
978}
979
980/*
981FUNCTION
982 bfd_make_section
983
984SYNOPSIS
52b219b5 985 asection *bfd_make_section(bfd *, const char *name);
252b5132
RH
986
987DESCRIPTION
988 Like <<bfd_make_section_anyway>>, but return <<NULL>> (without calling
989 bfd_set_error ()) without changing the section chain if there is already a
990 section named @var{name}. If there is an error, return <<NULL>> and set
991 <<bfd_error>>.
992*/
993
994asection *
995bfd_make_section (abfd, name)
996 bfd *abfd;
52b219b5 997 const char *name;
252b5132 998{
73e87d70
AM
999 struct section_hash_entry *sh;
1000 asection *newsect;
252b5132 1001
73e87d70 1002 if (abfd->output_has_begun)
252b5132 1003 {
73e87d70
AM
1004 bfd_set_error (bfd_error_invalid_operation);
1005 return NULL;
252b5132
RH
1006 }
1007
73e87d70
AM
1008 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0
1009 || strcmp (name, BFD_COM_SECTION_NAME) == 0
1010 || strcmp (name, BFD_UND_SECTION_NAME) == 0
1011 || strcmp (name, BFD_IND_SECTION_NAME) == 0)
1012 return NULL;
252b5132 1013
b34976b6 1014 sh = section_hash_lookup (&abfd->section_htab, name, TRUE, FALSE);
73e87d70
AM
1015 if (sh == NULL)
1016 return NULL;
1017
1018 newsect = &sh->section;
1019 if (newsect->name != NULL)
252b5132 1020 {
73e87d70
AM
1021 /* Section already exists. */
1022 return newsect;
252b5132
RH
1023 }
1024
73e87d70
AM
1025 newsect->name = name;
1026 return bfd_section_init (abfd, newsect);
252b5132
RH
1027}
1028
252b5132
RH
1029/*
1030FUNCTION
1031 bfd_set_section_flags
1032
1033SYNOPSIS
b34976b6 1034 bfd_boolean bfd_set_section_flags (bfd *abfd, asection *sec, flagword flags);
252b5132
RH
1035
1036DESCRIPTION
1037 Set the attributes of the section @var{sec} in the BFD
b34976b6
AM
1038 @var{abfd} to the value @var{flags}. Return <<TRUE>> on success,
1039 <<FALSE>> on error. Possible error returns are:
252b5132
RH
1040
1041 o <<bfd_error_invalid_operation>> -
1042 The section cannot have one or more of the attributes
1043 requested. For example, a .bss section in <<a.out>> may not
1044 have the <<SEC_HAS_CONTENTS>> field set.
1045
1046*/
1047
1048/*ARGSUSED*/
b34976b6 1049bfd_boolean
252b5132 1050bfd_set_section_flags (abfd, section, flags)
7442e600 1051 bfd *abfd ATTRIBUTE_UNUSED;
252b5132
RH
1052 sec_ptr section;
1053 flagword flags;
1054{
1055#if 0
1056 /* If you try to copy a text section from an input file (where it
1057 has the SEC_CODE flag set) to an output file, this loses big if
1058 the bfd_applicable_section_flags (abfd) doesn't have the SEC_CODE
1059 set - which it doesn't, at least not for a.out. FIXME */
1060
1061 if ((flags & bfd_applicable_section_flags (abfd)) != flags)
1062 {
1063 bfd_set_error (bfd_error_invalid_operation);
b34976b6 1064 return FALSE;
252b5132
RH
1065 }
1066#endif
1067
1068 section->flags = flags;
b34976b6 1069 return TRUE;
252b5132
RH
1070}
1071
252b5132
RH
1072/*
1073FUNCTION
1074 bfd_map_over_sections
1075
1076SYNOPSIS
1077 void bfd_map_over_sections(bfd *abfd,
7b82c249 1078 void (*func) (bfd *abfd,
252b5132
RH
1079 asection *sect,
1080 PTR obj),
1081 PTR obj);
1082
1083DESCRIPTION
1084 Call the provided function @var{func} for each section
1085 attached to the BFD @var{abfd}, passing @var{obj} as an
1086 argument. The function will be called as if by
1087
1088| func(abfd, the_section, obj);
1089
1090 This is the prefered method for iterating over sections; an
1091 alternative would be to use a loop:
1092
1093| section *p;
1094| for (p = abfd->sections; p != NULL; p = p->next)
1095| func(abfd, p, ...)
1096
252b5132
RH
1097*/
1098
1099/*VARARGS2*/
1100void
1101bfd_map_over_sections (abfd, operation, user_storage)
1102 bfd *abfd;
1103 void (*operation) PARAMS ((bfd * abfd, asection * sect, PTR obj));
1104 PTR user_storage;
1105{
1106 asection *sect;
1107 unsigned int i = 0;
1108
1109 for (sect = abfd->sections; sect != NULL; i++, sect = sect->next)
1110 (*operation) (abfd, sect, user_storage);
1111
1112 if (i != abfd->section_count) /* Debugging */
1113 abort ();
1114}
1115
252b5132
RH
1116/*
1117FUNCTION
1118 bfd_set_section_size
1119
1120SYNOPSIS
b34976b6 1121 bfd_boolean bfd_set_section_size (bfd *abfd, asection *sec, bfd_size_type val);
252b5132
RH
1122
1123DESCRIPTION
1124 Set @var{sec} to the size @var{val}. If the operation is
b34976b6 1125 ok, then <<TRUE>> is returned, else <<FALSE>>.
252b5132
RH
1126
1127 Possible error returns:
1128 o <<bfd_error_invalid_operation>> -
1129 Writing has started to the BFD, so setting the size is invalid.
1130
1131*/
1132
b34976b6 1133bfd_boolean
252b5132
RH
1134bfd_set_section_size (abfd, ptr, val)
1135 bfd *abfd;
1136 sec_ptr ptr;
1137 bfd_size_type val;
1138{
1139 /* Once you've started writing to any section you cannot create or change
7b82c249 1140 the size of any others. */
252b5132
RH
1141
1142 if (abfd->output_has_begun)
1143 {
1144 bfd_set_error (bfd_error_invalid_operation);
b34976b6 1145 return FALSE;
252b5132
RH
1146 }
1147
1148 ptr->_cooked_size = val;
1149 ptr->_raw_size = val;
1150
b34976b6 1151 return TRUE;
252b5132
RH
1152}
1153
1154/*
1155FUNCTION
1156 bfd_set_section_contents
1157
1158SYNOPSIS
b34976b6
AM
1159 bfd_boolean bfd_set_section_contents (bfd *abfd, asection *section,
1160 PTR data, file_ptr offset,
1161 bfd_size_type count);
252b5132 1162
252b5132
RH
1163DESCRIPTION
1164 Sets the contents of the section @var{section} in BFD
1165 @var{abfd} to the data starting in memory at @var{data}. The
1166 data is written to the output section starting at offset
9a968f43 1167 @var{offset} for @var{count} octets.
252b5132 1168
b34976b6 1169 Normally <<TRUE>> is returned, else <<FALSE>>. Possible error
252b5132
RH
1170 returns are:
1171 o <<bfd_error_no_contents>> -
1172 The output section does not have the <<SEC_HAS_CONTENTS>>
1173 attribute, so nothing can be written to it.
1174 o and some more too
1175
1176 This routine is front end to the back end function
1177 <<_bfd_set_section_contents>>.
1178
252b5132
RH
1179*/
1180
1181#define bfd_get_section_size_now(abfd,sec) \
1182(sec->reloc_done \
1183 ? bfd_get_section_size_after_reloc (sec) \
1184 : bfd_get_section_size_before_reloc (sec))
1185
b34976b6 1186bfd_boolean
252b5132
RH
1187bfd_set_section_contents (abfd, section, location, offset, count)
1188 bfd *abfd;
1189 sec_ptr section;
1190 PTR location;
1191 file_ptr offset;
1192 bfd_size_type count;
1193{
1194 bfd_size_type sz;
1195
1196 if (!(bfd_get_section_flags (abfd, section) & SEC_HAS_CONTENTS))
1197 {
1198 bfd_set_error (bfd_error_no_contents);
b34976b6 1199 return FALSE;
252b5132
RH
1200 }
1201
dc810e39
AM
1202 sz = bfd_get_section_size_now (abfd, section);
1203 if ((bfd_size_type) offset > sz
1204 || count > sz
1205 || offset + count > sz
1206 || count != (size_t) count)
252b5132 1207 {
252b5132 1208 bfd_set_error (bfd_error_bad_value);
b34976b6 1209 return FALSE;
252b5132 1210 }
252b5132
RH
1211
1212 switch (abfd->direction)
1213 {
1214 case read_direction:
1215 case no_direction:
1216 bfd_set_error (bfd_error_invalid_operation);
b34976b6 1217 return FALSE;
252b5132
RH
1218
1219 case write_direction:
1220 break;
1221
1222 case both_direction:
1223 /* File is opened for update. `output_has_begun' some time ago when
1224 the file was created. Do not recompute sections sizes or alignments
1225 in _bfd_set_section_content. */
b34976b6 1226 abfd->output_has_begun = TRUE;
252b5132
RH
1227 break;
1228 }
1229
9a951beb
RH
1230 /* Record a copy of the data in memory if desired. */
1231 if (section->contents
d45913a0 1232 && location != (PTR) (section->contents + offset))
dc810e39 1233 memcpy (section->contents + offset, location, (size_t) count);
9a951beb 1234
252b5132
RH
1235 if (BFD_SEND (abfd, _bfd_set_section_contents,
1236 (abfd, section, location, offset, count)))
1237 {
b34976b6
AM
1238 abfd->output_has_begun = TRUE;
1239 return TRUE;
252b5132
RH
1240 }
1241
b34976b6 1242 return FALSE;
252b5132
RH
1243}
1244
1245/*
1246FUNCTION
1247 bfd_get_section_contents
1248
1249SYNOPSIS
b34976b6
AM
1250 bfd_boolean bfd_get_section_contents (bfd *abfd, asection *section,
1251 PTR location, file_ptr offset,
1252 bfd_size_type count);
252b5132
RH
1253
1254DESCRIPTION
1255 Read data from @var{section} in BFD @var{abfd}
1256 into memory starting at @var{location}. The data is read at an
1257 offset of @var{offset} from the start of the input section,
1258 and is read for @var{count} bytes.
1259
1260 If the contents of a constructor with the <<SEC_CONSTRUCTOR>>
1261 flag set are requested or if the section does not have the
1262 <<SEC_HAS_CONTENTS>> flag set, then the @var{location} is filled
b34976b6
AM
1263 with zeroes. If no errors occur, <<TRUE>> is returned, else
1264 <<FALSE>>.
252b5132 1265
252b5132 1266*/
b34976b6 1267bfd_boolean
252b5132
RH
1268bfd_get_section_contents (abfd, section, location, offset, count)
1269 bfd *abfd;
1270 sec_ptr section;
1271 PTR location;
1272 file_ptr offset;
1273 bfd_size_type count;
1274{
1275 bfd_size_type sz;
1276
1277 if (section->flags & SEC_CONSTRUCTOR)
1278 {
dc810e39 1279 memset (location, 0, (size_t) count);
b34976b6 1280 return TRUE;
252b5132
RH
1281 }
1282
b34976b6 1283 /* Even if reloc_done is TRUE, this function reads unrelocated
dc810e39
AM
1284 contents, so we want the raw size. */
1285 sz = section->_raw_size;
1286 if ((bfd_size_type) offset > sz
1287 || count > sz
1288 || offset + count > sz
1289 || count != (size_t) count)
252b5132 1290 {
252b5132 1291 bfd_set_error (bfd_error_bad_value);
b34976b6 1292 return FALSE;
252b5132 1293 }
252b5132
RH
1294
1295 if (count == 0)
1296 /* Don't bother. */
b34976b6 1297 return TRUE;
252b5132
RH
1298
1299 if ((section->flags & SEC_HAS_CONTENTS) == 0)
1300 {
dc810e39 1301 memset (location, 0, (size_t) count);
b34976b6 1302 return TRUE;
252b5132
RH
1303 }
1304
1305 if ((section->flags & SEC_IN_MEMORY) != 0)
1306 {
1307 memcpy (location, section->contents + offset, (size_t) count);
b34976b6 1308 return TRUE;
252b5132
RH
1309 }
1310
1311 return BFD_SEND (abfd, _bfd_get_section_contents,
1312 (abfd, section, location, offset, count));
1313}
1314
1315/*
1316FUNCTION
1317 bfd_copy_private_section_data
1318
1319SYNOPSIS
b34976b6
AM
1320 bfd_boolean bfd_copy_private_section_data (bfd *ibfd, asection *isec,
1321 bfd *obfd, asection *osec);
252b5132
RH
1322
1323DESCRIPTION
1324 Copy private section information from @var{isec} in the BFD
1325 @var{ibfd} to the section @var{osec} in the BFD @var{obfd}.
b34976b6 1326 Return <<TRUE>> on success, <<FALSE>> on error. Possible error
252b5132
RH
1327 returns are:
1328
1329 o <<bfd_error_no_memory>> -
1330 Not enough memory exists to create private data for @var{osec}.
1331
1332.#define bfd_copy_private_section_data(ibfd, isection, obfd, osection) \
1333. BFD_SEND (obfd, _bfd_copy_private_section_data, \
1334. (ibfd, isection, obfd, osection))
1335*/
1336
1337/*
1338FUNCTION
1339 _bfd_strip_section_from_output
1340
1341SYNOPSIS
1342 void _bfd_strip_section_from_output
7f8d5fc9 1343 (struct bfd_link_info *info, asection *section);
252b5132
RH
1344
1345DESCRIPTION
7f8d5fc9 1346 Remove @var{section} from the output. If the output section
bc0ba537
AM
1347 becomes empty, remove it from the output bfd.
1348
1349 This function won't actually do anything except twiddle flags
1350 if called too late in the linking process, when it's not safe
1351 to remove sections.
252b5132
RH
1352*/
1353void
7f8d5fc9
ILT
1354_bfd_strip_section_from_output (info, s)
1355 struct bfd_link_info *info;
252b5132
RH
1356 asection *s;
1357{
bc0ba537
AM
1358 asection *os;
1359 asection *is;
1360 bfd *abfd;
252b5132 1361
bc0ba537 1362 s->flags |= SEC_EXCLUDE;
7f8d5fc9 1363
bc0ba537
AM
1364 /* If the section wasn't assigned to an output section, or the
1365 section has been discarded by the linker script, there's nothing
1366 more to do. */
252b5132 1367 os = s->output_section;
bc0ba537 1368 if (os == NULL || os->owner == NULL)
2f484710
HPN
1369 return;
1370
bc0ba537
AM
1371 /* If the output section has other (non-excluded) input sections, we
1372 can't remove it. */
1373 for (abfd = info->input_bfds; abfd != NULL; abfd = abfd->link_next)
1374 for (is = abfd->sections; is != NULL; is = is->next)
1375 if (is->output_section == os && (is->flags & SEC_EXCLUDE) == 0)
1376 return;
7f8d5fc9 1377
bc0ba537
AM
1378 /* If the output section is empty, flag it for removal too.
1379 See ldlang.c:strip_excluded_output_sections for the action. */
1380 os->flags |= SEC_EXCLUDE;
252b5132 1381}
b885599b
AM
1382
1383/*
1384FUNCTION
e61463e1 1385 bfd_generic_discard_group
b885599b
AM
1386
1387SYNOPSIS
b34976b6 1388 bfd_boolean bfd_generic_discard_group (bfd *abfd, asection *group);
b885599b
AM
1389
1390DESCRIPTION
1391 Remove all members of @var{group} from the output.
1392*/
1393
b34976b6 1394bfd_boolean
e61463e1
AM
1395bfd_generic_discard_group (abfd, group)
1396 bfd *abfd ATTRIBUTE_UNUSED;
1397 asection *group ATTRIBUTE_UNUSED;
b885599b 1398{
b34976b6 1399 return TRUE;
b885599b 1400}
This page took 0.286338 seconds and 4 git commands to generate.