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