Set VT_LVAL_xxx flags for function arguments in gfunc_prolog (Daniel Glöckner)
[tinycc/daniel.git] / tcc.c
blob9855a13f586002101fe95fc4e3ea0a4887c6d655
1 /*
2 * TCC - Tiny C Compiler
3 *
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
20 #define _GNU_SOURCE
21 #include "config.h"
23 #ifdef CONFIG_TCCBOOT
25 #include "tccboot.h"
26 #define CONFIG_TCC_STATIC
28 #else
30 #include <stdlib.h>
31 #include <stdio.h>
32 #include <stdarg.h>
33 #include <string.h>
34 #include <errno.h>
35 #include <math.h>
36 #include <unistd.h>
37 #include <signal.h>
38 #include <fcntl.h>
39 #include <setjmp.h>
40 #include <time.h>
41 #ifdef _WIN32
42 #include <sys/timeb.h>
43 #include <windows.h>
44 #endif
45 #ifndef _WIN32
46 #include <sys/time.h>
47 #include <sys/ucontext.h>
48 #include <sys/mman.h>
49 #endif
51 #endif /* !CONFIG_TCCBOOT */
53 #ifndef PAGESIZE
54 #define PAGESIZE 4096
55 #endif
57 #include "elf.h"
58 #include "stab.h"
60 #ifndef O_BINARY
61 #define O_BINARY 0
62 #endif
64 #include "libtcc.h"
66 /* parser debug */
67 //#define PARSE_DEBUG
68 /* preprocessor debug */
69 //#define PP_DEBUG
70 /* include file debug */
71 //#define INC_DEBUG
73 //#define MEM_DEBUG
75 /* assembler debug */
76 //#define ASM_DEBUG
78 /* target selection */
79 //#define TCC_TARGET_I386 /* i386 code generator */
80 //#define TCC_TARGET_ARM /* ARMv4 code generator */
81 //#define TCC_TARGET_C67 /* TMS320C67xx code generator */
83 /* default target is I386 */
84 #if !defined(TCC_TARGET_I386) && !defined(TCC_TARGET_ARM) && \
85 !defined(TCC_TARGET_C67)
86 #define TCC_TARGET_I386
87 #endif
89 #if !defined(_WIN32) && !defined(TCC_UCLIBC) && !defined(TCC_TARGET_ARM) && \
90 !defined(TCC_TARGET_C67)
91 #define CONFIG_TCC_BCHECK /* enable bound checking code */
92 #endif
94 #if defined(_WIN32) && !defined(TCC_TARGET_PE)
95 #define CONFIG_TCC_STATIC
96 #endif
98 /* define it to include assembler support */
99 #if !defined(TCC_TARGET_ARM) && !defined(TCC_TARGET_C67)
100 #define CONFIG_TCC_ASM
101 #endif
103 /* object format selection */
104 #if defined(TCC_TARGET_C67)
105 #define TCC_TARGET_COFF
106 #endif
108 #define FALSE 0
109 #define false 0
110 #define TRUE 1
111 #define true 1
112 typedef int BOOL;
114 /* path to find crt1.o, crti.o and crtn.o. Only needed when generating
115 executables or dlls */
116 #define CONFIG_TCC_CRT_PREFIX "/usr/lib"
118 #define INCLUDE_STACK_SIZE 32
119 #define IFDEF_STACK_SIZE 64
120 #define VSTACK_SIZE 256
121 #define STRING_MAX_SIZE 1024
122 #define PACK_STACK_SIZE 8
124 #define TOK_HASH_SIZE 8192 /* must be a power of two */
125 #define TOK_ALLOC_INCR 512 /* must be a power of two */
126 #define TOK_MAX_SIZE 4 /* token max size in int unit when stored in string */
128 /* token symbol management */
129 typedef struct TokenSym {
130 struct TokenSym *hash_next;
131 struct Sym *sym_define; /* direct pointer to define */
132 struct Sym *sym_label; /* direct pointer to label */
133 struct Sym *sym_struct; /* direct pointer to structure */
134 struct Sym *sym_identifier; /* direct pointer to identifier */
135 int tok; /* token number */
136 int len;
137 char str[1];
138 } TokenSym;
140 #ifdef TCC_TARGET_PE
141 typedef unsigned short nwchar_t;
142 #else
143 typedef int nwchar_t;
144 #endif
146 typedef struct CString {
147 int size; /* size in bytes */
148 void *data; /* either 'char *' or 'nwchar_t *' */
149 int size_allocated;
150 void *data_allocated; /* if non NULL, data has been malloced */
151 } CString;
153 /* type definition */
154 typedef struct CType {
155 int t;
156 struct Sym *ref;
157 } CType;
159 /* constant value */
160 typedef union CValue {
161 long double ld;
162 double d;
163 float f;
164 int i;
165 unsigned int ui;
166 unsigned int ul; /* address (should be unsigned long on 64 bit cpu) */
167 long long ll;
168 unsigned long long ull;
169 struct CString *cstr;
170 void *ptr;
171 int tab[1];
172 } CValue;
174 /* value on stack */
175 typedef struct SValue {
176 CType type; /* type */
177 unsigned short r; /* register + flags */
178 unsigned short r2; /* second register, used for 'long long'
179 type. If not used, set to VT_CONST */
180 CValue c; /* constant, if VT_CONST */
181 struct Sym *sym; /* symbol, if (VT_SYM | VT_CONST) */
182 } SValue;
184 /* symbol management */
185 typedef struct Sym {
186 int v; /* symbol token */
187 int r; /* associated register */
188 int c; /* associated number */
189 CType type; /* associated type */
190 struct Sym *next; /* next related symbol */
191 struct Sym *prev; /* prev symbol in stack */
192 struct Sym *prev_tok; /* previous symbol for this token */
193 } Sym;
195 /* section definition */
196 /* XXX: use directly ELF structure for parameters ? */
197 /* special flag to indicate that the section should not be linked to
198 the other ones */
199 #define SHF_PRIVATE 0x80000000
201 typedef struct Section {
202 unsigned long data_offset; /* current data offset */
203 unsigned char *data; /* section data */
204 unsigned long data_allocated; /* used for realloc() handling */
205 int sh_name; /* elf section name (only used during output) */
206 int sh_num; /* elf section number */
207 int sh_type; /* elf section type */
208 int sh_flags; /* elf section flags */
209 int sh_info; /* elf section info */
210 int sh_addralign; /* elf section alignment */
211 int sh_entsize; /* elf entry size */
212 unsigned long sh_size; /* section size (only used during output) */
213 unsigned long sh_addr; /* address at which the section is relocated */
214 unsigned long sh_offset; /* file offset */
215 int nb_hashed_syms; /* used to resize the hash table */
216 struct Section *link; /* link to another section */
217 struct Section *reloc; /* corresponding section for relocation, if any */
218 struct Section *hash; /* hash table for symbols */
219 struct Section *next;
220 char name[1]; /* section name */
221 } Section;
223 typedef struct DLLReference {
224 int level;
225 void *handle;
226 char name[1];
227 } DLLReference;
229 /* GNUC attribute definition */
230 typedef struct AttributeDef {
231 int aligned;
232 int packed;
233 Section *section;
234 int func_attr; /* calling convention, exports, ... */
235 } AttributeDef;
237 /* -------------------------------------------------- */
238 /* gr: wrappers for casting sym->r for other purposes */
239 typedef struct {
240 unsigned
241 func_call : 8,
242 func_args : 8,
243 func_export : 1;
244 } func_attr_t;
246 #define FUNC_CALL(r) (((func_attr_t*)&(r))->func_call)
247 #define FUNC_EXPORT(r) (((func_attr_t*)&(r))->func_export)
248 #define FUNC_ARGS(r) (((func_attr_t*)&(r))->func_args)
249 #define INLINE_DEF(r) (*(int **)&(r))
250 /* -------------------------------------------------- */
252 #define SYM_STRUCT 0x40000000 /* struct/union/enum symbol space */
253 #define SYM_FIELD 0x20000000 /* struct/union field symbol space */
254 #define SYM_FIRST_ANOM 0x10000000 /* first anonymous sym */
256 /* stored in 'Sym.c' field */
257 #define FUNC_NEW 1 /* ansi function prototype */
258 #define FUNC_OLD 2 /* old function prototype */
259 #define FUNC_ELLIPSIS 3 /* ansi function prototype with ... */
261 /* stored in 'Sym.r' field */
262 #define FUNC_CDECL 0 /* standard c call */
263 #define FUNC_STDCALL 1 /* pascal c call */
264 #define FUNC_FASTCALL1 2 /* first param in %eax */
265 #define FUNC_FASTCALL2 3 /* first parameters in %eax, %edx */
266 #define FUNC_FASTCALL3 4 /* first parameter in %eax, %edx, %ecx */
267 #define FUNC_FASTCALLW 5 /* first parameter in %ecx, %edx */
269 /* field 'Sym.t' for macros */
270 #define MACRO_OBJ 0 /* object like macro */
271 #define MACRO_FUNC 1 /* function like macro */
273 /* field 'Sym.r' for C labels */
274 #define LABEL_DEFINED 0 /* label is defined */
275 #define LABEL_FORWARD 1 /* label is forward defined */
276 #define LABEL_DECLARED 2 /* label is declared but never used */
278 /* type_decl() types */
279 #define TYPE_ABSTRACT 1 /* type without variable */
280 #define TYPE_DIRECT 2 /* type with variable */
282 #define IO_BUF_SIZE 8192
284 typedef struct BufferedFile {
285 uint8_t *buf_ptr;
286 uint8_t *buf_end;
287 int fd;
288 int line_num; /* current line number - here to simplify code */
289 int ifndef_macro; /* #ifndef macro / #endif search */
290 int ifndef_macro_saved; /* saved ifndef_macro */
291 int *ifdef_stack_ptr; /* ifdef_stack value at the start of the file */
292 char inc_type; /* type of include */
293 char inc_filename[512]; /* filename specified by the user */
294 char filename[1024]; /* current filename - here to simplify code */
295 unsigned char buffer[IO_BUF_SIZE + 1]; /* extra size for CH_EOB char */
296 } BufferedFile;
298 #define CH_EOB '\\' /* end of buffer or '\0' char in file */
299 #define CH_EOF (-1) /* end of file */
301 /* parsing state (used to save parser state to reparse part of the
302 source several times) */
303 typedef struct ParseState {
304 int *macro_ptr;
305 int line_num;
306 int tok;
307 CValue tokc;
308 } ParseState;
310 /* used to record tokens */
311 typedef struct TokenString {
312 int *str;
313 int len;
314 int allocated_len;
315 int last_line_num;
316 } TokenString;
318 /* include file cache, used to find files faster and also to eliminate
319 inclusion if the include file is protected by #ifndef ... #endif */
320 typedef struct CachedInclude {
321 int ifndef_macro;
322 int hash_next; /* -1 if none */
323 char type; /* '"' or '>' to give include type */
324 char filename[1]; /* path specified in #include */
325 } CachedInclude;
327 #define CACHED_INCLUDES_HASH_SIZE 512
329 /* parser */
330 static struct BufferedFile *file;
331 static int ch, tok;
332 static CValue tokc;
333 static CString tokcstr; /* current parsed string, if any */
334 /* additional informations about token */
335 static int tok_flags;
336 #define TOK_FLAG_BOL 0x0001 /* beginning of line before */
337 #define TOK_FLAG_BOF 0x0002 /* beginning of file before */
338 #define TOK_FLAG_ENDIF 0x0004 /* a endif was found matching starting #ifdef */
339 #define TOK_FLAG_EOF 0x0008 /* end of file */
341 static int *macro_ptr, *macro_ptr_allocated;
342 static int *unget_saved_macro_ptr;
343 static int unget_saved_buffer[TOK_MAX_SIZE + 1];
344 static int unget_buffer_enabled;
345 static int parse_flags;
346 #define PARSE_FLAG_PREPROCESS 0x0001 /* activate preprocessing */
347 #define PARSE_FLAG_TOK_NUM 0x0002 /* return numbers instead of TOK_PPNUM */
348 #define PARSE_FLAG_LINEFEED 0x0004 /* line feed is returned as a
349 token. line feed is also
350 returned at eof */
351 #define PARSE_FLAG_ASM_COMMENTS 0x0008 /* '#' can be used for line comment */
353 static Section *text_section, *data_section, *bss_section; /* predefined sections */
354 static Section *cur_text_section; /* current section where function code is
355 generated */
356 #ifdef CONFIG_TCC_ASM
357 static Section *last_text_section; /* to handle .previous asm directive */
358 #endif
359 /* bound check related sections */
360 static Section *bounds_section; /* contains global data bound description */
361 static Section *lbounds_section; /* contains local data bound description */
362 /* symbol sections */
363 static Section *symtab_section, *strtab_section;
365 /* debug sections */
366 static Section *stab_section, *stabstr_section;
368 /* loc : local variable index
369 ind : output code index
370 rsym: return symbol
371 anon_sym: anonymous symbol index
373 static int rsym, anon_sym, ind, loc;
374 /* expression generation modifiers */
375 static int const_wanted; /* true if constant wanted */
376 static int nocode_wanted; /* true if no code generation wanted for an expression */
377 static int global_expr; /* true if compound literals must be allocated
378 globally (used during initializers parsing */
379 static CType func_vt; /* current function return type (used by return
380 instruction) */
381 static int func_vc;
382 static int last_line_num, last_ind, func_ind; /* debug last line number and pc */
383 static int tok_ident;
384 static TokenSym **table_ident;
385 static TokenSym *hash_ident[TOK_HASH_SIZE];
386 static char token_buf[STRING_MAX_SIZE + 1];
387 static char *funcname;
388 static Sym *global_stack, *local_stack;
389 static Sym *define_stack;
390 static Sym *global_label_stack, *local_label_stack;
391 /* symbol allocator */
392 #define SYM_POOL_NB (8192 / sizeof(Sym))
393 static Sym *sym_free_first;
394 static void **sym_pools;
395 static int nb_sym_pools;
397 static SValue vstack[VSTACK_SIZE], *vtop;
398 /* some predefined types */
399 static CType char_pointer_type, func_old_type, int_type;
400 /* true if isid(c) || isnum(c) */
401 static unsigned char isidnum_table[256-CH_EOF];
403 /* display some information during compilation */
404 static int verbose = 0;
406 /* compile with debug symbol (and use them if error during execution) */
407 static int do_debug = 0;
409 /* compile with built-in memory and bounds checker */
410 static int do_bounds_check = 0;
412 /* display benchmark infos */
413 #if !defined(LIBTCC)
414 static int do_bench = 0;
415 #endif
416 static int total_lines;
417 static int total_bytes;
419 /* use GNU C extensions */
420 static int gnu_ext = 1;
422 /* use Tiny C extensions */
423 static int tcc_ext = 1;
425 /* max number of callers shown if error */
426 static int num_callers = 6;
427 static const char **rt_bound_error_msg;
429 /* XXX: get rid of this ASAP */
430 static struct TCCState *tcc_state;
432 /* give the path of the tcc libraries */
433 static const char *tcc_lib_path = CONFIG_TCCDIR;
435 struct TCCState {
436 int output_type;
438 BufferedFile **include_stack_ptr;
439 int *ifdef_stack_ptr;
441 /* include file handling */
442 char **include_paths;
443 int nb_include_paths;
444 char **sysinclude_paths;
445 int nb_sysinclude_paths;
446 CachedInclude **cached_includes;
447 int nb_cached_includes;
449 char **library_paths;
450 int nb_library_paths;
452 /* array of all loaded dlls (including those referenced by loaded
453 dlls) */
454 DLLReference **loaded_dlls;
455 int nb_loaded_dlls;
457 /* sections */
458 Section **sections;
459 int nb_sections; /* number of sections, including first dummy section */
461 /* got handling */
462 Section *got;
463 Section *plt;
464 unsigned long *got_offsets;
465 int nb_got_offsets;
466 /* give the correspondance from symtab indexes to dynsym indexes */
467 int *symtab_to_dynsym;
469 /* temporary dynamic symbol sections (for dll loading) */
470 Section *dynsymtab_section;
471 /* exported dynamic symbol section */
472 Section *dynsym;
474 int nostdinc; /* if true, no standard headers are added */
475 int nostdlib; /* if true, no standard libraries are added */
477 int nocommon; /* if true, do not use common symbols for .bss data */
479 /* if true, static linking is performed */
480 int static_link;
482 /* soname as specified on the command line (-soname) */
483 const char *soname;
485 /* if true, all symbols are exported */
486 int rdynamic;
488 /* if true, only link in referenced objects from archive */
489 int alacarte_link;
491 /* address of text section */
492 unsigned long text_addr;
493 int has_text_addr;
495 /* output format, see TCC_OUTPUT_FORMAT_xxx */
496 int output_format;
498 /* C language options */
499 int char_is_unsigned;
500 int leading_underscore;
502 /* warning switches */
503 int warn_write_strings;
504 int warn_unsupported;
505 int warn_error;
506 int warn_none;
507 int warn_implicit_function_declaration;
509 /* error handling */
510 void *error_opaque;
511 void (*error_func)(void *opaque, const char *msg);
512 int error_set_jmp_enabled;
513 jmp_buf error_jmp_buf;
514 int nb_errors;
516 /* tiny assembler state */
517 Sym *asm_labels;
519 /* see include_stack_ptr */
520 BufferedFile *include_stack[INCLUDE_STACK_SIZE];
522 /* see ifdef_stack_ptr */
523 int ifdef_stack[IFDEF_STACK_SIZE];
525 /* see cached_includes */
526 int cached_includes_hash[CACHED_INCLUDES_HASH_SIZE];
528 /* pack stack */
529 int pack_stack[PACK_STACK_SIZE];
530 int *pack_stack_ptr;
532 /* output file for preprocessing */
533 FILE *outfile;
536 /* The current value can be: */
537 #define VT_VALMASK 0x00ff
538 #define VT_CONST 0x00f0 /* constant in vc
539 (must be first non register value) */
540 #define VT_LLOCAL 0x00f1 /* lvalue, offset on stack */
541 #define VT_LOCAL 0x00f2 /* offset on stack */
542 #define VT_CMP 0x00f3 /* the value is stored in processor flags (in vc) */
543 #define VT_JMP 0x00f4 /* value is the consequence of jmp true (even) */
544 #define VT_JMPI 0x00f5 /* value is the consequence of jmp false (odd) */
545 #define VT_LVAL 0x0100 /* var is an lvalue */
546 #define VT_SYM 0x0200 /* a symbol value is added */
547 #define VT_MUSTCAST 0x0400 /* value must be casted to be correct (used for
548 char/short stored in integer registers) */
549 #define VT_MUSTBOUND 0x0800 /* bound checking must be done before
550 dereferencing value */
551 #define VT_BOUNDED 0x8000 /* value is bounded. The address of the
552 bounding function call point is in vc */
553 #define VT_LVAL_BYTE 0x1000 /* lvalue is a byte */
554 #define VT_LVAL_SHORT 0x2000 /* lvalue is a short */
555 #define VT_LVAL_UNSIGNED 0x4000 /* lvalue is unsigned */
556 #define VT_LVAL_TYPE (VT_LVAL_BYTE | VT_LVAL_SHORT | VT_LVAL_UNSIGNED)
558 /* types */
559 #define VT_INT 0 /* integer type */
560 #define VT_BYTE 1 /* signed byte type */
561 #define VT_SHORT 2 /* short type */
562 #define VT_VOID 3 /* void type */
563 #define VT_PTR 4 /* pointer */
564 #define VT_ENUM 5 /* enum definition */
565 #define VT_FUNC 6 /* function type */
566 #define VT_STRUCT 7 /* struct/union definition */
567 #define VT_FLOAT 8 /* IEEE float */
568 #define VT_DOUBLE 9 /* IEEE double */
569 #define VT_LDOUBLE 10 /* IEEE long double */
570 #define VT_BOOL 11 /* ISOC99 boolean type */
571 #define VT_LLONG 12 /* 64 bit integer */
572 #define VT_LONG 13 /* long integer (NEVER USED as type, only
573 during parsing) */
574 #define VT_BTYPE 0x000f /* mask for basic type */
575 #define VT_UNSIGNED 0x0010 /* unsigned type */
576 #define VT_ARRAY 0x0020 /* array type (also has VT_PTR) */
577 #define VT_BITFIELD 0x0040 /* bitfield modifier */
578 #define VT_CONSTANT 0x0800 /* const modifier */
579 #define VT_VOLATILE 0x1000 /* volatile modifier */
580 #define VT_SIGNED 0x2000 /* signed type */
582 /* storage */
583 #define VT_EXTERN 0x00000080 /* extern definition */
584 #define VT_STATIC 0x00000100 /* static variable */
585 #define VT_TYPEDEF 0x00000200 /* typedef definition */
586 #define VT_INLINE 0x00000400 /* inline definition */
588 #define VT_STRUCT_SHIFT 16 /* shift for bitfield shift values */
590 /* type mask (except storage) */
591 #define VT_STORAGE (VT_EXTERN | VT_STATIC | VT_TYPEDEF | VT_INLINE)
592 #define VT_TYPE (~(VT_STORAGE))
594 /* token values */
596 /* warning: the following compare tokens depend on i386 asm code */
597 #define TOK_ULT 0x92
598 #define TOK_UGE 0x93
599 #define TOK_EQ 0x94
600 #define TOK_NE 0x95
601 #define TOK_ULE 0x96
602 #define TOK_UGT 0x97
603 #define TOK_Nset 0x98
604 #define TOK_Nclear 0x99
605 #define TOK_LT 0x9c
606 #define TOK_GE 0x9d
607 #define TOK_LE 0x9e
608 #define TOK_GT 0x9f
610 #define TOK_LAND 0xa0
611 #define TOK_LOR 0xa1
613 #define TOK_DEC 0xa2
614 #define TOK_MID 0xa3 /* inc/dec, to void constant */
615 #define TOK_INC 0xa4
616 #define TOK_UDIV 0xb0 /* unsigned division */
617 #define TOK_UMOD 0xb1 /* unsigned modulo */
618 #define TOK_PDIV 0xb2 /* fast division with undefined rounding for pointers */
619 #define TOK_CINT 0xb3 /* number in tokc */
620 #define TOK_CCHAR 0xb4 /* char constant in tokc */
621 #define TOK_STR 0xb5 /* pointer to string in tokc */
622 #define TOK_TWOSHARPS 0xb6 /* ## preprocessing token */
623 #define TOK_LCHAR 0xb7
624 #define TOK_LSTR 0xb8
625 #define TOK_CFLOAT 0xb9 /* float constant */
626 #define TOK_LINENUM 0xba /* line number info */
627 #define TOK_CDOUBLE 0xc0 /* double constant */
628 #define TOK_CLDOUBLE 0xc1 /* long double constant */
629 #define TOK_UMULL 0xc2 /* unsigned 32x32 -> 64 mul */
630 #define TOK_ADDC1 0xc3 /* add with carry generation */
631 #define TOK_ADDC2 0xc4 /* add with carry use */
632 #define TOK_SUBC1 0xc5 /* add with carry generation */
633 #define TOK_SUBC2 0xc6 /* add with carry use */
634 #define TOK_CUINT 0xc8 /* unsigned int constant */
635 #define TOK_CLLONG 0xc9 /* long long constant */
636 #define TOK_CULLONG 0xca /* unsigned long long constant */
637 #define TOK_ARROW 0xcb
638 #define TOK_DOTS 0xcc /* three dots */
639 #define TOK_SHR 0xcd /* unsigned shift right */
640 #define TOK_PPNUM 0xce /* preprocessor number */
642 #define TOK_SHL 0x01 /* shift left */
643 #define TOK_SAR 0x02 /* signed shift right */
645 /* assignement operators : normal operator or 0x80 */
646 #define TOK_A_MOD 0xa5
647 #define TOK_A_AND 0xa6
648 #define TOK_A_MUL 0xaa
649 #define TOK_A_ADD 0xab
650 #define TOK_A_SUB 0xad
651 #define TOK_A_DIV 0xaf
652 #define TOK_A_XOR 0xde
653 #define TOK_A_OR 0xfc
654 #define TOK_A_SHL 0x81
655 #define TOK_A_SAR 0x82
657 #ifndef offsetof
658 #define offsetof(type, field) ((size_t) &((type *)0)->field)
659 #endif
661 #ifndef countof
662 #define countof(tab) (sizeof(tab) / sizeof((tab)[0]))
663 #endif
665 /* WARNING: the content of this string encodes token numbers */
666 static char tok_two_chars[] = "<=\236>=\235!=\225&&\240||\241++\244--\242==\224<<\1>>\2+=\253-=\255*=\252/=\257%=\245&=\246^=\336|=\374->\313..\250##\266";
668 #define TOK_EOF (-1) /* end of file */
669 #define TOK_LINEFEED 10 /* line feed */
671 /* all identificators and strings have token above that */
672 #define TOK_IDENT 256
674 /* only used for i386 asm opcodes definitions */
675 #define DEF_ASM(x) DEF(TOK_ASM_ ## x, #x)
677 #define DEF_BWL(x) \
678 DEF(TOK_ASM_ ## x ## b, #x "b") \
679 DEF(TOK_ASM_ ## x ## w, #x "w") \
680 DEF(TOK_ASM_ ## x ## l, #x "l") \
681 DEF(TOK_ASM_ ## x, #x)
683 #define DEF_WL(x) \
684 DEF(TOK_ASM_ ## x ## w, #x "w") \
685 DEF(TOK_ASM_ ## x ## l, #x "l") \
686 DEF(TOK_ASM_ ## x, #x)
688 #define DEF_FP1(x) \
689 DEF(TOK_ASM_ ## f ## x ## s, "f" #x "s") \
690 DEF(TOK_ASM_ ## fi ## x ## l, "fi" #x "l") \
691 DEF(TOK_ASM_ ## f ## x ## l, "f" #x "l") \
692 DEF(TOK_ASM_ ## fi ## x ## s, "fi" #x "s")
694 #define DEF_FP(x) \
695 DEF(TOK_ASM_ ## f ## x, "f" #x ) \
696 DEF(TOK_ASM_ ## f ## x ## p, "f" #x "p") \
697 DEF_FP1(x)
699 #define DEF_ASMTEST(x) \
700 DEF_ASM(x ## o) \
701 DEF_ASM(x ## no) \
702 DEF_ASM(x ## b) \
703 DEF_ASM(x ## c) \
704 DEF_ASM(x ## nae) \
705 DEF_ASM(x ## nb) \
706 DEF_ASM(x ## nc) \
707 DEF_ASM(x ## ae) \
708 DEF_ASM(x ## e) \
709 DEF_ASM(x ## z) \
710 DEF_ASM(x ## ne) \
711 DEF_ASM(x ## nz) \
712 DEF_ASM(x ## be) \
713 DEF_ASM(x ## na) \
714 DEF_ASM(x ## nbe) \
715 DEF_ASM(x ## a) \
716 DEF_ASM(x ## s) \
717 DEF_ASM(x ## ns) \
718 DEF_ASM(x ## p) \
719 DEF_ASM(x ## pe) \
720 DEF_ASM(x ## np) \
721 DEF_ASM(x ## po) \
722 DEF_ASM(x ## l) \
723 DEF_ASM(x ## nge) \
724 DEF_ASM(x ## nl) \
725 DEF_ASM(x ## ge) \
726 DEF_ASM(x ## le) \
727 DEF_ASM(x ## ng) \
728 DEF_ASM(x ## nle) \
729 DEF_ASM(x ## g)
731 #define TOK_ASM_int TOK_INT
733 enum tcc_token {
734 TOK_LAST = TOK_IDENT - 1,
735 #define DEF(id, str) id,
736 #include "tcctok.h"
737 #undef DEF
740 static const char tcc_keywords[] =
741 #define DEF(id, str) str "\0"
742 #include "tcctok.h"
743 #undef DEF
746 #define TOK_UIDENT TOK_DEFINE
748 #ifdef _WIN32
749 #define snprintf _snprintf
750 #define vsnprintf _vsnprintf
751 #ifndef __GNUC__
752 #define strtold (long double)strtod
753 #define strtof (float)strtod
754 #define strtoll (long long)strtol
755 #endif
756 #elif defined(TCC_UCLIBC) || defined(__FreeBSD__) || defined(__DragonFly__) \
757 || defined(__OpenBSD__)
758 /* currently incorrect */
759 long double strtold(const char *nptr, char **endptr)
761 return (long double)strtod(nptr, endptr);
763 float strtof(const char *nptr, char **endptr)
765 return (float)strtod(nptr, endptr);
767 #else
768 /* XXX: need to define this to use them in non ISOC99 context */
769 extern float strtof (const char *__nptr, char **__endptr);
770 extern long double strtold (const char *__nptr, char **__endptr);
771 #endif
773 static char *pstrcpy(char *buf, int buf_size, const char *s);
774 static char *pstrcat(char *buf, int buf_size, const char *s);
775 static char *tcc_basename(const char *name);
776 static char *tcc_fileextension (const char *p);
778 static void next(void);
779 static void next_nomacro(void);
780 static void parse_expr_type(CType *type);
781 static void expr_type(CType *type);
782 static void unary_type(CType *type);
783 static void block(int *bsym, int *csym, int *case_sym, int *def_sym,
784 int case_reg, int is_expr);
785 static int expr_const(void);
786 static void expr_eq(void);
787 static void gexpr(void);
788 static void gen_inline_functions(void);
789 static void decl(int l);
790 static void decl_initializer(CType *type, Section *sec, unsigned long c,
791 int first, int size_only);
792 static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r,
793 int has_init, int v, int scope);
794 int gv(int rc);
795 void gv2(int rc1, int rc2);
796 void move_reg(int r, int s);
797 void save_regs(int n);
798 void save_reg(int r);
799 void vpop(void);
800 void vswap(void);
801 void vdup(void);
802 int get_reg(int rc);
803 int get_reg_ex(int rc,int rc2);
805 struct macro_level {
806 struct macro_level *prev;
807 int *p;
810 static void macro_subst(TokenString *tok_str, Sym **nested_list,
811 const int *macro_str, struct macro_level **can_read_stream);
812 void gen_op(int op);
813 void force_charshort_cast(int t);
814 static void gen_cast(CType *type);
815 void vstore(void);
816 static Sym *sym_find(int v);
817 static Sym *sym_push(int v, CType *type, int r, int c);
819 /* type handling */
820 static int type_size(CType *type, int *a);
821 static inline CType *pointed_type(CType *type);
822 static int pointed_size(CType *type);
823 static int lvalue_type(int t);
824 static int parse_btype(CType *type, AttributeDef *ad);
825 static void type_decl(CType *type, AttributeDef *ad, int *v, int td);
826 static int compare_types(CType *type1, CType *type2, int unqualified);
827 static int is_compatible_types(CType *type1, CType *type2);
828 static int is_compatible_parameter_types(CType *type1, CType *type2);
830 int ieee_finite(double d);
831 void error(const char *fmt, ...);
832 void vpushi(int v);
833 void vrott(int n);
834 void vnrott(int n);
835 void lexpand_nr(void);
836 static void vpush_global_sym(CType *type, int v);
837 void vset(CType *type, int r, int v);
838 void type_to_str(char *buf, int buf_size,
839 CType *type, const char *varstr);
840 char *get_tok_str(int v, CValue *cv);
841 static Sym *get_sym_ref(CType *type, Section *sec,
842 unsigned long offset, unsigned long size);
843 static Sym *external_global_sym(int v, CType *type, int r);
845 /* section generation */
846 static void section_realloc(Section *sec, unsigned long new_size);
847 static void *section_ptr_add(Section *sec, unsigned long size);
848 static void put_extern_sym(Sym *sym, Section *section,
849 unsigned long value, unsigned long size);
850 static void greloc(Section *s, Sym *sym, unsigned long addr, int type);
851 static int put_elf_str(Section *s, const char *sym);
852 static int put_elf_sym(Section *s,
853 unsigned long value, unsigned long size,
854 int info, int other, int shndx, const char *name);
855 static int add_elf_sym(Section *s, unsigned long value, unsigned long size,
856 int info, int other, int sh_num, const char *name);
857 static void put_elf_reloc(Section *symtab, Section *s, unsigned long offset,
858 int type, int symbol);
859 static void put_stabs(const char *str, int type, int other, int desc,
860 unsigned long value);
861 static void put_stabs_r(const char *str, int type, int other, int desc,
862 unsigned long value, Section *sec, int sym_index);
863 static void put_stabn(int type, int other, int desc, int value);
864 static void put_stabd(int type, int other, int desc);
865 static int tcc_add_dll(TCCState *s, const char *filename, int flags);
867 #define AFF_PRINT_ERROR 0x0001 /* print error if file not found */
868 #define AFF_REFERENCED_DLL 0x0002 /* load a referenced dll from another dll */
869 #define AFF_PREPROCESS 0x0004 /* preprocess file */
870 static int tcc_add_file_internal(TCCState *s, const char *filename, int flags);
872 /* tcccoff.c */
873 int tcc_output_coff(TCCState *s1, FILE *f);
875 /* tccpe.c */
876 void *resolve_sym(TCCState *s1, const char *sym, int type);
877 int pe_load_def_file(struct TCCState *s1, int fd);
878 int pe_test_res_file(void *v, int size);
879 int pe_load_res_file(struct TCCState *s1, int fd);
880 void pe_add_runtime(struct TCCState *s1);
881 void pe_guess_outfile(char *objfilename, int output_type);
882 int pe_output_file(struct TCCState *s1, const char *filename);
884 /* tccasm.c */
886 #ifdef CONFIG_TCC_ASM
888 typedef struct ExprValue {
889 uint32_t v;
890 Sym *sym;
891 } ExprValue;
893 #define MAX_ASM_OPERANDS 30
895 typedef struct ASMOperand {
896 int id; /* GCC 3 optionnal identifier (0 if number only supported */
897 char *constraint;
898 char asm_str[16]; /* computed asm string for operand */
899 SValue *vt; /* C value of the expression */
900 int ref_index; /* if >= 0, gives reference to a output constraint */
901 int input_index; /* if >= 0, gives reference to an input constraint */
902 int priority; /* priority, used to assign registers */
903 int reg; /* if >= 0, register number used for this operand */
904 int is_llong; /* true if double register value */
905 int is_memory; /* true if memory operand */
906 int is_rw; /* for '+' modifier */
907 } ASMOperand;
909 static void asm_expr(TCCState *s1, ExprValue *pe);
910 static int asm_int_expr(TCCState *s1);
911 static int find_constraint(ASMOperand *operands, int nb_operands,
912 const char *name, const char **pp);
914 static int tcc_assemble(TCCState *s1, int do_preprocess);
916 #endif
918 static void asm_instr(void);
919 static void asm_global_instr(void);
921 /* true if float/double/long double type */
922 static inline int is_float(int t)
924 int bt;
925 bt = t & VT_BTYPE;
926 return bt == VT_LDOUBLE || bt == VT_DOUBLE || bt == VT_FLOAT;
929 #ifdef TCC_TARGET_I386
930 #include "i386-gen.c"
931 #endif
933 #ifdef TCC_TARGET_ARM
934 #include "arm-gen.c"
935 #endif
937 #ifdef TCC_TARGET_C67
938 #include "c67-gen.c"
939 #endif
941 #ifdef CONFIG_TCC_STATIC
943 #define RTLD_LAZY 0x001
944 #define RTLD_NOW 0x002
945 #define RTLD_GLOBAL 0x100
946 #define RTLD_DEFAULT NULL
948 /* dummy function for profiling */
949 void *dlopen(const char *filename, int flag)
951 return NULL;
954 const char *dlerror(void)
956 return "error";
959 typedef struct TCCSyms {
960 char *str;
961 void *ptr;
962 } TCCSyms;
964 #define TCCSYM(a) { #a, &a, },
966 /* add the symbol you want here if no dynamic linking is done */
967 static TCCSyms tcc_syms[] = {
968 #if !defined(CONFIG_TCCBOOT)
969 TCCSYM(printf)
970 TCCSYM(fprintf)
971 TCCSYM(fopen)
972 TCCSYM(fclose)
973 #endif
974 { NULL, NULL },
977 void *resolve_sym(TCCState *s1, const char *symbol, int type)
979 TCCSyms *p;
980 p = tcc_syms;
981 while (p->str != NULL) {
982 if (!strcmp(p->str, symbol))
983 return p->ptr;
984 p++;
986 return NULL;
989 #elif !defined(_WIN32)
991 #include <dlfcn.h>
993 void *resolve_sym(TCCState *s1, const char *sym, int type)
995 return dlsym(RTLD_DEFAULT, sym);
998 #endif
1000 /********************************************************/
1002 /* we use our own 'finite' function to avoid potential problems with
1003 non standard math libs */
1004 /* XXX: endianness dependent */
1005 int ieee_finite(double d)
1007 int *p = (int *)&d;
1008 return ((unsigned)((p[1] | 0x800fffff) + 1)) >> 31;
1011 /* copy a string and truncate it. */
1012 static char *pstrcpy(char *buf, int buf_size, const char *s)
1014 char *q, *q_end;
1015 int c;
1017 if (buf_size > 0) {
1018 q = buf;
1019 q_end = buf + buf_size - 1;
1020 while (q < q_end) {
1021 c = *s++;
1022 if (c == '\0')
1023 break;
1024 *q++ = c;
1026 *q = '\0';
1028 return buf;
1031 /* strcat and truncate. */
1032 static char *pstrcat(char *buf, int buf_size, const char *s)
1034 int len;
1035 len = strlen(buf);
1036 if (len < buf_size)
1037 pstrcpy(buf + len, buf_size - len, s);
1038 return buf;
1041 #ifndef LIBTCC
1042 static int strstart(const char *str, const char *val, const char **ptr)
1044 const char *p, *q;
1045 p = str;
1046 q = val;
1047 while (*q != '\0') {
1048 if (*p != *q)
1049 return 0;
1050 p++;
1051 q++;
1053 if (ptr)
1054 *ptr = p;
1055 return 1;
1057 #endif
1059 /* extract the basename of a file */
1060 static char *tcc_basename(const char *name)
1062 char *p = strchr(name, 0);
1063 while (p > name
1064 && p[-1] != '/'
1065 #ifdef _WIN32
1066 && p[-1] != '\\'
1067 #endif
1069 --p;
1070 return p;
1073 static char *tcc_fileextension (const char *name)
1075 char *b = tcc_basename(name);
1076 char *e = strrchr(b, '.');
1077 return e ? e : strchr(b, 0);
1080 #ifdef _WIN32
1081 char *normalize_slashes(char *path)
1083 char *p;
1084 for (p = path; *p; ++p)
1085 if (*p == '\\')
1086 *p = '/';
1087 return path;
1090 char *w32_tcc_lib_path(void)
1092 /* on win32, we suppose the lib and includes are at the location
1093 of 'tcc.exe' */
1094 char path[1024], *p;
1095 GetModuleFileNameA(NULL, path, sizeof path);
1096 p = tcc_basename(normalize_slashes(strlwr(path)));
1097 if (p - 5 > path && 0 == strncmp(p - 5, "/bin/", 5))
1098 p -= 5;
1099 else if (p > path)
1100 p--;
1101 *p = 0;
1102 return strdup(path);
1104 #endif
1106 void set_pages_executable(void *ptr, unsigned long length)
1108 #ifdef _WIN32
1109 unsigned long old_protect;
1110 VirtualProtect(ptr, length, PAGE_EXECUTE_READWRITE, &old_protect);
1111 #else
1112 unsigned long start, end;
1113 start = (unsigned long)ptr & ~(PAGESIZE - 1);
1114 end = (unsigned long)ptr + length;
1115 end = (end + PAGESIZE - 1) & ~(PAGESIZE - 1);
1116 mprotect((void *)start, end - start, PROT_READ | PROT_WRITE | PROT_EXEC);
1117 #endif
1120 /* memory management */
1121 #ifdef MEM_DEBUG
1122 int mem_cur_size;
1123 int mem_max_size;
1124 unsigned malloc_usable_size(void*);
1125 #endif
1127 static inline void tcc_free(void *ptr)
1129 #ifdef MEM_DEBUG
1130 mem_cur_size -= malloc_usable_size(ptr);
1131 #endif
1132 free(ptr);
1135 static void *tcc_malloc(unsigned long size)
1137 void *ptr;
1138 ptr = malloc(size);
1139 if (!ptr && size)
1140 error("memory full");
1141 #ifdef MEM_DEBUG
1142 mem_cur_size += malloc_usable_size(ptr);
1143 if (mem_cur_size > mem_max_size)
1144 mem_max_size = mem_cur_size;
1145 #endif
1146 return ptr;
1149 static void *tcc_mallocz(unsigned long size)
1151 void *ptr;
1152 ptr = tcc_malloc(size);
1153 memset(ptr, 0, size);
1154 return ptr;
1157 static inline void *tcc_realloc(void *ptr, unsigned long size)
1159 void *ptr1;
1160 #ifdef MEM_DEBUG
1161 mem_cur_size -= malloc_usable_size(ptr);
1162 #endif
1163 ptr1 = realloc(ptr, size);
1164 #ifdef MEM_DEBUG
1165 /* NOTE: count not correct if alloc error, but not critical */
1166 mem_cur_size += malloc_usable_size(ptr1);
1167 if (mem_cur_size > mem_max_size)
1168 mem_max_size = mem_cur_size;
1169 #endif
1170 return ptr1;
1173 static char *tcc_strdup(const char *str)
1175 char *ptr;
1176 ptr = tcc_malloc(strlen(str) + 1);
1177 strcpy(ptr, str);
1178 return ptr;
1181 #define free(p) use_tcc_free(p)
1182 #define malloc(s) use_tcc_malloc(s)
1183 #define realloc(p, s) use_tcc_realloc(p, s)
1185 static void dynarray_add(void ***ptab, int *nb_ptr, void *data)
1187 int nb, nb_alloc;
1188 void **pp;
1190 nb = *nb_ptr;
1191 pp = *ptab;
1192 /* every power of two we double array size */
1193 if ((nb & (nb - 1)) == 0) {
1194 if (!nb)
1195 nb_alloc = 1;
1196 else
1197 nb_alloc = nb * 2;
1198 pp = tcc_realloc(pp, nb_alloc * sizeof(void *));
1199 if (!pp)
1200 error("memory full");
1201 *ptab = pp;
1203 pp[nb++] = data;
1204 *nb_ptr = nb;
1207 static void dynarray_reset(void *pp, int *n)
1209 void **p;
1210 for (p = *(void***)pp; *n; ++p, --*n)
1211 if (*p)
1212 tcc_free(*p);
1213 tcc_free(*(void**)pp);
1214 *(void**)pp = NULL;
1217 /* symbol allocator */
1218 static Sym *__sym_malloc(void)
1220 Sym *sym_pool, *sym, *last_sym;
1221 int i;
1223 sym_pool = tcc_malloc(SYM_POOL_NB * sizeof(Sym));
1224 dynarray_add(&sym_pools, &nb_sym_pools, sym_pool);
1226 last_sym = sym_free_first;
1227 sym = sym_pool;
1228 for(i = 0; i < SYM_POOL_NB; i++) {
1229 sym->next = last_sym;
1230 last_sym = sym;
1231 sym++;
1233 sym_free_first = last_sym;
1234 return last_sym;
1237 static inline Sym *sym_malloc(void)
1239 Sym *sym;
1240 sym = sym_free_first;
1241 if (!sym)
1242 sym = __sym_malloc();
1243 sym_free_first = sym->next;
1244 return sym;
1247 static inline void sym_free(Sym *sym)
1249 sym->next = sym_free_first;
1250 sym_free_first = sym;
1253 Section *new_section(TCCState *s1, const char *name, int sh_type, int sh_flags)
1255 Section *sec;
1257 sec = tcc_mallocz(sizeof(Section) + strlen(name));
1258 strcpy(sec->name, name);
1259 sec->sh_type = sh_type;
1260 sec->sh_flags = sh_flags;
1261 switch(sh_type) {
1262 case SHT_HASH:
1263 case SHT_REL:
1264 case SHT_DYNSYM:
1265 case SHT_SYMTAB:
1266 case SHT_DYNAMIC:
1267 sec->sh_addralign = 4;
1268 break;
1269 case SHT_STRTAB:
1270 sec->sh_addralign = 1;
1271 break;
1272 default:
1273 sec->sh_addralign = 32; /* default conservative alignment */
1274 break;
1277 /* only add section if not private */
1278 if (!(sh_flags & SHF_PRIVATE)) {
1279 sec->sh_num = s1->nb_sections;
1280 dynarray_add((void ***)&s1->sections, &s1->nb_sections, sec);
1282 return sec;
1285 static void free_section(Section *s)
1287 if (s->link && (s->link->sh_flags & SHF_PRIVATE))
1288 free_section(s->link);
1289 if (s->hash && (s->link->sh_flags & SHF_PRIVATE))
1290 s->hash->link = NULL, free_section(s->hash);
1291 tcc_free(s->data);
1292 tcc_free(s);
1295 /* realloc section and set its content to zero */
1296 static void section_realloc(Section *sec, unsigned long new_size)
1298 unsigned long size;
1299 unsigned char *data;
1301 size = sec->data_allocated;
1302 if (size == 0)
1303 size = 1;
1304 while (size < new_size)
1305 size = size * 2;
1306 data = tcc_realloc(sec->data, size);
1307 if (!data)
1308 error("memory full");
1309 memset(data + sec->data_allocated, 0, size - sec->data_allocated);
1310 sec->data = data;
1311 sec->data_allocated = size;
1314 /* reserve at least 'size' bytes in section 'sec' from
1315 sec->data_offset. */
1316 static void *section_ptr_add(Section *sec, unsigned long size)
1318 unsigned long offset, offset1;
1320 offset = sec->data_offset;
1321 offset1 = offset + size;
1322 if (offset1 > sec->data_allocated)
1323 section_realloc(sec, offset1);
1324 sec->data_offset = offset1;
1325 return sec->data + offset;
1328 /* return a reference to a section, and create it if it does not
1329 exists */
1330 Section *find_section(TCCState *s1, const char *name)
1332 Section *sec;
1333 int i;
1334 for(i = 1; i < s1->nb_sections; i++) {
1335 sec = s1->sections[i];
1336 if (!strcmp(name, sec->name))
1337 return sec;
1339 /* sections are created as PROGBITS */
1340 return new_section(s1, name, SHT_PROGBITS, SHF_ALLOC);
1343 #define SECTION_ABS ((void *)1)
1345 /* update sym->c so that it points to an external symbol in section
1346 'section' with value 'value' */
1347 static void put_extern_sym2(Sym *sym, Section *section,
1348 unsigned long value, unsigned long size,
1349 int can_add_underscore)
1351 int sym_type, sym_bind, sh_num, info, other, attr;
1352 Elf32_Sym *esym;
1353 const char *name;
1354 char buf1[256];
1356 if (section == NULL)
1357 sh_num = SHN_UNDEF;
1358 else if (section == SECTION_ABS)
1359 sh_num = SHN_ABS;
1360 else
1361 sh_num = section->sh_num;
1363 other = attr = 0;
1365 if ((sym->type.t & VT_BTYPE) == VT_FUNC) {
1366 sym_type = STT_FUNC;
1367 #ifdef TCC_TARGET_PE
1368 if (sym->type.ref)
1369 attr = sym->type.ref->r;
1370 if (FUNC_EXPORT(attr))
1371 other |= 1;
1372 if (FUNC_CALL(attr) == FUNC_STDCALL)
1373 other |= 2;
1374 #endif
1375 } else {
1376 sym_type = STT_OBJECT;
1379 if (sym->type.t & VT_STATIC)
1380 sym_bind = STB_LOCAL;
1381 else
1382 sym_bind = STB_GLOBAL;
1384 if (!sym->c) {
1385 name = get_tok_str(sym->v, NULL);
1386 #ifdef CONFIG_TCC_BCHECK
1387 if (do_bounds_check) {
1388 char buf[32];
1390 /* XXX: avoid doing that for statics ? */
1391 /* if bound checking is activated, we change some function
1392 names by adding the "__bound" prefix */
1393 switch(sym->v) {
1394 #if 0
1395 /* XXX: we rely only on malloc hooks */
1396 case TOK_malloc:
1397 case TOK_free:
1398 case TOK_realloc:
1399 case TOK_memalign:
1400 case TOK_calloc:
1401 #endif
1402 case TOK_memcpy:
1403 case TOK_memmove:
1404 case TOK_memset:
1405 case TOK_strlen:
1406 case TOK_strcpy:
1407 case TOK__alloca:
1408 strcpy(buf, "__bound_");
1409 strcat(buf, name);
1410 name = buf;
1411 break;
1414 #endif
1416 #ifdef TCC_TARGET_PE
1417 if ((other & 2) && can_add_underscore) {
1418 sprintf(buf1, "_%s@%d", name, FUNC_ARGS(attr));
1419 name = buf1;
1420 } else
1421 #endif
1422 if (tcc_state->leading_underscore && can_add_underscore) {
1423 buf1[0] = '_';
1424 pstrcpy(buf1 + 1, sizeof(buf1) - 1, name);
1425 name = buf1;
1427 info = ELF32_ST_INFO(sym_bind, sym_type);
1428 sym->c = add_elf_sym(symtab_section, value, size, info, other, sh_num, name);
1429 } else {
1430 esym = &((Elf32_Sym *)symtab_section->data)[sym->c];
1431 esym->st_value = value;
1432 esym->st_size = size;
1433 esym->st_shndx = sh_num;
1434 esym->st_other |= other;
1438 static void put_extern_sym(Sym *sym, Section *section,
1439 unsigned long value, unsigned long size)
1441 put_extern_sym2(sym, section, value, size, 1);
1444 /* add a new relocation entry to symbol 'sym' in section 's' */
1445 static void greloc(Section *s, Sym *sym, unsigned long offset, int type)
1447 if (!sym->c)
1448 put_extern_sym(sym, NULL, 0, 0);
1449 /* now we can add ELF relocation info */
1450 put_elf_reloc(symtab_section, s, offset, type, sym->c);
1453 static inline int isid(int c)
1455 return (c >= 'a' && c <= 'z') ||
1456 (c >= 'A' && c <= 'Z') ||
1457 c == '_';
1460 static inline int isnum(int c)
1462 return c >= '0' && c <= '9';
1465 static inline int isoct(int c)
1467 return c >= '0' && c <= '7';
1470 static inline int toup(int c)
1472 if (c >= 'a' && c <= 'z')
1473 return c - 'a' + 'A';
1474 else
1475 return c;
1478 static void strcat_vprintf(char *buf, int buf_size, const char *fmt, va_list ap)
1480 int len;
1481 len = strlen(buf);
1482 vsnprintf(buf + len, buf_size - len, fmt, ap);
1485 static void strcat_printf(char *buf, int buf_size, const char *fmt, ...)
1487 va_list ap;
1488 va_start(ap, fmt);
1489 strcat_vprintf(buf, buf_size, fmt, ap);
1490 va_end(ap);
1493 void error1(TCCState *s1, int is_warning, const char *fmt, va_list ap)
1495 char buf[2048];
1496 BufferedFile **f;
1498 buf[0] = '\0';
1499 if (file) {
1500 for(f = s1->include_stack; f < s1->include_stack_ptr; f++)
1501 strcat_printf(buf, sizeof(buf), "In file included from %s:%d:\n",
1502 (*f)->filename, (*f)->line_num);
1503 if (file->line_num > 0) {
1504 strcat_printf(buf, sizeof(buf),
1505 "%s:%d: ", file->filename, file->line_num);
1506 } else {
1507 strcat_printf(buf, sizeof(buf),
1508 "%s: ", file->filename);
1510 } else {
1511 strcat_printf(buf, sizeof(buf),
1512 "tcc: ");
1514 if (is_warning)
1515 strcat_printf(buf, sizeof(buf), "warning: ");
1516 strcat_vprintf(buf, sizeof(buf), fmt, ap);
1518 if (!s1->error_func) {
1519 /* default case: stderr */
1520 fprintf(stderr, "%s\n", buf);
1521 } else {
1522 s1->error_func(s1->error_opaque, buf);
1524 if (!is_warning || s1->warn_error)
1525 s1->nb_errors++;
1528 #ifdef LIBTCC
1529 void tcc_set_error_func(TCCState *s, void *error_opaque,
1530 void (*error_func)(void *opaque, const char *msg))
1532 s->error_opaque = error_opaque;
1533 s->error_func = error_func;
1535 #endif
1537 /* error without aborting current compilation */
1538 void error_noabort(const char *fmt, ...)
1540 TCCState *s1 = tcc_state;
1541 va_list ap;
1543 va_start(ap, fmt);
1544 error1(s1, 0, fmt, ap);
1545 va_end(ap);
1548 void error(const char *fmt, ...)
1550 TCCState *s1 = tcc_state;
1551 va_list ap;
1553 va_start(ap, fmt);
1554 error1(s1, 0, fmt, ap);
1555 va_end(ap);
1556 /* better than nothing: in some cases, we accept to handle errors */
1557 if (s1->error_set_jmp_enabled) {
1558 longjmp(s1->error_jmp_buf, 1);
1559 } else {
1560 /* XXX: eliminate this someday */
1561 exit(1);
1565 void expect(const char *msg)
1567 error("%s expected", msg);
1570 void warning(const char *fmt, ...)
1572 TCCState *s1 = tcc_state;
1573 va_list ap;
1575 if (s1->warn_none)
1576 return;
1578 va_start(ap, fmt);
1579 error1(s1, 1, fmt, ap);
1580 va_end(ap);
1583 void skip(int c)
1585 if (tok != c)
1586 error("'%c' expected", c);
1587 next();
1590 static void test_lvalue(void)
1592 if (!(vtop->r & VT_LVAL))
1593 expect("lvalue");
1596 /* allocate a new token */
1597 static TokenSym *tok_alloc_new(TokenSym **pts, const char *str, int len)
1599 TokenSym *ts, **ptable;
1600 int i;
1602 if (tok_ident >= SYM_FIRST_ANOM)
1603 error("memory full");
1605 /* expand token table if needed */
1606 i = tok_ident - TOK_IDENT;
1607 if ((i % TOK_ALLOC_INCR) == 0) {
1608 ptable = tcc_realloc(table_ident, (i + TOK_ALLOC_INCR) * sizeof(TokenSym *));
1609 if (!ptable)
1610 error("memory full");
1611 table_ident = ptable;
1614 ts = tcc_malloc(sizeof(TokenSym) + len);
1615 table_ident[i] = ts;
1616 ts->tok = tok_ident++;
1617 ts->sym_define = NULL;
1618 ts->sym_label = NULL;
1619 ts->sym_struct = NULL;
1620 ts->sym_identifier = NULL;
1621 ts->len = len;
1622 ts->hash_next = NULL;
1623 memcpy(ts->str, str, len);
1624 ts->str[len] = '\0';
1625 *pts = ts;
1626 return ts;
1629 #define TOK_HASH_INIT 1
1630 #define TOK_HASH_FUNC(h, c) ((h) * 263 + (c))
1632 /* find a token and add it if not found */
1633 static TokenSym *tok_alloc(const char *str, int len)
1635 TokenSym *ts, **pts;
1636 int i;
1637 unsigned int h;
1639 h = TOK_HASH_INIT;
1640 for(i=0;i<len;i++)
1641 h = TOK_HASH_FUNC(h, ((unsigned char *)str)[i]);
1642 h &= (TOK_HASH_SIZE - 1);
1644 pts = &hash_ident[h];
1645 for(;;) {
1646 ts = *pts;
1647 if (!ts)
1648 break;
1649 if (ts->len == len && !memcmp(ts->str, str, len))
1650 return ts;
1651 pts = &(ts->hash_next);
1653 return tok_alloc_new(pts, str, len);
1656 /* CString handling */
1658 static void cstr_realloc(CString *cstr, int new_size)
1660 int size;
1661 void *data;
1663 size = cstr->size_allocated;
1664 if (size == 0)
1665 size = 8; /* no need to allocate a too small first string */
1666 while (size < new_size)
1667 size = size * 2;
1668 data = tcc_realloc(cstr->data_allocated, size);
1669 if (!data)
1670 error("memory full");
1671 cstr->data_allocated = data;
1672 cstr->size_allocated = size;
1673 cstr->data = data;
1676 /* add a byte */
1677 static inline void cstr_ccat(CString *cstr, int ch)
1679 int size;
1680 size = cstr->size + 1;
1681 if (size > cstr->size_allocated)
1682 cstr_realloc(cstr, size);
1683 ((unsigned char *)cstr->data)[size - 1] = ch;
1684 cstr->size = size;
1687 static void cstr_cat(CString *cstr, const char *str)
1689 int c;
1690 for(;;) {
1691 c = *str;
1692 if (c == '\0')
1693 break;
1694 cstr_ccat(cstr, c);
1695 str++;
1699 /* add a wide char */
1700 static void cstr_wccat(CString *cstr, int ch)
1702 int size;
1703 size = cstr->size + sizeof(nwchar_t);
1704 if (size > cstr->size_allocated)
1705 cstr_realloc(cstr, size);
1706 *(nwchar_t *)(((unsigned char *)cstr->data) + size - sizeof(nwchar_t)) = ch;
1707 cstr->size = size;
1710 static void cstr_new(CString *cstr)
1712 memset(cstr, 0, sizeof(CString));
1715 /* free string and reset it to NULL */
1716 static void cstr_free(CString *cstr)
1718 tcc_free(cstr->data_allocated);
1719 cstr_new(cstr);
1722 #define cstr_reset(cstr) cstr_free(cstr)
1724 /* XXX: unicode ? */
1725 static void add_char(CString *cstr, int c)
1727 if (c == '\'' || c == '\"' || c == '\\') {
1728 /* XXX: could be more precise if char or string */
1729 cstr_ccat(cstr, '\\');
1731 if (c >= 32 && c <= 126) {
1732 cstr_ccat(cstr, c);
1733 } else {
1734 cstr_ccat(cstr, '\\');
1735 if (c == '\n') {
1736 cstr_ccat(cstr, 'n');
1737 } else {
1738 cstr_ccat(cstr, '0' + ((c >> 6) & 7));
1739 cstr_ccat(cstr, '0' + ((c >> 3) & 7));
1740 cstr_ccat(cstr, '0' + (c & 7));
1745 /* XXX: buffer overflow */
1746 /* XXX: float tokens */
1747 char *get_tok_str(int v, CValue *cv)
1749 static char buf[STRING_MAX_SIZE + 1];
1750 static CString cstr_buf;
1751 CString *cstr;
1752 unsigned char *q;
1753 char *p;
1754 int i, len;
1756 /* NOTE: to go faster, we give a fixed buffer for small strings */
1757 cstr_reset(&cstr_buf);
1758 cstr_buf.data = buf;
1759 cstr_buf.size_allocated = sizeof(buf);
1760 p = buf;
1762 switch(v) {
1763 case TOK_CINT:
1764 case TOK_CUINT:
1765 /* XXX: not quite exact, but only useful for testing */
1766 sprintf(p, "%u", cv->ui);
1767 break;
1768 case TOK_CLLONG:
1769 case TOK_CULLONG:
1770 /* XXX: not quite exact, but only useful for testing */
1771 sprintf(p, "%Lu", cv->ull);
1772 break;
1773 case TOK_CCHAR:
1774 case TOK_LCHAR:
1775 cstr_ccat(&cstr_buf, '\'');
1776 add_char(&cstr_buf, cv->i);
1777 cstr_ccat(&cstr_buf, '\'');
1778 cstr_ccat(&cstr_buf, '\0');
1779 break;
1780 case TOK_PPNUM:
1781 cstr = cv->cstr;
1782 len = cstr->size - 1;
1783 for(i=0;i<len;i++)
1784 add_char(&cstr_buf, ((unsigned char *)cstr->data)[i]);
1785 cstr_ccat(&cstr_buf, '\0');
1786 break;
1787 case TOK_STR:
1788 case TOK_LSTR:
1789 cstr = cv->cstr;
1790 cstr_ccat(&cstr_buf, '\"');
1791 if (v == TOK_STR) {
1792 len = cstr->size - 1;
1793 for(i=0;i<len;i++)
1794 add_char(&cstr_buf, ((unsigned char *)cstr->data)[i]);
1795 } else {
1796 len = (cstr->size / sizeof(nwchar_t)) - 1;
1797 for(i=0;i<len;i++)
1798 add_char(&cstr_buf, ((nwchar_t *)cstr->data)[i]);
1800 cstr_ccat(&cstr_buf, '\"');
1801 cstr_ccat(&cstr_buf, '\0');
1802 break;
1803 case TOK_LT:
1804 v = '<';
1805 goto addv;
1806 case TOK_GT:
1807 v = '>';
1808 goto addv;
1809 case TOK_DOTS:
1810 return strcpy(p, "...");
1811 case TOK_A_SHL:
1812 return strcpy(p, "<<=");
1813 case TOK_A_SAR:
1814 return strcpy(p, ">>=");
1815 default:
1816 if (v < TOK_IDENT) {
1817 /* search in two bytes table */
1818 q = tok_two_chars;
1819 while (*q) {
1820 if (q[2] == v) {
1821 *p++ = q[0];
1822 *p++ = q[1];
1823 *p = '\0';
1824 return buf;
1826 q += 3;
1828 addv:
1829 *p++ = v;
1830 *p = '\0';
1831 } else if (v < tok_ident) {
1832 return table_ident[v - TOK_IDENT]->str;
1833 } else if (v >= SYM_FIRST_ANOM) {
1834 /* special name for anonymous symbol */
1835 sprintf(p, "L.%u", v - SYM_FIRST_ANOM);
1836 } else {
1837 /* should never happen */
1838 return NULL;
1840 break;
1842 return cstr_buf.data;
1845 /* push, without hashing */
1846 static Sym *sym_push2(Sym **ps, int v, int t, int c)
1848 Sym *s;
1849 s = sym_malloc();
1850 s->v = v;
1851 s->type.t = t;
1852 s->c = c;
1853 s->next = NULL;
1854 /* add in stack */
1855 s->prev = *ps;
1856 *ps = s;
1857 return s;
1860 /* find a symbol and return its associated structure. 's' is the top
1861 of the symbol stack */
1862 static Sym *sym_find2(Sym *s, int v)
1864 while (s) {
1865 if (s->v == v)
1866 return s;
1867 s = s->prev;
1869 return NULL;
1872 /* structure lookup */
1873 static inline Sym *struct_find(int v)
1875 v -= TOK_IDENT;
1876 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
1877 return NULL;
1878 return table_ident[v]->sym_struct;
1881 /* find an identifier */
1882 static inline Sym *sym_find(int v)
1884 v -= TOK_IDENT;
1885 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
1886 return NULL;
1887 return table_ident[v]->sym_identifier;
1890 /* push a given symbol on the symbol stack */
1891 static Sym *sym_push(int v, CType *type, int r, int c)
1893 Sym *s, **ps;
1894 TokenSym *ts;
1896 if (local_stack)
1897 ps = &local_stack;
1898 else
1899 ps = &global_stack;
1900 s = sym_push2(ps, v, type->t, c);
1901 s->type.ref = type->ref;
1902 s->r = r;
1903 /* don't record fields or anonymous symbols */
1904 /* XXX: simplify */
1905 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
1906 /* record symbol in token array */
1907 ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT];
1908 if (v & SYM_STRUCT)
1909 ps = &ts->sym_struct;
1910 else
1911 ps = &ts->sym_identifier;
1912 s->prev_tok = *ps;
1913 *ps = s;
1915 return s;
1918 /* push a global identifier */
1919 static Sym *global_identifier_push(int v, int t, int c)
1921 Sym *s, **ps;
1922 s = sym_push2(&global_stack, v, t, c);
1923 /* don't record anonymous symbol */
1924 if (v < SYM_FIRST_ANOM) {
1925 ps = &table_ident[v - TOK_IDENT]->sym_identifier;
1926 /* modify the top most local identifier, so that
1927 sym_identifier will point to 's' when popped */
1928 while (*ps != NULL)
1929 ps = &(*ps)->prev_tok;
1930 s->prev_tok = NULL;
1931 *ps = s;
1933 return s;
1936 /* pop symbols until top reaches 'b' */
1937 static void sym_pop(Sym **ptop, Sym *b)
1939 Sym *s, *ss, **ps;
1940 TokenSym *ts;
1941 int v;
1943 s = *ptop;
1944 while(s != b) {
1945 ss = s->prev;
1946 v = s->v;
1947 /* remove symbol in token array */
1948 /* XXX: simplify */
1949 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
1950 ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT];
1951 if (v & SYM_STRUCT)
1952 ps = &ts->sym_struct;
1953 else
1954 ps = &ts->sym_identifier;
1955 *ps = s->prev_tok;
1957 sym_free(s);
1958 s = ss;
1960 *ptop = b;
1963 /* I/O layer */
1965 BufferedFile *tcc_open(TCCState *s1, const char *filename)
1967 int fd;
1968 BufferedFile *bf;
1970 if (strcmp(filename, "-") == 0)
1971 fd = 0, filename = "stdin";
1972 else
1973 fd = open(filename, O_RDONLY | O_BINARY);
1974 if ((verbose == 2 && fd >= 0) || verbose == 3)
1975 printf("%s %*s%s\n", fd < 0 ? "nf":"->",
1976 (s1->include_stack_ptr - s1->include_stack), "", filename);
1977 if (fd < 0)
1978 return NULL;
1979 bf = tcc_malloc(sizeof(BufferedFile));
1980 bf->fd = fd;
1981 bf->buf_ptr = bf->buffer;
1982 bf->buf_end = bf->buffer;
1983 bf->buffer[0] = CH_EOB; /* put eob symbol */
1984 pstrcpy(bf->filename, sizeof(bf->filename), filename);
1985 #ifdef _WIN32
1986 normalize_slashes(bf->filename);
1987 #endif
1988 bf->line_num = 1;
1989 bf->ifndef_macro = 0;
1990 bf->ifdef_stack_ptr = s1->ifdef_stack_ptr;
1991 // printf("opening '%s'\n", filename);
1992 return bf;
1995 void tcc_close(BufferedFile *bf)
1997 total_lines += bf->line_num;
1998 close(bf->fd);
1999 tcc_free(bf);
2002 /* fill input buffer and peek next char */
2003 static int tcc_peekc_slow(BufferedFile *bf)
2005 int len;
2006 /* only tries to read if really end of buffer */
2007 if (bf->buf_ptr >= bf->buf_end) {
2008 if (bf->fd != -1) {
2009 #if defined(PARSE_DEBUG)
2010 len = 8;
2011 #else
2012 len = IO_BUF_SIZE;
2013 #endif
2014 len = read(bf->fd, bf->buffer, len);
2015 if (len < 0)
2016 len = 0;
2017 } else {
2018 len = 0;
2020 total_bytes += len;
2021 bf->buf_ptr = bf->buffer;
2022 bf->buf_end = bf->buffer + len;
2023 *bf->buf_end = CH_EOB;
2025 if (bf->buf_ptr < bf->buf_end) {
2026 return bf->buf_ptr[0];
2027 } else {
2028 bf->buf_ptr = bf->buf_end;
2029 return CH_EOF;
2033 /* return the current character, handling end of block if necessary
2034 (but not stray) */
2035 static int handle_eob(void)
2037 return tcc_peekc_slow(file);
2040 /* read next char from current input file and handle end of input buffer */
2041 static inline void inp(void)
2043 ch = *(++(file->buf_ptr));
2044 /* end of buffer/file handling */
2045 if (ch == CH_EOB)
2046 ch = handle_eob();
2049 /* handle '\[\r]\n' */
2050 static int handle_stray_noerror(void)
2052 while (ch == '\\') {
2053 inp();
2054 if (ch == '\n') {
2055 file->line_num++;
2056 inp();
2057 } else if (ch == '\r') {
2058 inp();
2059 if (ch != '\n')
2060 goto fail;
2061 file->line_num++;
2062 inp();
2063 } else {
2064 fail:
2065 return 1;
2068 return 0;
2071 static void handle_stray(void)
2073 if (handle_stray_noerror())
2074 error("stray '\\' in program");
2077 /* skip the stray and handle the \\n case. Output an error if
2078 incorrect char after the stray */
2079 static int handle_stray1(uint8_t *p)
2081 int c;
2083 if (p >= file->buf_end) {
2084 file->buf_ptr = p;
2085 c = handle_eob();
2086 p = file->buf_ptr;
2087 if (c == '\\')
2088 goto parse_stray;
2089 } else {
2090 parse_stray:
2091 file->buf_ptr = p;
2092 ch = *p;
2093 handle_stray();
2094 p = file->buf_ptr;
2095 c = *p;
2097 return c;
2100 /* handle just the EOB case, but not stray */
2101 #define PEEKC_EOB(c, p)\
2103 p++;\
2104 c = *p;\
2105 if (c == '\\') {\
2106 file->buf_ptr = p;\
2107 c = handle_eob();\
2108 p = file->buf_ptr;\
2112 /* handle the complicated stray case */
2113 #define PEEKC(c, p)\
2115 p++;\
2116 c = *p;\
2117 if (c == '\\') {\
2118 c = handle_stray1(p);\
2119 p = file->buf_ptr;\
2123 /* input with '\[\r]\n' handling. Note that this function cannot
2124 handle other characters after '\', so you cannot call it inside
2125 strings or comments */
2126 static void minp(void)
2128 inp();
2129 if (ch == '\\')
2130 handle_stray();
2134 /* single line C++ comments */
2135 static uint8_t *parse_line_comment(uint8_t *p)
2137 int c;
2139 p++;
2140 for(;;) {
2141 c = *p;
2142 redo:
2143 if (c == '\n' || c == CH_EOF) {
2144 break;
2145 } else if (c == '\\') {
2146 file->buf_ptr = p;
2147 c = handle_eob();
2148 p = file->buf_ptr;
2149 if (c == '\\') {
2150 PEEKC_EOB(c, p);
2151 if (c == '\n') {
2152 file->line_num++;
2153 PEEKC_EOB(c, p);
2154 } else if (c == '\r') {
2155 PEEKC_EOB(c, p);
2156 if (c == '\n') {
2157 file->line_num++;
2158 PEEKC_EOB(c, p);
2161 } else {
2162 goto redo;
2164 } else {
2165 p++;
2168 return p;
2171 /* C comments */
2172 static uint8_t *parse_comment(uint8_t *p)
2174 int c;
2176 p++;
2177 for(;;) {
2178 /* fast skip loop */
2179 for(;;) {
2180 c = *p;
2181 if (c == '\n' || c == '*' || c == '\\')
2182 break;
2183 p++;
2184 c = *p;
2185 if (c == '\n' || c == '*' || c == '\\')
2186 break;
2187 p++;
2189 /* now we can handle all the cases */
2190 if (c == '\n') {
2191 file->line_num++;
2192 p++;
2193 } else if (c == '*') {
2194 p++;
2195 for(;;) {
2196 c = *p;
2197 if (c == '*') {
2198 p++;
2199 } else if (c == '/') {
2200 goto end_of_comment;
2201 } else if (c == '\\') {
2202 file->buf_ptr = p;
2203 c = handle_eob();
2204 p = file->buf_ptr;
2205 if (c == '\\') {
2206 /* skip '\[\r]\n', otherwise just skip the stray */
2207 while (c == '\\') {
2208 PEEKC_EOB(c, p);
2209 if (c == '\n') {
2210 file->line_num++;
2211 PEEKC_EOB(c, p);
2212 } else if (c == '\r') {
2213 PEEKC_EOB(c, p);
2214 if (c == '\n') {
2215 file->line_num++;
2216 PEEKC_EOB(c, p);
2218 } else {
2219 goto after_star;
2223 } else {
2224 break;
2227 after_star: ;
2228 } else {
2229 /* stray, eob or eof */
2230 file->buf_ptr = p;
2231 c = handle_eob();
2232 p = file->buf_ptr;
2233 if (c == CH_EOF) {
2234 error("unexpected end of file in comment");
2235 } else if (c == '\\') {
2236 p++;
2240 end_of_comment:
2241 p++;
2242 return p;
2245 #define cinp minp
2247 /* space exlcuding newline */
2248 static inline int is_space(int ch)
2250 return ch == ' ' || ch == '\t' || ch == '\v' || ch == '\f' || ch == '\r';
2253 static inline void skip_spaces(void)
2255 while (is_space(ch))
2256 cinp();
2259 /* parse a string without interpreting escapes */
2260 static uint8_t *parse_pp_string(uint8_t *p,
2261 int sep, CString *str)
2263 int c;
2264 p++;
2265 for(;;) {
2266 c = *p;
2267 if (c == sep) {
2268 break;
2269 } else if (c == '\\') {
2270 file->buf_ptr = p;
2271 c = handle_eob();
2272 p = file->buf_ptr;
2273 if (c == CH_EOF) {
2274 unterminated_string:
2275 /* XXX: indicate line number of start of string */
2276 error("missing terminating %c character", sep);
2277 } else if (c == '\\') {
2278 /* escape : just skip \[\r]\n */
2279 PEEKC_EOB(c, p);
2280 if (c == '\n') {
2281 file->line_num++;
2282 p++;
2283 } else if (c == '\r') {
2284 PEEKC_EOB(c, p);
2285 if (c != '\n')
2286 expect("'\n' after '\r'");
2287 file->line_num++;
2288 p++;
2289 } else if (c == CH_EOF) {
2290 goto unterminated_string;
2291 } else {
2292 if (str) {
2293 cstr_ccat(str, '\\');
2294 cstr_ccat(str, c);
2296 p++;
2299 } else if (c == '\n') {
2300 file->line_num++;
2301 goto add_char;
2302 } else if (c == '\r') {
2303 PEEKC_EOB(c, p);
2304 if (c != '\n') {
2305 if (str)
2306 cstr_ccat(str, '\r');
2307 } else {
2308 file->line_num++;
2309 goto add_char;
2311 } else {
2312 add_char:
2313 if (str)
2314 cstr_ccat(str, c);
2315 p++;
2318 p++;
2319 return p;
2322 /* skip block of text until #else, #elif or #endif. skip also pairs of
2323 #if/#endif */
2324 void preprocess_skip(void)
2326 int a, start_of_line, c, in_warn_or_error;
2327 uint8_t *p;
2329 p = file->buf_ptr;
2330 a = 0;
2331 redo_start:
2332 start_of_line = 1;
2333 in_warn_or_error = 0;
2334 for(;;) {
2335 redo_no_start:
2336 c = *p;
2337 switch(c) {
2338 case ' ':
2339 case '\t':
2340 case '\f':
2341 case '\v':
2342 case '\r':
2343 p++;
2344 goto redo_no_start;
2345 case '\n':
2346 file->line_num++;
2347 p++;
2348 goto redo_start;
2349 case '\\':
2350 file->buf_ptr = p;
2351 c = handle_eob();
2352 if (c == CH_EOF) {
2353 expect("#endif");
2354 } else if (c == '\\') {
2355 ch = file->buf_ptr[0];
2356 handle_stray_noerror();
2358 p = file->buf_ptr;
2359 goto redo_no_start;
2360 /* skip strings */
2361 case '\"':
2362 case '\'':
2363 if (in_warn_or_error)
2364 goto _default;
2365 p = parse_pp_string(p, c, NULL);
2366 break;
2367 /* skip comments */
2368 case '/':
2369 if (in_warn_or_error)
2370 goto _default;
2371 file->buf_ptr = p;
2372 ch = *p;
2373 minp();
2374 p = file->buf_ptr;
2375 if (ch == '*') {
2376 p = parse_comment(p);
2377 } else if (ch == '/') {
2378 p = parse_line_comment(p);
2380 break;
2381 case '#':
2382 p++;
2383 if (start_of_line) {
2384 file->buf_ptr = p;
2385 next_nomacro();
2386 p = file->buf_ptr;
2387 if (a == 0 &&
2388 (tok == TOK_ELSE || tok == TOK_ELIF || tok == TOK_ENDIF))
2389 goto the_end;
2390 if (tok == TOK_IF || tok == TOK_IFDEF || tok == TOK_IFNDEF)
2391 a++;
2392 else if (tok == TOK_ENDIF)
2393 a--;
2394 else if( tok == TOK_ERROR || tok == TOK_WARNING)
2395 in_warn_or_error = 1;
2397 break;
2398 _default:
2399 default:
2400 p++;
2401 break;
2403 start_of_line = 0;
2405 the_end: ;
2406 file->buf_ptr = p;
2409 /* ParseState handling */
2411 /* XXX: currently, no include file info is stored. Thus, we cannot display
2412 accurate messages if the function or data definition spans multiple
2413 files */
2415 /* save current parse state in 's' */
2416 void save_parse_state(ParseState *s)
2418 s->line_num = file->line_num;
2419 s->macro_ptr = macro_ptr;
2420 s->tok = tok;
2421 s->tokc = tokc;
2424 /* restore parse state from 's' */
2425 void restore_parse_state(ParseState *s)
2427 file->line_num = s->line_num;
2428 macro_ptr = s->macro_ptr;
2429 tok = s->tok;
2430 tokc = s->tokc;
2433 /* return the number of additional 'ints' necessary to store the
2434 token */
2435 static inline int tok_ext_size(int t)
2437 switch(t) {
2438 /* 4 bytes */
2439 case TOK_CINT:
2440 case TOK_CUINT:
2441 case TOK_CCHAR:
2442 case TOK_LCHAR:
2443 case TOK_CFLOAT:
2444 case TOK_LINENUM:
2445 return 1;
2446 case TOK_STR:
2447 case TOK_LSTR:
2448 case TOK_PPNUM:
2449 error("unsupported token");
2450 return 1;
2451 case TOK_CDOUBLE:
2452 case TOK_CLLONG:
2453 case TOK_CULLONG:
2454 return 2;
2455 case TOK_CLDOUBLE:
2456 return LDOUBLE_SIZE / 4;
2457 default:
2458 return 0;
2462 /* token string handling */
2464 static inline void tok_str_new(TokenString *s)
2466 s->str = NULL;
2467 s->len = 0;
2468 s->allocated_len = 0;
2469 s->last_line_num = -1;
2472 static void tok_str_free(int *str)
2474 tcc_free(str);
2477 static int *tok_str_realloc(TokenString *s)
2479 int *str, len;
2481 if (s->allocated_len == 0) {
2482 len = 8;
2483 } else {
2484 len = s->allocated_len * 2;
2486 str = tcc_realloc(s->str, len * sizeof(int));
2487 if (!str)
2488 error("memory full");
2489 s->allocated_len = len;
2490 s->str = str;
2491 return str;
2494 static void tok_str_add(TokenString *s, int t)
2496 int len, *str;
2498 len = s->len;
2499 str = s->str;
2500 if (len >= s->allocated_len)
2501 str = tok_str_realloc(s);
2502 str[len++] = t;
2503 s->len = len;
2506 static void tok_str_add2(TokenString *s, int t, CValue *cv)
2508 int len, *str;
2510 len = s->len;
2511 str = s->str;
2513 /* allocate space for worst case */
2514 if (len + TOK_MAX_SIZE > s->allocated_len)
2515 str = tok_str_realloc(s);
2516 str[len++] = t;
2517 switch(t) {
2518 case TOK_CINT:
2519 case TOK_CUINT:
2520 case TOK_CCHAR:
2521 case TOK_LCHAR:
2522 case TOK_CFLOAT:
2523 case TOK_LINENUM:
2524 str[len++] = cv->tab[0];
2525 break;
2526 case TOK_PPNUM:
2527 case TOK_STR:
2528 case TOK_LSTR:
2530 int nb_words;
2531 CString *cstr;
2533 nb_words = (sizeof(CString) + cv->cstr->size + 3) >> 2;
2534 while ((len + nb_words) > s->allocated_len)
2535 str = tok_str_realloc(s);
2536 cstr = (CString *)(str + len);
2537 cstr->data = NULL;
2538 cstr->size = cv->cstr->size;
2539 cstr->data_allocated = NULL;
2540 cstr->size_allocated = cstr->size;
2541 memcpy((char *)cstr + sizeof(CString),
2542 cv->cstr->data, cstr->size);
2543 len += nb_words;
2545 break;
2546 case TOK_CDOUBLE:
2547 case TOK_CLLONG:
2548 case TOK_CULLONG:
2549 #if LDOUBLE_SIZE == 8
2550 case TOK_CLDOUBLE:
2551 #endif
2552 str[len++] = cv->tab[0];
2553 str[len++] = cv->tab[1];
2554 break;
2555 #if LDOUBLE_SIZE == 12
2556 case TOK_CLDOUBLE:
2557 str[len++] = cv->tab[0];
2558 str[len++] = cv->tab[1];
2559 str[len++] = cv->tab[2];
2560 #elif LDOUBLE_SIZE != 8
2561 #error add long double size support
2562 #endif
2563 break;
2564 default:
2565 break;
2567 s->len = len;
2570 /* add the current parse token in token string 's' */
2571 static void tok_str_add_tok(TokenString *s)
2573 CValue cval;
2575 /* save line number info */
2576 if (file->line_num != s->last_line_num) {
2577 s->last_line_num = file->line_num;
2578 cval.i = s->last_line_num;
2579 tok_str_add2(s, TOK_LINENUM, &cval);
2581 tok_str_add2(s, tok, &tokc);
2584 #if LDOUBLE_SIZE == 12
2585 #define LDOUBLE_GET(p, cv) \
2586 cv.tab[0] = p[0]; \
2587 cv.tab[1] = p[1]; \
2588 cv.tab[2] = p[2];
2589 #elif LDOUBLE_SIZE == 8
2590 #define LDOUBLE_GET(p, cv) \
2591 cv.tab[0] = p[0]; \
2592 cv.tab[1] = p[1];
2593 #else
2594 #error add long double size support
2595 #endif
2598 /* get a token from an integer array and increment pointer
2599 accordingly. we code it as a macro to avoid pointer aliasing. */
2600 #define TOK_GET(t, p, cv) \
2602 t = *p++; \
2603 switch(t) { \
2604 case TOK_CINT: \
2605 case TOK_CUINT: \
2606 case TOK_CCHAR: \
2607 case TOK_LCHAR: \
2608 case TOK_CFLOAT: \
2609 case TOK_LINENUM: \
2610 cv.tab[0] = *p++; \
2611 break; \
2612 case TOK_STR: \
2613 case TOK_LSTR: \
2614 case TOK_PPNUM: \
2615 cv.cstr = (CString *)p; \
2616 cv.cstr->data = (char *)p + sizeof(CString);\
2617 p += (sizeof(CString) + cv.cstr->size + 3) >> 2;\
2618 break; \
2619 case TOK_CDOUBLE: \
2620 case TOK_CLLONG: \
2621 case TOK_CULLONG: \
2622 cv.tab[0] = p[0]; \
2623 cv.tab[1] = p[1]; \
2624 p += 2; \
2625 break; \
2626 case TOK_CLDOUBLE: \
2627 LDOUBLE_GET(p, cv); \
2628 p += LDOUBLE_SIZE / 4; \
2629 break; \
2630 default: \
2631 break; \
2635 /* defines handling */
2636 static inline void define_push(int v, int macro_type, int *str, Sym *first_arg)
2638 Sym *s;
2640 s = sym_push2(&define_stack, v, macro_type, (int)str);
2641 s->next = first_arg;
2642 table_ident[v - TOK_IDENT]->sym_define = s;
2645 /* undefined a define symbol. Its name is just set to zero */
2646 static void define_undef(Sym *s)
2648 int v;
2649 v = s->v;
2650 if (v >= TOK_IDENT && v < tok_ident)
2651 table_ident[v - TOK_IDENT]->sym_define = NULL;
2652 s->v = 0;
2655 static inline Sym *define_find(int v)
2657 v -= TOK_IDENT;
2658 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
2659 return NULL;
2660 return table_ident[v]->sym_define;
2663 /* free define stack until top reaches 'b' */
2664 static void free_defines(Sym *b)
2666 Sym *top, *top1;
2667 int v;
2669 top = define_stack;
2670 while (top != b) {
2671 top1 = top->prev;
2672 /* do not free args or predefined defines */
2673 if (top->c)
2674 tok_str_free((int *)top->c);
2675 v = top->v;
2676 if (v >= TOK_IDENT && v < tok_ident)
2677 table_ident[v - TOK_IDENT]->sym_define = NULL;
2678 sym_free(top);
2679 top = top1;
2681 define_stack = b;
2684 /* label lookup */
2685 static Sym *label_find(int v)
2687 v -= TOK_IDENT;
2688 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
2689 return NULL;
2690 return table_ident[v]->sym_label;
2693 static Sym *label_push(Sym **ptop, int v, int flags)
2695 Sym *s, **ps;
2696 s = sym_push2(ptop, v, 0, 0);
2697 s->r = flags;
2698 ps = &table_ident[v - TOK_IDENT]->sym_label;
2699 if (ptop == &global_label_stack) {
2700 /* modify the top most local identifier, so that
2701 sym_identifier will point to 's' when popped */
2702 while (*ps != NULL)
2703 ps = &(*ps)->prev_tok;
2705 s->prev_tok = *ps;
2706 *ps = s;
2707 return s;
2710 /* pop labels until element last is reached. Look if any labels are
2711 undefined. Define symbols if '&&label' was used. */
2712 static void label_pop(Sym **ptop, Sym *slast)
2714 Sym *s, *s1;
2715 for(s = *ptop; s != slast; s = s1) {
2716 s1 = s->prev;
2717 if (s->r == LABEL_DECLARED) {
2718 warning("label '%s' declared but not used", get_tok_str(s->v, NULL));
2719 } else if (s->r == LABEL_FORWARD) {
2720 error("label '%s' used but not defined",
2721 get_tok_str(s->v, NULL));
2722 } else {
2723 if (s->c) {
2724 /* define corresponding symbol. A size of
2725 1 is put. */
2726 put_extern_sym(s, cur_text_section, (long)s->next, 1);
2729 /* remove label */
2730 table_ident[s->v - TOK_IDENT]->sym_label = s->prev_tok;
2731 sym_free(s);
2733 *ptop = slast;
2736 /* eval an expression for #if/#elif */
2737 static int expr_preprocess(void)
2739 int c, t;
2740 TokenString str;
2742 tok_str_new(&str);
2743 while (tok != TOK_LINEFEED && tok != TOK_EOF) {
2744 next(); /* do macro subst */
2745 if (tok == TOK_DEFINED) {
2746 next_nomacro();
2747 t = tok;
2748 if (t == '(')
2749 next_nomacro();
2750 c = define_find(tok) != 0;
2751 if (t == '(')
2752 next_nomacro();
2753 tok = TOK_CINT;
2754 tokc.i = c;
2755 } else if (tok >= TOK_IDENT) {
2756 /* if undefined macro */
2757 tok = TOK_CINT;
2758 tokc.i = 0;
2760 tok_str_add_tok(&str);
2762 tok_str_add(&str, -1); /* simulate end of file */
2763 tok_str_add(&str, 0);
2764 /* now evaluate C constant expression */
2765 macro_ptr = str.str;
2766 next();
2767 c = expr_const();
2768 macro_ptr = NULL;
2769 tok_str_free(str.str);
2770 return c != 0;
2773 #if defined(PARSE_DEBUG) || defined(PP_DEBUG)
2774 static void tok_print(int *str)
2776 int t;
2777 CValue cval;
2779 while (1) {
2780 TOK_GET(t, str, cval);
2781 if (!t)
2782 break;
2783 printf(" %s", get_tok_str(t, &cval));
2785 printf("\n");
2787 #endif
2789 /* parse after #define */
2790 static void parse_define(void)
2792 Sym *s, *first, **ps;
2793 int v, t, varg, is_vaargs, c;
2794 TokenString str;
2796 v = tok;
2797 if (v < TOK_IDENT)
2798 error("invalid macro name '%s'", get_tok_str(tok, &tokc));
2799 /* XXX: should check if same macro (ANSI) */
2800 first = NULL;
2801 t = MACRO_OBJ;
2802 /* '(' must be just after macro definition for MACRO_FUNC */
2803 c = file->buf_ptr[0];
2804 if (c == '\\')
2805 c = handle_stray1(file->buf_ptr);
2806 if (c == '(') {
2807 next_nomacro();
2808 next_nomacro();
2809 ps = &first;
2810 while (tok != ')') {
2811 varg = tok;
2812 next_nomacro();
2813 is_vaargs = 0;
2814 if (varg == TOK_DOTS) {
2815 varg = TOK___VA_ARGS__;
2816 is_vaargs = 1;
2817 } else if (tok == TOK_DOTS && gnu_ext) {
2818 is_vaargs = 1;
2819 next_nomacro();
2821 if (varg < TOK_IDENT)
2822 error("badly punctuated parameter list");
2823 s = sym_push2(&define_stack, varg | SYM_FIELD, is_vaargs, 0);
2824 *ps = s;
2825 ps = &s->next;
2826 if (tok != ',')
2827 break;
2828 next_nomacro();
2830 t = MACRO_FUNC;
2832 tok_str_new(&str);
2833 next_nomacro();
2834 /* EOF testing necessary for '-D' handling */
2835 while (tok != TOK_LINEFEED && tok != TOK_EOF) {
2836 tok_str_add2(&str, tok, &tokc);
2837 next_nomacro();
2839 tok_str_add(&str, 0);
2840 #ifdef PP_DEBUG
2841 printf("define %s %d: ", get_tok_str(v, NULL), t);
2842 tok_print(str.str);
2843 #endif
2844 define_push(v, t, str.str, first);
2847 static inline int hash_cached_include(int type, const char *filename)
2849 const unsigned char *s;
2850 unsigned int h;
2852 h = TOK_HASH_INIT;
2853 h = TOK_HASH_FUNC(h, type);
2854 s = filename;
2855 while (*s) {
2856 h = TOK_HASH_FUNC(h, *s);
2857 s++;
2859 h &= (CACHED_INCLUDES_HASH_SIZE - 1);
2860 return h;
2863 /* XXX: use a token or a hash table to accelerate matching ? */
2864 static CachedInclude *search_cached_include(TCCState *s1,
2865 int type, const char *filename)
2867 CachedInclude *e;
2868 int i, h;
2869 h = hash_cached_include(type, filename);
2870 i = s1->cached_includes_hash[h];
2871 for(;;) {
2872 if (i == 0)
2873 break;
2874 e = s1->cached_includes[i - 1];
2875 if (e->type == type && !strcmp(e->filename, filename))
2876 return e;
2877 i = e->hash_next;
2879 return NULL;
2882 static inline void add_cached_include(TCCState *s1, int type,
2883 const char *filename, int ifndef_macro)
2885 CachedInclude *e;
2886 int h;
2888 if (search_cached_include(s1, type, filename))
2889 return;
2890 #ifdef INC_DEBUG
2891 printf("adding cached '%s' %s\n", filename, get_tok_str(ifndef_macro, NULL));
2892 #endif
2893 e = tcc_malloc(sizeof(CachedInclude) + strlen(filename));
2894 if (!e)
2895 return;
2896 e->type = type;
2897 strcpy(e->filename, filename);
2898 e->ifndef_macro = ifndef_macro;
2899 dynarray_add((void ***)&s1->cached_includes, &s1->nb_cached_includes, e);
2900 /* add in hash table */
2901 h = hash_cached_include(type, filename);
2902 e->hash_next = s1->cached_includes_hash[h];
2903 s1->cached_includes_hash[h] = s1->nb_cached_includes;
2906 static void pragma_parse(TCCState *s1)
2908 int val;
2910 next();
2911 if (tok == TOK_pack) {
2913 This may be:
2914 #pragma pack(1) // set
2915 #pragma pack() // reset to default
2916 #pragma pack(push,1) // push & set
2917 #pragma pack(pop) // restore previous
2919 next();
2920 skip('(');
2921 if (tok == TOK_ASM_pop) {
2922 next();
2923 if (s1->pack_stack_ptr <= s1->pack_stack) {
2924 stk_error:
2925 error("out of pack stack");
2927 s1->pack_stack_ptr--;
2928 } else {
2929 val = 0;
2930 if (tok != ')') {
2931 if (tok == TOK_ASM_push) {
2932 next();
2933 if (s1->pack_stack_ptr >= s1->pack_stack + PACK_STACK_SIZE - 1)
2934 goto stk_error;
2935 s1->pack_stack_ptr++;
2936 skip(',');
2938 if (tok != TOK_CINT) {
2939 pack_error:
2940 error("invalid pack pragma");
2942 val = tokc.i;
2943 if (val < 1 || val > 16 || (val & (val - 1)) != 0)
2944 goto pack_error;
2945 next();
2947 *s1->pack_stack_ptr = val;
2948 skip(')');
2953 /* is_bof is true if first non space token at beginning of file */
2954 static void preprocess(int is_bof)
2956 TCCState *s1 = tcc_state;
2957 int size, i, c, n, saved_parse_flags;
2958 char buf[1024], *q;
2959 char buf1[1024];
2960 BufferedFile *f;
2961 Sym *s;
2962 CachedInclude *e;
2964 saved_parse_flags = parse_flags;
2965 parse_flags = PARSE_FLAG_PREPROCESS | PARSE_FLAG_TOK_NUM |
2966 PARSE_FLAG_LINEFEED;
2967 next_nomacro();
2968 redo:
2969 switch(tok) {
2970 case TOK_DEFINE:
2971 next_nomacro();
2972 parse_define();
2973 break;
2974 case TOK_UNDEF:
2975 next_nomacro();
2976 s = define_find(tok);
2977 /* undefine symbol by putting an invalid name */
2978 if (s)
2979 define_undef(s);
2980 break;
2981 case TOK_INCLUDE:
2982 case TOK_INCLUDE_NEXT:
2983 ch = file->buf_ptr[0];
2984 /* XXX: incorrect if comments : use next_nomacro with a special mode */
2985 skip_spaces();
2986 if (ch == '<') {
2987 c = '>';
2988 goto read_name;
2989 } else if (ch == '\"') {
2990 c = ch;
2991 read_name:
2992 inp();
2993 q = buf;
2994 while (ch != c && ch != '\n' && ch != CH_EOF) {
2995 if ((q - buf) < sizeof(buf) - 1)
2996 *q++ = ch;
2997 if (ch == '\\') {
2998 if (handle_stray_noerror() == 0)
2999 --q;
3000 } else
3001 inp();
3003 *q = '\0';
3004 minp();
3005 #if 0
3006 /* eat all spaces and comments after include */
3007 /* XXX: slightly incorrect */
3008 while (ch1 != '\n' && ch1 != CH_EOF)
3009 inp();
3010 #endif
3011 } else {
3012 /* computed #include : either we have only strings or
3013 we have anything enclosed in '<>' */
3014 next();
3015 buf[0] = '\0';
3016 if (tok == TOK_STR) {
3017 while (tok != TOK_LINEFEED) {
3018 if (tok != TOK_STR) {
3019 include_syntax:
3020 error("'#include' expects \"FILENAME\" or <FILENAME>");
3022 pstrcat(buf, sizeof(buf), (char *)tokc.cstr->data);
3023 next();
3025 c = '\"';
3026 } else {
3027 int len;
3028 while (tok != TOK_LINEFEED) {
3029 pstrcat(buf, sizeof(buf), get_tok_str(tok, &tokc));
3030 next();
3032 len = strlen(buf);
3033 /* check syntax and remove '<>' */
3034 if (len < 2 || buf[0] != '<' || buf[len - 1] != '>')
3035 goto include_syntax;
3036 memmove(buf, buf + 1, len - 2);
3037 buf[len - 2] = '\0';
3038 c = '>';
3042 e = search_cached_include(s1, c, buf);
3043 if (e && define_find(e->ifndef_macro)) {
3044 /* no need to parse the include because the 'ifndef macro'
3045 is defined */
3046 #ifdef INC_DEBUG
3047 printf("%s: skipping %s\n", file->filename, buf);
3048 #endif
3049 } else {
3050 if (s1->include_stack_ptr >= s1->include_stack + INCLUDE_STACK_SIZE)
3051 error("#include recursion too deep");
3052 /* push current file in stack */
3053 /* XXX: fix current line init */
3054 *s1->include_stack_ptr++ = file;
3055 if (c == '\"') {
3056 /* first search in current dir if "header.h" */
3057 size = tcc_basename(file->filename) - file->filename;
3058 if (size > sizeof(buf1) - 1)
3059 size = sizeof(buf1) - 1;
3060 memcpy(buf1, file->filename, size);
3061 buf1[size] = '\0';
3062 pstrcat(buf1, sizeof(buf1), buf);
3063 f = tcc_open(s1, buf1);
3064 if (f) {
3065 if (tok == TOK_INCLUDE_NEXT)
3066 tok = TOK_INCLUDE;
3067 else
3068 goto found;
3071 /* now search in all the include paths */
3072 n = s1->nb_include_paths + s1->nb_sysinclude_paths;
3073 for(i = 0; i < n; i++) {
3074 const char *path;
3075 if (i < s1->nb_include_paths)
3076 path = s1->include_paths[i];
3077 else
3078 path = s1->sysinclude_paths[i - s1->nb_include_paths];
3079 pstrcpy(buf1, sizeof(buf1), path);
3080 pstrcat(buf1, sizeof(buf1), "/");
3081 pstrcat(buf1, sizeof(buf1), buf);
3082 f = tcc_open(s1, buf1);
3083 if (f) {
3084 if (tok == TOK_INCLUDE_NEXT)
3085 tok = TOK_INCLUDE;
3086 else
3087 goto found;
3090 --s1->include_stack_ptr;
3091 error("include file '%s' not found", buf);
3092 break;
3093 found:
3094 #ifdef INC_DEBUG
3095 printf("%s: including %s\n", file->filename, buf1);
3096 #endif
3097 f->inc_type = c;
3098 pstrcpy(f->inc_filename, sizeof(f->inc_filename), buf);
3099 file = f;
3100 /* add include file debug info */
3101 if (do_debug) {
3102 put_stabs(file->filename, N_BINCL, 0, 0, 0);
3104 tok_flags |= TOK_FLAG_BOF | TOK_FLAG_BOL;
3105 ch = file->buf_ptr[0];
3106 goto the_end;
3108 break;
3109 case TOK_IFNDEF:
3110 c = 1;
3111 goto do_ifdef;
3112 case TOK_IF:
3113 c = expr_preprocess();
3114 goto do_if;
3115 case TOK_IFDEF:
3116 c = 0;
3117 do_ifdef:
3118 next_nomacro();
3119 if (tok < TOK_IDENT)
3120 error("invalid argument for '#if%sdef'", c ? "n" : "");
3121 if (is_bof) {
3122 if (c) {
3123 #ifdef INC_DEBUG
3124 printf("#ifndef %s\n", get_tok_str(tok, NULL));
3125 #endif
3126 file->ifndef_macro = tok;
3129 c = (define_find(tok) != 0) ^ c;
3130 do_if:
3131 if (s1->ifdef_stack_ptr >= s1->ifdef_stack + IFDEF_STACK_SIZE)
3132 error("memory full");
3133 *s1->ifdef_stack_ptr++ = c;
3134 goto test_skip;
3135 case TOK_ELSE:
3136 if (s1->ifdef_stack_ptr == s1->ifdef_stack)
3137 error("#else without matching #if");
3138 if (s1->ifdef_stack_ptr[-1] & 2)
3139 error("#else after #else");
3140 c = (s1->ifdef_stack_ptr[-1] ^= 3);
3141 goto test_skip;
3142 case TOK_ELIF:
3143 if (s1->ifdef_stack_ptr == s1->ifdef_stack)
3144 error("#elif without matching #if");
3145 c = s1->ifdef_stack_ptr[-1];
3146 if (c > 1)
3147 error("#elif after #else");
3148 /* last #if/#elif expression was true: we skip */
3149 if (c == 1)
3150 goto skip;
3151 c = expr_preprocess();
3152 s1->ifdef_stack_ptr[-1] = c;
3153 test_skip:
3154 if (!(c & 1)) {
3155 skip:
3156 preprocess_skip();
3157 is_bof = 0;
3158 goto redo;
3160 break;
3161 case TOK_ENDIF:
3162 if (s1->ifdef_stack_ptr <= file->ifdef_stack_ptr)
3163 error("#endif without matching #if");
3164 s1->ifdef_stack_ptr--;
3165 /* '#ifndef macro' was at the start of file. Now we check if
3166 an '#endif' is exactly at the end of file */
3167 if (file->ifndef_macro &&
3168 s1->ifdef_stack_ptr == file->ifdef_stack_ptr) {
3169 file->ifndef_macro_saved = file->ifndef_macro;
3170 /* need to set to zero to avoid false matches if another
3171 #ifndef at middle of file */
3172 file->ifndef_macro = 0;
3173 while (tok != TOK_LINEFEED)
3174 next_nomacro();
3175 tok_flags |= TOK_FLAG_ENDIF;
3176 goto the_end;
3178 break;
3179 case TOK_LINE:
3180 next();
3181 if (tok != TOK_CINT)
3182 error("#line");
3183 file->line_num = tokc.i - 1; /* the line number will be incremented after */
3184 next();
3185 if (tok != TOK_LINEFEED) {
3186 if (tok != TOK_STR)
3187 error("#line");
3188 pstrcpy(file->filename, sizeof(file->filename),
3189 (char *)tokc.cstr->data);
3191 break;
3192 case TOK_ERROR:
3193 case TOK_WARNING:
3194 c = tok;
3195 ch = file->buf_ptr[0];
3196 skip_spaces();
3197 q = buf;
3198 while (ch != '\n' && ch != CH_EOF) {
3199 if ((q - buf) < sizeof(buf) - 1)
3200 *q++ = ch;
3201 if (ch == '\\') {
3202 if (handle_stray_noerror() == 0)
3203 --q;
3204 } else
3205 inp();
3207 *q = '\0';
3208 if (c == TOK_ERROR)
3209 error("#error %s", buf);
3210 else
3211 warning("#warning %s", buf);
3212 break;
3213 case TOK_PRAGMA:
3214 pragma_parse(s1);
3215 break;
3216 default:
3217 if (tok == TOK_LINEFEED || tok == '!' || tok == TOK_CINT) {
3218 /* '!' is ignored to allow C scripts. numbers are ignored
3219 to emulate cpp behaviour */
3220 } else {
3221 if (!(saved_parse_flags & PARSE_FLAG_ASM_COMMENTS))
3222 warning("Ignoring unknown preprocessing directive #%s", get_tok_str(tok, &tokc));
3224 break;
3226 /* ignore other preprocess commands or #! for C scripts */
3227 while (tok != TOK_LINEFEED)
3228 next_nomacro();
3229 the_end:
3230 parse_flags = saved_parse_flags;
3233 /* evaluate escape codes in a string. */
3234 static void parse_escape_string(CString *outstr, const uint8_t *buf, int is_long)
3236 int c, n;
3237 const uint8_t *p;
3239 p = buf;
3240 for(;;) {
3241 c = *p;
3242 if (c == '\0')
3243 break;
3244 if (c == '\\') {
3245 p++;
3246 /* escape */
3247 c = *p;
3248 switch(c) {
3249 case '0': case '1': case '2': case '3':
3250 case '4': case '5': case '6': case '7':
3251 /* at most three octal digits */
3252 n = c - '0';
3253 p++;
3254 c = *p;
3255 if (isoct(c)) {
3256 n = n * 8 + c - '0';
3257 p++;
3258 c = *p;
3259 if (isoct(c)) {
3260 n = n * 8 + c - '0';
3261 p++;
3264 c = n;
3265 goto add_char_nonext;
3266 case 'x':
3267 case 'u':
3268 case 'U':
3269 p++;
3270 n = 0;
3271 for(;;) {
3272 c = *p;
3273 if (c >= 'a' && c <= 'f')
3274 c = c - 'a' + 10;
3275 else if (c >= 'A' && c <= 'F')
3276 c = c - 'A' + 10;
3277 else if (isnum(c))
3278 c = c - '0';
3279 else
3280 break;
3281 n = n * 16 + c;
3282 p++;
3284 c = n;
3285 goto add_char_nonext;
3286 case 'a':
3287 c = '\a';
3288 break;
3289 case 'b':
3290 c = '\b';
3291 break;
3292 case 'f':
3293 c = '\f';
3294 break;
3295 case 'n':
3296 c = '\n';
3297 break;
3298 case 'r':
3299 c = '\r';
3300 break;
3301 case 't':
3302 c = '\t';
3303 break;
3304 case 'v':
3305 c = '\v';
3306 break;
3307 case 'e':
3308 if (!gnu_ext)
3309 goto invalid_escape;
3310 c = 27;
3311 break;
3312 case '\'':
3313 case '\"':
3314 case '\\':
3315 case '?':
3316 break;
3317 default:
3318 invalid_escape:
3319 if (c >= '!' && c <= '~')
3320 warning("unknown escape sequence: \'\\%c\'", c);
3321 else
3322 warning("unknown escape sequence: \'\\x%x\'", c);
3323 break;
3326 p++;
3327 add_char_nonext:
3328 if (!is_long)
3329 cstr_ccat(outstr, c);
3330 else
3331 cstr_wccat(outstr, c);
3333 /* add a trailing '\0' */
3334 if (!is_long)
3335 cstr_ccat(outstr, '\0');
3336 else
3337 cstr_wccat(outstr, '\0');
3340 /* we use 64 bit numbers */
3341 #define BN_SIZE 2
3343 /* bn = (bn << shift) | or_val */
3344 void bn_lshift(unsigned int *bn, int shift, int or_val)
3346 int i;
3347 unsigned int v;
3348 for(i=0;i<BN_SIZE;i++) {
3349 v = bn[i];
3350 bn[i] = (v << shift) | or_val;
3351 or_val = v >> (32 - shift);
3355 void bn_zero(unsigned int *bn)
3357 int i;
3358 for(i=0;i<BN_SIZE;i++) {
3359 bn[i] = 0;
3363 /* parse number in null terminated string 'p' and return it in the
3364 current token */
3365 void parse_number(const char *p)
3367 int b, t, shift, frac_bits, s, exp_val, ch;
3368 char *q;
3369 unsigned int bn[BN_SIZE];
3370 double d;
3372 /* number */
3373 q = token_buf;
3374 ch = *p++;
3375 t = ch;
3376 ch = *p++;
3377 *q++ = t;
3378 b = 10;
3379 if (t == '.') {
3380 goto float_frac_parse;
3381 } else if (t == '0') {
3382 if (ch == 'x' || ch == 'X') {
3383 q--;
3384 ch = *p++;
3385 b = 16;
3386 } else if (tcc_ext && (ch == 'b' || ch == 'B')) {
3387 q--;
3388 ch = *p++;
3389 b = 2;
3392 /* parse all digits. cannot check octal numbers at this stage
3393 because of floating point constants */
3394 while (1) {
3395 if (ch >= 'a' && ch <= 'f')
3396 t = ch - 'a' + 10;
3397 else if (ch >= 'A' && ch <= 'F')
3398 t = ch - 'A' + 10;
3399 else if (isnum(ch))
3400 t = ch - '0';
3401 else
3402 break;
3403 if (t >= b)
3404 break;
3405 if (q >= token_buf + STRING_MAX_SIZE) {
3406 num_too_long:
3407 error("number too long");
3409 *q++ = ch;
3410 ch = *p++;
3412 if (ch == '.' ||
3413 ((ch == 'e' || ch == 'E') && b == 10) ||
3414 ((ch == 'p' || ch == 'P') && (b == 16 || b == 2))) {
3415 if (b != 10) {
3416 /* NOTE: strtox should support that for hexa numbers, but
3417 non ISOC99 libcs do not support it, so we prefer to do
3418 it by hand */
3419 /* hexadecimal or binary floats */
3420 /* XXX: handle overflows */
3421 *q = '\0';
3422 if (b == 16)
3423 shift = 4;
3424 else
3425 shift = 2;
3426 bn_zero(bn);
3427 q = token_buf;
3428 while (1) {
3429 t = *q++;
3430 if (t == '\0') {
3431 break;
3432 } else if (t >= 'a') {
3433 t = t - 'a' + 10;
3434 } else if (t >= 'A') {
3435 t = t - 'A' + 10;
3436 } else {
3437 t = t - '0';
3439 bn_lshift(bn, shift, t);
3441 frac_bits = 0;
3442 if (ch == '.') {
3443 ch = *p++;
3444 while (1) {
3445 t = ch;
3446 if (t >= 'a' && t <= 'f') {
3447 t = t - 'a' + 10;
3448 } else if (t >= 'A' && t <= 'F') {
3449 t = t - 'A' + 10;
3450 } else if (t >= '0' && t <= '9') {
3451 t = t - '0';
3452 } else {
3453 break;
3455 if (t >= b)
3456 error("invalid digit");
3457 bn_lshift(bn, shift, t);
3458 frac_bits += shift;
3459 ch = *p++;
3462 if (ch != 'p' && ch != 'P')
3463 expect("exponent");
3464 ch = *p++;
3465 s = 1;
3466 exp_val = 0;
3467 if (ch == '+') {
3468 ch = *p++;
3469 } else if (ch == '-') {
3470 s = -1;
3471 ch = *p++;
3473 if (ch < '0' || ch > '9')
3474 expect("exponent digits");
3475 while (ch >= '0' && ch <= '9') {
3476 exp_val = exp_val * 10 + ch - '0';
3477 ch = *p++;
3479 exp_val = exp_val * s;
3481 /* now we can generate the number */
3482 /* XXX: should patch directly float number */
3483 d = (double)bn[1] * 4294967296.0 + (double)bn[0];
3484 d = ldexp(d, exp_val - frac_bits);
3485 t = toup(ch);
3486 if (t == 'F') {
3487 ch = *p++;
3488 tok = TOK_CFLOAT;
3489 /* float : should handle overflow */
3490 tokc.f = (float)d;
3491 } else if (t == 'L') {
3492 ch = *p++;
3493 tok = TOK_CLDOUBLE;
3494 /* XXX: not large enough */
3495 tokc.ld = (long double)d;
3496 } else {
3497 tok = TOK_CDOUBLE;
3498 tokc.d = d;
3500 } else {
3501 /* decimal floats */
3502 if (ch == '.') {
3503 if (q >= token_buf + STRING_MAX_SIZE)
3504 goto num_too_long;
3505 *q++ = ch;
3506 ch = *p++;
3507 float_frac_parse:
3508 while (ch >= '0' && ch <= '9') {
3509 if (q >= token_buf + STRING_MAX_SIZE)
3510 goto num_too_long;
3511 *q++ = ch;
3512 ch = *p++;
3515 if (ch == 'e' || ch == 'E') {
3516 if (q >= token_buf + STRING_MAX_SIZE)
3517 goto num_too_long;
3518 *q++ = ch;
3519 ch = *p++;
3520 if (ch == '-' || ch == '+') {
3521 if (q >= token_buf + STRING_MAX_SIZE)
3522 goto num_too_long;
3523 *q++ = ch;
3524 ch = *p++;
3526 if (ch < '0' || ch > '9')
3527 expect("exponent digits");
3528 while (ch >= '0' && ch <= '9') {
3529 if (q >= token_buf + STRING_MAX_SIZE)
3530 goto num_too_long;
3531 *q++ = ch;
3532 ch = *p++;
3535 *q = '\0';
3536 t = toup(ch);
3537 errno = 0;
3538 if (t == 'F') {
3539 ch = *p++;
3540 tok = TOK_CFLOAT;
3541 tokc.f = strtof(token_buf, NULL);
3542 } else if (t == 'L') {
3543 ch = *p++;
3544 tok = TOK_CLDOUBLE;
3545 tokc.ld = strtold(token_buf, NULL);
3546 } else {
3547 tok = TOK_CDOUBLE;
3548 tokc.d = strtod(token_buf, NULL);
3551 } else {
3552 unsigned long long n, n1;
3553 int lcount, ucount;
3555 /* integer number */
3556 *q = '\0';
3557 q = token_buf;
3558 if (b == 10 && *q == '0') {
3559 b = 8;
3560 q++;
3562 n = 0;
3563 while(1) {
3564 t = *q++;
3565 /* no need for checks except for base 10 / 8 errors */
3566 if (t == '\0') {
3567 break;
3568 } else if (t >= 'a') {
3569 t = t - 'a' + 10;
3570 } else if (t >= 'A') {
3571 t = t - 'A' + 10;
3572 } else {
3573 t = t - '0';
3574 if (t >= b)
3575 error("invalid digit");
3577 n1 = n;
3578 n = n * b + t;
3579 /* detect overflow */
3580 /* XXX: this test is not reliable */
3581 if (n < n1)
3582 error("integer constant overflow");
3585 /* XXX: not exactly ANSI compliant */
3586 if ((n & 0xffffffff00000000LL) != 0) {
3587 if ((n >> 63) != 0)
3588 tok = TOK_CULLONG;
3589 else
3590 tok = TOK_CLLONG;
3591 } else if (n > 0x7fffffff) {
3592 tok = TOK_CUINT;
3593 } else {
3594 tok = TOK_CINT;
3596 lcount = 0;
3597 ucount = 0;
3598 for(;;) {
3599 t = toup(ch);
3600 if (t == 'L') {
3601 if (lcount >= 2)
3602 error("three 'l's in integer constant");
3603 lcount++;
3604 if (lcount == 2) {
3605 if (tok == TOK_CINT)
3606 tok = TOK_CLLONG;
3607 else if (tok == TOK_CUINT)
3608 tok = TOK_CULLONG;
3610 ch = *p++;
3611 } else if (t == 'U') {
3612 if (ucount >= 1)
3613 error("two 'u's in integer constant");
3614 ucount++;
3615 if (tok == TOK_CINT)
3616 tok = TOK_CUINT;
3617 else if (tok == TOK_CLLONG)
3618 tok = TOK_CULLONG;
3619 ch = *p++;
3620 } else {
3621 break;
3624 if (tok == TOK_CINT || tok == TOK_CUINT)
3625 tokc.ui = n;
3626 else
3627 tokc.ull = n;
3632 #define PARSE2(c1, tok1, c2, tok2) \
3633 case c1: \
3634 PEEKC(c, p); \
3635 if (c == c2) { \
3636 p++; \
3637 tok = tok2; \
3638 } else { \
3639 tok = tok1; \
3641 break;
3643 /* return next token without macro substitution */
3644 static inline void next_nomacro1(void)
3646 int t, c, is_long;
3647 TokenSym *ts;
3648 uint8_t *p, *p1;
3649 unsigned int h;
3651 p = file->buf_ptr;
3652 redo_no_start:
3653 c = *p;
3654 switch(c) {
3655 case ' ':
3656 case '\t':
3657 case '\f':
3658 case '\v':
3659 case '\r':
3660 p++;
3661 goto redo_no_start;
3663 case '\\':
3664 /* first look if it is in fact an end of buffer */
3665 if (p >= file->buf_end) {
3666 file->buf_ptr = p;
3667 handle_eob();
3668 p = file->buf_ptr;
3669 if (p >= file->buf_end)
3670 goto parse_eof;
3671 else
3672 goto redo_no_start;
3673 } else {
3674 file->buf_ptr = p;
3675 ch = *p;
3676 handle_stray();
3677 p = file->buf_ptr;
3678 goto redo_no_start;
3680 parse_eof:
3682 TCCState *s1 = tcc_state;
3683 if ((parse_flags & PARSE_FLAG_LINEFEED)
3684 && !(tok_flags & TOK_FLAG_EOF)) {
3685 tok_flags |= TOK_FLAG_EOF;
3686 tok = TOK_LINEFEED;
3687 goto keep_tok_flags;
3688 } else if (s1->include_stack_ptr == s1->include_stack ||
3689 !(parse_flags & PARSE_FLAG_PREPROCESS)) {
3690 /* no include left : end of file. */
3691 tok = TOK_EOF;
3692 } else {
3693 tok_flags &= ~TOK_FLAG_EOF;
3694 /* pop include file */
3696 /* test if previous '#endif' was after a #ifdef at
3697 start of file */
3698 if (tok_flags & TOK_FLAG_ENDIF) {
3699 #ifdef INC_DEBUG
3700 printf("#endif %s\n", get_tok_str(file->ifndef_macro_saved, NULL));
3701 #endif
3702 add_cached_include(s1, file->inc_type, file->inc_filename,
3703 file->ifndef_macro_saved);
3706 /* add end of include file debug info */
3707 if (do_debug) {
3708 put_stabd(N_EINCL, 0, 0);
3710 /* pop include stack */
3711 tcc_close(file);
3712 s1->include_stack_ptr--;
3713 file = *s1->include_stack_ptr;
3714 p = file->buf_ptr;
3715 goto redo_no_start;
3718 break;
3720 case '\n':
3721 file->line_num++;
3722 tok_flags |= TOK_FLAG_BOL;
3723 p++;
3724 if (0 == (parse_flags & PARSE_FLAG_LINEFEED))
3725 goto redo_no_start;
3726 tok = TOK_LINEFEED;
3727 goto keep_tok_flags;
3729 case '#':
3730 /* XXX: simplify */
3731 PEEKC(c, p);
3732 if ((tok_flags & TOK_FLAG_BOL) &&
3733 (parse_flags & PARSE_FLAG_PREPROCESS)) {
3734 file->buf_ptr = p;
3735 preprocess(tok_flags & TOK_FLAG_BOF);
3736 p = file->buf_ptr;
3737 goto redo_no_start;
3738 } else {
3739 if (c == '#') {
3740 p++;
3741 tok = TOK_TWOSHARPS;
3742 } else {
3743 if (parse_flags & PARSE_FLAG_ASM_COMMENTS) {
3744 p = parse_line_comment(p - 1);
3745 goto redo_no_start;
3746 } else {
3747 tok = '#';
3751 break;
3753 case 'a': case 'b': case 'c': case 'd':
3754 case 'e': case 'f': case 'g': case 'h':
3755 case 'i': case 'j': case 'k': case 'l':
3756 case 'm': case 'n': case 'o': case 'p':
3757 case 'q': case 'r': case 's': case 't':
3758 case 'u': case 'v': case 'w': case 'x':
3759 case 'y': case 'z':
3760 case 'A': case 'B': case 'C': case 'D':
3761 case 'E': case 'F': case 'G': case 'H':
3762 case 'I': case 'J': case 'K':
3763 case 'M': case 'N': case 'O': case 'P':
3764 case 'Q': case 'R': case 'S': case 'T':
3765 case 'U': case 'V': case 'W': case 'X':
3766 case 'Y': case 'Z':
3767 case '_':
3768 parse_ident_fast:
3769 p1 = p;
3770 h = TOK_HASH_INIT;
3771 h = TOK_HASH_FUNC(h, c);
3772 p++;
3773 for(;;) {
3774 c = *p;
3775 if (!isidnum_table[c-CH_EOF])
3776 break;
3777 h = TOK_HASH_FUNC(h, c);
3778 p++;
3780 if (c != '\\') {
3781 TokenSym **pts;
3782 int len;
3784 /* fast case : no stray found, so we have the full token
3785 and we have already hashed it */
3786 len = p - p1;
3787 h &= (TOK_HASH_SIZE - 1);
3788 pts = &hash_ident[h];
3789 for(;;) {
3790 ts = *pts;
3791 if (!ts)
3792 break;
3793 if (ts->len == len && !memcmp(ts->str, p1, len))
3794 goto token_found;
3795 pts = &(ts->hash_next);
3797 ts = tok_alloc_new(pts, p1, len);
3798 token_found: ;
3799 } else {
3800 /* slower case */
3801 cstr_reset(&tokcstr);
3803 while (p1 < p) {
3804 cstr_ccat(&tokcstr, *p1);
3805 p1++;
3807 p--;
3808 PEEKC(c, p);
3809 parse_ident_slow:
3810 while (isidnum_table[c-CH_EOF]) {
3811 cstr_ccat(&tokcstr, c);
3812 PEEKC(c, p);
3814 ts = tok_alloc(tokcstr.data, tokcstr.size);
3816 tok = ts->tok;
3817 break;
3818 case 'L':
3819 t = p[1];
3820 if (t != '\\' && t != '\'' && t != '\"') {
3821 /* fast case */
3822 goto parse_ident_fast;
3823 } else {
3824 PEEKC(c, p);
3825 if (c == '\'' || c == '\"') {
3826 is_long = 1;
3827 goto str_const;
3828 } else {
3829 cstr_reset(&tokcstr);
3830 cstr_ccat(&tokcstr, 'L');
3831 goto parse_ident_slow;
3834 break;
3835 case '0': case '1': case '2': case '3':
3836 case '4': case '5': case '6': case '7':
3837 case '8': case '9':
3839 cstr_reset(&tokcstr);
3840 /* after the first digit, accept digits, alpha, '.' or sign if
3841 prefixed by 'eEpP' */
3842 parse_num:
3843 for(;;) {
3844 t = c;
3845 cstr_ccat(&tokcstr, c);
3846 PEEKC(c, p);
3847 if (!(isnum(c) || isid(c) || c == '.' ||
3848 ((c == '+' || c == '-') &&
3849 (t == 'e' || t == 'E' || t == 'p' || t == 'P'))))
3850 break;
3852 /* We add a trailing '\0' to ease parsing */
3853 cstr_ccat(&tokcstr, '\0');
3854 tokc.cstr = &tokcstr;
3855 tok = TOK_PPNUM;
3856 break;
3857 case '.':
3858 /* special dot handling because it can also start a number */
3859 PEEKC(c, p);
3860 if (isnum(c)) {
3861 cstr_reset(&tokcstr);
3862 cstr_ccat(&tokcstr, '.');
3863 goto parse_num;
3864 } else if (c == '.') {
3865 PEEKC(c, p);
3866 if (c != '.')
3867 expect("'.'");
3868 PEEKC(c, p);
3869 tok = TOK_DOTS;
3870 } else {
3871 tok = '.';
3873 break;
3874 case '\'':
3875 case '\"':
3876 is_long = 0;
3877 str_const:
3879 CString str;
3880 int sep;
3882 sep = c;
3884 /* parse the string */
3885 cstr_new(&str);
3886 p = parse_pp_string(p, sep, &str);
3887 cstr_ccat(&str, '\0');
3889 /* eval the escape (should be done as TOK_PPNUM) */
3890 cstr_reset(&tokcstr);
3891 parse_escape_string(&tokcstr, str.data, is_long);
3892 cstr_free(&str);
3894 if (sep == '\'') {
3895 int char_size;
3896 /* XXX: make it portable */
3897 if (!is_long)
3898 char_size = 1;
3899 else
3900 char_size = sizeof(nwchar_t);
3901 if (tokcstr.size <= char_size)
3902 error("empty character constant");
3903 if (tokcstr.size > 2 * char_size)
3904 warning("multi-character character constant");
3905 if (!is_long) {
3906 tokc.i = *(int8_t *)tokcstr.data;
3907 tok = TOK_CCHAR;
3908 } else {
3909 tokc.i = *(nwchar_t *)tokcstr.data;
3910 tok = TOK_LCHAR;
3912 } else {
3913 tokc.cstr = &tokcstr;
3914 if (!is_long)
3915 tok = TOK_STR;
3916 else
3917 tok = TOK_LSTR;
3920 break;
3922 case '<':
3923 PEEKC(c, p);
3924 if (c == '=') {
3925 p++;
3926 tok = TOK_LE;
3927 } else if (c == '<') {
3928 PEEKC(c, p);
3929 if (c == '=') {
3930 p++;
3931 tok = TOK_A_SHL;
3932 } else {
3933 tok = TOK_SHL;
3935 } else {
3936 tok = TOK_LT;
3938 break;
3940 case '>':
3941 PEEKC(c, p);
3942 if (c == '=') {
3943 p++;
3944 tok = TOK_GE;
3945 } else if (c == '>') {
3946 PEEKC(c, p);
3947 if (c == '=') {
3948 p++;
3949 tok = TOK_A_SAR;
3950 } else {
3951 tok = TOK_SAR;
3953 } else {
3954 tok = TOK_GT;
3956 break;
3958 case '&':
3959 PEEKC(c, p);
3960 if (c == '&') {
3961 p++;
3962 tok = TOK_LAND;
3963 } else if (c == '=') {
3964 p++;
3965 tok = TOK_A_AND;
3966 } else {
3967 tok = '&';
3969 break;
3971 case '|':
3972 PEEKC(c, p);
3973 if (c == '|') {
3974 p++;
3975 tok = TOK_LOR;
3976 } else if (c == '=') {
3977 p++;
3978 tok = TOK_A_OR;
3979 } else {
3980 tok = '|';
3982 break;
3984 case '+':
3985 PEEKC(c, p);
3986 if (c == '+') {
3987 p++;
3988 tok = TOK_INC;
3989 } else if (c == '=') {
3990 p++;
3991 tok = TOK_A_ADD;
3992 } else {
3993 tok = '+';
3995 break;
3997 case '-':
3998 PEEKC(c, p);
3999 if (c == '-') {
4000 p++;
4001 tok = TOK_DEC;
4002 } else if (c == '=') {
4003 p++;
4004 tok = TOK_A_SUB;
4005 } else if (c == '>') {
4006 p++;
4007 tok = TOK_ARROW;
4008 } else {
4009 tok = '-';
4011 break;
4013 PARSE2('!', '!', '=', TOK_NE)
4014 PARSE2('=', '=', '=', TOK_EQ)
4015 PARSE2('*', '*', '=', TOK_A_MUL)
4016 PARSE2('%', '%', '=', TOK_A_MOD)
4017 PARSE2('^', '^', '=', TOK_A_XOR)
4019 /* comments or operator */
4020 case '/':
4021 PEEKC(c, p);
4022 if (c == '*') {
4023 p = parse_comment(p);
4024 goto redo_no_start;
4025 } else if (c == '/') {
4026 p = parse_line_comment(p);
4027 goto redo_no_start;
4028 } else if (c == '=') {
4029 p++;
4030 tok = TOK_A_DIV;
4031 } else {
4032 tok = '/';
4034 break;
4036 /* simple tokens */
4037 case '(':
4038 case ')':
4039 case '[':
4040 case ']':
4041 case '{':
4042 case '}':
4043 case ',':
4044 case ';':
4045 case ':':
4046 case '?':
4047 case '~':
4048 case '$': /* only used in assembler */
4049 case '@': /* dito */
4050 tok = c;
4051 p++;
4052 break;
4053 default:
4054 error("unrecognized character \\x%02x", c);
4055 break;
4057 tok_flags = 0;
4058 keep_tok_flags:
4059 file->buf_ptr = p;
4060 #if defined(PARSE_DEBUG)
4061 printf("token = %s\n", get_tok_str(tok, &tokc));
4062 #endif
4065 /* return next token without macro substitution. Can read input from
4066 macro_ptr buffer */
4067 static void next_nomacro(void)
4069 if (macro_ptr) {
4070 redo:
4071 tok = *macro_ptr;
4072 if (tok) {
4073 TOK_GET(tok, macro_ptr, tokc);
4074 if (tok == TOK_LINENUM) {
4075 file->line_num = tokc.i;
4076 goto redo;
4079 } else {
4080 next_nomacro1();
4084 /* substitute args in macro_str and return allocated string */
4085 static int *macro_arg_subst(Sym **nested_list, int *macro_str, Sym *args)
4087 int *st, last_tok, t, notfirst;
4088 Sym *s;
4089 CValue cval;
4090 TokenString str;
4091 CString cstr;
4093 tok_str_new(&str);
4094 last_tok = 0;
4095 while(1) {
4096 TOK_GET(t, macro_str, cval);
4097 if (!t)
4098 break;
4099 if (t == '#') {
4100 /* stringize */
4101 TOK_GET(t, macro_str, cval);
4102 if (!t)
4103 break;
4104 s = sym_find2(args, t);
4105 if (s) {
4106 cstr_new(&cstr);
4107 st = (int *)s->c;
4108 notfirst = 0;
4109 while (*st) {
4110 if (notfirst)
4111 cstr_ccat(&cstr, ' ');
4112 TOK_GET(t, st, cval);
4113 cstr_cat(&cstr, get_tok_str(t, &cval));
4114 #ifndef PP_NOSPACES
4115 notfirst = 1;
4116 #endif
4118 cstr_ccat(&cstr, '\0');
4119 #ifdef PP_DEBUG
4120 printf("stringize: %s\n", (char *)cstr.data);
4121 #endif
4122 /* add string */
4123 cval.cstr = &cstr;
4124 tok_str_add2(&str, TOK_STR, &cval);
4125 cstr_free(&cstr);
4126 } else {
4127 tok_str_add2(&str, t, &cval);
4129 } else if (t >= TOK_IDENT) {
4130 s = sym_find2(args, t);
4131 if (s) {
4132 st = (int *)s->c;
4133 /* if '##' is present before or after, no arg substitution */
4134 if (*macro_str == TOK_TWOSHARPS || last_tok == TOK_TWOSHARPS) {
4135 /* special case for var arg macros : ## eats the
4136 ',' if empty VA_ARGS variable. */
4137 /* XXX: test of the ',' is not 100%
4138 reliable. should fix it to avoid security
4139 problems */
4140 if (gnu_ext && s->type.t &&
4141 last_tok == TOK_TWOSHARPS &&
4142 str.len >= 2 && str.str[str.len - 2] == ',') {
4143 if (*st == 0) {
4144 /* suppress ',' '##' */
4145 str.len -= 2;
4146 } else {
4147 /* suppress '##' and add variable */
4148 str.len--;
4149 goto add_var;
4151 } else {
4152 int t1;
4153 add_var:
4154 for(;;) {
4155 TOK_GET(t1, st, cval);
4156 if (!t1)
4157 break;
4158 tok_str_add2(&str, t1, &cval);
4161 } else {
4162 /* NOTE: the stream cannot be read when macro
4163 substituing an argument */
4164 macro_subst(&str, nested_list, st, NULL);
4166 } else {
4167 tok_str_add(&str, t);
4169 } else {
4170 tok_str_add2(&str, t, &cval);
4172 last_tok = t;
4174 tok_str_add(&str, 0);
4175 return str.str;
4178 static char const ab_month_name[12][4] =
4180 "Jan", "Feb", "Mar", "Apr", "May", "Jun",
4181 "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
4184 /* do macro substitution of current token with macro 's' and add
4185 result to (tok_str,tok_len). 'nested_list' is the list of all
4186 macros we got inside to avoid recursing. Return non zero if no
4187 substitution needs to be done */
4188 static int macro_subst_tok(TokenString *tok_str,
4189 Sym **nested_list, Sym *s, struct macro_level **can_read_stream)
4191 Sym *args, *sa, *sa1;
4192 int mstr_allocated, parlevel, *mstr, t, t1;
4193 TokenString str;
4194 char *cstrval;
4195 CValue cval;
4196 CString cstr;
4197 char buf[32];
4199 /* if symbol is a macro, prepare substitution */
4200 /* special macros */
4201 if (tok == TOK___LINE__) {
4202 snprintf(buf, sizeof(buf), "%d", file->line_num);
4203 cstrval = buf;
4204 t1 = TOK_PPNUM;
4205 goto add_cstr1;
4206 } else if (tok == TOK___FILE__) {
4207 cstrval = file->filename;
4208 goto add_cstr;
4209 } else if (tok == TOK___DATE__ || tok == TOK___TIME__) {
4210 time_t ti;
4211 struct tm *tm;
4213 time(&ti);
4214 tm = localtime(&ti);
4215 if (tok == TOK___DATE__) {
4216 snprintf(buf, sizeof(buf), "%s %2d %d",
4217 ab_month_name[tm->tm_mon], tm->tm_mday, tm->tm_year + 1900);
4218 } else {
4219 snprintf(buf, sizeof(buf), "%02d:%02d:%02d",
4220 tm->tm_hour, tm->tm_min, tm->tm_sec);
4222 cstrval = buf;
4223 add_cstr:
4224 t1 = TOK_STR;
4225 add_cstr1:
4226 cstr_new(&cstr);
4227 cstr_cat(&cstr, cstrval);
4228 cstr_ccat(&cstr, '\0');
4229 cval.cstr = &cstr;
4230 tok_str_add2(tok_str, t1, &cval);
4231 cstr_free(&cstr);
4232 } else {
4233 mstr = (int *)s->c;
4234 mstr_allocated = 0;
4235 if (s->type.t == MACRO_FUNC) {
4236 /* NOTE: we do not use next_nomacro to avoid eating the
4237 next token. XXX: find better solution */
4238 redo:
4239 if (macro_ptr) {
4240 t = *macro_ptr;
4241 if (t == 0 && can_read_stream) {
4242 /* end of macro stream: we must look at the token
4243 after in the file */
4244 struct macro_level *ml = *can_read_stream;
4245 macro_ptr = NULL;
4246 if (ml)
4248 macro_ptr = ml->p;
4249 ml->p = NULL;
4250 *can_read_stream = ml -> prev;
4252 goto redo;
4254 } else {
4255 /* XXX: incorrect with comments */
4256 ch = file->buf_ptr[0];
4257 while (is_space(ch) || ch == '\n')
4258 cinp();
4259 t = ch;
4261 if (t != '(') /* no macro subst */
4262 return -1;
4264 /* argument macro */
4265 next_nomacro();
4266 next_nomacro();
4267 args = NULL;
4268 sa = s->next;
4269 /* NOTE: empty args are allowed, except if no args */
4270 for(;;) {
4271 /* handle '()' case */
4272 if (!args && !sa && tok == ')')
4273 break;
4274 if (!sa)
4275 error("macro '%s' used with too many args",
4276 get_tok_str(s->v, 0));
4277 tok_str_new(&str);
4278 parlevel = 0;
4279 /* NOTE: non zero sa->t indicates VA_ARGS */
4280 while ((parlevel > 0 ||
4281 (tok != ')' &&
4282 (tok != ',' || sa->type.t))) &&
4283 tok != -1) {
4284 if (tok == '(')
4285 parlevel++;
4286 else if (tok == ')')
4287 parlevel--;
4288 if (tok != TOK_LINEFEED)
4289 tok_str_add2(&str, tok, &tokc);
4290 next_nomacro();
4292 tok_str_add(&str, 0);
4293 sym_push2(&args, sa->v & ~SYM_FIELD, sa->type.t, (int)str.str);
4294 sa = sa->next;
4295 if (tok == ')') {
4296 /* special case for gcc var args: add an empty
4297 var arg argument if it is omitted */
4298 if (sa && sa->type.t && gnu_ext)
4299 continue;
4300 else
4301 break;
4303 if (tok != ',')
4304 expect(",");
4305 next_nomacro();
4307 if (sa) {
4308 error("macro '%s' used with too few args",
4309 get_tok_str(s->v, 0));
4312 /* now subst each arg */
4313 mstr = macro_arg_subst(nested_list, mstr, args);
4314 /* free memory */
4315 sa = args;
4316 while (sa) {
4317 sa1 = sa->prev;
4318 tok_str_free((int *)sa->c);
4319 sym_free(sa);
4320 sa = sa1;
4322 mstr_allocated = 1;
4324 sym_push2(nested_list, s->v, 0, 0);
4325 macro_subst(tok_str, nested_list, mstr, can_read_stream);
4326 /* pop nested defined symbol */
4327 sa1 = *nested_list;
4328 *nested_list = sa1->prev;
4329 sym_free(sa1);
4330 if (mstr_allocated)
4331 tok_str_free(mstr);
4333 return 0;
4336 /* handle the '##' operator. Return NULL if no '##' seen. Otherwise
4337 return the resulting string (which must be freed). */
4338 static inline int *macro_twosharps(const int *macro_str)
4340 TokenSym *ts;
4341 const int *macro_ptr1, *start_macro_ptr, *ptr, *saved_macro_ptr;
4342 int t;
4343 const char *p1, *p2;
4344 CValue cval;
4345 TokenString macro_str1;
4346 CString cstr;
4348 start_macro_ptr = macro_str;
4349 /* we search the first '##' */
4350 for(;;) {
4351 macro_ptr1 = macro_str;
4352 TOK_GET(t, macro_str, cval);
4353 /* nothing more to do if end of string */
4354 if (t == 0)
4355 return NULL;
4356 if (*macro_str == TOK_TWOSHARPS)
4357 break;
4360 /* we saw '##', so we need more processing to handle it */
4361 cstr_new(&cstr);
4362 tok_str_new(&macro_str1);
4363 tok = t;
4364 tokc = cval;
4366 /* add all tokens seen so far */
4367 for(ptr = start_macro_ptr; ptr < macro_ptr1;) {
4368 TOK_GET(t, ptr, cval);
4369 tok_str_add2(&macro_str1, t, &cval);
4371 saved_macro_ptr = macro_ptr;
4372 /* XXX: get rid of the use of macro_ptr here */
4373 macro_ptr = (int *)macro_str;
4374 for(;;) {
4375 while (*macro_ptr == TOK_TWOSHARPS) {
4376 macro_ptr++;
4377 macro_ptr1 = macro_ptr;
4378 t = *macro_ptr;
4379 if (t) {
4380 TOK_GET(t, macro_ptr, cval);
4381 /* We concatenate the two tokens if we have an
4382 identifier or a preprocessing number */
4383 cstr_reset(&cstr);
4384 p1 = get_tok_str(tok, &tokc);
4385 cstr_cat(&cstr, p1);
4386 p2 = get_tok_str(t, &cval);
4387 cstr_cat(&cstr, p2);
4388 cstr_ccat(&cstr, '\0');
4390 if ((tok >= TOK_IDENT || tok == TOK_PPNUM) &&
4391 (t >= TOK_IDENT || t == TOK_PPNUM)) {
4392 if (tok == TOK_PPNUM) {
4393 /* if number, then create a number token */
4394 /* NOTE: no need to allocate because
4395 tok_str_add2() does it */
4396 cstr_reset(&tokcstr);
4397 tokcstr = cstr;
4398 cstr_new(&cstr);
4399 tokc.cstr = &tokcstr;
4400 } else {
4401 /* if identifier, we must do a test to
4402 validate we have a correct identifier */
4403 if (t == TOK_PPNUM) {
4404 const char *p;
4405 int c;
4407 p = p2;
4408 for(;;) {
4409 c = *p;
4410 if (c == '\0')
4411 break;
4412 p++;
4413 if (!isnum(c) && !isid(c))
4414 goto error_pasting;
4417 ts = tok_alloc(cstr.data, strlen(cstr.data));
4418 tok = ts->tok; /* modify current token */
4420 } else {
4421 const char *str = cstr.data;
4422 const unsigned char *q;
4424 /* we look for a valid token */
4425 /* XXX: do more extensive checks */
4426 if (!strcmp(str, ">>=")) {
4427 tok = TOK_A_SAR;
4428 } else if (!strcmp(str, "<<=")) {
4429 tok = TOK_A_SHL;
4430 } else if (strlen(str) == 2) {
4431 /* search in two bytes table */
4432 q = tok_two_chars;
4433 for(;;) {
4434 if (!*q)
4435 goto error_pasting;
4436 if (q[0] == str[0] && q[1] == str[1])
4437 break;
4438 q += 3;
4440 tok = q[2];
4441 } else {
4442 error_pasting:
4443 /* NOTE: because get_tok_str use a static buffer,
4444 we must save it */
4445 cstr_reset(&cstr);
4446 p1 = get_tok_str(tok, &tokc);
4447 cstr_cat(&cstr, p1);
4448 cstr_ccat(&cstr, '\0');
4449 p2 = get_tok_str(t, &cval);
4450 warning("pasting \"%s\" and \"%s\" does not give a valid preprocessing token", cstr.data, p2);
4451 /* cannot merge tokens: just add them separately */
4452 tok_str_add2(&macro_str1, tok, &tokc);
4453 /* XXX: free associated memory ? */
4454 tok = t;
4455 tokc = cval;
4460 tok_str_add2(&macro_str1, tok, &tokc);
4461 next_nomacro();
4462 if (tok == 0)
4463 break;
4465 macro_ptr = (int *)saved_macro_ptr;
4466 cstr_free(&cstr);
4467 tok_str_add(&macro_str1, 0);
4468 return macro_str1.str;
4472 /* do macro substitution of macro_str and add result to
4473 (tok_str,tok_len). 'nested_list' is the list of all macros we got
4474 inside to avoid recursing. */
4475 static void macro_subst(TokenString *tok_str, Sym **nested_list,
4476 const int *macro_str, struct macro_level ** can_read_stream)
4478 Sym *s;
4479 int *macro_str1;
4480 const int *ptr;
4481 int t, ret;
4482 CValue cval;
4483 struct macro_level ml;
4485 /* first scan for '##' operator handling */
4486 ptr = macro_str;
4487 macro_str1 = macro_twosharps(ptr);
4488 if (macro_str1)
4489 ptr = macro_str1;
4490 while (1) {
4491 /* NOTE: ptr == NULL can only happen if tokens are read from
4492 file stream due to a macro function call */
4493 if (ptr == NULL)
4494 break;
4495 TOK_GET(t, ptr, cval);
4496 if (t == 0)
4497 break;
4498 s = define_find(t);
4499 if (s != NULL) {
4500 /* if nested substitution, do nothing */
4501 if (sym_find2(*nested_list, t))
4502 goto no_subst;
4503 ml.p = macro_ptr;
4504 if (can_read_stream)
4505 ml.prev = *can_read_stream, *can_read_stream = &ml;
4506 macro_ptr = (int *)ptr;
4507 tok = t;
4508 ret = macro_subst_tok(tok_str, nested_list, s, can_read_stream);
4509 ptr = (int *)macro_ptr;
4510 macro_ptr = ml.p;
4511 if (can_read_stream && *can_read_stream == &ml)
4512 *can_read_stream = ml.prev;
4513 if (ret != 0)
4514 goto no_subst;
4515 } else {
4516 no_subst:
4517 tok_str_add2(tok_str, t, &cval);
4520 if (macro_str1)
4521 tok_str_free(macro_str1);
4524 /* return next token with macro substitution */
4525 static void next(void)
4527 Sym *nested_list, *s;
4528 TokenString str;
4529 struct macro_level *ml;
4531 redo:
4532 next_nomacro();
4533 if (!macro_ptr) {
4534 /* if not reading from macro substituted string, then try
4535 to substitute macros */
4536 if (tok >= TOK_IDENT &&
4537 (parse_flags & PARSE_FLAG_PREPROCESS)) {
4538 s = define_find(tok);
4539 if (s) {
4540 /* we have a macro: we try to substitute */
4541 tok_str_new(&str);
4542 nested_list = NULL;
4543 ml = NULL;
4544 if (macro_subst_tok(&str, &nested_list, s, &ml) == 0) {
4545 /* substitution done, NOTE: maybe empty */
4546 tok_str_add(&str, 0);
4547 macro_ptr = str.str;
4548 macro_ptr_allocated = str.str;
4549 goto redo;
4553 } else {
4554 if (tok == 0) {
4555 /* end of macro or end of unget buffer */
4556 if (unget_buffer_enabled) {
4557 macro_ptr = unget_saved_macro_ptr;
4558 unget_buffer_enabled = 0;
4559 } else {
4560 /* end of macro string: free it */
4561 tok_str_free(macro_ptr_allocated);
4562 macro_ptr = NULL;
4564 goto redo;
4568 /* convert preprocessor tokens into C tokens */
4569 if (tok == TOK_PPNUM &&
4570 (parse_flags & PARSE_FLAG_TOK_NUM)) {
4571 parse_number((char *)tokc.cstr->data);
4575 /* push back current token and set current token to 'last_tok'. Only
4576 identifier case handled for labels. */
4577 static inline void unget_tok(int last_tok)
4579 int i, n;
4580 int *q;
4581 unget_saved_macro_ptr = macro_ptr;
4582 unget_buffer_enabled = 1;
4583 q = unget_saved_buffer;
4584 macro_ptr = q;
4585 *q++ = tok;
4586 n = tok_ext_size(tok) - 1;
4587 for(i=0;i<n;i++)
4588 *q++ = tokc.tab[i];
4589 *q = 0; /* end of token string */
4590 tok = last_tok;
4594 void swap(int *p, int *q)
4596 int t;
4597 t = *p;
4598 *p = *q;
4599 *q = t;
4602 void vsetc(CType *type, int r, CValue *vc)
4604 int v;
4606 if (vtop >= vstack + (VSTACK_SIZE - 1))
4607 error("memory full");
4608 /* cannot let cpu flags if other instruction are generated. Also
4609 avoid leaving VT_JMP anywhere except on the top of the stack
4610 because it would complicate the code generator. */
4611 if (vtop >= vstack) {
4612 v = vtop->r & VT_VALMASK;
4613 if (v == VT_CMP || (v & ~1) == VT_JMP)
4614 gv(RC_INT);
4616 vtop++;
4617 vtop->type = *type;
4618 vtop->r = r;
4619 vtop->r2 = VT_CONST;
4620 vtop->c = *vc;
4623 /* push integer constant */
4624 void vpushi(int v)
4626 CValue cval;
4627 cval.i = v;
4628 vsetc(&int_type, VT_CONST, &cval);
4631 /* Return a static symbol pointing to a section */
4632 static Sym *get_sym_ref(CType *type, Section *sec,
4633 unsigned long offset, unsigned long size)
4635 int v;
4636 Sym *sym;
4638 v = anon_sym++;
4639 sym = global_identifier_push(v, type->t | VT_STATIC, 0);
4640 sym->type.ref = type->ref;
4641 sym->r = VT_CONST | VT_SYM;
4642 put_extern_sym(sym, sec, offset, size);
4643 return sym;
4646 /* push a reference to a section offset by adding a dummy symbol */
4647 static void vpush_ref(CType *type, Section *sec, unsigned long offset, unsigned long size)
4649 CValue cval;
4651 cval.ul = 0;
4652 vsetc(type, VT_CONST | VT_SYM, &cval);
4653 vtop->sym = get_sym_ref(type, sec, offset, size);
4656 /* define a new external reference to a symbol 'v' of type 'u' */
4657 static Sym *external_global_sym(int v, CType *type, int r)
4659 Sym *s;
4661 s = sym_find(v);
4662 if (!s) {
4663 /* push forward reference */
4664 s = global_identifier_push(v, type->t | VT_EXTERN, 0);
4665 s->type.ref = type->ref;
4666 s->r = r | VT_CONST | VT_SYM;
4668 return s;
4671 /* define a new external reference to a symbol 'v' of type 'u' */
4672 static Sym *external_sym(int v, CType *type, int r)
4674 Sym *s;
4676 s = sym_find(v);
4677 if (!s) {
4678 /* push forward reference */
4679 s = sym_push(v, type, r | VT_CONST | VT_SYM, 0);
4680 s->type.t |= VT_EXTERN;
4681 } else {
4682 if (!is_compatible_types(&s->type, type))
4683 error("incompatible types for redefinition of '%s'",
4684 get_tok_str(v, NULL));
4686 return s;
4689 /* push a reference to global symbol v */
4690 static void vpush_global_sym(CType *type, int v)
4692 Sym *sym;
4693 CValue cval;
4695 sym = external_global_sym(v, type, 0);
4696 cval.ul = 0;
4697 vsetc(type, VT_CONST | VT_SYM, &cval);
4698 vtop->sym = sym;
4701 void vset(CType *type, int r, int v)
4703 CValue cval;
4705 cval.i = v;
4706 vsetc(type, r, &cval);
4709 void vseti(int r, int v)
4711 CType type;
4712 type.t = VT_INT;
4713 vset(&type, r, v);
4716 void vswap(void)
4718 SValue tmp;
4720 tmp = vtop[0];
4721 vtop[0] = vtop[-1];
4722 vtop[-1] = tmp;
4725 void vpushv(SValue *v)
4727 if (vtop >= vstack + (VSTACK_SIZE - 1))
4728 error("memory full");
4729 vtop++;
4730 *vtop = *v;
4733 void vdup(void)
4735 vpushv(vtop);
4738 /* save r to the memory stack, and mark it as being free */
4739 void save_reg(int r)
4741 int l, saved, size, align;
4742 SValue *p, sv;
4743 CType *type;
4745 /* modify all stack values */
4746 saved = 0;
4747 l = 0;
4748 for(p=vstack;p<=vtop;p++) {
4749 if ((p->r & VT_VALMASK) == r ||
4750 ((p->type.t & VT_BTYPE) == VT_LLONG && (p->r2 & VT_VALMASK) == r)) {
4751 /* must save value on stack if not already done */
4752 if (!saved) {
4753 /* NOTE: must reload 'r' because r might be equal to r2 */
4754 r = p->r & VT_VALMASK;
4755 /* store register in the stack */
4756 type = &p->type;
4757 if ((p->r & VT_LVAL) ||
4758 (!is_float(type->t) && (type->t & VT_BTYPE) != VT_LLONG))
4759 type = &int_type;
4760 size = type_size(type, &align);
4761 loc = (loc - size) & -align;
4762 sv.type.t = type->t;
4763 sv.r = VT_LOCAL | VT_LVAL;
4764 sv.c.ul = loc;
4765 store(r, &sv);
4766 #ifdef TCC_TARGET_I386
4767 /* x86 specific: need to pop fp register ST0 if saved */
4768 if (r == TREG_ST0) {
4769 o(0xd9dd); /* fstp %st(1) */
4771 #endif
4772 /* special long long case */
4773 if ((type->t & VT_BTYPE) == VT_LLONG) {
4774 sv.c.ul += 4;
4775 store(p->r2, &sv);
4777 l = loc;
4778 saved = 1;
4780 /* mark that stack entry as being saved on the stack */
4781 if (p->r & VT_LVAL) {
4782 /* also clear the bounded flag because the
4783 relocation address of the function was stored in
4784 p->c.ul */
4785 p->r = (p->r & ~(VT_VALMASK | VT_BOUNDED)) | VT_LLOCAL;
4786 } else {
4787 p->r = lvalue_type(p->type.t) | VT_LOCAL;
4789 p->r2 = VT_CONST;
4790 p->c.ul = l;
4795 /* find a register of class 'rc2' with at most one reference on stack.
4796 * If none, call get_reg(rc) */
4797 int get_reg_ex(int rc, int rc2)
4799 int r;
4800 SValue *p;
4802 for(r=0;r<NB_REGS;r++) {
4803 if (reg_classes[r] & rc2) {
4804 int n;
4805 n=0;
4806 for(p = vstack; p <= vtop; p++) {
4807 if ((p->r & VT_VALMASK) == r ||
4808 (p->r2 & VT_VALMASK) == r)
4809 n++;
4811 if (n <= 1)
4812 return r;
4815 return get_reg(rc);
4818 /* find a free register of class 'rc'. If none, save one register */
4819 int get_reg(int rc)
4821 int r;
4822 SValue *p;
4824 /* find a free register */
4825 for(r=0;r<NB_REGS;r++) {
4826 if (reg_classes[r] & rc) {
4827 for(p=vstack;p<=vtop;p++) {
4828 if ((p->r & VT_VALMASK) == r ||
4829 (p->r2 & VT_VALMASK) == r)
4830 goto notfound;
4832 return r;
4834 notfound: ;
4837 /* no register left : free the first one on the stack (VERY
4838 IMPORTANT to start from the bottom to ensure that we don't
4839 spill registers used in gen_opi()) */
4840 for(p=vstack;p<=vtop;p++) {
4841 r = p->r & VT_VALMASK;
4842 if (r < VT_CONST && (reg_classes[r] & rc))
4843 goto save_found;
4844 /* also look at second register (if long long) */
4845 r = p->r2 & VT_VALMASK;
4846 if (r < VT_CONST && (reg_classes[r] & rc)) {
4847 save_found:
4848 save_reg(r);
4849 return r;
4852 /* Should never comes here */
4853 return -1;
4856 /* save registers up to (vtop - n) stack entry */
4857 void save_regs(int n)
4859 int r;
4860 SValue *p, *p1;
4861 p1 = vtop - n;
4862 for(p = vstack;p <= p1; p++) {
4863 r = p->r & VT_VALMASK;
4864 if (r < VT_CONST) {
4865 save_reg(r);
4870 /* move register 's' to 'r', and flush previous value of r to memory
4871 if needed */
4872 void move_reg(int r, int s)
4874 SValue sv;
4876 if (r != s) {
4877 save_reg(r);
4878 sv.type.t = VT_INT;
4879 sv.r = s;
4880 sv.c.ul = 0;
4881 load(r, &sv);
4885 /* get address of vtop (vtop MUST BE an lvalue) */
4886 void gaddrof(void)
4888 vtop->r &= ~VT_LVAL;
4889 /* tricky: if saved lvalue, then we can go back to lvalue */
4890 if ((vtop->r & VT_VALMASK) == VT_LLOCAL)
4891 vtop->r = (vtop->r & ~(VT_VALMASK | VT_LVAL_TYPE)) | VT_LOCAL | VT_LVAL;
4894 #ifdef CONFIG_TCC_BCHECK
4895 /* generate lvalue bound code */
4896 void gbound(void)
4898 int lval_type;
4899 CType type1;
4901 vtop->r &= ~VT_MUSTBOUND;
4902 /* if lvalue, then use checking code before dereferencing */
4903 if (vtop->r & VT_LVAL) {
4904 /* if not VT_BOUNDED value, then make one */
4905 if (!(vtop->r & VT_BOUNDED)) {
4906 lval_type = vtop->r & (VT_LVAL_TYPE | VT_LVAL);
4907 /* must save type because we must set it to int to get pointer */
4908 type1 = vtop->type;
4909 vtop->type.t = VT_INT;
4910 gaddrof();
4911 vpushi(0);
4912 gen_bounded_ptr_add();
4913 vtop->r |= lval_type;
4914 vtop->type = type1;
4916 /* then check for dereferencing */
4917 gen_bounded_ptr_deref();
4920 #endif
4922 /* store vtop a register belonging to class 'rc'. lvalues are
4923 converted to values. Cannot be used if cannot be converted to
4924 register value (such as structures). */
4925 int gv(int rc)
4927 int r, r2, rc2, bit_pos, bit_size, size, align, i;
4928 unsigned long long ll;
4930 /* NOTE: get_reg can modify vstack[] */
4931 if (vtop->type.t & VT_BITFIELD) {
4932 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
4933 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
4934 /* remove bit field info to avoid loops */
4935 vtop->type.t &= ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT));
4936 /* generate shifts */
4937 vpushi(32 - (bit_pos + bit_size));
4938 gen_op(TOK_SHL);
4939 vpushi(32 - bit_size);
4940 /* NOTE: transformed to SHR if unsigned */
4941 gen_op(TOK_SAR);
4942 r = gv(rc);
4943 } else {
4944 if (is_float(vtop->type.t) &&
4945 (vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
4946 Sym *sym;
4947 int *ptr;
4948 unsigned long offset;
4949 #if defined(TCC_TARGET_ARM) && !defined(TCC_ARM_VFP)
4950 CValue check;
4951 #endif
4953 /* XXX: unify with initializers handling ? */
4954 /* CPUs usually cannot use float constants, so we store them
4955 generically in data segment */
4956 size = type_size(&vtop->type, &align);
4957 offset = (data_section->data_offset + align - 1) & -align;
4958 data_section->data_offset = offset;
4959 /* XXX: not portable yet */
4960 #ifdef __i386__
4961 /* Zero pad x87 tenbyte long doubles */
4962 if (size == 12)
4963 vtop->c.tab[2] &= 0xffff;
4964 #endif
4965 ptr = section_ptr_add(data_section, size);
4966 size = size >> 2;
4967 #if defined(TCC_TARGET_ARM) && !defined(TCC_ARM_VFP)
4968 check.d = 1;
4969 if(check.tab[0])
4970 for(i=0;i<size;i++)
4971 ptr[i] = vtop->c.tab[size-1-i];
4972 else
4973 #endif
4974 for(i=0;i<size;i++)
4975 ptr[i] = vtop->c.tab[i];
4976 sym = get_sym_ref(&vtop->type, data_section, offset, size << 2);
4977 vtop->r |= VT_LVAL | VT_SYM;
4978 vtop->sym = sym;
4979 vtop->c.ul = 0;
4981 #ifdef CONFIG_TCC_BCHECK
4982 if (vtop->r & VT_MUSTBOUND)
4983 gbound();
4984 #endif
4986 r = vtop->r & VT_VALMASK;
4987 /* need to reload if:
4988 - constant
4989 - lvalue (need to dereference pointer)
4990 - already a register, but not in the right class */
4991 if (r >= VT_CONST ||
4992 (vtop->r & VT_LVAL) ||
4993 !(reg_classes[r] & rc) ||
4994 ((vtop->type.t & VT_BTYPE) == VT_LLONG &&
4995 !(reg_classes[vtop->r2] & rc))) {
4996 r = get_reg(rc);
4997 if ((vtop->type.t & VT_BTYPE) == VT_LLONG) {
4998 /* two register type load : expand to two words
4999 temporarily */
5000 if ((vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
5001 /* load constant */
5002 ll = vtop->c.ull;
5003 vtop->c.ui = ll; /* first word */
5004 load(r, vtop);
5005 vtop->r = r; /* save register value */
5006 vpushi(ll >> 32); /* second word */
5007 } else if (r >= VT_CONST || /* XXX: test to VT_CONST incorrect ? */
5008 (vtop->r & VT_LVAL)) {
5009 /* We do not want to modifier the long long
5010 pointer here, so the safest (and less
5011 efficient) is to save all the other registers
5012 in the stack. XXX: totally inefficient. */
5013 save_regs(1);
5014 /* load from memory */
5015 load(r, vtop);
5016 vdup();
5017 vtop[-1].r = r; /* save register value */
5018 /* increment pointer to get second word */
5019 vtop->type.t = VT_INT;
5020 gaddrof();
5021 vpushi(4);
5022 gen_op('+');
5023 vtop->r |= VT_LVAL;
5024 } else {
5025 /* move registers */
5026 load(r, vtop);
5027 vdup();
5028 vtop[-1].r = r; /* save register value */
5029 vtop->r = vtop[-1].r2;
5031 /* allocate second register */
5032 rc2 = RC_INT;
5033 if (rc == RC_IRET)
5034 rc2 = RC_LRET;
5035 r2 = get_reg(rc2);
5036 load(r2, vtop);
5037 vpop();
5038 /* write second register */
5039 vtop->r2 = r2;
5040 } else if ((vtop->r & VT_LVAL) && !is_float(vtop->type.t)) {
5041 int t1, t;
5042 /* lvalue of scalar type : need to use lvalue type
5043 because of possible cast */
5044 t = vtop->type.t;
5045 t1 = t;
5046 /* compute memory access type */
5047 if (vtop->r & VT_LVAL_BYTE)
5048 t = VT_BYTE;
5049 else if (vtop->r & VT_LVAL_SHORT)
5050 t = VT_SHORT;
5051 if (vtop->r & VT_LVAL_UNSIGNED)
5052 t |= VT_UNSIGNED;
5053 vtop->type.t = t;
5054 load(r, vtop);
5055 /* restore wanted type */
5056 vtop->type.t = t1;
5057 } else {
5058 /* one register type load */
5059 load(r, vtop);
5062 vtop->r = r;
5063 #ifdef TCC_TARGET_C67
5064 /* uses register pairs for doubles */
5065 if ((vtop->type.t & VT_BTYPE) == VT_DOUBLE)
5066 vtop->r2 = r+1;
5067 #endif
5069 return r;
5072 /* generate vtop[-1] and vtop[0] in resp. classes rc1 and rc2 */
5073 void gv2(int rc1, int rc2)
5075 int v;
5077 /* generate more generic register first. But VT_JMP or VT_CMP
5078 values must be generated first in all cases to avoid possible
5079 reload errors */
5080 v = vtop[0].r & VT_VALMASK;
5081 if (v != VT_CMP && (v & ~1) != VT_JMP && rc1 <= rc2) {
5082 vswap();
5083 gv(rc1);
5084 vswap();
5085 gv(rc2);
5086 /* test if reload is needed for first register */
5087 if ((vtop[-1].r & VT_VALMASK) >= VT_CONST) {
5088 vswap();
5089 gv(rc1);
5090 vswap();
5092 } else {
5093 gv(rc2);
5094 vswap();
5095 gv(rc1);
5096 vswap();
5097 /* test if reload is needed for first register */
5098 if ((vtop[0].r & VT_VALMASK) >= VT_CONST) {
5099 gv(rc2);
5104 /* expand long long on stack in two int registers */
5105 void lexpand(void)
5107 int u;
5109 u = vtop->type.t & VT_UNSIGNED;
5110 gv(RC_INT);
5111 vdup();
5112 vtop[0].r = vtop[-1].r2;
5113 vtop[0].r2 = VT_CONST;
5114 vtop[-1].r2 = VT_CONST;
5115 vtop[0].type.t = VT_INT | u;
5116 vtop[-1].type.t = VT_INT | u;
5119 #ifdef TCC_TARGET_ARM
5120 /* expand long long on stack */
5121 void lexpand_nr(void)
5123 int u,v;
5125 u = vtop->type.t & VT_UNSIGNED;
5126 vdup();
5127 vtop->r2 = VT_CONST;
5128 vtop->type.t = VT_INT | u;
5129 v=vtop[-1].r & (VT_VALMASK | VT_LVAL);
5130 if (v == VT_CONST) {
5131 vtop[-1].c.ui = vtop->c.ull;
5132 vtop->c.ui = vtop->c.ull >> 32;
5133 vtop->r = VT_CONST;
5134 } else if (v == (VT_LVAL|VT_CONST) || v == (VT_LVAL|VT_LOCAL)) {
5135 vtop->c.ui += 4;
5136 vtop->r = vtop[-1].r;
5137 } else if (v > VT_CONST) {
5138 vtop--;
5139 lexpand();
5140 } else
5141 vtop->r = vtop[-1].r2;
5142 vtop[-1].r2 = VT_CONST;
5143 vtop[-1].type.t = VT_INT | u;
5145 #endif
5147 /* build a long long from two ints */
5148 void lbuild(int t)
5150 gv2(RC_INT, RC_INT);
5151 vtop[-1].r2 = vtop[0].r;
5152 vtop[-1].type.t = t;
5153 vpop();
5156 /* rotate n first stack elements to the bottom
5157 I1 ... In -> I2 ... In I1 [top is right]
5159 void vrotb(int n)
5161 int i;
5162 SValue tmp;
5164 tmp = vtop[-n + 1];
5165 for(i=-n+1;i!=0;i++)
5166 vtop[i] = vtop[i+1];
5167 vtop[0] = tmp;
5170 /* rotate n first stack elements to the top
5171 I1 ... In -> In I1 ... I(n-1) [top is right]
5173 void vrott(int n)
5175 int i;
5176 SValue tmp;
5178 tmp = vtop[0];
5179 for(i = 0;i < n - 1; i++)
5180 vtop[-i] = vtop[-i - 1];
5181 vtop[-n + 1] = tmp;
5184 #ifdef TCC_TARGET_ARM
5185 /* like vrott but in other direction
5186 In ... I1 -> I(n-1) ... I1 In [top is right]
5188 void vnrott(int n)
5190 int i;
5191 SValue tmp;
5193 tmp = vtop[-n + 1];
5194 for(i = n - 1; i > 0; i--)
5195 vtop[-i] = vtop[-i + 1];
5196 vtop[0] = tmp;
5198 #endif
5200 /* pop stack value */
5201 void vpop(void)
5203 int v;
5204 v = vtop->r & VT_VALMASK;
5205 #ifdef TCC_TARGET_I386
5206 /* for x86, we need to pop the FP stack */
5207 if (v == TREG_ST0 && !nocode_wanted) {
5208 o(0xd9dd); /* fstp %st(1) */
5209 } else
5210 #endif
5211 if (v == VT_JMP || v == VT_JMPI) {
5212 /* need to put correct jump if && or || without test */
5213 gsym(vtop->c.ul);
5215 vtop--;
5218 /* convert stack entry to register and duplicate its value in another
5219 register */
5220 void gv_dup(void)
5222 int rc, t, r, r1;
5223 SValue sv;
5225 t = vtop->type.t;
5226 if ((t & VT_BTYPE) == VT_LLONG) {
5227 lexpand();
5228 gv_dup();
5229 vswap();
5230 vrotb(3);
5231 gv_dup();
5232 vrotb(4);
5233 /* stack: H L L1 H1 */
5234 lbuild(t);
5235 vrotb(3);
5236 vrotb(3);
5237 vswap();
5238 lbuild(t);
5239 vswap();
5240 } else {
5241 /* duplicate value */
5242 rc = RC_INT;
5243 sv.type.t = VT_INT;
5244 if (is_float(t)) {
5245 rc = RC_FLOAT;
5246 sv.type.t = t;
5248 r = gv(rc);
5249 r1 = get_reg(rc);
5250 sv.r = r;
5251 sv.c.ul = 0;
5252 load(r1, &sv); /* move r to r1 */
5253 vdup();
5254 /* duplicates value */
5255 vtop->r = r1;
5259 /* generate CPU independent (unsigned) long long operations */
5260 void gen_opl(int op)
5262 int t, a, b, op1, c, i;
5263 int func;
5264 SValue tmp;
5266 switch(op) {
5267 case '/':
5268 case TOK_PDIV:
5269 func = TOK___divdi3;
5270 goto gen_func;
5271 case TOK_UDIV:
5272 func = TOK___udivdi3;
5273 goto gen_func;
5274 case '%':
5275 func = TOK___moddi3;
5276 goto gen_func;
5277 case TOK_UMOD:
5278 func = TOK___umoddi3;
5279 gen_func:
5280 /* call generic long long function */
5281 vpush_global_sym(&func_old_type, func);
5282 vrott(3);
5283 gfunc_call(2);
5284 vpushi(0);
5285 vtop->r = REG_IRET;
5286 vtop->r2 = REG_LRET;
5287 break;
5288 case '^':
5289 case '&':
5290 case '|':
5291 case '*':
5292 case '+':
5293 case '-':
5294 t = vtop->type.t;
5295 vswap();
5296 lexpand();
5297 vrotb(3);
5298 lexpand();
5299 /* stack: L1 H1 L2 H2 */
5300 tmp = vtop[0];
5301 vtop[0] = vtop[-3];
5302 vtop[-3] = tmp;
5303 tmp = vtop[-2];
5304 vtop[-2] = vtop[-3];
5305 vtop[-3] = tmp;
5306 vswap();
5307 /* stack: H1 H2 L1 L2 */
5308 if (op == '*') {
5309 vpushv(vtop - 1);
5310 vpushv(vtop - 1);
5311 gen_op(TOK_UMULL);
5312 lexpand();
5313 /* stack: H1 H2 L1 L2 ML MH */
5314 for(i=0;i<4;i++)
5315 vrotb(6);
5316 /* stack: ML MH H1 H2 L1 L2 */
5317 tmp = vtop[0];
5318 vtop[0] = vtop[-2];
5319 vtop[-2] = tmp;
5320 /* stack: ML MH H1 L2 H2 L1 */
5321 gen_op('*');
5322 vrotb(3);
5323 vrotb(3);
5324 gen_op('*');
5325 /* stack: ML MH M1 M2 */
5326 gen_op('+');
5327 gen_op('+');
5328 } else if (op == '+' || op == '-') {
5329 /* XXX: add non carry method too (for MIPS or alpha) */
5330 if (op == '+')
5331 op1 = TOK_ADDC1;
5332 else
5333 op1 = TOK_SUBC1;
5334 gen_op(op1);
5335 /* stack: H1 H2 (L1 op L2) */
5336 vrotb(3);
5337 vrotb(3);
5338 gen_op(op1 + 1); /* TOK_xxxC2 */
5339 } else {
5340 gen_op(op);
5341 /* stack: H1 H2 (L1 op L2) */
5342 vrotb(3);
5343 vrotb(3);
5344 /* stack: (L1 op L2) H1 H2 */
5345 gen_op(op);
5346 /* stack: (L1 op L2) (H1 op H2) */
5348 /* stack: L H */
5349 lbuild(t);
5350 break;
5351 case TOK_SAR:
5352 case TOK_SHR:
5353 case TOK_SHL:
5354 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
5355 t = vtop[-1].type.t;
5356 vswap();
5357 lexpand();
5358 vrotb(3);
5359 /* stack: L H shift */
5360 c = (int)vtop->c.i;
5361 /* constant: simpler */
5362 /* NOTE: all comments are for SHL. the other cases are
5363 done by swaping words */
5364 vpop();
5365 if (op != TOK_SHL)
5366 vswap();
5367 if (c >= 32) {
5368 /* stack: L H */
5369 vpop();
5370 if (c > 32) {
5371 vpushi(c - 32);
5372 gen_op(op);
5374 if (op != TOK_SAR) {
5375 vpushi(0);
5376 } else {
5377 gv_dup();
5378 vpushi(31);
5379 gen_op(TOK_SAR);
5381 vswap();
5382 } else {
5383 vswap();
5384 gv_dup();
5385 /* stack: H L L */
5386 vpushi(c);
5387 gen_op(op);
5388 vswap();
5389 vpushi(32 - c);
5390 if (op == TOK_SHL)
5391 gen_op(TOK_SHR);
5392 else
5393 gen_op(TOK_SHL);
5394 vrotb(3);
5395 /* stack: L L H */
5396 vpushi(c);
5397 if (op == TOK_SHL)
5398 gen_op(TOK_SHL);
5399 else
5400 gen_op(TOK_SHR);
5401 gen_op('|');
5403 if (op != TOK_SHL)
5404 vswap();
5405 lbuild(t);
5406 } else {
5407 /* XXX: should provide a faster fallback on x86 ? */
5408 switch(op) {
5409 case TOK_SAR:
5410 func = TOK___sardi3;
5411 goto gen_func;
5412 case TOK_SHR:
5413 func = TOK___shrdi3;
5414 goto gen_func;
5415 case TOK_SHL:
5416 func = TOK___shldi3;
5417 goto gen_func;
5420 break;
5421 default:
5422 /* compare operations */
5423 t = vtop->type.t;
5424 vswap();
5425 lexpand();
5426 vrotb(3);
5427 lexpand();
5428 /* stack: L1 H1 L2 H2 */
5429 tmp = vtop[-1];
5430 vtop[-1] = vtop[-2];
5431 vtop[-2] = tmp;
5432 /* stack: L1 L2 H1 H2 */
5433 /* compare high */
5434 op1 = op;
5435 /* when values are equal, we need to compare low words. since
5436 the jump is inverted, we invert the test too. */
5437 if (op1 == TOK_LT)
5438 op1 = TOK_LE;
5439 else if (op1 == TOK_GT)
5440 op1 = TOK_GE;
5441 else if (op1 == TOK_ULT)
5442 op1 = TOK_ULE;
5443 else if (op1 == TOK_UGT)
5444 op1 = TOK_UGE;
5445 a = 0;
5446 b = 0;
5447 gen_op(op1);
5448 if (op1 != TOK_NE) {
5449 a = gtst(1, 0);
5451 if (op != TOK_EQ) {
5452 /* generate non equal test */
5453 /* XXX: NOT PORTABLE yet */
5454 if (a == 0) {
5455 b = gtst(0, 0);
5456 } else {
5457 #if defined(TCC_TARGET_I386)
5458 b = psym(0x850f, 0);
5459 #elif defined(TCC_TARGET_ARM)
5460 b = ind;
5461 o(0x1A000000 | encbranch(ind, 0, 1));
5462 #elif defined(TCC_TARGET_C67)
5463 error("not implemented");
5464 #else
5465 #error not supported
5466 #endif
5469 /* compare low. Always unsigned */
5470 op1 = op;
5471 if (op1 == TOK_LT)
5472 op1 = TOK_ULT;
5473 else if (op1 == TOK_LE)
5474 op1 = TOK_ULE;
5475 else if (op1 == TOK_GT)
5476 op1 = TOK_UGT;
5477 else if (op1 == TOK_GE)
5478 op1 = TOK_UGE;
5479 gen_op(op1);
5480 a = gtst(1, a);
5481 gsym(b);
5482 vseti(VT_JMPI, a);
5483 break;
5487 /* handle integer constant optimizations and various machine
5488 independent opt */
5489 void gen_opic(int op)
5491 int c1, c2, t1, t2, n;
5492 SValue *v1, *v2;
5493 long long l1, l2;
5494 typedef unsigned long long U;
5496 v1 = vtop - 1;
5497 v2 = vtop;
5498 t1 = v1->type.t & VT_BTYPE;
5499 t2 = v2->type.t & VT_BTYPE;
5500 l1 = (t1 == VT_LLONG) ? v1->c.ll : v1->c.i;
5501 l2 = (t2 == VT_LLONG) ? v2->c.ll : v2->c.i;
5503 /* currently, we cannot do computations with forward symbols */
5504 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5505 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5506 if (c1 && c2) {
5507 switch(op) {
5508 case '+': l1 += l2; break;
5509 case '-': l1 -= l2; break;
5510 case '&': l1 &= l2; break;
5511 case '^': l1 ^= l2; break;
5512 case '|': l1 |= l2; break;
5513 case '*': l1 *= l2; break;
5515 case TOK_PDIV:
5516 case '/':
5517 case '%':
5518 case TOK_UDIV:
5519 case TOK_UMOD:
5520 /* if division by zero, generate explicit division */
5521 if (l2 == 0) {
5522 if (const_wanted)
5523 error("division by zero in constant");
5524 goto general_case;
5526 switch(op) {
5527 default: l1 /= l2; break;
5528 case '%': l1 %= l2; break;
5529 case TOK_UDIV: l1 = (U)l1 / l2; break;
5530 case TOK_UMOD: l1 = (U)l1 % l2; break;
5532 break;
5533 case TOK_SHL: l1 <<= l2; break;
5534 case TOK_SHR: l1 = (U)l1 >> l2; break;
5535 case TOK_SAR: l1 >>= l2; break;
5536 /* tests */
5537 case TOK_ULT: l1 = (U)l1 < (U)l2; break;
5538 case TOK_UGE: l1 = (U)l1 >= (U)l2; break;
5539 case TOK_EQ: l1 = l1 == l2; break;
5540 case TOK_NE: l1 = l1 != l2; break;
5541 case TOK_ULE: l1 = (U)l1 <= (U)l2; break;
5542 case TOK_UGT: l1 = (U)l1 > (U)l2; break;
5543 case TOK_LT: l1 = l1 < l2; break;
5544 case TOK_GE: l1 = l1 >= l2; break;
5545 case TOK_LE: l1 = l1 <= l2; break;
5546 case TOK_GT: l1 = l1 > l2; break;
5547 /* logical */
5548 case TOK_LAND: l1 = l1 && l2; break;
5549 case TOK_LOR: l1 = l1 || l2; break;
5550 default:
5551 goto general_case;
5553 v1->c.ll = l1;
5554 vtop--;
5555 } else {
5556 /* if commutative ops, put c2 as constant */
5557 if (c1 && (op == '+' || op == '&' || op == '^' ||
5558 op == '|' || op == '*')) {
5559 vswap();
5560 c2 = c1; //c = c1, c1 = c2, c2 = c;
5561 l2 = l1; //l = l1, l1 = l2, l2 = l;
5563 /* Filter out NOP operations like x*1, x-0, x&-1... */
5564 if (c2 && (((op == '*' || op == '/' || op == TOK_UDIV ||
5565 op == TOK_PDIV) &&
5566 l2 == 1) ||
5567 ((op == '+' || op == '-' || op == '|' || op == '^' ||
5568 op == TOK_SHL || op == TOK_SHR || op == TOK_SAR) &&
5569 l2 == 0) ||
5570 (op == '&' &&
5571 l2 == -1))) {
5572 /* nothing to do */
5573 vtop--;
5574 } else if (c2 && (op == '*' || op == TOK_PDIV || op == TOK_UDIV)) {
5575 /* try to use shifts instead of muls or divs */
5576 if (l2 > 0 && (l2 & (l2 - 1)) == 0) {
5577 n = -1;
5578 while (l2) {
5579 l2 >>= 1;
5580 n++;
5582 vtop->c.ll = n;
5583 if (op == '*')
5584 op = TOK_SHL;
5585 else if (op == TOK_PDIV)
5586 op = TOK_SAR;
5587 else
5588 op = TOK_SHR;
5590 goto general_case;
5591 } else if (c2 && (op == '+' || op == '-') &&
5592 (vtop[-1].r & (VT_VALMASK | VT_LVAL | VT_SYM)) ==
5593 (VT_CONST | VT_SYM)) {
5594 /* symbol + constant case */
5595 if (op == '-')
5596 l2 = -l2;
5597 vtop--;
5598 vtop->c.ll += l2;
5599 } else {
5600 general_case:
5601 if (!nocode_wanted) {
5602 /* call low level op generator */
5603 if (t1 == VT_LLONG || t2 == VT_LLONG)
5604 gen_opl(op);
5605 else
5606 gen_opi(op);
5607 } else {
5608 vtop--;
5614 /* generate a floating point operation with constant propagation */
5615 void gen_opif(int op)
5617 int c1, c2;
5618 SValue *v1, *v2;
5619 long double f1, f2;
5621 v1 = vtop - 1;
5622 v2 = vtop;
5623 /* currently, we cannot do computations with forward symbols */
5624 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5625 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5626 if (c1 && c2) {
5627 if (v1->type.t == VT_FLOAT) {
5628 f1 = v1->c.f;
5629 f2 = v2->c.f;
5630 } else if (v1->type.t == VT_DOUBLE) {
5631 f1 = v1->c.d;
5632 f2 = v2->c.d;
5633 } else {
5634 f1 = v1->c.ld;
5635 f2 = v2->c.ld;
5638 /* NOTE: we only do constant propagation if finite number (not
5639 NaN or infinity) (ANSI spec) */
5640 if (!ieee_finite(f1) || !ieee_finite(f2))
5641 goto general_case;
5643 switch(op) {
5644 case '+': f1 += f2; break;
5645 case '-': f1 -= f2; break;
5646 case '*': f1 *= f2; break;
5647 case '/':
5648 if (f2 == 0.0) {
5649 if (const_wanted)
5650 error("division by zero in constant");
5651 goto general_case;
5653 f1 /= f2;
5654 break;
5655 /* XXX: also handles tests ? */
5656 default:
5657 goto general_case;
5659 /* XXX: overflow test ? */
5660 if (v1->type.t == VT_FLOAT) {
5661 v1->c.f = f1;
5662 } else if (v1->type.t == VT_DOUBLE) {
5663 v1->c.d = f1;
5664 } else {
5665 v1->c.ld = f1;
5667 vtop--;
5668 } else {
5669 general_case:
5670 if (!nocode_wanted) {
5671 gen_opf(op);
5672 } else {
5673 vtop--;
5678 static int pointed_size(CType *type)
5680 int align;
5681 return type_size(pointed_type(type), &align);
5684 static inline int is_null_pointer(SValue *p)
5686 if ((p->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
5687 return 0;
5688 return ((p->type.t & VT_BTYPE) == VT_INT && p->c.i == 0) ||
5689 ((p->type.t & VT_BTYPE) == VT_LLONG && p->c.ll == 0);
5692 static inline int is_integer_btype(int bt)
5694 return (bt == VT_BYTE || bt == VT_SHORT ||
5695 bt == VT_INT || bt == VT_LLONG);
5698 /* check types for comparison or substraction of pointers */
5699 static void check_comparison_pointer_types(SValue *p1, SValue *p2, int op)
5701 CType *type1, *type2, tmp_type1, tmp_type2;
5702 int bt1, bt2;
5704 /* null pointers are accepted for all comparisons as gcc */
5705 if (is_null_pointer(p1) || is_null_pointer(p2))
5706 return;
5707 type1 = &p1->type;
5708 type2 = &p2->type;
5709 bt1 = type1->t & VT_BTYPE;
5710 bt2 = type2->t & VT_BTYPE;
5711 /* accept comparison between pointer and integer with a warning */
5712 if ((is_integer_btype(bt1) || is_integer_btype(bt2)) && op != '-') {
5713 if (op != TOK_LOR && op != TOK_LAND )
5714 warning("comparison between pointer and integer");
5715 return;
5718 /* both must be pointers or implicit function pointers */
5719 if (bt1 == VT_PTR) {
5720 type1 = pointed_type(type1);
5721 } else if (bt1 != VT_FUNC)
5722 goto invalid_operands;
5724 if (bt2 == VT_PTR) {
5725 type2 = pointed_type(type2);
5726 } else if (bt2 != VT_FUNC) {
5727 invalid_operands:
5728 error("invalid operands to binary %s", get_tok_str(op, NULL));
5730 if ((type1->t & VT_BTYPE) == VT_VOID ||
5731 (type2->t & VT_BTYPE) == VT_VOID)
5732 return;
5733 tmp_type1 = *type1;
5734 tmp_type2 = *type2;
5735 tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
5736 tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
5737 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
5738 /* gcc-like error if '-' is used */
5739 if (op == '-')
5740 goto invalid_operands;
5741 else
5742 warning("comparison of distinct pointer types lacks a cast");
5746 /* generic gen_op: handles types problems */
5747 void gen_op(int op)
5749 int u, t1, t2, bt1, bt2, t;
5750 CType type1;
5752 t1 = vtop[-1].type.t;
5753 t2 = vtop[0].type.t;
5754 bt1 = t1 & VT_BTYPE;
5755 bt2 = t2 & VT_BTYPE;
5757 if (bt1 == VT_PTR || bt2 == VT_PTR) {
5758 /* at least one operand is a pointer */
5759 /* relationnal op: must be both pointers */
5760 if (op >= TOK_ULT && op <= TOK_LOR) {
5761 check_comparison_pointer_types(vtop - 1, vtop, op);
5762 /* pointers are handled are unsigned */
5763 t = VT_INT | VT_UNSIGNED;
5764 goto std_op;
5766 /* if both pointers, then it must be the '-' op */
5767 if (bt1 == VT_PTR && bt2 == VT_PTR) {
5768 if (op != '-')
5769 error("cannot use pointers here");
5770 check_comparison_pointer_types(vtop - 1, vtop, op);
5771 /* XXX: check that types are compatible */
5772 u = pointed_size(&vtop[-1].type);
5773 gen_opic(op);
5774 /* set to integer type */
5775 vtop->type.t = VT_INT;
5776 vpushi(u);
5777 gen_op(TOK_PDIV);
5778 } else {
5779 /* exactly one pointer : must be '+' or '-'. */
5780 if (op != '-' && op != '+')
5781 error("cannot use pointers here");
5782 /* Put pointer as first operand */
5783 if (bt2 == VT_PTR) {
5784 vswap();
5785 swap(&t1, &t2);
5787 type1 = vtop[-1].type;
5788 /* XXX: cast to int ? (long long case) */
5789 vpushi(pointed_size(&vtop[-1].type));
5790 gen_op('*');
5791 #ifdef CONFIG_TCC_BCHECK
5792 /* if evaluating constant expression, no code should be
5793 generated, so no bound check */
5794 if (do_bounds_check && !const_wanted) {
5795 /* if bounded pointers, we generate a special code to
5796 test bounds */
5797 if (op == '-') {
5798 vpushi(0);
5799 vswap();
5800 gen_op('-');
5802 gen_bounded_ptr_add();
5803 } else
5804 #endif
5806 gen_opic(op);
5808 /* put again type if gen_opic() swaped operands */
5809 vtop->type = type1;
5811 } else if (is_float(bt1) || is_float(bt2)) {
5812 /* compute bigger type and do implicit casts */
5813 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
5814 t = VT_LDOUBLE;
5815 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
5816 t = VT_DOUBLE;
5817 } else {
5818 t = VT_FLOAT;
5820 /* floats can only be used for a few operations */
5821 if (op != '+' && op != '-' && op != '*' && op != '/' &&
5822 (op < TOK_ULT || op > TOK_GT))
5823 error("invalid operands for binary operation");
5824 goto std_op;
5825 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
5826 /* cast to biggest op */
5827 t = VT_LLONG;
5828 /* convert to unsigned if it does not fit in a long long */
5829 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
5830 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
5831 t |= VT_UNSIGNED;
5832 goto std_op;
5833 } else {
5834 /* integer operations */
5835 t = VT_INT;
5836 /* convert to unsigned if it does not fit in an integer */
5837 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
5838 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
5839 t |= VT_UNSIGNED;
5840 std_op:
5841 /* XXX: currently, some unsigned operations are explicit, so
5842 we modify them here */
5843 if (t & VT_UNSIGNED) {
5844 if (op == TOK_SAR)
5845 op = TOK_SHR;
5846 else if (op == '/')
5847 op = TOK_UDIV;
5848 else if (op == '%')
5849 op = TOK_UMOD;
5850 else if (op == TOK_LT)
5851 op = TOK_ULT;
5852 else if (op == TOK_GT)
5853 op = TOK_UGT;
5854 else if (op == TOK_LE)
5855 op = TOK_ULE;
5856 else if (op == TOK_GE)
5857 op = TOK_UGE;
5859 vswap();
5860 type1.t = t;
5861 gen_cast(&type1);
5862 vswap();
5863 /* special case for shifts and long long: we keep the shift as
5864 an integer */
5865 if (op == TOK_SHR || op == TOK_SAR || op == TOK_SHL)
5866 type1.t = VT_INT;
5867 gen_cast(&type1);
5868 if (is_float(t))
5869 gen_opif(op);
5870 else
5871 gen_opic(op);
5872 if (op >= TOK_ULT && op <= TOK_GT) {
5873 /* relationnal op: the result is an int */
5874 vtop->type.t = VT_INT;
5875 } else {
5876 vtop->type.t = t;
5881 /* generic itof for unsigned long long case */
5882 void gen_cvt_itof1(int t)
5884 if ((vtop->type.t & (VT_BTYPE | VT_UNSIGNED)) ==
5885 (VT_LLONG | VT_UNSIGNED)) {
5887 if (t == VT_FLOAT)
5888 vpush_global_sym(&func_old_type, TOK___ulltof);
5889 else if (t == VT_DOUBLE)
5890 vpush_global_sym(&func_old_type, TOK___ulltod);
5891 else
5892 vpush_global_sym(&func_old_type, TOK___ulltold);
5893 vrott(2);
5894 gfunc_call(1);
5895 vpushi(0);
5896 vtop->r = REG_FRET;
5897 } else {
5898 gen_cvt_itof(t);
5902 /* generic ftoi for unsigned long long case */
5903 void gen_cvt_ftoi1(int t)
5905 int st;
5907 if (t == (VT_LLONG | VT_UNSIGNED)) {
5908 /* not handled natively */
5909 st = vtop->type.t & VT_BTYPE;
5910 if (st == VT_FLOAT)
5911 vpush_global_sym(&func_old_type, TOK___fixunssfdi);
5912 else if (st == VT_DOUBLE)
5913 vpush_global_sym(&func_old_type, TOK___fixunsdfdi);
5914 else
5915 vpush_global_sym(&func_old_type, TOK___fixunsxfdi);
5916 vrott(2);
5917 gfunc_call(1);
5918 vpushi(0);
5919 vtop->r = REG_IRET;
5920 vtop->r2 = REG_LRET;
5921 } else {
5922 gen_cvt_ftoi(t);
5926 /* force char or short cast */
5927 void force_charshort_cast(int t)
5929 int bits, dbt;
5930 dbt = t & VT_BTYPE;
5931 /* XXX: add optimization if lvalue : just change type and offset */
5932 if (dbt == VT_BYTE)
5933 bits = 8;
5934 else
5935 bits = 16;
5936 if (t & VT_UNSIGNED) {
5937 vpushi((1 << bits) - 1);
5938 gen_op('&');
5939 } else {
5940 bits = 32 - bits;
5941 vpushi(bits);
5942 gen_op(TOK_SHL);
5943 /* result must be signed or the SAR is converted to an SHL
5944 This was not the case when "t" was a signed short
5945 and the last value on the stack was an unsigned int */
5946 vtop->type.t &= ~VT_UNSIGNED;
5947 vpushi(bits);
5948 gen_op(TOK_SAR);
5952 /* cast 'vtop' to 'type'. Casting to bitfields is forbidden. */
5953 static void gen_cast(CType *type)
5955 int sbt, dbt, sf, df, c;
5957 /* special delayed cast for char/short */
5958 /* XXX: in some cases (multiple cascaded casts), it may still
5959 be incorrect */
5960 if (vtop->r & VT_MUSTCAST) {
5961 vtop->r &= ~VT_MUSTCAST;
5962 force_charshort_cast(vtop->type.t);
5965 /* bitfields first get cast to ints */
5966 if (vtop->type.t & VT_BITFIELD) {
5967 gv(RC_INT);
5970 dbt = type->t & (VT_BTYPE | VT_UNSIGNED);
5971 sbt = vtop->type.t & (VT_BTYPE | VT_UNSIGNED);
5973 if (sbt != dbt && !nocode_wanted) {
5974 sf = is_float(sbt);
5975 df = is_float(dbt);
5976 c = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5977 if (sf && df) {
5978 /* convert from fp to fp */
5979 if (c) {
5980 /* constant case: we can do it now */
5981 /* XXX: in ISOC, cannot do it if error in convert */
5982 if (dbt == VT_FLOAT && sbt == VT_DOUBLE)
5983 vtop->c.f = (float)vtop->c.d;
5984 else if (dbt == VT_FLOAT && sbt == VT_LDOUBLE)
5985 vtop->c.f = (float)vtop->c.ld;
5986 else if (dbt == VT_DOUBLE && sbt == VT_FLOAT)
5987 vtop->c.d = (double)vtop->c.f;
5988 else if (dbt == VT_DOUBLE && sbt == VT_LDOUBLE)
5989 vtop->c.d = (double)vtop->c.ld;
5990 else if (dbt == VT_LDOUBLE && sbt == VT_FLOAT)
5991 vtop->c.ld = (long double)vtop->c.f;
5992 else if (dbt == VT_LDOUBLE && sbt == VT_DOUBLE)
5993 vtop->c.ld = (long double)vtop->c.d;
5994 } else {
5995 /* non constant case: generate code */
5996 gen_cvt_ftof(dbt);
5998 } else if (df) {
5999 /* convert int to fp */
6000 if (c) {
6001 switch(sbt) {
6002 case VT_LLONG | VT_UNSIGNED:
6003 case VT_LLONG:
6004 /* XXX: add const cases for long long */
6005 goto do_itof;
6006 case VT_INT | VT_UNSIGNED:
6007 switch(dbt) {
6008 case VT_FLOAT: vtop->c.f = (float)vtop->c.ui; break;
6009 case VT_DOUBLE: vtop->c.d = (double)vtop->c.ui; break;
6010 case VT_LDOUBLE: vtop->c.ld = (long double)vtop->c.ui; break;
6012 break;
6013 default:
6014 switch(dbt) {
6015 case VT_FLOAT: vtop->c.f = (float)vtop->c.i; break;
6016 case VT_DOUBLE: vtop->c.d = (double)vtop->c.i; break;
6017 case VT_LDOUBLE: vtop->c.ld = (long double)vtop->c.i; break;
6019 break;
6021 } else {
6022 do_itof:
6023 #if !defined(TCC_TARGET_ARM)
6024 gen_cvt_itof1(dbt);
6025 #else
6026 gen_cvt_itof(dbt);
6027 #endif
6029 } else if (sf) {
6030 /* convert fp to int */
6031 if (dbt == VT_BOOL) {
6032 vpushi(0);
6033 gen_op(TOK_NE);
6034 } else {
6035 /* we handle char/short/etc... with generic code */
6036 if (dbt != (VT_INT | VT_UNSIGNED) &&
6037 dbt != (VT_LLONG | VT_UNSIGNED) &&
6038 dbt != VT_LLONG)
6039 dbt = VT_INT;
6040 if (c) {
6041 switch(dbt) {
6042 case VT_LLONG | VT_UNSIGNED:
6043 case VT_LLONG:
6044 /* XXX: add const cases for long long */
6045 goto do_ftoi;
6046 case VT_INT | VT_UNSIGNED:
6047 switch(sbt) {
6048 case VT_FLOAT: vtop->c.ui = (unsigned int)vtop->c.d; break;
6049 case VT_DOUBLE: vtop->c.ui = (unsigned int)vtop->c.d; break;
6050 case VT_LDOUBLE: vtop->c.ui = (unsigned int)vtop->c.d; break;
6052 break;
6053 default:
6054 /* int case */
6055 switch(sbt) {
6056 case VT_FLOAT: vtop->c.i = (int)vtop->c.d; break;
6057 case VT_DOUBLE: vtop->c.i = (int)vtop->c.d; break;
6058 case VT_LDOUBLE: vtop->c.i = (int)vtop->c.d; break;
6060 break;
6062 } else {
6063 do_ftoi:
6064 gen_cvt_ftoi1(dbt);
6066 if (dbt == VT_INT && (type->t & (VT_BTYPE | VT_UNSIGNED)) != dbt) {
6067 /* additional cast for char/short... */
6068 vtop->type.t = dbt;
6069 gen_cast(type);
6072 } else if ((dbt & VT_BTYPE) == VT_LLONG) {
6073 if ((sbt & VT_BTYPE) != VT_LLONG) {
6074 /* scalar to long long */
6075 if (c) {
6076 if (sbt == (VT_INT | VT_UNSIGNED))
6077 vtop->c.ll = vtop->c.ui;
6078 else
6079 vtop->c.ll = vtop->c.i;
6080 } else {
6081 /* machine independent conversion */
6082 gv(RC_INT);
6083 /* generate high word */
6084 if (sbt == (VT_INT | VT_UNSIGNED)) {
6085 vpushi(0);
6086 gv(RC_INT);
6087 } else {
6088 gv_dup();
6089 vpushi(31);
6090 gen_op(TOK_SAR);
6092 /* patch second register */
6093 vtop[-1].r2 = vtop->r;
6094 vpop();
6097 } else if (dbt == VT_BOOL) {
6098 /* scalar to bool */
6099 vpushi(0);
6100 gen_op(TOK_NE);
6101 } else if ((dbt & VT_BTYPE) == VT_BYTE ||
6102 (dbt & VT_BTYPE) == VT_SHORT) {
6103 if (sbt == VT_PTR) {
6104 vtop->type.t = VT_INT;
6105 warning("nonportable conversion from pointer to char/short");
6107 force_charshort_cast(dbt);
6108 } else if ((dbt & VT_BTYPE) == VT_INT) {
6109 /* scalar to int */
6110 if (sbt == VT_LLONG) {
6111 /* from long long: just take low order word */
6112 lexpand();
6113 vpop();
6115 /* if lvalue and single word type, nothing to do because
6116 the lvalue already contains the real type size (see
6117 VT_LVAL_xxx constants) */
6119 } else if ((dbt & VT_BTYPE) == VT_PTR && !(vtop->r & VT_LVAL)) {
6120 /* if we are casting between pointer types,
6121 we must update the VT_LVAL_xxx size */
6122 vtop->r = (vtop->r & ~VT_LVAL_TYPE)
6123 | (lvalue_type(type->ref->type.t) & VT_LVAL_TYPE);
6125 vtop->type = *type;
6128 /* return type size. Put alignment at 'a' */
6129 static int type_size(CType *type, int *a)
6131 Sym *s;
6132 int bt;
6134 bt = type->t & VT_BTYPE;
6135 if (bt == VT_STRUCT) {
6136 /* struct/union */
6137 s = type->ref;
6138 *a = s->r;
6139 return s->c;
6140 } else if (bt == VT_PTR) {
6141 if (type->t & VT_ARRAY) {
6142 s = type->ref;
6143 return type_size(&s->type, a) * s->c;
6144 } else {
6145 *a = PTR_SIZE;
6146 return PTR_SIZE;
6148 } else if (bt == VT_LDOUBLE) {
6149 *a = LDOUBLE_ALIGN;
6150 return LDOUBLE_SIZE;
6151 } else if (bt == VT_DOUBLE || bt == VT_LLONG) {
6152 #ifdef TCC_TARGET_I386
6153 *a = 4;
6154 #elif defined(TCC_TARGET_ARM)
6155 #ifdef TCC_ARM_EABI
6156 *a = 8;
6157 #else
6158 *a = 4;
6159 #endif
6160 #else
6161 *a = 8;
6162 #endif
6163 return 8;
6164 } else if (bt == VT_INT || bt == VT_ENUM || bt == VT_FLOAT) {
6165 *a = 4;
6166 return 4;
6167 } else if (bt == VT_SHORT) {
6168 *a = 2;
6169 return 2;
6170 } else {
6171 /* char, void, function, _Bool */
6172 *a = 1;
6173 return 1;
6177 /* return the pointed type of t */
6178 static inline CType *pointed_type(CType *type)
6180 return &type->ref->type;
6183 /* modify type so that its it is a pointer to type. */
6184 static void mk_pointer(CType *type)
6186 Sym *s;
6187 s = sym_push(SYM_FIELD, type, 0, -1);
6188 type->t = VT_PTR | (type->t & ~VT_TYPE);
6189 type->ref = s;
6192 /* compare function types. OLD functions match any new functions */
6193 static int is_compatible_func(CType *type1, CType *type2)
6195 Sym *s1, *s2;
6197 s1 = type1->ref;
6198 s2 = type2->ref;
6199 if (!is_compatible_types(&s1->type, &s2->type))
6200 return 0;
6201 /* check func_call */
6202 if (FUNC_CALL(s1->r) != FUNC_CALL(s2->r))
6203 return 0;
6204 /* XXX: not complete */
6205 if (s1->c == FUNC_OLD || s2->c == FUNC_OLD)
6206 return 1;
6207 if (s1->c != s2->c)
6208 return 0;
6209 while (s1 != NULL) {
6210 if (s2 == NULL)
6211 return 0;
6212 if (!is_compatible_parameter_types(&s1->type, &s2->type))
6213 return 0;
6214 s1 = s1->next;
6215 s2 = s2->next;
6217 if (s2)
6218 return 0;
6219 return 1;
6222 /* return true if type1 and type2 are the same. If unqualified is
6223 true, qualifiers on the types are ignored.
6225 - enums are not checked as gcc __builtin_types_compatible_p ()
6227 static int compare_types(CType *type1, CType *type2, int unqualified)
6229 int bt1, t1, t2;
6231 t1 = type1->t & VT_TYPE;
6232 t2 = type2->t & VT_TYPE;
6233 if (unqualified) {
6234 /* strip qualifiers before comparing */
6235 t1 &= ~(VT_CONSTANT | VT_VOLATILE);
6236 t2 &= ~(VT_CONSTANT | VT_VOLATILE);
6238 /* XXX: bitfields ? */
6239 if (t1 != t2)
6240 return 0;
6241 /* test more complicated cases */
6242 bt1 = t1 & VT_BTYPE;
6243 if (bt1 == VT_PTR) {
6244 type1 = pointed_type(type1);
6245 type2 = pointed_type(type2);
6246 return is_compatible_types(type1, type2);
6247 } else if (bt1 == VT_STRUCT) {
6248 return (type1->ref == type2->ref);
6249 } else if (bt1 == VT_FUNC) {
6250 return is_compatible_func(type1, type2);
6251 } else {
6252 return 1;
6256 /* return true if type1 and type2 are exactly the same (including
6257 qualifiers).
6259 static int is_compatible_types(CType *type1, CType *type2)
6261 return compare_types(type1,type2,0);
6264 /* return true if type1 and type2 are the same (ignoring qualifiers).
6266 static int is_compatible_parameter_types(CType *type1, CType *type2)
6268 return compare_types(type1,type2,1);
6271 /* print a type. If 'varstr' is not NULL, then the variable is also
6272 printed in the type */
6273 /* XXX: union */
6274 /* XXX: add array and function pointers */
6275 void type_to_str(char *buf, int buf_size,
6276 CType *type, const char *varstr)
6278 int bt, v, t;
6279 Sym *s, *sa;
6280 char buf1[256];
6281 const char *tstr;
6283 t = type->t & VT_TYPE;
6284 bt = t & VT_BTYPE;
6285 buf[0] = '\0';
6286 if (t & VT_CONSTANT)
6287 pstrcat(buf, buf_size, "const ");
6288 if (t & VT_VOLATILE)
6289 pstrcat(buf, buf_size, "volatile ");
6290 if (t & VT_UNSIGNED)
6291 pstrcat(buf, buf_size, "unsigned ");
6292 switch(bt) {
6293 case VT_VOID:
6294 tstr = "void";
6295 goto add_tstr;
6296 case VT_BOOL:
6297 tstr = "_Bool";
6298 goto add_tstr;
6299 case VT_BYTE:
6300 tstr = "char";
6301 goto add_tstr;
6302 case VT_SHORT:
6303 tstr = "short";
6304 goto add_tstr;
6305 case VT_INT:
6306 tstr = "int";
6307 goto add_tstr;
6308 case VT_LONG:
6309 tstr = "long";
6310 goto add_tstr;
6311 case VT_LLONG:
6312 tstr = "long long";
6313 goto add_tstr;
6314 case VT_FLOAT:
6315 tstr = "float";
6316 goto add_tstr;
6317 case VT_DOUBLE:
6318 tstr = "double";
6319 goto add_tstr;
6320 case VT_LDOUBLE:
6321 tstr = "long double";
6322 add_tstr:
6323 pstrcat(buf, buf_size, tstr);
6324 break;
6325 case VT_ENUM:
6326 case VT_STRUCT:
6327 if (bt == VT_STRUCT)
6328 tstr = "struct ";
6329 else
6330 tstr = "enum ";
6331 pstrcat(buf, buf_size, tstr);
6332 v = type->ref->v & ~SYM_STRUCT;
6333 if (v >= SYM_FIRST_ANOM)
6334 pstrcat(buf, buf_size, "<anonymous>");
6335 else
6336 pstrcat(buf, buf_size, get_tok_str(v, NULL));
6337 break;
6338 case VT_FUNC:
6339 s = type->ref;
6340 type_to_str(buf, buf_size, &s->type, varstr);
6341 pstrcat(buf, buf_size, "(");
6342 sa = s->next;
6343 while (sa != NULL) {
6344 type_to_str(buf1, sizeof(buf1), &sa->type, NULL);
6345 pstrcat(buf, buf_size, buf1);
6346 sa = sa->next;
6347 if (sa)
6348 pstrcat(buf, buf_size, ", ");
6350 pstrcat(buf, buf_size, ")");
6351 goto no_var;
6352 case VT_PTR:
6353 s = type->ref;
6354 pstrcpy(buf1, sizeof(buf1), "*");
6355 if (varstr)
6356 pstrcat(buf1, sizeof(buf1), varstr);
6357 type_to_str(buf, buf_size, &s->type, buf1);
6358 goto no_var;
6360 if (varstr) {
6361 pstrcat(buf, buf_size, " ");
6362 pstrcat(buf, buf_size, varstr);
6364 no_var: ;
6367 /* verify type compatibility to store vtop in 'dt' type, and generate
6368 casts if needed. */
6369 static void gen_assign_cast(CType *dt)
6371 CType *st, *type1, *type2, tmp_type1, tmp_type2;
6372 char buf1[256], buf2[256];
6373 int dbt, sbt;
6375 st = &vtop->type; /* source type */
6376 dbt = dt->t & VT_BTYPE;
6377 sbt = st->t & VT_BTYPE;
6378 if (dt->t & VT_CONSTANT)
6379 warning("assignment of read-only location");
6380 switch(dbt) {
6381 case VT_PTR:
6382 /* special cases for pointers */
6383 /* '0' can also be a pointer */
6384 if (is_null_pointer(vtop))
6385 goto type_ok;
6386 /* accept implicit pointer to integer cast with warning */
6387 if (is_integer_btype(sbt)) {
6388 warning("assignment makes pointer from integer without a cast");
6389 goto type_ok;
6391 type1 = pointed_type(dt);
6392 /* a function is implicitely a function pointer */
6393 if (sbt == VT_FUNC) {
6394 if ((type1->t & VT_BTYPE) != VT_VOID &&
6395 !is_compatible_types(pointed_type(dt), st))
6396 goto error;
6397 else
6398 goto type_ok;
6400 if (sbt != VT_PTR)
6401 goto error;
6402 type2 = pointed_type(st);
6403 if ((type1->t & VT_BTYPE) == VT_VOID ||
6404 (type2->t & VT_BTYPE) == VT_VOID) {
6405 /* void * can match anything */
6406 } else {
6407 /* exact type match, except for unsigned */
6408 tmp_type1 = *type1;
6409 tmp_type2 = *type2;
6410 tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
6411 tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
6412 if (!is_compatible_types(&tmp_type1, &tmp_type2))
6413 warning("assignment from incompatible pointer type");
6415 /* check const and volatile */
6416 if ((!(type1->t & VT_CONSTANT) && (type2->t & VT_CONSTANT)) ||
6417 (!(type1->t & VT_VOLATILE) && (type2->t & VT_VOLATILE)))
6418 warning("assignment discards qualifiers from pointer target type");
6419 break;
6420 case VT_BYTE:
6421 case VT_SHORT:
6422 case VT_INT:
6423 case VT_LLONG:
6424 if (sbt == VT_PTR || sbt == VT_FUNC) {
6425 warning("assignment makes integer from pointer without a cast");
6427 /* XXX: more tests */
6428 break;
6429 case VT_STRUCT:
6430 tmp_type1 = *dt;
6431 tmp_type2 = *st;
6432 tmp_type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
6433 tmp_type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
6434 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
6435 error:
6436 type_to_str(buf1, sizeof(buf1), st, NULL);
6437 type_to_str(buf2, sizeof(buf2), dt, NULL);
6438 error("cannot cast '%s' to '%s'", buf1, buf2);
6440 break;
6442 type_ok:
6443 gen_cast(dt);
6446 /* store vtop in lvalue pushed on stack */
6447 void vstore(void)
6449 int sbt, dbt, ft, r, t, size, align, bit_size, bit_pos, rc, delayed_cast;
6451 ft = vtop[-1].type.t;
6452 sbt = vtop->type.t & VT_BTYPE;
6453 dbt = ft & VT_BTYPE;
6454 if (((sbt == VT_INT || sbt == VT_SHORT) && dbt == VT_BYTE) ||
6455 (sbt == VT_INT && dbt == VT_SHORT)) {
6456 /* optimize char/short casts */
6457 delayed_cast = VT_MUSTCAST;
6458 vtop->type.t = ft & VT_TYPE;
6459 /* XXX: factorize */
6460 if (ft & VT_CONSTANT)
6461 warning("assignment of read-only location");
6462 } else {
6463 delayed_cast = 0;
6464 if (!(ft & VT_BITFIELD))
6465 gen_assign_cast(&vtop[-1].type);
6468 if (sbt == VT_STRUCT) {
6469 /* if structure, only generate pointer */
6470 /* structure assignment : generate memcpy */
6471 /* XXX: optimize if small size */
6472 if (!nocode_wanted) {
6473 size = type_size(&vtop->type, &align);
6475 #ifdef TCC_ARM_EABI
6476 if(!(align & 7))
6477 vpush_global_sym(&func_old_type, TOK_memcpy8);
6478 else if(!(align & 3))
6479 vpush_global_sym(&func_old_type, TOK_memcpy4);
6480 else
6481 #endif
6482 vpush_global_sym(&func_old_type, TOK_memcpy);
6484 /* destination */
6485 vpushv(vtop - 2);
6486 vtop->type.t = VT_INT;
6487 gaddrof();
6488 /* source */
6489 vpushv(vtop - 2);
6490 vtop->type.t = VT_INT;
6491 gaddrof();
6492 /* type size */
6493 vpushi(size);
6494 gfunc_call(3);
6496 vswap();
6497 vpop();
6498 } else {
6499 vswap();
6500 vpop();
6502 /* leave source on stack */
6503 } else if (ft & VT_BITFIELD) {
6504 /* bitfield store handling */
6505 bit_pos = (ft >> VT_STRUCT_SHIFT) & 0x3f;
6506 bit_size = (ft >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
6507 /* remove bit field info to avoid loops */
6508 vtop[-1].type.t = ft & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT));
6510 /* duplicate source into other register */
6511 gv_dup();
6512 vswap();
6513 vrott(3);
6515 /* duplicate destination */
6516 vdup();
6517 vtop[-1] = vtop[-2];
6519 /* mask and shift source */
6520 vpushi((1 << bit_size) - 1);
6521 gen_op('&');
6522 vpushi(bit_pos);
6523 gen_op(TOK_SHL);
6524 /* load destination, mask and or with source */
6525 vswap();
6526 vpushi(~(((1 << bit_size) - 1) << bit_pos));
6527 gen_op('&');
6528 gen_op('|');
6529 /* store result */
6530 vstore();
6532 /* pop off shifted source from "duplicate source..." above */
6533 vpop();
6535 } else {
6536 #ifdef CONFIG_TCC_BCHECK
6537 /* bound check case */
6538 if (vtop[-1].r & VT_MUSTBOUND) {
6539 vswap();
6540 gbound();
6541 vswap();
6543 #endif
6544 if (!nocode_wanted) {
6545 rc = RC_INT;
6546 if (is_float(ft))
6547 rc = RC_FLOAT;
6548 r = gv(rc); /* generate value */
6549 /* if lvalue was saved on stack, must read it */
6550 if ((vtop[-1].r & VT_VALMASK) == VT_LLOCAL) {
6551 SValue sv;
6552 t = get_reg(RC_INT);
6553 sv.type.t = VT_INT;
6554 sv.r = VT_LOCAL | VT_LVAL;
6555 sv.c.ul = vtop[-1].c.ul;
6556 load(t, &sv);
6557 vtop[-1].r = t | VT_LVAL;
6559 store(r, vtop - 1);
6560 /* two word case handling : store second register at word + 4 */
6561 if ((ft & VT_BTYPE) == VT_LLONG) {
6562 vswap();
6563 /* convert to int to increment easily */
6564 vtop->type.t = VT_INT;
6565 gaddrof();
6566 vpushi(4);
6567 gen_op('+');
6568 vtop->r |= VT_LVAL;
6569 vswap();
6570 /* XXX: it works because r2 is spilled last ! */
6571 store(vtop->r2, vtop - 1);
6574 vswap();
6575 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
6576 vtop->r |= delayed_cast;
6580 /* post defines POST/PRE add. c is the token ++ or -- */
6581 void inc(int post, int c)
6583 test_lvalue();
6584 vdup(); /* save lvalue */
6585 if (post) {
6586 gv_dup(); /* duplicate value */
6587 vrotb(3);
6588 vrotb(3);
6590 /* add constant */
6591 vpushi(c - TOK_MID);
6592 gen_op('+');
6593 vstore(); /* store value */
6594 if (post)
6595 vpop(); /* if post op, return saved value */
6598 /* Parse GNUC __attribute__ extension. Currently, the following
6599 extensions are recognized:
6600 - aligned(n) : set data/function alignment.
6601 - packed : force data alignment to 1
6602 - section(x) : generate data/code in this section.
6603 - unused : currently ignored, but may be used someday.
6604 - regparm(n) : pass function parameters in registers (i386 only)
6606 static void parse_attribute(AttributeDef *ad)
6608 int t, n;
6610 while (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) {
6611 next();
6612 skip('(');
6613 skip('(');
6614 while (tok != ')') {
6615 if (tok < TOK_IDENT)
6616 expect("attribute name");
6617 t = tok;
6618 next();
6619 switch(t) {
6620 case TOK_SECTION1:
6621 case TOK_SECTION2:
6622 skip('(');
6623 if (tok != TOK_STR)
6624 expect("section name");
6625 ad->section = find_section(tcc_state, (char *)tokc.cstr->data);
6626 next();
6627 skip(')');
6628 break;
6629 case TOK_ALIGNED1:
6630 case TOK_ALIGNED2:
6631 if (tok == '(') {
6632 next();
6633 n = expr_const();
6634 if (n <= 0 || (n & (n - 1)) != 0)
6635 error("alignment must be a positive power of two");
6636 skip(')');
6637 } else {
6638 n = MAX_ALIGN;
6640 ad->aligned = n;
6641 break;
6642 case TOK_PACKED1:
6643 case TOK_PACKED2:
6644 ad->packed = 1;
6645 break;
6646 case TOK_UNUSED1:
6647 case TOK_UNUSED2:
6648 /* currently, no need to handle it because tcc does not
6649 track unused objects */
6650 break;
6651 case TOK_NORETURN1:
6652 case TOK_NORETURN2:
6653 /* currently, no need to handle it because tcc does not
6654 track unused objects */
6655 break;
6656 case TOK_CDECL1:
6657 case TOK_CDECL2:
6658 case TOK_CDECL3:
6659 FUNC_CALL(ad->func_attr) = FUNC_CDECL;
6660 break;
6661 case TOK_STDCALL1:
6662 case TOK_STDCALL2:
6663 case TOK_STDCALL3:
6664 FUNC_CALL(ad->func_attr) = FUNC_STDCALL;
6665 break;
6666 #ifdef TCC_TARGET_I386
6667 case TOK_REGPARM1:
6668 case TOK_REGPARM2:
6669 skip('(');
6670 n = expr_const();
6671 if (n > 3)
6672 n = 3;
6673 else if (n < 0)
6674 n = 0;
6675 if (n > 0)
6676 FUNC_CALL(ad->func_attr) = FUNC_FASTCALL1 + n - 1;
6677 skip(')');
6678 break;
6679 case TOK_FASTCALL1:
6680 case TOK_FASTCALL2:
6681 case TOK_FASTCALL3:
6682 FUNC_CALL(ad->func_attr) = FUNC_FASTCALLW;
6683 break;
6684 #endif
6685 case TOK_DLLEXPORT:
6686 FUNC_EXPORT(ad->func_attr) = 1;
6687 break;
6688 default:
6689 if (tcc_state->warn_unsupported)
6690 warning("'%s' attribute ignored", get_tok_str(t, NULL));
6691 /* skip parameters */
6692 if (tok == '(') {
6693 int parenthesis = 0;
6694 do {
6695 if (tok == '(')
6696 parenthesis++;
6697 else if (tok == ')')
6698 parenthesis--;
6699 next();
6700 } while (parenthesis && tok != -1);
6702 break;
6704 if (tok != ',')
6705 break;
6706 next();
6708 skip(')');
6709 skip(')');
6713 /* enum/struct/union declaration. u is either VT_ENUM or VT_STRUCT */
6714 static void struct_decl(CType *type, int u)
6716 int a, v, size, align, maxalign, c, offset;
6717 int bit_size, bit_pos, bsize, bt, lbit_pos;
6718 Sym *s, *ss, *ass, **ps;
6719 AttributeDef ad;
6720 CType type1, btype;
6722 a = tok; /* save decl type */
6723 next();
6724 if (tok != '{') {
6725 v = tok;
6726 next();
6727 /* struct already defined ? return it */
6728 if (v < TOK_IDENT)
6729 expect("struct/union/enum name");
6730 s = struct_find(v);
6731 if (s) {
6732 if (s->type.t != a)
6733 error("invalid type");
6734 goto do_decl;
6736 } else {
6737 v = anon_sym++;
6739 type1.t = a;
6740 /* we put an undefined size for struct/union */
6741 s = sym_push(v | SYM_STRUCT, &type1, 0, -1);
6742 s->r = 0; /* default alignment is zero as gcc */
6743 /* put struct/union/enum name in type */
6744 do_decl:
6745 type->t = u;
6746 type->ref = s;
6748 if (tok == '{') {
6749 next();
6750 if (s->c != -1)
6751 error("struct/union/enum already defined");
6752 /* cannot be empty */
6753 c = 0;
6754 /* non empty enums are not allowed */
6755 if (a == TOK_ENUM) {
6756 for(;;) {
6757 v = tok;
6758 if (v < TOK_UIDENT)
6759 expect("identifier");
6760 next();
6761 if (tok == '=') {
6762 next();
6763 c = expr_const();
6765 /* enum symbols have static storage */
6766 ss = sym_push(v, &int_type, VT_CONST, c);
6767 ss->type.t |= VT_STATIC;
6768 if (tok != ',')
6769 break;
6770 next();
6771 c++;
6772 /* NOTE: we accept a trailing comma */
6773 if (tok == '}')
6774 break;
6776 skip('}');
6777 } else {
6778 maxalign = 1;
6779 ps = &s->next;
6780 bit_pos = 0;
6781 offset = 0;
6782 while (tok != '}') {
6783 parse_btype(&btype, &ad);
6784 while (1) {
6785 bit_size = -1;
6786 v = 0;
6787 type1 = btype;
6788 if (tok != ':') {
6789 type_decl(&type1, &ad, &v, TYPE_DIRECT | TYPE_ABSTRACT);
6790 if (v == 0 && (type1.t & VT_BTYPE) != VT_STRUCT)
6791 expect("identifier");
6792 if ((type1.t & VT_BTYPE) == VT_FUNC ||
6793 (type1.t & (VT_TYPEDEF | VT_STATIC | VT_EXTERN | VT_INLINE)))
6794 error("invalid type for '%s'",
6795 get_tok_str(v, NULL));
6797 if (tok == ':') {
6798 next();
6799 bit_size = expr_const();
6800 /* XXX: handle v = 0 case for messages */
6801 if (bit_size < 0)
6802 error("negative width in bit-field '%s'",
6803 get_tok_str(v, NULL));
6804 if (v && bit_size == 0)
6805 error("zero width for bit-field '%s'",
6806 get_tok_str(v, NULL));
6808 size = type_size(&type1, &align);
6809 if (ad.aligned) {
6810 if (align < ad.aligned)
6811 align = ad.aligned;
6812 } else if (ad.packed) {
6813 align = 1;
6814 } else if (*tcc_state->pack_stack_ptr) {
6815 if (align > *tcc_state->pack_stack_ptr)
6816 align = *tcc_state->pack_stack_ptr;
6818 lbit_pos = 0;
6819 if (bit_size >= 0) {
6820 bt = type1.t & VT_BTYPE;
6821 if (bt != VT_INT &&
6822 bt != VT_BYTE &&
6823 bt != VT_SHORT &&
6824 bt != VT_BOOL &&
6825 bt != VT_ENUM)
6826 error("bitfields must have scalar type");
6827 bsize = size * 8;
6828 if (bit_size > bsize) {
6829 error("width of '%s' exceeds its type",
6830 get_tok_str(v, NULL));
6831 } else if (bit_size == bsize) {
6832 /* no need for bit fields */
6833 bit_pos = 0;
6834 } else if (bit_size == 0) {
6835 /* XXX: what to do if only padding in a
6836 structure ? */
6837 /* zero size: means to pad */
6838 if (bit_pos > 0)
6839 bit_pos = bsize;
6840 } else {
6841 /* we do not have enough room ? */
6842 if ((bit_pos + bit_size) > bsize)
6843 bit_pos = 0;
6844 lbit_pos = bit_pos;
6845 /* XXX: handle LSB first */
6846 type1.t |= VT_BITFIELD |
6847 (bit_pos << VT_STRUCT_SHIFT) |
6848 (bit_size << (VT_STRUCT_SHIFT + 6));
6849 bit_pos += bit_size;
6851 } else {
6852 bit_pos = 0;
6854 if (v != 0 || (type1.t & VT_BTYPE) == VT_STRUCT) {
6855 /* add new memory data only if starting
6856 bit field */
6857 if (lbit_pos == 0) {
6858 if (a == TOK_STRUCT) {
6859 c = (c + align - 1) & -align;
6860 offset = c;
6861 if (size > 0)
6862 c += size;
6863 } else {
6864 offset = 0;
6865 if (size > c)
6866 c = size;
6868 if (align > maxalign)
6869 maxalign = align;
6871 #if 0
6872 printf("add field %s offset=%d",
6873 get_tok_str(v, NULL), offset);
6874 if (type1.t & VT_BITFIELD) {
6875 printf(" pos=%d size=%d",
6876 (type1.t >> VT_STRUCT_SHIFT) & 0x3f,
6877 (type1.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f);
6879 printf("\n");
6880 #endif
6882 if (v == 0 && (type1.t & VT_BTYPE) == VT_STRUCT) {
6883 ass = type1.ref;
6884 while ((ass = ass->next) != NULL) {
6885 ss = sym_push(ass->v, &ass->type, 0, offset + ass->c);
6886 *ps = ss;
6887 ps = &ss->next;
6889 } else if (v) {
6890 ss = sym_push(v | SYM_FIELD, &type1, 0, offset);
6891 *ps = ss;
6892 ps = &ss->next;
6894 if (tok == ';' || tok == TOK_EOF)
6895 break;
6896 skip(',');
6898 skip(';');
6900 skip('}');
6901 /* store size and alignment */
6902 s->c = (c + maxalign - 1) & -maxalign;
6903 s->r = maxalign;
6908 /* return 0 if no type declaration. otherwise, return the basic type
6909 and skip it.
6911 static int parse_btype(CType *type, AttributeDef *ad)
6913 int t, u, type_found, typespec_found, typedef_found;
6914 Sym *s;
6915 CType type1;
6917 memset(ad, 0, sizeof(AttributeDef));
6918 type_found = 0;
6919 typespec_found = 0;
6920 typedef_found = 0;
6921 t = 0;
6922 while(1) {
6923 switch(tok) {
6924 case TOK_EXTENSION:
6925 /* currently, we really ignore extension */
6926 next();
6927 continue;
6929 /* basic types */
6930 case TOK_CHAR:
6931 u = VT_BYTE;
6932 basic_type:
6933 next();
6934 basic_type1:
6935 if ((t & VT_BTYPE) != 0)
6936 error("too many basic types");
6937 t |= u;
6938 typespec_found = 1;
6939 break;
6940 case TOK_VOID:
6941 u = VT_VOID;
6942 goto basic_type;
6943 case TOK_SHORT:
6944 u = VT_SHORT;
6945 goto basic_type;
6946 case TOK_INT:
6947 next();
6948 typespec_found = 1;
6949 break;
6950 case TOK_LONG:
6951 next();
6952 if ((t & VT_BTYPE) == VT_DOUBLE) {
6953 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
6954 } else if ((t & VT_BTYPE) == VT_LONG) {
6955 t = (t & ~VT_BTYPE) | VT_LLONG;
6956 } else {
6957 u = VT_LONG;
6958 goto basic_type1;
6960 break;
6961 case TOK_BOOL:
6962 u = VT_BOOL;
6963 goto basic_type;
6964 case TOK_FLOAT:
6965 u = VT_FLOAT;
6966 goto basic_type;
6967 case TOK_DOUBLE:
6968 next();
6969 if ((t & VT_BTYPE) == VT_LONG) {
6970 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
6971 } else {
6972 u = VT_DOUBLE;
6973 goto basic_type1;
6975 break;
6976 case TOK_ENUM:
6977 struct_decl(&type1, VT_ENUM);
6978 basic_type2:
6979 u = type1.t;
6980 type->ref = type1.ref;
6981 goto basic_type1;
6982 case TOK_STRUCT:
6983 case TOK_UNION:
6984 struct_decl(&type1, VT_STRUCT);
6985 goto basic_type2;
6987 /* type modifiers */
6988 case TOK_CONST1:
6989 case TOK_CONST2:
6990 case TOK_CONST3:
6991 t |= VT_CONSTANT;
6992 next();
6993 break;
6994 case TOK_VOLATILE1:
6995 case TOK_VOLATILE2:
6996 case TOK_VOLATILE3:
6997 t |= VT_VOLATILE;
6998 next();
6999 break;
7000 case TOK_SIGNED1:
7001 case TOK_SIGNED2:
7002 case TOK_SIGNED3:
7003 typespec_found = 1;
7004 t |= VT_SIGNED;
7005 next();
7006 break;
7007 case TOK_REGISTER:
7008 case TOK_AUTO:
7009 case TOK_RESTRICT1:
7010 case TOK_RESTRICT2:
7011 case TOK_RESTRICT3:
7012 next();
7013 break;
7014 case TOK_UNSIGNED:
7015 t |= VT_UNSIGNED;
7016 next();
7017 typespec_found = 1;
7018 break;
7020 /* storage */
7021 case TOK_EXTERN:
7022 t |= VT_EXTERN;
7023 next();
7024 break;
7025 case TOK_STATIC:
7026 t |= VT_STATIC;
7027 next();
7028 break;
7029 case TOK_TYPEDEF:
7030 t |= VT_TYPEDEF;
7031 next();
7032 break;
7033 case TOK_INLINE1:
7034 case TOK_INLINE2:
7035 case TOK_INLINE3:
7036 t |= VT_INLINE;
7037 next();
7038 break;
7040 /* GNUC attribute */
7041 case TOK_ATTRIBUTE1:
7042 case TOK_ATTRIBUTE2:
7043 parse_attribute(ad);
7044 break;
7045 /* GNUC typeof */
7046 case TOK_TYPEOF1:
7047 case TOK_TYPEOF2:
7048 case TOK_TYPEOF3:
7049 next();
7050 parse_expr_type(&type1);
7051 goto basic_type2;
7052 default:
7053 if (typespec_found || typedef_found)
7054 goto the_end;
7055 s = sym_find(tok);
7056 if (!s || !(s->type.t & VT_TYPEDEF))
7057 goto the_end;
7058 typedef_found = 1;
7059 t |= (s->type.t & ~VT_TYPEDEF);
7060 type->ref = s->type.ref;
7061 next();
7062 typespec_found = 1;
7063 break;
7065 type_found = 1;
7067 the_end:
7068 if ((t & (VT_SIGNED|VT_UNSIGNED)) == (VT_SIGNED|VT_UNSIGNED))
7069 error("signed and unsigned modifier");
7070 if (tcc_state->char_is_unsigned) {
7071 if ((t & (VT_SIGNED|VT_UNSIGNED|VT_BTYPE)) == VT_BYTE)
7072 t |= VT_UNSIGNED;
7074 t &= ~VT_SIGNED;
7076 /* long is never used as type */
7077 if ((t & VT_BTYPE) == VT_LONG)
7078 t = (t & ~VT_BTYPE) | VT_INT;
7079 type->t = t;
7080 return type_found;
7083 /* convert a function parameter type (array to pointer and function to
7084 function pointer) */
7085 static inline void convert_parameter_type(CType *pt)
7087 /* remove const and volatile qualifiers (XXX: const could be used
7088 to indicate a const function parameter */
7089 pt->t &= ~(VT_CONSTANT | VT_VOLATILE);
7090 /* array must be transformed to pointer according to ANSI C */
7091 pt->t &= ~VT_ARRAY;
7092 if ((pt->t & VT_BTYPE) == VT_FUNC) {
7093 mk_pointer(pt);
7097 static void post_type(CType *type, AttributeDef *ad)
7099 int n, l, t1, arg_size, align;
7100 Sym **plast, *s, *first;
7101 AttributeDef ad1;
7102 CType pt;
7104 if (tok == '(') {
7105 /* function declaration */
7106 next();
7107 l = 0;
7108 first = NULL;
7109 plast = &first;
7110 arg_size = 0;
7111 if (tok != ')') {
7112 for(;;) {
7113 /* read param name and compute offset */
7114 if (l != FUNC_OLD) {
7115 if (!parse_btype(&pt, &ad1)) {
7116 if (l) {
7117 error("invalid type");
7118 } else {
7119 l = FUNC_OLD;
7120 goto old_proto;
7123 l = FUNC_NEW;
7124 if ((pt.t & VT_BTYPE) == VT_VOID && tok == ')')
7125 break;
7126 type_decl(&pt, &ad1, &n, TYPE_DIRECT | TYPE_ABSTRACT);
7127 if ((pt.t & VT_BTYPE) == VT_VOID)
7128 error("parameter declared as void");
7129 arg_size += (type_size(&pt, &align) + 3) & ~3;
7130 } else {
7131 old_proto:
7132 n = tok;
7133 if (n < TOK_UIDENT)
7134 expect("identifier");
7135 pt.t = VT_INT;
7136 next();
7138 convert_parameter_type(&pt);
7139 s = sym_push(n | SYM_FIELD, &pt, 0, 0);
7140 *plast = s;
7141 plast = &s->next;
7142 if (tok == ')')
7143 break;
7144 skip(',');
7145 if (l == FUNC_NEW && tok == TOK_DOTS) {
7146 l = FUNC_ELLIPSIS;
7147 next();
7148 break;
7152 /* if no parameters, then old type prototype */
7153 if (l == 0)
7154 l = FUNC_OLD;
7155 skip(')');
7156 t1 = type->t & VT_STORAGE;
7157 /* NOTE: const is ignored in returned type as it has a special
7158 meaning in gcc / C++ */
7159 type->t &= ~(VT_STORAGE | VT_CONSTANT);
7160 post_type(type, ad);
7161 /* we push a anonymous symbol which will contain the function prototype */
7162 FUNC_ARGS(ad->func_attr) = arg_size;
7163 s = sym_push(SYM_FIELD, type, ad->func_attr, l);
7164 s->next = first;
7165 type->t = t1 | VT_FUNC;
7166 type->ref = s;
7167 } else if (tok == '[') {
7168 /* array definition */
7169 next();
7170 n = -1;
7171 if (tok != ']') {
7172 n = expr_const();
7173 if (n < 0)
7174 error("invalid array size");
7176 skip(']');
7177 /* parse next post type */
7178 t1 = type->t & VT_STORAGE;
7179 type->t &= ~VT_STORAGE;
7180 post_type(type, ad);
7182 /* we push a anonymous symbol which will contain the array
7183 element type */
7184 s = sym_push(SYM_FIELD, type, 0, n);
7185 type->t = t1 | VT_ARRAY | VT_PTR;
7186 type->ref = s;
7190 /* Parse a type declaration (except basic type), and return the type
7191 in 'type'. 'td' is a bitmask indicating which kind of type decl is
7192 expected. 'type' should contain the basic type. 'ad' is the
7193 attribute definition of the basic type. It can be modified by
7194 type_decl().
7196 static void type_decl(CType *type, AttributeDef *ad, int *v, int td)
7198 Sym *s;
7199 CType type1, *type2;
7200 int qualifiers;
7202 while (tok == '*') {
7203 qualifiers = 0;
7204 redo:
7205 next();
7206 switch(tok) {
7207 case TOK_CONST1:
7208 case TOK_CONST2:
7209 case TOK_CONST3:
7210 qualifiers |= VT_CONSTANT;
7211 goto redo;
7212 case TOK_VOLATILE1:
7213 case TOK_VOLATILE2:
7214 case TOK_VOLATILE3:
7215 qualifiers |= VT_VOLATILE;
7216 goto redo;
7217 case TOK_RESTRICT1:
7218 case TOK_RESTRICT2:
7219 case TOK_RESTRICT3:
7220 goto redo;
7222 mk_pointer(type);
7223 type->t |= qualifiers;
7226 /* XXX: clarify attribute handling */
7227 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7228 parse_attribute(ad);
7230 /* recursive type */
7231 /* XXX: incorrect if abstract type for functions (e.g. 'int ()') */
7232 type1.t = 0; /* XXX: same as int */
7233 if (tok == '(') {
7234 next();
7235 /* XXX: this is not correct to modify 'ad' at this point, but
7236 the syntax is not clear */
7237 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7238 parse_attribute(ad);
7239 type_decl(&type1, ad, v, td);
7240 skip(')');
7241 } else {
7242 /* type identifier */
7243 if (tok >= TOK_IDENT && (td & TYPE_DIRECT)) {
7244 *v = tok;
7245 next();
7246 } else {
7247 if (!(td & TYPE_ABSTRACT))
7248 expect("identifier");
7249 *v = 0;
7252 post_type(type, ad);
7253 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7254 parse_attribute(ad);
7255 if (!type1.t)
7256 return;
7257 /* append type at the end of type1 */
7258 type2 = &type1;
7259 for(;;) {
7260 s = type2->ref;
7261 type2 = &s->type;
7262 if (!type2->t) {
7263 *type2 = *type;
7264 break;
7267 *type = type1;
7270 /* compute the lvalue VT_LVAL_xxx needed to match type t. */
7271 static int lvalue_type(int t)
7273 int bt, r;
7274 r = VT_LVAL;
7275 bt = t & VT_BTYPE;
7276 if (bt == VT_BYTE || bt == VT_BOOL)
7277 r |= VT_LVAL_BYTE;
7278 else if (bt == VT_SHORT)
7279 r |= VT_LVAL_SHORT;
7280 else
7281 return r;
7282 if (t & VT_UNSIGNED)
7283 r |= VT_LVAL_UNSIGNED;
7284 return r;
7287 /* indirection with full error checking and bound check */
7288 static void indir(void)
7290 if ((vtop->type.t & VT_BTYPE) != VT_PTR) {
7291 if ((vtop->type.t & VT_BTYPE) == VT_FUNC)
7292 return;
7293 expect("pointer");
7295 if ((vtop->r & VT_LVAL) && !nocode_wanted)
7296 gv(RC_INT);
7297 vtop->type = *pointed_type(&vtop->type);
7298 /* Arrays and functions are never lvalues */
7299 if (!(vtop->type.t & VT_ARRAY)
7300 && (vtop->type.t & VT_BTYPE) != VT_FUNC) {
7301 vtop->r |= lvalue_type(vtop->type.t);
7302 /* if bound checking, the referenced pointer must be checked */
7303 if (do_bounds_check)
7304 vtop->r |= VT_MUSTBOUND;
7308 /* pass a parameter to a function and do type checking and casting */
7309 static void gfunc_param_typed(Sym *func, Sym *arg)
7311 int func_type;
7312 CType type;
7314 func_type = func->c;
7315 if (func_type == FUNC_OLD ||
7316 (func_type == FUNC_ELLIPSIS && arg == NULL)) {
7317 /* default casting : only need to convert float to double */
7318 if ((vtop->type.t & VT_BTYPE) == VT_FLOAT) {
7319 type.t = VT_DOUBLE;
7320 gen_cast(&type);
7322 } else if (arg == NULL) {
7323 error("too many arguments to function");
7324 } else {
7325 type = arg->type;
7326 type.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
7327 gen_assign_cast(&type);
7331 /* parse an expression of the form '(type)' or '(expr)' and return its
7332 type */
7333 static void parse_expr_type(CType *type)
7335 int n;
7336 AttributeDef ad;
7338 skip('(');
7339 if (parse_btype(type, &ad)) {
7340 type_decl(type, &ad, &n, TYPE_ABSTRACT);
7341 } else {
7342 expr_type(type);
7344 skip(')');
7347 static void parse_type(CType *type)
7349 AttributeDef ad;
7350 int n;
7352 if (!parse_btype(type, &ad)) {
7353 expect("type");
7355 type_decl(type, &ad, &n, TYPE_ABSTRACT);
7358 static void vpush_tokc(int t)
7360 CType type;
7361 type.t = t;
7362 vsetc(&type, VT_CONST, &tokc);
7365 static void unary(void)
7367 int n, t, align, size, r;
7368 CType type;
7369 Sym *s;
7370 AttributeDef ad;
7372 /* XXX: GCC 2.95.3 does not generate a table although it should be
7373 better here */
7374 tok_next:
7375 switch(tok) {
7376 case TOK_EXTENSION:
7377 next();
7378 goto tok_next;
7379 case TOK_CINT:
7380 case TOK_CCHAR:
7381 case TOK_LCHAR:
7382 vpushi(tokc.i);
7383 next();
7384 break;
7385 case TOK_CUINT:
7386 vpush_tokc(VT_INT | VT_UNSIGNED);
7387 next();
7388 break;
7389 case TOK_CLLONG:
7390 vpush_tokc(VT_LLONG);
7391 next();
7392 break;
7393 case TOK_CULLONG:
7394 vpush_tokc(VT_LLONG | VT_UNSIGNED);
7395 next();
7396 break;
7397 case TOK_CFLOAT:
7398 vpush_tokc(VT_FLOAT);
7399 next();
7400 break;
7401 case TOK_CDOUBLE:
7402 vpush_tokc(VT_DOUBLE);
7403 next();
7404 break;
7405 case TOK_CLDOUBLE:
7406 vpush_tokc(VT_LDOUBLE);
7407 next();
7408 break;
7409 case TOK___FUNCTION__:
7410 if (!gnu_ext)
7411 goto tok_identifier;
7412 /* fall thru */
7413 case TOK___FUNC__:
7415 void *ptr;
7416 int len;
7417 /* special function name identifier */
7418 len = strlen(funcname) + 1;
7419 /* generate char[len] type */
7420 type.t = VT_BYTE;
7421 mk_pointer(&type);
7422 type.t |= VT_ARRAY;
7423 type.ref->c = len;
7424 vpush_ref(&type, data_section, data_section->data_offset, len);
7425 ptr = section_ptr_add(data_section, len);
7426 memcpy(ptr, funcname, len);
7427 next();
7429 break;
7430 case TOK_LSTR:
7431 #ifdef TCC_TARGET_PE
7432 t = VT_SHORT | VT_UNSIGNED;
7433 #else
7434 t = VT_INT;
7435 #endif
7436 goto str_init;
7437 case TOK_STR:
7438 /* string parsing */
7439 t = VT_BYTE;
7440 str_init:
7441 if (tcc_state->warn_write_strings)
7442 t |= VT_CONSTANT;
7443 type.t = t;
7444 mk_pointer(&type);
7445 type.t |= VT_ARRAY;
7446 memset(&ad, 0, sizeof(AttributeDef));
7447 decl_initializer_alloc(&type, &ad, VT_CONST, 2, 0, 0);
7448 break;
7449 case '(':
7450 next();
7451 /* cast ? */
7452 if (parse_btype(&type, &ad)) {
7453 type_decl(&type, &ad, &n, TYPE_ABSTRACT);
7454 skip(')');
7455 /* check ISOC99 compound literal */
7456 if (tok == '{') {
7457 /* data is allocated locally by default */
7458 if (global_expr)
7459 r = VT_CONST;
7460 else
7461 r = VT_LOCAL;
7462 /* all except arrays are lvalues */
7463 if (!(type.t & VT_ARRAY))
7464 r |= lvalue_type(type.t);
7465 memset(&ad, 0, sizeof(AttributeDef));
7466 decl_initializer_alloc(&type, &ad, r, 1, 0, 0);
7467 } else {
7468 unary();
7469 gen_cast(&type);
7471 } else if (tok == '{') {
7472 /* save all registers */
7473 save_regs(0);
7474 /* statement expression : we do not accept break/continue
7475 inside as GCC does */
7476 block(NULL, NULL, NULL, NULL, 0, 1);
7477 skip(')');
7478 } else {
7479 gexpr();
7480 skip(')');
7482 break;
7483 case '*':
7484 next();
7485 unary();
7486 indir();
7487 break;
7488 case '&':
7489 next();
7490 unary();
7491 /* functions names must be treated as function pointers,
7492 except for unary '&' and sizeof. Since we consider that
7493 functions are not lvalues, we only have to handle it
7494 there and in function calls. */
7495 /* arrays can also be used although they are not lvalues */
7496 if ((vtop->type.t & VT_BTYPE) != VT_FUNC &&
7497 !(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_LLOCAL))
7498 test_lvalue();
7499 mk_pointer(&vtop->type);
7500 gaddrof();
7501 break;
7502 case '!':
7503 next();
7504 unary();
7505 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST)
7506 vtop->c.i = !vtop->c.i;
7507 else if ((vtop->r & VT_VALMASK) == VT_CMP)
7508 vtop->c.i = vtop->c.i ^ 1;
7509 else {
7510 save_regs(1);
7511 vseti(VT_JMP, gtst(1, 0));
7513 break;
7514 case '~':
7515 next();
7516 unary();
7517 vpushi(-1);
7518 gen_op('^');
7519 break;
7520 case '+':
7521 next();
7522 /* in order to force cast, we add zero */
7523 unary();
7524 if ((vtop->type.t & VT_BTYPE) == VT_PTR)
7525 error("pointer not accepted for unary plus");
7526 vpushi(0);
7527 gen_op('+');
7528 break;
7529 case TOK_SIZEOF:
7530 case TOK_ALIGNOF1:
7531 case TOK_ALIGNOF2:
7532 t = tok;
7533 next();
7534 if (tok == '(') {
7535 parse_expr_type(&type);
7536 } else {
7537 unary_type(&type);
7539 size = type_size(&type, &align);
7540 if (t == TOK_SIZEOF) {
7541 if (size < 0)
7542 error("sizeof applied to an incomplete type");
7543 vpushi(size);
7544 } else {
7545 vpushi(align);
7547 vtop->type.t |= VT_UNSIGNED;
7548 break;
7550 case TOK_builtin_types_compatible_p:
7552 CType type1, type2;
7553 next();
7554 skip('(');
7555 parse_type(&type1);
7556 skip(',');
7557 parse_type(&type2);
7558 skip(')');
7559 type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
7560 type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
7561 vpushi(is_compatible_types(&type1, &type2));
7563 break;
7564 case TOK_builtin_constant_p:
7566 int saved_nocode_wanted, res;
7567 next();
7568 skip('(');
7569 saved_nocode_wanted = nocode_wanted;
7570 nocode_wanted = 1;
7571 gexpr();
7572 res = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
7573 vpop();
7574 nocode_wanted = saved_nocode_wanted;
7575 skip(')');
7576 vpushi(res);
7578 break;
7579 case TOK_INC:
7580 case TOK_DEC:
7581 t = tok;
7582 next();
7583 unary();
7584 inc(0, t);
7585 break;
7586 case '-':
7587 next();
7588 vpushi(0);
7589 unary();
7590 gen_op('-');
7591 break;
7592 case TOK_LAND:
7593 if (!gnu_ext)
7594 goto tok_identifier;
7595 next();
7596 /* allow to take the address of a label */
7597 if (tok < TOK_UIDENT)
7598 expect("label identifier");
7599 s = label_find(tok);
7600 if (!s) {
7601 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
7602 } else {
7603 if (s->r == LABEL_DECLARED)
7604 s->r = LABEL_FORWARD;
7606 if (!s->type.t) {
7607 s->type.t = VT_VOID;
7608 mk_pointer(&s->type);
7609 s->type.t |= VT_STATIC;
7611 vset(&s->type, VT_CONST | VT_SYM, 0);
7612 vtop->sym = s;
7613 next();
7614 break;
7615 default:
7616 tok_identifier:
7617 t = tok;
7618 next();
7619 if (t < TOK_UIDENT)
7620 expect("identifier");
7621 s = sym_find(t);
7622 if (!s) {
7623 if (tok != '(')
7624 error("'%s' undeclared", get_tok_str(t, NULL));
7625 /* for simple function calls, we tolerate undeclared
7626 external reference to int() function */
7627 if (tcc_state->warn_implicit_function_declaration)
7628 warning("implicit declaration of function '%s'",
7629 get_tok_str(t, NULL));
7630 s = external_global_sym(t, &func_old_type, 0);
7632 if ((s->type.t & (VT_STATIC | VT_INLINE | VT_BTYPE)) ==
7633 (VT_STATIC | VT_INLINE | VT_FUNC)) {
7634 /* if referencing an inline function, then we generate a
7635 symbol to it if not already done. It will have the
7636 effect to generate code for it at the end of the
7637 compilation unit. Inline function as always
7638 generated in the text section. */
7639 if (!s->c)
7640 put_extern_sym(s, text_section, 0, 0);
7641 r = VT_SYM | VT_CONST;
7642 } else {
7643 r = s->r;
7645 vset(&s->type, r, s->c);
7646 /* if forward reference, we must point to s */
7647 if (vtop->r & VT_SYM) {
7648 vtop->sym = s;
7649 vtop->c.ul = 0;
7651 break;
7654 /* post operations */
7655 while (1) {
7656 if (tok == TOK_INC || tok == TOK_DEC) {
7657 inc(1, tok);
7658 next();
7659 } else if (tok == '.' || tok == TOK_ARROW) {
7660 /* field */
7661 if (tok == TOK_ARROW)
7662 indir();
7663 test_lvalue();
7664 gaddrof();
7665 next();
7666 /* expect pointer on structure */
7667 if ((vtop->type.t & VT_BTYPE) != VT_STRUCT)
7668 expect("struct or union");
7669 s = vtop->type.ref;
7670 /* find field */
7671 tok |= SYM_FIELD;
7672 while ((s = s->next) != NULL) {
7673 if (s->v == tok)
7674 break;
7676 if (!s)
7677 error("field not found: %s", get_tok_str(tok & ~SYM_FIELD, NULL));
7678 /* add field offset to pointer */
7679 vtop->type = char_pointer_type; /* change type to 'char *' */
7680 vpushi(s->c);
7681 gen_op('+');
7682 /* change type to field type, and set to lvalue */
7683 vtop->type = s->type;
7684 /* an array is never an lvalue */
7685 if (!(vtop->type.t & VT_ARRAY)) {
7686 vtop->r |= lvalue_type(vtop->type.t);
7687 /* if bound checking, the referenced pointer must be checked */
7688 if (do_bounds_check)
7689 vtop->r |= VT_MUSTBOUND;
7691 next();
7692 } else if (tok == '[') {
7693 next();
7694 gexpr();
7695 gen_op('+');
7696 indir();
7697 skip(']');
7698 } else if (tok == '(') {
7699 SValue ret;
7700 Sym *sa;
7701 int nb_args;
7703 /* function call */
7704 if ((vtop->type.t & VT_BTYPE) != VT_FUNC) {
7705 /* pointer test (no array accepted) */
7706 if ((vtop->type.t & (VT_BTYPE | VT_ARRAY)) == VT_PTR) {
7707 vtop->type = *pointed_type(&vtop->type);
7708 if ((vtop->type.t & VT_BTYPE) != VT_FUNC)
7709 goto error_func;
7710 } else {
7711 error_func:
7712 expect("function pointer");
7714 } else {
7715 vtop->r &= ~VT_LVAL; /* no lvalue */
7717 /* get return type */
7718 s = vtop->type.ref;
7719 next();
7720 sa = s->next; /* first parameter */
7721 nb_args = 0;
7722 ret.r2 = VT_CONST;
7723 /* compute first implicit argument if a structure is returned */
7724 if ((s->type.t & VT_BTYPE) == VT_STRUCT) {
7725 /* get some space for the returned structure */
7726 size = type_size(&s->type, &align);
7727 loc = (loc - size) & -align;
7728 ret.type = s->type;
7729 ret.r = VT_LOCAL | VT_LVAL;
7730 /* pass it as 'int' to avoid structure arg passing
7731 problems */
7732 vseti(VT_LOCAL, loc);
7733 ret.c = vtop->c;
7734 nb_args++;
7735 } else {
7736 ret.type = s->type;
7737 /* return in register */
7738 if (is_float(ret.type.t)) {
7739 ret.r = REG_FRET;
7740 } else {
7741 if ((ret.type.t & VT_BTYPE) == VT_LLONG)
7742 ret.r2 = REG_LRET;
7743 ret.r = REG_IRET;
7745 ret.c.i = 0;
7747 if (tok != ')') {
7748 for(;;) {
7749 expr_eq();
7750 gfunc_param_typed(s, sa);
7751 nb_args++;
7752 if (sa)
7753 sa = sa->next;
7754 if (tok == ')')
7755 break;
7756 skip(',');
7759 if (sa)
7760 error("too few arguments to function");
7761 skip(')');
7762 if (!nocode_wanted) {
7763 gfunc_call(nb_args);
7764 } else {
7765 vtop -= (nb_args + 1);
7767 /* return value */
7768 vsetc(&ret.type, ret.r, &ret.c);
7769 vtop->r2 = ret.r2;
7770 } else {
7771 break;
7776 static void uneq(void)
7778 int t;
7780 unary();
7781 if (tok == '=' ||
7782 (tok >= TOK_A_MOD && tok <= TOK_A_DIV) ||
7783 tok == TOK_A_XOR || tok == TOK_A_OR ||
7784 tok == TOK_A_SHL || tok == TOK_A_SAR) {
7785 test_lvalue();
7786 t = tok;
7787 next();
7788 if (t == '=') {
7789 expr_eq();
7790 } else {
7791 vdup();
7792 expr_eq();
7793 gen_op(t & 0x7f);
7795 vstore();
7799 static void expr_prod(void)
7801 int t;
7803 uneq();
7804 while (tok == '*' || tok == '/' || tok == '%') {
7805 t = tok;
7806 next();
7807 uneq();
7808 gen_op(t);
7812 static void expr_sum(void)
7814 int t;
7816 expr_prod();
7817 while (tok == '+' || tok == '-') {
7818 t = tok;
7819 next();
7820 expr_prod();
7821 gen_op(t);
7825 static void expr_shift(void)
7827 int t;
7829 expr_sum();
7830 while (tok == TOK_SHL || tok == TOK_SAR) {
7831 t = tok;
7832 next();
7833 expr_sum();
7834 gen_op(t);
7838 static void expr_cmp(void)
7840 int t;
7842 expr_shift();
7843 while ((tok >= TOK_ULE && tok <= TOK_GT) ||
7844 tok == TOK_ULT || tok == TOK_UGE) {
7845 t = tok;
7846 next();
7847 expr_shift();
7848 gen_op(t);
7852 static void expr_cmpeq(void)
7854 int t;
7856 expr_cmp();
7857 while (tok == TOK_EQ || tok == TOK_NE) {
7858 t = tok;
7859 next();
7860 expr_cmp();
7861 gen_op(t);
7865 static void expr_and(void)
7867 expr_cmpeq();
7868 while (tok == '&') {
7869 next();
7870 expr_cmpeq();
7871 gen_op('&');
7875 static void expr_xor(void)
7877 expr_and();
7878 while (tok == '^') {
7879 next();
7880 expr_and();
7881 gen_op('^');
7885 static void expr_or(void)
7887 expr_xor();
7888 while (tok == '|') {
7889 next();
7890 expr_xor();
7891 gen_op('|');
7895 /* XXX: fix this mess */
7896 static void expr_land_const(void)
7898 expr_or();
7899 while (tok == TOK_LAND) {
7900 next();
7901 expr_or();
7902 gen_op(TOK_LAND);
7906 /* XXX: fix this mess */
7907 static void expr_lor_const(void)
7909 expr_land_const();
7910 while (tok == TOK_LOR) {
7911 next();
7912 expr_land_const();
7913 gen_op(TOK_LOR);
7917 /* only used if non constant */
7918 static void expr_land(void)
7920 int t;
7922 expr_or();
7923 if (tok == TOK_LAND) {
7924 t = 0;
7925 save_regs(1);
7926 for(;;) {
7927 t = gtst(1, t);
7928 if (tok != TOK_LAND) {
7929 vseti(VT_JMPI, t);
7930 break;
7932 next();
7933 expr_or();
7938 static void expr_lor(void)
7940 int t;
7942 expr_land();
7943 if (tok == TOK_LOR) {
7944 t = 0;
7945 save_regs(1);
7946 for(;;) {
7947 t = gtst(0, t);
7948 if (tok != TOK_LOR) {
7949 vseti(VT_JMP, t);
7950 break;
7952 next();
7953 expr_land();
7958 /* XXX: better constant handling */
7959 static void expr_eq(void)
7961 int tt, u, r1, r2, rc, t1, t2, bt1, bt2;
7962 SValue sv;
7963 CType type, type1, type2;
7965 if (const_wanted) {
7966 int c1, c;
7967 expr_lor_const();
7968 if (tok == '?') {
7969 c = vtop->c.i;
7970 vpop();
7971 next();
7972 if (tok == ':' && gnu_ext) {
7973 c1 = c;
7974 } else {
7975 gexpr();
7976 c1 = vtop->c.i;
7977 vpop();
7979 skip(':');
7980 expr_eq();
7981 if (c)
7982 vtop->c.i = c1;
7984 } else {
7985 expr_lor();
7986 if (tok == '?') {
7987 next();
7988 if (vtop != vstack) {
7989 /* needed to avoid having different registers saved in
7990 each branch */
7991 if (is_float(vtop->type.t))
7992 rc = RC_FLOAT;
7993 else
7994 rc = RC_INT;
7995 gv(rc);
7996 save_regs(1);
7998 if (tok == ':' && gnu_ext) {
7999 gv_dup();
8000 tt = gtst(1, 0);
8001 } else {
8002 tt = gtst(1, 0);
8003 gexpr();
8005 type1 = vtop->type;
8006 sv = *vtop; /* save value to handle it later */
8007 vtop--; /* no vpop so that FP stack is not flushed */
8008 skip(':');
8009 u = gjmp(0);
8010 gsym(tt);
8011 expr_eq();
8012 type2 = vtop->type;
8014 t1 = type1.t;
8015 bt1 = t1 & VT_BTYPE;
8016 t2 = type2.t;
8017 bt2 = t2 & VT_BTYPE;
8018 /* cast operands to correct type according to ISOC rules */
8019 if (is_float(bt1) || is_float(bt2)) {
8020 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
8021 type.t = VT_LDOUBLE;
8022 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
8023 type.t = VT_DOUBLE;
8024 } else {
8025 type.t = VT_FLOAT;
8027 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
8028 /* cast to biggest op */
8029 type.t = VT_LLONG;
8030 /* convert to unsigned if it does not fit in a long long */
8031 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
8032 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
8033 type.t |= VT_UNSIGNED;
8034 } else if (bt1 == VT_PTR || bt2 == VT_PTR) {
8035 /* XXX: test pointer compatibility */
8036 type = type1;
8037 } else if (bt1 == VT_FUNC || bt2 == VT_FUNC) {
8038 /* XXX: test function pointer compatibility */
8039 type = type1;
8040 } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) {
8041 /* XXX: test structure compatibility */
8042 type = type1;
8043 } else if (bt1 == VT_VOID || bt2 == VT_VOID) {
8044 /* NOTE: as an extension, we accept void on only one side */
8045 type.t = VT_VOID;
8046 } else {
8047 /* integer operations */
8048 type.t = VT_INT;
8049 /* convert to unsigned if it does not fit in an integer */
8050 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
8051 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
8052 type.t |= VT_UNSIGNED;
8055 /* now we convert second operand */
8056 gen_cast(&type);
8057 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
8058 gaddrof();
8059 rc = RC_INT;
8060 if (is_float(type.t)) {
8061 rc = RC_FLOAT;
8062 } else if ((type.t & VT_BTYPE) == VT_LLONG) {
8063 /* for long longs, we use fixed registers to avoid having
8064 to handle a complicated move */
8065 rc = RC_IRET;
8068 r2 = gv(rc);
8069 /* this is horrible, but we must also convert first
8070 operand */
8071 tt = gjmp(0);
8072 gsym(u);
8073 /* put again first value and cast it */
8074 *vtop = sv;
8075 gen_cast(&type);
8076 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
8077 gaddrof();
8078 r1 = gv(rc);
8079 move_reg(r2, r1);
8080 vtop->r = r2;
8081 gsym(tt);
8086 static void gexpr(void)
8088 while (1) {
8089 expr_eq();
8090 if (tok != ',')
8091 break;
8092 vpop();
8093 next();
8097 /* parse an expression and return its type without any side effect. */
8098 static void expr_type(CType *type)
8100 int saved_nocode_wanted;
8102 saved_nocode_wanted = nocode_wanted;
8103 nocode_wanted = 1;
8104 gexpr();
8105 *type = vtop->type;
8106 vpop();
8107 nocode_wanted = saved_nocode_wanted;
8110 /* parse a unary expression and return its type without any side
8111 effect. */
8112 static void unary_type(CType *type)
8114 int a;
8116 a = nocode_wanted;
8117 nocode_wanted = 1;
8118 unary();
8119 *type = vtop->type;
8120 vpop();
8121 nocode_wanted = a;
8124 /* parse a constant expression and return value in vtop. */
8125 static void expr_const1(void)
8127 int a;
8128 a = const_wanted;
8129 const_wanted = 1;
8130 expr_eq();
8131 const_wanted = a;
8134 /* parse an integer constant and return its value. */
8135 static int expr_const(void)
8137 int c;
8138 expr_const1();
8139 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
8140 expect("constant expression");
8141 c = vtop->c.i;
8142 vpop();
8143 return c;
8146 /* return the label token if current token is a label, otherwise
8147 return zero */
8148 static int is_label(void)
8150 int last_tok;
8152 /* fast test first */
8153 if (tok < TOK_UIDENT)
8154 return 0;
8155 /* no need to save tokc because tok is an identifier */
8156 last_tok = tok;
8157 next();
8158 if (tok == ':') {
8159 next();
8160 return last_tok;
8161 } else {
8162 unget_tok(last_tok);
8163 return 0;
8167 static void block(int *bsym, int *csym, int *case_sym, int *def_sym,
8168 int case_reg, int is_expr)
8170 int a, b, c, d;
8171 Sym *s;
8173 /* generate line number info */
8174 if (do_debug &&
8175 (last_line_num != file->line_num || last_ind != ind)) {
8176 put_stabn(N_SLINE, 0, file->line_num, ind - func_ind);
8177 last_ind = ind;
8178 last_line_num = file->line_num;
8181 if (is_expr) {
8182 /* default return value is (void) */
8183 vpushi(0);
8184 vtop->type.t = VT_VOID;
8187 if (tok == TOK_IF) {
8188 /* if test */
8189 next();
8190 skip('(');
8191 gexpr();
8192 skip(')');
8193 a = gtst(1, 0);
8194 block(bsym, csym, case_sym, def_sym, case_reg, 0);
8195 c = tok;
8196 if (c == TOK_ELSE) {
8197 next();
8198 d = gjmp(0);
8199 gsym(a);
8200 block(bsym, csym, case_sym, def_sym, case_reg, 0);
8201 gsym(d); /* patch else jmp */
8202 } else
8203 gsym(a);
8204 } else if (tok == TOK_WHILE) {
8205 next();
8206 d = ind;
8207 skip('(');
8208 gexpr();
8209 skip(')');
8210 a = gtst(1, 0);
8211 b = 0;
8212 block(&a, &b, case_sym, def_sym, case_reg, 0);
8213 gjmp_addr(d);
8214 gsym(a);
8215 gsym_addr(b, d);
8216 } else if (tok == '{') {
8217 Sym *llabel;
8219 next();
8220 /* record local declaration stack position */
8221 s = local_stack;
8222 llabel = local_label_stack;
8223 /* handle local labels declarations */
8224 if (tok == TOK_LABEL) {
8225 next();
8226 for(;;) {
8227 if (tok < TOK_UIDENT)
8228 expect("label identifier");
8229 label_push(&local_label_stack, tok, LABEL_DECLARED);
8230 next();
8231 if (tok == ',') {
8232 next();
8233 } else {
8234 skip(';');
8235 break;
8239 while (tok != '}') {
8240 decl(VT_LOCAL);
8241 if (tok != '}') {
8242 if (is_expr)
8243 vpop();
8244 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
8247 /* pop locally defined labels */
8248 label_pop(&local_label_stack, llabel);
8249 /* pop locally defined symbols */
8250 sym_pop(&local_stack, s);
8251 next();
8252 } else if (tok == TOK_RETURN) {
8253 next();
8254 if (tok != ';') {
8255 gexpr();
8256 gen_assign_cast(&func_vt);
8257 if ((func_vt.t & VT_BTYPE) == VT_STRUCT) {
8258 CType type;
8259 /* if returning structure, must copy it to implicit
8260 first pointer arg location */
8261 #ifdef TCC_ARM_EABI
8262 int align, size;
8263 size = type_size(&func_vt,&align);
8264 if(size <= 4)
8266 if((vtop->r != (VT_LOCAL | VT_LVAL) || (vtop->c.i & 3))
8267 && (align & 3))
8269 int addr;
8270 loc = (loc - size) & -4;
8271 addr = loc;
8272 type = func_vt;
8273 vset(&type, VT_LOCAL | VT_LVAL, addr);
8274 vswap();
8275 vstore();
8276 vset(&int_type, VT_LOCAL | VT_LVAL, addr);
8278 vtop->type = int_type;
8279 gv(RC_IRET);
8280 } else {
8281 #endif
8282 type = func_vt;
8283 mk_pointer(&type);
8284 vset(&type, VT_LOCAL | VT_LVAL, func_vc);
8285 indir();
8286 vswap();
8287 /* copy structure value to pointer */
8288 vstore();
8289 #ifdef TCC_ARM_EABI
8291 #endif
8292 } else if (is_float(func_vt.t)) {
8293 gv(RC_FRET);
8294 } else {
8295 gv(RC_IRET);
8297 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
8299 skip(';');
8300 rsym = gjmp(rsym); /* jmp */
8301 } else if (tok == TOK_BREAK) {
8302 /* compute jump */
8303 if (!bsym)
8304 error("cannot break");
8305 *bsym = gjmp(*bsym);
8306 next();
8307 skip(';');
8308 } else if (tok == TOK_CONTINUE) {
8309 /* compute jump */
8310 if (!csym)
8311 error("cannot continue");
8312 *csym = gjmp(*csym);
8313 next();
8314 skip(';');
8315 } else if (tok == TOK_FOR) {
8316 int e;
8317 next();
8318 skip('(');
8319 if (tok != ';') {
8320 gexpr();
8321 vpop();
8323 skip(';');
8324 d = ind;
8325 c = ind;
8326 a = 0;
8327 b = 0;
8328 if (tok != ';') {
8329 gexpr();
8330 a = gtst(1, 0);
8332 skip(';');
8333 if (tok != ')') {
8334 e = gjmp(0);
8335 c = ind;
8336 gexpr();
8337 vpop();
8338 gjmp_addr(d);
8339 gsym(e);
8341 skip(')');
8342 block(&a, &b, case_sym, def_sym, case_reg, 0);
8343 gjmp_addr(c);
8344 gsym(a);
8345 gsym_addr(b, c);
8346 } else
8347 if (tok == TOK_DO) {
8348 next();
8349 a = 0;
8350 b = 0;
8351 d = ind;
8352 block(&a, &b, case_sym, def_sym, case_reg, 0);
8353 skip(TOK_WHILE);
8354 skip('(');
8355 gsym(b);
8356 gexpr();
8357 c = gtst(0, 0);
8358 gsym_addr(c, d);
8359 skip(')');
8360 gsym(a);
8361 skip(';');
8362 } else
8363 if (tok == TOK_SWITCH) {
8364 next();
8365 skip('(');
8366 gexpr();
8367 /* XXX: other types than integer */
8368 case_reg = gv(RC_INT);
8369 vpop();
8370 skip(')');
8371 a = 0;
8372 b = gjmp(0); /* jump to first case */
8373 c = 0;
8374 block(&a, csym, &b, &c, case_reg, 0);
8375 /* if no default, jmp after switch */
8376 if (c == 0)
8377 c = ind;
8378 /* default label */
8379 gsym_addr(b, c);
8380 /* break label */
8381 gsym(a);
8382 } else
8383 if (tok == TOK_CASE) {
8384 int v1, v2;
8385 if (!case_sym)
8386 expect("switch");
8387 next();
8388 v1 = expr_const();
8389 v2 = v1;
8390 if (gnu_ext && tok == TOK_DOTS) {
8391 next();
8392 v2 = expr_const();
8393 if (v2 < v1)
8394 warning("empty case range");
8396 /* since a case is like a label, we must skip it with a jmp */
8397 b = gjmp(0);
8398 gsym(*case_sym);
8399 vseti(case_reg, 0);
8400 vpushi(v1);
8401 if (v1 == v2) {
8402 gen_op(TOK_EQ);
8403 *case_sym = gtst(1, 0);
8404 } else {
8405 gen_op(TOK_GE);
8406 *case_sym = gtst(1, 0);
8407 vseti(case_reg, 0);
8408 vpushi(v2);
8409 gen_op(TOK_LE);
8410 *case_sym = gtst(1, *case_sym);
8412 gsym(b);
8413 skip(':');
8414 is_expr = 0;
8415 goto block_after_label;
8416 } else
8417 if (tok == TOK_DEFAULT) {
8418 next();
8419 skip(':');
8420 if (!def_sym)
8421 expect("switch");
8422 if (*def_sym)
8423 error("too many 'default'");
8424 *def_sym = ind;
8425 is_expr = 0;
8426 goto block_after_label;
8427 } else
8428 if (tok == TOK_GOTO) {
8429 next();
8430 if (tok == '*' && gnu_ext) {
8431 /* computed goto */
8432 next();
8433 gexpr();
8434 if ((vtop->type.t & VT_BTYPE) != VT_PTR)
8435 expect("pointer");
8436 ggoto();
8437 } else if (tok >= TOK_UIDENT) {
8438 s = label_find(tok);
8439 /* put forward definition if needed */
8440 if (!s) {
8441 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
8442 } else {
8443 if (s->r == LABEL_DECLARED)
8444 s->r = LABEL_FORWARD;
8446 /* label already defined */
8447 if (s->r & LABEL_FORWARD)
8448 s->next = (void *)gjmp((long)s->next);
8449 else
8450 gjmp_addr((long)s->next);
8451 next();
8452 } else {
8453 expect("label identifier");
8455 skip(';');
8456 } else if (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3) {
8457 asm_instr();
8458 } else {
8459 b = is_label();
8460 if (b) {
8461 /* label case */
8462 s = label_find(b);
8463 if (s) {
8464 if (s->r == LABEL_DEFINED)
8465 error("duplicate label '%s'", get_tok_str(s->v, NULL));
8466 gsym((long)s->next);
8467 s->r = LABEL_DEFINED;
8468 } else {
8469 s = label_push(&global_label_stack, b, LABEL_DEFINED);
8471 s->next = (void *)ind;
8472 /* we accept this, but it is a mistake */
8473 block_after_label:
8474 if (tok == '}') {
8475 warning("deprecated use of label at end of compound statement");
8476 } else {
8477 if (is_expr)
8478 vpop();
8479 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
8481 } else {
8482 /* expression case */
8483 if (tok != ';') {
8484 if (is_expr) {
8485 vpop();
8486 gexpr();
8487 } else {
8488 gexpr();
8489 vpop();
8492 skip(';');
8497 /* t is the array or struct type. c is the array or struct
8498 address. cur_index/cur_field is the pointer to the current
8499 value. 'size_only' is true if only size info is needed (only used
8500 in arrays) */
8501 static void decl_designator(CType *type, Section *sec, unsigned long c,
8502 int *cur_index, Sym **cur_field,
8503 int size_only)
8505 Sym *s, *f;
8506 int notfirst, index, index_last, align, l, nb_elems, elem_size;
8507 CType type1;
8509 notfirst = 0;
8510 elem_size = 0;
8511 nb_elems = 1;
8512 if (gnu_ext && (l = is_label()) != 0)
8513 goto struct_field;
8514 while (tok == '[' || tok == '.') {
8515 if (tok == '[') {
8516 if (!(type->t & VT_ARRAY))
8517 expect("array type");
8518 s = type->ref;
8519 next();
8520 index = expr_const();
8521 if (index < 0 || (s->c >= 0 && index >= s->c))
8522 expect("invalid index");
8523 if (tok == TOK_DOTS && gnu_ext) {
8524 next();
8525 index_last = expr_const();
8526 if (index_last < 0 ||
8527 (s->c >= 0 && index_last >= s->c) ||
8528 index_last < index)
8529 expect("invalid index");
8530 } else {
8531 index_last = index;
8533 skip(']');
8534 if (!notfirst)
8535 *cur_index = index_last;
8536 type = pointed_type(type);
8537 elem_size = type_size(type, &align);
8538 c += index * elem_size;
8539 /* NOTE: we only support ranges for last designator */
8540 nb_elems = index_last - index + 1;
8541 if (nb_elems != 1) {
8542 notfirst = 1;
8543 break;
8545 } else {
8546 next();
8547 l = tok;
8548 next();
8549 struct_field:
8550 if ((type->t & VT_BTYPE) != VT_STRUCT)
8551 expect("struct/union type");
8552 s = type->ref;
8553 l |= SYM_FIELD;
8554 f = s->next;
8555 while (f) {
8556 if (f->v == l)
8557 break;
8558 f = f->next;
8560 if (!f)
8561 expect("field");
8562 if (!notfirst)
8563 *cur_field = f;
8564 /* XXX: fix this mess by using explicit storage field */
8565 type1 = f->type;
8566 type1.t |= (type->t & ~VT_TYPE);
8567 type = &type1;
8568 c += f->c;
8570 notfirst = 1;
8572 if (notfirst) {
8573 if (tok == '=') {
8574 next();
8575 } else {
8576 if (!gnu_ext)
8577 expect("=");
8579 } else {
8580 if (type->t & VT_ARRAY) {
8581 index = *cur_index;
8582 type = pointed_type(type);
8583 c += index * type_size(type, &align);
8584 } else {
8585 f = *cur_field;
8586 if (!f)
8587 error("too many field init");
8588 /* XXX: fix this mess by using explicit storage field */
8589 type1 = f->type;
8590 type1.t |= (type->t & ~VT_TYPE);
8591 type = &type1;
8592 c += f->c;
8595 decl_initializer(type, sec, c, 0, size_only);
8597 /* XXX: make it more general */
8598 if (!size_only && nb_elems > 1) {
8599 unsigned long c_end;
8600 uint8_t *src, *dst;
8601 int i;
8603 if (!sec)
8604 error("range init not supported yet for dynamic storage");
8605 c_end = c + nb_elems * elem_size;
8606 if (c_end > sec->data_allocated)
8607 section_realloc(sec, c_end);
8608 src = sec->data + c;
8609 dst = src;
8610 for(i = 1; i < nb_elems; i++) {
8611 dst += elem_size;
8612 memcpy(dst, src, elem_size);
8617 #define EXPR_VAL 0
8618 #define EXPR_CONST 1
8619 #define EXPR_ANY 2
8621 /* store a value or an expression directly in global data or in local array */
8622 static void init_putv(CType *type, Section *sec, unsigned long c,
8623 int v, int expr_type)
8625 int saved_global_expr, bt, bit_pos, bit_size;
8626 void *ptr;
8627 unsigned long long bit_mask;
8628 CType dtype;
8630 switch(expr_type) {
8631 case EXPR_VAL:
8632 vpushi(v);
8633 break;
8634 case EXPR_CONST:
8635 /* compound literals must be allocated globally in this case */
8636 saved_global_expr = global_expr;
8637 global_expr = 1;
8638 expr_const1();
8639 global_expr = saved_global_expr;
8640 /* NOTE: symbols are accepted */
8641 if ((vtop->r & (VT_VALMASK | VT_LVAL)) != VT_CONST)
8642 error("initializer element is not constant");
8643 break;
8644 case EXPR_ANY:
8645 expr_eq();
8646 break;
8649 dtype = *type;
8650 dtype.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
8652 if (sec) {
8653 /* XXX: not portable */
8654 /* XXX: generate error if incorrect relocation */
8655 gen_assign_cast(&dtype);
8656 bt = type->t & VT_BTYPE;
8657 ptr = sec->data + c;
8658 /* XXX: make code faster ? */
8659 if (!(type->t & VT_BITFIELD)) {
8660 bit_pos = 0;
8661 bit_size = 32;
8662 bit_mask = -1LL;
8663 } else {
8664 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
8665 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
8666 bit_mask = (1LL << bit_size) - 1;
8668 if ((vtop->r & VT_SYM) &&
8669 (bt == VT_BYTE ||
8670 bt == VT_SHORT ||
8671 bt == VT_DOUBLE ||
8672 bt == VT_LDOUBLE ||
8673 bt == VT_LLONG ||
8674 (bt == VT_INT && bit_size != 32)))
8675 error("initializer element is not computable at load time");
8676 switch(bt) {
8677 case VT_BYTE:
8678 *(char *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8679 break;
8680 case VT_SHORT:
8681 *(short *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8682 break;
8683 case VT_DOUBLE:
8684 *(double *)ptr = vtop->c.d;
8685 break;
8686 case VT_LDOUBLE:
8687 *(long double *)ptr = vtop->c.ld;
8688 break;
8689 case VT_LLONG:
8690 *(long long *)ptr |= (vtop->c.ll & bit_mask) << bit_pos;
8691 break;
8692 default:
8693 if (vtop->r & VT_SYM) {
8694 greloc(sec, vtop->sym, c, R_DATA_32);
8696 *(int *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8697 break;
8699 vtop--;
8700 } else {
8701 vset(&dtype, VT_LOCAL|VT_LVAL, c);
8702 vswap();
8703 vstore();
8704 vpop();
8708 /* put zeros for variable based init */
8709 static void init_putz(CType *t, Section *sec, unsigned long c, int size)
8711 if (sec) {
8712 /* nothing to do because globals are already set to zero */
8713 } else {
8714 vpush_global_sym(&func_old_type, TOK_memset);
8715 vseti(VT_LOCAL, c);
8716 vpushi(0);
8717 vpushi(size);
8718 gfunc_call(3);
8722 /* 't' contains the type and storage info. 'c' is the offset of the
8723 object in section 'sec'. If 'sec' is NULL, it means stack based
8724 allocation. 'first' is true if array '{' must be read (multi
8725 dimension implicit array init handling). 'size_only' is true if
8726 size only evaluation is wanted (only for arrays). */
8727 static void decl_initializer(CType *type, Section *sec, unsigned long c,
8728 int first, int size_only)
8730 int index, array_length, n, no_oblock, nb, parlevel, i;
8731 int size1, align1, expr_type;
8732 Sym *s, *f;
8733 CType *t1;
8735 if (type->t & VT_ARRAY) {
8736 s = type->ref;
8737 n = s->c;
8738 array_length = 0;
8739 t1 = pointed_type(type);
8740 size1 = type_size(t1, &align1);
8742 no_oblock = 1;
8743 if ((first && tok != TOK_LSTR && tok != TOK_STR) ||
8744 tok == '{') {
8745 skip('{');
8746 no_oblock = 0;
8749 /* only parse strings here if correct type (otherwise: handle
8750 them as ((w)char *) expressions */
8751 if ((tok == TOK_LSTR &&
8752 #ifdef TCC_TARGET_PE
8753 (t1->t & VT_BTYPE) == VT_SHORT && (t1->t & VT_UNSIGNED)
8754 #else
8755 (t1->t & VT_BTYPE) == VT_INT
8756 #endif
8757 ) || (tok == TOK_STR && (t1->t & VT_BTYPE) == VT_BYTE)) {
8758 while (tok == TOK_STR || tok == TOK_LSTR) {
8759 int cstr_len, ch;
8760 CString *cstr;
8762 cstr = tokc.cstr;
8763 /* compute maximum number of chars wanted */
8764 if (tok == TOK_STR)
8765 cstr_len = cstr->size;
8766 else
8767 cstr_len = cstr->size / sizeof(nwchar_t);
8768 cstr_len--;
8769 nb = cstr_len;
8770 if (n >= 0 && nb > (n - array_length))
8771 nb = n - array_length;
8772 if (!size_only) {
8773 if (cstr_len > nb)
8774 warning("initializer-string for array is too long");
8775 /* in order to go faster for common case (char
8776 string in global variable, we handle it
8777 specifically */
8778 if (sec && tok == TOK_STR && size1 == 1) {
8779 memcpy(sec->data + c + array_length, cstr->data, nb);
8780 } else {
8781 for(i=0;i<nb;i++) {
8782 if (tok == TOK_STR)
8783 ch = ((unsigned char *)cstr->data)[i];
8784 else
8785 ch = ((nwchar_t *)cstr->data)[i];
8786 init_putv(t1, sec, c + (array_length + i) * size1,
8787 ch, EXPR_VAL);
8791 array_length += nb;
8792 next();
8794 /* only add trailing zero if enough storage (no
8795 warning in this case since it is standard) */
8796 if (n < 0 || array_length < n) {
8797 if (!size_only) {
8798 init_putv(t1, sec, c + (array_length * size1), 0, EXPR_VAL);
8800 array_length++;
8802 } else {
8803 index = 0;
8804 while (tok != '}') {
8805 decl_designator(type, sec, c, &index, NULL, size_only);
8806 if (n >= 0 && index >= n)
8807 error("index too large");
8808 /* must put zero in holes (note that doing it that way
8809 ensures that it even works with designators) */
8810 if (!size_only && array_length < index) {
8811 init_putz(t1, sec, c + array_length * size1,
8812 (index - array_length) * size1);
8814 index++;
8815 if (index > array_length)
8816 array_length = index;
8817 /* special test for multi dimensional arrays (may not
8818 be strictly correct if designators are used at the
8819 same time) */
8820 if (index >= n && no_oblock)
8821 break;
8822 if (tok == '}')
8823 break;
8824 skip(',');
8827 if (!no_oblock)
8828 skip('}');
8829 /* put zeros at the end */
8830 if (!size_only && n >= 0 && array_length < n) {
8831 init_putz(t1, sec, c + array_length * size1,
8832 (n - array_length) * size1);
8834 /* patch type size if needed */
8835 if (n < 0)
8836 s->c = array_length;
8837 } else if ((type->t & VT_BTYPE) == VT_STRUCT &&
8838 (sec || !first || tok == '{')) {
8839 int par_count;
8841 /* NOTE: the previous test is a specific case for automatic
8842 struct/union init */
8843 /* XXX: union needs only one init */
8845 /* XXX: this test is incorrect for local initializers
8846 beginning with ( without {. It would be much more difficult
8847 to do it correctly (ideally, the expression parser should
8848 be used in all cases) */
8849 par_count = 0;
8850 if (tok == '(') {
8851 AttributeDef ad1;
8852 CType type1;
8853 next();
8854 while (tok == '(') {
8855 par_count++;
8856 next();
8858 if (!parse_btype(&type1, &ad1))
8859 expect("cast");
8860 type_decl(&type1, &ad1, &n, TYPE_ABSTRACT);
8861 #if 0
8862 if (!is_assignable_types(type, &type1))
8863 error("invalid type for cast");
8864 #endif
8865 skip(')');
8867 no_oblock = 1;
8868 if (first || tok == '{') {
8869 skip('{');
8870 no_oblock = 0;
8872 s = type->ref;
8873 f = s->next;
8874 array_length = 0;
8875 index = 0;
8876 n = s->c;
8877 while (tok != '}') {
8878 decl_designator(type, sec, c, NULL, &f, size_only);
8879 index = f->c;
8880 if (!size_only && array_length < index) {
8881 init_putz(type, sec, c + array_length,
8882 index - array_length);
8884 index = index + type_size(&f->type, &align1);
8885 if (index > array_length)
8886 array_length = index;
8887 f = f->next;
8888 if (no_oblock && f == NULL)
8889 break;
8890 if (tok == '}')
8891 break;
8892 skip(',');
8894 /* put zeros at the end */
8895 if (!size_only && array_length < n) {
8896 init_putz(type, sec, c + array_length,
8897 n - array_length);
8899 if (!no_oblock)
8900 skip('}');
8901 while (par_count) {
8902 skip(')');
8903 par_count--;
8905 } else if (tok == '{') {
8906 next();
8907 decl_initializer(type, sec, c, first, size_only);
8908 skip('}');
8909 } else if (size_only) {
8910 /* just skip expression */
8911 parlevel = 0;
8912 while ((parlevel > 0 || (tok != '}' && tok != ',')) &&
8913 tok != -1) {
8914 if (tok == '(')
8915 parlevel++;
8916 else if (tok == ')')
8917 parlevel--;
8918 next();
8920 } else {
8921 /* currently, we always use constant expression for globals
8922 (may change for scripting case) */
8923 expr_type = EXPR_CONST;
8924 if (!sec)
8925 expr_type = EXPR_ANY;
8926 init_putv(type, sec, c, 0, expr_type);
8930 /* parse an initializer for type 't' if 'has_init' is non zero, and
8931 allocate space in local or global data space ('r' is either
8932 VT_LOCAL or VT_CONST). If 'v' is non zero, then an associated
8933 variable 'v' of scope 'scope' is declared before initializers are
8934 parsed. If 'v' is zero, then a reference to the new object is put
8935 in the value stack. If 'has_init' is 2, a special parsing is done
8936 to handle string constants. */
8937 static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r,
8938 int has_init, int v, int scope)
8940 int size, align, addr, data_offset;
8941 int level;
8942 ParseState saved_parse_state;
8943 TokenString init_str;
8944 Section *sec;
8946 size = type_size(type, &align);
8947 /* If unknown size, we must evaluate it before
8948 evaluating initializers because
8949 initializers can generate global data too
8950 (e.g. string pointers or ISOC99 compound
8951 literals). It also simplifies local
8952 initializers handling */
8953 tok_str_new(&init_str);
8954 if (size < 0) {
8955 if (!has_init)
8956 error("unknown type size");
8957 /* get all init string */
8958 if (has_init == 2) {
8959 /* only get strings */
8960 while (tok == TOK_STR || tok == TOK_LSTR) {
8961 tok_str_add_tok(&init_str);
8962 next();
8964 } else {
8965 level = 0;
8966 while (level > 0 || (tok != ',' && tok != ';')) {
8967 if (tok < 0)
8968 error("unexpected end of file in initializer");
8969 tok_str_add_tok(&init_str);
8970 if (tok == '{')
8971 level++;
8972 else if (tok == '}') {
8973 if (level == 0)
8974 break;
8975 level--;
8977 next();
8980 tok_str_add(&init_str, -1);
8981 tok_str_add(&init_str, 0);
8983 /* compute size */
8984 save_parse_state(&saved_parse_state);
8986 macro_ptr = init_str.str;
8987 next();
8988 decl_initializer(type, NULL, 0, 1, 1);
8989 /* prepare second initializer parsing */
8990 macro_ptr = init_str.str;
8991 next();
8993 /* if still unknown size, error */
8994 size = type_size(type, &align);
8995 if (size < 0)
8996 error("unknown type size");
8998 /* take into account specified alignment if bigger */
8999 if (ad->aligned) {
9000 if (ad->aligned > align)
9001 align = ad->aligned;
9002 } else if (ad->packed) {
9003 align = 1;
9005 if ((r & VT_VALMASK) == VT_LOCAL) {
9006 sec = NULL;
9007 if (do_bounds_check && (type->t & VT_ARRAY))
9008 loc--;
9009 loc = (loc - size) & -align;
9010 addr = loc;
9011 /* handles bounds */
9012 /* XXX: currently, since we do only one pass, we cannot track
9013 '&' operators, so we add only arrays */
9014 if (do_bounds_check && (type->t & VT_ARRAY)) {
9015 unsigned long *bounds_ptr;
9016 /* add padding between regions */
9017 loc--;
9018 /* then add local bound info */
9019 bounds_ptr = section_ptr_add(lbounds_section, 2 * sizeof(unsigned long));
9020 bounds_ptr[0] = addr;
9021 bounds_ptr[1] = size;
9023 if (v) {
9024 /* local variable */
9025 sym_push(v, type, r, addr);
9026 } else {
9027 /* push local reference */
9028 vset(type, r, addr);
9030 } else {
9031 Sym *sym;
9033 sym = NULL;
9034 if (v && scope == VT_CONST) {
9035 /* see if the symbol was already defined */
9036 sym = sym_find(v);
9037 if (sym) {
9038 if (!is_compatible_types(&sym->type, type))
9039 error("incompatible types for redefinition of '%s'",
9040 get_tok_str(v, NULL));
9041 if (sym->type.t & VT_EXTERN) {
9042 /* if the variable is extern, it was not allocated */
9043 sym->type.t &= ~VT_EXTERN;
9044 /* set array size if it was ommited in extern
9045 declaration */
9046 if ((sym->type.t & VT_ARRAY) &&
9047 sym->type.ref->c < 0 &&
9048 type->ref->c >= 0)
9049 sym->type.ref->c = type->ref->c;
9050 } else {
9051 /* we accept several definitions of the same
9052 global variable. this is tricky, because we
9053 must play with the SHN_COMMON type of the symbol */
9054 /* XXX: should check if the variable was already
9055 initialized. It is incorrect to initialized it
9056 twice */
9057 /* no init data, we won't add more to the symbol */
9058 if (!has_init)
9059 goto no_alloc;
9064 /* allocate symbol in corresponding section */
9065 sec = ad->section;
9066 if (!sec) {
9067 if (has_init)
9068 sec = data_section;
9069 else if (tcc_state->nocommon)
9070 sec = bss_section;
9072 if (sec) {
9073 data_offset = sec->data_offset;
9074 data_offset = (data_offset + align - 1) & -align;
9075 addr = data_offset;
9076 /* very important to increment global pointer at this time
9077 because initializers themselves can create new initializers */
9078 data_offset += size;
9079 /* add padding if bound check */
9080 if (do_bounds_check)
9081 data_offset++;
9082 sec->data_offset = data_offset;
9083 /* allocate section space to put the data */
9084 if (sec->sh_type != SHT_NOBITS &&
9085 data_offset > sec->data_allocated)
9086 section_realloc(sec, data_offset);
9087 /* align section if needed */
9088 if (align > sec->sh_addralign)
9089 sec->sh_addralign = align;
9090 } else {
9091 addr = 0; /* avoid warning */
9094 if (v) {
9095 if (scope != VT_CONST || !sym) {
9096 sym = sym_push(v, type, r | VT_SYM, 0);
9098 /* update symbol definition */
9099 if (sec) {
9100 put_extern_sym(sym, sec, addr, size);
9101 } else {
9102 Elf32_Sym *esym;
9103 /* put a common area */
9104 put_extern_sym(sym, NULL, align, size);
9105 /* XXX: find a nicer way */
9106 esym = &((Elf32_Sym *)symtab_section->data)[sym->c];
9107 esym->st_shndx = SHN_COMMON;
9109 } else {
9110 CValue cval;
9112 /* push global reference */
9113 sym = get_sym_ref(type, sec, addr, size);
9114 cval.ul = 0;
9115 vsetc(type, VT_CONST | VT_SYM, &cval);
9116 vtop->sym = sym;
9119 /* handles bounds now because the symbol must be defined
9120 before for the relocation */
9121 if (do_bounds_check) {
9122 unsigned long *bounds_ptr;
9124 greloc(bounds_section, sym, bounds_section->data_offset, R_DATA_32);
9125 /* then add global bound info */
9126 bounds_ptr = section_ptr_add(bounds_section, 2 * sizeof(long));
9127 bounds_ptr[0] = 0; /* relocated */
9128 bounds_ptr[1] = size;
9131 if (has_init) {
9132 decl_initializer(type, sec, addr, 1, 0);
9133 /* restore parse state if needed */
9134 if (init_str.str) {
9135 tok_str_free(init_str.str);
9136 restore_parse_state(&saved_parse_state);
9139 no_alloc: ;
9142 void put_func_debug(Sym *sym)
9144 char buf[512];
9146 /* stabs info */
9147 /* XXX: we put here a dummy type */
9148 snprintf(buf, sizeof(buf), "%s:%c1",
9149 funcname, sym->type.t & VT_STATIC ? 'f' : 'F');
9150 put_stabs_r(buf, N_FUN, 0, file->line_num, 0,
9151 cur_text_section, sym->c);
9152 /* //gr gdb wants a line at the function */
9153 put_stabn(N_SLINE, 0, file->line_num, 0);
9154 last_ind = 0;
9155 last_line_num = 0;
9158 /* parse an old style function declaration list */
9159 /* XXX: check multiple parameter */
9160 static void func_decl_list(Sym *func_sym)
9162 AttributeDef ad;
9163 int v;
9164 Sym *s;
9165 CType btype, type;
9167 /* parse each declaration */
9168 while (tok != '{' && tok != ';' && tok != ',' && tok != TOK_EOF) {
9169 if (!parse_btype(&btype, &ad))
9170 expect("declaration list");
9171 if (((btype.t & VT_BTYPE) == VT_ENUM ||
9172 (btype.t & VT_BTYPE) == VT_STRUCT) &&
9173 tok == ';') {
9174 /* we accept no variable after */
9175 } else {
9176 for(;;) {
9177 type = btype;
9178 type_decl(&type, &ad, &v, TYPE_DIRECT);
9179 /* find parameter in function parameter list */
9180 s = func_sym->next;
9181 while (s != NULL) {
9182 if ((s->v & ~SYM_FIELD) == v)
9183 goto found;
9184 s = s->next;
9186 error("declaration for parameter '%s' but no such parameter",
9187 get_tok_str(v, NULL));
9188 found:
9189 /* check that no storage specifier except 'register' was given */
9190 if (type.t & VT_STORAGE)
9191 error("storage class specified for '%s'", get_tok_str(v, NULL));
9192 convert_parameter_type(&type);
9193 /* we can add the type (NOTE: it could be local to the function) */
9194 s->type = type;
9195 /* accept other parameters */
9196 if (tok == ',')
9197 next();
9198 else
9199 break;
9202 skip(';');
9206 /* parse a function defined by symbol 'sym' and generate its code in
9207 'cur_text_section' */
9208 static void gen_function(Sym *sym)
9210 int saved_nocode_wanted = nocode_wanted;
9211 nocode_wanted = 0;
9212 ind = cur_text_section->data_offset;
9213 /* NOTE: we patch the symbol size later */
9214 put_extern_sym(sym, cur_text_section, ind, 0);
9215 funcname = get_tok_str(sym->v, NULL);
9216 func_ind = ind;
9217 /* put debug symbol */
9218 if (do_debug)
9219 put_func_debug(sym);
9220 /* push a dummy symbol to enable local sym storage */
9221 sym_push2(&local_stack, SYM_FIELD, 0, 0);
9222 gfunc_prolog(&sym->type);
9223 rsym = 0;
9224 block(NULL, NULL, NULL, NULL, 0, 0);
9225 gsym(rsym);
9226 gfunc_epilog();
9227 cur_text_section->data_offset = ind;
9228 label_pop(&global_label_stack, NULL);
9229 sym_pop(&local_stack, NULL); /* reset local stack */
9230 /* end of function */
9231 /* patch symbol size */
9232 ((Elf32_Sym *)symtab_section->data)[sym->c].st_size =
9233 ind - func_ind;
9234 if (do_debug) {
9235 put_stabn(N_FUN, 0, 0, ind - func_ind);
9237 funcname = ""; /* for safety */
9238 func_vt.t = VT_VOID; /* for safety */
9239 ind = 0; /* for safety */
9240 nocode_wanted = saved_nocode_wanted;
9243 static void gen_inline_functions(void)
9245 Sym *sym;
9246 CType *type;
9247 int *str, inline_generated;
9249 /* iterate while inline function are referenced */
9250 for(;;) {
9251 inline_generated = 0;
9252 for(sym = global_stack; sym != NULL; sym = sym->prev) {
9253 type = &sym->type;
9254 if (((type->t & VT_BTYPE) == VT_FUNC) &&
9255 (type->t & (VT_STATIC | VT_INLINE)) ==
9256 (VT_STATIC | VT_INLINE) &&
9257 sym->c != 0) {
9258 /* the function was used: generate its code and
9259 convert it to a normal function */
9260 str = INLINE_DEF(sym->r);
9261 sym->r = VT_SYM | VT_CONST;
9262 sym->type.t &= ~VT_INLINE;
9264 macro_ptr = str;
9265 next();
9266 cur_text_section = text_section;
9267 gen_function(sym);
9268 macro_ptr = NULL; /* fail safe */
9270 tok_str_free(str);
9271 inline_generated = 1;
9274 if (!inline_generated)
9275 break;
9278 /* free all remaining inline function tokens */
9279 for(sym = global_stack; sym != NULL; sym = sym->prev) {
9280 type = &sym->type;
9281 if (((type->t & VT_BTYPE) == VT_FUNC) &&
9282 (type->t & (VT_STATIC | VT_INLINE)) ==
9283 (VT_STATIC | VT_INLINE)) {
9284 //gr printf("sym %d %s\n", sym->r, get_tok_str(sym->v, NULL));
9285 if (sym->r == (VT_SYM | VT_CONST)) //gr beware!
9286 continue;
9287 str = INLINE_DEF(sym->r);
9288 tok_str_free(str);
9289 sym->r = 0; /* fail safe */
9294 /* 'l' is VT_LOCAL or VT_CONST to define default storage type */
9295 static void decl(int l)
9297 int v, has_init, r;
9298 CType type, btype;
9299 Sym *sym;
9300 AttributeDef ad;
9302 while (1) {
9303 if (!parse_btype(&btype, &ad)) {
9304 /* skip redundant ';' */
9305 /* XXX: find more elegant solution */
9306 if (tok == ';') {
9307 next();
9308 continue;
9310 if (l == VT_CONST &&
9311 (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
9312 /* global asm block */
9313 asm_global_instr();
9314 continue;
9316 /* special test for old K&R protos without explicit int
9317 type. Only accepted when defining global data */
9318 if (l == VT_LOCAL || tok < TOK_DEFINE)
9319 break;
9320 btype.t = VT_INT;
9322 if (((btype.t & VT_BTYPE) == VT_ENUM ||
9323 (btype.t & VT_BTYPE) == VT_STRUCT) &&
9324 tok == ';') {
9325 /* we accept no variable after */
9326 next();
9327 continue;
9329 while (1) { /* iterate thru each declaration */
9330 type = btype;
9331 type_decl(&type, &ad, &v, TYPE_DIRECT);
9332 #if 0
9334 char buf[500];
9335 type_to_str(buf, sizeof(buf), t, get_tok_str(v, NULL));
9336 printf("type = '%s'\n", buf);
9338 #endif
9339 if ((type.t & VT_BTYPE) == VT_FUNC) {
9340 /* if old style function prototype, we accept a
9341 declaration list */
9342 sym = type.ref;
9343 if (sym->c == FUNC_OLD)
9344 func_decl_list(sym);
9347 if (tok == '{') {
9348 if (l == VT_LOCAL)
9349 error("cannot use local functions");
9350 if ((type.t & VT_BTYPE) != VT_FUNC)
9351 expect("function definition");
9353 /* reject abstract declarators in function definition */
9354 sym = type.ref;
9355 while ((sym = sym->next) != NULL)
9356 if (!(sym->v & ~SYM_FIELD))
9357 expect("identifier");
9359 /* XXX: cannot do better now: convert extern line to static inline */
9360 if ((type.t & (VT_EXTERN | VT_INLINE)) == (VT_EXTERN | VT_INLINE))
9361 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
9363 sym = sym_find(v);
9364 if (sym) {
9365 if ((sym->type.t & VT_BTYPE) != VT_FUNC)
9366 goto func_error1;
9367 /* specific case: if not func_call defined, we put
9368 the one of the prototype */
9369 /* XXX: should have default value */
9370 r = sym->type.ref->r;
9371 if (FUNC_CALL(r) != FUNC_CDECL
9372 && FUNC_CALL(type.ref->r) == FUNC_CDECL)
9373 FUNC_CALL(type.ref->r) = FUNC_CALL(r);
9374 if (FUNC_EXPORT(r))
9375 FUNC_EXPORT(type.ref->r) = 1;
9377 if (!is_compatible_types(&sym->type, &type)) {
9378 func_error1:
9379 error("incompatible types for redefinition of '%s'",
9380 get_tok_str(v, NULL));
9382 /* if symbol is already defined, then put complete type */
9383 sym->type = type;
9384 } else {
9385 /* put function symbol */
9386 sym = global_identifier_push(v, type.t, 0);
9387 sym->type.ref = type.ref;
9390 /* static inline functions are just recorded as a kind
9391 of macro. Their code will be emitted at the end of
9392 the compilation unit only if they are used */
9393 if ((type.t & (VT_INLINE | VT_STATIC)) ==
9394 (VT_INLINE | VT_STATIC)) {
9395 TokenString func_str;
9396 int block_level;
9398 tok_str_new(&func_str);
9400 block_level = 0;
9401 for(;;) {
9402 int t;
9403 if (tok == TOK_EOF)
9404 error("unexpected end of file");
9405 tok_str_add_tok(&func_str);
9406 t = tok;
9407 next();
9408 if (t == '{') {
9409 block_level++;
9410 } else if (t == '}') {
9411 block_level--;
9412 if (block_level == 0)
9413 break;
9416 tok_str_add(&func_str, -1);
9417 tok_str_add(&func_str, 0);
9418 INLINE_DEF(sym->r) = func_str.str;
9419 } else {
9420 /* compute text section */
9421 cur_text_section = ad.section;
9422 if (!cur_text_section)
9423 cur_text_section = text_section;
9424 sym->r = VT_SYM | VT_CONST;
9425 gen_function(sym);
9427 break;
9428 } else {
9429 if (btype.t & VT_TYPEDEF) {
9430 /* save typedefed type */
9431 /* XXX: test storage specifiers ? */
9432 sym = sym_push(v, &type, 0, 0);
9433 sym->type.t |= VT_TYPEDEF;
9434 } else if ((type.t & VT_BTYPE) == VT_FUNC) {
9435 /* external function definition */
9436 /* specific case for func_call attribute */
9437 if (ad.func_attr)
9438 type.ref->r = ad.func_attr;
9439 external_sym(v, &type, 0);
9440 } else {
9441 /* not lvalue if array */
9442 r = 0;
9443 if (!(type.t & VT_ARRAY))
9444 r |= lvalue_type(type.t);
9445 has_init = (tok == '=');
9446 if ((btype.t & VT_EXTERN) ||
9447 ((type.t & VT_ARRAY) && (type.t & VT_STATIC) &&
9448 !has_init && l == VT_CONST && type.ref->c < 0)) {
9449 /* external variable */
9450 /* NOTE: as GCC, uninitialized global static
9451 arrays of null size are considered as
9452 extern */
9453 external_sym(v, &type, r);
9454 } else {
9455 type.t |= (btype.t & VT_STATIC); /* Retain "static". */
9456 if (type.t & VT_STATIC)
9457 r |= VT_CONST;
9458 else
9459 r |= l;
9460 if (has_init)
9461 next();
9462 decl_initializer_alloc(&type, &ad, r,
9463 has_init, v, l);
9466 if (tok != ',') {
9467 skip(';');
9468 break;
9470 next();
9476 /* better than nothing, but needs extension to handle '-E' option
9477 correctly too */
9478 static void preprocess_init(TCCState *s1)
9480 s1->include_stack_ptr = s1->include_stack;
9481 /* XXX: move that before to avoid having to initialize
9482 file->ifdef_stack_ptr ? */
9483 s1->ifdef_stack_ptr = s1->ifdef_stack;
9484 file->ifdef_stack_ptr = s1->ifdef_stack_ptr;
9486 /* XXX: not ANSI compliant: bound checking says error */
9487 vtop = vstack - 1;
9488 s1->pack_stack[0] = 0;
9489 s1->pack_stack_ptr = s1->pack_stack;
9492 /* compile the C file opened in 'file'. Return non zero if errors. */
9493 static int tcc_compile(TCCState *s1)
9495 Sym *define_start;
9496 char buf[512];
9497 volatile int section_sym;
9499 #ifdef INC_DEBUG
9500 printf("%s: **** new file\n", file->filename);
9501 #endif
9502 preprocess_init(s1);
9504 funcname = "";
9505 anon_sym = SYM_FIRST_ANOM;
9507 /* file info: full path + filename */
9508 section_sym = 0; /* avoid warning */
9509 if (do_debug) {
9510 section_sym = put_elf_sym(symtab_section, 0, 0,
9511 ELF32_ST_INFO(STB_LOCAL, STT_SECTION), 0,
9512 text_section->sh_num, NULL);
9513 getcwd(buf, sizeof(buf));
9514 #ifdef _WIN32
9515 normalize_slashes(buf);
9516 #endif
9517 pstrcat(buf, sizeof(buf), "/");
9518 put_stabs_r(buf, N_SO, 0, 0,
9519 text_section->data_offset, text_section, section_sym);
9520 put_stabs_r(file->filename, N_SO, 0, 0,
9521 text_section->data_offset, text_section, section_sym);
9523 /* an elf symbol of type STT_FILE must be put so that STB_LOCAL
9524 symbols can be safely used */
9525 put_elf_sym(symtab_section, 0, 0,
9526 ELF32_ST_INFO(STB_LOCAL, STT_FILE), 0,
9527 SHN_ABS, file->filename);
9529 /* define some often used types */
9530 int_type.t = VT_INT;
9532 char_pointer_type.t = VT_BYTE;
9533 mk_pointer(&char_pointer_type);
9535 func_old_type.t = VT_FUNC;
9536 func_old_type.ref = sym_push(SYM_FIELD, &int_type, FUNC_CDECL, FUNC_OLD);
9538 #if defined(TCC_ARM_EABI) && defined(TCC_ARM_VFP)
9539 float_type.t = VT_FLOAT;
9540 double_type.t = VT_DOUBLE;
9542 func_float_type.t = VT_FUNC;
9543 func_float_type.ref = sym_push(SYM_FIELD, &float_type, FUNC_CDECL, FUNC_OLD);
9544 func_double_type.t = VT_FUNC;
9545 func_double_type.ref = sym_push(SYM_FIELD, &double_type, FUNC_CDECL, FUNC_OLD);
9546 #endif
9548 #if 0
9549 /* define 'void *alloca(unsigned int)' builtin function */
9551 Sym *s1;
9553 p = anon_sym++;
9554 sym = sym_push(p, mk_pointer(VT_VOID), FUNC_CDECL, FUNC_NEW);
9555 s1 = sym_push(SYM_FIELD, VT_UNSIGNED | VT_INT, 0, 0);
9556 s1->next = NULL;
9557 sym->next = s1;
9558 sym_push(TOK_alloca, VT_FUNC | (p << VT_STRUCT_SHIFT), VT_CONST, 0);
9560 #endif
9562 define_start = define_stack;
9563 nocode_wanted = 1;
9565 if (setjmp(s1->error_jmp_buf) == 0) {
9566 s1->nb_errors = 0;
9567 s1->error_set_jmp_enabled = 1;
9569 ch = file->buf_ptr[0];
9570 tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF;
9571 parse_flags = PARSE_FLAG_PREPROCESS | PARSE_FLAG_TOK_NUM;
9572 next();
9573 decl(VT_CONST);
9574 if (tok != TOK_EOF)
9575 expect("declaration");
9577 /* end of translation unit info */
9578 if (do_debug) {
9579 put_stabs_r(NULL, N_SO, 0, 0,
9580 text_section->data_offset, text_section, section_sym);
9583 s1->error_set_jmp_enabled = 0;
9585 /* reset define stack, but leave -Dsymbols (may be incorrect if
9586 they are undefined) */
9587 free_defines(define_start);
9589 gen_inline_functions();
9591 sym_pop(&global_stack, NULL);
9592 sym_pop(&local_stack, NULL);
9594 return s1->nb_errors != 0 ? -1 : 0;
9597 /* Preprocess the current file */
9598 /* XXX: add line and file infos, add options to preserve spaces */
9599 static int tcc_preprocess(TCCState *s1)
9601 Sym *define_start;
9602 int last_is_space;
9604 preprocess_init(s1);
9606 define_start = define_stack;
9608 ch = file->buf_ptr[0];
9609 tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF;
9610 parse_flags = PARSE_FLAG_ASM_COMMENTS | PARSE_FLAG_PREPROCESS |
9611 PARSE_FLAG_LINEFEED;
9612 last_is_space = 1;
9613 next();
9614 for(;;) {
9615 if (tok == TOK_EOF) {
9616 break;
9617 } else if (tok == TOK_LINEFEED) {
9618 last_is_space = 1;
9619 } else {
9620 if (!last_is_space)
9621 fputc(' ', s1->outfile);
9622 last_is_space = 0;
9624 fputs(get_tok_str(tok, &tokc), s1->outfile);
9625 next();
9627 free_defines(define_start);
9628 return 0;
9631 #ifdef LIBTCC
9632 int tcc_compile_string(TCCState *s, const char *str)
9634 BufferedFile bf1, *bf = &bf1;
9635 int ret, len;
9636 char *buf;
9638 /* init file structure */
9639 bf->fd = -1;
9640 /* XXX: avoid copying */
9641 len = strlen(str);
9642 buf = tcc_malloc(len + 1);
9643 if (!buf)
9644 return -1;
9645 memcpy(buf, str, len);
9646 buf[len] = CH_EOB;
9647 bf->buf_ptr = buf;
9648 bf->buf_end = buf + len;
9649 pstrcpy(bf->filename, sizeof(bf->filename), "<string>");
9650 bf->line_num = 1;
9651 file = bf;
9652 ret = tcc_compile(s);
9653 file = NULL;
9654 tcc_free(buf);
9656 /* currently, no need to close */
9657 return ret;
9659 #endif
9661 /* define a preprocessor symbol. A value can also be provided with the '=' operator */
9662 void tcc_define_symbol(TCCState *s1, const char *sym, const char *value)
9664 BufferedFile bf1, *bf = &bf1;
9666 pstrcpy(bf->buffer, IO_BUF_SIZE, sym);
9667 pstrcat(bf->buffer, IO_BUF_SIZE, " ");
9668 /* default value */
9669 if (!value)
9670 value = "1";
9671 pstrcat(bf->buffer, IO_BUF_SIZE, value);
9673 /* init file structure */
9674 bf->fd = -1;
9675 bf->buf_ptr = bf->buffer;
9676 bf->buf_end = bf->buffer + strlen(bf->buffer);
9677 *bf->buf_end = CH_EOB;
9678 bf->filename[0] = '\0';
9679 bf->line_num = 1;
9680 file = bf;
9682 s1->include_stack_ptr = s1->include_stack;
9684 /* parse with define parser */
9685 ch = file->buf_ptr[0];
9686 next_nomacro();
9687 parse_define();
9688 file = NULL;
9691 /* undefine a preprocessor symbol */
9692 void tcc_undefine_symbol(TCCState *s1, const char *sym)
9694 TokenSym *ts;
9695 Sym *s;
9696 ts = tok_alloc(sym, strlen(sym));
9697 s = define_find(ts->tok);
9698 /* undefine symbol by putting an invalid name */
9699 if (s)
9700 define_undef(s);
9703 #ifdef CONFIG_TCC_ASM
9705 #ifdef TCC_TARGET_I386
9706 #include "i386-asm.c"
9707 #endif
9708 #include "tccasm.c"
9710 #else
9711 static void asm_instr(void)
9713 error("inline asm() not supported");
9715 static void asm_global_instr(void)
9717 error("inline asm() not supported");
9719 #endif
9721 #include "tccelf.c"
9723 #ifdef TCC_TARGET_COFF
9724 #include "tcccoff.c"
9725 #endif
9727 #ifdef TCC_TARGET_PE
9728 #include "tccpe.c"
9729 #endif
9731 /* print the position in the source file of PC value 'pc' by reading
9732 the stabs debug information */
9733 static void rt_printline(unsigned long wanted_pc)
9735 Stab_Sym *sym, *sym_end;
9736 char func_name[128], last_func_name[128];
9737 unsigned long func_addr, last_pc, pc;
9738 const char *incl_files[INCLUDE_STACK_SIZE];
9739 int incl_index, len, last_line_num, i;
9740 const char *str, *p;
9742 fprintf(stderr, "0x%08lx:", wanted_pc);
9744 func_name[0] = '\0';
9745 func_addr = 0;
9746 incl_index = 0;
9747 last_func_name[0] = '\0';
9748 last_pc = 0xffffffff;
9749 last_line_num = 1;
9750 sym = (Stab_Sym *)stab_section->data + 1;
9751 sym_end = (Stab_Sym *)(stab_section->data + stab_section->data_offset);
9752 while (sym < sym_end) {
9753 switch(sym->n_type) {
9754 /* function start or end */
9755 case N_FUN:
9756 if (sym->n_strx == 0) {
9757 /* we test if between last line and end of function */
9758 pc = sym->n_value + func_addr;
9759 if (wanted_pc >= last_pc && wanted_pc < pc)
9760 goto found;
9761 func_name[0] = '\0';
9762 func_addr = 0;
9763 } else {
9764 str = stabstr_section->data + sym->n_strx;
9765 p = strchr(str, ':');
9766 if (!p) {
9767 pstrcpy(func_name, sizeof(func_name), str);
9768 } else {
9769 len = p - str;
9770 if (len > sizeof(func_name) - 1)
9771 len = sizeof(func_name) - 1;
9772 memcpy(func_name, str, len);
9773 func_name[len] = '\0';
9775 func_addr = sym->n_value;
9777 break;
9778 /* line number info */
9779 case N_SLINE:
9780 pc = sym->n_value + func_addr;
9781 if (wanted_pc >= last_pc && wanted_pc < pc)
9782 goto found;
9783 last_pc = pc;
9784 last_line_num = sym->n_desc;
9785 /* XXX: slow! */
9786 strcpy(last_func_name, func_name);
9787 break;
9788 /* include files */
9789 case N_BINCL:
9790 str = stabstr_section->data + sym->n_strx;
9791 add_incl:
9792 if (incl_index < INCLUDE_STACK_SIZE) {
9793 incl_files[incl_index++] = str;
9795 break;
9796 case N_EINCL:
9797 if (incl_index > 1)
9798 incl_index--;
9799 break;
9800 case N_SO:
9801 if (sym->n_strx == 0) {
9802 incl_index = 0; /* end of translation unit */
9803 } else {
9804 str = stabstr_section->data + sym->n_strx;
9805 /* do not add path */
9806 len = strlen(str);
9807 if (len > 0 && str[len - 1] != '/')
9808 goto add_incl;
9810 break;
9812 sym++;
9815 /* second pass: we try symtab symbols (no line number info) */
9816 incl_index = 0;
9818 Elf32_Sym *sym, *sym_end;
9819 int type;
9821 sym_end = (Elf32_Sym *)(symtab_section->data + symtab_section->data_offset);
9822 for(sym = (Elf32_Sym *)symtab_section->data + 1;
9823 sym < sym_end;
9824 sym++) {
9825 type = ELF32_ST_TYPE(sym->st_info);
9826 if (type == STT_FUNC) {
9827 if (wanted_pc >= sym->st_value &&
9828 wanted_pc < sym->st_value + sym->st_size) {
9829 pstrcpy(last_func_name, sizeof(last_func_name),
9830 strtab_section->data + sym->st_name);
9831 goto found;
9836 /* did not find any info: */
9837 fprintf(stderr, " ???\n");
9838 return;
9839 found:
9840 if (last_func_name[0] != '\0') {
9841 fprintf(stderr, " %s()", last_func_name);
9843 if (incl_index > 0) {
9844 fprintf(stderr, " (%s:%d",
9845 incl_files[incl_index - 1], last_line_num);
9846 for(i = incl_index - 2; i >= 0; i--)
9847 fprintf(stderr, ", included from %s", incl_files[i]);
9848 fprintf(stderr, ")");
9850 fprintf(stderr, "\n");
9853 #if !defined(_WIN32) && !defined(CONFIG_TCCBOOT)
9855 #ifdef __i386__
9857 /* fix for glibc 2.1 */
9858 #ifndef REG_EIP
9859 #define REG_EIP EIP
9860 #define REG_EBP EBP
9861 #endif
9863 /* return the PC at frame level 'level'. Return non zero if not found */
9864 static int rt_get_caller_pc(unsigned long *paddr,
9865 ucontext_t *uc, int level)
9867 unsigned long fp;
9868 int i;
9870 if (level == 0) {
9871 #if defined(__FreeBSD__)
9872 *paddr = uc->uc_mcontext.mc_eip;
9873 #elif defined(__dietlibc__)
9874 *paddr = uc->uc_mcontext.eip;
9875 #else
9876 *paddr = uc->uc_mcontext.gregs[REG_EIP];
9877 #endif
9878 return 0;
9879 } else {
9880 #if defined(__FreeBSD__)
9881 fp = uc->uc_mcontext.mc_ebp;
9882 #elif defined(__dietlibc__)
9883 fp = uc->uc_mcontext.ebp;
9884 #else
9885 fp = uc->uc_mcontext.gregs[REG_EBP];
9886 #endif
9887 for(i=1;i<level;i++) {
9888 /* XXX: check address validity with program info */
9889 if (fp <= 0x1000 || fp >= 0xc0000000)
9890 return -1;
9891 fp = ((unsigned long *)fp)[0];
9893 *paddr = ((unsigned long *)fp)[1];
9894 return 0;
9897 #else
9899 #warning add arch specific rt_get_caller_pc()
9901 static int rt_get_caller_pc(unsigned long *paddr,
9902 ucontext_t *uc, int level)
9904 return -1;
9906 #endif
9908 /* emit a run time error at position 'pc' */
9909 void rt_error(ucontext_t *uc, const char *fmt, ...)
9911 va_list ap;
9912 unsigned long pc;
9913 int i;
9915 va_start(ap, fmt);
9916 fprintf(stderr, "Runtime error: ");
9917 vfprintf(stderr, fmt, ap);
9918 fprintf(stderr, "\n");
9919 for(i=0;i<num_callers;i++) {
9920 if (rt_get_caller_pc(&pc, uc, i) < 0)
9921 break;
9922 if (i == 0)
9923 fprintf(stderr, "at ");
9924 else
9925 fprintf(stderr, "by ");
9926 rt_printline(pc);
9928 exit(255);
9929 va_end(ap);
9932 /* signal handler for fatal errors */
9933 static void sig_error(int signum, siginfo_t *siginf, void *puc)
9935 ucontext_t *uc = puc;
9937 switch(signum) {
9938 case SIGFPE:
9939 switch(siginf->si_code) {
9940 case FPE_INTDIV:
9941 case FPE_FLTDIV:
9942 rt_error(uc, "division by zero");
9943 break;
9944 default:
9945 rt_error(uc, "floating point exception");
9946 break;
9948 break;
9949 case SIGBUS:
9950 case SIGSEGV:
9951 if (rt_bound_error_msg && *rt_bound_error_msg)
9952 rt_error(uc, *rt_bound_error_msg);
9953 else
9954 rt_error(uc, "dereferencing invalid pointer");
9955 break;
9956 case SIGILL:
9957 rt_error(uc, "illegal instruction");
9958 break;
9959 case SIGABRT:
9960 rt_error(uc, "abort() called");
9961 break;
9962 default:
9963 rt_error(uc, "caught signal %d", signum);
9964 break;
9966 exit(255);
9968 #endif
9970 /* do all relocations (needed before using tcc_get_symbol()) */
9971 int tcc_relocate(TCCState *s1)
9973 Section *s;
9974 int i;
9976 s1->nb_errors = 0;
9978 #ifdef TCC_TARGET_PE
9979 pe_add_runtime(s1);
9980 #else
9981 tcc_add_runtime(s1);
9982 #endif
9984 relocate_common_syms();
9986 tcc_add_linker_symbols(s1);
9987 #ifndef TCC_TARGET_PE
9988 build_got_entries(s1);
9989 #endif
9990 /* compute relocation address : section are relocated in place. We
9991 also alloc the bss space */
9992 for(i = 1; i < s1->nb_sections; i++) {
9993 s = s1->sections[i];
9994 if (s->sh_flags & SHF_ALLOC) {
9995 if (s->sh_type == SHT_NOBITS)
9996 s->data = tcc_mallocz(s->data_offset);
9997 s->sh_addr = (unsigned long)s->data;
10001 relocate_syms(s1, 1);
10003 if (s1->nb_errors != 0)
10004 return -1;
10006 /* relocate each section */
10007 for(i = 1; i < s1->nb_sections; i++) {
10008 s = s1->sections[i];
10009 if (s->reloc)
10010 relocate_section(s1, s);
10013 /* mark executable sections as executable in memory */
10014 for(i = 1; i < s1->nb_sections; i++) {
10015 s = s1->sections[i];
10016 if ((s->sh_flags & (SHF_ALLOC | SHF_EXECINSTR)) ==
10017 (SHF_ALLOC | SHF_EXECINSTR))
10018 set_pages_executable(s->data, s->data_offset);
10020 return 0;
10023 /* launch the compiled program with the given arguments */
10024 int tcc_run(TCCState *s1, int argc, char **argv)
10026 int (*prog_main)(int, char **);
10028 if (tcc_relocate(s1) < 0)
10029 return -1;
10031 prog_main = tcc_get_symbol_err(s1, "main");
10033 if (do_debug) {
10034 #if defined(_WIN32) || defined(CONFIG_TCCBOOT)
10035 error("debug mode currently not available for Windows");
10036 #else
10037 struct sigaction sigact;
10038 /* install TCC signal handlers to print debug info on fatal
10039 runtime errors */
10040 sigact.sa_flags = SA_SIGINFO | SA_RESETHAND;
10041 sigact.sa_sigaction = sig_error;
10042 sigemptyset(&sigact.sa_mask);
10043 sigaction(SIGFPE, &sigact, NULL);
10044 sigaction(SIGILL, &sigact, NULL);
10045 sigaction(SIGSEGV, &sigact, NULL);
10046 sigaction(SIGBUS, &sigact, NULL);
10047 sigaction(SIGABRT, &sigact, NULL);
10048 #endif
10051 #ifdef CONFIG_TCC_BCHECK
10052 if (do_bounds_check) {
10053 void (*bound_init)(void);
10055 /* set error function */
10056 rt_bound_error_msg = (void *)tcc_get_symbol_err(s1,
10057 "__bound_error_msg");
10059 /* XXX: use .init section so that it also work in binary ? */
10060 bound_init = (void *)tcc_get_symbol_err(s1, "__bound_init");
10061 bound_init();
10063 #endif
10064 return (*prog_main)(argc, argv);
10067 void tcc_memstats(void)
10069 #ifdef MEM_DEBUG
10070 printf("memory in use: %d\n", mem_cur_size);
10071 #endif
10074 static void tcc_cleanup(void)
10076 int i, n;
10078 if (NULL == tcc_state)
10079 return;
10080 tcc_state = NULL;
10082 /* free -D defines */
10083 free_defines(NULL);
10085 /* free tokens */
10086 n = tok_ident - TOK_IDENT;
10087 for(i = 0; i < n; i++)
10088 tcc_free(table_ident[i]);
10089 tcc_free(table_ident);
10091 /* free sym_pools */
10092 dynarray_reset(&sym_pools, &nb_sym_pools);
10093 /* string buffer */
10094 cstr_free(&tokcstr);
10095 /* reset symbol stack */
10096 sym_free_first = NULL;
10097 /* cleanup from error/setjmp */
10098 macro_ptr = NULL;
10101 TCCState *tcc_new(void)
10103 const char *p, *r;
10104 TCCState *s;
10105 TokenSym *ts;
10106 int i, c;
10108 tcc_cleanup();
10110 s = tcc_mallocz(sizeof(TCCState));
10111 if (!s)
10112 return NULL;
10113 tcc_state = s;
10114 s->output_type = TCC_OUTPUT_MEMORY;
10116 /* init isid table */
10117 for(i=CH_EOF;i<256;i++)
10118 isidnum_table[i-CH_EOF] = isid(i) || isnum(i);
10120 /* add all tokens */
10121 table_ident = NULL;
10122 memset(hash_ident, 0, TOK_HASH_SIZE * sizeof(TokenSym *));
10124 tok_ident = TOK_IDENT;
10125 p = tcc_keywords;
10126 while (*p) {
10127 r = p;
10128 for(;;) {
10129 c = *r++;
10130 if (c == '\0')
10131 break;
10133 ts = tok_alloc(p, r - p - 1);
10134 p = r;
10137 /* we add dummy defines for some special macros to speed up tests
10138 and to have working defined() */
10139 define_push(TOK___LINE__, MACRO_OBJ, NULL, NULL);
10140 define_push(TOK___FILE__, MACRO_OBJ, NULL, NULL);
10141 define_push(TOK___DATE__, MACRO_OBJ, NULL, NULL);
10142 define_push(TOK___TIME__, MACRO_OBJ, NULL, NULL);
10144 /* standard defines */
10145 tcc_define_symbol(s, "__STDC__", NULL);
10146 tcc_define_symbol(s, "__STDC_VERSION__", "199901L");
10147 #if defined(TCC_TARGET_I386)
10148 tcc_define_symbol(s, "__i386__", NULL);
10149 #endif
10150 #if defined(TCC_TARGET_ARM)
10151 tcc_define_symbol(s, "__ARM_ARCH_4__", NULL);
10152 tcc_define_symbol(s, "__arm_elf__", NULL);
10153 tcc_define_symbol(s, "__arm_elf", NULL);
10154 tcc_define_symbol(s, "arm_elf", NULL);
10155 tcc_define_symbol(s, "__arm__", NULL);
10156 tcc_define_symbol(s, "__arm", NULL);
10157 tcc_define_symbol(s, "arm", NULL);
10158 tcc_define_symbol(s, "__APCS_32__", NULL);
10159 #endif
10160 #ifdef TCC_TARGET_PE
10161 tcc_define_symbol(s, "_WIN32", NULL);
10162 #else
10163 tcc_define_symbol(s, "__unix__", NULL);
10164 tcc_define_symbol(s, "__unix", NULL);
10165 #if defined(__linux)
10166 tcc_define_symbol(s, "__linux__", NULL);
10167 tcc_define_symbol(s, "__linux", NULL);
10168 #endif
10169 #endif
10170 /* tiny C specific defines */
10171 tcc_define_symbol(s, "__TINYC__", NULL);
10173 /* tiny C & gcc defines */
10174 tcc_define_symbol(s, "__SIZE_TYPE__", "unsigned int");
10175 tcc_define_symbol(s, "__PTRDIFF_TYPE__", "int");
10176 #ifdef TCC_TARGET_PE
10177 tcc_define_symbol(s, "__WCHAR_TYPE__", "unsigned short");
10178 #else
10179 tcc_define_symbol(s, "__WCHAR_TYPE__", "int");
10180 #endif
10182 #ifndef TCC_TARGET_PE
10183 /* default library paths */
10184 tcc_add_library_path(s, "/usr/local/lib");
10185 tcc_add_library_path(s, "/usr/lib");
10186 tcc_add_library_path(s, "/lib");
10187 #endif
10189 /* no section zero */
10190 dynarray_add((void ***)&s->sections, &s->nb_sections, NULL);
10192 /* create standard sections */
10193 text_section = new_section(s, ".text", SHT_PROGBITS, SHF_ALLOC | SHF_EXECINSTR);
10194 data_section = new_section(s, ".data", SHT_PROGBITS, SHF_ALLOC | SHF_WRITE);
10195 bss_section = new_section(s, ".bss", SHT_NOBITS, SHF_ALLOC | SHF_WRITE);
10197 /* symbols are always generated for linking stage */
10198 symtab_section = new_symtab(s, ".symtab", SHT_SYMTAB, 0,
10199 ".strtab",
10200 ".hashtab", SHF_PRIVATE);
10201 strtab_section = symtab_section->link;
10203 /* private symbol table for dynamic symbols */
10204 s->dynsymtab_section = new_symtab(s, ".dynsymtab", SHT_SYMTAB, SHF_PRIVATE,
10205 ".dynstrtab",
10206 ".dynhashtab", SHF_PRIVATE);
10207 s->alacarte_link = 1;
10209 #ifdef CHAR_IS_UNSIGNED
10210 s->char_is_unsigned = 1;
10211 #endif
10212 #if defined(TCC_TARGET_PE) && 0
10213 /* XXX: currently the PE linker is not ready to support that */
10214 s->leading_underscore = 1;
10215 #endif
10216 return s;
10219 void tcc_delete(TCCState *s1)
10221 int i;
10223 tcc_cleanup();
10225 /* free all sections */
10226 free_section(s1->dynsymtab_section);
10228 for(i = 1; i < s1->nb_sections; i++)
10229 free_section(s1->sections[i]);
10230 tcc_free(s1->sections);
10232 /* free any loaded DLLs */
10233 for ( i = 0; i < s1->nb_loaded_dlls; i++)
10235 DLLReference *ref = s1->loaded_dlls[i];
10236 if ( ref->handle )
10237 dlclose(ref->handle);
10240 /* free loaded dlls array */
10241 dynarray_reset(&s1->loaded_dlls, &s1->nb_loaded_dlls);
10243 /* free library paths */
10244 dynarray_reset(&s1->library_paths, &s1->nb_library_paths);
10246 /* free include paths */
10247 dynarray_reset(&s1->cached_includes, &s1->nb_cached_includes);
10248 dynarray_reset(&s1->include_paths, &s1->nb_include_paths);
10249 dynarray_reset(&s1->sysinclude_paths, &s1->nb_sysinclude_paths);
10251 tcc_free(s1);
10254 int tcc_add_include_path(TCCState *s1, const char *pathname)
10256 char *pathname1;
10258 pathname1 = tcc_strdup(pathname);
10259 dynarray_add((void ***)&s1->include_paths, &s1->nb_include_paths, pathname1);
10260 return 0;
10263 int tcc_add_sysinclude_path(TCCState *s1, const char *pathname)
10265 char *pathname1;
10267 pathname1 = tcc_strdup(pathname);
10268 dynarray_add((void ***)&s1->sysinclude_paths, &s1->nb_sysinclude_paths, pathname1);
10269 return 0;
10272 static int tcc_add_file_internal(TCCState *s1, const char *filename, int flags)
10274 const char *ext;
10275 Elf32_Ehdr ehdr;
10276 int fd, ret;
10277 BufferedFile *saved_file;
10279 /* find source file type with extension */
10280 ext = tcc_fileextension(filename);
10281 if (ext[0])
10282 ext++;
10284 /* open the file */
10285 saved_file = file;
10286 file = tcc_open(s1, filename);
10287 if (!file) {
10288 if (flags & AFF_PRINT_ERROR) {
10289 error_noabort("file '%s' not found", filename);
10291 ret = -1;
10292 goto fail1;
10295 if (flags & AFF_PREPROCESS) {
10296 ret = tcc_preprocess(s1);
10297 } else if (!ext[0] || !strcmp(ext, "c")) {
10298 /* C file assumed */
10299 ret = tcc_compile(s1);
10300 } else
10301 #ifdef CONFIG_TCC_ASM
10302 if (!strcmp(ext, "S")) {
10303 /* preprocessed assembler */
10304 ret = tcc_assemble(s1, 1);
10305 } else if (!strcmp(ext, "s")) {
10306 /* non preprocessed assembler */
10307 ret = tcc_assemble(s1, 0);
10308 } else
10309 #endif
10310 #ifdef TCC_TARGET_PE
10311 if (!strcmp(ext, "def")) {
10312 ret = pe_load_def_file(s1, file->fd);
10313 } else
10314 #endif
10316 fd = file->fd;
10317 /* assume executable format: auto guess file type */
10318 ret = read(fd, &ehdr, sizeof(ehdr));
10319 lseek(fd, 0, SEEK_SET);
10320 if (ret <= 0) {
10321 error_noabort("could not read header");
10322 goto fail;
10323 } else if (ret != sizeof(ehdr)) {
10324 goto try_load_script;
10327 if (ehdr.e_ident[0] == ELFMAG0 &&
10328 ehdr.e_ident[1] == ELFMAG1 &&
10329 ehdr.e_ident[2] == ELFMAG2 &&
10330 ehdr.e_ident[3] == ELFMAG3) {
10331 file->line_num = 0; /* do not display line number if error */
10332 if (ehdr.e_type == ET_REL) {
10333 ret = tcc_load_object_file(s1, fd, 0);
10334 } else if (ehdr.e_type == ET_DYN) {
10335 if (s1->output_type == TCC_OUTPUT_MEMORY) {
10336 #ifdef TCC_TARGET_PE
10337 ret = -1;
10338 #else
10339 void *h;
10340 h = dlopen(filename, RTLD_GLOBAL | RTLD_LAZY);
10341 if (h)
10342 ret = 0;
10343 else
10344 ret = -1;
10345 #endif
10346 } else {
10347 ret = tcc_load_dll(s1, fd, filename,
10348 (flags & AFF_REFERENCED_DLL) != 0);
10350 } else {
10351 error_noabort("unrecognized ELF file");
10352 goto fail;
10354 } else if (memcmp((char *)&ehdr, ARMAG, 8) == 0) {
10355 file->line_num = 0; /* do not display line number if error */
10356 ret = tcc_load_archive(s1, fd);
10357 } else
10358 #ifdef TCC_TARGET_COFF
10359 if (*(uint16_t *)(&ehdr) == COFF_C67_MAGIC) {
10360 ret = tcc_load_coff(s1, fd);
10361 } else
10362 #endif
10363 #ifdef TCC_TARGET_PE
10364 if (pe_test_res_file(&ehdr, ret)) {
10365 ret = pe_load_res_file(s1, fd);
10366 } else
10367 #endif
10369 /* as GNU ld, consider it is an ld script if not recognized */
10370 try_load_script:
10371 ret = tcc_load_ldscript(s1);
10372 if (ret < 0) {
10373 error_noabort("unrecognized file type");
10374 goto fail;
10378 the_end:
10379 tcc_close(file);
10380 fail1:
10381 file = saved_file;
10382 return ret;
10383 fail:
10384 ret = -1;
10385 goto the_end;
10388 int tcc_add_file(TCCState *s, const char *filename)
10390 return tcc_add_file_internal(s, filename, AFF_PRINT_ERROR);
10393 int tcc_add_library_path(TCCState *s, const char *pathname)
10395 char *pathname1;
10397 pathname1 = tcc_strdup(pathname);
10398 dynarray_add((void ***)&s->library_paths, &s->nb_library_paths, pathname1);
10399 return 0;
10402 /* find and load a dll. Return non zero if not found */
10403 /* XXX: add '-rpath' option support ? */
10404 static int tcc_add_dll(TCCState *s, const char *filename, int flags)
10406 char buf[1024];
10407 int i;
10409 for(i = 0; i < s->nb_library_paths; i++) {
10410 snprintf(buf, sizeof(buf), "%s/%s",
10411 s->library_paths[i], filename);
10412 if (tcc_add_file_internal(s, buf, flags) == 0)
10413 return 0;
10415 return -1;
10418 /* the library name is the same as the argument of the '-l' option */
10419 int tcc_add_library(TCCState *s, const char *libraryname)
10421 char buf[1024];
10422 int i;
10424 /* first we look for the dynamic library if not static linking */
10425 if (!s->static_link) {
10426 #ifdef TCC_TARGET_PE
10427 snprintf(buf, sizeof(buf), "%s.def", libraryname);
10428 #else
10429 snprintf(buf, sizeof(buf), "lib%s.so", libraryname);
10430 #endif
10431 if (tcc_add_dll(s, buf, 0) == 0)
10432 return 0;
10435 /* then we look for the static library */
10436 for(i = 0; i < s->nb_library_paths; i++) {
10437 snprintf(buf, sizeof(buf), "%s/lib%s.a",
10438 s->library_paths[i], libraryname);
10439 if (tcc_add_file_internal(s, buf, 0) == 0)
10440 return 0;
10442 return -1;
10445 int tcc_add_symbol(TCCState *s, const char *name, unsigned long val)
10447 add_elf_sym(symtab_section, val, 0,
10448 ELF32_ST_INFO(STB_GLOBAL, STT_NOTYPE), 0,
10449 SHN_ABS, name);
10450 return 0;
10453 int tcc_set_output_type(TCCState *s, int output_type)
10455 char buf[1024];
10457 s->output_type = output_type;
10459 if (!s->nostdinc) {
10460 /* default include paths */
10461 /* XXX: reverse order needed if -isystem support */
10462 #ifndef TCC_TARGET_PE
10463 tcc_add_sysinclude_path(s, "/usr/local/include");
10464 tcc_add_sysinclude_path(s, "/usr/include");
10465 #endif
10466 snprintf(buf, sizeof(buf), "%s/include", tcc_lib_path);
10467 tcc_add_sysinclude_path(s, buf);
10468 #ifdef TCC_TARGET_PE
10469 snprintf(buf, sizeof(buf), "%s/include/winapi", tcc_lib_path);
10470 tcc_add_sysinclude_path(s, buf);
10471 #endif
10474 /* if bound checking, then add corresponding sections */
10475 #ifdef CONFIG_TCC_BCHECK
10476 if (do_bounds_check) {
10477 /* define symbol */
10478 tcc_define_symbol(s, "__BOUNDS_CHECKING_ON", NULL);
10479 /* create bounds sections */
10480 bounds_section = new_section(s, ".bounds",
10481 SHT_PROGBITS, SHF_ALLOC);
10482 lbounds_section = new_section(s, ".lbounds",
10483 SHT_PROGBITS, SHF_ALLOC);
10485 #endif
10487 if (s->char_is_unsigned) {
10488 tcc_define_symbol(s, "__CHAR_UNSIGNED__", NULL);
10491 /* add debug sections */
10492 if (do_debug) {
10493 /* stab symbols */
10494 stab_section = new_section(s, ".stab", SHT_PROGBITS, 0);
10495 stab_section->sh_entsize = sizeof(Stab_Sym);
10496 stabstr_section = new_section(s, ".stabstr", SHT_STRTAB, 0);
10497 put_elf_str(stabstr_section, "");
10498 stab_section->link = stabstr_section;
10499 /* put first entry */
10500 put_stabs("", 0, 0, 0, 0);
10503 /* add libc crt1/crti objects */
10504 #ifndef TCC_TARGET_PE
10505 if ((output_type == TCC_OUTPUT_EXE || output_type == TCC_OUTPUT_DLL) &&
10506 !s->nostdlib) {
10507 if (output_type != TCC_OUTPUT_DLL)
10508 tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crt1.o");
10509 tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crti.o");
10511 #endif
10513 #ifdef TCC_TARGET_PE
10514 snprintf(buf, sizeof(buf), "%s/lib", tcc_lib_path);
10515 tcc_add_library_path(s, buf);
10516 #endif
10518 return 0;
10521 #define WD_ALL 0x0001 /* warning is activated when using -Wall */
10522 #define FD_INVERT 0x0002 /* invert value before storing */
10524 typedef struct FlagDef {
10525 uint16_t offset;
10526 uint16_t flags;
10527 const char *name;
10528 } FlagDef;
10530 static const FlagDef warning_defs[] = {
10531 { offsetof(TCCState, warn_unsupported), 0, "unsupported" },
10532 { offsetof(TCCState, warn_write_strings), 0, "write-strings" },
10533 { offsetof(TCCState, warn_error), 0, "error" },
10534 { offsetof(TCCState, warn_implicit_function_declaration), WD_ALL,
10535 "implicit-function-declaration" },
10538 static int set_flag(TCCState *s, const FlagDef *flags, int nb_flags,
10539 const char *name, int value)
10541 int i;
10542 const FlagDef *p;
10543 const char *r;
10545 r = name;
10546 if (r[0] == 'n' && r[1] == 'o' && r[2] == '-') {
10547 r += 3;
10548 value = !value;
10550 for(i = 0, p = flags; i < nb_flags; i++, p++) {
10551 if (!strcmp(r, p->name))
10552 goto found;
10554 return -1;
10555 found:
10556 if (p->flags & FD_INVERT)
10557 value = !value;
10558 *(int *)((uint8_t *)s + p->offset) = value;
10559 return 0;
10563 /* set/reset a warning */
10564 int tcc_set_warning(TCCState *s, const char *warning_name, int value)
10566 int i;
10567 const FlagDef *p;
10569 if (!strcmp(warning_name, "all")) {
10570 for(i = 0, p = warning_defs; i < countof(warning_defs); i++, p++) {
10571 if (p->flags & WD_ALL)
10572 *(int *)((uint8_t *)s + p->offset) = 1;
10574 return 0;
10575 } else {
10576 return set_flag(s, warning_defs, countof(warning_defs),
10577 warning_name, value);
10581 static const FlagDef flag_defs[] = {
10582 { offsetof(TCCState, char_is_unsigned), 0, "unsigned-char" },
10583 { offsetof(TCCState, char_is_unsigned), FD_INVERT, "signed-char" },
10584 { offsetof(TCCState, nocommon), FD_INVERT, "common" },
10585 { offsetof(TCCState, leading_underscore), 0, "leading-underscore" },
10588 /* set/reset a flag */
10589 int tcc_set_flag(TCCState *s, const char *flag_name, int value)
10591 return set_flag(s, flag_defs, countof(flag_defs),
10592 flag_name, value);
10595 #if !defined(LIBTCC)
10597 static int64_t getclock_us(void)
10599 #ifdef _WIN32
10600 struct _timeb tb;
10601 _ftime(&tb);
10602 return (tb.time * 1000LL + tb.millitm) * 1000LL;
10603 #else
10604 struct timeval tv;
10605 gettimeofday(&tv, NULL);
10606 return tv.tv_sec * 1000000LL + tv.tv_usec;
10607 #endif
10610 void help(void)
10612 printf("tcc version " TCC_VERSION " - Tiny C Compiler - Copyright (C) 2001-2006 Fabrice Bellard\n"
10613 "usage: tcc [-v] [-c] [-o outfile] [-Bdir] [-bench] [-Idir] [-Dsym[=val]] [-Usym]\n"
10614 " [-Wwarn] [-g] [-b] [-bt N] [-Ldir] [-llib] [-shared] [-soname name]\n"
10615 " [-static] [infile1 infile2...] [-run infile args...]\n"
10616 "\n"
10617 "General options:\n"
10618 " -v display current version, increase verbosity\n"
10619 " -c compile only - generate an object file\n"
10620 " -o outfile set output filename\n"
10621 " -Bdir set tcc internal library path\n"
10622 " -bench output compilation statistics\n"
10623 " -run run compiled source\n"
10624 " -fflag set or reset (with 'no-' prefix) 'flag' (see man page)\n"
10625 " -Wwarning set or reset (with 'no-' prefix) 'warning' (see man page)\n"
10626 " -w disable all warnings\n"
10627 "Preprocessor options:\n"
10628 " -E preprocess only\n"
10629 " -Idir add include path 'dir'\n"
10630 " -Dsym[=val] define 'sym' with value 'val'\n"
10631 " -Usym undefine 'sym'\n"
10632 "Linker options:\n"
10633 " -Ldir add library path 'dir'\n"
10634 " -llib link with dynamic or static library 'lib'\n"
10635 " -shared generate a shared library\n"
10636 " -soname set name for shared library to be used at runtime\n"
10637 " -static static linking\n"
10638 " -rdynamic export all global symbols to dynamic linker\n"
10639 " -r generate (relocatable) object file\n"
10640 "Debugger options:\n"
10641 " -g generate runtime debug info\n"
10642 #ifdef CONFIG_TCC_BCHECK
10643 " -b compile with built-in memory and bounds checker (implies -g)\n"
10644 #endif
10645 " -bt N show N callers in stack traces\n"
10649 #define TCC_OPTION_HAS_ARG 0x0001
10650 #define TCC_OPTION_NOSEP 0x0002 /* cannot have space before option and arg */
10652 typedef struct TCCOption {
10653 const char *name;
10654 uint16_t index;
10655 uint16_t flags;
10656 } TCCOption;
10658 enum {
10659 TCC_OPTION_HELP,
10660 TCC_OPTION_I,
10661 TCC_OPTION_D,
10662 TCC_OPTION_U,
10663 TCC_OPTION_L,
10664 TCC_OPTION_B,
10665 TCC_OPTION_l,
10666 TCC_OPTION_bench,
10667 TCC_OPTION_bt,
10668 TCC_OPTION_b,
10669 TCC_OPTION_g,
10670 TCC_OPTION_c,
10671 TCC_OPTION_static,
10672 TCC_OPTION_shared,
10673 TCC_OPTION_soname,
10674 TCC_OPTION_o,
10675 TCC_OPTION_r,
10676 TCC_OPTION_Wl,
10677 TCC_OPTION_W,
10678 TCC_OPTION_O,
10679 TCC_OPTION_m,
10680 TCC_OPTION_f,
10681 TCC_OPTION_nostdinc,
10682 TCC_OPTION_nostdlib,
10683 TCC_OPTION_print_search_dirs,
10684 TCC_OPTION_rdynamic,
10685 TCC_OPTION_run,
10686 TCC_OPTION_v,
10687 TCC_OPTION_w,
10688 TCC_OPTION_pipe,
10689 TCC_OPTION_E,
10692 static const TCCOption tcc_options[] = {
10693 { "h", TCC_OPTION_HELP, 0 },
10694 { "?", TCC_OPTION_HELP, 0 },
10695 { "I", TCC_OPTION_I, TCC_OPTION_HAS_ARG },
10696 { "D", TCC_OPTION_D, TCC_OPTION_HAS_ARG },
10697 { "U", TCC_OPTION_U, TCC_OPTION_HAS_ARG },
10698 { "L", TCC_OPTION_L, TCC_OPTION_HAS_ARG },
10699 { "B", TCC_OPTION_B, TCC_OPTION_HAS_ARG },
10700 { "l", TCC_OPTION_l, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10701 { "bench", TCC_OPTION_bench, 0 },
10702 { "bt", TCC_OPTION_bt, TCC_OPTION_HAS_ARG },
10703 #ifdef CONFIG_TCC_BCHECK
10704 { "b", TCC_OPTION_b, 0 },
10705 #endif
10706 { "g", TCC_OPTION_g, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10707 { "c", TCC_OPTION_c, 0 },
10708 { "static", TCC_OPTION_static, 0 },
10709 { "shared", TCC_OPTION_shared, 0 },
10710 { "soname", TCC_OPTION_soname, TCC_OPTION_HAS_ARG },
10711 { "o", TCC_OPTION_o, TCC_OPTION_HAS_ARG },
10712 { "run", TCC_OPTION_run, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10713 { "rdynamic", TCC_OPTION_rdynamic, 0 },
10714 { "r", TCC_OPTION_r, 0 },
10715 { "Wl,", TCC_OPTION_Wl, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10716 { "W", TCC_OPTION_W, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10717 { "O", TCC_OPTION_O, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10718 { "m", TCC_OPTION_m, TCC_OPTION_HAS_ARG },
10719 { "f", TCC_OPTION_f, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10720 { "nostdinc", TCC_OPTION_nostdinc, 0 },
10721 { "nostdlib", TCC_OPTION_nostdlib, 0 },
10722 { "print-search-dirs", TCC_OPTION_print_search_dirs, 0 },
10723 { "v", TCC_OPTION_v, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10724 { "w", TCC_OPTION_w, 0 },
10725 { "pipe", TCC_OPTION_pipe, 0},
10726 { "E", TCC_OPTION_E, 0},
10727 { NULL },
10730 /* convert 'str' into an array of space separated strings */
10731 static int expand_args(char ***pargv, const char *str)
10733 const char *s1;
10734 char **argv, *arg;
10735 int argc, len;
10737 argc = 0;
10738 argv = NULL;
10739 for(;;) {
10740 while (is_space(*str))
10741 str++;
10742 if (*str == '\0')
10743 break;
10744 s1 = str;
10745 while (*str != '\0' && !is_space(*str))
10746 str++;
10747 len = str - s1;
10748 arg = tcc_malloc(len + 1);
10749 memcpy(arg, s1, len);
10750 arg[len] = '\0';
10751 dynarray_add((void ***)&argv, &argc, arg);
10753 *pargv = argv;
10754 return argc;
10757 static char **files;
10758 static int nb_files, nb_libraries;
10759 static int multiple_files;
10760 static int print_search_dirs;
10761 static int output_type;
10762 static int reloc_output;
10763 static const char *outfile;
10765 int parse_args(TCCState *s, int argc, char **argv)
10767 int optind;
10768 const TCCOption *popt;
10769 const char *optarg, *p1, *r1;
10770 char *r;
10772 optind = 0;
10773 while (optind < argc) {
10775 r = argv[optind++];
10776 if (r[0] != '-' || r[1] == '\0') {
10777 /* add a new file */
10778 dynarray_add((void ***)&files, &nb_files, r);
10779 if (!multiple_files) {
10780 optind--;
10781 /* argv[0] will be this file */
10782 break;
10784 } else {
10785 /* find option in table (match only the first chars */
10786 popt = tcc_options;
10787 for(;;) {
10788 p1 = popt->name;
10789 if (p1 == NULL)
10790 error("invalid option -- '%s'", r);
10791 r1 = r + 1;
10792 for(;;) {
10793 if (*p1 == '\0')
10794 goto option_found;
10795 if (*r1 != *p1)
10796 break;
10797 p1++;
10798 r1++;
10800 popt++;
10802 option_found:
10803 if (popt->flags & TCC_OPTION_HAS_ARG) {
10804 if (*r1 != '\0' || (popt->flags & TCC_OPTION_NOSEP)) {
10805 optarg = r1;
10806 } else {
10807 if (optind >= argc)
10808 error("argument to '%s' is missing", r);
10809 optarg = argv[optind++];
10811 } else {
10812 if (*r1 != '\0')
10813 return 0;
10814 optarg = NULL;
10817 switch(popt->index) {
10818 case TCC_OPTION_HELP:
10819 return 0;
10821 case TCC_OPTION_I:
10822 if (tcc_add_include_path(s, optarg) < 0)
10823 error("too many include paths");
10824 break;
10825 case TCC_OPTION_D:
10827 char *sym, *value;
10828 sym = (char *)optarg;
10829 value = strchr(sym, '=');
10830 if (value) {
10831 *value = '\0';
10832 value++;
10834 tcc_define_symbol(s, sym, value);
10836 break;
10837 case TCC_OPTION_U:
10838 tcc_undefine_symbol(s, optarg);
10839 break;
10840 case TCC_OPTION_L:
10841 tcc_add_library_path(s, optarg);
10842 break;
10843 case TCC_OPTION_B:
10844 /* set tcc utilities path (mainly for tcc development) */
10845 tcc_lib_path = optarg;
10846 break;
10847 case TCC_OPTION_l:
10848 dynarray_add((void ***)&files, &nb_files, r);
10849 nb_libraries++;
10850 break;
10851 case TCC_OPTION_bench:
10852 do_bench = 1;
10853 break;
10854 case TCC_OPTION_bt:
10855 num_callers = atoi(optarg);
10856 break;
10857 #ifdef CONFIG_TCC_BCHECK
10858 case TCC_OPTION_b:
10859 do_bounds_check = 1;
10860 do_debug = 1;
10861 break;
10862 #endif
10863 case TCC_OPTION_g:
10864 do_debug = 1;
10865 break;
10866 case TCC_OPTION_c:
10867 multiple_files = 1;
10868 output_type = TCC_OUTPUT_OBJ;
10869 break;
10870 case TCC_OPTION_static:
10871 s->static_link = 1;
10872 break;
10873 case TCC_OPTION_shared:
10874 output_type = TCC_OUTPUT_DLL;
10875 break;
10876 case TCC_OPTION_soname:
10877 s->soname = optarg;
10878 break;
10879 case TCC_OPTION_o:
10880 multiple_files = 1;
10881 outfile = optarg;
10882 break;
10883 case TCC_OPTION_r:
10884 /* generate a .o merging several output files */
10885 reloc_output = 1;
10886 output_type = TCC_OUTPUT_OBJ;
10887 break;
10888 case TCC_OPTION_nostdinc:
10889 s->nostdinc = 1;
10890 break;
10891 case TCC_OPTION_nostdlib:
10892 s->nostdlib = 1;
10893 break;
10894 case TCC_OPTION_print_search_dirs:
10895 print_search_dirs = 1;
10896 break;
10897 case TCC_OPTION_run:
10899 int argc1;
10900 char **argv1;
10901 argc1 = expand_args(&argv1, optarg);
10902 if (argc1 > 0) {
10903 parse_args(s, argc1, argv1);
10905 multiple_files = 0;
10906 output_type = TCC_OUTPUT_MEMORY;
10908 break;
10909 case TCC_OPTION_v:
10910 do {
10911 if (0 == verbose++)
10912 printf("tcc version %s\n", TCC_VERSION);
10913 } while (*optarg++ == 'v');
10914 break;
10915 case TCC_OPTION_f:
10916 if (tcc_set_flag(s, optarg, 1) < 0 && s->warn_unsupported)
10917 goto unsupported_option;
10918 break;
10919 case TCC_OPTION_W:
10920 if (tcc_set_warning(s, optarg, 1) < 0 &&
10921 s->warn_unsupported)
10922 goto unsupported_option;
10923 break;
10924 case TCC_OPTION_w:
10925 s->warn_none = 1;
10926 break;
10927 case TCC_OPTION_rdynamic:
10928 s->rdynamic = 1;
10929 break;
10930 case TCC_OPTION_Wl:
10932 const char *p;
10933 if (strstart(optarg, "-Ttext,", &p)) {
10934 s->text_addr = strtoul(p, NULL, 16);
10935 s->has_text_addr = 1;
10936 } else if (strstart(optarg, "--oformat,", &p)) {
10937 if (strstart(p, "elf32-", NULL)) {
10938 s->output_format = TCC_OUTPUT_FORMAT_ELF;
10939 } else if (!strcmp(p, "binary")) {
10940 s->output_format = TCC_OUTPUT_FORMAT_BINARY;
10941 } else
10942 #ifdef TCC_TARGET_COFF
10943 if (!strcmp(p, "coff")) {
10944 s->output_format = TCC_OUTPUT_FORMAT_COFF;
10945 } else
10946 #endif
10948 error("target %s not found", p);
10950 } else {
10951 error("unsupported linker option '%s'", optarg);
10954 break;
10955 case TCC_OPTION_E:
10956 output_type = TCC_OUTPUT_PREPROCESS;
10957 break;
10958 default:
10959 if (s->warn_unsupported) {
10960 unsupported_option:
10961 warning("unsupported option '%s'", r);
10963 break;
10967 return optind + 1;
10970 int main(int argc, char **argv)
10972 int i;
10973 TCCState *s;
10974 int nb_objfiles, ret, optind;
10975 char objfilename[1024];
10976 int64_t start_time = 0;
10978 #ifdef _WIN32
10979 tcc_lib_path = w32_tcc_lib_path();
10980 #endif
10982 s = tcc_new();
10983 output_type = TCC_OUTPUT_EXE;
10984 outfile = NULL;
10985 multiple_files = 1;
10986 files = NULL;
10987 nb_files = 0;
10988 nb_libraries = 0;
10989 reloc_output = 0;
10990 print_search_dirs = 0;
10991 ret = 0;
10993 optind = parse_args(s, argc - 1, argv + 1);
10994 if (print_search_dirs) {
10995 /* enough for Linux kernel */
10996 printf("install: %s/\n", tcc_lib_path);
10997 return 0;
10999 if (optind == 0 || nb_files == 0) {
11000 if (optind && verbose)
11001 return 0;
11002 help();
11003 return 1;
11006 nb_objfiles = nb_files - nb_libraries;
11008 /* if outfile provided without other options, we output an
11009 executable */
11010 if (outfile && output_type == TCC_OUTPUT_MEMORY)
11011 output_type = TCC_OUTPUT_EXE;
11013 /* check -c consistency : only single file handled. XXX: checks file type */
11014 if (output_type == TCC_OUTPUT_OBJ && !reloc_output) {
11015 /* accepts only a single input file */
11016 if (nb_objfiles != 1)
11017 error("cannot specify multiple files with -c");
11018 if (nb_libraries != 0)
11019 error("cannot specify libraries with -c");
11023 if (output_type == TCC_OUTPUT_PREPROCESS) {
11024 if (!outfile) {
11025 s->outfile = stdout;
11026 } else {
11027 s->outfile = fopen(outfile, "w");
11028 if (!s->outfile)
11029 error("could not open '%s", outfile);
11031 } else if (output_type != TCC_OUTPUT_MEMORY) {
11032 if (!outfile) {
11033 /* compute default outfile name */
11034 char *ext;
11035 const char *name =
11036 strcmp(files[0], "-") == 0 ? "a" : tcc_basename(files[0]);
11037 pstrcpy(objfilename, sizeof(objfilename), name);
11038 ext = tcc_fileextension(objfilename);
11039 #ifdef TCC_TARGET_PE
11040 if (output_type == TCC_OUTPUT_DLL)
11041 strcpy(ext, ".dll");
11042 else
11043 if (output_type == TCC_OUTPUT_EXE)
11044 strcpy(ext, ".exe");
11045 else
11046 #endif
11047 if (output_type == TCC_OUTPUT_OBJ && !reloc_output && *ext)
11048 strcpy(ext, ".o");
11049 else
11050 pstrcpy(objfilename, sizeof(objfilename), "a.out");
11051 outfile = objfilename;
11055 if (do_bench) {
11056 start_time = getclock_us();
11059 tcc_set_output_type(s, output_type);
11061 /* compile or add each files or library */
11062 for(i = 0; i < nb_files && ret == 0; i++) {
11063 const char *filename;
11065 filename = files[i];
11066 if (output_type == TCC_OUTPUT_PREPROCESS) {
11067 if (tcc_add_file_internal(s, filename,
11068 AFF_PRINT_ERROR | AFF_PREPROCESS) < 0)
11069 ret = 1;
11070 } else if (filename[0] == '-' && filename[1]) {
11071 if (tcc_add_library(s, filename + 2) < 0)
11072 error("cannot find %s", filename);
11073 } else {
11074 if (1 == verbose)
11075 printf("-> %s\n", filename);
11076 if (tcc_add_file(s, filename) < 0)
11077 ret = 1;
11081 /* free all files */
11082 tcc_free(files);
11084 if (ret)
11085 goto the_end;
11087 if (do_bench) {
11088 double total_time;
11089 total_time = (double)(getclock_us() - start_time) / 1000000.0;
11090 if (total_time < 0.001)
11091 total_time = 0.001;
11092 if (total_bytes < 1)
11093 total_bytes = 1;
11094 printf("%d idents, %d lines, %d bytes, %0.3f s, %d lines/s, %0.1f MB/s\n",
11095 tok_ident - TOK_IDENT, total_lines, total_bytes,
11096 total_time, (int)(total_lines / total_time),
11097 total_bytes / total_time / 1000000.0);
11100 if (s->output_type == TCC_OUTPUT_PREPROCESS) {
11101 if (outfile)
11102 fclose(s->outfile);
11103 } else if (s->output_type == TCC_OUTPUT_MEMORY) {
11104 ret = tcc_run(s, argc - optind, argv + optind);
11105 } else
11106 ret = tcc_output_file(s, outfile) ? 1 : 0;
11107 the_end:
11108 /* XXX: cannot do it with bound checking because of the malloc hooks */
11109 if (!do_bounds_check)
11110 tcc_delete(s);
11112 #ifdef MEM_DEBUG
11113 if (do_bench) {
11114 printf("memory: %d bytes, max = %d bytes\n", mem_cur_size, mem_max_size);
11116 #endif
11117 return ret;
11120 #endif