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