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. */
20 /* #define DEBUG_SYMS / * to debug symbol list maintenance */
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
;
43 static void fb_label_init
PARAMS ((void));
48 * Return a pointer to a new symbol.
49 * Die if we can't make a new symbol.
50 * Fill in the symbol's values.
51 * Add symbol to end of symbol chain.
54 * Please always call this to create a new symbol.
56 * Changes since 1985: Symbol names may not contain '\0'. Sigh.
57 * 2nd argument is now a SEG rather than a TYPE. The mapping between
58 * segments and types is mostly encapsulated herein (actually, we inherit it
59 * from macros in struc-symbol.h).
63 symbol_new (name
, segment
, valu
, frag
)
64 CONST
char *name
; /* It is copied, the caller can destroy/modify */
65 segT segment
; /* Segment identifier (SEG_<something>) */
66 valueT valu
; /* Symbol value */
67 fragS
*frag
; /* Associated fragment */
69 unsigned int name_length
;
70 char *preserved_copy_of_name
;
73 name_length
= strlen (name
) + 1; /* +1 for \0 */
74 obstack_grow (¬es
, name
, name_length
);
75 preserved_copy_of_name
= obstack_finish (¬es
);
76 #ifdef STRIP_UNDERSCORE
77 if (preserved_copy_of_name
[0] == '_')
78 preserved_copy_of_name
++;
80 symbolP
= (symbolS
*) obstack_alloc (¬es
, sizeof (symbolS
));
82 /* symbol must be born in some fixed state. This seems as good as any. */
83 memset (symbolP
, 0, sizeof (symbolS
));
87 symbolP
->bsym
= bfd_make_empty_symbol (stdoutput
);
88 assert (symbolP
->bsym
!= 0);
89 symbolP
->bsym
->udata
= (PTR
) symbolP
;
91 S_SET_NAME (symbolP
, preserved_copy_of_name
);
93 S_SET_SEGMENT (symbolP
, segment
);
94 S_SET_VALUE (symbolP
, valu
);
95 symbol_clear_list_pointers(symbolP
);
97 symbolP
->sy_frag
= frag
;
99 symbolP
->sy_number
= ~0;
100 symbolP
->sy_name_offset
= (unsigned int) ~0;
104 * Link to end of symbol chain.
106 symbol_append (symbolP
, symbol_lastP
, &symbol_rootP
, &symbol_lastP
);
108 obj_symbol_new_hook (symbolP
);
111 verify_symbol_chain(symbol_rootP
, symbol_lastP
);
112 #endif /* DEBUG_SYMS */
121 * We have just seen "<name>:".
122 * Creates a struct symbol unless it already exists.
124 * Gripes if we are redefining a symbol incompatibly (and ignores it).
128 colon (sym_name
) /* just seen "x:" - rattle symbols & frags */
129 register char *sym_name
; /* symbol name, as a cannonical string */
130 /* We copy this string: OK to alter later. */
132 register symbolS
*symbolP
; /* symbol we are working with */
134 #ifdef LOCAL_LABELS_DOLLAR
135 /* Sun local labels go out of scope whenever a non-local symbol is
138 if (*sym_name
!= 'L')
139 dollar_label_clear ();
140 #endif /* LOCAL_LABELS_DOLLAR */
142 #ifndef WORKING_DOT_WORD
143 if (new_broken_words
)
145 struct broken_word
*a
;
150 extern const int md_short_jump_size
;
151 extern const int md_long_jump_size
;
152 possible_bytes
= (md_short_jump_size
153 + new_broken_words
* md_long_jump_size
);
156 frag_opcode
= frag_var (rs_broken_word
,
160 (symbolS
*) broken_words
,
164 /* We want to store the pointer to where to insert the jump table in the
165 fr_opcode of the rs_broken_word frag. This requires a little
168 && (frag_tmp
->fr_type
!= rs_broken_word
169 || frag_tmp
->fr_opcode
))
170 frag_tmp
= frag_tmp
->fr_next
;
172 frag_tmp
->fr_opcode
= frag_opcode
;
173 new_broken_words
= 0;
175 for (a
= broken_words
; a
&& a
->dispfrag
== 0; a
= a
->next_broken_word
)
176 a
->dispfrag
= frag_tmp
;
178 #endif /* WORKING_DOT_WORD */
180 if ((symbolP
= symbol_find (sym_name
)) != 0)
182 #ifdef RESOLVE_SYMBOL_REDEFINITION
183 if (RESOLVE_SYMBOL_REDEFINITION (symbolP
))
187 * Now check for undefined symbols
189 if (!S_IS_DEFINED (symbolP
))
191 if (S_GET_VALUE (symbolP
) == 0)
193 symbolP
->sy_frag
= frag_now
;
195 S_GET_OTHER(symbolP
) = const_flag
;
197 S_SET_VALUE (symbolP
, (valueT
) ((char*)obstack_next_free (&frags
) - frag_now
->fr_literal
));
198 S_SET_SEGMENT (symbolP
, now_seg
);
201 #endif /* if we have one, it better be zero. */
207 * There are still several cases to check:
208 * A .comm/.lcomm symbol being redefined as
209 * initialized data is OK
210 * A .comm/.lcomm symbol being redefined with
211 * a larger size is also OK
213 * This only used to be allowed on VMS gas, but Sun cc
214 * on the sparc also depends on it.
217 if (((!S_IS_DEBUG (symbolP
)
218 && !S_IS_DEFINED (symbolP
)
219 && S_IS_EXTERNAL (symbolP
))
220 || S_GET_SEGMENT (symbolP
) == bss_section
)
221 && (now_seg
== data_section
222 || now_seg
== S_GET_SEGMENT (symbolP
)))
225 * Select which of the 2 cases this is
227 if (now_seg
!= data_section
)
230 * New .comm for prev .comm symbol.
231 * If the new size is larger we just
232 * change its value. If the new size
233 * is smaller, we ignore this symbol
235 if (S_GET_VALUE (symbolP
)
236 < ((unsigned) frag_now_fix ()))
238 S_SET_VALUE (symbolP
, (valueT
) frag_now_fix ());
243 /* It is a .comm/.lcomm being converted to initialized
245 symbolP
->sy_frag
= frag_now
;
247 S_GET_OTHER(symbolP
) = const_flag
;
249 S_SET_VALUE (symbolP
, (valueT
) frag_now_fix ());
250 S_SET_SEGMENT (symbolP
, now_seg
); /* keep N_EXT bit */
255 #if defined (S_GET_OTHER) && defined (S_GET_DESC)
256 as_fatal ("Symbol \"%s\" is already defined as \"%s\"/%d.%d.%ld.",
258 segment_name (S_GET_SEGMENT (symbolP
)),
259 S_GET_OTHER (symbolP
), S_GET_DESC (symbolP
),
260 (long) S_GET_VALUE (symbolP
));
262 as_fatal ("Symbol \"%s\" is already defined as \"%s\"/%ld.",
264 segment_name (S_GET_SEGMENT (symbolP
)),
265 (long) S_GET_VALUE (symbolP
));
268 } /* if the undefined symbol has no value */
272 /* Don't blow up if the definition is the same */
273 if (!(frag_now
== symbolP
->sy_frag
274 && S_GET_VALUE (symbolP
) == (char*)obstack_next_free (&frags
) - frag_now
->fr_literal
275 && S_GET_SEGMENT (symbolP
) == now_seg
))
276 as_fatal ("Symbol %s already defined.", sym_name
);
277 } /* if this symbol is not yet defined */
282 symbolP
= symbol_new (sym_name
,
284 (valueT
) ((char*)obstack_next_free (&frags
) - frag_now
->fr_literal
),
287 S_SET_OTHER (symbolP
, const_flag
);
290 symbol_table_insert (symbolP
);
291 } /* if we have seen this symbol before */
294 tc_frob_label (symbolP
);
300 * symbol_table_insert()
302 * Die if we can't insert the symbol.
307 symbol_table_insert (symbolP
)
310 register const char *error_string
;
313 know (S_GET_NAME (symbolP
));
315 if ((error_string
= hash_jam (sy_hash
, S_GET_NAME (symbolP
), (PTR
) symbolP
)))
317 as_fatal ("Inserting \"%s\" into symbol table failed: %s",
318 S_GET_NAME (symbolP
), error_string
);
320 } /* symbol_table_insert() */
323 * symbol_find_or_make()
325 * If a symbol name does not exist, create it as undefined, and insert
326 * it into the symbol table. Return a pointer to it.
329 symbol_find_or_make (name
)
332 register symbolS
*symbolP
;
334 symbolP
= symbol_find (name
);
338 symbolP
= symbol_make (name
);
340 symbol_table_insert (symbolP
);
341 } /* if symbol wasn't found */
344 } /* symbol_find_or_make() */
352 /* Let the machine description default it, e.g. for register names. */
353 symbolP
= md_undefined_symbol ((char *) name
);
356 symbolP
= symbol_new (name
, undefined_section
, (valueT
) 0, &zero_address_frag
);
359 } /* symbol_make() */
364 * Implement symbol table lookup.
365 * In: A symbol's name as a string: '\0' can't be part of a symbol name.
366 * Out: NULL if the name was not in the symbol table, else the address
367 * of a struct symbol associated with that name.
374 #ifdef STRIP_UNDERSCORE
375 return (symbol_find_base (name
, 1));
376 #else /* STRIP_UNDERSCORE */
377 return (symbol_find_base (name
, 0));
378 #endif /* STRIP_UNDERSCORE */
379 } /* symbol_find() */
382 symbol_find_base (name
, strip_underscore
)
384 int strip_underscore
;
386 if (strip_underscore
&& *name
== '_')
388 return ((symbolS
*) hash_find (sy_hash
, name
));
392 * Once upon a time, symbols were kept in a singly linked list. At
393 * least coff needs to be able to rearrange them from time to time, for
394 * which a doubly linked list is much more convenient. Loic did these
395 * as macros which seemed dangerous to me so they're now functions.
399 /* Link symbol ADDME after symbol TARGET in the chain. */
401 symbol_append (addme
, target
, rootPP
, lastPP
)
409 know (*rootPP
== NULL
);
410 know (*lastPP
== NULL
);
414 } /* if the list is empty */
416 if (target
->sy_next
!= NULL
)
418 #ifdef SYMBOLS_NEED_BACKPOINTERS
419 target
->sy_next
->sy_previous
= addme
;
420 #endif /* SYMBOLS_NEED_BACKPOINTERS */
424 know (*lastPP
== target
);
426 } /* if we have a next */
428 addme
->sy_next
= target
->sy_next
;
429 target
->sy_next
= addme
;
431 #ifdef SYMBOLS_NEED_BACKPOINTERS
432 addme
->sy_previous
= target
;
433 #endif /* SYMBOLS_NEED_BACKPOINTERS */
436 #ifdef SYMBOLS_NEED_BACKPOINTERS
437 /* Remove SYMBOLP from the list. */
439 symbol_remove (symbolP
, rootPP
, lastPP
)
444 if (symbolP
== *rootPP
)
446 *rootPP
= symbolP
->sy_next
;
447 } /* if it was the root */
449 if (symbolP
== *lastPP
)
451 *lastPP
= symbolP
->sy_previous
;
452 } /* if it was the tail */
454 if (symbolP
->sy_next
!= NULL
)
456 symbolP
->sy_next
->sy_previous
= symbolP
->sy_previous
;
459 if (symbolP
->sy_previous
!= NULL
)
461 symbolP
->sy_previous
->sy_next
= symbolP
->sy_next
;
465 verify_symbol_chain (*rootPP
, *lastPP
);
466 #endif /* DEBUG_SYMS */
469 /* Set the chain pointers of SYMBOL to null. */
471 symbol_clear_list_pointers (symbolP
)
474 symbolP
->sy_next
= NULL
;
475 symbolP
->sy_previous
= NULL
;
478 /* Link symbol ADDME before symbol TARGET in the chain. */
480 symbol_insert (addme
, target
, rootPP
, lastPP
)
486 if (target
->sy_previous
!= NULL
)
488 target
->sy_previous
->sy_next
= addme
;
492 know (*rootPP
== target
);
496 addme
->sy_previous
= target
->sy_previous
;
497 target
->sy_previous
= addme
;
498 addme
->sy_next
= target
;
501 verify_symbol_chain (*rootPP
, *lastPP
);
502 #endif /* DEBUG_SYMS */
505 #endif /* SYMBOLS_NEED_BACKPOINTERS */
508 verify_symbol_chain (rootP
, lastP
)
512 symbolS
*symbolP
= rootP
;
517 for (; symbol_next (symbolP
) != NULL
; symbolP
= symbol_next (symbolP
))
519 #ifdef SYMBOLS_NEED_BACKPOINTERS
520 know (symbolP
->sy_next
->sy_previous
== symbolP
);
522 /* Walk the list anyways, to make sure pointers are still good. */
524 #endif /* SYMBOLS_NEED_BACKPOINTERS */
527 assert (lastP
== symbolP
);
531 verify_symbol_chain_2 (sym
)
534 symbolS
*p
= sym
, *n
= sym
;
535 #ifdef SYMBOLS_NEED_BACKPOINTERS
536 while (symbol_previous (p
))
537 p
= symbol_previous (p
);
539 while (symbol_next (n
))
541 verify_symbol_chain (p
, n
);
544 /* Resolve the value of a symbol. This is called during the final
545 pass over the symbol table to resolve any symbols with complex
549 resolve_symbol_value (symp
)
554 if (symp
->sy_resolved
)
559 if (symp
->sy_resolving
)
561 as_bad ("Symbol definition loop encountered at %s",
563 S_SET_VALUE (symp
, (valueT
) 0);
568 offsetT left
, right
, val
;
569 segT seg_left
, seg_right
;
571 symp
->sy_resolving
= 1;
573 switch (symp
->sy_value
.X_op
)
576 S_SET_VALUE (symp
, 0);
579 S_SET_VALUE (symp
, S_GET_VALUE (symp
) + symp
->sy_frag
->fr_address
);
580 if (S_GET_SEGMENT (symp
) == expr_section
)
581 S_SET_SEGMENT (symp
, absolute_section
);
586 resolve_symbol_value (symp
->sy_value
.X_add_symbol
);
588 #ifdef obj_frob_forward_symbol
589 /* Some object formats need to forward the segment. */
590 obj_frob_forward_symbol (symp
);
594 (symp
->sy_value
.X_add_number
595 + symp
->sy_frag
->fr_address
596 + S_GET_VALUE (symp
->sy_value
.X_add_symbol
)));
597 if (S_GET_SEGMENT (symp
) == expr_section
598 || S_GET_SEGMENT (symp
) == undefined_section
)
600 S_GET_SEGMENT (symp
->sy_value
.X_add_symbol
));
602 resolved
= symp
->sy_value
.X_add_symbol
->sy_resolved
;
607 resolve_symbol_value (symp
->sy_value
.X_add_symbol
);
608 if (symp
->sy_value
.X_op
== O_uminus
)
609 val
= - S_GET_VALUE (symp
->sy_value
.X_add_symbol
);
611 val
= ~ S_GET_VALUE (symp
->sy_value
.X_add_symbol
);
614 + symp
->sy_value
.X_add_number
615 + symp
->sy_frag
->fr_address
));
616 if (S_GET_SEGMENT (symp
) == expr_section
617 || S_GET_SEGMENT (symp
) == undefined_section
)
618 S_SET_SEGMENT (symp
, absolute_section
);
619 resolved
= symp
->sy_value
.X_add_symbol
->sy_resolved
;
627 case O_bit_inclusive_or
:
629 case O_bit_exclusive_or
:
633 resolve_symbol_value (symp
->sy_value
.X_add_symbol
);
634 resolve_symbol_value (symp
->sy_value
.X_op_symbol
);
635 seg_left
= S_GET_SEGMENT (symp
->sy_value
.X_add_symbol
);
636 seg_right
= S_GET_SEGMENT (symp
->sy_value
.X_op_symbol
);
637 if (seg_left
!= seg_right
638 && seg_left
!= undefined_section
639 && seg_right
!= undefined_section
)
640 as_bad ("%s is operation on symbols in different sections",
642 if ((S_GET_SEGMENT (symp
->sy_value
.X_add_symbol
)
644 && symp
->sy_value
.X_op
!= O_subtract
)
645 as_bad ("%s is illegal operation on non-absolute symbols",
647 left
= S_GET_VALUE (symp
->sy_value
.X_add_symbol
);
648 right
= S_GET_VALUE (symp
->sy_value
.X_op_symbol
);
649 switch (symp
->sy_value
.X_op
)
651 case O_multiply
: val
= left
* right
; break;
652 case O_divide
: val
= left
/ right
; break;
653 case O_modulus
: val
= left
% right
; break;
654 case O_left_shift
: val
= left
<< right
; break;
655 case O_right_shift
: val
= left
>> right
; break;
656 case O_bit_inclusive_or
: val
= left
| right
; break;
657 case O_bit_or_not
: val
= left
|~ right
; break;
658 case O_bit_exclusive_or
: val
= left
^ right
; break;
659 case O_bit_and
: val
= left
& right
; break;
660 case O_add
: val
= left
+ right
; break;
661 case O_subtract
: val
= left
- right
; break;
665 (symp
->sy_value
.X_add_number
666 + symp
->sy_frag
->fr_address
668 if (S_GET_SEGMENT (symp
) == expr_section
669 || S_GET_SEGMENT (symp
) == undefined_section
)
670 S_SET_SEGMENT (symp
, absolute_section
);
671 resolved
= (symp
->sy_value
.X_add_symbol
->sy_resolved
672 && symp
->sy_value
.X_op_symbol
->sy_resolved
);
678 /* Give an error (below) if not in expr_section. We don't
679 want to worry about expr_section symbols, because they
680 are fictional (they are created as part of expression
681 resolution), and any problems may not actually mean
687 /* Don't worry if we can't resolve an expr_section symbol. */
689 symp
->sy_resolved
= 1;
690 else if (S_GET_SEGMENT (symp
) != expr_section
)
692 as_bad ("can't resolve value for symbol \"%s\"", S_GET_NAME (symp
));
693 symp
->sy_resolved
= 1;
697 #ifdef LOCAL_LABELS_DOLLAR
699 /* Dollar labels look like a number followed by a dollar sign. Eg, "42$".
700 They are *really* local. That is, they go out of scope whenever we see a
701 label that isn't local. Also, like fb labels, there can be multiple
702 instances of a dollar label. Therefor, we name encode each instance with
703 the instance number, keep a list of defined symbols separate from the real
704 symbol table, and we treat these buggers as a sparse array. */
706 static long *dollar_labels
;
707 static long *dollar_label_instances
;
708 static char *dollar_label_defines
;
709 static long dollar_label_count
;
710 static unsigned long dollar_label_max
;
713 dollar_label_defined (label
)
718 know ((dollar_labels
!= NULL
) || (dollar_label_count
== 0));
720 for (i
= dollar_labels
; i
< dollar_labels
+ dollar_label_count
; ++i
)
722 return dollar_label_defines
[i
- dollar_labels
];
724 /* if we get here, label isn't defined */
726 } /* dollar_label_defined() */
729 dollar_label_instance (label
)
734 know ((dollar_labels
!= NULL
) || (dollar_label_count
== 0));
736 for (i
= dollar_labels
; i
< dollar_labels
+ dollar_label_count
; ++i
)
738 return (dollar_label_instances
[i
- dollar_labels
]);
740 /* If we get here, we haven't seen the label before, therefore its instance
746 dollar_label_clear ()
748 memset (dollar_label_defines
, '\0', (unsigned int) dollar_label_count
);
751 #define DOLLAR_LABEL_BUMP_BY 10
754 define_dollar_label (label
)
759 for (i
= dollar_labels
; i
< dollar_labels
+ dollar_label_count
; ++i
)
762 ++dollar_label_instances
[i
- dollar_labels
];
763 dollar_label_defines
[i
- dollar_labels
] = 1;
767 /* if we get to here, we don't have label listed yet. */
769 if (dollar_labels
== NULL
)
771 dollar_labels
= (long *) xmalloc (DOLLAR_LABEL_BUMP_BY
* sizeof (long));
772 dollar_label_instances
= (long *) xmalloc (DOLLAR_LABEL_BUMP_BY
* sizeof (long));
773 dollar_label_defines
= xmalloc (DOLLAR_LABEL_BUMP_BY
);
774 dollar_label_max
= DOLLAR_LABEL_BUMP_BY
;
775 dollar_label_count
= 0;
777 else if (dollar_label_count
== dollar_label_max
)
779 dollar_label_max
+= DOLLAR_LABEL_BUMP_BY
;
780 dollar_labels
= (long *) xrealloc ((char *) dollar_labels
,
781 dollar_label_max
* sizeof (long));
782 dollar_label_instances
= (long *) xrealloc ((char *) dollar_label_instances
,
783 dollar_label_max
* sizeof (long));
784 dollar_label_defines
= xrealloc (dollar_label_defines
, dollar_label_max
);
785 } /* if we needed to grow */
787 dollar_labels
[dollar_label_count
] = label
;
788 dollar_label_instances
[dollar_label_count
] = 1;
789 dollar_label_defines
[dollar_label_count
] = 1;
790 ++dollar_label_count
;
794 * dollar_label_name()
796 * Caller must copy returned name: we re-use the area for the next name.
798 * The mth occurence of label n: is turned into the symbol "Ln^Am"
799 * where n is the label number and m is the instance number. "L" makes
800 * it a label discarded unless debugging and "^A"('\1') ensures no
801 * ordinary symbol SHOULD get the same name as a local label
802 * symbol. The first "4:" is "L4^A1" - the m numbers begin at 1.
804 * fb labels get the same treatment, except that ^B is used in place of ^A.
807 char * /* Return local label name. */
808 dollar_label_name (n
, augend
)
809 register long n
; /* we just saw "n$:" : n a number */
810 register int augend
; /* 0 for current instance, 1 for new instance */
813 /* Returned to caller, then copied. used for created names ("4f") */
814 static char symbol_name_build
[24];
817 char symbol_name_temporary
[20]; /* build up a number, BACKWARDS */
820 know (augend
== 0 || augend
== 1);
821 p
= symbol_name_build
;
824 /* Next code just does sprintf( {}, "%d", n); */
826 q
= symbol_name_temporary
;
827 for (*q
++ = 0, i
= n
; i
; ++q
)
832 while ((*p
= *--q
) != '\0')
837 /* instance number */
838 q
= symbol_name_temporary
;
839 for (*q
++ = 0, i
= dollar_label_instance (n
) + augend
; i
; ++q
)
844 while ((*p
++ = *--q
) != '\0');;
846 /* The label, as a '\0' ended string, starts at symbol_name_build. */
847 return symbol_name_build
;
850 #endif /* LOCAL_LABELS_DOLLAR */
852 #ifdef LOCAL_LABELS_FB
855 * Sombody else's idea of local labels. They are made by "n:" where n
856 * is any decimal digit. Refer to them with
857 * "nb" for previous (backward) n:
858 * or "nf" for next (forward) n:.
860 * We do a little better and let n be any number, not just a single digit, but
861 * since the other guy's assembler only does ten, we treat the first ten
864 * Like someone else's assembler, we have one set of local label counters for
865 * entire assembly, not one set per (sub)segment like in most assemblers. This
866 * implies that one can refer to a label in another segment, and indeed some
867 * crufty compilers have done just that.
869 * Since there could be a LOT of these things, treat them as a sparse array.
872 #define FB_LABEL_SPECIAL (10)
874 static long fb_low_counter
[FB_LABEL_SPECIAL
];
875 static long *fb_labels
;
876 static long *fb_label_instances
;
877 static long fb_label_count
;
878 static long fb_label_max
;
880 /* this must be more than FB_LABEL_SPECIAL */
881 #define FB_LABEL_BUMP_BY (FB_LABEL_SPECIAL + 6)
886 memset ((void *) fb_low_counter
, '\0', sizeof (fb_low_counter
));
887 } /* fb_label_init() */
889 /* add one to the instance number of this fb label */
891 fb_label_instance_inc (label
)
896 if (label
< FB_LABEL_SPECIAL
)
898 ++fb_low_counter
[label
];
902 if (fb_labels
!= NULL
)
904 for (i
= fb_labels
+ FB_LABEL_SPECIAL
;
905 i
< fb_labels
+ fb_label_count
; ++i
)
909 ++fb_label_instances
[i
- fb_labels
];
911 } /* if we find it */
912 } /* for each existing label */
915 /* if we get to here, we don't have label listed yet. */
917 if (fb_labels
== NULL
)
919 fb_labels
= (long *) xmalloc (FB_LABEL_BUMP_BY
* sizeof (long));
920 fb_label_instances
= (long *) xmalloc (FB_LABEL_BUMP_BY
* sizeof (long));
921 fb_label_max
= FB_LABEL_BUMP_BY
;
922 fb_label_count
= FB_LABEL_SPECIAL
;
925 else if (fb_label_count
== fb_label_max
)
927 fb_label_max
+= FB_LABEL_BUMP_BY
;
928 fb_labels
= (long *) xrealloc ((char *) fb_labels
,
929 fb_label_max
* sizeof (long));
930 fb_label_instances
= (long *) xrealloc ((char *) fb_label_instances
,
931 fb_label_max
* sizeof (long));
932 } /* if we needed to grow */
934 fb_labels
[fb_label_count
] = label
;
935 fb_label_instances
[fb_label_count
] = 1;
940 fb_label_instance (label
)
945 if (label
< FB_LABEL_SPECIAL
)
947 return (fb_low_counter
[label
]);
950 if (fb_labels
!= NULL
)
952 for (i
= fb_labels
+ FB_LABEL_SPECIAL
;
953 i
< fb_labels
+ fb_label_count
; ++i
)
957 return (fb_label_instances
[i
- fb_labels
]);
958 } /* if we find it */
959 } /* for each existing label */
962 /* We didn't find the label, so this must be a reference to the
970 * Caller must copy returned name: we re-use the area for the next name.
972 * The mth occurence of label n: is turned into the symbol "Ln^Bm"
973 * where n is the label number and m is the instance number. "L" makes
974 * it a label discarded unless debugging and "^B"('\2') ensures no
975 * ordinary symbol SHOULD get the same name as a local label
976 * symbol. The first "4:" is "L4^B1" - the m numbers begin at 1.
978 * dollar labels get the same treatment, except that ^A is used in place of ^B. */
980 char * /* Return local label name. */
981 fb_label_name (n
, augend
)
982 long n
; /* we just saw "n:", "nf" or "nb" : n a number */
983 long augend
; /* 0 for nb, 1 for n:, nf */
986 /* Returned to caller, then copied. used for created names ("4f") */
987 static char symbol_name_build
[24];
990 char symbol_name_temporary
[20]; /* build up a number, BACKWARDS */
993 know (augend
== 0 || augend
== 1);
994 p
= symbol_name_build
;
997 /* Next code just does sprintf( {}, "%d", n); */
999 q
= symbol_name_temporary
;
1000 for (*q
++ = 0, i
= n
; i
; ++q
)
1005 while ((*p
= *--q
) != '\0')
1010 /* instance number */
1011 q
= symbol_name_temporary
;
1012 for (*q
++ = 0, i
= fb_label_instance (n
) + augend
; i
; ++q
)
1017 while ((*p
++ = *--q
) != '\0');;
1019 /* The label, as a '\0' ended string, starts at symbol_name_build. */
1020 return (symbol_name_build
);
1021 } /* fb_label_name() */
1023 #endif /* LOCAL_LABELS_FB */
1027 * decode name that may have been generated by foo_label_name() above. If
1028 * the name wasn't generated by foo_label_name(), then return it unaltered.
1029 * This is used for error messages.
1033 decode_local_label_name (s
)
1037 char *symbol_decode
;
1039 int instance_number
;
1041 const char *message_format
= "\"%d\" (instance number %d of a %s label)";
1046 for (label_number
= 0, p
= s
+ 1; isdigit (*p
); ++p
)
1048 label_number
= (10 * label_number
) + *p
- '0';
1064 for (instance_number
= 0, p
= s
+ 1; isdigit (*p
); ++p
)
1066 instance_number
= (10 * instance_number
) + *p
- '0';
1069 symbol_decode
= obstack_alloc (¬es
, strlen (message_format
) + 30);
1070 (void) sprintf (symbol_decode
, message_format
, label_number
,
1071 instance_number
, type
);
1073 return (symbol_decode
);
1074 } /* decode_local_label_name() */
1076 /* Get the value of a symbol. */
1082 if (s
->sy_value
.X_op
!= O_constant
)
1083 as_bad ("Attempt to get value of unresolved symbol %s", S_GET_NAME (s
));
1084 return (valueT
) s
->sy_value
.X_add_number
;
1087 /* Set the value of a symbol. */
1090 S_SET_VALUE (s
, val
)
1094 s
->sy_value
.X_op
= O_constant
;
1095 s
->sy_value
.X_add_number
= (offsetT
) val
;
1096 s
->sy_value
.X_unsigned
= 0;
1099 #ifdef BFD_ASSEMBLER
1105 flagword flags
= s
->bsym
->flags
;
1108 if (flags
& BSF_LOCAL
&& flags
& BSF_GLOBAL
)
1111 return (flags
& BSF_GLOBAL
) != 0;
1118 return bfd_is_com_section (s
->bsym
->section
);
1125 return s
->bsym
->section
!= undefined_section
;
1132 if (s
->bsym
->flags
& BSF_DEBUGGING
)
1141 flagword flags
= s
->bsym
->flags
;
1144 if (flags
& BSF_LOCAL
&& flags
& BSF_GLOBAL
)
1147 return (S_GET_NAME (s
)
1149 && (strchr (S_GET_NAME (s
), '\001')
1150 || strchr (S_GET_NAME (s
), '\002')
1151 || (S_LOCAL_NAME (s
)
1152 && !flagseen
['L'])));
1159 return S_IS_EXTERNAL (s
);
1166 return S_GET_NAME (s
) == 0;
1173 return s
->bsym
->name
;
1180 return s
->bsym
->section
;
1184 S_SET_SEGMENT (s
, seg
)
1188 s
->bsym
->section
= seg
;
1195 s
->bsym
->flags
|= BSF_GLOBAL
;
1196 s
->bsym
->flags
&= ~(BSF_LOCAL
|BSF_WEAK
);
1200 S_CLEAR_EXTERNAL (s
)
1203 s
->bsym
->flags
|= BSF_LOCAL
;
1204 s
->bsym
->flags
&= ~(BSF_GLOBAL
|BSF_WEAK
);
1211 s
->bsym
->flags
|= BSF_WEAK
;
1212 s
->bsym
->flags
&= ~(BSF_GLOBAL
|BSF_LOCAL
);
1216 S_SET_NAME (s
, name
)
1220 s
->bsym
->name
= name
;
1222 #endif /* BFD_ASSEMBLER */
1227 symbol_lastP
= NULL
;
1228 symbol_rootP
= NULL
; /* In case we have 0 symbols (!!) */
1229 sy_hash
= hash_new ();
1230 memset ((char *) (&abs_symbol
), '\0', sizeof (abs_symbol
));
1231 #ifdef BFD_ASSEMBLER
1232 abs_symbol
.bsym
= bfd_abs_section
.symbol
;
1234 /* Can't initialise a union. Sigh. */
1235 S_SET_SEGMENT (&abs_symbol
, absolute_section
);
1237 #ifdef LOCAL_LABELS_FB
1239 #endif /* LOCAL_LABELS_FB */
1242 /* end of symbols.c */
This page took 0.076104 seconds and 4 git commands to generate.