Update copyright notices
[deliverable/binutils-gdb.git] / bfd / section.c
1 /* Object file "section" support for the BFD library.
2 Copyright 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
3 2000
4 Free Software Foundation, Inc.
5 Written by Cygnus Support.
6
7 This file is part of BFD, the Binary File Descriptor library.
8
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2 of the License, or
12 (at your option) any later version.
13
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
18
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
22
23 /*
24 SECTION
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
41 INODE
42 Section Input, Section Output, Sections, Sections
43 SUBSECTION
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
74 INODE
75 Section Output, typedef asection, Section Input, Sections
76
77 SUBSECTION
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
115 SUBSECTION
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
136 #include "bfd.h"
137 #include "sysdep.h"
138 #include "libbfd.h"
139 #include "bfdlink.h"
140
141 /*
142 DOCDD
143 INODE
144 typedef asection, section prototypes, Section Output, Sections
145 SUBSECTION
146 typedef asection
147
148 Here is the section structure:
149
150 CODE_FRAGMENT
151 .
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. *}
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;
167 .};
168 .
169 .typedef struct sec
170 .{
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. *}
173 .
174 . const char *name;
175 .
176 . {* A unique sequence number. *}
177 .
178 . int id;
179 .
180 . {* Which section is it; 0..nth. *}
181 .
182 . int index;
183 .
184 . {* The next section in the list belonging to the BFD, or NULL. *}
185 .
186 . struct sec *next;
187 .
188 . {* The field flags contains attributes of the section. Some
189 . flags are read in from the object file, and some are
190 . synthesized from other information. *}
191 .
192 . flagword flags;
193 .
194 .#define SEC_NO_FLAGS 0x000
195 .
196 . {* Tells the OS to allocate space for this section when loading.
197 . This is clear for a section containing debug information only. *}
198 .#define SEC_ALLOC 0x001
199 .
200 . {* Tells the OS to load the section from the file when loading.
201 . This is clear for a .bss section. *}
202 .#define SEC_LOAD 0x002
203 .
204 . {* The section contains data still to be relocated, so there is
205 . some relocation information too. *}
206 .#define SEC_RELOC 0x004
207 .
208 .#if 0 {* Obsolete ? *}
209 .#define SEC_BALIGN 0x008
210 .#endif
211 .
212 . {* A signal to the OS that the section contains read only data. *}
213 .#define SEC_READONLY 0x010
214 .
215 . {* The section contains code only. *}
216 .#define SEC_CODE 0x020
217 .
218 . {* The section contains data only. *}
219 .#define SEC_DATA 0x040
220 .
221 . {* The section will reside in ROM. *}
222 .#define SEC_ROM 0x080
223 .
224 . {* The section contains constructor information. This section
225 . type is used by the linker to create lists of constructors and
226 . destructors used by <<g++>>. When a back end sees a symbol
227 . which should be used in a constructor list, it creates a new
228 . section for the type of name (e.g., <<__CTOR_LIST__>>), attaches
229 . the symbol to it, and builds a relocation. To build the lists
230 . of constructors, all the linker has to do is catenate all the
231 . sections called <<__CTOR_LIST__>> and relocate the data
232 . contained within - exactly the operations it would peform on
233 . standard data. *}
234 .#define SEC_CONSTRUCTOR 0x100
235 .
236 . {* The section is a constructor, and should be placed at the
237 . end of the text, data, or bss section(?). *}
238 .#define SEC_CONSTRUCTOR_TEXT 0x1100
239 .#define SEC_CONSTRUCTOR_DATA 0x2100
240 .#define SEC_CONSTRUCTOR_BSS 0x3100
241 .
242 . {* The section has contents - a data section could be
243 . <<SEC_ALLOC>> | <<SEC_HAS_CONTENTS>>; a debug section could be
244 . <<SEC_HAS_CONTENTS>> *}
245 .#define SEC_HAS_CONTENTS 0x200
246 .
247 . {* An instruction to the linker to not output the section
248 . even if it has information which would normally be written. *}
249 .#define SEC_NEVER_LOAD 0x400
250 .
251 . {* The section is a COFF shared library section. This flag is
252 . only for the linker. If this type of section appears in
253 . the input file, the linker must copy it to the output file
254 . without changing the vma or size. FIXME: Although this
255 . was originally intended to be general, it really is COFF
256 . specific (and the flag was renamed to indicate this). It
257 . might be cleaner to have some more general mechanism to
258 . allow the back end to control what the linker does with
259 . sections. *}
260 .#define SEC_COFF_SHARED_LIBRARY 0x800
261 .
262 . {* The section has GOT references. This flag is only for the
263 . linker, and is currently only used by the elf32-hppa back end.
264 . It will be set if global offset table references were detected
265 . in this section, which indicate to the linker that the section
266 . contains PIC code, and must be handled specially when doing a
267 . static link. *}
268 .#define SEC_HAS_GOT_REF 0x4000
269 .
270 . {* The section contains common symbols (symbols may be defined
271 . multiple times, the value of a symbol is the amount of
272 . space it requires, and the largest symbol value is the one
273 . used). Most targets have exactly one of these (which we
274 . translate to bfd_com_section_ptr), but ECOFF has two. *}
275 .#define SEC_IS_COMMON 0x8000
276 .
277 . {* The section contains only debugging information. For
278 . example, this is set for ELF .debug and .stab sections.
279 . strip tests this flag to see if a section can be
280 . discarded. *}
281 .#define SEC_DEBUGGING 0x10000
282 .
283 . {* The contents of this section are held in memory pointed to
284 . by the contents field. This is checked by bfd_get_section_contents,
285 . and the data is retrieved from memory if appropriate. *}
286 .#define SEC_IN_MEMORY 0x20000
287 .
288 . {* The contents of this section are to be excluded by the
289 . linker for executable and shared objects unless those
290 . objects are to be further relocated. *}
291 .#define SEC_EXCLUDE 0x40000
292 .
293 . {* The contents of this section are to be sorted by the
294 . based on the address specified in the associated symbol
295 . table. *}
296 .#define SEC_SORT_ENTRIES 0x80000
297 .
298 . {* When linking, duplicate sections of the same name should be
299 . discarded, rather than being combined into a single section as
300 . is usually done. This is similar to how common symbols are
301 . handled. See SEC_LINK_DUPLICATES below. *}
302 .#define SEC_LINK_ONCE 0x100000
303 .
304 . {* If SEC_LINK_ONCE is set, this bitfield describes how the linker
305 . should handle duplicate sections. *}
306 .#define SEC_LINK_DUPLICATES 0x600000
307 .
308 . {* This value for SEC_LINK_DUPLICATES means that duplicate
309 . sections with the same name should simply be discarded. *}
310 .#define SEC_LINK_DUPLICATES_DISCARD 0x0
311 .
312 . {* This value for SEC_LINK_DUPLICATES means that the linker
313 . should warn if there are any duplicate sections, although
314 . it should still only link one copy. *}
315 .#define SEC_LINK_DUPLICATES_ONE_ONLY 0x200000
316 .
317 . {* This value for SEC_LINK_DUPLICATES means that the linker
318 . should warn if any duplicate sections are a different size. *}
319 .#define SEC_LINK_DUPLICATES_SAME_SIZE 0x400000
320 .
321 . {* This value for SEC_LINK_DUPLICATES means that the linker
322 . should warn if any duplicate sections contain different
323 . contents. *}
324 .#define SEC_LINK_DUPLICATES_SAME_CONTENTS 0x600000
325 .
326 . {* This section was created by the linker as part of dynamic
327 . relocation or other arcane processing. It is skipped when
328 . going through the first-pass output, trusting that someone
329 . else up the line will take care of it later. *}
330 .#define SEC_LINKER_CREATED 0x800000
331 .
332 . {* This section should not be subject to garbage collection. *}
333 .#define SEC_KEEP 0x1000000
334 .
335 . {* This section contains "short" data, and should be placed
336 . "near" the GP. *}
337 .#define SEC_SMALL_DATA 0x2000000
338 .
339 . {* This section contains data which may be shared with other
340 . executables or shared objects. *}
341 .#define SEC_SHARED 0x4000000
342 .
343 . {* When a section with this flag is being linked, then if the size of
344 . the input section is less than a page, it should not cross a page
345 . boundary. If the size of the input section is one page or more, it
346 . should be aligned on a page boundary. *}
347 .#define SEC_BLOCK 0x8000000
348 .
349 . {* Conditionally link this section; do not link if there are no
350 . references found to any symbol in the section. *}
351 .#define SEC_CLINK 0x10000000
352 .
353 . {* End of section flags. *}
354 .
355 . {* Some internal packed boolean fields. *}
356 .
357 . {* See the vma field. *}
358 . unsigned int user_set_vma : 1;
359 .
360 . {* Whether relocations have been processed. *}
361 . unsigned int reloc_done : 1;
362 .
363 . {* A mark flag used by some of the linker backends. *}
364 . unsigned int linker_mark : 1;
365 .
366 . {* A mark flag used by some linker backends for garbage collection. *}
367 . unsigned int gc_mark : 1;
368 .
369 . {* Used by the ELF code to mark sections which have been allocated to segments. *}
370 . unsigned int segment_mark : 1;
371 .
372 . {* End of internal packed boolean fields. *}
373 .
374 . {* The virtual memory address of the section - where it will be
375 . at run time. The symbols are relocated against this. The
376 . user_set_vma flag is maintained by bfd; if it's not set, the
377 . backend can assign addresses (for example, in <<a.out>>, where
378 . the default address for <<.data>> is dependent on the specific
379 . target and various flags). *}
380 .
381 . bfd_vma vma;
382 .
383 . {* The load address of the section - where it would be in a
384 . rom image; really only used for writing section header
385 . information. *}
386 .
387 . bfd_vma lma;
388 .
389 . {* The size of the section in octets, as it will be output.
390 . Contains a value even if the section has no contents (e.g., the
391 . size of <<.bss>>). This will be filled in after relocation. *}
392 .
393 . bfd_size_type _cooked_size;
394 .
395 . {* The original size on disk of the section, in octets. Normally this
396 . value is the same as the size, but if some relaxing has
397 . been done, then this value will be bigger. *}
398 .
399 . bfd_size_type _raw_size;
400 .
401 . {* If this section is going to be output, then this value is the
402 . offset in *bytes* into the output section of the first byte in the
403 . input section (byte ==> smallest addressable unit on the
404 . target). In most cases, if this was going to start at the
405 . 100th octet (8-bit quantity) in the output section, this value
406 . would be 100. However, if the target byte size is 16 bits
407 . (bfd_octets_per_byte is "2"), this value would be 50. *}
408 .
409 . bfd_vma output_offset;
410 .
411 . {* The output section through which to map on output. *}
412 .
413 . struct sec *output_section;
414 .
415 . {* The alignment requirement of the section, as an exponent of 2 -
416 . e.g., 3 aligns to 2^3 (or 8). *}
417 .
418 . unsigned int alignment_power;
419 .
420 . {* If an input section, a pointer to a vector of relocation
421 . records for the data in this section. *}
422 .
423 . struct reloc_cache_entry *relocation;
424 .
425 . {* If an output section, a pointer to a vector of pointers to
426 . relocation records for the data in this section. *}
427 .
428 . struct reloc_cache_entry **orelocation;
429 .
430 . {* The number of relocation records in one of the above *}
431 .
432 . unsigned reloc_count;
433 .
434 . {* Information below is back end specific - and not always used
435 . or updated. *}
436 .
437 . {* File position of section data. *}
438 .
439 . file_ptr filepos;
440 .
441 . {* File position of relocation info. *}
442 .
443 . file_ptr rel_filepos;
444 .
445 . {* File position of line data. *}
446 .
447 . file_ptr line_filepos;
448 .
449 . {* Pointer to data for applications. *}
450 .
451 . PTR userdata;
452 .
453 . {* If the SEC_IN_MEMORY flag is set, this points to the actual
454 . contents. *}
455 . unsigned char *contents;
456 .
457 . {* Attached line number information. *}
458 .
459 . alent *lineno;
460 .
461 . {* Number of line number records. *}
462 .
463 . unsigned int lineno_count;
464 .
465 . {* Optional information about a COMDAT entry; NULL if not COMDAT. *}
466 .
467 . struct bfd_comdat_info *comdat;
468 .
469 . {* Points to the kept section if this section is a link-once section,
470 . and is discarded. *}
471 . struct sec *kept_section;
472 .
473 . {* When a section is being output, this value changes as more
474 . linenumbers are written out. *}
475 .
476 . file_ptr moving_line_filepos;
477 .
478 . {* What the section number is in the target world. *}
479 .
480 . int target_index;
481 .
482 . PTR used_by_bfd;
483 .
484 . {* If this is a constructor section then here is a list of the
485 . relocations created to relocate items within it. *}
486 .
487 . struct relent_chain *constructor_chain;
488 .
489 . {* The BFD which owns the section. *}
490 .
491 . bfd *owner;
492 .
493 . {* A symbol which points at this section only *}
494 . struct symbol_cache_entry *symbol;
495 . struct symbol_cache_entry **symbol_ptr_ptr;
496 .
497 . struct bfd_link_order *link_order_head;
498 . struct bfd_link_order *link_order_tail;
499 .} asection ;
500 .
501 .{* These sections are global, and are managed by BFD. The application
502 . and target back end are not permitted to change the values in
503 . these sections. New code should use the section_ptr macros rather
504 . than referring directly to the const sections. The const sections
505 . may eventually vanish. *}
506 .#define BFD_ABS_SECTION_NAME "*ABS*"
507 .#define BFD_UND_SECTION_NAME "*UND*"
508 .#define BFD_COM_SECTION_NAME "*COM*"
509 .#define BFD_IND_SECTION_NAME "*IND*"
510 .
511 .{* the absolute section *}
512 .extern const asection bfd_abs_section;
513 .#define bfd_abs_section_ptr ((asection *) &bfd_abs_section)
514 .#define bfd_is_abs_section(sec) ((sec) == bfd_abs_section_ptr)
515 .{* Pointer to the undefined section *}
516 .extern const asection bfd_und_section;
517 .#define bfd_und_section_ptr ((asection *) &bfd_und_section)
518 .#define bfd_is_und_section(sec) ((sec) == bfd_und_section_ptr)
519 .{* Pointer to the common section *}
520 .extern const asection bfd_com_section;
521 .#define bfd_com_section_ptr ((asection *) &bfd_com_section)
522 .{* Pointer to the indirect section *}
523 .extern const asection bfd_ind_section;
524 .#define bfd_ind_section_ptr ((asection *) &bfd_ind_section)
525 .#define bfd_is_ind_section(sec) ((sec) == bfd_ind_section_ptr)
526 .
527 .extern const struct symbol_cache_entry * const bfd_abs_symbol;
528 .extern const struct symbol_cache_entry * const bfd_com_symbol;
529 .extern const struct symbol_cache_entry * const bfd_und_symbol;
530 .extern const struct symbol_cache_entry * const bfd_ind_symbol;
531 .#define bfd_get_section_size_before_reloc(section) \
532 . ((section)->reloc_done ? (abort (), (bfd_size_type) 1) \
533 . : (section)->_raw_size)
534 .#define bfd_get_section_size_after_reloc(section) \
535 . ((section)->reloc_done ? (section)->_cooked_size \
536 . : (abort (), (bfd_size_type) 1))
537 */
538
539 /* We use a macro to initialize the static asymbol structures because
540 traditional C does not permit us to initialize a union member while
541 gcc warns if we don't initialize it. */
542 /* the_bfd, name, value, attr, section [, udata] */
543 #ifdef __STDC__
544 #define GLOBAL_SYM_INIT(NAME, SECTION) \
545 { 0, NAME, 0, BSF_SECTION_SYM, (asection *) SECTION, { 0 }}
546 #else
547 #define GLOBAL_SYM_INIT(NAME, SECTION) \
548 { 0, NAME, 0, BSF_SECTION_SYM, (asection *) SECTION }
549 #endif
550
551 /* These symbols are global, not specific to any BFD. Therefore, anything
552 that tries to change them is broken, and should be repaired. */
553
554 static const asymbol global_syms[] =
555 {
556 GLOBAL_SYM_INIT (BFD_COM_SECTION_NAME, &bfd_com_section),
557 GLOBAL_SYM_INIT (BFD_UND_SECTION_NAME, &bfd_und_section),
558 GLOBAL_SYM_INIT (BFD_ABS_SECTION_NAME, &bfd_abs_section),
559 GLOBAL_SYM_INIT (BFD_IND_SECTION_NAME, &bfd_ind_section)
560 };
561
562 #define STD_SECTION(SEC, FLAGS, SYM, NAME, IDX) \
563 const asymbol * const SYM = (asymbol *) &global_syms[IDX]; \
564 const asection SEC = \
565 /* name, id, index, next, flags, user_set_vma, reloc_done, */ \
566 { NAME, IDX, 0, NULL, FLAGS, 0, 0, \
567 \
568 /* linker_mark, gc_mark, segment_mark, vma, lma, _cooked_size, */ \
569 0, 1, 0, 0, 0, 0, \
570 \
571 /* _raw_size, output_offset, output_section, alignment_power, */ \
572 0, 0, (struct sec *) &SEC, 0, \
573 \
574 /* relocation, orelocation, reloc_count, filepos, rel_filepos, */ \
575 NULL, NULL, 0, 0, 0, \
576 \
577 /* line_filepos, userdata, contents, lineno, lineno_count, */ \
578 0, NULL, NULL, NULL, 0, \
579 \
580 /* comdat, kept_section, moving_line_filepos, target_index, */ \
581 NULL, NULL, 0, 0, \
582 \
583 /* used_by_bfd, constructor_chain, owner, */ \
584 NULL, NULL, NULL, \
585 \
586 /* symbol, */ \
587 (struct symbol_cache_entry *) &global_syms[IDX], \
588 \
589 /* symbol_ptr_ptr, */ \
590 (struct symbol_cache_entry **) &SYM, \
591 \
592 /* link_order_head, link_order_tail */ \
593 NULL, NULL \
594 }
595
596 STD_SECTION (bfd_com_section, SEC_IS_COMMON, bfd_com_symbol,
597 BFD_COM_SECTION_NAME, 0);
598 STD_SECTION (bfd_und_section, 0, bfd_und_symbol, BFD_UND_SECTION_NAME, 1);
599 STD_SECTION (bfd_abs_section, 0, bfd_abs_symbol, BFD_ABS_SECTION_NAME, 2);
600 STD_SECTION (bfd_ind_section, 0, bfd_ind_symbol, BFD_IND_SECTION_NAME, 3);
601 #undef STD_SECTION
602
603 /*
604 DOCDD
605 INODE
606 section prototypes, , typedef asection, Sections
607 SUBSECTION
608 Section prototypes
609
610 These are the functions exported by the section handling part of BFD.
611 */
612
613 /*
614 FUNCTION
615 bfd_get_section_by_name
616
617 SYNOPSIS
618 asection *bfd_get_section_by_name(bfd *abfd, const char *name);
619
620 DESCRIPTION
621 Run through @var{abfd} and return the one of the
622 <<asection>>s whose name matches @var{name}, otherwise <<NULL>>.
623 @xref{Sections}, for more information.
624
625 This should only be used in special cases; the normal way to process
626 all sections of a given name is to use <<bfd_map_over_sections>> and
627 <<strcmp>> on the name (or better yet, base it on the section flags
628 or something else) for each section.
629 */
630
631 asection *
632 bfd_get_section_by_name (abfd, name)
633 bfd *abfd;
634 const char *name;
635 {
636 asection *sect;
637
638 for (sect = abfd->sections; sect != NULL; sect = sect->next)
639 if (!strcmp (sect->name, name))
640 return sect;
641 return NULL;
642 }
643
644 /*
645 FUNCTION
646 bfd_get_unique_section_name
647
648 SYNOPSIS
649 char *bfd_get_unique_section_name(bfd *abfd,
650 const char *templat,
651 int *count);
652
653 DESCRIPTION
654 Invent a section name that is unique in @var{abfd} by tacking
655 a dot and a digit suffix onto the original @var{templat}. If
656 @var{count} is non-NULL, then it specifies the first number
657 tried as a suffix to generate a unique name. The value
658 pointed to by @var{count} will be incremented in this case.
659 */
660
661 char *
662 bfd_get_unique_section_name (abfd, templat, count)
663 bfd *abfd;
664 const char *templat;
665 int *count;
666 {
667 int num;
668 unsigned int len;
669 char *sname;
670
671 len = strlen (templat);
672 sname = bfd_malloc (len + 8);
673 if (sname == NULL)
674 return NULL;
675 strcpy (sname, templat);
676 num = 1;
677 if (count != NULL)
678 num = *count;
679
680 do
681 {
682 /* If we have a million sections, something is badly wrong. */
683 if (num > 999999)
684 abort ();
685 sprintf (sname + len, ".%d", num++);
686 }
687 while (bfd_get_section_by_name (abfd, sname) != NULL);
688
689 if (count != NULL)
690 *count = num;
691 return sname;
692 }
693
694 /*
695 FUNCTION
696 bfd_make_section_old_way
697
698 SYNOPSIS
699 asection *bfd_make_section_old_way(bfd *abfd, const char *name);
700
701 DESCRIPTION
702 Create a new empty section called @var{name}
703 and attach it to the end of the chain of sections for the
704 BFD @var{abfd}. An attempt to create a section with a name which
705 is already in use returns its pointer without changing the
706 section chain.
707
708 It has the funny name since this is the way it used to be
709 before it was rewritten....
710
711 Possible errors are:
712 o <<bfd_error_invalid_operation>> -
713 If output has already started for this BFD.
714 o <<bfd_error_no_memory>> -
715 If memory allocation fails.
716
717 */
718
719 asection *
720 bfd_make_section_old_way (abfd, name)
721 bfd *abfd;
722 const char *name;
723 {
724 asection *sec = bfd_get_section_by_name (abfd, name);
725 if (sec == (asection *) NULL)
726 {
727 sec = bfd_make_section (abfd, name);
728 }
729 return sec;
730 }
731
732 /*
733 FUNCTION
734 bfd_make_section_anyway
735
736 SYNOPSIS
737 asection *bfd_make_section_anyway(bfd *abfd, const char *name);
738
739 DESCRIPTION
740 Create a new empty section called @var{name} and attach it to the end of
741 the chain of sections for @var{abfd}. Create a new section even if there
742 is already a section with that name.
743
744 Return <<NULL>> and set <<bfd_error>> on error; possible errors are:
745 o <<bfd_error_invalid_operation>> - If output has already started for @var{abfd}.
746 o <<bfd_error_no_memory>> - If memory allocation fails.
747 */
748
749 sec_ptr
750 bfd_make_section_anyway (abfd, name)
751 bfd *abfd;
752 const char *name;
753 {
754 static int section_id = 0x10; /* id 0 to 3 used by STD_SECTION. */
755 asection *newsect;
756 asection **prev = &abfd->sections;
757 asection *sect = abfd->sections;
758
759 if (abfd->output_has_begun)
760 {
761 bfd_set_error (bfd_error_invalid_operation);
762 return NULL;
763 }
764
765 while (sect)
766 {
767 prev = &sect->next;
768 sect = sect->next;
769 }
770
771 newsect = (asection *) bfd_zalloc (abfd, sizeof (asection));
772 if (newsect == NULL)
773 return NULL;
774
775 newsect->name = name;
776 newsect->id = section_id++;
777 newsect->index = abfd->section_count++;
778 newsect->flags = SEC_NO_FLAGS;
779
780 newsect->userdata = NULL;
781 newsect->contents = NULL;
782 newsect->next = (asection *) NULL;
783 newsect->relocation = (arelent *) NULL;
784 newsect->reloc_count = 0;
785 newsect->line_filepos = 0;
786 newsect->owner = abfd;
787 newsect->comdat = NULL;
788 newsect->kept_section = NULL;
789
790 /* Create a symbol whos only job is to point to this section. This is
791 useful for things like relocs which are relative to the base of a
792 section. */
793 newsect->symbol = bfd_make_empty_symbol (abfd);
794 if (newsect->symbol == NULL)
795 {
796 bfd_release (abfd, newsect);
797 return NULL;
798 }
799 newsect->symbol->name = name;
800 newsect->symbol->value = 0;
801 newsect->symbol->section = newsect;
802 newsect->symbol->flags = BSF_SECTION_SYM;
803
804 newsect->symbol_ptr_ptr = &newsect->symbol;
805
806 if (BFD_SEND (abfd, _new_section_hook, (abfd, newsect)) != true)
807 {
808 bfd_release (abfd, newsect);
809 return NULL;
810 }
811
812 *prev = newsect;
813 return newsect;
814 }
815
816 /*
817 FUNCTION
818 bfd_make_section
819
820 SYNOPSIS
821 asection *bfd_make_section(bfd *, const char *name);
822
823 DESCRIPTION
824 Like <<bfd_make_section_anyway>>, but return <<NULL>> (without calling
825 bfd_set_error ()) without changing the section chain if there is already a
826 section named @var{name}. If there is an error, return <<NULL>> and set
827 <<bfd_error>>.
828 */
829
830 asection *
831 bfd_make_section (abfd, name)
832 bfd *abfd;
833 const char *name;
834 {
835 asection *sect = abfd->sections;
836
837 if (strcmp (name, BFD_ABS_SECTION_NAME) == 0)
838 {
839 return bfd_abs_section_ptr;
840 }
841 if (strcmp (name, BFD_COM_SECTION_NAME) == 0)
842 {
843 return bfd_com_section_ptr;
844 }
845 if (strcmp (name, BFD_UND_SECTION_NAME) == 0)
846 {
847 return bfd_und_section_ptr;
848 }
849
850 if (strcmp (name, BFD_IND_SECTION_NAME) == 0)
851 {
852 return bfd_ind_section_ptr;
853 }
854
855 while (sect)
856 {
857 if (!strcmp (sect->name, name))
858 return NULL;
859 sect = sect->next;
860 }
861
862 /* The name is not already used; go ahead and make a new section. */
863 return bfd_make_section_anyway (abfd, name);
864 }
865
866 /*
867 FUNCTION
868 bfd_set_section_flags
869
870 SYNOPSIS
871 boolean bfd_set_section_flags(bfd *abfd, asection *sec, flagword flags);
872
873 DESCRIPTION
874 Set the attributes of the section @var{sec} in the BFD
875 @var{abfd} to the value @var{flags}. Return <<true>> on success,
876 <<false>> on error. Possible error returns are:
877
878 o <<bfd_error_invalid_operation>> -
879 The section cannot have one or more of the attributes
880 requested. For example, a .bss section in <<a.out>> may not
881 have the <<SEC_HAS_CONTENTS>> field set.
882
883 */
884
885 /*ARGSUSED*/
886 boolean
887 bfd_set_section_flags (abfd, section, flags)
888 bfd *abfd ATTRIBUTE_UNUSED;
889 sec_ptr section;
890 flagword flags;
891 {
892 #if 0
893 /* If you try to copy a text section from an input file (where it
894 has the SEC_CODE flag set) to an output file, this loses big if
895 the bfd_applicable_section_flags (abfd) doesn't have the SEC_CODE
896 set - which it doesn't, at least not for a.out. FIXME */
897
898 if ((flags & bfd_applicable_section_flags (abfd)) != flags)
899 {
900 bfd_set_error (bfd_error_invalid_operation);
901 return false;
902 }
903 #endif
904
905 section->flags = flags;
906 return true;
907 }
908
909 /*
910 FUNCTION
911 bfd_map_over_sections
912
913 SYNOPSIS
914 void bfd_map_over_sections(bfd *abfd,
915 void (*func) (bfd *abfd,
916 asection *sect,
917 PTR obj),
918 PTR obj);
919
920 DESCRIPTION
921 Call the provided function @var{func} for each section
922 attached to the BFD @var{abfd}, passing @var{obj} as an
923 argument. The function will be called as if by
924
925 | func(abfd, the_section, obj);
926
927 This is the prefered method for iterating over sections; an
928 alternative would be to use a loop:
929
930 | section *p;
931 | for (p = abfd->sections; p != NULL; p = p->next)
932 | func(abfd, p, ...)
933
934 */
935
936 /*VARARGS2*/
937 void
938 bfd_map_over_sections (abfd, operation, user_storage)
939 bfd *abfd;
940 void (*operation) PARAMS ((bfd * abfd, asection * sect, PTR obj));
941 PTR user_storage;
942 {
943 asection *sect;
944 unsigned int i = 0;
945
946 for (sect = abfd->sections; sect != NULL; i++, sect = sect->next)
947 (*operation) (abfd, sect, user_storage);
948
949 if (i != abfd->section_count) /* Debugging */
950 abort ();
951 }
952
953 /*
954 FUNCTION
955 bfd_set_section_size
956
957 SYNOPSIS
958 boolean bfd_set_section_size(bfd *abfd, asection *sec, bfd_size_type val);
959
960 DESCRIPTION
961 Set @var{sec} to the size @var{val}. If the operation is
962 ok, then <<true>> is returned, else <<false>>.
963
964 Possible error returns:
965 o <<bfd_error_invalid_operation>> -
966 Writing has started to the BFD, so setting the size is invalid.
967
968 */
969
970 boolean
971 bfd_set_section_size (abfd, ptr, val)
972 bfd *abfd;
973 sec_ptr ptr;
974 bfd_size_type val;
975 {
976 /* Once you've started writing to any section you cannot create or change
977 the size of any others. */
978
979 if (abfd->output_has_begun)
980 {
981 bfd_set_error (bfd_error_invalid_operation);
982 return false;
983 }
984
985 ptr->_cooked_size = val;
986 ptr->_raw_size = val;
987
988 return true;
989 }
990
991 /*
992 FUNCTION
993 bfd_set_section_contents
994
995 SYNOPSIS
996 boolean bfd_set_section_contents
997 (bfd *abfd,
998 asection *section,
999 PTR data,
1000 file_ptr offset,
1001 bfd_size_type count);
1002
1003 DESCRIPTION
1004 Sets the contents of the section @var{section} in BFD
1005 @var{abfd} to the data starting in memory at @var{data}. The
1006 data is written to the output section starting at offset
1007 @var{offset} for @var{count} octets.
1008
1009 Normally <<true>> is returned, else <<false>>. Possible error
1010 returns are:
1011 o <<bfd_error_no_contents>> -
1012 The output section does not have the <<SEC_HAS_CONTENTS>>
1013 attribute, so nothing can be written to it.
1014 o and some more too
1015
1016 This routine is front end to the back end function
1017 <<_bfd_set_section_contents>>.
1018
1019 */
1020
1021 #define bfd_get_section_size_now(abfd,sec) \
1022 (sec->reloc_done \
1023 ? bfd_get_section_size_after_reloc (sec) \
1024 : bfd_get_section_size_before_reloc (sec))
1025
1026 boolean
1027 bfd_set_section_contents (abfd, section, location, offset, count)
1028 bfd *abfd;
1029 sec_ptr section;
1030 PTR location;
1031 file_ptr offset;
1032 bfd_size_type count;
1033 {
1034 bfd_size_type sz;
1035
1036 if (!(bfd_get_section_flags (abfd, section) & SEC_HAS_CONTENTS))
1037 {
1038 bfd_set_error (bfd_error_no_contents);
1039 return (false);
1040 }
1041
1042 if (offset < 0)
1043 {
1044 bad_val:
1045 bfd_set_error (bfd_error_bad_value);
1046 return false;
1047 }
1048 sz = bfd_get_section_size_now (abfd, section);
1049 if ((bfd_size_type) offset > sz
1050 || count > sz
1051 || offset + count > sz)
1052 goto bad_val;
1053
1054 switch (abfd->direction)
1055 {
1056 case read_direction:
1057 case no_direction:
1058 bfd_set_error (bfd_error_invalid_operation);
1059 return false;
1060
1061 case write_direction:
1062 break;
1063
1064 case both_direction:
1065 /* File is opened for update. `output_has_begun' some time ago when
1066 the file was created. Do not recompute sections sizes or alignments
1067 in _bfd_set_section_content. */
1068 abfd->output_has_begun = true;
1069 break;
1070 }
1071
1072 /* Record a copy of the data in memory if desired. */
1073 if (section->contents
1074 && location != section->contents + offset)
1075 memcpy (section->contents + offset, location, count);
1076
1077 if (BFD_SEND (abfd, _bfd_set_section_contents,
1078 (abfd, section, location, offset, count)))
1079 {
1080 abfd->output_has_begun = true;
1081 return true;
1082 }
1083
1084 return false;
1085 }
1086
1087 /*
1088 FUNCTION
1089 bfd_get_section_contents
1090
1091 SYNOPSIS
1092 boolean bfd_get_section_contents
1093 (bfd *abfd, asection *section, PTR location,
1094 file_ptr offset, bfd_size_type count);
1095
1096 DESCRIPTION
1097 Read data from @var{section} in BFD @var{abfd}
1098 into memory starting at @var{location}. The data is read at an
1099 offset of @var{offset} from the start of the input section,
1100 and is read for @var{count} bytes.
1101
1102 If the contents of a constructor with the <<SEC_CONSTRUCTOR>>
1103 flag set are requested or if the section does not have the
1104 <<SEC_HAS_CONTENTS>> flag set, then the @var{location} is filled
1105 with zeroes. If no errors occur, <<true>> is returned, else
1106 <<false>>.
1107
1108 */
1109 boolean
1110 bfd_get_section_contents (abfd, section, location, offset, count)
1111 bfd *abfd;
1112 sec_ptr section;
1113 PTR location;
1114 file_ptr offset;
1115 bfd_size_type count;
1116 {
1117 bfd_size_type sz;
1118
1119 if (section->flags & SEC_CONSTRUCTOR)
1120 {
1121 memset (location, 0, (unsigned) count);
1122 return true;
1123 }
1124
1125 if (offset < 0)
1126 {
1127 bad_val:
1128 bfd_set_error (bfd_error_bad_value);
1129 return false;
1130 }
1131 /* Even if reloc_done is true, this function reads unrelocated
1132 contents, so we want the raw size. */
1133 sz = section->_raw_size;
1134 if ((bfd_size_type) offset > sz || count > sz || offset + count > sz)
1135 goto bad_val;
1136
1137 if (count == 0)
1138 /* Don't bother. */
1139 return true;
1140
1141 if ((section->flags & SEC_HAS_CONTENTS) == 0)
1142 {
1143 memset (location, 0, (unsigned) count);
1144 return true;
1145 }
1146
1147 if ((section->flags & SEC_IN_MEMORY) != 0)
1148 {
1149 memcpy (location, section->contents + offset, (size_t) count);
1150 return true;
1151 }
1152
1153 return BFD_SEND (abfd, _bfd_get_section_contents,
1154 (abfd, section, location, offset, count));
1155 }
1156
1157 /*
1158 FUNCTION
1159 bfd_copy_private_section_data
1160
1161 SYNOPSIS
1162 boolean bfd_copy_private_section_data(bfd *ibfd, asection *isec, bfd *obfd, asection *osec);
1163
1164 DESCRIPTION
1165 Copy private section information from @var{isec} in the BFD
1166 @var{ibfd} to the section @var{osec} in the BFD @var{obfd}.
1167 Return <<true>> on success, <<false>> on error. Possible error
1168 returns are:
1169
1170 o <<bfd_error_no_memory>> -
1171 Not enough memory exists to create private data for @var{osec}.
1172
1173 .#define bfd_copy_private_section_data(ibfd, isection, obfd, osection) \
1174 . BFD_SEND (obfd, _bfd_copy_private_section_data, \
1175 . (ibfd, isection, obfd, osection))
1176 */
1177
1178 /*
1179 FUNCTION
1180 _bfd_strip_section_from_output
1181
1182 SYNOPSIS
1183 void _bfd_strip_section_from_output
1184 (struct bfd_link_info *info, asection *section);
1185
1186 DESCRIPTION
1187 Remove @var{section} from the output. If the output section
1188 becomes empty, remove it from the output bfd. @var{info} may
1189 be NULL; if it is not, it is used to decide whether the output
1190 section is empty.
1191 */
1192 void
1193 _bfd_strip_section_from_output (info, s)
1194 struct bfd_link_info *info;
1195 asection *s;
1196 {
1197 asection **spp, *os;
1198 struct bfd_link_order *p, *pp;
1199 boolean keep_os;
1200
1201 /* Excise the input section from the link order.
1202
1203 FIXME: For all calls that I can see to this function, the link
1204 orders have not yet been set up. So why are we checking them? --
1205 Ian */
1206 os = s->output_section;
1207 for (p = os->link_order_head, pp = NULL; p != NULL; pp = p, p = p->next)
1208 if (p->type == bfd_indirect_link_order
1209 && p->u.indirect.section == s)
1210 {
1211 if (pp)
1212 pp->next = p->next;
1213 else
1214 os->link_order_head = p->next;
1215 if (!p->next)
1216 os->link_order_tail = pp;
1217 break;
1218 }
1219
1220 keep_os = os->link_order_head != NULL;
1221
1222 if (! keep_os && info != NULL)
1223 {
1224 bfd *abfd;
1225 for (abfd = info->input_bfds; abfd != NULL; abfd = abfd->link_next)
1226 {
1227 asection *is;
1228 for (is = abfd->sections; is != NULL; is = is->next)
1229 {
1230 if (is != s && is->output_section == os)
1231 break;
1232 }
1233 if (is != NULL)
1234 break;
1235 }
1236 if (abfd != NULL)
1237 keep_os = true;
1238 }
1239
1240 /* If the output section is empty, remove it too. Careful about sections
1241 that have been discarded in the link script -- they are mapped to
1242 bfd_abs_section, which has no owner. */
1243 if (!keep_os && os->owner != NULL)
1244 {
1245 for (spp = &os->owner->sections; *spp; spp = &(*spp)->next)
1246 if (*spp == os)
1247 {
1248 *spp = os->next;
1249 os->owner->section_count--;
1250 break;
1251 }
1252 }
1253 }
This page took 0.054531 seconds and 4 git commands to generate.