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