Commit | Line | Data |
---|---|---|
d9ad93bc KR |
1 | /* bfd back-end for HP PA-RISC SOM objects. |
2 | Copyright (C) 1990, 1991, 1992, 1993 Free Software Foundation, Inc. | |
3 | ||
4 | Contributed by the Center for Software Science at the | |
5 | University of Utah (pa-gdb-bugs@cs.utah.edu). | |
6 | ||
9e16fcf1 | 7 | This file is part of BFD, the Binary File Descriptor library. |
d9ad93bc | 8 | |
9e16fcf1 SG |
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. | |
d9ad93bc | 13 | |
9e16fcf1 SG |
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. | |
d9ad93bc | 18 | |
9e16fcf1 SG |
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., 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
d9ad93bc KR |
22 | |
23 | #include "bfd.h" | |
24 | #include "sysdep.h" | |
25 | ||
6941fd4d | 26 | #if defined (HOST_HPPAHPUX) || defined (HOST_HPPABSD) || defined (HOST_HPPAOSF) |
d9ad93bc KR |
27 | |
28 | #include "libbfd.h" | |
29 | #include "som.h" | |
30 | ||
31 | #include <stdio.h> | |
32 | #include <sys/types.h> | |
33 | #include <sys/param.h> | |
34 | #include <sys/dir.h> | |
35 | #include <signal.h> | |
36 | #include <machine/reg.h> | |
37 | #include <sys/user.h> /* After a.out.h */ | |
38 | #include <sys/file.h> | |
39 | #include <errno.h> | |
40 | ||
41 | /* Magic not defined in standard HP-UX header files until 8.0 */ | |
42 | ||
43 | #ifndef CPU_PA_RISC1_0 | |
44 | #define CPU_PA_RISC1_0 0x20B | |
45 | #endif /* CPU_PA_RISC1_0 */ | |
46 | ||
47 | #ifndef CPU_PA_RISC1_1 | |
48 | #define CPU_PA_RISC1_1 0x210 | |
49 | #endif /* CPU_PA_RISC1_1 */ | |
50 | ||
51 | #ifndef _PA_RISC1_0_ID | |
52 | #define _PA_RISC1_0_ID CPU_PA_RISC1_0 | |
53 | #endif /* _PA_RISC1_0_ID */ | |
54 | ||
55 | #ifndef _PA_RISC1_1_ID | |
56 | #define _PA_RISC1_1_ID CPU_PA_RISC1_1 | |
57 | #endif /* _PA_RISC1_1_ID */ | |
58 | ||
59 | #ifndef _PA_RISC_MAXID | |
60 | #define _PA_RISC_MAXID 0x2FF | |
61 | #endif /* _PA_RISC_MAXID */ | |
62 | ||
63 | #ifndef _PA_RISC_ID | |
64 | #define _PA_RISC_ID(__m_num) \ | |
65 | (((__m_num) == _PA_RISC1_0_ID) || \ | |
66 | ((__m_num) >= _PA_RISC1_1_ID && (__m_num) <= _PA_RISC_MAXID)) | |
67 | #endif /* _PA_RISC_ID */ | |
68 | ||
9d0dea6f JL |
69 | /* Size (in chars) of the temporary buffers used during fixup and string |
70 | table writes. */ | |
71 | ||
72 | #define SOM_TMP_BUFSIZE 8192 | |
73 | ||
6e033f86 JL |
74 | /* Size of the hash table in archives. */ |
75 | #define SOM_LST_HASH_SIZE 31 | |
76 | ||
77 | /* Max number of SOMs to be found in an archive. */ | |
78 | #define SOM_LST_MODULE_LIMIT 1024 | |
9d0dea6f | 79 | |
4fdb66cd JL |
80 | /* SOM allows any one of the four previous relocations to be reused |
81 | with a "R_PREV_FIXUP" relocation entry. Since R_PREV_FIXUP | |
82 | relocations are always a single byte, using a R_PREV_FIXUP instead | |
83 | of some multi-byte relocation makes object files smaller. | |
84 | ||
85 | Note one side effect of using a R_PREV_FIXUP is the relocation that | |
86 | is being repeated moves to the front of the queue. */ | |
87 | struct reloc_queue | |
88 | { | |
89 | unsigned char *reloc; | |
90 | unsigned int size; | |
91 | } reloc_queue[4]; | |
92 | ||
93 | /* This fully describes the symbol types which may be attached to | |
94 | an EXPORT or IMPORT directive. Only SOM uses this formation | |
95 | (ELF has no need for it). */ | |
96 | typedef enum | |
97 | { | |
98 | SYMBOL_TYPE_UNKNOWN, | |
99 | SYMBOL_TYPE_ABSOLUTE, | |
100 | SYMBOL_TYPE_CODE, | |
101 | SYMBOL_TYPE_DATA, | |
102 | SYMBOL_TYPE_ENTRY, | |
103 | SYMBOL_TYPE_MILLICODE, | |
104 | SYMBOL_TYPE_PLABEL, | |
105 | SYMBOL_TYPE_PRI_PROG, | |
106 | SYMBOL_TYPE_SEC_PROG, | |
107 | } pa_symbol_type; | |
108 | ||
017a52d7 JL |
109 | struct section_to_type |
110 | { | |
111 | char *section; | |
112 | char type; | |
113 | }; | |
114 | ||
6e033f86 JL |
115 | /* Assorted symbol information that needs to be derived from the BFD symbol |
116 | and/or the BFD backend private symbol data. */ | |
117 | struct som_misc_symbol_info | |
118 | { | |
119 | unsigned int symbol_type; | |
120 | unsigned int symbol_scope; | |
121 | unsigned int arg_reloc; | |
122 | unsigned int symbol_info; | |
123 | unsigned int symbol_value; | |
124 | }; | |
125 | ||
9e16fcf1 SG |
126 | /* Forward declarations */ |
127 | ||
128 | static boolean som_mkobject PARAMS ((bfd *)); | |
129 | static bfd_target * som_object_setup PARAMS ((bfd *, | |
130 | struct header *, | |
131 | struct som_exec_auxhdr *)); | |
132 | static asection * make_unique_section PARAMS ((bfd *, CONST char *, int)); | |
133 | static boolean setup_sections PARAMS ((bfd *, struct header *)); | |
134 | static bfd_target * som_object_p PARAMS ((bfd *)); | |
135 | static boolean som_write_object_contents PARAMS ((bfd *)); | |
136 | static boolean som_slurp_string_table PARAMS ((bfd *)); | |
137 | static unsigned int som_slurp_symbol_table PARAMS ((bfd *)); | |
138 | static unsigned int som_get_symtab_upper_bound PARAMS ((bfd *)); | |
139 | static unsigned int som_canonicalize_reloc PARAMS ((bfd *, sec_ptr, | |
140 | arelent **, asymbol **)); | |
141 | static unsigned int som_get_reloc_upper_bound PARAMS ((bfd *, sec_ptr)); | |
36456a67 JL |
142 | static unsigned int som_set_reloc_info PARAMS ((unsigned char *, unsigned int, |
143 | arelent *, asection *, | |
144 | asymbol **, boolean)); | |
145 | static boolean som_slurp_reloc_table PARAMS ((bfd *, asection *, | |
146 | asymbol **, boolean)); | |
9e16fcf1 SG |
147 | static unsigned int som_get_symtab PARAMS ((bfd *, asymbol **)); |
148 | static asymbol * som_make_empty_symbol PARAMS ((bfd *)); | |
149 | static void som_print_symbol PARAMS ((bfd *, PTR, | |
150 | asymbol *, bfd_print_symbol_type)); | |
151 | static boolean som_new_section_hook PARAMS ((bfd *, asection *)); | |
152 | static boolean som_set_section_contents PARAMS ((bfd *, sec_ptr, PTR, | |
153 | file_ptr, bfd_size_type)); | |
154 | static boolean som_set_arch_mach PARAMS ((bfd *, enum bfd_architecture, | |
155 | unsigned long)); | |
156 | static boolean som_find_nearest_line PARAMS ((bfd *, asection *, | |
157 | asymbol **, bfd_vma, | |
158 | CONST char **, | |
159 | CONST char **, | |
160 | unsigned int *)); | |
161 | static void som_get_symbol_info PARAMS ((bfd *, asymbol *, symbol_info *)); | |
162 | static asection * som_section_from_subspace_index PARAMS ((bfd *, | |
163 | unsigned int)); | |
164 | static int log2 PARAMS ((unsigned int)); | |
fcb0c846 JL |
165 | static bfd_reloc_status_type hppa_som_reloc PARAMS ((bfd *, arelent *, |
166 | asymbol *, PTR, | |
39961154 JL |
167 | asection *, bfd *, |
168 | char **)); | |
d125665c JL |
169 | static void som_initialize_reloc_queue PARAMS ((struct reloc_queue *)); |
170 | static void som_reloc_queue_insert PARAMS ((unsigned char *, unsigned int, | |
171 | struct reloc_queue *)); | |
172 | static void som_reloc_queue_fix PARAMS ((struct reloc_queue *, unsigned int)); | |
173 | static int som_reloc_queue_find PARAMS ((unsigned char *, unsigned int, | |
174 | struct reloc_queue *)); | |
54bbfd37 JL |
175 | static unsigned char * try_prev_fixup PARAMS ((bfd *, int *, unsigned char *, |
176 | unsigned int, | |
177 | struct reloc_queue *)); | |
178 | ||
179 | static unsigned char * som_reloc_skip PARAMS ((bfd *, unsigned int, | |
180 | unsigned char *, unsigned int *, | |
181 | struct reloc_queue *)); | |
182 | static unsigned char * som_reloc_addend PARAMS ((bfd *, int, unsigned char *, | |
183 | unsigned int *, | |
184 | struct reloc_queue *)); | |
7057b78f JL |
185 | static unsigned char * som_reloc_call PARAMS ((bfd *, unsigned char *, |
186 | unsigned int *, | |
187 | arelent *, int, | |
188 | struct reloc_queue *)); | |
5532fc5a JL |
189 | static unsigned long som_count_spaces PARAMS ((bfd *)); |
190 | static unsigned long som_count_subspaces PARAMS ((bfd *)); | |
191 | static int compare_syms PARAMS ((asymbol **, asymbol **)); | |
192 | static unsigned long som_compute_checksum PARAMS ((bfd *)); | |
0ffa24b9 | 193 | static boolean som_prep_headers PARAMS ((bfd *)); |
2212ff92 | 194 | static int som_sizeof_headers PARAMS ((bfd *, boolean)); |
efc0df7c | 195 | static boolean som_write_headers PARAMS ((bfd *)); |
713de7ec | 196 | static boolean som_build_and_write_symbol_table PARAMS ((bfd *)); |
aff97790 | 197 | static void som_prep_for_fixups PARAMS ((bfd *, asymbol **, unsigned long)); |
9d0dea6f | 198 | static boolean som_write_fixups PARAMS ((bfd *, unsigned long, unsigned int *)); |
0b35f7ec JL |
199 | static boolean som_write_space_strings PARAMS ((bfd *, unsigned long, |
200 | unsigned int *)); | |
201 | static boolean som_write_symbol_strings PARAMS ((bfd *, unsigned long, | |
202 | asymbol **, unsigned int, | |
203 | unsigned *)); | |
6eb64408 | 204 | static boolean som_begin_writing PARAMS ((bfd *)); |
91c0bcbb JL |
205 | static const reloc_howto_type * som_bfd_reloc_type_lookup |
206 | PARAMS ((bfd_arch_info_type *, bfd_reloc_code_real_type)); | |
017a52d7 JL |
207 | static char som_section_type PARAMS ((const char *)); |
208 | static int som_decode_symclass PARAMS ((asymbol *)); | |
3c37f9ca JL |
209 | static boolean som_bfd_count_ar_symbols PARAMS ((bfd *, struct lst_header *, |
210 | symindex *)); | |
017a52d7 | 211 | |
3c37f9ca JL |
212 | static boolean som_bfd_fill_in_ar_symbols PARAMS ((bfd *, struct lst_header *, |
213 | carsym **syms)); | |
214 | static boolean som_slurp_armap PARAMS ((bfd *)); | |
215 | static boolean som_write_armap PARAMS ((bfd *)); | |
216 | static boolean som_slurp_extended_name_table PARAMS ((bfd *)); | |
6e033f86 JL |
217 | static void som_bfd_derive_misc_symbol_info PARAMS ((bfd *, asymbol *, |
218 | struct som_misc_symbol_info *)); | |
219 | static boolean som_bfd_prep_for_ar_write PARAMS ((bfd *, unsigned int *, | |
220 | unsigned int *)); | |
221 | static unsigned int som_bfd_ar_symbol_hash PARAMS ((asymbol *)); | |
222 | static boolean som_bfd_ar_write_symbol_stuff PARAMS ((bfd *, unsigned int, | |
223 | unsigned int, | |
224 | struct lst_header)); | |
225 | ||
017a52d7 JL |
226 | /* Map SOM section names to POSIX/BSD single-character symbol types. |
227 | ||
228 | This table includes all the standard subspaces as defined in the | |
229 | current "PRO ABI for PA-RISC Systems", $UNWIND$ which for | |
230 | some reason was left out, and sections specific to embedded stabs. */ | |
231 | ||
232 | static const struct section_to_type stt[] = { | |
233 | {"$TEXT$", 't'}, | |
234 | {"$SHLIB_INFO$", 't'}, | |
235 | {"$MILLICODE$", 't'}, | |
236 | {"$LIT$", 't'}, | |
237 | {"$CODE$", 't'}, | |
238 | {"$UNWIND_START$", 't'}, | |
239 | {"$UNWIND$", 't'}, | |
240 | {"$PRIVATE$", 'd'}, | |
241 | {"$PLT$", 'd'}, | |
242 | {"$SHLIB_DATA$", 'd'}, | |
243 | {"$DATA$", 'd'}, | |
244 | {"$SHORTDATA$", 'g'}, | |
245 | {"$DLT$", 'd'}, | |
246 | {"$GLOBAL$", 'g'}, | |
247 | {"$SHORTBSS$", 's'}, | |
248 | {"$BSS$", 'b'}, | |
249 | {"$GDB_STRINGS$", 'N'}, | |
250 | {"$GDB_SYMBOLS$", 'N'}, | |
251 | {0, 0} | |
252 | }; | |
2212ff92 | 253 | |
36456a67 JL |
254 | /* About the relocation formatting table... |
255 | ||
256 | There are 256 entries in the table, one for each possible | |
257 | relocation opcode available in SOM. We index the table by | |
258 | the relocation opcode. The names and operations are those | |
259 | defined by a.out_800 (4). | |
260 | ||
261 | Right now this table is only used to count and perform minimal | |
262 | processing on relocation streams so that they can be internalized | |
263 | into BFD and symbolically printed by utilities. To make actual use | |
264 | of them would be much more difficult, BFD's concept of relocations | |
265 | is far too simple to handle SOM relocations. The basic assumption | |
266 | that a relocation can be completely processed independent of other | |
267 | relocations before an object file is written is invalid for SOM. | |
268 | ||
269 | The SOM relocations are meant to be processed as a stream, they | |
270 | specify copying of data from the input section to the output section | |
271 | while possibly modifying the data in some manner. They also can | |
272 | specify that a variable number of zeros or uninitialized data be | |
273 | inserted on in the output segment at the current offset. Some | |
274 | relocations specify that some previous relocation be re-applied at | |
275 | the current location in the input/output sections. And finally a number | |
276 | of relocations have effects on other sections (R_ENTRY, R_EXIT, | |
277 | R_UNWIND_AUX and a variety of others). There isn't even enough room | |
278 | in the BFD relocation data structure to store enough information to | |
279 | perform all the relocations. | |
280 | ||
281 | Each entry in the table has three fields. | |
282 | ||
283 | The first entry is an index into this "class" of relocations. This | |
284 | index can then be used as a variable within the relocation itself. | |
285 | ||
286 | The second field is a format string which actually controls processing | |
287 | of the relocation. It uses a simple postfix machine to do calculations | |
288 | based on variables/constants found in the string and the relocation | |
289 | stream. | |
290 | ||
291 | The third field specifys whether or not this relocation may use | |
292 | a constant (V) from the previous R_DATA_OVERRIDE rather than a constant | |
293 | stored in the instruction. | |
294 | ||
295 | Variables: | |
296 | ||
297 | L = input space byte count | |
298 | D = index into class of relocations | |
299 | M = output space byte count | |
300 | N = statement number (unused?) | |
301 | O = stack operation | |
302 | R = parameter relocation bits | |
303 | S = symbol index | |
304 | U = 64 bits of stack unwind and frame size info (we only keep 32 bits) | |
305 | V = a literal constant (usually used in the next relocation) | |
306 | P = a previous relocation | |
307 | ||
308 | Lower case letters (starting with 'b') refer to following | |
309 | bytes in the relocation stream. 'b' is the next 1 byte, | |
310 | c is the next 2 bytes, d is the next 3 bytes, etc... | |
311 | This is the variable part of the relocation entries that | |
312 | makes our life a living hell. | |
313 | ||
314 | numerical constants are also used in the format string. Note | |
315 | the constants are represented in decimal. | |
316 | ||
317 | '+', "*" and "=" represents the obvious postfix operators. | |
318 | '<' represents a left shift. | |
319 | ||
320 | Stack Operations: | |
321 | ||
322 | Parameter Relocation Bits: | |
323 | ||
324 | Unwind Entries: | |
325 | ||
326 | Previous Relocations: The index field represents which in the queue | |
327 | of 4 previous fixups should be re-applied. | |
328 | ||
329 | Literal Constants: These are generally used to represent addend | |
330 | parts of relocations when these constants are not stored in the | |
331 | fields of the instructions themselves. For example the instruction | |
332 | addil foo-$global$-0x1234 would use an override for "0x1234" rather | |
333 | than storing it into the addil itself. */ | |
334 | ||
335 | struct fixup_format | |
336 | { | |
337 | int D; | |
338 | char *format; | |
339 | }; | |
340 | ||
341 | static const struct fixup_format som_fixup_formats[256] = | |
342 | { | |
343 | /* R_NO_RELOCATION */ | |
344 | 0, "LD1+4*=", /* 0x00 */ | |
345 | 1, "LD1+4*=", /* 0x01 */ | |
346 | 2, "LD1+4*=", /* 0x02 */ | |
347 | 3, "LD1+4*=", /* 0x03 */ | |
348 | 4, "LD1+4*=", /* 0x04 */ | |
349 | 5, "LD1+4*=", /* 0x05 */ | |
350 | 6, "LD1+4*=", /* 0x06 */ | |
351 | 7, "LD1+4*=", /* 0x07 */ | |
352 | 8, "LD1+4*=", /* 0x08 */ | |
353 | 9, "LD1+4*=", /* 0x09 */ | |
354 | 10, "LD1+4*=", /* 0x0a */ | |
355 | 11, "LD1+4*=", /* 0x0b */ | |
356 | 12, "LD1+4*=", /* 0x0c */ | |
357 | 13, "LD1+4*=", /* 0x0d */ | |
358 | 14, "LD1+4*=", /* 0x0e */ | |
359 | 15, "LD1+4*=", /* 0x0f */ | |
360 | 16, "LD1+4*=", /* 0x10 */ | |
361 | 17, "LD1+4*=", /* 0x11 */ | |
362 | 18, "LD1+4*=", /* 0x12 */ | |
363 | 19, "LD1+4*=", /* 0x13 */ | |
364 | 20, "LD1+4*=", /* 0x14 */ | |
365 | 21, "LD1+4*=", /* 0x15 */ | |
366 | 22, "LD1+4*=", /* 0x16 */ | |
367 | 23, "LD1+4*=", /* 0x17 */ | |
368 | 0, "LD8<b+1+4*=", /* 0x18 */ | |
369 | 1, "LD8<b+1+4*=", /* 0x19 */ | |
370 | 2, "LD8<b+1+4*=", /* 0x1a */ | |
371 | 3, "LD8<b+1+4*=", /* 0x1b */ | |
372 | 0, "LD16<c+1+4*=", /* 0x1c */ | |
373 | 1, "LD16<c+1+4*=", /* 0x1d */ | |
374 | 2, "LD16<c+1+4*=", /* 0x1e */ | |
375 | 0, "Ld1+=", /* 0x1f */ | |
376 | /* R_ZEROES */ | |
377 | 0, "Lb1+4*=", /* 0x20 */ | |
378 | 1, "Ld1+=", /* 0x21 */ | |
379 | /* R_UNINIT */ | |
380 | 0, "Lb1+4*=", /* 0x22 */ | |
381 | 1, "Ld1+=", /* 0x23 */ | |
382 | /* R_RELOCATION */ | |
383 | 0, "L4=", /* 0x24 */ | |
384 | /* R_DATA_ONE_SYMBOL */ | |
385 | 0, "L4=Sb=", /* 0x25 */ | |
386 | 1, "L4=Sd=", /* 0x26 */ | |
387 | /* R_DATA_PLEBEL */ | |
388 | 0, "L4=Sb=", /* 0x27 */ | |
389 | 1, "L4=Sd=", /* 0x28 */ | |
390 | /* R_SPACE_REF */ | |
391 | 0, "L4=", /* 0x29 */ | |
392 | /* R_REPEATED_INIT */ | |
393 | 0, "L4=Mb1+4*=", /* 0x2a */ | |
394 | 1, "Lb4*=Mb1+L*=", /* 0x2b */ | |
395 | 2, "Lb4*=Md1+4*=", /* 0x2c */ | |
396 | 3, "Ld1+=Me1+=", /* 0x2d */ | |
397 | /* R_RESERVED */ | |
398 | 0, "", /* 0x2e */ | |
399 | 0, "", /* 0x2f */ | |
400 | /* R_PCREL_CALL */ | |
401 | 0, "L4=RD=Sb=", /* 0x30 */ | |
402 | 1, "L4=RD=Sb=", /* 0x31 */ | |
403 | 2, "L4=RD=Sb=", /* 0x32 */ | |
404 | 3, "L4=RD=Sb=", /* 0x33 */ | |
405 | 4, "L4=RD=Sb=", /* 0x34 */ | |
406 | 5, "L4=RD=Sb=", /* 0x35 */ | |
407 | 6, "L4=RD=Sb=", /* 0x36 */ | |
408 | 7, "L4=RD=Sb=", /* 0x37 */ | |
409 | 8, "L4=RD=Sb=", /* 0x38 */ | |
410 | 9, "L4=RD=Sb=", /* 0x39 */ | |
411 | 0, "L4=RD8<b+=Sb=",/* 0x3a */ | |
412 | 1, "L4=RD8<b+=Sb=",/* 0x3b */ | |
413 | 0, "L4=RD8<b+=Sd=",/* 0x3c */ | |
414 | 1, "L4=RD8<b+=Sd=",/* 0x3d */ | |
415 | /* R_RESERVED */ | |
416 | 0, "", /* 0x3e */ | |
417 | 0, "", /* 0x3f */ | |
418 | /* R_ABS_CALL */ | |
419 | 0, "L4=RD=Sb=", /* 0x40 */ | |
420 | 1, "L4=RD=Sb=", /* 0x41 */ | |
421 | 2, "L4=RD=Sb=", /* 0x42 */ | |
422 | 3, "L4=RD=Sb=", /* 0x43 */ | |
423 | 4, "L4=RD=Sb=", /* 0x44 */ | |
424 | 5, "L4=RD=Sb=", /* 0x45 */ | |
425 | 6, "L4=RD=Sb=", /* 0x46 */ | |
426 | 7, "L4=RD=Sb=", /* 0x47 */ | |
427 | 8, "L4=RD=Sb=", /* 0x48 */ | |
428 | 9, "L4=RD=Sb=", /* 0x49 */ | |
429 | 0, "L4=RD8<b+=Sb=",/* 0x4a */ | |
430 | 1, "L4=RD8<b+=Sb=",/* 0x4b */ | |
431 | 0, "L4=RD8<b+=Sd=",/* 0x4c */ | |
432 | 1, "L4=RD8<b+=Sd=",/* 0x4d */ | |
433 | /* R_RESERVED */ | |
434 | 0, "", /* 0x4e */ | |
435 | 0, "", /* 0x4f */ | |
436 | /* R_DP_RELATIVE */ | |
437 | 0, "L4=SD=", /* 0x50 */ | |
438 | 1, "L4=SD=", /* 0x51 */ | |
439 | 2, "L4=SD=", /* 0x52 */ | |
440 | 3, "L4=SD=", /* 0x53 */ | |
441 | 4, "L4=SD=", /* 0x54 */ | |
442 | 5, "L4=SD=", /* 0x55 */ | |
443 | 6, "L4=SD=", /* 0x56 */ | |
444 | 7, "L4=SD=", /* 0x57 */ | |
445 | 8, "L4=SD=", /* 0x58 */ | |
446 | 9, "L4=SD=", /* 0x59 */ | |
447 | 10, "L4=SD=", /* 0x5a */ | |
448 | 11, "L4=SD=", /* 0x5b */ | |
449 | 12, "L4=SD=", /* 0x5c */ | |
450 | 13, "L4=SD=", /* 0x5d */ | |
451 | 14, "L4=SD=", /* 0x5e */ | |
452 | 15, "L4=SD=", /* 0x5f */ | |
453 | 16, "L4=SD=", /* 0x60 */ | |
454 | 17, "L4=SD=", /* 0x61 */ | |
455 | 18, "L4=SD=", /* 0x62 */ | |
456 | 19, "L4=SD=", /* 0x63 */ | |
457 | 20, "L4=SD=", /* 0x64 */ | |
458 | 21, "L4=SD=", /* 0x65 */ | |
459 | 22, "L4=SD=", /* 0x66 */ | |
460 | 23, "L4=SD=", /* 0x67 */ | |
461 | 24, "L4=SD=", /* 0x68 */ | |
462 | 25, "L4=SD=", /* 0x69 */ | |
463 | 26, "L4=SD=", /* 0x6a */ | |
464 | 27, "L4=SD=", /* 0x6b */ | |
465 | 28, "L4=SD=", /* 0x6c */ | |
466 | 29, "L4=SD=", /* 0x6d */ | |
467 | 30, "L4=SD=", /* 0x6e */ | |
468 | 31, "L4=SD=", /* 0x6f */ | |
469 | 32, "L4=Sb=", /* 0x70 */ | |
470 | 33, "L4=Sd=", /* 0x71 */ | |
471 | /* R_RESERVED */ | |
472 | 0, "", /* 0x72 */ | |
473 | 0, "", /* 0x73 */ | |
474 | 0, "", /* 0x74 */ | |
475 | 0, "", /* 0x75 */ | |
476 | 0, "", /* 0x76 */ | |
477 | 0, "", /* 0x77 */ | |
478 | /* R_DLT_REL */ | |
479 | 0, "L4=Sb=", /* 0x78 */ | |
480 | 1, "L4=Sd=", /* 0x79 */ | |
481 | /* R_RESERVED */ | |
482 | 0, "", /* 0x7a */ | |
483 | 0, "", /* 0x7b */ | |
484 | 0, "", /* 0x7c */ | |
485 | 0, "", /* 0x7d */ | |
486 | 0, "", /* 0x7e */ | |
487 | 0, "", /* 0x7f */ | |
488 | /* R_CODE_ONE_SYMBOL */ | |
489 | 0, "L4=SD=", /* 0x80 */ | |
490 | 1, "L4=SD=", /* 0x81 */ | |
491 | 2, "L4=SD=", /* 0x82 */ | |
492 | 3, "L4=SD=", /* 0x83 */ | |
493 | 4, "L4=SD=", /* 0x84 */ | |
494 | 5, "L4=SD=", /* 0x85 */ | |
495 | 6, "L4=SD=", /* 0x86 */ | |
496 | 7, "L4=SD=", /* 0x87 */ | |
497 | 8, "L4=SD=", /* 0x88 */ | |
498 | 9, "L4=SD=", /* 0x89 */ | |
499 | 10, "L4=SD=", /* 0x8q */ | |
500 | 11, "L4=SD=", /* 0x8b */ | |
501 | 12, "L4=SD=", /* 0x8c */ | |
502 | 13, "L4=SD=", /* 0x8d */ | |
503 | 14, "L4=SD=", /* 0x8e */ | |
504 | 15, "L4=SD=", /* 0x8f */ | |
505 | 16, "L4=SD=", /* 0x90 */ | |
506 | 17, "L4=SD=", /* 0x91 */ | |
507 | 18, "L4=SD=", /* 0x92 */ | |
508 | 19, "L4=SD=", /* 0x93 */ | |
509 | 20, "L4=SD=", /* 0x94 */ | |
510 | 21, "L4=SD=", /* 0x95 */ | |
511 | 22, "L4=SD=", /* 0x96 */ | |
512 | 23, "L4=SD=", /* 0x97 */ | |
513 | 24, "L4=SD=", /* 0x98 */ | |
514 | 25, "L4=SD=", /* 0x99 */ | |
515 | 26, "L4=SD=", /* 0x9a */ | |
516 | 27, "L4=SD=", /* 0x9b */ | |
517 | 28, "L4=SD=", /* 0x9c */ | |
518 | 29, "L4=SD=", /* 0x9d */ | |
519 | 30, "L4=SD=", /* 0x9e */ | |
520 | 31, "L4=SD=", /* 0x9f */ | |
521 | 32, "L4=Sb=", /* 0xa0 */ | |
522 | 33, "L4=Sd=", /* 0xa1 */ | |
523 | /* R_RESERVED */ | |
524 | 0, "", /* 0xa2 */ | |
525 | 0, "", /* 0xa3 */ | |
526 | 0, "", /* 0xa4 */ | |
527 | 0, "", /* 0xa5 */ | |
528 | 0, "", /* 0xa6 */ | |
529 | 0, "", /* 0xa7 */ | |
530 | 0, "", /* 0xa8 */ | |
531 | 0, "", /* 0xa9 */ | |
532 | 0, "", /* 0xaa */ | |
533 | 0, "", /* 0xab */ | |
534 | 0, "", /* 0xac */ | |
535 | 0, "", /* 0xad */ | |
536 | /* R_MILLI_REL */ | |
537 | 0, "L4=Sb=", /* 0xae */ | |
538 | 1, "L4=Sd=", /* 0xaf */ | |
539 | /* R_CODE_PLABEL */ | |
540 | 0, "L4=Sb=", /* 0xb0 */ | |
541 | 1, "L4=Sd=", /* 0xb1 */ | |
542 | /* R_BREAKPOINT */ | |
543 | 0, "L4=", /* 0xb2 */ | |
544 | /* R_ENTRY */ | |
545 | 0, "Ui=", /* 0xb3 */ | |
546 | 1, "Uf=", /* 0xb4 */ | |
547 | /* R_ALT_ENTRY */ | |
548 | 0, "", /* 0xb5 */ | |
549 | /* R_EXIT */ | |
550 | 0, "", /* 0xb6 */ | |
551 | /* R_BEGIN_TRY */ | |
552 | 0, "", /* 0xb7 */ | |
553 | /* R_END_TRY */ | |
554 | 0, "R0=", /* 0xb8 */ | |
555 | 1, "Rb4*=", /* 0xb9 */ | |
556 | 2, "Rd4*=", /* 0xba */ | |
557 | /* R_BEGIN_BRTAB */ | |
558 | 0, "", /* 0xbb */ | |
559 | /* R_END_BRTAB */ | |
560 | 0, "", /* 0xbc */ | |
561 | /* R_STATEMENT */ | |
562 | 0, "Nb=", /* 0xbd */ | |
563 | 1, "Nc=", /* 0xbe */ | |
564 | 2, "Nd=", /* 0xbf */ | |
565 | /* R_DATA_EXPR */ | |
566 | 0, "L4=", /* 0xc0 */ | |
567 | /* R_CODE_EXPR */ | |
568 | 0, "L4=", /* 0xc1 */ | |
569 | /* R_FSEL */ | |
570 | 0, "", /* 0xc2 */ | |
571 | /* R_LSEL */ | |
572 | 0, "", /* 0xc3 */ | |
573 | /* R_RSEL */ | |
574 | 0, "", /* 0xc4 */ | |
575 | /* R_N_MODE */ | |
576 | 0, "", /* 0xc5 */ | |
577 | /* R_S_MODE */ | |
578 | 0, "", /* 0xc6 */ | |
579 | /* R_D_MODE */ | |
580 | 0, "", /* 0xc7 */ | |
581 | /* R_R_MODE */ | |
582 | 0, "", /* 0xc8 */ | |
583 | /* R_DATA_OVERRIDE */ | |
584 | 0, "V0=", /* 0xc9 */ | |
585 | 1, "Vb=", /* 0xca */ | |
586 | 2, "Vc=", /* 0xcb */ | |
587 | 3, "Vd=", /* 0xcc */ | |
588 | 4, "Ve=", /* 0xcd */ | |
589 | /* R_TRANSLATED */ | |
590 | 0, "", /* 0xce */ | |
591 | /* R_RESERVED */ | |
592 | 0, "", /* 0xcf */ | |
593 | /* R_COMP1 */ | |
594 | 0, "Ob=", /* 0xd0 */ | |
595 | /* R_COMP2 */ | |
596 | 0, "Ob=Sd=", /* 0xd1 */ | |
597 | /* R_COMP3 */ | |
598 | 0, "Ob=Ve=", /* 0xd2 */ | |
599 | /* R_PREV_FIXUP */ | |
600 | 0, "P", /* 0xd3 */ | |
601 | 1, "P", /* 0xd4 */ | |
602 | 2, "P", /* 0xd5 */ | |
603 | 3, "P", /* 0xd6 */ | |
604 | /* R_RESERVED */ | |
605 | 0, "", /* 0xd7 */ | |
606 | 0, "", /* 0xd8 */ | |
607 | 0, "", /* 0xd9 */ | |
608 | 0, "", /* 0xda */ | |
609 | 0, "", /* 0xdb */ | |
610 | 0, "", /* 0xdc */ | |
611 | 0, "", /* 0xdd */ | |
612 | 0, "", /* 0xde */ | |
613 | 0, "", /* 0xdf */ | |
614 | 0, "", /* 0xe0 */ | |
615 | 0, "", /* 0xe1 */ | |
616 | 0, "", /* 0xe2 */ | |
617 | 0, "", /* 0xe3 */ | |
618 | 0, "", /* 0xe4 */ | |
619 | 0, "", /* 0xe5 */ | |
620 | 0, "", /* 0xe6 */ | |
621 | 0, "", /* 0xe7 */ | |
622 | 0, "", /* 0xe8 */ | |
623 | 0, "", /* 0xe9 */ | |
624 | 0, "", /* 0xea */ | |
625 | 0, "", /* 0xeb */ | |
626 | 0, "", /* 0xec */ | |
627 | 0, "", /* 0xed */ | |
628 | 0, "", /* 0xee */ | |
629 | 0, "", /* 0xef */ | |
630 | 0, "", /* 0xf0 */ | |
631 | 0, "", /* 0xf1 */ | |
632 | 0, "", /* 0xf2 */ | |
633 | 0, "", /* 0xf3 */ | |
634 | 0, "", /* 0xf4 */ | |
635 | 0, "", /* 0xf5 */ | |
636 | 0, "", /* 0xf6 */ | |
637 | 0, "", /* 0xf7 */ | |
638 | 0, "", /* 0xf8 */ | |
639 | 0, "", /* 0xf9 */ | |
640 | 0, "", /* 0xfa */ | |
641 | 0, "", /* 0xfb */ | |
642 | 0, "", /* 0xfc */ | |
643 | 0, "", /* 0xfd */ | |
644 | 0, "", /* 0xfe */ | |
645 | 0, "", /* 0xff */ | |
646 | }; | |
647 | ||
648 | static const int comp1_opcodes[] = | |
649 | { | |
650 | 0x00, | |
651 | 0x40, | |
652 | 0x41, | |
653 | 0x42, | |
654 | 0x43, | |
655 | 0x44, | |
656 | 0x45, | |
657 | 0x46, | |
658 | 0x47, | |
659 | 0x48, | |
660 | 0x49, | |
661 | 0x4a, | |
662 | 0x4b, | |
663 | 0x60, | |
664 | 0x80, | |
665 | 0xa0, | |
666 | 0xc0, | |
667 | -1 | |
668 | }; | |
669 | ||
670 | static const int comp2_opcodes[] = | |
671 | { | |
672 | 0x00, | |
673 | 0x80, | |
674 | 0x82, | |
675 | 0xc0, | |
676 | -1 | |
677 | }; | |
678 | ||
679 | static const int comp3_opcodes[] = | |
680 | { | |
681 | 0x00, | |
682 | 0x02, | |
683 | -1 | |
684 | }; | |
685 | ||
744069b8 JL |
686 | /* These apparently are not in older versions of hpux reloc.h. */ |
687 | #ifndef R_DLT_REL | |
688 | #define R_DLT_REL 0x78 | |
689 | #endif | |
690 | ||
691 | #ifndef R_AUX_UNWIND | |
692 | #define R_AUX_UNWIND 0xcf | |
693 | #endif | |
694 | ||
695 | #ifndef R_SEC_STMT | |
696 | #define R_SEC_STMT 0xd7 | |
697 | #endif | |
698 | ||
fcb0c846 JL |
699 | static reloc_howto_type som_hppa_howto_table[] = |
700 | { | |
701 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
702 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
703 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
704 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
705 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
706 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
707 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
708 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
709 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
710 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
711 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
712 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
713 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
714 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
715 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
716 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
717 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
718 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
719 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
720 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
721 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
722 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
723 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
724 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
725 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
726 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
727 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
728 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
729 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
730 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
731 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
732 | {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"}, | |
733 | {R_ZEROES, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ZEROES"}, | |
734 | {R_ZEROES, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ZEROES"}, | |
735 | {R_UNINIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_UNINIT"}, | |
736 | {R_UNINIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_UNINIT"}, | |
737 | {R_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RELOCATION"}, | |
738 | {R_DATA_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_ONE_SYMBOL"}, | |
739 | {R_DATA_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_ONE_SYMBOL"}, | |
740 | {R_DATA_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_PLABEL"}, | |
741 | {R_DATA_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_PLABEL"}, | |
742 | {R_SPACE_REF, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_SPACE_REF"}, | |
743 | {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"}, | |
744 | {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"}, | |
745 | {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"}, | |
746 | {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"}, | |
747 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
748 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
749 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
750 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
751 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
752 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
753 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
754 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
755 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
756 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
757 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
758 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
759 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
760 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
761 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
762 | {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"}, | |
763 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
764 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
765 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
766 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
767 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
768 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
769 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
770 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
771 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
772 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
773 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
774 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
775 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
776 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
777 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
778 | {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"}, | |
779 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
780 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
781 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
782 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
783 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
784 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
785 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
786 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
787 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
788 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
789 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
790 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
791 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
792 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
793 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
794 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
795 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
796 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
797 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
798 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
799 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
800 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
801 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
802 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
803 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
804 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
805 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
806 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
807 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
808 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
809 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
810 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
811 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
812 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
813 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
814 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
815 | {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"}, | |
816 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
817 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
818 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
819 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
820 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
744069b8 JL |
821 | {R_DLT_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DLT_REL"}, |
822 | {R_DLT_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DLT_REL"}, | |
fcb0c846 JL |
823 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, |
824 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
825 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
826 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
827 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
828 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
829 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
830 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
831 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
832 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
833 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
834 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
835 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
836 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
837 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
838 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
839 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
840 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
841 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
842 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
843 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
844 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
845 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
846 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
847 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
848 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
849 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
850 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
851 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
852 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
853 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
854 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
855 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
856 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
857 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
858 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
859 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
860 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
861 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
862 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
863 | {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"}, | |
864 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
865 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
866 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
867 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
868 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
869 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
870 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
871 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
872 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
873 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
874 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
875 | {R_MILLI_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_MILLI_REL"}, | |
876 | {R_MILLI_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_MILLI_REL"}, | |
877 | {R_CODE_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_PLABEL"}, | |
878 | {R_CODE_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_PLABEL"}, | |
879 | {R_BREAKPOINT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BREAKPOINT"}, | |
880 | {R_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ENTRY"}, | |
881 | {R_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ENTRY"}, | |
882 | {R_ALT_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ALT_ENTRY"}, | |
883 | {R_EXIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_EXIT"}, | |
884 | {R_BEGIN_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BEGIN_TRY"}, | |
885 | {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_TRY"}, | |
886 | {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_TRY"}, | |
017a52d7 | 887 | {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_TRY"}, |
fcb0c846 JL |
888 | {R_BEGIN_BRTAB, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BEGIN_BRTAB"}, |
889 | {R_END_BRTAB, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_BRTAB"}, | |
890 | {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"}, | |
891 | {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"}, | |
892 | {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"}, | |
893 | {R_DATA_EXPR, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_EXPR"}, | |
894 | {R_CODE_EXPR, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_EXPR"}, | |
895 | {R_FSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_FSEL"}, | |
896 | {R_LSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_LSEL"}, | |
897 | {R_RSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RSEL"}, | |
898 | {R_N_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_N_MODE"}, | |
899 | {R_S_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_S_MODE"}, | |
900 | {R_D_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_D_MODE"}, | |
901 | {R_R_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_R_MODE"}, | |
902 | {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"}, | |
903 | {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"}, | |
904 | {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"}, | |
905 | {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"}, | |
906 | {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"}, | |
fcb0c846 | 907 | {R_TRANSLATED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_TRANSLATED"}, |
744069b8 | 908 | {R_AUX_UNWIND, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_AUX_UNWIND"}, |
fcb0c846 JL |
909 | {R_COMP1, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP1"}, |
910 | {R_COMP2, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP2"}, | |
911 | {R_COMP3, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP3"}, | |
912 | {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"}, | |
913 | {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"}, | |
914 | {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"}, | |
915 | {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"}, | |
744069b8 | 916 | {R_SEC_STMT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_SEC_STMT"}, |
fcb0c846 JL |
917 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, |
918 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
919 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
920 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
921 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
922 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
923 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
924 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
925 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
926 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
927 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
928 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
929 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
930 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
931 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
932 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
933 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
934 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
935 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
936 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
937 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
938 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
939 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
940 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
941 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
942 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
943 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
944 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
945 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
946 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
947 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
948 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
949 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
950 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
951 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
952 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
953 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
954 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
955 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}, | |
956 | {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}}; | |
957 | ||
d125665c JL |
958 | |
959 | /* Initialize the SOM relocation queue. By definition the queue holds | |
960 | the last four multibyte fixups. */ | |
961 | ||
962 | static void | |
963 | som_initialize_reloc_queue (queue) | |
964 | struct reloc_queue *queue; | |
965 | { | |
966 | queue[0].reloc = NULL; | |
967 | queue[0].size = 0; | |
968 | queue[1].reloc = NULL; | |
969 | queue[1].size = 0; | |
970 | queue[2].reloc = NULL; | |
971 | queue[2].size = 0; | |
972 | queue[3].reloc = NULL; | |
973 | queue[3].size = 0; | |
974 | } | |
975 | ||
976 | /* Insert a new relocation into the relocation queue. */ | |
977 | ||
978 | static void | |
979 | som_reloc_queue_insert (p, size, queue) | |
980 | unsigned char *p; | |
981 | unsigned int size; | |
982 | struct reloc_queue *queue; | |
983 | { | |
984 | queue[3].reloc = queue[2].reloc; | |
985 | queue[3].size = queue[2].size; | |
986 | queue[2].reloc = queue[1].reloc; | |
987 | queue[2].size = queue[1].size; | |
988 | queue[1].reloc = queue[0].reloc; | |
989 | queue[1].size = queue[0].size; | |
990 | queue[0].reloc = p; | |
991 | queue[0].size = size; | |
992 | } | |
993 | ||
994 | /* When an entry in the relocation queue is reused, the entry moves | |
995 | to the front of the queue. */ | |
996 | ||
997 | static void | |
998 | som_reloc_queue_fix (queue, index) | |
999 | struct reloc_queue *queue; | |
1000 | unsigned int index; | |
1001 | { | |
1002 | if (index == 0) | |
1003 | return; | |
1004 | ||
1005 | if (index == 1) | |
1006 | { | |
1007 | unsigned char *tmp1 = queue[0].reloc; | |
1008 | unsigned int tmp2 = queue[0].size; | |
1009 | queue[0].reloc = queue[1].reloc; | |
1010 | queue[0].size = queue[1].size; | |
1011 | queue[1].reloc = tmp1; | |
1012 | queue[1].size = tmp2; | |
1013 | return; | |
1014 | } | |
1015 | ||
1016 | if (index == 2) | |
1017 | { | |
1018 | unsigned char *tmp1 = queue[0].reloc; | |
1019 | unsigned int tmp2 = queue[0].size; | |
1020 | queue[0].reloc = queue[2].reloc; | |
1021 | queue[0].size = queue[2].size; | |
1022 | queue[2].reloc = queue[1].reloc; | |
1023 | queue[2].size = queue[1].size; | |
1024 | queue[1].reloc = tmp1; | |
1025 | queue[1].size = tmp2; | |
1026 | return; | |
1027 | } | |
1028 | ||
1029 | if (index == 3) | |
1030 | { | |
1031 | unsigned char *tmp1 = queue[0].reloc; | |
1032 | unsigned int tmp2 = queue[0].size; | |
1033 | queue[0].reloc = queue[3].reloc; | |
1034 | queue[0].size = queue[3].size; | |
1035 | queue[3].reloc = queue[2].reloc; | |
1036 | queue[3].size = queue[2].size; | |
1037 | queue[2].reloc = queue[1].reloc; | |
1038 | queue[2].size = queue[1].size; | |
1039 | queue[1].reloc = tmp1; | |
1040 | queue[1].size = tmp2; | |
1041 | return; | |
1042 | } | |
1043 | abort(); | |
1044 | } | |
1045 | ||
1046 | /* Search for a particular relocation in the relocation queue. */ | |
1047 | ||
1048 | static int | |
1049 | som_reloc_queue_find (p, size, queue) | |
1050 | unsigned char *p; | |
1051 | unsigned int size; | |
1052 | struct reloc_queue *queue; | |
1053 | { | |
9783e04a | 1054 | if (queue[0].reloc && !bcmp (p, queue[0].reloc, size) |
d125665c JL |
1055 | && size == queue[0].size) |
1056 | return 0; | |
9783e04a | 1057 | if (queue[1].reloc && !bcmp (p, queue[1].reloc, size) |
d125665c JL |
1058 | && size == queue[1].size) |
1059 | return 1; | |
9783e04a | 1060 | if (queue[2].reloc && !bcmp (p, queue[2].reloc, size) |
d125665c JL |
1061 | && size == queue[2].size) |
1062 | return 2; | |
9783e04a | 1063 | if (queue[3].reloc && !bcmp (p, queue[3].reloc, size) |
d125665c JL |
1064 | && size == queue[3].size) |
1065 | return 3; | |
1066 | return -1; | |
1067 | } | |
54bbfd37 JL |
1068 | |
1069 | static unsigned char * | |
1070 | try_prev_fixup (abfd, subspace_reloc_sizep, p, size, queue) | |
1071 | bfd *abfd; | |
1072 | int *subspace_reloc_sizep; | |
1073 | unsigned char *p; | |
1074 | unsigned int size; | |
1075 | struct reloc_queue *queue; | |
1076 | { | |
1077 | int queue_index = som_reloc_queue_find (p, size, queue); | |
1078 | ||
1079 | if (queue_index != -1) | |
1080 | { | |
1081 | /* Found this in a previous fixup. Undo the fixup we | |
1082 | just built and use R_PREV_FIXUP instead. We saved | |
1083 | a total of size - 1 bytes in the fixup stream. */ | |
1084 | bfd_put_8 (abfd, R_PREV_FIXUP + queue_index, p); | |
1085 | p += 1; | |
1086 | *subspace_reloc_sizep += 1; | |
1087 | som_reloc_queue_fix (queue, queue_index); | |
1088 | } | |
1089 | else | |
1090 | { | |
1091 | som_reloc_queue_insert (p, size, queue); | |
1092 | *subspace_reloc_sizep += size; | |
1093 | p += size; | |
1094 | } | |
1095 | return p; | |
1096 | } | |
1097 | ||
1098 | /* Emit the proper R_NO_RELOCATION fixups to map the next SKIP | |
1099 | bytes without any relocation. Update the size of the subspace | |
1100 | relocation stream via SUBSPACE_RELOC_SIZE_P; also return the | |
1101 | current pointer into the relocation stream. */ | |
1102 | ||
1103 | static unsigned char * | |
1104 | som_reloc_skip (abfd, skip, p, subspace_reloc_sizep, queue) | |
1105 | bfd *abfd; | |
1106 | unsigned int skip; | |
1107 | unsigned char *p; | |
1108 | unsigned int *subspace_reloc_sizep; | |
1109 | struct reloc_queue *queue; | |
1110 | { | |
1111 | /* Use a 4 byte R_NO_RELOCATION entry with a maximal value | |
1112 | then R_PREV_FIXUPs to get the difference down to a | |
1113 | reasonable size. */ | |
1114 | if (skip >= 0x1000000) | |
1115 | { | |
1116 | skip -= 0x1000000; | |
1117 | bfd_put_8 (abfd, R_NO_RELOCATION + 31, p); | |
1118 | bfd_put_8 (abfd, 0xff, p + 1); | |
1119 | bfd_put_16 (abfd, 0xffff, p + 2); | |
1120 | p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue); | |
1121 | while (skip >= 0x1000000) | |
1122 | { | |
1123 | skip -= 0x1000000; | |
1124 | bfd_put_8 (abfd, R_PREV_FIXUP, p); | |
1125 | p++; | |
1126 | *subspace_reloc_sizep += 1; | |
1127 | /* No need to adjust queue here since we are repeating the | |
1128 | most recent fixup. */ | |
1129 | } | |
1130 | } | |
1131 | ||
1132 | /* The difference must be less than 0x1000000. Use one | |
1133 | more R_NO_RELOCATION entry to get to the right difference. */ | |
1134 | if ((skip & 3) == 0 && skip <= 0xc0000 && skip > 0) | |
1135 | { | |
1136 | /* Difference can be handled in a simple single-byte | |
1137 | R_NO_RELOCATION entry. */ | |
1138 | if (skip <= 0x60) | |
1139 | { | |
1140 | bfd_put_8 (abfd, R_NO_RELOCATION + (skip >> 2) - 1, p); | |
1141 | *subspace_reloc_sizep += 1; | |
1142 | p++; | |
1143 | } | |
1144 | /* Handle it with a two byte R_NO_RELOCATION entry. */ | |
1145 | else if (skip <= 0x1000) | |
1146 | { | |
1147 | bfd_put_8 (abfd, R_NO_RELOCATION + 24 + (((skip >> 2) - 1) >> 8), p); | |
1148 | bfd_put_8 (abfd, (skip >> 2) - 1, p + 1); | |
1149 | p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue); | |
1150 | } | |
1151 | /* Handle it with a three byte R_NO_RELOCATION entry. */ | |
1152 | else | |
1153 | { | |
1154 | bfd_put_8 (abfd, R_NO_RELOCATION + 28 + (((skip >> 2) - 1) >> 16), p); | |
1155 | bfd_put_16 (abfd, (skip >> 2) - 1, p + 1); | |
1156 | p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue); | |
1157 | } | |
1158 | } | |
1159 | /* Ugh. Punt and use a 4 byte entry. */ | |
1160 | else if (skip > 0) | |
1161 | { | |
1162 | bfd_put_8 (abfd, R_NO_RELOCATION + 31, p); | |
1163 | bfd_put_8 (abfd, skip >> 16, p + 1); | |
1164 | bfd_put_16 (abfd, skip, p + 2); | |
1165 | p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue); | |
1166 | } | |
1167 | return p; | |
1168 | } | |
1169 | ||
1170 | /* Emit the proper R_DATA_OVERRIDE fixups to handle a nonzero addend | |
1171 | from a BFD relocation. Update the size of the subspace relocation | |
1172 | stream via SUBSPACE_RELOC_SIZE_P; also return the current pointer | |
1173 | into the relocation stream. */ | |
1174 | ||
1175 | static unsigned char * | |
1176 | som_reloc_addend (abfd, addend, p, subspace_reloc_sizep, queue) | |
1177 | bfd *abfd; | |
1178 | int addend; | |
1179 | unsigned char *p; | |
1180 | unsigned int *subspace_reloc_sizep; | |
1181 | struct reloc_queue *queue; | |
1182 | { | |
1183 | if ((unsigned)(addend) + 0x80 < 0x100) | |
1184 | { | |
1185 | bfd_put_8 (abfd, R_DATA_OVERRIDE + 1, p); | |
1186 | bfd_put_8 (abfd, addend, p + 1); | |
1187 | p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue); | |
1188 | } | |
1189 | else if ((unsigned) (addend) + 0x8000 < 0x10000) | |
1190 | { | |
1191 | bfd_put_8 (abfd, R_DATA_OVERRIDE + 2, p); | |
1192 | bfd_put_16 (abfd, addend, p + 1); | |
1193 | p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue); | |
1194 | } | |
1195 | else if ((unsigned) (addend) + 0x800000 < 0x1000000) | |
1196 | { | |
1197 | bfd_put_8 (abfd, R_DATA_OVERRIDE + 3, p); | |
1198 | bfd_put_8 (abfd, addend >> 16, p + 1); | |
1199 | bfd_put_16 (abfd, addend, p + 2); | |
1200 | p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue); | |
1201 | } | |
1202 | else | |
1203 | { | |
1204 | bfd_put_8 (abfd, R_DATA_OVERRIDE + 4, p); | |
1205 | bfd_put_32 (abfd, addend, p + 1); | |
1206 | p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 5, queue); | |
1207 | } | |
1208 | return p; | |
1209 | } | |
1210 | ||
7057b78f JL |
1211 | /* Handle a single function call relocation. */ |
1212 | ||
1213 | static unsigned char * | |
1214 | som_reloc_call (abfd, p, subspace_reloc_sizep, bfd_reloc, sym_num, queue) | |
1215 | bfd *abfd; | |
1216 | unsigned char *p; | |
1217 | unsigned int *subspace_reloc_sizep; | |
1218 | arelent *bfd_reloc; | |
1219 | int sym_num; | |
1220 | struct reloc_queue *queue; | |
1221 | { | |
1222 | int arg_bits = HPPA_R_ARG_RELOC (bfd_reloc->addend); | |
1223 | int rtn_bits = arg_bits & 0x3; | |
1224 | int type, done = 0; | |
1225 | ||
1226 | /* You'll never believe all this is necessary to handle relocations | |
1227 | for function calls. Having to compute and pack the argument | |
1228 | relocation bits is the real nightmare. | |
1229 | ||
1230 | If you're interested in how this works, just forget it. You really | |
1231 | do not want to know about this braindamage. */ | |
1232 | ||
1233 | /* First see if this can be done with a "simple" relocation. Simple | |
1234 | relocations have a symbol number < 0x100 and have simple encodings | |
1235 | of argument relocations. */ | |
1236 | ||
1237 | if (sym_num < 0x100) | |
1238 | { | |
1239 | switch (arg_bits) | |
1240 | { | |
1241 | case 0: | |
1242 | case 1: | |
1243 | type = 0; | |
1244 | break; | |
1245 | case 1 << 8: | |
1246 | case 1 << 8 | 1: | |
1247 | type = 1; | |
1248 | break; | |
1249 | case 1 << 8 | 1 << 6: | |
1250 | case 1 << 8 | 1 << 6 | 1: | |
1251 | type = 2; | |
1252 | break; | |
1253 | case 1 << 8 | 1 << 6 | 1 << 4: | |
1254 | case 1 << 8 | 1 << 6 | 1 << 4 | 1: | |
1255 | type = 3; | |
1256 | break; | |
1257 | case 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2: | |
1258 | case 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2 | 1: | |
1259 | type = 4; | |
1260 | break; | |
1261 | default: | |
1262 | /* Not one of the easy encodings. This will have to be | |
1263 | handled by the more complex code below. */ | |
1264 | type = -1; | |
1265 | break; | |
1266 | } | |
1267 | if (type != -1) | |
1268 | { | |
1269 | /* Account for the return value too. */ | |
1270 | if (rtn_bits) | |
1271 | type += 5; | |
1272 | ||
1273 | /* Emit a 2 byte relocation. Then see if it can be handled | |
1274 | with a relocation which is already in the relocation queue. */ | |
1275 | bfd_put_8 (abfd, bfd_reloc->howto->type + type, p); | |
1276 | bfd_put_8 (abfd, sym_num, p + 1); | |
1277 | p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue); | |
1278 | done = 1; | |
1279 | } | |
1280 | } | |
1281 | ||
1282 | /* If this could not be handled with a simple relocation, then do a hard | |
1283 | one. Hard relocations occur if the symbol number was too high or if | |
1284 | the encoding of argument relocation bits is too complex. */ | |
1285 | if (! done) | |
1286 | { | |
1287 | /* Don't ask about these magic sequences. I took them straight | |
1288 | from gas-1.36 which took them from the a.out man page. */ | |
1289 | type = rtn_bits; | |
1290 | if ((arg_bits >> 6 & 0xf) == 0xe) | |
1291 | type += 9 * 40; | |
1292 | else | |
1293 | type += (3 * (arg_bits >> 8 & 3) + (arg_bits >> 6 & 3)) * 40; | |
1294 | if ((arg_bits >> 2 & 0xf) == 0xe) | |
1295 | type += 9 * 4; | |
1296 | else | |
1297 | type += (3 * (arg_bits >> 4 & 3) + (arg_bits >> 2 & 3)) * 4; | |
1298 | ||
1299 | /* Output the first two bytes of the relocation. These describe | |
1300 | the length of the relocation and encoding style. */ | |
1301 | bfd_put_8 (abfd, bfd_reloc->howto->type + 10 | |
1302 | + 2 * (sym_num >= 0x100) + (type >= 0x100), | |
1303 | p); | |
1304 | bfd_put_8 (abfd, type, p + 1); | |
1305 | ||
1306 | /* Now output the symbol index and see if this bizarre relocation | |
1307 | just happened to be in the relocation queue. */ | |
1308 | if (sym_num < 0x100) | |
1309 | { | |
1310 | bfd_put_8 (abfd, sym_num, p + 2); | |
1311 | p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue); | |
1312 | } | |
1313 | else | |
1314 | { | |
1315 | bfd_put_8 (abfd, sym_num >> 16, p + 2); | |
1316 | bfd_put_16 (abfd, sym_num, p + 3); | |
1317 | p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 5, queue); | |
1318 | } | |
1319 | } | |
1320 | return p; | |
1321 | } | |
1322 | ||
1323 | ||
9e16fcf1 | 1324 | /* Return the logarithm of X, base 2, considering X unsigned. |
98ecc945 | 1325 | Abort -1 if X is not a power or two or is zero. */ |
9e16fcf1 SG |
1326 | |
1327 | static int | |
1328 | log2 (x) | |
1329 | unsigned int x; | |
1330 | { | |
1331 | int log = 0; | |
1332 | ||
1333 | /* Test for 0 or a power of 2. */ | |
1334 | if (x == 0 || x != (x & -x)) | |
98ecc945 | 1335 | return -1; |
9e16fcf1 SG |
1336 | |
1337 | while ((x >>= 1) != 0) | |
1338 | log++; | |
1339 | return log; | |
1340 | } | |
1341 | ||
fcb0c846 | 1342 | static bfd_reloc_status_type |
39961154 JL |
1343 | hppa_som_reloc (abfd, reloc_entry, symbol_in, data, |
1344 | input_section, output_bfd, error_message) | |
fcb0c846 JL |
1345 | bfd *abfd; |
1346 | arelent *reloc_entry; | |
1347 | asymbol *symbol_in; | |
1348 | PTR data; | |
1349 | asection *input_section; | |
1350 | bfd *output_bfd; | |
39961154 | 1351 | char **error_message; |
fcb0c846 JL |
1352 | { |
1353 | if (output_bfd) | |
1354 | { | |
1355 | reloc_entry->address += input_section->output_offset; | |
1356 | return bfd_reloc_ok; | |
1357 | } | |
1358 | return bfd_reloc_ok; | |
1359 | } | |
32619c58 JL |
1360 | |
1361 | /* Given a generic HPPA relocation type, the instruction format, | |
7430a991 | 1362 | and a field selector, return one or more appropriate SOM relocations. */ |
32619c58 JL |
1363 | |
1364 | int ** | |
1365 | hppa_som_gen_reloc_type (abfd, base_type, format, field) | |
1366 | bfd *abfd; | |
1367 | int base_type; | |
1368 | int format; | |
44fd6622 | 1369 | enum hppa_reloc_field_selector_type_alt field; |
32619c58 JL |
1370 | { |
1371 | int *final_type, **final_types; | |
1372 | ||
017a52d7 | 1373 | final_types = (int **) bfd_alloc_by_size_t (abfd, sizeof (int *) * 3); |
32619c58 | 1374 | final_type = (int *) bfd_alloc_by_size_t (abfd, sizeof (int)); |
9783e04a DM |
1375 | if (!final_types || !final_type) |
1376 | { | |
d1ad85a6 | 1377 | bfd_set_error (bfd_error_no_memory); |
9783e04a DM |
1378 | return NULL; |
1379 | } | |
32619c58 | 1380 | |
017a52d7 JL |
1381 | /* The field selector may require additional relocations to be |
1382 | generated. It's impossible to know at this moment if additional | |
1383 | relocations will be needed, so we make them. The code to actually | |
1384 | write the relocation/fixup stream is responsible for removing | |
1385 | any redundant relocations. */ | |
1386 | switch (field) | |
1387 | { | |
1388 | case e_fsel: | |
1389 | case e_psel: | |
1390 | case e_lpsel: | |
1391 | case e_rpsel: | |
a36b6f1d JL |
1392 | final_types[0] = final_type; |
1393 | final_types[1] = NULL; | |
1394 | final_types[2] = NULL; | |
1395 | *final_type = base_type; | |
1396 | break; | |
1397 | ||
017a52d7 JL |
1398 | case e_tsel: |
1399 | case e_ltsel: | |
1400 | case e_rtsel: | |
a36b6f1d | 1401 | final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int)); |
9783e04a DM |
1402 | if (!final_types[0]) |
1403 | { | |
d1ad85a6 | 1404 | bfd_set_error (bfd_error_no_memory); |
9783e04a DM |
1405 | return NULL; |
1406 | } | |
39961154 JL |
1407 | if (field == e_tsel) |
1408 | *final_types[0] = R_FSEL; | |
1409 | else if (field == e_ltsel) | |
1410 | *final_types[0] = R_LSEL; | |
1411 | else | |
1412 | *final_types[0] = R_RSEL; | |
a36b6f1d | 1413 | final_types[1] = final_type; |
017a52d7 JL |
1414 | final_types[2] = NULL; |
1415 | *final_type = base_type; | |
1416 | break; | |
1417 | ||
1418 | case e_lssel: | |
1419 | case e_rssel: | |
1420 | final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int)); | |
9783e04a DM |
1421 | if (!final_types[0]) |
1422 | { | |
d1ad85a6 | 1423 | bfd_set_error (bfd_error_no_memory); |
9783e04a DM |
1424 | return NULL; |
1425 | } | |
017a52d7 JL |
1426 | *final_types[0] = R_S_MODE; |
1427 | final_types[1] = final_type; | |
1428 | final_types[2] = NULL; | |
1429 | *final_type = base_type; | |
1430 | break; | |
32619c58 | 1431 | |
017a52d7 JL |
1432 | case e_lsel: |
1433 | case e_rsel: | |
1434 | final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int)); | |
9783e04a DM |
1435 | if (!final_types[0]) |
1436 | { | |
d1ad85a6 | 1437 | bfd_set_error (bfd_error_no_memory); |
9783e04a DM |
1438 | return NULL; |
1439 | } | |
017a52d7 JL |
1440 | *final_types[0] = R_N_MODE; |
1441 | final_types[1] = final_type; | |
1442 | final_types[2] = NULL; | |
1443 | *final_type = base_type; | |
1444 | break; | |
32619c58 | 1445 | |
017a52d7 JL |
1446 | case e_ldsel: |
1447 | case e_rdsel: | |
1448 | final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int)); | |
9783e04a DM |
1449 | if (!final_types[0]) |
1450 | { | |
d1ad85a6 | 1451 | bfd_set_error (bfd_error_no_memory); |
9783e04a DM |
1452 | return NULL; |
1453 | } | |
017a52d7 JL |
1454 | *final_types[0] = R_D_MODE; |
1455 | final_types[1] = final_type; | |
1456 | final_types[2] = NULL; | |
1457 | *final_type = base_type; | |
1458 | break; | |
32619c58 | 1459 | |
017a52d7 JL |
1460 | case e_lrsel: |
1461 | case e_rrsel: | |
1462 | final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int)); | |
9783e04a DM |
1463 | if (!final_types[0]) |
1464 | { | |
d1ad85a6 | 1465 | bfd_set_error (bfd_error_no_memory); |
9783e04a DM |
1466 | return NULL; |
1467 | } | |
017a52d7 JL |
1468 | *final_types[0] = R_R_MODE; |
1469 | final_types[1] = final_type; | |
1470 | final_types[2] = NULL; | |
1471 | *final_type = base_type; | |
1472 | break; | |
1473 | } | |
1474 | ||
32619c58 JL |
1475 | switch (base_type) |
1476 | { | |
1477 | case R_HPPA: | |
1478 | /* PLABELs get their own relocation type. */ | |
1479 | if (field == e_psel | |
1480 | || field == e_lpsel | |
1481 | || field == e_rpsel) | |
a36b6f1d JL |
1482 | { |
1483 | /* A PLABEL relocation that has a size of 32 bits must | |
1484 | be a R_DATA_PLABEL. All others are R_CODE_PLABELs. */ | |
1485 | if (format == 32) | |
1486 | *final_type = R_DATA_PLABEL; | |
1487 | else | |
1488 | *final_type = R_CODE_PLABEL; | |
1489 | } | |
1490 | /* PIC stuff. */ | |
1491 | else if (field == e_tsel | |
1492 | || field == e_ltsel | |
1493 | || field == e_rtsel) | |
1494 | *final_type = R_DLT_REL; | |
1495 | /* A relocation in the data space is always a full 32bits. */ | |
32619c58 JL |
1496 | else if (format == 32) |
1497 | *final_type = R_DATA_ONE_SYMBOL; | |
1498 | ||
1499 | break; | |
1500 | ||
1501 | case R_HPPA_GOTOFF: | |
1502 | /* More PLABEL special cases. */ | |
1503 | if (field == e_psel | |
1504 | || field == e_lpsel | |
1505 | || field == e_rpsel) | |
1506 | *final_type = R_DATA_PLABEL; | |
1507 | break; | |
1508 | ||
1509 | case R_HPPA_NONE: | |
1510 | case R_HPPA_ABS_CALL: | |
1511 | case R_HPPA_PCREL_CALL: | |
1512 | case R_HPPA_COMPLEX: | |
1513 | case R_HPPA_COMPLEX_PCREL_CALL: | |
1514 | case R_HPPA_COMPLEX_ABS_CALL: | |
1515 | /* Right now we can default all these. */ | |
1516 | break; | |
1517 | } | |
1518 | return final_types; | |
1519 | } | |
1520 | ||
1521 | /* Return the address of the correct entry in the PA SOM relocation | |
1522 | howto table. */ | |
1523 | ||
91c0bcbb | 1524 | static const reloc_howto_type * |
32619c58 JL |
1525 | som_bfd_reloc_type_lookup (arch, code) |
1526 | bfd_arch_info_type *arch; | |
1527 | bfd_reloc_code_real_type code; | |
1528 | { | |
1529 | if ((int) code < (int) R_NO_RELOCATION + 255) | |
1530 | { | |
1531 | BFD_ASSERT ((int) som_hppa_howto_table[(int) code].type == (int) code); | |
1532 | return &som_hppa_howto_table[(int) code]; | |
1533 | } | |
1534 | ||
1535 | return (reloc_howto_type *) 0; | |
1536 | } | |
1537 | ||
9e16fcf1 SG |
1538 | /* Perform some initialization for an object. Save results of this |
1539 | initialization in the BFD. */ | |
d9ad93bc KR |
1540 | |
1541 | static bfd_target * | |
9e16fcf1 | 1542 | som_object_setup (abfd, file_hdrp, aux_hdrp) |
d9ad93bc KR |
1543 | bfd *abfd; |
1544 | struct header *file_hdrp; | |
1545 | struct som_exec_auxhdr *aux_hdrp; | |
1546 | { | |
9e16fcf1 SG |
1547 | /* som_mkobject will set bfd_error if som_mkobject fails. */ |
1548 | if (som_mkobject (abfd) != true) | |
1549 | return 0; | |
d9ad93bc | 1550 | |
9e16fcf1 SG |
1551 | /* Set BFD flags based on what information is available in the SOM. */ |
1552 | abfd->flags = NO_FLAGS; | |
9e16fcf1 SG |
1553 | if (file_hdrp->symbol_total) |
1554 | abfd->flags |= HAS_LINENO | HAS_DEBUG | HAS_SYMS | HAS_LOCALS; | |
1555 | ||
ec743cef JL |
1556 | switch (file_hdrp->a_magic) |
1557 | { | |
1558 | case DEMAND_MAGIC: | |
1559 | abfd->flags |= (D_PAGED | WP_TEXT | EXEC_P); | |
1560 | break; | |
1561 | case SHARE_MAGIC: | |
1562 | abfd->flags |= (WP_TEXT | EXEC_P); | |
1563 | break; | |
1564 | case EXEC_MAGIC: | |
1565 | abfd->flags |= (EXEC_P); | |
1566 | break; | |
1567 | case RELOC_MAGIC: | |
1568 | abfd->flags |= HAS_RELOC; | |
1569 | break; | |
1570 | default: | |
1571 | break; | |
1572 | } | |
1573 | ||
9e16fcf1 SG |
1574 | bfd_get_start_address (abfd) = aux_hdrp->exec_entry; |
1575 | bfd_default_set_arch_mach (abfd, bfd_arch_hppa, 0); | |
d9ad93bc | 1576 | bfd_get_symcount (abfd) = file_hdrp->symbol_total; |
9e16fcf1 SG |
1577 | |
1578 | /* Initialize the saved symbol table and string table to NULL. | |
1579 | Save important offsets and sizes from the SOM header into | |
1580 | the BFD. */ | |
1581 | obj_som_stringtab (abfd) = (char *) NULL; | |
1582 | obj_som_symtab (abfd) = (som_symbol_type *) NULL; | |
1583 | obj_som_stringtab_size (abfd) = file_hdrp->symbol_strings_size; | |
1584 | obj_som_sym_filepos (abfd) = file_hdrp->symbol_location; | |
1585 | obj_som_str_filepos (abfd) = file_hdrp->symbol_strings_location; | |
1586 | obj_som_reloc_filepos (abfd) = file_hdrp->fixup_request_location; | |
d9ad93bc KR |
1587 | |
1588 | return abfd->xvec; | |
1589 | } | |
1590 | ||
d9ad93bc KR |
1591 | /* Convert all of the space and subspace info into BFD sections. Each space |
1592 | contains a number of subspaces, which in turn describe the mapping between | |
1593 | regions of the exec file, and the address space that the program runs in. | |
1594 | BFD sections which correspond to spaces will overlap the sections for the | |
1595 | associated subspaces. */ | |
1596 | ||
9e16fcf1 | 1597 | static boolean |
d9ad93bc KR |
1598 | setup_sections (abfd, file_hdr) |
1599 | bfd *abfd; | |
1600 | struct header *file_hdr; | |
1601 | { | |
1602 | char *space_strings; | |
1603 | int space_index; | |
9e16fcf1 | 1604 | unsigned int total_subspaces = 0; |
d9ad93bc KR |
1605 | |
1606 | /* First, read in space names */ | |
1607 | ||
80425e6c | 1608 | space_strings = malloc (file_hdr->space_strings_size); |
d9ad93bc | 1609 | if (!space_strings) |
80425e6c JK |
1610 | { |
1611 | bfd_set_error (bfd_error_no_memory); | |
1612 | goto error_return; | |
1613 | } | |
d9ad93bc KR |
1614 | |
1615 | if (bfd_seek (abfd, file_hdr->space_strings_location, SEEK_SET) < 0) | |
80425e6c | 1616 | goto error_return; |
d9ad93bc KR |
1617 | if (bfd_read (space_strings, 1, file_hdr->space_strings_size, abfd) |
1618 | != file_hdr->space_strings_size) | |
80425e6c | 1619 | goto error_return; |
d9ad93bc KR |
1620 | |
1621 | /* Loop over all of the space dictionaries, building up sections */ | |
d9ad93bc KR |
1622 | for (space_index = 0; space_index < file_hdr->space_total; space_index++) |
1623 | { | |
1624 | struct space_dictionary_record space; | |
9e16fcf1 SG |
1625 | struct subspace_dictionary_record subspace, save_subspace; |
1626 | int subspace_index; | |
d9ad93bc | 1627 | asection *space_asect; |
ec743cef | 1628 | char *newname; |
d9ad93bc KR |
1629 | |
1630 | /* Read the space dictionary element */ | |
1631 | if (bfd_seek (abfd, file_hdr->space_location | |
1632 | + space_index * sizeof space, SEEK_SET) < 0) | |
80425e6c | 1633 | goto error_return; |
d9ad93bc | 1634 | if (bfd_read (&space, 1, sizeof space, abfd) != sizeof space) |
80425e6c | 1635 | goto error_return; |
d9ad93bc KR |
1636 | |
1637 | /* Setup the space name string */ | |
1638 | space.name.n_name = space.name.n_strx + space_strings; | |
1639 | ||
1640 | /* Make a section out of it */ | |
ec743cef JL |
1641 | newname = bfd_alloc (abfd, strlen (space.name.n_name) + 1); |
1642 | if (!newname) | |
1643 | goto error_return; | |
1644 | strcpy (newname, space.name.n_name); | |
1645 | ||
1646 | space_asect = bfd_make_section_anyway (abfd, newname); | |
d9ad93bc | 1647 | if (!space_asect) |
80425e6c | 1648 | goto error_return; |
d9ad93bc | 1649 | |
b486fb13 JL |
1650 | if (space.is_loadable == 0) |
1651 | space_asect->flags |= SEC_DEBUGGING; | |
1652 | ||
1653 | /* Set up all the attributes for the space. */ | |
1654 | bfd_som_set_section_attributes (space_asect, space.is_defined, | |
1655 | space.is_private, space.sort_key, | |
1656 | space.space_number); | |
1657 | ||
d9ad93bc KR |
1658 | /* Now, read in the first subspace for this space */ |
1659 | if (bfd_seek (abfd, file_hdr->subspace_location | |
1660 | + space.subspace_index * sizeof subspace, | |
1661 | SEEK_SET) < 0) | |
80425e6c | 1662 | goto error_return; |
d9ad93bc | 1663 | if (bfd_read (&subspace, 1, sizeof subspace, abfd) != sizeof subspace) |
80425e6c | 1664 | goto error_return; |
d9ad93bc KR |
1665 | /* Seek back to the start of the subspaces for loop below */ |
1666 | if (bfd_seek (abfd, file_hdr->subspace_location | |
1667 | + space.subspace_index * sizeof subspace, | |
1668 | SEEK_SET) < 0) | |
80425e6c | 1669 | goto error_return; |
d9ad93bc KR |
1670 | |
1671 | /* Setup the start address and file loc from the first subspace record */ | |
1672 | space_asect->vma = subspace.subspace_start; | |
1673 | space_asect->filepos = subspace.file_loc_init_value; | |
9e16fcf1 | 1674 | space_asect->alignment_power = log2 (subspace.alignment); |
98ecc945 | 1675 | if (space_asect->alignment_power == -1) |
80425e6c | 1676 | goto error_return; |
9e16fcf1 SG |
1677 | |
1678 | /* Initialize save_subspace so we can reliably determine if this | |
1679 | loop placed any useful values into it. */ | |
6e033f86 | 1680 | memset (&save_subspace, 0, sizeof (struct subspace_dictionary_record)); |
d9ad93bc KR |
1681 | |
1682 | /* Loop over the rest of the subspaces, building up more sections */ | |
1683 | for (subspace_index = 0; subspace_index < space.subspace_quantity; | |
1684 | subspace_index++) | |
1685 | { | |
1686 | asection *subspace_asect; | |
1687 | ||
1688 | /* Read in the next subspace */ | |
1689 | if (bfd_read (&subspace, 1, sizeof subspace, abfd) | |
1690 | != sizeof subspace) | |
80425e6c | 1691 | goto error_return; |
d9ad93bc KR |
1692 | |
1693 | /* Setup the subspace name string */ | |
1694 | subspace.name.n_name = subspace.name.n_strx + space_strings; | |
1695 | ||
ec743cef JL |
1696 | newname = bfd_alloc (abfd, strlen (subspace.name.n_name) + 1); |
1697 | if (!newname) | |
1698 | goto error_return; | |
1699 | strcpy (newname, subspace.name.n_name); | |
d9ad93bc | 1700 | |
ec743cef JL |
1701 | /* Make a section out of this subspace */ |
1702 | subspace_asect = bfd_make_section_anyway (abfd, newname); | |
d9ad93bc | 1703 | if (!subspace_asect) |
80425e6c | 1704 | goto error_return; |
9e16fcf1 | 1705 | |
b486fb13 JL |
1706 | /* Store private information about the section. */ |
1707 | bfd_som_set_subsection_attributes (subspace_asect, space_asect, | |
1708 | subspace.access_control_bits, | |
1709 | subspace.sort_key, | |
1710 | subspace.quadrant); | |
1711 | ||
9e16fcf1 SG |
1712 | /* Keep an easy mapping between subspaces and sections. */ |
1713 | som_section_data (subspace_asect)->subspace_index | |
1714 | = total_subspaces++; | |
1715 | ||
1716 | /* Set SEC_READONLY and SEC_CODE/SEC_DATA as specified | |
1717 | by the access_control_bits in the subspace header. */ | |
1718 | switch (subspace.access_control_bits >> 4) | |
1719 | { | |
1720 | /* Readonly data. */ | |
1721 | case 0x0: | |
1722 | subspace_asect->flags |= SEC_DATA | SEC_READONLY; | |
1723 | break; | |
1724 | ||
1725 | /* Normal data. */ | |
1726 | case 0x1: | |
1727 | subspace_asect->flags |= SEC_DATA; | |
1728 | break; | |
1729 | ||
1730 | /* Readonly code and the gateways. | |
1731 | Gateways have other attributes which do not map | |
1732 | into anything BFD knows about. */ | |
1733 | case 0x2: | |
1734 | case 0x4: | |
1735 | case 0x5: | |
1736 | case 0x6: | |
1737 | case 0x7: | |
1738 | subspace_asect->flags |= SEC_CODE | SEC_READONLY; | |
1739 | break; | |
1740 | ||
1741 | /* dynamic (writable) code. */ | |
1742 | case 0x3: | |
1743 | subspace_asect->flags |= SEC_CODE; | |
1744 | break; | |
1745 | } | |
1746 | ||
1747 | if (subspace.dup_common || subspace.is_common) | |
1748 | subspace_asect->flags |= SEC_IS_COMMON; | |
36456a67 | 1749 | else if (subspace.subspace_length > 0) |
9e16fcf1 | 1750 | subspace_asect->flags |= SEC_HAS_CONTENTS; |
b486fb13 | 1751 | |
d9ad93bc KR |
1752 | if (subspace.is_loadable) |
1753 | subspace_asect->flags |= SEC_ALLOC | SEC_LOAD; | |
b486fb13 JL |
1754 | else |
1755 | subspace_asect->flags |= SEC_DEBUGGING; | |
1756 | ||
d9ad93bc KR |
1757 | if (subspace.code_only) |
1758 | subspace_asect->flags |= SEC_CODE; | |
1759 | ||
36456a67 JL |
1760 | /* Both file_loc_init_value and initialization_length will |
1761 | be zero for a BSS like subspace. */ | |
1762 | if (subspace.file_loc_init_value == 0 | |
1763 | && subspace.initialization_length == 0) | |
1764 | subspace_asect->flags &= ~(SEC_DATA | SEC_LOAD); | |
1765 | ||
9e16fcf1 SG |
1766 | /* This subspace has relocations. |
1767 | The fixup_request_quantity is a byte count for the number of | |
1768 | entries in the relocation stream; it is not the actual number | |
1769 | of relocations in the subspace. */ | |
1770 | if (subspace.fixup_request_quantity != 0) | |
1771 | { | |
1772 | subspace_asect->flags |= SEC_RELOC; | |
1773 | subspace_asect->rel_filepos = subspace.fixup_request_index; | |
1774 | som_section_data (subspace_asect)->reloc_size | |
1775 | = subspace.fixup_request_quantity; | |
1776 | /* We can not determine this yet. When we read in the | |
1777 | relocation table the correct value will be filled in. */ | |
1778 | subspace_asect->reloc_count = -1; | |
1779 | } | |
1780 | ||
1781 | /* Update save_subspace if appropriate. */ | |
1782 | if (subspace.file_loc_init_value > save_subspace.file_loc_init_value) | |
1783 | save_subspace = subspace; | |
1784 | ||
d9ad93bc KR |
1785 | subspace_asect->vma = subspace.subspace_start; |
1786 | subspace_asect->_cooked_size = subspace.subspace_length; | |
36456a67 | 1787 | subspace_asect->_raw_size = subspace.subspace_length; |
d9ad93bc | 1788 | subspace_asect->filepos = subspace.file_loc_init_value; |
98ecc945 JL |
1789 | subspace_asect->alignment_power = log2 (subspace.alignment); |
1790 | if (subspace_asect->alignment_power == -1) | |
80425e6c | 1791 | goto error_return; |
d9ad93bc | 1792 | } |
9e16fcf1 SG |
1793 | |
1794 | /* Yow! there is no subspace within the space which actually | |
1795 | has initialized information in it; this should never happen | |
1796 | as far as I know. */ | |
1797 | if (!save_subspace.file_loc_init_value) | |
80425e6c | 1798 | goto error_return; |
9e16fcf1 | 1799 | |
d9ad93bc | 1800 | /* Setup the sizes for the space section based upon the info in the |
9e16fcf1 SG |
1801 | last subspace of the space. */ |
1802 | space_asect->_cooked_size = save_subspace.subspace_start | |
1803 | - space_asect->vma + save_subspace.subspace_length; | |
1804 | space_asect->_raw_size = save_subspace.file_loc_init_value | |
1805 | - space_asect->filepos + save_subspace.initialization_length; | |
d9ad93bc | 1806 | } |
80425e6c JK |
1807 | if (space_strings != NULL) |
1808 | free (space_strings); | |
9e16fcf1 | 1809 | return true; |
80425e6c JK |
1810 | |
1811 | error_return: | |
1812 | if (space_strings != NULL) | |
1813 | free (space_strings); | |
1814 | return false; | |
d9ad93bc KR |
1815 | } |
1816 | ||
9e16fcf1 SG |
1817 | /* Read in a SOM object and make it into a BFD. */ |
1818 | ||
d9ad93bc | 1819 | static bfd_target * |
9e16fcf1 | 1820 | som_object_p (abfd) |
d9ad93bc KR |
1821 | bfd *abfd; |
1822 | { | |
1823 | struct header file_hdr; | |
1824 | struct som_exec_auxhdr aux_hdr; | |
1825 | ||
1826 | if (bfd_read ((PTR) & file_hdr, 1, FILE_HDR_SIZE, abfd) != FILE_HDR_SIZE) | |
9e16fcf1 | 1827 | { |
d1ad85a6 | 1828 | bfd_set_error (bfd_error_system_call); |
9e16fcf1 SG |
1829 | return 0; |
1830 | } | |
d9ad93bc KR |
1831 | |
1832 | if (!_PA_RISC_ID (file_hdr.system_id)) | |
1833 | { | |
d1ad85a6 | 1834 | bfd_set_error (bfd_error_wrong_format); |
d9ad93bc KR |
1835 | return 0; |
1836 | } | |
1837 | ||
1838 | switch (file_hdr.a_magic) | |
1839 | { | |
9e16fcf1 | 1840 | case RELOC_MAGIC: |
d9ad93bc KR |
1841 | case EXEC_MAGIC: |
1842 | case SHARE_MAGIC: | |
1843 | case DEMAND_MAGIC: | |
1844 | #ifdef DL_MAGIC | |
1845 | case DL_MAGIC: | |
1846 | #endif | |
1847 | #ifdef SHL_MAGIC | |
1848 | case SHL_MAGIC: | |
9e16fcf1 SG |
1849 | #endif |
1850 | #ifdef EXECLIBMAGIC | |
1851 | case EXECLIBMAGIC: | |
017a52d7 JL |
1852 | #endif |
1853 | #ifdef SHARED_MAGIC_CNX | |
1854 | case SHARED_MAGIC_CNX: | |
d9ad93bc KR |
1855 | #endif |
1856 | break; | |
1857 | default: | |
d1ad85a6 | 1858 | bfd_set_error (bfd_error_wrong_format); |
d9ad93bc KR |
1859 | return 0; |
1860 | } | |
1861 | ||
1862 | if (file_hdr.version_id != VERSION_ID | |
1863 | && file_hdr.version_id != NEW_VERSION_ID) | |
1864 | { | |
d1ad85a6 | 1865 | bfd_set_error (bfd_error_wrong_format); |
d9ad93bc KR |
1866 | return 0; |
1867 | } | |
1868 | ||
9e16fcf1 SG |
1869 | /* If the aux_header_size field in the file header is zero, then this |
1870 | object is an incomplete executable (a .o file). Do not try to read | |
1871 | a non-existant auxiliary header. */ | |
6e033f86 | 1872 | memset (&aux_hdr, 0, sizeof (struct som_exec_auxhdr)); |
9e16fcf1 SG |
1873 | if (file_hdr.aux_header_size != 0) |
1874 | { | |
1875 | if (bfd_read ((PTR) & aux_hdr, 1, AUX_HDR_SIZE, abfd) != AUX_HDR_SIZE) | |
1876 | { | |
d1ad85a6 | 1877 | bfd_set_error (bfd_error_wrong_format); |
9e16fcf1 SG |
1878 | return 0; |
1879 | } | |
1880 | } | |
d9ad93bc KR |
1881 | |
1882 | if (!setup_sections (abfd, &file_hdr)) | |
9e16fcf1 SG |
1883 | { |
1884 | /* setup_sections does not bubble up a bfd error code. */ | |
d1ad85a6 | 1885 | bfd_set_error (bfd_error_bad_value); |
9e16fcf1 SG |
1886 | return 0; |
1887 | } | |
d9ad93bc | 1888 | |
9e16fcf1 SG |
1889 | /* This appears to be a valid SOM object. Do some initialization. */ |
1890 | return som_object_setup (abfd, &file_hdr, &aux_hdr); | |
d9ad93bc KR |
1891 | } |
1892 | ||
9e16fcf1 SG |
1893 | /* Create a SOM object. */ |
1894 | ||
d9ad93bc | 1895 | static boolean |
9e16fcf1 | 1896 | som_mkobject (abfd) |
d9ad93bc KR |
1897 | bfd *abfd; |
1898 | { | |
9e16fcf1 SG |
1899 | /* Allocate memory to hold backend information. */ |
1900 | abfd->tdata.som_data = (struct som_data_struct *) | |
1901 | bfd_zalloc (abfd, sizeof (struct som_data_struct)); | |
1902 | if (abfd->tdata.som_data == NULL) | |
1903 | { | |
d1ad85a6 | 1904 | bfd_set_error (bfd_error_no_memory); |
9e16fcf1 SG |
1905 | return false; |
1906 | } | |
a62dd44f JL |
1907 | obj_som_file_hdr (abfd) |
1908 | = (struct header *) bfd_zalloc (abfd, sizeof (struct header)); | |
9e16fcf1 SG |
1909 | if (obj_som_file_hdr (abfd) == NULL) |
1910 | ||
1911 | { | |
d1ad85a6 | 1912 | bfd_set_error (bfd_error_no_memory); |
9e16fcf1 SG |
1913 | return false; |
1914 | } | |
1915 | return true; | |
d9ad93bc KR |
1916 | } |
1917 | ||
0ffa24b9 JL |
1918 | /* Initialize some information in the file header. This routine makes |
1919 | not attempt at doing the right thing for a full executable; it | |
1920 | is only meant to handle relocatable objects. */ | |
1921 | ||
1922 | static boolean | |
1923 | som_prep_headers (abfd) | |
1924 | bfd *abfd; | |
1925 | { | |
1926 | struct header *file_hdr = obj_som_file_hdr (abfd); | |
1927 | asection *section; | |
1928 | ||
1929 | /* FIXME. This should really be conditional based on whether or not | |
1930 | PA1.1 instructions/registers have been used. */ | |
4f42757e | 1931 | file_hdr->system_id = CPU_PA_RISC1_0; |
0ffa24b9 | 1932 | |
0ffa24b9 | 1933 | if (abfd->flags & EXEC_P) |
ec743cef JL |
1934 | { |
1935 | if (abfd->flags & D_PAGED) | |
1936 | file_hdr->a_magic = DEMAND_MAGIC; | |
1937 | else if (abfd->flags & WP_TEXT) | |
1938 | file_hdr->a_magic = SHARE_MAGIC; | |
1939 | else | |
1940 | file_hdr->a_magic = EXEC_MAGIC; | |
1941 | } | |
0ffa24b9 JL |
1942 | else |
1943 | file_hdr->a_magic = RELOC_MAGIC; | |
1944 | ||
1945 | /* Only new format SOM is supported. */ | |
1946 | file_hdr->version_id = NEW_VERSION_ID; | |
1947 | ||
1948 | /* These fields are optional, and embedding timestamps is not always | |
1949 | a wise thing to do, it makes comparing objects during a multi-stage | |
1950 | bootstrap difficult. */ | |
1951 | file_hdr->file_time.secs = 0; | |
1952 | file_hdr->file_time.nanosecs = 0; | |
1953 | ||
1954 | if (abfd->flags & EXEC_P) | |
1955 | abort (); | |
1956 | else | |
1957 | { | |
1958 | file_hdr->entry_space = 0; | |
1959 | file_hdr->entry_subspace = 0; | |
1960 | file_hdr->entry_offset = 0; | |
1961 | } | |
1962 | ||
0ffa24b9 JL |
1963 | file_hdr->presumed_dp = 0; |
1964 | ||
1965 | /* Now iterate over the sections translating information from | |
1966 | BFD sections to SOM spaces/subspaces. */ | |
1967 | ||
1968 | for (section = abfd->sections; section != NULL; section = section->next) | |
1969 | { | |
1970 | /* Ignore anything which has not been marked as a space or | |
1971 | subspace. */ | |
1972 | if (som_section_data (section)->is_space == 0 | |
1973 | ||
1974 | && som_section_data (section)->is_subspace == 0) | |
1975 | continue; | |
1976 | ||
1977 | if (som_section_data (section)->is_space) | |
1978 | { | |
1979 | /* Set space attributes. Note most attributes of SOM spaces | |
1980 | are set based on the subspaces it contains. */ | |
1981 | som_section_data (section)->space_dict.loader_fix_index = -1; | |
1982 | som_section_data (section)->space_dict.init_pointer_index = -1; | |
1983 | } | |
1984 | else | |
1985 | { | |
1986 | /* Set subspace attributes. Basic stuff is done here, additional | |
1987 | attributes are filled in later as more information becomes | |
1988 | available. */ | |
1989 | if (section->flags & SEC_IS_COMMON) | |
1990 | { | |
1991 | som_section_data (section)->subspace_dict.dup_common = 1; | |
1992 | som_section_data (section)->subspace_dict.is_common = 1; | |
1993 | } | |
1994 | ||
1995 | if (section->flags & SEC_ALLOC) | |
1996 | som_section_data (section)->subspace_dict.is_loadable = 1; | |
1997 | ||
1998 | if (section->flags & SEC_CODE) | |
1999 | som_section_data (section)->subspace_dict.code_only = 1; | |
2000 | ||
2001 | som_section_data (section)->subspace_dict.subspace_start = | |
2002 | section->vma; | |
2003 | som_section_data (section)->subspace_dict.subspace_length = | |
2004 | bfd_section_size (abfd, section); | |
2005 | som_section_data (section)->subspace_dict.initialization_length = | |
2006 | bfd_section_size (abfd, section); | |
2007 | som_section_data (section)->subspace_dict.alignment = | |
2008 | 1 << section->alignment_power; | |
2009 | } | |
2010 | } | |
2011 | return true; | |
2012 | } | |
2013 | ||
5532fc5a JL |
2014 | /* Count and return the number of spaces attached to the given BFD. */ |
2015 | ||
2016 | static unsigned long | |
2017 | som_count_spaces (abfd) | |
2018 | bfd *abfd; | |
2019 | { | |
2020 | int count = 0; | |
2021 | asection *section; | |
2022 | ||
2023 | for (section = abfd->sections; section != NULL; section = section->next) | |
2024 | count += som_section_data (section)->is_space; | |
2025 | ||
2026 | return count; | |
2027 | } | |
2028 | ||
2029 | /* Count the number of subspaces attached to the given BFD. */ | |
2030 | ||
2031 | static unsigned long | |
2032 | som_count_subspaces (abfd) | |
2033 | bfd *abfd; | |
2034 | { | |
2035 | int count = 0; | |
2036 | asection *section; | |
2037 | ||
2038 | for (section = abfd->sections; section != NULL; section = section->next) | |
2039 | count += som_section_data (section)->is_subspace; | |
2040 | ||
2041 | return count; | |
2042 | } | |
2043 | ||
2044 | /* Return -1, 0, 1 indicating the relative ordering of sym1 and sym2. | |
2045 | ||
2046 | We desire symbols to be ordered starting with the symbol with the | |
2047 | highest relocation count down to the symbol with the lowest relocation | |
2048 | count. Doing so compacts the relocation stream. */ | |
2049 | ||
2050 | static int | |
2051 | compare_syms (sym1, sym2) | |
2052 | asymbol **sym1; | |
2053 | asymbol **sym2; | |
2054 | ||
2055 | { | |
2056 | unsigned int count1, count2; | |
2057 | ||
2058 | /* Get relocation count for each symbol. Note that the count | |
2059 | is stored in the udata pointer for section symbols! */ | |
2060 | if ((*sym1)->flags & BSF_SECTION_SYM) | |
2061 | count1 = (int)(*sym1)->udata; | |
2062 | else | |
50c5c4ad | 2063 | count1 = som_symbol_data (*sym1)->reloc_count; |
5532fc5a JL |
2064 | |
2065 | if ((*sym2)->flags & BSF_SECTION_SYM) | |
2066 | count2 = (int)(*sym2)->udata; | |
2067 | else | |
50c5c4ad | 2068 | count2 = som_symbol_data (*sym2)->reloc_count; |
5532fc5a JL |
2069 | |
2070 | /* Return the appropriate value. */ | |
2071 | if (count1 < count2) | |
2072 | return 1; | |
2073 | else if (count1 > count2) | |
2074 | return -1; | |
2075 | return 0; | |
2076 | } | |
2077 | ||
aff97790 JL |
2078 | /* Perform various work in preparation for emitting the fixup stream. */ |
2079 | ||
2080 | static void | |
2081 | som_prep_for_fixups (abfd, syms, num_syms) | |
2082 | bfd *abfd; | |
2083 | asymbol **syms; | |
2084 | unsigned long num_syms; | |
2085 | { | |
2086 | int i; | |
2087 | asection *section; | |
2088 | ||
2089 | /* Most SOM relocations involving a symbol have a length which is | |
2090 | dependent on the index of the symbol. So symbols which are | |
2091 | used often in relocations should have a small index. */ | |
2092 | ||
2093 | /* First initialize the counters for each symbol. */ | |
2094 | for (i = 0; i < num_syms; i++) | |
2095 | { | |
2096 | /* Handle a section symbol; these have no pointers back to the | |
2097 | SOM symbol info. So we just use the pointer field (udata) | |
2098 | to hold the relocation count. | |
2099 | ||
2100 | FIXME. While we're here set the name of any section symbol | |
2101 | to something which will not screw GDB. How do other formats | |
2102 | deal with this?!? */ | |
2103 | if (som_symbol_data (syms[i]) == NULL) | |
2104 | { | |
2105 | syms[i]->flags |= BSF_SECTION_SYM; | |
2106 | syms[i]->name = "L$0\002"; | |
2107 | syms[i]->udata = (PTR) 0; | |
2108 | } | |
2109 | else | |
50c5c4ad | 2110 | som_symbol_data (syms[i])->reloc_count = 0; |
aff97790 JL |
2111 | } |
2112 | ||
2113 | /* Now that the counters are initialized, make a weighted count | |
2114 | of how often a given symbol is used in a relocation. */ | |
2115 | for (section = abfd->sections; section != NULL; section = section->next) | |
2116 | { | |
2117 | int i; | |
2118 | ||
2119 | /* Does this section have any relocations? */ | |
2120 | if (section->reloc_count <= 0) | |
2121 | continue; | |
2122 | ||
2123 | /* Walk through each relocation for this section. */ | |
2124 | for (i = 1; i < section->reloc_count; i++) | |
2125 | { | |
2126 | arelent *reloc = section->orelocation[i]; | |
2127 | int scale; | |
2128 | ||
baef2065 JL |
2129 | /* A relocation against a symbol in the *ABS* section really |
2130 | does not have a symbol. Likewise if the symbol isn't associated | |
2131 | with any section. */ | |
2132 | if (reloc->sym_ptr_ptr == NULL | |
2133 | || (*reloc->sym_ptr_ptr)->section == &bfd_abs_section) | |
aff97790 JL |
2134 | continue; |
2135 | ||
2136 | /* Scaling to encourage symbols involved in R_DP_RELATIVE | |
2137 | and R_CODE_ONE_SYMBOL relocations to come first. These | |
2138 | two relocations have single byte versions if the symbol | |
2139 | index is very small. */ | |
2140 | if (reloc->howto->type == R_DP_RELATIVE | |
2141 | || reloc->howto->type == R_CODE_ONE_SYMBOL) | |
2142 | scale = 2; | |
2143 | else | |
2144 | scale = 1; | |
2145 | ||
2146 | /* Handle section symbols by ramming the count in the udata | |
2147 | field. It will not be used and the count is very important | |
2148 | for these symbols. */ | |
2149 | if ((*reloc->sym_ptr_ptr)->flags & BSF_SECTION_SYM) | |
2150 | { | |
2151 | (*reloc->sym_ptr_ptr)->udata = | |
2152 | (PTR) ((int) (*reloc->sym_ptr_ptr)->udata + scale); | |
2153 | continue; | |
2154 | } | |
2155 | ||
2156 | /* A normal symbol. Increment the count. */ | |
50c5c4ad | 2157 | som_symbol_data (*reloc->sym_ptr_ptr)->reloc_count += scale; |
aff97790 JL |
2158 | } |
2159 | } | |
2160 | ||
2161 | /* Now sort the symbols. */ | |
2162 | qsort (syms, num_syms, sizeof (asymbol *), compare_syms); | |
2163 | ||
2164 | /* Compute the symbol indexes, they will be needed by the relocation | |
2165 | code. */ | |
2166 | for (i = 0; i < num_syms; i++) | |
2167 | { | |
2168 | /* A section symbol. Again, there is no pointer to backend symbol | |
2169 | information, so we reuse (abuse) the udata field again. */ | |
2170 | if (syms[i]->flags & BSF_SECTION_SYM) | |
2171 | syms[i]->udata = (PTR) i; | |
2172 | else | |
50c5c4ad | 2173 | som_symbol_data (syms[i])->index = i; |
aff97790 JL |
2174 | } |
2175 | } | |
2176 | ||
9d0dea6f JL |
2177 | static boolean |
2178 | som_write_fixups (abfd, current_offset, total_reloc_sizep) | |
2179 | bfd *abfd; | |
2180 | unsigned long current_offset; | |
2181 | unsigned int *total_reloc_sizep; | |
2182 | { | |
2183 | unsigned int i, j; | |
80425e6c JK |
2184 | /* Chunk of memory that we can use as buffer space, then throw |
2185 | away. */ | |
2186 | unsigned char tmp_space[SOM_TMP_BUFSIZE]; | |
2187 | unsigned char *p; | |
9d0dea6f JL |
2188 | unsigned int total_reloc_size = 0; |
2189 | unsigned int subspace_reloc_size = 0; | |
2190 | unsigned int num_spaces = obj_som_file_hdr (abfd)->space_total; | |
2191 | asection *section = abfd->sections; | |
2192 | ||
6e033f86 | 2193 | memset (tmp_space, 0, SOM_TMP_BUFSIZE); |
9d0dea6f JL |
2194 | p = tmp_space; |
2195 | ||
2196 | /* All the fixups for a particular subspace are emitted in a single | |
2197 | stream. All the subspaces for a particular space are emitted | |
2198 | as a single stream. | |
2199 | ||
2200 | So, to get all the locations correct one must iterate through all the | |
2201 | spaces, for each space iterate through its subspaces and output a | |
2202 | fixups stream. */ | |
2203 | for (i = 0; i < num_spaces; i++) | |
2204 | { | |
2205 | asection *subsection; | |
2206 | ||
2207 | /* Find a space. */ | |
2208 | while (som_section_data (section)->is_space == 0) | |
2209 | section = section->next; | |
2210 | ||
2211 | /* Now iterate through each of its subspaces. */ | |
2212 | for (subsection = abfd->sections; | |
2213 | subsection != NULL; | |
2214 | subsection = subsection->next) | |
2215 | { | |
017a52d7 | 2216 | int reloc_offset, current_rounding_mode; |
9d0dea6f JL |
2217 | |
2218 | /* Find a subspace of this space. */ | |
2219 | if (som_section_data (subsection)->is_subspace == 0 | |
2220 | || som_section_data (subsection)->containing_space != section) | |
2221 | continue; | |
2222 | ||
2223 | /* If this subspace had no relocations, then we're finished | |
2224 | with it. */ | |
2225 | if (subsection->reloc_count <= 0) | |
2226 | { | |
2227 | som_section_data (subsection)->subspace_dict.fixup_request_index | |
2228 | = -1; | |
2229 | continue; | |
2230 | } | |
2231 | ||
2232 | /* This subspace has some relocations. Put the relocation stream | |
2233 | index into the subspace record. */ | |
2234 | som_section_data (subsection)->subspace_dict.fixup_request_index | |
2235 | = total_reloc_size; | |
2236 | ||
2237 | /* To make life easier start over with a clean slate for | |
2238 | each subspace. Seek to the start of the relocation stream | |
2239 | for this subspace in preparation for writing out its fixup | |
2240 | stream. */ | |
2241 | if (bfd_seek (abfd, current_offset + total_reloc_size, SEEK_SET) != 0) | |
2242 | { | |
d1ad85a6 | 2243 | bfd_set_error (bfd_error_system_call); |
9d0dea6f JL |
2244 | return false; |
2245 | } | |
2246 | ||
2247 | /* Buffer space has already been allocated. Just perform some | |
2248 | initialization here. */ | |
2249 | p = tmp_space; | |
2250 | subspace_reloc_size = 0; | |
2251 | reloc_offset = 0; | |
2252 | som_initialize_reloc_queue (reloc_queue); | |
017a52d7 | 2253 | current_rounding_mode = R_N_MODE; |
9d0dea6f JL |
2254 | |
2255 | /* Translate each BFD relocation into one or more SOM | |
2256 | relocations. */ | |
2257 | for (j = 0; j < subsection->reloc_count; j++) | |
2258 | { | |
2259 | arelent *bfd_reloc = subsection->orelocation[j]; | |
2260 | unsigned int skip; | |
2261 | int sym_num; | |
2262 | ||
2263 | /* Get the symbol number. Remember it's stored in a | |
2264 | special place for section symbols. */ | |
2265 | if ((*bfd_reloc->sym_ptr_ptr)->flags & BSF_SECTION_SYM) | |
2266 | sym_num = (int) (*bfd_reloc->sym_ptr_ptr)->udata; | |
2267 | else | |
50c5c4ad | 2268 | sym_num = som_symbol_data (*bfd_reloc->sym_ptr_ptr)->index; |
9d0dea6f JL |
2269 | |
2270 | /* If there is not enough room for the next couple relocations, | |
2271 | then dump the current buffer contents now. Also reinitialize | |
2272 | the relocation queue. | |
2273 | ||
7430a991 JL |
2274 | No single BFD relocation could ever translate into more |
2275 | than 100 bytes of SOM relocations (20bytes is probably the | |
2276 | upper limit, but leave lots of space for growth). */ | |
9d0dea6f JL |
2277 | if (p - tmp_space + 100 > SOM_TMP_BUFSIZE) |
2278 | { | |
2279 | if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd) | |
2280 | != p - tmp_space) | |
2281 | { | |
d1ad85a6 | 2282 | bfd_set_error (bfd_error_system_call); |
9d0dea6f JL |
2283 | return false; |
2284 | } | |
2285 | p = tmp_space; | |
2286 | som_initialize_reloc_queue (reloc_queue); | |
2287 | } | |
2288 | ||
2289 | /* Emit R_NO_RELOCATION fixups to map any bytes which were | |
2290 | skipped. */ | |
2291 | skip = bfd_reloc->address - reloc_offset; | |
2292 | p = som_reloc_skip (abfd, skip, p, | |
2293 | &subspace_reloc_size, reloc_queue); | |
2294 | ||
2295 | /* Update reloc_offset for the next iteration. | |
2296 | ||
017a52d7 JL |
2297 | Many relocations do not consume input bytes. They |
2298 | are markers, or set state necessary to perform some | |
2299 | later relocation. */ | |
2300 | switch (bfd_reloc->howto->type) | |
2301 | { | |
2302 | /* This only needs to handle relocations that may be | |
2303 | made by hppa_som_gen_reloc. */ | |
2304 | case R_ENTRY: | |
2305 | case R_EXIT: | |
2306 | case R_N_MODE: | |
2307 | case R_S_MODE: | |
2308 | case R_D_MODE: | |
2309 | case R_R_MODE: | |
a36b6f1d JL |
2310 | case R_FSEL: |
2311 | case R_LSEL: | |
2312 | case R_RSEL: | |
017a52d7 JL |
2313 | reloc_offset = bfd_reloc->address; |
2314 | break; | |
9d0dea6f | 2315 | |
017a52d7 JL |
2316 | default: |
2317 | reloc_offset = bfd_reloc->address + 4; | |
2318 | break; | |
2319 | } | |
9d0dea6f JL |
2320 | |
2321 | /* Now the actual relocation we care about. */ | |
2322 | switch (bfd_reloc->howto->type) | |
2323 | { | |
2324 | case R_PCREL_CALL: | |
2325 | case R_ABS_CALL: | |
2326 | p = som_reloc_call (abfd, p, &subspace_reloc_size, | |
2327 | bfd_reloc, sym_num, reloc_queue); | |
2328 | break; | |
2329 | ||
2330 | case R_CODE_ONE_SYMBOL: | |
2331 | case R_DP_RELATIVE: | |
2332 | /* Account for any addend. */ | |
2333 | if (bfd_reloc->addend) | |
2334 | p = som_reloc_addend (abfd, bfd_reloc->addend, p, | |
2335 | &subspace_reloc_size, reloc_queue); | |
2336 | ||
2337 | if (sym_num < 0x20) | |
2338 | { | |
2339 | bfd_put_8 (abfd, bfd_reloc->howto->type + sym_num, p); | |
2340 | subspace_reloc_size += 1; | |
2341 | p += 1; | |
2342 | } | |
2343 | else if (sym_num < 0x100) | |
2344 | { | |
2345 | bfd_put_8 (abfd, bfd_reloc->howto->type + 32, p); | |
2346 | bfd_put_8 (abfd, sym_num, p + 1); | |
2347 | p = try_prev_fixup (abfd, &subspace_reloc_size, p, | |
2348 | 2, reloc_queue); | |
2349 | } | |
2350 | else if (sym_num < 0x10000000) | |
2351 | { | |
2352 | bfd_put_8 (abfd, bfd_reloc->howto->type + 33, p); | |
2353 | bfd_put_8 (abfd, sym_num >> 16, p + 1); | |
2354 | bfd_put_16 (abfd, sym_num, p + 2); | |
2355 | p = try_prev_fixup (abfd, &subspace_reloc_size, | |
2356 | p, 4, reloc_queue); | |
2357 | } | |
2358 | else | |
2359 | abort (); | |
2360 | break; | |
2361 | ||
2362 | case R_DATA_ONE_SYMBOL: | |
2363 | case R_DATA_PLABEL: | |
2364 | case R_CODE_PLABEL: | |
a36b6f1d | 2365 | case R_DLT_REL: |
9d0dea6f JL |
2366 | /* Account for any addend. */ |
2367 | if (bfd_reloc->addend) | |
2368 | p = som_reloc_addend (abfd, bfd_reloc->addend, p, | |
2369 | &subspace_reloc_size, reloc_queue); | |
2370 | ||
2371 | if (sym_num < 0x100) | |
2372 | { | |
2373 | bfd_put_8 (abfd, bfd_reloc->howto->type, p); | |
2374 | bfd_put_8 (abfd, sym_num, p + 1); | |
2375 | p = try_prev_fixup (abfd, &subspace_reloc_size, p, | |
2376 | 2, reloc_queue); | |
2377 | } | |
2378 | else if (sym_num < 0x10000000) | |
2379 | { | |
2380 | bfd_put_8 (abfd, bfd_reloc->howto->type + 1, p); | |
2381 | bfd_put_8 (abfd, sym_num >> 16, p + 1); | |
2382 | bfd_put_16 (abfd, sym_num, p + 2); | |
2383 | p = try_prev_fixup (abfd, &subspace_reloc_size, | |
2384 | p, 4, reloc_queue); | |
2385 | } | |
2386 | else | |
2387 | abort (); | |
2388 | break; | |
2389 | ||
2390 | case R_ENTRY: | |
2391 | { | |
2392 | int *descp | |
50c5c4ad | 2393 | = (int *) som_symbol_data (*bfd_reloc->sym_ptr_ptr)->unwind; |
9d0dea6f JL |
2394 | bfd_put_8 (abfd, R_ENTRY, p); |
2395 | bfd_put_32 (abfd, descp[0], p + 1); | |
2396 | bfd_put_32 (abfd, descp[1], p + 5); | |
2397 | p = try_prev_fixup (abfd, &subspace_reloc_size, | |
2398 | p, 9, reloc_queue); | |
2399 | break; | |
2400 | } | |
2401 | ||
2402 | case R_EXIT: | |
2403 | bfd_put_8 (abfd, R_EXIT, p); | |
2404 | subspace_reloc_size += 1; | |
2405 | p += 1; | |
2406 | break; | |
2407 | ||
017a52d7 JL |
2408 | case R_N_MODE: |
2409 | case R_S_MODE: | |
2410 | case R_D_MODE: | |
2411 | case R_R_MODE: | |
2412 | /* If this relocation requests the current rounding | |
2413 | mode, then it is redundant. */ | |
2414 | if (bfd_reloc->howto->type != current_rounding_mode) | |
2415 | { | |
2416 | bfd_put_8 (abfd, bfd_reloc->howto->type, p); | |
2417 | subspace_reloc_size += 1; | |
2418 | p += 1; | |
2419 | current_rounding_mode = bfd_reloc->howto->type; | |
2420 | } | |
2421 | break; | |
2422 | ||
a36b6f1d JL |
2423 | case R_FSEL: |
2424 | case R_LSEL: | |
2425 | case R_RSEL: | |
2426 | bfd_put_8 (abfd, bfd_reloc->howto->type, p); | |
2427 | subspace_reloc_size += 1; | |
2428 | p += 1; | |
2429 | break; | |
2430 | ||
9d0dea6f JL |
2431 | /* Put a "R_RESERVED" relocation in the stream if |
2432 | we hit something we do not understand. The linker | |
2433 | will complain loudly if this ever happens. */ | |
2434 | default: | |
2435 | bfd_put_8 (abfd, 0xff, p); | |
2436 | subspace_reloc_size += 1; | |
2437 | p += 1; | |
017a52d7 | 2438 | break; |
9d0dea6f JL |
2439 | } |
2440 | } | |
2441 | ||
2442 | /* Last BFD relocation for a subspace has been processed. | |
2443 | Map the rest of the subspace with R_NO_RELOCATION fixups. */ | |
2444 | p = som_reloc_skip (abfd, bfd_section_size (abfd, subsection) | |
2445 | - reloc_offset, | |
2446 | p, &subspace_reloc_size, reloc_queue); | |
2447 | ||
2448 | /* Scribble out the relocations. */ | |
2449 | if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd) | |
2450 | != p - tmp_space) | |
2451 | { | |
d1ad85a6 | 2452 | bfd_set_error (bfd_error_system_call); |
9d0dea6f JL |
2453 | return false; |
2454 | } | |
2455 | p = tmp_space; | |
2456 | ||
2457 | total_reloc_size += subspace_reloc_size; | |
2458 | som_section_data (subsection)->subspace_dict.fixup_request_quantity | |
2459 | = subspace_reloc_size; | |
2460 | } | |
2461 | section = section->next; | |
2462 | } | |
2463 | *total_reloc_sizep = total_reloc_size; | |
2464 | return true; | |
2465 | } | |
2466 | ||
0b35f7ec JL |
2467 | /* Write out the space/subspace string table. */ |
2468 | ||
2469 | static boolean | |
2470 | som_write_space_strings (abfd, current_offset, string_sizep) | |
2471 | bfd *abfd; | |
2472 | unsigned long current_offset; | |
2473 | unsigned int *string_sizep; | |
2474 | { | |
80425e6c JK |
2475 | /* Chunk of memory that we can use as buffer space, then throw |
2476 | away. */ | |
2477 | unsigned char tmp_space[SOM_TMP_BUFSIZE]; | |
2478 | unsigned char *p; | |
0b35f7ec JL |
2479 | unsigned int strings_size = 0; |
2480 | asection *section; | |
2481 | ||
6e033f86 | 2482 | memset (tmp_space, 0, SOM_TMP_BUFSIZE); |
0b35f7ec JL |
2483 | p = tmp_space; |
2484 | ||
2485 | /* Seek to the start of the space strings in preparation for writing | |
2486 | them out. */ | |
2487 | if (bfd_seek (abfd, current_offset, SEEK_SET) != 0) | |
2488 | { | |
d1ad85a6 | 2489 | bfd_set_error (bfd_error_system_call); |
0b35f7ec JL |
2490 | return false; |
2491 | } | |
2492 | ||
2493 | /* Walk through all the spaces and subspaces (order is not important) | |
2494 | building up and writing string table entries for their names. */ | |
2495 | for (section = abfd->sections; section != NULL; section = section->next) | |
2496 | { | |
2497 | int length; | |
2498 | ||
2499 | /* Only work with space/subspaces; avoid any other sections | |
2500 | which might have been made (.text for example). */ | |
2501 | if (som_section_data (section)->is_space == 0 | |
2502 | && som_section_data (section)->is_subspace == 0) | |
2503 | continue; | |
2504 | ||
2505 | /* Get the length of the space/subspace name. */ | |
2506 | length = strlen (section->name); | |
2507 | ||
2508 | /* If there is not enough room for the next entry, then dump the | |
2509 | current buffer contents now. Each entry will take 4 bytes to | |
2510 | hold the string length + the string itself + null terminator. */ | |
2511 | if (p - tmp_space + 5 + length > SOM_TMP_BUFSIZE) | |
2512 | { | |
80425e6c | 2513 | if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd) |
0b35f7ec JL |
2514 | != p - tmp_space) |
2515 | { | |
d1ad85a6 | 2516 | bfd_set_error (bfd_error_system_call); |
0b35f7ec JL |
2517 | return false; |
2518 | } | |
2519 | /* Reset to beginning of the buffer space. */ | |
2520 | p = tmp_space; | |
2521 | } | |
2522 | ||
2523 | /* First element in a string table entry is the length of the | |
2524 | string. Alignment issues are already handled. */ | |
2525 | bfd_put_32 (abfd, length, p); | |
2526 | p += 4; | |
2527 | strings_size += 4; | |
2528 | ||
2529 | /* Record the index in the space/subspace records. */ | |
2530 | if (som_section_data (section)->is_space) | |
2531 | som_section_data (section)->space_dict.name.n_strx = strings_size; | |
2532 | else | |
2533 | som_section_data (section)->subspace_dict.name.n_strx = strings_size; | |
2534 | ||
2535 | /* Next comes the string itself + a null terminator. */ | |
2536 | strcpy (p, section->name); | |
2537 | p += length + 1; | |
2538 | strings_size += length + 1; | |
2539 | ||
2540 | /* Always align up to the next word boundary. */ | |
2541 | while (strings_size % 4) | |
2542 | { | |
2543 | bfd_put_8 (abfd, 0, p); | |
2544 | p++; | |
2545 | strings_size++; | |
2546 | } | |
2547 | } | |
2548 | ||
2549 | /* Done with the space/subspace strings. Write out any information | |
2550 | contained in a partial block. */ | |
80425e6c | 2551 | if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd) != p - tmp_space) |
0b35f7ec | 2552 | { |
d1ad85a6 | 2553 | bfd_set_error (bfd_error_system_call); |
0b35f7ec JL |
2554 | return false; |
2555 | } | |
2556 | *string_sizep = strings_size; | |
2557 | return true; | |
2558 | } | |
2559 | ||
2560 | /* Write out the symbol string table. */ | |
2561 | ||
2562 | static boolean | |
2563 | som_write_symbol_strings (abfd, current_offset, syms, num_syms, string_sizep) | |
2564 | bfd *abfd; | |
2565 | unsigned long current_offset; | |
2566 | asymbol **syms; | |
2567 | unsigned int num_syms; | |
2568 | unsigned int *string_sizep; | |
2569 | { | |
2570 | unsigned int i; | |
80425e6c JK |
2571 | |
2572 | /* Chunk of memory that we can use as buffer space, then throw | |
2573 | away. */ | |
2574 | unsigned char tmp_space[SOM_TMP_BUFSIZE]; | |
2575 | unsigned char *p; | |
0b35f7ec JL |
2576 | unsigned int strings_size = 0; |
2577 | ||
6e033f86 | 2578 | memset (tmp_space, 0, SOM_TMP_BUFSIZE); |
0b35f7ec JL |
2579 | p = tmp_space; |
2580 | ||
2581 | /* Seek to the start of the space strings in preparation for writing | |
2582 | them out. */ | |
2583 | if (bfd_seek (abfd, current_offset, SEEK_SET) != 0) | |
2584 | { | |
d1ad85a6 | 2585 | bfd_set_error (bfd_error_system_call); |
0b35f7ec JL |
2586 | return false; |
2587 | } | |
2588 | ||
2589 | for (i = 0; i < num_syms; i++) | |
2590 | { | |
2591 | int length = strlen (syms[i]->name); | |
2592 | ||
2593 | /* If there is not enough room for the next entry, then dump the | |
2594 | current buffer contents now. */ | |
2595 | if (p - tmp_space + 5 + length > SOM_TMP_BUFSIZE) | |
2596 | { | |
80425e6c | 2597 | if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd) |
0b35f7ec JL |
2598 | != p - tmp_space) |
2599 | { | |
d1ad85a6 | 2600 | bfd_set_error (bfd_error_system_call); |
0b35f7ec JL |
2601 | return false; |
2602 | } | |
2603 | /* Reset to beginning of the buffer space. */ | |
2604 | p = tmp_space; | |
2605 | } | |
2606 | ||
2607 | /* First element in a string table entry is the length of the | |
2608 | string. This must always be 4 byte aligned. This is also | |
2609 | an appropriate time to fill in the string index field in the | |
2610 | symbol table entry. */ | |
2611 | bfd_put_32 (abfd, length, p); | |
2612 | strings_size += 4; | |
2613 | p += 4; | |
2614 | ||
2615 | /* Next comes the string itself + a null terminator. */ | |
2616 | strcpy (p, syms[i]->name); | |
2617 | ||
2618 | /* ACK. FIXME. */ | |
2619 | syms[i]->name = (char *)strings_size; | |
2620 | p += length + 1; | |
2621 | strings_size += length + 1; | |
2622 | ||
2623 | /* Always align up to the next word boundary. */ | |
2624 | while (strings_size % 4) | |
2625 | { | |
2626 | bfd_put_8 (abfd, 0, p); | |
2627 | strings_size++; | |
2628 | p++; | |
2629 | } | |
2630 | } | |
2631 | ||
2632 | /* Scribble out any partial block. */ | |
80425e6c | 2633 | if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd) != p - tmp_space) |
0b35f7ec | 2634 | { |
d1ad85a6 | 2635 | bfd_set_error (bfd_error_system_call); |
0b35f7ec JL |
2636 | return false; |
2637 | } | |
2638 | ||
2639 | *string_sizep = strings_size; | |
2640 | return true; | |
2641 | } | |
2642 | ||
6eb64408 JL |
2643 | /* Compute variable information to be placed in the SOM headers, |
2644 | space/subspace dictionaries, relocation streams, etc. Begin | |
2645 | writing parts of the object file. */ | |
2646 | ||
2647 | static boolean | |
2648 | som_begin_writing (abfd) | |
2649 | bfd *abfd; | |
2650 | { | |
2651 | unsigned long current_offset = 0; | |
2652 | int strings_size = 0; | |
2653 | unsigned int total_reloc_size = 0; | |
2654 | unsigned long num_spaces, num_subspaces, num_syms, i; | |
2655 | asection *section; | |
2656 | asymbol **syms = bfd_get_outsymbols (abfd); | |
2657 | unsigned int total_subspaces = 0; | |
2658 | ||
2659 | /* The file header will always be first in an object file, | |
2660 | everything else can be in random locations. To keep things | |
2661 | "simple" BFD will lay out the object file in the manner suggested | |
2662 | by the PRO ABI for PA-RISC Systems. */ | |
2663 | ||
2664 | /* Before any output can really begin offsets for all the major | |
2665 | portions of the object file must be computed. So, starting | |
2666 | with the initial file header compute (and sometimes write) | |
2667 | each portion of the object file. */ | |
2668 | ||
2669 | /* Make room for the file header, it's contents are not complete | |
2670 | yet, so it can not be written at this time. */ | |
2671 | current_offset += sizeof (struct header); | |
2672 | ||
2673 | /* Any auxiliary headers will follow the file header. Right now | |
f6c2300b | 2674 | we support only the copyright and version headers. */ |
6eb64408 JL |
2675 | obj_som_file_hdr (abfd)->aux_header_location = current_offset; |
2676 | obj_som_file_hdr (abfd)->aux_header_size = 0; | |
f6c2300b JL |
2677 | if (obj_som_version_hdr (abfd) != NULL) |
2678 | { | |
2679 | unsigned int len; | |
2680 | ||
2681 | bfd_seek (abfd, current_offset, SEEK_SET); | |
2682 | ||
2683 | /* Write the aux_id structure and the string length. */ | |
2684 | len = sizeof (struct aux_id) + sizeof (unsigned int); | |
2685 | obj_som_file_hdr (abfd)->aux_header_size += len; | |
2686 | current_offset += len; | |
2687 | if (bfd_write ((PTR) obj_som_version_hdr (abfd), len, 1, abfd) != len) | |
2688 | { | |
d1ad85a6 | 2689 | bfd_set_error (bfd_error_system_call); |
f6c2300b JL |
2690 | return false; |
2691 | } | |
2692 | ||
2693 | /* Write the version string. */ | |
39961154 | 2694 | len = obj_som_version_hdr (abfd)->header_id.length - sizeof (int); |
f6c2300b JL |
2695 | obj_som_file_hdr (abfd)->aux_header_size += len; |
2696 | current_offset += len; | |
2697 | if (bfd_write ((PTR) obj_som_version_hdr (abfd)->user_string, | |
2698 | len, 1, abfd) != len) | |
2699 | { | |
d1ad85a6 | 2700 | bfd_set_error (bfd_error_system_call); |
f6c2300b JL |
2701 | return false; |
2702 | } | |
2703 | } | |
6eb64408 | 2704 | |
f6c2300b JL |
2705 | if (obj_som_copyright_hdr (abfd) != NULL) |
2706 | { | |
2707 | unsigned int len; | |
2708 | ||
2709 | bfd_seek (abfd, current_offset, SEEK_SET); | |
2710 | ||
2711 | /* Write the aux_id structure and the string length. */ | |
2712 | len = sizeof (struct aux_id) + sizeof (unsigned int); | |
2713 | obj_som_file_hdr (abfd)->aux_header_size += len; | |
2714 | current_offset += len; | |
2715 | if (bfd_write ((PTR) obj_som_copyright_hdr (abfd), len, 1, abfd) != len) | |
2716 | { | |
d1ad85a6 | 2717 | bfd_set_error (bfd_error_system_call); |
f6c2300b JL |
2718 | return false; |
2719 | } | |
2720 | ||
2721 | /* Write the copyright string. */ | |
39961154 | 2722 | len = obj_som_copyright_hdr (abfd)->header_id.length - sizeof (int); |
f6c2300b JL |
2723 | obj_som_file_hdr (abfd)->aux_header_size += len; |
2724 | current_offset += len; | |
2725 | if (bfd_write ((PTR) obj_som_copyright_hdr (abfd)->copyright, | |
2726 | len, 1, abfd) != len) | |
2727 | { | |
d1ad85a6 | 2728 | bfd_set_error (bfd_error_system_call); |
f6c2300b JL |
2729 | return false; |
2730 | } | |
2731 | } | |
2732 | ||
2733 | /* Next comes the initialization pointers; we have no initialization | |
2734 | pointers, so current offset does not change. */ | |
6eb64408 JL |
2735 | obj_som_file_hdr (abfd)->init_array_location = current_offset; |
2736 | obj_som_file_hdr (abfd)->init_array_total = 0; | |
2737 | ||
2738 | /* Next are the space records. These are fixed length records. | |
2739 | ||
2740 | Count the number of spaces to determine how much room is needed | |
2741 | in the object file for the space records. | |
2742 | ||
2743 | The names of the spaces are stored in a separate string table, | |
2744 | and the index for each space into the string table is computed | |
2745 | below. Therefore, it is not possible to write the space headers | |
2746 | at this time. */ | |
2747 | num_spaces = som_count_spaces (abfd); | |
2748 | obj_som_file_hdr (abfd)->space_location = current_offset; | |
2749 | obj_som_file_hdr (abfd)->space_total = num_spaces; | |
2750 | current_offset += num_spaces * sizeof (struct space_dictionary_record); | |
2751 | ||
2752 | /* Next are the subspace records. These are fixed length records. | |
2753 | ||
2754 | Count the number of subspaes to determine how much room is needed | |
2755 | in the object file for the subspace records. | |
2756 | ||
2757 | A variety if fields in the subspace record are still unknown at | |
2758 | this time (index into string table, fixup stream location/size, etc). */ | |
2759 | num_subspaces = som_count_subspaces (abfd); | |
2760 | obj_som_file_hdr (abfd)->subspace_location = current_offset; | |
2761 | obj_som_file_hdr (abfd)->subspace_total = num_subspaces; | |
2762 | current_offset += num_subspaces * sizeof (struct subspace_dictionary_record); | |
2763 | ||
2764 | /* Next is the string table for the space/subspace names. We will | |
2765 | build and write the string table on the fly. At the same time | |
2766 | we will fill in the space/subspace name index fields. */ | |
2767 | ||
2768 | /* The string table needs to be aligned on a word boundary. */ | |
2769 | if (current_offset % 4) | |
2770 | current_offset += (4 - (current_offset % 4)); | |
2771 | ||
2772 | /* Mark the offset of the space/subspace string table in the | |
2773 | file header. */ | |
2774 | obj_som_file_hdr (abfd)->space_strings_location = current_offset; | |
2775 | ||
2776 | /* Scribble out the space strings. */ | |
2777 | if (som_write_space_strings (abfd, current_offset, &strings_size) == false) | |
2778 | return false; | |
2779 | ||
2780 | /* Record total string table size in the header and update the | |
2781 | current offset. */ | |
2782 | obj_som_file_hdr (abfd)->space_strings_size = strings_size; | |
2783 | current_offset += strings_size; | |
2784 | ||
2785 | /* Next is the symbol table. These are fixed length records. | |
2786 | ||
2787 | Count the number of symbols to determine how much room is needed | |
2788 | in the object file for the symbol table. | |
2789 | ||
2790 | The names of the symbols are stored in a separate string table, | |
2791 | and the index for each symbol name into the string table is computed | |
2792 | below. Therefore, it is not possible to write the symobl table | |
2793 | at this time. */ | |
2794 | num_syms = bfd_get_symcount (abfd); | |
2795 | obj_som_file_hdr (abfd)->symbol_location = current_offset; | |
2796 | obj_som_file_hdr (abfd)->symbol_total = num_syms; | |
2797 | current_offset += num_syms * sizeof (struct symbol_dictionary_record); | |
2798 | ||
2799 | /* Do prep work before handling fixups. */ | |
2800 | som_prep_for_fixups (abfd, syms, num_syms); | |
2801 | ||
2802 | /* Next comes the fixup stream which starts on a word boundary. */ | |
2803 | if (current_offset % 4) | |
2804 | current_offset += (4 - (current_offset % 4)); | |
2805 | obj_som_file_hdr (abfd)->fixup_request_location = current_offset; | |
2806 | ||
2807 | /* Write the fixups and update fields in subspace headers which | |
2808 | relate to the fixup stream. */ | |
2809 | if (som_write_fixups (abfd, current_offset, &total_reloc_size) == false) | |
2810 | return false; | |
2811 | ||
2812 | /* Record the total size of the fixup stream in the file header. */ | |
2813 | obj_som_file_hdr (abfd)->fixup_request_total = total_reloc_size; | |
2814 | current_offset += total_reloc_size; | |
2815 | ||
2816 | /* Next are the symbol strings. | |
2817 | Align them to a word boundary. */ | |
2818 | if (current_offset % 4) | |
2819 | current_offset += (4 - (current_offset % 4)); | |
2820 | obj_som_file_hdr (abfd)->symbol_strings_location = current_offset; | |
2821 | ||
2822 | /* Scribble out the symbol strings. */ | |
2823 | if (som_write_symbol_strings (abfd, current_offset, syms, | |
2824 | num_syms, &strings_size) | |
2825 | == false) | |
2826 | return false; | |
2827 | ||
2828 | /* Record total string table size in header and update the | |
2829 | current offset. */ | |
2830 | obj_som_file_hdr (abfd)->symbol_strings_size = strings_size; | |
2831 | current_offset += strings_size; | |
2832 | ||
2833 | /* Next is the compiler records. We do not use these. */ | |
2834 | obj_som_file_hdr (abfd)->compiler_location = current_offset; | |
2835 | obj_som_file_hdr (abfd)->compiler_total = 0; | |
2836 | ||
2837 | /* Now compute the file positions for the loadable subspaces. */ | |
2838 | ||
2839 | section = abfd->sections; | |
2840 | for (i = 0; i < num_spaces; i++) | |
2841 | { | |
2842 | asection *subsection; | |
2843 | ||
2844 | /* Find a space. */ | |
2845 | while (som_section_data (section)->is_space == 0) | |
2846 | section = section->next; | |
2847 | ||
2848 | /* Now look for all its subspaces. */ | |
2849 | for (subsection = abfd->sections; | |
2850 | subsection != NULL; | |
2851 | subsection = subsection->next) | |
2852 | { | |
2853 | ||
2854 | if (som_section_data (subsection)->is_subspace == 0 | |
2855 | || som_section_data (subsection)->containing_space != section | |
2856 | || (subsection->flags & SEC_ALLOC) == 0) | |
2857 | continue; | |
2858 | ||
2859 | som_section_data (subsection)->subspace_index = total_subspaces++; | |
2860 | /* This is real data to be loaded from the file. */ | |
2861 | if (subsection->flags & SEC_LOAD) | |
2862 | { | |
2863 | som_section_data (subsection)->subspace_dict.file_loc_init_value | |
2864 | = current_offset; | |
2865 | section->filepos = current_offset; | |
2866 | current_offset += bfd_section_size (abfd, subsection); | |
2867 | } | |
2868 | /* Looks like uninitialized data. */ | |
2869 | else | |
2870 | { | |
2871 | som_section_data (subsection)->subspace_dict.file_loc_init_value | |
2872 | = 0; | |
2873 | som_section_data (subsection)->subspace_dict. | |
2874 | initialization_length = 0; | |
2875 | } | |
2876 | } | |
2877 | /* Goto the next section. */ | |
2878 | section = section->next; | |
2879 | } | |
2880 | ||
2881 | /* Finally compute the file positions for unloadable subspaces. */ | |
2882 | ||
2883 | obj_som_file_hdr (abfd)->unloadable_sp_location = current_offset; | |
2884 | section = abfd->sections; | |
2885 | for (i = 0; i < num_spaces; i++) | |
2886 | { | |
2887 | asection *subsection; | |
2888 | ||
2889 | /* Find a space. */ | |
2890 | while (som_section_data (section)->is_space == 0) | |
2891 | section = section->next; | |
2892 | ||
2893 | /* Now look for all its subspaces. */ | |
2894 | for (subsection = abfd->sections; | |
2895 | subsection != NULL; | |
2896 | subsection = subsection->next) | |
2897 | { | |
2898 | ||
2899 | if (som_section_data (subsection)->is_subspace == 0 | |
2900 | || som_section_data (subsection)->containing_space != section | |
2901 | || (subsection->flags & SEC_ALLOC) != 0) | |
2902 | continue; | |
2903 | ||
2904 | som_section_data (subsection)->subspace_index = total_subspaces++; | |
2905 | /* This is real data to be loaded from the file. */ | |
2906 | if ((subsection->flags & SEC_LOAD) == 0) | |
2907 | { | |
2908 | som_section_data (subsection)->subspace_dict.file_loc_init_value | |
2909 | = current_offset; | |
2910 | section->filepos = current_offset; | |
2911 | current_offset += bfd_section_size (abfd, subsection); | |
2912 | } | |
2913 | /* Looks like uninitialized data. */ | |
2914 | else | |
2915 | { | |
2916 | som_section_data (subsection)->subspace_dict.file_loc_init_value | |
2917 | = 0; | |
2918 | som_section_data (subsection)->subspace_dict. | |
2919 | initialization_length = bfd_section_size (abfd, subsection); | |
2920 | } | |
2921 | } | |
2922 | /* Goto the next section. */ | |
2923 | section = section->next; | |
2924 | } | |
2925 | ||
2926 | obj_som_file_hdr (abfd)->unloadable_sp_size | |
2927 | = current_offset - obj_som_file_hdr (abfd)->unloadable_sp_location; | |
2928 | ||
2929 | /* Loader fixups are not supported in any way shape or form. */ | |
2930 | obj_som_file_hdr (abfd)->loader_fixup_location = 0; | |
2931 | obj_som_file_hdr (abfd)->loader_fixup_total = 0; | |
2932 | ||
2933 | /* Done. Store the total size of the SOM. */ | |
2934 | obj_som_file_hdr (abfd)->som_length = current_offset; | |
2935 | return true; | |
2936 | } | |
2937 | ||
efc0df7c JL |
2938 | /* Finally, scribble out the various headers to the disk. */ |
2939 | ||
2940 | static boolean | |
2941 | som_write_headers (abfd) | |
2942 | bfd *abfd; | |
2943 | { | |
2944 | int num_spaces = som_count_spaces (abfd); | |
2945 | int i; | |
2946 | int subspace_index = 0; | |
2947 | file_ptr location; | |
2948 | asection *section; | |
2949 | ||
2950 | /* Subspaces are written first so that we can set up information | |
2951 | about them in their containing spaces as the subspace is written. */ | |
2952 | ||
2953 | /* Seek to the start of the subspace dictionary records. */ | |
2954 | location = obj_som_file_hdr (abfd)->subspace_location; | |
2955 | bfd_seek (abfd, location, SEEK_SET); | |
2956 | section = abfd->sections; | |
2957 | /* Now for each loadable space write out records for its subspaces. */ | |
2958 | for (i = 0; i < num_spaces; i++) | |
2959 | { | |
2960 | asection *subsection; | |
2961 | ||
2962 | /* Find a space. */ | |
2963 | while (som_section_data (section)->is_space == 0) | |
2964 | section = section->next; | |
2965 | ||
2966 | /* Now look for all its subspaces. */ | |
2967 | for (subsection = abfd->sections; | |
2968 | subsection != NULL; | |
2969 | subsection = subsection->next) | |
2970 | { | |
2971 | ||
2972 | /* Skip any section which does not correspond to a space | |
2973 | or subspace. Or does not have SEC_ALLOC set (and therefore | |
2974 | has no real bits on the disk). */ | |
2975 | if (som_section_data (subsection)->is_subspace == 0 | |
2976 | || som_section_data (subsection)->containing_space != section | |
2977 | || (subsection->flags & SEC_ALLOC) == 0) | |
2978 | continue; | |
2979 | ||
2980 | /* If this is the first subspace for this space, then save | |
2981 | the index of the subspace in its containing space. Also | |
2982 | set "is_loadable" in the containing space. */ | |
2983 | ||
2984 | if (som_section_data (section)->space_dict.subspace_quantity == 0) | |
2985 | { | |
2986 | som_section_data (section)->space_dict.is_loadable = 1; | |
2987 | som_section_data (section)->space_dict.subspace_index | |
2988 | = subspace_index; | |
2989 | } | |
2990 | ||
2991 | /* Increment the number of subspaces seen and the number of | |
2992 | subspaces contained within the current space. */ | |
2993 | subspace_index++; | |
2994 | som_section_data (section)->space_dict.subspace_quantity++; | |
2995 | ||
2996 | /* Mark the index of the current space within the subspace's | |
2997 | dictionary record. */ | |
2998 | som_section_data (subsection)->subspace_dict.space_index = i; | |
2999 | ||
3000 | /* Dump the current subspace header. */ | |
3001 | if (bfd_write ((PTR) &som_section_data (subsection)->subspace_dict, | |
3002 | sizeof (struct subspace_dictionary_record), 1, abfd) | |
3003 | != sizeof (struct subspace_dictionary_record)) | |
3004 | { | |
d1ad85a6 | 3005 | bfd_set_error (bfd_error_system_call); |
efc0df7c JL |
3006 | return false; |
3007 | } | |
3008 | } | |
3009 | /* Goto the next section. */ | |
3010 | section = section->next; | |
3011 | } | |
3012 | ||
3013 | /* Now repeat the process for unloadable subspaces. */ | |
3014 | section = abfd->sections; | |
3015 | /* Now for each space write out records for its subspaces. */ | |
3016 | for (i = 0; i < num_spaces; i++) | |
3017 | { | |
3018 | asection *subsection; | |
3019 | ||
3020 | /* Find a space. */ | |
3021 | while (som_section_data (section)->is_space == 0) | |
3022 | section = section->next; | |
3023 | ||
3024 | /* Now look for all its subspaces. */ | |
3025 | for (subsection = abfd->sections; | |
3026 | subsection != NULL; | |
3027 | subsection = subsection->next) | |
3028 | { | |
3029 | ||
3030 | /* Skip any section which does not correspond to a space or | |
3031 | subspace, or which SEC_ALLOC set (and therefore handled | |
3032 | in the loadable spaces/subspaces code above. */ | |
3033 | ||
3034 | if (som_section_data (subsection)->is_subspace == 0 | |
3035 | || som_section_data (subsection)->containing_space != section | |
3036 | || (subsection->flags & SEC_ALLOC) != 0) | |
3037 | continue; | |
3038 | ||
3039 | /* If this is the first subspace for this space, then save | |
3040 | the index of the subspace in its containing space. Clear | |
3041 | "is_loadable". */ | |
3042 | ||
3043 | if (som_section_data (section)->space_dict.subspace_quantity == 0) | |
3044 | { | |
3045 | som_section_data (section)->space_dict.is_loadable = 0; | |
3046 | som_section_data (section)->space_dict.subspace_index | |
3047 | = subspace_index; | |
3048 | } | |
3049 | ||
3050 | /* Increment the number of subspaces seen and the number of | |
3051 | subspaces contained within the current space. */ | |
3052 | som_section_data (section)->space_dict.subspace_quantity++; | |
3053 | subspace_index++; | |
3054 | ||
3055 | /* Mark the index of the current space within the subspace's | |
3056 | dictionary record. */ | |
3057 | som_section_data (subsection)->subspace_dict.space_index = i; | |
3058 | ||
3059 | /* Dump this subspace header. */ | |
3060 | if (bfd_write ((PTR) &som_section_data (subsection)->subspace_dict, | |
3061 | sizeof (struct subspace_dictionary_record), 1, abfd) | |
3062 | != sizeof (struct subspace_dictionary_record)) | |
3063 | { | |
d1ad85a6 | 3064 | bfd_set_error (bfd_error_system_call); |
efc0df7c JL |
3065 | return false; |
3066 | } | |
3067 | } | |
3068 | /* Goto the next section. */ | |
3069 | section = section->next; | |
3070 | } | |
3071 | ||
3072 | /* All the subspace dictiondary records are written, and all the | |
3073 | fields are set up in the space dictionary records. | |
3074 | ||
3075 | Seek to the right location and start writing the space | |
3076 | dictionary records. */ | |
3077 | location = obj_som_file_hdr (abfd)->space_location; | |
3078 | bfd_seek (abfd, location, SEEK_SET); | |
3079 | ||
3080 | section = abfd->sections; | |
3081 | for (i = 0; i < num_spaces; i++) | |
3082 | { | |
3083 | ||
3084 | /* Find a space. */ | |
3085 | while (som_section_data (section)->is_space == 0) | |
3086 | section = section->next; | |
3087 | ||
3088 | /* Dump its header */ | |
3089 | if (bfd_write ((PTR) &som_section_data (section)->space_dict, | |
3090 | sizeof (struct space_dictionary_record), 1, abfd) | |
3091 | != sizeof (struct space_dictionary_record)) | |
3092 | { | |
d1ad85a6 | 3093 | bfd_set_error (bfd_error_system_call); |
efc0df7c JL |
3094 | return false; |
3095 | } | |
3096 | ||
3097 | /* Goto the next section. */ | |
3098 | section = section->next; | |
3099 | } | |
3100 | ||
3101 | /* Only thing left to do is write out the file header. It is always | |
3102 | at location zero. Seek there and write it. */ | |
3103 | bfd_seek (abfd, (file_ptr) 0, SEEK_SET); | |
3104 | if (bfd_write ((PTR) obj_som_file_hdr (abfd), | |
3105 | sizeof (struct header), 1, abfd) | |
3106 | != sizeof (struct header)) | |
3107 | { | |
d1ad85a6 | 3108 | bfd_set_error (bfd_error_system_call); |
efc0df7c JL |
3109 | return false; |
3110 | } | |
3111 | return true; | |
3112 | } | |
3113 | ||
980bac64 JL |
3114 | /* Compute and return the checksum for a SOM file header. */ |
3115 | ||
5532fc5a JL |
3116 | static unsigned long |
3117 | som_compute_checksum (abfd) | |
3118 | bfd *abfd; | |
3119 | { | |
3120 | unsigned long checksum, count, i; | |
3121 | unsigned long *buffer = (unsigned long *) obj_som_file_hdr (abfd); | |
3122 | ||
3123 | checksum = 0; | |
3124 | count = sizeof (struct header) / sizeof (unsigned long); | |
3125 | for (i = 0; i < count; i++) | |
3126 | checksum ^= *(buffer + i); | |
3127 | ||
3128 | return checksum; | |
3129 | } | |
3130 | ||
6e033f86 JL |
3131 | static void |
3132 | som_bfd_derive_misc_symbol_info (abfd, sym, info) | |
3133 | bfd *abfd; | |
3134 | asymbol *sym; | |
3135 | struct som_misc_symbol_info *info; | |
3136 | { | |
3137 | /* Initialize. */ | |
3138 | memset (info, 0, sizeof (struct som_misc_symbol_info)); | |
3139 | ||
3140 | /* The HP SOM linker requires detailed type information about | |
3141 | all symbols (including undefined symbols!). Unfortunately, | |
3142 | the type specified in an import/export statement does not | |
3143 | always match what the linker wants. Severe braindamage. */ | |
3144 | ||
3145 | /* Section symbols will not have a SOM symbol type assigned to | |
3146 | them yet. Assign all section symbols type ST_DATA. */ | |
3147 | if (sym->flags & BSF_SECTION_SYM) | |
3148 | info->symbol_type = ST_DATA; | |
3149 | else | |
3150 | { | |
3151 | /* Common symbols must have scope SS_UNSAT and type | |
3152 | ST_STORAGE or the linker will choke. */ | |
3153 | if (sym->section == &bfd_com_section) | |
3154 | { | |
3155 | info->symbol_scope = SS_UNSAT; | |
3156 | info->symbol_type = ST_STORAGE; | |
3157 | } | |
3158 | ||
3159 | /* It is possible to have a symbol without an associated | |
3160 | type. This happens if the user imported the symbol | |
3161 | without a type and the symbol was never defined | |
3162 | locally. If BSF_FUNCTION is set for this symbol, then | |
3163 | assign it type ST_CODE (the HP linker requires undefined | |
3164 | external functions to have type ST_CODE rather than ST_ENTRY). */ | |
3165 | else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN | |
3166 | && sym->section == &bfd_und_section | |
3167 | && sym->flags & BSF_FUNCTION) | |
3168 | info->symbol_type = ST_CODE; | |
3169 | ||
3170 | /* Handle function symbols which were defined in this file. | |
3171 | They should have type ST_ENTRY. Also retrieve the argument | |
3172 | relocation bits from the SOM backend information. */ | |
3173 | else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_ENTRY | |
3174 | || (som_symbol_data (sym)->som_type == SYMBOL_TYPE_CODE | |
3175 | && (sym->flags & BSF_FUNCTION)) | |
3176 | || (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN | |
3177 | && (sym->flags & BSF_FUNCTION))) | |
3178 | { | |
3179 | info->symbol_type = ST_ENTRY; | |
3180 | info->arg_reloc = som_symbol_data (sym)->tc_data.hppa_arg_reloc; | |
3181 | } | |
3182 | ||
3183 | /* If the type is unknown at this point, it should be | |
3184 | ST_DATA (functions were handled as special cases above). */ | |
3185 | else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN) | |
3186 | info->symbol_type = ST_DATA; | |
3187 | ||
3188 | /* From now on it's a very simple mapping. */ | |
3189 | else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_ABSOLUTE) | |
3190 | info->symbol_type = ST_ABSOLUTE; | |
3191 | else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_CODE) | |
3192 | info->symbol_type = ST_CODE; | |
3193 | else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_DATA) | |
3194 | info->symbol_type = ST_DATA; | |
3195 | else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_MILLICODE) | |
3196 | info->symbol_type = ST_MILLICODE; | |
3197 | else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_PLABEL) | |
3198 | info->symbol_type = ST_PLABEL; | |
3199 | else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_PRI_PROG) | |
3200 | info->symbol_type = ST_PRI_PROG; | |
3201 | else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_SEC_PROG) | |
3202 | info->symbol_type = ST_SEC_PROG; | |
3203 | } | |
3204 | ||
3205 | /* Now handle the symbol's scope. Exported data which is not | |
3206 | in the common section has scope SS_UNIVERSAL. Note scope | |
3207 | of common symbols was handled earlier! */ | |
3208 | if (sym->flags & BSF_EXPORT && sym->section != &bfd_com_section) | |
3209 | info->symbol_scope = SS_UNIVERSAL; | |
3210 | /* Any undefined symbol at this point has a scope SS_UNSAT. */ | |
3211 | else if (sym->section == &bfd_und_section) | |
3212 | info->symbol_scope = SS_UNSAT; | |
3213 | /* Anything else which is not in the common section has scope | |
3214 | SS_LOCAL. */ | |
3215 | else if (sym->section != &bfd_com_section) | |
3216 | info->symbol_scope = SS_LOCAL; | |
3217 | ||
3218 | /* Now set the symbol_info field. It has no real meaning | |
3219 | for undefined or common symbols, but the HP linker will | |
3220 | choke if it's not set to some "reasonable" value. We | |
3221 | use zero as a reasonable value. */ | |
d6439785 JL |
3222 | if (sym->section == &bfd_com_section || sym->section == &bfd_und_section |
3223 | || sym->section == &bfd_abs_section) | |
6e033f86 JL |
3224 | info->symbol_info = 0; |
3225 | /* For all other symbols, the symbol_info field contains the | |
3226 | subspace index of the space this symbol is contained in. */ | |
3227 | else | |
3228 | info->symbol_info = som_section_data (sym->section)->subspace_index; | |
3229 | ||
3230 | /* Set the symbol's value. */ | |
3231 | info->symbol_value = sym->value + sym->section->vma; | |
3232 | } | |
3233 | ||
713de7ec JL |
3234 | /* Build and write, in one big chunk, the entire symbol table for |
3235 | this BFD. */ | |
3236 | ||
3237 | static boolean | |
3238 | som_build_and_write_symbol_table (abfd) | |
3239 | bfd *abfd; | |
3240 | { | |
3241 | unsigned int num_syms = bfd_get_symcount (abfd); | |
3242 | file_ptr symtab_location = obj_som_file_hdr (abfd)->symbol_location; | |
3243 | asymbol **bfd_syms = bfd_get_outsymbols (abfd); | |
80425e6c | 3244 | struct symbol_dictionary_record *som_symtab = NULL; |
713de7ec JL |
3245 | int i, symtab_size; |
3246 | ||
3247 | /* Compute total symbol table size and allocate a chunk of memory | |
3248 | to hold the symbol table as we build it. */ | |
3249 | symtab_size = num_syms * sizeof (struct symbol_dictionary_record); | |
80425e6c JK |
3250 | som_symtab = (struct symbol_dictionary_record *) malloc (symtab_size); |
3251 | if (som_symtab == NULL) | |
3252 | { | |
3253 | bfd_set_error (bfd_error_no_memory); | |
3254 | goto error_return; | |
3255 | } | |
6e033f86 | 3256 | memset (som_symtab, 0, symtab_size); |
713de7ec JL |
3257 | |
3258 | /* Walk over each symbol. */ | |
3259 | for (i = 0; i < num_syms; i++) | |
3260 | { | |
6e033f86 JL |
3261 | struct som_misc_symbol_info info; |
3262 | ||
713de7ec JL |
3263 | /* This is really an index into the symbol strings table. |
3264 | By the time we get here, the index has already been | |
3265 | computed and stored into the name field in the BFD symbol. */ | |
3266 | som_symtab[i].name.n_strx = (int) bfd_syms[i]->name; | |
3267 | ||
6e033f86 JL |
3268 | /* Derive SOM information from the BFD symbol. */ |
3269 | som_bfd_derive_misc_symbol_info (abfd, bfd_syms[i], &info); | |
713de7ec | 3270 | |
6e033f86 JL |
3271 | /* Now use it. */ |
3272 | som_symtab[i].symbol_type = info.symbol_type; | |
3273 | som_symtab[i].symbol_scope = info.symbol_scope; | |
3274 | som_symtab[i].arg_reloc = info.arg_reloc; | |
3275 | som_symtab[i].symbol_info = info.symbol_info; | |
3276 | som_symtab[i].symbol_value = info.symbol_value; | |
713de7ec JL |
3277 | } |
3278 | ||
6e033f86 | 3279 | /* Everything is ready, seek to the right location and |
713de7ec JL |
3280 | scribble out the symbol table. */ |
3281 | if (bfd_seek (abfd, symtab_location, SEEK_SET) != 0) | |
3282 | { | |
d1ad85a6 | 3283 | bfd_set_error (bfd_error_system_call); |
80425e6c | 3284 | goto error_return; |
713de7ec JL |
3285 | } |
3286 | ||
3287 | if (bfd_write ((PTR) som_symtab, symtab_size, 1, abfd) != symtab_size) | |
3288 | { | |
d1ad85a6 | 3289 | bfd_set_error (bfd_error_system_call); |
80425e6c | 3290 | goto error_return; |
713de7ec | 3291 | } |
80425e6c JK |
3292 | |
3293 | if (som_symtab != NULL) | |
3294 | free (som_symtab); | |
3295 | return true; | |
3296 | error_return: | |
3297 | if (som_symtab != NULL) | |
3298 | free (som_symtab); | |
3299 | return false; | |
713de7ec JL |
3300 | } |
3301 | ||
980bac64 JL |
3302 | /* Write an object in SOM format. */ |
3303 | ||
3304 | static boolean | |
9e16fcf1 | 3305 | som_write_object_contents (abfd) |
d9ad93bc KR |
3306 | bfd *abfd; |
3307 | { | |
980bac64 JL |
3308 | if (abfd->output_has_begun == false) |
3309 | { | |
3310 | /* Set up fixed parts of the file, space, and subspace headers. | |
3311 | Notify the world that output has begun. */ | |
3312 | som_prep_headers (abfd); | |
3313 | abfd->output_has_begun = true; | |
980bac64 JL |
3314 | /* Start writing the object file. This include all the string |
3315 | tables, fixup streams, and other portions of the object file. */ | |
3316 | som_begin_writing (abfd); | |
980bac64 JL |
3317 | } |
3318 | ||
3319 | /* Now that the symbol table information is complete, build and | |
3320 | write the symbol table. */ | |
3321 | if (som_build_and_write_symbol_table (abfd) == false) | |
3322 | return false; | |
3323 | ||
3324 | /* Compute the checksum for the file header just before writing | |
3325 | the header to disk. */ | |
3326 | obj_som_file_hdr (abfd)->checksum = som_compute_checksum (abfd); | |
3327 | return (som_write_headers (abfd)); | |
d9ad93bc | 3328 | } |
980bac64 JL |
3329 | |
3330 | \f | |
9e16fcf1 | 3331 | /* Read and save the string table associated with the given BFD. */ |
d9ad93bc | 3332 | |
9e16fcf1 SG |
3333 | static boolean |
3334 | som_slurp_string_table (abfd) | |
d9ad93bc KR |
3335 | bfd *abfd; |
3336 | { | |
9e16fcf1 SG |
3337 | char *stringtab; |
3338 | ||
3339 | /* Use the saved version if its available. */ | |
3340 | if (obj_som_stringtab (abfd) != NULL) | |
3341 | return true; | |
3342 | ||
3343 | /* Allocate and read in the string table. */ | |
3344 | stringtab = bfd_zalloc (abfd, obj_som_stringtab_size (abfd)); | |
3345 | if (stringtab == NULL) | |
3346 | { | |
d1ad85a6 | 3347 | bfd_set_error (bfd_error_no_memory); |
9e16fcf1 SG |
3348 | return false; |
3349 | } | |
3350 | ||
3351 | if (bfd_seek (abfd, obj_som_str_filepos (abfd), SEEK_SET) < 0) | |
3352 | { | |
d1ad85a6 | 3353 | bfd_set_error (bfd_error_system_call); |
9e16fcf1 SG |
3354 | return false; |
3355 | } | |
3356 | ||
3357 | if (bfd_read (stringtab, obj_som_stringtab_size (abfd), 1, abfd) | |
3358 | != obj_som_stringtab_size (abfd)) | |
3359 | { | |
d1ad85a6 | 3360 | bfd_set_error (bfd_error_system_call); |
9e16fcf1 SG |
3361 | return false; |
3362 | } | |
3363 | ||
3364 | /* Save our results and return success. */ | |
3365 | obj_som_stringtab (abfd) = stringtab; | |
3366 | return true; | |
d9ad93bc KR |
3367 | } |
3368 | ||
9e16fcf1 SG |
3369 | /* Return the amount of data (in bytes) required to hold the symbol |
3370 | table for this object. */ | |
3371 | ||
d9ad93bc | 3372 | static unsigned int |
9e16fcf1 | 3373 | som_get_symtab_upper_bound (abfd) |
d9ad93bc | 3374 | bfd *abfd; |
d9ad93bc | 3375 | { |
9e16fcf1 SG |
3376 | if (!som_slurp_symbol_table (abfd)) |
3377 | return 0; | |
3378 | ||
d6439785 | 3379 | return (bfd_get_symcount (abfd) + 1) * (sizeof (asymbol *)); |
d9ad93bc KR |
3380 | } |
3381 | ||
9e16fcf1 SG |
3382 | /* Convert from a SOM subspace index to a BFD section. */ |
3383 | ||
3384 | static asection * | |
3385 | som_section_from_subspace_index (abfd, index) | |
3386 | bfd *abfd; | |
3387 | unsigned int index; | |
3388 | { | |
3389 | asection *section; | |
3390 | ||
3391 | for (section = abfd->sections; section != NULL; section = section->next) | |
3392 | if (som_section_data (section)->subspace_index == index) | |
3393 | return section; | |
3394 | ||
3395 | /* Should never happen. */ | |
3396 | abort(); | |
3397 | } | |
3398 | ||
3399 | /* Read and save the symbol table associated with the given BFD. */ | |
3400 | ||
d9ad93bc | 3401 | static unsigned int |
9e16fcf1 | 3402 | som_slurp_symbol_table (abfd) |
d9ad93bc | 3403 | bfd *abfd; |
d9ad93bc | 3404 | { |
9e16fcf1 SG |
3405 | int symbol_count = bfd_get_symcount (abfd); |
3406 | int symsize = sizeof (struct symbol_dictionary_record); | |
3407 | char *stringtab; | |
80425e6c | 3408 | struct symbol_dictionary_record *buf = NULL, *bufp, *endbufp; |
9e16fcf1 SG |
3409 | som_symbol_type *sym, *symbase; |
3410 | ||
3411 | /* Return saved value if it exists. */ | |
3412 | if (obj_som_symtab (abfd) != NULL) | |
80425e6c | 3413 | goto successful_return; |
9e16fcf1 | 3414 | |
24a1f6a0 | 3415 | /* Special case. This is *not* an error. */ |
9e16fcf1 | 3416 | if (symbol_count == 0) |
80425e6c | 3417 | goto successful_return; |
9e16fcf1 SG |
3418 | |
3419 | if (!som_slurp_string_table (abfd)) | |
80425e6c | 3420 | goto error_return; |
9e16fcf1 SG |
3421 | |
3422 | stringtab = obj_som_stringtab (abfd); | |
3423 | ||
3424 | symbase = (som_symbol_type *) | |
3425 | bfd_zalloc (abfd, symbol_count * sizeof (som_symbol_type)); | |
3426 | if (symbase == NULL) | |
3427 | { | |
d1ad85a6 | 3428 | bfd_set_error (bfd_error_no_memory); |
80425e6c | 3429 | goto error_return; |
9e16fcf1 SG |
3430 | } |
3431 | ||
3432 | /* Read in the external SOM representation. */ | |
80425e6c | 3433 | buf = malloc (symbol_count * symsize); |
9e16fcf1 SG |
3434 | if (buf == NULL) |
3435 | { | |
d1ad85a6 | 3436 | bfd_set_error (bfd_error_no_memory); |
80425e6c | 3437 | goto error_return; |
9e16fcf1 SG |
3438 | } |
3439 | if (bfd_seek (abfd, obj_som_sym_filepos (abfd), SEEK_SET) < 0) | |
3440 | { | |
d1ad85a6 | 3441 | bfd_set_error (bfd_error_system_call); |
80425e6c | 3442 | goto error_return; |
9e16fcf1 SG |
3443 | } |
3444 | if (bfd_read (buf, symbol_count * symsize, 1, abfd) | |
3445 | != symbol_count * symsize) | |
3446 | { | |
d1ad85a6 | 3447 | bfd_set_error (bfd_error_no_symbols); |
80425e6c | 3448 | goto error_return; |
9e16fcf1 SG |
3449 | } |
3450 | ||
3451 | /* Iterate over all the symbols and internalize them. */ | |
3452 | endbufp = buf + symbol_count; | |
3453 | for (bufp = buf, sym = symbase; bufp < endbufp; ++bufp) | |
3454 | { | |
3455 | ||
3456 | /* I don't think we care about these. */ | |
3457 | if (bufp->symbol_type == ST_SYM_EXT | |
3458 | || bufp->symbol_type == ST_ARG_EXT) | |
3459 | continue; | |
3460 | ||
6e033f86 JL |
3461 | /* Set some private data we care about. */ |
3462 | if (bufp->symbol_type == ST_NULL) | |
3463 | som_symbol_data (sym)->som_type = SYMBOL_TYPE_UNKNOWN; | |
3464 | else if (bufp->symbol_type == ST_ABSOLUTE) | |
3465 | som_symbol_data (sym)->som_type = SYMBOL_TYPE_ABSOLUTE; | |
3466 | else if (bufp->symbol_type == ST_DATA) | |
3467 | som_symbol_data (sym)->som_type = SYMBOL_TYPE_DATA; | |
3468 | else if (bufp->symbol_type == ST_CODE) | |
3469 | som_symbol_data (sym)->som_type = SYMBOL_TYPE_CODE; | |
3470 | else if (bufp->symbol_type == ST_PRI_PROG) | |
3471 | som_symbol_data (sym)->som_type = SYMBOL_TYPE_PRI_PROG; | |
3472 | else if (bufp->symbol_type == ST_SEC_PROG) | |
3473 | som_symbol_data (sym)->som_type = SYMBOL_TYPE_SEC_PROG; | |
3474 | else if (bufp->symbol_type == ST_ENTRY) | |
3475 | som_symbol_data (sym)->som_type = SYMBOL_TYPE_ENTRY; | |
3476 | else if (bufp->symbol_type == ST_MILLICODE) | |
3477 | som_symbol_data (sym)->som_type = SYMBOL_TYPE_MILLICODE; | |
3478 | else if (bufp->symbol_type == ST_PLABEL) | |
3479 | som_symbol_data (sym)->som_type = SYMBOL_TYPE_PLABEL; | |
3480 | else | |
3481 | som_symbol_data (sym)->som_type = SYMBOL_TYPE_UNKNOWN; | |
3482 | som_symbol_data (sym)->tc_data.hppa_arg_reloc = bufp->arg_reloc; | |
3483 | ||
9e16fcf1 SG |
3484 | /* Some reasonable defaults. */ |
3485 | sym->symbol.the_bfd = abfd; | |
3486 | sym->symbol.name = bufp->name.n_strx + stringtab; | |
3487 | sym->symbol.value = bufp->symbol_value; | |
3488 | sym->symbol.section = 0; | |
3489 | sym->symbol.flags = 0; | |
3490 | ||
3491 | switch (bufp->symbol_type) | |
3492 | { | |
3493 | case ST_ENTRY: | |
36456a67 JL |
3494 | case ST_PRI_PROG: |
3495 | case ST_SEC_PROG: | |
3496 | case ST_MILLICODE: | |
9e16fcf1 SG |
3497 | sym->symbol.flags |= BSF_FUNCTION; |
3498 | sym->symbol.value &= ~0x3; | |
3499 | break; | |
3500 | ||
9e16fcf1 | 3501 | case ST_STUB: |
9e16fcf1 SG |
3502 | case ST_CODE: |
3503 | sym->symbol.value &= ~0x3; | |
3504 | ||
3505 | default: | |
3506 | break; | |
3507 | } | |
3508 | ||
3509 | /* Handle scoping and section information. */ | |
3510 | switch (bufp->symbol_scope) | |
3511 | { | |
3512 | /* symbol_info field is undefined for SS_EXTERNAL and SS_UNSAT symbols, | |
3513 | so the section associated with this symbol can't be known. */ | |
3514 | case SS_EXTERNAL: | |
017a52d7 JL |
3515 | if (bufp->symbol_type != ST_STORAGE) |
3516 | sym->symbol.section = &bfd_und_section; | |
3517 | else | |
3518 | sym->symbol.section = &bfd_com_section; | |
9e16fcf1 SG |
3519 | sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL); |
3520 | break; | |
3521 | ||
baef2065 JL |
3522 | case SS_UNSAT: |
3523 | if (bufp->symbol_type != ST_STORAGE) | |
3524 | sym->symbol.section = &bfd_und_section; | |
3525 | else | |
3526 | sym->symbol.section = &bfd_com_section; | |
3527 | break; | |
3528 | ||
9e16fcf1 SG |
3529 | case SS_UNIVERSAL: |
3530 | sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL); | |
3531 | sym->symbol.section | |
3532 | = som_section_from_subspace_index (abfd, bufp->symbol_info); | |
3533 | sym->symbol.value -= sym->symbol.section->vma; | |
3534 | break; | |
3535 | ||
3536 | #if 0 | |
3537 | /* SS_GLOBAL and SS_LOCAL are two names for the same thing. | |
3538 | Sound dumb? It is. */ | |
3539 | case SS_GLOBAL: | |
3540 | #endif | |
3541 | case SS_LOCAL: | |
3542 | sym->symbol.flags |= BSF_LOCAL; | |
3543 | sym->symbol.section | |
3544 | = som_section_from_subspace_index (abfd, bufp->symbol_info); | |
3545 | sym->symbol.value -= sym->symbol.section->vma; | |
3546 | break; | |
3547 | } | |
3548 | ||
baef2065 JL |
3549 | /* Mark section symbols and symbols used by the debugger. */ |
3550 | if (!strcmp (sym->symbol.name, "L$0\002")) | |
3551 | sym->symbol.flags |= BSF_SECTION_SYM; | |
3552 | else if (!strncmp (sym->symbol.name, "L$0", 3)) | |
9e16fcf1 SG |
3553 | sym->symbol.flags |= BSF_DEBUGGING; |
3554 | ||
3555 | /* Note increment at bottom of loop, since we skip some symbols | |
3556 | we can not include it as part of the for statement. */ | |
3557 | sym++; | |
3558 | } | |
3559 | ||
3560 | /* Save our results and return success. */ | |
3561 | obj_som_symtab (abfd) = symbase; | |
80425e6c JK |
3562 | successful_return: |
3563 | if (buf != NULL) | |
3564 | free (buf); | |
9e16fcf1 | 3565 | return (true); |
80425e6c JK |
3566 | |
3567 | error_return: | |
3568 | if (buf != NULL) | |
3569 | free (buf); | |
3570 | return false; | |
d9ad93bc KR |
3571 | } |
3572 | ||
9e16fcf1 SG |
3573 | /* Canonicalize a SOM symbol table. Return the number of entries |
3574 | in the symbol table. */ | |
d9ad93bc KR |
3575 | |
3576 | static unsigned int | |
9e16fcf1 | 3577 | som_get_symtab (abfd, location) |
d9ad93bc KR |
3578 | bfd *abfd; |
3579 | asymbol **location; | |
3580 | { | |
9e16fcf1 SG |
3581 | int i; |
3582 | som_symbol_type *symbase; | |
3583 | ||
3584 | if (!som_slurp_symbol_table (abfd)) | |
3585 | return 0; | |
3586 | ||
3587 | i = bfd_get_symcount (abfd); | |
3588 | symbase = obj_som_symtab (abfd); | |
3589 | ||
3590 | for (; i > 0; i--, location++, symbase++) | |
3591 | *location = &symbase->symbol; | |
3592 | ||
3593 | /* Final null pointer. */ | |
3594 | *location = 0; | |
3595 | return (bfd_get_symcount (abfd)); | |
d9ad93bc KR |
3596 | } |
3597 | ||
9e16fcf1 SG |
3598 | /* Make a SOM symbol. There is nothing special to do here. */ |
3599 | ||
d9ad93bc | 3600 | static asymbol * |
9e16fcf1 | 3601 | som_make_empty_symbol (abfd) |
d9ad93bc KR |
3602 | bfd *abfd; |
3603 | { | |
9e16fcf1 SG |
3604 | som_symbol_type *new = |
3605 | (som_symbol_type *) bfd_zalloc (abfd, sizeof (som_symbol_type)); | |
3606 | if (new == NULL) | |
3607 | { | |
d1ad85a6 | 3608 | bfd_set_error (bfd_error_no_memory); |
9e16fcf1 SG |
3609 | return 0; |
3610 | } | |
d9ad93bc KR |
3611 | new->symbol.the_bfd = abfd; |
3612 | ||
3613 | return &new->symbol; | |
3614 | } | |
3615 | ||
9e16fcf1 SG |
3616 | /* Print symbol information. */ |
3617 | ||
d9ad93bc | 3618 | static void |
9e16fcf1 | 3619 | som_print_symbol (ignore_abfd, afile, symbol, how) |
d9ad93bc KR |
3620 | bfd *ignore_abfd; |
3621 | PTR afile; | |
3622 | asymbol *symbol; | |
3623 | bfd_print_symbol_type how; | |
3624 | { | |
9e16fcf1 SG |
3625 | FILE *file = (FILE *) afile; |
3626 | switch (how) | |
3627 | { | |
3628 | case bfd_print_symbol_name: | |
3629 | fprintf (file, "%s", symbol->name); | |
3630 | break; | |
3631 | case bfd_print_symbol_more: | |
3632 | fprintf (file, "som "); | |
3633 | fprintf_vma (file, symbol->value); | |
3634 | fprintf (file, " %lx", (long) symbol->flags); | |
3635 | break; | |
3636 | case bfd_print_symbol_all: | |
3637 | { | |
3638 | CONST char *section_name; | |
3639 | section_name = symbol->section ? symbol->section->name : "(*none*)"; | |
3640 | bfd_print_symbol_vandf ((PTR) file, symbol); | |
3641 | fprintf (file, " %s\t%s", section_name, symbol->name); | |
3642 | break; | |
3643 | } | |
3644 | } | |
3645 | } | |
3646 | ||
36456a67 JL |
3647 | /* Count or process variable-length SOM fixup records. |
3648 | ||
3649 | To avoid code duplication we use this code both to compute the number | |
3650 | of relocations requested by a stream, and to internalize the stream. | |
3651 | ||
3652 | When computing the number of relocations requested by a stream the | |
3653 | variables rptr, section, and symbols have no meaning. | |
3654 | ||
3655 | Return the number of relocations requested by the fixup stream. When | |
3656 | not just counting | |
3657 | ||
3658 | This needs at least two or three more passes to get it cleaned up. */ | |
3659 | ||
3660 | static unsigned int | |
3661 | som_set_reloc_info (fixup, end, internal_relocs, section, symbols, just_count) | |
3662 | unsigned char *fixup; | |
3663 | unsigned int end; | |
3664 | arelent *internal_relocs; | |
3665 | asection *section; | |
3666 | asymbol **symbols; | |
3667 | boolean just_count; | |
3668 | { | |
3669 | unsigned int op, varname; | |
3670 | unsigned char *end_fixups = &fixup[end]; | |
3671 | const struct fixup_format *fp; | |
3672 | char *cp; | |
3673 | unsigned char *save_fixup; | |
3674 | int variables[26], stack[20], c, v, count, prev_fixup, *sp; | |
3675 | const int *subop; | |
3676 | arelent *rptr= internal_relocs; | |
3677 | unsigned int offset = just_count ? 0 : section->vma; | |
3678 | ||
3679 | #define var(c) variables[(c) - 'A'] | |
3680 | #define push(v) (*sp++ = (v)) | |
3681 | #define pop() (*--sp) | |
3682 | #define emptystack() (sp == stack) | |
3683 | ||
3684 | som_initialize_reloc_queue (reloc_queue); | |
6e033f86 JL |
3685 | memset (variables, 0, sizeof (variables)); |
3686 | memset (stack, 0, sizeof (stack)); | |
36456a67 JL |
3687 | count = 0; |
3688 | prev_fixup = 0; | |
3689 | sp = stack; | |
3690 | ||
3691 | while (fixup < end_fixups) | |
3692 | { | |
3693 | ||
3694 | /* Save pointer to the start of this fixup. We'll use | |
3695 | it later to determine if it is necessary to put this fixup | |
3696 | on the queue. */ | |
3697 | save_fixup = fixup; | |
3698 | ||
3699 | /* Get the fixup code and its associated format. */ | |
3700 | op = *fixup++; | |
3701 | fp = &som_fixup_formats[op]; | |
3702 | ||
3703 | /* Handle a request for a previous fixup. */ | |
3704 | if (*fp->format == 'P') | |
3705 | { | |
3706 | /* Get pointer to the beginning of the prev fixup, move | |
3707 | the repeated fixup to the head of the queue. */ | |
3708 | fixup = reloc_queue[fp->D].reloc; | |
3709 | som_reloc_queue_fix (reloc_queue, fp->D); | |
3710 | prev_fixup = 1; | |
3711 | ||
3712 | /* Get the fixup code and its associated format. */ | |
3713 | op = *fixup++; | |
3714 | fp = &som_fixup_formats[op]; | |
3715 | } | |
3716 | ||
3717 | /* If we are not just counting, set some reasonable defaults. */ | |
3718 | if (! just_count) | |
3719 | { | |
3720 | rptr->address = offset; | |
3721 | rptr->howto = &som_hppa_howto_table[op]; | |
3722 | rptr->addend = 0; | |
6941fd4d | 3723 | rptr->sym_ptr_ptr = bfd_abs_section.symbol_ptr_ptr; |
36456a67 JL |
3724 | } |
3725 | ||
3726 | /* Set default input length to 0. Get the opcode class index | |
3727 | into D. */ | |
3728 | var ('L') = 0; | |
3729 | var ('D') = fp->D; | |
3730 | ||
3731 | /* Get the opcode format. */ | |
3732 | cp = fp->format; | |
3733 | ||
3734 | /* Process the format string. Parsing happens in two phases, | |
3735 | parse RHS, then assign to LHS. Repeat until no more | |
3736 | characters in the format string. */ | |
3737 | while (*cp) | |
3738 | { | |
3739 | /* The variable this pass is going to compute a value for. */ | |
3740 | varname = *cp++; | |
3741 | ||
3742 | /* Start processing RHS. Continue until a NULL or '=' is found. */ | |
3743 | do | |
3744 | { | |
3745 | c = *cp++; | |
3746 | ||
3747 | /* If this is a variable, push it on the stack. */ | |
3748 | if (isupper (c)) | |
3749 | push (var (c)); | |
3750 | ||
3751 | /* If this is a lower case letter, then it represents | |
3752 | additional data from the fixup stream to be pushed onto | |
3753 | the stack. */ | |
3754 | else if (islower (c)) | |
3755 | { | |
3756 | for (v = 0; c > 'a'; --c) | |
3757 | v = (v << 8) | *fixup++; | |
3758 | push (v); | |
3759 | } | |
3760 | ||
3761 | /* A decimal constant. Push it on the stack. */ | |
3762 | else if (isdigit (c)) | |
3763 | { | |
3764 | v = c - '0'; | |
3765 | while (isdigit (*cp)) | |
3766 | v = (v * 10) + (*cp++ - '0'); | |
3767 | push (v); | |
3768 | } | |
3769 | else | |
3770 | ||
3771 | /* An operator. Pop two two values from the stack and | |
3772 | use them as operands to the given operation. Push | |
3773 | the result of the operation back on the stack. */ | |
3774 | switch (c) | |
3775 | { | |
3776 | case '+': | |
3777 | v = pop (); | |
3778 | v += pop (); | |
3779 | push (v); | |
3780 | break; | |
3781 | case '*': | |
3782 | v = pop (); | |
3783 | v *= pop (); | |
3784 | push (v); | |
3785 | break; | |
3786 | case '<': | |
3787 | v = pop (); | |
3788 | v = pop () << v; | |
3789 | push (v); | |
3790 | break; | |
3791 | default: | |
3792 | abort (); | |
3793 | } | |
3794 | } | |
3795 | while (*cp && *cp != '='); | |
3796 | ||
3797 | /* Move over the equal operator. */ | |
3798 | cp++; | |
3799 | ||
3800 | /* Pop the RHS off the stack. */ | |
3801 | c = pop (); | |
3802 | ||
3803 | /* Perform the assignment. */ | |
3804 | var (varname) = c; | |
3805 | ||
3806 | /* Handle side effects. and special 'O' stack cases. */ | |
3807 | switch (varname) | |
3808 | { | |
3809 | /* Consume some bytes from the input space. */ | |
3810 | case 'L': | |
3811 | offset += c; | |
3812 | break; | |
3813 | /* A symbol to use in the relocation. Make a note | |
3814 | of this if we are not just counting. */ | |
3815 | case 'S': | |
3816 | if (! just_count) | |
3817 | rptr->sym_ptr_ptr = &symbols[c]; | |
3818 | break; | |
3819 | /* Handle the linker expression stack. */ | |
3820 | case 'O': | |
3821 | switch (op) | |
3822 | { | |
3823 | case R_COMP1: | |
3824 | subop = comp1_opcodes; | |
3825 | break; | |
3826 | case R_COMP2: | |
3827 | subop = comp2_opcodes; | |
3828 | break; | |
3829 | case R_COMP3: | |
3830 | subop = comp3_opcodes; | |
3831 | break; | |
3832 | default: | |
3833 | abort (); | |
3834 | } | |
3835 | while (*subop <= (unsigned char) c) | |
3836 | ++subop; | |
3837 | --subop; | |
3838 | break; | |
3839 | default: | |
3840 | break; | |
3841 | } | |
3842 | } | |
3843 | ||
3844 | /* If we used a previous fixup, clean up after it. */ | |
3845 | if (prev_fixup) | |
3846 | { | |
3847 | fixup = save_fixup + 1; | |
3848 | prev_fixup = 0; | |
3849 | } | |
3850 | /* Queue it. */ | |
3851 | else if (fixup > save_fixup + 1) | |
3852 | som_reloc_queue_insert (save_fixup, fixup - save_fixup, reloc_queue); | |
3853 | ||
3854 | /* We do not pass R_DATA_OVERRIDE or R_NO_RELOCATION | |
3855 | fixups to BFD. */ | |
3856 | if (som_hppa_howto_table[op].type != R_DATA_OVERRIDE | |
3857 | && som_hppa_howto_table[op].type != R_NO_RELOCATION) | |
3858 | { | |
3859 | /* Done with a single reloction. Loop back to the top. */ | |
3860 | if (! just_count) | |
3861 | { | |
3862 | rptr->addend = var ('V'); | |
3863 | rptr++; | |
3864 | } | |
3865 | count++; | |
3866 | /* Now that we've handled a "full" relocation, reset | |
3867 | some state. */ | |
6e033f86 JL |
3868 | memset (variables, 0, sizeof (variables)); |
3869 | memset (stack, 0, sizeof (stack)); | |
36456a67 JL |
3870 | } |
3871 | } | |
3872 | return count; | |
3873 | ||
3874 | #undef var | |
3875 | #undef push | |
3876 | #undef pop | |
3877 | #undef emptystack | |
3878 | } | |
3879 | ||
3880 | /* Read in the relocs (aka fixups in SOM terms) for a section. | |
3881 | ||
3882 | som_get_reloc_upper_bound calls this routine with JUST_COUNT | |
3883 | set to true to indicate it only needs a count of the number | |
3884 | of actual relocations. */ | |
3885 | ||
3886 | static boolean | |
3887 | som_slurp_reloc_table (abfd, section, symbols, just_count) | |
3888 | bfd *abfd; | |
3889 | asection *section; | |
3890 | asymbol **symbols; | |
3891 | boolean just_count; | |
3892 | { | |
3893 | char *external_relocs; | |
3894 | unsigned int fixup_stream_size; | |
3895 | arelent *internal_relocs; | |
3896 | unsigned int num_relocs; | |
3897 | ||
3898 | fixup_stream_size = som_section_data (section)->reloc_size; | |
3899 | /* If there were no relocations, then there is nothing to do. */ | |
3900 | if (section->reloc_count == 0) | |
3901 | return true; | |
3902 | ||
3903 | /* If reloc_count is -1, then the relocation stream has not been | |
3904 | parsed. We must do so now to know how many relocations exist. */ | |
3905 | if (section->reloc_count == -1) | |
3906 | { | |
3907 | external_relocs = (char *) bfd_zalloc (abfd, fixup_stream_size); | |
3908 | if (external_relocs == (char *) NULL) | |
3909 | { | |
d1ad85a6 | 3910 | bfd_set_error (bfd_error_no_memory); |
36456a67 JL |
3911 | return false; |
3912 | } | |
3913 | /* Read in the external forms. */ | |
3914 | if (bfd_seek (abfd, | |
3915 | obj_som_reloc_filepos (abfd) + section->rel_filepos, | |
3916 | SEEK_SET) | |
3917 | != 0) | |
3918 | { | |
d1ad85a6 | 3919 | bfd_set_error (bfd_error_system_call); |
36456a67 JL |
3920 | return false; |
3921 | } | |
3922 | if (bfd_read (external_relocs, 1, fixup_stream_size, abfd) | |
3923 | != fixup_stream_size) | |
3924 | { | |
d1ad85a6 | 3925 | bfd_set_error (bfd_error_system_call); |
36456a67 JL |
3926 | return false; |
3927 | } | |
3928 | /* Let callers know how many relocations found. | |
3929 | also save the relocation stream as we will | |
3930 | need it again. */ | |
3931 | section->reloc_count = som_set_reloc_info (external_relocs, | |
3932 | fixup_stream_size, | |
3933 | NULL, NULL, NULL, true); | |
3934 | ||
3935 | som_section_data (section)->reloc_stream = external_relocs; | |
3936 | } | |
3937 | ||
3938 | /* If the caller only wanted a count, then return now. */ | |
3939 | if (just_count) | |
3940 | return true; | |
3941 | ||
3942 | num_relocs = section->reloc_count; | |
3943 | external_relocs = som_section_data (section)->reloc_stream; | |
3944 | /* Return saved information about the relocations if it is available. */ | |
3945 | if (section->relocation != (arelent *) NULL) | |
3946 | return true; | |
3947 | ||
3948 | internal_relocs = (arelent *) bfd_zalloc (abfd, | |
3949 | num_relocs * sizeof (arelent)); | |
3950 | if (internal_relocs == (arelent *) NULL) | |
3951 | { | |
d1ad85a6 | 3952 | bfd_set_error (bfd_error_no_memory); |
36456a67 JL |
3953 | return false; |
3954 | } | |
3955 | ||
3956 | /* Process and internalize the relocations. */ | |
3957 | som_set_reloc_info (external_relocs, fixup_stream_size, | |
3958 | internal_relocs, section, symbols, false); | |
3959 | ||
3960 | /* Save our results and return success. */ | |
3961 | section->relocation = internal_relocs; | |
3962 | return (true); | |
3963 | } | |
3964 | ||
3965 | /* Return the number of bytes required to store the relocation | |
3966 | information associated with the given section. */ | |
3967 | ||
9e16fcf1 SG |
3968 | static unsigned int |
3969 | som_get_reloc_upper_bound (abfd, asect) | |
3970 | bfd *abfd; | |
3971 | sec_ptr asect; | |
3972 | { | |
36456a67 JL |
3973 | /* If section has relocations, then read in the relocation stream |
3974 | and parse it to determine how many relocations exist. */ | |
3975 | if (asect->flags & SEC_RELOC) | |
3976 | { | |
3977 | if (som_slurp_reloc_table (abfd, asect, NULL, true)) | |
3978 | return (asect->reloc_count + 1) * sizeof (arelent); | |
3979 | } | |
3980 | /* Either there are no relocations or an error occurred while | |
3981 | reading and parsing the relocation stream. */ | |
3982 | return 0; | |
d9ad93bc KR |
3983 | } |
3984 | ||
36456a67 JL |
3985 | /* Convert relocations from SOM (external) form into BFD internal |
3986 | form. Return the number of relocations. */ | |
3987 | ||
9e16fcf1 SG |
3988 | static unsigned int |
3989 | som_canonicalize_reloc (abfd, section, relptr, symbols) | |
3990 | bfd *abfd; | |
3991 | sec_ptr section; | |
3992 | arelent **relptr; | |
3993 | asymbol **symbols; | |
3994 | { | |
36456a67 JL |
3995 | arelent *tblptr; |
3996 | int count; | |
3997 | ||
3998 | if (som_slurp_reloc_table (abfd, section, symbols, false) == false) | |
3999 | return 0; | |
4000 | ||
4001 | count = section->reloc_count; | |
4002 | tblptr = section->relocation; | |
4003 | if (tblptr == (arelent *) NULL) | |
4004 | return 0; | |
4005 | ||
4006 | while (count--) | |
4007 | *relptr++ = tblptr++; | |
4008 | ||
4009 | *relptr = (arelent *) NULL; | |
4010 | return section->reloc_count; | |
9e16fcf1 SG |
4011 | } |
4012 | ||
4013 | extern bfd_target som_vec; | |
4014 | ||
4015 | /* A hook to set up object file dependent section information. */ | |
4016 | ||
d9ad93bc | 4017 | static boolean |
9e16fcf1 | 4018 | som_new_section_hook (abfd, newsect) |
d9ad93bc KR |
4019 | bfd *abfd; |
4020 | asection *newsect; | |
4021 | { | |
9783e04a DM |
4022 | newsect->used_by_bfd = |
4023 | (PTR) bfd_zalloc (abfd, sizeof (struct som_section_data_struct)); | |
4024 | if (!newsect->used_by_bfd) | |
4025 | { | |
d1ad85a6 | 4026 | bfd_set_error (bfd_error_no_memory); |
9783e04a DM |
4027 | return false; |
4028 | } | |
d9ad93bc KR |
4029 | newsect->alignment_power = 3; |
4030 | ||
9e16fcf1 SG |
4031 | /* Initialize the subspace_index field to -1 so that it does |
4032 | not match a subspace with an index of 0. */ | |
4033 | som_section_data (newsect)->subspace_index = -1; | |
4034 | ||
d9ad93bc KR |
4035 | /* We allow more than three sections internally */ |
4036 | return true; | |
4037 | } | |
4038 | ||
40249bfb JL |
4039 | /* Set backend info for sections which can not be described |
4040 | in the BFD data structures. */ | |
4041 | ||
4042 | void | |
4043 | bfd_som_set_section_attributes (section, defined, private, sort_key, spnum) | |
4044 | asection *section; | |
6941fd4d JL |
4045 | int defined; |
4046 | int private; | |
44fd6622 | 4047 | unsigned int sort_key; |
40249bfb JL |
4048 | int spnum; |
4049 | { | |
4050 | struct space_dictionary_record *space_dict; | |
4051 | ||
4052 | som_section_data (section)->is_space = 1; | |
4053 | space_dict = &som_section_data (section)->space_dict; | |
4054 | space_dict->is_defined = defined; | |
4055 | space_dict->is_private = private; | |
4056 | space_dict->sort_key = sort_key; | |
4057 | space_dict->space_number = spnum; | |
4058 | } | |
4059 | ||
4060 | /* Set backend info for subsections which can not be described | |
4061 | in the BFD data structures. */ | |
4062 | ||
4063 | void | |
4064 | bfd_som_set_subsection_attributes (section, container, access, | |
4065 | sort_key, quadrant) | |
4066 | asection *section; | |
4067 | asection *container; | |
4068 | int access; | |
6941fd4d | 4069 | unsigned int sort_key; |
40249bfb JL |
4070 | int quadrant; |
4071 | { | |
4072 | struct subspace_dictionary_record *subspace_dict; | |
4073 | som_section_data (section)->is_subspace = 1; | |
4074 | subspace_dict = &som_section_data (section)->subspace_dict; | |
4075 | subspace_dict->access_control_bits = access; | |
4076 | subspace_dict->sort_key = sort_key; | |
4077 | subspace_dict->quadrant = quadrant; | |
4078 | som_section_data (section)->containing_space = container; | |
4079 | } | |
4080 | ||
4081 | /* Set the full SOM symbol type. SOM needs far more symbol information | |
4082 | than any other object file format I'm aware of. It is mandatory | |
4083 | to be able to know if a symbol is an entry point, millicode, data, | |
4084 | code, absolute, storage request, or procedure label. If you get | |
4085 | the symbol type wrong your program will not link. */ | |
4086 | ||
4087 | void | |
4088 | bfd_som_set_symbol_type (symbol, type) | |
4089 | asymbol *symbol; | |
4090 | unsigned int type; | |
4091 | { | |
50c5c4ad | 4092 | som_symbol_data (symbol)->som_type = type; |
40249bfb JL |
4093 | } |
4094 | ||
4095 | /* Attach 64bits of unwind information to a symbol (which hopefully | |
4096 | is a function of some kind!). It would be better to keep this | |
4097 | in the R_ENTRY relocation, but there is not enough space. */ | |
4098 | ||
4099 | void | |
4100 | bfd_som_attach_unwind_info (symbol, unwind_desc) | |
4101 | asymbol *symbol; | |
4102 | char *unwind_desc; | |
4103 | { | |
50c5c4ad | 4104 | som_symbol_data (symbol)->unwind = unwind_desc; |
40249bfb JL |
4105 | } |
4106 | ||
f6c2300b JL |
4107 | /* Attach an auxiliary header to the BFD backend so that it may be |
4108 | written into the object file. */ | |
44fd6622 | 4109 | boolean |
f6c2300b JL |
4110 | bfd_som_attach_aux_hdr (abfd, type, string) |
4111 | bfd *abfd; | |
4112 | int type; | |
4113 | char *string; | |
4114 | { | |
4115 | if (type == VERSION_AUX_ID) | |
4116 | { | |
4117 | int len = strlen (string); | |
39961154 | 4118 | int pad = 0; |
f6c2300b JL |
4119 | |
4120 | if (len % 4) | |
39961154 | 4121 | pad = (4 - (len % 4)); |
a62dd44f JL |
4122 | obj_som_version_hdr (abfd) = (struct user_string_aux_hdr *) |
4123 | bfd_zalloc (abfd, sizeof (struct aux_id) | |
9783e04a DM |
4124 | + sizeof (unsigned int) + len + pad); |
4125 | if (!obj_som_version_hdr (abfd)) | |
4126 | { | |
d1ad85a6 | 4127 | bfd_set_error (bfd_error_no_memory); |
44fd6622 | 4128 | return false; |
9783e04a | 4129 | } |
f6c2300b | 4130 | obj_som_version_hdr (abfd)->header_id.type = VERSION_AUX_ID; |
39961154 JL |
4131 | obj_som_version_hdr (abfd)->header_id.length = len + pad; |
4132 | obj_som_version_hdr (abfd)->header_id.length += sizeof (int); | |
f6c2300b | 4133 | obj_som_version_hdr (abfd)->string_length = len; |
39961154 | 4134 | strncpy (obj_som_version_hdr (abfd)->user_string, string, len); |
f6c2300b JL |
4135 | } |
4136 | else if (type == COPYRIGHT_AUX_ID) | |
4137 | { | |
4138 | int len = strlen (string); | |
39961154 | 4139 | int pad = 0; |
f6c2300b JL |
4140 | |
4141 | if (len % 4) | |
39961154 | 4142 | pad = (4 - (len % 4)); |
a62dd44f JL |
4143 | obj_som_copyright_hdr (abfd) = (struct copyright_aux_hdr *) |
4144 | bfd_zalloc (abfd, sizeof (struct aux_id) | |
4145 | + sizeof (unsigned int) + len + pad); | |
9783e04a DM |
4146 | if (!obj_som_copyright_hdr (abfd)) |
4147 | { | |
d1ad85a6 | 4148 | bfd_set_error (bfd_error_no_error); |
44fd6622 | 4149 | return false; |
9783e04a | 4150 | } |
f6c2300b | 4151 | obj_som_copyright_hdr (abfd)->header_id.type = COPYRIGHT_AUX_ID; |
39961154 JL |
4152 | obj_som_copyright_hdr (abfd)->header_id.length = len + pad; |
4153 | obj_som_copyright_hdr (abfd)->header_id.length += sizeof (int); | |
f6c2300b JL |
4154 | obj_som_copyright_hdr (abfd)->string_length = len; |
4155 | strcpy (obj_som_copyright_hdr (abfd)->copyright, string); | |
4156 | } | |
44fd6622 | 4157 | return true; |
f6c2300b JL |
4158 | } |
4159 | ||
d9ad93bc | 4160 | static boolean |
9e16fcf1 | 4161 | som_set_section_contents (abfd, section, location, offset, count) |
d9ad93bc KR |
4162 | bfd *abfd; |
4163 | sec_ptr section; | |
4164 | PTR location; | |
4165 | file_ptr offset; | |
4166 | bfd_size_type count; | |
4167 | { | |
980bac64 JL |
4168 | if (abfd->output_has_begun == false) |
4169 | { | |
4170 | /* Set up fixed parts of the file, space, and subspace headers. | |
4171 | Notify the world that output has begun. */ | |
4172 | som_prep_headers (abfd); | |
4173 | abfd->output_has_begun = true; | |
980bac64 JL |
4174 | /* Start writing the object file. This include all the string |
4175 | tables, fixup streams, and other portions of the object file. */ | |
4176 | som_begin_writing (abfd); | |
980bac64 JL |
4177 | } |
4178 | ||
4179 | /* Only write subspaces which have "real" contents (eg. the contents | |
4180 | are not generated at run time by the OS). */ | |
4181 | if (som_section_data (section)->is_subspace != 1 | |
4182 | || ((section->flags & (SEC_LOAD | SEC_DEBUGGING)) == 0)) | |
4183 | return true; | |
4184 | ||
4185 | /* Seek to the proper offset within the object file and write the | |
4186 | data. */ | |
4187 | offset += som_section_data (section)->subspace_dict.file_loc_init_value; | |
4188 | if (bfd_seek (abfd, offset, SEEK_SET) == -1) | |
4189 | { | |
d1ad85a6 | 4190 | bfd_set_error (bfd_error_system_call); |
980bac64 JL |
4191 | return false; |
4192 | } | |
4193 | ||
4194 | if (bfd_write ((PTR) location, 1, count, abfd) != count) | |
4195 | { | |
d1ad85a6 | 4196 | bfd_set_error (bfd_error_system_call); |
980bac64 JL |
4197 | return false; |
4198 | } | |
4199 | return true; | |
d9ad93bc KR |
4200 | } |
4201 | ||
4202 | static boolean | |
9e16fcf1 | 4203 | som_set_arch_mach (abfd, arch, machine) |
d9ad93bc KR |
4204 | bfd *abfd; |
4205 | enum bfd_architecture arch; | |
4206 | unsigned long machine; | |
4207 | { | |
2212ff92 | 4208 | /* Allow any architecture to be supported by the SOM backend */ |
d9ad93bc KR |
4209 | return bfd_default_set_arch_mach (abfd, arch, machine); |
4210 | } | |
4211 | ||
4212 | static boolean | |
9e16fcf1 | 4213 | som_find_nearest_line (abfd, section, symbols, offset, filename_ptr, |
d9ad93bc KR |
4214 | functionname_ptr, line_ptr) |
4215 | bfd *abfd; | |
4216 | asection *section; | |
4217 | asymbol **symbols; | |
4218 | bfd_vma offset; | |
4219 | CONST char **filename_ptr; | |
4220 | CONST char **functionname_ptr; | |
4221 | unsigned int *line_ptr; | |
4222 | { | |
9e16fcf1 | 4223 | fprintf (stderr, "som_find_nearest_line unimplemented\n"); |
d9ad93bc KR |
4224 | fflush (stderr); |
4225 | abort (); | |
4226 | return (false); | |
4227 | } | |
4228 | ||
4229 | static int | |
9e16fcf1 | 4230 | som_sizeof_headers (abfd, reloc) |
d9ad93bc KR |
4231 | bfd *abfd; |
4232 | boolean reloc; | |
4233 | { | |
9e16fcf1 | 4234 | fprintf (stderr, "som_sizeof_headers unimplemented\n"); |
d9ad93bc KR |
4235 | fflush (stderr); |
4236 | abort (); | |
4237 | return (0); | |
4238 | } | |
4239 | ||
017a52d7 JL |
4240 | /* Return the single-character symbol type corresponding to |
4241 | SOM section S, or '?' for an unknown SOM section. */ | |
4242 | ||
4243 | static char | |
4244 | som_section_type (s) | |
4245 | const char *s; | |
4246 | { | |
4247 | const struct section_to_type *t; | |
4248 | ||
4249 | for (t = &stt[0]; t->section; t++) | |
4250 | if (!strcmp (s, t->section)) | |
4251 | return t->type; | |
4252 | return '?'; | |
4253 | } | |
4254 | ||
4255 | static int | |
4256 | som_decode_symclass (symbol) | |
4257 | asymbol *symbol; | |
4258 | { | |
4259 | char c; | |
4260 | ||
4261 | if (bfd_is_com_section (symbol->section)) | |
4262 | return 'C'; | |
4263 | if (symbol->section == &bfd_und_section) | |
4264 | return 'U'; | |
4265 | if (symbol->section == &bfd_ind_section) | |
4266 | return 'I'; | |
4267 | if (!(symbol->flags & (BSF_GLOBAL|BSF_LOCAL))) | |
4268 | return '?'; | |
4269 | ||
4270 | if (symbol->section == &bfd_abs_section) | |
4271 | c = 'a'; | |
4272 | else if (symbol->section) | |
4273 | c = som_section_type (symbol->section->name); | |
4274 | else | |
4275 | return '?'; | |
4276 | if (symbol->flags & BSF_GLOBAL) | |
4277 | c = toupper (c); | |
4278 | return c; | |
4279 | } | |
4280 | ||
d9ad93bc KR |
4281 | /* Return information about SOM symbol SYMBOL in RET. */ |
4282 | ||
4283 | static void | |
9e16fcf1 | 4284 | som_get_symbol_info (ignore_abfd, symbol, ret) |
017a52d7 | 4285 | bfd *ignore_abfd; |
d9ad93bc KR |
4286 | asymbol *symbol; |
4287 | symbol_info *ret; | |
4288 | { | |
017a52d7 JL |
4289 | ret->type = som_decode_symclass (symbol); |
4290 | if (ret->type != 'U') | |
4291 | ret->value = symbol->value+symbol->section->vma; | |
4292 | else | |
4293 | ret->value = 0; | |
4294 | ret->name = symbol->name; | |
d9ad93bc KR |
4295 | } |
4296 | ||
3c37f9ca JL |
4297 | /* Count the number of symbols in the archive symbol table. Necessary |
4298 | so that we can allocate space for all the carsyms at once. */ | |
4299 | ||
4300 | static boolean | |
4301 | som_bfd_count_ar_symbols (abfd, lst_header, count) | |
4302 | bfd *abfd; | |
4303 | struct lst_header *lst_header; | |
4304 | symindex *count; | |
4305 | { | |
4306 | unsigned int i; | |
4c9db344 | 4307 | unsigned int *hash_table = NULL; |
3c37f9ca JL |
4308 | file_ptr lst_filepos = bfd_tell (abfd) - sizeof (struct lst_header); |
4309 | ||
80425e6c JK |
4310 | hash_table = |
4311 | (unsigned int *) malloc (lst_header->hash_size * sizeof (unsigned int)); | |
4312 | if (hash_table == NULL) | |
4313 | { | |
4314 | bfd_set_error (bfd_error_no_memory); | |
4315 | goto error_return; | |
4316 | } | |
4317 | ||
3c37f9ca JL |
4318 | /* Don't forget to initialize the counter! */ |
4319 | *count = 0; | |
4320 | ||
4321 | /* Read in the hash table. The has table is an array of 32bit file offsets | |
4322 | which point to the hash chains. */ | |
4323 | if (bfd_read ((PTR) hash_table, lst_header->hash_size, 4, abfd) | |
4324 | != lst_header->hash_size * 4) | |
4325 | { | |
d1ad85a6 | 4326 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4327 | goto error_return; |
3c37f9ca JL |
4328 | } |
4329 | ||
4330 | /* Walk each chain counting the number of symbols found on that particular | |
4331 | chain. */ | |
4332 | for (i = 0; i < lst_header->hash_size; i++) | |
4333 | { | |
4334 | struct lst_symbol_record lst_symbol; | |
4335 | ||
4336 | /* An empty chain has zero as it's file offset. */ | |
4337 | if (hash_table[i] == 0) | |
4338 | continue; | |
4339 | ||
4340 | /* Seek to the first symbol in this hash chain. */ | |
4341 | if (bfd_seek (abfd, lst_filepos + hash_table[i], SEEK_SET) < 0) | |
4342 | { | |
d1ad85a6 | 4343 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4344 | goto error_return; |
3c37f9ca JL |
4345 | } |
4346 | ||
4347 | /* Read in this symbol and update the counter. */ | |
4348 | if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd) | |
4349 | != sizeof (lst_symbol)) | |
4350 | { | |
d1ad85a6 | 4351 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4352 | goto error_return; |
3c37f9ca JL |
4353 | } |
4354 | (*count)++; | |
4355 | ||
4356 | /* Now iterate through the rest of the symbols on this chain. */ | |
4357 | while (lst_symbol.next_entry) | |
4358 | { | |
4359 | ||
4360 | /* Seek to the next symbol. */ | |
4361 | if (bfd_seek (abfd, lst_filepos + lst_symbol.next_entry, SEEK_SET) | |
4362 | < 0) | |
4363 | { | |
d1ad85a6 | 4364 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4365 | goto error_return; |
3c37f9ca JL |
4366 | } |
4367 | ||
4368 | /* Read the symbol in and update the counter. */ | |
4369 | if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd) | |
4370 | != sizeof (lst_symbol)) | |
4371 | { | |
d1ad85a6 | 4372 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4373 | goto error_return; |
3c37f9ca JL |
4374 | } |
4375 | (*count)++; | |
4376 | } | |
4377 | } | |
80425e6c JK |
4378 | if (hash_table != NULL) |
4379 | free (hash_table); | |
3c37f9ca | 4380 | return true; |
80425e6c JK |
4381 | |
4382 | error_return: | |
4383 | if (hash_table != NULL) | |
4384 | free (hash_table); | |
4385 | return false; | |
3c37f9ca JL |
4386 | } |
4387 | ||
4388 | /* Fill in the canonical archive symbols (SYMS) from the archive described | |
4389 | by ABFD and LST_HEADER. */ | |
4390 | ||
4391 | static boolean | |
4392 | som_bfd_fill_in_ar_symbols (abfd, lst_header, syms) | |
4393 | bfd *abfd; | |
4394 | struct lst_header *lst_header; | |
4395 | carsym **syms; | |
4396 | { | |
4397 | unsigned int i, len; | |
4398 | carsym *set = syms[0]; | |
80425e6c JK |
4399 | unsigned int *hash_table = NULL; |
4400 | struct som_entry *som_dict = NULL; | |
3c37f9ca JL |
4401 | file_ptr lst_filepos = bfd_tell (abfd) - sizeof (struct lst_header); |
4402 | ||
80425e6c JK |
4403 | hash_table = |
4404 | (unsigned int *) malloc (lst_header->hash_size * sizeof (unsigned int)); | |
4405 | if (hash_table == NULL) | |
4406 | { | |
4407 | bfd_set_error (bfd_error_no_memory); | |
4408 | goto error_return; | |
4409 | } | |
4410 | ||
4411 | som_dict = | |
4412 | (struct som_entry *) malloc (lst_header->module_count | |
4413 | * sizeof (struct som_entry)); | |
4414 | if (som_dict == NULL) | |
4415 | { | |
4416 | bfd_set_error (bfd_error_no_memory); | |
4417 | goto error_return; | |
4418 | } | |
4419 | ||
3c37f9ca JL |
4420 | /* Read in the hash table. The has table is an array of 32bit file offsets |
4421 | which point to the hash chains. */ | |
4422 | if (bfd_read ((PTR) hash_table, lst_header->hash_size, 4, abfd) | |
4423 | != lst_header->hash_size * 4) | |
4424 | { | |
d1ad85a6 | 4425 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4426 | goto error_return; |
3c37f9ca JL |
4427 | } |
4428 | ||
4429 | /* Seek to and read in the SOM dictionary. We will need this to fill | |
4430 | in the carsym's filepos field. */ | |
4431 | if (bfd_seek (abfd, lst_filepos + lst_header->dir_loc, SEEK_SET) < 0) | |
4432 | { | |
d1ad85a6 | 4433 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4434 | goto error_return; |
3c37f9ca JL |
4435 | } |
4436 | ||
4437 | if (bfd_read ((PTR) som_dict, lst_header->module_count, | |
4438 | sizeof (struct som_entry), abfd) | |
4439 | != lst_header->module_count * sizeof (struct som_entry)) | |
4440 | { | |
d1ad85a6 | 4441 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4442 | goto error_return; |
3c37f9ca JL |
4443 | } |
4444 | ||
4445 | /* Walk each chain filling in the carsyms as we go along. */ | |
4446 | for (i = 0; i < lst_header->hash_size; i++) | |
4447 | { | |
4448 | struct lst_symbol_record lst_symbol; | |
4449 | ||
4450 | /* An empty chain has zero as it's file offset. */ | |
4451 | if (hash_table[i] == 0) | |
4452 | continue; | |
4453 | ||
4454 | /* Seek to and read the first symbol on the chain. */ | |
4455 | if (bfd_seek (abfd, lst_filepos + hash_table[i], SEEK_SET) < 0) | |
4456 | { | |
d1ad85a6 | 4457 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4458 | goto error_return; |
3c37f9ca JL |
4459 | } |
4460 | ||
4461 | if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd) | |
4462 | != sizeof (lst_symbol)) | |
4463 | { | |
d1ad85a6 | 4464 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4465 | goto error_return; |
3c37f9ca JL |
4466 | } |
4467 | ||
4468 | /* Get the name of the symbol, first get the length which is stored | |
4469 | as a 32bit integer just before the symbol. | |
4470 | ||
4471 | One might ask why we don't just read in the entire string table | |
4472 | and index into it. Well, according to the SOM ABI the string | |
4473 | index can point *anywhere* in the archive to save space, so just | |
4474 | using the string table would not be safe. */ | |
4475 | if (bfd_seek (abfd, lst_filepos + lst_header->string_loc | |
4476 | + lst_symbol.name.n_strx - 4, SEEK_SET) < 0) | |
4477 | { | |
d1ad85a6 | 4478 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4479 | goto error_return; |
3c37f9ca JL |
4480 | } |
4481 | ||
4482 | if (bfd_read (&len, 1, 4, abfd) != 4) | |
4483 | { | |
d1ad85a6 | 4484 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4485 | goto error_return; |
3c37f9ca JL |
4486 | } |
4487 | ||
4488 | /* Allocate space for the name and null terminate it too. */ | |
4489 | set->name = bfd_zalloc (abfd, len + 1); | |
4490 | if (!set->name) | |
4491 | { | |
d1ad85a6 | 4492 | bfd_set_error (bfd_error_no_memory); |
80425e6c | 4493 | goto error_return; |
3c37f9ca JL |
4494 | } |
4495 | if (bfd_read (set->name, 1, len, abfd) != len) | |
4496 | { | |
d1ad85a6 | 4497 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4498 | goto error_return; |
3c37f9ca JL |
4499 | } |
4500 | set->name[len] = 0; | |
4501 | ||
4502 | /* Fill in the file offset. Note that the "location" field points | |
4503 | to the SOM itself, not the ar_hdr in front of it. */ | |
4504 | set->file_offset = som_dict[lst_symbol.som_index].location | |
4505 | - sizeof (struct ar_hdr); | |
4506 | ||
4507 | /* Go to the next symbol. */ | |
4508 | set++; | |
4509 | ||
4510 | /* Iterate through the rest of the chain. */ | |
4511 | while (lst_symbol.next_entry) | |
4512 | { | |
4513 | /* Seek to the next symbol and read it in. */ | |
4514 | if (bfd_seek (abfd, lst_filepos + lst_symbol.next_entry, SEEK_SET) | |
4515 | < 0) | |
4516 | { | |
d1ad85a6 | 4517 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4518 | goto error_return; |
3c37f9ca JL |
4519 | } |
4520 | ||
4521 | if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd) | |
4522 | != sizeof (lst_symbol)) | |
4523 | { | |
d1ad85a6 | 4524 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4525 | goto error_return; |
3c37f9ca JL |
4526 | } |
4527 | ||
4528 | /* Seek to the name length & string and read them in. */ | |
4529 | if (bfd_seek (abfd, lst_filepos + lst_header->string_loc | |
4530 | + lst_symbol.name.n_strx - 4, SEEK_SET) < 0) | |
4531 | { | |
d1ad85a6 | 4532 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4533 | goto error_return; |
3c37f9ca JL |
4534 | } |
4535 | ||
4536 | if (bfd_read (&len, 1, 4, abfd) != 4) | |
4537 | { | |
d1ad85a6 | 4538 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4539 | goto error_return; |
3c37f9ca JL |
4540 | } |
4541 | ||
4542 | /* Allocate space for the name and null terminate it too. */ | |
4543 | set->name = bfd_zalloc (abfd, len + 1); | |
4544 | if (!set->name) | |
4545 | { | |
d1ad85a6 | 4546 | bfd_set_error (bfd_error_no_memory); |
80425e6c | 4547 | goto error_return; |
3c37f9ca JL |
4548 | } |
4549 | if (bfd_read (set->name, 1, len, abfd) != len) | |
4550 | { | |
d1ad85a6 | 4551 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4552 | goto error_return; |
3c37f9ca JL |
4553 | } |
4554 | set->name[len] = 0; | |
4555 | ||
4556 | /* Fill in the file offset. Note that the "location" field points | |
4557 | to the SOM itself, not the ar_hdr in front of it. */ | |
4558 | set->file_offset = som_dict[lst_symbol.som_index].location | |
4559 | - sizeof (struct ar_hdr); | |
4560 | ||
4561 | /* Go on to the next symbol. */ | |
4562 | set++; | |
4563 | } | |
4564 | } | |
4565 | /* If we haven't died by now, then we successfully read the entire | |
4566 | archive symbol table. */ | |
80425e6c JK |
4567 | if (hash_table != NULL) |
4568 | free (hash_table); | |
4569 | if (som_dict != NULL) | |
4570 | free (som_dict); | |
3c37f9ca | 4571 | return true; |
80425e6c JK |
4572 | |
4573 | error_return: | |
4574 | if (hash_table != NULL) | |
4575 | free (hash_table); | |
4576 | if (som_dict != NULL) | |
4577 | free (som_dict); | |
4578 | return false; | |
3c37f9ca JL |
4579 | } |
4580 | ||
4581 | /* Read in the LST from the archive. */ | |
4582 | static boolean | |
4583 | som_slurp_armap (abfd) | |
4584 | bfd *abfd; | |
4585 | { | |
4586 | struct lst_header lst_header; | |
4587 | struct ar_hdr ar_header; | |
4588 | unsigned int parsed_size; | |
4589 | struct artdata *ardata = bfd_ardata (abfd); | |
4590 | char nextname[17]; | |
4591 | int i = bfd_read ((PTR) nextname, 1, 16, abfd); | |
4592 | ||
4593 | /* Special cases. */ | |
4594 | if (i == 0) | |
4595 | return true; | |
4596 | if (i != 16) | |
4597 | return false; | |
4598 | ||
4599 | if (bfd_seek (abfd, (file_ptr) - 16, SEEK_CUR) < 0) | |
4600 | { | |
d1ad85a6 | 4601 | bfd_set_error (bfd_error_system_call); |
3c37f9ca JL |
4602 | return false; |
4603 | } | |
4604 | ||
4605 | /* For archives without .o files there is no symbol table. */ | |
4606 | if (strncmp (nextname, "/ ", 16)) | |
4607 | { | |
4608 | bfd_has_map (abfd) = false; | |
4609 | return true; | |
4610 | } | |
4611 | ||
4612 | /* Read in and sanity check the archive header. */ | |
4613 | if (bfd_read ((PTR) &ar_header, 1, sizeof (struct ar_hdr), abfd) | |
4614 | != sizeof (struct ar_hdr)) | |
4615 | { | |
d1ad85a6 | 4616 | bfd_set_error (bfd_error_system_call); |
3c37f9ca JL |
4617 | return false; |
4618 | } | |
4619 | ||
4620 | if (strncmp (ar_header.ar_fmag, ARFMAG, 2)) | |
4621 | { | |
d1ad85a6 | 4622 | bfd_set_error (bfd_error_malformed_archive); |
ec743cef | 4623 | return false; |
3c37f9ca JL |
4624 | } |
4625 | ||
4626 | /* How big is the archive symbol table entry? */ | |
4627 | errno = 0; | |
4628 | parsed_size = strtol (ar_header.ar_size, NULL, 10); | |
4629 | if (errno != 0) | |
4630 | { | |
d1ad85a6 | 4631 | bfd_set_error (bfd_error_malformed_archive); |
ec743cef | 4632 | return false; |
3c37f9ca JL |
4633 | } |
4634 | ||
4635 | /* Save off the file offset of the first real user data. */ | |
4636 | ardata->first_file_filepos = bfd_tell (abfd) + parsed_size; | |
4637 | ||
4638 | /* Read in the library symbol table. We'll make heavy use of this | |
4639 | in just a minute. */ | |
4640 | if (bfd_read ((PTR) & lst_header, 1, sizeof (struct lst_header), abfd) | |
4641 | != sizeof (struct lst_header)) | |
4642 | { | |
d1ad85a6 | 4643 | bfd_set_error (bfd_error_system_call); |
3c37f9ca JL |
4644 | return false; |
4645 | } | |
4646 | ||
4647 | /* Sanity check. */ | |
4648 | if (lst_header.a_magic != LIBMAGIC) | |
4649 | { | |
d1ad85a6 | 4650 | bfd_set_error (bfd_error_malformed_archive); |
ec743cef | 4651 | return false; |
3c37f9ca JL |
4652 | } |
4653 | ||
4654 | /* Count the number of symbols in the library symbol table. */ | |
4655 | if (som_bfd_count_ar_symbols (abfd, &lst_header, &ardata->symdef_count) | |
4656 | == false) | |
4657 | return false; | |
4658 | ||
4659 | /* Get back to the start of the library symbol table. */ | |
4660 | if (bfd_seek (abfd, ardata->first_file_filepos - parsed_size | |
4661 | + sizeof (struct lst_header), SEEK_SET) < 0) | |
4662 | { | |
d1ad85a6 | 4663 | bfd_set_error (bfd_error_system_call); |
3c37f9ca JL |
4664 | return false; |
4665 | } | |
4666 | ||
4667 | /* Initializae the cache and allocate space for the library symbols. */ | |
4668 | ardata->cache = 0; | |
4669 | ardata->symdefs = (carsym *) bfd_alloc (abfd, | |
4670 | (ardata->symdef_count | |
4671 | * sizeof (carsym))); | |
4672 | if (!ardata->symdefs) | |
4673 | { | |
d1ad85a6 | 4674 | bfd_set_error (bfd_error_no_memory); |
3c37f9ca JL |
4675 | return false; |
4676 | } | |
4677 | ||
4678 | /* Now fill in the canonical archive symbols. */ | |
4679 | if (som_bfd_fill_in_ar_symbols (abfd, &lst_header, &ardata->symdefs) | |
4680 | == false) | |
4681 | return false; | |
4682 | ||
4683 | /* Notify the generic archive code that we have a symbol map. */ | |
4684 | bfd_has_map (abfd) = true; | |
4685 | return true; | |
4686 | } | |
4687 | ||
6e033f86 JL |
4688 | /* Begin preparing to write a SOM library symbol table. |
4689 | ||
4690 | As part of the prep work we need to determine the number of symbols | |
4691 | and the size of the associated string section. */ | |
4692 | ||
4693 | static boolean | |
4694 | som_bfd_prep_for_ar_write (abfd, num_syms, stringsize) | |
4695 | bfd *abfd; | |
4696 | unsigned int *num_syms, *stringsize; | |
4697 | { | |
4698 | bfd *curr_bfd = abfd->archive_head; | |
4699 | ||
4700 | /* Some initialization. */ | |
4701 | *num_syms = 0; | |
4702 | *stringsize = 0; | |
4703 | ||
4704 | /* Iterate over each BFD within this archive. */ | |
4705 | while (curr_bfd != NULL) | |
4706 | { | |
4707 | unsigned int curr_count, i; | |
c6cdb69a | 4708 | som_symbol_type *sym; |
6e033f86 JL |
4709 | |
4710 | /* Make sure the symbol table has been read, then snag a pointer | |
4711 | to it. It's a little slimey to grab the symbols via obj_som_symtab, | |
4712 | but doing so avoids allocating lots of extra memory. */ | |
4713 | if (som_slurp_symbol_table (curr_bfd) == false) | |
4714 | return false; | |
4715 | ||
c6cdb69a | 4716 | sym = obj_som_symtab (curr_bfd); |
6e033f86 JL |
4717 | curr_count = bfd_get_symcount (curr_bfd); |
4718 | ||
4719 | /* Examine each symbol to determine if it belongs in the | |
4720 | library symbol table. */ | |
4721 | for (i = 0; i < curr_count; i++, sym++) | |
4722 | { | |
4723 | struct som_misc_symbol_info info; | |
4724 | ||
4725 | /* Derive SOM information from the BFD symbol. */ | |
c6cdb69a | 4726 | som_bfd_derive_misc_symbol_info (curr_bfd, &sym->symbol, &info); |
6e033f86 JL |
4727 | |
4728 | /* Should we include this symbol? */ | |
4729 | if (info.symbol_type == ST_NULL | |
4730 | || info.symbol_type == ST_SYM_EXT | |
4731 | || info.symbol_type == ST_ARG_EXT) | |
4732 | continue; | |
4733 | ||
4734 | /* Only global symbols and unsatisfied commons. */ | |
4735 | if (info.symbol_scope != SS_UNIVERSAL | |
4736 | && info.symbol_type != ST_STORAGE) | |
4737 | continue; | |
4738 | ||
4739 | /* Do no include undefined symbols. */ | |
c6cdb69a | 4740 | if (sym->symbol.section == &bfd_und_section) |
6e033f86 JL |
4741 | continue; |
4742 | ||
4743 | /* Bump the various counters, being careful to honor | |
4744 | alignment considerations in the string table. */ | |
4745 | (*num_syms)++; | |
c6cdb69a | 4746 | *stringsize = *stringsize + strlen (sym->symbol.name) + 5; |
6e033f86 JL |
4747 | while (*stringsize % 4) |
4748 | (*stringsize)++; | |
4749 | } | |
4750 | ||
4751 | curr_bfd = curr_bfd->next; | |
4752 | } | |
4753 | return true; | |
4754 | } | |
4755 | ||
4756 | /* Hash a symbol name based on the hashing algorithm presented in the | |
4757 | SOM ABI. */ | |
4758 | static unsigned int | |
4759 | som_bfd_ar_symbol_hash (symbol) | |
4760 | asymbol *symbol; | |
4761 | { | |
4762 | unsigned int len = strlen (symbol->name); | |
4763 | ||
4764 | /* Names with length 1 are special. */ | |
4765 | if (len == 1) | |
4766 | return 0x1000100 | (symbol->name[0] << 16) | symbol->name[0]; | |
4767 | ||
4768 | return ((len & 0x7f) << 24) | (symbol->name[1] << 16) | |
4769 | | (symbol->name[len-2] << 8) | symbol->name[len-1]; | |
4770 | } | |
4771 | ||
4772 | /* Do the bulk of the work required to write the SOM library | |
4773 | symbol table. */ | |
4774 | ||
4775 | static boolean | |
4776 | som_bfd_ar_write_symbol_stuff (abfd, nsyms, string_size, lst) | |
4777 | bfd *abfd; | |
4778 | unsigned int nsyms, string_size; | |
4779 | struct lst_header lst; | |
4780 | { | |
4781 | file_ptr lst_filepos; | |
80425e6c JK |
4782 | char *strings = NULL, *p; |
4783 | struct lst_symbol_record *lst_syms = NULL, *curr_lst_sym; | |
6e033f86 | 4784 | bfd *curr_bfd = abfd->archive_head; |
80425e6c JK |
4785 | unsigned int *hash_table = NULL; |
4786 | struct som_entry *som_dict = NULL; | |
4787 | struct lst_symbol_record **last_hash_entry = NULL; | |
4788 | unsigned int curr_som_offset, som_index; | |
4789 | ||
4790 | hash_table = | |
4791 | (unsigned int *) malloc (lst.hash_size * sizeof (unsigned int)); | |
4792 | if (hash_table == NULL) | |
4793 | { | |
4794 | bfd_set_error (bfd_error_no_memory); | |
4795 | goto error_return; | |
4796 | } | |
4797 | som_dict = | |
4798 | (struct som_entry *) malloc (lst.module_count | |
2ab0b7f3 | 4799 | * sizeof (struct som_entry)); |
80425e6c JK |
4800 | if (som_dict == NULL) |
4801 | { | |
4802 | bfd_set_error (bfd_error_no_memory); | |
4803 | goto error_return; | |
4804 | } | |
4805 | ||
4806 | last_hash_entry = | |
2ab0b7f3 | 4807 | ((struct lst_symbol_record **) |
80425e6c JK |
4808 | malloc (lst.hash_size * sizeof (struct lst_symbol_record *))); |
4809 | if (last_hash_entry == NULL) | |
4810 | { | |
4811 | bfd_set_error (bfd_error_no_memory); | |
4812 | goto error_return; | |
4813 | } | |
6e033f86 JL |
4814 | |
4815 | /* Lots of fields are file positions relative to the start | |
4816 | of the lst record. So save its location. */ | |
4817 | lst_filepos = bfd_tell (abfd) - sizeof (struct lst_header); | |
4818 | ||
4819 | /* Some initialization. */ | |
4820 | memset (hash_table, 0, 4 * lst.hash_size); | |
4821 | memset (som_dict, 0, lst.module_count * sizeof (struct som_entry)); | |
4822 | memset (last_hash_entry, 0, | |
4823 | lst.hash_size * sizeof (struct lst_symbol_record *)); | |
4824 | ||
4825 | /* Symbols have som_index fields, so we have to keep track of the | |
4826 | index of each SOM in the archive. | |
4827 | ||
4828 | The SOM dictionary has (among other things) the absolute file | |
4829 | position for the SOM which a particular dictionary entry | |
4830 | describes. We have to compute that information as we iterate | |
4831 | through the SOMs/symbols. */ | |
4832 | som_index = 0; | |
4833 | curr_som_offset = 8 + 2 * sizeof (struct ar_hdr) + lst.file_end; | |
4834 | ||
4835 | /* FIXME should be done with buffers just like everything else... */ | |
80425e6c JK |
4836 | lst_syms = malloc (nsyms * sizeof (struct lst_symbol_record)); |
4837 | if (lst_syms == NULL) | |
4838 | { | |
4839 | bfd_set_error (bfd_error_no_memory); | |
4840 | goto error_return; | |
4841 | } | |
4842 | strings = malloc (string_size); | |
4843 | if (strings == NULL) | |
4844 | { | |
4845 | bfd_set_error (bfd_error_no_memory); | |
4846 | goto error_return; | |
4847 | } | |
4848 | ||
6e033f86 JL |
4849 | p = strings; |
4850 | curr_lst_sym = lst_syms; | |
4851 | ||
4852 | ||
4853 | while (curr_bfd != NULL) | |
4854 | { | |
4855 | unsigned int curr_count, i; | |
c6cdb69a | 4856 | som_symbol_type *sym; |
6e033f86 JL |
4857 | |
4858 | /* Make sure the symbol table has been read, then snag a pointer | |
4859 | to it. It's a little slimey to grab the symbols via obj_som_symtab, | |
4860 | but doing so avoids allocating lots of extra memory. */ | |
4861 | if (som_slurp_symbol_table (curr_bfd) == false) | |
80425e6c | 4862 | goto error_return; |
6e033f86 | 4863 | |
c6cdb69a | 4864 | sym = obj_som_symtab (curr_bfd); |
6e033f86 JL |
4865 | curr_count = bfd_get_symcount (curr_bfd); |
4866 | ||
4867 | for (i = 0; i < curr_count; i++, sym++) | |
4868 | { | |
4869 | struct som_misc_symbol_info info; | |
4870 | ||
4871 | /* Derive SOM information from the BFD symbol. */ | |
c6cdb69a | 4872 | som_bfd_derive_misc_symbol_info (curr_bfd, &sym->symbol, &info); |
6e033f86 JL |
4873 | |
4874 | /* Should we include this symbol? */ | |
4875 | if (info.symbol_type == ST_NULL | |
4876 | || info.symbol_type == ST_SYM_EXT | |
4877 | || info.symbol_type == ST_ARG_EXT) | |
4878 | continue; | |
4879 | ||
4880 | /* Only global symbols and unsatisfied commons. */ | |
4881 | if (info.symbol_scope != SS_UNIVERSAL | |
4882 | && info.symbol_type != ST_STORAGE) | |
4883 | continue; | |
4884 | ||
4885 | /* Do no include undefined symbols. */ | |
c6cdb69a | 4886 | if (sym->symbol.section == &bfd_und_section) |
6e033f86 JL |
4887 | continue; |
4888 | ||
4889 | /* If this is the first symbol from this SOM, then update | |
4890 | the SOM dictionary too. */ | |
4891 | if (som_dict[som_index].location == 0) | |
4892 | { | |
4893 | som_dict[som_index].location = curr_som_offset; | |
4894 | som_dict[som_index].length = arelt_size (curr_bfd); | |
4895 | } | |
4896 | ||
4897 | /* Fill in the lst symbol record. */ | |
4898 | curr_lst_sym->hidden = 0; | |
4899 | curr_lst_sym->secondary_def = 0; | |
4900 | curr_lst_sym->symbol_type = info.symbol_type; | |
4901 | curr_lst_sym->symbol_scope = info.symbol_scope; | |
4902 | curr_lst_sym->check_level = 0; | |
4903 | curr_lst_sym->must_qualify = 0; | |
4904 | curr_lst_sym->initially_frozen = 0; | |
4905 | curr_lst_sym->memory_resident = 0; | |
c6cdb69a | 4906 | curr_lst_sym->is_common = (sym->symbol.section == &bfd_com_section); |
6e033f86 JL |
4907 | curr_lst_sym->dup_common = 0; |
4908 | curr_lst_sym->xleast = 0; | |
4909 | curr_lst_sym->arg_reloc = info.arg_reloc; | |
4910 | curr_lst_sym->name.n_strx = p - strings + 4; | |
4911 | curr_lst_sym->qualifier_name.n_strx = 0; | |
4912 | curr_lst_sym->symbol_info = info.symbol_info; | |
4913 | curr_lst_sym->symbol_value = info.symbol_value; | |
4914 | curr_lst_sym->symbol_descriptor = 0; | |
4915 | curr_lst_sym->reserved = 0; | |
4916 | curr_lst_sym->som_index = som_index; | |
c6cdb69a | 4917 | curr_lst_sym->symbol_key = som_bfd_ar_symbol_hash (&sym->symbol); |
6e033f86 JL |
4918 | curr_lst_sym->next_entry = 0; |
4919 | ||
4920 | /* Insert into the hash table. */ | |
4921 | if (hash_table[curr_lst_sym->symbol_key % lst.hash_size]) | |
4922 | { | |
4923 | struct lst_symbol_record *tmp; | |
4924 | ||
4925 | /* There is already something at the head of this hash chain, | |
4926 | so tack this symbol onto the end of the chain. */ | |
4927 | tmp = last_hash_entry[curr_lst_sym->symbol_key % lst.hash_size]; | |
4928 | tmp->next_entry | |
4929 | = (curr_lst_sym - lst_syms) * sizeof (struct lst_symbol_record) | |
4930 | + lst.hash_size * 4 | |
4931 | + lst.module_count * sizeof (struct som_entry) | |
4932 | + sizeof (struct lst_header); | |
4933 | } | |
4934 | else | |
4935 | { | |
4936 | /* First entry in this hash chain. */ | |
4937 | hash_table[curr_lst_sym->symbol_key % lst.hash_size] | |
4938 | = (curr_lst_sym - lst_syms) * sizeof (struct lst_symbol_record) | |
4939 | + lst.hash_size * 4 | |
4940 | + lst.module_count * sizeof (struct som_entry) | |
4941 | + sizeof (struct lst_header); | |
4942 | } | |
4943 | ||
4944 | /* Keep track of the last symbol we added to this chain so we can | |
4945 | easily update its next_entry pointer. */ | |
4946 | last_hash_entry[curr_lst_sym->symbol_key % lst.hash_size] | |
4947 | = curr_lst_sym; | |
4948 | ||
4949 | ||
4950 | /* Update the string table. */ | |
c6cdb69a | 4951 | bfd_put_32 (abfd, strlen (sym->symbol.name), p); |
6e033f86 | 4952 | p += 4; |
c6cdb69a JL |
4953 | strcpy (p, sym->symbol.name); |
4954 | p += strlen (sym->symbol.name) + 1; | |
6e033f86 JL |
4955 | while ((int)p % 4) |
4956 | { | |
4957 | bfd_put_8 (abfd, 0, p); | |
4958 | p++; | |
4959 | } | |
4960 | ||
4961 | /* Head to the next symbol. */ | |
4962 | curr_lst_sym++; | |
4963 | } | |
4964 | ||
4965 | /* Keep track of where each SOM will finally reside; then look | |
4966 | at the next BFD. */ | |
4967 | curr_som_offset += arelt_size (curr_bfd) + sizeof (struct ar_hdr); | |
4968 | curr_bfd = curr_bfd->next; | |
4969 | som_index++; | |
4970 | } | |
4971 | ||
4972 | /* Now scribble out the hash table. */ | |
4973 | if (bfd_write ((PTR) hash_table, lst.hash_size, 4, abfd) | |
4974 | != lst.hash_size * 4) | |
4975 | { | |
d1ad85a6 | 4976 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4977 | goto error_return; |
6e033f86 JL |
4978 | } |
4979 | ||
4980 | /* Then the SOM dictionary. */ | |
4981 | if (bfd_write ((PTR) som_dict, lst.module_count, | |
4982 | sizeof (struct som_entry), abfd) | |
4983 | != lst.module_count * sizeof (struct som_entry)) | |
4984 | { | |
d1ad85a6 | 4985 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4986 | goto error_return; |
6e033f86 JL |
4987 | } |
4988 | ||
4989 | /* The library symbols. */ | |
4990 | if (bfd_write ((PTR) lst_syms, nsyms, sizeof (struct lst_symbol_record), abfd) | |
4991 | != nsyms * sizeof (struct lst_symbol_record)) | |
4992 | { | |
d1ad85a6 | 4993 | bfd_set_error (bfd_error_system_call); |
80425e6c | 4994 | goto error_return; |
6e033f86 JL |
4995 | } |
4996 | ||
4997 | /* And finally the strings. */ | |
4998 | if (bfd_write ((PTR) strings, string_size, 1, abfd) != string_size) | |
4999 | { | |
d1ad85a6 | 5000 | bfd_set_error (bfd_error_system_call); |
80425e6c | 5001 | goto error_return; |
6e033f86 JL |
5002 | } |
5003 | ||
80425e6c JK |
5004 | if (hash_table != NULL) |
5005 | free (hash_table); | |
5006 | if (som_dict != NULL) | |
5007 | free (som_dict); | |
5008 | if (last_hash_entry != NULL) | |
5009 | free (last_hash_entry); | |
5010 | if (lst_syms != NULL) | |
5011 | free (lst_syms); | |
5012 | if (strings != NULL) | |
5013 | free (strings); | |
6e033f86 | 5014 | return true; |
80425e6c JK |
5015 | |
5016 | error_return: | |
5017 | if (hash_table != NULL) | |
5018 | free (hash_table); | |
5019 | if (som_dict != NULL) | |
5020 | free (som_dict); | |
5021 | if (last_hash_entry != NULL) | |
5022 | free (last_hash_entry); | |
5023 | if (lst_syms != NULL) | |
5024 | free (lst_syms); | |
5025 | if (strings != NULL) | |
5026 | free (strings); | |
5027 | ||
5028 | return false; | |
6e033f86 JL |
5029 | } |
5030 | ||
5031 | /* Write out the LST for the archive. | |
5032 | ||
5033 | You'll never believe this is really how armaps are handled in SOM... */ | |
5034 | ||
3c37f9ca JL |
5035 | static boolean |
5036 | som_write_armap (abfd) | |
5037 | bfd *abfd; | |
5038 | { | |
6e033f86 JL |
5039 | bfd *curr_bfd; |
5040 | struct stat statbuf; | |
5041 | unsigned int i, lst_size, nsyms, stringsize; | |
5042 | struct ar_hdr hdr; | |
5043 | struct lst_header lst; | |
5044 | int *p; | |
5045 | ||
5046 | /* We'll use this for the archive's date and mode later. */ | |
5047 | if (stat (abfd->filename, &statbuf) != 0) | |
5048 | { | |
d1ad85a6 | 5049 | bfd_set_error (bfd_error_system_call); |
6e033f86 JL |
5050 | return false; |
5051 | } | |
5052 | /* Fudge factor. */ | |
5053 | bfd_ardata (abfd)->armap_timestamp = statbuf.st_mtime + 60; | |
5054 | ||
5055 | /* Account for the lst header first. */ | |
5056 | lst_size = sizeof (struct lst_header); | |
5057 | ||
5058 | /* Start building the LST header. */ | |
5059 | lst.system_id = HP9000S800_ID; | |
5060 | lst.a_magic = LIBMAGIC; | |
5061 | lst.version_id = VERSION_ID; | |
5062 | lst.file_time.secs = 0; | |
5063 | lst.file_time.nanosecs = 0; | |
5064 | ||
5065 | lst.hash_loc = lst_size; | |
5066 | lst.hash_size = SOM_LST_HASH_SIZE; | |
5067 | ||
5068 | /* Hash table is a SOM_LST_HASH_SIZE 32bit offsets. */ | |
5069 | lst_size += 4 * SOM_LST_HASH_SIZE; | |
5070 | ||
5071 | /* We need to count the number of SOMs in this archive. */ | |
5072 | curr_bfd = abfd->archive_head; | |
5073 | lst.module_count = 0; | |
5074 | while (curr_bfd != NULL) | |
5075 | { | |
5076 | lst.module_count++; | |
5077 | curr_bfd = curr_bfd->next; | |
5078 | } | |
5079 | lst.module_limit = lst.module_count; | |
5080 | lst.dir_loc = lst_size; | |
5081 | lst_size += sizeof (struct som_entry) * lst.module_count; | |
5082 | ||
5083 | /* We don't support import/export tables, auxiliary headers, | |
5084 | or free lists yet. Make the linker work a little harder | |
5085 | to make our life easier. */ | |
5086 | ||
5087 | lst.export_loc = 0; | |
5088 | lst.export_count = 0; | |
5089 | lst.import_loc = 0; | |
5090 | lst.aux_loc = 0; | |
5091 | lst.aux_size = 0; | |
5092 | ||
5093 | /* Count how many symbols we will have on the hash chains and the | |
5094 | size of the associated string table. */ | |
5095 | if (som_bfd_prep_for_ar_write (abfd, &nsyms, &stringsize) == false) | |
5096 | return false; | |
5097 | ||
5098 | lst_size += sizeof (struct lst_symbol_record) * nsyms; | |
5099 | ||
5100 | /* For the string table. One day we might actually use this info | |
5101 | to avoid small seeks/reads when reading archives. */ | |
5102 | lst.string_loc = lst_size; | |
5103 | lst.string_size = stringsize; | |
5104 | lst_size += stringsize; | |
5105 | ||
5106 | /* SOM ABI says this must be zero. */ | |
5107 | lst.free_list = 0; | |
5108 | ||
5109 | lst.file_end = lst_size; | |
5110 | ||
5111 | /* Compute the checksum. Must happen after the entire lst header | |
5112 | has filled in. */ | |
5113 | p = (int *)&lst; | |
5114 | for (i = 0; i < sizeof (struct lst_header)/sizeof (int) - 1; i++) | |
5115 | lst.checksum ^= *p++; | |
5116 | ||
5117 | sprintf (hdr.ar_name, "/ "); | |
5118 | sprintf (hdr.ar_date, "%ld", bfd_ardata (abfd)->armap_timestamp); | |
5119 | sprintf (hdr.ar_uid, "%d", getuid ()); | |
5120 | sprintf (hdr.ar_gid, "%d", getgid ()); | |
5121 | sprintf (hdr.ar_mode, "%-8o", (unsigned int) statbuf.st_mode); | |
5122 | sprintf (hdr.ar_size, "%-10d", (int) lst_size); | |
5123 | hdr.ar_fmag[0] = '`'; | |
5124 | hdr.ar_fmag[1] = '\012'; | |
5125 | ||
5126 | /* Turn any nulls into spaces. */ | |
5127 | for (i = 0; i < sizeof (struct ar_hdr); i++) | |
5128 | if (((char *) (&hdr))[i] == '\0') | |
5129 | (((char *) (&hdr))[i]) = ' '; | |
5130 | ||
5131 | /* Scribble out the ar header. */ | |
5132 | if (bfd_write ((PTR) &hdr, 1, sizeof (struct ar_hdr), abfd) | |
5133 | != sizeof (struct ar_hdr)) | |
5134 | { | |
d1ad85a6 | 5135 | bfd_set_error (bfd_error_system_call); |
6e033f86 JL |
5136 | return false; |
5137 | } | |
5138 | ||
5139 | /* Now scribble out the lst header. */ | |
5140 | if (bfd_write ((PTR) &lst, 1, sizeof (struct lst_header), abfd) | |
5141 | != sizeof (struct lst_header)) | |
5142 | { | |
d1ad85a6 | 5143 | bfd_set_error (bfd_error_system_call); |
6e033f86 JL |
5144 | return false; |
5145 | } | |
5146 | ||
5147 | /* Build and write the armap. */ | |
5148 | if (som_bfd_ar_write_symbol_stuff (abfd, nsyms, stringsize, lst) == false) | |
5149 | return false; | |
5150 | ||
5151 | /* Done. */ | |
5152 | return true; | |
3c37f9ca JL |
5153 | } |
5154 | ||
5155 | /* Apparently the extened names are never used, even though they appear | |
5156 | in the SOM ABI. Hmmm. */ | |
5157 | static boolean | |
5158 | som_slurp_extended_name_table (abfd) | |
5159 | bfd *abfd; | |
5160 | { | |
5161 | bfd_ardata (abfd)->extended_names = NULL; | |
5162 | return true; | |
5163 | } | |
5164 | ||
d9ad93bc KR |
5165 | /* End of miscellaneous support functions. */ |
5166 | ||
9e16fcf1 SG |
5167 | #define som_bfd_debug_info_start bfd_void |
5168 | #define som_bfd_debug_info_end bfd_void | |
5169 | #define som_bfd_debug_info_accumulate (PROTO(void,(*),(bfd*, struct sec *))) bfd_void | |
d9ad93bc | 5170 | |
3c37f9ca JL |
5171 | #define som_openr_next_archived_file bfd_generic_openr_next_archived_file |
5172 | #define som_generic_stat_arch_elt bfd_generic_stat_arch_elt | |
5173 | #define som_truncate_arname bfd_bsd_truncate_arname | |
d9ad93bc | 5174 | |
9e16fcf1 SG |
5175 | #define som_get_lineno (struct lineno_cache_entry *(*)())bfd_nullvoidptr |
5176 | #define som_close_and_cleanup bfd_generic_close_and_cleanup | |
5177 | #define som_get_section_contents bfd_generic_get_section_contents | |
d9ad93bc | 5178 | |
9e16fcf1 | 5179 | #define som_bfd_get_relocated_section_contents \ |
d9ad93bc | 5180 | bfd_generic_get_relocated_section_contents |
9e16fcf1 | 5181 | #define som_bfd_relax_section bfd_generic_relax_section |
9e16fcf1 | 5182 | #define som_bfd_make_debug_symbol \ |
d9ad93bc | 5183 | ((asymbol *(*) PARAMS ((bfd *, void *, unsigned long))) bfd_nullvoidptr) |
39961154 JL |
5184 | #define som_bfd_link_hash_table_create _bfd_generic_link_hash_table_create |
5185 | #define som_bfd_link_add_symbols _bfd_generic_link_add_symbols | |
5186 | #define som_bfd_final_link _bfd_generic_final_link | |
d9ad93bc KR |
5187 | |
5188 | /* Core file support is in the hpux-core backend. */ | |
9e16fcf1 SG |
5189 | #define som_core_file_failing_command _bfd_dummy_core_file_failing_command |
5190 | #define som_core_file_failing_signal _bfd_dummy_core_file_failing_signal | |
5191 | #define som_core_file_matches_executable_p _bfd_dummy_core_file_matches_executable_p | |
d9ad93bc | 5192 | |
9e16fcf1 | 5193 | bfd_target som_vec = |
d9ad93bc | 5194 | { |
9e16fcf1 SG |
5195 | "som", /* name */ |
5196 | bfd_target_som_flavour, | |
d9ad93bc KR |
5197 | true, /* target byte order */ |
5198 | true, /* target headers byte order */ | |
5199 | (HAS_RELOC | EXEC_P | /* object flags */ | |
5200 | HAS_LINENO | HAS_DEBUG | | |
40249bfb | 5201 | HAS_SYMS | HAS_LOCALS | WP_TEXT | D_PAGED), |
d9ad93bc | 5202 | (SEC_CODE | SEC_DATA | SEC_ROM | SEC_HAS_CONTENTS |
9e16fcf1 | 5203 | | SEC_ALLOC | SEC_LOAD | SEC_RELOC), /* section flags */ |
d9ad93bc KR |
5204 | |
5205 | /* leading_symbol_char: is the first char of a user symbol | |
9e16fcf1 | 5206 | predictable, and if so what is it */ |
d9ad93bc | 5207 | 0, |
6e033f86 | 5208 | '/', /* ar_pad_char */ |
d9ad93bc KR |
5209 | 16, /* ar_max_namelen */ |
5210 | 3, /* minimum alignment */ | |
9e16fcf1 SG |
5211 | bfd_getb64, bfd_getb_signed_64, bfd_putb64, |
5212 | bfd_getb32, bfd_getb_signed_32, bfd_putb32, | |
5213 | bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* data */ | |
5214 | bfd_getb64, bfd_getb_signed_64, bfd_putb64, | |
5215 | bfd_getb32, bfd_getb_signed_32, bfd_putb32, | |
5216 | bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* hdrs */ | |
d9ad93bc | 5217 | {_bfd_dummy_target, |
9e16fcf1 | 5218 | som_object_p, /* bfd_check_format */ |
d9ad93bc KR |
5219 | bfd_generic_archive_p, |
5220 | _bfd_dummy_target | |
5221 | }, | |
5222 | { | |
5223 | bfd_false, | |
9e16fcf1 | 5224 | som_mkobject, |
d9ad93bc KR |
5225 | _bfd_generic_mkarchive, |
5226 | bfd_false | |
5227 | }, | |
5228 | { | |
5229 | bfd_false, | |
9e16fcf1 | 5230 | som_write_object_contents, |
d9ad93bc KR |
5231 | _bfd_write_archive_contents, |
5232 | bfd_false, | |
5233 | }, | |
9e16fcf1 SG |
5234 | #undef som |
5235 | JUMP_TABLE (som), | |
d9ad93bc KR |
5236 | (PTR) 0 |
5237 | }; | |
5238 | ||
6941fd4d | 5239 | #endif /* HOST_HPPAHPUX || HOST_HPPABSD || HOST_HPPAOSF */ |