]> Git Repo - binutils.git/blame - bfd/som.c
projects / binutils.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
* libbfd.c, bfd-in.h, hosts/alphaosf.h, hosts/sparc-ll.h, aoutf1.h,
[binutils.git] / bfd / som.c
CommitLineData
d9ad93bc
KR		 1/* bfd back-end for HP PA-RISC SOM objects.
2 Copyright (C) 1990, 1991, 1992, 1993 Free Software Foundation, Inc.
3
4 Contributed by the Center for Software Science at the
5 University of Utah ([email protected]).
6
9e16fcf1 7 This file is part of BFD, the Binary File Descriptor library.
d9ad93bc 8
9e16fcf1
SG		 9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2 of the License, or
12 (at your option) any later version.
d9ad93bc 13
9e16fcf1
SG		 14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
d9ad93bc 18
9e16fcf1
SG		 19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
d9ad93bc
KR		 22
23#include "bfd.h"
24#include "sysdep.h"
25
d9ad93bc
KR		 26#if defined (HOST_HPPAHPUX) || defined (HOST_HPPABSD)
27
28#include "libbfd.h"
29#include "som.h"
70f1d738 30#include "libhppa.h"
d9ad93bc
KR		 31
32#include <stdio.h>
33#include <sys/types.h>
34#include <sys/param.h>
35#include <sys/dir.h>
36#include <signal.h>
37#include <machine/reg.h>
38#include <sys/user.h> /* After a.out.h */
39#include <sys/file.h>
40#include <errno.h>
41
42/* Magic not defined in standard HP-UX header files until 8.0 */
43
44#ifndef CPU_PA_RISC1_0
45#define CPU_PA_RISC1_0 0x20B
46#endif /* CPU_PA_RISC1_0 */
47
48#ifndef CPU_PA_RISC1_1
49#define CPU_PA_RISC1_1 0x210
50#endif /* CPU_PA_RISC1_1 */
51
52#ifndef _PA_RISC1_0_ID
53#define _PA_RISC1_0_ID CPU_PA_RISC1_0
54#endif /* _PA_RISC1_0_ID */
55
56#ifndef _PA_RISC1_1_ID
57#define _PA_RISC1_1_ID CPU_PA_RISC1_1
58#endif /* _PA_RISC1_1_ID */
59
60#ifndef _PA_RISC_MAXID
61#define _PA_RISC_MAXID 0x2FF
62#endif /* _PA_RISC_MAXID */
63
64#ifndef _PA_RISC_ID
65#define _PA_RISC_ID(__m_num) \
66 (((__m_num) == _PA_RISC1_0_ID) || \
67 ((__m_num) >= _PA_RISC1_1_ID && (__m_num) <= _PA_RISC_MAXID))
68#endif /* _PA_RISC_ID */
69
9d0dea6f
JL		 70/* Size (in chars) of the temporary buffers used during fixup and string
71 table writes. */
72
73#define SOM_TMP_BUFSIZE 8192
74
75
4fdb66cd
JL		 76/* SOM allows any one of the four previous relocations to be reused
77 with a "R_PREV_FIXUP" relocation entry. Since R_PREV_FIXUP
78 relocations are always a single byte, using a R_PREV_FIXUP instead
79 of some multi-byte relocation makes object files smaller.
80
81 Note one side effect of using a R_PREV_FIXUP is the relocation that
82 is being repeated moves to the front of the queue. */
83struct reloc_queue
84 {
85 unsigned char *reloc;
86 unsigned int size;
87 } reloc_queue[4];
88
89/* This fully describes the symbol types which may be attached to
90 an EXPORT or IMPORT directive. Only SOM uses this formation
91 (ELF has no need for it). */
92typedef enum
93{
94 SYMBOL_TYPE_UNKNOWN,
95 SYMBOL_TYPE_ABSOLUTE,
96 SYMBOL_TYPE_CODE,
97 SYMBOL_TYPE_DATA,
98 SYMBOL_TYPE_ENTRY,
99 SYMBOL_TYPE_MILLICODE,
100 SYMBOL_TYPE_PLABEL,
101 SYMBOL_TYPE_PRI_PROG,
102 SYMBOL_TYPE_SEC_PROG,
103} pa_symbol_type;
104
017a52d7
JL		 105struct section_to_type
106{
107 char *section;
108 char type;
109};
110
9e16fcf1
SG		 111/* Forward declarations */
112
113static boolean som_mkobject PARAMS ((bfd *));
114static bfd_target * som_object_setup PARAMS ((bfd *,
115 struct header *,
116 struct som_exec_auxhdr *));
117static asection * make_unique_section PARAMS ((bfd *, CONST char *, int));
118static boolean setup_sections PARAMS ((bfd *, struct header *));
119static bfd_target * som_object_p PARAMS ((bfd *));
120static boolean som_write_object_contents PARAMS ((bfd *));
121static boolean som_slurp_string_table PARAMS ((bfd *));
122static unsigned int som_slurp_symbol_table PARAMS ((bfd *));
123static unsigned int som_get_symtab_upper_bound PARAMS ((bfd *));
124static unsigned int som_canonicalize_reloc PARAMS ((bfd *, sec_ptr,
125 arelent **, asymbol **));
126static unsigned int som_get_reloc_upper_bound PARAMS ((bfd *, sec_ptr));
36456a67
JL		 127static unsigned int som_set_reloc_info PARAMS ((unsigned char *, unsigned int,
128 arelent *, asection *,
129 asymbol **, boolean));
130static boolean som_slurp_reloc_table PARAMS ((bfd *, asection *,
131 asymbol **, boolean));
9e16fcf1
SG		 132static unsigned int som_get_symtab PARAMS ((bfd *, asymbol **));
133static asymbol * som_make_empty_symbol PARAMS ((bfd *));
134static void som_print_symbol PARAMS ((bfd *, PTR,
135 asymbol *, bfd_print_symbol_type));
136static boolean som_new_section_hook PARAMS ((bfd *, asection *));
137static boolean som_set_section_contents PARAMS ((bfd *, sec_ptr, PTR,
138 file_ptr, bfd_size_type));
139static boolean som_set_arch_mach PARAMS ((bfd *, enum bfd_architecture,
140 unsigned long));
141static boolean som_find_nearest_line PARAMS ((bfd *, asection *,
142 asymbol **, bfd_vma,
143 CONST char **,
144 CONST char **,
145 unsigned int *));
146static void som_get_symbol_info PARAMS ((bfd *, asymbol *, symbol_info *));
147static asection * som_section_from_subspace_index PARAMS ((bfd *,
148 unsigned int));
149static int log2 PARAMS ((unsigned int));
fcb0c846
JL		 150static bfd_reloc_status_type hppa_som_reloc PARAMS ((bfd *, arelent *,
151 asymbol *, PTR,
39961154
JL		 152 asection *, bfd *,
153 char **));
d125665c
JL		 154static void som_initialize_reloc_queue PARAMS ((struct reloc_queue *));
155static void som_reloc_queue_insert PARAMS ((unsigned char *, unsigned int,
156 struct reloc_queue *));
157static void som_reloc_queue_fix PARAMS ((struct reloc_queue *, unsigned int));
158static int som_reloc_queue_find PARAMS ((unsigned char *, unsigned int,
159 struct reloc_queue *));
54bbfd37
JL		 160static unsigned char * try_prev_fixup PARAMS ((bfd *, int *, unsigned char *,
161 unsigned int,
162 struct reloc_queue *));
163
164static unsigned char * som_reloc_skip PARAMS ((bfd *, unsigned int,
165 unsigned char *, unsigned int *,
166 struct reloc_queue *));
167static unsigned char * som_reloc_addend PARAMS ((bfd *, int, unsigned char *,
168 unsigned int *,
169 struct reloc_queue *));
7057b78f
JL		 170static unsigned char * som_reloc_call PARAMS ((bfd *, unsigned char *,
171 unsigned int *,
172 arelent *, int,
173 struct reloc_queue *));
5532fc5a
JL		 174static unsigned long som_count_spaces PARAMS ((bfd *));
175static unsigned long som_count_subspaces PARAMS ((bfd *));
176static int compare_syms PARAMS ((asymbol **, asymbol **));
177static unsigned long som_compute_checksum PARAMS ((bfd *));
0ffa24b9 178static boolean som_prep_headers PARAMS ((bfd *));
2212ff92 179static int som_sizeof_headers PARAMS ((bfd *, boolean));
efc0df7c 180static boolean som_write_headers PARAMS ((bfd *));
713de7ec 181static boolean som_build_and_write_symbol_table PARAMS ((bfd *));
aff97790 182static void som_prep_for_fixups PARAMS ((bfd *, asymbol **, unsigned long));
9d0dea6f 183static boolean som_write_fixups PARAMS ((bfd *, unsigned long, unsigned int *));
0b35f7ec
JL		 184static boolean som_write_space_strings PARAMS ((bfd *, unsigned long,
185 unsigned int *));
186static boolean som_write_symbol_strings PARAMS ((bfd *, unsigned long,
187 asymbol **, unsigned int,
188 unsigned *));
6eb64408 189static boolean som_begin_writing PARAMS ((bfd *));
91c0bcbb
JL		 190static const reloc_howto_type * som_bfd_reloc_type_lookup
191 PARAMS ((bfd_arch_info_type *, bfd_reloc_code_real_type));
017a52d7
JL		 192static char som_section_type PARAMS ((const char *));
193static int som_decode_symclass PARAMS ((asymbol *));
194
195
196/* Map SOM section names to POSIX/BSD single-character symbol types.
197
198 This table includes all the standard subspaces as defined in the
199 current "PRO ABI for PA-RISC Systems", $UNWIND$ which for
200 some reason was left out, and sections specific to embedded stabs. */
201
202static const struct section_to_type stt[] = {
203 {"$TEXT$", 't'},
204 {"$SHLIB_INFO$", 't'},
205 {"$MILLICODE$", 't'},
206 {"$LIT$", 't'},
207 {"$CODE$", 't'},
208 {"$UNWIND_START$", 't'},
209 {"$UNWIND$", 't'},
210 {"$PRIVATE$", 'd'},
211 {"$PLT$", 'd'},
212 {"$SHLIB_DATA$", 'd'},
213 {"$DATA$", 'd'},
214 {"$SHORTDATA$", 'g'},
215 {"$DLT$", 'd'},
216 {"$GLOBAL$", 'g'},
217 {"$SHORTBSS$", 's'},
218 {"$BSS$", 'b'},
219 {"$GDB_STRINGS$", 'N'},
220 {"$GDB_SYMBOLS$", 'N'},
221 {0, 0}
222};
2212ff92 223
36456a67
JL		 224/* About the relocation formatting table...
225
226 There are 256 entries in the table, one for each possible
227 relocation opcode available in SOM. We index the table by
228 the relocation opcode. The names and operations are those
229 defined by a.out_800 (4).
230
231 Right now this table is only used to count and perform minimal
232 processing on relocation streams so that they can be internalized
233 into BFD and symbolically printed by utilities. To make actual use
234 of them would be much more difficult, BFD's concept of relocations
235 is far too simple to handle SOM relocations. The basic assumption
236 that a relocation can be completely processed independent of other
237 relocations before an object file is written is invalid for SOM.
238
239 The SOM relocations are meant to be processed as a stream, they
240 specify copying of data from the input section to the output section
241 while possibly modifying the data in some manner. They also can
242 specify that a variable number of zeros or uninitialized data be
243 inserted on in the output segment at the current offset. Some
244 relocations specify that some previous relocation be re-applied at
245 the current location in the input/output sections. And finally a number
246 of relocations have effects on other sections (R_ENTRY, R_EXIT,
247 R_UNWIND_AUX and a variety of others). There isn't even enough room
248 in the BFD relocation data structure to store enough information to
249 perform all the relocations.
250
251 Each entry in the table has three fields.
252
253 The first entry is an index into this "class" of relocations. This
254 index can then be used as a variable within the relocation itself.
255
256 The second field is a format string which actually controls processing
257 of the relocation. It uses a simple postfix machine to do calculations
258 based on variables/constants found in the string and the relocation
259 stream.
260
261 The third field specifys whether or not this relocation may use
262 a constant (V) from the previous R_DATA_OVERRIDE rather than a constant
263 stored in the instruction.
264
265 Variables:
266
267 L = input space byte count
268 D = index into class of relocations
269 M = output space byte count
270 N = statement number (unused?)
271 O = stack operation
272 R = parameter relocation bits
273 S = symbol index
274 U = 64 bits of stack unwind and frame size info (we only keep 32 bits)
275 V = a literal constant (usually used in the next relocation)
276 P = a previous relocation
277
278 Lower case letters (starting with 'b') refer to following
279 bytes in the relocation stream. 'b' is the next 1 byte,
280 c is the next 2 bytes, d is the next 3 bytes, etc...
281 This is the variable part of the relocation entries that
282 makes our life a living hell.
283
284 numerical constants are also used in the format string. Note
285 the constants are represented in decimal.
286
287 '+', "*" and "=" represents the obvious postfix operators.
288 '<' represents a left shift.
289
290 Stack Operations:
291
292 Parameter Relocation Bits:
293
294 Unwind Entries:
295
296 Previous Relocations: The index field represents which in the queue
297 of 4 previous fixups should be re-applied.
298
299 Literal Constants: These are generally used to represent addend
300 parts of relocations when these constants are not stored in the
301 fields of the instructions themselves. For example the instruction
302 addil foo-$global$-0x1234 would use an override for "0x1234" rather
303 than storing it into the addil itself. */
304
305struct fixup_format
306{
307 int D;
308 char *format;
309};
310
311static const struct fixup_format som_fixup_formats[256] =
312{
313 /* R_NO_RELOCATION */
314 0, "LD1+4*=", /* 0x00 */
315 1, "LD1+4*=", /* 0x01 */
316 2, "LD1+4*=", /* 0x02 */
317 3, "LD1+4*=", /* 0x03 */
318 4, "LD1+4*=", /* 0x04 */
319 5, "LD1+4*=", /* 0x05 */
320 6, "LD1+4*=", /* 0x06 */
321 7, "LD1+4*=", /* 0x07 */
322 8, "LD1+4*=", /* 0x08 */
323 9, "LD1+4*=", /* 0x09 */
324 10, "LD1+4*=", /* 0x0a */
325 11, "LD1+4*=", /* 0x0b */
326 12, "LD1+4*=", /* 0x0c */
327 13, "LD1+4*=", /* 0x0d */
328 14, "LD1+4*=", /* 0x0e */
329 15, "LD1+4*=", /* 0x0f */
330 16, "LD1+4*=", /* 0x10 */
331 17, "LD1+4*=", /* 0x11 */
332 18, "LD1+4*=", /* 0x12 */
333 19, "LD1+4*=", /* 0x13 */
334 20, "LD1+4*=", /* 0x14 */
335 21, "LD1+4*=", /* 0x15 */
336 22, "LD1+4*=", /* 0x16 */
337 23, "LD1+4*=", /* 0x17 */
338 0, "LD8<b+1+4*=", /* 0x18 */
339 1, "LD8<b+1+4*=", /* 0x19 */
340 2, "LD8<b+1+4*=", /* 0x1a */
341 3, "LD8<b+1+4*=", /* 0x1b */
342 0, "LD16<c+1+4*=", /* 0x1c */
343 1, "LD16<c+1+4*=", /* 0x1d */
344 2, "LD16<c+1+4*=", /* 0x1e */
345 0, "Ld1+=", /* 0x1f */
346 /* R_ZEROES */
347 0, "Lb1+4*=", /* 0x20 */
348 1, "Ld1+=", /* 0x21 */
349 /* R_UNINIT */
350 0, "Lb1+4*=", /* 0x22 */
351 1, "Ld1+=", /* 0x23 */
352 /* R_RELOCATION */
353 0, "L4=", /* 0x24 */
354 /* R_DATA_ONE_SYMBOL */
355 0, "L4=Sb=", /* 0x25 */
356 1, "L4=Sd=", /* 0x26 */
357 /* R_DATA_PLEBEL */
358 0, "L4=Sb=", /* 0x27 */
359 1, "L4=Sd=", /* 0x28 */
360 /* R_SPACE_REF */
361 0, "L4=", /* 0x29 */
362 /* R_REPEATED_INIT */
363 0, "L4=Mb1+4*=", /* 0x2a */
364 1, "Lb4*=Mb1+L*=", /* 0x2b */
365 2, "Lb4*=Md1+4*=", /* 0x2c */
366 3, "Ld1+=Me1+=", /* 0x2d */
367 /* R_RESERVED */
368 0, "", /* 0x2e */
369 0, "", /* 0x2f */
370 /* R_PCREL_CALL */
371 0, "L4=RD=Sb=", /* 0x30 */
372 1, "L4=RD=Sb=", /* 0x31 */
373 2, "L4=RD=Sb=", /* 0x32 */
374 3, "L4=RD=Sb=", /* 0x33 */
375 4, "L4=RD=Sb=", /* 0x34 */
376 5, "L4=RD=Sb=", /* 0x35 */
377 6, "L4=RD=Sb=", /* 0x36 */
378 7, "L4=RD=Sb=", /* 0x37 */
379 8, "L4=RD=Sb=", /* 0x38 */
380 9, "L4=RD=Sb=", /* 0x39 */
381 0, "L4=RD8<b+=Sb=",/* 0x3a */
382 1, "L4=RD8<b+=Sb=",/* 0x3b */
383 0, "L4=RD8<b+=Sd=",/* 0x3c */
384 1, "L4=RD8<b+=Sd=",/* 0x3d */
385 /* R_RESERVED */
386 0, "", /* 0x3e */
387 0, "", /* 0x3f */
388 /* R_ABS_CALL */
389 0, "L4=RD=Sb=", /* 0x40 */
390 1, "L4=RD=Sb=", /* 0x41 */
391 2, "L4=RD=Sb=", /* 0x42 */
392 3, "L4=RD=Sb=", /* 0x43 */
393 4, "L4=RD=Sb=", /* 0x44 */
394 5, "L4=RD=Sb=", /* 0x45 */
395 6, "L4=RD=Sb=", /* 0x46 */
396 7, "L4=RD=Sb=", /* 0x47 */
397 8, "L4=RD=Sb=", /* 0x48 */
398 9, "L4=RD=Sb=", /* 0x49 */
399 0, "L4=RD8<b+=Sb=",/* 0x4a */
400 1, "L4=RD8<b+=Sb=",/* 0x4b */
401 0, "L4=RD8<b+=Sd=",/* 0x4c */
402 1, "L4=RD8<b+=Sd=",/* 0x4d */
403 /* R_RESERVED */
404 0, "", /* 0x4e */
405 0, "", /* 0x4f */
406 /* R_DP_RELATIVE */
407 0, "L4=SD=", /* 0x50 */
408 1, "L4=SD=", /* 0x51 */
409 2, "L4=SD=", /* 0x52 */
410 3, "L4=SD=", /* 0x53 */
411 4, "L4=SD=", /* 0x54 */
412 5, "L4=SD=", /* 0x55 */
413 6, "L4=SD=", /* 0x56 */
414 7, "L4=SD=", /* 0x57 */
415 8, "L4=SD=", /* 0x58 */
416 9, "L4=SD=", /* 0x59 */
417 10, "L4=SD=", /* 0x5a */
418 11, "L4=SD=", /* 0x5b */
419 12, "L4=SD=", /* 0x5c */
420 13, "L4=SD=", /* 0x5d */
421 14, "L4=SD=", /* 0x5e */
422 15, "L4=SD=", /* 0x5f */
423 16, "L4=SD=", /* 0x60 */
424 17, "L4=SD=", /* 0x61 */
425 18, "L4=SD=", /* 0x62 */
426 19, "L4=SD=", /* 0x63 */
427 20, "L4=SD=", /* 0x64 */
428 21, "L4=SD=", /* 0x65 */
429 22, "L4=SD=", /* 0x66 */
430 23, "L4=SD=", /* 0x67 */
431 24, "L4=SD=", /* 0x68 */
432 25, "L4=SD=", /* 0x69 */
433 26, "L4=SD=", /* 0x6a */
434 27, "L4=SD=", /* 0x6b */
435 28, "L4=SD=", /* 0x6c */
436 29, "L4=SD=", /* 0x6d */
437 30, "L4=SD=", /* 0x6e */
438 31, "L4=SD=", /* 0x6f */
439 32, "L4=Sb=", /* 0x70 */
440 33, "L4=Sd=", /* 0x71 */
441 /* R_RESERVED */
442 0, "", /* 0x72 */
443 0, "", /* 0x73 */
444 0, "", /* 0x74 */
445 0, "", /* 0x75 */
446 0, "", /* 0x76 */
447 0, "", /* 0x77 */
448 /* R_DLT_REL */
449 0, "L4=Sb=", /* 0x78 */
450 1, "L4=Sd=", /* 0x79 */
451 /* R_RESERVED */
452 0, "", /* 0x7a */
453 0, "", /* 0x7b */
454 0, "", /* 0x7c */
455 0, "", /* 0x7d */
456 0, "", /* 0x7e */
457 0, "", /* 0x7f */
458 /* R_CODE_ONE_SYMBOL */
459 0, "L4=SD=", /* 0x80 */
460 1, "L4=SD=", /* 0x81 */
461 2, "L4=SD=", /* 0x82 */
462 3, "L4=SD=", /* 0x83 */
463 4, "L4=SD=", /* 0x84 */
464 5, "L4=SD=", /* 0x85 */
465 6, "L4=SD=", /* 0x86 */
466 7, "L4=SD=", /* 0x87 */
467 8, "L4=SD=", /* 0x88 */
468 9, "L4=SD=", /* 0x89 */
469 10, "L4=SD=", /* 0x8q */
470 11, "L4=SD=", /* 0x8b */
471 12, "L4=SD=", /* 0x8c */
472 13, "L4=SD=", /* 0x8d */
473 14, "L4=SD=", /* 0x8e */
474 15, "L4=SD=", /* 0x8f */
475 16, "L4=SD=", /* 0x90 */
476 17, "L4=SD=", /* 0x91 */
477 18, "L4=SD=", /* 0x92 */
478 19, "L4=SD=", /* 0x93 */
479 20, "L4=SD=", /* 0x94 */
480 21, "L4=SD=", /* 0x95 */
481 22, "L4=SD=", /* 0x96 */
482 23, "L4=SD=", /* 0x97 */
483 24, "L4=SD=", /* 0x98 */
484 25, "L4=SD=", /* 0x99 */
485 26, "L4=SD=", /* 0x9a */
486 27, "L4=SD=", /* 0x9b */
487 28, "L4=SD=", /* 0x9c */
488 29, "L4=SD=", /* 0x9d */
489 30, "L4=SD=", /* 0x9e */
490 31, "L4=SD=", /* 0x9f */
491 32, "L4=Sb=", /* 0xa0 */
492 33, "L4=Sd=", /* 0xa1 */
493 /* R_RESERVED */
494 0, "", /* 0xa2 */
495 0, "", /* 0xa3 */
496 0, "", /* 0xa4 */
497 0, "", /* 0xa5 */
498 0, "", /* 0xa6 */
499 0, "", /* 0xa7 */
500 0, "", /* 0xa8 */
501 0, "", /* 0xa9 */
502 0, "", /* 0xaa */
503 0, "", /* 0xab */
504 0, "", /* 0xac */
505 0, "", /* 0xad */
506 /* R_MILLI_REL */
507 0, "L4=Sb=", /* 0xae */
508 1, "L4=Sd=", /* 0xaf */
509 /* R_CODE_PLABEL */
510 0, "L4=Sb=", /* 0xb0 */
511 1, "L4=Sd=", /* 0xb1 */
512 /* R_BREAKPOINT */
513 0, "L4=", /* 0xb2 */
514 /* R_ENTRY */
515 0, "Ui=", /* 0xb3 */
516 1, "Uf=", /* 0xb4 */
517 /* R_ALT_ENTRY */
518 0, "", /* 0xb5 */
519 /* R_EXIT */
520 0, "", /* 0xb6 */
521 /* R_BEGIN_TRY */
522 0, "", /* 0xb7 */
523 /* R_END_TRY */
524 0, "R0=", /* 0xb8 */
525 1, "Rb4*=", /* 0xb9 */
526 2, "Rd4*=", /* 0xba */
527 /* R_BEGIN_BRTAB */
528 0, "", /* 0xbb */
529 /* R_END_BRTAB */
530 0, "", /* 0xbc */
531 /* R_STATEMENT */
532 0, "Nb=", /* 0xbd */
533 1, "Nc=", /* 0xbe */
534 2, "Nd=", /* 0xbf */
535 /* R_DATA_EXPR */
536 0, "L4=", /* 0xc0 */
537 /* R_CODE_EXPR */
538 0, "L4=", /* 0xc1 */
539 /* R_FSEL */
540 0, "", /* 0xc2 */
541 /* R_LSEL */
542 0, "", /* 0xc3 */
543 /* R_RSEL */
544 0, "", /* 0xc4 */
545 /* R_N_MODE */
546 0, "", /* 0xc5 */
547 /* R_S_MODE */
548 0, "", /* 0xc6 */
549 /* R_D_MODE */
550 0, "", /* 0xc7 */
551 /* R_R_MODE */
552 0, "", /* 0xc8 */
553 /* R_DATA_OVERRIDE */
554 0, "V0=", /* 0xc9 */
555 1, "Vb=", /* 0xca */
556 2, "Vc=", /* 0xcb */
557 3, "Vd=", /* 0xcc */
558 4, "Ve=", /* 0xcd */
559 /* R_TRANSLATED */
560 0, "", /* 0xce */
561 /* R_RESERVED */
562 0, "", /* 0xcf */
563 /* R_COMP1 */
564 0, "Ob=", /* 0xd0 */
565 /* R_COMP2 */
566 0, "Ob=Sd=", /* 0xd1 */
567 /* R_COMP3 */
568 0, "Ob=Ve=", /* 0xd2 */
569 /* R_PREV_FIXUP */
570 0, "P", /* 0xd3 */
571 1, "P", /* 0xd4 */
572 2, "P", /* 0xd5 */
573 3, "P", /* 0xd6 */
574 /* R_RESERVED */
575 0, "", /* 0xd7 */
576 0, "", /* 0xd8 */
577 0, "", /* 0xd9 */
578 0, "", /* 0xda */
579 0, "", /* 0xdb */
580 0, "", /* 0xdc */
581 0, "", /* 0xdd */
582 0, "", /* 0xde */
583 0, "", /* 0xdf */
584 0, "", /* 0xe0 */
585 0, "", /* 0xe1 */
586 0, "", /* 0xe2 */
587 0, "", /* 0xe3 */
588 0, "", /* 0xe4 */
589 0, "", /* 0xe5 */
590 0, "", /* 0xe6 */
591 0, "", /* 0xe7 */
592 0, "", /* 0xe8 */
593 0, "", /* 0xe9 */
594 0, "", /* 0xea */
595 0, "", /* 0xeb */
596 0, "", /* 0xec */
597 0, "", /* 0xed */
598 0, "", /* 0xee */
599 0, "", /* 0xef */
600 0, "", /* 0xf0 */
601 0, "", /* 0xf1 */
602 0, "", /* 0xf2 */
603 0, "", /* 0xf3 */
604 0, "", /* 0xf4 */
605 0, "", /* 0xf5 */
606 0, "", /* 0xf6 */
607 0, "", /* 0xf7 */
608 0, "", /* 0xf8 */
609 0, "", /* 0xf9 */
610 0, "", /* 0xfa */
611 0, "", /* 0xfb */
612 0, "", /* 0xfc */
613 0, "", /* 0xfd */
614 0, "", /* 0xfe */
615 0, "", /* 0xff */
616};
617
618static const int comp1_opcodes[] =
619{
620 0x00,
621 0x40,
622 0x41,
623 0x42,
624 0x43,
625 0x44,
626 0x45,
627 0x46,
628 0x47,
629 0x48,
630 0x49,
631 0x4a,
632 0x4b,
633 0x60,
634 0x80,
635 0xa0,
636 0xc0,
637 -1
638};
639
640static const int comp2_opcodes[] =
641{
642 0x00,
643 0x80,
644 0x82,
645 0xc0,
646 -1
647};
648
649static const int comp3_opcodes[] =
650{
651 0x00,
652 0x02,
653 -1
654};
655
744069b8
JL		 656/* These apparently are not in older versions of hpux reloc.h. */
657#ifndef R_DLT_REL
658#define R_DLT_REL 0x78
659#endif
660
661#ifndef R_AUX_UNWIND
662#define R_AUX_UNWIND 0xcf
663#endif
664
665#ifndef R_SEC_STMT
666#define R_SEC_STMT 0xd7
667#endif
668
fcb0c846
JL		 669static reloc_howto_type som_hppa_howto_table[] =
670{
671 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
672 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
673 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
674 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
675 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
676 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
677 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
678 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
679 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
680 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
681 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
682 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
683 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
684 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
685 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
686 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
687 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
688 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
689 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
690 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
691 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
692 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
693 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
694 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
695 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
696 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
697 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
698 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
699 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
700 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
701 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
702 {R_NO_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_NO_RELOCATION"},
703 {R_ZEROES, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ZEROES"},
704 {R_ZEROES, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ZEROES"},
705 {R_UNINIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_UNINIT"},
706 {R_UNINIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_UNINIT"},
707 {R_RELOCATION, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RELOCATION"},
708 {R_DATA_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_ONE_SYMBOL"},
709 {R_DATA_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_ONE_SYMBOL"},
710 {R_DATA_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_PLABEL"},
711 {R_DATA_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_PLABEL"},
712 {R_SPACE_REF, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_SPACE_REF"},
713 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
714 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
715 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
716 {R_REPEATED_INIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "REPEATED_INIT"},
717 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
718 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
719 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
720 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
721 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
722 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
723 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
724 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
725 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
726 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
727 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
728 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
729 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
730 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
731 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
732 {R_PCREL_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PCREL_CALL"},
733 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
734 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
735 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
736 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
737 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
738 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
739 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
740 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
741 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
742 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
743 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
744 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
745 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
746 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
747 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
748 {R_ABS_CALL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ABS_CALL"},
749 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
750 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
751 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
752 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
753 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
754 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
755 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
756 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
757 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
758 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
759 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
760 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
761 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
762 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
763 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
764 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
765 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
766 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
767 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
768 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
769 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
770 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
771 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
772 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
773 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
774 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
775 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
776 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
777 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
778 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
779 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
780 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
781 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
782 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
783 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
784 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
785 {R_DP_RELATIVE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DP_RELATIVE"},
786 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
787 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
788 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
789 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
790 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
744069b8
JL		 791 {R_DLT_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DLT_REL"},
792 {R_DLT_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DLT_REL"},
fcb0c846
JL		 793 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
794 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
795 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
796 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
797 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
798 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
799 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
800 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
801 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
802 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
803 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
804 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
805 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
806 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
807 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
808 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
809 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
810 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
811 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
812 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
813 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
814 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
815 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
816 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
817 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
818 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
819 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
820 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
821 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
822 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
823 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
824 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
825 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
826 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
827 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
828 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
829 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
830 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
831 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
832 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
833 {R_CODE_ONE_SYMBOL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_ONE_SYMBOL"},
834 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
835 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
836 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
837 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
838 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
839 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
840 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
841 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
842 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
843 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
844 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
845 {R_MILLI_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_MILLI_REL"},
846 {R_MILLI_REL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_MILLI_REL"},
847 {R_CODE_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_PLABEL"},
848 {R_CODE_PLABEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_PLABEL"},
849 {R_BREAKPOINT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BREAKPOINT"},
850 {R_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ENTRY"},
851 {R_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ENTRY"},
852 {R_ALT_ENTRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_ALT_ENTRY"},
853 {R_EXIT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_EXIT"},
854 {R_BEGIN_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BEGIN_TRY"},
855 {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_TRY"},
856 {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_TRY"},
017a52d7 857 {R_END_TRY, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_TRY"},
fcb0c846
JL		 858 {R_BEGIN_BRTAB, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_BEGIN_BRTAB"},
859 {R_END_BRTAB, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_END_BRTAB"},
860 {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"},
861 {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"},
862 {R_STATEMENT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_STATEMENT"},
863 {R_DATA_EXPR, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_EXPR"},
864 {R_CODE_EXPR, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_CODE_EXPR"},
865 {R_FSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_FSEL"},
866 {R_LSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_LSEL"},
867 {R_RSEL, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RSEL"},
868 {R_N_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_N_MODE"},
869 {R_S_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_S_MODE"},
870 {R_D_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_D_MODE"},
871 {R_R_MODE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_R_MODE"},
872 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
873 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
874 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
875 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
876 {R_DATA_OVERRIDE, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_DATA_OVERRIDE"},
fcb0c846 877 {R_TRANSLATED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_TRANSLATED"},
744069b8 878 {R_AUX_UNWIND, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_AUX_UNWIND"},
fcb0c846
JL		 879 {R_COMP1, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP1"},
880 {R_COMP2, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP2"},
881 {R_COMP3, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_COMP3"},
882 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
883 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
884 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
885 {R_PREV_FIXUP, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_PREV_FIXUP"},
744069b8 886 {R_SEC_STMT, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_SEC_STMT"},
fcb0c846
JL		 887 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
888 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
889 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
890 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
891 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
892 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
893 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
894 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
895 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
896 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
897 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
898 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
899 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
900 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
901 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
902 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
903 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
904 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
905 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
906 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
907 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
908 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
909 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
910 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
911 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
912 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
913 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
914 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
915 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
916 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
917 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
918 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
919 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
920 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
921 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
922 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
923 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
924 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
925 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"},
926 {R_RESERVED, 0, 0, 32, false, 0, 0, hppa_som_reloc, "R_RESERVED"}};
927
d125665c
JL		 928
929/* Initialize the SOM relocation queue. By definition the queue holds
930 the last four multibyte fixups. */
931
932static void
933som_initialize_reloc_queue (queue)
934 struct reloc_queue *queue;
935{
936 queue[0].reloc = NULL;
937 queue[0].size = 0;
938 queue[1].reloc = NULL;
939 queue[1].size = 0;
940 queue[2].reloc = NULL;
941 queue[2].size = 0;
942 queue[3].reloc = NULL;
943 queue[3].size = 0;
944}
945
946/* Insert a new relocation into the relocation queue. */
947
948static void
949som_reloc_queue_insert (p, size, queue)
950 unsigned char *p;
951 unsigned int size;
952 struct reloc_queue *queue;
953{
954 queue[3].reloc = queue[2].reloc;
955 queue[3].size = queue[2].size;
956 queue[2].reloc = queue[1].reloc;
957 queue[2].size = queue[1].size;
958 queue[1].reloc = queue[0].reloc;
959 queue[1].size = queue[0].size;
960 queue[0].reloc = p;
961 queue[0].size = size;
962}
963
964/* When an entry in the relocation queue is reused, the entry moves
965 to the front of the queue. */
966
967static void
968som_reloc_queue_fix (queue, index)
969 struct reloc_queue *queue;
970 unsigned int index;
971{
972 if (index == 0)
973 return;
974
975 if (index == 1)
976 {
977 unsigned char *tmp1 = queue[0].reloc;
978 unsigned int tmp2 = queue[0].size;
979 queue[0].reloc = queue[1].reloc;
980 queue[0].size = queue[1].size;
981 queue[1].reloc = tmp1;
982 queue[1].size = tmp2;
983 return;
984 }
985
986 if (index == 2)
987 {
988 unsigned char *tmp1 = queue[0].reloc;
989 unsigned int tmp2 = queue[0].size;
990 queue[0].reloc = queue[2].reloc;
991 queue[0].size = queue[2].size;
992 queue[2].reloc = queue[1].reloc;
993 queue[2].size = queue[1].size;
994 queue[1].reloc = tmp1;
995 queue[1].size = tmp2;
996 return;
997 }
998
999 if (index == 3)
1000 {
1001 unsigned char *tmp1 = queue[0].reloc;
1002 unsigned int tmp2 = queue[0].size;
1003 queue[0].reloc = queue[3].reloc;
1004 queue[0].size = queue[3].size;
1005 queue[3].reloc = queue[2].reloc;
1006 queue[3].size = queue[2].size;
1007 queue[2].reloc = queue[1].reloc;
1008 queue[2].size = queue[1].size;
1009 queue[1].reloc = tmp1;
1010 queue[1].size = tmp2;
1011 return;
1012 }
1013 abort();
1014}
1015
1016/* Search for a particular relocation in the relocation queue. */
1017
1018static int
1019som_reloc_queue_find (p, size, queue)
1020 unsigned char *p;
1021 unsigned int size;
1022 struct reloc_queue *queue;
1023{
1024 if (!bcmp (p, queue[0].reloc, size)
1025 && size == queue[0].size)
1026 return 0;
1027 if (!bcmp (p, queue[1].reloc, size)
1028 && size == queue[1].size)
1029 return 1;
1030 if (!bcmp (p, queue[2].reloc, size)
1031 && size == queue[2].size)
1032 return 2;
1033 if (!bcmp (p, queue[3].reloc, size)
1034 && size == queue[3].size)
1035 return 3;
1036 return -1;
1037}
54bbfd37
JL		 1038
1039static unsigned char *
1040try_prev_fixup (abfd, subspace_reloc_sizep, p, size, queue)
1041 bfd *abfd;
1042 int *subspace_reloc_sizep;
1043 unsigned char *p;
1044 unsigned int size;
1045 struct reloc_queue *queue;
1046{
1047 int queue_index = som_reloc_queue_find (p, size, queue);
1048
1049 if (queue_index != -1)
1050 {
1051 /* Found this in a previous fixup. Undo the fixup we
1052 just built and use R_PREV_FIXUP instead. We saved
1053 a total of size - 1 bytes in the fixup stream. */
1054 bfd_put_8 (abfd, R_PREV_FIXUP + queue_index, p);
1055 p += 1;
1056 *subspace_reloc_sizep += 1;
1057 som_reloc_queue_fix (queue, queue_index);
1058 }
1059 else
1060 {
1061 som_reloc_queue_insert (p, size, queue);
1062 *subspace_reloc_sizep += size;
1063 p += size;
1064 }
1065 return p;
1066}
1067
1068/* Emit the proper R_NO_RELOCATION fixups to map the next SKIP
1069 bytes without any relocation. Update the size of the subspace
1070 relocation stream via SUBSPACE_RELOC_SIZE_P; also return the
1071 current pointer into the relocation stream. */
1072
1073static unsigned char *
1074som_reloc_skip (abfd, skip, p, subspace_reloc_sizep, queue)
1075 bfd *abfd;
1076 unsigned int skip;
1077 unsigned char *p;
1078 unsigned int *subspace_reloc_sizep;
1079 struct reloc_queue *queue;
1080{
1081 /* Use a 4 byte R_NO_RELOCATION entry with a maximal value
1082 then R_PREV_FIXUPs to get the difference down to a
1083 reasonable size. */
1084 if (skip >= 0x1000000)
1085 {
1086 skip -= 0x1000000;
1087 bfd_put_8 (abfd, R_NO_RELOCATION + 31, p);
1088 bfd_put_8 (abfd, 0xff, p + 1);
1089 bfd_put_16 (abfd, 0xffff, p + 2);
1090 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue);
1091 while (skip >= 0x1000000)
1092 {
1093 skip -= 0x1000000;
1094 bfd_put_8 (abfd, R_PREV_FIXUP, p);
1095 p++;
1096 *subspace_reloc_sizep += 1;
1097 /* No need to adjust queue here since we are repeating the
1098 most recent fixup. */
1099 }
1100 }
1101
1102 /* The difference must be less than 0x1000000. Use one
1103 more R_NO_RELOCATION entry to get to the right difference. */
1104 if ((skip & 3) == 0 && skip <= 0xc0000 && skip > 0)
1105 {
1106 /* Difference can be handled in a simple single-byte
1107 R_NO_RELOCATION entry. */
1108 if (skip <= 0x60)
1109 {
1110 bfd_put_8 (abfd, R_NO_RELOCATION + (skip >> 2) - 1, p);
1111 *subspace_reloc_sizep += 1;
1112 p++;
1113 }
1114 /* Handle it with a two byte R_NO_RELOCATION entry. */
1115 else if (skip <= 0x1000)
1116 {
1117 bfd_put_8 (abfd, R_NO_RELOCATION + 24 + (((skip >> 2) - 1) >> 8), p);
1118 bfd_put_8 (abfd, (skip >> 2) - 1, p + 1);
1119 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1120 }
1121 /* Handle it with a three byte R_NO_RELOCATION entry. */
1122 else
1123 {
1124 bfd_put_8 (abfd, R_NO_RELOCATION + 28 + (((skip >> 2) - 1) >> 16), p);
1125 bfd_put_16 (abfd, (skip >> 2) - 1, p + 1);
1126 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue);
1127 }
1128 }
1129 /* Ugh. Punt and use a 4 byte entry. */
1130 else if (skip > 0)
1131 {
1132 bfd_put_8 (abfd, R_NO_RELOCATION + 31, p);
1133 bfd_put_8 (abfd, skip >> 16, p + 1);
1134 bfd_put_16 (abfd, skip, p + 2);
1135 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue);
1136 }
1137 return p;
1138}
1139
1140/* Emit the proper R_DATA_OVERRIDE fixups to handle a nonzero addend
1141 from a BFD relocation. Update the size of the subspace relocation
1142 stream via SUBSPACE_RELOC_SIZE_P; also return the current pointer
1143 into the relocation stream. */
1144
1145static unsigned char *
1146som_reloc_addend (abfd, addend, p, subspace_reloc_sizep, queue)
1147 bfd *abfd;
1148 int addend;
1149 unsigned char *p;
1150 unsigned int *subspace_reloc_sizep;
1151 struct reloc_queue *queue;
1152{
1153 if ((unsigned)(addend) + 0x80 < 0x100)
1154 {
1155 bfd_put_8 (abfd, R_DATA_OVERRIDE + 1, p);
1156 bfd_put_8 (abfd, addend, p + 1);
1157 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1158 }
1159 else if ((unsigned) (addend) + 0x8000 < 0x10000)
1160 {
1161 bfd_put_8 (abfd, R_DATA_OVERRIDE + 2, p);
1162 bfd_put_16 (abfd, addend, p + 1);
1163 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue);
1164 }
1165 else if ((unsigned) (addend) + 0x800000 < 0x1000000)
1166 {
1167 bfd_put_8 (abfd, R_DATA_OVERRIDE + 3, p);
1168 bfd_put_8 (abfd, addend >> 16, p + 1);
1169 bfd_put_16 (abfd, addend, p + 2);
1170 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 4, queue);
1171 }
1172 else
1173 {
1174 bfd_put_8 (abfd, R_DATA_OVERRIDE + 4, p);
1175 bfd_put_32 (abfd, addend, p + 1);
1176 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 5, queue);
1177 }
1178 return p;
1179}
1180
7057b78f
JL		 1181/* Handle a single function call relocation. */
1182
1183static unsigned char *
1184som_reloc_call (abfd, p, subspace_reloc_sizep, bfd_reloc, sym_num, queue)
1185 bfd *abfd;
1186 unsigned char *p;
1187 unsigned int *subspace_reloc_sizep;
1188 arelent *bfd_reloc;
1189 int sym_num;
1190 struct reloc_queue *queue;
1191{
1192 int arg_bits = HPPA_R_ARG_RELOC (bfd_reloc->addend);
1193 int rtn_bits = arg_bits & 0x3;
1194 int type, done = 0;
1195
1196 /* You'll never believe all this is necessary to handle relocations
1197 for function calls. Having to compute and pack the argument
1198 relocation bits is the real nightmare.
1199
1200 If you're interested in how this works, just forget it. You really
1201 do not want to know about this braindamage. */
1202
1203 /* First see if this can be done with a "simple" relocation. Simple
1204 relocations have a symbol number < 0x100 and have simple encodings
1205 of argument relocations. */
1206
1207 if (sym_num < 0x100)
1208 {
1209 switch (arg_bits)
1210 {
1211 case 0:
1212 case 1:
1213 type = 0;
1214 break;
1215 case 1 << 8:
1216 case 1 << 8 | 1:
1217 type = 1;
1218 break;
1219 case 1 << 8 | 1 << 6:
1220 case 1 << 8 | 1 << 6 | 1:
1221 type = 2;
1222 break;
1223 case 1 << 8 | 1 << 6 | 1 << 4:
1224 case 1 << 8 | 1 << 6 | 1 << 4 | 1:
1225 type = 3;
1226 break;
1227 case 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2:
1228 case 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2 | 1:
1229 type = 4;
1230 break;
1231 default:
1232 /* Not one of the easy encodings. This will have to be
1233 handled by the more complex code below. */
1234 type = -1;
1235 break;
1236 }
1237 if (type != -1)
1238 {
1239 /* Account for the return value too. */
1240 if (rtn_bits)
1241 type += 5;
1242
1243 /* Emit a 2 byte relocation. Then see if it can be handled
1244 with a relocation which is already in the relocation queue. */
1245 bfd_put_8 (abfd, bfd_reloc->howto->type + type, p);
1246 bfd_put_8 (abfd, sym_num, p + 1);
1247 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1248 done = 1;
1249 }
1250 }
1251
1252 /* If this could not be handled with a simple relocation, then do a hard
1253 one. Hard relocations occur if the symbol number was too high or if
1254 the encoding of argument relocation bits is too complex. */
1255 if (! done)
1256 {
1257 /* Don't ask about these magic sequences. I took them straight
1258 from gas-1.36 which took them from the a.out man page. */
1259 type = rtn_bits;
1260 if ((arg_bits >> 6 & 0xf) == 0xe)
1261 type += 9 * 40;
1262 else
1263 type += (3 * (arg_bits >> 8 & 3) + (arg_bits >> 6 & 3)) * 40;
1264 if ((arg_bits >> 2 & 0xf) == 0xe)
1265 type += 9 * 4;
1266 else
1267 type += (3 * (arg_bits >> 4 & 3) + (arg_bits >> 2 & 3)) * 4;
1268
1269 /* Output the first two bytes of the relocation. These describe
1270 the length of the relocation and encoding style. */
1271 bfd_put_8 (abfd, bfd_reloc->howto->type + 10
1272 + 2 * (sym_num >= 0x100) + (type >= 0x100),
1273 p);
1274 bfd_put_8 (abfd, type, p + 1);
1275
1276 /* Now output the symbol index and see if this bizarre relocation
1277 just happened to be in the relocation queue. */
1278 if (sym_num < 0x100)
1279 {
1280 bfd_put_8 (abfd, sym_num, p + 2);
1281 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 3, queue);
1282 }
1283 else
1284 {
1285 bfd_put_8 (abfd, sym_num >> 16, p + 2);
1286 bfd_put_16 (abfd, sym_num, p + 3);
1287 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 5, queue);
1288 }
1289 }
1290 return p;
1291}
1292
1293
9e16fcf1 1294/* Return the logarithm of X, base 2, considering X unsigned.
40249bfb
JL		 1295 Abort if X is not a power of two -- this should never happen (FIXME:
1296 It will happen on corrupt executables. GDB should give an error, not
1297 a coredump, in that case). */
9e16fcf1
SG		 1298
1299static int
1300log2 (x)
1301 unsigned int x;
1302{
1303 int log = 0;
1304
1305 /* Test for 0 or a power of 2. */
1306 if (x == 0 || x != (x & -x))
1307 abort();
1308
1309 while ((x >>= 1) != 0)
1310 log++;
1311 return log;
1312}
1313
fcb0c846 1314static bfd_reloc_status_type
39961154
JL		 1315hppa_som_reloc (abfd, reloc_entry, symbol_in, data,
1316 input_section, output_bfd, error_message)
fcb0c846
JL		 1317 bfd *abfd;
1318 arelent *reloc_entry;
1319 asymbol *symbol_in;
1320 PTR data;
1321 asection *input_section;
1322 bfd *output_bfd;
39961154 1323 char **error_message;
fcb0c846
JL		 1324{
1325 if (output_bfd)
1326 {
1327 reloc_entry->address += input_section->output_offset;
1328 return bfd_reloc_ok;
1329 }
1330 return bfd_reloc_ok;
1331}
32619c58
JL		 1332
1333/* Given a generic HPPA relocation type, the instruction format,
1334 and a field selector, return an appropriate SOM reloation.
1335
1336 FIXME. Need to handle %RR, %LR and the like as field selectors.
1337 These will need to generate multiple SOM relocations. */
1338
1339int **
1340hppa_som_gen_reloc_type (abfd, base_type, format, field)
1341 bfd *abfd;
1342 int base_type;
1343 int format;
017a52d7 1344 enum hppa_reloc_field_selector_type field;
32619c58
JL		 1345{
1346 int *final_type, **final_types;
1347
017a52d7 1348 final_types = (int **) bfd_alloc_by_size_t (abfd, sizeof (int *) * 3);
32619c58
JL		 1349 final_type = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1350
017a52d7
JL		 1351 /* The field selector may require additional relocations to be
1352 generated. It's impossible to know at this moment if additional
1353 relocations will be needed, so we make them. The code to actually
1354 write the relocation/fixup stream is responsible for removing
1355 any redundant relocations. */
1356 switch (field)
1357 {
1358 case e_fsel:
1359 case e_psel:
1360 case e_lpsel:
1361 case e_rpsel:
a36b6f1d
JL		 1362 final_types[0] = final_type;
1363 final_types[1] = NULL;
1364 final_types[2] = NULL;
1365 *final_type = base_type;
1366 break;
1367
017a52d7
JL		 1368 case e_tsel:
1369 case e_ltsel:
1370 case e_rtsel:
a36b6f1d 1371 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
39961154
JL		 1372 if (field == e_tsel)
1373 *final_types[0] = R_FSEL;
1374 else if (field == e_ltsel)
1375 *final_types[0] = R_LSEL;
1376 else
1377 *final_types[0] = R_RSEL;
a36b6f1d 1378 final_types[1] = final_type;
017a52d7
JL		 1379 final_types[2] = NULL;
1380 *final_type = base_type;
1381 break;
1382
1383 case e_lssel:
1384 case e_rssel:
1385 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1386 *final_types[0] = R_S_MODE;
1387 final_types[1] = final_type;
1388 final_types[2] = NULL;
1389 *final_type = base_type;
1390 break;
32619c58 1391
017a52d7
JL		 1392 case e_lsel:
1393 case e_rsel:
1394 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1395 *final_types[0] = R_N_MODE;
1396 final_types[1] = final_type;
1397 final_types[2] = NULL;
1398 *final_type = base_type;
1399 break;
32619c58 1400
017a52d7
JL		 1401 case e_ldsel:
1402 case e_rdsel:
1403 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1404 *final_types[0] = R_D_MODE;
1405 final_types[1] = final_type;
1406 final_types[2] = NULL;
1407 *final_type = base_type;
1408 break;
32619c58 1409
017a52d7
JL		 1410 case e_lrsel:
1411 case e_rrsel:
1412 final_types[0] = (int *) bfd_alloc_by_size_t (abfd, sizeof (int));
1413 *final_types[0] = R_R_MODE;
1414 final_types[1] = final_type;
1415 final_types[2] = NULL;
1416 *final_type = base_type;
1417 break;
1418 }
1419
32619c58
JL		 1420 switch (base_type)
1421 {
1422 case R_HPPA:
1423 /* PLABELs get their own relocation type. */
1424 if (field == e_psel
1425 || field == e_lpsel
1426 || field == e_rpsel)
a36b6f1d
JL		 1427 {
1428 /* A PLABEL relocation that has a size of 32 bits must
1429 be a R_DATA_PLABEL. All others are R_CODE_PLABELs. */
1430 if (format == 32)
1431 *final_type = R_DATA_PLABEL;
1432 else
1433 *final_type = R_CODE_PLABEL;
1434 }
1435 /* PIC stuff. */
1436 else if (field == e_tsel
1437 || field == e_ltsel
1438 || field == e_rtsel)
1439 *final_type = R_DLT_REL;
1440 /* A relocation in the data space is always a full 32bits. */
32619c58
JL		 1441 else if (format == 32)
1442 *final_type = R_DATA_ONE_SYMBOL;
1443
1444 break;
1445
1446 case R_HPPA_GOTOFF:
1447 /* More PLABEL special cases. */
1448 if (field == e_psel
1449 || field == e_lpsel
1450 || field == e_rpsel)
1451 *final_type = R_DATA_PLABEL;
1452 break;
1453
1454 case R_HPPA_NONE:
1455 case R_HPPA_ABS_CALL:
1456 case R_HPPA_PCREL_CALL:
1457 case R_HPPA_COMPLEX:
1458 case R_HPPA_COMPLEX_PCREL_CALL:
1459 case R_HPPA_COMPLEX_ABS_CALL:
1460 /* Right now we can default all these. */
1461 break;
1462 }
1463 return final_types;
1464}
1465
1466/* Return the address of the correct entry in the PA SOM relocation
1467 howto table. */
1468
91c0bcbb 1469static const reloc_howto_type *
32619c58
JL		 1470som_bfd_reloc_type_lookup (arch, code)
1471 bfd_arch_info_type *arch;
1472 bfd_reloc_code_real_type code;
1473{
1474 if ((int) code < (int) R_NO_RELOCATION + 255)
1475 {
1476 BFD_ASSERT ((int) som_hppa_howto_table[(int) code].type == (int) code);
1477 return &som_hppa_howto_table[(int) code];
1478 }
1479
1480 return (reloc_howto_type *) 0;
1481}
1482
9e16fcf1
SG		 1483/* Perform some initialization for an object. Save results of this
1484 initialization in the BFD. */
d9ad93bc
KR		 1485
1486static bfd_target *
9e16fcf1 1487som_object_setup (abfd, file_hdrp, aux_hdrp)
d9ad93bc
KR		 1488 bfd *abfd;
1489 struct header *file_hdrp;
1490 struct som_exec_auxhdr *aux_hdrp;
1491{
9e16fcf1
SG		 1492 /* som_mkobject will set bfd_error if som_mkobject fails. */
1493 if (som_mkobject (abfd) != true)
1494 return 0;
d9ad93bc 1495
9e16fcf1
SG		 1496 /* Set BFD flags based on what information is available in the SOM. */
1497 abfd->flags = NO_FLAGS;
1498 if (! file_hdrp->entry_offset)
1499 abfd->flags |= HAS_RELOC;
1500 else
1501 abfd->flags |= EXEC_P;
1502 if (file_hdrp->symbol_total)
1503 abfd->flags |= HAS_LINENO | HAS_DEBUG | HAS_SYMS | HAS_LOCALS;
1504
1505 bfd_get_start_address (abfd) = aux_hdrp->exec_entry;
1506 bfd_default_set_arch_mach (abfd, bfd_arch_hppa, 0);
d9ad93bc 1507 bfd_get_symcount (abfd) = file_hdrp->symbol_total;
9e16fcf1
SG		 1508
1509 /* Initialize the saved symbol table and string table to NULL.
1510 Save important offsets and sizes from the SOM header into
1511 the BFD. */
1512 obj_som_stringtab (abfd) = (char *) NULL;
1513 obj_som_symtab (abfd) = (som_symbol_type *) NULL;
1514 obj_som_stringtab_size (abfd) = file_hdrp->symbol_strings_size;
1515 obj_som_sym_filepos (abfd) = file_hdrp->symbol_location;
1516 obj_som_str_filepos (abfd) = file_hdrp->symbol_strings_location;
1517 obj_som_reloc_filepos (abfd) = file_hdrp->fixup_request_location;
d9ad93bc
KR		 1518
1519 return abfd->xvec;
1520}
1521
1522/* Create a new BFD section for NAME. If NAME already exists, then create a
1523 new unique name, with NAME as the prefix. This exists because SOM .o files
9e16fcf1 1524 may have more than one $CODE$ subspace. */
d9ad93bc
KR		 1525
1526static asection *
1527make_unique_section (abfd, name, num)
1528 bfd *abfd;
1529 CONST char *name;
1530 int num;
1531{
1532 asection *sect;
1533 char *newname;
1534 char altname[100];
1535
1536 sect = bfd_make_section (abfd, name);
1537 while (!sect)
1538 {
1539 sprintf (altname, "%s-%d", name, num++);
1540 sect = bfd_make_section (abfd, altname);
1541 }
1542
1543 newname = bfd_alloc (abfd, strlen (sect->name) + 1);
1544 strcpy (newname, sect->name);
1545
1546 sect->name = newname;
1547 return sect;
1548}
1549
1550/* Convert all of the space and subspace info into BFD sections. Each space
1551 contains a number of subspaces, which in turn describe the mapping between
1552 regions of the exec file, and the address space that the program runs in.
1553 BFD sections which correspond to spaces will overlap the sections for the
1554 associated subspaces. */
1555
9e16fcf1 1556static boolean
d9ad93bc
KR		 1557setup_sections (abfd, file_hdr)
1558 bfd *abfd;
1559 struct header *file_hdr;
1560{
1561 char *space_strings;
1562 int space_index;
9e16fcf1 1563 unsigned int total_subspaces = 0;
d9ad93bc
KR		 1564
1565 /* First, read in space names */
1566
1567 space_strings = alloca (file_hdr->space_strings_size);
1568 if (!space_strings)
9e16fcf1 1569 return false;
d9ad93bc
KR		 1570
1571 if (bfd_seek (abfd, file_hdr->space_strings_location, SEEK_SET) < 0)
9e16fcf1 1572 return false;
d9ad93bc
KR		 1573 if (bfd_read (space_strings, 1, file_hdr->space_strings_size, abfd)
1574 != file_hdr->space_strings_size)
9e16fcf1 1575 return false;
d9ad93bc
KR		 1576
1577 /* Loop over all of the space dictionaries, building up sections */
d9ad93bc
KR		 1578 for (space_index = 0; space_index < file_hdr->space_total; space_index++)
1579 {
1580 struct space_dictionary_record space;
9e16fcf1
SG		 1581 struct subspace_dictionary_record subspace, save_subspace;
1582 int subspace_index;
d9ad93bc
KR		 1583 asection *space_asect;
1584
1585 /* Read the space dictionary element */
1586 if (bfd_seek (abfd, file_hdr->space_location
1587 + space_index * sizeof space, SEEK_SET) < 0)
9e16fcf1 1588 return false;
d9ad93bc 1589 if (bfd_read (&space, 1, sizeof space, abfd) != sizeof space)
9e16fcf1 1590 return false;
d9ad93bc
KR		 1591
1592 /* Setup the space name string */
1593 space.name.n_name = space.name.n_strx + space_strings;
1594
1595 /* Make a section out of it */
1596 space_asect = make_unique_section (abfd, space.name.n_name, space_index);
1597 if (!space_asect)
9e16fcf1 1598 return false;
d9ad93bc
KR		 1599
1600 /* Now, read in the first subspace for this space */
1601 if (bfd_seek (abfd, file_hdr->subspace_location
1602 + space.subspace_index * sizeof subspace,
1603 SEEK_SET) < 0)
9e16fcf1 1604 return false;
d9ad93bc 1605 if (bfd_read (&subspace, 1, sizeof subspace, abfd) != sizeof subspace)
9e16fcf1 1606 return false;
d9ad93bc
KR		 1607 /* Seek back to the start of the subspaces for loop below */
1608 if (bfd_seek (abfd, file_hdr->subspace_location
1609 + space.subspace_index * sizeof subspace,
1610 SEEK_SET) < 0)
9e16fcf1 1611 return false;
d9ad93bc
KR		 1612
1613 /* Setup the start address and file loc from the first subspace record */
1614 space_asect->vma = subspace.subspace_start;
1615 space_asect->filepos = subspace.file_loc_init_value;
9e16fcf1
SG		 1616 space_asect->alignment_power = log2 (subspace.alignment);
1617
1618 /* Initialize save_subspace so we can reliably determine if this
1619 loop placed any useful values into it. */
1620 bzero (&save_subspace, sizeof (struct subspace_dictionary_record));
d9ad93bc
KR		 1621
1622 /* Loop over the rest of the subspaces, building up more sections */
1623 for (subspace_index = 0; subspace_index < space.subspace_quantity;
1624 subspace_index++)
1625 {
1626 asection *subspace_asect;
1627
1628 /* Read in the next subspace */
1629 if (bfd_read (&subspace, 1, sizeof subspace, abfd)
1630 != sizeof subspace)
9e16fcf1 1631 return false;
d9ad93bc
KR		 1632
1633 /* Setup the subspace name string */
1634 subspace.name.n_name = subspace.name.n_strx + space_strings;
1635
1636 /* Make a section out of this subspace */
1637 subspace_asect = make_unique_section (abfd, subspace.name.n_name,
1638 space.subspace_index + subspace_index);
1639
1640 if (!subspace_asect)
9e16fcf1
SG		 1641 return false;
1642
1643 /* Keep an easy mapping between subspaces and sections. */
1644 som_section_data (subspace_asect)->subspace_index
1645 = total_subspaces++;
1646
1647 /* Set SEC_READONLY and SEC_CODE/SEC_DATA as specified
1648 by the access_control_bits in the subspace header. */
1649 switch (subspace.access_control_bits >> 4)
1650 {
1651 /* Readonly data. */
1652 case 0x0:
1653 subspace_asect->flags |= SEC_DATA | SEC_READONLY;
1654 break;
1655
1656 /* Normal data. */
1657 case 0x1:
1658 subspace_asect->flags |= SEC_DATA;
1659 break;
1660
1661 /* Readonly code and the gateways.
1662 Gateways have other attributes which do not map
1663 into anything BFD knows about. */
1664 case 0x2:
1665 case 0x4:
1666 case 0x5:
1667 case 0x6:
1668 case 0x7:
1669 subspace_asect->flags |= SEC_CODE | SEC_READONLY;
1670 break;
1671
1672 /* dynamic (writable) code. */
1673 case 0x3:
1674 subspace_asect->flags |= SEC_CODE;
1675 break;
1676 }
1677
1678 if (subspace.dup_common || subspace.is_common)
1679 subspace_asect->flags |= SEC_IS_COMMON;
36456a67 1680 else if (subspace.subspace_length > 0)
9e16fcf1 1681 subspace_asect->flags |= SEC_HAS_CONTENTS;
d9ad93bc
KR		 1682 if (subspace.is_loadable)
1683 subspace_asect->flags |= SEC_ALLOC | SEC_LOAD;
1684 if (subspace.code_only)
1685 subspace_asect->flags |= SEC_CODE;
1686
36456a67
JL		 1687 /* Both file_loc_init_value and initialization_length will
1688 be zero for a BSS like subspace. */
1689 if (subspace.file_loc_init_value == 0
1690 && subspace.initialization_length == 0)
1691 subspace_asect->flags &= ~(SEC_DATA | SEC_LOAD);
1692
9e16fcf1
SG		 1693 /* This subspace has relocations.
1694 The fixup_request_quantity is a byte count for the number of
1695 entries in the relocation stream; it is not the actual number
1696 of relocations in the subspace. */
1697 if (subspace.fixup_request_quantity != 0)
1698 {
1699 subspace_asect->flags |= SEC_RELOC;
1700 subspace_asect->rel_filepos = subspace.fixup_request_index;
1701 som_section_data (subspace_asect)->reloc_size
1702 = subspace.fixup_request_quantity;
1703 /* We can not determine this yet. When we read in the
1704 relocation table the correct value will be filled in. */
1705 subspace_asect->reloc_count = -1;
1706 }
1707
1708 /* Update save_subspace if appropriate. */
1709 if (subspace.file_loc_init_value > save_subspace.file_loc_init_value)
1710 save_subspace = subspace;
1711
d9ad93bc
KR		 1712 subspace_asect->vma = subspace.subspace_start;
1713 subspace_asect->_cooked_size = subspace.subspace_length;
36456a67 1714 subspace_asect->_raw_size = subspace.subspace_length;
9e16fcf1 1715 subspace_asect->alignment_power = log2 (subspace.alignment);
d9ad93bc 1716 subspace_asect->filepos = subspace.file_loc_init_value;
d9ad93bc 1717 }
9e16fcf1
SG		 1718
1719 /* Yow! there is no subspace within the space which actually
1720 has initialized information in it; this should never happen
1721 as far as I know. */
1722 if (!save_subspace.file_loc_init_value)
1723 abort ();
1724
d9ad93bc 1725 /* Setup the sizes for the space section based upon the info in the
9e16fcf1
SG		 1726 last subspace of the space. */
1727 space_asect->_cooked_size = save_subspace.subspace_start
1728 - space_asect->vma + save_subspace.subspace_length;
1729 space_asect->_raw_size = save_subspace.file_loc_init_value
1730 - space_asect->filepos + save_subspace.initialization_length;
d9ad93bc 1731 }
9e16fcf1 1732 return true;
d9ad93bc
KR		 1733}
1734
9e16fcf1
SG		 1735/* Read in a SOM object and make it into a BFD. */
1736
d9ad93bc 1737static bfd_target *
9e16fcf1 1738som_object_p (abfd)
d9ad93bc
KR		 1739 bfd *abfd;
1740{
1741 struct header file_hdr;
1742 struct som_exec_auxhdr aux_hdr;
1743
1744 if (bfd_read ((PTR) & file_hdr, 1, FILE_HDR_SIZE, abfd) != FILE_HDR_SIZE)
9e16fcf1
SG		 1745 {
1746 bfd_error = system_call_error;
1747 return 0;
1748 }
d9ad93bc
KR		 1749
1750 if (!_PA_RISC_ID (file_hdr.system_id))
1751 {
1752 bfd_error = wrong_format;
1753 return 0;
1754 }
1755
1756 switch (file_hdr.a_magic)
1757 {
9e16fcf1 1758 case RELOC_MAGIC:
d9ad93bc
KR		 1759 case EXEC_MAGIC:
1760 case SHARE_MAGIC:
1761 case DEMAND_MAGIC:
1762#ifdef DL_MAGIC
1763 case DL_MAGIC:
1764#endif
1765#ifdef SHL_MAGIC
1766 case SHL_MAGIC:
9e16fcf1
SG		 1767#endif
1768#ifdef EXECLIBMAGIC
1769 case EXECLIBMAGIC:
017a52d7
JL		 1770#endif
1771#ifdef SHARED_MAGIC_CNX
1772 case SHARED_MAGIC_CNX:
d9ad93bc
KR		 1773#endif
1774 break;
1775 default:
1776 bfd_error = wrong_format;
1777 return 0;
1778 }
1779
1780 if (file_hdr.version_id != VERSION_ID
1781 && file_hdr.version_id != NEW_VERSION_ID)
1782 {
1783 bfd_error = wrong_format;
1784 return 0;
1785 }
1786
9e16fcf1
SG		 1787 /* If the aux_header_size field in the file header is zero, then this
1788 object is an incomplete executable (a .o file). Do not try to read
1789 a non-existant auxiliary header. */
1790 bzero (&aux_hdr, sizeof (struct som_exec_auxhdr));
1791 if (file_hdr.aux_header_size != 0)
1792 {
1793 if (bfd_read ((PTR) & aux_hdr, 1, AUX_HDR_SIZE, abfd) != AUX_HDR_SIZE)
1794 {
1795 bfd_error = wrong_format;
1796 return 0;
1797 }
1798 }
d9ad93bc
KR		 1799
1800 if (!setup_sections (abfd, &file_hdr))
9e16fcf1
SG		 1801 {
1802 /* setup_sections does not bubble up a bfd error code. */
1803 bfd_error = bad_value;
1804 return 0;
1805 }
d9ad93bc 1806
9e16fcf1
SG		 1807 /* This appears to be a valid SOM object. Do some initialization. */
1808 return som_object_setup (abfd, &file_hdr, &aux_hdr);
d9ad93bc
KR		 1809}
1810
9e16fcf1
SG		 1811/* Create a SOM object. */
1812
d9ad93bc 1813static boolean
9e16fcf1 1814som_mkobject (abfd)
d9ad93bc
KR		 1815 bfd *abfd;
1816{
9e16fcf1
SG		 1817 /* Allocate memory to hold backend information. */
1818 abfd->tdata.som_data = (struct som_data_struct *)
1819 bfd_zalloc (abfd, sizeof (struct som_data_struct));
1820 if (abfd->tdata.som_data == NULL)
1821 {
1822 bfd_error = no_memory;
1823 return false;
1824 }
1825 obj_som_file_hdr (abfd) = bfd_zalloc (abfd, sizeof (struct header));
1826 if (obj_som_file_hdr (abfd) == NULL)
1827
1828 {
1829 bfd_error = no_memory;
1830 return false;
1831 }
1832 return true;
d9ad93bc
KR		 1833}
1834
0ffa24b9
JL		 1835/* Initialize some information in the file header. This routine makes
1836 not attempt at doing the right thing for a full executable; it
1837 is only meant to handle relocatable objects. */
1838
1839static boolean
1840som_prep_headers (abfd)
1841 bfd *abfd;
1842{
1843 struct header *file_hdr = obj_som_file_hdr (abfd);
1844 asection *section;
1845
1846 /* FIXME. This should really be conditional based on whether or not
1847 PA1.1 instructions/registers have been used. */
1848 file_hdr->system_id = HP9000S800_ID;
1849
1850 /* FIXME. Only correct for building relocatable objects. */
1851 if (abfd->flags & EXEC_P)
1852 abort ();
1853 else
1854 file_hdr->a_magic = RELOC_MAGIC;
1855
1856 /* Only new format SOM is supported. */
1857 file_hdr->version_id = NEW_VERSION_ID;
1858
1859 /* These fields are optional, and embedding timestamps is not always
1860 a wise thing to do, it makes comparing objects during a multi-stage
1861 bootstrap difficult. */
1862 file_hdr->file_time.secs = 0;
1863 file_hdr->file_time.nanosecs = 0;
1864
1865 if (abfd->flags & EXEC_P)
1866 abort ();
1867 else
1868 {
1869 file_hdr->entry_space = 0;
1870 file_hdr->entry_subspace = 0;
1871 file_hdr->entry_offset = 0;
1872 }
1873
1874 /* FIXME. I do not know if we ever need to put anything other
1875 than zero in this field. */
1876 file_hdr->presumed_dp = 0;
1877
1878 /* Now iterate over the sections translating information from
1879 BFD sections to SOM spaces/subspaces. */
1880
1881 for (section = abfd->sections; section != NULL; section = section->next)
1882 {
1883 /* Ignore anything which has not been marked as a space or
1884 subspace. */
1885 if (som_section_data (section)->is_space == 0
1886
1887 && som_section_data (section)->is_subspace == 0)
1888 continue;
1889
1890 if (som_section_data (section)->is_space)
1891 {
1892 /* Set space attributes. Note most attributes of SOM spaces
1893 are set based on the subspaces it contains. */
1894 som_section_data (section)->space_dict.loader_fix_index = -1;
1895 som_section_data (section)->space_dict.init_pointer_index = -1;
1896 }
1897 else
1898 {
1899 /* Set subspace attributes. Basic stuff is done here, additional
1900 attributes are filled in later as more information becomes
1901 available. */
1902 if (section->flags & SEC_IS_COMMON)
1903 {
1904 som_section_data (section)->subspace_dict.dup_common = 1;
1905 som_section_data (section)->subspace_dict.is_common = 1;
1906 }
1907
1908 if (section->flags & SEC_ALLOC)
1909 som_section_data (section)->subspace_dict.is_loadable = 1;
1910
1911 if (section->flags & SEC_CODE)
1912 som_section_data (section)->subspace_dict.code_only = 1;
1913
1914 som_section_data (section)->subspace_dict.subspace_start =
1915 section->vma;
1916 som_section_data (section)->subspace_dict.subspace_length =
1917 bfd_section_size (abfd, section);
1918 som_section_data (section)->subspace_dict.initialization_length =
1919 bfd_section_size (abfd, section);
1920 som_section_data (section)->subspace_dict.alignment =
1921 1 << section->alignment_power;
1922 }
1923 }
1924 return true;
1925}
1926
5532fc5a
JL		 1927/* Count and return the number of spaces attached to the given BFD. */
1928
1929static unsigned long
1930som_count_spaces (abfd)
1931 bfd *abfd;
1932{
1933 int count = 0;
1934 asection *section;
1935
1936 for (section = abfd->sections; section != NULL; section = section->next)
1937 count += som_section_data (section)->is_space;
1938
1939 return count;
1940}
1941
1942/* Count the number of subspaces attached to the given BFD. */
1943
1944static unsigned long
1945som_count_subspaces (abfd)
1946 bfd *abfd;
1947{
1948 int count = 0;
1949 asection *section;
1950
1951 for (section = abfd->sections; section != NULL; section = section->next)
1952 count += som_section_data (section)->is_subspace;
1953
1954 return count;
1955}
1956
1957/* Return -1, 0, 1 indicating the relative ordering of sym1 and sym2.
1958
1959 We desire symbols to be ordered starting with the symbol with the
1960 highest relocation count down to the symbol with the lowest relocation
1961 count. Doing so compacts the relocation stream. */
1962
1963static int
1964compare_syms (sym1, sym2)
1965 asymbol **sym1;
1966 asymbol **sym2;
1967
1968{
1969 unsigned int count1, count2;
1970
1971 /* Get relocation count for each symbol. Note that the count
1972 is stored in the udata pointer for section symbols! */
1973 if ((*sym1)->flags & BSF_SECTION_SYM)
1974 count1 = (int)(*sym1)->udata;
1975 else
1976 count1 = (*som_symbol_data ((*sym1)))->reloc_count;
1977
1978 if ((*sym2)->flags & BSF_SECTION_SYM)
1979 count2 = (int)(*sym2)->udata;
1980 else
1981 count2 = (*som_symbol_data ((*sym2)))->reloc_count;
1982
1983 /* Return the appropriate value. */
1984 if (count1 < count2)
1985 return 1;
1986 else if (count1 > count2)
1987 return -1;
1988 return 0;
1989}
1990
aff97790
JL		 1991/* Perform various work in preparation for emitting the fixup stream. */
1992
1993static void
1994som_prep_for_fixups (abfd, syms, num_syms)
1995 bfd *abfd;
1996 asymbol **syms;
1997 unsigned long num_syms;
1998{
1999 int i;
2000 asection *section;
2001
2002 /* Most SOM relocations involving a symbol have a length which is
2003 dependent on the index of the symbol. So symbols which are
2004 used often in relocations should have a small index. */
2005
2006 /* First initialize the counters for each symbol. */
2007 for (i = 0; i < num_syms; i++)
2008 {
2009 /* Handle a section symbol; these have no pointers back to the
2010 SOM symbol info. So we just use the pointer field (udata)
2011 to hold the relocation count.
2012
2013 FIXME. While we're here set the name of any section symbol
2014 to something which will not screw GDB. How do other formats
2015 deal with this?!? */
2016 if (som_symbol_data (syms[i]) == NULL)
2017 {
2018 syms[i]->flags |= BSF_SECTION_SYM;
2019 syms[i]->name = "L$0\002";
2020 syms[i]->udata = (PTR) 0;
2021 }
2022 else
2023 (*som_symbol_data (syms[i]))->reloc_count = 0;
2024 }
2025
2026 /* Now that the counters are initialized, make a weighted count
2027 of how often a given symbol is used in a relocation. */
2028 for (section = abfd->sections; section != NULL; section = section->next)
2029 {
2030 int i;
2031
2032 /* Does this section have any relocations? */
2033 if (section->reloc_count <= 0)
2034 continue;
2035
2036 /* Walk through each relocation for this section. */
2037 for (i = 1; i < section->reloc_count; i++)
2038 {
2039 arelent *reloc = section->orelocation[i];
2040 int scale;
2041
2042 /* If no symbol, then there is no counter to increase. */
2043 if (reloc->sym_ptr_ptr == NULL)
2044 continue;
2045
2046 /* Scaling to encourage symbols involved in R_DP_RELATIVE
2047 and R_CODE_ONE_SYMBOL relocations to come first. These
2048 two relocations have single byte versions if the symbol
2049 index is very small. */
2050 if (reloc->howto->type == R_DP_RELATIVE
2051 || reloc->howto->type == R_CODE_ONE_SYMBOL)
2052 scale = 2;
2053 else
2054 scale = 1;
2055
2056 /* Handle section symbols by ramming the count in the udata
2057 field. It will not be used and the count is very important
2058 for these symbols. */
2059 if ((*reloc->sym_ptr_ptr)->flags & BSF_SECTION_SYM)
2060 {
2061 (*reloc->sym_ptr_ptr)->udata =
2062 (PTR) ((int) (*reloc->sym_ptr_ptr)->udata + scale);
2063 continue;
2064 }
2065
2066 /* A normal symbol. Increment the count. */
2067 (*som_symbol_data ((*reloc->sym_ptr_ptr)))->reloc_count += scale;
2068 }
2069 }
2070
2071 /* Now sort the symbols. */
2072 qsort (syms, num_syms, sizeof (asymbol *), compare_syms);
2073
2074 /* Compute the symbol indexes, they will be needed by the relocation
2075 code. */
2076 for (i = 0; i < num_syms; i++)
2077 {
2078 /* A section symbol. Again, there is no pointer to backend symbol
2079 information, so we reuse (abuse) the udata field again. */
2080 if (syms[i]->flags & BSF_SECTION_SYM)
2081 syms[i]->udata = (PTR) i;
2082 else
2083 (*som_symbol_data (syms[i]))->index = i;
2084 }
2085}
2086
9d0dea6f
JL		 2087static boolean
2088som_write_fixups (abfd, current_offset, total_reloc_sizep)
2089 bfd *abfd;
2090 unsigned long current_offset;
2091 unsigned int *total_reloc_sizep;
2092{
2093 unsigned int i, j;
2094 unsigned char *tmp_space, *p;
2095 unsigned int total_reloc_size = 0;
2096 unsigned int subspace_reloc_size = 0;
2097 unsigned int num_spaces = obj_som_file_hdr (abfd)->space_total;
2098 asection *section = abfd->sections;
2099
2100 /* Get a chunk of memory that we can use as buffer space, then throw
2101 away. */
2102 tmp_space = alloca (SOM_TMP_BUFSIZE);
2103 bzero (tmp_space, SOM_TMP_BUFSIZE);
2104 p = tmp_space;
2105
2106 /* All the fixups for a particular subspace are emitted in a single
2107 stream. All the subspaces for a particular space are emitted
2108 as a single stream.
2109
2110 So, to get all the locations correct one must iterate through all the
2111 spaces, for each space iterate through its subspaces and output a
2112 fixups stream. */
2113 for (i = 0; i < num_spaces; i++)
2114 {
2115 asection *subsection;
2116
2117 /* Find a space. */
2118 while (som_section_data (section)->is_space == 0)
2119 section = section->next;
2120
2121 /* Now iterate through each of its subspaces. */
2122 for (subsection = abfd->sections;
2123 subsection != NULL;
2124 subsection = subsection->next)
2125 {
017a52d7 2126 int reloc_offset, current_rounding_mode;
9d0dea6f
JL		 2127
2128 /* Find a subspace of this space. */
2129 if (som_section_data (subsection)->is_subspace == 0
2130 || som_section_data (subsection)->containing_space != section)
2131 continue;
2132
2133 /* If this subspace had no relocations, then we're finished
2134 with it. */
2135 if (subsection->reloc_count <= 0)
2136 {
2137 som_section_data (subsection)->subspace_dict.fixup_request_index
2138 = -1;
2139 continue;
2140 }
2141
2142 /* This subspace has some relocations. Put the relocation stream
2143 index into the subspace record. */
2144 som_section_data (subsection)->subspace_dict.fixup_request_index
2145 = total_reloc_size;
2146
2147 /* To make life easier start over with a clean slate for
2148 each subspace. Seek to the start of the relocation stream
2149 for this subspace in preparation for writing out its fixup
2150 stream. */
2151 if (bfd_seek (abfd, current_offset + total_reloc_size, SEEK_SET) != 0)
2152 {
2153 bfd_error = system_call_error;
2154 return false;
2155 }
2156
2157 /* Buffer space has already been allocated. Just perform some
2158 initialization here. */
2159 p = tmp_space;
2160 subspace_reloc_size = 0;
2161 reloc_offset = 0;
2162 som_initialize_reloc_queue (reloc_queue);
017a52d7 2163 current_rounding_mode = R_N_MODE;
9d0dea6f
JL		 2164
2165 /* Translate each BFD relocation into one or more SOM
2166 relocations. */
2167 for (j = 0; j < subsection->reloc_count; j++)
2168 {
2169 arelent *bfd_reloc = subsection->orelocation[j];
2170 unsigned int skip;
2171 int sym_num;
2172
2173 /* Get the symbol number. Remember it's stored in a
2174 special place for section symbols. */
2175 if ((*bfd_reloc->sym_ptr_ptr)->flags & BSF_SECTION_SYM)
2176 sym_num = (int) (*bfd_reloc->sym_ptr_ptr)->udata;
2177 else
91c0bcbb 2178 sym_num = (*som_symbol_data ((*bfd_reloc->sym_ptr_ptr)))->index;
9d0dea6f
JL		 2179
2180 /* If there is not enough room for the next couple relocations,
2181 then dump the current buffer contents now. Also reinitialize
2182 the relocation queue.
2183
2184 FIXME. We assume here that no BFD relocation will expand
2185 to more than 100 bytes of SOM relocations. This should (?!?)
2186 be quite safe. */
2187 if (p - tmp_space + 100 > SOM_TMP_BUFSIZE)
2188 {
2189 if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd)
2190 != p - tmp_space)
2191 {
2192 bfd_error = system_call_error;
2193 return false;
2194 }
2195 p = tmp_space;
2196 som_initialize_reloc_queue (reloc_queue);
2197 }
2198
2199 /* Emit R_NO_RELOCATION fixups to map any bytes which were
2200 skipped. */
2201 skip = bfd_reloc->address - reloc_offset;
2202 p = som_reloc_skip (abfd, skip, p,
2203 &subspace_reloc_size, reloc_queue);
2204
2205 /* Update reloc_offset for the next iteration.
2206
017a52d7
JL		 2207 Many relocations do not consume input bytes. They
2208 are markers, or set state necessary to perform some
2209 later relocation. */
2210 switch (bfd_reloc->howto->type)
2211 {
2212 /* This only needs to handle relocations that may be
2213 made by hppa_som_gen_reloc. */
2214 case R_ENTRY:
2215 case R_EXIT:
2216 case R_N_MODE:
2217 case R_S_MODE:
2218 case R_D_MODE:
2219 case R_R_MODE:
a36b6f1d
JL		 2220 case R_FSEL:
2221 case R_LSEL:
2222 case R_RSEL:
017a52d7
JL		 2223 reloc_offset = bfd_reloc->address;
2224 break;
9d0dea6f 2225
017a52d7
JL		 2226 default:
2227 reloc_offset = bfd_reloc->address + 4;
2228 break;
2229 }
9d0dea6f
JL		 2230
2231 /* Now the actual relocation we care about. */
2232 switch (bfd_reloc->howto->type)
2233 {
2234 case R_PCREL_CALL:
2235 case R_ABS_CALL:
2236 p = som_reloc_call (abfd, p, &subspace_reloc_size,
2237 bfd_reloc, sym_num, reloc_queue);
2238 break;
2239
2240 case R_CODE_ONE_SYMBOL:
2241 case R_DP_RELATIVE:
2242 /* Account for any addend. */
2243 if (bfd_reloc->addend)
2244 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
2245 &subspace_reloc_size, reloc_queue);
2246
2247 if (sym_num < 0x20)
2248 {
2249 bfd_put_8 (abfd, bfd_reloc->howto->type + sym_num, p);
2250 subspace_reloc_size += 1;
2251 p += 1;
2252 }
2253 else if (sym_num < 0x100)
2254 {
2255 bfd_put_8 (abfd, bfd_reloc->howto->type + 32, p);
2256 bfd_put_8 (abfd, sym_num, p + 1);
2257 p = try_prev_fixup (abfd, &subspace_reloc_size, p,
2258 2, reloc_queue);
2259 }
2260 else if (sym_num < 0x10000000)
2261 {
2262 bfd_put_8 (abfd, bfd_reloc->howto->type + 33, p);
2263 bfd_put_8 (abfd, sym_num >> 16, p + 1);
2264 bfd_put_16 (abfd, sym_num, p + 2);
2265 p = try_prev_fixup (abfd, &subspace_reloc_size,
2266 p, 4, reloc_queue);
2267 }
2268 else
2269 abort ();
2270 break;
2271
2272 case R_DATA_ONE_SYMBOL:
2273 case R_DATA_PLABEL:
2274 case R_CODE_PLABEL:
a36b6f1d 2275 case R_DLT_REL:
9d0dea6f
JL		 2276 /* Account for any addend. */
2277 if (bfd_reloc->addend)
2278 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
2279 &subspace_reloc_size, reloc_queue);
2280
2281 if (sym_num < 0x100)
2282 {
2283 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
2284 bfd_put_8 (abfd, sym_num, p + 1);
2285 p = try_prev_fixup (abfd, &subspace_reloc_size, p,
2286 2, reloc_queue);
2287 }
2288 else if (sym_num < 0x10000000)
2289 {
2290 bfd_put_8 (abfd, bfd_reloc->howto->type + 1, p);
2291 bfd_put_8 (abfd, sym_num >> 16, p + 1);
2292 bfd_put_16 (abfd, sym_num, p + 2);
2293 p = try_prev_fixup (abfd, &subspace_reloc_size,
2294 p, 4, reloc_queue);
2295 }
2296 else
2297 abort ();
2298 break;
2299
2300 case R_ENTRY:
2301 {
2302 int *descp
2303 = (int *) (*som_symbol_data ((*bfd_reloc->sym_ptr_ptr)))->unwind;
2304 bfd_put_8 (abfd, R_ENTRY, p);
2305 bfd_put_32 (abfd, descp[0], p + 1);
2306 bfd_put_32 (abfd, descp[1], p + 5);
2307 p = try_prev_fixup (abfd, &subspace_reloc_size,
2308 p, 9, reloc_queue);
2309 break;
2310 }
2311
2312 case R_EXIT:
2313 bfd_put_8 (abfd, R_EXIT, p);
2314 subspace_reloc_size += 1;
2315 p += 1;
2316 break;
2317
017a52d7
JL		 2318 case R_N_MODE:
2319 case R_S_MODE:
2320 case R_D_MODE:
2321 case R_R_MODE:
2322 /* If this relocation requests the current rounding
2323 mode, then it is redundant. */
2324 if (bfd_reloc->howto->type != current_rounding_mode)
2325 {
2326 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
2327 subspace_reloc_size += 1;
2328 p += 1;
2329 current_rounding_mode = bfd_reloc->howto->type;
2330 }
2331 break;
2332
a36b6f1d
JL		 2333 case R_FSEL:
2334 case R_LSEL:
2335 case R_RSEL:
2336 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
2337 subspace_reloc_size += 1;
2338 p += 1;
2339 break;
2340
9d0dea6f
JL		 2341 /* Put a "R_RESERVED" relocation in the stream if
2342 we hit something we do not understand. The linker
2343 will complain loudly if this ever happens. */
2344 default:
2345 bfd_put_8 (abfd, 0xff, p);
2346 subspace_reloc_size += 1;
2347 p += 1;
017a52d7 2348 break;
9d0dea6f
JL		 2349 }
2350 }
2351
2352 /* Last BFD relocation for a subspace has been processed.
2353 Map the rest of the subspace with R_NO_RELOCATION fixups. */
2354 p = som_reloc_skip (abfd, bfd_section_size (abfd, subsection)
2355 - reloc_offset,
2356 p, &subspace_reloc_size, reloc_queue);
2357
2358 /* Scribble out the relocations. */
2359 if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd)
2360 != p - tmp_space)
2361 {
2362 bfd_error = system_call_error;
2363 return false;
2364 }
2365 p = tmp_space;
2366
2367 total_reloc_size += subspace_reloc_size;
2368 som_section_data (subsection)->subspace_dict.fixup_request_quantity
2369 = subspace_reloc_size;
2370 }
2371 section = section->next;
2372 }
2373 *total_reloc_sizep = total_reloc_size;
2374 return true;
2375}
2376
0b35f7ec
JL		 2377/* Write out the space/subspace string table. */
2378
2379static boolean
2380som_write_space_strings (abfd, current_offset, string_sizep)
2381 bfd *abfd;
2382 unsigned long current_offset;
2383 unsigned int *string_sizep;
2384{
2385 unsigned char *tmp_space, *p;
2386 unsigned int strings_size = 0;
2387 asection *section;
2388
2389 /* Get a chunk of memory that we can use as buffer space, then throw
2390 away. */
2391 tmp_space = alloca (SOM_TMP_BUFSIZE);
2392 bzero (tmp_space, SOM_TMP_BUFSIZE);
2393 p = tmp_space;
2394
2395 /* Seek to the start of the space strings in preparation for writing
2396 them out. */
2397 if (bfd_seek (abfd, current_offset, SEEK_SET) != 0)
2398 {
2399 bfd_error = system_call_error;
2400 return false;
2401 }
2402
2403 /* Walk through all the spaces and subspaces (order is not important)
2404 building up and writing string table entries for their names. */
2405 for (section = abfd->sections; section != NULL; section = section->next)
2406 {
2407 int length;
2408
2409 /* Only work with space/subspaces; avoid any other sections
2410 which might have been made (.text for example). */
2411 if (som_section_data (section)->is_space == 0
2412 && som_section_data (section)->is_subspace == 0)
2413 continue;
2414
2415 /* Get the length of the space/subspace name. */
2416 length = strlen (section->name);
2417
2418 /* If there is not enough room for the next entry, then dump the
2419 current buffer contents now. Each entry will take 4 bytes to
2420 hold the string length + the string itself + null terminator. */
2421 if (p - tmp_space + 5 + length > SOM_TMP_BUFSIZE)
2422 {
2423 if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd)
2424 != p - tmp_space)
2425 {
2426 bfd_error = system_call_error;
2427 return false;
2428 }
2429 /* Reset to beginning of the buffer space. */
2430 p = tmp_space;
2431 }
2432
2433 /* First element in a string table entry is the length of the
2434 string. Alignment issues are already handled. */
2435 bfd_put_32 (abfd, length, p);
2436 p += 4;
2437 strings_size += 4;
2438
2439 /* Record the index in the space/subspace records. */
2440 if (som_section_data (section)->is_space)
2441 som_section_data (section)->space_dict.name.n_strx = strings_size;
2442 else
2443 som_section_data (section)->subspace_dict.name.n_strx = strings_size;
2444
2445 /* Next comes the string itself + a null terminator. */
2446 strcpy (p, section->name);
2447 p += length + 1;
2448 strings_size += length + 1;
2449
2450 /* Always align up to the next word boundary. */
2451 while (strings_size % 4)
2452 {
2453 bfd_put_8 (abfd, 0, p);
2454 p++;
2455 strings_size++;
2456 }
2457 }
2458
2459 /* Done with the space/subspace strings. Write out any information
2460 contained in a partial block. */
2461 if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd) != p - tmp_space)
2462 {
2463 bfd_error = system_call_error;
2464 return false;
2465 }
2466 *string_sizep = strings_size;
2467 return true;
2468}
2469
2470/* Write out the symbol string table. */
2471
2472static boolean
2473som_write_symbol_strings (abfd, current_offset, syms, num_syms, string_sizep)
2474 bfd *abfd;
2475 unsigned long current_offset;
2476 asymbol **syms;
2477 unsigned int num_syms;
2478 unsigned int *string_sizep;
2479{
2480 unsigned int i;
2481 unsigned char *tmp_space, *p;
2482 unsigned int strings_size = 0;
2483
2484 /* Get a chunk of memory that we can use as buffer space, then throw
2485 away. */
2486 tmp_space = alloca (SOM_TMP_BUFSIZE);
2487 bzero (tmp_space, SOM_TMP_BUFSIZE);
2488 p = tmp_space;
2489
2490 /* Seek to the start of the space strings in preparation for writing
2491 them out. */
2492 if (bfd_seek (abfd, current_offset, SEEK_SET) != 0)
2493 {
2494 bfd_error = system_call_error;
2495 return false;
2496 }
2497
2498 for (i = 0; i < num_syms; i++)
2499 {
2500 int length = strlen (syms[i]->name);
2501
2502 /* If there is not enough room for the next entry, then dump the
2503 current buffer contents now. */
2504 if (p - tmp_space + 5 + length > SOM_TMP_BUFSIZE)
2505 {
2506 if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd)
2507 != p - tmp_space)
2508 {
2509 bfd_error = system_call_error;
2510 return false;
2511 }
2512 /* Reset to beginning of the buffer space. */
2513 p = tmp_space;
2514 }
2515
2516 /* First element in a string table entry is the length of the
2517 string. This must always be 4 byte aligned. This is also
2518 an appropriate time to fill in the string index field in the
2519 symbol table entry. */
2520 bfd_put_32 (abfd, length, p);
2521 strings_size += 4;
2522 p += 4;
2523
2524 /* Next comes the string itself + a null terminator. */
2525 strcpy (p, syms[i]->name);
2526
2527 /* ACK. FIXME. */
2528 syms[i]->name = (char *)strings_size;
2529 p += length + 1;
2530 strings_size += length + 1;
2531
2532 /* Always align up to the next word boundary. */
2533 while (strings_size % 4)
2534 {
2535 bfd_put_8 (abfd, 0, p);
2536 strings_size++;
2537 p++;
2538 }
2539 }
2540
2541 /* Scribble out any partial block. */
2542 if (bfd_write ((PTR) tmp_space, p - tmp_space, 1, abfd) != p - tmp_space)
2543 {
2544 bfd_error = system_call_error;
2545 return false;
2546 }
2547
2548 *string_sizep = strings_size;
2549 return true;
2550}
2551
6eb64408
JL		 2552/* Compute variable information to be placed in the SOM headers,
2553 space/subspace dictionaries, relocation streams, etc. Begin
2554 writing parts of the object file. */
2555
2556static boolean
2557som_begin_writing (abfd)
2558 bfd *abfd;
2559{
2560 unsigned long current_offset = 0;
2561 int strings_size = 0;
2562 unsigned int total_reloc_size = 0;
2563 unsigned long num_spaces, num_subspaces, num_syms, i;
2564 asection *section;
2565 asymbol **syms = bfd_get_outsymbols (abfd);
2566 unsigned int total_subspaces = 0;
2567
2568 /* The file header will always be first in an object file,
2569 everything else can be in random locations. To keep things
2570 "simple" BFD will lay out the object file in the manner suggested
2571 by the PRO ABI for PA-RISC Systems. */
2572
2573 /* Before any output can really begin offsets for all the major
2574 portions of the object file must be computed. So, starting
2575 with the initial file header compute (and sometimes write)
2576 each portion of the object file. */
2577
2578 /* Make room for the file header, it's contents are not complete
2579 yet, so it can not be written at this time. */
2580 current_offset += sizeof (struct header);
2581
2582 /* Any auxiliary headers will follow the file header. Right now
f6c2300b 2583 we support only the copyright and version headers. */
6eb64408
JL		 2584 obj_som_file_hdr (abfd)->aux_header_location = current_offset;
2585 obj_som_file_hdr (abfd)->aux_header_size = 0;
f6c2300b
JL		 2586 if (obj_som_version_hdr (abfd) != NULL)
2587 {
2588 unsigned int len;
2589
2590 bfd_seek (abfd, current_offset, SEEK_SET);
2591
2592 /* Write the aux_id structure and the string length. */
2593 len = sizeof (struct aux_id) + sizeof (unsigned int);
2594 obj_som_file_hdr (abfd)->aux_header_size += len;
2595 current_offset += len;
2596 if (bfd_write ((PTR) obj_som_version_hdr (abfd), len, 1, abfd) != len)
2597 {
2598 bfd_error = system_call_error;
2599 return false;
2600 }
2601
2602 /* Write the version string. */
39961154 2603 len = obj_som_version_hdr (abfd)->header_id.length - sizeof (int);
f6c2300b
JL		 2604 obj_som_file_hdr (abfd)->aux_header_size += len;
2605 current_offset += len;
2606 if (bfd_write ((PTR) obj_som_version_hdr (abfd)->user_string,
2607 len, 1, abfd) != len)
2608 {
2609 bfd_error = system_call_error;
2610 return false;
2611 }
2612 }
6eb64408 2613
f6c2300b
JL		 2614 if (obj_som_copyright_hdr (abfd) != NULL)
2615 {
2616 unsigned int len;
2617
2618 bfd_seek (abfd, current_offset, SEEK_SET);
2619
2620 /* Write the aux_id structure and the string length. */
2621 len = sizeof (struct aux_id) + sizeof (unsigned int);
2622 obj_som_file_hdr (abfd)->aux_header_size += len;
2623 current_offset += len;
2624 if (bfd_write ((PTR) obj_som_copyright_hdr (abfd), len, 1, abfd) != len)
2625 {
2626 bfd_error = system_call_error;
2627 return false;
2628 }
2629
2630 /* Write the copyright string. */
39961154 2631 len = obj_som_copyright_hdr (abfd)->header_id.length - sizeof (int);
f6c2300b
JL		 2632 obj_som_file_hdr (abfd)->aux_header_size += len;
2633 current_offset += len;
2634 if (bfd_write ((PTR) obj_som_copyright_hdr (abfd)->copyright,
2635 len, 1, abfd) != len)
2636 {
2637 bfd_error = system_call_error;
2638 return false;
2639 }
2640 }
2641
2642 /* Next comes the initialization pointers; we have no initialization
2643 pointers, so current offset does not change. */
6eb64408
JL		 2644 obj_som_file_hdr (abfd)->init_array_location = current_offset;
2645 obj_som_file_hdr (abfd)->init_array_total = 0;
2646
2647 /* Next are the space records. These are fixed length records.
2648
2649 Count the number of spaces to determine how much room is needed
2650 in the object file for the space records.
2651
2652 The names of the spaces are stored in a separate string table,
2653 and the index for each space into the string table is computed
2654 below. Therefore, it is not possible to write the space headers
2655 at this time. */
2656 num_spaces = som_count_spaces (abfd);
2657 obj_som_file_hdr (abfd)->space_location = current_offset;
2658 obj_som_file_hdr (abfd)->space_total = num_spaces;
2659 current_offset += num_spaces * sizeof (struct space_dictionary_record);
2660
2661 /* Next are the subspace records. These are fixed length records.
2662
2663 Count the number of subspaes to determine how much room is needed
2664 in the object file for the subspace records.
2665
2666 A variety if fields in the subspace record are still unknown at
2667 this time (index into string table, fixup stream location/size, etc). */
2668 num_subspaces = som_count_subspaces (abfd);
2669 obj_som_file_hdr (abfd)->subspace_location = current_offset;
2670 obj_som_file_hdr (abfd)->subspace_total = num_subspaces;
2671 current_offset += num_subspaces * sizeof (struct subspace_dictionary_record);
2672
2673 /* Next is the string table for the space/subspace names. We will
2674 build and write the string table on the fly. At the same time
2675 we will fill in the space/subspace name index fields. */
2676
2677 /* The string table needs to be aligned on a word boundary. */
2678 if (current_offset % 4)
2679 current_offset += (4 - (current_offset % 4));
2680
2681 /* Mark the offset of the space/subspace string table in the
2682 file header. */
2683 obj_som_file_hdr (abfd)->space_strings_location = current_offset;
2684
2685 /* Scribble out the space strings. */
2686 if (som_write_space_strings (abfd, current_offset, &strings_size) == false)
2687 return false;
2688
2689 /* Record total string table size in the header and update the
2690 current offset. */
2691 obj_som_file_hdr (abfd)->space_strings_size = strings_size;
2692 current_offset += strings_size;
2693
2694 /* Next is the symbol table. These are fixed length records.
2695
2696 Count the number of symbols to determine how much room is needed
2697 in the object file for the symbol table.
2698
2699 The names of the symbols are stored in a separate string table,
2700 and the index for each symbol name into the string table is computed
2701 below. Therefore, it is not possible to write the symobl table
2702 at this time. */
2703 num_syms = bfd_get_symcount (abfd);
2704 obj_som_file_hdr (abfd)->symbol_location = current_offset;
2705 obj_som_file_hdr (abfd)->symbol_total = num_syms;
2706 current_offset += num_syms * sizeof (struct symbol_dictionary_record);
2707
2708 /* Do prep work before handling fixups. */
2709 som_prep_for_fixups (abfd, syms, num_syms);
2710
2711 /* Next comes the fixup stream which starts on a word boundary. */
2712 if (current_offset % 4)
2713 current_offset += (4 - (current_offset % 4));
2714 obj_som_file_hdr (abfd)->fixup_request_location = current_offset;
2715
2716 /* Write the fixups and update fields in subspace headers which
2717 relate to the fixup stream. */
2718 if (som_write_fixups (abfd, current_offset, &total_reloc_size) == false)
2719 return false;
2720
2721 /* Record the total size of the fixup stream in the file header. */
2722 obj_som_file_hdr (abfd)->fixup_request_total = total_reloc_size;
2723 current_offset += total_reloc_size;
2724
2725 /* Next are the symbol strings.
2726 Align them to a word boundary. */
2727 if (current_offset % 4)
2728 current_offset += (4 - (current_offset % 4));
2729 obj_som_file_hdr (abfd)->symbol_strings_location = current_offset;
2730
2731 /* Scribble out the symbol strings. */
2732 if (som_write_symbol_strings (abfd, current_offset, syms,
2733 num_syms, &strings_size)
2734 == false)
2735 return false;
2736
2737 /* Record total string table size in header and update the
2738 current offset. */
2739 obj_som_file_hdr (abfd)->symbol_strings_size = strings_size;
2740 current_offset += strings_size;
2741
2742 /* Next is the compiler records. We do not use these. */
2743 obj_som_file_hdr (abfd)->compiler_location = current_offset;
2744 obj_som_file_hdr (abfd)->compiler_total = 0;
2745
2746 /* Now compute the file positions for the loadable subspaces. */
2747
2748 section = abfd->sections;
2749 for (i = 0; i < num_spaces; i++)
2750 {
2751 asection *subsection;
2752
2753 /* Find a space. */
2754 while (som_section_data (section)->is_space == 0)
2755 section = section->next;
2756
2757 /* Now look for all its subspaces. */
2758 for (subsection = abfd->sections;
2759 subsection != NULL;
2760 subsection = subsection->next)
2761 {
2762
2763 if (som_section_data (subsection)->is_subspace == 0
2764 || som_section_data (subsection)->containing_space != section
2765 || (subsection->flags & SEC_ALLOC) == 0)
2766 continue;
2767
2768 som_section_data (subsection)->subspace_index = total_subspaces++;
2769 /* This is real data to be loaded from the file. */
2770 if (subsection->flags & SEC_LOAD)
2771 {
2772 som_section_data (subsection)->subspace_dict.file_loc_init_value
2773 = current_offset;
2774 section->filepos = current_offset;
2775 current_offset += bfd_section_size (abfd, subsection);
2776 }
2777 /* Looks like uninitialized data. */
2778 else
2779 {
2780 som_section_data (subsection)->subspace_dict.file_loc_init_value
2781 = 0;
2782 som_section_data (subsection)->subspace_dict.
2783 initialization_length = 0;
2784 }
2785 }
2786 /* Goto the next section. */
2787 section = section->next;
2788 }
2789
2790 /* Finally compute the file positions for unloadable subspaces. */
2791
2792 obj_som_file_hdr (abfd)->unloadable_sp_location = current_offset;
2793 section = abfd->sections;
2794 for (i = 0; i < num_spaces; i++)
2795 {
2796 asection *subsection;
2797
2798 /* Find a space. */
2799 while (som_section_data (section)->is_space == 0)
2800 section = section->next;
2801
2802 /* Now look for all its subspaces. */
2803 for (subsection = abfd->sections;
2804 subsection != NULL;
2805 subsection = subsection->next)
2806 {
2807
2808 if (som_section_data (subsection)->is_subspace == 0
2809 || som_section_data (subsection)->containing_space != section
2810 || (subsection->flags & SEC_ALLOC) != 0)
2811 continue;
2812
2813 som_section_data (subsection)->subspace_index = total_subspaces++;
2814 /* This is real data to be loaded from the file. */
2815 if ((subsection->flags & SEC_LOAD) == 0)
2816 {
2817 som_section_data (subsection)->subspace_dict.file_loc_init_value
2818 = current_offset;
2819 section->filepos = current_offset;
2820 current_offset += bfd_section_size (abfd, subsection);
2821 }
2822 /* Looks like uninitialized data. */
2823 else
2824 {
2825 som_section_data (subsection)->subspace_dict.file_loc_init_value
2826 = 0;
2827 som_section_data (subsection)->subspace_dict.
2828 initialization_length = bfd_section_size (abfd, subsection);
2829 }
2830 }
2831 /* Goto the next section. */
2832 section = section->next;
2833 }
2834
2835 obj_som_file_hdr (abfd)->unloadable_sp_size
2836 = current_offset - obj_som_file_hdr (abfd)->unloadable_sp_location;
2837
2838 /* Loader fixups are not supported in any way shape or form. */
2839 obj_som_file_hdr (abfd)->loader_fixup_location = 0;
2840 obj_som_file_hdr (abfd)->loader_fixup_total = 0;
2841
2842 /* Done. Store the total size of the SOM. */
2843 obj_som_file_hdr (abfd)->som_length = current_offset;
2844 return true;
2845}
2846
efc0df7c
JL		 2847/* Finally, scribble out the various headers to the disk. */
2848
2849static boolean
2850som_write_headers (abfd)
2851 bfd *abfd;
2852{
2853 int num_spaces = som_count_spaces (abfd);
2854 int i;
2855 int subspace_index = 0;
2856 file_ptr location;
2857 asection *section;
2858
2859 /* Subspaces are written first so that we can set up information
2860 about them in their containing spaces as the subspace is written. */
2861
2862 /* Seek to the start of the subspace dictionary records. */
2863 location = obj_som_file_hdr (abfd)->subspace_location;
2864 bfd_seek (abfd, location, SEEK_SET);
2865 section = abfd->sections;
2866 /* Now for each loadable space write out records for its subspaces. */
2867 for (i = 0; i < num_spaces; i++)
2868 {
2869 asection *subsection;
2870
2871 /* Find a space. */
2872 while (som_section_data (section)->is_space == 0)
2873 section = section->next;
2874
2875 /* Now look for all its subspaces. */
2876 for (subsection = abfd->sections;
2877 subsection != NULL;
2878 subsection = subsection->next)
2879 {
2880
2881 /* Skip any section which does not correspond to a space
2882 or subspace. Or does not have SEC_ALLOC set (and therefore
2883 has no real bits on the disk). */
2884 if (som_section_data (subsection)->is_subspace == 0
2885 || som_section_data (subsection)->containing_space != section
2886 || (subsection->flags & SEC_ALLOC) == 0)
2887 continue;
2888
2889 /* If this is the first subspace for this space, then save
2890 the index of the subspace in its containing space. Also
2891 set "is_loadable" in the containing space. */
2892
2893 if (som_section_data (section)->space_dict.subspace_quantity == 0)
2894 {
2895 som_section_data (section)->space_dict.is_loadable = 1;
2896 som_section_data (section)->space_dict.subspace_index
2897 = subspace_index;
2898 }
2899
2900 /* Increment the number of subspaces seen and the number of
2901 subspaces contained within the current space. */
2902 subspace_index++;
2903 som_section_data (section)->space_dict.subspace_quantity++;
2904
2905 /* Mark the index of the current space within the subspace's
2906 dictionary record. */
2907 som_section_data (subsection)->subspace_dict.space_index = i;
2908
2909 /* Dump the current subspace header. */
2910 if (bfd_write ((PTR) &som_section_data (subsection)->subspace_dict,
2911 sizeof (struct subspace_dictionary_record), 1, abfd)
2912 != sizeof (struct subspace_dictionary_record))
2913 {
2914 bfd_error = system_call_error;
2915 return false;
2916 }
2917 }
2918 /* Goto the next section. */
2919 section = section->next;
2920 }
2921
2922 /* Now repeat the process for unloadable subspaces. */
2923 section = abfd->sections;
2924 /* Now for each space write out records for its subspaces. */
2925 for (i = 0; i < num_spaces; i++)
2926 {
2927 asection *subsection;
2928
2929 /* Find a space. */
2930 while (som_section_data (section)->is_space == 0)
2931 section = section->next;
2932
2933 /* Now look for all its subspaces. */
2934 for (subsection = abfd->sections;
2935 subsection != NULL;
2936 subsection = subsection->next)
2937 {
2938
2939 /* Skip any section which does not correspond to a space or
2940 subspace, or which SEC_ALLOC set (and therefore handled
2941 in the loadable spaces/subspaces code above. */
2942
2943 if (som_section_data (subsection)->is_subspace == 0
2944 || som_section_data (subsection)->containing_space != section
2945 || (subsection->flags & SEC_ALLOC) != 0)
2946 continue;
2947
2948 /* If this is the first subspace for this space, then save
2949 the index of the subspace in its containing space. Clear
2950 "is_loadable". */
2951
2952 if (som_section_data (section)->space_dict.subspace_quantity == 0)
2953 {
2954 som_section_data (section)->space_dict.is_loadable = 0;
2955 som_section_data (section)->space_dict.subspace_index
2956 = subspace_index;
2957 }
2958
2959 /* Increment the number of subspaces seen and the number of
2960 subspaces contained within the current space. */
2961 som_section_data (section)->space_dict.subspace_quantity++;
2962 subspace_index++;
2963
2964 /* Mark the index of the current space within the subspace's
2965 dictionary record. */
2966 som_section_data (subsection)->subspace_dict.space_index = i;
2967
2968 /* Dump this subspace header. */
2969 if (bfd_write ((PTR) &som_section_data (subsection)->subspace_dict,
2970 sizeof (struct subspace_dictionary_record), 1, abfd)
2971 != sizeof (struct subspace_dictionary_record))
2972 {
2973 bfd_error = system_call_error;
2974 return false;
2975 }
2976 }
2977 /* Goto the next section. */
2978 section = section->next;
2979 }
2980
2981 /* All the subspace dictiondary records are written, and all the
2982 fields are set up in the space dictionary records.
2983
2984 Seek to the right location and start writing the space
2985 dictionary records. */
2986 location = obj_som_file_hdr (abfd)->space_location;
2987 bfd_seek (abfd, location, SEEK_SET);
2988
2989 section = abfd->sections;
2990 for (i = 0; i < num_spaces; i++)
2991 {
2992
2993 /* Find a space. */
2994 while (som_section_data (section)->is_space == 0)
2995 section = section->next;
2996
2997 /* Dump its header */
2998 if (bfd_write ((PTR) &som_section_data (section)->space_dict,
2999 sizeof (struct space_dictionary_record), 1, abfd)
3000 != sizeof (struct space_dictionary_record))
3001 {
3002 bfd_error = system_call_error;
3003 return false;
3004 }
3005
3006 /* Goto the next section. */
3007 section = section->next;
3008 }
3009
3010 /* Only thing left to do is write out the file header. It is always
3011 at location zero. Seek there and write it. */
3012 bfd_seek (abfd, (file_ptr) 0, SEEK_SET);
3013 if (bfd_write ((PTR) obj_som_file_hdr (abfd),
3014 sizeof (struct header), 1, abfd)
3015 != sizeof (struct header))
3016 {
3017 bfd_error = system_call_error;
3018 return false;
3019 }
3020 return true;
3021}
3022
980bac64
JL		 3023/* Compute and return the checksum for a SOM file header. */
3024
5532fc5a
JL		 3025static unsigned long
3026som_compute_checksum (abfd)
3027 bfd *abfd;
3028{
3029 unsigned long checksum, count, i;
3030 unsigned long *buffer = (unsigned long *) obj_som_file_hdr (abfd);
3031
3032 checksum = 0;
3033 count = sizeof (struct header) / sizeof (unsigned long);
3034 for (i = 0; i < count; i++)
3035 checksum ^= *(buffer + i);
3036
3037 return checksum;
3038}
3039
713de7ec
JL		 3040/* Build and write, in one big chunk, the entire symbol table for
3041 this BFD. */
3042
3043static boolean
3044som_build_and_write_symbol_table (abfd)
3045 bfd *abfd;
3046{
3047 unsigned int num_syms = bfd_get_symcount (abfd);
3048 file_ptr symtab_location = obj_som_file_hdr (abfd)->symbol_location;
3049 asymbol **bfd_syms = bfd_get_outsymbols (abfd);
3050 struct symbol_dictionary_record *som_symtab;
3051 int i, symtab_size;
3052
3053 /* Compute total symbol table size and allocate a chunk of memory
3054 to hold the symbol table as we build it. */
3055 symtab_size = num_syms * sizeof (struct symbol_dictionary_record);
3056 som_symtab = (struct symbol_dictionary_record *) alloca (symtab_size);
3057 bzero (som_symtab, symtab_size);
3058
3059 /* Walk over each symbol. */
3060 for (i = 0; i < num_syms; i++)
3061 {
3062 /* This is really an index into the symbol strings table.
3063 By the time we get here, the index has already been
3064 computed and stored into the name field in the BFD symbol. */
3065 som_symtab[i].name.n_strx = (int) bfd_syms[i]->name;
3066
3067 /* The HP SOM linker requires detailed type information about
3068 all symbols (including undefined symbols!). Unfortunately,
3069 the type specified in an import/export statement does not
3070 always match what the linker wants. Severe braindamage. */
3071
3072 /* Section symbols will not have a SOM symbol type assigned to
3073 them yet. Assign all section symbols type ST_DATA. */
3074 if (bfd_syms[i]->flags & BSF_SECTION_SYM)
3075 som_symtab[i].symbol_type = ST_DATA;
3076 else
3077 {
3078 /* Common symbols must have scope SS_UNSAT and type
3079 ST_STORAGE or the linker will choke. */
3080 if (bfd_syms[i]->section == &bfd_com_section)
3081 {
3082 som_symtab[i].symbol_scope = SS_UNSAT;
3083 som_symtab[i].symbol_type = ST_STORAGE;
3084 }
3085
3086 /* It is possible to have a symbol without an associated
3087 type. This happens if the user imported the symbol
3088 without a type and the symbol was never defined
3089 locally. If BSF_FUNCTION is set for this symbol, then
3090 assign it type ST_CODE (the HP linker requires undefined
3091 external functions to have type ST_CODE rather than ST_ENTRY. */
3092 else if (((*som_symbol_data (bfd_syms[i]))->som_type
3093 == SYMBOL_TYPE_UNKNOWN)
3094 && (bfd_syms[i]->section == &bfd_und_section)
3095 && (bfd_syms[i]->flags & BSF_FUNCTION))
3096 som_symtab[i].symbol_type = ST_CODE;
3097
3098 /* Handle function symbols which were defined in this file.
3099 They should have type ST_ENTRY. Also retrieve the argument
3100 relocation bits from the SOM backend information. */
3101 else if (((*som_symbol_data (bfd_syms[i]))->som_type
3102 == SYMBOL_TYPE_ENTRY)
3103 || (((*som_symbol_data (bfd_syms[i]))->som_type
3104 == SYMBOL_TYPE_CODE)
3105 && (bfd_syms[i]->flags & BSF_FUNCTION))
3106 || (((*som_symbol_data (bfd_syms[i]))->som_type
3107 == SYMBOL_TYPE_UNKNOWN)
3108 && (bfd_syms[i]->flags & BSF_FUNCTION)))
3109 {
3110 som_symtab[i].symbol_type = ST_ENTRY;
3111 som_symtab[i].arg_reloc
3112 = (*som_symbol_data (bfd_syms[i]))->tc_data.hppa_arg_reloc;
3113 }
3114
3115 /* If the type is unknown at this point, it should be
3116 ST_DATA (functions were handled as special cases above). */
3117 else if ((*som_symbol_data (bfd_syms[i]))->som_type
3118 == SYMBOL_TYPE_UNKNOWN)
3119 som_symtab[i].symbol_type = ST_DATA;
3120
3121 /* From now on it's a very simple mapping. */
3122 else if ((*som_symbol_data (bfd_syms[i]))->som_type
3123 == SYMBOL_TYPE_ABSOLUTE)
3124 som_symtab[i].symbol_type = ST_ABSOLUTE;
3125 else if ((*som_symbol_data (bfd_syms[i]))->som_type
3126 == SYMBOL_TYPE_CODE)
3127 som_symtab[i].symbol_type = ST_CODE;
3128 else if ((*som_symbol_data (bfd_syms[i]))->som_type
3129 == SYMBOL_TYPE_DATA)
3130 som_symtab[i].symbol_type = ST_DATA;
3131 else if ((*som_symbol_data (bfd_syms[i]))->som_type
3132 == SYMBOL_TYPE_MILLICODE)
3133 som_symtab[i].symbol_type = ST_MILLICODE;
3134 else if ((*som_symbol_data (bfd_syms[i]))->som_type
3135 == SYMBOL_TYPE_PLABEL)
3136 som_symtab[i].symbol_type = ST_PLABEL;
3137 else if ((*som_symbol_data (bfd_syms[i]))->som_type
3138 == SYMBOL_TYPE_PRI_PROG)
3139 som_symtab[i].symbol_type = ST_PRI_PROG;
3140 else if ((*som_symbol_data (bfd_syms[i]))->som_type
3141 == SYMBOL_TYPE_SEC_PROG)
3142 som_symtab[i].symbol_type = ST_SEC_PROG;
3143 }
3144
3145 /* Now handle the symbol's scope. Exported data which is not
3146 in the common section has scope SS_UNIVERSAL. Note scope
980bac64 3147 of common symbols was handled earlier! */
713de7ec
JL		 3148 if (bfd_syms[i]->flags & BSF_EXPORT
3149 && bfd_syms[i]->section != &bfd_com_section)
3150 som_symtab[i].symbol_scope = SS_UNIVERSAL;
3151 /* Any undefined symbol at this point has a scope SS_UNSAT. */
3152 else if (bfd_syms[i]->section == &bfd_und_section)
3153 som_symtab[i].symbol_scope = SS_UNSAT;
3154 /* Anything else which is not in the common section has scope
3155 SS_LOCAL. */
3156 else if (bfd_syms[i]->section != &bfd_com_section)
3157 som_symtab[i].symbol_scope = SS_LOCAL;
3158
3159 /* Now set the symbol_info field. It has no real meaning
3160 for undefined or common symbols, but the HP linker will
3161 choke if it's not set to some "reasonable" value. We
3162 use zero as a reasonable value. */
3163 if (bfd_syms[i]->section == &bfd_com_section
3164 || bfd_syms[i]->section == &bfd_und_section)
3165 som_symtab[i].symbol_info = 0;
3166 /* For all other symbols, the symbol_info field contains the
3167 subspace index of the space this symbol is contained in. */
3168 else
3169 som_symtab[i].symbol_info
3170 = som_section_data (bfd_syms[i]->section)->subspace_index;
3171
3172 /* Set the symbol's value. */
3173 som_symtab[i].symbol_value
3174 = bfd_syms[i]->value + bfd_syms[i]->section->vma;
3175 }
3176
3177 /* Egad. Everything is ready, seek to the right location and
3178 scribble out the symbol table. */
3179 if (bfd_seek (abfd, symtab_location, SEEK_SET) != 0)
3180 {
3181 bfd_error = system_call_error;
3182 return false;
3183 }
3184
3185 if (bfd_write ((PTR) som_symtab, symtab_size, 1, abfd) != symtab_size)
3186 {
3187 bfd_error = system_call_error;
3188 return false;
3189 }
3190 return true;
3191}
3192
980bac64
JL		 3193/* Write an object in SOM format. */
3194
3195static boolean
9e16fcf1 3196som_write_object_contents (abfd)
d9ad93bc
KR		 3197 bfd *abfd;
3198{
980bac64
JL		 3199 if (abfd->output_has_begun == false)
3200 {
3201 /* Set up fixed parts of the file, space, and subspace headers.
3202 Notify the world that output has begun. */
3203 som_prep_headers (abfd);
3204 abfd->output_has_begun = true;
980bac64
JL		 3205 /* Start writing the object file. This include all the string
3206 tables, fixup streams, and other portions of the object file. */
3207 som_begin_writing (abfd);
980bac64
JL		 3208 }
3209
3210 /* Now that the symbol table information is complete, build and
3211 write the symbol table. */
3212 if (som_build_and_write_symbol_table (abfd) == false)
3213 return false;
3214
3215 /* Compute the checksum for the file header just before writing
3216 the header to disk. */
3217 obj_som_file_hdr (abfd)->checksum = som_compute_checksum (abfd);
3218 return (som_write_headers (abfd));
d9ad93bc 3219}
980bac64
JL		 3220
3221\f
9e16fcf1 3222/* Read and save the string table associated with the given BFD. */
d9ad93bc 3223
9e16fcf1
SG		 3224static boolean
3225som_slurp_string_table (abfd)
d9ad93bc
KR		 3226 bfd *abfd;
3227{
9e16fcf1
SG		 3228 char *stringtab;
3229
3230 /* Use the saved version if its available. */
3231 if (obj_som_stringtab (abfd) != NULL)
3232 return true;
3233
3234 /* Allocate and read in the string table. */
3235 stringtab = bfd_zalloc (abfd, obj_som_stringtab_size (abfd));
3236 if (stringtab == NULL)
3237 {
3238 bfd_error = no_memory;
3239 return false;
3240 }
3241
3242 if (bfd_seek (abfd, obj_som_str_filepos (abfd), SEEK_SET) < 0)
3243 {
3244 bfd_error = system_call_error;
3245 return false;
3246 }
3247
3248 if (bfd_read (stringtab, obj_som_stringtab_size (abfd), 1, abfd)
3249 != obj_som_stringtab_size (abfd))
3250 {
3251 bfd_error = system_call_error;
3252 return false;
3253 }
3254
3255 /* Save our results and return success. */
3256 obj_som_stringtab (abfd) = stringtab;
3257 return true;
d9ad93bc
KR		 3258}
3259
9e16fcf1
SG		 3260/* Return the amount of data (in bytes) required to hold the symbol
3261 table for this object. */
3262
d9ad93bc 3263static unsigned int
9e16fcf1 3264som_get_symtab_upper_bound (abfd)
d9ad93bc 3265 bfd *abfd;
d9ad93bc 3266{
9e16fcf1
SG		 3267 if (!som_slurp_symbol_table (abfd))
3268 return 0;
3269
3270 return (bfd_get_symcount (abfd) + 1) * (sizeof (som_symbol_type *));
d9ad93bc
KR		 3271}
3272
9e16fcf1
SG		 3273/* Convert from a SOM subspace index to a BFD section. */
3274
3275static asection *
3276som_section_from_subspace_index (abfd, index)
3277 bfd *abfd;
3278 unsigned int index;
3279{
3280 asection *section;
3281
3282 for (section = abfd->sections; section != NULL; section = section->next)
3283 if (som_section_data (section)->subspace_index == index)
3284 return section;
3285
3286 /* Should never happen. */
3287 abort();
3288}
3289
3290/* Read and save the symbol table associated with the given BFD. */
3291
d9ad93bc 3292static unsigned int
9e16fcf1 3293som_slurp_symbol_table (abfd)
d9ad93bc 3294 bfd *abfd;
d9ad93bc 3295{
9e16fcf1
SG		 3296 int symbol_count = bfd_get_symcount (abfd);
3297 int symsize = sizeof (struct symbol_dictionary_record);
3298 char *stringtab;
3299 struct symbol_dictionary_record *buf, *bufp, *endbufp;
3300 som_symbol_type *sym, *symbase;
3301
3302 /* Return saved value if it exists. */
3303 if (obj_som_symtab (abfd) != NULL)
3304 return true;
3305
3306 /* Sanity checking. Make sure there are some symbols and that
3307 we can read the string table too. */
3308 if (symbol_count == 0)
3309 {
3310 bfd_error = no_symbols;
3311 return false;
3312 }
3313
3314 if (!som_slurp_string_table (abfd))
3315 return false;
3316
3317 stringtab = obj_som_stringtab (abfd);
3318
3319 symbase = (som_symbol_type *)
3320 bfd_zalloc (abfd, symbol_count * sizeof (som_symbol_type));
3321 if (symbase == NULL)
3322 {
3323 bfd_error = no_memory;
3324 return false;
3325 }
3326
3327 /* Read in the external SOM representation. */
3328 buf = alloca (symbol_count * symsize);
3329 if (buf == NULL)
3330 {
3331 bfd_error = no_memory;
3332 return false;
3333 }
3334 if (bfd_seek (abfd, obj_som_sym_filepos (abfd), SEEK_SET) < 0)
3335 {
3336 bfd_error = system_call_error;
3337 return false;
3338 }
3339 if (bfd_read (buf, symbol_count * symsize, 1, abfd)
3340 != symbol_count * symsize)
3341 {
3342 bfd_error = no_symbols;
3343 return (false);
3344 }
3345
3346 /* Iterate over all the symbols and internalize them. */
3347 endbufp = buf + symbol_count;
3348 for (bufp = buf, sym = symbase; bufp < endbufp; ++bufp)
3349 {
3350
3351 /* I don't think we care about these. */
3352 if (bufp->symbol_type == ST_SYM_EXT
3353 || bufp->symbol_type == ST_ARG_EXT)
3354 continue;
3355
3356 /* Some reasonable defaults. */
3357 sym->symbol.the_bfd = abfd;
3358 sym->symbol.name = bufp->name.n_strx + stringtab;
3359 sym->symbol.value = bufp->symbol_value;
3360 sym->symbol.section = 0;
3361 sym->symbol.flags = 0;
3362
3363 switch (bufp->symbol_type)
3364 {
3365 case ST_ENTRY:
36456a67
JL		 3366 case ST_PRI_PROG:
3367 case ST_SEC_PROG:
3368 case ST_MILLICODE:
9e16fcf1
SG		 3369 sym->symbol.flags |= BSF_FUNCTION;
3370 sym->symbol.value &= ~0x3;
3371 break;
3372
9e16fcf1 3373 case ST_STUB:
9e16fcf1
SG		 3374 case ST_CODE:
3375 sym->symbol.value &= ~0x3;
3376
3377 default:
3378 break;
3379 }
3380
3381 /* Handle scoping and section information. */
3382 switch (bufp->symbol_scope)
3383 {
3384 /* symbol_info field is undefined for SS_EXTERNAL and SS_UNSAT symbols,
3385 so the section associated with this symbol can't be known. */
3386 case SS_EXTERNAL:
3387 case SS_UNSAT:
017a52d7
JL		 3388 if (bufp->symbol_type != ST_STORAGE)
3389 sym->symbol.section = &bfd_und_section;
3390 else
3391 sym->symbol.section = &bfd_com_section;
9e16fcf1
SG		 3392 sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL);
3393 break;
3394
3395 case SS_UNIVERSAL:
3396 sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL);
3397 sym->symbol.section
3398 = som_section_from_subspace_index (abfd, bufp->symbol_info);
3399 sym->symbol.value -= sym->symbol.section->vma;
3400 break;
3401
3402#if 0
3403 /* SS_GLOBAL and SS_LOCAL are two names for the same thing.
3404 Sound dumb? It is. */
3405 case SS_GLOBAL:
3406#endif
3407 case SS_LOCAL:
3408 sym->symbol.flags |= BSF_LOCAL;
3409 sym->symbol.section
3410 = som_section_from_subspace_index (abfd, bufp->symbol_info);
3411 sym->symbol.value -= sym->symbol.section->vma;
3412 break;
3413 }
3414
3415 /* Mark symbols left around by the debugger. */
36456a67 3416 if (strlen (sym->symbol.name) >= 2
9e16fcf1 3417 && sym->symbol.name[0] == 'L'
36456a67
JL		 3418 && (sym->symbol.name[1] == '$' || sym->symbol.name[2] == '$'
3419 || sym->symbol.name[3] == '$'))
9e16fcf1
SG		 3420 sym->symbol.flags |= BSF_DEBUGGING;
3421
3422 /* Note increment at bottom of loop, since we skip some symbols
3423 we can not include it as part of the for statement. */
3424 sym++;
3425 }
3426
3427 /* Save our results and return success. */
3428 obj_som_symtab (abfd) = symbase;
3429 return (true);
d9ad93bc
KR		 3430}
3431
9e16fcf1
SG		 3432/* Canonicalize a SOM symbol table. Return the number of entries
3433 in the symbol table. */
d9ad93bc
KR		 3434
3435static unsigned int
9e16fcf1 3436som_get_symtab (abfd, location)
d9ad93bc
KR		 3437 bfd *abfd;
3438 asymbol **location;
3439{
9e16fcf1
SG		 3440 int i;
3441 som_symbol_type *symbase;
3442
3443 if (!som_slurp_symbol_table (abfd))
3444 return 0;
3445
3446 i = bfd_get_symcount (abfd);
3447 symbase = obj_som_symtab (abfd);
3448
3449 for (; i > 0; i--, location++, symbase++)
3450 *location = &symbase->symbol;
3451
3452 /* Final null pointer. */
3453 *location = 0;
3454 return (bfd_get_symcount (abfd));
d9ad93bc
KR		 3455}
3456
9e16fcf1
SG		 3457/* Make a SOM symbol. There is nothing special to do here. */
3458
d9ad93bc 3459static asymbol *
9e16fcf1 3460som_make_empty_symbol (abfd)
d9ad93bc
KR		 3461 bfd *abfd;
3462{
9e16fcf1
SG		 3463 som_symbol_type *new =
3464 (som_symbol_type *) bfd_zalloc (abfd, sizeof (som_symbol_type));
3465 if (new == NULL)
3466 {
3467 bfd_error = no_memory;
3468 return 0;
3469 }
d9ad93bc
KR		 3470 new->symbol.the_bfd = abfd;
3471
3472 return &new->symbol;
3473}
3474
9e16fcf1
SG		 3475/* Print symbol information. */
3476
d9ad93bc 3477static void
9e16fcf1 3478som_print_symbol (ignore_abfd, afile, symbol, how)
d9ad93bc
KR		 3479 bfd *ignore_abfd;
3480 PTR afile;
3481 asymbol *symbol;
3482 bfd_print_symbol_type how;
3483{
9e16fcf1
SG		 3484 FILE *file = (FILE *) afile;
3485 switch (how)
3486 {
3487 case bfd_print_symbol_name:
3488 fprintf (file, "%s", symbol->name);
3489 break;
3490 case bfd_print_symbol_more:
3491 fprintf (file, "som ");
3492 fprintf_vma (file, symbol->value);
3493 fprintf (file, " %lx", (long) symbol->flags);
3494 break;
3495 case bfd_print_symbol_all:
3496 {
3497 CONST char *section_name;
3498 section_name = symbol->section ? symbol->section->name : "(*none*)";
3499 bfd_print_symbol_vandf ((PTR) file, symbol);
3500 fprintf (file, " %s\t%s", section_name, symbol->name);
3501 break;
3502 }
3503 }
3504}
3505
36456a67
JL		 3506/* Count or process variable-length SOM fixup records.
3507
3508 To avoid code duplication we use this code both to compute the number
3509 of relocations requested by a stream, and to internalize the stream.
3510
3511 When computing the number of relocations requested by a stream the
3512 variables rptr, section, and symbols have no meaning.
3513
3514 Return the number of relocations requested by the fixup stream. When
3515 not just counting
3516
3517 This needs at least two or three more passes to get it cleaned up. */
3518
3519static unsigned int
3520som_set_reloc_info (fixup, end, internal_relocs, section, symbols, just_count)
3521 unsigned char *fixup;
3522 unsigned int end;
3523 arelent *internal_relocs;
3524 asection *section;
3525 asymbol **symbols;
3526 boolean just_count;
3527{
3528 unsigned int op, varname;
3529 unsigned char *end_fixups = &fixup[end];
3530 const struct fixup_format *fp;
3531 char *cp;
3532 unsigned char *save_fixup;
3533 int variables[26], stack[20], c, v, count, prev_fixup, *sp;
3534 const int *subop;
3535 arelent *rptr= internal_relocs;
3536 unsigned int offset = just_count ? 0 : section->vma;
3537
3538#define var(c) variables[(c) - 'A']
3539#define push(v) (*sp++ = (v))
3540#define pop() (*--sp)
3541#define emptystack() (sp == stack)
3542
3543 som_initialize_reloc_queue (reloc_queue);
3544 bzero (variables, sizeof (variables));
3545 bzero (stack, sizeof (stack));
3546 count = 0;
3547 prev_fixup = 0;
3548 sp = stack;
3549
3550 while (fixup < end_fixups)
3551 {
3552
3553 /* Save pointer to the start of this fixup. We'll use
3554 it later to determine if it is necessary to put this fixup
3555 on the queue. */
3556 save_fixup = fixup;
3557
3558 /* Get the fixup code and its associated format. */
3559 op = *fixup++;
3560 fp = &som_fixup_formats[op];
3561
3562 /* Handle a request for a previous fixup. */
3563 if (*fp->format == 'P')
3564 {
3565 /* Get pointer to the beginning of the prev fixup, move
3566 the repeated fixup to the head of the queue. */
3567 fixup = reloc_queue[fp->D].reloc;
3568 som_reloc_queue_fix (reloc_queue, fp->D);
3569 prev_fixup = 1;
3570
3571 /* Get the fixup code and its associated format. */
3572 op = *fixup++;
3573 fp = &som_fixup_formats[op];
3574 }
3575
3576 /* If we are not just counting, set some reasonable defaults. */
3577 if (! just_count)
3578 {
3579 rptr->address = offset;
3580 rptr->howto = &som_hppa_howto_table[op];
3581 rptr->addend = 0;
3582 }
3583
3584 /* Set default input length to 0. Get the opcode class index
3585 into D. */
3586 var ('L') = 0;
3587 var ('D') = fp->D;
3588
3589 /* Get the opcode format. */
3590 cp = fp->format;
3591
3592 /* Process the format string. Parsing happens in two phases,
3593 parse RHS, then assign to LHS. Repeat until no more
3594 characters in the format string. */
3595 while (*cp)
3596 {
3597 /* The variable this pass is going to compute a value for. */
3598 varname = *cp++;
3599
3600 /* Start processing RHS. Continue until a NULL or '=' is found. */
3601 do
3602 {
3603 c = *cp++;
3604
3605 /* If this is a variable, push it on the stack. */
3606 if (isupper (c))
3607 push (var (c));
3608
3609 /* If this is a lower case letter, then it represents
3610 additional data from the fixup stream to be pushed onto
3611 the stack. */
3612 else if (islower (c))
3613 {
3614 for (v = 0; c > 'a'; --c)
3615 v = (v << 8) | *fixup++;
3616 push (v);
3617 }
3618
3619 /* A decimal constant. Push it on the stack. */
3620 else if (isdigit (c))
3621 {
3622 v = c - '0';
3623 while (isdigit (*cp))
3624 v = (v * 10) + (*cp++ - '0');
3625 push (v);
3626 }
3627 else
3628
3629 /* An operator. Pop two two values from the stack and
3630 use them as operands to the given operation. Push
3631 the result of the operation back on the stack. */
3632 switch (c)
3633 {
3634 case '+':
3635 v = pop ();
3636 v += pop ();
3637 push (v);
3638 break;
3639 case '*':
3640 v = pop ();
3641 v *= pop ();
3642 push (v);
3643 break;
3644 case '<':
3645 v = pop ();
3646 v = pop () << v;
3647 push (v);
3648 break;
3649 default:
3650 abort ();
3651 }
3652 }
3653 while (*cp && *cp != '=');
3654
3655 /* Move over the equal operator. */
3656 cp++;
3657
3658 /* Pop the RHS off the stack. */
3659 c = pop ();
3660
3661 /* Perform the assignment. */
3662 var (varname) = c;
3663
3664 /* Handle side effects. and special 'O' stack cases. */
3665 switch (varname)
3666 {
3667 /* Consume some bytes from the input space. */
3668 case 'L':
3669 offset += c;
3670 break;
3671 /* A symbol to use in the relocation. Make a note
3672 of this if we are not just counting. */
3673 case 'S':
3674 if (! just_count)
3675 rptr->sym_ptr_ptr = &symbols[c];
3676 break;
3677 /* Handle the linker expression stack. */
3678 case 'O':
3679 switch (op)
3680 {
3681 case R_COMP1:
3682 subop = comp1_opcodes;
3683 break;
3684 case R_COMP2:
3685 subop = comp2_opcodes;
3686 break;
3687 case R_COMP3:
3688 subop = comp3_opcodes;
3689 break;
3690 default:
3691 abort ();
3692 }
3693 while (*subop <= (unsigned char) c)
3694 ++subop;
3695 --subop;
3696 break;
3697 default:
3698 break;
3699 }
3700 }
3701
3702 /* If we used a previous fixup, clean up after it. */
3703 if (prev_fixup)
3704 {
3705 fixup = save_fixup + 1;
3706 prev_fixup = 0;
3707 }
3708 /* Queue it. */
3709 else if (fixup > save_fixup + 1)
3710 som_reloc_queue_insert (save_fixup, fixup - save_fixup, reloc_queue);
3711
3712 /* We do not pass R_DATA_OVERRIDE or R_NO_RELOCATION
3713 fixups to BFD. */
3714 if (som_hppa_howto_table[op].type != R_DATA_OVERRIDE
3715 && som_hppa_howto_table[op].type != R_NO_RELOCATION)
3716 {
3717 /* Done with a single reloction. Loop back to the top. */
3718 if (! just_count)
3719 {
3720 rptr->addend = var ('V');
3721 rptr++;
3722 }
3723 count++;
3724 /* Now that we've handled a "full" relocation, reset
3725 some state. */
3726 bzero (variables, sizeof (variables));
3727 bzero (stack, sizeof (stack));
3728 }
3729 }
3730 return count;
3731
3732#undef var
3733#undef push
3734#undef pop
3735#undef emptystack
3736}
3737
3738/* Read in the relocs (aka fixups in SOM terms) for a section.
3739
3740 som_get_reloc_upper_bound calls this routine with JUST_COUNT
3741 set to true to indicate it only needs a count of the number
3742 of actual relocations. */
3743
3744static boolean
3745som_slurp_reloc_table (abfd, section, symbols, just_count)
3746 bfd *abfd;
3747 asection *section;
3748 asymbol **symbols;
3749 boolean just_count;
3750{
3751 char *external_relocs;
3752 unsigned int fixup_stream_size;
3753 arelent *internal_relocs;
3754 unsigned int num_relocs;
3755
3756 fixup_stream_size = som_section_data (section)->reloc_size;
3757 /* If there were no relocations, then there is nothing to do. */
3758 if (section->reloc_count == 0)
3759 return true;
3760
3761 /* If reloc_count is -1, then the relocation stream has not been
3762 parsed. We must do so now to know how many relocations exist. */
3763 if (section->reloc_count == -1)
3764 {
3765 external_relocs = (char *) bfd_zalloc (abfd, fixup_stream_size);
3766 if (external_relocs == (char *) NULL)
3767 {
3768 bfd_error = no_memory;
3769 return false;
3770 }
3771 /* Read in the external forms. */
3772 if (bfd_seek (abfd,
3773 obj_som_reloc_filepos (abfd) + section->rel_filepos,
3774 SEEK_SET)
3775 != 0)
3776 {
3777 bfd_error = system_call_error;
3778 return false;
3779 }
3780 if (bfd_read (external_relocs, 1, fixup_stream_size, abfd)
3781 != fixup_stream_size)
3782 {
3783 bfd_error = system_call_error;
3784 return false;
3785 }
3786 /* Let callers know how many relocations found.
3787 also save the relocation stream as we will
3788 need it again. */
3789 section->reloc_count = som_set_reloc_info (external_relocs,
3790 fixup_stream_size,
3791 NULL, NULL, NULL, true);
3792
3793 som_section_data (section)->reloc_stream = external_relocs;
3794 }
3795
3796 /* If the caller only wanted a count, then return now. */
3797 if (just_count)
3798 return true;
3799
3800 num_relocs = section->reloc_count;
3801 external_relocs = som_section_data (section)->reloc_stream;
3802 /* Return saved information about the relocations if it is available. */
3803 if (section->relocation != (arelent *) NULL)
3804 return true;
3805
3806 internal_relocs = (arelent *) bfd_zalloc (abfd,
3807 num_relocs * sizeof (arelent));
3808 if (internal_relocs == (arelent *) NULL)
3809 {
3810 bfd_error = no_memory;
3811 return false;
3812 }
3813
3814 /* Process and internalize the relocations. */
3815 som_set_reloc_info (external_relocs, fixup_stream_size,
3816 internal_relocs, section, symbols, false);
3817
3818 /* Save our results and return success. */
3819 section->relocation = internal_relocs;
3820 return (true);
3821}
3822
3823/* Return the number of bytes required to store the relocation
3824 information associated with the given section. */
3825
9e16fcf1
SG		 3826static unsigned int
3827som_get_reloc_upper_bound (abfd, asect)
3828 bfd *abfd;
3829 sec_ptr asect;
3830{
36456a67
JL		 3831 /* If section has relocations, then read in the relocation stream
3832 and parse it to determine how many relocations exist. */
3833 if (asect->flags & SEC_RELOC)
3834 {
3835 if (som_slurp_reloc_table (abfd, asect, NULL, true))
3836 return (asect->reloc_count + 1) * sizeof (arelent);
3837 }
3838 /* Either there are no relocations or an error occurred while
3839 reading and parsing the relocation stream. */
3840 return 0;
d9ad93bc
KR		 3841}
3842
36456a67
JL		 3843/* Convert relocations from SOM (external) form into BFD internal
3844 form. Return the number of relocations. */
3845
9e16fcf1
SG		 3846static unsigned int
3847som_canonicalize_reloc (abfd, section, relptr, symbols)
3848 bfd *abfd;
3849 sec_ptr section;
3850 arelent **relptr;
3851 asymbol **symbols;
3852{
36456a67
JL		 3853 arelent *tblptr;
3854 int count;
3855
3856 if (som_slurp_reloc_table (abfd, section, symbols, false) == false)
3857 return 0;
3858
3859 count = section->reloc_count;
3860 tblptr = section->relocation;
3861 if (tblptr == (arelent *) NULL)
3862 return 0;
3863
3864 while (count--)
3865 *relptr++ = tblptr++;
3866
3867 *relptr = (arelent *) NULL;
3868 return section->reloc_count;
9e16fcf1
SG		 3869}
3870
3871extern bfd_target som_vec;
3872
3873/* A hook to set up object file dependent section information. */
3874
d9ad93bc 3875static boolean
9e16fcf1 3876som_new_section_hook (abfd, newsect)
d9ad93bc
KR		 3877 bfd *abfd;
3878 asection *newsect;
3879{
9e16fcf1
SG		 3880 newsect->used_by_bfd = (struct som_section_data_struct *)
3881 bfd_zalloc (abfd, sizeof (struct som_section_data_struct));
d9ad93bc
KR		 3882 newsect->alignment_power = 3;
3883
9e16fcf1
SG		 3884 /* Initialize the subspace_index field to -1 so that it does
3885 not match a subspace with an index of 0. */
3886 som_section_data (newsect)->subspace_index = -1;
3887
d9ad93bc
KR		 3888 /* We allow more than three sections internally */
3889 return true;
3890}
3891
40249bfb
JL		 3892/* Set backend info for sections which can not be described
3893 in the BFD data structures. */
3894
3895void
3896bfd_som_set_section_attributes (section, defined, private, sort_key, spnum)
3897 asection *section;
3898 char defined;
3899 char private;
3900 unsigned char sort_key;
3901 int spnum;
3902{
3903 struct space_dictionary_record *space_dict;
3904
3905 som_section_data (section)->is_space = 1;
3906 space_dict = &som_section_data (section)->space_dict;
3907 space_dict->is_defined = defined;
3908 space_dict->is_private = private;
3909 space_dict->sort_key = sort_key;
3910 space_dict->space_number = spnum;
3911}
3912
3913/* Set backend info for subsections which can not be described
3914 in the BFD data structures. */
3915
3916void
3917bfd_som_set_subsection_attributes (section, container, access,
3918 sort_key, quadrant)
3919 asection *section;
3920 asection *container;
3921 int access;
3922 unsigned char sort_key;
3923 int quadrant;
3924{
3925 struct subspace_dictionary_record *subspace_dict;
3926 som_section_data (section)->is_subspace = 1;
3927 subspace_dict = &som_section_data (section)->subspace_dict;
3928 subspace_dict->access_control_bits = access;
3929 subspace_dict->sort_key = sort_key;
3930 subspace_dict->quadrant = quadrant;
3931 som_section_data (section)->containing_space = container;
3932}
3933
3934/* Set the full SOM symbol type. SOM needs far more symbol information
3935 than any other object file format I'm aware of. It is mandatory
3936 to be able to know if a symbol is an entry point, millicode, data,
3937 code, absolute, storage request, or procedure label. If you get
3938 the symbol type wrong your program will not link. */
3939
3940void
3941bfd_som_set_symbol_type (symbol, type)
3942 asymbol *symbol;
3943 unsigned int type;
3944{
3945 (*som_symbol_data (symbol))->som_type = type;
3946}
3947
3948/* Attach 64bits of unwind information to a symbol (which hopefully
3949 is a function of some kind!). It would be better to keep this
3950 in the R_ENTRY relocation, but there is not enough space. */
3951
3952void
3953bfd_som_attach_unwind_info (symbol, unwind_desc)
3954 asymbol *symbol;
3955 char *unwind_desc;
3956{
3957 (*som_symbol_data (symbol))->unwind = unwind_desc;
3958}
3959
f6c2300b
JL		 3960/* Attach an auxiliary header to the BFD backend so that it may be
3961 written into the object file. */
3962void
3963bfd_som_attach_aux_hdr (abfd, type, string)
3964 bfd *abfd;
3965 int type;
3966 char *string;
3967{
3968 if (type == VERSION_AUX_ID)
3969 {
3970 int len = strlen (string);
39961154 3971 int pad = 0;
f6c2300b
JL		 3972
3973 if (len % 4)
39961154 3974 pad = (4 - (len % 4));
f6c2300b 3975 obj_som_version_hdr (abfd)
39961154
JL		 3976 = bfd_zalloc (abfd, sizeof (struct aux_id)
3977 + sizeof (unsigned int) + len + pad);
f6c2300b 3978 obj_som_version_hdr (abfd)->header_id.type = VERSION_AUX_ID;
39961154
JL		 3979 obj_som_version_hdr (abfd)->header_id.length = len + pad;
3980 obj_som_version_hdr (abfd)->header_id.length += sizeof (int);
f6c2300b 3981 obj_som_version_hdr (abfd)->string_length = len;
39961154 3982 strncpy (obj_som_version_hdr (abfd)->user_string, string, len);
f6c2300b
JL		 3983 }
3984 else if (type == COPYRIGHT_AUX_ID)
3985 {
3986 int len = strlen (string);
39961154 3987 int pad = 0;
f6c2300b
JL		 3988
3989 if (len % 4)
39961154 3990 pad = (4 - (len % 4));
f6c2300b 3991 obj_som_copyright_hdr (abfd)
39961154
JL		 3992 = bfd_zalloc (abfd, sizeof (struct aux_id)
3993 + sizeof (unsigned int) + len + pad);
f6c2300b 3994 obj_som_copyright_hdr (abfd)->header_id.type = COPYRIGHT_AUX_ID;
39961154
JL		 3995 obj_som_copyright_hdr (abfd)->header_id.length = len + pad;
3996 obj_som_copyright_hdr (abfd)->header_id.length += sizeof (int);
f6c2300b
JL		 3997 obj_som_copyright_hdr (abfd)->string_length = len;
3998 strcpy (obj_som_copyright_hdr (abfd)->copyright, string);
3999 }
4000 else
4001 abort ();
4002}
4003
d9ad93bc 4004static boolean
9e16fcf1 4005som_set_section_contents (abfd, section, location, offset, count)
d9ad93bc
KR		 4006 bfd *abfd;
4007 sec_ptr section;
4008 PTR location;
4009 file_ptr offset;
4010 bfd_size_type count;
4011{
980bac64
JL		 4012 if (abfd->output_has_begun == false)
4013 {
4014 /* Set up fixed parts of the file, space, and subspace headers.
4015 Notify the world that output has begun. */
4016 som_prep_headers (abfd);
4017 abfd->output_has_begun = true;
980bac64
JL		 4018 /* Start writing the object file. This include all the string
4019 tables, fixup streams, and other portions of the object file. */
4020 som_begin_writing (abfd);
980bac64
JL		 4021 }
4022
4023 /* Only write subspaces which have "real" contents (eg. the contents
4024 are not generated at run time by the OS). */
4025 if (som_section_data (section)->is_subspace != 1
4026 || ((section->flags & (SEC_LOAD | SEC_DEBUGGING)) == 0))
4027 return true;
4028
4029 /* Seek to the proper offset within the object file and write the
4030 data. */
4031 offset += som_section_data (section)->subspace_dict.file_loc_init_value;
4032 if (bfd_seek (abfd, offset, SEEK_SET) == -1)
4033 {
4034 bfd_error = system_call_error;
4035 return false;
4036 }
4037
4038 if (bfd_write ((PTR) location, 1, count, abfd) != count)
4039 {
4040 bfd_error = system_call_error;
4041 return false;
4042 }
4043 return true;
d9ad93bc
KR		 4044}
4045
4046static boolean
9e16fcf1 4047som_set_arch_mach (abfd, arch, machine)
d9ad93bc
KR		 4048 bfd *abfd;
4049 enum bfd_architecture arch;
4050 unsigned long machine;
4051{
2212ff92 4052 /* Allow any architecture to be supported by the SOM backend */
d9ad93bc
KR		 4053 return bfd_default_set_arch_mach (abfd, arch, machine);
4054}
4055
4056static boolean
9e16fcf1 4057som_find_nearest_line (abfd, section, symbols, offset, filename_ptr,
d9ad93bc
KR		 4058 functionname_ptr, line_ptr)
4059 bfd *abfd;
4060 asection *section;
4061 asymbol **symbols;
4062 bfd_vma offset;
4063 CONST char **filename_ptr;
4064 CONST char **functionname_ptr;
4065 unsigned int *line_ptr;
4066{
9e16fcf1 4067 fprintf (stderr, "som_find_nearest_line unimplemented\n");
d9ad93bc
KR		 4068 fflush (stderr);
4069 abort ();
4070 return (false);
4071}
4072
4073static int
9e16fcf1 4074som_sizeof_headers (abfd, reloc)
d9ad93bc
KR		 4075 bfd *abfd;
4076 boolean reloc;
4077{
9e16fcf1 4078 fprintf (stderr, "som_sizeof_headers unimplemented\n");
d9ad93bc
KR		 4079 fflush (stderr);
4080 abort ();
4081 return (0);
4082}
4083
017a52d7
JL		 4084/* Return the single-character symbol type corresponding to
4085 SOM section S, or '?' for an unknown SOM section. */
4086
4087static char
4088som_section_type (s)
4089 const char *s;
4090{
4091 const struct section_to_type *t;
4092
4093 for (t = &stt[0]; t->section; t++)
4094 if (!strcmp (s, t->section))
4095 return t->type;
4096 return '?';
4097}
4098
4099static int
4100som_decode_symclass (symbol)
4101 asymbol *symbol;
4102{
4103 char c;
4104
4105 if (bfd_is_com_section (symbol->section))
4106 return 'C';
4107 if (symbol->section == &bfd_und_section)
4108 return 'U';
4109 if (symbol->section == &bfd_ind_section)
4110 return 'I';
4111 if (!(symbol->flags & (BSF_GLOBAL|BSF_LOCAL)))
4112 return '?';
4113
4114 if (symbol->section == &bfd_abs_section)
4115 c = 'a';
4116 else if (symbol->section)
4117 c = som_section_type (symbol->section->name);
4118 else
4119 return '?';
4120 if (symbol->flags & BSF_GLOBAL)
4121 c = toupper (c);
4122 return c;
4123}
4124
d9ad93bc
KR		 4125/* Return information about SOM symbol SYMBOL in RET. */
4126
4127static void
9e16fcf1 4128som_get_symbol_info (ignore_abfd, symbol, ret)
017a52d7 4129 bfd *ignore_abfd;
d9ad93bc
KR		 4130 asymbol *symbol;
4131 symbol_info *ret;
4132{
017a52d7
JL		 4133 ret->type = som_decode_symclass (symbol);
4134 if (ret->type != 'U')
4135 ret->value = symbol->value+symbol->section->vma;
4136 else
4137 ret->value = 0;
4138 ret->name = symbol->name;
d9ad93bc
KR		 4139}
4140
4141/* End of miscellaneous support functions. */
4142
9e16fcf1
SG		 4143#define som_bfd_debug_info_start bfd_void
4144#define som_bfd_debug_info_end bfd_void
4145#define som_bfd_debug_info_accumulate (PROTO(void,(*),(bfd*, struct sec *))) bfd_void
d9ad93bc 4146
9e16fcf1
SG		 4147#define som_openr_next_archived_file bfd_generic_openr_next_archived_file
4148#define som_generic_stat_arch_elt bfd_generic_stat_arch_elt
4149#define som_slurp_armap bfd_false
4150#define som_slurp_extended_name_table _bfd_slurp_extended_name_table
4151#define som_truncate_arname (void (*)())bfd_nullvoidptr
4152#define som_write_armap 0
d9ad93bc 4153
9e16fcf1
SG		 4154#define som_get_lineno (struct lineno_cache_entry *(*)())bfd_nullvoidptr
4155#define som_close_and_cleanup bfd_generic_close_and_cleanup
4156#define som_get_section_contents bfd_generic_get_section_contents
d9ad93bc 4157
9e16fcf1 4158#define som_bfd_get_relocated_section_contents \
d9ad93bc 4159 bfd_generic_get_relocated_section_contents
9e16fcf1 4160#define som_bfd_relax_section bfd_generic_relax_section
9e16fcf1 4161#define som_bfd_make_debug_symbol \
d9ad93bc 4162 ((asymbol *(*) PARAMS ((bfd *, void *, unsigned long))) bfd_nullvoidptr)
39961154
JL		 4163#define som_bfd_link_hash_table_create _bfd_generic_link_hash_table_create
4164#define som_bfd_link_add_symbols _bfd_generic_link_add_symbols
4165#define som_bfd_final_link _bfd_generic_final_link
d9ad93bc
KR		 4166
4167/* Core file support is in the hpux-core backend. */
9e16fcf1
SG		 4168#define som_core_file_failing_command _bfd_dummy_core_file_failing_command
4169#define som_core_file_failing_signal _bfd_dummy_core_file_failing_signal
4170#define som_core_file_matches_executable_p _bfd_dummy_core_file_matches_executable_p
d9ad93bc 4171
9e16fcf1 4172bfd_target som_vec =
d9ad93bc 4173{
9e16fcf1
SG		 4174 "som", /* name */
4175 bfd_target_som_flavour,
d9ad93bc
KR		 4176 true, /* target byte order */
4177 true, /* target headers byte order */
4178 (HAS_RELOC | EXEC_P | /* object flags */
4179 HAS_LINENO | HAS_DEBUG |
40249bfb 4180 HAS_SYMS | HAS_LOCALS | WP_TEXT | D_PAGED),
d9ad93bc 4181 (SEC_CODE | SEC_DATA | SEC_ROM | SEC_HAS_CONTENTS
9e16fcf1 4182 | SEC_ALLOC | SEC_LOAD | SEC_RELOC), /* section flags */
d9ad93bc
KR		 4183
4184/* leading_symbol_char: is the first char of a user symbol
9e16fcf1 4185 predictable, and if so what is it */
d9ad93bc
KR		 4186 0,
4187 ' ', /* ar_pad_char */
4188 16, /* ar_max_namelen */
4189 3, /* minimum alignment */
9e16fcf1
SG		 4190 bfd_getb64, bfd_getb_signed_64, bfd_putb64,
4191 bfd_getb32, bfd_getb_signed_32, bfd_putb32,
4192 bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* data */
4193 bfd_getb64, bfd_getb_signed_64, bfd_putb64,
4194 bfd_getb32, bfd_getb_signed_32, bfd_putb32,
4195 bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* hdrs */
d9ad93bc 4196 {_bfd_dummy_target,
9e16fcf1 4197 som_object_p, /* bfd_check_format */
d9ad93bc
KR		 4198 bfd_generic_archive_p,
4199 _bfd_dummy_target
4200 },
4201 {
4202 bfd_false,
9e16fcf1 4203 som_mkobject,
d9ad93bc
KR		 4204 _bfd_generic_mkarchive,
4205 bfd_false
4206 },
4207 {
4208 bfd_false,
9e16fcf1 4209 som_write_object_contents,
d9ad93bc
KR		 4210 _bfd_write_archive_contents,
4211 bfd_false,
4212 },
9e16fcf1
SG		 4213#undef som
4214 JUMP_TABLE (som),
d9ad93bc
KR		 4215 (PTR) 0
4216};
4217
4218#endif /* HOST_HPPAHPUX || HOST_HPPABSD */
Empty description
This page took 0.563775 seconds and 4 git commands to generate.