* symbols.c (max_indent_level): New global.
[deliverable/binutils-gdb.git] / gas / symbols.c
1 /* symbols.c -symbol table-
2 Copyright (C) 1987, 90, 91, 92, 93, 94, 95, 96, 97, 1998
3 Free Software Foundation, Inc.
4
5 This file is part of GAS, the GNU Assembler.
6
7 GAS is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
10 any later version.
11
12 GAS is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with GAS; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
20 02111-1307, USA. */
21
22 /* #define DEBUG_SYMS / * to debug symbol list maintenance */
23
24 #include <ctype.h>
25
26 #include "as.h"
27
28 #include "obstack.h" /* For "symbols.h" */
29 #include "subsegs.h"
30
31 /* This is non-zero if symbols are case sensitive, which is the
32 default. */
33 int symbols_case_sensitive = 1;
34
35 #ifndef WORKING_DOT_WORD
36 extern int new_broken_words;
37 #endif
38
39 /* symbol-name => struct symbol pointer */
40 static struct hash_control *sy_hash;
41
42 /* Below are commented in "symbols.h". */
43 symbolS *symbol_rootP;
44 symbolS *symbol_lastP;
45 symbolS abs_symbol;
46
47 #ifdef DEBUG_SYMS
48 #define debug_verify_symchain verify_symbol_chain
49 #else
50 #define debug_verify_symchain(root, last) ((void) 0)
51 #endif
52
53 struct obstack notes;
54
55 static void fb_label_init PARAMS ((void));
56 static long dollar_label_instance PARAMS ((long));
57 static long fb_label_instance PARAMS ((long));
58
59 static void print_binary PARAMS ((FILE *, const char *, expressionS *));
60
61 /* symbol_new()
62
63 Return a pointer to a new symbol. Die if we can't make a new
64 symbol. Fill in the symbol's values. Add symbol to end of symbol
65 chain.
66
67 This function should be called in the general case of creating a
68 symbol. However, if the output file symbol table has already been
69 set, and you are certain that this symbol won't be wanted in the
70 output file, you can call symbol_create. */
71
72 symbolS *
73 symbol_new (name, segment, valu, frag)
74 const char *name;
75 segT segment;
76 valueT valu;
77 fragS *frag;
78 {
79 symbolS *symbolP = symbol_create (name, segment, valu, frag);
80
81 /*
82 * Link to end of symbol chain.
83 */
84 #ifdef BFD_ASSEMBLER
85 {
86 extern int symbol_table_frozen;
87 if (symbol_table_frozen)
88 abort ();
89 }
90 #endif
91 symbol_append (symbolP, symbol_lastP, &symbol_rootP, &symbol_lastP);
92
93 return symbolP;
94 }
95
96 symbolS *
97 symbol_create (name, segment, valu, frag)
98 const char *name; /* It is copied, the caller can destroy/modify */
99 segT segment; /* Segment identifier (SEG_<something>) */
100 valueT valu; /* Symbol value */
101 fragS *frag; /* Associated fragment */
102 {
103 unsigned int name_length;
104 char *preserved_copy_of_name;
105 symbolS *symbolP;
106
107 name_length = strlen (name) + 1; /* +1 for \0 */
108 obstack_grow (&notes, name, name_length);
109 preserved_copy_of_name = obstack_finish (&notes);
110 #ifdef STRIP_UNDERSCORE
111 if (preserved_copy_of_name[0] == '_')
112 preserved_copy_of_name++;
113 #endif
114
115 #ifdef tc_canonicalize_symbol_name
116 preserved_copy_of_name =
117 tc_canonicalize_symbol_name (preserved_copy_of_name);
118 #endif
119
120 if (! symbols_case_sensitive)
121 {
122 unsigned char *s;
123
124 for (s = (unsigned char *) preserved_copy_of_name; *s != '\0'; s++)
125 if (islower (*s))
126 *s = toupper (*s);
127 }
128
129 symbolP = (symbolS *) obstack_alloc (&notes, sizeof (symbolS));
130
131 /* symbol must be born in some fixed state. This seems as good as any. */
132 memset (symbolP, 0, sizeof (symbolS));
133
134 #ifdef BFD_ASSEMBLER
135 symbolP->bsym = bfd_make_empty_symbol (stdoutput);
136 if (symbolP->bsym == NULL)
137 as_perror ("%s", "bfd_make_empty_symbol");
138 symbolP->bsym->udata.p = (PTR) symbolP;
139 #endif
140 S_SET_NAME (symbolP, preserved_copy_of_name);
141
142 S_SET_SEGMENT (symbolP, segment);
143 S_SET_VALUE (symbolP, valu);
144 symbol_clear_list_pointers (symbolP);
145
146 symbolP->sy_frag = frag;
147 #ifndef BFD_ASSEMBLER
148 symbolP->sy_number = ~0;
149 symbolP->sy_name_offset = (unsigned int) ~0;
150 #endif
151
152 obj_symbol_new_hook (symbolP);
153
154 #ifdef tc_symbol_new_hook
155 tc_symbol_new_hook (symbolP);
156 #endif
157
158 return symbolP;
159 }
160 \f
161
162 /*
163 * colon()
164 *
165 * We have just seen "<name>:".
166 * Creates a struct symbol unless it already exists.
167 *
168 * Gripes if we are redefining a symbol incompatibly (and ignores it).
169 *
170 */
171 symbolS *
172 colon (sym_name) /* just seen "x:" - rattle symbols & frags */
173 const char *sym_name; /* symbol name, as a cannonical string */
174 /* We copy this string: OK to alter later. */
175 {
176 register symbolS *symbolP; /* symbol we are working with */
177
178 /* Sun local labels go out of scope whenever a non-local symbol is
179 defined. */
180 if (LOCAL_LABELS_DOLLAR)
181 {
182 int local;
183
184 #ifdef BFD_ASSEMBLER
185 local = bfd_is_local_label_name (stdoutput, sym_name);
186 #else
187 local = LOCAL_LABEL (sym_name);
188 #endif
189
190 if (! local)
191 dollar_label_clear ();
192 }
193
194 #ifndef WORKING_DOT_WORD
195 if (new_broken_words)
196 {
197 struct broken_word *a;
198 int possible_bytes;
199 fragS *frag_tmp;
200 char *frag_opcode;
201
202 extern const int md_short_jump_size;
203 extern const int md_long_jump_size;
204 possible_bytes = (md_short_jump_size
205 + new_broken_words * md_long_jump_size);
206
207 frag_tmp = frag_now;
208 frag_opcode = frag_var (rs_broken_word,
209 possible_bytes,
210 possible_bytes,
211 (relax_substateT) 0,
212 (symbolS *) broken_words,
213 (offsetT) 0,
214 NULL);
215
216 /* We want to store the pointer to where to insert the jump table in the
217 fr_opcode of the rs_broken_word frag. This requires a little
218 hackery. */
219 while (frag_tmp
220 && (frag_tmp->fr_type != rs_broken_word
221 || frag_tmp->fr_opcode))
222 frag_tmp = frag_tmp->fr_next;
223 know (frag_tmp);
224 frag_tmp->fr_opcode = frag_opcode;
225 new_broken_words = 0;
226
227 for (a = broken_words; a && a->dispfrag == 0; a = a->next_broken_word)
228 a->dispfrag = frag_tmp;
229 }
230 #endif /* WORKING_DOT_WORD */
231
232 if ((symbolP = symbol_find (sym_name)) != 0)
233 {
234 #ifdef RESOLVE_SYMBOL_REDEFINITION
235 if (RESOLVE_SYMBOL_REDEFINITION (symbolP))
236 return symbolP;
237 #endif
238 /*
239 * Now check for undefined symbols
240 */
241 if (!S_IS_DEFINED (symbolP) || S_IS_COMMON (symbolP))
242 {
243 if (S_GET_VALUE (symbolP) == 0)
244 {
245 symbolP->sy_frag = frag_now;
246 #ifdef OBJ_VMS
247 S_SET_OTHER(symbolP, const_flag);
248 #endif
249 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
250 S_SET_SEGMENT (symbolP, now_seg);
251 #ifdef N_UNDF
252 know (N_UNDF == 0);
253 #endif /* if we have one, it better be zero. */
254
255 }
256 else
257 {
258 /*
259 * There are still several cases to check:
260 * A .comm/.lcomm symbol being redefined as
261 * initialized data is OK
262 * A .comm/.lcomm symbol being redefined with
263 * a larger size is also OK
264 *
265 * This only used to be allowed on VMS gas, but Sun cc
266 * on the sparc also depends on it.
267 */
268
269 if (((!S_IS_DEBUG (symbolP)
270 && (!S_IS_DEFINED (symbolP) || S_IS_COMMON (symbolP))
271 && S_IS_EXTERNAL (symbolP))
272 || S_GET_SEGMENT (symbolP) == bss_section)
273 && (now_seg == data_section
274 || now_seg == S_GET_SEGMENT (symbolP)))
275 {
276 /*
277 * Select which of the 2 cases this is
278 */
279 if (now_seg != data_section)
280 {
281 /*
282 * New .comm for prev .comm symbol.
283 * If the new size is larger we just
284 * change its value. If the new size
285 * is smaller, we ignore this symbol
286 */
287 if (S_GET_VALUE (symbolP)
288 < ((unsigned) frag_now_fix ()))
289 {
290 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
291 }
292 }
293 else
294 {
295 /* It is a .comm/.lcomm being converted to initialized
296 data. */
297 symbolP->sy_frag = frag_now;
298 #ifdef OBJ_VMS
299 S_SET_OTHER(symbolP, const_flag);
300 #endif
301 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
302 S_SET_SEGMENT (symbolP, now_seg); /* keep N_EXT bit */
303 }
304 }
305 else
306 {
307 #if defined (S_GET_OTHER) && defined (S_GET_DESC)
308 as_fatal ("Symbol \"%s\" is already defined as \"%s\"/%d.%d.%ld.",
309 sym_name,
310 segment_name (S_GET_SEGMENT (symbolP)),
311 S_GET_OTHER (symbolP), S_GET_DESC (symbolP),
312 (long) S_GET_VALUE (symbolP));
313 #else
314 as_fatal ("Symbol \"%s\" is already defined as \"%s\"/%ld.",
315 sym_name,
316 segment_name (S_GET_SEGMENT (symbolP)),
317 (long) S_GET_VALUE (symbolP));
318 #endif
319 }
320 } /* if the undefined symbol has no value */
321 }
322 else
323 {
324 /* Don't blow up if the definition is the same */
325 if (!(frag_now == symbolP->sy_frag
326 && S_GET_VALUE (symbolP) == frag_now_fix ()
327 && S_GET_SEGMENT (symbolP) == now_seg))
328 as_fatal ("Symbol %s already defined.", sym_name);
329 } /* if this symbol is not yet defined */
330
331 }
332 else
333 {
334 symbolP = symbol_new (sym_name, now_seg, (valueT) frag_now_fix (),
335 frag_now);
336 #ifdef OBJ_VMS
337 S_SET_OTHER (symbolP, const_flag);
338 #endif /* OBJ_VMS */
339
340 symbol_table_insert (symbolP);
341 } /* if we have seen this symbol before */
342
343 if (mri_common_symbol != NULL)
344 {
345 /* This symbol is actually being defined within an MRI common
346 section. This requires special handling. */
347 symbolP->sy_value.X_op = O_symbol;
348 symbolP->sy_value.X_add_symbol = mri_common_symbol;
349 symbolP->sy_value.X_add_number = S_GET_VALUE (mri_common_symbol);
350 symbolP->sy_frag = &zero_address_frag;
351 S_SET_SEGMENT (symbolP, expr_section);
352 symbolP->sy_mri_common = 1;
353 }
354
355 #ifdef tc_frob_label
356 tc_frob_label (symbolP);
357 #endif
358 #ifdef obj_frob_label
359 obj_frob_label (symbolP);
360 #endif
361
362 return symbolP;
363 }
364 \f
365
366 /*
367 * symbol_table_insert()
368 *
369 * Die if we can't insert the symbol.
370 *
371 */
372
373 void
374 symbol_table_insert (symbolP)
375 symbolS *symbolP;
376 {
377 register const char *error_string;
378
379 know (symbolP);
380 know (S_GET_NAME (symbolP));
381
382 if ((error_string = hash_jam (sy_hash, S_GET_NAME (symbolP), (PTR) symbolP)))
383 {
384 as_fatal ("Inserting \"%s\" into symbol table failed: %s",
385 S_GET_NAME (symbolP), error_string);
386 } /* on error */
387 } /* symbol_table_insert() */
388 \f
389 /*
390 * symbol_find_or_make()
391 *
392 * If a symbol name does not exist, create it as undefined, and insert
393 * it into the symbol table. Return a pointer to it.
394 */
395 symbolS *
396 symbol_find_or_make (name)
397 const char *name;
398 {
399 register symbolS *symbolP;
400
401 symbolP = symbol_find (name);
402
403 if (symbolP == NULL)
404 {
405 symbolP = symbol_make (name);
406
407 symbol_table_insert (symbolP);
408 } /* if symbol wasn't found */
409
410 return (symbolP);
411 } /* symbol_find_or_make() */
412
413 symbolS *
414 symbol_make (name)
415 CONST char *name;
416 {
417 symbolS *symbolP;
418
419 /* Let the machine description default it, e.g. for register names. */
420 symbolP = md_undefined_symbol ((char *) name);
421
422 if (!symbolP)
423 symbolP = symbol_new (name, undefined_section, (valueT) 0, &zero_address_frag);
424
425 return (symbolP);
426 } /* symbol_make() */
427
428 /*
429 * symbol_find()
430 *
431 * Implement symbol table lookup.
432 * In: A symbol's name as a string: '\0' can't be part of a symbol name.
433 * Out: NULL if the name was not in the symbol table, else the address
434 * of a struct symbol associated with that name.
435 */
436
437 symbolS *
438 symbol_find (name)
439 CONST char *name;
440 {
441 #ifdef STRIP_UNDERSCORE
442 return (symbol_find_base (name, 1));
443 #else /* STRIP_UNDERSCORE */
444 return (symbol_find_base (name, 0));
445 #endif /* STRIP_UNDERSCORE */
446 } /* symbol_find() */
447
448 symbolS *
449 symbol_find_base (name, strip_underscore)
450 CONST char *name;
451 int strip_underscore;
452 {
453 if (strip_underscore && *name == '_')
454 name++;
455
456 #ifdef tc_canonicalize_symbol_name
457 {
458 char *copy;
459
460 copy = (char *) alloca (strlen (name) + 1);
461 strcpy (copy, name);
462 name = tc_canonicalize_symbol_name (copy);
463 }
464 #endif
465
466 if (! symbols_case_sensitive)
467 {
468 unsigned char *copy;
469
470 copy = (unsigned char *) alloca (strlen (name) + 1);
471 name = (const char *) copy;
472 for (; *copy != '\0'; copy++)
473 if (islower (*copy))
474 *copy = toupper (*copy);
475 }
476
477 return ((symbolS *) hash_find (sy_hash, name));
478 }
479
480 /*
481 * Once upon a time, symbols were kept in a singly linked list. At
482 * least coff needs to be able to rearrange them from time to time, for
483 * which a doubly linked list is much more convenient. Loic did these
484 * as macros which seemed dangerous to me so they're now functions.
485 * xoxorich.
486 */
487
488 /* Link symbol ADDME after symbol TARGET in the chain. */
489 void
490 symbol_append (addme, target, rootPP, lastPP)
491 symbolS *addme;
492 symbolS *target;
493 symbolS **rootPP;
494 symbolS **lastPP;
495 {
496 if (target == NULL)
497 {
498 know (*rootPP == NULL);
499 know (*lastPP == NULL);
500 addme->sy_next = NULL;
501 #ifdef SYMBOLS_NEED_BACKPOINTERS
502 addme->sy_previous = NULL;
503 #endif
504 *rootPP = addme;
505 *lastPP = addme;
506 return;
507 } /* if the list is empty */
508
509 if (target->sy_next != NULL)
510 {
511 #ifdef SYMBOLS_NEED_BACKPOINTERS
512 target->sy_next->sy_previous = addme;
513 #endif /* SYMBOLS_NEED_BACKPOINTERS */
514 }
515 else
516 {
517 know (*lastPP == target);
518 *lastPP = addme;
519 } /* if we have a next */
520
521 addme->sy_next = target->sy_next;
522 target->sy_next = addme;
523
524 #ifdef SYMBOLS_NEED_BACKPOINTERS
525 addme->sy_previous = target;
526 #endif /* SYMBOLS_NEED_BACKPOINTERS */
527
528 debug_verify_symchain (symbol_rootP, symbol_lastP);
529 }
530
531 /* Set the chain pointers of SYMBOL to null. */
532 void
533 symbol_clear_list_pointers (symbolP)
534 symbolS *symbolP;
535 {
536 symbolP->sy_next = NULL;
537 #ifdef SYMBOLS_NEED_BACKPOINTERS
538 symbolP->sy_previous = NULL;
539 #endif
540 }
541
542 #ifdef SYMBOLS_NEED_BACKPOINTERS
543 /* Remove SYMBOLP from the list. */
544 void
545 symbol_remove (symbolP, rootPP, lastPP)
546 symbolS *symbolP;
547 symbolS **rootPP;
548 symbolS **lastPP;
549 {
550 if (symbolP == *rootPP)
551 {
552 *rootPP = symbolP->sy_next;
553 } /* if it was the root */
554
555 if (symbolP == *lastPP)
556 {
557 *lastPP = symbolP->sy_previous;
558 } /* if it was the tail */
559
560 if (symbolP->sy_next != NULL)
561 {
562 symbolP->sy_next->sy_previous = symbolP->sy_previous;
563 } /* if not last */
564
565 if (symbolP->sy_previous != NULL)
566 {
567 symbolP->sy_previous->sy_next = symbolP->sy_next;
568 } /* if not first */
569
570 debug_verify_symchain (*rootPP, *lastPP);
571 }
572
573 /* Link symbol ADDME before symbol TARGET in the chain. */
574 void
575 symbol_insert (addme, target, rootPP, lastPP)
576 symbolS *addme;
577 symbolS *target;
578 symbolS **rootPP;
579 symbolS **lastPP;
580 {
581 if (target->sy_previous != NULL)
582 {
583 target->sy_previous->sy_next = addme;
584 }
585 else
586 {
587 know (*rootPP == target);
588 *rootPP = addme;
589 } /* if not first */
590
591 addme->sy_previous = target->sy_previous;
592 target->sy_previous = addme;
593 addme->sy_next = target;
594
595 debug_verify_symchain (*rootPP, *lastPP);
596 }
597
598 #endif /* SYMBOLS_NEED_BACKPOINTERS */
599
600 void
601 verify_symbol_chain (rootP, lastP)
602 symbolS *rootP;
603 symbolS *lastP;
604 {
605 symbolS *symbolP = rootP;
606
607 if (symbolP == NULL)
608 return;
609
610 for (; symbol_next (symbolP) != NULL; symbolP = symbol_next (symbolP))
611 {
612 #ifdef SYMBOLS_NEED_BACKPOINTERS
613 assert (symbolP->sy_next->sy_previous == symbolP);
614 #else
615 /* Walk the list anyways, to make sure pointers are still good. */
616 ;
617 #endif /* SYMBOLS_NEED_BACKPOINTERS */
618 }
619
620 assert (lastP == symbolP);
621 }
622
623 void
624 verify_symbol_chain_2 (sym)
625 symbolS *sym;
626 {
627 symbolS *p = sym, *n = sym;
628 #ifdef SYMBOLS_NEED_BACKPOINTERS
629 while (symbol_previous (p))
630 p = symbol_previous (p);
631 #endif
632 while (symbol_next (n))
633 n = symbol_next (n);
634 verify_symbol_chain (p, n);
635 }
636
637 /* Resolve the value of a symbol. This is called during the final
638 pass over the symbol table to resolve any symbols with complex
639 values. */
640
641 valueT
642 resolve_symbol_value (symp, finalize)
643 symbolS *symp;
644 int finalize;
645 {
646 int resolved;
647 valueT final_val;
648 segT final_seg;
649
650 if (symp->sy_resolved)
651 {
652 if (symp->sy_value.X_op == O_constant)
653 return (valueT) symp->sy_value.X_add_number;
654 else
655 return 0;
656 }
657
658 resolved = 0;
659 final_seg = S_GET_SEGMENT (symp);
660
661 if (symp->sy_resolving)
662 {
663 if (finalize)
664 as_bad ("Symbol definition loop encountered at %s", S_GET_NAME (symp));
665 final_val = 0;
666 resolved = 1;
667 }
668 else
669 {
670 symbolS *add_symbol, *op_symbol;
671 offsetT left, right;
672 segT seg_left, seg_right;
673 operatorT op;
674
675 symp->sy_resolving = 1;
676
677 /* Help out with CSE. */
678 add_symbol = symp->sy_value.X_add_symbol;
679 op_symbol = symp->sy_value.X_op_symbol;
680 final_val = symp->sy_value.X_add_number;
681 op = symp->sy_value.X_op;
682
683 switch (op)
684 {
685 default:
686 BAD_CASE (op);
687 break;
688
689 case O_absent:
690 final_val = 0;
691 /* Fall through. */
692
693 case O_constant:
694 final_val += symp->sy_frag->fr_address;
695 if (final_seg == expr_section)
696 final_seg = absolute_section;
697 resolved = 1;
698 break;
699
700 case O_symbol:
701 case O_symbol_rva:
702 left = resolve_symbol_value (add_symbol, finalize);
703 do_symbol:
704
705 if (symp->sy_mri_common)
706 {
707 /* This is a symbol inside an MRI common section. The
708 relocation routines are going to handle it specially.
709 Don't change the value. */
710 resolved = add_symbol->sy_resolved;
711 break;
712 }
713
714 if (finalize && final_val == 0)
715 copy_symbol_attributes (symp, add_symbol);
716
717 /* If we have equated this symbol to an undefined symbol, we
718 keep X_op set to O_symbol, and we don't change
719 X_add_number. This permits the routine which writes out
720 relocation to detect this case, and convert the
721 relocation to be against the symbol to which this symbol
722 is equated. */
723 if (! S_IS_DEFINED (add_symbol) || S_IS_COMMON (add_symbol))
724 {
725 if (finalize)
726 {
727 symp->sy_value.X_op = O_symbol;
728 S_SET_SEGMENT (symp, S_GET_SEGMENT (add_symbol));
729 symp->sy_value.X_add_number = final_val;
730 }
731 final_val = 0;
732 resolved = add_symbol->sy_resolved;
733 goto exit_dont_set_value;
734 }
735 else
736 {
737 final_val += symp->sy_frag->fr_address + left;
738 if (final_seg == expr_section || final_seg == undefined_section)
739 final_seg = S_GET_SEGMENT (add_symbol);
740 }
741
742 resolved = add_symbol->sy_resolved;
743 break;
744
745 case O_uminus:
746 case O_bit_not:
747 case O_logical_not:
748 left = resolve_symbol_value (add_symbol, finalize);
749
750 if (op == O_uminus)
751 left = -left;
752 else if (op == O_logical_not)
753 left = !left;
754 else
755 left = ~left;
756
757 final_val += left + symp->sy_frag->fr_address;
758 if (final_seg == expr_section || final_seg == undefined_section)
759 final_seg = absolute_section;
760
761 resolved = add_symbol->sy_resolved;
762 break;
763
764 case O_multiply:
765 case O_divide:
766 case O_modulus:
767 case O_left_shift:
768 case O_right_shift:
769 case O_bit_inclusive_or:
770 case O_bit_or_not:
771 case O_bit_exclusive_or:
772 case O_bit_and:
773 case O_add:
774 case O_subtract:
775 case O_eq:
776 case O_ne:
777 case O_lt:
778 case O_le:
779 case O_ge:
780 case O_gt:
781 case O_logical_and:
782 case O_logical_or:
783 left = resolve_symbol_value (add_symbol, finalize);
784 right = resolve_symbol_value (op_symbol, finalize);
785 seg_left = S_GET_SEGMENT (add_symbol);
786 seg_right = S_GET_SEGMENT (op_symbol);
787
788 /* Simplify addition or subtraction of a constant by folding the
789 constant into X_add_number. */
790 if (op == O_add || op == O_subtract)
791 {
792 if (seg_right == absolute_section)
793 {
794 if (op == O_add)
795 final_val += right;
796 else
797 final_val -= right;
798 op = O_symbol;
799 op_symbol = NULL;
800 goto do_symbol;
801 }
802 else if (seg_left == absolute_section && op == O_add)
803 {
804 op = O_symbol;
805 final_val += left;
806 add_symbol = op_symbol;
807 left = right;
808 op_symbol = NULL;
809 goto do_symbol;
810 }
811 }
812
813 /* Subtraction is permitted if both operands are in the same
814 section. Otherwise, both operands must be absolute. We
815 already handled the case of addition or subtraction of a
816 constant above. This will probably need to be changed
817 for an object file format which supports arbitrary
818 expressions, such as IEEE-695. */
819 /* Don't emit messages unless we're finalizing the symbol value,
820 otherwise we may get the same message multiple times. */
821 if ((seg_left != absolute_section || seg_right != absolute_section)
822 && (op != O_subtract || seg_left != seg_right)
823 && finalize)
824 {
825 char *file;
826 unsigned int line;
827
828 if (expr_symbol_where (symp, &file, &line))
829 {
830 if (seg_left == undefined_section)
831 as_bad_where (file, line,
832 "undefined symbol %s in operation",
833 S_GET_NAME (symp->sy_value.X_add_symbol));
834 if (seg_right == undefined_section)
835 as_bad_where (file, line,
836 "undefined symbol %s in operation",
837 S_GET_NAME (symp->sy_value.X_op_symbol));
838 if (seg_left != undefined_section
839 && seg_right != undefined_section)
840 as_bad_where (file, line, "invalid section for operation");
841 }
842 else
843 {
844 if (seg_left == undefined_section)
845 as_bad ("undefined symbol %s in operation setting %s",
846 S_GET_NAME (symp->sy_value.X_add_symbol),
847 S_GET_NAME (symp));
848 if (seg_right == undefined_section)
849 as_bad ("undefined symbol %s in operation setting %s",
850 S_GET_NAME (symp->sy_value.X_op_symbol),
851 S_GET_NAME (symp));
852 if (seg_left != undefined_section
853 && seg_right != undefined_section)
854 as_bad ("invalid section for operation setting %s",
855 S_GET_NAME (symp));
856 }
857 }
858
859 /* Check for division by zero. */
860 if ((op == O_divide || op == O_modulus) && right == 0)
861 {
862 /* If seg_right is not absolute_section, then we've
863 already issued a warning about using a bad symbol. */
864 if (seg_right == absolute_section && finalize)
865 {
866 char *file;
867 unsigned int line;
868
869 if (expr_symbol_where (symp, &file, &line))
870 as_bad_where (file, line, "division by zero");
871 else
872 as_bad ("division by zero when setting %s",
873 S_GET_NAME (symp));
874 }
875
876 right = 1;
877 }
878
879 switch (symp->sy_value.X_op)
880 {
881 case O_multiply: left *= right; break;
882 case O_divide: left /= right; break;
883 case O_modulus: left %= right; break;
884 case O_left_shift: left <<= right; break;
885 case O_right_shift: left >>= right; break;
886 case O_bit_inclusive_or: left |= right; break;
887 case O_bit_or_not: left |= ~right; break;
888 case O_bit_exclusive_or: left ^= right; break;
889 case O_bit_and: left &= right; break;
890 case O_add: left += right; break;
891 case O_subtract: left -= right; break;
892 case O_eq: left = left == right ? ~ (offsetT) 0 : 0; break;
893 case O_ne: left = left != right ? ~ (offsetT) 0 : 0; break;
894 case O_lt: left = left < right ? ~ (offsetT) 0 : 0; break;
895 case O_le: left = left <= right ? ~ (offsetT) 0 : 0; break;
896 case O_ge: left = left >= right ? ~ (offsetT) 0 : 0; break;
897 case O_gt: left = left > right ? ~ (offsetT) 0 : 0; break;
898 case O_logical_and: left = left && right; break;
899 case O_logical_or: left = left || right; break;
900 default: abort ();
901 }
902
903 final_val += symp->sy_frag->fr_address + left;
904 if (final_seg == expr_section || final_seg == undefined_section)
905 final_seg = absolute_section;
906 resolved = (add_symbol->sy_resolved && op_symbol->sy_resolved);
907 break;
908
909 case O_register:
910 case O_big:
911 case O_illegal:
912 /* Give an error (below) if not in expr_section. We don't
913 want to worry about expr_section symbols, because they
914 are fictional (they are created as part of expression
915 resolution), and any problems may not actually mean
916 anything. */
917 break;
918 }
919
920 symp->sy_resolving = 0;
921 }
922
923 if (finalize)
924 {
925 S_SET_VALUE (symp, final_val);
926
927 #if defined (OBJ_AOUT) && ! defined (BFD_ASSEMBLER)
928 /* The old a.out backend does not handle S_SET_SEGMENT correctly
929 for a stab symbol, so we use this bad hack. */
930 if (final_seg != S_GET_SEGMENT (symp))
931 #endif
932 S_SET_SEGMENT (symp, final_seg);
933 }
934
935 exit_dont_set_value:
936 /* Don't worry if we can't resolve an expr_section symbol. */
937 if (finalize)
938 {
939 if (resolved)
940 symp->sy_resolved = 1;
941 else if (S_GET_SEGMENT (symp) != expr_section)
942 {
943 as_bad ("can't resolve value for symbol \"%s\"", S_GET_NAME (symp));
944 symp->sy_resolved = 1;
945 }
946 }
947
948 return final_val;
949 }
950
951 /* Dollar labels look like a number followed by a dollar sign. Eg, "42$".
952 They are *really* local. That is, they go out of scope whenever we see a
953 label that isn't local. Also, like fb labels, there can be multiple
954 instances of a dollar label. Therefor, we name encode each instance with
955 the instance number, keep a list of defined symbols separate from the real
956 symbol table, and we treat these buggers as a sparse array. */
957
958 static long *dollar_labels;
959 static long *dollar_label_instances;
960 static char *dollar_label_defines;
961 static unsigned long dollar_label_count;
962 static unsigned long dollar_label_max;
963
964 int
965 dollar_label_defined (label)
966 long label;
967 {
968 long *i;
969
970 know ((dollar_labels != NULL) || (dollar_label_count == 0));
971
972 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
973 if (*i == label)
974 return dollar_label_defines[i - dollar_labels];
975
976 /* if we get here, label isn't defined */
977 return 0;
978 } /* dollar_label_defined() */
979
980 static long
981 dollar_label_instance (label)
982 long label;
983 {
984 long *i;
985
986 know ((dollar_labels != NULL) || (dollar_label_count == 0));
987
988 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
989 if (*i == label)
990 return (dollar_label_instances[i - dollar_labels]);
991
992 /* If we get here, we haven't seen the label before, therefore its instance
993 count is zero. */
994 return 0;
995 }
996
997 void
998 dollar_label_clear ()
999 {
1000 memset (dollar_label_defines, '\0', (unsigned int) dollar_label_count);
1001 }
1002
1003 #define DOLLAR_LABEL_BUMP_BY 10
1004
1005 void
1006 define_dollar_label (label)
1007 long label;
1008 {
1009 long *i;
1010
1011 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
1012 if (*i == label)
1013 {
1014 ++dollar_label_instances[i - dollar_labels];
1015 dollar_label_defines[i - dollar_labels] = 1;
1016 return;
1017 }
1018
1019 /* if we get to here, we don't have label listed yet. */
1020
1021 if (dollar_labels == NULL)
1022 {
1023 dollar_labels = (long *) xmalloc (DOLLAR_LABEL_BUMP_BY * sizeof (long));
1024 dollar_label_instances = (long *) xmalloc (DOLLAR_LABEL_BUMP_BY * sizeof (long));
1025 dollar_label_defines = xmalloc (DOLLAR_LABEL_BUMP_BY);
1026 dollar_label_max = DOLLAR_LABEL_BUMP_BY;
1027 dollar_label_count = 0;
1028 }
1029 else if (dollar_label_count == dollar_label_max)
1030 {
1031 dollar_label_max += DOLLAR_LABEL_BUMP_BY;
1032 dollar_labels = (long *) xrealloc ((char *) dollar_labels,
1033 dollar_label_max * sizeof (long));
1034 dollar_label_instances = (long *) xrealloc ((char *) dollar_label_instances,
1035 dollar_label_max * sizeof (long));
1036 dollar_label_defines = xrealloc (dollar_label_defines, dollar_label_max);
1037 } /* if we needed to grow */
1038
1039 dollar_labels[dollar_label_count] = label;
1040 dollar_label_instances[dollar_label_count] = 1;
1041 dollar_label_defines[dollar_label_count] = 1;
1042 ++dollar_label_count;
1043 }
1044
1045 /*
1046 * dollar_label_name()
1047 *
1048 * Caller must copy returned name: we re-use the area for the next name.
1049 *
1050 * The mth occurence of label n: is turned into the symbol "Ln^Am"
1051 * where n is the label number and m is the instance number. "L" makes
1052 * it a label discarded unless debugging and "^A"('\1') ensures no
1053 * ordinary symbol SHOULD get the same name as a local label
1054 * symbol. The first "4:" is "L4^A1" - the m numbers begin at 1.
1055 *
1056 * fb labels get the same treatment, except that ^B is used in place of ^A.
1057 */
1058
1059 char * /* Return local label name. */
1060 dollar_label_name (n, augend)
1061 register long n; /* we just saw "n$:" : n a number */
1062 register int augend; /* 0 for current instance, 1 for new instance */
1063 {
1064 long i;
1065 /* Returned to caller, then copied. used for created names ("4f") */
1066 static char symbol_name_build[24];
1067 register char *p;
1068 register char *q;
1069 char symbol_name_temporary[20]; /* build up a number, BACKWARDS */
1070
1071 know (n >= 0);
1072 know (augend == 0 || augend == 1);
1073 p = symbol_name_build;
1074 *p++ = 'L';
1075
1076 /* Next code just does sprintf( {}, "%d", n); */
1077 /* label number */
1078 q = symbol_name_temporary;
1079 for (*q++ = 0, i = n; i; ++q)
1080 {
1081 *q = i % 10 + '0';
1082 i /= 10;
1083 }
1084 while ((*p = *--q) != '\0')
1085 ++p;
1086
1087 *p++ = 1; /* ^A */
1088
1089 /* instance number */
1090 q = symbol_name_temporary;
1091 for (*q++ = 0, i = dollar_label_instance (n) + augend; i; ++q)
1092 {
1093 *q = i % 10 + '0';
1094 i /= 10;
1095 }
1096 while ((*p++ = *--q) != '\0');;
1097
1098 /* The label, as a '\0' ended string, starts at symbol_name_build. */
1099 return symbol_name_build;
1100 }
1101
1102 /*
1103 * Sombody else's idea of local labels. They are made by "n:" where n
1104 * is any decimal digit. Refer to them with
1105 * "nb" for previous (backward) n:
1106 * or "nf" for next (forward) n:.
1107 *
1108 * We do a little better and let n be any number, not just a single digit, but
1109 * since the other guy's assembler only does ten, we treat the first ten
1110 * specially.
1111 *
1112 * Like someone else's assembler, we have one set of local label counters for
1113 * entire assembly, not one set per (sub)segment like in most assemblers. This
1114 * implies that one can refer to a label in another segment, and indeed some
1115 * crufty compilers have done just that.
1116 *
1117 * Since there could be a LOT of these things, treat them as a sparse array.
1118 */
1119
1120 #define FB_LABEL_SPECIAL (10)
1121
1122 static long fb_low_counter[FB_LABEL_SPECIAL];
1123 static long *fb_labels;
1124 static long *fb_label_instances;
1125 static long fb_label_count;
1126 static long fb_label_max;
1127
1128 /* this must be more than FB_LABEL_SPECIAL */
1129 #define FB_LABEL_BUMP_BY (FB_LABEL_SPECIAL + 6)
1130
1131 static void
1132 fb_label_init ()
1133 {
1134 memset ((void *) fb_low_counter, '\0', sizeof (fb_low_counter));
1135 } /* fb_label_init() */
1136
1137 /* add one to the instance number of this fb label */
1138 void
1139 fb_label_instance_inc (label)
1140 long label;
1141 {
1142 long *i;
1143
1144 if (label < FB_LABEL_SPECIAL)
1145 {
1146 ++fb_low_counter[label];
1147 return;
1148 }
1149
1150 if (fb_labels != NULL)
1151 {
1152 for (i = fb_labels + FB_LABEL_SPECIAL;
1153 i < fb_labels + fb_label_count; ++i)
1154 {
1155 if (*i == label)
1156 {
1157 ++fb_label_instances[i - fb_labels];
1158 return;
1159 } /* if we find it */
1160 } /* for each existing label */
1161 }
1162
1163 /* if we get to here, we don't have label listed yet. */
1164
1165 if (fb_labels == NULL)
1166 {
1167 fb_labels = (long *) xmalloc (FB_LABEL_BUMP_BY * sizeof (long));
1168 fb_label_instances = (long *) xmalloc (FB_LABEL_BUMP_BY * sizeof (long));
1169 fb_label_max = FB_LABEL_BUMP_BY;
1170 fb_label_count = FB_LABEL_SPECIAL;
1171
1172 }
1173 else if (fb_label_count == fb_label_max)
1174 {
1175 fb_label_max += FB_LABEL_BUMP_BY;
1176 fb_labels = (long *) xrealloc ((char *) fb_labels,
1177 fb_label_max * sizeof (long));
1178 fb_label_instances = (long *) xrealloc ((char *) fb_label_instances,
1179 fb_label_max * sizeof (long));
1180 } /* if we needed to grow */
1181
1182 fb_labels[fb_label_count] = label;
1183 fb_label_instances[fb_label_count] = 1;
1184 ++fb_label_count;
1185 }
1186
1187 static long
1188 fb_label_instance (label)
1189 long label;
1190 {
1191 long *i;
1192
1193 if (label < FB_LABEL_SPECIAL)
1194 {
1195 return (fb_low_counter[label]);
1196 }
1197
1198 if (fb_labels != NULL)
1199 {
1200 for (i = fb_labels + FB_LABEL_SPECIAL;
1201 i < fb_labels + fb_label_count; ++i)
1202 {
1203 if (*i == label)
1204 {
1205 return (fb_label_instances[i - fb_labels]);
1206 } /* if we find it */
1207 } /* for each existing label */
1208 }
1209
1210 /* We didn't find the label, so this must be a reference to the
1211 first instance. */
1212 return 0;
1213 }
1214
1215 /*
1216 * fb_label_name()
1217 *
1218 * Caller must copy returned name: we re-use the area for the next name.
1219 *
1220 * The mth occurence of label n: is turned into the symbol "Ln^Bm"
1221 * where n is the label number and m is the instance number. "L" makes
1222 * it a label discarded unless debugging and "^B"('\2') ensures no
1223 * ordinary symbol SHOULD get the same name as a local label
1224 * symbol. The first "4:" is "L4^B1" - the m numbers begin at 1.
1225 *
1226 * dollar labels get the same treatment, except that ^A is used in place of ^B. */
1227
1228 char * /* Return local label name. */
1229 fb_label_name (n, augend)
1230 long n; /* we just saw "n:", "nf" or "nb" : n a number */
1231 long augend; /* 0 for nb, 1 for n:, nf */
1232 {
1233 long i;
1234 /* Returned to caller, then copied. used for created names ("4f") */
1235 static char symbol_name_build[24];
1236 register char *p;
1237 register char *q;
1238 char symbol_name_temporary[20]; /* build up a number, BACKWARDS */
1239
1240 know (n >= 0);
1241 know (augend == 0 || augend == 1);
1242 p = symbol_name_build;
1243 *p++ = 'L';
1244
1245 /* Next code just does sprintf( {}, "%d", n); */
1246 /* label number */
1247 q = symbol_name_temporary;
1248 for (*q++ = 0, i = n; i; ++q)
1249 {
1250 *q = i % 10 + '0';
1251 i /= 10;
1252 }
1253 while ((*p = *--q) != '\0')
1254 ++p;
1255
1256 *p++ = 2; /* ^B */
1257
1258 /* instance number */
1259 q = symbol_name_temporary;
1260 for (*q++ = 0, i = fb_label_instance (n) + augend; i; ++q)
1261 {
1262 *q = i % 10 + '0';
1263 i /= 10;
1264 }
1265 while ((*p++ = *--q) != '\0');;
1266
1267 /* The label, as a '\0' ended string, starts at symbol_name_build. */
1268 return (symbol_name_build);
1269 } /* fb_label_name() */
1270
1271 /*
1272 * decode name that may have been generated by foo_label_name() above. If
1273 * the name wasn't generated by foo_label_name(), then return it unaltered.
1274 * This is used for error messages.
1275 */
1276
1277 char *
1278 decode_local_label_name (s)
1279 char *s;
1280 {
1281 char *p;
1282 char *symbol_decode;
1283 int label_number;
1284 int instance_number;
1285 char *type;
1286 const char *message_format = "\"%d\" (instance number %d of a %s label)";
1287
1288 if (s[0] != 'L')
1289 return s;
1290
1291 for (label_number = 0, p = s + 1; isdigit ((unsigned char) *p); ++p)
1292 label_number = (10 * label_number) + *p - '0';
1293
1294 if (*p == 1)
1295 type = "dollar";
1296 else if (*p == 2)
1297 type = "fb";
1298 else
1299 return s;
1300
1301 for (instance_number = 0, p++; isdigit ((unsigned char) *p); ++p)
1302 instance_number = (10 * instance_number) + *p - '0';
1303
1304 symbol_decode = obstack_alloc (&notes, strlen (message_format) + 30);
1305 sprintf (symbol_decode, message_format, label_number, instance_number, type);
1306
1307 return symbol_decode;
1308 }
1309
1310 /* Get the value of a symbol. */
1311
1312 valueT
1313 S_GET_VALUE (s)
1314 symbolS *s;
1315 {
1316 if (!s->sy_resolved && s->sy_value.X_op != O_constant)
1317 resolve_symbol_value (s, 1);
1318 if (s->sy_value.X_op != O_constant)
1319 {
1320 static symbolS *recur;
1321
1322 /* FIXME: In non BFD assemblers, S_IS_DEFINED and S_IS_COMMON
1323 may call S_GET_VALUE. We use a static symbol to avoid the
1324 immediate recursion. */
1325 if (recur == s)
1326 return (valueT) s->sy_value.X_add_number;
1327 recur = s;
1328 if (! s->sy_resolved
1329 || s->sy_value.X_op != O_symbol
1330 || (S_IS_DEFINED (s) && ! S_IS_COMMON (s)))
1331 as_bad ("Attempt to get value of unresolved symbol %s",
1332 S_GET_NAME (s));
1333 recur = NULL;
1334 }
1335 return (valueT) s->sy_value.X_add_number;
1336 }
1337
1338 /* Set the value of a symbol. */
1339
1340 void
1341 S_SET_VALUE (s, val)
1342 symbolS *s;
1343 valueT val;
1344 {
1345 s->sy_value.X_op = O_constant;
1346 s->sy_value.X_add_number = (offsetT) val;
1347 s->sy_value.X_unsigned = 0;
1348 }
1349
1350 void
1351 copy_symbol_attributes (dest, src)
1352 symbolS *dest, *src;
1353 {
1354 #ifdef BFD_ASSEMBLER
1355 /* In an expression, transfer the settings of these flags.
1356 The user can override later, of course. */
1357 #define COPIED_SYMFLAGS (BSF_FUNCTION | BSF_OBJECT)
1358 dest->bsym->flags |= src->bsym->flags & COPIED_SYMFLAGS;
1359 #endif
1360
1361 #ifdef OBJ_COPY_SYMBOL_ATTRIBUTES
1362 OBJ_COPY_SYMBOL_ATTRIBUTES (dest, src);
1363 #endif
1364 }
1365
1366 #ifdef BFD_ASSEMBLER
1367
1368 int
1369 S_IS_EXTERNAL (s)
1370 symbolS *s;
1371 {
1372 flagword flags = s->bsym->flags;
1373
1374 /* sanity check */
1375 if ((flags & BSF_LOCAL) && (flags & BSF_GLOBAL))
1376 abort ();
1377
1378 return (flags & BSF_GLOBAL) != 0;
1379 }
1380
1381 int
1382 S_IS_WEAK (s)
1383 symbolS *s;
1384 {
1385 return (s->bsym->flags & BSF_WEAK) != 0;
1386 }
1387
1388 int
1389 S_IS_COMMON (s)
1390 symbolS *s;
1391 {
1392 return bfd_is_com_section (s->bsym->section);
1393 }
1394
1395 int
1396 S_IS_DEFINED (s)
1397 symbolS *s;
1398 {
1399 return s->bsym->section != undefined_section;
1400 }
1401
1402 int
1403 S_IS_DEBUG (s)
1404 symbolS *s;
1405 {
1406 if (s->bsym->flags & BSF_DEBUGGING)
1407 return 1;
1408 return 0;
1409 }
1410
1411 int
1412 S_IS_LOCAL (s)
1413 symbolS *s;
1414 {
1415 flagword flags = s->bsym->flags;
1416 const char *name;
1417
1418 /* sanity check */
1419 if ((flags & BSF_LOCAL) && (flags & BSF_GLOBAL))
1420 abort ();
1421
1422 if (bfd_get_section (s->bsym) == reg_section)
1423 return 1;
1424
1425 if (flag_strip_local_absolute
1426 && (flags & BSF_GLOBAL) == 0
1427 && bfd_get_section (s->bsym) == absolute_section)
1428 return 1;
1429
1430 name = S_GET_NAME (s);
1431 return (name != NULL
1432 && ! S_IS_DEBUG (s)
1433 && (strchr (name, '\001')
1434 || strchr (name, '\002')
1435 || (! flag_keep_locals
1436 && (bfd_is_local_label (stdoutput, s->bsym)
1437 || (flag_mri
1438 && name[0] == '?'
1439 && name[1] == '?')))));
1440 }
1441
1442 int
1443 S_IS_EXTERN (s)
1444 symbolS *s;
1445 {
1446 return S_IS_EXTERNAL (s);
1447 }
1448
1449 int
1450 S_IS_STABD (s)
1451 symbolS *s;
1452 {
1453 return S_GET_NAME (s) == 0;
1454 }
1455
1456 CONST char *
1457 S_GET_NAME (s)
1458 symbolS *s;
1459 {
1460 return s->bsym->name;
1461 }
1462
1463 segT
1464 S_GET_SEGMENT (s)
1465 symbolS *s;
1466 {
1467 return s->bsym->section;
1468 }
1469
1470 void
1471 S_SET_SEGMENT (s, seg)
1472 symbolS *s;
1473 segT seg;
1474 {
1475 /* Don't reassign section symbols. The direct reason is to prevent seg
1476 faults assigning back to const global symbols such as *ABS*, but it
1477 shouldn't happen anyway. */
1478
1479 if (s->bsym->flags & BSF_SECTION_SYM)
1480 {
1481 if (s->bsym->section != seg)
1482 abort();
1483 }
1484 else
1485 s->bsym->section = seg;
1486 }
1487
1488 void
1489 S_SET_EXTERNAL (s)
1490 symbolS *s;
1491 {
1492 if ((s->bsym->flags & BSF_WEAK) != 0)
1493 {
1494 /* Let .weak override .global. */
1495 return;
1496 }
1497 s->bsym->flags |= BSF_GLOBAL;
1498 s->bsym->flags &= ~(BSF_LOCAL|BSF_WEAK);
1499 }
1500
1501 void
1502 S_CLEAR_EXTERNAL (s)
1503 symbolS *s;
1504 {
1505 if ((s->bsym->flags & BSF_WEAK) != 0)
1506 {
1507 /* Let .weak override. */
1508 return;
1509 }
1510 s->bsym->flags |= BSF_LOCAL;
1511 s->bsym->flags &= ~(BSF_GLOBAL|BSF_WEAK);
1512 }
1513
1514 void
1515 S_SET_WEAK (s)
1516 symbolS *s;
1517 {
1518 s->bsym->flags |= BSF_WEAK;
1519 s->bsym->flags &= ~(BSF_GLOBAL|BSF_LOCAL);
1520 }
1521
1522 void
1523 S_SET_NAME (s, name)
1524 symbolS *s;
1525 char *name;
1526 {
1527 s->bsym->name = name;
1528 }
1529 #endif /* BFD_ASSEMBLER */
1530
1531 void
1532 symbol_begin ()
1533 {
1534 symbol_lastP = NULL;
1535 symbol_rootP = NULL; /* In case we have 0 symbols (!!) */
1536 sy_hash = hash_new ();
1537
1538 memset ((char *) (&abs_symbol), '\0', sizeof (abs_symbol));
1539 #ifdef BFD_ASSEMBLER
1540 #if defined (EMIT_SECTION_SYMBOLS) || !defined (RELOC_REQUIRES_SYMBOL)
1541 abs_symbol.bsym = bfd_abs_section.symbol;
1542 #endif
1543 #else
1544 /* Can't initialise a union. Sigh. */
1545 S_SET_SEGMENT (&abs_symbol, absolute_section);
1546 #endif
1547 abs_symbol.sy_value.X_op = O_constant;
1548 abs_symbol.sy_frag = &zero_address_frag;
1549
1550 if (LOCAL_LABELS_FB)
1551 fb_label_init ();
1552 }
1553
1554 \f
1555 int indent_level;
1556
1557 /* Maximum indent level.
1558 Available for modification inside a gdb session. */
1559 int max_indent_level = 8;
1560
1561 #if 0
1562
1563 static void
1564 indent ()
1565 {
1566 printf ("%*s", indent_level * 4, "");
1567 }
1568
1569 #endif
1570
1571 void
1572 print_symbol_value_1 (file, sym)
1573 FILE *file;
1574 symbolS *sym;
1575 {
1576 const char *name = S_GET_NAME (sym);
1577 if (!name || !name[0])
1578 name = "(unnamed)";
1579 fprintf (file, "sym %lx %s", (unsigned long) sym, name);
1580 if (sym->sy_frag != &zero_address_frag)
1581 fprintf (file, " frag %lx", (long) sym->sy_frag);
1582 if (sym->written)
1583 fprintf (file, " written");
1584 if (sym->sy_resolved)
1585 fprintf (file, " resolved");
1586 else if (sym->sy_resolving)
1587 fprintf (file, " resolving");
1588 if (sym->sy_used_in_reloc)
1589 fprintf (file, " used-in-reloc");
1590 if (sym->sy_used)
1591 fprintf (file, " used");
1592 if (S_IS_LOCAL (sym))
1593 fprintf (file, " local");
1594 if (S_IS_EXTERN (sym))
1595 fprintf (file, " extern");
1596 if (S_IS_DEBUG (sym))
1597 fprintf (file, " debug");
1598 if (S_IS_DEFINED (sym))
1599 fprintf (file, " defined");
1600 fprintf (file, " %s", segment_name (S_GET_SEGMENT (sym)));
1601 if (sym->sy_resolved)
1602 {
1603 segT s = S_GET_SEGMENT (sym);
1604
1605 if (s != undefined_section
1606 && s != expr_section)
1607 fprintf (file, " %lx", (long) S_GET_VALUE (sym));
1608 }
1609 else if (indent_level < max_indent_level
1610 && S_GET_SEGMENT (sym) != undefined_section)
1611 {
1612 indent_level++;
1613 fprintf (file, "\n%*s<", indent_level * 4, "");
1614 print_expr_1 (file, &sym->sy_value);
1615 fprintf (file, ">");
1616 indent_level--;
1617 }
1618 fflush (file);
1619 }
1620
1621 void
1622 print_symbol_value (sym)
1623 symbolS *sym;
1624 {
1625 indent_level = 0;
1626 print_symbol_value_1 (stderr, sym);
1627 fprintf (stderr, "\n");
1628 }
1629
1630 static void
1631 print_binary (file, name, exp)
1632 FILE *file;
1633 const char * name;
1634 expressionS *exp;
1635 {
1636 indent_level++;
1637 fprintf (file, "%s\n%*s<", name, indent_level * 4, "");
1638 print_symbol_value_1 (file, exp->X_add_symbol);
1639 fprintf (file, ">\n%*s<", indent_level * 4, "");
1640 print_symbol_value_1 (file, exp->X_op_symbol);
1641 fprintf (file, ">");
1642 indent_level--;
1643 }
1644
1645 void
1646 print_expr_1 (file, exp)
1647 FILE *file;
1648 expressionS *exp;
1649 {
1650 fprintf (file, "expr %lx ", (long) exp);
1651 switch (exp->X_op)
1652 {
1653 case O_illegal:
1654 fprintf (file, "illegal");
1655 break;
1656 case O_absent:
1657 fprintf (file, "absent");
1658 break;
1659 case O_constant:
1660 fprintf (file, "constant %lx", (long) exp->X_add_number);
1661 break;
1662 case O_symbol:
1663 indent_level++;
1664 fprintf (file, "symbol\n%*s<", indent_level * 4, "");
1665 print_symbol_value_1 (file, exp->X_add_symbol);
1666 fprintf (file, ">");
1667 maybe_print_addnum:
1668 if (exp->X_add_number)
1669 fprintf (file, "\n%*s%lx", indent_level * 4, "",
1670 (long) exp->X_add_number);
1671 indent_level--;
1672 break;
1673 case O_register:
1674 fprintf (file, "register #%d", (int) exp->X_add_number);
1675 break;
1676 case O_big:
1677 fprintf (file, "big");
1678 break;
1679 case O_uminus:
1680 fprintf (file, "uminus -<");
1681 indent_level++;
1682 print_symbol_value_1 (file, exp->X_add_symbol);
1683 fprintf (file, ">");
1684 goto maybe_print_addnum;
1685 case O_bit_not:
1686 fprintf (file, "bit_not");
1687 break;
1688 case O_multiply:
1689 print_binary (file, "multiply", exp);
1690 break;
1691 case O_divide:
1692 print_binary (file, "divide", exp);
1693 break;
1694 case O_modulus:
1695 print_binary (file, "modulus", exp);
1696 break;
1697 case O_left_shift:
1698 print_binary (file, "lshift", exp);
1699 break;
1700 case O_right_shift:
1701 print_binary (file, "rshift", exp);
1702 break;
1703 case O_bit_inclusive_or:
1704 print_binary (file, "bit_ior", exp);
1705 break;
1706 case O_bit_exclusive_or:
1707 print_binary (file, "bit_xor", exp);
1708 break;
1709 case O_bit_and:
1710 print_binary (file, "bit_and", exp);
1711 break;
1712 case O_eq:
1713 print_binary (file, "eq", exp);
1714 break;
1715 case O_ne:
1716 print_binary (file, "ne", exp);
1717 break;
1718 case O_lt:
1719 print_binary (file, "lt", exp);
1720 break;
1721 case O_le:
1722 print_binary (file, "le", exp);
1723 break;
1724 case O_ge:
1725 print_binary (file, "ge", exp);
1726 break;
1727 case O_gt:
1728 print_binary (file, "gt", exp);
1729 break;
1730 case O_logical_and:
1731 print_binary (file, "logical_and", exp);
1732 break;
1733 case O_logical_or:
1734 print_binary (file, "logical_or", exp);
1735 break;
1736 case O_add:
1737 indent_level++;
1738 fprintf (file, "add\n%*s<", indent_level * 4, "");
1739 print_symbol_value_1 (file, exp->X_add_symbol);
1740 fprintf (file, ">\n%*s<", indent_level * 4, "");
1741 print_symbol_value_1 (file, exp->X_op_symbol);
1742 fprintf (file, ">");
1743 goto maybe_print_addnum;
1744 case O_subtract:
1745 indent_level++;
1746 fprintf (file, "subtract\n%*s<", indent_level * 4, "");
1747 print_symbol_value_1 (file, exp->X_add_symbol);
1748 fprintf (file, ">\n%*s<", indent_level * 4, "");
1749 print_symbol_value_1 (file, exp->X_op_symbol);
1750 fprintf (file, ">");
1751 goto maybe_print_addnum;
1752 default:
1753 fprintf (file, "{unknown opcode %d}", (int) exp->X_op);
1754 break;
1755 }
1756 fflush (stdout);
1757 }
1758
1759 void
1760 print_expr (exp)
1761 expressionS *exp;
1762 {
1763 print_expr_1 (stderr, exp);
1764 fprintf (stderr, "\n");
1765 }
1766
1767 void
1768 symbol_print_statistics (file)
1769 FILE *file;
1770 {
1771 hash_print_statistics (file, "symbol table", sy_hash);
1772 }
1773
1774 /* end of symbols.c */
This page took 0.072525 seconds and 5 git commands to generate.