1 /* symbols.c -symbol table-
2 Copyright (C) 1987, 90, 91, 92, 93, 94, 95, 96, 1997
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));
61 Return a pointer to a new symbol. Die if we can't make a new
62 symbol. Fill in the symbol's values. Add symbol to end of symbol
65 This function should be called in the general case of creating a
66 symbol. However, if the output file symbol table has already been
67 set, and you are certain that this symbol won't be wanted in the
68 output file, you can call symbol_create. */
71 symbol_new (name
, segment
, valu
, frag
)
77 symbolS
*symbolP
= symbol_create (name
, segment
, valu
, frag
);
80 * Link to end of symbol chain.
84 extern int symbol_table_frozen
;
85 if (symbol_table_frozen
)
89 symbol_append (symbolP
, symbol_lastP
, &symbol_rootP
, &symbol_lastP
);
95 symbol_create (name
, segment
, valu
, frag
)
96 const char *name
; /* It is copied, the caller can destroy/modify */
97 segT segment
; /* Segment identifier (SEG_<something>) */
98 valueT valu
; /* Symbol value */
99 fragS
*frag
; /* Associated fragment */
101 unsigned int name_length
;
102 char *preserved_copy_of_name
;
105 name_length
= strlen (name
) + 1; /* +1 for \0 */
106 obstack_grow (¬es
, name
, name_length
);
107 preserved_copy_of_name
= obstack_finish (¬es
);
108 #ifdef STRIP_UNDERSCORE
109 if (preserved_copy_of_name
[0] == '_')
110 preserved_copy_of_name
++;
113 #ifdef tc_canonicalize_symbol_name
114 preserved_copy_of_name
=
115 tc_canonicalize_symbol_name (preserved_copy_of_name
);
118 if (! symbols_case_sensitive
)
122 for (s
= (unsigned char *) preserved_copy_of_name
; *s
!= '\0'; s
++)
127 symbolP
= (symbolS
*) obstack_alloc (¬es
, sizeof (symbolS
));
129 /* symbol must be born in some fixed state. This seems as good as any. */
130 memset (symbolP
, 0, sizeof (symbolS
));
133 symbolP
->bsym
= bfd_make_empty_symbol (stdoutput
);
134 if (symbolP
->bsym
== NULL
)
135 as_perror ("%s", "bfd_make_empty_symbol");
136 symbolP
->bsym
->udata
.p
= (PTR
) symbolP
;
138 S_SET_NAME (symbolP
, preserved_copy_of_name
);
140 S_SET_SEGMENT (symbolP
, segment
);
141 S_SET_VALUE (symbolP
, valu
);
142 symbol_clear_list_pointers (symbolP
);
144 symbolP
->sy_frag
= frag
;
145 #ifndef BFD_ASSEMBLER
146 symbolP
->sy_number
= ~0;
147 symbolP
->sy_name_offset
= (unsigned int) ~0;
150 obj_symbol_new_hook (symbolP
);
152 #ifdef tc_symbol_new_hook
153 tc_symbol_new_hook (symbolP
);
163 * We have just seen "<name>:".
164 * Creates a struct symbol unless it already exists.
166 * Gripes if we are redefining a symbol incompatibly (and ignores it).
170 colon (sym_name
) /* just seen "x:" - rattle symbols & frags */
171 const char *sym_name
; /* symbol name, as a cannonical string */
172 /* We copy this string: OK to alter later. */
174 register symbolS
*symbolP
; /* symbol we are working with */
176 /* Sun local labels go out of scope whenever a non-local symbol is
178 if (LOCAL_LABELS_DOLLAR
)
183 local
= bfd_is_local_label_name (stdoutput
, sym_name
);
185 local
= LOCAL_LABEL (sym_name
);
189 dollar_label_clear ();
192 #ifndef WORKING_DOT_WORD
193 if (new_broken_words
)
195 struct broken_word
*a
;
200 extern const int md_short_jump_size
;
201 extern const int md_long_jump_size
;
202 possible_bytes
= (md_short_jump_size
203 + new_broken_words
* md_long_jump_size
);
206 frag_opcode
= frag_var (rs_broken_word
,
210 (symbolS
*) broken_words
,
214 /* We want to store the pointer to where to insert the jump table in the
215 fr_opcode of the rs_broken_word frag. This requires a little
218 && (frag_tmp
->fr_type
!= rs_broken_word
219 || frag_tmp
->fr_opcode
))
220 frag_tmp
= frag_tmp
->fr_next
;
222 frag_tmp
->fr_opcode
= frag_opcode
;
223 new_broken_words
= 0;
225 for (a
= broken_words
; a
&& a
->dispfrag
== 0; a
= a
->next_broken_word
)
226 a
->dispfrag
= frag_tmp
;
228 #endif /* WORKING_DOT_WORD */
230 if ((symbolP
= symbol_find (sym_name
)) != 0)
232 #ifdef RESOLVE_SYMBOL_REDEFINITION
233 if (RESOLVE_SYMBOL_REDEFINITION (symbolP
))
237 * Now check for undefined symbols
239 if (!S_IS_DEFINED (symbolP
) || S_IS_COMMON (symbolP
))
241 if (S_GET_VALUE (symbolP
) == 0)
243 symbolP
->sy_frag
= frag_now
;
245 S_SET_OTHER(symbolP
, const_flag
);
247 S_SET_VALUE (symbolP
, (valueT
) frag_now_fix ());
248 S_SET_SEGMENT (symbolP
, now_seg
);
251 #endif /* if we have one, it better be zero. */
257 * There are still several cases to check:
258 * A .comm/.lcomm symbol being redefined as
259 * initialized data is OK
260 * A .comm/.lcomm symbol being redefined with
261 * a larger size is also OK
263 * This only used to be allowed on VMS gas, but Sun cc
264 * on the sparc also depends on it.
267 if (((!S_IS_DEBUG (symbolP
)
268 && (!S_IS_DEFINED (symbolP
) || S_IS_COMMON (symbolP
))
269 && S_IS_EXTERNAL (symbolP
))
270 || S_GET_SEGMENT (symbolP
) == bss_section
)
271 && (now_seg
== data_section
272 || now_seg
== S_GET_SEGMENT (symbolP
)))
275 * Select which of the 2 cases this is
277 if (now_seg
!= data_section
)
280 * New .comm for prev .comm symbol.
281 * If the new size is larger we just
282 * change its value. If the new size
283 * is smaller, we ignore this symbol
285 if (S_GET_VALUE (symbolP
)
286 < ((unsigned) frag_now_fix ()))
288 S_SET_VALUE (symbolP
, (valueT
) frag_now_fix ());
293 /* It is a .comm/.lcomm being converted to initialized
295 symbolP
->sy_frag
= frag_now
;
297 S_SET_OTHER(symbolP
, const_flag
);
299 S_SET_VALUE (symbolP
, (valueT
) frag_now_fix ());
300 S_SET_SEGMENT (symbolP
, now_seg
); /* keep N_EXT bit */
305 #if defined (S_GET_OTHER) && defined (S_GET_DESC)
306 as_fatal ("Symbol \"%s\" is already defined as \"%s\"/%d.%d.%ld.",
308 segment_name (S_GET_SEGMENT (symbolP
)),
309 S_GET_OTHER (symbolP
), S_GET_DESC (symbolP
),
310 (long) S_GET_VALUE (symbolP
));
312 as_fatal ("Symbol \"%s\" is already defined as \"%s\"/%ld.",
314 segment_name (S_GET_SEGMENT (symbolP
)),
315 (long) S_GET_VALUE (symbolP
));
318 } /* if the undefined symbol has no value */
322 /* Don't blow up if the definition is the same */
323 if (!(frag_now
== symbolP
->sy_frag
324 && S_GET_VALUE (symbolP
) == frag_now_fix ()
325 && S_GET_SEGMENT (symbolP
) == now_seg
))
326 as_fatal ("Symbol %s already defined.", sym_name
);
327 } /* if this symbol is not yet defined */
332 symbolP
= symbol_new (sym_name
, now_seg
, (valueT
) frag_now_fix (),
335 S_SET_OTHER (symbolP
, const_flag
);
338 symbol_table_insert (symbolP
);
339 } /* if we have seen this symbol before */
341 if (mri_common_symbol
!= NULL
)
343 /* This symbol is actually being defined within an MRI common
344 section. This requires special handling. */
345 symbolP
->sy_value
.X_op
= O_symbol
;
346 symbolP
->sy_value
.X_add_symbol
= mri_common_symbol
;
347 symbolP
->sy_value
.X_add_number
= S_GET_VALUE (mri_common_symbol
);
348 symbolP
->sy_frag
= &zero_address_frag
;
349 S_SET_SEGMENT (symbolP
, expr_section
);
350 symbolP
->sy_mri_common
= 1;
354 tc_frob_label (symbolP
);
356 #ifdef obj_frob_label
357 obj_frob_label (symbolP
);
365 * symbol_table_insert()
367 * Die if we can't insert the symbol.
372 symbol_table_insert (symbolP
)
375 register const char *error_string
;
378 know (S_GET_NAME (symbolP
));
380 if ((error_string
= hash_jam (sy_hash
, S_GET_NAME (symbolP
), (PTR
) symbolP
)))
382 as_fatal ("Inserting \"%s\" into symbol table failed: %s",
383 S_GET_NAME (symbolP
), error_string
);
385 } /* symbol_table_insert() */
388 * symbol_find_or_make()
390 * If a symbol name does not exist, create it as undefined, and insert
391 * it into the symbol table. Return a pointer to it.
394 symbol_find_or_make (name
)
397 register symbolS
*symbolP
;
399 symbolP
= symbol_find (name
);
403 symbolP
= symbol_make (name
);
405 symbol_table_insert (symbolP
);
406 } /* if symbol wasn't found */
409 } /* symbol_find_or_make() */
417 /* Let the machine description default it, e.g. for register names. */
418 symbolP
= md_undefined_symbol ((char *) name
);
421 symbolP
= symbol_new (name
, undefined_section
, (valueT
) 0, &zero_address_frag
);
424 } /* symbol_make() */
429 * Implement symbol table lookup.
430 * In: A symbol's name as a string: '\0' can't be part of a symbol name.
431 * Out: NULL if the name was not in the symbol table, else the address
432 * of a struct symbol associated with that name.
439 #ifdef STRIP_UNDERSCORE
440 return (symbol_find_base (name
, 1));
441 #else /* STRIP_UNDERSCORE */
442 return (symbol_find_base (name
, 0));
443 #endif /* STRIP_UNDERSCORE */
444 } /* symbol_find() */
447 symbol_find_base (name
, strip_underscore
)
449 int strip_underscore
;
451 if (strip_underscore
&& *name
== '_')
454 #ifdef tc_canonicalize_symbol_name
458 copy
= (char *) alloca (strlen (name
) + 1);
460 name
= tc_canonicalize_symbol_name (copy
);
464 if (! symbols_case_sensitive
)
468 copy
= (unsigned char *) alloca (strlen (name
) + 1);
469 name
= (const char *) copy
;
470 for (; *copy
!= '\0'; copy
++)
472 *copy
= toupper (*copy
);
475 return ((symbolS
*) hash_find (sy_hash
, name
));
479 * Once upon a time, symbols were kept in a singly linked list. At
480 * least coff needs to be able to rearrange them from time to time, for
481 * which a doubly linked list is much more convenient. Loic did these
482 * as macros which seemed dangerous to me so they're now functions.
486 /* Link symbol ADDME after symbol TARGET in the chain. */
488 symbol_append (addme
, target
, rootPP
, lastPP
)
496 know (*rootPP
== NULL
);
497 know (*lastPP
== NULL
);
498 addme
->sy_next
= NULL
;
499 #ifdef SYMBOLS_NEED_BACKPOINTERS
500 addme
->sy_previous
= NULL
;
505 } /* if the list is empty */
507 if (target
->sy_next
!= NULL
)
509 #ifdef SYMBOLS_NEED_BACKPOINTERS
510 target
->sy_next
->sy_previous
= addme
;
511 #endif /* SYMBOLS_NEED_BACKPOINTERS */
515 know (*lastPP
== target
);
517 } /* if we have a next */
519 addme
->sy_next
= target
->sy_next
;
520 target
->sy_next
= addme
;
522 #ifdef SYMBOLS_NEED_BACKPOINTERS
523 addme
->sy_previous
= target
;
524 #endif /* SYMBOLS_NEED_BACKPOINTERS */
526 debug_verify_symchain (symbol_rootP
, symbol_lastP
);
529 /* Set the chain pointers of SYMBOL to null. */
531 symbol_clear_list_pointers (symbolP
)
534 symbolP
->sy_next
= NULL
;
535 #ifdef SYMBOLS_NEED_BACKPOINTERS
536 symbolP
->sy_previous
= NULL
;
540 #ifdef SYMBOLS_NEED_BACKPOINTERS
541 /* Remove SYMBOLP from the list. */
543 symbol_remove (symbolP
, rootPP
, lastPP
)
548 if (symbolP
== *rootPP
)
550 *rootPP
= symbolP
->sy_next
;
551 } /* if it was the root */
553 if (symbolP
== *lastPP
)
555 *lastPP
= symbolP
->sy_previous
;
556 } /* if it was the tail */
558 if (symbolP
->sy_next
!= NULL
)
560 symbolP
->sy_next
->sy_previous
= symbolP
->sy_previous
;
563 if (symbolP
->sy_previous
!= NULL
)
565 symbolP
->sy_previous
->sy_next
= symbolP
->sy_next
;
568 debug_verify_symchain (*rootPP
, *lastPP
);
571 /* Link symbol ADDME before symbol TARGET in the chain. */
573 symbol_insert (addme
, target
, rootPP
, lastPP
)
579 if (target
->sy_previous
!= NULL
)
581 target
->sy_previous
->sy_next
= addme
;
585 know (*rootPP
== target
);
589 addme
->sy_previous
= target
->sy_previous
;
590 target
->sy_previous
= addme
;
591 addme
->sy_next
= target
;
593 debug_verify_symchain (*rootPP
, *lastPP
);
596 #endif /* SYMBOLS_NEED_BACKPOINTERS */
599 verify_symbol_chain (rootP
, lastP
)
603 symbolS
*symbolP
= rootP
;
608 for (; symbol_next (symbolP
) != NULL
; symbolP
= symbol_next (symbolP
))
610 #ifdef SYMBOLS_NEED_BACKPOINTERS
611 assert (symbolP
->sy_next
->sy_previous
== symbolP
);
613 /* Walk the list anyways, to make sure pointers are still good. */
615 #endif /* SYMBOLS_NEED_BACKPOINTERS */
618 assert (lastP
== symbolP
);
622 verify_symbol_chain_2 (sym
)
625 symbolS
*p
= sym
, *n
= sym
;
626 #ifdef SYMBOLS_NEED_BACKPOINTERS
627 while (symbol_previous (p
))
628 p
= symbol_previous (p
);
630 while (symbol_next (n
))
632 verify_symbol_chain (p
, n
);
635 /* Resolve the value of a symbol. This is called during the final
636 pass over the symbol table to resolve any symbols with complex
640 resolve_symbol_value (symp
, finalize
)
648 if (symp
->sy_resolved
)
650 if (symp
->sy_value
.X_op
== O_constant
)
651 return (valueT
) symp
->sy_value
.X_add_number
;
657 final_seg
= S_GET_SEGMENT (symp
);
659 if (symp
->sy_resolving
)
662 as_bad ("Symbol definition loop encountered at %s", S_GET_NAME (symp
));
668 symbolS
*add_symbol
, *op_symbol
;
670 segT seg_left
, seg_right
;
673 symp
->sy_resolving
= 1;
675 /* Help out with CSE. */
676 add_symbol
= symp
->sy_value
.X_add_symbol
;
677 op_symbol
= symp
->sy_value
.X_op_symbol
;
678 final_val
= symp
->sy_value
.X_add_number
;
679 op
= symp
->sy_value
.X_op
;
692 final_val
+= symp
->sy_frag
->fr_address
;
693 if (final_seg
== expr_section
)
694 final_seg
= absolute_section
;
700 left
= resolve_symbol_value (add_symbol
, finalize
);
703 if (symp
->sy_mri_common
)
705 /* This is a symbol inside an MRI common section. The
706 relocation routines are going to handle it specially.
707 Don't change the value. */
708 resolved
= add_symbol
->sy_resolved
;
712 if (finalize
&& final_val
== 0)
713 copy_symbol_attributes (symp
, add_symbol
);
715 /* If we have equated this symbol to an undefined symbol, we
716 keep X_op set to O_symbol, and we don't change
717 X_add_number. This permits the routine which writes out
718 relocation to detect this case, and convert the
719 relocation to be against the symbol to which this symbol
721 if (! S_IS_DEFINED (add_symbol
) || S_IS_COMMON (add_symbol
))
725 symp
->sy_value
.X_op
= O_symbol
;
726 S_SET_SEGMENT (symp
, S_GET_SEGMENT (add_symbol
));
728 symp
->sy_value
.X_add_number
= final_val
;
730 resolved
= add_symbol
->sy_resolved
;
731 goto exit_dont_set_value
;
735 final_val
+= symp
->sy_frag
->fr_address
+ left
;
736 if (final_seg
== expr_section
|| final_seg
== undefined_section
)
737 final_seg
= S_GET_SEGMENT (add_symbol
);
740 resolved
= add_symbol
->sy_resolved
;
746 left
= resolve_symbol_value (add_symbol
, finalize
);
750 else if (op
== O_logical_not
)
755 final_val
+= left
+ symp
->sy_frag
->fr_address
;
756 if (final_seg
== expr_section
|| final_seg
== undefined_section
)
757 final_seg
= absolute_section
;
759 resolved
= add_symbol
->sy_resolved
;
767 case O_bit_inclusive_or
:
769 case O_bit_exclusive_or
:
781 left
= resolve_symbol_value (add_symbol
, finalize
);
782 right
= resolve_symbol_value (op_symbol
, finalize
);
783 seg_left
= S_GET_SEGMENT (add_symbol
);
784 seg_right
= S_GET_SEGMENT (op_symbol
);
786 /* Simplify addition or subtraction of a constant by folding the
787 constant into X_add_number. */
788 if (op
== O_add
|| op
== O_subtract
)
790 if (seg_right
== absolute_section
)
800 else if (seg_left
== absolute_section
&& op
== O_add
)
804 add_symbol
= op_symbol
;
811 /* Subtraction is permitted if both operands are in the same
812 section. Otherwise, both operands must be absolute. We
813 already handled the case of addition or subtraction of a
814 constant above. This will probably need to be changed
815 for an object file format which supports arbitrary
816 expressions, such as IEEE-695. */
817 /* Don't emit messages unless we're finalizing the symbol value,
818 otherwise we may get the same message multiple times. */
819 if ((seg_left
!= absolute_section
|| seg_right
!= absolute_section
)
820 && (op
!= O_subtract
|| seg_left
!= seg_right
)
826 if (expr_symbol_where (symp
, &file
, &line
))
828 if (seg_left
== undefined_section
)
829 as_bad_where (file
, line
,
830 "undefined symbol %s in operation",
831 S_GET_NAME (symp
->sy_value
.X_add_symbol
));
832 if (seg_right
== undefined_section
)
833 as_bad_where (file
, line
,
834 "undefined symbol %s in operation",
835 S_GET_NAME (symp
->sy_value
.X_op_symbol
));
836 if (seg_left
!= undefined_section
837 && seg_right
!= undefined_section
)
838 as_bad_where (file
, line
, "invalid section for operation");
842 if (seg_left
== undefined_section
)
843 as_bad ("undefined symbol %s in operation setting %s",
844 S_GET_NAME (symp
->sy_value
.X_add_symbol
),
846 if (seg_right
== undefined_section
)
847 as_bad ("undefined symbol %s in operation setting %s",
848 S_GET_NAME (symp
->sy_value
.X_op_symbol
),
850 if (seg_left
!= undefined_section
851 && seg_right
!= undefined_section
)
852 as_bad ("invalid section for operation setting %s",
857 /* Check for division by zero. */
858 if ((op
== O_divide
|| op
== O_modulus
) && right
== 0)
860 /* If seg_right is not absolute_section, then we've
861 already issued a warning about using a bad symbol. */
862 if (seg_right
== absolute_section
&& finalize
)
867 if (expr_symbol_where (symp
, &file
, &line
))
868 as_bad_where (file
, line
, "division by zero");
870 as_bad ("division by zero when setting %s",
877 switch (symp
->sy_value
.X_op
)
879 case O_multiply
: left
*= right
; break;
880 case O_divide
: left
/= right
; break;
881 case O_modulus
: left
%= right
; break;
882 case O_left_shift
: left
<<= right
; break;
883 case O_right_shift
: left
>>= right
; break;
884 case O_bit_inclusive_or
: left
|= right
; break;
885 case O_bit_or_not
: left
|= ~right
; break;
886 case O_bit_exclusive_or
: left
^= right
; break;
887 case O_bit_and
: left
&= right
; break;
888 case O_add
: left
+= right
; break;
889 case O_subtract
: left
-= right
; break;
890 case O_eq
: left
= left
== right
? ~ (offsetT
) 0 : 0;
891 case O_ne
: left
= left
!= right
? ~ (offsetT
) 0 : 0;
892 case O_lt
: left
= left
< right
? ~ (offsetT
) 0 : 0;
893 case O_le
: left
= left
<= right
? ~ (offsetT
) 0 : 0;
894 case O_ge
: left
= left
>= right
? ~ (offsetT
) 0 : 0;
895 case O_gt
: left
= left
> right
? ~ (offsetT
) 0 : 0;
896 case O_logical_and
: left
= left
&& right
; break;
897 case O_logical_or
: left
= left
|| right
; break;
901 final_val
+= symp
->sy_frag
->fr_address
+ left
;
902 if (final_seg
== expr_section
|| final_seg
== undefined_section
)
903 final_seg
= absolute_section
;
904 resolved
= (add_symbol
->sy_resolved
&& op_symbol
->sy_resolved
);
910 /* Give an error (below) if not in expr_section. We don't
911 want to worry about expr_section symbols, because they
912 are fictional (they are created as part of expression
913 resolution), and any problems may not actually mean
918 symp
->sy_resolving
= 0;
923 S_SET_VALUE (symp
, final_val
);
924 S_SET_SEGMENT (symp
, final_seg
);
928 /* Don't worry if we can't resolve an expr_section symbol. */
932 symp
->sy_resolved
= 1;
933 else if (S_GET_SEGMENT (symp
) != expr_section
)
935 as_bad ("can't resolve value for symbol \"%s\"", S_GET_NAME (symp
));
936 symp
->sy_resolved
= 1;
943 /* Dollar labels look like a number followed by a dollar sign. Eg, "42$".
944 They are *really* local. That is, they go out of scope whenever we see a
945 label that isn't local. Also, like fb labels, there can be multiple
946 instances of a dollar label. Therefor, we name encode each instance with
947 the instance number, keep a list of defined symbols separate from the real
948 symbol table, and we treat these buggers as a sparse array. */
950 static long *dollar_labels
;
951 static long *dollar_label_instances
;
952 static char *dollar_label_defines
;
953 static long dollar_label_count
;
954 static unsigned long dollar_label_max
;
957 dollar_label_defined (label
)
962 know ((dollar_labels
!= NULL
) || (dollar_label_count
== 0));
964 for (i
= dollar_labels
; i
< dollar_labels
+ dollar_label_count
; ++i
)
966 return dollar_label_defines
[i
- dollar_labels
];
968 /* if we get here, label isn't defined */
970 } /* dollar_label_defined() */
973 dollar_label_instance (label
)
978 know ((dollar_labels
!= NULL
) || (dollar_label_count
== 0));
980 for (i
= dollar_labels
; i
< dollar_labels
+ dollar_label_count
; ++i
)
982 return (dollar_label_instances
[i
- dollar_labels
]);
984 /* If we get here, we haven't seen the label before, therefore its instance
990 dollar_label_clear ()
992 memset (dollar_label_defines
, '\0', (unsigned int) dollar_label_count
);
995 #define DOLLAR_LABEL_BUMP_BY 10
998 define_dollar_label (label
)
1003 for (i
= dollar_labels
; i
< dollar_labels
+ dollar_label_count
; ++i
)
1006 ++dollar_label_instances
[i
- dollar_labels
];
1007 dollar_label_defines
[i
- dollar_labels
] = 1;
1011 /* if we get to here, we don't have label listed yet. */
1013 if (dollar_labels
== NULL
)
1015 dollar_labels
= (long *) xmalloc (DOLLAR_LABEL_BUMP_BY
* sizeof (long));
1016 dollar_label_instances
= (long *) xmalloc (DOLLAR_LABEL_BUMP_BY
* sizeof (long));
1017 dollar_label_defines
= xmalloc (DOLLAR_LABEL_BUMP_BY
);
1018 dollar_label_max
= DOLLAR_LABEL_BUMP_BY
;
1019 dollar_label_count
= 0;
1021 else if (dollar_label_count
== dollar_label_max
)
1023 dollar_label_max
+= DOLLAR_LABEL_BUMP_BY
;
1024 dollar_labels
= (long *) xrealloc ((char *) dollar_labels
,
1025 dollar_label_max
* sizeof (long));
1026 dollar_label_instances
= (long *) xrealloc ((char *) dollar_label_instances
,
1027 dollar_label_max
* sizeof (long));
1028 dollar_label_defines
= xrealloc (dollar_label_defines
, dollar_label_max
);
1029 } /* if we needed to grow */
1031 dollar_labels
[dollar_label_count
] = label
;
1032 dollar_label_instances
[dollar_label_count
] = 1;
1033 dollar_label_defines
[dollar_label_count
] = 1;
1034 ++dollar_label_count
;
1038 * dollar_label_name()
1040 * Caller must copy returned name: we re-use the area for the next name.
1042 * The mth occurence of label n: is turned into the symbol "Ln^Am"
1043 * where n is the label number and m is the instance number. "L" makes
1044 * it a label discarded unless debugging and "^A"('\1') ensures no
1045 * ordinary symbol SHOULD get the same name as a local label
1046 * symbol. The first "4:" is "L4^A1" - the m numbers begin at 1.
1048 * fb labels get the same treatment, except that ^B is used in place of ^A.
1051 char * /* Return local label name. */
1052 dollar_label_name (n
, augend
)
1053 register long n
; /* we just saw "n$:" : n a number */
1054 register int augend
; /* 0 for current instance, 1 for new instance */
1057 /* Returned to caller, then copied. used for created names ("4f") */
1058 static char symbol_name_build
[24];
1061 char symbol_name_temporary
[20]; /* build up a number, BACKWARDS */
1064 know (augend
== 0 || augend
== 1);
1065 p
= symbol_name_build
;
1068 /* Next code just does sprintf( {}, "%d", n); */
1070 q
= symbol_name_temporary
;
1071 for (*q
++ = 0, i
= n
; i
; ++q
)
1076 while ((*p
= *--q
) != '\0')
1081 /* instance number */
1082 q
= symbol_name_temporary
;
1083 for (*q
++ = 0, i
= dollar_label_instance (n
) + augend
; i
; ++q
)
1088 while ((*p
++ = *--q
) != '\0');;
1090 /* The label, as a '\0' ended string, starts at symbol_name_build. */
1091 return symbol_name_build
;
1095 * Sombody else's idea of local labels. They are made by "n:" where n
1096 * is any decimal digit. Refer to them with
1097 * "nb" for previous (backward) n:
1098 * or "nf" for next (forward) n:.
1100 * We do a little better and let n be any number, not just a single digit, but
1101 * since the other guy's assembler only does ten, we treat the first ten
1104 * Like someone else's assembler, we have one set of local label counters for
1105 * entire assembly, not one set per (sub)segment like in most assemblers. This
1106 * implies that one can refer to a label in another segment, and indeed some
1107 * crufty compilers have done just that.
1109 * Since there could be a LOT of these things, treat them as a sparse array.
1112 #define FB_LABEL_SPECIAL (10)
1114 static long fb_low_counter
[FB_LABEL_SPECIAL
];
1115 static long *fb_labels
;
1116 static long *fb_label_instances
;
1117 static long fb_label_count
;
1118 static long fb_label_max
;
1120 /* this must be more than FB_LABEL_SPECIAL */
1121 #define FB_LABEL_BUMP_BY (FB_LABEL_SPECIAL + 6)
1126 memset ((void *) fb_low_counter
, '\0', sizeof (fb_low_counter
));
1127 } /* fb_label_init() */
1129 /* add one to the instance number of this fb label */
1131 fb_label_instance_inc (label
)
1136 if (label
< FB_LABEL_SPECIAL
)
1138 ++fb_low_counter
[label
];
1142 if (fb_labels
!= NULL
)
1144 for (i
= fb_labels
+ FB_LABEL_SPECIAL
;
1145 i
< fb_labels
+ fb_label_count
; ++i
)
1149 ++fb_label_instances
[i
- fb_labels
];
1151 } /* if we find it */
1152 } /* for each existing label */
1155 /* if we get to here, we don't have label listed yet. */
1157 if (fb_labels
== NULL
)
1159 fb_labels
= (long *) xmalloc (FB_LABEL_BUMP_BY
* sizeof (long));
1160 fb_label_instances
= (long *) xmalloc (FB_LABEL_BUMP_BY
* sizeof (long));
1161 fb_label_max
= FB_LABEL_BUMP_BY
;
1162 fb_label_count
= FB_LABEL_SPECIAL
;
1165 else if (fb_label_count
== fb_label_max
)
1167 fb_label_max
+= FB_LABEL_BUMP_BY
;
1168 fb_labels
= (long *) xrealloc ((char *) fb_labels
,
1169 fb_label_max
* sizeof (long));
1170 fb_label_instances
= (long *) xrealloc ((char *) fb_label_instances
,
1171 fb_label_max
* sizeof (long));
1172 } /* if we needed to grow */
1174 fb_labels
[fb_label_count
] = label
;
1175 fb_label_instances
[fb_label_count
] = 1;
1180 fb_label_instance (label
)
1185 if (label
< FB_LABEL_SPECIAL
)
1187 return (fb_low_counter
[label
]);
1190 if (fb_labels
!= NULL
)
1192 for (i
= fb_labels
+ FB_LABEL_SPECIAL
;
1193 i
< fb_labels
+ fb_label_count
; ++i
)
1197 return (fb_label_instances
[i
- fb_labels
]);
1198 } /* if we find it */
1199 } /* for each existing label */
1202 /* We didn't find the label, so this must be a reference to the
1210 * Caller must copy returned name: we re-use the area for the next name.
1212 * The mth occurence of label n: is turned into the symbol "Ln^Bm"
1213 * where n is the label number and m is the instance number. "L" makes
1214 * it a label discarded unless debugging and "^B"('\2') ensures no
1215 * ordinary symbol SHOULD get the same name as a local label
1216 * symbol. The first "4:" is "L4^B1" - the m numbers begin at 1.
1218 * dollar labels get the same treatment, except that ^A is used in place of ^B. */
1220 char * /* Return local label name. */
1221 fb_label_name (n
, augend
)
1222 long n
; /* we just saw "n:", "nf" or "nb" : n a number */
1223 long augend
; /* 0 for nb, 1 for n:, nf */
1226 /* Returned to caller, then copied. used for created names ("4f") */
1227 static char symbol_name_build
[24];
1230 char symbol_name_temporary
[20]; /* build up a number, BACKWARDS */
1233 know (augend
== 0 || augend
== 1);
1234 p
= symbol_name_build
;
1237 /* Next code just does sprintf( {}, "%d", n); */
1239 q
= symbol_name_temporary
;
1240 for (*q
++ = 0, i
= n
; i
; ++q
)
1245 while ((*p
= *--q
) != '\0')
1250 /* instance number */
1251 q
= symbol_name_temporary
;
1252 for (*q
++ = 0, i
= fb_label_instance (n
) + augend
; i
; ++q
)
1257 while ((*p
++ = *--q
) != '\0');;
1259 /* The label, as a '\0' ended string, starts at symbol_name_build. */
1260 return (symbol_name_build
);
1261 } /* fb_label_name() */
1264 * decode name that may have been generated by foo_label_name() above. If
1265 * the name wasn't generated by foo_label_name(), then return it unaltered.
1266 * This is used for error messages.
1270 decode_local_label_name (s
)
1274 char *symbol_decode
;
1276 int instance_number
;
1278 const char *message_format
= "\"%d\" (instance number %d of a %s label)";
1283 for (label_number
= 0, p
= s
+ 1; isdigit (*p
); ++p
)
1284 label_number
= (10 * label_number
) + *p
- '0';
1293 for (instance_number
= 0, p
++; isdigit (*p
); ++p
)
1294 instance_number
= (10 * instance_number
) + *p
- '0';
1296 symbol_decode
= obstack_alloc (¬es
, strlen (message_format
) + 30);
1297 sprintf (symbol_decode
, message_format
, label_number
, instance_number
, type
);
1299 return symbol_decode
;
1302 /* Get the value of a symbol. */
1308 if (!s
->sy_resolved
&& s
->sy_value
.X_op
!= O_constant
)
1309 resolve_symbol_value (s
, 1);
1310 if (s
->sy_value
.X_op
!= O_constant
)
1312 static symbolS
*recur
;
1314 /* FIXME: In non BFD assemblers, S_IS_DEFINED and S_IS_COMMON
1315 may call S_GET_VALUE. We use a static symbol to avoid the
1316 immediate recursion. */
1318 return (valueT
) s
->sy_value
.X_add_number
;
1320 if (! s
->sy_resolved
1321 || s
->sy_value
.X_op
!= O_symbol
1322 || (S_IS_DEFINED (s
) && ! S_IS_COMMON (s
)))
1323 as_bad ("Attempt to get value of unresolved symbol %s",
1327 return (valueT
) s
->sy_value
.X_add_number
;
1330 /* Set the value of a symbol. */
1333 S_SET_VALUE (s
, val
)
1337 s
->sy_value
.X_op
= O_constant
;
1338 s
->sy_value
.X_add_number
= (offsetT
) val
;
1339 s
->sy_value
.X_unsigned
= 0;
1343 copy_symbol_attributes (dest
, src
)
1344 symbolS
*dest
, *src
;
1346 #ifdef BFD_ASSEMBLER
1347 /* In an expression, transfer the settings of these flags.
1348 The user can override later, of course. */
1349 #define COPIED_SYMFLAGS (BSF_FUNCTION | BSF_OBJECT)
1350 dest
->bsym
->flags
|= src
->bsym
->flags
& COPIED_SYMFLAGS
;
1353 #ifdef OBJ_COPY_SYMBOL_ATTRIBUTES
1354 OBJ_COPY_SYMBOL_ATTRIBUTES (dest
, src
);
1358 #ifdef BFD_ASSEMBLER
1364 flagword flags
= s
->bsym
->flags
;
1367 if (flags
& BSF_LOCAL
&& flags
& BSF_GLOBAL
)
1370 return (flags
& BSF_GLOBAL
) != 0;
1377 return (s
->bsym
->flags
& BSF_WEAK
) != 0;
1384 return bfd_is_com_section (s
->bsym
->section
);
1391 return s
->bsym
->section
!= undefined_section
;
1398 if (s
->bsym
->flags
& BSF_DEBUGGING
)
1407 flagword flags
= s
->bsym
->flags
;
1411 if (flags
& BSF_LOCAL
&& flags
& BSF_GLOBAL
)
1414 if (bfd_get_section (s
->bsym
) == reg_section
)
1417 name
= S_GET_NAME (s
);
1418 return (name
!= NULL
1420 && (strchr (name
, '\001')
1421 || strchr (name
, '\002')
1422 || (! flag_keep_locals
1423 && (bfd_is_local_label (stdoutput
, s
->bsym
)
1426 && name
[1] == '?')))));
1433 return S_IS_EXTERNAL (s
);
1440 return S_GET_NAME (s
) == 0;
1447 return s
->bsym
->name
;
1454 return s
->bsym
->section
;
1458 S_SET_SEGMENT (s
, seg
)
1462 s
->bsym
->section
= seg
;
1469 if ((s
->bsym
->flags
& BSF_WEAK
) != 0)
1471 /* Let .weak override .global. */
1474 s
->bsym
->flags
|= BSF_GLOBAL
;
1475 s
->bsym
->flags
&= ~(BSF_LOCAL
|BSF_WEAK
);
1479 S_CLEAR_EXTERNAL (s
)
1482 if ((s
->bsym
->flags
& BSF_WEAK
) != 0)
1484 /* Let .weak override. */
1487 s
->bsym
->flags
|= BSF_LOCAL
;
1488 s
->bsym
->flags
&= ~(BSF_GLOBAL
|BSF_WEAK
);
1495 s
->bsym
->flags
|= BSF_WEAK
;
1496 s
->bsym
->flags
&= ~(BSF_GLOBAL
|BSF_LOCAL
);
1500 S_SET_NAME (s
, name
)
1504 s
->bsym
->name
= name
;
1506 #endif /* BFD_ASSEMBLER */
1511 symbol_lastP
= NULL
;
1512 symbol_rootP
= NULL
; /* In case we have 0 symbols (!!) */
1513 sy_hash
= hash_new ();
1515 memset ((char *) (&abs_symbol
), '\0', sizeof (abs_symbol
));
1516 #ifdef BFD_ASSEMBLER
1517 #if defined (EMIT_SECTION_SYMBOLS) || !defined (RELOC_REQUIRES_SYMBOL)
1518 abs_symbol
.bsym
= bfd_abs_section
.symbol
;
1521 /* Can't initialise a union. Sigh. */
1522 S_SET_SEGMENT (&abs_symbol
, absolute_section
);
1524 abs_symbol
.sy_value
.X_op
= O_constant
;
1525 abs_symbol
.sy_frag
= &zero_address_frag
;
1527 if (LOCAL_LABELS_FB
)
1539 printf ("%*s", indent_level
* 4, "");
1545 print_symbol_value_1 (file
, sym
)
1549 const char *name
= S_GET_NAME (sym
);
1550 if (!name
|| !name
[0])
1552 fprintf (file
, "sym %lx %s", (unsigned long) sym
, name
);
1553 if (sym
->sy_frag
!= &zero_address_frag
)
1554 fprintf (file
, " frag %lx", (long) sym
->sy_frag
);
1556 fprintf (file
, " written");
1557 if (sym
->sy_resolved
)
1558 fprintf (file
, " resolved");
1559 else if (sym
->sy_resolving
)
1560 fprintf (file
, " resolving");
1561 if (sym
->sy_used_in_reloc
)
1562 fprintf (file
, " used-in-reloc");
1564 fprintf (file
, " used");
1565 if (S_IS_LOCAL (sym
))
1566 fprintf (file
, " local");
1567 if (S_IS_EXTERN (sym
))
1568 fprintf (file
, " extern");
1569 if (S_IS_DEBUG (sym
))
1570 fprintf (file
, " debug");
1571 if (S_IS_DEFINED (sym
))
1572 fprintf (file
, " defined");
1573 fprintf (file
, " %s", segment_name (S_GET_SEGMENT (sym
)));
1574 if (sym
->sy_resolved
)
1576 segT s
= S_GET_SEGMENT (sym
);
1578 if (s
!= undefined_section
1579 && s
!= expr_section
)
1580 fprintf (file
, " %lx", (long) S_GET_VALUE (sym
));
1582 else if (indent_level
< 8 && S_GET_SEGMENT (sym
) != undefined_section
)
1585 fprintf (file
, "\n%*s<", indent_level
* 4, "");
1586 print_expr_1 (file
, &sym
->sy_value
);
1587 fprintf (file
, ">");
1594 print_symbol_value (sym
)
1598 print_symbol_value_1 (stderr
, sym
);
1599 fprintf (stderr
, "\n");
1603 print_expr_1 (file
, exp
)
1607 fprintf (file
, "expr %lx ", (long) exp
);
1611 fprintf (file
, "illegal");
1614 fprintf (file
, "absent");
1617 fprintf (file
, "constant %lx", (long) exp
->X_add_number
);
1621 fprintf (file
, "symbol\n%*s<", indent_level
* 4, "");
1622 print_symbol_value_1 (file
, exp
->X_add_symbol
);
1623 fprintf (file
, ">");
1625 if (exp
->X_add_number
)
1626 fprintf (file
, "\n%*s%lx", indent_level
* 4, "",
1627 (long) exp
->X_add_number
);
1631 fprintf (file
, "register #%d", (int) exp
->X_add_number
);
1634 fprintf (file
, "big");
1637 fprintf (file
, "uminus -<");
1639 print_symbol_value_1 (file
, exp
->X_add_symbol
);
1640 fprintf (file
, ">");
1641 goto maybe_print_addnum
;
1643 fprintf (file
, "bit_not");
1646 fprintf (file
, "multiply");
1649 fprintf (file
, "divide");
1652 fprintf (file
, "modulus");
1655 fprintf (file
, "lshift");
1658 fprintf (file
, "rshift");
1660 case O_bit_inclusive_or
:
1661 fprintf (file
, "bit_ior");
1663 case O_bit_exclusive_or
:
1664 fprintf (file
, "bit_xor");
1667 fprintf (file
, "bit_and");
1670 fprintf (file
, "eq");
1673 fprintf (file
, "ne");
1676 fprintf (file
, "lt");
1679 fprintf (file
, "le");
1682 fprintf (file
, "ge");
1685 fprintf (file
, "gt");
1688 fprintf (file
, "logical_and");
1691 fprintf (file
, "logical_or");
1695 fprintf (file
, "add\n%*s<", indent_level
* 4, "");
1696 print_symbol_value_1 (file
, exp
->X_add_symbol
);
1697 fprintf (file
, ">\n%*s<", indent_level
* 4, "");
1698 print_symbol_value_1 (file
, exp
->X_op_symbol
);
1699 fprintf (file
, ">");
1700 goto maybe_print_addnum
;
1703 fprintf (file
, "subtract\n%*s<", indent_level
* 4, "");
1704 print_symbol_value_1 (file
, exp
->X_add_symbol
);
1705 fprintf (file
, ">\n%*s<", indent_level
* 4, "");
1706 print_symbol_value_1 (file
, exp
->X_op_symbol
);
1707 fprintf (file
, ">");
1708 goto maybe_print_addnum
;
1710 fprintf (file
, "{unknown opcode %d}", (int) exp
->X_op
);
1720 print_expr_1 (stderr
, exp
);
1721 fprintf (stderr
, "\n");
1725 symbol_print_statistics (file
)
1728 hash_print_statistics (file
, "symbol table", sy_hash
);
1731 /* end of symbols.c */
This page took 0.0636 seconds and 4 git commands to generate.