1 /* This module handles expression trees.
2 Copyright 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Written by Steve Chamberlain of Cygnus Support <sac@cygnus.com>.
7 This file is part of the GNU Binutils.
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
22 MA 02110-1301, USA. */
25 /* This module is in charge of working out the contents of expressions.
27 It has to keep track of the relative/absness of a symbol etc. This
28 is done by keeping all values in a struct (an etree_value_type)
29 which contains a value, a section to which it is relative and a
43 #include "libiberty.h"
44 #include "safe-ctype.h"
46 static void exp_fold_tree_1 (etree_type
*);
47 static bfd_vma
align_n (bfd_vma
, bfd_vma
);
49 segment_type
*segments
;
51 struct ldexp_control expld
;
53 /* Print the string representation of the given token. Surround it
54 with spaces if INFIX_P is TRUE. */
57 exp_print_token (token_code_type code
, int infix_p
)
91 { SECTIONS
, "SECTIONS" },
92 { SIZEOF_HEADERS
, "SIZEOF_HEADERS" },
94 { DEFINED
, "DEFINED" },
95 { TARGET_K
, "TARGET" },
96 { SEARCH_DIR
, "SEARCH_DIR" },
100 { ALIGNOF
, "ALIGNOF" },
101 { SIZEOF
, "SIZEOF" },
103 { LOADADDR
, "LOADADDR" },
104 { CONSTANT
, "CONSTANT" },
105 { ABSOLUTE
, "ABSOLUTE" },
108 { ASSERT_K
, "ASSERT" },
109 { REL
, "relocatable" },
110 { DATA_SEGMENT_ALIGN
, "DATA_SEGMENT_ALIGN" },
111 { DATA_SEGMENT_RELRO_END
, "DATA_SEGMENT_RELRO_END" },
112 { DATA_SEGMENT_END
, "DATA_SEGMENT_END" },
113 { ORIGIN
, "ORIGIN" },
114 { LENGTH
, "LENGTH" },
115 { SEGMENT_START
, "SEGMENT_START" }
119 for (idx
= 0; idx
< ARRAY_SIZE (table
); idx
++)
120 if (table
[idx
].code
== code
)
124 fputc (' ', config
.map_file
);
126 if (idx
< ARRAY_SIZE (table
))
127 fputs (table
[idx
].name
, config
.map_file
);
129 fputc (code
, config
.map_file
);
131 fprintf (config
.map_file
, "<code %d>", code
);
134 fputc (' ', config
.map_file
);
140 if (expld
.result
.section
!= NULL
)
141 expld
.result
.value
+= expld
.result
.section
->vma
;
142 expld
.result
.section
= bfd_abs_section_ptr
;
146 new_abs (bfd_vma value
)
148 expld
.result
.valid_p
= TRUE
;
149 expld
.result
.section
= bfd_abs_section_ptr
;
150 expld
.result
.value
= value
;
151 expld
.result
.str
= NULL
;
155 exp_intop (bfd_vma value
)
157 etree_type
*new_e
= (etree_type
*) stat_alloc (sizeof (new_e
->value
));
158 new_e
->type
.node_code
= INT
;
159 new_e
->type
.lineno
= lineno
;
160 new_e
->value
.value
= value
;
161 new_e
->value
.str
= NULL
;
162 new_e
->type
.node_class
= etree_value
;
167 exp_bigintop (bfd_vma value
, char *str
)
169 etree_type
*new_e
= (etree_type
*) stat_alloc (sizeof (new_e
->value
));
170 new_e
->type
.node_code
= INT
;
171 new_e
->type
.lineno
= lineno
;
172 new_e
->value
.value
= value
;
173 new_e
->value
.str
= str
;
174 new_e
->type
.node_class
= etree_value
;
178 /* Build an expression representing an unnamed relocatable value. */
181 exp_relop (asection
*section
, bfd_vma value
)
183 etree_type
*new_e
= (etree_type
*) stat_alloc (sizeof (new_e
->rel
));
184 new_e
->type
.node_code
= REL
;
185 new_e
->type
.lineno
= lineno
;
186 new_e
->type
.node_class
= etree_rel
;
187 new_e
->rel
.section
= section
;
188 new_e
->rel
.value
= value
;
193 new_number (bfd_vma value
)
195 expld
.result
.valid_p
= TRUE
;
196 expld
.result
.value
= value
;
197 expld
.result
.str
= NULL
;
198 expld
.result
.section
= NULL
;
202 new_rel (bfd_vma value
, asection
*section
)
204 expld
.result
.valid_p
= TRUE
;
205 expld
.result
.value
= value
;
206 expld
.result
.str
= NULL
;
207 expld
.result
.section
= section
;
211 new_rel_from_abs (bfd_vma value
)
213 expld
.result
.valid_p
= TRUE
;
214 expld
.result
.value
= value
- expld
.section
->vma
;
215 expld
.result
.str
= NULL
;
216 expld
.result
.section
= expld
.section
;
220 fold_unary (etree_type
*tree
)
222 exp_fold_tree_1 (tree
->unary
.child
);
223 if (expld
.result
.valid_p
)
225 switch (tree
->type
.node_code
)
228 if (expld
.phase
!= lang_first_phase_enum
)
229 new_rel_from_abs (align_n (expld
.dot
, expld
.result
.value
));
231 expld
.result
.valid_p
= FALSE
;
239 expld
.result
.value
= ~expld
.result
.value
;
243 expld
.result
.value
= !expld
.result
.value
;
247 expld
.result
.value
= -expld
.result
.value
;
251 /* Return next place aligned to value. */
252 if (expld
.phase
!= lang_first_phase_enum
)
255 expld
.result
.value
= align_n (expld
.dot
, expld
.result
.value
);
258 expld
.result
.valid_p
= FALSE
;
261 case DATA_SEGMENT_END
:
262 if (expld
.phase
!= lang_first_phase_enum
263 && expld
.section
== bfd_abs_section_ptr
264 && (expld
.dataseg
.phase
== exp_dataseg_align_seen
265 || expld
.dataseg
.phase
== exp_dataseg_relro_seen
266 || expld
.dataseg
.phase
== exp_dataseg_adjust
267 || expld
.dataseg
.phase
== exp_dataseg_relro_adjust
268 || expld
.phase
== lang_final_phase_enum
))
270 if (expld
.dataseg
.phase
== exp_dataseg_align_seen
271 || expld
.dataseg
.phase
== exp_dataseg_relro_seen
)
273 expld
.dataseg
.phase
= exp_dataseg_end_seen
;
274 expld
.dataseg
.end
= expld
.result
.value
;
278 expld
.result
.valid_p
= FALSE
;
289 fold_binary (etree_type
*tree
)
291 etree_value_type lhs
;
292 exp_fold_tree_1 (tree
->binary
.lhs
);
294 /* The SEGMENT_START operator is special because its first
295 operand is a string, not the name of a symbol. Note that the
296 operands have been swapped, so binary.lhs is second (default)
297 operand, binary.rhs is first operand. */
298 if (expld
.result
.valid_p
&& tree
->type
.node_code
== SEGMENT_START
)
300 const char *segment_name
;
303 /* Check to see if the user has overridden the default
305 segment_name
= tree
->binary
.rhs
->name
.name
;
306 for (seg
= segments
; seg
; seg
= seg
->next
)
307 if (strcmp (seg
->name
, segment_name
) == 0)
310 && config
.magic_demand_paged
311 && (seg
->value
% config
.maxpagesize
) != 0)
312 einfo (_("%P: warning: address of `%s' isn't multiple of maximum page size\n"),
315 new_rel_from_abs (seg
->value
);
322 exp_fold_tree_1 (tree
->binary
.rhs
);
323 expld
.result
.valid_p
&= lhs
.valid_p
;
325 if (expld
.result
.valid_p
)
327 if (lhs
.section
!= expld
.result
.section
)
329 /* If the values are from different sections, and neither is
330 just a number, make both the source arguments absolute. */
331 if (expld
.result
.section
!= NULL
332 && lhs
.section
!= NULL
)
335 lhs
.value
+= lhs
.section
->vma
;
338 /* If the rhs is just a number, keep the lhs section. */
339 else if (expld
.result
.section
== NULL
)
340 expld
.result
.section
= lhs
.section
;
343 switch (tree
->type
.node_code
)
346 if (expld
.result
.value
!= 0)
347 expld
.result
.value
= ((bfd_signed_vma
) lhs
.value
348 % (bfd_signed_vma
) expld
.result
.value
);
349 else if (expld
.phase
!= lang_mark_phase_enum
)
350 einfo (_("%F%S %% by zero\n"));
354 if (expld
.result
.value
!= 0)
355 expld
.result
.value
= ((bfd_signed_vma
) lhs
.value
356 / (bfd_signed_vma
) expld
.result
.value
);
357 else if (expld
.phase
!= lang_mark_phase_enum
)
358 einfo (_("%F%S / by zero\n"));
363 expld.result.value = lhs.value y expld.result.value; \
368 expld.result.value = lhs.value y expld.result.value; \
369 expld.result.section = NULL; \
390 if (lhs
.value
> expld
.result
.value
)
391 expld
.result
.value
= lhs
.value
;
395 if (lhs
.value
< expld
.result
.value
)
396 expld
.result
.value
= lhs
.value
;
400 expld
.result
.value
= align_n (lhs
.value
, expld
.result
.value
);
403 case DATA_SEGMENT_ALIGN
:
404 expld
.dataseg
.relro
= exp_dataseg_relro_start
;
405 if (expld
.phase
!= lang_first_phase_enum
406 && expld
.section
== bfd_abs_section_ptr
407 && (expld
.dataseg
.phase
== exp_dataseg_none
408 || expld
.dataseg
.phase
== exp_dataseg_adjust
409 || expld
.dataseg
.phase
== exp_dataseg_relro_adjust
410 || expld
.phase
== lang_final_phase_enum
))
412 bfd_vma maxpage
= lhs
.value
;
413 bfd_vma commonpage
= expld
.result
.value
;
415 expld
.result
.value
= align_n (expld
.dot
, maxpage
);
416 if (expld
.dataseg
.phase
== exp_dataseg_relro_adjust
)
417 expld
.result
.value
= expld
.dataseg
.base
;
418 else if (expld
.dataseg
.phase
!= exp_dataseg_adjust
)
420 expld
.result
.value
+= expld
.dot
& (maxpage
- 1);
421 if (expld
.phase
== lang_allocating_phase_enum
)
423 expld
.dataseg
.phase
= exp_dataseg_align_seen
;
424 expld
.dataseg
.min_base
= expld
.dot
;
425 expld
.dataseg
.base
= expld
.result
.value
;
426 expld
.dataseg
.pagesize
= commonpage
;
427 expld
.dataseg
.maxpagesize
= maxpage
;
428 expld
.dataseg
.relro_end
= 0;
431 else if (commonpage
< maxpage
)
432 expld
.result
.value
+= ((expld
.dot
+ commonpage
- 1)
433 & (maxpage
- commonpage
));
436 expld
.result
.valid_p
= FALSE
;
439 case DATA_SEGMENT_RELRO_END
:
440 expld
.dataseg
.relro
= exp_dataseg_relro_end
;
441 if (expld
.phase
!= lang_first_phase_enum
442 && (expld
.dataseg
.phase
== exp_dataseg_align_seen
443 || expld
.dataseg
.phase
== exp_dataseg_adjust
444 || expld
.dataseg
.phase
== exp_dataseg_relro_adjust
445 || expld
.phase
== lang_final_phase_enum
))
447 if (expld
.dataseg
.phase
== exp_dataseg_align_seen
448 || expld
.dataseg
.phase
== exp_dataseg_relro_adjust
)
449 expld
.dataseg
.relro_end
= lhs
.value
+ expld
.result
.value
;
451 if (expld
.dataseg
.phase
== exp_dataseg_relro_adjust
452 && (expld
.dataseg
.relro_end
453 & (expld
.dataseg
.pagesize
- 1)))
455 expld
.dataseg
.relro_end
+= expld
.dataseg
.pagesize
- 1;
456 expld
.dataseg
.relro_end
&= ~(expld
.dataseg
.pagesize
- 1);
457 expld
.result
.value
= (expld
.dataseg
.relro_end
458 - expld
.result
.value
);
461 expld
.result
.value
= lhs
.value
;
463 if (expld
.dataseg
.phase
== exp_dataseg_align_seen
)
464 expld
.dataseg
.phase
= exp_dataseg_relro_seen
;
467 expld
.result
.valid_p
= FALSE
;
477 fold_trinary (etree_type
*tree
)
479 exp_fold_tree_1 (tree
->trinary
.cond
);
480 if (expld
.result
.valid_p
)
481 exp_fold_tree_1 (expld
.result
.value
483 : tree
->trinary
.rhs
);
487 fold_name (etree_type
*tree
)
489 memset (&expld
.result
, 0, sizeof (expld
.result
));
491 switch (tree
->type
.node_code
)
494 if (expld
.phase
!= lang_first_phase_enum
)
496 bfd_vma hdr_size
= 0;
497 /* Don't find the real header size if only marking sections;
498 The bfd function may cache incorrect data. */
499 if (expld
.phase
!= lang_mark_phase_enum
)
500 hdr_size
= bfd_sizeof_headers (link_info
.output_bfd
, &link_info
);
501 new_number (hdr_size
);
506 expld
.uses_defined
= TRUE
;
507 if (expld
.phase
== lang_first_phase_enum
)
508 lang_track_definedness (tree
->name
.name
);
511 struct bfd_link_hash_entry
*h
;
513 = lang_symbol_definition_iteration (tree
->name
.name
);
515 h
= bfd_wrapped_link_hash_lookup (link_info
.output_bfd
,
519 new_number (h
!= NULL
520 && (h
->type
== bfd_link_hash_defined
521 || h
->type
== bfd_link_hash_defweak
522 || h
->type
== bfd_link_hash_common
)
523 && (def_iteration
== lang_statement_iteration
524 || def_iteration
== -1));
529 if (expld
.phase
== lang_first_phase_enum
)
531 else if (tree
->name
.name
[0] == '.' && tree
->name
.name
[1] == 0)
532 new_rel_from_abs (expld
.dot
);
535 struct bfd_link_hash_entry
*h
;
537 h
= bfd_wrapped_link_hash_lookup (link_info
.output_bfd
,
542 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
543 else if (h
->type
== bfd_link_hash_defined
544 || h
->type
== bfd_link_hash_defweak
)
546 asection
*output_section
;
548 output_section
= h
->u
.def
.section
->output_section
;
549 if (output_section
== NULL
)
551 if (expld
.phase
!= lang_mark_phase_enum
)
552 einfo (_("%X%S: unresolvable symbol `%s'"
553 " referenced in expression\n"),
556 else if (output_section
== bfd_abs_section_ptr
557 && (expld
.section
!= bfd_abs_section_ptr
558 || ld_compatibility
>= 221))
559 new_number (h
->u
.def
.value
+ h
->u
.def
.section
->output_offset
);
561 new_rel (h
->u
.def
.value
+ h
->u
.def
.section
->output_offset
,
564 else if (expld
.phase
== lang_final_phase_enum
565 || expld
.assigning_to_dot
)
566 einfo (_("%F%S: undefined symbol `%s' referenced in expression\n"),
568 else if (h
->type
== bfd_link_hash_new
)
570 h
->type
= bfd_link_hash_undefined
;
571 h
->u
.undef
.abfd
= NULL
;
572 if (h
->u
.undef
.next
== NULL
&& h
!= link_info
.hash
->undefs_tail
)
573 bfd_link_add_undef (link_info
.hash
, h
);
579 if (expld
.phase
!= lang_first_phase_enum
)
581 lang_output_section_statement_type
*os
;
583 os
= lang_output_section_find (tree
->name
.name
);
586 if (expld
.phase
== lang_final_phase_enum
)
587 einfo (_("%F%S: undefined section `%s' referenced in expression\n"),
590 else if (os
->processed_vma
)
591 new_rel (0, os
->bfd_section
);
596 if (expld
.phase
!= lang_first_phase_enum
)
598 lang_output_section_statement_type
*os
;
600 os
= lang_output_section_find (tree
->name
.name
);
603 if (expld
.phase
== lang_final_phase_enum
)
604 einfo (_("%F%S: undefined section `%s' referenced in expression\n"),
607 else if (os
->processed_lma
)
609 if (os
->load_base
== NULL
)
610 new_abs (os
->bfd_section
->lma
);
613 exp_fold_tree_1 (os
->load_base
);
614 if (expld
.result
.valid_p
)
623 if (expld
.phase
!= lang_first_phase_enum
)
625 lang_output_section_statement_type
*os
;
627 os
= lang_output_section_find (tree
->name
.name
);
630 if (expld
.phase
== lang_final_phase_enum
)
631 einfo (_("%F%S: undefined section `%s' referenced in expression\n"),
635 else if (os
->processed_vma
)
639 if (tree
->type
.node_code
== SIZEOF
)
640 val
= (os
->bfd_section
->size
641 / bfd_octets_per_byte (link_info
.output_bfd
));
643 val
= (bfd_vma
)1 << os
->bfd_section
->alignment_power
;
652 lang_memory_region_type
*mem
;
654 mem
= lang_memory_region_lookup (tree
->name
.name
, FALSE
);
656 new_number (mem
->length
);
658 einfo (_("%F%S: undefined MEMORY region `%s'"
659 " referenced in expression\n"), tree
->name
.name
);
664 if (expld
.phase
!= lang_first_phase_enum
)
666 lang_memory_region_type
*mem
;
668 mem
= lang_memory_region_lookup (tree
->name
.name
, FALSE
);
670 new_rel_from_abs (mem
->origin
);
672 einfo (_("%F%S: undefined MEMORY region `%s'"
673 " referenced in expression\n"), tree
->name
.name
);
678 if (strcmp (tree
->name
.name
, "MAXPAGESIZE") == 0)
679 new_number (config
.maxpagesize
);
680 else if (strcmp (tree
->name
.name
, "COMMONPAGESIZE") == 0)
681 new_number (config
.commonpagesize
);
683 einfo (_("%F%S: unknown constant `%s' referenced in expression\n"),
694 exp_fold_tree_1 (etree_type
*tree
)
698 memset (&expld
.result
, 0, sizeof (expld
.result
));
702 switch (tree
->type
.node_class
)
705 if (expld
.section
== bfd_abs_section_ptr
706 && ld_compatibility
< 221)
707 new_abs (tree
->value
.value
);
709 new_number (tree
->value
.value
);
710 expld
.result
.str
= tree
->value
.str
;
714 if (expld
.phase
!= lang_first_phase_enum
)
716 asection
*output_section
= tree
->rel
.section
->output_section
;
717 new_rel (tree
->rel
.value
+ tree
->rel
.section
->output_offset
,
721 memset (&expld
.result
, 0, sizeof (expld
.result
));
725 exp_fold_tree_1 (tree
->assert_s
.child
);
726 if (expld
.phase
== lang_final_phase_enum
&& !expld
.result
.value
)
727 einfo ("%X%P: %s\n", tree
->assert_s
.message
);
745 if (tree
->assign
.dst
[0] == '.' && tree
->assign
.dst
[1] == 0)
747 /* Assignment to dot can only be done during allocation. */
748 if (tree
->type
.node_class
!= etree_assign
)
749 einfo (_("%F%S can not PROVIDE assignment to location counter\n"));
750 if (expld
.phase
== lang_mark_phase_enum
751 || expld
.phase
== lang_allocating_phase_enum
752 || (expld
.phase
== lang_final_phase_enum
753 && expld
.section
== bfd_abs_section_ptr
))
755 /* Notify the folder that this is an assignment to dot. */
756 expld
.assigning_to_dot
= TRUE
;
757 exp_fold_tree_1 (tree
->assign
.src
);
758 expld
.assigning_to_dot
= FALSE
;
760 if (!expld
.result
.valid_p
)
762 if (expld
.phase
!= lang_mark_phase_enum
)
763 einfo (_("%F%S invalid assignment to location counter\n"));
765 else if (expld
.dotp
== NULL
)
766 einfo (_("%F%S assignment to location counter"
767 " invalid outside of SECTION\n"));
772 nextdot
= expld
.result
.value
;
773 if (expld
.result
.section
!= NULL
)
774 nextdot
+= expld
.result
.section
->vma
;
776 nextdot
+= expld
.section
->vma
;
777 if (nextdot
< expld
.dot
778 && expld
.section
!= bfd_abs_section_ptr
)
779 einfo (_("%F%S cannot move location counter backwards"
780 " (from %V to %V)\n"), expld
.dot
, nextdot
);
784 *expld
.dotp
= nextdot
;
789 memset (&expld
.result
, 0, sizeof (expld
.result
));
793 struct bfd_link_hash_entry
*h
= NULL
;
795 if (tree
->type
.node_class
== etree_provide
)
797 h
= bfd_link_hash_lookup (link_info
.hash
, tree
->assign
.dst
,
800 || (h
->type
!= bfd_link_hash_new
801 && h
->type
!= bfd_link_hash_undefined
802 && h
->type
!= bfd_link_hash_common
))
804 /* Do nothing. The symbol was never referenced, or was
805 defined by some object. */
810 exp_fold_tree_1 (tree
->assign
.src
);
811 if (expld
.result
.valid_p
812 || (expld
.phase
== lang_first_phase_enum
813 && !expld
.uses_defined
))
817 h
= bfd_link_hash_lookup (link_info
.hash
, tree
->assign
.dst
,
820 einfo (_("%P%F:%s: hash creation failed\n"),
824 /* FIXME: Should we worry if the symbol is already
826 lang_update_definedness (tree
->assign
.dst
, h
);
827 h
->type
= bfd_link_hash_defined
;
828 h
->u
.def
.value
= expld
.result
.value
;
829 if (expld
.result
.section
== NULL
)
830 expld
.result
.section
= expld
.section
;
831 h
->u
.def
.section
= expld
.result
.section
;
832 if (tree
->type
.node_class
== etree_provide
)
833 tree
->type
.node_class
= etree_provided
;
835 /* Copy the symbol type if this is a simple assignment of
836 one symbol to annother. */
837 if (tree
->assign
.src
->type
.node_class
== etree_name
)
839 struct bfd_link_hash_entry
*hsrc
;
841 hsrc
= bfd_link_hash_lookup (link_info
.hash
,
842 tree
->assign
.src
->name
.name
,
845 bfd_copy_link_hash_symbol_type (link_info
.output_bfd
, h
,
849 else if (expld
.phase
== lang_final_phase_enum
)
851 h
= bfd_link_hash_lookup (link_info
.hash
, tree
->assign
.dst
,
854 && h
->type
== bfd_link_hash_new
)
855 h
->type
= bfd_link_hash_undefined
;
866 memset (&expld
.result
, 0, sizeof (expld
.result
));
872 exp_fold_tree (etree_type
*tree
, asection
*current_section
, bfd_vma
*dotp
)
876 expld
.section
= current_section
;
877 expld
.uses_defined
= FALSE
;
878 exp_fold_tree_1 (tree
);
882 exp_fold_tree_no_dot (etree_type
*tree
)
886 expld
.section
= bfd_abs_section_ptr
;
887 expld
.uses_defined
= FALSE
;
888 exp_fold_tree_1 (tree
);
892 exp_binop (int code
, etree_type
*lhs
, etree_type
*rhs
)
894 etree_type value
, *new_e
;
896 value
.type
.node_code
= code
;
897 value
.type
.lineno
= lhs
->type
.lineno
;
898 value
.binary
.lhs
= lhs
;
899 value
.binary
.rhs
= rhs
;
900 value
.type
.node_class
= etree_binary
;
901 exp_fold_tree_no_dot (&value
);
902 if (expld
.result
.valid_p
)
903 return exp_intop (expld
.result
.value
);
905 new_e
= (etree_type
*) stat_alloc (sizeof (new_e
->binary
));
906 memcpy (new_e
, &value
, sizeof (new_e
->binary
));
911 exp_trinop (int code
, etree_type
*cond
, etree_type
*lhs
, etree_type
*rhs
)
913 etree_type value
, *new_e
;
915 value
.type
.node_code
= code
;
916 value
.type
.lineno
= lhs
->type
.lineno
;
917 value
.trinary
.lhs
= lhs
;
918 value
.trinary
.cond
= cond
;
919 value
.trinary
.rhs
= rhs
;
920 value
.type
.node_class
= etree_trinary
;
921 exp_fold_tree_no_dot (&value
);
922 if (expld
.result
.valid_p
)
923 return exp_intop (expld
.result
.value
);
925 new_e
= (etree_type
*) stat_alloc (sizeof (new_e
->trinary
));
926 memcpy (new_e
, &value
, sizeof (new_e
->trinary
));
931 exp_unop (int code
, etree_type
*child
)
933 etree_type value
, *new_e
;
935 value
.unary
.type
.node_code
= code
;
936 value
.unary
.type
.lineno
= child
->type
.lineno
;
937 value
.unary
.child
= child
;
938 value
.unary
.type
.node_class
= etree_unary
;
939 exp_fold_tree_no_dot (&value
);
940 if (expld
.result
.valid_p
)
941 return exp_intop (expld
.result
.value
);
943 new_e
= (etree_type
*) stat_alloc (sizeof (new_e
->unary
));
944 memcpy (new_e
, &value
, sizeof (new_e
->unary
));
949 exp_nameop (int code
, const char *name
)
951 etree_type value
, *new_e
;
953 value
.name
.type
.node_code
= code
;
954 value
.name
.type
.lineno
= lineno
;
955 value
.name
.name
= name
;
956 value
.name
.type
.node_class
= etree_name
;
958 exp_fold_tree_no_dot (&value
);
959 if (expld
.result
.valid_p
)
960 return exp_intop (expld
.result
.value
);
962 new_e
= (etree_type
*) stat_alloc (sizeof (new_e
->name
));
963 memcpy (new_e
, &value
, sizeof (new_e
->name
));
969 exp_assop (int code
, const char *dst
, etree_type
*src
)
973 new_e
= (etree_type
*) stat_alloc (sizeof (new_e
->assign
));
974 new_e
->type
.node_code
= code
;
975 new_e
->type
.lineno
= src
->type
.lineno
;
976 new_e
->type
.node_class
= etree_assign
;
977 new_e
->assign
.src
= src
;
978 new_e
->assign
.dst
= dst
;
982 /* Handle PROVIDE. */
985 exp_provide (const char *dst
, etree_type
*src
, bfd_boolean hidden
)
989 n
= (etree_type
*) stat_alloc (sizeof (n
->assign
));
990 n
->assign
.type
.node_code
= '=';
991 n
->assign
.type
.lineno
= src
->type
.lineno
;
992 n
->assign
.type
.node_class
= etree_provide
;
995 n
->assign
.hidden
= hidden
;
1002 exp_assert (etree_type
*exp
, const char *message
)
1006 n
= (etree_type
*) stat_alloc (sizeof (n
->assert_s
));
1007 n
->assert_s
.type
.node_code
= '!';
1008 n
->assert_s
.type
.lineno
= exp
->type
.lineno
;
1009 n
->assert_s
.type
.node_class
= etree_assert
;
1010 n
->assert_s
.child
= exp
;
1011 n
->assert_s
.message
= message
;
1016 exp_print_tree (etree_type
*tree
)
1018 bfd_boolean function_like
;
1020 if (config
.map_file
== NULL
)
1021 config
.map_file
= stderr
;
1025 minfo ("NULL TREE\n");
1029 switch (tree
->type
.node_class
)
1032 minfo ("0x%v", tree
->value
.value
);
1035 if (tree
->rel
.section
->owner
!= NULL
)
1036 minfo ("%B:", tree
->rel
.section
->owner
);
1037 minfo ("%s+0x%v", tree
->rel
.section
->name
, tree
->rel
.value
);
1040 fputs (tree
->assign
.dst
, config
.map_file
);
1041 exp_print_token (tree
->type
.node_code
, TRUE
);
1042 exp_print_tree (tree
->assign
.src
);
1045 case etree_provided
:
1046 fprintf (config
.map_file
, "PROVIDE (%s, ", tree
->assign
.dst
);
1047 exp_print_tree (tree
->assign
.src
);
1048 fputc (')', config
.map_file
);
1051 function_like
= FALSE
;
1052 switch (tree
->type
.node_code
)
1057 case DATA_SEGMENT_ALIGN
:
1058 case DATA_SEGMENT_RELRO_END
:
1059 function_like
= TRUE
;
1063 exp_print_token (tree
->type
.node_code
, FALSE
);
1064 fputc (' ', config
.map_file
);
1066 fputc ('(', config
.map_file
);
1067 exp_print_tree (tree
->binary
.lhs
);
1069 fprintf (config
.map_file
, ", ");
1071 exp_print_token (tree
->type
.node_code
, TRUE
);
1072 exp_print_tree (tree
->binary
.rhs
);
1073 fputc (')', config
.map_file
);
1076 exp_print_tree (tree
->trinary
.cond
);
1077 fputc ('?', config
.map_file
);
1078 exp_print_tree (tree
->trinary
.lhs
);
1079 fputc (':', config
.map_file
);
1080 exp_print_tree (tree
->trinary
.rhs
);
1083 exp_print_token (tree
->unary
.type
.node_code
, FALSE
);
1084 if (tree
->unary
.child
)
1086 fprintf (config
.map_file
, " (");
1087 exp_print_tree (tree
->unary
.child
);
1088 fputc (')', config
.map_file
);
1093 fprintf (config
.map_file
, "ASSERT (");
1094 exp_print_tree (tree
->assert_s
.child
);
1095 fprintf (config
.map_file
, ", %s)", tree
->assert_s
.message
);
1099 if (tree
->type
.node_code
== NAME
)
1100 fputs (tree
->name
.name
, config
.map_file
);
1103 exp_print_token (tree
->type
.node_code
, FALSE
);
1104 if (tree
->name
.name
)
1105 fprintf (config
.map_file
, " (%s)", tree
->name
.name
);
1115 exp_get_vma (etree_type
*tree
, bfd_vma def
, char *name
)
1119 exp_fold_tree_no_dot (tree
);
1120 if (expld
.result
.valid_p
)
1121 return expld
.result
.value
;
1122 else if (name
!= NULL
&& expld
.phase
!= lang_mark_phase_enum
)
1123 einfo (_("%F%S: nonconstant expression for %s\n"), name
);
1129 exp_get_value_int (etree_type
*tree
, int def
, char *name
)
1131 return exp_get_vma (tree
, def
, name
);
1135 exp_get_fill (etree_type
*tree
, fill_type
*def
, char *name
)
1144 exp_fold_tree_no_dot (tree
);
1145 if (!expld
.result
.valid_p
)
1147 if (name
!= NULL
&& expld
.phase
!= lang_mark_phase_enum
)
1148 einfo (_("%F%S: nonconstant expression for %s\n"), name
);
1152 if (expld
.result
.str
!= NULL
&& (len
= strlen (expld
.result
.str
)) != 0)
1156 fill
= (fill_type
*) xmalloc ((len
+ 1) / 2 + sizeof (*fill
) - 1);
1157 fill
->size
= (len
+ 1) / 2;
1159 s
= (unsigned char *) expld
.result
.str
;
1167 digit
= (digit
- 'A' + '0' + 10) & 0xf;
1181 fill
= (fill_type
*) xmalloc (4 + sizeof (*fill
) - 1);
1182 val
= expld
.result
.value
;
1183 fill
->data
[0] = (val
>> 24) & 0xff;
1184 fill
->data
[1] = (val
>> 16) & 0xff;
1185 fill
->data
[2] = (val
>> 8) & 0xff;
1186 fill
->data
[3] = (val
>> 0) & 0xff;
1193 exp_get_abs_int (etree_type
*tree
, int def
, char *name
)
1197 exp_fold_tree_no_dot (tree
);
1199 if (expld
.result
.valid_p
)
1201 if (expld
.result
.section
!= NULL
)
1202 expld
.result
.value
+= expld
.result
.section
->vma
;
1203 return expld
.result
.value
;
1205 else if (name
!= NULL
&& expld
.phase
!= lang_mark_phase_enum
)
1207 lineno
= tree
->type
.lineno
;
1208 einfo (_("%F%S: nonconstant expression for %s\n"), name
);
1215 align_n (bfd_vma value
, bfd_vma align
)
1220 value
= (value
+ align
- 1) / align
;
1221 return value
* align
;