]> 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
Automatic date update in version.in
[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 bfd_cleanup
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 _bfd_no_cleanup;
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 if (bfd_seek (abfd, current_offset + file_hdr->space_strings_location,
2092 SEEK_SET) != 0)
2093 goto error_return;
2094 space_strings = (char *) _bfd_malloc_and_read (abfd, amt + 1, amt);
2095 if (space_strings == NULL)
2096 goto error_return;
2097 /* Make sure that the string table is NUL terminated. */
2098 space_strings[amt] = 0;
2099
2100 /* Loop over all of the space dictionaries, building up sections. */
2101 for (space_index = 0; space_index < file_hdr->space_total; space_index++)
2102 {
2103 struct som_space_dictionary_record space;
2104 struct som_external_space_dictionary_record ext_space;
2105 char *space_name;
2106 struct som_external_subspace_dictionary_record ext_subspace;
2107 struct som_subspace_dictionary_record subspace, save_subspace;
2108 unsigned int subspace_index;
2109 asection *space_asect;
2110 bfd_size_type space_size = 0;
2111 char *newname;
2112
2113 /* Read the space dictionary element. */
2114 if (bfd_seek (abfd,
2115 (current_offset + file_hdr->space_location
2116 + space_index * sizeof (ext_space)),
2117 SEEK_SET) != 0)
2118 goto error_return;
2119 amt = sizeof ext_space;
2120 if (bfd_bread (&ext_space, amt, abfd) != amt)
2121 goto error_return;
2122
2123 som_swap_space_dictionary_in (&ext_space, &space);
2124
2125 /* Setup the space name string. */
2126 if (space.name >= file_hdr->space_strings_size)
2127 goto error_return;
2128
2129 space_name = space.name + space_strings;
2130
2131 /* Make a section out of it. */
2132 amt = strlen (space_name) + 1;
2133 newname = bfd_alloc (abfd, amt);
2134 if (!newname)
2135 goto error_return;
2136 strcpy (newname, space_name);
2137
2138 space_asect = bfd_make_section_anyway (abfd, newname);
2139 if (!space_asect)
2140 goto error_return;
2141
2142 if (space.is_loadable == 0)
2143 space_asect->flags |= SEC_DEBUGGING;
2144
2145 /* Set up all the attributes for the space. */
2146 if (! bfd_som_set_section_attributes (space_asect, space.is_defined,
2147 space.is_private, space.sort_key,
2148 space.space_number))
2149 goto error_return;
2150
2151 /* If the space has no subspaces, then we're done. */
2152 if (space.subspace_quantity == 0)
2153 continue;
2154
2155 /* Now, read in the first subspace for this space. */
2156 if (bfd_seek (abfd,
2157 (current_offset + file_hdr->subspace_location
2158 + space.subspace_index * sizeof ext_subspace),
2159 SEEK_SET) != 0)
2160 goto error_return;
2161 amt = sizeof ext_subspace;
2162 if (bfd_bread (&ext_subspace, amt, abfd) != amt)
2163 goto error_return;
2164 /* Seek back to the start of the subspaces for loop below. */
2165 if (bfd_seek (abfd,
2166 (current_offset + file_hdr->subspace_location
2167 + space.subspace_index * sizeof ext_subspace),
2168 SEEK_SET) != 0)
2169 goto error_return;
2170
2171 som_swap_subspace_dictionary_in (&ext_subspace, &subspace);
2172
2173 /* Setup the start address and file loc from the first subspace
2174 record. */
2175 space_asect->vma = subspace.subspace_start;
2176 space_asect->filepos = subspace.file_loc_init_value + current_offset;
2177 space_asect->alignment_power = exact_log2 (subspace.alignment);
2178 if (space_asect->alignment_power == (unsigned) -1)
2179 goto error_return;
2180
2181 /* Initialize save_subspace so we can reliably determine if this
2182 loop placed any useful values into it. */
2183 memset (&save_subspace, 0, sizeof (save_subspace));
2184
2185 /* Loop over the rest of the subspaces, building up more sections. */
2186 for (subspace_index = 0; subspace_index < space.subspace_quantity;
2187 subspace_index++)
2188 {
2189 asection *subspace_asect;
2190 char *subspace_name;
2191
2192 /* Read in the next subspace. */
2193 amt = sizeof ext_subspace;
2194 if (bfd_bread (&ext_subspace, amt, abfd) != amt)
2195 goto error_return;
2196
2197 som_swap_subspace_dictionary_in (&ext_subspace, &subspace);
2198
2199 /* Setup the subspace name string. */
2200 if (subspace.name >= file_hdr->space_strings_size)
2201 goto error_return;
2202
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 free (space_strings);
2373 free (subspace_sections);
2374 return TRUE;
2375
2376 error_return:
2377 free (space_strings);
2378 free (subspace_sections);
2379 return FALSE;
2380 }
2381
2382
2383 /* Read in a SOM object and make it into a BFD. */
2384
2385 static bfd_cleanup
2386 som_object_p (bfd *abfd)
2387 {
2388 struct som_external_header ext_file_hdr;
2389 struct som_header file_hdr;
2390 struct som_exec_auxhdr *aux_hdr_ptr = NULL;
2391 unsigned long current_offset = 0;
2392 struct som_external_lst_header ext_lst_header;
2393 struct som_external_som_entry ext_som_entry;
2394 size_t amt;
2395 unsigned int loc;
2396 #define ENTRY_SIZE sizeof (struct som_external_som_entry)
2397
2398 amt = sizeof (struct som_external_header);
2399 if (bfd_bread (&ext_file_hdr, amt, abfd) != amt)
2400 {
2401 if (bfd_get_error () != bfd_error_system_call)
2402 bfd_set_error (bfd_error_wrong_format);
2403 return NULL;
2404 }
2405
2406 som_swap_header_in (&ext_file_hdr, &file_hdr);
2407
2408 if (!_PA_RISC_ID (file_hdr.system_id))
2409 {
2410 bfd_set_error (bfd_error_wrong_format);
2411 return NULL;
2412 }
2413
2414 switch (file_hdr.a_magic)
2415 {
2416 case RELOC_MAGIC:
2417 case EXEC_MAGIC:
2418 case SHARE_MAGIC:
2419 case DEMAND_MAGIC:
2420 case DL_MAGIC:
2421 case SHL_MAGIC:
2422 #ifdef SHARED_MAGIC_CNX
2423 case SHARED_MAGIC_CNX:
2424 #endif
2425 break;
2426
2427 case EXECLIBMAGIC:
2428 /* Read the lst header and determine where the SOM directory begins. */
2429
2430 if (bfd_seek (abfd, (file_ptr) 0, SEEK_SET) != 0)
2431 {
2432 if (bfd_get_error () != bfd_error_system_call)
2433 bfd_set_error (bfd_error_wrong_format);
2434 return NULL;
2435 }
2436
2437 amt = sizeof (struct som_external_lst_header);
2438 if (bfd_bread (&ext_lst_header, amt, abfd) != amt)
2439 {
2440 if (bfd_get_error () != bfd_error_system_call)
2441 bfd_set_error (bfd_error_wrong_format);
2442 return NULL;
2443 }
2444
2445 /* Position to and read the first directory entry. */
2446 loc = bfd_getb32 (ext_lst_header.dir_loc);
2447 if (bfd_seek (abfd, loc, SEEK_SET) != 0)
2448 {
2449 if (bfd_get_error () != bfd_error_system_call)
2450 bfd_set_error (bfd_error_wrong_format);
2451 return NULL;
2452 }
2453
2454 amt = ENTRY_SIZE;
2455 if (bfd_bread (&ext_som_entry, amt, abfd) != amt)
2456 {
2457 if (bfd_get_error () != bfd_error_system_call)
2458 bfd_set_error (bfd_error_wrong_format);
2459 return NULL;
2460 }
2461
2462 /* Now position to the first SOM. */
2463 current_offset = bfd_getb32 (ext_som_entry.location);
2464 if (bfd_seek (abfd, current_offset, SEEK_SET) != 0)
2465 {
2466 if (bfd_get_error () != bfd_error_system_call)
2467 bfd_set_error (bfd_error_wrong_format);
2468 return NULL;
2469 }
2470
2471 /* And finally, re-read the som header. */
2472 amt = sizeof (struct som_external_header);
2473 if (bfd_bread (&ext_file_hdr, amt, abfd) != amt)
2474 {
2475 if (bfd_get_error () != bfd_error_system_call)
2476 bfd_set_error (bfd_error_wrong_format);
2477 return NULL;
2478 }
2479
2480 som_swap_header_in (&ext_file_hdr, &file_hdr);
2481
2482 break;
2483
2484 default:
2485 bfd_set_error (bfd_error_wrong_format);
2486 return NULL;
2487 }
2488
2489 if (file_hdr.version_id != OLD_VERSION_ID
2490 && file_hdr.version_id != NEW_VERSION_ID)
2491 {
2492 bfd_set_error (bfd_error_wrong_format);
2493 return NULL;
2494 }
2495
2496 /* If the aux_header_size field in the file header is zero, then this
2497 object is an incomplete executable (a .o file). Do not try to read
2498 a non-existant auxiliary header. */
2499 if (file_hdr.aux_header_size != 0)
2500 {
2501 struct som_external_exec_auxhdr ext_exec_auxhdr;
2502
2503 aux_hdr_ptr = bfd_zalloc (abfd,
2504 (bfd_size_type) sizeof (*aux_hdr_ptr));
2505 if (aux_hdr_ptr == NULL)
2506 return NULL;
2507 amt = sizeof (struct som_external_exec_auxhdr);
2508 if (bfd_bread (&ext_exec_auxhdr, amt, abfd) != amt)
2509 {
2510 if (bfd_get_error () != bfd_error_system_call)
2511 bfd_set_error (bfd_error_wrong_format);
2512 return NULL;
2513 }
2514 som_swap_exec_auxhdr_in (&ext_exec_auxhdr, aux_hdr_ptr);
2515 }
2516
2517 if (!setup_sections (abfd, &file_hdr, current_offset))
2518 {
2519 /* setup_sections does not bubble up a bfd error code. */
2520 bfd_set_error (bfd_error_bad_value);
2521 return NULL;
2522 }
2523
2524 /* This appears to be a valid SOM object. Do some initialization. */
2525 return som_object_setup (abfd, &file_hdr, aux_hdr_ptr, current_offset);
2526 }
2527
2528 /* Create a SOM object. */
2529
2530 static bfd_boolean
2531 som_mkobject (bfd *abfd)
2532 {
2533 /* Allocate memory to hold backend information. */
2534 abfd->tdata.som_data = bfd_zalloc (abfd, (bfd_size_type) sizeof (struct som_data_struct));
2535 if (abfd->tdata.som_data == NULL)
2536 return FALSE;
2537 return TRUE;
2538 }
2539
2540 /* Initialize some information in the file header. This routine makes
2541 not attempt at doing the right thing for a full executable; it
2542 is only meant to handle relocatable objects. */
2543
2544 static bfd_boolean
2545 som_prep_headers (bfd *abfd)
2546 {
2547 struct som_header *file_hdr;
2548 asection *section;
2549 size_t amt = sizeof (struct som_header);
2550
2551 /* Make and attach a file header to the BFD. */
2552 file_hdr = bfd_zalloc (abfd, amt);
2553 if (file_hdr == NULL)
2554 return FALSE;
2555 obj_som_file_hdr (abfd) = file_hdr;
2556
2557 if (abfd->flags & (EXEC_P | DYNAMIC))
2558 {
2559 /* Make and attach an exec header to the BFD. */
2560 amt = sizeof (struct som_exec_auxhdr);
2561 obj_som_exec_hdr (abfd) = bfd_zalloc (abfd, amt);
2562 if (obj_som_exec_hdr (abfd) == NULL)
2563 return FALSE;
2564
2565 if (abfd->flags & D_PAGED)
2566 file_hdr->a_magic = DEMAND_MAGIC;
2567 else if (abfd->flags & WP_TEXT)
2568 file_hdr->a_magic = SHARE_MAGIC;
2569 #ifdef SHL_MAGIC
2570 else if (abfd->flags & DYNAMIC)
2571 file_hdr->a_magic = SHL_MAGIC;
2572 #endif
2573 else
2574 file_hdr->a_magic = EXEC_MAGIC;
2575 }
2576 else
2577 file_hdr->a_magic = RELOC_MAGIC;
2578
2579 /* These fields are optional, and embedding timestamps is not always
2580 a wise thing to do, it makes comparing objects during a multi-stage
2581 bootstrap difficult. */
2582 file_hdr->file_time.secs = 0;
2583 file_hdr->file_time.nanosecs = 0;
2584
2585 file_hdr->entry_space = 0;
2586 file_hdr->entry_subspace = 0;
2587 file_hdr->entry_offset = 0;
2588 file_hdr->presumed_dp = 0;
2589
2590 /* Now iterate over the sections translating information from
2591 BFD sections to SOM spaces/subspaces. */
2592 for (section = abfd->sections; section != NULL; section = section->next)
2593 {
2594 /* Ignore anything which has not been marked as a space or
2595 subspace. */
2596 if (!som_is_space (section) && !som_is_subspace (section))
2597 continue;
2598
2599 if (som_is_space (section))
2600 {
2601 /* Allocate space for the space dictionary. */
2602 amt = sizeof (struct som_space_dictionary_record);
2603 som_section_data (section)->space_dict = bfd_zalloc (abfd, amt);
2604 if (som_section_data (section)->space_dict == NULL)
2605 return FALSE;
2606 /* Set space attributes. Note most attributes of SOM spaces
2607 are set based on the subspaces it contains. */
2608 som_section_data (section)->space_dict->loader_fix_index = -1;
2609 som_section_data (section)->space_dict->init_pointer_index = -1;
2610
2611 /* Set more attributes that were stuffed away in private data. */
2612 som_section_data (section)->space_dict->sort_key =
2613 som_section_data (section)->copy_data->sort_key;
2614 som_section_data (section)->space_dict->is_defined =
2615 som_section_data (section)->copy_data->is_defined;
2616 som_section_data (section)->space_dict->is_private =
2617 som_section_data (section)->copy_data->is_private;
2618 som_section_data (section)->space_dict->space_number =
2619 som_section_data (section)->copy_data->space_number;
2620 }
2621 else
2622 {
2623 /* Allocate space for the subspace dictionary. */
2624 amt = sizeof (struct som_subspace_dictionary_record);
2625 som_section_data (section)->subspace_dict = bfd_zalloc (abfd, amt);
2626 if (som_section_data (section)->subspace_dict == NULL)
2627 return FALSE;
2628
2629 /* Set subspace attributes. Basic stuff is done here, additional
2630 attributes are filled in later as more information becomes
2631 available. */
2632 if (section->flags & SEC_ALLOC)
2633 som_section_data (section)->subspace_dict->is_loadable = 1;
2634
2635 if (section->flags & SEC_CODE)
2636 som_section_data (section)->subspace_dict->code_only = 1;
2637
2638 som_section_data (section)->subspace_dict->subspace_start =
2639 section->vma;
2640 som_section_data (section)->subspace_dict->subspace_length =
2641 section->size;
2642 som_section_data (section)->subspace_dict->initialization_length =
2643 section->size;
2644 som_section_data (section)->subspace_dict->alignment =
2645 1 << section->alignment_power;
2646
2647 /* Set more attributes that were stuffed away in private data. */
2648 som_section_data (section)->subspace_dict->sort_key =
2649 som_section_data (section)->copy_data->sort_key;
2650 som_section_data (section)->subspace_dict->access_control_bits =
2651 som_section_data (section)->copy_data->access_control_bits;
2652 som_section_data (section)->subspace_dict->quadrant =
2653 som_section_data (section)->copy_data->quadrant;
2654 som_section_data (section)->subspace_dict->is_comdat =
2655 som_section_data (section)->copy_data->is_comdat;
2656 som_section_data (section)->subspace_dict->is_common =
2657 som_section_data (section)->copy_data->is_common;
2658 som_section_data (section)->subspace_dict->dup_common =
2659 som_section_data (section)->copy_data->dup_common;
2660 }
2661 }
2662 return TRUE;
2663 }
2664
2665 /* Return TRUE if the given section is a SOM space, FALSE otherwise. */
2666
2667 static bfd_boolean
2668 som_is_space (asection *section)
2669 {
2670 /* If no copy data is available, then it's neither a space nor a
2671 subspace. */
2672 if (som_section_data (section)->copy_data == NULL)
2673 return FALSE;
2674
2675 /* If the containing space isn't the same as the given section,
2676 then this isn't a space. */
2677 if (som_section_data (section)->copy_data->container != section
2678 && (som_section_data (section)->copy_data->container->output_section
2679 != section))
2680 return FALSE;
2681
2682 /* OK. Must be a space. */
2683 return TRUE;
2684 }
2685
2686 /* Return TRUE if the given section is a SOM subspace, FALSE otherwise. */
2687
2688 static bfd_boolean
2689 som_is_subspace (asection *section)
2690 {
2691 /* If no copy data is available, then it's neither a space nor a
2692 subspace. */
2693 if (som_section_data (section)->copy_data == NULL)
2694 return FALSE;
2695
2696 /* If the containing space is the same as the given section,
2697 then this isn't a subspace. */
2698 if (som_section_data (section)->copy_data->container == section
2699 || (som_section_data (section)->copy_data->container->output_section
2700 == section))
2701 return FALSE;
2702
2703 /* OK. Must be a subspace. */
2704 return TRUE;
2705 }
2706
2707 /* Return TRUE if the given space contains the given subspace. It
2708 is safe to assume space really is a space, and subspace really
2709 is a subspace. */
2710
2711 static bfd_boolean
2712 som_is_container (asection *space, asection *subspace)
2713 {
2714 return (som_section_data (subspace)->copy_data->container == space)
2715 || (som_section_data (subspace)->copy_data->container->output_section
2716 == space);
2717 }
2718
2719 /* Count and return the number of spaces attached to the given BFD. */
2720
2721 static unsigned long
2722 som_count_spaces (bfd *abfd)
2723 {
2724 int count = 0;
2725 asection *section;
2726
2727 for (section = abfd->sections; section != NULL; section = section->next)
2728 count += som_is_space (section);
2729
2730 return count;
2731 }
2732
2733 /* Count the number of subspaces attached to the given BFD. */
2734
2735 static unsigned long
2736 som_count_subspaces (bfd *abfd)
2737 {
2738 int count = 0;
2739 asection *section;
2740
2741 for (section = abfd->sections; section != NULL; section = section->next)
2742 count += som_is_subspace (section);
2743
2744 return count;
2745 }
2746
2747 /* Return -1, 0, 1 indicating the relative ordering of sym1 and sym2.
2748
2749 We desire symbols to be ordered starting with the symbol with the
2750 highest relocation count down to the symbol with the lowest relocation
2751 count. Doing so compacts the relocation stream. */
2752
2753 static int
2754 compare_syms (const void *arg1, const void *arg2)
2755 {
2756 asymbol **sym1 = (asymbol **) arg1;
2757 asymbol **sym2 = (asymbol **) arg2;
2758 unsigned int count1, count2;
2759
2760 /* Get relocation count for each symbol. Note that the count
2761 is stored in the udata pointer for section symbols! */
2762 if ((*sym1)->flags & BSF_SECTION_SYM)
2763 count1 = (*sym1)->udata.i;
2764 else
2765 count1 = som_symbol_data (*sym1)->reloc_count;
2766
2767 if ((*sym2)->flags & BSF_SECTION_SYM)
2768 count2 = (*sym2)->udata.i;
2769 else
2770 count2 = som_symbol_data (*sym2)->reloc_count;
2771
2772 /* Return the appropriate value. */
2773 if (count1 < count2)
2774 return 1;
2775 else if (count1 > count2)
2776 return -1;
2777 return 0;
2778 }
2779
2780 /* Return -1, 0, 1 indicating the relative ordering of subspace1
2781 and subspace. */
2782
2783 static int
2784 compare_subspaces (const void *arg1, const void *arg2)
2785 {
2786 asection **subspace1 = (asection **) arg1;
2787 asection **subspace2 = (asection **) arg2;
2788
2789 if ((*subspace1)->target_index < (*subspace2)->target_index)
2790 return -1;
2791 else if ((*subspace2)->target_index < (*subspace1)->target_index)
2792 return 1;
2793 else
2794 return 0;
2795 }
2796
2797 /* Perform various work in preparation for emitting the fixup stream. */
2798
2799 static bfd_boolean
2800 som_prep_for_fixups (bfd *abfd, asymbol **syms, unsigned long num_syms)
2801 {
2802 unsigned long i;
2803 asection *section;
2804 asymbol **sorted_syms;
2805 size_t amt;
2806
2807 /* Most SOM relocations involving a symbol have a length which is
2808 dependent on the index of the symbol. So symbols which are
2809 used often in relocations should have a small index. */
2810
2811 /* First initialize the counters for each symbol. */
2812 for (i = 0; i < num_syms; i++)
2813 {
2814 /* Handle a section symbol; these have no pointers back to the
2815 SOM symbol info. So we just use the udata field to hold the
2816 relocation count. */
2817 if (som_symbol_data (syms[i]) == NULL
2818 || syms[i]->flags & BSF_SECTION_SYM)
2819 {
2820 syms[i]->flags |= BSF_SECTION_SYM;
2821 syms[i]->udata.i = 0;
2822 }
2823 else
2824 som_symbol_data (syms[i])->reloc_count = 0;
2825 }
2826
2827 /* Now that the counters are initialized, make a weighted count
2828 of how often a given symbol is used in a relocation. */
2829 for (section = abfd->sections; section != NULL; section = section->next)
2830 {
2831 int j;
2832
2833 /* Does this section have any relocations? */
2834 if ((int) section->reloc_count <= 0)
2835 continue;
2836
2837 /* Walk through each relocation for this section. */
2838 for (j = 1; j < (int) section->reloc_count; j++)
2839 {
2840 arelent *reloc = section->orelocation[j];
2841 int scale;
2842
2843 /* A relocation against a symbol in the *ABS* section really
2844 does not have a symbol. Likewise if the symbol isn't associated
2845 with any section. */
2846 if (reloc->sym_ptr_ptr == NULL
2847 || bfd_is_abs_section ((*reloc->sym_ptr_ptr)->section))
2848 continue;
2849
2850 /* Scaling to encourage symbols involved in R_DP_RELATIVE
2851 and R_CODE_ONE_SYMBOL relocations to come first. These
2852 two relocations have single byte versions if the symbol
2853 index is very small. */
2854 if (reloc->howto->type == R_DP_RELATIVE
2855 || reloc->howto->type == R_CODE_ONE_SYMBOL)
2856 scale = 2;
2857 else
2858 scale = 1;
2859
2860 /* Handle section symbols by storing the count in the udata
2861 field. It will not be used and the count is very important
2862 for these symbols. */
2863 if ((*reloc->sym_ptr_ptr)->flags & BSF_SECTION_SYM)
2864 {
2865 (*reloc->sym_ptr_ptr)->udata.i =
2866 (*reloc->sym_ptr_ptr)->udata.i + scale;
2867 continue;
2868 }
2869
2870 /* A normal symbol. Increment the count. */
2871 som_symbol_data (*reloc->sym_ptr_ptr)->reloc_count += scale;
2872 }
2873 }
2874
2875 /* Sort a copy of the symbol table, rather than the canonical
2876 output symbol table. */
2877 if (_bfd_mul_overflow (num_syms, sizeof (asymbol *), &amt))
2878 {
2879 bfd_set_error (bfd_error_no_memory);
2880 return FALSE;
2881 }
2882 sorted_syms = bfd_zalloc (abfd, amt);
2883 if (sorted_syms == NULL)
2884 return FALSE;
2885 memcpy (sorted_syms, syms, num_syms * sizeof (asymbol *));
2886 qsort (sorted_syms, num_syms, sizeof (asymbol *), compare_syms);
2887 obj_som_sorted_syms (abfd) = sorted_syms;
2888
2889 /* Compute the symbol indexes, they will be needed by the relocation
2890 code. */
2891 for (i = 0; i < num_syms; i++)
2892 {
2893 /* A section symbol. Again, there is no pointer to backend symbol
2894 information, so we reuse the udata field again. */
2895 if (sorted_syms[i]->flags & BSF_SECTION_SYM)
2896 sorted_syms[i]->udata.i = i;
2897 else
2898 som_symbol_data (sorted_syms[i])->index = i;
2899 }
2900 return TRUE;
2901 }
2902
2903 static bfd_boolean
2904 som_write_fixups (bfd *abfd,
2905 unsigned long current_offset,
2906 unsigned int *total_reloc_sizep)
2907 {
2908 unsigned int i, j;
2909 /* Chunk of memory that we can use as buffer space, then throw
2910 away. */
2911 unsigned char tmp_space[SOM_TMP_BUFSIZE];
2912 unsigned char *p;
2913 unsigned int total_reloc_size = 0;
2914 unsigned int subspace_reloc_size = 0;
2915 unsigned int num_spaces = obj_som_file_hdr (abfd)->space_total;
2916 asection *section = abfd->sections;
2917 size_t amt;
2918
2919 memset (tmp_space, 0, SOM_TMP_BUFSIZE);
2920 p = tmp_space;
2921
2922 /* All the fixups for a particular subspace are emitted in a single
2923 stream. All the subspaces for a particular space are emitted
2924 as a single stream.
2925
2926 So, to get all the locations correct one must iterate through all the
2927 spaces, for each space iterate through its subspaces and output a
2928 fixups stream. */
2929 for (i = 0; i < num_spaces; i++)
2930 {
2931 asection *subsection;
2932
2933 /* Find a space. */
2934 while (!som_is_space (section))
2935 section = section->next;
2936
2937 /* Now iterate through each of its subspaces. */
2938 for (subsection = abfd->sections;
2939 subsection != NULL;
2940 subsection = subsection->next)
2941 {
2942 int reloc_offset;
2943 unsigned int current_rounding_mode;
2944 #ifndef NO_PCREL_MODES
2945 unsigned int current_call_mode;
2946 #endif
2947
2948 /* Find a subspace of this space. */
2949 if (!som_is_subspace (subsection)
2950 || !som_is_container (section, subsection))
2951 continue;
2952
2953 /* If this subspace does not have real data, then we are
2954 finished with it. */
2955 if ((subsection->flags & SEC_HAS_CONTENTS) == 0)
2956 {
2957 som_section_data (subsection)->subspace_dict->fixup_request_index
2958 = -1;
2959 continue;
2960 }
2961
2962 /* This subspace has some relocations. Put the relocation stream
2963 index into the subspace record. */
2964 som_section_data (subsection)->subspace_dict->fixup_request_index
2965 = total_reloc_size;
2966
2967 /* To make life easier start over with a clean slate for
2968 each subspace. Seek to the start of the relocation stream
2969 for this subspace in preparation for writing out its fixup
2970 stream. */
2971 if (bfd_seek (abfd, current_offset + total_reloc_size, SEEK_SET) != 0)
2972 return FALSE;
2973
2974 /* Buffer space has already been allocated. Just perform some
2975 initialization here. */
2976 p = tmp_space;
2977 subspace_reloc_size = 0;
2978 reloc_offset = 0;
2979 som_initialize_reloc_queue (reloc_queue);
2980 current_rounding_mode = R_N_MODE;
2981 #ifndef NO_PCREL_MODES
2982 current_call_mode = R_SHORT_PCREL_MODE;
2983 #endif
2984
2985 /* Translate each BFD relocation into one or more SOM
2986 relocations. */
2987 for (j = 0; j < subsection->reloc_count; j++)
2988 {
2989 arelent *bfd_reloc = subsection->orelocation[j];
2990 unsigned int skip;
2991 int sym_num;
2992
2993 /* Get the symbol number. Remember it's stored in a
2994 special place for section symbols. */
2995 if ((*bfd_reloc->sym_ptr_ptr)->flags & BSF_SECTION_SYM)
2996 sym_num = (*bfd_reloc->sym_ptr_ptr)->udata.i;
2997 else
2998 sym_num = som_symbol_data (*bfd_reloc->sym_ptr_ptr)->index;
2999
3000 /* If there is not enough room for the next couple relocations,
3001 then dump the current buffer contents now. Also reinitialize
3002 the relocation queue.
3003
3004 No single BFD relocation could ever translate into more
3005 than 100 bytes of SOM relocations (20bytes is probably the
3006 upper limit, but leave lots of space for growth). */
3007 if (p - tmp_space + 100 > SOM_TMP_BUFSIZE)
3008 {
3009 amt = p - tmp_space;
3010 if (bfd_bwrite ((void *) tmp_space, amt, abfd) != amt)
3011 return FALSE;
3012
3013 p = tmp_space;
3014 som_initialize_reloc_queue (reloc_queue);
3015 }
3016
3017 /* Emit R_NO_RELOCATION fixups to map any bytes which were
3018 skipped. */
3019 skip = bfd_reloc->address - reloc_offset;
3020 p = som_reloc_skip (abfd, skip, p,
3021 &subspace_reloc_size, reloc_queue);
3022
3023 /* Update reloc_offset for the next iteration.
3024
3025 Many relocations do not consume input bytes. They
3026 are markers, or set state necessary to perform some
3027 later relocation. */
3028 switch (bfd_reloc->howto->type)
3029 {
3030 case R_ENTRY:
3031 case R_ALT_ENTRY:
3032 case R_EXIT:
3033 case R_N_MODE:
3034 case R_S_MODE:
3035 case R_D_MODE:
3036 case R_R_MODE:
3037 case R_FSEL:
3038 case R_LSEL:
3039 case R_RSEL:
3040 case R_COMP1:
3041 case R_COMP2:
3042 case R_BEGIN_BRTAB:
3043 case R_END_BRTAB:
3044 case R_BEGIN_TRY:
3045 case R_END_TRY:
3046 case R_N0SEL:
3047 case R_N1SEL:
3048 #ifndef NO_PCREL_MODES
3049 case R_SHORT_PCREL_MODE:
3050 case R_LONG_PCREL_MODE:
3051 #endif
3052 reloc_offset = bfd_reloc->address;
3053 break;
3054
3055 default:
3056 reloc_offset = bfd_reloc->address + 4;
3057 break;
3058 }
3059
3060 /* Now the actual relocation we care about. */
3061 switch (bfd_reloc->howto->type)
3062 {
3063 case R_PCREL_CALL:
3064 case R_ABS_CALL:
3065 p = som_reloc_call (abfd, p, &subspace_reloc_size,
3066 bfd_reloc, sym_num, reloc_queue);
3067 break;
3068
3069 case R_CODE_ONE_SYMBOL:
3070 case R_DP_RELATIVE:
3071 /* Account for any addend. */
3072 if (bfd_reloc->addend)
3073 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
3074 &subspace_reloc_size, reloc_queue);
3075
3076 if (sym_num < 0x20)
3077 {
3078 bfd_put_8 (abfd, bfd_reloc->howto->type + sym_num, p);
3079 subspace_reloc_size += 1;
3080 p += 1;
3081 }
3082 else if (sym_num < 0x100)
3083 {
3084 bfd_put_8 (abfd, bfd_reloc->howto->type + 32, p);
3085 bfd_put_8 (abfd, sym_num, p + 1);
3086 p = try_prev_fixup (abfd, &subspace_reloc_size, p,
3087 2, reloc_queue);
3088 }
3089 else if (sym_num < 0x10000000)
3090 {
3091 bfd_put_8 (abfd, bfd_reloc->howto->type + 33, p);
3092 bfd_put_8 (abfd, sym_num >> 16, p + 1);
3093 bfd_put_16 (abfd, (bfd_vma) sym_num, p + 2);
3094 p = try_prev_fixup (abfd, &subspace_reloc_size,
3095 p, 4, reloc_queue);
3096 }
3097 else
3098 abort ();
3099 break;
3100
3101 case R_DATA_GPREL:
3102 /* Account for any addend. */
3103 if (bfd_reloc->addend)
3104 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
3105 &subspace_reloc_size, reloc_queue);
3106
3107 if (sym_num < 0x10000000)
3108 {
3109 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
3110 bfd_put_8 (abfd, sym_num >> 16, p + 1);
3111 bfd_put_16 (abfd, (bfd_vma) sym_num, p + 2);
3112 p = try_prev_fixup (abfd, &subspace_reloc_size,
3113 p, 4, reloc_queue);
3114 }
3115 else
3116 abort ();
3117 break;
3118
3119 case R_DATA_ONE_SYMBOL:
3120 case R_DATA_PLABEL:
3121 case R_CODE_PLABEL:
3122 case R_DLT_REL:
3123 /* Account for any addend using R_DATA_OVERRIDE. */
3124 if (bfd_reloc->howto->type != R_DATA_ONE_SYMBOL
3125 && bfd_reloc->addend)
3126 p = som_reloc_addend (abfd, bfd_reloc->addend, p,
3127 &subspace_reloc_size, reloc_queue);
3128
3129 if (sym_num < 0x100)
3130 {
3131 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
3132 bfd_put_8 (abfd, sym_num, p + 1);
3133 p = try_prev_fixup (abfd, &subspace_reloc_size, p,
3134 2, reloc_queue);
3135 }
3136 else if (sym_num < 0x10000000)
3137 {
3138 bfd_put_8 (abfd, bfd_reloc->howto->type + 1, p);
3139 bfd_put_8 (abfd, sym_num >> 16, p + 1);
3140 bfd_put_16 (abfd, (bfd_vma) sym_num, p + 2);
3141 p = try_prev_fixup (abfd, &subspace_reloc_size,
3142 p, 4, reloc_queue);
3143 }
3144 else
3145 abort ();
3146 break;
3147
3148 case R_ENTRY:
3149 {
3150 unsigned int tmp;
3151 arelent *tmp_reloc = NULL;
3152 bfd_put_8 (abfd, R_ENTRY, p);
3153
3154 /* R_ENTRY relocations have 64 bits of associated
3155 data. Unfortunately the addend field of a bfd
3156 relocation is only 32 bits. So, we split up
3157 the 64bit unwind information and store part in
3158 the R_ENTRY relocation, and the rest in the R_EXIT
3159 relocation. */
3160 bfd_put_32 (abfd, bfd_reloc->addend, p + 1);
3161
3162 /* Find the next R_EXIT relocation. */
3163 for (tmp = j; tmp < subsection->reloc_count; tmp++)
3164 {
3165 tmp_reloc = subsection->orelocation[tmp];
3166 if (tmp_reloc->howto->type == R_EXIT)
3167 break;
3168 }
3169
3170 if (tmp == subsection->reloc_count)
3171 abort ();
3172
3173 bfd_put_32 (abfd, tmp_reloc->addend, p + 5);
3174 p = try_prev_fixup (abfd, &subspace_reloc_size,
3175 p, 9, reloc_queue);
3176 break;
3177 }
3178
3179 case R_N_MODE:
3180 case R_S_MODE:
3181 case R_D_MODE:
3182 case R_R_MODE:
3183 /* If this relocation requests the current rounding
3184 mode, then it is redundant. */
3185 if (bfd_reloc->howto->type != current_rounding_mode)
3186 {
3187 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
3188 subspace_reloc_size += 1;
3189 p += 1;
3190 current_rounding_mode = bfd_reloc->howto->type;
3191 }
3192 break;
3193
3194 #ifndef NO_PCREL_MODES
3195 case R_LONG_PCREL_MODE:
3196 case R_SHORT_PCREL_MODE:
3197 if (bfd_reloc->howto->type != current_call_mode)
3198 {
3199 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
3200 subspace_reloc_size += 1;
3201 p += 1;
3202 current_call_mode = bfd_reloc->howto->type;
3203 }
3204 break;
3205 #endif
3206
3207 case R_EXIT:
3208 case R_ALT_ENTRY:
3209 case R_FSEL:
3210 case R_LSEL:
3211 case R_RSEL:
3212 case R_BEGIN_BRTAB:
3213 case R_END_BRTAB:
3214 case R_BEGIN_TRY:
3215 case R_N0SEL:
3216 case R_N1SEL:
3217 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
3218 subspace_reloc_size += 1;
3219 p += 1;
3220 break;
3221
3222 case R_END_TRY:
3223 /* The end of an exception handling region. The reloc's
3224 addend contains the offset of the exception handling
3225 code. */
3226 if (bfd_reloc->addend == 0)
3227 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
3228 else if (bfd_reloc->addend < 1024)
3229 {
3230 bfd_put_8 (abfd, bfd_reloc->howto->type + 1, p);
3231 bfd_put_8 (abfd, bfd_reloc->addend / 4, p + 1);
3232 p = try_prev_fixup (abfd, &subspace_reloc_size,
3233 p, 2, reloc_queue);
3234 }
3235 else
3236 {
3237 bfd_put_8 (abfd, bfd_reloc->howto->type + 2, p);
3238 bfd_put_8 (abfd, (bfd_reloc->addend / 4) >> 16, p + 1);
3239 bfd_put_16 (abfd, bfd_reloc->addend / 4, p + 2);
3240 p = try_prev_fixup (abfd, &subspace_reloc_size,
3241 p, 4, reloc_queue);
3242 }
3243 break;
3244
3245 case R_COMP1:
3246 /* The only time we generate R_COMP1, R_COMP2 and
3247 R_CODE_EXPR relocs is for the difference of two
3248 symbols. Hence we can cheat here. */
3249 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
3250 bfd_put_8 (abfd, 0x44, p + 1);
3251 p = try_prev_fixup (abfd, &subspace_reloc_size,
3252 p, 2, reloc_queue);
3253 break;
3254
3255 case R_COMP2:
3256 /* The only time we generate R_COMP1, R_COMP2 and
3257 R_CODE_EXPR relocs is for the difference of two
3258 symbols. Hence we can cheat here. */
3259 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
3260 bfd_put_8 (abfd, 0x80, p + 1);
3261 bfd_put_8 (abfd, sym_num >> 16, p + 2);
3262 bfd_put_16 (abfd, (bfd_vma) sym_num, p + 3);
3263 p = try_prev_fixup (abfd, &subspace_reloc_size,
3264 p, 5, reloc_queue);
3265 break;
3266
3267 case R_CODE_EXPR:
3268 case R_DATA_EXPR:
3269 /* The only time we generate R_COMP1, R_COMP2 and
3270 R_CODE_EXPR relocs is for the difference of two
3271 symbols. Hence we can cheat here. */
3272 bfd_put_8 (abfd, bfd_reloc->howto->type, p);
3273 subspace_reloc_size += 1;
3274 p += 1;
3275 break;
3276
3277 /* Put a "R_RESERVED" relocation in the stream if
3278 we hit something we do not understand. The linker
3279 will complain loudly if this ever happens. */
3280 default:
3281 bfd_put_8 (abfd, 0xff, p);
3282 subspace_reloc_size += 1;
3283 p += 1;
3284 break;
3285 }
3286 }
3287
3288 /* Last BFD relocation for a subspace has been processed.
3289 Map the rest of the subspace with R_NO_RELOCATION fixups. */
3290 p = som_reloc_skip (abfd, subsection->size - reloc_offset,
3291 p, &subspace_reloc_size, reloc_queue);
3292
3293 /* Scribble out the relocations. */
3294 amt = p - tmp_space;
3295 if (bfd_bwrite ((void *) tmp_space, amt, abfd) != amt)
3296 return FALSE;
3297 p = tmp_space;
3298
3299 total_reloc_size += subspace_reloc_size;
3300 som_section_data (subsection)->subspace_dict->fixup_request_quantity
3301 = subspace_reloc_size;
3302 }
3303 section = section->next;
3304 }
3305 *total_reloc_sizep = total_reloc_size;
3306 return TRUE;
3307 }
3308
3309 /* Write out the space/subspace string table. */
3310
3311 static bfd_boolean
3312 som_write_space_strings (bfd *abfd,
3313 unsigned long current_offset,
3314 unsigned int *string_sizep)
3315 {
3316 /* Chunk of memory that we can use as buffer space, then throw
3317 away. */
3318 size_t tmp_space_size = SOM_TMP_BUFSIZE;
3319 char *tmp_space = bfd_malloc (tmp_space_size);
3320 char *p = tmp_space;
3321 unsigned int strings_size = 0;
3322 asection *section;
3323 size_t amt;
3324 bfd_size_type res;
3325
3326 if (tmp_space == NULL)
3327 return FALSE;
3328
3329 /* Seek to the start of the space strings in preparation for writing
3330 them out. */
3331 if (bfd_seek (abfd, (file_ptr) current_offset, SEEK_SET) != 0)
3332 return FALSE;
3333
3334 /* Walk through all the spaces and subspaces (order is not important)
3335 building up and writing string table entries for their names. */
3336 for (section = abfd->sections; section != NULL; section = section->next)
3337 {
3338 size_t length;
3339
3340 /* Only work with space/subspaces; avoid any other sections
3341 which might have been made (.text for example). */
3342 if (!som_is_space (section) && !som_is_subspace (section))
3343 continue;
3344
3345 /* Get the length of the space/subspace name. */
3346 length = strlen (section->name);
3347
3348 /* If there is not enough room for the next entry, then dump the
3349 current buffer contents now and maybe allocate a larger
3350 buffer. Each entry will take 4 bytes to hold the string
3351 length + the string itself + null terminator. */
3352 if (p - tmp_space + 5 + length > tmp_space_size)
3353 {
3354 /* Flush buffer before refilling or reallocating. */
3355 amt = p - tmp_space;
3356 if (bfd_bwrite ((void *) &tmp_space[0], amt, abfd) != amt)
3357 return FALSE;
3358
3359 /* Reallocate if now empty buffer still too small. */
3360 if (5 + length > tmp_space_size)
3361 {
3362 /* Ensure a minimum growth factor to avoid O(n**2) space
3363 consumption for n strings. The optimal minimum
3364 factor seems to be 2, as no other value can guarantee
3365 wasting less than 50% space. (Note that we cannot
3366 deallocate space allocated by `alloca' without
3367 returning from this function.) The same technique is
3368 used a few more times below when a buffer is
3369 reallocated. */
3370 if (2 * tmp_space_size < length + 5)
3371 tmp_space_size = length + 5;
3372 else
3373 tmp_space_size = 2 * tmp_space_size;
3374 tmp_space = xrealloc (tmp_space, tmp_space_size);
3375 }
3376
3377 /* Reset to beginning of the (possibly new) buffer space. */
3378 p = tmp_space;
3379 }
3380
3381 /* First element in a string table entry is the length of the
3382 string. Alignment issues are already handled. */
3383 bfd_put_32 (abfd, (bfd_vma) length, p);
3384 p += 4;
3385 strings_size += 4;
3386
3387 /* Record the index in the space/subspace records. */
3388 if (som_is_space (section))
3389 som_section_data (section)->space_dict->name = strings_size;
3390 else
3391 som_section_data (section)->subspace_dict->name = strings_size;
3392
3393 /* Next comes the string itself + a null terminator. */
3394 strcpy (p, section->name);
3395 p += length + 1;
3396 strings_size += length + 1;
3397
3398 /* Always align up to the next word boundary. */
3399 while (strings_size % 4)
3400 {
3401 bfd_put_8 (abfd, 0, p);
3402 p++;
3403 strings_size++;
3404 }
3405 }
3406
3407 /* Done with the space/subspace strings. Write out any information
3408 contained in a partial block. */
3409 amt = p - tmp_space;
3410 res = bfd_bwrite ((void *) &tmp_space[0], amt, abfd);
3411 free (tmp_space);
3412 if (res != amt)
3413 return FALSE;
3414 *string_sizep = strings_size;
3415 return TRUE;
3416 }
3417
3418 /* Write out the symbol string table. */
3419
3420 static bfd_boolean
3421 som_write_symbol_strings (bfd *abfd,
3422 unsigned long current_offset,
3423 asymbol **syms,
3424 unsigned int num_syms,
3425 unsigned int *string_sizep,
3426 struct som_compilation_unit *compilation_unit)
3427 {
3428 unsigned int i;
3429 /* Chunk of memory that we can use as buffer space, then throw
3430 away. */
3431 size_t tmp_space_size = SOM_TMP_BUFSIZE;
3432 char *tmp_space = bfd_malloc (tmp_space_size);
3433 char *p = tmp_space;
3434 unsigned int strings_size = 0;
3435 size_t amt;
3436 bfd_size_type res;
3437
3438 if (tmp_space == NULL)
3439 return FALSE;
3440
3441 /* This gets a bit gruesome because of the compilation unit. The
3442 strings within the compilation unit are part of the symbol
3443 strings, but don't have symbol_dictionary entries. So, manually
3444 write them and update the compilation unit header. On input, the
3445 compilation unit header contains local copies of the strings.
3446 Move them aside. */
3447
3448 /* Seek to the start of the space strings in preparation for writing
3449 them out. */
3450 if (bfd_seek (abfd, (file_ptr) current_offset, SEEK_SET) != 0)
3451 return FALSE;
3452
3453 if (compilation_unit)
3454 {
3455 for (i = 0; i < 4; i++)
3456 {
3457 struct som_name_pt *name;
3458 size_t length;
3459
3460 switch (i)
3461 {
3462 case 0:
3463 name = &compilation_unit->name;
3464 break;
3465 case 1:
3466 name = &compilation_unit->language_name;
3467 break;
3468 case 2:
3469 name = &compilation_unit->product_id;
3470 break;
3471 case 3:
3472 name = &compilation_unit->version_id;
3473 break;
3474 default:
3475 abort ();
3476 }
3477
3478 length = strlen (name->name);
3479
3480 /* If there is not enough room for the next entry, then dump
3481 the current buffer contents now and maybe allocate a
3482 larger buffer. */
3483 if (p - tmp_space + 5 + length > tmp_space_size)
3484 {
3485 /* Flush buffer before refilling or reallocating. */
3486 amt = p - tmp_space;
3487 if (bfd_bwrite ((void *) &tmp_space[0], amt, abfd) != amt)
3488 return FALSE;
3489
3490 /* Reallocate if now empty buffer still too small. */
3491 if (5 + length > tmp_space_size)
3492 {
3493 /* See alloca above for discussion of new size. */
3494 if (2 * tmp_space_size < 5 + length)
3495 tmp_space_size = 5 + length;
3496 else
3497 tmp_space_size = 2 * tmp_space_size;
3498 tmp_space = xrealloc (tmp_space, tmp_space_size);
3499 }
3500
3501 /* Reset to beginning of the (possibly new) buffer
3502 space. */
3503 p = tmp_space;
3504 }
3505
3506 /* First element in a string table entry is the length of
3507 the string. This must always be 4 byte aligned. This is
3508 also an appropriate time to fill in the string index
3509 field in the symbol table entry. */
3510 bfd_put_32 (abfd, (bfd_vma) length, p);
3511 strings_size += 4;
3512 p += 4;
3513
3514 /* Next comes the string itself + a null terminator. */
3515 strcpy (p, name->name);
3516
3517 name->strx = strings_size;
3518
3519 p += length + 1;
3520 strings_size += length + 1;
3521
3522 /* Always align up to the next word boundary. */
3523 while (strings_size % 4)
3524 {
3525 bfd_put_8 (abfd, 0, p);
3526 strings_size++;
3527 p++;
3528 }
3529 }
3530 }
3531
3532 for (i = 0; i < num_syms; i++)
3533 {
3534 size_t length = strlen (syms[i]->name);
3535
3536 /* If there is not enough room for the next entry, then dump the
3537 current buffer contents now and maybe allocate a larger buffer. */
3538 if (p - tmp_space + 5 + length > tmp_space_size)
3539 {
3540 /* Flush buffer before refilling or reallocating. */
3541 amt = p - tmp_space;
3542 if (bfd_bwrite ((void *) &tmp_space[0], amt, abfd) != amt)
3543 return FALSE;
3544
3545 /* Reallocate if now empty buffer still too small. */
3546 if (5 + length > tmp_space_size)
3547 {
3548 /* See alloca above for discussion of new size. */
3549 if (2 * tmp_space_size < 5 + length)
3550 tmp_space_size = 5 + length;
3551 else
3552 tmp_space_size = 2 * tmp_space_size;
3553 tmp_space = xrealloc (tmp_space, tmp_space_size);
3554 }
3555
3556 /* Reset to beginning of the (possibly new) buffer space. */
3557 p = tmp_space;
3558 }
3559
3560 /* First element in a string table entry is the length of the
3561 string. This must always be 4 byte aligned. This is also
3562 an appropriate time to fill in the string index field in the
3563 symbol table entry. */
3564 bfd_put_32 (abfd, (bfd_vma) length, p);
3565 strings_size += 4;
3566 p += 4;
3567
3568 /* Next comes the string itself + a null terminator. */
3569 strcpy (p, syms[i]->name);
3570
3571 som_symbol_data (syms[i])->stringtab_offset = strings_size;
3572 p += length + 1;
3573 strings_size += length + 1;
3574
3575 /* Always align up to the next word boundary. */
3576 while (strings_size % 4)
3577 {
3578 bfd_put_8 (abfd, 0, p);
3579 strings_size++;
3580 p++;
3581 }
3582 }
3583
3584 /* Scribble out any partial block. */
3585 amt = p - tmp_space;
3586 res = bfd_bwrite ((void *) &tmp_space[0], amt, abfd);
3587 free (tmp_space);
3588 if (res != amt)
3589 return FALSE;
3590
3591 *string_sizep = strings_size;
3592 return TRUE;
3593 }
3594
3595 /* Compute variable information to be placed in the SOM headers,
3596 space/subspace dictionaries, relocation streams, etc. Begin
3597 writing parts of the object file. */
3598
3599 static bfd_boolean
3600 som_begin_writing (bfd *abfd)
3601 {
3602 unsigned long current_offset = 0;
3603 unsigned int strings_size = 0;
3604 unsigned long num_spaces, num_subspaces, i;
3605 asection *section;
3606 unsigned int total_subspaces = 0;
3607 struct som_exec_auxhdr *exec_header = NULL;
3608
3609 /* The file header will always be first in an object file,
3610 everything else can be in random locations. To keep things
3611 "simple" BFD will lay out the object file in the manner suggested
3612 by the PRO ABI for PA-RISC Systems. */
3613
3614 /* Before any output can really begin offsets for all the major
3615 portions of the object file must be computed. So, starting
3616 with the initial file header compute (and sometimes write)
3617 each portion of the object file. */
3618
3619 /* Make room for the file header, it's contents are not complete
3620 yet, so it can not be written at this time. */
3621 current_offset += sizeof (struct som_external_header);
3622
3623 /* Any auxiliary headers will follow the file header. Right now
3624 we support only the copyright and version headers. */
3625 obj_som_file_hdr (abfd)->aux_header_location = current_offset;
3626 obj_som_file_hdr (abfd)->aux_header_size = 0;
3627 if (abfd->flags & (EXEC_P | DYNAMIC))
3628 {
3629 /* Parts of the exec header will be filled in later, so
3630 delay writing the header itself. Fill in the defaults,
3631 and write it later. */
3632 current_offset += sizeof (struct som_external_exec_auxhdr);
3633 obj_som_file_hdr (abfd)->aux_header_size
3634 += sizeof (struct som_external_exec_auxhdr);
3635 exec_header = obj_som_exec_hdr (abfd);
3636 exec_header->som_auxhdr.type = EXEC_AUX_ID;
3637 exec_header->som_auxhdr.length = 40;
3638 }
3639 if (obj_som_version_hdr (abfd) != NULL)
3640 {
3641 struct som_external_string_auxhdr ext_string_auxhdr;
3642 bfd_size_type len;
3643
3644 if (bfd_seek (abfd, (file_ptr) current_offset, SEEK_SET) != 0)
3645 return FALSE;
3646
3647 /* Write the aux_id structure and the string length. */
3648 len = sizeof (struct som_external_string_auxhdr);
3649 obj_som_file_hdr (abfd)->aux_header_size += len;
3650 current_offset += len;
3651 som_swap_string_auxhdr_out
3652 (obj_som_version_hdr (abfd), &ext_string_auxhdr);
3653 if (bfd_bwrite (&ext_string_auxhdr, len, abfd) != len)
3654 return FALSE;
3655
3656 /* Write the version string. */
3657 len = obj_som_version_hdr (abfd)->header_id.length - 4;
3658 obj_som_file_hdr (abfd)->aux_header_size += len;
3659 current_offset += len;
3660 if (bfd_bwrite ((void *) obj_som_version_hdr (abfd)->string, len, abfd)
3661 != len)
3662 return FALSE;
3663 }
3664
3665 if (obj_som_copyright_hdr (abfd) != NULL)
3666 {
3667 struct som_external_string_auxhdr ext_string_auxhdr;
3668 bfd_size_type len;
3669
3670 if (bfd_seek (abfd, (file_ptr) current_offset, SEEK_SET) != 0)
3671 return FALSE;
3672
3673 /* Write the aux_id structure and the string length. */
3674 len = sizeof (struct som_external_string_auxhdr);
3675 obj_som_file_hdr (abfd)->aux_header_size += len;
3676 current_offset += len;
3677 som_swap_string_auxhdr_out
3678 (obj_som_copyright_hdr (abfd), &ext_string_auxhdr);
3679 if (bfd_bwrite (&ext_string_auxhdr, len, abfd) != len)
3680 return FALSE;
3681
3682 /* Write the copyright string. */
3683 len = obj_som_copyright_hdr (abfd)->header_id.length - 4;
3684 obj_som_file_hdr (abfd)->aux_header_size += len;
3685 current_offset += len;
3686 if (bfd_bwrite ((void *) obj_som_copyright_hdr (abfd)->string, len, abfd)
3687 != len)
3688 return FALSE;
3689 }
3690
3691 /* Next comes the initialization pointers; we have no initialization
3692 pointers, so current offset does not change. */
3693 obj_som_file_hdr (abfd)->init_array_location = current_offset;
3694 obj_som_file_hdr (abfd)->init_array_total = 0;
3695
3696 /* Next are the space records. These are fixed length records.
3697
3698 Count the number of spaces to determine how much room is needed
3699 in the object file for the space records.
3700
3701 The names of the spaces are stored in a separate string table,
3702 and the index for each space into the string table is computed
3703 below. Therefore, it is not possible to write the space headers
3704 at this time. */
3705 num_spaces = som_count_spaces (abfd);
3706 obj_som_file_hdr (abfd)->space_location = current_offset;
3707 obj_som_file_hdr (abfd)->space_total = num_spaces;
3708 current_offset +=
3709 num_spaces * sizeof (struct som_external_space_dictionary_record);
3710
3711 /* Next are the subspace records. These are fixed length records.
3712
3713 Count the number of subspaes to determine how much room is needed
3714 in the object file for the subspace records.
3715
3716 A variety if fields in the subspace record are still unknown at
3717 this time (index into string table, fixup stream location/size, etc). */
3718 num_subspaces = som_count_subspaces (abfd);
3719 obj_som_file_hdr (abfd)->subspace_location = current_offset;
3720 obj_som_file_hdr (abfd)->subspace_total = num_subspaces;
3721 current_offset
3722 += num_subspaces * sizeof (struct som_external_subspace_dictionary_record);
3723
3724 /* Next is the string table for the space/subspace names. We will
3725 build and write the string table on the fly. At the same time
3726 we will fill in the space/subspace name index fields. */
3727
3728 /* The string table needs to be aligned on a word boundary. */
3729 if (current_offset % 4)
3730 current_offset += (4 - (current_offset % 4));
3731
3732 /* Mark the offset of the space/subspace string table in the
3733 file header. */
3734 obj_som_file_hdr (abfd)->space_strings_location = current_offset;
3735
3736 /* Scribble out the space strings. */
3737 if (! som_write_space_strings (abfd, current_offset, &strings_size))
3738 return FALSE;
3739
3740 /* Record total string table size in the header and update the
3741 current offset. */
3742 obj_som_file_hdr (abfd)->space_strings_size = strings_size;
3743 current_offset += strings_size;
3744
3745 /* Next is the compilation unit. */
3746 obj_som_file_hdr (abfd)->compiler_location = current_offset;
3747 obj_som_file_hdr (abfd)->compiler_total = 0;
3748 if (obj_som_compilation_unit (abfd))
3749 {
3750 obj_som_file_hdr (abfd)->compiler_total = 1;
3751 current_offset += sizeof (struct som_external_compilation_unit);
3752 }
3753
3754 /* Now compute the file positions for the loadable subspaces, taking
3755 care to make sure everything stays properly aligned. */
3756
3757 section = abfd->sections;
3758 for (i = 0; i < num_spaces; i++)
3759 {
3760 asection *subsection;
3761 int first_subspace;
3762 unsigned int subspace_offset = 0;
3763
3764 /* Find a space. */
3765 while (!som_is_space (section))
3766 section = section->next;
3767
3768 first_subspace = 1;
3769 /* Now look for all its subspaces. */
3770 for (subsection = abfd->sections;
3771 subsection != NULL;
3772 subsection = subsection->next)
3773 {
3774
3775 if (!som_is_subspace (subsection)
3776 || !som_is_container (section, subsection)
3777 || (subsection->flags & SEC_ALLOC) == 0)
3778 continue;
3779
3780 /* If this is the first subspace in the space, and we are
3781 building an executable, then take care to make sure all
3782 the alignments are correct and update the exec header. */
3783 if (first_subspace
3784 && (abfd->flags & (EXEC_P | DYNAMIC)))
3785 {
3786 /* Demand paged executables have each space aligned to a
3787 page boundary. Sharable executables (write-protected
3788 text) have just the private (aka data & bss) space aligned
3789 to a page boundary. Ugh. Not true for HPUX.
3790
3791 The HPUX kernel requires the text to always be page aligned
3792 within the file regardless of the executable's type. */
3793 if (abfd->flags & (D_PAGED | DYNAMIC)
3794 || (subsection->flags & SEC_CODE)
3795 || ((abfd->flags & WP_TEXT)
3796 && (subsection->flags & SEC_DATA)))
3797 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3798
3799 /* Update the exec header. */
3800 if (subsection->flags & SEC_CODE && exec_header->exec_tfile == 0)
3801 {
3802 exec_header->exec_tmem = section->vma;
3803 exec_header->exec_tfile = current_offset;
3804 }
3805 if (subsection->flags & SEC_DATA && exec_header->exec_dfile == 0)
3806 {
3807 exec_header->exec_dmem = section->vma;
3808 exec_header->exec_dfile = current_offset;
3809 }
3810
3811 /* Keep track of exactly where we are within a particular
3812 space. This is necessary as the braindamaged HPUX
3813 loader will create holes between subspaces *and*
3814 subspace alignments are *NOT* preserved. What a crock. */
3815 subspace_offset = subsection->vma;
3816
3817 /* Only do this for the first subspace within each space. */
3818 first_subspace = 0;
3819 }
3820 else if (abfd->flags & (EXEC_P | DYNAMIC))
3821 {
3822 /* The braindamaged HPUX loader may have created a hole
3823 between two subspaces. It is *not* sufficient to use
3824 the alignment specifications within the subspaces to
3825 account for these holes -- I've run into at least one
3826 case where the loader left one code subspace unaligned
3827 in a final executable.
3828
3829 To combat this we keep a current offset within each space,
3830 and use the subspace vma fields to detect and preserve
3831 holes. What a crock!
3832
3833 ps. This is not necessary for unloadable space/subspaces. */
3834 current_offset += subsection->vma - subspace_offset;
3835 if (subsection->flags & SEC_CODE)
3836 exec_header->exec_tsize += subsection->vma - subspace_offset;
3837 else
3838 exec_header->exec_dsize += subsection->vma - subspace_offset;
3839 subspace_offset += subsection->vma - subspace_offset;
3840 }
3841
3842 subsection->target_index = total_subspaces++;
3843 /* This is real data to be loaded from the file. */
3844 if (subsection->flags & SEC_LOAD)
3845 {
3846 /* Update the size of the code & data. */
3847 if (abfd->flags & (EXEC_P | DYNAMIC)
3848 && subsection->flags & SEC_CODE)
3849 exec_header->exec_tsize += subsection->size;
3850 else if (abfd->flags & (EXEC_P | DYNAMIC)
3851 && subsection->flags & SEC_DATA)
3852 exec_header->exec_dsize += subsection->size;
3853 som_section_data (subsection)->subspace_dict->file_loc_init_value
3854 = current_offset;
3855 subsection->filepos = current_offset;
3856 current_offset += subsection->size;
3857 subspace_offset += subsection->size;
3858 }
3859 /* Looks like uninitialized data. */
3860 else
3861 {
3862 /* Update the size of the bss section. */
3863 if (abfd->flags & (EXEC_P | DYNAMIC))
3864 exec_header->exec_bsize += subsection->size;
3865
3866 som_section_data (subsection)->subspace_dict->file_loc_init_value
3867 = 0;
3868 som_section_data (subsection)->subspace_dict->
3869 initialization_length = 0;
3870 }
3871 }
3872 /* Goto the next section. */
3873 section = section->next;
3874 }
3875
3876 /* Finally compute the file positions for unloadable subspaces.
3877 If building an executable, start the unloadable stuff on its
3878 own page. */
3879
3880 if (abfd->flags & (EXEC_P | DYNAMIC))
3881 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3882
3883 obj_som_file_hdr (abfd)->unloadable_sp_location = current_offset;
3884 section = abfd->sections;
3885 for (i = 0; i < num_spaces; i++)
3886 {
3887 asection *subsection;
3888
3889 /* Find a space. */
3890 while (!som_is_space (section))
3891 section = section->next;
3892
3893 if (abfd->flags & (EXEC_P | DYNAMIC))
3894 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3895
3896 /* Now look for all its subspaces. */
3897 for (subsection = abfd->sections;
3898 subsection != NULL;
3899 subsection = subsection->next)
3900 {
3901
3902 if (!som_is_subspace (subsection)
3903 || !som_is_container (section, subsection)
3904 || (subsection->flags & SEC_ALLOC) != 0)
3905 continue;
3906
3907 subsection->target_index = total_subspaces++;
3908 /* This is real data to be loaded from the file. */
3909 if ((subsection->flags & SEC_LOAD) == 0)
3910 {
3911 som_section_data (subsection)->subspace_dict->file_loc_init_value
3912 = current_offset;
3913 subsection->filepos = current_offset;
3914 current_offset += subsection->size;
3915 }
3916 /* Looks like uninitialized data. */
3917 else
3918 {
3919 som_section_data (subsection)->subspace_dict->file_loc_init_value
3920 = 0;
3921 som_section_data (subsection)->subspace_dict->
3922 initialization_length = subsection->size;
3923 }
3924 }
3925 /* Goto the next section. */
3926 section = section->next;
3927 }
3928
3929 /* If building an executable, then make sure to seek to and write
3930 one byte at the end of the file to make sure any necessary
3931 zeros are filled in. Ugh. */
3932 if (abfd->flags & (EXEC_P | DYNAMIC))
3933 current_offset = SOM_ALIGN (current_offset, PA_PAGESIZE);
3934 if (bfd_seek (abfd, (file_ptr) current_offset - 1, SEEK_SET) != 0)
3935 return FALSE;
3936 if (bfd_bwrite ((void *) "", (bfd_size_type) 1, abfd) != 1)
3937 return FALSE;
3938
3939 obj_som_file_hdr (abfd)->unloadable_sp_size
3940 = current_offset - obj_som_file_hdr (abfd)->unloadable_sp_location;
3941
3942 /* Loader fixups are not supported in any way shape or form. */
3943 obj_som_file_hdr (abfd)->loader_fixup_location = 0;
3944 obj_som_file_hdr (abfd)->loader_fixup_total = 0;
3945
3946 /* Done. Store the total size of the SOM so far. */
3947 obj_som_file_hdr (abfd)->som_length = current_offset;
3948
3949 return TRUE;
3950 }
3951
3952 /* Finally, scribble out the various headers to the disk. */
3953
3954 static bfd_boolean
3955 som_finish_writing (bfd *abfd)
3956 {
3957 int num_spaces = som_count_spaces (abfd);
3958 asymbol **syms = bfd_get_outsymbols (abfd);
3959 int i, num_syms;
3960 int subspace_index = 0;
3961 file_ptr location;
3962 asection *section;
3963 unsigned long current_offset;
3964 unsigned int strings_size, total_reloc_size;
3965 size_t amt;
3966 struct som_external_header ext_header;
3967
3968 /* We must set up the version identifier here as objcopy/strip copy
3969 private BFD data too late for us to handle this in som_begin_writing. */
3970 if (obj_som_exec_data (abfd)
3971 && obj_som_exec_data (abfd)->version_id)
3972 obj_som_file_hdr (abfd)->version_id = obj_som_exec_data (abfd)->version_id;
3973 else
3974 obj_som_file_hdr (abfd)->version_id = NEW_VERSION_ID;
3975
3976 /* Next is the symbol table. These are fixed length records.
3977
3978 Count the number of symbols to determine how much room is needed
3979 in the object file for the symbol table.
3980
3981 The names of the symbols are stored in a separate string table,
3982 and the index for each symbol name into the string table is computed
3983 below. Therefore, it is not possible to write the symbol table
3984 at this time.
3985
3986 These used to be output before the subspace contents, but they
3987 were moved here to work around a stupid bug in the hpux linker
3988 (fixed in hpux10). */
3989 current_offset = obj_som_file_hdr (abfd)->som_length;
3990
3991 /* Make sure we're on a word boundary. */
3992 if (current_offset % 4)
3993 current_offset += (4 - (current_offset % 4));
3994
3995 num_syms = bfd_get_symcount (abfd);
3996 obj_som_file_hdr (abfd)->symbol_location = current_offset;
3997 obj_som_file_hdr (abfd)->symbol_total = num_syms;
3998 current_offset +=
3999 num_syms * sizeof (struct som_external_symbol_dictionary_record);
4000
4001 /* Next are the symbol strings.
4002 Align them to a word boundary. */
4003 if (current_offset % 4)
4004 current_offset += (4 - (current_offset % 4));
4005 obj_som_file_hdr (abfd)->symbol_strings_location = current_offset;
4006
4007 /* Scribble out the symbol strings. */
4008 if (! som_write_symbol_strings (abfd, current_offset, syms,
4009 num_syms, &strings_size,
4010 obj_som_compilation_unit (abfd)))
4011 return FALSE;
4012
4013 /* Record total string table size in header and update the
4014 current offset. */
4015 obj_som_file_hdr (abfd)->symbol_strings_size = strings_size;
4016 current_offset += strings_size;
4017
4018 /* Do prep work before handling fixups. */
4019 if (!som_prep_for_fixups (abfd,
4020 bfd_get_outsymbols (abfd),
4021 bfd_get_symcount (abfd)))
4022 return FALSE;
4023
4024 /* At the end of the file is the fixup stream which starts on a
4025 word boundary. */
4026 if (current_offset % 4)
4027 current_offset += (4 - (current_offset % 4));
4028 obj_som_file_hdr (abfd)->fixup_request_location = current_offset;
4029
4030 /* Write the fixups and update fields in subspace headers which
4031 relate to the fixup stream. */
4032 if (! som_write_fixups (abfd, current_offset, &total_reloc_size))
4033 return FALSE;
4034
4035 /* Record the total size of the fixup stream in the file header. */
4036 obj_som_file_hdr (abfd)->fixup_request_total = total_reloc_size;
4037
4038 /* Done. Store the total size of the SOM. */
4039 obj_som_file_hdr (abfd)->som_length = current_offset + total_reloc_size;
4040
4041 /* Now that the symbol table information is complete, build and
4042 write the symbol table. */
4043 if (! som_build_and_write_symbol_table (abfd))
4044 return FALSE;
4045
4046 /* Subspaces are written first so that we can set up information
4047 about them in their containing spaces as the subspace is written. */
4048
4049 /* Seek to the start of the subspace dictionary records. */
4050 location = obj_som_file_hdr (abfd)->subspace_location;
4051 if (bfd_seek (abfd, location, SEEK_SET) != 0)
4052 return FALSE;
4053
4054 section = abfd->sections;
4055 /* Now for each loadable space write out records for its subspaces. */
4056 for (i = 0; i < num_spaces; i++)
4057 {
4058 asection *subsection;
4059
4060 /* Find a space. */
4061 while (!som_is_space (section))
4062 section = section->next;
4063
4064 /* Now look for all its subspaces. */
4065 for (subsection = abfd->sections;
4066 subsection != NULL;
4067 subsection = subsection->next)
4068 {
4069 struct som_external_subspace_dictionary_record ext_subspace_dict;
4070
4071 /* Skip any section which does not correspond to a space
4072 or subspace. Or does not have SEC_ALLOC set (and therefore
4073 has no real bits on the disk). */
4074 if (!som_is_subspace (subsection)
4075 || !som_is_container (section, subsection)
4076 || (subsection->flags & SEC_ALLOC) == 0)
4077 continue;
4078
4079 /* If this is the first subspace for this space, then save
4080 the index of the subspace in its containing space. Also
4081 set "is_loadable" in the containing space. */
4082
4083 if (som_section_data (section)->space_dict->subspace_quantity == 0)
4084 {
4085 som_section_data (section)->space_dict->is_loadable = 1;
4086 som_section_data (section)->space_dict->subspace_index
4087 = subspace_index;
4088 }
4089
4090 /* Increment the number of subspaces seen and the number of
4091 subspaces contained within the current space. */
4092 subspace_index++;
4093 som_section_data (section)->space_dict->subspace_quantity++;
4094
4095 /* Mark the index of the current space within the subspace's
4096 dictionary record. */
4097 som_section_data (subsection)->subspace_dict->space_index = i;
4098
4099 /* Dump the current subspace header. */
4100 som_swap_subspace_dictionary_record_out
4101 (som_section_data (subsection)->subspace_dict, &ext_subspace_dict);
4102 amt = sizeof (struct som_subspace_dictionary_record);
4103 if (bfd_bwrite (&ext_subspace_dict, amt, abfd) != amt)
4104 return FALSE;
4105 }
4106 /* Goto the next section. */
4107 section = section->next;
4108 }
4109
4110 /* Now repeat the process for unloadable subspaces. */
4111 section = abfd->sections;
4112 /* Now for each space write out records for its subspaces. */
4113 for (i = 0; i < num_spaces; i++)
4114 {
4115 asection *subsection;
4116
4117 /* Find a space. */
4118 while (!som_is_space (section))
4119 section = section->next;
4120
4121 /* Now look for all its subspaces. */
4122 for (subsection = abfd->sections;
4123 subsection != NULL;
4124 subsection = subsection->next)
4125 {
4126 struct som_external_subspace_dictionary_record ext_subspace_dict;
4127
4128 /* Skip any section which does not correspond to a space or
4129 subspace, or which SEC_ALLOC set (and therefore handled
4130 in the loadable spaces/subspaces code above). */
4131
4132 if (!som_is_subspace (subsection)
4133 || !som_is_container (section, subsection)
4134 || (subsection->flags & SEC_ALLOC) != 0)
4135 continue;
4136
4137 /* If this is the first subspace for this space, then save
4138 the index of the subspace in its containing space. Clear
4139 "is_loadable". */
4140
4141 if (som_section_data (section)->space_dict->subspace_quantity == 0)
4142 {
4143 som_section_data (section)->space_dict->is_loadable = 0;
4144 som_section_data (section)->space_dict->subspace_index
4145 = subspace_index;
4146 }
4147
4148 /* Increment the number of subspaces seen and the number of
4149 subspaces contained within the current space. */
4150 som_section_data (section)->space_dict->subspace_quantity++;
4151 subspace_index++;
4152
4153 /* Mark the index of the current space within the subspace's
4154 dictionary record. */
4155 som_section_data (subsection)->subspace_dict->space_index = i;
4156
4157 /* Dump this subspace header. */
4158 som_swap_subspace_dictionary_record_out
4159 (som_section_data (subsection)->subspace_dict, &ext_subspace_dict);
4160 amt = sizeof (struct som_subspace_dictionary_record);
4161 if (bfd_bwrite (&ext_subspace_dict, amt, abfd) != amt)
4162 return FALSE;
4163 }
4164 /* Goto the next section. */
4165 section = section->next;
4166 }
4167
4168 /* All the subspace dictionary records are written, and all the
4169 fields are set up in the space dictionary records.
4170
4171 Seek to the right location and start writing the space
4172 dictionary records. */
4173 location = obj_som_file_hdr (abfd)->space_location;
4174 if (bfd_seek (abfd, location, SEEK_SET) != 0)
4175 return FALSE;
4176
4177 section = abfd->sections;
4178 for (i = 0; i < num_spaces; i++)
4179 {
4180 struct som_external_space_dictionary_record ext_space_dict;
4181
4182 /* Find a space. */
4183 while (!som_is_space (section))
4184 section = section->next;
4185
4186 /* Dump its header. */
4187 som_swap_space_dictionary_out (som_section_data (section)->space_dict,
4188 &ext_space_dict);
4189 amt = sizeof (struct som_external_space_dictionary_record);
4190 if (bfd_bwrite (&ext_space_dict, amt, abfd) != amt)
4191 return FALSE;
4192
4193 /* Goto the next section. */
4194 section = section->next;
4195 }
4196
4197 /* Write the compilation unit record if there is one. */
4198 if (obj_som_compilation_unit (abfd))
4199 {
4200 struct som_external_compilation_unit ext_comp_unit;
4201
4202 location = obj_som_file_hdr (abfd)->compiler_location;
4203 if (bfd_seek (abfd, location, SEEK_SET) != 0)
4204 return FALSE;
4205
4206 som_swap_compilation_unit_out
4207 (obj_som_compilation_unit (abfd), &ext_comp_unit);
4208
4209 amt = sizeof (struct som_external_compilation_unit);
4210 if (bfd_bwrite (&ext_comp_unit, amt, abfd) != amt)
4211 return FALSE;
4212 }
4213
4214 /* Setting of the system_id has to happen very late now that copying of
4215 BFD private data happens *after* section contents are set. */
4216 if (abfd->flags & (EXEC_P | DYNAMIC))
4217 obj_som_file_hdr (abfd)->system_id = obj_som_exec_data (abfd)->system_id;
4218 else if (bfd_get_mach (abfd) == pa20)
4219 obj_som_file_hdr (abfd)->system_id = CPU_PA_RISC2_0;
4220 else if (bfd_get_mach (abfd) == pa11)
4221 obj_som_file_hdr (abfd)->system_id = CPU_PA_RISC1_1;
4222 else
4223 obj_som_file_hdr (abfd)->system_id = CPU_PA_RISC1_0;
4224
4225 /* Swap and compute the checksum for the file header just before writing
4226 the header to disk. */
4227 som_swap_header_out (obj_som_file_hdr (abfd), &ext_header);
4228 bfd_putb32 (som_compute_checksum (&ext_header), ext_header.checksum);
4229
4230 /* Only thing left to do is write out the file header. It is always
4231 at location zero. Seek there and write it. */
4232 if (bfd_seek (abfd, (file_ptr) 0, SEEK_SET) != 0)
4233 return FALSE;
4234 amt = sizeof (struct som_external_header);
4235 if (bfd_bwrite (&ext_header, amt, abfd) != amt)
4236 return FALSE;
4237
4238 /* Now write the exec header. */
4239 if (abfd->flags & (EXEC_P | DYNAMIC))
4240 {
4241 long tmp, som_length;
4242 struct som_exec_auxhdr *exec_header;
4243 struct som_external_exec_auxhdr ext_exec_header;
4244
4245 exec_header = obj_som_exec_hdr (abfd);
4246 exec_header->exec_entry = bfd_get_start_address (abfd);
4247 exec_header->exec_flags = obj_som_exec_data (abfd)->exec_flags;
4248
4249 /* Oh joys. Ram some of the BSS data into the DATA section
4250 to be compatible with how the hp linker makes objects
4251 (saves memory space). */
4252 tmp = exec_header->exec_dsize;
4253 tmp = SOM_ALIGN (tmp, PA_PAGESIZE);
4254 exec_header->exec_bsize -= (tmp - exec_header->exec_dsize);
4255 if (exec_header->exec_bsize < 0)
4256 exec_header->exec_bsize = 0;
4257 exec_header->exec_dsize = tmp;
4258
4259 /* Now perform some sanity checks. The idea is to catch bogons now and
4260 inform the user, instead of silently generating a bogus file. */
4261 som_length = obj_som_file_hdr (abfd)->som_length;
4262 if (exec_header->exec_tfile + exec_header->exec_tsize > som_length
4263 || exec_header->exec_dfile + exec_header->exec_dsize > som_length)
4264 {
4265 bfd_set_error (bfd_error_bad_value);
4266 return FALSE;
4267 }
4268
4269 som_swap_exec_auxhdr_out (exec_header, &ext_exec_header);
4270
4271 if (bfd_seek (abfd, obj_som_file_hdr (abfd)->aux_header_location,
4272 SEEK_SET) != 0)
4273 return FALSE;
4274
4275 amt = sizeof (ext_exec_header);
4276 if (bfd_bwrite (&ext_exec_header, amt, abfd) != amt)
4277 return FALSE;
4278 }
4279 return TRUE;
4280 }
4281
4282 /* Compute and return the checksum for a SOM file header. */
4283
4284 static unsigned long
4285 som_compute_checksum (struct som_external_header *hdr)
4286 {
4287 unsigned long checksum, count, i;
4288 unsigned long *buffer = (unsigned long *) hdr;
4289
4290 checksum = 0;
4291 count = sizeof (struct som_external_header) / 4;
4292 for (i = 0; i < count; i++)
4293 checksum ^= *(buffer + i);
4294
4295 return checksum;
4296 }
4297
4298 static void
4299 som_bfd_derive_misc_symbol_info (bfd *abfd ATTRIBUTE_UNUSED,
4300 asymbol *sym,
4301 struct som_misc_symbol_info *info)
4302 {
4303 /* Initialize. */
4304 memset (info, 0, sizeof (struct som_misc_symbol_info));
4305
4306 /* The HP SOM linker requires detailed type information about
4307 all symbols (including undefined symbols!). Unfortunately,
4308 the type specified in an import/export statement does not
4309 always match what the linker wants. Severe braindamage. */
4310
4311 /* Section symbols will not have a SOM symbol type assigned to
4312 them yet. Assign all section symbols type ST_DATA. */
4313 if (sym->flags & BSF_SECTION_SYM)
4314 info->symbol_type = ST_DATA;
4315 else
4316 {
4317 /* For BFD style common, the linker will choke unless we set the
4318 type and scope to ST_STORAGE and SS_UNSAT, respectively. */
4319 if (bfd_is_com_section (sym->section))
4320 {
4321 info->symbol_type = ST_STORAGE;
4322 info->symbol_scope = SS_UNSAT;
4323 }
4324
4325 /* It is possible to have a symbol without an associated
4326 type. This happens if the user imported the symbol
4327 without a type and the symbol was never defined
4328 locally. If BSF_FUNCTION is set for this symbol, then
4329 assign it type ST_CODE (the HP linker requires undefined
4330 external functions to have type ST_CODE rather than ST_ENTRY). */
4331 else if ((som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN
4332 || som_symbol_data (sym)->som_type == SYMBOL_TYPE_CODE)
4333 && bfd_is_und_section (sym->section)
4334 && sym->flags & BSF_FUNCTION)
4335 info->symbol_type = ST_CODE;
4336
4337 /* Handle function symbols which were defined in this file.
4338 They should have type ST_ENTRY. Also retrieve the argument
4339 relocation bits from the SOM backend information. */
4340 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_ENTRY
4341 || (som_symbol_data (sym)->som_type == SYMBOL_TYPE_CODE
4342 && (sym->flags & BSF_FUNCTION))
4343 || (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN
4344 && (sym->flags & BSF_FUNCTION)))
4345 {
4346 info->symbol_type = ST_ENTRY;
4347 info->arg_reloc = som_symbol_data (sym)->tc_data.ap.hppa_arg_reloc;
4348 info->priv_level= som_symbol_data (sym)->tc_data.ap.hppa_priv_level;
4349 }
4350
4351 /* For unknown symbols set the symbol's type based on the symbol's
4352 section (ST_DATA for DATA sections, ST_CODE for CODE sections). */
4353 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_UNKNOWN)
4354 {
4355 if (bfd_is_abs_section (sym->section))
4356 info->symbol_type = ST_ABSOLUTE;
4357 else if (sym->section->flags & SEC_CODE)
4358 info->symbol_type = ST_CODE;
4359 else
4360 info->symbol_type = ST_DATA;
4361 }
4362
4363 /* From now on it's a very simple mapping. */
4364 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_ABSOLUTE)
4365 info->symbol_type = ST_ABSOLUTE;
4366 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_CODE)
4367 info->symbol_type = ST_CODE;
4368 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_DATA)
4369 info->symbol_type = ST_DATA;
4370 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_MILLICODE)
4371 info->symbol_type = ST_MILLICODE;
4372 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_PLABEL)
4373 info->symbol_type = ST_PLABEL;
4374 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_PRI_PROG)
4375 info->symbol_type = ST_PRI_PROG;
4376 else if (som_symbol_data (sym)->som_type == SYMBOL_TYPE_SEC_PROG)
4377 info->symbol_type = ST_SEC_PROG;
4378 }
4379
4380 /* Now handle the symbol's scope. Exported data which is not
4381 in the common section has scope SS_UNIVERSAL. Note scope
4382 of common symbols was handled earlier! */
4383 if (bfd_is_com_section (sym->section))
4384 ;
4385 else if (bfd_is_und_section (sym->section))
4386 info->symbol_scope = SS_UNSAT;
4387 else if (sym->flags & (BSF_EXPORT | BSF_WEAK))
4388 info->symbol_scope = SS_UNIVERSAL;
4389 /* Anything else which is not in the common section has scope
4390 SS_LOCAL. */
4391 else
4392 info->symbol_scope = SS_LOCAL;
4393
4394 /* Now set the symbol_info field. It has no real meaning
4395 for undefined or common symbols, but the HP linker will
4396 choke if it's not set to some "reasonable" value. We
4397 use zero as a reasonable value. */
4398 if (bfd_is_com_section (sym->section)
4399 || bfd_is_und_section (sym->section)
4400 || bfd_is_abs_section (sym->section))
4401 info->symbol_info = 0;
4402 /* For all other symbols, the symbol_info field contains the
4403 subspace index of the space this symbol is contained in. */
4404 else
4405 info->symbol_info = sym->section->target_index;
4406
4407 /* Set the symbol's value. */
4408 info->symbol_value = sym->value + sym->section->vma;
4409
4410 /* The secondary_def field is for "weak" symbols. */
4411 if (sym->flags & BSF_WEAK)
4412 info->secondary_def = TRUE;
4413 else
4414 info->secondary_def = FALSE;
4415
4416 /* The is_comdat, is_common and dup_common fields provide various
4417 flavors of common.
4418
4419 For data symbols, setting IS_COMMON provides Fortran style common
4420 (duplicate definitions and overlapped initialization). Setting both
4421 IS_COMMON and DUP_COMMON provides Cobol style common (duplicate
4422 definitions as long as they are all the same length). In a shared
4423 link data symbols retain their IS_COMMON and DUP_COMMON flags.
4424 An IS_COMDAT data symbol is similar to a IS_COMMON | DUP_COMMON
4425 symbol except in that it loses its IS_COMDAT flag in a shared link.
4426
4427 For code symbols, IS_COMDAT and DUP_COMMON have effect. Universal
4428 DUP_COMMON code symbols are not exported from shared libraries.
4429 IS_COMDAT symbols are exported but they lose their IS_COMDAT flag.
4430
4431 We take a simplified approach to setting the is_comdat, is_common
4432 and dup_common flags in symbols based on the flag settings of their
4433 subspace. This avoids having to add directives like `.comdat' but
4434 the linker behavior is probably undefined if there is more than one
4435 universal symbol (comdat key sysmbol) in a subspace.
4436
4437 The behavior of these flags is not well documentmented, so there
4438 may be bugs and some surprising interactions with other flags. */
4439 if (som_section_data (sym->section)
4440 && som_section_data (sym->section)->subspace_dict
4441 && info->symbol_scope == SS_UNIVERSAL
4442 && (info->symbol_type == ST_ENTRY
4443 || info->symbol_type == ST_CODE
4444 || info->symbol_type == ST_DATA))
4445 {
4446 info->is_comdat
4447 = som_section_data (sym->section)->subspace_dict->is_comdat;
4448 info->is_common
4449 = som_section_data (sym->section)->subspace_dict->is_common;
4450 info->dup_common
4451 = som_section_data (sym->section)->subspace_dict->dup_common;
4452 }
4453 }
4454
4455 /* Build and write, in one big chunk, the entire symbol table for
4456 this BFD. */
4457
4458 static bfd_boolean
4459 som_build_and_write_symbol_table (bfd *abfd)
4460 {
4461 unsigned int num_syms = bfd_get_symcount (abfd);
4462 file_ptr symtab_location = obj_som_file_hdr (abfd)->symbol_location;
4463 asymbol **bfd_syms = obj_som_sorted_syms (abfd);
4464 struct som_external_symbol_dictionary_record *som_symtab = NULL;
4465 unsigned int i;
4466 bfd_size_type symtab_size;
4467 size_t amt;
4468
4469 /* Compute total symbol table size and allocate a chunk of memory
4470 to hold the symbol table as we build it. */
4471 if (_bfd_mul_overflow (num_syms,
4472 sizeof (struct som_external_symbol_dictionary_record),
4473 &amt))
4474 {
4475 bfd_set_error (bfd_error_no_memory);
4476 return FALSE;
4477 }
4478 som_symtab = bfd_zmalloc (amt);
4479 if (som_symtab == NULL && num_syms != 0)
4480 goto error_return;
4481
4482 /* Walk over each symbol. */
4483 for (i = 0; i < num_syms; i++)
4484 {
4485 struct som_misc_symbol_info info;
4486 unsigned int flags;
4487
4488 /* This is really an index into the symbol strings table.
4489 By the time we get here, the index has already been
4490 computed and stored into the name field in the BFD symbol. */
4491 bfd_putb32 (som_symbol_data (bfd_syms[i])->stringtab_offset,
4492 som_symtab[i].name);
4493
4494 /* Derive SOM information from the BFD symbol. */
4495 som_bfd_derive_misc_symbol_info (abfd, bfd_syms[i], &info);
4496
4497 /* Now use it. */
4498 flags = (info.symbol_type << SOM_SYMBOL_TYPE_SH)
4499 | (info.symbol_scope << SOM_SYMBOL_SCOPE_SH)
4500 | (info.arg_reloc << SOM_SYMBOL_ARG_RELOC_SH)
4501 | (3 << SOM_SYMBOL_XLEAST_SH)
4502 | (info.secondary_def ? SOM_SYMBOL_SECONDARY_DEF : 0)
4503 | (info.is_common ? SOM_SYMBOL_IS_COMMON : 0)
4504 | (info.dup_common ? SOM_SYMBOL_DUP_COMMON : 0);
4505 bfd_putb32 (flags, som_symtab[i].flags);
4506
4507 flags = (info.symbol_info << SOM_SYMBOL_SYMBOL_INFO_SH)
4508 | (info.is_comdat ? SOM_SYMBOL_IS_COMDAT : 0);
4509 bfd_putb32 (flags, som_symtab[i].info);
4510 bfd_putb32 (info.symbol_value | info.priv_level,
4511 som_symtab[i].symbol_value);
4512 }
4513
4514 /* Everything is ready, seek to the right location and
4515 scribble out the symbol table. */
4516 if (bfd_seek (abfd, symtab_location, SEEK_SET) != 0)
4517 goto error_return;
4518
4519 symtab_size = num_syms;
4520 symtab_size *= sizeof (struct som_external_symbol_dictionary_record);
4521 if (bfd_bwrite ((void *) som_symtab, symtab_size, abfd) != symtab_size)
4522 goto error_return;
4523
4524 free (som_symtab);
4525 return TRUE;
4526
4527 error_return:
4528 free (som_symtab);
4529 return FALSE;
4530 }
4531
4532 /* Write an object in SOM format. */
4533
4534 static bfd_boolean
4535 som_write_object_contents (bfd *abfd)
4536 {
4537 if (! abfd->output_has_begun)
4538 {
4539 /* Set up fixed parts of the file, space, and subspace headers.
4540 Notify the world that output has begun. */
4541 som_prep_headers (abfd);
4542 abfd->output_has_begun = TRUE;
4543 /* Start writing the object file. This include all the string
4544 tables, fixup streams, and other portions of the object file. */
4545 som_begin_writing (abfd);
4546 }
4547
4548 return som_finish_writing (abfd);
4549 }
4550 \f
4551 /* Read and save the string table associated with the given BFD. */
4552
4553 static bfd_boolean
4554 som_slurp_string_table (bfd *abfd)
4555 {
4556 char *stringtab;
4557 bfd_size_type amt;
4558
4559 /* Use the saved version if its available. */
4560 if (obj_som_stringtab (abfd) != NULL)
4561 return TRUE;
4562
4563 /* I don't think this can currently happen, and I'm not sure it should
4564 really be an error, but it's better than getting unpredictable results
4565 from the host's malloc when passed a size of zero. */
4566 if (obj_som_stringtab_size (abfd) == 0)
4567 {
4568 bfd_set_error (bfd_error_no_symbols);
4569 return FALSE;
4570 }
4571
4572 /* Allocate and read in the string table. */
4573 if (bfd_seek (abfd, obj_som_str_filepos (abfd), SEEK_SET) != 0)
4574 return FALSE;
4575 amt = obj_som_stringtab_size (abfd);
4576 stringtab = (char *) _bfd_malloc_and_read (abfd, amt, amt);
4577 if (stringtab == NULL)
4578 return FALSE;
4579
4580 /* Save our results and return success. */
4581 obj_som_stringtab (abfd) = stringtab;
4582 return TRUE;
4583 }
4584
4585 /* Return the amount of data (in bytes) required to hold the symbol
4586 table for this object. */
4587
4588 static long
4589 som_get_symtab_upper_bound (bfd *abfd)
4590 {
4591 if (!som_slurp_symbol_table (abfd))
4592 return -1;
4593
4594 return (bfd_get_symcount (abfd) + 1) * sizeof (asymbol *);
4595 }
4596
4597 /* Convert from a SOM subspace index to a BFD section. */
4598
4599 asection *
4600 bfd_section_from_som_symbol
4601 (bfd *abfd, struct som_external_symbol_dictionary_record *symbol)
4602 {
4603 asection *section;
4604 unsigned int flags = bfd_getb32 (symbol->flags);
4605 unsigned int symbol_type = (flags >> SOM_SYMBOL_TYPE_SH) & SOM_SYMBOL_TYPE_MASK;
4606
4607 /* The meaning of the symbol_info field changes for functions
4608 within executables. So only use the quick symbol_info mapping for
4609 incomplete objects and non-function symbols in executables. */
4610 if ((abfd->flags & (EXEC_P | DYNAMIC)) == 0
4611 || (symbol_type != ST_ENTRY
4612 && symbol_type != ST_PRI_PROG
4613 && symbol_type != ST_SEC_PROG
4614 && symbol_type != ST_MILLICODE))
4615 {
4616 int idx = (bfd_getb32 (symbol->info) >> SOM_SYMBOL_SYMBOL_INFO_SH)
4617 & SOM_SYMBOL_SYMBOL_INFO_MASK;
4618
4619 for (section = abfd->sections; section != NULL; section = section->next)
4620 if (section->target_index == idx && som_is_subspace (section))
4621 return section;
4622 }
4623 else
4624 {
4625 unsigned int value = bfd_getb32 (symbol->symbol_value);
4626
4627 /* For executables we will have to use the symbol's address and
4628 find out what section would contain that address. Yuk. */
4629 for (section = abfd->sections; section; section = section->next)
4630 if (value >= section->vma
4631 && value <= section->vma + section->size
4632 && som_is_subspace (section))
4633 return section;
4634 }
4635
4636 /* Could be a symbol from an external library (such as an OMOS
4637 shared library). Don't abort. */
4638 return bfd_abs_section_ptr;
4639 }
4640
4641 /* Read and save the symbol table associated with the given BFD. */
4642
4643 static unsigned int
4644 som_slurp_symbol_table (bfd *abfd)
4645 {
4646 unsigned int symbol_count = bfd_get_symcount (abfd);
4647 size_t symsize = sizeof (struct som_external_symbol_dictionary_record);
4648 char *stringtab;
4649 struct som_external_symbol_dictionary_record *buf = NULL, *bufp, *endbufp;
4650 som_symbol_type *sym, *symbase = NULL;
4651 size_t amt;
4652
4653 /* Return saved value if it exists. */
4654 if (obj_som_symtab (abfd) != NULL)
4655 goto successful_return;
4656
4657 /* Special case. This is *not* an error. */
4658 if (symbol_count == 0)
4659 goto successful_return;
4660
4661 if (!som_slurp_string_table (abfd))
4662 goto error_return;
4663
4664 stringtab = obj_som_stringtab (abfd);
4665
4666 /* Read in the external SOM representation. */
4667 if (_bfd_mul_overflow (symbol_count, symsize, &amt))
4668 {
4669 bfd_set_error (bfd_error_file_too_big);
4670 goto error_return;
4671 }
4672 if (bfd_seek (abfd, obj_som_sym_filepos (abfd), SEEK_SET) != 0)
4673 goto error_return;
4674 buf = (struct som_external_symbol_dictionary_record *)
4675 _bfd_malloc_and_read (abfd, amt, amt);
4676 if (buf == NULL)
4677 goto error_return;
4678
4679 if (_bfd_mul_overflow (symbol_count, sizeof (som_symbol_type), &amt))
4680 {
4681 bfd_set_error (bfd_error_file_too_big);
4682 goto error_return;
4683 }
4684 symbase = bfd_zmalloc (amt);
4685 if (symbase == NULL)
4686 goto error_return;
4687
4688 /* Iterate over all the symbols and internalize them. */
4689 endbufp = buf + symbol_count;
4690 for (bufp = buf, sym = symbase; bufp < endbufp; ++bufp)
4691 {
4692 unsigned int flags = bfd_getb32 (bufp->flags);
4693 unsigned int symbol_type =
4694 (flags >> SOM_SYMBOL_TYPE_SH) & SOM_SYMBOL_TYPE_MASK;
4695 unsigned int symbol_scope =
4696 (flags >> SOM_SYMBOL_SCOPE_SH) & SOM_SYMBOL_SCOPE_MASK;
4697
4698 /* I don't think we care about these. */
4699 if (symbol_type == ST_SYM_EXT || symbol_type == ST_ARG_EXT)
4700 continue;
4701
4702 /* Set some private data we care about. */
4703 if (symbol_type == ST_NULL)
4704 som_symbol_data (sym)->som_type = SYMBOL_TYPE_UNKNOWN;
4705 else if (symbol_type == ST_ABSOLUTE)
4706 som_symbol_data (sym)->som_type = SYMBOL_TYPE_ABSOLUTE;
4707 else if (symbol_type == ST_DATA)
4708 som_symbol_data (sym)->som_type = SYMBOL_TYPE_DATA;
4709 else if (symbol_type == ST_CODE)
4710 som_symbol_data (sym)->som_type = SYMBOL_TYPE_CODE;
4711 else if (symbol_type == ST_PRI_PROG)
4712 som_symbol_data (sym)->som_type = SYMBOL_TYPE_PRI_PROG;
4713 else if (symbol_type == ST_SEC_PROG)
4714 som_symbol_data (sym)->som_type = SYMBOL_TYPE_SEC_PROG;
4715 else if (symbol_type == ST_ENTRY)
4716 som_symbol_data (sym)->som_type = SYMBOL_TYPE_ENTRY;
4717 else if (symbol_type == ST_MILLICODE)
4718 som_symbol_data (sym)->som_type = SYMBOL_TYPE_MILLICODE;
4719 else if (symbol_type == ST_PLABEL)
4720 som_symbol_data (sym)->som_type = SYMBOL_TYPE_PLABEL;
4721 else
4722 som_symbol_data (sym)->som_type = SYMBOL_TYPE_UNKNOWN;
4723 som_symbol_data (sym)->tc_data.ap.hppa_arg_reloc =
4724 (flags >> SOM_SYMBOL_ARG_RELOC_SH) & SOM_SYMBOL_ARG_RELOC_MASK;
4725
4726 /* Some reasonable defaults. */
4727 sym->symbol.the_bfd = abfd;
4728 sym->symbol.name = bfd_getb32 (bufp->name) + stringtab;
4729 sym->symbol.value = bfd_getb32 (bufp->symbol_value);
4730 sym->symbol.section = 0;
4731 sym->symbol.flags = 0;
4732
4733 switch (symbol_type)
4734 {
4735 case ST_ENTRY:
4736 case ST_MILLICODE:
4737 sym->symbol.flags |= BSF_FUNCTION;
4738 som_symbol_data (sym)->tc_data.ap.hppa_priv_level =
4739 sym->symbol.value & 0x3;
4740 sym->symbol.value &= ~0x3;
4741 break;
4742
4743 case ST_STUB:
4744 case ST_CODE:
4745 case ST_PRI_PROG:
4746 case ST_SEC_PROG:
4747 som_symbol_data (sym)->tc_data.ap.hppa_priv_level =
4748 sym->symbol.value & 0x3;
4749 sym->symbol.value &= ~0x3;
4750 /* If the symbol's scope is SS_UNSAT, then these are
4751 undefined function symbols. */
4752 if (symbol_scope == SS_UNSAT)
4753 sym->symbol.flags |= BSF_FUNCTION;
4754
4755 default:
4756 break;
4757 }
4758
4759 /* Handle scoping and section information. */
4760 switch (symbol_scope)
4761 {
4762 /* symbol_info field is undefined for SS_EXTERNAL and SS_UNSAT symbols,
4763 so the section associated with this symbol can't be known. */
4764 case SS_EXTERNAL:
4765 if (symbol_type != ST_STORAGE)
4766 sym->symbol.section = bfd_und_section_ptr;
4767 else
4768 sym->symbol.section = bfd_com_section_ptr;
4769 sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL);
4770 break;
4771
4772 case SS_UNSAT:
4773 if (symbol_type != ST_STORAGE)
4774 sym->symbol.section = bfd_und_section_ptr;
4775 else
4776 sym->symbol.section = bfd_com_section_ptr;
4777 break;
4778
4779 case SS_UNIVERSAL:
4780 sym->symbol.flags |= (BSF_EXPORT | BSF_GLOBAL);
4781 sym->symbol.section = bfd_section_from_som_symbol (abfd, bufp);
4782 sym->symbol.value -= sym->symbol.section->vma;
4783 break;
4784
4785 case SS_LOCAL:
4786 sym->symbol.flags |= BSF_LOCAL;
4787 sym->symbol.section = bfd_section_from_som_symbol (abfd, bufp);
4788 sym->symbol.value -= sym->symbol.section->vma;
4789 break;
4790 }
4791
4792 /* Check for a weak symbol. */
4793 if (flags & SOM_SYMBOL_SECONDARY_DEF)
4794 sym->symbol.flags |= BSF_WEAK;
4795
4796 /* Mark section symbols and symbols used by the debugger.
4797 Note $START$ is a magic code symbol, NOT a section symbol. */
4798 if (sym->symbol.name[0] == '$'
4799 && sym->symbol.name[strlen (sym->symbol.name) - 1] == '$'
4800 && !strcmp (sym->symbol.name, sym->symbol.section->name))
4801 sym->symbol.flags |= BSF_SECTION_SYM;
4802 else if (CONST_STRNEQ (sym->symbol.name, "L$0\002"))
4803 {
4804 sym->symbol.flags |= BSF_SECTION_SYM;
4805 sym->symbol.name = sym->symbol.section->name;
4806 }
4807 else if (CONST_STRNEQ (sym->symbol.name, "L$0\001"))
4808 sym->symbol.flags |= BSF_DEBUGGING;
4809
4810 /* Note increment at bottom of loop, since we skip some symbols
4811 we can not include it as part of the for statement. */
4812 sym++;
4813 }
4814
4815 /* We modify the symbol count to record the number of BFD symbols we
4816 created. */
4817 abfd->symcount = sym - symbase;
4818
4819 /* Save our results and return success. */
4820 obj_som_symtab (abfd) = symbase;
4821 successful_return:
4822 free (buf);
4823 return (TRUE);
4824
4825 error_return:
4826 free (symbase);
4827 free (buf);
4828 return FALSE;
4829 }
4830
4831 /* Canonicalize a SOM symbol table. Return the number of entries
4832 in the symbol table. */
4833
4834 static long
4835 som_canonicalize_symtab (bfd *abfd, asymbol **location)
4836 {
4837 int i;
4838 som_symbol_type *symbase;
4839
4840 if (!som_slurp_symbol_table (abfd))
4841 return -1;
4842
4843 i = bfd_get_symcount (abfd);
4844 symbase = obj_som_symtab (abfd);
4845
4846 for (; i > 0; i--, location++, symbase++)
4847 *location = &symbase->symbol;
4848
4849 /* Final null pointer. */
4850 *location = 0;
4851 return (bfd_get_symcount (abfd));
4852 }
4853
4854 /* Make a SOM symbol. There is nothing special to do here. */
4855
4856 static asymbol *
4857 som_make_empty_symbol (bfd *abfd)
4858 {
4859 size_t amt = sizeof (som_symbol_type);
4860 som_symbol_type *new_symbol_type = bfd_zalloc (abfd, amt);
4861
4862 if (new_symbol_type == NULL)
4863 return NULL;
4864 new_symbol_type->symbol.the_bfd = abfd;
4865
4866 return &new_symbol_type->symbol;
4867 }
4868
4869 /* Print symbol information. */
4870
4871 static void
4872 som_print_symbol (bfd *abfd,
4873 void *afile,
4874 asymbol *symbol,
4875 bfd_print_symbol_type how)
4876 {
4877 FILE *file = (FILE *) afile;
4878
4879 switch (how)
4880 {
4881 case bfd_print_symbol_name:
4882 fprintf (file, "%s", symbol->name);
4883 break;
4884 case bfd_print_symbol_more:
4885 fprintf (file, "som ");
4886 fprintf_vma (file, symbol->value);
4887 fprintf (file, " %lx", (long) symbol->flags);
4888 break;
4889 case bfd_print_symbol_all:
4890 {
4891 const char *section_name;
4892
4893 section_name = symbol->section ? symbol->section->name : "(*none*)";
4894 bfd_print_symbol_vandf (abfd, (void *) file, symbol);
4895 fprintf (file, " %s\t%s", section_name, symbol->name);
4896 break;
4897 }
4898 }
4899 }
4900
4901 static bfd_boolean
4902 som_bfd_is_local_label_name (bfd *abfd ATTRIBUTE_UNUSED,
4903 const char *name)
4904 {
4905 return name[0] == 'L' && name[1] == '$';
4906 }
4907
4908 /* Count or process variable-length SOM fixup records.
4909
4910 To avoid code duplication we use this code both to compute the number
4911 of relocations requested by a stream, and to internalize the stream.
4912
4913 When computing the number of relocations requested by a stream the
4914 variables rptr, section, and symbols have no meaning.
4915
4916 Return the number of relocations requested by the fixup stream. When
4917 not just counting
4918
4919 This needs at least two or three more passes to get it cleaned up. */
4920
4921 static unsigned int
4922 som_set_reloc_info (unsigned char *fixup,
4923 unsigned int end,
4924 arelent *internal_relocs,
4925 asection *section,
4926 asymbol **symbols,
4927 bfd_boolean just_count)
4928 {
4929 unsigned int op, varname, deallocate_contents = 0;
4930 unsigned char *end_fixups = &fixup[end];
4931 const struct fixup_format *fp;
4932 const char *cp;
4933 unsigned char *save_fixup;
4934 int variables[26], stack[20], c, v, count, prev_fixup, *sp, saved_unwind_bits;
4935 const int *subop;
4936 arelent *rptr = internal_relocs;
4937 unsigned int offset = 0;
4938
4939 #define var(c) variables[(c) - 'A']
4940 #define push(v) (*sp++ = (v))
4941 #define pop() (*--sp)
4942 #define emptystack() (sp == stack)
4943
4944 som_initialize_reloc_queue (reloc_queue);
4945 memset (variables, 0, sizeof (variables));
4946 memset (stack, 0, sizeof (stack));
4947 count = 0;
4948 prev_fixup = 0;
4949 saved_unwind_bits = 0;
4950 sp = stack;
4951
4952 while (fixup < end_fixups)
4953 {
4954 /* Save pointer to the start of this fixup. We'll use
4955 it later to determine if it is necessary to put this fixup
4956 on the queue. */
4957 save_fixup = fixup;
4958
4959 /* Get the fixup code and its associated format. */
4960 op = *fixup++;
4961 fp = &som_fixup_formats[op];
4962
4963 /* Handle a request for a previous fixup. */
4964 if (*fp->format == 'P')
4965 {
4966 /* Get pointer to the beginning of the prev fixup, move
4967 the repeated fixup to the head of the queue. */
4968 fixup = reloc_queue[fp->D].reloc;
4969 som_reloc_queue_fix (reloc_queue, fp->D);
4970 prev_fixup = 1;
4971
4972 /* Get the fixup code and its associated format. */
4973 op = *fixup++;
4974 fp = &som_fixup_formats[op];
4975 }
4976
4977 /* If this fixup will be passed to BFD, set some reasonable defaults. */
4978 if (! just_count
4979 && som_hppa_howto_table[op].type != R_NO_RELOCATION
4980 && som_hppa_howto_table[op].type != R_DATA_OVERRIDE)
4981 {
4982 rptr->address = offset;
4983 rptr->howto = &som_hppa_howto_table[op];
4984 rptr->addend = 0;
4985 rptr->sym_ptr_ptr = bfd_abs_section_ptr->symbol_ptr_ptr;
4986 }
4987
4988 /* Set default input length to 0. Get the opcode class index
4989 into D. */
4990 var ('L') = 0;
4991 var ('D') = fp->D;
4992 var ('U') = saved_unwind_bits;
4993
4994 /* Get the opcode format. */
4995 cp = fp->format;
4996
4997 /* Process the format string. Parsing happens in two phases,
4998 parse RHS, then assign to LHS. Repeat until no more
4999 characters in the format string. */
5000 while (*cp)
5001 {
5002 /* The variable this pass is going to compute a value for. */
5003 varname = *cp++;
5004
5005 /* Start processing RHS. Continue until a NULL or '=' is found. */
5006 do
5007 {
5008 c = *cp++;
5009
5010 /* If this is a variable, push it on the stack. */
5011 if (ISUPPER (c))
5012 push (var (c));
5013
5014 /* If this is a lower case letter, then it represents
5015 additional data from the fixup stream to be pushed onto
5016 the stack. */
5017 else if (ISLOWER (c))
5018 {
5019 int bits = (c - 'a') * 8;
5020 for (v = 0; c > 'a'; --c)
5021 v = (v << 8) | *fixup++;
5022 if (varname == 'V')
5023 v = sign_extend (v, bits);
5024 push (v);
5025 }
5026
5027 /* A decimal constant. Push it on the stack. */
5028 else if (ISDIGIT (c))
5029 {
5030 v = c - '0';
5031 while (ISDIGIT (*cp))
5032 v = (v * 10) + (*cp++ - '0');
5033 push (v);
5034 }
5035 else
5036 /* An operator. Pop two values from the stack and
5037 use them as operands to the given operation. Push
5038 the result of the operation back on the stack. */
5039 switch (c)
5040 {
5041 case '+':
5042 v = pop ();
5043 v += pop ();
5044 push (v);
5045 break;
5046 case '*':
5047 v = pop ();
5048 v *= pop ();
5049 push (v);
5050 break;
5051 case '<':
5052 v = pop ();
5053 v = pop () << v;
5054 push (v);
5055 break;
5056 default:
5057 abort ();
5058 }
5059 }
5060 while (*cp && *cp != '=');
5061
5062 /* Move over the equal operator. */
5063 cp++;
5064
5065 /* Pop the RHS off the stack. */
5066 c = pop ();
5067
5068 /* Perform the assignment. */
5069 var (varname) = c;
5070
5071 /* Handle side effects. and special 'O' stack cases. */
5072 switch (varname)
5073 {
5074 /* Consume some bytes from the input space. */
5075 case 'L':
5076 offset += c;
5077 break;
5078 /* A symbol to use in the relocation. Make a note
5079 of this if we are not just counting. */
5080 case 'S':
5081 if (! just_count)
5082 rptr->sym_ptr_ptr = &symbols[c];
5083 break;
5084 /* Argument relocation bits for a function call. */
5085 case 'R':
5086 if (! just_count)
5087 {
5088 unsigned int tmp = var ('R');
5089 rptr->addend = 0;
5090
5091 if ((som_hppa_howto_table[op].type == R_PCREL_CALL
5092 && R_PCREL_CALL + 10 > op)
5093 || (som_hppa_howto_table[op].type == R_ABS_CALL
5094 && R_ABS_CALL + 10 > op))
5095 {
5096 /* Simple encoding. */
5097 if (tmp > 4)
5098 {
5099 tmp -= 5;
5100 rptr->addend |= 1;
5101 }
5102 if (tmp == 4)
5103 rptr->addend |= 1 << 8 | 1 << 6 | 1 << 4 | 1 << 2;
5104 else if (tmp == 3)
5105 rptr->addend |= 1 << 8 | 1 << 6 | 1 << 4;
5106 else if (tmp == 2)
5107 rptr->addend |= 1 << 8 | 1 << 6;
5108 else if (tmp == 1)
5109 rptr->addend |= 1 << 8;
5110 }
5111 else
5112 {
5113 unsigned int tmp1, tmp2;
5114
5115 /* First part is easy -- low order two bits are
5116 directly copied, then shifted away. */
5117 rptr->addend = tmp & 0x3;
5118 tmp >>= 2;
5119
5120 /* Diving the result by 10 gives us the second
5121 part. If it is 9, then the first two words
5122 are a double precision paramater, else it is
5123 3 * the first arg bits + the 2nd arg bits. */
5124 tmp1 = tmp / 10;
5125 tmp -= tmp1 * 10;
5126 if (tmp1 == 9)
5127 rptr->addend += (0xe << 6);
5128 else
5129 {
5130 /* Get the two pieces. */
5131 tmp2 = tmp1 / 3;
5132 tmp1 -= tmp2 * 3;
5133 /* Put them in the addend. */
5134 rptr->addend += (tmp2 << 8) + (tmp1 << 6);
5135 }
5136
5137 /* What's left is the third part. It's unpacked
5138 just like the second. */
5139 if (tmp == 9)
5140 rptr->addend += (0xe << 2);
5141 else
5142 {
5143 tmp2 = tmp / 3;
5144 tmp -= tmp2 * 3;
5145 rptr->addend += (tmp2 << 4) + (tmp << 2);
5146 }
5147 }
5148 rptr->addend = HPPA_R_ADDEND (rptr->addend, 0);
5149 }
5150 break;
5151 /* Handle the linker expression stack. */
5152 case 'O':
5153 switch (op)
5154 {
5155 case R_COMP1:
5156 subop = comp1_opcodes;
5157 break;
5158 case R_COMP2:
5159 subop = comp2_opcodes;
5160 break;
5161 case R_COMP3:
5162 subop = comp3_opcodes;
5163 break;
5164 default:
5165 abort ();
5166 }
5167 while (*subop <= (unsigned char) c)
5168 ++subop;
5169 --subop;
5170 break;
5171 /* The lower 32unwind bits must be persistent. */
5172 case 'U':
5173 saved_unwind_bits = var ('U');
5174 break;
5175
5176 default:
5177 break;
5178 }
5179 }
5180
5181 /* If we used a previous fixup, clean up after it. */
5182 if (prev_fixup)
5183 {
5184 fixup = save_fixup + 1;
5185 prev_fixup = 0;
5186 }
5187 /* Queue it. */
5188 else if (fixup > save_fixup + 1)
5189 som_reloc_queue_insert (save_fixup, fixup - save_fixup, reloc_queue);
5190
5191 /* We do not pass R_DATA_OVERRIDE or R_NO_RELOCATION
5192 fixups to BFD. */
5193 if (som_hppa_howto_table[op].type != R_DATA_OVERRIDE
5194 && som_hppa_howto_table[op].type != R_NO_RELOCATION)
5195 {
5196 /* Done with a single reloction. Loop back to the top. */
5197 if (! just_count)
5198 {
5199 if (som_hppa_howto_table[op].type == R_ENTRY)
5200 rptr->addend = var ('T');
5201 else if (som_hppa_howto_table[op].type == R_EXIT)
5202 rptr->addend = var ('U');
5203 else if (som_hppa_howto_table[op].type == R_PCREL_CALL
5204 || som_hppa_howto_table[op].type == R_ABS_CALL)
5205 ;
5206 else if (som_hppa_howto_table[op].type == R_DATA_ONE_SYMBOL)
5207 {
5208 /* Try what was specified in R_DATA_OVERRIDE first
5209 (if anything). Then the hard way using the
5210 section contents. */
5211 rptr->addend = var ('V');
5212
5213 if (rptr->addend == 0 && !section->contents)
5214 {
5215 /* Got to read the damn contents first. We don't
5216 bother saving the contents (yet). Add it one
5217 day if the need arises. */
5218 bfd_byte *contents;
5219 if (!bfd_malloc_and_get_section (section->owner, section,
5220 &contents))
5221 {
5222 free (contents);
5223 return (unsigned) -1;
5224 }
5225 section->contents = contents;
5226 deallocate_contents = 1;
5227 }
5228 else if (rptr->addend == 0)
5229 rptr->addend = bfd_get_32 (section->owner,
5230 (section->contents
5231 + offset - var ('L')));
5232
5233 }
5234 else
5235 rptr->addend = var ('V');
5236 rptr++;
5237 }
5238 count++;
5239 /* Now that we've handled a "full" relocation, reset
5240 some state. */
5241 memset (variables, 0, sizeof (variables));
5242 memset (stack, 0, sizeof (stack));
5243 }
5244 }
5245 if (deallocate_contents)
5246 free (section->contents);
5247
5248 return count;
5249
5250 #undef var
5251 #undef push
5252 #undef pop
5253 #undef emptystack
5254 }
5255
5256 /* Read in the relocs (aka fixups in SOM terms) for a section.
5257
5258 som_get_reloc_upper_bound calls this routine with JUST_COUNT
5259 set to TRUE to indicate it only needs a count of the number
5260 of actual relocations. */
5261
5262 static bfd_boolean
5263 som_slurp_reloc_table (bfd *abfd,
5264 asection *section,
5265 asymbol **symbols,
5266 bfd_boolean just_count)
5267 {
5268 unsigned char *external_relocs;
5269 unsigned int fixup_stream_size;
5270 arelent *internal_relocs;
5271 unsigned int num_relocs;
5272 size_t amt;
5273
5274 fixup_stream_size = som_section_data (section)->reloc_size;
5275 /* If there were no relocations, then there is nothing to do. */
5276 if (section->reloc_count == 0)
5277 return TRUE;
5278
5279 /* If reloc_count is -1, then the relocation stream has not been
5280 parsed. We must do so now to know how many relocations exist. */
5281 if (section->reloc_count == (unsigned) -1)
5282 {
5283 /* Read in the external forms. */
5284 if (bfd_seek (abfd, obj_som_reloc_filepos (abfd) + section->rel_filepos,
5285 SEEK_SET) != 0)
5286 return FALSE;
5287 amt = fixup_stream_size;
5288 external_relocs = _bfd_malloc_and_read (abfd, amt, amt);
5289 if (external_relocs == NULL)
5290 return FALSE;
5291
5292 /* Let callers know how many relocations found.
5293 also save the relocation stream as we will
5294 need it again. */
5295 section->reloc_count = som_set_reloc_info (external_relocs,
5296 fixup_stream_size,
5297 NULL, NULL, NULL, TRUE);
5298
5299 som_section_data (section)->reloc_stream = external_relocs;
5300 }
5301
5302 /* If the caller only wanted a count, then return now. */
5303 if (just_count)
5304 return TRUE;
5305
5306 num_relocs = section->reloc_count;
5307 external_relocs = som_section_data (section)->reloc_stream;
5308 /* Return saved information about the relocations if it is available. */
5309 if (section->relocation != NULL)
5310 return TRUE;
5311
5312 if (_bfd_mul_overflow (num_relocs, sizeof (arelent), &amt))
5313 {
5314 bfd_set_error (bfd_error_file_too_big);
5315 return FALSE;
5316 }
5317 internal_relocs = bfd_zalloc (abfd, amt);
5318 if (internal_relocs == NULL)
5319 return FALSE;
5320
5321 /* Process and internalize the relocations. */
5322 som_set_reloc_info (external_relocs, fixup_stream_size,
5323 internal_relocs, section, symbols, FALSE);
5324
5325 /* We're done with the external relocations. Free them. */
5326 free (external_relocs);
5327 som_section_data (section)->reloc_stream = NULL;
5328
5329 /* Save our results and return success. */
5330 section->relocation = internal_relocs;
5331 return TRUE;
5332 }
5333
5334 /* Return the number of bytes required to store the relocation
5335 information associated with the given section. */
5336
5337 static long
5338 som_get_reloc_upper_bound (bfd *abfd, sec_ptr asect)
5339 {
5340 /* If section has relocations, then read in the relocation stream
5341 and parse it to determine how many relocations exist. */
5342 if (asect->flags & SEC_RELOC)
5343 {
5344 if (! som_slurp_reloc_table (abfd, asect, NULL, TRUE))
5345 return -1;
5346 return (asect->reloc_count + 1) * sizeof (arelent *);
5347 }
5348
5349 /* There are no relocations. Return enough space to hold the
5350 NULL pointer which will be installed if som_canonicalize_reloc
5351 is called. */
5352 return sizeof (arelent *);
5353 }
5354
5355 /* Convert relocations from SOM (external) form into BFD internal
5356 form. Return the number of relocations. */
5357
5358 static long
5359 som_canonicalize_reloc (bfd *abfd,
5360 sec_ptr section,
5361 arelent **relptr,
5362 asymbol **symbols)
5363 {
5364 arelent *tblptr;
5365 int count;
5366
5367 if (! som_slurp_reloc_table (abfd, section, symbols, FALSE))
5368 return -1;
5369
5370 count = section->reloc_count;
5371 tblptr = section->relocation;
5372
5373 while (count--)
5374 *relptr++ = tblptr++;
5375
5376 *relptr = NULL;
5377 return section->reloc_count;
5378 }
5379
5380 extern const bfd_target hppa_som_vec;
5381
5382 /* A hook to set up object file dependent section information. */
5383
5384 static bfd_boolean
5385 som_new_section_hook (bfd *abfd, asection *newsect)
5386 {
5387 if (!newsect->used_by_bfd)
5388 {
5389 size_t amt = sizeof (struct som_section_data_struct);
5390
5391 newsect->used_by_bfd = bfd_zalloc (abfd, amt);
5392 if (!newsect->used_by_bfd)
5393 return FALSE;
5394 }
5395 newsect->alignment_power = 3;
5396
5397 /* We allow more than three sections internally. */
5398 return _bfd_generic_new_section_hook (abfd, newsect);
5399 }
5400
5401 /* Copy any private info we understand from the input symbol
5402 to the output symbol. */
5403
5404 static bfd_boolean
5405 som_bfd_copy_private_symbol_data (bfd *ibfd,
5406 asymbol *isymbol,
5407 bfd *obfd,
5408 asymbol *osymbol)
5409 {
5410 struct som_symbol *input_symbol = (struct som_symbol *) isymbol;
5411 struct som_symbol *output_symbol = (struct som_symbol *) osymbol;
5412
5413 /* One day we may try to grok other private data. */
5414 if (ibfd->xvec->flavour != bfd_target_som_flavour
5415 || obfd->xvec->flavour != bfd_target_som_flavour)
5416 return FALSE;
5417
5418 /* The only private information we need to copy is the argument relocation
5419 bits. */
5420 output_symbol->tc_data.ap.hppa_arg_reloc =
5421 input_symbol->tc_data.ap.hppa_arg_reloc;
5422
5423 return TRUE;
5424 }
5425
5426 /* Copy any private info we understand from the input section
5427 to the output section. */
5428
5429 static bfd_boolean
5430 som_bfd_copy_private_section_data (bfd *ibfd,
5431 asection *isection,
5432 bfd *obfd,
5433 asection *osection)
5434 {
5435 size_t amt;
5436
5437 /* One day we may try to grok other private data. */
5438 if (ibfd->xvec->flavour != bfd_target_som_flavour
5439 || obfd->xvec->flavour != bfd_target_som_flavour
5440 || (!som_is_space (isection) && !som_is_subspace (isection)))
5441 return TRUE;
5442
5443 amt = sizeof (struct som_copyable_section_data_struct);
5444 som_section_data (osection)->copy_data = bfd_zalloc (obfd, amt);
5445 if (som_section_data (osection)->copy_data == NULL)
5446 return FALSE;
5447
5448 memcpy (som_section_data (osection)->copy_data,
5449 som_section_data (isection)->copy_data,
5450 sizeof (struct som_copyable_section_data_struct));
5451
5452 /* Reparent if necessary. */
5453 if (som_section_data (osection)->copy_data->container)
5454 som_section_data (osection)->copy_data->container =
5455 som_section_data (osection)->copy_data->container->output_section;
5456
5457 return TRUE;
5458 }
5459
5460 /* Copy any private info we understand from the input bfd
5461 to the output bfd. */
5462
5463 static bfd_boolean
5464 som_bfd_copy_private_bfd_data (bfd *ibfd, bfd *obfd)
5465 {
5466 /* One day we may try to grok other private data. */
5467 if (ibfd->xvec->flavour != bfd_target_som_flavour
5468 || obfd->xvec->flavour != bfd_target_som_flavour)
5469 return TRUE;
5470
5471 /* Allocate some memory to hold the data we need. */
5472 obj_som_exec_data (obfd) = bfd_zalloc (obfd, (bfd_size_type) sizeof (struct som_exec_data));
5473 if (obj_som_exec_data (obfd) == NULL)
5474 return FALSE;
5475
5476 /* Now copy the data. */
5477 memcpy (obj_som_exec_data (obfd), obj_som_exec_data (ibfd),
5478 sizeof (struct som_exec_data));
5479
5480 return TRUE;
5481 }
5482
5483 /* Display the SOM header. */
5484
5485 static bfd_boolean
5486 som_bfd_print_private_bfd_data (bfd *abfd, void *farg)
5487 {
5488 struct som_exec_auxhdr *exec_header;
5489 struct som_aux_id* auxhdr;
5490 FILE *f;
5491
5492 f = (FILE *) farg;
5493
5494 exec_header = obj_som_exec_hdr (abfd);
5495 if (exec_header)
5496 {
5497 fprintf (f, _("\nExec Auxiliary Header\n"));
5498 fprintf (f, " flags ");
5499 auxhdr = &exec_header->som_auxhdr;
5500 if (auxhdr->mandatory)
5501 fprintf (f, "mandatory ");
5502 if (auxhdr->copy)
5503 fprintf (f, "copy ");
5504 if (auxhdr->append)
5505 fprintf (f, "append ");
5506 if (auxhdr->ignore)
5507 fprintf (f, "ignore ");
5508 fprintf (f, "\n");
5509 fprintf (f, " type %#x\n", auxhdr->type);
5510 fprintf (f, " length %#x\n", auxhdr->length);
5511
5512 /* Note that, depending on the HP-UX version, the following fields can be
5513 either ints, or longs. */
5514
5515 fprintf (f, " text size %#lx\n", (long) exec_header->exec_tsize);
5516 fprintf (f, " text memory offset %#lx\n", (long) exec_header->exec_tmem);
5517 fprintf (f, " text file offset %#lx\n", (long) exec_header->exec_tfile);
5518 fprintf (f, " data size %#lx\n", (long) exec_header->exec_dsize);
5519 fprintf (f, " data memory offset %#lx\n", (long) exec_header->exec_dmem);
5520 fprintf (f, " data file offset %#lx\n", (long) exec_header->exec_dfile);
5521 fprintf (f, " bss size %#lx\n", (long) exec_header->exec_bsize);
5522 fprintf (f, " entry point %#lx\n", (long) exec_header->exec_entry);
5523 fprintf (f, " loader flags %#lx\n", (long) exec_header->exec_flags);
5524 fprintf (f, " bss initializer %#lx\n", (long) exec_header->exec_bfill);
5525 }
5526
5527 return TRUE;
5528 }
5529
5530 /* Set backend info for sections which can not be described
5531 in the BFD data structures. */
5532
5533 bfd_boolean
5534 bfd_som_set_section_attributes (asection *section,
5535 int defined,
5536 int private,
5537 unsigned int sort_key,
5538 int spnum)
5539 {
5540 /* Allocate memory to hold the magic information. */
5541 if (som_section_data (section)->copy_data == NULL)
5542 {
5543 size_t amt = sizeof (struct som_copyable_section_data_struct);
5544
5545 som_section_data (section)->copy_data = bfd_zalloc (section->owner, amt);
5546 if (som_section_data (section)->copy_data == NULL)
5547 return FALSE;
5548 }
5549 som_section_data (section)->copy_data->sort_key = sort_key;
5550 som_section_data (section)->copy_data->is_defined = defined;
5551 som_section_data (section)->copy_data->is_private = private;
5552 som_section_data (section)->copy_data->container = section;
5553 som_section_data (section)->copy_data->space_number = spnum;
5554 return TRUE;
5555 }
5556
5557 /* Set backend info for subsections which can not be described
5558 in the BFD data structures. */
5559
5560 bfd_boolean
5561 bfd_som_set_subsection_attributes (asection *section,
5562 asection *container,
5563 int access_ctr,
5564 unsigned int sort_key,
5565 int quadrant,
5566 int comdat,
5567 int common,
5568 int dup_common)
5569 {
5570 /* Allocate memory to hold the magic information. */
5571 if (som_section_data (section)->copy_data == NULL)
5572 {
5573 size_t amt = sizeof (struct som_copyable_section_data_struct);
5574
5575 som_section_data (section)->copy_data = bfd_zalloc (section->owner, amt);
5576 if (som_section_data (section)->copy_data == NULL)
5577 return FALSE;
5578 }
5579 som_section_data (section)->copy_data->sort_key = sort_key;
5580 som_section_data (section)->copy_data->access_control_bits = access_ctr;
5581 som_section_data (section)->copy_data->quadrant = quadrant;
5582 som_section_data (section)->copy_data->container = container;
5583 som_section_data (section)->copy_data->is_comdat = comdat;
5584 som_section_data (section)->copy_data->is_common = common;
5585 som_section_data (section)->copy_data->dup_common = dup_common;
5586 return TRUE;
5587 }
5588
5589 /* Set the full SOM symbol type. SOM needs far more symbol information
5590 than any other object file format I'm aware of. It is mandatory
5591 to be able to know if a symbol is an entry point, millicode, data,
5592 code, absolute, storage request, or procedure label. If you get
5593 the symbol type wrong your program will not link. */
5594
5595 void
5596 bfd_som_set_symbol_type (asymbol *symbol, unsigned int type)
5597 {
5598 som_symbol_data (symbol)->som_type = type;
5599 }
5600
5601 /* Attach an auxiliary header to the BFD backend so that it may be
5602 written into the object file. */
5603
5604 bfd_boolean
5605 bfd_som_attach_aux_hdr (bfd *abfd, int type, char *string)
5606 {
5607 size_t amt;
5608
5609 if (type == VERSION_AUX_ID)
5610 {
5611 size_t len = strlen (string);
5612 int pad = 0;
5613
5614 if (len % 4)
5615 pad = (4 - (len % 4));
5616 amt = sizeof (struct som_string_auxhdr) + len + pad;
5617 obj_som_version_hdr (abfd) = bfd_zalloc (abfd, amt);
5618 if (!obj_som_version_hdr (abfd))
5619 return FALSE;
5620 obj_som_version_hdr (abfd)->header_id.type = VERSION_AUX_ID;
5621 obj_som_version_hdr (abfd)->header_id.length = 4 + len + pad;
5622 obj_som_version_hdr (abfd)->string_length = len;
5623 memcpy (obj_som_version_hdr (abfd)->string, string, len);
5624 memset (obj_som_version_hdr (abfd)->string + len, 0, pad);
5625 }
5626 else if (type == COPYRIGHT_AUX_ID)
5627 {
5628 size_t len = strlen (string);
5629 int pad = 0;
5630
5631 if (len % 4)
5632 pad = (4 - (len % 4));
5633 amt = sizeof (struct som_string_auxhdr) + len + pad;
5634 obj_som_copyright_hdr (abfd) = bfd_zalloc (abfd, amt);
5635 if (!obj_som_copyright_hdr (abfd))
5636 return FALSE;
5637 obj_som_copyright_hdr (abfd)->header_id.type = COPYRIGHT_AUX_ID;
5638 obj_som_copyright_hdr (abfd)->header_id.length = len + pad + 4;
5639 obj_som_copyright_hdr (abfd)->string_length = len;
5640 memcpy (obj_som_copyright_hdr (abfd)->string, string, len);
5641 memset (obj_som_copyright_hdr (abfd)->string + len, 0, pad);
5642 }
5643 return TRUE;
5644 }
5645
5646 /* Attach a compilation unit header to the BFD backend so that it may be
5647 written into the object file. */
5648
5649 bfd_boolean
5650 bfd_som_attach_compilation_unit (bfd *abfd,
5651 const char *name,
5652 const char *language_name,
5653 const char *product_id,
5654 const char *version_id)
5655 {
5656 struct som_compilation_unit *n;
5657
5658 n = (struct som_compilation_unit *) bfd_zalloc
5659 (abfd, (bfd_size_type) sizeof (*n));
5660 if (n == NULL)
5661 return FALSE;
5662
5663 #define STRDUP(f) \
5664 if (f != NULL) \
5665 { \
5666 n->f.name = bfd_alloc (abfd, (bfd_size_type) strlen (f) + 1); \
5667 if (n->f.name == NULL) \
5668 return FALSE; \
5669 strcpy (n->f.name, f); \
5670 }
5671
5672 STRDUP (name);
5673 STRDUP (language_name);
5674 STRDUP (product_id);
5675 STRDUP (version_id);
5676
5677 #undef STRDUP
5678
5679 obj_som_compilation_unit (abfd) = n;
5680
5681 return TRUE;
5682 }
5683
5684 static bfd_boolean
5685 som_get_section_contents (bfd *abfd,
5686 sec_ptr section,
5687 void *location,
5688 file_ptr offset,
5689 bfd_size_type count)
5690 {
5691 if (count == 0 || ((section->flags & SEC_HAS_CONTENTS) == 0))
5692 return TRUE;
5693 if ((bfd_size_type) (offset+count) > section->size
5694 || bfd_seek (abfd, (file_ptr) (section->filepos + offset), SEEK_SET) != 0
5695 || bfd_bread (location, count, abfd) != count)
5696 return FALSE; /* On error. */
5697 return TRUE;
5698 }
5699
5700 static bfd_boolean
5701 som_set_section_contents (bfd *abfd,
5702 sec_ptr section,
5703 const void *location,
5704 file_ptr offset,
5705 bfd_size_type count)
5706 {
5707 if (! abfd->output_has_begun)
5708 {
5709 /* Set up fixed parts of the file, space, and subspace headers.
5710 Notify the world that output has begun. */
5711 som_prep_headers (abfd);
5712 abfd->output_has_begun = TRUE;
5713 /* Start writing the object file. This include all the string
5714 tables, fixup streams, and other portions of the object file. */
5715 som_begin_writing (abfd);
5716 }
5717
5718 /* Only write subspaces which have "real" contents (eg. the contents
5719 are not generated at run time by the OS). */
5720 if (!som_is_subspace (section)
5721 || ((section->flags & SEC_HAS_CONTENTS) == 0))
5722 return TRUE;
5723
5724 /* Seek to the proper offset within the object file and write the
5725 data. */
5726 offset += som_section_data (section)->subspace_dict->file_loc_init_value;
5727 if (bfd_seek (abfd, offset, SEEK_SET) != 0)
5728 return FALSE;
5729
5730 if (bfd_bwrite (location, count, abfd) != count)
5731 return FALSE;
5732 return TRUE;
5733 }
5734
5735 static bfd_boolean
5736 som_set_arch_mach (bfd *abfd,
5737 enum bfd_architecture arch,
5738 unsigned long machine)
5739 {
5740 /* Allow any architecture to be supported by the SOM backend. */
5741 return bfd_default_set_arch_mach (abfd, arch, machine);
5742 }
5743
5744 static bfd_boolean
5745 som_find_nearest_line (bfd *abfd,
5746 asymbol **symbols,
5747 asection *section,
5748 bfd_vma offset,
5749 const char **filename_ptr,
5750 const char **functionname_ptr,
5751 unsigned int *line_ptr,
5752 unsigned int *discriminator_ptr)
5753 {
5754 bfd_boolean found;
5755 asymbol *func;
5756 bfd_vma low_func;
5757 asymbol **p;
5758
5759 if (discriminator_ptr)
5760 *discriminator_ptr = 0;
5761
5762 if (! _bfd_stab_section_find_nearest_line (abfd, symbols, section, offset,
5763 & found, filename_ptr,
5764 functionname_ptr, line_ptr,
5765 & somdata (abfd).line_info))
5766 return FALSE;
5767
5768 if (found)
5769 return TRUE;
5770
5771 if (symbols == NULL)
5772 return FALSE;
5773
5774 /* Fallback: find function name from symbols table. */
5775 func = NULL;
5776 low_func = 0;
5777
5778 for (p = symbols; *p != NULL; p++)
5779 {
5780 som_symbol_type *q = (som_symbol_type *) *p;
5781
5782 if (q->som_type == SYMBOL_TYPE_ENTRY
5783 && q->symbol.section == section
5784 && q->symbol.value >= low_func
5785 && q->symbol.value <= offset)
5786 {
5787 func = (asymbol *) q;
5788 low_func = q->symbol.value;
5789 }
5790 }
5791
5792 if (func == NULL)
5793 return FALSE;
5794
5795 *filename_ptr = NULL;
5796 *functionname_ptr = bfd_asymbol_name (func);
5797 *line_ptr = 0;
5798
5799 return TRUE;
5800 }
5801
5802 static int
5803 som_sizeof_headers (bfd *abfd ATTRIBUTE_UNUSED,
5804 struct bfd_link_info *info ATTRIBUTE_UNUSED)
5805 {
5806 _bfd_error_handler (_("som_sizeof_headers unimplemented"));
5807 abort ();
5808 return 0;
5809 }
5810
5811 /* Return the single-character symbol type corresponding to
5812 SOM section S, or '?' for an unknown SOM section. */
5813
5814 static char
5815 som_section_type (const char *s)
5816 {
5817 const struct section_to_type *t;
5818
5819 for (t = &stt[0]; t->section; t++)
5820 if (!strcmp (s, t->section))
5821 return t->type;
5822 return '?';
5823 }
5824
5825 static int
5826 som_decode_symclass (asymbol *symbol)
5827 {
5828 char c;
5829
5830 if (bfd_is_com_section (symbol->section))
5831 return 'C';
5832 if (bfd_is_und_section (symbol->section))
5833 {
5834 if (symbol->flags & BSF_WEAK)
5835 {
5836 /* If weak, determine if it's specifically an object
5837 or non-object weak. */
5838 if (symbol->flags & BSF_OBJECT)
5839 return 'v';
5840 else
5841 return 'w';
5842 }
5843 else
5844 return 'U';
5845 }
5846 if (bfd_is_ind_section (symbol->section))
5847 return 'I';
5848 if (symbol->flags & BSF_WEAK)
5849 {
5850 /* If weak, determine if it's specifically an object
5851 or non-object weak. */
5852 if (symbol->flags & BSF_OBJECT)
5853 return 'V';
5854 else
5855 return 'W';
5856 }
5857 if (!(symbol->flags & (BSF_GLOBAL | BSF_LOCAL)))
5858 return '?';
5859
5860 if (bfd_is_abs_section (symbol->section)
5861 || (som_symbol_data (symbol) != NULL
5862 && som_symbol_data (symbol)->som_type == SYMBOL_TYPE_ABSOLUTE))
5863 c = 'a';
5864 else if (symbol->section)
5865 c = som_section_type (symbol->section->name);
5866 else
5867 return '?';
5868 if (symbol->flags & BSF_GLOBAL)
5869 c = TOUPPER (c);
5870 return c;
5871 }
5872
5873 /* Return information about SOM symbol SYMBOL in RET. */
5874
5875 static void
5876 som_get_symbol_info (bfd *ignore_abfd ATTRIBUTE_UNUSED,
5877 asymbol *symbol,
5878 symbol_info *ret)
5879 {
5880 ret->type = som_decode_symclass (symbol);
5881 if (ret->type != 'U')
5882 ret->value = symbol->value + symbol->section->vma;
5883 else
5884 ret->value = 0;
5885 ret->name = symbol->name;
5886 }
5887
5888 /* Count the number of symbols in the archive symbol table. Necessary
5889 so that we can allocate space for all the carsyms at once. */
5890
5891 static bfd_boolean
5892 som_bfd_count_ar_symbols (bfd *abfd,
5893 struct som_lst_header *lst_header,
5894 symindex *count)
5895 {
5896 unsigned int i;
5897 unsigned char *hash_table;
5898 size_t amt;
5899 file_ptr lst_filepos;
5900
5901 lst_filepos = bfd_tell (abfd) - sizeof (struct som_external_lst_header);
5902
5903 /* Read in the hash table. The hash table is an array of 32-bit
5904 file offsets which point to the hash chains. */
5905 if (_bfd_mul_overflow (lst_header->hash_size, 4, &amt))
5906 {
5907 bfd_set_error (bfd_error_file_too_big);
5908 return FALSE;
5909 }
5910 hash_table = _bfd_malloc_and_read (abfd, amt, amt);
5911 if (hash_table == NULL && lst_header->hash_size != 0)
5912 goto error_return;
5913
5914 /* Don't forget to initialize the counter! */
5915 *count = 0;
5916
5917 /* Walk each chain counting the number of symbols found on that particular
5918 chain. */
5919 for (i = 0; i < lst_header->hash_size; i++)
5920 {
5921 struct som_external_lst_symbol_record ext_lst_symbol;
5922 unsigned int hash_val = bfd_getb32 (hash_table + 4 * i);
5923
5924 /* An empty chain has zero as it's file offset. */
5925 if (hash_val == 0)
5926 continue;
5927
5928 /* Seek to the first symbol in this hash chain. */
5929 if (bfd_seek (abfd, lst_filepos + hash_val, SEEK_SET) != 0)
5930 goto error_return;
5931
5932 /* Read in this symbol and update the counter. */
5933 amt = sizeof (ext_lst_symbol);
5934 if (bfd_bread ((void *) &ext_lst_symbol, amt, abfd) != amt)
5935 goto error_return;
5936
5937 (*count)++;
5938
5939 /* Now iterate through the rest of the symbols on this chain. */
5940 while (1)
5941 {
5942 unsigned int next_entry = bfd_getb32 (ext_lst_symbol.next_entry);
5943
5944 if (next_entry == 0)
5945 break;
5946
5947 /* Assume symbols on a chain are in increasing file offset
5948 order. Otherwise we can loop here with fuzzed input. */
5949 if (next_entry < hash_val + sizeof (ext_lst_symbol))
5950 {
5951 bfd_set_error (bfd_error_bad_value);
5952 goto error_return;
5953 }
5954 hash_val = next_entry;
5955
5956 /* Seek to the next symbol. */
5957 if (bfd_seek (abfd, lst_filepos + next_entry, SEEK_SET) != 0)
5958 goto error_return;
5959
5960 /* Read the symbol in and update the counter. */
5961 amt = sizeof (ext_lst_symbol);
5962 if (bfd_bread ((void *) &ext_lst_symbol, amt, abfd) != amt)
5963 goto error_return;
5964
5965 (*count)++;
5966 }
5967 }
5968 free (hash_table);
5969 return TRUE;
5970
5971 error_return:
5972 free (hash_table);
5973 return FALSE;
5974 }
5975
5976 /* Fill in the canonical archive symbols (SYMS) from the archive described
5977 by ABFD and LST_HEADER. */
5978
5979 static bfd_boolean
5980 som_bfd_fill_in_ar_symbols (bfd *abfd,
5981 struct som_lst_header *lst_header,
5982 carsym **syms)
5983 {
5984 unsigned int i;
5985 carsym *set = syms[0];
5986 unsigned char *hash_table;
5987 struct som_external_som_entry *som_dict = NULL;
5988 size_t amt;
5989 file_ptr lst_filepos;
5990 unsigned int string_loc;
5991
5992 lst_filepos = bfd_tell (abfd) - sizeof (struct som_external_lst_header);
5993
5994 /* Read in the hash table. The has table is an array of 32bit file offsets
5995 which point to the hash chains. */
5996 if (_bfd_mul_overflow (lst_header->hash_size, 4, &amt))
5997 {
5998 bfd_set_error (bfd_error_file_too_big);
5999 return FALSE;
6000 }
6001 hash_table = _bfd_malloc_and_read (abfd, amt, amt);
6002 if (hash_table == NULL && lst_header->hash_size != 0)
6003 goto error_return;
6004
6005 /* Seek to and read in the SOM dictionary. We will need this to fill
6006 in the carsym's filepos field. */
6007 if (bfd_seek (abfd, lst_filepos + lst_header->dir_loc, SEEK_SET) != 0)
6008 goto error_return;
6009
6010 if (_bfd_mul_overflow (lst_header->module_count,
6011 sizeof (struct som_external_som_entry), &amt))
6012 {
6013 bfd_set_error (bfd_error_file_too_big);
6014 goto error_return;
6015 }
6016 som_dict = (struct som_external_som_entry *)
6017 _bfd_malloc_and_read (abfd, amt, amt);
6018 if (som_dict == NULL && lst_header->module_count != 0)
6019 goto error_return;
6020
6021 string_loc = lst_header->string_loc;
6022
6023 /* Walk each chain filling in the carsyms as we go along. */
6024 for (i = 0; i < lst_header->hash_size; i++)
6025 {
6026 struct som_external_lst_symbol_record lst_symbol;
6027 unsigned int hash_val;
6028 size_t len;
6029 unsigned char ext_len[4];
6030 char *name;
6031 unsigned int ndx;
6032
6033 /* An empty chain has zero as it's file offset. */
6034 hash_val = bfd_getb32 (hash_table + 4 * i);
6035 if (hash_val == 0)
6036 continue;
6037
6038 /* Seek to and read the first symbol on the chain. */
6039 if (bfd_seek (abfd, lst_filepos + hash_val, SEEK_SET) != 0)
6040 goto error_return;
6041
6042 amt = sizeof (lst_symbol);
6043 if (bfd_bread ((void *) &lst_symbol, amt, abfd) != amt)
6044 goto error_return;
6045
6046 /* Get the name of the symbol, first get the length which is stored
6047 as a 32bit integer just before the symbol.
6048
6049 One might ask why we don't just read in the entire string table
6050 and index into it. Well, according to the SOM ABI the string
6051 index can point *anywhere* in the archive to save space, so just
6052 using the string table would not be safe. */
6053 if (bfd_seek (abfd, (lst_filepos + string_loc
6054 + bfd_getb32 (lst_symbol.name) - 4), SEEK_SET) != 0)
6055 goto error_return;
6056
6057 if (bfd_bread (&ext_len, (bfd_size_type) 4, abfd) != 4)
6058 goto error_return;
6059 len = bfd_getb32 (ext_len);
6060
6061 /* Allocate space for the name and null terminate it too. */
6062 if (len == (size_t) -1)
6063 {
6064 bfd_set_error (bfd_error_no_memory);
6065 goto error_return;
6066 }
6067 name = (char *) _bfd_alloc_and_read (abfd, len + 1, len);
6068 if (!name)
6069 goto error_return;
6070 name[len] = 0;
6071 set->name = name;
6072
6073 /* Fill in the file offset. Note that the "location" field points
6074 to the SOM itself, not the ar_hdr in front of it. */
6075 ndx = bfd_getb32 (lst_symbol.som_index);
6076 if (ndx >= lst_header->module_count)
6077 {
6078 bfd_set_error (bfd_error_bad_value);
6079 goto error_return;
6080 }
6081 set->file_offset
6082 = bfd_getb32 (som_dict[ndx].location) - sizeof (struct ar_hdr);
6083
6084 /* Go to the next symbol. */
6085 set++;
6086
6087 /* Iterate through the rest of the chain. */
6088 while (1)
6089 {
6090 unsigned int next_entry = bfd_getb32 (lst_symbol.next_entry);
6091
6092 if (next_entry == 0)
6093 break;
6094
6095 /* Seek to the next symbol and read it in. */
6096 if (bfd_seek (abfd, lst_filepos + next_entry, SEEK_SET) != 0)
6097 goto error_return;
6098
6099 amt = sizeof (lst_symbol);
6100 if (bfd_bread ((void *) &lst_symbol, amt, abfd) != amt)
6101 goto error_return;
6102
6103 /* Seek to the name length & string and read them in. */
6104 if (bfd_seek (abfd, lst_filepos + string_loc
6105 + bfd_getb32 (lst_symbol.name) - 4, SEEK_SET) != 0)
6106 goto error_return;
6107
6108 if (bfd_bread (&ext_len, (bfd_size_type) 4, abfd) != 4)
6109 goto error_return;
6110 len = bfd_getb32 (ext_len);
6111
6112 /* Allocate space for the name and null terminate it too. */
6113 if (len == (size_t) -1)
6114 {
6115 bfd_set_error (bfd_error_no_memory);
6116 goto error_return;
6117 }
6118 name = (char *) _bfd_alloc_and_read (abfd, len + 1, len);
6119 if (!name)
6120 goto error_return;
6121 name[len] = 0;
6122 set->name = name;
6123
6124 /* Fill in the file offset. Note that the "location" field points
6125 to the SOM itself, not the ar_hdr in front of it. */
6126 ndx = bfd_getb32 (lst_symbol.som_index);
6127 if (ndx >= lst_header->module_count)
6128 {
6129 bfd_set_error (bfd_error_bad_value);
6130 goto error_return;
6131 }
6132 set->file_offset
6133 = bfd_getb32 (som_dict[ndx].location) - sizeof (struct ar_hdr);
6134
6135 /* Go on to the next symbol. */
6136 set++;
6137 }
6138 }
6139 /* If we haven't died by now, then we successfully read the entire
6140 archive symbol table. */
6141 free (hash_table);
6142 free (som_dict);
6143 return TRUE;
6144
6145 error_return:
6146 free (hash_table);
6147 free (som_dict);
6148 return FALSE;
6149 }
6150
6151 /* Read in the LST from the archive. */
6152
6153 static bfd_boolean
6154 som_slurp_armap (bfd *abfd)
6155 {
6156 struct som_external_lst_header ext_lst_header;
6157 struct som_lst_header lst_header;
6158 struct ar_hdr ar_header;
6159 unsigned int parsed_size;
6160 struct artdata *ardata = bfd_ardata (abfd);
6161 char nextname[17];
6162 size_t amt = 16;
6163 int i = bfd_bread ((void *) nextname, amt, abfd);
6164
6165 /* Special cases. */
6166 if (i == 0)
6167 return TRUE;
6168 if (i != 16)
6169 return FALSE;
6170
6171 if (bfd_seek (abfd, (file_ptr) -16, SEEK_CUR) != 0)
6172 return FALSE;
6173
6174 /* For archives without .o files there is no symbol table. */
6175 if (! CONST_STRNEQ (nextname, "/ "))
6176 {
6177 abfd->has_armap = FALSE;
6178 return TRUE;
6179 }
6180
6181 /* Read in and sanity check the archive header. */
6182 amt = sizeof (struct ar_hdr);
6183 if (bfd_bread ((void *) &ar_header, amt, abfd) != amt)
6184 return FALSE;
6185
6186 if (strncmp (ar_header.ar_fmag, ARFMAG, 2))
6187 {
6188 bfd_set_error (bfd_error_malformed_archive);
6189 return FALSE;
6190 }
6191
6192 /* How big is the archive symbol table entry? */
6193 errno = 0;
6194 parsed_size = strtol (ar_header.ar_size, NULL, 10);
6195 if (errno != 0)
6196 {
6197 bfd_set_error (bfd_error_malformed_archive);
6198 return FALSE;
6199 }
6200
6201 /* Save off the file offset of the first real user data. */
6202 ardata->first_file_filepos = bfd_tell (abfd) + parsed_size;
6203
6204 /* Read in the library symbol table. We'll make heavy use of this
6205 in just a minute. */
6206 amt = sizeof (struct som_external_lst_header);
6207 if (bfd_bread ((void *) &ext_lst_header, amt, abfd) != amt)
6208 return FALSE;
6209
6210 som_swap_lst_header_in (&ext_lst_header, &lst_header);
6211
6212 /* Sanity check. */
6213 if (lst_header.a_magic != LIBMAGIC)
6214 {
6215 bfd_set_error (bfd_error_malformed_archive);
6216 return FALSE;
6217 }
6218
6219 /* Count the number of symbols in the library symbol table. */
6220 if (! som_bfd_count_ar_symbols (abfd, &lst_header, &ardata->symdef_count))
6221 return FALSE;
6222
6223 /* Get back to the start of the library symbol table. */
6224 if (bfd_seek (abfd, (ardata->first_file_filepos - parsed_size
6225 + sizeof (struct som_external_lst_header)),
6226 SEEK_SET) != 0)
6227 return FALSE;
6228
6229 /* Initialize the cache and allocate space for the library symbols. */
6230 ardata->cache = 0;
6231 if (_bfd_mul_overflow (ardata->symdef_count, sizeof (carsym), &amt))
6232 {
6233 bfd_set_error (bfd_error_file_too_big);
6234 return FALSE;
6235 }
6236 ardata->symdefs = bfd_alloc (abfd, amt);
6237 if (!ardata->symdefs)
6238 return FALSE;
6239
6240 /* Now fill in the canonical archive symbols. */
6241 if (! som_bfd_fill_in_ar_symbols (abfd, &lst_header, &ardata->symdefs))
6242 return FALSE;
6243
6244 /* Seek back to the "first" file in the archive. Note the "first"
6245 file may be the extended name table. */
6246 if (bfd_seek (abfd, ardata->first_file_filepos, SEEK_SET) != 0)
6247 return FALSE;
6248
6249 /* Notify the generic archive code that we have a symbol map. */
6250 abfd->has_armap = TRUE;
6251 return TRUE;
6252 }
6253
6254 /* Begin preparing to write a SOM library symbol table.
6255
6256 As part of the prep work we need to determine the number of symbols
6257 and the size of the associated string section. */
6258
6259 static bfd_boolean
6260 som_bfd_prep_for_ar_write (bfd *abfd,
6261 unsigned int *num_syms,
6262 unsigned int *stringsize)
6263 {
6264 bfd *curr_bfd = abfd->archive_head;
6265
6266 /* Some initialization. */
6267 *num_syms = 0;
6268 *stringsize = 0;
6269
6270 /* Iterate over each BFD within this archive. */
6271 while (curr_bfd != NULL)
6272 {
6273 unsigned int curr_count, i;
6274 som_symbol_type *sym;
6275
6276 /* Don't bother for non-SOM objects. */
6277 if (curr_bfd->format != bfd_object
6278 || curr_bfd->xvec->flavour != bfd_target_som_flavour)
6279 {
6280 curr_bfd = curr_bfd->archive_next;
6281 continue;
6282 }
6283
6284 /* Make sure the symbol table has been read, then snag a pointer
6285 to it. It's a little slimey to grab the symbols via obj_som_symtab,
6286 but doing so avoids allocating lots of extra memory. */
6287 if (! som_slurp_symbol_table (curr_bfd))
6288 return FALSE;
6289
6290 sym = obj_som_symtab (curr_bfd);
6291 curr_count = bfd_get_symcount (curr_bfd);
6292
6293 /* Examine each symbol to determine if it belongs in the
6294 library symbol table. */
6295 for (i = 0; i < curr_count; i++, sym++)
6296 {
6297 struct som_misc_symbol_info info;
6298
6299 /* Derive SOM information from the BFD symbol. */
6300 som_bfd_derive_misc_symbol_info (curr_bfd, &sym->symbol, &info);
6301
6302 /* Should we include this symbol? */
6303 if (info.symbol_type == ST_NULL
6304 || info.symbol_type == ST_SYM_EXT
6305 || info.symbol_type == ST_ARG_EXT)
6306 continue;
6307
6308 /* Only global symbols and unsatisfied commons. */
6309 if (info.symbol_scope != SS_UNIVERSAL
6310 && info.symbol_type != ST_STORAGE)
6311 continue;
6312
6313 /* Do no include undefined symbols. */
6314 if (bfd_is_und_section (sym->symbol.section))
6315 continue;
6316
6317 /* Bump the various counters, being careful to honor
6318 alignment considerations in the string table. */
6319 (*num_syms)++;
6320 *stringsize += strlen (sym->symbol.name) + 5;
6321 while (*stringsize % 4)
6322 (*stringsize)++;
6323 }
6324
6325 curr_bfd = curr_bfd->archive_next;
6326 }
6327 return TRUE;
6328 }
6329
6330 /* Hash a symbol name based on the hashing algorithm presented in the
6331 SOM ABI. */
6332
6333 static unsigned int
6334 som_bfd_ar_symbol_hash (asymbol *symbol)
6335 {
6336 unsigned int len = strlen (symbol->name);
6337
6338 /* Names with length 1 are special. */
6339 if (len == 1)
6340 return 0x1000100 | (symbol->name[0] << 16) | symbol->name[0];
6341
6342 return ((len & 0x7f) << 24) | (symbol->name[1] << 16)
6343 | (symbol->name[len - 2] << 8) | symbol->name[len - 1];
6344 }
6345
6346 /* Do the bulk of the work required to write the SOM library
6347 symbol table. */
6348
6349 static bfd_boolean
6350 som_bfd_ar_write_symbol_stuff (bfd *abfd,
6351 unsigned int nsyms,
6352 unsigned int string_size,
6353 struct som_external_lst_header lst,
6354 unsigned elength)
6355 {
6356 char *strings = NULL, *p;
6357 struct som_external_lst_symbol_record *lst_syms = NULL, *curr_lst_sym;
6358 bfd *curr_bfd;
6359 unsigned char *hash_table = NULL;
6360 struct som_external_som_entry *som_dict = NULL;
6361 struct som_external_lst_symbol_record **last_hash_entry = NULL;
6362 unsigned int curr_som_offset, som_index = 0;
6363 size_t amt;
6364 unsigned int module_count;
6365 unsigned int hash_size;
6366
6367 hash_size = bfd_getb32 (lst.hash_size);
6368 if (_bfd_mul_overflow (hash_size, 4, &amt))
6369 {
6370 bfd_set_error (bfd_error_no_memory);
6371 return FALSE;
6372 }
6373 hash_table = bfd_zmalloc (amt);
6374 if (hash_table == NULL && hash_size != 0)
6375 goto error_return;
6376
6377 module_count = bfd_getb32 (lst.module_count);
6378 if (_bfd_mul_overflow (module_count,
6379 sizeof (struct som_external_som_entry), &amt))
6380 {
6381 bfd_set_error (bfd_error_no_memory);
6382 goto error_return;
6383 }
6384 som_dict = bfd_zmalloc (amt);
6385 if (som_dict == NULL && module_count != 0)
6386 goto error_return;
6387
6388 if (_bfd_mul_overflow (hash_size,
6389 sizeof (struct som_external_lst_symbol_record *),
6390 &amt))
6391 {
6392 bfd_set_error (bfd_error_no_memory);
6393 goto error_return;
6394 }
6395 last_hash_entry = bfd_zmalloc (amt);
6396 if (last_hash_entry == NULL && hash_size != 0)
6397 goto error_return;
6398
6399 /* Symbols have som_index fields, so we have to keep track of the
6400 index of each SOM in the archive.
6401
6402 The SOM dictionary has (among other things) the absolute file
6403 position for the SOM which a particular dictionary entry
6404 describes. We have to compute that information as we iterate
6405 through the SOMs/symbols. */
6406 som_index = 0;
6407
6408 /* We add in the size of the archive header twice as the location
6409 in the SOM dictionary is the actual offset of the SOM, not the
6410 archive header before the SOM. */
6411 curr_som_offset = 8 + 2 * sizeof (struct ar_hdr) + bfd_getb32 (lst.file_end);
6412
6413 /* Make room for the archive header and the contents of the
6414 extended string table. Note that elength includes the size
6415 of the archive header for the extended name table! */
6416 if (elength)
6417 curr_som_offset += elength;
6418
6419 /* Make sure we're properly aligned. */
6420 curr_som_offset = (curr_som_offset + 0x1) & ~0x1;
6421
6422 /* FIXME should be done with buffers just like everything else... */
6423 if (_bfd_mul_overflow (nsyms,
6424 sizeof (struct som_external_lst_symbol_record), &amt))
6425 {
6426 bfd_set_error (bfd_error_no_memory);
6427 goto error_return;
6428 }
6429 lst_syms = bfd_malloc (amt);
6430 if (lst_syms == NULL && nsyms != 0)
6431 goto error_return;
6432 strings = bfd_malloc (string_size);
6433 if (strings == NULL && string_size != 0)
6434 goto error_return;
6435
6436 p = strings;
6437 curr_lst_sym = lst_syms;
6438
6439 curr_bfd = abfd->archive_head;
6440 while (curr_bfd != NULL)
6441 {
6442 unsigned int curr_count, i;
6443 som_symbol_type *sym;
6444
6445 /* Don't bother for non-SOM objects. */
6446 if (curr_bfd->format != bfd_object
6447 || curr_bfd->xvec->flavour != bfd_target_som_flavour)
6448 {
6449 curr_bfd = curr_bfd->archive_next;
6450 continue;
6451 }
6452
6453 /* Make sure the symbol table has been read, then snag a pointer
6454 to it. It's a little slimey to grab the symbols via obj_som_symtab,
6455 but doing so avoids allocating lots of extra memory. */
6456 if (! som_slurp_symbol_table (curr_bfd))
6457 goto error_return;
6458
6459 sym = obj_som_symtab (curr_bfd);
6460 curr_count = bfd_get_symcount (curr_bfd);
6461
6462 for (i = 0; i < curr_count; i++, sym++)
6463 {
6464 struct som_misc_symbol_info info;
6465 struct som_external_lst_symbol_record *last;
6466 unsigned int symbol_pos;
6467 unsigned int slen;
6468 unsigned int symbol_key;
6469 unsigned int flags;
6470
6471 /* Derive SOM information from the BFD symbol. */
6472 som_bfd_derive_misc_symbol_info (curr_bfd, &sym->symbol, &info);
6473
6474 /* Should we include this symbol? */
6475 if (info.symbol_type == ST_NULL
6476 || info.symbol_type == ST_SYM_EXT
6477 || info.symbol_type == ST_ARG_EXT)
6478 continue;
6479
6480 /* Only global symbols and unsatisfied commons. */
6481 if (info.symbol_scope != SS_UNIVERSAL
6482 && info.symbol_type != ST_STORAGE)
6483 continue;
6484
6485 /* Do no include undefined symbols. */
6486 if (bfd_is_und_section (sym->symbol.section))
6487 continue;
6488
6489 /* If this is the first symbol from this SOM, then update
6490 the SOM dictionary too. */
6491 if (bfd_getb32 (som_dict[som_index].location) == 0)
6492 {
6493 bfd_putb32 (curr_som_offset, som_dict[som_index].location);
6494 bfd_putb32 (arelt_size (curr_bfd), som_dict[som_index].length);
6495 }
6496
6497 symbol_key = som_bfd_ar_symbol_hash (&sym->symbol);
6498
6499 /* Fill in the lst symbol record. */
6500 flags = 0;
6501 if (info.secondary_def)
6502 flags |= LST_SYMBOL_SECONDARY_DEF;
6503 flags |= info.symbol_type << LST_SYMBOL_SYMBOL_TYPE_SH;
6504 flags |= info.symbol_scope << LST_SYMBOL_SYMBOL_SCOPE_SH;
6505 if (bfd_is_com_section (sym->symbol.section))
6506 flags |= LST_SYMBOL_IS_COMMON;
6507 if (info.dup_common)
6508 flags |= LST_SYMBOL_DUP_COMMON;
6509 flags |= 3 << LST_SYMBOL_XLEAST_SH;
6510 flags |= info.arg_reloc << LST_SYMBOL_ARG_RELOC_SH;
6511 bfd_putb32 (flags, curr_lst_sym->flags);
6512 bfd_putb32 (p - strings + 4, curr_lst_sym->name);
6513 bfd_putb32 (0, curr_lst_sym->qualifier_name);
6514 bfd_putb32 (info.symbol_info, curr_lst_sym->symbol_info);
6515 bfd_putb32 (info.symbol_value | info.priv_level,
6516 curr_lst_sym->symbol_value);
6517 bfd_putb32 (0, curr_lst_sym->symbol_descriptor);
6518 curr_lst_sym->reserved = 0;
6519 bfd_putb32 (som_index, curr_lst_sym->som_index);
6520 bfd_putb32 (symbol_key, curr_lst_sym->symbol_key);
6521 bfd_putb32 (0, curr_lst_sym->next_entry);
6522
6523 /* Insert into the hash table. */
6524 symbol_pos =
6525 (curr_lst_sym - lst_syms)
6526 * sizeof (struct som_external_lst_symbol_record)
6527 + hash_size * 4
6528 + module_count * sizeof (struct som_external_som_entry)
6529 + sizeof (struct som_external_lst_header);
6530 last = last_hash_entry[symbol_key % hash_size];
6531 if (last != NULL)
6532 {
6533 /* There is already something at the head of this hash chain,
6534 so tack this symbol onto the end of the chain. */
6535 bfd_putb32 (symbol_pos, last->next_entry);
6536 }
6537 else
6538 /* First entry in this hash chain. */
6539 bfd_putb32 (symbol_pos, hash_table + 4 * (symbol_key % hash_size));
6540
6541 /* Keep track of the last symbol we added to this chain so we can
6542 easily update its next_entry pointer. */
6543 last_hash_entry[symbol_key % hash_size] = curr_lst_sym;
6544
6545 /* Update the string table. */
6546 slen = strlen (sym->symbol.name);
6547 bfd_put_32 (abfd, slen, p);
6548 p += 4;
6549 slen++; /* Nul terminator. */
6550 memcpy (p, sym->symbol.name, slen);
6551 p += slen;
6552 while (slen % 4)
6553 {
6554 bfd_put_8 (abfd, 0, p);
6555 p++;
6556 slen++;
6557 }
6558 BFD_ASSERT (p <= strings + string_size);
6559
6560 /* Head to the next symbol. */
6561 curr_lst_sym++;
6562 }
6563
6564 /* Keep track of where each SOM will finally reside; then look
6565 at the next BFD. */
6566 curr_som_offset += arelt_size (curr_bfd) + sizeof (struct ar_hdr);
6567
6568 /* A particular object in the archive may have an odd length; the
6569 linker requires objects begin on an even boundary. So round
6570 up the current offset as necessary. */
6571 curr_som_offset = (curr_som_offset + 0x1) &~ (unsigned) 1;
6572 curr_bfd = curr_bfd->archive_next;
6573 som_index++;
6574 }
6575
6576 /* Now scribble out the hash table. */
6577 amt = (size_t) hash_size * 4;
6578 if (bfd_bwrite ((void *) hash_table, amt, abfd) != amt)
6579 goto error_return;
6580
6581 /* Then the SOM dictionary. */
6582 amt = (size_t) module_count * sizeof (struct som_external_som_entry);
6583 if (bfd_bwrite ((void *) som_dict, amt, abfd) != amt)
6584 goto error_return;
6585
6586 /* The library symbols. */
6587 amt = (size_t) nsyms * sizeof (struct som_external_lst_symbol_record);
6588 if (bfd_bwrite ((void *) lst_syms, amt, abfd) != amt)
6589 goto error_return;
6590
6591 /* And finally the strings. */
6592 amt = string_size;
6593 if (bfd_bwrite ((void *) strings, amt, abfd) != amt)
6594 goto error_return;
6595
6596 free (hash_table);
6597 free (som_dict);
6598 free (last_hash_entry);
6599 free (lst_syms);
6600 free (strings);
6601 return TRUE;
6602
6603 error_return:
6604 free (hash_table);
6605 free (som_dict);
6606 free (last_hash_entry);
6607 free (lst_syms);
6608 free (strings);
6609
6610 return FALSE;
6611 }
6612
6613 /* Write out the LST for the archive.
6614
6615 You'll never believe this is really how armaps are handled in SOM... */
6616
6617 static bfd_boolean
6618 som_write_armap (bfd *abfd,
6619 unsigned int elength,
6620 struct orl *map ATTRIBUTE_UNUSED,
6621 unsigned int orl_count ATTRIBUTE_UNUSED,
6622 int stridx ATTRIBUTE_UNUSED)
6623 {
6624 bfd *curr_bfd;
6625 struct stat statbuf;
6626 unsigned int i, lst_size, nsyms, stringsize;
6627 struct ar_hdr hdr;
6628 struct som_external_lst_header lst;
6629 unsigned char *p;
6630 size_t amt;
6631 unsigned int csum;
6632 unsigned int module_count;
6633
6634 /* We'll use this for the archive's date and mode later. */
6635 if (stat (bfd_get_filename (abfd), &statbuf) != 0)
6636 {
6637 bfd_set_error (bfd_error_system_call);
6638 return FALSE;
6639 }
6640 /* Fudge factor. */
6641 bfd_ardata (abfd)->armap_timestamp = statbuf.st_mtime + 60;
6642
6643 /* Account for the lst header first. */
6644 lst_size = sizeof (struct som_external_lst_header);
6645
6646 /* Start building the LST header. */
6647 /* FIXME: Do we need to examine each element to determine the
6648 largest id number? */
6649 bfd_putb16 (CPU_PA_RISC1_0, &lst.system_id);
6650 bfd_putb16 (LIBMAGIC, &lst.a_magic);
6651 bfd_putb32 (VERSION_ID, &lst.version_id);
6652 bfd_putb32 (0, &lst.file_time.secs);
6653 bfd_putb32 (0, &lst.file_time.nanosecs);
6654
6655 bfd_putb32 (lst_size, &lst.hash_loc);
6656 bfd_putb32 (SOM_LST_HASH_SIZE, &lst.hash_size);
6657
6658 /* Hash table is a SOM_LST_HASH_SIZE 32bit offsets. */
6659 lst_size += 4 * SOM_LST_HASH_SIZE;
6660
6661 /* We need to count the number of SOMs in this archive. */
6662 curr_bfd = abfd->archive_head;
6663 module_count = 0;
6664 while (curr_bfd != NULL)
6665 {
6666 /* Only true SOM objects count. */
6667 if (curr_bfd->format == bfd_object
6668 && curr_bfd->xvec->flavour == bfd_target_som_flavour)
6669 module_count++;
6670 curr_bfd = curr_bfd->archive_next;
6671 }
6672 bfd_putb32 (module_count, &lst.module_count);
6673 bfd_putb32 (module_count, &lst.module_limit);
6674 bfd_putb32 (lst_size, &lst.dir_loc);
6675 lst_size += sizeof (struct som_external_som_entry) * module_count;
6676
6677 /* We don't support import/export tables, auxiliary headers,
6678 or free lists yet. Make the linker work a little harder
6679 to make our life easier. */
6680
6681 bfd_putb32 (0, &lst.export_loc);
6682 bfd_putb32 (0, &lst.export_count);
6683 bfd_putb32 (0, &lst.import_loc);
6684 bfd_putb32 (0, &lst.aux_loc);
6685 bfd_putb32 (0, &lst.aux_size);
6686
6687 /* Count how many symbols we will have on the hash chains and the
6688 size of the associated string table. */
6689 if (! som_bfd_prep_for_ar_write (abfd, &nsyms, &stringsize))
6690 return FALSE;
6691
6692 lst_size += sizeof (struct som_external_lst_symbol_record) * nsyms;
6693
6694 /* For the string table. One day we might actually use this info
6695 to avoid small seeks/reads when reading archives. */
6696 bfd_putb32 (lst_size, &lst.string_loc);
6697 bfd_putb32 (stringsize, &lst.string_size);
6698 lst_size += stringsize;
6699
6700 /* SOM ABI says this must be zero. */
6701 bfd_putb32 (0, &lst.free_list);
6702 bfd_putb32 (lst_size, &lst.file_end);
6703
6704 /* Compute the checksum. Must happen after the entire lst header
6705 has filled in. */
6706 p = (unsigned char *) &lst;
6707 csum = 0;
6708 for (i = 0; i < sizeof (struct som_external_lst_header) - sizeof (int);
6709 i += 4)
6710 csum ^= bfd_getb32 (&p[i]);
6711 bfd_putb32 (csum, &lst.checksum);
6712
6713 sprintf (hdr.ar_name, "/ ");
6714 _bfd_ar_spacepad (hdr.ar_date, sizeof (hdr.ar_date), "%-12ld",
6715 bfd_ardata (abfd)->armap_timestamp);
6716 _bfd_ar_spacepad (hdr.ar_uid, sizeof (hdr.ar_uid), "%ld",
6717 statbuf.st_uid);
6718 _bfd_ar_spacepad (hdr.ar_gid, sizeof (hdr.ar_gid), "%ld",
6719 statbuf.st_gid);
6720 _bfd_ar_spacepad (hdr.ar_mode, sizeof (hdr.ar_mode), "%-8o",
6721 (unsigned int)statbuf.st_mode);
6722 _bfd_ar_spacepad (hdr.ar_size, sizeof (hdr.ar_size), "%-10d",
6723 (int) lst_size);
6724 hdr.ar_fmag[0] = '`';
6725 hdr.ar_fmag[1] = '\012';
6726
6727 /* Turn any nulls into spaces. */
6728 for (i = 0; i < sizeof (struct ar_hdr); i++)
6729 if (((char *) (&hdr))[i] == '\0')
6730 (((char *) (&hdr))[i]) = ' ';
6731
6732 /* Scribble out the ar header. */
6733 amt = sizeof (struct ar_hdr);
6734 if (bfd_bwrite ((void *) &hdr, amt, abfd) != amt)
6735 return FALSE;
6736
6737 /* Now scribble out the lst header. */
6738 amt = sizeof (struct som_external_lst_header);
6739 if (bfd_bwrite ((void *) &lst, amt, abfd) != amt)
6740 return FALSE;
6741
6742 /* Build and write the armap. */
6743 if (!som_bfd_ar_write_symbol_stuff (abfd, nsyms, stringsize, lst, elength))
6744 return FALSE;
6745
6746 /* Done. */
6747 return TRUE;
6748 }
6749
6750 /* Free all information we have cached for this BFD. We can always
6751 read it again later if we need it. */
6752
6753 static bfd_boolean
6754 som_bfd_free_cached_info (bfd *abfd)
6755 {
6756 if (bfd_get_format (abfd) == bfd_object)
6757 {
6758 asection *o;
6759
6760 #define FREE(x) do { free (x); x = NULL; } while (0)
6761 /* Free the native string and symbol tables. */
6762 FREE (obj_som_symtab (abfd));
6763 FREE (obj_som_stringtab (abfd));
6764 for (o = abfd->sections; o != NULL; o = o->next)
6765 {
6766 /* Free the native relocations. */
6767 o->reloc_count = (unsigned) -1;
6768 FREE (som_section_data (o)->reloc_stream);
6769 /* Do not free the generic relocations as they are objalloc'ed. */
6770 }
6771 #undef FREE
6772 }
6773
6774 return _bfd_generic_close_and_cleanup (abfd);
6775 }
6776
6777 /* End of miscellaneous support functions. */
6778
6779 /* Linker support functions. */
6780
6781 static bfd_boolean
6782 som_bfd_link_split_section (bfd *abfd ATTRIBUTE_UNUSED, asection *sec)
6783 {
6784 return som_is_subspace (sec) && sec->size > 240000;
6785 }
6786
6787 #define som_find_line _bfd_nosymbols_find_line
6788 #define som_get_symbol_version_string _bfd_nosymbols_get_symbol_version_string
6789 #define som_close_and_cleanup som_bfd_free_cached_info
6790 #define som_read_ar_hdr _bfd_generic_read_ar_hdr
6791 #define som_write_ar_hdr _bfd_generic_write_ar_hdr
6792 #define som_openr_next_archived_file bfd_generic_openr_next_archived_file
6793 #define som_get_elt_at_index _bfd_generic_get_elt_at_index
6794 #define som_generic_stat_arch_elt bfd_generic_stat_arch_elt
6795 #define som_truncate_arname bfd_bsd_truncate_arname
6796 #define som_slurp_extended_name_table _bfd_slurp_extended_name_table
6797 #define som_construct_extended_name_table _bfd_archive_coff_construct_extended_name_table
6798 #define som_update_armap_timestamp _bfd_bool_bfd_true
6799 #define som_bfd_is_target_special_symbol _bfd_bool_bfd_asymbol_false
6800 #define som_get_lineno _bfd_nosymbols_get_lineno
6801 #define som_bfd_make_debug_symbol _bfd_nosymbols_bfd_make_debug_symbol
6802 #define som_read_minisymbols _bfd_generic_read_minisymbols
6803 #define som_minisymbol_to_symbol _bfd_generic_minisymbol_to_symbol
6804 #define som_get_section_contents_in_window _bfd_generic_get_section_contents_in_window
6805 #define som_bfd_get_relocated_section_contents bfd_generic_get_relocated_section_contents
6806 #define som_bfd_relax_section bfd_generic_relax_section
6807 #define som_bfd_link_hash_table_create _bfd_generic_link_hash_table_create
6808 #define som_bfd_link_add_symbols _bfd_generic_link_add_symbols
6809 #define som_bfd_link_just_syms _bfd_generic_link_just_syms
6810 #define som_bfd_copy_link_hash_symbol_type \
6811 _bfd_generic_copy_link_hash_symbol_type
6812 #define som_bfd_final_link _bfd_generic_final_link
6813 #define som_bfd_gc_sections bfd_generic_gc_sections
6814 #define som_bfd_lookup_section_flags bfd_generic_lookup_section_flags
6815 #define som_bfd_merge_sections bfd_generic_merge_sections
6816 #define som_bfd_is_group_section bfd_generic_is_group_section
6817 #define som_bfd_group_name bfd_generic_group_name
6818 #define som_bfd_discard_group bfd_generic_discard_group
6819 #define som_section_already_linked _bfd_generic_section_already_linked
6820 #define som_bfd_define_common_symbol bfd_generic_define_common_symbol
6821 #define som_bfd_link_hide_symbol _bfd_generic_link_hide_symbol
6822 #define som_bfd_define_start_stop bfd_generic_define_start_stop
6823 #define som_bfd_merge_private_bfd_data _bfd_generic_bfd_merge_private_bfd_data
6824 #define som_bfd_copy_private_header_data _bfd_generic_bfd_copy_private_header_data
6825 #define som_bfd_set_private_flags _bfd_generic_bfd_set_private_flags
6826 #define som_find_inliner_info _bfd_nosymbols_find_inliner_info
6827 #define som_bfd_link_check_relocs _bfd_generic_link_check_relocs
6828 #define som_set_reloc _bfd_generic_set_reloc
6829
6830 const bfd_target hppa_som_vec =
6831 {
6832 "som", /* Name. */
6833 bfd_target_som_flavour,
6834 BFD_ENDIAN_BIG, /* Target byte order. */
6835 BFD_ENDIAN_BIG, /* Target headers byte order. */
6836 (HAS_RELOC | EXEC_P | /* Object flags. */
6837 HAS_LINENO | HAS_DEBUG |
6838 HAS_SYMS | HAS_LOCALS | WP_TEXT | D_PAGED | DYNAMIC),
6839 (SEC_CODE | SEC_DATA | SEC_ROM | SEC_HAS_CONTENTS | SEC_LINK_ONCE
6840 | SEC_ALLOC | SEC_LOAD | SEC_RELOC), /* Section flags. */
6841
6842 /* Leading_symbol_char: is the first char of a user symbol
6843 predictable, and if so what is it. */
6844 0,
6845 '/', /* AR_pad_char. */
6846 14, /* AR_max_namelen. */
6847 0, /* match priority. */
6848 bfd_getb64, bfd_getb_signed_64, bfd_putb64,
6849 bfd_getb32, bfd_getb_signed_32, bfd_putb32,
6850 bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* Data. */
6851 bfd_getb64, bfd_getb_signed_64, bfd_putb64,
6852 bfd_getb32, bfd_getb_signed_32, bfd_putb32,
6853 bfd_getb16, bfd_getb_signed_16, bfd_putb16, /* Headers. */
6854 {_bfd_dummy_target,
6855 som_object_p, /* bfd_check_format. */
6856 bfd_generic_archive_p,
6857 _bfd_dummy_target
6858 },
6859 {
6860 _bfd_bool_bfd_false_error,
6861 som_mkobject,
6862 _bfd_generic_mkarchive,
6863 _bfd_bool_bfd_false_error
6864 },
6865 {
6866 _bfd_bool_bfd_false_error,
6867 som_write_object_contents,
6868 _bfd_write_archive_contents,
6869 _bfd_bool_bfd_false_error,
6870 },
6871 #undef som
6872
6873 BFD_JUMP_TABLE_GENERIC (som),
6874 BFD_JUMP_TABLE_COPY (som),
6875 BFD_JUMP_TABLE_CORE (_bfd_nocore),
6876 BFD_JUMP_TABLE_ARCHIVE (som),
6877 BFD_JUMP_TABLE_SYMBOLS (som),
6878 BFD_JUMP_TABLE_RELOCS (som),
6879 BFD_JUMP_TABLE_WRITE (som),
6880 BFD_JUMP_TABLE_LINK (som),
6881 BFD_JUMP_TABLE_DYNAMIC (_bfd_nodynamic),
6882
6883 NULL,
6884
6885 NULL
6886 };
6887
A mirror of the official binutils-gdb repository