]>
Commit | Line | Data |
---|---|---|
45b966db | 1 | /* CPP Library - lexical analysis. |
35c3d610 | 2 | Copyright (C) 2000-2014 Free Software Foundation, Inc. |
45b966db ZW |
3 | Contributed by Per Bothner, 1994-95. |
4 | Based on CCCP program by Paul Rubin, June 1986 | |
5 | Adapted to ANSI C, Richard Stallman, Jan 1987 | |
6 | Broken out to separate file, Zack Weinberg, Mar 2000 | |
7 | ||
8 | This program is free software; you can redistribute it and/or modify it | |
9 | under the terms of the GNU General Public License as published by the | |
748086b7 | 10 | Free Software Foundation; either version 3, or (at your option) any |
45b966db ZW |
11 | later version. |
12 | ||
13 | This program is distributed in the hope that it will be useful, | |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
748086b7 JJ |
19 | along with this program; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
45b966db ZW |
21 | |
22 | #include "config.h" | |
23 | #include "system.h" | |
45b966db | 24 | #include "cpplib.h" |
4f4e53dd | 25 | #include "internal.h" |
45b966db | 26 | |
93c80368 | 27 | enum spell_type |
f9a0e96c | 28 | { |
93c80368 | 29 | SPELL_OPERATOR = 0, |
93c80368 | 30 | SPELL_IDENT, |
6338b358 | 31 | SPELL_LITERAL, |
93c80368 | 32 | SPELL_NONE |
f9a0e96c ZW |
33 | }; |
34 | ||
93c80368 | 35 | struct token_spelling |
f9a0e96c | 36 | { |
93c80368 NB |
37 | enum spell_type category; |
38 | const unsigned char *name; | |
f9a0e96c ZW |
39 | }; |
40 | ||
8206c799 | 41 | static const unsigned char *const digraph_spellings[] = |
b6baa67d | 42 | { UC"%:", UC"%:%:", UC"<:", UC":>", UC"<%", UC"%>" }; |
93c80368 | 43 | |
b6baa67d KVH |
44 | #define OP(e, s) { SPELL_OPERATOR, UC s }, |
45 | #define TK(e, s) { SPELL_ ## s, UC #e }, | |
8206c799 | 46 | static const struct token_spelling token_spellings[N_TTYPES] = { TTYPE_TABLE }; |
93c80368 NB |
47 | #undef OP |
48 | #undef TK | |
49 | ||
50 | #define TOKEN_SPELL(token) (token_spellings[(token)->type].category) | |
51 | #define TOKEN_NAME(token) (token_spellings[(token)->type].name) | |
f2d5f0cc | 52 | |
6cf87ca4 ZW |
53 | static void add_line_note (cpp_buffer *, const uchar *, unsigned int); |
54 | static int skip_line_comment (cpp_reader *); | |
55 | static void skip_whitespace (cpp_reader *, cppchar_t); | |
6cf87ca4 ZW |
56 | static void lex_string (cpp_reader *, cpp_token *, const uchar *); |
57 | static void save_comment (cpp_reader *, cpp_token *, const uchar *, cppchar_t); | |
631d0d36 | 58 | static void store_comment (cpp_reader *, cpp_token *); |
6cf87ca4 ZW |
59 | static void create_literal (cpp_reader *, cpp_token *, const uchar *, |
60 | unsigned int, enum cpp_ttype); | |
61 | static bool warn_in_comment (cpp_reader *, _cpp_line_note *); | |
62 | static int name_p (cpp_reader *, const cpp_string *); | |
6cf87ca4 ZW |
63 | static tokenrun *next_tokenrun (tokenrun *); |
64 | ||
6cf87ca4 | 65 | static _cpp_buff *new_buff (size_t); |
15dad1d9 | 66 | |
9d10c9a9 | 67 | |
041c3194 | 68 | /* Utility routine: |
9e62c811 | 69 | |
bfb9dc7f ZW |
70 | Compares, the token TOKEN to the NUL-terminated string STRING. |
71 | TOKEN must be a CPP_NAME. Returns 1 for equal, 0 for unequal. */ | |
041c3194 | 72 | int |
6cf87ca4 | 73 | cpp_ideq (const cpp_token *token, const char *string) |
041c3194 | 74 | { |
bfb9dc7f | 75 | if (token->type != CPP_NAME) |
041c3194 | 76 | return 0; |
bfb9dc7f | 77 | |
9a0c6187 | 78 | return !ustrcmp (NODE_NAME (token->val.node.node), (const uchar *) string); |
15dad1d9 | 79 | } |
1368ee70 | 80 | |
26aea073 NB |
81 | /* Record a note TYPE at byte POS into the current cleaned logical |
82 | line. */ | |
87062813 | 83 | static void |
6cf87ca4 | 84 | add_line_note (cpp_buffer *buffer, const uchar *pos, unsigned int type) |
0d9f234d | 85 | { |
26aea073 NB |
86 | if (buffer->notes_used == buffer->notes_cap) |
87 | { | |
88 | buffer->notes_cap = buffer->notes_cap * 2 + 200; | |
c3f829c1 GDR |
89 | buffer->notes = XRESIZEVEC (_cpp_line_note, buffer->notes, |
90 | buffer->notes_cap); | |
26aea073 | 91 | } |
0d9f234d | 92 | |
26aea073 NB |
93 | buffer->notes[buffer->notes_used].pos = pos; |
94 | buffer->notes[buffer->notes_used].type = type; | |
95 | buffer->notes_used++; | |
0d9f234d NB |
96 | } |
97 | ||
246a2fcb RH |
98 | \f |
99 | /* Fast path to find line special characters using optimized character | |
100 | scanning algorithms. Anything complicated falls back to the slow | |
101 | path below. Since this loop is very hot it's worth doing these kinds | |
102 | of optimizations. | |
103 | ||
104 | One of the paths through the ifdefs should provide | |
105 | ||
106 | const uchar *search_line_fast (const uchar *s, const uchar *end); | |
107 | ||
108 | Between S and END, search for \n, \r, \\, ?. Return a pointer to | |
109 | the found character. | |
110 | ||
111 | Note that the last character of the buffer is *always* a newline, | |
112 | as forced by _cpp_convert_input. This fact can be used to avoid | |
113 | explicitly looking for the end of the buffer. */ | |
114 | ||
115 | /* Configure gives us an ifdef test. */ | |
116 | #ifndef WORDS_BIGENDIAN | |
117 | #define WORDS_BIGENDIAN 0 | |
118 | #endif | |
119 | ||
120 | /* We'd like the largest integer that fits into a register. There's nothing | |
121 | in <stdint.h> that gives us that. For most hosts this is unsigned long, | |
122 | but MS decided on an LLP64 model. Thankfully when building with GCC we | |
123 | can get the "real" word size. */ | |
124 | #ifdef __GNUC__ | |
125 | typedef unsigned int word_type __attribute__((__mode__(__word__))); | |
126 | #else | |
127 | typedef unsigned long word_type; | |
128 | #endif | |
129 | ||
130 | /* The code below is only expecting sizes 4 or 8. | |
131 | Die at compile-time if this expectation is violated. */ | |
132 | typedef char check_word_type_size | |
133 | [(sizeof(word_type) == 8 || sizeof(word_type) == 4) * 2 - 1]; | |
134 | ||
135 | /* Return X with the first N bytes forced to values that won't match one | |
136 | of the interesting characters. Note that NUL is not interesting. */ | |
137 | ||
138 | static inline word_type | |
139 | acc_char_mask_misalign (word_type val, unsigned int n) | |
140 | { | |
141 | word_type mask = -1; | |
142 | if (WORDS_BIGENDIAN) | |
143 | mask >>= n * 8; | |
144 | else | |
145 | mask <<= n * 8; | |
146 | return val & mask; | |
147 | } | |
148 | ||
149 | /* Return X replicated to all byte positions within WORD_TYPE. */ | |
150 | ||
151 | static inline word_type | |
152 | acc_char_replicate (uchar x) | |
153 | { | |
154 | word_type ret; | |
155 | ||
156 | ret = (x << 24) | (x << 16) | (x << 8) | x; | |
157 | if (sizeof(word_type) == 8) | |
158 | ret = (ret << 16 << 16) | ret; | |
159 | return ret; | |
160 | } | |
161 | ||
162 | /* Return non-zero if some byte of VAL is (probably) C. */ | |
163 | ||
164 | static inline word_type | |
165 | acc_char_cmp (word_type val, word_type c) | |
166 | { | |
167 | #if defined(__GNUC__) && defined(__alpha__) | |
168 | /* We can get exact results using a compare-bytes instruction. | |
169 | Get (val == c) via (0 >= (val ^ c)). */ | |
170 | return __builtin_alpha_cmpbge (0, val ^ c); | |
171 | #else | |
172 | word_type magic = 0x7efefefeU; | |
173 | if (sizeof(word_type) == 8) | |
174 | magic = (magic << 16 << 16) | 0xfefefefeU; | |
175 | magic |= 1; | |
176 | ||
177 | val ^= c; | |
178 | return ((val + magic) ^ ~val) & ~magic; | |
179 | #endif | |
180 | } | |
181 | ||
182 | /* Given the result of acc_char_cmp is non-zero, return the index of | |
183 | the found character. If this was a false positive, return -1. */ | |
184 | ||
185 | static inline int | |
186 | acc_char_index (word_type cmp ATTRIBUTE_UNUSED, | |
187 | word_type val ATTRIBUTE_UNUSED) | |
188 | { | |
189 | #if defined(__GNUC__) && defined(__alpha__) && !WORDS_BIGENDIAN | |
190 | /* The cmpbge instruction sets *bits* of the result corresponding to | |
191 | matches in the bytes with no false positives. */ | |
192 | return __builtin_ctzl (cmp); | |
193 | #else | |
194 | unsigned int i; | |
195 | ||
196 | /* ??? It would be nice to force unrolling here, | |
197 | and have all of these constants folded. */ | |
198 | for (i = 0; i < sizeof(word_type); ++i) | |
199 | { | |
200 | uchar c; | |
201 | if (WORDS_BIGENDIAN) | |
202 | c = (val >> (sizeof(word_type) - i - 1) * 8) & 0xff; | |
203 | else | |
204 | c = (val >> i * 8) & 0xff; | |
205 | ||
206 | if (c == '\n' || c == '\r' || c == '\\' || c == '?') | |
207 | return i; | |
208 | } | |
209 | ||
210 | return -1; | |
211 | #endif | |
212 | } | |
213 | ||
214 | /* A version of the fast scanner using bit fiddling techniques. | |
215 | ||
216 | For 32-bit words, one would normally perform 16 comparisons and | |
217 | 16 branches. With this algorithm one performs 24 arithmetic | |
218 | operations and one branch. Whether this is faster with a 32-bit | |
219 | word size is going to be somewhat system dependent. | |
220 | ||
221 | For 64-bit words, we eliminate twice the number of comparisons | |
222 | and branches without increasing the number of arithmetic operations. | |
223 | It's almost certainly going to be a win with 64-bit word size. */ | |
224 | ||
225 | static const uchar * search_line_acc_char (const uchar *, const uchar *) | |
226 | ATTRIBUTE_UNUSED; | |
227 | ||
228 | static const uchar * | |
229 | search_line_acc_char (const uchar *s, const uchar *end ATTRIBUTE_UNUSED) | |
230 | { | |
231 | const word_type repl_nl = acc_char_replicate ('\n'); | |
232 | const word_type repl_cr = acc_char_replicate ('\r'); | |
233 | const word_type repl_bs = acc_char_replicate ('\\'); | |
234 | const word_type repl_qm = acc_char_replicate ('?'); | |
235 | ||
236 | unsigned int misalign; | |
237 | const word_type *p; | |
238 | word_type val, t; | |
239 | ||
240 | /* Align the buffer. Mask out any bytes from before the beginning. */ | |
241 | p = (word_type *)((uintptr_t)s & -sizeof(word_type)); | |
242 | val = *p; | |
243 | misalign = (uintptr_t)s & (sizeof(word_type) - 1); | |
244 | if (misalign) | |
245 | val = acc_char_mask_misalign (val, misalign); | |
246 | ||
247 | /* Main loop. */ | |
248 | while (1) | |
249 | { | |
250 | t = acc_char_cmp (val, repl_nl); | |
251 | t |= acc_char_cmp (val, repl_cr); | |
252 | t |= acc_char_cmp (val, repl_bs); | |
253 | t |= acc_char_cmp (val, repl_qm); | |
254 | ||
255 | if (__builtin_expect (t != 0, 0)) | |
256 | { | |
257 | int i = acc_char_index (t, val); | |
258 | if (i >= 0) | |
259 | return (const uchar *)p + i; | |
260 | } | |
261 | ||
262 | val = *++p; | |
263 | } | |
264 | } | |
265 | ||
d9f069ab | 266 | /* Disable on Solaris 2/x86 until the following problem can be properly |
789d73cb RO |
267 | autoconfed: |
268 | ||
789d73cb RO |
269 | The Solaris 10+ assembler tags objects with the instruction set |
270 | extensions used, so SSE4.2 executables cannot run on machines that | |
271 | don't support that extension. */ | |
272 | ||
273 | #if (GCC_VERSION >= 4005) && (defined(__i386__) || defined(__x86_64__)) && !(defined(__sun__) && defined(__svr4__)) | |
246a2fcb RH |
274 | |
275 | /* Replicated character data to be shared between implementations. | |
276 | Recall that outside of a context with vector support we can't | |
277 | define compatible vector types, therefore these are all defined | |
278 | in terms of raw characters. */ | |
279 | static const char repl_chars[4][16] __attribute__((aligned(16))) = { | |
280 | { '\n', '\n', '\n', '\n', '\n', '\n', '\n', '\n', | |
281 | '\n', '\n', '\n', '\n', '\n', '\n', '\n', '\n' }, | |
282 | { '\r', '\r', '\r', '\r', '\r', '\r', '\r', '\r', | |
283 | '\r', '\r', '\r', '\r', '\r', '\r', '\r', '\r' }, | |
284 | { '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', | |
285 | '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\' }, | |
286 | { '?', '?', '?', '?', '?', '?', '?', '?', | |
287 | '?', '?', '?', '?', '?', '?', '?', '?' }, | |
288 | }; | |
289 | ||
290 | /* A version of the fast scanner using MMX vectorized byte compare insns. | |
291 | ||
292 | This uses the PMOVMSKB instruction which was introduced with "MMX2", | |
ef230b38 | 293 | which was packaged into SSE1; it is also present in the AMD MMX |
246a2fcb RH |
294 | extension. Mark the function as using "sse" so that we emit a real |
295 | "emms" instruction, rather than the 3dNOW "femms" instruction. */ | |
296 | ||
297 | static const uchar * | |
298 | #ifndef __SSE__ | |
299 | __attribute__((__target__("sse"))) | |
300 | #endif | |
301 | search_line_mmx (const uchar *s, const uchar *end ATTRIBUTE_UNUSED) | |
302 | { | |
303 | typedef char v8qi __attribute__ ((__vector_size__ (8))); | |
304 | typedef int __m64 __attribute__ ((__vector_size__ (8), __may_alias__)); | |
305 | ||
306 | const v8qi repl_nl = *(const v8qi *)repl_chars[0]; | |
307 | const v8qi repl_cr = *(const v8qi *)repl_chars[1]; | |
308 | const v8qi repl_bs = *(const v8qi *)repl_chars[2]; | |
309 | const v8qi repl_qm = *(const v8qi *)repl_chars[3]; | |
310 | ||
311 | unsigned int misalign, found, mask; | |
312 | const v8qi *p; | |
313 | v8qi data, t, c; | |
314 | ||
315 | /* Align the source pointer. While MMX doesn't generate unaligned data | |
316 | faults, this allows us to safely scan to the end of the buffer without | |
317 | reading beyond the end of the last page. */ | |
318 | misalign = (uintptr_t)s & 7; | |
319 | p = (const v8qi *)((uintptr_t)s & -8); | |
320 | data = *p; | |
321 | ||
322 | /* Create a mask for the bytes that are valid within the first | |
323 | 16-byte block. The Idea here is that the AND with the mask | |
324 | within the loop is "free", since we need some AND or TEST | |
325 | insn in order to set the flags for the branch anyway. */ | |
326 | mask = -1u << misalign; | |
327 | ||
328 | /* Main loop processing 8 bytes at a time. */ | |
329 | goto start; | |
330 | do | |
331 | { | |
332 | data = *++p; | |
333 | mask = -1; | |
334 | ||
335 | start: | |
336 | t = __builtin_ia32_pcmpeqb(data, repl_nl); | |
337 | c = __builtin_ia32_pcmpeqb(data, repl_cr); | |
338 | t = (v8qi) __builtin_ia32_por ((__m64)t, (__m64)c); | |
339 | c = __builtin_ia32_pcmpeqb(data, repl_bs); | |
340 | t = (v8qi) __builtin_ia32_por ((__m64)t, (__m64)c); | |
341 | c = __builtin_ia32_pcmpeqb(data, repl_qm); | |
342 | t = (v8qi) __builtin_ia32_por ((__m64)t, (__m64)c); | |
343 | found = __builtin_ia32_pmovmskb (t); | |
344 | found &= mask; | |
345 | } | |
346 | while (!found); | |
347 | ||
348 | __builtin_ia32_emms (); | |
349 | ||
350 | /* FOUND contains 1 in bits for which we matched a relevant | |
351 | character. Conversion to the byte index is trivial. */ | |
352 | found = __builtin_ctz(found); | |
353 | return (const uchar *)p + found; | |
354 | } | |
355 | ||
356 | /* A version of the fast scanner using SSE2 vectorized byte compare insns. */ | |
357 | ||
358 | static const uchar * | |
359 | #ifndef __SSE2__ | |
360 | __attribute__((__target__("sse2"))) | |
361 | #endif | |
362 | search_line_sse2 (const uchar *s, const uchar *end ATTRIBUTE_UNUSED) | |
363 | { | |
364 | typedef char v16qi __attribute__ ((__vector_size__ (16))); | |
365 | ||
366 | const v16qi repl_nl = *(const v16qi *)repl_chars[0]; | |
367 | const v16qi repl_cr = *(const v16qi *)repl_chars[1]; | |
368 | const v16qi repl_bs = *(const v16qi *)repl_chars[2]; | |
369 | const v16qi repl_qm = *(const v16qi *)repl_chars[3]; | |
370 | ||
371 | unsigned int misalign, found, mask; | |
372 | const v16qi *p; | |
373 | v16qi data, t; | |
374 | ||
375 | /* Align the source pointer. */ | |
376 | misalign = (uintptr_t)s & 15; | |
377 | p = (const v16qi *)((uintptr_t)s & -16); | |
378 | data = *p; | |
379 | ||
380 | /* Create a mask for the bytes that are valid within the first | |
381 | 16-byte block. The Idea here is that the AND with the mask | |
382 | within the loop is "free", since we need some AND or TEST | |
383 | insn in order to set the flags for the branch anyway. */ | |
384 | mask = -1u << misalign; | |
385 | ||
386 | /* Main loop processing 16 bytes at a time. */ | |
387 | goto start; | |
388 | do | |
389 | { | |
390 | data = *++p; | |
391 | mask = -1; | |
392 | ||
393 | start: | |
394 | t = __builtin_ia32_pcmpeqb128(data, repl_nl); | |
395 | t |= __builtin_ia32_pcmpeqb128(data, repl_cr); | |
396 | t |= __builtin_ia32_pcmpeqb128(data, repl_bs); | |
397 | t |= __builtin_ia32_pcmpeqb128(data, repl_qm); | |
398 | found = __builtin_ia32_pmovmskb128 (t); | |
399 | found &= mask; | |
400 | } | |
401 | while (!found); | |
402 | ||
403 | /* FOUND contains 1 in bits for which we matched a relevant | |
404 | character. Conversion to the byte index is trivial. */ | |
405 | found = __builtin_ctz(found); | |
406 | return (const uchar *)p + found; | |
407 | } | |
408 | ||
6f173e52 | 409 | #ifdef HAVE_SSE4 |
246a2fcb RH |
410 | /* A version of the fast scanner using SSE 4.2 vectorized string insns. */ |
411 | ||
412 | static const uchar * | |
413 | #ifndef __SSE4_2__ | |
414 | __attribute__((__target__("sse4.2"))) | |
415 | #endif | |
416 | search_line_sse42 (const uchar *s, const uchar *end) | |
417 | { | |
418 | typedef char v16qi __attribute__ ((__vector_size__ (16))); | |
419 | static const v16qi search = { '\n', '\r', '?', '\\' }; | |
420 | ||
421 | uintptr_t si = (uintptr_t)s; | |
422 | uintptr_t index; | |
423 | ||
424 | /* Check for unaligned input. */ | |
425 | if (si & 15) | |
426 | { | |
d35d1c0f UB |
427 | v16qi sv; |
428 | ||
246a2fcb RH |
429 | if (__builtin_expect (end - s < 16, 0) |
430 | && __builtin_expect ((si & 0xfff) > 0xff0, 0)) | |
431 | { | |
432 | /* There are less than 16 bytes left in the buffer, and less | |
433 | than 16 bytes left on the page. Reading 16 bytes at this | |
434 | point might generate a spurious page fault. Defer to the | |
435 | SSE2 implementation, which already handles alignment. */ | |
436 | return search_line_sse2 (s, end); | |
437 | } | |
438 | ||
439 | /* ??? The builtin doesn't understand that the PCMPESTRI read from | |
440 | memory need not be aligned. */ | |
d35d1c0f UB |
441 | sv = __builtin_ia32_loaddqu ((const char *) s); |
442 | index = __builtin_ia32_pcmpestri128 (search, 4, sv, 16, 0); | |
443 | ||
246a2fcb RH |
444 | if (__builtin_expect (index < 16, 0)) |
445 | goto found; | |
446 | ||
447 | /* Advance the pointer to an aligned address. We will re-scan a | |
448 | few bytes, but we no longer need care for reading past the | |
449 | end of a page, since we're guaranteed a match. */ | |
450 | s = (const uchar *)((si + 16) & -16); | |
451 | } | |
452 | ||
453 | /* Main loop, processing 16 bytes at a time. By doing the whole loop | |
454 | in inline assembly, we can make proper use of the flags set. */ | |
455 | __asm ( "sub $16, %1\n" | |
456 | " .balign 16\n" | |
457 | "0: add $16, %1\n" | |
458 | " %vpcmpestri $0, (%1), %2\n" | |
459 | " jnc 0b" | |
460 | : "=&c"(index), "+r"(s) | |
461 | : "x"(search), "a"(4), "d"(16)); | |
462 | ||
463 | found: | |
464 | return s + index; | |
465 | } | |
466 | ||
6f173e52 RH |
467 | #else |
468 | /* Work around out-dated assemblers without sse4 support. */ | |
469 | #define search_line_sse42 search_line_sse2 | |
470 | #endif | |
471 | ||
246a2fcb RH |
472 | /* Check the CPU capabilities. */ |
473 | ||
474 | #include "../gcc/config/i386/cpuid.h" | |
475 | ||
476 | typedef const uchar * (*search_line_fast_type) (const uchar *, const uchar *); | |
477 | static search_line_fast_type search_line_fast; | |
478 | ||
b0c084b7 JJ |
479 | #define HAVE_init_vectorized_lexer 1 |
480 | static inline void | |
246a2fcb RH |
481 | init_vectorized_lexer (void) |
482 | { | |
483 | unsigned dummy, ecx = 0, edx = 0; | |
484 | search_line_fast_type impl = search_line_acc_char; | |
485 | int minimum = 0; | |
486 | ||
487 | #if defined(__SSE4_2__) | |
488 | minimum = 3; | |
489 | #elif defined(__SSE2__) | |
490 | minimum = 2; | |
ef230b38 | 491 | #elif defined(__SSE__) |
246a2fcb RH |
492 | minimum = 1; |
493 | #endif | |
494 | ||
495 | if (minimum == 3) | |
496 | impl = search_line_sse42; | |
497 | else if (__get_cpuid (1, &dummy, &dummy, &ecx, &edx) || minimum == 2) | |
498 | { | |
499 | if (minimum == 3 || (ecx & bit_SSE4_2)) | |
500 | impl = search_line_sse42; | |
501 | else if (minimum == 2 || (edx & bit_SSE2)) | |
502 | impl = search_line_sse2; | |
503 | else if (minimum == 1 || (edx & bit_SSE)) | |
504 | impl = search_line_mmx; | |
505 | } | |
506 | else if (__get_cpuid (0x80000001, &dummy, &dummy, &dummy, &edx)) | |
507 | { | |
5e70c0b5 UB |
508 | if (minimum == 1 |
509 | || (edx & (bit_MMXEXT | bit_CMOV)) == (bit_MMXEXT | bit_CMOV)) | |
246a2fcb RH |
510 | impl = search_line_mmx; |
511 | } | |
512 | ||
513 | search_line_fast = impl; | |
514 | } | |
515 | ||
0ccaaab0 | 516 | #elif defined(_ARCH_PWR8) && defined(__ALTIVEC__) |
246a2fcb | 517 | |
0ccaaab0 BS |
518 | /* A vection of the fast scanner using AltiVec vectorized byte compares |
519 | and VSX unaligned loads (when VSX is available). This is otherwise | |
520 | the same as the pre-GCC 5 version. */ | |
521 | ||
522 | static const uchar * | |
523 | search_line_fast (const uchar *s, const uchar *end ATTRIBUTE_UNUSED) | |
524 | { | |
525 | typedef __attribute__((altivec(vector))) unsigned char vc; | |
526 | ||
527 | const vc repl_nl = { | |
528 | '\n', '\n', '\n', '\n', '\n', '\n', '\n', '\n', | |
529 | '\n', '\n', '\n', '\n', '\n', '\n', '\n', '\n' | |
530 | }; | |
531 | const vc repl_cr = { | |
532 | '\r', '\r', '\r', '\r', '\r', '\r', '\r', '\r', | |
533 | '\r', '\r', '\r', '\r', '\r', '\r', '\r', '\r' | |
534 | }; | |
535 | const vc repl_bs = { | |
536 | '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', | |
537 | '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\' | |
538 | }; | |
539 | const vc repl_qm = { | |
540 | '?', '?', '?', '?', '?', '?', '?', '?', | |
541 | '?', '?', '?', '?', '?', '?', '?', '?', | |
542 | }; | |
543 | const vc zero = { 0 }; | |
544 | ||
545 | vc data, t; | |
546 | ||
547 | /* Main loop processing 16 bytes at a time. */ | |
548 | do | |
549 | { | |
550 | vc m_nl, m_cr, m_bs, m_qm; | |
551 | ||
552 | data = *((const vc *)s); | |
553 | s += 16; | |
554 | ||
555 | m_nl = (vc) __builtin_vec_cmpeq(data, repl_nl); | |
556 | m_cr = (vc) __builtin_vec_cmpeq(data, repl_cr); | |
557 | m_bs = (vc) __builtin_vec_cmpeq(data, repl_bs); | |
558 | m_qm = (vc) __builtin_vec_cmpeq(data, repl_qm); | |
559 | t = (m_nl | m_cr) | (m_bs | m_qm); | |
560 | ||
561 | /* T now contains 0xff in bytes for which we matched one of the relevant | |
562 | characters. We want to exit the loop if any byte in T is non-zero. | |
563 | Below is the expansion of vec_any_ne(t, zero). */ | |
564 | } | |
565 | while (!__builtin_vec_vcmpeq_p(/*__CR6_LT_REV*/3, t, zero)); | |
566 | ||
567 | /* Restore s to to point to the 16 bytes we just processed. */ | |
568 | s -= 16; | |
569 | ||
570 | { | |
571 | #define N (sizeof(vc) / sizeof(long)) | |
572 | ||
573 | union { | |
574 | vc v; | |
575 | /* Statically assert that N is 2 or 4. */ | |
576 | unsigned long l[(N == 2 || N == 4) ? N : -1]; | |
577 | } u; | |
578 | unsigned long l, i = 0; | |
579 | ||
580 | u.v = t; | |
581 | ||
582 | /* Find the first word of T that is non-zero. */ | |
583 | switch (N) | |
584 | { | |
585 | case 4: | |
586 | l = u.l[i++]; | |
587 | if (l != 0) | |
588 | break; | |
589 | s += sizeof(unsigned long); | |
590 | l = u.l[i++]; | |
591 | if (l != 0) | |
592 | break; | |
593 | s += sizeof(unsigned long); | |
594 | case 2: | |
595 | l = u.l[i++]; | |
596 | if (l != 0) | |
597 | break; | |
598 | s += sizeof(unsigned long); | |
599 | l = u.l[i]; | |
600 | } | |
601 | ||
602 | /* L now contains 0xff in bytes for which we matched one of the | |
603 | relevant characters. We can find the byte index by finding | |
604 | its bit index and dividing by 8. */ | |
605 | #ifdef __BIG_ENDIAN__ | |
606 | l = __builtin_clzl(l) >> 3; | |
607 | #else | |
608 | l = __builtin_ctzl(l) >> 3; | |
609 | #endif | |
610 | return s + l; | |
611 | ||
612 | #undef N | |
613 | } | |
614 | } | |
615 | ||
616 | #elif (GCC_VERSION >= 4005) && defined(__ALTIVEC__) && defined (__BIG_ENDIAN__) | |
617 | ||
618 | /* A vection of the fast scanner using AltiVec vectorized byte compares. | |
619 | This cannot be used for little endian because vec_lvsl/lvsr are | |
620 | deprecated for little endian and the code won't work properly. */ | |
246a2fcb RH |
621 | /* ??? Unfortunately, attribute(target("altivec")) is not yet supported, |
622 | so we can't compile this function without -maltivec on the command line | |
623 | (or implied by some other switch). */ | |
624 | ||
625 | static const uchar * | |
626 | search_line_fast (const uchar *s, const uchar *end ATTRIBUTE_UNUSED) | |
627 | { | |
628 | typedef __attribute__((altivec(vector))) unsigned char vc; | |
629 | ||
630 | const vc repl_nl = { | |
631 | '\n', '\n', '\n', '\n', '\n', '\n', '\n', '\n', | |
632 | '\n', '\n', '\n', '\n', '\n', '\n', '\n', '\n' | |
633 | }; | |
634 | const vc repl_cr = { | |
635 | '\r', '\r', '\r', '\r', '\r', '\r', '\r', '\r', | |
636 | '\r', '\r', '\r', '\r', '\r', '\r', '\r', '\r' | |
637 | }; | |
638 | const vc repl_bs = { | |
639 | '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\', | |
640 | '\\', '\\', '\\', '\\', '\\', '\\', '\\', '\\' | |
641 | }; | |
642 | const vc repl_qm = { | |
643 | '?', '?', '?', '?', '?', '?', '?', '?', | |
644 | '?', '?', '?', '?', '?', '?', '?', '?', | |
645 | }; | |
646 | const vc ones = { | |
647 | -1, -1, -1, -1, -1, -1, -1, -1, | |
648 | -1, -1, -1, -1, -1, -1, -1, -1, | |
649 | }; | |
650 | const vc zero = { 0 }; | |
651 | ||
652 | vc data, mask, t; | |
653 | ||
654 | /* Altivec loads automatically mask addresses with -16. This lets us | |
655 | issue the first load as early as possible. */ | |
656 | data = __builtin_vec_ld(0, (const vc *)s); | |
657 | ||
658 | /* Discard bytes before the beginning of the buffer. Do this by | |
659 | beginning with all ones and shifting in zeros according to the | |
660 | mis-alignment. The LVSR instruction pulls the exact shift we | |
661 | want from the address. */ | |
662 | mask = __builtin_vec_lvsr(0, s); | |
663 | mask = __builtin_vec_perm(zero, ones, mask); | |
664 | data &= mask; | |
665 | ||
666 | /* While altivec loads mask addresses, we still need to align S so | |
667 | that the offset we compute at the end is correct. */ | |
668 | s = (const uchar *)((uintptr_t)s & -16); | |
669 | ||
670 | /* Main loop processing 16 bytes at a time. */ | |
671 | goto start; | |
672 | do | |
673 | { | |
674 | vc m_nl, m_cr, m_bs, m_qm; | |
675 | ||
676 | s += 16; | |
677 | data = __builtin_vec_ld(0, (const vc *)s); | |
678 | ||
679 | start: | |
680 | m_nl = (vc) __builtin_vec_cmpeq(data, repl_nl); | |
681 | m_cr = (vc) __builtin_vec_cmpeq(data, repl_cr); | |
682 | m_bs = (vc) __builtin_vec_cmpeq(data, repl_bs); | |
683 | m_qm = (vc) __builtin_vec_cmpeq(data, repl_qm); | |
684 | t = (m_nl | m_cr) | (m_bs | m_qm); | |
685 | ||
686 | /* T now contains 0xff in bytes for which we matched one of the relevant | |
687 | characters. We want to exit the loop if any byte in T is non-zero. | |
688 | Below is the expansion of vec_any_ne(t, zero). */ | |
689 | } | |
690 | while (!__builtin_vec_vcmpeq_p(/*__CR6_LT_REV*/3, t, zero)); | |
691 | ||
692 | { | |
693 | #define N (sizeof(vc) / sizeof(long)) | |
694 | ||
246a2fcb RH |
695 | union { |
696 | vc v; | |
53a103d3 DS |
697 | /* Statically assert that N is 2 or 4. */ |
698 | unsigned long l[(N == 2 || N == 4) ? N : -1]; | |
246a2fcb RH |
699 | } u; |
700 | unsigned long l, i = 0; | |
701 | ||
702 | u.v = t; | |
703 | ||
704 | /* Find the first word of T that is non-zero. */ | |
705 | switch (N) | |
706 | { | |
707 | case 4: | |
708 | l = u.l[i++]; | |
709 | if (l != 0) | |
710 | break; | |
711 | s += sizeof(unsigned long); | |
712 | l = u.l[i++]; | |
713 | if (l != 0) | |
714 | break; | |
715 | s += sizeof(unsigned long); | |
716 | case 2: | |
717 | l = u.l[i++]; | |
718 | if (l != 0) | |
719 | break; | |
720 | s += sizeof(unsigned long); | |
721 | l = u.l[i]; | |
722 | } | |
723 | ||
724 | /* L now contains 0xff in bytes for which we matched one of the | |
725 | relevant characters. We can find the byte index by finding | |
726 | its bit index and dividing by 8. */ | |
727 | l = __builtin_clzl(l) >> 3; | |
728 | return s + l; | |
729 | ||
730 | #undef N | |
731 | } | |
732 | } | |
733 | ||
e75b54a2 RE |
734 | #elif defined (__ARM_NEON__) |
735 | #include "arm_neon.h" | |
736 | ||
737 | static const uchar * | |
738 | search_line_fast (const uchar *s, const uchar *end ATTRIBUTE_UNUSED) | |
739 | { | |
740 | const uint8x16_t repl_nl = vdupq_n_u8 ('\n'); | |
741 | const uint8x16_t repl_cr = vdupq_n_u8 ('\r'); | |
742 | const uint8x16_t repl_bs = vdupq_n_u8 ('\\'); | |
743 | const uint8x16_t repl_qm = vdupq_n_u8 ('?'); | |
744 | const uint8x16_t xmask = (uint8x16_t) vdupq_n_u64 (0x8040201008040201ULL); | |
745 | ||
746 | unsigned int misalign, found, mask; | |
747 | const uint8_t *p; | |
748 | uint8x16_t data; | |
749 | ||
750 | /* Align the source pointer. */ | |
751 | misalign = (uintptr_t)s & 15; | |
752 | p = (const uint8_t *)((uintptr_t)s & -16); | |
753 | data = vld1q_u8 (p); | |
754 | ||
755 | /* Create a mask for the bytes that are valid within the first | |
756 | 16-byte block. The Idea here is that the AND with the mask | |
757 | within the loop is "free", since we need some AND or TEST | |
758 | insn in order to set the flags for the branch anyway. */ | |
759 | mask = (-1u << misalign) & 0xffff; | |
760 | ||
761 | /* Main loop, processing 16 bytes at a time. */ | |
762 | goto start; | |
763 | ||
764 | do | |
765 | { | |
766 | uint8x8_t l; | |
767 | uint16x4_t m; | |
768 | uint32x2_t n; | |
769 | uint8x16_t t, u, v, w; | |
770 | ||
771 | p += 16; | |
772 | data = vld1q_u8 (p); | |
773 | mask = 0xffff; | |
774 | ||
775 | start: | |
776 | t = vceqq_u8 (data, repl_nl); | |
777 | u = vceqq_u8 (data, repl_cr); | |
778 | v = vorrq_u8 (t, vceqq_u8 (data, repl_bs)); | |
779 | w = vorrq_u8 (u, vceqq_u8 (data, repl_qm)); | |
780 | t = vandq_u8 (vorrq_u8 (v, w), xmask); | |
781 | l = vpadd_u8 (vget_low_u8 (t), vget_high_u8 (t)); | |
782 | m = vpaddl_u8 (l); | |
783 | n = vpaddl_u16 (m); | |
784 | ||
785 | found = vget_lane_u32 ((uint32x2_t) vorr_u64 ((uint64x1_t) n, | |
786 | vshr_n_u64 ((uint64x1_t) n, 24)), 0); | |
787 | found &= mask; | |
788 | } | |
789 | while (!found); | |
790 | ||
791 | /* FOUND contains 1 in bits for which we matched a relevant | |
792 | character. Conversion to the byte index is trivial. */ | |
793 | found = __builtin_ctz (found); | |
794 | return (const uchar *)p + found; | |
795 | } | |
796 | ||
246a2fcb RH |
797 | #else |
798 | ||
799 | /* We only have one accellerated alternative. Use a direct call so that | |
800 | we encourage inlining. */ | |
801 | ||
802 | #define search_line_fast search_line_acc_char | |
803 | ||
804 | #endif | |
805 | ||
b0c084b7 JJ |
806 | /* Initialize the lexer if needed. */ |
807 | ||
808 | void | |
809 | _cpp_init_lexer (void) | |
810 | { | |
811 | #ifdef HAVE_init_vectorized_lexer | |
812 | init_vectorized_lexer (); | |
813 | #endif | |
814 | } | |
815 | ||
26aea073 NB |
816 | /* Returns with a logical line that contains no escaped newlines or |
817 | trigraphs. This is a time-critical inner loop. */ | |
818 | void | |
6cf87ca4 | 819 | _cpp_clean_line (cpp_reader *pfile) |
45b966db | 820 | { |
26aea073 NB |
821 | cpp_buffer *buffer; |
822 | const uchar *s; | |
823 | uchar c, *d, *p; | |
87062813 | 824 | |
26aea073 NB |
825 | buffer = pfile->buffer; |
826 | buffer->cur_note = buffer->notes_used = 0; | |
827 | buffer->cur = buffer->line_base = buffer->next_line; | |
828 | buffer->need_line = false; | |
246a2fcb | 829 | s = buffer->next_line; |
87062813 | 830 | |
26aea073 | 831 | if (!buffer->from_stage3) |
45b966db | 832 | { |
7af45bd4 ILT |
833 | const uchar *pbackslash = NULL; |
834 | ||
246a2fcb | 835 | /* Fast path. This is the common case of an un-escaped line with |
d08dcf87 ZW |
836 | no trigraphs. The primary win here is by not writing any |
837 | data back to memory until we have to. */ | |
246a2fcb | 838 | while (1) |
d08dcf87 | 839 | { |
246a2fcb RH |
840 | /* Perform an optimized search for \n, \r, \\, ?. */ |
841 | s = search_line_fast (s, buffer->rlimit); | |
d08dcf87 | 842 | |
246a2fcb RH |
843 | c = *s; |
844 | if (c == '\\') | |
845 | { | |
846 | /* Record the location of the backslash and continue. */ | |
847 | pbackslash = s++; | |
d08dcf87 | 848 | } |
246a2fcb | 849 | else if (__builtin_expect (c == '?', 0)) |
d08dcf87 | 850 | { |
246a2fcb RH |
851 | if (__builtin_expect (s[1] == '?', false) |
852 | && _cpp_trigraph_map[s[2]]) | |
d08dcf87 | 853 | { |
246a2fcb RH |
854 | /* Have a trigraph. We may or may not have to convert |
855 | it. Add a line note regardless, for -Wtrigraphs. */ | |
856 | add_line_note (buffer, s, s[2]); | |
857 | if (CPP_OPTION (pfile, trigraphs)) | |
858 | { | |
859 | /* We do, and that means we have to switch to the | |
860 | slow path. */ | |
861 | d = (uchar *) s; | |
862 | *d = _cpp_trigraph_map[s[2]]; | |
863 | s += 2; | |
864 | goto slow_path; | |
865 | } | |
d08dcf87 | 866 | } |
246a2fcb RH |
867 | /* Not a trigraph. Continue on fast-path. */ |
868 | s++; | |
d08dcf87 | 869 | } |
246a2fcb RH |
870 | else |
871 | break; | |
d08dcf87 ZW |
872 | } |
873 | ||
246a2fcb RH |
874 | /* This must be \r or \n. We're either done, or we'll be forced |
875 | to write back to the buffer and continue on the slow path. */ | |
876 | d = (uchar *) s; | |
877 | ||
878 | if (__builtin_expect (s == buffer->rlimit, false)) | |
879 | goto done; | |
880 | ||
881 | /* DOS line ending? */ | |
882 | if (__builtin_expect (c == '\r', false) && s[1] == '\n') | |
883 | { | |
884 | s++; | |
885 | if (s == buffer->rlimit) | |
886 | goto done; | |
887 | } | |
888 | ||
889 | if (__builtin_expect (pbackslash == NULL, true)) | |
890 | goto done; | |
891 | ||
892 | /* Check for escaped newline. */ | |
893 | p = d; | |
894 | while (is_nvspace (p[-1])) | |
895 | p--; | |
896 | if (p - 1 != pbackslash) | |
897 | goto done; | |
898 | ||
899 | /* Have an escaped newline; process it and proceed to | |
900 | the slow path. */ | |
901 | add_line_note (buffer, p - 1, p != d ? ' ' : '\\'); | |
902 | d = p - 2; | |
903 | buffer->next_line = p - 1; | |
26aea073 | 904 | |
246a2fcb RH |
905 | slow_path: |
906 | while (1) | |
4a5b68a2 | 907 | { |
26aea073 NB |
908 | c = *++s; |
909 | *++d = c; | |
910 | ||
911 | if (c == '\n' || c == '\r') | |
912 | { | |
246a2fcb | 913 | /* Handle DOS line endings. */ |
26aea073 NB |
914 | if (c == '\r' && s != buffer->rlimit && s[1] == '\n') |
915 | s++; | |
916 | if (s == buffer->rlimit) | |
917 | break; | |
918 | ||
919 | /* Escaped? */ | |
920 | p = d; | |
921 | while (p != buffer->next_line && is_nvspace (p[-1])) | |
922 | p--; | |
923 | if (p == buffer->next_line || p[-1] != '\\') | |
924 | break; | |
925 | ||
41c32c98 | 926 | add_line_note (buffer, p - 1, p != d ? ' ': '\\'); |
26aea073 NB |
927 | d = p - 2; |
928 | buffer->next_line = p - 1; | |
929 | } | |
930 | else if (c == '?' && s[1] == '?' && _cpp_trigraph_map[s[2]]) | |
931 | { | |
932 | /* Add a note regardless, for the benefit of -Wtrigraphs. */ | |
41c32c98 | 933 | add_line_note (buffer, d, s[2]); |
26aea073 NB |
934 | if (CPP_OPTION (pfile, trigraphs)) |
935 | { | |
936 | *d = _cpp_trigraph_map[s[2]]; | |
937 | s += 2; | |
938 | } | |
939 | } | |
4a5b68a2 | 940 | } |
45b966db | 941 | } |
26aea073 NB |
942 | else |
943 | { | |
246a2fcb | 944 | while (*s != '\n' && *s != '\r') |
26aea073 | 945 | s++; |
26aea073 NB |
946 | d = (uchar *) s; |
947 | ||
948 | /* Handle DOS line endings. */ | |
949 | if (*s == '\r' && s != buffer->rlimit && s[1] == '\n') | |
950 | s++; | |
951 | } | |
0d9f234d | 952 | |
d08dcf87 | 953 | done: |
26aea073 | 954 | *d = '\n'; |
41c32c98 NB |
955 | /* A sentinel note that should never be processed. */ |
956 | add_line_note (buffer, d + 1, '\n'); | |
26aea073 | 957 | buffer->next_line = s + 1; |
45b966db ZW |
958 | } |
959 | ||
a8eb6044 NB |
960 | /* Return true if the trigraph indicated by NOTE should be warned |
961 | about in a comment. */ | |
962 | static bool | |
6cf87ca4 | 963 | warn_in_comment (cpp_reader *pfile, _cpp_line_note *note) |
a8eb6044 NB |
964 | { |
965 | const uchar *p; | |
966 | ||
967 | /* Within comments we don't warn about trigraphs, unless the | |
968 | trigraph forms an escaped newline, as that may change | |
6356f892 | 969 | behavior. */ |
a8eb6044 NB |
970 | if (note->type != '/') |
971 | return false; | |
972 | ||
973 | /* If -trigraphs, then this was an escaped newline iff the next note | |
974 | is coincident. */ | |
975 | if (CPP_OPTION (pfile, trigraphs)) | |
976 | return note[1].pos == note->pos; | |
977 | ||
978 | /* Otherwise, see if this forms an escaped newline. */ | |
979 | p = note->pos + 3; | |
980 | while (is_nvspace (*p)) | |
981 | p++; | |
982 | ||
983 | /* There might have been escaped newlines between the trigraph and the | |
984 | newline we found. Hence the position test. */ | |
985 | return (*p == '\n' && p < note[1].pos); | |
986 | } | |
987 | ||
26aea073 NB |
988 | /* Process the notes created by add_line_note as far as the current |
989 | location. */ | |
990 | void | |
6cf87ca4 | 991 | _cpp_process_line_notes (cpp_reader *pfile, int in_comment) |
45b966db | 992 | { |
29401c30 NB |
993 | cpp_buffer *buffer = pfile->buffer; |
994 | ||
26aea073 | 995 | for (;;) |
041c3194 | 996 | { |
26aea073 NB |
997 | _cpp_line_note *note = &buffer->notes[buffer->cur_note]; |
998 | unsigned int col; | |
a5c3cccd | 999 | |
26aea073 NB |
1000 | if (note->pos > buffer->cur) |
1001 | break; | |
a5c3cccd | 1002 | |
26aea073 NB |
1003 | buffer->cur_note++; |
1004 | col = CPP_BUF_COLUMN (buffer, note->pos + 1); | |
4d6baafa | 1005 | |
41c32c98 | 1006 | if (note->type == '\\' || note->type == ' ') |
26aea073 | 1007 | { |
41c32c98 | 1008 | if (note->type == ' ' && !in_comment) |
500bee0a | 1009 | cpp_error_with_line (pfile, CPP_DL_WARNING, pfile->line_table->highest_line, col, |
26aea073 | 1010 | "backslash and newline separated by space"); |
41c32c98 | 1011 | |
26aea073 | 1012 | if (buffer->next_line > buffer->rlimit) |
87062813 | 1013 | { |
500bee0a | 1014 | cpp_error_with_line (pfile, CPP_DL_PEDWARN, pfile->line_table->highest_line, col, |
26aea073 NB |
1015 | "backslash-newline at end of file"); |
1016 | /* Prevent "no newline at end of file" warning. */ | |
1017 | buffer->next_line = buffer->rlimit; | |
87062813 | 1018 | } |
26aea073 NB |
1019 | |
1020 | buffer->line_base = note->pos; | |
12f9df4e | 1021 | CPP_INCREMENT_LINE (pfile, 0); |
0d9f234d | 1022 | } |
41c32c98 NB |
1023 | else if (_cpp_trigraph_map[note->type]) |
1024 | { | |
a8eb6044 NB |
1025 | if (CPP_OPTION (pfile, warn_trigraphs) |
1026 | && (!in_comment || warn_in_comment (pfile, note))) | |
41c32c98 NB |
1027 | { |
1028 | if (CPP_OPTION (pfile, trigraphs)) | |
87cf0651 SB |
1029 | cpp_warning_with_line (pfile, CPP_W_TRIGRAPHS, |
1030 | pfile->line_table->highest_line, col, | |
1031 | "trigraph ??%c converted to %c", | |
1032 | note->type, | |
1033 | (int) _cpp_trigraph_map[note->type]); | |
41c32c98 | 1034 | else |
905bd7b5 | 1035 | { |
87cf0651 SB |
1036 | cpp_warning_with_line |
1037 | (pfile, CPP_W_TRIGRAPHS, | |
1038 | pfile->line_table->highest_line, col, | |
905bd7b5 GK |
1039 | "trigraph ??%c ignored, use -trigraphs to enable", |
1040 | note->type); | |
1041 | } | |
41c32c98 NB |
1042 | } |
1043 | } | |
00a81b8b JM |
1044 | else if (note->type == 0) |
1045 | /* Already processed in lex_raw_string. */; | |
41c32c98 NB |
1046 | else |
1047 | abort (); | |
041c3194 | 1048 | } |
45b966db ZW |
1049 | } |
1050 | ||
0d9f234d NB |
1051 | /* Skip a C-style block comment. We find the end of the comment by |
1052 | seeing if an asterisk is before every '/' we encounter. Returns | |
6f572ac2 NB |
1053 | nonzero if comment terminated by EOF, zero otherwise. |
1054 | ||
1055 | Buffer->cur points to the initial asterisk of the comment. */ | |
26aea073 | 1056 | bool |
6cf87ca4 | 1057 | _cpp_skip_block_comment (cpp_reader *pfile) |
45b966db | 1058 | { |
041c3194 | 1059 | cpp_buffer *buffer = pfile->buffer; |
d08dcf87 ZW |
1060 | const uchar *cur = buffer->cur; |
1061 | uchar c; | |
0d9f234d | 1062 | |
d08dcf87 ZW |
1063 | cur++; |
1064 | if (*cur == '/') | |
1065 | cur++; | |
0d9f234d | 1066 | |
26aea073 NB |
1067 | for (;;) |
1068 | { | |
0d9f234d NB |
1069 | /* People like decorating comments with '*', so check for '/' |
1070 | instead for efficiency. */ | |
d08dcf87 ZW |
1071 | c = *cur++; |
1072 | ||
041c3194 | 1073 | if (c == '/') |
45b966db | 1074 | { |
d08dcf87 | 1075 | if (cur[-2] == '*') |
0d9f234d | 1076 | break; |
041c3194 | 1077 | |
0d9f234d | 1078 | /* Warn about potential nested comments, but not if the '/' |
a1f300c0 | 1079 | comes immediately before the true comment delimiter. |
041c3194 | 1080 | Don't bother to get it right across escaped newlines. */ |
0d9f234d | 1081 | if (CPP_OPTION (pfile, warn_comments) |
d08dcf87 ZW |
1082 | && cur[0] == '*' && cur[1] != '/') |
1083 | { | |
1084 | buffer->cur = cur; | |
87cf0651 SB |
1085 | cpp_warning_with_line (pfile, CPP_W_COMMENTS, |
1086 | pfile->line_table->highest_line, | |
1087 | CPP_BUF_COL (buffer), | |
1088 | "\"/*\" within comment"); | |
d08dcf87 | 1089 | } |
45b966db | 1090 | } |
26aea073 NB |
1091 | else if (c == '\n') |
1092 | { | |
12f9df4e | 1093 | unsigned int cols; |
d08dcf87 | 1094 | buffer->cur = cur - 1; |
26aea073 NB |
1095 | _cpp_process_line_notes (pfile, true); |
1096 | if (buffer->next_line >= buffer->rlimit) | |
1097 | return true; | |
1098 | _cpp_clean_line (pfile); | |
12f9df4e PB |
1099 | |
1100 | cols = buffer->next_line - buffer->line_base; | |
1101 | CPP_INCREMENT_LINE (pfile, cols); | |
1102 | ||
d08dcf87 | 1103 | cur = buffer->cur; |
26aea073 | 1104 | } |
45b966db | 1105 | } |
041c3194 | 1106 | |
d08dcf87 | 1107 | buffer->cur = cur; |
a8eb6044 | 1108 | _cpp_process_line_notes (pfile, true); |
26aea073 | 1109 | return false; |
45b966db ZW |
1110 | } |
1111 | ||
480709cc | 1112 | /* Skip a C++ line comment, leaving buffer->cur pointing to the |
da7d8304 | 1113 | terminating newline. Handles escaped newlines. Returns nonzero |
480709cc | 1114 | if a multiline comment. */ |
041c3194 | 1115 | static int |
6cf87ca4 | 1116 | skip_line_comment (cpp_reader *pfile) |
45b966db | 1117 | { |
cbcff6df | 1118 | cpp_buffer *buffer = pfile->buffer; |
1bb64668 | 1119 | source_location orig_line = pfile->line_table->highest_line; |
041c3194 | 1120 | |
26aea073 NB |
1121 | while (*buffer->cur != '\n') |
1122 | buffer->cur++; | |
480709cc | 1123 | |
26aea073 | 1124 | _cpp_process_line_notes (pfile, true); |
500bee0a | 1125 | return orig_line != pfile->line_table->highest_line; |
041c3194 | 1126 | } |
45b966db | 1127 | |
26aea073 | 1128 | /* Skips whitespace, saving the next non-whitespace character. */ |
52fadca8 | 1129 | static void |
6cf87ca4 | 1130 | skip_whitespace (cpp_reader *pfile, cppchar_t c) |
041c3194 ZW |
1131 | { |
1132 | cpp_buffer *buffer = pfile->buffer; | |
f7d151fb | 1133 | bool saw_NUL = false; |
45b966db | 1134 | |
0d9f234d | 1135 | do |
041c3194 | 1136 | { |
91fcd158 | 1137 | /* Horizontal space always OK. */ |
26aea073 | 1138 | if (c == ' ' || c == '\t') |
0d9f234d | 1139 | ; |
0d9f234d | 1140 | /* Just \f \v or \0 left. */ |
91fcd158 | 1141 | else if (c == '\0') |
f7d151fb | 1142 | saw_NUL = true; |
93c80368 | 1143 | else if (pfile->state.in_directive && CPP_PEDANTIC (pfile)) |
500bee0a | 1144 | cpp_error_with_line (pfile, CPP_DL_PEDWARN, pfile->line_table->highest_line, |
ebef4e8c NB |
1145 | CPP_BUF_COL (buffer), |
1146 | "%s in preprocessing directive", | |
1147 | c == '\f' ? "form feed" : "vertical tab"); | |
0d9f234d | 1148 | |
0d9f234d | 1149 | c = *buffer->cur++; |
45b966db | 1150 | } |
ec5c56db | 1151 | /* We only want non-vertical space, i.e. ' ' \t \f \v \0. */ |
0d9f234d NB |
1152 | while (is_nvspace (c)); |
1153 | ||
f7d151fb | 1154 | if (saw_NUL) |
0527bc4e | 1155 | cpp_error (pfile, CPP_DL_WARNING, "null character(s) ignored"); |
f7d151fb | 1156 | |
480709cc | 1157 | buffer->cur--; |
041c3194 | 1158 | } |
45b966db | 1159 | |
93c80368 NB |
1160 | /* See if the characters of a number token are valid in a name (no |
1161 | '.', '+' or '-'). */ | |
1162 | static int | |
6cf87ca4 | 1163 | name_p (cpp_reader *pfile, const cpp_string *string) |
93c80368 NB |
1164 | { |
1165 | unsigned int i; | |
1166 | ||
1167 | for (i = 0; i < string->len; i++) | |
1168 | if (!is_idchar (string->text[i])) | |
1169 | return 0; | |
1170 | ||
df383483 | 1171 | return 1; |
93c80368 NB |
1172 | } |
1173 | ||
50668cf6 GK |
1174 | /* After parsing an identifier or other sequence, produce a warning about |
1175 | sequences not in NFC/NFKC. */ | |
1176 | static void | |
1177 | warn_about_normalization (cpp_reader *pfile, | |
1178 | const cpp_token *token, | |
1179 | const struct normalize_state *s) | |
1180 | { | |
1181 | if (CPP_OPTION (pfile, warn_normalize) < NORMALIZE_STATE_RESULT (s) | |
1182 | && !pfile->state.skipping) | |
1183 | { | |
1184 | /* Make sure that the token is printed using UCNs, even | |
1185 | if we'd otherwise happily print UTF-8. */ | |
c3f829c1 | 1186 | unsigned char *buf = XNEWVEC (unsigned char, cpp_token_len (token)); |
50668cf6 GK |
1187 | size_t sz; |
1188 | ||
1189 | sz = cpp_spell_token (pfile, token, buf, false) - buf; | |
1190 | if (NORMALIZE_STATE_RESULT (s) == normalized_C) | |
87cf0651 SB |
1191 | cpp_warning_with_line (pfile, CPP_W_NORMALIZE, token->src_loc, 0, |
1192 | "`%.*s' is not in NFKC", (int) sz, buf); | |
50668cf6 | 1193 | else |
87cf0651 SB |
1194 | cpp_warning_with_line (pfile, CPP_W_NORMALIZE, token->src_loc, 0, |
1195 | "`%.*s' is not in NFC", (int) sz, buf); | |
55e7f907 | 1196 | free (buf); |
50668cf6 GK |
1197 | } |
1198 | } | |
1199 | ||
bced6edf | 1200 | /* Returns TRUE if the sequence starting at buffer->cur is invalid in |
1613e52b | 1201 | an identifier. FIRST is TRUE if this starts an identifier. */ |
bced6edf | 1202 | static bool |
50668cf6 GK |
1203 | forms_identifier_p (cpp_reader *pfile, int first, |
1204 | struct normalize_state *state) | |
bced6edf | 1205 | { |
1613e52b NB |
1206 | cpp_buffer *buffer = pfile->buffer; |
1207 | ||
1208 | if (*buffer->cur == '$') | |
1209 | { | |
1210 | if (!CPP_OPTION (pfile, dollars_in_ident)) | |
1211 | return false; | |
1212 | ||
1213 | buffer->cur++; | |
78b8811a | 1214 | if (CPP_OPTION (pfile, warn_dollars) && !pfile->state.skipping) |
1613e52b | 1215 | { |
78b8811a | 1216 | CPP_OPTION (pfile, warn_dollars) = 0; |
0527bc4e | 1217 | cpp_error (pfile, CPP_DL_PEDWARN, "'$' in identifier or number"); |
1613e52b NB |
1218 | } |
1219 | ||
1220 | return true; | |
1221 | } | |
bced6edf | 1222 | |
1613e52b | 1223 | /* Is this a syntactically valid UCN? */ |
af15a2fe | 1224 | if (CPP_OPTION (pfile, extended_identifiers) |
6baba9bb | 1225 | && *buffer->cur == '\\' |
1613e52b | 1226 | && (buffer->cur[1] == 'u' || buffer->cur[1] == 'U')) |
bced6edf | 1227 | { |
1613e52b | 1228 | buffer->cur += 2; |
50668cf6 GK |
1229 | if (_cpp_valid_ucn (pfile, &buffer->cur, buffer->rlimit, 1 + !first, |
1230 | state)) | |
1613e52b NB |
1231 | return true; |
1232 | buffer->cur -= 2; | |
bced6edf | 1233 | } |
bced6edf | 1234 | |
1613e52b | 1235 | return false; |
bced6edf NB |
1236 | } |
1237 | ||
17e7cb85 KT |
1238 | /* Helper function to get the cpp_hashnode of the identifier BASE. */ |
1239 | static cpp_hashnode * | |
1240 | lex_identifier_intern (cpp_reader *pfile, const uchar *base) | |
1241 | { | |
1242 | cpp_hashnode *result; | |
1243 | const uchar *cur; | |
1244 | unsigned int len; | |
1245 | unsigned int hash = HT_HASHSTEP (0, *base); | |
1246 | ||
1247 | cur = base + 1; | |
1248 | while (ISIDNUM (*cur)) | |
1249 | { | |
1250 | hash = HT_HASHSTEP (hash, *cur); | |
1251 | cur++; | |
1252 | } | |
1253 | len = cur - base; | |
1254 | hash = HT_HASHFINISH (hash, len); | |
1255 | result = CPP_HASHNODE (ht_lookup_with_hash (pfile->hash_table, | |
1256 | base, len, hash, HT_ALLOC)); | |
1257 | ||
1258 | /* Rarely, identifiers require diagnostics when lexed. */ | |
1259 | if (__builtin_expect ((result->flags & NODE_DIAGNOSTIC) | |
1260 | && !pfile->state.skipping, 0)) | |
1261 | { | |
1262 | /* It is allowed to poison the same identifier twice. */ | |
1263 | if ((result->flags & NODE_POISONED) && !pfile->state.poisoned_ok) | |
1264 | cpp_error (pfile, CPP_DL_ERROR, "attempt to use poisoned \"%s\"", | |
1265 | NODE_NAME (result)); | |
1266 | ||
1267 | /* Constraint 6.10.3.5: __VA_ARGS__ should only appear in the | |
1268 | replacement list of a variadic macro. */ | |
1269 | if (result == pfile->spec_nodes.n__VA_ARGS__ | |
1270 | && !pfile->state.va_args_ok) | |
3976796b ESR |
1271 | { |
1272 | if (CPP_OPTION (pfile, cplusplus)) | |
1273 | cpp_error (pfile, CPP_DL_PEDWARN, | |
1274 | "__VA_ARGS__ can only appear in the expansion" | |
1275 | " of a C++11 variadic macro"); | |
1276 | else | |
1277 | cpp_error (pfile, CPP_DL_PEDWARN, | |
1278 | "__VA_ARGS__ can only appear in the expansion" | |
1279 | " of a C99 variadic macro"); | |
1280 | } | |
17e7cb85 KT |
1281 | |
1282 | /* For -Wc++-compat, warn about use of C++ named operators. */ | |
1283 | if (result->flags & NODE_WARN_OPERATOR) | |
87cf0651 SB |
1284 | cpp_warning (pfile, CPP_W_CXX_OPERATOR_NAMES, |
1285 | "identifier \"%s\" is a special operator name in C++", | |
1286 | NODE_NAME (result)); | |
17e7cb85 KT |
1287 | } |
1288 | ||
1289 | return result; | |
1290 | } | |
1291 | ||
1292 | /* Get the cpp_hashnode of an identifier specified by NAME in | |
1293 | the current cpp_reader object. If none is found, NULL is returned. */ | |
1294 | cpp_hashnode * | |
1295 | _cpp_lex_identifier (cpp_reader *pfile, const char *name) | |
1296 | { | |
1297 | cpp_hashnode *result; | |
1298 | result = lex_identifier_intern (pfile, (uchar *) name); | |
1299 | return result; | |
1300 | } | |
1301 | ||
bced6edf | 1302 | /* Lex an identifier starting at BUFFER->CUR - 1. */ |
0d9f234d | 1303 | static cpp_hashnode * |
50668cf6 GK |
1304 | lex_identifier (cpp_reader *pfile, const uchar *base, bool starts_ucn, |
1305 | struct normalize_state *nst) | |
45b966db | 1306 | { |
93c80368 | 1307 | cpp_hashnode *result; |
47e20491 | 1308 | const uchar *cur; |
c6e83800 ZW |
1309 | unsigned int len; |
1310 | unsigned int hash = HT_HASHSTEP (0, *base); | |
2c3fcba6 | 1311 | |
c6e83800 | 1312 | cur = pfile->buffer->cur; |
47e20491 | 1313 | if (! starts_ucn) |
d3f4ff8b JM |
1314 | { |
1315 | while (ISIDNUM (*cur)) | |
1316 | { | |
1317 | hash = HT_HASHSTEP (hash, *cur); | |
1318 | cur++; | |
1319 | } | |
1320 | NORMALIZE_STATE_UPDATE_IDNUM (nst, *(cur - 1)); | |
1321 | } | |
47e20491 | 1322 | pfile->buffer->cur = cur; |
50668cf6 | 1323 | if (starts_ucn || forms_identifier_p (pfile, false, nst)) |
10cf9bde | 1324 | { |
47e20491 GK |
1325 | /* Slower version for identifiers containing UCNs (or $). */ |
1326 | do { | |
1327 | while (ISIDNUM (*pfile->buffer->cur)) | |
50668cf6 | 1328 | { |
d3f4ff8b | 1329 | NORMALIZE_STATE_UPDATE_IDNUM (nst, *pfile->buffer->cur); |
50668cf6 | 1330 | pfile->buffer->cur++; |
50668cf6 GK |
1331 | } |
1332 | } while (forms_identifier_p (pfile, false, nst)); | |
47e20491 GK |
1333 | result = _cpp_interpret_identifier (pfile, base, |
1334 | pfile->buffer->cur - base); | |
2c3fcba6 | 1335 | } |
47e20491 GK |
1336 | else |
1337 | { | |
1338 | len = cur - base; | |
1339 | hash = HT_HASHFINISH (hash, len); | |
bced6edf | 1340 | |
2bf41bf0 TT |
1341 | result = CPP_HASHNODE (ht_lookup_with_hash (pfile->hash_table, |
1342 | base, len, hash, HT_ALLOC)); | |
47e20491 | 1343 | } |
2c3fcba6 | 1344 | |
bced6edf | 1345 | /* Rarely, identifiers require diagnostics when lexed. */ |
2c3fcba6 ZW |
1346 | if (__builtin_expect ((result->flags & NODE_DIAGNOSTIC) |
1347 | && !pfile->state.skipping, 0)) | |
1348 | { | |
1349 | /* It is allowed to poison the same identifier twice. */ | |
1350 | if ((result->flags & NODE_POISONED) && !pfile->state.poisoned_ok) | |
0527bc4e | 1351 | cpp_error (pfile, CPP_DL_ERROR, "attempt to use poisoned \"%s\"", |
2c3fcba6 ZW |
1352 | NODE_NAME (result)); |
1353 | ||
1354 | /* Constraint 6.10.3.5: __VA_ARGS__ should only appear in the | |
1355 | replacement list of a variadic macro. */ | |
1356 | if (result == pfile->spec_nodes.n__VA_ARGS__ | |
1357 | && !pfile->state.va_args_ok) | |
3976796b ESR |
1358 | { |
1359 | if (CPP_OPTION (pfile, cplusplus)) | |
1360 | cpp_error (pfile, CPP_DL_PEDWARN, | |
1361 | "__VA_ARGS__ can only appear in the expansion" | |
1362 | " of a C++11 variadic macro"); | |
1363 | else | |
1364 | cpp_error (pfile, CPP_DL_PEDWARN, | |
1365 | "__VA_ARGS__ can only appear in the expansion" | |
1366 | " of a C99 variadic macro"); | |
1367 | } | |
3d8b2a98 ILT |
1368 | |
1369 | /* For -Wc++-compat, warn about use of C++ named operators. */ | |
1370 | if (result->flags & NODE_WARN_OPERATOR) | |
87cf0651 SB |
1371 | cpp_warning (pfile, CPP_W_CXX_OPERATOR_NAMES, |
1372 | "identifier \"%s\" is a special operator name in C++", | |
1373 | NODE_NAME (result)); | |
2c3fcba6 ZW |
1374 | } |
1375 | ||
1376 | return result; | |
1377 | } | |
1378 | ||
bced6edf | 1379 | /* Lex a number to NUMBER starting at BUFFER->CUR - 1. */ |
45b966db | 1380 | static void |
50668cf6 GK |
1381 | lex_number (cpp_reader *pfile, cpp_string *number, |
1382 | struct normalize_state *nst) | |
45b966db | 1383 | { |
562a5c27 | 1384 | const uchar *cur; |
bced6edf NB |
1385 | const uchar *base; |
1386 | uchar *dest; | |
45b966db | 1387 | |
bced6edf NB |
1388 | base = pfile->buffer->cur - 1; |
1389 | do | |
041c3194 | 1390 | { |
bced6edf | 1391 | cur = pfile->buffer->cur; |
0d9f234d | 1392 | |
bced6edf | 1393 | /* N.B. ISIDNUM does not include $. */ |
7057e645 ESR |
1394 | while (ISIDNUM (*cur) || *cur == '.' || DIGIT_SEP (*cur) |
1395 | || VALID_SIGN (*cur, cur[-1])) | |
50668cf6 | 1396 | { |
d3f4ff8b | 1397 | NORMALIZE_STATE_UPDATE_IDNUM (nst, *cur); |
50668cf6 | 1398 | cur++; |
50668cf6 | 1399 | } |
45b966db | 1400 | |
10cf9bde | 1401 | pfile->buffer->cur = cur; |
45b966db | 1402 | } |
50668cf6 | 1403 | while (forms_identifier_p (pfile, false, nst)); |
93c80368 | 1404 | |
bced6edf NB |
1405 | number->len = cur - base; |
1406 | dest = _cpp_unaligned_alloc (pfile, number->len + 1); | |
1407 | memcpy (dest, base, number->len); | |
1408 | dest[number->len] = '\0'; | |
1409 | number->text = dest; | |
93c80368 NB |
1410 | } |
1411 | ||
6338b358 NB |
1412 | /* Create a token of type TYPE with a literal spelling. */ |
1413 | static void | |
6cf87ca4 ZW |
1414 | create_literal (cpp_reader *pfile, cpp_token *token, const uchar *base, |
1415 | unsigned int len, enum cpp_ttype type) | |
6338b358 NB |
1416 | { |
1417 | uchar *dest = _cpp_unaligned_alloc (pfile, len + 1); | |
1418 | ||
1419 | memcpy (dest, base, len); | |
1420 | dest[len] = '\0'; | |
1421 | token->type = type; | |
1422 | token->val.str.len = len; | |
1423 | token->val.str.text = dest; | |
1424 | } | |
1425 | ||
00a81b8b JM |
1426 | /* Subroutine of lex_raw_string: Append LEN chars from BASE to the buffer |
1427 | sequence from *FIRST_BUFF_P to LAST_BUFF_P. */ | |
1428 | ||
1429 | static void | |
1430 | bufring_append (cpp_reader *pfile, const uchar *base, size_t len, | |
1431 | _cpp_buff **first_buff_p, _cpp_buff **last_buff_p) | |
1432 | { | |
1433 | _cpp_buff *first_buff = *first_buff_p; | |
1434 | _cpp_buff *last_buff = *last_buff_p; | |
1435 | ||
1436 | if (first_buff == NULL) | |
1437 | first_buff = last_buff = _cpp_get_buff (pfile, len); | |
1438 | else if (len > BUFF_ROOM (last_buff)) | |
1439 | { | |
1440 | size_t room = BUFF_ROOM (last_buff); | |
1441 | memcpy (BUFF_FRONT (last_buff), base, room); | |
1442 | BUFF_FRONT (last_buff) += room; | |
1443 | base += room; | |
1444 | len -= room; | |
1445 | last_buff = _cpp_append_extend_buff (pfile, last_buff, len); | |
1446 | } | |
1447 | ||
1448 | memcpy (BUFF_FRONT (last_buff), base, len); | |
1449 | BUFF_FRONT (last_buff) += len; | |
1450 | ||
1451 | *first_buff_p = first_buff; | |
1452 | *last_buff_p = last_buff; | |
1453 | } | |
1454 | ||
c865f923 ESR |
1455 | |
1456 | /* Returns true if a macro has been defined. | |
1457 | This might not work if compile with -save-temps, | |
1458 | or preprocess separately from compilation. */ | |
1459 | ||
1460 | static bool | |
1461 | is_macro(cpp_reader *pfile, const uchar *base) | |
1462 | { | |
1463 | const uchar *cur = base; | |
1464 | if (! ISIDST (*cur)) | |
1465 | return false; | |
1466 | unsigned int hash = HT_HASHSTEP (0, *cur); | |
1467 | ++cur; | |
1468 | while (ISIDNUM (*cur)) | |
1469 | { | |
1470 | hash = HT_HASHSTEP (hash, *cur); | |
1471 | ++cur; | |
1472 | } | |
1473 | hash = HT_HASHFINISH (hash, cur - base); | |
1474 | ||
1475 | cpp_hashnode *result = CPP_HASHNODE (ht_lookup_with_hash (pfile->hash_table, | |
1476 | base, cur - base, hash, HT_NO_INSERT)); | |
1477 | ||
1478 | return !result ? false : (result->type == NT_MACRO); | |
1479 | } | |
1480 | ||
1481 | ||
2c6e3f55 | 1482 | /* Lexes a raw string. The stored string contains the spelling, including |
00a81b8b | 1483 | double quotes, delimiter string, '(' and ')', any leading |
2c6e3f55 JJ |
1484 | 'L', 'u', 'U' or 'u8' and 'R' modifier. It returns the type of the |
1485 | literal, or CPP_OTHER if it was not properly terminated. | |
1486 | ||
1487 | The spelling is NUL-terminated, but it is not guaranteed that this | |
1488 | is the first NUL since embedded NULs are preserved. */ | |
1489 | ||
1490 | static void | |
1491 | lex_raw_string (cpp_reader *pfile, cpp_token *token, const uchar *base, | |
1492 | const uchar *cur) | |
1493 | { | |
8cf88735 JJ |
1494 | uchar raw_prefix[17]; |
1495 | uchar temp_buffer[18]; | |
1496 | const uchar *orig_base; | |
1497 | unsigned int raw_prefix_len = 0, raw_suffix_len = 0; | |
1498 | enum raw_str_phase { RAW_STR_PREFIX, RAW_STR, RAW_STR_SUFFIX }; | |
1499 | raw_str_phase phase = RAW_STR_PREFIX; | |
2c6e3f55 JJ |
1500 | enum cpp_ttype type; |
1501 | size_t total_len = 0; | |
8cf88735 JJ |
1502 | /* Index into temp_buffer during phases other than RAW_STR, |
1503 | during RAW_STR phase 17 to tell BUF_APPEND that nothing should | |
1504 | be appended to temp_buffer. */ | |
1505 | size_t temp_buffer_len = 0; | |
2c6e3f55 | 1506 | _cpp_buff *first_buff = NULL, *last_buff = NULL; |
8cf88735 | 1507 | size_t raw_prefix_start; |
00a81b8b | 1508 | _cpp_line_note *note = &pfile->buffer->notes[pfile->buffer->cur_note]; |
2c6e3f55 JJ |
1509 | |
1510 | type = (*base == 'L' ? CPP_WSTRING : | |
1511 | *base == 'U' ? CPP_STRING32 : | |
1512 | *base == 'u' ? (base[1] == '8' ? CPP_UTF8STRING : CPP_STRING16) | |
1513 | : CPP_STRING); | |
1514 | ||
00a81b8b JM |
1515 | #define BUF_APPEND(STR,LEN) \ |
1516 | do { \ | |
1517 | bufring_append (pfile, (const uchar *)(STR), (LEN), \ | |
1518 | &first_buff, &last_buff); \ | |
1519 | total_len += (LEN); \ | |
8cf88735 JJ |
1520 | if (__builtin_expect (temp_buffer_len < 17, 0) \ |
1521 | && (const uchar *)(STR) != base \ | |
1522 | && (LEN) <= 2) \ | |
1523 | { \ | |
1524 | memcpy (temp_buffer + temp_buffer_len, \ | |
1525 | (const uchar *)(STR), (LEN)); \ | |
1526 | temp_buffer_len += (LEN); \ | |
1527 | } \ | |
00a81b8b JM |
1528 | } while (0); |
1529 | ||
8cf88735 JJ |
1530 | orig_base = base; |
1531 | ++cur; | |
1532 | raw_prefix_start = cur - base; | |
1533 | for (;;) | |
1534 | { | |
00a81b8b JM |
1535 | cppchar_t c; |
1536 | ||
1537 | /* If we previously performed any trigraph or line splicing | |
8cf88735 JJ |
1538 | transformations, undo them in between the opening and closing |
1539 | double quote. */ | |
00a81b8b JM |
1540 | while (note->pos < cur) |
1541 | ++note; | |
1542 | for (; note->pos == cur; ++note) | |
1543 | { | |
1544 | switch (note->type) | |
1545 | { | |
1546 | case '\\': | |
1547 | case ' ': | |
1548 | /* Restore backslash followed by newline. */ | |
1549 | BUF_APPEND (base, cur - base); | |
1550 | base = cur; | |
1551 | BUF_APPEND ("\\", 1); | |
1552 | after_backslash: | |
1553 | if (note->type == ' ') | |
1554 | { | |
1555 | /* GNU backslash whitespace newline extension. FIXME | |
1556 | could be any sequence of non-vertical space. When we | |
1557 | can properly restore any such sequence, we should mark | |
1558 | this note as handled so _cpp_process_line_notes | |
1559 | doesn't warn. */ | |
1560 | BUF_APPEND (" ", 1); | |
1561 | } | |
1562 | ||
1563 | BUF_APPEND ("\n", 1); | |
1564 | break; | |
1565 | ||
1566 | case 0: | |
1567 | /* Already handled. */ | |
1568 | break; | |
1569 | ||
1570 | default: | |
1571 | if (_cpp_trigraph_map[note->type]) | |
1572 | { | |
1573 | /* Don't warn about this trigraph in | |
1574 | _cpp_process_line_notes, since trigraphs show up as | |
1575 | trigraphs in raw strings. */ | |
d947ada0 | 1576 | uchar type = note->type; |
00a81b8b JM |
1577 | note->type = 0; |
1578 | ||
1579 | if (!CPP_OPTION (pfile, trigraphs)) | |
1580 | /* If we didn't convert the trigraph in the first | |
1581 | place, don't do anything now either. */ | |
1582 | break; | |
1583 | ||
1584 | BUF_APPEND (base, cur - base); | |
1585 | base = cur; | |
1586 | BUF_APPEND ("??", 2); | |
1587 | ||
1588 | /* ??/ followed by newline gets two line notes, one for | |
1589 | the trigraph and one for the backslash/newline. */ | |
1590 | if (type == '/' && note[1].pos == cur) | |
1591 | { | |
1592 | if (note[1].type != '\\' | |
1593 | && note[1].type != ' ') | |
1594 | abort (); | |
1595 | BUF_APPEND ("/", 1); | |
1596 | ++note; | |
1597 | goto after_backslash; | |
1598 | } | |
00a81b8b JM |
1599 | else |
1600 | { | |
1601 | /* Skip the replacement character. */ | |
1602 | base = ++cur; | |
1603 | BUF_APPEND (&type, 1); | |
8cf88735 JJ |
1604 | c = type; |
1605 | goto check_c; | |
00a81b8b JM |
1606 | } |
1607 | } | |
1608 | else | |
1609 | abort (); | |
1610 | break; | |
1611 | } | |
1612 | } | |
1613 | c = *cur++; | |
8cf88735 JJ |
1614 | if (__builtin_expect (temp_buffer_len < 17, 0)) |
1615 | temp_buffer[temp_buffer_len++] = c; | |
2c6e3f55 | 1616 | |
8cf88735 JJ |
1617 | check_c: |
1618 | if (phase == RAW_STR_PREFIX) | |
2c6e3f55 | 1619 | { |
8cf88735 JJ |
1620 | while (raw_prefix_len < temp_buffer_len) |
1621 | { | |
1622 | raw_prefix[raw_prefix_len] = temp_buffer[raw_prefix_len]; | |
1623 | switch (raw_prefix[raw_prefix_len]) | |
1624 | { | |
1625 | case ' ': case '(': case ')': case '\\': case '\t': | |
1626 | case '\v': case '\f': case '\n': default: | |
1627 | break; | |
1628 | /* Basic source charset except the above chars. */ | |
1629 | case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': | |
1630 | case 'g': case 'h': case 'i': case 'j': case 'k': case 'l': | |
1631 | case 'm': case 'n': case 'o': case 'p': case 'q': case 'r': | |
1632 | case 's': case 't': case 'u': case 'v': case 'w': case 'x': | |
1633 | case 'y': case 'z': | |
1634 | case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': | |
1635 | case 'G': case 'H': case 'I': case 'J': case 'K': case 'L': | |
1636 | case 'M': case 'N': case 'O': case 'P': case 'Q': case 'R': | |
1637 | case 'S': case 'T': case 'U': case 'V': case 'W': case 'X': | |
1638 | case 'Y': case 'Z': | |
1639 | case '0': case '1': case '2': case '3': case '4': case '5': | |
1640 | case '6': case '7': case '8': case '9': | |
1641 | case '_': case '{': case '}': case '#': case '[': case ']': | |
1642 | case '<': case '>': case '%': case ':': case ';': case '.': | |
1643 | case '?': case '*': case '+': case '-': case '/': case '^': | |
1644 | case '&': case '|': case '~': case '!': case '=': case ',': | |
1645 | case '"': case '\'': | |
1646 | if (raw_prefix_len < 16) | |
1647 | { | |
1648 | raw_prefix_len++; | |
1649 | continue; | |
1650 | } | |
1651 | break; | |
1652 | } | |
1653 | ||
1654 | if (raw_prefix[raw_prefix_len] != '(') | |
1655 | { | |
1656 | int col = CPP_BUF_COLUMN (pfile->buffer, cur) + 1; | |
1657 | if (raw_prefix_len == 16) | |
1658 | cpp_error_with_line (pfile, CPP_DL_ERROR, token->src_loc, | |
1659 | col, "raw string delimiter longer " | |
1660 | "than 16 characters"); | |
1661 | else if (raw_prefix[raw_prefix_len] == '\n') | |
1662 | cpp_error_with_line (pfile, CPP_DL_ERROR, token->src_loc, | |
1663 | col, "invalid new-line in raw " | |
1664 | "string delimiter"); | |
1665 | else | |
1666 | cpp_error_with_line (pfile, CPP_DL_ERROR, token->src_loc, | |
1667 | col, "invalid character '%c' in " | |
1668 | "raw string delimiter", | |
1669 | (int) raw_prefix[raw_prefix_len]); | |
1670 | pfile->buffer->cur = orig_base + raw_prefix_start - 1; | |
1671 | create_literal (pfile, token, orig_base, | |
1672 | raw_prefix_start - 1, CPP_OTHER); | |
1673 | if (first_buff) | |
1674 | _cpp_release_buff (pfile, first_buff); | |
1675 | return; | |
1676 | } | |
1677 | raw_prefix[raw_prefix_len] = '"'; | |
1678 | phase = RAW_STR; | |
1679 | /* Nothing should be appended to temp_buffer during | |
1680 | RAW_STR phase. */ | |
1681 | temp_buffer_len = 17; | |
1682 | break; | |
1683 | } | |
1684 | continue; | |
1685 | } | |
1686 | else if (phase == RAW_STR_SUFFIX) | |
1687 | { | |
1688 | while (raw_suffix_len <= raw_prefix_len | |
1689 | && raw_suffix_len < temp_buffer_len | |
1690 | && temp_buffer[raw_suffix_len] == raw_prefix[raw_suffix_len]) | |
1691 | raw_suffix_len++; | |
1692 | if (raw_suffix_len > raw_prefix_len) | |
1693 | break; | |
1694 | if (raw_suffix_len == temp_buffer_len) | |
1695 | continue; | |
1696 | phase = RAW_STR; | |
1697 | /* Nothing should be appended to temp_buffer during | |
1698 | RAW_STR phase. */ | |
1699 | temp_buffer_len = 17; | |
1700 | } | |
1701 | if (c == ')') | |
1702 | { | |
1703 | phase = RAW_STR_SUFFIX; | |
1704 | raw_suffix_len = 0; | |
1705 | temp_buffer_len = 0; | |
2c6e3f55 JJ |
1706 | } |
1707 | else if (c == '\n') | |
1708 | { | |
1709 | if (pfile->state.in_directive | |
d5e48350 JJ |
1710 | || (pfile->state.parsing_args |
1711 | && pfile->buffer->next_line >= pfile->buffer->rlimit)) | |
2c6e3f55 JJ |
1712 | { |
1713 | cur--; | |
1714 | type = CPP_OTHER; | |
1715 | cpp_error_with_line (pfile, CPP_DL_ERROR, token->src_loc, 0, | |
1716 | "unterminated raw string"); | |
1717 | break; | |
1718 | } | |
1719 | ||
00a81b8b | 1720 | BUF_APPEND (base, cur - base); |
2c6e3f55 JJ |
1721 | |
1722 | if (pfile->buffer->cur < pfile->buffer->rlimit) | |
1723 | CPP_INCREMENT_LINE (pfile, 0); | |
1724 | pfile->buffer->need_line = true; | |
1725 | ||
00a81b8b JM |
1726 | pfile->buffer->cur = cur-1; |
1727 | _cpp_process_line_notes (pfile, false); | |
2c6e3f55 JJ |
1728 | if (!_cpp_get_fresh_line (pfile)) |
1729 | { | |
1730 | source_location src_loc = token->src_loc; | |
1731 | token->type = CPP_EOF; | |
1732 | /* Tell the compiler the line number of the EOF token. */ | |
1733 | token->src_loc = pfile->line_table->highest_line; | |
1734 | token->flags = BOL; | |
1735 | if (first_buff != NULL) | |
1736 | _cpp_release_buff (pfile, first_buff); | |
1737 | cpp_error_with_line (pfile, CPP_DL_ERROR, src_loc, 0, | |
1738 | "unterminated raw string"); | |
1739 | return; | |
1740 | } | |
1741 | ||
1742 | cur = base = pfile->buffer->cur; | |
00a81b8b | 1743 | note = &pfile->buffer->notes[pfile->buffer->cur_note]; |
2c6e3f55 | 1744 | } |
2c6e3f55 JJ |
1745 | } |
1746 | ||
3ce4f9e4 ESR |
1747 | if (CPP_OPTION (pfile, user_literals)) |
1748 | { | |
c865f923 ESR |
1749 | /* If a string format macro, say from inttypes.h, is placed touching |
1750 | a string literal it could be parsed as a C++11 user-defined string | |
1751 | literal thus breaking the program. | |
1752 | Try to identify macros with is_macro. A warning is issued. */ | |
1753 | if (is_macro (pfile, cur)) | |
7f5f5f98 | 1754 | { |
112448b4 | 1755 | /* Raise a warning, but do not consume subsequent tokens. */ |
7aee8646 | 1756 | if (CPP_OPTION (pfile, warn_literal_suffix) && !pfile->state.skipping) |
7f5f5f98 OW |
1757 | cpp_warning_with_line (pfile, CPP_W_LITERAL_SUFFIX, |
1758 | token->src_loc, 0, | |
1759 | "invalid suffix on literal; C++11 requires " | |
c865f923 | 1760 | "a space between literal and string macro"); |
7f5f5f98 | 1761 | } |
3ce4f9e4 | 1762 | /* Grab user defined literal suffix. */ |
561f7fc7 | 1763 | else if (ISIDST (*cur)) |
3ce4f9e4 ESR |
1764 | { |
1765 | type = cpp_userdef_string_add_type (type); | |
1766 | ++cur; | |
7f5f5f98 OW |
1767 | |
1768 | while (ISIDNUM (*cur)) | |
1769 | ++cur; | |
3ce4f9e4 | 1770 | } |
3ce4f9e4 ESR |
1771 | } |
1772 | ||
2c6e3f55 JJ |
1773 | pfile->buffer->cur = cur; |
1774 | if (first_buff == NULL) | |
1775 | create_literal (pfile, token, base, cur - base, type); | |
1776 | else | |
1777 | { | |
1778 | uchar *dest = _cpp_unaligned_alloc (pfile, total_len + (cur - base) + 1); | |
1779 | ||
1780 | token->type = type; | |
1781 | token->val.str.len = total_len + (cur - base); | |
1782 | token->val.str.text = dest; | |
1783 | last_buff = first_buff; | |
1784 | while (last_buff != NULL) | |
1785 | { | |
1786 | memcpy (dest, last_buff->base, | |
1787 | BUFF_FRONT (last_buff) - last_buff->base); | |
1788 | dest += BUFF_FRONT (last_buff) - last_buff->base; | |
1789 | last_buff = last_buff->next; | |
1790 | } | |
1791 | _cpp_release_buff (pfile, first_buff); | |
1792 | memcpy (dest, base, cur - base); | |
1793 | dest[cur - base] = '\0'; | |
1794 | } | |
1795 | } | |
1796 | ||
bced6edf | 1797 | /* Lexes a string, character constant, or angle-bracketed header file |
6338b358 | 1798 | name. The stored string contains the spelling, including opening |
2c6e3f55 JJ |
1799 | quote and any leading 'L', 'u', 'U' or 'u8' and optional |
1800 | 'R' modifier. It returns the type of the literal, or CPP_OTHER | |
1801 | if it was not properly terminated, or CPP_LESS for an unterminated | |
1802 | header name which must be relexed as normal tokens. | |
6338b358 NB |
1803 | |
1804 | The spelling is NUL-terminated, but it is not guaranteed that this | |
1805 | is the first NUL since embedded NULs are preserved. */ | |
041c3194 | 1806 | static void |
6cf87ca4 | 1807 | lex_string (cpp_reader *pfile, cpp_token *token, const uchar *base) |
45b966db | 1808 | { |
6338b358 NB |
1809 | bool saw_NUL = false; |
1810 | const uchar *cur; | |
bced6edf | 1811 | cppchar_t terminator; |
6338b358 NB |
1812 | enum cpp_ttype type; |
1813 | ||
1814 | cur = base; | |
1815 | terminator = *cur++; | |
2c6e3f55 | 1816 | if (terminator == 'L' || terminator == 'U') |
6338b358 | 1817 | terminator = *cur++; |
2c6e3f55 JJ |
1818 | else if (terminator == 'u') |
1819 | { | |
1820 | terminator = *cur++; | |
1821 | if (terminator == '8') | |
1822 | terminator = *cur++; | |
1823 | } | |
1824 | if (terminator == 'R') | |
1825 | { | |
1826 | lex_raw_string (pfile, token, base, cur); | |
1827 | return; | |
1828 | } | |
1829 | if (terminator == '"') | |
b6baa67d KVH |
1830 | type = (*base == 'L' ? CPP_WSTRING : |
1831 | *base == 'U' ? CPP_STRING32 : | |
2c6e3f55 JJ |
1832 | *base == 'u' ? (base[1] == '8' ? CPP_UTF8STRING : CPP_STRING16) |
1833 | : CPP_STRING); | |
6338b358 | 1834 | else if (terminator == '\'') |
b6baa67d KVH |
1835 | type = (*base == 'L' ? CPP_WCHAR : |
1836 | *base == 'U' ? CPP_CHAR32 : | |
1837 | *base == 'u' ? CPP_CHAR16 : CPP_CHAR); | |
6338b358 NB |
1838 | else |
1839 | terminator = '>', type = CPP_HEADER_NAME; | |
93c80368 | 1840 | |
0d9f234d | 1841 | for (;;) |
45b966db | 1842 | { |
6338b358 | 1843 | cppchar_t c = *cur++; |
7868b4a2 | 1844 | |
6f572ac2 | 1845 | /* In #include-style directives, terminators are not escapable. */ |
6338b358 NB |
1846 | if (c == '\\' && !pfile->state.angled_headers && *cur != '\n') |
1847 | cur++; | |
1848 | else if (c == terminator) | |
bced6edf | 1849 | break; |
6338b358 | 1850 | else if (c == '\n') |
0d9f234d | 1851 | { |
6338b358 | 1852 | cur--; |
4bb09c26 JM |
1853 | /* Unmatched quotes always yield undefined behavior, but |
1854 | greedy lexing means that what appears to be an unterminated | |
1855 | header name may actually be a legitimate sequence of tokens. */ | |
1856 | if (terminator == '>') | |
1857 | { | |
1858 | token->type = CPP_LESS; | |
1859 | return; | |
1860 | } | |
6338b358 NB |
1861 | type = CPP_OTHER; |
1862 | break; | |
45b966db | 1863 | } |
6338b358 NB |
1864 | else if (c == '\0') |
1865 | saw_NUL = true; | |
45b966db ZW |
1866 | } |
1867 | ||
6338b358 | 1868 | if (saw_NUL && !pfile->state.skipping) |
0527bc4e JDA |
1869 | cpp_error (pfile, CPP_DL_WARNING, |
1870 | "null character(s) preserved in literal"); | |
45b966db | 1871 | |
c663e301 JM |
1872 | if (type == CPP_OTHER && CPP_OPTION (pfile, lang) != CLK_ASM) |
1873 | cpp_error (pfile, CPP_DL_PEDWARN, "missing terminating %c character", | |
1874 | (int) terminator); | |
1875 | ||
3ce4f9e4 ESR |
1876 | if (CPP_OPTION (pfile, user_literals)) |
1877 | { | |
c865f923 ESR |
1878 | /* If a string format macro, say from inttypes.h, is placed touching |
1879 | a string literal it could be parsed as a C++11 user-defined string | |
1880 | literal thus breaking the program. | |
1881 | Try to identify macros with is_macro. A warning is issued. */ | |
1882 | if (is_macro (pfile, cur)) | |
7f5f5f98 | 1883 | { |
112448b4 | 1884 | /* Raise a warning, but do not consume subsequent tokens. */ |
7aee8646 | 1885 | if (CPP_OPTION (pfile, warn_literal_suffix) && !pfile->state.skipping) |
7f5f5f98 OW |
1886 | cpp_warning_with_line (pfile, CPP_W_LITERAL_SUFFIX, |
1887 | token->src_loc, 0, | |
1888 | "invalid suffix on literal; C++11 requires " | |
c865f923 | 1889 | "a space between literal and string macro"); |
7f5f5f98 | 1890 | } |
3ce4f9e4 | 1891 | /* Grab user defined literal suffix. */ |
561f7fc7 | 1892 | else if (ISIDST (*cur)) |
3ce4f9e4 ESR |
1893 | { |
1894 | type = cpp_userdef_char_add_type (type); | |
1895 | type = cpp_userdef_string_add_type (type); | |
1896 | ++cur; | |
7f5f5f98 OW |
1897 | |
1898 | while (ISIDNUM (*cur)) | |
1899 | ++cur; | |
3ce4f9e4 | 1900 | } |
3ce4f9e4 ESR |
1901 | } |
1902 | ||
6338b358 NB |
1903 | pfile->buffer->cur = cur; |
1904 | create_literal (pfile, token, base, cur - base, type); | |
0d9f234d | 1905 | } |
041c3194 | 1906 | |
631d0d36 MG |
1907 | /* Return the comment table. The client may not make any assumption |
1908 | about the ordering of the table. */ | |
1909 | cpp_comment_table * | |
1910 | cpp_get_comments (cpp_reader *pfile) | |
1911 | { | |
1912 | return &pfile->comments; | |
1913 | } | |
1914 | ||
1915 | /* Append a comment to the end of the comment table. */ | |
1916 | static void | |
1917 | store_comment (cpp_reader *pfile, cpp_token *token) | |
1918 | { | |
1919 | int len; | |
1920 | ||
1921 | if (pfile->comments.allocated == 0) | |
1922 | { | |
1923 | pfile->comments.allocated = 256; | |
1924 | pfile->comments.entries = (cpp_comment *) xmalloc | |
1925 | (pfile->comments.allocated * sizeof (cpp_comment)); | |
1926 | } | |
1927 | ||
1928 | if (pfile->comments.count == pfile->comments.allocated) | |
1929 | { | |
1930 | pfile->comments.allocated *= 2; | |
1931 | pfile->comments.entries = (cpp_comment *) xrealloc | |
1932 | (pfile->comments.entries, | |
1933 | pfile->comments.allocated * sizeof (cpp_comment)); | |
1934 | } | |
1935 | ||
1936 | len = token->val.str.len; | |
1937 | ||
1938 | /* Copy comment. Note, token may not be NULL terminated. */ | |
1939 | pfile->comments.entries[pfile->comments.count].comment = | |
1940 | (char *) xmalloc (sizeof (char) * (len + 1)); | |
1941 | memcpy (pfile->comments.entries[pfile->comments.count].comment, | |
1942 | token->val.str.text, len); | |
1943 | pfile->comments.entries[pfile->comments.count].comment[len] = '\0'; | |
1944 | ||
1945 | /* Set source location. */ | |
1946 | pfile->comments.entries[pfile->comments.count].sloc = token->src_loc; | |
1947 | ||
1948 | /* Increment the count of entries in the comment table. */ | |
1949 | pfile->comments.count++; | |
1950 | } | |
1951 | ||
93c80368 | 1952 | /* The stored comment includes the comment start and any terminator. */ |
9e62c811 | 1953 | static void |
6cf87ca4 ZW |
1954 | save_comment (cpp_reader *pfile, cpp_token *token, const unsigned char *from, |
1955 | cppchar_t type) | |
9e62c811 | 1956 | { |
041c3194 | 1957 | unsigned char *buffer; |
651a20b5 | 1958 | unsigned int len, clen, i; |
df383483 | 1959 | |
1c6d33ef | 1960 | len = pfile->buffer->cur - from + 1; /* + 1 for the initial '/'. */ |
480709cc | 1961 | |
3542203b NB |
1962 | /* C++ comments probably (not definitely) have moved past a new |
1963 | line, which we don't want to save in the comment. */ | |
480709cc | 1964 | if (is_vspace (pfile->buffer->cur[-1])) |
3542203b | 1965 | len--; |
477cdac7 | 1966 | |
651a20b5 KT |
1967 | /* If we are currently in a directive or in argument parsing, then |
1968 | we need to store all C++ comments as C comments internally, and | |
1969 | so we need to allocate a little extra space in that case. | |
477cdac7 JT |
1970 | |
1971 | Note that the only time we encounter a directive here is | |
1972 | when we are saving comments in a "#define". */ | |
651a20b5 KT |
1973 | clen = ((pfile->state.in_directive || pfile->state.parsing_args) |
1974 | && type == '/') ? len + 2 : len; | |
477cdac7 JT |
1975 | |
1976 | buffer = _cpp_unaligned_alloc (pfile, clen); | |
df383483 | 1977 | |
041c3194 | 1978 | token->type = CPP_COMMENT; |
477cdac7 | 1979 | token->val.str.len = clen; |
0d9f234d | 1980 | token->val.str.text = buffer; |
45b966db | 1981 | |
1c6d33ef NB |
1982 | buffer[0] = '/'; |
1983 | memcpy (buffer + 1, from, len - 1); | |
477cdac7 | 1984 | |
1eeeb6a4 | 1985 | /* Finish conversion to a C comment, if necessary. */ |
651a20b5 | 1986 | if ((pfile->state.in_directive || pfile->state.parsing_args) && type == '/') |
477cdac7 JT |
1987 | { |
1988 | buffer[1] = '*'; | |
1989 | buffer[clen - 2] = '*'; | |
1990 | buffer[clen - 1] = '/'; | |
651a20b5 KT |
1991 | /* As there can be in a C++ comments illegal sequences for C comments |
1992 | we need to filter them out. */ | |
1993 | for (i = 2; i < (clen - 2); i++) | |
1994 | if (buffer[i] == '/' && (buffer[i - 1] == '*' || buffer[i + 1] == '*')) | |
1995 | buffer[i] = '|'; | |
477cdac7 | 1996 | } |
631d0d36 MG |
1997 | |
1998 | /* Finally store this comment for use by clients of libcpp. */ | |
1999 | store_comment (pfile, token); | |
0d9f234d | 2000 | } |
45b966db | 2001 | |
5fddcffc NB |
2002 | /* Allocate COUNT tokens for RUN. */ |
2003 | void | |
6cf87ca4 | 2004 | _cpp_init_tokenrun (tokenrun *run, unsigned int count) |
5fddcffc | 2005 | { |
72bb2c39 | 2006 | run->base = XNEWVEC (cpp_token, count); |
5fddcffc NB |
2007 | run->limit = run->base + count; |
2008 | run->next = NULL; | |
2009 | } | |
2010 | ||
2011 | /* Returns the next tokenrun, or creates one if there is none. */ | |
2012 | static tokenrun * | |
6cf87ca4 | 2013 | next_tokenrun (tokenrun *run) |
5fddcffc NB |
2014 | { |
2015 | if (run->next == NULL) | |
2016 | { | |
72bb2c39 | 2017 | run->next = XNEW (tokenrun); |
bdcbe496 | 2018 | run->next->prev = run; |
5fddcffc NB |
2019 | _cpp_init_tokenrun (run->next, 250); |
2020 | } | |
2021 | ||
2022 | return run->next; | |
2023 | } | |
2024 | ||
ad2305ad | 2025 | /* Return the number of not yet processed token in a given |
92582b75 TT |
2026 | context. */ |
2027 | int | |
ad2305ad | 2028 | _cpp_remaining_tokens_num_in_context (cpp_context *context) |
92582b75 | 2029 | { |
92582b75 | 2030 | if (context->tokens_kind == TOKENS_KIND_DIRECT) |
cbbcf655 | 2031 | return (LAST (context).token - FIRST (context).token); |
92582b75 TT |
2032 | else if (context->tokens_kind == TOKENS_KIND_INDIRECT |
2033 | || context->tokens_kind == TOKENS_KIND_EXTENDED) | |
cbbcf655 | 2034 | return (LAST (context).ptoken - FIRST (context).ptoken); |
92582b75 TT |
2035 | else |
2036 | abort (); | |
2037 | } | |
2038 | ||
ad2305ad DS |
2039 | /* Returns the token present at index INDEX in a given context. If |
2040 | INDEX is zero, the next token to be processed is returned. */ | |
92582b75 | 2041 | static const cpp_token* |
ad2305ad | 2042 | _cpp_token_from_context_at (cpp_context *context, int index) |
92582b75 | 2043 | { |
92582b75 TT |
2044 | if (context->tokens_kind == TOKENS_KIND_DIRECT) |
2045 | return &(FIRST (context).token[index]); | |
2046 | else if (context->tokens_kind == TOKENS_KIND_INDIRECT | |
2047 | || context->tokens_kind == TOKENS_KIND_EXTENDED) | |
2048 | return FIRST (context).ptoken[index]; | |
2049 | else | |
2050 | abort (); | |
2051 | } | |
2052 | ||
5950c3c9 BE |
2053 | /* Look ahead in the input stream. */ |
2054 | const cpp_token * | |
2055 | cpp_peek_token (cpp_reader *pfile, int index) | |
2056 | { | |
2057 | cpp_context *context = pfile->context; | |
2058 | const cpp_token *peektok; | |
2059 | int count; | |
2060 | ||
2061 | /* First, scan through any pending cpp_context objects. */ | |
2062 | while (context->prev) | |
2063 | { | |
ad2305ad | 2064 | ptrdiff_t sz = _cpp_remaining_tokens_num_in_context (context); |
5950c3c9 BE |
2065 | |
2066 | if (index < (int) sz) | |
ad2305ad | 2067 | return _cpp_token_from_context_at (context, index); |
5950c3c9 BE |
2068 | index -= (int) sz; |
2069 | context = context->prev; | |
2070 | } | |
2071 | ||
2072 | /* We will have to read some new tokens after all (and do so | |
2073 | without invalidating preceding tokens). */ | |
2074 | count = index; | |
2075 | pfile->keep_tokens++; | |
2076 | ||
2077 | do | |
2078 | { | |
2079 | peektok = _cpp_lex_token (pfile); | |
2080 | if (peektok->type == CPP_EOF) | |
2081 | return peektok; | |
2082 | } | |
2083 | while (index--); | |
2084 | ||
2085 | _cpp_backup_tokens_direct (pfile, count + 1); | |
2086 | pfile->keep_tokens--; | |
2087 | ||
2088 | return peektok; | |
2089 | } | |
2090 | ||
4ed5bcfb NB |
2091 | /* Allocate a single token that is invalidated at the same time as the |
2092 | rest of the tokens on the line. Has its line and col set to the | |
2093 | same as the last lexed token, so that diagnostics appear in the | |
2094 | right place. */ | |
2095 | cpp_token * | |
6cf87ca4 | 2096 | _cpp_temp_token (cpp_reader *pfile) |
4ed5bcfb NB |
2097 | { |
2098 | cpp_token *old, *result; | |
5950c3c9 BE |
2099 | ptrdiff_t sz = pfile->cur_run->limit - pfile->cur_token; |
2100 | ptrdiff_t la = (ptrdiff_t) pfile->lookaheads; | |
4ed5bcfb NB |
2101 | |
2102 | old = pfile->cur_token - 1; | |
5950c3c9 BE |
2103 | /* Any pre-existing lookaheads must not be clobbered. */ |
2104 | if (la) | |
2105 | { | |
2106 | if (sz <= la) | |
2107 | { | |
2108 | tokenrun *next = next_tokenrun (pfile->cur_run); | |
2109 | ||
2110 | if (sz < la) | |
2111 | memmove (next->base + 1, next->base, | |
2112 | (la - sz) * sizeof (cpp_token)); | |
2113 | ||
2114 | next->base[0] = pfile->cur_run->limit[-1]; | |
2115 | } | |
2116 | ||
2117 | if (sz > 1) | |
2118 | memmove (pfile->cur_token + 1, pfile->cur_token, | |
2119 | MIN (la, sz - 1) * sizeof (cpp_token)); | |
2120 | } | |
2121 | ||
2122 | if (!sz && pfile->cur_token == pfile->cur_run->limit) | |
4ed5bcfb NB |
2123 | { |
2124 | pfile->cur_run = next_tokenrun (pfile->cur_run); | |
2125 | pfile->cur_token = pfile->cur_run->base; | |
2126 | } | |
2127 | ||
2128 | result = pfile->cur_token++; | |
12f9df4e | 2129 | result->src_loc = old->src_loc; |
4ed5bcfb NB |
2130 | return result; |
2131 | } | |
2132 | ||
14baae01 NB |
2133 | /* Lex a token into RESULT (external interface). Takes care of issues |
2134 | like directive handling, token lookahead, multiple include | |
a1f300c0 | 2135 | optimization and skipping. */ |
345894b4 | 2136 | const cpp_token * |
6cf87ca4 | 2137 | _cpp_lex_token (cpp_reader *pfile) |
5fddcffc | 2138 | { |
bdcbe496 | 2139 | cpp_token *result; |
5fddcffc | 2140 | |
bdcbe496 | 2141 | for (;;) |
5fddcffc | 2142 | { |
bdcbe496 | 2143 | if (pfile->cur_token == pfile->cur_run->limit) |
5fddcffc | 2144 | { |
bdcbe496 NB |
2145 | pfile->cur_run = next_tokenrun (pfile->cur_run); |
2146 | pfile->cur_token = pfile->cur_run->base; | |
5fddcffc | 2147 | } |
ee380365 TT |
2148 | /* We assume that the current token is somewhere in the current |
2149 | run. */ | |
2150 | if (pfile->cur_token < pfile->cur_run->base | |
2151 | || pfile->cur_token >= pfile->cur_run->limit) | |
2152 | abort (); | |
5fddcffc | 2153 | |
bdcbe496 | 2154 | if (pfile->lookaheads) |
14baae01 NB |
2155 | { |
2156 | pfile->lookaheads--; | |
2157 | result = pfile->cur_token++; | |
2158 | } | |
bdcbe496 | 2159 | else |
14baae01 | 2160 | result = _cpp_lex_direct (pfile); |
bdcbe496 NB |
2161 | |
2162 | if (result->flags & BOL) | |
5fddcffc | 2163 | { |
bdcbe496 NB |
2164 | /* Is this a directive. If _cpp_handle_directive returns |
2165 | false, it is an assembler #. */ | |
2166 | if (result->type == CPP_HASH | |
e808ec9c NB |
2167 | /* 6.10.3 p 11: Directives in a list of macro arguments |
2168 | gives undefined behavior. This implementation | |
2169 | handles the directive as normal. */ | |
bc4071dd | 2170 | && pfile->state.parsing_args != 1) |
21b11495 | 2171 | { |
bc4071dd | 2172 | if (_cpp_handle_directive (pfile, result->flags & PREV_WHITE)) |
21b11495 | 2173 | { |
bc4071dd RH |
2174 | if (pfile->directive_result.type == CPP_PADDING) |
2175 | continue; | |
21b11495 | 2176 | result = &pfile->directive_result; |
21b11495 ZW |
2177 | } |
2178 | } | |
bc4071dd RH |
2179 | else if (pfile->state.in_deferred_pragma) |
2180 | result = &pfile->directive_result; | |
21b11495 | 2181 | |
97293897 | 2182 | if (pfile->cb.line_change && !pfile->state.skipping) |
6cf87ca4 | 2183 | pfile->cb.line_change (pfile, result, pfile->state.parsing_args); |
5fddcffc | 2184 | } |
5fddcffc | 2185 | |
bdcbe496 | 2186 | /* We don't skip tokens in directives. */ |
bc4071dd | 2187 | if (pfile->state.in_directive || pfile->state.in_deferred_pragma) |
bdcbe496 | 2188 | break; |
5fddcffc | 2189 | |
bdcbe496 | 2190 | /* Outside a directive, invalidate controlling macros. At file |
14baae01 | 2191 | EOF, _cpp_lex_direct takes care of popping the buffer, so we never |
6356f892 | 2192 | get here and MI optimization works. */ |
5fddcffc | 2193 | pfile->mi_valid = false; |
bdcbe496 NB |
2194 | |
2195 | if (!pfile->state.skipping || result->type == CPP_EOF) | |
2196 | break; | |
5fddcffc NB |
2197 | } |
2198 | ||
345894b4 | 2199 | return result; |
5fddcffc NB |
2200 | } |
2201 | ||
26aea073 NB |
2202 | /* Returns true if a fresh line has been loaded. */ |
2203 | bool | |
6cf87ca4 | 2204 | _cpp_get_fresh_line (cpp_reader *pfile) |
004cb263 | 2205 | { |
22234f56 PB |
2206 | int return_at_eof; |
2207 | ||
26aea073 NB |
2208 | /* We can't get a new line until we leave the current directive. */ |
2209 | if (pfile->state.in_directive) | |
2210 | return false; | |
df383483 | 2211 | |
26aea073 | 2212 | for (;;) |
1a76916c | 2213 | { |
26aea073 | 2214 | cpp_buffer *buffer = pfile->buffer; |
1a76916c | 2215 | |
26aea073 NB |
2216 | if (!buffer->need_line) |
2217 | return true; | |
2218 | ||
2219 | if (buffer->next_line < buffer->rlimit) | |
004cb263 | 2220 | { |
26aea073 NB |
2221 | _cpp_clean_line (pfile); |
2222 | return true; | |
2223 | } | |
004cb263 | 2224 | |
26aea073 NB |
2225 | /* First, get out of parsing arguments state. */ |
2226 | if (pfile->state.parsing_args) | |
2227 | return false; | |
2228 | ||
2229 | /* End of buffer. Non-empty files should end in a newline. */ | |
2230 | if (buffer->buf != buffer->rlimit | |
2231 | && buffer->next_line > buffer->rlimit | |
2232 | && !buffer->from_stage3) | |
2233 | { | |
ed0e74e0 | 2234 | /* Clip to buffer size. */ |
26aea073 | 2235 | buffer->next_line = buffer->rlimit; |
26aea073 | 2236 | } |
22234f56 PB |
2237 | |
2238 | return_at_eof = buffer->return_at_eof; | |
26aea073 | 2239 | _cpp_pop_buffer (pfile); |
22234f56 | 2240 | if (pfile->buffer == NULL || return_at_eof) |
a506c55c | 2241 | return false; |
26aea073 | 2242 | } |
004cb263 NB |
2243 | } |
2244 | ||
6f572ac2 NB |
2245 | #define IF_NEXT_IS(CHAR, THEN_TYPE, ELSE_TYPE) \ |
2246 | do \ | |
2247 | { \ | |
2248 | result->type = ELSE_TYPE; \ | |
2249 | if (*buffer->cur == CHAR) \ | |
2250 | buffer->cur++, result->type = THEN_TYPE; \ | |
2251 | } \ | |
2252 | while (0) | |
480709cc | 2253 | |
14baae01 NB |
2254 | /* Lex a token into pfile->cur_token, which is also incremented, to |
2255 | get diagnostics pointing to the correct location. | |
2256 | ||
2257 | Does not handle issues such as token lookahead, multiple-include | |
f1ba665b | 2258 | optimization, directives, skipping etc. This function is only |
14baae01 NB |
2259 | suitable for use by _cpp_lex_token, and in special cases like |
2260 | lex_expansion_token which doesn't care for any of these issues. | |
2261 | ||
2262 | When meeting a newline, returns CPP_EOF if parsing a directive, | |
2263 | otherwise returns to the start of the token buffer if permissible. | |
2264 | Returns the location of the lexed token. */ | |
2265 | cpp_token * | |
6cf87ca4 | 2266 | _cpp_lex_direct (cpp_reader *pfile) |
45b966db | 2267 | { |
0d9f234d | 2268 | cppchar_t c; |
adb84b42 | 2269 | cpp_buffer *buffer; |
0d9f234d | 2270 | const unsigned char *comment_start; |
14baae01 | 2271 | cpp_token *result = pfile->cur_token++; |
9ec7291f | 2272 | |
5fddcffc | 2273 | fresh_line: |
26aea073 | 2274 | result->flags = 0; |
2be570f9 | 2275 | buffer = pfile->buffer; |
a506c55c | 2276 | if (buffer->need_line) |
26aea073 | 2277 | { |
bc4071dd RH |
2278 | if (pfile->state.in_deferred_pragma) |
2279 | { | |
2280 | result->type = CPP_PRAGMA_EOL; | |
2281 | pfile->state.in_deferred_pragma = false; | |
2282 | if (!pfile->state.pragma_allow_expansion) | |
2283 | pfile->state.prevent_expansion--; | |
2284 | return result; | |
2285 | } | |
26aea073 NB |
2286 | if (!_cpp_get_fresh_line (pfile)) |
2287 | { | |
2288 | result->type = CPP_EOF; | |
9ff7868d NB |
2289 | if (!pfile->state.in_directive) |
2290 | { | |
2291 | /* Tell the compiler the line number of the EOF token. */ | |
500bee0a | 2292 | result->src_loc = pfile->line_table->highest_line; |
9ff7868d NB |
2293 | result->flags = BOL; |
2294 | } | |
26aea073 NB |
2295 | return result; |
2296 | } | |
2297 | if (!pfile->keep_tokens) | |
2298 | { | |
2299 | pfile->cur_run = &pfile->base_run; | |
2300 | result = pfile->base_run.base; | |
2301 | pfile->cur_token = result + 1; | |
2302 | } | |
2303 | result->flags = BOL; | |
2304 | if (pfile->state.parsing_args == 2) | |
2305 | result->flags |= PREV_WHITE; | |
2306 | } | |
a506c55c | 2307 | buffer = pfile->buffer; |
5fddcffc | 2308 | update_tokens_line: |
500bee0a | 2309 | result->src_loc = pfile->line_table->highest_line; |
041c3194 | 2310 | |
5fddcffc | 2311 | skipped_white: |
26aea073 NB |
2312 | if (buffer->cur >= buffer->notes[buffer->cur_note].pos |
2313 | && !pfile->overlaid_buffer) | |
2314 | { | |
2315 | _cpp_process_line_notes (pfile, false); | |
500bee0a | 2316 | result->src_loc = pfile->line_table->highest_line; |
26aea073 | 2317 | } |
480709cc | 2318 | c = *buffer->cur++; |
12f9df4e | 2319 | |
e3dfef44 GC |
2320 | if (pfile->forced_token_location_p) |
2321 | result->src_loc = *pfile->forced_token_location_p; | |
2322 | else | |
2323 | result->src_loc = linemap_position_for_column (pfile->line_table, | |
2324 | CPP_BUF_COLUMN (buffer, buffer->cur)); | |
5fddcffc | 2325 | |
0d9f234d | 2326 | switch (c) |
45b966db | 2327 | { |
4d6baafa NB |
2328 | case ' ': case '\t': case '\f': case '\v': case '\0': |
2329 | result->flags |= PREV_WHITE; | |
26aea073 NB |
2330 | skip_whitespace (pfile, c); |
2331 | goto skipped_white; | |
0d9f234d | 2332 | |
26aea073 | 2333 | case '\n': |
12f9df4e PB |
2334 | if (buffer->cur < buffer->rlimit) |
2335 | CPP_INCREMENT_LINE (pfile, 0); | |
26aea073 NB |
2336 | buffer->need_line = true; |
2337 | goto fresh_line; | |
46d07497 | 2338 | |
0d9f234d NB |
2339 | case '0': case '1': case '2': case '3': case '4': |
2340 | case '5': case '6': case '7': case '8': case '9': | |
50668cf6 GK |
2341 | { |
2342 | struct normalize_state nst = INITIAL_NORMALIZE_STATE; | |
2343 | result->type = CPP_NUMBER; | |
2344 | lex_number (pfile, &result->val.str, &nst); | |
2345 | warn_about_normalization (pfile, result, &nst); | |
2346 | break; | |
2347 | } | |
46d07497 | 2348 | |
0abc6a6a | 2349 | case 'L': |
b6baa67d KVH |
2350 | case 'u': |
2351 | case 'U': | |
2c6e3f55 JJ |
2352 | case 'R': |
2353 | /* 'L', 'u', 'U', 'u8' or 'R' may introduce wide characters, | |
2354 | wide strings or raw strings. */ | |
a48e3dd1 JM |
2355 | if (c == 'L' || CPP_OPTION (pfile, rliterals) |
2356 | || (c != 'R' && CPP_OPTION (pfile, uliterals))) | |
bced6edf | 2357 | { |
2c6e3f55 JJ |
2358 | if ((*buffer->cur == '\'' && c != 'R') |
2359 | || *buffer->cur == '"' | |
2360 | || (*buffer->cur == 'R' | |
2361 | && c != 'R' | |
2362 | && buffer->cur[1] == '"' | |
a48e3dd1 | 2363 | && CPP_OPTION (pfile, rliterals)) |
2c6e3f55 JJ |
2364 | || (*buffer->cur == '8' |
2365 | && c == 'u' | |
2366 | && (buffer->cur[1] == '"' | |
a48e3dd1 JM |
2367 | || (buffer->cur[1] == 'R' && buffer->cur[2] == '"' |
2368 | && CPP_OPTION (pfile, rliterals))))) | |
b6baa67d KVH |
2369 | { |
2370 | lex_string (pfile, result, buffer->cur - 1); | |
2371 | break; | |
2372 | } | |
bced6edf | 2373 | } |
df383483 | 2374 | /* Fall through. */ |
0abc6a6a | 2375 | |
0d9f234d NB |
2376 | case '_': |
2377 | case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': | |
2378 | case 'g': case 'h': case 'i': case 'j': case 'k': case 'l': | |
2379 | case 'm': case 'n': case 'o': case 'p': case 'q': case 'r': | |
b6baa67d | 2380 | case 's': case 't': case 'v': case 'w': case 'x': |
0d9f234d NB |
2381 | case 'y': case 'z': |
2382 | case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': | |
0abc6a6a | 2383 | case 'G': case 'H': case 'I': case 'J': case 'K': |
2c6e3f55 | 2384 | case 'M': case 'N': case 'O': case 'P': case 'Q': |
b6baa67d | 2385 | case 'S': case 'T': case 'V': case 'W': case 'X': |
0d9f234d NB |
2386 | case 'Y': case 'Z': |
2387 | result->type = CPP_NAME; | |
50668cf6 GK |
2388 | { |
2389 | struct normalize_state nst = INITIAL_NORMALIZE_STATE; | |
9a0c6187 JM |
2390 | result->val.node.node = lex_identifier (pfile, buffer->cur - 1, false, |
2391 | &nst); | |
50668cf6 GK |
2392 | warn_about_normalization (pfile, result, &nst); |
2393 | } | |
0d9f234d | 2394 | |
0d9f234d | 2395 | /* Convert named operators to their proper types. */ |
9a0c6187 | 2396 | if (result->val.node.node->flags & NODE_OPERATOR) |
0d9f234d NB |
2397 | { |
2398 | result->flags |= NAMED_OP; | |
9a0c6187 | 2399 | result->type = (enum cpp_ttype) result->val.node.node->directive_index; |
0d9f234d NB |
2400 | } |
2401 | break; | |
2402 | ||
2403 | case '\'': | |
2404 | case '"': | |
6338b358 | 2405 | lex_string (pfile, result, buffer->cur - 1); |
0d9f234d | 2406 | break; |
041c3194 | 2407 | |
0d9f234d | 2408 | case '/': |
1c6d33ef NB |
2409 | /* A potential block or line comment. */ |
2410 | comment_start = buffer->cur; | |
6f572ac2 NB |
2411 | c = *buffer->cur; |
2412 | ||
1c6d33ef NB |
2413 | if (c == '*') |
2414 | { | |
26aea073 | 2415 | if (_cpp_skip_block_comment (pfile)) |
0527bc4e | 2416 | cpp_error (pfile, CPP_DL_ERROR, "unterminated comment"); |
0d9f234d | 2417 | } |
909eb89c | 2418 | else if (c == '/' && ! CPP_OPTION (pfile, traditional)) |
0d9f234d | 2419 | { |
909eb89c MP |
2420 | /* Don't warn for system headers. */ |
2421 | if (cpp_in_system_header (pfile)) | |
2422 | ; | |
f3bede71 | 2423 | /* Warn about comments if pedantically GNUC89, and not |
bdb05a7b | 2424 | in system headers. */ |
909eb89c MP |
2425 | else if (CPP_OPTION (pfile, lang) == CLK_GNUC89 |
2426 | && CPP_PEDANTIC (pfile) | |
2427 | && ! buffer->warned_cplusplus_comments) | |
041c3194 | 2428 | { |
0527bc4e | 2429 | cpp_error (pfile, CPP_DL_PEDWARN, |
56508306 | 2430 | "C++ style comments are not allowed in ISO C90"); |
0527bc4e | 2431 | cpp_error (pfile, CPP_DL_PEDWARN, |
ebef4e8c | 2432 | "(this will be reported only once per input file)"); |
1c6d33ef NB |
2433 | buffer->warned_cplusplus_comments = 1; |
2434 | } | |
f3bede71 | 2435 | /* Or if specifically desired via -Wc90-c99-compat. */ |
177cce46 | 2436 | else if (CPP_OPTION (pfile, cpp_warn_c90_c99_compat) > 0 |
dd3ff077 | 2437 | && ! CPP_OPTION (pfile, cplusplus) |
f3bede71 MP |
2438 | && ! buffer->warned_cplusplus_comments) |
2439 | { | |
2440 | cpp_error (pfile, CPP_DL_WARNING, | |
3f4f5c9a | 2441 | "C++ style comments are incompatible with C90"); |
f3bede71 MP |
2442 | cpp_error (pfile, CPP_DL_WARNING, |
2443 | "(this will be reported only once per input file)"); | |
2444 | buffer->warned_cplusplus_comments = 1; | |
2445 | } | |
909eb89c MP |
2446 | /* In C89/C94, C++ style comments are forbidden. */ |
2447 | else if ((CPP_OPTION (pfile, lang) == CLK_STDC89 | |
2448 | || CPP_OPTION (pfile, lang) == CLK_STDC94)) | |
2449 | { | |
2450 | /* But don't be confused about valid code such as | |
2451 | - // immediately followed by *, | |
2452 | - // in a preprocessing directive, | |
2453 | - // in an #if 0 block. */ | |
2454 | if (buffer->cur[1] == '*' | |
2455 | || pfile->state.in_directive | |
2456 | || pfile->state.skipping) | |
2457 | { | |
2458 | result->type = CPP_DIV; | |
2459 | break; | |
2460 | } | |
2461 | else if (! buffer->warned_cplusplus_comments) | |
2462 | { | |
2463 | cpp_error (pfile, CPP_DL_ERROR, | |
2464 | "C++ style comments are not allowed in ISO C90"); | |
2465 | cpp_error (pfile, CPP_DL_ERROR, | |
2466 | "(this will be reported only once per input " | |
2467 | "file)"); | |
2468 | buffer->warned_cplusplus_comments = 1; | |
2469 | } | |
2470 | } | |
01ef6563 | 2471 | if (skip_line_comment (pfile) && CPP_OPTION (pfile, warn_comments)) |
87cf0651 | 2472 | cpp_warning (pfile, CPP_W_COMMENTS, "multi-line comment"); |
1c6d33ef | 2473 | } |
480709cc NB |
2474 | else if (c == '=') |
2475 | { | |
6f572ac2 | 2476 | buffer->cur++; |
480709cc NB |
2477 | result->type = CPP_DIV_EQ; |
2478 | break; | |
2479 | } | |
2480 | else | |
2481 | { | |
480709cc NB |
2482 | result->type = CPP_DIV; |
2483 | break; | |
2484 | } | |
0d9f234d | 2485 | |
1c6d33ef NB |
2486 | if (!pfile->state.save_comments) |
2487 | { | |
2488 | result->flags |= PREV_WHITE; | |
5fddcffc | 2489 | goto update_tokens_line; |
0d9f234d | 2490 | } |
1c6d33ef NB |
2491 | |
2492 | /* Save the comment as a token in its own right. */ | |
477cdac7 | 2493 | save_comment (pfile, result, comment_start, c); |
bdcbe496 | 2494 | break; |
0d9f234d NB |
2495 | |
2496 | case '<': | |
2497 | if (pfile->state.angled_headers) | |
2498 | { | |
6338b358 | 2499 | lex_string (pfile, result, buffer->cur - 1); |
4bb09c26 JM |
2500 | if (result->type != CPP_LESS) |
2501 | break; | |
0d9f234d | 2502 | } |
45b966db | 2503 | |
6f572ac2 NB |
2504 | result->type = CPP_LESS; |
2505 | if (*buffer->cur == '=') | |
2506 | buffer->cur++, result->type = CPP_LESS_EQ; | |
2507 | else if (*buffer->cur == '<') | |
0d9f234d | 2508 | { |
6f572ac2 NB |
2509 | buffer->cur++; |
2510 | IF_NEXT_IS ('=', CPP_LSHIFT_EQ, CPP_LSHIFT); | |
0d9f234d | 2511 | } |
6f572ac2 | 2512 | else if (CPP_OPTION (pfile, digraphs)) |
480709cc | 2513 | { |
6f572ac2 NB |
2514 | if (*buffer->cur == ':') |
2515 | { | |
1582c677 PC |
2516 | /* C++11 [2.5/3 lex.pptoken], "Otherwise, if the next |
2517 | three characters are <:: and the subsequent character | |
2518 | is neither : nor >, the < is treated as a preprocessor | |
2519 | token by itself". */ | |
2520 | if (CPP_OPTION (pfile, cplusplus) | |
61949153 PC |
2521 | && CPP_OPTION (pfile, lang) != CLK_CXX98 |
2522 | && CPP_OPTION (pfile, lang) != CLK_GNUCXX | |
1582c677 PC |
2523 | && buffer->cur[1] == ':' |
2524 | && buffer->cur[2] != ':' && buffer->cur[2] != '>') | |
2525 | break; | |
2526 | ||
6f572ac2 NB |
2527 | buffer->cur++; |
2528 | result->flags |= DIGRAPH; | |
2529 | result->type = CPP_OPEN_SQUARE; | |
2530 | } | |
2531 | else if (*buffer->cur == '%') | |
2532 | { | |
2533 | buffer->cur++; | |
2534 | result->flags |= DIGRAPH; | |
2535 | result->type = CPP_OPEN_BRACE; | |
2536 | } | |
480709cc | 2537 | } |
0d9f234d NB |
2538 | break; |
2539 | ||
2540 | case '>': | |
6f572ac2 NB |
2541 | result->type = CPP_GREATER; |
2542 | if (*buffer->cur == '=') | |
2543 | buffer->cur++, result->type = CPP_GREATER_EQ; | |
2544 | else if (*buffer->cur == '>') | |
0d9f234d | 2545 | { |
6f572ac2 NB |
2546 | buffer->cur++; |
2547 | IF_NEXT_IS ('=', CPP_RSHIFT_EQ, CPP_RSHIFT); | |
2548 | } | |
0d9f234d NB |
2549 | break; |
2550 | ||
cbcff6df | 2551 | case '%': |
6f572ac2 NB |
2552 | result->type = CPP_MOD; |
2553 | if (*buffer->cur == '=') | |
2554 | buffer->cur++, result->type = CPP_MOD_EQ; | |
2555 | else if (CPP_OPTION (pfile, digraphs)) | |
480709cc | 2556 | { |
6f572ac2 | 2557 | if (*buffer->cur == ':') |
480709cc | 2558 | { |
6f572ac2 NB |
2559 | buffer->cur++; |
2560 | result->flags |= DIGRAPH; | |
2561 | result->type = CPP_HASH; | |
2562 | if (*buffer->cur == '%' && buffer->cur[1] == ':') | |
9a0c6187 | 2563 | buffer->cur += 2, result->type = CPP_PASTE, result->val.token_no = 0; |
6f572ac2 NB |
2564 | } |
2565 | else if (*buffer->cur == '>') | |
2566 | { | |
2567 | buffer->cur++; | |
2568 | result->flags |= DIGRAPH; | |
2569 | result->type = CPP_CLOSE_BRACE; | |
480709cc | 2570 | } |
480709cc | 2571 | } |
0d9f234d NB |
2572 | break; |
2573 | ||
cbcff6df | 2574 | case '.': |
480709cc | 2575 | result->type = CPP_DOT; |
6f572ac2 | 2576 | if (ISDIGIT (*buffer->cur)) |
480709cc | 2577 | { |
50668cf6 | 2578 | struct normalize_state nst = INITIAL_NORMALIZE_STATE; |
480709cc | 2579 | result->type = CPP_NUMBER; |
50668cf6 GK |
2580 | lex_number (pfile, &result->val.str, &nst); |
2581 | warn_about_normalization (pfile, result, &nst); | |
480709cc | 2582 | } |
6f572ac2 NB |
2583 | else if (*buffer->cur == '.' && buffer->cur[1] == '.') |
2584 | buffer->cur += 2, result->type = CPP_ELLIPSIS; | |
2585 | else if (*buffer->cur == '*' && CPP_OPTION (pfile, cplusplus)) | |
2586 | buffer->cur++, result->type = CPP_DOT_STAR; | |
0d9f234d | 2587 | break; |
45b966db | 2588 | |
0d9f234d | 2589 | case '+': |
6f572ac2 NB |
2590 | result->type = CPP_PLUS; |
2591 | if (*buffer->cur == '+') | |
2592 | buffer->cur++, result->type = CPP_PLUS_PLUS; | |
2593 | else if (*buffer->cur == '=') | |
2594 | buffer->cur++, result->type = CPP_PLUS_EQ; | |
0d9f234d | 2595 | break; |
04e3ec78 | 2596 | |
0d9f234d | 2597 | case '-': |
6f572ac2 NB |
2598 | result->type = CPP_MINUS; |
2599 | if (*buffer->cur == '>') | |
0d9f234d | 2600 | { |
6f572ac2 | 2601 | buffer->cur++; |
480709cc | 2602 | result->type = CPP_DEREF; |
6f572ac2 NB |
2603 | if (*buffer->cur == '*' && CPP_OPTION (pfile, cplusplus)) |
2604 | buffer->cur++, result->type = CPP_DEREF_STAR; | |
480709cc | 2605 | } |
6f572ac2 NB |
2606 | else if (*buffer->cur == '-') |
2607 | buffer->cur++, result->type = CPP_MINUS_MINUS; | |
2608 | else if (*buffer->cur == '=') | |
2609 | buffer->cur++, result->type = CPP_MINUS_EQ; | |
0d9f234d | 2610 | break; |
45b966db | 2611 | |
0d9f234d | 2612 | case '&': |
6f572ac2 NB |
2613 | result->type = CPP_AND; |
2614 | if (*buffer->cur == '&') | |
2615 | buffer->cur++, result->type = CPP_AND_AND; | |
2616 | else if (*buffer->cur == '=') | |
2617 | buffer->cur++, result->type = CPP_AND_EQ; | |
0d9f234d | 2618 | break; |
df383483 | 2619 | |
0d9f234d | 2620 | case '|': |
6f572ac2 NB |
2621 | result->type = CPP_OR; |
2622 | if (*buffer->cur == '|') | |
2623 | buffer->cur++, result->type = CPP_OR_OR; | |
2624 | else if (*buffer->cur == '=') | |
2625 | buffer->cur++, result->type = CPP_OR_EQ; | |
0d9f234d | 2626 | break; |
45b966db | 2627 | |
0d9f234d | 2628 | case ':': |
6f572ac2 NB |
2629 | result->type = CPP_COLON; |
2630 | if (*buffer->cur == ':' && CPP_OPTION (pfile, cplusplus)) | |
2631 | buffer->cur++, result->type = CPP_SCOPE; | |
2632 | else if (*buffer->cur == '>' && CPP_OPTION (pfile, digraphs)) | |
0d9f234d | 2633 | { |
6f572ac2 | 2634 | buffer->cur++; |
0d9f234d | 2635 | result->flags |= DIGRAPH; |
480709cc NB |
2636 | result->type = CPP_CLOSE_SQUARE; |
2637 | } | |
0d9f234d | 2638 | break; |
45b966db | 2639 | |
480709cc NB |
2640 | case '*': IF_NEXT_IS ('=', CPP_MULT_EQ, CPP_MULT); break; |
2641 | case '=': IF_NEXT_IS ('=', CPP_EQ_EQ, CPP_EQ); break; | |
2642 | case '!': IF_NEXT_IS ('=', CPP_NOT_EQ, CPP_NOT); break; | |
2643 | case '^': IF_NEXT_IS ('=', CPP_XOR_EQ, CPP_XOR); break; | |
9a0c6187 | 2644 | case '#': IF_NEXT_IS ('#', CPP_PASTE, CPP_HASH); result->val.token_no = 0; break; |
480709cc | 2645 | |
26aea073 | 2646 | case '?': result->type = CPP_QUERY; break; |
0d9f234d NB |
2647 | case '~': result->type = CPP_COMPL; break; |
2648 | case ',': result->type = CPP_COMMA; break; | |
2649 | case '(': result->type = CPP_OPEN_PAREN; break; | |
2650 | case ')': result->type = CPP_CLOSE_PAREN; break; | |
2651 | case '[': result->type = CPP_OPEN_SQUARE; break; | |
2652 | case ']': result->type = CPP_CLOSE_SQUARE; break; | |
2653 | case '{': result->type = CPP_OPEN_BRACE; break; | |
2654 | case '}': result->type = CPP_CLOSE_BRACE; break; | |
2655 | case ';': result->type = CPP_SEMICOLON; break; | |
2656 | ||
40f03658 | 2657 | /* @ is a punctuator in Objective-C. */ |
cc937581 | 2658 | case '@': result->type = CPP_ATSIGN; break; |
0d9f234d | 2659 | |
0abc6a6a | 2660 | case '$': |
1613e52b NB |
2661 | case '\\': |
2662 | { | |
2663 | const uchar *base = --buffer->cur; | |
50668cf6 | 2664 | struct normalize_state nst = INITIAL_NORMALIZE_STATE; |
0abc6a6a | 2665 | |
50668cf6 | 2666 | if (forms_identifier_p (pfile, true, &nst)) |
1613e52b NB |
2667 | { |
2668 | result->type = CPP_NAME; | |
9a0c6187 | 2669 | result->val.node.node = lex_identifier (pfile, base, true, &nst); |
50668cf6 | 2670 | warn_about_normalization (pfile, result, &nst); |
1613e52b NB |
2671 | break; |
2672 | } | |
2673 | buffer->cur++; | |
1067694a | 2674 | } |
1613e52b | 2675 | |
1067694a | 2676 | default: |
6338b358 NB |
2677 | create_literal (pfile, result, buffer->cur - 1, 1, CPP_OTHER); |
2678 | break; | |
0d9f234d | 2679 | } |
bdcbe496 NB |
2680 | |
2681 | return result; | |
0d9f234d NB |
2682 | } |
2683 | ||
59325650 NB |
2684 | /* An upper bound on the number of bytes needed to spell TOKEN. |
2685 | Does not include preceding whitespace. */ | |
93c80368 | 2686 | unsigned int |
6cf87ca4 | 2687 | cpp_token_len (const cpp_token *token) |
0d9f234d | 2688 | { |
93c80368 | 2689 | unsigned int len; |
6d2c2047 | 2690 | |
93c80368 | 2691 | switch (TOKEN_SPELL (token)) |
041c3194 | 2692 | { |
cc955282 | 2693 | default: len = 6; break; |
6338b358 | 2694 | case SPELL_LITERAL: len = token->val.str.len; break; |
9a0c6187 | 2695 | case SPELL_IDENT: len = NODE_LEN (token->val.node.node) * 10; break; |
041c3194 | 2696 | } |
59325650 NB |
2697 | |
2698 | return len; | |
6d2c2047 ZW |
2699 | } |
2700 | ||
47e20491 GK |
2701 | /* Parse UTF-8 out of NAMEP and place a \U escape in BUFFER. |
2702 | Return the number of bytes read out of NAME. (There are always | |
2703 | 10 bytes written to BUFFER.) */ | |
2704 | ||
2705 | static size_t | |
2706 | utf8_to_ucn (unsigned char *buffer, const unsigned char *name) | |
2707 | { | |
2708 | int j; | |
2709 | int ucn_len = 0; | |
2710 | int ucn_len_c; | |
2711 | unsigned t; | |
2712 | unsigned long utf32; | |
2713 | ||
2714 | /* Compute the length of the UTF-8 sequence. */ | |
2715 | for (t = *name; t & 0x80; t <<= 1) | |
2716 | ucn_len++; | |
2717 | ||
2718 | utf32 = *name & (0x7F >> ucn_len); | |
2719 | for (ucn_len_c = 1; ucn_len_c < ucn_len; ucn_len_c++) | |
2720 | { | |
2721 | utf32 = (utf32 << 6) | (*++name & 0x3F); | |
2722 | ||
2723 | /* Ill-formed UTF-8. */ | |
2724 | if ((*name & ~0x3F) != 0x80) | |
2725 | abort (); | |
2726 | } | |
2727 | ||
2728 | *buffer++ = '\\'; | |
2729 | *buffer++ = 'U'; | |
2730 | for (j = 7; j >= 0; j--) | |
2731 | *buffer++ = "0123456789abcdef"[(utf32 >> (4 * j)) & 0xF]; | |
2732 | return ucn_len; | |
2733 | } | |
2734 | ||
cfc93532 MLI |
2735 | /* Given a token TYPE corresponding to a digraph, return a pointer to |
2736 | the spelling of the digraph. */ | |
2737 | static const unsigned char * | |
2738 | cpp_digraph2name (enum cpp_ttype type) | |
2739 | { | |
2740 | return digraph_spellings[(int) type - (int) CPP_FIRST_DIGRAPH]; | |
2741 | } | |
47e20491 | 2742 | |
041c3194 | 2743 | /* Write the spelling of a token TOKEN to BUFFER. The buffer must |
cf00a885 | 2744 | already contain the enough space to hold the token's spelling. |
6cf87ca4 | 2745 | Returns a pointer to the character after the last character written. |
47e20491 GK |
2746 | FORSTRING is true if this is to be the spelling after translation |
2747 | phase 1 (this is different for UCNs). | |
6cf87ca4 | 2748 | FIXME: Would be nice if we didn't need the PFILE argument. */ |
93c80368 | 2749 | unsigned char * |
6cf87ca4 | 2750 | cpp_spell_token (cpp_reader *pfile, const cpp_token *token, |
47e20491 | 2751 | unsigned char *buffer, bool forstring) |
041c3194 | 2752 | { |
96be6998 | 2753 | switch (TOKEN_SPELL (token)) |
041c3194 ZW |
2754 | { |
2755 | case SPELL_OPERATOR: | |
2756 | { | |
2757 | const unsigned char *spelling; | |
2758 | unsigned char c; | |
d6d5f795 | 2759 | |
041c3194 | 2760 | if (token->flags & DIGRAPH) |
cfc93532 | 2761 | spelling = cpp_digraph2name (token->type); |
92936ecf ZW |
2762 | else if (token->flags & NAMED_OP) |
2763 | goto spell_ident; | |
041c3194 | 2764 | else |
96be6998 | 2765 | spelling = TOKEN_NAME (token); |
df383483 | 2766 | |
041c3194 ZW |
2767 | while ((c = *spelling++) != '\0') |
2768 | *buffer++ = c; | |
2769 | } | |
2770 | break; | |
d6d5f795 | 2771 | |
47ad4138 | 2772 | spell_ident: |
041c3194 | 2773 | case SPELL_IDENT: |
47e20491 GK |
2774 | if (forstring) |
2775 | { | |
9a0c6187 JM |
2776 | memcpy (buffer, NODE_NAME (token->val.node.node), |
2777 | NODE_LEN (token->val.node.node)); | |
2778 | buffer += NODE_LEN (token->val.node.node); | |
47e20491 GK |
2779 | } |
2780 | else | |
2781 | { | |
2782 | size_t i; | |
9a0c6187 | 2783 | const unsigned char * name = NODE_NAME (token->val.node.node); |
47e20491 | 2784 | |
9a0c6187 | 2785 | for (i = 0; i < NODE_LEN (token->val.node.node); i++) |
47e20491 GK |
2786 | if (name[i] & ~0x7F) |
2787 | { | |
2788 | i += utf8_to_ucn (buffer, name + i) - 1; | |
2789 | buffer += 10; | |
2790 | } | |
2791 | else | |
9a0c6187 | 2792 | *buffer++ = NODE_NAME (token->val.node.node)[i]; |
47e20491 | 2793 | } |
041c3194 | 2794 | break; |
d6d5f795 | 2795 | |
6338b358 | 2796 | case SPELL_LITERAL: |
47ad4138 ZW |
2797 | memcpy (buffer, token->val.str.text, token->val.str.len); |
2798 | buffer += token->val.str.len; | |
2799 | break; | |
2800 | ||
041c3194 | 2801 | case SPELL_NONE: |
0527bc4e JDA |
2802 | cpp_error (pfile, CPP_DL_ICE, |
2803 | "unspellable token %s", TOKEN_NAME (token)); | |
041c3194 ZW |
2804 | break; |
2805 | } | |
d6d5f795 | 2806 | |
041c3194 ZW |
2807 | return buffer; |
2808 | } | |
d6d5f795 | 2809 | |
5d8ebbd8 NB |
2810 | /* Returns TOKEN spelt as a null-terminated string. The string is |
2811 | freed when the reader is destroyed. Useful for diagnostics. */ | |
93c80368 | 2812 | unsigned char * |
6cf87ca4 | 2813 | cpp_token_as_text (cpp_reader *pfile, const cpp_token *token) |
59325650 NB |
2814 | { |
2815 | unsigned int len = cpp_token_len (token) + 1; | |
ece54d54 | 2816 | unsigned char *start = _cpp_unaligned_alloc (pfile, len), *end; |
c5a04734 | 2817 | |
47e20491 | 2818 | end = cpp_spell_token (pfile, token, start, false); |
93c80368 | 2819 | end[0] = '\0'; |
c5a04734 | 2820 | |
93c80368 NB |
2821 | return start; |
2822 | } | |
c5a04734 | 2823 | |
cfc93532 MLI |
2824 | /* Returns a pointer to a string which spells the token defined by |
2825 | TYPE and FLAGS. Used by C front ends, which really should move to | |
2826 | using cpp_token_as_text. */ | |
93c80368 | 2827 | const char * |
cfc93532 | 2828 | cpp_type2name (enum cpp_ttype type, unsigned char flags) |
93c80368 | 2829 | { |
cfc93532 MLI |
2830 | if (flags & DIGRAPH) |
2831 | return (const char *) cpp_digraph2name (type); | |
2832 | else if (flags & NAMED_OP) | |
2833 | return cpp_named_operator2name (type); | |
2834 | ||
93c80368 NB |
2835 | return (const char *) token_spellings[type].name; |
2836 | } | |
c5a04734 | 2837 | |
4ed5bcfb NB |
2838 | /* Writes the spelling of token to FP, without any preceding space. |
2839 | Separated from cpp_spell_token for efficiency - to avoid stdio | |
2840 | double-buffering. */ | |
93c80368 | 2841 | void |
6cf87ca4 | 2842 | cpp_output_token (const cpp_token *token, FILE *fp) |
93c80368 | 2843 | { |
93c80368 | 2844 | switch (TOKEN_SPELL (token)) |
c5a04734 | 2845 | { |
93c80368 NB |
2846 | case SPELL_OPERATOR: |
2847 | { | |
2848 | const unsigned char *spelling; | |
3b681e9d | 2849 | int c; |
c5a04734 | 2850 | |
93c80368 | 2851 | if (token->flags & DIGRAPH) |
cfc93532 | 2852 | spelling = cpp_digraph2name (token->type); |
93c80368 NB |
2853 | else if (token->flags & NAMED_OP) |
2854 | goto spell_ident; | |
2855 | else | |
2856 | spelling = TOKEN_NAME (token); | |
041c3194 | 2857 | |
3b681e9d ZW |
2858 | c = *spelling; |
2859 | do | |
2860 | putc (c, fp); | |
2861 | while ((c = *++spelling) != '\0'); | |
93c80368 NB |
2862 | } |
2863 | break; | |
041c3194 | 2864 | |
93c80368 NB |
2865 | spell_ident: |
2866 | case SPELL_IDENT: | |
47e20491 GK |
2867 | { |
2868 | size_t i; | |
9a0c6187 | 2869 | const unsigned char * name = NODE_NAME (token->val.node.node); |
47e20491 | 2870 | |
9a0c6187 | 2871 | for (i = 0; i < NODE_LEN (token->val.node.node); i++) |
47e20491 GK |
2872 | if (name[i] & ~0x7F) |
2873 | { | |
2874 | unsigned char buffer[10]; | |
2875 | i += utf8_to_ucn (buffer, name + i) - 1; | |
2876 | fwrite (buffer, 1, 10, fp); | |
2877 | } | |
2878 | else | |
9a0c6187 | 2879 | fputc (NODE_NAME (token->val.node.node)[i], fp); |
47e20491 GK |
2880 | } |
2881 | break; | |
041c3194 | 2882 | |
6338b358 | 2883 | case SPELL_LITERAL: |
47ad4138 ZW |
2884 | fwrite (token->val.str.text, 1, token->val.str.len, fp); |
2885 | break; | |
2886 | ||
93c80368 NB |
2887 | case SPELL_NONE: |
2888 | /* An error, most probably. */ | |
2889 | break; | |
041c3194 | 2890 | } |
c5a04734 ZW |
2891 | } |
2892 | ||
93c80368 NB |
2893 | /* Compare two tokens. */ |
2894 | int | |
6cf87ca4 | 2895 | _cpp_equiv_tokens (const cpp_token *a, const cpp_token *b) |
c5a04734 | 2896 | { |
93c80368 NB |
2897 | if (a->type == b->type && a->flags == b->flags) |
2898 | switch (TOKEN_SPELL (a)) | |
2899 | { | |
2900 | default: /* Keep compiler happy. */ | |
2901 | case SPELL_OPERATOR: | |
9a0c6187 | 2902 | /* token_no is used to track where multiple consecutive ## |
aa508502 | 2903 | tokens were originally located. */ |
9a0c6187 | 2904 | return (a->type != CPP_PASTE || a->val.token_no == b->val.token_no); |
93c80368 | 2905 | case SPELL_NONE: |
9a0c6187 JM |
2906 | return (a->type != CPP_MACRO_ARG |
2907 | || a->val.macro_arg.arg_no == b->val.macro_arg.arg_no); | |
93c80368 | 2908 | case SPELL_IDENT: |
9a0c6187 | 2909 | return a->val.node.node == b->val.node.node; |
6338b358 | 2910 | case SPELL_LITERAL: |
93c80368 NB |
2911 | return (a->val.str.len == b->val.str.len |
2912 | && !memcmp (a->val.str.text, b->val.str.text, | |
2913 | a->val.str.len)); | |
2914 | } | |
c5a04734 | 2915 | |
041c3194 ZW |
2916 | return 0; |
2917 | } | |
2918 | ||
93c80368 NB |
2919 | /* Returns nonzero if a space should be inserted to avoid an |
2920 | accidental token paste for output. For simplicity, it is | |
2921 | conservative, and occasionally advises a space where one is not | |
2922 | needed, e.g. "." and ".2". */ | |
93c80368 | 2923 | int |
6cf87ca4 ZW |
2924 | cpp_avoid_paste (cpp_reader *pfile, const cpp_token *token1, |
2925 | const cpp_token *token2) | |
c5a04734 | 2926 | { |
93c80368 NB |
2927 | enum cpp_ttype a = token1->type, b = token2->type; |
2928 | cppchar_t c; | |
c5a04734 | 2929 | |
93c80368 NB |
2930 | if (token1->flags & NAMED_OP) |
2931 | a = CPP_NAME; | |
2932 | if (token2->flags & NAMED_OP) | |
2933 | b = CPP_NAME; | |
c5a04734 | 2934 | |
93c80368 NB |
2935 | c = EOF; |
2936 | if (token2->flags & DIGRAPH) | |
37b8524c | 2937 | c = digraph_spellings[(int) b - (int) CPP_FIRST_DIGRAPH][0]; |
93c80368 NB |
2938 | else if (token_spellings[b].category == SPELL_OPERATOR) |
2939 | c = token_spellings[b].name[0]; | |
c5a04734 | 2940 | |
93c80368 | 2941 | /* Quickly get everything that can paste with an '='. */ |
37b8524c | 2942 | if ((int) a <= (int) CPP_LAST_EQ && c == '=') |
93c80368 | 2943 | return 1; |
c5a04734 | 2944 | |
93c80368 | 2945 | switch (a) |
c5a04734 | 2946 | { |
b52dbbf8 SE |
2947 | case CPP_GREATER: return c == '>'; |
2948 | case CPP_LESS: return c == '<' || c == '%' || c == ':'; | |
93c80368 NB |
2949 | case CPP_PLUS: return c == '+'; |
2950 | case CPP_MINUS: return c == '-' || c == '>'; | |
2951 | case CPP_DIV: return c == '/' || c == '*'; /* Comments. */ | |
2952 | case CPP_MOD: return c == ':' || c == '>'; | |
2953 | case CPP_AND: return c == '&'; | |
2954 | case CPP_OR: return c == '|'; | |
2955 | case CPP_COLON: return c == ':' || c == '>'; | |
2956 | case CPP_DEREF: return c == '*'; | |
26ec42ee | 2957 | case CPP_DOT: return c == '.' || c == '%' || b == CPP_NUMBER; |
93c80368 NB |
2958 | case CPP_HASH: return c == '#' || c == '%'; /* Digraph form. */ |
2959 | case CPP_NAME: return ((b == CPP_NUMBER | |
2960 | && name_p (pfile, &token2->val.str)) | |
2961 | || b == CPP_NAME | |
2962 | || b == CPP_CHAR || b == CPP_STRING); /* L */ | |
2963 | case CPP_NUMBER: return (b == CPP_NUMBER || b == CPP_NAME | |
2964 | || c == '.' || c == '+' || c == '-'); | |
1613e52b | 2965 | /* UCNs */ |
1067694a NB |
2966 | case CPP_OTHER: return ((token1->val.str.text[0] == '\\' |
2967 | && b == CPP_NAME) | |
1613e52b | 2968 | || (CPP_OPTION (pfile, objc) |
1067694a | 2969 | && token1->val.str.text[0] == '@' |
1613e52b | 2970 | && (b == CPP_NAME || b == CPP_STRING))); |
87e356ba JJ |
2971 | case CPP_STRING: |
2972 | case CPP_WSTRING: | |
2973 | case CPP_UTF8STRING: | |
2974 | case CPP_STRING16: | |
2975 | case CPP_STRING32: return (CPP_OPTION (pfile, user_literals) | |
2976 | && (b == CPP_NAME | |
2977 | || (TOKEN_SPELL (token2) == SPELL_LITERAL | |
2978 | && ISIDST (token2->val.str.text[0])))); | |
2979 | ||
93c80368 | 2980 | default: break; |
c5a04734 | 2981 | } |
c5a04734 | 2982 | |
417f3e3a | 2983 | return 0; |
c5a04734 ZW |
2984 | } |
2985 | ||
93c80368 | 2986 | /* Output all the remaining tokens on the current line, and a newline |
4ed5bcfb NB |
2987 | character, to FP. Leading whitespace is removed. If there are |
2988 | macros, special token padding is not performed. */ | |
c5a04734 | 2989 | void |
6cf87ca4 | 2990 | cpp_output_line (cpp_reader *pfile, FILE *fp) |
c5a04734 | 2991 | { |
4ed5bcfb | 2992 | const cpp_token *token; |
96be6998 | 2993 | |
4ed5bcfb NB |
2994 | token = cpp_get_token (pfile); |
2995 | while (token->type != CPP_EOF) | |
96be6998 | 2996 | { |
4ed5bcfb NB |
2997 | cpp_output_token (token, fp); |
2998 | token = cpp_get_token (pfile); | |
2999 | if (token->flags & PREV_WHITE) | |
3000 | putc (' ', fp); | |
96be6998 ZW |
3001 | } |
3002 | ||
93c80368 | 3003 | putc ('\n', fp); |
041c3194 | 3004 | } |
c5a04734 | 3005 | |
5d6342eb TT |
3006 | /* Return a string representation of all the remaining tokens on the |
3007 | current line. The result is allocated using xmalloc and must be | |
3008 | freed by the caller. */ | |
3009 | unsigned char * | |
3010 | cpp_output_line_to_string (cpp_reader *pfile, const unsigned char *dir_name) | |
3011 | { | |
3012 | const cpp_token *token; | |
3013 | unsigned int out = dir_name ? ustrlen (dir_name) : 0; | |
3014 | unsigned int alloced = 120 + out; | |
3015 | unsigned char *result = (unsigned char *) xmalloc (alloced); | |
3016 | ||
3017 | /* If DIR_NAME is empty, there are no initial contents. */ | |
3018 | if (dir_name) | |
3019 | { | |
3020 | sprintf ((char *) result, "#%s ", dir_name); | |
3021 | out += 2; | |
3022 | } | |
3023 | ||
3024 | token = cpp_get_token (pfile); | |
3025 | while (token->type != CPP_EOF) | |
3026 | { | |
3027 | unsigned char *last; | |
3028 | /* Include room for a possible space and the terminating nul. */ | |
3029 | unsigned int len = cpp_token_len (token) + 2; | |
3030 | ||
3031 | if (out + len > alloced) | |
3032 | { | |
3033 | alloced *= 2; | |
3034 | if (out + len > alloced) | |
3035 | alloced = out + len; | |
3036 | result = (unsigned char *) xrealloc (result, alloced); | |
3037 | } | |
3038 | ||
3039 | last = cpp_spell_token (pfile, token, &result[out], 0); | |
3040 | out = last - result; | |
3041 | ||
3042 | token = cpp_get_token (pfile); | |
3043 | if (token->flags & PREV_WHITE) | |
3044 | result[out++] = ' '; | |
3045 | } | |
3046 | ||
3047 | result[out] = '\0'; | |
3048 | return result; | |
3049 | } | |
3050 | ||
1e013d2e NB |
3051 | /* Memory buffers. Changing these three constants can have a dramatic |
3052 | effect on performance. The values here are reasonable defaults, | |
3053 | but might be tuned. If you adjust them, be sure to test across a | |
3054 | range of uses of cpplib, including heavy nested function-like macro | |
3055 | expansion. Also check the change in peak memory usage (NJAMD is a | |
3056 | good tool for this). */ | |
3057 | #define MIN_BUFF_SIZE 8000 | |
87062813 | 3058 | #define BUFF_SIZE_UPPER_BOUND(MIN_SIZE) (MIN_BUFF_SIZE + (MIN_SIZE) * 3 / 2) |
1e013d2e NB |
3059 | #define EXTENDED_BUFF_SIZE(BUFF, MIN_EXTRA) \ |
3060 | (MIN_EXTRA + ((BUFF)->limit - (BUFF)->cur) * 2) | |
417f3e3a | 3061 | |
87062813 NB |
3062 | #if MIN_BUFF_SIZE > BUFF_SIZE_UPPER_BOUND (0) |
3063 | #error BUFF_SIZE_UPPER_BOUND must be at least as large as MIN_BUFF_SIZE! | |
3064 | #endif | |
3065 | ||
c9e7a609 NB |
3066 | /* Create a new allocation buffer. Place the control block at the end |
3067 | of the buffer, so that buffer overflows will cause immediate chaos. */ | |
b8af0ca5 | 3068 | static _cpp_buff * |
6cf87ca4 | 3069 | new_buff (size_t len) |
b8af0ca5 NB |
3070 | { |
3071 | _cpp_buff *result; | |
ece54d54 | 3072 | unsigned char *base; |
b8af0ca5 | 3073 | |
1e013d2e NB |
3074 | if (len < MIN_BUFF_SIZE) |
3075 | len = MIN_BUFF_SIZE; | |
c70f6ed3 | 3076 | len = CPP_ALIGN (len); |
b8af0ca5 | 3077 | |
1a80db97 JJ |
3078 | #ifdef ENABLE_VALGRIND_CHECKING |
3079 | /* Valgrind warns about uses of interior pointers, so put _cpp_buff | |
3080 | struct first. */ | |
3081 | size_t slen = CPP_ALIGN2 (sizeof (_cpp_buff), 2 * DEFAULT_ALIGNMENT); | |
3082 | base = XNEWVEC (unsigned char, len + slen); | |
3083 | result = (_cpp_buff *) base; | |
3084 | base += slen; | |
3085 | #else | |
c3f829c1 | 3086 | base = XNEWVEC (unsigned char, len + sizeof (_cpp_buff)); |
b8af0ca5 | 3087 | result = (_cpp_buff *) (base + len); |
1a80db97 | 3088 | #endif |
b8af0ca5 NB |
3089 | result->base = base; |
3090 | result->cur = base; | |
3091 | result->limit = base + len; | |
3092 | result->next = NULL; | |
3093 | return result; | |
3094 | } | |
3095 | ||
3096 | /* Place a chain of unwanted allocation buffers on the free list. */ | |
3097 | void | |
6cf87ca4 | 3098 | _cpp_release_buff (cpp_reader *pfile, _cpp_buff *buff) |
b8af0ca5 NB |
3099 | { |
3100 | _cpp_buff *end = buff; | |
3101 | ||
3102 | while (end->next) | |
3103 | end = end->next; | |
3104 | end->next = pfile->free_buffs; | |
3105 | pfile->free_buffs = buff; | |
3106 | } | |
3107 | ||
3108 | /* Return a free buffer of size at least MIN_SIZE. */ | |
3109 | _cpp_buff * | |
6cf87ca4 | 3110 | _cpp_get_buff (cpp_reader *pfile, size_t min_size) |
b8af0ca5 NB |
3111 | { |
3112 | _cpp_buff *result, **p; | |
3113 | ||
3114 | for (p = &pfile->free_buffs;; p = &(*p)->next) | |
3115 | { | |
6142088c | 3116 | size_t size; |
1e013d2e NB |
3117 | |
3118 | if (*p == NULL) | |
b8af0ca5 | 3119 | return new_buff (min_size); |
1e013d2e NB |
3120 | result = *p; |
3121 | size = result->limit - result->base; | |
3122 | /* Return a buffer that's big enough, but don't waste one that's | |
3123 | way too big. */ | |
34f5271d | 3124 | if (size >= min_size && size <= BUFF_SIZE_UPPER_BOUND (min_size)) |
b8af0ca5 NB |
3125 | break; |
3126 | } | |
3127 | ||
3128 | *p = result->next; | |
3129 | result->next = NULL; | |
3130 | result->cur = result->base; | |
3131 | return result; | |
3132 | } | |
3133 | ||
4fe9b91c | 3134 | /* Creates a new buffer with enough space to hold the uncommitted |
8c3b2693 NB |
3135 | remaining bytes of BUFF, and at least MIN_EXTRA more bytes. Copies |
3136 | the excess bytes to the new buffer. Chains the new buffer after | |
3137 | BUFF, and returns the new buffer. */ | |
b8af0ca5 | 3138 | _cpp_buff * |
6cf87ca4 | 3139 | _cpp_append_extend_buff (cpp_reader *pfile, _cpp_buff *buff, size_t min_extra) |
b8af0ca5 | 3140 | { |
6142088c | 3141 | size_t size = EXTENDED_BUFF_SIZE (buff, min_extra); |
8c3b2693 | 3142 | _cpp_buff *new_buff = _cpp_get_buff (pfile, size); |
b8af0ca5 | 3143 | |
8c3b2693 NB |
3144 | buff->next = new_buff; |
3145 | memcpy (new_buff->base, buff->cur, BUFF_ROOM (buff)); | |
3146 | return new_buff; | |
3147 | } | |
3148 | ||
4fe9b91c | 3149 | /* Creates a new buffer with enough space to hold the uncommitted |
8c3b2693 NB |
3150 | remaining bytes of the buffer pointed to by BUFF, and at least |
3151 | MIN_EXTRA more bytes. Copies the excess bytes to the new buffer. | |
3152 | Chains the new buffer before the buffer pointed to by BUFF, and | |
3153 | updates the pointer to point to the new buffer. */ | |
3154 | void | |
6cf87ca4 | 3155 | _cpp_extend_buff (cpp_reader *pfile, _cpp_buff **pbuff, size_t min_extra) |
8c3b2693 NB |
3156 | { |
3157 | _cpp_buff *new_buff, *old_buff = *pbuff; | |
3158 | size_t size = EXTENDED_BUFF_SIZE (old_buff, min_extra); | |
3159 | ||
3160 | new_buff = _cpp_get_buff (pfile, size); | |
3161 | memcpy (new_buff->base, old_buff->cur, BUFF_ROOM (old_buff)); | |
3162 | new_buff->next = old_buff; | |
3163 | *pbuff = new_buff; | |
b8af0ca5 NB |
3164 | } |
3165 | ||
3166 | /* Free a chain of buffers starting at BUFF. */ | |
3167 | void | |
5671bf27 | 3168 | _cpp_free_buff (_cpp_buff *buff) |
b8af0ca5 NB |
3169 | { |
3170 | _cpp_buff *next; | |
3171 | ||
3172 | for (; buff; buff = next) | |
3173 | { | |
3174 | next = buff->next; | |
1a80db97 JJ |
3175 | #ifdef ENABLE_VALGRIND_CHECKING |
3176 | free (buff); | |
3177 | #else | |
b8af0ca5 | 3178 | free (buff->base); |
1a80db97 | 3179 | #endif |
b8af0ca5 NB |
3180 | } |
3181 | } | |
417f3e3a | 3182 | |
ece54d54 NB |
3183 | /* Allocate permanent, unaligned storage of length LEN. */ |
3184 | unsigned char * | |
6cf87ca4 | 3185 | _cpp_unaligned_alloc (cpp_reader *pfile, size_t len) |
ece54d54 NB |
3186 | { |
3187 | _cpp_buff *buff = pfile->u_buff; | |
3188 | unsigned char *result = buff->cur; | |
3189 | ||
3190 | if (len > (size_t) (buff->limit - result)) | |
3191 | { | |
3192 | buff = _cpp_get_buff (pfile, len); | |
3193 | buff->next = pfile->u_buff; | |
3194 | pfile->u_buff = buff; | |
3195 | result = buff->cur; | |
3196 | } | |
3197 | ||
3198 | buff->cur = result + len; | |
3199 | return result; | |
3200 | } | |
3201 | ||
87062813 NB |
3202 | /* Allocate permanent, unaligned storage of length LEN from a_buff. |
3203 | That buffer is used for growing allocations when saving macro | |
3204 | replacement lists in a #define, and when parsing an answer to an | |
3205 | assertion in #assert, #unassert or #if (and therefore possibly | |
3206 | whilst expanding macros). It therefore must not be used by any | |
3207 | code that they might call: specifically the lexer and the guts of | |
3208 | the macro expander. | |
3209 | ||
3210 | All existing other uses clearly fit this restriction: storing | |
3211 | registered pragmas during initialization. */ | |
93c80368 | 3212 | unsigned char * |
6cf87ca4 | 3213 | _cpp_aligned_alloc (cpp_reader *pfile, size_t len) |
3fef5b2b | 3214 | { |
8c3b2693 NB |
3215 | _cpp_buff *buff = pfile->a_buff; |
3216 | unsigned char *result = buff->cur; | |
3fef5b2b | 3217 | |
8c3b2693 | 3218 | if (len > (size_t) (buff->limit - result)) |
3fef5b2b | 3219 | { |
8c3b2693 NB |
3220 | buff = _cpp_get_buff (pfile, len); |
3221 | buff->next = pfile->a_buff; | |
3222 | pfile->a_buff = buff; | |
3223 | result = buff->cur; | |
3fef5b2b | 3224 | } |
041c3194 | 3225 | |
8c3b2693 | 3226 | buff->cur = result + len; |
93c80368 | 3227 | return result; |
041c3194 | 3228 | } |
d8044160 GK |
3229 | |
3230 | /* Say which field of TOK is in use. */ | |
3231 | ||
3232 | enum cpp_token_fld_kind | |
c26302d5 | 3233 | cpp_token_val_index (const cpp_token *tok) |
d8044160 GK |
3234 | { |
3235 | switch (TOKEN_SPELL (tok)) | |
3236 | { | |
3237 | case SPELL_IDENT: | |
3238 | return CPP_TOKEN_FLD_NODE; | |
3239 | case SPELL_LITERAL: | |
3240 | return CPP_TOKEN_FLD_STR; | |
aa508502 JM |
3241 | case SPELL_OPERATOR: |
3242 | if (tok->type == CPP_PASTE) | |
9a0c6187 | 3243 | return CPP_TOKEN_FLD_TOKEN_NO; |
aa508502 JM |
3244 | else |
3245 | return CPP_TOKEN_FLD_NONE; | |
d8044160 GK |
3246 | case SPELL_NONE: |
3247 | if (tok->type == CPP_MACRO_ARG) | |
3248 | return CPP_TOKEN_FLD_ARG_NO; | |
3249 | else if (tok->type == CPP_PADDING) | |
3250 | return CPP_TOKEN_FLD_SOURCE; | |
21b11495 | 3251 | else if (tok->type == CPP_PRAGMA) |
bc4071dd | 3252 | return CPP_TOKEN_FLD_PRAGMA; |
d8044160 GK |
3253 | /* else fall through */ |
3254 | default: | |
3255 | return CPP_TOKEN_FLD_NONE; | |
3256 | } | |
3257 | } | |
e3dfef44 GC |
3258 | |
3259 | /* All tokens lexed in R after calling this function will be forced to have | |
3260 | their source_location the same as the location referenced by P, until | |
3261 | cpp_stop_forcing_token_locations is called for R. */ | |
3262 | ||
3263 | void | |
3264 | cpp_force_token_locations (cpp_reader *r, source_location *p) | |
3265 | { | |
3266 | r->forced_token_location_p = p; | |
3267 | } | |
3268 | ||
3269 | /* Go back to assigning locations naturally for lexed tokens. */ | |
3270 | ||
3271 | void | |
3272 | cpp_stop_forcing_token_locations (cpp_reader *r) | |
3273 | { | |
3274 | r->forced_token_location_p = NULL; | |
3275 | } |