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