2 * TCC - Tiny C Compiler
4 * Copyright (c) 2001-2004 Fabrice Bellard
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.
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.
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
23 /********************************************************/
24 /* global variables */
26 ST_DATA
int tok_flags
;
27 /* additional informations about token */
28 #define TOK_FLAG_BOL 0x0001 /* beginning of line before */
29 #define TOK_FLAG_BOF 0x0002 /* beginning of file before */
30 #define TOK_FLAG_ENDIF 0x0004 /* a endif was found matching starting #ifdef */
31 #define TOK_FLAG_EOF 0x0008 /* end of file */
33 ST_DATA
int parse_flags
;
34 #define PARSE_FLAG_PREPROCESS 0x0001 /* activate preprocessing */
35 #define PARSE_FLAG_TOK_NUM 0x0002 /* return numbers instead of TOK_PPNUM */
36 #define PARSE_FLAG_LINEFEED 0x0004 /* line feed is returned as a
37 token. line feed is also
39 #define PARSE_FLAG_ASM_COMMENTS 0x0008 /* '#' can be used for line comment */
40 #define PARSE_FLAG_SPACES 0x0010 /* next() returns space tokens (for -E) */
42 ST_DATA
struct BufferedFile
*file
;
45 ST_DATA
int *macro_ptr
;
46 ST_DATA CString tokcstr
; /* current parsed string, if any */
48 /* display benchmark infos */
49 ST_DATA
int total_lines
;
50 ST_DATA
int total_bytes
;
51 ST_DATA
int tok_ident
;
52 ST_DATA TokenSym
**table_ident
;
54 /* ------------------------------------------------------------------------- */
56 static int *macro_ptr_allocated
;
57 static int *unget_saved_macro_ptr
;
58 static int unget_saved_buffer
[TOK_MAX_SIZE
+ 1];
59 static int unget_buffer_enabled
;
60 static TokenSym
*hash_ident
[TOK_HASH_SIZE
];
61 static char token_buf
[STRING_MAX_SIZE
+ 1];
62 /* true if isid(c) || isnum(c) */
63 static unsigned char isidnum_table
[256-CH_EOF
];
65 static const char tcc_keywords
[] =
66 #define DEF(id, str) str "\0"
71 /* WARNING: the content of this string encodes token numbers */
72 static const unsigned char tok_two_chars
[] =
73 "<=\236>=\235!=\225&&\240||\241++\244--\242==\224<<\1>>\2+=\253"
74 "-=\255*=\252/=\257%=\245&=\246^=\336|=\374->\313..\250##\266";
77 struct macro_level
*prev
;
81 ST_FUNC
void next_nomacro(void);
82 static void next_nomacro_spc(void);
83 static void macro_subst(
87 struct macro_level
**can_read_stream
90 ST_FUNC
void skip(int c
)
93 error("'%c' expected", c
);
97 /* ------------------------------------------------------------------------- */
98 /* CString handling */
99 static void cstr_realloc(CString
*cstr
, int new_size
)
104 size
= cstr
->size_allocated
;
106 size
= 8; /* no need to allocate a too small first string */
107 while (size
< new_size
)
109 data
= tcc_realloc(cstr
->data_allocated
, size
);
111 error("memory full");
112 cstr
->data_allocated
= data
;
113 cstr
->size_allocated
= size
;
118 ST_INLN
void cstr_ccat(CString
*cstr
, int ch
)
121 size
= cstr
->size
+ 1;
122 if (size
> cstr
->size_allocated
)
123 cstr_realloc(cstr
, size
);
124 ((unsigned char *)cstr
->data
)[size
- 1] = ch
;
128 ST_FUNC
void cstr_cat(CString
*cstr
, const char *str
)
140 /* add a wide char */
141 ST_FUNC
void cstr_wccat(CString
*cstr
, int ch
)
144 size
= cstr
->size
+ sizeof(nwchar_t
);
145 if (size
> cstr
->size_allocated
)
146 cstr_realloc(cstr
, size
);
147 *(nwchar_t
*)(((unsigned char *)cstr
->data
) + size
- sizeof(nwchar_t
)) = ch
;
151 ST_FUNC
void cstr_new(CString
*cstr
)
153 memset(cstr
, 0, sizeof(CString
));
156 /* free string and reset it to NULL */
157 ST_FUNC
void cstr_free(CString
*cstr
)
159 tcc_free(cstr
->data_allocated
);
164 ST_FUNC
void add_char(CString
*cstr
, int c
)
166 if (c
== '\'' || c
== '\"' || c
== '\\') {
167 /* XXX: could be more precise if char or string */
168 cstr_ccat(cstr
, '\\');
170 if (c
>= 32 && c
<= 126) {
173 cstr_ccat(cstr
, '\\');
175 cstr_ccat(cstr
, 'n');
177 cstr_ccat(cstr
, '0' + ((c
>> 6) & 7));
178 cstr_ccat(cstr
, '0' + ((c
>> 3) & 7));
179 cstr_ccat(cstr
, '0' + (c
& 7));
184 /* ------------------------------------------------------------------------- */
185 /* allocate a new token */
186 static TokenSym
*tok_alloc_new(TokenSym
**pts
, const char *str
, int len
)
188 TokenSym
*ts
, **ptable
;
191 if (tok_ident
>= SYM_FIRST_ANOM
)
192 error("memory full");
194 /* expand token table if needed */
195 i
= tok_ident
- TOK_IDENT
;
196 if ((i
% TOK_ALLOC_INCR
) == 0) {
197 ptable
= tcc_realloc(table_ident
, (i
+ TOK_ALLOC_INCR
) * sizeof(TokenSym
*));
199 error("memory full");
200 table_ident
= ptable
;
203 ts
= tcc_malloc(sizeof(TokenSym
) + len
);
205 ts
->tok
= tok_ident
++;
206 ts
->sym_define
= NULL
;
207 ts
->sym_label
= NULL
;
208 ts
->sym_struct
= NULL
;
209 ts
->sym_identifier
= NULL
;
211 ts
->hash_next
= NULL
;
212 memcpy(ts
->str
, str
, len
);
218 #define TOK_HASH_INIT 1
219 #define TOK_HASH_FUNC(h, c) ((h) * 263 + (c))
221 /* find a token and add it if not found */
222 ST_FUNC TokenSym
*tok_alloc(const char *str
, int len
)
230 h
= TOK_HASH_FUNC(h
, ((unsigned char *)str
)[i
]);
231 h
&= (TOK_HASH_SIZE
- 1);
233 pts
= &hash_ident
[h
];
238 if (ts
->len
== len
&& !memcmp(ts
->str
, str
, len
))
240 pts
= &(ts
->hash_next
);
242 return tok_alloc_new(pts
, str
, len
);
245 /* XXX: buffer overflow */
246 /* XXX: float tokens */
247 ST_FUNC
char *get_tok_str(int v
, CValue
*cv
)
249 static char buf
[STRING_MAX_SIZE
+ 1];
250 static CString cstr_buf
;
255 /* NOTE: to go faster, we give a fixed buffer for small strings */
256 cstr_reset(&cstr_buf
);
258 cstr_buf
.size_allocated
= sizeof(buf
);
264 /* XXX: not quite exact, but only useful for testing */
265 sprintf(p
, "%u", cv
->ui
);
269 /* XXX: not quite exact, but only useful for testing */
271 sprintf(p
, "%u", (unsigned)cv
->ull
);
273 sprintf(p
, "%Lu", cv
->ull
);
277 cstr_ccat(&cstr_buf
, 'L');
279 cstr_ccat(&cstr_buf
, '\'');
280 add_char(&cstr_buf
, cv
->i
);
281 cstr_ccat(&cstr_buf
, '\'');
282 cstr_ccat(&cstr_buf
, '\0');
286 len
= cstr
->size
- 1;
288 add_char(&cstr_buf
, ((unsigned char *)cstr
->data
)[i
]);
289 cstr_ccat(&cstr_buf
, '\0');
292 cstr_ccat(&cstr_buf
, 'L');
295 cstr_ccat(&cstr_buf
, '\"');
297 len
= cstr
->size
- 1;
299 add_char(&cstr_buf
, ((unsigned char *)cstr
->data
)[i
]);
301 len
= (cstr
->size
/ sizeof(nwchar_t
)) - 1;
303 add_char(&cstr_buf
, ((nwchar_t
*)cstr
->data
)[i
]);
305 cstr_ccat(&cstr_buf
, '\"');
306 cstr_ccat(&cstr_buf
, '\0');
315 return strcpy(p
, "...");
317 return strcpy(p
, "<<=");
319 return strcpy(p
, ">>=");
322 /* search in two bytes table */
323 const unsigned char *q
= tok_two_chars
;
336 } else if (v
< tok_ident
) {
337 return table_ident
[v
- TOK_IDENT
]->str
;
338 } else if (v
>= SYM_FIRST_ANOM
) {
339 /* special name for anonymous symbol */
340 sprintf(p
, "L.%u", v
- SYM_FIRST_ANOM
);
342 /* should never happen */
347 return cstr_buf
.data
;
350 /* fill input buffer and peek next char */
351 static int tcc_peekc_slow(BufferedFile
*bf
)
354 /* only tries to read if really end of buffer */
355 if (bf
->buf_ptr
>= bf
->buf_end
) {
357 #if defined(PARSE_DEBUG)
362 len
= read(bf
->fd
, bf
->buffer
, len
);
369 bf
->buf_ptr
= bf
->buffer
;
370 bf
->buf_end
= bf
->buffer
+ len
;
371 *bf
->buf_end
= CH_EOB
;
373 if (bf
->buf_ptr
< bf
->buf_end
) {
374 return bf
->buf_ptr
[0];
376 bf
->buf_ptr
= bf
->buf_end
;
381 /* return the current character, handling end of block if necessary
383 ST_FUNC
int handle_eob(void)
385 return tcc_peekc_slow(file
);
388 /* read next char from current input file and handle end of input buffer */
389 ST_INLN
void inp(void)
391 ch
= *(++(file
->buf_ptr
));
392 /* end of buffer/file handling */
397 /* handle '\[\r]\n' */
398 static int handle_stray_noerror(void)
405 } else if (ch
== '\r') {
419 static void handle_stray(void)
421 if (handle_stray_noerror())
422 error("stray '\\' in program");
425 /* skip the stray and handle the \\n case. Output an error if
426 incorrect char after the stray */
427 static int handle_stray1(uint8_t *p
)
431 if (p
>= file
->buf_end
) {
448 /* handle just the EOB case, but not stray */
449 #define PEEKC_EOB(c, p)\
460 /* handle the complicated stray case */
466 c = handle_stray1(p);\
471 /* input with '\[\r]\n' handling. Note that this function cannot
472 handle other characters after '\', so you cannot call it inside
473 strings or comments */
474 ST_FUNC
void minp(void)
482 /* single line C++ comments */
483 static uint8_t *parse_line_comment(uint8_t *p
)
491 if (c
== '\n' || c
== CH_EOF
) {
493 } else if (c
== '\\') {
502 } else if (c
== '\r') {
520 ST_FUNC
uint8_t *parse_comment(uint8_t *p
)
529 if (c
== '\n' || c
== '*' || c
== '\\')
533 if (c
== '\n' || c
== '*' || c
== '\\')
537 /* now we can handle all the cases */
541 } else if (c
== '*') {
547 } else if (c
== '/') {
549 } else if (c
== '\\') {
554 /* skip '\[\r]\n', otherwise just skip the stray */
560 } else if (c
== '\r') {
577 /* stray, eob or eof */
582 error("unexpected end of file in comment");
583 } else if (c
== '\\') {
595 static inline void skip_spaces(void)
601 static inline int check_space(int t
, int *spc
)
612 /* parse a string without interpreting escapes */
613 static uint8_t *parse_pp_string(uint8_t *p
,
614 int sep
, CString
*str
)
622 } else if (c
== '\\') {
628 /* XXX: indicate line number of start of string */
629 error("missing terminating %c character", sep
);
630 } else if (c
== '\\') {
631 /* escape : just skip \[\r]\n */
636 } else if (c
== '\r') {
639 expect("'\n' after '\r'");
642 } else if (c
== CH_EOF
) {
643 goto unterminated_string
;
646 cstr_ccat(str
, '\\');
652 } else if (c
== '\n') {
655 } else if (c
== '\r') {
659 cstr_ccat(str
, '\r');
675 /* skip block of text until #else, #elif or #endif. skip also pairs of
677 static void preprocess_skip(void)
679 int a
, start_of_line
, c
, in_warn_or_error
;
686 in_warn_or_error
= 0;
707 } else if (c
== '\\') {
708 ch
= file
->buf_ptr
[0];
709 handle_stray_noerror();
716 if (in_warn_or_error
)
718 p
= parse_pp_string(p
, c
, NULL
);
722 if (in_warn_or_error
)
729 p
= parse_comment(p
);
730 } else if (ch
== '/') {
731 p
= parse_line_comment(p
);
741 (tok
== TOK_ELSE
|| tok
== TOK_ELIF
|| tok
== TOK_ENDIF
))
743 if (tok
== TOK_IF
|| tok
== TOK_IFDEF
|| tok
== TOK_IFNDEF
)
745 else if (tok
== TOK_ENDIF
)
747 else if( tok
== TOK_ERROR
|| tok
== TOK_WARNING
)
748 in_warn_or_error
= 1;
762 /* ParseState handling */
764 /* XXX: currently, no include file info is stored. Thus, we cannot display
765 accurate messages if the function or data definition spans multiple
768 /* save current parse state in 's' */
769 ST_FUNC
void save_parse_state(ParseState
*s
)
771 s
->line_num
= file
->line_num
;
772 s
->macro_ptr
= macro_ptr
;
777 /* restore parse state from 's' */
778 ST_FUNC
void restore_parse_state(ParseState
*s
)
780 file
->line_num
= s
->line_num
;
781 macro_ptr
= s
->macro_ptr
;
786 /* return the number of additional 'ints' necessary to store the
788 static inline int tok_ext_size(int t
)
802 error("unsupported token");
809 return LDOUBLE_SIZE
/ 4;
815 /* token string handling */
817 ST_INLN
void tok_str_new(TokenString
*s
)
821 s
->allocated_len
= 0;
822 s
->last_line_num
= -1;
825 ST_FUNC
void tok_str_free(int *str
)
830 static int *tok_str_realloc(TokenString
*s
)
834 if (s
->allocated_len
== 0) {
837 len
= s
->allocated_len
* 2;
839 str
= tcc_realloc(s
->str
, len
* sizeof(int));
841 error("memory full");
842 s
->allocated_len
= len
;
847 ST_FUNC
void tok_str_add(TokenString
*s
, int t
)
853 if (len
>= s
->allocated_len
)
854 str
= tok_str_realloc(s
);
859 static void tok_str_add2(TokenString
*s
, int t
, CValue
*cv
)
866 /* allocate space for worst case */
867 if (len
+ TOK_MAX_SIZE
> s
->allocated_len
)
868 str
= tok_str_realloc(s
);
877 str
[len
++] = cv
->tab
[0];
886 nb_words
= (sizeof(CString
) + cv
->cstr
->size
+ 3) >> 2;
887 while ((len
+ nb_words
) > s
->allocated_len
)
888 str
= tok_str_realloc(s
);
889 cstr
= (CString
*)(str
+ len
);
891 cstr
->size
= cv
->cstr
->size
;
892 cstr
->data_allocated
= NULL
;
893 cstr
->size_allocated
= cstr
->size
;
894 memcpy((char *)cstr
+ sizeof(CString
),
895 cv
->cstr
->data
, cstr
->size
);
902 #if LDOUBLE_SIZE == 8
905 str
[len
++] = cv
->tab
[0];
906 str
[len
++] = cv
->tab
[1];
908 #if LDOUBLE_SIZE == 12
910 str
[len
++] = cv
->tab
[0];
911 str
[len
++] = cv
->tab
[1];
912 str
[len
++] = cv
->tab
[2];
913 #elif LDOUBLE_SIZE == 16
915 str
[len
++] = cv
->tab
[0];
916 str
[len
++] = cv
->tab
[1];
917 str
[len
++] = cv
->tab
[2];
918 str
[len
++] = cv
->tab
[3];
919 #elif LDOUBLE_SIZE != 8
920 #error add long double size support
929 /* add the current parse token in token string 's' */
930 ST_FUNC
void tok_str_add_tok(TokenString
*s
)
934 /* save line number info */
935 if (file
->line_num
!= s
->last_line_num
) {
936 s
->last_line_num
= file
->line_num
;
937 cval
.i
= s
->last_line_num
;
938 tok_str_add2(s
, TOK_LINENUM
, &cval
);
940 tok_str_add2(s
, tok
, &tokc
);
943 #if LDOUBLE_SIZE == 16
944 #define LDOUBLE_GET(p, cv) \
949 #elif LDOUBLE_SIZE == 12
950 #define LDOUBLE_GET(p, cv) \
954 #elif LDOUBLE_SIZE == 8
955 #define LDOUBLE_GET(p, cv) \
959 #error add long double size support
963 /* get a token from an integer array and increment pointer
964 accordingly. we code it as a macro to avoid pointer aliasing. */
965 #define TOK_GET(t, p, cv) \
980 cv.cstr = (CString *)p; \
981 cv.cstr->data = (char *)p + sizeof(CString);\
982 p += (sizeof(CString) + cv.cstr->size + 3) >> 2;\
992 LDOUBLE_GET(p, cv); \
993 p += LDOUBLE_SIZE / 4; \
1000 /* defines handling */
1001 ST_INLN
void define_push(int v
, int macro_type
, int *str
, Sym
*first_arg
)
1005 s
= sym_push2(&define_stack
, v
, macro_type
, 0);
1007 s
->next
= first_arg
;
1008 table_ident
[v
- TOK_IDENT
]->sym_define
= s
;
1011 /* undefined a define symbol. Its name is just set to zero */
1012 ST_FUNC
void define_undef(Sym
*s
)
1016 if (v
>= TOK_IDENT
&& v
< tok_ident
)
1017 table_ident
[v
- TOK_IDENT
]->sym_define
= NULL
;
1021 ST_INLN Sym
*define_find(int v
)
1024 if ((unsigned)v
>= (unsigned)(tok_ident
- TOK_IDENT
))
1026 return table_ident
[v
]->sym_define
;
1029 /* free define stack until top reaches 'b' */
1030 ST_FUNC
void free_defines(Sym
*b
)
1038 /* do not free args or predefined defines */
1040 tok_str_free(top
->d
);
1042 if (v
>= TOK_IDENT
&& v
< tok_ident
)
1043 table_ident
[v
- TOK_IDENT
]->sym_define
= NULL
;
1051 ST_FUNC Sym
*label_find(int v
)
1054 if ((unsigned)v
>= (unsigned)(tok_ident
- TOK_IDENT
))
1056 return table_ident
[v
]->sym_label
;
1059 ST_FUNC Sym
*label_push(Sym
**ptop
, int v
, int flags
)
1062 s
= sym_push2(ptop
, v
, 0, 0);
1064 ps
= &table_ident
[v
- TOK_IDENT
]->sym_label
;
1065 if (ptop
== &global_label_stack
) {
1066 /* modify the top most local identifier, so that
1067 sym_identifier will point to 's' when popped */
1069 ps
= &(*ps
)->prev_tok
;
1076 /* pop labels until element last is reached. Look if any labels are
1077 undefined. Define symbols if '&&label' was used. */
1078 ST_FUNC
void label_pop(Sym
**ptop
, Sym
*slast
)
1081 for(s
= *ptop
; s
!= slast
; s
= s1
) {
1083 if (s
->r
== LABEL_DECLARED
) {
1084 warning("label '%s' declared but not used", get_tok_str(s
->v
, NULL
));
1085 } else if (s
->r
== LABEL_FORWARD
) {
1086 error("label '%s' used but not defined",
1087 get_tok_str(s
->v
, NULL
));
1090 /* define corresponding symbol. A size of
1092 put_extern_sym(s
, cur_text_section
, s
->jnext
, 1);
1096 table_ident
[s
->v
- TOK_IDENT
]->sym_label
= s
->prev_tok
;
1102 /* eval an expression for #if/#elif */
1103 static int expr_preprocess(void)
1109 while (tok
!= TOK_LINEFEED
&& tok
!= TOK_EOF
) {
1110 next(); /* do macro subst */
1111 if (tok
== TOK_DEFINED
) {
1116 c
= define_find(tok
) != 0;
1121 } else if (tok
>= TOK_IDENT
) {
1122 /* if undefined macro */
1126 tok_str_add_tok(&str
);
1128 tok_str_add(&str
, -1); /* simulate end of file */
1129 tok_str_add(&str
, 0);
1130 /* now evaluate C constant expression */
1131 macro_ptr
= str
.str
;
1135 tok_str_free(str
.str
);
1139 #if defined(PARSE_DEBUG) || defined(PP_DEBUG)
1140 static void tok_print(int *str
)
1147 TOK_GET(t
, str
, cval
);
1150 printf("%s", get_tok_str(t
, &cval
));
1156 /* parse after #define */
1157 ST_FUNC
void parse_define(void)
1159 Sym
*s
, *first
, **ps
;
1160 int v
, t
, varg
, is_vaargs
, spc
;
1165 error("invalid macro name '%s'", get_tok_str(tok
, &tokc
));
1166 /* XXX: should check if same macro (ANSI) */
1169 /* '(' must be just after macro definition for MACRO_FUNC */
1174 while (tok
!= ')') {
1178 if (varg
== TOK_DOTS
) {
1179 varg
= TOK___VA_ARGS__
;
1181 } else if (tok
== TOK_DOTS
&& gnu_ext
) {
1185 if (varg
< TOK_IDENT
)
1186 error("badly punctuated parameter list");
1187 s
= sym_push2(&define_stack
, varg
| SYM_FIELD
, is_vaargs
, 0);
1200 /* EOF testing necessary for '-D' handling */
1201 while (tok
!= TOK_LINEFEED
&& tok
!= TOK_EOF
) {
1202 /* remove spaces around ## and after '#' */
1203 if (TOK_TWOSHARPS
== tok
) {
1207 } else if ('#' == tok
) {
1209 } else if (check_space(tok
, &spc
)) {
1212 tok_str_add2(&str
, tok
, &tokc
);
1217 --str
.len
; /* remove trailing space */
1218 tok_str_add(&str
, 0);
1220 printf("define %s %d: ", get_tok_str(v
, NULL
), t
);
1223 define_push(v
, t
, str
.str
, first
);
1226 static inline int hash_cached_include(int type
, const char *filename
)
1228 const unsigned char *s
;
1232 h
= TOK_HASH_FUNC(h
, type
);
1235 h
= TOK_HASH_FUNC(h
, *s
);
1238 h
&= (CACHED_INCLUDES_HASH_SIZE
- 1);
1242 /* XXX: use a token or a hash table to accelerate matching ? */
1243 static CachedInclude
*search_cached_include(TCCState
*s1
,
1244 int type
, const char *filename
)
1248 h
= hash_cached_include(type
, filename
);
1249 i
= s1
->cached_includes_hash
[h
];
1253 e
= s1
->cached_includes
[i
- 1];
1254 if (e
->type
== type
&& !PATHCMP(e
->filename
, filename
))
1261 static inline void add_cached_include(TCCState
*s1
, int type
,
1262 const char *filename
, int ifndef_macro
)
1267 if (search_cached_include(s1
, type
, filename
))
1270 printf("adding cached '%s' %s\n", filename
, get_tok_str(ifndef_macro
, NULL
));
1272 e
= tcc_malloc(sizeof(CachedInclude
) + strlen(filename
));
1276 strcpy(e
->filename
, filename
);
1277 e
->ifndef_macro
= ifndef_macro
;
1278 dynarray_add((void ***)&s1
->cached_includes
, &s1
->nb_cached_includes
, e
);
1279 /* add in hash table */
1280 h
= hash_cached_include(type
, filename
);
1281 e
->hash_next
= s1
->cached_includes_hash
[h
];
1282 s1
->cached_includes_hash
[h
] = s1
->nb_cached_includes
;
1285 static void pragma_parse(TCCState
*s1
)
1290 if (tok
== TOK_pack
) {
1293 #pragma pack(1) // set
1294 #pragma pack() // reset to default
1295 #pragma pack(push,1) // push & set
1296 #pragma pack(pop) // restore previous
1300 if (tok
== TOK_ASM_pop
) {
1302 if (s1
->pack_stack_ptr
<= s1
->pack_stack
) {
1304 error("out of pack stack");
1306 s1
->pack_stack_ptr
--;
1310 if (tok
== TOK_ASM_push
) {
1312 if (s1
->pack_stack_ptr
>= s1
->pack_stack
+ PACK_STACK_SIZE
- 1)
1314 s1
->pack_stack_ptr
++;
1317 if (tok
!= TOK_CINT
) {
1319 error("invalid pack pragma");
1322 if (val
< 1 || val
> 16 || (val
& (val
- 1)) != 0)
1326 *s1
->pack_stack_ptr
= val
;
1332 /* is_bof is true if first non space token at beginning of file */
1333 ST_FUNC
void preprocess(int is_bof
)
1335 TCCState
*s1
= tcc_state
;
1336 int i
, c
, n
, saved_parse_flags
;
1340 saved_parse_flags
= parse_flags
;
1341 parse_flags
= PARSE_FLAG_PREPROCESS
| PARSE_FLAG_TOK_NUM
|
1342 PARSE_FLAG_LINEFEED
;
1352 s
= define_find(tok
);
1353 /* undefine symbol by putting an invalid name */
1358 case TOK_INCLUDE_NEXT
:
1359 ch
= file
->buf_ptr
[0];
1360 /* XXX: incorrect if comments : use next_nomacro with a special mode */
1365 } else if (ch
== '\"') {
1370 while (ch
!= c
&& ch
!= '\n' && ch
!= CH_EOF
) {
1371 if ((q
- buf
) < sizeof(buf
) - 1)
1374 if (handle_stray_noerror() == 0)
1382 /* eat all spaces and comments after include */
1383 /* XXX: slightly incorrect */
1384 while (ch1
!= '\n' && ch1
!= CH_EOF
)
1388 /* computed #include : either we have only strings or
1389 we have anything enclosed in '<>' */
1392 if (tok
== TOK_STR
) {
1393 while (tok
!= TOK_LINEFEED
) {
1394 if (tok
!= TOK_STR
) {
1396 error("'#include' expects \"FILENAME\" or <FILENAME>");
1398 pstrcat(buf
, sizeof(buf
), (char *)tokc
.cstr
->data
);
1404 while (tok
!= TOK_LINEFEED
) {
1405 pstrcat(buf
, sizeof(buf
), get_tok_str(tok
, &tokc
));
1409 /* check syntax and remove '<>' */
1410 if (len
< 2 || buf
[0] != '<' || buf
[len
- 1] != '>')
1411 goto include_syntax
;
1412 memmove(buf
, buf
+ 1, len
- 2);
1413 buf
[len
- 2] = '\0';
1418 if (s1
->include_stack_ptr
>= s1
->include_stack
+ INCLUDE_STACK_SIZE
)
1419 error("#include recursion too deep");
1421 n
= s1
->nb_include_paths
+ s1
->nb_sysinclude_paths
;
1422 for (i
= -2; i
< n
; ++i
) {
1423 char buf1
[sizeof file
->filename
];
1430 /* check absolute include path */
1431 if (!IS_ABSPATH(buf
))
1435 } else if (i
== -1) {
1436 /* search in current dir if "header.h" */
1439 size
= tcc_basename(file
->filename
) - file
->filename
;
1440 memcpy(buf1
, file
->filename
, size
);
1444 /* search in all the include paths */
1445 if (i
< s1
->nb_include_paths
)
1446 path
= s1
->include_paths
[i
];
1448 path
= s1
->sysinclude_paths
[i
- s1
->nb_include_paths
];
1449 pstrcpy(buf1
, sizeof(buf1
), path
);
1450 pstrcat(buf1
, sizeof(buf1
), "/");
1453 pstrcat(buf1
, sizeof(buf1
), buf
);
1455 e
= search_cached_include(s1
, c
, buf1
);
1456 if (e
&& define_find(e
->ifndef_macro
)) {
1457 /* no need to parse the include because the 'ifndef macro'
1460 printf("%s: skipping %s\n", file
->filename
, buf
);
1464 f
= tcc_open(s1
, buf1
);
1469 if (tok
== TOK_INCLUDE_NEXT
) {
1480 printf("%s: including %s\n", file
->filename
, buf1
);
1483 /* XXX: fix current line init */
1484 /* push current file in stack */
1485 *s1
->include_stack_ptr
++ = file
;
1487 pstrcpy(f
->inc_filename
, sizeof(f
->inc_filename
), buf1
);
1489 /* add include file debug info */
1491 put_stabs(file
->filename
, N_BINCL
, 0, 0, 0);
1493 tok_flags
|= TOK_FLAG_BOF
| TOK_FLAG_BOL
;
1494 ch
= file
->buf_ptr
[0];
1497 error("include file '%s' not found", buf
);
1504 c
= expr_preprocess();
1510 if (tok
< TOK_IDENT
)
1511 error("invalid argument for '#if%sdef'", c
? "n" : "");
1515 printf("#ifndef %s\n", get_tok_str(tok
, NULL
));
1517 file
->ifndef_macro
= tok
;
1520 c
= (define_find(tok
) != 0) ^ c
;
1522 if (s1
->ifdef_stack_ptr
>= s1
->ifdef_stack
+ IFDEF_STACK_SIZE
)
1523 error("memory full");
1524 *s1
->ifdef_stack_ptr
++ = c
;
1527 if (s1
->ifdef_stack_ptr
== s1
->ifdef_stack
)
1528 error("#else without matching #if");
1529 if (s1
->ifdef_stack_ptr
[-1] & 2)
1530 error("#else after #else");
1531 c
= (s1
->ifdef_stack_ptr
[-1] ^= 3);
1534 if (s1
->ifdef_stack_ptr
== s1
->ifdef_stack
)
1535 error("#elif without matching #if");
1536 c
= s1
->ifdef_stack_ptr
[-1];
1538 error("#elif after #else");
1539 /* last #if/#elif expression was true: we skip */
1542 c
= expr_preprocess();
1543 s1
->ifdef_stack_ptr
[-1] = c
;
1545 if (s1
->ifdef_stack_ptr
== file
->ifdef_stack_ptr
+ 1)
1546 file
->ifndef_macro
= 0;
1556 if (s1
->ifdef_stack_ptr
<= file
->ifdef_stack_ptr
)
1557 error("#endif without matching #if");
1558 s1
->ifdef_stack_ptr
--;
1559 /* '#ifndef macro' was at the start of file. Now we check if
1560 an '#endif' is exactly at the end of file */
1561 if (file
->ifndef_macro
&&
1562 s1
->ifdef_stack_ptr
== file
->ifdef_stack_ptr
) {
1563 file
->ifndef_macro_saved
= file
->ifndef_macro
;
1564 /* need to set to zero to avoid false matches if another
1565 #ifndef at middle of file */
1566 file
->ifndef_macro
= 0;
1567 while (tok
!= TOK_LINEFEED
)
1569 tok_flags
|= TOK_FLAG_ENDIF
;
1575 if (tok
!= TOK_CINT
)
1577 file
->line_num
= tokc
.i
- 1; /* the line number will be incremented after */
1579 if (tok
!= TOK_LINEFEED
) {
1582 pstrcpy(file
->filename
, sizeof(file
->filename
),
1583 (char *)tokc
.cstr
->data
);
1589 ch
= file
->buf_ptr
[0];
1592 while (ch
!= '\n' && ch
!= CH_EOF
) {
1593 if ((q
- buf
) < sizeof(buf
) - 1)
1596 if (handle_stray_noerror() == 0)
1603 error("#error %s", buf
);
1605 warning("#warning %s", buf
);
1611 if (tok
== TOK_LINEFEED
|| tok
== '!' || tok
== TOK_CINT
) {
1612 /* '!' is ignored to allow C scripts. numbers are ignored
1613 to emulate cpp behaviour */
1615 if (!(saved_parse_flags
& PARSE_FLAG_ASM_COMMENTS
))
1616 warning("Ignoring unknown preprocessing directive #%s", get_tok_str(tok
, &tokc
));
1620 /* ignore other preprocess commands or #! for C scripts */
1621 while (tok
!= TOK_LINEFEED
)
1624 parse_flags
= saved_parse_flags
;
1627 /* evaluate escape codes in a string. */
1628 static void parse_escape_string(CString
*outstr
, const uint8_t *buf
, int is_long
)
1643 case '0': case '1': case '2': case '3':
1644 case '4': case '5': case '6': case '7':
1645 /* at most three octal digits */
1650 n
= n
* 8 + c
- '0';
1654 n
= n
* 8 + c
- '0';
1659 goto add_char_nonext
;
1667 if (c
>= 'a' && c
<= 'f')
1669 else if (c
>= 'A' && c
<= 'F')
1679 goto add_char_nonext
;
1703 goto invalid_escape
;
1713 if (c
>= '!' && c
<= '~')
1714 warning("unknown escape sequence: \'\\%c\'", c
);
1716 warning("unknown escape sequence: \'\\x%x\'", c
);
1723 cstr_ccat(outstr
, c
);
1725 cstr_wccat(outstr
, c
);
1727 /* add a trailing '\0' */
1729 cstr_ccat(outstr
, '\0');
1731 cstr_wccat(outstr
, '\0');
1734 /* we use 64 bit numbers */
1737 /* bn = (bn << shift) | or_val */
1738 static void bn_lshift(unsigned int *bn
, int shift
, int or_val
)
1742 for(i
=0;i
<BN_SIZE
;i
++) {
1744 bn
[i
] = (v
<< shift
) | or_val
;
1745 or_val
= v
>> (32 - shift
);
1749 static void bn_zero(unsigned int *bn
)
1752 for(i
=0;i
<BN_SIZE
;i
++) {
1757 /* parse number in null terminated string 'p' and return it in the
1759 static void parse_number(const char *p
)
1761 int b
, t
, shift
, frac_bits
, s
, exp_val
, ch
;
1763 unsigned int bn
[BN_SIZE
];
1774 goto float_frac_parse
;
1775 } else if (t
== '0') {
1776 if (ch
== 'x' || ch
== 'X') {
1780 } else if (tcc_ext
&& (ch
== 'b' || ch
== 'B')) {
1786 /* parse all digits. cannot check octal numbers at this stage
1787 because of floating point constants */
1789 if (ch
>= 'a' && ch
<= 'f')
1791 else if (ch
>= 'A' && ch
<= 'F')
1799 if (q
>= token_buf
+ STRING_MAX_SIZE
) {
1801 error("number too long");
1807 ((ch
== 'e' || ch
== 'E') && b
== 10) ||
1808 ((ch
== 'p' || ch
== 'P') && (b
== 16 || b
== 2))) {
1810 /* NOTE: strtox should support that for hexa numbers, but
1811 non ISOC99 libcs do not support it, so we prefer to do
1813 /* hexadecimal or binary floats */
1814 /* XXX: handle overflows */
1826 } else if (t
>= 'a') {
1828 } else if (t
>= 'A') {
1833 bn_lshift(bn
, shift
, t
);
1840 if (t
>= 'a' && t
<= 'f') {
1842 } else if (t
>= 'A' && t
<= 'F') {
1844 } else if (t
>= '0' && t
<= '9') {
1850 error("invalid digit");
1851 bn_lshift(bn
, shift
, t
);
1856 if (ch
!= 'p' && ch
!= 'P')
1863 } else if (ch
== '-') {
1867 if (ch
< '0' || ch
> '9')
1868 expect("exponent digits");
1869 while (ch
>= '0' && ch
<= '9') {
1870 exp_val
= exp_val
* 10 + ch
- '0';
1873 exp_val
= exp_val
* s
;
1875 /* now we can generate the number */
1876 /* XXX: should patch directly float number */
1877 d
= (double)bn
[1] * 4294967296.0 + (double)bn
[0];
1878 d
= ldexp(d
, exp_val
- frac_bits
);
1883 /* float : should handle overflow */
1885 } else if (t
== 'L') {
1887 #ifdef TCC_TARGET_PE
1892 /* XXX: not large enough */
1893 tokc
.ld
= (long double)d
;
1900 /* decimal floats */
1902 if (q
>= token_buf
+ STRING_MAX_SIZE
)
1907 while (ch
>= '0' && ch
<= '9') {
1908 if (q
>= token_buf
+ STRING_MAX_SIZE
)
1914 if (ch
== 'e' || ch
== 'E') {
1915 if (q
>= token_buf
+ STRING_MAX_SIZE
)
1919 if (ch
== '-' || ch
== '+') {
1920 if (q
>= token_buf
+ STRING_MAX_SIZE
)
1925 if (ch
< '0' || ch
> '9')
1926 expect("exponent digits");
1927 while (ch
>= '0' && ch
<= '9') {
1928 if (q
>= token_buf
+ STRING_MAX_SIZE
)
1940 tokc
.f
= strtof(token_buf
, NULL
);
1941 } else if (t
== 'L') {
1943 #ifdef TCC_TARGET_PE
1945 tokc
.d
= strtod(token_buf
, NULL
);
1948 tokc
.ld
= strtold(token_buf
, NULL
);
1952 tokc
.d
= strtod(token_buf
, NULL
);
1956 unsigned long long n
, n1
;
1959 /* integer number */
1962 if (b
== 10 && *q
== '0') {
1969 /* no need for checks except for base 10 / 8 errors */
1972 } else if (t
>= 'a') {
1974 } else if (t
>= 'A') {
1979 error("invalid digit");
1983 /* detect overflow */
1984 /* XXX: this test is not reliable */
1986 error("integer constant overflow");
1989 /* XXX: not exactly ANSI compliant */
1990 if ((n
& 0xffffffff00000000LL
) != 0) {
1995 } else if (n
> 0x7fffffff) {
2006 error("three 'l's in integer constant");
2009 if (tok
== TOK_CINT
)
2011 else if (tok
== TOK_CUINT
)
2015 } else if (t
== 'U') {
2017 error("two 'u's in integer constant");
2019 if (tok
== TOK_CINT
)
2021 else if (tok
== TOK_CLLONG
)
2028 if (tok
== TOK_CINT
|| tok
== TOK_CUINT
)
2034 error("invalid number\n");
2038 #define PARSE2(c1, tok1, c2, tok2) \
2049 /* return next token without macro substitution */
2050 static inline void next_nomacro1(void)
2065 goto keep_tok_flags
;
2072 /* first look if it is in fact an end of buffer */
2073 if (p
>= file
->buf_end
) {
2077 if (p
>= file
->buf_end
)
2090 TCCState
*s1
= tcc_state
;
2091 if ((parse_flags
& PARSE_FLAG_LINEFEED
)
2092 && !(tok_flags
& TOK_FLAG_EOF
)) {
2093 tok_flags
|= TOK_FLAG_EOF
;
2095 goto keep_tok_flags
;
2096 } else if (s1
->include_stack_ptr
== s1
->include_stack
||
2097 !(parse_flags
& PARSE_FLAG_PREPROCESS
)) {
2098 /* no include left : end of file. */
2101 tok_flags
&= ~TOK_FLAG_EOF
;
2102 /* pop include file */
2104 /* test if previous '#endif' was after a #ifdef at
2106 if (tok_flags
& TOK_FLAG_ENDIF
) {
2108 printf("#endif %s\n", get_tok_str(file
->ifndef_macro_saved
, NULL
));
2110 add_cached_include(s1
, file
->inc_type
, file
->inc_filename
,
2111 file
->ifndef_macro_saved
);
2114 /* add end of include file debug info */
2115 if (tcc_state
->do_debug
) {
2116 put_stabd(N_EINCL
, 0, 0);
2118 /* pop include stack */
2120 s1
->include_stack_ptr
--;
2121 file
= *s1
->include_stack_ptr
;
2130 tok_flags
|= TOK_FLAG_BOL
;
2133 if (0 == (parse_flags
& PARSE_FLAG_LINEFEED
))
2136 goto keep_tok_flags
;
2141 if ((tok_flags
& TOK_FLAG_BOL
) &&
2142 (parse_flags
& PARSE_FLAG_PREPROCESS
)) {
2144 preprocess(tok_flags
& TOK_FLAG_BOF
);
2150 tok
= TOK_TWOSHARPS
;
2152 if (parse_flags
& PARSE_FLAG_ASM_COMMENTS
) {
2153 p
= parse_line_comment(p
- 1);
2162 case 'a': case 'b': case 'c': case 'd':
2163 case 'e': case 'f': case 'g': case 'h':
2164 case 'i': case 'j': case 'k': case 'l':
2165 case 'm': case 'n': case 'o': case 'p':
2166 case 'q': case 'r': case 's': case 't':
2167 case 'u': case 'v': case 'w': case 'x':
2169 case 'A': case 'B': case 'C': case 'D':
2170 case 'E': case 'F': case 'G': case 'H':
2171 case 'I': case 'J': case 'K':
2172 case 'M': case 'N': case 'O': case 'P':
2173 case 'Q': case 'R': case 'S': case 'T':
2174 case 'U': case 'V': case 'W': case 'X':
2180 h
= TOK_HASH_FUNC(h
, c
);
2184 if (!isidnum_table
[c
-CH_EOF
])
2186 h
= TOK_HASH_FUNC(h
, c
);
2193 /* fast case : no stray found, so we have the full token
2194 and we have already hashed it */
2196 h
&= (TOK_HASH_SIZE
- 1);
2197 pts
= &hash_ident
[h
];
2202 if (ts
->len
== len
&& !memcmp(ts
->str
, p1
, len
))
2204 pts
= &(ts
->hash_next
);
2206 ts
= tok_alloc_new(pts
, p1
, len
);
2210 cstr_reset(&tokcstr
);
2213 cstr_ccat(&tokcstr
, *p1
);
2219 while (isidnum_table
[c
-CH_EOF
]) {
2220 cstr_ccat(&tokcstr
, c
);
2223 ts
= tok_alloc(tokcstr
.data
, tokcstr
.size
);
2229 if (t
!= '\\' && t
!= '\'' && t
!= '\"') {
2231 goto parse_ident_fast
;
2234 if (c
== '\'' || c
== '\"') {
2238 cstr_reset(&tokcstr
);
2239 cstr_ccat(&tokcstr
, 'L');
2240 goto parse_ident_slow
;
2244 case '0': case '1': case '2': case '3':
2245 case '4': case '5': case '6': case '7':
2248 cstr_reset(&tokcstr
);
2249 /* after the first digit, accept digits, alpha, '.' or sign if
2250 prefixed by 'eEpP' */
2254 cstr_ccat(&tokcstr
, c
);
2256 if (!(isnum(c
) || isid(c
) || c
== '.' ||
2257 ((c
== '+' || c
== '-') &&
2258 (t
== 'e' || t
== 'E' || t
== 'p' || t
== 'P'))))
2261 /* We add a trailing '\0' to ease parsing */
2262 cstr_ccat(&tokcstr
, '\0');
2263 tokc
.cstr
= &tokcstr
;
2267 /* special dot handling because it can also start a number */
2270 cstr_reset(&tokcstr
);
2271 cstr_ccat(&tokcstr
, '.');
2273 } else if (c
== '.') {
2293 /* parse the string */
2295 p
= parse_pp_string(p
, sep
, &str
);
2296 cstr_ccat(&str
, '\0');
2298 /* eval the escape (should be done as TOK_PPNUM) */
2299 cstr_reset(&tokcstr
);
2300 parse_escape_string(&tokcstr
, str
.data
, is_long
);
2305 /* XXX: make it portable */
2309 char_size
= sizeof(nwchar_t
);
2310 if (tokcstr
.size
<= char_size
)
2311 error("empty character constant");
2312 if (tokcstr
.size
> 2 * char_size
)
2313 warning("multi-character character constant");
2315 tokc
.i
= *(int8_t *)tokcstr
.data
;
2318 tokc
.i
= *(nwchar_t
*)tokcstr
.data
;
2322 tokc
.cstr
= &tokcstr
;
2336 } else if (c
== '<') {
2354 } else if (c
== '>') {
2372 } else if (c
== '=') {
2385 } else if (c
== '=') {
2398 } else if (c
== '=') {
2411 } else if (c
== '=') {
2414 } else if (c
== '>') {
2422 PARSE2('!', '!', '=', TOK_NE
)
2423 PARSE2('=', '=', '=', TOK_EQ
)
2424 PARSE2('*', '*', '=', TOK_A_MUL
)
2425 PARSE2('%', '%', '=', TOK_A_MOD
)
2426 PARSE2('^', '^', '=', TOK_A_XOR
)
2428 /* comments or operator */
2432 p
= parse_comment(p
);
2434 } else if (c
== '/') {
2435 p
= parse_line_comment(p
);
2437 } else if (c
== '=') {
2457 case '$': /* only used in assembler */
2458 case '@': /* dito */
2463 error("unrecognized character \\x%02x", c
);
2469 #if defined(PARSE_DEBUG)
2470 printf("token = %s\n", get_tok_str(tok
, &tokc
));
2474 /* return next token without macro substitution. Can read input from
2476 static void next_nomacro_spc(void)
2482 TOK_GET(tok
, macro_ptr
, tokc
);
2483 if (tok
== TOK_LINENUM
) {
2484 file
->line_num
= tokc
.i
;
2493 ST_FUNC
void next_nomacro(void)
2497 } while (is_space(tok
));
2500 /* substitute args in macro_str and return allocated string */
2501 static int *macro_arg_subst(Sym
**nested_list
, int *macro_str
, Sym
*args
)
2503 int *st
, last_tok
, t
, spc
;
2512 TOK_GET(t
, macro_str
, cval
);
2517 TOK_GET(t
, macro_str
, cval
);
2520 s
= sym_find2(args
, t
);
2526 TOK_GET(t
, st
, cval
);
2527 if (!check_space(t
, &spc
))
2528 cstr_cat(&cstr
, get_tok_str(t
, &cval
));
2531 cstr_ccat(&cstr
, '\0');
2533 printf("stringize: %s\n", (char *)cstr
.data
);
2537 tok_str_add2(&str
, TOK_STR
, &cval
);
2540 tok_str_add2(&str
, t
, &cval
);
2542 } else if (t
>= TOK_IDENT
) {
2543 s
= sym_find2(args
, t
);
2546 /* if '##' is present before or after, no arg substitution */
2547 if (*macro_str
== TOK_TWOSHARPS
|| last_tok
== TOK_TWOSHARPS
) {
2548 /* special case for var arg macros : ## eats the
2549 ',' if empty VA_ARGS variable. */
2550 /* XXX: test of the ',' is not 100%
2551 reliable. should fix it to avoid security
2553 if (gnu_ext
&& s
->type
.t
&&
2554 last_tok
== TOK_TWOSHARPS
&&
2555 str
.len
>= 2 && str
.str
[str
.len
- 2] == ',') {
2557 /* suppress ',' '##' */
2560 /* suppress '##' and add variable */
2568 TOK_GET(t1
, st
, cval
);
2571 tok_str_add2(&str
, t1
, &cval
);
2575 /* NOTE: the stream cannot be read when macro
2576 substituing an argument */
2577 macro_subst(&str
, nested_list
, st
, NULL
);
2580 tok_str_add(&str
, t
);
2583 tok_str_add2(&str
, t
, &cval
);
2587 tok_str_add(&str
, 0);
2591 static char const ab_month_name
[12][4] =
2593 "Jan", "Feb", "Mar", "Apr", "May", "Jun",
2594 "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
2597 /* do macro substitution of current token with macro 's' and add
2598 result to (tok_str,tok_len). 'nested_list' is the list of all
2599 macros we got inside to avoid recursing. Return non zero if no
2600 substitution needs to be done */
2601 static int macro_subst_tok(TokenString
*tok_str
,
2602 Sym
**nested_list
, Sym
*s
, struct macro_level
**can_read_stream
)
2604 Sym
*args
, *sa
, *sa1
;
2605 int mstr_allocated
, parlevel
, *mstr
, t
, t1
, *p
, spc
;
2612 /* if symbol is a macro, prepare substitution */
2613 /* special macros */
2614 if (tok
== TOK___LINE__
) {
2615 snprintf(buf
, sizeof(buf
), "%d", file
->line_num
);
2619 } else if (tok
== TOK___FILE__
) {
2620 cstrval
= file
->filename
;
2622 } else if (tok
== TOK___DATE__
|| tok
== TOK___TIME__
) {
2627 tm
= localtime(&ti
);
2628 if (tok
== TOK___DATE__
) {
2629 snprintf(buf
, sizeof(buf
), "%s %2d %d",
2630 ab_month_name
[tm
->tm_mon
], tm
->tm_mday
, tm
->tm_year
+ 1900);
2632 snprintf(buf
, sizeof(buf
), "%02d:%02d:%02d",
2633 tm
->tm_hour
, tm
->tm_min
, tm
->tm_sec
);
2640 cstr_cat(&cstr
, cstrval
);
2641 cstr_ccat(&cstr
, '\0');
2643 tok_str_add2(tok_str
, t1
, &cval
);
2648 if (s
->type
.t
== MACRO_FUNC
) {
2649 /* NOTE: we do not use next_nomacro to avoid eating the
2650 next token. XXX: find better solution */
2654 while (is_space(t
= *p
) || TOK_LINEFEED
== t
)
2656 if (t
== 0 && can_read_stream
) {
2657 /* end of macro stream: we must look at the token
2658 after in the file */
2659 struct macro_level
*ml
= *can_read_stream
;
2665 *can_read_stream
= ml
-> prev
;
2670 /* XXX: incorrect with comments */
2671 ch
= file
->buf_ptr
[0];
2672 while (is_space(ch
) || ch
== '\n')
2676 if (t
!= '(') /* no macro subst */
2679 /* argument macro */
2684 /* NOTE: empty args are allowed, except if no args */
2686 /* handle '()' case */
2687 if (!args
&& !sa
&& tok
== ')')
2690 error("macro '%s' used with too many args",
2691 get_tok_str(s
->v
, 0));
2694 /* NOTE: non zero sa->t indicates VA_ARGS */
2695 while ((parlevel
> 0 ||
2697 (tok
!= ',' || sa
->type
.t
))) &&
2701 else if (tok
== ')')
2703 if (tok
== TOK_LINEFEED
)
2705 if (!check_space(tok
, &spc
))
2706 tok_str_add2(&str
, tok
, &tokc
);
2710 tok_str_add(&str
, 0);
2711 sa1
= sym_push2(&args
, sa
->v
& ~SYM_FIELD
, sa
->type
.t
, 0);
2715 /* special case for gcc var args: add an empty
2716 var arg argument if it is omitted */
2717 if (sa
&& sa
->type
.t
&& gnu_ext
)
2727 error("macro '%s' used with too few args",
2728 get_tok_str(s
->v
, 0));
2731 /* now subst each arg */
2732 mstr
= macro_arg_subst(nested_list
, mstr
, args
);
2737 tok_str_free(sa
->d
);
2743 sym_push2(nested_list
, s
->v
, 0, 0);
2744 macro_subst(tok_str
, nested_list
, mstr
, can_read_stream
);
2745 /* pop nested defined symbol */
2747 *nested_list
= sa1
->prev
;
2755 /* handle the '##' operator. Return NULL if no '##' seen. Otherwise
2756 return the resulting string (which must be freed). */
2757 static inline int *macro_twosharps(const int *macro_str
)
2762 TokenString macro_str1
;
2767 /* we search the first '##' */
2768 for(ptr
= macro_str
;;) {
2769 TOK_GET(t
, ptr
, cval
);
2770 if (t
== TOK_TWOSHARPS
)
2772 /* nothing more to do if end of string */
2777 /* we saw '##', so we need more processing to handle it */
2778 tok_str_new(¯o_str1
);
2779 for(ptr
= macro_str
;;) {
2780 TOK_GET(tok
, ptr
, tokc
);
2783 if (tok
== TOK_TWOSHARPS
)
2785 while (*ptr
== TOK_TWOSHARPS
) {
2787 if (t
&& t
!= TOK_TWOSHARPS
) {
2788 TOK_GET(t
, ptr
, cval
);
2790 /* We concatenate the two tokens */
2792 cstr_cat(&cstr
, get_tok_str(tok
, &tokc
));
2794 cstr_cat(&cstr
, get_tok_str(t
, &cval
));
2795 cstr_ccat(&cstr
, '\0');
2798 file
->buf_ptr
= cstr
.data
;
2801 if (0 == *file
->buf_ptr
)
2803 tok_str_add2(¯o_str1
, tok
, &tokc
);
2805 warning("pasting \"%.*s\" and \"%s\" does not give a valid preprocessing token",
2806 n
, cstr
.data
, (char*)cstr
.data
+ n
);
2812 tok_str_add2(¯o_str1
, tok
, &tokc
);
2814 tok_str_add(¯o_str1
, 0);
2815 return macro_str1
.str
;
2819 /* do macro substitution of macro_str and add result to
2820 (tok_str,tok_len). 'nested_list' is the list of all macros we got
2821 inside to avoid recursing. */
2822 static void macro_subst(TokenString
*tok_str
, Sym
**nested_list
,
2823 const int *macro_str
, struct macro_level
** can_read_stream
)
2830 struct macro_level ml
;
2832 /* first scan for '##' operator handling */
2834 macro_str1
= macro_twosharps(ptr
);
2839 /* NOTE: ptr == NULL can only happen if tokens are read from
2840 file stream due to a macro function call */
2843 TOK_GET(t
, ptr
, cval
);
2848 /* if nested substitution, do nothing */
2849 if (sym_find2(*nested_list
, t
))
2852 if (can_read_stream
)
2853 ml
.prev
= *can_read_stream
, *can_read_stream
= &ml
;
2854 macro_ptr
= (int *)ptr
;
2856 ret
= macro_subst_tok(tok_str
, nested_list
, s
, can_read_stream
);
2857 ptr
= (int *)macro_ptr
;
2859 if (can_read_stream
&& *can_read_stream
== &ml
)
2860 *can_read_stream
= ml
.prev
;
2865 if (!check_space(t
, &spc
))
2866 tok_str_add2(tok_str
, t
, &cval
);
2870 tok_str_free(macro_str1
);
2873 /* return next token with macro substitution */
2874 ST_FUNC
void next(void)
2876 Sym
*nested_list
, *s
;
2878 struct macro_level
*ml
;
2881 if (parse_flags
& PARSE_FLAG_SPACES
)
2886 /* if not reading from macro substituted string, then try
2887 to substitute macros */
2888 if (tok
>= TOK_IDENT
&&
2889 (parse_flags
& PARSE_FLAG_PREPROCESS
)) {
2890 s
= define_find(tok
);
2892 /* we have a macro: we try to substitute */
2896 if (macro_subst_tok(&str
, &nested_list
, s
, &ml
) == 0) {
2897 /* substitution done, NOTE: maybe empty */
2898 tok_str_add(&str
, 0);
2899 macro_ptr
= str
.str
;
2900 macro_ptr_allocated
= str
.str
;
2907 /* end of macro or end of unget buffer */
2908 if (unget_buffer_enabled
) {
2909 macro_ptr
= unget_saved_macro_ptr
;
2910 unget_buffer_enabled
= 0;
2912 /* end of macro string: free it */
2913 tok_str_free(macro_ptr_allocated
);
2914 macro_ptr_allocated
= NULL
;
2921 /* convert preprocessor tokens into C tokens */
2922 if (tok
== TOK_PPNUM
&&
2923 (parse_flags
& PARSE_FLAG_TOK_NUM
)) {
2924 parse_number((char *)tokc
.cstr
->data
);
2928 /* push back current token and set current token to 'last_tok'. Only
2929 identifier case handled for labels. */
2930 ST_INLN
void unget_tok(int last_tok
)
2934 unget_saved_macro_ptr
= macro_ptr
;
2935 unget_buffer_enabled
= 1;
2936 q
= unget_saved_buffer
;
2939 n
= tok_ext_size(tok
) - 1;
2942 *q
= 0; /* end of token string */
2947 /* better than nothing, but needs extension to handle '-E' option
2949 ST_FUNC
void preprocess_init(TCCState
*s1
)
2951 s1
->include_stack_ptr
= s1
->include_stack
;
2952 /* XXX: move that before to avoid having to initialize
2953 file->ifdef_stack_ptr ? */
2954 s1
->ifdef_stack_ptr
= s1
->ifdef_stack
;
2955 file
->ifdef_stack_ptr
= s1
->ifdef_stack_ptr
;
2957 /* XXX: not ANSI compliant: bound checking says error */
2959 s1
->pack_stack
[0] = 0;
2960 s1
->pack_stack_ptr
= s1
->pack_stack
;
2963 ST_FUNC
void preprocess_new()
2969 /* init isid table */
2970 for(i
=CH_EOF
;i
<256;i
++)
2971 isidnum_table
[i
-CH_EOF
] = isid(i
) || isnum(i
);
2973 /* add all tokens */
2975 memset(hash_ident
, 0, TOK_HASH_SIZE
* sizeof(TokenSym
*));
2977 tok_ident
= TOK_IDENT
;
2986 ts
= tok_alloc(p
, r
- p
- 1);
2991 /* Preprocess the current file */
2992 ST_FUNC
int tcc_preprocess(TCCState
*s1
)
2996 BufferedFile
*file_ref
, **iptr
, **iptr_new
;
2997 int token_seen
, line_ref
, d
;
3000 preprocess_init(s1
);
3001 define_start
= define_stack
;
3002 ch
= file
->buf_ptr
[0];
3003 tok_flags
= TOK_FLAG_BOL
| TOK_FLAG_BOF
;
3004 parse_flags
= PARSE_FLAG_ASM_COMMENTS
| PARSE_FLAG_PREPROCESS
|
3005 PARSE_FLAG_LINEFEED
| PARSE_FLAG_SPACES
;
3009 iptr
= s1
->include_stack_ptr
;
3013 if (tok
== TOK_EOF
) {
3015 } else if (file
!= file_ref
) {
3017 } else if (tok
== TOK_LINEFEED
) {
3022 } else if (!token_seen
) {
3023 d
= file
->line_num
- line_ref
;
3024 if (file
!= file_ref
|| d
< 0 || d
>= 8) {
3026 iptr_new
= s1
->include_stack_ptr
;
3027 s
= iptr_new
> iptr
? " 1"
3028 : iptr_new
< iptr
? " 2"
3029 : iptr_new
> s1
->include_stack
? " 3"
3033 fprintf(s1
->outfile
, "# %d \"%s\"%s\n", file
->line_num
, file
->filename
, s
);
3036 fputs("\n", s1
->outfile
), --d
;
3038 line_ref
= (file_ref
= file
)->line_num
;
3039 token_seen
= tok
!= TOK_LINEFEED
;
3043 fputs(get_tok_str(tok
, &tokc
), s1
->outfile
);
3045 free_defines(define_start
);