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>
35 #include <machine/reg.h>
39 /* Magic not defined in standard HP-UX header files until 8.0 */
41 #ifndef CPU_PA_RISC1_0
42 #define CPU_PA_RISC1_0 0x20B
43 #endif /* CPU_PA_RISC1_0 */
45 #ifndef CPU_PA_RISC1_1
46 #define CPU_PA_RISC1_1 0x210
47 #endif /* CPU_PA_RISC1_1 */
49 #ifndef _PA_RISC1_0_ID
50 #define _PA_RISC1_0_ID CPU_PA_RISC1_0
51 #endif /* _PA_RISC1_0_ID */
53 #ifndef _PA_RISC1_1_ID
54 #define _PA_RISC1_1_ID CPU_PA_RISC1_1
55 #endif /* _PA_RISC1_1_ID */
57 #ifndef _PA_RISC_MAXID
58 #define _PA_RISC_MAXID 0x2FF
59 #endif /* _PA_RISC_MAXID */
62 #define _PA_RISC_ID(__m_num) \
63 (((__m_num) == _PA_RISC1_0_ID) || \
64 ((__m_num) >= _PA_RISC1_1_ID && (__m_num) <= _PA_RISC_MAXID))
65 #endif /* _PA_RISC_ID */
67 /* Size (in chars) of the temporary buffers used during fixup and string
70 #define SOM_TMP_BUFSIZE 8192
72 /* Size of the hash table in archives. */
73 #define SOM_LST_HASH_SIZE 31
75 /* Max number of SOMs to be found in an archive. */
76 #define SOM_LST_MODULE_LIMIT 1024
78 /* Generic alignment macro. */
79 #define SOM_ALIGN(val, alignment) \
80 (((val) + (alignment) - 1) & ~((alignment) - 1))
82 /* SOM allows any one of the four previous relocations to be reused
83 with a "R_PREV_FIXUP" relocation entry. Since R_PREV_FIXUP
84 relocations are always a single byte, using a R_PREV_FIXUP instead
85 of some multi-byte relocation makes object files smaller.
87 Note one side effect of using a R_PREV_FIXUP is the relocation that
88 is being repeated moves to the front of the queue. */
95 /* This fully describes the symbol types which may be attached to
96 an EXPORT or IMPORT directive. Only SOM uses this formation
97 (ELF has no need for it). */
101 SYMBOL_TYPE_ABSOLUTE,
105 SYMBOL_TYPE_MILLICODE,
107 SYMBOL_TYPE_PRI_PROG,
108 SYMBOL_TYPE_SEC_PROG,
111 struct section_to_type
117 /* Assorted symbol information that needs to be derived from the BFD symbol
118 and/or the BFD backend private symbol data. */
119 struct som_misc_symbol_info
121 unsigned int symbol_type;
122 unsigned int symbol_scope;
123 unsigned int arg_reloc;
124 unsigned int symbol_info;
125 unsigned int symbol_value;
128 /* Forward declarations */
130 static boolean som_mkobject PARAMS ((bfd *));
131 static bfd_target * som_object_setup PARAMS ((bfd *,
133 struct som_exec_auxhdr *));
134 static boolean setup_sections PARAMS ((bfd *, struct header *));
135 static bfd_target * som_object_p PARAMS ((bfd *));
136 static boolean som_write_object_contents PARAMS ((bfd *));
137 static boolean som_slurp_string_table PARAMS ((bfd *));
138 static unsigned int som_slurp_symbol_table PARAMS ((bfd *));
139 static long som_get_symtab_upper_bound PARAMS ((bfd *));
140 static long som_canonicalize_reloc PARAMS ((bfd *, sec_ptr,
141 arelent **, asymbol **));
142 static long som_get_reloc_upper_bound PARAMS ((bfd *, sec_ptr));
143 static unsigned int som_set_reloc_info PARAMS ((unsigned char *, unsigned int,
144 arelent *, asection *,
145 asymbol **, boolean));
146 static boolean som_slurp_reloc_table PARAMS ((bfd *, asection *,
147 asymbol **, boolean));
148 static long som_get_symtab PARAMS ((bfd *, asymbol **));
149 static asymbol * som_make_empty_symbol PARAMS ((bfd *));
150 static void som_print_symbol PARAMS ((bfd *, PTR,
151 asymbol *, bfd_print_symbol_type));
152 static boolean som_new_section_hook PARAMS ((bfd *, asection *));
153 static boolean som_bfd_copy_private_section_data PARAMS ((bfd *, asection *,
155 static boolean som_bfd_copy_private_bfd_data PARAMS ((bfd *, bfd *));
156 static boolean som_bfd_is_local_label PARAMS ((bfd *, asymbol *));
157 static boolean som_set_section_contents PARAMS ((bfd *, sec_ptr, PTR,
158 file_ptr, bfd_size_type));
159 static boolean som_get_section_contents PARAMS ((bfd *, sec_ptr, PTR,
160 file_ptr, bfd_size_type));
161 static boolean som_set_arch_mach PARAMS ((bfd *, enum bfd_architecture,
163 static boolean som_find_nearest_line PARAMS ((bfd *, asection *,
168 static void som_get_symbol_info PARAMS ((bfd *, asymbol *, symbol_info *));
169 static asection * bfd_section_from_som_symbol PARAMS ((bfd *,
170 struct symbol_dictionary_record *));
171 static int log2 PARAMS ((unsigned int));
172 static bfd_reloc_status_type hppa_som_reloc PARAMS ((bfd *, arelent *,
176 static void som_initialize_reloc_queue PARAMS ((struct reloc_queue *));
177 static void som_reloc_queue_insert PARAMS ((unsigned char *, unsigned int,
178 struct reloc_queue *));
179 static void som_reloc_queue_fix PARAMS ((struct reloc_queue *, unsigned int));
180 static int som_reloc_queue_find PARAMS ((unsigned char *, unsigned int,
181 struct reloc_queue *));
182 static unsigned char * try_prev_fixup PARAMS ((bfd *, int *, unsigned char *,
184 struct reloc_queue *));
186 static unsigned char * som_reloc_skip PARAMS ((bfd *, unsigned int,
187 unsigned char *, unsigned int *,
188 struct reloc_queue *));
189 static unsigned char * som_reloc_addend PARAMS ((bfd *, int, unsigned char *,
191 struct reloc_queue *));
192 static unsigned char * som_reloc_call PARAMS ((bfd *, unsigned char *,
195 struct reloc_queue *));
196 static unsigned long som_count_spaces PARAMS ((bfd *));
197 static unsigned long som_count_subspaces PARAMS ((bfd *));
198 static int compare_syms PARAMS ((const void *, const void *));
199 static unsigned long som_compute_checksum PARAMS ((bfd *));
200 static boolean som_prep_headers PARAMS ((bfd *));
201 static int som_sizeof_headers PARAMS ((bfd *, boolean));
202 static boolean som_write_headers PARAMS ((bfd *));
203 static boolean som_build_and_write_symbol_table PARAMS ((bfd *));
204 static void som_prep_for_fixups PARAMS ((bfd *, asymbol **, unsigned long));
205 static boolean som_write_fixups PARAMS ((bfd *, unsigned long, unsigned int *));
206 static boolean som_write_space_strings PARAMS ((bfd *, unsigned long,
208 static boolean som_write_symbol_strings PARAMS ((bfd *, unsigned long,
209 asymbol **, unsigned int,
211 static boolean som_begin_writing PARAMS ((bfd *));
212 static const reloc_howto_type * som_bfd_reloc_type_lookup
213 PARAMS ((bfd *, bfd_reloc_code_real_type));
214 static char som_section_type PARAMS ((const char *));
215 static int som_decode_symclass PARAMS ((asymbol *));
216 static boolean som_bfd_count_ar_symbols PARAMS ((bfd *, struct lst_header *,
219 static boolean som_bfd_fill_in_ar_symbols PARAMS ((bfd *, struct lst_header *,
221 static boolean som_slurp_armap PARAMS ((bfd *));
222 static boolean som_write_armap PARAMS ((bfd *, unsigned int, struct orl *,
224 static void som_bfd_derive_misc_symbol_info PARAMS ((bfd *, asymbol *,
225 struct som_misc_symbol_info *));
226 static boolean som_bfd_prep_for_ar_write PARAMS ((bfd *, unsigned int *,
228 static unsigned int som_bfd_ar_symbol_hash PARAMS ((asymbol *));
229 static boolean som_bfd_ar_write_symbol_stuff PARAMS ((bfd *, unsigned int,
232 static CONST char *normalize PARAMS ((CONST char *file));
233 static boolean som_is_space PARAMS ((asection *));
234 static boolean som_is_subspace PARAMS ((asection *));
235 static boolean som_is_container PARAMS ((asection *, asection *));
236 static boolean som_bfd_free_cached_info PARAMS ((bfd *));
238 /* Map SOM section names to POSIX/BSD single-character symbol types.
240 This table includes all the standard subspaces as defined in the
241 current "PRO ABI for PA-RISC Systems", $UNWIND$ which for
242 some reason was left out, and sections specific to embedded stabs. */
244 static const struct section_to_type stt[] = {
246 {"$SHLIB_INFO$", 't'},
247 {"$MILLICODE$", 't'},
250 {"$UNWIND_START$", 't'},
254 {"$SHLIB_DATA$", 'd'},
256 {"$SHORTDATA$", 'g'},
261 {"$GDB_STRINGS$", 'N'},
262 {"$GDB_SYMBOLS$", 'N'},
266 /* About the relocation formatting table...
268 There are 256 entries in the table, one for each possible
269 relocation opcode available in SOM. We index the table by
270 the relocation opcode. The names and operations are those
271 defined by a.out_800 (4).
273 Right now this table is only used to count and perform minimal
274 processing on relocation streams so that they can be internalized
275 into BFD and symbolically printed by utilities. To make actual use
276 of them would be much more difficult, BFD's concept of relocations
277 is far too simple to handle SOM relocations. The basic assumption
278 that a relocation can be completely processed independent of other
279 relocations before an object file is written is invalid for SOM.
281 The SOM relocations are meant to be processed as a stream, they
282 specify copying of data from the input section to the output section
283 while possibly modifying the data in some manner. They also can
284 specify that a variable number of zeros or uninitialized data be
285 inserted on in the output segment at the current offset. Some
286 relocations specify that some previous relocation be re-applied at
287 the current location in the input/output sections. And finally a number
288 of relocations have effects on other sections (R_ENTRY, R_EXIT,
289 R_UNWIND_AUX and a variety of others). There isn't even enough room
290 in the BFD relocation data structure to store enough information to
291 perform all the relocations.
293 Each entry in the table has three fields.
295 The first entry is an index into this "class" of relocations. This
296 index can then be used as a variable within the relocation itself.
298 The second field is a format string which actually controls processing
299 of the relocation. It uses a simple postfix machine to do calculations
300 based on variables/constants found in the string and the relocation
303 The third field specifys whether or not this relocation may use
304 a constant (V) from the previous R_DATA_OVERRIDE rather than a constant
305 stored in the instruction.
309 L = input space byte count
310 D = index into class of relocations
311 M = output space byte count
312 N = statement number (unused?)
314 R = parameter relocation bits
316 U = 64 bits of stack unwind and frame size info (we only keep 32 bits)
317 V = a literal constant (usually used in the next relocation)
318 P = a previous relocation
320 Lower case letters (starting with 'b') refer to following
321 bytes in the relocation stream. 'b' is the next 1 byte,
322 c is the next 2 bytes, d is the next 3 bytes, etc...
323 This is the variable part of the relocation entries that
324 makes our life a living hell.
326 numerical constants are also used in the format string. Note
327 the constants are represented in decimal.
329 '+', "*" and "=" represents the obvious postfix operators.
330 '<' represents a left shift.
334 Parameter Relocation Bits:
338 Previous Relocations: The index field represents which in the queue
339 of 4 previous fixups should be re-applied.
341 Literal Constants: These are generally used to represent addend
342 parts of relocations when these constants are not stored in the
343 fields of the instructions themselves. For example the instruction
344 addil foo-$global$-0x1234 would use an override for "0x1234" rather
345 than storing it into the addil itself. */
353 static const struct fixup_format som_fixup_formats[256] =
355 /* R_NO_RELOCATION */
356 0, "LD1+4*=", /* 0x00 */
357 1, "LD1+4*=", /* 0x01 */
358 2, "LD1+4*=", /* 0x02 */
359 3, "LD1+4*=", /* 0x03 */
360 4, "LD1+4*=", /* 0x04 */
361 5, "LD1+4*=", /* 0x05 */
362 6, "LD1+4*=", /* 0x06 */
363 7, "LD1+4*=", /* 0x07 */
364 8, "LD1+4*=", /* 0x08 */
365 9, "LD1+4*=", /* 0x09 */
366 10, "LD1+4*=", /* 0x0a */
367 11, "LD1+4*=", /* 0x0b */
368 12, "LD1+4*=", /* 0x0c */
369 13, "LD1+4*=", /* 0x0d */
370 14, "LD1+4*=", /* 0x0e */
371 15, "LD1+4*=", /* 0x0f */
372 16, "LD1+4*=", /* 0x10 */
373 17, "LD1+4*=", /* 0x11 */
374 18, "LD1+4*=", /* 0x12 */
375 19, "LD1+4*=", /* 0x13 */
376 20, "LD1+4*=", /* 0x14 */
377 21, "LD1+4*=", /* 0x15 */
378 22, "LD1+4*=", /* 0x16 */
379 23, "LD1+4*=", /* 0x17 */
380 0, "LD8<b+1+4*=", /* 0x18 */
381 1, "LD8<b+1+4*=", /* 0x19 */
382 2, "LD8<b+1+4*=", /* 0x1a */
383 3, "LD8<b+1+4*=", /* 0x1b */
384 0, "LD16<c+1+4*=", /* 0x1c */
385 1, "LD16<c+1+4*=", /* 0x1d */
386 2, "LD16<c+1+4*=", /* 0x1e */
387 0, "Ld1+=", /* 0x1f */
389 0, "Lb1+4*=", /* 0x20 */
390 1, "Ld1+=", /* 0x21 */
392 0, "Lb1+4*=", /* 0x22 */
393 1, "Ld1+=", /* 0x23 */
396 /* R_DATA_ONE_SYMBOL */
397 0, "L4=Sb=", /* 0x25 */
398 1, "L4=Sd=", /* 0x26 */
400 0, "L4=Sb=", /* 0x27 */
401 1, "L4=Sd=", /* 0x28 */
404 /* R_REPEATED_INIT */
405 0, "L4=Mb1+4*=", /* 0x2a */
406 1, "Lb4*=Mb1+L*=", /* 0x2b */
407 2, "Lb4*=Md1+4*=", /* 0x2c */
408 3, "Ld1+=Me1+=", /* 0x2d */
413 0, "L4=RD=Sb=", /* 0x30 */
414 1, "L4=RD=Sb=", /* 0x31 */
415 2, "L4=RD=Sb=", /* 0x32 */
416 3, "L4=RD=Sb=", /* 0x33 */
417 4, "L4=RD=Sb=", /* 0x34 */
418 5, "L4=RD=Sb=", /* 0x35 */
419 6, "L4=RD=Sb=", /* 0x36 */
420 7, "L4=RD=Sb=", /* 0x37 */
421 8, "L4=RD=Sb=", /* 0x38 */
422 9, "L4=RD=Sb=", /* 0x39 */
423 0, "L4=RD8<b+=Sb=",/* 0x3a */
424 1, "L4=RD8<b+=Sb=",/* 0x3b */
425 0, "L4=RD8<b+=Sd=",/* 0x3c */
426 1, "L4=RD8<b+=Sd=",/* 0x3d */
431 0, "L4=RD=Sb=", /* 0x40 */
432 1, "L4=RD=Sb=", /* 0x41 */
433 2, "L4=RD=Sb=", /* 0x42 */
434 3, "L4=RD=Sb=", /* 0x43 */
435 4, "L4=RD=Sb=", /* 0x44 */
436 5, "L4=RD=Sb=", /* 0x45 */
437 6, "L4=RD=Sb=", /* 0x46 */
438 7, "L4=RD=Sb=", /* 0x47 */
439 8, "L4=RD=Sb=", /* 0x48 */
440 9, "L4=RD=Sb=", /* 0x49 */
441 0, "L4=RD8<b+=Sb=",/* 0x4a */
442 1, "L4=RD8<b+=Sb=",/* 0x4b */
443 0, "L4=RD8<b+=Sd=",/* 0x4c */
444 1, "L4=RD8<b+=Sd=",/* 0x4d */
449 0, "L4=SD=", /* 0x50 */
450 1, "L4=SD=", /* 0x51 */
451 2, "L4=SD=", /* 0x52 */
452 3, "L4=SD=", /* 0x53 */
453 4, "L4=SD=", /* 0x54 */
454 5, "L4=SD=", /* 0x55 */
455 6, "L4=SD=", /* 0x56 */
456 7, "L4=SD=", /* 0x57 */
457 8, "L4=SD=", /* 0x58 */
458 9, "L4=SD=", /* 0x59 */
459 10, "L4=SD=", /* 0x5a */
460 11, "L4=SD=", /* 0x5b */
461 12, "L4=SD=", /* 0x5c */
462 13, "L4=SD=", /* 0x5d */
463 14, "L4=SD=", /* 0x5e */
464 15, "L4=SD=", /* 0x5f */
465 16, "L4=SD=", /* 0x60 */
466 17, "L4=SD=", /* 0x61 */
467 18, "L4=SD=", /* 0x62 */
468 19, "L4=SD=", /* 0x63 */
469 20, "L4=SD=", /* 0x64 */
470 21, "L4=SD=", /* 0x65 */
471 22, "L4=SD=", /* 0x66 */
472 23, "L4=SD=", /* 0x67 */
473 24, "L4=SD=", /* 0x68 */
474 25, "L4=SD=", /* 0x69 */
475 26, "L4=SD=", /* 0x6a */
476 27, "L4=SD=", /* 0x6b */
477 28, "L4=SD=", /* 0x6c */
478 29, "L4=SD=", /* 0x6d */
479 30, "L4=SD=", /* 0x6e */
480 31, "L4=SD=", /* 0x6f */
481 32, "L4=Sb=", /* 0x70 */
482 33, "L4=Sd=", /* 0x71 */
491 0, "L4=Sb=", /* 0x78 */
492 1, "L4=Sd=", /* 0x79 */
500 /* R_CODE_ONE_SYMBOL */
501 0, "L4=SD=", /* 0x80 */
502 1, "L4=SD=", /* 0x81 */
503 2, "L4=SD=", /* 0x82 */
504 3, "L4=SD=", /* 0x83 */
505 4, "L4=SD=", /* 0x84 */
506 5, "L4=SD=", /* 0x85 */
507 6, "L4=SD=", /* 0x86 */
508 7, "L4=SD=", /* 0x87 */
509 8, "L4=SD=", /* 0x88 */
510 9, "L4=SD=", /* 0x89 */
511 10, "L4=SD=", /* 0x8q */
512 11, "L4=SD=", /* 0x8b */
513 12, "L4=SD=", /* 0x8c */
514 13, "L4=SD=", /* 0x8d */
515 14, "L4=SD=", /* 0x8e */
516 15, "L4=SD=", /* 0x8f */
517 16, "L4=SD=", /* 0x90 */
518 17, "L4=SD=", /* 0x91 */
519 18, "L4=SD=", /* 0x92 */
520 19, "L4=SD=", /* 0x93 */
521 20, "L4=SD=", /* 0x94 */
522 21, "L4=SD=", /* 0x95 */
523 22, "L4=SD=", /* 0x96 */
524 23, "L4=SD=", /* 0x97 */
525 24, "L4=SD=", /* 0x98 */
526 25, "L4=SD=", /* 0x99 */
527 26, "L4=SD=", /* 0x9a */
528 27, "L4=SD=", /* 0x9b */
529 28, "L4=SD=", /* 0x9c */
530 29, "L4=SD=", /* 0x9d */
531 30, "L4=SD=", /* 0x9e */
532 31, "L4=SD=", /* 0x9f */
533 32, "L4=Sb=", /* 0xa0 */
534 33, "L4=Sd=", /* 0xa1 */
549 0, "L4=Sb=", /* 0xae */
550 1, "L4=Sd=", /* 0xaf */
552 0, "L4=Sb=", /* 0xb0 */
553 1, "L4=Sd=", /* 0xb1 */
567 1, "Rb4*=", /* 0xb9 */
568 2, "Rd4*=", /* 0xba */
595 /* R_DATA_OVERRIDE */
608 0, "Ob=Sd=", /* 0xd1 */
610 0, "Ob=Ve=", /* 0xd2 */
660 static const int comp1_opcodes[] =
682 static const int comp2_opcodes[] =
691 static const int comp3_opcodes[] =
698 /* These apparently are not in older versions of hpux reloc.h. */
700 #define R_DLT_REL 0x78
704 #define R_AUX_UNWIND 0xcf
708 #define R_SEC_STMT 0xd7
711 static reloc_howto_type som_hppa_howto_table[] =
713 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
714 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
715 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
716 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
717 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
718 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
719 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
720 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
721 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
722 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
723 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
724 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
725 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
726 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
727 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
728 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
729 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
730 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
731 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
732 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
733 {R_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_ZEROES, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ZEROES"},
746 {R_ZEROES, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ZEROES"},
747 {R_UNINIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_UNINIT"},
748 {R_UNINIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_UNINIT"},
749 {R_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RELOCATION"},
750 {R_DATA_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_ONE_SYMBOL"},
751 {R_DATA_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_ONE_SYMBOL"},
752 {R_DATA_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_PLABEL"},
753 {R_DATA_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_PLABEL"},
754 {R_SPACE_REF, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_SPACE_REF"},
755 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
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_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
760 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
761 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
762 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
763 {R_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_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
776 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
777 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
778 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
779 {R_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_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
792 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
793 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
794 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
795 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
796 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
797 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
798 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
799 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
800 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
801 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
802 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
803 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
804 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
805 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
806 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
807 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
808 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
809 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
810 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
811 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
812 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
813 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
814 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
815 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
816 {R_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_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
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_DLT_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DLT_REL"},
834 {R_DLT_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DLT_REL"},
835 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
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_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
842 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
843 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
844 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
845 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
846 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
847 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
848 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
849 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
850 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
851 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
852 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
853 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
854 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
855 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
856 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
857 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
858 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
859 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
860 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
861 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
862 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
863 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
864 {R_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_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
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_MILLI_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_MILLI_REL"},
888 {R_MILLI_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_MILLI_REL"},
889 {R_CODE_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_PLABEL"},
890 {R_CODE_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_PLABEL"},
891 {R_BREAKPOINT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BREAKPOINT"},
892 {R_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ENTRY"},
893 {R_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ENTRY"},
894 {R_ALT_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ALT_ENTRY"},
895 {R_EXIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_EXIT"},
896 {R_BEGIN_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BEGIN_TRY"},
897 {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_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_BEGIN_BRTAB, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BEGIN_BRTAB"},
901 {R_END_BRTAB, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_BRTAB"},
902 {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"},
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_DATA_EXPR, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_EXPR"},
906 {R_CODE_EXPR, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_EXPR"},
907 {R_FSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_FSEL"},
908 {R_LSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_LSEL"},
909 {R_RSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RSEL"},
910 {R_N_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_N_MODE"},
911 {R_S_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_S_MODE"},
912 {R_D_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_D_MODE"},
913 {R_R_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_R_MODE"},
914 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
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_TRANSLATED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_TRANSLATED"},
920 {R_AUX_UNWIND, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_AUX_UNWIND"},
921 {R_COMP1, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP1"},
922 {R_COMP2, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP2"},
923 {R_COMP3, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP3"},
924 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
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_SEC_STMT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_SEC_STMT"},
929 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
930 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
931 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
932 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
933 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
934 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
935 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
936 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
937 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
938 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
939 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
940 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
941 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
942 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
943 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
944 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
945 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
946 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
947 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
948 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
949 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
950 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
951 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
952 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
953 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
954 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
955 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
956 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
957 {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"}};
970 /* Initialize the SOM relocation queue. By definition the queue holds
971 the last four multibyte fixups. */
974 som_initialize_reloc_queue (queue)
975 struct reloc_queue *queue;
977 queue[0].reloc = NULL;
979 queue[1].reloc = NULL;
981 queue[2].reloc = NULL;
983 queue[3].reloc = NULL;
987 /* Insert a new relocation into the relocation queue. */
990 som_reloc_queue_insert (p, size, queue)
993 struct reloc_queue *queue;
995 queue[3].reloc = queue[2].reloc;
996 queue[3].size = queue[2].size;
997 queue[2].reloc = queue[1].reloc;
998 queue[2].size = queue[1].size;
999 queue[1].reloc = queue[0].reloc;
1000 queue[1].size = queue[0].size;
1002 queue[0].size = size;
1005 /* When an entry in the relocation queue is reused, the entry moves
1006 to the front of the queue. */
1009 som_reloc_queue_fix (queue, index)
1010 struct reloc_queue *queue;
1018 unsigned char *tmp1 = queue[0].reloc;
1019 unsigned int tmp2 = queue[0].size;
1020 queue[0].reloc = queue[1].reloc;
1021 queue[0].size = queue[1].size;
1022 queue[1].reloc = tmp1;
1023 queue[1].size = tmp2;
1029 unsigned char *tmp1 = queue[0].reloc;
1030 unsigned int tmp2 = queue[0].size;
1031 queue[0].reloc = queue[2].reloc;
1032 queue[0].size = queue[2].size;
1033 queue[2].reloc = queue[1].reloc;
1034 queue[2].size = queue[1].size;
1035 queue[1].reloc = tmp1;
1036 queue[1].size = tmp2;
1042 unsigned char *tmp1 = queue[0].reloc;
1043 unsigned int tmp2 = queue[0].size;
1044 queue[0].reloc = queue[3].reloc;
1045 queue[0].size = queue[3].size;
1046 queue[3].reloc = queue[2].reloc;
1047 queue[3].size = queue[2].size;
1048 queue[2].reloc = queue[1].reloc;
1049 queue[2].size = queue[1].size;
1050 queue[1].reloc = tmp1;
1051 queue[1].size = tmp2;
1057 /* Search for a particular relocation in the relocation queue. */
1060 som_reloc_queue_find (p, size, queue)
1063 struct reloc_queue *queue;
1065 if (queue[0].reloc && !memcmp (p, queue[0].reloc, size)
1066 && size == queue[0].size)
1068 if (queue[1].reloc && !memcmp (p, queue[1].reloc, size)
1069 && size == queue[1].size)
1071 if (queue[2].reloc && !memcmp (p, queue[2].reloc, size)
1072 && size == queue[2].size)
1074 if (queue[3].reloc && !memcmp (p, queue[3].reloc, size)
1075 && size == queue[3].size)
1080 static unsigned char *
1081 try_prev_fixup (abfd, subspace_reloc_sizep, p, size, queue)
1083 int *subspace_reloc_sizep;
1086 struct reloc_queue *queue;
1088 int queue_index = som_reloc_queue_find (p, size, queue);
1090 if (queue_index != -1)
1092 /* Found this in a previous fixup. Undo the fixup we
1093 just built and use R_PREV_FIXUP instead. We saved
1094 a total of size - 1 bytes in the fixup stream. */
1095 bfd_put_8 (abfd, R_PREV_FIXUP + queue_index, p);
1097 *subspace_reloc_sizep += 1;
1098 som_reloc_queue_fix (queue, queue_index);
1102 som_reloc_queue_insert (p, size, queue);
1103 *subspace_reloc_sizep += size;
1109 /* Emit the proper R_NO_RELOCATION fixups to map the next SKIP
1110 bytes without any relocation. Update the size of the subspace
1111 relocation stream via SUBSPACE_RELOC_SIZE_P; also return the
1112 current pointer into the relocation stream. */
1114 static unsigned char *
1115 som_reloc_skip (abfd, skip, p, subspace_reloc_sizep, queue)
1119 unsigned int *subspace_reloc_sizep;
1120 struct reloc_queue *queue;
1122 /* Use a 4 byte R_NO_RELOCATION entry with a maximal value
1123 then R_PREV_FIXUPs to get the difference down to a
1125 if (skip >= 0x1000000)
1128 bfd_put_8 (abfd, R_NO_RELOCATION + 31, p);
1129 bfd_put_8 (abfd, 0xff, p + 1);
1130 bfd_put_16 (abfd, 0xffff, p + 2);
1131 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue);
1132 while (skip >= 0x1000000)
1135 bfd_put_8 (abfd, R_PREV_FIXUP, p);
1137 *subspace_reloc_sizep += 1;
1138 /* No need to adjust queue here since we are repeating the
1139 most recent fixup. */
1143 /* The difference must be less than 0x1000000. Use one
1144 more R_NO_RELOCATION entry to get to the right difference. */
1145 if ((skip & 3) == 0 && skip <= 0xc0000 && skip > 0)
1147 /* Difference can be handled in a simple single-byte
1148 R_NO_RELOCATION entry. */
1151 bfd_put_8 (abfd, R_NO_RELOCATION + (skip >> 2) - 1, p);
1152 *subspace_reloc_sizep += 1;
1155 /* Handle it with a two byte R_NO_RELOCATION entry. */
1156 else if (skip <= 0x1000)
1158 bfd_put_8 (abfd, R_NO_RELOCATION + 24 + (((skip >> 2) - 1) >> 8), p);
1159 bfd_put_8 (abfd, (skip >> 2) - 1, p + 1);
1160 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1162 /* Handle it with a three byte R_NO_RELOCATION entry. */
1165 bfd_put_8 (abfd, R_NO_RELOCATION + 28 + (((skip >> 2) - 1) >> 16), p);
1166 bfd_put_16 (abfd, (skip >> 2) - 1, p + 1);
1167 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue);
1170 /* Ugh. Punt and use a 4 byte entry. */
1173 bfd_put_8 (abfd, R_NO_RELOCATION + 31, p);
1174 bfd_put_8 (abfd, skip >> 16, p + 1);
1175 bfd_put_16 (abfd, skip, p + 2);
1176 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue);
1181 /* Emit the proper R_DATA_OVERRIDE fixups to handle a nonzero addend
1182 from a BFD relocation. Update the size of the subspace relocation
1183 stream via SUBSPACE_RELOC_SIZE_P; also return the current pointer
1184 into the relocation stream. */
1186 static unsigned char *
1187 som_reloc_addend (abfd, addend, p, subspace_reloc_sizep, queue)
1191 unsigned int *subspace_reloc_sizep;
1192 struct reloc_queue *queue;
1194 if ((unsigned)(addend) + 0x80 < 0x100)
1196 bfd_put_8 (abfd, R_DATA_OVERRIDE + 1, p);
1197 bfd_put_8 (abfd, addend, p + 1);
1198 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1200 else if ((unsigned) (addend) + 0x8000 < 0x10000)
1202 bfd_put_8 (abfd, R_DATA_OVERRIDE + 2, p);
1203 bfd_put_16 (abfd, addend, p + 1);
1204 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue);
1206 else if ((unsigned) (addend) + 0x800000 < 0x1000000)
1208 bfd_put_8 (abfd, R_DATA_OVERRIDE + 3, p);
1209 bfd_put_8 (abfd, addend >> 16, p + 1);
1210 bfd_put_16 (abfd, addend, p + 2);
1211 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue);
1215 bfd_put_8 (abfd, R_DATA_OVERRIDE + 4, p);
1216 bfd_put_32 (abfd, addend, p + 1);
1217 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 5, queue);
1222 /* Handle a single function call relocation. */
1224 static unsigned char *
1225 som_reloc_call (abfd, p, subspace_reloc_sizep, bfd_reloc, sym_num, queue)
1228 unsigned int *subspace_reloc_sizep;
1231 struct reloc_queue *queue;
1233 int arg_bits = HPPA_R_ARG_RELOC (bfd_reloc->addend);
1234 int rtn_bits = arg_bits & 0x3;
1237 /* You'll never believe all this is necessary to handle relocations
1238 for function calls. Having to compute and pack the argument
1239 relocation bits is the real nightmare.
1241 If you're interested in how this works, just forget it. You really
1242 do not want to know about this braindamage. */
1244 /* First see if this can be done with a "simple" relocation. Simple
1245 relocations have a symbol number < 0x100 and have simple encodings
1246 of argument relocations. */
1248 if (sym_num < 0x100)
1260 case 1 << 8 | 1 << 6:
1261 case 1 << 8 | 1 << 6 | 1:
1264 case 1 << 8 | 1 << 6 | 1 << 4:
1265 case 1 << 8 | 1 << 6 | 1 << 4 | 1:
1268 case 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2:
1269 case 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2 | 1:
1273 /* Not one of the easy encodings. This will have to be
1274 handled by the more complex code below. */
1280 /* Account for the return value too. */
1284 /* Emit a 2 byte relocation. Then see if it can be handled
1285 with a relocation which is already in the relocation queue. */
1286 bfd_put_8 (abfd, bfd_reloc->howto->type + type, p);
1287 bfd_put_8 (abfd, sym_num, p + 1);
1288 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1293 /* If this could not be handled with a simple relocation, then do a hard
1294 one. Hard relocations occur if the symbol number was too high or if
1295 the encoding of argument relocation bits is too complex. */
1298 /* Don't ask about these magic sequences. I took them straight
1299 from gas-1.36 which took them from the a.out man page. */
1301 if ((arg_bits >> 6 & 0xf) == 0xe)
1304 type += (3 * (arg_bits >> 8 & 3) + (arg_bits >> 6 & 3)) * 40;
1305 if ((arg_bits >> 2 & 0xf) == 0xe)
1308 type += (3 * (arg_bits >> 4 & 3) + (arg_bits >> 2 & 3)) * 4;
1310 /* Output the first two bytes of the relocation. These describe
1311 the length of the relocation and encoding style. */
1312 bfd_put_8 (abfd, bfd_reloc->howto->type + 10
1313 + 2 * (sym_num >= 0x100) + (type >= 0x100),
1315 bfd_put_8 (abfd, type, p + 1);
1317 /* Now output the symbol index and see if this bizarre relocation
1318 just happened to be in the relocation queue. */
1319 if (sym_num < 0x100)
1321 bfd_put_8 (abfd, sym_num, p + 2);
1322 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue);
1326 bfd_put_8 (abfd, sym_num >> 16, p + 2);
1327 bfd_put_16 (abfd, sym_num, p + 3);
1328 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 5, queue);
1335 /* Return the logarithm of X, base 2, considering X unsigned.
1336 Abort -1 if X is not a power or two or is zero. */
1344 /* Test for 0 or a power of 2. */
1345 if (x == 0 || x != (x & -x))
1348 while ((x >>= 1) != 0)
1353 static bfd_reloc_status_type
1354 hppa_som_reloc (abfd, reloc_entry, symbol_in, data,
1355 input_section, output_bfd, error_message)
1357 arelent *reloc_entry;
1360 asection *input_section;
1362 char **error_message;
1366 reloc_entry->address += input_section->output_offset;
1367 return bfd_reloc_ok;
1369 return bfd_reloc_ok;
1372 /* Given a generic HPPA relocation type, the instruction format,
1373 and a field selector, return one or more appropriate SOM relocations. */
1376 hppa_som_gen_reloc_type (abfd, base_type, format, field)
1380 enum hppa_reloc_field_selector_type_alt field;
1382 int *final_type, **final_types;
1384 final_types = (int **) bfd_alloc_by_size_t (abfd, sizeof (int *) * 3);
1385 final_type = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1386 if (!final_types || !final_type)
1388 bfd_set_error (bfd_error_no_memory);
1392 /* The field selector may require additional relocations to be
1393 generated. It's impossible to know at this moment if additional
1394 relocations will be needed, so we make them. The code to actually
1395 write the relocation/fixup stream is responsible for removing
1396 any redundant relocations. */
1403 final_types[0] = final_type;
1404 final_types[1] = NULL;
1405 final_types[2] = NULL;
1406 *final_type = base_type;
1412 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1413 if (!final_types[0])
1415 bfd_set_error (bfd_error_no_memory);
1418 if (field == e_tsel)
1419 *final_types[0] = R_FSEL;
1420 else if (field == e_ltsel)
1421 *final_types[0] = R_LSEL;
1423 *final_types[0] = R_RSEL;
1424 final_types[1] = final_type;
1425 final_types[2] = NULL;
1426 *final_type = base_type;
1431 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1432 if (!final_types[0])
1434 bfd_set_error (bfd_error_no_memory);
1437 *final_types[0] = R_S_MODE;
1438 final_types[1] = final_type;
1439 final_types[2] = NULL;
1440 *final_type = base_type;
1445 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1446 if (!final_types[0])
1448 bfd_set_error (bfd_error_no_memory);
1451 *final_types[0] = R_N_MODE;
1452 final_types[1] = final_type;
1453 final_types[2] = NULL;
1454 *final_type = base_type;
1459 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1460 if (!final_types[0])
1462 bfd_set_error (bfd_error_no_memory);
1465 *final_types[0] = R_D_MODE;
1466 final_types[1] = final_type;
1467 final_types[2] = NULL;
1468 *final_type = base_type;
1473 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1474 if (!final_types[0])
1476 bfd_set_error (bfd_error_no_memory);
1479 *final_types[0] = R_R_MODE;
1480 final_types[1] = final_type;
1481 final_types[2] = NULL;
1482 *final_type = base_type;
1489 /* PLABELs get their own relocation type. */
1492 || field == e_rpsel)
1494 /* A PLABEL relocation that has a size of 32 bits must
1495 be a R_DATA_PLABEL. All others are R_CODE_PLABELs. */
1497 *final_type = R_DATA_PLABEL;
1499 *final_type = R_CODE_PLABEL;
1502 else if (field == e_tsel
1504 || field == e_rtsel)
1505 *final_type = R_DLT_REL;
1506 /* A relocation in the data space is always a full 32bits. */
1507 else if (format == 32)
1508 *final_type = R_DATA_ONE_SYMBOL;
1513 /* More PLABEL special cases. */
1516 || field == e_rpsel)
1517 *final_type = R_DATA_PLABEL;
1521 case R_HPPA_ABS_CALL:
1522 case R_HPPA_PCREL_CALL:
1523 /* Right now we can default all these. */
1529 /* Return the address of the correct entry in the PA SOM relocation
1533 static const reloc_howto_type *
1534 som_bfd_reloc_type_lookup (abfd, code)
1536 bfd_reloc_code_real_type code;
1538 if ((int) code < (int) R_NO_RELOCATION + 255)
1540 BFD_ASSERT ((int) som_hppa_howto_table[(int) code].type == (int) code);
1541 return &som_hppa_howto_table[(int) code];
1544 return (reloc_howto_type *) 0;
1547 /* Perform some initialization for an object. Save results of this
1548 initialization in the BFD. */
1551 som_object_setup (abfd, file_hdrp, aux_hdrp)
1553 struct header *file_hdrp;
1554 struct som_exec_auxhdr *aux_hdrp;
1556 /* som_mkobject will set bfd_error if som_mkobject fails. */
1557 if (som_mkobject (abfd) != true)
1560 /* Set BFD flags based on what information is available in the SOM. */
1561 abfd->flags = NO_FLAGS;
1562 if (file_hdrp->symbol_total)
1563 abfd->flags |= HAS_LINENO | HAS_DEBUG | HAS_SYMS | HAS_LOCALS;
1565 switch (file_hdrp->a_magic)
1568 abfd->flags |= (D_PAGED | WP_TEXT | EXEC_P);
1571 abfd->flags |= (WP_TEXT | EXEC_P);
1574 abfd->flags |= (EXEC_P);
1577 abfd->flags |= HAS_RELOC;
1585 abfd->flags |= DYNAMIC;
1592 bfd_get_start_address (abfd) = aux_hdrp->exec_entry;
1593 bfd_default_set_arch_mach (abfd, bfd_arch_hppa, 0);
1594 bfd_get_symcount (abfd) = file_hdrp->symbol_total;
1596 /* Initialize the saved symbol table and string table to NULL.
1597 Save important offsets and sizes from the SOM header into
1599 obj_som_stringtab (abfd) = (char *) NULL;
1600 obj_som_symtab (abfd) = (som_symbol_type *) NULL;
1601 obj_som_stringtab_size (abfd) = file_hdrp->symbol_strings_size;
1602 obj_som_sym_filepos (abfd) = file_hdrp->symbol_location;
1603 obj_som_str_filepos (abfd) = file_hdrp->symbol_strings_location;
1604 obj_som_reloc_filepos (abfd) = file_hdrp->fixup_request_location;
1606 obj_som_exec_data (abfd) = (struct som_exec_data *)
1607 bfd_zalloc (abfd, sizeof (struct som_exec_data ));
1608 if (obj_som_exec_data (abfd) == NULL)
1610 bfd_set_error (bfd_error_no_memory);
1614 obj_som_exec_data (abfd)->system_id = file_hdrp->system_id;
1615 obj_som_exec_data (abfd)->exec_flags = aux_hdrp->exec_flags;
1619 /* Convert all of the space and subspace info into BFD sections. Each space
1620 contains a number of subspaces, which in turn describe the mapping between
1621 regions of the exec file, and the address space that the program runs in.
1622 BFD sections which correspond to spaces will overlap the sections for the
1623 associated subspaces. */
1626 setup_sections (abfd, file_hdr)
1628 struct header *file_hdr;
1630 char *space_strings;
1632 unsigned int total_subspaces = 0;
1634 /* First, read in space names */
1636 space_strings = malloc (file_hdr->space_strings_size);
1637 if (!space_strings && file_hdr->space_strings_size != 0)
1639 bfd_set_error (bfd_error_no_memory);
1643 if (bfd_seek (abfd, file_hdr->space_strings_location, SEEK_SET) < 0)
1645 if (bfd_read (space_strings, 1, file_hdr->space_strings_size, abfd)
1646 != file_hdr->space_strings_size)
1649 /* Loop over all of the space dictionaries, building up sections */
1650 for (space_index = 0; space_index < file_hdr->space_total; space_index++)
1652 struct space_dictionary_record space;
1653 struct subspace_dictionary_record subspace, save_subspace;
1655 asection *space_asect;
1658 /* Read the space dictionary element */
1659 if (bfd_seek (abfd, file_hdr->space_location
1660 + space_index * sizeof space, SEEK_SET) < 0)
1662 if (bfd_read (&space, 1, sizeof space, abfd) != sizeof space)
1665 /* Setup the space name string */
1666 space.name.n_name = space.name.n_strx + space_strings;
1668 /* Make a section out of it */
1669 newname = bfd_alloc (abfd, strlen (space.name.n_name) + 1);
1672 strcpy (newname, space.name.n_name);
1674 space_asect = bfd_make_section_anyway (abfd, newname);
1678 if (space.is_loadable == 0)
1679 space_asect->flags |= SEC_DEBUGGING;
1681 /* Set up all the attributes for the space. */
1682 if (bfd_som_set_section_attributes (space_asect, space.is_defined,
1683 space.is_private, space.sort_key,
1684 space.space_number) == false)
1687 /* Now, read in the first subspace for this space */
1688 if (bfd_seek (abfd, file_hdr->subspace_location
1689 + space.subspace_index * sizeof subspace,
1692 if (bfd_read (&subspace, 1, sizeof subspace, abfd) != sizeof subspace)
1694 /* Seek back to the start of the subspaces for loop below */
1695 if (bfd_seek (abfd, file_hdr->subspace_location
1696 + space.subspace_index * sizeof subspace,
1700 /* Setup the start address and file loc from the first subspace record */
1701 space_asect->vma = subspace.subspace_start;
1702 space_asect->filepos = subspace.file_loc_init_value;
1703 space_asect->alignment_power = log2 (subspace.alignment);
1704 if (space_asect->alignment_power == -1)
1707 /* Initialize save_subspace so we can reliably determine if this
1708 loop placed any useful values into it. */
1709 memset (&save_subspace, 0, sizeof (struct subspace_dictionary_record));
1711 /* Loop over the rest of the subspaces, building up more sections */
1712 for (subspace_index = 0; subspace_index < space.subspace_quantity;
1715 asection *subspace_asect;
1717 /* Read in the next subspace */
1718 if (bfd_read (&subspace, 1, sizeof subspace, abfd)
1722 /* Setup the subspace name string */
1723 subspace.name.n_name = subspace.name.n_strx + space_strings;
1725 newname = bfd_alloc (abfd, strlen (subspace.name.n_name) + 1);
1728 strcpy (newname, subspace.name.n_name);
1730 /* Make a section out of this subspace */
1731 subspace_asect = bfd_make_section_anyway (abfd, newname);
1732 if (!subspace_asect)
1735 /* Store private information about the section. */
1736 if (bfd_som_set_subsection_attributes (subspace_asect, space_asect,
1737 subspace.access_control_bits,
1739 subspace.quadrant) == false)
1742 /* Keep an easy mapping between subspaces and sections. */
1743 subspace_asect->target_index = total_subspaces++;
1745 /* Set SEC_READONLY and SEC_CODE/SEC_DATA as specified
1746 by the access_control_bits in the subspace header. */
1747 switch (subspace.access_control_bits >> 4)
1749 /* Readonly data. */
1751 subspace_asect->flags |= SEC_DATA | SEC_READONLY;
1756 subspace_asect->flags |= SEC_DATA;
1759 /* Readonly code and the gateways.
1760 Gateways have other attributes which do not map
1761 into anything BFD knows about. */
1767 subspace_asect->flags |= SEC_CODE | SEC_READONLY;
1770 /* dynamic (writable) code. */
1772 subspace_asect->flags |= SEC_CODE;
1776 if (subspace.dup_common || subspace.is_common)
1777 subspace_asect->flags |= SEC_IS_COMMON;
1778 else if (subspace.subspace_length > 0)
1779 subspace_asect->flags |= SEC_HAS_CONTENTS;
1781 if (subspace.is_loadable)
1782 subspace_asect->flags |= SEC_ALLOC | SEC_LOAD;
1784 subspace_asect->flags |= SEC_DEBUGGING;
1786 if (subspace.code_only)
1787 subspace_asect->flags |= SEC_CODE;
1789 /* Both file_loc_init_value and initialization_length will
1790 be zero for a BSS like subspace. */
1791 if (subspace.file_loc_init_value == 0
1792 && subspace.initialization_length == 0)
1793 subspace_asect->flags &= ~(SEC_DATA | SEC_LOAD);
1795 /* This subspace has relocations.
1796 The fixup_request_quantity is a byte count for the number of
1797 entries in the relocation stream; it is not the actual number
1798 of relocations in the subspace. */
1799 if (subspace.fixup_request_quantity != 0)
1801 subspace_asect->flags |= SEC_RELOC;
1802 subspace_asect->rel_filepos = subspace.fixup_request_index;
1803 som_section_data (subspace_asect)->reloc_size
1804 = subspace.fixup_request_quantity;
1805 /* We can not determine this yet. When we read in the
1806 relocation table the correct value will be filled in. */
1807 subspace_asect->reloc_count = -1;
1810 /* Update save_subspace if appropriate. */
1811 if (subspace.file_loc_init_value > save_subspace.file_loc_init_value)
1812 save_subspace = subspace;
1814 subspace_asect->vma = subspace.subspace_start;
1815 subspace_asect->_cooked_size = subspace.subspace_length;
1816 subspace_asect->_raw_size = subspace.subspace_length;
1817 subspace_asect->filepos = subspace.file_loc_init_value;
1818 subspace_asect->alignment_power = log2 (subspace.alignment);
1819 if (subspace_asect->alignment_power == -1)
1823 /* Yow! there is no subspace within the space which actually
1824 has initialized information in it; this should never happen
1825 as far as I know. */
1826 if (!save_subspace.file_loc_init_value)
1829 /* Setup the sizes for the space section based upon the info in the
1830 last subspace of the space. */
1831 space_asect->_cooked_size = save_subspace.subspace_start
1832 - space_asect->vma + save_subspace.subspace_length;
1833 space_asect->_raw_size = save_subspace.file_loc_init_value
1834 - space_asect->filepos + save_subspace.initialization_length;
1836 if (space_strings != NULL)
1837 free (space_strings);
1841 if (space_strings != NULL)
1842 free (space_strings);
1846 /* Read in a SOM object and make it into a BFD. */
1852 struct header file_hdr;
1853 struct som_exec_auxhdr aux_hdr;
1855 if (bfd_read ((PTR) & file_hdr, 1, FILE_HDR_SIZE, abfd) != FILE_HDR_SIZE)
1857 if (bfd_get_error () != bfd_error_system_call)
1858 bfd_set_error (bfd_error_wrong_format);
1862 if (!_PA_RISC_ID (file_hdr.system_id))
1864 bfd_set_error (bfd_error_wrong_format);
1868 switch (file_hdr.a_magic)
1883 #ifdef SHARED_MAGIC_CNX
1884 case SHARED_MAGIC_CNX:
1888 bfd_set_error (bfd_error_wrong_format);
1892 if (file_hdr.version_id != VERSION_ID
1893 && file_hdr.version_id != NEW_VERSION_ID)
1895 bfd_set_error (bfd_error_wrong_format);
1899 /* If the aux_header_size field in the file header is zero, then this
1900 object is an incomplete executable (a .o file). Do not try to read
1901 a non-existant auxiliary header. */
1902 memset (&aux_hdr, 0, sizeof (struct som_exec_auxhdr));
1903 if (file_hdr.aux_header_size != 0)
1905 if (bfd_read ((PTR) & aux_hdr, 1, AUX_HDR_SIZE, abfd) != AUX_HDR_SIZE)
1907 if (bfd_get_error () != bfd_error_system_call)
1908 bfd_set_error (bfd_error_wrong_format);
1913 if (!setup_sections (abfd, &file_hdr))
1915 /* setup_sections does not bubble up a bfd error code. */
1916 bfd_set_error (bfd_error_bad_value);
1920 /* This appears to be a valid SOM object. Do some initialization. */
1921 return som_object_setup (abfd, &file_hdr, &aux_hdr);
1924 /* Create a SOM object. */
1930 /* Allocate memory to hold backend information. */
1931 abfd->tdata.som_data = (struct som_data_struct *)
1932 bfd_zalloc (abfd, sizeof (struct som_data_struct));
1933 if (abfd->tdata.som_data == NULL)
1935 bfd_set_error (bfd_error_no_memory);
1941 /* Initialize some information in the file header. This routine makes
1942 not attempt at doing the right thing for a full executable; it
1943 is only meant to handle relocatable objects. */
1946 som_prep_headers (abfd)
1949 struct header *file_hdr;
1952 /* Make and attach a file header to the BFD. */
1953 file_hdr = (struct header *) bfd_zalloc (abfd, sizeof (struct header));
1954 if (file_hdr == NULL)
1957 bfd_set_error (bfd_error_no_memory);
1960 obj_som_file_hdr (abfd) = file_hdr;
1962 /* FIXME. This should really be conditional based on whether or not
1963 PA1.1 instructions/registers have been used. */
1964 if (abfd->flags & (EXEC_P | DYNAMIC))
1965 file_hdr->system_id = obj_som_exec_data (abfd)->system_id;
1967 file_hdr->system_id = CPU_PA_RISC1_0;
1969 if (abfd->flags & (EXEC_P | DYNAMIC))
1971 if (abfd->flags & D_PAGED)
1972 file_hdr->a_magic = DEMAND_MAGIC;
1973 else if (abfd->flags & WP_TEXT)
1974 file_hdr->a_magic = SHARE_MAGIC;
1976 else if (abfd->flags & DYNAMIC)
1977 file_hdr->a_magic = SHL_MAGIC;
1980 file_hdr->a_magic = EXEC_MAGIC;
1983 file_hdr->a_magic = RELOC_MAGIC;
1985 /* Only new format SOM is supported. */
1986 file_hdr->version_id = NEW_VERSION_ID;
1988 /* These fields are optional, and embedding timestamps is not always
1989 a wise thing to do, it makes comparing objects during a multi-stage
1990 bootstrap difficult. */
1991 file_hdr->file_time.secs = 0;
1992 file_hdr->file_time.nanosecs = 0;
1994 file_hdr->entry_space = 0;
1995 file_hdr->entry_subspace = 0;
1996 file_hdr->entry_offset = 0;
1997 file_hdr->presumed_dp = 0;
1999 /* Now iterate over the sections translating information from
2000 BFD sections to SOM spaces/subspaces. */
2002 for (section = abfd->sections; section != NULL; section = section->next)
2004 /* Ignore anything which has not been marked as a space or
2006 if (!som_is_space (section) && !som_is_subspace (section))
2009 if (som_is_space (section))
2011 /* Allocate space for the space dictionary. */
2012 som_section_data (section)->space_dict
2013 = (struct space_dictionary_record *)
2014 bfd_zalloc (abfd, sizeof (struct space_dictionary_record));
2015 if (som_section_data (section)->space_dict == NULL)
2017 bfd_set_error (bfd_error_no_memory);
2020 /* Set space attributes. Note most attributes of SOM spaces
2021 are set based on the subspaces it contains. */
2022 som_section_data (section)->space_dict->loader_fix_index = -1;
2023 som_section_data (section)->space_dict->init_pointer_index = -1;
2025 /* Set more attributes that were stuffed away in private data. */
2026 som_section_data (section)->space_dict->sort_key =
2027 som_section_data (section)->copy_data->sort_key;
2028 som_section_data (section)->space_dict->is_defined =
2029 som_section_data (section)->copy_data->is_defined;
2030 som_section_data (section)->space_dict->is_private =
2031 som_section_data (section)->copy_data->is_private;
2032 som_section_data (section)->space_dict->space_number =
2033 som_section_data (section)->copy_data->space_number;
2037 /* Allocate space for the subspace dictionary. */
2038 som_section_data (section)->subspace_dict
2039 = (struct subspace_dictionary_record *)
2040 bfd_zalloc (abfd, sizeof (struct subspace_dictionary_record));
2041 if (som_section_data (section)->subspace_dict == NULL)
2043 bfd_set_error (bfd_error_no_memory);
2047 /* Set subspace attributes. Basic stuff is done here, additional
2048 attributes are filled in later as more information becomes
2050 if (section->flags & SEC_IS_COMMON)
2052 som_section_data (section)->subspace_dict->dup_common = 1;
2053 som_section_data (section)->subspace_dict->is_common = 1;
2056 if (section->flags & SEC_ALLOC)
2057 som_section_data (section)->subspace_dict->is_loadable = 1;
2059 if (section->flags & SEC_CODE)
2060 som_section_data (section)->subspace_dict->code_only = 1;
2062 som_section_data (section)->subspace_dict->subspace_start =
2064 som_section_data (section)->subspace_dict->subspace_length =
2065 bfd_section_size (abfd, section);
2066 som_section_data (section)->subspace_dict->initialization_length =
2067 bfd_section_size (abfd, section);
2068 som_section_data (section)->subspace_dict->alignment =
2069 1 << section->alignment_power;
2071 /* Set more attributes that were stuffed away in private data. */
2072 som_section_data (section)->subspace_dict->sort_key =
2073 som_section_data (section)->copy_data->sort_key;
2074 som_section_data (section)->subspace_dict->access_control_bits =
2075 som_section_data (section)->copy_data->access_control_bits;
2076 som_section_data (section)->subspace_dict->quadrant =
2077 som_section_data (section)->copy_data->quadrant;
2083 /* Return true if the given section is a SOM space, false otherwise. */
2086 som_is_space (section)
2089 /* If no copy data is available, then it's neither a space nor a
2091 if (som_section_data (section)->copy_data == NULL)
2094 /* If the containing space isn't the same as the given section,
2095 then this isn't a space. */
2096 if (som_section_data (section)->copy_data->container != section)
2099 /* OK. Must be a space. */
2103 /* Return true if the given section is a SOM subspace, false otherwise. */
2106 som_is_subspace (section)
2109 /* If no copy data is available, then it's neither a space nor a
2111 if (som_section_data (section)->copy_data == NULL)
2114 /* If the containing space is the same as the given section,
2115 then this isn't a subspace. */
2116 if (som_section_data (section)->copy_data->container == section)
2119 /* OK. Must be a subspace. */
2123 /* Return true if the given space containins the given subspace. It
2124 is safe to assume space really is a space, and subspace really
2128 som_is_container (space, subspace)
2129 asection *space, *subspace;
2131 return som_section_data (subspace)->copy_data->container == space;
2134 /* Count and return the number of spaces attached to the given BFD. */
2136 static unsigned long
2137 som_count_spaces (abfd)
2143 for (section = abfd->sections; section != NULL; section = section->next)
2144 count += som_is_space (section);
2149 /* Count the number of subspaces attached to the given BFD. */
2151 static unsigned long
2152 som_count_subspaces (abfd)
2158 for (section = abfd->sections; section != NULL; section = section->next)
2159 count += som_is_subspace (section);
2164 /* Return -1, 0, 1 indicating the relative ordering of sym1 and sym2.
2166 We desire symbols to be ordered starting with the symbol with the
2167 highest relocation count down to the symbol with the lowest relocation
2168 count. Doing so compacts the relocation stream. */
2171 compare_syms (arg1, arg2)
2176 asymbol **sym1 = (asymbol **) arg1;
2177 asymbol **sym2 = (asymbol **) arg2;
2178 unsigned int count1, count2;
2180 /* Get relocation count for each symbol. Note that the count
2181 is stored in the udata pointer for section symbols! */
2182 if ((*sym1)->flags & BSF_SECTION_SYM)
2183 count1 = (int)(*sym1)->udata;
2185 count1 = som_symbol_data (*sym1)->reloc_count;
2187 if ((*sym2)->flags & BSF_SECTION_SYM)
2188 count2 = (int)(*sym2)->udata;
2190 count2 = som_symbol_data (*sym2)->reloc_count;
2192 /* Return the appropriate value. */
2193 if (count1 < count2)
2195 else if (count1 > count2)
2200 /* Perform various work in preparation for emitting the fixup stream. */
2203 som_prep_for_fixups (abfd, syms, num_syms)
2206 unsigned long num_syms;
2211 /* Most SOM relocations involving a symbol have a length which is
2212 dependent on the index of the symbol. So symbols which are
2213 used often in relocations should have a small index. */
2215 /* First initialize the counters for each symbol. */
2216 for (i = 0; i < num_syms; i++)
2218 /* Handle a section symbol; these have no pointers back to the
2219 SOM symbol info. So we just use the pointer field (udata)
2220 to hold the relocation count. */
2221 if (som_symbol_data (syms[i]) == NULL
2222 || syms[i]->flags & BSF_SECTION_SYM)
2224 syms[i]->flags |= BSF_SECTION_SYM;
2225 syms[i]->udata = (PTR) 0;
2228 som_symbol_data (syms[i])->reloc_count = 0;
2231 /* Now that the counters are initialized, make a weighted count
2232 of how often a given symbol is used in a relocation. */
2233 for (section = abfd->sections; section != NULL; section = section->next)
2237 /* Does this section have any relocations? */
2238 if (section->reloc_count <= 0)
2241 /* Walk through each relocation for this section. */
2242 for (i = 1; i < section->reloc_count; i++)
2244 arelent *reloc = section->orelocation[i];
2247 /* A relocation against a symbol in the *ABS* section really
2248 does not have a symbol. Likewise if the symbol isn't associated
2249 with any section. */
2250 if (reloc->sym_ptr_ptr == NULL
2251 || (*reloc->sym_ptr_ptr)->section == &bfd_abs_section)
2254 /* Scaling to encourage symbols involved in R_DP_RELATIVE
2255 and R_CODE_ONE_SYMBOL relocations to come first. These
2256 two relocations have single byte versions if the symbol
2257 index is very small. */
2258 if (reloc->howto->type == R_DP_RELATIVE
2259 || reloc->howto->type == R_CODE_ONE_SYMBOL)
2264 /* Handle section symbols by ramming the count in the udata
2265 field. It will not be used and the count is very important
2266 for these symbols. */
2267 if ((*reloc->sym_ptr_ptr)->flags & BSF_SECTION_SYM)
2269 (*reloc->sym_ptr_ptr)->udata =
2270 (PTR) ((int) (*reloc->sym_ptr_ptr)->udata + scale);
2274 /* A normal symbol. Increment the count. */
2275 som_symbol_data (*reloc->sym_ptr_ptr)->reloc_count += scale;
2279 /* Now sort the symbols. */
2280 qsort (syms, num_syms, sizeof (asymbol *), compare_syms);
2282 /* Compute the symbol indexes, they will be needed by the relocation
2284 for (i = 0; i < num_syms; i++)
2286 /* A section symbol. Again, there is no pointer to backend symbol
2287 information, so we reuse (abuse) the udata field again. */
2288 if (syms[i]->flags & BSF_SECTION_SYM)
2289 syms[i]->udata = (PTR) i;
2291 som_symbol_data (syms[i])->index = i;
2296 som_write_fixups (abfd, current_offset, total_reloc_sizep)
2298 unsigned long current_offset;
2299 unsigned int *total_reloc_sizep;
2302 /* Chunk of memory that we can use as buffer space, then throw
2304 unsigned char tmp_space[SOM_TMP_BUFSIZE];
2306 unsigned int total_reloc_size = 0;
2307 unsigned int subspace_reloc_size = 0;
2308 unsigned int num_spaces = obj_som_file_hdr (abfd)->space_total;
2309 asection *section = abfd->sections;
2311 memset (tmp_space, 0, SOM_TMP_BUFSIZE);
2314 /* All the fixups for a particular subspace are emitted in a single
2315 stream. All the subspaces for a particular space are emitted
2318 So, to get all the locations correct one must iterate through all the
2319 spaces, for each space iterate through its subspaces and output a
2321 for (i = 0; i < num_spaces; i++)
2323 asection *subsection;
2326 while (!som_is_space (section))
2327 section = section->next;
2329 /* Now iterate through each of its subspaces. */
2330 for (subsection = abfd->sections;
2332 subsection = subsection->next)
2334 int reloc_offset, current_rounding_mode;
2336 /* Find a subspace of this space. */
2337 if (!som_is_subspace (subsection)
2338 || !som_is_container (section, subsection))
2341 /* If this subspace does not have real data, then we are
2343 if ((subsection->flags & (SEC_LOAD | SEC_DEBUGGING)) == 0)
2345 som_section_data (subsection)->subspace_dict->fixup_request_index
2350 /* This subspace has some relocations. Put the relocation stream
2351 index into the subspace record. */
2352 som_section_data (subsection)->subspace_dict->fixup_request_index
2355 /* To make life easier start over with a clean slate for
2356 each subspace. Seek to the start of the relocation stream
2357 for this subspace in preparation for writing out its fixup
2359 if (bfd_seek (abfd, current_offset + total_reloc_size, SEEK_SET) < 0)
2362 /* Buffer space has already been allocated. Just perform some
2363 initialization here. */
2365 subspace_reloc_size = 0;
2367 som_initialize_reloc_queue (reloc_queue);
2368 current_rounding_mode = R_N_MODE;
2370 /* Translate each BFD relocation into one or more SOM
2372 for (j = 0; j < subsection->reloc_count; j++)
2374 arelent *bfd_reloc = subsection->orelocation[j];
2378 /* Get the symbol number. Remember it's stored in a
2379 special place for section symbols. */
2380 if ((*bfd_reloc->sym_ptr_ptr)->flags & BSF_SECTION_SYM)
2381 sym_num = (int) (*bfd_reloc->sym_ptr_ptr)->udata;
2383 sym_num = som_symbol_data (*bfd_reloc->sym_ptr_ptr)->index;
2385 /* If there is not enough room for the next couple relocations,
2386 then dump the current buffer contents now. Also reinitialize
2387 the relocation queue.
2389 No single BFD relocation could ever translate into more
2390 than 100 bytes of SOM relocations (20bytes is probably the
2391 upper limit, but leave lots of space for growth). */
2392 if (p - tmp_space + 100 > SOM_TMP_BUFSIZE)
2394 if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd)
2399 som_initialize_reloc_queue (reloc_queue);
2402 /* Emit R_NO_RELOCATION fixups to map any bytes which were
2404 skip = bfd_reloc->address - reloc_offset;
2405 p = som_reloc_skip (abfd, skip, p,
2406 &subspace_reloc_size, reloc_queue);
2408 /* Update reloc_offset for the next iteration.
2410 Many relocations do not consume input bytes. They
2411 are markers, or set state necessary to perform some
2412 later relocation. */
2413 switch (bfd_reloc->howto->type)
2415 /* This only needs to handle relocations that may be
2416 made by hppa_som_gen_reloc. */
2426 reloc_offset = bfd_reloc->address;
2430 reloc_offset = bfd_reloc->address + 4;
2434 /* Now the actual relocation we care about. */
2435 switch (bfd_reloc->howto->type)
2439 p = som_reloc_call (abfd, p, &subspace_reloc_size,
2440 bfd_reloc, sym_num, reloc_queue);
2443 case R_CODE_ONE_SYMBOL:
2445 /* Account for any addend. */
2446 if (bfd_reloc->addend)
2447 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
2448 &subspace_reloc_size, reloc_queue);
2452 bfd_put_8 (abfd, bfd_reloc->howto->type + sym_num, p);
2453 subspace_reloc_size += 1;
2456 else if (sym_num < 0x100)
2458 bfd_put_8 (abfd, bfd_reloc->howto->type + 32, p);
2459 bfd_put_8 (abfd, sym_num, p + 1);
2460 p = try_prev_fixup (abfd, &subspace_reloc_size, p,
2463 else if (sym_num < 0x10000000)
2465 bfd_put_8 (abfd, bfd_reloc->howto->type + 33, p);
2466 bfd_put_8 (abfd, sym_num >> 16, p + 1);
2467 bfd_put_16 (abfd, sym_num, p + 2);
2468 p = try_prev_fixup (abfd, &subspace_reloc_size,
2475 case R_DATA_ONE_SYMBOL:
2479 /* Account for any addend. */
2480 if (bfd_reloc->addend)
2481 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
2482 &subspace_reloc_size, reloc_queue);
2484 if (sym_num < 0x100)
2486 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
2487 bfd_put_8 (abfd, sym_num, p + 1);
2488 p = try_prev_fixup (abfd, &subspace_reloc_size, p,
2491 else if (sym_num < 0x10000000)
2493 bfd_put_8 (abfd, bfd_reloc->howto->type + 1, p);
2494 bfd_put_8 (abfd, sym_num >> 16, p + 1);
2495 bfd_put_16 (abfd, sym_num, p + 2);
2496 p = try_prev_fixup (abfd, &subspace_reloc_size,
2506 = (int *) som_symbol_data (*bfd_reloc->sym_ptr_ptr)->unwind;
2507 bfd_put_8 (abfd, R_ENTRY, p);
2508 bfd_put_32 (abfd, descp[0], p + 1);
2509 bfd_put_32 (abfd, descp[1], p + 5);
2510 p = try_prev_fixup (abfd, &subspace_reloc_size,
2516 bfd_put_8 (abfd, R_EXIT, p);
2517 subspace_reloc_size += 1;
2525 /* If this relocation requests the current rounding
2526 mode, then it is redundant. */
2527 if (bfd_reloc->howto->type != current_rounding_mode)
2529 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
2530 subspace_reloc_size += 1;
2532 current_rounding_mode = bfd_reloc->howto->type;
2539 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
2540 subspace_reloc_size += 1;
2544 /* Put a "R_RESERVED" relocation in the stream if
2545 we hit something we do not understand. The linker
2546 will complain loudly if this ever happens. */
2548 bfd_put_8 (abfd, 0xff, p);
2549 subspace_reloc_size += 1;
2555 /* Last BFD relocation for a subspace has been processed.
2556 Map the rest of the subspace with R_NO_RELOCATION fixups. */
2557 p = som_reloc_skip (abfd, bfd_section_size (abfd, subsection)
2559 p, &subspace_reloc_size, reloc_queue);
2561 /* Scribble out the relocations. */
2562 if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd)
2567 total_reloc_size += subspace_reloc_size;
2568 som_section_data (subsection)->subspace_dict->fixup_request_quantity
2569 = subspace_reloc_size;
2571 section = section->next;
2573 *total_reloc_sizep = total_reloc_size;
2577 /* Write out the space/subspace string table. */
2580 som_write_space_strings (abfd, current_offset, string_sizep)
2582 unsigned long current_offset;
2583 unsigned int *string_sizep;
2585 /* Chunk of memory that we can use as buffer space, then throw
2587 unsigned char tmp_space[SOM_TMP_BUFSIZE];
2589 unsigned int strings_size = 0;
2592 memset (tmp_space, 0, SOM_TMP_BUFSIZE);
2595 /* Seek to the start of the space strings in preparation for writing
2597 if (bfd_seek (abfd, current_offset, SEEK_SET) < 0)
2600 /* Walk through all the spaces and subspaces (order is not important)
2601 building up and writing string table entries for their names. */
2602 for (section = abfd->sections; section != NULL; section = section->next)
2606 /* Only work with space/subspaces; avoid any other sections
2607 which might have been made (.text for example). */
2608 if (!som_is_space (section) && !som_is_subspace (section))
2611 /* Get the length of the space/subspace name. */
2612 length = strlen (section->name);
2614 /* If there is not enough room for the next entry, then dump the
2615 current buffer contents now. Each entry will take 4 bytes to
2616 hold the string length + the string itself + null terminator. */
2617 if (p - tmp_space + 5 + length > SOM_TMP_BUFSIZE)
2619 if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd)
2622 /* Reset to beginning of the buffer space. */
2626 /* First element in a string table entry is the length of the
2627 string. Alignment issues are already handled. */
2628 bfd_put_32 (abfd, length, p);
2632 /* Record the index in the space/subspace records. */
2633 if (som_is_space (section))
2634 som_section_data (section)->space_dict->name.n_strx = strings_size;
2636 som_section_data (section)->subspace_dict->name.n_strx = strings_size;
2638 /* Next comes the string itself + a null terminator. */
2639 strcpy (p, section->name);
2641 strings_size += length + 1;
2643 /* Always align up to the next word boundary. */
2644 while (strings_size % 4)
2646 bfd_put_8 (abfd, 0, p);
2652 /* Done with the space/subspace strings. Write out any information
2653 contained in a partial block. */
2654 if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd) != p - tmp_space)
2656 *string_sizep = strings_size;
2660 /* Write out the symbol string table. */
2663 som_write_symbol_strings (abfd, current_offset, syms, num_syms, string_sizep)
2665 unsigned long current_offset;
2667 unsigned int num_syms;
2668 unsigned int *string_sizep;
2672 /* Chunk of memory that we can use as buffer space, then throw
2674 unsigned char tmp_space[SOM_TMP_BUFSIZE];
2676 unsigned int strings_size = 0;
2678 memset (tmp_space, 0, SOM_TMP_BUFSIZE);
2681 /* Seek to the start of the space strings in preparation for writing
2683 if (bfd_seek (abfd, current_offset, SEEK_SET) < 0)
2686 for (i = 0; i < num_syms; i++)
2688 int length = strlen (syms[i]->name);
2690 /* If there is not enough room for the next entry, then dump the
2691 current buffer contents now. */
2692 if (p - tmp_space + 5 + length > SOM_TMP_BUFSIZE)
2694 if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd)
2697 /* Reset to beginning of the buffer space. */
2701 /* First element in a string table entry is the length of the
2702 string. This must always be 4 byte aligned. This is also
2703 an appropriate time to fill in the string index field in the
2704 symbol table entry. */
2705 bfd_put_32 (abfd, length, p);
2709 /* Next comes the string itself + a null terminator. */
2710 strcpy (p, syms[i]->name);
2713 syms[i]->name = (char *)strings_size;
2715 strings_size += length + 1;
2717 /* Always align up to the next word boundary. */
2718 while (strings_size % 4)
2720 bfd_put_8 (abfd, 0, p);
2726 /* Scribble out any partial block. */
2727 if (bfd_write ((PTR) &tmp_space[0], p - tmp_space, 1, abfd) != p - tmp_space)
2730 *string_sizep = strings_size;
2734 /* Compute variable information to be placed in the SOM headers,
2735 space/subspace dictionaries, relocation streams, etc. Begin
2736 writing parts of the object file. */
2739 som_begin_writing (abfd)
2742 unsigned long current_offset = 0;
2743 int strings_size = 0;
2744 unsigned int total_reloc_size = 0;
2745 unsigned long num_spaces, num_subspaces, num_syms, i;
2747 asymbol **syms = bfd_get_outsymbols (abfd);
2748 unsigned int total_subspaces = 0;
2749 struct som_exec_auxhdr exec_header;
2751 /* The file header will always be first in an object file,
2752 everything else can be in random locations. To keep things
2753 "simple" BFD will lay out the object file in the manner suggested
2754 by the PRO ABI for PA-RISC Systems. */
2756 /* Before any output can really begin offsets for all the major
2757 portions of the object file must be computed. So, starting
2758 with the initial file header compute (and sometimes write)
2759 each portion of the object file. */
2761 /* Make room for the file header, it's contents are not complete
2762 yet, so it can not be written at this time. */
2763 current_offset += sizeof (struct header);
2765 /* Any auxiliary headers will follow the file header. Right now
2766 we support only the copyright and version headers. */
2767 obj_som_file_hdr (abfd)->aux_header_location = current_offset;
2768 obj_som_file_hdr (abfd)->aux_header_size = 0;
2769 if (abfd->flags & (EXEC_P | DYNAMIC))
2771 /* Parts of the exec header will be filled in later, so
2772 delay writing the header itself. Fill in the defaults,
2773 and write it later. */
2774 current_offset += sizeof (exec_header);
2775 obj_som_file_hdr (abfd)->aux_header_size += sizeof (exec_header);
2776 memset (&exec_header, 0, sizeof (exec_header));
2777 exec_header.som_auxhdr.type = HPUX_AUX_ID;
2778 exec_header.som_auxhdr.length = 40;
2780 if (obj_som_version_hdr (abfd) != NULL)
2784 if (bfd_seek (abfd, current_offset, SEEK_SET) < 0)
2787 /* Write the aux_id structure and the string length. */
2788 len = sizeof (struct aux_id) + sizeof (unsigned int);
2789 obj_som_file_hdr (abfd)->aux_header_size += len;
2790 current_offset += len;
2791 if (bfd_write ((PTR) obj_som_version_hdr (abfd), len, 1, abfd) != len)
2794 /* Write the version string. */
2795 len = obj_som_version_hdr (abfd)->header_id.length - sizeof (int);
2796 obj_som_file_hdr (abfd)->aux_header_size += len;
2797 current_offset += len;
2798 if (bfd_write ((PTR) obj_som_version_hdr (abfd)->user_string,
2799 len, 1, abfd) != len)
2803 if (obj_som_copyright_hdr (abfd) != NULL)
2807 if (bfd_seek (abfd, current_offset, SEEK_SET) < 0)
2810 /* Write the aux_id structure and the string length. */
2811 len = sizeof (struct aux_id) + sizeof (unsigned int);
2812 obj_som_file_hdr (abfd)->aux_header_size += len;
2813 current_offset += len;
2814 if (bfd_write ((PTR) obj_som_copyright_hdr (abfd), len, 1, abfd) != len)
2817 /* Write the copyright string. */
2818 len = obj_som_copyright_hdr (abfd)->header_id.length - sizeof (int);
2819 obj_som_file_hdr (abfd)->aux_header_size += len;
2820 current_offset += len;
2821 if (bfd_write ((PTR) obj_som_copyright_hdr (abfd)->copyright,
2822 len, 1, abfd) != len)
2826 /* Next comes the initialization pointers; we have no initialization
2827 pointers, so current offset does not change. */
2828 obj_som_file_hdr (abfd)->init_array_location = current_offset;
2829 obj_som_file_hdr (abfd)->init_array_total = 0;
2831 /* Next are the space records. These are fixed length records.
2833 Count the number of spaces to determine how much room is needed
2834 in the object file for the space records.
2836 The names of the spaces are stored in a separate string table,
2837 and the index for each space into the string table is computed
2838 below. Therefore, it is not possible to write the space headers
2840 num_spaces = som_count_spaces (abfd);
2841 obj_som_file_hdr (abfd)->space_location = current_offset;
2842 obj_som_file_hdr (abfd)->space_total = num_spaces;
2843 current_offset += num_spaces * sizeof (struct space_dictionary_record);
2845 /* Next are the subspace records. These are fixed length records.
2847 Count the number of subspaes to determine how much room is needed
2848 in the object file for the subspace records.
2850 A variety if fields in the subspace record are still unknown at
2851 this time (index into string table, fixup stream location/size, etc). */
2852 num_subspaces = som_count_subspaces (abfd);
2853 obj_som_file_hdr (abfd)->subspace_location = current_offset;
2854 obj_som_file_hdr (abfd)->subspace_total = num_subspaces;
2855 current_offset += num_subspaces * sizeof (struct subspace_dictionary_record);
2857 /* Next is the string table for the space/subspace names. We will
2858 build and write the string table on the fly. At the same time
2859 we will fill in the space/subspace name index fields. */
2861 /* The string table needs to be aligned on a word boundary. */
2862 if (current_offset % 4)
2863 current_offset += (4 - (current_offset % 4));
2865 /* Mark the offset of the space/subspace string table in the
2867 obj_som_file_hdr (abfd)->space_strings_location = current_offset;
2869 /* Scribble out the space strings. */
2870 if (som_write_space_strings (abfd, current_offset, &strings_size) == false)
2873 /* Record total string table size in the header and update the
2875 obj_som_file_hdr (abfd)->space_strings_size = strings_size;
2876 current_offset += strings_size;
2878 /* Next is the symbol table. These are fixed length records.
2880 Count the number of symbols to determine how much room is needed
2881 in the object file for the symbol table.
2883 The names of the symbols are stored in a separate string table,
2884 and the index for each symbol name into the string table is computed
2885 below. Therefore, it is not possible to write the symobl table
2887 num_syms = bfd_get_symcount (abfd);
2888 obj_som_file_hdr (abfd)->symbol_location = current_offset;
2889 obj_som_file_hdr (abfd)->symbol_total = num_syms;
2890 current_offset += num_syms * sizeof (struct symbol_dictionary_record);
2892 /* Do prep work before handling fixups. */
2893 som_prep_for_fixups (abfd, syms, num_syms);
2895 /* Next comes the fixup stream which starts on a word boundary. */
2896 if (current_offset % 4)
2897 current_offset += (4 - (current_offset % 4));
2898 obj_som_file_hdr (abfd)->fixup_request_location = current_offset;
2900 /* Write the fixups and update fields in subspace headers which
2901 relate to the fixup stream. */
2902 if (som_write_fixups (abfd, current_offset, &total_reloc_size) == false)
2905 /* Record the total size of the fixup stream in the file header. */
2906 obj_som_file_hdr (abfd)->fixup_request_total = total_reloc_size;
2907 current_offset += total_reloc_size;
2909 /* Next are the symbol strings.
2910 Align them to a word boundary. */
2911 if (current_offset % 4)
2912 current_offset += (4 - (current_offset % 4));
2913 obj_som_file_hdr (abfd)->symbol_strings_location = current_offset;
2915 /* Scribble out the symbol strings. */
2916 if (som_write_symbol_strings (abfd, current_offset, syms,
2917 num_syms, &strings_size)
2921 /* Record total string table size in header and update the
2923 obj_som_file_hdr (abfd)->symbol_strings_size = strings_size;
2924 current_offset += strings_size;
2926 /* Next is the compiler records. We do not use these. */
2927 obj_som_file_hdr (abfd)->compiler_location = current_offset;
2928 obj_som_file_hdr (abfd)->compiler_total = 0;
2930 /* Now compute the file positions for the loadable subspaces, taking
2931 care to make sure everything stays properly aligned. */
2933 section = abfd->sections;
2934 for (i = 0; i < num_spaces; i++)
2936 asection *subsection;
2938 unsigned int subspace_offset = 0;
2941 while (!som_is_space (section))
2942 section = section->next;
2945 /* Now look for all its subspaces. */
2946 for (subsection = abfd->sections;
2948 subsection = subsection->next)
2951 if (!som_is_subspace (subsection)
2952 || !som_is_container (section, subsection)
2953 || (subsection->flags & SEC_ALLOC) == 0)
2956 /* If this is the first subspace in the space, and we are
2957 building an executable, then take care to make sure all
2958 the alignments are correct and update the exec header. */
2960 && (abfd->flags & (EXEC_P | DYNAMIC)))
2962 /* Demand paged executables have each space aligned to a
2963 page boundary. Sharable executables (write-protected
2964 text) have just the private (aka data & bss) space aligned
2965 to a page boundary. Ugh. Not true for HPUX.
2967 The HPUX kernel requires the text to always be page aligned
2968 within the file regardless of the executable's type. */
2969 if (abfd->flags & (D_PAGED | DYNAMIC)
2970 || (subsection->flags & SEC_CODE)
2971 || ((abfd->flags & WP_TEXT)
2972 && (subsection->flags & SEC_DATA)))
2973 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
2975 /* Update the exec header. */
2976 if (subsection->flags & SEC_CODE && exec_header.exec_tfile == 0)
2978 exec_header.exec_tmem = section->vma;
2979 exec_header.exec_tfile = current_offset;
2981 if (subsection->flags & SEC_DATA && exec_header.exec_dfile == 0)
2983 exec_header.exec_dmem = section->vma;
2984 exec_header.exec_dfile = current_offset;
2987 /* Keep track of exactly where we are within a particular
2988 space. This is necessary as the braindamaged HPUX
2989 loader will create holes between subspaces *and*
2990 subspace alignments are *NOT* preserved. What a crock. */
2991 subspace_offset = subsection->vma;
2993 /* Only do this for the first subspace within each space. */
2996 else if (abfd->flags & (EXEC_P | DYNAMIC))
2998 /* The braindamaged HPUX loader may have created a hole
2999 between two subspaces. It is *not* sufficient to use
3000 the alignment specifications within the subspaces to
3001 account for these holes -- I've run into at least one
3002 case where the loader left one code subspace unaligned
3003 in a final executable.
3005 To combat this we keep a current offset within each space,
3006 and use the subspace vma fields to detect and preserve
3007 holes. What a crock!
3009 ps. This is not necessary for unloadable space/subspaces. */
3010 current_offset += subsection->vma - subspace_offset;
3011 if (subsection->flags & SEC_CODE)
3012 exec_header.exec_tsize += subsection->vma - subspace_offset;
3014 exec_header.exec_dsize += subsection->vma - subspace_offset;
3015 subspace_offset += subsection->vma - subspace_offset;
3019 subsection->target_index = total_subspaces++;
3020 /* This is real data to be loaded from the file. */
3021 if (subsection->flags & SEC_LOAD)
3023 /* Update the size of the code & data. */
3024 if (abfd->flags & (EXEC_P | DYNAMIC)
3025 && subsection->flags & SEC_CODE)
3026 exec_header.exec_tsize += subsection->_cooked_size;
3027 else if (abfd->flags & (EXEC_P | DYNAMIC)
3028 && subsection->flags & SEC_DATA)
3029 exec_header.exec_dsize += subsection->_cooked_size;
3030 som_section_data (subsection)->subspace_dict->file_loc_init_value
3032 subsection->filepos = current_offset;
3033 current_offset += bfd_section_size (abfd, subsection);
3034 subspace_offset += bfd_section_size (abfd, subsection);
3036 /* Looks like uninitialized data. */
3039 /* Update the size of the bss section. */
3040 if (abfd->flags & (EXEC_P | DYNAMIC))
3041 exec_header.exec_bsize += subsection->_cooked_size;
3043 som_section_data (subsection)->subspace_dict->file_loc_init_value
3045 som_section_data (subsection)->subspace_dict->
3046 initialization_length = 0;
3049 /* Goto the next section. */
3050 section = section->next;
3053 /* Finally compute the file positions for unloadable subspaces.
3054 If building an executable, start the unloadable stuff on its
3057 if (abfd->flags & (EXEC_P | DYNAMIC))
3058 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3060 obj_som_file_hdr (abfd)->unloadable_sp_location = current_offset;
3061 section = abfd->sections;
3062 for (i = 0; i < num_spaces; i++)
3064 asection *subsection;
3067 while (!som_is_space (section))
3068 section = section->next;
3070 if (abfd->flags & (EXEC_P | DYNAMIC))
3071 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3073 /* Now look for all its subspaces. */
3074 for (subsection = abfd->sections;
3076 subsection = subsection->next)
3079 if (!som_is_subspace (subsection)
3080 || !som_is_container (section, subsection)
3081 || (subsection->flags & SEC_ALLOC) != 0)
3084 subsection->target_index = total_subspaces;
3085 /* This is real data to be loaded from the file. */
3086 if ((subsection->flags & SEC_LOAD) == 0)
3088 som_section_data (subsection)->subspace_dict->file_loc_init_value
3090 subsection->filepos = current_offset;
3091 current_offset += bfd_section_size (abfd, subsection);
3093 /* Looks like uninitialized data. */
3096 som_section_data (subsection)->subspace_dict->file_loc_init_value
3098 som_section_data (subsection)->subspace_dict->
3099 initialization_length = bfd_section_size (abfd, subsection);
3102 /* Goto the next section. */
3103 section = section->next;
3106 /* If building an executable, then make sure to seek to and write
3107 one byte at the end of the file to make sure any necessary
3108 zeros are filled in. Ugh. */
3109 if (abfd->flags & (EXEC_P | DYNAMIC))
3110 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3111 if (bfd_seek (abfd, current_offset - 1, SEEK_SET) < 0)
3113 if (bfd_write ((PTR) "", 1, 1, abfd) != 1)
3116 obj_som_file_hdr (abfd)->unloadable_sp_size
3117 = current_offset - obj_som_file_hdr (abfd)->unloadable_sp_location;
3119 /* Loader fixups are not supported in any way shape or form. */
3120 obj_som_file_hdr (abfd)->loader_fixup_location = 0;
3121 obj_som_file_hdr (abfd)->loader_fixup_total = 0;
3123 /* Done. Store the total size of the SOM. */
3124 obj_som_file_hdr (abfd)->som_length = current_offset;
3126 /* Now write the exec header. */
3127 if (abfd->flags & (EXEC_P | DYNAMIC))
3131 exec_header.exec_entry = bfd_get_start_address (abfd);
3132 exec_header.exec_flags = obj_som_exec_data (abfd)->exec_flags;
3134 /* Oh joys. Ram some of the BSS data into the DATA section
3135 to be compatable with how the hp linker makes objects
3136 (saves memory space). */
3137 tmp = exec_header.exec_dsize;
3138 tmp = SOM_ALIGN (tmp, PA_PAGESIZE);
3139 exec_header.exec_bsize -= (tmp - exec_header.exec_dsize);
3140 if (exec_header.exec_bsize < 0)
3141 exec_header.exec_bsize = 0;
3142 exec_header.exec_dsize = tmp;
3144 if (bfd_seek (abfd, obj_som_file_hdr (abfd)->aux_header_location,
3148 if (bfd_write ((PTR) &exec_header, AUX_HDR_SIZE, 1, abfd)
3155 /* Finally, scribble out the various headers to the disk. */
3158 som_write_headers (abfd)
3161 int num_spaces = som_count_spaces (abfd);
3163 int subspace_index = 0;
3167 /* Subspaces are written first so that we can set up information
3168 about them in their containing spaces as the subspace is written. */
3170 /* Seek to the start of the subspace dictionary records. */
3171 location = obj_som_file_hdr (abfd)->subspace_location;
3172 if (bfd_seek (abfd, location, SEEK_SET) < 0)
3175 section = abfd->sections;
3176 /* Now for each loadable space write out records for its subspaces. */
3177 for (i = 0; i < num_spaces; i++)
3179 asection *subsection;
3182 while (!som_is_space (section))
3183 section = section->next;
3185 /* Now look for all its subspaces. */
3186 for (subsection = abfd->sections;
3188 subsection = subsection->next)
3191 /* Skip any section which does not correspond to a space
3192 or subspace. Or does not have SEC_ALLOC set (and therefore
3193 has no real bits on the disk). */
3194 if (!som_is_subspace (subsection)
3195 || !som_is_container (section, subsection)
3196 || (subsection->flags & SEC_ALLOC) == 0)
3199 /* If this is the first subspace for this space, then save
3200 the index of the subspace in its containing space. Also
3201 set "is_loadable" in the containing space. */
3203 if (som_section_data (section)->space_dict->subspace_quantity == 0)
3205 som_section_data (section)->space_dict->is_loadable = 1;
3206 som_section_data (section)->space_dict->subspace_index
3210 /* Increment the number of subspaces seen and the number of
3211 subspaces contained within the current space. */
3213 som_section_data (section)->space_dict->subspace_quantity++;
3215 /* Mark the index of the current space within the subspace's
3216 dictionary record. */
3217 som_section_data (subsection)->subspace_dict->space_index = i;
3219 /* Dump the current subspace header. */
3220 if (bfd_write ((PTR) som_section_data (subsection)->subspace_dict,
3221 sizeof (struct subspace_dictionary_record), 1, abfd)
3222 != sizeof (struct subspace_dictionary_record))
3225 /* Goto the next section. */
3226 section = section->next;
3229 /* Now repeat the process for unloadable subspaces. */
3230 section = abfd->sections;
3231 /* Now for each space write out records for its subspaces. */
3232 for (i = 0; i < num_spaces; i++)
3234 asection *subsection;
3237 while (!som_is_space (section))
3238 section = section->next;
3240 /* Now look for all its subspaces. */
3241 for (subsection = abfd->sections;
3243 subsection = subsection->next)
3246 /* Skip any section which does not correspond to a space or
3247 subspace, or which SEC_ALLOC set (and therefore handled
3248 in the loadable spaces/subspaces code above). */
3250 if (!som_is_subspace (subsection)
3251 || !som_is_container (section, subsection)
3252 || (subsection->flags & SEC_ALLOC) != 0)
3255 /* If this is the first subspace for this space, then save
3256 the index of the subspace in its containing space. Clear
3259 if (som_section_data (section)->space_dict->subspace_quantity == 0)
3261 som_section_data (section)->space_dict->is_loadable = 0;
3262 som_section_data (section)->space_dict->subspace_index
3266 /* Increment the number of subspaces seen and the number of
3267 subspaces contained within the current space. */
3268 som_section_data (section)->space_dict->subspace_quantity++;
3271 /* Mark the index of the current space within the subspace's
3272 dictionary record. */
3273 som_section_data (subsection)->subspace_dict->space_index = i;
3275 /* Dump this subspace header. */
3276 if (bfd_write ((PTR) som_section_data (subsection)->subspace_dict,
3277 sizeof (struct subspace_dictionary_record), 1, abfd)
3278 != sizeof (struct subspace_dictionary_record))
3281 /* Goto the next section. */
3282 section = section->next;
3285 /* All the subspace dictiondary records are written, and all the
3286 fields are set up in the space dictionary records.
3288 Seek to the right location and start writing the space
3289 dictionary records. */
3290 location = obj_som_file_hdr (abfd)->space_location;
3291 if (bfd_seek (abfd, location, SEEK_SET) < 0)
3294 section = abfd->sections;
3295 for (i = 0; i < num_spaces; i++)
3299 while (!som_is_space (section))
3300 section = section->next;
3302 /* Dump its header */
3303 if (bfd_write ((PTR) som_section_data (section)->space_dict,
3304 sizeof (struct space_dictionary_record), 1, abfd)
3305 != sizeof (struct space_dictionary_record))
3308 /* Goto the next section. */
3309 section = section->next;
3312 /* Only thing left to do is write out the file header. It is always
3313 at location zero. Seek there and write it. */
3314 if (bfd_seek (abfd, (file_ptr) 0, SEEK_SET) < 0)
3316 if (bfd_write ((PTR) obj_som_file_hdr (abfd),
3317 sizeof (struct header), 1, abfd)
3318 != sizeof (struct header))
3323 /* Compute and return the checksum for a SOM file header. */
3325 static unsigned long
3326 som_compute_checksum (abfd)
3329 unsigned long checksum, count, i;
3330 unsigned long *buffer = (unsigned long *) obj_som_file_hdr (abfd);
3333 count = sizeof (struct header) / sizeof (unsigned long);
3334 for (i = 0; i < count; i++)
3335 checksum ^= *(buffer + i);
3341 som_bfd_derive_misc_symbol_info (abfd, sym, info)
3344 struct som_misc_symbol_info *info;
3347 memset (info, 0, sizeof (struct som_misc_symbol_info));
3349 /* The HP SOM linker requires detailed type information about
3350 all symbols (including undefined symbols!). Unfortunately,
3351 the type specified in an import/export statement does not
3352 always match what the linker wants. Severe braindamage. */
3354 /* Section symbols will not have a SOM symbol type assigned to
3355 them yet. Assign all section symbols type ST_DATA. */
3356 if (sym->flags & BSF_SECTION_SYM)
3357 info->symbol_type = ST_DATA;
3360 /* Common symbols must have scope SS_UNSAT and type
3361 ST_STORAGE or the linker will choke. */
3362 if (sym->section == &bfd_com_section)
3364 info->symbol_scope = SS_UNSAT;
3365 info->symbol_type = ST_STORAGE;
3368 /* It is possible to have a symbol without an associated
3369 type. This happens if the user imported the symbol
3370 without a type and the symbol was never defined
3371 locally. If BSF_FUNCTION is set for this symbol, then
3372 assign it type ST_CODE (the HP linker requires undefined
3373 external functions to have type ST_CODE rather than ST_ENTRY). */
3374 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN
3375 && sym->section == &bfd_und_section
3376 && sym->flags & BSF_FUNCTION)
3377 info->symbol_type = ST_CODE;
3379 /* Handle function symbols which were defined in this file.
3380 They should have type ST_ENTRY. Also retrieve the argument
3381 relocation bits from the SOM backend information. */
3382 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_ENTRY
3383 || (som_symbol_data (sym)->som_type == SYMBOL_TYPE_CODE
3384 && (sym->flags & BSF_FUNCTION))
3385 || (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN
3386 && (sym->flags & BSF_FUNCTION)))
3388 info->symbol_type = ST_ENTRY;
3389 info->arg_reloc = som_symbol_data (sym)->tc_data.hppa_arg_reloc;
3392 /* If the type is unknown at this point, it should be
3393 ST_DATA (functions were handled as special cases above). */
3394 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN)
3395 info->symbol_type = ST_DATA;
3397 /* From now on it's a very simple mapping. */
3398 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_ABSOLUTE)
3399 info->symbol_type = ST_ABSOLUTE;
3400 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_CODE)
3401 info->symbol_type = ST_CODE;
3402 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_DATA)
3403 info->symbol_type = ST_DATA;
3404 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_MILLICODE)
3405 info->symbol_type = ST_MILLICODE;
3406 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_PLABEL)
3407 info->symbol_type = ST_PLABEL;
3408 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_PRI_PROG)
3409 info->symbol_type = ST_PRI_PROG;
3410 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_SEC_PROG)
3411 info->symbol_type = ST_SEC_PROG;
3414 /* Now handle the symbol's scope. Exported data which is not
3415 in the common section has scope SS_UNIVERSAL. Note scope
3416 of common symbols was handled earlier! */
3417 if (sym->flags & BSF_EXPORT && sym->section != &bfd_com_section)
3418 info->symbol_scope = SS_UNIVERSAL;
3419 /* Any undefined symbol at this point has a scope SS_UNSAT. */
3420 else if (sym->section == &bfd_und_section)
3421 info->symbol_scope = SS_UNSAT;
3422 /* Anything else which is not in the common section has scope
3424 else if (sym->section != &bfd_com_section)
3425 info->symbol_scope = SS_LOCAL;
3427 /* Now set the symbol_info field. It has no real meaning
3428 for undefined or common symbols, but the HP linker will
3429 choke if it's not set to some "reasonable" value. We
3430 use zero as a reasonable value. */
3431 if (sym->section == &bfd_com_section || sym->section == &bfd_und_section
3432 || sym->section == &bfd_abs_section)
3433 info->symbol_info = 0;
3434 /* For all other symbols, the symbol_info field contains the
3435 subspace index of the space this symbol is contained in. */
3437 info->symbol_info = sym->section->target_index;
3439 /* Set the symbol's value. */
3440 info->symbol_value = sym->value + sym->section->vma;
3443 /* Build and write, in one big chunk, the entire symbol table for
3447 som_build_and_write_symbol_table (abfd)
3450 unsigned int num_syms = bfd_get_symcount (abfd);
3451 file_ptr symtab_location = obj_som_file_hdr (abfd)->symbol_location;
3452 asymbol **bfd_syms = bfd_get_outsymbols (abfd);
3453 struct symbol_dictionary_record *som_symtab = NULL;
3456 /* Compute total symbol table size and allocate a chunk of memory
3457 to hold the symbol table as we build it. */
3458 symtab_size = num_syms * sizeof (struct symbol_dictionary_record);
3459 som_symtab = (struct symbol_dictionary_record *) malloc (symtab_size);
3460 if (som_symtab == NULL && symtab_size != 0)
3462 bfd_set_error (bfd_error_no_memory);
3465 memset (som_symtab, 0, symtab_size);
3467 /* Walk over each symbol. */
3468 for (i = 0; i < num_syms; i++)
3470 struct som_misc_symbol_info info;
3472 /* This is really an index into the symbol strings table.
3473 By the time we get here, the index has already been
3474 computed and stored into the name field in the BFD symbol. */
3475 som_symtab[i].name.n_strx = (int) bfd_syms[i]->name;
3477 /* Derive SOM information from the BFD symbol. */
3478 som_bfd_derive_misc_symbol_info (abfd, bfd_syms[i], &info);
3481 som_symtab[i].symbol_type = info.symbol_type;
3482 som_symtab[i].symbol_scope = info.symbol_scope;
3483 som_symtab[i].arg_reloc = info.arg_reloc;
3484 som_symtab[i].symbol_info = info.symbol_info;
3485 som_symtab[i].symbol_value = info.symbol_value;
3488 /* Everything is ready, seek to the right location and
3489 scribble out the symbol table. */
3490 if (bfd_seek (abfd, symtab_location, SEEK_SET) != 0)
3493 if (bfd_write ((PTR) som_symtab, symtab_size, 1, abfd) != symtab_size)
3496 if (som_symtab != NULL)
3500 if (som_symtab != NULL)
3505 /* Write an object in SOM format. */
3508 som_write_object_contents (abfd)
3511 if (abfd->output_has_begun == false)
3513 /* Set up fixed parts of the file, space, and subspace headers.
3514 Notify the world that output has begun. */
3515 som_prep_headers (abfd);
3516 abfd->output_has_begun = true;
3517 /* Start writing the object file. This include all the string
3518 tables, fixup streams, and other portions of the object file. */
3519 som_begin_writing (abfd);
3522 /* Now that the symbol table information is complete, build and
3523 write the symbol table. */
3524 if (som_build_and_write_symbol_table (abfd) == false)
3527 /* Compute the checksum for the file header just before writing
3528 the header to disk. */
3529 obj_som_file_hdr (abfd)->checksum = som_compute_checksum (abfd);
3530 return (som_write_headers (abfd));
3534 /* Read and save the string table associated with the given BFD. */
3537 som_slurp_string_table (abfd)
3542 /* Use the saved version if its available. */
3543 if (obj_som_stringtab (abfd) != NULL)
3546 /* I don't think this can currently happen, and I'm not sure it should
3547 really be an error, but it's better than getting unpredictable results
3548 from the host's malloc when passed a size of zero. */
3549 if (obj_som_stringtab_size (abfd) == 0)
3551 bfd_set_error (bfd_error_no_symbols);
3555 /* Allocate and read in the string table. */
3556 stringtab = malloc (obj_som_stringtab_size (abfd));
3557 if (stringtab == NULL)
3559 bfd_set_error (bfd_error_no_memory);
3563 if (bfd_seek (abfd, obj_som_str_filepos (abfd), SEEK_SET) < 0)
3566 if (bfd_read (stringtab, obj_som_stringtab_size (abfd), 1, abfd)
3567 != obj_som_stringtab_size (abfd))
3570 /* Save our results and return success. */
3571 obj_som_stringtab (abfd) = stringtab;
3575 /* Return the amount of data (in bytes) required to hold the symbol
3576 table for this object. */
3579 som_get_symtab_upper_bound (abfd)
3582 if (!som_slurp_symbol_table (abfd))
3585 return (bfd_get_symcount (abfd) + 1) * (sizeof (asymbol *));
3588 /* Convert from a SOM subspace index to a BFD section. */
3591 bfd_section_from_som_symbol (abfd, symbol)
3593 struct symbol_dictionary_record *symbol;
3597 /* The meaning of the symbol_info field changes for functions
3598 within executables. So only use the quick symbol_info mapping for
3599 incomplete objects and non-function symbols in executables. */
3600 if ((abfd->flags & (EXEC_P | DYNAMIC)) == 0
3601 || (symbol->symbol_type != ST_ENTRY
3602 && symbol->symbol_type != ST_PRI_PROG
3603 && symbol->symbol_type != ST_SEC_PROG
3604 && symbol->symbol_type != ST_MILLICODE))
3606 unsigned int index = symbol->symbol_info;
3607 for (section = abfd->sections; section != NULL; section = section->next)
3608 if (section->target_index == index)
3611 /* Should never happen. */
3616 unsigned int value = symbol->symbol_value;
3618 /* For executables we will have to use the symbol's address and
3619 find out what section would contain that address. Yuk. */
3620 for (section = abfd->sections; section; section = section->next)
3622 if (value >= section->vma
3623 && value <= section->vma + section->_cooked_size)
3627 /* Should never happen. */
3632 /* Read and save the symbol table associated with the given BFD. */
3635 som_slurp_symbol_table (abfd)
3638 int symbol_count = bfd_get_symcount (abfd);
3639 int symsize = sizeof (struct symbol_dictionary_record);
3641 struct symbol_dictionary_record *buf = NULL, *bufp, *endbufp;
3642 som_symbol_type *sym, *symbase;
3644 /* Return saved value if it exists. */
3645 if (obj_som_symtab (abfd) != NULL)
3646 goto successful_return;
3648 /* Special case. This is *not* an error. */
3649 if (symbol_count == 0)
3650 goto successful_return;
3652 if (!som_slurp_string_table (abfd))
3655 stringtab = obj_som_stringtab (abfd);
3657 symbase = (som_symbol_type *)
3658 malloc (symbol_count * sizeof (som_symbol_type));
3659 if (symbase == NULL)
3661 bfd_set_error (bfd_error_no_memory);
3665 /* Read in the external SOM representation. */
3666 buf = malloc (symbol_count * symsize);
3667 if (buf == NULL && symbol_count * symsize != 0)
3669 bfd_set_error (bfd_error_no_memory);
3672 if (bfd_seek (abfd, obj_som_sym_filepos (abfd), SEEK_SET) < 0)
3674 if (bfd_read (buf, symbol_count * symsize, 1, abfd)
3675 != symbol_count * symsize)
3678 /* Iterate over all the symbols and internalize them. */
3679 endbufp = buf + symbol_count;
3680 for (bufp = buf, sym = symbase; bufp < endbufp; ++bufp)
3683 /* I don't think we care about these. */
3684 if (bufp->symbol_type == ST_SYM_EXT
3685 || bufp->symbol_type == ST_ARG_EXT)
3688 /* Set some private data we care about. */
3689 if (bufp->symbol_type == ST_NULL)
3690 som_symbol_data (sym)->som_type = SYMBOL_TYPE_UNKNOWN;
3691 else if (bufp->symbol_type == ST_ABSOLUTE)
3692 som_symbol_data (sym)->som_type = SYMBOL_TYPE_ABSOLUTE;
3693 else if (bufp->symbol_type == ST_DATA)
3694 som_symbol_data (sym)->som_type = SYMBOL_TYPE_DATA;
3695 else if (bufp->symbol_type == ST_CODE)
3696 som_symbol_data (sym)->som_type = SYMBOL_TYPE_CODE;
3697 else if (bufp->symbol_type == ST_PRI_PROG)
3698 som_symbol_data (sym)->som_type = SYMBOL_TYPE_PRI_PROG;
3699 else if (bufp->symbol_type == ST_SEC_PROG)
3700 som_symbol_data (sym)->som_type = SYMBOL_TYPE_SEC_PROG;
3701 else if (bufp->symbol_type == ST_ENTRY)
3702 som_symbol_data (sym)->som_type = SYMBOL_TYPE_ENTRY;
3703 else if (bufp->symbol_type == ST_MILLICODE)
3704 som_symbol_data (sym)->som_type = SYMBOL_TYPE_MILLICODE;
3705 else if (bufp->symbol_type == ST_PLABEL)
3706 som_symbol_data (sym)->som_type = SYMBOL_TYPE_PLABEL;
3708 som_symbol_data (sym)->som_type = SYMBOL_TYPE_UNKNOWN;
3709 som_symbol_data (sym)->tc_data.hppa_arg_reloc = bufp->arg_reloc;
3711 /* Some reasonable defaults. */
3712 sym->symbol.the_bfd = abfd;
3713 sym->symbol.name = bufp->name.n_strx + stringtab;
3714 sym->symbol.value = bufp->symbol_value;
3715 sym->symbol.section = 0;
3716 sym->symbol.flags = 0;
3718 switch (bufp->symbol_type)
3724 sym->symbol.flags |= BSF_FUNCTION;
3725 sym->symbol.value &= ~0x3;
3730 sym->symbol.value &= ~0x3;
3736 /* Handle scoping and section information. */
3737 switch (bufp->symbol_scope)
3739 /* symbol_info field is undefined for SS_EXTERNAL and SS_UNSAT symbols,
3740 so the section associated with this symbol can't be known. */
3742 if (bufp->symbol_type != ST_STORAGE)
3743 sym->symbol.section = &bfd_und_section;
3745 sym->symbol.section = &bfd_com_section;
3746 sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL);
3750 if (bufp->symbol_type != ST_STORAGE)
3751 sym->symbol.section = &bfd_und_section;
3753 sym->symbol.section = &bfd_com_section;
3757 sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL);
3758 sym->symbol.section = bfd_section_from_som_symbol (abfd, bufp);
3759 sym->symbol.value -= sym->symbol.section->vma;
3763 /* SS_GLOBAL and SS_LOCAL are two names for the same thing.
3764 Sound dumb? It is. */
3768 sym->symbol.flags |= BSF_LOCAL;
3769 sym->symbol.section = bfd_section_from_som_symbol (abfd, bufp);
3770 sym->symbol.value -= sym->symbol.section->vma;
3774 /* Mark section symbols and symbols used by the debugger. */
3775 if (sym->symbol.name[0] == '$'
3776 && sym->symbol.name[strlen (sym->symbol.name) - 1] == '$')
3777 sym->symbol.flags |= BSF_SECTION_SYM;
3778 else if (!strncmp (sym->symbol.name, "L$0\002", 4))
3780 sym->symbol.flags |= BSF_SECTION_SYM;
3781 sym->symbol.name = sym->symbol.section->name;
3783 else if (!strncmp (sym->symbol.name, "L$0\001", 4))
3784 sym->symbol.flags |= BSF_DEBUGGING;
3786 /* Note increment at bottom of loop, since we skip some symbols
3787 we can not include it as part of the for statement. */
3791 /* Save our results and return success. */
3792 obj_som_symtab (abfd) = symbase;
3804 /* Canonicalize a SOM symbol table. Return the number of entries
3805 in the symbol table. */
3808 som_get_symtab (abfd, location)
3813 som_symbol_type *symbase;
3815 if (!som_slurp_symbol_table (abfd))
3818 i = bfd_get_symcount (abfd);
3819 symbase = obj_som_symtab (abfd);
3821 for (; i > 0; i--, location++, symbase++)
3822 *location = &symbase->symbol;
3824 /* Final null pointer. */
3826 return (bfd_get_symcount (abfd));
3829 /* Make a SOM symbol. There is nothing special to do here. */
3832 som_make_empty_symbol (abfd)
3835 som_symbol_type *new =
3836 (som_symbol_type *) bfd_zalloc (abfd, sizeof (som_symbol_type));
3839 bfd_set_error (bfd_error_no_memory);
3842 new->symbol.the_bfd = abfd;
3844 return &new->symbol;
3847 /* Print symbol information. */
3850 som_print_symbol (ignore_abfd, afile, symbol, how)
3854 bfd_print_symbol_type how;
3856 FILE *file = (FILE *) afile;
3859 case bfd_print_symbol_name:
3860 fprintf (file, "%s", symbol->name);
3862 case bfd_print_symbol_more:
3863 fprintf (file, "som ");
3864 fprintf_vma (file, symbol->value);
3865 fprintf (file, " %lx", (long) symbol->flags);
3867 case bfd_print_symbol_all:
3869 CONST char *section_name;
3870 section_name = symbol->section ? symbol->section->name : "(*none*)";
3871 bfd_print_symbol_vandf ((PTR) file, symbol);
3872 fprintf (file, " %s\t%s", section_name, symbol->name);
3879 som_bfd_is_local_label (abfd, sym)
3883 return (sym->name[0] == 'L' && sym->name[1] == '$');
3886 /* Count or process variable-length SOM fixup records.
3888 To avoid code duplication we use this code both to compute the number
3889 of relocations requested by a stream, and to internalize the stream.
3891 When computing the number of relocations requested by a stream the
3892 variables rptr, section, and symbols have no meaning.
3894 Return the number of relocations requested by the fixup stream. When
3897 This needs at least two or three more passes to get it cleaned up. */
3900 som_set_reloc_info (fixup, end, internal_relocs, section, symbols, just_count)
3901 unsigned char *fixup;
3903 arelent *internal_relocs;
3908 unsigned int op, varname;
3909 unsigned char *end_fixups = &fixup[end];
3910 const struct fixup_format *fp;
3912 unsigned char *save_fixup;
3913 int variables[26], stack[20], c, v, count, prev_fixup, *sp;
3915 arelent *rptr= internal_relocs;
3916 unsigned int offset = just_count ? 0 : section->vma;
3918 #define var(c) variables[(c) - 'A']
3919 #define push(v) (*sp++ = (v))
3920 #define pop() (*--sp)
3921 #define emptystack() (sp == stack)
3923 som_initialize_reloc_queue (reloc_queue);
3924 memset (variables, 0, sizeof (variables));
3925 memset (stack, 0, sizeof (stack));
3930 while (fixup < end_fixups)
3933 /* Save pointer to the start of this fixup. We'll use
3934 it later to determine if it is necessary to put this fixup
3938 /* Get the fixup code and its associated format. */
3940 fp = &som_fixup_formats[op];
3942 /* Handle a request for a previous fixup. */
3943 if (*fp->format == 'P')
3945 /* Get pointer to the beginning of the prev fixup, move
3946 the repeated fixup to the head of the queue. */
3947 fixup = reloc_queue[fp->D].reloc;
3948 som_reloc_queue_fix (reloc_queue, fp->D);
3951 /* Get the fixup code and its associated format. */
3953 fp = &som_fixup_formats[op];
3956 /* If we are not just counting, set some reasonable defaults. */
3959 rptr->address = offset;
3960 rptr->howto = &som_hppa_howto_table[op];
3962 rptr->sym_ptr_ptr = bfd_abs_section.symbol_ptr_ptr;
3965 /* Set default input length to 0. Get the opcode class index
3970 /* Get the opcode format. */
3973 /* Process the format string. Parsing happens in two phases,
3974 parse RHS, then assign to LHS. Repeat until no more
3975 characters in the format string. */
3978 /* The variable this pass is going to compute a value for. */
3981 /* Start processing RHS. Continue until a NULL or '=' is found. */
3986 /* If this is a variable, push it on the stack. */
3990 /* If this is a lower case letter, then it represents
3991 additional data from the fixup stream to be pushed onto
3993 else if (islower (c))
3995 for (v = 0; c > 'a'; --c)
3996 v = (v << 8) | *fixup++;
4000 /* A decimal constant. Push it on the stack. */
4001 else if (isdigit (c))
4004 while (isdigit (*cp))
4005 v = (v * 10) + (*cp++ - '0');
4010 /* An operator. Pop two two values from the stack and
4011 use them as operands to the given operation. Push
4012 the result of the operation back on the stack. */
4034 while (*cp && *cp != '=');
4036 /* Move over the equal operator. */
4039 /* Pop the RHS off the stack. */
4042 /* Perform the assignment. */
4045 /* Handle side effects. and special 'O' stack cases. */
4048 /* Consume some bytes from the input space. */
4052 /* A symbol to use in the relocation. Make a note
4053 of this if we are not just counting. */
4056 rptr->sym_ptr_ptr = &symbols[c];
4058 /* Handle the linker expression stack. */
4063 subop = comp1_opcodes;
4066 subop = comp2_opcodes;
4069 subop = comp3_opcodes;
4074 while (*subop <= (unsigned char) c)
4083 /* If we used a previous fixup, clean up after it. */
4086 fixup = save_fixup + 1;
4090 else if (fixup > save_fixup + 1)
4091 som_reloc_queue_insert (save_fixup, fixup - save_fixup, reloc_queue);
4093 /* We do not pass R_DATA_OVERRIDE or R_NO_RELOCATION
4095 if (som_hppa_howto_table[op].type != R_DATA_OVERRIDE
4096 && som_hppa_howto_table[op].type != R_NO_RELOCATION)
4098 /* Done with a single reloction. Loop back to the top. */
4101 rptr->addend = var ('V');
4105 /* Now that we've handled a "full" relocation, reset
4107 memset (variables, 0, sizeof (variables));
4108 memset (stack, 0, sizeof (stack));
4119 /* Read in the relocs (aka fixups in SOM terms) for a section.
4121 som_get_reloc_upper_bound calls this routine with JUST_COUNT
4122 set to true to indicate it only needs a count of the number
4123 of actual relocations. */
4126 som_slurp_reloc_table (abfd, section, symbols, just_count)
4132 char *external_relocs;
4133 unsigned int fixup_stream_size;
4134 arelent *internal_relocs;
4135 unsigned int num_relocs;
4137 fixup_stream_size = som_section_data (section)->reloc_size;
4138 /* If there were no relocations, then there is nothing to do. */
4139 if (section->reloc_count == 0)
4142 /* If reloc_count is -1, then the relocation stream has not been
4143 parsed. We must do so now to know how many relocations exist. */
4144 if (section->reloc_count == -1)
4146 external_relocs = (char *) malloc (fixup_stream_size);
4147 if (external_relocs == (char *) NULL)
4149 bfd_set_error (bfd_error_no_memory);
4152 /* Read in the external forms. */
4154 obj_som_reloc_filepos (abfd) + section->rel_filepos,
4158 if (bfd_read (external_relocs, 1, fixup_stream_size, abfd)
4159 != fixup_stream_size)
4162 /* Let callers know how many relocations found.
4163 also save the relocation stream as we will
4165 section->reloc_count = som_set_reloc_info (external_relocs,
4167 NULL, NULL, NULL, true);
4169 som_section_data (section)->reloc_stream = external_relocs;
4172 /* If the caller only wanted a count, then return now. */
4176 num_relocs = section->reloc_count;
4177 external_relocs = som_section_data (section)->reloc_stream;
4178 /* Return saved information about the relocations if it is available. */
4179 if (section->relocation != (arelent *) NULL)
4182 internal_relocs = (arelent *) malloc (num_relocs * sizeof (arelent));
4183 if (internal_relocs == (arelent *) NULL)
4185 bfd_set_error (bfd_error_no_memory);
4189 /* Process and internalize the relocations. */
4190 som_set_reloc_info (external_relocs, fixup_stream_size,
4191 internal_relocs, section, symbols, false);
4193 /* Save our results and return success. */
4194 section->relocation = internal_relocs;
4198 /* Return the number of bytes required to store the relocation
4199 information associated with the given section. */
4202 som_get_reloc_upper_bound (abfd, asect)
4206 /* If section has relocations, then read in the relocation stream
4207 and parse it to determine how many relocations exist. */
4208 if (asect->flags & SEC_RELOC)
4210 if (! som_slurp_reloc_table (abfd, asect, NULL, true))
4212 return (asect->reloc_count + 1) * sizeof (arelent);
4214 /* There are no relocations. */
4218 /* Convert relocations from SOM (external) form into BFD internal
4219 form. Return the number of relocations. */
4222 som_canonicalize_reloc (abfd, section, relptr, symbols)
4231 if (som_slurp_reloc_table (abfd, section, symbols, false) == false)
4234 count = section->reloc_count;
4235 tblptr = section->relocation;
4238 *relptr++ = tblptr++;
4240 *relptr = (arelent *) NULL;
4241 return section->reloc_count;
4244 extern bfd_target som_vec;
4246 /* A hook to set up object file dependent section information. */
4249 som_new_section_hook (abfd, newsect)
4253 newsect->used_by_bfd =
4254 (PTR) bfd_zalloc (abfd, sizeof (struct som_section_data_struct));
4255 if (!newsect->used_by_bfd)
4257 bfd_set_error (bfd_error_no_memory);
4260 newsect->alignment_power = 3;
4262 /* We allow more than three sections internally */
4266 /* Copy any private info we understand from the input section
4267 to the output section. */
4269 som_bfd_copy_private_section_data (ibfd, isection, obfd, osection)
4275 /* One day we may try to grok other private data. */
4276 if (ibfd->xvec->flavour != bfd_target_som_flavour
4277 || obfd->xvec->flavour != bfd_target_som_flavour
4278 || (!som_is_space (isection) && !som_is_subspace (isection)))
4281 som_section_data (osection)->copy_data
4282 = (struct som_copyable_section_data_struct *)
4283 bfd_zalloc (obfd, sizeof (struct som_copyable_section_data_struct));
4284 if (som_section_data (osection)->copy_data == NULL)
4286 bfd_set_error (bfd_error_no_memory);
4290 memcpy (som_section_data (osection)->copy_data,
4291 som_section_data (isection)->copy_data,
4292 sizeof (struct som_copyable_section_data_struct));
4294 /* Reparent if necessary. */
4295 if (som_section_data (osection)->copy_data->container)
4296 som_section_data (osection)->copy_data->container =
4297 som_section_data (osection)->copy_data->container->output_section;
4302 /* Copy any private info we understand from the input bfd
4303 to the output bfd. */
4306 som_bfd_copy_private_bfd_data (ibfd, obfd)
4309 /* One day we may try to grok other private data. */
4310 if (ibfd->xvec->flavour != bfd_target_som_flavour
4311 || obfd->xvec->flavour != bfd_target_som_flavour)
4314 /* Allocate some memory to hold the data we need. */
4315 obj_som_exec_data (obfd) = (struct som_exec_data *)
4316 bfd_zalloc (obfd, sizeof (struct som_exec_data));
4317 if (obj_som_exec_data (obfd) == NULL)
4319 bfd_set_error (bfd_error_no_memory);
4323 /* Now copy the data. */
4324 memcpy (obj_som_exec_data (obfd), obj_som_exec_data (ibfd),
4325 sizeof (struct som_exec_data));
4330 /* Set backend info for sections which can not be described
4331 in the BFD data structures. */
4334 bfd_som_set_section_attributes (section, defined, private, sort_key, spnum)
4338 unsigned int sort_key;
4341 /* Allocate memory to hold the magic information. */
4342 if (som_section_data (section)->copy_data == NULL)
4344 som_section_data (section)->copy_data
4345 = (struct som_copyable_section_data_struct *)
4346 bfd_zalloc (section->owner,
4347 sizeof (struct som_copyable_section_data_struct));
4348 if (som_section_data (section)->copy_data == NULL)
4350 bfd_set_error (bfd_error_no_memory);
4354 som_section_data (section)->copy_data->sort_key = sort_key;
4355 som_section_data (section)->copy_data->is_defined = defined;
4356 som_section_data (section)->copy_data->is_private = private;
4357 som_section_data (section)->copy_data->container = section;
4358 som_section_data (section)->copy_data->space_number = spnum;
4362 /* Set backend info for subsections which can not be described
4363 in the BFD data structures. */
4366 bfd_som_set_subsection_attributes (section, container, access,
4369 asection *container;
4371 unsigned int sort_key;
4374 /* Allocate memory to hold the magic information. */
4375 if (som_section_data (section)->copy_data == NULL)
4377 som_section_data (section)->copy_data
4378 = (struct som_copyable_section_data_struct *)
4379 bfd_zalloc (section->owner,
4380 sizeof (struct som_copyable_section_data_struct));
4381 if (som_section_data (section)->copy_data == NULL)
4383 bfd_set_error (bfd_error_no_memory);
4387 som_section_data (section)->copy_data->sort_key = sort_key;
4388 som_section_data (section)->copy_data->access_control_bits = access;
4389 som_section_data (section)->copy_data->quadrant = quadrant;
4390 som_section_data (section)->copy_data->container = container;
4394 /* Set the full SOM symbol type. SOM needs far more symbol information
4395 than any other object file format I'm aware of. It is mandatory
4396 to be able to know if a symbol is an entry point, millicode, data,
4397 code, absolute, storage request, or procedure label. If you get
4398 the symbol type wrong your program will not link. */
4401 bfd_som_set_symbol_type (symbol, type)
4405 som_symbol_data (symbol)->som_type = type;
4408 /* Attach 64bits of unwind information to a symbol (which hopefully
4409 is a function of some kind!). It would be better to keep this
4410 in the R_ENTRY relocation, but there is not enough space. */
4413 bfd_som_attach_unwind_info (symbol, unwind_desc)
4417 som_symbol_data (symbol)->unwind = unwind_desc;
4420 /* Attach an auxiliary header to the BFD backend so that it may be
4421 written into the object file. */
4423 bfd_som_attach_aux_hdr (abfd, type, string)
4428 if (type == VERSION_AUX_ID)
4430 int len = strlen (string);
4434 pad = (4 - (len % 4));
4435 obj_som_version_hdr (abfd) = (struct user_string_aux_hdr *)
4436 bfd_zalloc (abfd, sizeof (struct aux_id)
4437 + sizeof (unsigned int) + len + pad);
4438 if (!obj_som_version_hdr (abfd))
4440 bfd_set_error (bfd_error_no_memory);
4443 obj_som_version_hdr (abfd)->header_id.type = VERSION_AUX_ID;
4444 obj_som_version_hdr (abfd)->header_id.length = len + pad;
4445 obj_som_version_hdr (abfd)->header_id.length += sizeof (int);
4446 obj_som_version_hdr (abfd)->string_length = len;
4447 strncpy (obj_som_version_hdr (abfd)->user_string, string, len);
4449 else if (type == COPYRIGHT_AUX_ID)
4451 int len = strlen (string);
4455 pad = (4 - (len % 4));
4456 obj_som_copyright_hdr (abfd) = (struct copyright_aux_hdr *)
4457 bfd_zalloc (abfd, sizeof (struct aux_id)
4458 + sizeof (unsigned int) + len + pad);
4459 if (!obj_som_copyright_hdr (abfd))
4461 bfd_set_error (bfd_error_no_memory);
4464 obj_som_copyright_hdr (abfd)->header_id.type = COPYRIGHT_AUX_ID;
4465 obj_som_copyright_hdr (abfd)->header_id.length = len + pad;
4466 obj_som_copyright_hdr (abfd)->header_id.length += sizeof (int);
4467 obj_som_copyright_hdr (abfd)->string_length = len;
4468 strcpy (obj_som_copyright_hdr (abfd)->copyright, string);
4474 som_get_section_contents (abfd, section, location, offset, count)
4479 bfd_size_type count;
4481 if (count == 0 || ((section->flags & (SEC_LOAD | SEC_DEBUGGING)) == 0))
4483 if ((bfd_size_type)(offset+count) > section->_raw_size
4484 || bfd_seek (abfd, (file_ptr)(section->filepos + offset), SEEK_SET) == -1
4485 || bfd_read (location, (bfd_size_type)1, count, abfd) != count)
4486 return (false); /* on error */
4491 som_set_section_contents (abfd, section, location, offset, count)
4496 bfd_size_type count;
4498 if (abfd->output_has_begun == false)
4500 /* Set up fixed parts of the file, space, and subspace headers.
4501 Notify the world that output has begun. */
4502 som_prep_headers (abfd);
4503 abfd->output_has_begun = true;
4504 /* Start writing the object file. This include all the string
4505 tables, fixup streams, and other portions of the object file. */
4506 som_begin_writing (abfd);
4509 /* Only write subspaces which have "real" contents (eg. the contents
4510 are not generated at run time by the OS). */
4511 if (!som_is_subspace (section)
4512 || ((section->flags & (SEC_LOAD | SEC_DEBUGGING)) == 0))
4515 /* Seek to the proper offset within the object file and write the
4517 offset += som_section_data (section)->subspace_dict->file_loc_init_value;
4518 if (bfd_seek (abfd, offset, SEEK_SET) == -1)
4521 if (bfd_write ((PTR) location, 1, count, abfd) != count)
4527 som_set_arch_mach (abfd, arch, machine)
4529 enum bfd_architecture arch;
4530 unsigned long machine;
4532 /* Allow any architecture to be supported by the SOM backend */
4533 return bfd_default_set_arch_mach (abfd, arch, machine);
4537 som_find_nearest_line (abfd, section, symbols, offset, filename_ptr,
4538 functionname_ptr, line_ptr)
4543 CONST char **filename_ptr;
4544 CONST char **functionname_ptr;
4545 unsigned int *line_ptr;
4547 fprintf (stderr, "som_find_nearest_line unimplemented\n");
4554 som_sizeof_headers (abfd, reloc)
4558 fprintf (stderr, "som_sizeof_headers unimplemented\n");
4564 /* Return the single-character symbol type corresponding to
4565 SOM section S, or '?' for an unknown SOM section. */
4568 som_section_type (s)
4571 const struct section_to_type *t;
4573 for (t = &stt[0]; t->section; t++)
4574 if (!strcmp (s, t->section))
4580 som_decode_symclass (symbol)
4585 if (bfd_is_com_section (symbol->section))
4587 if (symbol->section == &bfd_und_section)
4589 if (symbol->section == &bfd_ind_section)
4591 if (!(symbol->flags & (BSF_GLOBAL|BSF_LOCAL)))
4594 if (symbol->section == &bfd_abs_section)
4596 else if (symbol->section)
4597 c = som_section_type (symbol->section->name);
4600 if (symbol->flags & BSF_GLOBAL)
4605 /* Return information about SOM symbol SYMBOL in RET. */
4608 som_get_symbol_info (ignore_abfd, symbol, ret)
4613 ret->type = som_decode_symclass (symbol);
4614 if (ret->type != 'U')
4615 ret->value = symbol->value+symbol->section->vma;
4618 ret->name = symbol->name;
4621 /* Count the number of symbols in the archive symbol table. Necessary
4622 so that we can allocate space for all the carsyms at once. */
4625 som_bfd_count_ar_symbols (abfd, lst_header, count)
4627 struct lst_header *lst_header;
4631 unsigned int *hash_table = NULL;
4632 file_ptr lst_filepos = bfd_tell (abfd) - sizeof (struct lst_header);
4635 (unsigned int *) malloc (lst_header->hash_size * sizeof (unsigned int));
4636 if (hash_table == NULL && lst_header->hash_size != 0)
4638 bfd_set_error (bfd_error_no_memory);
4642 /* Don't forget to initialize the counter! */
4645 /* Read in the hash table. The has table is an array of 32bit file offsets
4646 which point to the hash chains. */
4647 if (bfd_read ((PTR) hash_table, lst_header->hash_size, 4, abfd)
4648 != lst_header->hash_size * 4)
4651 /* Walk each chain counting the number of symbols found on that particular
4653 for (i = 0; i < lst_header->hash_size; i++)
4655 struct lst_symbol_record lst_symbol;
4657 /* An empty chain has zero as it's file offset. */
4658 if (hash_table[i] == 0)
4661 /* Seek to the first symbol in this hash chain. */
4662 if (bfd_seek (abfd, lst_filepos + hash_table[i], SEEK_SET) < 0)
4665 /* Read in this symbol and update the counter. */
4666 if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd)
4667 != sizeof (lst_symbol))
4672 /* Now iterate through the rest of the symbols on this chain. */
4673 while (lst_symbol.next_entry)
4676 /* Seek to the next symbol. */
4677 if (bfd_seek (abfd, lst_filepos + lst_symbol.next_entry, SEEK_SET)
4681 /* Read the symbol in and update the counter. */
4682 if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd)
4683 != sizeof (lst_symbol))
4689 if (hash_table != NULL)
4694 if (hash_table != NULL)
4699 /* Fill in the canonical archive symbols (SYMS) from the archive described
4700 by ABFD and LST_HEADER. */
4703 som_bfd_fill_in_ar_symbols (abfd, lst_header, syms)
4705 struct lst_header *lst_header;
4708 unsigned int i, len;
4709 carsym *set = syms[0];
4710 unsigned int *hash_table = NULL;
4711 struct som_entry *som_dict = NULL;
4712 file_ptr lst_filepos = bfd_tell (abfd) - sizeof (struct lst_header);
4715 (unsigned int *) malloc (lst_header->hash_size * sizeof (unsigned int));
4716 if (hash_table == NULL && lst_header->hash_size != 0)
4718 bfd_set_error (bfd_error_no_memory);
4723 (struct som_entry *) malloc (lst_header->module_count
4724 * sizeof (struct som_entry));
4725 if (som_dict == NULL && lst_header->module_count != 0)
4727 bfd_set_error (bfd_error_no_memory);
4731 /* Read in the hash table. The has table is an array of 32bit file offsets
4732 which point to the hash chains. */
4733 if (bfd_read ((PTR) hash_table, lst_header->hash_size, 4, abfd)
4734 != lst_header->hash_size * 4)
4737 /* Seek to and read in the SOM dictionary. We will need this to fill
4738 in the carsym's filepos field. */
4739 if (bfd_seek (abfd, lst_filepos + lst_header->dir_loc, SEEK_SET) < 0)
4742 if (bfd_read ((PTR) som_dict, lst_header->module_count,
4743 sizeof (struct som_entry), abfd)
4744 != lst_header->module_count * sizeof (struct som_entry))
4747 /* Walk each chain filling in the carsyms as we go along. */
4748 for (i = 0; i < lst_header->hash_size; i++)
4750 struct lst_symbol_record lst_symbol;
4752 /* An empty chain has zero as it's file offset. */
4753 if (hash_table[i] == 0)
4756 /* Seek to and read the first symbol on the chain. */
4757 if (bfd_seek (abfd, lst_filepos + hash_table[i], SEEK_SET) < 0)
4760 if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd)
4761 != sizeof (lst_symbol))
4764 /* Get the name of the symbol, first get the length which is stored
4765 as a 32bit integer just before the symbol.
4767 One might ask why we don't just read in the entire string table
4768 and index into it. Well, according to the SOM ABI the string
4769 index can point *anywhere* in the archive to save space, so just
4770 using the string table would not be safe. */
4771 if (bfd_seek (abfd, lst_filepos + lst_header->string_loc
4772 + lst_symbol.name.n_strx - 4, SEEK_SET) < 0)
4775 if (bfd_read (&len, 1, 4, abfd) != 4)
4778 /* Allocate space for the name and null terminate it too. */
4779 set->name = bfd_zalloc (abfd, len + 1);
4782 bfd_set_error (bfd_error_no_memory);
4785 if (bfd_read (set->name, 1, len, abfd) != len)
4790 /* Fill in the file offset. Note that the "location" field points
4791 to the SOM itself, not the ar_hdr in front of it. */
4792 set->file_offset = som_dict[lst_symbol.som_index].location
4793 - sizeof (struct ar_hdr);
4795 /* Go to the next symbol. */
4798 /* Iterate through the rest of the chain. */
4799 while (lst_symbol.next_entry)
4801 /* Seek to the next symbol and read it in. */
4802 if (bfd_seek (abfd, lst_filepos + lst_symbol.next_entry, SEEK_SET) <0)
4805 if (bfd_read ((PTR) & lst_symbol, 1, sizeof (lst_symbol), abfd)
4806 != sizeof (lst_symbol))
4809 /* Seek to the name length & string and read them in. */
4810 if (bfd_seek (abfd, lst_filepos + lst_header->string_loc
4811 + lst_symbol.name.n_strx - 4, SEEK_SET) < 0)
4814 if (bfd_read (&len, 1, 4, abfd) != 4)
4817 /* Allocate space for the name and null terminate it too. */
4818 set->name = bfd_zalloc (abfd, len + 1);
4821 bfd_set_error (bfd_error_no_memory);
4825 if (bfd_read (set->name, 1, len, abfd) != len)
4829 /* Fill in the file offset. Note that the "location" field points
4830 to the SOM itself, not the ar_hdr in front of it. */
4831 set->file_offset = som_dict[lst_symbol.som_index].location
4832 - sizeof (struct ar_hdr);
4834 /* Go on to the next symbol. */
4838 /* If we haven't died by now, then we successfully read the entire
4839 archive symbol table. */
4840 if (hash_table != NULL)
4842 if (som_dict != NULL)
4847 if (hash_table != NULL)
4849 if (som_dict != NULL)
4854 /* Read in the LST from the archive. */
4856 som_slurp_armap (abfd)
4859 struct lst_header lst_header;
4860 struct ar_hdr ar_header;
4861 unsigned int parsed_size;
4862 struct artdata *ardata = bfd_ardata (abfd);
4864 int i = bfd_read ((PTR) nextname, 1, 16, abfd);
4866 /* Special cases. */
4872 if (bfd_seek (abfd, (file_ptr) - 16, SEEK_CUR) < 0)
4875 /* For archives without .o files there is no symbol table. */
4876 if (strncmp (nextname, "/ ", 16))
4878 bfd_has_map (abfd) = false;
4882 /* Read in and sanity check the archive header. */
4883 if (bfd_read ((PTR) &ar_header, 1, sizeof (struct ar_hdr), abfd)
4884 != sizeof (struct ar_hdr))
4887 if (strncmp (ar_header.ar_fmag, ARFMAG, 2))
4889 bfd_set_error (bfd_error_malformed_archive);
4893 /* How big is the archive symbol table entry? */
4895 parsed_size = strtol (ar_header.ar_size, NULL, 10);
4898 bfd_set_error (bfd_error_malformed_archive);
4902 /* Save off the file offset of the first real user data. */
4903 ardata->first_file_filepos = bfd_tell (abfd) + parsed_size;
4905 /* Read in the library symbol table. We'll make heavy use of this
4906 in just a minute. */
4907 if (bfd_read ((PTR) & lst_header, 1, sizeof (struct lst_header), abfd)
4908 != sizeof (struct lst_header))
4912 if (lst_header.a_magic != LIBMAGIC)
4914 bfd_set_error (bfd_error_malformed_archive);
4918 /* Count the number of symbols in the library symbol table. */
4919 if (som_bfd_count_ar_symbols (abfd, &lst_header, &ardata->symdef_count)
4923 /* Get back to the start of the library symbol table. */
4924 if (bfd_seek (abfd, ardata->first_file_filepos - parsed_size
4925 + sizeof (struct lst_header), SEEK_SET) < 0)
4928 /* Initializae the cache and allocate space for the library symbols. */
4930 ardata->symdefs = (carsym *) bfd_alloc (abfd,
4931 (ardata->symdef_count
4932 * sizeof (carsym)));
4933 if (!ardata->symdefs)
4935 bfd_set_error (bfd_error_no_memory);
4939 /* Now fill in the canonical archive symbols. */
4940 if (som_bfd_fill_in_ar_symbols (abfd, &lst_header, &ardata->symdefs)
4944 /* Seek back to the "first" file in the archive. Note the "first"
4945 file may be the extended name table. */
4946 if (bfd_seek (abfd, ardata->first_file_filepos, SEEK_SET) < 0)
4949 /* Notify the generic archive code that we have a symbol map. */
4950 bfd_has_map (abfd) = true;
4954 /* Begin preparing to write a SOM library symbol table.
4956 As part of the prep work we need to determine the number of symbols
4957 and the size of the associated string section. */
4960 som_bfd_prep_for_ar_write (abfd, num_syms, stringsize)
4962 unsigned int *num_syms, *stringsize;
4964 bfd *curr_bfd = abfd->archive_head;
4966 /* Some initialization. */
4970 /* Iterate over each BFD within this archive. */
4971 while (curr_bfd != NULL)
4973 unsigned int curr_count, i;
4974 som_symbol_type *sym;
4976 /* Don't bother for non-SOM objects. */
4977 if (curr_bfd->format != bfd_object
4978 || curr_bfd->xvec->flavour != bfd_target_som_flavour)
4980 curr_bfd = curr_bfd->next;
4984 /* Make sure the symbol table has been read, then snag a pointer
4985 to it. It's a little slimey to grab the symbols via obj_som_symtab,
4986 but doing so avoids allocating lots of extra memory. */
4987 if (som_slurp_symbol_table (curr_bfd) == false)
4990 sym = obj_som_symtab (curr_bfd);
4991 curr_count = bfd_get_symcount (curr_bfd);
4993 /* Examine each symbol to determine if it belongs in the
4994 library symbol table. */
4995 for (i = 0; i < curr_count; i++, sym++)
4997 struct som_misc_symbol_info info;
4999 /* Derive SOM information from the BFD symbol. */
5000 som_bfd_derive_misc_symbol_info (curr_bfd, &sym->symbol, &info);
5002 /* Should we include this symbol? */
5003 if (info.symbol_type == ST_NULL
5004 || info.symbol_type == ST_SYM_EXT
5005 || info.symbol_type == ST_ARG_EXT)
5008 /* Only global symbols and unsatisfied commons. */
5009 if (info.symbol_scope != SS_UNIVERSAL
5010 && info.symbol_type != ST_STORAGE)
5013 /* Do no include undefined symbols. */
5014 if (sym->symbol.section == &bfd_und_section)
5017 /* Bump the various counters, being careful to honor
5018 alignment considerations in the string table. */
5020 *stringsize = *stringsize + strlen (sym->symbol.name) + 5;
5021 while (*stringsize % 4)
5025 curr_bfd = curr_bfd->next;
5030 /* Hash a symbol name based on the hashing algorithm presented in the
5033 som_bfd_ar_symbol_hash (symbol)
5036 unsigned int len = strlen (symbol->name);
5038 /* Names with length 1 are special. */
5040 return 0x1000100 | (symbol->name[0] << 16) | symbol->name[0];
5042 return ((len & 0x7f) << 24) | (symbol->name[1] << 16)
5043 | (symbol->name[len-2] << 8) | symbol->name[len-1];
5050 CONST char *filename = strrchr (file, '/');
5052 if (filename != NULL)
5059 /* Do the bulk of the work required to write the SOM library
5063 som_bfd_ar_write_symbol_stuff (abfd, nsyms, string_size, lst)
5065 unsigned int nsyms, string_size;
5066 struct lst_header lst;
5068 file_ptr lst_filepos;
5069 char *strings = NULL, *p;
5070 struct lst_symbol_record *lst_syms = NULL, *curr_lst_sym;
5072 unsigned int *hash_table = NULL;
5073 struct som_entry *som_dict = NULL;
5074 struct lst_symbol_record **last_hash_entry = NULL;
5075 unsigned int curr_som_offset, som_index, extended_name_length = 0;
5076 unsigned int maxname = abfd->xvec->ar_max_namelen;
5079 (unsigned int *) malloc (lst.hash_size * sizeof (unsigned int));
5080 if (hash_table == NULL && lst.hash_size != 0)
5082 bfd_set_error (bfd_error_no_memory);
5086 (struct som_entry *) malloc (lst.module_count
5087 * sizeof (struct som_entry));
5088 if (som_dict == NULL && lst.module_count != 0)
5090 bfd_set_error (bfd_error_no_memory);
5095 ((struct lst_symbol_record **)
5096 malloc (lst.hash_size * sizeof (struct lst_symbol_record *)));
5097 if (last_hash_entry == NULL && lst.hash_size != 0)
5099 bfd_set_error (bfd_error_no_memory);
5103 /* Lots of fields are file positions relative to the start
5104 of the lst record. So save its location. */
5105 lst_filepos = bfd_tell (abfd) - sizeof (struct lst_header);
5107 /* Some initialization. */
5108 memset (hash_table, 0, 4 * lst.hash_size);
5109 memset (som_dict, 0, lst.module_count * sizeof (struct som_entry));
5110 memset (last_hash_entry, 0,
5111 lst.hash_size * sizeof (struct lst_symbol_record *));
5113 /* Symbols have som_index fields, so we have to keep track of the
5114 index of each SOM in the archive.
5116 The SOM dictionary has (among other things) the absolute file
5117 position for the SOM which a particular dictionary entry
5118 describes. We have to compute that information as we iterate
5119 through the SOMs/symbols. */
5121 curr_som_offset = 8 + 2 * sizeof (struct ar_hdr) + lst.file_end;
5123 /* Yow! We have to know the size of the extended name table
5125 for (curr_bfd = abfd->archive_head;
5127 curr_bfd = curr_bfd->next)
5129 CONST char *normal = normalize (curr_bfd->filename);
5130 unsigned int thislen;
5134 bfd_set_error (bfd_error_no_memory);
5137 thislen = strlen (normal);
5138 if (thislen > maxname)
5139 extended_name_length += thislen + 1;
5142 /* Make room for the archive header and the contents of the
5143 extended string table. */
5144 if (extended_name_length)
5145 curr_som_offset += extended_name_length + sizeof (struct ar_hdr);
5147 /* Make sure we're properly aligned. */
5148 curr_som_offset = (curr_som_offset + 0x1) & ~0x1;
5150 /* FIXME should be done with buffers just like everything else... */
5151 lst_syms = malloc (nsyms * sizeof (struct lst_symbol_record));
5152 if (lst_syms == NULL && nsyms != 0)
5154 bfd_set_error (bfd_error_no_memory);
5157 strings = malloc (string_size);
5158 if (strings == NULL && string_size != 0)
5160 bfd_set_error (bfd_error_no_memory);
5165 curr_lst_sym = lst_syms;
5167 curr_bfd = abfd->archive_head;
5168 while (curr_bfd != NULL)
5170 unsigned int curr_count, i;
5171 som_symbol_type *sym;
5173 /* Don't bother for non-SOM objects. */
5174 if (curr_bfd->format != bfd_object
5175 || curr_bfd->xvec->flavour != bfd_target_som_flavour)
5177 curr_bfd = curr_bfd->next;
5181 /* Make sure the symbol table has been read, then snag a pointer
5182 to it. It's a little slimey to grab the symbols via obj_som_symtab,
5183 but doing so avoids allocating lots of extra memory. */
5184 if (som_slurp_symbol_table (curr_bfd) == false)
5187 sym = obj_som_symtab (curr_bfd);
5188 curr_count = bfd_get_symcount (curr_bfd);
5190 for (i = 0; i < curr_count; i++, sym++)
5192 struct som_misc_symbol_info info;
5194 /* Derive SOM information from the BFD symbol. */
5195 som_bfd_derive_misc_symbol_info (curr_bfd, &sym->symbol, &info);
5197 /* Should we include this symbol? */
5198 if (info.symbol_type == ST_NULL
5199 || info.symbol_type == ST_SYM_EXT
5200 || info.symbol_type == ST_ARG_EXT)
5203 /* Only global symbols and unsatisfied commons. */
5204 if (info.symbol_scope != SS_UNIVERSAL
5205 && info.symbol_type != ST_STORAGE)
5208 /* Do no include undefined symbols. */
5209 if (sym->symbol.section == &bfd_und_section)
5212 /* If this is the first symbol from this SOM, then update
5213 the SOM dictionary too. */
5214 if (som_dict[som_index].location == 0)
5216 som_dict[som_index].location = curr_som_offset;
5217 som_dict[som_index].length = arelt_size (curr_bfd);
5220 /* Fill in the lst symbol record. */
5221 curr_lst_sym->hidden = 0;
5222 curr_lst_sym->secondary_def = 0;
5223 curr_lst_sym->symbol_type = info.symbol_type;
5224 curr_lst_sym->symbol_scope = info.symbol_scope;
5225 curr_lst_sym->check_level = 0;
5226 curr_lst_sym->must_qualify = 0;
5227 curr_lst_sym->initially_frozen = 0;
5228 curr_lst_sym->memory_resident = 0;
5229 curr_lst_sym->is_common = (sym->symbol.section == &bfd_com_section);
5230 curr_lst_sym->dup_common = 0;
5231 curr_lst_sym->xleast = 0;
5232 curr_lst_sym->arg_reloc = info.arg_reloc;
5233 curr_lst_sym->name.n_strx = p - strings + 4;
5234 curr_lst_sym->qualifier_name.n_strx = 0;
5235 curr_lst_sym->symbol_info = info.symbol_info;
5236 curr_lst_sym->symbol_value = info.symbol_value;
5237 curr_lst_sym->symbol_descriptor = 0;
5238 curr_lst_sym->reserved = 0;
5239 curr_lst_sym->som_index = som_index;
5240 curr_lst_sym->symbol_key = som_bfd_ar_symbol_hash (&sym->symbol);
5241 curr_lst_sym->next_entry = 0;
5243 /* Insert into the hash table. */
5244 if (hash_table[curr_lst_sym->symbol_key % lst.hash_size])
5246 struct lst_symbol_record *tmp;
5248 /* There is already something at the head of this hash chain,
5249 so tack this symbol onto the end of the chain. */
5250 tmp = last_hash_entry[curr_lst_sym->symbol_key % lst.hash_size];
5252 = (curr_lst_sym - lst_syms) * sizeof (struct lst_symbol_record)
5254 + lst.module_count * sizeof (struct som_entry)
5255 + sizeof (struct lst_header);
5259 /* First entry in this hash chain. */
5260 hash_table[curr_lst_sym->symbol_key % lst.hash_size]
5261 = (curr_lst_sym - lst_syms) * sizeof (struct lst_symbol_record)
5263 + lst.module_count * sizeof (struct som_entry)
5264 + sizeof (struct lst_header);
5267 /* Keep track of the last symbol we added to this chain so we can
5268 easily update its next_entry pointer. */
5269 last_hash_entry[curr_lst_sym->symbol_key % lst.hash_size]
5273 /* Update the string table. */
5274 bfd_put_32 (abfd, strlen (sym->symbol.name), p);
5276 strcpy (p, sym->symbol.name);
5277 p += strlen (sym->symbol.name) + 1;
5280 bfd_put_8 (abfd, 0, p);
5284 /* Head to the next symbol. */
5288 /* Keep track of where each SOM will finally reside; then look
5290 curr_som_offset += arelt_size (curr_bfd) + sizeof (struct ar_hdr);
5291 curr_bfd = curr_bfd->next;
5295 /* Now scribble out the hash table. */
5296 if (bfd_write ((PTR) hash_table, lst.hash_size, 4, abfd)
5297 != lst.hash_size * 4)
5300 /* Then the SOM dictionary. */
5301 if (bfd_write ((PTR) som_dict, lst.module_count,
5302 sizeof (struct som_entry), abfd)
5303 != lst.module_count * sizeof (struct som_entry))
5306 /* The library symbols. */
5307 if (bfd_write ((PTR) lst_syms, nsyms, sizeof (struct lst_symbol_record), abfd)
5308 != nsyms * sizeof (struct lst_symbol_record))
5311 /* And finally the strings. */
5312 if (bfd_write ((PTR) strings, string_size, 1, abfd) != string_size)
5315 if (hash_table != NULL)
5317 if (som_dict != NULL)
5319 if (last_hash_entry != NULL)
5320 free (last_hash_entry);
5321 if (lst_syms != NULL)
5323 if (strings != NULL)
5328 if (hash_table != NULL)
5330 if (som_dict != NULL)
5332 if (last_hash_entry != NULL)
5333 free (last_hash_entry);
5334 if (lst_syms != NULL)
5336 if (strings != NULL)
5342 /* Write out the LST for the archive.
5344 You'll never believe this is really how armaps are handled in SOM... */
5348 som_write_armap (abfd, elength, map, orl_count, stridx)
5350 unsigned int elength;
5352 unsigned int orl_count;
5356 struct stat statbuf;
5357 unsigned int i, lst_size, nsyms, stringsize;
5359 struct lst_header lst;
5362 /* We'll use this for the archive's date and mode later. */
5363 if (stat (abfd->filename, &statbuf) != 0)
5365 bfd_set_error (bfd_error_system_call);
5369 bfd_ardata (abfd)->armap_timestamp = statbuf.st_mtime + 60;
5371 /* Account for the lst header first. */
5372 lst_size = sizeof (struct lst_header);
5374 /* Start building the LST header. */
5375 lst.system_id = HP9000S800_ID;
5376 lst.a_magic = LIBMAGIC;
5377 lst.version_id = VERSION_ID;
5378 lst.file_time.secs = 0;
5379 lst.file_time.nanosecs = 0;
5381 lst.hash_loc = lst_size;
5382 lst.hash_size = SOM_LST_HASH_SIZE;
5384 /* Hash table is a SOM_LST_HASH_SIZE 32bit offsets. */
5385 lst_size += 4 * SOM_LST_HASH_SIZE;
5387 /* We need to count the number of SOMs in this archive. */
5388 curr_bfd = abfd->archive_head;
5389 lst.module_count = 0;
5390 while (curr_bfd != NULL)
5392 /* Only true SOM objects count. */
5393 if (curr_bfd->format == bfd_object
5394 && curr_bfd->xvec->flavour == bfd_target_som_flavour)
5396 curr_bfd = curr_bfd->next;
5398 lst.module_limit = lst.module_count;
5399 lst.dir_loc = lst_size;
5400 lst_size += sizeof (struct som_entry) * lst.module_count;
5402 /* We don't support import/export tables, auxiliary headers,
5403 or free lists yet. Make the linker work a little harder
5404 to make our life easier. */
5407 lst.export_count = 0;
5412 /* Count how many symbols we will have on the hash chains and the
5413 size of the associated string table. */
5414 if (som_bfd_prep_for_ar_write (abfd, &nsyms, &stringsize) == false)
5417 lst_size += sizeof (struct lst_symbol_record) * nsyms;
5419 /* For the string table. One day we might actually use this info
5420 to avoid small seeks/reads when reading archives. */
5421 lst.string_loc = lst_size;
5422 lst.string_size = stringsize;
5423 lst_size += stringsize;
5425 /* SOM ABI says this must be zero. */
5427 lst.file_end = lst_size;
5429 /* Compute the checksum. Must happen after the entire lst header
5433 for (i = 0; i < sizeof (struct lst_header)/sizeof (int) - 1; i++)
5434 lst.checksum ^= *p++;
5436 sprintf (hdr.ar_name, "/ ");
5437 sprintf (hdr.ar_date, "%ld", bfd_ardata (abfd)->armap_timestamp);
5438 sprintf (hdr.ar_uid, "%ld", (long) getuid ());
5439 sprintf (hdr.ar_gid, "%ld", (long) getgid ());
5440 sprintf (hdr.ar_mode, "%-8o", (unsigned int) statbuf.st_mode);
5441 sprintf (hdr.ar_size, "%-10d", (int) lst_size);
5442 hdr.ar_fmag[0] = '`';
5443 hdr.ar_fmag[1] = '\012';
5445 /* Turn any nulls into spaces. */
5446 for (i = 0; i < sizeof (struct ar_hdr); i++)
5447 if (((char *) (&hdr))[i] == '\0')
5448 (((char *) (&hdr))[i]) = ' ';
5450 /* Scribble out the ar header. */
5451 if (bfd_write ((PTR) &hdr, 1, sizeof (struct ar_hdr), abfd)
5452 != sizeof (struct ar_hdr))
5455 /* Now scribble out the lst header. */
5456 if (bfd_write ((PTR) &lst, 1, sizeof (struct lst_header), abfd)
5457 != sizeof (struct lst_header))
5460 /* Build and write the armap. */
5461 if (som_bfd_ar_write_symbol_stuff (abfd, nsyms, stringsize, lst) == false)
5468 /* Free all information we have cached for this BFD. We can always
5469 read it again later if we need it. */
5472 som_bfd_free_cached_info (abfd)
5477 if (bfd_get_format (abfd) != bfd_object)
5480 #define FREE(x) if (x != NULL) { free (x); x = NULL; }
5481 /* Free the native string and symbol tables. */
5482 FREE (obj_som_symtab (abfd));
5483 FREE (obj_som_stringtab (abfd));
5484 for (o = abfd->sections; o != (asection *) NULL; o = o->next)
5486 /* Free the native relocations. */
5487 o->reloc_count = -1;
5488 FREE (som_section_data (o)->reloc_stream);
5489 /* Free the generic relocations. */
5490 FREE (o->relocation);
5497 /* End of miscellaneous support functions. */
5499 #define som_close_and_cleanup som_bfd_free_cached_info
5501 #define som_openr_next_archived_file bfd_generic_openr_next_archived_file
5502 #define som_generic_stat_arch_elt bfd_generic_stat_arch_elt
5503 #define som_truncate_arname bfd_bsd_truncate_arname
5504 #define som_slurp_extended_name_table _bfd_slurp_extended_name_table
5506 #define som_get_lineno _bfd_nosymbols_get_lineno
5507 #define som_bfd_make_debug_symbol _bfd_nosymbols_bfd_make_debug_symbol
5509 #define som_bfd_get_relocated_section_contents \
5510 bfd_generic_get_relocated_section_contents
5511 #define som_bfd_relax_section bfd_generic_relax_section
5512 #define som_bfd_link_hash_table_create _bfd_generic_link_hash_table_create
5513 #define som_bfd_link_add_symbols _bfd_generic_link_add_symbols
5514 #define som_bfd_final_link _bfd_generic_final_link
5516 bfd_target som_vec =
5519 bfd_target_som_flavour,
5520 true, /* target byte order */
5521 true, /* target headers byte order */
5522 (HAS_RELOC | EXEC_P | /* object flags */
5523 HAS_LINENO | HAS_DEBUG |
5524 HAS_SYMS | HAS_LOCALS | WP_TEXT | D_PAGED | DYNAMIC),
5525 (SEC_CODE | SEC_DATA | SEC_ROM | SEC_HAS_CONTENTS
5526 | SEC_ALLOC | SEC_LOAD | SEC_RELOC), /* section flags */
5528 /* leading_symbol_char: is the first char of a user symbol
5529 predictable, and if so what is it */
5531 '/', /* ar_pad_char */
5532 14, /* ar_max_namelen */
5533 3, /* minimum alignment */
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, /* data */
5537 bfd_getb64, bfd_getb_signed_64, bfd_putb64,
5538 bfd_getb32, bfd_getb_signed_32, bfd_putb32,
5539 bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* hdrs */
5541 som_object_p, /* bfd_check_format */
5542 bfd_generic_archive_p,
5548 _bfd_generic_mkarchive,
5553 som_write_object_contents,
5554 _bfd_write_archive_contents,
5559 BFD_JUMP_TABLE_GENERIC (som),
5560 BFD_JUMP_TABLE_COPY (som),
5561 BFD_JUMP_TABLE_CORE (_bfd_nocore),
5562 BFD_JUMP_TABLE_ARCHIVE (som),
5563 BFD_JUMP_TABLE_SYMBOLS (som),
5564 BFD_JUMP_TABLE_RELOCS (som),
5565 BFD_JUMP_TABLE_WRITE (som),
5566 BFD_JUMP_TABLE_LINK (som),
5567 BFD_JUMP_TABLE_DYNAMIC (_bfd_nodynamic),
5572 #endif /* HOST_HPPAHPUX || HOST_HPPABSD || HOST_HPPAOSF */