binutils/testsuite: skip gentestdlls related tests if missing
[binutils-gdb.git] / gas / symbols.c
1 /* symbols.c -symbol table-
2 Copyright (C) 1987-2022 Free Software Foundation, Inc.
3
4 This file is part of GAS, the GNU Assembler.
5
6 GAS is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3, or (at your option)
9 any later version.
10
11 GAS is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15
16 You should have received a copy of the GNU General Public License
17 along with GAS; see the file COPYING. If not, write to the Free
18 Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
19 02110-1301, USA. */
20
21 /* #define DEBUG_SYMS / * to debug symbol list maintenance. */
22
23 #include "as.h"
24 #include "safe-ctype.h"
25 #include "obstack.h" /* For "symbols.h" */
26 #include "subsegs.h"
27 #include "write.h"
28
29 #include <limits.h>
30 #ifndef CHAR_BIT
31 #define CHAR_BIT 8
32 #endif
33
34 struct symbol_flags
35 {
36 /* Whether the symbol is a local_symbol. */
37 unsigned int local_symbol : 1;
38
39 /* Weather symbol has been written. */
40 unsigned int written : 1;
41
42 /* Whether symbol value has been completely resolved (used during
43 final pass over symbol table). */
44 unsigned int resolved : 1;
45
46 /* Whether the symbol value is currently being resolved (used to
47 detect loops in symbol dependencies). */
48 unsigned int resolving : 1;
49
50 /* Whether the symbol value is used in a reloc. This is used to
51 ensure that symbols used in relocs are written out, even if they
52 are local and would otherwise not be. */
53 unsigned int used_in_reloc : 1;
54
55 /* Whether the symbol is used as an operand or in an expression.
56 NOTE: Not all the backends keep this information accurate;
57 backends which use this bit are responsible for setting it when
58 a symbol is used in backend routines. */
59 unsigned int used : 1;
60
61 /* Whether the symbol can be re-defined. */
62 unsigned int volatil : 1;
63
64 /* Whether the symbol is a forward reference, and whether such has
65 been determined. */
66 unsigned int forward_ref : 1;
67 unsigned int forward_resolved : 1;
68
69 /* This is set if the symbol is defined in an MRI common section.
70 We handle such sections as single common symbols, so symbols
71 defined within them must be treated specially by the relocation
72 routines. */
73 unsigned int mri_common : 1;
74
75 /* This is set if the symbol is set with a .weakref directive. */
76 unsigned int weakrefr : 1;
77
78 /* This is set when the symbol is referenced as part of a .weakref
79 directive, but only if the symbol was not in the symbol table
80 before. It is cleared as soon as any direct reference to the
81 symbol is present. */
82 unsigned int weakrefd : 1;
83
84 /* Whether the symbol has been marked to be removed by a .symver
85 directive. */
86 unsigned int removed : 1;
87
88 /* Set when a warning about the symbol containing multibyte characters
89 is generated. */
90 unsigned int multibyte_warned : 1;
91 };
92
93 /* A pointer in the symbol may point to either a complete symbol
94 (struct symbol below) or to a local symbol (struct local_symbol
95 defined here). The symbol code can detect the case by examining
96 the first field which is present in both structs.
97
98 We do this because we ordinarily only need a small amount of
99 information for a local symbol. The symbol table takes up a lot of
100 space, and storing less information for a local symbol can make a
101 big difference in assembler memory usage when assembling a large
102 file. */
103
104 struct local_symbol
105 {
106 /* Symbol flags. Only local_symbol and resolved are relevant. */
107 struct symbol_flags flags;
108
109 /* Hash value calculated from name. */
110 hashval_t hash;
111
112 /* The symbol name. */
113 const char *name;
114
115 /* The symbol frag. */
116 fragS *frag;
117
118 /* The symbol section. */
119 asection *section;
120
121 /* The value of the symbol. */
122 valueT value;
123 };
124
125 /* The information we keep for a symbol. The symbol table holds
126 pointers both to this and to local_symbol structures. The first
127 three fields must be identical to struct local_symbol, and the size
128 should be the same as or smaller than struct local_symbol.
129 Fields that don't fit go to an extension structure. */
130
131 struct symbol
132 {
133 /* Symbol flags. */
134 struct symbol_flags flags;
135
136 /* Hash value calculated from name. */
137 hashval_t hash;
138
139 /* The symbol name. */
140 const char *name;
141
142 /* Pointer to the frag this symbol is attached to, if any.
143 Otherwise, NULL. */
144 fragS *frag;
145
146 /* BFD symbol */
147 asymbol *bsym;
148
149 /* Extra symbol fields that won't fit. */
150 struct xsymbol *x;
151 };
152
153 /* Extra fields to make up a full symbol. */
154
155 struct xsymbol
156 {
157 /* The value of the symbol. */
158 expressionS value;
159
160 /* Forwards and backwards chain pointers. */
161 struct symbol *next;
162 struct symbol *previous;
163
164 #ifdef OBJ_SYMFIELD_TYPE
165 OBJ_SYMFIELD_TYPE obj;
166 #endif
167
168 #ifdef TC_SYMFIELD_TYPE
169 TC_SYMFIELD_TYPE tc;
170 #endif
171 };
172
173 typedef union symbol_entry
174 {
175 struct local_symbol lsy;
176 struct symbol sy;
177 } symbol_entry_t;
178
179 /* Hash function for a symbol_entry. */
180
181 static hashval_t
182 hash_symbol_entry (const void *e)
183 {
184 symbol_entry_t *entry = (symbol_entry_t *) e;
185 if (entry->sy.hash == 0)
186 entry->sy.hash = htab_hash_string (entry->sy.name);
187
188 return entry->sy.hash;
189 }
190
191 /* Equality function for a symbol_entry. */
192
193 static int
194 eq_symbol_entry (const void *a, const void *b)
195 {
196 const symbol_entry_t *ea = (const symbol_entry_t *) a;
197 const symbol_entry_t *eb = (const symbol_entry_t *) b;
198
199 return (ea->sy.hash == eb->sy.hash
200 && strcmp (ea->sy.name, eb->sy.name) == 0);
201 }
202
203 static void *
204 symbol_entry_find (htab_t table, const char *name)
205 {
206 hashval_t hash = htab_hash_string (name);
207 symbol_entry_t needle = { { { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
208 hash, name, 0, 0, 0 } };
209 return htab_find_with_hash (table, &needle, hash);
210 }
211
212
213 /* This is non-zero if symbols are case sensitive, which is the
214 default. */
215 int symbols_case_sensitive = 1;
216
217 #ifndef WORKING_DOT_WORD
218 extern int new_broken_words;
219 #endif
220
221 static htab_t sy_hash;
222
223 /* Below are commented in "symbols.h". */
224 symbolS *symbol_rootP;
225 symbolS *symbol_lastP;
226 symbolS abs_symbol;
227 struct xsymbol abs_symbol_x;
228 symbolS dot_symbol;
229 struct xsymbol dot_symbol_x;
230
231 #ifdef DEBUG_SYMS
232 #define debug_verify_symchain verify_symbol_chain
233 #else
234 #define debug_verify_symchain(root, last) ((void) 0)
235 #endif
236
237 #define DOLLAR_LABEL_CHAR '\001'
238 #define LOCAL_LABEL_CHAR '\002'
239
240 #ifndef TC_LABEL_IS_LOCAL
241 #define TC_LABEL_IS_LOCAL(name) 0
242 #endif
243
244 struct obstack notes;
245
246 /* Utility functions to allocate and duplicate memory on the notes
247 obstack, each like the corresponding function without "notes_"
248 prefix. All of these exit on an allocation failure. */
249
250 void *
251 notes_alloc (size_t size)
252 {
253 return obstack_alloc (&notes, size);
254 }
255
256 void *
257 notes_calloc (size_t n, size_t size)
258 {
259 size_t amt;
260 void *ret;
261 if (gas_mul_overflow (n, size, &amt))
262 {
263 obstack_alloc_failed_handler ();
264 abort ();
265 }
266 ret = notes_alloc (amt);
267 memset (ret, 0, amt);
268 return ret;
269 }
270
271 void *
272 notes_memdup (const void *src, size_t copy_size, size_t alloc_size)
273 {
274 void *ret = obstack_alloc (&notes, alloc_size);
275 memcpy (ret, src, copy_size);
276 if (alloc_size > copy_size)
277 memset ((char *) ret + copy_size, 0, alloc_size - copy_size);
278 return ret;
279 }
280
281 char *
282 notes_strdup (const char *str)
283 {
284 size_t len = strlen (str) + 1;
285 return notes_memdup (str, len, len);
286 }
287
288 char *
289 notes_concat (const char *first, ...)
290 {
291 va_list args;
292 const char *str;
293
294 va_start (args, first);
295 for (str = first; str; str = va_arg (args, const char *))
296 {
297 size_t size = strlen (str);
298 obstack_grow (&notes, str, size);
299 }
300 va_end (args);
301 obstack_1grow (&notes, 0);
302 return obstack_finish (&notes);
303 }
304
305 /* Use with caution! Frees PTR and all more recently allocated memory
306 on the notes obstack. */
307
308 void
309 notes_free (void *ptr)
310 {
311 obstack_free (&notes, ptr);
312 }
313
314 #ifdef TE_PE
315 /* The name of an external symbol which is
316 used to make weak PE symbol names unique. */
317 const char * an_external_name;
318 #endif
319
320 /* Return a pointer to a new symbol. Die if we can't make a new
321 symbol. Fill in the symbol's values. Add symbol to end of symbol
322 chain.
323
324 This function should be called in the general case of creating a
325 symbol. However, if the output file symbol table has already been
326 set, and you are certain that this symbol won't be wanted in the
327 output file, you can call symbol_create. */
328
329 symbolS *
330 symbol_new (const char *name, segT segment, fragS *frag, valueT valu)
331 {
332 symbolS *symbolP = symbol_create (name, segment, frag, valu);
333
334 /* Link to end of symbol chain. */
335 symbol_append (symbolP, symbol_lastP, &symbol_rootP, &symbol_lastP);
336
337 return symbolP;
338 }
339
340 /* Save a symbol name on a permanent obstack, and convert it according
341 to the object file format. */
342
343 static const char *
344 save_symbol_name (const char *name)
345 {
346 char *ret;
347
348 gas_assert (name != NULL);
349 ret = notes_strdup (name);
350
351 #ifdef tc_canonicalize_symbol_name
352 ret = tc_canonicalize_symbol_name (ret);
353 #endif
354
355 if (! symbols_case_sensitive)
356 {
357 char *s;
358
359 for (s = ret; *s != '\0'; s++)
360 *s = TOUPPER (*s);
361 }
362
363 return ret;
364 }
365
366 static void
367 symbol_init (symbolS *symbolP, const char *name, asection *sec,
368 fragS *frag, valueT valu)
369 {
370 symbolP->frag = frag;
371 symbolP->bsym = bfd_make_empty_symbol (stdoutput);
372 if (symbolP->bsym == NULL)
373 as_fatal ("bfd_make_empty_symbol: %s", bfd_errmsg (bfd_get_error ()));
374 symbolP->bsym->name = name;
375 symbolP->bsym->section = sec;
376
377 if (multibyte_handling == multibyte_warn_syms
378 && ! symbolP->flags.local_symbol
379 && sec != undefined_section
380 && ! symbolP->flags.multibyte_warned
381 && scan_for_multibyte_characters ((const unsigned char *) name,
382 (const unsigned char *) name + strlen (name),
383 false /* Do not warn. */))
384 {
385 as_warn (_("symbol '%s' contains multibyte characters"), name);
386 symbolP->flags.multibyte_warned = 1;
387 }
388
389 S_SET_VALUE (symbolP, valu);
390
391 symbol_clear_list_pointers (symbolP);
392
393 obj_symbol_new_hook (symbolP);
394
395 #ifdef tc_symbol_new_hook
396 tc_symbol_new_hook (symbolP);
397 #endif
398 }
399
400 /* Create a symbol. NAME is copied, the caller can destroy/modify. */
401
402 symbolS *
403 symbol_create (const char *name, segT segment, fragS *frag, valueT valu)
404 {
405 const char *preserved_copy_of_name;
406 symbolS *symbolP;
407 size_t size;
408
409 preserved_copy_of_name = save_symbol_name (name);
410
411 size = sizeof (symbolS) + sizeof (struct xsymbol);
412 symbolP = notes_alloc (size);
413
414 /* symbol must be born in some fixed state. This seems as good as any. */
415 memset (symbolP, 0, size);
416 symbolP->name = preserved_copy_of_name;
417 symbolP->x = (struct xsymbol *) (symbolP + 1);
418
419 symbol_init (symbolP, preserved_copy_of_name, segment, frag, valu);
420
421 return symbolP;
422 }
423 \f
424
425 /* Local symbol support. If we can get away with it, we keep only a
426 small amount of information for local symbols. */
427
428 /* Used for statistics. */
429
430 static unsigned long local_symbol_count;
431 static unsigned long local_symbol_conversion_count;
432
433 /* Create a local symbol and insert it into the local hash table. */
434
435 struct local_symbol *
436 local_symbol_make (const char *name, segT section, fragS *frag, valueT val)
437 {
438 const char *name_copy;
439 struct local_symbol *ret;
440 struct symbol_flags flags = { .local_symbol = 1, .resolved = 0 };
441
442 ++local_symbol_count;
443
444 name_copy = save_symbol_name (name);
445
446 ret = notes_alloc (sizeof *ret);
447 ret->flags = flags;
448 ret->hash = 0;
449 ret->name = name_copy;
450 ret->frag = frag;
451 ret->section = section;
452 ret->value = val;
453
454 htab_insert (sy_hash, ret, 1);
455
456 return ret;
457 }
458
459 /* Convert a local symbol into a real symbol. */
460
461 static symbolS *
462 local_symbol_convert (void *sym)
463 {
464 symbol_entry_t *ent = (symbol_entry_t *) sym;
465 struct xsymbol *xtra;
466 valueT val;
467
468 gas_assert (ent->lsy.flags.local_symbol);
469
470 ++local_symbol_conversion_count;
471
472 xtra = notes_alloc (sizeof (*xtra));
473 memset (xtra, 0, sizeof (*xtra));
474 val = ent->lsy.value;
475 ent->sy.x = xtra;
476
477 /* Local symbols are always either defined or used. */
478 ent->sy.flags.used = 1;
479 ent->sy.flags.local_symbol = 0;
480
481 symbol_init (&ent->sy, ent->lsy.name, ent->lsy.section, ent->lsy.frag, val);
482 symbol_append (&ent->sy, symbol_lastP, &symbol_rootP, &symbol_lastP);
483
484 return &ent->sy;
485 }
486 \f
487 static void
488 define_sym_at_dot (symbolS *symbolP)
489 {
490 symbolP->frag = frag_now;
491 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
492 S_SET_SEGMENT (symbolP, now_seg);
493 }
494
495 /* We have just seen "<name>:".
496 Creates a struct symbol unless it already exists.
497
498 Gripes if we are redefining a symbol incompatibly (and ignores it). */
499
500 symbolS *
501 colon (/* Just seen "x:" - rattle symbols & frags. */
502 const char *sym_name /* Symbol name, as a canonical string. */
503 /* We copy this string: OK to alter later. */)
504 {
505 symbolS *symbolP; /* Symbol we are working with. */
506
507 /* Sun local labels go out of scope whenever a non-local symbol is
508 defined. */
509 if (LOCAL_LABELS_DOLLAR
510 && !bfd_is_local_label_name (stdoutput, sym_name))
511 dollar_label_clear ();
512
513 #ifndef WORKING_DOT_WORD
514 if (new_broken_words)
515 {
516 struct broken_word *a;
517 int possible_bytes;
518 fragS *frag_tmp;
519 char *frag_opcode;
520
521 if (now_seg == absolute_section)
522 {
523 as_bad (_("cannot define symbol `%s' in absolute section"), sym_name);
524 return NULL;
525 }
526
527 possible_bytes = (md_short_jump_size
528 + new_broken_words * md_long_jump_size);
529
530 frag_tmp = frag_now;
531 frag_opcode = frag_var (rs_broken_word,
532 possible_bytes,
533 possible_bytes,
534 (relax_substateT) 0,
535 (symbolS *) broken_words,
536 (offsetT) 0,
537 NULL);
538
539 /* We want to store the pointer to where to insert the jump
540 table in the fr_opcode of the rs_broken_word frag. This
541 requires a little hackery. */
542 while (frag_tmp
543 && (frag_tmp->fr_type != rs_broken_word
544 || frag_tmp->fr_opcode))
545 frag_tmp = frag_tmp->fr_next;
546 know (frag_tmp);
547 frag_tmp->fr_opcode = frag_opcode;
548 new_broken_words = 0;
549
550 for (a = broken_words; a && a->dispfrag == 0; a = a->next_broken_word)
551 a->dispfrag = frag_tmp;
552 }
553 #endif /* WORKING_DOT_WORD */
554
555 #ifdef obj_frob_colon
556 obj_frob_colon (sym_name);
557 #endif
558
559 if ((symbolP = symbol_find (sym_name)) != 0)
560 {
561 S_CLEAR_WEAKREFR (symbolP);
562 #ifdef RESOLVE_SYMBOL_REDEFINITION
563 if (RESOLVE_SYMBOL_REDEFINITION (symbolP))
564 return symbolP;
565 #endif
566 /* Now check for undefined symbols. */
567 if (symbolP->flags.local_symbol)
568 {
569 struct local_symbol *locsym = (struct local_symbol *) symbolP;
570
571 if (locsym->section != undefined_section
572 && (locsym->frag != frag_now
573 || locsym->section != now_seg
574 || locsym->value != frag_now_fix ()))
575 {
576 as_bad (_("symbol `%s' is already defined"), sym_name);
577 return symbolP;
578 }
579
580 locsym->section = now_seg;
581 locsym->frag = frag_now;
582 locsym->value = frag_now_fix ();
583 }
584 else if (!(S_IS_DEFINED (symbolP) || symbol_equated_p (symbolP))
585 || S_IS_COMMON (symbolP)
586 || S_IS_VOLATILE (symbolP))
587 {
588 if (S_IS_VOLATILE (symbolP))
589 {
590 symbolP = symbol_clone (symbolP, 1);
591 S_SET_VALUE (symbolP, 0);
592 S_CLEAR_VOLATILE (symbolP);
593 }
594 if (S_GET_VALUE (symbolP) == 0)
595 {
596 define_sym_at_dot (symbolP);
597 #ifdef N_UNDF
598 know (N_UNDF == 0);
599 #endif /* if we have one, it better be zero. */
600
601 }
602 else
603 {
604 /* There are still several cases to check:
605
606 A .comm/.lcomm symbol being redefined as initialized
607 data is OK
608
609 A .comm/.lcomm symbol being redefined with a larger
610 size is also OK
611
612 This only used to be allowed on VMS gas, but Sun cc
613 on the sparc also depends on it. */
614
615 if (((!S_IS_DEBUG (symbolP)
616 && (!S_IS_DEFINED (symbolP) || S_IS_COMMON (symbolP))
617 && S_IS_EXTERNAL (symbolP))
618 || S_GET_SEGMENT (symbolP) == bss_section)
619 && (now_seg == data_section
620 || now_seg == bss_section
621 || now_seg == S_GET_SEGMENT (symbolP)))
622 {
623 /* Select which of the 2 cases this is. */
624 if (now_seg != data_section)
625 {
626 /* New .comm for prev .comm symbol.
627
628 If the new size is larger we just change its
629 value. If the new size is smaller, we ignore
630 this symbol. */
631 if (S_GET_VALUE (symbolP)
632 < ((unsigned) frag_now_fix ()))
633 {
634 S_SET_VALUE (symbolP, (valueT) frag_now_fix ());
635 }
636 }
637 else
638 {
639 /* It is a .comm/.lcomm being converted to initialized
640 data. */
641 define_sym_at_dot (symbolP);
642 }
643 }
644 else
645 {
646 #if (!defined (OBJ_AOUT) && !defined (OBJ_MAYBE_AOUT))
647 static const char *od_buf = "";
648 #else
649 char od_buf[100];
650 od_buf[0] = '\0';
651 if (OUTPUT_FLAVOR == bfd_target_aout_flavour)
652 sprintf (od_buf, "%d.%d.",
653 S_GET_OTHER (symbolP),
654 S_GET_DESC (symbolP));
655 #endif
656 as_bad (_("symbol `%s' is already defined as \"%s\"/%s%ld"),
657 sym_name,
658 segment_name (S_GET_SEGMENT (symbolP)),
659 od_buf,
660 (long) S_GET_VALUE (symbolP));
661 }
662 } /* if the undefined symbol has no value */
663 }
664 else
665 {
666 /* Don't blow up if the definition is the same. */
667 if (!(frag_now == symbolP->frag
668 && S_GET_VALUE (symbolP) == frag_now_fix ()
669 && S_GET_SEGMENT (symbolP) == now_seg))
670 {
671 as_bad (_("symbol `%s' is already defined"), sym_name);
672 symbolP = symbol_clone (symbolP, 0);
673 define_sym_at_dot (symbolP);
674 }
675 }
676
677 }
678 else if (! flag_keep_locals && bfd_is_local_label_name (stdoutput, sym_name))
679 {
680 symbolP = (symbolS *) local_symbol_make (sym_name, now_seg, frag_now,
681 frag_now_fix ());
682 }
683 else
684 {
685 symbolP = symbol_new (sym_name, now_seg, frag_now, frag_now_fix ());
686
687 symbol_table_insert (symbolP);
688 }
689
690 if (mri_common_symbol != NULL)
691 {
692 /* This symbol is actually being defined within an MRI common
693 section. This requires special handling. */
694 if (symbolP->flags.local_symbol)
695 symbolP = local_symbol_convert (symbolP);
696 symbolP->x->value.X_op = O_symbol;
697 symbolP->x->value.X_add_symbol = mri_common_symbol;
698 symbolP->x->value.X_add_number = S_GET_VALUE (mri_common_symbol);
699 symbolP->frag = &zero_address_frag;
700 S_SET_SEGMENT (symbolP, expr_section);
701 symbolP->flags.mri_common = 1;
702 }
703
704 #ifdef tc_frob_label
705 tc_frob_label (symbolP);
706 #endif
707 #ifdef obj_frob_label
708 obj_frob_label (symbolP);
709 #endif
710
711 return symbolP;
712 }
713 \f
714 /* Die if we can't insert the symbol. */
715
716 void
717 symbol_table_insert (symbolS *symbolP)
718 {
719 know (symbolP);
720
721 htab_insert (sy_hash, symbolP, 1);
722 }
723 \f
724 /* If a symbol name does not exist, create it as undefined, and insert
725 it into the symbol table. Return a pointer to it. */
726
727 symbolS *
728 symbol_find_or_make (const char *name)
729 {
730 symbolS *symbolP;
731
732 symbolP = symbol_find (name);
733
734 if (symbolP == NULL)
735 {
736 if (! flag_keep_locals && bfd_is_local_label_name (stdoutput, name))
737 {
738 symbolP = md_undefined_symbol ((char *) name);
739 if (symbolP != NULL)
740 return symbolP;
741
742 symbolP = (symbolS *) local_symbol_make (name, undefined_section,
743 &zero_address_frag, 0);
744 return symbolP;
745 }
746
747 symbolP = symbol_make (name);
748
749 symbol_table_insert (symbolP);
750 } /* if symbol wasn't found */
751
752 return (symbolP);
753 }
754
755 symbolS *
756 symbol_make (const char *name)
757 {
758 symbolS *symbolP;
759
760 /* Let the machine description default it, e.g. for register names. */
761 symbolP = md_undefined_symbol ((char *) name);
762
763 if (!symbolP)
764 symbolP = symbol_new (name, undefined_section, &zero_address_frag, 0);
765
766 return (symbolP);
767 }
768
769 symbolS *
770 symbol_clone (symbolS *orgsymP, int replace)
771 {
772 symbolS *newsymP;
773 asymbol *bsymorg, *bsymnew;
774
775 /* Make sure we never clone the dot special symbol. */
776 gas_assert (orgsymP != &dot_symbol);
777
778 /* When cloning a local symbol it isn't absolutely necessary to
779 convert the original, but converting makes the code much
780 simpler to cover this unexpected case. As of 2020-08-21
781 symbol_clone won't be called on a local symbol. */
782 if (orgsymP->flags.local_symbol)
783 orgsymP = local_symbol_convert (orgsymP);
784 bsymorg = orgsymP->bsym;
785
786 newsymP = notes_alloc (sizeof (symbolS) + sizeof (struct xsymbol));
787 *newsymP = *orgsymP;
788 newsymP->x = (struct xsymbol *) (newsymP + 1);
789 *newsymP->x = *orgsymP->x;
790 bsymnew = bfd_make_empty_symbol (bfd_asymbol_bfd (bsymorg));
791 if (bsymnew == NULL)
792 as_fatal ("bfd_make_empty_symbol: %s", bfd_errmsg (bfd_get_error ()));
793 newsymP->bsym = bsymnew;
794 bsymnew->name = bsymorg->name;
795 bsymnew->flags = bsymorg->flags & ~BSF_SECTION_SYM;
796 bsymnew->section = bsymorg->section;
797 bfd_copy_private_symbol_data (bfd_asymbol_bfd (bsymorg), bsymorg,
798 bfd_asymbol_bfd (bsymnew), bsymnew);
799
800 #ifdef obj_symbol_clone_hook
801 obj_symbol_clone_hook (newsymP, orgsymP);
802 #endif
803
804 #ifdef tc_symbol_clone_hook
805 tc_symbol_clone_hook (newsymP, orgsymP);
806 #endif
807
808 if (replace)
809 {
810 if (symbol_rootP == orgsymP)
811 symbol_rootP = newsymP;
812 else if (orgsymP->x->previous)
813 {
814 orgsymP->x->previous->x->next = newsymP;
815 orgsymP->x->previous = NULL;
816 }
817 if (symbol_lastP == orgsymP)
818 symbol_lastP = newsymP;
819 else if (orgsymP->x->next)
820 orgsymP->x->next->x->previous = newsymP;
821
822 /* Symbols that won't be output can't be external. */
823 S_CLEAR_EXTERNAL (orgsymP);
824 orgsymP->x->previous = orgsymP->x->next = orgsymP;
825 debug_verify_symchain (symbol_rootP, symbol_lastP);
826
827 symbol_table_insert (newsymP);
828 }
829 else
830 {
831 /* Symbols that won't be output can't be external. */
832 S_CLEAR_EXTERNAL (newsymP);
833 newsymP->x->previous = newsymP->x->next = newsymP;
834 }
835
836 return newsymP;
837 }
838
839 /* Referenced symbols, if they are forward references, need to be cloned
840 (without replacing the original) so that the value of the referenced
841 symbols at the point of use is saved by the clone. */
842
843 #undef symbol_clone_if_forward_ref
844 symbolS *
845 symbol_clone_if_forward_ref (symbolS *symbolP, int is_forward)
846 {
847 if (symbolP
848 && !symbolP->flags.local_symbol
849 && !symbolP->flags.forward_resolved)
850 {
851 symbolS *orig_add_symbol = symbolP->x->value.X_add_symbol;
852 symbolS *orig_op_symbol = symbolP->x->value.X_op_symbol;
853 symbolS *add_symbol = orig_add_symbol;
854 symbolS *op_symbol = orig_op_symbol;
855
856 if (symbolP->flags.forward_ref)
857 is_forward = 1;
858
859 if (is_forward)
860 {
861 /* assign_symbol() clones volatile symbols; pre-existing expressions
862 hold references to the original instance, but want the current
863 value. Just repeat the lookup. */
864 if (add_symbol && S_IS_VOLATILE (add_symbol))
865 add_symbol = symbol_find_exact (S_GET_NAME (add_symbol));
866 if (op_symbol && S_IS_VOLATILE (op_symbol))
867 op_symbol = symbol_find_exact (S_GET_NAME (op_symbol));
868 }
869
870 /* Re-using resolving here, as this routine cannot get called from
871 symbol resolution code. */
872 if ((symbolP->bsym->section == expr_section
873 || symbolP->flags.forward_ref)
874 && !symbolP->flags.resolving)
875 {
876 symbolP->flags.resolving = 1;
877 add_symbol = symbol_clone_if_forward_ref (add_symbol, is_forward);
878 op_symbol = symbol_clone_if_forward_ref (op_symbol, is_forward);
879 symbolP->flags.resolving = 0;
880 }
881
882 if (symbolP->flags.forward_ref
883 || add_symbol != orig_add_symbol
884 || op_symbol != orig_op_symbol)
885 {
886 if (symbolP != &dot_symbol)
887 {
888 symbolP = symbol_clone (symbolP, 0);
889 symbolP->flags.resolving = 0;
890 }
891 else
892 {
893 symbolP = symbol_temp_new_now ();
894 #ifdef tc_new_dot_label
895 tc_new_dot_label (symbolP);
896 #endif
897 }
898 }
899
900 symbolP->x->value.X_add_symbol = add_symbol;
901 symbolP->x->value.X_op_symbol = op_symbol;
902 symbolP->flags.forward_resolved = 1;
903 }
904
905 return symbolP;
906 }
907
908 symbolS *
909 symbol_temp_new (segT seg, fragS *frag, valueT ofs)
910 {
911 return symbol_new (FAKE_LABEL_NAME, seg, frag, ofs);
912 }
913
914 symbolS *
915 symbol_temp_new_now (void)
916 {
917 return symbol_temp_new (now_seg, frag_now, frag_now_fix ());
918 }
919
920 symbolS *
921 symbol_temp_new_now_octets (void)
922 {
923 return symbol_temp_new (now_seg, frag_now, frag_now_fix_octets ());
924 }
925
926 symbolS *
927 symbol_temp_make (void)
928 {
929 return symbol_make (FAKE_LABEL_NAME);
930 }
931
932 /* Implement symbol table lookup.
933 In: A symbol's name as a string: '\0' can't be part of a symbol name.
934 Out: NULL if the name was not in the symbol table, else the address
935 of a struct symbol associated with that name. */
936
937 symbolS *
938 symbol_find_exact (const char *name)
939 {
940 return symbol_find_exact_noref (name, 0);
941 }
942
943 symbolS *
944 symbol_find_exact_noref (const char *name, int noref)
945 {
946 symbolS *sym = symbol_entry_find (sy_hash, name);
947
948 /* Any references to the symbol, except for the reference in
949 .weakref, must clear this flag, such that the symbol does not
950 turn into a weak symbol. Note that we don't have to handle the
951 local_symbol case, since a weakrefd is always promoted out of the
952 local_symbol table when it is turned into a weak symbol. */
953 if (sym && ! noref)
954 S_CLEAR_WEAKREFD (sym);
955
956 return sym;
957 }
958
959 symbolS *
960 symbol_find (const char *name)
961 {
962 return symbol_find_noref (name, 0);
963 }
964
965 symbolS *
966 symbol_find_noref (const char *name, int noref)
967 {
968 symbolS * result;
969 char * copy = NULL;
970
971 #ifdef tc_canonicalize_symbol_name
972 {
973 copy = xstrdup (name);
974 name = tc_canonicalize_symbol_name (copy);
975 }
976 #endif
977
978 if (! symbols_case_sensitive)
979 {
980 const char *orig;
981 char *copy2 = NULL;
982 unsigned char c;
983
984 orig = name;
985 if (copy != NULL)
986 copy2 = copy;
987 name = copy = XNEWVEC (char, strlen (name) + 1);
988
989 while ((c = *orig++) != '\0')
990 *copy++ = TOUPPER (c);
991 *copy = '\0';
992
993 free (copy2);
994 copy = (char *) name;
995 }
996
997 result = symbol_find_exact_noref (name, noref);
998 free (copy);
999 return result;
1000 }
1001
1002 /* Once upon a time, symbols were kept in a singly linked list. At
1003 least coff needs to be able to rearrange them from time to time, for
1004 which a doubly linked list is much more convenient. Loic did these
1005 as macros which seemed dangerous to me so they're now functions.
1006 xoxorich. */
1007
1008 /* Link symbol ADDME after symbol TARGET in the chain. */
1009
1010 void
1011 symbol_append (symbolS *addme, symbolS *target,
1012 symbolS **rootPP, symbolS **lastPP)
1013 {
1014 extern int symbol_table_frozen;
1015 if (symbol_table_frozen)
1016 abort ();
1017 if (addme->flags.local_symbol)
1018 abort ();
1019 if (target != NULL && target->flags.local_symbol)
1020 abort ();
1021
1022 if (target == NULL)
1023 {
1024 know (*rootPP == NULL);
1025 know (*lastPP == NULL);
1026 addme->x->next = NULL;
1027 addme->x->previous = NULL;
1028 *rootPP = addme;
1029 *lastPP = addme;
1030 return;
1031 } /* if the list is empty */
1032
1033 if (target->x->next != NULL)
1034 {
1035 target->x->next->x->previous = addme;
1036 }
1037 else
1038 {
1039 know (*lastPP == target);
1040 *lastPP = addme;
1041 } /* if we have a next */
1042
1043 addme->x->next = target->x->next;
1044 target->x->next = addme;
1045 addme->x->previous = target;
1046
1047 debug_verify_symchain (symbol_rootP, symbol_lastP);
1048 }
1049
1050 /* Set the chain pointers of SYMBOL to null. */
1051
1052 void
1053 symbol_clear_list_pointers (symbolS *symbolP)
1054 {
1055 if (symbolP->flags.local_symbol)
1056 abort ();
1057 symbolP->x->next = NULL;
1058 symbolP->x->previous = NULL;
1059 }
1060
1061 /* Remove SYMBOLP from the list. */
1062
1063 void
1064 symbol_remove (symbolS *symbolP, symbolS **rootPP, symbolS **lastPP)
1065 {
1066 if (symbolP->flags.local_symbol)
1067 abort ();
1068
1069 if (symbolP == *rootPP)
1070 {
1071 *rootPP = symbolP->x->next;
1072 } /* if it was the root */
1073
1074 if (symbolP == *lastPP)
1075 {
1076 *lastPP = symbolP->x->previous;
1077 } /* if it was the tail */
1078
1079 if (symbolP->x->next != NULL)
1080 {
1081 symbolP->x->next->x->previous = symbolP->x->previous;
1082 } /* if not last */
1083
1084 if (symbolP->x->previous != NULL)
1085 {
1086 symbolP->x->previous->x->next = symbolP->x->next;
1087 } /* if not first */
1088
1089 debug_verify_symchain (*rootPP, *lastPP);
1090 }
1091
1092 /* Link symbol ADDME before symbol TARGET in the chain. */
1093
1094 void
1095 symbol_insert (symbolS *addme, symbolS *target,
1096 symbolS **rootPP, symbolS **lastPP ATTRIBUTE_UNUSED)
1097 {
1098 extern int symbol_table_frozen;
1099 if (symbol_table_frozen)
1100 abort ();
1101 if (addme->flags.local_symbol)
1102 abort ();
1103 if (target->flags.local_symbol)
1104 abort ();
1105
1106 if (target->x->previous != NULL)
1107 {
1108 target->x->previous->x->next = addme;
1109 }
1110 else
1111 {
1112 know (*rootPP == target);
1113 *rootPP = addme;
1114 } /* if not first */
1115
1116 addme->x->previous = target->x->previous;
1117 target->x->previous = addme;
1118 addme->x->next = target;
1119
1120 debug_verify_symchain (*rootPP, *lastPP);
1121 }
1122
1123 void
1124 verify_symbol_chain (symbolS *rootP, symbolS *lastP)
1125 {
1126 symbolS *symbolP = rootP;
1127
1128 if (symbolP == NULL)
1129 return;
1130
1131 for (; symbol_next (symbolP) != NULL; symbolP = symbol_next (symbolP))
1132 {
1133 gas_assert (symbolP->bsym != NULL);
1134 gas_assert (symbolP->flags.local_symbol == 0);
1135 gas_assert (symbolP->x->next->x->previous == symbolP);
1136 }
1137
1138 gas_assert (lastP == symbolP);
1139 }
1140
1141 int
1142 symbol_on_chain (symbolS *s, symbolS *rootPP, symbolS *lastPP)
1143 {
1144 return (!s->flags.local_symbol
1145 && ((s->x->next != s
1146 && s->x->next != NULL
1147 && s->x->next->x->previous == s)
1148 || s == lastPP)
1149 && ((s->x->previous != s
1150 && s->x->previous != NULL
1151 && s->x->previous->x->next == s)
1152 || s == rootPP));
1153 }
1154
1155 #ifdef OBJ_COMPLEX_RELC
1156
1157 static int
1158 use_complex_relocs_for (symbolS * symp)
1159 {
1160 switch (symp->x->value.X_op)
1161 {
1162 case O_constant:
1163 return 0;
1164
1165 case O_multiply:
1166 case O_divide:
1167 case O_modulus:
1168 case O_left_shift:
1169 case O_right_shift:
1170 case O_bit_inclusive_or:
1171 case O_bit_or_not:
1172 case O_bit_exclusive_or:
1173 case O_bit_and:
1174 case O_add:
1175 case O_subtract:
1176 case O_eq:
1177 case O_ne:
1178 case O_lt:
1179 case O_le:
1180 case O_ge:
1181 case O_gt:
1182 case O_logical_and:
1183 case O_logical_or:
1184 if ((S_IS_COMMON (symp->x->value.X_op_symbol)
1185 || S_IS_LOCAL (symp->x->value.X_op_symbol))
1186 && S_IS_DEFINED (symp->x->value.X_op_symbol)
1187 && S_GET_SEGMENT (symp->x->value.X_op_symbol) != expr_section)
1188 {
1189 case O_symbol:
1190 case O_symbol_rva:
1191 case O_uminus:
1192 case O_bit_not:
1193 case O_logical_not:
1194 if ((S_IS_COMMON (symp->x->value.X_add_symbol)
1195 || S_IS_LOCAL (symp->x->value.X_add_symbol))
1196 && S_IS_DEFINED (symp->x->value.X_add_symbol)
1197 && S_GET_SEGMENT (symp->x->value.X_add_symbol) != expr_section)
1198 return 0;
1199 }
1200 break;
1201
1202 default:
1203 break;
1204 }
1205 return 1;
1206 }
1207 #endif
1208
1209 static void
1210 report_op_error (symbolS *symp, symbolS *left, operatorT op, symbolS *right)
1211 {
1212 const char *file;
1213 unsigned int line;
1214 segT seg_left = left ? S_GET_SEGMENT (left) : 0;
1215 segT seg_right = S_GET_SEGMENT (right);
1216 const char *opname;
1217
1218 switch (op)
1219 {
1220 default:
1221 abort ();
1222 return;
1223
1224 case O_uminus: opname = "-"; break;
1225 case O_bit_not: opname = "~"; break;
1226 case O_logical_not: opname = "!"; break;
1227 case O_multiply: opname = "*"; break;
1228 case O_divide: opname = "/"; break;
1229 case O_modulus: opname = "%"; break;
1230 case O_left_shift: opname = "<<"; break;
1231 case O_right_shift: opname = ">>"; break;
1232 case O_bit_inclusive_or: opname = "|"; break;
1233 case O_bit_or_not: opname = "|~"; break;
1234 case O_bit_exclusive_or: opname = "^"; break;
1235 case O_bit_and: opname = "&"; break;
1236 case O_add: opname = "+"; break;
1237 case O_subtract: opname = "-"; break;
1238 case O_eq: opname = "=="; break;
1239 case O_ne: opname = "!="; break;
1240 case O_lt: opname = "<"; break;
1241 case O_le: opname = "<="; break;
1242 case O_ge: opname = ">="; break;
1243 case O_gt: opname = ">"; break;
1244 case O_logical_and: opname = "&&"; break;
1245 case O_logical_or: opname = "||"; break;
1246 }
1247
1248 if (expr_symbol_where (symp, &file, &line))
1249 {
1250 if (left)
1251 as_bad_where (file, line,
1252 _("invalid operands (%s and %s sections) for `%s'"),
1253 seg_left->name, seg_right->name, opname);
1254 else
1255 as_bad_where (file, line,
1256 _("invalid operand (%s section) for `%s'"),
1257 seg_right->name, opname);
1258 }
1259 else
1260 {
1261 const char *sname = S_GET_NAME (symp);
1262
1263 if (left)
1264 as_bad (_("invalid operands (%s and %s sections) for `%s' when setting `%s'"),
1265 seg_left->name, seg_right->name, opname, sname);
1266 else
1267 as_bad (_("invalid operand (%s section) for `%s' when setting `%s'"),
1268 seg_right->name, opname, sname);
1269 }
1270 }
1271
1272 /* Resolve the value of a symbol. This is called during the final
1273 pass over the symbol table to resolve any symbols with complex
1274 values. */
1275
1276 valueT
1277 resolve_symbol_value (symbolS *symp)
1278 {
1279 int resolved;
1280 valueT final_val;
1281 segT final_seg;
1282
1283 if (symp->flags.local_symbol)
1284 {
1285 struct local_symbol *locsym = (struct local_symbol *) symp;
1286
1287 final_val = locsym->value;
1288 if (locsym->flags.resolved)
1289 return final_val;
1290
1291 /* Symbols whose section has SEC_ELF_OCTETS set,
1292 resolve to octets instead of target bytes. */
1293 if (locsym->section->flags & SEC_OCTETS)
1294 final_val += locsym->frag->fr_address;
1295 else
1296 final_val += locsym->frag->fr_address / OCTETS_PER_BYTE;
1297
1298 if (finalize_syms)
1299 {
1300 locsym->value = final_val;
1301 locsym->flags.resolved = 1;
1302 }
1303
1304 return final_val;
1305 }
1306
1307 if (symp->flags.resolved)
1308 {
1309 final_val = 0;
1310 while (symp->x->value.X_op == O_symbol)
1311 {
1312 final_val += symp->x->value.X_add_number;
1313 symp = symp->x->value.X_add_symbol;
1314 if (symp->flags.local_symbol)
1315 {
1316 struct local_symbol *locsym = (struct local_symbol *) symp;
1317 final_val += locsym->value;
1318 return final_val;
1319 }
1320 if (!symp->flags.resolved)
1321 return 0;
1322 }
1323 if (symp->x->value.X_op == O_constant)
1324 final_val += symp->x->value.X_add_number;
1325 else
1326 final_val = 0;
1327 return final_val;
1328 }
1329
1330 resolved = 0;
1331 final_seg = S_GET_SEGMENT (symp);
1332
1333 if (symp->flags.resolving)
1334 {
1335 if (finalize_syms)
1336 as_bad (_("symbol definition loop encountered at `%s'"),
1337 S_GET_NAME (symp));
1338 final_val = 0;
1339 resolved = 1;
1340 }
1341 #ifdef OBJ_COMPLEX_RELC
1342 else if (final_seg == expr_section
1343 && use_complex_relocs_for (symp))
1344 {
1345 symbolS * relc_symbol = NULL;
1346 char * relc_symbol_name = NULL;
1347
1348 relc_symbol_name = symbol_relc_make_expr (& symp->x->value);
1349
1350 /* For debugging, print out conversion input & output. */
1351 #ifdef DEBUG_SYMS
1352 print_expr (& symp->x->value);
1353 if (relc_symbol_name)
1354 fprintf (stderr, "-> relc symbol: %s\n", relc_symbol_name);
1355 #endif
1356
1357 if (relc_symbol_name != NULL)
1358 relc_symbol = symbol_new (relc_symbol_name, undefined_section,
1359 &zero_address_frag, 0);
1360
1361 if (relc_symbol == NULL)
1362 {
1363 as_bad (_("cannot convert expression symbol %s to complex relocation"),
1364 S_GET_NAME (symp));
1365 resolved = 0;
1366 }
1367 else
1368 {
1369 symbol_table_insert (relc_symbol);
1370
1371 /* S_CLEAR_EXTERNAL (relc_symbol); */
1372 if (symp->bsym->flags & BSF_SRELC)
1373 relc_symbol->bsym->flags |= BSF_SRELC;
1374 else
1375 relc_symbol->bsym->flags |= BSF_RELC;
1376 /* symp->bsym->flags |= BSF_RELC; */
1377 copy_symbol_attributes (symp, relc_symbol);
1378 symp->x->value.X_op = O_symbol;
1379 symp->x->value.X_add_symbol = relc_symbol;
1380 symp->x->value.X_add_number = 0;
1381 resolved = 1;
1382 }
1383
1384 final_val = 0;
1385 final_seg = undefined_section;
1386 goto exit_dont_set_value;
1387 }
1388 #endif
1389 else
1390 {
1391 symbolS *add_symbol, *op_symbol;
1392 offsetT left, right;
1393 segT seg_left, seg_right;
1394 operatorT op;
1395 int move_seg_ok;
1396
1397 symp->flags.resolving = 1;
1398
1399 /* Help out with CSE. */
1400 add_symbol = symp->x->value.X_add_symbol;
1401 op_symbol = symp->x->value.X_op_symbol;
1402 final_val = symp->x->value.X_add_number;
1403 op = symp->x->value.X_op;
1404
1405 switch (op)
1406 {
1407 default:
1408 BAD_CASE (op);
1409 break;
1410
1411 case O_md1:
1412 case O_md2:
1413 case O_md3:
1414 case O_md4:
1415 case O_md5:
1416 case O_md6:
1417 case O_md7:
1418 case O_md8:
1419 case O_md9:
1420 case O_md10:
1421 case O_md11:
1422 case O_md12:
1423 case O_md13:
1424 case O_md14:
1425 case O_md15:
1426 case O_md16:
1427 case O_md17:
1428 case O_md18:
1429 case O_md19:
1430 case O_md20:
1431 case O_md21:
1432 case O_md22:
1433 case O_md23:
1434 case O_md24:
1435 case O_md25:
1436 case O_md26:
1437 case O_md27:
1438 case O_md28:
1439 case O_md29:
1440 case O_md30:
1441 case O_md31:
1442 case O_md32:
1443 #ifdef md_resolve_symbol
1444 resolved = md_resolve_symbol (symp, &final_val, &final_seg);
1445 if (resolved)
1446 break;
1447 #endif
1448 goto exit_dont_set_value;
1449
1450 case O_absent:
1451 final_val = 0;
1452 /* Fall through. */
1453
1454 case O_constant:
1455 /* Symbols whose section has SEC_ELF_OCTETS set,
1456 resolve to octets instead of target bytes. */
1457 if (symp->bsym->section->flags & SEC_OCTETS)
1458 final_val += symp->frag->fr_address;
1459 else
1460 final_val += symp->frag->fr_address / OCTETS_PER_BYTE;
1461 if (final_seg == expr_section)
1462 final_seg = absolute_section;
1463 /* Fall through. */
1464
1465 case O_register:
1466 resolved = 1;
1467 break;
1468
1469 case O_symbol:
1470 case O_symbol_rva:
1471 case O_secidx:
1472 left = resolve_symbol_value (add_symbol);
1473 seg_left = S_GET_SEGMENT (add_symbol);
1474 if (finalize_syms)
1475 symp->x->value.X_op_symbol = NULL;
1476
1477 do_symbol:
1478 if (S_IS_WEAKREFR (symp))
1479 {
1480 gas_assert (final_val == 0);
1481 if (S_IS_WEAKREFR (add_symbol))
1482 {
1483 gas_assert (add_symbol->x->value.X_op == O_symbol
1484 && add_symbol->x->value.X_add_number == 0);
1485 add_symbol = add_symbol->x->value.X_add_symbol;
1486 gas_assert (! S_IS_WEAKREFR (add_symbol));
1487 symp->x->value.X_add_symbol = add_symbol;
1488 }
1489 }
1490
1491 if (symp->flags.mri_common)
1492 {
1493 /* This is a symbol inside an MRI common section. The
1494 relocation routines are going to handle it specially.
1495 Don't change the value. */
1496 resolved = symbol_resolved_p (add_symbol);
1497 break;
1498 }
1499
1500 /* Don't leave symbol loops. */
1501 if (finalize_syms
1502 && !add_symbol->flags.local_symbol
1503 && add_symbol->flags.resolving)
1504 break;
1505
1506 if (finalize_syms && final_val == 0
1507 #ifdef OBJ_XCOFF
1508 /* Avoid changing symp's "within" when dealing with
1509 AIX debug symbols. For some storage classes, "within"
1510 have a special meaning.
1511 C_DWARF should behave like on Linux, thus this check
1512 isn't done to be closer. */
1513 && ((symbol_get_bfdsym (symp)->flags & BSF_DEBUGGING) == 0
1514 || (S_GET_STORAGE_CLASS (symp) == C_DWARF))
1515 #endif
1516 )
1517 {
1518 if (add_symbol->flags.local_symbol)
1519 add_symbol = local_symbol_convert (add_symbol);
1520 copy_symbol_attributes (symp, add_symbol);
1521 }
1522
1523 /* If we have equated this symbol to an undefined or common
1524 symbol, keep X_op set to O_symbol, and don't change
1525 X_add_number. This permits the routine which writes out
1526 relocation to detect this case, and convert the
1527 relocation to be against the symbol to which this symbol
1528 is equated. */
1529 if (seg_left == undefined_section
1530 || bfd_is_com_section (seg_left)
1531 #if defined (OBJ_COFF) && defined (TE_PE)
1532 || S_IS_WEAK (add_symbol)
1533 #endif
1534 || (finalize_syms
1535 && ((final_seg == expr_section
1536 && seg_left != expr_section
1537 && seg_left != absolute_section)
1538 || symbol_shadow_p (symp))))
1539 {
1540 if (finalize_syms)
1541 {
1542 symp->x->value.X_op = O_symbol;
1543 symp->x->value.X_add_symbol = add_symbol;
1544 symp->x->value.X_add_number = final_val;
1545 /* Use X_op_symbol as a flag. */
1546 symp->x->value.X_op_symbol = add_symbol;
1547 }
1548 final_seg = seg_left;
1549 final_val += symp->frag->fr_address + left;
1550 resolved = symbol_resolved_p (add_symbol);
1551 symp->flags.resolving = 0;
1552
1553 if (op == O_secidx && seg_left != undefined_section)
1554 {
1555 final_val = 0;
1556 break;
1557 }
1558
1559 goto exit_dont_set_value;
1560 }
1561 else
1562 {
1563 final_val += symp->frag->fr_address + left;
1564 if (final_seg == expr_section || final_seg == undefined_section)
1565 final_seg = seg_left;
1566 }
1567
1568 resolved = symbol_resolved_p (add_symbol);
1569 if (S_IS_WEAKREFR (symp))
1570 {
1571 symp->flags.resolving = 0;
1572 goto exit_dont_set_value;
1573 }
1574 break;
1575
1576 case O_uminus:
1577 case O_bit_not:
1578 case O_logical_not:
1579 left = resolve_symbol_value (add_symbol);
1580 seg_left = S_GET_SEGMENT (add_symbol);
1581
1582 /* By reducing these to the relevant dyadic operator, we get
1583 !S -> S == 0 permitted on anything,
1584 -S -> 0 - S only permitted on absolute
1585 ~S -> S ^ ~0 only permitted on absolute */
1586 if (op != O_logical_not && seg_left != absolute_section
1587 && finalize_syms)
1588 report_op_error (symp, NULL, op, add_symbol);
1589
1590 if (final_seg == expr_section || final_seg == undefined_section)
1591 final_seg = absolute_section;
1592
1593 if (op == O_uminus)
1594 left = -left;
1595 else if (op == O_logical_not)
1596 left = !left;
1597 else
1598 left = ~left;
1599
1600 final_val += left + symp->frag->fr_address;
1601
1602 resolved = symbol_resolved_p (add_symbol);
1603 break;
1604
1605 case O_multiply:
1606 case O_divide:
1607 case O_modulus:
1608 case O_left_shift:
1609 case O_right_shift:
1610 case O_bit_inclusive_or:
1611 case O_bit_or_not:
1612 case O_bit_exclusive_or:
1613 case O_bit_and:
1614 case O_add:
1615 case O_subtract:
1616 case O_eq:
1617 case O_ne:
1618 case O_lt:
1619 case O_le:
1620 case O_ge:
1621 case O_gt:
1622 case O_logical_and:
1623 case O_logical_or:
1624 left = resolve_symbol_value (add_symbol);
1625 right = resolve_symbol_value (op_symbol);
1626 seg_left = S_GET_SEGMENT (add_symbol);
1627 seg_right = S_GET_SEGMENT (op_symbol);
1628
1629 /* Simplify addition or subtraction of a constant by folding the
1630 constant into X_add_number. */
1631 if (op == O_add)
1632 {
1633 if (seg_right == absolute_section)
1634 {
1635 final_val += right;
1636 goto do_symbol;
1637 }
1638 else if (seg_left == absolute_section)
1639 {
1640 final_val += left;
1641 add_symbol = op_symbol;
1642 left = right;
1643 seg_left = seg_right;
1644 goto do_symbol;
1645 }
1646 }
1647 else if (op == O_subtract)
1648 {
1649 if (seg_right == absolute_section)
1650 {
1651 final_val -= right;
1652 goto do_symbol;
1653 }
1654 }
1655
1656 move_seg_ok = 1;
1657 /* Equality and non-equality tests are permitted on anything.
1658 Subtraction, and other comparison operators are permitted if
1659 both operands are in the same section. Otherwise, both
1660 operands must be absolute. We already handled the case of
1661 addition or subtraction of a constant above. This will
1662 probably need to be changed for an object file format which
1663 supports arbitrary expressions. */
1664 if (!(seg_left == absolute_section
1665 && seg_right == absolute_section)
1666 && !(op == O_eq || op == O_ne)
1667 && !((op == O_subtract
1668 || op == O_lt || op == O_le || op == O_ge || op == O_gt)
1669 && seg_left == seg_right
1670 && (seg_left != undefined_section
1671 || add_symbol == op_symbol)))
1672 {
1673 /* Don't emit messages unless we're finalizing the symbol value,
1674 otherwise we may get the same message multiple times. */
1675 if (finalize_syms)
1676 report_op_error (symp, add_symbol, op, op_symbol);
1677 /* However do not move the symbol into the absolute section
1678 if it cannot currently be resolved - this would confuse
1679 other parts of the assembler into believing that the
1680 expression had been evaluated to zero. */
1681 else
1682 move_seg_ok = 0;
1683 }
1684
1685 if (move_seg_ok
1686 && (final_seg == expr_section || final_seg == undefined_section))
1687 final_seg = absolute_section;
1688
1689 /* Check for division by zero. */
1690 if ((op == O_divide || op == O_modulus) && right == 0)
1691 {
1692 /* If seg_right is not absolute_section, then we've
1693 already issued a warning about using a bad symbol. */
1694 if (seg_right == absolute_section && finalize_syms)
1695 {
1696 const char *file;
1697 unsigned int line;
1698
1699 if (expr_symbol_where (symp, &file, &line))
1700 as_bad_where (file, line, _("division by zero"));
1701 else
1702 as_bad (_("division by zero when setting `%s'"),
1703 S_GET_NAME (symp));
1704 }
1705
1706 right = 1;
1707 }
1708 if ((op == O_left_shift || op == O_right_shift)
1709 && (valueT) right >= sizeof (valueT) * CHAR_BIT)
1710 {
1711 as_warn_value_out_of_range (_("shift count"), right, 0,
1712 sizeof (valueT) * CHAR_BIT - 1,
1713 NULL, 0);
1714 left = right = 0;
1715 }
1716
1717 switch (symp->x->value.X_op)
1718 {
1719 case O_multiply: left *= right; break;
1720 case O_divide: left /= right; break;
1721 case O_modulus: left %= right; break;
1722 case O_left_shift:
1723 left = (valueT) left << (valueT) right; break;
1724 case O_right_shift:
1725 left = (valueT) left >> (valueT) right; break;
1726 case O_bit_inclusive_or: left |= right; break;
1727 case O_bit_or_not: left |= ~right; break;
1728 case O_bit_exclusive_or: left ^= right; break;
1729 case O_bit_and: left &= right; break;
1730 case O_add: left += right; break;
1731 case O_subtract: left -= right; break;
1732 case O_eq:
1733 case O_ne:
1734 left = (left == right && seg_left == seg_right
1735 && (seg_left != undefined_section
1736 || add_symbol == op_symbol)
1737 ? ~ (offsetT) 0 : 0);
1738 if (symp->x->value.X_op == O_ne)
1739 left = ~left;
1740 break;
1741 case O_lt: left = left < right ? ~ (offsetT) 0 : 0; break;
1742 case O_le: left = left <= right ? ~ (offsetT) 0 : 0; break;
1743 case O_ge: left = left >= right ? ~ (offsetT) 0 : 0; break;
1744 case O_gt: left = left > right ? ~ (offsetT) 0 : 0; break;
1745 case O_logical_and: left = left && right; break;
1746 case O_logical_or: left = left || right; break;
1747
1748 case O_illegal:
1749 case O_absent:
1750 case O_constant:
1751 /* See PR 20895 for a reproducer. */
1752 as_bad (_("Invalid operation on symbol"));
1753 goto exit_dont_set_value;
1754
1755 default:
1756 abort ();
1757 }
1758
1759 final_val += symp->frag->fr_address + left;
1760 if (final_seg == expr_section || final_seg == undefined_section)
1761 {
1762 if (seg_left == undefined_section
1763 || seg_right == undefined_section)
1764 final_seg = undefined_section;
1765 else if (seg_left == absolute_section)
1766 final_seg = seg_right;
1767 else
1768 final_seg = seg_left;
1769 }
1770 resolved = (symbol_resolved_p (add_symbol)
1771 && symbol_resolved_p (op_symbol));
1772 break;
1773
1774 case O_big:
1775 case O_illegal:
1776 /* Give an error (below) if not in expr_section. We don't
1777 want to worry about expr_section symbols, because they
1778 are fictional (they are created as part of expression
1779 resolution), and any problems may not actually mean
1780 anything. */
1781 break;
1782 }
1783
1784 symp->flags.resolving = 0;
1785 }
1786
1787 if (finalize_syms)
1788 S_SET_VALUE (symp, final_val);
1789
1790 exit_dont_set_value:
1791 /* Always set the segment, even if not finalizing the value.
1792 The segment is used to determine whether a symbol is defined. */
1793 S_SET_SEGMENT (symp, final_seg);
1794
1795 /* Don't worry if we can't resolve an expr_section symbol. */
1796 if (finalize_syms)
1797 {
1798 if (resolved)
1799 symp->flags.resolved = 1;
1800 else if (S_GET_SEGMENT (symp) != expr_section)
1801 {
1802 as_bad (_("can't resolve value for symbol `%s'"),
1803 S_GET_NAME (symp));
1804 symp->flags.resolved = 1;
1805 }
1806 }
1807
1808 return final_val;
1809 }
1810
1811 /* A static function passed to hash_traverse. */
1812
1813 static int
1814 resolve_local_symbol (void **slot, void *arg ATTRIBUTE_UNUSED)
1815 {
1816 symbol_entry_t *entry = *((symbol_entry_t **) slot);
1817 if (entry->sy.flags.local_symbol)
1818 resolve_symbol_value (&entry->sy);
1819
1820 return 1;
1821 }
1822
1823 /* Resolve all local symbols. */
1824
1825 void
1826 resolve_local_symbol_values (void)
1827 {
1828 htab_traverse_noresize (sy_hash, resolve_local_symbol, NULL);
1829 }
1830
1831 /* Obtain the current value of a symbol without changing any
1832 sub-expressions used. */
1833
1834 int
1835 snapshot_symbol (symbolS **symbolPP, valueT *valueP, segT *segP, fragS **fragPP)
1836 {
1837 symbolS *symbolP = *symbolPP;
1838
1839 if (symbolP->flags.local_symbol)
1840 {
1841 struct local_symbol *locsym = (struct local_symbol *) symbolP;
1842
1843 *valueP = locsym->value;
1844 *segP = locsym->section;
1845 *fragPP = locsym->frag;
1846 }
1847 else
1848 {
1849 expressionS exp = symbolP->x->value;
1850
1851 if (!symbolP->flags.resolved && exp.X_op != O_illegal)
1852 {
1853 int resolved;
1854
1855 if (symbolP->flags.resolving)
1856 return 0;
1857 symbolP->flags.resolving = 1;
1858 resolved = resolve_expression (&exp);
1859 symbolP->flags.resolving = 0;
1860 if (!resolved)
1861 return 0;
1862
1863 switch (exp.X_op)
1864 {
1865 case O_constant:
1866 case O_register:
1867 if (!symbol_equated_p (symbolP))
1868 break;
1869 /* Fallthru. */
1870 case O_symbol:
1871 case O_symbol_rva:
1872 symbolP = exp.X_add_symbol;
1873 break;
1874 default:
1875 return 0;
1876 }
1877 }
1878
1879 *symbolPP = symbolP;
1880
1881 /* A bogus input file can result in resolve_expression()
1882 generating a local symbol, so we have to check again. */
1883 if (symbolP->flags.local_symbol)
1884 {
1885 struct local_symbol *locsym = (struct local_symbol *) symbolP;
1886
1887 *valueP = locsym->value;
1888 *segP = locsym->section;
1889 *fragPP = locsym->frag;
1890 }
1891 else
1892 {
1893 *valueP = exp.X_add_number;
1894 *segP = symbolP->bsym->section;
1895 *fragPP = symbolP->frag;
1896 }
1897
1898 if (*segP == expr_section)
1899 switch (exp.X_op)
1900 {
1901 case O_constant: *segP = absolute_section; break;
1902 case O_register: *segP = reg_section; break;
1903 default: break;
1904 }
1905 }
1906
1907 return 1;
1908 }
1909
1910 /* Dollar labels look like a number followed by a dollar sign. Eg, "42$".
1911 They are *really* local. That is, they go out of scope whenever we see a
1912 label that isn't local. Also, like fb labels, there can be multiple
1913 instances of a dollar label. Therefor, we name encode each instance with
1914 the instance number, keep a list of defined symbols separate from the real
1915 symbol table, and we treat these buggers as a sparse array. */
1916
1917 typedef unsigned int dollar_ent;
1918 static dollar_ent *dollar_labels;
1919 static dollar_ent *dollar_label_instances;
1920 static char *dollar_label_defines;
1921 static size_t dollar_label_count;
1922 static size_t dollar_label_max;
1923
1924 int
1925 dollar_label_defined (unsigned int label)
1926 {
1927 dollar_ent *i;
1928
1929 know ((dollar_labels != NULL) || (dollar_label_count == 0));
1930
1931 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
1932 if (*i == label)
1933 return dollar_label_defines[i - dollar_labels];
1934
1935 /* If we get here, label isn't defined. */
1936 return 0;
1937 }
1938
1939 static unsigned int
1940 dollar_label_instance (unsigned int label)
1941 {
1942 dollar_ent *i;
1943
1944 know ((dollar_labels != NULL) || (dollar_label_count == 0));
1945
1946 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
1947 if (*i == label)
1948 return (dollar_label_instances[i - dollar_labels]);
1949
1950 /* If we get here, we haven't seen the label before.
1951 Therefore its instance count is zero. */
1952 return 0;
1953 }
1954
1955 void
1956 dollar_label_clear (void)
1957 {
1958 if (dollar_label_count)
1959 memset (dollar_label_defines, '\0', dollar_label_count);
1960 }
1961
1962 #define DOLLAR_LABEL_BUMP_BY 10
1963
1964 void
1965 define_dollar_label (unsigned int label)
1966 {
1967 dollar_ent *i;
1968
1969 for (i = dollar_labels; i < dollar_labels + dollar_label_count; ++i)
1970 if (*i == label)
1971 {
1972 ++dollar_label_instances[i - dollar_labels];
1973 dollar_label_defines[i - dollar_labels] = 1;
1974 return;
1975 }
1976
1977 /* If we get to here, we don't have label listed yet. */
1978
1979 if (dollar_labels == NULL)
1980 {
1981 dollar_labels = XNEWVEC (dollar_ent, DOLLAR_LABEL_BUMP_BY);
1982 dollar_label_instances = XNEWVEC (dollar_ent, DOLLAR_LABEL_BUMP_BY);
1983 dollar_label_defines = XNEWVEC (char, DOLLAR_LABEL_BUMP_BY);
1984 dollar_label_max = DOLLAR_LABEL_BUMP_BY;
1985 dollar_label_count = 0;
1986 }
1987 else if (dollar_label_count == dollar_label_max)
1988 {
1989 dollar_label_max += DOLLAR_LABEL_BUMP_BY;
1990 dollar_labels = XRESIZEVEC (dollar_ent, dollar_labels,
1991 dollar_label_max);
1992 dollar_label_instances = XRESIZEVEC (dollar_ent,
1993 dollar_label_instances,
1994 dollar_label_max);
1995 dollar_label_defines = XRESIZEVEC (char, dollar_label_defines,
1996 dollar_label_max);
1997 } /* if we needed to grow */
1998
1999 dollar_labels[dollar_label_count] = label;
2000 dollar_label_instances[dollar_label_count] = 1;
2001 dollar_label_defines[dollar_label_count] = 1;
2002 ++dollar_label_count;
2003 }
2004
2005 /* Caller must copy returned name: we re-use the area for the next name.
2006
2007 The mth occurrence of label n: is turned into the symbol "Ln^Am"
2008 where n is the label number and m is the instance number. "L" makes
2009 it a label discarded unless debugging and "^A"('\1') ensures no
2010 ordinary symbol SHOULD get the same name as a local label
2011 symbol. The first "4:" is "L4^A1" - the m numbers begin at 1.
2012
2013 fb labels get the same treatment, except that ^B is used in place
2014 of ^A.
2015
2016 AUGEND is 0 for current instance, 1 for new instance. */
2017
2018 char *
2019 dollar_label_name (unsigned int n, unsigned int augend)
2020 {
2021 /* Returned to caller, then copied. Used for created names ("4f"). */
2022 static char symbol_name_build[24];
2023 char *p = symbol_name_build;
2024
2025 #ifdef LOCAL_LABEL_PREFIX
2026 *p++ = LOCAL_LABEL_PREFIX;
2027 #endif
2028 sprintf (p, "L%u%c%u",
2029 n, DOLLAR_LABEL_CHAR, dollar_label_instance (n) + augend);
2030 return symbol_name_build;
2031 }
2032
2033 /* Somebody else's idea of local labels. They are made by "n:" where n
2034 is any decimal digit. Refer to them with
2035 "nb" for previous (backward) n:
2036 or "nf" for next (forward) n:.
2037
2038 We do a little better and let n be any number, not just a single digit, but
2039 since the other guy's assembler only does ten, we treat the first ten
2040 specially.
2041
2042 Like someone else's assembler, we have one set of local label counters for
2043 entire assembly, not one set per (sub)segment like in most assemblers. This
2044 implies that one can refer to a label in another segment, and indeed some
2045 crufty compilers have done just that.
2046
2047 Since there could be a LOT of these things, treat them as a sparse
2048 array. */
2049
2050 #define FB_LABEL_SPECIAL (10)
2051
2052 typedef unsigned int fb_ent;
2053 static fb_ent fb_low_counter[FB_LABEL_SPECIAL];
2054 static fb_ent *fb_labels;
2055 static fb_ent *fb_label_instances;
2056 static size_t fb_label_count;
2057 static size_t fb_label_max;
2058
2059 /* This must be more than FB_LABEL_SPECIAL. */
2060 #define FB_LABEL_BUMP_BY (FB_LABEL_SPECIAL + 6)
2061
2062 static void
2063 fb_label_init (void)
2064 {
2065 memset ((void *) fb_low_counter, '\0', sizeof (fb_low_counter));
2066 }
2067
2068 /* Add one to the instance number of this fb label. */
2069
2070 void
2071 fb_label_instance_inc (unsigned int label)
2072 {
2073 fb_ent *i;
2074
2075 if (label < FB_LABEL_SPECIAL)
2076 {
2077 ++fb_low_counter[label];
2078 return;
2079 }
2080
2081 if (fb_labels != NULL)
2082 {
2083 for (i = fb_labels + FB_LABEL_SPECIAL;
2084 i < fb_labels + fb_label_count; ++i)
2085 {
2086 if (*i == label)
2087 {
2088 ++fb_label_instances[i - fb_labels];
2089 return;
2090 } /* if we find it */
2091 } /* for each existing label */
2092 }
2093
2094 /* If we get to here, we don't have label listed yet. */
2095
2096 if (fb_labels == NULL)
2097 {
2098 fb_labels = XNEWVEC (fb_ent, FB_LABEL_BUMP_BY);
2099 fb_label_instances = XNEWVEC (fb_ent, FB_LABEL_BUMP_BY);
2100 fb_label_max = FB_LABEL_BUMP_BY;
2101 fb_label_count = FB_LABEL_SPECIAL;
2102
2103 }
2104 else if (fb_label_count == fb_label_max)
2105 {
2106 fb_label_max += FB_LABEL_BUMP_BY;
2107 fb_labels = XRESIZEVEC (fb_ent, fb_labels, fb_label_max);
2108 fb_label_instances = XRESIZEVEC (fb_ent, fb_label_instances,
2109 fb_label_max);
2110 } /* if we needed to grow */
2111
2112 fb_labels[fb_label_count] = label;
2113 fb_label_instances[fb_label_count] = 1;
2114 ++fb_label_count;
2115 }
2116
2117 static unsigned int
2118 fb_label_instance (unsigned int label)
2119 {
2120 fb_ent *i;
2121
2122 if (label < FB_LABEL_SPECIAL)
2123 return (fb_low_counter[label]);
2124
2125 if (fb_labels != NULL)
2126 {
2127 for (i = fb_labels + FB_LABEL_SPECIAL;
2128 i < fb_labels + fb_label_count; ++i)
2129 {
2130 if (*i == label)
2131 return (fb_label_instances[i - fb_labels]);
2132 }
2133 }
2134
2135 /* We didn't find the label, so this must be a reference to the
2136 first instance. */
2137 return 0;
2138 }
2139
2140 /* Caller must copy returned name: we re-use the area for the next name.
2141
2142 The mth occurrence of label n: is turned into the symbol "Ln^Bm"
2143 where n is the label number and m is the instance number. "L" makes
2144 it a label discarded unless debugging and "^B"('\2') ensures no
2145 ordinary symbol SHOULD get the same name as a local label
2146 symbol. The first "4:" is "L4^B1" - the m numbers begin at 1.
2147
2148 dollar labels get the same treatment, except that ^A is used in
2149 place of ^B.
2150
2151 AUGEND is 0 for nb, 1 for n:, nf. */
2152
2153 char *
2154 fb_label_name (unsigned int n, unsigned int augend)
2155 {
2156 /* Returned to caller, then copied. Used for created names ("4f"). */
2157 static char symbol_name_build[24];
2158 char *p = symbol_name_build;
2159
2160 #ifdef TC_MMIX
2161 know (augend <= 2 /* See mmix_fb_label. */);
2162 #else
2163 know (augend <= 1);
2164 #endif
2165
2166 #ifdef LOCAL_LABEL_PREFIX
2167 *p++ = LOCAL_LABEL_PREFIX;
2168 #endif
2169 sprintf (p, "L%u%c%u",
2170 n, LOCAL_LABEL_CHAR, fb_label_instance (n) + augend);
2171 return symbol_name_build;
2172 }
2173
2174 /* Decode name that may have been generated by foo_label_name() above.
2175 If the name wasn't generated by foo_label_name(), then return it
2176 unaltered. This is used for error messages. */
2177
2178 char *
2179 decode_local_label_name (char *s)
2180 {
2181 char *p;
2182 char *symbol_decode;
2183 int label_number;
2184 int instance_number;
2185 const char *type;
2186 const char *message_format;
2187 int lindex = 0;
2188
2189 #ifdef LOCAL_LABEL_PREFIX
2190 if (s[lindex] == LOCAL_LABEL_PREFIX)
2191 ++lindex;
2192 #endif
2193
2194 if (s[lindex] != 'L')
2195 return s;
2196
2197 for (label_number = 0, p = s + lindex + 1; ISDIGIT (*p); ++p)
2198 label_number = (10 * label_number) + *p - '0';
2199
2200 if (*p == DOLLAR_LABEL_CHAR)
2201 type = "dollar";
2202 else if (*p == LOCAL_LABEL_CHAR)
2203 type = "fb";
2204 else
2205 return s;
2206
2207 for (instance_number = 0, p++; ISDIGIT (*p); ++p)
2208 instance_number = (10 * instance_number) + *p - '0';
2209
2210 message_format = _("\"%d\" (instance number %d of a %s label)");
2211 symbol_decode = notes_alloc (strlen (message_format) + 30);
2212 sprintf (symbol_decode, message_format, label_number, instance_number, type);
2213
2214 return symbol_decode;
2215 }
2216
2217 /* Get the value of a symbol. */
2218
2219 valueT
2220 S_GET_VALUE (symbolS *s)
2221 {
2222 if (s->flags.local_symbol)
2223 return resolve_symbol_value (s);
2224
2225 if (!s->flags.resolved)
2226 {
2227 valueT val = resolve_symbol_value (s);
2228 if (!finalize_syms)
2229 return val;
2230 }
2231 if (S_IS_WEAKREFR (s))
2232 return S_GET_VALUE (s->x->value.X_add_symbol);
2233
2234 if (s->x->value.X_op != O_constant)
2235 {
2236 if (! s->flags.resolved
2237 || s->x->value.X_op != O_symbol
2238 || (S_IS_DEFINED (s) && ! S_IS_COMMON (s)))
2239 as_bad (_("attempt to get value of unresolved symbol `%s'"),
2240 S_GET_NAME (s));
2241 }
2242 return (valueT) s->x->value.X_add_number;
2243 }
2244
2245 /* Set the value of a symbol. */
2246
2247 void
2248 S_SET_VALUE (symbolS *s, valueT val)
2249 {
2250 if (s->flags.local_symbol)
2251 {
2252 ((struct local_symbol *) s)->value = val;
2253 return;
2254 }
2255
2256 s->x->value.X_op = O_constant;
2257 s->x->value.X_add_number = (offsetT) val;
2258 s->x->value.X_unsigned = 0;
2259 S_CLEAR_WEAKREFR (s);
2260 }
2261
2262 void
2263 copy_symbol_attributes (symbolS *dest, symbolS *src)
2264 {
2265 if (dest->flags.local_symbol)
2266 dest = local_symbol_convert (dest);
2267 if (src->flags.local_symbol)
2268 src = local_symbol_convert (src);
2269
2270 /* In an expression, transfer the settings of these flags.
2271 The user can override later, of course. */
2272 #define COPIED_SYMFLAGS (BSF_FUNCTION | BSF_OBJECT \
2273 | BSF_GNU_INDIRECT_FUNCTION)
2274 dest->bsym->flags |= src->bsym->flags & COPIED_SYMFLAGS;
2275
2276 #ifdef OBJ_COPY_SYMBOL_ATTRIBUTES
2277 OBJ_COPY_SYMBOL_ATTRIBUTES (dest, src);
2278 #endif
2279
2280 #ifdef TC_COPY_SYMBOL_ATTRIBUTES
2281 TC_COPY_SYMBOL_ATTRIBUTES (dest, src);
2282 #endif
2283 }
2284
2285 int
2286 S_IS_FUNCTION (symbolS *s)
2287 {
2288 flagword flags;
2289
2290 if (s->flags.local_symbol)
2291 return 0;
2292
2293 flags = s->bsym->flags;
2294
2295 return (flags & BSF_FUNCTION) != 0;
2296 }
2297
2298 int
2299 S_IS_EXTERNAL (symbolS *s)
2300 {
2301 flagword flags;
2302
2303 if (s->flags.local_symbol)
2304 return 0;
2305
2306 flags = s->bsym->flags;
2307
2308 /* Sanity check. */
2309 if ((flags & BSF_LOCAL) && (flags & BSF_GLOBAL))
2310 abort ();
2311
2312 return (flags & BSF_GLOBAL) != 0;
2313 }
2314
2315 int
2316 S_IS_WEAK (symbolS *s)
2317 {
2318 if (s->flags.local_symbol)
2319 return 0;
2320 /* Conceptually, a weakrefr is weak if the referenced symbol is. We
2321 could probably handle a WEAKREFR as always weak though. E.g., if
2322 the referenced symbol has lost its weak status, there's no reason
2323 to keep handling the weakrefr as if it was weak. */
2324 if (S_IS_WEAKREFR (s))
2325 return S_IS_WEAK (s->x->value.X_add_symbol);
2326 return (s->bsym->flags & BSF_WEAK) != 0;
2327 }
2328
2329 int
2330 S_IS_WEAKREFR (symbolS *s)
2331 {
2332 if (s->flags.local_symbol)
2333 return 0;
2334 return s->flags.weakrefr != 0;
2335 }
2336
2337 int
2338 S_IS_WEAKREFD (symbolS *s)
2339 {
2340 if (s->flags.local_symbol)
2341 return 0;
2342 return s->flags.weakrefd != 0;
2343 }
2344
2345 int
2346 S_IS_COMMON (symbolS *s)
2347 {
2348 if (s->flags.local_symbol)
2349 return 0;
2350 return bfd_is_com_section (s->bsym->section);
2351 }
2352
2353 int
2354 S_IS_DEFINED (symbolS *s)
2355 {
2356 if (s->flags.local_symbol)
2357 return ((struct local_symbol *) s)->section != undefined_section;
2358 return s->bsym->section != undefined_section;
2359 }
2360
2361
2362 #ifndef EXTERN_FORCE_RELOC
2363 #define EXTERN_FORCE_RELOC IS_ELF
2364 #endif
2365
2366 /* Return true for symbols that should not be reduced to section
2367 symbols or eliminated from expressions, because they may be
2368 overridden by the linker. */
2369 int
2370 S_FORCE_RELOC (symbolS *s, int strict)
2371 {
2372 segT sec;
2373 if (s->flags.local_symbol)
2374 sec = ((struct local_symbol *) s)->section;
2375 else
2376 {
2377 if ((strict
2378 && ((s->bsym->flags & BSF_WEAK) != 0
2379 || (EXTERN_FORCE_RELOC
2380 && (s->bsym->flags & BSF_GLOBAL) != 0)))
2381 || (s->bsym->flags & BSF_GNU_INDIRECT_FUNCTION) != 0)
2382 return true;
2383 sec = s->bsym->section;
2384 }
2385 return bfd_is_und_section (sec) || bfd_is_com_section (sec);
2386 }
2387
2388 int
2389 S_IS_DEBUG (symbolS *s)
2390 {
2391 if (s->flags.local_symbol)
2392 return 0;
2393 if (s->bsym->flags & BSF_DEBUGGING)
2394 return 1;
2395 return 0;
2396 }
2397
2398 int
2399 S_IS_LOCAL (symbolS *s)
2400 {
2401 flagword flags;
2402 const char *name;
2403
2404 if (s->flags.local_symbol)
2405 return 1;
2406
2407 flags = s->bsym->flags;
2408
2409 /* Sanity check. */
2410 if ((flags & BSF_LOCAL) && (flags & BSF_GLOBAL))
2411 abort ();
2412
2413 if (bfd_asymbol_section (s->bsym) == reg_section)
2414 return 1;
2415
2416 if (flag_strip_local_absolute
2417 /* Keep BSF_FILE symbols in order to allow debuggers to identify
2418 the source file even when the object file is stripped. */
2419 && (flags & (BSF_GLOBAL | BSF_FILE)) == 0
2420 && bfd_asymbol_section (s->bsym) == absolute_section)
2421 return 1;
2422
2423 name = S_GET_NAME (s);
2424 return (name != NULL
2425 && ! S_IS_DEBUG (s)
2426 && (strchr (name, DOLLAR_LABEL_CHAR)
2427 || strchr (name, LOCAL_LABEL_CHAR)
2428 #if FAKE_LABEL_CHAR != DOLLAR_LABEL_CHAR
2429 || strchr (name, FAKE_LABEL_CHAR)
2430 #endif
2431 || TC_LABEL_IS_LOCAL (name)
2432 || (! flag_keep_locals
2433 && (bfd_is_local_label (stdoutput, s->bsym)
2434 || (flag_mri
2435 && name[0] == '?'
2436 && name[1] == '?')))));
2437 }
2438
2439 int
2440 S_IS_STABD (symbolS *s)
2441 {
2442 return S_GET_NAME (s) == 0;
2443 }
2444
2445 int
2446 S_CAN_BE_REDEFINED (const symbolS *s)
2447 {
2448 if (s->flags.local_symbol)
2449 return (((struct local_symbol *) s)->frag
2450 == &predefined_address_frag);
2451 /* Permit register names to be redefined. */
2452 return s->bsym->section == reg_section;
2453 }
2454
2455 int
2456 S_IS_VOLATILE (const symbolS *s)
2457 {
2458 if (s->flags.local_symbol)
2459 return 0;
2460 return s->flags.volatil;
2461 }
2462
2463 int
2464 S_IS_FORWARD_REF (const symbolS *s)
2465 {
2466 if (s->flags.local_symbol)
2467 return 0;
2468 return s->flags.forward_ref;
2469 }
2470
2471 const char *
2472 S_GET_NAME (symbolS *s)
2473 {
2474 return s->name;
2475 }
2476
2477 segT
2478 S_GET_SEGMENT (symbolS *s)
2479 {
2480 if (s->flags.local_symbol)
2481 return ((struct local_symbol *) s)->section;
2482 return s->bsym->section;
2483 }
2484
2485 void
2486 S_SET_SEGMENT (symbolS *s, segT seg)
2487 {
2488 if (s->flags.local_symbol)
2489 {
2490 ((struct local_symbol *) s)->section = seg;
2491 return;
2492 }
2493
2494 /* Don't reassign section symbols. The direct reason is to prevent seg
2495 faults assigning back to const global symbols such as *ABS*, but it
2496 shouldn't happen anyway. */
2497 if (s->bsym->flags & BSF_SECTION_SYM)
2498 {
2499 if (s->bsym->section != seg)
2500 abort ();
2501 }
2502 else
2503 {
2504 if (multibyte_handling == multibyte_warn_syms
2505 && ! s->flags.local_symbol
2506 && seg != undefined_section
2507 && ! s->flags.multibyte_warned
2508 && scan_for_multibyte_characters ((const unsigned char *) s->name,
2509 (const unsigned char *) s->name + strlen (s->name),
2510 false))
2511 {
2512 as_warn (_("symbol '%s' contains multibyte characters"), s->name);
2513 s->flags.multibyte_warned = 1;
2514 }
2515
2516 s->bsym->section = seg;
2517 }
2518 }
2519
2520 void
2521 S_SET_EXTERNAL (symbolS *s)
2522 {
2523 if (s->flags.local_symbol)
2524 s = local_symbol_convert (s);
2525 if ((s->bsym->flags & BSF_WEAK) != 0)
2526 {
2527 /* Let .weak override .global. */
2528 return;
2529 }
2530 if (s->bsym->flags & BSF_SECTION_SYM)
2531 {
2532 /* Do not reassign section symbols. */
2533 as_warn (_("can't make section symbol global"));
2534 return;
2535 }
2536 #ifndef TC_GLOBAL_REGISTER_SYMBOL_OK
2537 if (S_GET_SEGMENT (s) == reg_section)
2538 {
2539 as_bad (_("can't make register symbol global"));
2540 return;
2541 }
2542 #endif
2543 s->bsym->flags |= BSF_GLOBAL;
2544 s->bsym->flags &= ~(BSF_LOCAL | BSF_WEAK);
2545
2546 #ifdef TE_PE
2547 if (! an_external_name && S_GET_NAME(s)[0] != '.')
2548 an_external_name = S_GET_NAME (s);
2549 #endif
2550 }
2551
2552 void
2553 S_CLEAR_EXTERNAL (symbolS *s)
2554 {
2555 if (s->flags.local_symbol)
2556 return;
2557 if ((s->bsym->flags & BSF_WEAK) != 0)
2558 {
2559 /* Let .weak override. */
2560 return;
2561 }
2562 s->bsym->flags |= BSF_LOCAL;
2563 s->bsym->flags &= ~(BSF_GLOBAL | BSF_WEAK);
2564 }
2565
2566 void
2567 S_SET_WEAK (symbolS *s)
2568 {
2569 if (s->flags.local_symbol)
2570 s = local_symbol_convert (s);
2571 #ifdef obj_set_weak_hook
2572 obj_set_weak_hook (s);
2573 #endif
2574 s->bsym->flags |= BSF_WEAK;
2575 s->bsym->flags &= ~(BSF_GLOBAL | BSF_LOCAL);
2576 }
2577
2578 void
2579 S_SET_WEAKREFR (symbolS *s)
2580 {
2581 if (s->flags.local_symbol)
2582 s = local_symbol_convert (s);
2583 s->flags.weakrefr = 1;
2584 /* If the alias was already used, make sure we mark the target as
2585 used as well, otherwise it might be dropped from the symbol
2586 table. This may have unintended side effects if the alias is
2587 later redirected to another symbol, such as keeping the unused
2588 previous target in the symbol table. Since it will be weak, it's
2589 not a big deal. */
2590 if (s->flags.used)
2591 symbol_mark_used (s->x->value.X_add_symbol);
2592 }
2593
2594 void
2595 S_CLEAR_WEAKREFR (symbolS *s)
2596 {
2597 if (s->flags.local_symbol)
2598 return;
2599 s->flags.weakrefr = 0;
2600 }
2601
2602 void
2603 S_SET_WEAKREFD (symbolS *s)
2604 {
2605 if (s->flags.local_symbol)
2606 s = local_symbol_convert (s);
2607 s->flags.weakrefd = 1;
2608 S_SET_WEAK (s);
2609 }
2610
2611 void
2612 S_CLEAR_WEAKREFD (symbolS *s)
2613 {
2614 if (s->flags.local_symbol)
2615 return;
2616 if (s->flags.weakrefd)
2617 {
2618 s->flags.weakrefd = 0;
2619 /* If a weakref target symbol is weak, then it was never
2620 referenced directly before, not even in a .global directive,
2621 so decay it to local. If it remains undefined, it will be
2622 later turned into a global, like any other undefined
2623 symbol. */
2624 if (s->bsym->flags & BSF_WEAK)
2625 {
2626 #ifdef obj_clear_weak_hook
2627 obj_clear_weak_hook (s);
2628 #endif
2629 s->bsym->flags &= ~BSF_WEAK;
2630 s->bsym->flags |= BSF_LOCAL;
2631 }
2632 }
2633 }
2634
2635 void
2636 S_SET_THREAD_LOCAL (symbolS *s)
2637 {
2638 if (s->flags.local_symbol)
2639 s = local_symbol_convert (s);
2640 if (bfd_is_com_section (s->bsym->section)
2641 && (s->bsym->flags & BSF_THREAD_LOCAL) != 0)
2642 return;
2643 s->bsym->flags |= BSF_THREAD_LOCAL;
2644 if ((s->bsym->flags & BSF_FUNCTION) != 0)
2645 as_bad (_("Accessing function `%s' as thread-local object"),
2646 S_GET_NAME (s));
2647 else if (! bfd_is_und_section (s->bsym->section)
2648 && (s->bsym->section->flags & SEC_THREAD_LOCAL) == 0)
2649 as_bad (_("Accessing `%s' as thread-local object"),
2650 S_GET_NAME (s));
2651 }
2652
2653 void
2654 S_SET_NAME (symbolS *s, const char *name)
2655 {
2656 s->name = name;
2657 if (s->flags.local_symbol)
2658 return;
2659 s->bsym->name = name;
2660 }
2661
2662 void
2663 S_SET_VOLATILE (symbolS *s)
2664 {
2665 if (s->flags.local_symbol)
2666 s = local_symbol_convert (s);
2667 s->flags.volatil = 1;
2668 }
2669
2670 void
2671 S_CLEAR_VOLATILE (symbolS *s)
2672 {
2673 if (!s->flags.local_symbol)
2674 s->flags.volatil = 0;
2675 }
2676
2677 void
2678 S_SET_FORWARD_REF (symbolS *s)
2679 {
2680 if (s->flags.local_symbol)
2681 s = local_symbol_convert (s);
2682 s->flags.forward_ref = 1;
2683 }
2684
2685 /* Return the previous symbol in a chain. */
2686
2687 symbolS *
2688 symbol_previous (symbolS *s)
2689 {
2690 if (s->flags.local_symbol)
2691 abort ();
2692 return s->x->previous;
2693 }
2694
2695 /* Return the next symbol in a chain. */
2696
2697 symbolS *
2698 symbol_next (symbolS *s)
2699 {
2700 if (s->flags.local_symbol)
2701 abort ();
2702 return s->x->next;
2703 }
2704
2705 /* Return a pointer to the value of a symbol as an expression. */
2706
2707 expressionS *
2708 symbol_get_value_expression (symbolS *s)
2709 {
2710 if (s->flags.local_symbol)
2711 s = local_symbol_convert (s);
2712 return &s->x->value;
2713 }
2714
2715 /* Set the value of a symbol to an expression. */
2716
2717 void
2718 symbol_set_value_expression (symbolS *s, const expressionS *exp)
2719 {
2720 if (s->flags.local_symbol)
2721 s = local_symbol_convert (s);
2722 s->x->value = *exp;
2723 S_CLEAR_WEAKREFR (s);
2724 }
2725
2726 /* Return whether 2 symbols are the same. */
2727
2728 int
2729 symbol_same_p (symbolS *s1, symbolS *s2)
2730 {
2731 return s1 == s2;
2732 }
2733
2734 /* Return a pointer to the X_add_number component of a symbol. */
2735
2736 offsetT *
2737 symbol_X_add_number (symbolS *s)
2738 {
2739 if (s->flags.local_symbol)
2740 return (offsetT *) &((struct local_symbol *) s)->value;
2741
2742 return &s->x->value.X_add_number;
2743 }
2744
2745 /* Set the value of SYM to the current position in the current segment. */
2746
2747 void
2748 symbol_set_value_now (symbolS *sym)
2749 {
2750 S_SET_SEGMENT (sym, now_seg);
2751 S_SET_VALUE (sym, frag_now_fix ());
2752 symbol_set_frag (sym, frag_now);
2753 }
2754
2755 /* Set the frag of a symbol. */
2756
2757 void
2758 symbol_set_frag (symbolS *s, fragS *f)
2759 {
2760 if (s->flags.local_symbol)
2761 {
2762 ((struct local_symbol *) s)->frag = f;
2763 return;
2764 }
2765 s->frag = f;
2766 S_CLEAR_WEAKREFR (s);
2767 }
2768
2769 /* Return the frag of a symbol. */
2770
2771 fragS *
2772 symbol_get_frag (symbolS *s)
2773 {
2774 if (s->flags.local_symbol)
2775 return ((struct local_symbol *) s)->frag;
2776 return s->frag;
2777 }
2778
2779 /* Mark a symbol as having been used. */
2780
2781 void
2782 symbol_mark_used (symbolS *s)
2783 {
2784 if (s->flags.local_symbol)
2785 return;
2786 s->flags.used = 1;
2787 if (S_IS_WEAKREFR (s))
2788 symbol_mark_used (s->x->value.X_add_symbol);
2789 }
2790
2791 /* Clear the mark of whether a symbol has been used. */
2792
2793 void
2794 symbol_clear_used (symbolS *s)
2795 {
2796 if (s->flags.local_symbol)
2797 s = local_symbol_convert (s);
2798 s->flags.used = 0;
2799 }
2800
2801 /* Return whether a symbol has been used. */
2802
2803 int
2804 symbol_used_p (symbolS *s)
2805 {
2806 if (s->flags.local_symbol)
2807 return 1;
2808 return s->flags.used;
2809 }
2810
2811 /* Mark a symbol as having been used in a reloc. */
2812
2813 void
2814 symbol_mark_used_in_reloc (symbolS *s)
2815 {
2816 if (s->flags.local_symbol)
2817 s = local_symbol_convert (s);
2818 s->flags.used_in_reloc = 1;
2819 }
2820
2821 /* Clear the mark of whether a symbol has been used in a reloc. */
2822
2823 void
2824 symbol_clear_used_in_reloc (symbolS *s)
2825 {
2826 if (s->flags.local_symbol)
2827 return;
2828 s->flags.used_in_reloc = 0;
2829 }
2830
2831 /* Return whether a symbol has been used in a reloc. */
2832
2833 int
2834 symbol_used_in_reloc_p (symbolS *s)
2835 {
2836 if (s->flags.local_symbol)
2837 return 0;
2838 return s->flags.used_in_reloc;
2839 }
2840
2841 /* Mark a symbol as an MRI common symbol. */
2842
2843 void
2844 symbol_mark_mri_common (symbolS *s)
2845 {
2846 if (s->flags.local_symbol)
2847 s = local_symbol_convert (s);
2848 s->flags.mri_common = 1;
2849 }
2850
2851 /* Clear the mark of whether a symbol is an MRI common symbol. */
2852
2853 void
2854 symbol_clear_mri_common (symbolS *s)
2855 {
2856 if (s->flags.local_symbol)
2857 return;
2858 s->flags.mri_common = 0;
2859 }
2860
2861 /* Return whether a symbol is an MRI common symbol. */
2862
2863 int
2864 symbol_mri_common_p (symbolS *s)
2865 {
2866 if (s->flags.local_symbol)
2867 return 0;
2868 return s->flags.mri_common;
2869 }
2870
2871 /* Mark a symbol as having been written. */
2872
2873 void
2874 symbol_mark_written (symbolS *s)
2875 {
2876 if (s->flags.local_symbol)
2877 return;
2878 s->flags.written = 1;
2879 }
2880
2881 /* Clear the mark of whether a symbol has been written. */
2882
2883 void
2884 symbol_clear_written (symbolS *s)
2885 {
2886 if (s->flags.local_symbol)
2887 return;
2888 s->flags.written = 0;
2889 }
2890
2891 /* Return whether a symbol has been written. */
2892
2893 int
2894 symbol_written_p (symbolS *s)
2895 {
2896 if (s->flags.local_symbol)
2897 return 0;
2898 return s->flags.written;
2899 }
2900
2901 /* Mark a symbol as to be removed. */
2902
2903 void
2904 symbol_mark_removed (symbolS *s)
2905 {
2906 if (s->flags.local_symbol)
2907 return;
2908 s->flags.removed = 1;
2909 }
2910
2911 /* Return whether a symbol has been marked to be removed. */
2912
2913 int
2914 symbol_removed_p (symbolS *s)
2915 {
2916 if (s->flags.local_symbol)
2917 return 0;
2918 return s->flags.removed;
2919 }
2920
2921 /* Mark a symbol has having been resolved. */
2922
2923 void
2924 symbol_mark_resolved (symbolS *s)
2925 {
2926 s->flags.resolved = 1;
2927 }
2928
2929 /* Return whether a symbol has been resolved. */
2930
2931 int
2932 symbol_resolved_p (symbolS *s)
2933 {
2934 return s->flags.resolved;
2935 }
2936
2937 /* Return whether a symbol is a section symbol. */
2938
2939 int
2940 symbol_section_p (symbolS *s)
2941 {
2942 if (s->flags.local_symbol)
2943 return 0;
2944 return (s->bsym->flags & BSF_SECTION_SYM) != 0;
2945 }
2946
2947 /* Return whether a symbol is equated to another symbol. */
2948
2949 int
2950 symbol_equated_p (symbolS *s)
2951 {
2952 if (s->flags.local_symbol)
2953 return 0;
2954 return s->x->value.X_op == O_symbol;
2955 }
2956
2957 /* Return whether a symbol is equated to another symbol, and should be
2958 treated specially when writing out relocs. */
2959
2960 int
2961 symbol_equated_reloc_p (symbolS *s)
2962 {
2963 if (s->flags.local_symbol)
2964 return 0;
2965 /* X_op_symbol, normally not used for O_symbol, is set by
2966 resolve_symbol_value to flag expression syms that have been
2967 equated. */
2968 return (s->x->value.X_op == O_symbol
2969 #if defined (OBJ_COFF) && defined (TE_PE)
2970 && ! S_IS_WEAK (s)
2971 #endif
2972 && ((s->flags.resolved && s->x->value.X_op_symbol != NULL)
2973 || ! S_IS_DEFINED (s)
2974 || S_IS_COMMON (s)));
2975 }
2976
2977 /* Return whether a symbol has a constant value. */
2978
2979 int
2980 symbol_constant_p (symbolS *s)
2981 {
2982 if (s->flags.local_symbol)
2983 return 1;
2984 return s->x->value.X_op == O_constant;
2985 }
2986
2987 /* Return whether a symbol was cloned and thus removed from the global
2988 symbol list. */
2989
2990 int
2991 symbol_shadow_p (symbolS *s)
2992 {
2993 if (s->flags.local_symbol)
2994 return 0;
2995 return s->x->next == s;
2996 }
2997
2998 /* If S is a struct symbol return S, otherwise return NULL. */
2999
3000 symbolS *
3001 symbol_symbolS (symbolS *s)
3002 {
3003 if (s->flags.local_symbol)
3004 return NULL;
3005 return s;
3006 }
3007
3008 /* Return the BFD symbol for a symbol. */
3009
3010 asymbol *
3011 symbol_get_bfdsym (symbolS *s)
3012 {
3013 if (s->flags.local_symbol)
3014 s = local_symbol_convert (s);
3015 return s->bsym;
3016 }
3017
3018 /* Set the BFD symbol for a symbol. */
3019
3020 void
3021 symbol_set_bfdsym (symbolS *s, asymbol *bsym)
3022 {
3023 if (s->flags.local_symbol)
3024 s = local_symbol_convert (s);
3025 /* Usually, it is harmless to reset a symbol to a BFD section
3026 symbol. For example, obj_elf_change_section sets the BFD symbol
3027 of an old symbol with the newly created section symbol. But when
3028 we have multiple sections with the same name, the newly created
3029 section may have the same name as an old section. We check if the
3030 old symbol has been already marked as a section symbol before
3031 resetting it. */
3032 if ((s->bsym->flags & BSF_SECTION_SYM) == 0)
3033 s->bsym = bsym;
3034 /* else XXX - What do we do now ? */
3035 }
3036
3037 #ifdef OBJ_SYMFIELD_TYPE
3038
3039 /* Get a pointer to the object format information for a symbol. */
3040
3041 OBJ_SYMFIELD_TYPE *
3042 symbol_get_obj (symbolS *s)
3043 {
3044 if (s->flags.local_symbol)
3045 s = local_symbol_convert (s);
3046 return &s->x->obj;
3047 }
3048
3049 /* Set the object format information for a symbol. */
3050
3051 void
3052 symbol_set_obj (symbolS *s, OBJ_SYMFIELD_TYPE *o)
3053 {
3054 if (s->flags.local_symbol)
3055 s = local_symbol_convert (s);
3056 s->x->obj = *o;
3057 }
3058
3059 #endif /* OBJ_SYMFIELD_TYPE */
3060
3061 #ifdef TC_SYMFIELD_TYPE
3062
3063 /* Get a pointer to the processor information for a symbol. */
3064
3065 TC_SYMFIELD_TYPE *
3066 symbol_get_tc (symbolS *s)
3067 {
3068 if (s->flags.local_symbol)
3069 s = local_symbol_convert (s);
3070 return &s->x->tc;
3071 }
3072
3073 /* Set the processor information for a symbol. */
3074
3075 void
3076 symbol_set_tc (symbolS *s, TC_SYMFIELD_TYPE *o)
3077 {
3078 if (s->flags.local_symbol)
3079 s = local_symbol_convert (s);
3080 s->x->tc = *o;
3081 }
3082
3083 #endif /* TC_SYMFIELD_TYPE */
3084
3085 void
3086 symbol_begin (void)
3087 {
3088 symbol_lastP = NULL;
3089 symbol_rootP = NULL; /* In case we have 0 symbols (!!) */
3090 sy_hash = htab_create_alloc (16, hash_symbol_entry, eq_symbol_entry,
3091 NULL, xcalloc, free);
3092
3093 #if defined (EMIT_SECTION_SYMBOLS) || !defined (RELOC_REQUIRES_SYMBOL)
3094 abs_symbol.bsym = bfd_abs_section_ptr->symbol;
3095 #endif
3096 abs_symbol.x = &abs_symbol_x;
3097 abs_symbol.x->value.X_op = O_constant;
3098 abs_symbol.frag = &zero_address_frag;
3099
3100 if (LOCAL_LABELS_FB)
3101 fb_label_init ();
3102 }
3103
3104 void
3105 symbol_end (void)
3106 {
3107 htab_delete (sy_hash);
3108 }
3109
3110 void
3111 dot_symbol_init (void)
3112 {
3113 dot_symbol.name = ".";
3114 dot_symbol.flags.forward_ref = 1;
3115 dot_symbol.bsym = bfd_make_empty_symbol (stdoutput);
3116 if (dot_symbol.bsym == NULL)
3117 as_fatal ("bfd_make_empty_symbol: %s", bfd_errmsg (bfd_get_error ()));
3118 dot_symbol.bsym->name = ".";
3119 dot_symbol.x = &dot_symbol_x;
3120 dot_symbol.x->value.X_op = O_constant;
3121 }
3122 \f
3123 int indent_level;
3124
3125 /* Maximum indent level.
3126 Available for modification inside a gdb session. */
3127 static int max_indent_level = 8;
3128
3129 void
3130 print_symbol_value_1 (FILE *file, symbolS *sym)
3131 {
3132 const char *name = S_GET_NAME (sym);
3133 if (!name || !name[0])
3134 name = "(unnamed)";
3135 fprintf (file, "sym %p %s", sym, name);
3136
3137 if (sym->flags.local_symbol)
3138 {
3139 struct local_symbol *locsym = (struct local_symbol *) sym;
3140
3141 if (locsym->frag != &zero_address_frag
3142 && locsym->frag != NULL)
3143 fprintf (file, " frag %p", locsym->frag);
3144 if (locsym->flags.resolved)
3145 fprintf (file, " resolved");
3146 fprintf (file, " local");
3147 }
3148 else
3149 {
3150 if (sym->frag != &zero_address_frag)
3151 fprintf (file, " frag %p", sym->frag);
3152 if (sym->flags.written)
3153 fprintf (file, " written");
3154 if (sym->flags.resolved)
3155 fprintf (file, " resolved");
3156 else if (sym->flags.resolving)
3157 fprintf (file, " resolving");
3158 if (sym->flags.used_in_reloc)
3159 fprintf (file, " used-in-reloc");
3160 if (sym->flags.used)
3161 fprintf (file, " used");
3162 if (S_IS_LOCAL (sym))
3163 fprintf (file, " local");
3164 if (S_IS_EXTERNAL (sym))
3165 fprintf (file, " extern");
3166 if (S_IS_WEAK (sym))
3167 fprintf (file, " weak");
3168 if (S_IS_DEBUG (sym))
3169 fprintf (file, " debug");
3170 if (S_IS_DEFINED (sym))
3171 fprintf (file, " defined");
3172 }
3173 if (S_IS_WEAKREFR (sym))
3174 fprintf (file, " weakrefr");
3175 if (S_IS_WEAKREFD (sym))
3176 fprintf (file, " weakrefd");
3177 fprintf (file, " %s", segment_name (S_GET_SEGMENT (sym)));
3178 if (symbol_resolved_p (sym))
3179 {
3180 segT s = S_GET_SEGMENT (sym);
3181
3182 if (s != undefined_section
3183 && s != expr_section)
3184 fprintf (file, " %lx", (unsigned long) S_GET_VALUE (sym));
3185 }
3186 else if (indent_level < max_indent_level
3187 && S_GET_SEGMENT (sym) != undefined_section)
3188 {
3189 indent_level++;
3190 fprintf (file, "\n%*s<", indent_level * 4, "");
3191 if (sym->flags.local_symbol)
3192 fprintf (file, "constant %lx",
3193 (unsigned long) ((struct local_symbol *) sym)->value);
3194 else
3195 print_expr_1 (file, &sym->x->value);
3196 fprintf (file, ">");
3197 indent_level--;
3198 }
3199 fflush (file);
3200 }
3201
3202 void
3203 print_symbol_value (symbolS *sym)
3204 {
3205 indent_level = 0;
3206 print_symbol_value_1 (stderr, sym);
3207 fprintf (stderr, "\n");
3208 }
3209
3210 static void
3211 print_binary (FILE *file, const char *name, expressionS *exp)
3212 {
3213 indent_level++;
3214 fprintf (file, "%s\n%*s<", name, indent_level * 4, "");
3215 print_symbol_value_1 (file, exp->X_add_symbol);
3216 fprintf (file, ">\n%*s<", indent_level * 4, "");
3217 print_symbol_value_1 (file, exp->X_op_symbol);
3218 fprintf (file, ">");
3219 indent_level--;
3220 }
3221
3222 void
3223 print_expr_1 (FILE *file, expressionS *exp)
3224 {
3225 fprintf (file, "expr %p ", exp);
3226 switch (exp->X_op)
3227 {
3228 case O_illegal:
3229 fprintf (file, "illegal");
3230 break;
3231 case O_absent:
3232 fprintf (file, "absent");
3233 break;
3234 case O_constant:
3235 fprintf (file, "constant %" PRIx64, (uint64_t) exp->X_add_number);
3236 break;
3237 case O_symbol:
3238 indent_level++;
3239 fprintf (file, "symbol\n%*s<", indent_level * 4, "");
3240 print_symbol_value_1 (file, exp->X_add_symbol);
3241 fprintf (file, ">");
3242 maybe_print_addnum:
3243 if (exp->X_add_number)
3244 fprintf (file, "\n%*s%" PRIx64, indent_level * 4, "",
3245 (uint64_t) exp->X_add_number);
3246 indent_level--;
3247 break;
3248 case O_register:
3249 fprintf (file, "register #%d", (int) exp->X_add_number);
3250 break;
3251 case O_big:
3252 fprintf (file, "big");
3253 break;
3254 case O_uminus:
3255 fprintf (file, "uminus -<");
3256 indent_level++;
3257 print_symbol_value_1 (file, exp->X_add_symbol);
3258 fprintf (file, ">");
3259 goto maybe_print_addnum;
3260 case O_bit_not:
3261 fprintf (file, "bit_not");
3262 break;
3263 case O_multiply:
3264 print_binary (file, "multiply", exp);
3265 break;
3266 case O_divide:
3267 print_binary (file, "divide", exp);
3268 break;
3269 case O_modulus:
3270 print_binary (file, "modulus", exp);
3271 break;
3272 case O_left_shift:
3273 print_binary (file, "lshift", exp);
3274 break;
3275 case O_right_shift:
3276 print_binary (file, "rshift", exp);
3277 break;
3278 case O_bit_inclusive_or:
3279 print_binary (file, "bit_ior", exp);
3280 break;
3281 case O_bit_exclusive_or:
3282 print_binary (file, "bit_xor", exp);
3283 break;
3284 case O_bit_and:
3285 print_binary (file, "bit_and", exp);
3286 break;
3287 case O_eq:
3288 print_binary (file, "eq", exp);
3289 break;
3290 case O_ne:
3291 print_binary (file, "ne", exp);
3292 break;
3293 case O_lt:
3294 print_binary (file, "lt", exp);
3295 break;
3296 case O_le:
3297 print_binary (file, "le", exp);
3298 break;
3299 case O_ge:
3300 print_binary (file, "ge", exp);
3301 break;
3302 case O_gt:
3303 print_binary (file, "gt", exp);
3304 break;
3305 case O_logical_and:
3306 print_binary (file, "logical_and", exp);
3307 break;
3308 case O_logical_or:
3309 print_binary (file, "logical_or", exp);
3310 break;
3311 case O_add:
3312 indent_level++;
3313 fprintf (file, "add\n%*s<", indent_level * 4, "");
3314 print_symbol_value_1 (file, exp->X_add_symbol);
3315 fprintf (file, ">\n%*s<", indent_level * 4, "");
3316 print_symbol_value_1 (file, exp->X_op_symbol);
3317 fprintf (file, ">");
3318 goto maybe_print_addnum;
3319 case O_subtract:
3320 indent_level++;
3321 fprintf (file, "subtract\n%*s<", indent_level * 4, "");
3322 print_symbol_value_1 (file, exp->X_add_symbol);
3323 fprintf (file, ">\n%*s<", indent_level * 4, "");
3324 print_symbol_value_1 (file, exp->X_op_symbol);
3325 fprintf (file, ">");
3326 goto maybe_print_addnum;
3327 default:
3328 fprintf (file, "{unknown opcode %d}", (int) exp->X_op);
3329 break;
3330 }
3331 fflush (stdout);
3332 }
3333
3334 void
3335 print_expr (expressionS *exp)
3336 {
3337 print_expr_1 (stderr, exp);
3338 fprintf (stderr, "\n");
3339 }
3340
3341 void
3342 symbol_print_statistics (FILE *file)
3343 {
3344 htab_print_statistics (file, "symbol table", sy_hash);
3345 fprintf (file, "%lu mini local symbols created, %lu converted\n",
3346 local_symbol_count, local_symbol_conversion_count);
3347 }
3348
3349 #ifdef OBJ_COMPLEX_RELC
3350
3351 /* Convert given symbol to a new complex-relocation symbol name. This
3352 may be a recursive function, since it might be called for non-leaf
3353 nodes (plain symbols) in the expression tree. The caller owns the
3354 returning string, so should free it eventually. Errors are
3355 indicated via as_bad and a NULL return value. The given symbol
3356 is marked with used_in_reloc. */
3357
3358 char *
3359 symbol_relc_make_sym (symbolS * sym)
3360 {
3361 char * terminal = NULL;
3362 const char * sname;
3363 char typetag;
3364 int sname_len;
3365
3366 gas_assert (sym != NULL);
3367
3368 /* Recurse to symbol_relc_make_expr if this symbol
3369 is defined as an expression or a plain value. */
3370 if ( S_GET_SEGMENT (sym) == expr_section
3371 || S_GET_SEGMENT (sym) == absolute_section)
3372 return symbol_relc_make_expr (symbol_get_value_expression (sym));
3373
3374 /* This may be a "fake symbol", referring to ".".
3375 Write out a special null symbol to refer to this position. */
3376 if (! strcmp (S_GET_NAME (sym), FAKE_LABEL_NAME))
3377 return xstrdup (".");
3378
3379 /* We hope this is a plain leaf symbol. Construct the encoding
3380 as {S,s}II...:CCCCCCC....
3381 where 'S'/'s' means section symbol / plain symbol
3382 III is decimal for the symbol name length
3383 CCC is the symbol name itself. */
3384 symbol_mark_used_in_reloc (sym);
3385
3386 sname = S_GET_NAME (sym);
3387 sname_len = strlen (sname);
3388 typetag = symbol_section_p (sym) ? 'S' : 's';
3389
3390 terminal = XNEWVEC (char, (1 /* S or s */
3391 + 8 /* sname_len in decimal */
3392 + 1 /* _ spacer */
3393 + sname_len /* name itself */
3394 + 1 /* \0 */ ));
3395
3396 sprintf (terminal, "%c%d:%s", typetag, sname_len, sname);
3397 return terminal;
3398 }
3399
3400 /* Convert given value to a new complex-relocation symbol name. This
3401 is a non-recursive function, since it is be called for leaf nodes
3402 (plain values) in the expression tree. The caller owns the
3403 returning string, so should free() it eventually. No errors. */
3404
3405 char *
3406 symbol_relc_make_value (offsetT val)
3407 {
3408 char * terminal = XNEWVEC (char, 28); /* Enough for long long. */
3409
3410 terminal[0] = '#';
3411 bfd_sprintf_vma (stdoutput, terminal + 1, val);
3412 return terminal;
3413 }
3414
3415 /* Convert given expression to a new complex-relocation symbol name.
3416 This is a recursive function, since it traverses the entire given
3417 expression tree. The caller owns the returning string, so should
3418 free() it eventually. Errors are indicated via as_bad() and a NULL
3419 return value. */
3420
3421 char *
3422 symbol_relc_make_expr (expressionS * exp)
3423 {
3424 const char * opstr = NULL; /* Operator prefix string. */
3425 int arity = 0; /* Arity of this operator. */
3426 char * operands[3]; /* Up to three operands. */
3427 char * concat_string = NULL;
3428
3429 operands[0] = operands[1] = operands[2] = NULL;
3430
3431 gas_assert (exp != NULL);
3432
3433 /* Match known operators -> fill in opstr, arity, operands[] and fall
3434 through to construct subexpression fragments; may instead return
3435 string directly for leaf nodes. */
3436
3437 /* See expr.h for the meaning of all these enums. Many operators
3438 have an unnatural arity (X_add_number implicitly added). The
3439 conversion logic expands them to explicit "+" subexpressions. */
3440
3441 switch (exp->X_op)
3442 {
3443 default:
3444 as_bad ("Unknown expression operator (enum %d)", exp->X_op);
3445 break;
3446
3447 /* Leaf nodes. */
3448 case O_constant:
3449 return symbol_relc_make_value (exp->X_add_number);
3450
3451 case O_symbol:
3452 if (exp->X_add_number)
3453 {
3454 arity = 2;
3455 opstr = "+";
3456 operands[0] = symbol_relc_make_sym (exp->X_add_symbol);
3457 operands[1] = symbol_relc_make_value (exp->X_add_number);
3458 break;
3459 }
3460 else
3461 return symbol_relc_make_sym (exp->X_add_symbol);
3462
3463 /* Helper macros for nesting nodes. */
3464
3465 #define HANDLE_XADD_OPT1(str_) \
3466 if (exp->X_add_number) \
3467 { \
3468 arity = 2; \
3469 opstr = "+:" str_; \
3470 operands[0] = symbol_relc_make_sym (exp->X_add_symbol); \
3471 operands[1] = symbol_relc_make_value (exp->X_add_number); \
3472 break; \
3473 } \
3474 else \
3475 { \
3476 arity = 1; \
3477 opstr = str_; \
3478 operands[0] = symbol_relc_make_sym (exp->X_add_symbol); \
3479 } \
3480 break
3481
3482 #define HANDLE_XADD_OPT2(str_) \
3483 if (exp->X_add_number) \
3484 { \
3485 arity = 3; \
3486 opstr = "+:" str_; \
3487 operands[0] = symbol_relc_make_sym (exp->X_add_symbol); \
3488 operands[1] = symbol_relc_make_sym (exp->X_op_symbol); \
3489 operands[2] = symbol_relc_make_value (exp->X_add_number); \
3490 } \
3491 else \
3492 { \
3493 arity = 2; \
3494 opstr = str_; \
3495 operands[0] = symbol_relc_make_sym (exp->X_add_symbol); \
3496 operands[1] = symbol_relc_make_sym (exp->X_op_symbol); \
3497 } \
3498 break
3499
3500 /* Nesting nodes. */
3501
3502 case O_uminus: HANDLE_XADD_OPT1 ("0-");
3503 case O_bit_not: HANDLE_XADD_OPT1 ("~");
3504 case O_logical_not: HANDLE_XADD_OPT1 ("!");
3505 case O_multiply: HANDLE_XADD_OPT2 ("*");
3506 case O_divide: HANDLE_XADD_OPT2 ("/");
3507 case O_modulus: HANDLE_XADD_OPT2 ("%");
3508 case O_left_shift: HANDLE_XADD_OPT2 ("<<");
3509 case O_right_shift: HANDLE_XADD_OPT2 (">>");
3510 case O_bit_inclusive_or: HANDLE_XADD_OPT2 ("|");
3511 case O_bit_exclusive_or: HANDLE_XADD_OPT2 ("^");
3512 case O_bit_and: HANDLE_XADD_OPT2 ("&");
3513 case O_add: HANDLE_XADD_OPT2 ("+");
3514 case O_subtract: HANDLE_XADD_OPT2 ("-");
3515 case O_eq: HANDLE_XADD_OPT2 ("==");
3516 case O_ne: HANDLE_XADD_OPT2 ("!=");
3517 case O_lt: HANDLE_XADD_OPT2 ("<");
3518 case O_le: HANDLE_XADD_OPT2 ("<=");
3519 case O_ge: HANDLE_XADD_OPT2 (">=");
3520 case O_gt: HANDLE_XADD_OPT2 (">");
3521 case O_logical_and: HANDLE_XADD_OPT2 ("&&");
3522 case O_logical_or: HANDLE_XADD_OPT2 ("||");
3523 }
3524
3525 /* Validate & reject early. */
3526 if (arity >= 1 && ((operands[0] == NULL) || (strlen (operands[0]) == 0)))
3527 opstr = NULL;
3528 if (arity >= 2 && ((operands[1] == NULL) || (strlen (operands[1]) == 0)))
3529 opstr = NULL;
3530 if (arity >= 3 && ((operands[2] == NULL) || (strlen (operands[2]) == 0)))
3531 opstr = NULL;
3532
3533 if (opstr == NULL)
3534 concat_string = NULL;
3535 else if (arity == 0)
3536 concat_string = xstrdup (opstr);
3537 else if (arity == 1)
3538 concat_string = concat (opstr, ":", operands[0], (char *) NULL);
3539 else if (arity == 2)
3540 concat_string = concat (opstr, ":", operands[0], ":", operands[1],
3541 (char *) NULL);
3542 else
3543 concat_string = concat (opstr, ":", operands[0], ":", operands[1], ":",
3544 operands[2], (char *) NULL);
3545
3546 /* Free operand strings (not opstr). */
3547 if (arity >= 1) xfree (operands[0]);
3548 if (arity >= 2) xfree (operands[1]);
3549 if (arity >= 3) xfree (operands[2]);
3550
3551 return concat_string;
3552 }
3553
3554 #endif