]>
Commit | Line | Data |
---|---|---|
b0699dad | 1 | /* Parse C expressions for cpplib. |
525bc95d | 2 | Copyright (C) 1987, 92, 94, 95, 97, 98, 1999, 2000 Free Software Foundation. |
e38992e8 | 3 | Contributed by Per Bothner, 1994. |
7f2935c7 PB |
4 | |
5 | This program is free software; you can redistribute it and/or modify it | |
6 | under the terms of the GNU General Public License as published by the | |
7 | Free Software Foundation; either version 2, or (at your option) any | |
8 | later version. | |
9 | ||
10 | This program is distributed in the hope that it will be useful, | |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 | GNU General Public License for more details. | |
14 | ||
15 | You should have received a copy of the GNU General Public License | |
16 | along with this program; if not, write to the Free Software | |
940d9d63 | 17 | Foundation, 59 Temple Place - Suite 330, |
e38992e8 | 18 | Boston, MA 02111-1307, USA. */ |
7f2935c7 PB |
19 | |
20 | /* Parse a C expression from text in a string */ | |
21 | ||
22 | #include "config.h" | |
b04cd507 | 23 | #include "system.h" |
487a6e06 | 24 | #include "cpplib.h" |
88ae23e7 | 25 | #include "cpphash.h" |
d8ea8f28 | 26 | #include "defaults.h" |
7f2935c7 PB |
27 | |
28 | #ifndef MAX_CHAR_TYPE_SIZE | |
29 | #define MAX_CHAR_TYPE_SIZE CHAR_TYPE_SIZE | |
30 | #endif | |
31 | ||
32 | #ifndef MAX_INT_TYPE_SIZE | |
33 | #define MAX_INT_TYPE_SIZE INT_TYPE_SIZE | |
34 | #endif | |
35 | ||
36 | #ifndef MAX_LONG_TYPE_SIZE | |
37 | #define MAX_LONG_TYPE_SIZE LONG_TYPE_SIZE | |
38 | #endif | |
39 | ||
40 | #ifndef MAX_WCHAR_TYPE_SIZE | |
41 | #define MAX_WCHAR_TYPE_SIZE WCHAR_TYPE_SIZE | |
42 | #endif | |
43 | ||
e915b770 | 44 | #define MAX_CHAR_TYPE_MASK (MAX_CHAR_TYPE_SIZE < HOST_BITS_PER_WIDEST_INT \ |
b22ef131 NB |
45 | ? (~(~(HOST_WIDEST_INT) 0 << MAX_CHAR_TYPE_SIZE)) \ |
46 | : ~ (HOST_WIDEST_INT) 0) | |
f1a86df6 | 47 | |
e915b770 | 48 | #define MAX_WCHAR_TYPE_MASK (MAX_WCHAR_TYPE_SIZE < HOST_BITS_PER_WIDEST_INT \ |
b0699dad | 49 | ? ~(~(HOST_WIDEST_INT) 0 << MAX_WCHAR_TYPE_SIZE) \ |
e915b770 | 50 | : ~ (HOST_WIDEST_INT) 0) |
f1a86df6 | 51 | |
7f2935c7 PB |
52 | /* Yield nonzero if adding two numbers with A's and B's signs can yield a |
53 | number with SUM's sign, where A, B, and SUM are all C integers. */ | |
54 | #define possible_sum_sign(a, b, sum) ((((a) ^ (b)) | ~ ((a) ^ (sum))) < 0) | |
55 | ||
b04cd507 | 56 | static void integer_overflow PARAMS ((cpp_reader *)); |
b0699dad | 57 | static HOST_WIDEST_INT left_shift PARAMS ((cpp_reader *, HOST_WIDEST_INT, |
e23c0ba3 ZW |
58 | unsigned int, |
59 | unsigned HOST_WIDEST_INT)); | |
b0699dad | 60 | static HOST_WIDEST_INT right_shift PARAMS ((cpp_reader *, HOST_WIDEST_INT, |
e23c0ba3 ZW |
61 | unsigned int, |
62 | unsigned HOST_WIDEST_INT)); | |
cf00a885 ZW |
63 | static struct op parse_number PARAMS ((cpp_reader *, const cpp_token *)); |
64 | static struct op parse_charconst PARAMS ((cpp_reader *, const cpp_token *)); | |
65 | static struct op parse_defined PARAMS ((cpp_reader *)); | |
cf00a885 ZW |
66 | static HOST_WIDEST_INT parse_escape PARAMS ((cpp_reader *, const U_CHAR **, |
67 | const U_CHAR *, HOST_WIDEST_INT)); | |
93c80368 NB |
68 | static struct op lex PARAMS ((cpp_reader *, int, cpp_token *)); |
69 | static const unsigned char *op_as_text PARAMS ((cpp_reader *, enum cpp_ttype)); | |
cf00a885 ZW |
70 | |
71 | struct op | |
b0699dad | 72 | { |
cf00a885 | 73 | enum cpp_ttype op; |
4063b943 | 74 | U_CHAR prio; /* Priority of op. */ |
e23c0ba3 | 75 | U_CHAR flags; |
4063b943 NB |
76 | U_CHAR unsignedp; /* True if value should be treated as unsigned. */ |
77 | HOST_WIDEST_INT value; /* The value logically "right" of op. */ | |
7f2935c7 | 78 | }; |
7f2935c7 | 79 | |
cf00a885 ZW |
80 | /* There is no "error" token, but we can't get comments in #if, so we can |
81 | abuse that token type. */ | |
82 | #define CPP_ERROR CPP_COMMENT | |
83 | ||
15dad1d9 ZW |
84 | /* With -O2, gcc appears to produce nice code, moving the error |
85 | message load and subsequent jump completely out of the main path. */ | |
86 | #define CPP_ICE(msgid) \ | |
87 | do { cpp_ice (pfile, msgid); goto syntax_error; } while(0) | |
88 | #define SYNTAX_ERROR(msgid) \ | |
89 | do { cpp_error (pfile, msgid); goto syntax_error; } while(0) | |
90 | #define SYNTAX_ERROR2(msgid, arg) \ | |
91 | do { cpp_error (pfile, msgid, arg); goto syntax_error; } while(0) | |
92 | ||
f13eb63a ZW |
93 | /* Parse and convert an integer for #if. Accepts decimal, hex, or octal |
94 | with or without size suffixes. */ | |
cf00a885 ZW |
95 | struct suffix |
96 | { | |
97 | unsigned char s[4]; | |
98 | unsigned char u; | |
99 | unsigned char l; | |
100 | }; | |
101 | ||
102 | const struct suffix vsuf_1[] = { | |
103 | { "u", 1, 0 }, { "U", 1, 0 }, | |
104 | { "l", 0, 1 }, { "L", 0, 1 } | |
105 | }; | |
106 | ||
107 | const struct suffix vsuf_2[] = { | |
108 | { "ul", 1, 1 }, { "UL", 1, 1 }, { "uL", 1, 1 }, { "Ul", 1, 1 }, | |
109 | { "lu", 1, 1 }, { "LU", 1, 1 }, { "Lu", 1, 1 }, { "lU", 1, 1 }, | |
110 | { "ll", 0, 2 }, { "LL", 0, 2 } | |
111 | }; | |
7f2935c7 | 112 | |
cf00a885 ZW |
113 | const struct suffix vsuf_3[] = { |
114 | { "ull", 1, 2 }, { "ULL", 1, 2 }, { "uLL", 1, 2 }, { "Ull", 1, 2 }, | |
115 | { "llu", 1, 2 }, { "LLU", 1, 2 }, { "LLu", 1, 2 }, { "llU", 1, 2 } | |
116 | }; | |
117 | #define Nsuff(tab) (sizeof tab / sizeof (struct suffix)) | |
118 | ||
119 | static struct op | |
120 | parse_number (pfile, tok) | |
7f2935c7 | 121 | cpp_reader *pfile; |
cf00a885 | 122 | const cpp_token *tok; |
7f2935c7 | 123 | { |
cf00a885 | 124 | struct op op; |
bfb9dc7f ZW |
125 | const U_CHAR *start = tok->val.str.text; |
126 | const U_CHAR *end = start + tok->val.str.len; | |
cf00a885 | 127 | const U_CHAR *p = start; |
bfb9dc7f | 128 | int c = 0, i, nsuff; |
e915b770 | 129 | unsigned HOST_WIDEST_INT n = 0, nd, MAX_over_base; |
f13eb63a ZW |
130 | int base = 10; |
131 | int overflow = 0; | |
132 | int digit, largest_digit = 0; | |
cf00a885 | 133 | const struct suffix *sufftab; |
7f2935c7 PB |
134 | |
135 | op.unsignedp = 0; | |
136 | ||
f13eb63a ZW |
137 | if (p[0] == '0') |
138 | { | |
139 | if (end - start >= 3 && (p[1] == 'x' || p[1] == 'X')) | |
140 | { | |
141 | p += 2; | |
142 | base = 16; | |
143 | } | |
144 | else | |
145 | { | |
146 | p += 1; | |
147 | base = 8; | |
148 | } | |
7f2935c7 PB |
149 | } |
150 | ||
0f41302f | 151 | /* Some buggy compilers (e.g. MPW C) seem to need both casts. */ |
e915b770 KG |
152 | MAX_over_base = (((unsigned HOST_WIDEST_INT) -1) |
153 | / ((unsigned HOST_WIDEST_INT) base)); | |
7f2935c7 | 154 | |
cf00a885 | 155 | for(; p < end; p++) |
f13eb63a | 156 | { |
cf00a885 | 157 | c = *p; |
f13eb63a ZW |
158 | |
159 | if (c >= '0' && c <= '9') | |
160 | digit = c - '0'; | |
cf00a885 ZW |
161 | /* We believe that in all live character sets, a-f are |
162 | consecutive, and so are A-F. */ | |
b22ef131 | 163 | else if (base == 16 && c >= 'a' && c <= 'f') |
f13eb63a ZW |
164 | digit = c - 'a' + 10; |
165 | else if (base == 16 && c >= 'A' && c <= 'F') | |
166 | digit = c - 'A' + 10; | |
f13eb63a | 167 | else |
cf00a885 ZW |
168 | break; |
169 | ||
f13eb63a ZW |
170 | if (largest_digit < digit) |
171 | largest_digit = digit; | |
172 | nd = n * base + digit; | |
173 | overflow |= MAX_over_base < n || nd < n; | |
174 | n = nd; | |
7f2935c7 | 175 | } |
7f2935c7 | 176 | |
cf00a885 | 177 | if (p < end) |
f13eb63a | 178 | { |
cf00a885 ZW |
179 | /* Check for a floating point constant. Note that float constants |
180 | with an exponent or suffix but no decimal point are technically | |
5ef865d5 | 181 | invalid (C99 6.4.4.2) but accepted elsewhere. */ |
cf00a885 ZW |
182 | if ((c == '.' || c == 'F' || c == 'f') |
183 | || (base == 10 && (c == 'E' || c == 'e') | |
184 | && p+1 < end && (p[1] == '+' || p[1] == '-')) | |
185 | || (base == 16 && (c == 'P' || c == 'p') | |
186 | && p+1 < end && (p[1] == '+' || p[1] == '-'))) | |
187 | SYNTAX_ERROR ("floating point numbers are not valid in #if"); | |
188 | ||
189 | /* Determine the suffix. l means long, and u means unsigned. | |
190 | See the suffix tables, above. */ | |
191 | switch (end - p) | |
192 | { | |
193 | case 1: sufftab = vsuf_1; nsuff = Nsuff(vsuf_1); break; | |
194 | case 2: sufftab = vsuf_2; nsuff = Nsuff(vsuf_2); break; | |
195 | case 3: sufftab = vsuf_3; nsuff = Nsuff(vsuf_3); break; | |
196 | default: goto invalid_suffix; | |
197 | } | |
198 | ||
199 | for (i = 0; i < nsuff; i++) | |
200 | if (memcmp (p, sufftab[i].s, end - p) == 0) | |
201 | break; | |
202 | if (i == nsuff) | |
203 | goto invalid_suffix; | |
204 | op.unsignedp = sufftab[i].u; | |
205 | ||
7da92c08 KG |
206 | if (CPP_WTRADITIONAL (pfile) && sufftab[i].u) |
207 | cpp_warning (pfile, "traditional C rejects the `U' suffix"); | |
cf00a885 ZW |
208 | if (CPP_OPTION (pfile, c89) && sufftab[i].l == 2) |
209 | SYNTAX_ERROR ("too many 'l' suffixes in integer constant"); | |
f13eb63a ZW |
210 | } |
211 | ||
7f2935c7 | 212 | if (base <= largest_digit) |
cf00a885 | 213 | cpp_pedwarn (pfile, "integer constant contains digits beyond the radix"); |
7f2935c7 PB |
214 | |
215 | if (overflow) | |
7c4033ff | 216 | cpp_pedwarn (pfile, "integer constant out of range"); |
7f2935c7 PB |
217 | |
218 | /* If too big to be signed, consider it unsigned. */ | |
e915b770 | 219 | else if ((HOST_WIDEST_INT) n < 0 && ! op.unsignedp) |
7f2935c7 PB |
220 | { |
221 | if (base == 10) | |
cf00a885 | 222 | cpp_warning (pfile, "integer constant is so large that it is unsigned"); |
7f2935c7 PB |
223 | op.unsignedp = 1; |
224 | } | |
225 | ||
226 | op.value = n; | |
cf00a885 | 227 | op.op = CPP_INT; |
7f2935c7 | 228 | return op; |
f13eb63a | 229 | |
cf00a885 ZW |
230 | invalid_suffix: |
231 | cpp_error (pfile, "invalid suffix '%.*s' on integer constant", | |
232 | (int) (end - p), p); | |
233 | syntax_error: | |
234 | op.op = CPP_ERROR; | |
f13eb63a | 235 | return op; |
7f2935c7 PB |
236 | } |
237 | ||
f13eb63a ZW |
238 | /* Parse and convert a character constant for #if. Understands backslash |
239 | escapes (\n, \031) and multibyte characters (if so configured). */ | |
cf00a885 ZW |
240 | static struct op |
241 | parse_charconst (pfile, tok) | |
f13eb63a | 242 | cpp_reader *pfile; |
cf00a885 | 243 | const cpp_token *tok; |
f13eb63a | 244 | { |
cf00a885 | 245 | struct op op; |
e915b770 | 246 | HOST_WIDEST_INT result = 0; |
f13eb63a ZW |
247 | int num_chars = 0; |
248 | int num_bits; | |
249 | unsigned int width = MAX_CHAR_TYPE_SIZE, mask = MAX_CHAR_TYPE_MASK; | |
250 | int max_chars; | |
bfb9dc7f ZW |
251 | const U_CHAR *ptr = tok->val.str.text; |
252 | const U_CHAR *end = ptr + tok->val.str.len; | |
f13eb63a | 253 | |
099a9dd0 | 254 | int c = -1; |
f13eb63a | 255 | |
cf00a885 ZW |
256 | if (tok->type == CPP_WCHAR) |
257 | width = MAX_WCHAR_TYPE_SIZE, mask = MAX_WCHAR_TYPE_MASK; | |
f13eb63a ZW |
258 | max_chars = MAX_LONG_TYPE_SIZE / width; |
259 | ||
f13eb63a ZW |
260 | while (ptr < end) |
261 | { | |
f13eb63a | 262 | c = *ptr++; |
64aaf407 | 263 | if (c == '\'') |
cf00a885 | 264 | CPP_ICE ("unescaped ' in character constant"); |
f13eb63a ZW |
265 | else if (c == '\\') |
266 | { | |
cf00a885 | 267 | c = parse_escape (pfile, &ptr, end, mask); |
f13eb63a ZW |
268 | if (width < HOST_BITS_PER_INT |
269 | && (unsigned int) c >= (unsigned int)(1 << width)) | |
b22ef131 NB |
270 | cpp_pedwarn (pfile, |
271 | "escape sequence out of range for character"); | |
f13eb63a ZW |
272 | } |
273 | ||
274 | /* Merge character into result; ignore excess chars. */ | |
275 | if (++num_chars <= max_chars) | |
276 | { | |
277 | if (width < HOST_BITS_PER_INT) | |
278 | result = (result << width) | (c & ((1 << width) - 1)); | |
279 | else | |
280 | result = c; | |
281 | } | |
282 | } | |
283 | ||
284 | if (num_chars == 0) | |
cf00a885 | 285 | SYNTAX_ERROR ("empty character constant"); |
f13eb63a | 286 | else if (num_chars > max_chars) |
cf00a885 | 287 | SYNTAX_ERROR ("character constant too long"); |
f9a0e96c | 288 | else if (num_chars != 1) |
f13eb63a ZW |
289 | cpp_warning (pfile, "multi-character character constant"); |
290 | ||
291 | /* If char type is signed, sign-extend the constant. */ | |
292 | num_bits = num_chars * width; | |
293 | ||
93c80368 | 294 | if (pfile->spec_nodes.n__CHAR_UNSIGNED__->type == NT_MACRO |
f13eb63a | 295 | || ((result >> (num_bits - 1)) & 1) == 0) |
ca261cb4 KG |
296 | op.value = result & ((unsigned HOST_WIDEST_INT) ~0 |
297 | >> (HOST_BITS_PER_WIDEST_INT - num_bits)); | |
f13eb63a | 298 | else |
ca261cb4 KG |
299 | op.value = result | ~((unsigned HOST_WIDEST_INT) ~0 |
300 | >> (HOST_BITS_PER_WIDEST_INT - num_bits)); | |
f13eb63a ZW |
301 | |
302 | /* This is always a signed type. */ | |
303 | op.unsignedp = 0; | |
cf00a885 | 304 | op.op = CPP_INT; |
f13eb63a ZW |
305 | return op; |
306 | ||
cf00a885 ZW |
307 | syntax_error: |
308 | op.op = CPP_ERROR; | |
f13eb63a ZW |
309 | return op; |
310 | } | |
311 | ||
cf00a885 | 312 | static struct op |
ba412f14 ZW |
313 | parse_defined (pfile) |
314 | cpp_reader *pfile; | |
315 | { | |
93c80368 NB |
316 | int paren = 0; |
317 | cpp_hashnode *node = 0; | |
318 | cpp_token token; | |
cf00a885 | 319 | struct op op; |
ba412f14 | 320 | |
93c80368 NB |
321 | /* Don't expand macros. */ |
322 | pfile->state.prevent_expansion++; | |
323 | ||
324 | _cpp_get_token (pfile, &token); | |
325 | if (token.type == CPP_OPEN_PAREN) | |
ba412f14 | 326 | { |
cf00a885 | 327 | paren = 1; |
93c80368 | 328 | _cpp_get_token (pfile, &token); |
ba412f14 ZW |
329 | } |
330 | ||
93c80368 NB |
331 | if (token.type == CPP_NAME) |
332 | { | |
333 | node = token.val.node; | |
334 | if (paren) | |
335 | { | |
336 | _cpp_get_token (pfile, &token); | |
337 | if (token.type != CPP_CLOSE_PAREN) | |
338 | { | |
339 | cpp_error (pfile, "missing ')' after \"defined\""); | |
340 | node = 0; | |
341 | } | |
342 | } | |
343 | } | |
344 | else | |
345 | cpp_error (pfile, "\"defined\" without an identifier"); | |
15dad1d9 | 346 | |
93c80368 NB |
347 | if (!node) |
348 | op.op = CPP_ERROR; | |
349 | else | |
15dad1d9 | 350 | { |
93c80368 | 351 | op.value = node->type == NT_MACRO; |
cf00a885 | 352 | op.unsignedp = 0; |
93c80368 | 353 | op.op = CPP_INT; |
15dad1d9 | 354 | |
93c80368 NB |
355 | /* No macros? At top of file? */ |
356 | if (pfile->mi_state == MI_OUTSIDE && pfile->mi_cmacro == 0 | |
357 | && pfile->mi_if_not_defined == MI_IND_NOT && pfile->mi_lexed == 1) | |
358 | { | |
359 | cpp_start_lookahead (pfile); | |
360 | cpp_get_token (pfile, &token); | |
361 | if (token.type == CPP_EOF) | |
362 | pfile->mi_ind_cmacro = node; | |
363 | cpp_stop_lookahead (pfile, 0); | |
364 | } | |
15dad1d9 | 365 | } |
93c80368 NB |
366 | |
367 | pfile->state.prevent_expansion--; | |
15dad1d9 | 368 | return op; |
15dad1d9 ZW |
369 | } |
370 | ||
0f41302f | 371 | /* Read one token. */ |
7f2935c7 | 372 | |
cf00a885 | 373 | static struct op |
93c80368 | 374 | lex (pfile, skip_evaluation, token) |
52529158 | 375 | cpp_reader *pfile; |
c9666c01 | 376 | int skip_evaluation; |
93c80368 | 377 | cpp_token *token; |
7f2935c7 | 378 | { |
cf00a885 | 379 | struct op op; |
7f2935c7 | 380 | |
041c3194 | 381 | retry: |
93c80368 | 382 | _cpp_get_token (pfile, token); |
041c3194 | 383 | |
93c80368 | 384 | switch (token->type) |
ba412f14 | 385 | { |
041c3194 | 386 | case CPP_PLACEMARKER: |
041c3194 ZW |
387 | goto retry; |
388 | ||
cf00a885 | 389 | case CPP_INT: |
7f2935c7 | 390 | case CPP_NUMBER: |
93c80368 | 391 | return parse_number (pfile, token); |
cf00a885 ZW |
392 | case CPP_CHAR: |
393 | case CPP_WCHAR: | |
93c80368 | 394 | return parse_charconst (pfile, token); |
cf00a885 | 395 | |
7f2935c7 | 396 | case CPP_STRING: |
525bc95d | 397 | case CPP_WSTRING: |
cf00a885 | 398 | SYNTAX_ERROR ("string constants are not valid in #if"); |
525bc95d | 399 | |
cf00a885 ZW |
400 | case CPP_FLOAT: |
401 | SYNTAX_ERROR ("floating point numbers are not valid in #if"); | |
402 | ||
403 | case CPP_OTHER: | |
93c80368 NB |
404 | if (ISGRAPH (token->val.aux)) |
405 | SYNTAX_ERROR2 ("invalid character '%c' in #if", token->val.aux); | |
cf00a885 | 406 | else |
93c80368 | 407 | SYNTAX_ERROR2 ("invalid character '\\%03o' in #if", token->val.aux); |
ba412f14 | 408 | |
92936ecf | 409 | case CPP_NAME: |
93c80368 NB |
410 | if (token->val.node == pfile->spec_nodes.n_defined) |
411 | { | |
412 | if (pfile->context->prev && CPP_PEDANTIC (pfile)) | |
413 | cpp_pedwarn (pfile, "\"defined\" operator appears during macro expansion"); | |
414 | ||
415 | return parse_defined (pfile); | |
416 | } | |
417 | /* Controlling #if expressions cannot contain identifiers (they | |
418 | could become macros in the future). */ | |
419 | pfile->mi_state = MI_FAILED; | |
420 | ||
cf00a885 | 421 | op.op = CPP_INT; |
f13eb63a ZW |
422 | op.unsignedp = 0; |
423 | op.value = 0; | |
5dfa4da1 | 424 | |
ae79697b | 425 | if (CPP_OPTION (pfile, warn_undef) && !skip_evaluation) |
93c80368 NB |
426 | cpp_warning (pfile, "\"%s\" is not defined", token->val.node->name); |
427 | ||
5dfa4da1 ZW |
428 | return op; |
429 | ||
15dad1d9 | 430 | case CPP_HASH: |
93c80368 NB |
431 | { |
432 | int temp; | |
433 | ||
434 | op.op = CPP_INT; | |
435 | if (_cpp_test_assertion (pfile, &temp)) | |
436 | op.op = CPP_ERROR; | |
437 | op.unsignedp = 0; | |
438 | op.value = temp; | |
439 | return op; | |
440 | } | |
441 | ||
442 | case CPP_NOT: | |
443 | /* We don't worry about its position here. */ | |
444 | pfile->mi_if_not_defined = MI_IND_NOT; | |
445 | /* Fall through. */ | |
7f2935c7 | 446 | |
041c3194 | 447 | default: |
93c80368 NB |
448 | if ((token->type > CPP_EQ && token->type < CPP_PLUS_EQ) |
449 | || token->type == CPP_EOF) | |
cf00a885 | 450 | { |
93c80368 | 451 | op.op = token->type; |
7f2935c7 PB |
452 | return op; |
453 | } | |
7f2935c7 | 454 | |
93c80368 NB |
455 | SYNTAX_ERROR2 ("\"%s\" is not valid in #if expressions", |
456 | cpp_token_as_text (pfile, token)); | |
457 | } | |
7c3bb1de | 458 | |
cf00a885 ZW |
459 | syntax_error: |
460 | op.op = CPP_ERROR; | |
461 | return op; | |
7c3bb1de | 462 | } |
7f2935c7 PB |
463 | |
464 | /* Parse a C escape sequence. STRING_PTR points to a variable | |
465 | containing a pointer to the string to parse. That pointer | |
466 | is updated past the characters we use. The value of the | |
467 | escape sequence is returned. | |
468 | ||
7f2935c7 PB |
469 | If \ is followed by 000, we return 0 and leave the string pointer |
470 | after the zeros. A value of 0 does not mean end of string. */ | |
471 | ||
a2c8e144 | 472 | static HOST_WIDEST_INT |
cf00a885 | 473 | parse_escape (pfile, string_ptr, limit, result_mask) |
7f2935c7 | 474 | cpp_reader *pfile; |
cf00a885 ZW |
475 | const U_CHAR **string_ptr; |
476 | const U_CHAR *limit; | |
e915b770 | 477 | HOST_WIDEST_INT result_mask; |
7f2935c7 | 478 | { |
cf00a885 ZW |
479 | const U_CHAR *ptr = *string_ptr; |
480 | /* We know we have at least one following character. */ | |
481 | int c = *ptr++; | |
7f2935c7 PB |
482 | switch (c) |
483 | { | |
cf00a885 ZW |
484 | case 'a': c = TARGET_BELL; break; |
485 | case 'b': c = TARGET_BS; break; | |
486 | case 'f': c = TARGET_FF; break; | |
487 | case 'n': c = TARGET_NEWLINE; break; | |
488 | case 'r': c = TARGET_CR; break; | |
489 | case 't': c = TARGET_TAB; break; | |
490 | case 'v': c = TARGET_VT; break; | |
491 | ||
492 | case 'e': case 'E': | |
ae79697b | 493 | if (CPP_PEDANTIC (pfile)) |
041c3194 | 494 | cpp_pedwarn (pfile, "non-ISO-standard escape sequence, '\\%c'", c); |
cf00a885 ZW |
495 | c = TARGET_ESC; |
496 | break; | |
7f2935c7 | 497 | |
cf00a885 ZW |
498 | case '0': case '1': case '2': case '3': |
499 | case '4': case '5': case '6': case '7': | |
7f2935c7 | 500 | { |
cf00a885 ZW |
501 | unsigned int i = c - '0'; |
502 | int count = 0; | |
7f2935c7 PB |
503 | while (++count < 3) |
504 | { | |
cf00a885 ZW |
505 | if (ptr >= limit) |
506 | break; | |
507 | ||
508 | c = *ptr; | |
509 | if (c < '0' || c > '7') | |
510 | break; | |
511 | ptr++; | |
512 | i = (i << 3) + c - '0'; | |
7f2935c7 | 513 | } |
f1a86df6 | 514 | if (i != (i & result_mask)) |
7f2935c7 | 515 | { |
f1a86df6 ZW |
516 | i &= result_mask; |
517 | cpp_pedwarn (pfile, "octal escape sequence out of range"); | |
7f2935c7 | 518 | } |
cf00a885 ZW |
519 | c = i; |
520 | break; | |
7f2935c7 | 521 | } |
cf00a885 | 522 | |
7f2935c7 PB |
523 | case 'x': |
524 | { | |
cf00a885 ZW |
525 | unsigned int i = 0, overflow = 0; |
526 | int digits_found = 0, digit; | |
7f2935c7 PB |
527 | for (;;) |
528 | { | |
cf00a885 ZW |
529 | if (ptr >= limit) |
530 | break; | |
531 | c = *ptr; | |
7f2935c7 PB |
532 | if (c >= '0' && c <= '9') |
533 | digit = c - '0'; | |
534 | else if (c >= 'a' && c <= 'f') | |
535 | digit = c - 'a' + 10; | |
536 | else if (c >= 'A' && c <= 'F') | |
537 | digit = c - 'A' + 10; | |
538 | else | |
cf00a885 ZW |
539 | break; |
540 | ptr++; | |
7f2935c7 PB |
541 | overflow |= i ^ (i << 4 >> 4); |
542 | i = (i << 4) + digit; | |
543 | digits_found = 1; | |
544 | } | |
545 | if (!digits_found) | |
546 | cpp_error (pfile, "\\x used with no following hex digits"); | |
f1a86df6 | 547 | if (overflow | (i != (i & result_mask))) |
7f2935c7 | 548 | { |
f1a86df6 ZW |
549 | i &= result_mask; |
550 | cpp_pedwarn (pfile, "hex escape sequence out of range"); | |
7f2935c7 | 551 | } |
cf00a885 ZW |
552 | c = i; |
553 | break; | |
7f2935c7 | 554 | } |
7f2935c7 | 555 | } |
cf00a885 ZW |
556 | *string_ptr = ptr; |
557 | return c; | |
7f2935c7 PB |
558 | } |
559 | ||
560 | static void | |
561 | integer_overflow (pfile) | |
562 | cpp_reader *pfile; | |
563 | { | |
564 | if (CPP_PEDANTIC (pfile)) | |
565 | cpp_pedwarn (pfile, "integer overflow in preprocessor expression"); | |
566 | } | |
567 | ||
ca261cb4 | 568 | static HOST_WIDEST_INT |
7f2935c7 PB |
569 | left_shift (pfile, a, unsignedp, b) |
570 | cpp_reader *pfile; | |
ca261cb4 | 571 | HOST_WIDEST_INT a; |
e23c0ba3 | 572 | unsigned int unsignedp; |
ca261cb4 | 573 | unsigned HOST_WIDEST_INT b; |
7f2935c7 | 574 | { |
ca261cb4 | 575 | if (b >= HOST_BITS_PER_WIDEST_INT) |
7f2935c7 PB |
576 | { |
577 | if (! unsignedp && a != 0) | |
578 | integer_overflow (pfile); | |
579 | return 0; | |
580 | } | |
581 | else if (unsignedp) | |
ca261cb4 | 582 | return (unsigned HOST_WIDEST_INT) a << b; |
7f2935c7 PB |
583 | else |
584 | { | |
ca261cb4 | 585 | HOST_WIDEST_INT l = a << b; |
7f2935c7 PB |
586 | if (l >> b != a) |
587 | integer_overflow (pfile); | |
588 | return l; | |
589 | } | |
590 | } | |
591 | ||
ca261cb4 | 592 | static HOST_WIDEST_INT |
7f2935c7 | 593 | right_shift (pfile, a, unsignedp, b) |
d6f4ec51 | 594 | cpp_reader *pfile ATTRIBUTE_UNUSED; |
ca261cb4 | 595 | HOST_WIDEST_INT a; |
e23c0ba3 | 596 | unsigned int unsignedp; |
ca261cb4 | 597 | unsigned HOST_WIDEST_INT b; |
7f2935c7 | 598 | { |
ca261cb4 KG |
599 | if (b >= HOST_BITS_PER_WIDEST_INT) |
600 | return unsignedp ? 0 : a >> (HOST_BITS_PER_WIDEST_INT - 1); | |
7f2935c7 | 601 | else if (unsignedp) |
ca261cb4 | 602 | return (unsigned HOST_WIDEST_INT) a >> b; |
7f2935c7 PB |
603 | else |
604 | return a >> b; | |
605 | } | |
606 | \f | |
4063b943 | 607 | /* Operator precedence and flags table. |
dbac4aff NB |
608 | |
609 | After an operator is returned from the lexer, if it has priority less | |
610 | than or equal to the operator on the top of the stack, we reduce the | |
4063b943 NB |
611 | stack by one operator and repeat the test. Since equal priorities |
612 | reduce, this is naturally left-associative. | |
dbac4aff NB |
613 | |
614 | We handle right-associative operators by clearing the lower bit of all | |
615 | left-associative operators, and setting it for right-associative ones. | |
4063b943 NB |
616 | After the reduction phase of a new operator, just before it is pushed |
617 | onto the stack, its RIGHT_ASSOC bit is cleared. The effect is that | |
618 | during the reduction phase, the current right-associative operator has | |
619 | a priority one greater than any other operator of otherwise equal | |
620 | precedence that has been pushed on the top of the stack. This avoids | |
621 | a reduction pass, and effectively makes the logic right-associative. | |
dbac4aff NB |
622 | |
623 | The remaining cases are '(' and ')'. We handle '(' by skipping the | |
624 | reduction phase completely. ')' is given lower priority than | |
625 | everything else, including '(', effectively forcing a reduction of the | |
4063b943 NB |
626 | parenthesised expression. If there is no matching '(', the stack will |
627 | be reduced all the way to the beginning, exiting the parser in the | |
628 | same way as the ultra-low priority end-of-expression dummy operator. | |
629 | The exit code checks to see if the operator that caused it is ')', and | |
630 | if so outputs an appropriate error message. | |
631 | ||
632 | The parser assumes all shifted operators require a right operand | |
633 | unless the flag NO_R_OPERAND is set, and similarly for NO_L_OPERAND. | |
634 | These semantics are automatically checked, any extra semantics need to | |
635 | be handled with operator-specific code. */ | |
636 | ||
637 | #define FLAG_BITS 8 | |
638 | #define FLAG_MASK ((1 << FLAG_BITS) - 1) | |
639 | #define PRIO_SHIFT (FLAG_BITS + 1) | |
640 | #define EXTRACT_PRIO(cnst) (cnst >> FLAG_BITS) | |
641 | #define EXTRACT_FLAGS(cnst) (cnst & FLAG_MASK) | |
642 | ||
643 | /* Flags. */ | |
644 | #define HAVE_VALUE (1 << 0) | |
645 | #define NO_L_OPERAND (1 << 1) | |
646 | #define NO_R_OPERAND (1 << 2) | |
647 | #define SHORT_CIRCUIT (1 << 3) | |
648 | ||
649 | /* Priority and flag combinations. */ | |
650 | #define RIGHT_ASSOC (1 << FLAG_BITS) | |
651 | #define FORCE_REDUCE_PRIO (0 << PRIO_SHIFT) | |
652 | #define CLOSE_PAREN_PRIO (1 << PRIO_SHIFT) | |
653 | #define OPEN_PAREN_PRIO ((2 << PRIO_SHIFT) | NO_L_OPERAND) | |
654 | #define COMMA_PRIO (3 << PRIO_SHIFT) | |
655 | #define COND_PRIO ((4 << PRIO_SHIFT) | RIGHT_ASSOC | SHORT_CIRCUIT) | |
656 | #define COLON_PRIO ((5 << PRIO_SHIFT) | SHORT_CIRCUIT) | |
657 | #define OROR_PRIO ((6 << PRIO_SHIFT) | SHORT_CIRCUIT) | |
658 | #define ANDAND_PRIO ((7 << PRIO_SHIFT) | SHORT_CIRCUIT) | |
659 | #define OR_PRIO (8 << PRIO_SHIFT) | |
660 | #define XOR_PRIO (9 << PRIO_SHIFT) | |
661 | #define AND_PRIO (10 << PRIO_SHIFT) | |
92936ecf ZW |
662 | #define MINMAX_PRIO (11 << PRIO_SHIFT) |
663 | #define EQUAL_PRIO (12 << PRIO_SHIFT) | |
664 | #define LESS_PRIO (13 << PRIO_SHIFT) | |
665 | #define SHIFT_PRIO (14 << PRIO_SHIFT) | |
666 | #define PLUS_PRIO (15 << PRIO_SHIFT) | |
667 | #define MUL_PRIO (16 << PRIO_SHIFT) | |
668 | #define UNARY_PRIO ((17 << PRIO_SHIFT) | RIGHT_ASSOC | NO_L_OPERAND) | |
eba30526 | 669 | |
cf00a885 ZW |
670 | /* Operator to priority map. Must be in the same order as the first |
671 | N entries of enum cpp_ttype. */ | |
672 | static const short | |
673 | op_to_prio[] = | |
674 | { | |
675 | /* EQ */ 0, /* dummy entry - can't happen */ | |
676 | /* NOT */ UNARY_PRIO, | |
677 | /* GREATER */ LESS_PRIO, | |
678 | /* LESS */ LESS_PRIO, | |
679 | /* PLUS */ UNARY_PRIO, /* note these two can be unary */ | |
680 | /* MINUS */ UNARY_PRIO, /* or binary */ | |
681 | /* MULT */ MUL_PRIO, | |
682 | /* DIV */ MUL_PRIO, | |
683 | /* MOD */ MUL_PRIO, | |
684 | /* AND */ AND_PRIO, | |
685 | /* OR */ OR_PRIO, | |
686 | /* XOR */ XOR_PRIO, | |
687 | /* RSHIFT */ SHIFT_PRIO, | |
688 | /* LSHIFT */ SHIFT_PRIO, | |
92936ecf ZW |
689 | /* MIN */ MINMAX_PRIO, /* C++ specific */ |
690 | /* MAX */ MINMAX_PRIO, /* extensions */ | |
cf00a885 ZW |
691 | |
692 | /* COMPL */ UNARY_PRIO, | |
693 | /* AND_AND */ ANDAND_PRIO, | |
694 | /* OR_OR */ OROR_PRIO, | |
695 | /* QUERY */ COND_PRIO, | |
696 | /* COLON */ COLON_PRIO, | |
697 | /* COMMA */ COMMA_PRIO, | |
698 | /* OPEN_PAREN */ OPEN_PAREN_PRIO, | |
699 | /* CLOSE_PAREN */ CLOSE_PAREN_PRIO, | |
700 | /* EQ_EQ */ EQUAL_PRIO, | |
701 | /* NOT_EQ */ EQUAL_PRIO, | |
702 | /* GREATER_EQ */ LESS_PRIO, | |
703 | /* LESS_EQ */ LESS_PRIO | |
704 | }; | |
705 | ||
7f2935c7 | 706 | #define COMPARE(OP) \ |
4063b943 | 707 | top->unsignedp = 0; \ |
b22ef131 | 708 | top->value = (unsigned1 | unsigned2) \ |
4063b943 NB |
709 | ? (unsigned HOST_WIDEST_INT) v1 OP (unsigned HOST_WIDEST_INT) v2 \ |
710 | : (v1 OP v2) | |
711 | #define EQUALITY(OP) \ | |
712 | top->value = v1 OP v2; \ | |
713 | top->unsignedp = 0; | |
cf00a885 | 714 | #define BITWISE(OP) \ |
4063b943 | 715 | top->value = v1 OP v2; \ |
b22ef131 | 716 | top->unsignedp = unsigned1 | unsigned2; |
92936ecf ZW |
717 | #define MINMAX(OP) \ |
718 | top->value = (v1 OP v2) ? v1 : v2; \ | |
719 | top->unsignedp = unsigned1 | unsigned2; | |
cf00a885 ZW |
720 | #define UNARY(OP) \ |
721 | top->value = OP v2; \ | |
722 | top->unsignedp = unsigned2; \ | |
723 | top->flags |= HAVE_VALUE; | |
cf00a885 ZW |
724 | #define SHIFT(PSH, MSH) \ |
725 | if (skip_evaluation) \ | |
726 | break; \ | |
727 | top->unsignedp = unsigned1; \ | |
728 | if (v2 < 0 && ! unsigned2) \ | |
729 | top->value = MSH (pfile, v1, unsigned1, -v2); \ | |
730 | else \ | |
731 | top->value = PSH (pfile, v1, unsigned1, v2); | |
b22ef131 | 732 | |
7f2935c7 | 733 | /* Parse and evaluate a C expression, reading from PFILE. |
88ae23e7 | 734 | Returns the truth value of the expression. */ |
7f2935c7 | 735 | |
88ae23e7 | 736 | int |
b0699dad | 737 | _cpp_parse_expr (pfile) |
7f2935c7 PB |
738 | cpp_reader *pfile; |
739 | { | |
4063b943 NB |
740 | /* The implementation is an operator precedence parser, i.e. a |
741 | bottom-up parser, using a stack for not-yet-reduced tokens. | |
7f2935c7 PB |
742 | |
743 | The stack base is 'stack', and the current stack pointer is 'top'. | |
744 | There is a stack element for each operator (only), | |
745 | and the most recently pushed operator is 'top->op'. | |
746 | An operand (value) is stored in the 'value' field of the stack | |
747 | element of the operator that precedes it. | |
748 | In that case the 'flags' field has the HAVE_VALUE flag set. */ | |
749 | ||
750 | #define INIT_STACK_SIZE 20 | |
cf00a885 ZW |
751 | struct op init_stack[INIT_STACK_SIZE]; |
752 | struct op *stack = init_stack; | |
753 | struct op *limit = stack + INIT_STACK_SIZE; | |
93c80368 | 754 | cpp_token token; |
cf00a885 | 755 | register struct op *top = stack + 1; |
4063b943 | 756 | int skip_evaluation = 0; |
45b966db | 757 | int result; |
7f2935c7 | 758 | |
37dbf7aa | 759 | /* Save parser state and set it to something sane. */ |
37dbf7aa | 760 | int save_skipping = pfile->skipping; |
37dbf7aa ZW |
761 | pfile->skipping = 0; |
762 | ||
93c80368 NB |
763 | /* Set up detection of #if ! defined(). */ |
764 | pfile->mi_lexed = 0; | |
765 | pfile->mi_if_not_defined = MI_IND_NONE; | |
766 | ||
4063b943 | 767 | /* We've finished when we try to reduce this. */ |
cf00a885 | 768 | top->op = CPP_EOF; |
4063b943 NB |
769 | /* Nifty way to catch missing '('. */ |
770 | top->prio = EXTRACT_PRIO(CLOSE_PAREN_PRIO); | |
771 | /* Avoid missing right operand checks. */ | |
772 | top->flags = NO_R_OPERAND; | |
773 | ||
7f2935c7 PB |
774 | for (;;) |
775 | { | |
dbac4aff | 776 | unsigned int prio; |
4063b943 | 777 | unsigned int flags; |
cf00a885 | 778 | struct op op; |
7f2935c7 PB |
779 | |
780 | /* Read a token */ | |
93c80368 NB |
781 | op = lex (pfile, skip_evaluation, &token); |
782 | pfile->mi_lexed++; | |
7f2935c7 | 783 | |
4063b943 NB |
784 | /* If the token is an operand, push its value and get next |
785 | token. If it is an operator, get its priority and flags, and | |
786 | try to reduce the expression on the stack. */ | |
7f2935c7 PB |
787 | switch (op.op) |
788 | { | |
cf00a885 | 789 | case CPP_ERROR: |
9ee70313 | 790 | goto syntax_error; |
b22ef131 | 791 | push_immediate: |
cf00a885 | 792 | case CPP_INT: |
9ee70313 | 793 | /* Push a value onto the stack. */ |
cf4ed945 | 794 | if (top->flags & HAVE_VALUE) |
b22ef131 | 795 | SYNTAX_ERROR ("missing binary operator"); |
9ee70313 NB |
796 | top->value = op.value; |
797 | top->unsignedp = op.unsignedp; | |
798 | top->flags |= HAVE_VALUE; | |
799 | continue; | |
800 | ||
cf00a885 ZW |
801 | case CPP_EOF: prio = FORCE_REDUCE_PRIO; break; |
802 | case CPP_PLUS: | |
803 | case CPP_MINUS: prio = PLUS_PRIO; if (top->flags & HAVE_VALUE) break; | |
4063b943 | 804 | /* else unary; fall through */ |
cf00a885 | 805 | default: prio = op_to_prio[op.op]; break; |
7f2935c7 | 806 | } |
7f2935c7 | 807 | |
4063b943 NB |
808 | /* Separate the operator's code into priority and flags. */ |
809 | flags = EXTRACT_FLAGS(prio); | |
810 | prio = EXTRACT_PRIO(prio); | |
cf00a885 | 811 | if (prio == EXTRACT_PRIO(OPEN_PAREN_PRIO)) |
4063b943 | 812 | goto skip_reduction; |
cf4ed945 | 813 | |
dbac4aff NB |
814 | /* Check for reductions. Then push the operator. */ |
815 | while (prio <= top->prio) | |
7f2935c7 | 816 | { |
4063b943 NB |
817 | HOST_WIDEST_INT v1, v2; |
818 | unsigned int unsigned1, unsigned2; | |
819 | ||
820 | /* Most operators that can appear on the stack require a | |
821 | right operand. Check this before trying to reduce. */ | |
822 | if ((top->flags & (HAVE_VALUE | NO_R_OPERAND)) == 0) | |
7f2935c7 | 823 | { |
cf00a885 | 824 | if (top->op == CPP_OPEN_PAREN) |
b22ef131 | 825 | SYNTAX_ERROR ("void expression between '(' and ')'"); |
4063b943 | 826 | else |
b22ef131 | 827 | SYNTAX_ERROR2 ("operator '%s' has no right operand", |
93c80368 | 828 | op_as_text (pfile, top->op)); |
7f2935c7 | 829 | } |
4063b943 NB |
830 | |
831 | unsigned2 = top->unsignedp, v2 = top->value; | |
832 | top--; | |
833 | unsigned1 = top->unsignedp, v1 = top->value; | |
834 | ||
835 | /* Now set top->value = (top[1].op)(v1, v2); */ | |
7f2935c7 PB |
836 | switch (top[1].op) |
837 | { | |
cf00a885 | 838 | default: |
93c80368 NB |
839 | cpp_ice (pfile, "impossible operator '%s'", |
840 | op_as_text (pfile, top[1].op)); | |
cf00a885 ZW |
841 | goto syntax_error; |
842 | ||
843 | case CPP_NOT: UNARY(!); break; | |
844 | case CPP_COMPL: UNARY(~); break; | |
845 | case CPP_LESS: COMPARE(<); break; | |
846 | case CPP_GREATER: COMPARE(>); break; | |
847 | case CPP_LESS_EQ: COMPARE(<=); break; | |
848 | case CPP_GREATER_EQ: COMPARE(>=); break; | |
849 | case CPP_EQ_EQ: EQUALITY(==); break; | |
850 | case CPP_NOT_EQ: EQUALITY(!=); break; | |
851 | case CPP_AND: BITWISE(&); break; | |
852 | case CPP_XOR: BITWISE(^); break; | |
853 | case CPP_OR: BITWISE(|); break; | |
cf00a885 ZW |
854 | case CPP_LSHIFT: SHIFT(left_shift, right_shift); break; |
855 | case CPP_RSHIFT: SHIFT(right_shift, left_shift); break; | |
92936ecf ZW |
856 | case CPP_MIN: MINMAX(<); break; |
857 | case CPP_MAX: MINMAX(>); break; | |
cf00a885 ZW |
858 | |
859 | case CPP_PLUS: | |
7f2935c7 | 860 | if (!(top->flags & HAVE_VALUE)) |
cf00a885 | 861 | { |
0080e892 ZW |
862 | /* Can't use UNARY(+) because K+R C did not have unary |
863 | plus. Can't use UNARY() because some compilers object | |
864 | to the empty argument. */ | |
865 | top->value = v2; | |
866 | top->unsignedp = unsigned2; | |
867 | top->flags |= HAVE_VALUE; | |
6f4280ef ZW |
868 | |
869 | if (CPP_WTRADITIONAL (pfile)) | |
870 | cpp_warning (pfile, | |
871 | "traditional C rejects the unary plus operator"); | |
7f2935c7 PB |
872 | } |
873 | else | |
874 | { | |
875 | top->value = v1 + v2; | |
b22ef131 | 876 | top->unsignedp = unsigned1 | unsigned2; |
a4a315ef | 877 | if (! top->unsignedp && ! skip_evaluation |
7f2935c7 PB |
878 | && ! possible_sum_sign (v1, v2, top->value)) |
879 | integer_overflow (pfile); | |
880 | } | |
881 | break; | |
cf00a885 | 882 | case CPP_MINUS: |
52529158 | 883 | if (!(top->flags & HAVE_VALUE)) |
cf00a885 ZW |
884 | { |
885 | UNARY(-); | |
886 | if (!skip_evaluation && (top->value & v2) < 0 && !unsigned2) | |
7f2935c7 | 887 | integer_overflow (pfile); |
7f2935c7 PB |
888 | } |
889 | else | |
890 | { /* Binary '-' */ | |
891 | top->value = v1 - v2; | |
b22ef131 | 892 | top->unsignedp = unsigned1 | unsigned2; |
52529158 | 893 | if (! top->unsignedp && ! skip_evaluation |
7f2935c7 PB |
894 | && ! possible_sum_sign (top->value, v2, v1)) |
895 | integer_overflow (pfile); | |
896 | } | |
897 | break; | |
cf00a885 | 898 | case CPP_MULT: |
b22ef131 | 899 | top->unsignedp = unsigned1 | unsigned2; |
7f2935c7 | 900 | if (top->unsignedp) |
ca261cb4 | 901 | top->value = (unsigned HOST_WIDEST_INT) v1 * v2; |
a4a315ef | 902 | else if (!skip_evaluation) |
7f2935c7 PB |
903 | { |
904 | top->value = v1 * v2; | |
4063b943 NB |
905 | if (v1 && (top->value / v1 != v2 |
906 | || (top->value & v1 & v2) < 0)) | |
7f2935c7 PB |
907 | integer_overflow (pfile); |
908 | } | |
909 | break; | |
cf00a885 ZW |
910 | case CPP_DIV: |
911 | case CPP_MOD: | |
a4a315ef PB |
912 | if (skip_evaluation) |
913 | break; | |
7f2935c7 | 914 | if (v2 == 0) |
b22ef131 NB |
915 | SYNTAX_ERROR ("division by zero in #if"); |
916 | top->unsignedp = unsigned1 | unsigned2; | |
cf00a885 | 917 | if (top[1].op == CPP_DIV) |
7f2935c7 | 918 | { |
4063b943 NB |
919 | if (top->unsignedp) |
920 | top->value = (unsigned HOST_WIDEST_INT) v1 / v2; | |
921 | else | |
922 | { | |
923 | top->value = v1 / v2; | |
924 | if ((top->value & v1 & v2) < 0) | |
925 | integer_overflow (pfile); | |
926 | } | |
7f2935c7 | 927 | } |
4063b943 | 928 | else |
7f2935c7 | 929 | { |
4063b943 NB |
930 | if (top->unsignedp) |
931 | top->value = (unsigned HOST_WIDEST_INT) v1 % v2; | |
932 | else | |
933 | top->value = v1 % v2; | |
7f2935c7 | 934 | } |
7f2935c7 | 935 | break; |
cf00a885 | 936 | |
0080e892 ZW |
937 | case CPP_OR_OR: |
938 | top->value = v1 || v2; | |
939 | top->unsignedp = 0; | |
940 | if (v1) skip_evaluation--; | |
941 | break; | |
942 | case CPP_AND_AND: | |
943 | top->value = v1 && v2; | |
944 | top->unsignedp = 0; | |
945 | if (!v1) skip_evaluation--; | |
946 | break; | |
cf00a885 | 947 | case CPP_COMMA: |
7f2935c7 | 948 | if (CPP_PEDANTIC (pfile)) |
b22ef131 | 949 | cpp_pedwarn (pfile, "comma operator in operand of #if"); |
7f2935c7 PB |
950 | top->value = v2; |
951 | top->unsignedp = unsigned2; | |
952 | break; | |
cf00a885 | 953 | case CPP_QUERY: |
b22ef131 | 954 | SYNTAX_ERROR ("syntax error '?' without following ':'"); |
cf00a885 ZW |
955 | case CPP_COLON: |
956 | if (top[0].op != CPP_QUERY) | |
b22ef131 | 957 | SYNTAX_ERROR ("syntax error ':' without preceding '?'"); |
4063b943 NB |
958 | top--; |
959 | if (top->value) skip_evaluation--; | |
960 | top->value = top->value ? v1 : v2; | |
b22ef131 | 961 | top->unsignedp = unsigned1 | unsigned2; |
7f2935c7 | 962 | break; |
cf00a885 ZW |
963 | case CPP_OPEN_PAREN: |
964 | if (op.op != CPP_CLOSE_PAREN) | |
b22ef131 | 965 | SYNTAX_ERROR ("missing ')' in expression"); |
9ee70313 NB |
966 | op.value = v2; |
967 | op.unsignedp = unsigned2; | |
968 | goto push_immediate; | |
cf00a885 | 969 | case CPP_EOF: |
4063b943 | 970 | /* Reducing this dummy operator indicates we've finished. */ |
cf00a885 | 971 | if (op.op == CPP_CLOSE_PAREN) |
b22ef131 | 972 | SYNTAX_ERROR ("missing '(' in expression"); |
4063b943 | 973 | goto done; |
7f2935c7 PB |
974 | } |
975 | } | |
9ee70313 | 976 | |
4063b943 NB |
977 | /* Handle short-circuit evaluations. */ |
978 | if (flags & SHORT_CIRCUIT) | |
979 | switch (op.op) | |
980 | { | |
cf00a885 ZW |
981 | case CPP_OR_OR: if (top->value) skip_evaluation++; break; |
982 | case CPP_AND_AND: | |
983 | case CPP_QUERY: if (!top->value) skip_evaluation++; break; | |
984 | case CPP_COLON: | |
4063b943 NB |
985 | if (top[-1].value) /* Was '?' condition true? */ |
986 | skip_evaluation++; | |
987 | else | |
988 | skip_evaluation--; | |
cf00a885 ZW |
989 | default: |
990 | break; | |
4063b943 | 991 | } |
9ee70313 NB |
992 | |
993 | skip_reduction: | |
4063b943 | 994 | /* Check we have a left operand iff we need one. */ |
b22ef131 | 995 | if (flags & NO_L_OPERAND) |
4063b943 | 996 | { |
b22ef131 NB |
997 | if (top->flags & HAVE_VALUE) |
998 | SYNTAX_ERROR2 ("missing binary operator before '%s'", | |
93c80368 | 999 | op_as_text (pfile, top->op)); |
b22ef131 NB |
1000 | } |
1001 | else | |
1002 | { | |
1003 | if (!(top->flags & HAVE_VALUE)) | |
1004 | SYNTAX_ERROR2 ("operator '%s' has no left operand", | |
93c80368 | 1005 | op_as_text (pfile, top->op)); |
4063b943 NB |
1006 | } |
1007 | ||
0f41302f | 1008 | /* Check for and handle stack overflow. */ |
9ee70313 | 1009 | top++; |
7f2935c7 PB |
1010 | if (top == limit) |
1011 | { | |
cf00a885 | 1012 | struct op *new_stack; |
0f41302f | 1013 | int old_size = (char *) limit - (char *) stack; |
7f2935c7 PB |
1014 | int new_size = 2 * old_size; |
1015 | if (stack != init_stack) | |
cf00a885 | 1016 | new_stack = (struct op *) xrealloc (stack, new_size); |
7f2935c7 PB |
1017 | else |
1018 | { | |
cf00a885 | 1019 | new_stack = (struct op *) xmalloc (new_size); |
b0699dad | 1020 | memcpy (new_stack, stack, old_size); |
7f2935c7 PB |
1021 | } |
1022 | stack = new_stack; | |
cf00a885 ZW |
1023 | top = (struct op *) ((char *) new_stack + old_size); |
1024 | limit = (struct op *) ((char *) new_stack + new_size); | |
7f2935c7 PB |
1025 | } |
1026 | ||
1027 | top->flags = flags; | |
4063b943 | 1028 | top->prio = prio & ~EXTRACT_PRIO(RIGHT_ASSOC); |
7f2935c7 PB |
1029 | top->op = op.op; |
1030 | } | |
9ee70313 | 1031 | |
4063b943 NB |
1032 | done: |
1033 | result = (top[1].value != 0); | |
9ee70313 | 1034 | if (top != stack) |
cf00a885 | 1035 | CPP_ICE ("unbalanced stack in #if"); |
4063b943 NB |
1036 | else if (!(top[1].flags & HAVE_VALUE)) |
1037 | { | |
b22ef131 | 1038 | SYNTAX_ERROR ("#if with no expression"); |
4063b943 | 1039 | syntax_error: |
4063b943 NB |
1040 | result = 0; /* Return 0 on syntax error. */ |
1041 | } | |
9ee70313 | 1042 | |
4063b943 | 1043 | /* Free dynamic stack if we allocated one. */ |
7f2935c7 PB |
1044 | if (stack != init_stack) |
1045 | free (stack); | |
37dbf7aa | 1046 | pfile->skipping = save_skipping; |
45b966db | 1047 | return result; |
7f2935c7 | 1048 | } |
93c80368 NB |
1049 | |
1050 | static const unsigned char * | |
1051 | op_as_text (pfile, op) | |
1052 | cpp_reader *pfile; | |
1053 | enum cpp_ttype op; | |
1054 | { | |
1055 | cpp_token token; | |
1056 | ||
1057 | token.type = op; | |
1058 | token.flags = 0; | |
1059 | return cpp_token_as_text (pfile, &token); | |
1060 | } |