?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
More properly propagate ONE_SOURCE.
[tinycc.git] / tccpp.c
blobbd049c10b603ce9948dab077fe72e5e9ade1c6db
1 /*
2 * TCC - Tiny C Compiler
3 *
4 * Copyright (c) 2001-2004 Fabrice Bellard
5 *
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2 of the License, or (at your option) any later version.
10 *
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19 */
20
21 #include "tcc.h"
22
23 /********************************************************/
24 /* global variables */
25
26 ST_DATA int tok_flags;
27 ST_DATA int parse_flags;
28
29 ST_DATA struct BufferedFile *file;
30 ST_DATA int ch, tok;
31 ST_DATA CValue tokc;
32 ST_DATA const int *macro_ptr;
33 ST_DATA CString tokcstr; /* current parsed string, if any */
34
35 /* display benchmark infos */
36 ST_DATA int total_lines;
37 ST_DATA int total_bytes;
38 ST_DATA int tok_ident;
39 ST_DATA TokenSym **table_ident;
40
41 ST_DATA TinyAlloc *toksym_alloc;
42 ST_DATA TinyAlloc *tokstr_alloc;
43 ST_DATA TinyAlloc *cstr_alloc;
44
45 /* ------------------------------------------------------------------------- */
46
47 static TokenSym *hash_ident[TOK_HASH_SIZE];
48 static char token_buf[STRING_MAX_SIZE + 1];
49 static CString cstr_buf;
50 static TokenString tokstr_buf;
51 static unsigned char isidnum_table[256 - CH_EOF];
52 static int pp_debug_tok, pp_debug_symv;
53 static void tok_print(const char *msg, const int *str);
54
55 /* isidnum_table flags: */
56 #define IS_SPC 1
57 #define IS_ID 2
58 #define IS_NUM 4
59
60 static TokenString *macro_stack;
61
62 static const char tcc_keywords[] =
63 #define DEF(id, str) str "\0"
64 #include "tcctok.h"
65 #undef DEF
66 ;
67
68 /* WARNING: the content of this string encodes token numbers */
69 static const unsigned char tok_two_chars[] =
70 /* outdated -- gr
71 "<=\236>=\235!=\225&&\240||\241++\244--\242==\224<<\1>>\2+=\253"
72 "-=\255*=\252/=\257%=\245&=\246^=\336|=\374->\313..\250##\266";
73 */{
74 '<','=', TOK_LE,
75 '>','=', TOK_GE,
76 '!','=', TOK_NE,
77 '&','&', TOK_LAND,
78 '|','|', TOK_LOR,
79 '+','+', TOK_INC,
80 '-','-', TOK_DEC,
81 '=','=', TOK_EQ,
82 '<','<', TOK_SHL,
83 '>','>', TOK_SAR,
84 '+','=', TOK_A_ADD,
85 '-','=', TOK_A_SUB,
86 '*','=', TOK_A_MUL,
87 '/','=', TOK_A_DIV,
88 '%','=', TOK_A_MOD,
89 '&','=', TOK_A_AND,
90 '^','=', TOK_A_XOR,
91 '|','=', TOK_A_OR,
92 '-','>', TOK_ARROW,
93 '.','.', 0xa8, // C++ token ?
94 '#','#', TOK_TWOSHARPS,
95 0
96 };
97
98 static void next_nomacro_spc(void);
99
100 ST_FUNC void skip(int c)
101 {
102 if (tok != c)
103 tcc_error("'%c' expected (got \"%s\")", c, get_tok_str(tok, &tokc));
104 next();
105 }
106
107 ST_FUNC void expect(const char *msg)
108 {
109 tcc_error("%s expected", msg);
110 }
111
112 ST_FUNC void begin_macro(TokenString *str, int alloc)
113 {
114 str->alloc = alloc;
115 str->prev = macro_stack;
116 str->prev_ptr = macro_ptr;
117 macro_ptr = str->str;
118 macro_stack = str;
119 }
120
121 ST_FUNC void end_macro(void)
122 {
123 TokenString *str = macro_stack;
124 macro_stack = str->prev;
125 macro_ptr = str->prev_ptr;
126 if (str->alloc == 2) {
127 str->alloc = 3; /* just mark as finished */
128 } else {
129 tok_str_free(str->str);
130 if (str->alloc == 1)
131 tcc_free(str);
132 }
133 }
134
135 ST_FUNC char *trimfront(char *p)
136 {
137 while (*p && (unsigned char)*p <= ' ')
138 ++p;
139 return p;
140 }
141
142 ST_FUNC char *trimback(char *a, char *e)
143 {
144 while (e > a && (unsigned char)e[-1] <= ' ')
145 --e;
146 *e = 0;;
147 return a;
148 }
149
150 /* ------------------------------------------------------------------------- */
151 /* Custom allocator for tiny objects */
152
153 ST_FUNC TinyAlloc *tal_new(TinyAlloc **pal, size_t limit, size_t size)
154 {
155 TinyAlloc *al = tcc_mallocz(sizeof(TinyAlloc));
156 al->p = al->buffer = tcc_malloc(size);
157 al->limit = limit;
158 al->size = size;
159 if (pal) *pal = al;
160 return al;
161 }
162
163 ST_FUNC void tal_delete(TinyAlloc *al)
164 {
165 TinyAlloc *next;
166
167 tail_call:
168 if (!al)
169 return;
170 #ifdef TAL_INFO
171 fprintf(stderr, "limit=%5d, size=%5g MB, nb_peak=%6d, nb_total=%8d, nb_missed=%6d, usage=%5.1f%%\n",
172 al->limit, al->size / 1024.0 / 1024.0, al->nb_peak, al->nb_total, al->nb_missed,
173 (al->peak_p - al->buffer) * 100.0 / al->size);
174 #endif
175 #ifdef TAL_DEBUG
176 if (al->nb_allocs > 0) {
177 fprintf(stderr, "TAL_DEBUG: mem leak %d chunks (limit= %d)\n",
178 al->nb_allocs, al->limit);
179 uint8_t *p = al->buffer;
180 while (p < al->p) {
181 tal_header_t *header = (tal_header_t *)p;
182 if (header->line_num > 0) {
183 fprintf(stderr, " file %s, line %u: %u bytes\n",
184 header->file_name, header->line_num, header->size);
185 }
186 p += header->size + sizeof(tal_header_t);
187 }
188 }
189 #endif
190 next = al->next;
191 tcc_free(al->buffer);
192 tcc_free(al);
193 al = next;
194 goto tail_call;
195 }
196
197 ST_FUNC void tal_free_impl(TinyAlloc *al, void *p TAL_DEBUG_PARAMS)
198 {
199 if (!p)
200 return;
201 tail_call:
202 if (al->buffer <= (uint8_t *)p && (uint8_t *)p < al->buffer + al->size) {
203 #ifdef TAL_DEBUG
204 tal_header_t *header = (((tal_header_t *)p) - 1);
205 if (header->line_num < 0) {
206 fprintf(stderr, "TAL_DEBUG: file %s, line %u double frees chunk from\n",
207 file, line);
208 fprintf(stderr, " file %s, line %u: %u bytes\n",
209 header->file_name, -header->line_num, header->size);
210 } else
211 header->line_num = -header->line_num;
212 #endif
213 al->nb_allocs--;
214 if (!al->nb_allocs)
215 al->p = al->buffer;
216 } else if (al->next) {
217 al = al->next;
218 goto tail_call;
219 }
220 else
221 tcc_free(p);
222 }
223
224 ST_FUNC void *tal_realloc_impl(TinyAlloc **pal, void *p, size_t size TAL_DEBUG_PARAMS)
225 {
226 tal_header_t *header;
227 void *ret;
228 int is_own;
229 size_t adj_size = (size + 3) & -4;
230 TinyAlloc *al = *pal;
231
232 tail_call:
233 is_own = (al->buffer <= (uint8_t *)p && (uint8_t *)p < al->buffer + al->size);
234 if ((!p || is_own) && size <= al->limit) {
235 if (al->p + adj_size + sizeof(tal_header_t) < al->buffer + al->size) {
236 header = (tal_header_t *)al->p;
237 header->size = adj_size;
238 #ifdef TAL_DEBUG
239 int ofs = strlen(file) - TAL_DEBUG_FILE_LEN;
240 strncpy(header->file_name, file + (ofs > 0 ? ofs : 0), TAL_DEBUG_FILE_LEN);
241 header->file_name[TAL_DEBUG_FILE_LEN] = 0;
242 header->line_num = line;
243 #endif
244 ret = al->p + sizeof(tal_header_t);
245 al->p += adj_size + sizeof(tal_header_t);
246 if (is_own) {
247 header = (((tal_header_t *)p) - 1);
248 memcpy(ret, p, header->size);
249 #ifdef TAL_DEBUG
250 header->line_num = -header->line_num;
251 #endif
252 } else {
253 al->nb_allocs++;
254 }
255 #ifdef TAL_INFO
256 if (al->nb_peak < al->nb_allocs)
257 al->nb_peak = al->nb_allocs;
258 if (al->peak_p < al->p)
259 al->peak_p = al->p;
260 al->nb_total++;
261 #endif
262 return ret;
263 } else if (is_own) {
264 al->nb_allocs--;
265 ret = tal_realloc(*pal, 0, size);
266 header = (((tal_header_t *)p) - 1);
267 memcpy(ret, p, header->size);
268 #ifdef TAL_DEBUG
269 header->line_num = -header->line_num;
270 #endif
271 return ret;
272 }
273 if (al->next) {
274 al = al->next;
275 } else {
276 TinyAlloc *bottom = al, *next = al->top ? al->top : al;
277
278 al = tal_new(pal, next->limit, next->size * 2);
279 al->next = next;
280 bottom->top = al;
281 }
282 goto tail_call;
283 }
284 if (is_own) {
285 al->nb_allocs--;
286 ret = tcc_malloc(size);
287 header = (((tal_header_t *)p) - 1);
288 memcpy(ret, p, header->size);
289 #ifdef TAL_DEBUG
290 header->line_num = -header->line_num;
291 #endif
292 } else if (al->next) {
293 al = al->next;
294 goto tail_call;
295 } else
296 ret = tcc_realloc(p, size);
297 #ifdef TAL_INFO
298 al->nb_missed++;
299 #endif
300 return ret;
301 }
302
303 /* ------------------------------------------------------------------------- */
304 /* CString handling */
305 static void cstr_realloc(CString *cstr, int new_size)
306 {
307 int size;
308 void *data;
309
310 size = cstr->size_allocated;
311 if (size < 8)
312 size = 8; /* no need to allocate a too small first string */
313 while (size < new_size)
314 size = size * 2;
315 data = tal_realloc(cstr_alloc, cstr->data_allocated, size);
316 cstr->data_allocated = data;
317 cstr->size_allocated = size;
318 cstr->data = data;
319 }
320
321 /* add a byte */
322 ST_FUNC void cstr_ccat(CString *cstr, int ch)
323 {
324 int size;
325 size = cstr->size + 1;
326 if (size > cstr->size_allocated)
327 cstr_realloc(cstr, size);
328 ((unsigned char *)cstr->data)[size - 1] = ch;
329 cstr->size = size;
330 }
331
332 ST_FUNC void cstr_cat(CString *cstr, const char *str, int len)
333 {
334 int size;
335 if (len <= 0)
336 len = strlen(str) + 1 + len;
337 size = cstr->size + len;
338 if (size > cstr->size_allocated)
339 cstr_realloc(cstr, size);
340 memmove(((unsigned char *)cstr->data) + cstr->size, str, len);
341 cstr->size = size;
342 }
343
344 /* add a wide char */
345 ST_FUNC void cstr_wccat(CString *cstr, int ch)
346 {
347 int size;
348 size = cstr->size + sizeof(nwchar_t);
349 if (size > cstr->size_allocated)
350 cstr_realloc(cstr, size);
351 *(nwchar_t *)(((unsigned char *)cstr->data) + size - sizeof(nwchar_t)) = ch;
352 cstr->size = size;
353 }
354
355 ST_FUNC void cstr_new(CString *cstr)
356 {
357 memset(cstr, 0, sizeof(CString));
358 }
359
360 /* free string and reset it to NULL */
361 ST_FUNC void cstr_free(CString *cstr)
362 {
363 tal_free(cstr_alloc, cstr->data_allocated);
364 cstr_new(cstr);
365 }
366
367 /* reset string to empty */
368 ST_FUNC void cstr_reset(CString *cstr)
369 {
370 cstr->size = 0;
371 }
372
373 /* XXX: unicode ? */
374 static void add_char(CString *cstr, int c)
375 {
376 if (c == '\'' || c == '\"' || c == '\\') {
377 /* XXX: could be more precise if char or string */
378 cstr_ccat(cstr, '\\');
379 }
380 if (c >= 32 && c <= 126) {
381 cstr_ccat(cstr, c);
382 } else {
383 cstr_ccat(cstr, '\\');
384 if (c == '\n') {
385 cstr_ccat(cstr, 'n');
386 } else {
387 cstr_ccat(cstr, '0' + ((c >> 6) & 7));
388 cstr_ccat(cstr, '0' + ((c >> 3) & 7));
389 cstr_ccat(cstr, '0' + (c & 7));
390 }
391 }
392 }
393
394 /* ------------------------------------------------------------------------- */
395 /* allocate a new token */
396 static TokenSym *tok_alloc_new(TokenSym **pts, const char *str, int len)
397 {
398 TokenSym *ts, **ptable;
399 int i;
400
401 if (tok_ident >= SYM_FIRST_ANOM)
402 tcc_error("memory full (symbols)");
403
404 /* expand token table if needed */
405 i = tok_ident - TOK_IDENT;
406 if ((i % TOK_ALLOC_INCR) == 0) {
407 ptable = tcc_realloc(table_ident, (i + TOK_ALLOC_INCR) * sizeof(TokenSym *));
408 table_ident = ptable;
409 }
410
411 ts = tal_realloc(toksym_alloc, 0, sizeof(TokenSym) + len);
412 table_ident[i] = ts;
413 ts->tok = tok_ident++;
414 ts->sym_define = NULL;
415 ts->sym_label = NULL;
416 ts->sym_struct = NULL;
417 ts->sym_identifier = NULL;
418 ts->len = len;
419 ts->hash_next = NULL;
420 memcpy(ts->str, str, len);
421 ts->str[len] = '\0';
422 *pts = ts;
423 return ts;
424 }
425
426 #define TOK_HASH_INIT 1
427 #define TOK_HASH_FUNC(h, c) ((h) + ((h) << 5) + ((h) >> 27) + (c))
428
429
430 /* find a token and add it if not found */
431 ST_FUNC TokenSym *tok_alloc(const char *str, int len)
432 {
433 TokenSym *ts, **pts;
434 int i;
435 unsigned int h;
436
437 h = TOK_HASH_INIT;
438 for(i=0;i<len;i++)
439 h = TOK_HASH_FUNC(h, ((unsigned char *)str)[i]);
440 h &= (TOK_HASH_SIZE - 1);
441
442 pts = &hash_ident[h];
443 for(;;) {
444 ts = *pts;
445 if (!ts)
446 break;
447 if (ts->len == len && !memcmp(ts->str, str, len))
448 return ts;
449 pts = &(ts->hash_next);
450 }
451 return tok_alloc_new(pts, str, len);
452 }
453
454 /* XXX: buffer overflow */
455 /* XXX: float tokens */
456 ST_FUNC const char *get_tok_str(int v, CValue *cv)
457 {
458 char *p;
459 int i, len;
460
461 cstr_reset(&cstr_buf);
462 p = cstr_buf.data;
463
464 switch(v) {
465 case TOK_CINT:
466 case TOK_CUINT:
467 case TOK_CLLONG:
468 case TOK_CULLONG:
469 /* XXX: not quite exact, but only useful for testing */
470 #ifdef _WIN32
471 sprintf(p, "%u", (unsigned)cv->i);
472 #else
473 sprintf(p, "%llu", (unsigned long long)cv->i);
474 #endif
475 break;
476 case TOK_LCHAR:
477 cstr_ccat(&cstr_buf, 'L');
478 case TOK_CCHAR:
479 cstr_ccat(&cstr_buf, '\'');
480 add_char(&cstr_buf, cv->i);
481 cstr_ccat(&cstr_buf, '\'');
482 cstr_ccat(&cstr_buf, '\0');
483 break;
484 case TOK_PPNUM:
485 case TOK_PPSTR:
486 return (char*)cv->str.data;
487 case TOK_LSTR:
488 cstr_ccat(&cstr_buf, 'L');
489 case TOK_STR:
490 cstr_ccat(&cstr_buf, '\"');
491 if (v == TOK_STR) {
492 len = cv->str.size - 1;
493 for(i=0;i<len;i++)
494 add_char(&cstr_buf, ((unsigned char *)cv->str.data)[i]);
495 } else {
496 len = (cv->str.size / sizeof(nwchar_t)) - 1;
497 for(i=0;i<len;i++)
498 add_char(&cstr_buf, ((nwchar_t *)cv->str.data)[i]);
499 }
500 cstr_ccat(&cstr_buf, '\"');
501 cstr_ccat(&cstr_buf, '\0');
502 break;
503
504 case TOK_CFLOAT:
505 cstr_cat(&cstr_buf, "<float>", 0);
506 break;
507 case TOK_CDOUBLE:
508 cstr_cat(&cstr_buf, "<double>", 0);
509 break;
510 case TOK_CLDOUBLE:
511 cstr_cat(&cstr_buf, "<long double>", 0);
512 break;
513 case TOK_LINENUM:
514 cstr_cat(&cstr_buf, "<linenumber>", 0);
515 break;
516
517 /* above tokens have value, the ones below don't */
518
519 case TOK_LT:
520 v = '<';
521 goto addv;
522 case TOK_GT:
523 v = '>';
524 goto addv;
525 case TOK_DOTS:
526 return strcpy(p, "...");
527 case TOK_A_SHL:
528 return strcpy(p, "<<=");
529 case TOK_A_SAR:
530 return strcpy(p, ">>=");
531 default:
532 if (v < TOK_IDENT) {
533 /* search in two bytes table */
534 const unsigned char *q = tok_two_chars;
535 while (*q) {
536 if (q[2] == v) {
537 *p++ = q[0];
538 *p++ = q[1];
539 *p = '\0';
540 return cstr_buf.data;
541 }
542 q += 3;
543 }
544 if (v >= 127) {
545 sprintf(cstr_buf.data, "<%02x>", v);
546 return cstr_buf.data;
547 }
548 addv:
549 *p++ = v;
550 *p = '\0';
551 } else if (v < tok_ident) {
552 return table_ident[v - TOK_IDENT]->str;
553 } else if (v >= SYM_FIRST_ANOM) {
554 /* special name for anonymous symbol */
555 sprintf(p, "L.%u", v - SYM_FIRST_ANOM);
556 } else {
557 /* should never happen */
558 return NULL;
559 }
560 break;
561 }
562 return cstr_buf.data;
563 }
564
565 /* return the current character, handling end of block if necessary
566 (but not stray) */
567 ST_FUNC int handle_eob(void)
568 {
569 BufferedFile *bf = file;
570 int len;
571
572 /* only tries to read if really end of buffer */
573 if (bf->buf_ptr >= bf->buf_end) {
574 if (bf->fd != -1) {
575 #if defined(PARSE_DEBUG)
576 len = 1;
577 #else
578 len = IO_BUF_SIZE;
579 #endif
580 len = read(bf->fd, bf->buffer, len);
581 if (len < 0)
582 len = 0;
583 } else {
584 len = 0;
585 }
586 total_bytes += len;
587 bf->buf_ptr = bf->buffer;
588 bf->buf_end = bf->buffer + len;
589 *bf->buf_end = CH_EOB;
590 }
591 if (bf->buf_ptr < bf->buf_end) {
592 return bf->buf_ptr[0];
593 } else {
594 bf->buf_ptr = bf->buf_end;
595 return CH_EOF;
596 }
597 }
598
599 /* read next char from current input file and handle end of input buffer */
600 ST_INLN void inp(void)
601 {
602 ch = *(++(file->buf_ptr));
603 /* end of buffer/file handling */
604 if (ch == CH_EOB)
605 ch = handle_eob();
606 }
607
608 /* handle '\[\r]\n' */
609 static int handle_stray_noerror(void)
610 {
611 while (ch == '\\') {
612 inp();
613 if (ch == '\n') {
614 file->line_num++;
615 inp();
616 } else if (ch == '\r') {
617 inp();
618 if (ch != '\n')
619 goto fail;
620 file->line_num++;
621 inp();
622 } else {
623 fail:
624 return 1;
625 }
626 }
627 return 0;
628 }
629
630 static void handle_stray(void)
631 {
632 if (handle_stray_noerror())
633 tcc_error("stray '\\' in program");
634 }
635
636 /* skip the stray and handle the \\n case. Output an error if
637 incorrect char after the stray */
638 static int handle_stray1(uint8_t *p)
639 {
640 int c;
641
642 file->buf_ptr = p;
643 if (p >= file->buf_end) {
644 c = handle_eob();
645 if (c != '\\')
646 return c;
647 p = file->buf_ptr;
648 }
649 ch = *p;
650 if (handle_stray_noerror()) {
651 if (!(parse_flags & PARSE_FLAG_ACCEPT_STRAYS))
652 tcc_error("stray '\\' in program");
653 *--file->buf_ptr = '\\';
654 }
655 p = file->buf_ptr;
656 c = *p;
657 return c;
658 }
659
660 /* handle just the EOB case, but not stray */
661 #define PEEKC_EOB(c, p)\
662 {\
663 p++;\
664 c = *p;\
665 if (c == '\\') {\
666 file->buf_ptr = p;\
667 c = handle_eob();\
668 p = file->buf_ptr;\
669 }\
670 }
671
672 /* handle the complicated stray case */
673 #define PEEKC(c, p)\
674 {\
675 p++;\
676 c = *p;\
677 if (c == '\\') {\
678 c = handle_stray1(p);\
679 p = file->buf_ptr;\
680 }\
681 }
682
683 /* input with '\[\r]\n' handling. Note that this function cannot
684 handle other characters after '\', so you cannot call it inside
685 strings or comments */
686 ST_FUNC void minp(void)
687 {
688 inp();
689 if (ch == '\\')
690 handle_stray();
691 }
692
693 /* single line C++ comments */
694 static uint8_t *parse_line_comment(uint8_t *p)
695 {
696 int c;
697
698 p++;
699 for(;;) {
700 c = *p;
701 redo:
702 if (c == '\n' || c == CH_EOF) {
703 break;
704 } else if (c == '\\') {
705 file->buf_ptr = p;
706 c = handle_eob();
707 p = file->buf_ptr;
708 if (c == '\\') {
709 PEEKC_EOB(c, p);
710 if (c == '\n') {
711 file->line_num++;
712 PEEKC_EOB(c, p);
713 } else if (c == '\r') {
714 PEEKC_EOB(c, p);
715 if (c == '\n') {
716 file->line_num++;
717 PEEKC_EOB(c, p);
718 }
719 }
720 } else {
721 goto redo;
722 }
723 } else {
724 p++;
725 }
726 }
727 return p;
728 }
729
730 /* C comments */
731 ST_FUNC uint8_t *parse_comment(uint8_t *p)
732 {
733 int c;
734
735 p++;
736 for(;;) {
737 /* fast skip loop */
738 for(;;) {
739 c = *p;
740 if (c == '\n' || c == '*' || c == '\\')
741 break;
742 p++;
743 c = *p;
744 if (c == '\n' || c == '*' || c == '\\')
745 break;
746 p++;
747 }
748 /* now we can handle all the cases */
749 if (c == '\n') {
750 file->line_num++;
751 p++;
752 } else if (c == '*') {
753 p++;
754 for(;;) {
755 c = *p;
756 if (c == '*') {
757 p++;
758 } else if (c == '/') {
759 goto end_of_comment;
760 } else if (c == '\\') {
761 file->buf_ptr = p;
762 c = handle_eob();
763 p = file->buf_ptr;
764 if (c == CH_EOF)
765 tcc_error("unexpected end of file in comment");
766 if (c == '\\') {
767 /* skip '\[\r]\n', otherwise just skip the stray */
768 while (c == '\\') {
769 PEEKC_EOB(c, p);
770 if (c == '\n') {
771 file->line_num++;
772 PEEKC_EOB(c, p);
773 } else if (c == '\r') {
774 PEEKC_EOB(c, p);
775 if (c == '\n') {
776 file->line_num++;
777 PEEKC_EOB(c, p);
778 }
779 } else {
780 goto after_star;
781 }
782 }
783 }
784 } else {
785 break;
786 }
787 }
788 after_star: ;
789 } else {
790 /* stray, eob or eof */
791 file->buf_ptr = p;
792 c = handle_eob();
793 p = file->buf_ptr;
794 if (c == CH_EOF) {
795 tcc_error("unexpected end of file in comment");
796 } else if (c == '\\') {
797 p++;
798 }
799 }
800 }
801 end_of_comment:
802 p++;
803 return p;
804 }
805
806 #define cinp minp
807
808 static inline void skip_spaces(void)
809 {
810 while (isidnum_table[ch - CH_EOF] & IS_SPC)
811 cinp();
812 }
813
814 static inline int check_space(int t, int *spc)
815 {
816 if (t < 256 && (isidnum_table[t - CH_EOF] & IS_SPC)) {
817 if (*spc)
818 return 1;
819 *spc = 1;
820 } else
821 *spc = 0;
822 return 0;
823 }
824
825 /* parse a string without interpreting escapes */
826 static uint8_t *parse_pp_string(uint8_t *p,
827 int sep, CString *str)
828 {
829 int c;
830 p++;
831 for(;;) {
832 c = *p;
833 if (c == sep) {
834 break;
835 } else if (c == '\\') {
836 file->buf_ptr = p;
837 c = handle_eob();
838 p = file->buf_ptr;
839 if (c == CH_EOF) {
840 unterminated_string:
841 /* XXX: indicate line number of start of string */
842 tcc_error("missing terminating %c character", sep);
843 } else if (c == '\\') {
844 /* escape : just skip \[\r]\n */
845 PEEKC_EOB(c, p);
846 if (c == '\n') {
847 file->line_num++;
848 p++;
849 } else if (c == '\r') {
850 PEEKC_EOB(c, p);
851 if (c != '\n')
852 expect("'\n' after '\r'");
853 file->line_num++;
854 p++;
855 } else if (c == CH_EOF) {
856 goto unterminated_string;
857 } else {
858 if (str) {
859 cstr_ccat(str, '\\');
860 cstr_ccat(str, c);
861 }
862 p++;
863 }
864 }
865 } else if (c == '\n') {
866 file->line_num++;
867 goto add_char;
868 } else if (c == '\r') {
869 PEEKC_EOB(c, p);
870 if (c != '\n') {
871 if (str)
872 cstr_ccat(str, '\r');
873 } else {
874 file->line_num++;
875 goto add_char;
876 }
877 } else {
878 add_char:
879 if (str)
880 cstr_ccat(str, c);
881 p++;
882 }
883 }
884 p++;
885 return p;
886 }
887
888 /* skip block of text until #else, #elif or #endif. skip also pairs of
889 #if/#endif */
890 static void preprocess_skip(void)
891 {
892 int a, start_of_line, c, in_warn_or_error;
893 uint8_t *p;
894
895 p = file->buf_ptr;
896 a = 0;
897 redo_start:
898 start_of_line = 1;
899 in_warn_or_error = 0;
900 for(;;) {
901 redo_no_start:
902 c = *p;
903 switch(c) {
904 case ' ':
905 case '\t':
906 case '\f':
907 case '\v':
908 case '\r':
909 p++;
910 goto redo_no_start;
911 case '\n':
912 file->line_num++;
913 p++;
914 goto redo_start;
915 case '\\':
916 file->buf_ptr = p;
917 c = handle_eob();
918 if (c == CH_EOF) {
919 expect("#endif");
920 } else if (c == '\\') {
921 ch = file->buf_ptr[0];
922 handle_stray_noerror();
923 }
924 p = file->buf_ptr;
925 goto redo_no_start;
926 /* skip strings */
927 case '\"':
928 case '\'':
929 if (in_warn_or_error)
930 goto _default;
931 p = parse_pp_string(p, c, NULL);
932 break;
933 /* skip comments */
934 case '/':
935 if (in_warn_or_error)
936 goto _default;
937 file->buf_ptr = p;
938 ch = *p;
939 minp();
940 p = file->buf_ptr;
941 if (ch == '*') {
942 p = parse_comment(p);
943 } else if (ch == '/') {
944 p = parse_line_comment(p);
945 }
946 break;
947 case '#':
948 p++;
949 if (start_of_line) {
950 file->buf_ptr = p;
951 next_nomacro();
952 p = file->buf_ptr;
953 if (a == 0 &&
954 (tok == TOK_ELSE || tok == TOK_ELIF || tok == TOK_ENDIF))
955 goto the_end;
956 if (tok == TOK_IF || tok == TOK_IFDEF || tok == TOK_IFNDEF)
957 a++;
958 else if (tok == TOK_ENDIF)
959 a--;
960 else if( tok == TOK_ERROR || tok == TOK_WARNING)
961 in_warn_or_error = 1;
962 else if (tok == TOK_LINEFEED)
963 goto redo_start;
964 else if (parse_flags & PARSE_FLAG_ASM_FILE)
965 p = parse_line_comment(p);
966 } else if (parse_flags & PARSE_FLAG_ASM_FILE)
967 p = parse_line_comment(p);
968 break;
969 _default:
970 default:
971 p++;
972 break;
973 }
974 start_of_line = 0;
975 }
976 the_end: ;
977 file->buf_ptr = p;
978 }
979
980 /* ParseState handling */
981
982 /* XXX: currently, no include file info is stored. Thus, we cannot display
983 accurate messages if the function or data definition spans multiple
984 files */
985
986 /* save current parse state in 's' */
987 ST_FUNC void save_parse_state(ParseState *s)
988 {
989 s->line_num = file->line_num;
990 s->macro_ptr = macro_ptr;
991 s->tok = tok;
992 s->tokc = tokc;
993 }
994
995 /* restore parse state from 's' */
996 ST_FUNC void restore_parse_state(ParseState *s)
997 {
998 file->line_num = s->line_num;
999 macro_ptr = s->macro_ptr;
1000 tok = s->tok;
1001 tokc = s->tokc;
1002 }
1003
1004 /* return the number of additional 'ints' necessary to store the
1005 token */
1006 static inline int tok_size(const int *p)
1007 {
1008 switch(*p) {
1009 /* 4 bytes */
1010 case TOK_CINT:
1011 case TOK_CUINT:
1012 case TOK_CCHAR:
1013 case TOK_LCHAR:
1014 case TOK_CFLOAT:
1015 case TOK_LINENUM:
1016 return 1 + 1;
1017 case TOK_STR:
1018 case TOK_LSTR:
1019 case TOK_PPNUM:
1020 case TOK_PPSTR:
1021 return 1 + ((sizeof(CString) + ((CString *)(p+1))->size + 3) >> 2);
1022 case TOK_CDOUBLE:
1023 case TOK_CLLONG:
1024 case TOK_CULLONG:
1025 return 1 + 2;
1026 case TOK_CLDOUBLE:
1027 return 1 + LDOUBLE_SIZE / 4;
1028 default:
1029 return 1 + 0;
1030 }
1031 }
1032
1033 /* token string handling */
1034
1035 ST_INLN void tok_str_new(TokenString *s)
1036 {
1037 s->str = NULL;
1038 s->len = 0;
1039 s->allocated_len = 0;
1040 s->last_line_num = -1;
1041 }
1042
1043 ST_FUNC int *tok_str_dup(TokenString *s)
1044 {
1045 int *str;
1046
1047 str = tal_realloc(tokstr_alloc, 0, s->len * sizeof(int));
1048 memcpy(str, s->str, s->len * sizeof(int));
1049 return str;
1050 }
1051
1052 ST_FUNC void tok_str_free(int *str)
1053 {
1054 tal_free(tokstr_alloc, str);
1055 }
1056
1057 ST_FUNC int *tok_str_realloc(TokenString *s, int new_size)
1058 {
1059 int *str, size;
1060
1061 size = s->allocated_len;
1062 if (size < 16)
1063 size = 16;
1064 while (size < new_size)
1065 size = size * 2;
1066 TCC_ASSERT((size & (size -1)) == 0);
1067 if (size > s->allocated_len) {
1068 str = tal_realloc(tokstr_alloc, s->str, size * sizeof(int));
1069 s->allocated_len = size;
1070 s->str = str;
1071 }
1072 return s->str;
1073 }
1074
1075 ST_FUNC void tok_str_add(TokenString *s, int t)
1076 {
1077 int len, *str;
1078
1079 len = s->len;
1080 str = s->str;
1081 if (len >= s->allocated_len)
1082 str = tok_str_realloc(s, len + 1);
1083 str[len++] = t;
1084 s->len = len;
1085 }
1086
1087 static void tok_str_add2(TokenString *s, int t, CValue *cv)
1088 {
1089 int len, *str;
1090
1091 len = s->len;
1092 str = s->str;
1093
1094 /* allocate space for worst case */
1095 if (len + TOK_MAX_SIZE >= s->allocated_len)
1096 str = tok_str_realloc(s, len + TOK_MAX_SIZE + 1);
1097 str[len++] = t;
1098 switch(t) {
1099 case TOK_CINT:
1100 case TOK_CUINT:
1101 case TOK_CCHAR:
1102 case TOK_LCHAR:
1103 case TOK_CFLOAT:
1104 case TOK_LINENUM:
1105 str[len++] = cv->tab[0];
1106 break;
1107 case TOK_PPNUM:
1108 case TOK_PPSTR:
1109 case TOK_STR:
1110 case TOK_LSTR:
1111 {
1112 /* Insert the string into the int array. */
1113 size_t nb_words =
1114 1 + (cv->str.size + sizeof(int) - 1) / sizeof(int);
1115 if (len + nb_words >= s->allocated_len)
1116 str = tok_str_realloc(s, len + nb_words + 1);
1117 str[len] = cv->str.size;
1118 memcpy(&str[len + 1], cv->str.data, cv->str.size);
1119 len += nb_words;
1120 }
1121 break;
1122 case TOK_CDOUBLE:
1123 case TOK_CLLONG:
1124 case TOK_CULLONG:
1125 #if LDOUBLE_SIZE == 8
1126 case TOK_CLDOUBLE:
1127 #endif
1128 str[len++] = cv->tab[0];
1129 str[len++] = cv->tab[1];
1130 break;
1131 #if LDOUBLE_SIZE == 12
1132 case TOK_CLDOUBLE:
1133 str[len++] = cv->tab[0];
1134 str[len++] = cv->tab[1];
1135 str[len++] = cv->tab[2];
1136 #elif LDOUBLE_SIZE == 16
1137 case TOK_CLDOUBLE:
1138 str[len++] = cv->tab[0];
1139 str[len++] = cv->tab[1];
1140 str[len++] = cv->tab[2];
1141 str[len++] = cv->tab[3];
1142 #elif LDOUBLE_SIZE != 8
1143 #error add long double size support
1144 #endif
1145 break;
1146 default:
1147 break;
1148 }
1149 s->len = len;
1150 }
1151
1152 /* add the current parse token in token string 's' */
1153 ST_FUNC void tok_str_add_tok(TokenString *s)
1154 {
1155 CValue cval;
1156
1157 /* save line number info */
1158 if (file->line_num != s->last_line_num) {
1159 s->last_line_num = file->line_num;
1160 cval.i = s->last_line_num;
1161 tok_str_add2(s, TOK_LINENUM, &cval);
1162 }
1163 tok_str_add2(s, tok, &tokc);
1164 }
1165
1166 /* get a token from an integer array and increment pointer
1167 accordingly. we code it as a macro to avoid pointer aliasing. */
1168 static inline void TOK_GET(int *t, const int **pp, CValue *cv)
1169 {
1170 const int *p = *pp;
1171 int n, *tab;
1172
1173 tab = cv->tab;
1174 switch(*t = *p++) {
1175 case TOK_CINT:
1176 case TOK_CUINT:
1177 case TOK_CCHAR:
1178 case TOK_LCHAR:
1179 case TOK_CFLOAT:
1180 case TOK_LINENUM:
1181 tab[0] = *p++;
1182 break;
1183 case TOK_STR:
1184 case TOK_LSTR:
1185 case TOK_PPNUM:
1186 case TOK_PPSTR:
1187 cv->str.size = *p++;
1188 cv->str.data = p;
1189 cv->str.data_allocated = 0;
1190 p += (cv->str.size + sizeof(int) - 1) / sizeof(int);
1191 break;
1192 case TOK_CDOUBLE:
1193 case TOK_CLLONG:
1194 case TOK_CULLONG:
1195 n = 2;
1196 goto copy;
1197 case TOK_CLDOUBLE:
1198 #if LDOUBLE_SIZE == 16
1199 n = 4;
1200 #elif LDOUBLE_SIZE == 12
1201 n = 3;
1202 #elif LDOUBLE_SIZE == 8
1203 n = 2;
1204 #else
1205 # error add long double size support
1206 #endif
1207 copy:
1208 do
1209 *tab++ = *p++;
1210 while (--n);
1211 break;
1212 default:
1213 break;
1214 }
1215 *pp = p;
1216 }
1217
1218 /* Calling this function is expensive, but it is not possible
1219 to read a token string backwards. */
1220 static int tok_last(const int *str0, const int *str1)
1221 {
1222 const int *str = str0;
1223 int tok = 0;
1224 CValue cval;
1225
1226 while (str < str1)
1227 TOK_GET(&tok, &str, &cval);
1228 return tok;
1229 }
1230
1231 static int macro_is_equal(const int *a, const int *b)
1232 {
1233 CValue cv;
1234 int t;
1235
1236 if (!a || !b)
1237 return 1;
1238
1239 while (*a && *b) {
1240 /* first time preallocate static cstr_buf, next time only reset position to start */
1241 cstr_reset(&cstr_buf);
1242 TOK_GET(&t, &a, &cv);
1243 cstr_cat(&cstr_buf, get_tok_str(t, &cv), 0);
1244 TOK_GET(&t, &b, &cv);
1245 if (strcmp(cstr_buf.data, get_tok_str(t, &cv)))
1246 return 0;
1247 }
1248 return !(*a || *b);
1249 }
1250
1251 /* defines handling */
1252 ST_INLN void define_push(int v, int macro_type, TokenString *str, Sym *first_arg)
1253 {
1254 Sym *s, *o;
1255
1256 o = define_find(v);
1257 s = sym_push2(&define_stack, v, macro_type, 0);
1258 s->d = str ? tok_str_dup(str) : NULL;
1259 s->next = first_arg;
1260 table_ident[v - TOK_IDENT]->sym_define = s;
1261
1262 if (o && !macro_is_equal(o->d, s->d))
1263 tcc_warning("%s redefined", get_tok_str(v, NULL));
1264 }
1265
1266 /* undefined a define symbol. Its name is just set to zero */
1267 ST_FUNC void define_undef(Sym *s)
1268 {
1269 int v = s->v;
1270 if (v >= TOK_IDENT && v < tok_ident)
1271 table_ident[v - TOK_IDENT]->sym_define = NULL;
1272 }
1273
1274 ST_INLN Sym *define_find(int v)
1275 {
1276 v -= TOK_IDENT;
1277 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
1278 return NULL;
1279 return table_ident[v]->sym_define;
1280 }
1281
1282 /* free define stack until top reaches 'b' */
1283 ST_FUNC void free_defines(Sym *b)
1284 {
1285 Sym *top, *top1;
1286 int v;
1287
1288 top = define_stack;
1289 while (top != b) {
1290 top1 = top->prev;
1291 /* do not free args or predefined defines */
1292 if (top->d)
1293 tok_str_free(top->d);
1294 v = top->v;
1295 if (v >= TOK_IDENT && v < tok_ident)
1296 table_ident[v - TOK_IDENT]->sym_define = NULL;
1297 sym_free(top);
1298 top = top1;
1299 }
1300 define_stack = b;
1301 }
1302
1303 /* label lookup */
1304 ST_FUNC Sym *label_find(int v)
1305 {
1306 v -= TOK_IDENT;
1307 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
1308 return NULL;
1309 return table_ident[v]->sym_label;
1310 }
1311
1312 ST_FUNC Sym *label_push(Sym **ptop, int v, int flags)
1313 {
1314 Sym *s, **ps;
1315 s = sym_push2(ptop, v, 0, 0);
1316 s->r = flags;
1317 ps = &table_ident[v - TOK_IDENT]->sym_label;
1318 if (ptop == &global_label_stack) {
1319 /* modify the top most local identifier, so that
1320 sym_identifier will point to 's' when popped */
1321 while (*ps != NULL)
1322 ps = &(*ps)->prev_tok;
1323 }
1324 s->prev_tok = *ps;
1325 *ps = s;
1326 return s;
1327 }
1328
1329 /* pop labels until element last is reached. Look if any labels are
1330 undefined. Define symbols if '&&label' was used. */
1331 ST_FUNC void label_pop(Sym **ptop, Sym *slast)
1332 {
1333 Sym *s, *s1;
1334 for(s = *ptop; s != slast; s = s1) {
1335 s1 = s->prev;
1336 if (s->r == LABEL_DECLARED) {
1337 tcc_warning("label '%s' declared but not used", get_tok_str(s->v, NULL));
1338 } else if (s->r == LABEL_FORWARD) {
1339 tcc_error("label '%s' used but not defined",
1340 get_tok_str(s->v, NULL));
1341 } else {
1342 if (s->c) {
1343 /* define corresponding symbol. A size of
1344 1 is put. */
1345 put_extern_sym(s, cur_text_section, s->jnext, 1);
1346 }
1347 }
1348 /* remove label */
1349 table_ident[s->v - TOK_IDENT]->sym_label = s->prev_tok;
1350 sym_free(s);
1351 }
1352 *ptop = slast;
1353 }
1354
1355 /* eval an expression for #if/#elif */
1356 static int expr_preprocess(void)
1357 {
1358 int c, t;
1359 TokenString str;
1360
1361 tok_str_new(&str);
1362 while (tok != TOK_LINEFEED && tok != TOK_EOF) {
1363 next(); /* do macro subst */
1364 if (tok == TOK_DEFINED) {
1365 next_nomacro();
1366 t = tok;
1367 if (t == '(')
1368 next_nomacro();
1369 c = define_find(tok) != 0;
1370 if (t == '(')
1371 next_nomacro();
1372 tok = TOK_CINT;
1373 tokc.i = c;
1374 } else if (tok >= TOK_IDENT) {
1375 /* if undefined macro */
1376 tok = TOK_CINT;
1377 tokc.i = 0;
1378 }
1379 tok_str_add_tok(&str);
1380 }
1381 tok_str_add(&str, -1); /* simulate end of file */
1382 tok_str_add(&str, 0);
1383 /* now evaluate C constant expression */
1384 begin_macro(&str, 0);
1385 next();
1386 c = expr_const();
1387 end_macro();
1388 return c != 0;
1389 }
1390
1391
1392 /* parse after #define */
1393 ST_FUNC void parse_define(void)
1394 {
1395 Sym *s, *first, **ps;
1396 int v, t, varg, is_vaargs, spc;
1397 int saved_parse_flags = parse_flags;
1398
1399 v = tok;
1400 if (v < TOK_IDENT)
1401 tcc_error("invalid macro name '%s'", get_tok_str(tok, &tokc));
1402 /* XXX: should check if same macro (ANSI) */
1403 first = NULL;
1404 t = MACRO_OBJ;
1405 /* '(' must be just after macro definition for MACRO_FUNC */
1406 parse_flags |= PARSE_FLAG_SPACES;
1407 next_nomacro_spc();
1408 if (tok == '(') {
1409 /* must be able to parse TOK_DOTS (in asm mode '.' can be part of identifier) */
1410 parse_flags &= ~PARSE_FLAG_ASM_FILE;
1411 isidnum_table['.' - CH_EOF] = 0;
1412 next_nomacro();
1413 ps = &first;
1414 if (tok != ')') for (;;) {
1415 varg = tok;
1416 next_nomacro();
1417 is_vaargs = 0;
1418 if (varg == TOK_DOTS) {
1419 varg = TOK___VA_ARGS__;
1420 is_vaargs = 1;
1421 } else if (tok == TOK_DOTS && gnu_ext) {
1422 is_vaargs = 1;
1423 next_nomacro();
1424 }
1425 if (varg < TOK_IDENT)
1426 bad_list:
1427 tcc_error("bad macro parameter list");
1428 s = sym_push2(&define_stack, varg | SYM_FIELD, is_vaargs, 0);
1429 *ps = s;
1430 ps = &s->next;
1431 if (tok == ')')
1432 break;
1433 if (tok != ',' || is_vaargs)
1434 goto bad_list;
1435 next_nomacro();
1436 }
1437 next_nomacro_spc();
1438 t = MACRO_FUNC;
1439 parse_flags |= (saved_parse_flags & PARSE_FLAG_ASM_FILE);
1440 isidnum_table['.' - CH_EOF] =
1441 (parse_flags & PARSE_FLAG_ASM_FILE) ? IS_ID : 0;
1442 }
1443
1444 tokstr_buf.len = 0;
1445 spc = 2;
1446 parse_flags |= PARSE_FLAG_ACCEPT_STRAYS | PARSE_FLAG_SPACES | PARSE_FLAG_LINEFEED;
1447 while (tok != TOK_LINEFEED && tok != TOK_EOF) {
1448 /* remove spaces around ## and after '#' */
1449 if (TOK_TWOSHARPS == tok) {
1450 if (2 == spc)
1451 goto bad_twosharp;
1452 if (1 == spc)
1453 --tokstr_buf.len;
1454 spc = 3;
1455 } else if ('#' == tok) {
1456 spc = 4;
1457 } else if (check_space(tok, &spc)) {
1458 goto skip;
1459 }
1460 tok_str_add2(&tokstr_buf, tok, &tokc);
1461 skip:
1462 next_nomacro_spc();
1463 }
1464
1465 parse_flags = saved_parse_flags;
1466 if (spc == 1)
1467 --tokstr_buf.len; /* remove trailing space */
1468 tok_str_add(&tokstr_buf, 0);
1469 if (3 == spc)
1470 bad_twosharp:
1471 tcc_error("'##' cannot appear at either end of macro");
1472 define_push(v, t, &tokstr_buf, first);
1473 }
1474
1475 static inline int hash_cached_include(const char *filename)
1476 {
1477 const unsigned char *s;
1478 unsigned int h;
1479
1480 h = TOK_HASH_INIT;
1481 s = (unsigned char *) filename;
1482 while (*s) {
1483 h = TOK_HASH_FUNC(h, *s);
1484 s++;
1485 }
1486 h &= (CACHED_INCLUDES_HASH_SIZE - 1);
1487 return h;
1488 }
1489
1490 static CachedInclude *search_cached_include(TCCState *s1, const char *filename)
1491 {
1492 CachedInclude *e;
1493 int i, h;
1494 h = hash_cached_include(filename);
1495 i = s1->cached_includes_hash[h];
1496 for(;;) {
1497 if (i == 0)
1498 break;
1499 e = s1->cached_includes[i - 1];
1500 if (0 == PATHCMP(e->filename, filename))
1501 return e;
1502 i = e->hash_next;
1503 }
1504 return NULL;
1505 }
1506
1507 static inline void add_cached_include(TCCState *s1, const char *filename, int ifndef_macro)
1508 {
1509 CachedInclude *e;
1510 int h;
1511
1512 if (search_cached_include(s1, filename))
1513 return;
1514 #ifdef INC_DEBUG
1515 printf("adding cached '%s' %s\n", filename, get_tok_str(ifndef_macro, NULL));
1516 #endif
1517 e = tcc_malloc(sizeof(CachedInclude) + strlen(filename));
1518 strcpy(e->filename, filename);
1519 e->ifndef_macro = ifndef_macro;
1520 dynarray_add((void ***)&s1->cached_includes, &s1->nb_cached_includes, e);
1521 /* add in hash table */
1522 h = hash_cached_include(filename);
1523 e->hash_next = s1->cached_includes_hash[h];
1524 s1->cached_includes_hash[h] = s1->nb_cached_includes;
1525 }
1526
1527 #define ONCE_PREFIX "#ONCE#"
1528
1529 static void pragma_parse(TCCState *s1)
1530 {
1531 next_nomacro();
1532 if (tok == TOK_push_macro || tok == TOK_pop_macro) {
1533 int t = tok, v;
1534 Sym *s;
1535
1536 if (next(), tok != '(')
1537 goto pragma_err;
1538 if (next(), tok != TOK_STR)
1539 goto pragma_err;
1540 v = tok_alloc(tokc.str.data, tokc.str.size - 1)->tok;
1541 if (next(), tok != ')')
1542 goto pragma_err;
1543 if (t == TOK_push_macro) {
1544 while (NULL == (s = define_find(v)))
1545 define_push(v, 0, NULL, NULL);
1546 s->type.ref = s; /* set push boundary */
1547 } else {
1548 for (s = define_stack; s; s = s->prev)
1549 if (s->v == v && s->type.ref == s) {
1550 s->type.ref = NULL;
1551 break;
1552 }
1553 }
1554 if (s)
1555 table_ident[v - TOK_IDENT]->sym_define = s->d ? s : NULL;
1556 else
1557 tcc_warning("unbalanced #pragma pop_macro");
1558 pp_debug_tok = t, pp_debug_symv = v;
1559
1560 } else if (tok == TOK_once) {
1561 char buf1[sizeof(file->filename) + sizeof(ONCE_PREFIX)];
1562 strcpy(buf1, ONCE_PREFIX);
1563 strcat(buf1, file->filename);
1564 #ifdef PATH_NOCASE
1565 strupr(buf1);
1566 #endif
1567 add_cached_include(s1, file->filename, tok_alloc(buf1, strlen(buf1))->tok);
1568 } else if (s1->ppfp) {
1569 /* tcc -E: keep pragmas below unchanged */
1570 unget_tok(' ');
1571 unget_tok(TOK_PRAGMA);
1572 unget_tok('#');
1573 unget_tok(TOK_LINEFEED);
1574
1575 } else if (tok == TOK_pack) {
1576 /* This may be:
1577 #pragma pack(1) // set
1578 #pragma pack() // reset to default
1579 #pragma pack(push,1) // push & set
1580 #pragma pack(pop) // restore previous */
1581 next();
1582 skip('(');
1583 if (tok == TOK_ASM_pop) {
1584 next();
1585 if (s1->pack_stack_ptr <= s1->pack_stack) {
1586 stk_error:
1587 tcc_error("out of pack stack");
1588 }
1589 s1->pack_stack_ptr--;
1590 } else {
1591 int val = 0;
1592 if (tok != ')') {
1593 if (tok == TOK_ASM_push) {
1594 next();
1595 if (s1->pack_stack_ptr >= s1->pack_stack + PACK_STACK_SIZE - 1)
1596 goto stk_error;
1597 s1->pack_stack_ptr++;
1598 skip(',');
1599 }
1600 if (tok != TOK_CINT)
1601 goto pragma_err;
1602 val = tokc.i;
1603 if (val < 1 || val > 16 || (val & (val - 1)) != 0)
1604 goto pragma_err;
1605 next();
1606 }
1607 *s1->pack_stack_ptr = val;
1608 }
1609 if (tok != ')')
1610 goto pragma_err;
1611
1612 } else if (tok == TOK_comment) {
1613 char *file;
1614 next();
1615 skip('(');
1616 if (tok != TOK_lib)
1617 goto pragma_warn;
1618 next();
1619 skip(',');
1620 if (tok != TOK_STR)
1621 goto pragma_err;
1622 file = tcc_strdup((char *)tokc.str.data);
1623 dynarray_add((void ***)&s1->pragma_libs, &s1->nb_pragma_libs, file);
1624 next();
1625 if (tok != ')')
1626 goto pragma_err;
1627 } else {
1628 pragma_warn:
1629 if (s1->warn_unsupported)
1630 tcc_warning("#pragma %s is ignored", get_tok_str(tok, &tokc));
1631 }
1632 return;
1633
1634 pragma_err:
1635 tcc_error("malformed #pragma directive");
1636 return;
1637 }
1638
1639 /* is_bof is true if first non space token at beginning of file */
1640 ST_FUNC void preprocess(int is_bof)
1641 {
1642 TCCState *s1 = tcc_state;
1643 int i, c, n, saved_parse_flags;
1644 char buf[1024], *q;
1645 Sym *s;
1646
1647 saved_parse_flags = parse_flags;
1648 parse_flags = PARSE_FLAG_PREPROCESS
1649 | PARSE_FLAG_TOK_NUM
1650 | PARSE_FLAG_TOK_STR
1651 | PARSE_FLAG_LINEFEED
1652 | (parse_flags & PARSE_FLAG_ASM_FILE)
1653 ;
1654
1655 next_nomacro();
1656 redo:
1657 switch(tok) {
1658 case TOK_DEFINE:
1659 pp_debug_tok = tok;
1660 next_nomacro();
1661 pp_debug_symv = tok;
1662 parse_define();
1663 break;
1664 case TOK_UNDEF:
1665 pp_debug_tok = tok;
1666 next_nomacro();
1667 pp_debug_symv = tok;
1668 s = define_find(tok);
1669 /* undefine symbol by putting an invalid name */
1670 if (s)
1671 define_undef(s);
1672 break;
1673 case TOK_INCLUDE:
1674 case TOK_INCLUDE_NEXT:
1675 ch = file->buf_ptr[0];
1676 /* XXX: incorrect if comments : use next_nomacro with a special mode */
1677 skip_spaces();
1678 if (ch == '<') {
1679 c = '>';
1680 goto read_name;
1681 } else if (ch == '\"') {
1682 c = ch;
1683 read_name:
1684 inp();
1685 q = buf;
1686 while (ch != c && ch != '\n' && ch != CH_EOF) {
1687 if ((q - buf) < sizeof(buf) - 1)
1688 *q++ = ch;
1689 if (ch == '\\') {
1690 if (handle_stray_noerror() == 0)
1691 --q;
1692 } else
1693 inp();
1694 }
1695 *q = '\0';
1696 minp();
1697 #if 0
1698 /* eat all spaces and comments after include */
1699 /* XXX: slightly incorrect */
1700 while (ch1 != '\n' && ch1 != CH_EOF)
1701 inp();
1702 #endif
1703 } else {
1704 /* computed #include : either we have only strings or
1705 we have anything enclosed in '<>' */
1706 next();
1707 buf[0] = '\0';
1708 if (tok == TOK_STR) {
1709 while (tok != TOK_LINEFEED) {
1710 if (tok != TOK_STR) {
1711 include_syntax:
1712 tcc_error("'#include' expects \"FILENAME\" or <FILENAME>");
1713 }
1714 pstrcat(buf, sizeof(buf), (char *)tokc.str.data);
1715 next();
1716 }
1717 c = '\"';
1718 } else {
1719 int len;
1720 while (tok != TOK_LINEFEED) {
1721 pstrcat(buf, sizeof(buf), get_tok_str(tok, &tokc));
1722 next();
1723 }
1724 len = strlen(buf);
1725 /* check syntax and remove '<>' */
1726 if (len < 2 || buf[0] != '<' || buf[len - 1] != '>')
1727 goto include_syntax;
1728 memmove(buf, buf + 1, len - 2);
1729 buf[len - 2] = '\0';
1730 c = '>';
1731 }
1732 }
1733
1734 if (s1->include_stack_ptr >= s1->include_stack + INCLUDE_STACK_SIZE)
1735 tcc_error("#include recursion too deep");
1736 /* store current file in stack, but increment stack later below */
1737 *s1->include_stack_ptr = file;
1738 i = tok == TOK_INCLUDE_NEXT ? file->include_next_index : 0;
1739 n = 2 + s1->nb_include_paths + s1->nb_sysinclude_paths;
1740 for (; i < n; ++i) {
1741 char buf1[sizeof file->filename];
1742 CachedInclude *e;
1743 const char *path;
1744
1745 if (i == 0) {
1746 /* check absolute include path */
1747 if (!IS_ABSPATH(buf))
1748 continue;
1749 buf1[0] = 0;
1750
1751 } else if (i == 1) {
1752 /* search in current dir if "header.h" */
1753 if (c != '\"')
1754 continue;
1755 path = file->filename;
1756 pstrncpy(buf1, path, tcc_basename(path) - path);
1757
1758 } else {
1759 /* search in all the include paths */
1760 int j = i - 2, k = j - s1->nb_include_paths;
1761 path = k < 0 ? s1->include_paths[j] : s1->sysinclude_paths[k];
1762 if (path == 0) continue;
1763 pstrcpy(buf1, sizeof(buf1), path);
1764 pstrcat(buf1, sizeof(buf1), "/");
1765 }
1766
1767 pstrcat(buf1, sizeof(buf1), buf);
1768 e = search_cached_include(s1, buf1);
1769 if (e && define_find(e->ifndef_macro)) {
1770 /* no need to parse the include because the 'ifndef macro'
1771 is defined */
1772 #ifdef INC_DEBUG
1773 printf("%s: skipping cached %s\n", file->filename, buf1);
1774 #endif
1775 goto include_done;
1776 }
1777
1778 if (tcc_open(s1, buf1) < 0)
1779 continue;
1780
1781 file->include_next_index = i + 1;
1782 #ifdef INC_DEBUG
1783 printf("%s: including %s\n", file->prev->filename, file->filename);
1784 #endif
1785 /* update target deps */
1786 dynarray_add((void ***)&s1->target_deps, &s1->nb_target_deps,
1787 tcc_strdup(buf1));
1788 /* push current file in stack */
1789 ++s1->include_stack_ptr;
1790 /* add include file debug info */
1791 if (s1->do_debug)
1792 put_stabs(file->filename, N_BINCL, 0, 0, 0);
1793 tok_flags |= TOK_FLAG_BOF | TOK_FLAG_BOL;
1794 ch = file->buf_ptr[0];
1795 goto the_end;
1796 }
1797 tcc_error("include file '%s' not found", buf);
1798 include_done:
1799 break;
1800 case TOK_IFNDEF:
1801 c = 1;
1802 goto do_ifdef;
1803 case TOK_IF:
1804 c = expr_preprocess();
1805 goto do_if;
1806 case TOK_IFDEF:
1807 c = 0;
1808 do_ifdef:
1809 next_nomacro();
1810 if (tok < TOK_IDENT)
1811 tcc_error("invalid argument for '#if%sdef'", c ? "n" : "");
1812 if (is_bof) {
1813 if (c) {
1814 #ifdef INC_DEBUG
1815 printf("#ifndef %s\n", get_tok_str(tok, NULL));
1816 #endif
1817 file->ifndef_macro = tok;
1818 }
1819 }
1820 c = (define_find(tok) != 0) ^ c;
1821 do_if:
1822 if (s1->ifdef_stack_ptr >= s1->ifdef_stack + IFDEF_STACK_SIZE)
1823 tcc_error("memory full (ifdef)");
1824 *s1->ifdef_stack_ptr++ = c;
1825 goto test_skip;
1826 case TOK_ELSE:
1827 if (s1->ifdef_stack_ptr == s1->ifdef_stack)
1828 tcc_error("#else without matching #if");
1829 if (s1->ifdef_stack_ptr[-1] & 2)
1830 tcc_error("#else after #else");
1831 c = (s1->ifdef_stack_ptr[-1] ^= 3);
1832 goto test_else;
1833 case TOK_ELIF:
1834 if (s1->ifdef_stack_ptr == s1->ifdef_stack)
1835 tcc_error("#elif without matching #if");
1836 c = s1->ifdef_stack_ptr[-1];
1837 if (c > 1)
1838 tcc_error("#elif after #else");
1839 /* last #if/#elif expression was true: we skip */
1840 if (c == 1)
1841 goto skip;
1842 c = expr_preprocess();
1843 s1->ifdef_stack_ptr[-1] = c;
1844 test_else:
1845 if (s1->ifdef_stack_ptr == file->ifdef_stack_ptr + 1)
1846 file->ifndef_macro = 0;
1847 test_skip:
1848 if (!(c & 1)) {
1849 skip:
1850 preprocess_skip();
1851 is_bof = 0;
1852 goto redo;
1853 }
1854 break;
1855 case TOK_ENDIF:
1856 if (s1->ifdef_stack_ptr <= file->ifdef_stack_ptr)
1857 tcc_error("#endif without matching #if");
1858 s1->ifdef_stack_ptr--;
1859 /* '#ifndef macro' was at the start of file. Now we check if
1860 an '#endif' is exactly at the end of file */
1861 if (file->ifndef_macro &&
1862 s1->ifdef_stack_ptr == file->ifdef_stack_ptr) {
1863 file->ifndef_macro_saved = file->ifndef_macro;
1864 /* need to set to zero to avoid false matches if another
1865 #ifndef at middle of file */
1866 file->ifndef_macro = 0;
1867 while (tok != TOK_LINEFEED)
1868 next_nomacro();
1869 tok_flags |= TOK_FLAG_ENDIF;
1870 goto the_end;
1871 }
1872 break;
1873 case TOK_PPNUM:
1874 n = strtoul((char*)tokc.str.data, &q, 10);
1875 goto _line_num;
1876 case TOK_LINE:
1877 next();
1878 if (tok != TOK_CINT)
1879 _line_err:
1880 tcc_error("wrong #line format");
1881 n = tokc.i;
1882 _line_num:
1883 next();
1884 if (tok != TOK_LINEFEED) {
1885 if (tok == TOK_STR)
1886 pstrcpy(file->filename, sizeof(file->filename), (char *)tokc.str.data);
1887 else if (parse_flags & PARSE_FLAG_ASM_FILE)
1888 break;
1889 else
1890 goto _line_err;
1891 --n;
1892 }
1893 if (file->fd > 0)
1894 total_lines += file->line_num - n;
1895 file->line_num = n;
1896 if (s1->do_debug)
1897 put_stabs(file->filename, N_BINCL, 0, 0, 0);
1898 break;
1899 case TOK_ERROR:
1900 case TOK_WARNING:
1901 c = tok;
1902 ch = file->buf_ptr[0];
1903 skip_spaces();
1904 q = buf;
1905 while (ch != '\n' && ch != CH_EOF) {
1906 if ((q - buf) < sizeof(buf) - 1)
1907 *q++ = ch;
1908 if (ch == '\\') {
1909 if (handle_stray_noerror() == 0)
1910 --q;
1911 } else
1912 inp();
1913 }
1914 *q = '\0';
1915 if (c == TOK_ERROR)
1916 tcc_error("#error %s", buf);
1917 else
1918 tcc_warning("#warning %s", buf);
1919 break;
1920 case TOK_PRAGMA:
1921 pragma_parse(s1);
1922 break;
1923 case TOK_LINEFEED:
1924 goto the_end;
1925 default:
1926 /* ignore gas line comment in an 'S' file. */
1927 if (saved_parse_flags & PARSE_FLAG_ASM_FILE)
1928 goto ignore;
1929 if (tok == '!' && is_bof)
1930 /* '!' is ignored at beginning to allow C scripts. */
1931 goto ignore;
1932 tcc_warning("Ignoring unknown preprocessing directive #%s", get_tok_str(tok, &tokc));
1933 ignore:
1934 file->buf_ptr = parse_line_comment(file->buf_ptr);
1935 goto the_end;
1936 }
1937 /* ignore other preprocess commands or #! for C scripts */
1938 while (tok != TOK_LINEFEED)
1939 next_nomacro();
1940 the_end:
1941 parse_flags = saved_parse_flags;
1942 }
1943
1944 /* evaluate escape codes in a string. */
1945 static void parse_escape_string(CString *outstr, const uint8_t *buf, int is_long)
1946 {
1947 int c, n;
1948 const uint8_t *p;
1949
1950 p = buf;
1951 for(;;) {
1952 c = *p;
1953 if (c == '\0')
1954 break;
1955 if (c == '\\') {
1956 p++;
1957 /* escape */
1958 c = *p;
1959 switch(c) {
1960 case '0': case '1': case '2': case '3':
1961 case '4': case '5': case '6': case '7':
1962 /* at most three octal digits */
1963 n = c - '0';
1964 p++;
1965 c = *p;
1966 if (isoct(c)) {
1967 n = n * 8 + c - '0';
1968 p++;
1969 c = *p;
1970 if (isoct(c)) {
1971 n = n * 8 + c - '0';
1972 p++;
1973 }
1974 }
1975 c = n;
1976 goto add_char_nonext;
1977 case 'x':
1978 case 'u':
1979 case 'U':
1980 p++;
1981 n = 0;
1982 for(;;) {
1983 c = *p;
1984 if (c >= 'a' && c <= 'f')
1985 c = c - 'a' + 10;
1986 else if (c >= 'A' && c <= 'F')
1987 c = c - 'A' + 10;
1988 else if (isnum(c))
1989 c = c - '0';
1990 else
1991 break;
1992 n = n * 16 + c;
1993 p++;
1994 }
1995 c = n;
1996 goto add_char_nonext;
1997 case 'a':
1998 c = '\a';
1999 break;
2000 case 'b':
2001 c = '\b';
2002 break;
2003 case 'f':
2004 c = '\f';
2005 break;
2006 case 'n':
2007 c = '\n';
2008 break;
2009 case 'r':
2010 c = '\r';
2011 break;
2012 case 't':
2013 c = '\t';
2014 break;
2015 case 'v':
2016 c = '\v';
2017 break;
2018 case 'e':
2019 if (!gnu_ext)
2020 goto invalid_escape;
2021 c = 27;
2022 break;
2023 case '\'':
2024 case '\"':
2025 case '\\':
2026 case '?':
2027 break;
2028 default:
2029 invalid_escape:
2030 if (c >= '!' && c <= '~')
2031 tcc_warning("unknown escape sequence: \'\\%c\'", c);
2032 else
2033 tcc_warning("unknown escape sequence: \'\\x%x\'", c);
2034 break;
2035 }
2036 }
2037 p++;
2038 add_char_nonext:
2039 if (!is_long)
2040 cstr_ccat(outstr, c);
2041 else
2042 cstr_wccat(outstr, c);
2043 }
2044 /* add a trailing '\0' */
2045 if (!is_long)
2046 cstr_ccat(outstr, '\0');
2047 else
2048 cstr_wccat(outstr, '\0');
2049 }
2050
2051 static void parse_string(const char *s, int len)
2052 {
2053 uint8_t buf[1000], *p = buf;
2054 int is_long, sep;
2055
2056 if ((is_long = *s == 'L'))
2057 ++s, --len;
2058 sep = *s++;
2059 len -= 2;
2060 if (len >= sizeof buf)
2061 p = tcc_malloc(len + 1);
2062 memcpy(p, s, len);
2063 p[len] = 0;
2064
2065 cstr_reset(&tokcstr);
2066 parse_escape_string(&tokcstr, p, is_long);
2067 if (p != buf)
2068 tcc_free(p);
2069
2070 if (sep == '\'') {
2071 int char_size;
2072 /* XXX: make it portable */
2073 if (!is_long)
2074 char_size = 1;
2075 else
2076 char_size = sizeof(nwchar_t);
2077 if (tokcstr.size <= char_size)
2078 tcc_error("empty character constant");
2079 if (tokcstr.size > 2 * char_size)
2080 tcc_warning("multi-character character constant");
2081 if (!is_long) {
2082 tokc.i = *(int8_t *)tokcstr.data;
2083 tok = TOK_CCHAR;
2084 } else {
2085 tokc.i = *(nwchar_t *)tokcstr.data;
2086 tok = TOK_LCHAR;
2087 }
2088 } else {
2089 tokc.str.size = tokcstr.size;
2090 tokc.str.data = tokcstr.data;
2091 tokc.str.data_allocated = tokcstr.data_allocated;
2092 if (!is_long)
2093 tok = TOK_STR;
2094 else
2095 tok = TOK_LSTR;
2096 }
2097 }
2098
2099 /* we use 64 bit numbers */
2100 #define BN_SIZE 2
2101
2102 /* bn = (bn << shift) | or_val */
2103 static void bn_lshift(unsigned int *bn, int shift, int or_val)
2104 {
2105 int i;
2106 unsigned int v;
2107 for(i=0;i<BN_SIZE;i++) {
2108 v = bn[i];
2109 bn[i] = (v << shift) | or_val;
2110 or_val = v >> (32 - shift);
2111 }
2112 }
2113
2114 static void bn_zero(unsigned int *bn)
2115 {
2116 int i;
2117 for(i=0;i<BN_SIZE;i++) {
2118 bn[i] = 0;
2119 }
2120 }
2121
2122 /* parse number in null terminated string 'p' and return it in the
2123 current token */
2124 static void parse_number(const char *p)
2125 {
2126 int b, t, shift, frac_bits, s, exp_val, ch;
2127 char *q;
2128 unsigned int bn[BN_SIZE];
2129 double d;
2130
2131 /* number */
2132 q = token_buf;
2133 ch = *p++;
2134 t = ch;
2135 ch = *p++;
2136 *q++ = t;
2137 b = 10;
2138 if (t == '.') {
2139 goto float_frac_parse;
2140 } else if (t == '0') {
2141 if (ch == 'x' || ch == 'X') {
2142 q--;
2143 ch = *p++;
2144 b = 16;
2145 } else if (tcc_ext && (ch == 'b' || ch == 'B')) {
2146 q--;
2147 ch = *p++;
2148 b = 2;
2149 }
2150 }
2151 /* parse all digits. cannot check octal numbers at this stage
2152 because of floating point constants */
2153 while (1) {
2154 if (ch >= 'a' && ch <= 'f')
2155 t = ch - 'a' + 10;
2156 else if (ch >= 'A' && ch <= 'F')
2157 t = ch - 'A' + 10;
2158 else if (isnum(ch))
2159 t = ch - '0';
2160 else
2161 break;
2162 if (t >= b)
2163 break;
2164 if (q >= token_buf + STRING_MAX_SIZE) {
2165 num_too_long:
2166 tcc_error("number too long");
2167 }
2168 *q++ = ch;
2169 ch = *p++;
2170 }
2171 if (ch == '.' ||
2172 ((ch == 'e' || ch == 'E') && b == 10) ||
2173 ((ch == 'p' || ch == 'P') && (b == 16 || b == 2))) {
2174 if (b != 10) {
2175 /* NOTE: strtox should support that for hexa numbers, but
2176 non ISOC99 libcs do not support it, so we prefer to do
2177 it by hand */
2178 /* hexadecimal or binary floats */
2179 /* XXX: handle overflows */
2180 *q = '\0';
2181 if (b == 16)
2182 shift = 4;
2183 else
2184 shift = 1;
2185 bn_zero(bn);
2186 q = token_buf;
2187 while (1) {
2188 t = *q++;
2189 if (t == '\0') {
2190 break;
2191 } else if (t >= 'a') {
2192 t = t - 'a' + 10;
2193 } else if (t >= 'A') {
2194 t = t - 'A' + 10;
2195 } else {
2196 t = t - '0';
2197 }
2198 bn_lshift(bn, shift, t);
2199 }
2200 frac_bits = 0;
2201 if (ch == '.') {
2202 ch = *p++;
2203 while (1) {
2204 t = ch;
2205 if (t >= 'a' && t <= 'f') {
2206 t = t - 'a' + 10;
2207 } else if (t >= 'A' && t <= 'F') {
2208 t = t - 'A' + 10;
2209 } else if (t >= '0' && t <= '9') {
2210 t = t - '0';
2211 } else {
2212 break;
2213 }
2214 if (t >= b)
2215 tcc_error("invalid digit");
2216 bn_lshift(bn, shift, t);
2217 frac_bits += shift;
2218 ch = *p++;
2219 }
2220 }
2221 if (ch != 'p' && ch != 'P')
2222 expect("exponent");
2223 ch = *p++;
2224 s = 1;
2225 exp_val = 0;
2226 if (ch == '+') {
2227 ch = *p++;
2228 } else if (ch == '-') {
2229 s = -1;
2230 ch = *p++;
2231 }
2232 if (ch < '0' || ch > '9')
2233 expect("exponent digits");
2234 while (ch >= '0' && ch <= '9') {
2235 exp_val = exp_val * 10 + ch - '0';
2236 ch = *p++;
2237 }
2238 exp_val = exp_val * s;
2239
2240 /* now we can generate the number */
2241 /* XXX: should patch directly float number */
2242 d = (double)bn[1] * 4294967296.0 + (double)bn[0];
2243 d = ldexp(d, exp_val - frac_bits);
2244 t = toup(ch);
2245 if (t == 'F') {
2246 ch = *p++;
2247 tok = TOK_CFLOAT;
2248 /* float : should handle overflow */
2249 tokc.f = (float)d;
2250 } else if (t == 'L') {
2251 ch = *p++;
2252 #ifdef TCC_TARGET_PE
2253 tok = TOK_CDOUBLE;
2254 tokc.d = d;
2255 #else
2256 tok = TOK_CLDOUBLE;
2257 /* XXX: not large enough */
2258 tokc.ld = (long double)d;
2259 #endif
2260 } else {
2261 tok = TOK_CDOUBLE;
2262 tokc.d = d;
2263 }
2264 } else {
2265 /* decimal floats */
2266 if (ch == '.') {
2267 if (q >= token_buf + STRING_MAX_SIZE)
2268 goto num_too_long;
2269 *q++ = ch;
2270 ch = *p++;
2271 float_frac_parse:
2272 while (ch >= '0' && ch <= '9') {
2273 if (q >= token_buf + STRING_MAX_SIZE)
2274 goto num_too_long;
2275 *q++ = ch;
2276 ch = *p++;
2277 }
2278 }
2279 if (ch == 'e' || ch == 'E') {
2280 if (q >= token_buf + STRING_MAX_SIZE)
2281 goto num_too_long;
2282 *q++ = ch;
2283 ch = *p++;
2284 if (ch == '-' || ch == '+') {
2285 if (q >= token_buf + STRING_MAX_SIZE)
2286 goto num_too_long;
2287 *q++ = ch;
2288 ch = *p++;
2289 }
2290 if (ch < '0' || ch > '9')
2291 expect("exponent digits");
2292 while (ch >= '0' && ch <= '9') {
2293 if (q >= token_buf + STRING_MAX_SIZE)
2294 goto num_too_long;
2295 *q++ = ch;
2296 ch = *p++;
2297 }
2298 }
2299 *q = '\0';
2300 t = toup(ch);
2301 errno = 0;
2302 if (t == 'F') {
2303 ch = *p++;
2304 tok = TOK_CFLOAT;
2305 tokc.f = strtof(token_buf, NULL);
2306 } else if (t == 'L') {
2307 ch = *p++;
2308 #ifdef TCC_TARGET_PE
2309 tok = TOK_CDOUBLE;
2310 tokc.d = strtod(token_buf, NULL);
2311 #else
2312 tok = TOK_CLDOUBLE;
2313 tokc.ld = strtold(token_buf, NULL);
2314 #endif
2315 } else {
2316 tok = TOK_CDOUBLE;
2317 tokc.d = strtod(token_buf, NULL);
2318 }
2319 }
2320 } else {
2321 unsigned long long n, n1;
2322 int lcount, ucount, must_64bit;
2323 const char *p1;
2324
2325 /* integer number */
2326 *q = '\0';
2327 q = token_buf;
2328 if (b == 10 && *q == '0') {
2329 b = 8;
2330 q++;
2331 }
2332 n = 0;
2333 while(1) {
2334 t = *q++;
2335 /* no need for checks except for base 10 / 8 errors */
2336 if (t == '\0')
2337 break;
2338 else if (t >= 'a')
2339 t = t - 'a' + 10;
2340 else if (t >= 'A')
2341 t = t - 'A' + 10;
2342 else
2343 t = t - '0';
2344 if (t >= b)
2345 tcc_error("invalid digit");
2346 n1 = n;
2347 n = n * b + t;
2348 /* detect overflow */
2349 /* XXX: this test is not reliable */
2350 if (n < n1)
2351 tcc_error("integer constant overflow");
2352 }
2353
2354 /* Determine the characteristics (unsigned and/or 64bit) the type of
2355 the constant must have according to the constant suffix(es) */
2356 lcount = ucount = must_64bit = 0;
2357 p1 = p;
2358 for(;;) {
2359 t = toup(ch);
2360 if (t == 'L') {
2361 if (lcount >= 2)
2362 tcc_error("three 'l's in integer constant");
2363 if (lcount && *(p - 1) != ch)
2364 tcc_error("incorrect integer suffix: %s", p1);
2365 lcount++;
2366 #if !defined TCC_TARGET_X86_64 || defined TCC_TARGET_PE
2367 if (lcount == 2)
2368 #endif
2369 must_64bit = 1;
2370 ch = *p++;
2371 } else if (t == 'U') {
2372 if (ucount >= 1)
2373 tcc_error("two 'u's in integer constant");
2374 ucount++;
2375 ch = *p++;
2376 } else {
2377 break;
2378 }
2379 }
2380
2381 /* Whether 64 bits are needed to hold the constant's value */
2382 if (n & 0xffffffff00000000LL || must_64bit) {
2383 tok = TOK_CLLONG;
2384 n1 = n >> 32;
2385 } else {
2386 tok = TOK_CINT;
2387 n1 = n;
2388 }
2389
2390 /* Whether type must be unsigned to hold the constant's value */
2391 if (ucount || ((n1 >> 31) && (b != 10))) {
2392 if (tok == TOK_CLLONG)
2393 tok = TOK_CULLONG;
2394 else
2395 tok = TOK_CUINT;
2396 /* If decimal and no unsigned suffix, bump to 64 bits or throw error */
2397 } else if (n1 >> 31) {
2398 if (tok == TOK_CINT)
2399 tok = TOK_CLLONG;
2400 else
2401 tcc_error("integer constant overflow");
2402 }
2403
2404 tokc.i = n;
2405 }
2406 if (ch)
2407 tcc_error("invalid number\n");
2408 }
2409
2410
2411 #define PARSE2(c1, tok1, c2, tok2) \
2412 case c1: \
2413 PEEKC(c, p); \
2414 if (c == c2) { \
2415 p++; \
2416 tok = tok2; \
2417 } else { \
2418 tok = tok1; \
2419 } \
2420 break;
2421
2422 /* return next token without macro substitution */
2423 static inline void next_nomacro1(void)
2424 {
2425 int t, c, is_long, len;
2426 TokenSym *ts;
2427 uint8_t *p, *p1;
2428 unsigned int h;
2429
2430 p = file->buf_ptr;
2431 redo_no_start:
2432 c = *p;
2433 #if (__TINYC__ || __GNUC__)
2434 #else
2435 if (c & 0x80)
2436 goto parse_ident_fast;
2437 #endif
2438 switch(c) {
2439 case ' ':
2440 case '\t':
2441 tok = c;
2442 p++;
2443 if (parse_flags & PARSE_FLAG_SPACES)
2444 goto keep_tok_flags;
2445 while (isidnum_table[*p - CH_EOF] & IS_SPC)
2446 ++p;
2447 goto redo_no_start;
2448 case '\f':
2449 case '\v':
2450 case '\r':
2451 p++;
2452 goto redo_no_start;
2453 case '\\':
2454 /* first look if it is in fact an end of buffer */
2455 c = handle_stray1(p);
2456 p = file->buf_ptr;
2457 if (c == '\\')
2458 goto parse_simple;
2459 if (c != CH_EOF)
2460 goto redo_no_start;
2461 {
2462 TCCState *s1 = tcc_state;
2463 if ((parse_flags & PARSE_FLAG_LINEFEED)
2464 && !(tok_flags & TOK_FLAG_EOF)) {
2465 tok_flags |= TOK_FLAG_EOF;
2466 tok = TOK_LINEFEED;
2467 goto keep_tok_flags;
2468 } else if (!(parse_flags & PARSE_FLAG_PREPROCESS)) {
2469 tok = TOK_EOF;
2470 } else if (s1->ifdef_stack_ptr != file->ifdef_stack_ptr) {
2471 tcc_error("missing #endif");
2472 } else if (s1->include_stack_ptr == s1->include_stack) {
2473 /* no include left : end of file. */
2474 tok = TOK_EOF;
2475 } else {
2476 tok_flags &= ~TOK_FLAG_EOF;
2477 /* pop include file */
2478
2479 /* test if previous '#endif' was after a #ifdef at
2480 start of file */
2481 if (tok_flags & TOK_FLAG_ENDIF) {
2482 #ifdef INC_DEBUG
2483 printf("#endif %s\n", get_tok_str(file->ifndef_macro_saved, NULL));
2484 #endif
2485 add_cached_include(s1, file->filename, file->ifndef_macro_saved);
2486 tok_flags &= ~TOK_FLAG_ENDIF;
2487 }
2488
2489 /* add end of include file debug info */
2490 if (tcc_state->do_debug) {
2491 put_stabd(N_EINCL, 0, 0);
2492 }
2493 /* pop include stack */
2494 tcc_close();
2495 s1->include_stack_ptr--;
2496 p = file->buf_ptr;
2497 goto redo_no_start;
2498 }
2499 }
2500 break;
2501
2502 case '\n':
2503 file->line_num++;
2504 tok_flags |= TOK_FLAG_BOL;
2505 p++;
2506 maybe_newline:
2507 if (0 == (parse_flags & PARSE_FLAG_LINEFEED))
2508 goto redo_no_start;
2509 tok = TOK_LINEFEED;
2510 goto keep_tok_flags;
2511
2512 case '#':
2513 /* XXX: simplify */
2514 PEEKC(c, p);
2515 if ((tok_flags & TOK_FLAG_BOL) &&
2516 (parse_flags & PARSE_FLAG_PREPROCESS)) {
2517 file->buf_ptr = p;
2518 preprocess(tok_flags & TOK_FLAG_BOF);
2519 p = file->buf_ptr;
2520 goto maybe_newline;
2521 } else {
2522 if (c == '#') {
2523 p++;
2524 tok = TOK_TWOSHARPS;
2525 } else {
2526 if (parse_flags & PARSE_FLAG_ASM_FILE) {
2527 p = parse_line_comment(p - 1);
2528 goto redo_no_start;
2529 } else {
2530 tok = '#';
2531 }
2532 }
2533 }
2534 break;
2535
2536 /* dollar is allowed to start identifiers when not parsing asm */
2537 case '$':
2538 if (!(isidnum_table[c - CH_EOF] & IS_ID)
2539 || (parse_flags & PARSE_FLAG_ASM_FILE))
2540 goto parse_simple;
2541
2542 #if (__TINYC__ || __GNUC__)
2543 case 'a' ... 'z':
2544 case 'A' ... 'K':
2545 case 'M' ... 'Z':
2546 case '_':
2547 case 0x80 ... 0xFF:
2548 #else
2549 case 'a': case 'b': case 'c': case 'd':
2550 case 'e': case 'f': case 'g': case 'h':
2551 case 'i': case 'j': case 'k': case 'l':
2552 case 'm': case 'n': case 'o': case 'p':
2553 case 'q': case 'r': case 's': case 't':
2554 case 'u': case 'v': case 'w': case 'x':
2555 case 'y': case 'z':
2556 case 'A': case 'B': case 'C': case 'D':
2557 case 'E': case 'F': case 'G': case 'H':
2558 case 'I': case 'J': case 'K':
2559 case 'M': case 'N': case 'O': case 'P':
2560 case 'Q': case 'R': case 'S': case 'T':
2561 case 'U': case 'V': case 'W': case 'X':
2562 case 'Y': case 'Z':
2563 case '_':
2564 #endif
2565 parse_ident_fast:
2566 p1 = p;
2567 h = TOK_HASH_INIT;
2568 h = TOK_HASH_FUNC(h, c);
2569 while (c = *++p, isidnum_table[c - CH_EOF] & (IS_ID|IS_NUM))
2570 h = TOK_HASH_FUNC(h, c);
2571 len = p - p1;
2572 if (c != '\\') {
2573 TokenSym **pts;
2574
2575 /* fast case : no stray found, so we have the full token
2576 and we have already hashed it */
2577 h &= (TOK_HASH_SIZE - 1);
2578 pts = &hash_ident[h];
2579 for(;;) {
2580 ts = *pts;
2581 if (!ts)
2582 break;
2583 if (ts->len == len && !memcmp(ts->str, p1, len))
2584 goto token_found;
2585 pts = &(ts->hash_next);
2586 }
2587 ts = tok_alloc_new(pts, (char *) p1, len);
2588 token_found: ;
2589 } else {
2590 /* slower case */
2591 cstr_reset(&tokcstr);
2592 cstr_cat(&tokcstr, p1, len);
2593 p--;
2594 PEEKC(c, p);
2595 parse_ident_slow:
2596 while (isidnum_table[c - CH_EOF] & (IS_ID|IS_NUM))
2597 {
2598 cstr_ccat(&tokcstr, c);
2599 PEEKC(c, p);
2600 }
2601 ts = tok_alloc(tokcstr.data, tokcstr.size);
2602 }
2603 tok = ts->tok;
2604 break;
2605 case 'L':
2606 t = p[1];
2607 if (t != '\\' && t != '\'' && t != '\"') {
2608 /* fast case */
2609 goto parse_ident_fast;
2610 } else {
2611 PEEKC(c, p);
2612 if (c == '\'' || c == '\"') {
2613 is_long = 1;
2614 goto str_const;
2615 } else {
2616 cstr_reset(&tokcstr);
2617 cstr_ccat(&tokcstr, 'L');
2618 goto parse_ident_slow;
2619 }
2620 }
2621 break;
2622
2623 case '0': case '1': case '2': case '3':
2624 case '4': case '5': case '6': case '7':
2625 case '8': case '9':
2626 cstr_reset(&tokcstr);
2627 /* after the first digit, accept digits, alpha, '.' or sign if
2628 prefixed by 'eEpP' */
2629 parse_num:
2630 for(;;) {
2631 t = c;
2632 cstr_ccat(&tokcstr, c);
2633 PEEKC(c, p);
2634 if (!((isidnum_table[c - CH_EOF] & (IS_ID|IS_NUM))
2635 || c == '.'
2636 || ((c == '+' || c == '-')
2637 && (t == 'e' || t == 'E' || t == 'p' || t == 'P')
2638 && !(parse_flags & PARSE_FLAG_ASM_FILE)
2639 )))
2640 break;
2641 }
2642 /* We add a trailing '\0' to ease parsing */
2643 cstr_ccat(&tokcstr, '\0');
2644 tokc.str.size = tokcstr.size;
2645 tokc.str.data = tokcstr.data;
2646 tokc.str.data_allocated = tokcstr.data_allocated;
2647 tok = TOK_PPNUM;
2648 break;
2649
2650 case '.':
2651 /* special dot handling because it can also start a number */
2652 PEEKC(c, p);
2653 if (isnum(c)) {
2654 cstr_reset(&tokcstr);
2655 cstr_ccat(&tokcstr, '.');
2656 goto parse_num;
2657 } else if ((parse_flags & PARSE_FLAG_ASM_FILE)
2658 && (isidnum_table[c - CH_EOF] & (IS_ID|IS_NUM))) {
2659 *--p = c = '.';
2660 goto parse_ident_fast;
2661 } else if (c == '.') {
2662 PEEKC(c, p);
2663 if (c == '.') {
2664 p++;
2665 tok = TOK_DOTS;
2666 } else {
2667 *--p = '.'; /* may underflow into file->unget[] */
2668 tok = '.';
2669 }
2670 } else {
2671 tok = '.';
2672 }
2673 break;
2674 case '\'':
2675 case '\"':
2676 is_long = 0;
2677 str_const:
2678 cstr_reset(&tokcstr);
2679 if (is_long)
2680 cstr_ccat(&tokcstr, 'L');
2681 cstr_ccat(&tokcstr, c);
2682 p = parse_pp_string(p, c, &tokcstr);
2683 cstr_ccat(&tokcstr, c);
2684 cstr_ccat(&tokcstr, '\0');
2685 tokc.str.size = tokcstr.size;
2686 tokc.str.data = tokcstr.data;
2687 tokc.str.data_allocated = tokcstr.data_allocated;
2688 tok = TOK_PPSTR;
2689 break;
2690
2691 case '<':
2692 PEEKC(c, p);
2693 if (c == '=') {
2694 p++;
2695 tok = TOK_LE;
2696 } else if (c == '<') {
2697 PEEKC(c, p);
2698 if (c == '=') {
2699 p++;
2700 tok = TOK_A_SHL;
2701 } else {
2702 tok = TOK_SHL;
2703 }
2704 } else {
2705 tok = TOK_LT;
2706 }
2707 break;
2708 case '>':
2709 PEEKC(c, p);
2710 if (c == '=') {
2711 p++;
2712 tok = TOK_GE;
2713 } else if (c == '>') {
2714 PEEKC(c, p);
2715 if (c == '=') {
2716 p++;
2717 tok = TOK_A_SAR;
2718 } else {
2719 tok = TOK_SAR;
2720 }
2721 } else {
2722 tok = TOK_GT;
2723 }
2724 break;
2725
2726 case '&':
2727 PEEKC(c, p);
2728 if (c == '&') {
2729 p++;
2730 tok = TOK_LAND;
2731 } else if (c == '=') {
2732 p++;
2733 tok = TOK_A_AND;
2734 } else {
2735 tok = '&';
2736 }
2737 break;
2738
2739 case '|':
2740 PEEKC(c, p);
2741 if (c == '|') {
2742 p++;
2743 tok = TOK_LOR;
2744 } else if (c == '=') {
2745 p++;
2746 tok = TOK_A_OR;
2747 } else {
2748 tok = '|';
2749 }
2750 break;
2751
2752 case '+':
2753 PEEKC(c, p);
2754 if (c == '+') {
2755 p++;
2756 tok = TOK_INC;
2757 } else if (c == '=') {
2758 p++;
2759 tok = TOK_A_ADD;
2760 } else {
2761 tok = '+';
2762 }
2763 break;
2764
2765 case '-':
2766 PEEKC(c, p);
2767 if (c == '-') {
2768 p++;
2769 tok = TOK_DEC;
2770 } else if (c == '=') {
2771 p++;
2772 tok = TOK_A_SUB;
2773 } else if (c == '>') {
2774 p++;
2775 tok = TOK_ARROW;
2776 } else {
2777 tok = '-';
2778 }
2779 break;
2780
2781 PARSE2('!', '!', '=', TOK_NE)
2782 PARSE2('=', '=', '=', TOK_EQ)
2783 PARSE2('*', '*', '=', TOK_A_MUL)
2784 PARSE2('%', '%', '=', TOK_A_MOD)
2785 PARSE2('^', '^', '=', TOK_A_XOR)
2786
2787 /* comments or operator */
2788 case '/':
2789 PEEKC(c, p);
2790 if (c == '*') {
2791 p = parse_comment(p);
2792 /* comments replaced by a blank */
2793 tok = ' ';
2794 goto keep_tok_flags;
2795 } else if (c == '/') {
2796 p = parse_line_comment(p);
2797 tok = ' ';
2798 goto keep_tok_flags;
2799 } else if (c == '=') {
2800 p++;
2801 tok = TOK_A_DIV;
2802 } else {
2803 tok = '/';
2804 }
2805 break;
2806
2807 /* simple tokens */
2808 case '(':
2809 case ')':
2810 case '[':
2811 case ']':
2812 case '{':
2813 case '}':
2814 case ',':
2815 case ';':
2816 case ':':
2817 case '?':
2818 case '~':
2819 case '@': /* only used in assembler */
2820 parse_simple:
2821 tok = c;
2822 p++;
2823 break;
2824 default:
2825 if (parse_flags & PARSE_FLAG_ASM_FILE)
2826 goto parse_simple;
2827 tcc_error("unrecognized character \\x%02x", c);
2828 break;
2829 }
2830 tok_flags = 0;
2831 keep_tok_flags:
2832 file->buf_ptr = p;
2833 #if defined(PARSE_DEBUG)
2834 printf("token = %s\n", get_tok_str(tok, &tokc));
2835 #endif
2836 }
2837
2838 /* return next token without macro substitution. Can read input from
2839 macro_ptr buffer */
2840 static void next_nomacro_spc(void)
2841 {
2842 if (macro_ptr) {
2843 redo:
2844 tok = *macro_ptr;
2845 if (tok) {
2846 TOK_GET(&tok, &macro_ptr, &tokc);
2847 if (tok == TOK_LINENUM) {
2848 file->line_num = tokc.i;
2849 goto redo;
2850 }
2851 }
2852 } else {
2853 next_nomacro1();
2854 }
2855 }
2856
2857 ST_FUNC void next_nomacro(void)
2858 {
2859 do {
2860 next_nomacro_spc();
2861 } while (tok < 256 && (isidnum_table[tok - CH_EOF] & IS_SPC));
2862 }
2863
2864
2865 static void macro_subst(
2866 TokenString *tok_str,
2867 Sym **nested_list,
2868 const int *macro_str,
2869 int can_read_stream
2870 );
2871
2872 /* substitute arguments in replacement lists in macro_str by the values in
2873 args (field d) and return allocated string */
2874 static int *macro_arg_subst(Sym **nested_list, const int *macro_str, Sym *args)
2875 {
2876 int t, t0, t1, spc;
2877 const int *st;
2878 Sym *s;
2879 CValue cval;
2880 TokenString str;
2881 CString cstr;
2882
2883 tok_str_new(&str);
2884 t0 = t1 = 0;
2885 while(1) {
2886 TOK_GET(&t, &macro_str, &cval);
2887 if (!t)
2888 break;
2889 if (t == '#') {
2890 /* stringize */
2891 TOK_GET(&t, &macro_str, &cval);
2892 if (!t)
2893 goto bad_stringy;
2894 s = sym_find2(args, t);
2895 if (s) {
2896 cstr_new(&cstr);
2897 cstr_ccat(&cstr, '\"');
2898 st = s->d;
2899 spc = 0;
2900 while (*st) {
2901 TOK_GET(&t, &st, &cval);
2902 if (t != TOK_PLCHLDR
2903 && t != TOK_NOSUBST
2904 && 0 == check_space(t, &spc)) {
2905 const char *s = get_tok_str(t, &cval);
2906 while (*s) {
2907 if (t == TOK_PPSTR && *s != '\'')
2908 add_char(&cstr, *s);
2909 else
2910 cstr_ccat(&cstr, *s);
2911 ++s;
2912 }
2913 }
2914 }
2915 cstr.size -= spc;
2916 cstr_ccat(&cstr, '\"');
2917 cstr_ccat(&cstr, '\0');
2918 #ifdef PP_DEBUG
2919 printf("\nstringize: <%s>\n", (char *)cstr.data);
2920 #endif
2921 /* add string */
2922 cval.str.size = cstr.size;
2923 cval.str.data = cstr.data;
2924 cval.str.data_allocated = cstr.data_allocated;
2925 tok_str_add2(&str, TOK_PPSTR, &cval);
2926 cstr_free(&cstr);
2927 } else {
2928 bad_stringy:
2929 expect("macro parameter after '#'");
2930 }
2931 } else if (t >= TOK_IDENT) {
2932 s = sym_find2(args, t);
2933 if (s) {
2934 int l0 = str.len;
2935 st = s->d;
2936 /* if '##' is present before or after, no arg substitution */
2937 if (*macro_str == TOK_TWOSHARPS || t1 == TOK_TWOSHARPS) {
2938 /* special case for var arg macros : ## eats the ','
2939 if empty VA_ARGS variable. */
2940 if (t1 == TOK_TWOSHARPS && t0 == ',' && gnu_ext && s->type.t) {
2941 if (*st == 0) {
2942 /* suppress ',' '##' */
2943 str.len -= 2;
2944 } else {
2945 /* suppress '##' and add variable */
2946 str.len--;
2947 goto add_var;
2948 }
2949 } else {
2950 for(;;) {
2951 int t1;
2952 TOK_GET(&t1, &st, &cval);
2953 if (!t1)
2954 break;
2955 tok_str_add2(&str, t1, &cval);
2956 }
2957 }
2958
2959 } else {
2960 add_var:
2961 /* NOTE: the stream cannot be read when macro
2962 substituing an argument */
2963 macro_subst(&str, nested_list, st, 0);
2964 }
2965 if (str.len == l0) /* exanded to empty string */
2966 tok_str_add(&str, TOK_PLCHLDR);
2967 } else {
2968 tok_str_add(&str, t);
2969 }
2970 } else {
2971 tok_str_add2(&str, t, &cval);
2972 }
2973 t0 = t1, t1 = t;
2974 }
2975 tok_str_add(&str, 0);
2976 return str.str;
2977 }
2978
2979 static char const ab_month_name[12][4] =
2980 {
2981 "Jan", "Feb", "Mar", "Apr", "May", "Jun",
2982 "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
2983 };
2984
2985 /* peek or read [ws_str == NULL] next token from function macro call,
2986 walking up macro levels up to the file if necessary */
2987 static int next_argstream(Sym **nested_list, int can_read_stream, TokenString *ws_str)
2988 {
2989 int t;
2990 const int *p;
2991 Sym *sa;
2992
2993 for (;;) {
2994 if (macro_ptr) {
2995 p = macro_ptr, t = *p;
2996 if (ws_str) {
2997 while (is_space(t) || TOK_LINEFEED == t)
2998 tok_str_add(ws_str, t), t = *++p;
2999 }
3000 if (t == 0 && can_read_stream) {
3001 end_macro();
3002 /* also, end of scope for nested defined symbol */
3003 sa = *nested_list;
3004 while (sa && sa->v == 0)
3005 sa = sa->prev;
3006 if (sa)
3007 sa->v = 0;
3008 continue;
3009 }
3010 } else {
3011 ch = handle_eob();
3012 if (ws_str) {
3013 while (is_space(ch) || ch == '\n' || ch == '/') {
3014 if (ch == '/') {
3015 int c;
3016 uint8_t *p = file->buf_ptr;
3017 PEEKC(c, p);
3018 if (c == '*') {
3019 p = parse_comment(p);
3020 file->buf_ptr = p - 1;
3021 } else if (c == '/') {
3022 p = parse_line_comment(p);
3023 file->buf_ptr = p - 1;
3024 } else
3025 break;
3026 ch = ' ';
3027 }
3028 tok_str_add(ws_str, ch);
3029 cinp();
3030 }
3031 }
3032 t = ch;
3033 }
3034
3035 if (ws_str)
3036 return t;
3037 next_nomacro_spc();
3038 return tok;
3039 }
3040 }
3041
3042 /* do macro substitution of current token with macro 's' and add
3043 result to (tok_str,tok_len). 'nested_list' is the list of all
3044 macros we got inside to avoid recursing. Return non zero if no
3045 substitution needs to be done */
3046 static int macro_subst_tok(
3047 TokenString *tok_str,
3048 Sym **nested_list,
3049 Sym *s,
3050 int can_read_stream)
3051 {
3052 Sym *args, *sa, *sa1;
3053 int parlevel, *mstr, t, t1, spc;
3054 TokenString str;
3055 char *cstrval;
3056 CValue cval;
3057 CString cstr;
3058 char buf[32];
3059
3060 /* if symbol is a macro, prepare substitution */
3061 /* special macros */
3062 if (tok == TOK___LINE__) {
3063 snprintf(buf, sizeof(buf), "%d", file->line_num);
3064 cstrval = buf;
3065 t1 = TOK_PPNUM;
3066 goto add_cstr1;
3067 } else if (tok == TOK___FILE__) {
3068 cstrval = file->filename;
3069 goto add_cstr;
3070 } else if (tok == TOK___DATE__ || tok == TOK___TIME__) {
3071 time_t ti;
3072 struct tm *tm;
3073
3074 time(&ti);
3075 tm = localtime(&ti);
3076 if (tok == TOK___DATE__) {
3077 snprintf(buf, sizeof(buf), "%s %2d %d",
3078 ab_month_name[tm->tm_mon], tm->tm_mday, tm->tm_year + 1900);
3079 } else {
3080 snprintf(buf, sizeof(buf), "%02d:%02d:%02d",
3081 tm->tm_hour, tm->tm_min, tm->tm_sec);
3082 }
3083 cstrval = buf;
3084 add_cstr:
3085 t1 = TOK_STR;
3086 add_cstr1:
3087 cstr_new(&cstr);
3088 cstr_cat(&cstr, cstrval, 0);
3089 cval.str.size = cstr.size;
3090 cval.str.data = cstr.data;
3091 cval.str.data_allocated = cstr.data_allocated;
3092 tok_str_add2(tok_str, t1, &cval);
3093 cstr_free(&cstr);
3094 } else {
3095 int saved_parse_flags = parse_flags;
3096
3097 mstr = s->d;
3098 if (s->type.t == MACRO_FUNC) {
3099 /* whitespace between macro name and argument list */
3100 TokenString ws_str;
3101 tok_str_new(&ws_str);
3102
3103 spc = 0;
3104 parse_flags |= PARSE_FLAG_SPACES | PARSE_FLAG_LINEFEED
3105 | PARSE_FLAG_ACCEPT_STRAYS;
3106
3107 /* get next token from argument stream */
3108 t = next_argstream(nested_list, can_read_stream, &ws_str);
3109 if (t != '(') {
3110 /* not a macro substitution after all, restore the
3111 * macro token plus all whitespace we've read.
3112 * whitespace is intentionally not merged to preserve
3113 * newlines. */
3114 parse_flags = saved_parse_flags;
3115 tok_str_add(tok_str, tok);
3116 if (parse_flags & PARSE_FLAG_SPACES) {
3117 int i;
3118 for (i = 0; i < ws_str.len; i++)
3119 tok_str_add(tok_str, ws_str.str[i]);
3120 }
3121 tok_str_free(ws_str.str);
3122 return 0;
3123 } else {
3124 tok_str_free(ws_str.str);
3125 }
3126 next_nomacro(); /* eat '(' */
3127
3128 /* argument macro */
3129 args = NULL;
3130 sa = s->next;
3131 /* NOTE: empty args are allowed, except if no args */
3132 for(;;) {
3133 do {
3134 next_argstream(nested_list, can_read_stream, NULL);
3135 } while (is_space(tok) || TOK_LINEFEED == tok);
3136 empty_arg:
3137 /* handle '()' case */
3138 if (!args && !sa && tok == ')')
3139 break;
3140 if (!sa)
3141 tcc_error("macro '%s' used with too many args",
3142 get_tok_str(s->v, 0));
3143 tok_str_new(&str);
3144 parlevel = spc = 0;
3145 /* NOTE: non zero sa->t indicates VA_ARGS */
3146 while ((parlevel > 0 ||
3147 (tok != ')' &&
3148 (tok != ',' || sa->type.t)))) {
3149 if (tok == TOK_EOF || tok == 0)
3150 break;
3151 if (tok == '(')
3152 parlevel++;
3153 else if (tok == ')')
3154 parlevel--;
3155 if (tok == TOK_LINEFEED)
3156 tok = ' ';
3157 if (!check_space(tok, &spc))
3158 tok_str_add2(&str, tok, &tokc);
3159 next_argstream(nested_list, can_read_stream, NULL);
3160 }
3161 if (parlevel)
3162 expect(")");
3163 str.len -= spc;
3164 tok_str_add(&str, 0);
3165 sa1 = sym_push2(&args, sa->v & ~SYM_FIELD, sa->type.t, 0);
3166 sa1->d = str.str;
3167 sa = sa->next;
3168 if (tok == ')') {
3169 /* special case for gcc var args: add an empty
3170 var arg argument if it is omitted */
3171 if (sa && sa->type.t && gnu_ext)
3172 goto empty_arg;
3173 break;
3174 }
3175 if (tok != ',')
3176 expect(",");
3177 }
3178 if (sa) {
3179 tcc_error("macro '%s' used with too few args",
3180 get_tok_str(s->v, 0));
3181 }
3182
3183 parse_flags = saved_parse_flags;
3184
3185 /* now subst each arg */
3186 mstr = macro_arg_subst(nested_list, mstr, args);
3187 /* free memory */
3188 sa = args;
3189 while (sa) {
3190 sa1 = sa->prev;
3191 tok_str_free(sa->d);
3192 sym_free(sa);
3193 sa = sa1;
3194 }
3195 }
3196
3197 sym_push2(nested_list, s->v, 0, 0);
3198 parse_flags = saved_parse_flags;
3199 macro_subst(tok_str, nested_list, mstr, can_read_stream | 2);
3200
3201 /* pop nested defined symbol */
3202 sa1 = *nested_list;
3203 *nested_list = sa1->prev;
3204 sym_free(sa1);
3205 if (mstr != s->d)
3206 tok_str_free(mstr);
3207 }
3208 return 0;
3209 }
3210
3211 static int paste_tokens(int t1, CValue *v1, int t2, CValue *v2)
3212 {
3213 CString cstr;
3214 int n;
3215
3216 cstr_new(&cstr);
3217 if (t1 != TOK_PLCHLDR)
3218 cstr_cat(&cstr, get_tok_str(t1, v1), -1);
3219 n = cstr.size;
3220 if (t2 != TOK_PLCHLDR)
3221 cstr_cat(&cstr, get_tok_str(t2, v2), -1);
3222 cstr_ccat(&cstr, '\0');
3223
3224 tcc_open_bf(tcc_state, ":paste:", cstr.size);
3225 memcpy(file->buffer, cstr.data, cstr.size);
3226 for (;;) {
3227 next_nomacro1();
3228 if (0 == *file->buf_ptr)
3229 break;
3230 if (is_space(tok))
3231 continue;
3232 tcc_warning("pasting <%.*s> and <%s> does not give a valid preprocessing token",
3233 n, cstr.data, (char*)cstr.data + n);
3234 break;
3235 }
3236 tcc_close();
3237
3238 //printf("paste <%s>\n", (char*)cstr.data);
3239 cstr_free(&cstr);
3240 return 0;
3241 }
3242
3243 /* handle the '##' operator. Return NULL if no '##' seen. Otherwise
3244 return the resulting string (which must be freed). */
3245 static inline int *macro_twosharps(const int *ptr0)
3246 {
3247 int t;
3248 CValue cval;
3249 TokenString macro_str1;
3250 int start_of_nosubsts = -1;
3251 const int *ptr;
3252
3253 /* we search the first '##' */
3254 for (ptr = ptr0;;) {
3255 TOK_GET(&t, &ptr, &cval);
3256 if (t == TOK_TWOSHARPS)
3257 break;
3258 if (t == 0)
3259 return NULL;
3260 }
3261
3262 tok_str_new(&macro_str1);
3263
3264 //tok_print(" $$$", ptr0);
3265 for (ptr = ptr0;;) {
3266 TOK_GET(&t, &ptr, &cval);
3267 if (t == 0)
3268 break;
3269 if (t == TOK_TWOSHARPS)
3270 continue;
3271 while (*ptr == TOK_TWOSHARPS) {
3272 int t1; CValue cv1;
3273 /* given 'a##b', remove nosubsts preceding 'a' */
3274 if (start_of_nosubsts >= 0)
3275 macro_str1.len = start_of_nosubsts;
3276 /* given 'a##b', remove nosubsts preceding 'b' */
3277 while ((t1 = *++ptr) == TOK_NOSUBST)
3278 ;
3279 if (t1 && t1 != TOK_TWOSHARPS
3280 && t1 != ':') /* 'a##:' don't build a new token */
3281 {
3282 TOK_GET(&t1, &ptr, &cv1);
3283 if (t != TOK_PLCHLDR || t1 != TOK_PLCHLDR) {
3284 paste_tokens(t, &cval, t1, &cv1);
3285 t = tok, cval = tokc;
3286 }
3287 }
3288 }
3289 if (t == TOK_NOSUBST) {
3290 if (start_of_nosubsts < 0)
3291 start_of_nosubsts = macro_str1.len;
3292 } else {
3293 start_of_nosubsts = -1;
3294 }
3295 tok_str_add2(&macro_str1, t, &cval);
3296 }
3297 tok_str_add(&macro_str1, 0);
3298 //tok_print(" ###", macro_str1.str);
3299 return macro_str1.str;
3300 }
3301
3302 /* do macro substitution of macro_str and add result to
3303 (tok_str,tok_len). 'nested_list' is the list of all macros we got
3304 inside to avoid recursing. */
3305 static void macro_subst(
3306 TokenString *tok_str,
3307 Sym **nested_list,
3308 const int *macro_str,
3309 int can_read_stream
3310 )
3311 {
3312 Sym *s;
3313 const int *ptr;
3314 int t, spc, nosubst;
3315 CValue cval;
3316 int *macro_str1 = NULL;
3317
3318 /* first scan for '##' operator handling */
3319 ptr = macro_str;
3320 spc = nosubst = 0;
3321
3322 /* first scan for '##' operator handling */
3323 if (can_read_stream & 1) {
3324 macro_str1 = macro_twosharps(ptr);
3325 if (macro_str1)
3326 ptr = macro_str1;
3327 }
3328
3329 while (1) {
3330 TOK_GET(&t, &ptr, &cval);
3331 if (t == 0)
3332 break;
3333
3334 if (t >= TOK_IDENT && 0 == nosubst) {
3335 s = define_find(t);
3336 if (s == NULL)
3337 goto no_subst;
3338
3339 /* if nested substitution, do nothing */
3340 if (sym_find2(*nested_list, t)) {
3341 /* and mark it as TOK_NOSUBST, so it doesn't get subst'd again */
3342 tok_str_add2(tok_str, TOK_NOSUBST, NULL);
3343 goto no_subst;
3344 }
3345
3346 {
3347 TokenString str;
3348 str.str = (int*)ptr;
3349 begin_macro(&str, 2);
3350
3351 tok = t;
3352 macro_subst_tok(tok_str, nested_list, s, can_read_stream);
3353
3354 if (str.alloc == 3) {
3355 /* already finished by reading function macro arguments */
3356 break;
3357 }
3358
3359 ptr = macro_ptr;
3360 end_macro ();
3361 }
3362
3363 spc = (tok_str->len &&
3364 is_space(tok_last(tok_str->str,
3365 tok_str->str + tok_str->len)));
3366
3367 } else {
3368
3369 if (t == '\\' && !(parse_flags & PARSE_FLAG_ACCEPT_STRAYS))
3370 tcc_error("stray '\\' in program");
3371
3372 no_subst:
3373 if (!check_space(t, &spc))
3374 tok_str_add2(tok_str, t, &cval);
3375 nosubst = 0;
3376 if (t == TOK_NOSUBST)
3377 nosubst = 1;
3378 }
3379 }
3380 if (macro_str1)
3381 tok_str_free(macro_str1);
3382
3383 }
3384
3385 /* return next token with macro substitution */
3386 ST_FUNC void next(void)
3387 {
3388 redo:
3389 if (parse_flags & PARSE_FLAG_SPACES)
3390 next_nomacro_spc();
3391 else
3392 next_nomacro();
3393
3394 if (macro_ptr) {
3395 if (tok == TOK_NOSUBST || tok == TOK_PLCHLDR) {
3396 /* discard preprocessor markers */
3397 goto redo;
3398 } else if (tok == 0) {
3399 /* end of macro or unget token string */
3400 end_macro();
3401 goto redo;
3402 }
3403 } else if (tok >= TOK_IDENT && (parse_flags & PARSE_FLAG_PREPROCESS)) {
3404 Sym *s;
3405 /* if reading from file, try to substitute macros */
3406 s = define_find(tok);
3407 if (s) {
3408 Sym *nested_list = NULL;
3409 tokstr_buf.len = 0;
3410 nested_list = NULL;
3411 macro_subst_tok(&tokstr_buf, &nested_list, s, 1);
3412 tok_str_add(&tokstr_buf, 0);
3413 begin_macro(&tokstr_buf, 2);
3414 goto redo;
3415 }
3416 }
3417 /* convert preprocessor tokens into C tokens */
3418 if (tok == TOK_PPNUM) {
3419 if (parse_flags & PARSE_FLAG_TOK_NUM)
3420 parse_number((char *)tokc.str.data);
3421 } else if (tok == TOK_PPSTR) {
3422 if (parse_flags & PARSE_FLAG_TOK_STR)
3423 parse_string((char *)tokc.str.data, tokc.str.size - 1);
3424 }
3425 }
3426
3427 /* push back current token and set current token to 'last_tok'. Only
3428 identifier case handled for labels. */
3429 ST_INLN void unget_tok(int last_tok)
3430 {
3431 TokenString *str = tcc_malloc(sizeof *str);
3432 tok_str_new(str);
3433 tok_str_add2(str, tok, &tokc);
3434 tok_str_add(str, 0);
3435 begin_macro(str, 1);
3436 tok = last_tok;
3437 }
3438
3439 ST_FUNC void preprocess_init(TCCState *s1)
3440 {
3441 s1->include_stack_ptr = s1->include_stack;
3442 /* XXX: move that before to avoid having to initialize
3443 file->ifdef_stack_ptr ? */
3444 s1->ifdef_stack_ptr = s1->ifdef_stack;
3445 file->ifdef_stack_ptr = s1->ifdef_stack_ptr;
3446
3447 pvtop = vtop = vstack - 1;
3448 s1->pack_stack[0] = 0;
3449 s1->pack_stack_ptr = s1->pack_stack;
3450
3451 isidnum_table['$' - CH_EOF] =
3452 s1->dollars_in_identifiers ? IS_ID : 0;
3453 isidnum_table['.' - CH_EOF] =
3454 (parse_flags & PARSE_FLAG_ASM_FILE) ? IS_ID : 0;
3455 }
3456
3457 ST_FUNC void preprocess_new(void)
3458 {
3459 int i, c;
3460 const char *p, *r;
3461
3462 /* init isid table */
3463 for(i = CH_EOF; i<128; i++)
3464 isidnum_table[i - CH_EOF]
3465 = is_space(i) ? IS_SPC
3466 : isid(i) ? IS_ID
3467 : isnum(i) ? IS_NUM
3468 : 0;
3469
3470 for(i = 128; i<256; i++)
3471 isidnum_table[i - CH_EOF] = IS_ID;
3472
3473 /* init allocators */
3474 tal_new(&toksym_alloc, TOKSYM_TAL_LIMIT, TOKSYM_TAL_SIZE);
3475 tal_new(&tokstr_alloc, TOKSTR_TAL_LIMIT, TOKSTR_TAL_SIZE);
3476 tal_new(&cstr_alloc, CSTR_TAL_LIMIT, CSTR_TAL_SIZE);
3477
3478 memset(hash_ident, 0, TOK_HASH_SIZE * sizeof(TokenSym *));
3479 cstr_new(&cstr_buf);
3480 cstr_realloc(&cstr_buf, STRING_MAX_SIZE);
3481 tok_str_new(&tokstr_buf);
3482 tok_str_realloc(&tokstr_buf, TOKSTR_MAX_SIZE);
3483
3484 tok_ident = TOK_IDENT;
3485 p = tcc_keywords;
3486 while (*p) {
3487 r = p;
3488 for(;;) {
3489 c = *r++;
3490 if (c == '\0')
3491 break;
3492 }
3493 tok_alloc(p, r - p - 1);
3494 p = r;
3495 }
3496 }
3497
3498 ST_FUNC void preprocess_delete(void)
3499 {
3500 int i, n;
3501
3502 /* free -D and compiler defines */
3503 free_defines(NULL);
3504
3505 /* cleanup from error/setjmp */
3506 while (macro_stack)
3507 end_macro();
3508 macro_ptr = NULL;
3509
3510 /* free tokens */
3511 n = tok_ident - TOK_IDENT;
3512 for(i = 0; i < n; i++)
3513 tal_free(toksym_alloc, table_ident[i]);
3514 tcc_free(table_ident);
3515 table_ident = NULL;
3516
3517 /* free static buffers */
3518 cstr_free(&tokcstr);
3519 cstr_free(&cstr_buf);
3520 tok_str_free(tokstr_buf.str);
3521
3522 /* free allocators */
3523 tal_delete(toksym_alloc);
3524 toksym_alloc = NULL;
3525 tal_delete(tokstr_alloc);
3526 tokstr_alloc = NULL;
3527 tal_delete(cstr_alloc);
3528 cstr_alloc = NULL;
3529 }
3530
3531 /* ------------------------------------------------------------------------- */
3532 /* tcc -E [-P[1]] [-dD} support */
3533
3534 static void tok_print(const char *msg, const int *str)
3535 {
3536 FILE *fp;
3537 int t;
3538 CValue cval;
3539
3540 fp = tcc_state->ppfp;
3541 if (!fp || !tcc_state->dflag)
3542 fp = stdout;
3543
3544 fprintf(fp, "%s ", msg);
3545 while (str) {
3546 TOK_GET(&t, &str, &cval);
3547 if (!t)
3548 break;
3549 fprintf(fp,"%s", get_tok_str(t, &cval));
3550 }
3551 fprintf(fp, "\n");
3552 }
3553
3554 static void pp_line(TCCState *s1, BufferedFile *f, int level)
3555 {
3556 int d = f->line_num - f->line_ref;
3557
3558 if (s1->dflag & 4)
3559 return;
3560
3561 if (s1->Pflag == LINE_MACRO_OUTPUT_FORMAT_NONE) {
3562 if (level == 0 && f->line_ref && d) {
3563 d = 1;
3564 goto simple;
3565 }
3566 } else if (level == 0 && f->line_ref && d < 8) {
3567 simple:
3568 while (d > 0)
3569 fputs("\n", s1->ppfp), --d;
3570 } else if (s1->Pflag == LINE_MACRO_OUTPUT_FORMAT_STD) {
3571 fprintf(s1->ppfp, "#line %d \"%s\"\n", f->line_num, f->filename);
3572 } else {
3573 fprintf(s1->ppfp, "# %d \"%s\"%s\n", f->line_num, f->filename,
3574 level > 0 ? " 1" : level < 0 ? " 2" : "");
3575 }
3576 f->line_ref = f->line_num;
3577 }
3578
3579 static void define_print(TCCState *s1, int v)
3580 {
3581 FILE *fp;
3582 Sym *s;
3583
3584 s = define_find(v);
3585 if (NULL == s || NULL == s->d)
3586 return;
3587
3588 fp = s1->ppfp;
3589 fprintf(fp, "#define %s", get_tok_str(v, NULL));
3590 if (s->type.t == MACRO_FUNC) {
3591 Sym *a = s->next;
3592 fprintf(fp,"(");
3593 if (a)
3594 for (;;) {
3595 fprintf(fp,"%s", get_tok_str(a->v & ~SYM_FIELD, NULL));
3596 if (!(a = a->next))
3597 break;
3598 fprintf(fp,",");
3599 }
3600 fprintf(fp,")");
3601 }
3602 tok_print("", s->d);
3603 }
3604
3605 static void pp_debug_defines(TCCState *s1)
3606 {
3607 int v, t;
3608 const char *vs;
3609 FILE *fp;
3610
3611 t = pp_debug_tok;
3612 if (t == 0)
3613 return;
3614
3615 file->line_num--;
3616 pp_line(s1, file, 0);
3617 file->line_ref = ++file->line_num;
3618
3619 fp = s1->ppfp;
3620 v = pp_debug_symv;
3621 vs = get_tok_str(v, NULL);
3622 if (t == TOK_DEFINE) {
3623 define_print(s1, v);
3624 } else if (t == TOK_UNDEF) {
3625 fprintf(fp, "#undef %s\n", vs);
3626 } else if (t == TOK_push_macro) {
3627 fprintf(fp, "#pragma push_macro(\"%s\")\n", vs);
3628 } else if (t == TOK_pop_macro) {
3629 fprintf(fp, "#pragma pop_macro(\"%s\")\n", vs);
3630 }
3631 pp_debug_tok = 0;
3632 }
3633
3634 static void pp_debug_builtins(TCCState *s1)
3635 {
3636 int v;
3637 for (v = TOK_IDENT; v < tok_ident; ++v)
3638 define_print(s1, v);
3639 }
3640
3641 static int need_space(int prev_tok, int tok, const char *tokstr)
3642 {
3643 const char *sp_chars = "";
3644 if ((prev_tok >= TOK_IDENT || prev_tok == TOK_PPNUM) &&
3645 (tok >= TOK_IDENT || tok == TOK_PPNUM))
3646 return 1;
3647 switch (prev_tok) {
3648 case '+':
3649 sp_chars = "+=";
3650 break;
3651 case '-':
3652 sp_chars = "-=>";
3653 break;
3654 case '*':
3655 case '/':
3656 case '%':
3657 case '^':
3658 case '=':
3659 case '!':
3660 case TOK_A_SHL:
3661 case TOK_A_SAR:
3662 sp_chars = "=";
3663 break;
3664 case '&':
3665 sp_chars = "&=";
3666 break;
3667 case '|':
3668 sp_chars = "|=";
3669 break;
3670 case '<':
3671 sp_chars = "<=";
3672 break;
3673 case '>':
3674 sp_chars = ">=";
3675 break;
3676 case '.':
3677 sp_chars = ".";
3678 break;
3679 case '#':
3680 sp_chars = "#";
3681 break;
3682 case TOK_PPNUM:
3683 sp_chars = "+-";
3684 break;
3685 }
3686 return !!strchr(sp_chars, tokstr[0]);
3687 }
3688
3689 /* Preprocess the current file */
3690 ST_FUNC int tcc_preprocess(TCCState *s1)
3691 {
3692 BufferedFile **iptr;
3693 int token_seen, spcs, level;
3694 Sym *define_start;
3695 const char *tokstr;
3696
3697 preprocess_init(s1);
3698 ch = file->buf_ptr[0];
3699 tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF;
3700 parse_flags = PARSE_FLAG_PREPROCESS
3701 | (parse_flags & PARSE_FLAG_ASM_FILE)
3702 | PARSE_FLAG_LINEFEED
3703 | PARSE_FLAG_SPACES
3704 | PARSE_FLAG_ACCEPT_STRAYS
3705 ;
3706 define_start = define_stack;
3707
3708 /* Credits to Fabrice Bellard's initial revision to demonstrate its
3709 capability to compile and run itself, provided all numbers are
3710 given as decimals. tcc -E -P10 will do. */
3711 if (s1->Pflag == 1 + 10)
3712 parse_flags |= PARSE_FLAG_TOK_NUM, s1->Pflag = 1;
3713
3714 #ifdef PP_BENCH
3715 /* for PP benchmarks */
3716 do next(); while (tok != TOK_EOF); return 0;
3717 #endif
3718
3719 if (s1->dflag & 1) {
3720 pp_debug_builtins(s1);
3721 s1->dflag &= ~1;
3722 }
3723
3724 token_seen = TOK_LINEFEED, spcs = 0;
3725 pp_line(s1, file, 0);
3726
3727 for (;;) {
3728 iptr = s1->include_stack_ptr;
3729 next();
3730 if (tok == TOK_EOF)
3731 break;
3732 level = s1->include_stack_ptr - iptr;
3733 if (level) {
3734 if (level > 0)
3735 pp_line(s1, *iptr, 0);
3736 pp_line(s1, file, level);
3737 }
3738
3739 if (s1->dflag) {
3740 pp_debug_defines(s1);
3741 if (s1->dflag & 4)
3742 continue;
3743 }
3744
3745 if (token_seen == TOK_LINEFEED) {
3746 if (tok == ' ') {
3747 ++spcs;
3748 continue;
3749 }
3750 if (tok == TOK_LINEFEED) {
3751 spcs = 0;
3752 continue;
3753 }
3754 pp_line(s1, file, 0);
3755 } else if (tok == TOK_LINEFEED) {
3756 ++file->line_ref;
3757 }
3758
3759 tokstr = get_tok_str(tok, &tokc);
3760 if (!spcs && need_space(token_seen, tok, tokstr))
3761 ++spcs;
3762 while (spcs)
3763 fputs(" ", s1->ppfp), --spcs;
3764 fputs(tokstr, s1->ppfp);
3765
3766 token_seen = tok;
3767 }
3768 /* reset define stack, but keep -D and built-ins */
3769 free_defines(define_start);
3770 return 0;
3771 }
3772
3773 /* ------------------------------------------------------------------------- */
Tiny C Compiler main repository