]>
Commit | Line | Data |
---|---|---|
d45cf215 | 1 | /* Lexical analyzer for C and Objective C. |
517cbe13 JL |
2 | Copyright (C) 1987, 1988, 1989, 1992, 1994, 1995, 1996, 1997 |
3 | 1998, 1999, 2000 Free Software Foundation, Inc. | |
e8bbfc4e RK |
4 | |
5 | This file is part of GNU CC. | |
6 | ||
7 | GNU CC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2, or (at your option) | |
10 | any later version. | |
11 | ||
12 | GNU CC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU CC; see the file COPYING. If not, write to | |
940d9d63 RK |
19 | the Free Software Foundation, 59 Temple Place - Suite 330, |
20 | Boston, MA 02111-1307, USA. */ | |
e8bbfc4e | 21 | |
e9a25f70 | 22 | #include "config.h" |
670ee920 | 23 | #include "system.h" |
e8bbfc4e | 24 | |
e8bbfc4e | 25 | #include "rtl.h" |
8f17b5c5 | 26 | #include "expr.h" |
e8bbfc4e RK |
27 | #include "tree.h" |
28 | #include "input.h" | |
d6f4ec51 | 29 | #include "output.h" |
e8bbfc4e RK |
30 | #include "c-lex.h" |
31 | #include "c-tree.h" | |
32 | #include "flags.h" | |
0e5921e8 | 33 | #include "timevar.h" |
8b97c5f8 | 34 | #include "cpplib.h" |
3d6f7931 | 35 | #include "c-pragma.h" |
5f6da302 | 36 | #include "toplev.h" |
ab87f8c8 | 37 | #include "intl.h" |
7bdb32b9 | 38 | #include "tm_p.h" |
0e5921e8 | 39 | #include "splay-tree.h" |
ab87f8c8 | 40 | |
ab87f8c8 JL |
41 | /* MULTIBYTE_CHARS support only works for native compilers. |
42 | ??? Ideally what we want is to model widechar support after | |
43 | the current floating point support. */ | |
44 | #ifdef CROSS_COMPILE | |
45 | #undef MULTIBYTE_CHARS | |
46 | #endif | |
e8bbfc4e RK |
47 | |
48 | #ifdef MULTIBYTE_CHARS | |
56f48ce9 | 49 | #include "mbchar.h" |
e8bbfc4e | 50 | #include <locale.h> |
56f48ce9 | 51 | #endif /* MULTIBYTE_CHARS */ |
c5c76735 JL |
52 | #ifndef GET_ENVIRONMENT |
53 | #define GET_ENVIRONMENT(ENV_VALUE,ENV_NAME) ((ENV_VALUE) = getenv (ENV_NAME)) | |
54 | #endif | |
e8bbfc4e | 55 | |
3aac38d7 RH |
56 | /* The original file name, before changing "-" to "stdin". */ |
57 | static const char *orig_filename; | |
58 | ||
0e5921e8 ZW |
59 | /* Private idea of the line number. See discussion in c_lex(). */ |
60 | static int lex_lineno; | |
61 | ||
62 | /* We may keep statistics about how long which files took to compile. */ | |
63 | static int header_time, body_time; | |
64 | static splay_tree file_info_tree; | |
3ab6dd7c | 65 | |
e8bbfc4e RK |
66 | /* Cause the `yydebug' variable to be defined. */ |
67 | #define YYDEBUG 1 | |
68 | ||
e8bbfc4e RK |
69 | /* File used for outputting assembler code. */ |
70 | extern FILE *asm_out_file; | |
71 | ||
12a39b12 JM |
72 | #undef WCHAR_TYPE_SIZE |
73 | #define WCHAR_TYPE_SIZE TYPE_PRECISION (wchar_type_node) | |
e8bbfc4e RK |
74 | |
75 | /* Number of bytes in a wide character. */ | |
76 | #define WCHAR_BYTES (WCHAR_TYPE_SIZE / BITS_PER_UNIT) | |
77 | ||
0e5921e8 ZW |
78 | int indent_level; /* Number of { minus number of }. */ |
79 | int pending_lang_change; /* If we need to switch languages - C++ only */ | |
80 | int c_header_level; /* depth in C headers - C++ only */ | |
fbb18613 JM |
81 | |
82 | /* Nonzero tells yylex to ignore \ in string constants. */ | |
83 | static int ignore_escape_flag; | |
e9a25f70 | 84 | |
0e5921e8 ZW |
85 | static const char *readescape PARAMS ((const char *, const char *, |
86 | unsigned int *)); | |
87 | static const char *read_ucs PARAMS ((const char *, const char *, | |
88 | unsigned int *, int)); | |
89 | static void parse_float PARAMS ((PTR)); | |
90 | static tree lex_number PARAMS ((const char *, unsigned int)); | |
91 | static tree lex_string PARAMS ((const char *, unsigned int, int)); | |
92 | static tree lex_charconst PARAMS ((const char *, unsigned int, int)); | |
93 | static void update_header_times PARAMS ((const char *)); | |
94 | static int dump_one_header PARAMS ((splay_tree_node, void *)); | |
23356f93 | 95 | static void cb_ident PARAMS ((cpp_reader *, const cpp_string *)); |
27e2564a | 96 | static void cb_change_file PARAMS ((cpp_reader *, const cpp_file_change *)); |
8b97c5f8 | 97 | static void cb_def_pragma PARAMS ((cpp_reader *)); |
e31c7eec | 98 | \f |
3b304f5b | 99 | const char * |
0e5921e8 | 100 | init_c_lex (filename) |
3b304f5b | 101 | const char *filename; |
e3d1fd32 | 102 | { |
0e5921e8 ZW |
103 | struct c_fileinfo *toplevel; |
104 | ||
3aac38d7 RH |
105 | orig_filename = filename; |
106 | ||
0e5921e8 ZW |
107 | /* Set up filename timing. Must happen before cpp_start_read. */ |
108 | file_info_tree = splay_tree_new ((splay_tree_compare_fn)strcmp, | |
109 | 0, | |
110 | (splay_tree_delete_value_fn)free); | |
a8a05998 | 111 | toplevel = get_fileinfo ("<top level>"); |
0e5921e8 ZW |
112 | if (flag_detailed_statistics) |
113 | { | |
114 | header_time = 0; | |
115 | body_time = get_run_time (); | |
116 | toplevel->time = body_time; | |
117 | } | |
118 | ||
119 | #ifdef MULTIBYTE_CHARS | |
120 | /* Change to the native locale for multibyte conversions. */ | |
121 | setlocale (LC_CTYPE, ""); | |
122 | GET_ENVIRONMENT (literal_codeset, "LANG"); | |
123 | #endif | |
124 | ||
cf44ea52 NB |
125 | parse_in->cb.ident = cb_ident; |
126 | parse_in->cb.change_file = cb_change_file; | |
127 | parse_in->cb.def_pragma = cb_def_pragma; | |
0e5921e8 | 128 | |
b12da25e ZW |
129 | if (filename == 0 || !strcmp (filename, "-")) |
130 | filename = "stdin"; | |
5c60e5c0 | 131 | |
0e5921e8 ZW |
132 | /* Start it at 0, because check_newline is called at the very beginning |
133 | and will increment it to 1. */ | |
134 | lineno = lex_lineno = 0; | |
b12da25e | 135 | |
5c60e5c0 | 136 | return filename; |
e3d1fd32 PB |
137 | } |
138 | ||
3aac38d7 RH |
139 | /* A thin wrapper around the real parser that initializes the |
140 | integrated preprocessor after debug output has been initialized. */ | |
141 | ||
142 | int | |
143 | yyparse() | |
144 | { | |
cf44ea52 | 145 | if (! cpp_start_read (parse_in, orig_filename)) |
3aac38d7 RH |
146 | return 1; /* cpplib has emitted an error. */ |
147 | ||
148 | return yyparse_1(); | |
149 | } | |
150 | ||
0e5921e8 ZW |
151 | struct c_fileinfo * |
152 | get_fileinfo (name) | |
153 | const char *name; | |
e3d1fd32 | 154 | { |
0e5921e8 ZW |
155 | splay_tree_node n; |
156 | struct c_fileinfo *fi; | |
157 | ||
158 | n = splay_tree_lookup (file_info_tree, (splay_tree_key) name); | |
159 | if (n) | |
160 | return (struct c_fileinfo *) n->value; | |
161 | ||
162 | fi = (struct c_fileinfo *) xmalloc (sizeof (struct c_fileinfo)); | |
163 | fi->time = 0; | |
164 | fi->interface_only = 0; | |
165 | fi->interface_unknown = 1; | |
166 | splay_tree_insert (file_info_tree, (splay_tree_key) name, | |
167 | (splay_tree_value) fi); | |
168 | return fi; | |
e56e519d | 169 | } |
e3d1fd32 | 170 | |
0e5921e8 ZW |
171 | static void |
172 | update_header_times (name) | |
173 | const char *name; | |
e8bbfc4e | 174 | { |
0e5921e8 ZW |
175 | /* Changing files again. This means currently collected time |
176 | is charged against header time, and body time starts back at 0. */ | |
177 | if (flag_detailed_statistics) | |
e8bbfc4e | 178 | { |
0e5921e8 ZW |
179 | int this_time = get_run_time (); |
180 | struct c_fileinfo *file = get_fileinfo (name); | |
181 | header_time += this_time - body_time; | |
182 | file->time += this_time - body_time; | |
183 | body_time = this_time; | |
e8bbfc4e RK |
184 | } |
185 | } | |
186 | ||
0e5921e8 ZW |
187 | static int |
188 | dump_one_header (n, dummy) | |
189 | splay_tree_node n; | |
190 | void *dummy ATTRIBUTE_UNUSED; | |
e8bbfc4e | 191 | { |
0e5921e8 ZW |
192 | print_time ((const char *) n->key, |
193 | ((struct c_fileinfo *) n->value)->time); | |
194 | return 0; | |
e8bbfc4e | 195 | } |
e8bbfc4e RK |
196 | |
197 | void | |
0e5921e8 | 198 | dump_time_statistics () |
e8bbfc4e | 199 | { |
0e5921e8 ZW |
200 | struct c_fileinfo *file = get_fileinfo (input_filename); |
201 | int this_time = get_run_time (); | |
202 | file->time += this_time - body_time; | |
203 | ||
204 | fprintf (stderr, "\n******\n"); | |
205 | print_time ("header files (total)", header_time); | |
206 | print_time ("main file (total)", this_time - body_time); | |
207 | fprintf (stderr, "ratio = %g : 1\n", | |
208 | (double)header_time / (double)(this_time - body_time)); | |
209 | fprintf (stderr, "\n******\n"); | |
210 | ||
211 | splay_tree_foreach (file_info_tree, dump_one_header, 0); | |
e8bbfc4e | 212 | } |
a6124a42 | 213 | |
27e2564a NB |
214 | /* Not yet handled: #pragma, #define, #undef. |
215 | No need to deal with linemarkers under normal conditions. */ | |
216 | ||
0e5921e8 | 217 | static void |
27e2564a NB |
218 | cb_ident (pfile, str) |
219 | cpp_reader *pfile ATTRIBUTE_UNUSED; | |
220 | const cpp_string *str; | |
0e5921e8 | 221 | { |
0e5921e8 | 222 | #ifdef ASM_OUTPUT_IDENT |
27e2564a | 223 | if (! flag_no_ident) |
0e5921e8 | 224 | { |
27e2564a NB |
225 | /* Convert escapes in the string. */ |
226 | tree value = lex_string ((const char *)str->text, str->len, 0); | |
227 | ASM_OUTPUT_IDENT (asm_out_file, TREE_STRING_POINTER (value)); | |
0e5921e8 ZW |
228 | } |
229 | #endif | |
27e2564a NB |
230 | } |
231 | ||
232 | static void | |
233 | cb_change_file (pfile, fc) | |
234 | cpp_reader *pfile ATTRIBUTE_UNUSED; | |
235 | const cpp_file_change *fc; | |
236 | { | |
237 | if (fc->from.filename == 0) | |
238 | main_input_filename = fc->to.filename; | |
239 | in_system_header = fc->sysp; | |
e8bbfc4e | 240 | |
fbb18613 | 241 | /* Do the actions implied by the preceding numbers. */ |
27e2564a | 242 | if (fc->reason == FC_ENTER) |
fbb18613 | 243 | { |
27e2564a NB |
244 | /* FIXME. Don't stack the main buffer on the input stack. */ |
245 | if (fc->from.filename) | |
0e5921e8 | 246 | { |
27e2564a NB |
247 | lineno = lex_lineno; |
248 | push_srcloc (fc->to.filename, 1); | |
249 | input_file_stack->indent_level = indent_level; | |
250 | debug_start_source_file (fc->to.filename); | |
251 | #ifndef NO_IMPLICIT_EXTERN_C | |
252 | if (c_header_level) | |
253 | ++c_header_level; | |
254 | else if (fc->externc) | |
255 | { | |
256 | c_header_level = 1; | |
257 | ++pending_lang_change; | |
258 | } | |
0e5921e8 | 259 | #endif |
27e2564a | 260 | } |
fbb18613 | 261 | } |
27e2564a | 262 | else if (fc->reason == FC_LEAVE) |
fbb18613 JM |
263 | { |
264 | /* Popping out of a file. */ | |
265 | if (input_file_stack->next) | |
0468bc75 | 266 | { |
0e5921e8 ZW |
267 | #ifndef NO_IMPLICIT_EXTERN_C |
268 | if (c_header_level && --c_header_level == 0) | |
269 | { | |
27e2564a | 270 | if (fc->externc) |
0e5921e8 ZW |
271 | warning ("badly nested C headers from preprocessor"); |
272 | --pending_lang_change; | |
273 | } | |
274 | #endif | |
275 | #if 0 | |
276 | if (indent_level != input_file_stack->indent_level) | |
fbb18613 JM |
277 | { |
278 | warning_with_file_and_line | |
0e5921e8 ZW |
279 | (input_filename, lex_lineno, |
280 | "This file contains more '%c's than '%c's.", | |
281 | indent_level > input_file_stack->indent_level ? '{' : '}', | |
282 | indent_level > input_file_stack->indent_level ? '}' : '{'); | |
fbb18613 | 283 | } |
0e5921e8 ZW |
284 | #endif |
285 | pop_srcloc (); | |
fbb18613 | 286 | debug_end_source_file (input_file_stack->line); |
0468bc75 | 287 | } |
fbb18613 | 288 | else |
27e2564a | 289 | error ("leaving more files than we entered"); |
e8bbfc4e | 290 | } |
27e2564a NB |
291 | else if (fc->reason == FC_RENAME) |
292 | input_filename = fc->to.filename; | |
fbb18613 | 293 | |
27e2564a | 294 | update_header_times (fc->to.filename); |
ca5b800a | 295 | |
27e2564a NB |
296 | input_filename = fc->to.filename; |
297 | lex_lineno = fc->to.lineno; | |
0e5921e8 | 298 | |
0e5921e8 ZW |
299 | /* Hook for C++. */ |
300 | extract_interface_info (); | |
301 | } | |
8b97c5f8 ZW |
302 | |
303 | static void | |
304 | cb_def_pragma (pfile) | |
305 | cpp_reader *pfile; | |
306 | { | |
307 | /* Issue a warning message if we have been asked to do so. Ignore | |
308 | unknown pragmas in system headers unless an explicit | |
309 | -Wunknown-pragmas has been given. */ | |
310 | if (warn_unknown_pragmas > in_system_header) | |
311 | { | |
23356f93 ZW |
312 | const unsigned char *space, *name = 0; |
313 | cpp_token s; | |
314 | ||
315 | cpp_get_token (pfile, &s); | |
316 | space = cpp_token_as_text (pfile, &s); | |
317 | cpp_get_token (pfile, &s); | |
318 | if (s.type == CPP_NAME) | |
319 | name = cpp_token_as_text (pfile, &s); | |
8b97c5f8 | 320 | |
8b97c5f8 ZW |
321 | if (name) |
322 | warning ("ignoring #pragma %s %s", space, name); | |
323 | else | |
324 | warning ("ignoring #pragma %s", space); | |
325 | } | |
326 | } | |
0e5921e8 ZW |
327 | |
328 | /* Parse a '\uNNNN' or '\UNNNNNNNN' sequence. | |
329 | ||
330 | [lex.charset]: The character designated by the universal-character-name | |
331 | \UNNNNNNNN is that character whose character short name in ISO/IEC 10646 | |
332 | is NNNNNNNN; the character designated by the universal-character-name | |
333 | \uNNNN is that character whose character short name in ISO/IEC 10646 is | |
334 | 0000NNNN. If the hexadecimal value for a universal character name is | |
335 | less than 0x20 or in the range 0x7F-0x9F (inclusive), or if the | |
336 | universal character name designates a character in the basic source | |
337 | character set, then the program is ill-formed. | |
338 | ||
339 | We assume that wchar_t is Unicode, so we don't need to do any | |
340 | mapping. Is this ever wrong? */ | |
341 | ||
342 | static const char * | |
343 | read_ucs (p, limit, cptr, length) | |
344 | const char *p; | |
345 | const char *limit; | |
346 | unsigned int *cptr; | |
347 | int length; | |
348 | { | |
349 | unsigned int code = 0; | |
350 | int c; | |
351 | ||
352 | for (; length; --length) | |
ca5b800a | 353 | { |
0e5921e8 | 354 | if (p >= limit) |
a3100298 | 355 | { |
0e5921e8 | 356 | error ("incomplete universal-character-name"); |
a3100298 | 357 | break; |
0e5921e8 | 358 | } |
fbb18613 | 359 | |
0e5921e8 ZW |
360 | c = *p++; |
361 | if (! ISXDIGIT (c)) | |
362 | { | |
363 | error ("non hex digit '%c' in universal-character-name", c); | |
364 | p--; | |
365 | break; | |
a3100298 | 366 | } |
f09db6e0 | 367 | |
0e5921e8 ZW |
368 | code <<= 4; |
369 | if (c >= 'a' && c <= 'f') | |
370 | code += c - 'a' + 10; | |
371 | if (c >= 'A' && c <= 'F') | |
372 | code += c - 'A' + 10; | |
373 | if (c >= '0' && c <= '9') | |
374 | code += c - '0'; | |
ca5b800a | 375 | } |
ca5b800a | 376 | |
0e5921e8 ZW |
377 | #ifdef TARGET_EBCDIC |
378 | sorry ("universal-character-name on EBCDIC target"); | |
379 | *cptr = 0x3f; /* EBCDIC invalid character */ | |
380 | return p; | |
381 | #endif | |
382 | ||
383 | if (code > 0x9f && !(code & 0x80000000)) | |
384 | /* True extended character, OK. */; | |
385 | else if (code >= 0x20 && code < 0x7f) | |
386 | { | |
387 | /* ASCII printable character. The C character set consists of all of | |
388 | these except $, @ and `. We use hex escapes so that this also | |
389 | works with EBCDIC hosts. */ | |
390 | if (code != 0x24 && code != 0x40 && code != 0x60) | |
391 | error ("universal-character-name used for '%c'", code); | |
392 | } | |
393 | else | |
394 | error ("invalid universal-character-name"); | |
395 | ||
396 | *cptr = code; | |
397 | return p; | |
398 | } | |
e8bbfc4e | 399 | |
0e5921e8 ZW |
400 | /* Read an escape sequence and write its character equivalent into *CPTR. |
401 | P is the input pointer, which is just after the backslash. LIMIT | |
402 | is how much text we have. | |
403 | Returns the updated input pointer. */ | |
e8bbfc4e | 404 | |
0e5921e8 ZW |
405 | static const char * |
406 | readescape (p, limit, cptr) | |
407 | const char *p; | |
408 | const char *limit; | |
409 | unsigned int *cptr; | |
e8bbfc4e | 410 | { |
0e5921e8 | 411 | unsigned int c, code, count; |
1c7b145e | 412 | unsigned firstdig = 0; |
8696da34 | 413 | int nonnull; |
e8bbfc4e | 414 | |
0e5921e8 ZW |
415 | if (p == limit) |
416 | { | |
417 | /* cpp has already issued an error for this. */ | |
418 | *cptr = 0; | |
419 | return p; | |
420 | } | |
421 | ||
422 | c = *p++; | |
423 | ||
e8bbfc4e RK |
424 | switch (c) |
425 | { | |
426 | case 'x': | |
cde6e684 | 427 | if (warn_traditional && !in_system_header) |
e8bbfc4e RK |
428 | warning ("the meaning of `\\x' varies with -traditional"); |
429 | ||
430 | if (flag_traditional) | |
0e5921e8 ZW |
431 | { |
432 | *cptr = 'x'; | |
433 | return p; | |
434 | } | |
e8bbfc4e RK |
435 | |
436 | code = 0; | |
437 | count = 0; | |
8696da34 | 438 | nonnull = 0; |
0e5921e8 | 439 | while (p < limit) |
e8bbfc4e | 440 | { |
0e5921e8 | 441 | c = *p++; |
fbb18613 | 442 | if (! ISXDIGIT (c)) |
e8bbfc4e | 443 | { |
0e5921e8 | 444 | p--; |
e8bbfc4e RK |
445 | break; |
446 | } | |
447 | code *= 16; | |
448 | if (c >= 'a' && c <= 'f') | |
449 | code += c - 'a' + 10; | |
450 | if (c >= 'A' && c <= 'F') | |
451 | code += c - 'A' + 10; | |
452 | if (c >= '0' && c <= '9') | |
453 | code += c - '0'; | |
8696da34 RS |
454 | if (code != 0 || count != 0) |
455 | { | |
456 | if (count == 0) | |
457 | firstdig = code; | |
458 | count++; | |
459 | } | |
460 | nonnull = 1; | |
e8bbfc4e | 461 | } |
8696da34 | 462 | if (! nonnull) |
4082292a AO |
463 | { |
464 | warning ("\\x used with no following hex digits"); | |
0e5921e8 ZW |
465 | *cptr = 'x'; |
466 | return p; | |
4082292a | 467 | } |
be63d912 RS |
468 | else if (count == 0) |
469 | /* Digits are all 0's. Ok. */ | |
470 | ; | |
e8bbfc4e RK |
471 | else if ((count - 1) * 4 >= TYPE_PRECISION (integer_type_node) |
472 | || (count > 1 | |
fbb18613 JM |
473 | && (((unsigned)1 |
474 | << (TYPE_PRECISION (integer_type_node) | |
475 | - (count - 1) * 4)) | |
e8bbfc4e RK |
476 | <= firstdig))) |
477 | pedwarn ("hex escape out of range"); | |
0e5921e8 ZW |
478 | *cptr = code; |
479 | return p; | |
e8bbfc4e RK |
480 | |
481 | case '0': case '1': case '2': case '3': case '4': | |
482 | case '5': case '6': case '7': | |
483 | code = 0; | |
0e5921e8 | 484 | for (count = 0; count < 3; count++) |
e8bbfc4e | 485 | { |
0e5921e8 ZW |
486 | if (c < '0' || c > '7') |
487 | { | |
488 | p--; | |
489 | break; | |
490 | } | |
e8bbfc4e | 491 | code = (code * 8) + (c - '0'); |
0e5921e8 ZW |
492 | if (p == limit) |
493 | break; | |
494 | c = *p++; | |
e8bbfc4e | 495 | } |
e8bbfc4e | 496 | |
0e5921e8 ZW |
497 | if (count == 3) |
498 | p--; | |
e8bbfc4e | 499 | |
0e5921e8 ZW |
500 | *cptr = code; |
501 | return p; | |
e8bbfc4e | 502 | |
0e5921e8 ZW |
503 | case '\\': case '\'': case '"': case '?': |
504 | *cptr = c; | |
505 | return p; | |
e8bbfc4e | 506 | |
0e5921e8 ZW |
507 | case 'n': *cptr = TARGET_NEWLINE; return p; |
508 | case 't': *cptr = TARGET_TAB; return p; | |
509 | case 'r': *cptr = TARGET_CR; return p; | |
510 | case 'f': *cptr = TARGET_FF; return p; | |
511 | case 'b': *cptr = TARGET_BS; return p; | |
512 | case 'v': *cptr = TARGET_VT; return p; | |
513 | case 'a': | |
514 | if (warn_traditional && !in_system_header) | |
515 | warning ("the meaning of '\\a' varies with -traditional"); | |
516 | *cptr = flag_traditional ? c : TARGET_BELL; | |
517 | return p; | |
e8bbfc4e | 518 | |
0e5921e8 ZW |
519 | /* Warnings and support checks handled by read_ucs(). */ |
520 | case 'u': case 'U': | |
521 | if (c_language != clk_cplusplus && !flag_isoc99) | |
522 | break; | |
e8bbfc4e | 523 | |
cde6e684 | 524 | if (warn_traditional && !in_system_header) |
0e5921e8 | 525 | warning ("the meaning of '\\%c' varies with -traditional", c); |
e8bbfc4e | 526 | |
0e5921e8 ZW |
527 | return read_ucs (p, limit, cptr, c == 'u' ? 4 : 8); |
528 | ||
529 | case 'e': case 'E': | |
dad112ca | 530 | if (pedantic) |
0e5921e8 ZW |
531 | pedwarn ("non-ISO-standard escape sequence, '\\%c'", c); |
532 | *cptr = TARGET_ESC; return p; | |
e8bbfc4e | 533 | |
0e5921e8 ZW |
534 | /* '\(', etc, are used at beginning of line to avoid confusing Emacs. |
535 | '\%' is used to prevent SCCS from getting confused. */ | |
536 | case '(': case '{': case '[': case '%': | |
e8bbfc4e | 537 | if (pedantic) |
0e5921e8 ZW |
538 | pedwarn ("unknown escape sequence '\\%c'", c); |
539 | *cptr = c; | |
540 | return p; | |
e8bbfc4e | 541 | } |
0e5921e8 | 542 | |
fbb18613 | 543 | if (ISGRAPH (c)) |
0e5921e8 | 544 | pedwarn ("unknown escape sequence '\\%c'", c); |
e8bbfc4e | 545 | else |
a52fb89b | 546 | pedwarn ("unknown escape sequence: '\\' followed by char 0x%x", c); |
0e5921e8 ZW |
547 | |
548 | *cptr = c; | |
549 | return p; | |
e8bbfc4e | 550 | } |
0e5921e8 ZW |
551 | |
552 | #if 0 /* not yet */ | |
553 | /* Returns nonzero if C is a universal-character-name. Give an error if it | |
554 | is not one which may appear in an identifier, as per [extendid]. | |
555 | ||
556 | Note that extended character support in identifiers has not yet been | |
557 | implemented. It is my personal opinion that this is not a desirable | |
558 | feature. Portable code cannot count on support for more than the basic | |
559 | identifier character set. */ | |
560 | ||
561 | static inline int | |
562 | is_extended_char (c) | |
563 | int c; | |
564 | { | |
565 | #ifdef TARGET_EBCDIC | |
566 | return 0; | |
567 | #else | |
568 | /* ASCII. */ | |
569 | if (c < 0x7f) | |
570 | return 0; | |
571 | ||
572 | /* None of the valid chars are outside the Basic Multilingual Plane (the | |
573 | low 16 bits). */ | |
574 | if (c > 0xffff) | |
575 | { | |
576 | error ("universal-character-name '\\U%08x' not valid in identifier", c); | |
577 | return 1; | |
578 | } | |
579 | ||
580 | /* Latin */ | |
581 | if ((c >= 0x00c0 && c <= 0x00d6) | |
582 | || (c >= 0x00d8 && c <= 0x00f6) | |
583 | || (c >= 0x00f8 && c <= 0x01f5) | |
584 | || (c >= 0x01fa && c <= 0x0217) | |
585 | || (c >= 0x0250 && c <= 0x02a8) | |
586 | || (c >= 0x1e00 && c <= 0x1e9a) | |
587 | || (c >= 0x1ea0 && c <= 0x1ef9)) | |
588 | return 1; | |
589 | ||
590 | /* Greek */ | |
591 | if ((c == 0x0384) | |
592 | || (c >= 0x0388 && c <= 0x038a) | |
593 | || (c == 0x038c) | |
594 | || (c >= 0x038e && c <= 0x03a1) | |
595 | || (c >= 0x03a3 && c <= 0x03ce) | |
596 | || (c >= 0x03d0 && c <= 0x03d6) | |
597 | || (c == 0x03da) | |
598 | || (c == 0x03dc) | |
599 | || (c == 0x03de) | |
600 | || (c == 0x03e0) | |
601 | || (c >= 0x03e2 && c <= 0x03f3) | |
602 | || (c >= 0x1f00 && c <= 0x1f15) | |
603 | || (c >= 0x1f18 && c <= 0x1f1d) | |
604 | || (c >= 0x1f20 && c <= 0x1f45) | |
605 | || (c >= 0x1f48 && c <= 0x1f4d) | |
606 | || (c >= 0x1f50 && c <= 0x1f57) | |
607 | || (c == 0x1f59) | |
608 | || (c == 0x1f5b) | |
609 | || (c == 0x1f5d) | |
610 | || (c >= 0x1f5f && c <= 0x1f7d) | |
611 | || (c >= 0x1f80 && c <= 0x1fb4) | |
612 | || (c >= 0x1fb6 && c <= 0x1fbc) | |
613 | || (c >= 0x1fc2 && c <= 0x1fc4) | |
614 | || (c >= 0x1fc6 && c <= 0x1fcc) | |
615 | || (c >= 0x1fd0 && c <= 0x1fd3) | |
616 | || (c >= 0x1fd6 && c <= 0x1fdb) | |
617 | || (c >= 0x1fe0 && c <= 0x1fec) | |
618 | || (c >= 0x1ff2 && c <= 0x1ff4) | |
619 | || (c >= 0x1ff6 && c <= 0x1ffc)) | |
620 | return 1; | |
621 | ||
622 | /* Cyrillic */ | |
623 | if ((c >= 0x0401 && c <= 0x040d) | |
624 | || (c >= 0x040f && c <= 0x044f) | |
625 | || (c >= 0x0451 && c <= 0x045c) | |
626 | || (c >= 0x045e && c <= 0x0481) | |
627 | || (c >= 0x0490 && c <= 0x04c4) | |
628 | || (c >= 0x04c7 && c <= 0x04c8) | |
629 | || (c >= 0x04cb && c <= 0x04cc) | |
630 | || (c >= 0x04d0 && c <= 0x04eb) | |
631 | || (c >= 0x04ee && c <= 0x04f5) | |
632 | || (c >= 0x04f8 && c <= 0x04f9)) | |
633 | return 1; | |
634 | ||
635 | /* Armenian */ | |
636 | if ((c >= 0x0531 && c <= 0x0556) | |
637 | || (c >= 0x0561 && c <= 0x0587)) | |
638 | return 1; | |
639 | ||
640 | /* Hebrew */ | |
641 | if ((c >= 0x05d0 && c <= 0x05ea) | |
642 | || (c >= 0x05f0 && c <= 0x05f4)) | |
643 | return 1; | |
644 | ||
645 | /* Arabic */ | |
646 | if ((c >= 0x0621 && c <= 0x063a) | |
647 | || (c >= 0x0640 && c <= 0x0652) | |
648 | || (c >= 0x0670 && c <= 0x06b7) | |
649 | || (c >= 0x06ba && c <= 0x06be) | |
650 | || (c >= 0x06c0 && c <= 0x06ce) | |
651 | || (c >= 0x06e5 && c <= 0x06e7)) | |
652 | return 1; | |
653 | ||
654 | /* Devanagari */ | |
655 | if ((c >= 0x0905 && c <= 0x0939) | |
656 | || (c >= 0x0958 && c <= 0x0962)) | |
657 | return 1; | |
658 | ||
659 | /* Bengali */ | |
660 | if ((c >= 0x0985 && c <= 0x098c) | |
661 | || (c >= 0x098f && c <= 0x0990) | |
662 | || (c >= 0x0993 && c <= 0x09a8) | |
663 | || (c >= 0x09aa && c <= 0x09b0) | |
664 | || (c == 0x09b2) | |
665 | || (c >= 0x09b6 && c <= 0x09b9) | |
666 | || (c >= 0x09dc && c <= 0x09dd) | |
667 | || (c >= 0x09df && c <= 0x09e1) | |
668 | || (c >= 0x09f0 && c <= 0x09f1)) | |
669 | return 1; | |
670 | ||
671 | /* Gurmukhi */ | |
672 | if ((c >= 0x0a05 && c <= 0x0a0a) | |
673 | || (c >= 0x0a0f && c <= 0x0a10) | |
674 | || (c >= 0x0a13 && c <= 0x0a28) | |
675 | || (c >= 0x0a2a && c <= 0x0a30) | |
676 | || (c >= 0x0a32 && c <= 0x0a33) | |
677 | || (c >= 0x0a35 && c <= 0x0a36) | |
678 | || (c >= 0x0a38 && c <= 0x0a39) | |
679 | || (c >= 0x0a59 && c <= 0x0a5c) | |
680 | || (c == 0x0a5e)) | |
681 | return 1; | |
682 | ||
683 | /* Gujarati */ | |
684 | if ((c >= 0x0a85 && c <= 0x0a8b) | |
685 | || (c == 0x0a8d) | |
686 | || (c >= 0x0a8f && c <= 0x0a91) | |
687 | || (c >= 0x0a93 && c <= 0x0aa8) | |
688 | || (c >= 0x0aaa && c <= 0x0ab0) | |
689 | || (c >= 0x0ab2 && c <= 0x0ab3) | |
690 | || (c >= 0x0ab5 && c <= 0x0ab9) | |
691 | || (c == 0x0ae0)) | |
692 | return 1; | |
693 | ||
694 | /* Oriya */ | |
695 | if ((c >= 0x0b05 && c <= 0x0b0c) | |
696 | || (c >= 0x0b0f && c <= 0x0b10) | |
697 | || (c >= 0x0b13 && c <= 0x0b28) | |
698 | || (c >= 0x0b2a && c <= 0x0b30) | |
699 | || (c >= 0x0b32 && c <= 0x0b33) | |
700 | || (c >= 0x0b36 && c <= 0x0b39) | |
701 | || (c >= 0x0b5c && c <= 0x0b5d) | |
702 | || (c >= 0x0b5f && c <= 0x0b61)) | |
703 | return 1; | |
704 | ||
705 | /* Tamil */ | |
706 | if ((c >= 0x0b85 && c <= 0x0b8a) | |
707 | || (c >= 0x0b8e && c <= 0x0b90) | |
708 | || (c >= 0x0b92 && c <= 0x0b95) | |
709 | || (c >= 0x0b99 && c <= 0x0b9a) | |
710 | || (c == 0x0b9c) | |
711 | || (c >= 0x0b9e && c <= 0x0b9f) | |
712 | || (c >= 0x0ba3 && c <= 0x0ba4) | |
713 | || (c >= 0x0ba8 && c <= 0x0baa) | |
714 | || (c >= 0x0bae && c <= 0x0bb5) | |
715 | || (c >= 0x0bb7 && c <= 0x0bb9)) | |
716 | return 1; | |
717 | ||
718 | /* Telugu */ | |
719 | if ((c >= 0x0c05 && c <= 0x0c0c) | |
720 | || (c >= 0x0c0e && c <= 0x0c10) | |
721 | || (c >= 0x0c12 && c <= 0x0c28) | |
722 | || (c >= 0x0c2a && c <= 0x0c33) | |
723 | || (c >= 0x0c35 && c <= 0x0c39) | |
724 | || (c >= 0x0c60 && c <= 0x0c61)) | |
725 | return 1; | |
726 | ||
727 | /* Kannada */ | |
728 | if ((c >= 0x0c85 && c <= 0x0c8c) | |
729 | || (c >= 0x0c8e && c <= 0x0c90) | |
730 | || (c >= 0x0c92 && c <= 0x0ca8) | |
731 | || (c >= 0x0caa && c <= 0x0cb3) | |
732 | || (c >= 0x0cb5 && c <= 0x0cb9) | |
733 | || (c >= 0x0ce0 && c <= 0x0ce1)) | |
734 | return 1; | |
735 | ||
736 | /* Malayalam */ | |
737 | if ((c >= 0x0d05 && c <= 0x0d0c) | |
738 | || (c >= 0x0d0e && c <= 0x0d10) | |
739 | || (c >= 0x0d12 && c <= 0x0d28) | |
740 | || (c >= 0x0d2a && c <= 0x0d39) | |
741 | || (c >= 0x0d60 && c <= 0x0d61)) | |
742 | return 1; | |
743 | ||
744 | /* Thai */ | |
745 | if ((c >= 0x0e01 && c <= 0x0e30) | |
746 | || (c >= 0x0e32 && c <= 0x0e33) | |
747 | || (c >= 0x0e40 && c <= 0x0e46) | |
748 | || (c >= 0x0e4f && c <= 0x0e5b)) | |
749 | return 1; | |
750 | ||
751 | /* Lao */ | |
752 | if ((c >= 0x0e81 && c <= 0x0e82) | |
753 | || (c == 0x0e84) | |
754 | || (c == 0x0e87) | |
755 | || (c == 0x0e88) | |
756 | || (c == 0x0e8a) | |
757 | || (c == 0x0e0d) | |
758 | || (c >= 0x0e94 && c <= 0x0e97) | |
759 | || (c >= 0x0e99 && c <= 0x0e9f) | |
760 | || (c >= 0x0ea1 && c <= 0x0ea3) | |
761 | || (c == 0x0ea5) | |
762 | || (c == 0x0ea7) | |
763 | || (c == 0x0eaa) | |
764 | || (c == 0x0eab) | |
765 | || (c >= 0x0ead && c <= 0x0eb0) | |
766 | || (c == 0x0eb2) | |
767 | || (c == 0x0eb3) | |
768 | || (c == 0x0ebd) | |
769 | || (c >= 0x0ec0 && c <= 0x0ec4) | |
770 | || (c == 0x0ec6)) | |
771 | return 1; | |
772 | ||
773 | /* Georgian */ | |
774 | if ((c >= 0x10a0 && c <= 0x10c5) | |
775 | || (c >= 0x10d0 && c <= 0x10f6)) | |
776 | return 1; | |
777 | ||
778 | /* Hiragana */ | |
779 | if ((c >= 0x3041 && c <= 0x3094) | |
780 | || (c >= 0x309b && c <= 0x309e)) | |
781 | return 1; | |
782 | ||
783 | /* Katakana */ | |
784 | if ((c >= 0x30a1 && c <= 0x30fe)) | |
785 | return 1; | |
786 | ||
787 | /* Bopmofo */ | |
788 | if ((c >= 0x3105 && c <= 0x312c)) | |
789 | return 1; | |
790 | ||
791 | /* Hangul */ | |
792 | if ((c >= 0x1100 && c <= 0x1159) | |
793 | || (c >= 0x1161 && c <= 0x11a2) | |
794 | || (c >= 0x11a8 && c <= 0x11f9)) | |
795 | return 1; | |
796 | ||
797 | /* CJK Unified Ideographs */ | |
798 | if ((c >= 0xf900 && c <= 0xfa2d) | |
799 | || (c >= 0xfb1f && c <= 0xfb36) | |
800 | || (c >= 0xfb38 && c <= 0xfb3c) | |
801 | || (c == 0xfb3e) | |
802 | || (c >= 0xfb40 && c <= 0xfb41) | |
803 | || (c >= 0xfb42 && c <= 0xfb44) | |
804 | || (c >= 0xfb46 && c <= 0xfbb1) | |
805 | || (c >= 0xfbd3 && c <= 0xfd3f) | |
806 | || (c >= 0xfd50 && c <= 0xfd8f) | |
807 | || (c >= 0xfd92 && c <= 0xfdc7) | |
808 | || (c >= 0xfdf0 && c <= 0xfdfb) | |
809 | || (c >= 0xfe70 && c <= 0xfe72) | |
810 | || (c == 0xfe74) | |
811 | || (c >= 0xfe76 && c <= 0xfefc) | |
812 | || (c >= 0xff21 && c <= 0xff3a) | |
813 | || (c >= 0xff41 && c <= 0xff5a) | |
814 | || (c >= 0xff66 && c <= 0xffbe) | |
815 | || (c >= 0xffc2 && c <= 0xffc7) | |
816 | || (c >= 0xffca && c <= 0xffcf) | |
817 | || (c >= 0xffd2 && c <= 0xffd7) | |
818 | || (c >= 0xffda && c <= 0xffdc) | |
819 | || (c >= 0x4e00 && c <= 0x9fa5)) | |
820 | return 1; | |
821 | ||
822 | error ("universal-character-name '\\u%04x' not valid in identifier", c); | |
823 | return 1; | |
824 | #endif | |
825 | } | |
826 | ||
827 | /* Add the UTF-8 representation of C to the token_buffer. */ | |
828 | ||
829 | static void | |
830 | utf8_extend_token (c) | |
831 | int c; | |
e8bbfc4e | 832 | { |
0e5921e8 ZW |
833 | int shift, mask; |
834 | ||
835 | if (c <= 0x0000007f) | |
836 | { | |
837 | extend_token (c); | |
838 | return; | |
839 | } | |
840 | else if (c <= 0x000007ff) | |
841 | shift = 6, mask = 0xc0; | |
842 | else if (c <= 0x0000ffff) | |
843 | shift = 12, mask = 0xe0; | |
844 | else if (c <= 0x001fffff) | |
845 | shift = 18, mask = 0xf0; | |
846 | else if (c <= 0x03ffffff) | |
847 | shift = 24, mask = 0xf8; | |
e8bbfc4e | 848 | else |
0e5921e8 ZW |
849 | shift = 30, mask = 0xfc; |
850 | ||
851 | extend_token (mask | (c >> shift)); | |
852 | do | |
853 | { | |
854 | shift -= 6; | |
855 | extend_token ((unsigned char) (0x80 | (c >> shift))); | |
856 | } | |
857 | while (shift); | |
e8bbfc4e | 858 | } |
0e5921e8 | 859 | #endif |
e8bbfc4e RK |
860 | |
861 | #if 0 | |
e8bbfc4e RK |
862 | struct try_type |
863 | { | |
864 | tree *node_var; | |
865 | char unsigned_flag; | |
866 | char long_flag; | |
867 | char long_long_flag; | |
868 | }; | |
869 | ||
75cb8865 | 870 | struct try_type type_sequence[] = |
e8bbfc4e RK |
871 | { |
872 | { &integer_type_node, 0, 0, 0}, | |
873 | { &unsigned_type_node, 1, 0, 0}, | |
874 | { &long_integer_type_node, 0, 1, 0}, | |
875 | { &long_unsigned_type_node, 1, 1, 0}, | |
876 | { &long_long_integer_type_node, 0, 1, 1}, | |
877 | { &long_long_unsigned_type_node, 1, 1, 1} | |
878 | }; | |
879 | #endif /* 0 */ | |
880 | \f | |
ed513abf KG |
881 | struct pf_args |
882 | { | |
883 | /* Input */ | |
0e5921e8 ZW |
884 | const char *str; |
885 | int fflag; | |
886 | int lflag; | |
ed513abf | 887 | int base; |
fbb18613 | 888 | /* Output */ |
ed513abf | 889 | int conversion_errno; |
ed513abf | 890 | REAL_VALUE_TYPE value; |
0e5921e8 | 891 | tree type; |
ed513abf KG |
892 | }; |
893 | ||
894 | static void | |
895 | parse_float (data) | |
896 | PTR data; | |
897 | { | |
898 | struct pf_args * args = (struct pf_args *) data; | |
0e5921e8 ZW |
899 | const char *typename; |
900 | ||
fbb18613 JM |
901 | args->conversion_errno = 0; |
902 | args->type = double_type_node; | |
0e5921e8 | 903 | typename = "double"; |
ed513abf KG |
904 | |
905 | /* The second argument, machine_mode, of REAL_VALUE_ATOF | |
906 | tells the desired precision of the binary result | |
907 | of decimal-to-binary conversion. */ | |
908 | ||
0e5921e8 | 909 | if (args->fflag) |
ed513abf | 910 | { |
0e5921e8 ZW |
911 | if (args->lflag) |
912 | error ("both 'f' and 'l' suffixes on floating constant"); | |
ed513abf KG |
913 | |
914 | args->type = float_type_node; | |
0e5921e8 | 915 | typename = "float"; |
ed513abf | 916 | } |
0e5921e8 | 917 | else if (args->lflag) |
ed513abf KG |
918 | { |
919 | args->type = long_double_type_node; | |
0e5921e8 | 920 | typename = "long double"; |
ed513abf | 921 | } |
0e5921e8 | 922 | else if (flag_single_precision_constant) |
ed513abf | 923 | { |
0e5921e8 ZW |
924 | args->type = float_type_node; |
925 | typename = "float"; | |
ed513abf | 926 | } |
0e5921e8 ZW |
927 | |
928 | errno = 0; | |
929 | if (args->base == 16) | |
930 | args->value = REAL_VALUE_HTOF (args->str, TYPE_MODE (args->type)); | |
931 | else | |
932 | args->value = REAL_VALUE_ATOF (args->str, TYPE_MODE (args->type)); | |
933 | ||
934 | args->conversion_errno = errno; | |
935 | /* A diagnostic is required here by some ISO C testsuites. | |
936 | This is not pedwarn, because some people don't want | |
937 | an error for this. */ | |
938 | if (REAL_VALUE_ISINF (args->value) && pedantic) | |
939 | warning ("floating point number exceeds range of '%s'", typename); | |
ed513abf KG |
940 | } |
941 | ||
0e5921e8 ZW |
942 | int |
943 | c_lex (value) | |
944 | tree *value; | |
fbb18613 | 945 | { |
23356f93 | 946 | cpp_token tok; |
0e5921e8 ZW |
947 | enum cpp_ttype type; |
948 | ||
949 | retry: | |
950 | timevar_push (TV_CPP); | |
cf44ea52 | 951 | cpp_get_token (parse_in, &tok); |
0e5921e8 ZW |
952 | timevar_pop (TV_CPP); |
953 | ||
954 | /* The C++ front end does horrible things with the current line | |
955 | number. To ensure an accurate line number, we must reset it | |
23356f93 | 956 | every time we return a token. */ |
cf44ea52 | 957 | lex_lineno = cpp_get_line (parse_in)->line; |
0e5921e8 ZW |
958 | |
959 | *value = NULL_TREE; | |
960 | lineno = lex_lineno; | |
23356f93 | 961 | type = tok.type; |
0e5921e8 ZW |
962 | switch (type) |
963 | { | |
964 | case CPP_OPEN_BRACE: indent_level++; break; | |
965 | case CPP_CLOSE_BRACE: indent_level--; break; | |
966 | ||
6c53ebff | 967 | /* Issue this error here, where we can get at tok.val.c. */ |
0e5921e8 | 968 | case CPP_OTHER: |
6c53ebff NB |
969 | if (ISGRAPH (tok.val.c)) |
970 | error ("stray '%c' in program", tok.val.c); | |
0e5921e8 | 971 | else |
6c53ebff | 972 | error ("stray '\\%#o' in program", tok.val.c); |
0e5921e8 ZW |
973 | goto retry; |
974 | ||
0e5921e8 | 975 | case CPP_NAME: |
23356f93 | 976 | *value = get_identifier ((const char *)tok.val.node->name); |
0e5921e8 | 977 | break; |
fbb18613 | 978 | |
0e5921e8 ZW |
979 | case CPP_INT: |
980 | case CPP_FLOAT: | |
981 | case CPP_NUMBER: | |
23356f93 | 982 | *value = lex_number ((const char *)tok.val.str.text, tok.val.str.len); |
0e5921e8 | 983 | break; |
93868d11 | 984 | |
0e5921e8 ZW |
985 | case CPP_CHAR: |
986 | case CPP_WCHAR: | |
23356f93 ZW |
987 | *value = lex_charconst ((const char *)tok.val.str.text, |
988 | tok.val.str.len, tok.type == CPP_WCHAR); | |
0e5921e8 | 989 | break; |
fbb18613 | 990 | |
0e5921e8 ZW |
991 | case CPP_STRING: |
992 | case CPP_WSTRING: | |
993 | case CPP_OSTRING: | |
23356f93 ZW |
994 | *value = lex_string ((const char *)tok.val.str.text, |
995 | tok.val.str.len, tok.type == CPP_WSTRING); | |
0e5921e8 | 996 | break; |
fbb18613 | 997 | |
0e5921e8 ZW |
998 | /* These tokens should not be visible outside cpplib. */ |
999 | case CPP_HEADER_NAME: | |
1000 | case CPP_COMMENT: | |
1001 | case CPP_MACRO_ARG: | |
0e5921e8 ZW |
1002 | abort (); |
1003 | ||
1004 | default: break; | |
1005 | } | |
1006 | ||
1007 | return type; | |
0e5921e8 | 1008 | } |
8d9bfdc5 | 1009 | |
0e5921e8 | 1010 | #define ERROR(msgid) do { error(msgid); goto syntax_error; } while(0) |
75cb8865 | 1011 | |
0e5921e8 ZW |
1012 | static tree |
1013 | lex_number (str, len) | |
1014 | const char *str; | |
1015 | unsigned int len; | |
1016 | { | |
1017 | int base = 10; | |
1018 | int count = 0; | |
1019 | int largest_digit = 0; | |
1020 | int numdigits = 0; | |
1021 | int overflow = 0; | |
1022 | int c; | |
1023 | tree value; | |
1024 | const char *p; | |
1025 | enum anon1 { NOT_FLOAT = 0, AFTER_POINT, AFTER_EXPON } floatflag = NOT_FLOAT; | |
1026 | ||
1027 | /* We actually store only HOST_BITS_PER_CHAR bits in each part. | |
1028 | The code below which fills the parts array assumes that a host | |
1029 | int is at least twice as wide as a host char, and that | |
1030 | HOST_BITS_PER_WIDE_INT is an even multiple of HOST_BITS_PER_CHAR. | |
1031 | Two HOST_WIDE_INTs is the largest int literal we can store. | |
1032 | In order to detect overflow below, the number of parts (TOTAL_PARTS) | |
1033 | must be exactly the number of parts needed to hold the bits | |
1034 | of two HOST_WIDE_INTs. */ | |
1035 | #define TOTAL_PARTS ((HOST_BITS_PER_WIDE_INT / HOST_BITS_PER_CHAR) * 2) | |
1036 | unsigned int parts[TOTAL_PARTS]; | |
1037 | ||
1038 | /* Optimize for most frequent case. */ | |
1039 | if (len == 1) | |
1040 | { | |
1041 | if (*str == '0') | |
1042 | return integer_zero_node; | |
1043 | else if (*str == '1') | |
1044 | return integer_one_node; | |
1045 | else | |
1046 | return build_int_2 (*str - '0', 0); | |
1047 | } | |
e8bbfc4e | 1048 | |
0e5921e8 ZW |
1049 | for (count = 0; count < TOTAL_PARTS; count++) |
1050 | parts[count] = 0; | |
e8bbfc4e | 1051 | |
0e5921e8 ZW |
1052 | /* len is known to be >1 at this point. */ |
1053 | p = str; | |
e8bbfc4e | 1054 | |
0e5921e8 ZW |
1055 | if (len > 2 && str[0] == '0' && (str[1] == 'x' || str[1] == 'X')) |
1056 | { | |
1057 | base = 16; | |
1058 | p = str + 2; | |
1059 | } | |
1060 | /* The ISDIGIT check is so we are not confused by a suffix on 0. */ | |
1061 | else if (str[0] == '0' && ISDIGIT (str[1])) | |
1062 | { | |
1063 | base = 8; | |
1064 | p = str + 1; | |
1065 | } | |
e8bbfc4e | 1066 | |
0e5921e8 ZW |
1067 | do |
1068 | { | |
1069 | c = *p++; | |
88d92ca5 | 1070 | |
0e5921e8 ZW |
1071 | if (c == '.') |
1072 | { | |
1073 | if (base == 16 && pedantic && !flag_isoc99) | |
1074 | pedwarn ("floating constant may not be in radix 16"); | |
1075 | else if (floatflag == AFTER_POINT) | |
1076 | ERROR ("too many decimal points in floating constant"); | |
1077 | else if (floatflag == AFTER_EXPON) | |
1078 | ERROR ("decimal point in exponent - impossible!"); | |
1079 | else | |
1080 | floatflag = AFTER_POINT; | |
c832a30e | 1081 | |
0e5921e8 ZW |
1082 | if (base == 8) |
1083 | base = 10; | |
1084 | } | |
1085 | else if (c == '_') | |
1086 | /* Possible future extension: silently ignore _ in numbers, | |
1087 | permitting cosmetic grouping - e.g. 0x8000_0000 == 0x80000000 | |
1088 | but somewhat easier to read. Ada has this? */ | |
1089 | ERROR ("underscore in number"); | |
1090 | else | |
1091 | { | |
1092 | int n; | |
1093 | /* It is not a decimal point. | |
1094 | It should be a digit (perhaps a hex digit). */ | |
0e0fda0d | 1095 | |
0e5921e8 ZW |
1096 | if (ISDIGIT (c)) |
1097 | { | |
1098 | n = c - '0'; | |
1099 | } | |
1100 | else if (base <= 10 && (c == 'e' || c == 'E')) | |
1101 | { | |
1102 | base = 10; | |
1103 | floatflag = AFTER_EXPON; | |
1104 | break; | |
1105 | } | |
1106 | else if (base == 16 && (c == 'p' || c == 'P')) | |
1107 | { | |
1108 | floatflag = AFTER_EXPON; | |
1109 | break; /* start of exponent */ | |
1110 | } | |
1111 | else if (base == 16 && c >= 'a' && c <= 'f') | |
1112 | { | |
1113 | n = c - 'a' + 10; | |
1114 | } | |
1115 | else if (base == 16 && c >= 'A' && c <= 'F') | |
1116 | { | |
1117 | n = c - 'A' + 10; | |
1118 | } | |
1119 | else | |
1120 | { | |
1121 | p--; | |
1122 | break; /* start of suffix */ | |
1123 | } | |
0e0fda0d | 1124 | |
0e5921e8 ZW |
1125 | if (n >= largest_digit) |
1126 | largest_digit = n; | |
1127 | numdigits++; | |
0e0fda0d | 1128 | |
0e5921e8 ZW |
1129 | for (count = 0; count < TOTAL_PARTS; count++) |
1130 | { | |
1131 | parts[count] *= base; | |
1132 | if (count) | |
1133 | { | |
1134 | parts[count] | |
1135 | += (parts[count-1] >> HOST_BITS_PER_CHAR); | |
1136 | parts[count-1] | |
1137 | &= (1 << HOST_BITS_PER_CHAR) - 1; | |
1138 | } | |
1139 | else | |
1140 | parts[0] += n; | |
1141 | } | |
e8bbfc4e | 1142 | |
0e5921e8 ZW |
1143 | /* If the highest-order part overflows (gets larger than |
1144 | a host char will hold) then the whole number has | |
1145 | overflowed. Record this and truncate the highest-order | |
1146 | part. */ | |
1147 | if (parts[TOTAL_PARTS - 1] >> HOST_BITS_PER_CHAR) | |
1148 | { | |
1149 | overflow = 1; | |
1150 | parts[TOTAL_PARTS - 1] &= (1 << HOST_BITS_PER_CHAR) - 1; | |
1151 | } | |
1152 | } | |
1153 | } | |
1154 | while (p < str + len); | |
91b0989e | 1155 | |
0e5921e8 ZW |
1156 | /* This can happen on input like `int i = 0x;' */ |
1157 | if (numdigits == 0) | |
1158 | ERROR ("numeric constant with no digits"); | |
91b0989e | 1159 | |
0e5921e8 ZW |
1160 | if (largest_digit >= base) |
1161 | ERROR ("numeric constant contains digits beyond the radix"); | |
e8bbfc4e | 1162 | |
0e5921e8 ZW |
1163 | if (floatflag != NOT_FLOAT) |
1164 | { | |
1165 | tree type; | |
1166 | int imag, fflag, lflag, conversion_errno; | |
1167 | REAL_VALUE_TYPE real; | |
1168 | struct pf_args args; | |
1169 | char *copy; | |
1170 | ||
1171 | if (base == 16 && floatflag != AFTER_EXPON) | |
1172 | ERROR ("hexadecimal floating constant has no exponent"); | |
1173 | ||
1174 | /* Read explicit exponent if any, and put it in tokenbuf. */ | |
1175 | if ((base == 10 && ((c == 'e') || (c == 'E'))) | |
1176 | || (base == 16 && (c == 'p' || c == 'P'))) | |
1177 | { | |
1178 | if (p < str + len) | |
1179 | c = *p++; | |
1180 | if (p < str + len && (c == '+' || c == '-')) | |
1181 | c = *p++; | |
1182 | /* Exponent is decimal, even if string is a hex float. */ | |
1183 | if (! ISDIGIT (c)) | |
1184 | ERROR ("floating constant exponent has no digits"); | |
1185 | while (p < str + len && ISDIGIT (c)) | |
1186 | c = *p++; | |
1187 | if (! ISDIGIT (c)) | |
1188 | p--; | |
1189 | } | |
56f48ce9 | 1190 | |
0e5921e8 ZW |
1191 | /* Copy the float constant now; we don't want any suffixes in the |
1192 | string passed to parse_float. */ | |
1193 | copy = alloca (p - str + 1); | |
1194 | memcpy (copy, str, p - str); | |
1195 | copy[p - str] = '\0'; | |
e8bbfc4e | 1196 | |
0e5921e8 ZW |
1197 | /* Now parse suffixes. */ |
1198 | fflag = lflag = imag = 0; | |
1199 | while (p < str + len) | |
1200 | switch (*p++) | |
e8bbfc4e | 1201 | { |
0e5921e8 ZW |
1202 | case 'f': case 'F': |
1203 | if (fflag) | |
1204 | ERROR ("more than one 'f' suffix on floating constant"); | |
1205 | else if (warn_traditional && !in_system_header) | |
1206 | warning ("traditional C rejects the 'f' suffix"); | |
e8bbfc4e | 1207 | |
0e5921e8 ZW |
1208 | fflag = 1; |
1209 | break; | |
e8bbfc4e | 1210 | |
0e5921e8 ZW |
1211 | case 'l': case 'L': |
1212 | if (lflag) | |
1213 | ERROR ("more than one 'l' suffix on floating constant"); | |
1214 | else if (warn_traditional && !in_system_header) | |
1215 | warning ("traditional C rejects the 'l' suffix"); | |
56f48ce9 | 1216 | |
0e5921e8 ZW |
1217 | lflag = 1; |
1218 | break; | |
e8bbfc4e | 1219 | |
0e5921e8 ZW |
1220 | case 'i': case 'I': |
1221 | case 'j': case 'J': | |
1222 | if (imag) | |
1223 | ERROR ("more than one 'i' or 'j' suffix on floating constant"); | |
1224 | else if (pedantic) | |
1225 | pedwarn ("ISO C forbids imaginary numeric constants"); | |
1226 | imag = 1; | |
1227 | break; | |
e8bbfc4e | 1228 | |
0e5921e8 ZW |
1229 | default: |
1230 | ERROR ("invalid suffix on floating constant"); | |
e8bbfc4e RK |
1231 | } |
1232 | ||
0e5921e8 ZW |
1233 | /* Setup input for parse_float() */ |
1234 | args.str = copy; | |
1235 | args.fflag = fflag; | |
1236 | args.lflag = lflag; | |
1237 | args.base = base; | |
e8bbfc4e | 1238 | |
0e5921e8 ZW |
1239 | /* Convert string to a double, checking for overflow. */ |
1240 | if (do_float_handler (parse_float, (PTR) &args)) | |
1241 | { | |
1242 | /* Receive output from parse_float() */ | |
1243 | real = args.value; | |
1244 | } | |
1245 | else | |
1246 | /* We got an exception from parse_float() */ | |
1247 | ERROR ("floating constant out of range"); | |
e8bbfc4e | 1248 | |
0e5921e8 ZW |
1249 | /* Receive output from parse_float() */ |
1250 | conversion_errno = args.conversion_errno; | |
1251 | type = args.type; | |
1252 | ||
1253 | #ifdef ERANGE | |
1254 | /* ERANGE is also reported for underflow, | |
1255 | so test the value to distinguish overflow from that. */ | |
1256 | if (conversion_errno == ERANGE && !flag_traditional && pedantic | |
1257 | && (REAL_VALUES_LESS (dconst1, real) | |
1258 | || REAL_VALUES_LESS (real, dconstm1))) | |
1259 | warning ("floating point number exceeds range of 'double'"); | |
56f48ce9 | 1260 | #endif |
e8bbfc4e | 1261 | |
0e5921e8 ZW |
1262 | /* Create a node with determined type and value. */ |
1263 | if (imag) | |
1264 | value = build_complex (NULL_TREE, convert (type, integer_zero_node), | |
1265 | build_real (type, real)); | |
1266 | else | |
1267 | value = build_real (type, real); | |
1268 | } | |
1269 | else | |
1270 | { | |
1271 | tree trad_type, ansi_type, type; | |
1272 | HOST_WIDE_INT high, low; | |
1273 | int spec_unsigned = 0; | |
1274 | int spec_long = 0; | |
1275 | int spec_long_long = 0; | |
1276 | int spec_imag = 0; | |
1277 | int suffix_lu = 0; | |
1278 | int warn = 0, i; | |
1279 | ||
1280 | trad_type = ansi_type = type = NULL_TREE; | |
1281 | while (p < str + len) | |
1282 | { | |
1283 | c = *p++; | |
1284 | switch (c) | |
1285 | { | |
1286 | case 'u': case 'U': | |
1287 | if (spec_unsigned) | |
1288 | error ("two 'u' suffixes on integer constant"); | |
1289 | else if (warn_traditional && !in_system_header) | |
1290 | warning ("traditional C rejects the 'u' suffix"); | |
1291 | ||
1292 | spec_unsigned = 1; | |
1293 | if (spec_long) | |
1294 | suffix_lu = 1; | |
1295 | break; | |
e8bbfc4e | 1296 | |
0e5921e8 ZW |
1297 | case 'l': case 'L': |
1298 | if (spec_long) | |
1299 | { | |
1300 | if (spec_long_long) | |
1301 | error ("three 'l' suffixes on integer constant"); | |
1302 | else if (suffix_lu) | |
1303 | error ("'lul' is not a valid integer suffix"); | |
1304 | else if (c != spec_long) | |
1305 | error ("'Ll' and 'lL' are not valid integer suffixes"); | |
1306 | else if (pedantic && ! flag_isoc99 | |
1307 | && ! in_system_header && warn_long_long) | |
1308 | pedwarn ("ISO C89 forbids long long integer constants"); | |
1309 | spec_long_long = 1; | |
1310 | } | |
1311 | spec_long = c; | |
1312 | break; | |
56f48ce9 | 1313 | |
0e5921e8 ZW |
1314 | case 'i': case 'I': case 'j': case 'J': |
1315 | if (spec_imag) | |
1316 | error ("more than one 'i' or 'j' suffix on integer constant"); | |
1317 | else if (pedantic) | |
1318 | pedwarn ("ISO C forbids imaginary numeric constants"); | |
1319 | spec_imag = 1; | |
1320 | break; | |
56f48ce9 | 1321 | |
0e5921e8 ZW |
1322 | default: |
1323 | ERROR ("invalid suffix on integer constant"); | |
1324 | } | |
1325 | } | |
56f48ce9 | 1326 | |
0e5921e8 ZW |
1327 | /* If the literal overflowed, pedwarn about it now. */ |
1328 | if (overflow) | |
1329 | { | |
1330 | warn = 1; | |
1331 | pedwarn ("integer constant is too large for this configuration of the compiler - truncated to %d bits", HOST_BITS_PER_WIDE_INT * 2); | |
1332 | } | |
e8bbfc4e | 1333 | |
0e5921e8 ZW |
1334 | /* This is simplified by the fact that our constant |
1335 | is always positive. */ | |
56f48ce9 | 1336 | |
0e5921e8 | 1337 | high = low = 0; |
e8bbfc4e | 1338 | |
0e5921e8 ZW |
1339 | for (i = 0; i < HOST_BITS_PER_WIDE_INT / HOST_BITS_PER_CHAR; i++) |
1340 | { | |
1341 | high |= ((HOST_WIDE_INT) parts[i + (HOST_BITS_PER_WIDE_INT | |
1342 | / HOST_BITS_PER_CHAR)] | |
1343 | << (i * HOST_BITS_PER_CHAR)); | |
1344 | low |= (HOST_WIDE_INT) parts[i] << (i * HOST_BITS_PER_CHAR); | |
1345 | } | |
0468bc75 | 1346 | |
0e5921e8 ZW |
1347 | value = build_int_2 (low, high); |
1348 | TREE_TYPE (value) = long_long_unsigned_type_node; | |
e8bbfc4e | 1349 | |
0e5921e8 ZW |
1350 | /* If warn_traditional, calculate both the ISO type and the |
1351 | traditional type, then see if they disagree. | |
1352 | Otherwise, calculate only the type for the dialect in use. */ | |
1353 | if (warn_traditional || flag_traditional) | |
1354 | { | |
1355 | /* Calculate the traditional type. */ | |
1356 | /* Traditionally, any constant is signed; but if unsigned is | |
1357 | specified explicitly, obey that. Use the smallest size | |
1358 | with the right number of bits, except for one special | |
1359 | case with decimal constants. */ | |
1360 | if (! spec_long && base != 10 | |
1361 | && int_fits_type_p (value, unsigned_type_node)) | |
1362 | trad_type = spec_unsigned ? unsigned_type_node : integer_type_node; | |
1363 | /* A decimal constant must be long if it does not fit in | |
1364 | type int. I think this is independent of whether the | |
1365 | constant is signed. */ | |
1366 | else if (! spec_long && base == 10 | |
1367 | && int_fits_type_p (value, integer_type_node)) | |
1368 | trad_type = spec_unsigned ? unsigned_type_node : integer_type_node; | |
1369 | else if (! spec_long_long) | |
1370 | trad_type = (spec_unsigned | |
1371 | ? long_unsigned_type_node | |
1372 | : long_integer_type_node); | |
1373 | else if (int_fits_type_p (value, | |
1374 | spec_unsigned | |
1375 | ? long_long_unsigned_type_node | |
1376 | : long_long_integer_type_node)) | |
1377 | trad_type = (spec_unsigned | |
1378 | ? long_long_unsigned_type_node | |
1379 | : long_long_integer_type_node); | |
1380 | else | |
1381 | trad_type = (spec_unsigned | |
1382 | ? widest_unsigned_literal_type_node | |
1383 | : widest_integer_literal_type_node); | |
1384 | } | |
1385 | if (warn_traditional || ! flag_traditional) | |
1386 | { | |
1387 | /* Calculate the ISO type. */ | |
1388 | if (! spec_long && ! spec_unsigned | |
1389 | && int_fits_type_p (value, integer_type_node)) | |
1390 | ansi_type = integer_type_node; | |
1391 | else if (! spec_long && (base != 10 || spec_unsigned) | |
1392 | && int_fits_type_p (value, unsigned_type_node)) | |
1393 | ansi_type = unsigned_type_node; | |
1394 | else if (! spec_unsigned && !spec_long_long | |
1395 | && int_fits_type_p (value, long_integer_type_node)) | |
1396 | ansi_type = long_integer_type_node; | |
1397 | else if (! spec_long_long | |
1398 | && int_fits_type_p (value, long_unsigned_type_node)) | |
1399 | ansi_type = long_unsigned_type_node; | |
1400 | else if (! spec_unsigned | |
1401 | && int_fits_type_p (value, long_long_integer_type_node)) | |
1402 | ansi_type = long_long_integer_type_node; | |
1403 | else if (int_fits_type_p (value, long_long_unsigned_type_node)) | |
1404 | ansi_type = long_long_unsigned_type_node; | |
1405 | else if (! spec_unsigned | |
1406 | && int_fits_type_p (value, widest_integer_literal_type_node)) | |
1407 | ansi_type = widest_integer_literal_type_node; | |
1408 | else | |
1409 | ansi_type = widest_unsigned_literal_type_node; | |
1410 | } | |
e8bbfc4e | 1411 | |
0e5921e8 | 1412 | type = flag_traditional ? trad_type : ansi_type; |
e8bbfc4e | 1413 | |
0e5921e8 ZW |
1414 | /* We assume that constants specified in a non-decimal |
1415 | base are bit patterns, and that the programmer really | |
1416 | meant what they wrote. */ | |
1417 | if (warn_traditional && !in_system_header | |
1418 | && base == 10 && trad_type != ansi_type) | |
1419 | { | |
1420 | if (TYPE_PRECISION (trad_type) != TYPE_PRECISION (ansi_type)) | |
1421 | warning ("width of integer constant changes with -traditional"); | |
1422 | else if (TREE_UNSIGNED (trad_type) != TREE_UNSIGNED (ansi_type)) | |
1423 | warning ("integer constant is unsigned in ISO C, signed with -traditional"); | |
1424 | else | |
1425 | warning ("width of integer constant may change on other systems with -traditional"); | |
1426 | } | |
e8bbfc4e | 1427 | |
b15ad712 JM |
1428 | if (pedantic && !flag_traditional && (flag_isoc99 || !spec_long_long) |
1429 | && !warn | |
1430 | && ((flag_isoc99 | |
1431 | ? TYPE_PRECISION (long_long_integer_type_node) | |
1432 | : TYPE_PRECISION (long_integer_type_node)) < TYPE_PRECISION (type))) | |
0e5921e8 ZW |
1433 | { |
1434 | warn = 1; | |
b15ad712 JM |
1435 | pedwarn ("integer constant larger than the maximum value of %s", |
1436 | (flag_isoc99 | |
1437 | ? (TREE_UNSIGNED (type) | |
1438 | ? "an unsigned long long int" | |
1439 | : "a long long int") | |
1440 | : "an unsigned long int")); | |
0e5921e8 | 1441 | } |
e8bbfc4e | 1442 | |
0e5921e8 ZW |
1443 | if (base == 10 && ! spec_unsigned && TREE_UNSIGNED (type)) |
1444 | warning ("decimal constant is so large that it is unsigned"); | |
e8bbfc4e | 1445 | |
0e5921e8 ZW |
1446 | if (spec_imag) |
1447 | { | |
1448 | if (TYPE_PRECISION (type) | |
1449 | <= TYPE_PRECISION (integer_type_node)) | |
1450 | value = build_complex (NULL_TREE, integer_zero_node, | |
1451 | convert (integer_type_node, value)); | |
1452 | else | |
1453 | ERROR ("complex integer constant is too wide for 'complex int'"); | |
1454 | } | |
1455 | else if (flag_traditional && !int_fits_type_p (value, type)) | |
1456 | /* The traditional constant 0x80000000 is signed | |
1457 | but doesn't fit in the range of int. | |
1458 | This will change it to -0x80000000, which does fit. */ | |
1459 | { | |
1460 | TREE_TYPE (value) = unsigned_type (type); | |
1461 | value = convert (type, value); | |
1462 | TREE_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (value) = 0; | |
1463 | } | |
1464 | else | |
1465 | TREE_TYPE (value) = type; | |
e8bbfc4e | 1466 | |
0e5921e8 ZW |
1467 | /* If it's still an integer (not a complex), and it doesn't |
1468 | fit in the type we choose for it, then pedwarn. */ | |
fbb18613 | 1469 | |
0e5921e8 ZW |
1470 | if (! warn |
1471 | && TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE | |
1472 | && ! int_fits_type_p (value, TREE_TYPE (value))) | |
1473 | pedwarn ("integer constant is larger than the maximum value for its type"); | |
1474 | } | |
fbb18613 | 1475 | |
0e5921e8 ZW |
1476 | if (p < str + len) |
1477 | error ("missing white space after number '%.*s'", (int) (p - str), str); | |
e8bbfc4e | 1478 | |
0e5921e8 | 1479 | return value; |
e8bbfc4e | 1480 | |
0e5921e8 ZW |
1481 | syntax_error: |
1482 | return integer_zero_node; | |
1483 | } | |
e8bbfc4e | 1484 | |
0e5921e8 ZW |
1485 | static tree |
1486 | lex_string (str, len, wide) | |
1487 | const char *str; | |
1488 | unsigned int len; | |
1489 | int wide; | |
1490 | { | |
1491 | tree value; | |
1492 | char *buf = alloca ((len + 1) * (wide ? WCHAR_BYTES : 1)); | |
1493 | char *q = buf; | |
1494 | const char *p = str, *limit = str + len; | |
1495 | unsigned int c; | |
1496 | unsigned width = wide ? WCHAR_TYPE_SIZE | |
1497 | : TYPE_PRECISION (char_type_node); | |
e9a25f70 | 1498 | |
0e5921e8 ZW |
1499 | #ifdef MULTIBYTE_CHARS |
1500 | /* Reset multibyte conversion state. */ | |
1501 | (void) local_mbtowc (NULL_PTR, NULL_PTR, 0); | |
1502 | #endif | |
e9a25f70 | 1503 | |
0e5921e8 ZW |
1504 | while (p < limit) |
1505 | { | |
1506 | #ifdef MULTIBYTE_CHARS | |
1507 | wchar_t wc; | |
1508 | int char_len; | |
1509 | ||
1510 | char_len = local_mbtowc (&wc, p, limit - p); | |
1511 | if (char_len == -1) | |
1512 | { | |
1513 | warning ("Ignoring invalid multibyte character"); | |
1514 | char_len = 1; | |
1515 | c = *p++; | |
1516 | } | |
1517 | else | |
1518 | { | |
1519 | p += char_len; | |
1520 | c = wc; | |
1521 | } | |
1522 | #else | |
1523 | c = *p++; | |
1524 | #endif | |
1525 | ||
1526 | if (c == '\\' && !ignore_escape_flag) | |
1527 | { | |
1528 | p = readescape (p, limit, &c); | |
1529 | if (width < HOST_BITS_PER_INT | |
1530 | && (unsigned) c >= ((unsigned)1 << width)) | |
1531 | pedwarn ("escape sequence out of range for character"); | |
1532 | } | |
1533 | ||
1534 | /* Add this single character into the buffer either as a wchar_t | |
1535 | or as a single byte. */ | |
1536 | if (wide) | |
1537 | { | |
1538 | unsigned charwidth = TYPE_PRECISION (char_type_node); | |
5c80f6e6 | 1539 | unsigned bytemask = (1 << charwidth) - 1; |
0e5921e8 ZW |
1540 | int byte; |
1541 | ||
1542 | for (byte = 0; byte < WCHAR_BYTES; ++byte) | |
1543 | { | |
1544 | int n; | |
1545 | if (byte >= (int) sizeof (c)) | |
1546 | n = 0; | |
1547 | else | |
1548 | n = (c >> (byte * charwidth)) & bytemask; | |
1549 | if (BYTES_BIG_ENDIAN) | |
1550 | q[WCHAR_BYTES - byte - 1] = n; | |
1551 | else | |
1552 | q[byte] = n; | |
1553 | } | |
1554 | q += WCHAR_BYTES; | |
1555 | } | |
1556 | else | |
1557 | { | |
1558 | *q++ = c; | |
1559 | } | |
e8bbfc4e RK |
1560 | } |
1561 | ||
0e5921e8 ZW |
1562 | /* Terminate the string value, either with a single byte zero |
1563 | or with a wide zero. */ | |
e8bbfc4e | 1564 | |
0e5921e8 ZW |
1565 | if (wide) |
1566 | { | |
1567 | memset (q, 0, WCHAR_BYTES); | |
1568 | q += WCHAR_BYTES; | |
1569 | } | |
1570 | else | |
1571 | { | |
1572 | *q++ = '\0'; | |
1573 | } | |
1574 | ||
1575 | value = build_string (q - buf, buf); | |
1576 | ||
1577 | if (wide) | |
1578 | TREE_TYPE (value) = wchar_array_type_node; | |
1579 | else | |
1580 | TREE_TYPE (value) = char_array_type_node; | |
e8bbfc4e RK |
1581 | return value; |
1582 | } | |
1583 | ||
0e5921e8 ZW |
1584 | static tree |
1585 | lex_charconst (str, len, wide) | |
1586 | const char *str; | |
1587 | unsigned int len; | |
1588 | int wide; | |
e8bbfc4e | 1589 | { |
0e5921e8 ZW |
1590 | const char *limit = str + len; |
1591 | int result = 0; | |
1592 | int num_chars = 0; | |
1593 | int chars_seen = 0; | |
1594 | unsigned width = TYPE_PRECISION (char_type_node); | |
1595 | int max_chars; | |
1596 | unsigned int c; | |
1597 | tree value; | |
1598 | ||
1599 | #ifdef MULTIBYTE_CHARS | |
1600 | int longest_char = local_mb_cur_max (); | |
1601 | (void) local_mbtowc (NULL_PTR, NULL_PTR, 0); | |
1602 | #endif | |
1603 | ||
1604 | max_chars = TYPE_PRECISION (integer_type_node) / width; | |
1605 | if (wide) | |
1606 | width = WCHAR_TYPE_SIZE; | |
1607 | ||
1608 | while (str < limit) | |
1609 | { | |
1610 | #ifdef MULTIBYTE_CHARS | |
1611 | wchar_t wc; | |
1612 | int char_len; | |
1613 | ||
1614 | char_len = local_mbtowc (&wc, str, limit - str); | |
1615 | if (char_len == -1) | |
1616 | { | |
1617 | warning ("Ignoring invalid multibyte character"); | |
1618 | char_len = 1; | |
1619 | c = *str++; | |
1620 | } | |
1621 | else | |
1622 | { | |
1623 | p += char_len; | |
1624 | c = wc; | |
1625 | } | |
e8bbfc4e | 1626 | #else |
0e5921e8 ZW |
1627 | c = *str++; |
1628 | #endif | |
1629 | ||
1630 | ++chars_seen; | |
1631 | if (c == '\\') | |
1632 | { | |
1633 | str = readescape (str, limit, &c); | |
1634 | if (width < HOST_BITS_PER_INT | |
1635 | && (unsigned) c >= ((unsigned)1 << width)) | |
1636 | pedwarn ("escape sequence out of range for character"); | |
1637 | } | |
1638 | #ifdef MAP_CHARACTER | |
1639 | if (ISPRINT (c)) | |
1640 | c = MAP_CHARACTER (c); | |
e8bbfc4e | 1641 | #endif |
0e5921e8 ZW |
1642 | |
1643 | /* Merge character into result; ignore excess chars. */ | |
1644 | num_chars += (width / TYPE_PRECISION (char_type_node)); | |
1645 | if (num_chars < max_chars + 1) | |
1646 | { | |
1647 | if (width < HOST_BITS_PER_INT) | |
1648 | result = (result << width) | (c & ((1 << width) - 1)); | |
1649 | else | |
1650 | result = c; | |
1651 | } | |
1652 | } | |
1653 | ||
1654 | if (chars_seen == 0) | |
1655 | error ("empty character constant"); | |
1656 | else if (num_chars > max_chars) | |
1657 | { | |
1658 | num_chars = max_chars; | |
1659 | error ("character constant too long"); | |
1660 | } | |
1661 | else if (chars_seen != 1 && ! flag_traditional && warn_multichar) | |
1662 | warning ("multi-character character constant"); | |
1663 | ||
1664 | /* If char type is signed, sign-extend the constant. */ | |
1665 | if (! wide) | |
1666 | { | |
1667 | int num_bits = num_chars * width; | |
1668 | if (num_bits == 0) | |
1669 | /* We already got an error; avoid invalid shift. */ | |
1670 | value = build_int_2 (0, 0); | |
1671 | else if (TREE_UNSIGNED (char_type_node) | |
1672 | || ((result >> (num_bits - 1)) & 1) == 0) | |
1673 | value = build_int_2 (result & (~(unsigned HOST_WIDE_INT) 0 | |
1674 | >> (HOST_BITS_PER_WIDE_INT - num_bits)), | |
1675 | 0); | |
1676 | else | |
1677 | value = build_int_2 (result | ~(~(unsigned HOST_WIDE_INT) 0 | |
1678 | >> (HOST_BITS_PER_WIDE_INT - num_bits)), | |
1679 | -1); | |
1680 | /* In C, a character constant has type 'int'; in C++, 'char'. */ | |
1681 | if (chars_seen <= 1 && c_language == clk_cplusplus) | |
1682 | TREE_TYPE (value) = char_type_node; | |
1683 | else | |
1684 | TREE_TYPE (value) = integer_type_node; | |
1685 | } | |
1686 | else | |
1687 | { | |
1688 | value = build_int_2 (result, 0); | |
1689 | TREE_TYPE (value) = wchar_type_node; | |
1690 | } | |
1691 | ||
1692 | return value; | |
e8bbfc4e | 1693 | } |