1 /* symbols.c -symbol table-
3 Copyright (C) 1987, 1990, 1991, 1992, 1993 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
19 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
27 #include "obstack.h" /* For "symbols.h" */
30 #ifndef WORKING_DOT_WORD
31 extern int new_broken_words;
34 /* symbol-name => struct symbol pointer */
35 static struct hash_control *sy_hash;
37 /* Below are commented in "symbols.h". */
38 symbolS *symbol_rootP;
39 symbolS *symbol_lastP;
42 symbolS *dot_text_symbol;
43 symbolS *dot_data_symbol;
44 symbolS *dot_bss_symbol;
48 static void fb_label_init PARAMS ((void));
54 symbol_rootP = NULL; /* In case we have 0 symbols (!!) */
55 sy_hash = hash_new ();
56 memset ((char *) (&abs_symbol), '\0', sizeof (abs_symbol));
58 abs_symbol.bsym = bfd_abs_section.symbol;
60 /* Can't initialise a union. Sigh. */
61 S_SET_SEGMENT (&abs_symbol, absolute_section);
63 #ifdef LOCAL_LABELS_FB
65 #endif /* LOCAL_LABELS_FB */
71 * Return a pointer to a new symbol.
72 * Die if we can't make a new symbol.
73 * Fill in the symbol's values.
74 * Add symbol to end of symbol chain.
77 * Please always call this to create a new symbol.
79 * Changes since 1985: Symbol names may not contain '\0'. Sigh.
80 * 2nd argument is now a SEG rather than a TYPE. The mapping between
81 * segments and types is mostly encapsulated herein (actually, we inherit it
82 * from macros in struc-symbol.h).
86 symbol_new (name, segment, value, frag)
87 CONST char *name; /* It is copied, the caller can destroy/modify */
88 segT segment; /* Segment identifier (SEG_<something>) */
89 valueT value; /* Symbol value */
90 fragS *frag; /* Associated fragment */
92 unsigned int name_length;
93 char *preserved_copy_of_name;
96 name_length = strlen (name) + 1; /* +1 for \0 */
97 obstack_grow (¬es, name, name_length);
98 preserved_copy_of_name = obstack_finish (¬es);
99 #ifdef STRIP_UNDERSCORE
100 if (preserved_copy_of_name[0] == '_')
101 preserved_copy_of_name++;
103 symbolP = (symbolS *) obstack_alloc (¬es, sizeof (symbolS));
105 /* symbol must be born in some fixed state. This seems as good as any. */
106 memset (symbolP, 0, sizeof (symbolS));
110 symbolP->bsym = bfd_make_empty_symbol (stdoutput);
111 assert (symbolP->bsym != 0);
112 symbolP->bsym->udata = (PTR) symbolP;
114 S_SET_NAME (symbolP, preserved_copy_of_name);
116 S_SET_SEGMENT (symbolP, segment);
117 S_SET_VALUE (symbolP, value);
118 symbol_clear_list_pointers(symbolP);
120 symbolP->sy_frag = frag;
121 #ifndef BFD_ASSEMBLER
122 symbolP->sy_number = ~0;
123 symbolP->sy_name_offset = ~0;
127 * Link to end of symbol chain.
129 symbol_append (symbolP, symbol_lastP, &symbol_rootP, &symbol_lastP);
131 obj_symbol_new_hook (symbolP);
134 verify_symbol_chain(symbol_rootP, symbol_lastP);
144 * We have just seen "<name>:".
145 * Creates a struct symbol unless it already exists.
147 * Gripes if we are redefining a symbol incompatibly (and ignores it).
151 colon (sym_name) /* just seen "x:" - rattle symbols & frags */
152 register char *sym_name; /* symbol name, as a cannonical string */
153 /* We copy this string: OK to alter later. */
155 register symbolS *symbolP; /* symbol we are working with */
157 #ifdef LOCAL_LABELS_DOLLAR
158 /* Sun local labels go out of scope whenever a non-local symbol is
161 if (*sym_name != 'L')
162 dollar_label_clear ();
163 #endif /* LOCAL_LABELS_DOLLAR */
165 #ifndef WORKING_DOT_WORD
166 if (new_broken_words)
168 struct broken_word *a;
173 extern const int md_short_jump_size;
174 extern const int md_long_jump_size;
175 possible_bytes = (md_short_jump_size
176 + new_broken_words * md_long_jump_size);
179 frag_opcode = frag_var (rs_broken_word,
183 (symbolS *) broken_words,
187 /* We want to store the pointer to where to insert the jump table in the
188 fr_opcode of the rs_broken_word frag. This requires a little
191 && (frag_tmp->fr_type != rs_broken_word
192 || frag_tmp->fr_opcode))
193 frag_tmp = frag_tmp->fr_next;
195 frag_tmp->fr_opcode = frag_opcode;
196 new_broken_words = 0;
198 for (a = broken_words; a && a->dispfrag == 0; a = a->next_broken_word)
199 a->dispfrag = frag_tmp;
201 #endif /* WORKING_DOT_WORD */
203 if ((symbolP = symbol_find (sym_name)) != 0)
205 #ifdef RESOLVE_SYMBOL_REDEFINITION
206 if (RESOLVE_SYMBOL_REDEFINITION (symbolP))
210 * Now check for undefined symbols
212 if (!S_IS_DEFINED (symbolP))
214 if (S_GET_VALUE (symbolP) == 0)
216 symbolP->sy_frag = frag_now;
218 S_GET_OTHER(symbolP) = const_flag;
220 S_SET_VALUE (symbolP, (valueT) ((char*)obstack_next_free (&frags) - frag_now->fr_literal));
221 S_SET_SEGMENT (symbolP, now_seg);
224 #endif /* if we have one, it better be zero. */
230 * There are still several cases to check:
231 * A .comm/.lcomm symbol being redefined as
232 * initialized data is OK
233 * A .comm/.lcomm symbol being redefined with
234 * a larger size is also OK
236 * This only used to be allowed on VMS gas, but Sun cc
237 * on the sparc also depends on it.
240 if (((!S_IS_DEBUG (symbolP)
241 && !S_IS_DEFINED (symbolP)
242 && S_IS_EXTERNAL (symbolP))
243 || S_GET_SEGMENT (symbolP) == bss_section)
244 && (now_seg == data_section
245 || now_seg == S_GET_SEGMENT (symbolP)))
248 * Select which of the 2 cases this is
250 if (now_seg != data_section)
253 * New .comm for prev .comm symbol.
254 * If the new size is larger we just
255 * change its value. If the new size
256 * is smaller, we ignore this symbol
258 if (S_GET_VALUE (symbolP)
259 < ((unsigned) frag_now_fix ()))
261 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
266 /* It is a .comm/.lcomm being converted to initialized
268 symbolP->sy_frag = frag_now;
270 S_GET_OTHER(symbolP) = const_flag;
272 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
273 S_SET_SEGMENT (symbolP, now_seg); /* keep N_EXT bit */
278 #if defined (S_GET_OTHER) && defined (S_GET_DESC)
279 as_fatal ("Symbol \"%s\" is already defined as \"%s\"/%d.%d.%ld.",
281 segment_name (S_GET_SEGMENT (symbolP)),
282 S_GET_OTHER (symbolP), S_GET_DESC (symbolP),
283 (long) S_GET_VALUE (symbolP));
285 as_fatal ("Symbol \"%s\" is already defined as \"%s\"/%d.",
287 segment_name (S_GET_SEGMENT (symbolP)),
288 S_GET_VALUE (symbolP));
291 } /* if the undefined symbol has no value */
295 /* Don't blow up if the definition is the same */
296 if (!(frag_now == symbolP->sy_frag
297 && S_GET_VALUE (symbolP) == (char*)obstack_next_free (&frags) - frag_now->fr_literal
298 && S_GET_SEGMENT (symbolP) == now_seg))
299 as_fatal ("Symbol %s already defined.", sym_name);
300 } /* if this symbol is not yet defined */
305 symbolP = symbol_new (sym_name,
307 (valueT) ((char*)obstack_next_free (&frags) - frag_now->fr_literal),
310 S_SET_OTHER (symbolP, const_flag);
313 symbol_table_insert (symbolP);
314 } /* if we have seen this symbol before */
316 pa_define_label(symbolP);
324 * symbol_table_insert()
326 * Die if we can't insert the symbol.
331 symbol_table_insert (symbolP)
334 register char *error_string;
337 know (S_GET_NAME (symbolP));
339 if (*(error_string = hash_jam (sy_hash, S_GET_NAME (symbolP), (char *) symbolP)))
341 as_fatal ("Inserting \"%s\" into symbol table failed: %s",
342 S_GET_NAME (symbolP), error_string);
344 } /* symbol_table_insert() */
347 * symbol_find_or_make()
349 * If a symbol name does not exist, create it as undefined, and insert
350 * it into the symbol table. Return a pointer to it.
353 symbol_find_or_make (name)
356 register symbolS *symbolP;
358 symbolP = symbol_find (name);
362 symbolP = symbol_make (name);
364 symbol_table_insert (symbolP);
365 } /* if symbol wasn't found */
368 } /* symbol_find_or_make() */
376 /* Let the machine description default it, e.g. for register names. */
377 symbolP = md_undefined_symbol ((char *) name);
380 symbolP = symbol_new (name, undefined_section, (valueT) 0, &zero_address_frag);
383 } /* symbol_make() */
388 * Implement symbol table lookup.
389 * In: A symbol's name as a string: '\0' can't be part of a symbol name.
390 * Out: NULL if the name was not in the symbol table, else the address
391 * of a struct symbol associated with that name.
398 #ifdef STRIP_UNDERSCORE
399 return (symbol_find_base (name, 1));
400 #else /* STRIP_UNDERSCORE */
401 return (symbol_find_base (name, 0));
402 #endif /* STRIP_UNDERSCORE */
403 } /* symbol_find() */
406 symbol_find_base (name, strip_underscore)
408 int strip_underscore;
410 if (strip_underscore && *name == '_')
412 return ((symbolS *) hash_find (sy_hash, name));
416 * Once upon a time, symbols were kept in a singly linked list. At
417 * least coff needs to be able to rearrange them from time to time, for
418 * which a doubly linked list is much more convenient. Loic did these
419 * as macros which seemed dangerous to me so they're now functions.
423 /* Link symbol ADDME after symbol TARGET in the chain. */
425 symbol_append (addme, target, rootPP, lastPP)
433 know (*rootPP == NULL);
434 know (*lastPP == NULL);
438 } /* if the list is empty */
440 if (target->sy_next != NULL)
442 #ifdef SYMBOLS_NEED_BACKPOINTERS
443 target->sy_next->sy_previous = addme;
444 #endif /* SYMBOLS_NEED_BACKPOINTERS */
448 know (*lastPP == target);
450 } /* if we have a next */
452 addme->sy_next = target->sy_next;
453 target->sy_next = addme;
455 #ifdef SYMBOLS_NEED_BACKPOINTERS
456 addme->sy_previous = target;
457 #endif /* SYMBOLS_NEED_BACKPOINTERS */
460 #ifdef SYMBOLS_NEED_BACKPOINTERS
461 /* Remove SYMBOLP from the list. */
463 symbol_remove (symbolP, rootPP, lastPP)
468 if (symbolP == *rootPP)
470 *rootPP = symbolP->sy_next;
471 } /* if it was the root */
473 if (symbolP == *lastPP)
475 *lastPP = symbolP->sy_previous;
476 } /* if it was the tail */
478 if (symbolP->sy_next != NULL)
480 symbolP->sy_next->sy_previous = symbolP->sy_previous;
483 if (symbolP->sy_previous != NULL)
485 symbolP->sy_previous->sy_next = symbolP->sy_next;
489 verify_symbol_chain (*rootPP, *lastPP);
493 /* Set the chain pointers of SYMBOL to null. */
495 symbol_clear_list_pointers (symbolP)
498 symbolP->sy_next = NULL;
499 symbolP->sy_previous = NULL;
502 /* Link symbol ADDME before symbol TARGET in the chain. */
504 symbol_insert (addme, target, rootPP, lastPP)
510 if (target->sy_previous != NULL)
512 target->sy_previous->sy_next = addme;
516 know (*rootPP == target);
520 addme->sy_previous = target->sy_previous;
521 target->sy_previous = addme;
522 addme->sy_next = target;
525 verify_symbol_chain (*rootPP, *lastPP);
529 #endif /* SYMBOLS_NEED_BACKPOINTERS */
532 verify_symbol_chain (rootP, lastP)
536 symbolS *symbolP = rootP;
541 for (; symbol_next (symbolP) != NULL; symbolP = symbol_next (symbolP))
543 #ifdef SYMBOLS_NEED_BACKPOINTERS
544 know (symbolP->sy_next->sy_previous == symbolP);
546 /* Walk the list anyways, to make sure pointers are still good. */
548 #endif /* SYMBOLS_NEED_BACKPOINTERS */
551 assert (lastP == symbolP);
555 verify_symbol_chain_2 (sym)
558 symbolS *p = sym, *n = sym;
559 #ifdef SYMBOLS_NEED_BACKPOINTERS
560 while (symbol_previous (p))
561 p = symbol_previous (p);
563 while (symbol_next (n))
565 verify_symbol_chain (p, n);
568 /* Resolve the value of a symbol. This is called during the final
569 pass over the symbol table to resolve any symbols with complex
573 resolve_symbol_value (symp)
576 if (symp->sy_resolved)
579 if (symp->sy_resolving)
581 as_bad ("Symbol definition loop encountered at %s",
583 S_SET_VALUE (symp, (valueT) 0);
587 symp->sy_resolving = 1;
589 if (symp->sy_value.X_seg == absolute_section)
590 S_SET_VALUE (symp, S_GET_VALUE (symp) + symp->sy_frag->fr_address);
591 else if (symp->sy_value.X_seg == undefined_section)
593 resolve_symbol_value (symp->sy_value.X_add_symbol);
595 #ifdef obj_frob_forward_symbol
596 /* Some object formats need to forward the segment. */
597 obj_frob_forward_symbol (symp);
601 (symp->sy_value.X_add_number
602 + symp->sy_frag->fr_address
603 + S_GET_VALUE (symp->sy_value.X_add_symbol)));
605 else if (symp->sy_value.X_seg == diff_section)
607 resolve_symbol_value (symp->sy_value.X_add_symbol);
608 resolve_symbol_value (symp->sy_value.X_subtract_symbol);
609 if (S_GET_SEGMENT (symp->sy_value.X_add_symbol)
610 != S_GET_SEGMENT (symp->sy_value.X_subtract_symbol))
611 as_bad ("%s is difference of symbols in different sections",
614 (symp->sy_value.X_add_number
615 + symp->sy_frag->fr_address
616 + S_GET_VALUE (symp->sy_value.X_add_symbol)
617 - S_GET_VALUE (symp->sy_value.X_subtract_symbol)));
618 S_SET_SEGMENT (symp, absolute_section);
622 /* More cases need to be added here. */
627 symp->sy_resolved = 1;
630 #ifdef LOCAL_LABELS_DOLLAR
632 /* Dollar labels look like a number followed by a dollar sign. Eg, "42$".
633 They are *really* local. That is, they go out of scope whenever we see a
634 label that isn't local. Also, like fb labels, there can be multiple
635 instances of a dollar label. Therefor, we name encode each instance with
636 the instance number, keep a list of defined symbols separate from the real
637 symbol table, and we treat these buggers as a sparse array. */
639 static long *dollar_labels;
640 static long *dollar_label_instances;
641 static char *dollar_label_defines;
642 static long dollar_label_count;
643 static long dollar_label_max;
646 dollar_label_defined (label)
651 know ((dollar_labels != NULL) || (dollar_label_count == 0));
653 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
655 return dollar_label_defines[i - dollar_labels];
657 /* if we get here, label isn't defined */
659 } /* dollar_label_defined() */
662 dollar_label_instance (label)
667 know ((dollar_labels != NULL) || (dollar_label_count == 0));
669 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
671 return (dollar_label_instances[i - dollar_labels]);
673 /* If we get here, we haven't seen the label before, therefore its instance
679 dollar_label_clear ()
681 memset (dollar_label_defines, '\0', dollar_label_count);
684 #define DOLLAR_LABEL_BUMP_BY 10
687 define_dollar_label (label)
692 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
695 ++dollar_label_instances[i - dollar_labels];
696 dollar_label_defines[i - dollar_labels] = 1;
700 /* if we get to here, we don't have label listed yet. */
702 if (dollar_labels == NULL)
704 dollar_labels = (long *) xmalloc (DOLLAR_LABEL_BUMP_BY * sizeof (long));
705 dollar_label_instances = (long *) xmalloc (DOLLAR_LABEL_BUMP_BY * sizeof (long));
706 dollar_label_defines = xmalloc (DOLLAR_LABEL_BUMP_BY);
707 dollar_label_max = DOLLAR_LABEL_BUMP_BY;
708 dollar_label_count = 0;
710 else if (dollar_label_count == dollar_label_max)
712 dollar_label_max += DOLLAR_LABEL_BUMP_BY;
713 dollar_labels = (long *) xrealloc ((char *) dollar_labels,
714 dollar_label_max * sizeof (long));
715 dollar_label_instances = (long *) xrealloc ((char *) dollar_label_instances,
716 dollar_label_max * sizeof (long));
717 dollar_label_defines = xrealloc (dollar_label_defines, dollar_label_max);
718 } /* if we needed to grow */
720 dollar_labels[dollar_label_count] = label;
721 dollar_label_instances[dollar_label_count] = 1;
722 dollar_label_defines[dollar_label_count] = 1;
723 ++dollar_label_count;
727 * dollar_label_name()
729 * Caller must copy returned name: we re-use the area for the next name.
731 * The mth occurence of label n: is turned into the symbol "Ln^Am"
732 * where n is the label number and m is the instance number. "L" makes
733 * it a label discarded unless debugging and "^A"('\1') ensures no
734 * ordinary symbol SHOULD get the same name as a local label
735 * symbol. The first "4:" is "L4^A1" - the m numbers begin at 1.
737 * fb labels get the same treatment, except that ^B is used in place of ^A.
740 char * /* Return local label name. */
741 dollar_label_name (n, augend)
742 register long n; /* we just saw "n$:" : n a number */
743 register int augend; /* 0 for current instance, 1 for new instance */
746 /* Returned to caller, then copied. used for created names ("4f") */
747 static char symbol_name_build[24];
750 char symbol_name_temporary[20]; /* build up a number, BACKWARDS */
753 know (augend == 0 || augend == 1);
754 p = symbol_name_build;
757 /* Next code just does sprintf( {}, "%d", n); */
759 q = symbol_name_temporary;
760 for (*q++ = 0, i = n; i; ++q)
765 while ((*p = *--q) != '\0')
770 /* instance number */
771 q = symbol_name_temporary;
772 for (*q++ = 0, i = dollar_label_instance (n) + augend; i; ++q)
777 while ((*p++ = *--q) != '\0');;
779 /* The label, as a '\0' ended string, starts at symbol_name_build. */
780 return symbol_name_build;
783 #endif /* LOCAL_LABELS_DOLLAR */
785 #ifdef LOCAL_LABELS_FB
788 * Sombody else's idea of local labels. They are made by "n:" where n
789 * is any decimal digit. Refer to them with
790 * "nb" for previous (backward) n:
791 * or "nf" for next (forward) n:.
793 * We do a little better and let n be any number, not just a single digit, but
794 * since the other guy's assembler only does ten, we treat the first ten
797 * Like someone else's assembler, we have one set of local label counters for
798 * entire assembly, not one set per (sub)segment like in most assemblers. This
799 * implies that one can refer to a label in another segment, and indeed some
800 * crufty compilers have done just that.
802 * Since there could be a LOT of these things, treat them as a sparse array.
805 #define FB_LABEL_SPECIAL (10)
807 static long fb_low_counter[FB_LABEL_SPECIAL];
808 static long *fb_labels;
809 static long *fb_label_instances;
810 static long fb_label_count = 0;
811 static long fb_label_max = 0;
813 /* this must be more than FB_LABEL_SPECIAL */
814 #define FB_LABEL_BUMP_BY (FB_LABEL_SPECIAL + 6)
819 memset ((void *) fb_low_counter, '\0', sizeof (fb_low_counter));
820 } /* fb_label_init() */
822 /* add one to the instance number of this fb label */
824 fb_label_instance_inc (label)
829 if (label < FB_LABEL_SPECIAL)
831 ++fb_low_counter[label];
835 if (fb_labels != NULL)
837 for (i = fb_labels + FB_LABEL_SPECIAL;
838 i < fb_labels + fb_label_count; ++i)
842 ++fb_label_instances[i - fb_labels];
844 } /* if we find it */
845 } /* for each existing label */
848 /* if we get to here, we don't have label listed yet. */
850 if (fb_labels == NULL)
852 fb_labels = (long *) xmalloc (FB_LABEL_BUMP_BY * sizeof (long));
853 fb_label_instances = (long *) xmalloc (FB_LABEL_BUMP_BY * sizeof (long));
854 fb_label_max = FB_LABEL_BUMP_BY;
855 fb_label_count = FB_LABEL_SPECIAL;
858 else if (fb_label_count == fb_label_max)
860 fb_label_max += FB_LABEL_BUMP_BY;
861 fb_labels = (long *) xrealloc ((char *) fb_labels,
862 fb_label_max * sizeof (long));
863 fb_label_instances = (long *) xrealloc ((char *) fb_label_instances,
864 fb_label_max * sizeof (long));
865 } /* if we needed to grow */
867 fb_labels[fb_label_count] = label;
868 fb_label_instances[fb_label_count] = 1;
871 } /* fb_label_instance_inc() */
874 fb_label_instance (label)
879 if (label < FB_LABEL_SPECIAL)
881 return (fb_low_counter[label]);
884 if (fb_labels != NULL)
886 for (i = fb_labels + FB_LABEL_SPECIAL;
887 i < fb_labels + fb_label_count; ++i)
891 return (fb_label_instances[i - fb_labels]);
892 } /* if we find it */
893 } /* for each existing label */
896 /* We didn't find the label, so this must be a reference to the
904 * Caller must copy returned name: we re-use the area for the next name.
906 * The mth occurence of label n: is turned into the symbol "Ln^Bm"
907 * where n is the label number and m is the instance number. "L" makes
908 * it a label discarded unless debugging and "^B"('\2') ensures no
909 * ordinary symbol SHOULD get the same name as a local label
910 * symbol. The first "4:" is "L4^B1" - the m numbers begin at 1.
912 * dollar labels get the same treatment, except that ^A is used in place of ^B. */
914 char * /* Return local label name. */
915 fb_label_name (n, augend)
916 long n; /* we just saw "n:", "nf" or "nb" : n a number */
917 long augend; /* 0 for nb, 1 for n:, nf */
920 /* Returned to caller, then copied. used for created names ("4f") */
921 static char symbol_name_build[24];
924 char symbol_name_temporary[20]; /* build up a number, BACKWARDS */
927 know (augend == 0 || augend == 1);
928 p = symbol_name_build;
931 /* Next code just does sprintf( {}, "%d", n); */
933 q = symbol_name_temporary;
934 for (*q++ = 0, i = n; i; ++q)
939 while ((*p = *--q) != '\0')
944 /* instance number */
945 q = symbol_name_temporary;
946 for (*q++ = 0, i = fb_label_instance (n) + augend; i; ++q)
951 while ((*p++ = *--q) != '\0');;
953 /* The label, as a '\0' ended string, starts at symbol_name_build. */
954 return (symbol_name_build);
955 } /* fb_label_name() */
957 #endif /* LOCAL_LABELS_FB */
961 * decode name that may have been generated by foo_label_name() above. If
962 * the name wasn't generated by foo_label_name(), then return it unaltered.
963 * This is used for error messages.
967 decode_local_label_name (s)
975 const char *message_format = "\"%d\" (instance number %d of a %s label)";
980 for (label_number = 0, p = s + 1; isdigit (*p); ++p)
982 label_number = (10 * label_number) + *p - '0';
998 for (instance_number = 0, p = s + 1; isdigit (*p); ++p)
1000 instance_number = (10 * instance_number) + *p - '0';
1003 symbol_decode = obstack_alloc (¬es, strlen (message_format) + 30);
1004 (void) sprintf (symbol_decode, message_format, label_number,
1005 instance_number, type);
1007 return (symbol_decode);
1008 } /* decode_local_label_name() */
1010 /* Get the value of a symbol. */
1016 if (s->sy_value.X_seg != absolute_section)
1017 as_bad ("Attempt to get value of unresolved symbol %s", S_GET_NAME (s));
1018 return (valueT) s->sy_value.X_add_number;
1021 /* Set the value of a symbol. */
1024 S_SET_VALUE (s, val)
1028 s->sy_value.X_seg = absolute_section;
1029 s->sy_value.X_add_number = (offsetT) val;
1032 #ifdef BFD_ASSEMBLER
1038 flagword flags = s->bsym->flags;
1041 if (flags & BSF_LOCAL && flags & (BSF_EXPORT | BSF_GLOBAL))
1044 return (flags & (BSF_EXPORT | BSF_GLOBAL)) != 0;
1051 return s->bsym->section == &bfd_com_section;
1058 return s->bsym->section != undefined_section;
1065 if (s->bsym->flags & BSF_DEBUGGING)
1074 flagword flags = s->bsym->flags;
1077 if (flags & BSF_LOCAL && flags & (BSF_EXPORT | BSF_GLOBAL))
1080 return (S_GET_NAME (s)
1082 && (strchr (S_GET_NAME (s), '\001')
1083 || strchr (S_GET_NAME (s), '\002')
1084 || (S_LOCAL_NAME (s)
1085 && !flagseen['L'])));
1092 return S_IS_EXTERNAL (s);
1099 return S_GET_NAME (s) == 0;
1106 return s->bsym->name;
1113 return s->bsym->section;
1117 S_SET_SEGMENT (s, seg)
1121 s->bsym->section = seg;
1128 s->bsym->flags |= BSF_EXPORT | BSF_GLOBAL;
1129 s->bsym->flags &= ~BSF_LOCAL;
1133 S_CLEAR_EXTERNAL (s)
1136 s->bsym->flags |= BSF_LOCAL;
1137 s->bsym->flags &= ~(BSF_EXPORT | BSF_GLOBAL);
1141 S_SET_NAME (s, name)
1145 s->bsym->name = name;
1147 #endif /* BFD_ASSEMBLER */
1149 /* end of symbols.c */