1 /* symbols.c -symbol table-
2 Copyright (C) 1987, 90, 91, 92, 93, 94, 95, 96, 97, 1998
3 Free Software Foundation, Inc.
5 This file is part of GAS, the GNU Assembler.
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)
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.
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
22 /* #define DEBUG_SYMS / * to debug symbol list maintenance */
28 #include "obstack.h" /* For "symbols.h" */
31 /* This is non-zero if symbols are case sensitive, which is the
33 int symbols_case_sensitive = 1;
35 #ifndef WORKING_DOT_WORD
36 extern int new_broken_words;
39 /* symbol-name => struct symbol pointer */
40 static struct hash_control *sy_hash;
42 /* Below are commented in "symbols.h". */
43 symbolS *symbol_rootP;
44 symbolS *symbol_lastP;
48 #define debug_verify_symchain verify_symbol_chain
50 #define debug_verify_symchain(root, last) ((void) 0)
55 static void fb_label_init PARAMS ((void));
56 static long dollar_label_instance PARAMS ((long));
57 static long fb_label_instance PARAMS ((long));
59 static void print_binary PARAMS ((FILE *, const char *, expressionS *));
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
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. */
73 symbol_new (name, segment, valu, frag)
79 symbolS *symbolP = symbol_create (name, segment, valu, frag);
82 * Link to end of symbol chain.
86 extern int symbol_table_frozen;
87 if (symbol_table_frozen)
91 symbol_append (symbolP, symbol_lastP, &symbol_rootP, &symbol_lastP);
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 */
103 unsigned int name_length;
104 char *preserved_copy_of_name;
107 name_length = strlen (name) + 1; /* +1 for \0 */
108 obstack_grow (¬es, name, name_length);
109 preserved_copy_of_name = obstack_finish (¬es);
110 #ifdef STRIP_UNDERSCORE
111 if (preserved_copy_of_name[0] == '_')
112 preserved_copy_of_name++;
115 #ifdef tc_canonicalize_symbol_name
116 preserved_copy_of_name =
117 tc_canonicalize_symbol_name (preserved_copy_of_name);
120 if (! symbols_case_sensitive)
124 for (s = (unsigned char *) preserved_copy_of_name; *s != '\0'; s++)
129 symbolP = (symbolS *) obstack_alloc (¬es, sizeof (symbolS));
131 /* symbol must be born in some fixed state. This seems as good as any. */
132 memset (symbolP, 0, sizeof (symbolS));
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;
140 S_SET_NAME (symbolP, preserved_copy_of_name);
142 S_SET_SEGMENT (symbolP, segment);
143 S_SET_VALUE (symbolP, valu);
144 symbol_clear_list_pointers (symbolP);
146 symbolP->sy_frag = frag;
147 #ifndef BFD_ASSEMBLER
148 symbolP->sy_number = ~0;
149 symbolP->sy_name_offset = (unsigned int) ~0;
152 obj_symbol_new_hook (symbolP);
154 #ifdef tc_symbol_new_hook
155 tc_symbol_new_hook (symbolP);
165 * We have just seen "<name>:".
166 * Creates a struct symbol unless it already exists.
168 * Gripes if we are redefining a symbol incompatibly (and ignores it).
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. */
176 register symbolS *symbolP; /* symbol we are working with */
178 /* Sun local labels go out of scope whenever a non-local symbol is
180 if (LOCAL_LABELS_DOLLAR)
185 local = bfd_is_local_label_name (stdoutput, sym_name);
187 local = LOCAL_LABEL (sym_name);
191 dollar_label_clear ();
194 #ifndef WORKING_DOT_WORD
195 if (new_broken_words)
197 struct broken_word *a;
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);
208 frag_opcode = frag_var (rs_broken_word,
212 (symbolS *) broken_words,
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
220 && (frag_tmp->fr_type != rs_broken_word
221 || frag_tmp->fr_opcode))
222 frag_tmp = frag_tmp->fr_next;
224 frag_tmp->fr_opcode = frag_opcode;
225 new_broken_words = 0;
227 for (a = broken_words; a && a->dispfrag == 0; a = a->next_broken_word)
228 a->dispfrag = frag_tmp;
230 #endif /* WORKING_DOT_WORD */
232 if ((symbolP = symbol_find (sym_name)) != 0)
234 #ifdef RESOLVE_SYMBOL_REDEFINITION
235 if (RESOLVE_SYMBOL_REDEFINITION (symbolP))
239 * Now check for undefined symbols
241 if (!S_IS_DEFINED (symbolP) || S_IS_COMMON (symbolP))
243 if (S_GET_VALUE (symbolP) == 0)
245 symbolP->sy_frag = frag_now;
247 S_SET_OTHER(symbolP, const_flag);
249 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
250 S_SET_SEGMENT (symbolP, now_seg);
253 #endif /* if we have one, it better be zero. */
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
265 * This only used to be allowed on VMS gas, but Sun cc
266 * on the sparc also depends on it.
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)))
277 * Select which of the 2 cases this is
279 if (now_seg != data_section)
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
287 if (S_GET_VALUE (symbolP)
288 < ((unsigned) frag_now_fix ()))
290 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
295 /* It is a .comm/.lcomm being converted to initialized
297 symbolP->sy_frag = frag_now;
299 S_SET_OTHER(symbolP, const_flag);
301 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
302 S_SET_SEGMENT (symbolP, now_seg); /* keep N_EXT bit */
307 #if defined (S_GET_OTHER) && defined (S_GET_DESC)
308 as_fatal (_("Symbol \"%s\" is already defined as \"%s\"/%d.%d.%ld."),
310 segment_name (S_GET_SEGMENT (symbolP)),
311 S_GET_OTHER (symbolP), S_GET_DESC (symbolP),
312 (long) S_GET_VALUE (symbolP));
314 as_fatal (_("Symbol \"%s\" is already defined as \"%s\"/%ld."),
316 segment_name (S_GET_SEGMENT (symbolP)),
317 (long) S_GET_VALUE (symbolP));
320 } /* if the undefined symbol has no value */
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 */
334 symbolP = symbol_new (sym_name, now_seg, (valueT) frag_now_fix (),
337 S_SET_OTHER (symbolP, const_flag);
340 symbol_table_insert (symbolP);
341 } /* if we have seen this symbol before */
343 if (mri_common_symbol != NULL)
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;
356 tc_frob_label (symbolP);
358 #ifdef obj_frob_label
359 obj_frob_label (symbolP);
367 * symbol_table_insert()
369 * Die if we can't insert the symbol.
374 symbol_table_insert (symbolP)
377 register const char *error_string;
380 know (S_GET_NAME (symbolP));
382 if ((error_string = hash_jam (sy_hash, S_GET_NAME (symbolP), (PTR) symbolP)))
384 as_fatal (_("Inserting \"%s\" into symbol table failed: %s"),
385 S_GET_NAME (symbolP), error_string);
387 } /* symbol_table_insert() */
390 * symbol_find_or_make()
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.
396 symbol_find_or_make (name)
399 register symbolS *symbolP;
401 symbolP = symbol_find (name);
405 symbolP = symbol_make (name);
407 symbol_table_insert (symbolP);
408 } /* if symbol wasn't found */
411 } /* symbol_find_or_make() */
419 /* Let the machine description default it, e.g. for register names. */
420 symbolP = md_undefined_symbol ((char *) name);
423 symbolP = symbol_new (name, undefined_section, (valueT) 0, &zero_address_frag);
426 } /* symbol_make() */
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.
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() */
449 symbol_find_base (name, strip_underscore)
451 int strip_underscore;
453 if (strip_underscore && *name == '_')
456 #ifdef tc_canonicalize_symbol_name
459 size_t len = strlen (name) + 1;
461 copy = (char *) alloca (len);
462 memcpy (copy, name, len);
463 name = tc_canonicalize_symbol_name (copy);
467 if (! symbols_case_sensitive)
474 name = copy = (char *) alloca (strlen (name) + 1);
476 while ((c = *orig++) != '\0')
485 return ((symbolS *) hash_find (sy_hash, name));
489 * Once upon a time, symbols were kept in a singly linked list. At
490 * least coff needs to be able to rearrange them from time to time, for
491 * which a doubly linked list is much more convenient. Loic did these
492 * as macros which seemed dangerous to me so they're now functions.
496 /* Link symbol ADDME after symbol TARGET in the chain. */
498 symbol_append (addme, target, rootPP, lastPP)
506 know (*rootPP == NULL);
507 know (*lastPP == NULL);
508 addme->sy_next = NULL;
509 #ifdef SYMBOLS_NEED_BACKPOINTERS
510 addme->sy_previous = NULL;
515 } /* if the list is empty */
517 if (target->sy_next != NULL)
519 #ifdef SYMBOLS_NEED_BACKPOINTERS
520 target->sy_next->sy_previous = addme;
521 #endif /* SYMBOLS_NEED_BACKPOINTERS */
525 know (*lastPP == target);
527 } /* if we have a next */
529 addme->sy_next = target->sy_next;
530 target->sy_next = addme;
532 #ifdef SYMBOLS_NEED_BACKPOINTERS
533 addme->sy_previous = target;
534 #endif /* SYMBOLS_NEED_BACKPOINTERS */
536 debug_verify_symchain (symbol_rootP, symbol_lastP);
539 /* Set the chain pointers of SYMBOL to null. */
541 symbol_clear_list_pointers (symbolP)
544 symbolP->sy_next = NULL;
545 #ifdef SYMBOLS_NEED_BACKPOINTERS
546 symbolP->sy_previous = NULL;
550 #ifdef SYMBOLS_NEED_BACKPOINTERS
551 /* Remove SYMBOLP from the list. */
553 symbol_remove (symbolP, rootPP, lastPP)
558 if (symbolP == *rootPP)
560 *rootPP = symbolP->sy_next;
561 } /* if it was the root */
563 if (symbolP == *lastPP)
565 *lastPP = symbolP->sy_previous;
566 } /* if it was the tail */
568 if (symbolP->sy_next != NULL)
570 symbolP->sy_next->sy_previous = symbolP->sy_previous;
573 if (symbolP->sy_previous != NULL)
575 symbolP->sy_previous->sy_next = symbolP->sy_next;
578 debug_verify_symchain (*rootPP, *lastPP);
581 /* Link symbol ADDME before symbol TARGET in the chain. */
583 symbol_insert (addme, target, rootPP, lastPP)
589 if (target->sy_previous != NULL)
591 target->sy_previous->sy_next = addme;
595 know (*rootPP == target);
599 addme->sy_previous = target->sy_previous;
600 target->sy_previous = addme;
601 addme->sy_next = target;
603 debug_verify_symchain (*rootPP, *lastPP);
606 #endif /* SYMBOLS_NEED_BACKPOINTERS */
609 verify_symbol_chain (rootP, lastP)
613 symbolS *symbolP = rootP;
618 for (; symbol_next (symbolP) != NULL; symbolP = symbol_next (symbolP))
620 #ifdef SYMBOLS_NEED_BACKPOINTERS
621 assert (symbolP->sy_next->sy_previous == symbolP);
623 /* Walk the list anyways, to make sure pointers are still good. */
625 #endif /* SYMBOLS_NEED_BACKPOINTERS */
628 assert (lastP == symbolP);
632 verify_symbol_chain_2 (sym)
635 symbolS *p = sym, *n = sym;
636 #ifdef SYMBOLS_NEED_BACKPOINTERS
637 while (symbol_previous (p))
638 p = symbol_previous (p);
640 while (symbol_next (n))
642 verify_symbol_chain (p, n);
645 /* Resolve the value of a symbol. This is called during the final
646 pass over the symbol table to resolve any symbols with complex
650 resolve_symbol_value (symp, finalize)
658 if (symp->sy_resolved)
660 if (symp->sy_value.X_op == O_constant)
661 return (valueT) symp->sy_value.X_add_number;
667 final_seg = S_GET_SEGMENT (symp);
669 if (symp->sy_resolving)
672 as_bad (_("Symbol definition loop encountered at %s"), S_GET_NAME (symp));
678 symbolS *add_symbol, *op_symbol;
680 segT seg_left, seg_right;
683 symp->sy_resolving = 1;
685 /* Help out with CSE. */
686 add_symbol = symp->sy_value.X_add_symbol;
687 op_symbol = symp->sy_value.X_op_symbol;
688 final_val = symp->sy_value.X_add_number;
689 op = symp->sy_value.X_op;
702 final_val += symp->sy_frag->fr_address;
703 if (final_seg == expr_section)
704 final_seg = absolute_section;
710 left = resolve_symbol_value (add_symbol, finalize);
713 if (symp->sy_mri_common)
715 /* This is a symbol inside an MRI common section. The
716 relocation routines are going to handle it specially.
717 Don't change the value. */
718 resolved = add_symbol->sy_resolved;
722 if (finalize && final_val == 0)
723 copy_symbol_attributes (symp, add_symbol);
725 /* If we have equated this symbol to an undefined symbol, we
726 keep X_op set to O_symbol, and we don't change
727 X_add_number. This permits the routine which writes out
728 relocation to detect this case, and convert the
729 relocation to be against the symbol to which this symbol
731 if (! S_IS_DEFINED (add_symbol) || S_IS_COMMON (add_symbol))
735 S_SET_SEGMENT (symp, S_GET_SEGMENT (add_symbol));
736 symp->sy_value.X_op = O_symbol;
737 symp->sy_value.X_add_symbol = add_symbol;
738 symp->sy_value.X_add_number = final_val;
741 resolved = add_symbol->sy_resolved;
742 goto exit_dont_set_value;
746 final_val += symp->sy_frag->fr_address + left;
747 if (final_seg == expr_section || final_seg == undefined_section)
748 final_seg = S_GET_SEGMENT (add_symbol);
751 resolved = add_symbol->sy_resolved;
757 left = resolve_symbol_value (add_symbol, finalize);
761 else if (op == O_logical_not)
766 final_val += left + symp->sy_frag->fr_address;
767 if (final_seg == expr_section || final_seg == undefined_section)
768 final_seg = absolute_section;
770 resolved = add_symbol->sy_resolved;
778 case O_bit_inclusive_or:
780 case O_bit_exclusive_or:
792 left = resolve_symbol_value (add_symbol, finalize);
793 right = resolve_symbol_value (op_symbol, finalize);
794 seg_left = S_GET_SEGMENT (add_symbol);
795 seg_right = S_GET_SEGMENT (op_symbol);
797 /* Simplify addition or subtraction of a constant by folding the
798 constant into X_add_number. */
799 if (op == O_add || op == O_subtract)
801 if (seg_right == absolute_section)
811 else if (seg_left == absolute_section && op == O_add)
815 add_symbol = op_symbol;
822 /* Subtraction is permitted if both operands are in the same
823 section. Otherwise, both operands must be absolute. We
824 already handled the case of addition or subtraction of a
825 constant above. This will probably need to be changed
826 for an object file format which supports arbitrary
827 expressions, such as IEEE-695. */
828 /* Don't emit messages unless we're finalizing the symbol value,
829 otherwise we may get the same message multiple times. */
830 if ((seg_left != absolute_section || seg_right != absolute_section)
831 && (op != O_subtract || seg_left != seg_right)
837 if (expr_symbol_where (symp, &file, &line))
839 if (seg_left == undefined_section)
840 as_bad_where (file, line,
841 _("undefined symbol %s in operation"),
842 S_GET_NAME (symp->sy_value.X_add_symbol));
843 if (seg_right == undefined_section)
844 as_bad_where (file, line,
845 _("undefined symbol %s in operation"),
846 S_GET_NAME (symp->sy_value.X_op_symbol));
847 if (seg_left != undefined_section
848 && seg_right != undefined_section)
849 as_bad_where (file, line, _("invalid section for operation"));
853 if (seg_left == undefined_section)
854 as_bad (_("undefined symbol %s in operation setting %s"),
855 S_GET_NAME (symp->sy_value.X_add_symbol),
857 if (seg_right == undefined_section)
858 as_bad (_("undefined symbol %s in operation setting %s"),
859 S_GET_NAME (symp->sy_value.X_op_symbol),
861 if (seg_left != undefined_section
862 && seg_right != undefined_section)
863 as_bad (_("invalid section for operation setting %s"),
868 /* Check for division by zero. */
869 if ((op == O_divide || op == O_modulus) && right == 0)
871 /* If seg_right is not absolute_section, then we've
872 already issued a warning about using a bad symbol. */
873 if (seg_right == absolute_section && finalize)
878 if (expr_symbol_where (symp, &file, &line))
879 as_bad_where (file, line, _("division by zero"));
881 as_bad (_("division by zero when setting %s"),
888 switch (symp->sy_value.X_op)
890 case O_multiply: left *= right; break;
891 case O_divide: left /= right; break;
892 case O_modulus: left %= right; break;
893 case O_left_shift: left <<= right; break;
894 case O_right_shift: left >>= right; break;
895 case O_bit_inclusive_or: left |= right; break;
896 case O_bit_or_not: left |= ~right; break;
897 case O_bit_exclusive_or: left ^= right; break;
898 case O_bit_and: left &= right; break;
899 case O_add: left += right; break;
900 case O_subtract: left -= right; break;
901 case O_eq: left = left == right ? ~ (offsetT) 0 : 0; break;
902 case O_ne: left = left != right ? ~ (offsetT) 0 : 0; break;
903 case O_lt: left = left < right ? ~ (offsetT) 0 : 0; break;
904 case O_le: left = left <= right ? ~ (offsetT) 0 : 0; break;
905 case O_ge: left = left >= right ? ~ (offsetT) 0 : 0; break;
906 case O_gt: left = left > right ? ~ (offsetT) 0 : 0; break;
907 case O_logical_and: left = left && right; break;
908 case O_logical_or: left = left || right; break;
912 final_val += symp->sy_frag->fr_address + left;
913 if (final_seg == expr_section || final_seg == undefined_section)
914 final_seg = absolute_section;
915 resolved = (add_symbol->sy_resolved && op_symbol->sy_resolved);
921 /* Give an error (below) if not in expr_section. We don't
922 want to worry about expr_section symbols, because they
923 are fictional (they are created as part of expression
924 resolution), and any problems may not actually mean
929 symp->sy_resolving = 0;
934 S_SET_VALUE (symp, final_val);
936 #if defined (OBJ_AOUT) && ! defined (BFD_ASSEMBLER)
937 /* The old a.out backend does not handle S_SET_SEGMENT correctly
938 for a stab symbol, so we use this bad hack. */
939 if (final_seg != S_GET_SEGMENT (symp))
941 S_SET_SEGMENT (symp, final_seg);
945 /* Don't worry if we can't resolve an expr_section symbol. */
949 symp->sy_resolved = 1;
950 else if (S_GET_SEGMENT (symp) != expr_section)
952 as_bad (_("can't resolve value for symbol \"%s\""), S_GET_NAME (symp));
953 symp->sy_resolved = 1;
960 /* Dollar labels look like a number followed by a dollar sign. Eg, "42$".
961 They are *really* local. That is, they go out of scope whenever we see a
962 label that isn't local. Also, like fb labels, there can be multiple
963 instances of a dollar label. Therefor, we name encode each instance with
964 the instance number, keep a list of defined symbols separate from the real
965 symbol table, and we treat these buggers as a sparse array. */
967 static long *dollar_labels;
968 static long *dollar_label_instances;
969 static char *dollar_label_defines;
970 static unsigned long dollar_label_count;
971 static unsigned long dollar_label_max;
974 dollar_label_defined (label)
979 know ((dollar_labels != NULL) || (dollar_label_count == 0));
981 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
983 return dollar_label_defines[i - dollar_labels];
985 /* if we get here, label isn't defined */
987 } /* dollar_label_defined() */
990 dollar_label_instance (label)
995 know ((dollar_labels != NULL) || (dollar_label_count == 0));
997 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
999 return (dollar_label_instances[i - dollar_labels]);
1001 /* If we get here, we haven't seen the label before, therefore its instance
1007 dollar_label_clear ()
1009 memset (dollar_label_defines, '\0', (unsigned int) dollar_label_count);
1012 #define DOLLAR_LABEL_BUMP_BY 10
1015 define_dollar_label (label)
1020 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
1023 ++dollar_label_instances[i - dollar_labels];
1024 dollar_label_defines[i - dollar_labels] = 1;
1028 /* if we get to here, we don't have label listed yet. */
1030 if (dollar_labels == NULL)
1032 dollar_labels = (long *) xmalloc (DOLLAR_LABEL_BUMP_BY * sizeof (long));
1033 dollar_label_instances = (long *) xmalloc (DOLLAR_LABEL_BUMP_BY * sizeof (long));
1034 dollar_label_defines = xmalloc (DOLLAR_LABEL_BUMP_BY);
1035 dollar_label_max = DOLLAR_LABEL_BUMP_BY;
1036 dollar_label_count = 0;
1038 else if (dollar_label_count == dollar_label_max)
1040 dollar_label_max += DOLLAR_LABEL_BUMP_BY;
1041 dollar_labels = (long *) xrealloc ((char *) dollar_labels,
1042 dollar_label_max * sizeof (long));
1043 dollar_label_instances = (long *) xrealloc ((char *) dollar_label_instances,
1044 dollar_label_max * sizeof (long));
1045 dollar_label_defines = xrealloc (dollar_label_defines, dollar_label_max);
1046 } /* if we needed to grow */
1048 dollar_labels[dollar_label_count] = label;
1049 dollar_label_instances[dollar_label_count] = 1;
1050 dollar_label_defines[dollar_label_count] = 1;
1051 ++dollar_label_count;
1055 * dollar_label_name()
1057 * Caller must copy returned name: we re-use the area for the next name.
1059 * The mth occurence of label n: is turned into the symbol "Ln^Am"
1060 * where n is the label number and m is the instance number. "L" makes
1061 * it a label discarded unless debugging and "^A"('\1') ensures no
1062 * ordinary symbol SHOULD get the same name as a local label
1063 * symbol. The first "4:" is "L4^A1" - the m numbers begin at 1.
1065 * fb labels get the same treatment, except that ^B is used in place of ^A.
1068 char * /* Return local label name. */
1069 dollar_label_name (n, augend)
1070 register long n; /* we just saw "n$:" : n a number */
1071 register int augend; /* 0 for current instance, 1 for new instance */
1074 /* Returned to caller, then copied. used for created names ("4f") */
1075 static char symbol_name_build[24];
1078 char symbol_name_temporary[20]; /* build up a number, BACKWARDS */
1081 know (augend == 0 || augend == 1);
1082 p = symbol_name_build;
1085 /* Next code just does sprintf( {}, "%d", n); */
1087 q = symbol_name_temporary;
1088 for (*q++ = 0, i = n; i; ++q)
1093 while ((*p = *--q) != '\0')
1098 /* instance number */
1099 q = symbol_name_temporary;
1100 for (*q++ = 0, i = dollar_label_instance (n) + augend; i; ++q)
1105 while ((*p++ = *--q) != '\0');;
1107 /* The label, as a '\0' ended string, starts at symbol_name_build. */
1108 return symbol_name_build;
1112 * Sombody else's idea of local labels. They are made by "n:" where n
1113 * is any decimal digit. Refer to them with
1114 * "nb" for previous (backward) n:
1115 * or "nf" for next (forward) n:.
1117 * We do a little better and let n be any number, not just a single digit, but
1118 * since the other guy's assembler only does ten, we treat the first ten
1121 * Like someone else's assembler, we have one set of local label counters for
1122 * entire assembly, not one set per (sub)segment like in most assemblers. This
1123 * implies that one can refer to a label in another segment, and indeed some
1124 * crufty compilers have done just that.
1126 * Since there could be a LOT of these things, treat them as a sparse array.
1129 #define FB_LABEL_SPECIAL (10)
1131 static long fb_low_counter[FB_LABEL_SPECIAL];
1132 static long *fb_labels;
1133 static long *fb_label_instances;
1134 static long fb_label_count;
1135 static long fb_label_max;
1137 /* this must be more than FB_LABEL_SPECIAL */
1138 #define FB_LABEL_BUMP_BY (FB_LABEL_SPECIAL + 6)
1143 memset ((void *) fb_low_counter, '\0', sizeof (fb_low_counter));
1144 } /* fb_label_init() */
1146 /* add one to the instance number of this fb label */
1148 fb_label_instance_inc (label)
1153 if (label < FB_LABEL_SPECIAL)
1155 ++fb_low_counter[label];
1159 if (fb_labels != NULL)
1161 for (i = fb_labels + FB_LABEL_SPECIAL;
1162 i < fb_labels + fb_label_count; ++i)
1166 ++fb_label_instances[i - fb_labels];
1168 } /* if we find it */
1169 } /* for each existing label */
1172 /* if we get to here, we don't have label listed yet. */
1174 if (fb_labels == NULL)
1176 fb_labels = (long *) xmalloc (FB_LABEL_BUMP_BY * sizeof (long));
1177 fb_label_instances = (long *) xmalloc (FB_LABEL_BUMP_BY * sizeof (long));
1178 fb_label_max = FB_LABEL_BUMP_BY;
1179 fb_label_count = FB_LABEL_SPECIAL;
1182 else if (fb_label_count == fb_label_max)
1184 fb_label_max += FB_LABEL_BUMP_BY;
1185 fb_labels = (long *) xrealloc ((char *) fb_labels,
1186 fb_label_max * sizeof (long));
1187 fb_label_instances = (long *) xrealloc ((char *) fb_label_instances,
1188 fb_label_max * sizeof (long));
1189 } /* if we needed to grow */
1191 fb_labels[fb_label_count] = label;
1192 fb_label_instances[fb_label_count] = 1;
1197 fb_label_instance (label)
1202 if (label < FB_LABEL_SPECIAL)
1204 return (fb_low_counter[label]);
1207 if (fb_labels != NULL)
1209 for (i = fb_labels + FB_LABEL_SPECIAL;
1210 i < fb_labels + fb_label_count; ++i)
1214 return (fb_label_instances[i - fb_labels]);
1215 } /* if we find it */
1216 } /* for each existing label */
1219 /* We didn't find the label, so this must be a reference to the
1227 * Caller must copy returned name: we re-use the area for the next name.
1229 * The mth occurence of label n: is turned into the symbol "Ln^Bm"
1230 * where n is the label number and m is the instance number. "L" makes
1231 * it a label discarded unless debugging and "^B"('\2') ensures no
1232 * ordinary symbol SHOULD get the same name as a local label
1233 * symbol. The first "4:" is "L4^B1" - the m numbers begin at 1.
1235 * dollar labels get the same treatment, except that ^A is used in place of ^B. */
1237 char * /* Return local label name. */
1238 fb_label_name (n, augend)
1239 long n; /* we just saw "n:", "nf" or "nb" : n a number */
1240 long augend; /* 0 for nb, 1 for n:, nf */
1243 /* Returned to caller, then copied. used for created names ("4f") */
1244 static char symbol_name_build[24];
1247 char symbol_name_temporary[20]; /* build up a number, BACKWARDS */
1250 know (augend == 0 || augend == 1);
1251 p = symbol_name_build;
1254 /* Next code just does sprintf( {}, "%d", n); */
1256 q = symbol_name_temporary;
1257 for (*q++ = 0, i = n; i; ++q)
1262 while ((*p = *--q) != '\0')
1267 /* instance number */
1268 q = symbol_name_temporary;
1269 for (*q++ = 0, i = fb_label_instance (n) + augend; i; ++q)
1274 while ((*p++ = *--q) != '\0');;
1276 /* The label, as a '\0' ended string, starts at symbol_name_build. */
1277 return (symbol_name_build);
1278 } /* fb_label_name() */
1281 * decode name that may have been generated by foo_label_name() above. If
1282 * the name wasn't generated by foo_label_name(), then return it unaltered.
1283 * This is used for error messages.
1287 decode_local_label_name (s)
1291 char *symbol_decode;
1293 int instance_number;
1295 const char *message_format = _("\"%d\" (instance number %d of a %s label)");
1300 for (label_number = 0, p = s + 1; isdigit ((unsigned char) *p); ++p)
1301 label_number = (10 * label_number) + *p - '0';
1310 for (instance_number = 0, p++; isdigit ((unsigned char) *p); ++p)
1311 instance_number = (10 * instance_number) + *p - '0';
1313 symbol_decode = obstack_alloc (¬es, strlen (message_format) + 30);
1314 sprintf (symbol_decode, message_format, label_number, instance_number, type);
1316 return symbol_decode;
1319 /* Get the value of a symbol. */
1325 if (!s->sy_resolved && s->sy_value.X_op != O_constant)
1326 resolve_symbol_value (s, 1);
1327 if (s->sy_value.X_op != O_constant)
1329 static symbolS *recur;
1331 /* FIXME: In non BFD assemblers, S_IS_DEFINED and S_IS_COMMON
1332 may call S_GET_VALUE. We use a static symbol to avoid the
1333 immediate recursion. */
1335 return (valueT) s->sy_value.X_add_number;
1337 if (! s->sy_resolved
1338 || s->sy_value.X_op != O_symbol
1339 || (S_IS_DEFINED (s) && ! S_IS_COMMON (s)))
1340 as_bad (_("Attempt to get value of unresolved symbol %s"),
1344 return (valueT) s->sy_value.X_add_number;
1347 /* Set the value of a symbol. */
1350 S_SET_VALUE (s, val)
1354 s->sy_value.X_op = O_constant;
1355 s->sy_value.X_add_number = (offsetT) val;
1356 s->sy_value.X_unsigned = 0;
1360 copy_symbol_attributes (dest, src)
1361 symbolS *dest, *src;
1363 #ifdef BFD_ASSEMBLER
1364 /* In an expression, transfer the settings of these flags.
1365 The user can override later, of course. */
1366 #define COPIED_SYMFLAGS (BSF_FUNCTION | BSF_OBJECT)
1367 dest->bsym->flags |= src->bsym->flags & COPIED_SYMFLAGS;
1370 #ifdef OBJ_COPY_SYMBOL_ATTRIBUTES
1371 OBJ_COPY_SYMBOL_ATTRIBUTES (dest, src);
1375 #ifdef BFD_ASSEMBLER
1381 flagword flags = s->bsym->flags;
1383 return (flags & BSF_FUNCTION) != 0;
1390 flagword flags = s->bsym->flags;
1393 if ((flags & BSF_LOCAL) && (flags & BSF_GLOBAL))
1396 return (flags & BSF_GLOBAL) != 0;
1403 return (s->bsym->flags & BSF_WEAK) != 0;
1410 return bfd_is_com_section (s->bsym->section);
1417 return s->bsym->section != undefined_section;
1424 if (s->bsym->flags & BSF_DEBUGGING)
1433 flagword flags = s->bsym->flags;
1437 if ((flags & BSF_LOCAL) && (flags & BSF_GLOBAL))
1440 if (bfd_get_section (s->bsym) == reg_section)
1443 if (flag_strip_local_absolute
1444 && (flags & BSF_GLOBAL) == 0
1445 && bfd_get_section (s->bsym) == absolute_section)
1448 name = S_GET_NAME (s);
1449 return (name != NULL
1451 && (strchr (name, '\001')
1452 || strchr (name, '\002')
1453 || (! flag_keep_locals
1454 && (bfd_is_local_label (stdoutput, s->bsym)
1457 && name[1] == '?')))));
1464 return S_IS_EXTERNAL (s);
1471 return S_GET_NAME (s) == 0;
1478 return s->bsym->name;
1485 return s->bsym->section;
1489 S_SET_SEGMENT (s, seg)
1493 /* Don't reassign section symbols. The direct reason is to prevent seg
1494 faults assigning back to const global symbols such as *ABS*, but it
1495 shouldn't happen anyway. */
1497 if (s->bsym->flags & BSF_SECTION_SYM)
1499 if (s->bsym->section != seg)
1503 s->bsym->section = seg;
1510 if ((s->bsym->flags & BSF_WEAK) != 0)
1512 /* Let .weak override .global. */
1515 s->bsym->flags |= BSF_GLOBAL;
1516 s->bsym->flags &= ~(BSF_LOCAL|BSF_WEAK);
1520 S_CLEAR_EXTERNAL (s)
1523 if ((s->bsym->flags & BSF_WEAK) != 0)
1525 /* Let .weak override. */
1528 s->bsym->flags |= BSF_LOCAL;
1529 s->bsym->flags &= ~(BSF_GLOBAL|BSF_WEAK);
1536 s->bsym->flags |= BSF_WEAK;
1537 s->bsym->flags &= ~(BSF_GLOBAL|BSF_LOCAL);
1541 S_SET_NAME (s, name)
1545 s->bsym->name = name;
1547 #endif /* BFD_ASSEMBLER */
1552 symbol_lastP = NULL;
1553 symbol_rootP = NULL; /* In case we have 0 symbols (!!) */
1554 sy_hash = hash_new ();
1556 memset ((char *) (&abs_symbol), '\0', sizeof (abs_symbol));
1557 #ifdef BFD_ASSEMBLER
1558 #if defined (EMIT_SECTION_SYMBOLS) || !defined (RELOC_REQUIRES_SYMBOL)
1559 abs_symbol.bsym = bfd_abs_section.symbol;
1562 /* Can't initialise a union. Sigh. */
1563 S_SET_SEGMENT (&abs_symbol, absolute_section);
1565 abs_symbol.sy_value.X_op = O_constant;
1566 abs_symbol.sy_frag = &zero_address_frag;
1568 if (LOCAL_LABELS_FB)
1575 /* Maximum indent level.
1576 Available for modification inside a gdb session. */
1577 int max_indent_level = 8;
1584 printf ("%*s", indent_level * 4, "");
1590 print_symbol_value_1 (file, sym)
1594 const char *name = S_GET_NAME (sym);
1595 if (!name || !name[0])
1597 fprintf (file, "sym %lx %s", (unsigned long) sym, name);
1598 if (sym->sy_frag != &zero_address_frag)
1599 fprintf (file, " frag %lx", (long) sym->sy_frag);
1601 fprintf (file, " written");
1602 if (sym->sy_resolved)
1603 fprintf (file, " resolved");
1604 else if (sym->sy_resolving)
1605 fprintf (file, " resolving");
1606 if (sym->sy_used_in_reloc)
1607 fprintf (file, " used-in-reloc");
1609 fprintf (file, " used");
1610 if (S_IS_LOCAL (sym))
1611 fprintf (file, " local");
1612 if (S_IS_EXTERN (sym))
1613 fprintf (file, " extern");
1614 if (S_IS_DEBUG (sym))
1615 fprintf (file, " debug");
1616 if (S_IS_DEFINED (sym))
1617 fprintf (file, " defined");
1618 fprintf (file, " %s", segment_name (S_GET_SEGMENT (sym)));
1619 if (sym->sy_resolved)
1621 segT s = S_GET_SEGMENT (sym);
1623 if (s != undefined_section
1624 && s != expr_section)
1625 fprintf (file, " %lx", (long) S_GET_VALUE (sym));
1627 else if (indent_level < max_indent_level
1628 && S_GET_SEGMENT (sym) != undefined_section)
1631 fprintf (file, "\n%*s<", indent_level * 4, "");
1632 print_expr_1 (file, &sym->sy_value);
1633 fprintf (file, ">");
1640 print_symbol_value (sym)
1644 print_symbol_value_1 (stderr, sym);
1645 fprintf (stderr, "\n");
1649 print_binary (file, name, exp)
1655 fprintf (file, "%s\n%*s<", name, indent_level * 4, "");
1656 print_symbol_value_1 (file, exp->X_add_symbol);
1657 fprintf (file, ">\n%*s<", indent_level * 4, "");
1658 print_symbol_value_1 (file, exp->X_op_symbol);
1659 fprintf (file, ">");
1664 print_expr_1 (file, exp)
1668 fprintf (file, "expr %lx ", (long) exp);
1672 fprintf (file, "illegal");
1675 fprintf (file, "absent");
1678 fprintf (file, "constant %lx", (long) exp->X_add_number);
1682 fprintf (file, "symbol\n%*s<", indent_level * 4, "");
1683 print_symbol_value_1 (file, exp->X_add_symbol);
1684 fprintf (file, ">");
1686 if (exp->X_add_number)
1687 fprintf (file, "\n%*s%lx", indent_level * 4, "",
1688 (long) exp->X_add_number);
1692 fprintf (file, "register #%d", (int) exp->X_add_number);
1695 fprintf (file, "big");
1698 fprintf (file, "uminus -<");
1700 print_symbol_value_1 (file, exp->X_add_symbol);
1701 fprintf (file, ">");
1702 goto maybe_print_addnum;
1704 fprintf (file, "bit_not");
1707 print_binary (file, "multiply", exp);
1710 print_binary (file, "divide", exp);
1713 print_binary (file, "modulus", exp);
1716 print_binary (file, "lshift", exp);
1719 print_binary (file, "rshift", exp);
1721 case O_bit_inclusive_or:
1722 print_binary (file, "bit_ior", exp);
1724 case O_bit_exclusive_or:
1725 print_binary (file, "bit_xor", exp);
1728 print_binary (file, "bit_and", exp);
1731 print_binary (file, "eq", exp);
1734 print_binary (file, "ne", exp);
1737 print_binary (file, "lt", exp);
1740 print_binary (file, "le", exp);
1743 print_binary (file, "ge", exp);
1746 print_binary (file, "gt", exp);
1749 print_binary (file, "logical_and", exp);
1752 print_binary (file, "logical_or", exp);
1756 fprintf (file, "add\n%*s<", indent_level * 4, "");
1757 print_symbol_value_1 (file, exp->X_add_symbol);
1758 fprintf (file, ">\n%*s<", indent_level * 4, "");
1759 print_symbol_value_1 (file, exp->X_op_symbol);
1760 fprintf (file, ">");
1761 goto maybe_print_addnum;
1764 fprintf (file, "subtract\n%*s<", indent_level * 4, "");
1765 print_symbol_value_1 (file, exp->X_add_symbol);
1766 fprintf (file, ">\n%*s<", indent_level * 4, "");
1767 print_symbol_value_1 (file, exp->X_op_symbol);
1768 fprintf (file, ">");
1769 goto maybe_print_addnum;
1771 fprintf (file, "{unknown opcode %d}", (int) exp->X_op);
1781 print_expr_1 (stderr, exp);
1782 fprintf (stderr, "\n");
1786 symbol_print_statistics (file)
1789 hash_print_statistics (file, "symbol table", sy_hash);
1792 /* end of symbols.c */