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