1 /* bfd back-end for HP PA-RISC SOM objects.
2 Copyright (C) 1990, 1991, 1992, 1993, 1994, 1995
3 Free Software Foundation, Inc.
5 Contributed by the Center for Software Science at the
6 University of Utah (pa-gdb-bugs@cs.utah.edu).
8 This file is part of BFD, the Binary File Descriptor library.
10 This program is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 2 of the License, or
13 (at your option) any later version.
15 This program is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with this program; if not, write to the Free Software
22 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
27 #if defined (HOST_HPPAHPUX) || defined (HOST_HPPABSD) || defined (HOST_HPPAOSF)
33 #include <sys/types.h>
34 #include <sys/param.h>
36 #include <machine/reg.h>
40 /* Magic not defined in standard HP-UX header files until 8.0 */
42 #ifndef CPU_PA_RISC1_0
43 #define CPU_PA_RISC1_0 0x20B
44 #endif /* CPU_PA_RISC1_0 */
46 #ifndef CPU_PA_RISC1_1
47 #define CPU_PA_RISC1_1 0x210
48 #endif /* CPU_PA_RISC1_1 */
50 #ifndef _PA_RISC1_0_ID
51 #define _PA_RISC1_0_ID CPU_PA_RISC1_0
52 #endif /* _PA_RISC1_0_ID */
54 #ifndef _PA_RISC1_1_ID
55 #define _PA_RISC1_1_ID CPU_PA_RISC1_1
56 #endif /* _PA_RISC1_1_ID */
58 #ifndef _PA_RISC_MAXID
59 #define _PA_RISC_MAXID 0x2FF
60 #endif /* _PA_RISC_MAXID */
63 #define _PA_RISC_ID(__m_num) \
64 (((__m_num) == _PA_RISC1_0_ID) || \
65 ((__m_num) >= _PA_RISC1_1_ID && (__m_num) <= _PA_RISC_MAXID))
66 #endif /* _PA_RISC_ID */
69 /* HIUX in it's infinite stupidity changed the names for several "well
70 known" constants. Work around such braindamage. Try the HPUX version
71 first, then the HIUX version, and finally provide a default. */
73 #define EXEC_AUX_ID HPUX_AUX_ID
76 #if !defined (EXEC_AUX_ID) && defined (HIUX_AUX_ID)
77 #define EXEC_AUX_ID HIUX_AUX_ID
84 /* Size (in chars) of the temporary buffers used during fixup and string
87 #define SOM_TMP_BUFSIZE 8192
89 /* Size of the hash table in archives. */
90 #define SOM_LST_HASH_SIZE 31
92 /* Max number of SOMs to be found in an archive. */
93 #define SOM_LST_MODULE_LIMIT 1024
95 /* Generic alignment macro. */
96 #define SOM_ALIGN(val, alignment) \
97 (((val) + (alignment) - 1) & ~((alignment) - 1))
99 /* SOM allows any one of the four previous relocations to be reused
100 with a "R_PREV_FIXUP" relocation entry. Since R_PREV_FIXUP
101 relocations are always a single byte, using a R_PREV_FIXUP instead
102 of some multi-byte relocation makes object files smaller.
104 Note one side effect of using a R_PREV_FIXUP is the relocation that
105 is being repeated moves to the front of the queue. */
108 unsigned char *reloc
;
112 /* This fully describes the symbol types which may be attached to
113 an EXPORT or IMPORT directive. Only SOM uses this formation
114 (ELF has no need for it). */
118 SYMBOL_TYPE_ABSOLUTE
,
122 SYMBOL_TYPE_MILLICODE
,
124 SYMBOL_TYPE_PRI_PROG
,
125 SYMBOL_TYPE_SEC_PROG
,
128 struct section_to_type
134 /* Assorted symbol information that needs to be derived from the BFD symbol
135 and/or the BFD backend private symbol data. */
136 struct som_misc_symbol_info
138 unsigned int symbol_type
;
139 unsigned int symbol_scope
;
140 unsigned int arg_reloc
;
141 unsigned int symbol_info
;
142 unsigned int symbol_value
;
145 /* Forward declarations */
147 static boolean som_mkobject
PARAMS ((bfd
*));
148 static const bfd_target
* som_object_setup
PARAMS ((bfd
*,
150 struct som_exec_auxhdr
*));
151 static boolean setup_sections
PARAMS ((bfd
*, struct header
*));
152 static const bfd_target
* som_object_p
PARAMS ((bfd
*));
153 static boolean som_write_object_contents
PARAMS ((bfd
*));
154 static boolean som_slurp_string_table
PARAMS ((bfd
*));
155 static unsigned int som_slurp_symbol_table
PARAMS ((bfd
*));
156 static long som_get_symtab_upper_bound
PARAMS ((bfd
*));
157 static long som_canonicalize_reloc
PARAMS ((bfd
*, sec_ptr
,
158 arelent
**, asymbol
**));
159 static long som_get_reloc_upper_bound
PARAMS ((bfd
*, sec_ptr
));
160 static unsigned int som_set_reloc_info
PARAMS ((unsigned char *, unsigned int,
161 arelent
*, asection
*,
162 asymbol
**, boolean
));
163 static boolean som_slurp_reloc_table
PARAMS ((bfd
*, asection
*,
164 asymbol
**, boolean
));
165 static long som_get_symtab
PARAMS ((bfd
*, asymbol
**));
166 static asymbol
* som_make_empty_symbol
PARAMS ((bfd
*));
167 static void som_print_symbol
PARAMS ((bfd
*, PTR
,
168 asymbol
*, bfd_print_symbol_type
));
169 static boolean som_new_section_hook
PARAMS ((bfd
*, asection
*));
170 static boolean som_bfd_copy_private_symbol_data
PARAMS ((bfd
*, asymbol
*,
172 static boolean som_bfd_copy_private_section_data
PARAMS ((bfd
*, asection
*,
174 static boolean som_bfd_copy_private_bfd_data
PARAMS ((bfd
*, bfd
*));
175 #define som_bfd_merge_private_bfd_data _bfd_generic_bfd_merge_private_bfd_data
176 #define som_bfd_set_private_flags _bfd_generic_bfd_set_private_flags
177 static boolean som_bfd_is_local_label
PARAMS ((bfd
*, asymbol
*));
178 static boolean som_set_section_contents
PARAMS ((bfd
*, sec_ptr
, PTR
,
179 file_ptr
, bfd_size_type
));
180 static boolean som_get_section_contents
PARAMS ((bfd
*, sec_ptr
, PTR
,
181 file_ptr
, bfd_size_type
));
182 static boolean som_set_arch_mach
PARAMS ((bfd
*, enum bfd_architecture
,
184 static boolean som_find_nearest_line
PARAMS ((bfd
*, asection
*,
189 static void som_get_symbol_info
PARAMS ((bfd
*, asymbol
*, symbol_info
*));
190 static asection
* bfd_section_from_som_symbol
PARAMS ((bfd
*,
191 struct symbol_dictionary_record
*));
192 static int log2
PARAMS ((unsigned int));
193 static bfd_reloc_status_type hppa_som_reloc
PARAMS ((bfd
*, arelent
*,
197 static void som_initialize_reloc_queue
PARAMS ((struct reloc_queue
*));
198 static void som_reloc_queue_insert
PARAMS ((unsigned char *, unsigned int,
199 struct reloc_queue
*));
200 static void som_reloc_queue_fix
PARAMS ((struct reloc_queue
*, unsigned int));
201 static int som_reloc_queue_find
PARAMS ((unsigned char *, unsigned int,
202 struct reloc_queue
*));
203 static unsigned char * try_prev_fixup
PARAMS ((bfd
*, int *, unsigned char *,
205 struct reloc_queue
*));
207 static unsigned char * som_reloc_skip
PARAMS ((bfd
*, unsigned int,
208 unsigned char *, unsigned int *,
209 struct reloc_queue
*));
210 static unsigned char * som_reloc_addend
PARAMS ((bfd
*, int, unsigned char *,
212 struct reloc_queue
*));
213 static unsigned char * som_reloc_call
PARAMS ((bfd
*, unsigned char *,
216 struct reloc_queue
*));
217 static unsigned long som_count_spaces
PARAMS ((bfd
*));
218 static unsigned long som_count_subspaces
PARAMS ((bfd
*));
219 static int compare_syms
PARAMS ((const void *, const void *));
220 static int compare_subspaces
PARAMS ((const void *, const void *));
221 static unsigned long som_compute_checksum
PARAMS ((bfd
*));
222 static boolean som_prep_headers
PARAMS ((bfd
*));
223 static int som_sizeof_headers
PARAMS ((bfd
*, boolean
));
224 static boolean som_finish_writing
PARAMS ((bfd
*));
225 static boolean som_build_and_write_symbol_table
PARAMS ((bfd
*));
226 static void som_prep_for_fixups
PARAMS ((bfd
*, asymbol
**, unsigned long));
227 static boolean som_write_fixups
PARAMS ((bfd
*, unsigned long, unsigned int *));
228 static boolean som_write_space_strings
PARAMS ((bfd
*, unsigned long,
230 static boolean som_write_symbol_strings
PARAMS ((bfd
*, unsigned long,
231 asymbol
**, unsigned int,
233 static boolean som_begin_writing
PARAMS ((bfd
*));
234 static reloc_howto_type
* som_bfd_reloc_type_lookup
235 PARAMS ((bfd
*, bfd_reloc_code_real_type
));
236 static char som_section_type
PARAMS ((const char *));
237 static int som_decode_symclass
PARAMS ((asymbol
*));
238 static boolean som_bfd_count_ar_symbols
PARAMS ((bfd
*, struct lst_header
*,
241 static boolean som_bfd_fill_in_ar_symbols
PARAMS ((bfd
*, struct lst_header
*,
243 static boolean som_slurp_armap
PARAMS ((bfd
*));
244 static boolean som_write_armap
PARAMS ((bfd
*, unsigned int, struct orl
*,
246 static void som_bfd_derive_misc_symbol_info
PARAMS ((bfd
*, asymbol
*,
247 struct som_misc_symbol_info
*));
248 static boolean som_bfd_prep_for_ar_write
PARAMS ((bfd
*, unsigned int *,
250 static unsigned int som_bfd_ar_symbol_hash
PARAMS ((asymbol
*));
251 static boolean som_bfd_ar_write_symbol_stuff
PARAMS ((bfd
*, unsigned int,
254 static CONST
char *normalize
PARAMS ((CONST
char *file
));
255 static boolean som_is_space
PARAMS ((asection
*));
256 static boolean som_is_subspace
PARAMS ((asection
*));
257 static boolean som_is_container
PARAMS ((asection
*, asection
*));
258 static boolean som_bfd_free_cached_info
PARAMS ((bfd
*));
259 static boolean som_bfd_link_split_section
PARAMS ((bfd
*, asection
*));
261 /* Map SOM section names to POSIX/BSD single-character symbol types.
263 This table includes all the standard subspaces as defined in the
264 current "PRO ABI for PA-RISC Systems", $UNWIND$ which for
265 some reason was left out, and sections specific to embedded stabs. */
267 static const struct section_to_type stt
[] = {
269 {"$SHLIB_INFO$", 't'},
270 {"$MILLICODE$", 't'},
273 {"$UNWIND_START$", 't'},
277 {"$SHLIB_DATA$", 'd'},
279 {"$SHORTDATA$", 'g'},
284 {"$GDB_STRINGS$", 'N'},
285 {"$GDB_SYMBOLS$", 'N'},
289 /* About the relocation formatting table...
291 There are 256 entries in the table, one for each possible
292 relocation opcode available in SOM. We index the table by
293 the relocation opcode. The names and operations are those
294 defined by a.out_800 (4).
296 Right now this table is only used to count and perform minimal
297 processing on relocation streams so that they can be internalized
298 into BFD and symbolically printed by utilities. To make actual use
299 of them would be much more difficult, BFD's concept of relocations
300 is far too simple to handle SOM relocations. The basic assumption
301 that a relocation can be completely processed independent of other
302 relocations before an object file is written is invalid for SOM.
304 The SOM relocations are meant to be processed as a stream, they
305 specify copying of data from the input section to the output section
306 while possibly modifying the data in some manner. They also can
307 specify that a variable number of zeros or uninitialized data be
308 inserted on in the output segment at the current offset. Some
309 relocations specify that some previous relocation be re-applied at
310 the current location in the input/output sections. And finally a number
311 of relocations have effects on other sections (R_ENTRY, R_EXIT,
312 R_UNWIND_AUX and a variety of others). There isn't even enough room
313 in the BFD relocation data structure to store enough information to
314 perform all the relocations.
316 Each entry in the table has three fields.
318 The first entry is an index into this "class" of relocations. This
319 index can then be used as a variable within the relocation itself.
321 The second field is a format string which actually controls processing
322 of the relocation. It uses a simple postfix machine to do calculations
323 based on variables/constants found in the string and the relocation
326 The third field specifys whether or not this relocation may use
327 a constant (V) from the previous R_DATA_OVERRIDE rather than a constant
328 stored in the instruction.
332 L = input space byte count
333 D = index into class of relocations
334 M = output space byte count
335 N = statement number (unused?)
337 R = parameter relocation bits
339 T = first 32 bits of stack unwind information
340 U = second 32 bits of stack unwind information
341 V = a literal constant (usually used in the next relocation)
342 P = a previous relocation
344 Lower case letters (starting with 'b') refer to following
345 bytes in the relocation stream. 'b' is the next 1 byte,
346 c is the next 2 bytes, d is the next 3 bytes, etc...
347 This is the variable part of the relocation entries that
348 makes our life a living hell.
350 numerical constants are also used in the format string. Note
351 the constants are represented in decimal.
353 '+', "*" and "=" represents the obvious postfix operators.
354 '<' represents a left shift.
358 Parameter Relocation Bits:
362 Previous Relocations: The index field represents which in the queue
363 of 4 previous fixups should be re-applied.
365 Literal Constants: These are generally used to represent addend
366 parts of relocations when these constants are not stored in the
367 fields of the instructions themselves. For example the instruction
368 addil foo-$global$-0x1234 would use an override for "0x1234" rather
369 than storing it into the addil itself. */
377 static const struct fixup_format som_fixup_formats
[256] =
379 /* R_NO_RELOCATION */
380 0, "LD1+4*=", /* 0x00 */
381 1, "LD1+4*=", /* 0x01 */
382 2, "LD1+4*=", /* 0x02 */
383 3, "LD1+4*=", /* 0x03 */
384 4, "LD1+4*=", /* 0x04 */
385 5, "LD1+4*=", /* 0x05 */
386 6, "LD1+4*=", /* 0x06 */
387 7, "LD1+4*=", /* 0x07 */
388 8, "LD1+4*=", /* 0x08 */
389 9, "LD1+4*=", /* 0x09 */
390 10, "LD1+4*=", /* 0x0a */
391 11, "LD1+4*=", /* 0x0b */
392 12, "LD1+4*=", /* 0x0c */
393 13, "LD1+4*=", /* 0x0d */
394 14, "LD1+4*=", /* 0x0e */
395 15, "LD1+4*=", /* 0x0f */
396 16, "LD1+4*=", /* 0x10 */
397 17, "LD1+4*=", /* 0x11 */
398 18, "LD1+4*=", /* 0x12 */
399 19, "LD1+4*=", /* 0x13 */
400 20, "LD1+4*=", /* 0x14 */
401 21, "LD1+4*=", /* 0x15 */
402 22, "LD1+4*=", /* 0x16 */
403 23, "LD1+4*=", /* 0x17 */
404 0, "LD8<b+1+4*=", /* 0x18 */
405 1, "LD8<b+1+4*=", /* 0x19 */
406 2, "LD8<b+1+4*=", /* 0x1a */
407 3, "LD8<b+1+4*=", /* 0x1b */
408 0, "LD16<c+1+4*=", /* 0x1c */
409 1, "LD16<c+1+4*=", /* 0x1d */
410 2, "LD16<c+1+4*=", /* 0x1e */
411 0, "Ld1+=", /* 0x1f */
413 0, "Lb1+4*=", /* 0x20 */
414 1, "Ld1+=", /* 0x21 */
416 0, "Lb1+4*=", /* 0x22 */
417 1, "Ld1+=", /* 0x23 */
420 /* R_DATA_ONE_SYMBOL */
421 0, "L4=Sb=", /* 0x25 */
422 1, "L4=Sd=", /* 0x26 */
424 0, "L4=Sb=", /* 0x27 */
425 1, "L4=Sd=", /* 0x28 */
428 /* R_REPEATED_INIT */
429 0, "L4=Mb1+4*=", /* 0x2a */
430 1, "Lb4*=Mb1+L*=", /* 0x2b */
431 2, "Lb4*=Md1+4*=", /* 0x2c */
432 3, "Ld1+=Me1+=", /* 0x2d */
437 0, "L4=RD=Sb=", /* 0x30 */
438 1, "L4=RD=Sb=", /* 0x31 */
439 2, "L4=RD=Sb=", /* 0x32 */
440 3, "L4=RD=Sb=", /* 0x33 */
441 4, "L4=RD=Sb=", /* 0x34 */
442 5, "L4=RD=Sb=", /* 0x35 */
443 6, "L4=RD=Sb=", /* 0x36 */
444 7, "L4=RD=Sb=", /* 0x37 */
445 8, "L4=RD=Sb=", /* 0x38 */
446 9, "L4=RD=Sb=", /* 0x39 */
447 0, "L4=RD8<b+=Sb=",/* 0x3a */
448 1, "L4=RD8<b+=Sb=",/* 0x3b */
449 0, "L4=RD8<b+=Sd=",/* 0x3c */
450 1, "L4=RD8<b+=Sd=",/* 0x3d */
455 0, "L4=RD=Sb=", /* 0x40 */
456 1, "L4=RD=Sb=", /* 0x41 */
457 2, "L4=RD=Sb=", /* 0x42 */
458 3, "L4=RD=Sb=", /* 0x43 */
459 4, "L4=RD=Sb=", /* 0x44 */
460 5, "L4=RD=Sb=", /* 0x45 */
461 6, "L4=RD=Sb=", /* 0x46 */
462 7, "L4=RD=Sb=", /* 0x47 */
463 8, "L4=RD=Sb=", /* 0x48 */
464 9, "L4=RD=Sb=", /* 0x49 */
465 0, "L4=RD8<b+=Sb=",/* 0x4a */
466 1, "L4=RD8<b+=Sb=",/* 0x4b */
467 0, "L4=RD8<b+=Sd=",/* 0x4c */
468 1, "L4=RD8<b+=Sd=",/* 0x4d */
473 0, "L4=SD=", /* 0x50 */
474 1, "L4=SD=", /* 0x51 */
475 2, "L4=SD=", /* 0x52 */
476 3, "L4=SD=", /* 0x53 */
477 4, "L4=SD=", /* 0x54 */
478 5, "L4=SD=", /* 0x55 */
479 6, "L4=SD=", /* 0x56 */
480 7, "L4=SD=", /* 0x57 */
481 8, "L4=SD=", /* 0x58 */
482 9, "L4=SD=", /* 0x59 */
483 10, "L4=SD=", /* 0x5a */
484 11, "L4=SD=", /* 0x5b */
485 12, "L4=SD=", /* 0x5c */
486 13, "L4=SD=", /* 0x5d */
487 14, "L4=SD=", /* 0x5e */
488 15, "L4=SD=", /* 0x5f */
489 16, "L4=SD=", /* 0x60 */
490 17, "L4=SD=", /* 0x61 */
491 18, "L4=SD=", /* 0x62 */
492 19, "L4=SD=", /* 0x63 */
493 20, "L4=SD=", /* 0x64 */
494 21, "L4=SD=", /* 0x65 */
495 22, "L4=SD=", /* 0x66 */
496 23, "L4=SD=", /* 0x67 */
497 24, "L4=SD=", /* 0x68 */
498 25, "L4=SD=", /* 0x69 */
499 26, "L4=SD=", /* 0x6a */
500 27, "L4=SD=", /* 0x6b */
501 28, "L4=SD=", /* 0x6c */
502 29, "L4=SD=", /* 0x6d */
503 30, "L4=SD=", /* 0x6e */
504 31, "L4=SD=", /* 0x6f */
505 32, "L4=Sb=", /* 0x70 */
506 33, "L4=Sd=", /* 0x71 */
515 0, "L4=Sb=", /* 0x78 */
516 1, "L4=Sd=", /* 0x79 */
524 /* R_CODE_ONE_SYMBOL */
525 0, "L4=SD=", /* 0x80 */
526 1, "L4=SD=", /* 0x81 */
527 2, "L4=SD=", /* 0x82 */
528 3, "L4=SD=", /* 0x83 */
529 4, "L4=SD=", /* 0x84 */
530 5, "L4=SD=", /* 0x85 */
531 6, "L4=SD=", /* 0x86 */
532 7, "L4=SD=", /* 0x87 */
533 8, "L4=SD=", /* 0x88 */
534 9, "L4=SD=", /* 0x89 */
535 10, "L4=SD=", /* 0x8q */
536 11, "L4=SD=", /* 0x8b */
537 12, "L4=SD=", /* 0x8c */
538 13, "L4=SD=", /* 0x8d */
539 14, "L4=SD=", /* 0x8e */
540 15, "L4=SD=", /* 0x8f */
541 16, "L4=SD=", /* 0x90 */
542 17, "L4=SD=", /* 0x91 */
543 18, "L4=SD=", /* 0x92 */
544 19, "L4=SD=", /* 0x93 */
545 20, "L4=SD=", /* 0x94 */
546 21, "L4=SD=", /* 0x95 */
547 22, "L4=SD=", /* 0x96 */
548 23, "L4=SD=", /* 0x97 */
549 24, "L4=SD=", /* 0x98 */
550 25, "L4=SD=", /* 0x99 */
551 26, "L4=SD=", /* 0x9a */
552 27, "L4=SD=", /* 0x9b */
553 28, "L4=SD=", /* 0x9c */
554 29, "L4=SD=", /* 0x9d */
555 30, "L4=SD=", /* 0x9e */
556 31, "L4=SD=", /* 0x9f */
557 32, "L4=Sb=", /* 0xa0 */
558 33, "L4=Sd=", /* 0xa1 */
573 0, "L4=Sb=", /* 0xae */
574 1, "L4=Sd=", /* 0xaf */
576 0, "L4=Sb=", /* 0xb0 */
577 1, "L4=Sd=", /* 0xb1 */
581 0, "Te=Ue=", /* 0xb3 */
591 1, "Rb4*=", /* 0xb9 */
592 2, "Rd4*=", /* 0xba */
619 /* R_DATA_OVERRIDE */
632 0, "Ob=Sd=", /* 0xd1 */
634 0, "Ob=Ve=", /* 0xd2 */
684 static const int comp1_opcodes
[] =
706 static const int comp2_opcodes
[] =
715 static const int comp3_opcodes
[] =
722 /* These apparently are not in older versions of hpux reloc.h. */
724 #define R_DLT_REL 0x78
728 #define R_AUX_UNWIND 0xcf
732 #define R_SEC_STMT 0xd7
735 static reloc_howto_type som_hppa_howto_table
[] =
737 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
738 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
739 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
740 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
741 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
742 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
743 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
744 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
745 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
746 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
747 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
748 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
749 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
750 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
751 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
752 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
753 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
754 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
755 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
756 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
757 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
758 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
759 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
760 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
761 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
762 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
763 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
764 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
765 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
766 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
767 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
768 {R_NO_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_NO_RELOCATION"},
769 {R_ZEROES
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ZEROES"},
770 {R_ZEROES
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ZEROES"},
771 {R_UNINIT
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_UNINIT"},
772 {R_UNINIT
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_UNINIT"},
773 {R_RELOCATION
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RELOCATION"},
774 {R_DATA_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DATA_ONE_SYMBOL"},
775 {R_DATA_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DATA_ONE_SYMBOL"},
776 {R_DATA_PLABEL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DATA_PLABEL"},
777 {R_DATA_PLABEL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DATA_PLABEL"},
778 {R_SPACE_REF
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_SPACE_REF"},
779 {R_REPEATED_INIT
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "REPEATED_INIT"},
780 {R_REPEATED_INIT
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "REPEATED_INIT"},
781 {R_REPEATED_INIT
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "REPEATED_INIT"},
782 {R_REPEATED_INIT
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "REPEATED_INIT"},
783 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
784 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
785 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
786 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
787 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
788 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
789 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
790 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
791 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
792 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
793 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
794 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
795 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
796 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
797 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
798 {R_PCREL_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PCREL_CALL"},
799 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
800 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
801 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
802 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
803 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
804 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
805 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
806 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
807 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
808 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
809 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
810 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
811 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
812 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
813 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
814 {R_ABS_CALL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ABS_CALL"},
815 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
816 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
817 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
818 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
819 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
820 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
821 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
822 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
823 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
824 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
825 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
826 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
827 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
828 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
829 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
830 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
831 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
832 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
833 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
834 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
835 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
836 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
837 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
838 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
839 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
840 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
841 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
842 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
843 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
844 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
845 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
846 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
847 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
848 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
849 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
850 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
851 {R_DP_RELATIVE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DP_RELATIVE"},
852 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
853 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
854 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
855 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
856 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
857 {R_DLT_REL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DLT_REL"},
858 {R_DLT_REL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DLT_REL"},
859 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
860 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
861 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
862 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
863 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
864 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
865 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
866 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
867 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
868 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
869 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
870 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
871 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
872 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
873 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
874 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
875 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
876 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
877 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
878 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
879 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
880 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
881 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
882 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
883 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
884 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
885 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
886 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
887 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
888 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
889 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
890 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
891 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
892 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
893 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
894 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
895 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
896 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
897 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
898 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
899 {R_CODE_ONE_SYMBOL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_ONE_SYMBOL"},
900 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
901 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
902 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
903 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
904 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
905 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
906 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
907 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
908 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
909 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
910 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
911 {R_MILLI_REL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_MILLI_REL"},
912 {R_MILLI_REL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_MILLI_REL"},
913 {R_CODE_PLABEL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_PLABEL"},
914 {R_CODE_PLABEL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_PLABEL"},
915 {R_BREAKPOINT
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_BREAKPOINT"},
916 {R_ENTRY
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ENTRY"},
917 {R_ENTRY
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ENTRY"},
918 {R_ALT_ENTRY
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_ALT_ENTRY"},
919 {R_EXIT
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_EXIT"},
920 {R_BEGIN_TRY
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_BEGIN_TRY"},
921 {R_END_TRY
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_END_TRY"},
922 {R_END_TRY
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_END_TRY"},
923 {R_END_TRY
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_END_TRY"},
924 {R_BEGIN_BRTAB
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_BEGIN_BRTAB"},
925 {R_END_BRTAB
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_END_BRTAB"},
926 {R_STATEMENT
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_STATEMENT"},
927 {R_STATEMENT
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_STATEMENT"},
928 {R_STATEMENT
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_STATEMENT"},
929 {R_DATA_EXPR
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DATA_EXPR"},
930 {R_CODE_EXPR
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_CODE_EXPR"},
931 {R_FSEL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_FSEL"},
932 {R_LSEL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_LSEL"},
933 {R_RSEL
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RSEL"},
934 {R_N_MODE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_N_MODE"},
935 {R_S_MODE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_S_MODE"},
936 {R_D_MODE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_D_MODE"},
937 {R_R_MODE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_R_MODE"},
938 {R_DATA_OVERRIDE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DATA_OVERRIDE"},
939 {R_DATA_OVERRIDE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DATA_OVERRIDE"},
940 {R_DATA_OVERRIDE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DATA_OVERRIDE"},
941 {R_DATA_OVERRIDE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DATA_OVERRIDE"},
942 {R_DATA_OVERRIDE
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_DATA_OVERRIDE"},
943 {R_TRANSLATED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_TRANSLATED"},
944 {R_AUX_UNWIND
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_AUX_UNWIND"},
945 {R_COMP1
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_COMP1"},
946 {R_COMP2
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_COMP2"},
947 {R_COMP3
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_COMP3"},
948 {R_PREV_FIXUP
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PREV_FIXUP"},
949 {R_PREV_FIXUP
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PREV_FIXUP"},
950 {R_PREV_FIXUP
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PREV_FIXUP"},
951 {R_PREV_FIXUP
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_PREV_FIXUP"},
952 {R_SEC_STMT
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_SEC_STMT"},
953 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
954 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
955 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
956 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
957 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
958 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
959 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
960 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
961 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
962 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
963 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
964 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
965 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
966 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
967 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
968 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
969 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
970 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
971 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
972 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
973 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
974 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
975 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
976 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
977 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
978 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
979 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
980 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
981 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
982 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
983 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
984 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
985 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
986 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
987 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
988 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
989 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
990 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
991 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"},
992 {R_RESERVED
, 0, 0, 32, false, 0, 0, hppa_som_reloc
, "R_RESERVED"}};
994 /* Initialize the SOM relocation queue. By definition the queue holds
995 the last four multibyte fixups. */
998 som_initialize_reloc_queue (queue
)
999 struct reloc_queue
*queue
;
1001 queue
[0].reloc
= NULL
;
1003 queue
[1].reloc
= NULL
;
1005 queue
[2].reloc
= NULL
;
1007 queue
[3].reloc
= NULL
;
1011 /* Insert a new relocation into the relocation queue. */
1014 som_reloc_queue_insert (p
, size
, queue
)
1017 struct reloc_queue
*queue
;
1019 queue
[3].reloc
= queue
[2].reloc
;
1020 queue
[3].size
= queue
[2].size
;
1021 queue
[2].reloc
= queue
[1].reloc
;
1022 queue
[2].size
= queue
[1].size
;
1023 queue
[1].reloc
= queue
[0].reloc
;
1024 queue
[1].size
= queue
[0].size
;
1026 queue
[0].size
= size
;
1029 /* When an entry in the relocation queue is reused, the entry moves
1030 to the front of the queue. */
1033 som_reloc_queue_fix (queue
, index
)
1034 struct reloc_queue
*queue
;
1042 unsigned char *tmp1
= queue
[0].reloc
;
1043 unsigned int tmp2
= queue
[0].size
;
1044 queue
[0].reloc
= queue
[1].reloc
;
1045 queue
[0].size
= queue
[1].size
;
1046 queue
[1].reloc
= tmp1
;
1047 queue
[1].size
= tmp2
;
1053 unsigned char *tmp1
= queue
[0].reloc
;
1054 unsigned int tmp2
= queue
[0].size
;
1055 queue
[0].reloc
= queue
[2].reloc
;
1056 queue
[0].size
= queue
[2].size
;
1057 queue
[2].reloc
= queue
[1].reloc
;
1058 queue
[2].size
= queue
[1].size
;
1059 queue
[1].reloc
= tmp1
;
1060 queue
[1].size
= tmp2
;
1066 unsigned char *tmp1
= queue
[0].reloc
;
1067 unsigned int tmp2
= queue
[0].size
;
1068 queue
[0].reloc
= queue
[3].reloc
;
1069 queue
[0].size
= queue
[3].size
;
1070 queue
[3].reloc
= queue
[2].reloc
;
1071 queue
[3].size
= queue
[2].size
;
1072 queue
[2].reloc
= queue
[1].reloc
;
1073 queue
[2].size
= queue
[1].size
;
1074 queue
[1].reloc
= tmp1
;
1075 queue
[1].size
= tmp2
;
1081 /* Search for a particular relocation in the relocation queue. */
1084 som_reloc_queue_find (p
, size
, queue
)
1087 struct reloc_queue
*queue
;
1089 if (queue
[0].reloc
&& !memcmp (p
, queue
[0].reloc
, size
)
1090 && size
== queue
[0].size
)
1092 if (queue
[1].reloc
&& !memcmp (p
, queue
[1].reloc
, size
)
1093 && size
== queue
[1].size
)
1095 if (queue
[2].reloc
&& !memcmp (p
, queue
[2].reloc
, size
)
1096 && size
== queue
[2].size
)
1098 if (queue
[3].reloc
&& !memcmp (p
, queue
[3].reloc
, size
)
1099 && size
== queue
[3].size
)
1104 static unsigned char *
1105 try_prev_fixup (abfd
, subspace_reloc_sizep
, p
, size
, queue
)
1107 int *subspace_reloc_sizep
;
1110 struct reloc_queue
*queue
;
1112 int queue_index
= som_reloc_queue_find (p
, size
, queue
);
1114 if (queue_index
!= -1)
1116 /* Found this in a previous fixup. Undo the fixup we
1117 just built and use R_PREV_FIXUP instead. We saved
1118 a total of size - 1 bytes in the fixup stream. */
1119 bfd_put_8 (abfd
, R_PREV_FIXUP
+ queue_index
, p
);
1121 *subspace_reloc_sizep
+= 1;
1122 som_reloc_queue_fix (queue
, queue_index
);
1126 som_reloc_queue_insert (p
, size
, queue
);
1127 *subspace_reloc_sizep
+= size
;
1133 /* Emit the proper R_NO_RELOCATION fixups to map the next SKIP
1134 bytes without any relocation. Update the size of the subspace
1135 relocation stream via SUBSPACE_RELOC_SIZE_P; also return the
1136 current pointer into the relocation stream. */
1138 static unsigned char *
1139 som_reloc_skip (abfd
, skip
, p
, subspace_reloc_sizep
, queue
)
1143 unsigned int *subspace_reloc_sizep
;
1144 struct reloc_queue
*queue
;
1146 /* Use a 4 byte R_NO_RELOCATION entry with a maximal value
1147 then R_PREV_FIXUPs to get the difference down to a
1149 if (skip
>= 0x1000000)
1152 bfd_put_8 (abfd
, R_NO_RELOCATION
+ 31, p
);
1153 bfd_put_8 (abfd
, 0xff, p
+ 1);
1154 bfd_put_16 (abfd
, 0xffff, p
+ 2);
1155 p
= try_prev_fixup (abfd
, subspace_reloc_sizep
, p
, 4, queue
);
1156 while (skip
>= 0x1000000)
1159 bfd_put_8 (abfd
, R_PREV_FIXUP
, p
);
1161 *subspace_reloc_sizep
+= 1;
1162 /* No need to adjust queue here since we are repeating the
1163 most recent fixup. */
1167 /* The difference must be less than 0x1000000. Use one
1168 more R_NO_RELOCATION entry to get to the right difference. */
1169 if ((skip
& 3) == 0 && skip
<= 0xc0000 && skip
> 0)
1171 /* Difference can be handled in a simple single-byte
1172 R_NO_RELOCATION entry. */
1175 bfd_put_8 (abfd
, R_NO_RELOCATION
+ (skip
>> 2) - 1, p
);
1176 *subspace_reloc_sizep
+= 1;
1179 /* Handle it with a two byte R_NO_RELOCATION entry. */
1180 else if (skip
<= 0x1000)
1182 bfd_put_8 (abfd
, R_NO_RELOCATION
+ 24 + (((skip
>> 2) - 1) >> 8), p
);
1183 bfd_put_8 (abfd
, (skip
>> 2) - 1, p
+ 1);
1184 p
= try_prev_fixup (abfd
, subspace_reloc_sizep
, p
, 2, queue
);
1186 /* Handle it with a three byte R_NO_RELOCATION entry. */
1189 bfd_put_8 (abfd
, R_NO_RELOCATION
+ 28 + (((skip
>> 2) - 1) >> 16), p
);
1190 bfd_put_16 (abfd
, (skip
>> 2) - 1, p
+ 1);
1191 p
= try_prev_fixup (abfd
, subspace_reloc_sizep
, p
, 3, queue
);
1194 /* Ugh. Punt and use a 4 byte entry. */
1197 bfd_put_8 (abfd
, R_NO_RELOCATION
+ 31, p
);
1198 bfd_put_8 (abfd
, (skip
- 1) >> 16, p
+ 1);
1199 bfd_put_16 (abfd
, skip
- 1, p
+ 2);
1200 p
= try_prev_fixup (abfd
, subspace_reloc_sizep
, p
, 4, queue
);
1205 /* Emit the proper R_DATA_OVERRIDE fixups to handle a nonzero addend
1206 from a BFD relocation. Update the size of the subspace relocation
1207 stream via SUBSPACE_RELOC_SIZE_P; also return the current pointer
1208 into the relocation stream. */
1210 static unsigned char *
1211 som_reloc_addend (abfd
, addend
, p
, subspace_reloc_sizep
, queue
)
1215 unsigned int *subspace_reloc_sizep
;
1216 struct reloc_queue
*queue
;
1218 if ((unsigned)(addend
) + 0x80 < 0x100)
1220 bfd_put_8 (abfd
, R_DATA_OVERRIDE
+ 1, p
);
1221 bfd_put_8 (abfd
, addend
, p
+ 1);
1222 p
= try_prev_fixup (abfd
, subspace_reloc_sizep
, p
, 2, queue
);
1224 else if ((unsigned) (addend
) + 0x8000 < 0x10000)
1226 bfd_put_8 (abfd
, R_DATA_OVERRIDE
+ 2, p
);
1227 bfd_put_16 (abfd
, addend
, p
+ 1);
1228 p
= try_prev_fixup (abfd
, subspace_reloc_sizep
, p
, 3, queue
);
1230 else if ((unsigned) (addend
) + 0x800000 < 0x1000000)
1232 bfd_put_8 (abfd
, R_DATA_OVERRIDE
+ 3, p
);
1233 bfd_put_8 (abfd
, addend
>> 16, p
+ 1);
1234 bfd_put_16 (abfd
, addend
, p
+ 2);
1235 p
= try_prev_fixup (abfd
, subspace_reloc_sizep
, p
, 4, queue
);
1239 bfd_put_8 (abfd
, R_DATA_OVERRIDE
+ 4, p
);
1240 bfd_put_32 (abfd
, addend
, p
+ 1);
1241 p
= try_prev_fixup (abfd
, subspace_reloc_sizep
, p
, 5, queue
);
1246 /* Handle a single function call relocation. */
1248 static unsigned char *
1249 som_reloc_call (abfd
, p
, subspace_reloc_sizep
, bfd_reloc
, sym_num
, queue
)
1252 unsigned int *subspace_reloc_sizep
;
1255 struct reloc_queue
*queue
;
1257 int arg_bits
= HPPA_R_ARG_RELOC (bfd_reloc
->addend
);
1258 int rtn_bits
= arg_bits
& 0x3;
1261 /* You'll never believe all this is necessary to handle relocations
1262 for function calls. Having to compute and pack the argument
1263 relocation bits is the real nightmare.
1265 If you're interested in how this works, just forget it. You really
1266 do not want to know about this braindamage. */
1268 /* First see if this can be done with a "simple" relocation. Simple
1269 relocations have a symbol number < 0x100 and have simple encodings
1270 of argument relocations. */
1272 if (sym_num
< 0x100)
1284 case 1 << 8 | 1 << 6:
1285 case 1 << 8 | 1 << 6 | 1:
1288 case 1 << 8 | 1 << 6 | 1 << 4:
1289 case 1 << 8 | 1 << 6 | 1 << 4 | 1:
1292 case 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2:
1293 case 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2 | 1:
1297 /* Not one of the easy encodings. This will have to be
1298 handled by the more complex code below. */
1304 /* Account for the return value too. */
1308 /* Emit a 2 byte relocation. Then see if it can be handled
1309 with a relocation which is already in the relocation queue. */
1310 bfd_put_8 (abfd
, bfd_reloc
->howto
->type
+ type
, p
);
1311 bfd_put_8 (abfd
, sym_num
, p
+ 1);
1312 p
= try_prev_fixup (abfd
, subspace_reloc_sizep
, p
, 2, queue
);
1317 /* If this could not be handled with a simple relocation, then do a hard
1318 one. Hard relocations occur if the symbol number was too high or if
1319 the encoding of argument relocation bits is too complex. */
1322 /* Don't ask about these magic sequences. I took them straight
1323 from gas-1.36 which took them from the a.out man page. */
1325 if ((arg_bits
>> 6 & 0xf) == 0xe)
1328 type
+= (3 * (arg_bits
>> 8 & 3) + (arg_bits
>> 6 & 3)) * 40;
1329 if ((arg_bits
>> 2 & 0xf) == 0xe)
1332 type
+= (3 * (arg_bits
>> 4 & 3) + (arg_bits
>> 2 & 3)) * 4;
1334 /* Output the first two bytes of the relocation. These describe
1335 the length of the relocation and encoding style. */
1336 bfd_put_8 (abfd
, bfd_reloc
->howto
->type
+ 10
1337 + 2 * (sym_num
>= 0x100) + (type
>= 0x100),
1339 bfd_put_8 (abfd
, type
, p
+ 1);
1341 /* Now output the symbol index and see if this bizarre relocation
1342 just happened to be in the relocation queue. */
1343 if (sym_num
< 0x100)
1345 bfd_put_8 (abfd
, sym_num
, p
+ 2);
1346 p
= try_prev_fixup (abfd
, subspace_reloc_sizep
, p
, 3, queue
);
1350 bfd_put_8 (abfd
, sym_num
>> 16, p
+ 2);
1351 bfd_put_16 (abfd
, sym_num
, p
+ 3);
1352 p
= try_prev_fixup (abfd
, subspace_reloc_sizep
, p
, 5, queue
);
1359 /* Return the logarithm of X, base 2, considering X unsigned.
1360 Abort -1 if X is not a power or two or is zero. */
1368 /* Test for 0 or a power of 2. */
1369 if (x
== 0 || x
!= (x
& -x
))
1372 while ((x
>>= 1) != 0)
1377 static bfd_reloc_status_type
1378 hppa_som_reloc (abfd
, reloc_entry
, symbol_in
, data
,
1379 input_section
, output_bfd
, error_message
)
1381 arelent
*reloc_entry
;
1384 asection
*input_section
;
1386 char **error_message
;
1390 reloc_entry
->address
+= input_section
->output_offset
;
1391 return bfd_reloc_ok
;
1393 return bfd_reloc_ok
;
1396 /* Given a generic HPPA relocation type, the instruction format,
1397 and a field selector, return one or more appropriate SOM relocations. */
1400 hppa_som_gen_reloc_type (abfd
, base_type
, format
, field
, sym_diff
)
1404 enum hppa_reloc_field_selector_type_alt field
;
1407 int *final_type
, **final_types
;
1409 final_types
= (int **) bfd_alloc_by_size_t (abfd
, sizeof (int *) * 6);
1410 final_type
= (int *) bfd_alloc_by_size_t (abfd
, sizeof (int));
1411 if (!final_types
|| !final_type
)
1413 bfd_set_error (bfd_error_no_memory
);
1417 /* The field selector may require additional relocations to be
1418 generated. It's impossible to know at this moment if additional
1419 relocations will be needed, so we make them. The code to actually
1420 write the relocation/fixup stream is responsible for removing
1421 any redundant relocations. */
1428 final_types
[0] = final_type
;
1429 final_types
[1] = NULL
;
1430 final_types
[2] = NULL
;
1431 *final_type
= base_type
;
1437 final_types
[0] = (int *) bfd_alloc_by_size_t (abfd
, sizeof (int));
1438 if (!final_types
[0])
1440 bfd_set_error (bfd_error_no_memory
);
1443 if (field
== e_tsel
)
1444 *final_types
[0] = R_FSEL
;
1445 else if (field
== e_ltsel
)
1446 *final_types
[0] = R_LSEL
;
1448 *final_types
[0] = R_RSEL
;
1449 final_types
[1] = final_type
;
1450 final_types
[2] = NULL
;
1451 *final_type
= base_type
;
1456 final_types
[0] = (int *) bfd_alloc_by_size_t (abfd
, sizeof (int));
1457 if (!final_types
[0])
1459 bfd_set_error (bfd_error_no_memory
);
1462 *final_types
[0] = R_S_MODE
;
1463 final_types
[1] = final_type
;
1464 final_types
[2] = NULL
;
1465 *final_type
= base_type
;
1470 final_types
[0] = (int *) bfd_alloc_by_size_t (abfd
, sizeof (int));
1471 if (!final_types
[0])
1473 bfd_set_error (bfd_error_no_memory
);
1476 *final_types
[0] = R_N_MODE
;
1477 final_types
[1] = final_type
;
1478 final_types
[2] = NULL
;
1479 *final_type
= base_type
;
1484 final_types
[0] = (int *) bfd_alloc_by_size_t (abfd
, sizeof (int));
1485 if (!final_types
[0])
1487 bfd_set_error (bfd_error_no_memory
);
1490 *final_types
[0] = R_D_MODE
;
1491 final_types
[1] = final_type
;
1492 final_types
[2] = NULL
;
1493 *final_type
= base_type
;
1498 final_types
[0] = (int *) bfd_alloc_by_size_t (abfd
, sizeof (int));
1499 if (!final_types
[0])
1501 bfd_set_error (bfd_error_no_memory
);
1504 *final_types
[0] = R_R_MODE
;
1505 final_types
[1] = final_type
;
1506 final_types
[2] = NULL
;
1507 *final_type
= base_type
;
1514 /* The difference of two symbols needs *very* special handling. */
1517 final_types
[0] = (int *)bfd_alloc_by_size_t (abfd
, sizeof (int));
1518 final_types
[1] = (int *)bfd_alloc_by_size_t (abfd
, sizeof (int));
1519 final_types
[2] = (int *)bfd_alloc_by_size_t (abfd
, sizeof (int));
1520 final_types
[3] = (int *)bfd_alloc_by_size_t (abfd
, sizeof (int));
1521 if (!final_types
[0] || !final_types
[1] || !final_types
[2])
1523 bfd_set_error (bfd_error_no_memory
);
1526 if (field
== e_fsel
)
1527 *final_types
[0] = R_FSEL
;
1528 else if (field
== e_rsel
)
1529 *final_types
[0] = R_RSEL
;
1530 else if (field
== e_lsel
)
1531 *final_types
[0] = R_LSEL
;
1532 *final_types
[1] = R_COMP2
;
1533 *final_types
[2] = R_COMP2
;
1534 *final_types
[3] = R_COMP1
;
1535 final_types
[4] = final_type
;
1536 *final_types
[4] = R_CODE_EXPR
;
1537 final_types
[5] = NULL
;
1540 /* PLABELs get their own relocation type. */
1541 else if (field
== e_psel
1543 || field
== e_rpsel
)
1545 /* A PLABEL relocation that has a size of 32 bits must
1546 be a R_DATA_PLABEL. All others are R_CODE_PLABELs. */
1548 *final_type
= R_DATA_PLABEL
;
1550 *final_type
= R_CODE_PLABEL
;
1553 else if (field
== e_tsel
1555 || field
== e_rtsel
)
1556 *final_type
= R_DLT_REL
;
1557 /* A relocation in the data space is always a full 32bits. */
1558 else if (format
== 32)
1559 *final_type
= R_DATA_ONE_SYMBOL
;
1564 /* More PLABEL special cases. */
1567 || field
== e_rpsel
)
1568 *final_type
= R_DATA_PLABEL
;
1571 case R_HPPA_COMPLEX
:
1572 /* The difference of two symbols needs *very* special handling. */
1575 final_types
[0] = (int *)bfd_alloc_by_size_t (abfd
, sizeof (int));
1576 final_types
[1] = (int *)bfd_alloc_by_size_t (abfd
, sizeof (int));
1577 final_types
[2] = (int *)bfd_alloc_by_size_t (abfd
, sizeof (int));
1578 final_types
[3] = (int *)bfd_alloc_by_size_t (abfd
, sizeof (int));
1579 if (!final_types
[0] || !final_types
[1] || !final_types
[2])
1581 bfd_set_error (bfd_error_no_memory
);
1584 if (field
== e_fsel
)
1585 *final_types
[0] = R_FSEL
;
1586 else if (field
== e_rsel
)
1587 *final_types
[0] = R_RSEL
;
1588 else if (field
== e_lsel
)
1589 *final_types
[0] = R_LSEL
;
1590 *final_types
[1] = R_COMP2
;
1591 *final_types
[2] = R_COMP2
;
1592 *final_types
[3] = R_COMP1
;
1593 final_types
[4] = final_type
;
1594 *final_types
[4] = R_CODE_EXPR
;
1595 final_types
[5] = NULL
;
1602 case R_HPPA_ABS_CALL
:
1603 case R_HPPA_PCREL_CALL
:
1604 /* Right now we can default all these. */
1610 /* Return the address of the correct entry in the PA SOM relocation
1614 static reloc_howto_type
*
1615 som_bfd_reloc_type_lookup (abfd
, code
)
1617 bfd_reloc_code_real_type code
;
1619 if ((int) code
< (int) R_NO_RELOCATION
+ 255)
1621 BFD_ASSERT ((int) som_hppa_howto_table
[(int) code
].type
== (int) code
);
1622 return &som_hppa_howto_table
[(int) code
];
1625 return (reloc_howto_type
*) 0;
1628 /* Perform some initialization for an object. Save results of this
1629 initialization in the BFD. */
1631 static const bfd_target
*
1632 som_object_setup (abfd
, file_hdrp
, aux_hdrp
)
1634 struct header
*file_hdrp
;
1635 struct som_exec_auxhdr
*aux_hdrp
;
1640 /* som_mkobject will set bfd_error if som_mkobject fails. */
1641 if (som_mkobject (abfd
) != true)
1644 /* Set BFD flags based on what information is available in the SOM. */
1645 abfd
->flags
= NO_FLAGS
;
1646 if (file_hdrp
->symbol_total
)
1647 abfd
->flags
|= HAS_LINENO
| HAS_DEBUG
| HAS_SYMS
| HAS_LOCALS
;
1649 switch (file_hdrp
->a_magic
)
1652 abfd
->flags
|= (D_PAGED
| WP_TEXT
| EXEC_P
);
1655 abfd
->flags
|= (WP_TEXT
| EXEC_P
);
1658 abfd
->flags
|= (EXEC_P
);
1661 abfd
->flags
|= HAS_RELOC
;
1669 abfd
->flags
|= DYNAMIC
;
1676 /* Allocate space to hold the saved exec header information. */
1677 obj_som_exec_data (abfd
) = (struct som_exec_data
*)
1678 bfd_zalloc (abfd
, sizeof (struct som_exec_data
));
1679 if (obj_som_exec_data (abfd
) == NULL
)
1681 bfd_set_error (bfd_error_no_memory
);
1685 /* The braindamaged OSF1 linker switched exec_flags and exec_entry!
1687 We used to identify OSF1 binaries based on NEW_VERSION_ID, but
1688 apparently the latest HPUX linker is using NEW_VERSION_ID now.
1690 It's about time, OSF has used the new id since at least 1992;
1691 HPUX didn't start till nearly 1995!.
1693 The new approach examines the entry field. If it's zero or not 4
1694 byte aligned then it's not a proper code address and we guess it's
1695 really the executable flags. */
1697 for (section
= abfd
->sections
; section
; section
= section
->next
)
1699 if ((section
->flags
& SEC_CODE
) == 0)
1701 if (aux_hdrp
->exec_entry
>= section
->vma
1702 && aux_hdrp
->exec_entry
< section
->vma
+ section
->_cooked_size
)
1705 if (aux_hdrp
->exec_entry
== 0
1706 || (aux_hdrp
->exec_entry
& 0x3) != 0
1709 bfd_get_start_address (abfd
) = aux_hdrp
->exec_flags
;
1710 obj_som_exec_data (abfd
)->exec_flags
= aux_hdrp
->exec_entry
;
1714 bfd_get_start_address (abfd
) = aux_hdrp
->exec_entry
;
1715 obj_som_exec_data (abfd
)->exec_flags
= aux_hdrp
->exec_flags
;
1718 bfd_default_set_arch_mach (abfd
, bfd_arch_hppa
, pa10
);
1719 bfd_get_symcount (abfd
) = file_hdrp
->symbol_total
;
1721 /* Initialize the saved symbol table and string table to NULL.
1722 Save important offsets and sizes from the SOM header into
1724 obj_som_stringtab (abfd
) = (char *) NULL
;
1725 obj_som_symtab (abfd
) = (som_symbol_type
*) NULL
;
1726 obj_som_sorted_syms (abfd
) = NULL
;
1727 obj_som_stringtab_size (abfd
) = file_hdrp
->symbol_strings_size
;
1728 obj_som_sym_filepos (abfd
) = file_hdrp
->symbol_location
;
1729 obj_som_str_filepos (abfd
) = file_hdrp
->symbol_strings_location
;
1730 obj_som_reloc_filepos (abfd
) = file_hdrp
->fixup_request_location
;
1731 obj_som_exec_data (abfd
)->system_id
= file_hdrp
->system_id
;
1736 /* Convert all of the space and subspace info into BFD sections. Each space
1737 contains a number of subspaces, which in turn describe the mapping between
1738 regions of the exec file, and the address space that the program runs in.
1739 BFD sections which correspond to spaces will overlap the sections for the
1740 associated subspaces. */
1743 setup_sections (abfd
, file_hdr
)
1745 struct header
*file_hdr
;
1747 char *space_strings
;
1748 unsigned int space_index
, i
;
1749 unsigned int total_subspaces
= 0;
1750 asection
**subspace_sections
, *section
;
1752 /* First, read in space names */
1754 space_strings
= malloc (file_hdr
->space_strings_size
);
1755 if (!space_strings
&& file_hdr
->space_strings_size
!= 0)
1757 bfd_set_error (bfd_error_no_memory
);
1761 if (bfd_seek (abfd
, file_hdr
->space_strings_location
, SEEK_SET
) < 0)
1763 if (bfd_read (space_strings
, 1, file_hdr
->space_strings_size
, abfd
)
1764 != file_hdr
->space_strings_size
)
1767 /* Loop over all of the space dictionaries, building up sections */
1768 for (space_index
= 0; space_index
< file_hdr
->space_total
; space_index
++)
1770 struct space_dictionary_record space
;
1771 struct subspace_dictionary_record subspace
, save_subspace
;
1773 asection
*space_asect
;
1776 /* Read the space dictionary element */
1777 if (bfd_seek (abfd
, file_hdr
->space_location
1778 + space_index
* sizeof space
, SEEK_SET
) < 0)
1780 if (bfd_read (&space
, 1, sizeof space
, abfd
) != sizeof space
)
1783 /* Setup the space name string */
1784 space
.name
.n_name
= space
.name
.n_strx
+ space_strings
;
1786 /* Make a section out of it */
1787 newname
= bfd_alloc (abfd
, strlen (space
.name
.n_name
) + 1);
1790 strcpy (newname
, space
.name
.n_name
);
1792 space_asect
= bfd_make_section_anyway (abfd
, newname
);
1796 if (space
.is_loadable
== 0)
1797 space_asect
->flags
|= SEC_DEBUGGING
;
1799 /* Set up all the attributes for the space. */
1800 if (bfd_som_set_section_attributes (space_asect
, space
.is_defined
,
1801 space
.is_private
, space
.sort_key
,
1802 space
.space_number
) == false)
1805 /* Now, read in the first subspace for this space */
1806 if (bfd_seek (abfd
, file_hdr
->subspace_location
1807 + space
.subspace_index
* sizeof subspace
,
1810 if (bfd_read (&subspace
, 1, sizeof subspace
, abfd
) != sizeof subspace
)
1812 /* Seek back to the start of the subspaces for loop below */
1813 if (bfd_seek (abfd
, file_hdr
->subspace_location
1814 + space
.subspace_index
* sizeof subspace
,
1818 /* Setup the start address and file loc from the first subspace record */
1819 space_asect
->vma
= subspace
.subspace_start
;
1820 space_asect
->filepos
= subspace
.file_loc_init_value
;
1821 space_asect
->alignment_power
= log2 (subspace
.alignment
);
1822 if (space_asect
->alignment_power
== -1)
1825 /* Initialize save_subspace so we can reliably determine if this
1826 loop placed any useful values into it. */
1827 memset (&save_subspace
, 0, sizeof (struct subspace_dictionary_record
));
1829 /* Loop over the rest of the subspaces, building up more sections */
1830 for (subspace_index
= 0; subspace_index
< space
.subspace_quantity
;
1833 asection
*subspace_asect
;
1835 /* Read in the next subspace */
1836 if (bfd_read (&subspace
, 1, sizeof subspace
, abfd
)
1840 /* Setup the subspace name string */
1841 subspace
.name
.n_name
= subspace
.name
.n_strx
+ space_strings
;
1843 newname
= bfd_alloc (abfd
, strlen (subspace
.name
.n_name
) + 1);
1846 strcpy (newname
, subspace
.name
.n_name
);
1848 /* Make a section out of this subspace */
1849 subspace_asect
= bfd_make_section_anyway (abfd
, newname
);
1850 if (!subspace_asect
)
1853 /* Store private information about the section. */
1854 if (bfd_som_set_subsection_attributes (subspace_asect
, space_asect
,
1855 subspace
.access_control_bits
,
1857 subspace
.quadrant
) == false)
1860 /* Keep an easy mapping between subspaces and sections.
1861 Note we do not necessarily read the subspaces in the
1862 same order in which they appear in the object file.
1864 So to make the target index come out correctly, we
1865 store the location of the subspace header in target
1866 index, then sort using the location of the subspace
1867 header as the key. Then we can assign correct
1868 subspace indices. */
1870 subspace_asect
->target_index
= bfd_tell (abfd
) - sizeof (subspace
);
1872 /* Set SEC_READONLY and SEC_CODE/SEC_DATA as specified
1873 by the access_control_bits in the subspace header. */
1874 switch (subspace
.access_control_bits
>> 4)
1876 /* Readonly data. */
1878 subspace_asect
->flags
|= SEC_DATA
| SEC_READONLY
;
1883 subspace_asect
->flags
|= SEC_DATA
;
1886 /* Readonly code and the gateways.
1887 Gateways have other attributes which do not map
1888 into anything BFD knows about. */
1894 subspace_asect
->flags
|= SEC_CODE
| SEC_READONLY
;
1897 /* dynamic (writable) code. */
1899 subspace_asect
->flags
|= SEC_CODE
;
1903 if (subspace
.dup_common
|| subspace
.is_common
)
1904 subspace_asect
->flags
|= SEC_IS_COMMON
;
1905 else if (subspace
.subspace_length
> 0)
1906 subspace_asect
->flags
|= SEC_HAS_CONTENTS
;
1908 if (subspace
.is_loadable
)
1909 subspace_asect
->flags
|= SEC_ALLOC
| SEC_LOAD
;
1911 subspace_asect
->flags
|= SEC_DEBUGGING
;
1913 if (subspace
.code_only
)
1914 subspace_asect
->flags
|= SEC_CODE
;
1916 /* Both file_loc_init_value and initialization_length will
1917 be zero for a BSS like subspace. */
1918 if (subspace
.file_loc_init_value
== 0
1919 && subspace
.initialization_length
== 0)
1920 subspace_asect
->flags
&= ~(SEC_DATA
| SEC_LOAD
| SEC_HAS_CONTENTS
);
1922 /* This subspace has relocations.
1923 The fixup_request_quantity is a byte count for the number of
1924 entries in the relocation stream; it is not the actual number
1925 of relocations in the subspace. */
1926 if (subspace
.fixup_request_quantity
!= 0)
1928 subspace_asect
->flags
|= SEC_RELOC
;
1929 subspace_asect
->rel_filepos
= subspace
.fixup_request_index
;
1930 som_section_data (subspace_asect
)->reloc_size
1931 = subspace
.fixup_request_quantity
;
1932 /* We can not determine this yet. When we read in the
1933 relocation table the correct value will be filled in. */
1934 subspace_asect
->reloc_count
= -1;
1937 /* Update save_subspace if appropriate. */
1938 if (subspace
.file_loc_init_value
> save_subspace
.file_loc_init_value
)
1939 save_subspace
= subspace
;
1941 subspace_asect
->vma
= subspace
.subspace_start
;
1942 subspace_asect
->_cooked_size
= subspace
.subspace_length
;
1943 subspace_asect
->_raw_size
= subspace
.subspace_length
;
1944 subspace_asect
->filepos
= subspace
.file_loc_init_value
;
1945 subspace_asect
->alignment_power
= log2 (subspace
.alignment
);
1946 if (subspace_asect
->alignment_power
== -1)
1950 /* Yow! there is no subspace within the space which actually
1951 has initialized information in it; this should never happen
1952 as far as I know. */
1953 if (!save_subspace
.file_loc_init_value
)
1956 /* Setup the sizes for the space section based upon the info in the
1957 last subspace of the space. */
1958 space_asect
->_cooked_size
= save_subspace
.subspace_start
1959 - space_asect
->vma
+ save_subspace
.subspace_length
;
1960 space_asect
->_raw_size
= save_subspace
.file_loc_init_value
1961 - space_asect
->filepos
+ save_subspace
.initialization_length
;
1963 /* Now that we've read in all the subspace records, we need to assign
1964 a target index to each subspace. */
1965 subspace_sections
= (asection
**) malloc (total_subspaces
1966 * sizeof (asection
*));
1967 if (subspace_sections
== NULL
)
1970 for (i
= 0, section
= abfd
->sections
; section
; section
= section
->next
)
1972 if (!som_is_subspace (section
))
1975 subspace_sections
[i
] = section
;
1978 qsort (subspace_sections
, total_subspaces
,
1979 sizeof (asection
*), compare_subspaces
);
1981 /* subspace_sections is now sorted in the order in which the subspaces
1982 appear in the object file. Assign an index to each one now. */
1983 for (i
= 0; i
< total_subspaces
; i
++)
1984 subspace_sections
[i
]->target_index
= i
;
1986 if (space_strings
!= NULL
)
1987 free (space_strings
);
1989 if (subspace_sections
!= NULL
)
1990 free (subspace_sections
);
1995 if (space_strings
!= NULL
)
1996 free (space_strings
);
1998 if (subspace_sections
!= NULL
)
1999 free (subspace_sections
);
2003 /* Read in a SOM object and make it into a BFD. */
2005 static const bfd_target
*
2009 struct header file_hdr
;
2010 struct som_exec_auxhdr aux_hdr
;
2012 if (bfd_read ((PTR
) & file_hdr
, 1, FILE_HDR_SIZE
, abfd
) != FILE_HDR_SIZE
)
2014 if (bfd_get_error () != bfd_error_system_call
)
2015 bfd_set_error (bfd_error_wrong_format
);
2019 if (!_PA_RISC_ID (file_hdr
.system_id
))
2021 bfd_set_error (bfd_error_wrong_format
);
2025 switch (file_hdr
.a_magic
)
2040 #ifdef SHARED_MAGIC_CNX
2041 case SHARED_MAGIC_CNX
:
2045 bfd_set_error (bfd_error_wrong_format
);
2049 if (file_hdr
.version_id
!= VERSION_ID
2050 && file_hdr
.version_id
!= NEW_VERSION_ID
)
2052 bfd_set_error (bfd_error_wrong_format
);
2056 /* If the aux_header_size field in the file header is zero, then this
2057 object is an incomplete executable (a .o file). Do not try to read
2058 a non-existant auxiliary header. */
2059 memset (&aux_hdr
, 0, sizeof (struct som_exec_auxhdr
));
2060 if (file_hdr
.aux_header_size
!= 0)
2062 if (bfd_read ((PTR
) & aux_hdr
, 1, AUX_HDR_SIZE
, abfd
) != AUX_HDR_SIZE
)
2064 if (bfd_get_error () != bfd_error_system_call
)
2065 bfd_set_error (bfd_error_wrong_format
);
2070 if (!setup_sections (abfd
, &file_hdr
))
2072 /* setup_sections does not bubble up a bfd error code. */
2073 bfd_set_error (bfd_error_bad_value
);
2077 /* This appears to be a valid SOM object. Do some initialization. */
2078 return som_object_setup (abfd
, &file_hdr
, &aux_hdr
);
2081 /* Create a SOM object. */
2087 /* Allocate memory to hold backend information. */
2088 abfd
->tdata
.som_data
= (struct som_data_struct
*)
2089 bfd_zalloc (abfd
, sizeof (struct som_data_struct
));
2090 if (abfd
->tdata
.som_data
== NULL
)
2092 bfd_set_error (bfd_error_no_memory
);
2098 /* Initialize some information in the file header. This routine makes
2099 not attempt at doing the right thing for a full executable; it
2100 is only meant to handle relocatable objects. */
2103 som_prep_headers (abfd
)
2106 struct header
*file_hdr
;
2109 /* Make and attach a file header to the BFD. */
2110 file_hdr
= (struct header
*) bfd_zalloc (abfd
, sizeof (struct header
));
2111 if (file_hdr
== NULL
)
2114 bfd_set_error (bfd_error_no_memory
);
2117 obj_som_file_hdr (abfd
) = file_hdr
;
2119 if (abfd
->flags
& (EXEC_P
| DYNAMIC
))
2122 /* Make and attach an exec header to the BFD. */
2123 obj_som_exec_hdr (abfd
) = (struct som_exec_auxhdr
*)
2124 bfd_zalloc (abfd
, sizeof (struct som_exec_auxhdr
));
2125 if (obj_som_exec_hdr (abfd
) == NULL
)
2127 bfd_set_error (bfd_error_no_memory
);
2131 if (abfd
->flags
& D_PAGED
)
2132 file_hdr
->a_magic
= DEMAND_MAGIC
;
2133 else if (abfd
->flags
& WP_TEXT
)
2134 file_hdr
->a_magic
= SHARE_MAGIC
;
2136 else if (abfd
->flags
& DYNAMIC
)
2137 file_hdr
->a_magic
= SHL_MAGIC
;
2140 file_hdr
->a_magic
= EXEC_MAGIC
;
2143 file_hdr
->a_magic
= RELOC_MAGIC
;
2145 /* Only new format SOM is supported. */
2146 file_hdr
->version_id
= NEW_VERSION_ID
;
2148 /* These fields are optional, and embedding timestamps is not always
2149 a wise thing to do, it makes comparing objects during a multi-stage
2150 bootstrap difficult. */
2151 file_hdr
->file_time
.secs
= 0;
2152 file_hdr
->file_time
.nanosecs
= 0;
2154 file_hdr
->entry_space
= 0;
2155 file_hdr
->entry_subspace
= 0;
2156 file_hdr
->entry_offset
= 0;
2157 file_hdr
->presumed_dp
= 0;
2159 /* Now iterate over the sections translating information from
2160 BFD sections to SOM spaces/subspaces. */
2162 for (section
= abfd
->sections
; section
!= NULL
; section
= section
->next
)
2164 /* Ignore anything which has not been marked as a space or
2166 if (!som_is_space (section
) && !som_is_subspace (section
))
2169 if (som_is_space (section
))
2171 /* Allocate space for the space dictionary. */
2172 som_section_data (section
)->space_dict
2173 = (struct space_dictionary_record
*)
2174 bfd_zalloc (abfd
, sizeof (struct space_dictionary_record
));
2175 if (som_section_data (section
)->space_dict
== NULL
)
2177 bfd_set_error (bfd_error_no_memory
);
2180 /* Set space attributes. Note most attributes of SOM spaces
2181 are set based on the subspaces it contains. */
2182 som_section_data (section
)->space_dict
->loader_fix_index
= -1;
2183 som_section_data (section
)->space_dict
->init_pointer_index
= -1;
2185 /* Set more attributes that were stuffed away in private data. */
2186 som_section_data (section
)->space_dict
->sort_key
=
2187 som_section_data (section
)->copy_data
->sort_key
;
2188 som_section_data (section
)->space_dict
->is_defined
=
2189 som_section_data (section
)->copy_data
->is_defined
;
2190 som_section_data (section
)->space_dict
->is_private
=
2191 som_section_data (section
)->copy_data
->is_private
;
2192 som_section_data (section
)->space_dict
->space_number
=
2193 som_section_data (section
)->copy_data
->space_number
;
2197 /* Allocate space for the subspace dictionary. */
2198 som_section_data (section
)->subspace_dict
2199 = (struct subspace_dictionary_record
*)
2200 bfd_zalloc (abfd
, sizeof (struct subspace_dictionary_record
));
2201 if (som_section_data (section
)->subspace_dict
== NULL
)
2203 bfd_set_error (bfd_error_no_memory
);
2207 /* Set subspace attributes. Basic stuff is done here, additional
2208 attributes are filled in later as more information becomes
2210 if (section
->flags
& SEC_IS_COMMON
)
2212 som_section_data (section
)->subspace_dict
->dup_common
= 1;
2213 som_section_data (section
)->subspace_dict
->is_common
= 1;
2216 if (section
->flags
& SEC_ALLOC
)
2217 som_section_data (section
)->subspace_dict
->is_loadable
= 1;
2219 if (section
->flags
& SEC_CODE
)
2220 som_section_data (section
)->subspace_dict
->code_only
= 1;
2222 som_section_data (section
)->subspace_dict
->subspace_start
=
2224 som_section_data (section
)->subspace_dict
->subspace_length
=
2225 bfd_section_size (abfd
, section
);
2226 som_section_data (section
)->subspace_dict
->initialization_length
=
2227 bfd_section_size (abfd
, section
);
2228 som_section_data (section
)->subspace_dict
->alignment
=
2229 1 << section
->alignment_power
;
2231 /* Set more attributes that were stuffed away in private data. */
2232 som_section_data (section
)->subspace_dict
->sort_key
=
2233 som_section_data (section
)->copy_data
->sort_key
;
2234 som_section_data (section
)->subspace_dict
->access_control_bits
=
2235 som_section_data (section
)->copy_data
->access_control_bits
;
2236 som_section_data (section
)->subspace_dict
->quadrant
=
2237 som_section_data (section
)->copy_data
->quadrant
;
2243 /* Return true if the given section is a SOM space, false otherwise. */
2246 som_is_space (section
)
2249 /* If no copy data is available, then it's neither a space nor a
2251 if (som_section_data (section
)->copy_data
== NULL
)
2254 /* If the containing space isn't the same as the given section,
2255 then this isn't a space. */
2256 if (som_section_data (section
)->copy_data
->container
!= section
2257 && (som_section_data (section
)->copy_data
->container
->output_section
2261 /* OK. Must be a space. */
2265 /* Return true if the given section is a SOM subspace, false otherwise. */
2268 som_is_subspace (section
)
2271 /* If no copy data is available, then it's neither a space nor a
2273 if (som_section_data (section
)->copy_data
== NULL
)
2276 /* If the containing space is the same as the given section,
2277 then this isn't a subspace. */
2278 if (som_section_data (section
)->copy_data
->container
== section
2279 || (som_section_data (section
)->copy_data
->container
->output_section
2283 /* OK. Must be a subspace. */
2287 /* Return true if the given space containins the given subspace. It
2288 is safe to assume space really is a space, and subspace really
2292 som_is_container (space
, subspace
)
2293 asection
*space
, *subspace
;
2295 return (som_section_data (subspace
)->copy_data
->container
== space
2296 || (som_section_data (subspace
)->copy_data
->container
->output_section
2300 /* Count and return the number of spaces attached to the given BFD. */
2302 static unsigned long
2303 som_count_spaces (abfd
)
2309 for (section
= abfd
->sections
; section
!= NULL
; section
= section
->next
)
2310 count
+= som_is_space (section
);
2315 /* Count the number of subspaces attached to the given BFD. */
2317 static unsigned long
2318 som_count_subspaces (abfd
)
2324 for (section
= abfd
->sections
; section
!= NULL
; section
= section
->next
)
2325 count
+= som_is_subspace (section
);
2330 /* Return -1, 0, 1 indicating the relative ordering of sym1 and sym2.
2332 We desire symbols to be ordered starting with the symbol with the
2333 highest relocation count down to the symbol with the lowest relocation
2334 count. Doing so compacts the relocation stream. */
2337 compare_syms (arg1
, arg2
)
2342 asymbol
**sym1
= (asymbol
**) arg1
;
2343 asymbol
**sym2
= (asymbol
**) arg2
;
2344 unsigned int count1
, count2
;
2346 /* Get relocation count for each symbol. Note that the count
2347 is stored in the udata pointer for section symbols! */
2348 if ((*sym1
)->flags
& BSF_SECTION_SYM
)
2349 count1
= (*sym1
)->udata
.i
;
2351 count1
= som_symbol_data (*sym1
)->reloc_count
;
2353 if ((*sym2
)->flags
& BSF_SECTION_SYM
)
2354 count2
= (*sym2
)->udata
.i
;
2356 count2
= som_symbol_data (*sym2
)->reloc_count
;
2358 /* Return the appropriate value. */
2359 if (count1
< count2
)
2361 else if (count1
> count2
)
2366 /* Return -1, 0, 1 indicating the relative ordering of subspace1
2370 compare_subspaces (arg1
, arg2
)
2375 asection
**subspace1
= (asection
**) arg1
;
2376 asection
**subspace2
= (asection
**) arg2
;
2377 unsigned int count1
, count2
;
2379 if ((*subspace1
)->target_index
< (*subspace2
)->target_index
)
2381 else if ((*subspace2
)->target_index
< (*subspace1
)->target_index
)
2387 /* Perform various work in preparation for emitting the fixup stream. */
2390 som_prep_for_fixups (abfd
, syms
, num_syms
)
2393 unsigned long num_syms
;
2397 asymbol
**sorted_syms
;
2399 /* Most SOM relocations involving a symbol have a length which is
2400 dependent on the index of the symbol. So symbols which are
2401 used often in relocations should have a small index. */
2403 /* First initialize the counters for each symbol. */
2404 for (i
= 0; i
< num_syms
; i
++)
2406 /* Handle a section symbol; these have no pointers back to the
2407 SOM symbol info. So we just use the udata field to hold the
2408 relocation count. */
2409 if (som_symbol_data (syms
[i
]) == NULL
2410 || syms
[i
]->flags
& BSF_SECTION_SYM
)
2412 syms
[i
]->flags
|= BSF_SECTION_SYM
;
2413 syms
[i
]->udata
.i
= 0;
2416 som_symbol_data (syms
[i
])->reloc_count
= 0;
2419 /* Now that the counters are initialized, make a weighted count
2420 of how often a given symbol is used in a relocation. */
2421 for (section
= abfd
->sections
; section
!= NULL
; section
= section
->next
)
2425 /* Does this section have any relocations? */
2426 if (section
->reloc_count
<= 0)
2429 /* Walk through each relocation for this section. */
2430 for (i
= 1; i
< section
->reloc_count
; i
++)
2432 arelent
*reloc
= section
->orelocation
[i
];
2435 /* A relocation against a symbol in the *ABS* section really
2436 does not have a symbol. Likewise if the symbol isn't associated
2437 with any section. */
2438 if (reloc
->sym_ptr_ptr
== NULL
2439 || bfd_is_abs_section ((*reloc
->sym_ptr_ptr
)->section
))
2442 /* Scaling to encourage symbols involved in R_DP_RELATIVE
2443 and R_CODE_ONE_SYMBOL relocations to come first. These
2444 two relocations have single byte versions if the symbol
2445 index is very small. */
2446 if (reloc
->howto
->type
== R_DP_RELATIVE
2447 || reloc
->howto
->type
== R_CODE_ONE_SYMBOL
)
2452 /* Handle section symbols by storing the count in the udata
2453 field. It will not be used and the count is very important
2454 for these symbols. */
2455 if ((*reloc
->sym_ptr_ptr
)->flags
& BSF_SECTION_SYM
)
2457 (*reloc
->sym_ptr_ptr
)->udata
.i
=
2458 (*reloc
->sym_ptr_ptr
)->udata
.i
+ scale
;
2462 /* A normal symbol. Increment the count. */
2463 som_symbol_data (*reloc
->sym_ptr_ptr
)->reloc_count
+= scale
;
2467 /* Sort a copy of the symbol table, rather than the canonical
2468 output symbol table. */
2469 sorted_syms
= (asymbol
**) bfd_zalloc (abfd
, num_syms
* sizeof (asymbol
*));
2470 memcpy (sorted_syms
, syms
, num_syms
* sizeof (asymbol
*));
2471 qsort (sorted_syms
, num_syms
, sizeof (asymbol
*), compare_syms
);
2472 obj_som_sorted_syms (abfd
) = sorted_syms
;
2474 /* Compute the symbol indexes, they will be needed by the relocation
2476 for (i
= 0; i
< num_syms
; i
++)
2478 /* A section symbol. Again, there is no pointer to backend symbol
2479 information, so we reuse the udata field again. */
2480 if (sorted_syms
[i
]->flags
& BSF_SECTION_SYM
)
2481 sorted_syms
[i
]->udata
.i
= i
;
2483 som_symbol_data (sorted_syms
[i
])->index
= i
;
2488 som_write_fixups (abfd
, current_offset
, total_reloc_sizep
)
2490 unsigned long current_offset
;
2491 unsigned int *total_reloc_sizep
;
2494 /* Chunk of memory that we can use as buffer space, then throw
2496 unsigned char tmp_space
[SOM_TMP_BUFSIZE
];
2498 unsigned int total_reloc_size
= 0;
2499 unsigned int subspace_reloc_size
= 0;
2500 unsigned int num_spaces
= obj_som_file_hdr (abfd
)->space_total
;
2501 asection
*section
= abfd
->sections
;
2503 memset (tmp_space
, 0, SOM_TMP_BUFSIZE
);
2506 /* All the fixups for a particular subspace are emitted in a single
2507 stream. All the subspaces for a particular space are emitted
2510 So, to get all the locations correct one must iterate through all the
2511 spaces, for each space iterate through its subspaces and output a
2513 for (i
= 0; i
< num_spaces
; i
++)
2515 asection
*subsection
;
2518 while (!som_is_space (section
))
2519 section
= section
->next
;
2521 /* Now iterate through each of its subspaces. */
2522 for (subsection
= abfd
->sections
;
2524 subsection
= subsection
->next
)
2526 int reloc_offset
, current_rounding_mode
;
2528 /* Find a subspace of this space. */
2529 if (!som_is_subspace (subsection
)
2530 || !som_is_container (section
, subsection
))
2533 /* If this subspace does not have real data, then we are
2535 if ((subsection
->flags
& SEC_HAS_CONTENTS
) == 0)
2537 som_section_data (subsection
)->subspace_dict
->fixup_request_index
2542 /* This subspace has some relocations. Put the relocation stream
2543 index into the subspace record. */
2544 som_section_data (subsection
)->subspace_dict
->fixup_request_index
2547 /* To make life easier start over with a clean slate for
2548 each subspace. Seek to the start of the relocation stream
2549 for this subspace in preparation for writing out its fixup
2551 if (bfd_seek (abfd
, current_offset
+ total_reloc_size
, SEEK_SET
) < 0)
2554 /* Buffer space has already been allocated. Just perform some
2555 initialization here. */
2557 subspace_reloc_size
= 0;
2559 som_initialize_reloc_queue (reloc_queue
);
2560 current_rounding_mode
= R_N_MODE
;
2562 /* Translate each BFD relocation into one or more SOM
2564 for (j
= 0; j
< subsection
->reloc_count
; j
++)
2566 arelent
*bfd_reloc
= subsection
->orelocation
[j
];
2570 /* Get the symbol number. Remember it's stored in a
2571 special place for section symbols. */
2572 if ((*bfd_reloc
->sym_ptr_ptr
)->flags
& BSF_SECTION_SYM
)
2573 sym_num
= (*bfd_reloc
->sym_ptr_ptr
)->udata
.i
;
2575 sym_num
= som_symbol_data (*bfd_reloc
->sym_ptr_ptr
)->index
;
2577 /* If there is not enough room for the next couple relocations,
2578 then dump the current buffer contents now. Also reinitialize
2579 the relocation queue.
2581 No single BFD relocation could ever translate into more
2582 than 100 bytes of SOM relocations (20bytes is probably the
2583 upper limit, but leave lots of space for growth). */
2584 if (p
- tmp_space
+ 100 > SOM_TMP_BUFSIZE
)
2586 if (bfd_write ((PTR
) tmp_space
, p
- tmp_space
, 1, abfd
)
2591 som_initialize_reloc_queue (reloc_queue
);
2594 /* Emit R_NO_RELOCATION fixups to map any bytes which were
2596 skip
= bfd_reloc
->address
- reloc_offset
;
2597 p
= som_reloc_skip (abfd
, skip
, p
,
2598 &subspace_reloc_size
, reloc_queue
);
2600 /* Update reloc_offset for the next iteration.
2602 Many relocations do not consume input bytes. They
2603 are markers, or set state necessary to perform some
2604 later relocation. */
2605 switch (bfd_reloc
->howto
->type
)
2607 /* This only needs to handle relocations that may be
2608 made by hppa_som_gen_reloc. */
2623 reloc_offset
= bfd_reloc
->address
;
2627 reloc_offset
= bfd_reloc
->address
+ 4;
2631 /* Now the actual relocation we care about. */
2632 switch (bfd_reloc
->howto
->type
)
2636 p
= som_reloc_call (abfd
, p
, &subspace_reloc_size
,
2637 bfd_reloc
, sym_num
, reloc_queue
);
2640 case R_CODE_ONE_SYMBOL
:
2642 /* Account for any addend. */
2643 if (bfd_reloc
->addend
)
2644 p
= som_reloc_addend (abfd
, bfd_reloc
->addend
, p
,
2645 &subspace_reloc_size
, reloc_queue
);
2649 bfd_put_8 (abfd
, bfd_reloc
->howto
->type
+ sym_num
, p
);
2650 subspace_reloc_size
+= 1;
2653 else if (sym_num
< 0x100)
2655 bfd_put_8 (abfd
, bfd_reloc
->howto
->type
+ 32, p
);
2656 bfd_put_8 (abfd
, sym_num
, p
+ 1);
2657 p
= try_prev_fixup (abfd
, &subspace_reloc_size
, p
,
2660 else if (sym_num
< 0x10000000)
2662 bfd_put_8 (abfd
, bfd_reloc
->howto
->type
+ 33, p
);
2663 bfd_put_8 (abfd
, sym_num
>> 16, p
+ 1);
2664 bfd_put_16 (abfd
, sym_num
, p
+ 2);
2665 p
= try_prev_fixup (abfd
, &subspace_reloc_size
,
2672 case R_DATA_ONE_SYMBOL
:
2676 /* Account for any addend using R_DATA_OVERRIDE. */
2677 if (bfd_reloc
->howto
->type
!= R_DATA_ONE_SYMBOL
2678 && bfd_reloc
->addend
)
2679 p
= som_reloc_addend (abfd
, bfd_reloc
->addend
, p
,
2680 &subspace_reloc_size
, reloc_queue
);
2682 if (sym_num
< 0x100)
2684 bfd_put_8 (abfd
, bfd_reloc
->howto
->type
, p
);
2685 bfd_put_8 (abfd
, sym_num
, p
+ 1);
2686 p
= try_prev_fixup (abfd
, &subspace_reloc_size
, p
,
2689 else if (sym_num
< 0x10000000)
2691 bfd_put_8 (abfd
, bfd_reloc
->howto
->type
+ 1, p
);
2692 bfd_put_8 (abfd
, sym_num
>> 16, p
+ 1);
2693 bfd_put_16 (abfd
, sym_num
, p
+ 2);
2694 p
= try_prev_fixup (abfd
, &subspace_reloc_size
,
2704 arelent
*tmp_reloc
= NULL
;
2705 bfd_put_8 (abfd
, R_ENTRY
, p
);
2707 /* R_ENTRY relocations have 64 bits of associated
2708 data. Unfortunately the addend field of a bfd
2709 relocation is only 32 bits. So, we split up
2710 the 64bit unwind information and store part in
2711 the R_ENTRY relocation, and the rest in the R_EXIT
2713 bfd_put_32 (abfd
, bfd_reloc
->addend
, p
+ 1);
2715 /* Find the next R_EXIT relocation. */
2716 for (tmp
= j
; tmp
< subsection
->reloc_count
; tmp
++)
2718 tmp_reloc
= subsection
->orelocation
[tmp
];
2719 if (tmp_reloc
->howto
->type
== R_EXIT
)
2723 if (tmp
== subsection
->reloc_count
)
2726 bfd_put_32 (abfd
, tmp_reloc
->addend
, p
+ 5);
2727 p
= try_prev_fixup (abfd
, &subspace_reloc_size
,
2736 /* If this relocation requests the current rounding
2737 mode, then it is redundant. */
2738 if (bfd_reloc
->howto
->type
!= current_rounding_mode
)
2740 bfd_put_8 (abfd
, bfd_reloc
->howto
->type
, p
);
2741 subspace_reloc_size
+= 1;
2743 current_rounding_mode
= bfd_reloc
->howto
->type
;
2754 bfd_put_8 (abfd
, bfd_reloc
->howto
->type
, p
);
2755 subspace_reloc_size
+= 1;
2760 /* The only time we generate R_COMP1, R_COMP2 and
2761 R_CODE_EXPR relocs is for the difference of two
2762 symbols. Hence we can cheat here. */
2763 bfd_put_8 (abfd
, bfd_reloc
->howto
->type
, p
);
2764 bfd_put_8 (abfd
, 0x44, p
+ 1);
2765 p
= try_prev_fixup (abfd
, &subspace_reloc_size
,
2770 /* The only time we generate R_COMP1, R_COMP2 and
2771 R_CODE_EXPR relocs is for the difference of two
2772 symbols. Hence we can cheat here. */
2773 bfd_put_8 (abfd
, bfd_reloc
->howto
->type
, p
);
2774 bfd_put_8 (abfd
, 0x80, p
+ 1);
2775 bfd_put_8 (abfd
, sym_num
>> 16, p
+ 2);
2776 bfd_put_16 (abfd
, sym_num
, p
+ 3);
2777 p
= try_prev_fixup (abfd
, &subspace_reloc_size
,
2782 /* The only time we generate R_COMP1, R_COMP2 and
2783 R_CODE_EXPR relocs is for the difference of two
2784 symbols. Hence we can cheat here. */
2785 bfd_put_8 (abfd
, bfd_reloc
->howto
->type
, p
);
2786 subspace_reloc_size
+= 1;
2790 /* Put a "R_RESERVED" relocation in the stream if
2791 we hit something we do not understand. The linker
2792 will complain loudly if this ever happens. */
2794 bfd_put_8 (abfd
, 0xff, p
);
2795 subspace_reloc_size
+= 1;
2801 /* Last BFD relocation for a subspace has been processed.
2802 Map the rest of the subspace with R_NO_RELOCATION fixups. */
2803 p
= som_reloc_skip (abfd
, bfd_section_size (abfd
, subsection
)
2805 p
, &subspace_reloc_size
, reloc_queue
);
2807 /* Scribble out the relocations. */
2808 if (bfd_write ((PTR
) tmp_space
, p
- tmp_space
, 1, abfd
)
2813 total_reloc_size
+= subspace_reloc_size
;
2814 som_section_data (subsection
)->subspace_dict
->fixup_request_quantity
2815 = subspace_reloc_size
;
2817 section
= section
->next
;
2819 *total_reloc_sizep
= total_reloc_size
;
2823 /* Write out the space/subspace string table. */
2826 som_write_space_strings (abfd
, current_offset
, string_sizep
)
2828 unsigned long current_offset
;
2829 unsigned int *string_sizep
;
2831 /* Chunk of memory that we can use as buffer space, then throw
2833 unsigned char tmp_space
[SOM_TMP_BUFSIZE
];
2835 unsigned int strings_size
= 0;
2838 memset (tmp_space
, 0, SOM_TMP_BUFSIZE
);
2841 /* Seek to the start of the space strings in preparation for writing
2843 if (bfd_seek (abfd
, current_offset
, SEEK_SET
) < 0)
2846 /* Walk through all the spaces and subspaces (order is not important)
2847 building up and writing string table entries for their names. */
2848 for (section
= abfd
->sections
; section
!= NULL
; section
= section
->next
)
2852 /* Only work with space/subspaces; avoid any other sections
2853 which might have been made (.text for example). */
2854 if (!som_is_space (section
) && !som_is_subspace (section
))
2857 /* Get the length of the space/subspace name. */
2858 length
= strlen (section
->name
);
2860 /* If there is not enough room for the next entry, then dump the
2861 current buffer contents now. Each entry will take 4 bytes to
2862 hold the string length + the string itself + null terminator. */
2863 if (p
- tmp_space
+ 5 + length
> SOM_TMP_BUFSIZE
)
2865 if (bfd_write ((PTR
) &tmp_space
[0], p
- tmp_space
, 1, abfd
)
2868 /* Reset to beginning of the buffer space. */
2872 /* First element in a string table entry is the length of the
2873 string. Alignment issues are already handled. */
2874 bfd_put_32 (abfd
, length
, p
);
2878 /* Record the index in the space/subspace records. */
2879 if (som_is_space (section
))
2880 som_section_data (section
)->space_dict
->name
.n_strx
= strings_size
;
2882 som_section_data (section
)->subspace_dict
->name
.n_strx
= strings_size
;
2884 /* Next comes the string itself + a null terminator. */
2885 strcpy (p
, section
->name
);
2887 strings_size
+= length
+ 1;
2889 /* Always align up to the next word boundary. */
2890 while (strings_size
% 4)
2892 bfd_put_8 (abfd
, 0, p
);
2898 /* Done with the space/subspace strings. Write out any information
2899 contained in a partial block. */
2900 if (bfd_write ((PTR
) &tmp_space
[0], p
- tmp_space
, 1, abfd
) != p
- tmp_space
)
2902 *string_sizep
= strings_size
;
2906 /* Write out the symbol string table. */
2909 som_write_symbol_strings (abfd
, current_offset
, syms
, num_syms
, string_sizep
)
2911 unsigned long current_offset
;
2913 unsigned int num_syms
;
2914 unsigned int *string_sizep
;
2918 /* Chunk of memory that we can use as buffer space, then throw
2920 unsigned char tmp_space
[SOM_TMP_BUFSIZE
];
2922 unsigned int strings_size
= 0;
2924 memset (tmp_space
, 0, SOM_TMP_BUFSIZE
);
2927 /* Seek to the start of the space strings in preparation for writing
2929 if (bfd_seek (abfd
, current_offset
, SEEK_SET
) < 0)
2932 for (i
= 0; i
< num_syms
; i
++)
2934 int length
= strlen (syms
[i
]->name
);
2936 /* If there is not enough room for the next entry, then dump the
2937 current buffer contents now. */
2938 if (p
- tmp_space
+ 5 + length
> SOM_TMP_BUFSIZE
)
2940 if (bfd_write ((PTR
) &tmp_space
[0], p
- tmp_space
, 1, abfd
)
2943 /* Reset to beginning of the buffer space. */
2947 /* First element in a string table entry is the length of the
2948 string. This must always be 4 byte aligned. This is also
2949 an appropriate time to fill in the string index field in the
2950 symbol table entry. */
2951 bfd_put_32 (abfd
, length
, p
);
2955 /* Next comes the string itself + a null terminator. */
2956 strcpy (p
, syms
[i
]->name
);
2958 som_symbol_data(syms
[i
])->stringtab_offset
= strings_size
;
2960 strings_size
+= length
+ 1;
2962 /* Always align up to the next word boundary. */
2963 while (strings_size
% 4)
2965 bfd_put_8 (abfd
, 0, p
);
2971 /* Scribble out any partial block. */
2972 if (bfd_write ((PTR
) &tmp_space
[0], p
- tmp_space
, 1, abfd
) != p
- tmp_space
)
2975 *string_sizep
= strings_size
;
2979 /* Compute variable information to be placed in the SOM headers,
2980 space/subspace dictionaries, relocation streams, etc. Begin
2981 writing parts of the object file. */
2984 som_begin_writing (abfd
)
2987 unsigned long current_offset
= 0;
2988 int strings_size
= 0;
2989 unsigned int total_reloc_size
= 0;
2990 unsigned long num_spaces
, num_subspaces
, i
;
2992 unsigned int total_subspaces
= 0;
2993 struct som_exec_auxhdr
*exec_header
= NULL
;
2995 /* The file header will always be first in an object file,
2996 everything else can be in random locations. To keep things
2997 "simple" BFD will lay out the object file in the manner suggested
2998 by the PRO ABI for PA-RISC Systems. */
3000 /* Before any output can really begin offsets for all the major
3001 portions of the object file must be computed. So, starting
3002 with the initial file header compute (and sometimes write)
3003 each portion of the object file. */
3005 /* Make room for the file header, it's contents are not complete
3006 yet, so it can not be written at this time. */
3007 current_offset
+= sizeof (struct header
);
3009 /* Any auxiliary headers will follow the file header. Right now
3010 we support only the copyright and version headers. */
3011 obj_som_file_hdr (abfd
)->aux_header_location
= current_offset
;
3012 obj_som_file_hdr (abfd
)->aux_header_size
= 0;
3013 if (abfd
->flags
& (EXEC_P
| DYNAMIC
))
3015 /* Parts of the exec header will be filled in later, so
3016 delay writing the header itself. Fill in the defaults,
3017 and write it later. */
3018 current_offset
+= sizeof (struct som_exec_auxhdr
);
3019 obj_som_file_hdr (abfd
)->aux_header_size
3020 += sizeof (struct som_exec_auxhdr
);
3021 exec_header
= obj_som_exec_hdr (abfd
);
3022 exec_header
->som_auxhdr
.type
= EXEC_AUX_ID
;
3023 exec_header
->som_auxhdr
.length
= 40;
3025 if (obj_som_version_hdr (abfd
) != NULL
)
3029 if (bfd_seek (abfd
, current_offset
, SEEK_SET
) < 0)
3032 /* Write the aux_id structure and the string length. */
3033 len
= sizeof (struct aux_id
) + sizeof (unsigned int);
3034 obj_som_file_hdr (abfd
)->aux_header_size
+= len
;
3035 current_offset
+= len
;
3036 if (bfd_write ((PTR
) obj_som_version_hdr (abfd
), len
, 1, abfd
) != len
)
3039 /* Write the version string. */
3040 len
= obj_som_version_hdr (abfd
)->header_id
.length
- sizeof (int);
3041 obj_som_file_hdr (abfd
)->aux_header_size
+= len
;
3042 current_offset
+= len
;
3043 if (bfd_write ((PTR
) obj_som_version_hdr (abfd
)->user_string
,
3044 len
, 1, abfd
) != len
)
3048 if (obj_som_copyright_hdr (abfd
) != NULL
)
3052 if (bfd_seek (abfd
, current_offset
, SEEK_SET
) < 0)
3055 /* Write the aux_id structure and the string length. */
3056 len
= sizeof (struct aux_id
) + sizeof (unsigned int);
3057 obj_som_file_hdr (abfd
)->aux_header_size
+= len
;
3058 current_offset
+= len
;
3059 if (bfd_write ((PTR
) obj_som_copyright_hdr (abfd
), len
, 1, abfd
) != len
)
3062 /* Write the copyright string. */
3063 len
= obj_som_copyright_hdr (abfd
)->header_id
.length
- sizeof (int);
3064 obj_som_file_hdr (abfd
)->aux_header_size
+= len
;
3065 current_offset
+= len
;
3066 if (bfd_write ((PTR
) obj_som_copyright_hdr (abfd
)->copyright
,
3067 len
, 1, abfd
) != len
)
3071 /* Next comes the initialization pointers; we have no initialization
3072 pointers, so current offset does not change. */
3073 obj_som_file_hdr (abfd
)->init_array_location
= current_offset
;
3074 obj_som_file_hdr (abfd
)->init_array_total
= 0;
3076 /* Next are the space records. These are fixed length records.
3078 Count the number of spaces to determine how much room is needed
3079 in the object file for the space records.
3081 The names of the spaces are stored in a separate string table,
3082 and the index for each space into the string table is computed
3083 below. Therefore, it is not possible to write the space headers
3085 num_spaces
= som_count_spaces (abfd
);
3086 obj_som_file_hdr (abfd
)->space_location
= current_offset
;
3087 obj_som_file_hdr (abfd
)->space_total
= num_spaces
;
3088 current_offset
+= num_spaces
* sizeof (struct space_dictionary_record
);
3090 /* Next are the subspace records. These are fixed length records.
3092 Count the number of subspaes to determine how much room is needed
3093 in the object file for the subspace records.
3095 A variety if fields in the subspace record are still unknown at
3096 this time (index into string table, fixup stream location/size, etc). */
3097 num_subspaces
= som_count_subspaces (abfd
);
3098 obj_som_file_hdr (abfd
)->subspace_location
= current_offset
;
3099 obj_som_file_hdr (abfd
)->subspace_total
= num_subspaces
;
3100 current_offset
+= num_subspaces
* sizeof (struct subspace_dictionary_record
);
3102 /* Next is the string table for the space/subspace names. We will
3103 build and write the string table on the fly. At the same time
3104 we will fill in the space/subspace name index fields. */
3106 /* The string table needs to be aligned on a word boundary. */
3107 if (current_offset
% 4)
3108 current_offset
+= (4 - (current_offset
% 4));
3110 /* Mark the offset of the space/subspace string table in the
3112 obj_som_file_hdr (abfd
)->space_strings_location
= current_offset
;
3114 /* Scribble out the space strings. */
3115 if (som_write_space_strings (abfd
, current_offset
, &strings_size
) == false)
3118 /* Record total string table size in the header and update the
3120 obj_som_file_hdr (abfd
)->space_strings_size
= strings_size
;
3121 current_offset
+= strings_size
;
3123 /* Next is the compiler records. We do not use these. */
3124 obj_som_file_hdr (abfd
)->compiler_location
= current_offset
;
3125 obj_som_file_hdr (abfd
)->compiler_total
= 0;
3127 /* Now compute the file positions for the loadable subspaces, taking
3128 care to make sure everything stays properly aligned. */
3130 section
= abfd
->sections
;
3131 for (i
= 0; i
< num_spaces
; i
++)
3133 asection
*subsection
;
3135 unsigned int subspace_offset
= 0;
3138 while (!som_is_space (section
))
3139 section
= section
->next
;
3142 /* Now look for all its subspaces. */
3143 for (subsection
= abfd
->sections
;
3145 subsection
= subsection
->next
)
3148 if (!som_is_subspace (subsection
)
3149 || !som_is_container (section
, subsection
)
3150 || (subsection
->flags
& SEC_ALLOC
) == 0)
3153 /* If this is the first subspace in the space, and we are
3154 building an executable, then take care to make sure all
3155 the alignments are correct and update the exec header. */
3157 && (abfd
->flags
& (EXEC_P
| DYNAMIC
)))
3159 /* Demand paged executables have each space aligned to a
3160 page boundary. Sharable executables (write-protected
3161 text) have just the private (aka data & bss) space aligned
3162 to a page boundary. Ugh. Not true for HPUX.
3164 The HPUX kernel requires the text to always be page aligned
3165 within the file regardless of the executable's type. */
3166 if (abfd
->flags
& (D_PAGED
| DYNAMIC
)
3167 || (subsection
->flags
& SEC_CODE
)
3168 || ((abfd
->flags
& WP_TEXT
)
3169 && (subsection
->flags
& SEC_DATA
)))
3170 current_offset
= SOM_ALIGN (current_offset
, PA_PAGESIZE
);
3172 /* Update the exec header. */
3173 if (subsection
->flags
& SEC_CODE
&& exec_header
->exec_tfile
== 0)
3175 exec_header
->exec_tmem
= section
->vma
;
3176 exec_header
->exec_tfile
= current_offset
;
3178 if (subsection
->flags
& SEC_DATA
&& exec_header
->exec_dfile
== 0)
3180 exec_header
->exec_dmem
= section
->vma
;
3181 exec_header
->exec_dfile
= current_offset
;
3184 /* Keep track of exactly where we are within a particular
3185 space. This is necessary as the braindamaged HPUX
3186 loader will create holes between subspaces *and*
3187 subspace alignments are *NOT* preserved. What a crock. */
3188 subspace_offset
= subsection
->vma
;
3190 /* Only do this for the first subspace within each space. */
3193 else if (abfd
->flags
& (EXEC_P
| DYNAMIC
))
3195 /* The braindamaged HPUX loader may have created a hole
3196 between two subspaces. It is *not* sufficient to use
3197 the alignment specifications within the subspaces to
3198 account for these holes -- I've run into at least one
3199 case where the loader left one code subspace unaligned
3200 in a final executable.
3202 To combat this we keep a current offset within each space,
3203 and use the subspace vma fields to detect and preserve
3204 holes. What a crock!
3206 ps. This is not necessary for unloadable space/subspaces. */
3207 current_offset
+= subsection
->vma
- subspace_offset
;
3208 if (subsection
->flags
& SEC_CODE
)
3209 exec_header
->exec_tsize
+= subsection
->vma
- subspace_offset
;
3211 exec_header
->exec_dsize
+= subsection
->vma
- subspace_offset
;
3212 subspace_offset
+= subsection
->vma
- subspace_offset
;
3216 subsection
->target_index
= total_subspaces
++;
3217 /* This is real data to be loaded from the file. */
3218 if (subsection
->flags
& SEC_LOAD
)
3220 /* Update the size of the code & data. */
3221 if (abfd
->flags
& (EXEC_P
| DYNAMIC
)
3222 && subsection
->flags
& SEC_CODE
)
3223 exec_header
->exec_tsize
+= subsection
->_cooked_size
;
3224 else if (abfd
->flags
& (EXEC_P
| DYNAMIC
)
3225 && subsection
->flags
& SEC_DATA
)
3226 exec_header
->exec_dsize
+= subsection
->_cooked_size
;
3227 som_section_data (subsection
)->subspace_dict
->file_loc_init_value
3229 subsection
->filepos
= current_offset
;
3230 current_offset
+= bfd_section_size (abfd
, subsection
);
3231 subspace_offset
+= bfd_section_size (abfd
, subsection
);
3233 /* Looks like uninitialized data. */
3236 /* Update the size of the bss section. */
3237 if (abfd
->flags
& (EXEC_P
| DYNAMIC
))
3238 exec_header
->exec_bsize
+= subsection
->_cooked_size
;
3240 som_section_data (subsection
)->subspace_dict
->file_loc_init_value
3242 som_section_data (subsection
)->subspace_dict
->
3243 initialization_length
= 0;
3246 /* Goto the next section. */
3247 section
= section
->next
;
3250 /* Finally compute the file positions for unloadable subspaces.
3251 If building an executable, start the unloadable stuff on its
3254 if (abfd
->flags
& (EXEC_P
| DYNAMIC
))
3255 current_offset
= SOM_ALIGN (current_offset
, PA_PAGESIZE
);
3257 obj_som_file_hdr (abfd
)->unloadable_sp_location
= current_offset
;
3258 section
= abfd
->sections
;
3259 for (i
= 0; i
< num_spaces
; i
++)
3261 asection
*subsection
;
3264 while (!som_is_space (section
))
3265 section
= section
->next
;
3267 if (abfd
->flags
& (EXEC_P
| DYNAMIC
))
3268 current_offset
= SOM_ALIGN (current_offset
, PA_PAGESIZE
);
3270 /* Now look for all its subspaces. */
3271 for (subsection
= abfd
->sections
;
3273 subsection
= subsection
->next
)
3276 if (!som_is_subspace (subsection
)
3277 || !som_is_container (section
, subsection
)
3278 || (subsection
->flags
& SEC_ALLOC
) != 0)
3281 subsection
->target_index
= total_subspaces
++;
3282 /* This is real data to be loaded from the file. */
3283 if ((subsection
->flags
& SEC_LOAD
) == 0)
3285 som_section_data (subsection
)->subspace_dict
->file_loc_init_value
3287 subsection
->filepos
= current_offset
;
3288 current_offset
+= bfd_section_size (abfd
, subsection
);
3290 /* Looks like uninitialized data. */
3293 som_section_data (subsection
)->subspace_dict
->file_loc_init_value
3295 som_section_data (subsection
)->subspace_dict
->
3296 initialization_length
= bfd_section_size (abfd
, subsection
);
3299 /* Goto the next section. */
3300 section
= section
->next
;
3303 /* If building an executable, then make sure to seek to and write
3304 one byte at the end of the file to make sure any necessary
3305 zeros are filled in. Ugh. */
3306 if (abfd
->flags
& (EXEC_P
| DYNAMIC
))
3307 current_offset
= SOM_ALIGN (current_offset
, PA_PAGESIZE
);
3308 if (bfd_seek (abfd
, current_offset
- 1, SEEK_SET
) < 0)
3310 if (bfd_write ((PTR
) "", 1, 1, abfd
) != 1)
3313 obj_som_file_hdr (abfd
)->unloadable_sp_size
3314 = current_offset
- obj_som_file_hdr (abfd
)->unloadable_sp_location
;
3316 /* Loader fixups are not supported in any way shape or form. */
3317 obj_som_file_hdr (abfd
)->loader_fixup_location
= 0;
3318 obj_som_file_hdr (abfd
)->loader_fixup_total
= 0;
3320 /* Done. Store the total size of the SOM so far. */
3321 obj_som_file_hdr (abfd
)->som_length
= current_offset
;
3326 /* Finally, scribble out the various headers to the disk. */
3329 som_finish_writing (abfd
)
3332 int num_spaces
= som_count_spaces (abfd
);
3333 asymbol
**syms
= bfd_get_outsymbols (abfd
);
3334 int i
, num_syms
, strings_size
;
3335 int subspace_index
= 0;
3338 unsigned long current_offset
;
3339 unsigned int total_reloc_size
;
3341 /* Next is the symbol table. These are fixed length records.
3343 Count the number of symbols to determine how much room is needed
3344 in the object file for the symbol table.
3346 The names of the symbols are stored in a separate string table,
3347 and the index for each symbol name into the string table is computed
3348 below. Therefore, it is not possible to write the symbol table
3351 These used to be output before the subspace contents, but they
3352 were moved here to work around a stupid bug in the hpux linker
3353 (fixed in hpux10). */
3354 current_offset
= obj_som_file_hdr (abfd
)->som_length
;
3356 /* Make sure we're on a word boundary. */
3357 if (current_offset
% 4)
3358 current_offset
+= (4 - (current_offset
% 4));
3360 num_syms
= bfd_get_symcount (abfd
);
3361 obj_som_file_hdr (abfd
)->symbol_location
= current_offset
;
3362 obj_som_file_hdr (abfd
)->symbol_total
= num_syms
;
3363 current_offset
+= num_syms
* sizeof (struct symbol_dictionary_record
);
3365 /* Next are the symbol strings.
3366 Align them to a word boundary. */
3367 if (current_offset
% 4)
3368 current_offset
+= (4 - (current_offset
% 4));
3369 obj_som_file_hdr (abfd
)->symbol_strings_location
= current_offset
;
3371 /* Scribble out the symbol strings. */
3372 if (som_write_symbol_strings (abfd
, current_offset
, syms
,
3373 num_syms
, &strings_size
)
3377 /* Record total string table size in header and update the
3379 obj_som_file_hdr (abfd
)->symbol_strings_size
= strings_size
;
3380 current_offset
+= strings_size
;
3382 /* Do prep work before handling fixups. */
3383 som_prep_for_fixups (abfd
,
3384 bfd_get_outsymbols (abfd
),
3385 bfd_get_symcount (abfd
));
3387 /* At the end of the file is the fixup stream which starts on a
3389 if (current_offset
% 4)
3390 current_offset
+= (4 - (current_offset
% 4));
3391 obj_som_file_hdr (abfd
)->fixup_request_location
= current_offset
;
3393 /* Write the fixups and update fields in subspace headers which
3394 relate to the fixup stream. */
3395 if (som_write_fixups (abfd
, current_offset
, &total_reloc_size
) == false)
3398 /* Record the total size of the fixup stream in the file header. */
3399 obj_som_file_hdr (abfd
)->fixup_request_total
= total_reloc_size
;
3401 /* Done. Store the total size of the SOM. */
3402 obj_som_file_hdr (abfd
)->som_length
= current_offset
+ total_reloc_size
;
3404 /* Now that the symbol table information is complete, build and
3405 write the symbol table. */
3406 if (som_build_and_write_symbol_table (abfd
) == false)
3409 /* Subspaces are written first so that we can set up information
3410 about them in their containing spaces as the subspace is written. */
3412 /* Seek to the start of the subspace dictionary records. */
3413 location
= obj_som_file_hdr (abfd
)->subspace_location
;
3414 if (bfd_seek (abfd
, location
, SEEK_SET
) < 0)
3417 section
= abfd
->sections
;
3418 /* Now for each loadable space write out records for its subspaces. */
3419 for (i
= 0; i
< num_spaces
; i
++)
3421 asection
*subsection
;
3424 while (!som_is_space (section
))
3425 section
= section
->next
;
3427 /* Now look for all its subspaces. */
3428 for (subsection
= abfd
->sections
;
3430 subsection
= subsection
->next
)
3433 /* Skip any section which does not correspond to a space
3434 or subspace. Or does not have SEC_ALLOC set (and therefore
3435 has no real bits on the disk). */
3436 if (!som_is_subspace (subsection
)
3437 || !som_is_container (section
, subsection
)
3438 || (subsection
->flags
& SEC_ALLOC
) == 0)
3441 /* If this is the first subspace for this space, then save
3442 the index of the subspace in its containing space. Also
3443 set "is_loadable" in the containing space. */
3445 if (som_section_data (section
)->space_dict
->subspace_quantity
== 0)
3447 som_section_data (section
)->space_dict
->is_loadable
= 1;
3448 som_section_data (section
)->space_dict
->subspace_index
3452 /* Increment the number of subspaces seen and the number of
3453 subspaces contained within the current space. */
3455 som_section_data (section
)->space_dict
->subspace_quantity
++;
3457 /* Mark the index of the current space within the subspace's
3458 dictionary record. */
3459 som_section_data (subsection
)->subspace_dict
->space_index
= i
;
3461 /* Dump the current subspace header. */
3462 if (bfd_write ((PTR
) som_section_data (subsection
)->subspace_dict
,
3463 sizeof (struct subspace_dictionary_record
), 1, abfd
)
3464 != sizeof (struct subspace_dictionary_record
))
3467 /* Goto the next section. */
3468 section
= section
->next
;
3471 /* Now repeat the process for unloadable subspaces. */
3472 section
= abfd
->sections
;
3473 /* Now for each space write out records for its subspaces. */
3474 for (i
= 0; i
< num_spaces
; i
++)
3476 asection
*subsection
;
3479 while (!som_is_space (section
))
3480 section
= section
->next
;
3482 /* Now look for all its subspaces. */
3483 for (subsection
= abfd
->sections
;
3485 subsection
= subsection
->next
)
3488 /* Skip any section which does not correspond to a space or
3489 subspace, or which SEC_ALLOC set (and therefore handled
3490 in the loadable spaces/subspaces code above). */
3492 if (!som_is_subspace (subsection
)
3493 || !som_is_container (section
, subsection
)
3494 || (subsection
->flags
& SEC_ALLOC
) != 0)
3497 /* If this is the first subspace for this space, then save
3498 the index of the subspace in its containing space. Clear
3501 if (som_section_data (section
)->space_dict
->subspace_quantity
== 0)
3503 som_section_data (section
)->space_dict
->is_loadable
= 0;
3504 som_section_data (section
)->space_dict
->subspace_index
3508 /* Increment the number of subspaces seen and the number of
3509 subspaces contained within the current space. */
3510 som_section_data (section
)->space_dict
->subspace_quantity
++;
3513 /* Mark the index of the current space within the subspace's
3514 dictionary record. */
3515 som_section_data (subsection
)->subspace_dict
->space_index
= i
;
3517 /* Dump this subspace header. */
3518 if (bfd_write ((PTR
) som_section_data (subsection
)->subspace_dict
,
3519 sizeof (struct subspace_dictionary_record
), 1, abfd
)
3520 != sizeof (struct subspace_dictionary_record
))
3523 /* Goto the next section. */
3524 section
= section
->next
;
3527 /* All the subspace dictiondary records are written, and all the
3528 fields are set up in the space dictionary records.
3530 Seek to the right location and start writing the space
3531 dictionary records. */
3532 location
= obj_som_file_hdr (abfd
)->space_location
;
3533 if (bfd_seek (abfd
, location
, SEEK_SET
) < 0)
3536 section
= abfd
->sections
;
3537 for (i
= 0; i
< num_spaces
; i
++)
3541 while (!som_is_space (section
))
3542 section
= section
->next
;
3544 /* Dump its header */
3545 if (bfd_write ((PTR
) som_section_data (section
)->space_dict
,
3546 sizeof (struct space_dictionary_record
), 1, abfd
)
3547 != sizeof (struct space_dictionary_record
))
3550 /* Goto the next section. */
3551 section
= section
->next
;
3554 /* Setting of the system_id has to happen very late now that copying of
3555 BFD private data happens *after* section contents are set. */
3556 if (abfd
->flags
& (EXEC_P
| DYNAMIC
))
3557 obj_som_file_hdr(abfd
)->system_id
= obj_som_exec_data (abfd
)->system_id
;
3558 else if (bfd_get_mach (abfd
) == pa11
)
3559 obj_som_file_hdr(abfd
)->system_id
= CPU_PA_RISC1_1
;
3561 obj_som_file_hdr(abfd
)->system_id
= CPU_PA_RISC1_0
;
3563 /* Compute the checksum for the file header just before writing
3564 the header to disk. */
3565 obj_som_file_hdr (abfd
)->checksum
= som_compute_checksum (abfd
);
3567 /* Only thing left to do is write out the file header. It is always
3568 at location zero. Seek there and write it. */
3569 if (bfd_seek (abfd
, (file_ptr
) 0, SEEK_SET
) < 0)
3571 if (bfd_write ((PTR
) obj_som_file_hdr (abfd
),
3572 sizeof (struct header
), 1, abfd
)
3573 != sizeof (struct header
))
3576 /* Now write the exec header. */
3577 if (abfd
->flags
& (EXEC_P
| DYNAMIC
))
3580 struct som_exec_auxhdr
*exec_header
;
3582 exec_header
= obj_som_exec_hdr (abfd
);
3583 exec_header
->exec_entry
= bfd_get_start_address (abfd
);
3584 exec_header
->exec_flags
= obj_som_exec_data (abfd
)->exec_flags
;
3586 /* Oh joys. Ram some of the BSS data into the DATA section
3587 to be compatable with how the hp linker makes objects
3588 (saves memory space). */
3589 tmp
= exec_header
->exec_dsize
;
3590 tmp
= SOM_ALIGN (tmp
, PA_PAGESIZE
);
3591 exec_header
->exec_bsize
-= (tmp
- exec_header
->exec_dsize
);
3592 if (exec_header
->exec_bsize
< 0)
3593 exec_header
->exec_bsize
= 0;
3594 exec_header
->exec_dsize
= tmp
;
3596 if (bfd_seek (abfd
, obj_som_file_hdr (abfd
)->aux_header_location
,
3600 if (bfd_write ((PTR
) exec_header
, AUX_HDR_SIZE
, 1, abfd
)
3607 /* Compute and return the checksum for a SOM file header. */
3609 static unsigned long
3610 som_compute_checksum (abfd
)
3613 unsigned long checksum
, count
, i
;
3614 unsigned long *buffer
= (unsigned long *) obj_som_file_hdr (abfd
);
3617 count
= sizeof (struct header
) / sizeof (unsigned long);
3618 for (i
= 0; i
< count
; i
++)
3619 checksum
^= *(buffer
+ i
);
3625 som_bfd_derive_misc_symbol_info (abfd
, sym
, info
)
3628 struct som_misc_symbol_info
*info
;
3631 memset (info
, 0, sizeof (struct som_misc_symbol_info
));
3633 /* The HP SOM linker requires detailed type information about
3634 all symbols (including undefined symbols!). Unfortunately,
3635 the type specified in an import/export statement does not
3636 always match what the linker wants. Severe braindamage. */
3638 /* Section symbols will not have a SOM symbol type assigned to
3639 them yet. Assign all section symbols type ST_DATA. */
3640 if (sym
->flags
& BSF_SECTION_SYM
)
3641 info
->symbol_type
= ST_DATA
;
3644 /* Common symbols must have scope SS_UNSAT and type
3645 ST_STORAGE or the linker will choke. */
3646 if (bfd_is_com_section (sym
->section
))
3648 info
->symbol_scope
= SS_UNSAT
;
3649 info
->symbol_type
= ST_STORAGE
;
3652 /* It is possible to have a symbol without an associated
3653 type. This happens if the user imported the symbol
3654 without a type and the symbol was never defined
3655 locally. If BSF_FUNCTION is set for this symbol, then
3656 assign it type ST_CODE (the HP linker requires undefined
3657 external functions to have type ST_CODE rather than ST_ENTRY). */
3658 else if ((som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_UNKNOWN
3659 || som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_CODE
)
3660 && bfd_is_und_section (sym
->section
)
3661 && sym
->flags
& BSF_FUNCTION
)
3662 info
->symbol_type
= ST_CODE
;
3664 /* Handle function symbols which were defined in this file.
3665 They should have type ST_ENTRY. Also retrieve the argument
3666 relocation bits from the SOM backend information. */
3667 else if (som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_ENTRY
3668 || (som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_CODE
3669 && (sym
->flags
& BSF_FUNCTION
))
3670 || (som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_UNKNOWN
3671 && (sym
->flags
& BSF_FUNCTION
)))
3673 info
->symbol_type
= ST_ENTRY
;
3674 info
->arg_reloc
= som_symbol_data (sym
)->tc_data
.hppa_arg_reloc
;
3677 /* If the type is unknown at this point, it should be ST_DATA or
3678 ST_CODE (function/ST_ENTRY symbols were handled as special
3680 else if (som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_UNKNOWN
)
3682 if (sym
->section
->flags
& SEC_CODE
)
3683 info
->symbol_type
= ST_CODE
;
3685 info
->symbol_type
= ST_DATA
;
3688 /* From now on it's a very simple mapping. */
3689 else if (som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_ABSOLUTE
)
3690 info
->symbol_type
= ST_ABSOLUTE
;
3691 else if (som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_CODE
)
3692 info
->symbol_type
= ST_CODE
;
3693 else if (som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_DATA
)
3694 info
->symbol_type
= ST_DATA
;
3695 else if (som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_MILLICODE
)
3696 info
->symbol_type
= ST_MILLICODE
;
3697 else if (som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_PLABEL
)
3698 info
->symbol_type
= ST_PLABEL
;
3699 else if (som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_PRI_PROG
)
3700 info
->symbol_type
= ST_PRI_PROG
;
3701 else if (som_symbol_data (sym
)->som_type
== SYMBOL_TYPE_SEC_PROG
)
3702 info
->symbol_type
= ST_SEC_PROG
;
3705 /* Now handle the symbol's scope. Exported data which is not
3706 in the common section has scope SS_UNIVERSAL. Note scope
3707 of common symbols was handled earlier! */
3708 if (bfd_is_und_section (sym
->section
))
3709 info
->symbol_scope
= SS_UNSAT
;
3710 else if (sym
->flags
& BSF_EXPORT
&& ! bfd_is_com_section (sym
->section
))
3711 info
->symbol_scope
= SS_UNIVERSAL
;
3712 /* Anything else which is not in the common section has scope
3714 else if (! bfd_is_com_section (sym
->section
))
3715 info
->symbol_scope
= SS_LOCAL
;
3717 /* Now set the symbol_info field. It has no real meaning
3718 for undefined or common symbols, but the HP linker will
3719 choke if it's not set to some "reasonable" value. We
3720 use zero as a reasonable value. */
3721 if (bfd_is_com_section (sym
->section
)
3722 || bfd_is_und_section (sym
->section
)
3723 || bfd_is_abs_section (sym
->section
))
3724 info
->symbol_info
= 0;
3725 /* For all other symbols, the symbol_info field contains the
3726 subspace index of the space this symbol is contained in. */
3728 info
->symbol_info
= sym
->section
->target_index
;
3730 /* Set the symbol's value. */
3731 info
->symbol_value
= sym
->value
+ sym
->section
->vma
;
3734 /* Build and write, in one big chunk, the entire symbol table for
3738 som_build_and_write_symbol_table (abfd
)
3741 unsigned int num_syms
= bfd_get_symcount (abfd
);
3742 file_ptr symtab_location
= obj_som_file_hdr (abfd
)->symbol_location
;
3743 asymbol
**bfd_syms
= obj_som_sorted_syms (abfd
);
3744 struct symbol_dictionary_record
*som_symtab
= NULL
;
3747 /* Compute total symbol table size and allocate a chunk of memory
3748 to hold the symbol table as we build it. */
3749 symtab_size
= num_syms
* sizeof (struct symbol_dictionary_record
);
3750 som_symtab
= (struct symbol_dictionary_record
*) malloc (symtab_size
);
3751 if (som_symtab
== NULL
&& symtab_size
!= 0)
3753 bfd_set_error (bfd_error_no_memory
);
3756 memset (som_symtab
, 0, symtab_size
);
3758 /* Walk over each symbol. */
3759 for (i
= 0; i
< num_syms
; i
++)
3761 struct som_misc_symbol_info info
;
3763 /* This is really an index into the symbol strings table.
3764 By the time we get here, the index has already been
3765 computed and stored into the name field in the BFD symbol. */
3766 som_symtab
[i
].name
.n_strx
= som_symbol_data(bfd_syms
[i
])->stringtab_offset
;
3768 /* Derive SOM information from the BFD symbol. */
3769 som_bfd_derive_misc_symbol_info (abfd
, bfd_syms
[i
], &info
);
3772 som_symtab
[i
].symbol_type
= info
.symbol_type
;
3773 som_symtab
[i
].symbol_scope
= info
.symbol_scope
;
3774 som_symtab
[i
].arg_reloc
= info
.arg_reloc
;
3775 som_symtab
[i
].symbol_info
= info
.symbol_info
;
3776 som_symtab
[i
].symbol_value
= info
.symbol_value
;
3779 /* Everything is ready, seek to the right location and
3780 scribble out the symbol table. */
3781 if (bfd_seek (abfd
, symtab_location
, SEEK_SET
) != 0)
3784 if (bfd_write ((PTR
) som_symtab
, symtab_size
, 1, abfd
) != symtab_size
)
3787 if (som_symtab
!= NULL
)
3791 if (som_symtab
!= NULL
)
3796 /* Write an object in SOM format. */
3799 som_write_object_contents (abfd
)
3802 if (abfd
->output_has_begun
== false)
3804 /* Set up fixed parts of the file, space, and subspace headers.
3805 Notify the world that output has begun. */
3806 som_prep_headers (abfd
);
3807 abfd
->output_has_begun
= true;
3808 /* Start writing the object file. This include all the string
3809 tables, fixup streams, and other portions of the object file. */
3810 som_begin_writing (abfd
);
3813 return (som_finish_writing (abfd
));
3817 /* Read and save the string table associated with the given BFD. */
3820 som_slurp_string_table (abfd
)
3825 /* Use the saved version if its available. */
3826 if (obj_som_stringtab (abfd
) != NULL
)
3829 /* I don't think this can currently happen, and I'm not sure it should
3830 really be an error, but it's better than getting unpredictable results
3831 from the host's malloc when passed a size of zero. */
3832 if (obj_som_stringtab_size (abfd
) == 0)
3834 bfd_set_error (bfd_error_no_symbols
);
3838 /* Allocate and read in the string table. */
3839 stringtab
= bfd_zalloc (abfd
, obj_som_stringtab_size (abfd
));
3840 if (stringtab
== NULL
)
3842 bfd_set_error (bfd_error_no_memory
);
3846 if (bfd_seek (abfd
, obj_som_str_filepos (abfd
), SEEK_SET
) < 0)
3849 if (bfd_read (stringtab
, obj_som_stringtab_size (abfd
), 1, abfd
)
3850 != obj_som_stringtab_size (abfd
))
3853 /* Save our results and return success. */
3854 obj_som_stringtab (abfd
) = stringtab
;
3858 /* Return the amount of data (in bytes) required to hold the symbol
3859 table for this object. */
3862 som_get_symtab_upper_bound (abfd
)
3865 if (!som_slurp_symbol_table (abfd
))
3868 return (bfd_get_symcount (abfd
) + 1) * (sizeof (asymbol
*));
3871 /* Convert from a SOM subspace index to a BFD section. */
3874 bfd_section_from_som_symbol (abfd
, symbol
)
3876 struct symbol_dictionary_record
*symbol
;
3880 /* The meaning of the symbol_info field changes for functions
3881 within executables. So only use the quick symbol_info mapping for
3882 incomplete objects and non-function symbols in executables. */
3883 if ((abfd
->flags
& (EXEC_P
| DYNAMIC
)) == 0
3884 || (symbol
->symbol_type
!= ST_ENTRY
3885 && symbol
->symbol_type
!= ST_PRI_PROG
3886 && symbol
->symbol_type
!= ST_SEC_PROG
3887 && symbol
->symbol_type
!= ST_MILLICODE
))
3889 unsigned int index
= symbol
->symbol_info
;
3890 for (section
= abfd
->sections
; section
!= NULL
; section
= section
->next
)
3891 if (section
->target_index
== index
&& som_is_subspace (section
))
3894 /* Could be a symbol from an external library (such as an OMOS
3895 shared library). Don't abort. */
3896 return bfd_abs_section_ptr
;
3901 unsigned int value
= symbol
->symbol_value
;
3903 /* For executables we will have to use the symbol's address and
3904 find out what section would contain that address. Yuk. */
3905 for (section
= abfd
->sections
; section
; section
= section
->next
)
3907 if (value
>= section
->vma
3908 && value
<= section
->vma
+ section
->_cooked_size
3909 && som_is_subspace (section
))
3913 /* Could be a symbol from an external library (such as an OMOS
3914 shared library). Don't abort. */
3915 return bfd_abs_section_ptr
;
3920 /* Read and save the symbol table associated with the given BFD. */
3923 som_slurp_symbol_table (abfd
)
3926 int symbol_count
= bfd_get_symcount (abfd
);
3927 int symsize
= sizeof (struct symbol_dictionary_record
);
3929 struct symbol_dictionary_record
*buf
= NULL
, *bufp
, *endbufp
;
3930 som_symbol_type
*sym
, *symbase
;
3932 /* Return saved value if it exists. */
3933 if (obj_som_symtab (abfd
) != NULL
)
3934 goto successful_return
;
3936 /* Special case. This is *not* an error. */
3937 if (symbol_count
== 0)
3938 goto successful_return
;
3940 if (!som_slurp_string_table (abfd
))
3943 stringtab
= obj_som_stringtab (abfd
);
3945 symbase
= (som_symbol_type
*)
3946 bfd_zalloc (abfd
, symbol_count
* sizeof (som_symbol_type
));
3947 if (symbase
== NULL
)
3949 bfd_set_error (bfd_error_no_memory
);
3953 /* Read in the external SOM representation. */
3954 buf
= malloc (symbol_count
* symsize
);
3955 if (buf
== NULL
&& symbol_count
* symsize
!= 0)
3957 bfd_set_error (bfd_error_no_memory
);
3960 if (bfd_seek (abfd
, obj_som_sym_filepos (abfd
), SEEK_SET
) < 0)
3962 if (bfd_read (buf
, symbol_count
* symsize
, 1, abfd
)
3963 != symbol_count
* symsize
)
3966 /* Iterate over all the symbols and internalize them. */
3967 endbufp
= buf
+ symbol_count
;
3968 for (bufp
= buf
, sym
= symbase
; bufp
< endbufp
; ++bufp
)
3971 /* I don't think we care about these. */
3972 if (bufp
->symbol_type
== ST_SYM_EXT
3973 || bufp
->symbol_type
== ST_ARG_EXT
)
3976 /* Set some private data we care about. */
3977 if (bufp
->symbol_type
== ST_NULL
)
3978 som_symbol_data (sym
)->som_type
= SYMBOL_TYPE_UNKNOWN
;
3979 else if (bufp
->symbol_type
== ST_ABSOLUTE
)
3980 som_symbol_data (sym
)->som_type
= SYMBOL_TYPE_ABSOLUTE
;
3981 else if (bufp
->symbol_type
== ST_DATA
)
3982 som_symbol_data (sym
)->som_type
= SYMBOL_TYPE_DATA
;
3983 else if (bufp
->symbol_type
== ST_CODE
)
3984 som_symbol_data (sym
)->som_type
= SYMBOL_TYPE_CODE
;
3985 else if (bufp
->symbol_type
== ST_PRI_PROG
)
3986 som_symbol_data (sym
)->som_type
= SYMBOL_TYPE_PRI_PROG
;
3987 else if (bufp
->symbol_type
== ST_SEC_PROG
)
3988 som_symbol_data (sym
)->som_type
= SYMBOL_TYPE_SEC_PROG
;
3989 else if (bufp
->symbol_type
== ST_ENTRY
)
3990 som_symbol_data (sym
)->som_type
= SYMBOL_TYPE_ENTRY
;
3991 else if (bufp
->symbol_type
== ST_MILLICODE
)
3992 som_symbol_data (sym
)->som_type
= SYMBOL_TYPE_MILLICODE
;
3993 else if (bufp
->symbol_type
== ST_PLABEL
)
3994 som_symbol_data (sym
)->som_type
= SYMBOL_TYPE_PLABEL
;
3996 som_symbol_data (sym
)->som_type
= SYMBOL_TYPE_UNKNOWN
;
3997 som_symbol_data (sym
)->tc_data
.hppa_arg_reloc
= bufp
->arg_reloc
;
3999 /* Some reasonable defaults. */
4000 sym
->symbol
.the_bfd
= abfd
;
4001 sym
->symbol
.name
= bufp
->name
.n_strx
+ stringtab
;
4002 sym
->symbol
.value
= bufp
->symbol_value
;
4003 sym
->symbol
.section
= 0;
4004 sym
->symbol
.flags
= 0;
4006 switch (bufp
->symbol_type
)
4010 sym
->symbol
.flags
|= BSF_FUNCTION
;
4011 sym
->symbol
.value
&= ~0x3;
4018 sym
->symbol
.value
&= ~0x3;
4019 /* If the symbol's scope is ST_UNSAT, then these are
4020 undefined function symbols. */
4021 if (bufp
->symbol_scope
== SS_UNSAT
)
4022 sym
->symbol
.flags
|= BSF_FUNCTION
;
4029 /* Handle scoping and section information. */
4030 switch (bufp
->symbol_scope
)
4032 /* symbol_info field is undefined for SS_EXTERNAL and SS_UNSAT symbols,
4033 so the section associated with this symbol can't be known. */
4035 if (bufp
->symbol_type
!= ST_STORAGE
)
4036 sym
->symbol
.section
= bfd_und_section_ptr
;
4038 sym
->symbol
.section
= bfd_com_section_ptr
;
4039 sym
->symbol
.flags
|= (BSF_EXPORT
| BSF_GLOBAL
);
4043 if (bufp
->symbol_type
!= ST_STORAGE
)
4044 sym
->symbol
.section
= bfd_und_section_ptr
;
4046 sym
->symbol
.section
= bfd_com_section_ptr
;
4050 sym
->symbol
.flags
|= (BSF_EXPORT
| BSF_GLOBAL
);
4051 sym
->symbol
.section
= bfd_section_from_som_symbol (abfd
, bufp
);
4052 sym
->symbol
.value
-= sym
->symbol
.section
->vma
;
4056 /* SS_GLOBAL and SS_LOCAL are two names for the same thing.
4057 Sound dumb? It is. */
4061 sym
->symbol
.flags
|= BSF_LOCAL
;
4062 sym
->symbol
.section
= bfd_section_from_som_symbol (abfd
, bufp
);
4063 sym
->symbol
.value
-= sym
->symbol
.section
->vma
;
4067 /* Mark section symbols and symbols used by the debugger.
4068 Note $START$ is a magic code symbol, NOT a section symbol. */
4069 if (sym
->symbol
.name
[0] == '$'
4070 && sym
->symbol
.name
[strlen (sym
->symbol
.name
) - 1] == '$'
4071 && !strcmp (sym
->symbol
.name
, sym
->symbol
.section
->name
))
4072 sym
->symbol
.flags
|= BSF_SECTION_SYM
;
4073 else if (!strncmp (sym
->symbol
.name
, "L$0\002", 4))
4075 sym
->symbol
.flags
|= BSF_SECTION_SYM
;
4076 sym
->symbol
.name
= sym
->symbol
.section
->name
;
4078 else if (!strncmp (sym
->symbol
.name
, "L$0\001", 4))
4079 sym
->symbol
.flags
|= BSF_DEBUGGING
;
4081 /* Note increment at bottom of loop, since we skip some symbols
4082 we can not include it as part of the for statement. */
4086 /* Save our results and return success. */
4087 obj_som_symtab (abfd
) = symbase
;
4099 /* Canonicalize a SOM symbol table. Return the number of entries
4100 in the symbol table. */
4103 som_get_symtab (abfd
, location
)
4108 som_symbol_type
*symbase
;
4110 if (!som_slurp_symbol_table (abfd
))
4113 i
= bfd_get_symcount (abfd
);
4114 symbase
= obj_som_symtab (abfd
);
4116 for (; i
> 0; i
--, location
++, symbase
++)
4117 *location
= &symbase
->symbol
;
4119 /* Final null pointer. */
4121 return (bfd_get_symcount (abfd
));
4124 /* Make a SOM symbol. There is nothing special to do here. */
4127 som_make_empty_symbol (abfd
)
4130 som_symbol_type
*new =
4131 (som_symbol_type
*) bfd_zalloc (abfd
, sizeof (som_symbol_type
));
4134 bfd_set_error (bfd_error_no_memory
);
4137 new->symbol
.the_bfd
= abfd
;
4139 return &new->symbol
;
4142 /* Print symbol information. */
4145 som_print_symbol (ignore_abfd
, afile
, symbol
, how
)
4149 bfd_print_symbol_type how
;
4151 FILE *file
= (FILE *) afile
;
4154 case bfd_print_symbol_name
:
4155 fprintf (file
, "%s", symbol
->name
);
4157 case bfd_print_symbol_more
:
4158 fprintf (file
, "som ");
4159 fprintf_vma (file
, symbol
->value
);
4160 fprintf (file
, " %lx", (long) symbol
->flags
);
4162 case bfd_print_symbol_all
:
4164 CONST
char *section_name
;
4165 section_name
= symbol
->section
? symbol
->section
->name
: "(*none*)";
4166 bfd_print_symbol_vandf ((PTR
) file
, symbol
);
4167 fprintf (file
, " %s\t%s", section_name
, symbol
->name
);
4174 som_bfd_is_local_label (abfd
, sym
)
4178 return (sym
->name
[0] == 'L' && sym
->name
[1] == '$');
4181 /* Count or process variable-length SOM fixup records.
4183 To avoid code duplication we use this code both to compute the number
4184 of relocations requested by a stream, and to internalize the stream.
4186 When computing the number of relocations requested by a stream the
4187 variables rptr, section, and symbols have no meaning.
4189 Return the number of relocations requested by the fixup stream. When
4192 This needs at least two or three more passes to get it cleaned up. */
4195 som_set_reloc_info (fixup
, end
, internal_relocs
, section
, symbols
, just_count
)
4196 unsigned char *fixup
;
4198 arelent
*internal_relocs
;
4203 unsigned int op
, varname
, deallocate_contents
= 0;
4204 unsigned char *end_fixups
= &fixup
[end
];
4205 const struct fixup_format
*fp
;
4207 unsigned char *save_fixup
;
4208 int variables
[26], stack
[20], c
, v
, count
, prev_fixup
, *sp
, saved_unwind_bits
;
4210 arelent
*rptr
= internal_relocs
;
4211 unsigned int offset
= 0;
4213 #define var(c) variables[(c) - 'A']
4214 #define push(v) (*sp++ = (v))
4215 #define pop() (*--sp)
4216 #define emptystack() (sp == stack)
4218 som_initialize_reloc_queue (reloc_queue
);
4219 memset (variables
, 0, sizeof (variables
));
4220 memset (stack
, 0, sizeof (stack
));
4223 saved_unwind_bits
= 0;
4226 while (fixup
< end_fixups
)
4229 /* Save pointer to the start of this fixup. We'll use
4230 it later to determine if it is necessary to put this fixup
4234 /* Get the fixup code and its associated format. */
4236 fp
= &som_fixup_formats
[op
];
4238 /* Handle a request for a previous fixup. */
4239 if (*fp
->format
== 'P')
4241 /* Get pointer to the beginning of the prev fixup, move
4242 the repeated fixup to the head of the queue. */
4243 fixup
= reloc_queue
[fp
->D
].reloc
;
4244 som_reloc_queue_fix (reloc_queue
, fp
->D
);
4247 /* Get the fixup code and its associated format. */
4249 fp
= &som_fixup_formats
[op
];
4252 /* If this fixup will be passed to BFD, set some reasonable defaults. */
4254 && som_hppa_howto_table
[op
].type
!= R_NO_RELOCATION
4255 && som_hppa_howto_table
[op
].type
!= R_DATA_OVERRIDE
)
4257 rptr
->address
= offset
;
4258 rptr
->howto
= &som_hppa_howto_table
[op
];
4260 rptr
->sym_ptr_ptr
= bfd_abs_section_ptr
->symbol_ptr_ptr
;
4263 /* Set default input length to 0. Get the opcode class index
4267 var ('U') = saved_unwind_bits
;
4269 /* Get the opcode format. */
4272 /* Process the format string. Parsing happens in two phases,
4273 parse RHS, then assign to LHS. Repeat until no more
4274 characters in the format string. */
4277 /* The variable this pass is going to compute a value for. */
4280 /* Start processing RHS. Continue until a NULL or '=' is found. */
4285 /* If this is a variable, push it on the stack. */
4289 /* If this is a lower case letter, then it represents
4290 additional data from the fixup stream to be pushed onto
4292 else if (islower (c
))
4294 int bits
= (c
- 'a') * 8;
4295 for (v
= 0; c
> 'a'; --c
)
4296 v
= (v
<< 8) | *fixup
++;
4298 v
= sign_extend (v
, bits
);
4302 /* A decimal constant. Push it on the stack. */
4303 else if (isdigit (c
))
4306 while (isdigit (*cp
))
4307 v
= (v
* 10) + (*cp
++ - '0');
4312 /* An operator. Pop two two values from the stack and
4313 use them as operands to the given operation. Push
4314 the result of the operation back on the stack. */
4336 while (*cp
&& *cp
!= '=');
4338 /* Move over the equal operator. */
4341 /* Pop the RHS off the stack. */
4344 /* Perform the assignment. */
4347 /* Handle side effects. and special 'O' stack cases. */
4350 /* Consume some bytes from the input space. */
4354 /* A symbol to use in the relocation. Make a note
4355 of this if we are not just counting. */
4358 rptr
->sym_ptr_ptr
= &symbols
[c
];
4360 /* Argument relocation bits for a function call. */
4364 unsigned int tmp
= var ('R');
4367 if ((som_hppa_howto_table
[op
].type
== R_PCREL_CALL
4368 && R_PCREL_CALL
+ 10 > op
)
4369 || (som_hppa_howto_table
[op
].type
== R_ABS_CALL
4370 && R_ABS_CALL
+ 10 > op
))
4372 /* Simple encoding. */
4379 rptr
->addend
|= 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2;
4381 rptr
->addend
|= 1 << 8 | 1 << 6 | 1 << 4;
4383 rptr
->addend
|= 1 << 8 | 1 << 6;
4385 rptr
->addend
|= 1 << 8;
4389 unsigned int tmp1
, tmp2
;
4391 /* First part is easy -- low order two bits are
4392 directly copied, then shifted away. */
4393 rptr
->addend
= tmp
& 0x3;
4396 /* Diving the result by 10 gives us the second
4397 part. If it is 9, then the first two words
4398 are a double precision paramater, else it is
4399 3 * the first arg bits + the 2nd arg bits. */
4403 rptr
->addend
+= (0xe << 6);
4406 /* Get the two pieces. */
4409 /* Put them in the addend. */
4410 rptr
->addend
+= (tmp2
<< 8) + (tmp1
<< 6);
4413 /* What's left is the third part. It's unpacked
4414 just like the second. */
4416 rptr
->addend
+= (0xe << 2);
4421 rptr
->addend
+= (tmp2
<< 4) + (tmp
<< 2);
4424 rptr
->addend
= HPPA_R_ADDEND (rptr
->addend
, 0);
4427 /* Handle the linker expression stack. */
4432 subop
= comp1_opcodes
;
4435 subop
= comp2_opcodes
;
4438 subop
= comp3_opcodes
;
4443 while (*subop
<= (unsigned char) c
)
4447 /* The lower 32unwind bits must be persistent. */
4449 saved_unwind_bits
= var ('U');
4457 /* If we used a previous fixup, clean up after it. */
4460 fixup
= save_fixup
+ 1;
4464 else if (fixup
> save_fixup
+ 1)
4465 som_reloc_queue_insert (save_fixup
, fixup
- save_fixup
, reloc_queue
);
4467 /* We do not pass R_DATA_OVERRIDE or R_NO_RELOCATION
4469 if (som_hppa_howto_table
[op
].type
!= R_DATA_OVERRIDE
4470 && som_hppa_howto_table
[op
].type
!= R_NO_RELOCATION
)
4472 /* Done with a single reloction. Loop back to the top. */
4475 if (som_hppa_howto_table
[op
].type
== R_ENTRY
)
4476 rptr
->addend
= var ('T');
4477 else if (som_hppa_howto_table
[op
].type
== R_EXIT
)
4478 rptr
->addend
= var ('U');
4479 else if (som_hppa_howto_table
[op
].type
== R_PCREL_CALL
4480 || som_hppa_howto_table
[op
].type
== R_ABS_CALL
)
4482 else if (som_hppa_howto_table
[op
].type
== R_DATA_ONE_SYMBOL
)
4484 unsigned addend
= var ('V');
4486 /* Try what was specified in R_DATA_OVERRIDE first
4487 (if anything). Then the hard way using the
4488 section contents. */
4489 rptr
->addend
= var ('V');
4491 if (rptr
->addend
== 0 && !section
->contents
)
4493 /* Got to read the damn contents first. We don't
4494 bother saving the contents (yet). Add it one
4495 day if the need arises. */
4496 section
->contents
= malloc (section
->_raw_size
);
4497 if (section
->contents
== NULL
)
4500 deallocate_contents
= 1;
4501 bfd_get_section_contents (section
->owner
,
4505 section
->_raw_size
);
4507 else if (rptr
->addend
== 0)
4508 rptr
->addend
= bfd_get_32 (section
->owner
,
4510 + offset
- var ('L')));
4514 rptr
->addend
= var ('V');
4518 /* Now that we've handled a "full" relocation, reset
4520 memset (variables
, 0, sizeof (variables
));
4521 memset (stack
, 0, sizeof (stack
));
4524 if (deallocate_contents
)
4525 free (section
->contents
);
4535 /* Read in the relocs (aka fixups in SOM terms) for a section.
4537 som_get_reloc_upper_bound calls this routine with JUST_COUNT
4538 set to true to indicate it only needs a count of the number
4539 of actual relocations. */
4542 som_slurp_reloc_table (abfd
, section
, symbols
, just_count
)
4548 char *external_relocs
;
4549 unsigned int fixup_stream_size
;
4550 arelent
*internal_relocs
;
4551 unsigned int num_relocs
;
4553 fixup_stream_size
= som_section_data (section
)->reloc_size
;
4554 /* If there were no relocations, then there is nothing to do. */
4555 if (section
->reloc_count
== 0)
4558 /* If reloc_count is -1, then the relocation stream has not been
4559 parsed. We must do so now to know how many relocations exist. */
4560 if (section
->reloc_count
== -1)
4562 external_relocs
= (char *) malloc (fixup_stream_size
);
4563 if (external_relocs
== (char *) NULL
)
4565 bfd_set_error (bfd_error_no_memory
);
4568 /* Read in the external forms. */
4570 obj_som_reloc_filepos (abfd
) + section
->rel_filepos
,
4574 if (bfd_read (external_relocs
, 1, fixup_stream_size
, abfd
)
4575 != fixup_stream_size
)
4578 /* Let callers know how many relocations found.
4579 also save the relocation stream as we will
4581 section
->reloc_count
= som_set_reloc_info (external_relocs
,
4583 NULL
, NULL
, NULL
, true);
4585 som_section_data (section
)->reloc_stream
= external_relocs
;
4588 /* If the caller only wanted a count, then return now. */
4592 num_relocs
= section
->reloc_count
;
4593 external_relocs
= som_section_data (section
)->reloc_stream
;
4594 /* Return saved information about the relocations if it is available. */
4595 if (section
->relocation
!= (arelent
*) NULL
)
4598 internal_relocs
= (arelent
*)
4599 bfd_zalloc (abfd
, (num_relocs
* sizeof (arelent
)));
4600 if (internal_relocs
== (arelent
*) NULL
)
4602 bfd_set_error (bfd_error_no_memory
);
4606 /* Process and internalize the relocations. */
4607 som_set_reloc_info (external_relocs
, fixup_stream_size
,
4608 internal_relocs
, section
, symbols
, false);
4610 /* We're done with the external relocations. Free them. */
4611 free (external_relocs
);
4613 /* Save our results and return success. */
4614 section
->relocation
= internal_relocs
;
4618 /* Return the number of bytes required to store the relocation
4619 information associated with the given section. */
4622 som_get_reloc_upper_bound (abfd
, asect
)
4626 /* If section has relocations, then read in the relocation stream
4627 and parse it to determine how many relocations exist. */
4628 if (asect
->flags
& SEC_RELOC
)
4630 if (! som_slurp_reloc_table (abfd
, asect
, NULL
, true))
4632 return (asect
->reloc_count
+ 1) * sizeof (arelent
*);
4634 /* There are no relocations. */
4638 /* Convert relocations from SOM (external) form into BFD internal
4639 form. Return the number of relocations. */
4642 som_canonicalize_reloc (abfd
, section
, relptr
, symbols
)
4651 if (som_slurp_reloc_table (abfd
, section
, symbols
, false) == false)
4654 count
= section
->reloc_count
;
4655 tblptr
= section
->relocation
;
4658 *relptr
++ = tblptr
++;
4660 *relptr
= (arelent
*) NULL
;
4661 return section
->reloc_count
;
4664 extern const bfd_target som_vec
;
4666 /* A hook to set up object file dependent section information. */
4669 som_new_section_hook (abfd
, newsect
)
4673 newsect
->used_by_bfd
=
4674 (PTR
) bfd_zalloc (abfd
, sizeof (struct som_section_data_struct
));
4675 if (!newsect
->used_by_bfd
)
4677 bfd_set_error (bfd_error_no_memory
);
4680 newsect
->alignment_power
= 3;
4682 /* We allow more than three sections internally */
4686 /* Copy any private info we understand from the input symbol
4687 to the output symbol. */
4690 som_bfd_copy_private_symbol_data (ibfd
, isymbol
, obfd
, osymbol
)
4696 struct som_symbol
*input_symbol
= (struct som_symbol
*) isymbol
;
4697 struct som_symbol
*output_symbol
= (struct som_symbol
*) osymbol
;
4699 /* One day we may try to grok other private data. */
4700 if (ibfd
->xvec
->flavour
!= bfd_target_som_flavour
4701 || obfd
->xvec
->flavour
!= bfd_target_som_flavour
)
4704 /* The only private information we need to copy is the argument relocation
4706 output_symbol
->tc_data
.hppa_arg_reloc
= input_symbol
->tc_data
.hppa_arg_reloc
;
4711 /* Copy any private info we understand from the input section
4712 to the output section. */
4714 som_bfd_copy_private_section_data (ibfd
, isection
, obfd
, osection
)
4720 /* One day we may try to grok other private data. */
4721 if (ibfd
->xvec
->flavour
!= bfd_target_som_flavour
4722 || obfd
->xvec
->flavour
!= bfd_target_som_flavour
4723 || (!som_is_space (isection
) && !som_is_subspace (isection
)))
4726 som_section_data (osection
)->copy_data
4727 = (struct som_copyable_section_data_struct
*)
4728 bfd_zalloc (obfd
, sizeof (struct som_copyable_section_data_struct
));
4729 if (som_section_data (osection
)->copy_data
== NULL
)
4731 bfd_set_error (bfd_error_no_memory
);
4735 memcpy (som_section_data (osection
)->copy_data
,
4736 som_section_data (isection
)->copy_data
,
4737 sizeof (struct som_copyable_section_data_struct
));
4739 /* Reparent if necessary. */
4740 if (som_section_data (osection
)->copy_data
->container
)
4741 som_section_data (osection
)->copy_data
->container
=
4742 som_section_data (osection
)->copy_data
->container
->output_section
;
4747 /* Copy any private info we understand from the input bfd
4748 to the output bfd. */
4751 som_bfd_copy_private_bfd_data (ibfd
, obfd
)
4754 /* One day we may try to grok other private data. */
4755 if (ibfd
->xvec
->flavour
!= bfd_target_som_flavour
4756 || obfd
->xvec
->flavour
!= bfd_target_som_flavour
)
4759 /* Allocate some memory to hold the data we need. */
4760 obj_som_exec_data (obfd
) = (struct som_exec_data
*)
4761 bfd_zalloc (obfd
, sizeof (struct som_exec_data
));
4762 if (obj_som_exec_data (obfd
) == NULL
)
4764 bfd_set_error (bfd_error_no_memory
);
4768 /* Now copy the data. */
4769 memcpy (obj_som_exec_data (obfd
), obj_som_exec_data (ibfd
),
4770 sizeof (struct som_exec_data
));
4775 /* Set backend info for sections which can not be described
4776 in the BFD data structures. */
4779 bfd_som_set_section_attributes (section
, defined
, private, sort_key
, spnum
)
4783 unsigned int sort_key
;
4786 /* Allocate memory to hold the magic information. */
4787 if (som_section_data (section
)->copy_data
== NULL
)
4789 som_section_data (section
)->copy_data
4790 = (struct som_copyable_section_data_struct
*)
4791 bfd_zalloc (section
->owner
,
4792 sizeof (struct som_copyable_section_data_struct
));
4793 if (som_section_data (section
)->copy_data
== NULL
)
4795 bfd_set_error (bfd_error_no_memory
);
4799 som_section_data (section
)->copy_data
->sort_key
= sort_key
;
4800 som_section_data (section
)->copy_data
->is_defined
= defined
;
4801 som_section_data (section
)->copy_data
->is_private
= private;
4802 som_section_data (section
)->copy_data
->container
= section
;
4803 som_section_data (section
)->copy_data
->space_number
= spnum
;
4807 /* Set backend info for subsections which can not be described
4808 in the BFD data structures. */
4811 bfd_som_set_subsection_attributes (section
, container
, access
,
4814 asection
*container
;
4816 unsigned int sort_key
;
4819 /* Allocate memory to hold the magic information. */
4820 if (som_section_data (section
)->copy_data
== NULL
)
4822 som_section_data (section
)->copy_data
4823 = (struct som_copyable_section_data_struct
*)
4824 bfd_zalloc (section
->owner
,
4825 sizeof (struct som_copyable_section_data_struct
));
4826 if (som_section_data (section
)->copy_data
== NULL
)
4828 bfd_set_error (bfd_error_no_memory
);
4832 som_section_data (section
)->copy_data
->sort_key
= sort_key
;
4833 som_section_data (section
)->copy_data
->access_control_bits
= access
;
4834 som_section_data (section
)->copy_data
->quadrant
= quadrant
;
4835 som_section_data (section
)->copy_data
->container
= container
;
4839 /* Set the full SOM symbol type. SOM needs far more symbol information
4840 than any other object file format I'm aware of. It is mandatory
4841 to be able to know if a symbol is an entry point, millicode, data,
4842 code, absolute, storage request, or procedure label. If you get
4843 the symbol type wrong your program will not link. */
4846 bfd_som_set_symbol_type (symbol
, type
)
4850 som_symbol_data (symbol
)->som_type
= type
;
4853 /* Attach an auxiliary header to the BFD backend so that it may be
4854 written into the object file. */
4856 bfd_som_attach_aux_hdr (abfd
, type
, string
)
4861 if (type
== VERSION_AUX_ID
)
4863 int len
= strlen (string
);
4867 pad
= (4 - (len
% 4));
4868 obj_som_version_hdr (abfd
) = (struct user_string_aux_hdr
*)
4869 bfd_zalloc (abfd
, sizeof (struct aux_id
)
4870 + sizeof (unsigned int) + len
+ pad
);
4871 if (!obj_som_version_hdr (abfd
))
4873 bfd_set_error (bfd_error_no_memory
);
4876 obj_som_version_hdr (abfd
)->header_id
.type
= VERSION_AUX_ID
;
4877 obj_som_version_hdr (abfd
)->header_id
.length
= len
+ pad
;
4878 obj_som_version_hdr (abfd
)->header_id
.length
+= sizeof (int);
4879 obj_som_version_hdr (abfd
)->string_length
= len
;
4880 strncpy (obj_som_version_hdr (abfd
)->user_string
, string
, len
);
4882 else if (type
== COPYRIGHT_AUX_ID
)
4884 int len
= strlen (string
);
4888 pad
= (4 - (len
% 4));
4889 obj_som_copyright_hdr (abfd
) = (struct copyright_aux_hdr
*)
4890 bfd_zalloc (abfd
, sizeof (struct aux_id
)
4891 + sizeof (unsigned int) + len
+ pad
);
4892 if (!obj_som_copyright_hdr (abfd
))
4894 bfd_set_error (bfd_error_no_memory
);
4897 obj_som_copyright_hdr (abfd
)->header_id
.type
= COPYRIGHT_AUX_ID
;
4898 obj_som_copyright_hdr (abfd
)->header_id
.length
= len
+ pad
;
4899 obj_som_copyright_hdr (abfd
)->header_id
.length
+= sizeof (int);
4900 obj_som_copyright_hdr (abfd
)->string_length
= len
;
4901 strcpy (obj_som_copyright_hdr (abfd
)->copyright
, string
);
4907 som_get_section_contents (abfd
, section
, location
, offset
, count
)
4912 bfd_size_type count
;
4914 if (count
== 0 || ((section
->flags
& SEC_HAS_CONTENTS
) == 0))
4916 if ((bfd_size_type
)(offset
+count
) > section
->_raw_size
4917 || bfd_seek (abfd
, (file_ptr
)(section
->filepos
+ offset
), SEEK_SET
) == -1
4918 || bfd_read (location
, (bfd_size_type
)1, count
, abfd
) != count
)
4919 return (false); /* on error */
4924 som_set_section_contents (abfd
, section
, location
, offset
, count
)
4929 bfd_size_type count
;
4931 if (abfd
->output_has_begun
== false)
4933 /* Set up fixed parts of the file, space, and subspace headers.
4934 Notify the world that output has begun. */
4935 som_prep_headers (abfd
);
4936 abfd
->output_has_begun
= true;
4937 /* Start writing the object file. This include all the string
4938 tables, fixup streams, and other portions of the object file. */
4939 som_begin_writing (abfd
);
4942 /* Only write subspaces which have "real" contents (eg. the contents
4943 are not generated at run time by the OS). */
4944 if (!som_is_subspace (section
)
4945 || ((section
->flags
& SEC_HAS_CONTENTS
) == 0))
4948 /* Seek to the proper offset within the object file and write the
4950 offset
+= som_section_data (section
)->subspace_dict
->file_loc_init_value
;
4951 if (bfd_seek (abfd
, offset
, SEEK_SET
) == -1)
4954 if (bfd_write ((PTR
) location
, 1, count
, abfd
) != count
)
4960 som_set_arch_mach (abfd
, arch
, machine
)
4962 enum bfd_architecture arch
;
4963 unsigned long machine
;
4965 /* Allow any architecture to be supported by the SOM backend */
4966 return bfd_default_set_arch_mach (abfd
, arch
, machine
);
4970 som_find_nearest_line (abfd
, section
, symbols
, offset
, filename_ptr
,
4971 functionname_ptr
, line_ptr
)
4976 CONST
char **filename_ptr
;
4977 CONST
char **functionname_ptr
;
4978 unsigned int *line_ptr
;
4984 som_sizeof_headers (abfd
, reloc
)
4988 (*_bfd_error_handler
) ("som_sizeof_headers unimplemented");
4994 /* Return the single-character symbol type corresponding to
4995 SOM section S, or '?' for an unknown SOM section. */
4998 som_section_type (s
)
5001 const struct section_to_type
*t
;
5003 for (t
= &stt
[0]; t
->section
; t
++)
5004 if (!strcmp (s
, t
->section
))
5010 som_decode_symclass (symbol
)
5015 if (bfd_is_com_section (symbol
->section
))
5017 if (bfd_is_und_section (symbol
->section
))
5019 if (bfd_is_ind_section (symbol
->section
))
5021 if (!(symbol
->flags
& (BSF_GLOBAL
|BSF_LOCAL
)))
5024 if (bfd_is_abs_section (symbol
->section
)
5025 || (som_symbol_data (symbol
) != NULL
5026 && som_symbol_data (symbol
)->som_type
== SYMBOL_TYPE_ABSOLUTE
))
5028 else if (symbol
->section
)
5029 c
= som_section_type (symbol
->section
->name
);
5032 if (symbol
->flags
& BSF_GLOBAL
)
5037 /* Return information about SOM symbol SYMBOL in RET. */
5040 som_get_symbol_info (ignore_abfd
, symbol
, ret
)
5045 ret
->type
= som_decode_symclass (symbol
);
5046 if (ret
->type
!= 'U')
5047 ret
->value
= symbol
->value
+symbol
->section
->vma
;
5050 ret
->name
= symbol
->name
;
5053 /* Count the number of symbols in the archive symbol table. Necessary
5054 so that we can allocate space for all the carsyms at once. */
5057 som_bfd_count_ar_symbols (abfd
, lst_header
, count
)
5059 struct lst_header
*lst_header
;
5063 unsigned int *hash_table
= NULL
;
5064 file_ptr lst_filepos
= bfd_tell (abfd
) - sizeof (struct lst_header
);
5067 (unsigned int *) malloc (lst_header
->hash_size
* sizeof (unsigned int));
5068 if (hash_table
== NULL
&& lst_header
->hash_size
!= 0)
5070 bfd_set_error (bfd_error_no_memory
);
5074 /* Don't forget to initialize the counter! */
5077 /* Read in the hash table. The has table is an array of 32bit file offsets
5078 which point to the hash chains. */
5079 if (bfd_read ((PTR
) hash_table
, lst_header
->hash_size
, 4, abfd
)
5080 != lst_header
->hash_size
* 4)
5083 /* Walk each chain counting the number of symbols found on that particular
5085 for (i
= 0; i
< lst_header
->hash_size
; i
++)
5087 struct lst_symbol_record lst_symbol
;
5089 /* An empty chain has zero as it's file offset. */
5090 if (hash_table
[i
] == 0)
5093 /* Seek to the first symbol in this hash chain. */
5094 if (bfd_seek (abfd
, lst_filepos
+ hash_table
[i
], SEEK_SET
) < 0)
5097 /* Read in this symbol and update the counter. */
5098 if (bfd_read ((PTR
) & lst_symbol
, 1, sizeof (lst_symbol
), abfd
)
5099 != sizeof (lst_symbol
))
5104 /* Now iterate through the rest of the symbols on this chain. */
5105 while (lst_symbol
.next_entry
)
5108 /* Seek to the next symbol. */
5109 if (bfd_seek (abfd
, lst_filepos
+ lst_symbol
.next_entry
, SEEK_SET
)
5113 /* Read the symbol in and update the counter. */
5114 if (bfd_read ((PTR
) & lst_symbol
, 1, sizeof (lst_symbol
), abfd
)
5115 != sizeof (lst_symbol
))
5121 if (hash_table
!= NULL
)
5126 if (hash_table
!= NULL
)
5131 /* Fill in the canonical archive symbols (SYMS) from the archive described
5132 by ABFD and LST_HEADER. */
5135 som_bfd_fill_in_ar_symbols (abfd
, lst_header
, syms
)
5137 struct lst_header
*lst_header
;
5140 unsigned int i
, len
;
5141 carsym
*set
= syms
[0];
5142 unsigned int *hash_table
= NULL
;
5143 struct som_entry
*som_dict
= NULL
;
5144 file_ptr lst_filepos
= bfd_tell (abfd
) - sizeof (struct lst_header
);
5147 (unsigned int *) malloc (lst_header
->hash_size
* sizeof (unsigned int));
5148 if (hash_table
== NULL
&& lst_header
->hash_size
!= 0)
5150 bfd_set_error (bfd_error_no_memory
);
5155 (struct som_entry
*) malloc (lst_header
->module_count
5156 * sizeof (struct som_entry
));
5157 if (som_dict
== NULL
&& lst_header
->module_count
!= 0)
5159 bfd_set_error (bfd_error_no_memory
);
5163 /* Read in the hash table. The has table is an array of 32bit file offsets
5164 which point to the hash chains. */
5165 if (bfd_read ((PTR
) hash_table
, lst_header
->hash_size
, 4, abfd
)
5166 != lst_header
->hash_size
* 4)
5169 /* Seek to and read in the SOM dictionary. We will need this to fill
5170 in the carsym's filepos field. */
5171 if (bfd_seek (abfd
, lst_filepos
+ lst_header
->dir_loc
, SEEK_SET
) < 0)
5174 if (bfd_read ((PTR
) som_dict
, lst_header
->module_count
,
5175 sizeof (struct som_entry
), abfd
)
5176 != lst_header
->module_count
* sizeof (struct som_entry
))
5179 /* Walk each chain filling in the carsyms as we go along. */
5180 for (i
= 0; i
< lst_header
->hash_size
; i
++)
5182 struct lst_symbol_record lst_symbol
;
5184 /* An empty chain has zero as it's file offset. */
5185 if (hash_table
[i
] == 0)
5188 /* Seek to and read the first symbol on the chain. */
5189 if (bfd_seek (abfd
, lst_filepos
+ hash_table
[i
], SEEK_SET
) < 0)
5192 if (bfd_read ((PTR
) & lst_symbol
, 1, sizeof (lst_symbol
), abfd
)
5193 != sizeof (lst_symbol
))
5196 /* Get the name of the symbol, first get the length which is stored
5197 as a 32bit integer just before the symbol.
5199 One might ask why we don't just read in the entire string table
5200 and index into it. Well, according to the SOM ABI the string
5201 index can point *anywhere* in the archive to save space, so just
5202 using the string table would not be safe. */
5203 if (bfd_seek (abfd
, lst_filepos
+ lst_header
->string_loc
5204 + lst_symbol
.name
.n_strx
- 4, SEEK_SET
) < 0)
5207 if (bfd_read (&len
, 1, 4, abfd
) != 4)
5210 /* Allocate space for the name and null terminate it too. */
5211 set
->name
= bfd_zalloc (abfd
, len
+ 1);
5214 bfd_set_error (bfd_error_no_memory
);
5217 if (bfd_read (set
->name
, 1, len
, abfd
) != len
)
5222 /* Fill in the file offset. Note that the "location" field points
5223 to the SOM itself, not the ar_hdr in front of it. */
5224 set
->file_offset
= som_dict
[lst_symbol
.som_index
].location
5225 - sizeof (struct ar_hdr
);
5227 /* Go to the next symbol. */
5230 /* Iterate through the rest of the chain. */
5231 while (lst_symbol
.next_entry
)
5233 /* Seek to the next symbol and read it in. */
5234 if (bfd_seek (abfd
, lst_filepos
+ lst_symbol
.next_entry
, SEEK_SET
) <0)
5237 if (bfd_read ((PTR
) & lst_symbol
, 1, sizeof (lst_symbol
), abfd
)
5238 != sizeof (lst_symbol
))
5241 /* Seek to the name length & string and read them in. */
5242 if (bfd_seek (abfd
, lst_filepos
+ lst_header
->string_loc
5243 + lst_symbol
.name
.n_strx
- 4, SEEK_SET
) < 0)
5246 if (bfd_read (&len
, 1, 4, abfd
) != 4)
5249 /* Allocate space for the name and null terminate it too. */
5250 set
->name
= bfd_zalloc (abfd
, len
+ 1);
5253 bfd_set_error (bfd_error_no_memory
);
5257 if (bfd_read (set
->name
, 1, len
, abfd
) != len
)
5261 /* Fill in the file offset. Note that the "location" field points
5262 to the SOM itself, not the ar_hdr in front of it. */
5263 set
->file_offset
= som_dict
[lst_symbol
.som_index
].location
5264 - sizeof (struct ar_hdr
);
5266 /* Go on to the next symbol. */
5270 /* If we haven't died by now, then we successfully read the entire
5271 archive symbol table. */
5272 if (hash_table
!= NULL
)
5274 if (som_dict
!= NULL
)
5279 if (hash_table
!= NULL
)
5281 if (som_dict
!= NULL
)
5286 /* Read in the LST from the archive. */
5288 som_slurp_armap (abfd
)
5291 struct lst_header lst_header
;
5292 struct ar_hdr ar_header
;
5293 unsigned int parsed_size
;
5294 struct artdata
*ardata
= bfd_ardata (abfd
);
5296 int i
= bfd_read ((PTR
) nextname
, 1, 16, abfd
);
5298 /* Special cases. */
5304 if (bfd_seek (abfd
, (file_ptr
) - 16, SEEK_CUR
) < 0)
5307 /* For archives without .o files there is no symbol table. */
5308 if (strncmp (nextname
, "/ ", 16))
5310 bfd_has_map (abfd
) = false;
5314 /* Read in and sanity check the archive header. */
5315 if (bfd_read ((PTR
) &ar_header
, 1, sizeof (struct ar_hdr
), abfd
)
5316 != sizeof (struct ar_hdr
))
5319 if (strncmp (ar_header
.ar_fmag
, ARFMAG
, 2))
5321 bfd_set_error (bfd_error_malformed_archive
);
5325 /* How big is the archive symbol table entry? */
5327 parsed_size
= strtol (ar_header
.ar_size
, NULL
, 10);
5330 bfd_set_error (bfd_error_malformed_archive
);
5334 /* Save off the file offset of the first real user data. */
5335 ardata
->first_file_filepos
= bfd_tell (abfd
) + parsed_size
;
5337 /* Read in the library symbol table. We'll make heavy use of this
5338 in just a minute. */
5339 if (bfd_read ((PTR
) & lst_header
, 1, sizeof (struct lst_header
), abfd
)
5340 != sizeof (struct lst_header
))
5344 if (lst_header
.a_magic
!= LIBMAGIC
)
5346 bfd_set_error (bfd_error_malformed_archive
);
5350 /* Count the number of symbols in the library symbol table. */
5351 if (som_bfd_count_ar_symbols (abfd
, &lst_header
, &ardata
->symdef_count
)
5355 /* Get back to the start of the library symbol table. */
5356 if (bfd_seek (abfd
, ardata
->first_file_filepos
- parsed_size
5357 + sizeof (struct lst_header
), SEEK_SET
) < 0)
5360 /* Initializae the cache and allocate space for the library symbols. */
5362 ardata
->symdefs
= (carsym
*) bfd_alloc (abfd
,
5363 (ardata
->symdef_count
5364 * sizeof (carsym
)));
5365 if (!ardata
->symdefs
)
5367 bfd_set_error (bfd_error_no_memory
);
5371 /* Now fill in the canonical archive symbols. */
5372 if (som_bfd_fill_in_ar_symbols (abfd
, &lst_header
, &ardata
->symdefs
)
5376 /* Seek back to the "first" file in the archive. Note the "first"
5377 file may be the extended name table. */
5378 if (bfd_seek (abfd
, ardata
->first_file_filepos
, SEEK_SET
) < 0)
5381 /* Notify the generic archive code that we have a symbol map. */
5382 bfd_has_map (abfd
) = true;
5386 /* Begin preparing to write a SOM library symbol table.
5388 As part of the prep work we need to determine the number of symbols
5389 and the size of the associated string section. */
5392 som_bfd_prep_for_ar_write (abfd
, num_syms
, stringsize
)
5394 unsigned int *num_syms
, *stringsize
;
5396 bfd
*curr_bfd
= abfd
->archive_head
;
5398 /* Some initialization. */
5402 /* Iterate over each BFD within this archive. */
5403 while (curr_bfd
!= NULL
)
5405 unsigned int curr_count
, i
;
5406 som_symbol_type
*sym
;
5408 /* Don't bother for non-SOM objects. */
5409 if (curr_bfd
->format
!= bfd_object
5410 || curr_bfd
->xvec
->flavour
!= bfd_target_som_flavour
)
5412 curr_bfd
= curr_bfd
->next
;
5416 /* Make sure the symbol table has been read, then snag a pointer
5417 to it. It's a little slimey to grab the symbols via obj_som_symtab,
5418 but doing so avoids allocating lots of extra memory. */
5419 if (som_slurp_symbol_table (curr_bfd
) == false)
5422 sym
= obj_som_symtab (curr_bfd
);
5423 curr_count
= bfd_get_symcount (curr_bfd
);
5425 /* Examine each symbol to determine if it belongs in the
5426 library symbol table. */
5427 for (i
= 0; i
< curr_count
; i
++, sym
++)
5429 struct som_misc_symbol_info info
;
5431 /* Derive SOM information from the BFD symbol. */
5432 som_bfd_derive_misc_symbol_info (curr_bfd
, &sym
->symbol
, &info
);
5434 /* Should we include this symbol? */
5435 if (info
.symbol_type
== ST_NULL
5436 || info
.symbol_type
== ST_SYM_EXT
5437 || info
.symbol_type
== ST_ARG_EXT
)
5440 /* Only global symbols and unsatisfied commons. */
5441 if (info
.symbol_scope
!= SS_UNIVERSAL
5442 && info
.symbol_type
!= ST_STORAGE
)
5445 /* Do no include undefined symbols. */
5446 if (bfd_is_und_section (sym
->symbol
.section
))
5449 /* Bump the various counters, being careful to honor
5450 alignment considerations in the string table. */
5452 *stringsize
= *stringsize
+ strlen (sym
->symbol
.name
) + 5;
5453 while (*stringsize
% 4)
5457 curr_bfd
= curr_bfd
->next
;
5462 /* Hash a symbol name based on the hashing algorithm presented in the
5465 som_bfd_ar_symbol_hash (symbol
)
5468 unsigned int len
= strlen (symbol
->name
);
5470 /* Names with length 1 are special. */
5472 return 0x1000100 | (symbol
->name
[0] << 16) | symbol
->name
[0];
5474 return ((len
& 0x7f) << 24) | (symbol
->name
[1] << 16)
5475 | (symbol
->name
[len
-2] << 8) | symbol
->name
[len
-1];
5482 CONST
char *filename
= strrchr (file
, '/');
5484 if (filename
!= NULL
)
5491 /* Do the bulk of the work required to write the SOM library
5495 som_bfd_ar_write_symbol_stuff (abfd
, nsyms
, string_size
, lst
)
5497 unsigned int nsyms
, string_size
;
5498 struct lst_header lst
;
5500 file_ptr lst_filepos
;
5501 char *strings
= NULL
, *p
;
5502 struct lst_symbol_record
*lst_syms
= NULL
, *curr_lst_sym
;
5504 unsigned int *hash_table
= NULL
;
5505 struct som_entry
*som_dict
= NULL
;
5506 struct lst_symbol_record
**last_hash_entry
= NULL
;
5507 unsigned int curr_som_offset
, som_index
, extended_name_length
= 0;
5508 unsigned int maxname
= abfd
->xvec
->ar_max_namelen
;
5511 (unsigned int *) malloc (lst
.hash_size
* sizeof (unsigned int));
5512 if (hash_table
== NULL
&& lst
.hash_size
!= 0)
5514 bfd_set_error (bfd_error_no_memory
);
5518 (struct som_entry
*) malloc (lst
.module_count
5519 * sizeof (struct som_entry
));
5520 if (som_dict
== NULL
&& lst
.module_count
!= 0)
5522 bfd_set_error (bfd_error_no_memory
);
5527 ((struct lst_symbol_record
**)
5528 malloc (lst
.hash_size
* sizeof (struct lst_symbol_record
*)));
5529 if (last_hash_entry
== NULL
&& lst
.hash_size
!= 0)
5531 bfd_set_error (bfd_error_no_memory
);
5535 /* Lots of fields are file positions relative to the start
5536 of the lst record. So save its location. */
5537 lst_filepos
= bfd_tell (abfd
) - sizeof (struct lst_header
);
5539 /* Some initialization. */
5540 memset (hash_table
, 0, 4 * lst
.hash_size
);
5541 memset (som_dict
, 0, lst
.module_count
* sizeof (struct som_entry
));
5542 memset (last_hash_entry
, 0,
5543 lst
.hash_size
* sizeof (struct lst_symbol_record
*));
5545 /* Symbols have som_index fields, so we have to keep track of the
5546 index of each SOM in the archive.
5548 The SOM dictionary has (among other things) the absolute file
5549 position for the SOM which a particular dictionary entry
5550 describes. We have to compute that information as we iterate
5551 through the SOMs/symbols. */
5553 curr_som_offset
= 8 + 2 * sizeof (struct ar_hdr
) + lst
.file_end
;
5555 /* Yow! We have to know the size of the extended name table
5557 for (curr_bfd
= abfd
->archive_head
;
5559 curr_bfd
= curr_bfd
->next
)
5561 CONST
char *normal
= normalize (curr_bfd
->filename
);
5562 unsigned int thislen
;
5566 bfd_set_error (bfd_error_no_memory
);
5569 thislen
= strlen (normal
);
5570 if (thislen
> maxname
)
5571 extended_name_length
+= thislen
+ 1;
5574 /* Make room for the archive header and the contents of the
5575 extended string table. */
5576 if (extended_name_length
)
5577 curr_som_offset
+= extended_name_length
+ sizeof (struct ar_hdr
);
5579 /* Make sure we're properly aligned. */
5580 curr_som_offset
= (curr_som_offset
+ 0x1) & ~0x1;
5582 /* FIXME should be done with buffers just like everything else... */
5583 lst_syms
= malloc (nsyms
* sizeof (struct lst_symbol_record
));
5584 if (lst_syms
== NULL
&& nsyms
!= 0)
5586 bfd_set_error (bfd_error_no_memory
);
5589 strings
= malloc (string_size
);
5590 if (strings
== NULL
&& string_size
!= 0)
5592 bfd_set_error (bfd_error_no_memory
);
5597 curr_lst_sym
= lst_syms
;
5599 curr_bfd
= abfd
->archive_head
;
5600 while (curr_bfd
!= NULL
)
5602 unsigned int curr_count
, i
;
5603 som_symbol_type
*sym
;
5605 /* Don't bother for non-SOM objects. */
5606 if (curr_bfd
->format
!= bfd_object
5607 || curr_bfd
->xvec
->flavour
!= bfd_target_som_flavour
)
5609 curr_bfd
= curr_bfd
->next
;
5613 /* Make sure the symbol table has been read, then snag a pointer
5614 to it. It's a little slimey to grab the symbols via obj_som_symtab,
5615 but doing so avoids allocating lots of extra memory. */
5616 if (som_slurp_symbol_table (curr_bfd
) == false)
5619 sym
= obj_som_symtab (curr_bfd
);
5620 curr_count
= bfd_get_symcount (curr_bfd
);
5622 for (i
= 0; i
< curr_count
; i
++, sym
++)
5624 struct som_misc_symbol_info info
;
5626 /* Derive SOM information from the BFD symbol. */
5627 som_bfd_derive_misc_symbol_info (curr_bfd
, &sym
->symbol
, &info
);
5629 /* Should we include this symbol? */
5630 if (info
.symbol_type
== ST_NULL
5631 || info
.symbol_type
== ST_SYM_EXT
5632 || info
.symbol_type
== ST_ARG_EXT
)
5635 /* Only global symbols and unsatisfied commons. */
5636 if (info
.symbol_scope
!= SS_UNIVERSAL
5637 && info
.symbol_type
!= ST_STORAGE
)
5640 /* Do no include undefined symbols. */
5641 if (bfd_is_und_section (sym
->symbol
.section
))
5644 /* If this is the first symbol from this SOM, then update
5645 the SOM dictionary too. */
5646 if (som_dict
[som_index
].location
== 0)
5648 som_dict
[som_index
].location
= curr_som_offset
;
5649 som_dict
[som_index
].length
= arelt_size (curr_bfd
);
5652 /* Fill in the lst symbol record. */
5653 curr_lst_sym
->hidden
= 0;
5654 curr_lst_sym
->secondary_def
= 0;
5655 curr_lst_sym
->symbol_type
= info
.symbol_type
;
5656 curr_lst_sym
->symbol_scope
= info
.symbol_scope
;
5657 curr_lst_sym
->check_level
= 0;
5658 curr_lst_sym
->must_qualify
= 0;
5659 curr_lst_sym
->initially_frozen
= 0;
5660 curr_lst_sym
->memory_resident
= 0;
5661 curr_lst_sym
->is_common
= bfd_is_com_section (sym
->symbol
.section
);
5662 curr_lst_sym
->dup_common
= 0;
5663 curr_lst_sym
->xleast
= 0;
5664 curr_lst_sym
->arg_reloc
= info
.arg_reloc
;
5665 curr_lst_sym
->name
.n_strx
= p
- strings
+ 4;
5666 curr_lst_sym
->qualifier_name
.n_strx
= 0;
5667 curr_lst_sym
->symbol_info
= info
.symbol_info
;
5668 curr_lst_sym
->symbol_value
= info
.symbol_value
;
5669 curr_lst_sym
->symbol_descriptor
= 0;
5670 curr_lst_sym
->reserved
= 0;
5671 curr_lst_sym
->som_index
= som_index
;
5672 curr_lst_sym
->symbol_key
= som_bfd_ar_symbol_hash (&sym
->symbol
);
5673 curr_lst_sym
->next_entry
= 0;
5675 /* Insert into the hash table. */
5676 if (hash_table
[curr_lst_sym
->symbol_key
% lst
.hash_size
])
5678 struct lst_symbol_record
*tmp
;
5680 /* There is already something at the head of this hash chain,
5681 so tack this symbol onto the end of the chain. */
5682 tmp
= last_hash_entry
[curr_lst_sym
->symbol_key
% lst
.hash_size
];
5684 = (curr_lst_sym
- lst_syms
) * sizeof (struct lst_symbol_record
)
5686 + lst
.module_count
* sizeof (struct som_entry
)
5687 + sizeof (struct lst_header
);
5691 /* First entry in this hash chain. */
5692 hash_table
[curr_lst_sym
->symbol_key
% lst
.hash_size
]
5693 = (curr_lst_sym
- lst_syms
) * sizeof (struct lst_symbol_record
)
5695 + lst
.module_count
* sizeof (struct som_entry
)
5696 + sizeof (struct lst_header
);
5699 /* Keep track of the last symbol we added to this chain so we can
5700 easily update its next_entry pointer. */
5701 last_hash_entry
[curr_lst_sym
->symbol_key
% lst
.hash_size
]
5705 /* Update the string table. */
5706 bfd_put_32 (abfd
, strlen (sym
->symbol
.name
), p
);
5708 strcpy (p
, sym
->symbol
.name
);
5709 p
+= strlen (sym
->symbol
.name
) + 1;
5712 bfd_put_8 (abfd
, 0, p
);
5716 /* Head to the next symbol. */
5720 /* Keep track of where each SOM will finally reside; then look
5722 curr_som_offset
+= arelt_size (curr_bfd
) + sizeof (struct ar_hdr
);
5724 /* A particular object in the archive may have an odd length; the
5725 linker requires objects begin on an even boundary. So round
5726 up the current offset as necessary. */
5727 curr_som_offset
= (curr_som_offset
+ 0x1) & ~0x1;
5728 curr_bfd
= curr_bfd
->next
;
5732 /* Now scribble out the hash table. */
5733 if (bfd_write ((PTR
) hash_table
, lst
.hash_size
, 4, abfd
)
5734 != lst
.hash_size
* 4)
5737 /* Then the SOM dictionary. */
5738 if (bfd_write ((PTR
) som_dict
, lst
.module_count
,
5739 sizeof (struct som_entry
), abfd
)
5740 != lst
.module_count
* sizeof (struct som_entry
))
5743 /* The library symbols. */
5744 if (bfd_write ((PTR
) lst_syms
, nsyms
, sizeof (struct lst_symbol_record
), abfd
)
5745 != nsyms
* sizeof (struct lst_symbol_record
))
5748 /* And finally the strings. */
5749 if (bfd_write ((PTR
) strings
, string_size
, 1, abfd
) != string_size
)
5752 if (hash_table
!= NULL
)
5754 if (som_dict
!= NULL
)
5756 if (last_hash_entry
!= NULL
)
5757 free (last_hash_entry
);
5758 if (lst_syms
!= NULL
)
5760 if (strings
!= NULL
)
5765 if (hash_table
!= NULL
)
5767 if (som_dict
!= NULL
)
5769 if (last_hash_entry
!= NULL
)
5770 free (last_hash_entry
);
5771 if (lst_syms
!= NULL
)
5773 if (strings
!= NULL
)
5779 /* SOM almost uses the SVR4 style extended name support, but not
5783 som_construct_extended_name_table (abfd
, tabloc
, tablen
, name
)
5786 bfd_size_type
*tablen
;
5790 return _bfd_construct_extended_name_table (abfd
, false, tabloc
, tablen
);
5793 /* Write out the LST for the archive.
5795 You'll never believe this is really how armaps are handled in SOM... */
5799 som_write_armap (abfd
, elength
, map
, orl_count
, stridx
)
5801 unsigned int elength
;
5803 unsigned int orl_count
;
5807 struct stat statbuf
;
5808 unsigned int i
, lst_size
, nsyms
, stringsize
;
5810 struct lst_header lst
;
5813 /* We'll use this for the archive's date and mode later. */
5814 if (stat (abfd
->filename
, &statbuf
) != 0)
5816 bfd_set_error (bfd_error_system_call
);
5820 bfd_ardata (abfd
)->armap_timestamp
= statbuf
.st_mtime
+ 60;
5822 /* Account for the lst header first. */
5823 lst_size
= sizeof (struct lst_header
);
5825 /* Start building the LST header. */
5826 /* FIXME: Do we need to examine each element to determine the
5827 largest id number? */
5828 lst
.system_id
= CPU_PA_RISC1_0
;
5829 lst
.a_magic
= LIBMAGIC
;
5830 lst
.version_id
= VERSION_ID
;
5831 lst
.file_time
.secs
= 0;
5832 lst
.file_time
.nanosecs
= 0;
5834 lst
.hash_loc
= lst_size
;
5835 lst
.hash_size
= SOM_LST_HASH_SIZE
;
5837 /* Hash table is a SOM_LST_HASH_SIZE 32bit offsets. */
5838 lst_size
+= 4 * SOM_LST_HASH_SIZE
;
5840 /* We need to count the number of SOMs in this archive. */
5841 curr_bfd
= abfd
->archive_head
;
5842 lst
.module_count
= 0;
5843 while (curr_bfd
!= NULL
)
5845 /* Only true SOM objects count. */
5846 if (curr_bfd
->format
== bfd_object
5847 && curr_bfd
->xvec
->flavour
== bfd_target_som_flavour
)
5849 curr_bfd
= curr_bfd
->next
;
5851 lst
.module_limit
= lst
.module_count
;
5852 lst
.dir_loc
= lst_size
;
5853 lst_size
+= sizeof (struct som_entry
) * lst
.module_count
;
5855 /* We don't support import/export tables, auxiliary headers,
5856 or free lists yet. Make the linker work a little harder
5857 to make our life easier. */
5860 lst
.export_count
= 0;
5865 /* Count how many symbols we will have on the hash chains and the
5866 size of the associated string table. */
5867 if (som_bfd_prep_for_ar_write (abfd
, &nsyms
, &stringsize
) == false)
5870 lst_size
+= sizeof (struct lst_symbol_record
) * nsyms
;
5872 /* For the string table. One day we might actually use this info
5873 to avoid small seeks/reads when reading archives. */
5874 lst
.string_loc
= lst_size
;
5875 lst
.string_size
= stringsize
;
5876 lst_size
+= stringsize
;
5878 /* SOM ABI says this must be zero. */
5880 lst
.file_end
= lst_size
;
5882 /* Compute the checksum. Must happen after the entire lst header
5886 for (i
= 0; i
< sizeof (struct lst_header
)/sizeof (int) - 1; i
++)
5887 lst
.checksum
^= *p
++;
5889 sprintf (hdr
.ar_name
, "/ ");
5890 sprintf (hdr
.ar_date
, "%ld", bfd_ardata (abfd
)->armap_timestamp
);
5891 sprintf (hdr
.ar_uid
, "%ld", (long) getuid ());
5892 sprintf (hdr
.ar_gid
, "%ld", (long) getgid ());
5893 sprintf (hdr
.ar_mode
, "%-8o", (unsigned int) statbuf
.st_mode
);
5894 sprintf (hdr
.ar_size
, "%-10d", (int) lst_size
);
5895 hdr
.ar_fmag
[0] = '`';
5896 hdr
.ar_fmag
[1] = '\012';
5898 /* Turn any nulls into spaces. */
5899 for (i
= 0; i
< sizeof (struct ar_hdr
); i
++)
5900 if (((char *) (&hdr
))[i
] == '\0')
5901 (((char *) (&hdr
))[i
]) = ' ';
5903 /* Scribble out the ar header. */
5904 if (bfd_write ((PTR
) &hdr
, 1, sizeof (struct ar_hdr
), abfd
)
5905 != sizeof (struct ar_hdr
))
5908 /* Now scribble out the lst header. */
5909 if (bfd_write ((PTR
) &lst
, 1, sizeof (struct lst_header
), abfd
)
5910 != sizeof (struct lst_header
))
5913 /* Build and write the armap. */
5914 if (som_bfd_ar_write_symbol_stuff (abfd
, nsyms
, stringsize
, lst
) == false)
5921 /* Free all information we have cached for this BFD. We can always
5922 read it again later if we need it. */
5925 som_bfd_free_cached_info (abfd
)
5930 if (bfd_get_format (abfd
) != bfd_object
)
5933 #define FREE(x) if (x != NULL) { free (x); x = NULL; }
5934 /* Free the native string and symbol tables. */
5935 FREE (obj_som_symtab (abfd
));
5936 FREE (obj_som_stringtab (abfd
));
5937 for (o
= abfd
->sections
; o
!= (asection
*) NULL
; o
= o
->next
)
5939 /* Free the native relocations. */
5940 o
->reloc_count
= -1;
5941 FREE (som_section_data (o
)->reloc_stream
);
5942 /* Free the generic relocations. */
5943 FREE (o
->relocation
);
5950 /* End of miscellaneous support functions. */
5952 /* Linker support functions. */
5954 som_bfd_link_split_section (abfd
, sec
)
5958 return (som_is_subspace (sec
) && sec
->_raw_size
> 240000);
5961 #define som_close_and_cleanup som_bfd_free_cached_info
5963 #define som_openr_next_archived_file bfd_generic_openr_next_archived_file
5964 #define som_generic_stat_arch_elt bfd_generic_stat_arch_elt
5965 #define som_truncate_arname bfd_bsd_truncate_arname
5966 #define som_slurp_extended_name_table _bfd_slurp_extended_name_table
5967 #define som_update_armap_timestamp bfd_true
5968 #define som_bfd_print_private_bfd_data _bfd_generic_bfd_print_private_bfd_data
5970 #define som_get_lineno _bfd_nosymbols_get_lineno
5971 #define som_bfd_make_debug_symbol _bfd_nosymbols_bfd_make_debug_symbol
5972 #define som_read_minisymbols _bfd_generic_read_minisymbols
5973 #define som_minisymbol_to_symbol _bfd_generic_minisymbol_to_symbol
5975 #define som_bfd_get_relocated_section_contents \
5976 bfd_generic_get_relocated_section_contents
5977 #define som_bfd_relax_section bfd_generic_relax_section
5978 #define som_bfd_link_hash_table_create _bfd_generic_link_hash_table_create
5979 #define som_bfd_link_add_symbols _bfd_generic_link_add_symbols
5980 #define som_bfd_final_link _bfd_generic_final_link
5982 const bfd_target som_vec
=
5985 bfd_target_som_flavour
,
5986 true, /* target byte order */
5987 true, /* target headers byte order */
5988 (HAS_RELOC
| EXEC_P
| /* object flags */
5989 HAS_LINENO
| HAS_DEBUG
|
5990 HAS_SYMS
| HAS_LOCALS
| WP_TEXT
| D_PAGED
| DYNAMIC
),
5991 (SEC_CODE
| SEC_DATA
| SEC_ROM
| SEC_HAS_CONTENTS
5992 | SEC_ALLOC
| SEC_LOAD
| SEC_RELOC
), /* section flags */
5994 /* leading_symbol_char: is the first char of a user symbol
5995 predictable, and if so what is it */
5997 '/', /* ar_pad_char */
5998 14, /* ar_max_namelen */
5999 bfd_getb64
, bfd_getb_signed_64
, bfd_putb64
,
6000 bfd_getb32
, bfd_getb_signed_32
, bfd_putb32
,
6001 bfd_getb16
, bfd_getb_signed_16
, bfd_putb16
, /* data */
6002 bfd_getb64
, bfd_getb_signed_64
, bfd_putb64
,
6003 bfd_getb32
, bfd_getb_signed_32
, bfd_putb32
,
6004 bfd_getb16
, bfd_getb_signed_16
, bfd_putb16
, /* hdrs */
6006 som_object_p
, /* bfd_check_format */
6007 bfd_generic_archive_p
,
6013 _bfd_generic_mkarchive
,
6018 som_write_object_contents
,
6019 _bfd_write_archive_contents
,
6024 BFD_JUMP_TABLE_GENERIC (som
),
6025 BFD_JUMP_TABLE_COPY (som
),
6026 BFD_JUMP_TABLE_CORE (_bfd_nocore
),
6027 BFD_JUMP_TABLE_ARCHIVE (som
),
6028 BFD_JUMP_TABLE_SYMBOLS (som
),
6029 BFD_JUMP_TABLE_RELOCS (som
),
6030 BFD_JUMP_TABLE_WRITE (som
),
6031 BFD_JUMP_TABLE_LINK (som
),
6032 BFD_JUMP_TABLE_DYNAMIC (_bfd_nodynamic
),
6037 #endif /* HOST_HPPAHPUX || HOST_HPPABSD || HOST_HPPAOSF */