1 /* bfd back-end for HP PA-RISC SOM objects.
2 Copyright (C) 1990, 1991, 1992, 1993, 1994 Free Software Foundation, Inc.
4 Contributed by the Center for Software Science at the
5 University of Utah (pa-gdb-bugs@cs.utah.edu).
7 This file is part of BFD, the Binary File Descriptor library.
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
26 #if defined (HOST_HPPAHPUX) || defined (HOST_HPPABSD) || defined (HOST_HPPAOSF)
32 #include <sys/types.h>
33 #include <sys/param.h>
36 #include <machine/reg.h>
37 #include <sys/user.h> /* After a.out.h */
41 /* Magic not defined in standard HP-UX header files until 8.0 */
43 #ifndef CPU_PA_RISC1_0
44 #define CPU_PA_RISC1_0 0x20B
45 #endif /* CPU_PA_RISC1_0 */
47 #ifndef CPU_PA_RISC1_1
48 #define CPU_PA_RISC1_1 0x210
49 #endif /* CPU_PA_RISC1_1 */
51 #ifndef _PA_RISC1_0_ID
52 #define _PA_RISC1_0_ID CPU_PA_RISC1_0
53 #endif /* _PA_RISC1_0_ID */
55 #ifndef _PA_RISC1_1_ID
56 #define _PA_RISC1_1_ID CPU_PA_RISC1_1
57 #endif /* _PA_RISC1_1_ID */
59 #ifndef _PA_RISC_MAXID
60 #define _PA_RISC_MAXID 0x2FF
61 #endif /* _PA_RISC_MAXID */
64 #define _PA_RISC_ID(__m_num) \
65 (((__m_num) == _PA_RISC1_0_ID) || \
66 ((__m_num) >= _PA_RISC1_1_ID && (__m_num) <= _PA_RISC_MAXID))
67 #endif /* _PA_RISC_ID */
69 /* Size (in chars) of the temporary buffers used during fixup and string
72 #define SOM_TMP_BUFSIZE 8192
74 /* Size of the hash table in archives. */
75 #define SOM_LST_HASH_SIZE 31
77 /* Max number of SOMs to be found in an archive. */
78 #define SOM_LST_MODULE_LIMIT 1024
80 /* Generic alignment macro. */
81 #define SOM_ALIGN(val, alignment) \
82 (((val) + (alignment) - 1) & ~((alignment) - 1))
84 /* SOM allows any one of the four previous relocations to be reused
85 with a "R_PREV_FIXUP" relocation entry. Since R_PREV_FIXUP
86 relocations are always a single byte, using a R_PREV_FIXUP instead
87 of some multi-byte relocation makes object files smaller.
89 Note one side effect of using a R_PREV_FIXUP is the relocation that
90 is being repeated moves to the front of the queue. */
97 /* This fully describes the symbol types which may be attached to
98 an EXPORT or IMPORT directive. Only SOM uses this formation
99 (ELF has no need for it). */
103 SYMBOL_TYPE_ABSOLUTE,
107 SYMBOL_TYPE_MILLICODE,
109 SYMBOL_TYPE_PRI_PROG,
110 SYMBOL_TYPE_SEC_PROG,
113 struct section_to_type
119 /* Assorted symbol information that needs to be derived from the BFD symbol
120 and/or the BFD backend private symbol data. */
121 struct som_misc_symbol_info
123 unsigned int symbol_type;
124 unsigned int symbol_scope;
125 unsigned int arg_reloc;
126 unsigned int symbol_info;
127 unsigned int symbol_value;
130 /* Forward declarations */
132 static boolean som_mkobject PARAMS ((bfd *));
133 static bfd_target * som_object_setup PARAMS ((bfd *,
135 struct som_exec_auxhdr *));
136 static boolean setup_sections PARAMS ((bfd *, struct header *));
137 static bfd_target * som_object_p PARAMS ((bfd *));
138 static boolean som_write_object_contents PARAMS ((bfd *));
139 static boolean som_slurp_string_table PARAMS ((bfd *));
140 static unsigned int som_slurp_symbol_table PARAMS ((bfd *));
141 static long som_get_symtab_upper_bound PARAMS ((bfd *));
142 static long som_canonicalize_reloc PARAMS ((bfd *, sec_ptr,
143 arelent **, asymbol **));
144 static long som_get_reloc_upper_bound PARAMS ((bfd *, sec_ptr));
145 static unsigned int som_set_reloc_info PARAMS ((unsigned char *, unsigned int,
146 arelent *, asection *,
147 asymbol **, boolean));
148 static boolean som_slurp_reloc_table PARAMS ((bfd *, asection *,
149 asymbol **, boolean));
150 static long som_get_symtab PARAMS ((bfd *, asymbol **));
151 static asymbol * som_make_empty_symbol PARAMS ((bfd *));
152 static void som_print_symbol PARAMS ((bfd *, PTR,
153 asymbol *, bfd_print_symbol_type));
154 static boolean som_new_section_hook PARAMS ((bfd *, asection *));
155 static boolean som_bfd_copy_private_section_data PARAMS ((bfd *, asection *,
157 static boolean som_bfd_copy_private_bfd_data PARAMS ((bfd *, bfd *));
158 static boolean som_bfd_is_local_label PARAMS ((bfd *, asymbol *));
159 static boolean som_set_section_contents PARAMS ((bfd *, sec_ptr, PTR,
160 file_ptr, bfd_size_type));
161 static boolean som_get_section_contents PARAMS ((bfd *, sec_ptr, PTR,
162 file_ptr, bfd_size_type));
163 static boolean som_set_arch_mach PARAMS ((bfd *, enum bfd_architecture,
165 static boolean som_find_nearest_line PARAMS ((bfd *, asection *,
170 static void som_get_symbol_info PARAMS ((bfd *, asymbol *, symbol_info *));
171 static asection * bfd_section_from_som_symbol PARAMS ((bfd *,
172 struct symbol_dictionary_record *));
173 static int log2 PARAMS ((unsigned int));
174 static bfd_reloc_status_type hppa_som_reloc PARAMS ((bfd *, arelent *,
178 static void som_initialize_reloc_queue PARAMS ((struct reloc_queue *));
179 static void som_reloc_queue_insert PARAMS ((unsigned char *, unsigned int,
180 struct reloc_queue *));
181 static void som_reloc_queue_fix PARAMS ((struct reloc_queue *, unsigned int));
182 static int som_reloc_queue_find PARAMS ((unsigned char *, unsigned int,
183 struct reloc_queue *));
184 static unsigned char * try_prev_fixup PARAMS ((bfd *, int *, unsigned char *,
186 struct reloc_queue *));
188 static unsigned char * som_reloc_skip PARAMS ((bfd *, unsigned int,
189 unsigned char *, unsigned int *,
190 struct reloc_queue *));
191 static unsigned char * som_reloc_addend PARAMS ((bfd *, int, unsigned char *,
193 struct reloc_queue *));
194 static unsigned char * som_reloc_call PARAMS ((bfd *, unsigned char *,
197 struct reloc_queue *));
198 static unsigned long som_count_spaces PARAMS ((bfd *));
199 static unsigned long som_count_subspaces PARAMS ((bfd *));
200 static int compare_syms PARAMS ((asymbol **, asymbol **));
201 static unsigned long som_compute_checksum PARAMS ((bfd *));
202 static boolean som_prep_headers PARAMS ((bfd *));
203 static int som_sizeof_headers PARAMS ((bfd *, boolean));
204 static boolean som_write_headers PARAMS ((bfd *));
205 static boolean som_build_and_write_symbol_table PARAMS ((bfd *));
206 static void som_prep_for_fixups PARAMS ((bfd *, asymbol **, unsigned long));
207 static boolean som_write_fixups PARAMS ((bfd *, unsigned long, unsigned int *));
208 static boolean som_write_space_strings PARAMS ((bfd *, unsigned long,
210 static boolean som_write_symbol_strings PARAMS ((bfd *, unsigned long,
211 asymbol **, unsigned int,
213 static boolean som_begin_writing PARAMS ((bfd *));
214 static const reloc_howto_type * som_bfd_reloc_type_lookup
215 PARAMS ((bfd_arch_info_type *, bfd_reloc_code_real_type));
216 static char som_section_type PARAMS ((const char *));
217 static int som_decode_symclass PARAMS ((asymbol *));
218 static boolean som_bfd_count_ar_symbols PARAMS ((bfd *, struct lst_header *,
221 static boolean som_bfd_fill_in_ar_symbols PARAMS ((bfd *, struct lst_header *,
223 static boolean som_slurp_armap PARAMS ((bfd *));
224 static boolean som_write_armap PARAMS ((bfd *));
225 static void som_bfd_derive_misc_symbol_info PARAMS ((bfd *, asymbol *,
226 struct som_misc_symbol_info *));
227 static boolean som_bfd_prep_for_ar_write PARAMS ((bfd *, unsigned int *,
229 static unsigned int som_bfd_ar_symbol_hash PARAMS ((asymbol *));
230 static boolean som_bfd_ar_write_symbol_stuff PARAMS ((bfd *, unsigned int,
233 static CONST char *normalize PARAMS ((CONST char *file));
234 static boolean som_is_space PARAMS ((asection *));
235 static boolean som_is_subspace PARAMS ((asection *));
236 static boolean som_is_container PARAMS ((asection *, asection *));
237 static boolean som_bfd_free_cached_info PARAMS ((bfd *));
239 /* Map SOM section names to POSIX/BSD single-character symbol types.
241 This table includes all the standard subspaces as defined in the
242 current "PRO ABI for PA-RISC Systems", $UNWIND$ which for
243 some reason was left out, and sections specific to embedded stabs. */
245 static const struct section_to_type stt[] = {
247 {"$SHLIB_INFO$", 't'},
248 {"$MILLICODE$", 't'},
251 {"$UNWIND_START$", 't'},
255 {"$SHLIB_DATA$", 'd'},
257 {"$SHORTDATA$", 'g'},
262 {"$GDB_STRINGS$", 'N'},
263 {"$GDB_SYMBOLS$", 'N'},
267 /* About the relocation formatting table...
269 There are 256 entries in the table, one for each possible
270 relocation opcode available in SOM. We index the table by
271 the relocation opcode. The names and operations are those
272 defined by a.out_800 (4).
274 Right now this table is only used to count and perform minimal
275 processing on relocation streams so that they can be internalized
276 into BFD and symbolically printed by utilities. To make actual use
277 of them would be much more difficult, BFD's concept of relocations
278 is far too simple to handle SOM relocations. The basic assumption
279 that a relocation can be completely processed independent of other
280 relocations before an object file is written is invalid for SOM.
282 The SOM relocations are meant to be processed as a stream, they
283 specify copying of data from the input section to the output section
284 while possibly modifying the data in some manner. They also can
285 specify that a variable number of zeros or uninitialized data be
286 inserted on in the output segment at the current offset. Some
287 relocations specify that some previous relocation be re-applied at
288 the current location in the input/output sections. And finally a number
289 of relocations have effects on other sections (R_ENTRY, R_EXIT,
290 R_UNWIND_AUX and a variety of others). There isn't even enough room
291 in the BFD relocation data structure to store enough information to
292 perform all the relocations.
294 Each entry in the table has three fields.
296 The first entry is an index into this "class" of relocations. This
297 index can then be used as a variable within the relocation itself.
299 The second field is a format string which actually controls processing
300 of the relocation. It uses a simple postfix machine to do calculations
301 based on variables/constants found in the string and the relocation
304 The third field specifys whether or not this relocation may use
305 a constant (V) from the previous R_DATA_OVERRIDE rather than a constant
306 stored in the instruction.
310 L = input space byte count
311 D = index into class of relocations
312 M = output space byte count
313 N = statement number (unused?)
315 R = parameter relocation bits
317 U = 64 bits of stack unwind and frame size info (we only keep 32 bits)
318 V = a literal constant (usually used in the next relocation)
319 P = a previous relocation
321 Lower case letters (starting with 'b') refer to following
322 bytes in the relocation stream. 'b' is the next 1 byte,
323 c is the next 2 bytes, d is the next 3 bytes, etc...
324 This is the variable part of the relocation entries that
325 makes our life a living hell.
327 numerical constants are also used in the format string. Note
328 the constants are represented in decimal.
330 '+', "*" and "=" represents the obvious postfix operators.
331 '<' represents a left shift.
335 Parameter Relocation Bits:
339 Previous Relocations: The index field represents which in the queue
340 of 4 previous fixups should be re-applied.
342 Literal Constants: These are generally used to represent addend
343 parts of relocations when these constants are not stored in the
344 fields of the instructions themselves. For example the instruction
345 addil foo-$global$-0x1234 would use an override for "0x1234" rather
346 than storing it into the addil itself. */
354 static const struct fixup_format som_fixup_formats[256] =
356 /* R_NO_RELOCATION */
357 0, "LD1+4*=", /* 0x00 */
358 1, "LD1+4*=", /* 0x01 */
359 2, "LD1+4*=", /* 0x02 */
360 3, "LD1+4*=", /* 0x03 */
361 4, "LD1+4*=", /* 0x04 */
362 5, "LD1+4*=", /* 0x05 */
363 6, "LD1+4*=", /* 0x06 */
364 7, "LD1+4*=", /* 0x07 */
365 8, "LD1+4*=", /* 0x08 */
366 9, "LD1+4*=", /* 0x09 */
367 10, "LD1+4*=", /* 0x0a */
368 11, "LD1+4*=", /* 0x0b */
369 12, "LD1+4*=", /* 0x0c */
370 13, "LD1+4*=", /* 0x0d */
371 14, "LD1+4*=", /* 0x0e */
372 15, "LD1+4*=", /* 0x0f */
373 16, "LD1+4*=", /* 0x10 */
374 17, "LD1+4*=", /* 0x11 */
375 18, "LD1+4*=", /* 0x12 */
376 19, "LD1+4*=", /* 0x13 */
377 20, "LD1+4*=", /* 0x14 */
378 21, "LD1+4*=", /* 0x15 */
379 22, "LD1+4*=", /* 0x16 */
380 23, "LD1+4*=", /* 0x17 */
381 0, "LD8<b+1+4*=", /* 0x18 */
382 1, "LD8<b+1+4*=", /* 0x19 */
383 2, "LD8<b+1+4*=", /* 0x1a */
384 3, "LD8<b+1+4*=", /* 0x1b */
385 0, "LD16<c+1+4*=", /* 0x1c */
386 1, "LD16<c+1+4*=", /* 0x1d */
387 2, "LD16<c+1+4*=", /* 0x1e */
388 0, "Ld1+=", /* 0x1f */
390 0, "Lb1+4*=", /* 0x20 */
391 1, "Ld1+=", /* 0x21 */
393 0, "Lb1+4*=", /* 0x22 */
394 1, "Ld1+=", /* 0x23 */
397 /* R_DATA_ONE_SYMBOL */
398 0, "L4=Sb=", /* 0x25 */
399 1, "L4=Sd=", /* 0x26 */
401 0, "L4=Sb=", /* 0x27 */
402 1, "L4=Sd=", /* 0x28 */
405 /* R_REPEATED_INIT */
406 0, "L4=Mb1+4*=", /* 0x2a */
407 1, "Lb4*=Mb1+L*=", /* 0x2b */
408 2, "Lb4*=Md1+4*=", /* 0x2c */
409 3, "Ld1+=Me1+=", /* 0x2d */
414 0, "L4=RD=Sb=", /* 0x30 */
415 1, "L4=RD=Sb=", /* 0x31 */
416 2, "L4=RD=Sb=", /* 0x32 */
417 3, "L4=RD=Sb=", /* 0x33 */
418 4, "L4=RD=Sb=", /* 0x34 */
419 5, "L4=RD=Sb=", /* 0x35 */
420 6, "L4=RD=Sb=", /* 0x36 */
421 7, "L4=RD=Sb=", /* 0x37 */
422 8, "L4=RD=Sb=", /* 0x38 */
423 9, "L4=RD=Sb=", /* 0x39 */
424 0, "L4=RD8<b+=Sb=",/* 0x3a */
425 1, "L4=RD8<b+=Sb=",/* 0x3b */
426 0, "L4=RD8<b+=Sd=",/* 0x3c */
427 1, "L4=RD8<b+=Sd=",/* 0x3d */
432 0, "L4=RD=Sb=", /* 0x40 */
433 1, "L4=RD=Sb=", /* 0x41 */
434 2, "L4=RD=Sb=", /* 0x42 */
435 3, "L4=RD=Sb=", /* 0x43 */
436 4, "L4=RD=Sb=", /* 0x44 */
437 5, "L4=RD=Sb=", /* 0x45 */
438 6, "L4=RD=Sb=", /* 0x46 */
439 7, "L4=RD=Sb=", /* 0x47 */
440 8, "L4=RD=Sb=", /* 0x48 */
441 9, "L4=RD=Sb=", /* 0x49 */
442 0, "L4=RD8<b+=Sb=",/* 0x4a */
443 1, "L4=RD8<b+=Sb=",/* 0x4b */
444 0, "L4=RD8<b+=Sd=",/* 0x4c */
445 1, "L4=RD8<b+=Sd=",/* 0x4d */
450 0, "L4=SD=", /* 0x50 */
451 1, "L4=SD=", /* 0x51 */
452 2, "L4=SD=", /* 0x52 */
453 3, "L4=SD=", /* 0x53 */
454 4, "L4=SD=", /* 0x54 */
455 5, "L4=SD=", /* 0x55 */
456 6, "L4=SD=", /* 0x56 */
457 7, "L4=SD=", /* 0x57 */
458 8, "L4=SD=", /* 0x58 */
459 9, "L4=SD=", /* 0x59 */
460 10, "L4=SD=", /* 0x5a */
461 11, "L4=SD=", /* 0x5b */
462 12, "L4=SD=", /* 0x5c */
463 13, "L4=SD=", /* 0x5d */
464 14, "L4=SD=", /* 0x5e */
465 15, "L4=SD=", /* 0x5f */
466 16, "L4=SD=", /* 0x60 */
467 17, "L4=SD=", /* 0x61 */
468 18, "L4=SD=", /* 0x62 */
469 19, "L4=SD=", /* 0x63 */
470 20, "L4=SD=", /* 0x64 */
471 21, "L4=SD=", /* 0x65 */
472 22, "L4=SD=", /* 0x66 */
473 23, "L4=SD=", /* 0x67 */
474 24, "L4=SD=", /* 0x68 */
475 25, "L4=SD=", /* 0x69 */
476 26, "L4=SD=", /* 0x6a */
477 27, "L4=SD=", /* 0x6b */
478 28, "L4=SD=", /* 0x6c */
479 29, "L4=SD=", /* 0x6d */
480 30, "L4=SD=", /* 0x6e */
481 31, "L4=SD=", /* 0x6f */
482 32, "L4=Sb=", /* 0x70 */
483 33, "L4=Sd=", /* 0x71 */
492 0, "L4=Sb=", /* 0x78 */
493 1, "L4=Sd=", /* 0x79 */
501 /* R_CODE_ONE_SYMBOL */
502 0, "L4=SD=", /* 0x80 */
503 1, "L4=SD=", /* 0x81 */
504 2, "L4=SD=", /* 0x82 */
505 3, "L4=SD=", /* 0x83 */
506 4, "L4=SD=", /* 0x84 */
507 5, "L4=SD=", /* 0x85 */
508 6, "L4=SD=", /* 0x86 */
509 7, "L4=SD=", /* 0x87 */
510 8, "L4=SD=", /* 0x88 */
511 9, "L4=SD=", /* 0x89 */
512 10, "L4=SD=", /* 0x8q */
513 11, "L4=SD=", /* 0x8b */
514 12, "L4=SD=", /* 0x8c */
515 13, "L4=SD=", /* 0x8d */
516 14, "L4=SD=", /* 0x8e */
517 15, "L4=SD=", /* 0x8f */
518 16, "L4=SD=", /* 0x90 */
519 17, "L4=SD=", /* 0x91 */
520 18, "L4=SD=", /* 0x92 */
521 19, "L4=SD=", /* 0x93 */
522 20, "L4=SD=", /* 0x94 */
523 21, "L4=SD=", /* 0x95 */
524 22, "L4=SD=", /* 0x96 */
525 23, "L4=SD=", /* 0x97 */
526 24, "L4=SD=", /* 0x98 */
527 25, "L4=SD=", /* 0x99 */
528 26, "L4=SD=", /* 0x9a */
529 27, "L4=SD=", /* 0x9b */
530 28, "L4=SD=", /* 0x9c */
531 29, "L4=SD=", /* 0x9d */
532 30, "L4=SD=", /* 0x9e */
533 31, "L4=SD=", /* 0x9f */
534 32, "L4=Sb=", /* 0xa0 */
535 33, "L4=Sd=", /* 0xa1 */
550 0, "L4=Sb=", /* 0xae */
551 1, "L4=Sd=", /* 0xaf */
553 0, "L4=Sb=", /* 0xb0 */
554 1, "L4=Sd=", /* 0xb1 */
568 1, "Rb4*=", /* 0xb9 */
569 2, "Rd4*=", /* 0xba */
596 /* R_DATA_OVERRIDE */
609 0, "Ob=Sd=", /* 0xd1 */
611 0, "Ob=Ve=", /* 0xd2 */
661 static const int comp1_opcodes[] =
683 static const int comp2_opcodes[] =
692 static const int comp3_opcodes[] =
699 /* These apparently are not in older versions of hpux reloc.h. */
701 #define R_DLT_REL 0x78
705 #define R_AUX_UNWIND 0xcf
709 #define R_SEC_STMT 0xd7
712 static reloc_howto_type som_hppa_howto_table[] =
714 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
715 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
716 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
717 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
718 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
719 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
720 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
721 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
722 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
723 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
724 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
725 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
726 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
727 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
728 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
729 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
730 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
731 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
732 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
733 {R_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_ZEROES, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ZEROES"},
747 {R_ZEROES, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ZEROES"},
748 {R_UNINIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_UNINIT"},
749 {R_UNINIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_UNINIT"},
750 {R_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RELOCATION"},
751 {R_DATA_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_ONE_SYMBOL"},
752 {R_DATA_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_ONE_SYMBOL"},
753 {R_DATA_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_PLABEL"},
754 {R_DATA_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_PLABEL"},
755 {R_SPACE_REF, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_SPACE_REF"},
756 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
757 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
758 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
759 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
760 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
761 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
762 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
763 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
764 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
765 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
766 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
767 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
768 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
769 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
770 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
771 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
772 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
773 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
774 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
775 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
776 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
777 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
778 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
779 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
780 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
781 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
782 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
783 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
784 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
785 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
786 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
787 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
788 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
789 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
790 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
791 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
792 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
793 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
794 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
795 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
796 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
797 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
798 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
799 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
800 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
801 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
802 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
803 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
804 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
805 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
806 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
807 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
808 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
809 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
810 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
811 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
812 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
813 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
814 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
815 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
816 {R_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_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
830 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
831 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
832 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
833 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
834 {R_DLT_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DLT_REL"},
835 {R_DLT_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DLT_REL"},
836 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
837 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
838 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
839 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
840 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
841 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
842 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
843 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
844 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
845 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
846 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
847 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
848 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
849 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
850 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
851 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
852 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
853 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
854 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
855 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
856 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
857 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
858 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
859 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
860 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
861 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
862 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
863 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
864 {R_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_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
878 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
879 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
880 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
881 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
882 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
883 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
884 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
885 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
886 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
887 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
888 {R_MILLI_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_MILLI_REL"},
889 {R_MILLI_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_MILLI_REL"},
890 {R_CODE_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_PLABEL"},
891 {R_CODE_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_PLABEL"},
892 {R_BREAKPOINT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BREAKPOINT"},
893 {R_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ENTRY"},
894 {R_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ENTRY"},
895 {R_ALT_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ALT_ENTRY"},
896 {R_EXIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_EXIT"},
897 {R_BEGIN_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BEGIN_TRY"},
898 {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_TRY"},
899 {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_TRY"},
900 {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_TRY"},
901 {R_BEGIN_BRTAB, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BEGIN_BRTAB"},
902 {R_END_BRTAB, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_BRTAB"},
903 {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"},
904 {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"},
905 {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"},
906 {R_DATA_EXPR, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_EXPR"},
907 {R_CODE_EXPR, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_EXPR"},
908 {R_FSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_FSEL"},
909 {R_LSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_LSEL"},
910 {R_RSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RSEL"},
911 {R_N_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_N_MODE"},
912 {R_S_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_S_MODE"},
913 {R_D_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_D_MODE"},
914 {R_R_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_R_MODE"},
915 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
916 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
917 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
918 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
919 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
920 {R_TRANSLATED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_TRANSLATED"},
921 {R_AUX_UNWIND, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_AUX_UNWIND"},
922 {R_COMP1, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP1"},
923 {R_COMP2, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP2"},
924 {R_COMP3, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP3"},
925 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
926 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
927 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
928 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
929 {R_SEC_STMT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_SEC_STMT"},
930 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
931 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
932 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
933 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
934 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
935 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
936 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
937 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
938 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
939 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
940 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
941 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
942 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
943 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
944 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
945 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
946 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
947 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
948 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
949 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
950 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
951 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
952 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
953 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
954 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
955 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
956 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
957 {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"}};
971 /* Initialize the SOM relocation queue. By definition the queue holds
972 the last four multibyte fixups. */
975 som_initialize_reloc_queue (queue)
976 struct reloc_queue *queue;
978 queue[0].reloc = NULL;
980 queue[1].reloc = NULL;
982 queue[2].reloc = NULL;
984 queue[3].reloc = NULL;
988 /* Insert a new relocation into the relocation queue. */
991 som_reloc_queue_insert (p, size, queue)
994 struct reloc_queue *queue;
996 queue[3].reloc = queue[2].reloc;
997 queue[3].size = queue[2].size;
998 queue[2].reloc = queue[1].reloc;
999 queue[2].size = queue[1].size;
1000 queue[1].reloc = queue[0].reloc;
1001 queue[1].size = queue[0].size;
1003 queue[0].size = size;
1006 /* When an entry in the relocation queue is reused, the entry moves
1007 to the front of the queue. */
1010 som_reloc_queue_fix (queue, index)
1011 struct reloc_queue *queue;
1019 unsigned char *tmp1 = queue[0].reloc;
1020 unsigned int tmp2 = queue[0].size;
1021 queue[0].reloc = queue[1].reloc;
1022 queue[0].size = queue[1].size;
1023 queue[1].reloc = tmp1;
1024 queue[1].size = tmp2;
1030 unsigned char *tmp1 = queue[0].reloc;
1031 unsigned int tmp2 = queue[0].size;
1032 queue[0].reloc = queue[2].reloc;
1033 queue[0].size = queue[2].size;
1034 queue[2].reloc = queue[1].reloc;
1035 queue[2].size = queue[1].size;
1036 queue[1].reloc = tmp1;
1037 queue[1].size = tmp2;
1043 unsigned char *tmp1 = queue[0].reloc;
1044 unsigned int tmp2 = queue[0].size;
1045 queue[0].reloc = queue[3].reloc;
1046 queue[0].size = queue[3].size;
1047 queue[3].reloc = queue[2].reloc;
1048 queue[3].size = queue[2].size;
1049 queue[2].reloc = queue[1].reloc;
1050 queue[2].size = queue[1].size;
1051 queue[1].reloc = tmp1;
1052 queue[1].size = tmp2;
1058 /* Search for a particular relocation in the relocation queue. */
1061 som_reloc_queue_find (p, size, queue)
1064 struct reloc_queue *queue;
1066 if (queue[0].reloc && !bcmp (p, queue[0].reloc, size)
1067 && size == queue[0].size)
1069 if (queue[1].reloc && !bcmp (p, queue[1].reloc, size)
1070 && size == queue[1].size)
1072 if (queue[2].reloc && !bcmp (p, queue[2].reloc, size)
1073 && size == queue[2].size)
1075 if (queue[3].reloc && !bcmp (p, queue[3].reloc, size)
1076 && size == queue[3].size)
1081 static unsigned char *
1082 try_prev_fixup (abfd, subspace_reloc_sizep, p, size, queue)
1084 int *subspace_reloc_sizep;
1087 struct reloc_queue *queue;
1089 int queue_index = som_reloc_queue_find (p, size, queue);
1091 if (queue_index != -1)
1093 /* Found this in a previous fixup. Undo the fixup we
1094 just built and use R_PREV_FIXUP instead. We saved
1095 a total of size - 1 bytes in the fixup stream. */
1096 bfd_put_8 (abfd, R_PREV_FIXUP + queue_index, p);
1098 *subspace_reloc_sizep += 1;
1099 som_reloc_queue_fix (queue, queue_index);
1103 som_reloc_queue_insert (p, size, queue);
1104 *subspace_reloc_sizep += size;
1110 /* Emit the proper R_NO_RELOCATION fixups to map the next SKIP
1111 bytes without any relocation. Update the size of the subspace
1112 relocation stream via SUBSPACE_RELOC_SIZE_P; also return the
1113 current pointer into the relocation stream. */
1115 static unsigned char *
1116 som_reloc_skip (abfd, skip, p, subspace_reloc_sizep, queue)
1120 unsigned int *subspace_reloc_sizep;
1121 struct reloc_queue *queue;
1123 /* Use a 4 byte R_NO_RELOCATION entry with a maximal value
1124 then R_PREV_FIXUPs to get the difference down to a
1126 if (skip >= 0x1000000)
1129 bfd_put_8 (abfd, R_NO_RELOCATION + 31, p);
1130 bfd_put_8 (abfd, 0xff, p + 1);
1131 bfd_put_16 (abfd, 0xffff, p + 2);
1132 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue);
1133 while (skip >= 0x1000000)
1136 bfd_put_8 (abfd, R_PREV_FIXUP, p);
1138 *subspace_reloc_sizep += 1;
1139 /* No need to adjust queue here since we are repeating the
1140 most recent fixup. */
1144 /* The difference must be less than 0x1000000. Use one
1145 more R_NO_RELOCATION entry to get to the right difference. */
1146 if ((skip & 3) == 0 && skip <= 0xc0000 && skip > 0)
1148 /* Difference can be handled in a simple single-byte
1149 R_NO_RELOCATION entry. */
1152 bfd_put_8 (abfd, R_NO_RELOCATION + (skip >> 2) - 1, p);
1153 *subspace_reloc_sizep += 1;
1156 /* Handle it with a two byte R_NO_RELOCATION entry. */
1157 else if (skip <= 0x1000)
1159 bfd_put_8 (abfd, R_NO_RELOCATION + 24 + (((skip >> 2) - 1) >> 8), p);
1160 bfd_put_8 (abfd, (skip >> 2) - 1, p + 1);
1161 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1163 /* Handle it with a three byte R_NO_RELOCATION entry. */
1166 bfd_put_8 (abfd, R_NO_RELOCATION + 28 + (((skip >> 2) - 1) >> 16), p);
1167 bfd_put_16 (abfd, (skip >> 2) - 1, p + 1);
1168 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue);
1171 /* Ugh. Punt and use a 4 byte entry. */
1174 bfd_put_8 (abfd, R_NO_RELOCATION + 31, p);
1175 bfd_put_8 (abfd, skip >> 16, p + 1);
1176 bfd_put_16 (abfd, skip, p + 2);
1177 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue);
1182 /* Emit the proper R_DATA_OVERRIDE fixups to handle a nonzero addend
1183 from a BFD relocation. Update the size of the subspace relocation
1184 stream via SUBSPACE_RELOC_SIZE_P; also return the current pointer
1185 into the relocation stream. */
1187 static unsigned char *
1188 som_reloc_addend (abfd, addend, p, subspace_reloc_sizep, queue)
1192 unsigned int *subspace_reloc_sizep;
1193 struct reloc_queue *queue;
1195 if ((unsigned)(addend) + 0x80 < 0x100)
1197 bfd_put_8 (abfd, R_DATA_OVERRIDE + 1, p);
1198 bfd_put_8 (abfd, addend, p + 1);
1199 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1201 else if ((unsigned) (addend) + 0x8000 < 0x10000)
1203 bfd_put_8 (abfd, R_DATA_OVERRIDE + 2, p);
1204 bfd_put_16 (abfd, addend, p + 1);
1205 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue);
1207 else if ((unsigned) (addend) + 0x800000 < 0x1000000)
1209 bfd_put_8 (abfd, R_DATA_OVERRIDE + 3, p);
1210 bfd_put_8 (abfd, addend >> 16, p + 1);
1211 bfd_put_16 (abfd, addend, p + 2);
1212 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue);
1216 bfd_put_8 (abfd, R_DATA_OVERRIDE + 4, p);
1217 bfd_put_32 (abfd, addend, p + 1);
1218 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 5, queue);
1223 /* Handle a single function call relocation. */
1225 static unsigned char *
1226 som_reloc_call (abfd, p, subspace_reloc_sizep, bfd_reloc, sym_num, queue)
1229 unsigned int *subspace_reloc_sizep;
1232 struct reloc_queue *queue;
1234 int arg_bits = HPPA_R_ARG_RELOC (bfd_reloc->addend);
1235 int rtn_bits = arg_bits & 0x3;
1238 /* You'll never believe all this is necessary to handle relocations
1239 for function calls. Having to compute and pack the argument
1240 relocation bits is the real nightmare.
1242 If you're interested in how this works, just forget it. You really
1243 do not want to know about this braindamage. */
1245 /* First see if this can be done with a "simple" relocation. Simple
1246 relocations have a symbol number < 0x100 and have simple encodings
1247 of argument relocations. */
1249 if (sym_num < 0x100)
1261 case 1 << 8 | 1 << 6:
1262 case 1 << 8 | 1 << 6 | 1:
1265 case 1 << 8 | 1 << 6 | 1 << 4:
1266 case 1 << 8 | 1 << 6 | 1 << 4 | 1:
1269 case 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2:
1270 case 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2 | 1:
1274 /* Not one of the easy encodings. This will have to be
1275 handled by the more complex code below. */
1281 /* Account for the return value too. */
1285 /* Emit a 2 byte relocation. Then see if it can be handled
1286 with a relocation which is already in the relocation queue. */
1287 bfd_put_8 (abfd, bfd_reloc->howto->type + type, p);
1288 bfd_put_8 (abfd, sym_num, p + 1);
1289 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1294 /* If this could not be handled with a simple relocation, then do a hard
1295 one. Hard relocations occur if the symbol number was too high or if
1296 the encoding of argument relocation bits is too complex. */
1299 /* Don't ask about these magic sequences. I took them straight
1300 from gas-1.36 which took them from the a.out man page. */
1302 if ((arg_bits >> 6 & 0xf) == 0xe)
1305 type += (3 * (arg_bits >> 8 & 3) + (arg_bits >> 6 & 3)) * 40;
1306 if ((arg_bits >> 2 & 0xf) == 0xe)
1309 type += (3 * (arg_bits >> 4 & 3) + (arg_bits >> 2 & 3)) * 4;
1311 /* Output the first two bytes of the relocation. These describe
1312 the length of the relocation and encoding style. */
1313 bfd_put_8 (abfd, bfd_reloc->howto->type + 10
1314 + 2 * (sym_num >= 0x100) + (type >= 0x100),
1316 bfd_put_8 (abfd, type, p + 1);
1318 /* Now output the symbol index and see if this bizarre relocation
1319 just happened to be in the relocation queue. */
1320 if (sym_num < 0x100)
1322 bfd_put_8 (abfd, sym_num, p + 2);
1323 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue);
1327 bfd_put_8 (abfd, sym_num >> 16, p + 2);
1328 bfd_put_16 (abfd, sym_num, p + 3);
1329 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 5, queue);
1336 /* Return the logarithm of X, base 2, considering X unsigned.
1337 Abort -1 if X is not a power or two or is zero. */
1345 /* Test for 0 or a power of 2. */
1346 if (x == 0 || x != (x & -x))
1349 while ((x >>= 1) != 0)
1354 static bfd_reloc_status_type
1355 hppa_som_reloc (abfd, reloc_entry, symbol_in, data,
1356 input_section, output_bfd, error_message)
1358 arelent *reloc_entry;
1361 asection *input_section;
1363 char **error_message;
1367 reloc_entry->address += input_section->output_offset;
1368 return bfd_reloc_ok;
1370 return bfd_reloc_ok;
1373 /* Given a generic HPPA relocation type, the instruction format,
1374 and a field selector, return one or more appropriate SOM relocations. */
1377 hppa_som_gen_reloc_type (abfd, base_type, format, field)
1381 enum hppa_reloc_field_selector_type_alt field;
1383 int *final_type, **final_types;
1385 final_types = (int **) bfd_alloc_by_size_t (abfd, sizeof (int *) * 3);
1386 final_type = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1387 if (!final_types || !final_type)
1389 bfd_set_error (bfd_error_no_memory);
1393 /* The field selector may require additional relocations to be
1394 generated. It's impossible to know at this moment if additional
1395 relocations will be needed, so we make them. The code to actually
1396 write the relocation/fixup stream is responsible for removing
1397 any redundant relocations. */
1404 final_types[0] = final_type;
1405 final_types[1] = NULL;
1406 final_types[2] = NULL;
1407 *final_type = base_type;
1413 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1414 if (!final_types[0])
1416 bfd_set_error (bfd_error_no_memory);
1419 if (field == e_tsel)
1420 *final_types[0] = R_FSEL;
1421 else if (field == e_ltsel)
1422 *final_types[0] = R_LSEL;
1424 *final_types[0] = R_RSEL;
1425 final_types[1] = final_type;
1426 final_types[2] = NULL;
1427 *final_type = base_type;
1432 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1433 if (!final_types[0])
1435 bfd_set_error (bfd_error_no_memory);
1438 *final_types[0] = R_S_MODE;
1439 final_types[1] = final_type;
1440 final_types[2] = NULL;
1441 *final_type = base_type;
1446 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1447 if (!final_types[0])
1449 bfd_set_error (bfd_error_no_memory);
1452 *final_types[0] = R_N_MODE;
1453 final_types[1] = final_type;
1454 final_types[2] = NULL;
1455 *final_type = base_type;
1460 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1461 if (!final_types[0])
1463 bfd_set_error (bfd_error_no_memory);
1466 *final_types[0] = R_D_MODE;
1467 final_types[1] = final_type;
1468 final_types[2] = NULL;
1469 *final_type = base_type;
1474 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1475 if (!final_types[0])
1477 bfd_set_error (bfd_error_no_memory);
1480 *final_types[0] = R_R_MODE;
1481 final_types[1] = final_type;
1482 final_types[2] = NULL;
1483 *final_type = base_type;
1490 /* PLABELs get their own relocation type. */
1493 || field == e_rpsel)
1495 /* A PLABEL relocation that has a size of 32 bits must
1496 be a R_DATA_PLABEL. All others are R_CODE_PLABELs. */
1498 *final_type = R_DATA_PLABEL;
1500 *final_type = R_CODE_PLABEL;
1503 else if (field == e_tsel
1505 || field == e_rtsel)
1506 *final_type = R_DLT_REL;
1507 /* A relocation in the data space is always a full 32bits. */
1508 else if (format == 32)
1509 *final_type = R_DATA_ONE_SYMBOL;
1514 /* More PLABEL special cases. */
1517 || field == e_rpsel)
1518 *final_type = R_DATA_PLABEL;
1522 case R_HPPA_ABS_CALL:
1523 case R_HPPA_PCREL_CALL:
1524 case R_HPPA_COMPLEX:
1525 case R_HPPA_COMPLEX_PCREL_CALL:
1526 case R_HPPA_COMPLEX_ABS_CALL:
1527 /* Right now we can default all these. */
1533 /* Return the address of the correct entry in the PA SOM relocation
1536 static const reloc_howto_type *
1537 som_bfd_reloc_type_lookup (arch, code)
1538 bfd_arch_info_type *arch;
1539 bfd_reloc_code_real_type code;
1541 if ((int) code < (int) R_NO_RELOCATION + 255)
1543 BFD_ASSERT ((int) som_hppa_howto_table[(int) code].type == (int) code);
1544 return &som_hppa_howto_table[(int) code];
1547 return (reloc_howto_type *) 0;
1550 /* Perform some initialization for an object. Save results of this
1551 initialization in the BFD. */
1554 som_object_setup (abfd, file_hdrp, aux_hdrp)
1556 struct header *file_hdrp;
1557 struct som_exec_auxhdr *aux_hdrp;
1559 /* som_mkobject will set bfd_error if som_mkobject fails. */
1560 if (som_mkobject (abfd) != true)
1563 /* Set BFD flags based on what information is available in the SOM. */
1564 abfd->flags = NO_FLAGS;
1565 if (file_hdrp->symbol_total)
1566 abfd->flags |= HAS_LINENO | HAS_DEBUG | HAS_SYMS | HAS_LOCALS;
1568 switch (file_hdrp->a_magic)
1571 abfd->flags |= (D_PAGED | WP_TEXT | EXEC_P);
1574 abfd->flags |= (WP_TEXT | EXEC_P);
1577 abfd->flags |= (EXEC_P);
1580 abfd->flags |= HAS_RELOC;
1588 abfd->flags |= DYNAMIC;
1595 bfd_get_start_address (abfd) = aux_hdrp->exec_entry;
1596 bfd_default_set_arch_mach (abfd, bfd_arch_hppa, 0);
1597 bfd_get_symcount (abfd) = file_hdrp->symbol_total;
1599 /* Initialize the saved symbol table and string table to NULL.
1600 Save important offsets and sizes from the SOM header into
1602 obj_som_stringtab (abfd) = (char *) NULL;
1603 obj_som_symtab (abfd) = (som_symbol_type *) NULL;
1604 obj_som_stringtab_size (abfd) = file_hdrp->symbol_strings_size;
1605 obj_som_sym_filepos (abfd) = file_hdrp->symbol_location;
1606 obj_som_str_filepos (abfd) = file_hdrp->symbol_strings_location;
1607 obj_som_reloc_filepos (abfd) = file_hdrp->fixup_request_location;
1609 obj_som_exec_data (abfd) = (struct som_exec_data *)
1610 bfd_zalloc (abfd, sizeof (struct som_exec_data ));
1611 if (obj_som_exec_data (abfd) == NULL)
1613 bfd_set_error (bfd_error_no_memory);
1617 obj_som_exec_data (abfd)->system_id = file_hdrp->system_id;
1618 obj_som_exec_data (abfd)->exec_flags = aux_hdrp->exec_flags;
1622 /* Convert all of the space and subspace info into BFD sections. Each space
1623 contains a number of subspaces, which in turn describe the mapping between
1624 regions of the exec file, and the address space that the program runs in.
1625 BFD sections which correspond to spaces will overlap the sections for the
1626 associated subspaces. */
1629 setup_sections (abfd, file_hdr)
1631 struct header *file_hdr;
1633 char *space_strings;
1635 unsigned int total_subspaces = 0;
1637 /* First, read in space names */
1639 space_strings = malloc (file_hdr->space_strings_size);
1640 if (!space_strings && file_hdr->space_strings_size != 0)
1642 bfd_set_error (bfd_error_no_memory);
1646 if (bfd_seek (abfd, file_hdr->space_strings_location, SEEK_SET) < 0)
1648 if (bfd_read (space_strings, 1, file_hdr->space_strings_size, abfd)
1649 != file_hdr->space_strings_size)
1652 /* Loop over all of the space dictionaries, building up sections */
1653 for (space_index = 0; space_index < file_hdr->space_total; space_index++)
1655 struct space_dictionary_record space;
1656 struct subspace_dictionary_record subspace, save_subspace;
1658 asection *space_asect;
1661 /* Read the space dictionary element */
1662 if (bfd_seek (abfd, file_hdr->space_location
1663 + space_index * sizeof space, SEEK_SET) < 0)
1665 if (bfd_read (&space, 1, sizeof space, abfd) != sizeof space)
1668 /* Setup the space name string */
1669 space.name.n_name = space.name.n_strx + space_strings;
1671 /* Make a section out of it */
1672 newname = bfd_alloc (abfd, strlen (space.name.n_name) + 1);
1675 strcpy (newname, space.name.n_name);
1677 space_asect = bfd_make_section_anyway (abfd, newname);
1681 if (space.is_loadable == 0)
1682 space_asect->flags |= SEC_DEBUGGING;
1684 /* Set up all the attributes for the space. */
1685 if (bfd_som_set_section_attributes (space_asect, space.is_defined,
1686 space.is_private, space.sort_key,
1687 space.space_number) == false)
1690 /* Now, read in the first subspace for this space */
1691 if (bfd_seek (abfd, file_hdr->subspace_location
1692 + space.subspace_index * sizeof subspace,
1695 if (bfd_read (&subspace, 1, sizeof subspace, abfd) != sizeof subspace)
1697 /* Seek back to the start of the subspaces for loop below */
1698 if (bfd_seek (abfd, file_hdr->subspace_location
1699 + space.subspace_index * sizeof subspace,
1703 /* Setup the start address and file loc from the first subspace record */
1704 space_asect->vma = subspace.subspace_start;
1705 space_asect->filepos = subspace.file_loc_init_value;
1706 space_asect->alignment_power = log2 (subspace.alignment);
1707 if (space_asect->alignment_power == -1)
1710 /* Initialize save_subspace so we can reliably determine if this
1711 loop placed any useful values into it. */
1712 memset (&save_subspace, 0, sizeof (struct subspace_dictionary_record));
1714 /* Loop over the rest of the subspaces, building up more sections */
1715 for (subspace_index = 0; subspace_index < space.subspace_quantity;
1718 asection *subspace_asect;
1720 /* Read in the next subspace */
1721 if (bfd_read (&subspace, 1, sizeof subspace, abfd)
1725 /* Setup the subspace name string */
1726 subspace.name.n_name = subspace.name.n_strx + space_strings;
1728 newname = bfd_alloc (abfd, strlen (subspace.name.n_name) + 1);
1731 strcpy (newname, subspace.name.n_name);
1733 /* Make a section out of this subspace */
1734 subspace_asect = bfd_make_section_anyway (abfd, newname);
1735 if (!subspace_asect)
1738 /* Store private information about the section. */
1739 if (bfd_som_set_subsection_attributes (subspace_asect, space_asect,
1740 subspace.access_control_bits,
1742 subspace.quadrant) == false)
1745 /* Keep an easy mapping between subspaces and sections. */
1746 subspace_asect->target_index = total_subspaces++;
1748 /* Set SEC_READONLY and SEC_CODE/SEC_DATA as specified
1749 by the access_control_bits in the subspace header. */
1750 switch (subspace.access_control_bits >> 4)
1752 /* Readonly data. */
1754 subspace_asect->flags |= SEC_DATA | SEC_READONLY;
1759 subspace_asect->flags |= SEC_DATA;
1762 /* Readonly code and the gateways.
1763 Gateways have other attributes which do not map
1764 into anything BFD knows about. */
1770 subspace_asect->flags |= SEC_CODE | SEC_READONLY;
1773 /* dynamic (writable) code. */
1775 subspace_asect->flags |= SEC_CODE;
1779 if (subspace.dup_common || subspace.is_common)
1780 subspace_asect->flags |= SEC_IS_COMMON;
1781 else if (subspace.subspace_length > 0)
1782 subspace_asect->flags |= SEC_HAS_CONTENTS;
1784 if (subspace.is_loadable)
1785 subspace_asect->flags |= SEC_ALLOC | SEC_LOAD;
1787 subspace_asect->flags |= SEC_DEBUGGING;
1789 if (subspace.code_only)
1790 subspace_asect->flags |= SEC_CODE;
1792 /* Both file_loc_init_value and initialization_length will
1793 be zero for a BSS like subspace. */
1794 if (subspace.file_loc_init_value == 0
1795 && subspace.initialization_length == 0)
1796 subspace_asect->flags &= ~(SEC_DATA | SEC_LOAD);
1798 /* This subspace has relocations.
1799 The fixup_request_quantity is a byte count for the number of
1800 entries in the relocation stream; it is not the actual number
1801 of relocations in the subspace. */
1802 if (subspace.fixup_request_quantity != 0)
1804 subspace_asect->flags |= SEC_RELOC;
1805 subspace_asect->rel_filepos = subspace.fixup_request_index;
1806 som_section_data (subspace_asect)->reloc_size
1807 = subspace.fixup_request_quantity;
1808 /* We can not determine this yet. When we read in the
1809 relocation table the correct value will be filled in. */
1810 subspace_asect->reloc_count = -1;
1813 /* Update save_subspace if appropriate. */
1814 if (subspace.file_loc_init_value > save_subspace.file_loc_init_value)
1815 save_subspace = subspace;
1817 subspace_asect->vma = subspace.subspace_start;
1818 subspace_asect->_cooked_size = subspace.subspace_length;
1819 subspace_asect->_raw_size = subspace.subspace_length;
1820 subspace_asect->filepos = subspace.file_loc_init_value;
1821 subspace_asect->alignment_power = log2 (subspace.alignment);
1822 if (subspace_asect->alignment_power == -1)
1826 /* Yow! there is no subspace within the space which actually
1827 has initialized information in it; this should never happen
1828 as far as I know. */
1829 if (!save_subspace.file_loc_init_value)
1832 /* Setup the sizes for the space section based upon the info in the
1833 last subspace of the space. */
1834 space_asect->_cooked_size = save_subspace.subspace_start
1835 - space_asect->vma + save_subspace.subspace_length;
1836 space_asect->_raw_size = save_subspace.file_loc_init_value
1837 - space_asect->filepos + save_subspace.initialization_length;
1839 if (space_strings != NULL)
1840 free (space_strings);
1844 if (space_strings != NULL)
1845 free (space_strings);
1849 /* Read in a SOM object and make it into a BFD. */
1855 struct header file_hdr;
1856 struct som_exec_auxhdr aux_hdr;
1858 if (bfd_read ((PTR) & file_hdr, 1, FILE_HDR_SIZE, abfd) != FILE_HDR_SIZE)
1860 if (bfd_get_error () != bfd_error_system_call)
1861 bfd_set_error (bfd_error_wrong_format);
1865 if (!_PA_RISC_ID (file_hdr.system_id))
1867 bfd_set_error (bfd_error_wrong_format);
1871 switch (file_hdr.a_magic)
1886 #ifdef SHARED_MAGIC_CNX
1887 case SHARED_MAGIC_CNX:
1891 bfd_set_error (bfd_error_wrong_format);
1895 if (file_hdr.version_id != VERSION_ID
1896 && file_hdr.version_id != NEW_VERSION_ID)
1898 bfd_set_error (bfd_error_wrong_format);
1902 /* If the aux_header_size field in the file header is zero, then this
1903 object is an incomplete executable (a .o file). Do not try to read
1904 a non-existant auxiliary header. */
1905 memset (&aux_hdr, 0, sizeof (struct som_exec_auxhdr));
1906 if (file_hdr.aux_header_size != 0)
1908 if (bfd_read ((PTR) & aux_hdr, 1, AUX_HDR_SIZE, abfd) != AUX_HDR_SIZE)
1910 if (bfd_get_error () != bfd_error_system_call)
1911 bfd_set_error (bfd_error_wrong_format);
1916 if (!setup_sections (abfd, &file_hdr))
1918 /* setup_sections does not bubble up a bfd error code. */
1919 bfd_set_error (bfd_error_bad_value);
1923 /* This appears to be a valid SOM object. Do some initialization. */
1924 return som_object_setup (abfd, &file_hdr, &aux_hdr);
1927 /* Create a SOM object. */
1933 /* Allocate memory to hold backend information. */
1934 abfd->tdata.som_data = (struct som_data_struct *)
1935 bfd_zalloc (abfd, sizeof (struct som_data_struct));
1936 if (abfd->tdata.som_data == NULL)
1938 bfd_set_error (bfd_error_no_memory);
1944 /* Initialize some information in the file header. This routine makes
1945 not attempt at doing the right thing for a full executable; it
1946 is only meant to handle relocatable objects. */
1949 som_prep_headers (abfd)
1952 struct header *file_hdr;
1955 /* Make and attach a file header to the BFD. */
1956 file_hdr = (struct header *) bfd_zalloc (abfd, sizeof (struct header));
1957 if (file_hdr == NULL)
1960 bfd_set_error (bfd_error_no_memory);
1963 obj_som_file_hdr (abfd) = file_hdr;
1965 /* FIXME. This should really be conditional based on whether or not
1966 PA1.1 instructions/registers have been used. */
1967 if (abfd->flags & (EXEC_P | DYNAMIC))
1968 file_hdr->system_id = obj_som_exec_data (abfd)->system_id;
1970 file_hdr->system_id = CPU_PA_RISC1_0;
1972 if (abfd->flags & (EXEC_P | DYNAMIC))
1974 if (abfd->flags & D_PAGED)
1975 file_hdr->a_magic = DEMAND_MAGIC;
1976 else if (abfd->flags & WP_TEXT)
1977 file_hdr->a_magic = SHARE_MAGIC;
1979 else if (abfd->flags & DYNAMIC)
1980 file_hdr->a_magic = SHL_MAGIC;
1983 file_hdr->a_magic = EXEC_MAGIC;
1986 file_hdr->a_magic = RELOC_MAGIC;
1988 /* Only new format SOM is supported. */
1989 file_hdr->version_id = NEW_VERSION_ID;
1991 /* These fields are optional, and embedding timestamps is not always
1992 a wise thing to do, it makes comparing objects during a multi-stage
1993 bootstrap difficult. */
1994 file_hdr->file_time.secs = 0;
1995 file_hdr->file_time.nanosecs = 0;
1997 file_hdr->entry_space = 0;
1998 file_hdr->entry_subspace = 0;
1999 file_hdr->entry_offset = 0;
2000 file_hdr->presumed_dp = 0;
2002 /* Now iterate over the sections translating information from
2003 BFD sections to SOM spaces/subspaces. */
2005 for (section = abfd->sections; section != NULL; section = section->next)
2007 /* Ignore anything which has not been marked as a space or
2009 if (!som_is_space (section) && !som_is_subspace (section))
2012 if (som_is_space (section))
2014 /* Allocate space for the space dictionary. */
2015 som_section_data (section)->space_dict
2016 = (struct space_dictionary_record *)
2017 bfd_zalloc (abfd, sizeof (struct space_dictionary_record));
2018 if (som_section_data (section)->space_dict == NULL)
2020 bfd_set_error (bfd_error_no_memory);
2023 /* Set space attributes. Note most attributes of SOM spaces
2024 are set based on the subspaces it contains. */
2025 som_section_data (section)->space_dict->loader_fix_index = -1;
2026 som_section_data (section)->space_dict->init_pointer_index = -1;
2028 /* Set more attributes that were stuffed away in private data. */
2029 som_section_data (section)->space_dict->sort_key =
2030 som_section_data (section)->copy_data->sort_key;
2031 som_section_data (section)->space_dict->is_defined =
2032 som_section_data (section)->copy_data->is_defined;
2033 som_section_data (section)->space_dict->is_private =
2034 som_section_data (section)->copy_data->is_private;
2035 som_section_data (section)->space_dict->space_number =
2036 section->target_index;
2040 /* Allocate space for the subspace dictionary. */
2041 som_section_data (section)->subspace_dict
2042 = (struct subspace_dictionary_record *)
2043 bfd_zalloc (abfd, sizeof (struct subspace_dictionary_record));
2044 if (som_section_data (section)->subspace_dict == NULL)
2046 bfd_set_error (bfd_error_no_memory);
2050 /* Set subspace attributes. Basic stuff is done here, additional
2051 attributes are filled in later as more information becomes
2053 if (section->flags & SEC_IS_COMMON)
2055 som_section_data (section)->subspace_dict->dup_common = 1;
2056 som_section_data (section)->subspace_dict->is_common = 1;
2059 if (section->flags & SEC_ALLOC)
2060 som_section_data (section)->subspace_dict->is_loadable = 1;
2062 if (section->flags & SEC_CODE)
2063 som_section_data (section)->subspace_dict->code_only = 1;
2065 som_section_data (section)->subspace_dict->subspace_start =
2067 som_section_data (section)->subspace_dict->subspace_length =
2068 bfd_section_size (abfd, section);
2069 som_section_data (section)->subspace_dict->initialization_length =
2070 bfd_section_size (abfd, section);
2071 som_section_data (section)->subspace_dict->alignment =
2072 1 << section->alignment_power;
2074 /* Set more attributes that were stuffed away in private data. */
2075 som_section_data (section)->subspace_dict->sort_key =
2076 som_section_data (section)->copy_data->sort_key;
2077 som_section_data (section)->subspace_dict->access_control_bits =
2078 som_section_data (section)->copy_data->access_control_bits;
2079 som_section_data (section)->subspace_dict->quadrant =
2080 som_section_data (section)->copy_data->quadrant;
2086 /* Return true if the given section is a SOM space, false otherwise. */
2089 som_is_space (section)
2092 /* If no copy data is available, then it's neither a space nor a
2094 if (som_section_data (section)->copy_data == NULL)
2097 /* If the containing space isn't the same as the given section,
2098 then this isn't a space. */
2099 if (som_section_data (section)->copy_data->container != section)
2102 /* OK. Must be a space. */
2106 /* Return true if the given section is a SOM subspace, false otherwise. */
2109 som_is_subspace (section)
2112 /* If no copy data is available, then it's neither a space nor a
2114 if (som_section_data (section)->copy_data == NULL)
2117 /* If the containing space is the same as the given section,
2118 then this isn't a subspace. */
2119 if (som_section_data (section)->copy_data->container == section)
2122 /* OK. Must be a subspace. */
2126 /* Return true if the given space containins the given subspace. It
2127 is safe to assume space really is a space, and subspace really
2131 som_is_container (space, subspace)
2132 asection *space, *subspace;
2134 return som_section_data (subspace)->copy_data->container == space;
2137 /* Count and return the number of spaces attached to the given BFD. */
2139 static unsigned long
2140 som_count_spaces (abfd)
2146 for (section = abfd->sections; section != NULL; section = section->next)
2147 count += som_is_space (section);
2152 /* Count the number of subspaces attached to the given BFD. */
2154 static unsigned long
2155 som_count_subspaces (abfd)
2161 for (section = abfd->sections; section != NULL; section = section->next)
2162 count += som_is_subspace (section);
2167 /* Return -1, 0, 1 indicating the relative ordering of sym1 and sym2.
2169 We desire symbols to be ordered starting with the symbol with the
2170 highest relocation count down to the symbol with the lowest relocation
2171 count. Doing so compacts the relocation stream. */
2174 compare_syms (sym1, sym2)
2179 unsigned int count1, count2;
2181 /* Get relocation count for each symbol. Note that the count
2182 is stored in the udata pointer for section symbols! */
2183 if ((*sym1)->flags & BSF_SECTION_SYM)
2184 count1 = (int)(*sym1)->udata;
2186 count1 = som_symbol_data (*sym1)->reloc_count;
2188 if ((*sym2)->flags & BSF_SECTION_SYM)
2189 count2 = (int)(*sym2)->udata;
2191 count2 = som_symbol_data (*sym2)->reloc_count;
2193 /* Return the appropriate value. */
2194 if (count1 < count2)
2196 else if (count1 > count2)
2201 /* Perform various work in preparation for emitting the fixup stream. */
2204 som_prep_for_fixups (abfd, syms, num_syms)
2207 unsigned long num_syms;
2212 /* Most SOM relocations involving a symbol have a length which is
2213 dependent on the index of the symbol. So symbols which are
2214 used often in relocations should have a small index. */
2216 /* First initialize the counters for each symbol. */
2217 for (i = 0; i < num_syms; i++)
2219 /* Handle a section symbol; these have no pointers back to the
2220 SOM symbol info. So we just use the pointer field (udata)
2221 to hold the relocation count. */
2222 if (som_symbol_data (syms[i]) == NULL
2223 || syms[i]->flags & BSF_SECTION_SYM)
2225 syms[i]->flags |= BSF_SECTION_SYM;
2226 syms[i]->udata = (PTR) 0;
2229 som_symbol_data (syms[i])->reloc_count = 0;
2232 /* Now that the counters are initialized, make a weighted count
2233 of how often a given symbol is used in a relocation. */
2234 for (section = abfd->sections; section != NULL; section = section->next)
2238 /* Does this section have any relocations? */
2239 if (section->reloc_count <= 0)
2242 /* Walk through each relocation for this section. */
2243 for (i = 1; i < section->reloc_count; i++)
2245 arelent *reloc = section->orelocation[i];
2248 /* A relocation against a symbol in the *ABS* section really
2249 does not have a symbol. Likewise if the symbol isn't associated
2250 with any section. */
2251 if (reloc->sym_ptr_ptr == NULL
2252 || (*reloc->sym_ptr_ptr)->section == &bfd_abs_section)
2255 /* Scaling to encourage symbols involved in R_DP_RELATIVE
2256 and R_CODE_ONE_SYMBOL relocations to come first. These
2257 two relocations have single byte versions if the symbol
2258 index is very small. */
2259 if (reloc->howto->type == R_DP_RELATIVE
2260 || reloc->howto->type == R_CODE_ONE_SYMBOL)
2265 /* Handle section symbols by ramming the count in the udata
2266 field. It will not be used and the count is very important
2267 for these symbols. */
2268 if ((*reloc->sym_ptr_ptr)->flags & BSF_SECTION_SYM)
2270 (*reloc->sym_ptr_ptr)->udata =
2271 (PTR) ((int) (*reloc->sym_ptr_ptr)->udata + scale);
2275 /* A normal symbol. Increment the count. */
2276 som_symbol_data (*reloc->sym_ptr_ptr)->reloc_count += scale;
2280 /* Now sort the symbols. */
2281 qsort (syms, num_syms, sizeof (asymbol *), compare_syms);
2283 /* Compute the symbol indexes, they will be needed by the relocation
2285 for (i = 0; i < num_syms; i++)
2287 /* A section symbol. Again, there is no pointer to backend symbol
2288 information, so we reuse (abuse) the udata field again. */
2289 if (syms[i]->flags & BSF_SECTION_SYM)
2290 syms[i]->udata = (PTR) i;
2292 som_symbol_data (syms[i])->index = i;
2297 som_write_fixups (abfd, current_offset, total_reloc_sizep)
2299 unsigned long current_offset;
2300 unsigned int *total_reloc_sizep;
2303 /* Chunk of memory that we can use as buffer space, then throw
2305 unsigned char tmp_space[SOM_TMP_BUFSIZE];
2307 unsigned int total_reloc_size = 0;
2308 unsigned int subspace_reloc_size = 0;
2309 unsigned int num_spaces = obj_som_file_hdr (abfd)->space_total;
2310 asection *section = abfd->sections;
2312 memset (tmp_space, 0, SOM_TMP_BUFSIZE);
2315 /* All the fixups for a particular subspace are emitted in a single
2316 stream. All the subspaces for a particular space are emitted
2319 So, to get all the locations correct one must iterate through all the
2320 spaces, for each space iterate through its subspaces and output a
2322 for (i = 0; i < num_spaces; i++)
2324 asection *subsection;
2327 while (!som_is_space (section))
2328 section = section->next;
2330 /* Now iterate through each of its subspaces. */
2331 for (subsection = abfd->sections;
2333 subsection = subsection->next)
2335 int reloc_offset, current_rounding_mode;
2337 /* Find a subspace of this space. */
2338 if (!som_is_subspace (subsection)
2339 || !som_is_container (section, subsection))
2342 /* If this subspace had no relocations, then we're finished
2344 if (subsection->reloc_count <= 0)
2346 som_section_data (subsection)->subspace_dict->fixup_request_index
2351 /* This subspace has some relocations. Put the relocation stream
2352 index into the subspace record. */
2353 som_section_data (subsection)->subspace_dict->fixup_request_index
2356 /* To make life easier start over with a clean slate for
2357 each subspace. Seek to the start of the relocation stream
2358 for this subspace in preparation for writing out its fixup
2360 if (bfd_seek (abfd, current_offset + total_reloc_size, SEEK_SET) < 0)
2363 /* Buffer space has already been allocated. Just perform some
2364 initialization here. */
2366 subspace_reloc_size = 0;
2368 som_initialize_reloc_queue (reloc_queue);
2369 current_rounding_mode = R_N_MODE;
2371 /* Translate each BFD relocation into one or more SOM
2373 for (j = 0; j < subsection->reloc_count; j++)
2375 arelent *bfd_reloc = subsection->orelocation[j];
2379 /* Get the symbol number. Remember it's stored in a
2380 special place for section symbols. */
2381 if ((*bfd_reloc->sym_ptr_ptr)->flags & BSF_SECTION_SYM)
2382 sym_num = (int) (*bfd_reloc->sym_ptr_ptr)->udata;
2384 sym_num = som_symbol_data (*bfd_reloc->sym_ptr_ptr)->index;
2386 /* If there is not enough room for the next couple relocations,
2387 then dump the current buffer contents now. Also reinitialize
2388 the relocation queue.
2390 No single BFD relocation could ever translate into more
2391 than 100 bytes of SOM relocations (20bytes is probably the
2392 upper limit, but leave lots of space for growth). */
2393 if (p - tmp_space + 100 > SOM_TMP_BUFSIZE)
2395 if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd)
2400 som_initialize_reloc_queue (reloc_queue);
2403 /* Emit R_NO_RELOCATION fixups to map any bytes which were
2405 skip = bfd_reloc->address - reloc_offset;
2406 p = som_reloc_skip (abfd, skip, p,
2407 &subspace_reloc_size, reloc_queue);
2409 /* Update reloc_offset for the next iteration.
2411 Many relocations do not consume input bytes. They
2412 are markers, or set state necessary to perform some
2413 later relocation. */
2414 switch (bfd_reloc->howto->type)
2416 /* This only needs to handle relocations that may be
2417 made by hppa_som_gen_reloc. */
2427 reloc_offset = bfd_reloc->address;
2431 reloc_offset = bfd_reloc->address + 4;
2435 /* Now the actual relocation we care about. */
2436 switch (bfd_reloc->howto->type)
2440 p = som_reloc_call (abfd, p, &subspace_reloc_size,
2441 bfd_reloc, sym_num, reloc_queue);
2444 case R_CODE_ONE_SYMBOL:
2446 /* Account for any addend. */
2447 if (bfd_reloc->addend)
2448 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
2449 &subspace_reloc_size, reloc_queue);
2453 bfd_put_8 (abfd, bfd_reloc->howto->type + sym_num, p);
2454 subspace_reloc_size += 1;
2457 else if (sym_num < 0x100)
2459 bfd_put_8 (abfd, bfd_reloc->howto->type + 32, p);
2460 bfd_put_8 (abfd, sym_num, p + 1);
2461 p = try_prev_fixup (abfd, &subspace_reloc_size, p,
2464 else if (sym_num < 0x10000000)
2466 bfd_put_8 (abfd, bfd_reloc->howto->type + 33, p);
2467 bfd_put_8 (abfd, sym_num >> 16, p + 1);
2468 bfd_put_16 (abfd, sym_num, p + 2);
2469 p = try_prev_fixup (abfd, &subspace_reloc_size,
2476 case R_DATA_ONE_SYMBOL:
2480 /* Account for any addend. */
2481 if (bfd_reloc->addend)
2482 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
2483 &subspace_reloc_size, reloc_queue);
2485 if (sym_num < 0x100)
2487 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
2488 bfd_put_8 (abfd, sym_num, p + 1);
2489 p = try_prev_fixup (abfd, &subspace_reloc_size, p,
2492 else if (sym_num < 0x10000000)
2494 bfd_put_8 (abfd, bfd_reloc->howto->type + 1, p);
2495 bfd_put_8 (abfd, sym_num >> 16, p + 1);
2496 bfd_put_16 (abfd, sym_num, p + 2);
2497 p = try_prev_fixup (abfd, &subspace_reloc_size,
2507 = (int *) som_symbol_data (*bfd_reloc->sym_ptr_ptr)->unwind;
2508 bfd_put_8 (abfd, R_ENTRY, p);
2509 bfd_put_32 (abfd, descp[0], p + 1);
2510 bfd_put_32 (abfd, descp[1], p + 5);
2511 p = try_prev_fixup (abfd, &subspace_reloc_size,
2517 bfd_put_8 (abfd, R_EXIT, p);
2518 subspace_reloc_size += 1;
2526 /* If this relocation requests the current rounding
2527 mode, then it is redundant. */
2528 if (bfd_reloc->howto->type != current_rounding_mode)
2530 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
2531 subspace_reloc_size += 1;
2533 current_rounding_mode = bfd_reloc->howto->type;
2540 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
2541 subspace_reloc_size += 1;
2545 /* Put a "R_RESERVED" relocation in the stream if
2546 we hit something we do not understand. The linker
2547 will complain loudly if this ever happens. */
2549 bfd_put_8 (abfd, 0xff, p);
2550 subspace_reloc_size += 1;
2556 /* Last BFD relocation for a subspace has been processed.
2557 Map the rest of the subspace with R_NO_RELOCATION fixups. */
2558 p = som_reloc_skip (abfd, bfd_section_size (abfd, subsection)
2560 p, &subspace_reloc_size, reloc_queue);
2562 /* Scribble out the relocations. */
2563 if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd)
2568 total_reloc_size += subspace_reloc_size;
2569 som_section_data (subsection)->subspace_dict->fixup_request_quantity
2570 = subspace_reloc_size;
2572 section = section->next;
2574 *total_reloc_sizep = total_reloc_size;
2578 /* Write out the space/subspace string table. */
2581 som_write_space_strings (abfd, current_offset, string_sizep)
2583 unsigned long current_offset;
2584 unsigned int *string_sizep;
2586 /* Chunk of memory that we can use as buffer space, then throw
2588 unsigned char tmp_space[SOM_TMP_BUFSIZE];
2590 unsigned int strings_size = 0;
2593 memset (tmp_space, 0, SOM_TMP_BUFSIZE);
2596 /* Seek to the start of the space strings in preparation for writing
2598 if (bfd_seek (abfd, current_offset, SEEK_SET) < 0)
2601 /* Walk through all the spaces and subspaces (order is not important)
2602 building up and writing string table entries for their names. */
2603 for (section = abfd->sections; section != NULL; section = section->next)
2607 /* Only work with space/subspaces; avoid any other sections
2608 which might have been made (.text for example). */
2609 if (!som_is_space (section) && !som_is_subspace (section))
2612 /* Get the length of the space/subspace name. */
2613 length = strlen (section->name);
2615 /* If there is not enough room for the next entry, then dump the
2616 current buffer contents now. Each entry will take 4 bytes to
2617 hold the string length + the string itself + null terminator. */
2618 if (p - tmp_space + 5 + length > SOM_TMP_BUFSIZE)
2620 if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd)
2623 /* Reset to beginning of the buffer space. */
2627 /* First element in a string table entry is the length of the
2628 string. Alignment issues are already handled. */
2629 bfd_put_32 (abfd, length, p);
2633 /* Record the index in the space/subspace records. */
2634 if (som_is_space (section))
2635 som_section_data (section)->space_dict->name.n_strx = strings_size;
2637 som_section_data (section)->subspace_dict->name.n_strx = strings_size;
2639 /* Next comes the string itself + a null terminator. */
2640 strcpy (p, section->name);
2642 strings_size += length + 1;
2644 /* Always align up to the next word boundary. */
2645 while (strings_size % 4)
2647 bfd_put_8 (abfd, 0, p);
2653 /* Done with the space/subspace strings. Write out any information
2654 contained in a partial block. */
2655 if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd) != p - tmp_space)
2657 *string_sizep = strings_size;
2661 /* Write out the symbol string table. */
2664 som_write_symbol_strings (abfd, current_offset, syms, num_syms, string_sizep)
2666 unsigned long current_offset;
2668 unsigned int num_syms;
2669 unsigned int *string_sizep;
2673 /* Chunk of memory that we can use as buffer space, then throw
2675 unsigned char tmp_space[SOM_TMP_BUFSIZE];
2677 unsigned int strings_size = 0;
2679 memset (tmp_space, 0, SOM_TMP_BUFSIZE);
2682 /* Seek to the start of the space strings in preparation for writing
2684 if (bfd_seek (abfd, current_offset, SEEK_SET) < 0)
2687 for (i = 0; i < num_syms; i++)
2689 int length = strlen (syms[i]->name);
2691 /* If there is not enough room for the next entry, then dump the
2692 current buffer contents now. */
2693 if (p - tmp_space + 5 + length > SOM_TMP_BUFSIZE)
2695 if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd)
2698 /* Reset to beginning of the buffer space. */
2702 /* First element in a string table entry is the length of the
2703 string. This must always be 4 byte aligned. This is also
2704 an appropriate time to fill in the string index field in the
2705 symbol table entry. */
2706 bfd_put_32 (abfd, length, p);
2710 /* Next comes the string itself + a null terminator. */
2711 strcpy (p, syms[i]->name);
2714 syms[i]->name = (char *)strings_size;
2716 strings_size += length + 1;
2718 /* Always align up to the next word boundary. */
2719 while (strings_size % 4)
2721 bfd_put_8 (abfd, 0, p);
2727 /* Scribble out any partial block. */
2728 if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd) != p - tmp_space)
2731 *string_sizep = strings_size;
2735 /* Compute variable information to be placed in the SOM headers,
2736 space/subspace dictionaries, relocation streams, etc. Begin
2737 writing parts of the object file. */
2740 som_begin_writing (abfd)
2743 unsigned long current_offset = 0;
2744 int strings_size = 0;
2745 unsigned int total_reloc_size = 0;
2746 unsigned long num_spaces, num_subspaces, num_syms, i;
2748 asymbol **syms = bfd_get_outsymbols (abfd);
2749 unsigned int total_subspaces = 0;
2750 struct som_exec_auxhdr exec_header;
2752 /* The file header will always be first in an object file,
2753 everything else can be in random locations. To keep things
2754 "simple" BFD will lay out the object file in the manner suggested
2755 by the PRO ABI for PA-RISC Systems. */
2757 /* Before any output can really begin offsets for all the major
2758 portions of the object file must be computed. So, starting
2759 with the initial file header compute (and sometimes write)
2760 each portion of the object file. */
2762 /* Make room for the file header, it's contents are not complete
2763 yet, so it can not be written at this time. */
2764 current_offset += sizeof (struct header);
2766 /* Any auxiliary headers will follow the file header. Right now
2767 we support only the copyright and version headers. */
2768 obj_som_file_hdr (abfd)->aux_header_location = current_offset;
2769 obj_som_file_hdr (abfd)->aux_header_size = 0;
2770 if (abfd->flags & (EXEC_P | DYNAMIC))
2772 /* Parts of the exec header will be filled in later, so
2773 delay writing the header itself. Fill in the defaults,
2774 and write it later. */
2775 current_offset += sizeof (exec_header);
2776 obj_som_file_hdr (abfd)->aux_header_size += sizeof (exec_header);
2777 memset (&exec_header, 0, sizeof (exec_header));
2778 exec_header.som_auxhdr.type = HPUX_AUX_ID;
2779 exec_header.som_auxhdr.length = 40;
2781 if (obj_som_version_hdr (abfd) != NULL)
2785 if (bfd_seek (abfd, current_offset, SEEK_SET) < 0)
2788 /* Write the aux_id structure and the string length. */
2789 len = sizeof (struct aux_id) + sizeof (unsigned int);
2790 obj_som_file_hdr (abfd)->aux_header_size += len;
2791 current_offset += len;
2792 if (bfd_write ((PTR) obj_som_version_hdr (abfd), len, 1, abfd) != len)
2795 /* Write the version string. */
2796 len = obj_som_version_hdr (abfd)->header_id.length - sizeof (int);
2797 obj_som_file_hdr (abfd)->aux_header_size += len;
2798 current_offset += len;
2799 if (bfd_write ((PTR) obj_som_version_hdr (abfd)->user_string,
2800 len, 1, abfd) != len)
2804 if (obj_som_copyright_hdr (abfd) != NULL)
2808 if (bfd_seek (abfd, current_offset, SEEK_SET) < 0)
2811 /* Write the aux_id structure and the string length. */
2812 len = sizeof (struct aux_id) + sizeof (unsigned int);
2813 obj_som_file_hdr (abfd)->aux_header_size += len;
2814 current_offset += len;
2815 if (bfd_write ((PTR) obj_som_copyright_hdr (abfd), len, 1, abfd) != len)
2818 /* Write the copyright string. */
2819 len = obj_som_copyright_hdr (abfd)->header_id.length - sizeof (int);
2820 obj_som_file_hdr (abfd)->aux_header_size += len;
2821 current_offset += len;
2822 if (bfd_write ((PTR) obj_som_copyright_hdr (abfd)->copyright,
2823 len, 1, abfd) != len)
2827 /* Next comes the initialization pointers; we have no initialization
2828 pointers, so current offset does not change. */
2829 obj_som_file_hdr (abfd)->init_array_location = current_offset;
2830 obj_som_file_hdr (abfd)->init_array_total = 0;
2832 /* Next are the space records. These are fixed length records.
2834 Count the number of spaces to determine how much room is needed
2835 in the object file for the space records.
2837 The names of the spaces are stored in a separate string table,
2838 and the index for each space into the string table is computed
2839 below. Therefore, it is not possible to write the space headers
2841 num_spaces = som_count_spaces (abfd);
2842 obj_som_file_hdr (abfd)->space_location = current_offset;
2843 obj_som_file_hdr (abfd)->space_total = num_spaces;
2844 current_offset += num_spaces * sizeof (struct space_dictionary_record);
2846 /* Next are the subspace records. These are fixed length records.
2848 Count the number of subspaes to determine how much room is needed
2849 in the object file for the subspace records.
2851 A variety if fields in the subspace record are still unknown at
2852 this time (index into string table, fixup stream location/size, etc). */
2853 num_subspaces = som_count_subspaces (abfd);
2854 obj_som_file_hdr (abfd)->subspace_location = current_offset;
2855 obj_som_file_hdr (abfd)->subspace_total = num_subspaces;
2856 current_offset += num_subspaces * sizeof (struct subspace_dictionary_record);
2858 /* Next is the string table for the space/subspace names. We will
2859 build and write the string table on the fly. At the same time
2860 we will fill in the space/subspace name index fields. */
2862 /* The string table needs to be aligned on a word boundary. */
2863 if (current_offset % 4)
2864 current_offset += (4 - (current_offset % 4));
2866 /* Mark the offset of the space/subspace string table in the
2868 obj_som_file_hdr (abfd)->space_strings_location = current_offset;
2870 /* Scribble out the space strings. */
2871 if (som_write_space_strings (abfd, current_offset, &strings_size) == false)
2874 /* Record total string table size in the header and update the
2876 obj_som_file_hdr (abfd)->space_strings_size = strings_size;
2877 current_offset += strings_size;
2879 /* Next is the symbol table. These are fixed length records.
2881 Count the number of symbols to determine how much room is needed
2882 in the object file for the symbol table.
2884 The names of the symbols are stored in a separate string table,
2885 and the index for each symbol name into the string table is computed
2886 below. Therefore, it is not possible to write the symobl table
2888 num_syms = bfd_get_symcount (abfd);
2889 obj_som_file_hdr (abfd)->symbol_location = current_offset;
2890 obj_som_file_hdr (abfd)->symbol_total = num_syms;
2891 current_offset += num_syms * sizeof (struct symbol_dictionary_record);
2893 /* Do prep work before handling fixups. */
2894 som_prep_for_fixups (abfd, syms, num_syms);
2896 /* Next comes the fixup stream which starts on a word boundary. */
2897 if (current_offset % 4)
2898 current_offset += (4 - (current_offset % 4));
2899 obj_som_file_hdr (abfd)->fixup_request_location = current_offset;
2901 /* Write the fixups and update fields in subspace headers which
2902 relate to the fixup stream. */
2903 if (som_write_fixups (abfd, current_offset, &total_reloc_size) == false)
2906 /* Record the total size of the fixup stream in the file header. */
2907 obj_som_file_hdr (abfd)->fixup_request_total = total_reloc_size;
2908 current_offset += total_reloc_size;
2910 /* Next are the symbol strings.
2911 Align them to a word boundary. */
2912 if (current_offset % 4)
2913 current_offset += (4 - (current_offset % 4));
2914 obj_som_file_hdr (abfd)->symbol_strings_location = current_offset;
2916 /* Scribble out the symbol strings. */
2917 if (som_write_symbol_strings (abfd, current_offset, syms,
2918 num_syms, &strings_size)
2922 /* Record total string table size in header and update the
2924 obj_som_file_hdr (abfd)->symbol_strings_size = strings_size;
2925 current_offset += strings_size;
2927 /* Next is the compiler records. We do not use these. */
2928 obj_som_file_hdr (abfd)->compiler_location = current_offset;
2929 obj_som_file_hdr (abfd)->compiler_total = 0;
2931 /* Now compute the file positions for the loadable subspaces, taking
2932 care to make sure everything stays properly aligned. */
2934 section = abfd->sections;
2935 for (i = 0; i < num_spaces; i++)
2937 asection *subsection;
2939 unsigned int subspace_offset = 0;
2942 while (!som_is_space (section))
2943 section = section->next;
2946 /* Now look for all its subspaces. */
2947 for (subsection = abfd->sections;
2949 subsection = subsection->next)
2952 if (!som_is_subspace (subsection)
2953 || !som_is_container (section, subsection)
2954 || (subsection->flags & SEC_ALLOC) == 0)
2957 /* If this is the first subspace in the space, and we are
2958 building an executable, then take care to make sure all
2959 the alignments are correct and update the exec header. */
2961 && (abfd->flags & (EXEC_P | DYNAMIC)))
2963 /* Demand paged executables have each space aligned to a
2964 page boundary. Sharable executables (write-protected
2965 text) have just the private (aka data & bss) space aligned
2966 to a page boundary. Ugh. Not true for HPUX.
2968 The HPUX kernel requires the text to always be page aligned
2969 within the file regardless of the executable's type. */
2970 if (abfd->flags & (D_PAGED | DYNAMIC)
2971 || (subsection->flags & SEC_CODE)
2972 || ((abfd->flags & WP_TEXT)
2973 && (subsection->flags & SEC_DATA)))
2974 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
2976 /* Update the exec header. */
2977 if (subsection->flags & SEC_CODE && exec_header.exec_tfile == 0)
2979 exec_header.exec_tmem = section->vma;
2980 exec_header.exec_tfile = current_offset;
2982 if (subsection->flags & SEC_DATA && exec_header.exec_dfile == 0)
2984 exec_header.exec_dmem = section->vma;
2985 exec_header.exec_dfile = current_offset;
2988 /* Keep track of exactly where we are within a particular
2989 space. This is necessary as the braindamaged HPUX
2990 loader will create holes between subspaces *and*
2991 subspace alignments are *NOT* preserved. What a crock. */
2992 subspace_offset = subsection->vma;
2994 /* Only do this for the first subspace within each space. */
2997 else if (abfd->flags & (EXEC_P | DYNAMIC))
2999 /* The braindamaged HPUX loader may have created a hole
3000 between two subspaces. It is *not* sufficient to use
3001 the alignment specifications within the subspaces to
3002 account for these holes -- I've run into at least one
3003 case where the loader left one code subspace unaligned
3004 in a final executable.
3006 To combat this we keep a current offset within each space,
3007 and use the subspace vma fields to detect and preserve
3008 holes. What a crock!
3010 ps. This is not necessary for unloadable space/subspaces. */
3011 current_offset += subsection->vma - subspace_offset;
3012 if (subsection->flags & SEC_CODE)
3013 exec_header.exec_tsize += subsection->vma - subspace_offset;
3015 exec_header.exec_dsize += subsection->vma - subspace_offset;
3016 subspace_offset += subsection->vma - subspace_offset;
3020 subsection->target_index = total_subspaces++;
3021 /* This is real data to be loaded from the file. */
3022 if (subsection->flags & SEC_LOAD)
3024 /* Update the size of the code & data. */
3025 if (abfd->flags & (EXEC_P | DYNAMIC)
3026 && subsection->flags & SEC_CODE)
3027 exec_header.exec_tsize += subsection->_cooked_size;
3028 else if (abfd->flags & (EXEC_P | DYNAMIC)
3029 && subsection->flags & SEC_DATA)
3030 exec_header.exec_dsize += subsection->_cooked_size;
3031 som_section_data (subsection)->subspace_dict->file_loc_init_value
3033 subsection->filepos = current_offset;
3034 current_offset += bfd_section_size (abfd, subsection);
3035 subspace_offset += bfd_section_size (abfd, subsection);
3037 /* Looks like uninitialized data. */
3040 /* Update the size of the bss section. */
3041 if (abfd->flags & (EXEC_P | DYNAMIC))
3042 exec_header.exec_bsize += subsection->_cooked_size;
3044 som_section_data (subsection)->subspace_dict->file_loc_init_value
3046 som_section_data (subsection)->subspace_dict->
3047 initialization_length = 0;
3050 /* Goto the next section. */
3051 section = section->next;
3054 /* Finally compute the file positions for unloadable subspaces.
3055 If building an executable, start the unloadable stuff on its
3058 if (abfd->flags & (EXEC_P | DYNAMIC))
3059 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3061 obj_som_file_hdr (abfd)->unloadable_sp_location = current_offset;
3062 section = abfd->sections;
3063 for (i = 0; i < num_spaces; i++)
3065 asection *subsection;
3068 while (!som_is_space (section))
3069 section = section->next;
3071 if (abfd->flags & (EXEC_P | DYNAMIC))
3072 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3074 /* Now look for all its subspaces. */
3075 for (subsection = abfd->sections;
3077 subsection = subsection->next)
3080 if (!som_is_subspace (subsection)
3081 || !som_is_container (section, subsection)
3082 || (subsection->flags & SEC_ALLOC) != 0)
3085 subsection->target_index = total_subspaces;
3086 /* This is real data to be loaded from the file. */
3087 if ((subsection->flags & SEC_LOAD) == 0)
3089 som_section_data (subsection)->subspace_dict->file_loc_init_value
3091 subsection->filepos = current_offset;
3092 current_offset += bfd_section_size (abfd, subsection);
3094 /* Looks like uninitialized data. */
3097 som_section_data (subsection)->subspace_dict->file_loc_init_value
3099 som_section_data (subsection)->subspace_dict->
3100 initialization_length = bfd_section_size (abfd, subsection);
3103 /* Goto the next section. */
3104 section = section->next;
3107 /* If building an executable, then make sure to seek to and write
3108 one byte at the end of the file to make sure any necessary
3109 zeros are filled in. Ugh. */
3110 if (abfd->flags & (EXEC_P | DYNAMIC))
3111 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3112 if (bfd_seek (abfd, current_offset - 1, SEEK_SET) < 0)
3114 if (bfd_write ((PTR) "", 1, 1, abfd) != 1)
3117 obj_som_file_hdr (abfd)->unloadable_sp_size
3118 = current_offset - obj_som_file_hdr (abfd)->unloadable_sp_location;
3120 /* Loader fixups are not supported in any way shape or form. */
3121 obj_som_file_hdr (abfd)->loader_fixup_location = 0;
3122 obj_som_file_hdr (abfd)->loader_fixup_total = 0;
3124 /* Done. Store the total size of the SOM. */
3125 obj_som_file_hdr (abfd)->som_length = current_offset;
3127 /* Now write the exec header. */
3128 if (abfd->flags & (EXEC_P | DYNAMIC))
3132 exec_header.exec_entry = bfd_get_start_address (abfd);
3133 exec_header.exec_flags = obj_som_exec_data (abfd)->exec_flags;
3135 /* Oh joys. Ram some of the BSS data into the DATA section
3136 to be compatable with how the hp linker makes objects
3137 (saves memory space). */
3138 tmp = exec_header.exec_dsize;
3139 tmp = SOM_ALIGN (tmp, PA_PAGESIZE);
3140 exec_header.exec_bsize -= (tmp - exec_header.exec_dsize);
3141 if (exec_header.exec_bsize < 0)
3142 exec_header.exec_bsize = 0;
3143 exec_header.exec_dsize = tmp;
3145 if (bfd_seek (abfd, obj_som_file_hdr (abfd)->aux_header_location,
3149 if (bfd_write ((PTR) &exec_header, AUX_HDR_SIZE, 1, abfd)
3156 /* Finally, scribble out the various headers to the disk. */
3159 som_write_headers (abfd)
3162 int num_spaces = som_count_spaces (abfd);
3164 int subspace_index = 0;
3168 /* Subspaces are written first so that we can set up information
3169 about them in their containing spaces as the subspace is written. */
3171 /* Seek to the start of the subspace dictionary records. */
3172 location = obj_som_file_hdr (abfd)->subspace_location;
3173 if (bfd_seek (abfd, location, SEEK_SET) < 0)
3176 section = abfd->sections;
3177 /* Now for each loadable space write out records for its subspaces. */
3178 for (i = 0; i < num_spaces; i++)
3180 asection *subsection;
3183 while (!som_is_space (section))
3184 section = section->next;
3186 /* Now look for all its subspaces. */
3187 for (subsection = abfd->sections;
3189 subsection = subsection->next)
3192 /* Skip any section which does not correspond to a space
3193 or subspace. Or does not have SEC_ALLOC set (and therefore
3194 has no real bits on the disk). */
3195 if (!som_is_subspace (subsection)
3196 || !som_is_container (section, subsection)
3197 || (subsection->flags & SEC_ALLOC) == 0)
3200 /* If this is the first subspace for this space, then save
3201 the index of the subspace in its containing space. Also
3202 set "is_loadable" in the containing space. */
3204 if (som_section_data (section)->space_dict->subspace_quantity == 0)
3206 som_section_data (section)->space_dict->is_loadable = 1;
3207 som_section_data (section)->space_dict->subspace_index
3211 /* Increment the number of subspaces seen and the number of
3212 subspaces contained within the current space. */
3214 som_section_data (section)->space_dict->subspace_quantity++;
3216 /* Mark the index of the current space within the subspace's
3217 dictionary record. */
3218 som_section_data (subsection)->subspace_dict->space_index = i;
3220 /* Dump the current subspace header. */
3221 if (bfd_write ((PTR) som_section_data (subsection)->subspace_dict,
3222 sizeof (struct subspace_dictionary_record), 1, abfd)
3223 != sizeof (struct subspace_dictionary_record))
3226 /* Goto the next section. */
3227 section = section->next;
3230 /* Now repeat the process for unloadable subspaces. */
3231 section = abfd->sections;
3232 /* Now for each space write out records for its subspaces. */
3233 for (i = 0; i < num_spaces; i++)
3235 asection *subsection;
3238 while (!som_is_space (section))
3239 section = section->next;
3241 /* Now look for all its subspaces. */
3242 for (subsection = abfd->sections;
3244 subsection = subsection->next)
3247 /* Skip any section which does not correspond to a space or
3248 subspace, or which SEC_ALLOC set (and therefore handled
3249 in the loadable spaces/subspaces code above). */
3251 if (!som_is_subspace (subsection)
3252 || !som_is_container (section, subsection)
3253 || (subsection->flags & SEC_ALLOC) != 0)
3256 /* If this is the first subspace for this space, then save
3257 the index of the subspace in its containing space. Clear
3260 if (som_section_data (section)->space_dict->subspace_quantity == 0)
3262 som_section_data (section)->space_dict->is_loadable = 0;
3263 som_section_data (section)->space_dict->subspace_index
3267 /* Increment the number of subspaces seen and the number of
3268 subspaces contained within the current space. */
3269 som_section_data (section)->space_dict->subspace_quantity++;
3272 /* Mark the index of the current space within the subspace's
3273 dictionary record. */
3274 som_section_data (subsection)->subspace_dict->space_index = i;
3276 /* Dump this subspace header. */
3277 if (bfd_write ((PTR) som_section_data (subsection)->subspace_dict,
3278 sizeof (struct subspace_dictionary_record), 1, abfd)
3279 != sizeof (struct subspace_dictionary_record))
3282 /* Goto the next section. */
3283 section = section->next;
3286 /* All the subspace dictiondary records are written, and all the
3287 fields are set up in the space dictionary records.
3289 Seek to the right location and start writing the space
3290 dictionary records. */
3291 location = obj_som_file_hdr (abfd)->space_location;
3292 if (bfd_seek (abfd, location, SEEK_SET) < 0)
3295 section = abfd->sections;
3296 for (i = 0; i < num_spaces; i++)
3300 while (!som_is_space (section))
3301 section = section->next;
3303 /* Dump its header */
3304 if (bfd_write ((PTR) som_section_data (section)->space_dict,
3305 sizeof (struct space_dictionary_record), 1, abfd)
3306 != sizeof (struct space_dictionary_record))
3309 /* Goto the next section. */
3310 section = section->next;
3313 /* Only thing left to do is write out the file header. It is always
3314 at location zero. Seek there and write it. */
3315 if (bfd_seek (abfd, (file_ptr) 0, SEEK_SET) < 0)
3317 if (bfd_write ((PTR) obj_som_file_hdr (abfd),
3318 sizeof (struct header), 1, abfd)
3319 != sizeof (struct header))
3324 /* Compute and return the checksum for a SOM file header. */
3326 static unsigned long
3327 som_compute_checksum (abfd)
3330 unsigned long checksum, count, i;
3331 unsigned long *buffer = (unsigned long *) obj_som_file_hdr (abfd);
3334 count = sizeof (struct header) / sizeof (unsigned long);
3335 for (i = 0; i < count; i++)
3336 checksum ^= *(buffer + i);
3342 som_bfd_derive_misc_symbol_info (abfd, sym, info)
3345 struct som_misc_symbol_info *info;
3348 memset (info, 0, sizeof (struct som_misc_symbol_info));
3350 /* The HP SOM linker requires detailed type information about
3351 all symbols (including undefined symbols!). Unfortunately,
3352 the type specified in an import/export statement does not
3353 always match what the linker wants. Severe braindamage. */
3355 /* Section symbols will not have a SOM symbol type assigned to
3356 them yet. Assign all section symbols type ST_DATA. */
3357 if (sym->flags & BSF_SECTION_SYM)
3358 info->symbol_type = ST_DATA;
3361 /* Common symbols must have scope SS_UNSAT and type
3362 ST_STORAGE or the linker will choke. */
3363 if (sym->section == &bfd_com_section)
3365 info->symbol_scope = SS_UNSAT;
3366 info->symbol_type = ST_STORAGE;
3369 /* It is possible to have a symbol without an associated
3370 type. This happens if the user imported the symbol
3371 without a type and the symbol was never defined
3372 locally. If BSF_FUNCTION is set for this symbol, then
3373 assign it type ST_CODE (the HP linker requires undefined
3374 external functions to have type ST_CODE rather than ST_ENTRY). */
3375 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN
3376 && sym->section == &bfd_und_section
3377 && sym->flags & BSF_FUNCTION)
3378 info->symbol_type = ST_CODE;
3380 /* Handle function symbols which were defined in this file.
3381 They should have type ST_ENTRY. Also retrieve the argument
3382 relocation bits from the SOM backend information. */
3383 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_ENTRY
3384 || (som_symbol_data (sym)->som_type == SYMBOL_TYPE_CODE
3385 && (sym->flags & BSF_FUNCTION))
3386 || (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN
3387 && (sym->flags & BSF_FUNCTION)))
3389 info->symbol_type = ST_ENTRY;
3390 info->arg_reloc = som_symbol_data (sym)->tc_data.hppa_arg_reloc;
3393 /* If the type is unknown at this point, it should be
3394 ST_DATA (functions were handled as special cases above). */
3395 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN)
3396 info->symbol_type = ST_DATA;
3398 /* From now on it's a very simple mapping. */
3399 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_ABSOLUTE)
3400 info->symbol_type = ST_ABSOLUTE;
3401 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_CODE)
3402 info->symbol_type = ST_CODE;
3403 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_DATA)
3404 info->symbol_type = ST_DATA;
3405 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_MILLICODE)
3406 info->symbol_type = ST_MILLICODE;
3407 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_PLABEL)
3408 info->symbol_type = ST_PLABEL;
3409 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_PRI_PROG)
3410 info->symbol_type = ST_PRI_PROG;
3411 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_SEC_PROG)
3412 info->symbol_type = ST_SEC_PROG;
3415 /* Now handle the symbol's scope. Exported data which is not
3416 in the common section has scope SS_UNIVERSAL. Note scope
3417 of common symbols was handled earlier! */
3418 if (sym->flags & BSF_EXPORT && sym->section != &bfd_com_section)
3419 info->symbol_scope = SS_UNIVERSAL;
3420 /* Any undefined symbol at this point has a scope SS_UNSAT. */
3421 else if (sym->section == &bfd_und_section)
3422 info->symbol_scope = SS_UNSAT;
3423 /* Anything else which is not in the common section has scope
3425 else if (sym->section != &bfd_com_section)
3426 info->symbol_scope = SS_LOCAL;
3428 /* Now set the symbol_info field. It has no real meaning
3429 for undefined or common symbols, but the HP linker will
3430 choke if it's not set to some "reasonable" value. We
3431 use zero as a reasonable value. */
3432 if (sym->section == &bfd_com_section || sym->section == &bfd_und_section
3433 || sym->section == &bfd_abs_section)
3434 info->symbol_info = 0;
3435 /* For all other symbols, the symbol_info field contains the
3436 subspace index of the space this symbol is contained in. */
3438 info->symbol_info = sym->section->target_index;
3440 /* Set the symbol's value. */
3441 info->symbol_value = sym->value + sym->section->vma;
3444 /* Build and write, in one big chunk, the entire symbol table for
3448 som_build_and_write_symbol_table (abfd)
3451 unsigned int num_syms = bfd_get_symcount (abfd);
3452 file_ptr symtab_location = obj_som_file_hdr (abfd)->symbol_location;
3453 asymbol **bfd_syms = bfd_get_outsymbols (abfd);
3454 struct symbol_dictionary_record *som_symtab = NULL;
3457 /* Compute total symbol table size and allocate a chunk of memory
3458 to hold the symbol table as we build it. */
3459 symtab_size = num_syms * sizeof (struct symbol_dictionary_record);
3460 som_symtab = (struct symbol_dictionary_record *) malloc (symtab_size);
3461 if (som_symtab == NULL && symtab_size != 0)
3463 bfd_set_error (bfd_error_no_memory);
3466 memset (som_symtab, 0, symtab_size);
3468 /* Walk over each symbol. */
3469 for (i = 0; i < num_syms; i++)
3471 struct som_misc_symbol_info info;
3473 /* This is really an index into the symbol strings table.
3474 By the time we get here, the index has already been
3475 computed and stored into the name field in the BFD symbol. */
3476 som_symtab[i].name.n_strx = (int) bfd_syms[i]->name;
3478 /* Derive SOM information from the BFD symbol. */
3479 som_bfd_derive_misc_symbol_info (abfd, bfd_syms[i], &info);
3482 som_symtab[i].symbol_type = info.symbol_type;
3483 som_symtab[i].symbol_scope = info.symbol_scope;
3484 som_symtab[i].arg_reloc = info.arg_reloc;
3485 som_symtab[i].symbol_info = info.symbol_info;
3486 som_symtab[i].symbol_value = info.symbol_value;
3489 /* Everything is ready, seek to the right location and
3490 scribble out the symbol table. */
3491 if (bfd_seek (abfd, symtab_location, SEEK_SET) != 0)
3494 if (bfd_write ((PTR) som_symtab, symtab_size, 1, abfd) != symtab_size)
3497 if (som_symtab != NULL)
3501 if (som_symtab != NULL)
3506 /* Write an object in SOM format. */
3509 som_write_object_contents (abfd)
3512 if (abfd->output_has_begun == false)
3514 /* Set up fixed parts of the file, space, and subspace headers.
3515 Notify the world that output has begun. */
3516 som_prep_headers (abfd);
3517 abfd->output_has_begun = true;
3518 /* Start writing the object file. This include all the string
3519 tables, fixup streams, and other portions of the object file. */
3520 som_begin_writing (abfd);
3523 /* Now that the symbol table information is complete, build and
3524 write the symbol table. */
3525 if (som_build_and_write_symbol_table (abfd) == false)
3528 /* Compute the checksum for the file header just before writing
3529 the header to disk. */
3530 obj_som_file_hdr (abfd)->checksum = som_compute_checksum (abfd);
3531 return (som_write_headers (abfd));
3535 /* Read and save the string table associated with the given BFD. */
3538 som_slurp_string_table (abfd)
3543 /* Use the saved version if its available. */
3544 if (obj_som_stringtab (abfd) != NULL)
3547 /* I don't think this can currently happen, and I'm not sure it should
3548 really be an error, but it's better than getting unpredictable results
3549 from the host's malloc when passed a size of zero. */
3550 if (obj_som_stringtab_size (abfd) == 0)
3552 bfd_set_error (bfd_error_no_symbols);
3556 /* Allocate and read in the string table. */
3557 stringtab = malloc (obj_som_stringtab_size (abfd));
3558 if (stringtab == NULL)
3560 bfd_set_error (bfd_error_no_memory);
3564 if (bfd_seek (abfd, obj_som_str_filepos (abfd), SEEK_SET) < 0)
3567 if (bfd_read (stringtab, obj_som_stringtab_size (abfd), 1, abfd)
3568 != obj_som_stringtab_size (abfd))
3571 /* Save our results and return success. */
3572 obj_som_stringtab (abfd) = stringtab;
3576 /* Return the amount of data (in bytes) required to hold the symbol
3577 table for this object. */
3580 som_get_symtab_upper_bound (abfd)
3583 if (!som_slurp_symbol_table (abfd))
3586 return (bfd_get_symcount (abfd) + 1) * (sizeof (asymbol *));
3589 /* Convert from a SOM subspace index to a BFD section. */
3592 bfd_section_from_som_symbol (abfd, symbol)
3594 struct symbol_dictionary_record *symbol;
3598 /* The meaning of the symbol_info field changes for functions
3599 within executables. So only use the quick symbol_info mapping for
3600 incomplete objects and non-function symbols in executables. */
3601 if ((abfd->flags & (EXEC_P | DYNAMIC)) == 0
3602 || (symbol->symbol_type != ST_ENTRY
3603 && symbol->symbol_type != ST_PRI_PROG
3604 && symbol->symbol_type != ST_SEC_PROG
3605 && symbol->symbol_type != ST_MILLICODE))
3607 unsigned int index = symbol->symbol_info;
3608 for (section = abfd->sections; section != NULL; section = section->next)
3609 if (section->target_index == index)
3612 /* Should never happen. */
3617 unsigned int value = symbol->symbol_value;
3618 unsigned int found = 0;
3620 /* For executables we will have to use the symbol's address and
3621 find out what section would contain that address. Yuk. */
3622 for (section = abfd->sections; section; section = section->next)
3624 if (value >= section->vma
3625 && value <= section->vma + section->_cooked_size)
3629 /* Should never happen. */
3634 /* Read and save the symbol table associated with the given BFD. */
3637 som_slurp_symbol_table (abfd)
3640 int symbol_count = bfd_get_symcount (abfd);
3641 int symsize = sizeof (struct symbol_dictionary_record);
3643 struct symbol_dictionary_record *buf = NULL, *bufp, *endbufp;
3644 som_symbol_type *sym, *symbase;
3646 /* Return saved value if it exists. */
3647 if (obj_som_symtab (abfd) != NULL)
3648 goto successful_return;
3650 /* Special case. This is *not* an error. */
3651 if (symbol_count == 0)
3652 goto successful_return;
3654 if (!som_slurp_string_table (abfd))
3657 stringtab = obj_som_stringtab (abfd);
3659 symbase = (som_symbol_type *)
3660 malloc (symbol_count * sizeof (som_symbol_type));
3661 if (symbase == NULL)
3663 bfd_set_error (bfd_error_no_memory);
3667 /* Read in the external SOM representation. */
3668 buf = malloc (symbol_count * symsize);
3669 if (buf == NULL && symbol_count * symsize != 0)
3671 bfd_set_error (bfd_error_no_memory);
3674 if (bfd_seek (abfd, obj_som_sym_filepos (abfd), SEEK_SET) < 0)
3676 if (bfd_read (buf, symbol_count * symsize, 1, abfd)
3677 != symbol_count * symsize)
3680 /* Iterate over all the symbols and internalize them. */
3681 endbufp = buf + symbol_count;
3682 for (bufp = buf, sym = symbase; bufp < endbufp; ++bufp)
3685 /* I don't think we care about these. */
3686 if (bufp->symbol_type == ST_SYM_EXT
3687 || bufp->symbol_type == ST_ARG_EXT)
3690 /* Set some private data we care about. */
3691 if (bufp->symbol_type == ST_NULL)
3692 som_symbol_data (sym)->som_type = SYMBOL_TYPE_UNKNOWN;
3693 else if (bufp->symbol_type == ST_ABSOLUTE)
3694 som_symbol_data (sym)->som_type = SYMBOL_TYPE_ABSOLUTE;
3695 else if (bufp->symbol_type == ST_DATA)
3696 som_symbol_data (sym)->som_type = SYMBOL_TYPE_DATA;
3697 else if (bufp->symbol_type == ST_CODE)
3698 som_symbol_data (sym)->som_type = SYMBOL_TYPE_CODE;
3699 else if (bufp->symbol_type == ST_PRI_PROG)
3700 som_symbol_data (sym)->som_type = SYMBOL_TYPE_PRI_PROG;
3701 else if (bufp->symbol_type == ST_SEC_PROG)
3702 som_symbol_data (sym)->som_type = SYMBOL_TYPE_SEC_PROG;
3703 else if (bufp->symbol_type == ST_ENTRY)
3704 som_symbol_data (sym)->som_type = SYMBOL_TYPE_ENTRY;
3705 else if (bufp->symbol_type == ST_MILLICODE)
3706 som_symbol_data (sym)->som_type = SYMBOL_TYPE_MILLICODE;
3707 else if (bufp->symbol_type == ST_PLABEL)
3708 som_symbol_data (sym)->som_type = SYMBOL_TYPE_PLABEL;
3710 som_symbol_data (sym)->som_type = SYMBOL_TYPE_UNKNOWN;
3711 som_symbol_data (sym)->tc_data.hppa_arg_reloc = bufp->arg_reloc;
3713 /* Some reasonable defaults. */
3714 sym->symbol.the_bfd = abfd;
3715 sym->symbol.name = bufp->name.n_strx + stringtab;
3716 sym->symbol.value = bufp->symbol_value;
3717 sym->symbol.section = 0;
3718 sym->symbol.flags = 0;
3720 switch (bufp->symbol_type)
3726 sym->symbol.flags |= BSF_FUNCTION;
3727 sym->symbol.value &= ~0x3;
3732 sym->symbol.value &= ~0x3;
3738 /* Handle scoping and section information. */
3739 switch (bufp->symbol_scope)
3741 /* symbol_info field is undefined for SS_EXTERNAL and SS_UNSAT symbols,
3742 so the section associated with this symbol can't be known. */
3744 if (bufp->symbol_type != ST_STORAGE)
3745 sym->symbol.section = &bfd_und_section;
3747 sym->symbol.section = &bfd_com_section;
3748 sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL);
3752 if (bufp->symbol_type != ST_STORAGE)
3753 sym->symbol.section = &bfd_und_section;
3755 sym->symbol.section = &bfd_com_section;
3759 sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL);
3760 sym->symbol.section = bfd_section_from_som_symbol (abfd, bufp);
3761 sym->symbol.value -= sym->symbol.section->vma;
3765 /* SS_GLOBAL and SS_LOCAL are two names for the same thing.
3766 Sound dumb? It is. */
3770 sym->symbol.flags |= BSF_LOCAL;
3771 sym->symbol.section = bfd_section_from_som_symbol (abfd, bufp);
3772 sym->symbol.value -= sym->symbol.section->vma;
3776 /* Mark section symbols and symbols used by the debugger. */
3777 if (sym->symbol.name[0] == '$'
3778 && sym->symbol.name[strlen (sym->symbol.name) - 1] == '$')
3779 sym->symbol.flags |= BSF_SECTION_SYM;
3780 else if (!strncmp (sym->symbol.name, "L$0\002", 4))
3782 sym->symbol.flags |= BSF_SECTION_SYM;
3783 sym->symbol.name = sym->symbol.section->name;
3785 else if (!strncmp (sym->symbol.name, "L$0\001", 4))
3786 sym->symbol.flags |= BSF_DEBUGGING;
3788 /* Note increment at bottom of loop, since we skip some symbols
3789 we can not include it as part of the for statement. */
3793 /* Save our results and return success. */
3794 obj_som_symtab (abfd) = symbase;
3806 /* Canonicalize a SOM symbol table. Return the number of entries
3807 in the symbol table. */
3810 som_get_symtab (abfd, location)
3815 som_symbol_type *symbase;
3817 if (!som_slurp_symbol_table (abfd))
3820 i = bfd_get_symcount (abfd);
3821 symbase = obj_som_symtab (abfd);
3823 for (; i > 0; i--, location++, symbase++)
3824 *location = &symbase->symbol;
3826 /* Final null pointer. */
3828 return (bfd_get_symcount (abfd));
3831 /* Make a SOM symbol. There is nothing special to do here. */
3834 som_make_empty_symbol (abfd)
3837 som_symbol_type *new =
3838 (som_symbol_type *) bfd_zalloc (abfd, sizeof (som_symbol_type));
3841 bfd_set_error (bfd_error_no_memory);
3844 new->symbol.the_bfd = abfd;
3846 return &new->symbol;
3849 /* Print symbol information. */
3852 som_print_symbol (ignore_abfd, afile, symbol, how)
3856 bfd_print_symbol_type how;
3858 FILE *file = (FILE *) afile;
3861 case bfd_print_symbol_name:
3862 fprintf (file, "%s", symbol->name);
3864 case bfd_print_symbol_more:
3865 fprintf (file, "som ");
3866 fprintf_vma (file, symbol->value);
3867 fprintf (file, " %lx", (long) symbol->flags);
3869 case bfd_print_symbol_all:
3871 CONST char *section_name;
3872 section_name = symbol->section ? symbol->section->name : "(*none*)";
3873 bfd_print_symbol_vandf ((PTR) file, symbol);
3874 fprintf (file, " %s\t%s", section_name, symbol->name);
3881 som_bfd_is_local_label (abfd, sym)
3885 return (sym->name[0] == 'L' && sym->name[1] == '$');
3888 /* Count or process variable-length SOM fixup records.
3890 To avoid code duplication we use this code both to compute the number
3891 of relocations requested by a stream, and to internalize the stream.
3893 When computing the number of relocations requested by a stream the
3894 variables rptr, section, and symbols have no meaning.
3896 Return the number of relocations requested by the fixup stream. When
3899 This needs at least two or three more passes to get it cleaned up. */
3902 som_set_reloc_info (fixup, end, internal_relocs, section, symbols, just_count)
3903 unsigned char *fixup;
3905 arelent *internal_relocs;
3910 unsigned int op, varname;
3911 unsigned char *end_fixups = &fixup[end];
3912 const struct fixup_format *fp;
3914 unsigned char *save_fixup;
3915 int variables[26], stack[20], c, v, count, prev_fixup, *sp;
3917 arelent *rptr= internal_relocs;
3918 unsigned int offset = just_count ? 0 : section->vma;
3920 #define var(c) variables[(c) - 'A']
3921 #define push(v) (*sp++ = (v))
3922 #define pop() (*--sp)
3923 #define emptystack() (sp == stack)
3925 som_initialize_reloc_queue (reloc_queue);
3926 memset (variables, 0, sizeof (variables));
3927 memset (stack, 0, sizeof (stack));
3932 while (fixup < end_fixups)
3935 /* Save pointer to the start of this fixup. We'll use
3936 it later to determine if it is necessary to put this fixup
3940 /* Get the fixup code and its associated format. */
3942 fp = &som_fixup_formats[op];
3944 /* Handle a request for a previous fixup. */
3945 if (*fp->format == 'P')
3947 /* Get pointer to the beginning of the prev fixup, move
3948 the repeated fixup to the head of the queue. */
3949 fixup = reloc_queue[fp->D].reloc;
3950 som_reloc_queue_fix (reloc_queue, fp->D);
3953 /* Get the fixup code and its associated format. */
3955 fp = &som_fixup_formats[op];
3958 /* If we are not just counting, set some reasonable defaults. */
3961 rptr->address = offset;
3962 rptr->howto = &som_hppa_howto_table[op];
3964 rptr->sym_ptr_ptr = bfd_abs_section.symbol_ptr_ptr;
3967 /* Set default input length to 0. Get the opcode class index
3972 /* Get the opcode format. */
3975 /* Process the format string. Parsing happens in two phases,
3976 parse RHS, then assign to LHS. Repeat until no more
3977 characters in the format string. */
3980 /* The variable this pass is going to compute a value for. */
3983 /* Start processing RHS. Continue until a NULL or '=' is found. */
3988 /* If this is a variable, push it on the stack. */
3992 /* If this is a lower case letter, then it represents
3993 additional data from the fixup stream to be pushed onto
3995 else if (islower (c))
3997 for (v = 0; c > 'a'; --c)
3998 v = (v << 8) | *fixup++;
4002 /* A decimal constant. Push it on the stack. */
4003 else if (isdigit (c))
4006 while (isdigit (*cp))
4007 v = (v * 10) + (*cp++ - '0');
4012 /* An operator. Pop two two values from the stack and
4013 use them as operands to the given operation. Push
4014 the result of the operation back on the stack. */
4036 while (*cp && *cp != '=');
4038 /* Move over the equal operator. */
4041 /* Pop the RHS off the stack. */
4044 /* Perform the assignment. */
4047 /* Handle side effects. and special 'O' stack cases. */
4050 /* Consume some bytes from the input space. */
4054 /* A symbol to use in the relocation. Make a note
4055 of this if we are not just counting. */
4058 rptr->sym_ptr_ptr = &symbols[c];
4060 /* Handle the linker expression stack. */
4065 subop = comp1_opcodes;
4068 subop = comp2_opcodes;
4071 subop = comp3_opcodes;
4076 while (*subop <= (unsigned char) c)
4085 /* If we used a previous fixup, clean up after it. */
4088 fixup = save_fixup + 1;
4092 else if (fixup > save_fixup + 1)
4093 som_reloc_queue_insert (save_fixup, fixup - save_fixup, reloc_queue);
4095 /* We do not pass R_DATA_OVERRIDE or R_NO_RELOCATION
4097 if (som_hppa_howto_table[op].type != R_DATA_OVERRIDE
4098 && som_hppa_howto_table[op].type != R_NO_RELOCATION)
4100 /* Done with a single reloction. Loop back to the top. */
4103 rptr->addend = var ('V');
4107 /* Now that we've handled a "full" relocation, reset
4109 memset (variables, 0, sizeof (variables));
4110 memset (stack, 0, sizeof (stack));
4121 /* Read in the relocs (aka fixups in SOM terms) for a section.
4123 som_get_reloc_upper_bound calls this routine with JUST_COUNT
4124 set to true to indicate it only needs a count of the number
4125 of actual relocations. */
4128 som_slurp_reloc_table (abfd, section, symbols, just_count)
4134 char *external_relocs;
4135 unsigned int fixup_stream_size;
4136 arelent *internal_relocs;
4137 unsigned int num_relocs;
4139 fixup_stream_size = som_section_data (section)->reloc_size;
4140 /* If there were no relocations, then there is nothing to do. */
4141 if (section->reloc_count == 0)
4144 /* If reloc_count is -1, then the relocation stream has not been
4145 parsed. We must do so now to know how many relocations exist. */
4146 if (section->reloc_count == -1)
4148 external_relocs = (char *) malloc (fixup_stream_size);
4149 if (external_relocs == (char *) NULL)
4151 bfd_set_error (bfd_error_no_memory);
4154 /* Read in the external forms. */
4156 obj_som_reloc_filepos (abfd) + section->rel_filepos,
4160 if (bfd_read (external_relocs, 1, fixup_stream_size, abfd)
4161 != fixup_stream_size)
4164 /* Let callers know how many relocations found.
4165 also save the relocation stream as we will
4167 section->reloc_count = som_set_reloc_info (external_relocs,
4169 NULL, NULL, NULL, true);
4171 som_section_data (section)->reloc_stream = external_relocs;
4174 /* If the caller only wanted a count, then return now. */
4178 num_relocs = section->reloc_count;
4179 external_relocs = som_section_data (section)->reloc_stream;
4180 /* Return saved information about the relocations if it is available. */
4181 if (section->relocation != (arelent *) NULL)
4184 internal_relocs = (arelent *) malloc (num_relocs * sizeof (arelent));
4185 if (internal_relocs == (arelent *) NULL)
4187 bfd_set_error (bfd_error_no_memory);
4191 /* Process and internalize the relocations. */
4192 som_set_reloc_info (external_relocs, fixup_stream_size,
4193 internal_relocs, section, symbols, false);
4195 /* Save our results and return success. */
4196 section->relocation = internal_relocs;
4200 /* Return the number of bytes required to store the relocation
4201 information associated with the given section. */
4204 som_get_reloc_upper_bound (abfd, asect)
4208 /* If section has relocations, then read in the relocation stream
4209 and parse it to determine how many relocations exist. */
4210 if (asect->flags & SEC_RELOC)
4212 if (! som_slurp_reloc_table (abfd, asect, NULL, true))
4214 return (asect->reloc_count + 1) * sizeof (arelent);
4216 /* There are no relocations. */
4220 /* Convert relocations from SOM (external) form into BFD internal
4221 form. Return the number of relocations. */
4224 som_canonicalize_reloc (abfd, section, relptr, symbols)
4233 if (som_slurp_reloc_table (abfd, section, symbols, false) == false)
4236 count = section->reloc_count;
4237 tblptr = section->relocation;
4240 *relptr++ = tblptr++;
4242 *relptr = (arelent *) NULL;
4243 return section->reloc_count;
4246 extern bfd_target som_vec;
4248 /* A hook to set up object file dependent section information. */
4251 som_new_section_hook (abfd, newsect)
4255 newsect->used_by_bfd =
4256 (PTR) bfd_zalloc (abfd, sizeof (struct som_section_data_struct));
4257 if (!newsect->used_by_bfd)
4259 bfd_set_error (bfd_error_no_memory);
4262 newsect->alignment_power = 3;
4264 /* We allow more than three sections internally */
4268 /* Copy any private info we understand from the input section
4269 to the output section. */
4271 som_bfd_copy_private_section_data (ibfd, isection, obfd, osection)
4277 /* One day we may try to grok other private data. */
4278 if (ibfd->xvec->flavour != bfd_target_som_flavour
4279 || obfd->xvec->flavour != bfd_target_som_flavour
4280 || (!som_is_space (isection) && !som_is_subspace (isection)))
4283 som_section_data (osection)->copy_data
4284 = (struct som_copyable_section_data_struct *)
4285 bfd_zalloc (obfd, sizeof (struct som_copyable_section_data_struct));
4286 if (som_section_data (osection)->copy_data == NULL)
4288 bfd_set_error (bfd_error_no_memory);
4292 memcpy (som_section_data (osection)->copy_data,
4293 som_section_data (isection)->copy_data,
4294 sizeof (struct som_copyable_section_data_struct));
4296 /* Reparent if necessary. */
4297 if (som_section_data (osection)->copy_data->container)
4298 som_section_data (osection)->copy_data->container =
4299 som_section_data (osection)->copy_data->container->output_section;
4304 /* Copy any private info we understand from the input bfd
4305 to the output bfd. */
4308 som_bfd_copy_private_bfd_data (ibfd, obfd)
4311 /* One day we may try to grok other private data. */
4312 if (ibfd->xvec->flavour != bfd_target_som_flavour
4313 || obfd->xvec->flavour != bfd_target_som_flavour)
4316 /* Allocate some memory to hold the data we need. */
4317 obj_som_exec_data (obfd) = (struct som_exec_data *)
4318 bfd_zalloc (obfd, sizeof (struct som_exec_data));
4319 if (obj_som_exec_data (obfd) == NULL)
4321 bfd_set_error (bfd_error_no_memory);
4325 /* Now copy the data. */
4326 memcpy (obj_som_exec_data (obfd), obj_som_exec_data (ibfd),
4327 sizeof (struct som_exec_data));
4332 /* Set backend info for sections which can not be described
4333 in the BFD data structures. */
4336 bfd_som_set_section_attributes (section, defined, private, sort_key, spnum)
4340 unsigned int sort_key;
4343 /* Allocate memory to hold the magic information. */
4344 if (som_section_data (section)->copy_data == NULL)
4346 som_section_data (section)->copy_data
4347 = (struct som_copyable_section_data_struct *)
4348 bfd_zalloc (section->owner,
4349 sizeof (struct som_copyable_section_data_struct));
4350 if (som_section_data (section)->copy_data == NULL)
4352 bfd_set_error (bfd_error_no_memory);
4356 som_section_data (section)->copy_data->sort_key = sort_key;
4357 som_section_data (section)->copy_data->is_defined = defined;
4358 som_section_data (section)->copy_data->is_private = private;
4359 som_section_data (section)->copy_data->container = section;
4360 section->target_index = spnum;
4364 /* Set backend info for subsections which can not be described
4365 in the BFD data structures. */
4368 bfd_som_set_subsection_attributes (section, container, access,
4371 asection *container;
4373 unsigned int sort_key;
4376 /* Allocate memory to hold the magic information. */
4377 if (som_section_data (section)->copy_data == NULL)
4379 som_section_data (section)->copy_data
4380 = (struct som_copyable_section_data_struct *)
4381 bfd_zalloc (section->owner,
4382 sizeof (struct som_copyable_section_data_struct));
4383 if (som_section_data (section)->copy_data == NULL)
4385 bfd_set_error (bfd_error_no_memory);
4389 som_section_data (section)->copy_data->sort_key = sort_key;
4390 som_section_data (section)->copy_data->access_control_bits = access;
4391 som_section_data (section)->copy_data->quadrant = quadrant;
4392 som_section_data (section)->copy_data->container = container;
4396 /* Set the full SOM symbol type. SOM needs far more symbol information
4397 than any other object file format I'm aware of. It is mandatory
4398 to be able to know if a symbol is an entry point, millicode, data,
4399 code, absolute, storage request, or procedure label. If you get
4400 the symbol type wrong your program will not link. */
4403 bfd_som_set_symbol_type (symbol, type)
4407 som_symbol_data (symbol)->som_type = type;
4410 /* Attach 64bits of unwind information to a symbol (which hopefully
4411 is a function of some kind!). It would be better to keep this
4412 in the R_ENTRY relocation, but there is not enough space. */
4415 bfd_som_attach_unwind_info (symbol, unwind_desc)
4419 som_symbol_data (symbol)->unwind = unwind_desc;
4422 /* Attach an auxiliary header to the BFD backend so that it may be
4423 written into the object file. */
4425 bfd_som_attach_aux_hdr (abfd, type, string)
4430 if (type == VERSION_AUX_ID)
4432 int len = strlen (string);
4436 pad = (4 - (len % 4));
4437 obj_som_version_hdr (abfd) = (struct user_string_aux_hdr *)
4438 bfd_zalloc (abfd, sizeof (struct aux_id)
4439 + sizeof (unsigned int) + len + pad);
4440 if (!obj_som_version_hdr (abfd))
4442 bfd_set_error (bfd_error_no_memory);
4445 obj_som_version_hdr (abfd)->header_id.type = VERSION_AUX_ID;
4446 obj_som_version_hdr (abfd)->header_id.length = len + pad;
4447 obj_som_version_hdr (abfd)->header_id.length += sizeof (int);
4448 obj_som_version_hdr (abfd)->string_length = len;
4449 strncpy (obj_som_version_hdr (abfd)->user_string, string, len);
4451 else if (type == COPYRIGHT_AUX_ID)
4453 int len = strlen (string);
4457 pad = (4 - (len % 4));
4458 obj_som_copyright_hdr (abfd) = (struct copyright_aux_hdr *)
4459 bfd_zalloc (abfd, sizeof (struct aux_id)
4460 + sizeof (unsigned int) + len + pad);
4461 if (!obj_som_copyright_hdr (abfd))
4463 bfd_set_error (bfd_error_no_memory);
4466 obj_som_copyright_hdr (abfd)->header_id.type = COPYRIGHT_AUX_ID;
4467 obj_som_copyright_hdr (abfd)->header_id.length = len + pad;
4468 obj_som_copyright_hdr (abfd)->header_id.length += sizeof (int);
4469 obj_som_copyright_hdr (abfd)->string_length = len;
4470 strcpy (obj_som_copyright_hdr (abfd)->copyright, string);
4476 som_get_section_contents (abfd, section, location, offset, count)
4481 bfd_size_type count;
4483 if (count == 0 || ((section->flags & (SEC_LOAD | SEC_DEBUGGING)) == 0))
4485 if ((bfd_size_type)(offset+count) > section->_raw_size
4486 || bfd_seek (abfd, (file_ptr)(section->filepos + offset), SEEK_SET) == -1
4487 || bfd_read (location, (bfd_size_type)1, count, abfd) != count)
4488 return (false); /* on error */
4493 som_set_section_contents (abfd, section, location, offset, count)
4498 bfd_size_type count;
4500 if (abfd->output_has_begun == false)
4502 /* Set up fixed parts of the file, space, and subspace headers.
4503 Notify the world that output has begun. */
4504 som_prep_headers (abfd);
4505 abfd->output_has_begun = true;
4506 /* Start writing the object file. This include all the string
4507 tables, fixup streams, and other portions of the object file. */
4508 som_begin_writing (abfd);
4511 /* Only write subspaces which have "real" contents (eg. the contents
4512 are not generated at run time by the OS). */
4513 if (!som_is_subspace (section)
4514 || ((section->flags & (SEC_LOAD | SEC_DEBUGGING)) == 0))
4517 /* Seek to the proper offset within the object file and write the
4519 offset += som_section_data (section)->subspace_dict->file_loc_init_value;
4520 if (bfd_seek (abfd, offset, SEEK_SET) == -1)
4523 if (bfd_write ((PTR) location, 1, count, abfd) != count)
4529 som_set_arch_mach (abfd, arch, machine)
4531 enum bfd_architecture arch;
4532 unsigned long machine;
4534 /* Allow any architecture to be supported by the SOM backend */
4535 return bfd_default_set_arch_mach (abfd, arch, machine);
4539 som_find_nearest_line (abfd, section, symbols, offset, filename_ptr,
4540 functionname_ptr, line_ptr)
4545 CONST char **filename_ptr;
4546 CONST char **functionname_ptr;
4547 unsigned int *line_ptr;
4549 fprintf (stderr, "som_find_nearest_line unimplemented\n");
4556 som_sizeof_headers (abfd, reloc)
4560 fprintf (stderr, "som_sizeof_headers unimplemented\n");
4566 /* Return the single-character symbol type corresponding to
4567 SOM section S, or '?' for an unknown SOM section. */
4570 som_section_type (s)
4573 const struct section_to_type *t;
4575 for (t = &stt[0]; t->section; t++)
4576 if (!strcmp (s, t->section))
4582 som_decode_symclass (symbol)
4587 if (bfd_is_com_section (symbol->section))
4589 if (symbol->section == &bfd_und_section)
4591 if (symbol->section == &bfd_ind_section)
4593 if (!(symbol->flags & (BSF_GLOBAL|BSF_LOCAL)))
4596 if (symbol->section == &bfd_abs_section)
4598 else if (symbol->section)
4599 c = som_section_type (symbol->section->name);
4602 if (symbol->flags & BSF_GLOBAL)
4607 /* Return information about SOM symbol SYMBOL in RET. */
4610 som_get_symbol_info (ignore_abfd, symbol, ret)
4615 ret->type = som_decode_symclass (symbol);
4616 if (ret->type != 'U')
4617 ret->value = symbol->value+symbol->section->vma;
4620 ret->name = symbol->name;
4623 /* Count the number of symbols in the archive symbol table. Necessary
4624 so that we can allocate space for all the carsyms at once. */
4627 som_bfd_count_ar_symbols (abfd, lst_header, count)
4629 struct lst_header *lst_header;
4633 unsigned int *hash_table = NULL;
4634 file_ptr lst_filepos = bfd_tell (abfd) - sizeof (struct lst_header);
4637 (unsigned int *) malloc (lst_header->hash_size * sizeof (unsigned int));
4638 if (hash_table == NULL && lst_header->hash_size != 0)
4640 bfd_set_error (bfd_error_no_memory);
4644 /* Don't forget to initialize the counter! */
4647 /* Read in the hash table. The has table is an array of 32bit file offsets
4648 which point to the hash chains. */
4649 if (bfd_read ((PTR) hash_table, lst_header->hash_size, 4, abfd)
4650 != lst_header->hash_size * 4)
4653 /* Walk each chain counting the number of symbols found on that particular
4655 for (i = 0; i < lst_header->hash_size; i++)
4657 struct lst_symbol_record lst_symbol;
4659 /* An empty chain has zero as it's file offset. */
4660 if (hash_table[i] == 0)
4663 /* Seek to the first symbol in this hash chain. */
4664 if (bfd_seek (abfd, lst_filepos + hash_table[i], SEEK_SET) < 0)
4667 /* Read in this symbol and update the counter. */
4668 if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd)
4669 != sizeof (lst_symbol))
4674 /* Now iterate through the rest of the symbols on this chain. */
4675 while (lst_symbol.next_entry)
4678 /* Seek to the next symbol. */
4679 if (bfd_seek (abfd, lst_filepos + lst_symbol.next_entry, SEEK_SET)
4683 /* Read the symbol in and update the counter. */
4684 if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd)
4685 != sizeof (lst_symbol))
4691 if (hash_table != NULL)
4696 if (hash_table != NULL)
4701 /* Fill in the canonical archive symbols (SYMS) from the archive described
4702 by ABFD and LST_HEADER. */
4705 som_bfd_fill_in_ar_symbols (abfd, lst_header, syms)
4707 struct lst_header *lst_header;
4710 unsigned int i, len;
4711 carsym *set = syms[0];
4712 unsigned int *hash_table = NULL;
4713 struct som_entry *som_dict = NULL;
4714 file_ptr lst_filepos = bfd_tell (abfd) - sizeof (struct lst_header);
4717 (unsigned int *) malloc (lst_header->hash_size * sizeof (unsigned int));
4718 if (hash_table == NULL && lst_header->hash_size != 0)
4720 bfd_set_error (bfd_error_no_memory);
4725 (struct som_entry *) malloc (lst_header->module_count
4726 * sizeof (struct som_entry));
4727 if (som_dict == NULL && lst_header->module_count != 0)
4729 bfd_set_error (bfd_error_no_memory);
4733 /* Read in the hash table. The has table is an array of 32bit file offsets
4734 which point to the hash chains. */
4735 if (bfd_read ((PTR) hash_table, lst_header->hash_size, 4, abfd)
4736 != lst_header->hash_size * 4)
4739 /* Seek to and read in the SOM dictionary. We will need this to fill
4740 in the carsym's filepos field. */
4741 if (bfd_seek (abfd, lst_filepos + lst_header->dir_loc, SEEK_SET) < 0)
4744 if (bfd_read ((PTR) som_dict, lst_header->module_count,
4745 sizeof (struct som_entry), abfd)
4746 != lst_header->module_count * sizeof (struct som_entry))
4749 /* Walk each chain filling in the carsyms as we go along. */
4750 for (i = 0; i < lst_header->hash_size; i++)
4752 struct lst_symbol_record lst_symbol;
4754 /* An empty chain has zero as it's file offset. */
4755 if (hash_table[i] == 0)
4758 /* Seek to and read the first symbol on the chain. */
4759 if (bfd_seek (abfd, lst_filepos + hash_table[i], SEEK_SET) < 0)
4762 if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd)
4763 != sizeof (lst_symbol))
4766 /* Get the name of the symbol, first get the length which is stored
4767 as a 32bit integer just before the symbol.
4769 One might ask why we don't just read in the entire string table
4770 and index into it. Well, according to the SOM ABI the string
4771 index can point *anywhere* in the archive to save space, so just
4772 using the string table would not be safe. */
4773 if (bfd_seek (abfd, lst_filepos + lst_header->string_loc
4774 + lst_symbol.name.n_strx - 4, SEEK_SET) < 0)
4777 if (bfd_read (&len, 1, 4, abfd) != 4)
4780 /* Allocate space for the name and null terminate it too. */
4781 set->name = bfd_zalloc (abfd, len + 1);
4784 bfd_set_error (bfd_error_no_memory);
4787 if (bfd_read (set->name, 1, len, abfd) != len)
4792 /* Fill in the file offset. Note that the "location" field points
4793 to the SOM itself, not the ar_hdr in front of it. */
4794 set->file_offset = som_dict[lst_symbol.som_index].location
4795 - sizeof (struct ar_hdr);
4797 /* Go to the next symbol. */
4800 /* Iterate through the rest of the chain. */
4801 while (lst_symbol.next_entry)
4803 /* Seek to the next symbol and read it in. */
4804 if (bfd_seek (abfd, lst_filepos + lst_symbol.next_entry, SEEK_SET) <0)
4807 if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd)
4808 != sizeof (lst_symbol))
4811 /* Seek to the name length & string and read them in. */
4812 if (bfd_seek (abfd, lst_filepos + lst_header->string_loc
4813 + lst_symbol.name.n_strx - 4, SEEK_SET) < 0)
4816 if (bfd_read (&len, 1, 4, abfd) != 4)
4819 /* Allocate space for the name and null terminate it too. */
4820 set->name = bfd_zalloc (abfd, len + 1);
4823 bfd_set_error (bfd_error_no_memory);
4827 if (bfd_read (set->name, 1, len, abfd) != len)
4831 /* Fill in the file offset. Note that the "location" field points
4832 to the SOM itself, not the ar_hdr in front of it. */
4833 set->file_offset = som_dict[lst_symbol.som_index].location
4834 - sizeof (struct ar_hdr);
4836 /* Go on to the next symbol. */
4840 /* If we haven't died by now, then we successfully read the entire
4841 archive symbol table. */
4842 if (hash_table != NULL)
4844 if (som_dict != NULL)
4849 if (hash_table != NULL)
4851 if (som_dict != NULL)
4856 /* Read in the LST from the archive. */
4858 som_slurp_armap (abfd)
4861 struct lst_header lst_header;
4862 struct ar_hdr ar_header;
4863 unsigned int parsed_size;
4864 struct artdata *ardata = bfd_ardata (abfd);
4866 int i = bfd_read ((PTR) nextname, 1, 16, abfd);
4868 /* Special cases. */
4874 if (bfd_seek (abfd, (file_ptr) - 16, SEEK_CUR) < 0)
4877 /* For archives without .o files there is no symbol table. */
4878 if (strncmp (nextname, "/ ", 16))
4880 bfd_has_map (abfd) = false;
4884 /* Read in and sanity check the archive header. */
4885 if (bfd_read ((PTR) &ar_header, 1, sizeof (struct ar_hdr), abfd)
4886 != sizeof (struct ar_hdr))
4889 if (strncmp (ar_header.ar_fmag, ARFMAG, 2))
4891 bfd_set_error (bfd_error_malformed_archive);
4895 /* How big is the archive symbol table entry? */
4897 parsed_size = strtol (ar_header.ar_size, NULL, 10);
4900 bfd_set_error (bfd_error_malformed_archive);
4904 /* Save off the file offset of the first real user data. */
4905 ardata->first_file_filepos = bfd_tell (abfd) + parsed_size;
4907 /* Read in the library symbol table. We'll make heavy use of this
4908 in just a minute. */
4909 if (bfd_read ((PTR) & lst_header, 1, sizeof (struct lst_header), abfd)
4910 != sizeof (struct lst_header))
4914 if (lst_header.a_magic != LIBMAGIC)
4916 bfd_set_error (bfd_error_malformed_archive);
4920 /* Count the number of symbols in the library symbol table. */
4921 if (som_bfd_count_ar_symbols (abfd, &lst_header, &ardata->symdef_count)
4925 /* Get back to the start of the library symbol table. */
4926 if (bfd_seek (abfd, ardata->first_file_filepos - parsed_size
4927 + sizeof (struct lst_header), SEEK_SET) < 0)
4930 /* Initializae the cache and allocate space for the library symbols. */
4932 ardata->symdefs = (carsym *) bfd_alloc (abfd,
4933 (ardata->symdef_count
4934 * sizeof (carsym)));
4935 if (!ardata->symdefs)
4937 bfd_set_error (bfd_error_no_memory);
4941 /* Now fill in the canonical archive symbols. */
4942 if (som_bfd_fill_in_ar_symbols (abfd, &lst_header, &ardata->symdefs)
4946 /* Seek back to the "first" file in the archive. Note the "first"
4947 file may be the extended name table. */
4948 if (bfd_seek (abfd, ardata->first_file_filepos, SEEK_SET) < 0)
4951 /* Notify the generic archive code that we have a symbol map. */
4952 bfd_has_map (abfd) = true;
4956 /* Begin preparing to write a SOM library symbol table.
4958 As part of the prep work we need to determine the number of symbols
4959 and the size of the associated string section. */
4962 som_bfd_prep_for_ar_write (abfd, num_syms, stringsize)
4964 unsigned int *num_syms, *stringsize;
4966 bfd *curr_bfd = abfd->archive_head;
4968 /* Some initialization. */
4972 /* Iterate over each BFD within this archive. */
4973 while (curr_bfd != NULL)
4975 unsigned int curr_count, i;
4976 som_symbol_type *sym;
4978 /* Don't bother for non-SOM objects. */
4979 if (curr_bfd->format != bfd_object
4980 || curr_bfd->xvec->flavour != bfd_target_som_flavour)
4982 curr_bfd = curr_bfd->next;
4986 /* Make sure the symbol table has been read, then snag a pointer
4987 to it. It's a little slimey to grab the symbols via obj_som_symtab,
4988 but doing so avoids allocating lots of extra memory. */
4989 if (som_slurp_symbol_table (curr_bfd) == false)
4992 sym = obj_som_symtab (curr_bfd);
4993 curr_count = bfd_get_symcount (curr_bfd);
4995 /* Examine each symbol to determine if it belongs in the
4996 library symbol table. */
4997 for (i = 0; i < curr_count; i++, sym++)
4999 struct som_misc_symbol_info info;
5001 /* Derive SOM information from the BFD symbol. */
5002 som_bfd_derive_misc_symbol_info (curr_bfd, &sym->symbol, &info);
5004 /* Should we include this symbol? */
5005 if (info.symbol_type == ST_NULL
5006 || info.symbol_type == ST_SYM_EXT
5007 || info.symbol_type == ST_ARG_EXT)
5010 /* Only global symbols and unsatisfied commons. */
5011 if (info.symbol_scope != SS_UNIVERSAL
5012 && info.symbol_type != ST_STORAGE)
5015 /* Do no include undefined symbols. */
5016 if (sym->symbol.section == &bfd_und_section)
5019 /* Bump the various counters, being careful to honor
5020 alignment considerations in the string table. */
5022 *stringsize = *stringsize + strlen (sym->symbol.name) + 5;
5023 while (*stringsize % 4)
5027 curr_bfd = curr_bfd->next;
5032 /* Hash a symbol name based on the hashing algorithm presented in the
5035 som_bfd_ar_symbol_hash (symbol)
5038 unsigned int len = strlen (symbol->name);
5040 /* Names with length 1 are special. */
5042 return 0x1000100 | (symbol->name[0] << 16) | symbol->name[0];
5044 return ((len & 0x7f) << 24) | (symbol->name[1] << 16)
5045 | (symbol->name[len-2] << 8) | symbol->name[len-1];
5052 CONST char *filename = strrchr (file, '/');
5054 if (filename != NULL)
5061 /* Do the bulk of the work required to write the SOM library
5065 som_bfd_ar_write_symbol_stuff (abfd, nsyms, string_size, lst)
5067 unsigned int nsyms, string_size;
5068 struct lst_header lst;
5070 file_ptr lst_filepos;
5071 char *strings = NULL, *p;
5072 struct lst_symbol_record *lst_syms = NULL, *curr_lst_sym;
5074 unsigned int *hash_table = NULL;
5075 struct som_entry *som_dict = NULL;
5076 struct lst_symbol_record **last_hash_entry = NULL;
5077 unsigned int curr_som_offset, som_index, extended_name_length = 0;
5078 unsigned int maxname = abfd->xvec->ar_max_namelen;
5081 (unsigned int *) malloc (lst.hash_size * sizeof (unsigned int));
5082 if (hash_table == NULL && lst.hash_size != 0)
5084 bfd_set_error (bfd_error_no_memory);
5088 (struct som_entry *) malloc (lst.module_count
5089 * sizeof (struct som_entry));
5090 if (som_dict == NULL && lst.module_count != 0)
5092 bfd_set_error (bfd_error_no_memory);
5097 ((struct lst_symbol_record **)
5098 malloc (lst.hash_size * sizeof (struct lst_symbol_record *)));
5099 if (last_hash_entry == NULL && lst.hash_size != 0)
5101 bfd_set_error (bfd_error_no_memory);
5105 /* Lots of fields are file positions relative to the start
5106 of the lst record. So save its location. */
5107 lst_filepos = bfd_tell (abfd) - sizeof (struct lst_header);
5109 /* Some initialization. */
5110 memset (hash_table, 0, 4 * lst.hash_size);
5111 memset (som_dict, 0, lst.module_count * sizeof (struct som_entry));
5112 memset (last_hash_entry, 0,
5113 lst.hash_size * sizeof (struct lst_symbol_record *));
5115 /* Symbols have som_index fields, so we have to keep track of the
5116 index of each SOM in the archive.
5118 The SOM dictionary has (among other things) the absolute file
5119 position for the SOM which a particular dictionary entry
5120 describes. We have to compute that information as we iterate
5121 through the SOMs/symbols. */
5123 curr_som_offset = 8 + 2 * sizeof (struct ar_hdr) + lst.file_end;
5125 /* Yow! We have to know the size of the extended name table
5127 for (curr_bfd = abfd->archive_head;
5129 curr_bfd = curr_bfd->next)
5131 CONST char *normal = normalize (curr_bfd->filename);
5132 unsigned int thislen;
5136 bfd_set_error (bfd_error_no_memory);
5139 thislen = strlen (normal);
5140 if (thislen > maxname)
5141 extended_name_length += thislen + 1;
5144 /* Make room for the archive header and the contents of the
5145 extended string table. */
5146 if (extended_name_length)
5147 curr_som_offset += extended_name_length + sizeof (struct ar_hdr);
5149 /* Make sure we're properly aligned. */
5150 curr_som_offset = (curr_som_offset + 0x1) & ~0x1;
5152 /* FIXME should be done with buffers just like everything else... */
5153 lst_syms = malloc (nsyms * sizeof (struct lst_symbol_record));
5154 if (lst_syms == NULL && nsyms != 0)
5156 bfd_set_error (bfd_error_no_memory);
5159 strings = malloc (string_size);
5160 if (strings == NULL && string_size != 0)
5162 bfd_set_error (bfd_error_no_memory);
5167 curr_lst_sym = lst_syms;
5169 curr_bfd = abfd->archive_head;
5170 while (curr_bfd != NULL)
5172 unsigned int curr_count, i;
5173 som_symbol_type *sym;
5175 /* Don't bother for non-SOM objects. */
5176 if (curr_bfd->format != bfd_object
5177 || curr_bfd->xvec->flavour != bfd_target_som_flavour)
5179 curr_bfd = curr_bfd->next;
5183 /* Make sure the symbol table has been read, then snag a pointer
5184 to it. It's a little slimey to grab the symbols via obj_som_symtab,
5185 but doing so avoids allocating lots of extra memory. */
5186 if (som_slurp_symbol_table (curr_bfd) == false)
5189 sym = obj_som_symtab (curr_bfd);
5190 curr_count = bfd_get_symcount (curr_bfd);
5192 for (i = 0; i < curr_count; i++, sym++)
5194 struct som_misc_symbol_info info;
5196 /* Derive SOM information from the BFD symbol. */
5197 som_bfd_derive_misc_symbol_info (curr_bfd, &sym->symbol, &info);
5199 /* Should we include this symbol? */
5200 if (info.symbol_type == ST_NULL
5201 || info.symbol_type == ST_SYM_EXT
5202 || info.symbol_type == ST_ARG_EXT)
5205 /* Only global symbols and unsatisfied commons. */
5206 if (info.symbol_scope != SS_UNIVERSAL
5207 && info.symbol_type != ST_STORAGE)
5210 /* Do no include undefined symbols. */
5211 if (sym->symbol.section == &bfd_und_section)
5214 /* If this is the first symbol from this SOM, then update
5215 the SOM dictionary too. */
5216 if (som_dict[som_index].location == 0)
5218 som_dict[som_index].location = curr_som_offset;
5219 som_dict[som_index].length = arelt_size (curr_bfd);
5222 /* Fill in the lst symbol record. */
5223 curr_lst_sym->hidden = 0;
5224 curr_lst_sym->secondary_def = 0;
5225 curr_lst_sym->symbol_type = info.symbol_type;
5226 curr_lst_sym->symbol_scope = info.symbol_scope;
5227 curr_lst_sym->check_level = 0;
5228 curr_lst_sym->must_qualify = 0;
5229 curr_lst_sym->initially_frozen = 0;
5230 curr_lst_sym->memory_resident = 0;
5231 curr_lst_sym->is_common = (sym->symbol.section == &bfd_com_section);
5232 curr_lst_sym->dup_common = 0;
5233 curr_lst_sym->xleast = 0;
5234 curr_lst_sym->arg_reloc = info.arg_reloc;
5235 curr_lst_sym->name.n_strx = p - strings + 4;
5236 curr_lst_sym->qualifier_name.n_strx = 0;
5237 curr_lst_sym->symbol_info = info.symbol_info;
5238 curr_lst_sym->symbol_value = info.symbol_value;
5239 curr_lst_sym->symbol_descriptor = 0;
5240 curr_lst_sym->reserved = 0;
5241 curr_lst_sym->som_index = som_index;
5242 curr_lst_sym->symbol_key = som_bfd_ar_symbol_hash (&sym->symbol);
5243 curr_lst_sym->next_entry = 0;
5245 /* Insert into the hash table. */
5246 if (hash_table[curr_lst_sym->symbol_key % lst.hash_size])
5248 struct lst_symbol_record *tmp;
5250 /* There is already something at the head of this hash chain,
5251 so tack this symbol onto the end of the chain. */
5252 tmp = last_hash_entry[curr_lst_sym->symbol_key % lst.hash_size];
5254 = (curr_lst_sym - lst_syms) * sizeof (struct lst_symbol_record)
5256 + lst.module_count * sizeof (struct som_entry)
5257 + sizeof (struct lst_header);
5261 /* First entry in this hash chain. */
5262 hash_table[curr_lst_sym->symbol_key % lst.hash_size]
5263 = (curr_lst_sym - lst_syms) * sizeof (struct lst_symbol_record)
5265 + lst.module_count * sizeof (struct som_entry)
5266 + sizeof (struct lst_header);
5269 /* Keep track of the last symbol we added to this chain so we can
5270 easily update its next_entry pointer. */
5271 last_hash_entry[curr_lst_sym->symbol_key % lst.hash_size]
5275 /* Update the string table. */
5276 bfd_put_32 (abfd, strlen (sym->symbol.name), p);
5278 strcpy (p, sym->symbol.name);
5279 p += strlen (sym->symbol.name) + 1;
5282 bfd_put_8 (abfd, 0, p);
5286 /* Head to the next symbol. */
5290 /* Keep track of where each SOM will finally reside; then look
5292 curr_som_offset += arelt_size (curr_bfd) + sizeof (struct ar_hdr);
5293 curr_bfd = curr_bfd->next;
5297 /* Now scribble out the hash table. */
5298 if (bfd_write ((PTR) hash_table, lst.hash_size, 4, abfd)
5299 != lst.hash_size * 4)
5302 /* Then the SOM dictionary. */
5303 if (bfd_write ((PTR) som_dict, lst.module_count,
5304 sizeof (struct som_entry), abfd)
5305 != lst.module_count * sizeof (struct som_entry))
5308 /* The library symbols. */
5309 if (bfd_write ((PTR) lst_syms, nsyms, sizeof (struct lst_symbol_record), abfd)
5310 != nsyms * sizeof (struct lst_symbol_record))
5313 /* And finally the strings. */
5314 if (bfd_write ((PTR) strings, string_size, 1, abfd) != string_size)
5317 if (hash_table != NULL)
5319 if (som_dict != NULL)
5321 if (last_hash_entry != NULL)
5322 free (last_hash_entry);
5323 if (lst_syms != NULL)
5325 if (strings != NULL)
5330 if (hash_table != NULL)
5332 if (som_dict != NULL)
5334 if (last_hash_entry != NULL)
5335 free (last_hash_entry);
5336 if (lst_syms != NULL)
5338 if (strings != NULL)
5344 /* Write out the LST for the archive.
5346 You'll never believe this is really how armaps are handled in SOM... */
5349 som_write_armap (abfd)
5353 struct stat statbuf;
5354 unsigned int i, lst_size, nsyms, stringsize;
5356 struct lst_header lst;
5359 /* We'll use this for the archive's date and mode later. */
5360 if (stat (abfd->filename, &statbuf) != 0)
5362 bfd_set_error (bfd_error_system_call);
5366 bfd_ardata (abfd)->armap_timestamp = statbuf.st_mtime + 60;
5368 /* Account for the lst header first. */
5369 lst_size = sizeof (struct lst_header);
5371 /* Start building the LST header. */
5372 lst.system_id = HP9000S800_ID;
5373 lst.a_magic = LIBMAGIC;
5374 lst.version_id = VERSION_ID;
5375 lst.file_time.secs = 0;
5376 lst.file_time.nanosecs = 0;
5378 lst.hash_loc = lst_size;
5379 lst.hash_size = SOM_LST_HASH_SIZE;
5381 /* Hash table is a SOM_LST_HASH_SIZE 32bit offsets. */
5382 lst_size += 4 * SOM_LST_HASH_SIZE;
5384 /* We need to count the number of SOMs in this archive. */
5385 curr_bfd = abfd->archive_head;
5386 lst.module_count = 0;
5387 while (curr_bfd != NULL)
5389 /* Only true SOM objects count. */
5390 if (curr_bfd->format == bfd_object
5391 && curr_bfd->xvec->flavour == bfd_target_som_flavour)
5393 curr_bfd = curr_bfd->next;
5395 lst.module_limit = lst.module_count;
5396 lst.dir_loc = lst_size;
5397 lst_size += sizeof (struct som_entry) * lst.module_count;
5399 /* We don't support import/export tables, auxiliary headers,
5400 or free lists yet. Make the linker work a little harder
5401 to make our life easier. */
5404 lst.export_count = 0;
5409 /* Count how many symbols we will have on the hash chains and the
5410 size of the associated string table. */
5411 if (som_bfd_prep_for_ar_write (abfd, &nsyms, &stringsize) == false)
5414 lst_size += sizeof (struct lst_symbol_record) * nsyms;
5416 /* For the string table. One day we might actually use this info
5417 to avoid small seeks/reads when reading archives. */
5418 lst.string_loc = lst_size;
5419 lst.string_size = stringsize;
5420 lst_size += stringsize;
5422 /* SOM ABI says this must be zero. */
5424 lst.file_end = lst_size;
5426 /* Compute the checksum. Must happen after the entire lst header
5430 for (i = 0; i < sizeof (struct lst_header)/sizeof (int) - 1; i++)
5431 lst.checksum ^= *p++;
5433 sprintf (hdr.ar_name, "/ ");
5434 sprintf (hdr.ar_date, "%ld", bfd_ardata (abfd)->armap_timestamp);
5435 sprintf (hdr.ar_uid, "%d", getuid ());
5436 sprintf (hdr.ar_gid, "%d", getgid ());
5437 sprintf (hdr.ar_mode, "%-8o", (unsigned int) statbuf.st_mode);
5438 sprintf (hdr.ar_size, "%-10d", (int) lst_size);
5439 hdr.ar_fmag[0] = '`';
5440 hdr.ar_fmag[1] = '\012';
5442 /* Turn any nulls into spaces. */
5443 for (i = 0; i < sizeof (struct ar_hdr); i++)
5444 if (((char *) (&hdr))[i] == '\0')
5445 (((char *) (&hdr))[i]) = ' ';
5447 /* Scribble out the ar header. */
5448 if (bfd_write ((PTR) &hdr, 1, sizeof (struct ar_hdr), abfd)
5449 != sizeof (struct ar_hdr))
5452 /* Now scribble out the lst header. */
5453 if (bfd_write ((PTR) &lst, 1, sizeof (struct lst_header), abfd)
5454 != sizeof (struct lst_header))
5457 /* Build and write the armap. */
5458 if (som_bfd_ar_write_symbol_stuff (abfd, nsyms, stringsize, lst) == false)
5465 /* Free all information we have cached for this BFD. We can always
5466 read it again later if we need it. */
5469 som_bfd_free_cached_info (abfd)
5474 if (bfd_get_format (abfd) != bfd_object)
5477 #define FREE(x) if (x != NULL) { free (x); x = NULL; }
5478 /* Free the native string and symbol tables. */
5479 FREE (obj_som_symtab (abfd));
5480 FREE (obj_som_stringtab (abfd));
5481 for (o = abfd->sections; o != (asection *) NULL; o = o->next)
5483 /* Free the native relocations. */
5484 o->reloc_count = -1;
5485 FREE (som_section_data (o)->reloc_stream);
5486 /* Free the generic relocations. */
5487 FREE (o->relocation);
5494 /* End of miscellaneous support functions. */
5496 #define som_close_and_cleanup som_bfd_free_cached_info
5498 #define som_openr_next_archived_file bfd_generic_openr_next_archived_file
5499 #define som_generic_stat_arch_elt bfd_generic_stat_arch_elt
5500 #define som_truncate_arname bfd_bsd_truncate_arname
5501 #define som_slurp_extended_name_table _bfd_slurp_extended_name_table
5503 #define som_get_lineno _bfd_nosymbols_get_lineno
5504 #define som_bfd_make_debug_symbol _bfd_nosymbols_bfd_make_debug_symbol
5506 #define som_bfd_get_relocated_section_contents \
5507 bfd_generic_get_relocated_section_contents
5508 #define som_bfd_relax_section bfd_generic_relax_section
5509 #define som_bfd_link_hash_table_create _bfd_generic_link_hash_table_create
5510 #define som_bfd_link_add_symbols _bfd_generic_link_add_symbols
5511 #define som_bfd_final_link _bfd_generic_final_link
5513 bfd_target som_vec =
5516 bfd_target_som_flavour,
5517 true, /* target byte order */
5518 true, /* target headers byte order */
5519 (HAS_RELOC | EXEC_P | /* object flags */
5520 HAS_LINENO | HAS_DEBUG |
5521 HAS_SYMS | HAS_LOCALS | WP_TEXT | D_PAGED | DYNAMIC),
5522 (SEC_CODE | SEC_DATA | SEC_ROM | SEC_HAS_CONTENTS
5523 | SEC_ALLOC | SEC_LOAD | SEC_RELOC), /* section flags */
5525 /* leading_symbol_char: is the first char of a user symbol
5526 predictable, and if so what is it */
5528 '/', /* ar_pad_char */
5529 14, /* ar_max_namelen */
5530 3, /* minimum alignment */
5531 bfd_getb64, bfd_getb_signed_64, bfd_putb64,
5532 bfd_getb32, bfd_getb_signed_32, bfd_putb32,
5533 bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* data */
5534 bfd_getb64, bfd_getb_signed_64, bfd_putb64,
5535 bfd_getb32, bfd_getb_signed_32, bfd_putb32,
5536 bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* hdrs */
5538 som_object_p, /* bfd_check_format */
5539 bfd_generic_archive_p,
5545 _bfd_generic_mkarchive,
5550 som_write_object_contents,
5551 _bfd_write_archive_contents,
5556 BFD_JUMP_TABLE_GENERIC (som),
5557 BFD_JUMP_TABLE_COPY (som),
5558 BFD_JUMP_TABLE_CORE (_bfd_nocore),
5559 BFD_JUMP_TABLE_ARCHIVE (som),
5560 BFD_JUMP_TABLE_SYMBOLS (som),
5561 BFD_JUMP_TABLE_RELOCS (som),
5562 BFD_JUMP_TABLE_WRITE (som),
5563 BFD_JUMP_TABLE_LINK (som),
5564 BFD_JUMP_TABLE_DYNAMIC (_bfd_nodynamic),
5569 #endif /* HOST_HPPAHPUX || HOST_HPPABSD || HOST_HPPAOSF */