1 /* symbols.c -symbol table-
2 Copyright (C) 1987, 1990, 1991, 1992, 1993 Free Software Foundation, Inc.
4 This file is part of GAS, the GNU Assembler.
6 GAS is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GAS is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GAS; see the file COPYING. If not, write to
18 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
26 #include "obstack.h" /* For "symbols.h" */
29 #ifndef WORKING_DOT_WORD
30 extern int new_broken_words
;
33 /* symbol-name => struct symbol pointer */
34 static struct hash_control
*sy_hash
;
36 /* Below are commented in "symbols.h". */
37 symbolS
*symbol_rootP
;
38 symbolS
*symbol_lastP
;
41 symbolS
*dot_text_symbol
;
42 symbolS
*dot_data_symbol
;
43 symbolS
*dot_bss_symbol
;
47 static void fb_label_init
PARAMS ((void));
53 symbol_rootP
= NULL
; /* In case we have 0 symbols (!!) */
54 sy_hash
= hash_new ();
55 memset ((char *) (&abs_symbol
), '\0', sizeof (abs_symbol
));
57 abs_symbol
.bsym
= bfd_abs_section
.symbol
;
59 /* Can't initialise a union. Sigh. */
60 S_SET_SEGMENT (&abs_symbol
, absolute_section
);
62 #ifdef LOCAL_LABELS_FB
64 #endif /* LOCAL_LABELS_FB */
70 * Return a pointer to a new symbol.
71 * Die if we can't make a new symbol.
72 * Fill in the symbol's values.
73 * Add symbol to end of symbol chain.
76 * Please always call this to create a new symbol.
78 * Changes since 1985: Symbol names may not contain '\0'. Sigh.
79 * 2nd argument is now a SEG rather than a TYPE. The mapping between
80 * segments and types is mostly encapsulated herein (actually, we inherit it
81 * from macros in struc-symbol.h).
85 symbol_new (name
, segment
, value
, frag
)
86 CONST
char *name
; /* It is copied, the caller can destroy/modify */
87 segT segment
; /* Segment identifier (SEG_<something>) */
88 valueT value
; /* Symbol value */
89 fragS
*frag
; /* Associated fragment */
91 unsigned int name_length
;
92 char *preserved_copy_of_name
;
95 name_length
= strlen (name
) + 1; /* +1 for \0 */
96 obstack_grow (¬es
, name
, name_length
);
97 preserved_copy_of_name
= obstack_finish (¬es
);
98 #ifdef STRIP_UNDERSCORE
99 if (preserved_copy_of_name
[0] == '_')
100 preserved_copy_of_name
++;
102 symbolP
= (symbolS
*) obstack_alloc (¬es
, sizeof (symbolS
));
104 /* symbol must be born in some fixed state. This seems as good as any. */
105 memset (symbolP
, 0, sizeof (symbolS
));
109 symbolP
->bsym
= bfd_make_empty_symbol (stdoutput
);
110 assert (symbolP
->bsym
!= 0);
111 symbolP
->bsym
->udata
= (PTR
) symbolP
;
113 S_SET_NAME (symbolP
, preserved_copy_of_name
);
115 S_SET_SEGMENT (symbolP
, segment
);
116 S_SET_VALUE (symbolP
, value
);
117 symbol_clear_list_pointers(symbolP
);
119 symbolP
->sy_frag
= frag
;
120 #ifndef BFD_ASSEMBLER
121 symbolP
->sy_number
= ~0;
122 symbolP
->sy_name_offset
= ~0;
126 * Link to end of symbol chain.
128 symbol_append (symbolP
, symbol_lastP
, &symbol_rootP
, &symbol_lastP
);
130 obj_symbol_new_hook (symbolP
);
133 verify_symbol_chain(symbol_rootP
, symbol_lastP
);
143 * We have just seen "<name>:".
144 * Creates a struct symbol unless it already exists.
146 * Gripes if we are redefining a symbol incompatibly (and ignores it).
150 colon (sym_name
) /* just seen "x:" - rattle symbols & frags */
151 register char *sym_name
; /* symbol name, as a cannonical string */
152 /* We copy this string: OK to alter later. */
154 register symbolS
*symbolP
; /* symbol we are working with */
156 #ifdef LOCAL_LABELS_DOLLAR
157 /* Sun local labels go out of scope whenever a non-local symbol is
160 if (*sym_name
!= 'L')
161 dollar_label_clear ();
162 #endif /* LOCAL_LABELS_DOLLAR */
164 #ifndef WORKING_DOT_WORD
165 if (new_broken_words
)
167 struct broken_word
*a
;
172 extern const int md_short_jump_size
;
173 extern const int md_long_jump_size
;
174 possible_bytes
= (md_short_jump_size
175 + new_broken_words
* md_long_jump_size
);
178 frag_opcode
= frag_var (rs_broken_word
,
182 (symbolS
*) broken_words
,
186 /* We want to store the pointer to where to insert the jump table in the
187 fr_opcode of the rs_broken_word frag. This requires a little
190 && (frag_tmp
->fr_type
!= rs_broken_word
191 || frag_tmp
->fr_opcode
))
192 frag_tmp
= frag_tmp
->fr_next
;
194 frag_tmp
->fr_opcode
= frag_opcode
;
195 new_broken_words
= 0;
197 for (a
= broken_words
; a
&& a
->dispfrag
== 0; a
= a
->next_broken_word
)
198 a
->dispfrag
= frag_tmp
;
200 #endif /* WORKING_DOT_WORD */
202 if ((symbolP
= symbol_find (sym_name
)) != 0)
204 #ifdef RESOLVE_SYMBOL_REDEFINITION
205 if (RESOLVE_SYMBOL_REDEFINITION (symbolP
))
209 * Now check for undefined symbols
211 if (!S_IS_DEFINED (symbolP
))
213 if (S_GET_VALUE (symbolP
) == 0)
215 symbolP
->sy_frag
= frag_now
;
217 S_GET_OTHER(symbolP
) = const_flag
;
219 S_SET_VALUE (symbolP
, (valueT
) ((char*)obstack_next_free (&frags
) - frag_now
->fr_literal
));
220 S_SET_SEGMENT (symbolP
, now_seg
);
223 #endif /* if we have one, it better be zero. */
229 * There are still several cases to check:
230 * A .comm/.lcomm symbol being redefined as
231 * initialized data is OK
232 * A .comm/.lcomm symbol being redefined with
233 * a larger size is also OK
235 * This only used to be allowed on VMS gas, but Sun cc
236 * on the sparc also depends on it.
239 if (((!S_IS_DEBUG (symbolP
)
240 && !S_IS_DEFINED (symbolP
)
241 && S_IS_EXTERNAL (symbolP
))
242 || S_GET_SEGMENT (symbolP
) == bss_section
)
243 && (now_seg
== data_section
244 || now_seg
== S_GET_SEGMENT (symbolP
)))
247 * Select which of the 2 cases this is
249 if (now_seg
!= data_section
)
252 * New .comm for prev .comm symbol.
253 * If the new size is larger we just
254 * change its value. If the new size
255 * is smaller, we ignore this symbol
257 if (S_GET_VALUE (symbolP
)
258 < ((unsigned) frag_now_fix ()))
260 S_SET_VALUE (symbolP
, (valueT
) frag_now_fix ());
265 /* It is a .comm/.lcomm being converted to initialized
267 symbolP
->sy_frag
= frag_now
;
269 S_GET_OTHER(symbolP
) = const_flag
;
271 S_SET_VALUE (symbolP
, (valueT
) frag_now_fix ());
272 S_SET_SEGMENT (symbolP
, now_seg
); /* keep N_EXT bit */
277 #if defined (S_GET_OTHER) && defined (S_GET_DESC)
278 as_fatal ("Symbol \"%s\" is already defined as \"%s\"/%d.%d.%ld.",
280 segment_name (S_GET_SEGMENT (symbolP
)),
281 S_GET_OTHER (symbolP
), S_GET_DESC (symbolP
),
282 (long) S_GET_VALUE (symbolP
));
284 as_fatal ("Symbol \"%s\" is already defined as \"%s\"/%d.",
286 segment_name (S_GET_SEGMENT (symbolP
)),
287 S_GET_VALUE (symbolP
));
290 } /* if the undefined symbol has no value */
294 /* Don't blow up if the definition is the same */
295 if (!(frag_now
== symbolP
->sy_frag
296 && S_GET_VALUE (symbolP
) == (char*)obstack_next_free (&frags
) - frag_now
->fr_literal
297 && S_GET_SEGMENT (symbolP
) == now_seg
))
298 as_fatal ("Symbol %s already defined.", sym_name
);
299 } /* if this symbol is not yet defined */
304 symbolP
= symbol_new (sym_name
,
306 (valueT
) ((char*)obstack_next_free (&frags
) - frag_now
->fr_literal
),
309 S_SET_OTHER (symbolP
, const_flag
);
312 symbol_table_insert (symbolP
);
313 } /* if we have seen this symbol before */
316 tc_frob_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 offsetT left
, right
, val
;
588 segT seg_left
, seg_right
;
590 symp
->sy_resolving
= 1;
592 switch (symp
->sy_value
.X_op
)
595 S_SET_VALUE (symp
, 0);
598 S_SET_VALUE (symp
, S_GET_VALUE (symp
) + symp
->sy_frag
->fr_address
);
599 if (S_GET_SEGMENT (symp
) == expr_section
)
600 S_SET_SEGMENT (symp
, absolute_section
);
604 resolve_symbol_value (symp
->sy_value
.X_add_symbol
);
606 #ifdef obj_frob_forward_symbol
607 /* Some object formats need to forward the segment. */
608 obj_frob_forward_symbol (symp
);
612 (symp
->sy_value
.X_add_number
613 + symp
->sy_frag
->fr_address
614 + S_GET_VALUE (symp
->sy_value
.X_add_symbol
)));
615 if (S_GET_SEGMENT (symp
) == expr_section
616 || S_GET_SEGMENT (symp
) == undefined_section
)
618 S_GET_SEGMENT (symp
->sy_value
.X_add_symbol
));
623 resolve_symbol_value (symp
->sy_value
.X_add_symbol
);
624 if (symp
->sy_value
.X_op
== O_uminus
)
625 val
= - S_GET_VALUE (symp
->sy_value
.X_add_symbol
);
627 val
= ~ S_GET_VALUE (symp
->sy_value
.X_add_symbol
);
630 + symp
->sy_value
.X_add_number
631 + symp
->sy_frag
->fr_address
));
632 if (S_GET_SEGMENT (symp
) == expr_section
633 || S_GET_SEGMENT (symp
) == undefined_section
)
634 S_SET_SEGMENT (symp
, absolute_section
);
642 case O_bit_inclusive_or
:
644 case O_bit_exclusive_or
:
648 resolve_symbol_value (symp
->sy_value
.X_add_symbol
);
649 resolve_symbol_value (symp
->sy_value
.X_op_symbol
);
650 seg_left
= S_GET_SEGMENT (symp
->sy_value
.X_add_symbol
);
651 seg_right
= S_GET_SEGMENT (symp
->sy_value
.X_op_symbol
);
652 if (seg_left
!= seg_right
653 && seg_left
!= undefined_section
654 && seg_right
!= undefined_section
)
655 as_bad ("%s is operation on symbols in different sections",
657 if ((S_GET_SEGMENT (symp
->sy_value
.X_add_symbol
)
659 && symp
->sy_value
.X_op
!= O_subtract
)
660 as_bad ("%s is illegal operation on non-absolute symbols",
662 left
= S_GET_VALUE (symp
->sy_value
.X_add_symbol
);
663 right
= S_GET_VALUE (symp
->sy_value
.X_op_symbol
);
664 switch (symp
->sy_value
.X_op
)
666 case O_multiply
: val
= left
* right
; break;
667 case O_divide
: val
= left
/ right
; break;
668 case O_modulus
: val
= left
% right
; break;
669 case O_left_shift
: val
= left
<< right
; break;
670 case O_right_shift
: val
= left
>> right
; break;
671 case O_bit_inclusive_or
: val
= left
| right
; break;
672 case O_bit_or_not
: val
= left
|~ right
; break;
673 case O_bit_exclusive_or
: val
= left
^ right
; break;
674 case O_bit_and
: val
= left
& right
; break;
675 case O_add
: val
= left
+ right
; break;
676 case O_subtract
: val
= left
- right
; break;
680 (symp
->sy_value
.X_add_number
681 + symp
->sy_frag
->fr_address
683 if (S_GET_SEGMENT (symp
) == expr_section
684 || S_GET_SEGMENT (symp
) == undefined_section
)
685 S_SET_SEGMENT (symp
, absolute_section
);
691 as_bad ("bad value for symbol \"%s\"", S_GET_NAME (symp
));
696 symp
->sy_resolved
= 1;
699 #ifdef LOCAL_LABELS_DOLLAR
701 /* Dollar labels look like a number followed by a dollar sign. Eg, "42$".
702 They are *really* local. That is, they go out of scope whenever we see a
703 label that isn't local. Also, like fb labels, there can be multiple
704 instances of a dollar label. Therefor, we name encode each instance with
705 the instance number, keep a list of defined symbols separate from the real
706 symbol table, and we treat these buggers as a sparse array. */
708 static long *dollar_labels
;
709 static long *dollar_label_instances
;
710 static char *dollar_label_defines
;
711 static long dollar_label_count
;
712 static long dollar_label_max
;
715 dollar_label_defined (label
)
720 know ((dollar_labels
!= NULL
) || (dollar_label_count
== 0));
722 for (i
= dollar_labels
; i
< dollar_labels
+ dollar_label_count
; ++i
)
724 return dollar_label_defines
[i
- dollar_labels
];
726 /* if we get here, label isn't defined */
728 } /* dollar_label_defined() */
731 dollar_label_instance (label
)
736 know ((dollar_labels
!= NULL
) || (dollar_label_count
== 0));
738 for (i
= dollar_labels
; i
< dollar_labels
+ dollar_label_count
; ++i
)
740 return (dollar_label_instances
[i
- dollar_labels
]);
742 /* If we get here, we haven't seen the label before, therefore its instance
748 dollar_label_clear ()
750 memset (dollar_label_defines
, '\0', dollar_label_count
);
753 #define DOLLAR_LABEL_BUMP_BY 10
756 define_dollar_label (label
)
761 for (i
= dollar_labels
; i
< dollar_labels
+ dollar_label_count
; ++i
)
764 ++dollar_label_instances
[i
- dollar_labels
];
765 dollar_label_defines
[i
- dollar_labels
] = 1;
769 /* if we get to here, we don't have label listed yet. */
771 if (dollar_labels
== NULL
)
773 dollar_labels
= (long *) xmalloc (DOLLAR_LABEL_BUMP_BY
* sizeof (long));
774 dollar_label_instances
= (long *) xmalloc (DOLLAR_LABEL_BUMP_BY
* sizeof (long));
775 dollar_label_defines
= xmalloc (DOLLAR_LABEL_BUMP_BY
);
776 dollar_label_max
= DOLLAR_LABEL_BUMP_BY
;
777 dollar_label_count
= 0;
779 else if (dollar_label_count
== dollar_label_max
)
781 dollar_label_max
+= DOLLAR_LABEL_BUMP_BY
;
782 dollar_labels
= (long *) xrealloc ((char *) dollar_labels
,
783 dollar_label_max
* sizeof (long));
784 dollar_label_instances
= (long *) xrealloc ((char *) dollar_label_instances
,
785 dollar_label_max
* sizeof (long));
786 dollar_label_defines
= xrealloc (dollar_label_defines
, dollar_label_max
);
787 } /* if we needed to grow */
789 dollar_labels
[dollar_label_count
] = label
;
790 dollar_label_instances
[dollar_label_count
] = 1;
791 dollar_label_defines
[dollar_label_count
] = 1;
792 ++dollar_label_count
;
796 * dollar_label_name()
798 * Caller must copy returned name: we re-use the area for the next name.
800 * The mth occurence of label n: is turned into the symbol "Ln^Am"
801 * where n is the label number and m is the instance number. "L" makes
802 * it a label discarded unless debugging and "^A"('\1') ensures no
803 * ordinary symbol SHOULD get the same name as a local label
804 * symbol. The first "4:" is "L4^A1" - the m numbers begin at 1.
806 * fb labels get the same treatment, except that ^B is used in place of ^A.
809 char * /* Return local label name. */
810 dollar_label_name (n
, augend
)
811 register long n
; /* we just saw "n$:" : n a number */
812 register int augend
; /* 0 for current instance, 1 for new instance */
815 /* Returned to caller, then copied. used for created names ("4f") */
816 static char symbol_name_build
[24];
819 char symbol_name_temporary
[20]; /* build up a number, BACKWARDS */
822 know (augend
== 0 || augend
== 1);
823 p
= symbol_name_build
;
826 /* Next code just does sprintf( {}, "%d", n); */
828 q
= symbol_name_temporary
;
829 for (*q
++ = 0, i
= n
; i
; ++q
)
834 while ((*p
= *--q
) != '\0')
839 /* instance number */
840 q
= symbol_name_temporary
;
841 for (*q
++ = 0, i
= dollar_label_instance (n
) + augend
; i
; ++q
)
846 while ((*p
++ = *--q
) != '\0');;
848 /* The label, as a '\0' ended string, starts at symbol_name_build. */
849 return symbol_name_build
;
852 #endif /* LOCAL_LABELS_DOLLAR */
854 #ifdef LOCAL_LABELS_FB
857 * Sombody else's idea of local labels. They are made by "n:" where n
858 * is any decimal digit. Refer to them with
859 * "nb" for previous (backward) n:
860 * or "nf" for next (forward) n:.
862 * We do a little better and let n be any number, not just a single digit, but
863 * since the other guy's assembler only does ten, we treat the first ten
866 * Like someone else's assembler, we have one set of local label counters for
867 * entire assembly, not one set per (sub)segment like in most assemblers. This
868 * implies that one can refer to a label in another segment, and indeed some
869 * crufty compilers have done just that.
871 * Since there could be a LOT of these things, treat them as a sparse array.
874 #define FB_LABEL_SPECIAL (10)
876 static long fb_low_counter
[FB_LABEL_SPECIAL
];
877 static long *fb_labels
;
878 static long *fb_label_instances
;
879 static long fb_label_count
= 0;
880 static long fb_label_max
= 0;
882 /* this must be more than FB_LABEL_SPECIAL */
883 #define FB_LABEL_BUMP_BY (FB_LABEL_SPECIAL + 6)
888 memset ((void *) fb_low_counter
, '\0', sizeof (fb_low_counter
));
889 } /* fb_label_init() */
891 /* add one to the instance number of this fb label */
893 fb_label_instance_inc (label
)
898 if (label
< FB_LABEL_SPECIAL
)
900 ++fb_low_counter
[label
];
904 if (fb_labels
!= NULL
)
906 for (i
= fb_labels
+ FB_LABEL_SPECIAL
;
907 i
< fb_labels
+ fb_label_count
; ++i
)
911 ++fb_label_instances
[i
- fb_labels
];
913 } /* if we find it */
914 } /* for each existing label */
917 /* if we get to here, we don't have label listed yet. */
919 if (fb_labels
== NULL
)
921 fb_labels
= (long *) xmalloc (FB_LABEL_BUMP_BY
* sizeof (long));
922 fb_label_instances
= (long *) xmalloc (FB_LABEL_BUMP_BY
* sizeof (long));
923 fb_label_max
= FB_LABEL_BUMP_BY
;
924 fb_label_count
= FB_LABEL_SPECIAL
;
927 else if (fb_label_count
== fb_label_max
)
929 fb_label_max
+= FB_LABEL_BUMP_BY
;
930 fb_labels
= (long *) xrealloc ((char *) fb_labels
,
931 fb_label_max
* sizeof (long));
932 fb_label_instances
= (long *) xrealloc ((char *) fb_label_instances
,
933 fb_label_max
* sizeof (long));
934 } /* if we needed to grow */
936 fb_labels
[fb_label_count
] = label
;
937 fb_label_instances
[fb_label_count
] = 1;
940 } /* fb_label_instance_inc() */
943 fb_label_instance (label
)
948 if (label
< FB_LABEL_SPECIAL
)
950 return (fb_low_counter
[label
]);
953 if (fb_labels
!= NULL
)
955 for (i
= fb_labels
+ FB_LABEL_SPECIAL
;
956 i
< fb_labels
+ fb_label_count
; ++i
)
960 return (fb_label_instances
[i
- fb_labels
]);
961 } /* if we find it */
962 } /* for each existing label */
965 /* We didn't find the label, so this must be a reference to the
973 * Caller must copy returned name: we re-use the area for the next name.
975 * The mth occurence of label n: is turned into the symbol "Ln^Bm"
976 * where n is the label number and m is the instance number. "L" makes
977 * it a label discarded unless debugging and "^B"('\2') ensures no
978 * ordinary symbol SHOULD get the same name as a local label
979 * symbol. The first "4:" is "L4^B1" - the m numbers begin at 1.
981 * dollar labels get the same treatment, except that ^A is used in place of ^B. */
983 char * /* Return local label name. */
984 fb_label_name (n
, augend
)
985 long n
; /* we just saw "n:", "nf" or "nb" : n a number */
986 long augend
; /* 0 for nb, 1 for n:, nf */
989 /* Returned to caller, then copied. used for created names ("4f") */
990 static char symbol_name_build
[24];
993 char symbol_name_temporary
[20]; /* build up a number, BACKWARDS */
996 know (augend
== 0 || augend
== 1);
997 p
= symbol_name_build
;
1000 /* Next code just does sprintf( {}, "%d", n); */
1002 q
= symbol_name_temporary
;
1003 for (*q
++ = 0, i
= n
; i
; ++q
)
1008 while ((*p
= *--q
) != '\0')
1013 /* instance number */
1014 q
= symbol_name_temporary
;
1015 for (*q
++ = 0, i
= fb_label_instance (n
) + augend
; i
; ++q
)
1020 while ((*p
++ = *--q
) != '\0');;
1022 /* The label, as a '\0' ended string, starts at symbol_name_build. */
1023 return (symbol_name_build
);
1024 } /* fb_label_name() */
1026 #endif /* LOCAL_LABELS_FB */
1030 * decode name that may have been generated by foo_label_name() above. If
1031 * the name wasn't generated by foo_label_name(), then return it unaltered.
1032 * This is used for error messages.
1036 decode_local_label_name (s
)
1040 char *symbol_decode
;
1042 int instance_number
;
1044 const char *message_format
= "\"%d\" (instance number %d of a %s label)";
1049 for (label_number
= 0, p
= s
+ 1; isdigit (*p
); ++p
)
1051 label_number
= (10 * label_number
) + *p
- '0';
1067 for (instance_number
= 0, p
= s
+ 1; isdigit (*p
); ++p
)
1069 instance_number
= (10 * instance_number
) + *p
- '0';
1072 symbol_decode
= obstack_alloc (¬es
, strlen (message_format
) + 30);
1073 (void) sprintf (symbol_decode
, message_format
, label_number
,
1074 instance_number
, type
);
1076 return (symbol_decode
);
1077 } /* decode_local_label_name() */
1079 /* Get the value of a symbol. */
1085 if (s
->sy_value
.X_op
!= O_constant
)
1086 as_bad ("Attempt to get value of unresolved symbol %s", S_GET_NAME (s
));
1087 return (valueT
) s
->sy_value
.X_add_number
;
1090 /* Set the value of a symbol. */
1093 S_SET_VALUE (s
, val
)
1097 s
->sy_value
.X_op
= O_constant
;
1098 s
->sy_value
.X_add_number
= (offsetT
) val
;
1101 #ifdef BFD_ASSEMBLER
1107 flagword flags
= s
->bsym
->flags
;
1110 if (flags
& BSF_LOCAL
&& flags
& (BSF_EXPORT
| BSF_GLOBAL
))
1113 return (flags
& (BSF_EXPORT
| BSF_GLOBAL
)) != 0;
1120 return s
->bsym
->section
== &bfd_com_section
;
1127 return s
->bsym
->section
!= undefined_section
;
1134 if (s
->bsym
->flags
& BSF_DEBUGGING
)
1143 flagword flags
= s
->bsym
->flags
;
1146 if (flags
& BSF_LOCAL
&& flags
& (BSF_EXPORT
| BSF_GLOBAL
))
1149 return (S_GET_NAME (s
)
1151 && (strchr (S_GET_NAME (s
), '\001')
1152 || strchr (S_GET_NAME (s
), '\002')
1153 || (S_LOCAL_NAME (s
)
1154 && !flagseen
['L'])));
1161 return S_IS_EXTERNAL (s
);
1168 return S_GET_NAME (s
) == 0;
1175 return s
->bsym
->name
;
1182 return s
->bsym
->section
;
1186 S_SET_SEGMENT (s
, seg
)
1190 s
->bsym
->section
= seg
;
1197 s
->bsym
->flags
|= BSF_EXPORT
| BSF_GLOBAL
;
1198 s
->bsym
->flags
&= ~BSF_LOCAL
;
1202 S_CLEAR_EXTERNAL (s
)
1205 s
->bsym
->flags
|= BSF_LOCAL
;
1206 s
->bsym
->flags
&= ~(BSF_EXPORT
| BSF_GLOBAL
);
1210 S_SET_NAME (s
, name
)
1214 s
->bsym
->name
= name
;
1216 #endif /* BFD_ASSEMBLER */
1218 /* end of symbols.c */
This page took 0.070236 seconds and 5 git commands to generate.