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 void exp_fold_tree_no_dot (etree_type *);
48 static bfd_vma align_n (bfd_vma, bfd_vma);
50 segment_type *segments;
52 struct ldexp_control expld;
54 /* Print the string representation of the given token. Surround it
55 with spaces if INFIX_P is TRUE. */
58 exp_print_token (token_code_type code, int infix_p)
92 { SECTIONS, "SECTIONS" },
93 { SIZEOF_HEADERS, "SIZEOF_HEADERS" },
95 { DEFINED, "DEFINED" },
96 { TARGET_K, "TARGET" },
97 { SEARCH_DIR, "SEARCH_DIR" },
101 { ALIGNOF, "ALIGNOF" },
102 { SIZEOF, "SIZEOF" },
104 { LOADADDR, "LOADADDR" },
105 { CONSTANT, "CONSTANT" },
106 { ABSOLUTE, "ABSOLUTE" },
109 { ASSERT_K, "ASSERT" },
110 { REL, "relocatable" },
111 { DATA_SEGMENT_ALIGN, "DATA_SEGMENT_ALIGN" },
112 { DATA_SEGMENT_RELRO_END, "DATA_SEGMENT_RELRO_END" },
113 { DATA_SEGMENT_END, "DATA_SEGMENT_END" },
114 { ORIGIN, "ORIGIN" },
115 { LENGTH, "LENGTH" },
116 { SEGMENT_START, "SEGMENT_START" }
120 for (idx = 0; idx < ARRAY_SIZE (table); idx++)
121 if (table[idx].code == code)
125 fputc (' ', config.map_file);
127 if (idx < ARRAY_SIZE (table))
128 fputs (table[idx].name, config.map_file);
130 fputc (code, config.map_file);
132 fprintf (config.map_file, "<code %d>", code);
135 fputc (' ', config.map_file);
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_rel (bfd_vma value, asection *section)
195 expld.result.valid_p = TRUE;
196 expld.result.value = value;
197 expld.result.str = NULL;
198 expld.result.section = section;
202 new_rel_from_abs (bfd_vma value)
204 expld.result.valid_p = TRUE;
205 expld.result.value = value - expld.section->vma;
206 expld.result.str = NULL;
207 expld.result.section = expld.section;
211 fold_unary (etree_type *tree)
213 exp_fold_tree_1 (tree->unary.child);
214 if (expld.result.valid_p)
216 switch (tree->type.node_code)
219 if (expld.phase != lang_first_phase_enum)
220 new_rel_from_abs (align_n (expld.dot, expld.result.value));
222 expld.result.valid_p = FALSE;
231 expld.result.value = ~expld.result.value;
236 expld.result.value = !expld.result.value;
241 expld.result.value = -expld.result.value;
245 /* Return next place aligned to value. */
246 if (expld.phase != lang_first_phase_enum)
249 expld.result.value = align_n (expld.dot, expld.result.value);
252 expld.result.valid_p = FALSE;
255 case DATA_SEGMENT_END:
256 if (expld.phase != lang_first_phase_enum
257 && expld.section == bfd_abs_section_ptr
258 && (expld.dataseg.phase == exp_dataseg_align_seen
259 || expld.dataseg.phase == exp_dataseg_relro_seen
260 || expld.dataseg.phase == exp_dataseg_adjust
261 || expld.dataseg.phase == exp_dataseg_relro_adjust
262 || expld.phase == lang_final_phase_enum))
264 if (expld.dataseg.phase == exp_dataseg_align_seen
265 || expld.dataseg.phase == exp_dataseg_relro_seen)
267 expld.dataseg.phase = exp_dataseg_end_seen;
268 expld.dataseg.end = expld.result.value;
272 expld.result.valid_p = FALSE;
283 fold_binary (etree_type *tree)
285 etree_value_type lhs;
286 exp_fold_tree_1 (tree->binary.lhs);
288 /* The SEGMENT_START operator is special because its first
289 operand is a string, not the name of a symbol. Note that the
290 operands have been swapped, so binary.lhs is second (default)
291 operand, binary.rhs is first operand. */
292 if (expld.result.valid_p && tree->type.node_code == SEGMENT_START)
294 const char *segment_name;
296 /* Check to see if the user has overridden the default
298 segment_name = tree->binary.rhs->name.name;
299 for (seg = segments; seg; seg = seg->next)
300 if (strcmp (seg->name, segment_name) == 0)
303 && config.magic_demand_paged
304 && (seg->value % config.maxpagesize) != 0)
305 einfo (_("%P: warning: address of `%s' isn't multiple of maximum page size\n"),
308 expld.result.value = seg->value;
309 expld.result.str = NULL;
310 expld.result.section = expld.section;
317 exp_fold_tree_1 (tree->binary.rhs);
318 expld.result.valid_p &= lhs.valid_p;
320 if (expld.result.valid_p)
322 /* If the values are from different sections, or this is an
323 absolute expression, make both the source arguments
324 absolute. However, adding or subtracting an absolute
325 value from a relative value is meaningful, and is an
327 if (expld.section != bfd_abs_section_ptr
328 && lhs.section == bfd_abs_section_ptr
329 && tree->type.node_code == '+')
331 /* Keep the section of the rhs term. */
332 expld.result.value = lhs.value + expld.result.value;
335 else if (expld.section != bfd_abs_section_ptr
336 && expld.result.section == bfd_abs_section_ptr
337 && (tree->type.node_code == '+'
338 || tree->type.node_code == '-'))
340 /* Keep the section of the lhs term. */
341 expld.result.section = lhs.section;
343 else if (expld.result.section != lhs.section
344 || expld.section == bfd_abs_section_ptr)
347 lhs.value += lhs.section->vma;
350 switch (tree->type.node_code)
353 if (expld.result.value != 0)
354 expld.result.value = ((bfd_signed_vma) lhs.value
355 % (bfd_signed_vma) expld.result.value);
356 else if (expld.phase != lang_mark_phase_enum)
357 einfo (_("%F%S %% by zero\n"));
361 if (expld.result.value != 0)
362 expld.result.value = ((bfd_signed_vma) lhs.value
363 / (bfd_signed_vma) expld.result.value);
364 else if (expld.phase != lang_mark_phase_enum)
365 einfo (_("%F%S / by zero\n"));
370 expld.result.value = lhs.value y expld.result.value; \
391 if (lhs.value > expld.result.value)
392 expld.result.value = lhs.value;
396 if (lhs.value < expld.result.value)
397 expld.result.value = lhs.value;
401 expld.result.value = align_n (lhs.value, expld.result.value);
404 case DATA_SEGMENT_ALIGN:
405 expld.dataseg.relro = exp_dataseg_relro_start;
406 if (expld.phase != lang_first_phase_enum
407 && expld.section == bfd_abs_section_ptr
408 && (expld.dataseg.phase == exp_dataseg_none
409 || expld.dataseg.phase == exp_dataseg_adjust
410 || expld.dataseg.phase == exp_dataseg_relro_adjust
411 || expld.phase == lang_final_phase_enum))
413 bfd_vma maxpage = lhs.value;
414 bfd_vma commonpage = expld.result.value;
416 expld.result.value = align_n (expld.dot, maxpage);
417 if (expld.dataseg.phase == exp_dataseg_relro_adjust)
418 expld.result.value = expld.dataseg.base;
419 else if (expld.dataseg.phase != exp_dataseg_adjust)
421 expld.result.value += expld.dot & (maxpage - 1);
422 if (expld.phase == lang_allocating_phase_enum)
424 expld.dataseg.phase = exp_dataseg_align_seen;
425 expld.dataseg.min_base = expld.dot;
426 expld.dataseg.base = expld.result.value;
427 expld.dataseg.pagesize = commonpage;
428 expld.dataseg.maxpagesize = maxpage;
429 expld.dataseg.relro_end = 0;
432 else if (commonpage < maxpage)
433 expld.result.value += ((expld.dot + commonpage - 1)
434 & (maxpage - commonpage));
437 expld.result.valid_p = FALSE;
440 case DATA_SEGMENT_RELRO_END:
441 expld.dataseg.relro = exp_dataseg_relro_end;
442 if (expld.phase != lang_first_phase_enum
443 && (expld.dataseg.phase == exp_dataseg_align_seen
444 || expld.dataseg.phase == exp_dataseg_adjust
445 || expld.dataseg.phase == exp_dataseg_relro_adjust
446 || expld.phase == lang_final_phase_enum))
448 if (expld.dataseg.phase == exp_dataseg_align_seen
449 || expld.dataseg.phase == exp_dataseg_relro_adjust)
450 expld.dataseg.relro_end = lhs.value + expld.result.value;
452 if (expld.dataseg.phase == exp_dataseg_relro_adjust
453 && (expld.dataseg.relro_end
454 & (expld.dataseg.pagesize - 1)))
456 expld.dataseg.relro_end += expld.dataseg.pagesize - 1;
457 expld.dataseg.relro_end &= ~(expld.dataseg.pagesize - 1);
458 expld.result.value = (expld.dataseg.relro_end
459 - expld.result.value);
462 expld.result.value = lhs.value;
464 if (expld.dataseg.phase == exp_dataseg_align_seen)
465 expld.dataseg.phase = exp_dataseg_relro_seen;
468 expld.result.valid_p = FALSE;
478 fold_trinary (etree_type *tree)
480 exp_fold_tree_1 (tree->trinary.cond);
481 if (expld.result.valid_p)
482 exp_fold_tree_1 (expld.result.value
484 : tree->trinary.rhs);
488 fold_name (etree_type *tree)
490 memset (&expld.result, 0, sizeof (expld.result));
492 switch (tree->type.node_code)
495 if (expld.phase != lang_first_phase_enum)
497 bfd_vma hdr_size = 0;
498 /* Don't find the real header size if only marking sections;
499 The bfd function may cache incorrect data. */
500 if (expld.phase != lang_mark_phase_enum)
501 hdr_size = bfd_sizeof_headers (link_info.output_bfd, &link_info);
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 expld.result.value = (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));
525 expld.result.section = expld.section;
526 expld.result.valid_p = TRUE;
531 if (expld.phase == lang_first_phase_enum)
533 else if (tree->name.name[0] == '.' && tree->name.name[1] == 0)
534 new_rel_from_abs (expld.dot);
537 struct bfd_link_hash_entry *h;
539 h = bfd_wrapped_link_hash_lookup (link_info.output_bfd,
544 einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n"));
545 else if (h->type == bfd_link_hash_defined
546 || h->type == bfd_link_hash_defweak)
548 if (bfd_is_abs_section (h->u.def.section))
549 new_abs (h->u.def.value);
552 asection *output_section;
554 output_section = h->u.def.section->output_section;
555 if (output_section == NULL)
557 if (expld.phase != lang_mark_phase_enum)
558 einfo (_("%X%S: unresolvable symbol `%s'"
559 " referenced in expression\n"),
563 new_rel (h->u.def.value + h->u.def.section->output_offset,
567 else if (expld.phase == lang_final_phase_enum
568 || expld.assigning_to_dot)
569 einfo (_("%F%S: undefined symbol `%s' referenced in expression\n"),
571 else if (h->type == bfd_link_hash_new)
573 h->type = bfd_link_hash_undefined;
574 h->u.undef.abfd = NULL;
575 if (h->u.undef.next == NULL && h != link_info.hash->undefs_tail)
576 bfd_link_add_undef (link_info.hash, h);
582 if (expld.phase != lang_first_phase_enum)
584 lang_output_section_statement_type *os;
586 os = lang_output_section_find (tree->name.name);
589 if (expld.phase == lang_final_phase_enum)
590 einfo (_("%F%S: undefined section `%s' referenced in expression\n"),
593 else if (os->processed_vma)
594 new_rel (0, os->bfd_section);
599 if (expld.phase != lang_first_phase_enum)
601 lang_output_section_statement_type *os;
603 os = lang_output_section_find (tree->name.name);
606 if (expld.phase == lang_final_phase_enum)
607 einfo (_("%F%S: undefined section `%s' referenced in expression\n"),
610 else if (os->processed_lma)
612 if (os->load_base == NULL)
613 new_abs (os->bfd_section->lma);
616 exp_fold_tree_1 (os->load_base);
617 if (expld.result.valid_p)
626 if (expld.phase != lang_first_phase_enum)
628 lang_output_section_statement_type *os;
630 os = lang_output_section_find (tree->name.name);
633 if (expld.phase == lang_final_phase_enum)
634 einfo (_("%F%S: undefined section `%s' referenced in expression\n"),
638 else if (os->processed_vma)
642 if (tree->type.node_code == SIZEOF)
643 val = (os->bfd_section->size
644 / bfd_octets_per_byte (link_info.output_bfd));
646 val = (bfd_vma)1 << os->bfd_section->alignment_power;
655 lang_memory_region_type *mem;
657 mem = lang_memory_region_lookup (tree->name.name, FALSE);
659 new_abs (mem->length);
661 einfo (_("%F%S: undefined MEMORY region `%s'"
662 " referenced in expression\n"), tree->name.name);
668 lang_memory_region_type *mem;
670 mem = lang_memory_region_lookup (tree->name.name, FALSE);
672 new_abs (mem->origin);
674 einfo (_("%F%S: undefined MEMORY region `%s'"
675 " referenced in expression\n"), tree->name.name);
680 if (strcmp (tree->name.name, "MAXPAGESIZE") == 0)
681 new_abs (config.maxpagesize);
682 else if (strcmp (tree->name.name, "COMMONPAGESIZE") == 0)
683 new_abs (config.commonpagesize);
685 einfo (_("%F%S: unknown constant `%s' referenced in expression\n"),
696 exp_fold_tree_1 (etree_type *tree)
700 memset (&expld.result, 0, sizeof (expld.result));
704 switch (tree->type.node_class)
707 new_rel (tree->value.value, expld.section);
708 expld.result.str = tree->value.str;
712 if (expld.phase != lang_first_phase_enum)
714 asection *output_section = tree->rel.section->output_section;
715 new_rel (tree->rel.value + tree->rel.section->output_offset,
719 memset (&expld.result, 0, sizeof (expld.result));
723 exp_fold_tree_1 (tree->assert_s.child);
724 if (expld.phase == lang_final_phase_enum && !expld.result.value)
725 einfo ("%X%P: %s\n", tree->assert_s.message);
743 if (tree->assign.dst[0] == '.' && tree->assign.dst[1] == 0)
745 /* Assignment to dot can only be done during allocation. */
746 if (tree->type.node_class != etree_assign)
747 einfo (_("%F%S can not PROVIDE assignment to location counter\n"));
748 if (expld.phase == lang_mark_phase_enum
749 || expld.phase == lang_allocating_phase_enum
750 || (expld.phase == lang_final_phase_enum
751 && expld.section == bfd_abs_section_ptr))
753 /* Notify the folder that this is an assignment to dot. */
754 expld.assigning_to_dot = TRUE;
755 exp_fold_tree_1 (tree->assign.src);
756 expld.assigning_to_dot = FALSE;
758 if (!expld.result.valid_p)
760 if (expld.phase != lang_mark_phase_enum)
761 einfo (_("%F%S invalid assignment to location counter\n"));
763 else if (expld.dotp == NULL)
764 einfo (_("%F%S assignment to location counter"
765 " invalid outside of SECTION\n"));
770 nextdot = expld.result.value + expld.result.section->vma;
771 if (nextdot < expld.dot
772 && expld.section != bfd_abs_section_ptr)
773 einfo (_("%F%S cannot move location counter backwards"
774 " (from %V to %V)\n"), expld.dot, nextdot);
778 *expld.dotp = nextdot;
783 memset (&expld.result, 0, sizeof (expld.result));
787 struct bfd_link_hash_entry *h = NULL;
789 if (tree->type.node_class == etree_provide)
791 h = bfd_link_hash_lookup (link_info.hash, tree->assign.dst,
794 || (h->type != bfd_link_hash_new
795 && h->type != bfd_link_hash_undefined
796 && h->type != bfd_link_hash_common))
798 /* Do nothing. The symbol was never referenced, or was
799 defined by some object. */
804 exp_fold_tree_1 (tree->assign.src);
805 if (expld.result.valid_p)
809 h = bfd_link_hash_lookup (link_info.hash, tree->assign.dst,
812 einfo (_("%P%F:%s: hash creation failed\n"),
816 /* FIXME: Should we worry if the symbol is already
818 lang_update_definedness (tree->assign.dst, h);
819 h->type = bfd_link_hash_defined;
820 h->u.def.value = expld.result.value;
821 h->u.def.section = expld.result.section;
822 if (tree->type.node_class == etree_provide)
823 tree->type.node_class = etree_provided;
825 /* Copy the symbol type if this is a simple assignment of
826 one symbol to annother. */
827 if (tree->assign.src->type.node_class == etree_name)
829 struct bfd_link_hash_entry *hsrc;
831 hsrc = bfd_link_hash_lookup (link_info.hash,
832 tree->assign.src->name.name,
835 bfd_copy_link_hash_symbol_type (link_info.output_bfd, h,
839 else if (expld.phase == lang_final_phase_enum)
841 h = bfd_link_hash_lookup (link_info.hash, tree->assign.dst,
844 && h->type == bfd_link_hash_new)
845 h->type = bfd_link_hash_undefined;
856 memset (&expld.result, 0, sizeof (expld.result));
862 exp_fold_tree (etree_type *tree, asection *current_section, bfd_vma *dotp)
866 expld.section = current_section;
867 exp_fold_tree_1 (tree);
871 exp_fold_tree_no_dot (etree_type *tree)
875 expld.section = bfd_abs_section_ptr;
876 exp_fold_tree_1 (tree);
880 exp_binop (int code, etree_type *lhs, etree_type *rhs)
882 etree_type value, *new_e;
884 value.type.node_code = code;
885 value.type.lineno = lhs->type.lineno;
886 value.binary.lhs = lhs;
887 value.binary.rhs = rhs;
888 value.type.node_class = etree_binary;
889 exp_fold_tree_no_dot (&value);
890 if (expld.result.valid_p)
891 return exp_intop (expld.result.value);
893 new_e = (etree_type *) stat_alloc (sizeof (new_e->binary));
894 memcpy (new_e, &value, sizeof (new_e->binary));
899 exp_trinop (int code, etree_type *cond, etree_type *lhs, etree_type *rhs)
901 etree_type value, *new_e;
903 value.type.node_code = code;
904 value.type.lineno = lhs->type.lineno;
905 value.trinary.lhs = lhs;
906 value.trinary.cond = cond;
907 value.trinary.rhs = rhs;
908 value.type.node_class = etree_trinary;
909 exp_fold_tree_no_dot (&value);
910 if (expld.result.valid_p)
911 return exp_intop (expld.result.value);
913 new_e = (etree_type *) stat_alloc (sizeof (new_e->trinary));
914 memcpy (new_e, &value, sizeof (new_e->trinary));
919 exp_unop (int code, etree_type *child)
921 etree_type value, *new_e;
923 value.unary.type.node_code = code;
924 value.unary.type.lineno = child->type.lineno;
925 value.unary.child = child;
926 value.unary.type.node_class = etree_unary;
927 exp_fold_tree_no_dot (&value);
928 if (expld.result.valid_p)
929 return exp_intop (expld.result.value);
931 new_e = (etree_type *) stat_alloc (sizeof (new_e->unary));
932 memcpy (new_e, &value, sizeof (new_e->unary));
937 exp_nameop (int code, const char *name)
939 etree_type value, *new_e;
941 value.name.type.node_code = code;
942 value.name.type.lineno = lineno;
943 value.name.name = name;
944 value.name.type.node_class = etree_name;
946 exp_fold_tree_no_dot (&value);
947 if (expld.result.valid_p)
948 return exp_intop (expld.result.value);
950 new_e = (etree_type *) stat_alloc (sizeof (new_e->name));
951 memcpy (new_e, &value, sizeof (new_e->name));
957 exp_assop (int code, const char *dst, etree_type *src)
961 new_e = (etree_type *) stat_alloc (sizeof (new_e->assign));
962 new_e->type.node_code = code;
963 new_e->type.lineno = src->type.lineno;
964 new_e->type.node_class = etree_assign;
965 new_e->assign.src = src;
966 new_e->assign.dst = dst;
970 /* Handle PROVIDE. */
973 exp_provide (const char *dst, etree_type *src, bfd_boolean hidden)
977 n = (etree_type *) stat_alloc (sizeof (n->assign));
978 n->assign.type.node_code = '=';
979 n->assign.type.lineno = src->type.lineno;
980 n->assign.type.node_class = etree_provide;
983 n->assign.hidden = hidden;
990 exp_assert (etree_type *exp, const char *message)
994 n = (etree_type *) stat_alloc (sizeof (n->assert_s));
995 n->assert_s.type.node_code = '!';
996 n->assert_s.type.lineno = exp->type.lineno;
997 n->assert_s.type.node_class = etree_assert;
998 n->assert_s.child = exp;
999 n->assert_s.message = message;
1004 exp_print_tree (etree_type *tree)
1006 bfd_boolean function_like;
1008 if (config.map_file == NULL)
1009 config.map_file = stderr;
1013 minfo ("NULL TREE\n");
1017 switch (tree->type.node_class)
1020 minfo ("0x%v", tree->value.value);
1023 if (tree->rel.section->owner != NULL)
1024 minfo ("%B:", tree->rel.section->owner);
1025 minfo ("%s+0x%v", tree->rel.section->name, tree->rel.value);
1028 fputs (tree->assign.dst, config.map_file);
1029 exp_print_token (tree->type.node_code, TRUE);
1030 exp_print_tree (tree->assign.src);
1033 case etree_provided:
1034 fprintf (config.map_file, "PROVIDE (%s, ", tree->assign.dst);
1035 exp_print_tree (tree->assign.src);
1036 fputc (')', config.map_file);
1039 function_like = FALSE;
1040 switch (tree->type.node_code)
1045 case DATA_SEGMENT_ALIGN:
1046 case DATA_SEGMENT_RELRO_END:
1047 function_like = TRUE;
1051 exp_print_token (tree->type.node_code, FALSE);
1052 fputc (' ', config.map_file);
1054 fputc ('(', config.map_file);
1055 exp_print_tree (tree->binary.lhs);
1057 fprintf (config.map_file, ", ");
1059 exp_print_token (tree->type.node_code, TRUE);
1060 exp_print_tree (tree->binary.rhs);
1061 fputc (')', config.map_file);
1064 exp_print_tree (tree->trinary.cond);
1065 fputc ('?', config.map_file);
1066 exp_print_tree (tree->trinary.lhs);
1067 fputc (':', config.map_file);
1068 exp_print_tree (tree->trinary.rhs);
1071 exp_print_token (tree->unary.type.node_code, FALSE);
1072 if (tree->unary.child)
1074 fprintf (config.map_file, " (");
1075 exp_print_tree (tree->unary.child);
1076 fputc (')', config.map_file);
1081 fprintf (config.map_file, "ASSERT (");
1082 exp_print_tree (tree->assert_s.child);
1083 fprintf (config.map_file, ", %s)", tree->assert_s.message);
1087 if (tree->type.node_code == NAME)
1088 fputs (tree->name.name, config.map_file);
1091 exp_print_token (tree->type.node_code, FALSE);
1092 if (tree->name.name)
1093 fprintf (config.map_file, " (%s)", tree->name.name);
1103 exp_get_vma (etree_type *tree, bfd_vma def, char *name)
1107 exp_fold_tree_no_dot (tree);
1108 if (expld.result.valid_p)
1109 return expld.result.value;
1110 else if (name != NULL && expld.phase != lang_mark_phase_enum)
1111 einfo (_("%F%S: nonconstant expression for %s\n"), name);
1117 exp_get_value_int (etree_type *tree, int def, char *name)
1119 return exp_get_vma (tree, def, name);
1123 exp_get_fill (etree_type *tree, fill_type *def, char *name)
1132 exp_fold_tree_no_dot (tree);
1133 if (!expld.result.valid_p)
1135 if (name != NULL && expld.phase != lang_mark_phase_enum)
1136 einfo (_("%F%S: nonconstant expression for %s\n"), name);
1140 if (expld.result.str != NULL && (len = strlen (expld.result.str)) != 0)
1144 fill = (fill_type *) xmalloc ((len + 1) / 2 + sizeof (*fill) - 1);
1145 fill->size = (len + 1) / 2;
1147 s = (unsigned char *) expld.result.str;
1155 digit = (digit - 'A' + '0' + 10) & 0xf;
1169 fill = (fill_type *) xmalloc (4 + sizeof (*fill) - 1);
1170 val = expld.result.value;
1171 fill->data[0] = (val >> 24) & 0xff;
1172 fill->data[1] = (val >> 16) & 0xff;
1173 fill->data[2] = (val >> 8) & 0xff;
1174 fill->data[3] = (val >> 0) & 0xff;
1181 exp_get_abs_int (etree_type *tree, int def, char *name)
1185 exp_fold_tree_no_dot (tree);
1187 if (expld.result.valid_p)
1189 expld.result.value += expld.result.section->vma;
1190 return expld.result.value;
1192 else if (name != NULL && expld.phase != lang_mark_phase_enum)
1194 lineno = tree->type.lineno;
1195 einfo (_("%F%S: nonconstant expression for %s\n"), name);
1202 align_n (bfd_vma value, bfd_vma align)
1207 value = (value + align - 1) / align;
1208 return value * align;