1 /* bfd back-end for HP PA-RISC SOM objects.
2 Copyright (C) 1990, 1991, 1992, 1993, 1994, 1995
3 Free Software Foundation, Inc.
5 Contributed by the Center for Software Science at the
6 University of Utah (pa-gdb-bugs@cs.utah.edu).
8 This file is part of BFD, the Binary File Descriptor library.
10 This program is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 2 of the License, or
13 (at your option) any later version.
15 This program is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with this program; if not, write to the Free Software
22 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
27 #if defined (HOST_HPPAHPUX) || defined (HOST_HPPABSD) || defined (HOST_HPPAOSF)
33 #include <sys/types.h>
34 #include <sys/param.h>
36 #include <machine/reg.h>
40 /* Magic not defined in standard HP-UX header files until 8.0 */
42 #ifndef CPU_PA_RISC1_0
43 #define CPU_PA_RISC1_0 0x20B
44 #endif /* CPU_PA_RISC1_0 */
46 #ifndef CPU_PA_RISC1_1
47 #define CPU_PA_RISC1_1 0x210
48 #endif /* CPU_PA_RISC1_1 */
50 #ifndef _PA_RISC1_0_ID
51 #define _PA_RISC1_0_ID CPU_PA_RISC1_0
52 #endif /* _PA_RISC1_0_ID */
54 #ifndef _PA_RISC1_1_ID
55 #define _PA_RISC1_1_ID CPU_PA_RISC1_1
56 #endif /* _PA_RISC1_1_ID */
58 #ifndef _PA_RISC_MAXID
59 #define _PA_RISC_MAXID 0x2FF
60 #endif /* _PA_RISC_MAXID */
63 #define _PA_RISC_ID(__m_num) \
64 (((__m_num) == _PA_RISC1_0_ID) || \
65 ((__m_num) >= _PA_RISC1_1_ID && (__m_num) <= _PA_RISC_MAXID))
66 #endif /* _PA_RISC_ID */
69 /* HIUX in it's infinite stupidity changed the names for several "well
70 known" constants. Work around such braindamage. Try the HPUX version
71 first, then the HIUX version, and finally provide a default. */
73 #define EXEC_AUX_ID HPUX_AUX_ID
76 #if !defined (EXEC_AUX_ID) && defined (HIUX_AUX_ID)
77 #define EXEC_AUX_ID HIUX_AUX_ID
84 /* Size (in chars) of the temporary buffers used during fixup and string
87 #define SOM_TMP_BUFSIZE 8192
89 /* Size of the hash table in archives. */
90 #define SOM_LST_HASH_SIZE 31
92 /* Max number of SOMs to be found in an archive. */
93 #define SOM_LST_MODULE_LIMIT 1024
95 /* Generic alignment macro. */
96 #define SOM_ALIGN(val, alignment) \
97 (((val) + (alignment) - 1) & ~((alignment) - 1))
99 /* SOM allows any one of the four previous relocations to be reused
100 with a "R_PREV_FIXUP" relocation entry. Since R_PREV_FIXUP
101 relocations are always a single byte, using a R_PREV_FIXUP instead
102 of some multi-byte relocation makes object files smaller.
104 Note one side effect of using a R_PREV_FIXUP is the relocation that
105 is being repeated moves to the front of the queue. */
108 unsigned char *reloc;
112 /* This fully describes the symbol types which may be attached to
113 an EXPORT or IMPORT directive. Only SOM uses this formation
114 (ELF has no need for it). */
118 SYMBOL_TYPE_ABSOLUTE,
122 SYMBOL_TYPE_MILLICODE,
124 SYMBOL_TYPE_PRI_PROG,
125 SYMBOL_TYPE_SEC_PROG,
128 struct section_to_type
134 /* Assorted symbol information that needs to be derived from the BFD symbol
135 and/or the BFD backend private symbol data. */
136 struct som_misc_symbol_info
138 unsigned int symbol_type;
139 unsigned int symbol_scope;
140 unsigned int arg_reloc;
141 unsigned int symbol_info;
142 unsigned int symbol_value;
145 /* Forward declarations */
147 static boolean som_mkobject PARAMS ((bfd *));
148 static const bfd_target * som_object_setup PARAMS ((bfd *,
150 struct som_exec_auxhdr *));
151 static boolean setup_sections PARAMS ((bfd *, struct header *));
152 static const bfd_target * som_object_p PARAMS ((bfd *));
153 static boolean som_write_object_contents PARAMS ((bfd *));
154 static boolean som_slurp_string_table PARAMS ((bfd *));
155 static unsigned int som_slurp_symbol_table PARAMS ((bfd *));
156 static long som_get_symtab_upper_bound PARAMS ((bfd *));
157 static long som_canonicalize_reloc PARAMS ((bfd *, sec_ptr,
158 arelent **, asymbol **));
159 static long som_get_reloc_upper_bound PARAMS ((bfd *, sec_ptr));
160 static unsigned int som_set_reloc_info PARAMS ((unsigned char *, unsigned int,
161 arelent *, asection *,
162 asymbol **, boolean));
163 static boolean som_slurp_reloc_table PARAMS ((bfd *, asection *,
164 asymbol **, boolean));
165 static long som_get_symtab PARAMS ((bfd *, asymbol **));
166 static asymbol * som_make_empty_symbol PARAMS ((bfd *));
167 static void som_print_symbol PARAMS ((bfd *, PTR,
168 asymbol *, bfd_print_symbol_type));
169 static boolean som_new_section_hook PARAMS ((bfd *, asection *));
170 static boolean som_bfd_copy_private_section_data PARAMS ((bfd *, asection *,
172 static boolean som_bfd_copy_private_bfd_data PARAMS ((bfd *, bfd *));
173 static boolean som_bfd_is_local_label PARAMS ((bfd *, asymbol *));
174 static boolean som_set_section_contents PARAMS ((bfd *, sec_ptr, PTR,
175 file_ptr, bfd_size_type));
176 static boolean som_get_section_contents PARAMS ((bfd *, sec_ptr, PTR,
177 file_ptr, bfd_size_type));
178 static boolean som_set_arch_mach PARAMS ((bfd *, enum bfd_architecture,
180 static boolean som_find_nearest_line PARAMS ((bfd *, asection *,
185 static void som_get_symbol_info PARAMS ((bfd *, asymbol *, symbol_info *));
186 static asection * bfd_section_from_som_symbol PARAMS ((bfd *,
187 struct symbol_dictionary_record *));
188 static int log2 PARAMS ((unsigned int));
189 static bfd_reloc_status_type hppa_som_reloc PARAMS ((bfd *, arelent *,
193 static void som_initialize_reloc_queue PARAMS ((struct reloc_queue *));
194 static void som_reloc_queue_insert PARAMS ((unsigned char *, unsigned int,
195 struct reloc_queue *));
196 static void som_reloc_queue_fix PARAMS ((struct reloc_queue *, unsigned int));
197 static int som_reloc_queue_find PARAMS ((unsigned char *, unsigned int,
198 struct reloc_queue *));
199 static unsigned char * try_prev_fixup PARAMS ((bfd *, int *, unsigned char *,
201 struct reloc_queue *));
203 static unsigned char * som_reloc_skip PARAMS ((bfd *, unsigned int,
204 unsigned char *, unsigned int *,
205 struct reloc_queue *));
206 static unsigned char * som_reloc_addend PARAMS ((bfd *, int, unsigned char *,
208 struct reloc_queue *));
209 static unsigned char * som_reloc_call PARAMS ((bfd *, unsigned char *,
212 struct reloc_queue *));
213 static unsigned long som_count_spaces PARAMS ((bfd *));
214 static unsigned long som_count_subspaces PARAMS ((bfd *));
215 static int compare_syms PARAMS ((const void *, const void *));
216 static unsigned long som_compute_checksum PARAMS ((bfd *));
217 static boolean som_prep_headers PARAMS ((bfd *));
218 static int som_sizeof_headers PARAMS ((bfd *, boolean));
219 static boolean som_write_headers PARAMS ((bfd *));
220 static boolean som_build_and_write_symbol_table PARAMS ((bfd *));
221 static void som_prep_for_fixups PARAMS ((bfd *, asymbol **, unsigned long));
222 static boolean som_write_fixups PARAMS ((bfd *, unsigned long, unsigned int *));
223 static boolean som_write_space_strings PARAMS ((bfd *, unsigned long,
225 static boolean som_write_symbol_strings PARAMS ((bfd *, unsigned long,
226 asymbol **, unsigned int,
228 static boolean som_begin_writing PARAMS ((bfd *));
229 static reloc_howto_type * som_bfd_reloc_type_lookup
230 PARAMS ((bfd *, bfd_reloc_code_real_type));
231 static char som_section_type PARAMS ((const char *));
232 static int som_decode_symclass PARAMS ((asymbol *));
233 static boolean som_bfd_count_ar_symbols PARAMS ((bfd *, struct lst_header *,
236 static boolean som_bfd_fill_in_ar_symbols PARAMS ((bfd *, struct lst_header *,
238 static boolean som_slurp_armap PARAMS ((bfd *));
239 static boolean som_write_armap PARAMS ((bfd *, unsigned int, struct orl *,
241 static void som_bfd_derive_misc_symbol_info PARAMS ((bfd *, asymbol *,
242 struct som_misc_symbol_info *));
243 static boolean som_bfd_prep_for_ar_write PARAMS ((bfd *, unsigned int *,
245 static unsigned int som_bfd_ar_symbol_hash PARAMS ((asymbol *));
246 static boolean som_bfd_ar_write_symbol_stuff PARAMS ((bfd *, unsigned int,
249 static CONST char *normalize PARAMS ((CONST char *file));
250 static boolean som_is_space PARAMS ((asection *));
251 static boolean som_is_subspace PARAMS ((asection *));
252 static boolean som_is_container PARAMS ((asection *, asection *));
253 static boolean som_bfd_free_cached_info PARAMS ((bfd *));
255 /* Map SOM section names to POSIX/BSD single-character symbol types.
257 This table includes all the standard subspaces as defined in the
258 current "PRO ABI for PA-RISC Systems", $UNWIND$ which for
259 some reason was left out, and sections specific to embedded stabs. */
261 static const struct section_to_type stt[] = {
263 {"$SHLIB_INFO$", 't'},
264 {"$MILLICODE$", 't'},
267 {"$UNWIND_START$", 't'},
271 {"$SHLIB_DATA$", 'd'},
273 {"$SHORTDATA$", 'g'},
278 {"$GDB_STRINGS$", 'N'},
279 {"$GDB_SYMBOLS$", 'N'},
283 /* About the relocation formatting table...
285 There are 256 entries in the table, one for each possible
286 relocation opcode available in SOM. We index the table by
287 the relocation opcode. The names and operations are those
288 defined by a.out_800 (4).
290 Right now this table is only used to count and perform minimal
291 processing on relocation streams so that they can be internalized
292 into BFD and symbolically printed by utilities. To make actual use
293 of them would be much more difficult, BFD's concept of relocations
294 is far too simple to handle SOM relocations. The basic assumption
295 that a relocation can be completely processed independent of other
296 relocations before an object file is written is invalid for SOM.
298 The SOM relocations are meant to be processed as a stream, they
299 specify copying of data from the input section to the output section
300 while possibly modifying the data in some manner. They also can
301 specify that a variable number of zeros or uninitialized data be
302 inserted on in the output segment at the current offset. Some
303 relocations specify that some previous relocation be re-applied at
304 the current location in the input/output sections. And finally a number
305 of relocations have effects on other sections (R_ENTRY, R_EXIT,
306 R_UNWIND_AUX and a variety of others). There isn't even enough room
307 in the BFD relocation data structure to store enough information to
308 perform all the relocations.
310 Each entry in the table has three fields.
312 The first entry is an index into this "class" of relocations. This
313 index can then be used as a variable within the relocation itself.
315 The second field is a format string which actually controls processing
316 of the relocation. It uses a simple postfix machine to do calculations
317 based on variables/constants found in the string and the relocation
320 The third field specifys whether or not this relocation may use
321 a constant (V) from the previous R_DATA_OVERRIDE rather than a constant
322 stored in the instruction.
326 L = input space byte count
327 D = index into class of relocations
328 M = output space byte count
329 N = statement number (unused?)
331 R = parameter relocation bits
333 T = first 32 bits of stack unwind information
334 U = second 32 bits of stack unwind information
335 V = a literal constant (usually used in the next relocation)
336 P = a previous relocation
338 Lower case letters (starting with 'b') refer to following
339 bytes in the relocation stream. 'b' is the next 1 byte,
340 c is the next 2 bytes, d is the next 3 bytes, etc...
341 This is the variable part of the relocation entries that
342 makes our life a living hell.
344 numerical constants are also used in the format string. Note
345 the constants are represented in decimal.
347 '+', "*" and "=" represents the obvious postfix operators.
348 '<' represents a left shift.
352 Parameter Relocation Bits:
356 Previous Relocations: The index field represents which in the queue
357 of 4 previous fixups should be re-applied.
359 Literal Constants: These are generally used to represent addend
360 parts of relocations when these constants are not stored in the
361 fields of the instructions themselves. For example the instruction
362 addil foo-$global$-0x1234 would use an override for "0x1234" rather
363 than storing it into the addil itself. */
371 static const struct fixup_format som_fixup_formats[256] =
373 /* R_NO_RELOCATION */
374 0, "LD1+4*=", /* 0x00 */
375 1, "LD1+4*=", /* 0x01 */
376 2, "LD1+4*=", /* 0x02 */
377 3, "LD1+4*=", /* 0x03 */
378 4, "LD1+4*=", /* 0x04 */
379 5, "LD1+4*=", /* 0x05 */
380 6, "LD1+4*=", /* 0x06 */
381 7, "LD1+4*=", /* 0x07 */
382 8, "LD1+4*=", /* 0x08 */
383 9, "LD1+4*=", /* 0x09 */
384 10, "LD1+4*=", /* 0x0a */
385 11, "LD1+4*=", /* 0x0b */
386 12, "LD1+4*=", /* 0x0c */
387 13, "LD1+4*=", /* 0x0d */
388 14, "LD1+4*=", /* 0x0e */
389 15, "LD1+4*=", /* 0x0f */
390 16, "LD1+4*=", /* 0x10 */
391 17, "LD1+4*=", /* 0x11 */
392 18, "LD1+4*=", /* 0x12 */
393 19, "LD1+4*=", /* 0x13 */
394 20, "LD1+4*=", /* 0x14 */
395 21, "LD1+4*=", /* 0x15 */
396 22, "LD1+4*=", /* 0x16 */
397 23, "LD1+4*=", /* 0x17 */
398 0, "LD8<b+1+4*=", /* 0x18 */
399 1, "LD8<b+1+4*=", /* 0x19 */
400 2, "LD8<b+1+4*=", /* 0x1a */
401 3, "LD8<b+1+4*=", /* 0x1b */
402 0, "LD16<c+1+4*=", /* 0x1c */
403 1, "LD16<c+1+4*=", /* 0x1d */
404 2, "LD16<c+1+4*=", /* 0x1e */
405 0, "Ld1+=", /* 0x1f */
407 0, "Lb1+4*=", /* 0x20 */
408 1, "Ld1+=", /* 0x21 */
410 0, "Lb1+4*=", /* 0x22 */
411 1, "Ld1+=", /* 0x23 */
414 /* R_DATA_ONE_SYMBOL */
415 0, "L4=Sb=", /* 0x25 */
416 1, "L4=Sd=", /* 0x26 */
418 0, "L4=Sb=", /* 0x27 */
419 1, "L4=Sd=", /* 0x28 */
422 /* R_REPEATED_INIT */
423 0, "L4=Mb1+4*=", /* 0x2a */
424 1, "Lb4*=Mb1+L*=", /* 0x2b */
425 2, "Lb4*=Md1+4*=", /* 0x2c */
426 3, "Ld1+=Me1+=", /* 0x2d */
431 0, "L4=RD=Sb=", /* 0x30 */
432 1, "L4=RD=Sb=", /* 0x31 */
433 2, "L4=RD=Sb=", /* 0x32 */
434 3, "L4=RD=Sb=", /* 0x33 */
435 4, "L4=RD=Sb=", /* 0x34 */
436 5, "L4=RD=Sb=", /* 0x35 */
437 6, "L4=RD=Sb=", /* 0x36 */
438 7, "L4=RD=Sb=", /* 0x37 */
439 8, "L4=RD=Sb=", /* 0x38 */
440 9, "L4=RD=Sb=", /* 0x39 */
441 0, "L4=RD8<b+=Sb=",/* 0x3a */
442 1, "L4=RD8<b+=Sb=",/* 0x3b */
443 0, "L4=RD8<b+=Sd=",/* 0x3c */
444 1, "L4=RD8<b+=Sd=",/* 0x3d */
449 0, "L4=RD=Sb=", /* 0x40 */
450 1, "L4=RD=Sb=", /* 0x41 */
451 2, "L4=RD=Sb=", /* 0x42 */
452 3, "L4=RD=Sb=", /* 0x43 */
453 4, "L4=RD=Sb=", /* 0x44 */
454 5, "L4=RD=Sb=", /* 0x45 */
455 6, "L4=RD=Sb=", /* 0x46 */
456 7, "L4=RD=Sb=", /* 0x47 */
457 8, "L4=RD=Sb=", /* 0x48 */
458 9, "L4=RD=Sb=", /* 0x49 */
459 0, "L4=RD8<b+=Sb=",/* 0x4a */
460 1, "L4=RD8<b+=Sb=",/* 0x4b */
461 0, "L4=RD8<b+=Sd=",/* 0x4c */
462 1, "L4=RD8<b+=Sd=",/* 0x4d */
467 0, "L4=SD=", /* 0x50 */
468 1, "L4=SD=", /* 0x51 */
469 2, "L4=SD=", /* 0x52 */
470 3, "L4=SD=", /* 0x53 */
471 4, "L4=SD=", /* 0x54 */
472 5, "L4=SD=", /* 0x55 */
473 6, "L4=SD=", /* 0x56 */
474 7, "L4=SD=", /* 0x57 */
475 8, "L4=SD=", /* 0x58 */
476 9, "L4=SD=", /* 0x59 */
477 10, "L4=SD=", /* 0x5a */
478 11, "L4=SD=", /* 0x5b */
479 12, "L4=SD=", /* 0x5c */
480 13, "L4=SD=", /* 0x5d */
481 14, "L4=SD=", /* 0x5e */
482 15, "L4=SD=", /* 0x5f */
483 16, "L4=SD=", /* 0x60 */
484 17, "L4=SD=", /* 0x61 */
485 18, "L4=SD=", /* 0x62 */
486 19, "L4=SD=", /* 0x63 */
487 20, "L4=SD=", /* 0x64 */
488 21, "L4=SD=", /* 0x65 */
489 22, "L4=SD=", /* 0x66 */
490 23, "L4=SD=", /* 0x67 */
491 24, "L4=SD=", /* 0x68 */
492 25, "L4=SD=", /* 0x69 */
493 26, "L4=SD=", /* 0x6a */
494 27, "L4=SD=", /* 0x6b */
495 28, "L4=SD=", /* 0x6c */
496 29, "L4=SD=", /* 0x6d */
497 30, "L4=SD=", /* 0x6e */
498 31, "L4=SD=", /* 0x6f */
499 32, "L4=Sb=", /* 0x70 */
500 33, "L4=Sd=", /* 0x71 */
509 0, "L4=Sb=", /* 0x78 */
510 1, "L4=Sd=", /* 0x79 */
518 /* R_CODE_ONE_SYMBOL */
519 0, "L4=SD=", /* 0x80 */
520 1, "L4=SD=", /* 0x81 */
521 2, "L4=SD=", /* 0x82 */
522 3, "L4=SD=", /* 0x83 */
523 4, "L4=SD=", /* 0x84 */
524 5, "L4=SD=", /* 0x85 */
525 6, "L4=SD=", /* 0x86 */
526 7, "L4=SD=", /* 0x87 */
527 8, "L4=SD=", /* 0x88 */
528 9, "L4=SD=", /* 0x89 */
529 10, "L4=SD=", /* 0x8q */
530 11, "L4=SD=", /* 0x8b */
531 12, "L4=SD=", /* 0x8c */
532 13, "L4=SD=", /* 0x8d */
533 14, "L4=SD=", /* 0x8e */
534 15, "L4=SD=", /* 0x8f */
535 16, "L4=SD=", /* 0x90 */
536 17, "L4=SD=", /* 0x91 */
537 18, "L4=SD=", /* 0x92 */
538 19, "L4=SD=", /* 0x93 */
539 20, "L4=SD=", /* 0x94 */
540 21, "L4=SD=", /* 0x95 */
541 22, "L4=SD=", /* 0x96 */
542 23, "L4=SD=", /* 0x97 */
543 24, "L4=SD=", /* 0x98 */
544 25, "L4=SD=", /* 0x99 */
545 26, "L4=SD=", /* 0x9a */
546 27, "L4=SD=", /* 0x9b */
547 28, "L4=SD=", /* 0x9c */
548 29, "L4=SD=", /* 0x9d */
549 30, "L4=SD=", /* 0x9e */
550 31, "L4=SD=", /* 0x9f */
551 32, "L4=Sb=", /* 0xa0 */
552 33, "L4=Sd=", /* 0xa1 */
567 0, "L4=Sb=", /* 0xae */
568 1, "L4=Sd=", /* 0xaf */
570 0, "L4=Sb=", /* 0xb0 */
571 1, "L4=Sd=", /* 0xb1 */
575 0, "Te=Ue=", /* 0xb3 */
585 1, "Rb4*=", /* 0xb9 */
586 2, "Rd4*=", /* 0xba */
613 /* R_DATA_OVERRIDE */
626 0, "Ob=Sd=", /* 0xd1 */
628 0, "Ob=Ve=", /* 0xd2 */
678 static const int comp1_opcodes[] =
700 static const int comp2_opcodes[] =
709 static const int comp3_opcodes[] =
716 /* These apparently are not in older versions of hpux reloc.h. */
718 #define R_DLT_REL 0x78
722 #define R_AUX_UNWIND 0xcf
726 #define R_SEC_STMT 0xd7
729 static reloc_howto_type som_hppa_howto_table[] =
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_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
734 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
735 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
736 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
737 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
738 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
739 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
740 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
741 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
742 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
743 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
744 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
745 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
746 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
747 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
748 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
749 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
750 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
751 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
752 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
753 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
754 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
755 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
756 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
757 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
758 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
759 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
760 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
761 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
762 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
763 {R_ZEROES, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ZEROES"},
764 {R_ZEROES, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ZEROES"},
765 {R_UNINIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_UNINIT"},
766 {R_UNINIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_UNINIT"},
767 {R_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RELOCATION"},
768 {R_DATA_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_ONE_SYMBOL"},
769 {R_DATA_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_ONE_SYMBOL"},
770 {R_DATA_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_PLABEL"},
771 {R_DATA_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_PLABEL"},
772 {R_SPACE_REF, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_SPACE_REF"},
773 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
774 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
775 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
776 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
777 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
778 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
779 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
780 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
781 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
782 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
783 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
784 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
785 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
786 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
787 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
788 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
789 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
790 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
791 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
792 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
793 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
794 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
795 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
796 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
797 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
798 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
799 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
800 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
801 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
802 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
803 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
804 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
805 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
806 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
807 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
808 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
809 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
810 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
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_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
817 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
818 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
819 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
820 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
821 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
822 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
823 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
824 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
825 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
826 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
827 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
828 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
829 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
830 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
831 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
832 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
833 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
834 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
835 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
836 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
837 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
838 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
839 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
840 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
841 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
842 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
843 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
844 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
845 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
846 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
847 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
848 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
849 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
850 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
851 {R_DLT_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DLT_REL"},
852 {R_DLT_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DLT_REL"},
853 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
854 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
855 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
856 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
857 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
858 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
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_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
865 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
866 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
867 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
868 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
869 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
870 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
871 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
872 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
873 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
874 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
875 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
876 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
877 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
878 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
879 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
880 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
881 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
882 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
883 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
884 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
885 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
886 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
887 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
888 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
889 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
890 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
891 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
892 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
893 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
894 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
895 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
896 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
897 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
898 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
899 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
900 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
901 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
902 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
903 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
904 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
905 {R_MILLI_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_MILLI_REL"},
906 {R_MILLI_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_MILLI_REL"},
907 {R_CODE_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_PLABEL"},
908 {R_CODE_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_PLABEL"},
909 {R_BREAKPOINT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BREAKPOINT"},
910 {R_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ENTRY"},
911 {R_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ENTRY"},
912 {R_ALT_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ALT_ENTRY"},
913 {R_EXIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_EXIT"},
914 {R_BEGIN_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BEGIN_TRY"},
915 {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_TRY"},
916 {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_TRY"},
917 {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_TRY"},
918 {R_BEGIN_BRTAB, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BEGIN_BRTAB"},
919 {R_END_BRTAB, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_BRTAB"},
920 {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"},
921 {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"},
922 {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"},
923 {R_DATA_EXPR, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_EXPR"},
924 {R_CODE_EXPR, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_EXPR"},
925 {R_FSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_FSEL"},
926 {R_LSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_LSEL"},
927 {R_RSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RSEL"},
928 {R_N_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_N_MODE"},
929 {R_S_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_S_MODE"},
930 {R_D_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_D_MODE"},
931 {R_R_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_R_MODE"},
932 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
933 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
934 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
935 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
936 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
937 {R_TRANSLATED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_TRANSLATED"},
938 {R_AUX_UNWIND, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_AUX_UNWIND"},
939 {R_COMP1, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP1"},
940 {R_COMP2, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP2"},
941 {R_COMP3, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP3"},
942 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
943 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
944 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
945 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
946 {R_SEC_STMT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_SEC_STMT"},
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 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
958 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
959 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
960 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
961 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
962 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
963 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
964 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
965 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
966 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
967 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
968 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
969 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
970 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
971 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
972 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
973 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
974 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
975 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
976 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
977 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
978 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
979 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
980 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
981 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
982 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
983 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
984 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
985 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
986 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}};
988 /* Initialize the SOM relocation queue. By definition the queue holds
989 the last four multibyte fixups. */
992 som_initialize_reloc_queue (queue)
993 struct reloc_queue *queue;
995 queue[0].reloc = NULL;
997 queue[1].reloc = NULL;
999 queue[2].reloc = NULL;
1001 queue[3].reloc = NULL;
1005 /* Insert a new relocation into the relocation queue. */
1008 som_reloc_queue_insert (p, size, queue)
1011 struct reloc_queue *queue;
1013 queue[3].reloc = queue[2].reloc;
1014 queue[3].size = queue[2].size;
1015 queue[2].reloc = queue[1].reloc;
1016 queue[2].size = queue[1].size;
1017 queue[1].reloc = queue[0].reloc;
1018 queue[1].size = queue[0].size;
1020 queue[0].size = size;
1023 /* When an entry in the relocation queue is reused, the entry moves
1024 to the front of the queue. */
1027 som_reloc_queue_fix (queue, index)
1028 struct reloc_queue *queue;
1036 unsigned char *tmp1 = queue[0].reloc;
1037 unsigned int tmp2 = queue[0].size;
1038 queue[0].reloc = queue[1].reloc;
1039 queue[0].size = queue[1].size;
1040 queue[1].reloc = tmp1;
1041 queue[1].size = tmp2;
1047 unsigned char *tmp1 = queue[0].reloc;
1048 unsigned int tmp2 = queue[0].size;
1049 queue[0].reloc = queue[2].reloc;
1050 queue[0].size = queue[2].size;
1051 queue[2].reloc = queue[1].reloc;
1052 queue[2].size = queue[1].size;
1053 queue[1].reloc = tmp1;
1054 queue[1].size = tmp2;
1060 unsigned char *tmp1 = queue[0].reloc;
1061 unsigned int tmp2 = queue[0].size;
1062 queue[0].reloc = queue[3].reloc;
1063 queue[0].size = queue[3].size;
1064 queue[3].reloc = queue[2].reloc;
1065 queue[3].size = queue[2].size;
1066 queue[2].reloc = queue[1].reloc;
1067 queue[2].size = queue[1].size;
1068 queue[1].reloc = tmp1;
1069 queue[1].size = tmp2;
1075 /* Search for a particular relocation in the relocation queue. */
1078 som_reloc_queue_find (p, size, queue)
1081 struct reloc_queue *queue;
1083 if (queue[0].reloc && !memcmp (p, queue[0].reloc, size)
1084 && size == queue[0].size)
1086 if (queue[1].reloc && !memcmp (p, queue[1].reloc, size)
1087 && size == queue[1].size)
1089 if (queue[2].reloc && !memcmp (p, queue[2].reloc, size)
1090 && size == queue[2].size)
1092 if (queue[3].reloc && !memcmp (p, queue[3].reloc, size)
1093 && size == queue[3].size)
1098 static unsigned char *
1099 try_prev_fixup (abfd, subspace_reloc_sizep, p, size, queue)
1101 int *subspace_reloc_sizep;
1104 struct reloc_queue *queue;
1106 int queue_index = som_reloc_queue_find (p, size, queue);
1108 if (queue_index != -1)
1110 /* Found this in a previous fixup. Undo the fixup we
1111 just built and use R_PREV_FIXUP instead. We saved
1112 a total of size - 1 bytes in the fixup stream. */
1113 bfd_put_8 (abfd, R_PREV_FIXUP + queue_index, p);
1115 *subspace_reloc_sizep += 1;
1116 som_reloc_queue_fix (queue, queue_index);
1120 som_reloc_queue_insert (p, size, queue);
1121 *subspace_reloc_sizep += size;
1127 /* Emit the proper R_NO_RELOCATION fixups to map the next SKIP
1128 bytes without any relocation. Update the size of the subspace
1129 relocation stream via SUBSPACE_RELOC_SIZE_P; also return the
1130 current pointer into the relocation stream. */
1132 static unsigned char *
1133 som_reloc_skip (abfd, skip, p, subspace_reloc_sizep, queue)
1137 unsigned int *subspace_reloc_sizep;
1138 struct reloc_queue *queue;
1140 /* Use a 4 byte R_NO_RELOCATION entry with a maximal value
1141 then R_PREV_FIXUPs to get the difference down to a
1143 if (skip >= 0x1000000)
1146 bfd_put_8 (abfd, R_NO_RELOCATION + 31, p);
1147 bfd_put_8 (abfd, 0xff, p + 1);
1148 bfd_put_16 (abfd, 0xffff, p + 2);
1149 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue);
1150 while (skip >= 0x1000000)
1153 bfd_put_8 (abfd, R_PREV_FIXUP, p);
1155 *subspace_reloc_sizep += 1;
1156 /* No need to adjust queue here since we are repeating the
1157 most recent fixup. */
1161 /* The difference must be less than 0x1000000. Use one
1162 more R_NO_RELOCATION entry to get to the right difference. */
1163 if ((skip & 3) == 0 && skip <= 0xc0000 && skip > 0)
1165 /* Difference can be handled in a simple single-byte
1166 R_NO_RELOCATION entry. */
1169 bfd_put_8 (abfd, R_NO_RELOCATION + (skip >> 2) - 1, p);
1170 *subspace_reloc_sizep += 1;
1173 /* Handle it with a two byte R_NO_RELOCATION entry. */
1174 else if (skip <= 0x1000)
1176 bfd_put_8 (abfd, R_NO_RELOCATION + 24 + (((skip >> 2) - 1) >> 8), p);
1177 bfd_put_8 (abfd, (skip >> 2) - 1, p + 1);
1178 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1180 /* Handle it with a three byte R_NO_RELOCATION entry. */
1183 bfd_put_8 (abfd, R_NO_RELOCATION + 28 + (((skip >> 2) - 1) >> 16), p);
1184 bfd_put_16 (abfd, (skip >> 2) - 1, p + 1);
1185 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue);
1188 /* Ugh. Punt and use a 4 byte entry. */
1191 bfd_put_8 (abfd, R_NO_RELOCATION + 31, p);
1192 bfd_put_8 (abfd, (skip - 1) >> 16, p + 1);
1193 bfd_put_16 (abfd, skip - 1, p + 2);
1194 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue);
1199 /* Emit the proper R_DATA_OVERRIDE fixups to handle a nonzero addend
1200 from a BFD relocation. Update the size of the subspace relocation
1201 stream via SUBSPACE_RELOC_SIZE_P; also return the current pointer
1202 into the relocation stream. */
1204 static unsigned char *
1205 som_reloc_addend (abfd, addend, p, subspace_reloc_sizep, queue)
1209 unsigned int *subspace_reloc_sizep;
1210 struct reloc_queue *queue;
1212 if ((unsigned)(addend) + 0x80 < 0x100)
1214 bfd_put_8 (abfd, R_DATA_OVERRIDE + 1, p);
1215 bfd_put_8 (abfd, addend, p + 1);
1216 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1218 else if ((unsigned) (addend) + 0x8000 < 0x10000)
1220 bfd_put_8 (abfd, R_DATA_OVERRIDE + 2, p);
1221 bfd_put_16 (abfd, addend, p + 1);
1222 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue);
1224 else if ((unsigned) (addend) + 0x800000 < 0x1000000)
1226 bfd_put_8 (abfd, R_DATA_OVERRIDE + 3, p);
1227 bfd_put_8 (abfd, addend >> 16, p + 1);
1228 bfd_put_16 (abfd, addend, p + 2);
1229 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue);
1233 bfd_put_8 (abfd, R_DATA_OVERRIDE + 4, p);
1234 bfd_put_32 (abfd, addend, p + 1);
1235 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 5, queue);
1240 /* Handle a single function call relocation. */
1242 static unsigned char *
1243 som_reloc_call (abfd, p, subspace_reloc_sizep, bfd_reloc, sym_num, queue)
1246 unsigned int *subspace_reloc_sizep;
1249 struct reloc_queue *queue;
1251 int arg_bits = HPPA_R_ARG_RELOC (bfd_reloc->addend);
1252 int rtn_bits = arg_bits & 0x3;
1255 /* You'll never believe all this is necessary to handle relocations
1256 for function calls. Having to compute and pack the argument
1257 relocation bits is the real nightmare.
1259 If you're interested in how this works, just forget it. You really
1260 do not want to know about this braindamage. */
1262 /* First see if this can be done with a "simple" relocation. Simple
1263 relocations have a symbol number < 0x100 and have simple encodings
1264 of argument relocations. */
1266 if (sym_num < 0x100)
1278 case 1 << 8 | 1 << 6:
1279 case 1 << 8 | 1 << 6 | 1:
1282 case 1 << 8 | 1 << 6 | 1 << 4:
1283 case 1 << 8 | 1 << 6 | 1 << 4 | 1:
1286 case 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2:
1287 case 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2 | 1:
1291 /* Not one of the easy encodings. This will have to be
1292 handled by the more complex code below. */
1298 /* Account for the return value too. */
1302 /* Emit a 2 byte relocation. Then see if it can be handled
1303 with a relocation which is already in the relocation queue. */
1304 bfd_put_8 (abfd, bfd_reloc->howto->type + type, p);
1305 bfd_put_8 (abfd, sym_num, p + 1);
1306 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1311 /* If this could not be handled with a simple relocation, then do a hard
1312 one. Hard relocations occur if the symbol number was too high or if
1313 the encoding of argument relocation bits is too complex. */
1316 /* Don't ask about these magic sequences. I took them straight
1317 from gas-1.36 which took them from the a.out man page. */
1319 if ((arg_bits >> 6 & 0xf) == 0xe)
1322 type += (3 * (arg_bits >> 8 & 3) + (arg_bits >> 6 & 3)) * 40;
1323 if ((arg_bits >> 2 & 0xf) == 0xe)
1326 type += (3 * (arg_bits >> 4 & 3) + (arg_bits >> 2 & 3)) * 4;
1328 /* Output the first two bytes of the relocation. These describe
1329 the length of the relocation and encoding style. */
1330 bfd_put_8 (abfd, bfd_reloc->howto->type + 10
1331 + 2 * (sym_num >= 0x100) + (type >= 0x100),
1333 bfd_put_8 (abfd, type, p + 1);
1335 /* Now output the symbol index and see if this bizarre relocation
1336 just happened to be in the relocation queue. */
1337 if (sym_num < 0x100)
1339 bfd_put_8 (abfd, sym_num, p + 2);
1340 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue);
1344 bfd_put_8 (abfd, sym_num >> 16, p + 2);
1345 bfd_put_16 (abfd, sym_num, p + 3);
1346 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 5, queue);
1353 /* Return the logarithm of X, base 2, considering X unsigned.
1354 Abort -1 if X is not a power or two or is zero. */
1362 /* Test for 0 or a power of 2. */
1363 if (x == 0 || x != (x & -x))
1366 while ((x >>= 1) != 0)
1371 static bfd_reloc_status_type
1372 hppa_som_reloc (abfd, reloc_entry, symbol_in, data,
1373 input_section, output_bfd, error_message)
1375 arelent *reloc_entry;
1378 asection *input_section;
1380 char **error_message;
1384 reloc_entry->address += input_section->output_offset;
1385 return bfd_reloc_ok;
1387 return bfd_reloc_ok;
1390 /* Given a generic HPPA relocation type, the instruction format,
1391 and a field selector, return one or more appropriate SOM relocations. */
1394 hppa_som_gen_reloc_type (abfd, base_type, format, field)
1398 enum hppa_reloc_field_selector_type_alt field;
1400 int *final_type, **final_types;
1402 final_types = (int **) bfd_alloc_by_size_t (abfd, sizeof (int *) * 3);
1403 final_type = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1404 if (!final_types || !final_type)
1406 bfd_set_error (bfd_error_no_memory);
1410 /* The field selector may require additional relocations to be
1411 generated. It's impossible to know at this moment if additional
1412 relocations will be needed, so we make them. The code to actually
1413 write the relocation/fixup stream is responsible for removing
1414 any redundant relocations. */
1421 final_types[0] = final_type;
1422 final_types[1] = NULL;
1423 final_types[2] = NULL;
1424 *final_type = base_type;
1430 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1431 if (!final_types[0])
1433 bfd_set_error (bfd_error_no_memory);
1436 if (field == e_tsel)
1437 *final_types[0] = R_FSEL;
1438 else if (field == e_ltsel)
1439 *final_types[0] = R_LSEL;
1441 *final_types[0] = R_RSEL;
1442 final_types[1] = final_type;
1443 final_types[2] = NULL;
1444 *final_type = base_type;
1449 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1450 if (!final_types[0])
1452 bfd_set_error (bfd_error_no_memory);
1455 *final_types[0] = R_S_MODE;
1456 final_types[1] = final_type;
1457 final_types[2] = NULL;
1458 *final_type = base_type;
1463 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1464 if (!final_types[0])
1466 bfd_set_error (bfd_error_no_memory);
1469 *final_types[0] = R_N_MODE;
1470 final_types[1] = final_type;
1471 final_types[2] = NULL;
1472 *final_type = base_type;
1477 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1478 if (!final_types[0])
1480 bfd_set_error (bfd_error_no_memory);
1483 *final_types[0] = R_D_MODE;
1484 final_types[1] = final_type;
1485 final_types[2] = NULL;
1486 *final_type = base_type;
1491 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1492 if (!final_types[0])
1494 bfd_set_error (bfd_error_no_memory);
1497 *final_types[0] = R_R_MODE;
1498 final_types[1] = final_type;
1499 final_types[2] = NULL;
1500 *final_type = base_type;
1507 /* PLABELs get their own relocation type. */
1510 || field == e_rpsel)
1512 /* A PLABEL relocation that has a size of 32 bits must
1513 be a R_DATA_PLABEL. All others are R_CODE_PLABELs. */
1515 *final_type = R_DATA_PLABEL;
1517 *final_type = R_CODE_PLABEL;
1520 else if (field == e_tsel
1522 || field == e_rtsel)
1523 *final_type = R_DLT_REL;
1524 /* A relocation in the data space is always a full 32bits. */
1525 else if (format == 32)
1526 *final_type = R_DATA_ONE_SYMBOL;
1531 /* More PLABEL special cases. */
1534 || field == e_rpsel)
1535 *final_type = R_DATA_PLABEL;
1539 case R_HPPA_ABS_CALL:
1540 case R_HPPA_PCREL_CALL:
1541 /* Right now we can default all these. */
1547 /* Return the address of the correct entry in the PA SOM relocation
1551 static reloc_howto_type *
1552 som_bfd_reloc_type_lookup (abfd, code)
1554 bfd_reloc_code_real_type code;
1556 if ((int) code < (int) R_NO_RELOCATION + 255)
1558 BFD_ASSERT ((int) som_hppa_howto_table[(int) code].type == (int) code);
1559 return &som_hppa_howto_table[(int) code];
1562 return (reloc_howto_type *) 0;
1565 /* Perform some initialization for an object. Save results of this
1566 initialization in the BFD. */
1568 static const bfd_target *
1569 som_object_setup (abfd, file_hdrp, aux_hdrp)
1571 struct header *file_hdrp;
1572 struct som_exec_auxhdr *aux_hdrp;
1574 /* som_mkobject will set bfd_error if som_mkobject fails. */
1575 if (som_mkobject (abfd) != true)
1578 /* Set BFD flags based on what information is available in the SOM. */
1579 abfd->flags = NO_FLAGS;
1580 if (file_hdrp->symbol_total)
1581 abfd->flags |= HAS_LINENO | HAS_DEBUG | HAS_SYMS | HAS_LOCALS;
1583 switch (file_hdrp->a_magic)
1586 abfd->flags |= (D_PAGED | WP_TEXT | EXEC_P);
1589 abfd->flags |= (WP_TEXT | EXEC_P);
1592 abfd->flags |= (EXEC_P);
1595 abfd->flags |= HAS_RELOC;
1603 abfd->flags |= DYNAMIC;
1610 /* Allocate space to hold the saved exec header information. */
1611 obj_som_exec_data (abfd) = (struct som_exec_data *)
1612 bfd_zalloc (abfd, sizeof (struct som_exec_data ));
1613 if (obj_som_exec_data (abfd) == NULL)
1615 bfd_set_error (bfd_error_no_memory);
1619 /* The braindamaged OSF1 linker switched exec_flags and exec_entry!
1621 We used to identify OSF1 binaries based on NEW_VERSION_ID, but
1622 apparently the latest HPUX linker is using NEW_VERSION_ID now.
1624 It's about time, OSF has used the new id since at least 1992;
1625 HPUX didn't start till nearly 1995!.
1627 The new approach examines the entry field. If it's zero or not 4
1628 byte aligned then it's not a proper code address and we guess it's
1629 really the executable flags. */
1630 if (aux_hdrp->exec_entry == 0 || (aux_hdrp->exec_entry & 0x3) != 0)
1632 bfd_get_start_address (abfd) = aux_hdrp->exec_flags;
1633 obj_som_exec_data (abfd)->exec_flags = aux_hdrp->exec_entry;
1637 bfd_get_start_address (abfd) = aux_hdrp->exec_entry;
1638 obj_som_exec_data (abfd)->exec_flags = aux_hdrp->exec_flags;
1641 bfd_default_set_arch_mach (abfd, bfd_arch_hppa, 0);
1642 bfd_get_symcount (abfd) = file_hdrp->symbol_total;
1644 /* Initialize the saved symbol table and string table to NULL.
1645 Save important offsets and sizes from the SOM header into
1647 obj_som_stringtab (abfd) = (char *) NULL;
1648 obj_som_symtab (abfd) = (som_symbol_type *) NULL;
1649 obj_som_sorted_syms (abfd) = NULL;
1650 obj_som_stringtab_size (abfd) = file_hdrp->symbol_strings_size;
1651 obj_som_sym_filepos (abfd) = file_hdrp->symbol_location;
1652 obj_som_str_filepos (abfd) = file_hdrp->symbol_strings_location;
1653 obj_som_reloc_filepos (abfd) = file_hdrp->fixup_request_location;
1654 obj_som_exec_data (abfd)->system_id = file_hdrp->system_id;
1659 /* Convert all of the space and subspace info into BFD sections. Each space
1660 contains a number of subspaces, which in turn describe the mapping between
1661 regions of the exec file, and the address space that the program runs in.
1662 BFD sections which correspond to spaces will overlap the sections for the
1663 associated subspaces. */
1666 setup_sections (abfd, file_hdr)
1668 struct header *file_hdr;
1670 char *space_strings;
1672 unsigned int total_subspaces = 0;
1674 /* First, read in space names */
1676 space_strings = malloc (file_hdr->space_strings_size);
1677 if (!space_strings && file_hdr->space_strings_size != 0)
1679 bfd_set_error (bfd_error_no_memory);
1683 if (bfd_seek (abfd, file_hdr->space_strings_location, SEEK_SET) < 0)
1685 if (bfd_read (space_strings, 1, file_hdr->space_strings_size, abfd)
1686 != file_hdr->space_strings_size)
1689 /* Loop over all of the space dictionaries, building up sections */
1690 for (space_index = 0; space_index < file_hdr->space_total; space_index++)
1692 struct space_dictionary_record space;
1693 struct subspace_dictionary_record subspace, save_subspace;
1695 asection *space_asect;
1698 /* Read the space dictionary element */
1699 if (bfd_seek (abfd, file_hdr->space_location
1700 + space_index * sizeof space, SEEK_SET) < 0)
1702 if (bfd_read (&space, 1, sizeof space, abfd) != sizeof space)
1705 /* Setup the space name string */
1706 space.name.n_name = space.name.n_strx + space_strings;
1708 /* Make a section out of it */
1709 newname = bfd_alloc (abfd, strlen (space.name.n_name) + 1);
1712 strcpy (newname, space.name.n_name);
1714 space_asect = bfd_make_section_anyway (abfd, newname);
1718 if (space.is_loadable == 0)
1719 space_asect->flags |= SEC_DEBUGGING;
1721 /* Set up all the attributes for the space. */
1722 if (bfd_som_set_section_attributes (space_asect, space.is_defined,
1723 space.is_private, space.sort_key,
1724 space.space_number) == false)
1727 /* Now, read in the first subspace for this space */
1728 if (bfd_seek (abfd, file_hdr->subspace_location
1729 + space.subspace_index * sizeof subspace,
1732 if (bfd_read (&subspace, 1, sizeof subspace, abfd) != sizeof subspace)
1734 /* Seek back to the start of the subspaces for loop below */
1735 if (bfd_seek (abfd, file_hdr->subspace_location
1736 + space.subspace_index * sizeof subspace,
1740 /* Setup the start address and file loc from the first subspace record */
1741 space_asect->vma = subspace.subspace_start;
1742 space_asect->filepos = subspace.file_loc_init_value;
1743 space_asect->alignment_power = log2 (subspace.alignment);
1744 if (space_asect->alignment_power == -1)
1747 /* Initialize save_subspace so we can reliably determine if this
1748 loop placed any useful values into it. */
1749 memset (&save_subspace, 0, sizeof (struct subspace_dictionary_record));
1751 /* Loop over the rest of the subspaces, building up more sections */
1752 for (subspace_index = 0; subspace_index < space.subspace_quantity;
1755 asection *subspace_asect;
1757 /* Read in the next subspace */
1758 if (bfd_read (&subspace, 1, sizeof subspace, abfd)
1762 /* Setup the subspace name string */
1763 subspace.name.n_name = subspace.name.n_strx + space_strings;
1765 newname = bfd_alloc (abfd, strlen (subspace.name.n_name) + 1);
1768 strcpy (newname, subspace.name.n_name);
1770 /* Make a section out of this subspace */
1771 subspace_asect = bfd_make_section_anyway (abfd, newname);
1772 if (!subspace_asect)
1775 /* Store private information about the section. */
1776 if (bfd_som_set_subsection_attributes (subspace_asect, space_asect,
1777 subspace.access_control_bits,
1779 subspace.quadrant) == false)
1782 /* Keep an easy mapping between subspaces and sections. */
1783 subspace_asect->target_index = total_subspaces++;
1785 /* Set SEC_READONLY and SEC_CODE/SEC_DATA as specified
1786 by the access_control_bits in the subspace header. */
1787 switch (subspace.access_control_bits >> 4)
1789 /* Readonly data. */
1791 subspace_asect->flags |= SEC_DATA | SEC_READONLY;
1796 subspace_asect->flags |= SEC_DATA;
1799 /* Readonly code and the gateways.
1800 Gateways have other attributes which do not map
1801 into anything BFD knows about. */
1807 subspace_asect->flags |= SEC_CODE | SEC_READONLY;
1810 /* dynamic (writable) code. */
1812 subspace_asect->flags |= SEC_CODE;
1816 if (subspace.dup_common || subspace.is_common)
1817 subspace_asect->flags |= SEC_IS_COMMON;
1818 else if (subspace.subspace_length > 0)
1819 subspace_asect->flags |= SEC_HAS_CONTENTS;
1821 if (subspace.is_loadable)
1822 subspace_asect->flags |= SEC_ALLOC | SEC_LOAD;
1824 subspace_asect->flags |= SEC_DEBUGGING;
1826 if (subspace.code_only)
1827 subspace_asect->flags |= SEC_CODE;
1829 /* Both file_loc_init_value and initialization_length will
1830 be zero for a BSS like subspace. */
1831 if (subspace.file_loc_init_value == 0
1832 && subspace.initialization_length == 0)
1833 subspace_asect->flags &= ~(SEC_DATA | SEC_LOAD | SEC_HAS_CONTENTS);
1835 /* This subspace has relocations.
1836 The fixup_request_quantity is a byte count for the number of
1837 entries in the relocation stream; it is not the actual number
1838 of relocations in the subspace. */
1839 if (subspace.fixup_request_quantity != 0)
1841 subspace_asect->flags |= SEC_RELOC;
1842 subspace_asect->rel_filepos = subspace.fixup_request_index;
1843 som_section_data (subspace_asect)->reloc_size
1844 = subspace.fixup_request_quantity;
1845 /* We can not determine this yet. When we read in the
1846 relocation table the correct value will be filled in. */
1847 subspace_asect->reloc_count = -1;
1850 /* Update save_subspace if appropriate. */
1851 if (subspace.file_loc_init_value > save_subspace.file_loc_init_value)
1852 save_subspace = subspace;
1854 subspace_asect->vma = subspace.subspace_start;
1855 subspace_asect->_cooked_size = subspace.subspace_length;
1856 subspace_asect->_raw_size = subspace.subspace_length;
1857 subspace_asect->filepos = subspace.file_loc_init_value;
1858 subspace_asect->alignment_power = log2 (subspace.alignment);
1859 if (subspace_asect->alignment_power == -1)
1863 /* Yow! there is no subspace within the space which actually
1864 has initialized information in it; this should never happen
1865 as far as I know. */
1866 if (!save_subspace.file_loc_init_value)
1869 /* Setup the sizes for the space section based upon the info in the
1870 last subspace of the space. */
1871 space_asect->_cooked_size = save_subspace.subspace_start
1872 - space_asect->vma + save_subspace.subspace_length;
1873 space_asect->_raw_size = save_subspace.file_loc_init_value
1874 - space_asect->filepos + save_subspace.initialization_length;
1876 if (space_strings != NULL)
1877 free (space_strings);
1881 if (space_strings != NULL)
1882 free (space_strings);
1886 /* Read in a SOM object and make it into a BFD. */
1888 static const bfd_target *
1892 struct header file_hdr;
1893 struct som_exec_auxhdr aux_hdr;
1895 if (bfd_read ((PTR) & file_hdr, 1, FILE_HDR_SIZE, abfd) != FILE_HDR_SIZE)
1897 if (bfd_get_error () != bfd_error_system_call)
1898 bfd_set_error (bfd_error_wrong_format);
1902 if (!_PA_RISC_ID (file_hdr.system_id))
1904 bfd_set_error (bfd_error_wrong_format);
1908 switch (file_hdr.a_magic)
1923 #ifdef SHARED_MAGIC_CNX
1924 case SHARED_MAGIC_CNX:
1928 bfd_set_error (bfd_error_wrong_format);
1932 if (file_hdr.version_id != VERSION_ID
1933 && file_hdr.version_id != NEW_VERSION_ID)
1935 bfd_set_error (bfd_error_wrong_format);
1939 /* If the aux_header_size field in the file header is zero, then this
1940 object is an incomplete executable (a .o file). Do not try to read
1941 a non-existant auxiliary header. */
1942 memset (&aux_hdr, 0, sizeof (struct som_exec_auxhdr));
1943 if (file_hdr.aux_header_size != 0)
1945 if (bfd_read ((PTR) & aux_hdr, 1, AUX_HDR_SIZE, abfd) != AUX_HDR_SIZE)
1947 if (bfd_get_error () != bfd_error_system_call)
1948 bfd_set_error (bfd_error_wrong_format);
1953 if (!setup_sections (abfd, &file_hdr))
1955 /* setup_sections does not bubble up a bfd error code. */
1956 bfd_set_error (bfd_error_bad_value);
1960 /* This appears to be a valid SOM object. Do some initialization. */
1961 return som_object_setup (abfd, &file_hdr, &aux_hdr);
1964 /* Create a SOM object. */
1970 /* Allocate memory to hold backend information. */
1971 abfd->tdata.som_data = (struct som_data_struct *)
1972 bfd_zalloc (abfd, sizeof (struct som_data_struct));
1973 if (abfd->tdata.som_data == NULL)
1975 bfd_set_error (bfd_error_no_memory);
1981 /* Initialize some information in the file header. This routine makes
1982 not attempt at doing the right thing for a full executable; it
1983 is only meant to handle relocatable objects. */
1986 som_prep_headers (abfd)
1989 struct header *file_hdr;
1992 /* Make and attach a file header to the BFD. */
1993 file_hdr = (struct header *) bfd_zalloc (abfd, sizeof (struct header));
1994 if (file_hdr == NULL)
1997 bfd_set_error (bfd_error_no_memory);
2000 obj_som_file_hdr (abfd) = file_hdr;
2002 if (abfd->flags & (EXEC_P | DYNAMIC))
2005 /* Make and attach an exec header to the BFD. */
2006 obj_som_exec_hdr (abfd) = (struct som_exec_auxhdr *)
2007 bfd_zalloc (abfd, sizeof (struct som_exec_auxhdr));
2008 if (obj_som_exec_hdr (abfd) == NULL)
2010 bfd_set_error (bfd_error_no_memory);
2014 if (abfd->flags & D_PAGED)
2015 file_hdr->a_magic = DEMAND_MAGIC;
2016 else if (abfd->flags & WP_TEXT)
2017 file_hdr->a_magic = SHARE_MAGIC;
2019 else if (abfd->flags & DYNAMIC)
2020 file_hdr->a_magic = SHL_MAGIC;
2023 file_hdr->a_magic = EXEC_MAGIC;
2026 file_hdr->a_magic = RELOC_MAGIC;
2028 /* Only new format SOM is supported. */
2029 file_hdr->version_id = NEW_VERSION_ID;
2031 /* These fields are optional, and embedding timestamps is not always
2032 a wise thing to do, it makes comparing objects during a multi-stage
2033 bootstrap difficult. */
2034 file_hdr->file_time.secs = 0;
2035 file_hdr->file_time.nanosecs = 0;
2037 file_hdr->entry_space = 0;
2038 file_hdr->entry_subspace = 0;
2039 file_hdr->entry_offset = 0;
2040 file_hdr->presumed_dp = 0;
2042 /* Now iterate over the sections translating information from
2043 BFD sections to SOM spaces/subspaces. */
2045 for (section = abfd->sections; section != NULL; section = section->next)
2047 /* Ignore anything which has not been marked as a space or
2049 if (!som_is_space (section) && !som_is_subspace (section))
2052 if (som_is_space (section))
2054 /* Allocate space for the space dictionary. */
2055 som_section_data (section)->space_dict
2056 = (struct space_dictionary_record *)
2057 bfd_zalloc (abfd, sizeof (struct space_dictionary_record));
2058 if (som_section_data (section)->space_dict == NULL)
2060 bfd_set_error (bfd_error_no_memory);
2063 /* Set space attributes. Note most attributes of SOM spaces
2064 are set based on the subspaces it contains. */
2065 som_section_data (section)->space_dict->loader_fix_index = -1;
2066 som_section_data (section)->space_dict->init_pointer_index = -1;
2068 /* Set more attributes that were stuffed away in private data. */
2069 som_section_data (section)->space_dict->sort_key =
2070 som_section_data (section)->copy_data->sort_key;
2071 som_section_data (section)->space_dict->is_defined =
2072 som_section_data (section)->copy_data->is_defined;
2073 som_section_data (section)->space_dict->is_private =
2074 som_section_data (section)->copy_data->is_private;
2075 som_section_data (section)->space_dict->space_number =
2076 som_section_data (section)->copy_data->space_number;
2080 /* Allocate space for the subspace dictionary. */
2081 som_section_data (section)->subspace_dict
2082 = (struct subspace_dictionary_record *)
2083 bfd_zalloc (abfd, sizeof (struct subspace_dictionary_record));
2084 if (som_section_data (section)->subspace_dict == NULL)
2086 bfd_set_error (bfd_error_no_memory);
2090 /* Set subspace attributes. Basic stuff is done here, additional
2091 attributes are filled in later as more information becomes
2093 if (section->flags & SEC_IS_COMMON)
2095 som_section_data (section)->subspace_dict->dup_common = 1;
2096 som_section_data (section)->subspace_dict->is_common = 1;
2099 if (section->flags & SEC_ALLOC)
2100 som_section_data (section)->subspace_dict->is_loadable = 1;
2102 if (section->flags & SEC_CODE)
2103 som_section_data (section)->subspace_dict->code_only = 1;
2105 som_section_data (section)->subspace_dict->subspace_start =
2107 som_section_data (section)->subspace_dict->subspace_length =
2108 bfd_section_size (abfd, section);
2109 som_section_data (section)->subspace_dict->initialization_length =
2110 bfd_section_size (abfd, section);
2111 som_section_data (section)->subspace_dict->alignment =
2112 1 << section->alignment_power;
2114 /* Set more attributes that were stuffed away in private data. */
2115 som_section_data (section)->subspace_dict->sort_key =
2116 som_section_data (section)->copy_data->sort_key;
2117 som_section_data (section)->subspace_dict->access_control_bits =
2118 som_section_data (section)->copy_data->access_control_bits;
2119 som_section_data (section)->subspace_dict->quadrant =
2120 som_section_data (section)->copy_data->quadrant;
2126 /* Return true if the given section is a SOM space, false otherwise. */
2129 som_is_space (section)
2132 /* If no copy data is available, then it's neither a space nor a
2134 if (som_section_data (section)->copy_data == NULL)
2137 /* If the containing space isn't the same as the given section,
2138 then this isn't a space. */
2139 if (som_section_data (section)->copy_data->container != section)
2142 /* OK. Must be a space. */
2146 /* Return true if the given section is a SOM subspace, false otherwise. */
2149 som_is_subspace (section)
2152 /* If no copy data is available, then it's neither a space nor a
2154 if (som_section_data (section)->copy_data == NULL)
2157 /* If the containing space is the same as the given section,
2158 then this isn't a subspace. */
2159 if (som_section_data (section)->copy_data->container == section)
2162 /* OK. Must be a subspace. */
2166 /* Return true if the given space containins the given subspace. It
2167 is safe to assume space really is a space, and subspace really
2171 som_is_container (space, subspace)
2172 asection *space, *subspace;
2174 return som_section_data (subspace)->copy_data->container == space;
2177 /* Count and return the number of spaces attached to the given BFD. */
2179 static unsigned long
2180 som_count_spaces (abfd)
2186 for (section = abfd->sections; section != NULL; section = section->next)
2187 count += som_is_space (section);
2192 /* Count the number of subspaces attached to the given BFD. */
2194 static unsigned long
2195 som_count_subspaces (abfd)
2201 for (section = abfd->sections; section != NULL; section = section->next)
2202 count += som_is_subspace (section);
2207 /* Return -1, 0, 1 indicating the relative ordering of sym1 and sym2.
2209 We desire symbols to be ordered starting with the symbol with the
2210 highest relocation count down to the symbol with the lowest relocation
2211 count. Doing so compacts the relocation stream. */
2214 compare_syms (arg1, arg2)
2219 asymbol **sym1 = (asymbol **) arg1;
2220 asymbol **sym2 = (asymbol **) arg2;
2221 unsigned int count1, count2;
2223 /* Get relocation count for each symbol. Note that the count
2224 is stored in the udata pointer for section symbols! */
2225 if ((*sym1)->flags & BSF_SECTION_SYM)
2226 count1 = (*sym1)->udata.i;
2228 count1 = som_symbol_data (*sym1)->reloc_count;
2230 if ((*sym2)->flags & BSF_SECTION_SYM)
2231 count2 = (*sym2)->udata.i;
2233 count2 = som_symbol_data (*sym2)->reloc_count;
2235 /* Return the appropriate value. */
2236 if (count1 < count2)
2238 else if (count1 > count2)
2243 /* Perform various work in preparation for emitting the fixup stream. */
2246 som_prep_for_fixups (abfd, syms, num_syms)
2249 unsigned long num_syms;
2253 asymbol **sorted_syms;
2255 /* Most SOM relocations involving a symbol have a length which is
2256 dependent on the index of the symbol. So symbols which are
2257 used often in relocations should have a small index. */
2259 /* First initialize the counters for each symbol. */
2260 for (i = 0; i < num_syms; i++)
2262 /* Handle a section symbol; these have no pointers back to the
2263 SOM symbol info. So we just use the udata field to hold the
2264 relocation count. */
2265 if (som_symbol_data (syms[i]) == NULL
2266 || syms[i]->flags & BSF_SECTION_SYM)
2268 syms[i]->flags |= BSF_SECTION_SYM;
2269 syms[i]->udata.i = 0;
2272 som_symbol_data (syms[i])->reloc_count = 0;
2275 /* Now that the counters are initialized, make a weighted count
2276 of how often a given symbol is used in a relocation. */
2277 for (section = abfd->sections; section != NULL; section = section->next)
2281 /* Does this section have any relocations? */
2282 if (section->reloc_count <= 0)
2285 /* Walk through each relocation for this section. */
2286 for (i = 1; i < section->reloc_count; i++)
2288 arelent *reloc = section->orelocation[i];
2291 /* A relocation against a symbol in the *ABS* section really
2292 does not have a symbol. Likewise if the symbol isn't associated
2293 with any section. */
2294 if (reloc->sym_ptr_ptr == NULL
2295 || bfd_is_abs_section ((*reloc->sym_ptr_ptr)->section))
2298 /* Scaling to encourage symbols involved in R_DP_RELATIVE
2299 and R_CODE_ONE_SYMBOL relocations to come first. These
2300 two relocations have single byte versions if the symbol
2301 index is very small. */
2302 if (reloc->howto->type == R_DP_RELATIVE
2303 || reloc->howto->type == R_CODE_ONE_SYMBOL)
2308 /* Handle section symbols by storing the count in the udata
2309 field. It will not be used and the count is very important
2310 for these symbols. */
2311 if ((*reloc->sym_ptr_ptr)->flags & BSF_SECTION_SYM)
2313 (*reloc->sym_ptr_ptr)->udata.i =
2314 (*reloc->sym_ptr_ptr)->udata.i + scale;
2318 /* A normal symbol. Increment the count. */
2319 som_symbol_data (*reloc->sym_ptr_ptr)->reloc_count += scale;
2323 /* Sort a copy of the symbol table, rather than the canonical
2324 output symbol table. */
2325 sorted_syms = (asymbol **) bfd_zalloc (abfd, num_syms * sizeof (asymbol *));
2326 memcpy (sorted_syms, syms, num_syms * sizeof (asymbol *));
2327 qsort (sorted_syms, num_syms, sizeof (asymbol *), compare_syms);
2328 obj_som_sorted_syms (abfd) = sorted_syms;
2330 /* Compute the symbol indexes, they will be needed by the relocation
2332 for (i = 0; i < num_syms; i++)
2334 /* A section symbol. Again, there is no pointer to backend symbol
2335 information, so we reuse the udata field again. */
2336 if (sorted_syms[i]->flags & BSF_SECTION_SYM)
2337 sorted_syms[i]->udata.i = i;
2339 som_symbol_data (sorted_syms[i])->index = i;
2344 som_write_fixups (abfd, current_offset, total_reloc_sizep)
2346 unsigned long current_offset;
2347 unsigned int *total_reloc_sizep;
2350 /* Chunk of memory that we can use as buffer space, then throw
2352 unsigned char tmp_space[SOM_TMP_BUFSIZE];
2354 unsigned int total_reloc_size = 0;
2355 unsigned int subspace_reloc_size = 0;
2356 unsigned int num_spaces = obj_som_file_hdr (abfd)->space_total;
2357 asection *section = abfd->sections;
2359 memset (tmp_space, 0, SOM_TMP_BUFSIZE);
2362 /* All the fixups for a particular subspace are emitted in a single
2363 stream. All the subspaces for a particular space are emitted
2366 So, to get all the locations correct one must iterate through all the
2367 spaces, for each space iterate through its subspaces and output a
2369 for (i = 0; i < num_spaces; i++)
2371 asection *subsection;
2374 while (!som_is_space (section))
2375 section = section->next;
2377 /* Now iterate through each of its subspaces. */
2378 for (subsection = abfd->sections;
2380 subsection = subsection->next)
2382 int reloc_offset, current_rounding_mode;
2384 /* Find a subspace of this space. */
2385 if (!som_is_subspace (subsection)
2386 || !som_is_container (section, subsection))
2389 /* If this subspace does not have real data, then we are
2391 if ((subsection->flags & SEC_HAS_CONTENTS) == 0)
2393 som_section_data (subsection)->subspace_dict->fixup_request_index
2398 /* This subspace has some relocations. Put the relocation stream
2399 index into the subspace record. */
2400 som_section_data (subsection)->subspace_dict->fixup_request_index
2403 /* To make life easier start over with a clean slate for
2404 each subspace. Seek to the start of the relocation stream
2405 for this subspace in preparation for writing out its fixup
2407 if (bfd_seek (abfd, current_offset + total_reloc_size, SEEK_SET) < 0)
2410 /* Buffer space has already been allocated. Just perform some
2411 initialization here. */
2413 subspace_reloc_size = 0;
2415 som_initialize_reloc_queue (reloc_queue);
2416 current_rounding_mode = R_N_MODE;
2418 /* Translate each BFD relocation into one or more SOM
2420 for (j = 0; j < subsection->reloc_count; j++)
2422 arelent *bfd_reloc = subsection->orelocation[j];
2426 /* Get the symbol number. Remember it's stored in a
2427 special place for section symbols. */
2428 if ((*bfd_reloc->sym_ptr_ptr)->flags & BSF_SECTION_SYM)
2429 sym_num = (*bfd_reloc->sym_ptr_ptr)->udata.i;
2431 sym_num = som_symbol_data (*bfd_reloc->sym_ptr_ptr)->index;
2433 /* If there is not enough room for the next couple relocations,
2434 then dump the current buffer contents now. Also reinitialize
2435 the relocation queue.
2437 No single BFD relocation could ever translate into more
2438 than 100 bytes of SOM relocations (20bytes is probably the
2439 upper limit, but leave lots of space for growth). */
2440 if (p - tmp_space + 100 > SOM_TMP_BUFSIZE)
2442 if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd)
2447 som_initialize_reloc_queue (reloc_queue);
2450 /* Emit R_NO_RELOCATION fixups to map any bytes which were
2452 skip = bfd_reloc->address - reloc_offset;
2453 p = som_reloc_skip (abfd, skip, p,
2454 &subspace_reloc_size, reloc_queue);
2456 /* Update reloc_offset for the next iteration.
2458 Many relocations do not consume input bytes. They
2459 are markers, or set state necessary to perform some
2460 later relocation. */
2461 switch (bfd_reloc->howto->type)
2463 /* This only needs to handle relocations that may be
2464 made by hppa_som_gen_reloc. */
2475 reloc_offset = bfd_reloc->address;
2479 reloc_offset = bfd_reloc->address + 4;
2483 /* Now the actual relocation we care about. */
2484 switch (bfd_reloc->howto->type)
2488 p = som_reloc_call (abfd, p, &subspace_reloc_size,
2489 bfd_reloc, sym_num, reloc_queue);
2492 case R_CODE_ONE_SYMBOL:
2494 /* Account for any addend. */
2495 if (bfd_reloc->addend)
2496 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
2497 &subspace_reloc_size, reloc_queue);
2501 bfd_put_8 (abfd, bfd_reloc->howto->type + sym_num, p);
2502 subspace_reloc_size += 1;
2505 else if (sym_num < 0x100)
2507 bfd_put_8 (abfd, bfd_reloc->howto->type + 32, p);
2508 bfd_put_8 (abfd, sym_num, p + 1);
2509 p = try_prev_fixup (abfd, &subspace_reloc_size, p,
2512 else if (sym_num < 0x10000000)
2514 bfd_put_8 (abfd, bfd_reloc->howto->type + 33, p);
2515 bfd_put_8 (abfd, sym_num >> 16, p + 1);
2516 bfd_put_16 (abfd, sym_num, p + 2);
2517 p = try_prev_fixup (abfd, &subspace_reloc_size,
2524 case R_DATA_ONE_SYMBOL:
2528 /* Account for any addend. */
2529 if (bfd_reloc->addend)
2530 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
2531 &subspace_reloc_size, reloc_queue);
2533 if (sym_num < 0x100)
2535 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
2536 bfd_put_8 (abfd, sym_num, p + 1);
2537 p = try_prev_fixup (abfd, &subspace_reloc_size, p,
2540 else if (sym_num < 0x10000000)
2542 bfd_put_8 (abfd, bfd_reloc->howto->type + 1, p);
2543 bfd_put_8 (abfd, sym_num >> 16, p + 1);
2544 bfd_put_16 (abfd, sym_num, p + 2);
2545 p = try_prev_fixup (abfd, &subspace_reloc_size,
2555 arelent *tmp_reloc = NULL;
2556 bfd_put_8 (abfd, R_ENTRY, p);
2558 /* R_ENTRY relocations have 64 bits of associated
2559 data. Unfortunately the addend field of a bfd
2560 relocation is only 32 bits. So, we split up
2561 the 64bit unwind information and store part in
2562 the R_ENTRY relocation, and the rest in the R_EXIT
2564 bfd_put_32 (abfd, bfd_reloc->addend, p + 1);
2566 /* Find the next R_EXIT relocation. */
2567 for (tmp = j; tmp < subsection->reloc_count; tmp++)
2569 tmp_reloc = subsection->orelocation[tmp];
2570 if (tmp_reloc->howto->type == R_EXIT)
2574 if (tmp == subsection->reloc_count)
2577 bfd_put_32 (abfd, tmp_reloc->addend, p + 5);
2578 p = try_prev_fixup (abfd, &subspace_reloc_size,
2587 /* If this relocation requests the current rounding
2588 mode, then it is redundant. */
2589 if (bfd_reloc->howto->type != current_rounding_mode)
2591 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
2592 subspace_reloc_size += 1;
2594 current_rounding_mode = bfd_reloc->howto->type;
2603 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
2604 subspace_reloc_size += 1;
2608 /* Put a "R_RESERVED" relocation in the stream if
2609 we hit something we do not understand. The linker
2610 will complain loudly if this ever happens. */
2612 bfd_put_8 (abfd, 0xff, p);
2613 subspace_reloc_size += 1;
2619 /* Last BFD relocation for a subspace has been processed.
2620 Map the rest of the subspace with R_NO_RELOCATION fixups. */
2621 p = som_reloc_skip (abfd, bfd_section_size (abfd, subsection)
2623 p, &subspace_reloc_size, reloc_queue);
2625 /* Scribble out the relocations. */
2626 if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd)
2631 total_reloc_size += subspace_reloc_size;
2632 som_section_data (subsection)->subspace_dict->fixup_request_quantity
2633 = subspace_reloc_size;
2635 section = section->next;
2637 *total_reloc_sizep = total_reloc_size;
2641 /* Write out the space/subspace string table. */
2644 som_write_space_strings (abfd, current_offset, string_sizep)
2646 unsigned long current_offset;
2647 unsigned int *string_sizep;
2649 /* Chunk of memory that we can use as buffer space, then throw
2651 unsigned char tmp_space[SOM_TMP_BUFSIZE];
2653 unsigned int strings_size = 0;
2656 memset (tmp_space, 0, SOM_TMP_BUFSIZE);
2659 /* Seek to the start of the space strings in preparation for writing
2661 if (bfd_seek (abfd, current_offset, SEEK_SET) < 0)
2664 /* Walk through all the spaces and subspaces (order is not important)
2665 building up and writing string table entries for their names. */
2666 for (section = abfd->sections; section != NULL; section = section->next)
2670 /* Only work with space/subspaces; avoid any other sections
2671 which might have been made (.text for example). */
2672 if (!som_is_space (section) && !som_is_subspace (section))
2675 /* Get the length of the space/subspace name. */
2676 length = strlen (section->name);
2678 /* If there is not enough room for the next entry, then dump the
2679 current buffer contents now. Each entry will take 4 bytes to
2680 hold the string length + the string itself + null terminator. */
2681 if (p - tmp_space + 5 + length > SOM_TMP_BUFSIZE)
2683 if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd)
2686 /* Reset to beginning of the buffer space. */
2690 /* First element in a string table entry is the length of the
2691 string. Alignment issues are already handled. */
2692 bfd_put_32 (abfd, length, p);
2696 /* Record the index in the space/subspace records. */
2697 if (som_is_space (section))
2698 som_section_data (section)->space_dict->name.n_strx = strings_size;
2700 som_section_data (section)->subspace_dict->name.n_strx = strings_size;
2702 /* Next comes the string itself + a null terminator. */
2703 strcpy (p, section->name);
2705 strings_size += length + 1;
2707 /* Always align up to the next word boundary. */
2708 while (strings_size % 4)
2710 bfd_put_8 (abfd, 0, p);
2716 /* Done with the space/subspace strings. Write out any information
2717 contained in a partial block. */
2718 if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd) != p - tmp_space)
2720 *string_sizep = strings_size;
2724 /* Write out the symbol string table. */
2727 som_write_symbol_strings (abfd, current_offset, syms, num_syms, string_sizep)
2729 unsigned long current_offset;
2731 unsigned int num_syms;
2732 unsigned int *string_sizep;
2736 /* Chunk of memory that we can use as buffer space, then throw
2738 unsigned char tmp_space[SOM_TMP_BUFSIZE];
2740 unsigned int strings_size = 0;
2742 memset (tmp_space, 0, SOM_TMP_BUFSIZE);
2745 /* Seek to the start of the space strings in preparation for writing
2747 if (bfd_seek (abfd, current_offset, SEEK_SET) < 0)
2750 for (i = 0; i < num_syms; i++)
2752 int length = strlen (syms[i]->name);
2754 /* If there is not enough room for the next entry, then dump the
2755 current buffer contents now. */
2756 if (p - tmp_space + 5 + length > SOM_TMP_BUFSIZE)
2758 if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd)
2761 /* Reset to beginning of the buffer space. */
2765 /* First element in a string table entry is the length of the
2766 string. This must always be 4 byte aligned. This is also
2767 an appropriate time to fill in the string index field in the
2768 symbol table entry. */
2769 bfd_put_32 (abfd, length, p);
2773 /* Next comes the string itself + a null terminator. */
2774 strcpy (p, syms[i]->name);
2776 som_symbol_data(syms[i])->stringtab_offset = strings_size;
2778 strings_size += length + 1;
2780 /* Always align up to the next word boundary. */
2781 while (strings_size % 4)
2783 bfd_put_8 (abfd, 0, p);
2789 /* Scribble out any partial block. */
2790 if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd) != p - tmp_space)
2793 *string_sizep = strings_size;
2797 /* Compute variable information to be placed in the SOM headers,
2798 space/subspace dictionaries, relocation streams, etc. Begin
2799 writing parts of the object file. */
2802 som_begin_writing (abfd)
2805 unsigned long current_offset = 0;
2806 int strings_size = 0;
2807 unsigned int total_reloc_size = 0;
2808 unsigned long num_spaces, num_subspaces, num_syms, i;
2810 asymbol **syms = bfd_get_outsymbols (abfd);
2811 unsigned int total_subspaces = 0;
2812 struct som_exec_auxhdr *exec_header = NULL;
2814 /* The file header will always be first in an object file,
2815 everything else can be in random locations. To keep things
2816 "simple" BFD will lay out the object file in the manner suggested
2817 by the PRO ABI for PA-RISC Systems. */
2819 /* Before any output can really begin offsets for all the major
2820 portions of the object file must be computed. So, starting
2821 with the initial file header compute (and sometimes write)
2822 each portion of the object file. */
2824 /* Make room for the file header, it's contents are not complete
2825 yet, so it can not be written at this time. */
2826 current_offset += sizeof (struct header);
2828 /* Any auxiliary headers will follow the file header. Right now
2829 we support only the copyright and version headers. */
2830 obj_som_file_hdr (abfd)->aux_header_location = current_offset;
2831 obj_som_file_hdr (abfd)->aux_header_size = 0;
2832 if (abfd->flags & (EXEC_P | DYNAMIC))
2834 /* Parts of the exec header will be filled in later, so
2835 delay writing the header itself. Fill in the defaults,
2836 and write it later. */
2837 current_offset += sizeof (struct som_exec_auxhdr);
2838 obj_som_file_hdr (abfd)->aux_header_size
2839 += sizeof (struct som_exec_auxhdr);
2840 exec_header = obj_som_exec_hdr (abfd);
2841 exec_header->som_auxhdr.type = EXEC_AUX_ID;
2842 exec_header->som_auxhdr.length = 40;
2844 if (obj_som_version_hdr (abfd) != NULL)
2848 if (bfd_seek (abfd, current_offset, SEEK_SET) < 0)
2851 /* Write the aux_id structure and the string length. */
2852 len = sizeof (struct aux_id) + sizeof (unsigned int);
2853 obj_som_file_hdr (abfd)->aux_header_size += len;
2854 current_offset += len;
2855 if (bfd_write ((PTR) obj_som_version_hdr (abfd), len, 1, abfd) != len)
2858 /* Write the version string. */
2859 len = obj_som_version_hdr (abfd)->header_id.length - sizeof (int);
2860 obj_som_file_hdr (abfd)->aux_header_size += len;
2861 current_offset += len;
2862 if (bfd_write ((PTR) obj_som_version_hdr (abfd)->user_string,
2863 len, 1, abfd) != len)
2867 if (obj_som_copyright_hdr (abfd) != NULL)
2871 if (bfd_seek (abfd, current_offset, SEEK_SET) < 0)
2874 /* Write the aux_id structure and the string length. */
2875 len = sizeof (struct aux_id) + sizeof (unsigned int);
2876 obj_som_file_hdr (abfd)->aux_header_size += len;
2877 current_offset += len;
2878 if (bfd_write ((PTR) obj_som_copyright_hdr (abfd), len, 1, abfd) != len)
2881 /* Write the copyright string. */
2882 len = obj_som_copyright_hdr (abfd)->header_id.length - sizeof (int);
2883 obj_som_file_hdr (abfd)->aux_header_size += len;
2884 current_offset += len;
2885 if (bfd_write ((PTR) obj_som_copyright_hdr (abfd)->copyright,
2886 len, 1, abfd) != len)
2890 /* Next comes the initialization pointers; we have no initialization
2891 pointers, so current offset does not change. */
2892 obj_som_file_hdr (abfd)->init_array_location = current_offset;
2893 obj_som_file_hdr (abfd)->init_array_total = 0;
2895 /* Next are the space records. These are fixed length records.
2897 Count the number of spaces to determine how much room is needed
2898 in the object file for the space records.
2900 The names of the spaces are stored in a separate string table,
2901 and the index for each space into the string table is computed
2902 below. Therefore, it is not possible to write the space headers
2904 num_spaces = som_count_spaces (abfd);
2905 obj_som_file_hdr (abfd)->space_location = current_offset;
2906 obj_som_file_hdr (abfd)->space_total = num_spaces;
2907 current_offset += num_spaces * sizeof (struct space_dictionary_record);
2909 /* Next are the subspace records. These are fixed length records.
2911 Count the number of subspaes to determine how much room is needed
2912 in the object file for the subspace records.
2914 A variety if fields in the subspace record are still unknown at
2915 this time (index into string table, fixup stream location/size, etc). */
2916 num_subspaces = som_count_subspaces (abfd);
2917 obj_som_file_hdr (abfd)->subspace_location = current_offset;
2918 obj_som_file_hdr (abfd)->subspace_total = num_subspaces;
2919 current_offset += num_subspaces * sizeof (struct subspace_dictionary_record);
2921 /* Next is the string table for the space/subspace names. We will
2922 build and write the string table on the fly. At the same time
2923 we will fill in the space/subspace name index fields. */
2925 /* The string table needs to be aligned on a word boundary. */
2926 if (current_offset % 4)
2927 current_offset += (4 - (current_offset % 4));
2929 /* Mark the offset of the space/subspace string table in the
2931 obj_som_file_hdr (abfd)->space_strings_location = current_offset;
2933 /* Scribble out the space strings. */
2934 if (som_write_space_strings (abfd, current_offset, &strings_size) == false)
2937 /* Record total string table size in the header and update the
2939 obj_som_file_hdr (abfd)->space_strings_size = strings_size;
2940 current_offset += strings_size;
2942 /* Next is the symbol table. These are fixed length records.
2944 Count the number of symbols to determine how much room is needed
2945 in the object file for the symbol table.
2947 The names of the symbols are stored in a separate string table,
2948 and the index for each symbol name into the string table is computed
2949 below. Therefore, it is not possible to write the symobl table
2951 num_syms = bfd_get_symcount (abfd);
2952 obj_som_file_hdr (abfd)->symbol_location = current_offset;
2953 obj_som_file_hdr (abfd)->symbol_total = num_syms;
2954 current_offset += num_syms * sizeof (struct symbol_dictionary_record);
2956 /* Do prep work before handling fixups. */
2957 som_prep_for_fixups (abfd, syms, num_syms);
2959 /* Next comes the fixup stream which starts on a word boundary. */
2960 if (current_offset % 4)
2961 current_offset += (4 - (current_offset % 4));
2962 obj_som_file_hdr (abfd)->fixup_request_location = current_offset;
2964 /* Write the fixups and update fields in subspace headers which
2965 relate to the fixup stream. */
2966 if (som_write_fixups (abfd, current_offset, &total_reloc_size) == false)
2969 /* Record the total size of the fixup stream in the file header. */
2970 obj_som_file_hdr (abfd)->fixup_request_total = total_reloc_size;
2971 current_offset += total_reloc_size;
2973 /* Next are the symbol strings.
2974 Align them to a word boundary. */
2975 if (current_offset % 4)
2976 current_offset += (4 - (current_offset % 4));
2977 obj_som_file_hdr (abfd)->symbol_strings_location = current_offset;
2979 /* Scribble out the symbol strings. */
2980 if (som_write_symbol_strings (abfd, current_offset,
2981 obj_som_sorted_syms (abfd),
2982 num_syms, &strings_size)
2986 /* Record total string table size in header and update the
2988 obj_som_file_hdr (abfd)->symbol_strings_size = strings_size;
2989 current_offset += strings_size;
2991 /* Next is the compiler records. We do not use these. */
2992 obj_som_file_hdr (abfd)->compiler_location = current_offset;
2993 obj_som_file_hdr (abfd)->compiler_total = 0;
2995 /* Now compute the file positions for the loadable subspaces, taking
2996 care to make sure everything stays properly aligned. */
2998 section = abfd->sections;
2999 for (i = 0; i < num_spaces; i++)
3001 asection *subsection;
3003 unsigned int subspace_offset = 0;
3006 while (!som_is_space (section))
3007 section = section->next;
3010 /* Now look for all its subspaces. */
3011 for (subsection = abfd->sections;
3013 subsection = subsection->next)
3016 if (!som_is_subspace (subsection)
3017 || !som_is_container (section, subsection)
3018 || (subsection->flags & SEC_ALLOC) == 0)
3021 /* If this is the first subspace in the space, and we are
3022 building an executable, then take care to make sure all
3023 the alignments are correct and update the exec header. */
3025 && (abfd->flags & (EXEC_P | DYNAMIC)))
3027 /* Demand paged executables have each space aligned to a
3028 page boundary. Sharable executables (write-protected
3029 text) have just the private (aka data & bss) space aligned
3030 to a page boundary. Ugh. Not true for HPUX.
3032 The HPUX kernel requires the text to always be page aligned
3033 within the file regardless of the executable's type. */
3034 if (abfd->flags & (D_PAGED | DYNAMIC)
3035 || (subsection->flags & SEC_CODE)
3036 || ((abfd->flags & WP_TEXT)
3037 && (subsection->flags & SEC_DATA)))
3038 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3040 /* Update the exec header. */
3041 if (subsection->flags & SEC_CODE && exec_header->exec_tfile == 0)
3043 exec_header->exec_tmem = section->vma;
3044 exec_header->exec_tfile = current_offset;
3046 if (subsection->flags & SEC_DATA && exec_header->exec_dfile == 0)
3048 exec_header->exec_dmem = section->vma;
3049 exec_header->exec_dfile = current_offset;
3052 /* Keep track of exactly where we are within a particular
3053 space. This is necessary as the braindamaged HPUX
3054 loader will create holes between subspaces *and*
3055 subspace alignments are *NOT* preserved. What a crock. */
3056 subspace_offset = subsection->vma;
3058 /* Only do this for the first subspace within each space. */
3061 else if (abfd->flags & (EXEC_P | DYNAMIC))
3063 /* The braindamaged HPUX loader may have created a hole
3064 between two subspaces. It is *not* sufficient to use
3065 the alignment specifications within the subspaces to
3066 account for these holes -- I've run into at least one
3067 case where the loader left one code subspace unaligned
3068 in a final executable.
3070 To combat this we keep a current offset within each space,
3071 and use the subspace vma fields to detect and preserve
3072 holes. What a crock!
3074 ps. This is not necessary for unloadable space/subspaces. */
3075 current_offset += subsection->vma - subspace_offset;
3076 if (subsection->flags & SEC_CODE)
3077 exec_header->exec_tsize += subsection->vma - subspace_offset;
3079 exec_header->exec_dsize += subsection->vma - subspace_offset;
3080 subspace_offset += subsection->vma - subspace_offset;
3084 subsection->target_index = total_subspaces++;
3085 /* This is real data to be loaded from the file. */
3086 if (subsection->flags & SEC_LOAD)
3088 /* Update the size of the code & data. */
3089 if (abfd->flags & (EXEC_P | DYNAMIC)
3090 && subsection->flags & SEC_CODE)
3091 exec_header->exec_tsize += subsection->_cooked_size;
3092 else if (abfd->flags & (EXEC_P | DYNAMIC)
3093 && subsection->flags & SEC_DATA)
3094 exec_header->exec_dsize += subsection->_cooked_size;
3095 som_section_data (subsection)->subspace_dict->file_loc_init_value
3097 subsection->filepos = current_offset;
3098 current_offset += bfd_section_size (abfd, subsection);
3099 subspace_offset += bfd_section_size (abfd, subsection);
3101 /* Looks like uninitialized data. */
3104 /* Update the size of the bss section. */
3105 if (abfd->flags & (EXEC_P | DYNAMIC))
3106 exec_header->exec_bsize += subsection->_cooked_size;
3108 som_section_data (subsection)->subspace_dict->file_loc_init_value
3110 som_section_data (subsection)->subspace_dict->
3111 initialization_length = 0;
3114 /* Goto the next section. */
3115 section = section->next;
3118 /* Finally compute the file positions for unloadable subspaces.
3119 If building an executable, start the unloadable stuff on its
3122 if (abfd->flags & (EXEC_P | DYNAMIC))
3123 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3125 obj_som_file_hdr (abfd)->unloadable_sp_location = current_offset;
3126 section = abfd->sections;
3127 for (i = 0; i < num_spaces; i++)
3129 asection *subsection;
3132 while (!som_is_space (section))
3133 section = section->next;
3135 if (abfd->flags & (EXEC_P | DYNAMIC))
3136 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3138 /* Now look for all its subspaces. */
3139 for (subsection = abfd->sections;
3141 subsection = subsection->next)
3144 if (!som_is_subspace (subsection)
3145 || !som_is_container (section, subsection)
3146 || (subsection->flags & SEC_ALLOC) != 0)
3149 subsection->target_index = total_subspaces++;
3150 /* This is real data to be loaded from the file. */
3151 if ((subsection->flags & SEC_LOAD) == 0)
3153 som_section_data (subsection)->subspace_dict->file_loc_init_value
3155 subsection->filepos = current_offset;
3156 current_offset += bfd_section_size (abfd, subsection);
3158 /* Looks like uninitialized data. */
3161 som_section_data (subsection)->subspace_dict->file_loc_init_value
3163 som_section_data (subsection)->subspace_dict->
3164 initialization_length = bfd_section_size (abfd, subsection);
3167 /* Goto the next section. */
3168 section = section->next;
3171 /* If building an executable, then make sure to seek to and write
3172 one byte at the end of the file to make sure any necessary
3173 zeros are filled in. Ugh. */
3174 if (abfd->flags & (EXEC_P | DYNAMIC))
3175 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3176 if (bfd_seek (abfd, current_offset - 1, SEEK_SET) < 0)
3178 if (bfd_write ((PTR) "", 1, 1, abfd) != 1)
3181 obj_som_file_hdr (abfd)->unloadable_sp_size
3182 = current_offset - obj_som_file_hdr (abfd)->unloadable_sp_location;
3184 /* Loader fixups are not supported in any way shape or form. */
3185 obj_som_file_hdr (abfd)->loader_fixup_location = 0;
3186 obj_som_file_hdr (abfd)->loader_fixup_total = 0;
3188 /* Done. Store the total size of the SOM. */
3189 obj_som_file_hdr (abfd)->som_length = current_offset;
3194 /* Finally, scribble out the various headers to the disk. */
3197 som_write_headers (abfd)
3200 int num_spaces = som_count_spaces (abfd);
3202 int subspace_index = 0;
3206 /* Subspaces are written first so that we can set up information
3207 about them in their containing spaces as the subspace is written. */
3209 /* Seek to the start of the subspace dictionary records. */
3210 location = obj_som_file_hdr (abfd)->subspace_location;
3211 if (bfd_seek (abfd, location, SEEK_SET) < 0)
3214 section = abfd->sections;
3215 /* Now for each loadable space write out records for its subspaces. */
3216 for (i = 0; i < num_spaces; i++)
3218 asection *subsection;
3221 while (!som_is_space (section))
3222 section = section->next;
3224 /* Now look for all its subspaces. */
3225 for (subsection = abfd->sections;
3227 subsection = subsection->next)
3230 /* Skip any section which does not correspond to a space
3231 or subspace. Or does not have SEC_ALLOC set (and therefore
3232 has no real bits on the disk). */
3233 if (!som_is_subspace (subsection)
3234 || !som_is_container (section, subsection)
3235 || (subsection->flags & SEC_ALLOC) == 0)
3238 /* If this is the first subspace for this space, then save
3239 the index of the subspace in its containing space. Also
3240 set "is_loadable" in the containing space. */
3242 if (som_section_data (section)->space_dict->subspace_quantity == 0)
3244 som_section_data (section)->space_dict->is_loadable = 1;
3245 som_section_data (section)->space_dict->subspace_index
3249 /* Increment the number of subspaces seen and the number of
3250 subspaces contained within the current space. */
3252 som_section_data (section)->space_dict->subspace_quantity++;
3254 /* Mark the index of the current space within the subspace's
3255 dictionary record. */
3256 som_section_data (subsection)->subspace_dict->space_index = i;
3258 /* Dump the current subspace header. */
3259 if (bfd_write ((PTR) som_section_data (subsection)->subspace_dict,
3260 sizeof (struct subspace_dictionary_record), 1, abfd)
3261 != sizeof (struct subspace_dictionary_record))
3264 /* Goto the next section. */
3265 section = section->next;
3268 /* Now repeat the process for unloadable subspaces. */
3269 section = abfd->sections;
3270 /* Now for each space write out records for its subspaces. */
3271 for (i = 0; i < num_spaces; i++)
3273 asection *subsection;
3276 while (!som_is_space (section))
3277 section = section->next;
3279 /* Now look for all its subspaces. */
3280 for (subsection = abfd->sections;
3282 subsection = subsection->next)
3285 /* Skip any section which does not correspond to a space or
3286 subspace, or which SEC_ALLOC set (and therefore handled
3287 in the loadable spaces/subspaces code above). */
3289 if (!som_is_subspace (subsection)
3290 || !som_is_container (section, subsection)
3291 || (subsection->flags & SEC_ALLOC) != 0)
3294 /* If this is the first subspace for this space, then save
3295 the index of the subspace in its containing space. Clear
3298 if (som_section_data (section)->space_dict->subspace_quantity == 0)
3300 som_section_data (section)->space_dict->is_loadable = 0;
3301 som_section_data (section)->space_dict->subspace_index
3305 /* Increment the number of subspaces seen and the number of
3306 subspaces contained within the current space. */
3307 som_section_data (section)->space_dict->subspace_quantity++;
3310 /* Mark the index of the current space within the subspace's
3311 dictionary record. */
3312 som_section_data (subsection)->subspace_dict->space_index = i;
3314 /* Dump this subspace header. */
3315 if (bfd_write ((PTR) som_section_data (subsection)->subspace_dict,
3316 sizeof (struct subspace_dictionary_record), 1, abfd)
3317 != sizeof (struct subspace_dictionary_record))
3320 /* Goto the next section. */
3321 section = section->next;
3324 /* All the subspace dictiondary records are written, and all the
3325 fields are set up in the space dictionary records.
3327 Seek to the right location and start writing the space
3328 dictionary records. */
3329 location = obj_som_file_hdr (abfd)->space_location;
3330 if (bfd_seek (abfd, location, SEEK_SET) < 0)
3333 section = abfd->sections;
3334 for (i = 0; i < num_spaces; i++)
3338 while (!som_is_space (section))
3339 section = section->next;
3341 /* Dump its header */
3342 if (bfd_write ((PTR) som_section_data (section)->space_dict,
3343 sizeof (struct space_dictionary_record), 1, abfd)
3344 != sizeof (struct space_dictionary_record))
3347 /* Goto the next section. */
3348 section = section->next;
3351 /* FIXME. This should really be conditional based on whether or not
3352 PA1.1 instructions/registers have been used.
3354 Setting of the system_id has to happen very late now that copying of
3355 BFD private data happens *after* section contents are set. */
3356 if (abfd->flags & (EXEC_P | DYNAMIC))
3357 obj_som_file_hdr(abfd)->system_id = obj_som_exec_data (abfd)->system_id;
3359 obj_som_file_hdr(abfd)->system_id = CPU_PA_RISC1_0;
3361 /* Compute the checksum for the file header just before writing
3362 the header to disk. */
3363 obj_som_file_hdr (abfd)->checksum = som_compute_checksum (abfd);
3365 /* Only thing left to do is write out the file header. It is always
3366 at location zero. Seek there and write it. */
3367 if (bfd_seek (abfd, (file_ptr) 0, SEEK_SET) < 0)
3369 if (bfd_write ((PTR) obj_som_file_hdr (abfd),
3370 sizeof (struct header), 1, abfd)
3371 != sizeof (struct header))
3374 /* Now write the exec header. */
3375 if (abfd->flags & (EXEC_P | DYNAMIC))
3378 struct som_exec_auxhdr *exec_header;
3380 exec_header = obj_som_exec_hdr (abfd);
3381 exec_header->exec_entry = bfd_get_start_address (abfd);
3382 exec_header->exec_flags = obj_som_exec_data (abfd)->exec_flags;
3384 /* Oh joys. Ram some of the BSS data into the DATA section
3385 to be compatable with how the hp linker makes objects
3386 (saves memory space). */
3387 tmp = exec_header->exec_dsize;
3388 tmp = SOM_ALIGN (tmp, PA_PAGESIZE);
3389 exec_header->exec_bsize -= (tmp - exec_header->exec_dsize);
3390 if (exec_header->exec_bsize < 0)
3391 exec_header->exec_bsize = 0;
3392 exec_header->exec_dsize = tmp;
3394 if (bfd_seek (abfd, obj_som_file_hdr (abfd)->aux_header_location,
3398 if (bfd_write ((PTR) exec_header, AUX_HDR_SIZE, 1, abfd)
3405 /* Compute and return the checksum for a SOM file header. */
3407 static unsigned long
3408 som_compute_checksum (abfd)
3411 unsigned long checksum, count, i;
3412 unsigned long *buffer = (unsigned long *) obj_som_file_hdr (abfd);
3415 count = sizeof (struct header) / sizeof (unsigned long);
3416 for (i = 0; i < count; i++)
3417 checksum ^= *(buffer + i);
3423 som_bfd_derive_misc_symbol_info (abfd, sym, info)
3426 struct som_misc_symbol_info *info;
3429 memset (info, 0, sizeof (struct som_misc_symbol_info));
3431 /* The HP SOM linker requires detailed type information about
3432 all symbols (including undefined symbols!). Unfortunately,
3433 the type specified in an import/export statement does not
3434 always match what the linker wants. Severe braindamage. */
3436 /* Section symbols will not have a SOM symbol type assigned to
3437 them yet. Assign all section symbols type ST_DATA. */
3438 if (sym->flags & BSF_SECTION_SYM)
3439 info->symbol_type = ST_DATA;
3442 /* Common symbols must have scope SS_UNSAT and type
3443 ST_STORAGE or the linker will choke. */
3444 if (bfd_is_com_section (sym->section))
3446 info->symbol_scope = SS_UNSAT;
3447 info->symbol_type = ST_STORAGE;
3450 /* It is possible to have a symbol without an associated
3451 type. This happens if the user imported the symbol
3452 without a type and the symbol was never defined
3453 locally. If BSF_FUNCTION is set for this symbol, then
3454 assign it type ST_CODE (the HP linker requires undefined
3455 external functions to have type ST_CODE rather than ST_ENTRY). */
3456 else if ((som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN
3457 || som_symbol_data (sym)->som_type == SYMBOL_TYPE_CODE)
3458 && bfd_is_und_section (sym->section)
3459 && sym->flags & BSF_FUNCTION)
3460 info->symbol_type = ST_CODE;
3462 /* Handle function symbols which were defined in this file.
3463 They should have type ST_ENTRY. Also retrieve the argument
3464 relocation bits from the SOM backend information. */
3465 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_ENTRY
3466 || (som_symbol_data (sym)->som_type == SYMBOL_TYPE_CODE
3467 && (sym->flags & BSF_FUNCTION))
3468 || (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN
3469 && (sym->flags & BSF_FUNCTION)))
3471 info->symbol_type = ST_ENTRY;
3472 info->arg_reloc = som_symbol_data (sym)->tc_data.hppa_arg_reloc;
3475 /* If the type is unknown at this point, it should be ST_DATA or
3476 ST_CODE (function/ST_ENTRY symbols were handled as special
3478 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN)
3480 if (sym->section->flags & SEC_CODE)
3481 info->symbol_type = ST_CODE;
3483 info->symbol_type = ST_DATA;
3486 /* From now on it's a very simple mapping. */
3487 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_ABSOLUTE)
3488 info->symbol_type = ST_ABSOLUTE;
3489 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_CODE)
3490 info->symbol_type = ST_CODE;
3491 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_DATA)
3492 info->symbol_type = ST_DATA;
3493 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_MILLICODE)
3494 info->symbol_type = ST_MILLICODE;
3495 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_PLABEL)
3496 info->symbol_type = ST_PLABEL;
3497 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_PRI_PROG)
3498 info->symbol_type = ST_PRI_PROG;
3499 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_SEC_PROG)
3500 info->symbol_type = ST_SEC_PROG;
3503 /* Now handle the symbol's scope. Exported data which is not
3504 in the common section has scope SS_UNIVERSAL. Note scope
3505 of common symbols was handled earlier! */
3506 if (sym->flags & BSF_EXPORT && ! bfd_is_com_section (sym->section))
3507 info->symbol_scope = SS_UNIVERSAL;
3508 /* Any undefined symbol at this point has a scope SS_UNSAT. */
3509 else if (bfd_is_und_section (sym->section))
3510 info->symbol_scope = SS_UNSAT;
3511 /* Anything else which is not in the common section has scope
3513 else if (! bfd_is_com_section (sym->section))
3514 info->symbol_scope = SS_LOCAL;
3516 /* Now set the symbol_info field. It has no real meaning
3517 for undefined or common symbols, but the HP linker will
3518 choke if it's not set to some "reasonable" value. We
3519 use zero as a reasonable value. */
3520 if (bfd_is_com_section (sym->section)
3521 || bfd_is_und_section (sym->section)
3522 || bfd_is_abs_section (sym->section))
3523 info->symbol_info = 0;
3524 /* For all other symbols, the symbol_info field contains the
3525 subspace index of the space this symbol is contained in. */
3527 info->symbol_info = sym->section->target_index;
3529 /* Set the symbol's value. */
3530 info->symbol_value = sym->value + sym->section->vma;
3533 /* Build and write, in one big chunk, the entire symbol table for
3537 som_build_and_write_symbol_table (abfd)
3540 unsigned int num_syms = bfd_get_symcount (abfd);
3541 file_ptr symtab_location = obj_som_file_hdr (abfd)->symbol_location;
3542 asymbol **bfd_syms = obj_som_sorted_syms (abfd);
3543 struct symbol_dictionary_record *som_symtab = NULL;
3546 /* Compute total symbol table size and allocate a chunk of memory
3547 to hold the symbol table as we build it. */
3548 symtab_size = num_syms * sizeof (struct symbol_dictionary_record);
3549 som_symtab = (struct symbol_dictionary_record *) malloc (symtab_size);
3550 if (som_symtab == NULL && symtab_size != 0)
3552 bfd_set_error (bfd_error_no_memory);
3555 memset (som_symtab, 0, symtab_size);
3557 /* Walk over each symbol. */
3558 for (i = 0; i < num_syms; i++)
3560 struct som_misc_symbol_info info;
3562 /* This is really an index into the symbol strings table.
3563 By the time we get here, the index has already been
3564 computed and stored into the name field in the BFD symbol. */
3565 som_symtab[i].name.n_strx = som_symbol_data(bfd_syms[i])->stringtab_offset;
3567 /* Derive SOM information from the BFD symbol. */
3568 som_bfd_derive_misc_symbol_info (abfd, bfd_syms[i], &info);
3571 som_symtab[i].symbol_type = info.symbol_type;
3572 som_symtab[i].symbol_scope = info.symbol_scope;
3573 som_symtab[i].arg_reloc = info.arg_reloc;
3574 som_symtab[i].symbol_info = info.symbol_info;
3575 som_symtab[i].symbol_value = info.symbol_value;
3578 /* Everything is ready, seek to the right location and
3579 scribble out the symbol table. */
3580 if (bfd_seek (abfd, symtab_location, SEEK_SET) != 0)
3583 if (bfd_write ((PTR) som_symtab, symtab_size, 1, abfd) != symtab_size)
3586 if (som_symtab != NULL)
3590 if (som_symtab != NULL)
3595 /* Write an object in SOM format. */
3598 som_write_object_contents (abfd)
3601 if (abfd->output_has_begun == false)
3603 /* Set up fixed parts of the file, space, and subspace headers.
3604 Notify the world that output has begun. */
3605 som_prep_headers (abfd);
3606 abfd->output_has_begun = true;
3607 /* Start writing the object file. This include all the string
3608 tables, fixup streams, and other portions of the object file. */
3609 som_begin_writing (abfd);
3612 /* Now that the symbol table information is complete, build and
3613 write the symbol table. */
3614 if (som_build_and_write_symbol_table (abfd) == false)
3617 return (som_write_headers (abfd));
3621 /* Read and save the string table associated with the given BFD. */
3624 som_slurp_string_table (abfd)
3629 /* Use the saved version if its available. */
3630 if (obj_som_stringtab (abfd) != NULL)
3633 /* I don't think this can currently happen, and I'm not sure it should
3634 really be an error, but it's better than getting unpredictable results
3635 from the host's malloc when passed a size of zero. */
3636 if (obj_som_stringtab_size (abfd) == 0)
3638 bfd_set_error (bfd_error_no_symbols);
3642 /* Allocate and read in the string table. */
3643 stringtab = malloc (obj_som_stringtab_size (abfd));
3644 if (stringtab == NULL)
3646 bfd_set_error (bfd_error_no_memory);
3650 if (bfd_seek (abfd, obj_som_str_filepos (abfd), SEEK_SET) < 0)
3653 if (bfd_read (stringtab, obj_som_stringtab_size (abfd), 1, abfd)
3654 != obj_som_stringtab_size (abfd))
3657 /* Save our results and return success. */
3658 obj_som_stringtab (abfd) = stringtab;
3662 /* Return the amount of data (in bytes) required to hold the symbol
3663 table for this object. */
3666 som_get_symtab_upper_bound (abfd)
3669 if (!som_slurp_symbol_table (abfd))
3672 return (bfd_get_symcount (abfd) + 1) * (sizeof (asymbol *));
3675 /* Convert from a SOM subspace index to a BFD section. */
3678 bfd_section_from_som_symbol (abfd, symbol)
3680 struct symbol_dictionary_record *symbol;
3684 /* The meaning of the symbol_info field changes for functions
3685 within executables. So only use the quick symbol_info mapping for
3686 incomplete objects and non-function symbols in executables. */
3687 if ((abfd->flags & (EXEC_P | DYNAMIC)) == 0
3688 || (symbol->symbol_type != ST_ENTRY
3689 && symbol->symbol_type != ST_PRI_PROG
3690 && symbol->symbol_type != ST_SEC_PROG
3691 && symbol->symbol_type != ST_MILLICODE))
3693 unsigned int index = symbol->symbol_info;
3694 for (section = abfd->sections; section != NULL; section = section->next)
3695 if (section->target_index == index && som_is_subspace (section))
3698 /* Could be a symbol from an external library (such as an OMOS
3699 shared library). Don't abort. */
3700 return bfd_abs_section_ptr;
3705 unsigned int value = symbol->symbol_value;
3707 /* For executables we will have to use the symbol's address and
3708 find out what section would contain that address. Yuk. */
3709 for (section = abfd->sections; section; section = section->next)
3711 if (value >= section->vma
3712 && value <= section->vma + section->_cooked_size
3713 && som_is_subspace (section))
3717 /* Could be a symbol from an external library (such as an OMOS
3718 shared library). Don't abort. */
3719 return bfd_abs_section_ptr;
3724 /* Read and save the symbol table associated with the given BFD. */
3727 som_slurp_symbol_table (abfd)
3730 int symbol_count = bfd_get_symcount (abfd);
3731 int symsize = sizeof (struct symbol_dictionary_record);
3733 struct symbol_dictionary_record *buf = NULL, *bufp, *endbufp;
3734 som_symbol_type *sym, *symbase;
3736 /* Return saved value if it exists. */
3737 if (obj_som_symtab (abfd) != NULL)
3738 goto successful_return;
3740 /* Special case. This is *not* an error. */
3741 if (symbol_count == 0)
3742 goto successful_return;
3744 if (!som_slurp_string_table (abfd))
3747 stringtab = obj_som_stringtab (abfd);
3749 symbase = (som_symbol_type *)
3750 malloc (symbol_count * sizeof (som_symbol_type));
3751 if (symbase == NULL)
3753 bfd_set_error (bfd_error_no_memory);
3757 /* Read in the external SOM representation. */
3758 buf = malloc (symbol_count * symsize);
3759 if (buf == NULL && symbol_count * symsize != 0)
3761 bfd_set_error (bfd_error_no_memory);
3764 if (bfd_seek (abfd, obj_som_sym_filepos (abfd), SEEK_SET) < 0)
3766 if (bfd_read (buf, symbol_count * symsize, 1, abfd)
3767 != symbol_count * symsize)
3770 /* Iterate over all the symbols and internalize them. */
3771 endbufp = buf + symbol_count;
3772 for (bufp = buf, sym = symbase; bufp < endbufp; ++bufp)
3775 /* I don't think we care about these. */
3776 if (bufp->symbol_type == ST_SYM_EXT
3777 || bufp->symbol_type == ST_ARG_EXT)
3780 /* Set some private data we care about. */
3781 if (bufp->symbol_type == ST_NULL)
3782 som_symbol_data (sym)->som_type = SYMBOL_TYPE_UNKNOWN;
3783 else if (bufp->symbol_type == ST_ABSOLUTE)
3784 som_symbol_data (sym)->som_type = SYMBOL_TYPE_ABSOLUTE;
3785 else if (bufp->symbol_type == ST_DATA)
3786 som_symbol_data (sym)->som_type = SYMBOL_TYPE_DATA;
3787 else if (bufp->symbol_type == ST_CODE)
3788 som_symbol_data (sym)->som_type = SYMBOL_TYPE_CODE;
3789 else if (bufp->symbol_type == ST_PRI_PROG)
3790 som_symbol_data (sym)->som_type = SYMBOL_TYPE_PRI_PROG;
3791 else if (bufp->symbol_type == ST_SEC_PROG)
3792 som_symbol_data (sym)->som_type = SYMBOL_TYPE_SEC_PROG;
3793 else if (bufp->symbol_type == ST_ENTRY)
3794 som_symbol_data (sym)->som_type = SYMBOL_TYPE_ENTRY;
3795 else if (bufp->symbol_type == ST_MILLICODE)
3796 som_symbol_data (sym)->som_type = SYMBOL_TYPE_MILLICODE;
3797 else if (bufp->symbol_type == ST_PLABEL)
3798 som_symbol_data (sym)->som_type = SYMBOL_TYPE_PLABEL;
3800 som_symbol_data (sym)->som_type = SYMBOL_TYPE_UNKNOWN;
3801 som_symbol_data (sym)->tc_data.hppa_arg_reloc = bufp->arg_reloc;
3803 /* Some reasonable defaults. */
3804 sym->symbol.the_bfd = abfd;
3805 sym->symbol.name = bufp->name.n_strx + stringtab;
3806 sym->symbol.value = bufp->symbol_value;
3807 sym->symbol.section = 0;
3808 sym->symbol.flags = 0;
3810 switch (bufp->symbol_type)
3814 sym->symbol.flags |= BSF_FUNCTION;
3815 sym->symbol.value &= ~0x3;
3822 sym->symbol.value &= ~0x3;
3823 /* If the symbol's scope is ST_UNSAT, then these are
3824 undefined function symbols. */
3825 if (bufp->symbol_scope == SS_UNSAT)
3826 sym->symbol.flags |= BSF_FUNCTION;
3833 /* Handle scoping and section information. */
3834 switch (bufp->symbol_scope)
3836 /* symbol_info field is undefined for SS_EXTERNAL and SS_UNSAT symbols,
3837 so the section associated with this symbol can't be known. */
3839 if (bufp->symbol_type != ST_STORAGE)
3840 sym->symbol.section = bfd_und_section_ptr;
3842 sym->symbol.section = bfd_com_section_ptr;
3843 sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL);
3847 if (bufp->symbol_type != ST_STORAGE)
3848 sym->symbol.section = bfd_und_section_ptr;
3850 sym->symbol.section = bfd_com_section_ptr;
3854 sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL);
3855 sym->symbol.section = bfd_section_from_som_symbol (abfd, bufp);
3856 sym->symbol.value -= sym->symbol.section->vma;
3860 /* SS_GLOBAL and SS_LOCAL are two names for the same thing.
3861 Sound dumb? It is. */
3865 sym->symbol.flags |= BSF_LOCAL;
3866 sym->symbol.section = bfd_section_from_som_symbol (abfd, bufp);
3867 sym->symbol.value -= sym->symbol.section->vma;
3871 /* Mark section symbols and symbols used by the debugger.
3872 Note $START$ is a magic code symbol, NOT a section symbol. */
3873 if (sym->symbol.name[0] == '$'
3874 && sym->symbol.name[strlen (sym->symbol.name) - 1] == '$'
3875 && strcmp (sym->symbol.name, "$START$"))
3876 sym->symbol.flags |= BSF_SECTION_SYM;
3877 else if (!strncmp (sym->symbol.name, "L$0\002", 4))
3879 sym->symbol.flags |= BSF_SECTION_SYM;
3880 sym->symbol.name = sym->symbol.section->name;
3882 else if (!strncmp (sym->symbol.name, "L$0\001", 4))
3883 sym->symbol.flags |= BSF_DEBUGGING;
3885 /* Note increment at bottom of loop, since we skip some symbols
3886 we can not include it as part of the for statement. */
3890 /* Save our results and return success. */
3891 obj_som_symtab (abfd) = symbase;
3903 /* Canonicalize a SOM symbol table. Return the number of entries
3904 in the symbol table. */
3907 som_get_symtab (abfd, location)
3912 som_symbol_type *symbase;
3914 if (!som_slurp_symbol_table (abfd))
3917 i = bfd_get_symcount (abfd);
3918 symbase = obj_som_symtab (abfd);
3920 for (; i > 0; i--, location++, symbase++)
3921 *location = &symbase->symbol;
3923 /* Final null pointer. */
3925 return (bfd_get_symcount (abfd));
3928 /* Make a SOM symbol. There is nothing special to do here. */
3931 som_make_empty_symbol (abfd)
3934 som_symbol_type *new =
3935 (som_symbol_type *) bfd_zalloc (abfd, sizeof (som_symbol_type));
3938 bfd_set_error (bfd_error_no_memory);
3941 new->symbol.the_bfd = abfd;
3943 return &new->symbol;
3946 /* Print symbol information. */
3949 som_print_symbol (ignore_abfd, afile, symbol, how)
3953 bfd_print_symbol_type how;
3955 FILE *file = (FILE *) afile;
3958 case bfd_print_symbol_name:
3959 fprintf (file, "%s", symbol->name);
3961 case bfd_print_symbol_more:
3962 fprintf (file, "som ");
3963 fprintf_vma (file, symbol->value);
3964 fprintf (file, " %lx", (long) symbol->flags);
3966 case bfd_print_symbol_all:
3968 CONST char *section_name;
3969 section_name = symbol->section ? symbol->section->name : "(*none*)";
3970 bfd_print_symbol_vandf ((PTR) file, symbol);
3971 fprintf (file, " %s\t%s", section_name, symbol->name);
3978 som_bfd_is_local_label (abfd, sym)
3982 return (sym->name[0] == 'L' && sym->name[1] == '$');
3985 /* Count or process variable-length SOM fixup records.
3987 To avoid code duplication we use this code both to compute the number
3988 of relocations requested by a stream, and to internalize the stream.
3990 When computing the number of relocations requested by a stream the
3991 variables rptr, section, and symbols have no meaning.
3993 Return the number of relocations requested by the fixup stream. When
3996 This needs at least two or three more passes to get it cleaned up. */
3999 som_set_reloc_info (fixup, end, internal_relocs, section, symbols, just_count)
4000 unsigned char *fixup;
4002 arelent *internal_relocs;
4007 unsigned int op, varname;
4008 unsigned char *end_fixups = &fixup[end];
4009 const struct fixup_format *fp;
4011 unsigned char *save_fixup;
4012 int variables[26], stack[20], c, v, count, prev_fixup, *sp, saved_unwind_bits;
4014 arelent *rptr= internal_relocs;
4015 unsigned int offset = 0;
4017 #define var(c) variables[(c) - 'A']
4018 #define push(v) (*sp++ = (v))
4019 #define pop() (*--sp)
4020 #define emptystack() (sp == stack)
4022 som_initialize_reloc_queue (reloc_queue);
4023 memset (variables, 0, sizeof (variables));
4024 memset (stack, 0, sizeof (stack));
4027 saved_unwind_bits = 0;
4030 while (fixup < end_fixups)
4033 /* Save pointer to the start of this fixup. We'll use
4034 it later to determine if it is necessary to put this fixup
4038 /* Get the fixup code and its associated format. */
4040 fp = &som_fixup_formats[op];
4042 /* Handle a request for a previous fixup. */
4043 if (*fp->format == 'P')
4045 /* Get pointer to the beginning of the prev fixup, move
4046 the repeated fixup to the head of the queue. */
4047 fixup = reloc_queue[fp->D].reloc;
4048 som_reloc_queue_fix (reloc_queue, fp->D);
4051 /* Get the fixup code and its associated format. */
4053 fp = &som_fixup_formats[op];
4056 /* If this fixup will be passed to BFD, set some reasonable defaults. */
4058 && som_hppa_howto_table[op].type != R_NO_RELOCATION
4059 && som_hppa_howto_table[op].type != R_DATA_OVERRIDE)
4061 rptr->address = offset;
4062 rptr->howto = &som_hppa_howto_table[op];
4064 rptr->sym_ptr_ptr = bfd_abs_section_ptr->symbol_ptr_ptr;
4067 /* Set default input length to 0. Get the opcode class index
4071 var ('U') = saved_unwind_bits;
4073 /* Get the opcode format. */
4076 /* Process the format string. Parsing happens in two phases,
4077 parse RHS, then assign to LHS. Repeat until no more
4078 characters in the format string. */
4081 /* The variable this pass is going to compute a value for. */
4084 /* Start processing RHS. Continue until a NULL or '=' is found. */
4089 /* If this is a variable, push it on the stack. */
4093 /* If this is a lower case letter, then it represents
4094 additional data from the fixup stream to be pushed onto
4096 else if (islower (c))
4098 for (v = 0; c > 'a'; --c)
4099 v = (v << 8) | *fixup++;
4103 /* A decimal constant. Push it on the stack. */
4104 else if (isdigit (c))
4107 while (isdigit (*cp))
4108 v = (v * 10) + (*cp++ - '0');
4113 /* An operator. Pop two two values from the stack and
4114 use them as operands to the given operation. Push
4115 the result of the operation back on the stack. */
4137 while (*cp && *cp != '=');
4139 /* Move over the equal operator. */
4142 /* Pop the RHS off the stack. */
4145 /* Perform the assignment. */
4148 /* Handle side effects. and special 'O' stack cases. */
4151 /* Consume some bytes from the input space. */
4155 /* A symbol to use in the relocation. Make a note
4156 of this if we are not just counting. */
4159 rptr->sym_ptr_ptr = &symbols[c];
4161 /* Handle the linker expression stack. */
4166 subop = comp1_opcodes;
4169 subop = comp2_opcodes;
4172 subop = comp3_opcodes;
4177 while (*subop <= (unsigned char) c)
4181 /* The lower 32unwind bits must be persistent. */
4183 saved_unwind_bits = var ('U');
4191 /* If we used a previous fixup, clean up after it. */
4194 fixup = save_fixup + 1;
4198 else if (fixup > save_fixup + 1)
4199 som_reloc_queue_insert (save_fixup, fixup - save_fixup, reloc_queue);
4201 /* We do not pass R_DATA_OVERRIDE or R_NO_RELOCATION
4203 if (som_hppa_howto_table[op].type != R_DATA_OVERRIDE
4204 && som_hppa_howto_table[op].type != R_NO_RELOCATION)
4206 /* Done with a single reloction. Loop back to the top. */
4209 if (som_hppa_howto_table[op].type == R_ENTRY)
4210 rptr->addend = var ('T');
4211 else if (som_hppa_howto_table[op].type == R_EXIT)
4212 rptr->addend = var ('U');
4214 rptr->addend = var ('V');
4218 /* Now that we've handled a "full" relocation, reset
4220 memset (variables, 0, sizeof (variables));
4221 memset (stack, 0, sizeof (stack));
4232 /* Read in the relocs (aka fixups in SOM terms) for a section.
4234 som_get_reloc_upper_bound calls this routine with JUST_COUNT
4235 set to true to indicate it only needs a count of the number
4236 of actual relocations. */
4239 som_slurp_reloc_table (abfd, section, symbols, just_count)
4245 char *external_relocs;
4246 unsigned int fixup_stream_size;
4247 arelent *internal_relocs;
4248 unsigned int num_relocs;
4250 fixup_stream_size = som_section_data (section)->reloc_size;
4251 /* If there were no relocations, then there is nothing to do. */
4252 if (section->reloc_count == 0)
4255 /* If reloc_count is -1, then the relocation stream has not been
4256 parsed. We must do so now to know how many relocations exist. */
4257 if (section->reloc_count == -1)
4259 external_relocs = (char *) malloc (fixup_stream_size);
4260 if (external_relocs == (char *) NULL)
4262 bfd_set_error (bfd_error_no_memory);
4265 /* Read in the external forms. */
4267 obj_som_reloc_filepos (abfd) + section->rel_filepos,
4271 if (bfd_read (external_relocs, 1, fixup_stream_size, abfd)
4272 != fixup_stream_size)
4275 /* Let callers know how many relocations found.
4276 also save the relocation stream as we will
4278 section->reloc_count = som_set_reloc_info (external_relocs,
4280 NULL, NULL, NULL, true);
4282 som_section_data (section)->reloc_stream = external_relocs;
4285 /* If the caller only wanted a count, then return now. */
4289 num_relocs = section->reloc_count;
4290 external_relocs = som_section_data (section)->reloc_stream;
4291 /* Return saved information about the relocations if it is available. */
4292 if (section->relocation != (arelent *) NULL)
4295 internal_relocs = (arelent *) malloc (num_relocs * sizeof (arelent));
4296 if (internal_relocs == (arelent *) NULL)
4298 bfd_set_error (bfd_error_no_memory);
4302 /* Process and internalize the relocations. */
4303 som_set_reloc_info (external_relocs, fixup_stream_size,
4304 internal_relocs, section, symbols, false);
4306 /* Save our results and return success. */
4307 section->relocation = internal_relocs;
4311 /* Return the number of bytes required to store the relocation
4312 information associated with the given section. */
4315 som_get_reloc_upper_bound (abfd, asect)
4319 /* If section has relocations, then read in the relocation stream
4320 and parse it to determine how many relocations exist. */
4321 if (asect->flags & SEC_RELOC)
4323 if (! som_slurp_reloc_table (abfd, asect, NULL, true))
4325 return (asect->reloc_count + 1) * sizeof (arelent);
4327 /* There are no relocations. */
4331 /* Convert relocations from SOM (external) form into BFD internal
4332 form. Return the number of relocations. */
4335 som_canonicalize_reloc (abfd, section, relptr, symbols)
4344 if (som_slurp_reloc_table (abfd, section, symbols, false) == false)
4347 count = section->reloc_count;
4348 tblptr = section->relocation;
4351 *relptr++ = tblptr++;
4353 *relptr = (arelent *) NULL;
4354 return section->reloc_count;
4357 extern const bfd_target som_vec;
4359 /* A hook to set up object file dependent section information. */
4362 som_new_section_hook (abfd, newsect)
4366 newsect->used_by_bfd =
4367 (PTR) bfd_zalloc (abfd, sizeof (struct som_section_data_struct));
4368 if (!newsect->used_by_bfd)
4370 bfd_set_error (bfd_error_no_memory);
4373 newsect->alignment_power = 3;
4375 /* We allow more than three sections internally */
4379 /* Copy any private info we understand from the input section
4380 to the output section. */
4382 som_bfd_copy_private_section_data (ibfd, isection, obfd, osection)
4388 /* One day we may try to grok other private data. */
4389 if (ibfd->xvec->flavour != bfd_target_som_flavour
4390 || obfd->xvec->flavour != bfd_target_som_flavour
4391 || (!som_is_space (isection) && !som_is_subspace (isection)))
4394 som_section_data (osection)->copy_data
4395 = (struct som_copyable_section_data_struct *)
4396 bfd_zalloc (obfd, sizeof (struct som_copyable_section_data_struct));
4397 if (som_section_data (osection)->copy_data == NULL)
4399 bfd_set_error (bfd_error_no_memory);
4403 memcpy (som_section_data (osection)->copy_data,
4404 som_section_data (isection)->copy_data,
4405 sizeof (struct som_copyable_section_data_struct));
4407 /* Reparent if necessary. */
4408 if (som_section_data (osection)->copy_data->container)
4409 som_section_data (osection)->copy_data->container =
4410 som_section_data (osection)->copy_data->container->output_section;
4415 /* Copy any private info we understand from the input bfd
4416 to the output bfd. */
4419 som_bfd_copy_private_bfd_data (ibfd, obfd)
4422 /* One day we may try to grok other private data. */
4423 if (ibfd->xvec->flavour != bfd_target_som_flavour
4424 || obfd->xvec->flavour != bfd_target_som_flavour)
4427 /* Allocate some memory to hold the data we need. */
4428 obj_som_exec_data (obfd) = (struct som_exec_data *)
4429 bfd_zalloc (obfd, sizeof (struct som_exec_data));
4430 if (obj_som_exec_data (obfd) == NULL)
4432 bfd_set_error (bfd_error_no_memory);
4436 /* Now copy the data. */
4437 memcpy (obj_som_exec_data (obfd), obj_som_exec_data (ibfd),
4438 sizeof (struct som_exec_data));
4443 /* Set backend info for sections which can not be described
4444 in the BFD data structures. */
4447 bfd_som_set_section_attributes (section, defined, private, sort_key, spnum)
4451 unsigned int sort_key;
4454 /* Allocate memory to hold the magic information. */
4455 if (som_section_data (section)->copy_data == NULL)
4457 som_section_data (section)->copy_data
4458 = (struct som_copyable_section_data_struct *)
4459 bfd_zalloc (section->owner,
4460 sizeof (struct som_copyable_section_data_struct));
4461 if (som_section_data (section)->copy_data == NULL)
4463 bfd_set_error (bfd_error_no_memory);
4467 som_section_data (section)->copy_data->sort_key = sort_key;
4468 som_section_data (section)->copy_data->is_defined = defined;
4469 som_section_data (section)->copy_data->is_private = private;
4470 som_section_data (section)->copy_data->container = section;
4471 som_section_data (section)->copy_data->space_number = spnum;
4475 /* Set backend info for subsections which can not be described
4476 in the BFD data structures. */
4479 bfd_som_set_subsection_attributes (section, container, access,
4482 asection *container;
4484 unsigned int sort_key;
4487 /* Allocate memory to hold the magic information. */
4488 if (som_section_data (section)->copy_data == NULL)
4490 som_section_data (section)->copy_data
4491 = (struct som_copyable_section_data_struct *)
4492 bfd_zalloc (section->owner,
4493 sizeof (struct som_copyable_section_data_struct));
4494 if (som_section_data (section)->copy_data == NULL)
4496 bfd_set_error (bfd_error_no_memory);
4500 som_section_data (section)->copy_data->sort_key = sort_key;
4501 som_section_data (section)->copy_data->access_control_bits = access;
4502 som_section_data (section)->copy_data->quadrant = quadrant;
4503 som_section_data (section)->copy_data->container = container;
4507 /* Set the full SOM symbol type. SOM needs far more symbol information
4508 than any other object file format I'm aware of. It is mandatory
4509 to be able to know if a symbol is an entry point, millicode, data,
4510 code, absolute, storage request, or procedure label. If you get
4511 the symbol type wrong your program will not link. */
4514 bfd_som_set_symbol_type (symbol, type)
4518 som_symbol_data (symbol)->som_type = type;
4521 /* Attach an auxiliary header to the BFD backend so that it may be
4522 written into the object file. */
4524 bfd_som_attach_aux_hdr (abfd, type, string)
4529 if (type == VERSION_AUX_ID)
4531 int len = strlen (string);
4535 pad = (4 - (len % 4));
4536 obj_som_version_hdr (abfd) = (struct user_string_aux_hdr *)
4537 bfd_zalloc (abfd, sizeof (struct aux_id)
4538 + sizeof (unsigned int) + len + pad);
4539 if (!obj_som_version_hdr (abfd))
4541 bfd_set_error (bfd_error_no_memory);
4544 obj_som_version_hdr (abfd)->header_id.type = VERSION_AUX_ID;
4545 obj_som_version_hdr (abfd)->header_id.length = len + pad;
4546 obj_som_version_hdr (abfd)->header_id.length += sizeof (int);
4547 obj_som_version_hdr (abfd)->string_length = len;
4548 strncpy (obj_som_version_hdr (abfd)->user_string, string, len);
4550 else if (type == COPYRIGHT_AUX_ID)
4552 int len = strlen (string);
4556 pad = (4 - (len % 4));
4557 obj_som_copyright_hdr (abfd) = (struct copyright_aux_hdr *)
4558 bfd_zalloc (abfd, sizeof (struct aux_id)
4559 + sizeof (unsigned int) + len + pad);
4560 if (!obj_som_copyright_hdr (abfd))
4562 bfd_set_error (bfd_error_no_memory);
4565 obj_som_copyright_hdr (abfd)->header_id.type = COPYRIGHT_AUX_ID;
4566 obj_som_copyright_hdr (abfd)->header_id.length = len + pad;
4567 obj_som_copyright_hdr (abfd)->header_id.length += sizeof (int);
4568 obj_som_copyright_hdr (abfd)->string_length = len;
4569 strcpy (obj_som_copyright_hdr (abfd)->copyright, string);
4575 som_get_section_contents (abfd, section, location, offset, count)
4580 bfd_size_type count;
4582 if (count == 0 || ((section->flags & SEC_HAS_CONTENTS) == 0))
4584 if ((bfd_size_type)(offset+count) > section->_raw_size
4585 || bfd_seek (abfd, (file_ptr)(section->filepos + offset), SEEK_SET) == -1
4586 || bfd_read (location, (bfd_size_type)1, count, abfd) != count)
4587 return (false); /* on error */
4592 som_set_section_contents (abfd, section, location, offset, count)
4597 bfd_size_type count;
4599 if (abfd->output_has_begun == false)
4601 /* Set up fixed parts of the file, space, and subspace headers.
4602 Notify the world that output has begun. */
4603 som_prep_headers (abfd);
4604 abfd->output_has_begun = true;
4605 /* Start writing the object file. This include all the string
4606 tables, fixup streams, and other portions of the object file. */
4607 som_begin_writing (abfd);
4610 /* Only write subspaces which have "real" contents (eg. the contents
4611 are not generated at run time by the OS). */
4612 if (!som_is_subspace (section)
4613 || ((section->flags & SEC_HAS_CONTENTS) == 0))
4616 /* Seek to the proper offset within the object file and write the
4618 offset += som_section_data (section)->subspace_dict->file_loc_init_value;
4619 if (bfd_seek (abfd, offset, SEEK_SET) == -1)
4622 if (bfd_write ((PTR) location, 1, count, abfd) != count)
4628 som_set_arch_mach (abfd, arch, machine)
4630 enum bfd_architecture arch;
4631 unsigned long machine;
4633 /* Allow any architecture to be supported by the SOM backend */
4634 return bfd_default_set_arch_mach (abfd, arch, machine);
4638 som_find_nearest_line (abfd, section, symbols, offset, filename_ptr,
4639 functionname_ptr, line_ptr)
4644 CONST char **filename_ptr;
4645 CONST char **functionname_ptr;
4646 unsigned int *line_ptr;
4648 fprintf (stderr, "som_find_nearest_line unimplemented\n");
4655 som_sizeof_headers (abfd, reloc)
4659 fprintf (stderr, "som_sizeof_headers unimplemented\n");
4665 /* Return the single-character symbol type corresponding to
4666 SOM section S, or '?' for an unknown SOM section. */
4669 som_section_type (s)
4672 const struct section_to_type *t;
4674 for (t = &stt[0]; t->section; t++)
4675 if (!strcmp (s, t->section))
4681 som_decode_symclass (symbol)
4686 if (bfd_is_com_section (symbol->section))
4688 if (bfd_is_und_section (symbol->section))
4690 if (bfd_is_ind_section (symbol->section))
4692 if (!(symbol->flags & (BSF_GLOBAL|BSF_LOCAL)))
4695 if (bfd_is_abs_section (symbol->section))
4697 else if (symbol->section)
4698 c = som_section_type (symbol->section->name);
4701 if (symbol->flags & BSF_GLOBAL)
4706 /* Return information about SOM symbol SYMBOL in RET. */
4709 som_get_symbol_info (ignore_abfd, symbol, ret)
4714 ret->type = som_decode_symclass (symbol);
4715 if (ret->type != 'U')
4716 ret->value = symbol->value+symbol->section->vma;
4719 ret->name = symbol->name;
4722 /* Count the number of symbols in the archive symbol table. Necessary
4723 so that we can allocate space for all the carsyms at once. */
4726 som_bfd_count_ar_symbols (abfd, lst_header, count)
4728 struct lst_header *lst_header;
4732 unsigned int *hash_table = NULL;
4733 file_ptr lst_filepos = bfd_tell (abfd) - sizeof (struct lst_header);
4736 (unsigned int *) malloc (lst_header->hash_size * sizeof (unsigned int));
4737 if (hash_table == NULL && lst_header->hash_size != 0)
4739 bfd_set_error (bfd_error_no_memory);
4743 /* Don't forget to initialize the counter! */
4746 /* Read in the hash table. The has table is an array of 32bit file offsets
4747 which point to the hash chains. */
4748 if (bfd_read ((PTR) hash_table, lst_header->hash_size, 4, abfd)
4749 != lst_header->hash_size * 4)
4752 /* Walk each chain counting the number of symbols found on that particular
4754 for (i = 0; i < lst_header->hash_size; i++)
4756 struct lst_symbol_record lst_symbol;
4758 /* An empty chain has zero as it's file offset. */
4759 if (hash_table[i] == 0)
4762 /* Seek to the first symbol in this hash chain. */
4763 if (bfd_seek (abfd, lst_filepos + hash_table[i], SEEK_SET) < 0)
4766 /* Read in this symbol and update the counter. */
4767 if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd)
4768 != sizeof (lst_symbol))
4773 /* Now iterate through the rest of the symbols on this chain. */
4774 while (lst_symbol.next_entry)
4777 /* Seek to the next symbol. */
4778 if (bfd_seek (abfd, lst_filepos + lst_symbol.next_entry, SEEK_SET)
4782 /* Read the symbol in and update the counter. */
4783 if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd)
4784 != sizeof (lst_symbol))
4790 if (hash_table != NULL)
4795 if (hash_table != NULL)
4800 /* Fill in the canonical archive symbols (SYMS) from the archive described
4801 by ABFD and LST_HEADER. */
4804 som_bfd_fill_in_ar_symbols (abfd, lst_header, syms)
4806 struct lst_header *lst_header;
4809 unsigned int i, len;
4810 carsym *set = syms[0];
4811 unsigned int *hash_table = NULL;
4812 struct som_entry *som_dict = NULL;
4813 file_ptr lst_filepos = bfd_tell (abfd) - sizeof (struct lst_header);
4816 (unsigned int *) malloc (lst_header->hash_size * sizeof (unsigned int));
4817 if (hash_table == NULL && lst_header->hash_size != 0)
4819 bfd_set_error (bfd_error_no_memory);
4824 (struct som_entry *) malloc (lst_header->module_count
4825 * sizeof (struct som_entry));
4826 if (som_dict == NULL && lst_header->module_count != 0)
4828 bfd_set_error (bfd_error_no_memory);
4832 /* Read in the hash table. The has table is an array of 32bit file offsets
4833 which point to the hash chains. */
4834 if (bfd_read ((PTR) hash_table, lst_header->hash_size, 4, abfd)
4835 != lst_header->hash_size * 4)
4838 /* Seek to and read in the SOM dictionary. We will need this to fill
4839 in the carsym's filepos field. */
4840 if (bfd_seek (abfd, lst_filepos + lst_header->dir_loc, SEEK_SET) < 0)
4843 if (bfd_read ((PTR) som_dict, lst_header->module_count,
4844 sizeof (struct som_entry), abfd)
4845 != lst_header->module_count * sizeof (struct som_entry))
4848 /* Walk each chain filling in the carsyms as we go along. */
4849 for (i = 0; i < lst_header->hash_size; i++)
4851 struct lst_symbol_record lst_symbol;
4853 /* An empty chain has zero as it's file offset. */
4854 if (hash_table[i] == 0)
4857 /* Seek to and read the first symbol on the chain. */
4858 if (bfd_seek (abfd, lst_filepos + hash_table[i], SEEK_SET) < 0)
4861 if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd)
4862 != sizeof (lst_symbol))
4865 /* Get the name of the symbol, first get the length which is stored
4866 as a 32bit integer just before the symbol.
4868 One might ask why we don't just read in the entire string table
4869 and index into it. Well, according to the SOM ABI the string
4870 index can point *anywhere* in the archive to save space, so just
4871 using the string table would not be safe. */
4872 if (bfd_seek (abfd, lst_filepos + lst_header->string_loc
4873 + lst_symbol.name.n_strx - 4, SEEK_SET) < 0)
4876 if (bfd_read (&len, 1, 4, abfd) != 4)
4879 /* Allocate space for the name and null terminate it too. */
4880 set->name = bfd_zalloc (abfd, len + 1);
4883 bfd_set_error (bfd_error_no_memory);
4886 if (bfd_read (set->name, 1, len, abfd) != len)
4891 /* Fill in the file offset. Note that the "location" field points
4892 to the SOM itself, not the ar_hdr in front of it. */
4893 set->file_offset = som_dict[lst_symbol.som_index].location
4894 - sizeof (struct ar_hdr);
4896 /* Go to the next symbol. */
4899 /* Iterate through the rest of the chain. */
4900 while (lst_symbol.next_entry)
4902 /* Seek to the next symbol and read it in. */
4903 if (bfd_seek (abfd, lst_filepos + lst_symbol.next_entry, SEEK_SET) <0)
4906 if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd)
4907 != sizeof (lst_symbol))
4910 /* Seek to the name length & string and read them in. */
4911 if (bfd_seek (abfd, lst_filepos + lst_header->string_loc
4912 + lst_symbol.name.n_strx - 4, SEEK_SET) < 0)
4915 if (bfd_read (&len, 1, 4, abfd) != 4)
4918 /* Allocate space for the name and null terminate it too. */
4919 set->name = bfd_zalloc (abfd, len + 1);
4922 bfd_set_error (bfd_error_no_memory);
4926 if (bfd_read (set->name, 1, len, abfd) != len)
4930 /* Fill in the file offset. Note that the "location" field points
4931 to the SOM itself, not the ar_hdr in front of it. */
4932 set->file_offset = som_dict[lst_symbol.som_index].location
4933 - sizeof (struct ar_hdr);
4935 /* Go on to the next symbol. */
4939 /* If we haven't died by now, then we successfully read the entire
4940 archive symbol table. */
4941 if (hash_table != NULL)
4943 if (som_dict != NULL)
4948 if (hash_table != NULL)
4950 if (som_dict != NULL)
4955 /* Read in the LST from the archive. */
4957 som_slurp_armap (abfd)
4960 struct lst_header lst_header;
4961 struct ar_hdr ar_header;
4962 unsigned int parsed_size;
4963 struct artdata *ardata = bfd_ardata (abfd);
4965 int i = bfd_read ((PTR) nextname, 1, 16, abfd);
4967 /* Special cases. */
4973 if (bfd_seek (abfd, (file_ptr) - 16, SEEK_CUR) < 0)
4976 /* For archives without .o files there is no symbol table. */
4977 if (strncmp (nextname, "/ ", 16))
4979 bfd_has_map (abfd) = false;
4983 /* Read in and sanity check the archive header. */
4984 if (bfd_read ((PTR) &ar_header, 1, sizeof (struct ar_hdr), abfd)
4985 != sizeof (struct ar_hdr))
4988 if (strncmp (ar_header.ar_fmag, ARFMAG, 2))
4990 bfd_set_error (bfd_error_malformed_archive);
4994 /* How big is the archive symbol table entry? */
4996 parsed_size = strtol (ar_header.ar_size, NULL, 10);
4999 bfd_set_error (bfd_error_malformed_archive);
5003 /* Save off the file offset of the first real user data. */
5004 ardata->first_file_filepos = bfd_tell (abfd) + parsed_size;
5006 /* Read in the library symbol table. We'll make heavy use of this
5007 in just a minute. */
5008 if (bfd_read ((PTR) & lst_header, 1, sizeof (struct lst_header), abfd)
5009 != sizeof (struct lst_header))
5013 if (lst_header.a_magic != LIBMAGIC)
5015 bfd_set_error (bfd_error_malformed_archive);
5019 /* Count the number of symbols in the library symbol table. */
5020 if (som_bfd_count_ar_symbols (abfd, &lst_header, &ardata->symdef_count)
5024 /* Get back to the start of the library symbol table. */
5025 if (bfd_seek (abfd, ardata->first_file_filepos - parsed_size
5026 + sizeof (struct lst_header), SEEK_SET) < 0)
5029 /* Initializae the cache and allocate space for the library symbols. */
5031 ardata->symdefs = (carsym *) bfd_alloc (abfd,
5032 (ardata->symdef_count
5033 * sizeof (carsym)));
5034 if (!ardata->symdefs)
5036 bfd_set_error (bfd_error_no_memory);
5040 /* Now fill in the canonical archive symbols. */
5041 if (som_bfd_fill_in_ar_symbols (abfd, &lst_header, &ardata->symdefs)
5045 /* Seek back to the "first" file in the archive. Note the "first"
5046 file may be the extended name table. */
5047 if (bfd_seek (abfd, ardata->first_file_filepos, SEEK_SET) < 0)
5050 /* Notify the generic archive code that we have a symbol map. */
5051 bfd_has_map (abfd) = true;
5055 /* Begin preparing to write a SOM library symbol table.
5057 As part of the prep work we need to determine the number of symbols
5058 and the size of the associated string section. */
5061 som_bfd_prep_for_ar_write (abfd, num_syms, stringsize)
5063 unsigned int *num_syms, *stringsize;
5065 bfd *curr_bfd = abfd->archive_head;
5067 /* Some initialization. */
5071 /* Iterate over each BFD within this archive. */
5072 while (curr_bfd != NULL)
5074 unsigned int curr_count, i;
5075 som_symbol_type *sym;
5077 /* Don't bother for non-SOM objects. */
5078 if (curr_bfd->format != bfd_object
5079 || curr_bfd->xvec->flavour != bfd_target_som_flavour)
5081 curr_bfd = curr_bfd->next;
5085 /* Make sure the symbol table has been read, then snag a pointer
5086 to it. It's a little slimey to grab the symbols via obj_som_symtab,
5087 but doing so avoids allocating lots of extra memory. */
5088 if (som_slurp_symbol_table (curr_bfd) == false)
5091 sym = obj_som_symtab (curr_bfd);
5092 curr_count = bfd_get_symcount (curr_bfd);
5094 /* Examine each symbol to determine if it belongs in the
5095 library symbol table. */
5096 for (i = 0; i < curr_count; i++, sym++)
5098 struct som_misc_symbol_info info;
5100 /* Derive SOM information from the BFD symbol. */
5101 som_bfd_derive_misc_symbol_info (curr_bfd, &sym->symbol, &info);
5103 /* Should we include this symbol? */
5104 if (info.symbol_type == ST_NULL
5105 || info.symbol_type == ST_SYM_EXT
5106 || info.symbol_type == ST_ARG_EXT)
5109 /* Only global symbols and unsatisfied commons. */
5110 if (info.symbol_scope != SS_UNIVERSAL
5111 && info.symbol_type != ST_STORAGE)
5114 /* Do no include undefined symbols. */
5115 if (bfd_is_und_section (sym->symbol.section))
5118 /* Bump the various counters, being careful to honor
5119 alignment considerations in the string table. */
5121 *stringsize = *stringsize + strlen (sym->symbol.name) + 5;
5122 while (*stringsize % 4)
5126 curr_bfd = curr_bfd->next;
5131 /* Hash a symbol name based on the hashing algorithm presented in the
5134 som_bfd_ar_symbol_hash (symbol)
5137 unsigned int len = strlen (symbol->name);
5139 /* Names with length 1 are special. */
5141 return 0x1000100 | (symbol->name[0] << 16) | symbol->name[0];
5143 return ((len & 0x7f) << 24) | (symbol->name[1] << 16)
5144 | (symbol->name[len-2] << 8) | symbol->name[len-1];
5151 CONST char *filename = strrchr (file, '/');
5153 if (filename != NULL)
5160 /* Do the bulk of the work required to write the SOM library
5164 som_bfd_ar_write_symbol_stuff (abfd, nsyms, string_size, lst)
5166 unsigned int nsyms, string_size;
5167 struct lst_header lst;
5169 file_ptr lst_filepos;
5170 char *strings = NULL, *p;
5171 struct lst_symbol_record *lst_syms = NULL, *curr_lst_sym;
5173 unsigned int *hash_table = NULL;
5174 struct som_entry *som_dict = NULL;
5175 struct lst_symbol_record **last_hash_entry = NULL;
5176 unsigned int curr_som_offset, som_index, extended_name_length = 0;
5177 unsigned int maxname = abfd->xvec->ar_max_namelen;
5180 (unsigned int *) malloc (lst.hash_size * sizeof (unsigned int));
5181 if (hash_table == NULL && lst.hash_size != 0)
5183 bfd_set_error (bfd_error_no_memory);
5187 (struct som_entry *) malloc (lst.module_count
5188 * sizeof (struct som_entry));
5189 if (som_dict == NULL && lst.module_count != 0)
5191 bfd_set_error (bfd_error_no_memory);
5196 ((struct lst_symbol_record **)
5197 malloc (lst.hash_size * sizeof (struct lst_symbol_record *)));
5198 if (last_hash_entry == NULL && lst.hash_size != 0)
5200 bfd_set_error (bfd_error_no_memory);
5204 /* Lots of fields are file positions relative to the start
5205 of the lst record. So save its location. */
5206 lst_filepos = bfd_tell (abfd) - sizeof (struct lst_header);
5208 /* Some initialization. */
5209 memset (hash_table, 0, 4 * lst.hash_size);
5210 memset (som_dict, 0, lst.module_count * sizeof (struct som_entry));
5211 memset (last_hash_entry, 0,
5212 lst.hash_size * sizeof (struct lst_symbol_record *));
5214 /* Symbols have som_index fields, so we have to keep track of the
5215 index of each SOM in the archive.
5217 The SOM dictionary has (among other things) the absolute file
5218 position for the SOM which a particular dictionary entry
5219 describes. We have to compute that information as we iterate
5220 through the SOMs/symbols. */
5222 curr_som_offset = 8 + 2 * sizeof (struct ar_hdr) + lst.file_end;
5224 /* Yow! We have to know the size of the extended name table
5226 for (curr_bfd = abfd->archive_head;
5228 curr_bfd = curr_bfd->next)
5230 CONST char *normal = normalize (curr_bfd->filename);
5231 unsigned int thislen;
5235 bfd_set_error (bfd_error_no_memory);
5238 thislen = strlen (normal);
5239 if (thislen > maxname)
5240 extended_name_length += thislen + 1;
5243 /* Make room for the archive header and the contents of the
5244 extended string table. */
5245 if (extended_name_length)
5246 curr_som_offset += extended_name_length + sizeof (struct ar_hdr);
5248 /* Make sure we're properly aligned. */
5249 curr_som_offset = (curr_som_offset + 0x1) & ~0x1;
5251 /* FIXME should be done with buffers just like everything else... */
5252 lst_syms = malloc (nsyms * sizeof (struct lst_symbol_record));
5253 if (lst_syms == NULL && nsyms != 0)
5255 bfd_set_error (bfd_error_no_memory);
5258 strings = malloc (string_size);
5259 if (strings == NULL && string_size != 0)
5261 bfd_set_error (bfd_error_no_memory);
5266 curr_lst_sym = lst_syms;
5268 curr_bfd = abfd->archive_head;
5269 while (curr_bfd != NULL)
5271 unsigned int curr_count, i;
5272 som_symbol_type *sym;
5274 /* Don't bother for non-SOM objects. */
5275 if (curr_bfd->format != bfd_object
5276 || curr_bfd->xvec->flavour != bfd_target_som_flavour)
5278 curr_bfd = curr_bfd->next;
5282 /* Make sure the symbol table has been read, then snag a pointer
5283 to it. It's a little slimey to grab the symbols via obj_som_symtab,
5284 but doing so avoids allocating lots of extra memory. */
5285 if (som_slurp_symbol_table (curr_bfd) == false)
5288 sym = obj_som_symtab (curr_bfd);
5289 curr_count = bfd_get_symcount (curr_bfd);
5291 for (i = 0; i < curr_count; i++, sym++)
5293 struct som_misc_symbol_info info;
5295 /* Derive SOM information from the BFD symbol. */
5296 som_bfd_derive_misc_symbol_info (curr_bfd, &sym->symbol, &info);
5298 /* Should we include this symbol? */
5299 if (info.symbol_type == ST_NULL
5300 || info.symbol_type == ST_SYM_EXT
5301 || info.symbol_type == ST_ARG_EXT)
5304 /* Only global symbols and unsatisfied commons. */
5305 if (info.symbol_scope != SS_UNIVERSAL
5306 && info.symbol_type != ST_STORAGE)
5309 /* Do no include undefined symbols. */
5310 if (bfd_is_und_section (sym->symbol.section))
5313 /* If this is the first symbol from this SOM, then update
5314 the SOM dictionary too. */
5315 if (som_dict[som_index].location == 0)
5317 som_dict[som_index].location = curr_som_offset;
5318 som_dict[som_index].length = arelt_size (curr_bfd);
5321 /* Fill in the lst symbol record. */
5322 curr_lst_sym->hidden = 0;
5323 curr_lst_sym->secondary_def = 0;
5324 curr_lst_sym->symbol_type = info.symbol_type;
5325 curr_lst_sym->symbol_scope = info.symbol_scope;
5326 curr_lst_sym->check_level = 0;
5327 curr_lst_sym->must_qualify = 0;
5328 curr_lst_sym->initially_frozen = 0;
5329 curr_lst_sym->memory_resident = 0;
5330 curr_lst_sym->is_common = bfd_is_com_section (sym->symbol.section);
5331 curr_lst_sym->dup_common = 0;
5332 curr_lst_sym->xleast = 0;
5333 curr_lst_sym->arg_reloc = info.arg_reloc;
5334 curr_lst_sym->name.n_strx = p - strings + 4;
5335 curr_lst_sym->qualifier_name.n_strx = 0;
5336 curr_lst_sym->symbol_info = info.symbol_info;
5337 curr_lst_sym->symbol_value = info.symbol_value;
5338 curr_lst_sym->symbol_descriptor = 0;
5339 curr_lst_sym->reserved = 0;
5340 curr_lst_sym->som_index = som_index;
5341 curr_lst_sym->symbol_key = som_bfd_ar_symbol_hash (&sym->symbol);
5342 curr_lst_sym->next_entry = 0;
5344 /* Insert into the hash table. */
5345 if (hash_table[curr_lst_sym->symbol_key % lst.hash_size])
5347 struct lst_symbol_record *tmp;
5349 /* There is already something at the head of this hash chain,
5350 so tack this symbol onto the end of the chain. */
5351 tmp = last_hash_entry[curr_lst_sym->symbol_key % lst.hash_size];
5353 = (curr_lst_sym - lst_syms) * sizeof (struct lst_symbol_record)
5355 + lst.module_count * sizeof (struct som_entry)
5356 + sizeof (struct lst_header);
5360 /* First entry in this hash chain. */
5361 hash_table[curr_lst_sym->symbol_key % lst.hash_size]
5362 = (curr_lst_sym - lst_syms) * sizeof (struct lst_symbol_record)
5364 + lst.module_count * sizeof (struct som_entry)
5365 + sizeof (struct lst_header);
5368 /* Keep track of the last symbol we added to this chain so we can
5369 easily update its next_entry pointer. */
5370 last_hash_entry[curr_lst_sym->symbol_key % lst.hash_size]
5374 /* Update the string table. */
5375 bfd_put_32 (abfd, strlen (sym->symbol.name), p);
5377 strcpy (p, sym->symbol.name);
5378 p += strlen (sym->symbol.name) + 1;
5381 bfd_put_8 (abfd, 0, p);
5385 /* Head to the next symbol. */
5389 /* Keep track of where each SOM will finally reside; then look
5391 curr_som_offset += arelt_size (curr_bfd) + sizeof (struct ar_hdr);
5392 curr_bfd = curr_bfd->next;
5396 /* Now scribble out the hash table. */
5397 if (bfd_write ((PTR) hash_table, lst.hash_size, 4, abfd)
5398 != lst.hash_size * 4)
5401 /* Then the SOM dictionary. */
5402 if (bfd_write ((PTR) som_dict, lst.module_count,
5403 sizeof (struct som_entry), abfd)
5404 != lst.module_count * sizeof (struct som_entry))
5407 /* The library symbols. */
5408 if (bfd_write ((PTR) lst_syms, nsyms, sizeof (struct lst_symbol_record), abfd)
5409 != nsyms * sizeof (struct lst_symbol_record))
5412 /* And finally the strings. */
5413 if (bfd_write ((PTR) strings, string_size, 1, abfd) != string_size)
5416 if (hash_table != NULL)
5418 if (som_dict != NULL)
5420 if (last_hash_entry != NULL)
5421 free (last_hash_entry);
5422 if (lst_syms != NULL)
5424 if (strings != NULL)
5429 if (hash_table != NULL)
5431 if (som_dict != NULL)
5433 if (last_hash_entry != NULL)
5434 free (last_hash_entry);
5435 if (lst_syms != NULL)
5437 if (strings != NULL)
5443 /* SOM almost uses the SVR4 style extended name support, but not
5447 som_construct_extended_name_table (abfd, tabloc, tablen, name)
5450 bfd_size_type *tablen;
5454 return _bfd_construct_extended_name_table (abfd, false, tabloc, tablen);
5457 /* Write out the LST for the archive.
5459 You'll never believe this is really how armaps are handled in SOM... */
5463 som_write_armap (abfd, elength, map, orl_count, stridx)
5465 unsigned int elength;
5467 unsigned int orl_count;
5471 struct stat statbuf;
5472 unsigned int i, lst_size, nsyms, stringsize;
5474 struct lst_header lst;
5477 /* We'll use this for the archive's date and mode later. */
5478 if (stat (abfd->filename, &statbuf) != 0)
5480 bfd_set_error (bfd_error_system_call);
5484 bfd_ardata (abfd)->armap_timestamp = statbuf.st_mtime + 60;
5486 /* Account for the lst header first. */
5487 lst_size = sizeof (struct lst_header);
5489 /* Start building the LST header. */
5490 lst.system_id = CPU_PA_RISC1_0;
5491 lst.a_magic = LIBMAGIC;
5492 lst.version_id = VERSION_ID;
5493 lst.file_time.secs = 0;
5494 lst.file_time.nanosecs = 0;
5496 lst.hash_loc = lst_size;
5497 lst.hash_size = SOM_LST_HASH_SIZE;
5499 /* Hash table is a SOM_LST_HASH_SIZE 32bit offsets. */
5500 lst_size += 4 * SOM_LST_HASH_SIZE;
5502 /* We need to count the number of SOMs in this archive. */
5503 curr_bfd = abfd->archive_head;
5504 lst.module_count = 0;
5505 while (curr_bfd != NULL)
5507 /* Only true SOM objects count. */
5508 if (curr_bfd->format == bfd_object
5509 && curr_bfd->xvec->flavour == bfd_target_som_flavour)
5511 curr_bfd = curr_bfd->next;
5513 lst.module_limit = lst.module_count;
5514 lst.dir_loc = lst_size;
5515 lst_size += sizeof (struct som_entry) * lst.module_count;
5517 /* We don't support import/export tables, auxiliary headers,
5518 or free lists yet. Make the linker work a little harder
5519 to make our life easier. */
5522 lst.export_count = 0;
5527 /* Count how many symbols we will have on the hash chains and the
5528 size of the associated string table. */
5529 if (som_bfd_prep_for_ar_write (abfd, &nsyms, &stringsize) == false)
5532 lst_size += sizeof (struct lst_symbol_record) * nsyms;
5534 /* For the string table. One day we might actually use this info
5535 to avoid small seeks/reads when reading archives. */
5536 lst.string_loc = lst_size;
5537 lst.string_size = stringsize;
5538 lst_size += stringsize;
5540 /* SOM ABI says this must be zero. */
5542 lst.file_end = lst_size;
5544 /* Compute the checksum. Must happen after the entire lst header
5548 for (i = 0; i < sizeof (struct lst_header)/sizeof (int) - 1; i++)
5549 lst.checksum ^= *p++;
5551 sprintf (hdr.ar_name, "/ ");
5552 sprintf (hdr.ar_date, "%ld", bfd_ardata (abfd)->armap_timestamp);
5553 sprintf (hdr.ar_uid, "%ld", (long) getuid ());
5554 sprintf (hdr.ar_gid, "%ld", (long) getgid ());
5555 sprintf (hdr.ar_mode, "%-8o", (unsigned int) statbuf.st_mode);
5556 sprintf (hdr.ar_size, "%-10d", (int) lst_size);
5557 hdr.ar_fmag[0] = '`';
5558 hdr.ar_fmag[1] = '\012';
5560 /* Turn any nulls into spaces. */
5561 for (i = 0; i < sizeof (struct ar_hdr); i++)
5562 if (((char *) (&hdr))[i] == '\0')
5563 (((char *) (&hdr))[i]) = ' ';
5565 /* Scribble out the ar header. */
5566 if (bfd_write ((PTR) &hdr, 1, sizeof (struct ar_hdr), abfd)
5567 != sizeof (struct ar_hdr))
5570 /* Now scribble out the lst header. */
5571 if (bfd_write ((PTR) &lst, 1, sizeof (struct lst_header), abfd)
5572 != sizeof (struct lst_header))
5575 /* Build and write the armap. */
5576 if (som_bfd_ar_write_symbol_stuff (abfd, nsyms, stringsize, lst) == false)
5583 /* Free all information we have cached for this BFD. We can always
5584 read it again later if we need it. */
5587 som_bfd_free_cached_info (abfd)
5592 if (bfd_get_format (abfd) != bfd_object)
5595 #define FREE(x) if (x != NULL) { free (x); x = NULL; }
5596 /* Free the native string and symbol tables. */
5597 FREE (obj_som_symtab (abfd));
5598 FREE (obj_som_stringtab (abfd));
5599 for (o = abfd->sections; o != (asection *) NULL; o = o->next)
5601 /* Free the native relocations. */
5602 o->reloc_count = -1;
5603 FREE (som_section_data (o)->reloc_stream);
5604 /* Free the generic relocations. */
5605 FREE (o->relocation);
5612 /* End of miscellaneous support functions. */
5614 #define som_close_and_cleanup som_bfd_free_cached_info
5616 #define som_openr_next_archived_file bfd_generic_openr_next_archived_file
5617 #define som_generic_stat_arch_elt bfd_generic_stat_arch_elt
5618 #define som_truncate_arname bfd_bsd_truncate_arname
5619 #define som_slurp_extended_name_table _bfd_slurp_extended_name_table
5620 #define som_update_armap_timestamp bfd_true
5622 #define som_get_lineno _bfd_nosymbols_get_lineno
5623 #define som_bfd_make_debug_symbol _bfd_nosymbols_bfd_make_debug_symbol
5625 #define som_bfd_get_relocated_section_contents \
5626 bfd_generic_get_relocated_section_contents
5627 #define som_bfd_relax_section bfd_generic_relax_section
5628 #define som_bfd_link_hash_table_create _bfd_generic_link_hash_table_create
5629 #define som_bfd_link_add_symbols _bfd_generic_link_add_symbols
5630 #define som_bfd_final_link _bfd_generic_final_link
5632 const bfd_target som_vec =
5635 bfd_target_som_flavour,
5636 true, /* target byte order */
5637 true, /* target headers byte order */
5638 (HAS_RELOC | EXEC_P | /* object flags */
5639 HAS_LINENO | HAS_DEBUG |
5640 HAS_SYMS | HAS_LOCALS | WP_TEXT | D_PAGED | DYNAMIC),
5641 (SEC_CODE | SEC_DATA | SEC_ROM | SEC_HAS_CONTENTS
5642 | SEC_ALLOC | SEC_LOAD | SEC_RELOC), /* section flags */
5644 /* leading_symbol_char: is the first char of a user symbol
5645 predictable, and if so what is it */
5647 '/', /* ar_pad_char */
5648 14, /* ar_max_namelen */
5649 3, /* minimum alignment */
5650 bfd_getb64, bfd_getb_signed_64, bfd_putb64,
5651 bfd_getb32, bfd_getb_signed_32, bfd_putb32,
5652 bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* data */
5653 bfd_getb64, bfd_getb_signed_64, bfd_putb64,
5654 bfd_getb32, bfd_getb_signed_32, bfd_putb32,
5655 bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* hdrs */
5657 som_object_p, /* bfd_check_format */
5658 bfd_generic_archive_p,
5664 _bfd_generic_mkarchive,
5669 som_write_object_contents,
5670 _bfd_write_archive_contents,
5675 BFD_JUMP_TABLE_GENERIC (som),
5676 BFD_JUMP_TABLE_COPY (som),
5677 BFD_JUMP_TABLE_CORE (_bfd_nocore),
5678 BFD_JUMP_TABLE_ARCHIVE (som),
5679 BFD_JUMP_TABLE_SYMBOLS (som),
5680 BFD_JUMP_TABLE_RELOCS (som),
5681 BFD_JUMP_TABLE_WRITE (som),
5682 BFD_JUMP_TABLE_LINK (som),
5683 BFD_JUMP_TABLE_DYNAMIC (_bfd_nodynamic),
5688 #endif /* HOST_HPPAHPUX || HOST_HPPABSD || HOST_HPPAOSF */