1 /* expr.c -operands, expressions-
2 Copyright 1987, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005
4 Free Software Foundation, Inc.
6 This file is part of GAS, the GNU Assembler.
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
10 the Free Software Foundation; either version 2, or (at your option)
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.
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
20 Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
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. */
29 #define min(a, b) ((a) < (b) ? (a) : (b))
32 #include "safe-ctype.h"
35 static void floating_constant (expressionS * expressionP);
36 static valueT generic_bignum_to_int32 (void);
38 static valueT generic_bignum_to_int64 (void);
40 static void integer_constant (int radix, expressionS * expressionP);
41 static void mri_char_constant (expressionS *);
42 static void current_location (expressionS *);
43 static void clean_up_expression (expressionS * expressionP);
44 static segT operand (expressionS *, enum expr_mode);
45 static operatorT operator (int *);
47 extern const char EXP_CHARS[], FLT_CHARS[];
49 /* We keep a mapping of expression symbols to file positions, so that
50 we can provide better error messages. */
52 struct expr_symbol_line {
53 struct expr_symbol_line *next;
59 static struct expr_symbol_line *expr_symbol_lines;
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. */
66 make_expr_symbol (expressionS *expressionP)
70 struct expr_symbol_line *n;
72 if (expressionP->X_op == O_symbol
73 && expressionP->X_add_number == 0)
74 return expressionP->X_add_symbol;
76 if (expressionP->X_op == O_big)
78 /* This won't work, because the actual value is stored in
79 generic_floating_point_number or generic_bignum, and we are
80 going to lose it if we haven't already. */
81 if (expressionP->X_add_number > 0)
82 as_bad (_("bignum invalid"));
84 as_bad (_("floating point number invalid"));
85 zero.X_op = O_constant;
86 zero.X_add_number = 0;
88 clean_up_expression (&zero);
92 /* Putting constant symbols in absolute_section rather than
93 expr_section is convenient for the old a.out code, for which
94 S_GET_SEGMENT does not always retrieve the value put in by
96 symbolP = symbol_create (FAKE_LABEL_NAME,
97 (expressionP->X_op == O_constant
100 0, &zero_address_frag);
101 symbol_set_value_expression (symbolP, expressionP);
103 if (expressionP->X_op == O_constant)
104 resolve_symbol_value (symbolP);
106 n = (struct expr_symbol_line *) xmalloc (sizeof *n);
108 as_where (&n->file, &n->line);
109 n->next = expr_symbol_lines;
110 expr_symbol_lines = n;
115 /* Return the file and line number for an expr symbol. Return
116 non-zero if something was found, 0 if no information is known for
120 expr_symbol_where (symbolS *sym, char **pfile, unsigned int *pline)
122 register struct expr_symbol_line *l;
124 for (l = expr_symbol_lines; l != NULL; l = l->next)
137 /* Utilities for building expressions.
138 Since complex expressions are recorded as symbols for use in other
139 expressions these return a symbolS * and not an expressionS *.
140 These explicitly do not take an "add_number" argument. */
141 /* ??? For completeness' sake one might want expr_build_symbol.
142 It would just return its argument. */
144 /* Build an expression for an unsigned constant.
145 The corresponding one for signed constants is missing because
146 there's currently no need for it. One could add an unsigned_p flag
147 but that seems more clumsy. */
150 expr_build_uconstant (offsetT value)
155 e.X_add_number = value;
157 return make_expr_symbol (&e);
160 /* Build an expression for the current location ('.'). */
163 expr_build_dot (void)
167 current_location (&e);
168 return make_expr_symbol (&e);
171 /* Build any floating-point literal here.
172 Also build any bignum literal here. */
174 /* Seems atof_machine can backscan through generic_bignum and hit whatever
175 happens to be loaded before it in memory. And its way too complicated
176 for me to fix right. Thus a hack. JF: Just make generic_bignum bigger,
177 and never write into the early words, thus they'll always be zero.
178 I hate Dean's floating-point code. Bleh. */
179 LITTLENUM_TYPE generic_bignum[SIZE_OF_LARGE_NUMBER + 6];
181 FLONUM_TYPE generic_floating_point_number = {
182 &generic_bignum[6], /* low. (JF: Was 0) */
183 &generic_bignum[SIZE_OF_LARGE_NUMBER + 6 - 1], /* high. JF: (added +6) */
191 floating_constant (expressionS *expressionP)
193 /* input_line_pointer -> floating-point constant. */
196 error_code = atof_generic (&input_line_pointer, ".", EXP_CHARS,
197 &generic_floating_point_number);
201 if (error_code == ERROR_EXPONENT_OVERFLOW)
203 as_bad (_("bad floating-point constant: exponent overflow"));
207 as_bad (_("bad floating-point constant: unknown error code=%d"),
211 expressionP->X_op = O_big;
212 /* input_line_pointer -> just after constant, which may point to
214 expressionP->X_add_number = -1;
218 generic_bignum_to_int32 (void)
221 ((generic_bignum[1] & LITTLENUM_MASK) << LITTLENUM_NUMBER_OF_BITS)
222 | (generic_bignum[0] & LITTLENUM_MASK);
223 number &= 0xffffffff;
229 generic_bignum_to_int64 (void)
232 ((((((((valueT) generic_bignum[3] & LITTLENUM_MASK)
233 << LITTLENUM_NUMBER_OF_BITS)
234 | ((valueT) generic_bignum[2] & LITTLENUM_MASK))
235 << LITTLENUM_NUMBER_OF_BITS)
236 | ((valueT) generic_bignum[1] & LITTLENUM_MASK))
237 << LITTLENUM_NUMBER_OF_BITS)
238 | ((valueT) generic_bignum[0] & LITTLENUM_MASK));
244 integer_constant (int radix, expressionS *expressionP)
246 char *start; /* Start of number. */
249 valueT number; /* Offset or (absolute) value. */
250 short int digit; /* Value of next digit in current radix. */
251 short int maxdig = 0; /* Highest permitted digit value. */
252 int too_many_digits = 0; /* If we see >= this number of. */
253 char *name; /* Points to name of symbol. */
254 symbolS *symbolP; /* Points to symbol. */
256 int small; /* True if fits in 32 bits. */
258 /* May be bignum, or may fit in 32 bits. */
259 /* Most numbers fit into 32 bits, and we want this case to be fast.
260 so we pretend it will fit into 32 bits. If, after making up a 32
261 bit number, we realise that we have scanned more digits than
262 comfortably fit into 32 bits, we re-scan the digits coding them
263 into a bignum. For decimal and octal numbers we are
264 conservative: Some numbers may be assumed bignums when in fact
265 they do fit into 32 bits. Numbers of any radix can have excess
266 leading zeros: We strive to recognise this and cast them back
267 into 32 bits. We must check that the bignum really is more than
268 32 bits, and change it back to a 32-bit number if it fits. The
269 number we are looking for is expected to be positive, but if it
270 fits into 32 bits as an unsigned number, we let it be a 32-bit
271 number. The cavalier approach is for speed in ordinary cases. */
272 /* This has been extended for 64 bits. We blindly assume that if
273 you're compiling in 64-bit mode, the target is a 64-bit machine.
274 This should be cleaned up. */
278 #else /* includes non-bfd case, mostly */
282 if ((NUMBERS_WITH_SUFFIX || flag_m68k_mri) && radix == 0)
286 /* In MRI mode, the number may have a suffix indicating the
287 radix. For that matter, it might actually be a floating
289 for (suffix = input_line_pointer; ISALNUM (*suffix); suffix++)
291 if (*suffix == 'e' || *suffix == 'E')
295 if (suffix == input_line_pointer)
308 else if (c == 'O' || c == 'Q')
312 else if (suffix[1] == '.' || c == 'E' || flt)
314 floating_constant (expressionP);
329 too_many_digits = valuesize + 1;
333 too_many_digits = (valuesize + 2) / 3 + 1;
337 too_many_digits = (valuesize + 3) / 4 + 1;
341 too_many_digits = (valuesize + 11) / 4; /* Very rough. */
344 start = input_line_pointer;
345 c = *input_line_pointer++;
347 (digit = hex_value (c)) < maxdig;
348 c = *input_line_pointer++)
350 number = number * radix + digit;
352 /* c contains character after number. */
353 /* input_line_pointer->char after c. */
354 small = (input_line_pointer - start - 1) < too_many_digits;
356 if (radix == 16 && c == '_')
358 /* This is literal of the form 0x333_0_12345678_1.
359 This example is equivalent to 0x00000333000000001234567800000001. */
361 int num_little_digits = 0;
363 input_line_pointer = start; /* -> 1st digit. */
365 know (LITTLENUM_NUMBER_OF_BITS == 16);
367 for (c = '_'; c == '_'; num_little_digits += 2)
370 /* Convert one 64-bit word. */
373 for (c = *input_line_pointer++;
374 (digit = hex_value (c)) < maxdig;
375 c = *(input_line_pointer++))
377 number = number * radix + digit;
381 /* Check for 8 digit per word max. */
383 as_bad (_("a bignum with underscores may not have more than 8 hex digits in any word"));
385 /* Add this chunk to the bignum.
386 Shift things down 2 little digits. */
387 know (LITTLENUM_NUMBER_OF_BITS == 16);
388 for (i = min (num_little_digits + 1, SIZE_OF_LARGE_NUMBER - 1);
391 generic_bignum[i] = generic_bignum[i - 2];
393 /* Add the new digits as the least significant new ones. */
394 generic_bignum[0] = number & 0xffffffff;
395 generic_bignum[1] = number >> 16;
398 /* Again, c is char after number, input_line_pointer->after c. */
400 if (num_little_digits > SIZE_OF_LARGE_NUMBER - 1)
401 num_little_digits = SIZE_OF_LARGE_NUMBER - 1;
403 assert (num_little_digits >= 4);
405 if (num_little_digits != 8)
406 as_bad (_("a bignum with underscores must have exactly 4 words"));
408 /* We might have some leading zeros. These can be trimmed to give
409 us a change to fit this constant into a small number. */
410 while (generic_bignum[num_little_digits - 1] == 0
411 && num_little_digits > 1)
414 if (num_little_digits <= 2)
416 /* will fit into 32 bits. */
417 number = generic_bignum_to_int32 ();
421 else if (num_little_digits <= 4)
423 /* Will fit into 64 bits. */
424 number = generic_bignum_to_int64 ();
432 /* Number of littlenums in the bignum. */
433 number = num_little_digits;
438 /* We saw a lot of digits. manufacture a bignum the hard way. */
439 LITTLENUM_TYPE *leader; /* -> high order littlenum of the bignum. */
440 LITTLENUM_TYPE *pointer; /* -> littlenum we are frobbing now. */
443 leader = generic_bignum;
444 generic_bignum[0] = 0;
445 generic_bignum[1] = 0;
446 generic_bignum[2] = 0;
447 generic_bignum[3] = 0;
448 input_line_pointer = start; /* -> 1st digit. */
449 c = *input_line_pointer++;
450 for (; (carry = hex_value (c)) < maxdig; c = *input_line_pointer++)
452 for (pointer = generic_bignum; pointer <= leader; pointer++)
456 work = carry + radix * *pointer;
457 *pointer = work & LITTLENUM_MASK;
458 carry = work >> LITTLENUM_NUMBER_OF_BITS;
462 if (leader < generic_bignum + SIZE_OF_LARGE_NUMBER - 1)
464 /* Room to grow a longer bignum. */
469 /* Again, c is char after number. */
470 /* input_line_pointer -> after c. */
471 know (LITTLENUM_NUMBER_OF_BITS == 16);
472 if (leader < generic_bignum + 2)
474 /* Will fit into 32 bits. */
475 number = generic_bignum_to_int32 ();
479 else if (leader < generic_bignum + 4)
481 /* Will fit into 64 bits. */
482 number = generic_bignum_to_int64 ();
488 /* Number of littlenums in the bignum. */
489 number = leader - generic_bignum + 1;
493 if ((NUMBERS_WITH_SUFFIX || flag_m68k_mri)
495 && input_line_pointer - 1 == suffix)
496 c = *input_line_pointer++;
500 /* Here with number, in correct radix. c is the next char.
501 Note that unlike un*x, we allow "011f" "0x9f" to both mean
502 the same as the (conventional) "9f".
503 This is simply easier than checking for strict canonical
506 if (LOCAL_LABELS_FB && c == 'b')
508 /* Backward ref to local label.
509 Because it is backward, expect it to be defined. */
510 /* Construct a local label. */
511 name = fb_label_name ((int) number, 0);
513 /* Seen before, or symbol is defined: OK. */
514 symbolP = symbol_find (name);
515 if ((symbolP != NULL) && (S_IS_DEFINED (symbolP)))
517 /* Local labels are never absolute. Don't waste time
518 checking absoluteness. */
519 know (SEG_NORMAL (S_GET_SEGMENT (symbolP)));
521 expressionP->X_op = O_symbol;
522 expressionP->X_add_symbol = symbolP;
526 /* Either not seen or not defined. */
527 /* @@ Should print out the original string instead of
528 the parsed number. */
529 as_bad (_("backward ref to unknown label \"%d:\""),
531 expressionP->X_op = O_constant;
534 expressionP->X_add_number = 0;
536 else if (LOCAL_LABELS_FB && c == 'f')
538 /* Forward reference. Expect symbol to be undefined or
539 unknown. undefined: seen it before. unknown: never seen
542 Construct a local label name, then an undefined symbol.
543 Don't create a xseg frag for it: caller may do that.
544 Just return it as never seen before. */
545 name = fb_label_name ((int) number, 1);
546 symbolP = symbol_find_or_make (name);
547 /* We have no need to check symbol properties. */
548 #ifndef many_segments
549 /* Since "know" puts its arg into a "string", we
550 can't have newlines in the argument. */
551 know (S_GET_SEGMENT (symbolP) == undefined_section || S_GET_SEGMENT (symbolP) == text_section || S_GET_SEGMENT (symbolP) == data_section);
553 expressionP->X_op = O_symbol;
554 expressionP->X_add_symbol = symbolP;
555 expressionP->X_add_number = 0;
557 else if (LOCAL_LABELS_DOLLAR && c == '$')
559 /* If the dollar label is *currently* defined, then this is just
560 another reference to it. If it is not *currently* defined,
561 then this is a fresh instantiation of that number, so create
564 if (dollar_label_defined ((long) number))
566 name = dollar_label_name ((long) number, 0);
567 symbolP = symbol_find (name);
568 know (symbolP != NULL);
572 name = dollar_label_name ((long) number, 1);
573 symbolP = symbol_find_or_make (name);
576 expressionP->X_op = O_symbol;
577 expressionP->X_add_symbol = symbolP;
578 expressionP->X_add_number = 0;
582 expressionP->X_op = O_constant;
583 expressionP->X_add_number = number;
584 input_line_pointer--; /* Restore following character. */
585 } /* Really just a number. */
589 /* Not a small number. */
590 expressionP->X_op = O_big;
591 expressionP->X_add_number = number; /* Number of littlenums. */
592 input_line_pointer--; /* -> char following number. */
596 /* Parse an MRI multi character constant. */
599 mri_char_constant (expressionS *expressionP)
603 if (*input_line_pointer == '\''
604 && input_line_pointer[1] != '\'')
606 expressionP->X_op = O_constant;
607 expressionP->X_add_number = 0;
611 /* In order to get the correct byte ordering, we must build the
612 number in reverse. */
613 for (i = SIZE_OF_LARGE_NUMBER - 1; i >= 0; i--)
617 generic_bignum[i] = 0;
618 for (j = 0; j < CHARS_PER_LITTLENUM; j++)
620 if (*input_line_pointer == '\'')
622 if (input_line_pointer[1] != '\'')
624 ++input_line_pointer;
626 generic_bignum[i] <<= 8;
627 generic_bignum[i] += *input_line_pointer;
628 ++input_line_pointer;
631 if (i < SIZE_OF_LARGE_NUMBER - 1)
633 /* If there is more than one littlenum, left justify the
634 last one to make it match the earlier ones. If there is
635 only one, we can just use the value directly. */
636 for (; j < CHARS_PER_LITTLENUM; j++)
637 generic_bignum[i] <<= 8;
640 if (*input_line_pointer == '\''
641 && input_line_pointer[1] != '\'')
647 as_bad (_("character constant too large"));
656 c = SIZE_OF_LARGE_NUMBER - i;
657 for (j = 0; j < c; j++)
658 generic_bignum[j] = generic_bignum[i + j];
662 know (LITTLENUM_NUMBER_OF_BITS == 16);
665 expressionP->X_op = O_big;
666 expressionP->X_add_number = i;
670 expressionP->X_op = O_constant;
672 expressionP->X_add_number = generic_bignum[0] & LITTLENUM_MASK;
674 expressionP->X_add_number =
675 (((generic_bignum[1] & LITTLENUM_MASK)
676 << LITTLENUM_NUMBER_OF_BITS)
677 | (generic_bignum[0] & LITTLENUM_MASK));
680 /* Skip the final closing quote. */
681 ++input_line_pointer;
684 /* Return an expression representing the current location. This
685 handles the magic symbol `.'. */
688 current_location (expressionS *expressionp)
690 if (now_seg == absolute_section)
692 expressionp->X_op = O_constant;
693 expressionp->X_add_number = abs_section_offset;
697 expressionp->X_op = O_symbol;
698 expressionp->X_add_symbol = symbol_temp_new_now ();
699 expressionp->X_add_number = 0;
703 /* In: Input_line_pointer points to 1st char of operand, which may
707 The operand may have been empty: in this case X_op == O_absent.
708 Input_line_pointer->(next non-blank) char after operand. */
711 operand (expressionS *expressionP, enum expr_mode mode)
714 symbolS *symbolP; /* Points to symbol. */
715 char *name; /* Points to name of symbol. */
718 /* All integers are regarded as unsigned unless they are negated.
719 This is because the only thing which cares whether a number is
720 unsigned is the code in emit_expr which extends constants into
721 bignums. It should only sign extend negative numbers, so that
722 something like ``.quad 0x80000000'' is not sign extended even
723 though it appears negative if valueT is 32 bits. */
724 expressionP->X_unsigned = 1;
726 /* Digits, assume it is a bignum. */
728 SKIP_WHITESPACE (); /* Leading whitespace is part of operand. */
729 c = *input_line_pointer++; /* input_line_pointer -> past char in c. */
731 if (is_end_of_line[(unsigned char) c])
745 input_line_pointer--;
747 integer_constant ((NUMBERS_WITH_SUFFIX || flag_m68k_mri)
752 #ifdef LITERAL_PREFIXDOLLAR_HEX
754 /* $L is the start of a local label, not a hex constant. */
755 if (* input_line_pointer == 'L')
757 integer_constant (16, expressionP);
761 #ifdef LITERAL_PREFIXPERCENT_BIN
763 integer_constant (2, expressionP);
768 /* Non-decimal radix. */
770 if (NUMBERS_WITH_SUFFIX || flag_m68k_mri)
774 /* Check for a hex or float constant. */
775 for (s = input_line_pointer; hex_p (*s); s++)
777 if (*s == 'h' || *s == 'H' || *input_line_pointer == '.')
779 --input_line_pointer;
780 integer_constant (0, expressionP);
784 c = *input_line_pointer;
793 if (NUMBERS_WITH_SUFFIX || flag_m68k_mri)
795 integer_constant (0, expressionP);
801 if (c && strchr (FLT_CHARS, c))
803 input_line_pointer++;
804 floating_constant (expressionP);
805 expressionP->X_add_number = - TOLOWER (c);
809 /* The string was only zero. */
810 expressionP->X_op = O_constant;
811 expressionP->X_add_number = 0;
820 input_line_pointer++;
821 integer_constant (16, expressionP);
825 if (LOCAL_LABELS_FB && ! (flag_m68k_mri || NUMBERS_WITH_SUFFIX))
827 /* This code used to check for '+' and '-' here, and, in
828 some conditions, fall through to call
829 integer_constant. However, that didn't make sense,
830 as integer_constant only accepts digits. */
831 /* Some of our code elsewhere does permit digits greater
832 than the expected base; for consistency, do the same
834 if (input_line_pointer[1] < '0'
835 || input_line_pointer[1] > '9')
837 /* Parse this as a back reference to label 0. */
838 input_line_pointer--;
839 integer_constant (10, expressionP);
842 /* Otherwise, parse this as a binary number. */
846 input_line_pointer++;
847 if (flag_m68k_mri || NUMBERS_WITH_SUFFIX)
849 integer_constant (2, expressionP);
860 integer_constant ((flag_m68k_mri || NUMBERS_WITH_SUFFIX)
868 /* If it says "0f" and it could possibly be a floating point
869 number, make it one. Otherwise, make it a local label,
870 and try to deal with parsing the rest later. */
871 if (!input_line_pointer[1]
872 || (is_end_of_line[0xff & input_line_pointer[1]])
873 || strchr (FLT_CHARS, 'f') == NULL)
876 char *cp = input_line_pointer + 1;
877 int r = atof_generic (&cp, ".", EXP_CHARS,
878 &generic_floating_point_number);
882 case ERROR_EXPONENT_OVERFLOW:
883 if (*cp == 'f' || *cp == 'b')
884 /* Looks like a difference expression. */
886 else if (cp == input_line_pointer + 1)
887 /* No characters has been accepted -- looks like
893 as_fatal (_("expr.c(operand): bad atof_generic return val %d"),
898 /* Okay, now we've sorted it out. We resume at one of these
899 two labels, depending on what we've decided we're probably
902 input_line_pointer--;
903 integer_constant (10, expressionP);
913 if (flag_m68k_mri || NUMBERS_WITH_SUFFIX)
915 integer_constant (0, expressionP);
925 input_line_pointer++;
926 floating_constant (expressionP);
927 expressionP->X_add_number = - TOLOWER (c);
931 if (LOCAL_LABELS_DOLLAR)
933 integer_constant (10, expressionP);
943 #ifndef NEED_INDEX_OPERATOR
946 /* Didn't begin with digit & not a name. */
947 if (mode != expr_defer)
948 segment = expression (expressionP);
950 segment = deferred_expression (expressionP);
951 /* expression () will pass trailing whitespace. */
952 if ((c == '(' && *input_line_pointer != ')')
953 || (c == '[' && *input_line_pointer != ']'))
954 as_bad (_("missing '%c'"), c == '(' ? ')' : ']');
956 input_line_pointer++;
958 /* Here with input_line_pointer -> char after "(...)". */
963 if (! flag_m68k_mri || *input_line_pointer != '\'')
965 as_bad (_("EBCDIC constants are not supported"));
968 if (! flag_m68k_mri || *input_line_pointer != '\'')
970 ++input_line_pointer;
976 /* Warning: to conform to other people's assemblers NO
977 ESCAPEMENT is permitted for a single quote. The next
978 character, parity errors and all, is taken as the value
979 of the operand. VERY KINKY. */
980 expressionP->X_op = O_constant;
981 expressionP->X_add_number = *input_line_pointer++;
985 mri_char_constant (expressionP);
990 /* Double quote is the bitwise not operator in MRI mode. */
996 /* '~' is permitted to start a label on the Delta. */
997 if (is_name_beginner (c))
1003 /* Do not accept ++e or --e as +(+e) or -(-e)
1004 Disabled, since the preprocessor removes whitespace. */
1005 if (0 && (c == '-' || c == '+') && *input_line_pointer == c)
1008 operand (expressionP, mode);
1009 if (expressionP->X_op == O_constant)
1011 /* input_line_pointer -> char after operand. */
1014 expressionP->X_add_number = - expressionP->X_add_number;
1015 /* Notice: '-' may overflow: no warning is given.
1016 This is compatible with other people's
1017 assemblers. Sigh. */
1018 expressionP->X_unsigned = 0;
1020 else if (c == '~' || c == '"')
1021 expressionP->X_add_number = ~ expressionP->X_add_number;
1023 expressionP->X_add_number = ! expressionP->X_add_number;
1025 else if (expressionP->X_op == O_big
1026 && expressionP->X_add_number <= 0
1028 && (generic_floating_point_number.sign == '+'
1029 || generic_floating_point_number.sign == 'P'))
1031 /* Negative flonum (eg, -1.000e0). */
1032 if (generic_floating_point_number.sign == '+')
1033 generic_floating_point_number.sign = '-';
1035 generic_floating_point_number.sign = 'N';
1037 else if (expressionP->X_op == O_big
1038 && expressionP->X_add_number > 0)
1042 if (c == '~' || c == '-')
1044 for (i = 0; i < expressionP->X_add_number; ++i)
1045 generic_bignum[i] = ~generic_bignum[i];
1047 for (i = 0; i < expressionP->X_add_number; ++i)
1049 generic_bignum[i] += 1;
1050 if (generic_bignum[i])
1057 for (i = 0; i < expressionP->X_add_number; ++i)
1059 if (generic_bignum[i])
1061 generic_bignum[i] = 0;
1063 generic_bignum[0] = nonzero;
1066 else if (expressionP->X_op != O_illegal
1067 && expressionP->X_op != O_absent)
1071 expressionP->X_add_symbol = make_expr_symbol (expressionP);
1073 expressionP->X_op = O_uminus;
1074 else if (c == '~' || c == '"')
1075 expressionP->X_op = O_bit_not;
1077 expressionP->X_op = O_logical_not;
1078 expressionP->X_add_number = 0;
1082 as_warn (_("Unary operator %c ignored because bad operand follows"),
1087 #if defined (DOLLAR_DOT) || defined (TC_M68K)
1089 /* '$' is the program counter when in MRI mode, or when
1090 DOLLAR_DOT is defined. */
1092 if (! flag_m68k_mri)
1095 if (flag_m68k_mri && hex_p (*input_line_pointer))
1097 /* In MRI mode, '$' is also used as the prefix for a
1098 hexadecimal constant. */
1099 integer_constant (16, expressionP);
1103 if (is_part_of_name (*input_line_pointer))
1106 current_location (expressionP);
1111 if (!is_part_of_name (*input_line_pointer))
1113 current_location (expressionP);
1116 else if ((strncasecmp (input_line_pointer, "startof.", 8) == 0
1117 && ! is_part_of_name (input_line_pointer[8]))
1118 || (strncasecmp (input_line_pointer, "sizeof.", 7) == 0
1119 && ! is_part_of_name (input_line_pointer[7])))
1123 start = (input_line_pointer[1] == 't'
1124 || input_line_pointer[1] == 'T');
1125 input_line_pointer += start ? 8 : 7;
1127 if (*input_line_pointer != '(')
1128 as_bad (_("syntax error in .startof. or .sizeof."));
1133 ++input_line_pointer;
1135 name = input_line_pointer;
1136 c = get_symbol_end ();
1138 buf = (char *) xmalloc (strlen (name) + 10);
1140 sprintf (buf, ".startof.%s", name);
1142 sprintf (buf, ".sizeof.%s", name);
1143 symbolP = symbol_make (buf);
1146 expressionP->X_op = O_symbol;
1147 expressionP->X_add_symbol = symbolP;
1148 expressionP->X_add_number = 0;
1150 *input_line_pointer = c;
1152 if (*input_line_pointer != ')')
1153 as_bad (_("syntax error in .startof. or .sizeof."));
1155 ++input_line_pointer;
1166 /* Can't imagine any other kind of operand. */
1167 expressionP->X_op = O_absent;
1168 input_line_pointer--;
1173 if (! flag_m68k_mri)
1175 integer_constant (2, expressionP);
1179 if (! flag_m68k_mri)
1181 integer_constant (8, expressionP);
1185 if (! flag_m68k_mri)
1188 /* In MRI mode, this is a floating point constant represented
1189 using hexadecimal digits. */
1191 ++input_line_pointer;
1192 integer_constant (16, expressionP);
1196 if (! flag_m68k_mri || is_part_of_name (*input_line_pointer))
1199 current_location (expressionP);
1207 if (is_name_beginner (c)) /* Here if did not begin with a digit. */
1209 /* Identifier begins here.
1210 This is kludged for speed, so code is repeated. */
1212 name = --input_line_pointer;
1213 c = get_symbol_end ();
1215 #ifdef md_parse_name
1216 /* This is a hook for the backend to parse certain names
1217 specially in certain contexts. If a name always has a
1218 specific value, it can often be handled by simply
1219 entering it in the symbol table. */
1220 if (md_parse_name (name, expressionP, mode, &c))
1222 *input_line_pointer = c;
1228 /* The MRI i960 assembler permits
1230 FIXME: This should use md_parse_name. */
1232 && (strcasecmp (name, "sizeof") == 0
1233 || strcasecmp (name, "startof") == 0))
1238 start = (name[1] == 't'
1241 *input_line_pointer = c;
1244 name = input_line_pointer;
1245 c = get_symbol_end ();
1247 buf = (char *) xmalloc (strlen (name) + 10);
1249 sprintf (buf, ".startof.%s", name);
1251 sprintf (buf, ".sizeof.%s", name);
1252 symbolP = symbol_make (buf);
1255 expressionP->X_op = O_symbol;
1256 expressionP->X_add_symbol = symbolP;
1257 expressionP->X_add_number = 0;
1259 *input_line_pointer = c;
1266 symbolP = symbol_find_or_make (name);
1268 /* If we have an absolute symbol or a reg, then we know its
1270 segment = S_GET_SEGMENT (symbolP);
1271 if (mode != expr_defer && segment == absolute_section)
1273 expressionP->X_op = O_constant;
1274 expressionP->X_add_number = S_GET_VALUE (symbolP);
1276 else if (mode != expr_defer && segment == reg_section)
1278 expressionP->X_op = O_register;
1279 expressionP->X_add_number = S_GET_VALUE (symbolP);
1283 expressionP->X_op = O_symbol;
1284 expressionP->X_add_symbol = symbolP;
1285 expressionP->X_add_number = 0;
1287 *input_line_pointer = c;
1292 /* Let the target try to parse it. Success is indicated by changing
1293 the X_op field to something other than O_absent and pointing
1294 input_line_pointer past the expression. If it can't parse the
1295 expression, X_op and input_line_pointer should be unchanged. */
1296 expressionP->X_op = O_absent;
1297 --input_line_pointer;
1298 md_operand (expressionP);
1299 if (expressionP->X_op == O_absent)
1301 ++input_line_pointer;
1302 as_bad (_("bad expression"));
1303 expressionP->X_op = O_constant;
1304 expressionP->X_add_number = 0;
1310 /* It is more 'efficient' to clean up the expressionS when they are
1311 created. Doing it here saves lines of code. */
1312 clean_up_expression (expressionP);
1313 SKIP_WHITESPACE (); /* -> 1st char after operand. */
1314 know (*input_line_pointer != ' ');
1316 /* The PA port needs this information. */
1317 if (expressionP->X_add_symbol)
1318 symbol_mark_used (expressionP->X_add_symbol);
1320 expressionP->X_add_symbol = symbol_clone_if_forward_ref (expressionP->X_add_symbol);
1321 expressionP->X_op_symbol = symbol_clone_if_forward_ref (expressionP->X_op_symbol);
1323 switch (expressionP->X_op)
1326 return absolute_section;
1328 return S_GET_SEGMENT (expressionP->X_add_symbol);
1334 /* Internal. Simplify a struct expression for use by expr (). */
1336 /* In: address of an expressionS.
1337 The X_op field of the expressionS may only take certain values.
1338 Elsewise we waste time special-case testing. Sigh. Ditto SEG_ABSENT.
1340 Out: expressionS may have been modified:
1341 Unused fields zeroed to help expr (). */
1344 clean_up_expression (expressionS *expressionP)
1346 switch (expressionP->X_op)
1350 expressionP->X_add_number = 0;
1355 expressionP->X_add_symbol = NULL;
1360 expressionP->X_op_symbol = NULL;
1367 /* Expression parser. */
1369 /* We allow an empty expression, and just assume (absolute,0) silently.
1370 Unary operators and parenthetical expressions are treated as operands.
1371 As usual, Q==quantity==operand, O==operator, X==expression mnemonics.
1373 We used to do an aho/ullman shift-reduce parser, but the logic got so
1374 warped that I flushed it and wrote a recursive-descent parser instead.
1375 Now things are stable, would anybody like to write a fast parser?
1376 Most expressions are either register (which does not even reach here)
1377 or 1 symbol. Then "symbol+constant" and "symbol-symbol" are common.
1378 So I guess it doesn't really matter how inefficient more complex expressions
1381 After expr(RANK,resultP) input_line_pointer->operator of rank <= RANK.
1382 Also, we have consumed any leading or trailing spaces (operand does that)
1383 and done all intervening operators.
1385 This returns the segment of the result, which will be
1386 absolute_section or the segment of a symbol. */
1389 #define __ O_illegal
1391 /* Maps ASCII -> operators. */
1392 static const operatorT op_encoding[256] = {
1393 __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __,
1394 __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __,
1396 __, O_bit_or_not, __, __, __, O_modulus, O_bit_and, __,
1397 __, __, O_multiply, O_add, __, O_subtract, __, O_divide,
1398 __, __, __, __, __, __, __, __,
1399 __, __, __, __, O_lt, __, O_gt, __,
1400 __, __, __, __, __, __, __, __,
1401 __, __, __, __, __, __, __, __,
1402 __, __, __, __, __, __, __, __,
1404 #ifdef NEED_INDEX_OPERATOR
1409 __, __, O_bit_exclusive_or, __,
1410 __, __, __, __, __, __, __, __,
1411 __, __, __, __, __, __, __, __,
1412 __, __, __, __, __, __, __, __,
1413 __, __, __, __, O_bit_inclusive_or, __, __, __,
1415 __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __,
1416 __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __,
1417 __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __,
1418 __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __,
1419 __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __,
1420 __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __,
1421 __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __,
1422 __, __, __, __, __, __, __, __, __, __, __, __, __, __, __, __
1426 0 operand, (expression)
1431 5 used for * / % in MRI mode
1436 static operator_rankT op_rank[] = {
1441 0, /* O_symbol_rva */
1446 9, /* O_logical_not */
1450 8, /* O_left_shift */
1451 8, /* O_right_shift */
1452 7, /* O_bit_inclusive_or */
1453 7, /* O_bit_or_not */
1454 7, /* O_bit_exclusive_or */
1464 3, /* O_logical_and */
1465 2, /* O_logical_or */
1485 /* Unfortunately, in MRI mode for the m68k, multiplication and
1486 division have lower precedence than the bit wise operators. This
1487 function sets the operator precedences correctly for the current
1488 mode. Also, MRI uses a different bit_not operator, and this fixes
1491 #define STANDARD_MUL_PRECEDENCE 8
1492 #define MRI_MUL_PRECEDENCE 6
1495 expr_set_precedence (void)
1499 op_rank[O_multiply] = MRI_MUL_PRECEDENCE;
1500 op_rank[O_divide] = MRI_MUL_PRECEDENCE;
1501 op_rank[O_modulus] = MRI_MUL_PRECEDENCE;
1505 op_rank[O_multiply] = STANDARD_MUL_PRECEDENCE;
1506 op_rank[O_divide] = STANDARD_MUL_PRECEDENCE;
1507 op_rank[O_modulus] = STANDARD_MUL_PRECEDENCE;
1511 /* Initialize the expression parser. */
1516 expr_set_precedence ();
1518 /* Verify that X_op field is wide enough. */
1522 assert (e.X_op == O_max);
1526 /* Return the encoding for the operator at INPUT_LINE_POINTER, and
1527 sets NUM_CHARS to the number of characters in the operator.
1528 Does not advance INPUT_LINE_POINTER. */
1530 static inline operatorT
1531 operator (int *num_chars)
1536 c = *input_line_pointer & 0xff;
1539 if (is_end_of_line[c])
1545 return op_encoding[c];
1549 /* Do not allow a++b and a--b to be a + (+b) and a - (-b)
1550 Disabled, since the preprocessor removes whitespace. */
1551 if (1 || input_line_pointer[1] != c)
1552 return op_encoding[c];
1556 switch (input_line_pointer[1])
1559 return op_encoding[c];
1574 if (input_line_pointer[1] != '=')
1575 return op_encoding[c];
1581 switch (input_line_pointer[1])
1584 return op_encoding[c];
1586 ret = O_right_shift;
1596 switch (input_line_pointer[1])
1599 /* We accept !! as equivalent to ^ for MRI compatibility. */
1601 return O_bit_exclusive_or;
1603 /* We accept != as equivalent to <>. */
1608 return O_bit_inclusive_or;
1609 return op_encoding[c];
1613 if (input_line_pointer[1] != '|')
1614 return op_encoding[c];
1617 return O_logical_or;
1620 if (input_line_pointer[1] != '&')
1621 return op_encoding[c];
1624 return O_logical_and;
1630 /* Parse an expression. */
1633 expr (int rankarg, /* Larger # is higher rank. */
1634 expressionS *resultP, /* Deliver result here. */
1635 enum expr_mode mode /* Controls behavior. */)
1637 operator_rankT rank = (operator_rankT) rankarg;
1646 /* Save the value of dot for the fixup code. */
1648 dot_value = frag_now_fix ();
1650 retval = operand (resultP, mode);
1652 /* operand () gobbles spaces. */
1653 know (*input_line_pointer != ' ');
1655 op_left = operator (&op_chars);
1656 while (op_left != O_illegal && op_rank[(int) op_left] > rank)
1660 input_line_pointer += op_chars; /* -> after operator. */
1662 rightseg = expr (op_rank[(int) op_left], &right, mode);
1663 if (right.X_op == O_absent)
1665 as_warn (_("missing operand; zero assumed"));
1666 right.X_op = O_constant;
1667 right.X_add_number = 0;
1668 right.X_add_symbol = NULL;
1669 right.X_op_symbol = NULL;
1672 know (*input_line_pointer != ' ');
1674 if (op_left == O_index)
1676 if (*input_line_pointer != ']')
1677 as_bad ("missing right bracket");
1680 ++input_line_pointer;
1685 op_right = operator (&op_chars);
1687 know (op_right == O_illegal
1688 || op_rank[(int) op_right] <= op_rank[(int) op_left]);
1689 know ((int) op_left >= (int) O_multiply
1690 && (int) op_left <= (int) O_index);
1692 /* input_line_pointer->after right-hand quantity. */
1693 /* left-hand quantity in resultP. */
1694 /* right-hand quantity in right. */
1695 /* operator in op_left. */
1697 if (resultP->X_op == O_big)
1699 if (resultP->X_add_number > 0)
1700 as_warn (_("left operand is a bignum; integer 0 assumed"));
1702 as_warn (_("left operand is a float; integer 0 assumed"));
1703 resultP->X_op = O_constant;
1704 resultP->X_add_number = 0;
1705 resultP->X_add_symbol = NULL;
1706 resultP->X_op_symbol = NULL;
1708 if (right.X_op == O_big)
1710 if (right.X_add_number > 0)
1711 as_warn (_("right operand is a bignum; integer 0 assumed"));
1713 as_warn (_("right operand is a float; integer 0 assumed"));
1714 right.X_op = O_constant;
1715 right.X_add_number = 0;
1716 right.X_add_symbol = NULL;
1717 right.X_op_symbol = NULL;
1720 /* Optimize common cases. */
1721 #ifdef md_optimize_expr
1722 if (md_optimize_expr (resultP, op_left, &right))
1729 if (op_left == O_add && right.X_op == O_constant)
1732 resultP->X_add_number += right.X_add_number;
1734 /* This case comes up in PIC code. */
1735 else if (op_left == O_subtract
1736 && right.X_op == O_symbol
1737 && resultP->X_op == O_symbol
1738 && (symbol_get_frag (right.X_add_symbol)
1739 == symbol_get_frag (resultP->X_add_symbol))
1740 && (SEG_NORMAL (rightseg)
1741 || right.X_add_symbol == resultP->X_add_symbol))
1743 resultP->X_add_number -= right.X_add_number;
1744 resultP->X_add_number += (S_GET_VALUE (resultP->X_add_symbol)
1745 - S_GET_VALUE (right.X_add_symbol));
1746 resultP->X_op = O_constant;
1747 resultP->X_add_symbol = 0;
1749 else if (op_left == O_subtract && right.X_op == O_constant)
1752 resultP->X_add_number -= right.X_add_number;
1754 else if (op_left == O_add && resultP->X_op == O_constant)
1757 resultP->X_op = right.X_op;
1758 resultP->X_add_symbol = right.X_add_symbol;
1759 resultP->X_op_symbol = right.X_op_symbol;
1760 resultP->X_add_number += right.X_add_number;
1763 else if (resultP->X_op == O_constant && right.X_op == O_constant)
1765 /* Constant OP constant. */
1766 offsetT v = right.X_add_number;
1767 if (v == 0 && (op_left == O_divide || op_left == O_modulus))
1769 as_warn (_("division by zero"));
1775 case O_multiply: resultP->X_add_number *= v; break;
1776 case O_divide: resultP->X_add_number /= v; break;
1777 case O_modulus: resultP->X_add_number %= v; break;
1778 case O_left_shift: resultP->X_add_number <<= v; break;
1780 /* We always use unsigned shifts, to avoid relying on
1781 characteristics of the compiler used to compile gas. */
1782 resultP->X_add_number =
1783 (offsetT) ((valueT) resultP->X_add_number >> (valueT) v);
1785 case O_bit_inclusive_or: resultP->X_add_number |= v; break;
1786 case O_bit_or_not: resultP->X_add_number |= ~v; break;
1787 case O_bit_exclusive_or: resultP->X_add_number ^= v; break;
1788 case O_bit_and: resultP->X_add_number &= v; break;
1789 case O_add: resultP->X_add_number += v; break;
1790 case O_subtract: resultP->X_add_number -= v; break;
1792 resultP->X_add_number =
1793 resultP->X_add_number == v ? ~ (offsetT) 0 : 0;
1796 resultP->X_add_number =
1797 resultP->X_add_number != v ? ~ (offsetT) 0 : 0;
1800 resultP->X_add_number =
1801 resultP->X_add_number < v ? ~ (offsetT) 0 : 0;
1804 resultP->X_add_number =
1805 resultP->X_add_number <= v ? ~ (offsetT) 0 : 0;
1808 resultP->X_add_number =
1809 resultP->X_add_number >= v ? ~ (offsetT) 0 : 0;
1812 resultP->X_add_number =
1813 resultP->X_add_number > v ? ~ (offsetT) 0 : 0;
1816 resultP->X_add_number = resultP->X_add_number && v;
1819 resultP->X_add_number = resultP->X_add_number || v;
1823 else if (resultP->X_op == O_symbol
1824 && right.X_op == O_symbol
1825 && (op_left == O_add
1826 || op_left == O_subtract
1827 || (resultP->X_add_number == 0
1828 && right.X_add_number == 0)))
1830 /* Symbol OP symbol. */
1831 resultP->X_op = op_left;
1832 resultP->X_op_symbol = right.X_add_symbol;
1833 if (op_left == O_add)
1834 resultP->X_add_number += right.X_add_number;
1835 else if (op_left == O_subtract)
1837 resultP->X_add_number -= right.X_add_number;
1838 if (retval == rightseg && SEG_NORMAL (retval))
1840 retval = absolute_section;
1841 rightseg = absolute_section;
1847 /* The general case. */
1848 resultP->X_add_symbol = make_expr_symbol (resultP);
1849 resultP->X_op_symbol = make_expr_symbol (&right);
1850 resultP->X_op = op_left;
1851 resultP->X_add_number = 0;
1852 resultP->X_unsigned = 1;
1855 if (retval != rightseg)
1857 if (! SEG_NORMAL (retval))
1859 if (retval != undefined_section || SEG_NORMAL (rightseg))
1862 else if (SEG_NORMAL (rightseg)
1864 && op_left != O_subtract
1867 as_bad (_("operation combines symbols in different segments"));
1871 } /* While next operator is >= this rank. */
1873 /* The PA port needs this information. */
1874 if (resultP->X_add_symbol)
1875 symbol_mark_used (resultP->X_add_symbol);
1877 if (rank == 0 && mode == expr_evaluate)
1878 resolve_expression (resultP);
1880 return resultP->X_op == O_constant ? absolute_section : retval;
1883 /* Resolve an expression without changing any symbols/sub-expressions
1887 resolve_expression (expressionS *expressionP)
1889 /* Help out with CSE. */
1890 valueT final_val = expressionP->X_add_number;
1891 symbolS *add_symbol = expressionP->X_add_symbol;
1892 symbolS *op_symbol = expressionP->X_op_symbol;
1893 operatorT op = expressionP->X_op;
1895 segT seg_left, seg_right;
1896 fragS *frag_left, *frag_right;
1910 if (!snapshot_symbol (add_symbol, &left, &seg_left, &frag_left))
1918 if (!snapshot_symbol (add_symbol, &left, &seg_left, &frag_left))
1921 if (seg_left != absolute_section)
1924 if (op == O_logical_not)
1926 else if (op == O_uminus)
1938 case O_bit_inclusive_or:
1940 case O_bit_exclusive_or:
1952 if (!snapshot_symbol (add_symbol, &left, &seg_left, &frag_left)
1953 || !snapshot_symbol (op_symbol, &right, &seg_right, &frag_right))
1956 /* Simplify addition or subtraction of a constant by folding the
1957 constant into X_add_number. */
1960 if (seg_right == absolute_section)
1966 else if (seg_left == absolute_section)
1970 seg_left = seg_right;
1971 expressionP->X_add_symbol = expressionP->X_op_symbol;
1976 else if (op == O_subtract)
1978 if (seg_right == absolute_section)
1986 /* Equality and non-equality tests are permitted on anything.
1987 Subtraction, and other comparison operators are permitted if
1988 both operands are in the same section. Otherwise, both
1989 operands must be absolute. We already handled the case of
1990 addition or subtraction of a constant above. */
1991 if (!(seg_left == absolute_section
1992 && seg_right == absolute_section)
1993 && !(op == O_eq || op == O_ne)
1994 && !((op == O_subtract
1995 || op == O_lt || op == O_le || op == O_ge || op == O_gt)
1996 && seg_left == seg_right
1997 && (finalize_syms || frag_left == frag_right)
1998 && ((seg_left != undefined_section
1999 && seg_left != reg_section)
2000 || add_symbol == op_symbol)))
2005 case O_add: left += right; break;
2006 case O_subtract: left -= right; break;
2007 case O_multiply: left *= right; break;
2011 left = (offsetT) left / (offsetT) right;
2016 left = (offsetT) left % (offsetT) right;
2018 case O_left_shift: left <<= right; break;
2019 case O_right_shift: left >>= right; break;
2020 case O_bit_inclusive_or: left |= right; break;
2021 case O_bit_or_not: left |= ~right; break;
2022 case O_bit_exclusive_or: left ^= right; break;
2023 case O_bit_and: left &= right; break;
2026 left = (left == right
2027 && seg_left == seg_right
2028 && (finalize_syms || frag_left == frag_right)
2029 && ((seg_left != undefined_section
2030 && seg_left != reg_section)
2031 || add_symbol == op_symbol)
2032 ? ~ (valueT) 0 : 0);
2037 left = (offsetT) left < (offsetT) right ? ~ (valueT) 0 : 0;
2040 left = (offsetT) left <= (offsetT) right ? ~ (valueT) 0 : 0;
2043 left = (offsetT) left >= (offsetT) right ? ~ (valueT) 0 : 0;
2046 left = (offsetT) left > (offsetT) right ? ~ (valueT) 0 : 0;
2048 case O_logical_and: left = left && right; break;
2049 case O_logical_or: left = left || right; break;
2059 if (seg_left == absolute_section)
2061 else if (seg_left == reg_section && final_val == 0)
2064 expressionP->X_op = op;
2066 if (op == O_constant || op == O_register)
2068 expressionP->X_add_number = final_val;
2073 /* This lives here because it belongs equally in expr.c & read.c.
2074 expr.c is just a branch office read.c anyway, and putting it
2075 here lessens the crowd at read.c.
2077 Assume input_line_pointer is at start of symbol name.
2078 Advance input_line_pointer past symbol name.
2079 Turn that character into a '\0', returning its former value.
2080 This allows a string compare (RMS wants symbol names to be strings)
2082 There will always be a char following symbol name, because all good
2083 lines end in end-of-line. */
2086 get_symbol_end (void)
2090 /* We accept \001 in a name in case this is being called with a
2091 constructed string. */
2092 if (is_name_beginner (c = *input_line_pointer++) || c == '\001')
2094 while (is_part_of_name (c = *input_line_pointer++)
2097 if (is_name_ender (c))
2098 c = *input_line_pointer++;
2100 *--input_line_pointer = 0;
2105 get_single_number (void)
2108 operand (&exp, expr_normal);
2109 return exp.X_add_number;