rebuild
[deliverable/binutils-gdb.git] / gas / symbols.c
CommitLineData
252b5132 1/* symbols.c -symbol table-
49309057 2 Copyright (C) 1987, 90, 91, 92, 93, 94, 95, 96, 97, 98, 1999
252b5132
RH
3 Free Software Foundation, Inc.
4
5 This file is part of GAS, the GNU Assembler.
6
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)
10 any later version.
11
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.
16
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
20 02111-1307, USA. */
21
22/* #define DEBUG_SYMS / * to debug symbol list maintenance */
23
24#include <ctype.h>
25
26#include "as.h"
27
28#include "obstack.h" /* For "symbols.h" */
29#include "subsegs.h"
30
49309057
ILT
31#include "struc-symbol.h"
32
252b5132
RH
33/* This is non-zero if symbols are case sensitive, which is the
34 default. */
35int symbols_case_sensitive = 1;
36
37#ifndef WORKING_DOT_WORD
38extern int new_broken_words;
39#endif
40
41/* symbol-name => struct symbol pointer */
42static struct hash_control *sy_hash;
43
49309057
ILT
44/* Table of local symbols. */
45static struct hash_control *local_hash;
46
252b5132
RH
47/* Below are commented in "symbols.h". */
48symbolS *symbol_rootP;
49symbolS *symbol_lastP;
50symbolS abs_symbol;
51
52#ifdef DEBUG_SYMS
53#define debug_verify_symchain verify_symbol_chain
54#else
55#define debug_verify_symchain(root, last) ((void) 0)
56#endif
57
58struct obstack notes;
59
60static void fb_label_init PARAMS ((void));
61static long dollar_label_instance PARAMS ((long));
62static long fb_label_instance PARAMS ((long));
63
64static void print_binary PARAMS ((FILE *, const char *, expressionS *));
65
66/* symbol_new()
67
68 Return a pointer to a new symbol. Die if we can't make a new
69 symbol. Fill in the symbol's values. Add symbol to end of symbol
70 chain.
71
72 This function should be called in the general case of creating a
73 symbol. However, if the output file symbol table has already been
74 set, and you are certain that this symbol won't be wanted in the
75 output file, you can call symbol_create. */
76
77symbolS *
78symbol_new (name, segment, valu, frag)
79 const char *name;
80 segT segment;
81 valueT valu;
82 fragS *frag;
83{
84 symbolS *symbolP = symbol_create (name, segment, valu, frag);
85
86 /*
87 * Link to end of symbol chain.
88 */
89#ifdef BFD_ASSEMBLER
90 {
91 extern int symbol_table_frozen;
92 if (symbol_table_frozen)
93 abort ();
94 }
95#endif
96 symbol_append (symbolP, symbol_lastP, &symbol_rootP, &symbol_lastP);
97
98 return symbolP;
99}
100
49309057
ILT
101/* Save a symbol name on a permanent obstack, and convert it according
102 to the object file format. */
103
104static char *
105save_symbol_name (name)
106 const char *name;
252b5132
RH
107{
108 unsigned int name_length;
49309057 109 char *ret;
252b5132
RH
110
111 name_length = strlen (name) + 1; /* +1 for \0 */
112 obstack_grow (&notes, name, name_length);
49309057
ILT
113 ret = obstack_finish (&notes);
114
252b5132 115#ifdef STRIP_UNDERSCORE
49309057
ILT
116 if (ret[0] == '_')
117 ++ret;
252b5132
RH
118#endif
119
120#ifdef tc_canonicalize_symbol_name
49309057 121 ret = tc_canonicalize_symbol_name (ret);
252b5132
RH
122#endif
123
124 if (! symbols_case_sensitive)
125 {
126 unsigned char *s;
127
49309057 128 for (s = (unsigned char *) ret; *s != '\0'; s++)
252b5132
RH
129 if (islower (*s))
130 *s = toupper (*s);
131 }
132
49309057
ILT
133 return ret;
134}
135
136symbolS *
137symbol_create (name, segment, valu, frag)
138 const char *name; /* It is copied, the caller can destroy/modify */
139 segT segment; /* Segment identifier (SEG_<something>) */
140 valueT valu; /* Symbol value */
141 fragS *frag; /* Associated fragment */
142{
143 char *preserved_copy_of_name;
144 symbolS *symbolP;
145
146 preserved_copy_of_name = save_symbol_name (name);
147
252b5132
RH
148 symbolP = (symbolS *) obstack_alloc (&notes, sizeof (symbolS));
149
150 /* symbol must be born in some fixed state. This seems as good as any. */
151 memset (symbolP, 0, sizeof (symbolS));
152
153#ifdef BFD_ASSEMBLER
154 symbolP->bsym = bfd_make_empty_symbol (stdoutput);
155 if (symbolP->bsym == NULL)
156 as_perror ("%s", "bfd_make_empty_symbol");
157 symbolP->bsym->udata.p = (PTR) symbolP;
158#endif
159 S_SET_NAME (symbolP, preserved_copy_of_name);
160
161 S_SET_SEGMENT (symbolP, segment);
162 S_SET_VALUE (symbolP, valu);
163 symbol_clear_list_pointers (symbolP);
164
165 symbolP->sy_frag = frag;
166#ifndef BFD_ASSEMBLER
167 symbolP->sy_number = ~0;
168 symbolP->sy_name_offset = (unsigned int) ~0;
169#endif
170
171 obj_symbol_new_hook (symbolP);
172
173#ifdef tc_symbol_new_hook
174 tc_symbol_new_hook (symbolP);
175#endif
176
177 return symbolP;
178}
179\f
49309057
ILT
180#ifdef BFD_ASSEMBLER
181
182/* Local symbol support. If we can get away with it, we keep only a
183 small amount of information for local symbols. */
184
185static struct local_symbol *local_symbol_make PARAMS ((const char *, segT,
186 valueT, fragS *));
187static symbolS *local_symbol_convert PARAMS ((struct local_symbol *));
188
189/* Used for statistics. */
190
191static unsigned long local_symbol_count;
192static unsigned long local_symbol_conversion_count;
193
194/* This macro is called with a symbol argument passed by reference.
195 It returns whether this is a local symbol. If necessary, it
196 changes its argument to the real symbol. */
197
198#define LOCAL_SYMBOL_CHECK(s) \
199 (s->bsym == NULL \
200 ? (local_symbol_converted_p ((struct local_symbol *) s) \
201 ? (s = local_symbol_get_real_symbol ((struct local_symbol *) s), \
202 0) \
203 : 1) \
204 : 0)
205
206/* Create a local symbol and insert it into the local hash table. */
207
208static struct local_symbol *
209local_symbol_make (name, section, offset, frag)
210 const char *name;
211 segT section;
212 valueT offset;
213 fragS *frag;
214{
215 char *name_copy;
216 struct local_symbol *ret;
217
218 ++local_symbol_count;
219
220 name_copy = save_symbol_name (name);
221
222 ret = (struct local_symbol *) obstack_alloc (&notes, sizeof *ret);
223 ret->lsy_marker = NULL;
224 ret->lsy_name = name_copy;
225 ret->lsy_section = section;
226 local_symbol_set_frag (ret, frag);
227 ret->lsy_offset = offset;
228
229 hash_jam (local_hash, name_copy, (PTR) ret);
230
231 return ret;
232}
233
234/* Convert a local symbol into a real symbol. Note that we do not
235 reclaim the space used by the local symbol. */
236
237static symbolS *
238local_symbol_convert (locsym)
239 struct local_symbol *locsym;
240{
241 symbolS *ret;
242
243 assert (locsym->lsy_marker == NULL);
244 if (local_symbol_converted_p (locsym))
245 return local_symbol_get_real_symbol (locsym);
246
247 ++local_symbol_conversion_count;
248
249 ret = symbol_new (locsym->lsy_name, locsym->lsy_section, locsym->lsy_offset,
250 local_symbol_get_frag (locsym));
251
252 if (local_symbol_resolved_p (locsym))
253 ret->sy_resolved = 1;
254
255 /* Local symbols are always either defined or used. */
256 ret->sy_used = 1;
257
258 symbol_table_insert (ret);
259
260 local_symbol_mark_converted (locsym);
261 local_symbol_set_real_symbol (locsym, ret);
262
263 hash_jam (local_hash, locsym->lsy_name, NULL);
264
265 return ret;
266}
267
268#else /* ! BFD_ASSEMBLER */
269
270#define LOCAL_SYMBOL_CHECK(s) 0
271#define local_symbol_convert(s) ((symbolS *) s)
272
273#endif /* ! BFD_ASSEMBLER */
274\f
252b5132
RH
275
276/*
277 * colon()
278 *
279 * We have just seen "<name>:".
280 * Creates a struct symbol unless it already exists.
281 *
282 * Gripes if we are redefining a symbol incompatibly (and ignores it).
283 *
284 */
285symbolS *
286colon (sym_name) /* just seen "x:" - rattle symbols & frags */
287 const char *sym_name; /* symbol name, as a cannonical string */
288 /* We copy this string: OK to alter later. */
289{
290 register symbolS *symbolP; /* symbol we are working with */
291
292 /* Sun local labels go out of scope whenever a non-local symbol is
293 defined. */
294 if (LOCAL_LABELS_DOLLAR)
295 {
296 int local;
297
298#ifdef BFD_ASSEMBLER
299 local = bfd_is_local_label_name (stdoutput, sym_name);
300#else
301 local = LOCAL_LABEL (sym_name);
302#endif
303
304 if (! local)
305 dollar_label_clear ();
306 }
307
308#ifndef WORKING_DOT_WORD
309 if (new_broken_words)
310 {
311 struct broken_word *a;
312 int possible_bytes;
313 fragS *frag_tmp;
314 char *frag_opcode;
315
316 extern const int md_short_jump_size;
317 extern const int md_long_jump_size;
318 possible_bytes = (md_short_jump_size
319 + new_broken_words * md_long_jump_size);
320
321 frag_tmp = frag_now;
322 frag_opcode = frag_var (rs_broken_word,
323 possible_bytes,
324 possible_bytes,
325 (relax_substateT) 0,
326 (symbolS *) broken_words,
327 (offsetT) 0,
328 NULL);
329
330 /* We want to store the pointer to where to insert the jump table in the
331 fr_opcode of the rs_broken_word frag. This requires a little
332 hackery. */
333 while (frag_tmp
334 && (frag_tmp->fr_type != rs_broken_word
335 || frag_tmp->fr_opcode))
336 frag_tmp = frag_tmp->fr_next;
337 know (frag_tmp);
338 frag_tmp->fr_opcode = frag_opcode;
339 new_broken_words = 0;
340
341 for (a = broken_words; a && a->dispfrag == 0; a = a->next_broken_word)
342 a->dispfrag = frag_tmp;
343 }
344#endif /* WORKING_DOT_WORD */
345
346 if ((symbolP = symbol_find (sym_name)) != 0)
347 {
348#ifdef RESOLVE_SYMBOL_REDEFINITION
349 if (RESOLVE_SYMBOL_REDEFINITION (symbolP))
350 return symbolP;
351#endif
352 /*
353 * Now check for undefined symbols
354 */
49309057
ILT
355 if (LOCAL_SYMBOL_CHECK (symbolP))
356 {
a1605869 357#ifdef BFD_ASSEMBLER
49309057
ILT
358 struct local_symbol *locsym = (struct local_symbol *) symbolP;
359
360 if (locsym->lsy_section != undefined_section
361 && (local_symbol_get_frag (locsym) != frag_now
362 || locsym->lsy_section != now_seg
363 || locsym->lsy_offset != frag_now_fix ()))
364 {
365 as_bad (_("Symbol %s already defined."), sym_name);
366 return symbolP;
367 }
368
369 locsym->lsy_section = now_seg;
370 local_symbol_set_frag (locsym, frag_now);
371 locsym->lsy_offset = frag_now_fix ();
a1605869 372#endif
49309057
ILT
373 }
374 else if (!S_IS_DEFINED (symbolP) || S_IS_COMMON (symbolP))
252b5132
RH
375 {
376 if (S_GET_VALUE (symbolP) == 0)
377 {
378 symbolP->sy_frag = frag_now;
379#ifdef OBJ_VMS
380 S_SET_OTHER(symbolP, const_flag);
381#endif
382 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
383 S_SET_SEGMENT (symbolP, now_seg);
384#ifdef N_UNDF
385 know (N_UNDF == 0);
386#endif /* if we have one, it better be zero. */
387
388 }
389 else
390 {
391 /*
392 * There are still several cases to check:
393 * A .comm/.lcomm symbol being redefined as
394 * initialized data is OK
395 * A .comm/.lcomm symbol being redefined with
396 * a larger size is also OK
397 *
398 * This only used to be allowed on VMS gas, but Sun cc
399 * on the sparc also depends on it.
400 */
401
402 if (((!S_IS_DEBUG (symbolP)
403 && (!S_IS_DEFINED (symbolP) || S_IS_COMMON (symbolP))
404 && S_IS_EXTERNAL (symbolP))
405 || S_GET_SEGMENT (symbolP) == bss_section)
406 && (now_seg == data_section
407 || now_seg == S_GET_SEGMENT (symbolP)))
408 {
409 /*
410 * Select which of the 2 cases this is
411 */
412 if (now_seg != data_section)
413 {
414 /*
415 * New .comm for prev .comm symbol.
416 * If the new size is larger we just
417 * change its value. If the new size
418 * is smaller, we ignore this symbol
419 */
420 if (S_GET_VALUE (symbolP)
421 < ((unsigned) frag_now_fix ()))
422 {
423 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
424 }
425 }
426 else
427 {
428 /* It is a .comm/.lcomm being converted to initialized
429 data. */
430 symbolP->sy_frag = frag_now;
431#ifdef OBJ_VMS
432 S_SET_OTHER(symbolP, const_flag);
433#endif
434 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
435 S_SET_SEGMENT (symbolP, now_seg); /* keep N_EXT bit */
436 }
437 }
438 else
439 {
440#if defined (S_GET_OTHER) && defined (S_GET_DESC)
441 as_fatal (_("Symbol \"%s\" is already defined as \"%s\"/%d.%d.%ld."),
442 sym_name,
443 segment_name (S_GET_SEGMENT (symbolP)),
444 S_GET_OTHER (symbolP), S_GET_DESC (symbolP),
445 (long) S_GET_VALUE (symbolP));
446#else
447 as_fatal (_("Symbol \"%s\" is already defined as \"%s\"/%ld."),
448 sym_name,
449 segment_name (S_GET_SEGMENT (symbolP)),
450 (long) S_GET_VALUE (symbolP));
451#endif
452 }
453 } /* if the undefined symbol has no value */
454 }
455 else
456 {
457 /* Don't blow up if the definition is the same */
458 if (!(frag_now == symbolP->sy_frag
459 && S_GET_VALUE (symbolP) == frag_now_fix ()
460 && S_GET_SEGMENT (symbolP) == now_seg))
461 as_fatal (_("Symbol %s already defined."), sym_name);
462 } /* if this symbol is not yet defined */
463
464 }
49309057
ILT
465#ifdef BFD_ASSEMBLER
466 else if (! flag_keep_locals && bfd_is_local_label_name (stdoutput, sym_name))
467 {
468 symbolP = (symbolS *) local_symbol_make (sym_name, now_seg,
469 (valueT) frag_now_fix (),
470 frag_now);
471 }
472#endif /* BFD_ASSEMBLER */
252b5132
RH
473 else
474 {
475 symbolP = symbol_new (sym_name, now_seg, (valueT) frag_now_fix (),
476 frag_now);
477#ifdef OBJ_VMS
478 S_SET_OTHER (symbolP, const_flag);
479#endif /* OBJ_VMS */
480
481 symbol_table_insert (symbolP);
482 } /* if we have seen this symbol before */
483
484 if (mri_common_symbol != NULL)
485 {
486 /* This symbol is actually being defined within an MRI common
487 section. This requires special handling. */
49309057
ILT
488 if (LOCAL_SYMBOL_CHECK (symbolP))
489 symbolP = local_symbol_convert ((struct local_symbol *) symbolP);
252b5132
RH
490 symbolP->sy_value.X_op = O_symbol;
491 symbolP->sy_value.X_add_symbol = mri_common_symbol;
492 symbolP->sy_value.X_add_number = S_GET_VALUE (mri_common_symbol);
493 symbolP->sy_frag = &zero_address_frag;
494 S_SET_SEGMENT (symbolP, expr_section);
495 symbolP->sy_mri_common = 1;
496 }
497
498#ifdef tc_frob_label
499 tc_frob_label (symbolP);
500#endif
501#ifdef obj_frob_label
502 obj_frob_label (symbolP);
503#endif
504
505 return symbolP;
506}
507\f
508
509/*
510 * symbol_table_insert()
511 *
512 * Die if we can't insert the symbol.
513 *
514 */
515
516void
517symbol_table_insert (symbolP)
518 symbolS *symbolP;
519{
520 register const char *error_string;
521
522 know (symbolP);
523 know (S_GET_NAME (symbolP));
524
49309057
ILT
525 if (LOCAL_SYMBOL_CHECK (symbolP))
526 {
527 error_string = hash_jam (local_hash, S_GET_NAME (symbolP),
528 (PTR) symbolP);
529 if (error_string != NULL)
530 as_fatal (_("Inserting \"%s\" into symbol table failed: %s"),
531 S_GET_NAME (symbolP), error_string);
532 return;
533 }
534
252b5132
RH
535 if ((error_string = hash_jam (sy_hash, S_GET_NAME (symbolP), (PTR) symbolP)))
536 {
537 as_fatal (_("Inserting \"%s\" into symbol table failed: %s"),
538 S_GET_NAME (symbolP), error_string);
539 } /* on error */
540} /* symbol_table_insert() */
541\f
542/*
543 * symbol_find_or_make()
544 *
545 * If a symbol name does not exist, create it as undefined, and insert
546 * it into the symbol table. Return a pointer to it.
547 */
548symbolS *
549symbol_find_or_make (name)
550 const char *name;
551{
552 register symbolS *symbolP;
553
554 symbolP = symbol_find (name);
555
556 if (symbolP == NULL)
557 {
49309057
ILT
558#ifdef BFD_ASSEMBLER
559 if (! flag_keep_locals && bfd_is_local_label_name (stdoutput, name))
560 {
561 symbolP = md_undefined_symbol ((char *) name);
562 if (symbolP != NULL)
563 return symbolP;
564
565 symbolP = (symbolS *) local_symbol_make (name, undefined_section,
566 (valueT) 0,
567 &zero_address_frag);
568 return symbolP;
569 }
570#endif
571
252b5132
RH
572 symbolP = symbol_make (name);
573
574 symbol_table_insert (symbolP);
575 } /* if symbol wasn't found */
576
577 return (symbolP);
578} /* symbol_find_or_make() */
579
580symbolS *
581symbol_make (name)
582 CONST char *name;
583{
584 symbolS *symbolP;
585
586 /* Let the machine description default it, e.g. for register names. */
587 symbolP = md_undefined_symbol ((char *) name);
588
589 if (!symbolP)
590 symbolP = symbol_new (name, undefined_section, (valueT) 0, &zero_address_frag);
591
592 return (symbolP);
593} /* symbol_make() */
594
595/*
596 * symbol_find()
597 *
598 * Implement symbol table lookup.
599 * In: A symbol's name as a string: '\0' can't be part of a symbol name.
600 * Out: NULL if the name was not in the symbol table, else the address
601 * of a struct symbol associated with that name.
602 */
603
604symbolS *
605symbol_find (name)
606 CONST char *name;
607{
608#ifdef STRIP_UNDERSCORE
609 return (symbol_find_base (name, 1));
610#else /* STRIP_UNDERSCORE */
611 return (symbol_find_base (name, 0));
612#endif /* STRIP_UNDERSCORE */
613} /* symbol_find() */
614
615symbolS *
616symbol_find_base (name, strip_underscore)
617 CONST char *name;
618 int strip_underscore;
619{
620 if (strip_underscore && *name == '_')
621 name++;
622
623#ifdef tc_canonicalize_symbol_name
624 {
625 char *copy;
03987ced 626 size_t len = strlen (name) + 1;
252b5132 627
03987ced
RH
628 copy = (char *) alloca (len);
629 memcpy (copy, name, len);
252b5132
RH
630 name = tc_canonicalize_symbol_name (copy);
631 }
632#endif
633
634 if (! symbols_case_sensitive)
635 {
03987ced
RH
636 char *copy;
637 const char *orig;
638 unsigned char c;
639
640 orig = name;
641 name = copy = (char *) alloca (strlen (name) + 1);
642
643 while ((c = *orig++) != '\0')
644 {
645 if (islower (c))
646 c = toupper (c);
647 *copy++ = c;
648 }
649 *copy = '\0';
252b5132
RH
650 }
651
a1605869
ILT
652#ifdef BFD_ASSEMBLER
653 {
654 struct local_symbol *locsym;
655
656 locsym = (struct local_symbol *) hash_find (local_hash, name);
657 if (locsym != NULL)
658 return (symbolS *) locsym;
659 }
660#endif
49309057 661
252b5132
RH
662 return ((symbolS *) hash_find (sy_hash, name));
663}
664
665/*
666 * Once upon a time, symbols were kept in a singly linked list. At
667 * least coff needs to be able to rearrange them from time to time, for
668 * which a doubly linked list is much more convenient. Loic did these
669 * as macros which seemed dangerous to me so they're now functions.
670 * xoxorich.
671 */
672
673/* Link symbol ADDME after symbol TARGET in the chain. */
674void
675symbol_append (addme, target, rootPP, lastPP)
676 symbolS *addme;
677 symbolS *target;
678 symbolS **rootPP;
679 symbolS **lastPP;
680{
49309057
ILT
681 if (LOCAL_SYMBOL_CHECK (addme))
682 abort ();
683 if (target != NULL && LOCAL_SYMBOL_CHECK (target))
684 abort ();
685
252b5132
RH
686 if (target == NULL)
687 {
688 know (*rootPP == NULL);
689 know (*lastPP == NULL);
690 addme->sy_next = NULL;
691#ifdef SYMBOLS_NEED_BACKPOINTERS
692 addme->sy_previous = NULL;
693#endif
694 *rootPP = addme;
695 *lastPP = addme;
696 return;
697 } /* if the list is empty */
698
699 if (target->sy_next != NULL)
700 {
701#ifdef SYMBOLS_NEED_BACKPOINTERS
702 target->sy_next->sy_previous = addme;
703#endif /* SYMBOLS_NEED_BACKPOINTERS */
704 }
705 else
706 {
707 know (*lastPP == target);
708 *lastPP = addme;
709 } /* if we have a next */
710
711 addme->sy_next = target->sy_next;
712 target->sy_next = addme;
713
714#ifdef SYMBOLS_NEED_BACKPOINTERS
715 addme->sy_previous = target;
716#endif /* SYMBOLS_NEED_BACKPOINTERS */
717
718 debug_verify_symchain (symbol_rootP, symbol_lastP);
719}
720
721/* Set the chain pointers of SYMBOL to null. */
722void
723symbol_clear_list_pointers (symbolP)
724 symbolS *symbolP;
725{
49309057
ILT
726 if (LOCAL_SYMBOL_CHECK (symbolP))
727 abort ();
252b5132
RH
728 symbolP->sy_next = NULL;
729#ifdef SYMBOLS_NEED_BACKPOINTERS
730 symbolP->sy_previous = NULL;
731#endif
732}
733
734#ifdef SYMBOLS_NEED_BACKPOINTERS
735/* Remove SYMBOLP from the list. */
736void
737symbol_remove (symbolP, rootPP, lastPP)
738 symbolS *symbolP;
739 symbolS **rootPP;
740 symbolS **lastPP;
741{
49309057
ILT
742 if (LOCAL_SYMBOL_CHECK (symbolP))
743 abort ();
744
252b5132
RH
745 if (symbolP == *rootPP)
746 {
747 *rootPP = symbolP->sy_next;
748 } /* if it was the root */
749
750 if (symbolP == *lastPP)
751 {
752 *lastPP = symbolP->sy_previous;
753 } /* if it was the tail */
754
755 if (symbolP->sy_next != NULL)
756 {
757 symbolP->sy_next->sy_previous = symbolP->sy_previous;
758 } /* if not last */
759
760 if (symbolP->sy_previous != NULL)
761 {
762 symbolP->sy_previous->sy_next = symbolP->sy_next;
763 } /* if not first */
764
765 debug_verify_symchain (*rootPP, *lastPP);
766}
767
768/* Link symbol ADDME before symbol TARGET in the chain. */
769void
770symbol_insert (addme, target, rootPP, lastPP)
771 symbolS *addme;
772 symbolS *target;
773 symbolS **rootPP;
774 symbolS **lastPP;
775{
49309057
ILT
776 if (LOCAL_SYMBOL_CHECK (addme))
777 abort ();
778 if (LOCAL_SYMBOL_CHECK (target))
779 abort ();
780
252b5132
RH
781 if (target->sy_previous != NULL)
782 {
783 target->sy_previous->sy_next = addme;
784 }
785 else
786 {
787 know (*rootPP == target);
788 *rootPP = addme;
789 } /* if not first */
790
791 addme->sy_previous = target->sy_previous;
792 target->sy_previous = addme;
793 addme->sy_next = target;
794
795 debug_verify_symchain (*rootPP, *lastPP);
796}
797
798#endif /* SYMBOLS_NEED_BACKPOINTERS */
799
800void
801verify_symbol_chain (rootP, lastP)
802 symbolS *rootP;
803 symbolS *lastP;
804{
805 symbolS *symbolP = rootP;
806
807 if (symbolP == NULL)
808 return;
809
810 for (; symbol_next (symbolP) != NULL; symbolP = symbol_next (symbolP))
811 {
49309057
ILT
812#ifdef BFD_ASSEMBLER
813 assert (symbolP->bsym != NULL);
814#endif
252b5132
RH
815#ifdef SYMBOLS_NEED_BACKPOINTERS
816 assert (symbolP->sy_next->sy_previous == symbolP);
817#else
818 /* Walk the list anyways, to make sure pointers are still good. */
819 ;
820#endif /* SYMBOLS_NEED_BACKPOINTERS */
821 }
822
823 assert (lastP == symbolP);
824}
825
826void
827verify_symbol_chain_2 (sym)
828 symbolS *sym;
829{
830 symbolS *p = sym, *n = sym;
831#ifdef SYMBOLS_NEED_BACKPOINTERS
832 while (symbol_previous (p))
833 p = symbol_previous (p);
834#endif
835 while (symbol_next (n))
836 n = symbol_next (n);
837 verify_symbol_chain (p, n);
838}
839
840/* Resolve the value of a symbol. This is called during the final
841 pass over the symbol table to resolve any symbols with complex
842 values. */
843
844valueT
845resolve_symbol_value (symp, finalize)
846 symbolS *symp;
847 int finalize;
848{
849 int resolved;
850 valueT final_val;
851 segT final_seg;
852
a1605869 853#ifdef BFD_ASSEMBLER
49309057
ILT
854 if (LOCAL_SYMBOL_CHECK (symp))
855 {
856 struct local_symbol *locsym = (struct local_symbol *) symp;
857
858 if (local_symbol_resolved_p (locsym))
859 return locsym->lsy_offset;
860
861 final_val = (local_symbol_get_frag (locsym)->fr_address
862 + locsym->lsy_offset);
863
864 if (finalize)
865 {
866 locsym->lsy_offset = final_val;
867 local_symbol_mark_resolved (locsym);
868 }
869
870 return final_val;
871 }
a1605869 872#endif
49309057 873
252b5132
RH
874 if (symp->sy_resolved)
875 {
876 if (symp->sy_value.X_op == O_constant)
877 return (valueT) symp->sy_value.X_add_number;
878 else
879 return 0;
880 }
881
882 resolved = 0;
883 final_seg = S_GET_SEGMENT (symp);
884
885 if (symp->sy_resolving)
886 {
887 if (finalize)
888 as_bad (_("Symbol definition loop encountered at %s"), S_GET_NAME (symp));
889 final_val = 0;
890 resolved = 1;
891 }
892 else
893 {
894 symbolS *add_symbol, *op_symbol;
895 offsetT left, right;
896 segT seg_left, seg_right;
897 operatorT op;
898
899 symp->sy_resolving = 1;
900
901 /* Help out with CSE. */
902 add_symbol = symp->sy_value.X_add_symbol;
903 op_symbol = symp->sy_value.X_op_symbol;
904 final_val = symp->sy_value.X_add_number;
905 op = symp->sy_value.X_op;
906
907 switch (op)
908 {
909 default:
910 BAD_CASE (op);
911 break;
912
913 case O_absent:
914 final_val = 0;
915 /* Fall through. */
916
917 case O_constant:
918 final_val += symp->sy_frag->fr_address;
919 if (final_seg == expr_section)
920 final_seg = absolute_section;
921 resolved = 1;
922 break;
923
924 case O_symbol:
925 case O_symbol_rva:
926 left = resolve_symbol_value (add_symbol, finalize);
927 do_symbol:
928
929 if (symp->sy_mri_common)
930 {
931 /* This is a symbol inside an MRI common section. The
932 relocation routines are going to handle it specially.
933 Don't change the value. */
49309057 934 resolved = symbol_resolved_p (add_symbol);
252b5132
RH
935 break;
936 }
937
938 if (finalize && final_val == 0)
49309057
ILT
939 {
940 if (LOCAL_SYMBOL_CHECK (add_symbol))
941 add_symbol = local_symbol_convert ((struct local_symbol *)
942 add_symbol);
943 copy_symbol_attributes (symp, add_symbol);
944 }
252b5132
RH
945
946 /* If we have equated this symbol to an undefined symbol, we
947 keep X_op set to O_symbol, and we don't change
948 X_add_number. This permits the routine which writes out
949 relocation to detect this case, and convert the
950 relocation to be against the symbol to which this symbol
951 is equated. */
952 if (! S_IS_DEFINED (add_symbol) || S_IS_COMMON (add_symbol))
953 {
954 if (finalize)
955 {
956 S_SET_SEGMENT (symp, S_GET_SEGMENT (add_symbol));
957 symp->sy_value.X_op = O_symbol;
958 symp->sy_value.X_add_symbol = add_symbol;
959 symp->sy_value.X_add_number = final_val;
960 }
961 final_val = 0;
49309057 962 resolved = symbol_resolved_p (add_symbol);
252b5132
RH
963 goto exit_dont_set_value;
964 }
965 else
966 {
967 final_val += symp->sy_frag->fr_address + left;
968 if (final_seg == expr_section || final_seg == undefined_section)
969 final_seg = S_GET_SEGMENT (add_symbol);
970 }
971
49309057 972 resolved = symbol_resolved_p (add_symbol);
252b5132
RH
973 break;
974
975 case O_uminus:
976 case O_bit_not:
977 case O_logical_not:
978 left = resolve_symbol_value (add_symbol, finalize);
979
980 if (op == O_uminus)
981 left = -left;
982 else if (op == O_logical_not)
983 left = !left;
984 else
985 left = ~left;
986
987 final_val += left + symp->sy_frag->fr_address;
988 if (final_seg == expr_section || final_seg == undefined_section)
989 final_seg = absolute_section;
990
49309057 991 resolved = symbol_resolved_p (add_symbol);
252b5132
RH
992 break;
993
994 case O_multiply:
995 case O_divide:
996 case O_modulus:
997 case O_left_shift:
998 case O_right_shift:
999 case O_bit_inclusive_or:
1000 case O_bit_or_not:
1001 case O_bit_exclusive_or:
1002 case O_bit_and:
1003 case O_add:
1004 case O_subtract:
1005 case O_eq:
1006 case O_ne:
1007 case O_lt:
1008 case O_le:
1009 case O_ge:
1010 case O_gt:
1011 case O_logical_and:
1012 case O_logical_or:
1013 left = resolve_symbol_value (add_symbol, finalize);
1014 right = resolve_symbol_value (op_symbol, finalize);
1015 seg_left = S_GET_SEGMENT (add_symbol);
1016 seg_right = S_GET_SEGMENT (op_symbol);
1017
1018 /* Simplify addition or subtraction of a constant by folding the
1019 constant into X_add_number. */
1020 if (op == O_add || op == O_subtract)
1021 {
1022 if (seg_right == absolute_section)
1023 {
1024 if (op == O_add)
1025 final_val += right;
1026 else
1027 final_val -= right;
1028 op = O_symbol;
1029 op_symbol = NULL;
1030 goto do_symbol;
1031 }
1032 else if (seg_left == absolute_section && op == O_add)
1033 {
1034 op = O_symbol;
1035 final_val += left;
1036 add_symbol = op_symbol;
1037 left = right;
1038 op_symbol = NULL;
1039 goto do_symbol;
1040 }
1041 }
1042
1043 /* Subtraction is permitted if both operands are in the same
1044 section. Otherwise, both operands must be absolute. We
1045 already handled the case of addition or subtraction of a
1046 constant above. This will probably need to be changed
1047 for an object file format which supports arbitrary
1048 expressions, such as IEEE-695. */
1049 /* Don't emit messages unless we're finalizing the symbol value,
1050 otherwise we may get the same message multiple times. */
9b4d630b
ILT
1051 if ((seg_left != absolute_section
1052 || seg_right != absolute_section)
1053 && (op != O_subtract
1054 || seg_left != seg_right
1055 || seg_left == undefined_section)
252b5132
RH
1056 && finalize)
1057 {
1058 char *file;
1059 unsigned int line;
1060
1061 if (expr_symbol_where (symp, &file, &line))
1062 {
1063 if (seg_left == undefined_section)
1064 as_bad_where (file, line,
1065 _("undefined symbol %s in operation"),
1066 S_GET_NAME (symp->sy_value.X_add_symbol));
1067 if (seg_right == undefined_section)
1068 as_bad_where (file, line,
1069 _("undefined symbol %s in operation"),
1070 S_GET_NAME (symp->sy_value.X_op_symbol));
1071 if (seg_left != undefined_section
1072 && seg_right != undefined_section)
1073 as_bad_where (file, line, _("invalid section for operation"));
1074 }
1075 else
1076 {
1077 if (seg_left == undefined_section)
1078 as_bad (_("undefined symbol %s in operation setting %s"),
1079 S_GET_NAME (symp->sy_value.X_add_symbol),
1080 S_GET_NAME (symp));
1081 if (seg_right == undefined_section)
1082 as_bad (_("undefined symbol %s in operation setting %s"),
1083 S_GET_NAME (symp->sy_value.X_op_symbol),
1084 S_GET_NAME (symp));
1085 if (seg_left != undefined_section
1086 && seg_right != undefined_section)
1087 as_bad (_("invalid section for operation setting %s"),
1088 S_GET_NAME (symp));
1089 }
1090 }
1091
1092 /* Check for division by zero. */
1093 if ((op == O_divide || op == O_modulus) && right == 0)
1094 {
1095 /* If seg_right is not absolute_section, then we've
1096 already issued a warning about using a bad symbol. */
1097 if (seg_right == absolute_section && finalize)
1098 {
1099 char *file;
1100 unsigned int line;
1101
1102 if (expr_symbol_where (symp, &file, &line))
1103 as_bad_where (file, line, _("division by zero"));
1104 else
1105 as_bad (_("division by zero when setting %s"),
1106 S_GET_NAME (symp));
1107 }
1108
1109 right = 1;
1110 }
1111
1112 switch (symp->sy_value.X_op)
1113 {
1114 case O_multiply: left *= right; break;
1115 case O_divide: left /= right; break;
1116 case O_modulus: left %= right; break;
1117 case O_left_shift: left <<= right; break;
1118 case O_right_shift: left >>= right; break;
1119 case O_bit_inclusive_or: left |= right; break;
1120 case O_bit_or_not: left |= ~right; break;
1121 case O_bit_exclusive_or: left ^= right; break;
1122 case O_bit_and: left &= right; break;
1123 case O_add: left += right; break;
1124 case O_subtract: left -= right; break;
1125 case O_eq: left = left == right ? ~ (offsetT) 0 : 0; break;
1126 case O_ne: left = left != right ? ~ (offsetT) 0 : 0; break;
1127 case O_lt: left = left < right ? ~ (offsetT) 0 : 0; break;
1128 case O_le: left = left <= right ? ~ (offsetT) 0 : 0; break;
1129 case O_ge: left = left >= right ? ~ (offsetT) 0 : 0; break;
1130 case O_gt: left = left > right ? ~ (offsetT) 0 : 0; break;
1131 case O_logical_and: left = left && right; break;
1132 case O_logical_or: left = left || right; break;
1133 default: abort ();
1134 }
1135
1136 final_val += symp->sy_frag->fr_address + left;
1137 if (final_seg == expr_section || final_seg == undefined_section)
1138 final_seg = absolute_section;
49309057
ILT
1139 resolved = (symbol_resolved_p (add_symbol)
1140 && symbol_resolved_p (op_symbol));
252b5132
RH
1141 break;
1142
1143 case O_register:
1144 case O_big:
1145 case O_illegal:
1146 /* Give an error (below) if not in expr_section. We don't
1147 want to worry about expr_section symbols, because they
1148 are fictional (they are created as part of expression
1149 resolution), and any problems may not actually mean
1150 anything. */
1151 break;
1152 }
1153
1154 symp->sy_resolving = 0;
1155 }
1156
1157 if (finalize)
1158 {
1159 S_SET_VALUE (symp, final_val);
1160
1161#if defined (OBJ_AOUT) && ! defined (BFD_ASSEMBLER)
1162 /* The old a.out backend does not handle S_SET_SEGMENT correctly
1163 for a stab symbol, so we use this bad hack. */
1164 if (final_seg != S_GET_SEGMENT (symp))
1165#endif
1166 S_SET_SEGMENT (symp, final_seg);
1167 }
1168
1169exit_dont_set_value:
1170 /* Don't worry if we can't resolve an expr_section symbol. */
1171 if (finalize)
1172 {
1173 if (resolved)
1174 symp->sy_resolved = 1;
1175 else if (S_GET_SEGMENT (symp) != expr_section)
1176 {
1177 as_bad (_("can't resolve value for symbol \"%s\""), S_GET_NAME (symp));
1178 symp->sy_resolved = 1;
1179 }
1180 }
1181
1182 return final_val;
1183}
1184
49309057
ILT
1185#ifdef BFD_ASSEMBLER
1186
1187static void resolve_local_symbol PARAMS ((const char *, PTR));
1188
1189/* A static function passed to hash_traverse. */
1190
1191static void
1192resolve_local_symbol (key, value)
1193 const char *key;
1194 PTR value;
1195{
1196 if (value != NULL)
1197 resolve_symbol_value (value, 1);
1198}
1199
1200#endif
1201
1202/* Resolve all local symbols. */
1203
1204void
1205resolve_local_symbol_values ()
1206{
1207#ifdef BFD_ASSEMBLER
1208 hash_traverse (local_hash, resolve_local_symbol);
1209#endif
1210}
1211
252b5132
RH
1212/* Dollar labels look like a number followed by a dollar sign. Eg, "42$".
1213 They are *really* local. That is, they go out of scope whenever we see a
1214 label that isn't local. Also, like fb labels, there can be multiple
1215 instances of a dollar label. Therefor, we name encode each instance with
1216 the instance number, keep a list of defined symbols separate from the real
1217 symbol table, and we treat these buggers as a sparse array. */
1218
1219static long *dollar_labels;
1220static long *dollar_label_instances;
1221static char *dollar_label_defines;
1222static unsigned long dollar_label_count;
1223static unsigned long dollar_label_max;
1224
1225int
1226dollar_label_defined (label)
1227 long label;
1228{
1229 long *i;
1230
1231 know ((dollar_labels != NULL) || (dollar_label_count == 0));
1232
1233 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
1234 if (*i == label)
1235 return dollar_label_defines[i - dollar_labels];
1236
1237 /* if we get here, label isn't defined */
1238 return 0;
1239} /* dollar_label_defined() */
1240
1241static long
1242dollar_label_instance (label)
1243 long label;
1244{
1245 long *i;
1246
1247 know ((dollar_labels != NULL) || (dollar_label_count == 0));
1248
1249 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
1250 if (*i == label)
1251 return (dollar_label_instances[i - dollar_labels]);
1252
1253 /* If we get here, we haven't seen the label before, therefore its instance
1254 count is zero. */
1255 return 0;
1256}
1257
1258void
1259dollar_label_clear ()
1260{
1261 memset (dollar_label_defines, '\0', (unsigned int) dollar_label_count);
1262}
1263
1264#define DOLLAR_LABEL_BUMP_BY 10
1265
1266void
1267define_dollar_label (label)
1268 long label;
1269{
1270 long *i;
1271
1272 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
1273 if (*i == label)
1274 {
1275 ++dollar_label_instances[i - dollar_labels];
1276 dollar_label_defines[i - dollar_labels] = 1;
1277 return;
1278 }
1279
1280 /* if we get to here, we don't have label listed yet. */
1281
1282 if (dollar_labels == NULL)
1283 {
1284 dollar_labels = (long *) xmalloc (DOLLAR_LABEL_BUMP_BY * sizeof (long));
1285 dollar_label_instances = (long *) xmalloc (DOLLAR_LABEL_BUMP_BY * sizeof (long));
1286 dollar_label_defines = xmalloc (DOLLAR_LABEL_BUMP_BY);
1287 dollar_label_max = DOLLAR_LABEL_BUMP_BY;
1288 dollar_label_count = 0;
1289 }
1290 else if (dollar_label_count == dollar_label_max)
1291 {
1292 dollar_label_max += DOLLAR_LABEL_BUMP_BY;
1293 dollar_labels = (long *) xrealloc ((char *) dollar_labels,
1294 dollar_label_max * sizeof (long));
1295 dollar_label_instances = (long *) xrealloc ((char *) dollar_label_instances,
1296 dollar_label_max * sizeof (long));
1297 dollar_label_defines = xrealloc (dollar_label_defines, dollar_label_max);
1298 } /* if we needed to grow */
1299
1300 dollar_labels[dollar_label_count] = label;
1301 dollar_label_instances[dollar_label_count] = 1;
1302 dollar_label_defines[dollar_label_count] = 1;
1303 ++dollar_label_count;
1304}
1305
1306/*
1307 * dollar_label_name()
1308 *
1309 * Caller must copy returned name: we re-use the area for the next name.
1310 *
1311 * The mth occurence of label n: is turned into the symbol "Ln^Am"
1312 * where n is the label number and m is the instance number. "L" makes
1313 * it a label discarded unless debugging and "^A"('\1') ensures no
1314 * ordinary symbol SHOULD get the same name as a local label
1315 * symbol. The first "4:" is "L4^A1" - the m numbers begin at 1.
1316 *
1317 * fb labels get the same treatment, except that ^B is used in place of ^A.
1318 */
1319
1320char * /* Return local label name. */
1321dollar_label_name (n, augend)
1322 register long n; /* we just saw "n$:" : n a number */
1323 register int augend; /* 0 for current instance, 1 for new instance */
1324{
1325 long i;
1326 /* Returned to caller, then copied. used for created names ("4f") */
1327 static char symbol_name_build[24];
1328 register char *p;
1329 register char *q;
1330 char symbol_name_temporary[20]; /* build up a number, BACKWARDS */
1331
1332 know (n >= 0);
1333 know (augend == 0 || augend == 1);
1334 p = symbol_name_build;
1335 *p++ = 'L';
1336
1337 /* Next code just does sprintf( {}, "%d", n); */
1338 /* label number */
1339 q = symbol_name_temporary;
1340 for (*q++ = 0, i = n; i; ++q)
1341 {
1342 *q = i % 10 + '0';
1343 i /= 10;
1344 }
1345 while ((*p = *--q) != '\0')
1346 ++p;
1347
1348 *p++ = 1; /* ^A */
1349
1350 /* instance number */
1351 q = symbol_name_temporary;
1352 for (*q++ = 0, i = dollar_label_instance (n) + augend; i; ++q)
1353 {
1354 *q = i % 10 + '0';
1355 i /= 10;
1356 }
1357 while ((*p++ = *--q) != '\0');;
1358
1359 /* The label, as a '\0' ended string, starts at symbol_name_build. */
1360 return symbol_name_build;
1361}
1362
1363/*
1364 * Sombody else's idea of local labels. They are made by "n:" where n
1365 * is any decimal digit. Refer to them with
1366 * "nb" for previous (backward) n:
1367 * or "nf" for next (forward) n:.
1368 *
1369 * We do a little better and let n be any number, not just a single digit, but
1370 * since the other guy's assembler only does ten, we treat the first ten
1371 * specially.
1372 *
1373 * Like someone else's assembler, we have one set of local label counters for
1374 * entire assembly, not one set per (sub)segment like in most assemblers. This
1375 * implies that one can refer to a label in another segment, and indeed some
1376 * crufty compilers have done just that.
1377 *
1378 * Since there could be a LOT of these things, treat them as a sparse array.
1379 */
1380
1381#define FB_LABEL_SPECIAL (10)
1382
1383static long fb_low_counter[FB_LABEL_SPECIAL];
1384static long *fb_labels;
1385static long *fb_label_instances;
1386static long fb_label_count;
1387static long fb_label_max;
1388
1389/* this must be more than FB_LABEL_SPECIAL */
1390#define FB_LABEL_BUMP_BY (FB_LABEL_SPECIAL + 6)
1391
1392static void
1393fb_label_init ()
1394{
1395 memset ((void *) fb_low_counter, '\0', sizeof (fb_low_counter));
1396} /* fb_label_init() */
1397
1398/* add one to the instance number of this fb label */
1399void
1400fb_label_instance_inc (label)
1401 long label;
1402{
1403 long *i;
1404
1405 if (label < FB_LABEL_SPECIAL)
1406 {
1407 ++fb_low_counter[label];
1408 return;
1409 }
1410
1411 if (fb_labels != NULL)
1412 {
1413 for (i = fb_labels + FB_LABEL_SPECIAL;
1414 i < fb_labels + fb_label_count; ++i)
1415 {
1416 if (*i == label)
1417 {
1418 ++fb_label_instances[i - fb_labels];
1419 return;
1420 } /* if we find it */
1421 } /* for each existing label */
1422 }
1423
1424 /* if we get to here, we don't have label listed yet. */
1425
1426 if (fb_labels == NULL)
1427 {
1428 fb_labels = (long *) xmalloc (FB_LABEL_BUMP_BY * sizeof (long));
1429 fb_label_instances = (long *) xmalloc (FB_LABEL_BUMP_BY * sizeof (long));
1430 fb_label_max = FB_LABEL_BUMP_BY;
1431 fb_label_count = FB_LABEL_SPECIAL;
1432
1433 }
1434 else if (fb_label_count == fb_label_max)
1435 {
1436 fb_label_max += FB_LABEL_BUMP_BY;
1437 fb_labels = (long *) xrealloc ((char *) fb_labels,
1438 fb_label_max * sizeof (long));
1439 fb_label_instances = (long *) xrealloc ((char *) fb_label_instances,
1440 fb_label_max * sizeof (long));
1441 } /* if we needed to grow */
1442
1443 fb_labels[fb_label_count] = label;
1444 fb_label_instances[fb_label_count] = 1;
1445 ++fb_label_count;
1446}
1447
1448static long
1449fb_label_instance (label)
1450 long label;
1451{
1452 long *i;
1453
1454 if (label < FB_LABEL_SPECIAL)
1455 {
1456 return (fb_low_counter[label]);
1457 }
1458
1459 if (fb_labels != NULL)
1460 {
1461 for (i = fb_labels + FB_LABEL_SPECIAL;
1462 i < fb_labels + fb_label_count; ++i)
1463 {
1464 if (*i == label)
1465 {
1466 return (fb_label_instances[i - fb_labels]);
1467 } /* if we find it */
1468 } /* for each existing label */
1469 }
1470
1471 /* We didn't find the label, so this must be a reference to the
1472 first instance. */
1473 return 0;
1474}
1475
1476/*
1477 * fb_label_name()
1478 *
1479 * Caller must copy returned name: we re-use the area for the next name.
1480 *
1481 * The mth occurence of label n: is turned into the symbol "Ln^Bm"
1482 * where n is the label number and m is the instance number. "L" makes
1483 * it a label discarded unless debugging and "^B"('\2') ensures no
1484 * ordinary symbol SHOULD get the same name as a local label
1485 * symbol. The first "4:" is "L4^B1" - the m numbers begin at 1.
1486 *
1487 * dollar labels get the same treatment, except that ^A is used in place of ^B. */
1488
1489char * /* Return local label name. */
1490fb_label_name (n, augend)
1491 long n; /* we just saw "n:", "nf" or "nb" : n a number */
1492 long augend; /* 0 for nb, 1 for n:, nf */
1493{
1494 long i;
1495 /* Returned to caller, then copied. used for created names ("4f") */
1496 static char symbol_name_build[24];
1497 register char *p;
1498 register char *q;
1499 char symbol_name_temporary[20]; /* build up a number, BACKWARDS */
1500
1501 know (n >= 0);
1502 know (augend == 0 || augend == 1);
1503 p = symbol_name_build;
1504 *p++ = 'L';
1505
1506 /* Next code just does sprintf( {}, "%d", n); */
1507 /* label number */
1508 q = symbol_name_temporary;
1509 for (*q++ = 0, i = n; i; ++q)
1510 {
1511 *q = i % 10 + '0';
1512 i /= 10;
1513 }
1514 while ((*p = *--q) != '\0')
1515 ++p;
1516
1517 *p++ = 2; /* ^B */
1518
1519 /* instance number */
1520 q = symbol_name_temporary;
1521 for (*q++ = 0, i = fb_label_instance (n) + augend; i; ++q)
1522 {
1523 *q = i % 10 + '0';
1524 i /= 10;
1525 }
1526 while ((*p++ = *--q) != '\0');;
1527
1528 /* The label, as a '\0' ended string, starts at symbol_name_build. */
1529 return (symbol_name_build);
1530} /* fb_label_name() */
1531
1532/*
1533 * decode name that may have been generated by foo_label_name() above. If
1534 * the name wasn't generated by foo_label_name(), then return it unaltered.
1535 * This is used for error messages.
1536 */
1537
1538char *
1539decode_local_label_name (s)
1540 char *s;
1541{
1542 char *p;
1543 char *symbol_decode;
1544 int label_number;
1545 int instance_number;
1546 char *type;
1547 const char *message_format = _("\"%d\" (instance number %d of a %s label)");
1548
1549 if (s[0] != 'L')
1550 return s;
1551
1552 for (label_number = 0, p = s + 1; isdigit ((unsigned char) *p); ++p)
1553 label_number = (10 * label_number) + *p - '0';
1554
1555 if (*p == 1)
1556 type = "dollar";
1557 else if (*p == 2)
1558 type = "fb";
1559 else
1560 return s;
1561
1562 for (instance_number = 0, p++; isdigit ((unsigned char) *p); ++p)
1563 instance_number = (10 * instance_number) + *p - '0';
1564
1565 symbol_decode = obstack_alloc (&notes, strlen (message_format) + 30);
1566 sprintf (symbol_decode, message_format, label_number, instance_number, type);
1567
1568 return symbol_decode;
1569}
1570
1571/* Get the value of a symbol. */
1572
1573valueT
1574S_GET_VALUE (s)
1575 symbolS *s;
1576{
a1605869 1577#ifdef BFD_ASSEMBLER
49309057
ILT
1578 if (LOCAL_SYMBOL_CHECK (s))
1579 return ((struct local_symbol *) s)->lsy_offset;
a1605869 1580#endif
49309057 1581
252b5132
RH
1582 if (!s->sy_resolved && s->sy_value.X_op != O_constant)
1583 resolve_symbol_value (s, 1);
1584 if (s->sy_value.X_op != O_constant)
1585 {
1586 static symbolS *recur;
1587
1588 /* FIXME: In non BFD assemblers, S_IS_DEFINED and S_IS_COMMON
1589 may call S_GET_VALUE. We use a static symbol to avoid the
1590 immediate recursion. */
1591 if (recur == s)
1592 return (valueT) s->sy_value.X_add_number;
1593 recur = s;
1594 if (! s->sy_resolved
1595 || s->sy_value.X_op != O_symbol
1596 || (S_IS_DEFINED (s) && ! S_IS_COMMON (s)))
1597 as_bad (_("Attempt to get value of unresolved symbol %s"),
1598 S_GET_NAME (s));
1599 recur = NULL;
1600 }
1601 return (valueT) s->sy_value.X_add_number;
1602}
1603
1604/* Set the value of a symbol. */
1605
1606void
1607S_SET_VALUE (s, val)
1608 symbolS *s;
1609 valueT val;
1610{
a1605869 1611#ifdef BFD_ASSEMBLER
49309057
ILT
1612 if (LOCAL_SYMBOL_CHECK (s))
1613 {
1614 ((struct local_symbol *) s)->lsy_offset = val;
1615 return;
1616 }
a1605869 1617#endif
49309057 1618
252b5132
RH
1619 s->sy_value.X_op = O_constant;
1620 s->sy_value.X_add_number = (offsetT) val;
1621 s->sy_value.X_unsigned = 0;
1622}
1623
1624void
1625copy_symbol_attributes (dest, src)
1626 symbolS *dest, *src;
1627{
49309057 1628 if (LOCAL_SYMBOL_CHECK (dest))
7f2f689c 1629 dest = local_symbol_convert ((struct local_symbol *) dest);
49309057 1630 if (LOCAL_SYMBOL_CHECK (src))
7f2f689c 1631 src = local_symbol_convert ((struct local_symbol *) src);
49309057 1632
252b5132
RH
1633#ifdef BFD_ASSEMBLER
1634 /* In an expression, transfer the settings of these flags.
1635 The user can override later, of course. */
1636#define COPIED_SYMFLAGS (BSF_FUNCTION | BSF_OBJECT)
1637 dest->bsym->flags |= src->bsym->flags & COPIED_SYMFLAGS;
1638#endif
1639
1640#ifdef OBJ_COPY_SYMBOL_ATTRIBUTES
1641 OBJ_COPY_SYMBOL_ATTRIBUTES (dest, src);
1642#endif
1643}
1644
1645#ifdef BFD_ASSEMBLER
1646
1647int
1648S_IS_FUNCTION (s)
1649 symbolS *s;
1650{
49309057
ILT
1651 flagword flags;
1652
1653 if (LOCAL_SYMBOL_CHECK (s))
1654 return 0;
1655
1656 flags = s->bsym->flags;
252b5132
RH
1657
1658 return (flags & BSF_FUNCTION) != 0;
1659}
1660
1661int
1662S_IS_EXTERNAL (s)
1663 symbolS *s;
1664{
49309057
ILT
1665 flagword flags;
1666
1667 if (LOCAL_SYMBOL_CHECK (s))
1668 return 0;
1669
1670 flags = s->bsym->flags;
252b5132
RH
1671
1672 /* sanity check */
1673 if ((flags & BSF_LOCAL) && (flags & BSF_GLOBAL))
1674 abort ();
1675
1676 return (flags & BSF_GLOBAL) != 0;
1677}
1678
1679int
1680S_IS_WEAK (s)
1681 symbolS *s;
1682{
49309057
ILT
1683 if (LOCAL_SYMBOL_CHECK (s))
1684 return 0;
252b5132
RH
1685 return (s->bsym->flags & BSF_WEAK) != 0;
1686}
1687
1688int
1689S_IS_COMMON (s)
1690 symbolS *s;
1691{
49309057
ILT
1692 if (LOCAL_SYMBOL_CHECK (s))
1693 return 0;
252b5132
RH
1694 return bfd_is_com_section (s->bsym->section);
1695}
1696
1697int
1698S_IS_DEFINED (s)
1699 symbolS *s;
1700{
49309057
ILT
1701 if (LOCAL_SYMBOL_CHECK (s))
1702 return ((struct local_symbol *) s)->lsy_section != undefined_section;
252b5132
RH
1703 return s->bsym->section != undefined_section;
1704}
1705
1706int
1707S_IS_DEBUG (s)
1708 symbolS *s;
1709{
49309057
ILT
1710 if (LOCAL_SYMBOL_CHECK (s))
1711 return 0;
252b5132
RH
1712 if (s->bsym->flags & BSF_DEBUGGING)
1713 return 1;
1714 return 0;
1715}
1716
1717int
1718S_IS_LOCAL (s)
1719 symbolS *s;
1720{
49309057 1721 flagword flags;
252b5132
RH
1722 const char *name;
1723
49309057
ILT
1724 if (LOCAL_SYMBOL_CHECK (s))
1725 return 1;
1726
1727 flags = s->bsym->flags;
1728
252b5132
RH
1729 /* sanity check */
1730 if ((flags & BSF_LOCAL) && (flags & BSF_GLOBAL))
1731 abort ();
1732
1733 if (bfd_get_section (s->bsym) == reg_section)
1734 return 1;
1735
1736 if (flag_strip_local_absolute
1737 && (flags & BSF_GLOBAL) == 0
1738 && bfd_get_section (s->bsym) == absolute_section)
1739 return 1;
1740
1741 name = S_GET_NAME (s);
1742 return (name != NULL
1743 && ! S_IS_DEBUG (s)
1744 && (strchr (name, '\001')
1745 || strchr (name, '\002')
1746 || (! flag_keep_locals
1747 && (bfd_is_local_label (stdoutput, s->bsym)
1748 || (flag_mri
1749 && name[0] == '?'
1750 && name[1] == '?')))));
1751}
1752
1753int
1754S_IS_EXTERN (s)
1755 symbolS *s;
1756{
1757 return S_IS_EXTERNAL (s);
1758}
1759
1760int
1761S_IS_STABD (s)
1762 symbolS *s;
1763{
1764 return S_GET_NAME (s) == 0;
1765}
1766
1767CONST char *
1768S_GET_NAME (s)
1769 symbolS *s;
1770{
49309057
ILT
1771 if (LOCAL_SYMBOL_CHECK (s))
1772 return ((struct local_symbol *) s)->lsy_name;
252b5132
RH
1773 return s->bsym->name;
1774}
1775
1776segT
1777S_GET_SEGMENT (s)
1778 symbolS *s;
1779{
49309057
ILT
1780 if (LOCAL_SYMBOL_CHECK (s))
1781 return ((struct local_symbol *) s)->lsy_section;
252b5132
RH
1782 return s->bsym->section;
1783}
1784
1785void
1786S_SET_SEGMENT (s, seg)
1787 symbolS *s;
1788 segT seg;
1789{
1790 /* Don't reassign section symbols. The direct reason is to prevent seg
1791 faults assigning back to const global symbols such as *ABS*, but it
1792 shouldn't happen anyway. */
1793
49309057
ILT
1794 if (LOCAL_SYMBOL_CHECK (s))
1795 {
1796 if (seg == reg_section)
1797 s = local_symbol_convert ((struct local_symbol *) s);
1798 else
1799 {
1800 ((struct local_symbol *) s)->lsy_section = seg;
1801 return;
1802 }
1803 }
1804
252b5132
RH
1805 if (s->bsym->flags & BSF_SECTION_SYM)
1806 {
1807 if (s->bsym->section != seg)
1808 abort();
1809 }
1810 else
1811 s->bsym->section = seg;
1812}
1813
1814void
1815S_SET_EXTERNAL (s)
1816 symbolS *s;
1817{
49309057
ILT
1818 if (LOCAL_SYMBOL_CHECK (s))
1819 s = local_symbol_convert ((struct local_symbol *) s);
252b5132
RH
1820 if ((s->bsym->flags & BSF_WEAK) != 0)
1821 {
1822 /* Let .weak override .global. */
1823 return;
1824 }
1825 s->bsym->flags |= BSF_GLOBAL;
1826 s->bsym->flags &= ~(BSF_LOCAL|BSF_WEAK);
1827}
1828
1829void
1830S_CLEAR_EXTERNAL (s)
1831 symbolS *s;
1832{
49309057
ILT
1833 if (LOCAL_SYMBOL_CHECK (s))
1834 return;
252b5132
RH
1835 if ((s->bsym->flags & BSF_WEAK) != 0)
1836 {
1837 /* Let .weak override. */
1838 return;
1839 }
1840 s->bsym->flags |= BSF_LOCAL;
1841 s->bsym->flags &= ~(BSF_GLOBAL|BSF_WEAK);
1842}
1843
1844void
1845S_SET_WEAK (s)
1846 symbolS *s;
1847{
49309057
ILT
1848 if (LOCAL_SYMBOL_CHECK (s))
1849 s = local_symbol_convert ((struct local_symbol *) s);
252b5132
RH
1850 s->bsym->flags |= BSF_WEAK;
1851 s->bsym->flags &= ~(BSF_GLOBAL|BSF_LOCAL);
1852}
1853
1854void
1855S_SET_NAME (s, name)
1856 symbolS *s;
1857 char *name;
1858{
49309057
ILT
1859 if (LOCAL_SYMBOL_CHECK (s))
1860 {
1861 ((struct local_symbol *) s)->lsy_name = name;
1862 return;
1863 }
252b5132
RH
1864 s->bsym->name = name;
1865}
1866#endif /* BFD_ASSEMBLER */
1867
49309057
ILT
1868#ifdef SYMBOLS_NEED_BACKPOINTERS
1869
1870/* Return the previous symbol in a chain. */
1871
1872symbolS *
1873symbol_previous (s)
1874 symbolS *s;
1875{
1876 if (LOCAL_SYMBOL_CHECK (s))
1877 abort ();
1878 return s->sy_previous;
1879}
1880
1881#endif /* SYMBOLS_NEED_BACKPOINTERS */
1882
1883/* Return the next symbol in a chain. */
1884
1885symbolS *
1886symbol_next (s)
1887 symbolS *s;
1888{
1889 if (LOCAL_SYMBOL_CHECK (s))
1890 abort ();
1891 return s->sy_next;
1892}
1893
1894/* Return a pointer to the value of a symbol as an expression. */
1895
1896expressionS *
1897symbol_get_value_expression (s)
1898 symbolS *s;
1899{
1900 if (LOCAL_SYMBOL_CHECK (s))
1901 s = local_symbol_convert ((struct local_symbol *) s);
1902 return &s->sy_value;
1903}
1904
1905/* Set the value of a symbol to an expression. */
1906
1907void
1908symbol_set_value_expression (s, exp)
1909 symbolS *s;
1910 const expressionS *exp;
1911{
1912 if (LOCAL_SYMBOL_CHECK (s))
1913 s = local_symbol_convert ((struct local_symbol *) s);
1914 s->sy_value = *exp;
1915}
1916
1917/* Set the frag of a symbol. */
1918
1919void
1920symbol_set_frag (s, f)
1921 symbolS *s;
1922 fragS *f;
1923{
a1605869 1924#ifdef BFD_ASSEMBLER
49309057
ILT
1925 if (LOCAL_SYMBOL_CHECK (s))
1926 {
1927 local_symbol_set_frag ((struct local_symbol *) s, f);
1928 return;
1929 }
a1605869 1930#endif
49309057
ILT
1931 s->sy_frag = f;
1932}
1933
1934/* Return the frag of a symbol. */
1935
1936fragS *
1937symbol_get_frag (s)
1938 symbolS *s;
1939{
a1605869 1940#ifdef BFD_ASSEMBLER
49309057
ILT
1941 if (LOCAL_SYMBOL_CHECK (s))
1942 return local_symbol_get_frag ((struct local_symbol *) s);
a1605869 1943#endif
49309057
ILT
1944 return s->sy_frag;
1945}
1946
1947/* Mark a symbol as having been used. */
1948
1949void
1950symbol_mark_used (s)
1951 symbolS *s;
1952{
1953 if (LOCAL_SYMBOL_CHECK (s))
1954 return;
1955 s->sy_used = 1;
1956}
1957
1958/* Clear the mark of whether a symbol has been used. */
1959
1960void
1961symbol_clear_used (s)
1962 symbolS *s;
1963{
1964 if (LOCAL_SYMBOL_CHECK (s))
1965 s = local_symbol_convert ((struct local_symbol *) s);
1966 s->sy_used = 0;
1967}
1968
1969/* Return whether a symbol has been used. */
1970
1971int
1972symbol_used_p (s)
1973 symbolS *s;
1974{
1975 if (LOCAL_SYMBOL_CHECK (s))
1976 return 1;
1977 return s->sy_used;
1978}
1979
1980/* Mark a symbol as having been used in a reloc. */
1981
1982void
1983symbol_mark_used_in_reloc (s)
1984 symbolS *s;
1985{
1986 if (LOCAL_SYMBOL_CHECK (s))
1987 s = local_symbol_convert ((struct local_symbol *) s);
1988 s->sy_used_in_reloc = 1;
1989}
1990
1991/* Clear the mark of whether a symbol has been used in a reloc. */
1992
1993void
1994symbol_clear_used_in_reloc (s)
1995 symbolS *s;
1996{
1997 if (LOCAL_SYMBOL_CHECK (s))
1998 return;
1999 s->sy_used_in_reloc = 0;
2000}
2001
2002/* Return whether a symbol has been used in a reloc. */
2003
2004int
2005symbol_used_in_reloc_p (s)
2006 symbolS *s;
2007{
2008 if (LOCAL_SYMBOL_CHECK (s))
2009 return 0;
2010 return s->sy_used_in_reloc;
2011}
2012
2013/* Mark a symbol as an MRI common symbol. */
2014
2015void
2016symbol_mark_mri_common (s)
2017 symbolS *s;
2018{
2019 if (LOCAL_SYMBOL_CHECK (s))
2020 s = local_symbol_convert ((struct local_symbol *) s);
2021 s->sy_mri_common = 1;
2022}
2023
2024/* Clear the mark of whether a symbol is an MRI common symbol. */
2025
2026void
2027symbol_clear_mri_common (s)
2028 symbolS *s;
2029{
2030 if (LOCAL_SYMBOL_CHECK (s))
2031 return;
2032 s->sy_mri_common = 0;
2033}
2034
2035/* Return whether a symbol is an MRI common symbol. */
2036
2037int
2038symbol_mri_common_p (s)
2039 symbolS *s;
2040{
2041 if (LOCAL_SYMBOL_CHECK (s))
2042 return 0;
2043 return s->sy_mri_common;
2044}
2045
2046/* Mark a symbol as having been written. */
2047
2048void
2049symbol_mark_written (s)
2050 symbolS *s;
2051{
2052 if (LOCAL_SYMBOL_CHECK (s))
2053 return;
2054 s->written = 1;
2055}
2056
2057/* Clear the mark of whether a symbol has been written. */
2058
2059void
2060symbol_clear_written (s)
2061 symbolS *s;
2062{
2063 if (LOCAL_SYMBOL_CHECK (s))
2064 return;
2065 s->written = 0;
2066}
2067
2068/* Return whether a symbol has been written. */
2069
2070int
2071symbol_written_p (s)
2072 symbolS *s;
2073{
2074 if (LOCAL_SYMBOL_CHECK (s))
2075 return 0;
2076 return s->written;
2077}
2078
2079/* Mark a symbol has having been resolved. */
2080
2081void
2082symbol_mark_resolved (s)
2083 symbolS *s;
2084{
a1605869 2085#ifdef BFD_ASSEMBLER
49309057
ILT
2086 if (LOCAL_SYMBOL_CHECK (s))
2087 {
2088 local_symbol_mark_resolved ((struct local_symbol *) s);
2089 return;
2090 }
a1605869 2091#endif
49309057
ILT
2092 s->sy_resolved = 1;
2093}
2094
2095/* Return whether a symbol has been resolved. */
2096
2097int
2098symbol_resolved_p (s)
2099 symbolS *s;
2100{
a1605869 2101#ifdef BFD_ASSEMBLER
49309057
ILT
2102 if (LOCAL_SYMBOL_CHECK (s))
2103 return local_symbol_resolved_p ((struct local_symbol *) s);
a1605869 2104#endif
49309057
ILT
2105 return s->sy_resolved;
2106}
2107
2108/* Return whether a symbol is a section symbol. */
2109
2110int
2111symbol_section_p (s)
2112 symbolS *s;
2113{
2114 if (LOCAL_SYMBOL_CHECK (s))
2115 return 0;
2116#ifdef BFD_ASSEMBLER
2117 return (s->bsym->flags & BSF_SECTION_SYM) != 0;
2118#else
2119 /* FIXME */
2120 return 0;
2121#endif
2122}
2123
2124/* Return whether a symbol is equated to another symbol. */
2125
2126int
2127symbol_equated_p (s)
2128 symbolS *s;
2129{
2130 if (LOCAL_SYMBOL_CHECK (s))
2131 return 0;
2132 return s->sy_value.X_op == O_symbol;
2133}
2134
2135/* Return whether a symbol has a constant value. */
2136
2137int
2138symbol_constant_p (s)
2139 symbolS *s;
2140{
2141 if (LOCAL_SYMBOL_CHECK (s))
2142 return 1;
2143 return s->sy_value.X_op == O_constant;
2144}
2145
2146#ifdef BFD_ASSEMBLER
2147
2148/* Return the BFD symbol for a symbol. */
2149
2150asymbol *
2151symbol_get_bfdsym (s)
2152 symbolS *s;
2153{
2154 if (LOCAL_SYMBOL_CHECK (s))
2155 s = local_symbol_convert ((struct local_symbol *) s);
2156 return s->bsym;
2157}
2158
2159/* Set the BFD symbol for a symbol. */
2160
2161void
2162symbol_set_bfdsym (s, bsym)
2163 symbolS *s;
2164 asymbol *bsym;
2165{
2166 if (LOCAL_SYMBOL_CHECK (s))
2167 s = local_symbol_convert ((struct local_symbol *) s);
2168 s->bsym = bsym;
2169}
2170
2171#endif /* BFD_ASSEMBLER */
2172
2173#ifdef OBJ_SYMFIELD_TYPE
2174
2175/* Get a pointer to the object format information for a symbol. */
2176
2177OBJ_SYMFIELD_TYPE *
2178symbol_get_obj (s)
2179 symbolS *s;
2180{
2181 if (LOCAL_SYMBOL_CHECK (s))
2182 s = local_symbol_convert ((struct local_symbol *) s);
2183 return &s->sy_obj;
2184}
2185
2186/* Set the object format information for a symbol. */
2187
2188void
2189symbol_set_obj (s, o)
2190 symbolS *s;
2191 OBJ_SYMFIELD_TYPE *o;
2192{
2193 if (LOCAL_SYMBOL_CHECK (s))
2194 s = local_symbol_convert ((struct local_symbol *) s);
2195 s->sy_obj = *o;
2196}
2197
2198#endif /* OBJ_SYMFIELD_TYPE */
2199
2200#ifdef TC_SYMFIELD_TYPE
2201
2202/* Get a pointer to the processor information for a symbol. */
2203
2204TC_SYMFIELD_TYPE *
2205symbol_get_tc (s)
2206 symbolS *s;
2207{
2208 if (LOCAL_SYMBOL_CHECK (s))
2209 s = local_symbol_convert ((struct local_symbol *) s);
2210 return &s->sy_tc;
2211}
2212
2213/* Set the processor information for a symbol. */
2214
2215void
bf27257e 2216symbol_set_tc (s, o)
49309057
ILT
2217 symbolS *s;
2218 TC_SYMFIELD_TYPE *o;
2219{
2220 if (LOCAL_SYMBOL_CHECK (s))
2221 s = local_symbol_convert ((struct local_symbol *) s);
2222 s->sy_tc = *o;
2223}
2224
2225#endif /* TC_SYMFIELD_TYPE */
2226
252b5132
RH
2227void
2228symbol_begin ()
2229{
2230 symbol_lastP = NULL;
2231 symbol_rootP = NULL; /* In case we have 0 symbols (!!) */
2232 sy_hash = hash_new ();
49309057
ILT
2233#ifdef BFD_ASSEMBLER
2234 local_hash = hash_new ();
2235#endif
252b5132
RH
2236
2237 memset ((char *) (&abs_symbol), '\0', sizeof (abs_symbol));
2238#ifdef BFD_ASSEMBLER
2239#if defined (EMIT_SECTION_SYMBOLS) || !defined (RELOC_REQUIRES_SYMBOL)
2240 abs_symbol.bsym = bfd_abs_section.symbol;
2241#endif
2242#else
2243 /* Can't initialise a union. Sigh. */
2244 S_SET_SEGMENT (&abs_symbol, absolute_section);
2245#endif
2246 abs_symbol.sy_value.X_op = O_constant;
2247 abs_symbol.sy_frag = &zero_address_frag;
2248
2249 if (LOCAL_LABELS_FB)
2250 fb_label_init ();
2251}
2252
49309057 2253
252b5132
RH
2254\f
2255int indent_level;
2256
2257/* Maximum indent level.
2258 Available for modification inside a gdb session. */
2259int max_indent_level = 8;
2260
2261#if 0
2262
2263static void
2264indent ()
2265{
2266 printf ("%*s", indent_level * 4, "");
2267}
2268
2269#endif
2270
2271void
2272print_symbol_value_1 (file, sym)
2273 FILE *file;
2274 symbolS *sym;
2275{
2276 const char *name = S_GET_NAME (sym);
2277 if (!name || !name[0])
2278 name = "(unnamed)";
2279 fprintf (file, "sym %lx %s", (unsigned long) sym, name);
49309057
ILT
2280
2281 if (LOCAL_SYMBOL_CHECK (sym))
2282 {
a1605869 2283#ifdef BFD_ASSEMBLER
49309057
ILT
2284 struct local_symbol *locsym = (struct local_symbol *) sym;
2285 if (local_symbol_get_frag (locsym) != &zero_address_frag
2286 && local_symbol_get_frag (locsym) != NULL)
2287 fprintf (file, " frag %lx", (long) local_symbol_get_frag (locsym));
2288 if (local_symbol_resolved_p (locsym))
2289 fprintf (file, " resolved");
2290 fprintf (file, " local");
a1605869 2291#endif
49309057
ILT
2292 }
2293 else
2294 {
2295 if (sym->sy_frag != &zero_address_frag)
2296 fprintf (file, " frag %lx", (long) sym->sy_frag);
2297 if (sym->written)
2298 fprintf (file, " written");
2299 if (sym->sy_resolved)
2300 fprintf (file, " resolved");
2301 else if (sym->sy_resolving)
2302 fprintf (file, " resolving");
2303 if (sym->sy_used_in_reloc)
2304 fprintf (file, " used-in-reloc");
2305 if (sym->sy_used)
2306 fprintf (file, " used");
2307 if (S_IS_LOCAL (sym))
2308 fprintf (file, " local");
2309 if (S_IS_EXTERN (sym))
2310 fprintf (file, " extern");
2311 if (S_IS_DEBUG (sym))
2312 fprintf (file, " debug");
2313 if (S_IS_DEFINED (sym))
2314 fprintf (file, " defined");
2315 }
252b5132 2316 fprintf (file, " %s", segment_name (S_GET_SEGMENT (sym)));
49309057 2317 if (symbol_resolved_p (sym))
252b5132
RH
2318 {
2319 segT s = S_GET_SEGMENT (sym);
2320
2321 if (s != undefined_section
2322 && s != expr_section)
2323 fprintf (file, " %lx", (long) S_GET_VALUE (sym));
2324 }
2325 else if (indent_level < max_indent_level
2326 && S_GET_SEGMENT (sym) != undefined_section)
2327 {
2328 indent_level++;
2329 fprintf (file, "\n%*s<", indent_level * 4, "");
a1605869 2330#ifdef BFD_ASSEMBLER
49309057
ILT
2331 if (LOCAL_SYMBOL_CHECK (sym))
2332 fprintf (file, "constant %lx",
2333 (long) ((struct local_symbol *) sym)->lsy_offset);
2334 else
a1605869 2335#endif
49309057 2336 print_expr_1 (file, &sym->sy_value);
252b5132
RH
2337 fprintf (file, ">");
2338 indent_level--;
2339 }
2340 fflush (file);
2341}
2342
2343void
2344print_symbol_value (sym)
2345 symbolS *sym;
2346{
2347 indent_level = 0;
2348 print_symbol_value_1 (stderr, sym);
2349 fprintf (stderr, "\n");
2350}
2351
2352static void
2353print_binary (file, name, exp)
2354 FILE *file;
2355 const char * name;
2356 expressionS *exp;
2357{
2358 indent_level++;
2359 fprintf (file, "%s\n%*s<", name, indent_level * 4, "");
2360 print_symbol_value_1 (file, exp->X_add_symbol);
2361 fprintf (file, ">\n%*s<", indent_level * 4, "");
2362 print_symbol_value_1 (file, exp->X_op_symbol);
2363 fprintf (file, ">");
2364 indent_level--;
2365}
2366
2367void
2368print_expr_1 (file, exp)
2369 FILE *file;
2370 expressionS *exp;
2371{
2372 fprintf (file, "expr %lx ", (long) exp);
2373 switch (exp->X_op)
2374 {
2375 case O_illegal:
2376 fprintf (file, "illegal");
2377 break;
2378 case O_absent:
2379 fprintf (file, "absent");
2380 break;
2381 case O_constant:
2382 fprintf (file, "constant %lx", (long) exp->X_add_number);
2383 break;
2384 case O_symbol:
2385 indent_level++;
2386 fprintf (file, "symbol\n%*s<", indent_level * 4, "");
2387 print_symbol_value_1 (file, exp->X_add_symbol);
2388 fprintf (file, ">");
2389 maybe_print_addnum:
2390 if (exp->X_add_number)
2391 fprintf (file, "\n%*s%lx", indent_level * 4, "",
2392 (long) exp->X_add_number);
2393 indent_level--;
2394 break;
2395 case O_register:
2396 fprintf (file, "register #%d", (int) exp->X_add_number);
2397 break;
2398 case O_big:
2399 fprintf (file, "big");
2400 break;
2401 case O_uminus:
2402 fprintf (file, "uminus -<");
2403 indent_level++;
2404 print_symbol_value_1 (file, exp->X_add_symbol);
2405 fprintf (file, ">");
2406 goto maybe_print_addnum;
2407 case O_bit_not:
2408 fprintf (file, "bit_not");
2409 break;
2410 case O_multiply:
2411 print_binary (file, "multiply", exp);
2412 break;
2413 case O_divide:
2414 print_binary (file, "divide", exp);
2415 break;
2416 case O_modulus:
2417 print_binary (file, "modulus", exp);
2418 break;
2419 case O_left_shift:
2420 print_binary (file, "lshift", exp);
2421 break;
2422 case O_right_shift:
2423 print_binary (file, "rshift", exp);
2424 break;
2425 case O_bit_inclusive_or:
2426 print_binary (file, "bit_ior", exp);
2427 break;
2428 case O_bit_exclusive_or:
2429 print_binary (file, "bit_xor", exp);
2430 break;
2431 case O_bit_and:
2432 print_binary (file, "bit_and", exp);
2433 break;
2434 case O_eq:
2435 print_binary (file, "eq", exp);
2436 break;
2437 case O_ne:
2438 print_binary (file, "ne", exp);
2439 break;
2440 case O_lt:
2441 print_binary (file, "lt", exp);
2442 break;
2443 case O_le:
2444 print_binary (file, "le", exp);
2445 break;
2446 case O_ge:
2447 print_binary (file, "ge", exp);
2448 break;
2449 case O_gt:
2450 print_binary (file, "gt", exp);
2451 break;
2452 case O_logical_and:
2453 print_binary (file, "logical_and", exp);
2454 break;
2455 case O_logical_or:
2456 print_binary (file, "logical_or", exp);
2457 break;
2458 case O_add:
2459 indent_level++;
2460 fprintf (file, "add\n%*s<", indent_level * 4, "");
2461 print_symbol_value_1 (file, exp->X_add_symbol);
2462 fprintf (file, ">\n%*s<", indent_level * 4, "");
2463 print_symbol_value_1 (file, exp->X_op_symbol);
2464 fprintf (file, ">");
2465 goto maybe_print_addnum;
2466 case O_subtract:
2467 indent_level++;
2468 fprintf (file, "subtract\n%*s<", indent_level * 4, "");
2469 print_symbol_value_1 (file, exp->X_add_symbol);
2470 fprintf (file, ">\n%*s<", indent_level * 4, "");
2471 print_symbol_value_1 (file, exp->X_op_symbol);
2472 fprintf (file, ">");
2473 goto maybe_print_addnum;
2474 default:
2475 fprintf (file, "{unknown opcode %d}", (int) exp->X_op);
2476 break;
2477 }
2478 fflush (stdout);
2479}
2480
2481void
2482print_expr (exp)
2483 expressionS *exp;
2484{
2485 print_expr_1 (stderr, exp);
2486 fprintf (stderr, "\n");
2487}
2488
2489void
2490symbol_print_statistics (file)
2491 FILE *file;
2492{
2493 hash_print_statistics (file, "symbol table", sy_hash);
49309057
ILT
2494#ifdef BFD_ASSEMBLER
2495 hash_print_statistics (file, "mini local symbol table", local_hash);
2496 fprintf (file, "%lu mini local symbols created, %lu converted\n",
2497 local_symbol_count, local_symbol_conversion_count);
2498#endif
252b5132
RH
2499}
2500
2501/* end of symbols.c */
This page took 0.378506 seconds and 4 git commands to generate.