1 /* `a.out' object-file definitions, including extensions to 64-bit fields */
6 /* This is the layout on disk of the 32-bit or 64-bit exec header. */
10 bfd_byte e_info[4]; /* magic number and stuff */
11 bfd_byte e_text[BYTES_IN_WORD]; /* length of text section in bytes */
12 bfd_byte e_data[BYTES_IN_WORD]; /* length of data section in bytes */
13 bfd_byte e_bss[BYTES_IN_WORD]; /* length of bss area in bytes */
14 bfd_byte e_syms[BYTES_IN_WORD]; /* length of symbol table in bytes */
15 bfd_byte e_entry[BYTES_IN_WORD]; /* start address */
16 bfd_byte e_trsize[BYTES_IN_WORD]; /* length of text relocation info */
17 bfd_byte e_drsize[BYTES_IN_WORD]; /* length of data relocation info */
20 #define EXEC_BYTES_SIZE (4 + BYTES_IN_WORD * 7)
22 /* By default, segment size is constant. But on some machines, it can
23 be a function of the a.out header (e.g. machine type). */
25 #define N_SEGSIZE(x) SEGMENT_SIZE
28 #define _N_HDROFF(x) (N_SEGSIZE(x) - EXEC_BYTES_SIZE)
29 /* address in an a.out of the text section. When demand paged, it's
30 set up a bit to make nothing at 0, when an object file it's 0.
31 There's a special hack case when the entry point is < TEXT_START_ADDR
32 for executables, then the real start is 0
35 #define N_TXTADDR(x) \
36 (N_MAGIC(x)==OMAGIC? 0 \
37 : (N_MAGIC(x) == ZMAGIC && (x).a_entry < TEXT_START_ADDR)? 0 \
40 /* offset in an a.out of the start of the text section. When demand
41 paged, this is the start of the file
44 #define N_TXTOFF(x) ( (N_MAGIC((x)) == ZMAGIC) ? 0 : EXEC_BYTES_SIZE)
46 #define OMAGIC 0x1001 /* Code indicating object file */
47 #define ZMAGIC 0x1002 /* Code indicating demand-paged executable. */
48 #define NMAGIC 0x1003 /* Code indicating pure executable. */
50 #define OMAGIC 0407 /* Code indicating object file or impure executable. */
51 #define NMAGIC 0410 /* Code indicating pure executable. */
52 #define ZMAGIC 0413 /* Code indicating demand-paged executable. */
55 #define N_BADMAG(x) (N_MAGIC(x) != OMAGIC \
56 && N_MAGIC(x) != NMAGIC \
57 && N_MAGIC(x) != ZMAGIC)
61 #define N_DATADDR(x) \
62 (N_MAGIC(x)==OMAGIC? (N_TXTADDR(x)+(x).a_text) \
63 : (N_SEGSIZE(x) + ((N_TXTADDR(x)+(x).a_text-1) & ~(N_SEGSIZE(x)-1))))
65 #define N_BSSADDR(x) (N_DATADDR(x) + (x).a_data)
68 #define N_DATOFF(x) ( N_TXTOFF(x) + (x).a_text )
69 #define N_TRELOFF(x) ( N_DATOFF(x) + (x).a_data )
70 #define N_DRELOFF(x) ( N_TRELOFF(x) + (x).a_trsize )
71 #define N_SYMOFF(x) ( N_DRELOFF(x) + (x).a_drsize )
72 #define N_STROFF(x) ( N_SYMOFF(x) + (x).a_syms )
76 struct external_nlist {
77 bfd_byte e_strx[BYTES_IN_WORD]; /* index into string table of name */
78 bfd_byte e_type[1]; /* type of symbol */
79 bfd_byte e_other[1]; /* misc info (usually empty) */
80 bfd_byte e_desc[2]; /* description field */
81 bfd_byte e_value[BYTES_IN_WORD]; /* value of symbol */
84 #define EXTERNAL_NLIST_SIZE (BYTES_IN_WORD+4+BYTES_IN_WORD)
86 struct internal_nlist {
87 unsigned long n_strx; /* index into string table of name */
88 unsigned char n_type; /* type of symbol */
89 unsigned char n_other; /* misc info (usually empty) */
90 unsigned short n_desc; /* description field */
91 bfd_vma n_value; /* value of symbol */
94 /* The n_type field is the symbol type, containing: */
96 #define N_UNDF 0 /* Undefined symbol */
97 #define N_ABS 2 /* Absolute symbol -- defined at particular addr */
98 #define N_TEXT 4 /* Text sym -- defined at offset in text seg */
99 #define N_DATA 6 /* Data sym -- defined at offset in data seg */
100 #define N_BSS 8 /* BSS sym -- defined at offset in zero'd seg */
101 #define N_COMM 0x12 /* Common symbol (visible after shared lib dynlink) */
102 #define N_FN 0x1f /* File name of .o file */
103 #define N_FN_SEQ 0x0C /* N_FN from Sequent compilers (sigh) */
104 /* Note: N_EXT can only be usefully OR-ed with N_UNDF, N_ABS, N_TEXT,
105 N_DATA, or N_BSS. When the low-order bit of other types is set,
106 (e.g. N_WARNING versus N_FN), they are two different types. */
107 #define N_EXT 1 /* External symbol (as opposed to local-to-this-file) */
109 #define N_STAB 0xe0 /* If any of these bits are on, it's a debug symbol */
113 /* The following symbols refer to set elements.
114 All the N_SET[ATDB] symbols with the same name form one set.
115 Space is allocated for the set in the text section, and each set
116 elements value is stored into one word of the space.
117 The first word of the space is the length of the set (number of elements).
119 The address of the set is made into an N_SETV symbol
120 whose name is the same as the name of the set.
121 This symbol acts like a N_DATA global symbol
122 in that it can satisfy undefined external references. */
124 /* These appear as input to LD, in a .o file. */
125 #define N_SETA 0x14 /* Absolute set element symbol */
126 #define N_SETT 0x16 /* Text set element symbol */
127 #define N_SETD 0x18 /* Data set element symbol */
128 #define N_SETB 0x1A /* Bss set element symbol */
130 /* This is output from LD. */
131 #define N_SETV 0x1C /* Pointer to set vector in data area. */
133 /* Warning symbol. The text gives a warning message, the next symbol
134 in the table will be undefined. When the symbol is referenced, the
135 message is printed. */
137 #define N_WARNING 0x1e
141 There are two types of relocation flavours for a.out systems,
142 standard and extended. The standard form is used on systems where the
143 instruction has room for all the bits of an offset to the operand, whilst
144 the extended form is used when an address operand has to be split over n
145 instructions. Eg, on the 68k, each move instruction can reference
146 the target with a displacement of 16 or 32 bits. On the sparc, move
147 instructions use an offset of 14 bits, so the offset is stored in
148 the reloc field, and the data in the section is ignored.
151 /* This structure describes a single relocation to be performed.
152 The text-relocation section of the file is a vector of these structures,
153 all of which apply to the text section.
154 Likewise, the data-relocation section applies to the data section. */
156 struct reloc_std_external {
157 bfd_byte r_address[BYTES_IN_WORD]; /* offset of of data to relocate */
158 bfd_byte r_index[3]; /* symbol table index of symbol */
159 bfd_byte r_type[1]; /* relocation type */
162 #define RELOC_STD_BITS_PCREL_BIG 0x80
163 #define RELOC_STD_BITS_PCREL_LITTLE 0x01
165 #define RELOC_STD_BITS_LENGTH_BIG 0x60
166 #define RELOC_STD_BITS_LENGTH_SH_BIG 5 /* To shift to units place */
167 #define RELOC_STD_BITS_LENGTH_LITTLE 0x06
168 #define RELOC_STD_BITS_LENGTH_SH_LITTLE 1
170 #define RELOC_STD_BITS_EXTERN_BIG 0x10
171 #define RELOC_STD_BITS_EXTERN_LITTLE 0x08
173 #define RELOC_STD_BITS_BASEREL_BIG 0x08
174 #define RELOC_STD_BITS_BASEREL_LITTLE 0x08
176 #define RELOC_STD_BITS_JMPTABLE_BIG 0x04
177 #define RELOC_STD_BITS_JMPTABLE_LITTLE 0x04
179 #define RELOC_STD_BITS_RELATIVE_BIG 0x02
180 #define RELOC_STD_BITS_RELATIVE_LITTLE 0x02
182 #define RELOC_STD_SIZE (BYTES_IN_WORD + 3 + 1) /* Bytes per relocation entry */
184 struct reloc_std_internal
186 bfd_vma r_address; /* Address (within segment) to be relocated. */
187 /* The meaning of r_symbolnum depends on r_extern. */
188 unsigned int r_symbolnum:24;
189 /* Nonzero means value is a pc-relative offset
190 and it should be relocated for changes in its own address
191 as well as for changes in the symbol or section specified. */
192 unsigned int r_pcrel:1;
193 /* Length (as exponent of 2) of the field to be relocated.
194 Thus, a value of 2 indicates 1<<2 bytes. */
195 unsigned int r_length:2;
196 /* 1 => relocate with value of symbol.
197 r_symbolnum is the index of the symbol
198 in files the symbol table.
199 0 => relocate with the address of a segment.
200 r_symbolnum is N_TEXT, N_DATA, N_BSS or N_ABS
201 (the N_EXT bit may be set also, but signifies nothing). */
202 unsigned int r_extern:1;
203 /* The next three bits are for SunOS shared libraries, and seem to
205 unsigned int r_baserel:1; /* Linkage table relative */
206 unsigned int r_jmptable:1; /* pc-relative to jump table */
207 unsigned int r_relative:1; /* "relative relocation" */
209 unsigned int r_pad:1; /* Padding -- set to zero */
213 /* EXTENDED RELOCS */
215 struct reloc_ext_external {
216 bfd_byte r_address[BYTES_IN_WORD]; /* offset of of data to relocate */
217 bfd_byte r_index[3]; /* symbol table index of symbol */
218 bfd_byte r_type[1]; /* relocation type */
219 bfd_byte r_addend[BYTES_IN_WORD]; /* datum addend */
222 #define RELOC_EXT_BITS_EXTERN_BIG 0x80
223 #define RELOC_EXT_BITS_EXTERN_LITTLE 0x01
225 #define RELOC_EXT_BITS_TYPE_BIG 0x1F
226 #define RELOC_EXT_BITS_TYPE_SH_BIG 0
227 #define RELOC_EXT_BITS_TYPE_LITTLE 0xF8
228 #define RELOC_EXT_BITS_TYPE_SH_LITTLE 3
230 /* Bytes per relocation entry */
231 #define RELOC_EXT_SIZE (BYTES_IN_WORD + 3 + 1 + BYTES_IN_WORD)
235 /* simple relocations */
236 RELOC_8, /* data[0:7] = addend + sv */
237 RELOC_16, /* data[0:15] = addend + sv */
238 RELOC_32, /* data[0:31] = addend + sv */
239 /* pc-rel displacement */
240 RELOC_DISP8, /* data[0:7] = addend - pc + sv */
241 RELOC_DISP16, /* data[0:15] = addend - pc + sv */
242 RELOC_DISP32, /* data[0:31] = addend - pc + sv */
244 RELOC_WDISP30, /* data[0:29] = (addend + sv - pc)>>2 */
245 RELOC_WDISP22, /* data[0:21] = (addend + sv - pc)>>2 */
246 RELOC_HI22, /* data[0:21] = (addend + sv)>>10 */
247 RELOC_22, /* data[0:21] = (addend + sv) */
248 RELOC_13, /* data[0:12] = (addend + sv) */
249 RELOC_LO10, /* data[0:9] = (addend + sv) */
252 /* P.I.C. (base-relative) */
253 RELOC_BASE10, /* Not sure - maybe we can do this the */
254 RELOC_BASE13, /* right way now */
256 /* for some sort of pc-rel P.I.C. (?) */
259 /* P.I.C. jump table */
261 /* reputedly for shared libraries somehow */
270 RELOC_HHI22, /* data[0:21] = (addend + sv) >> 42 */
271 RELOC_HLO10, /* data[0:9] = (addend + sv) >> 32 */
273 /* 29K relocation types */
278 /* All the new ones I can think of *//*v9*/
280 RELOC_64, /* data[0:63] = addend + sv *//*v9*/
281 RELOC_DISP64, /* data[0:63] = addend - pc + sv *//*v9*/
282 RELOC_WDISP21, /* data[0:20] = (addend + sv - pc)>>2 *//*v9*/
283 RELOC_DISP21, /* data[0:20] = addend - pc + sv *//*v9*/
284 RELOC_DISP14, /* data[0:13] = addend - pc + sv *//*v9*/
286 What are the other ones,
287 Since this is a clean slate, can we throw away the ones we dont
288 understand ? Should we sort the values ? What about using a
289 microcode format like the 68k ?
295 struct reloc_internal {
296 bfd_vma r_address; /* offset of of data to relocate */
297 long r_index; /* symbol table index of symbol */
298 enum reloc_type r_type; /* relocation type */
299 bfd_vma r_addend; /* datum addend */
303 Should the length of the string table be 4 bytes or 8 bytes ?
306 What about archive indexes ?
310 #endif /* __A_OUT_64_H__ */