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