Commit | Line | Data |
---|---|---|
252b5132 | 1 | /* expr.c -operands, expressions- |
250d07de | 2 | Copyright (C) 1987-2021 Free Software Foundation, Inc. |
252b5132 RH |
3 | |
4 | This file is part of GAS, the GNU Assembler. | |
5 | ||
6 | GAS is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
ec2655a6 | 8 | the Free Software Foundation; either version 3, or (at your option) |
252b5132 RH |
9 | any later version. |
10 | ||
11 | GAS is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with GAS; see the file COPYING. If not, write to the Free | |
4b4da160 NC |
18 | Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA |
19 | 02110-1301, USA. */ | |
252b5132 | 20 | |
929b12bc KH |
21 | /* This is really a branch office of as-read.c. I split it out to clearly |
22 | distinguish the world of expressions from the world of statements. | |
23 | (It also gives smaller files to re-compile.) | |
24 | Here, "operand"s are of expressions, not instructions. */ | |
252b5132 | 25 | |
252b5132 RH |
26 | #define min(a, b) ((a) < (b) ? (a) : (b)) |
27 | ||
28 | #include "as.h" | |
3882b010 | 29 | #include "safe-ctype.h" |
252b5132 | 30 | |
d85733c8 | 31 | #include <limits.h> |
d85733c8 JB |
32 | #ifndef CHAR_BIT |
33 | #define CHAR_BIT 8 | |
34 | #endif | |
35 | ||
5b7c81bd | 36 | bool literal_prefix_dollar_hex = false; |
e2d15955 | 37 | |
dd625418 KH |
38 | static void floating_constant (expressionS * expressionP); |
39 | static valueT generic_bignum_to_int32 (void); | |
6d4d30bb | 40 | #ifdef BFD64 |
dd625418 | 41 | static valueT generic_bignum_to_int64 (void); |
6d4d30bb | 42 | #endif |
dd625418 KH |
43 | static void integer_constant (int radix, expressionS * expressionP); |
44 | static void mri_char_constant (expressionS *); | |
dd625418 | 45 | static void clean_up_expression (expressionS * expressionP); |
9497f5ac | 46 | static segT operand (expressionS *, enum expr_mode); |
1e9cc1c2 | 47 | static operatorT operatorf (int *); |
252b5132 | 48 | |
252b5132 RH |
49 | /* We keep a mapping of expression symbols to file positions, so that |
50 | we can provide better error messages. */ | |
51 | ||
e6c774b4 | 52 | struct expr_symbol_line { |
252b5132 RH |
53 | struct expr_symbol_line *next; |
54 | symbolS *sym; | |
3b4dbbbf | 55 | const char *file; |
252b5132 RH |
56 | unsigned int line; |
57 | }; | |
58 | ||
59 | static struct expr_symbol_line *expr_symbol_lines; | |
60 | \f | |
61 | /* Build a dummy symbol to hold a complex expression. This is how we | |
62 | build expressions up out of other expressions. The symbol is put | |
63 | into the fake section expr_section. */ | |
64 | ||
65 | symbolS * | |
dd625418 | 66 | make_expr_symbol (expressionS *expressionP) |
252b5132 RH |
67 | { |
68 | expressionS zero; | |
252b5132 RH |
69 | symbolS *symbolP; |
70 | struct expr_symbol_line *n; | |
71 | ||
72 | if (expressionP->X_op == O_symbol | |
73 | && expressionP->X_add_number == 0) | |
74 | return expressionP->X_add_symbol; | |
75 | ||
76 | if (expressionP->X_op == O_big) | |
77 | { | |
78 | /* This won't work, because the actual value is stored in | |
02000999 AM |
79 | generic_floating_point_number or generic_bignum, and we are |
80 | going to lose it if we haven't already. */ | |
252b5132 | 81 | if (expressionP->X_add_number > 0) |
0e389e77 | 82 | as_bad (_("bignum invalid")); |
252b5132 | 83 | else |
0e389e77 | 84 | as_bad (_("floating point number invalid")); |
252b5132 RH |
85 | zero.X_op = O_constant; |
86 | zero.X_add_number = 0; | |
87 | zero.X_unsigned = 0; | |
956a6ba3 | 88 | zero.X_extrabit = 0; |
252b5132 RH |
89 | clean_up_expression (&zero); |
90 | expressionP = &zero; | |
91 | } | |
92 | ||
252b5132 RH |
93 | /* Putting constant symbols in absolute_section rather than |
94 | expr_section is convenient for the old a.out code, for which | |
95 | S_GET_SEGMENT does not always retrieve the value put in by | |
96 | S_SET_SEGMENT. */ | |
756d1d01 | 97 | symbolP = symbol_create (FAKE_LABEL_NAME, |
252b5132 RH |
98 | (expressionP->X_op == O_constant |
99 | ? absolute_section | |
5a918ce7 JB |
100 | : expressionP->X_op == O_register |
101 | ? reg_section | |
102 | : expr_section), | |
e01e1cee | 103 | &zero_address_frag, 0); |
49309057 | 104 | symbol_set_value_expression (symbolP, expressionP); |
252b5132 RH |
105 | |
106 | if (expressionP->X_op == O_constant) | |
6386f3a7 | 107 | resolve_symbol_value (symbolP); |
252b5132 | 108 | |
325801bd | 109 | n = XNEW (struct expr_symbol_line); |
252b5132 | 110 | n->sym = symbolP; |
3b4dbbbf | 111 | n->file = as_where (&n->line); |
252b5132 RH |
112 | n->next = expr_symbol_lines; |
113 | expr_symbol_lines = n; | |
114 | ||
115 | return symbolP; | |
116 | } | |
117 | ||
118 | /* Return the file and line number for an expr symbol. Return | |
119 | non-zero if something was found, 0 if no information is known for | |
120 | the symbol. */ | |
121 | ||
122 | int | |
3b4dbbbf | 123 | expr_symbol_where (symbolS *sym, const char **pfile, unsigned int *pline) |
252b5132 | 124 | { |
ed9e98c2 | 125 | struct expr_symbol_line *l; |
252b5132 RH |
126 | |
127 | for (l = expr_symbol_lines; l != NULL; l = l->next) | |
128 | { | |
129 | if (l->sym == sym) | |
130 | { | |
131 | *pfile = l->file; | |
132 | *pline = l->line; | |
133 | return 1; | |
134 | } | |
135 | } | |
136 | ||
137 | return 0; | |
138 | } | |
139 | \f | |
140 | /* Utilities for building expressions. | |
141 | Since complex expressions are recorded as symbols for use in other | |
142 | expressions these return a symbolS * and not an expressionS *. | |
143 | These explicitly do not take an "add_number" argument. */ | |
144 | /* ??? For completeness' sake one might want expr_build_symbol. | |
145 | It would just return its argument. */ | |
146 | ||
147 | /* Build an expression for an unsigned constant. | |
148 | The corresponding one for signed constants is missing because | |
149 | there's currently no need for it. One could add an unsigned_p flag | |
150 | but that seems more clumsy. */ | |
151 | ||
152 | symbolS * | |
dd625418 | 153 | expr_build_uconstant (offsetT value) |
252b5132 RH |
154 | { |
155 | expressionS e; | |
156 | ||
157 | e.X_op = O_constant; | |
158 | e.X_add_number = value; | |
159 | e.X_unsigned = 1; | |
956a6ba3 | 160 | e.X_extrabit = 0; |
252b5132 RH |
161 | return make_expr_symbol (&e); |
162 | } | |
163 | ||
252b5132 RH |
164 | /* Build an expression for the current location ('.'). */ |
165 | ||
166 | symbolS * | |
dd625418 | 167 | expr_build_dot (void) |
252b5132 RH |
168 | { |
169 | expressionS e; | |
170 | ||
171 | current_location (&e); | |
e66a3432 | 172 | return symbol_clone_if_forward_ref (make_expr_symbol (&e)); |
252b5132 RH |
173 | } |
174 | \f | |
929b12bc KH |
175 | /* Build any floating-point literal here. |
176 | Also build any bignum literal here. */ | |
252b5132 RH |
177 | |
178 | /* Seems atof_machine can backscan through generic_bignum and hit whatever | |
179 | happens to be loaded before it in memory. And its way too complicated | |
180 | for me to fix right. Thus a hack. JF: Just make generic_bignum bigger, | |
181 | and never write into the early words, thus they'll always be zero. | |
182 | I hate Dean's floating-point code. Bleh. */ | |
183 | LITTLENUM_TYPE generic_bignum[SIZE_OF_LARGE_NUMBER + 6]; | |
e6c774b4 KH |
184 | |
185 | FLONUM_TYPE generic_floating_point_number = { | |
bc4466dc KH |
186 | &generic_bignum[6], /* low. (JF: Was 0) */ |
187 | &generic_bignum[SIZE_OF_LARGE_NUMBER + 6 - 1], /* high. JF: (added +6) */ | |
188 | 0, /* leader. */ | |
189 | 0, /* exponent. */ | |
190 | 0 /* sign. */ | |
252b5132 | 191 | }; |
929b12bc | 192 | |
252b5132 RH |
193 | \f |
194 | static void | |
dd625418 | 195 | floating_constant (expressionS *expressionP) |
252b5132 | 196 | { |
929b12bc | 197 | /* input_line_pointer -> floating-point constant. */ |
252b5132 RH |
198 | int error_code; |
199 | ||
200 | error_code = atof_generic (&input_line_pointer, ".", EXP_CHARS, | |
201 | &generic_floating_point_number); | |
202 | ||
203 | if (error_code) | |
204 | { | |
205 | if (error_code == ERROR_EXPONENT_OVERFLOW) | |
206 | { | |
0e389e77 | 207 | as_bad (_("bad floating-point constant: exponent overflow")); |
252b5132 RH |
208 | } |
209 | else | |
210 | { | |
0e389e77 AM |
211 | as_bad (_("bad floating-point constant: unknown error code=%d"), |
212 | error_code); | |
252b5132 RH |
213 | } |
214 | } | |
215 | expressionP->X_op = O_big; | |
929b12bc KH |
216 | /* input_line_pointer -> just after constant, which may point to |
217 | whitespace. */ | |
252b5132 RH |
218 | expressionP->X_add_number = -1; |
219 | } | |
220 | ||
929b12bc | 221 | static valueT |
dd625418 | 222 | generic_bignum_to_int32 (void) |
252b5132 RH |
223 | { |
224 | valueT number = | |
880fc278 AM |
225 | ((((valueT) generic_bignum[1] & LITTLENUM_MASK) << LITTLENUM_NUMBER_OF_BITS) |
226 | | ((valueT) generic_bignum[0] & LITTLENUM_MASK)); | |
252b5132 RH |
227 | number &= 0xffffffff; |
228 | return number; | |
229 | } | |
230 | ||
231 | #ifdef BFD64 | |
929b12bc | 232 | static valueT |
dd625418 | 233 | generic_bignum_to_int64 (void) |
252b5132 | 234 | { |
929b12bc KH |
235 | valueT number = |
236 | ((((((((valueT) generic_bignum[3] & LITTLENUM_MASK) | |
237 | << LITTLENUM_NUMBER_OF_BITS) | |
238 | | ((valueT) generic_bignum[2] & LITTLENUM_MASK)) | |
239 | << LITTLENUM_NUMBER_OF_BITS) | |
240 | | ((valueT) generic_bignum[1] & LITTLENUM_MASK)) | |
241 | << LITTLENUM_NUMBER_OF_BITS) | |
242 | | ((valueT) generic_bignum[0] & LITTLENUM_MASK)); | |
252b5132 RH |
243 | return number; |
244 | } | |
245 | #endif | |
246 | ||
247 | static void | |
dd625418 | 248 | integer_constant (int radix, expressionS *expressionP) |
252b5132 | 249 | { |
929b12bc | 250 | char *start; /* Start of number. */ |
252b5132 RH |
251 | char *suffix = NULL; |
252 | char c; | |
929b12bc KH |
253 | valueT number; /* Offset or (absolute) value. */ |
254 | short int digit; /* Value of next digit in current radix. */ | |
255 | short int maxdig = 0; /* Highest permitted digit value. */ | |
256 | int too_many_digits = 0; /* If we see >= this number of. */ | |
257 | char *name; /* Points to name of symbol. */ | |
258 | symbolS *symbolP; /* Points to symbol. */ | |
252b5132 | 259 | |
929b12bc | 260 | int small; /* True if fits in 32 bits. */ |
252b5132 | 261 | |
929b12bc | 262 | /* May be bignum, or may fit in 32 bits. */ |
252b5132 RH |
263 | /* Most numbers fit into 32 bits, and we want this case to be fast. |
264 | so we pretend it will fit into 32 bits. If, after making up a 32 | |
265 | bit number, we realise that we have scanned more digits than | |
266 | comfortably fit into 32 bits, we re-scan the digits coding them | |
267 | into a bignum. For decimal and octal numbers we are | |
268 | conservative: Some numbers may be assumed bignums when in fact | |
269 | they do fit into 32 bits. Numbers of any radix can have excess | |
270 | leading zeros: We strive to recognise this and cast them back | |
271 | into 32 bits. We must check that the bignum really is more than | |
272 | 32 bits, and change it back to a 32-bit number if it fits. The | |
273 | number we are looking for is expected to be positive, but if it | |
274 | fits into 32 bits as an unsigned number, we let it be a 32-bit | |
929b12bc | 275 | number. The cavalier approach is for speed in ordinary cases. */ |
252b5132 RH |
276 | /* This has been extended for 64 bits. We blindly assume that if |
277 | you're compiling in 64-bit mode, the target is a 64-bit machine. | |
278 | This should be cleaned up. */ | |
279 | ||
280 | #ifdef BFD64 | |
281 | #define valuesize 64 | |
282 | #else /* includes non-bfd case, mostly */ | |
283 | #define valuesize 32 | |
284 | #endif | |
285 | ||
c14c7a8a AM |
286 | if (is_end_of_line[(unsigned char) *input_line_pointer]) |
287 | { | |
288 | expressionP->X_op = O_absent; | |
289 | return; | |
290 | } | |
291 | ||
f805106c | 292 | if ((NUMBERS_WITH_SUFFIX || flag_m68k_mri) && radix == 0) |
252b5132 RH |
293 | { |
294 | int flt = 0; | |
295 | ||
296 | /* In MRI mode, the number may have a suffix indicating the | |
02000999 AM |
297 | radix. For that matter, it might actually be a floating |
298 | point constant. */ | |
3882b010 | 299 | for (suffix = input_line_pointer; ISALNUM (*suffix); suffix++) |
252b5132 RH |
300 | { |
301 | if (*suffix == 'e' || *suffix == 'E') | |
302 | flt = 1; | |
303 | } | |
304 | ||
305 | if (suffix == input_line_pointer) | |
306 | { | |
307 | radix = 10; | |
308 | suffix = NULL; | |
309 | } | |
310 | else | |
311 | { | |
312 | c = *--suffix; | |
3882b010 | 313 | c = TOUPPER (c); |
fee9cbc7 AM |
314 | /* If we have both NUMBERS_WITH_SUFFIX and LOCAL_LABELS_FB, |
315 | we distinguish between 'B' and 'b'. This is the case for | |
316 | Z80. */ | |
317 | if ((NUMBERS_WITH_SUFFIX && LOCAL_LABELS_FB ? *suffix : c) == 'B') | |
252b5132 RH |
318 | radix = 2; |
319 | else if (c == 'D') | |
320 | radix = 10; | |
321 | else if (c == 'O' || c == 'Q') | |
322 | radix = 8; | |
323 | else if (c == 'H') | |
324 | radix = 16; | |
325 | else if (suffix[1] == '.' || c == 'E' || flt) | |
326 | { | |
327 | floating_constant (expressionP); | |
328 | return; | |
329 | } | |
330 | else | |
331 | { | |
332 | radix = 10; | |
333 | suffix = NULL; | |
334 | } | |
335 | } | |
336 | } | |
337 | ||
338 | switch (radix) | |
339 | { | |
340 | case 2: | |
341 | maxdig = 2; | |
342 | too_many_digits = valuesize + 1; | |
343 | break; | |
344 | case 8: | |
345 | maxdig = radix = 8; | |
346 | too_many_digits = (valuesize + 2) / 3 + 1; | |
347 | break; | |
348 | case 16: | |
349 | maxdig = radix = 16; | |
350 | too_many_digits = (valuesize + 3) / 4 + 1; | |
351 | break; | |
352 | case 10: | |
353 | maxdig = radix = 10; | |
929b12bc | 354 | too_many_digits = (valuesize + 11) / 4; /* Very rough. */ |
252b5132 RH |
355 | } |
356 | #undef valuesize | |
357 | start = input_line_pointer; | |
358 | c = *input_line_pointer++; | |
359 | for (number = 0; | |
360 | (digit = hex_value (c)) < maxdig; | |
361 | c = *input_line_pointer++) | |
362 | { | |
363 | number = number * radix + digit; | |
364 | } | |
929b12bc KH |
365 | /* c contains character after number. */ |
366 | /* input_line_pointer->char after c. */ | |
252b5132 RH |
367 | small = (input_line_pointer - start - 1) < too_many_digits; |
368 | ||
929b12bc | 369 | if (radix == 16 && c == '_') |
252b5132 RH |
370 | { |
371 | /* This is literal of the form 0x333_0_12345678_1. | |
02000999 | 372 | This example is equivalent to 0x00000333000000001234567800000001. */ |
252b5132 RH |
373 | |
374 | int num_little_digits = 0; | |
375 | int i; | |
929b12bc | 376 | input_line_pointer = start; /* -> 1st digit. */ |
252b5132 RH |
377 | |
378 | know (LITTLENUM_NUMBER_OF_BITS == 16); | |
379 | ||
929b12bc | 380 | for (c = '_'; c == '_'; num_little_digits += 2) |
252b5132 RH |
381 | { |
382 | ||
929b12bc KH |
383 | /* Convert one 64-bit word. */ |
384 | int ndigit = 0; | |
252b5132 RH |
385 | number = 0; |
386 | for (c = *input_line_pointer++; | |
387 | (digit = hex_value (c)) < maxdig; | |
388 | c = *(input_line_pointer++)) | |
389 | { | |
390 | number = number * radix + digit; | |
391 | ndigit++; | |
392 | } | |
393 | ||
394 | /* Check for 8 digit per word max. */ | |
929b12bc | 395 | if (ndigit > 8) |
0e389e77 | 396 | as_bad (_("a bignum with underscores may not have more than 8 hex digits in any word")); |
252b5132 | 397 | |
929b12bc KH |
398 | /* Add this chunk to the bignum. |
399 | Shift things down 2 little digits. */ | |
252b5132 | 400 | know (LITTLENUM_NUMBER_OF_BITS == 16); |
929b12bc KH |
401 | for (i = min (num_little_digits + 1, SIZE_OF_LARGE_NUMBER - 1); |
402 | i >= 2; | |
403 | i--) | |
404 | generic_bignum[i] = generic_bignum[i - 2]; | |
252b5132 | 405 | |
929b12bc | 406 | /* Add the new digits as the least significant new ones. */ |
252b5132 RH |
407 | generic_bignum[0] = number & 0xffffffff; |
408 | generic_bignum[1] = number >> 16; | |
409 | } | |
410 | ||
929b12bc | 411 | /* Again, c is char after number, input_line_pointer->after c. */ |
252b5132 RH |
412 | |
413 | if (num_little_digits > SIZE_OF_LARGE_NUMBER - 1) | |
414 | num_little_digits = SIZE_OF_LARGE_NUMBER - 1; | |
415 | ||
9c2799c2 | 416 | gas_assert (num_little_digits >= 4); |
252b5132 RH |
417 | |
418 | if (num_little_digits != 8) | |
0e389e77 | 419 | as_bad (_("a bignum with underscores must have exactly 4 words")); |
252b5132 RH |
420 | |
421 | /* We might have some leading zeros. These can be trimmed to give | |
929b12bc KH |
422 | us a change to fit this constant into a small number. */ |
423 | while (generic_bignum[num_little_digits - 1] == 0 | |
424 | && num_little_digits > 1) | |
252b5132 | 425 | num_little_digits--; |
929b12bc | 426 | |
252b5132 RH |
427 | if (num_little_digits <= 2) |
428 | { | |
929b12bc | 429 | /* will fit into 32 bits. */ |
252b5132 RH |
430 | number = generic_bignum_to_int32 (); |
431 | small = 1; | |
432 | } | |
433 | #ifdef BFD64 | |
434 | else if (num_little_digits <= 4) | |
435 | { | |
436 | /* Will fit into 64 bits. */ | |
437 | number = generic_bignum_to_int64 (); | |
438 | small = 1; | |
439 | } | |
440 | #endif | |
441 | else | |
442 | { | |
443 | small = 0; | |
929b12bc KH |
444 | |
445 | /* Number of littlenums in the bignum. */ | |
446 | number = num_little_digits; | |
252b5132 RH |
447 | } |
448 | } | |
449 | else if (!small) | |
450 | { | |
929b12bc KH |
451 | /* We saw a lot of digits. manufacture a bignum the hard way. */ |
452 | LITTLENUM_TYPE *leader; /* -> high order littlenum of the bignum. */ | |
453 | LITTLENUM_TYPE *pointer; /* -> littlenum we are frobbing now. */ | |
252b5132 RH |
454 | long carry; |
455 | ||
456 | leader = generic_bignum; | |
457 | generic_bignum[0] = 0; | |
458 | generic_bignum[1] = 0; | |
459 | generic_bignum[2] = 0; | |
460 | generic_bignum[3] = 0; | |
929b12bc | 461 | input_line_pointer = start; /* -> 1st digit. */ |
252b5132 | 462 | c = *input_line_pointer++; |
929b12bc | 463 | for (; (carry = hex_value (c)) < maxdig; c = *input_line_pointer++) |
252b5132 | 464 | { |
929b12bc | 465 | for (pointer = generic_bignum; pointer <= leader; pointer++) |
252b5132 RH |
466 | { |
467 | long work; | |
468 | ||
469 | work = carry + radix * *pointer; | |
470 | *pointer = work & LITTLENUM_MASK; | |
471 | carry = work >> LITTLENUM_NUMBER_OF_BITS; | |
472 | } | |
473 | if (carry) | |
474 | { | |
475 | if (leader < generic_bignum + SIZE_OF_LARGE_NUMBER - 1) | |
476 | { | |
929b12bc | 477 | /* Room to grow a longer bignum. */ |
252b5132 RH |
478 | *++leader = carry; |
479 | } | |
480 | } | |
481 | } | |
929b12bc KH |
482 | /* Again, c is char after number. */ |
483 | /* input_line_pointer -> after c. */ | |
252b5132 RH |
484 | know (LITTLENUM_NUMBER_OF_BITS == 16); |
485 | if (leader < generic_bignum + 2) | |
486 | { | |
929b12bc | 487 | /* Will fit into 32 bits. */ |
252b5132 RH |
488 | number = generic_bignum_to_int32 (); |
489 | small = 1; | |
490 | } | |
491 | #ifdef BFD64 | |
492 | else if (leader < generic_bignum + 4) | |
493 | { | |
494 | /* Will fit into 64 bits. */ | |
495 | number = generic_bignum_to_int64 (); | |
496 | small = 1; | |
497 | } | |
498 | #endif | |
499 | else | |
500 | { | |
929b12bc KH |
501 | /* Number of littlenums in the bignum. */ |
502 | number = leader - generic_bignum + 1; | |
252b5132 RH |
503 | } |
504 | } | |
505 | ||
60bcf0fa NC |
506 | if ((NUMBERS_WITH_SUFFIX || flag_m68k_mri) |
507 | && suffix != NULL | |
f805106c | 508 | && input_line_pointer - 1 == suffix) |
252b5132 RH |
509 | c = *input_line_pointer++; |
510 | ||
e140100a NC |
511 | #ifndef tc_allow_U_suffix |
512 | #define tc_allow_U_suffix 1 | |
513 | #endif | |
514 | /* PR 19910: Look for, and ignore, a U suffix to the number. */ | |
515 | if (tc_allow_U_suffix && (c == 'U' || c == 'u')) | |
516 | c = * input_line_pointer++; | |
517 | ||
86b80085 NC |
518 | #ifndef tc_allow_L_suffix |
519 | #define tc_allow_L_suffix 1 | |
520 | #endif | |
521 | /* PR 20732: Look for, and ignore, a L or LL suffix to the number. */ | |
522 | if (tc_allow_L_suffix) | |
523 | while (c == 'L' || c == 'l') | |
524 | c = * input_line_pointer++; | |
525 | ||
252b5132 RH |
526 | if (small) |
527 | { | |
929b12bc KH |
528 | /* Here with number, in correct radix. c is the next char. |
529 | Note that unlike un*x, we allow "011f" "0x9f" to both mean | |
530 | the same as the (conventional) "9f". | |
531 | This is simply easier than checking for strict canonical | |
532 | form. Syntax sux! */ | |
252b5132 RH |
533 | |
534 | if (LOCAL_LABELS_FB && c == 'b') | |
535 | { | |
929b12bc KH |
536 | /* Backward ref to local label. |
537 | Because it is backward, expect it to be defined. */ | |
252b5132 RH |
538 | /* Construct a local label. */ |
539 | name = fb_label_name ((int) number, 0); | |
540 | ||
929b12bc | 541 | /* Seen before, or symbol is defined: OK. */ |
252b5132 RH |
542 | symbolP = symbol_find (name); |
543 | if ((symbolP != NULL) && (S_IS_DEFINED (symbolP))) | |
544 | { | |
929b12bc KH |
545 | /* Local labels are never absolute. Don't waste time |
546 | checking absoluteness. */ | |
252b5132 RH |
547 | know (SEG_NORMAL (S_GET_SEGMENT (symbolP))); |
548 | ||
549 | expressionP->X_op = O_symbol; | |
550 | expressionP->X_add_symbol = symbolP; | |
551 | } | |
552 | else | |
553 | { | |
929b12bc | 554 | /* Either not seen or not defined. */ |
252b5132 RH |
555 | /* @@ Should print out the original string instead of |
556 | the parsed number. */ | |
0e389e77 | 557 | as_bad (_("backward ref to unknown label \"%d:\""), |
252b5132 RH |
558 | (int) number); |
559 | expressionP->X_op = O_constant; | |
560 | } | |
561 | ||
562 | expressionP->X_add_number = 0; | |
563 | } /* case 'b' */ | |
564 | else if (LOCAL_LABELS_FB && c == 'f') | |
565 | { | |
929b12bc KH |
566 | /* Forward reference. Expect symbol to be undefined or |
567 | unknown. undefined: seen it before. unknown: never seen | |
568 | it before. | |
569 | ||
570 | Construct a local label name, then an undefined symbol. | |
571 | Don't create a xseg frag for it: caller may do that. | |
572 | Just return it as never seen before. */ | |
252b5132 RH |
573 | name = fb_label_name ((int) number, 1); |
574 | symbolP = symbol_find_or_make (name); | |
929b12bc | 575 | /* We have no need to check symbol properties. */ |
252b5132 | 576 | #ifndef many_segments |
929b12bc | 577 | /* Since "know" puts its arg into a "string", we |
252b5132 RH |
578 | can't have newlines in the argument. */ |
579 | know (S_GET_SEGMENT (symbolP) == undefined_section || S_GET_SEGMENT (symbolP) == text_section || S_GET_SEGMENT (symbolP) == data_section); | |
580 | #endif | |
581 | expressionP->X_op = O_symbol; | |
582 | expressionP->X_add_symbol = symbolP; | |
583 | expressionP->X_add_number = 0; | |
584 | } /* case 'f' */ | |
585 | else if (LOCAL_LABELS_DOLLAR && c == '$') | |
586 | { | |
587 | /* If the dollar label is *currently* defined, then this is just | |
588 | another reference to it. If it is not *currently* defined, | |
589 | then this is a fresh instantiation of that number, so create | |
590 | it. */ | |
591 | ||
592 | if (dollar_label_defined ((long) number)) | |
593 | { | |
594 | name = dollar_label_name ((long) number, 0); | |
595 | symbolP = symbol_find (name); | |
596 | know (symbolP != NULL); | |
597 | } | |
598 | else | |
599 | { | |
600 | name = dollar_label_name ((long) number, 1); | |
601 | symbolP = symbol_find_or_make (name); | |
602 | } | |
603 | ||
604 | expressionP->X_op = O_symbol; | |
605 | expressionP->X_add_symbol = symbolP; | |
606 | expressionP->X_add_number = 0; | |
607 | } /* case '$' */ | |
608 | else | |
609 | { | |
610 | expressionP->X_op = O_constant; | |
252b5132 | 611 | expressionP->X_add_number = number; |
bc4466dc | 612 | input_line_pointer--; /* Restore following character. */ |
929b12bc | 613 | } /* Really just a number. */ |
252b5132 RH |
614 | } |
615 | else | |
616 | { | |
bc4466dc | 617 | /* Not a small number. */ |
252b5132 | 618 | expressionP->X_op = O_big; |
929b12bc KH |
619 | expressionP->X_add_number = number; /* Number of littlenums. */ |
620 | input_line_pointer--; /* -> char following number. */ | |
252b5132 RH |
621 | } |
622 | } | |
623 | ||
624 | /* Parse an MRI multi character constant. */ | |
625 | ||
626 | static void | |
dd625418 | 627 | mri_char_constant (expressionS *expressionP) |
252b5132 RH |
628 | { |
629 | int i; | |
630 | ||
631 | if (*input_line_pointer == '\'' | |
632 | && input_line_pointer[1] != '\'') | |
633 | { | |
634 | expressionP->X_op = O_constant; | |
635 | expressionP->X_add_number = 0; | |
636 | return; | |
637 | } | |
638 | ||
639 | /* In order to get the correct byte ordering, we must build the | |
640 | number in reverse. */ | |
641 | for (i = SIZE_OF_LARGE_NUMBER - 1; i >= 0; i--) | |
642 | { | |
643 | int j; | |
644 | ||
645 | generic_bignum[i] = 0; | |
646 | for (j = 0; j < CHARS_PER_LITTLENUM; j++) | |
647 | { | |
648 | if (*input_line_pointer == '\'') | |
649 | { | |
650 | if (input_line_pointer[1] != '\'') | |
651 | break; | |
652 | ++input_line_pointer; | |
653 | } | |
654 | generic_bignum[i] <<= 8; | |
655 | generic_bignum[i] += *input_line_pointer; | |
656 | ++input_line_pointer; | |
657 | } | |
658 | ||
659 | if (i < SIZE_OF_LARGE_NUMBER - 1) | |
660 | { | |
661 | /* If there is more than one littlenum, left justify the | |
02000999 AM |
662 | last one to make it match the earlier ones. If there is |
663 | only one, we can just use the value directly. */ | |
252b5132 RH |
664 | for (; j < CHARS_PER_LITTLENUM; j++) |
665 | generic_bignum[i] <<= 8; | |
666 | } | |
667 | ||
668 | if (*input_line_pointer == '\'' | |
669 | && input_line_pointer[1] != '\'') | |
670 | break; | |
671 | } | |
672 | ||
673 | if (i < 0) | |
674 | { | |
0e389e77 | 675 | as_bad (_("character constant too large")); |
252b5132 RH |
676 | i = 0; |
677 | } | |
678 | ||
679 | if (i > 0) | |
680 | { | |
681 | int c; | |
682 | int j; | |
683 | ||
684 | c = SIZE_OF_LARGE_NUMBER - i; | |
685 | for (j = 0; j < c; j++) | |
686 | generic_bignum[j] = generic_bignum[i + j]; | |
687 | i = c; | |
688 | } | |
689 | ||
690 | know (LITTLENUM_NUMBER_OF_BITS == 16); | |
691 | if (i > 2) | |
692 | { | |
693 | expressionP->X_op = O_big; | |
694 | expressionP->X_add_number = i; | |
695 | } | |
696 | else | |
697 | { | |
698 | expressionP->X_op = O_constant; | |
699 | if (i < 2) | |
700 | expressionP->X_add_number = generic_bignum[0] & LITTLENUM_MASK; | |
701 | else | |
702 | expressionP->X_add_number = | |
703 | (((generic_bignum[1] & LITTLENUM_MASK) | |
704 | << LITTLENUM_NUMBER_OF_BITS) | |
705 | | (generic_bignum[0] & LITTLENUM_MASK)); | |
706 | } | |
707 | ||
708 | /* Skip the final closing quote. */ | |
709 | ++input_line_pointer; | |
710 | } | |
711 | ||
712 | /* Return an expression representing the current location. This | |
713 | handles the magic symbol `.'. */ | |
714 | ||
b7adb16d | 715 | void |
dd625418 | 716 | current_location (expressionS *expressionp) |
252b5132 RH |
717 | { |
718 | if (now_seg == absolute_section) | |
719 | { | |
720 | expressionp->X_op = O_constant; | |
721 | expressionp->X_add_number = abs_section_offset; | |
722 | } | |
723 | else | |
724 | { | |
252b5132 | 725 | expressionp->X_op = O_symbol; |
4a826962 | 726 | expressionp->X_add_symbol = &dot_symbol; |
252b5132 RH |
727 | expressionp->X_add_number = 0; |
728 | } | |
729 | } | |
730 | ||
929b12bc KH |
731 | /* In: Input_line_pointer points to 1st char of operand, which may |
732 | be a space. | |
733 | ||
3b37fd66 | 734 | Out: An expressionS. |
929b12bc KH |
735 | The operand may have been empty: in this case X_op == O_absent. |
736 | Input_line_pointer->(next non-blank) char after operand. */ | |
252b5132 RH |
737 | |
738 | static segT | |
9497f5ac | 739 | operand (expressionS *expressionP, enum expr_mode mode) |
252b5132 RH |
740 | { |
741 | char c; | |
929b12bc KH |
742 | symbolS *symbolP; /* Points to symbol. */ |
743 | char *name; /* Points to name of symbol. */ | |
252b5132 RH |
744 | segT segment; |
745 | ||
746 | /* All integers are regarded as unsigned unless they are negated. | |
747 | This is because the only thing which cares whether a number is | |
748 | unsigned is the code in emit_expr which extends constants into | |
749 | bignums. It should only sign extend negative numbers, so that | |
750 | something like ``.quad 0x80000000'' is not sign extended even | |
751 | though it appears negative if valueT is 32 bits. */ | |
752 | expressionP->X_unsigned = 1; | |
956a6ba3 | 753 | expressionP->X_extrabit = 0; |
252b5132 | 754 | |
929b12bc | 755 | /* Digits, assume it is a bignum. */ |
252b5132 | 756 | |
929b12bc | 757 | SKIP_WHITESPACE (); /* Leading whitespace is part of operand. */ |
bc4466dc | 758 | c = *input_line_pointer++; /* input_line_pointer -> past char in c. */ |
252b5132 | 759 | |
b75c0c92 AM |
760 | if (is_end_of_line[(unsigned char) c]) |
761 | goto eol; | |
762 | ||
252b5132 RH |
763 | switch (c) |
764 | { | |
765 | case '1': | |
766 | case '2': | |
767 | case '3': | |
768 | case '4': | |
769 | case '5': | |
770 | case '6': | |
771 | case '7': | |
772 | case '8': | |
773 | case '9': | |
774 | input_line_pointer--; | |
775 | ||
60bcf0fa | 776 | integer_constant ((NUMBERS_WITH_SUFFIX || flag_m68k_mri) |
929b12bc | 777 | ? 0 : 10, |
411863a4 | 778 | expressionP); |
252b5132 RH |
779 | break; |
780 | ||
977e771a FCE |
781 | #ifdef LITERAL_PREFIXPERCENT_BIN |
782 | case '%': | |
783 | integer_constant (2, expressionP); | |
784 | break; | |
785 | #endif | |
786 | ||
252b5132 | 787 | case '0': |
929b12bc | 788 | /* Non-decimal radix. */ |
252b5132 | 789 | |
f805106c | 790 | if (NUMBERS_WITH_SUFFIX || flag_m68k_mri) |
252b5132 RH |
791 | { |
792 | char *s; | |
793 | ||
02000999 | 794 | /* Check for a hex or float constant. */ |
252b5132 RH |
795 | for (s = input_line_pointer; hex_p (*s); s++) |
796 | ; | |
02000999 | 797 | if (*s == 'h' || *s == 'H' || *input_line_pointer == '.') |
252b5132 RH |
798 | { |
799 | --input_line_pointer; | |
800 | integer_constant (0, expressionP); | |
801 | break; | |
802 | } | |
929b12bc | 803 | } |
252b5132 RH |
804 | c = *input_line_pointer; |
805 | switch (c) | |
806 | { | |
807 | case 'o': | |
808 | case 'O': | |
809 | case 'q': | |
810 | case 'Q': | |
811 | case '8': | |
812 | case '9': | |
f805106c | 813 | if (NUMBERS_WITH_SUFFIX || flag_m68k_mri) |
252b5132 RH |
814 | { |
815 | integer_constant (0, expressionP); | |
816 | break; | |
817 | } | |
818 | /* Fall through. */ | |
819 | default: | |
820 | default_case: | |
821 | if (c && strchr (FLT_CHARS, c)) | |
822 | { | |
823 | input_line_pointer++; | |
824 | floating_constant (expressionP); | |
3882b010 | 825 | expressionP->X_add_number = - TOLOWER (c); |
252b5132 RH |
826 | } |
827 | else | |
828 | { | |
929b12bc | 829 | /* The string was only zero. */ |
252b5132 RH |
830 | expressionP->X_op = O_constant; |
831 | expressionP->X_add_number = 0; | |
832 | } | |
833 | ||
834 | break; | |
835 | ||
836 | case 'x': | |
837 | case 'X': | |
ab266a97 | 838 | if (flag_m68k_mri) |
252b5132 RH |
839 | goto default_case; |
840 | input_line_pointer++; | |
841 | integer_constant (16, expressionP); | |
842 | break; | |
843 | ||
844 | case 'b': | |
c14c7a8a AM |
845 | if (LOCAL_LABELS_FB && !flag_m68k_mri |
846 | && input_line_pointer[1] != '0' | |
847 | && input_line_pointer[1] != '1') | |
252b5132 | 848 | { |
c14c7a8a AM |
849 | /* Parse this as a back reference to label 0. */ |
850 | input_line_pointer--; | |
851 | integer_constant (10, expressionP); | |
852 | break; | |
252b5132 | 853 | } |
c14c7a8a | 854 | /* Otherwise, parse this as a binary number. */ |
252b5132 RH |
855 | /* Fall through. */ |
856 | case 'B': | |
c14c7a8a AM |
857 | if (input_line_pointer[1] == '0' |
858 | || input_line_pointer[1] == '1') | |
859 | { | |
860 | input_line_pointer++; | |
861 | integer_constant (2, expressionP); | |
862 | break; | |
863 | } | |
6dc19fc4 | 864 | if (flag_m68k_mri || NUMBERS_WITH_SUFFIX) |
c14c7a8a AM |
865 | input_line_pointer++; |
866 | goto default_case; | |
252b5132 RH |
867 | |
868 | case '0': | |
869 | case '1': | |
870 | case '2': | |
871 | case '3': | |
872 | case '4': | |
873 | case '5': | |
874 | case '6': | |
875 | case '7': | |
6dc19fc4 | 876 | integer_constant ((flag_m68k_mri || NUMBERS_WITH_SUFFIX) |
929b12bc KH |
877 | ? 0 : 8, |
878 | expressionP); | |
252b5132 RH |
879 | break; |
880 | ||
881 | case 'f': | |
882 | if (LOCAL_LABELS_FB) | |
883 | { | |
19c2883a AM |
884 | int is_label = 1; |
885 | ||
252b5132 RH |
886 | /* If it says "0f" and it could possibly be a floating point |
887 | number, make it one. Otherwise, make it a local label, | |
888 | and try to deal with parsing the rest later. */ | |
19c2883a AM |
889 | if (!is_end_of_line[(unsigned char) input_line_pointer[1]] |
890 | && strchr (FLT_CHARS, 'f') != NULL) | |
891 | { | |
892 | char *cp = input_line_pointer + 1; | |
893 | ||
894 | atof_generic (&cp, ".", EXP_CHARS, | |
895 | &generic_floating_point_number); | |
896 | ||
897 | /* Was nothing parsed, or does it look like an | |
898 | expression? */ | |
899 | is_label = (cp == input_line_pointer + 1 | |
900 | || (cp == input_line_pointer + 2 | |
901 | && (cp[-1] == '-' || cp[-1] == '+')) | |
902 | || *cp == 'f' | |
903 | || *cp == 'b'); | |
904 | } | |
905 | if (is_label) | |
906 | { | |
907 | input_line_pointer--; | |
908 | integer_constant (10, expressionP); | |
909 | break; | |
910 | } | |
252b5132 | 911 | } |
19c2883a | 912 | /* Fall through. */ |
252b5132 RH |
913 | |
914 | case 'd': | |
915 | case 'D': | |
6dc19fc4 | 916 | if (flag_m68k_mri || NUMBERS_WITH_SUFFIX) |
252b5132 RH |
917 | { |
918 | integer_constant (0, expressionP); | |
919 | break; | |
920 | } | |
921 | /* Fall through. */ | |
922 | case 'F': | |
923 | case 'r': | |
924 | case 'e': | |
925 | case 'E': | |
926 | case 'g': | |
927 | case 'G': | |
928 | input_line_pointer++; | |
929 | floating_constant (expressionP); | |
3882b010 | 930 | expressionP->X_add_number = - TOLOWER (c); |
252b5132 RH |
931 | break; |
932 | ||
933 | case '$': | |
934 | if (LOCAL_LABELS_DOLLAR) | |
935 | { | |
936 | integer_constant (10, expressionP); | |
937 | break; | |
938 | } | |
939 | else | |
940 | goto default_case; | |
941 | } | |
942 | ||
943 | break; | |
944 | ||
b585bc2c | 945 | #ifndef NEED_INDEX_OPERATOR |
252b5132 | 946 | case '[': |
fcaed75e JB |
947 | # ifdef md_need_index_operator |
948 | if (md_need_index_operator()) | |
949 | goto de_fault; | |
950 | # endif | |
b585bc2c | 951 | #endif |
fcddde94 | 952 | /* Fall through. */ |
fcaed75e | 953 | case '(': |
929b12bc | 954 | /* Didn't begin with digit & not a name. */ |
259af69e | 955 | segment = expr (0, expressionP, mode); |
929b12bc | 956 | /* expression () will pass trailing whitespace. */ |
f7c88872 AM |
957 | if ((c == '(' && *input_line_pointer != ')') |
958 | || (c == '[' && *input_line_pointer != ']')) | |
e140100a NC |
959 | { |
960 | if (* input_line_pointer) | |
961 | as_bad (_("found '%c', expected: '%c'"), | |
962 | * input_line_pointer, c == '(' ? ')' : ']'); | |
963 | else | |
964 | as_bad (_("missing '%c'"), c == '(' ? ')' : ']'); | |
965 | } | |
f7c88872 | 966 | else |
929b12bc | 967 | input_line_pointer++; |
252b5132 | 968 | SKIP_WHITESPACE (); |
929b12bc | 969 | /* Here with input_line_pointer -> char after "(...)". */ |
252b5132 RH |
970 | return segment; |
971 | ||
abd63a32 | 972 | #ifdef TC_M68K |
252b5132 RH |
973 | case 'E': |
974 | if (! flag_m68k_mri || *input_line_pointer != '\'') | |
975 | goto de_fault; | |
976 | as_bad (_("EBCDIC constants are not supported")); | |
977 | /* Fall through. */ | |
978 | case 'A': | |
979 | if (! flag_m68k_mri || *input_line_pointer != '\'') | |
980 | goto de_fault; | |
981 | ++input_line_pointer; | |
abd63a32 | 982 | #endif |
fcddde94 | 983 | /* Fall through. */ |
252b5132 RH |
984 | case '\'': |
985 | if (! flag_m68k_mri) | |
986 | { | |
987 | /* Warning: to conform to other people's assemblers NO | |
929b12bc | 988 | ESCAPEMENT is permitted for a single quote. The next |
252b5132 | 989 | character, parity errors and all, is taken as the value |
929b12bc | 990 | of the operand. VERY KINKY. */ |
252b5132 RH |
991 | expressionP->X_op = O_constant; |
992 | expressionP->X_add_number = *input_line_pointer++; | |
993 | break; | |
994 | } | |
995 | ||
996 | mri_char_constant (expressionP); | |
997 | break; | |
998 | ||
abd63a32 | 999 | #ifdef TC_M68K |
252b5132 RH |
1000 | case '"': |
1001 | /* Double quote is the bitwise not operator in MRI mode. */ | |
1002 | if (! flag_m68k_mri) | |
1003 | goto de_fault; | |
abd63a32 | 1004 | #endif |
fcddde94 | 1005 | /* Fall through. */ |
252b5132 | 1006 | case '~': |
929b12bc | 1007 | /* '~' is permitted to start a label on the Delta. */ |
252b5132 RH |
1008 | if (is_name_beginner (c)) |
1009 | goto isname; | |
1a0670f3 | 1010 | /* Fall through. */ |
252b5132 RH |
1011 | case '!': |
1012 | case '-': | |
43c3ab55 | 1013 | case '+': |
252b5132 | 1014 | { |
fcaed75e JB |
1015 | #ifdef md_operator |
1016 | unary: | |
1017 | #endif | |
9497f5ac | 1018 | operand (expressionP, mode); |
252b5132 RH |
1019 | if (expressionP->X_op == O_constant) |
1020 | { | |
929b12bc | 1021 | /* input_line_pointer -> char after operand. */ |
252b5132 RH |
1022 | if (c == '-') |
1023 | { | |
65879393 AM |
1024 | expressionP->X_add_number |
1025 | = - (addressT) expressionP->X_add_number; | |
929b12bc KH |
1026 | /* Notice: '-' may overflow: no warning is given. |
1027 | This is compatible with other people's | |
1028 | assemblers. Sigh. */ | |
252b5132 | 1029 | expressionP->X_unsigned = 0; |
956a6ba3 JB |
1030 | if (expressionP->X_add_number) |
1031 | expressionP->X_extrabit ^= 1; | |
252b5132 RH |
1032 | } |
1033 | else if (c == '~' || c == '"') | |
1034 | expressionP->X_add_number = ~ expressionP->X_add_number; | |
43c3ab55 | 1035 | else if (c == '!') |
252b5132 RH |
1036 | expressionP->X_add_number = ! expressionP->X_add_number; |
1037 | } | |
02000999 AM |
1038 | else if (expressionP->X_op == O_big |
1039 | && expressionP->X_add_number <= 0 | |
1040 | && c == '-' | |
1041 | && (generic_floating_point_number.sign == '+' | |
1042 | || generic_floating_point_number.sign == 'P')) | |
1043 | { | |
1044 | /* Negative flonum (eg, -1.000e0). */ | |
1045 | if (generic_floating_point_number.sign == '+') | |
1046 | generic_floating_point_number.sign = '-'; | |
1047 | else | |
1048 | generic_floating_point_number.sign = 'N'; | |
1049 | } | |
b2221023 MM |
1050 | else if (expressionP->X_op == O_big |
1051 | && expressionP->X_add_number > 0) | |
1052 | { | |
1053 | int i; | |
1054 | ||
1055 | if (c == '~' || c == '-') | |
1056 | { | |
1057 | for (i = 0; i < expressionP->X_add_number; ++i) | |
1058 | generic_bignum[i] = ~generic_bignum[i]; | |
93d90f46 AM |
1059 | |
1060 | /* Extend the bignum to at least the size of .octa. */ | |
1061 | if (expressionP->X_add_number < SIZE_OF_LARGE_NUMBER) | |
1062 | { | |
1063 | expressionP->X_add_number = SIZE_OF_LARGE_NUMBER; | |
1064 | for (; i < expressionP->X_add_number; ++i) | |
1065 | generic_bignum[i] = ~(LITTLENUM_TYPE) 0; | |
1066 | } | |
1067 | ||
b2221023 MM |
1068 | if (c == '-') |
1069 | for (i = 0; i < expressionP->X_add_number; ++i) | |
1070 | { | |
1071 | generic_bignum[i] += 1; | |
1072 | if (generic_bignum[i]) | |
1073 | break; | |
1074 | } | |
1075 | } | |
1076 | else if (c == '!') | |
1077 | { | |
b2221023 | 1078 | for (i = 0; i < expressionP->X_add_number; ++i) |
93d90f46 AM |
1079 | if (generic_bignum[i] != 0) |
1080 | break; | |
1081 | expressionP->X_add_number = i >= expressionP->X_add_number; | |
1082 | expressionP->X_op = O_constant; | |
1083 | expressionP->X_unsigned = 1; | |
956a6ba3 | 1084 | expressionP->X_extrabit = 0; |
b2221023 MM |
1085 | } |
1086 | } | |
252b5132 RH |
1087 | else if (expressionP->X_op != O_illegal |
1088 | && expressionP->X_op != O_absent) | |
1089 | { | |
43c3ab55 JB |
1090 | if (c != '+') |
1091 | { | |
1092 | expressionP->X_add_symbol = make_expr_symbol (expressionP); | |
1093 | if (c == '-') | |
1094 | expressionP->X_op = O_uminus; | |
1095 | else if (c == '~' || c == '"') | |
1096 | expressionP->X_op = O_bit_not; | |
1097 | else | |
1098 | expressionP->X_op = O_logical_not; | |
1099 | expressionP->X_add_number = 0; | |
1100 | } | |
252b5132 RH |
1101 | } |
1102 | else | |
1103 | as_warn (_("Unary operator %c ignored because bad operand follows"), | |
1104 | c); | |
1105 | } | |
1106 | break; | |
1107 | ||
e2d15955 JD |
1108 | #if !defined (DOLLAR_DOT) && !defined (TC_M68K) |
1109 | case '$': | |
1110 | if (literal_prefix_dollar_hex) | |
1111 | { | |
1112 | /* $L is the start of a local label, not a hex constant. */ | |
1113 | if (* input_line_pointer == 'L') | |
1114 | goto isname; | |
1115 | integer_constant (16, expressionP); | |
1116 | } | |
1117 | else | |
1118 | { | |
1119 | goto isname; | |
1120 | } | |
1121 | break; | |
1122 | #else | |
252b5132 | 1123 | case '$': |
929b12bc | 1124 | /* '$' is the program counter when in MRI mode, or when |
02000999 | 1125 | DOLLAR_DOT is defined. */ |
252b5132 RH |
1126 | #ifndef DOLLAR_DOT |
1127 | if (! flag_m68k_mri) | |
1128 | goto de_fault; | |
1129 | #endif | |
4fa6945e | 1130 | if (DOLLAR_AMBIGU && hex_p (*input_line_pointer)) |
252b5132 | 1131 | { |
4fa6945e NC |
1132 | /* In MRI mode and on Z80, '$' is also used as the prefix |
1133 | for a hexadecimal constant. */ | |
252b5132 RH |
1134 | integer_constant (16, expressionP); |
1135 | break; | |
1136 | } | |
1137 | ||
1138 | if (is_part_of_name (*input_line_pointer)) | |
1139 | goto isname; | |
1140 | ||
1141 | current_location (expressionP); | |
1142 | break; | |
abd63a32 | 1143 | #endif |
252b5132 RH |
1144 | |
1145 | case '.': | |
1146 | if (!is_part_of_name (*input_line_pointer)) | |
1147 | { | |
1148 | current_location (expressionP); | |
1149 | break; | |
1150 | } | |
1151 | else if ((strncasecmp (input_line_pointer, "startof.", 8) == 0 | |
1152 | && ! is_part_of_name (input_line_pointer[8])) | |
1153 | || (strncasecmp (input_line_pointer, "sizeof.", 7) == 0 | |
1154 | && ! is_part_of_name (input_line_pointer[7]))) | |
1155 | { | |
1156 | int start; | |
1157 | ||
1158 | start = (input_line_pointer[1] == 't' | |
1159 | || input_line_pointer[1] == 'T'); | |
1160 | input_line_pointer += start ? 8 : 7; | |
1161 | SKIP_WHITESPACE (); | |
b0c53498 JB |
1162 | |
1163 | /* Cover for the as_bad () invocations below. */ | |
1164 | expressionP->X_op = O_absent; | |
1165 | ||
252b5132 RH |
1166 | if (*input_line_pointer != '(') |
1167 | as_bad (_("syntax error in .startof. or .sizeof.")); | |
1168 | else | |
1169 | { | |
1170 | char *buf; | |
1171 | ||
1172 | ++input_line_pointer; | |
1173 | SKIP_WHITESPACE (); | |
d02603dc | 1174 | c = get_symbol_name (& name); |
b0c53498 JB |
1175 | if (! *name) |
1176 | { | |
1177 | as_bad (_("expected symbol name")); | |
1178 | (void) restore_line_pointer (c); | |
1179 | if (c != ')') | |
1180 | ignore_rest_of_line (); | |
1181 | else | |
1182 | ++input_line_pointer; | |
1183 | break; | |
1184 | } | |
252b5132 | 1185 | |
29a2809e TS |
1186 | buf = concat (start ? ".startof." : ".sizeof.", name, |
1187 | (char *) NULL); | |
252b5132 RH |
1188 | symbolP = symbol_make (buf); |
1189 | free (buf); | |
1190 | ||
1191 | expressionP->X_op = O_symbol; | |
1192 | expressionP->X_add_symbol = symbolP; | |
1193 | expressionP->X_add_number = 0; | |
1194 | ||
1195 | *input_line_pointer = c; | |
d02603dc | 1196 | SKIP_WHITESPACE_AFTER_NAME (); |
252b5132 RH |
1197 | if (*input_line_pointer != ')') |
1198 | as_bad (_("syntax error in .startof. or .sizeof.")); | |
1199 | else | |
1200 | ++input_line_pointer; | |
1201 | } | |
1202 | break; | |
1203 | } | |
1204 | else | |
1205 | { | |
1206 | goto isname; | |
1207 | } | |
b75c0c92 | 1208 | |
252b5132 | 1209 | case ',': |
252b5132 | 1210 | eol: |
929b12bc | 1211 | /* Can't imagine any other kind of operand. */ |
252b5132 RH |
1212 | expressionP->X_op = O_absent; |
1213 | input_line_pointer--; | |
1214 | break; | |
1215 | ||
abd63a32 | 1216 | #ifdef TC_M68K |
252b5132 RH |
1217 | case '%': |
1218 | if (! flag_m68k_mri) | |
1219 | goto de_fault; | |
1220 | integer_constant (2, expressionP); | |
1221 | break; | |
1222 | ||
1223 | case '@': | |
1224 | if (! flag_m68k_mri) | |
1225 | goto de_fault; | |
1226 | integer_constant (8, expressionP); | |
1227 | break; | |
1228 | ||
1229 | case ':': | |
1230 | if (! flag_m68k_mri) | |
1231 | goto de_fault; | |
1232 | ||
1233 | /* In MRI mode, this is a floating point constant represented | |
02000999 | 1234 | using hexadecimal digits. */ |
252b5132 RH |
1235 | |
1236 | ++input_line_pointer; | |
1237 | integer_constant (16, expressionP); | |
1238 | break; | |
1239 | ||
1240 | case '*': | |
1241 | if (! flag_m68k_mri || is_part_of_name (*input_line_pointer)) | |
1242 | goto de_fault; | |
1243 | ||
1244 | current_location (expressionP); | |
1245 | break; | |
abd63a32 | 1246 | #endif |
252b5132 RH |
1247 | |
1248 | default: | |
fcaed75e | 1249 | #if defined(md_need_index_operator) || defined(TC_M68K) |
252b5132 | 1250 | de_fault: |
abd63a32 | 1251 | #endif |
d02603dc | 1252 | if (is_name_beginner (c) || c == '"') /* Here if did not begin with a digit. */ |
252b5132 | 1253 | { |
929b12bc KH |
1254 | /* Identifier begins here. |
1255 | This is kludged for speed, so code is repeated. */ | |
252b5132 | 1256 | isname: |
d02603dc NC |
1257 | -- input_line_pointer; |
1258 | c = get_symbol_name (&name); | |
252b5132 | 1259 | |
fcaed75e JB |
1260 | #ifdef md_operator |
1261 | { | |
1e9cc1c2 | 1262 | operatorT op = md_operator (name, 1, &c); |
fcaed75e | 1263 | |
1e9cc1c2 | 1264 | switch (op) |
fcaed75e JB |
1265 | { |
1266 | case O_uminus: | |
d02603dc | 1267 | restore_line_pointer (c); |
fcaed75e JB |
1268 | c = '-'; |
1269 | goto unary; | |
1270 | case O_bit_not: | |
d02603dc | 1271 | restore_line_pointer (c); |
fcaed75e JB |
1272 | c = '~'; |
1273 | goto unary; | |
1274 | case O_logical_not: | |
d02603dc | 1275 | restore_line_pointer (c); |
fcaed75e JB |
1276 | c = '!'; |
1277 | goto unary; | |
1278 | case O_illegal: | |
1279 | as_bad (_("invalid use of operator \"%s\""), name); | |
1280 | break; | |
1281 | default: | |
1282 | break; | |
1283 | } | |
d02603dc | 1284 | |
1e9cc1c2 | 1285 | if (op != O_absent && op != O_illegal) |
fcaed75e | 1286 | { |
d02603dc | 1287 | restore_line_pointer (c); |
fcaed75e JB |
1288 | expr (9, expressionP, mode); |
1289 | expressionP->X_add_symbol = make_expr_symbol (expressionP); | |
1290 | expressionP->X_op_symbol = NULL; | |
1291 | expressionP->X_add_number = 0; | |
1e9cc1c2 | 1292 | expressionP->X_op = op; |
fcaed75e JB |
1293 | break; |
1294 | } | |
1295 | } | |
1296 | #endif | |
1297 | ||
252b5132 RH |
1298 | #ifdef md_parse_name |
1299 | /* This is a hook for the backend to parse certain names | |
02000999 AM |
1300 | specially in certain contexts. If a name always has a |
1301 | specific value, it can often be handled by simply | |
1302 | entering it in the symbol table. */ | |
9497f5ac | 1303 | if (md_parse_name (name, expressionP, mode, &c)) |
252b5132 | 1304 | { |
d02603dc | 1305 | restore_line_pointer (c); |
252b5132 RH |
1306 | break; |
1307 | } | |
1308 | #endif | |
1309 | ||
252b5132 RH |
1310 | symbolP = symbol_find_or_make (name); |
1311 | ||
1312 | /* If we have an absolute symbol or a reg, then we know its | |
1313 | value now. */ | |
1314 | segment = S_GET_SEGMENT (symbolP); | |
c969da64 RS |
1315 | if (mode != expr_defer |
1316 | && segment == absolute_section | |
1317 | && !S_FORCE_RELOC (symbolP, 0)) | |
252b5132 RH |
1318 | { |
1319 | expressionP->X_op = O_constant; | |
1320 | expressionP->X_add_number = S_GET_VALUE (symbolP); | |
1321 | } | |
9497f5ac | 1322 | else if (mode != expr_defer && segment == reg_section) |
252b5132 RH |
1323 | { |
1324 | expressionP->X_op = O_register; | |
1325 | expressionP->X_add_number = S_GET_VALUE (symbolP); | |
1326 | } | |
1327 | else | |
1328 | { | |
1329 | expressionP->X_op = O_symbol; | |
1330 | expressionP->X_add_symbol = symbolP; | |
1331 | expressionP->X_add_number = 0; | |
1332 | } | |
d02603dc NC |
1333 | |
1334 | restore_line_pointer (c); | |
252b5132 RH |
1335 | } |
1336 | else | |
1337 | { | |
1338 | /* Let the target try to parse it. Success is indicated by changing | |
1339 | the X_op field to something other than O_absent and pointing | |
927781e2 | 1340 | input_line_pointer past the expression. If it can't parse the |
252b5132 RH |
1341 | expression, X_op and input_line_pointer should be unchanged. */ |
1342 | expressionP->X_op = O_absent; | |
1343 | --input_line_pointer; | |
1344 | md_operand (expressionP); | |
1345 | if (expressionP->X_op == O_absent) | |
1346 | { | |
1347 | ++input_line_pointer; | |
0e389e77 | 1348 | as_bad (_("bad expression")); |
252b5132 RH |
1349 | expressionP->X_op = O_constant; |
1350 | expressionP->X_add_number = 0; | |
1351 | } | |
1352 | } | |
1353 | break; | |
1354 | } | |
1355 | ||
929b12bc KH |
1356 | /* It is more 'efficient' to clean up the expressionS when they are |
1357 | created. Doing it here saves lines of code. */ | |
252b5132 | 1358 | clean_up_expression (expressionP); |
14c1428b | 1359 | SKIP_ALL_WHITESPACE (); /* -> 1st char after operand. */ |
252b5132 RH |
1360 | know (*input_line_pointer != ' '); |
1361 | ||
1362 | /* The PA port needs this information. */ | |
1363 | if (expressionP->X_add_symbol) | |
49309057 | 1364 | symbol_mark_used (expressionP->X_add_symbol); |
252b5132 | 1365 | |
3df4e177 MR |
1366 | if (mode != expr_defer) |
1367 | { | |
1368 | expressionP->X_add_symbol | |
1369 | = symbol_clone_if_forward_ref (expressionP->X_add_symbol); | |
1370 | expressionP->X_op_symbol | |
1371 | = symbol_clone_if_forward_ref (expressionP->X_op_symbol); | |
1372 | } | |
9497f5ac | 1373 | |
252b5132 RH |
1374 | switch (expressionP->X_op) |
1375 | { | |
1376 | default: | |
1377 | return absolute_section; | |
1378 | case O_symbol: | |
1379 | return S_GET_SEGMENT (expressionP->X_add_symbol); | |
1380 | case O_register: | |
1381 | return reg_section; | |
1382 | } | |
929b12bc | 1383 | } |
252b5132 | 1384 | \f |
929b12bc KH |
1385 | /* Internal. Simplify a struct expression for use by expr (). */ |
1386 | ||
3b37fd66 | 1387 | /* In: address of an expressionS. |
929b12bc KH |
1388 | The X_op field of the expressionS may only take certain values. |
1389 | Elsewise we waste time special-case testing. Sigh. Ditto SEG_ABSENT. | |
1390 | ||
1391 | Out: expressionS may have been modified: | |
929b12bc | 1392 | Unused fields zeroed to help expr (). */ |
252b5132 RH |
1393 | |
1394 | static void | |
dd625418 | 1395 | clean_up_expression (expressionS *expressionP) |
252b5132 RH |
1396 | { |
1397 | switch (expressionP->X_op) | |
1398 | { | |
1399 | case O_illegal: | |
1400 | case O_absent: | |
1401 | expressionP->X_add_number = 0; | |
1402 | /* Fall through. */ | |
1403 | case O_big: | |
1404 | case O_constant: | |
1405 | case O_register: | |
1406 | expressionP->X_add_symbol = NULL; | |
1407 | /* Fall through. */ | |
1408 | case O_symbol: | |
1409 | case O_uminus: | |
1410 | case O_bit_not: | |
1411 | expressionP->X_op_symbol = NULL; | |
1412 | break; | |
252b5132 RH |
1413 | default: |
1414 | break; | |
1415 | } | |
1416 | } | |
1417 | \f | |
929b12bc KH |
1418 | /* Expression parser. */ |
1419 | ||
1420 | /* We allow an empty expression, and just assume (absolute,0) silently. | |
1421 | Unary operators and parenthetical expressions are treated as operands. | |
1422 | As usual, Q==quantity==operand, O==operator, X==expression mnemonics. | |
1423 | ||
3b37fd66 | 1424 | We used to do an aho/ullman shift-reduce parser, but the logic got so |
929b12bc KH |
1425 | warped that I flushed it and wrote a recursive-descent parser instead. |
1426 | Now things are stable, would anybody like to write a fast parser? | |
1427 | Most expressions are either register (which does not even reach here) | |
1428 | or 1 symbol. Then "symbol+constant" and "symbol-symbol" are common. | |
1429 | So I guess it doesn't really matter how inefficient more complex expressions | |
1430 | are parsed. | |
1431 | ||
1432 | After expr(RANK,resultP) input_line_pointer->operator of rank <= RANK. | |
1433 | Also, we have consumed any leading or trailing spaces (operand does that) | |
1434 | and done all intervening operators. | |
1435 | ||
1436 | This returns the segment of the result, which will be | |
1437 | absolute_section or the segment of a symbol. */ | |
252b5132 RH |
1438 | |
1439 | #undef __ | |
1440 | #define __ O_illegal | |
fb7ccfc1 AM |
1441 | #ifndef O_SINGLE_EQ |
1442 | #define O_SINGLE_EQ O_illegal | |
1443 | #endif | |
252b5132 | 1444 | |
b041f888 KH |
1445 | /* Maps ASCII -> operators. */ |
1446 | static const operatorT op_encoding[256] = { | |
252b5132 RH |
1447 | __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, |
1448 | __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, | |
1449 | ||
1450 | __, O_bit_or_not, __, __, __, O_modulus, O_bit_and, __, | |
1451 | __, __, O_multiply, O_add, __, O_subtract, __, O_divide, | |
1452 | __, __, __, __, __, __, __, __, | |
fb7ccfc1 | 1453 | __, __, __, __, O_lt, O_SINGLE_EQ, O_gt, __, |
252b5132 RH |
1454 | __, __, __, __, __, __, __, __, |
1455 | __, __, __, __, __, __, __, __, | |
1456 | __, __, __, __, __, __, __, __, | |
b585bc2c RH |
1457 | __, __, __, |
1458 | #ifdef NEED_INDEX_OPERATOR | |
1459 | O_index, | |
1460 | #else | |
1461 | __, | |
1462 | #endif | |
1463 | __, __, O_bit_exclusive_or, __, | |
252b5132 RH |
1464 | __, __, __, __, __, __, __, __, |
1465 | __, __, __, __, __, __, __, __, | |
1466 | __, __, __, __, __, __, __, __, | |
1467 | __, __, __, __, O_bit_inclusive_or, __, __, __, | |
1468 | ||
1469 | __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, | |
1470 | __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, | |
1471 | __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, | |
1472 | __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, | |
1473 | __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, | |
1474 | __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, | |
1475 | __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, | |
1476 | __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __ | |
1477 | }; | |
1478 | ||
929b12bc KH |
1479 | /* Rank Examples |
1480 | 0 operand, (expression) | |
1481 | 1 || | |
1482 | 2 && | |
07a7a145 | 1483 | 3 == <> < <= >= > |
929b12bc KH |
1484 | 4 + - |
1485 | 5 used for * / % in MRI mode | |
1486 | 6 & ^ ! | | |
1487 | 7 * / % << >> | |
1488 | 8 unary - unary ~ | |
1489 | */ | |
1035ad42 | 1490 | static operator_rankT op_rank[O_max] = { |
252b5132 RH |
1491 | 0, /* O_illegal */ |
1492 | 0, /* O_absent */ | |
1493 | 0, /* O_constant */ | |
1494 | 0, /* O_symbol */ | |
1495 | 0, /* O_symbol_rva */ | |
1496 | 0, /* O_register */ | |
16887944 | 1497 | 0, /* O_big */ |
b585bc2c RH |
1498 | 9, /* O_uminus */ |
1499 | 9, /* O_bit_not */ | |
1500 | 9, /* O_logical_not */ | |
1501 | 8, /* O_multiply */ | |
1502 | 8, /* O_divide */ | |
1503 | 8, /* O_modulus */ | |
1504 | 8, /* O_left_shift */ | |
1505 | 8, /* O_right_shift */ | |
1506 | 7, /* O_bit_inclusive_or */ | |
1507 | 7, /* O_bit_or_not */ | |
1508 | 7, /* O_bit_exclusive_or */ | |
1509 | 7, /* O_bit_and */ | |
1510 | 5, /* O_add */ | |
1511 | 5, /* O_subtract */ | |
1512 | 4, /* O_eq */ | |
1513 | 4, /* O_ne */ | |
1514 | 4, /* O_lt */ | |
1515 | 4, /* O_le */ | |
1516 | 4, /* O_ge */ | |
1517 | 4, /* O_gt */ | |
1518 | 3, /* O_logical_and */ | |
1519 | 2, /* O_logical_or */ | |
1520 | 1, /* O_index */ | |
252b5132 RH |
1521 | }; |
1522 | ||
1523 | /* Unfortunately, in MRI mode for the m68k, multiplication and | |
1524 | division have lower precedence than the bit wise operators. This | |
1525 | function sets the operator precedences correctly for the current | |
1526 | mode. Also, MRI uses a different bit_not operator, and this fixes | |
1527 | that as well. */ | |
1528 | ||
16887944 AM |
1529 | #define STANDARD_MUL_PRECEDENCE 8 |
1530 | #define MRI_MUL_PRECEDENCE 6 | |
252b5132 RH |
1531 | |
1532 | void | |
dd625418 | 1533 | expr_set_precedence (void) |
252b5132 RH |
1534 | { |
1535 | if (flag_m68k_mri) | |
1536 | { | |
1537 | op_rank[O_multiply] = MRI_MUL_PRECEDENCE; | |
1538 | op_rank[O_divide] = MRI_MUL_PRECEDENCE; | |
1539 | op_rank[O_modulus] = MRI_MUL_PRECEDENCE; | |
1540 | } | |
1541 | else | |
1542 | { | |
1543 | op_rank[O_multiply] = STANDARD_MUL_PRECEDENCE; | |
1544 | op_rank[O_divide] = STANDARD_MUL_PRECEDENCE; | |
1545 | op_rank[O_modulus] = STANDARD_MUL_PRECEDENCE; | |
1546 | } | |
1547 | } | |
1548 | ||
fcaed75e | 1549 | void |
1e9cc1c2 | 1550 | expr_set_rank (operatorT op, operator_rankT rank) |
fcaed75e | 1551 | { |
1e9cc1c2 NC |
1552 | gas_assert (op >= O_md1 && op < ARRAY_SIZE (op_rank)); |
1553 | op_rank[op] = rank; | |
fcaed75e JB |
1554 | } |
1555 | ||
252b5132 RH |
1556 | /* Initialize the expression parser. */ |
1557 | ||
1558 | void | |
dd625418 | 1559 | expr_begin (void) |
252b5132 RH |
1560 | { |
1561 | expr_set_precedence (); | |
1562 | ||
1563 | /* Verify that X_op field is wide enough. */ | |
1564 | { | |
1565 | expressionS e; | |
1566 | e.X_op = O_max; | |
9c2799c2 | 1567 | gas_assert (e.X_op == O_max); |
252b5132 RH |
1568 | } |
1569 | } | |
1570 | \f | |
6fad6acb AM |
1571 | /* Return the encoding for the operator at INPUT_LINE_POINTER, and |
1572 | sets NUM_CHARS to the number of characters in the operator. | |
1573 | Does not advance INPUT_LINE_POINTER. */ | |
252b5132 RH |
1574 | |
1575 | static inline operatorT | |
1e9cc1c2 | 1576 | operatorf (int *num_chars) |
252b5132 RH |
1577 | { |
1578 | int c; | |
1579 | operatorT ret; | |
1580 | ||
1581 | c = *input_line_pointer & 0xff; | |
6fad6acb | 1582 | *num_chars = 1; |
252b5132 | 1583 | |
b75c0c92 AM |
1584 | if (is_end_of_line[c]) |
1585 | return O_illegal; | |
1586 | ||
fcaed75e JB |
1587 | #ifdef md_operator |
1588 | if (is_name_beginner (c)) | |
1589 | { | |
d02603dc NC |
1590 | char *name; |
1591 | char ec = get_symbol_name (& name); | |
fcaed75e | 1592 | |
91d6fa6a | 1593 | ret = md_operator (name, 2, &ec); |
fcaed75e JB |
1594 | switch (ret) |
1595 | { | |
1596 | case O_absent: | |
91d6fa6a | 1597 | *input_line_pointer = ec; |
fcaed75e JB |
1598 | input_line_pointer = name; |
1599 | break; | |
1600 | case O_uminus: | |
1601 | case O_bit_not: | |
1602 | case O_logical_not: | |
1603 | as_bad (_("invalid use of operator \"%s\""), name); | |
1604 | ret = O_illegal; | |
1605 | /* FALLTHROUGH */ | |
1606 | default: | |
91d6fa6a | 1607 | *input_line_pointer = ec; |
fcaed75e JB |
1608 | *num_chars = input_line_pointer - name; |
1609 | input_line_pointer = name; | |
1610 | return ret; | |
1611 | } | |
1612 | } | |
1613 | #endif | |
1614 | ||
252b5132 RH |
1615 | switch (c) |
1616 | { | |
1617 | default: | |
fcaed75e JB |
1618 | ret = op_encoding[c]; |
1619 | #ifdef md_operator | |
1620 | if (ret == O_illegal) | |
1621 | { | |
1622 | char *start = input_line_pointer; | |
1623 | ||
1624 | ret = md_operator (NULL, 2, NULL); | |
1625 | if (ret != O_illegal) | |
1626 | *num_chars = input_line_pointer - start; | |
1627 | input_line_pointer = start; | |
1628 | } | |
1629 | #endif | |
1630 | return ret; | |
252b5132 | 1631 | |
3e4caed2 NS |
1632 | case '+': |
1633 | case '-': | |
8c9f705e | 1634 | return op_encoding[c]; |
3e4caed2 | 1635 | |
252b5132 RH |
1636 | case '<': |
1637 | switch (input_line_pointer[1]) | |
1638 | { | |
1639 | default: | |
1640 | return op_encoding[c]; | |
1641 | case '<': | |
1642 | ret = O_left_shift; | |
1643 | break; | |
1644 | case '>': | |
1645 | ret = O_ne; | |
1646 | break; | |
1647 | case '=': | |
1648 | ret = O_le; | |
1649 | break; | |
1650 | } | |
6fad6acb | 1651 | *num_chars = 2; |
252b5132 RH |
1652 | return ret; |
1653 | ||
1654 | case '=': | |
1655 | if (input_line_pointer[1] != '=') | |
1656 | return op_encoding[c]; | |
1657 | ||
6fad6acb | 1658 | *num_chars = 2; |
252b5132 RH |
1659 | return O_eq; |
1660 | ||
1661 | case '>': | |
1662 | switch (input_line_pointer[1]) | |
1663 | { | |
1664 | default: | |
1665 | return op_encoding[c]; | |
1666 | case '>': | |
1667 | ret = O_right_shift; | |
1668 | break; | |
1669 | case '=': | |
1670 | ret = O_ge; | |
1671 | break; | |
1672 | } | |
6fad6acb | 1673 | *num_chars = 2; |
252b5132 RH |
1674 | return ret; |
1675 | ||
1676 | case '!': | |
723a8472 | 1677 | switch (input_line_pointer[1]) |
252b5132 | 1678 | { |
723a8472 NC |
1679 | case '!': |
1680 | /* We accept !! as equivalent to ^ for MRI compatibility. */ | |
1681 | *num_chars = 2; | |
1682 | return O_bit_exclusive_or; | |
1683 | case '=': | |
1684 | /* We accept != as equivalent to <>. */ | |
1685 | *num_chars = 2; | |
1686 | return O_ne; | |
1687 | default: | |
252b5132 RH |
1688 | if (flag_m68k_mri) |
1689 | return O_bit_inclusive_or; | |
1690 | return op_encoding[c]; | |
1691 | } | |
252b5132 RH |
1692 | |
1693 | case '|': | |
1694 | if (input_line_pointer[1] != '|') | |
1695 | return op_encoding[c]; | |
1696 | ||
6fad6acb | 1697 | *num_chars = 2; |
252b5132 RH |
1698 | return O_logical_or; |
1699 | ||
1700 | case '&': | |
1701 | if (input_line_pointer[1] != '&') | |
1702 | return op_encoding[c]; | |
1703 | ||
6fad6acb | 1704 | *num_chars = 2; |
252b5132 RH |
1705 | return O_logical_and; |
1706 | } | |
1707 | ||
929b12bc | 1708 | /* NOTREACHED */ |
252b5132 RH |
1709 | } |
1710 | ||
956a6ba3 JB |
1711 | /* Implement "word-size + 1 bit" addition for |
1712 | {resultP->X_extrabit:resultP->X_add_number} + {rhs_highbit:amount}. This | |
1713 | is used so that the full range of unsigned word values and the full range of | |
1714 | signed word values can be represented in an O_constant expression, which is | |
1715 | useful e.g. for .sleb128 directives. */ | |
1716 | ||
4455e9ad | 1717 | void |
956a6ba3 JB |
1718 | add_to_result (expressionS *resultP, offsetT amount, int rhs_highbit) |
1719 | { | |
1720 | valueT ures = resultP->X_add_number; | |
1721 | valueT uamount = amount; | |
1722 | ||
c77a6ef6 | 1723 | resultP->X_add_number += uamount; |
956a6ba3 JB |
1724 | |
1725 | resultP->X_extrabit ^= rhs_highbit; | |
1726 | ||
1727 | if (ures + uamount < ures) | |
1728 | resultP->X_extrabit ^= 1; | |
1729 | } | |
1730 | ||
1731 | /* Similarly, for subtraction. */ | |
1732 | ||
4455e9ad | 1733 | void |
956a6ba3 JB |
1734 | subtract_from_result (expressionS *resultP, offsetT amount, int rhs_highbit) |
1735 | { | |
1736 | valueT ures = resultP->X_add_number; | |
1737 | valueT uamount = amount; | |
1738 | ||
c77a6ef6 | 1739 | resultP->X_add_number -= uamount; |
956a6ba3 JB |
1740 | |
1741 | resultP->X_extrabit ^= rhs_highbit; | |
1742 | ||
1743 | if (ures < uamount) | |
1744 | resultP->X_extrabit ^= 1; | |
1745 | } | |
1746 | ||
252b5132 RH |
1747 | /* Parse an expression. */ |
1748 | ||
1749 | segT | |
dd625418 | 1750 | expr (int rankarg, /* Larger # is higher rank. */ |
9497f5ac NC |
1751 | expressionS *resultP, /* Deliver result here. */ |
1752 | enum expr_mode mode /* Controls behavior. */) | |
252b5132 | 1753 | { |
0561a208 | 1754 | operator_rankT rank = (operator_rankT) rankarg; |
252b5132 RH |
1755 | segT retval; |
1756 | expressionS right; | |
1757 | operatorT op_left; | |
1758 | operatorT op_right; | |
6fad6acb | 1759 | int op_chars; |
252b5132 | 1760 | |
db557034 | 1761 | know (rankarg >= 0); |
252b5132 | 1762 | |
26346241 AM |
1763 | /* Save the value of dot for the fixup code. */ |
1764 | if (rank == 0) | |
8e723a10 CLT |
1765 | { |
1766 | dot_value = frag_now_fix (); | |
1767 | dot_frag = frag_now; | |
1768 | } | |
26346241 | 1769 | |
9497f5ac | 1770 | retval = operand (resultP, mode); |
252b5132 | 1771 | |
929b12bc KH |
1772 | /* operand () gobbles spaces. */ |
1773 | know (*input_line_pointer != ' '); | |
252b5132 | 1774 | |
1e9cc1c2 | 1775 | op_left = operatorf (&op_chars); |
252b5132 RH |
1776 | while (op_left != O_illegal && op_rank[(int) op_left] > rank) |
1777 | { | |
1778 | segT rightseg; | |
08ea7020 | 1779 | offsetT frag_off; |
252b5132 | 1780 | |
6fad6acb | 1781 | input_line_pointer += op_chars; /* -> after operator. */ |
252b5132 | 1782 | |
34a7d6c6 | 1783 | right.X_md = 0; |
9497f5ac | 1784 | rightseg = expr (op_rank[(int) op_left], &right, mode); |
252b5132 RH |
1785 | if (right.X_op == O_absent) |
1786 | { | |
1787 | as_warn (_("missing operand; zero assumed")); | |
1788 | right.X_op = O_constant; | |
1789 | right.X_add_number = 0; | |
1790 | right.X_add_symbol = NULL; | |
1791 | right.X_op_symbol = NULL; | |
1792 | } | |
1793 | ||
1794 | know (*input_line_pointer != ' '); | |
1795 | ||
b585bc2c RH |
1796 | if (op_left == O_index) |
1797 | { | |
1798 | if (*input_line_pointer != ']') | |
1799 | as_bad ("missing right bracket"); | |
1800 | else | |
1801 | { | |
1802 | ++input_line_pointer; | |
1803 | SKIP_WHITESPACE (); | |
1804 | } | |
1805 | } | |
1806 | ||
1e9cc1c2 | 1807 | op_right = operatorf (&op_chars); |
252b5132 | 1808 | |
fcaed75e | 1809 | know (op_right == O_illegal || op_left == O_index |
929b12bc | 1810 | || op_rank[(int) op_right] <= op_rank[(int) op_left]); |
fcaed75e JB |
1811 | know ((int) op_left >= (int) O_multiply); |
1812 | #ifndef md_operator | |
1813 | know ((int) op_left <= (int) O_index); | |
1814 | #else | |
1815 | know ((int) op_left < (int) O_max); | |
1816 | #endif | |
252b5132 | 1817 | |
929b12bc KH |
1818 | /* input_line_pointer->after right-hand quantity. */ |
1819 | /* left-hand quantity in resultP. */ | |
1820 | /* right-hand quantity in right. */ | |
1821 | /* operator in op_left. */ | |
252b5132 RH |
1822 | |
1823 | if (resultP->X_op == O_big) | |
1824 | { | |
1825 | if (resultP->X_add_number > 0) | |
1826 | as_warn (_("left operand is a bignum; integer 0 assumed")); | |
1827 | else | |
1828 | as_warn (_("left operand is a float; integer 0 assumed")); | |
1829 | resultP->X_op = O_constant; | |
1830 | resultP->X_add_number = 0; | |
1831 | resultP->X_add_symbol = NULL; | |
1832 | resultP->X_op_symbol = NULL; | |
1833 | } | |
1834 | if (right.X_op == O_big) | |
1835 | { | |
1836 | if (right.X_add_number > 0) | |
1837 | as_warn (_("right operand is a bignum; integer 0 assumed")); | |
1838 | else | |
1839 | as_warn (_("right operand is a float; integer 0 assumed")); | |
1840 | right.X_op = O_constant; | |
1841 | right.X_add_number = 0; | |
1842 | right.X_add_symbol = NULL; | |
1843 | right.X_op_symbol = NULL; | |
1844 | } | |
1845 | ||
e4c2619a AM |
1846 | if (mode == expr_defer |
1847 | && ((resultP->X_add_symbol != NULL | |
1848 | && S_IS_FORWARD_REF (resultP->X_add_symbol)) | |
1849 | || (right.X_add_symbol != NULL | |
1850 | && S_IS_FORWARD_REF (right.X_add_symbol)))) | |
1851 | goto general; | |
1852 | ||
252b5132 | 1853 | /* Optimize common cases. */ |
800eeca4 JW |
1854 | #ifdef md_optimize_expr |
1855 | if (md_optimize_expr (resultP, op_left, &right)) | |
1856 | { | |
929b12bc KH |
1857 | /* Skip. */ |
1858 | ; | |
800eeca4 JW |
1859 | } |
1860 | else | |
1861 | #endif | |
5a918ce7 JB |
1862 | #ifndef md_register_arithmetic |
1863 | # define md_register_arithmetic 1 | |
1864 | #endif | |
1865 | if (op_left == O_add && right.X_op == O_constant | |
1866 | && (md_register_arithmetic || resultP->X_op != O_register)) | |
252b5132 RH |
1867 | { |
1868 | /* X + constant. */ | |
956a6ba3 | 1869 | add_to_result (resultP, right.X_add_number, right.X_extrabit); |
252b5132 RH |
1870 | } |
1871 | /* This case comes up in PIC code. */ | |
1872 | else if (op_left == O_subtract | |
1873 | && right.X_op == O_symbol | |
1874 | && resultP->X_op == O_symbol | |
99630778 | 1875 | && retval == rightseg |
bfff1642 NC |
1876 | #ifdef md_allow_local_subtract |
1877 | && md_allow_local_subtract (resultP, & right, rightseg) | |
1878 | #endif | |
c969da64 RS |
1879 | && ((SEG_NORMAL (rightseg) |
1880 | && !S_FORCE_RELOC (resultP->X_add_symbol, 0) | |
1881 | && !S_FORCE_RELOC (right.X_add_symbol, 0)) | |
99630778 AM |
1882 | || right.X_add_symbol == resultP->X_add_symbol) |
1883 | && frag_offset_fixed_p (symbol_get_frag (resultP->X_add_symbol), | |
1884 | symbol_get_frag (right.X_add_symbol), | |
1885 | &frag_off)) | |
252b5132 | 1886 | { |
956a6ba3 JB |
1887 | offsetT symval_diff = S_GET_VALUE (resultP->X_add_symbol) |
1888 | - S_GET_VALUE (right.X_add_symbol); | |
1889 | subtract_from_result (resultP, right.X_add_number, right.X_extrabit); | |
1890 | subtract_from_result (resultP, frag_off / OCTETS_PER_BYTE, 0); | |
1891 | add_to_result (resultP, symval_diff, symval_diff < 0); | |
252b5132 RH |
1892 | resultP->X_op = O_constant; |
1893 | resultP->X_add_symbol = 0; | |
1894 | } | |
5a918ce7 JB |
1895 | else if (op_left == O_subtract && right.X_op == O_constant |
1896 | && (md_register_arithmetic || resultP->X_op != O_register)) | |
252b5132 RH |
1897 | { |
1898 | /* X - constant. */ | |
956a6ba3 | 1899 | subtract_from_result (resultP, right.X_add_number, right.X_extrabit); |
252b5132 | 1900 | } |
5a918ce7 JB |
1901 | else if (op_left == O_add && resultP->X_op == O_constant |
1902 | && (md_register_arithmetic || right.X_op != O_register)) | |
252b5132 RH |
1903 | { |
1904 | /* Constant + X. */ | |
1905 | resultP->X_op = right.X_op; | |
1906 | resultP->X_add_symbol = right.X_add_symbol; | |
1907 | resultP->X_op_symbol = right.X_op_symbol; | |
956a6ba3 | 1908 | add_to_result (resultP, right.X_add_number, right.X_extrabit); |
252b5132 RH |
1909 | retval = rightseg; |
1910 | } | |
1911 | else if (resultP->X_op == O_constant && right.X_op == O_constant) | |
1912 | { | |
1913 | /* Constant OP constant. */ | |
1914 | offsetT v = right.X_add_number; | |
1915 | if (v == 0 && (op_left == O_divide || op_left == O_modulus)) | |
1916 | { | |
1917 | as_warn (_("division by zero")); | |
1918 | v = 1; | |
1919 | } | |
d85733c8 JB |
1920 | if ((valueT) v >= sizeof(valueT) * CHAR_BIT |
1921 | && (op_left == O_left_shift || op_left == O_right_shift)) | |
1922 | { | |
1923 | as_warn_value_out_of_range (_("shift count"), v, 0, | |
1924 | sizeof(valueT) * CHAR_BIT - 1, | |
1925 | NULL, 0); | |
1926 | resultP->X_add_number = v = 0; | |
1927 | } | |
252b5132 RH |
1928 | switch (op_left) |
1929 | { | |
fcaed75e | 1930 | default: goto general; |
252b5132 RH |
1931 | case O_multiply: resultP->X_add_number *= v; break; |
1932 | case O_divide: resultP->X_add_number /= v; break; | |
1933 | case O_modulus: resultP->X_add_number %= v; break; | |
b2f386b9 AM |
1934 | case O_left_shift: |
1935 | /* We always use unsigned shifts. According to the ISO | |
1936 | C standard, left shift of a signed type having a | |
1937 | negative value is undefined behaviour, and right | |
1938 | shift of a signed type having negative value is | |
1939 | implementation defined. Left shift of a signed type | |
1940 | when the result overflows is also undefined | |
1941 | behaviour. So don't trigger ubsan warnings or rely | |
1942 | on characteristics of the compiler. */ | |
1943 | resultP->X_add_number | |
1944 | = (valueT) resultP->X_add_number << (valueT) v; | |
1945 | break; | |
252b5132 | 1946 | case O_right_shift: |
b2f386b9 AM |
1947 | resultP->X_add_number |
1948 | = (valueT) resultP->X_add_number >> (valueT) v; | |
252b5132 RH |
1949 | break; |
1950 | case O_bit_inclusive_or: resultP->X_add_number |= v; break; | |
1951 | case O_bit_or_not: resultP->X_add_number |= ~v; break; | |
1952 | case O_bit_exclusive_or: resultP->X_add_number ^= v; break; | |
1953 | case O_bit_and: resultP->X_add_number &= v; break; | |
7b383517 BE |
1954 | /* Constant + constant (O_add) is handled by the |
1955 | previous if statement for constant + X, so is omitted | |
1956 | here. */ | |
956a6ba3 JB |
1957 | case O_subtract: |
1958 | subtract_from_result (resultP, v, 0); | |
1959 | break; | |
252b5132 RH |
1960 | case O_eq: |
1961 | resultP->X_add_number = | |
958b5f01 | 1962 | resultP->X_add_number == v ? ~ (offsetT) 0 : 0; |
252b5132 RH |
1963 | break; |
1964 | case O_ne: | |
1965 | resultP->X_add_number = | |
958b5f01 | 1966 | resultP->X_add_number != v ? ~ (offsetT) 0 : 0; |
252b5132 RH |
1967 | break; |
1968 | case O_lt: | |
1969 | resultP->X_add_number = | |
958b5f01 | 1970 | resultP->X_add_number < v ? ~ (offsetT) 0 : 0; |
252b5132 RH |
1971 | break; |
1972 | case O_le: | |
1973 | resultP->X_add_number = | |
958b5f01 | 1974 | resultP->X_add_number <= v ? ~ (offsetT) 0 : 0; |
252b5132 RH |
1975 | break; |
1976 | case O_ge: | |
1977 | resultP->X_add_number = | |
958b5f01 | 1978 | resultP->X_add_number >= v ? ~ (offsetT) 0 : 0; |
252b5132 RH |
1979 | break; |
1980 | case O_gt: | |
1981 | resultP->X_add_number = | |
958b5f01 | 1982 | resultP->X_add_number > v ? ~ (offsetT) 0 : 0; |
252b5132 RH |
1983 | break; |
1984 | case O_logical_and: | |
1985 | resultP->X_add_number = resultP->X_add_number && v; | |
1986 | break; | |
1987 | case O_logical_or: | |
1988 | resultP->X_add_number = resultP->X_add_number || v; | |
1989 | break; | |
1990 | } | |
1991 | } | |
1992 | else if (resultP->X_op == O_symbol | |
1993 | && right.X_op == O_symbol | |
1994 | && (op_left == O_add | |
1995 | || op_left == O_subtract | |
1996 | || (resultP->X_add_number == 0 | |
1997 | && right.X_add_number == 0))) | |
1998 | { | |
1999 | /* Symbol OP symbol. */ | |
2000 | resultP->X_op = op_left; | |
2001 | resultP->X_op_symbol = right.X_add_symbol; | |
2002 | if (op_left == O_add) | |
956a6ba3 | 2003 | add_to_result (resultP, right.X_add_number, right.X_extrabit); |
252b5132 | 2004 | else if (op_left == O_subtract) |
e0890092 | 2005 | { |
956a6ba3 JB |
2006 | subtract_from_result (resultP, right.X_add_number, |
2007 | right.X_extrabit); | |
c969da64 RS |
2008 | if (retval == rightseg |
2009 | && SEG_NORMAL (retval) | |
2010 | && !S_FORCE_RELOC (resultP->X_add_symbol, 0) | |
2011 | && !S_FORCE_RELOC (right.X_add_symbol, 0)) | |
e0890092 AM |
2012 | { |
2013 | retval = absolute_section; | |
2014 | rightseg = absolute_section; | |
2015 | } | |
2016 | } | |
252b5132 RH |
2017 | } |
2018 | else | |
2019 | { | |
fcaed75e | 2020 | general: |
252b5132 RH |
2021 | /* The general case. */ |
2022 | resultP->X_add_symbol = make_expr_symbol (resultP); | |
2023 | resultP->X_op_symbol = make_expr_symbol (&right); | |
2024 | resultP->X_op = op_left; | |
2025 | resultP->X_add_number = 0; | |
2026 | resultP->X_unsigned = 1; | |
956a6ba3 | 2027 | resultP->X_extrabit = 0; |
252b5132 RH |
2028 | } |
2029 | ||
e0890092 AM |
2030 | if (retval != rightseg) |
2031 | { | |
1e0f6894 AM |
2032 | if (retval == undefined_section) |
2033 | ; | |
2034 | else if (rightseg == undefined_section) | |
2035 | retval = rightseg; | |
2036 | else if (retval == expr_section) | |
2037 | ; | |
2038 | else if (rightseg == expr_section) | |
2039 | retval = rightseg; | |
2040 | else if (retval == reg_section) | |
2041 | ; | |
2042 | else if (rightseg == reg_section) | |
2043 | retval = rightseg; | |
2044 | else if (rightseg == absolute_section) | |
2045 | ; | |
2046 | else if (retval == absolute_section) | |
2047 | retval = rightseg; | |
e0890092 | 2048 | #ifdef DIFF_EXPR_OK |
1e0f6894 AM |
2049 | else if (op_left == O_subtract) |
2050 | ; | |
e0890092 | 2051 | #endif |
1e0f6894 | 2052 | else |
e0890092 AM |
2053 | as_bad (_("operation combines symbols in different segments")); |
2054 | } | |
2055 | ||
252b5132 | 2056 | op_left = op_right; |
929b12bc | 2057 | } /* While next operator is >= this rank. */ |
252b5132 RH |
2058 | |
2059 | /* The PA port needs this information. */ | |
2060 | if (resultP->X_add_symbol) | |
49309057 | 2061 | symbol_mark_used (resultP->X_add_symbol); |
252b5132 | 2062 | |
9497f5ac NC |
2063 | if (rank == 0 && mode == expr_evaluate) |
2064 | resolve_expression (resultP); | |
2065 | ||
252b5132 RH |
2066 | return resultP->X_op == O_constant ? absolute_section : retval; |
2067 | } | |
9497f5ac NC |
2068 | |
2069 | /* Resolve an expression without changing any symbols/sub-expressions | |
2070 | used. */ | |
2071 | ||
2072 | int | |
2073 | resolve_expression (expressionS *expressionP) | |
2074 | { | |
2075 | /* Help out with CSE. */ | |
2076 | valueT final_val = expressionP->X_add_number; | |
2077 | symbolS *add_symbol = expressionP->X_add_symbol; | |
14610ad1 | 2078 | symbolS *orig_add_symbol = add_symbol; |
9497f5ac NC |
2079 | symbolS *op_symbol = expressionP->X_op_symbol; |
2080 | operatorT op = expressionP->X_op; | |
2081 | valueT left, right; | |
2082 | segT seg_left, seg_right; | |
2083 | fragS *frag_left, *frag_right; | |
08ea7020 | 2084 | offsetT frag_off; |
9497f5ac NC |
2085 | |
2086 | switch (op) | |
2087 | { | |
2088 | default: | |
2089 | return 0; | |
2090 | ||
2091 | case O_constant: | |
2092 | case O_register: | |
2093 | left = 0; | |
2094 | break; | |
2095 | ||
2096 | case O_symbol: | |
2097 | case O_symbol_rva: | |
2e1e12b1 | 2098 | if (!snapshot_symbol (&add_symbol, &left, &seg_left, &frag_left)) |
9497f5ac NC |
2099 | return 0; |
2100 | ||
2101 | break; | |
2102 | ||
2103 | case O_uminus: | |
2104 | case O_bit_not: | |
2105 | case O_logical_not: | |
2e1e12b1 | 2106 | if (!snapshot_symbol (&add_symbol, &left, &seg_left, &frag_left)) |
9497f5ac NC |
2107 | return 0; |
2108 | ||
2109 | if (seg_left != absolute_section) | |
2110 | return 0; | |
2111 | ||
2112 | if (op == O_logical_not) | |
2113 | left = !left; | |
2114 | else if (op == O_uminus) | |
2115 | left = -left; | |
2116 | else | |
2117 | left = ~left; | |
2118 | op = O_constant; | |
2119 | break; | |
2120 | ||
2121 | case O_multiply: | |
2122 | case O_divide: | |
2123 | case O_modulus: | |
2124 | case O_left_shift: | |
2125 | case O_right_shift: | |
2126 | case O_bit_inclusive_or: | |
2127 | case O_bit_or_not: | |
2128 | case O_bit_exclusive_or: | |
2129 | case O_bit_and: | |
2130 | case O_add: | |
2131 | case O_subtract: | |
2132 | case O_eq: | |
2133 | case O_ne: | |
2134 | case O_lt: | |
2135 | case O_le: | |
2136 | case O_ge: | |
2137 | case O_gt: | |
2138 | case O_logical_and: | |
2139 | case O_logical_or: | |
2e1e12b1 JB |
2140 | if (!snapshot_symbol (&add_symbol, &left, &seg_left, &frag_left) |
2141 | || !snapshot_symbol (&op_symbol, &right, &seg_right, &frag_right)) | |
9497f5ac NC |
2142 | return 0; |
2143 | ||
2144 | /* Simplify addition or subtraction of a constant by folding the | |
2145 | constant into X_add_number. */ | |
2146 | if (op == O_add) | |
2147 | { | |
2148 | if (seg_right == absolute_section) | |
2149 | { | |
2150 | final_val += right; | |
2151 | op = O_symbol; | |
2152 | break; | |
2153 | } | |
2154 | else if (seg_left == absolute_section) | |
2155 | { | |
2156 | final_val += left; | |
2157 | left = right; | |
2158 | seg_left = seg_right; | |
2e1e12b1 | 2159 | add_symbol = op_symbol; |
14610ad1 | 2160 | orig_add_symbol = expressionP->X_op_symbol; |
9497f5ac NC |
2161 | op = O_symbol; |
2162 | break; | |
2163 | } | |
2164 | } | |
2165 | else if (op == O_subtract) | |
2166 | { | |
2167 | if (seg_right == absolute_section) | |
2168 | { | |
2169 | final_val -= right; | |
2170 | op = O_symbol; | |
2171 | break; | |
2172 | } | |
2173 | } | |
2174 | ||
2175 | /* Equality and non-equality tests are permitted on anything. | |
2176 | Subtraction, and other comparison operators are permitted if | |
2e1e12b1 JB |
2177 | both operands are in the same section. |
2178 | Shifts by constant zero are permitted on anything. | |
2179 | Multiplies, bit-ors, and bit-ands with constant zero are | |
2180 | permitted on anything. | |
2181 | Multiplies and divides by constant one are permitted on | |
2182 | anything. | |
2183 | Binary operations with both operands being the same register | |
2184 | or undefined symbol are permitted if the result doesn't depend | |
2185 | on the input value. | |
2186 | Otherwise, both operands must be absolute. We already handled | |
2187 | the case of addition or subtraction of a constant above. */ | |
99630778 | 2188 | frag_off = 0; |
9497f5ac NC |
2189 | if (!(seg_left == absolute_section |
2190 | && seg_right == absolute_section) | |
2191 | && !(op == O_eq || op == O_ne) | |
2192 | && !((op == O_subtract | |
2193 | || op == O_lt || op == O_le || op == O_ge || op == O_gt) | |
2194 | && seg_left == seg_right | |
99630778 | 2195 | && (finalize_syms |
38c3873e AO |
2196 | || frag_offset_fixed_p (frag_left, frag_right, &frag_off) |
2197 | || (op == O_gt | |
2198 | && frag_gtoffset_p (left, frag_left, | |
2199 | right, frag_right, &frag_off))) | |
2e1e12b1 JB |
2200 | && (seg_left != reg_section || left == right) |
2201 | && (seg_left != undefined_section || add_symbol == op_symbol))) | |
2202 | { | |
2203 | if ((seg_left == absolute_section && left == 0) | |
2204 | || (seg_right == absolute_section && right == 0)) | |
2205 | { | |
2206 | if (op == O_bit_exclusive_or || op == O_bit_inclusive_or) | |
2207 | { | |
14610ad1 | 2208 | if (!(seg_right == absolute_section && right == 0)) |
2e1e12b1 JB |
2209 | { |
2210 | seg_left = seg_right; | |
2211 | left = right; | |
2212 | add_symbol = op_symbol; | |
14610ad1 | 2213 | orig_add_symbol = expressionP->X_op_symbol; |
2e1e12b1 JB |
2214 | } |
2215 | op = O_symbol; | |
2216 | break; | |
2217 | } | |
2218 | else if (op == O_left_shift || op == O_right_shift) | |
2219 | { | |
14610ad1 | 2220 | if (!(seg_left == absolute_section && left == 0)) |
2e1e12b1 JB |
2221 | { |
2222 | op = O_symbol; | |
2223 | break; | |
2224 | } | |
2225 | } | |
2226 | else if (op != O_multiply | |
2227 | && op != O_bit_or_not && op != O_bit_and) | |
2228 | return 0; | |
2229 | } | |
2230 | else if (op == O_multiply | |
2231 | && seg_left == absolute_section && left == 1) | |
2232 | { | |
2233 | seg_left = seg_right; | |
2234 | left = right; | |
2235 | add_symbol = op_symbol; | |
14610ad1 | 2236 | orig_add_symbol = expressionP->X_op_symbol; |
2e1e12b1 JB |
2237 | op = O_symbol; |
2238 | break; | |
2239 | } | |
2240 | else if ((op == O_multiply || op == O_divide) | |
2241 | && seg_right == absolute_section && right == 1) | |
2242 | { | |
2243 | op = O_symbol; | |
2244 | break; | |
2245 | } | |
14610ad1 AM |
2246 | else if (!(left == right |
2247 | && ((seg_left == reg_section && seg_right == reg_section) | |
2248 | || (seg_left == undefined_section | |
2249 | && seg_right == undefined_section | |
2250 | && add_symbol == op_symbol)))) | |
2e1e12b1 JB |
2251 | return 0; |
2252 | else if (op == O_bit_and || op == O_bit_inclusive_or) | |
2253 | { | |
2254 | op = O_symbol; | |
2255 | break; | |
2256 | } | |
2257 | else if (op != O_bit_exclusive_or && op != O_bit_or_not) | |
2258 | return 0; | |
2259 | } | |
9497f5ac | 2260 | |
99630778 | 2261 | right += frag_off / OCTETS_PER_BYTE; |
9497f5ac NC |
2262 | switch (op) |
2263 | { | |
2264 | case O_add: left += right; break; | |
2265 | case O_subtract: left -= right; break; | |
2266 | case O_multiply: left *= right; break; | |
2267 | case O_divide: | |
2268 | if (right == 0) | |
2269 | return 0; | |
2270 | left = (offsetT) left / (offsetT) right; | |
2271 | break; | |
2272 | case O_modulus: | |
2273 | if (right == 0) | |
2274 | return 0; | |
2275 | left = (offsetT) left % (offsetT) right; | |
2276 | break; | |
2277 | case O_left_shift: left <<= right; break; | |
2278 | case O_right_shift: left >>= right; break; | |
2279 | case O_bit_inclusive_or: left |= right; break; | |
2280 | case O_bit_or_not: left |= ~right; break; | |
2281 | case O_bit_exclusive_or: left ^= right; break; | |
2282 | case O_bit_and: left &= right; break; | |
2283 | case O_eq: | |
2284 | case O_ne: | |
2285 | left = (left == right | |
2286 | && seg_left == seg_right | |
2287 | && (finalize_syms || frag_left == frag_right) | |
2e1e12b1 | 2288 | && (seg_left != undefined_section |
9497f5ac NC |
2289 | || add_symbol == op_symbol) |
2290 | ? ~ (valueT) 0 : 0); | |
2291 | if (op == O_ne) | |
2292 | left = ~left; | |
2293 | break; | |
2294 | case O_lt: | |
2295 | left = (offsetT) left < (offsetT) right ? ~ (valueT) 0 : 0; | |
2296 | break; | |
2297 | case O_le: | |
2298 | left = (offsetT) left <= (offsetT) right ? ~ (valueT) 0 : 0; | |
2299 | break; | |
2300 | case O_ge: | |
2301 | left = (offsetT) left >= (offsetT) right ? ~ (valueT) 0 : 0; | |
2302 | break; | |
2303 | case O_gt: | |
2304 | left = (offsetT) left > (offsetT) right ? ~ (valueT) 0 : 0; | |
2305 | break; | |
2306 | case O_logical_and: left = left && right; break; | |
2307 | case O_logical_or: left = left || right; break; | |
2308 | default: abort (); | |
2309 | } | |
2310 | ||
2311 | op = O_constant; | |
2312 | break; | |
2313 | } | |
2314 | ||
2315 | if (op == O_symbol) | |
2316 | { | |
2317 | if (seg_left == absolute_section) | |
2318 | op = O_constant; | |
2319 | else if (seg_left == reg_section && final_val == 0) | |
2320 | op = O_register; | |
087d837e | 2321 | else if (!symbol_same_p (add_symbol, orig_add_symbol)) |
2e1e12b1 JB |
2322 | final_val += left; |
2323 | expressionP->X_add_symbol = add_symbol; | |
9497f5ac NC |
2324 | } |
2325 | expressionP->X_op = op; | |
2326 | ||
2327 | if (op == O_constant || op == O_register) | |
2328 | final_val += left; | |
2329 | expressionP->X_add_number = final_val; | |
2330 | ||
2331 | return 1; | |
2332 | } | |
252b5132 | 2333 | \f |
929b12bc KH |
2334 | /* This lives here because it belongs equally in expr.c & read.c. |
2335 | expr.c is just a branch office read.c anyway, and putting it | |
2336 | here lessens the crowd at read.c. | |
2337 | ||
d02603dc NC |
2338 | Assume input_line_pointer is at start of symbol name, or the |
2339 | start of a double quote enclosed symbol name. | |
929b12bc | 2340 | Advance input_line_pointer past symbol name. |
d02603dc NC |
2341 | Turn that character into a '\0', returning its former value, |
2342 | which may be the closing double quote. | |
929b12bc | 2343 | This allows a string compare (RMS wants symbol names to be strings) |
d02603dc | 2344 | of the symbol name. |
929b12bc KH |
2345 | There will always be a char following symbol name, because all good |
2346 | lines end in end-of-line. */ | |
2347 | ||
252b5132 | 2348 | char |
d02603dc | 2349 | get_symbol_name (char ** ilp_return) |
252b5132 RH |
2350 | { |
2351 | char c; | |
2352 | ||
d02603dc | 2353 | * ilp_return = input_line_pointer; |
2469b3c5 | 2354 | /* We accept FAKE_LABEL_CHAR in a name in case this is being called with a |
252b5132 | 2355 | constructed string. */ |
2469b3c5 JW |
2356 | if (is_name_beginner (c = *input_line_pointer++) |
2357 | || (input_from_string && c == FAKE_LABEL_CHAR)) | |
58b5739a RH |
2358 | { |
2359 | while (is_part_of_name (c = *input_line_pointer++) | |
2469b3c5 | 2360 | || (input_from_string && c == FAKE_LABEL_CHAR)) |
58b5739a RH |
2361 | ; |
2362 | if (is_name_ender (c)) | |
2363 | c = *input_line_pointer++; | |
2364 | } | |
d02603dc NC |
2365 | else if (c == '"') |
2366 | { | |
5b7c81bd | 2367 | bool backslash_seen; |
d02603dc NC |
2368 | |
2369 | * ilp_return = input_line_pointer; | |
2370 | do | |
2371 | { | |
2372 | backslash_seen = c == '\\'; | |
2373 | c = * input_line_pointer ++; | |
2374 | } | |
2375 | while (c != 0 && (c != '"' || backslash_seen)); | |
2376 | ||
2377 | if (c == 0) | |
2378 | as_warn (_("missing closing '\"'")); | |
2379 | } | |
252b5132 | 2380 | *--input_line_pointer = 0; |
d02603dc NC |
2381 | return c; |
2382 | } | |
2383 | ||
2384 | /* Replace the NUL character pointed to by input_line_pointer | |
2385 | with C. If C is \" then advance past it. Return the character | |
2386 | now pointed to by input_line_pointer. */ | |
2387 | ||
2388 | char | |
2389 | restore_line_pointer (char c) | |
2390 | { | |
2391 | * input_line_pointer = c; | |
2392 | if (c == '"') | |
2393 | c = * ++ input_line_pointer; | |
2394 | return c; | |
252b5132 RH |
2395 | } |
2396 | ||
252b5132 | 2397 | unsigned int |
dd625418 | 2398 | get_single_number (void) |
252b5132 RH |
2399 | { |
2400 | expressionS exp; | |
9497f5ac | 2401 | operand (&exp, expr_normal); |
252b5132 | 2402 | return exp.X_add_number; |
252b5132 | 2403 | } |