Subversion Repositories Kolibri OS

Rev

Rev 5197 | Details | Compare with Previous | Last modification | View Log | RSS feed

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