Remove previous patch, committed in error.
[deliverable/binutils-gdb.git] / gas / config / obj-evax.c
1 /* obj-evax.c - EVAX (openVMS/Alpha) object file format.
2 Copyright 1996, 1997, 2005, 2007, 2008, 2009 Free Software Foundation, Inc.
3 Contributed by Klaus Kämpf (kkaempf@progis.de) of
4 proGIS Software, Aachen, Germany.
5 Extensively enhanced by Douglas Rupp of AdaCore.
6
7 This file is part of GAS, the GNU Assembler
8
9 GAS 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, or (at your option)
12 any later version.
13
14 GAS 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 GAS; see the file COPYING. If not, write to
21 the Free Software Foundation, 51 Franklin Street - Fifth Floor, Boston,
22 MA 02110-1301, USA. */
23
24 #define OBJ_HEADER "obj-evax.h"
25
26 #include "bfd.h"
27 #include "vms.h"
28 #include "as.h"
29 #include "subsegs.h"
30 #include "struc-symbol.h"
31 #include "safe-ctype.h"
32
33 static void s_evax_weak (int);
34 static unsigned int crc32 (unsigned char *, int);
35 static char *encode_32 (unsigned int);
36 static char *encode_16 (unsigned int);
37 static int decode_16 (const char *);
38
39 const pseudo_typeS obj_pseudo_table[] =
40 {
41 { "weak", s_evax_weak, 0},
42 {0, 0, 0},
43 }; /* obj_pseudo_table */
44
45 void obj_read_begin_hook () {}
46
47 /* Handle the weak specific pseudo-op. */
48
49 static void
50 s_evax_weak (int ignore ATTRIBUTE_UNUSED)
51 {
52 char *name;
53 int c;
54 symbolS *symbolP;
55 char *stop = NULL;
56 char stopc;
57
58 if (flag_mri)
59 stop = mri_comment_field (&stopc);
60
61 do
62 {
63 name = input_line_pointer;
64 c = get_symbol_end ();
65 symbolP = symbol_find_or_make (name);
66 *input_line_pointer = c;
67 SKIP_WHITESPACE ();
68 S_SET_WEAK (symbolP);
69 if (c == ',')
70 {
71 input_line_pointer++;
72 SKIP_WHITESPACE ();
73 if (*input_line_pointer == '\n')
74 c = '\n';
75 }
76 }
77 while (c == ',');
78
79 if (flag_mri)
80 mri_comment_end (stop, stopc);
81
82 demand_empty_rest_of_line ();
83 }
84
85 void
86 evax_symbol_new_hook (symbolS *sym)
87 {
88 struct evax_private_udata_struct *udata;
89
90 udata = (struct evax_private_udata_struct *)
91 xmalloc (sizeof (struct evax_private_udata_struct));
92
93 udata->bsym = symbol_get_bfdsym (sym);
94 udata->enbsym = NULL;
95 udata->origname = xstrdup (S_GET_NAME (sym));
96 udata->lkindex = 0;
97 symbol_get_bfdsym(sym)->udata.p = (PTR) udata;
98 }
99
100 void
101 evax_frob_symbol (symbolS *sym, int *punt)
102 {
103 const char *symname = S_GET_NAME (sym);
104 int symlen = strlen (symname);
105 asymbol *symbol = symbol_get_bfdsym (sym);
106
107 if (symlen > 4
108 && strcmp (symname + symlen - 4, "..en") == 0
109 && S_GET_SEGMENT (sym) == undefined_section)
110 {
111 symbol_clear_used_in_reloc (sym);
112 *punt = 1;
113 }
114
115 else if ((symbol->flags & BSF_GLOBAL) && (symbol->flags & BSF_FUNCTION))
116 {
117 struct evax_private_udata_struct *udata
118 = (struct evax_private_udata_struct *)symbol->udata.p;
119
120 /* Fix up equates of function definitions. */
121 while (udata->enbsym == NULL)
122 {
123 /* ??? Equates have been resolved at this point so their
124 expression is O_constant; but they previously were
125 O_symbol and we hope the equated symbol is still there. */
126 sym = symbol_get_value_expression (sym)->X_add_symbol;
127 if (sym == NULL)
128 {
129 as_bad (_("no entry symbol for global function '%s'"), symname);
130 return;
131 }
132 symbol = symbol_get_bfdsym (sym);
133 udata->enbsym
134 = ((struct evax_private_udata_struct *)symbol->udata.p)->enbsym;
135 }
136 }
137 }
138
139 void
140 evax_frob_file_before_adjust (void)
141 {
142 struct alpha_linkage_fixups *l;
143 segT current_section = now_seg;
144 int current_subsec = now_subseg;
145 segment_info_type *seginfo;
146 int linkage_index = 1;
147
148 subseg_set (alpha_link_section, 0);
149 seginfo = seg_info (alpha_link_section);
150
151 /* Handle .linkage fixups. */
152 for (l = alpha_linkage_fixup_root; l != NULL; l = l->next)
153 {
154 if (S_GET_SEGMENT (l->fixp->fx_addsy) == alpha_link_section)
155 {
156 symbolS *entry_sym;
157 fixS *fixpentry, *fixppdesc, *fixtail;
158
159 fixtail = seginfo->fix_tail;
160
161 /* Replace the linkage with the local symbols */
162 entry_sym = symbol_find
163 (((struct evax_private_udata_struct *)symbol_get_bfdsym (l->fixp->fx_addsy)->udata.p)->enbsym->name);
164 if (!entry_sym)
165 abort ();
166 fixpentry = fix_new (l->fixp->fx_frag, l->fixp->fx_where, 8,
167 entry_sym, l->fixp->fx_offset, 0,
168 BFD_RELOC_64);
169 fixppdesc = fix_new (l->fixp->fx_frag, l->fixp->fx_where+8, 8,
170 l->fixp->fx_addsy, l->fixp->fx_offset, 0,
171 BFD_RELOC_64);
172 l->fixp->fx_size = 0;
173 l->fixp->fx_done = 1;
174
175 /* If not already at the tail, splice the new fixups into
176 the chain right after the one we are nulling out */
177 if (fixtail != l->fixp)
178 {
179 fixppdesc->fx_next = l->fixp->fx_next;
180 l->fixp->fx_next = fixpentry;
181 fixtail->fx_next = 0;
182 seginfo->fix_tail = fixtail;
183 }
184 }
185 else
186 {
187 ((struct evax_private_udata_struct *)
188 symbol_get_bfdsym (l->label)->udata.p)->lkindex = linkage_index;
189
190 l->fixp->fx_addnumber = linkage_index;
191
192 linkage_index += 2;
193 }
194 }
195
196 subseg_set (current_section, current_subsec);
197 }
198
199 void
200 evax_frob_file_before_fix (void)
201 {
202 /* Now that the fixups are done earlier, we need to transfer the values
203 into the BFD symbols before calling fix_segment (ideally should not
204 be done also later). */
205 if (symbol_rootP)
206 {
207 symbolS *symp;
208
209 /* Set the value into the BFD symbol. Up til now the value
210 has only been kept in the gas symbolS struct. */
211 for (symp = symbol_rootP; symp; symp = symbol_next (symp))
212 symbol_get_bfdsym (symp)->value = S_GET_VALUE (symp);
213 }
214 }
215
216 /* The length is computed from the maximum allowable length of 64 less the
217 4 character ..xx extension that must be preserved (removed before
218 krunching and appended back on afterwards). The $<nnn>.. prefix is
219 also removed and prepened back on, but doesn't enter into the length
220 computation because symbols with that prefix are always resolved
221 by the assembler and will never appear in the symbol table. At least
222 I hope that's true, TBD. */
223 #define MAX_LABEL_LENGTH 60
224
225 static char *shorten_identifier (char *);
226 static int is_truncated_identifier (char *);
227
228 char *
229 evax_shorten_name (char *id)
230 {
231 int prefix_dotdot = 0;
232 char prefix [64];
233 int len = strlen (id);
234 int suffix_dotdot = len;
235 char suffix [64];
236 char *base_id;
237
238 /* This test may be too conservative. */
239 if (len <= MAX_LABEL_LENGTH)
240 return id;
241
242 suffix [0] = 0;
243 prefix [0] = 0;
244
245 /* Check for ..xx suffix and save it. */
246 if (strncmp (&id[len-4], "..", 2) == 0)
247 {
248 suffix_dotdot = len - 4;
249 strncpy (suffix, &id[len-4], 4);
250 suffix [4] = 0;
251 }
252
253 /* Check for $<nnn>.. prefix and save it. */
254 if ((id[0] == '$') && ISDIGIT (id[1]))
255 {
256 int i;
257
258 for (i=2; i < len; i++)
259 {
260 if (!ISDIGIT (id[i]))
261 {
262 if (id[i] == '.' && id [i+1] == '.')
263 {
264 prefix_dotdot = i+2;
265 strncpy (prefix, id, prefix_dotdot);
266 prefix [prefix_dotdot] = 0;
267 }
268 break;
269 }
270 }
271 }
272
273 /* We only need worry about krunching the base symbol. */
274 base_id = xmalloc (suffix_dotdot - prefix_dotdot + 1);
275 strncpy (base_id, &id[prefix_dotdot], suffix_dotdot - prefix_dotdot);
276 base_id [suffix_dotdot - prefix_dotdot] = 0;
277
278 if (strlen (base_id) > MAX_LABEL_LENGTH)
279 {
280 char new_id [4096];
281 char *return_id;
282
283 strcpy (new_id, base_id);
284
285 /* Shorten it. */
286 strcpy (new_id, shorten_identifier (new_id));
287
288 /* Prepend back the prefix if there was one. */
289 if (prefix_dotdot)
290 {
291 memmove (&new_id [prefix_dotdot], new_id, strlen (new_id) + 1);
292 strncpy (new_id, prefix, prefix_dotdot);
293 }
294
295 /* Append back the suffix if there was one. */
296 if (strlen (suffix))
297 strcat (new_id, suffix);
298
299 /* Save it on the heap and return. */
300 return_id = xmalloc (strlen (new_id) + 1);
301 strcpy (return_id, new_id);
302
303 return return_id;
304 }
305 else
306 return id;
307 }
308
309 /* The code below implements a mechanism for truncating long
310 identifiers to an arbitrary length (set by MAX_LABEL_LENGTH).
311
312 It attempts to make each truncated identifier unique by replacing
313 part of the identifier with an encoded 32-bit CRC and an associated
314 checksum (the checksum is used as a way to determine that the name
315 was truncated).
316
317 Note that both a portion of the start and of the end of the
318 identifier may be kept. The macro ID_SUFFIX_LENGTH will return the
319 number of characters in the suffix of the identifier that should be
320 kept.
321
322 The portion of the identifier that is going to be removed is
323 checksummed. The checksum is then encoded as a 5-character string,
324 the characters of which are then summed. This sum is then encoded
325 as a 3-character string. Finally, the original length of the
326 identifier is encoded as a 3-character string.
327
328 These three strings are then concatenated together (along with an _h
329 which further designates that the name was truncated):
330
331 "original_identifier"_haaaaabbbccc
332
333 aaaaa = 32-bit CRC
334 bbb = length of original identifier
335 ccc = sum of 32-bit CRC characters
336
337 The resulting identifier will be MAX_LABEL_LENGTH characters long.
338
339 */
340
341
342 /* Table used to convert an integer into a string. */
343
344 static const char codings[] = {
345 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',
346 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z',
347 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O',
348 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',
349 '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '_'};
350
351 /* The number of codings in the above table. */
352 static const int number_of_codings = sizeof (codings) / sizeof (char);
353
354 /* Table used by decode_16 () to convert an encoded string back into
355 an integer. */
356 static char decodings[256];
357
358 /* Table used by the crc32 function to calcuate the checksum. */
359 static unsigned int crc32_table[256] = {0, 0};
360
361 /* Given a string in BUF, calculate a 32-bit CRC for it.
362
363 This is used as a reasonably unique hash for the given string. */
364
365 static unsigned int
366 crc32 (unsigned char *buf, int len)
367 {
368 unsigned int crc = 0xffffffff;
369
370 if (! crc32_table[1])
371 {
372 /* Initialize the CRC table and the decoding table. */
373 int i, j;
374 unsigned int c;
375
376 for (i = 0; i < 256; i++)
377 {
378 for (c = i << 24, j = 8; j > 0; --j)
379 c = c & 0x80000000 ? (c << 1) ^ 0x04c11db7 : (c << 1);
380 crc32_table[i] = c;
381 decodings[i] = 0;
382 }
383 for (i = 0; i < number_of_codings; i++)
384 decodings[codings[i] & 255] = i;
385 }
386
387 while (len--)
388 {
389 crc = (crc << 8) ^ crc32_table[(crc >> 24) ^ *buf];
390 buf++;
391 }
392 return crc;
393 }
394
395 /* Encode the lower 32 bits of VALUE as a 5-character string. */
396
397 static char *
398 encode_32 (unsigned int value)
399 {
400 static char res[6];
401 int x;
402
403 res[5] = 0;
404 for(x = 0; x < 5; x++)
405 {
406 res[x] = codings[value % number_of_codings];
407 value = value / number_of_codings;
408 }
409 return res;
410 }
411
412 /* Encode the lower 16 bits of VALUE as a 3-character string. */
413
414 static char *
415 encode_16 (unsigned int value)
416 {
417 static char res[4];
418 int x;
419
420 res[3] = 0;
421 for(x = 0; x < 3; x++)
422 {
423 res[x] = codings[value % number_of_codings];
424 value = value / number_of_codings;
425 }
426 return res;
427 }
428
429 /* Convert the encoded string obtained from encode_16 () back into a
430 16-bit integer. */
431
432 static int
433 decode_16 (const char *string)
434 {
435 return decodings[(int) string[2]] * number_of_codings * number_of_codings
436 + decodings[(int) string[1]] * number_of_codings
437 + decodings[(int) string[0]];
438 }
439
440 /* ID_SUFFIX_LENGTH is used to determine how many characters in the
441 suffix of the identifier are to be preserved, if any. */
442
443 #ifndef ID_SUFFIX_LENGTH
444 #define ID_SUFFIX_LENGTH(ID) (0)
445 #endif
446
447 /* Return a reasonably-unique version of NAME that is less than or
448 equal to MAX_LABEL_LENGTH characters long. The string returned from
449 this function may be a copy of NAME; the function will never
450 actually modify the contents of NAME. */
451
452 static char newname[MAX_LABEL_LENGTH + 1];
453
454 static char *
455 shorten_identifier (char *name)
456 {
457 int crc, len, sum, x, final_len;
458 char *crc_chars;
459 int suffix_length = ID_SUFFIX_LENGTH (name);
460
461 if ((len = strlen (name)) <= MAX_LABEL_LENGTH)
462 return name;
463
464 final_len = MAX_LABEL_LENGTH - 2 - 5 - 3 - 3 - suffix_length;
465 crc = crc32 ((unsigned char *)name + final_len,
466 len - final_len - suffix_length);
467 crc_chars = encode_32 (crc);
468 sum = 0;
469 for (x = 0; x < 5; x++)
470 sum += crc_chars [x];
471 strncpy (newname, name, final_len);
472 newname [MAX_LABEL_LENGTH] = 0;
473 /* Now append the suffix of the original identifier, if any. */
474 if (suffix_length)
475 strncpy (newname + MAX_LABEL_LENGTH - suffix_length,
476 name + len - suffix_length,
477 suffix_length);
478 strncpy (newname + final_len, "_h", 2);
479 strncpy (newname + final_len + 2 , crc_chars, 5);
480 strncpy (newname + final_len + 2 + 5, encode_16 (len), 3);
481 strncpy (newname + final_len + 2 + 5 + 3, encode_16 (sum), 3);
482 if (!is_truncated_identifier (newname))
483 abort ();
484 return newname;
485 }
486
487 /* Determine whether or not ID is a truncated identifier, and return a
488 non-zero value if it is. */
489
490 static int
491 is_truncated_identifier (char *id)
492 {
493 char *ptr;
494 int len = strlen (id);
495 /* If it's not exactly MAX_LABEL_LENGTH characters long, it can't be
496 a truncated identifier. */
497 if (len != MAX_LABEL_LENGTH)
498 return 0;
499
500 /* Start scanning backwards for a _h. */
501 len = len - 3 - 3 - 5 - 2;
502 ptr = id + len;
503 while (ptr >= id)
504 {
505 if (ptr[0] == '_' && ptr[1] == 'h')
506 {
507 /* Now see if the sum encoded in the identifer matches. */
508 int x, sum;
509 sum = 0;
510 for (x = 0; x < 5; x++)
511 sum += ptr[x + 2];
512 /* If it matches, this is probably a truncated identifier. */
513 if (sum == decode_16 (ptr + 5 + 2 + 3))
514 return 1;
515 }
516 ptr--;
517 }
518 return 0;
519 }
520
521 /* end of obj-evax.c */
This page took 0.042017 seconds and 4 git commands to generate.