]> git.ipfire.org Git - thirdparty/binutils-gdb.git/blob - bfd/som.c
projects / thirdparty / binutils-gdb.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
_bfd_mul_overflow
[thirdparty/binutils-gdb.git] / bfd / som.c
1 /* bfd back-end for HP PA-RISC SOM objects.
2 Copyright (C) 1990-2020 Free Software Foundation, Inc.
3
4 Contributed by the Center for Software Science at the
5 University of Utah.
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
11 the Free Software Foundation; either version 3 of the License, or
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
21 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
22 02110-1301, USA. */
23
24 #include "sysdep.h"
25 #include "alloca-conf.h"
26 #include "bfd.h"
27 #include "libiberty.h"
28 #include "libbfd.h"
29 #include "som.h"
30 #include "safe-ctype.h"
31 #include "som/reloc.h"
32 #include "aout/ar.h"
33
34 static bfd_reloc_status_type hppa_som_reloc
35 (bfd *, arelent *, asymbol *, void *, asection *, bfd *, char **);
36 static bfd_boolean som_mkobject (bfd *);
37 static bfd_boolean som_is_space (asection *);
38 static bfd_boolean som_is_subspace (asection *);
39 static int compare_subspaces (const void *, const void *);
40 static unsigned long som_compute_checksum (struct som_external_header *);
41 static bfd_boolean som_build_and_write_symbol_table (bfd *);
42 static unsigned int som_slurp_symbol_table (bfd *);
43
44 /* Magic not defined in standard HP-UX header files until 8.0. */
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
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. */
97
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) \
108 (((val) + (alignment) - 1) &~ ((unsigned long) (alignment) - 1))
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
113 of some multi-byte relocation makes object files smaller.
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. */
117 struct reloc_queue
118 {
119 unsigned char *reloc;
120 unsigned int size;
121 } reloc_queue[4];
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). */
126 typedef enum
127 {
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
139 struct section_to_type
140 {
141 const char *section;
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. */
147 struct som_misc_symbol_info
148 {
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;
155 unsigned int secondary_def;
156 unsigned int is_comdat;
157 unsigned int is_common;
158 unsigned int dup_common;
159 };
160
161 /* Map SOM section names to POSIX/BSD single-character symbol types.
162
163 This table includes all the standard subspaces as defined in the
164 current "PRO ABI for PA-RISC Systems", $UNWIND$ which for
165 some reason was left out, and sections specific to embedded stabs. */
166
167 static const struct section_to_type stt[] =
168 {
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
199 into BFD and symbolically printed by utilities. To make actual use
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
207 while possibly modifying the data in some manner. They also can
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
217 Each entry in the table has three fields.
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
225 stream.
226
227 The third field specifys whether or not this relocation may use
228 a constant (V) from the previous R_DATA_OVERRIDE rather than a constant
229 stored in the instruction.
230
231 Variables:
232
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
244
245 Lower case letters (starting with 'b') refer to following
246 bytes in the relocation stream. 'b' is the next 1 byte,
247 c is the next 2 bytes, d is the next 3 bytes, etc...
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
252 the constants are represented in decimal.
253
254 '+', "*" and "=" represents the obvious postfix operators.
255 '<' represents a left shift.
256
257 Stack Operations:
258
259 Parameter Relocation Bits:
260
261 Unwind Entries:
262
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
272 struct fixup_format
273 {
274 int D;
275 const char *format;
276 };
277
278 static const struct fixup_format som_fixup_formats[256] =
279 {
280 /* R_NO_RELOCATION. */
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 */
313 /* R_ZEROES. */
314 { 0, "Lb1+4*=" }, /* 0x20 */
315 { 1, "Ld1+=" }, /* 0x21 */
316 /* R_UNINIT. */
317 { 0, "Lb1+4*=" }, /* 0x22 */
318 { 1, "Ld1+=" }, /* 0x23 */
319 /* R_RELOCATION. */
320 { 0, "L4=" }, /* 0x24 */
321 /* R_DATA_ONE_SYMBOL. */
322 { 0, "L4=Sb=" }, /* 0x25 */
323 { 1, "L4=Sd=" }, /* 0x26 */
324 /* R_DATA_PLABEL. */
325 { 0, "L4=Sb=" }, /* 0x27 */
326 { 1, "L4=Sd=" }, /* 0x28 */
327 /* R_SPACE_REF. */
328 { 0, "L4=" }, /* 0x29 */
329 /* R_REPEATED_INIT. */
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 */
336 /* R_PCREL_CALL. */
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 */
351 /* R_SHORT_PCREL_MODE. */
352 { 0, "" }, /* 0x3e */
353 /* R_LONG_PCREL_MODE. */
354 { 0, "" }, /* 0x3f */
355 /* R_ABS_CALL. */
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 */
370 /* R_RESERVED. */
371 { 0, "" }, /* 0x4e */
372 { 0, "" }, /* 0x4f */
373 /* R_DP_RELATIVE. */
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 */
408 /* R_DATA_GPREL. */
409 { 0, "L4=Sd=" }, /* 0x72 */
410 /* R_RESERVED. */
411 { 0, "" }, /* 0x73 */
412 { 0, "" }, /* 0x74 */
413 { 0, "" }, /* 0x75 */
414 { 0, "" }, /* 0x76 */
415 { 0, "" }, /* 0x77 */
416 /* R_DLT_REL. */
417 { 0, "L4=Sb=" }, /* 0x78 */
418 { 1, "L4=Sd=" }, /* 0x79 */
419 /* R_RESERVED. */
420 { 0, "" }, /* 0x7a */
421 { 0, "" }, /* 0x7b */
422 { 0, "" }, /* 0x7c */
423 { 0, "" }, /* 0x7d */
424 { 0, "" }, /* 0x7e */
425 { 0, "" }, /* 0x7f */
426 /* R_CODE_ONE_SYMBOL. */
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 */
461 /* R_RESERVED. */
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 */
474 /* R_MILLI_REL. */
475 { 0, "L4=Sb=" }, /* 0xae */
476 { 1, "L4=Sd=" }, /* 0xaf */
477 /* R_CODE_PLABEL. */
478 { 0, "L4=Sb=" }, /* 0xb0 */
479 { 1, "L4=Sd=" }, /* 0xb1 */
480 /* R_BREAKPOINT. */
481 { 0, "L4=" }, /* 0xb2 */
482 /* R_ENTRY. */
483 { 0, "Te=Ue=" }, /* 0xb3 */
484 { 1, "Uf=" }, /* 0xb4 */
485 /* R_ALT_ENTRY. */
486 { 0, "" }, /* 0xb5 */
487 /* R_EXIT. */
488 { 0, "" }, /* 0xb6 */
489 /* R_BEGIN_TRY. */
490 { 0, "" }, /* 0xb7 */
491 /* R_END_TRY. */
492 { 0, "R0=" }, /* 0xb8 */
493 { 1, "Rb4*=" }, /* 0xb9 */
494 { 2, "Rd4*=" }, /* 0xba */
495 /* R_BEGIN_BRTAB. */
496 { 0, "" }, /* 0xbb */
497 /* R_END_BRTAB. */
498 { 0, "" }, /* 0xbc */
499 /* R_STATEMENT. */
500 { 0, "Nb=" }, /* 0xbd */
501 { 1, "Nc=" }, /* 0xbe */
502 { 2, "Nd=" }, /* 0xbf */
503 /* R_DATA_EXPR. */
504 { 0, "L4=" }, /* 0xc0 */
505 /* R_CODE_EXPR. */
506 { 0, "L4=" }, /* 0xc1 */
507 /* R_FSEL. */
508 { 0, "" }, /* 0xc2 */
509 /* R_LSEL. */
510 { 0, "" }, /* 0xc3 */
511 /* R_RSEL. */
512 { 0, "" }, /* 0xc4 */
513 /* R_N_MODE. */
514 { 0, "" }, /* 0xc5 */
515 /* R_S_MODE. */
516 { 0, "" }, /* 0xc6 */
517 /* R_D_MODE. */
518 { 0, "" }, /* 0xc7 */
519 /* R_R_MODE. */
520 { 0, "" }, /* 0xc8 */
521 /* R_DATA_OVERRIDE. */
522 { 0, "V0=" }, /* 0xc9 */
523 { 1, "Vb=" }, /* 0xca */
524 { 2, "Vc=" }, /* 0xcb */
525 { 3, "Vd=" }, /* 0xcc */
526 { 4, "Ve=" }, /* 0xcd */
527 /* R_TRANSLATED. */
528 { 0, "" }, /* 0xce */
529 /* R_AUX_UNWIND. */
530 { 0,"Sd=Ve=Ee=" }, /* 0xcf */
531 /* R_COMP1. */
532 { 0, "Ob=" }, /* 0xd0 */
533 /* R_COMP2. */
534 { 0, "Ob=Sd=" }, /* 0xd1 */
535 /* R_COMP3. */
536 { 0, "Ob=Ve=" }, /* 0xd2 */
537 /* R_PREV_FIXUP. */
538 { 0, "P" }, /* 0xd3 */
539 { 1, "P" }, /* 0xd4 */
540 { 2, "P" }, /* 0xd5 */
541 { 3, "P" }, /* 0xd6 */
542 /* R_SEC_STMT. */
543 { 0, "" }, /* 0xd7 */
544 /* R_N0SEL. */
545 { 0, "" }, /* 0xd8 */
546 /* R_N1SEL. */
547 { 0, "" }, /* 0xd9 */
548 /* R_LINETAB. */
549 { 0, "Eb=Sd=Ve=" }, /* 0xda */
550 /* R_LINETAB_ESC. */
551 { 0, "Eb=Mb=" }, /* 0xdb */
552 /* R_LTP_OVERRIDE. */
553 { 0, "" }, /* 0xdc */
554 /* R_COMMENT. */
555 { 0, "Ob=Vf=" }, /* 0xdd */
556 /* R_RESERVED. */
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 */
591 };
592
593 static const int comp1_opcodes[] =
594 {
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
615 static const int comp2_opcodes[] =
616 {
617 0x00,
618 0x80,
619 0x82,
620 0xc0,
621 -1
622 };
623
624 static const int comp3_opcodes[] =
625 {
626 0x00,
627 0x02,
628 -1
629 };
630
631 /* These apparently are not in older versions of hpux reloc.h (hpux7). */
632
633 /* And these first appeared in hpux10. */
634 #ifndef R_SHORT_PCREL_MODE
635 #define NO_PCREL_MODES
636 #define R_SHORT_PCREL_MODE 0x3e
637 #endif
638
639 #define SOM_HOWTO(TYPE, NAME) \
640 HOWTO(TYPE, 0, 0, 32, FALSE, 0, 0, hppa_som_reloc, NAME, FALSE, 0, 0, FALSE)
641
642 static reloc_howto_type som_hppa_howto_table[] =
643 {
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"),
758 SOM_HOWTO (R_DATA_GPREL, "R_DATA_GPREL"),
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"),
899 SOM_HOWTO (R_RESERVED, "R_RESERVED")
900 };
901
902 /* Initialize the SOM relocation queue. By definition the queue holds
903 the last four multibyte fixups. */
904
905 static void
906 som_initialize_reloc_queue (struct reloc_queue *queue)
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
920 static void
921 som_reloc_queue_insert (unsigned char *p,
922 unsigned int size,
923 struct reloc_queue *queue)
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
938 static void
939 som_reloc_queue_fix (struct reloc_queue *queue, unsigned int idx)
940 {
941 if (idx == 0)
942 return;
943
944 if (idx == 1)
945 {
946 unsigned char *tmp1 = queue[0].reloc;
947 unsigned int tmp2 = queue[0].size;
948
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
956 if (idx == 2)
957 {
958 unsigned char *tmp1 = queue[0].reloc;
959 unsigned int tmp2 = queue[0].size;
960
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
970 if (idx == 3)
971 {
972 unsigned char *tmp1 = queue[0].reloc;
973 unsigned int tmp2 = queue[0].size;
974
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 }
985 abort ();
986 }
987
988 /* Search for a particular relocation in the relocation queue. */
989
990 static int
991 som_reloc_queue_find (unsigned char *p,
992 unsigned int size,
993 struct reloc_queue *queue)
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
1010 static unsigned char *
1011 try_prev_fixup (bfd *abfd ATTRIBUTE_UNUSED,
1012 unsigned int *subspace_reloc_sizep,
1013 unsigned char *p,
1014 unsigned int size,
1015 struct reloc_queue *queue)
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
1022 just built and use R_PREV_FIXUP instead. We saved
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
1040 relocation stream via SUBSPACE_RELOC_SIZE_P; also return the
1041 current pointer into the relocation stream. */
1042
1043 static unsigned char *
1044 som_reloc_skip (bfd *abfd,
1045 unsigned int skip,
1046 unsigned char *p,
1047 unsigned int *subspace_reloc_sizep,
1048 struct reloc_queue *queue)
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);
1058 bfd_put_16 (abfd, (bfd_vma) 0xffff, p + 2);
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 }
1070
1071 /* The difference must be less than 0x1000000. Use one
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);
1094 bfd_put_16 (abfd, (bfd_vma) (skip >> 2) - 1, p + 1);
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);
1103 bfd_put_16 (abfd, (bfd_vma) skip - 1, p + 2);
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
1114 static unsigned char *
1115 som_reloc_addend (bfd *abfd,
1116 bfd_vma addend,
1117 unsigned char *p,
1118 unsigned int *subspace_reloc_sizep,
1119 struct reloc_queue *queue)
1120 {
1121 if (addend + 0x80 < 0x100)
1122 {
1123 bfd_put_8 (abfd, R_DATA_OVERRIDE + 1, p);
1124 bfd_put_8 (abfd, addend, p + 1);
1125 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 2, queue);
1126 }
1127 else if (addend + 0x8000 < 0x10000)
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 }
1133 else if (addend + 0x800000 < 0x1000000)
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
1151 static unsigned char *
1152 som_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)
1158 {
1159 int arg_bits = HPPA_R_ARG_RELOC (bfd_reloc->addend);
1160 int rtn_bits = arg_bits & 0x3;
1161 int type, done = 0;
1162
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.
1166
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 }
1218
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;
1235
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);
1242
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);
1253 bfd_put_16 (abfd, (bfd_vma) sym_num, p + 3);
1254 p = try_prev_fixup (abfd, subspace_reloc_sizep, p, 5, queue);
1255 }
1256 }
1257 return p;
1258 }
1259
1260 /* Return the logarithm of X, base 2, considering X unsigned,
1261 if X is a power of 2. Otherwise, returns -1. */
1262
1263 static int
1264 exact_log2 (unsigned int x)
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
1277 static bfd_reloc_status_type
1278 hppa_som_reloc (bfd *abfd ATTRIBUTE_UNUSED,
1279 arelent *reloc_entry,
1280 asymbol *symbol_in ATTRIBUTE_UNUSED,
1281 void *data ATTRIBUTE_UNUSED,
1282 asection *input_section,
1283 bfd *output_bfd,
1284 char **error_message ATTRIBUTE_UNUSED)
1285 {
1286 if (output_bfd)
1287 reloc_entry->address += input_section->output_offset;
1288
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
1295 int **
1296 hppa_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)
1302 {
1303 int *final_type, **final_types;
1304
1305 final_types = bfd_alloc (abfd, (bfd_size_type) sizeof (int *) * 6);
1306 final_type = bfd_alloc (abfd, (bfd_size_type) sizeof (int));
1307 if (!final_types || !final_type)
1308 return NULL;
1309
1310 /* The field selector may require additional relocations to be
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 {
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;
1326
1327 case e_tsel:
1328 case e_ltsel:
1329 case e_rtsel:
1330 final_types[0] = bfd_alloc (abfd, (bfd_size_type) sizeof (int));
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;
1343
1344 case e_lssel:
1345 case e_rssel:
1346 final_types[0] = bfd_alloc (abfd, (bfd_size_type) sizeof (int));
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;
1354
1355 case e_lsel:
1356 case e_rsel:
1357 final_types[0] = bfd_alloc (abfd, (bfd_size_type) sizeof (int));
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;
1365
1366 case e_ldsel:
1367 case e_rdsel:
1368 final_types[0] = bfd_alloc (abfd, (bfd_size_type) sizeof (int));
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;
1376
1377 case e_lrsel:
1378 case e_rrsel:
1379 final_types[0] = bfd_alloc (abfd, (bfd_size_type) sizeof (int));
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;
1387
1388 case e_nsel:
1389 final_types[0] = bfd_alloc (abfd, (bfd_size_type) sizeof (int));
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;
1397
1398 case e_nlsel:
1399 case e_nlrsel:
1400 final_types[0] = bfd_alloc (abfd, (bfd_size_type) sizeof (int));
1401 if (!final_types[0])
1402 return NULL;
1403 *final_types[0] = R_N0SEL;
1404 final_types[1] = bfd_alloc (abfd, (bfd_size_type) sizeof (int));
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;
1415
1416 /* FIXME: These two field selectors are not currently supported. */
1417 case e_ltpsel:
1418 case e_rtpsel:
1419 abort ();
1420 }
1421
1422 switch (base_type)
1423 {
1424 case R_HPPA:
1425 /* The difference of two symbols needs *very* special handling. */
1426 if (sym_diff)
1427 {
1428 size_t amt = sizeof (int);
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);
1434 if (!final_types[0] || !final_types[1] || !final_types[2])
1435 return NULL;
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
1455 || field == e_lpsel
1456 || field == e_rpsel)
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
1467 || field == e_ltsel
1468 || field == e_rtsel)
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
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;
1504 else if (field == e_fsel && format == 32)
1505 *final_type = R_DATA_GPREL;
1506 break;
1507
1508 case R_HPPA_COMPLEX:
1509 /* The difference of two symbols needs *very* special handling. */
1510 if (sym_diff)
1511 {
1512 size_t amt = sizeof (int);
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);
1518 if (!final_types[0] || !final_types[1] || !final_types[2])
1519 return NULL;
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:
1542 /* Right now we can default all these. */
1543 break;
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
1550 will be eliminated as the relocs are sized and emitted. */
1551 size_t amt = sizeof (int);
1552
1553 final_types[0] = bfd_alloc (abfd, amt);
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 }
1566 }
1567 return final_types;
1568 }
1569
1570 /* Return the address of the correct entry in the PA SOM relocation
1571 howto table. */
1572
1573 static reloc_howto_type *
1574 som_bfd_reloc_type_lookup (bfd *abfd ATTRIBUTE_UNUSED,
1575 bfd_reloc_code_real_type code)
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
1583 return NULL;
1584 }
1585
1586 static reloc_howto_type *
1587 som_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
1602 static void
1603 som_swap_clock_in (struct som_external_clock *src,
1604 struct som_clock *dst)
1605 {
1606 dst->secs = bfd_getb32 (src->secs);
1607 dst->nanosecs = bfd_getb32 (src->nanosecs);
1608 }
1609
1610 static void
1611 som_swap_clock_out (struct som_clock *src,
1612 struct som_external_clock *dst)
1613 {
1614 bfd_putb32 (src->secs, dst->secs);
1615 bfd_putb32 (src->nanosecs, dst->nanosecs);
1616 }
1617
1618 static void
1619 som_swap_header_in (struct som_external_header *src,
1620 struct som_header *dst)
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
1656 static void
1657 som_swap_header_out (struct som_header *src,
1658 struct som_external_header *dst)
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
1694 static void
1695 som_swap_space_dictionary_in (struct som_external_space_dictionary_record *src,
1696 struct som_space_dictionary_record *dst)
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
1719 static void
1720 som_swap_space_dictionary_out (struct som_space_dictionary_record *src,
1721 struct som_external_space_dictionary_record *dst)
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
1749 static void
1750 som_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
1785 static void
1786 som_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
1832 static void
1833 som_swap_aux_id_in (struct som_external_aux_id *src,
1834 struct som_aux_id *dst)
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
1846 static void
1847 som_swap_aux_id_out (struct som_aux_id *src,
1848 struct som_external_aux_id *dst)
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
1865 static void
1866 som_swap_string_auxhdr_out (struct som_string_auxhdr *src,
1867 struct som_external_string_auxhdr *dst)
1868 {
1869 som_swap_aux_id_out (&src->header_id, &dst->header_id);
1870 bfd_putb32 (src->string_length, dst->string_length);
1871 }
1872
1873 static void
1874 som_swap_compilation_unit_out (struct som_compilation_unit *src,
1875 struct som_external_compilation_unit *dst)
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
1886 static void
1887 som_swap_exec_auxhdr_in (struct som_external_exec_auxhdr *src,
1888 struct som_exec_auxhdr *dst)
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
1903 static void
1904 som_swap_exec_auxhdr_out (struct som_exec_auxhdr *src,
1905 struct som_external_exec_auxhdr *dst)
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
1920 static void
1921 som_swap_lst_header_in (struct som_external_lst_header *src,
1922 struct som_lst_header *dst)
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
1945 /* Perform some initialization for an object. Save results of this
1946 initialization in the BFD. */
1947
1948 static const bfd_target *
1949 som_object_setup (bfd *abfd,
1950 struct som_header *file_hdrp,
1951 struct som_exec_auxhdr *aux_hdrp,
1952 unsigned long current_offset)
1953 {
1954 asection *section;
1955
1956 /* som_mkobject will set bfd_error if som_mkobject fails. */
1957 if (! som_mkobject (abfd))
1958 return NULL;
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
1992 /* Save the auxiliary header. */
1993 obj_som_exec_hdr (abfd) = aux_hdrp;
1994
1995 /* Allocate space to hold the saved exec header information. */
1996 obj_som_exec_data (abfd) = bfd_zalloc (abfd, (bfd_size_type) sizeof (struct som_exec_data));
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!.
2007
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)
2016 {
2017 int found = 0;
2018
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 {
2034 abfd->start_address = aux_hdrp->exec_flags;
2035 obj_som_exec_data (abfd)->exec_flags = aux_hdrp->exec_entry;
2036 }
2037 else
2038 {
2039 abfd->start_address = aux_hdrp->exec_entry + current_offset;
2040 obj_som_exec_data (abfd)->exec_flags = aux_hdrp->exec_flags;
2041 }
2042 }
2043
2044 obj_som_exec_data (abfd)->version_id = file_hdrp->version_id;
2045
2046 bfd_default_set_arch_mach (abfd, bfd_arch_hppa, pa10);
2047 abfd->symcount = file_hdrp->symbol_total;
2048
2049 /* Initialize the saved symbol table and string table to NULL.
2050 Save important offsets and sizes from the SOM header into
2051 the BFD. */
2052 obj_som_stringtab (abfd) = NULL;
2053 obj_som_symtab (abfd) = NULL;
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
2063 return abfd->xvec;
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
2072 static bfd_boolean
2073 setup_sections (bfd *abfd,
2074 struct som_header *file_hdr,
2075 unsigned long current_offset)
2076 {
2077 char *space_strings = NULL;
2078 unsigned int space_index, i;
2079 unsigned int total_subspaces = 0;
2080 asection **subspace_sections = NULL;
2081 asection *section;
2082 size_t amt;
2083
2084 /* First, read in space names. */
2085 amt = file_hdr->space_strings_size;
2086 if (amt == (size_t) -1)
2087 {
2088 bfd_set_error (bfd_error_no_memory);
2089 goto error_return;
2090 }
2091 space_strings = bfd_malloc (amt + 1);
2092 if (space_strings == NULL)
2093 goto error_return;
2094
2095 if (bfd_seek (abfd, current_offset + file_hdr->space_strings_location,
2096 SEEK_SET) != 0)
2097 goto error_return;
2098 if (bfd_bread (space_strings, amt, abfd) != amt)
2099 goto error_return;
2100 /* Make sure that the string table is NUL terminated. */
2101 space_strings[amt] = 0;
2102
2103 /* Loop over all of the space dictionaries, building up sections. */
2104 for (space_index = 0; space_index < file_hdr->space_total; space_index++)
2105 {
2106 struct som_space_dictionary_record space;
2107 struct som_external_space_dictionary_record ext_space;
2108 char *space_name;
2109 struct som_external_subspace_dictionary_record ext_subspace;
2110 struct som_subspace_dictionary_record subspace, save_subspace;
2111 unsigned int subspace_index;
2112 asection *space_asect;
2113 bfd_size_type space_size = 0;
2114 char *newname;
2115
2116 /* Read the space dictionary element. */
2117 if (bfd_seek (abfd,
2118 (current_offset + file_hdr->space_location
2119 + space_index * sizeof (ext_space)),
2120 SEEK_SET) != 0)
2121 goto error_return;
2122 amt = sizeof ext_space;
2123 if (bfd_bread (&ext_space, amt, abfd) != amt)
2124 goto error_return;
2125
2126 som_swap_space_dictionary_in (&ext_space, &space);
2127
2128 /* Setup the space name string. */
2129 if (space.name >= file_hdr->space_strings_size)
2130 goto error_return;
2131
2132 space_name = space.name + space_strings;
2133
2134 /* Make a section out of it. */
2135 amt = strlen (space_name) + 1;
2136 newname = bfd_alloc (abfd, amt);
2137 if (!newname)
2138 goto error_return;
2139 strcpy (newname, space_name);
2140
2141 space_asect = bfd_make_section_anyway (abfd, newname);
2142 if (!space_asect)
2143 goto error_return;
2144
2145 if (space.is_loadable == 0)
2146 space_asect->flags |= SEC_DEBUGGING;
2147
2148 /* Set up all the attributes for the space. */
2149 if (! bfd_som_set_section_attributes (space_asect, space.is_defined,
2150 space.is_private, space.sort_key,
2151 space.space_number))
2152 goto error_return;
2153
2154 /* If the space has no subspaces, then we're done. */
2155 if (space.subspace_quantity == 0)
2156 continue;
2157
2158 /* Now, read in the first subspace for this space. */
2159 if (bfd_seek (abfd,
2160 (current_offset + file_hdr->subspace_location
2161 + space.subspace_index * sizeof ext_subspace),
2162 SEEK_SET) != 0)
2163 goto error_return;
2164 amt = sizeof ext_subspace;
2165 if (bfd_bread (&ext_subspace, amt, abfd) != amt)
2166 goto error_return;
2167 /* Seek back to the start of the subspaces for loop below. */
2168 if (bfd_seek (abfd,
2169 (current_offset + file_hdr->subspace_location
2170 + space.subspace_index * sizeof ext_subspace),
2171 SEEK_SET) != 0)
2172 goto error_return;
2173
2174 som_swap_subspace_dictionary_in (&ext_subspace, &subspace);
2175
2176 /* Setup the start address and file loc from the first subspace
2177 record. */
2178 space_asect->vma = subspace.subspace_start;
2179 space_asect->filepos = subspace.file_loc_init_value + current_offset;
2180 space_asect->alignment_power = exact_log2 (subspace.alignment);
2181 if (space_asect->alignment_power == (unsigned) -1)
2182 goto error_return;
2183
2184 /* Initialize save_subspace so we can reliably determine if this
2185 loop placed any useful values into it. */
2186 memset (&save_subspace, 0, sizeof (save_subspace));
2187
2188 /* Loop over the rest of the subspaces, building up more sections. */
2189 for (subspace_index = 0; subspace_index < space.subspace_quantity;
2190 subspace_index++)
2191 {
2192 asection *subspace_asect;
2193 char *subspace_name;
2194
2195 /* Read in the next subspace. */
2196 amt = sizeof ext_subspace;
2197 if (bfd_bread (&ext_subspace, amt, abfd) != amt)
2198 goto error_return;
2199
2200 som_swap_subspace_dictionary_in (&ext_subspace, &subspace);
2201
2202 /* Setup the subspace name string. */
2203 subspace_name = subspace.name + space_strings;
2204
2205 amt = strlen (subspace_name) + 1;
2206 newname = bfd_alloc (abfd, amt);
2207 if (!newname)
2208 goto error_return;
2209 strcpy (newname, subspace_name);
2210
2211 /* Make a section out of this subspace. */
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. */
2217 if (! bfd_som_set_subsection_attributes (subspace_asect, space_asect,
2218 subspace.access_control_bits,
2219 subspace.sort_key,
2220 subspace.quadrant,
2221 subspace.is_comdat,
2222 subspace.is_common,
2223 subspace.dup_common))
2224 goto error_return;
2225
2226 /* Keep an easy mapping between subspaces and sections.
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 {
2242 /* Readonly data. */
2243 case 0x0:
2244 subspace_asect->flags |= SEC_DATA | SEC_READONLY;
2245 break;
2246
2247 /* Normal data. */
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 }
2268
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)
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;
2299 /* We can not determine this yet. When we read in the
2300 relocation table the correct value will be filled in. */
2301 subspace_asect->reloc_count = (unsigned) -1;
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;
2309 subspace_asect->size = subspace.subspace_length;
2310 subspace_asect->filepos = (subspace.file_loc_init_value
2311 + current_offset);
2312 subspace_asect->alignment_power = exact_log2 (subspace.alignment);
2313 if (subspace_asect->alignment_power == (unsigned) -1)
2314 goto error_return;
2315
2316 /* Keep track of the accumulated sizes of the sections. */
2317 space_size += subspace.subspace_length;
2318 }
2319
2320 /* This can happen for a .o which defines symbols in otherwise
2321 empty subspaces. */
2322 if (!save_subspace.file_loc_init_value)
2323 space_asect->size = 0;
2324 else
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
2337 only objects, so it cannot be used for length calculations.
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 }
2344 }
2345 /* Now that we've read in all the subspace records, we need to assign
2346 a target index to each subspace. */
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);
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);
2366
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
2378 return TRUE;
2379
2380 error_return:
2381 if (space_strings != NULL)
2382 free (space_strings);
2383
2384 if (subspace_sections != NULL)
2385 free (subspace_sections);
2386 return FALSE;
2387 }
2388
2389
2390 /* Read in a SOM object and make it into a BFD. */
2391
2392 static const bfd_target *
2393 som_object_p (bfd *abfd)
2394 {
2395 struct som_external_header ext_file_hdr;
2396 struct som_header file_hdr;
2397 struct som_exec_auxhdr *aux_hdr_ptr = NULL;
2398 unsigned long current_offset = 0;
2399 struct som_external_lst_header ext_lst_header;
2400 struct som_external_som_entry ext_som_entry;
2401 size_t amt;
2402 unsigned int loc;
2403 #define ENTRY_SIZE sizeof (struct som_external_som_entry)
2404
2405 amt = sizeof (struct som_external_header);
2406 if (bfd_bread (&ext_file_hdr, amt, abfd) != amt)
2407 {
2408 if (bfd_get_error () != bfd_error_system_call)
2409 bfd_set_error (bfd_error_wrong_format);
2410 return NULL;
2411 }
2412
2413 som_swap_header_in (&ext_file_hdr, &file_hdr);
2414
2415 if (!_PA_RISC_ID (file_hdr.system_id))
2416 {
2417 bfd_set_error (bfd_error_wrong_format);
2418 return NULL;
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:
2427 case DL_MAGIC:
2428 case SHL_MAGIC:
2429 #ifdef SHARED_MAGIC_CNX
2430 case SHARED_MAGIC_CNX:
2431 #endif
2432 break;
2433
2434 case EXECLIBMAGIC:
2435 /* Read the lst header and determine where the SOM directory begins. */
2436
2437 if (bfd_seek (abfd, (file_ptr) 0, SEEK_SET) != 0)
2438 {
2439 if (bfd_get_error () != bfd_error_system_call)
2440 bfd_set_error (bfd_error_wrong_format);
2441 return NULL;
2442 }
2443
2444 amt = sizeof (struct som_external_lst_header);
2445 if (bfd_bread (&ext_lst_header, amt, abfd) != amt)
2446 {
2447 if (bfd_get_error () != bfd_error_system_call)
2448 bfd_set_error (bfd_error_wrong_format);
2449 return NULL;
2450 }
2451
2452 /* Position to and read the first directory entry. */
2453 loc = bfd_getb32 (ext_lst_header.dir_loc);
2454 if (bfd_seek (abfd, loc, SEEK_SET) != 0)
2455 {
2456 if (bfd_get_error () != bfd_error_system_call)
2457 bfd_set_error (bfd_error_wrong_format);
2458 return NULL;
2459 }
2460
2461 amt = ENTRY_SIZE;
2462 if (bfd_bread (&ext_som_entry, amt, abfd) != amt)
2463 {
2464 if (bfd_get_error () != bfd_error_system_call)
2465 bfd_set_error (bfd_error_wrong_format);
2466 return NULL;
2467 }
2468
2469 /* Now position to the first SOM. */
2470 current_offset = bfd_getb32 (ext_som_entry.location);
2471 if (bfd_seek (abfd, current_offset, SEEK_SET) != 0)
2472 {
2473 if (bfd_get_error () != bfd_error_system_call)
2474 bfd_set_error (bfd_error_wrong_format);
2475 return NULL;
2476 }
2477
2478 /* And finally, re-read the som header. */
2479 amt = sizeof (struct som_external_header);
2480 if (bfd_bread (&ext_file_hdr, amt, abfd) != amt)
2481 {
2482 if (bfd_get_error () != bfd_error_system_call)
2483 bfd_set_error (bfd_error_wrong_format);
2484 return NULL;
2485 }
2486
2487 som_swap_header_in (&ext_file_hdr, &file_hdr);
2488
2489 break;
2490
2491 default:
2492 bfd_set_error (bfd_error_wrong_format);
2493 return NULL;
2494 }
2495
2496 if (file_hdr.version_id != OLD_VERSION_ID
2497 && file_hdr.version_id != NEW_VERSION_ID)
2498 {
2499 bfd_set_error (bfd_error_wrong_format);
2500 return NULL;
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. */
2506 if (file_hdr.aux_header_size != 0)
2507 {
2508 struct som_external_exec_auxhdr ext_exec_auxhdr;
2509
2510 aux_hdr_ptr = bfd_zalloc (abfd,
2511 (bfd_size_type) sizeof (*aux_hdr_ptr));
2512 if (aux_hdr_ptr == NULL)
2513 return NULL;
2514 amt = sizeof (struct som_external_exec_auxhdr);
2515 if (bfd_bread (&ext_exec_auxhdr, amt, abfd) != amt)
2516 {
2517 if (bfd_get_error () != bfd_error_system_call)
2518 bfd_set_error (bfd_error_wrong_format);
2519 return NULL;
2520 }
2521 som_swap_exec_auxhdr_in (&ext_exec_auxhdr, aux_hdr_ptr);
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);
2528 return NULL;
2529 }
2530
2531 /* This appears to be a valid SOM object. Do some initialization. */
2532 return som_object_setup (abfd, &file_hdr, aux_hdr_ptr, current_offset);
2533 }
2534
2535 /* Create a SOM object. */
2536
2537 static bfd_boolean
2538 som_mkobject (bfd *abfd)
2539 {
2540 /* Allocate memory to hold backend information. */
2541 abfd->tdata.som_data = bfd_zalloc (abfd, (bfd_size_type) sizeof (struct som_data_struct));
2542 if (abfd->tdata.som_data == NULL)
2543 return FALSE;
2544 return TRUE;
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
2551 static bfd_boolean
2552 som_prep_headers (bfd *abfd)
2553 {
2554 struct som_header *file_hdr;
2555 asection *section;
2556 size_t amt = sizeof (struct som_header);
2557
2558 /* Make and attach a file header to the BFD. */
2559 file_hdr = bfd_zalloc (abfd, amt);
2560 if (file_hdr == NULL)
2561 return FALSE;
2562 obj_som_file_hdr (abfd) = file_hdr;
2563
2564 if (abfd->flags & (EXEC_P | DYNAMIC))
2565 {
2566 /* Make and attach an exec header to the BFD. */
2567 amt = sizeof (struct som_exec_auxhdr);
2568 obj_som_exec_hdr (abfd) = bfd_zalloc (abfd, amt);
2569 if (obj_som_exec_hdr (abfd) == NULL)
2570 return FALSE;
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
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;
2590 file_hdr->file_time.nanosecs = 0;
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. */
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;
2605
2606 if (som_is_space (section))
2607 {
2608 /* Allocate space for the space dictionary. */
2609 amt = sizeof (struct som_space_dictionary_record);
2610 som_section_data (section)->space_dict = bfd_zalloc (abfd, amt);
2611 if (som_section_data (section)->space_dict == NULL)
2612 return FALSE;
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. */
2619 som_section_data (section)->space_dict->sort_key =
2620 som_section_data (section)->copy_data->sort_key;
2621 som_section_data (section)->space_dict->is_defined =
2622 som_section_data (section)->copy_data->is_defined;
2623 som_section_data (section)->space_dict->is_private =
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. */
2631 amt = sizeof (struct som_subspace_dictionary_record);
2632 som_section_data (section)->subspace_dict = bfd_zalloc (abfd, amt);
2633 if (som_section_data (section)->subspace_dict == NULL)
2634 return FALSE;
2635
2636 /* Set subspace attributes. Basic stuff is done here, additional
2637 attributes are filled in later as more information becomes
2638 available. */
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
2645 som_section_data (section)->subspace_dict->subspace_start =
2646 section->vma;
2647 som_section_data (section)->subspace_dict->subspace_length =
2648 section->size;
2649 som_section_data (section)->subspace_dict->initialization_length =
2650 section->size;
2651 som_section_data (section)->subspace_dict->alignment =
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;
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;
2667 }
2668 }
2669 return TRUE;
2670 }
2671
2672 /* Return TRUE if the given section is a SOM space, FALSE otherwise. */
2673
2674 static bfd_boolean
2675 som_is_space (asection *section)
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)
2680 return FALSE;
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))
2687 return FALSE;
2688
2689 /* OK. Must be a space. */
2690 return TRUE;
2691 }
2692
2693 /* Return TRUE if the given section is a SOM subspace, FALSE otherwise. */
2694
2695 static bfd_boolean
2696 som_is_subspace (asection *section)
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)
2701 return FALSE;
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))
2708 return FALSE;
2709
2710 /* OK. Must be a subspace. */
2711 return TRUE;
2712 }
2713
2714 /* Return TRUE if the given space contains the given subspace. It
2715 is safe to assume space really is a space, and subspace really
2716 is a subspace. */
2717
2718 static bfd_boolean
2719 som_is_container (asection *space, asection *subspace)
2720 {
2721 return (som_section_data (subspace)->copy_data->container == space)
2722 || (som_section_data (subspace)->copy_data->container->output_section
2723 == space);
2724 }
2725
2726 /* Count and return the number of spaces attached to the given BFD. */
2727
2728 static unsigned long
2729 som_count_spaces (bfd *abfd)
2730 {
2731 int count = 0;
2732 asection *section;
2733
2734 for (section = abfd->sections; section != NULL; section = section->next)
2735 count += som_is_space (section);
2736
2737 return count;
2738 }
2739
2740 /* Count the number of subspaces attached to the given BFD. */
2741
2742 static unsigned long
2743 som_count_subspaces (bfd *abfd)
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
2760 static int
2761 compare_syms (const void *arg1, const void *arg2)
2762 {
2763 asymbol **sym1 = (asymbol **) arg1;
2764 asymbol **sym2 = (asymbol **) arg2;
2765 unsigned int count1, count2;
2766
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
2790 static int
2791 compare_subspaces (const void *arg1, const void *arg2)
2792 {
2793 asection **subspace1 = (asection **) arg1;
2794 asection **subspace2 = (asection **) arg2;
2795
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
2806 static bfd_boolean
2807 som_prep_for_fixups (bfd *abfd, asymbol **syms, unsigned long num_syms)
2808 {
2809 unsigned long i;
2810 asection *section;
2811 asymbol **sorted_syms;
2812 size_t amt;
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 {
2838 int j;
2839
2840 /* Does this section have any relocations? */
2841 if ((int) section->reloc_count <= 0)
2842 continue;
2843
2844 /* Walk through each relocation for this section. */
2845 for (j = 1; j < (int) section->reloc_count; j++)
2846 {
2847 arelent *reloc = section->orelocation[j];
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
2857 /* Scaling to encourage symbols involved in R_DP_RELATIVE
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. */
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);
2890 if (sorted_syms == NULL)
2891 return FALSE;
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
2905 som_symbol_data (sorted_syms[i])->index = i;
2906 }
2907 return TRUE;
2908 }
2909
2910 static bfd_boolean
2911 som_write_fixups (bfd *abfd,
2912 unsigned long current_offset,
2913 unsigned int *total_reloc_sizep)
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;
2924 size_t amt;
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 {
2949 int reloc_offset;
2950 unsigned int current_rounding_mode;
2951 #ifndef NO_PCREL_MODES
2952 unsigned int current_call_mode;
2953 #endif
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
2961 finished with it. */
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
2974 /* To make life easier start over with a clean slate for
2975 each subspace. Seek to the start of the relocation stream
2976 for this subspace in preparation for writing out its fixup
2977 stream. */
2978 if (bfd_seek (abfd, current_offset + total_reloc_size, SEEK_SET) != 0)
2979 return FALSE;
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;
2988 #ifndef NO_PCREL_MODES
2989 current_call_mode = R_SHORT_PCREL_MODE;
2990 #endif
2991
2992 /* Translate each BFD relocation into one or more SOM
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
3000 /* Get the symbol number. Remember it's stored in a
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;
3006
3007 /* If there is not enough room for the next couple relocations,
3008 then dump the current buffer contents now. Also reinitialize
3009 the relocation queue.
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 {
3016 amt = p - tmp_space;
3017 if (bfd_bwrite ((void *) tmp_space, amt, abfd) != amt)
3018 return FALSE;
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:
3055 #ifndef NO_PCREL_MODES
3056 case R_SHORT_PCREL_MODE:
3057 case R_LONG_PCREL_MODE:
3058 #endif
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)
3080 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
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);
3100 bfd_put_16 (abfd, (bfd_vma) sym_num, p + 2);
3101 p = try_prev_fixup (abfd, &subspace_reloc_size,
3102 p, 4, reloc_queue);
3103 }
3104 else
3105 abort ();
3106 break;
3107
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
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)
3133 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
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);
3147 bfd_put_16 (abfd, (bfd_vma) sym_num, p + 2);
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 {
3157 unsigned int tmp;
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);
3168
3169 /* Find the next R_EXIT relocation. */
3170 for (tmp = j; tmp < subsection->reloc_count; tmp++)
3171 {
3172 tmp_reloc = subsection->orelocation[tmp];
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 }
3185
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
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
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:
3230 /* The end of an exception handling region. The reloc's
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;
3251
3252 case R_COMP1:
3253 /* The only time we generate R_COMP1, R_COMP2 and
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:
3263 /* The only time we generate R_COMP1, R_COMP2 and
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);
3269 bfd_put_16 (abfd, (bfd_vma) sym_num, p + 3);
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:
3276 /* The only time we generate R_COMP1, R_COMP2 and
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. */
3297 p = som_reloc_skip (abfd, subsection->size - reloc_offset,
3298 p, &subspace_reloc_size, reloc_queue);
3299
3300 /* Scribble out the relocations. */
3301 amt = p - tmp_space;
3302 if (bfd_bwrite ((void *) tmp_space, amt, abfd) != amt)
3303 return FALSE;
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;
3313 return TRUE;
3314 }
3315
3316 /* Write out the space/subspace string table. */
3317
3318 static bfd_boolean
3319 som_write_space_strings (bfd *abfd,
3320 unsigned long current_offset,
3321 unsigned int *string_sizep)
3322 {
3323 /* Chunk of memory that we can use as buffer space, then throw
3324 away. */
3325 size_t tmp_space_size = SOM_TMP_BUFSIZE;
3326 char *tmp_space = bfd_malloc (tmp_space_size);
3327 char *p = tmp_space;
3328 unsigned int strings_size = 0;
3329 asection *section;
3330 size_t amt;
3331 bfd_size_type res;
3332
3333 if (tmp_space == NULL)
3334 return FALSE;
3335
3336 /* Seek to the start of the space strings in preparation for writing
3337 them out. */
3338 if (bfd_seek (abfd, (file_ptr) current_offset, SEEK_SET) != 0)
3339 return FALSE;
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 {
3345 size_t length;
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
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. */
3359 if (p - tmp_space + 5 + length > tmp_space_size)
3360 {
3361 /* Flush buffer before refilling or reallocating. */
3362 amt = p - tmp_space;
3363 if (bfd_bwrite ((void *) &tmp_space[0], amt, abfd) != amt)
3364 return FALSE;
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
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. */
3377 if (2 * tmp_space_size < length + 5)
3378 tmp_space_size = length + 5;
3379 else
3380 tmp_space_size = 2 * tmp_space_size;
3381 tmp_space = xrealloc (tmp_space, tmp_space_size);
3382 }
3383
3384 /* Reset to beginning of the (possibly new) buffer space. */
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. */
3390 bfd_put_32 (abfd, (bfd_vma) length, p);
3391 p += 4;
3392 strings_size += 4;
3393
3394 /* Record the index in the space/subspace records. */
3395 if (som_is_space (section))
3396 som_section_data (section)->space_dict->name = strings_size;
3397 else
3398 som_section_data (section)->subspace_dict->name = strings_size;
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. */
3416 amt = p - tmp_space;
3417 res = bfd_bwrite ((void *) &tmp_space[0], amt, abfd);
3418 free (tmp_space);
3419 if (res != amt)
3420 return FALSE;
3421 *string_sizep = strings_size;
3422 return TRUE;
3423 }
3424
3425 /* Write out the symbol string table. */
3426
3427 static bfd_boolean
3428 som_write_symbol_strings (bfd *abfd,
3429 unsigned long current_offset,
3430 asymbol **syms,
3431 unsigned int num_syms,
3432 unsigned int *string_sizep,
3433 struct som_compilation_unit *compilation_unit)
3434 {
3435 unsigned int i;
3436 /* Chunk of memory that we can use as buffer space, then throw
3437 away. */
3438 size_t tmp_space_size = SOM_TMP_BUFSIZE;
3439 char *tmp_space = bfd_malloc (tmp_space_size);
3440 char *p = tmp_space;
3441 unsigned int strings_size = 0;
3442 size_t amt;
3443 bfd_size_type res;
3444
3445 if (tmp_space == NULL)
3446 return FALSE;
3447
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
3451 write them and update the compilation unit header. On input, the
3452 compilation unit header contains local copies of the strings.
3453 Move them aside. */
3454
3455 /* Seek to the start of the space strings in preparation for writing
3456 them out. */
3457 if (bfd_seek (abfd, (file_ptr) current_offset, SEEK_SET) != 0)
3458 return FALSE;
3459
3460 if (compilation_unit)
3461 {
3462 for (i = 0; i < 4; i++)
3463 {
3464 struct som_name_pt *name;
3465 size_t length;
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;
3481 default:
3482 abort ();
3483 }
3484
3485 length = strlen (name->name);
3486
3487 /* If there is not enough room for the next entry, then dump
3488 the current buffer contents now and maybe allocate a
3489 larger buffer. */
3490 if (p - tmp_space + 5 + length > tmp_space_size)
3491 {
3492 /* Flush buffer before refilling or reallocating. */
3493 amt = p - tmp_space;
3494 if (bfd_bwrite ((void *) &tmp_space[0], amt, abfd) != amt)
3495 return FALSE;
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. */
3501 if (2 * tmp_space_size < 5 + length)
3502 tmp_space_size = 5 + length;
3503 else
3504 tmp_space_size = 2 * tmp_space_size;
3505 tmp_space = xrealloc (tmp_space, tmp_space_size);
3506 }
3507
3508 /* Reset to beginning of the (possibly new) buffer
3509 space. */
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. */
3517 bfd_put_32 (abfd, (bfd_vma) length, p);
3518 strings_size += 4;
3519 p += 4;
3520
3521 /* Next comes the string itself + a null terminator. */
3522 strcpy (p, name->name);
3523
3524 name->strx = strings_size;
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 {
3541 size_t length = strlen (syms[i]->name);
3542
3543 /* If there is not enough room for the next entry, then dump the
3544 current buffer contents now and maybe allocate a larger buffer. */
3545 if (p - tmp_space + 5 + length > tmp_space_size)
3546 {
3547 /* Flush buffer before refilling or reallocating. */
3548 amt = p - tmp_space;
3549 if (bfd_bwrite ((void *) &tmp_space[0], amt, abfd) != amt)
3550 return FALSE;
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. */
3556 if (2 * tmp_space_size < 5 + length)
3557 tmp_space_size = 5 + length;
3558 else
3559 tmp_space_size = 2 * tmp_space_size;
3560 tmp_space = xrealloc (tmp_space, tmp_space_size);
3561 }
3562
3563 /* Reset to beginning of the (possibly new) buffer space. */
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. */
3571 bfd_put_32 (abfd, (bfd_vma) length, p);
3572 strings_size += 4;
3573 p += 4;
3574
3575 /* Next comes the string itself + a null terminator. */
3576 strcpy (p, syms[i]->name);
3577
3578 som_symbol_data (syms[i])->stringtab_offset = strings_size;
3579 p += length + 1;
3580 strings_size += length + 1;
3581
3582 /* Always align up to the next word boundary. */
3583 while (strings_size % 4)
3584 {
3585 bfd_put_8 (abfd, 0, p);
3586 strings_size++;
3587 p++;
3588 }
3589 }
3590
3591 /* Scribble out any partial block. */
3592 amt = p - tmp_space;
3593 res = bfd_bwrite ((void *) &tmp_space[0], amt, abfd);
3594 free (tmp_space);
3595 if (res != amt)
3596 return FALSE;
3597
3598 *string_sizep = strings_size;
3599 return TRUE;
3600 }
3601
3602 /* Compute variable information to be placed in the SOM headers,
3603 space/subspace dictionaries, relocation streams, etc. Begin
3604 writing parts of the object file. */
3605
3606 static bfd_boolean
3607 som_begin_writing (bfd *abfd)
3608 {
3609 unsigned long current_offset = 0;
3610 unsigned int strings_size = 0;
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
3616 /* The file header will always be first in an object file,
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. */
3628 current_offset += sizeof (struct som_external_header);
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. */
3639 current_offset += sizeof (struct som_external_exec_auxhdr);
3640 obj_som_file_hdr (abfd)->aux_header_size
3641 += sizeof (struct som_external_exec_auxhdr);
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 {
3648 struct som_external_string_auxhdr ext_string_auxhdr;
3649 bfd_size_type len;
3650
3651 if (bfd_seek (abfd, (file_ptr) current_offset, SEEK_SET) != 0)
3652 return FALSE;
3653
3654 /* Write the aux_id structure and the string length. */
3655 len = sizeof (struct som_external_string_auxhdr);
3656 obj_som_file_hdr (abfd)->aux_header_size += len;
3657 current_offset += len;
3658 som_swap_string_auxhdr_out
3659 (obj_som_version_hdr (abfd), &ext_string_auxhdr);
3660 if (bfd_bwrite (&ext_string_auxhdr, len, abfd) != len)
3661 return FALSE;
3662
3663 /* Write the version string. */
3664 len = obj_som_version_hdr (abfd)->header_id.length - 4;
3665 obj_som_file_hdr (abfd)->aux_header_size += len;
3666 current_offset += len;
3667 if (bfd_bwrite ((void *) obj_som_version_hdr (abfd)->string, len, abfd)
3668 != len)
3669 return FALSE;
3670 }
3671
3672 if (obj_som_copyright_hdr (abfd) != NULL)
3673 {
3674 struct som_external_string_auxhdr ext_string_auxhdr;
3675 bfd_size_type len;
3676
3677 if (bfd_seek (abfd, (file_ptr) current_offset, SEEK_SET) != 0)
3678 return FALSE;
3679
3680 /* Write the aux_id structure and the string length. */
3681 len = sizeof (struct som_external_string_auxhdr);
3682 obj_som_file_hdr (abfd)->aux_header_size += len;
3683 current_offset += len;
3684 som_swap_string_auxhdr_out
3685 (obj_som_copyright_hdr (abfd), &ext_string_auxhdr);
3686 if (bfd_bwrite (&ext_string_auxhdr, len, abfd) != len)
3687 return FALSE;
3688
3689 /* Write the copyright string. */
3690 len = obj_som_copyright_hdr (abfd)->header_id.length - 4;
3691 obj_som_file_hdr (abfd)->aux_header_size += len;
3692 current_offset += len;
3693 if (bfd_bwrite ((void *) obj_som_copyright_hdr (abfd)->string, len, abfd)
3694 != len)
3695 return FALSE;
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;
3715 current_offset +=
3716 num_spaces * sizeof (struct som_external_space_dictionary_record);
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;
3728 current_offset
3729 += num_subspaces * sizeof (struct som_external_subspace_dictionary_record);
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
3739 /* Mark the offset of the space/subspace string table in the
3740 file header. */
3741 obj_som_file_hdr (abfd)->space_strings_location = current_offset;
3742
3743 /* Scribble out the space strings. */
3744 if (! som_write_space_strings (abfd, current_offset, &strings_size))
3745 return FALSE;
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
3752 /* Next is the compilation unit. */
3753 obj_som_file_hdr (abfd)->compiler_location = current_offset;
3754 obj_som_file_hdr (abfd)->compiler_total = 0;
3755 if (obj_som_compilation_unit (abfd))
3756 {
3757 obj_som_file_hdr (abfd)->compiler_total = 1;
3758 current_offset += sizeof (struct som_external_compilation_unit);
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
3820 loader will create holes between subspaces *and*
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
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)
3856 exec_header->exec_tsize += subsection->size;
3857 else if (abfd->flags & (EXEC_P | DYNAMIC)
3858 && subsection->flags & SEC_DATA)
3859 exec_header->exec_dsize += subsection->size;
3860 som_section_data (subsection)->subspace_dict->file_loc_init_value
3861 = current_offset;
3862 subsection->filepos = current_offset;
3863 current_offset += subsection->size;
3864 subspace_offset += subsection->size;
3865 }
3866 /* Looks like uninitialized data. */
3867 else
3868 {
3869 /* Update the size of the bss section. */
3870 if (abfd->flags & (EXEC_P | DYNAMIC))
3871 exec_header->exec_bsize += subsection->size;
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. */
3880 section = section->next;
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 {
3908
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;
3921 current_offset += subsection->size;
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->
3929 initialization_length = subsection->size;
3930 }
3931 }
3932 /* Goto the next section. */
3933 section = section->next;
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);
3941 if (bfd_seek (abfd, (file_ptr) current_offset - 1, SEEK_SET) != 0)
3942 return FALSE;
3943 if (bfd_bwrite ((void *) "", (bfd_size_type) 1, abfd) != 1)
3944 return FALSE;
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
3956 return TRUE;
3957 }
3958
3959 /* Finally, scribble out the various headers to the disk. */
3960
3961 static bfd_boolean
3962 som_finish_writing (bfd *abfd)
3963 {
3964 int num_spaces = som_count_spaces (abfd);
3965 asymbol **syms = bfd_get_outsymbols (abfd);
3966 int i, num_syms;
3967 int subspace_index = 0;
3968 file_ptr location;
3969 asection *section;
3970 unsigned long current_offset;
3971 unsigned int strings_size, total_reloc_size;
3972 size_t amt;
3973 struct som_external_header ext_header;
3974
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
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
3991 at this time.
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)
4000 current_offset += (4 - (current_offset % 4));
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;
4005 current_offset +=
4006 num_syms * sizeof (struct som_external_symbol_dictionary_record);
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. */
4015 if (! som_write_symbol_strings (abfd, current_offset, syms,
4016 num_syms, &strings_size,
4017 obj_som_compilation_unit (abfd)))
4018 return FALSE;
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. */
4026 if (!som_prep_for_fixups (abfd,
4027 bfd_get_outsymbols (abfd),
4028 bfd_get_symcount (abfd)))
4029 return FALSE;
4030
4031 /* At the end of the file is the fixup stream which starts on a
4032 word boundary. */
4033 if (current_offset % 4)
4034 current_offset += (4 - (current_offset % 4));
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. */
4039 if (! som_write_fixups (abfd, current_offset, &total_reloc_size))
4040 return FALSE;
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;
4047
4048 /* Now that the symbol table information is complete, build and
4049 write the symbol table. */
4050 if (! som_build_and_write_symbol_table (abfd))
4051 return FALSE;
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;
4058 if (bfd_seek (abfd, location, SEEK_SET) != 0)
4059 return FALSE;
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 {
4076 struct som_external_subspace_dictionary_record ext_subspace_dict;
4077
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;
4105
4106 /* Dump the current subspace header. */
4107 som_swap_subspace_dictionary_record_out
4108 (som_section_data (subsection)->subspace_dict, &ext_subspace_dict);
4109 amt = sizeof (struct som_subspace_dictionary_record);
4110 if (bfd_bwrite (&ext_subspace_dict, amt, abfd) != amt)
4111 return FALSE;
4112 }
4113 /* Goto the next section. */
4114 section = section->next;
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 {
4133 struct som_external_subspace_dictionary_record ext_subspace_dict;
4134
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++;
4158 subspace_index++;
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;
4163
4164 /* Dump this subspace header. */
4165 som_swap_subspace_dictionary_record_out
4166 (som_section_data (subsection)->subspace_dict, &ext_subspace_dict);
4167 amt = sizeof (struct som_subspace_dictionary_record);
4168 if (bfd_bwrite (&ext_subspace_dict, amt, abfd) != amt)
4169 return FALSE;
4170 }
4171 /* Goto the next section. */
4172 section = section->next;
4173 }
4174
4175 /* All the subspace dictionary records are written, and all the
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;
4181 if (bfd_seek (abfd, location, SEEK_SET) != 0)
4182 return FALSE;
4183
4184 section = abfd->sections;
4185 for (i = 0; i < num_spaces; i++)
4186 {
4187 struct som_external_space_dictionary_record ext_space_dict;
4188
4189 /* Find a space. */
4190 while (!som_is_space (section))
4191 section = section->next;
4192
4193 /* Dump its header. */
4194 som_swap_space_dictionary_out (som_section_data (section)->space_dict,
4195 &ext_space_dict);
4196 amt = sizeof (struct som_external_space_dictionary_record);
4197 if (bfd_bwrite (&ext_space_dict, amt, abfd) != amt)
4198 return FALSE;
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 {
4207 struct som_external_compilation_unit ext_comp_unit;
4208
4209 location = obj_som_file_hdr (abfd)->compiler_location;
4210 if (bfd_seek (abfd, location, SEEK_SET) != 0)
4211 return FALSE;
4212
4213 som_swap_compilation_unit_out
4214 (obj_som_compilation_unit (abfd), &ext_comp_unit);
4215
4216 amt = sizeof (struct som_external_compilation_unit);
4217 if (bfd_bwrite (&ext_comp_unit, amt, abfd) != amt)
4218 return FALSE;
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))
4224 obj_som_file_hdr (abfd)->system_id = obj_som_exec_data (abfd)->system_id;
4225 else if (bfd_get_mach (abfd) == pa20)
4226 obj_som_file_hdr (abfd)->system_id = CPU_PA_RISC2_0;
4227 else if (bfd_get_mach (abfd) == pa11)
4228 obj_som_file_hdr (abfd)->system_id = CPU_PA_RISC1_1;
4229 else
4230 obj_som_file_hdr (abfd)->system_id = CPU_PA_RISC1_0;
4231
4232 /* Swap and compute the checksum for the file header just before writing
4233 the header to disk. */
4234 som_swap_header_out (obj_som_file_hdr (abfd), &ext_header);
4235 bfd_putb32 (som_compute_checksum (&ext_header), ext_header.checksum);
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. */
4239 if (bfd_seek (abfd, (file_ptr) 0, SEEK_SET) != 0)
4240 return FALSE;
4241 amt = sizeof (struct som_external_header);
4242 if (bfd_bwrite (&ext_header, amt, abfd) != amt)
4243 return FALSE;
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;
4250 struct som_external_exec_auxhdr ext_exec_header;
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
4257 to be compatible with how the hp linker makes objects
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);
4273 return FALSE;
4274 }
4275
4276 som_swap_exec_auxhdr_out (exec_header, &ext_exec_header);
4277
4278 if (bfd_seek (abfd, obj_som_file_hdr (abfd)->aux_header_location,
4279 SEEK_SET) != 0)
4280 return FALSE;
4281
4282 amt = sizeof (ext_exec_header);
4283 if (bfd_bwrite (&ext_exec_header, amt, abfd) != amt)
4284 return FALSE;
4285 }
4286 return TRUE;
4287 }
4288
4289 /* Compute and return the checksum for a SOM file header. */
4290
4291 static unsigned long
4292 som_compute_checksum (struct som_external_header *hdr)
4293 {
4294 unsigned long checksum, count, i;
4295 unsigned long *buffer = (unsigned long *) hdr;
4296
4297 checksum = 0;
4298 count = sizeof (struct som_external_header) / 4;
4299 for (i = 0; i < count; i++)
4300 checksum ^= *(buffer + i);
4301
4302 return checksum;
4303 }
4304
4305 static void
4306 som_bfd_derive_misc_symbol_info (bfd *abfd ATTRIBUTE_UNUSED,
4307 asymbol *sym,
4308 struct som_misc_symbol_info *info)
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. */
4317
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 {
4324 /* For BFD style common, the linker will choke unless we set the
4325 type and scope to ST_STORAGE and SS_UNSAT, respectively. */
4326 if (bfd_is_com_section (sym->section))
4327 {
4328 info->symbol_type = ST_STORAGE;
4329 info->symbol_scope = SS_UNSAT;
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 {
4362 if (bfd_is_abs_section (sym->section))
4363 info->symbol_type = ST_ABSOLUTE;
4364 else if (sym->section->flags & SEC_CODE)
4365 info->symbol_type = ST_CODE;
4366 else
4367 info->symbol_type = ST_DATA;
4368 }
4369
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 }
4386
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! */
4390 if (bfd_is_com_section (sym->section))
4391 ;
4392 else if (bfd_is_und_section (sym->section))
4393 info->symbol_scope = SS_UNSAT;
4394 else if (sym->flags & (BSF_EXPORT | BSF_WEAK))
4395 info->symbol_scope = SS_UNIVERSAL;
4396 /* Anything else which is not in the common section has scope
4397 SS_LOCAL. */
4398 else
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;
4409 /* For all other symbols, the symbol_info field contains the
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;
4416
4417 /* The secondary_def field is for "weak" symbols. */
4418 if (sym->flags & BSF_WEAK)
4419 info->secondary_def = TRUE;
4420 else
4421 info->secondary_def = FALSE;
4422
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 }
4460 }
4461
4462 /* Build and write, in one big chunk, the entire symbol table for
4463 this BFD. */
4464
4465 static bfd_boolean
4466 som_build_and_write_symbol_table (bfd *abfd)
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);
4471 struct som_external_symbol_dictionary_record *som_symtab = NULL;
4472 unsigned int i;
4473 bfd_size_type symtab_size;
4474 size_t amt;
4475
4476 /* Compute total symbol table size and allocate a chunk of memory
4477 to hold the symbol table as we build it. */
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);
4486 if (som_symtab == NULL && num_syms != 0)
4487 goto error_return;
4488
4489 /* Walk over each symbol. */
4490 for (i = 0; i < num_syms; i++)
4491 {
4492 struct som_misc_symbol_info info;
4493 unsigned int flags;
4494
4495 /* This is really an index into the symbol strings table.
4496 By the time we get here, the index has already been
4497 computed and stored into the name field in the BFD symbol. */
4498 bfd_putb32 (som_symbol_data (bfd_syms[i])->stringtab_offset,
4499 som_symtab[i].name);
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. */
4505 flags = (info.symbol_type << SOM_SYMBOL_TYPE_SH)
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);
4512 bfd_putb32 (flags, som_symtab[i].flags);
4513
4514 flags = (info.symbol_info << SOM_SYMBOL_SYMBOL_INFO_SH)
4515 | (info.is_comdat ? SOM_SYMBOL_IS_COMDAT : 0);
4516 bfd_putb32 (flags, som_symtab[i].info);
4517 bfd_putb32 (info.symbol_value | info.priv_level,
4518 som_symtab[i].symbol_value);
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)
4524 goto error_return;
4525
4526 symtab_size = num_syms;
4527 symtab_size *= sizeof (struct som_external_symbol_dictionary_record);
4528 if (bfd_bwrite ((void *) som_symtab, symtab_size, abfd) != symtab_size)
4529 goto error_return;
4530
4531 if (som_symtab != NULL)
4532 free (som_symtab);
4533 return TRUE;
4534 error_return:
4535 if (som_symtab != NULL)
4536 free (som_symtab);
4537 return FALSE;
4538 }
4539
4540 /* Write an object in SOM format. */
4541
4542 static bfd_boolean
4543 som_write_object_contents (bfd *abfd)
4544 {
4545 if (! abfd->output_has_begun)
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);
4550 abfd->output_has_begun = TRUE;
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
4556 return som_finish_writing (abfd);
4557 }
4558 \f
4559 /* Read and save the string table associated with the given BFD. */
4560
4561 static bfd_boolean
4562 som_slurp_string_table (bfd *abfd)
4563 {
4564 char *stringtab;
4565 bfd_size_type amt;
4566
4567 /* Use the saved version if its available. */
4568 if (obj_som_stringtab (abfd) != NULL)
4569 return TRUE;
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);
4577 return FALSE;
4578 }
4579
4580 /* Allocate and read in the string table. */
4581 amt = obj_som_stringtab_size (abfd);
4582 stringtab = bfd_zmalloc (amt);
4583 if (stringtab == NULL)
4584 return FALSE;
4585
4586 if (bfd_seek (abfd, obj_som_str_filepos (abfd), SEEK_SET) != 0)
4587 return FALSE;
4588
4589 if (bfd_bread (stringtab, amt, abfd) != amt)
4590 return FALSE;
4591
4592 /* Save our results and return success. */
4593 obj_som_stringtab (abfd) = stringtab;
4594 return TRUE;
4595 }
4596
4597 /* Return the amount of data (in bytes) required to hold the symbol
4598 table for this object. */
4599
4600 static long
4601 som_get_symtab_upper_bound (bfd *abfd)
4602 {
4603 if (!som_slurp_symbol_table (abfd))
4604 return -1;
4605
4606 return (bfd_get_symcount (abfd) + 1) * sizeof (asymbol *);
4607 }
4608
4609 /* Convert from a SOM subspace index to a BFD section. */
4610
4611 asection *
4612 bfd_section_from_som_symbol
4613 (bfd *abfd, struct som_external_symbol_dictionary_record *symbol)
4614 {
4615 asection *section;
4616 unsigned int flags = bfd_getb32 (symbol->flags);
4617 unsigned int symbol_type = (flags >> SOM_SYMBOL_TYPE_SH) & SOM_SYMBOL_TYPE_MASK;
4618
4619 /* The meaning of the symbol_info field changes for functions
4620 within executables. So only use the quick symbol_info mapping for
4621 incomplete objects and non-function symbols in executables. */
4622 if ((abfd->flags & (EXEC_P | DYNAMIC)) == 0
4623 || (symbol_type != ST_ENTRY
4624 && symbol_type != ST_PRI_PROG
4625 && symbol_type != ST_SEC_PROG
4626 && symbol_type != ST_MILLICODE))
4627 {
4628 int idx = (bfd_getb32 (symbol->info) >> SOM_SYMBOL_SYMBOL_INFO_SH)
4629 & SOM_SYMBOL_SYMBOL_INFO_MASK;
4630
4631 for (section = abfd->sections; section != NULL; section = section->next)
4632 if (section->target_index == idx && som_is_subspace (section))
4633 return section;
4634 }
4635 else
4636 {
4637 unsigned int value = bfd_getb32 (symbol->symbol_value);
4638
4639 /* For executables we will have to use the symbol's address and
4640 find out what section would contain that address. Yuk. */
4641 for (section = abfd->sections; section; section = section->next)
4642 if (value >= section->vma
4643 && value <= section->vma + section->size
4644 && som_is_subspace (section))
4645 return section;
4646 }
4647
4648 /* Could be a symbol from an external library (such as an OMOS
4649 shared library). Don't abort. */
4650 return bfd_abs_section_ptr;
4651 }
4652
4653 /* Read and save the symbol table associated with the given BFD. */
4654
4655 static unsigned int
4656 som_slurp_symbol_table (bfd *abfd)
4657 {
4658 unsigned int symbol_count = bfd_get_symcount (abfd);
4659 size_t symsize = sizeof (struct som_external_symbol_dictionary_record);
4660 char *stringtab;
4661 struct som_external_symbol_dictionary_record *buf = NULL, *bufp, *endbufp;
4662 som_symbol_type *sym, *symbase;
4663 size_t amt;
4664
4665 /* Return saved value if it exists. */
4666 if (obj_som_symtab (abfd) != NULL)
4667 goto successful_return;
4668
4669 /* Special case. This is *not* an error. */
4670 if (symbol_count == 0)
4671 goto successful_return;
4672
4673 if (!som_slurp_string_table (abfd))
4674 goto error_return;
4675
4676 stringtab = obj_som_stringtab (abfd);
4677
4678 if (_bfd_mul_overflow (symbol_count, sizeof (som_symbol_type), &amt))
4679 {
4680 bfd_set_error (bfd_error_file_too_big);
4681 goto error_return;
4682 }
4683 symbase = bfd_zmalloc (amt);
4684 if (symbase == NULL)
4685 goto error_return;
4686
4687 /* Read in the external SOM representation. */
4688 if (_bfd_mul_overflow (symbol_count, symsize, &amt))
4689 {
4690 bfd_set_error (bfd_error_file_too_big);
4691 goto error_return;
4692 }
4693 buf = bfd_malloc (amt);
4694 if (buf == NULL)
4695 goto error_return;
4696 if (bfd_seek (abfd, obj_som_sym_filepos (abfd), SEEK_SET) != 0)
4697 goto error_return;
4698 if (bfd_bread (buf, amt, abfd) != amt)
4699 goto error_return;
4700
4701 /* Iterate over all the symbols and internalize them. */
4702 endbufp = buf + symbol_count;
4703 for (bufp = buf, sym = symbase; bufp < endbufp; ++bufp)
4704 {
4705 unsigned int flags = bfd_getb32 (bufp->flags);
4706 unsigned int symbol_type =
4707 (flags >> SOM_SYMBOL_TYPE_SH) & SOM_SYMBOL_TYPE_MASK;
4708 unsigned int symbol_scope =
4709 (flags >> SOM_SYMBOL_SCOPE_SH) & SOM_SYMBOL_SCOPE_MASK;
4710
4711 /* I don't think we care about these. */
4712 if (symbol_type == ST_SYM_EXT || symbol_type == ST_ARG_EXT)
4713 continue;
4714
4715 /* Set some private data we care about. */
4716 if (symbol_type == ST_NULL)
4717 som_symbol_data (sym)->som_type = SYMBOL_TYPE_UNKNOWN;
4718 else if (symbol_type == ST_ABSOLUTE)
4719 som_symbol_data (sym)->som_type = SYMBOL_TYPE_ABSOLUTE;
4720 else if (symbol_type == ST_DATA)
4721 som_symbol_data (sym)->som_type = SYMBOL_TYPE_DATA;
4722 else if (symbol_type == ST_CODE)
4723 som_symbol_data (sym)->som_type = SYMBOL_TYPE_CODE;
4724 else if (symbol_type == ST_PRI_PROG)
4725 som_symbol_data (sym)->som_type = SYMBOL_TYPE_PRI_PROG;
4726 else if (symbol_type == ST_SEC_PROG)
4727 som_symbol_data (sym)->som_type = SYMBOL_TYPE_SEC_PROG;
4728 else if (symbol_type == ST_ENTRY)
4729 som_symbol_data (sym)->som_type = SYMBOL_TYPE_ENTRY;
4730 else if (symbol_type == ST_MILLICODE)
4731 som_symbol_data (sym)->som_type = SYMBOL_TYPE_MILLICODE;
4732 else if (symbol_type == ST_PLABEL)
4733 som_symbol_data (sym)->som_type = SYMBOL_TYPE_PLABEL;
4734 else
4735 som_symbol_data (sym)->som_type = SYMBOL_TYPE_UNKNOWN;
4736 som_symbol_data (sym)->tc_data.ap.hppa_arg_reloc =
4737 (flags >> SOM_SYMBOL_ARG_RELOC_SH) & SOM_SYMBOL_ARG_RELOC_MASK;
4738
4739 /* Some reasonable defaults. */
4740 sym->symbol.the_bfd = abfd;
4741 sym->symbol.name = bfd_getb32 (bufp->name) + stringtab;
4742 sym->symbol.value = bfd_getb32 (bufp->symbol_value);
4743 sym->symbol.section = 0;
4744 sym->symbol.flags = 0;
4745
4746 switch (symbol_type)
4747 {
4748 case ST_ENTRY:
4749 case ST_MILLICODE:
4750 sym->symbol.flags |= BSF_FUNCTION;
4751 som_symbol_data (sym)->tc_data.ap.hppa_priv_level =
4752 sym->symbol.value & 0x3;
4753 sym->symbol.value &= ~0x3;
4754 break;
4755
4756 case ST_STUB:
4757 case ST_CODE:
4758 case ST_PRI_PROG:
4759 case ST_SEC_PROG:
4760 som_symbol_data (sym)->tc_data.ap.hppa_priv_level =
4761 sym->symbol.value & 0x3;
4762 sym->symbol.value &= ~0x3;
4763 /* If the symbol's scope is SS_UNSAT, then these are
4764 undefined function symbols. */
4765 if (symbol_scope == SS_UNSAT)
4766 sym->symbol.flags |= BSF_FUNCTION;
4767
4768 default:
4769 break;
4770 }
4771
4772 /* Handle scoping and section information. */
4773 switch (symbol_scope)
4774 {
4775 /* symbol_info field is undefined for SS_EXTERNAL and SS_UNSAT symbols,
4776 so the section associated with this symbol can't be known. */
4777 case SS_EXTERNAL:
4778 if (symbol_type != ST_STORAGE)
4779 sym->symbol.section = bfd_und_section_ptr;
4780 else
4781 sym->symbol.section = bfd_com_section_ptr;
4782 sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL);
4783 break;
4784
4785 case SS_UNSAT:
4786 if (symbol_type != ST_STORAGE)
4787 sym->symbol.section = bfd_und_section_ptr;
4788 else
4789 sym->symbol.section = bfd_com_section_ptr;
4790 break;
4791
4792 case SS_UNIVERSAL:
4793 sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL);
4794 sym->symbol.section = bfd_section_from_som_symbol (abfd, bufp);
4795 sym->symbol.value -= sym->symbol.section->vma;
4796 break;
4797
4798 case SS_LOCAL:
4799 sym->symbol.flags |= BSF_LOCAL;
4800 sym->symbol.section = bfd_section_from_som_symbol (abfd, bufp);
4801 sym->symbol.value -= sym->symbol.section->vma;
4802 break;
4803 }
4804
4805 /* Check for a weak symbol. */
4806 if (flags & SOM_SYMBOL_SECONDARY_DEF)
4807 sym->symbol.flags |= BSF_WEAK;
4808
4809 /* Mark section symbols and symbols used by the debugger.
4810 Note $START$ is a magic code symbol, NOT a section symbol. */
4811 if (sym->symbol.name[0] == '$'
4812 && sym->symbol.name[strlen (sym->symbol.name) - 1] == '$'
4813 && !strcmp (sym->symbol.name, sym->symbol.section->name))
4814 sym->symbol.flags |= BSF_SECTION_SYM;
4815 else if (CONST_STRNEQ (sym->symbol.name, "L$0\002"))
4816 {
4817 sym->symbol.flags |= BSF_SECTION_SYM;
4818 sym->symbol.name = sym->symbol.section->name;
4819 }
4820 else if (CONST_STRNEQ (sym->symbol.name, "L$0\001"))
4821 sym->symbol.flags |= BSF_DEBUGGING;
4822
4823 /* Note increment at bottom of loop, since we skip some symbols
4824 we can not include it as part of the for statement. */
4825 sym++;
4826 }
4827
4828 /* We modify the symbol count to record the number of BFD symbols we
4829 created. */
4830 abfd->symcount = sym - symbase;
4831
4832 /* Save our results and return success. */
4833 obj_som_symtab (abfd) = symbase;
4834 successful_return:
4835 if (buf != NULL)
4836 free (buf);
4837 return (TRUE);
4838
4839 error_return:
4840 if (buf != NULL)
4841 free (buf);
4842 return FALSE;
4843 }
4844
4845 /* Canonicalize a SOM symbol table. Return the number of entries
4846 in the symbol table. */
4847
4848 static long
4849 som_canonicalize_symtab (bfd *abfd, asymbol **location)
4850 {
4851 int i;
4852 som_symbol_type *symbase;
4853
4854 if (!som_slurp_symbol_table (abfd))
4855 return -1;
4856
4857 i = bfd_get_symcount (abfd);
4858 symbase = obj_som_symtab (abfd);
4859
4860 for (; i > 0; i--, location++, symbase++)
4861 *location = &symbase->symbol;
4862
4863 /* Final null pointer. */
4864 *location = 0;
4865 return (bfd_get_symcount (abfd));
4866 }
4867
4868 /* Make a SOM symbol. There is nothing special to do here. */
4869
4870 static asymbol *
4871 som_make_empty_symbol (bfd *abfd)
4872 {
4873 size_t amt = sizeof (som_symbol_type);
4874 som_symbol_type *new_symbol_type = bfd_zalloc (abfd, amt);
4875
4876 if (new_symbol_type == NULL)
4877 return NULL;
4878 new_symbol_type->symbol.the_bfd = abfd;
4879
4880 return &new_symbol_type->symbol;
4881 }
4882
4883 /* Print symbol information. */
4884
4885 static void
4886 som_print_symbol (bfd *abfd,
4887 void *afile,
4888 asymbol *symbol,
4889 bfd_print_symbol_type how)
4890 {
4891 FILE *file = (FILE *) afile;
4892
4893 switch (how)
4894 {
4895 case bfd_print_symbol_name:
4896 fprintf (file, "%s", symbol->name);
4897 break;
4898 case bfd_print_symbol_more:
4899 fprintf (file, "som ");
4900 fprintf_vma (file, symbol->value);
4901 fprintf (file, " %lx", (long) symbol->flags);
4902 break;
4903 case bfd_print_symbol_all:
4904 {
4905 const char *section_name;
4906
4907 section_name = symbol->section ? symbol->section->name : "(*none*)";
4908 bfd_print_symbol_vandf (abfd, (void *) file, symbol);
4909 fprintf (file, " %s\t%s", section_name, symbol->name);
4910 break;
4911 }
4912 }
4913 }
4914
4915 static bfd_boolean
4916 som_bfd_is_local_label_name (bfd *abfd ATTRIBUTE_UNUSED,
4917 const char *name)
4918 {
4919 return name[0] == 'L' && name[1] == '$';
4920 }
4921
4922 /* Count or process variable-length SOM fixup records.
4923
4924 To avoid code duplication we use this code both to compute the number
4925 of relocations requested by a stream, and to internalize the stream.
4926
4927 When computing the number of relocations requested by a stream the
4928 variables rptr, section, and symbols have no meaning.
4929
4930 Return the number of relocations requested by the fixup stream. When
4931 not just counting
4932
4933 This needs at least two or three more passes to get it cleaned up. */
4934
4935 static unsigned int
4936 som_set_reloc_info (unsigned char *fixup,
4937 unsigned int end,
4938 arelent *internal_relocs,
4939 asection *section,
4940 asymbol **symbols,
4941 bfd_boolean just_count)
4942 {
4943 unsigned int op, varname, deallocate_contents = 0;
4944 unsigned char *end_fixups = &fixup[end];
4945 const struct fixup_format *fp;
4946 const char *cp;
4947 unsigned char *save_fixup;
4948 int variables[26], stack[20], c, v, count, prev_fixup, *sp, saved_unwind_bits;
4949 const int *subop;
4950 arelent *rptr = internal_relocs;
4951 unsigned int offset = 0;
4952
4953 #define var(c) variables[(c) - 'A']
4954 #define push(v) (*sp++ = (v))
4955 #define pop() (*--sp)
4956 #define emptystack() (sp == stack)
4957
4958 som_initialize_reloc_queue (reloc_queue);
4959 memset (variables, 0, sizeof (variables));
4960 memset (stack, 0, sizeof (stack));
4961 count = 0;
4962 prev_fixup = 0;
4963 saved_unwind_bits = 0;
4964 sp = stack;
4965
4966 while (fixup < end_fixups)
4967 {
4968 /* Save pointer to the start of this fixup. We'll use
4969 it later to determine if it is necessary to put this fixup
4970 on the queue. */
4971 save_fixup = fixup;
4972
4973 /* Get the fixup code and its associated format. */
4974 op = *fixup++;
4975 fp = &som_fixup_formats[op];
4976
4977 /* Handle a request for a previous fixup. */
4978 if (*fp->format == 'P')
4979 {
4980 /* Get pointer to the beginning of the prev fixup, move
4981 the repeated fixup to the head of the queue. */
4982 fixup = reloc_queue[fp->D].reloc;
4983 som_reloc_queue_fix (reloc_queue, fp->D);
4984 prev_fixup = 1;
4985
4986 /* Get the fixup code and its associated format. */
4987 op = *fixup++;
4988 fp = &som_fixup_formats[op];
4989 }
4990
4991 /* If this fixup will be passed to BFD, set some reasonable defaults. */
4992 if (! just_count
4993 && som_hppa_howto_table[op].type != R_NO_RELOCATION
4994 && som_hppa_howto_table[op].type != R_DATA_OVERRIDE)
4995 {
4996 rptr->address = offset;
4997 rptr->howto = &som_hppa_howto_table[op];
4998 rptr->addend = 0;
4999 rptr->sym_ptr_ptr = bfd_abs_section_ptr->symbol_ptr_ptr;
5000 }
5001
5002 /* Set default input length to 0. Get the opcode class index
5003 into D. */
5004 var ('L') = 0;
5005 var ('D') = fp->D;
5006 var ('U') = saved_unwind_bits;
5007
5008 /* Get the opcode format. */
5009 cp = fp->format;
5010
5011 /* Process the format string. Parsing happens in two phases,
5012 parse RHS, then assign to LHS. Repeat until no more
5013 characters in the format string. */
5014 while (*cp)
5015 {
5016 /* The variable this pass is going to compute a value for. */
5017 varname = *cp++;
5018
5019 /* Start processing RHS. Continue until a NULL or '=' is found. */
5020 do
5021 {
5022 c = *cp++;
5023
5024 /* If this is a variable, push it on the stack. */
5025 if (ISUPPER (c))
5026 push (var (c));
5027
5028 /* If this is a lower case letter, then it represents
5029 additional data from the fixup stream to be pushed onto
5030 the stack. */
5031 else if (ISLOWER (c))
5032 {
5033 int bits = (c - 'a') * 8;
5034 for (v = 0; c > 'a'; --c)
5035 v = (v << 8) | *fixup++;
5036 if (varname == 'V')
5037 v = sign_extend (v, bits);
5038 push (v);
5039 }
5040
5041 /* A decimal constant. Push it on the stack. */
5042 else if (ISDIGIT (c))
5043 {
5044 v = c - '0';
5045 while (ISDIGIT (*cp))
5046 v = (v * 10) + (*cp++ - '0');
5047 push (v);
5048 }
5049 else
5050 /* An operator. Pop two values from the stack and
5051 use them as operands to the given operation. Push
5052 the result of the operation back on the stack. */
5053 switch (c)
5054 {
5055 case '+':
5056 v = pop ();
5057 v += pop ();
5058 push (v);
5059 break;
5060 case '*':
5061 v = pop ();
5062 v *= pop ();
5063 push (v);
5064 break;
5065 case '<':
5066 v = pop ();
5067 v = pop () << v;
5068 push (v);
5069 break;
5070 default:
5071 abort ();
5072 }
5073 }
5074 while (*cp && *cp != '=');
5075
5076 /* Move over the equal operator. */
5077 cp++;
5078
5079 /* Pop the RHS off the stack. */
5080 c = pop ();
5081
5082 /* Perform the assignment. */
5083 var (varname) = c;
5084
5085 /* Handle side effects. and special 'O' stack cases. */
5086 switch (varname)
5087 {
5088 /* Consume some bytes from the input space. */
5089 case 'L':
5090 offset += c;
5091 break;
5092 /* A symbol to use in the relocation. Make a note
5093 of this if we are not just counting. */
5094 case 'S':
5095 if (! just_count)
5096 rptr->sym_ptr_ptr = &symbols[c];
5097 break;
5098 /* Argument relocation bits for a function call. */
5099 case 'R':
5100 if (! just_count)
5101 {
5102 unsigned int tmp = var ('R');
5103 rptr->addend = 0;
5104
5105 if ((som_hppa_howto_table[op].type == R_PCREL_CALL
5106 && R_PCREL_CALL + 10 > op)
5107 || (som_hppa_howto_table[op].type == R_ABS_CALL
5108 && R_ABS_CALL + 10 > op))
5109 {
5110 /* Simple encoding. */
5111 if (tmp > 4)
5112 {
5113 tmp -= 5;
5114 rptr->addend |= 1;
5115 }
5116 if (tmp == 4)
5117 rptr->addend |= 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2;
5118 else if (tmp == 3)
5119 rptr->addend |= 1 << 8 | 1 << 6 | 1 << 4;
5120 else if (tmp == 2)
5121 rptr->addend |= 1 << 8 | 1 << 6;
5122 else if (tmp == 1)
5123 rptr->addend |= 1 << 8;
5124 }
5125 else
5126 {
5127 unsigned int tmp1, tmp2;
5128
5129 /* First part is easy -- low order two bits are
5130 directly copied, then shifted away. */
5131 rptr->addend = tmp & 0x3;
5132 tmp >>= 2;
5133
5134 /* Diving the result by 10 gives us the second
5135 part. If it is 9, then the first two words
5136 are a double precision paramater, else it is
5137 3 * the first arg bits + the 2nd arg bits. */
5138 tmp1 = tmp / 10;
5139 tmp -= tmp1 * 10;
5140 if (tmp1 == 9)
5141 rptr->addend += (0xe << 6);
5142 else
5143 {
5144 /* Get the two pieces. */
5145 tmp2 = tmp1 / 3;
5146 tmp1 -= tmp2 * 3;
5147 /* Put them in the addend. */
5148 rptr->addend += (tmp2 << 8) + (tmp1 << 6);
5149 }
5150
5151 /* What's left is the third part. It's unpacked
5152 just like the second. */
5153 if (tmp == 9)
5154 rptr->addend += (0xe << 2);
5155 else
5156 {
5157 tmp2 = tmp / 3;
5158 tmp -= tmp2 * 3;
5159 rptr->addend += (tmp2 << 4) + (tmp << 2);
5160 }
5161 }
5162 rptr->addend = HPPA_R_ADDEND (rptr->addend, 0);
5163 }
5164 break;
5165 /* Handle the linker expression stack. */
5166 case 'O':
5167 switch (op)
5168 {
5169 case R_COMP1:
5170 subop = comp1_opcodes;
5171 break;
5172 case R_COMP2:
5173 subop = comp2_opcodes;
5174 break;
5175 case R_COMP3:
5176 subop = comp3_opcodes;
5177 break;
5178 default:
5179 abort ();
5180 }
5181 while (*subop <= (unsigned char) c)
5182 ++subop;
5183 --subop;
5184 break;
5185 /* The lower 32unwind bits must be persistent. */
5186 case 'U':
5187 saved_unwind_bits = var ('U');
5188 break;
5189
5190 default:
5191 break;
5192 }
5193 }
5194
5195 /* If we used a previous fixup, clean up after it. */
5196 if (prev_fixup)
5197 {
5198 fixup = save_fixup + 1;
5199 prev_fixup = 0;
5200 }
5201 /* Queue it. */
5202 else if (fixup > save_fixup + 1)
5203 som_reloc_queue_insert (save_fixup, fixup - save_fixup, reloc_queue);
5204
5205 /* We do not pass R_DATA_OVERRIDE or R_NO_RELOCATION
5206 fixups to BFD. */
5207 if (som_hppa_howto_table[op].type != R_DATA_OVERRIDE
5208 && som_hppa_howto_table[op].type != R_NO_RELOCATION)
5209 {
5210 /* Done with a single reloction. Loop back to the top. */
5211 if (! just_count)
5212 {
5213 if (som_hppa_howto_table[op].type == R_ENTRY)
5214 rptr->addend = var ('T');
5215 else if (som_hppa_howto_table[op].type == R_EXIT)
5216 rptr->addend = var ('U');
5217 else if (som_hppa_howto_table[op].type == R_PCREL_CALL
5218 || som_hppa_howto_table[op].type == R_ABS_CALL)
5219 ;
5220 else if (som_hppa_howto_table[op].type == R_DATA_ONE_SYMBOL)
5221 {
5222 /* Try what was specified in R_DATA_OVERRIDE first
5223 (if anything). Then the hard way using the
5224 section contents. */
5225 rptr->addend = var ('V');
5226
5227 if (rptr->addend == 0 && !section->contents)
5228 {
5229 /* Got to read the damn contents first. We don't
5230 bother saving the contents (yet). Add it one
5231 day if the need arises. */
5232 bfd_byte *contents;
5233 if (!bfd_malloc_and_get_section (section->owner, section,
5234 &contents))
5235 {
5236 if (contents != NULL)
5237 free (contents);
5238 return (unsigned) -1;
5239 }
5240 section->contents = contents;
5241 deallocate_contents = 1;
5242 }
5243 else if (rptr->addend == 0)
5244 rptr->addend = bfd_get_32 (section->owner,
5245 (section->contents
5246 + offset - var ('L')));
5247
5248 }
5249 else
5250 rptr->addend = var ('V');
5251 rptr++;
5252 }
5253 count++;
5254 /* Now that we've handled a "full" relocation, reset
5255 some state. */
5256 memset (variables, 0, sizeof (variables));
5257 memset (stack, 0, sizeof (stack));
5258 }
5259 }
5260 if (deallocate_contents)
5261 free (section->contents);
5262
5263 return count;
5264
5265 #undef var
5266 #undef push
5267 #undef pop
5268 #undef emptystack
5269 }
5270
5271 /* Read in the relocs (aka fixups in SOM terms) for a section.
5272
5273 som_get_reloc_upper_bound calls this routine with JUST_COUNT
5274 set to TRUE to indicate it only needs a count of the number
5275 of actual relocations. */
5276
5277 static bfd_boolean
5278 som_slurp_reloc_table (bfd *abfd,
5279 asection *section,
5280 asymbol **symbols,
5281 bfd_boolean just_count)
5282 {
5283 unsigned char *external_relocs;
5284 unsigned int fixup_stream_size;
5285 arelent *internal_relocs;
5286 unsigned int num_relocs;
5287 size_t amt;
5288
5289 fixup_stream_size = som_section_data (section)->reloc_size;
5290 /* If there were no relocations, then there is nothing to do. */
5291 if (section->reloc_count == 0)
5292 return TRUE;
5293
5294 /* If reloc_count is -1, then the relocation stream has not been
5295 parsed. We must do so now to know how many relocations exist. */
5296 if (section->reloc_count == (unsigned) -1)
5297 {
5298 amt = fixup_stream_size;
5299 external_relocs = bfd_malloc (amt);
5300 if (external_relocs == NULL)
5301 return FALSE;
5302 /* Read in the external forms. */
5303 if (bfd_seek (abfd,
5304 obj_som_reloc_filepos (abfd) + section->rel_filepos,
5305 SEEK_SET)
5306 != 0)
5307 return FALSE;
5308 if (bfd_bread (external_relocs, amt, abfd) != amt)
5309 return FALSE;
5310
5311 /* Let callers know how many relocations found.
5312 also save the relocation stream as we will
5313 need it again. */
5314 section->reloc_count = som_set_reloc_info (external_relocs,
5315 fixup_stream_size,
5316 NULL, NULL, NULL, TRUE);
5317
5318 som_section_data (section)->reloc_stream = external_relocs;
5319 }
5320
5321 /* If the caller only wanted a count, then return now. */
5322 if (just_count)
5323 return TRUE;
5324
5325 num_relocs = section->reloc_count;
5326 external_relocs = som_section_data (section)->reloc_stream;
5327 /* Return saved information about the relocations if it is available. */
5328 if (section->relocation != NULL)
5329 return TRUE;
5330
5331 if (_bfd_mul_overflow (num_relocs, sizeof (arelent), &amt))
5332 {
5333 bfd_set_error (bfd_error_file_too_big);
5334 return FALSE;
5335 }
5336 internal_relocs = bfd_zalloc (abfd, amt);
5337 if (internal_relocs == NULL)
5338 return FALSE;
5339
5340 /* Process and internalize the relocations. */
5341 som_set_reloc_info (external_relocs, fixup_stream_size,
5342 internal_relocs, section, symbols, FALSE);
5343
5344 /* We're done with the external relocations. Free them. */
5345 free (external_relocs);
5346 som_section_data (section)->reloc_stream = NULL;
5347
5348 /* Save our results and return success. */
5349 section->relocation = internal_relocs;
5350 return TRUE;
5351 }
5352
5353 /* Return the number of bytes required to store the relocation
5354 information associated with the given section. */
5355
5356 static long
5357 som_get_reloc_upper_bound (bfd *abfd, sec_ptr asect)
5358 {
5359 /* If section has relocations, then read in the relocation stream
5360 and parse it to determine how many relocations exist. */
5361 if (asect->flags & SEC_RELOC)
5362 {
5363 if (! som_slurp_reloc_table (abfd, asect, NULL, TRUE))
5364 return -1;
5365 return (asect->reloc_count + 1) * sizeof (arelent *);
5366 }
5367
5368 /* There are no relocations. Return enough space to hold the
5369 NULL pointer which will be installed if som_canonicalize_reloc
5370 is called. */
5371 return sizeof (arelent *);
5372 }
5373
5374 /* Convert relocations from SOM (external) form into BFD internal
5375 form. Return the number of relocations. */
5376
5377 static long
5378 som_canonicalize_reloc (bfd *abfd,
5379 sec_ptr section,
5380 arelent **relptr,
5381 asymbol **symbols)
5382 {
5383 arelent *tblptr;
5384 int count;
5385
5386 if (! som_slurp_reloc_table (abfd, section, symbols, FALSE))
5387 return -1;
5388
5389 count = section->reloc_count;
5390 tblptr = section->relocation;
5391
5392 while (count--)
5393 *relptr++ = tblptr++;
5394
5395 *relptr = NULL;
5396 return section->reloc_count;
5397 }
5398
5399 extern const bfd_target hppa_som_vec;
5400
5401 /* A hook to set up object file dependent section information. */
5402
5403 static bfd_boolean
5404 som_new_section_hook (bfd *abfd, asection *newsect)
5405 {
5406 if (!newsect->used_by_bfd)
5407 {
5408 size_t amt = sizeof (struct som_section_data_struct);
5409
5410 newsect->used_by_bfd = bfd_zalloc (abfd, amt);
5411 if (!newsect->used_by_bfd)
5412 return FALSE;
5413 }
5414 newsect->alignment_power = 3;
5415
5416 /* We allow more than three sections internally. */
5417 return _bfd_generic_new_section_hook (abfd, newsect);
5418 }
5419
5420 /* Copy any private info we understand from the input symbol
5421 to the output symbol. */
5422
5423 static bfd_boolean
5424 som_bfd_copy_private_symbol_data (bfd *ibfd,
5425 asymbol *isymbol,
5426 bfd *obfd,
5427 asymbol *osymbol)
5428 {
5429 struct som_symbol *input_symbol = (struct som_symbol *) isymbol;
5430 struct som_symbol *output_symbol = (struct som_symbol *) osymbol;
5431
5432 /* One day we may try to grok other private data. */
5433 if (ibfd->xvec->flavour != bfd_target_som_flavour
5434 || obfd->xvec->flavour != bfd_target_som_flavour)
5435 return FALSE;
5436
5437 /* The only private information we need to copy is the argument relocation
5438 bits. */
5439 output_symbol->tc_data.ap.hppa_arg_reloc =
5440 input_symbol->tc_data.ap.hppa_arg_reloc;
5441
5442 return TRUE;
5443 }
5444
5445 /* Copy any private info we understand from the input section
5446 to the output section. */
5447
5448 static bfd_boolean
5449 som_bfd_copy_private_section_data (bfd *ibfd,
5450 asection *isection,
5451 bfd *obfd,
5452 asection *osection)
5453 {
5454 size_t amt;
5455
5456 /* One day we may try to grok other private data. */
5457 if (ibfd->xvec->flavour != bfd_target_som_flavour
5458 || obfd->xvec->flavour != bfd_target_som_flavour
5459 || (!som_is_space (isection) && !som_is_subspace (isection)))
5460 return TRUE;
5461
5462 amt = sizeof (struct som_copyable_section_data_struct);
5463 som_section_data (osection)->copy_data = bfd_zalloc (obfd, amt);
5464 if (som_section_data (osection)->copy_data == NULL)
5465 return FALSE;
5466
5467 memcpy (som_section_data (osection)->copy_data,
5468 som_section_data (isection)->copy_data,
5469 sizeof (struct som_copyable_section_data_struct));
5470
5471 /* Reparent if necessary. */
5472 if (som_section_data (osection)->copy_data->container)
5473 som_section_data (osection)->copy_data->container =
5474 som_section_data (osection)->copy_data->container->output_section;
5475
5476 return TRUE;
5477 }
5478
5479 /* Copy any private info we understand from the input bfd
5480 to the output bfd. */
5481
5482 static bfd_boolean
5483 som_bfd_copy_private_bfd_data (bfd *ibfd, bfd *obfd)
5484 {
5485 /* One day we may try to grok other private data. */
5486 if (ibfd->xvec->flavour != bfd_target_som_flavour
5487 || obfd->xvec->flavour != bfd_target_som_flavour)
5488 return TRUE;
5489
5490 /* Allocate some memory to hold the data we need. */
5491 obj_som_exec_data (obfd) = bfd_zalloc (obfd, (bfd_size_type) sizeof (struct som_exec_data));
5492 if (obj_som_exec_data (obfd) == NULL)
5493 return FALSE;
5494
5495 /* Now copy the data. */
5496 memcpy (obj_som_exec_data (obfd), obj_som_exec_data (ibfd),
5497 sizeof (struct som_exec_data));
5498
5499 return TRUE;
5500 }
5501
5502 /* Display the SOM header. */
5503
5504 static bfd_boolean
5505 som_bfd_print_private_bfd_data (bfd *abfd, void *farg)
5506 {
5507 struct som_exec_auxhdr *exec_header;
5508 struct som_aux_id* auxhdr;
5509 FILE *f;
5510
5511 f = (FILE *) farg;
5512
5513 exec_header = obj_som_exec_hdr (abfd);
5514 if (exec_header)
5515 {
5516 fprintf (f, _("\nExec Auxiliary Header\n"));
5517 fprintf (f, " flags ");
5518 auxhdr = &exec_header->som_auxhdr;
5519 if (auxhdr->mandatory)
5520 fprintf (f, "mandatory ");
5521 if (auxhdr->copy)
5522 fprintf (f, "copy ");
5523 if (auxhdr->append)
5524 fprintf (f, "append ");
5525 if (auxhdr->ignore)
5526 fprintf (f, "ignore ");
5527 fprintf (f, "\n");
5528 fprintf (f, " type %#x\n", auxhdr->type);
5529 fprintf (f, " length %#x\n", auxhdr->length);
5530
5531 /* Note that, depending on the HP-UX version, the following fields can be
5532 either ints, or longs. */
5533
5534 fprintf (f, " text size %#lx\n", (long) exec_header->exec_tsize);
5535 fprintf (f, " text memory offset %#lx\n", (long) exec_header->exec_tmem);
5536 fprintf (f, " text file offset %#lx\n", (long) exec_header->exec_tfile);
5537 fprintf (f, " data size %#lx\n", (long) exec_header->exec_dsize);
5538 fprintf (f, " data memory offset %#lx\n", (long) exec_header->exec_dmem);
5539 fprintf (f, " data file offset %#lx\n", (long) exec_header->exec_dfile);
5540 fprintf (f, " bss size %#lx\n", (long) exec_header->exec_bsize);
5541 fprintf (f, " entry point %#lx\n", (long) exec_header->exec_entry);
5542 fprintf (f, " loader flags %#lx\n", (long) exec_header->exec_flags);
5543 fprintf (f, " bss initializer %#lx\n", (long) exec_header->exec_bfill);
5544 }
5545
5546 return TRUE;
5547 }
5548
5549 /* Set backend info for sections which can not be described
5550 in the BFD data structures. */
5551
5552 bfd_boolean
5553 bfd_som_set_section_attributes (asection *section,
5554 int defined,
5555 int private,
5556 unsigned int sort_key,
5557 int spnum)
5558 {
5559 /* Allocate memory to hold the magic information. */
5560 if (som_section_data (section)->copy_data == NULL)
5561 {
5562 size_t amt = sizeof (struct som_copyable_section_data_struct);
5563
5564 som_section_data (section)->copy_data = bfd_zalloc (section->owner, amt);
5565 if (som_section_data (section)->copy_data == NULL)
5566 return FALSE;
5567 }
5568 som_section_data (section)->copy_data->sort_key = sort_key;
5569 som_section_data (section)->copy_data->is_defined = defined;
5570 som_section_data (section)->copy_data->is_private = private;
5571 som_section_data (section)->copy_data->container = section;
5572 som_section_data (section)->copy_data->space_number = spnum;
5573 return TRUE;
5574 }
5575
5576 /* Set backend info for subsections which can not be described
5577 in the BFD data structures. */
5578
5579 bfd_boolean
5580 bfd_som_set_subsection_attributes (asection *section,
5581 asection *container,
5582 int access_ctr,
5583 unsigned int sort_key,
5584 int quadrant,
5585 int comdat,
5586 int common,
5587 int dup_common)
5588 {
5589 /* Allocate memory to hold the magic information. */
5590 if (som_section_data (section)->copy_data == NULL)
5591 {
5592 size_t amt = sizeof (struct som_copyable_section_data_struct);
5593
5594 som_section_data (section)->copy_data = bfd_zalloc (section->owner, amt);
5595 if (som_section_data (section)->copy_data == NULL)
5596 return FALSE;
5597 }
5598 som_section_data (section)->copy_data->sort_key = sort_key;
5599 som_section_data (section)->copy_data->access_control_bits = access_ctr;
5600 som_section_data (section)->copy_data->quadrant = quadrant;
5601 som_section_data (section)->copy_data->container = container;
5602 som_section_data (section)->copy_data->is_comdat = comdat;
5603 som_section_data (section)->copy_data->is_common = common;
5604 som_section_data (section)->copy_data->dup_common = dup_common;
5605 return TRUE;
5606 }
5607
5608 /* Set the full SOM symbol type. SOM needs far more symbol information
5609 than any other object file format I'm aware of. It is mandatory
5610 to be able to know if a symbol is an entry point, millicode, data,
5611 code, absolute, storage request, or procedure label. If you get
5612 the symbol type wrong your program will not link. */
5613
5614 void
5615 bfd_som_set_symbol_type (asymbol *symbol, unsigned int type)
5616 {
5617 som_symbol_data (symbol)->som_type = type;
5618 }
5619
5620 /* Attach an auxiliary header to the BFD backend so that it may be
5621 written into the object file. */
5622
5623 bfd_boolean
5624 bfd_som_attach_aux_hdr (bfd *abfd, int type, char *string)
5625 {
5626 size_t amt;
5627
5628 if (type == VERSION_AUX_ID)
5629 {
5630 size_t len = strlen (string);
5631 int pad = 0;
5632
5633 if (len % 4)
5634 pad = (4 - (len % 4));
5635 amt = sizeof (struct som_string_auxhdr) + len + pad;
5636 obj_som_version_hdr (abfd) = bfd_zalloc (abfd, amt);
5637 if (!obj_som_version_hdr (abfd))
5638 return FALSE;
5639 obj_som_version_hdr (abfd)->header_id.type = VERSION_AUX_ID;
5640 obj_som_version_hdr (abfd)->header_id.length = 4 + len + pad;
5641 obj_som_version_hdr (abfd)->string_length = len;
5642 memcpy (obj_som_version_hdr (abfd)->string, string, len);
5643 memset (obj_som_version_hdr (abfd)->string + len, 0, pad);
5644 }
5645 else if (type == COPYRIGHT_AUX_ID)
5646 {
5647 size_t len = strlen (string);
5648 int pad = 0;
5649
5650 if (len % 4)
5651 pad = (4 - (len % 4));
5652 amt = sizeof (struct som_string_auxhdr) + len + pad;
5653 obj_som_copyright_hdr (abfd) = bfd_zalloc (abfd, amt);
5654 if (!obj_som_copyright_hdr (abfd))
5655 return FALSE;
5656 obj_som_copyright_hdr (abfd)->header_id.type = COPYRIGHT_AUX_ID;
5657 obj_som_copyright_hdr (abfd)->header_id.length = len + pad + 4;
5658 obj_som_copyright_hdr (abfd)->string_length = len;
5659 memcpy (obj_som_copyright_hdr (abfd)->string, string, len);
5660 memset (obj_som_copyright_hdr (abfd)->string + len, 0, pad);
5661 }
5662 return TRUE;
5663 }
5664
5665 /* Attach a compilation unit header to the BFD backend so that it may be
5666 written into the object file. */
5667
5668 bfd_boolean
5669 bfd_som_attach_compilation_unit (bfd *abfd,
5670 const char *name,
5671 const char *language_name,
5672 const char *product_id,
5673 const char *version_id)
5674 {
5675 struct som_compilation_unit *n;
5676
5677 n = (struct som_compilation_unit *) bfd_zalloc
5678 (abfd, (bfd_size_type) sizeof (*n));
5679 if (n == NULL)
5680 return FALSE;
5681
5682 #define STRDUP(f) \
5683 if (f != NULL) \
5684 { \
5685 n->f.name = bfd_alloc (abfd, (bfd_size_type) strlen (f) + 1); \
5686 if (n->f.name == NULL) \
5687 return FALSE; \
5688 strcpy (n->f.name, f); \
5689 }
5690
5691 STRDUP (name);
5692 STRDUP (language_name);
5693 STRDUP (product_id);
5694 STRDUP (version_id);
5695
5696 #undef STRDUP
5697
5698 obj_som_compilation_unit (abfd) = n;
5699
5700 return TRUE;
5701 }
5702
5703 static bfd_boolean
5704 som_get_section_contents (bfd *abfd,
5705 sec_ptr section,
5706 void *location,
5707 file_ptr offset,
5708 bfd_size_type count)
5709 {
5710 if (count == 0 || ((section->flags & SEC_HAS_CONTENTS) == 0))
5711 return TRUE;
5712 if ((bfd_size_type) (offset+count) > section->size
5713 || bfd_seek (abfd, (file_ptr) (section->filepos + offset), SEEK_SET) != 0
5714 || bfd_bread (location, count, abfd) != count)
5715 return FALSE; /* On error. */
5716 return TRUE;
5717 }
5718
5719 static bfd_boolean
5720 som_set_section_contents (bfd *abfd,
5721 sec_ptr section,
5722 const void *location,
5723 file_ptr offset,
5724 bfd_size_type count)
5725 {
5726 if (! abfd->output_has_begun)
5727 {
5728 /* Set up fixed parts of the file, space, and subspace headers.
5729 Notify the world that output has begun. */
5730 som_prep_headers (abfd);
5731 abfd->output_has_begun = TRUE;
5732 /* Start writing the object file. This include all the string
5733 tables, fixup streams, and other portions of the object file. */
5734 som_begin_writing (abfd);
5735 }
5736
5737 /* Only write subspaces which have "real" contents (eg. the contents
5738 are not generated at run time by the OS). */
5739 if (!som_is_subspace (section)
5740 || ((section->flags & SEC_HAS_CONTENTS) == 0))
5741 return TRUE;
5742
5743 /* Seek to the proper offset within the object file and write the
5744 data. */
5745 offset += som_section_data (section)->subspace_dict->file_loc_init_value;
5746 if (bfd_seek (abfd, offset, SEEK_SET) != 0)
5747 return FALSE;
5748
5749 if (bfd_bwrite (location, count, abfd) != count)
5750 return FALSE;
5751 return TRUE;
5752 }
5753
5754 static bfd_boolean
5755 som_set_arch_mach (bfd *abfd,
5756 enum bfd_architecture arch,
5757 unsigned long machine)
5758 {
5759 /* Allow any architecture to be supported by the SOM backend. */
5760 return bfd_default_set_arch_mach (abfd, arch, machine);
5761 }
5762
5763 static bfd_boolean
5764 som_find_nearest_line (bfd *abfd,
5765 asymbol **symbols,
5766 asection *section,
5767 bfd_vma offset,
5768 const char **filename_ptr,
5769 const char **functionname_ptr,
5770 unsigned int *line_ptr,
5771 unsigned int *discriminator_ptr)
5772 {
5773 bfd_boolean found;
5774 asymbol *func;
5775 bfd_vma low_func;
5776 asymbol **p;
5777
5778 if (discriminator_ptr)
5779 *discriminator_ptr = 0;
5780
5781 if (! _bfd_stab_section_find_nearest_line (abfd, symbols, section, offset,
5782 & found, filename_ptr,
5783 functionname_ptr, line_ptr,
5784 & somdata (abfd).line_info))
5785 return FALSE;
5786
5787 if (found)
5788 return TRUE;
5789
5790 if (symbols == NULL)
5791 return FALSE;
5792
5793 /* Fallback: find function name from symbols table. */
5794 func = NULL;
5795 low_func = 0;
5796
5797 for (p = symbols; *p != NULL; p++)
5798 {
5799 som_symbol_type *q = (som_symbol_type *) *p;
5800
5801 if (q->som_type == SYMBOL_TYPE_ENTRY
5802 && q->symbol.section == section
5803 && q->symbol.value >= low_func
5804 && q->symbol.value <= offset)
5805 {
5806 func = (asymbol *) q;
5807 low_func = q->symbol.value;
5808 }
5809 }
5810
5811 if (func == NULL)
5812 return FALSE;
5813
5814 *filename_ptr = NULL;
5815 *functionname_ptr = bfd_asymbol_name (func);
5816 *line_ptr = 0;
5817
5818 return TRUE;
5819 }
5820
5821 static int
5822 som_sizeof_headers (bfd *abfd ATTRIBUTE_UNUSED,
5823 struct bfd_link_info *info ATTRIBUTE_UNUSED)
5824 {
5825 _bfd_error_handler (_("som_sizeof_headers unimplemented"));
5826 abort ();
5827 return 0;
5828 }
5829
5830 /* Return the single-character symbol type corresponding to
5831 SOM section S, or '?' for an unknown SOM section. */
5832
5833 static char
5834 som_section_type (const char *s)
5835 {
5836 const struct section_to_type *t;
5837
5838 for (t = &stt[0]; t->section; t++)
5839 if (!strcmp (s, t->section))
5840 return t->type;
5841 return '?';
5842 }
5843
5844 static int
5845 som_decode_symclass (asymbol *symbol)
5846 {
5847 char c;
5848
5849 if (bfd_is_com_section (symbol->section))
5850 return 'C';
5851 if (bfd_is_und_section (symbol->section))
5852 {
5853 if (symbol->flags & BSF_WEAK)
5854 {
5855 /* If weak, determine if it's specifically an object
5856 or non-object weak. */
5857 if (symbol->flags & BSF_OBJECT)
5858 return 'v';
5859 else
5860 return 'w';
5861 }
5862 else
5863 return 'U';
5864 }
5865 if (bfd_is_ind_section (symbol->section))
5866 return 'I';
5867 if (symbol->flags & BSF_WEAK)
5868 {
5869 /* If weak, determine if it's specifically an object
5870 or non-object weak. */
5871 if (symbol->flags & BSF_OBJECT)
5872 return 'V';
5873 else
5874 return 'W';
5875 }
5876 if (!(symbol->flags & (BSF_GLOBAL | BSF_LOCAL)))
5877 return '?';
5878
5879 if (bfd_is_abs_section (symbol->section)
5880 || (som_symbol_data (symbol) != NULL
5881 && som_symbol_data (symbol)->som_type == SYMBOL_TYPE_ABSOLUTE))
5882 c = 'a';
5883 else if (symbol->section)
5884 c = som_section_type (symbol->section->name);
5885 else
5886 return '?';
5887 if (symbol->flags & BSF_GLOBAL)
5888 c = TOUPPER (c);
5889 return c;
5890 }
5891
5892 /* Return information about SOM symbol SYMBOL in RET. */
5893
5894 static void
5895 som_get_symbol_info (bfd *ignore_abfd ATTRIBUTE_UNUSED,
5896 asymbol *symbol,
5897 symbol_info *ret)
5898 {
5899 ret->type = som_decode_symclass (symbol);
5900 if (ret->type != 'U')
5901 ret->value = symbol->value + symbol->section->vma;
5902 else
5903 ret->value = 0;
5904 ret->name = symbol->name;
5905 }
5906
5907 /* Count the number of symbols in the archive symbol table. Necessary
5908 so that we can allocate space for all the carsyms at once. */
5909
5910 static bfd_boolean
5911 som_bfd_count_ar_symbols (bfd *abfd,
5912 struct som_lst_header *lst_header,
5913 symindex *count)
5914 {
5915 unsigned int i;
5916 unsigned char *hash_table;
5917 size_t amt;
5918 file_ptr lst_filepos;
5919
5920 lst_filepos = bfd_tell (abfd) - sizeof (struct som_external_lst_header);
5921
5922 if (_bfd_mul_overflow (lst_header->hash_size, 4, &amt))
5923 {
5924 bfd_set_error (bfd_error_file_too_big);
5925 return FALSE;
5926 }
5927 hash_table = bfd_malloc (amt);
5928 if (hash_table == NULL && lst_header->hash_size != 0)
5929 goto error_return;
5930
5931 /* Don't forget to initialize the counter! */
5932 *count = 0;
5933
5934 /* Read in the hash table. The hash table is an array of 32-bit
5935 file offsets which point to the hash chains. */
5936 if (bfd_bread ((void *) hash_table, amt, abfd) != amt)
5937 goto error_return;
5938
5939 /* Walk each chain counting the number of symbols found on that particular
5940 chain. */
5941 for (i = 0; i < lst_header->hash_size; i++)
5942 {
5943 struct som_external_lst_symbol_record ext_lst_symbol;
5944 unsigned int hash_val = bfd_getb32 (hash_table + 4 * i);
5945
5946 /* An empty chain has zero as it's file offset. */
5947 if (hash_val == 0)
5948 continue;
5949
5950 /* Seek to the first symbol in this hash chain. */
5951 if (bfd_seek (abfd, lst_filepos + hash_val, SEEK_SET) != 0)
5952 goto error_return;
5953
5954 /* Read in this symbol and update the counter. */
5955 amt = sizeof (ext_lst_symbol);
5956 if (bfd_bread ((void *) &ext_lst_symbol, amt, abfd) != amt)
5957 goto error_return;
5958
5959 (*count)++;
5960
5961 /* Now iterate through the rest of the symbols on this chain. */
5962 while (1)
5963 {
5964 unsigned int next_entry = bfd_getb32 (ext_lst_symbol.next_entry);
5965
5966 if (next_entry == 0)
5967 break;
5968
5969 /* Assume symbols on a chain are in increasing file offset
5970 order. Otherwise we can loop here with fuzzed input. */
5971 if (next_entry < hash_val + sizeof (ext_lst_symbol))
5972 {
5973 bfd_set_error (bfd_error_bad_value);
5974 goto error_return;
5975 }
5976 hash_val = next_entry;
5977
5978 /* Seek to the next symbol. */
5979 if (bfd_seek (abfd, lst_filepos + next_entry, SEEK_SET) != 0)
5980 goto error_return;
5981
5982 /* Read the symbol in and update the counter. */
5983 amt = sizeof (ext_lst_symbol);
5984 if (bfd_bread ((void *) &ext_lst_symbol, amt, abfd) != amt)
5985 goto error_return;
5986
5987 (*count)++;
5988 }
5989 }
5990 if (hash_table != NULL)
5991 free (hash_table);
5992 return TRUE;
5993
5994 error_return:
5995 if (hash_table != NULL)
5996 free (hash_table);
5997 return FALSE;
5998 }
5999
6000 /* Fill in the canonical archive symbols (SYMS) from the archive described
6001 by ABFD and LST_HEADER. */
6002
6003 static bfd_boolean
6004 som_bfd_fill_in_ar_symbols (bfd *abfd,
6005 struct som_lst_header *lst_header,
6006 carsym **syms)
6007 {
6008 unsigned int i;
6009 carsym *set = syms[0];
6010 unsigned char *hash_table;
6011 struct som_external_som_entry *som_dict = NULL;
6012 size_t amt;
6013 file_ptr lst_filepos;
6014 unsigned int string_loc;
6015
6016 lst_filepos = bfd_tell (abfd) - sizeof (struct som_external_lst_header);
6017 if (_bfd_mul_overflow (lst_header->hash_size, 4, &amt))
6018 {
6019 bfd_set_error (bfd_error_file_too_big);
6020 return FALSE;
6021 }
6022 hash_table = bfd_malloc (amt);
6023 if (hash_table == NULL && lst_header->hash_size != 0)
6024 goto error_return;
6025
6026 /* Read in the hash table. The has table is an array of 32bit file offsets
6027 which point to the hash chains. */
6028 if (bfd_bread ((void *) hash_table, amt, abfd) != amt)
6029 goto error_return;
6030
6031 /* Seek to and read in the SOM dictionary. We will need this to fill
6032 in the carsym's filepos field. */
6033 if (bfd_seek (abfd, lst_filepos + lst_header->dir_loc, SEEK_SET) != 0)
6034 goto error_return;
6035
6036 if (_bfd_mul_overflow (lst_header->module_count,
6037 sizeof (struct som_external_som_entry), &amt))
6038 {
6039 bfd_set_error (bfd_error_file_too_big);
6040 goto error_return;
6041 }
6042 som_dict = bfd_malloc (amt);
6043 if (som_dict == NULL && lst_header->module_count != 0)
6044 goto error_return;
6045
6046 if (bfd_bread ((void *) som_dict, amt, abfd) != amt)
6047 goto error_return;
6048
6049 string_loc = lst_header->string_loc;
6050
6051 /* Walk each chain filling in the carsyms as we go along. */
6052 for (i = 0; i < lst_header->hash_size; i++)
6053 {
6054 struct som_external_lst_symbol_record lst_symbol;
6055 unsigned int hash_val;
6056 size_t len;
6057 unsigned char ext_len[4];
6058 char *name;
6059 unsigned int ndx;
6060
6061 /* An empty chain has zero as it's file offset. */
6062 hash_val = bfd_getb32 (hash_table + 4 * i);
6063 if (hash_val == 0)
6064 continue;
6065
6066 /* Seek to and read the first symbol on the chain. */
6067 if (bfd_seek (abfd, lst_filepos + hash_val, SEEK_SET) != 0)
6068 goto error_return;
6069
6070 amt = sizeof (lst_symbol);
6071 if (bfd_bread ((void *) &lst_symbol, amt, abfd) != amt)
6072 goto error_return;
6073
6074 /* Get the name of the symbol, first get the length which is stored
6075 as a 32bit integer just before the symbol.
6076
6077 One might ask why we don't just read in the entire string table
6078 and index into it. Well, according to the SOM ABI the string
6079 index can point *anywhere* in the archive to save space, so just
6080 using the string table would not be safe. */
6081 if (bfd_seek (abfd, (lst_filepos + string_loc
6082 + bfd_getb32 (lst_symbol.name) - 4), SEEK_SET) != 0)
6083 goto error_return;
6084
6085 if (bfd_bread (&ext_len, (bfd_size_type) 4, abfd) != 4)
6086 goto error_return;
6087 len = bfd_getb32 (ext_len);
6088
6089 /* Allocate space for the name and null terminate it too. */
6090 if (len == (size_t) -1)
6091 {
6092 bfd_set_error (bfd_error_no_memory);
6093 goto error_return;
6094 }
6095 name = bfd_zalloc (abfd, (bfd_size_type) len + 1);
6096 if (!name)
6097 goto error_return;
6098 if (bfd_bread (name, (bfd_size_type) len, abfd) != len)
6099 goto error_return;
6100
6101 name[len] = 0;
6102 set->name = name;
6103
6104 /* Fill in the file offset. Note that the "location" field points
6105 to the SOM itself, not the ar_hdr in front of it. */
6106 ndx = bfd_getb32 (lst_symbol.som_index);
6107 if (ndx >= lst_header->module_count)
6108 {
6109 bfd_set_error (bfd_error_bad_value);
6110 goto error_return;
6111 }
6112 set->file_offset
6113 = bfd_getb32 (som_dict[ndx].location) - sizeof (struct ar_hdr);
6114
6115 /* Go to the next symbol. */
6116 set++;
6117
6118 /* Iterate through the rest of the chain. */
6119 while (1)
6120 {
6121 unsigned int next_entry = bfd_getb32 (lst_symbol.next_entry);
6122
6123 if (next_entry == 0)
6124 break;
6125
6126 /* Seek to the next symbol and read it in. */
6127 if (bfd_seek (abfd, lst_filepos + next_entry, SEEK_SET) != 0)
6128 goto error_return;
6129
6130 amt = sizeof (lst_symbol);
6131 if (bfd_bread ((void *) &lst_symbol, amt, abfd) != amt)
6132 goto error_return;
6133
6134 /* Seek to the name length & string and read them in. */
6135 if (bfd_seek (abfd, lst_filepos + string_loc
6136 + bfd_getb32 (lst_symbol.name) - 4, SEEK_SET) != 0)
6137 goto error_return;
6138
6139 if (bfd_bread (&ext_len, (bfd_size_type) 4, abfd) != 4)
6140 goto error_return;
6141 len = bfd_getb32 (ext_len);
6142
6143 /* Allocate space for the name and null terminate it too. */
6144 if (len == (size_t) -1)
6145 {
6146 bfd_set_error (bfd_error_no_memory);
6147 goto error_return;
6148 }
6149 name = bfd_zalloc (abfd, (bfd_size_type) len + 1);
6150 if (!name)
6151 goto error_return;
6152
6153 if (bfd_bread (name, (bfd_size_type) len, abfd) != len)
6154 goto error_return;
6155 name[len] = 0;
6156 set->name = name;
6157
6158 /* Fill in the file offset. Note that the "location" field points
6159 to the SOM itself, not the ar_hdr in front of it. */
6160 ndx = bfd_getb32 (lst_symbol.som_index);
6161 if (ndx >= lst_header->module_count)
6162 {
6163 bfd_set_error (bfd_error_bad_value);
6164 goto error_return;
6165 }
6166 set->file_offset
6167 = bfd_getb32 (som_dict[ndx].location) - sizeof (struct ar_hdr);
6168
6169 /* Go on to the next symbol. */
6170 set++;
6171 }
6172 }
6173 /* If we haven't died by now, then we successfully read the entire
6174 archive symbol table. */
6175 if (hash_table != NULL)
6176 free (hash_table);
6177 if (som_dict != NULL)
6178 free (som_dict);
6179 return TRUE;
6180
6181 error_return:
6182 if (hash_table != NULL)
6183 free (hash_table);
6184 if (som_dict != NULL)
6185 free (som_dict);
6186 return FALSE;
6187 }
6188
6189 /* Read in the LST from the archive. */
6190
6191 static bfd_boolean
6192 som_slurp_armap (bfd *abfd)
6193 {
6194 struct som_external_lst_header ext_lst_header;
6195 struct som_lst_header lst_header;
6196 struct ar_hdr ar_header;
6197 unsigned int parsed_size;
6198 struct artdata *ardata = bfd_ardata (abfd);
6199 char nextname[17];
6200 size_t amt = 16;
6201 int i = bfd_bread ((void *) nextname, amt, abfd);
6202
6203 /* Special cases. */
6204 if (i == 0)
6205 return TRUE;
6206 if (i != 16)
6207 return FALSE;
6208
6209 if (bfd_seek (abfd, (file_ptr) -16, SEEK_CUR) != 0)
6210 return FALSE;
6211
6212 /* For archives without .o files there is no symbol table. */
6213 if (! CONST_STRNEQ (nextname, "/ "))
6214 {
6215 abfd->has_armap = FALSE;
6216 return TRUE;
6217 }
6218
6219 /* Read in and sanity check the archive header. */
6220 amt = sizeof (struct ar_hdr);
6221 if (bfd_bread ((void *) &ar_header, amt, abfd) != amt)
6222 return FALSE;
6223
6224 if (strncmp (ar_header.ar_fmag, ARFMAG, 2))
6225 {
6226 bfd_set_error (bfd_error_malformed_archive);
6227 return FALSE;
6228 }
6229
6230 /* How big is the archive symbol table entry? */
6231 errno = 0;
6232 parsed_size = strtol (ar_header.ar_size, NULL, 10);
6233 if (errno != 0)
6234 {
6235 bfd_set_error (bfd_error_malformed_archive);
6236 return FALSE;
6237 }
6238
6239 /* Save off the file offset of the first real user data. */
6240 ardata->first_file_filepos = bfd_tell (abfd) + parsed_size;
6241
6242 /* Read in the library symbol table. We'll make heavy use of this
6243 in just a minute. */
6244 amt = sizeof (struct som_external_lst_header);
6245 if (bfd_bread ((void *) &ext_lst_header, amt, abfd) != amt)
6246 return FALSE;
6247
6248 som_swap_lst_header_in (&ext_lst_header, &lst_header);
6249
6250 /* Sanity check. */
6251 if (lst_header.a_magic != LIBMAGIC)
6252 {
6253 bfd_set_error (bfd_error_malformed_archive);
6254 return FALSE;
6255 }
6256
6257 /* Count the number of symbols in the library symbol table. */
6258 if (! som_bfd_count_ar_symbols (abfd, &lst_header, &ardata->symdef_count))
6259 return FALSE;
6260
6261 /* Get back to the start of the library symbol table. */
6262 if (bfd_seek (abfd, (ardata->first_file_filepos - parsed_size
6263 + sizeof (struct som_external_lst_header)),
6264 SEEK_SET) != 0)
6265 return FALSE;
6266
6267 /* Initialize the cache and allocate space for the library symbols. */
6268 ardata->cache = 0;
6269 if (_bfd_mul_overflow (ardata->symdef_count, sizeof (carsym), &amt))
6270 {
6271 bfd_set_error (bfd_error_file_too_big);
6272 return FALSE;
6273 }
6274 ardata->symdefs = bfd_alloc (abfd, amt);
6275 if (!ardata->symdefs)
6276 return FALSE;
6277
6278 /* Now fill in the canonical archive symbols. */
6279 if (! som_bfd_fill_in_ar_symbols (abfd, &lst_header, &ardata->symdefs))
6280 return FALSE;
6281
6282 /* Seek back to the "first" file in the archive. Note the "first"
6283 file may be the extended name table. */
6284 if (bfd_seek (abfd, ardata->first_file_filepos, SEEK_SET) != 0)
6285 return FALSE;
6286
6287 /* Notify the generic archive code that we have a symbol map. */
6288 abfd->has_armap = TRUE;
6289 return TRUE;
6290 }
6291
6292 /* Begin preparing to write a SOM library symbol table.
6293
6294 As part of the prep work we need to determine the number of symbols
6295 and the size of the associated string section. */
6296
6297 static bfd_boolean
6298 som_bfd_prep_for_ar_write (bfd *abfd,
6299 unsigned int *num_syms,
6300 unsigned int *stringsize)
6301 {
6302 bfd *curr_bfd = abfd->archive_head;
6303
6304 /* Some initialization. */
6305 *num_syms = 0;
6306 *stringsize = 0;
6307
6308 /* Iterate over each BFD within this archive. */
6309 while (curr_bfd != NULL)
6310 {
6311 unsigned int curr_count, i;
6312 som_symbol_type *sym;
6313
6314 /* Don't bother for non-SOM objects. */
6315 if (curr_bfd->format != bfd_object
6316 || curr_bfd->xvec->flavour != bfd_target_som_flavour)
6317 {
6318 curr_bfd = curr_bfd->archive_next;
6319 continue;
6320 }
6321
6322 /* Make sure the symbol table has been read, then snag a pointer
6323 to it. It's a little slimey to grab the symbols via obj_som_symtab,
6324 but doing so avoids allocating lots of extra memory. */
6325 if (! som_slurp_symbol_table (curr_bfd))
6326 return FALSE;
6327
6328 sym = obj_som_symtab (curr_bfd);
6329 curr_count = bfd_get_symcount (curr_bfd);
6330
6331 /* Examine each symbol to determine if it belongs in the
6332 library symbol table. */
6333 for (i = 0; i < curr_count; i++, sym++)
6334 {
6335 struct som_misc_symbol_info info;
6336
6337 /* Derive SOM information from the BFD symbol. */
6338 som_bfd_derive_misc_symbol_info (curr_bfd, &sym->symbol, &info);
6339
6340 /* Should we include this symbol? */
6341 if (info.symbol_type == ST_NULL
6342 || info.symbol_type == ST_SYM_EXT
6343 || info.symbol_type == ST_ARG_EXT)
6344 continue;
6345
6346 /* Only global symbols and unsatisfied commons. */
6347 if (info.symbol_scope != SS_UNIVERSAL
6348 && info.symbol_type != ST_STORAGE)
6349 continue;
6350
6351 /* Do no include undefined symbols. */
6352 if (bfd_is_und_section (sym->symbol.section))
6353 continue;
6354
6355 /* Bump the various counters, being careful to honor
6356 alignment considerations in the string table. */
6357 (*num_syms)++;
6358 *stringsize += strlen (sym->symbol.name) + 5;
6359 while (*stringsize % 4)
6360 (*stringsize)++;
6361 }
6362
6363 curr_bfd = curr_bfd->archive_next;
6364 }
6365 return TRUE;
6366 }
6367
6368 /* Hash a symbol name based on the hashing algorithm presented in the
6369 SOM ABI. */
6370
6371 static unsigned int
6372 som_bfd_ar_symbol_hash (asymbol *symbol)
6373 {
6374 unsigned int len = strlen (symbol->name);
6375
6376 /* Names with length 1 are special. */
6377 if (len == 1)
6378 return 0x1000100 | (symbol->name[0] << 16) | symbol->name[0];
6379
6380 return ((len & 0x7f) << 24) | (symbol->name[1] << 16)
6381 | (symbol->name[len - 2] << 8) | symbol->name[len - 1];
6382 }
6383
6384 /* Do the bulk of the work required to write the SOM library
6385 symbol table. */
6386
6387 static bfd_boolean
6388 som_bfd_ar_write_symbol_stuff (bfd *abfd,
6389 unsigned int nsyms,
6390 unsigned int string_size,
6391 struct som_external_lst_header lst,
6392 unsigned elength)
6393 {
6394 char *strings = NULL, *p;
6395 struct som_external_lst_symbol_record *lst_syms = NULL, *curr_lst_sym;
6396 bfd *curr_bfd;
6397 unsigned char *hash_table = NULL;
6398 struct som_external_som_entry *som_dict = NULL;
6399 struct som_external_lst_symbol_record **last_hash_entry = NULL;
6400 unsigned int curr_som_offset, som_index = 0;
6401 size_t amt;
6402 unsigned int module_count;
6403 unsigned int hash_size;
6404
6405 hash_size = bfd_getb32 (lst.hash_size);
6406 if (_bfd_mul_overflow (hash_size, 4, &amt))
6407 {
6408 bfd_set_error (bfd_error_no_memory);
6409 return FALSE;
6410 }
6411 hash_table = bfd_zmalloc (amt);
6412 if (hash_table == NULL && hash_size != 0)
6413 goto error_return;
6414
6415 module_count = bfd_getb32 (lst.module_count);
6416 if (_bfd_mul_overflow (module_count,
6417 sizeof (struct som_external_som_entry), &amt))
6418 {
6419 bfd_set_error (bfd_error_no_memory);
6420 goto error_return;
6421 }
6422 som_dict = bfd_zmalloc (amt);
6423 if (som_dict == NULL && module_count != 0)
6424 goto error_return;
6425
6426 if (_bfd_mul_overflow (hash_size,
6427 sizeof (struct som_external_lst_symbol_record *),
6428 &amt))
6429 {
6430 bfd_set_error (bfd_error_no_memory);
6431 goto error_return;
6432 }
6433 last_hash_entry = bfd_zmalloc (amt);
6434 if (last_hash_entry == NULL && hash_size != 0)
6435 goto error_return;
6436
6437 /* Symbols have som_index fields, so we have to keep track of the
6438 index of each SOM in the archive.
6439
6440 The SOM dictionary has (among other things) the absolute file
6441 position for the SOM which a particular dictionary entry
6442 describes. We have to compute that information as we iterate
6443 through the SOMs/symbols. */
6444 som_index = 0;
6445
6446 /* We add in the size of the archive header twice as the location
6447 in the SOM dictionary is the actual offset of the SOM, not the
6448 archive header before the SOM. */
6449 curr_som_offset = 8 + 2 * sizeof (struct ar_hdr) + bfd_getb32 (lst.file_end);
6450
6451 /* Make room for the archive header and the contents of the
6452 extended string table. Note that elength includes the size
6453 of the archive header for the extended name table! */
6454 if (elength)
6455 curr_som_offset += elength;
6456
6457 /* Make sure we're properly aligned. */
6458 curr_som_offset = (curr_som_offset + 0x1) & ~0x1;
6459
6460 /* FIXME should be done with buffers just like everything else... */
6461 if (_bfd_mul_overflow (nsyms,
6462 sizeof (struct som_external_lst_symbol_record), &amt))
6463 {
6464 bfd_set_error (bfd_error_no_memory);
6465 goto error_return;
6466 }
6467 lst_syms = bfd_malloc (amt);
6468 if (lst_syms == NULL && nsyms != 0)
6469 goto error_return;
6470 strings = bfd_malloc (string_size);
6471 if (strings == NULL && string_size != 0)
6472 goto error_return;
6473
6474 p = strings;
6475 curr_lst_sym = lst_syms;
6476
6477 curr_bfd = abfd->archive_head;
6478 while (curr_bfd != NULL)
6479 {
6480 unsigned int curr_count, i;
6481 som_symbol_type *sym;
6482
6483 /* Don't bother for non-SOM objects. */
6484 if (curr_bfd->format != bfd_object
6485 || curr_bfd->xvec->flavour != bfd_target_som_flavour)
6486 {
6487 curr_bfd = curr_bfd->archive_next;
6488 continue;
6489 }
6490
6491 /* Make sure the symbol table has been read, then snag a pointer
6492 to it. It's a little slimey to grab the symbols via obj_som_symtab,
6493 but doing so avoids allocating lots of extra memory. */
6494 if (! som_slurp_symbol_table (curr_bfd))
6495 goto error_return;
6496
6497 sym = obj_som_symtab (curr_bfd);
6498 curr_count = bfd_get_symcount (curr_bfd);
6499
6500 for (i = 0; i < curr_count; i++, sym++)
6501 {
6502 struct som_misc_symbol_info info;
6503 struct som_external_lst_symbol_record *last;
6504 unsigned int symbol_pos;
6505 unsigned int slen;
6506 unsigned int symbol_key;
6507 unsigned int flags;
6508
6509 /* Derive SOM information from the BFD symbol. */
6510 som_bfd_derive_misc_symbol_info (curr_bfd, &sym->symbol, &info);
6511
6512 /* Should we include this symbol? */
6513 if (info.symbol_type == ST_NULL
6514 || info.symbol_type == ST_SYM_EXT
6515 || info.symbol_type == ST_ARG_EXT)
6516 continue;
6517
6518 /* Only global symbols and unsatisfied commons. */
6519 if (info.symbol_scope != SS_UNIVERSAL
6520 && info.symbol_type != ST_STORAGE)
6521 continue;
6522
6523 /* Do no include undefined symbols. */
6524 if (bfd_is_und_section (sym->symbol.section))
6525 continue;
6526
6527 /* If this is the first symbol from this SOM, then update
6528 the SOM dictionary too. */
6529 if (bfd_getb32 (som_dict[som_index].location) == 0)
6530 {
6531 bfd_putb32 (curr_som_offset, som_dict[som_index].location);
6532 bfd_putb32 (arelt_size (curr_bfd), som_dict[som_index].length);
6533 }
6534
6535 symbol_key = som_bfd_ar_symbol_hash (&sym->symbol);
6536
6537 /* Fill in the lst symbol record. */
6538 flags = 0;
6539 if (info.secondary_def)
6540 flags |= LST_SYMBOL_SECONDARY_DEF;
6541 flags |= info.symbol_type << LST_SYMBOL_SYMBOL_TYPE_SH;
6542 flags |= info.symbol_scope << LST_SYMBOL_SYMBOL_SCOPE_SH;
6543 if (bfd_is_com_section (sym->symbol.section))
6544 flags |= LST_SYMBOL_IS_COMMON;
6545 if (info.dup_common)
6546 flags |= LST_SYMBOL_DUP_COMMON;
6547 flags |= 3 << LST_SYMBOL_XLEAST_SH;
6548 flags |= info.arg_reloc << LST_SYMBOL_ARG_RELOC_SH;
6549 bfd_putb32 (flags, curr_lst_sym->flags);
6550 bfd_putb32 (p - strings + 4, curr_lst_sym->name);
6551 bfd_putb32 (0, curr_lst_sym->qualifier_name);
6552 bfd_putb32 (info.symbol_info, curr_lst_sym->symbol_info);
6553 bfd_putb32 (info.symbol_value | info.priv_level,
6554 curr_lst_sym->symbol_value);
6555 bfd_putb32 (0, curr_lst_sym->symbol_descriptor);
6556 curr_lst_sym->reserved = 0;
6557 bfd_putb32 (som_index, curr_lst_sym->som_index);
6558 bfd_putb32 (symbol_key, curr_lst_sym->symbol_key);
6559 bfd_putb32 (0, curr_lst_sym->next_entry);
6560
6561 /* Insert into the hash table. */
6562 symbol_pos =
6563 (curr_lst_sym - lst_syms)
6564 * sizeof (struct som_external_lst_symbol_record)
6565 + hash_size * 4
6566 + module_count * sizeof (struct som_external_som_entry)
6567 + sizeof (struct som_external_lst_header);
6568 last = last_hash_entry[symbol_key % hash_size];
6569 if (last != NULL)
6570 {
6571 /* There is already something at the head of this hash chain,
6572 so tack this symbol onto the end of the chain. */
6573 bfd_putb32 (symbol_pos, last->next_entry);
6574 }
6575 else
6576 /* First entry in this hash chain. */
6577 bfd_putb32 (symbol_pos, hash_table + 4 * (symbol_key % hash_size));
6578
6579 /* Keep track of the last symbol we added to this chain so we can
6580 easily update its next_entry pointer. */
6581 last_hash_entry[symbol_key % hash_size] = curr_lst_sym;
6582
6583 /* Update the string table. */
6584 slen = strlen (sym->symbol.name);
6585 bfd_put_32 (abfd, slen, p);
6586 p += 4;
6587 slen++; /* Nul terminator. */
6588 memcpy (p, sym->symbol.name, slen);
6589 p += slen;
6590 while (slen % 4)
6591 {
6592 bfd_put_8 (abfd, 0, p);
6593 p++;
6594 slen++;
6595 }
6596 BFD_ASSERT (p <= strings + string_size);
6597
6598 /* Head to the next symbol. */
6599 curr_lst_sym++;
6600 }
6601
6602 /* Keep track of where each SOM will finally reside; then look
6603 at the next BFD. */
6604 curr_som_offset += arelt_size (curr_bfd) + sizeof (struct ar_hdr);
6605
6606 /* A particular object in the archive may have an odd length; the
6607 linker requires objects begin on an even boundary. So round
6608 up the current offset as necessary. */
6609 curr_som_offset = (curr_som_offset + 0x1) &~ (unsigned) 1;
6610 curr_bfd = curr_bfd->archive_next;
6611 som_index++;
6612 }
6613
6614 /* Now scribble out the hash table. */
6615 amt = (size_t) hash_size * 4;
6616 if (bfd_bwrite ((void *) hash_table, amt, abfd) != amt)
6617 goto error_return;
6618
6619 /* Then the SOM dictionary. */
6620 amt = (size_t) module_count * sizeof (struct som_external_som_entry);
6621 if (bfd_bwrite ((void *) som_dict, amt, abfd) != amt)
6622 goto error_return;
6623
6624 /* The library symbols. */
6625 amt = (size_t) nsyms * sizeof (struct som_external_lst_symbol_record);
6626 if (bfd_bwrite ((void *) lst_syms, amt, abfd) != amt)
6627 goto error_return;
6628
6629 /* And finally the strings. */
6630 amt = string_size;
6631 if (bfd_bwrite ((void *) strings, amt, abfd) != amt)
6632 goto error_return;
6633
6634 if (hash_table != NULL)
6635 free (hash_table);
6636 if (som_dict != NULL)
6637 free (som_dict);
6638 if (last_hash_entry != NULL)
6639 free (last_hash_entry);
6640 if (lst_syms != NULL)
6641 free (lst_syms);
6642 if (strings != NULL)
6643 free (strings);
6644 return TRUE;
6645
6646 error_return:
6647 if (hash_table != NULL)
6648 free (hash_table);
6649 if (som_dict != NULL)
6650 free (som_dict);
6651 if (last_hash_entry != NULL)
6652 free (last_hash_entry);
6653 if (lst_syms != NULL)
6654 free (lst_syms);
6655 if (strings != NULL)
6656 free (strings);
6657
6658 return FALSE;
6659 }
6660
6661 /* Write out the LST for the archive.
6662
6663 You'll never believe this is really how armaps are handled in SOM... */
6664
6665 static bfd_boolean
6666 som_write_armap (bfd *abfd,
6667 unsigned int elength,
6668 struct orl *map ATTRIBUTE_UNUSED,
6669 unsigned int orl_count ATTRIBUTE_UNUSED,
6670 int stridx ATTRIBUTE_UNUSED)
6671 {
6672 bfd *curr_bfd;
6673 struct stat statbuf;
6674 unsigned int i, lst_size, nsyms, stringsize;
6675 struct ar_hdr hdr;
6676 struct som_external_lst_header lst;
6677 unsigned char *p;
6678 size_t amt;
6679 unsigned int csum;
6680 unsigned int module_count;
6681
6682 /* We'll use this for the archive's date and mode later. */
6683 if (stat (abfd->filename, &statbuf) != 0)
6684 {
6685 bfd_set_error (bfd_error_system_call);
6686 return FALSE;
6687 }
6688 /* Fudge factor. */
6689 bfd_ardata (abfd)->armap_timestamp = statbuf.st_mtime + 60;
6690
6691 /* Account for the lst header first. */
6692 lst_size = sizeof (struct som_external_lst_header);
6693
6694 /* Start building the LST header. */
6695 /* FIXME: Do we need to examine each element to determine the
6696 largest id number? */
6697 bfd_putb16 (CPU_PA_RISC1_0, &lst.system_id);
6698 bfd_putb16 (LIBMAGIC, &lst.a_magic);
6699 bfd_putb32 (VERSION_ID, &lst.version_id);
6700 bfd_putb32 (0, &lst.file_time.secs);
6701 bfd_putb32 (0, &lst.file_time.nanosecs);
6702
6703 bfd_putb32 (lst_size, &lst.hash_loc);
6704 bfd_putb32 (SOM_LST_HASH_SIZE, &lst.hash_size);
6705
6706 /* Hash table is a SOM_LST_HASH_SIZE 32bit offsets. */
6707 lst_size += 4 * SOM_LST_HASH_SIZE;
6708
6709 /* We need to count the number of SOMs in this archive. */
6710 curr_bfd = abfd->archive_head;
6711 module_count = 0;
6712 while (curr_bfd != NULL)
6713 {
6714 /* Only true SOM objects count. */
6715 if (curr_bfd->format == bfd_object
6716 && curr_bfd->xvec->flavour == bfd_target_som_flavour)
6717 module_count++;
6718 curr_bfd = curr_bfd->archive_next;
6719 }
6720 bfd_putb32 (module_count, &lst.module_count);
6721 bfd_putb32 (module_count, &lst.module_limit);
6722 bfd_putb32 (lst_size, &lst.dir_loc);
6723 lst_size += sizeof (struct som_external_som_entry) * module_count;
6724
6725 /* We don't support import/export tables, auxiliary headers,
6726 or free lists yet. Make the linker work a little harder
6727 to make our life easier. */
6728
6729 bfd_putb32 (0, &lst.export_loc);
6730 bfd_putb32 (0, &lst.export_count);
6731 bfd_putb32 (0, &lst.import_loc);
6732 bfd_putb32 (0, &lst.aux_loc);
6733 bfd_putb32 (0, &lst.aux_size);
6734
6735 /* Count how many symbols we will have on the hash chains and the
6736 size of the associated string table. */
6737 if (! som_bfd_prep_for_ar_write (abfd, &nsyms, &stringsize))
6738 return FALSE;
6739
6740 lst_size += sizeof (struct som_external_lst_symbol_record) * nsyms;
6741
6742 /* For the string table. One day we might actually use this info
6743 to avoid small seeks/reads when reading archives. */
6744 bfd_putb32 (lst_size, &lst.string_loc);
6745 bfd_putb32 (stringsize, &lst.string_size);
6746 lst_size += stringsize;
6747
6748 /* SOM ABI says this must be zero. */
6749 bfd_putb32 (0, &lst.free_list);
6750 bfd_putb32 (lst_size, &lst.file_end);
6751
6752 /* Compute the checksum. Must happen after the entire lst header
6753 has filled in. */
6754 p = (unsigned char *) &lst;
6755 csum = 0;
6756 for (i = 0; i < sizeof (struct som_external_lst_header) - sizeof (int);
6757 i += 4)
6758 csum ^= bfd_getb32 (&p[i]);
6759 bfd_putb32 (csum, &lst.checksum);
6760
6761 sprintf (hdr.ar_name, "/ ");
6762 _bfd_ar_spacepad (hdr.ar_date, sizeof (hdr.ar_date), "%-12ld",
6763 bfd_ardata (abfd)->armap_timestamp);
6764 _bfd_ar_spacepad (hdr.ar_uid, sizeof (hdr.ar_uid), "%ld",
6765 statbuf.st_uid);
6766 _bfd_ar_spacepad (hdr.ar_gid, sizeof (hdr.ar_gid), "%ld",
6767 statbuf.st_gid);
6768 _bfd_ar_spacepad (hdr.ar_mode, sizeof (hdr.ar_mode), "%-8o",
6769 (unsigned int)statbuf.st_mode);
6770 _bfd_ar_spacepad (hdr.ar_size, sizeof (hdr.ar_size), "%-10d",
6771 (int) lst_size);
6772 hdr.ar_fmag[0] = '`';
6773 hdr.ar_fmag[1] = '\012';
6774
6775 /* Turn any nulls into spaces. */
6776 for (i = 0; i < sizeof (struct ar_hdr); i++)
6777 if (((char *) (&hdr))[i] == '\0')
6778 (((char *) (&hdr))[i]) = ' ';
6779
6780 /* Scribble out the ar header. */
6781 amt = sizeof (struct ar_hdr);
6782 if (bfd_bwrite ((void *) &hdr, amt, abfd) != amt)
6783 return FALSE;
6784
6785 /* Now scribble out the lst header. */
6786 amt = sizeof (struct som_external_lst_header);
6787 if (bfd_bwrite ((void *) &lst, amt, abfd) != amt)
6788 return FALSE;
6789
6790 /* Build and write the armap. */
6791 if (!som_bfd_ar_write_symbol_stuff (abfd, nsyms, stringsize, lst, elength))
6792 return FALSE;
6793
6794 /* Done. */
6795 return TRUE;
6796 }
6797
6798 /* Free all information we have cached for this BFD. We can always
6799 read it again later if we need it. */
6800
6801 static bfd_boolean
6802 som_bfd_free_cached_info (bfd *abfd)
6803 {
6804 if (bfd_get_format (abfd) == bfd_object)
6805 {
6806 asection *o;
6807
6808 #define FREE(x) if (x != NULL) { free (x); x = NULL; }
6809 /* Free the native string and symbol tables. */
6810 FREE (obj_som_symtab (abfd));
6811 FREE (obj_som_stringtab (abfd));
6812 for (o = abfd->sections; o != NULL; o = o->next)
6813 {
6814 /* Free the native relocations. */
6815 o->reloc_count = (unsigned) -1;
6816 FREE (som_section_data (o)->reloc_stream);
6817 /* Do not free the generic relocations as they are objalloc'ed. */
6818 }
6819 #undef FREE
6820 }
6821
6822 return _bfd_generic_close_and_cleanup (abfd);
6823 }
6824
6825 /* End of miscellaneous support functions. */
6826
6827 /* Linker support functions. */
6828
6829 static bfd_boolean
6830 som_bfd_link_split_section (bfd *abfd ATTRIBUTE_UNUSED, asection *sec)
6831 {
6832 return som_is_subspace (sec) && sec->size > 240000;
6833 }
6834
6835 #define som_find_line _bfd_nosymbols_find_line
6836 #define som_get_symbol_version_string _bfd_nosymbols_get_symbol_version_string
6837 #define som_close_and_cleanup som_bfd_free_cached_info
6838 #define som_read_ar_hdr _bfd_generic_read_ar_hdr
6839 #define som_write_ar_hdr _bfd_generic_write_ar_hdr
6840 #define som_openr_next_archived_file bfd_generic_openr_next_archived_file
6841 #define som_get_elt_at_index _bfd_generic_get_elt_at_index
6842 #define som_generic_stat_arch_elt bfd_generic_stat_arch_elt
6843 #define som_truncate_arname bfd_bsd_truncate_arname
6844 #define som_slurp_extended_name_table _bfd_slurp_extended_name_table
6845 #define som_construct_extended_name_table _bfd_archive_coff_construct_extended_name_table
6846 #define som_update_armap_timestamp _bfd_bool_bfd_true
6847 #define som_bfd_is_target_special_symbol _bfd_bool_bfd_asymbol_false
6848 #define som_get_lineno _bfd_nosymbols_get_lineno
6849 #define som_bfd_make_debug_symbol _bfd_nosymbols_bfd_make_debug_symbol
6850 #define som_read_minisymbols _bfd_generic_read_minisymbols
6851 #define som_minisymbol_to_symbol _bfd_generic_minisymbol_to_symbol
6852 #define som_get_section_contents_in_window _bfd_generic_get_section_contents_in_window
6853 #define som_bfd_get_relocated_section_contents bfd_generic_get_relocated_section_contents
6854 #define som_bfd_relax_section bfd_generic_relax_section
6855 #define som_bfd_link_hash_table_create _bfd_generic_link_hash_table_create
6856 #define som_bfd_link_add_symbols _bfd_generic_link_add_symbols
6857 #define som_bfd_link_just_syms _bfd_generic_link_just_syms
6858 #define som_bfd_copy_link_hash_symbol_type \
6859 _bfd_generic_copy_link_hash_symbol_type
6860 #define som_bfd_final_link _bfd_generic_final_link
6861 #define som_bfd_gc_sections bfd_generic_gc_sections
6862 #define som_bfd_lookup_section_flags bfd_generic_lookup_section_flags
6863 #define som_bfd_merge_sections bfd_generic_merge_sections
6864 #define som_bfd_is_group_section bfd_generic_is_group_section
6865 #define som_bfd_group_name bfd_generic_group_name
6866 #define som_bfd_discard_group bfd_generic_discard_group
6867 #define som_section_already_linked _bfd_generic_section_already_linked
6868 #define som_bfd_define_common_symbol bfd_generic_define_common_symbol
6869 #define som_bfd_link_hide_symbol _bfd_generic_link_hide_symbol
6870 #define som_bfd_define_start_stop bfd_generic_define_start_stop
6871 #define som_bfd_merge_private_bfd_data _bfd_generic_bfd_merge_private_bfd_data
6872 #define som_bfd_copy_private_header_data _bfd_generic_bfd_copy_private_header_data
6873 #define som_bfd_set_private_flags _bfd_generic_bfd_set_private_flags
6874 #define som_find_inliner_info _bfd_nosymbols_find_inliner_info
6875 #define som_bfd_link_check_relocs _bfd_generic_link_check_relocs
6876 #define som_set_reloc _bfd_generic_set_reloc
6877
6878 const bfd_target hppa_som_vec =
6879 {
6880 "som", /* Name. */
6881 bfd_target_som_flavour,
6882 BFD_ENDIAN_BIG, /* Target byte order. */
6883 BFD_ENDIAN_BIG, /* Target headers byte order. */
6884 (HAS_RELOC | EXEC_P | /* Object flags. */
6885 HAS_LINENO | HAS_DEBUG |
6886 HAS_SYMS | HAS_LOCALS | WP_TEXT | D_PAGED | DYNAMIC),
6887 (SEC_CODE | SEC_DATA | SEC_ROM | SEC_HAS_CONTENTS | SEC_LINK_ONCE
6888 | SEC_ALLOC | SEC_LOAD | SEC_RELOC), /* Section flags. */
6889
6890 /* Leading_symbol_char: is the first char of a user symbol
6891 predictable, and if so what is it. */
6892 0,
6893 '/', /* AR_pad_char. */
6894 14, /* AR_max_namelen. */
6895 0, /* match priority. */
6896 bfd_getb64, bfd_getb_signed_64, bfd_putb64,
6897 bfd_getb32, bfd_getb_signed_32, bfd_putb32,
6898 bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* Data. */
6899 bfd_getb64, bfd_getb_signed_64, bfd_putb64,
6900 bfd_getb32, bfd_getb_signed_32, bfd_putb32,
6901 bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* Headers. */
6902 {_bfd_dummy_target,
6903 som_object_p, /* bfd_check_format. */
6904 bfd_generic_archive_p,
6905 _bfd_dummy_target
6906 },
6907 {
6908 _bfd_bool_bfd_false_error,
6909 som_mkobject,
6910 _bfd_generic_mkarchive,
6911 _bfd_bool_bfd_false_error
6912 },
6913 {
6914 _bfd_bool_bfd_false_error,
6915 som_write_object_contents,
6916 _bfd_write_archive_contents,
6917 _bfd_bool_bfd_false_error,
6918 },
6919 #undef som
6920
6921 BFD_JUMP_TABLE_GENERIC (som),
6922 BFD_JUMP_TABLE_COPY (som),
6923 BFD_JUMP_TABLE_CORE (_bfd_nocore),
6924 BFD_JUMP_TABLE_ARCHIVE (som),
6925 BFD_JUMP_TABLE_SYMBOLS (som),
6926 BFD_JUMP_TABLE_RELOCS (som),
6927 BFD_JUMP_TABLE_WRITE (som),
6928 BFD_JUMP_TABLE_LINK (som),
6929 BFD_JUMP_TABLE_DYNAMIC (_bfd_nodynamic),
6930
6931 NULL,
6932
6933 NULL
6934 };
6935
A mirror of the official binutils-gdb repository