Commit | Line | Data |
---|---|---|
252b5132 | 1 | /* This module handles expression trees. |
6f2750fe | 2 | Copyright (C) 1991-2016 Free Software Foundation, Inc. |
8c95a62e | 3 | Written by Steve Chamberlain of Cygnus Support <sac@cygnus.com>. |
252b5132 | 4 | |
f96b4a7b | 5 | This file is part of the GNU Binutils. |
252b5132 | 6 | |
f96b4a7b | 7 | This program is free software; you can redistribute it and/or modify |
3ec57632 | 8 | it under the terms of the GNU General Public License as published by |
f96b4a7b NC |
9 | the Free Software Foundation; either version 3 of the License, or |
10 | (at your option) any later version. | |
252b5132 | 11 | |
f96b4a7b | 12 | This program is distributed in the hope that it will be useful, |
3ec57632 NC |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
252b5132 | 16 | |
3ec57632 | 17 | You should have received a copy of the GNU General Public License |
f96b4a7b NC |
18 | along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, | |
20 | MA 02110-1301, USA. */ | |
21 | ||
252b5132 | 22 | |
8c95a62e | 23 | /* This module is in charge of working out the contents of expressions. |
252b5132 | 24 | |
8c95a62e KH |
25 | It has to keep track of the relative/absness of a symbol etc. This |
26 | is done by keeping all values in a struct (an etree_value_type) | |
27 | which contains a value, a section to which it is relative and a | |
28 | valid bit. */ | |
252b5132 | 29 | |
252b5132 | 30 | #include "sysdep.h" |
3db64b00 | 31 | #include "bfd.h" |
252b5132 RH |
32 | #include "bfdlink.h" |
33 | ||
34 | #include "ld.h" | |
35 | #include "ldmain.h" | |
36 | #include "ldmisc.h" | |
37 | #include "ldexp.h" | |
f856040a | 38 | #include "ldlex.h" |
df2a7313 | 39 | #include <ldgram.h> |
252b5132 | 40 | #include "ldlang.h" |
c7d701b0 | 41 | #include "libiberty.h" |
2c382fb6 | 42 | #include "safe-ctype.h" |
252b5132 | 43 | |
e9ee469a | 44 | static void exp_fold_tree_1 (etree_type *); |
e9ee469a | 45 | static bfd_vma align_n (bfd_vma, bfd_vma); |
2d20f7bf | 46 | |
ba916c8a MM |
47 | segment_type *segments; |
48 | ||
e9ee469a | 49 | struct ldexp_control expld; |
fbbb9ac5 | 50 | |
18d6a79d | 51 | /* This structure records symbols for which we need to keep track of |
975f8a9e AM |
52 | definedness for use in the DEFINED () test. It is also used in |
53 | making absolute symbols section relative late in the link. */ | |
18d6a79d AM |
54 | |
55 | struct definedness_hash_entry | |
56 | { | |
57 | struct bfd_hash_entry root; | |
975f8a9e AM |
58 | |
59 | /* If this symbol was assigned from "dot" outside of an output | |
60 | section statement, the section we'd like it relative to. */ | |
61 | asection *final_sec; | |
62 | ||
63 | /* Symbol was defined by an object file. */ | |
18d6a79d | 64 | unsigned int by_object : 1; |
975f8a9e AM |
65 | |
66 | /* Symbols was defined by a script. */ | |
18d6a79d | 67 | unsigned int by_script : 1; |
975f8a9e AM |
68 | |
69 | /* Low bit of iteration count. Symbols with matching iteration have | |
70 | been defined in this pass over the script. */ | |
18d6a79d AM |
71 | unsigned int iteration : 1; |
72 | }; | |
73 | ||
74 | static struct bfd_hash_table definedness_table; | |
75 | ||
7b17f854 | 76 | /* Print the string representation of the given token. Surround it |
b34976b6 | 77 | with spaces if INFIX_P is TRUE. */ |
7b17f854 | 78 | |
252b5132 | 79 | static void |
1579bae1 | 80 | exp_print_token (token_code_type code, int infix_p) |
252b5132 | 81 | { |
4da711b1 | 82 | static const struct |
c7d701b0 | 83 | { |
8c95a62e | 84 | token_code_type code; |
0aa7f586 | 85 | const char *name; |
c7d701b0 NC |
86 | } |
87 | table[] = | |
88 | { | |
8c95a62e | 89 | { INT, "int" }, |
8c95a62e KH |
90 | { NAME, "NAME" }, |
91 | { PLUSEQ, "+=" }, | |
92 | { MINUSEQ, "-=" }, | |
93 | { MULTEQ, "*=" }, | |
94 | { DIVEQ, "/=" }, | |
95 | { LSHIFTEQ, "<<=" }, | |
96 | { RSHIFTEQ, ">>=" }, | |
97 | { ANDEQ, "&=" }, | |
98 | { OREQ, "|=" }, | |
99 | { OROR, "||" }, | |
100 | { ANDAND, "&&" }, | |
101 | { EQ, "==" }, | |
102 | { NE, "!=" }, | |
103 | { LE, "<=" }, | |
104 | { GE, ">=" }, | |
105 | { LSHIFT, "<<" }, | |
7cecdbff | 106 | { RSHIFT, ">>" }, |
2e53f7d6 | 107 | { LOG2CEIL, "LOG2CEIL" }, |
8c95a62e KH |
108 | { ALIGN_K, "ALIGN" }, |
109 | { BLOCK, "BLOCK" }, | |
c7d701b0 NC |
110 | { QUAD, "QUAD" }, |
111 | { SQUAD, "SQUAD" }, | |
112 | { LONG, "LONG" }, | |
113 | { SHORT, "SHORT" }, | |
114 | { BYTE, "BYTE" }, | |
8c95a62e KH |
115 | { SECTIONS, "SECTIONS" }, |
116 | { SIZEOF_HEADERS, "SIZEOF_HEADERS" }, | |
8c95a62e KH |
117 | { MEMORY, "MEMORY" }, |
118 | { DEFINED, "DEFINED" }, | |
119 | { TARGET_K, "TARGET" }, | |
120 | { SEARCH_DIR, "SEARCH_DIR" }, | |
121 | { MAP, "MAP" }, | |
8c95a62e | 122 | { ENTRY, "ENTRY" }, |
c7d701b0 | 123 | { NEXT, "NEXT" }, |
362c1d1a | 124 | { ALIGNOF, "ALIGNOF" }, |
c7d701b0 NC |
125 | { SIZEOF, "SIZEOF" }, |
126 | { ADDR, "ADDR" }, | |
127 | { LOADADDR, "LOADADDR" }, | |
24718e3b | 128 | { CONSTANT, "CONSTANT" }, |
8c0848b5 AM |
129 | { ABSOLUTE, "ABSOLUTE" }, |
130 | { MAX_K, "MAX" }, | |
131 | { MIN_K, "MIN" }, | |
132 | { ASSERT_K, "ASSERT" }, | |
1049f94e | 133 | { REL, "relocatable" }, |
2d20f7bf | 134 | { DATA_SEGMENT_ALIGN, "DATA_SEGMENT_ALIGN" }, |
8c37241b | 135 | { DATA_SEGMENT_RELRO_END, "DATA_SEGMENT_RELRO_END" }, |
ba916c8a | 136 | { DATA_SEGMENT_END, "DATA_SEGMENT_END" }, |
3ec57632 NC |
137 | { ORIGIN, "ORIGIN" }, |
138 | { LENGTH, "LENGTH" }, | |
ba916c8a | 139 | { SEGMENT_START, "SEGMENT_START" } |
8c95a62e | 140 | }; |
252b5132 RH |
141 | unsigned int idx; |
142 | ||
7b17f854 RS |
143 | for (idx = 0; idx < ARRAY_SIZE (table); idx++) |
144 | if (table[idx].code == code) | |
145 | break; | |
c7d701b0 | 146 | |
7b17f854 RS |
147 | if (infix_p) |
148 | fputc (' ', config.map_file); | |
149 | ||
150 | if (idx < ARRAY_SIZE (table)) | |
151 | fputs (table[idx].name, config.map_file); | |
152 | else if (code < 127) | |
153 | fputc (code, config.map_file); | |
c7d701b0 | 154 | else |
7b17f854 RS |
155 | fprintf (config.map_file, "<code %d>", code); |
156 | ||
157 | if (infix_p) | |
158 | fputc (' ', config.map_file); | |
252b5132 RH |
159 | } |
160 | ||
2e53f7d6 NC |
161 | static void |
162 | make_log2ceil (void) | |
163 | { | |
164 | bfd_vma value = expld.result.value; | |
165 | bfd_vma result = -1; | |
166 | bfd_boolean round_up = FALSE; | |
167 | ||
168 | do | |
169 | { | |
170 | result++; | |
171 | /* If more than one bit is set in the value we will need to round up. */ | |
172 | if ((value > 1) && (value & 1)) | |
173 | round_up = TRUE; | |
174 | } | |
175 | while (value >>= 1); | |
176 | ||
177 | if (round_up) | |
178 | result += 1; | |
179 | expld.result.section = NULL; | |
180 | expld.result.value = result; | |
181 | } | |
182 | ||
4de2d33d | 183 | static void |
e9ee469a | 184 | make_abs (void) |
252b5132 | 185 | { |
7542af2a AM |
186 | if (expld.result.section != NULL) |
187 | expld.result.value += expld.result.section->vma; | |
e9ee469a | 188 | expld.result.section = bfd_abs_section_ptr; |
975f8a9e | 189 | expld.rel_from_abs = FALSE; |
252b5132 RH |
190 | } |
191 | ||
e9ee469a | 192 | static void |
1579bae1 | 193 | new_abs (bfd_vma value) |
252b5132 | 194 | { |
e9ee469a AM |
195 | expld.result.valid_p = TRUE; |
196 | expld.result.section = bfd_abs_section_ptr; | |
197 | expld.result.value = value; | |
198 | expld.result.str = NULL; | |
252b5132 RH |
199 | } |
200 | ||
252b5132 | 201 | etree_type * |
1579bae1 | 202 | exp_intop (bfd_vma value) |
252b5132 | 203 | { |
d3ce72d0 NC |
204 | etree_type *new_e = (etree_type *) stat_alloc (sizeof (new_e->value)); |
205 | new_e->type.node_code = INT; | |
dab69f68 | 206 | new_e->type.filename = ldlex_filename (); |
d3ce72d0 NC |
207 | new_e->type.lineno = lineno; |
208 | new_e->value.value = value; | |
209 | new_e->value.str = NULL; | |
210 | new_e->type.node_class = etree_value; | |
211 | return new_e; | |
2c382fb6 | 212 | } |
252b5132 | 213 | |
2c382fb6 | 214 | etree_type * |
1579bae1 | 215 | exp_bigintop (bfd_vma value, char *str) |
2c382fb6 | 216 | { |
d3ce72d0 NC |
217 | etree_type *new_e = (etree_type *) stat_alloc (sizeof (new_e->value)); |
218 | new_e->type.node_code = INT; | |
dab69f68 | 219 | new_e->type.filename = ldlex_filename (); |
d3ce72d0 NC |
220 | new_e->type.lineno = lineno; |
221 | new_e->value.value = value; | |
222 | new_e->value.str = str; | |
223 | new_e->type.node_class = etree_value; | |
224 | return new_e; | |
252b5132 RH |
225 | } |
226 | ||
1049f94e | 227 | /* Build an expression representing an unnamed relocatable value. */ |
252b5132 RH |
228 | |
229 | etree_type * | |
1579bae1 | 230 | exp_relop (asection *section, bfd_vma value) |
252b5132 | 231 | { |
d3ce72d0 NC |
232 | etree_type *new_e = (etree_type *) stat_alloc (sizeof (new_e->rel)); |
233 | new_e->type.node_code = REL; | |
dab69f68 | 234 | new_e->type.filename = ldlex_filename (); |
d3ce72d0 NC |
235 | new_e->type.lineno = lineno; |
236 | new_e->type.node_class = etree_rel; | |
237 | new_e->rel.section = section; | |
238 | new_e->rel.value = value; | |
239 | return new_e; | |
252b5132 RH |
240 | } |
241 | ||
7542af2a AM |
242 | static void |
243 | new_number (bfd_vma value) | |
244 | { | |
245 | expld.result.valid_p = TRUE; | |
246 | expld.result.value = value; | |
247 | expld.result.str = NULL; | |
248 | expld.result.section = NULL; | |
249 | } | |
250 | ||
e9ee469a | 251 | static void |
5942515f | 252 | new_rel (bfd_vma value, asection *section) |
252b5132 | 253 | { |
e9ee469a AM |
254 | expld.result.valid_p = TRUE; |
255 | expld.result.value = value; | |
5942515f | 256 | expld.result.str = NULL; |
e9ee469a | 257 | expld.result.section = section; |
252b5132 RH |
258 | } |
259 | ||
e9ee469a AM |
260 | static void |
261 | new_rel_from_abs (bfd_vma value) | |
252b5132 | 262 | { |
d2667025 AM |
263 | asection *s = expld.section; |
264 | ||
975f8a9e | 265 | expld.rel_from_abs = TRUE; |
e9ee469a | 266 | expld.result.valid_p = TRUE; |
d2667025 | 267 | expld.result.value = value - s->vma; |
e9ee469a | 268 | expld.result.str = NULL; |
d2667025 | 269 | expld.result.section = s; |
252b5132 RH |
270 | } |
271 | ||
18d6a79d AM |
272 | /* New-function for the definedness hash table. */ |
273 | ||
274 | static struct bfd_hash_entry * | |
275 | definedness_newfunc (struct bfd_hash_entry *entry, | |
276 | struct bfd_hash_table *table ATTRIBUTE_UNUSED, | |
277 | const char *name ATTRIBUTE_UNUSED) | |
278 | { | |
279 | struct definedness_hash_entry *ret = (struct definedness_hash_entry *) entry; | |
280 | ||
281 | if (ret == NULL) | |
282 | ret = (struct definedness_hash_entry *) | |
283 | bfd_hash_allocate (table, sizeof (struct definedness_hash_entry)); | |
284 | ||
285 | if (ret == NULL) | |
286 | einfo (_("%P%F: bfd_hash_allocate failed creating symbol %s\n"), name); | |
287 | ||
288 | ret->by_object = 0; | |
289 | ret->by_script = 0; | |
290 | ret->iteration = 0; | |
291 | return &ret->root; | |
292 | } | |
293 | ||
294 | /* Called during processing of linker script script expressions. | |
295 | For symbols assigned in a linker script, return a struct describing | |
296 | where the symbol is defined relative to the current expression, | |
297 | otherwise return NULL. */ | |
298 | ||
299 | static struct definedness_hash_entry * | |
300 | symbol_defined (const char *name) | |
301 | { | |
302 | return ((struct definedness_hash_entry *) | |
303 | bfd_hash_lookup (&definedness_table, name, FALSE, FALSE)); | |
304 | } | |
305 | ||
422f1c65 AM |
306 | /* Update the definedness state of NAME. Return FALSE if script symbol |
307 | is multiply defining a strong symbol in an object. */ | |
18d6a79d | 308 | |
422f1c65 | 309 | static bfd_boolean |
18d6a79d AM |
310 | update_definedness (const char *name, struct bfd_link_hash_entry *h) |
311 | { | |
422f1c65 | 312 | bfd_boolean ret; |
18d6a79d AM |
313 | struct definedness_hash_entry *defentry |
314 | = (struct definedness_hash_entry *) | |
315 | bfd_hash_lookup (&definedness_table, name, TRUE, FALSE); | |
316 | ||
317 | if (defentry == NULL) | |
318 | einfo (_("%P%F: bfd_hash_lookup failed creating symbol %s\n"), name); | |
319 | ||
320 | /* If the symbol was already defined, and not by a script, then it | |
cd8e2bcf | 321 | must be defined by an object file or by the linker target code. */ |
422f1c65 | 322 | ret = TRUE; |
18d6a79d | 323 | if (!defentry->by_script |
cd8e2bcf AM |
324 | && (h->type == bfd_link_hash_defined |
325 | || h->type == bfd_link_hash_defweak | |
326 | || h->type == bfd_link_hash_common)) | |
422f1c65 AM |
327 | { |
328 | defentry->by_object = 1; | |
329 | if (h->type == bfd_link_hash_defined | |
330 | && h->u.def.section->output_section != NULL | |
331 | && !h->linker_def) | |
332 | ret = FALSE; | |
333 | } | |
18d6a79d AM |
334 | |
335 | defentry->by_script = 1; | |
336 | defentry->iteration = lang_statement_iteration; | |
975f8a9e AM |
337 | defentry->final_sec = bfd_abs_section_ptr; |
338 | if (expld.phase == lang_final_phase_enum | |
339 | && expld.rel_from_abs | |
340 | && expld.result.section == bfd_abs_section_ptr) | |
341 | defentry->final_sec = section_for_dot (); | |
422f1c65 | 342 | return ret; |
18d6a79d AM |
343 | } |
344 | ||
e9ee469a AM |
345 | static void |
346 | fold_unary (etree_type *tree) | |
0ae1cf52 | 347 | { |
e9ee469a AM |
348 | exp_fold_tree_1 (tree->unary.child); |
349 | if (expld.result.valid_p) | |
0ae1cf52 AM |
350 | { |
351 | switch (tree->type.node_code) | |
352 | { | |
353 | case ALIGN_K: | |
e9ee469a | 354 | if (expld.phase != lang_first_phase_enum) |
e0a3af22 | 355 | new_rel_from_abs (align_n (expld.dot, expld.result.value)); |
0ae1cf52 | 356 | else |
e9ee469a | 357 | expld.result.valid_p = FALSE; |
0ae1cf52 AM |
358 | break; |
359 | ||
360 | case ABSOLUTE: | |
e9ee469a | 361 | make_abs (); |
0ae1cf52 AM |
362 | break; |
363 | ||
2e53f7d6 NC |
364 | case LOG2CEIL: |
365 | make_log2ceil (); | |
366 | break; | |
367 | ||
0ae1cf52 | 368 | case '~': |
e9ee469a | 369 | expld.result.value = ~expld.result.value; |
0ae1cf52 AM |
370 | break; |
371 | ||
372 | case '!': | |
e9ee469a | 373 | expld.result.value = !expld.result.value; |
0ae1cf52 AM |
374 | break; |
375 | ||
376 | case '-': | |
e9ee469a | 377 | expld.result.value = -expld.result.value; |
0ae1cf52 AM |
378 | break; |
379 | ||
380 | case NEXT: | |
381 | /* Return next place aligned to value. */ | |
e9ee469a | 382 | if (expld.phase != lang_first_phase_enum) |
0ae1cf52 | 383 | { |
e9ee469a | 384 | make_abs (); |
e0a3af22 | 385 | expld.result.value = align_n (expld.dot, expld.result.value); |
0ae1cf52 AM |
386 | } |
387 | else | |
e9ee469a | 388 | expld.result.valid_p = FALSE; |
0ae1cf52 AM |
389 | break; |
390 | ||
391 | case DATA_SEGMENT_END: | |
ea7c2e6c AM |
392 | if (expld.phase == lang_first_phase_enum |
393 | || expld.section != bfd_abs_section_ptr) | |
0ae1cf52 | 394 | { |
ea7c2e6c AM |
395 | expld.result.valid_p = FALSE; |
396 | } | |
397 | else if (expld.dataseg.phase == exp_dataseg_align_seen | |
398 | || expld.dataseg.phase == exp_dataseg_relro_seen) | |
399 | { | |
400 | expld.dataseg.phase = exp_dataseg_end_seen; | |
401 | expld.dataseg.end = expld.result.value; | |
402 | } | |
403 | else if (expld.dataseg.phase == exp_dataseg_done | |
404 | || expld.dataseg.phase == exp_dataseg_adjust | |
405 | || expld.dataseg.phase == exp_dataseg_relro_adjust) | |
406 | { | |
407 | /* OK. */ | |
0ae1cf52 AM |
408 | } |
409 | else | |
e9ee469a | 410 | expld.result.valid_p = FALSE; |
0ae1cf52 AM |
411 | break; |
412 | ||
413 | default: | |
414 | FAIL (); | |
415 | break; | |
416 | } | |
417 | } | |
0ae1cf52 AM |
418 | } |
419 | ||
e9ee469a AM |
420 | static void |
421 | fold_binary (etree_type *tree) | |
252b5132 | 422 | { |
4ac0c898 | 423 | etree_value_type lhs; |
e9ee469a | 424 | exp_fold_tree_1 (tree->binary.lhs); |
ba916c8a MM |
425 | |
426 | /* The SEGMENT_START operator is special because its first | |
8c0848b5 AM |
427 | operand is a string, not the name of a symbol. Note that the |
428 | operands have been swapped, so binary.lhs is second (default) | |
429 | operand, binary.rhs is first operand. */ | |
e9ee469a | 430 | if (expld.result.valid_p && tree->type.node_code == SEGMENT_START) |
ba916c8a MM |
431 | { |
432 | const char *segment_name; | |
433 | segment_type *seg; | |
7542af2a | 434 | |
ba916c8a MM |
435 | /* Check to see if the user has overridden the default |
436 | value. */ | |
437 | segment_name = tree->binary.rhs->name.name; | |
e4492aa0 | 438 | for (seg = segments; seg; seg = seg->next) |
ba916c8a MM |
439 | if (strcmp (seg->name, segment_name) == 0) |
440 | { | |
c8ce5710 L |
441 | if (!seg->used |
442 | && config.magic_demand_paged | |
443 | && (seg->value % config.maxpagesize) != 0) | |
0aa7f586 AM |
444 | einfo (_("%P: warning: address of `%s' " |
445 | "isn't multiple of maximum page size\n"), | |
c8ce5710 | 446 | segment_name); |
ba916c8a | 447 | seg->used = TRUE; |
7542af2a | 448 | new_rel_from_abs (seg->value); |
ba916c8a MM |
449 | break; |
450 | } | |
4ac0c898 | 451 | return; |
ba916c8a | 452 | } |
252b5132 | 453 | |
4ac0c898 AM |
454 | lhs = expld.result; |
455 | exp_fold_tree_1 (tree->binary.rhs); | |
456 | expld.result.valid_p &= lhs.valid_p; | |
457 | ||
458 | if (expld.result.valid_p) | |
459 | { | |
7542af2a | 460 | if (lhs.section != expld.result.section) |
252b5132 | 461 | { |
7542af2a AM |
462 | /* If the values are from different sections, and neither is |
463 | just a number, make both the source arguments absolute. */ | |
464 | if (expld.result.section != NULL | |
465 | && lhs.section != NULL) | |
466 | { | |
467 | make_abs (); | |
468 | lhs.value += lhs.section->vma; | |
9bc8bb33 | 469 | lhs.section = bfd_abs_section_ptr; |
7542af2a AM |
470 | } |
471 | ||
472 | /* If the rhs is just a number, keep the lhs section. */ | |
473 | else if (expld.result.section == NULL) | |
9bc8bb33 AM |
474 | { |
475 | expld.result.section = lhs.section; | |
476 | /* Make this NULL so that we know one of the operands | |
477 | was just a number, for later tests. */ | |
478 | lhs.section = NULL; | |
479 | } | |
4ac0c898 | 480 | } |
9bc8bb33 AM |
481 | /* At this point we know that both operands have the same |
482 | section, or at least one of them is a plain number. */ | |
252b5132 | 483 | |
4ac0c898 AM |
484 | switch (tree->type.node_code) |
485 | { | |
9bc8bb33 AM |
486 | /* Arithmetic operators, bitwise AND, bitwise OR and XOR |
487 | keep the section of one of their operands only when the | |
488 | other operand is a plain number. Losing the section when | |
489 | operating on two symbols, ie. a result of a plain number, | |
490 | is required for subtraction and XOR. It's justifiable | |
491 | for the other operations on the grounds that adding, | |
492 | multiplying etc. two section relative values does not | |
493 | really make sense unless they are just treated as | |
494 | numbers. | |
495 | The same argument could be made for many expressions | |
496 | involving one symbol and a number. For example, | |
497 | "1 << x" and "100 / x" probably should not be given the | |
498 | section of x. The trouble is that if we fuss about such | |
499 | things the rules become complex and it is onerous to | |
500 | document ld expression evaluation. */ | |
e9ee469a | 501 | #define BOP(x, y) \ |
7542af2a AM |
502 | case x: \ |
503 | expld.result.value = lhs.value y expld.result.value; \ | |
9bc8bb33 AM |
504 | if (expld.result.section == lhs.section) \ |
505 | expld.result.section = NULL; \ | |
7542af2a AM |
506 | break; |
507 | ||
9bc8bb33 AM |
508 | /* Comparison operators, logical AND, and logical OR always |
509 | return a plain number. */ | |
7542af2a AM |
510 | #define BOPN(x, y) \ |
511 | case x: \ | |
512 | expld.result.value = lhs.value y expld.result.value; \ | |
513 | expld.result.section = NULL; \ | |
514 | break; | |
e9ee469a | 515 | |
4ac0c898 AM |
516 | BOP ('+', +); |
517 | BOP ('*', *); | |
518 | BOP ('-', -); | |
519 | BOP (LSHIFT, <<); | |
520 | BOP (RSHIFT, >>); | |
4ac0c898 AM |
521 | BOP ('&', &); |
522 | BOP ('^', ^); | |
523 | BOP ('|', |); | |
7542af2a AM |
524 | BOPN (EQ, ==); |
525 | BOPN (NE, !=); | |
526 | BOPN ('<', <); | |
527 | BOPN ('>', >); | |
528 | BOPN (LE, <=); | |
529 | BOPN (GE, >=); | |
530 | BOPN (ANDAND, &&); | |
531 | BOPN (OROR, ||); | |
4ac0c898 | 532 | |
9bc8bb33 AM |
533 | case '%': |
534 | if (expld.result.value != 0) | |
535 | expld.result.value = ((bfd_signed_vma) lhs.value | |
536 | % (bfd_signed_vma) expld.result.value); | |
537 | else if (expld.phase != lang_mark_phase_enum) | |
dab69f68 | 538 | einfo (_("%F%S %% by zero\n"), tree->binary.rhs); |
9bc8bb33 AM |
539 | if (expld.result.section == lhs.section) |
540 | expld.result.section = NULL; | |
541 | break; | |
542 | ||
543 | case '/': | |
544 | if (expld.result.value != 0) | |
545 | expld.result.value = ((bfd_signed_vma) lhs.value | |
546 | / (bfd_signed_vma) expld.result.value); | |
547 | else if (expld.phase != lang_mark_phase_enum) | |
dab69f68 | 548 | einfo (_("%F%S / by zero\n"), tree->binary.rhs); |
9bc8bb33 AM |
549 | if (expld.result.section == lhs.section) |
550 | expld.result.section = NULL; | |
551 | break; | |
552 | ||
4ac0c898 AM |
553 | case MAX_K: |
554 | if (lhs.value > expld.result.value) | |
555 | expld.result.value = lhs.value; | |
556 | break; | |
252b5132 | 557 | |
4ac0c898 AM |
558 | case MIN_K: |
559 | if (lhs.value < expld.result.value) | |
560 | expld.result.value = lhs.value; | |
561 | break; | |
252b5132 | 562 | |
4ac0c898 AM |
563 | case ALIGN_K: |
564 | expld.result.value = align_n (lhs.value, expld.result.value); | |
565 | break; | |
c468c8bc | 566 | |
4ac0c898 AM |
567 | case DATA_SEGMENT_ALIGN: |
568 | expld.dataseg.relro = exp_dataseg_relro_start; | |
ea7c2e6c AM |
569 | if (expld.phase == lang_first_phase_enum |
570 | || expld.section != bfd_abs_section_ptr) | |
571 | expld.result.valid_p = FALSE; | |
572 | else | |
4ac0c898 AM |
573 | { |
574 | bfd_vma maxpage = lhs.value; | |
575 | bfd_vma commonpage = expld.result.value; | |
2d20f7bf | 576 | |
4ac0c898 AM |
577 | expld.result.value = align_n (expld.dot, maxpage); |
578 | if (expld.dataseg.phase == exp_dataseg_relro_adjust) | |
579 | expld.result.value = expld.dataseg.base; | |
ea7c2e6c AM |
580 | else if (expld.dataseg.phase == exp_dataseg_adjust) |
581 | { | |
582 | if (commonpage < maxpage) | |
583 | expld.result.value += ((expld.dot + commonpage - 1) | |
584 | & (maxpage - commonpage)); | |
585 | } | |
586 | else | |
4ac0c898 AM |
587 | { |
588 | expld.result.value += expld.dot & (maxpage - 1); | |
ea7c2e6c AM |
589 | if (expld.dataseg.phase == exp_dataseg_done) |
590 | { | |
591 | /* OK. */ | |
592 | } | |
593 | else if (expld.dataseg.phase == exp_dataseg_none) | |
2d20f7bf | 594 | { |
4ac0c898 | 595 | expld.dataseg.phase = exp_dataseg_align_seen; |
4ac0c898 AM |
596 | expld.dataseg.base = expld.result.value; |
597 | expld.dataseg.pagesize = commonpage; | |
598 | expld.dataseg.maxpagesize = maxpage; | |
599 | expld.dataseg.relro_end = 0; | |
2d20f7bf | 600 | } |
ea7c2e6c AM |
601 | else |
602 | expld.result.valid_p = FALSE; | |
2d20f7bf | 603 | } |
4ac0c898 | 604 | } |
4ac0c898 | 605 | break; |
e9ee469a | 606 | |
4ac0c898 | 607 | case DATA_SEGMENT_RELRO_END: |
6c1aca3e AM |
608 | /* Operands swapped! DATA_SEGMENT_RELRO_END(offset,exp) |
609 | has offset in expld.result and exp in lhs. */ | |
4ac0c898 | 610 | expld.dataseg.relro = exp_dataseg_relro_end; |
0e5fabeb | 611 | expld.dataseg.relro_offset = expld.result.value; |
ea7c2e6c AM |
612 | if (expld.phase == lang_first_phase_enum |
613 | || expld.section != bfd_abs_section_ptr) | |
614 | expld.result.valid_p = FALSE; | |
615 | else if (expld.dataseg.phase == exp_dataseg_align_seen | |
616 | || expld.dataseg.phase == exp_dataseg_adjust | |
617 | || expld.dataseg.phase == exp_dataseg_relro_adjust | |
618 | || expld.dataseg.phase == exp_dataseg_done) | |
4ac0c898 AM |
619 | { |
620 | if (expld.dataseg.phase == exp_dataseg_align_seen | |
621 | || expld.dataseg.phase == exp_dataseg_relro_adjust) | |
622 | expld.dataseg.relro_end = lhs.value + expld.result.value; | |
e9ee469a | 623 | |
4ac0c898 AM |
624 | if (expld.dataseg.phase == exp_dataseg_relro_adjust |
625 | && (expld.dataseg.relro_end | |
626 | & (expld.dataseg.pagesize - 1))) | |
627 | { | |
628 | expld.dataseg.relro_end += expld.dataseg.pagesize - 1; | |
629 | expld.dataseg.relro_end &= ~(expld.dataseg.pagesize - 1); | |
630 | expld.result.value = (expld.dataseg.relro_end | |
631 | - expld.result.value); | |
a4f5ad88 JJ |
632 | } |
633 | else | |
4ac0c898 | 634 | expld.result.value = lhs.value; |
a4f5ad88 | 635 | |
4ac0c898 AM |
636 | if (expld.dataseg.phase == exp_dataseg_align_seen) |
637 | expld.dataseg.phase = exp_dataseg_relro_seen; | |
252b5132 | 638 | } |
4ac0c898 AM |
639 | else |
640 | expld.result.valid_p = FALSE; | |
641 | break; | |
642 | ||
643 | default: | |
644 | FAIL (); | |
252b5132 | 645 | } |
252b5132 | 646 | } |
252b5132 RH |
647 | } |
648 | ||
e9ee469a AM |
649 | static void |
650 | fold_trinary (etree_type *tree) | |
0ae1cf52 | 651 | { |
e9ee469a AM |
652 | exp_fold_tree_1 (tree->trinary.cond); |
653 | if (expld.result.valid_p) | |
654 | exp_fold_tree_1 (expld.result.value | |
655 | ? tree->trinary.lhs | |
656 | : tree->trinary.rhs); | |
0ae1cf52 AM |
657 | } |
658 | ||
e9ee469a AM |
659 | static void |
660 | fold_name (etree_type *tree) | |
252b5132 | 661 | { |
e9ee469a | 662 | memset (&expld.result, 0, sizeof (expld.result)); |
c468c8bc | 663 | |
4de2d33d | 664 | switch (tree->type.node_code) |
8c95a62e KH |
665 | { |
666 | case SIZEOF_HEADERS: | |
e9ee469a AM |
667 | if (expld.phase != lang_first_phase_enum) |
668 | { | |
669 | bfd_vma hdr_size = 0; | |
670 | /* Don't find the real header size if only marking sections; | |
671 | The bfd function may cache incorrect data. */ | |
672 | if (expld.phase != lang_mark_phase_enum) | |
f13a99db | 673 | hdr_size = bfd_sizeof_headers (link_info.output_bfd, &link_info); |
7542af2a | 674 | new_number (hdr_size); |
e9ee469a | 675 | } |
8c95a62e | 676 | break; |
67469e1f | 677 | |
8c95a62e | 678 | case DEFINED: |
fa72205c | 679 | if (expld.phase != lang_first_phase_enum) |
8c95a62e KH |
680 | { |
681 | struct bfd_link_hash_entry *h; | |
18d6a79d | 682 | struct definedness_hash_entry *def; |
8c95a62e | 683 | |
f13a99db AM |
684 | h = bfd_wrapped_link_hash_lookup (link_info.output_bfd, |
685 | &link_info, | |
8c95a62e | 686 | tree->name.name, |
b34976b6 | 687 | FALSE, FALSE, TRUE); |
7542af2a AM |
688 | new_number (h != NULL |
689 | && (h->type == bfd_link_hash_defined | |
690 | || h->type == bfd_link_hash_defweak | |
691 | || h->type == bfd_link_hash_common) | |
18d6a79d | 692 | && ((def = symbol_defined (tree->name.name)) == NULL |
fa72205c AM |
693 | || def->by_object |
694 | || def->iteration == (lang_statement_iteration & 1))); | |
8c95a62e KH |
695 | } |
696 | break; | |
67469e1f | 697 | |
8c95a62e | 698 | case NAME: |
4194268f AM |
699 | if (expld.assign_name != NULL |
700 | && strcmp (expld.assign_name, tree->name.name) == 0) | |
fa72205c AM |
701 | { |
702 | /* Self-assignment is only allowed for absolute symbols | |
703 | defined in a linker script. */ | |
704 | struct bfd_link_hash_entry *h; | |
18d6a79d | 705 | struct definedness_hash_entry *def; |
fa72205c AM |
706 | |
707 | h = bfd_wrapped_link_hash_lookup (link_info.output_bfd, | |
708 | &link_info, | |
709 | tree->name.name, | |
710 | FALSE, FALSE, TRUE); | |
711 | if (!(h != NULL | |
712 | && (h->type == bfd_link_hash_defined | |
713 | || h->type == bfd_link_hash_defweak) | |
714 | && h->u.def.section == bfd_abs_section_ptr | |
18d6a79d | 715 | && (def = symbol_defined (tree->name.name)) != NULL |
fa72205c AM |
716 | && def->iteration == (lang_statement_iteration & 1))) |
717 | expld.assign_name = NULL; | |
718 | } | |
e9ee469a AM |
719 | if (expld.phase == lang_first_phase_enum) |
720 | ; | |
721 | else if (tree->name.name[0] == '.' && tree->name.name[1] == 0) | |
722 | new_rel_from_abs (expld.dot); | |
723 | else | |
8c95a62e KH |
724 | { |
725 | struct bfd_link_hash_entry *h; | |
726 | ||
f13a99db AM |
727 | h = bfd_wrapped_link_hash_lookup (link_info.output_bfd, |
728 | &link_info, | |
8c95a62e | 729 | tree->name.name, |
1b493742 NS |
730 | TRUE, FALSE, TRUE); |
731 | if (!h) | |
732 | einfo (_("%P%F: bfd_link_hash_lookup failed: %E\n")); | |
733 | else if (h->type == bfd_link_hash_defined | |
734 | || h->type == bfd_link_hash_defweak) | |
8c95a62e | 735 | { |
7542af2a | 736 | asection *output_section; |
8c95a62e | 737 | |
7542af2a AM |
738 | output_section = h->u.def.section->output_section; |
739 | if (output_section == NULL) | |
740 | { | |
2aa9aad9 NC |
741 | if (expld.phase == lang_mark_phase_enum) |
742 | new_rel (h->u.def.value, h->u.def.section); | |
743 | else | |
7542af2a AM |
744 | einfo (_("%X%S: unresolvable symbol `%s'" |
745 | " referenced in expression\n"), | |
dab69f68 | 746 | tree, tree->name.name); |
8c95a62e | 747 | } |
5c3049d2 AM |
748 | else if (output_section == bfd_abs_section_ptr |
749 | && (expld.section != bfd_abs_section_ptr | |
01554a74 | 750 | || config.sane_expr)) |
abf4be64 | 751 | new_number (h->u.def.value + h->u.def.section->output_offset); |
7542af2a AM |
752 | else |
753 | new_rel (h->u.def.value + h->u.def.section->output_offset, | |
754 | output_section); | |
8c95a62e | 755 | } |
e9ee469a | 756 | else if (expld.phase == lang_final_phase_enum |
ec8460b5 AM |
757 | || (expld.phase != lang_mark_phase_enum |
758 | && expld.assigning_to_dot)) | |
dab69f68 AM |
759 | einfo (_("%F%S: undefined symbol `%s'" |
760 | " referenced in expression\n"), | |
761 | tree, tree->name.name); | |
1b493742 NS |
762 | else if (h->type == bfd_link_hash_new) |
763 | { | |
764 | h->type = bfd_link_hash_undefined; | |
765 | h->u.undef.abfd = NULL; | |
3eda52aa | 766 | if (h->u.undef.next == NULL && h != link_info.hash->undefs_tail) |
a010d60f | 767 | bfd_link_add_undef (link_info.hash, h); |
1b493742 | 768 | } |
8c95a62e KH |
769 | } |
770 | break; | |
771 | ||
772 | case ADDR: | |
e9ee469a | 773 | if (expld.phase != lang_first_phase_enum) |
8c95a62e KH |
774 | { |
775 | lang_output_section_statement_type *os; | |
776 | ||
777 | os = lang_output_section_find (tree->name.name); | |
cc3e2771 NS |
778 | if (os == NULL) |
779 | { | |
780 | if (expld.phase == lang_final_phase_enum) | |
dab69f68 AM |
781 | einfo (_("%F%S: undefined section `%s'" |
782 | " referenced in expression\n"), | |
783 | tree, tree->name.name); | |
cc3e2771 NS |
784 | } |
785 | else if (os->processed_vma) | |
5942515f | 786 | new_rel (0, os->bfd_section); |
8c95a62e | 787 | } |
8c95a62e KH |
788 | break; |
789 | ||
790 | case LOADADDR: | |
e9ee469a | 791 | if (expld.phase != lang_first_phase_enum) |
8c95a62e KH |
792 | { |
793 | lang_output_section_statement_type *os; | |
794 | ||
795 | os = lang_output_section_find (tree->name.name); | |
cc3e2771 NS |
796 | if (os == NULL) |
797 | { | |
798 | if (expld.phase == lang_final_phase_enum) | |
dab69f68 AM |
799 | einfo (_("%F%S: undefined section `%s'" |
800 | " referenced in expression\n"), | |
801 | tree, tree->name.name); | |
cc3e2771 NS |
802 | } |
803 | else if (os->processed_lma) | |
1b493742 | 804 | { |
e9ee469a | 805 | if (os->load_base == NULL) |
3e23777d | 806 | new_abs (os->bfd_section->lma); |
e9ee469a | 807 | else |
67469e1f AM |
808 | { |
809 | exp_fold_tree_1 (os->load_base); | |
819da74e AM |
810 | if (expld.result.valid_p) |
811 | make_abs (); | |
67469e1f | 812 | } |
1b493742 | 813 | } |
8c95a62e | 814 | } |
8c95a62e KH |
815 | break; |
816 | ||
817 | case SIZEOF: | |
362c1d1a | 818 | case ALIGNOF: |
e9ee469a | 819 | if (expld.phase != lang_first_phase_enum) |
8c95a62e | 820 | { |
8c95a62e KH |
821 | lang_output_section_statement_type *os; |
822 | ||
823 | os = lang_output_section_find (tree->name.name); | |
5397b1fe | 824 | if (os == NULL) |
cc3e2771 NS |
825 | { |
826 | if (expld.phase == lang_final_phase_enum) | |
dab69f68 AM |
827 | einfo (_("%F%S: undefined section `%s'" |
828 | " referenced in expression\n"), | |
829 | tree, tree->name.name); | |
7542af2a | 830 | new_number (0); |
cc3e2771 | 831 | } |
17d6eea5 | 832 | else if (os->bfd_section != NULL) |
362c1d1a NS |
833 | { |
834 | bfd_vma val; | |
835 | ||
836 | if (tree->type.node_code == SIZEOF) | |
f13a99db AM |
837 | val = (os->bfd_section->size |
838 | / bfd_octets_per_byte (link_info.output_bfd)); | |
362c1d1a NS |
839 | else |
840 | val = (bfd_vma)1 << os->bfd_section->alignment_power; | |
e4492aa0 | 841 | |
7542af2a | 842 | new_number (val); |
362c1d1a | 843 | } |
17d6eea5 L |
844 | else |
845 | new_number (0); | |
8c95a62e | 846 | } |
8c95a62e KH |
847 | break; |
848 | ||
3ec57632 NC |
849 | case LENGTH: |
850 | { | |
cc9ad334 | 851 | if (expld.phase != lang_first_phase_enum) |
0aa7f586 AM |
852 | { |
853 | lang_memory_region_type *mem; | |
854 | ||
855 | mem = lang_memory_region_lookup (tree->name.name, FALSE); | |
856 | if (mem != NULL) | |
857 | new_number (mem->length); | |
858 | else | |
859 | einfo (_("%F%S: undefined MEMORY region `%s'" | |
860 | " referenced in expression\n"), | |
861 | tree, tree->name.name); | |
862 | } | |
3ec57632 NC |
863 | } |
864 | break; | |
865 | ||
866 | case ORIGIN: | |
7542af2a AM |
867 | if (expld.phase != lang_first_phase_enum) |
868 | { | |
869 | lang_memory_region_type *mem; | |
e4492aa0 L |
870 | |
871 | mem = lang_memory_region_lookup (tree->name.name, FALSE); | |
872 | if (mem != NULL) | |
7542af2a | 873 | new_rel_from_abs (mem->origin); |
e4492aa0 | 874 | else |
7542af2a | 875 | einfo (_("%F%S: undefined MEMORY region `%s'" |
dab69f68 AM |
876 | " referenced in expression\n"), |
877 | tree, tree->name.name); | |
7542af2a | 878 | } |
3ec57632 NC |
879 | break; |
880 | ||
24718e3b L |
881 | case CONSTANT: |
882 | if (strcmp (tree->name.name, "MAXPAGESIZE") == 0) | |
7542af2a | 883 | new_number (config.maxpagesize); |
24718e3b | 884 | else if (strcmp (tree->name.name, "COMMONPAGESIZE") == 0) |
7542af2a | 885 | new_number (config.commonpagesize); |
24718e3b L |
886 | else |
887 | einfo (_("%F%S: unknown constant `%s' referenced in expression\n"), | |
dab69f68 | 888 | tree, tree->name.name); |
24718e3b L |
889 | break; |
890 | ||
8c95a62e KH |
891 | default: |
892 | FAIL (); | |
893 | break; | |
894 | } | |
252b5132 | 895 | } |
8c95a62e | 896 | |
2edab91c | 897 | /* Return true if TREE is '.'. */ |
995da1ff | 898 | |
2edab91c AM |
899 | static bfd_boolean |
900 | is_dot (const etree_type *tree) | |
901 | { | |
902 | return (tree->type.node_class == etree_name | |
903 | && tree->type.node_code == NAME | |
904 | && tree->name.name[0] == '.' | |
905 | && tree->name.name[1] == 0); | |
906 | } | |
907 | ||
908 | /* Return true if TREE is a constant equal to VAL. */ | |
909 | ||
910 | static bfd_boolean | |
911 | is_value (const etree_type *tree, bfd_vma val) | |
912 | { | |
913 | return (tree->type.node_class == etree_value | |
914 | && tree->value.value == val); | |
915 | } | |
916 | ||
917 | /* Return true if TREE is an absolute symbol equal to VAL defined in | |
918 | a linker script. */ | |
919 | ||
920 | static bfd_boolean | |
921 | is_sym_value (const etree_type *tree, bfd_vma val) | |
922 | { | |
923 | struct bfd_link_hash_entry *h; | |
18d6a79d | 924 | struct definedness_hash_entry *def; |
2edab91c AM |
925 | |
926 | return (tree->type.node_class == etree_name | |
927 | && tree->type.node_code == NAME | |
18d6a79d | 928 | && (def = symbol_defined (tree->name.name)) != NULL |
2edab91c AM |
929 | && def->by_script |
930 | && def->iteration == (lang_statement_iteration & 1) | |
931 | && (h = bfd_wrapped_link_hash_lookup (link_info.output_bfd, | |
932 | &link_info, | |
933 | tree->name.name, | |
934 | FALSE, FALSE, TRUE)) != NULL | |
935 | && h->type == bfd_link_hash_defined | |
936 | && h->u.def.section == bfd_abs_section_ptr | |
937 | && h->u.def.value == val); | |
938 | } | |
939 | ||
940 | /* Return true if TREE is ". != 0". */ | |
941 | ||
942 | static bfd_boolean | |
943 | is_dot_ne_0 (const etree_type *tree) | |
944 | { | |
945 | return (tree->type.node_class == etree_binary | |
946 | && tree->type.node_code == NE | |
947 | && is_dot (tree->binary.lhs) | |
948 | && is_value (tree->binary.rhs, 0)); | |
949 | } | |
950 | ||
951 | /* Return true if TREE is ". = . + 0" or ". = . + sym" where sym is an | |
952 | absolute constant with value 0 defined in a linker script. */ | |
953 | ||
954 | static bfd_boolean | |
955 | is_dot_plus_0 (const etree_type *tree) | |
956 | { | |
957 | return (tree->type.node_class == etree_binary | |
958 | && tree->type.node_code == '+' | |
959 | && is_dot (tree->binary.lhs) | |
960 | && (is_value (tree->binary.rhs, 0) | |
961 | || is_sym_value (tree->binary.rhs, 0))); | |
962 | } | |
963 | ||
e0a3af22 | 964 | /* Return true if TREE is "ALIGN (. != 0 ? some_expression : 1)". */ |
2edab91c AM |
965 | |
966 | static bfd_boolean | |
967 | is_align_conditional (const etree_type *tree) | |
968 | { | |
e0a3af22 AM |
969 | if (tree->type.node_class == etree_unary |
970 | && tree->type.node_code == ALIGN_K) | |
971 | { | |
972 | tree = tree->unary.child; | |
973 | return (tree->type.node_class == etree_trinary | |
974 | && is_dot_ne_0 (tree->trinary.cond) | |
975 | && is_value (tree->trinary.rhs, 1)); | |
976 | } | |
1fb80d6d SD |
977 | return FALSE; |
978 | } | |
979 | ||
980 | /* Subroutine of exp_fold_tree_1 for copying a symbol type. */ | |
981 | ||
982 | static void | |
0aa7f586 | 983 | try_copy_symbol_type (struct bfd_link_hash_entry *h, etree_type *src) |
1fb80d6d SD |
984 | { |
985 | if (src->type.node_class == etree_name) | |
986 | { | |
987 | struct bfd_link_hash_entry *hsrc; | |
988 | ||
989 | hsrc = bfd_link_hash_lookup (link_info.hash, src->name.name, | |
990 | FALSE, FALSE, TRUE); | |
991 | if (hsrc) | |
992 | bfd_copy_link_hash_symbol_type (link_info.output_bfd, h, | |
993 | hsrc); | |
994 | } | |
2edab91c AM |
995 | } |
996 | ||
e9ee469a AM |
997 | static void |
998 | exp_fold_tree_1 (etree_type *tree) | |
252b5132 | 999 | { |
252b5132 RH |
1000 | if (tree == NULL) |
1001 | { | |
e9ee469a AM |
1002 | memset (&expld.result, 0, sizeof (expld.result)); |
1003 | return; | |
252b5132 RH |
1004 | } |
1005 | ||
4de2d33d | 1006 | switch (tree->type.node_class) |
252b5132 RH |
1007 | { |
1008 | case etree_value: | |
5c3049d2 | 1009 | if (expld.section == bfd_abs_section_ptr |
01554a74 | 1010 | && !config.sane_expr) |
5c3049d2 AM |
1011 | new_abs (tree->value.value); |
1012 | else | |
1013 | new_number (tree->value.value); | |
5942515f | 1014 | expld.result.str = tree->value.str; |
252b5132 RH |
1015 | break; |
1016 | ||
1017 | case etree_rel: | |
e9ee469a AM |
1018 | if (expld.phase != lang_first_phase_enum) |
1019 | { | |
1020 | asection *output_section = tree->rel.section->output_section; | |
1021 | new_rel (tree->rel.value + tree->rel.section->output_offset, | |
5942515f | 1022 | output_section); |
e9ee469a | 1023 | } |
252b5132 | 1024 | else |
e9ee469a | 1025 | memset (&expld.result, 0, sizeof (expld.result)); |
252b5132 RH |
1026 | break; |
1027 | ||
1028 | case etree_assert: | |
e9ee469a | 1029 | exp_fold_tree_1 (tree->assert_s.child); |
5397b1fe AM |
1030 | if (expld.phase == lang_final_phase_enum && !expld.result.value) |
1031 | einfo ("%X%P: %s\n", tree->assert_s.message); | |
252b5132 RH |
1032 | break; |
1033 | ||
1034 | case etree_unary: | |
e9ee469a | 1035 | fold_unary (tree); |
252b5132 RH |
1036 | break; |
1037 | ||
1038 | case etree_binary: | |
e9ee469a | 1039 | fold_binary (tree); |
252b5132 | 1040 | break; |
0ae1cf52 AM |
1041 | |
1042 | case etree_trinary: | |
e9ee469a | 1043 | fold_trinary (tree); |
0ae1cf52 | 1044 | break; |
252b5132 RH |
1045 | |
1046 | case etree_assign: | |
1047 | case etree_provide: | |
b46a87b1 | 1048 | case etree_provided: |
252b5132 RH |
1049 | if (tree->assign.dst[0] == '.' && tree->assign.dst[1] == 0) |
1050 | { | |
b46a87b1 | 1051 | if (tree->type.node_class != etree_assign) |
dab69f68 AM |
1052 | einfo (_("%F%S can not PROVIDE assignment to" |
1053 | " location counter\n"), tree); | |
ec8460b5 | 1054 | if (expld.phase != lang_first_phase_enum) |
252b5132 | 1055 | { |
fbbb9ac5 | 1056 | /* Notify the folder that this is an assignment to dot. */ |
e9ee469a AM |
1057 | expld.assigning_to_dot = TRUE; |
1058 | exp_fold_tree_1 (tree->assign.src); | |
1059 | expld.assigning_to_dot = FALSE; | |
1060 | ||
e0a3af22 AM |
1061 | /* If we are assigning to dot inside an output section |
1062 | arrange to keep the section, except for certain | |
1063 | expressions that evaluate to zero. We ignore . = 0, | |
1064 | . = . + 0, and . = ALIGN (. != 0 ? expr : 1). | |
1065 | We can't ignore all expressions that evaluate to zero | |
1066 | because an otherwise empty section might have padding | |
1067 | added by an alignment expression that changes with | |
1068 | relaxation. Such a section might have zero size | |
1069 | before relaxation and so be stripped incorrectly. */ | |
1070 | if (expld.phase == lang_mark_phase_enum | |
1071 | && expld.section != bfd_abs_section_ptr | |
1072 | && !(expld.result.valid_p | |
1073 | && expld.result.value == 0 | |
1074 | && (is_value (tree->assign.src, 0) | |
1075 | || is_sym_value (tree->assign.src, 0) | |
1076 | || is_dot_plus_0 (tree->assign.src) | |
1077 | || is_align_conditional (tree->assign.src)))) | |
1078 | expld.section->flags |= SEC_KEEP; | |
1079 | ||
e9ee469a AM |
1080 | if (!expld.result.valid_p) |
1081 | { | |
1082 | if (expld.phase != lang_mark_phase_enum) | |
dab69f68 AM |
1083 | einfo (_("%F%S invalid assignment to" |
1084 | " location counter\n"), tree); | |
e9ee469a AM |
1085 | } |
1086 | else if (expld.dotp == NULL) | |
1087 | einfo (_("%F%S assignment to location counter" | |
ec8460b5 AM |
1088 | " invalid outside of SECTIONS\n"), tree); |
1089 | ||
1090 | /* After allocation, assignment to dot should not be | |
1091 | done inside an output section since allocation adds a | |
1092 | padding statement that effectively duplicates the | |
1093 | assignment. */ | |
1094 | else if (expld.phase <= lang_allocating_phase_enum | |
1095 | || expld.section == bfd_abs_section_ptr) | |
252b5132 | 1096 | { |
e9ee469a AM |
1097 | bfd_vma nextdot; |
1098 | ||
7542af2a AM |
1099 | nextdot = expld.result.value; |
1100 | if (expld.result.section != NULL) | |
1101 | nextdot += expld.result.section->vma; | |
1102 | else | |
1103 | nextdot += expld.section->vma; | |
e9ee469a AM |
1104 | if (nextdot < expld.dot |
1105 | && expld.section != bfd_abs_section_ptr) | |
1106 | einfo (_("%F%S cannot move location counter backwards" | |
dab69f68 AM |
1107 | " (from %V to %V)\n"), |
1108 | tree, expld.dot, nextdot); | |
252b5132 RH |
1109 | else |
1110 | { | |
e9ee469a AM |
1111 | expld.dot = nextdot; |
1112 | *expld.dotp = nextdot; | |
252b5132 RH |
1113 | } |
1114 | } | |
1115 | } | |
8b3d8fa8 | 1116 | else |
e9ee469a | 1117 | memset (&expld.result, 0, sizeof (expld.result)); |
252b5132 RH |
1118 | } |
1119 | else | |
1120 | { | |
e9ee469a | 1121 | struct bfd_link_hash_entry *h = NULL; |
252b5132 | 1122 | |
e9ee469a AM |
1123 | if (tree->type.node_class == etree_provide) |
1124 | { | |
252b5132 | 1125 | h = bfd_link_hash_lookup (link_info.hash, tree->assign.dst, |
e9ee469a AM |
1126 | FALSE, FALSE, TRUE); |
1127 | if (h == NULL | |
4cc2bf08 AM |
1128 | || !(h->type == bfd_link_hash_new |
1129 | || h->type == bfd_link_hash_undefined | |
321df065 | 1130 | || h->type == bfd_link_hash_undefweak |
12b2843a | 1131 | || h->linker_def)) |
e9ee469a | 1132 | { |
4cc2bf08 | 1133 | /* Do nothing. The symbol was never referenced, or |
321df065 AM |
1134 | was defined in some object file. Note that |
1135 | undefweak symbols are defined by PROVIDE. This | |
1136 | is to support glibc use of __rela_iplt_start and | |
1137 | similar weak references. */ | |
e9ee469a AM |
1138 | break; |
1139 | } | |
1140 | } | |
1141 | ||
4194268f | 1142 | expld.assign_name = tree->assign.dst; |
e9ee469a | 1143 | exp_fold_tree_1 (tree->assign.src); |
4194268f AM |
1144 | /* expld.assign_name remaining equal to tree->assign.dst |
1145 | below indicates the evaluation of tree->assign.src did | |
1146 | not use the value of tree->assign.dst. We don't allow | |
1147 | self assignment until the final phase for two reasons: | |
1148 | 1) Expressions are evaluated multiple times. With | |
1149 | relaxation, the number of times may vary. | |
1150 | 2) Section relative symbol values cannot be correctly | |
1151 | converted to absolute values, as is required by many | |
1152 | expressions, until final section sizing is complete. */ | |
1153 | if ((expld.result.valid_p | |
1154 | && (expld.phase == lang_final_phase_enum | |
1155 | || expld.assign_name != NULL)) | |
2aa9aad9 | 1156 | || (expld.phase <= lang_mark_phase_enum |
01554a74 | 1157 | && tree->type.node_class == etree_assign |
eb8476a6 | 1158 | && tree->assign.defsym)) |
e9ee469a | 1159 | { |
1579bae1 | 1160 | if (h == NULL) |
67010b46 | 1161 | { |
e9ee469a AM |
1162 | h = bfd_link_hash_lookup (link_info.hash, tree->assign.dst, |
1163 | TRUE, FALSE, TRUE); | |
1164 | if (h == NULL) | |
67010b46 NC |
1165 | einfo (_("%P%F:%s: hash creation failed\n"), |
1166 | tree->assign.dst); | |
1167 | } | |
e9ee469a | 1168 | |
7542af2a AM |
1169 | if (expld.result.section == NULL) |
1170 | expld.result.section = expld.section; | |
422f1c65 AM |
1171 | if (!update_definedness (tree->assign.dst, h) && 0) |
1172 | { | |
1173 | /* Symbol was already defined. For now this error | |
1174 | is disabled because it causes failures in the ld | |
1175 | testsuite: ld-elf/var1, ld-scripts/defined5, and | |
1176 | ld-scripts/pr14962. Some of these no doubt | |
1177 | reflect scripts used in the wild. */ | |
1178 | (*link_info.callbacks->multiple_definition) | |
1179 | (&link_info, h, link_info.output_bfd, | |
1180 | expld.result.section, expld.result.value); | |
1181 | } | |
1182 | h->type = bfd_link_hash_defined; | |
1183 | h->u.def.value = expld.result.value; | |
e9ee469a | 1184 | h->u.def.section = expld.result.section; |
1753ed68 | 1185 | h->linker_def = ! tree->assign.type.lineno; |
76359541 | 1186 | h->ldscript_def = 1; |
e9ee469a AM |
1187 | if (tree->type.node_class == etree_provide) |
1188 | tree->type.node_class = etree_provided; | |
1338dd10 PB |
1189 | |
1190 | /* Copy the symbol type if this is a simple assignment of | |
0aa7f586 | 1191 | one symbol to another. Also, handle the case of a foldable |
1fb80d6d | 1192 | ternary conditional with names on either side. */ |
1338dd10 | 1193 | if (tree->assign.src->type.node_class == etree_name) |
1fb80d6d SD |
1194 | try_copy_symbol_type (h, tree->assign.src); |
1195 | else if (tree->assign.src->type.node_class == etree_trinary) | |
1338dd10 | 1196 | { |
1fb80d6d SD |
1197 | exp_fold_tree_1 (tree->assign.src->trinary.cond); |
1198 | if (expld.result.valid_p) | |
1199 | { | |
1200 | if (expld.result.value | |
1201 | && tree->assign.src->trinary.lhs->type.node_class | |
1202 | == etree_name) | |
1203 | try_copy_symbol_type (h, tree->assign.src->trinary.lhs); | |
1204 | ||
1205 | if (!expld.result.value | |
1206 | && tree->assign.src->trinary.rhs->type.node_class | |
1207 | == etree_name) | |
1208 | try_copy_symbol_type (h, tree->assign.src->trinary.rhs); | |
1209 | } | |
1338dd10 | 1210 | } |
252b5132 | 1211 | } |
e092cb30 AM |
1212 | else if (expld.phase == lang_final_phase_enum) |
1213 | { | |
1214 | h = bfd_link_hash_lookup (link_info.hash, tree->assign.dst, | |
1215 | FALSE, FALSE, TRUE); | |
1216 | if (h != NULL | |
1217 | && h->type == bfd_link_hash_new) | |
1218 | h->type = bfd_link_hash_undefined; | |
1219 | } | |
4194268f | 1220 | expld.assign_name = NULL; |
252b5132 RH |
1221 | } |
1222 | break; | |
1223 | ||
1224 | case etree_name: | |
e9ee469a | 1225 | fold_name (tree); |
252b5132 RH |
1226 | break; |
1227 | ||
1228 | default: | |
1229 | FAIL (); | |
e9ee469a | 1230 | memset (&expld.result, 0, sizeof (expld.result)); |
252b5132 RH |
1231 | break; |
1232 | } | |
252b5132 RH |
1233 | } |
1234 | ||
e9ee469a AM |
1235 | void |
1236 | exp_fold_tree (etree_type *tree, asection *current_section, bfd_vma *dotp) | |
75ff4589 | 1237 | { |
975f8a9e | 1238 | expld.rel_from_abs = FALSE; |
e9ee469a AM |
1239 | expld.dot = *dotp; |
1240 | expld.dotp = dotp; | |
1241 | expld.section = current_section; | |
1242 | exp_fold_tree_1 (tree); | |
75ff4589 L |
1243 | } |
1244 | ||
e759c116 | 1245 | void |
e9ee469a | 1246 | exp_fold_tree_no_dot (etree_type *tree) |
252b5132 | 1247 | { |
975f8a9e | 1248 | expld.rel_from_abs = FALSE; |
e9ee469a AM |
1249 | expld.dot = 0; |
1250 | expld.dotp = NULL; | |
1251 | expld.section = bfd_abs_section_ptr; | |
1252 | exp_fold_tree_1 (tree); | |
252b5132 RH |
1253 | } |
1254 | ||
1255 | etree_type * | |
1579bae1 | 1256 | exp_binop (int code, etree_type *lhs, etree_type *rhs) |
252b5132 | 1257 | { |
d3ce72d0 | 1258 | etree_type value, *new_e; |
252b5132 RH |
1259 | |
1260 | value.type.node_code = code; | |
dab69f68 | 1261 | value.type.filename = lhs->type.filename; |
f856040a | 1262 | value.type.lineno = lhs->type.lineno; |
252b5132 RH |
1263 | value.binary.lhs = lhs; |
1264 | value.binary.rhs = rhs; | |
1265 | value.type.node_class = etree_binary; | |
e9ee469a AM |
1266 | exp_fold_tree_no_dot (&value); |
1267 | if (expld.result.valid_p) | |
1268 | return exp_intop (expld.result.value); | |
1269 | ||
d3ce72d0 NC |
1270 | new_e = (etree_type *) stat_alloc (sizeof (new_e->binary)); |
1271 | memcpy (new_e, &value, sizeof (new_e->binary)); | |
1272 | return new_e; | |
252b5132 RH |
1273 | } |
1274 | ||
1275 | etree_type * | |
1579bae1 | 1276 | exp_trinop (int code, etree_type *cond, etree_type *lhs, etree_type *rhs) |
252b5132 | 1277 | { |
d3ce72d0 | 1278 | etree_type value, *new_e; |
e9ee469a | 1279 | |
252b5132 | 1280 | value.type.node_code = code; |
dab69f68 AM |
1281 | value.type.filename = cond->type.filename; |
1282 | value.type.lineno = cond->type.lineno; | |
252b5132 RH |
1283 | value.trinary.lhs = lhs; |
1284 | value.trinary.cond = cond; | |
1285 | value.trinary.rhs = rhs; | |
1286 | value.type.node_class = etree_trinary; | |
e9ee469a AM |
1287 | exp_fold_tree_no_dot (&value); |
1288 | if (expld.result.valid_p) | |
1289 | return exp_intop (expld.result.value); | |
c7d701b0 | 1290 | |
d3ce72d0 NC |
1291 | new_e = (etree_type *) stat_alloc (sizeof (new_e->trinary)); |
1292 | memcpy (new_e, &value, sizeof (new_e->trinary)); | |
1293 | return new_e; | |
252b5132 RH |
1294 | } |
1295 | ||
252b5132 | 1296 | etree_type * |
1579bae1 | 1297 | exp_unop (int code, etree_type *child) |
252b5132 | 1298 | { |
d3ce72d0 | 1299 | etree_type value, *new_e; |
252b5132 | 1300 | |
252b5132 | 1301 | value.unary.type.node_code = code; |
dab69f68 | 1302 | value.unary.type.filename = child->type.filename; |
f856040a | 1303 | value.unary.type.lineno = child->type.lineno; |
252b5132 RH |
1304 | value.unary.child = child; |
1305 | value.unary.type.node_class = etree_unary; | |
e9ee469a AM |
1306 | exp_fold_tree_no_dot (&value); |
1307 | if (expld.result.valid_p) | |
1308 | return exp_intop (expld.result.value); | |
c7d701b0 | 1309 | |
d3ce72d0 NC |
1310 | new_e = (etree_type *) stat_alloc (sizeof (new_e->unary)); |
1311 | memcpy (new_e, &value, sizeof (new_e->unary)); | |
1312 | return new_e; | |
252b5132 RH |
1313 | } |
1314 | ||
252b5132 | 1315 | etree_type * |
1579bae1 | 1316 | exp_nameop (int code, const char *name) |
252b5132 | 1317 | { |
d3ce72d0 | 1318 | etree_type value, *new_e; |
e9ee469a | 1319 | |
252b5132 | 1320 | value.name.type.node_code = code; |
dab69f68 | 1321 | value.name.type.filename = ldlex_filename (); |
f856040a | 1322 | value.name.type.lineno = lineno; |
252b5132 RH |
1323 | value.name.name = name; |
1324 | value.name.type.node_class = etree_name; | |
1325 | ||
e9ee469a AM |
1326 | exp_fold_tree_no_dot (&value); |
1327 | if (expld.result.valid_p) | |
1328 | return exp_intop (expld.result.value); | |
c7d701b0 | 1329 | |
d3ce72d0 NC |
1330 | new_e = (etree_type *) stat_alloc (sizeof (new_e->name)); |
1331 | memcpy (new_e, &value, sizeof (new_e->name)); | |
1332 | return new_e; | |
252b5132 RH |
1333 | |
1334 | } | |
1335 | ||
2e57b2af AM |
1336 | static etree_type * |
1337 | exp_assop (const char *dst, | |
1338 | etree_type *src, | |
1339 | enum node_tree_enum class, | |
eb8476a6 | 1340 | bfd_boolean defsym, |
2e57b2af | 1341 | bfd_boolean hidden) |
252b5132 RH |
1342 | { |
1343 | etree_type *n; | |
1344 | ||
1e9cc1c2 | 1345 | n = (etree_type *) stat_alloc (sizeof (n->assign)); |
252b5132 | 1346 | n->assign.type.node_code = '='; |
dab69f68 | 1347 | n->assign.type.filename = src->type.filename; |
f856040a | 1348 | n->assign.type.lineno = src->type.lineno; |
2e57b2af | 1349 | n->assign.type.node_class = class; |
252b5132 RH |
1350 | n->assign.src = src; |
1351 | n->assign.dst = dst; | |
eb8476a6 | 1352 | n->assign.defsym = defsym; |
7af8e998 | 1353 | n->assign.hidden = hidden; |
252b5132 RH |
1354 | return n; |
1355 | } | |
1356 | ||
eb8476a6 MR |
1357 | /* Handle linker script assignments and HIDDEN. */ |
1358 | ||
2e57b2af | 1359 | etree_type * |
eb8476a6 | 1360 | exp_assign (const char *dst, etree_type *src, bfd_boolean hidden) |
2e57b2af | 1361 | { |
eb8476a6 | 1362 | return exp_assop (dst, src, etree_assign, FALSE, hidden); |
2e57b2af AM |
1363 | } |
1364 | ||
eb8476a6 MR |
1365 | /* Handle --defsym command-line option. */ |
1366 | ||
2e57b2af AM |
1367 | etree_type * |
1368 | exp_defsym (const char *dst, etree_type *src) | |
1369 | { | |
eb8476a6 | 1370 | return exp_assop (dst, src, etree_assign, TRUE, FALSE); |
2e57b2af AM |
1371 | } |
1372 | ||
1373 | /* Handle PROVIDE. */ | |
1374 | ||
1375 | etree_type * | |
1376 | exp_provide (const char *dst, etree_type *src, bfd_boolean hidden) | |
1377 | { | |
eb8476a6 | 1378 | return exp_assop (dst, src, etree_provide, FALSE, hidden); |
2e57b2af AM |
1379 | } |
1380 | ||
252b5132 RH |
1381 | /* Handle ASSERT. */ |
1382 | ||
1383 | etree_type * | |
1579bae1 | 1384 | exp_assert (etree_type *exp, const char *message) |
252b5132 RH |
1385 | { |
1386 | etree_type *n; | |
1387 | ||
1e9cc1c2 | 1388 | n = (etree_type *) stat_alloc (sizeof (n->assert_s)); |
252b5132 | 1389 | n->assert_s.type.node_code = '!'; |
dab69f68 | 1390 | n->assert_s.type.filename = exp->type.filename; |
f856040a | 1391 | n->assert_s.type.lineno = exp->type.lineno; |
252b5132 RH |
1392 | n->assert_s.type.node_class = etree_assert; |
1393 | n->assert_s.child = exp; | |
1394 | n->assert_s.message = message; | |
1395 | return n; | |
1396 | } | |
1397 | ||
4de2d33d | 1398 | void |
1579bae1 | 1399 | exp_print_tree (etree_type *tree) |
252b5132 | 1400 | { |
ae78bbeb AM |
1401 | bfd_boolean function_like; |
1402 | ||
c7d701b0 NC |
1403 | if (config.map_file == NULL) |
1404 | config.map_file = stderr; | |
b7a26f91 | 1405 | |
c7d701b0 NC |
1406 | if (tree == NULL) |
1407 | { | |
1408 | minfo ("NULL TREE\n"); | |
1409 | return; | |
1410 | } | |
b7a26f91 | 1411 | |
8c95a62e KH |
1412 | switch (tree->type.node_class) |
1413 | { | |
1414 | case etree_value: | |
1415 | minfo ("0x%v", tree->value.value); | |
1416 | return; | |
1417 | case etree_rel: | |
1418 | if (tree->rel.section->owner != NULL) | |
1419 | minfo ("%B:", tree->rel.section->owner); | |
1420 | minfo ("%s+0x%v", tree->rel.section->name, tree->rel.value); | |
1421 | return; | |
1422 | case etree_assign: | |
ae78bbeb | 1423 | fputs (tree->assign.dst, config.map_file); |
b34976b6 | 1424 | exp_print_token (tree->type.node_code, TRUE); |
8c95a62e KH |
1425 | exp_print_tree (tree->assign.src); |
1426 | break; | |
1427 | case etree_provide: | |
b46a87b1 | 1428 | case etree_provided: |
8c95a62e KH |
1429 | fprintf (config.map_file, "PROVIDE (%s, ", tree->assign.dst); |
1430 | exp_print_tree (tree->assign.src); | |
ae78bbeb | 1431 | fputc (')', config.map_file); |
8c95a62e KH |
1432 | break; |
1433 | case etree_binary: | |
ae78bbeb AM |
1434 | function_like = FALSE; |
1435 | switch (tree->type.node_code) | |
1436 | { | |
1437 | case MAX_K: | |
1438 | case MIN_K: | |
1439 | case ALIGN_K: | |
1440 | case DATA_SEGMENT_ALIGN: | |
1441 | case DATA_SEGMENT_RELRO_END: | |
1442 | function_like = TRUE; | |
67baf8c4 TG |
1443 | break; |
1444 | case SEGMENT_START: | |
1445 | /* Special handling because arguments are in reverse order and | |
1446 | the segment name is quoted. */ | |
1447 | exp_print_token (tree->type.node_code, FALSE); | |
1448 | fputs (" (\"", config.map_file); | |
1449 | exp_print_tree (tree->binary.rhs); | |
1450 | fputs ("\", ", config.map_file); | |
1451 | exp_print_tree (tree->binary.lhs); | |
1452 | fputc (')', config.map_file); | |
1453 | return; | |
ae78bbeb AM |
1454 | } |
1455 | if (function_like) | |
1456 | { | |
1457 | exp_print_token (tree->type.node_code, FALSE); | |
1458 | fputc (' ', config.map_file); | |
1459 | } | |
1460 | fputc ('(', config.map_file); | |
8c95a62e | 1461 | exp_print_tree (tree->binary.lhs); |
ae78bbeb AM |
1462 | if (function_like) |
1463 | fprintf (config.map_file, ", "); | |
1464 | else | |
1465 | exp_print_token (tree->type.node_code, TRUE); | |
8c95a62e | 1466 | exp_print_tree (tree->binary.rhs); |
ae78bbeb | 1467 | fputc (')', config.map_file); |
8c95a62e KH |
1468 | break; |
1469 | case etree_trinary: | |
1470 | exp_print_tree (tree->trinary.cond); | |
ae78bbeb | 1471 | fputc ('?', config.map_file); |
8c95a62e | 1472 | exp_print_tree (tree->trinary.lhs); |
ae78bbeb | 1473 | fputc (':', config.map_file); |
8c95a62e KH |
1474 | exp_print_tree (tree->trinary.rhs); |
1475 | break; | |
1476 | case etree_unary: | |
b34976b6 | 1477 | exp_print_token (tree->unary.type.node_code, FALSE); |
8c95a62e KH |
1478 | if (tree->unary.child) |
1479 | { | |
7b17f854 | 1480 | fprintf (config.map_file, " ("); |
8c95a62e | 1481 | exp_print_tree (tree->unary.child); |
ae78bbeb | 1482 | fputc (')', config.map_file); |
8c95a62e KH |
1483 | } |
1484 | break; | |
1485 | ||
1486 | case etree_assert: | |
1487 | fprintf (config.map_file, "ASSERT ("); | |
1488 | exp_print_tree (tree->assert_s.child); | |
1489 | fprintf (config.map_file, ", %s)", tree->assert_s.message); | |
1490 | break; | |
1491 | ||
8c95a62e KH |
1492 | case etree_name: |
1493 | if (tree->type.node_code == NAME) | |
ae78bbeb | 1494 | fputs (tree->name.name, config.map_file); |
8c95a62e KH |
1495 | else |
1496 | { | |
b34976b6 | 1497 | exp_print_token (tree->type.node_code, FALSE); |
8c95a62e | 1498 | if (tree->name.name) |
7b17f854 | 1499 | fprintf (config.map_file, " (%s)", tree->name.name); |
8c95a62e KH |
1500 | } |
1501 | break; | |
1502 | default: | |
1503 | FAIL (); | |
1504 | break; | |
252b5132 | 1505 | } |
252b5132 RH |
1506 | } |
1507 | ||
1508 | bfd_vma | |
e9ee469a | 1509 | exp_get_vma (etree_type *tree, bfd_vma def, char *name) |
252b5132 | 1510 | { |
252b5132 RH |
1511 | if (tree != NULL) |
1512 | { | |
e9ee469a AM |
1513 | exp_fold_tree_no_dot (tree); |
1514 | if (expld.result.valid_p) | |
1515 | return expld.result.value; | |
1516 | else if (name != NULL && expld.phase != lang_mark_phase_enum) | |
dab69f68 AM |
1517 | einfo (_("%F%S: nonconstant expression for %s\n"), |
1518 | tree, name); | |
252b5132 | 1519 | } |
e9ee469a | 1520 | return def; |
252b5132 RH |
1521 | } |
1522 | ||
4de2d33d | 1523 | int |
e9ee469a | 1524 | exp_get_value_int (etree_type *tree, int def, char *name) |
252b5132 | 1525 | { |
e9ee469a | 1526 | return exp_get_vma (tree, def, name); |
252b5132 RH |
1527 | } |
1528 | ||
2c382fb6 | 1529 | fill_type * |
e9ee469a | 1530 | exp_get_fill (etree_type *tree, fill_type *def, char *name) |
2c382fb6 AM |
1531 | { |
1532 | fill_type *fill; | |
2c382fb6 AM |
1533 | size_t len; |
1534 | unsigned int val; | |
1535 | ||
1536 | if (tree == NULL) | |
1537 | return def; | |
1538 | ||
e9ee469a AM |
1539 | exp_fold_tree_no_dot (tree); |
1540 | if (!expld.result.valid_p) | |
1541 | { | |
1542 | if (name != NULL && expld.phase != lang_mark_phase_enum) | |
dab69f68 AM |
1543 | einfo (_("%F%S: nonconstant expression for %s\n"), |
1544 | tree, name); | |
e9ee469a AM |
1545 | return def; |
1546 | } | |
2c382fb6 | 1547 | |
e9ee469a | 1548 | if (expld.result.str != NULL && (len = strlen (expld.result.str)) != 0) |
2c382fb6 AM |
1549 | { |
1550 | unsigned char *dst; | |
1551 | unsigned char *s; | |
1e9cc1c2 | 1552 | fill = (fill_type *) xmalloc ((len + 1) / 2 + sizeof (*fill) - 1); |
2c382fb6 AM |
1553 | fill->size = (len + 1) / 2; |
1554 | dst = fill->data; | |
e9ee469a | 1555 | s = (unsigned char *) expld.result.str; |
2c382fb6 AM |
1556 | val = 0; |
1557 | do | |
1558 | { | |
1559 | unsigned int digit; | |
1560 | ||
1561 | digit = *s++ - '0'; | |
1562 | if (digit > 9) | |
1563 | digit = (digit - 'A' + '0' + 10) & 0xf; | |
1564 | val <<= 4; | |
1565 | val += digit; | |
1566 | --len; | |
1567 | if ((len & 1) == 0) | |
1568 | { | |
1569 | *dst++ = val; | |
1570 | val = 0; | |
1571 | } | |
1572 | } | |
1573 | while (len != 0); | |
1574 | } | |
1575 | else | |
1576 | { | |
1e9cc1c2 | 1577 | fill = (fill_type *) xmalloc (4 + sizeof (*fill) - 1); |
e9ee469a | 1578 | val = expld.result.value; |
2c382fb6 AM |
1579 | fill->data[0] = (val >> 24) & 0xff; |
1580 | fill->data[1] = (val >> 16) & 0xff; | |
1581 | fill->data[2] = (val >> 8) & 0xff; | |
1582 | fill->data[3] = (val >> 0) & 0xff; | |
1583 | fill->size = 4; | |
1584 | } | |
1585 | return fill; | |
1586 | } | |
1587 | ||
252b5132 | 1588 | bfd_vma |
e9ee469a | 1589 | exp_get_abs_int (etree_type *tree, int def, char *name) |
252b5132 | 1590 | { |
e9ee469a AM |
1591 | if (tree != NULL) |
1592 | { | |
1593 | exp_fold_tree_no_dot (tree); | |
c7d701b0 | 1594 | |
e9ee469a AM |
1595 | if (expld.result.valid_p) |
1596 | { | |
7542af2a AM |
1597 | if (expld.result.section != NULL) |
1598 | expld.result.value += expld.result.section->vma; | |
e9ee469a AM |
1599 | return expld.result.value; |
1600 | } | |
1601 | else if (name != NULL && expld.phase != lang_mark_phase_enum) | |
f856040a | 1602 | { |
dab69f68 AM |
1603 | einfo (_("%F%S: nonconstant expression for %s\n"), |
1604 | tree, name); | |
f856040a | 1605 | } |
e9ee469a AM |
1606 | } |
1607 | return def; | |
252b5132 | 1608 | } |
c553bb91 | 1609 | |
e5caa5e0 AM |
1610 | static bfd_vma |
1611 | align_n (bfd_vma value, bfd_vma align) | |
c553bb91 AM |
1612 | { |
1613 | if (align <= 1) | |
1614 | return value; | |
1615 | ||
1616 | value = (value + align - 1) / align; | |
1617 | return value * align; | |
1618 | } | |
18d6a79d AM |
1619 | |
1620 | void | |
1621 | ldexp_init (void) | |
1622 | { | |
1623 | /* The value "13" is ad-hoc, somewhat related to the expected number of | |
1624 | assignments in a linker script. */ | |
1625 | if (!bfd_hash_table_init_n (&definedness_table, | |
1626 | definedness_newfunc, | |
1627 | sizeof (struct definedness_hash_entry), | |
1628 | 13)) | |
1629 | einfo (_("%P%F: can not create hash table: %E\n")); | |
1630 | } | |
1631 | ||
975f8a9e AM |
1632 | /* Convert absolute symbols defined by a script from "dot" (also |
1633 | SEGMENT_START or ORIGIN) outside of an output section statement, | |
1634 | to section relative. */ | |
1635 | ||
1636 | static bfd_boolean | |
1637 | set_sym_sections (struct bfd_hash_entry *bh, void *inf ATTRIBUTE_UNUSED) | |
1638 | { | |
1639 | struct definedness_hash_entry *def = (struct definedness_hash_entry *) bh; | |
1640 | if (def->final_sec != bfd_abs_section_ptr) | |
1641 | { | |
1642 | struct bfd_link_hash_entry *h; | |
1643 | h = bfd_link_hash_lookup (link_info.hash, bh->string, | |
1644 | FALSE, FALSE, TRUE); | |
1645 | if (h != NULL | |
1646 | && h->type == bfd_link_hash_defined | |
1647 | && h->u.def.section == bfd_abs_section_ptr) | |
1648 | { | |
1649 | h->u.def.value -= def->final_sec->vma; | |
1650 | h->u.def.section = def->final_sec; | |
1651 | } | |
1652 | } | |
1653 | return TRUE; | |
1654 | } | |
1655 | ||
1656 | void | |
1657 | ldexp_finalize_syms (void) | |
1658 | { | |
1659 | bfd_hash_traverse (&definedness_table, set_sym_sections, NULL); | |
1660 | } | |
1661 | ||
18d6a79d AM |
1662 | void |
1663 | ldexp_finish (void) | |
1664 | { | |
1665 | bfd_hash_table_free (&definedness_table); | |
1666 | } |