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