Optimize arithmetic with pointer to value on stack + constant
[tinycc/daniel.git] / tcc.c
blob98d8de6cddd87b2d8ae4c4f2169dc8a4a6c75fe8
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 CONFIG_SYSROOT "/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 rc2 = RC_INT;
4988 if (rc == RC_IRET)
4989 rc2 = RC_LRET;
4990 /* need to reload if:
4991 - constant
4992 - lvalue (need to dereference pointer)
4993 - already a register, but not in the right class */
4994 if (r >= VT_CONST ||
4995 (vtop->r & VT_LVAL) ||
4996 !(reg_classes[r] & rc) ||
4997 ((vtop->type.t & VT_BTYPE) == VT_LLONG &&
4998 !(reg_classes[vtop->r2] & rc2))) {
4999 r = get_reg(rc);
5000 if ((vtop->type.t & VT_BTYPE) == VT_LLONG) {
5001 /* two register type load : expand to two words
5002 temporarily */
5003 if ((vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
5004 /* load constant */
5005 ll = vtop->c.ull;
5006 vtop->c.ui = ll; /* first word */
5007 load(r, vtop);
5008 vtop->r = r; /* save register value */
5009 vpushi(ll >> 32); /* second word */
5010 } else if (r >= VT_CONST || /* XXX: test to VT_CONST incorrect ? */
5011 (vtop->r & VT_LVAL)) {
5012 /* We do not want to modifier the long long
5013 pointer here, so the safest (and less
5014 efficient) is to save all the other registers
5015 in the stack. XXX: totally inefficient. */
5016 save_regs(1);
5017 /* load from memory */
5018 load(r, vtop);
5019 vdup();
5020 vtop[-1].r = r; /* save register value */
5021 /* increment pointer to get second word */
5022 vtop->type.t = VT_INT;
5023 gaddrof();
5024 vpushi(4);
5025 gen_op('+');
5026 vtop->r |= VT_LVAL;
5027 } else {
5028 /* move registers */
5029 load(r, vtop);
5030 vdup();
5031 vtop[-1].r = r; /* save register value */
5032 vtop->r = vtop[-1].r2;
5034 /* allocate second register */
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 unsigned short reg_iret = REG_IRET;
5265 unsigned short reg_lret = REG_LRET;
5266 SValue tmp;
5268 switch(op) {
5269 case '/':
5270 case TOK_PDIV:
5271 func = TOK___divdi3;
5272 goto gen_func;
5273 case TOK_UDIV:
5274 func = TOK___udivdi3;
5275 goto gen_func;
5276 case '%':
5277 func = TOK___moddi3;
5278 goto gen_mod_func;
5279 case TOK_UMOD:
5280 func = TOK___umoddi3;
5281 gen_mod_func:
5282 #ifdef TCC_ARM_EABI
5283 reg_iret = TREG_R2;
5284 reg_lret = TREG_R3;
5285 #endif
5286 gen_func:
5287 /* call generic long long function */
5288 vpush_global_sym(&func_old_type, func);
5289 vrott(3);
5290 gfunc_call(2);
5291 vpushi(0);
5292 vtop->r = reg_iret;
5293 vtop->r2 = reg_lret;
5294 break;
5295 case '^':
5296 case '&':
5297 case '|':
5298 case '*':
5299 case '+':
5300 case '-':
5301 t = vtop->type.t;
5302 vswap();
5303 lexpand();
5304 vrotb(3);
5305 lexpand();
5306 /* stack: L1 H1 L2 H2 */
5307 tmp = vtop[0];
5308 vtop[0] = vtop[-3];
5309 vtop[-3] = tmp;
5310 tmp = vtop[-2];
5311 vtop[-2] = vtop[-3];
5312 vtop[-3] = tmp;
5313 vswap();
5314 /* stack: H1 H2 L1 L2 */
5315 if (op == '*') {
5316 vpushv(vtop - 1);
5317 vpushv(vtop - 1);
5318 gen_op(TOK_UMULL);
5319 lexpand();
5320 /* stack: H1 H2 L1 L2 ML MH */
5321 for(i=0;i<4;i++)
5322 vrotb(6);
5323 /* stack: ML MH H1 H2 L1 L2 */
5324 tmp = vtop[0];
5325 vtop[0] = vtop[-2];
5326 vtop[-2] = tmp;
5327 /* stack: ML MH H1 L2 H2 L1 */
5328 gen_op('*');
5329 vrotb(3);
5330 vrotb(3);
5331 gen_op('*');
5332 /* stack: ML MH M1 M2 */
5333 gen_op('+');
5334 gen_op('+');
5335 } else if (op == '+' || op == '-') {
5336 /* XXX: add non carry method too (for MIPS or alpha) */
5337 if (op == '+')
5338 op1 = TOK_ADDC1;
5339 else
5340 op1 = TOK_SUBC1;
5341 gen_op(op1);
5342 /* stack: H1 H2 (L1 op L2) */
5343 vrotb(3);
5344 vrotb(3);
5345 gen_op(op1 + 1); /* TOK_xxxC2 */
5346 } else {
5347 gen_op(op);
5348 /* stack: H1 H2 (L1 op L2) */
5349 vrotb(3);
5350 vrotb(3);
5351 /* stack: (L1 op L2) H1 H2 */
5352 gen_op(op);
5353 /* stack: (L1 op L2) (H1 op H2) */
5355 /* stack: L H */
5356 lbuild(t);
5357 break;
5358 case TOK_SAR:
5359 case TOK_SHR:
5360 case TOK_SHL:
5361 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
5362 t = vtop[-1].type.t;
5363 vswap();
5364 lexpand();
5365 vrotb(3);
5366 /* stack: L H shift */
5367 c = (int)vtop->c.i;
5368 /* constant: simpler */
5369 /* NOTE: all comments are for SHL. the other cases are
5370 done by swaping words */
5371 vpop();
5372 if (op != TOK_SHL)
5373 vswap();
5374 if (c >= 32) {
5375 /* stack: L H */
5376 vpop();
5377 if (c > 32) {
5378 vpushi(c - 32);
5379 gen_op(op);
5381 if (op != TOK_SAR) {
5382 vpushi(0);
5383 } else {
5384 gv_dup();
5385 vpushi(31);
5386 gen_op(TOK_SAR);
5388 vswap();
5389 } else {
5390 vswap();
5391 gv_dup();
5392 /* stack: H L L */
5393 vpushi(c);
5394 gen_op(op);
5395 vswap();
5396 vpushi(32 - c);
5397 if (op == TOK_SHL)
5398 gen_op(TOK_SHR);
5399 else
5400 gen_op(TOK_SHL);
5401 vrotb(3);
5402 /* stack: L L H */
5403 vpushi(c);
5404 if (op == TOK_SHL)
5405 gen_op(TOK_SHL);
5406 else
5407 gen_op(TOK_SHR);
5408 gen_op('|');
5410 if (op != TOK_SHL)
5411 vswap();
5412 lbuild(t);
5413 } else {
5414 /* XXX: should provide a faster fallback on x86 ? */
5415 switch(op) {
5416 case TOK_SAR:
5417 func = TOK___ashrdi3;
5418 goto gen_func;
5419 case TOK_SHR:
5420 func = TOK___lshrdi3;
5421 goto gen_func;
5422 case TOK_SHL:
5423 func = TOK___ashldi3;
5424 goto gen_func;
5427 break;
5428 default:
5429 /* compare operations */
5430 t = vtop->type.t;
5431 vswap();
5432 lexpand();
5433 vrotb(3);
5434 lexpand();
5435 /* stack: L1 H1 L2 H2 */
5436 tmp = vtop[-1];
5437 vtop[-1] = vtop[-2];
5438 vtop[-2] = tmp;
5439 /* stack: L1 L2 H1 H2 */
5440 /* compare high */
5441 op1 = op;
5442 /* when values are equal, we need to compare low words. since
5443 the jump is inverted, we invert the test too. */
5444 if (op1 == TOK_LT)
5445 op1 = TOK_LE;
5446 else if (op1 == TOK_GT)
5447 op1 = TOK_GE;
5448 else if (op1 == TOK_ULT)
5449 op1 = TOK_ULE;
5450 else if (op1 == TOK_UGT)
5451 op1 = TOK_UGE;
5452 a = 0;
5453 b = 0;
5454 gen_op(op1);
5455 if (op1 != TOK_NE) {
5456 a = gtst(1, 0);
5458 if (op != TOK_EQ) {
5459 /* generate non equal test */
5460 /* XXX: NOT PORTABLE yet */
5461 if (a == 0) {
5462 b = gtst(0, 0);
5463 } else {
5464 #if defined(TCC_TARGET_I386)
5465 b = psym(0x850f, 0);
5466 #elif defined(TCC_TARGET_ARM)
5467 b = ind;
5468 o(0x1A000000 | encbranch(ind, 0, 1));
5469 #elif defined(TCC_TARGET_C67)
5470 error("not implemented");
5471 #else
5472 #error not supported
5473 #endif
5476 /* compare low. Always unsigned */
5477 op1 = op;
5478 if (op1 == TOK_LT)
5479 op1 = TOK_ULT;
5480 else if (op1 == TOK_LE)
5481 op1 = TOK_ULE;
5482 else if (op1 == TOK_GT)
5483 op1 = TOK_UGT;
5484 else if (op1 == TOK_GE)
5485 op1 = TOK_UGE;
5486 gen_op(op1);
5487 a = gtst(1, a);
5488 gsym(b);
5489 vseti(VT_JMPI, a);
5490 break;
5494 /* handle integer constant optimizations and various machine
5495 independent opt */
5496 void gen_opic(int op)
5498 int c1, c2, t1, t2, n;
5499 SValue *v1, *v2;
5500 long long l1, l2;
5501 typedef unsigned long long U;
5503 v1 = vtop - 1;
5504 v2 = vtop;
5505 t1 = v1->type.t & VT_BTYPE;
5506 t2 = v2->type.t & VT_BTYPE;
5507 l1 = (t1 == VT_LLONG) ? v1->c.ll : v1->c.i;
5508 l2 = (t2 == VT_LLONG) ? v2->c.ll : v2->c.i;
5510 /* currently, we cannot do computations with forward symbols */
5511 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5512 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5513 if (c1 && c2) {
5514 switch(op) {
5515 case '+': l1 += l2; break;
5516 case '-': l1 -= l2; break;
5517 case '&': l1 &= l2; break;
5518 case '^': l1 ^= l2; break;
5519 case '|': l1 |= l2; break;
5520 case '*': l1 *= l2; break;
5522 case TOK_PDIV:
5523 case '/':
5524 case '%':
5525 case TOK_UDIV:
5526 case TOK_UMOD:
5527 /* if division by zero, generate explicit division */
5528 if (l2 == 0) {
5529 if (const_wanted)
5530 error("division by zero in constant");
5531 goto general_case;
5533 switch(op) {
5534 default: l1 /= l2; break;
5535 case '%': l1 %= l2; break;
5536 case TOK_UDIV: l1 = (U)l1 / l2; break;
5537 case TOK_UMOD: l1 = (U)l1 % l2; break;
5539 break;
5540 case TOK_SHL: l1 <<= l2; break;
5541 case TOK_SHR: l1 = (U)l1 >> l2; break;
5542 case TOK_SAR: l1 >>= l2; break;
5543 /* tests */
5544 case TOK_ULT: l1 = (U)l1 < (U)l2; break;
5545 case TOK_UGE: l1 = (U)l1 >= (U)l2; break;
5546 case TOK_EQ: l1 = l1 == l2; break;
5547 case TOK_NE: l1 = l1 != l2; break;
5548 case TOK_ULE: l1 = (U)l1 <= (U)l2; break;
5549 case TOK_UGT: l1 = (U)l1 > (U)l2; break;
5550 case TOK_LT: l1 = l1 < l2; break;
5551 case TOK_GE: l1 = l1 >= l2; break;
5552 case TOK_LE: l1 = l1 <= l2; break;
5553 case TOK_GT: l1 = l1 > l2; break;
5554 /* logical */
5555 case TOK_LAND: l1 = l1 && l2; break;
5556 case TOK_LOR: l1 = l1 || l2; break;
5557 default:
5558 goto general_case;
5560 v1->c.ll = l1;
5561 vtop--;
5562 } else {
5563 /* if commutative ops, put c2 as constant */
5564 if (c1 && (op == '+' || op == '&' || op == '^' ||
5565 op == '|' || op == '*')) {
5566 vswap();
5567 c2 = c1; //c = c1, c1 = c2, c2 = c;
5568 l2 = l1; //l = l1, l1 = l2, l2 = l;
5570 /* Filter out NOP operations like x*1, x-0, x&-1... */
5571 if (c2 && (((op == '*' || op == '/' || op == TOK_UDIV ||
5572 op == TOK_PDIV) &&
5573 l2 == 1) ||
5574 ((op == '+' || op == '-' || op == '|' || op == '^' ||
5575 op == TOK_SHL || op == TOK_SHR || op == TOK_SAR) &&
5576 l2 == 0) ||
5577 (op == '&' &&
5578 l2 == -1))) {
5579 /* nothing to do */
5580 vtop--;
5581 } else if (c2 && (op == '*' || op == TOK_PDIV || op == TOK_UDIV)) {
5582 /* try to use shifts instead of muls or divs */
5583 if (l2 > 0 && (l2 & (l2 - 1)) == 0) {
5584 n = -1;
5585 while (l2) {
5586 l2 >>= 1;
5587 n++;
5589 vtop->c.ll = n;
5590 if (op == '*')
5591 op = TOK_SHL;
5592 else if (op == TOK_PDIV)
5593 op = TOK_SAR;
5594 else
5595 op = TOK_SHR;
5597 goto general_case;
5598 } else if (c2 && (op == '+' || op == '-') &&
5599 ((vtop[-1].r & (VT_VALMASK | VT_LVAL | VT_SYM)) ==
5600 (VT_CONST | VT_SYM) ||
5601 (vtop[-1].r & (VT_VALMASK | VT_LVAL)) == VT_LOCAL)) {
5602 /* symbol + constant case */
5603 if (op == '-')
5604 l2 = -l2;
5605 vtop--;
5606 vtop->c.ll += l2;
5607 } else {
5608 general_case:
5609 if (!nocode_wanted) {
5610 /* call low level op generator */
5611 if (t1 == VT_LLONG || t2 == VT_LLONG)
5612 gen_opl(op);
5613 else
5614 gen_opi(op);
5615 } else {
5616 vtop--;
5622 /* generate a floating point operation with constant propagation */
5623 void gen_opif(int op)
5625 int c1, c2;
5626 SValue *v1, *v2;
5627 long double f1, f2;
5629 v1 = vtop - 1;
5630 v2 = vtop;
5631 /* currently, we cannot do computations with forward symbols */
5632 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5633 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5634 if (c1 && c2) {
5635 if (v1->type.t == VT_FLOAT) {
5636 f1 = v1->c.f;
5637 f2 = v2->c.f;
5638 } else if (v1->type.t == VT_DOUBLE) {
5639 f1 = v1->c.d;
5640 f2 = v2->c.d;
5641 } else {
5642 f1 = v1->c.ld;
5643 f2 = v2->c.ld;
5646 /* NOTE: we only do constant propagation if finite number (not
5647 NaN or infinity) (ANSI spec) */
5648 if (!ieee_finite(f1) || !ieee_finite(f2))
5649 goto general_case;
5651 switch(op) {
5652 case '+': f1 += f2; break;
5653 case '-': f1 -= f2; break;
5654 case '*': f1 *= f2; break;
5655 case '/':
5656 if (f2 == 0.0) {
5657 if (const_wanted)
5658 error("division by zero in constant");
5659 goto general_case;
5661 f1 /= f2;
5662 break;
5663 /* XXX: also handles tests ? */
5664 default:
5665 goto general_case;
5667 /* XXX: overflow test ? */
5668 if (v1->type.t == VT_FLOAT) {
5669 v1->c.f = f1;
5670 } else if (v1->type.t == VT_DOUBLE) {
5671 v1->c.d = f1;
5672 } else {
5673 v1->c.ld = f1;
5675 vtop--;
5676 } else {
5677 general_case:
5678 if (!nocode_wanted) {
5679 gen_opf(op);
5680 } else {
5681 vtop--;
5686 static int pointed_size(CType *type)
5688 int align;
5689 return type_size(pointed_type(type), &align);
5692 static inline int is_null_pointer(SValue *p)
5694 if ((p->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
5695 return 0;
5696 return ((p->type.t & VT_BTYPE) == VT_INT && p->c.i == 0) ||
5697 ((p->type.t & VT_BTYPE) == VT_LLONG && p->c.ll == 0);
5700 static inline int is_integer_btype(int bt)
5702 return (bt == VT_BYTE || bt == VT_SHORT ||
5703 bt == VT_INT || bt == VT_LLONG);
5706 /* check types for comparison or substraction of pointers */
5707 static void check_comparison_pointer_types(SValue *p1, SValue *p2, int op)
5709 CType *type1, *type2, tmp_type1, tmp_type2;
5710 int bt1, bt2;
5712 /* null pointers are accepted for all comparisons as gcc */
5713 if (is_null_pointer(p1) || is_null_pointer(p2))
5714 return;
5715 type1 = &p1->type;
5716 type2 = &p2->type;
5717 bt1 = type1->t & VT_BTYPE;
5718 bt2 = type2->t & VT_BTYPE;
5719 /* accept comparison between pointer and integer with a warning */
5720 if ((is_integer_btype(bt1) || is_integer_btype(bt2)) && op != '-') {
5721 if (op != TOK_LOR && op != TOK_LAND )
5722 warning("comparison between pointer and integer");
5723 return;
5726 /* both must be pointers or implicit function pointers */
5727 if (bt1 == VT_PTR) {
5728 type1 = pointed_type(type1);
5729 } else if (bt1 != VT_FUNC)
5730 goto invalid_operands;
5732 if (bt2 == VT_PTR) {
5733 type2 = pointed_type(type2);
5734 } else if (bt2 != VT_FUNC) {
5735 invalid_operands:
5736 error("invalid operands to binary %s", get_tok_str(op, NULL));
5738 if ((type1->t & VT_BTYPE) == VT_VOID ||
5739 (type2->t & VT_BTYPE) == VT_VOID)
5740 return;
5741 tmp_type1 = *type1;
5742 tmp_type2 = *type2;
5743 tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
5744 tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
5745 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
5746 /* gcc-like error if '-' is used */
5747 if (op == '-')
5748 goto invalid_operands;
5749 else
5750 warning("comparison of distinct pointer types lacks a cast");
5754 /* generic gen_op: handles types problems */
5755 void gen_op(int op)
5757 int u, t1, t2, bt1, bt2, t;
5758 CType type1;
5760 t1 = vtop[-1].type.t;
5761 t2 = vtop[0].type.t;
5762 bt1 = t1 & VT_BTYPE;
5763 bt2 = t2 & VT_BTYPE;
5765 if (bt1 == VT_PTR || bt2 == VT_PTR) {
5766 /* at least one operand is a pointer */
5767 /* relationnal op: must be both pointers */
5768 if (op >= TOK_ULT && op <= TOK_LOR) {
5769 check_comparison_pointer_types(vtop - 1, vtop, op);
5770 /* pointers are handled are unsigned */
5771 t = VT_INT | VT_UNSIGNED;
5772 goto std_op;
5774 /* if both pointers, then it must be the '-' op */
5775 if (bt1 == VT_PTR && bt2 == VT_PTR) {
5776 if (op != '-')
5777 error("cannot use pointers here");
5778 check_comparison_pointer_types(vtop - 1, vtop, op);
5779 /* XXX: check that types are compatible */
5780 u = pointed_size(&vtop[-1].type);
5781 gen_opic(op);
5782 /* set to integer type */
5783 vtop->type.t = VT_INT;
5784 vpushi(u);
5785 gen_op(TOK_PDIV);
5786 } else {
5787 /* exactly one pointer : must be '+' or '-'. */
5788 if (op != '-' && op != '+')
5789 error("cannot use pointers here");
5790 /* Put pointer as first operand */
5791 if (bt2 == VT_PTR) {
5792 vswap();
5793 swap(&t1, &t2);
5795 type1 = vtop[-1].type;
5796 /* XXX: cast to int ? (long long case) */
5797 vpushi(pointed_size(&vtop[-1].type));
5798 gen_op('*');
5799 #ifdef CONFIG_TCC_BCHECK
5800 /* if evaluating constant expression, no code should be
5801 generated, so no bound check */
5802 if (do_bounds_check && !const_wanted) {
5803 /* if bounded pointers, we generate a special code to
5804 test bounds */
5805 if (op == '-') {
5806 vpushi(0);
5807 vswap();
5808 gen_op('-');
5810 gen_bounded_ptr_add();
5811 } else
5812 #endif
5814 gen_opic(op);
5816 /* put again type if gen_opic() swaped operands */
5817 vtop->type = type1;
5819 } else if (is_float(bt1) || is_float(bt2)) {
5820 /* compute bigger type and do implicit casts */
5821 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
5822 t = VT_LDOUBLE;
5823 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
5824 t = VT_DOUBLE;
5825 } else {
5826 t = VT_FLOAT;
5828 /* floats can only be used for a few operations */
5829 if (op != '+' && op != '-' && op != '*' && op != '/' &&
5830 (op < TOK_ULT || op > TOK_GT))
5831 error("invalid operands for binary operation");
5832 goto std_op;
5833 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
5834 /* cast to biggest op */
5835 t = VT_LLONG;
5836 /* convert to unsigned if it does not fit in a long long */
5837 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
5838 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
5839 t |= VT_UNSIGNED;
5840 goto std_op;
5841 } else {
5842 /* integer operations */
5843 t = VT_INT;
5844 /* convert to unsigned if it does not fit in an integer */
5845 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
5846 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
5847 t |= VT_UNSIGNED;
5848 std_op:
5849 /* XXX: currently, some unsigned operations are explicit, so
5850 we modify them here */
5851 if (t & VT_UNSIGNED) {
5852 if (op == TOK_SAR)
5853 op = TOK_SHR;
5854 else if (op == '/')
5855 op = TOK_UDIV;
5856 else if (op == '%')
5857 op = TOK_UMOD;
5858 else if (op == TOK_LT)
5859 op = TOK_ULT;
5860 else if (op == TOK_GT)
5861 op = TOK_UGT;
5862 else if (op == TOK_LE)
5863 op = TOK_ULE;
5864 else if (op == TOK_GE)
5865 op = TOK_UGE;
5867 vswap();
5868 type1.t = t;
5869 gen_cast(&type1);
5870 vswap();
5871 /* special case for shifts and long long: we keep the shift as
5872 an integer */
5873 if (op == TOK_SHR || op == TOK_SAR || op == TOK_SHL)
5874 type1.t = VT_INT;
5875 gen_cast(&type1);
5876 if (is_float(t))
5877 gen_opif(op);
5878 else
5879 gen_opic(op);
5880 if (op >= TOK_ULT && op <= TOK_GT) {
5881 /* relationnal op: the result is an int */
5882 vtop->type.t = VT_INT;
5883 } else {
5884 vtop->type.t = t;
5889 #ifndef TCC_TARGET_ARM
5890 /* generic itof for unsigned long long case */
5891 void gen_cvt_itof1(int t)
5893 if ((vtop->type.t & (VT_BTYPE | VT_UNSIGNED)) ==
5894 (VT_LLONG | VT_UNSIGNED)) {
5896 if (t == VT_FLOAT)
5897 vpush_global_sym(&func_old_type, TOK___floatundisf);
5898 #if LDOUBLE_SIZE != 8
5899 else if (t == VT_LDOUBLE)
5900 vpush_global_sym(&func_old_type, TOK___floatundixf);
5901 #endif
5902 else
5903 vpush_global_sym(&func_old_type, TOK___floatundidf);
5904 vrott(2);
5905 gfunc_call(1);
5906 vpushi(0);
5907 vtop->r = REG_FRET;
5908 } else {
5909 gen_cvt_itof(t);
5912 #endif
5914 /* generic ftoi for unsigned long long case */
5915 void gen_cvt_ftoi1(int t)
5917 int st;
5919 if (t == (VT_LLONG | VT_UNSIGNED)) {
5920 /* not handled natively */
5921 st = vtop->type.t & VT_BTYPE;
5922 if (st == VT_FLOAT)
5923 vpush_global_sym(&func_old_type, TOK___fixunssfdi);
5924 #if LDOUBLE_SIZE != 8
5925 else if (st == VT_LDOUBLE)
5926 vpush_global_sym(&func_old_type, TOK___fixunsxfdi);
5927 #endif
5928 else
5929 vpush_global_sym(&func_old_type, TOK___fixunsdfdi);
5930 vrott(2);
5931 gfunc_call(1);
5932 vpushi(0);
5933 vtop->r = REG_IRET;
5934 vtop->r2 = REG_LRET;
5935 } else {
5936 gen_cvt_ftoi(t);
5940 /* force char or short cast */
5941 void force_charshort_cast(int t)
5943 int bits, dbt;
5944 dbt = t & VT_BTYPE;
5945 /* XXX: add optimization if lvalue : just change type and offset */
5946 if (dbt == VT_BYTE)
5947 bits = 8;
5948 else
5949 bits = 16;
5950 if (t & VT_UNSIGNED) {
5951 vpushi((1 << bits) - 1);
5952 gen_op('&');
5953 } else {
5954 bits = 32 - bits;
5955 vpushi(bits);
5956 gen_op(TOK_SHL);
5957 /* result must be signed or the SAR is converted to an SHL
5958 This was not the case when "t" was a signed short
5959 and the last value on the stack was an unsigned int */
5960 vtop->type.t &= ~VT_UNSIGNED;
5961 vpushi(bits);
5962 gen_op(TOK_SAR);
5966 /* cast 'vtop' to 'type'. Casting to bitfields is forbidden. */
5967 static void gen_cast(CType *type)
5969 int sbt, dbt, sf, df, c;
5971 /* special delayed cast for char/short */
5972 /* XXX: in some cases (multiple cascaded casts), it may still
5973 be incorrect */
5974 if (vtop->r & VT_MUSTCAST) {
5975 vtop->r &= ~VT_MUSTCAST;
5976 force_charshort_cast(vtop->type.t);
5979 /* bitfields first get cast to ints */
5980 if (vtop->type.t & VT_BITFIELD) {
5981 gv(RC_INT);
5984 dbt = type->t & (VT_BTYPE | VT_UNSIGNED);
5985 sbt = vtop->type.t & (VT_BTYPE | VT_UNSIGNED);
5987 if (sbt != dbt && !nocode_wanted) {
5988 sf = is_float(sbt);
5989 df = is_float(dbt);
5990 c = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5991 if (sf && df) {
5992 /* convert from fp to fp */
5993 if (c) {
5994 /* constant case: we can do it now */
5995 /* XXX: in ISOC, cannot do it if error in convert */
5996 if (dbt == VT_FLOAT && sbt == VT_DOUBLE)
5997 vtop->c.f = (float)vtop->c.d;
5998 else if (dbt == VT_FLOAT && sbt == VT_LDOUBLE)
5999 vtop->c.f = (float)vtop->c.ld;
6000 else if (dbt == VT_DOUBLE && sbt == VT_FLOAT)
6001 vtop->c.d = (double)vtop->c.f;
6002 else if (dbt == VT_DOUBLE && sbt == VT_LDOUBLE)
6003 vtop->c.d = (double)vtop->c.ld;
6004 else if (dbt == VT_LDOUBLE && sbt == VT_FLOAT)
6005 vtop->c.ld = (long double)vtop->c.f;
6006 else if (dbt == VT_LDOUBLE && sbt == VT_DOUBLE)
6007 vtop->c.ld = (long double)vtop->c.d;
6008 } else {
6009 /* non constant case: generate code */
6010 gen_cvt_ftof(dbt);
6012 } else if (df) {
6013 /* convert int to fp */
6014 if (c) {
6015 switch(sbt) {
6016 case VT_LLONG | VT_UNSIGNED:
6017 case VT_LLONG:
6018 /* XXX: add const cases for long long */
6019 goto do_itof;
6020 case VT_INT | VT_UNSIGNED:
6021 switch(dbt) {
6022 case VT_FLOAT: vtop->c.f = (float)vtop->c.ui; break;
6023 case VT_DOUBLE: vtop->c.d = (double)vtop->c.ui; break;
6024 case VT_LDOUBLE: vtop->c.ld = (long double)vtop->c.ui; break;
6026 break;
6027 default:
6028 switch(dbt) {
6029 case VT_FLOAT: vtop->c.f = (float)vtop->c.i; break;
6030 case VT_DOUBLE: vtop->c.d = (double)vtop->c.i; break;
6031 case VT_LDOUBLE: vtop->c.ld = (long double)vtop->c.i; break;
6033 break;
6035 } else {
6036 do_itof:
6037 gen_cvt_itof1(dbt);
6039 } else if (sf) {
6040 /* convert fp to int */
6041 if (dbt == VT_BOOL) {
6042 vpushi(0);
6043 gen_op(TOK_NE);
6044 } else {
6045 /* we handle char/short/etc... with generic code */
6046 if (dbt != (VT_INT | VT_UNSIGNED) &&
6047 dbt != (VT_LLONG | VT_UNSIGNED) &&
6048 dbt != VT_LLONG)
6049 dbt = VT_INT;
6050 if (c) {
6051 switch(dbt) {
6052 case VT_LLONG | VT_UNSIGNED:
6053 case VT_LLONG:
6054 /* XXX: add const cases for long long */
6055 goto do_ftoi;
6056 case VT_INT | VT_UNSIGNED:
6057 switch(sbt) {
6058 case VT_FLOAT: vtop->c.ui = (unsigned int)vtop->c.d; break;
6059 case VT_DOUBLE: vtop->c.ui = (unsigned int)vtop->c.d; break;
6060 case VT_LDOUBLE: vtop->c.ui = (unsigned int)vtop->c.d; break;
6062 break;
6063 default:
6064 /* int case */
6065 switch(sbt) {
6066 case VT_FLOAT: vtop->c.i = (int)vtop->c.d; break;
6067 case VT_DOUBLE: vtop->c.i = (int)vtop->c.d; break;
6068 case VT_LDOUBLE: vtop->c.i = (int)vtop->c.d; break;
6070 break;
6072 } else {
6073 do_ftoi:
6074 gen_cvt_ftoi1(dbt);
6076 if (dbt == VT_INT && (type->t & (VT_BTYPE | VT_UNSIGNED)) != dbt) {
6077 /* additional cast for char/short... */
6078 vtop->type.t = dbt;
6079 gen_cast(type);
6082 } else if ((dbt & VT_BTYPE) == VT_LLONG) {
6083 if ((sbt & VT_BTYPE) != VT_LLONG) {
6084 /* scalar to long long */
6085 if (c) {
6086 if (sbt == (VT_INT | VT_UNSIGNED))
6087 vtop->c.ll = vtop->c.ui;
6088 else
6089 vtop->c.ll = vtop->c.i;
6090 } else {
6091 /* machine independent conversion */
6092 gv(RC_INT);
6093 /* generate high word */
6094 if (sbt == (VT_INT | VT_UNSIGNED)) {
6095 vpushi(0);
6096 gv(RC_INT);
6097 } else {
6098 gv_dup();
6099 vpushi(31);
6100 gen_op(TOK_SAR);
6102 /* patch second register */
6103 vtop[-1].r2 = vtop->r;
6104 vpop();
6107 } else if (dbt == VT_BOOL) {
6108 /* scalar to bool */
6109 vpushi(0);
6110 gen_op(TOK_NE);
6111 } else if ((dbt & VT_BTYPE) == VT_BYTE ||
6112 (dbt & VT_BTYPE) == VT_SHORT) {
6113 if (sbt == VT_PTR) {
6114 vtop->type.t = VT_INT;
6115 warning("nonportable conversion from pointer to char/short");
6117 force_charshort_cast(dbt);
6118 } else if ((dbt & VT_BTYPE) == VT_INT) {
6119 /* scalar to int */
6120 if (sbt == VT_LLONG) {
6121 /* from long long: just take low order word */
6122 lexpand();
6123 vpop();
6125 /* if lvalue and single word type, nothing to do because
6126 the lvalue already contains the real type size (see
6127 VT_LVAL_xxx constants) */
6129 } else if ((dbt & VT_BTYPE) == VT_PTR && !(vtop->r & VT_LVAL)) {
6130 /* if we are casting between pointer types,
6131 we must update the VT_LVAL_xxx size */
6132 vtop->r = (vtop->r & ~VT_LVAL_TYPE)
6133 | (lvalue_type(type->ref->type.t) & VT_LVAL_TYPE);
6135 vtop->type = *type;
6138 /* return type size. Put alignment at 'a' */
6139 static int type_size(CType *type, int *a)
6141 Sym *s;
6142 int bt;
6144 bt = type->t & VT_BTYPE;
6145 if (bt == VT_STRUCT) {
6146 /* struct/union */
6147 s = type->ref;
6148 *a = s->r;
6149 return s->c;
6150 } else if (bt == VT_PTR) {
6151 if (type->t & VT_ARRAY) {
6152 s = type->ref;
6153 return type_size(&s->type, a) * s->c;
6154 } else {
6155 *a = PTR_SIZE;
6156 return PTR_SIZE;
6158 } else if (bt == VT_LDOUBLE) {
6159 *a = LDOUBLE_ALIGN;
6160 return LDOUBLE_SIZE;
6161 } else if (bt == VT_DOUBLE || bt == VT_LLONG) {
6162 #ifdef TCC_TARGET_I386
6163 *a = 4;
6164 #elif defined(TCC_TARGET_ARM)
6165 #ifdef TCC_ARM_EABI
6166 *a = 8;
6167 #else
6168 *a = 4;
6169 #endif
6170 #else
6171 *a = 8;
6172 #endif
6173 return 8;
6174 } else if (bt == VT_INT || bt == VT_ENUM || bt == VT_FLOAT) {
6175 *a = 4;
6176 return 4;
6177 } else if (bt == VT_SHORT) {
6178 *a = 2;
6179 return 2;
6180 } else {
6181 /* char, void, function, _Bool */
6182 *a = 1;
6183 return 1;
6187 /* return the pointed type of t */
6188 static inline CType *pointed_type(CType *type)
6190 return &type->ref->type;
6193 /* modify type so that its it is a pointer to type. */
6194 static void mk_pointer(CType *type)
6196 Sym *s;
6197 s = sym_push(SYM_FIELD, type, 0, -1);
6198 type->t = VT_PTR | (type->t & ~VT_TYPE);
6199 type->ref = s;
6202 /* compare function types. OLD functions match any new functions */
6203 static int is_compatible_func(CType *type1, CType *type2)
6205 Sym *s1, *s2;
6207 s1 = type1->ref;
6208 s2 = type2->ref;
6209 if (!is_compatible_types(&s1->type, &s2->type))
6210 return 0;
6211 /* check func_call */
6212 if (FUNC_CALL(s1->r) != FUNC_CALL(s2->r))
6213 return 0;
6214 /* XXX: not complete */
6215 if (s1->c == FUNC_OLD || s2->c == FUNC_OLD)
6216 return 1;
6217 if (s1->c != s2->c)
6218 return 0;
6219 while (s1 != NULL) {
6220 if (s2 == NULL)
6221 return 0;
6222 if (!is_compatible_parameter_types(&s1->type, &s2->type))
6223 return 0;
6224 s1 = s1->next;
6225 s2 = s2->next;
6227 if (s2)
6228 return 0;
6229 return 1;
6232 /* return true if type1 and type2 are the same. If unqualified is
6233 true, qualifiers on the types are ignored.
6235 - enums are not checked as gcc __builtin_types_compatible_p ()
6237 static int compare_types(CType *type1, CType *type2, int unqualified)
6239 int bt1, t1, t2;
6241 t1 = type1->t & VT_TYPE;
6242 t2 = type2->t & VT_TYPE;
6243 if (unqualified) {
6244 /* strip qualifiers before comparing */
6245 t1 &= ~(VT_CONSTANT | VT_VOLATILE);
6246 t2 &= ~(VT_CONSTANT | VT_VOLATILE);
6248 /* XXX: bitfields ? */
6249 if (t1 != t2)
6250 return 0;
6251 /* test more complicated cases */
6252 bt1 = t1 & VT_BTYPE;
6253 if (bt1 == VT_PTR) {
6254 type1 = pointed_type(type1);
6255 type2 = pointed_type(type2);
6256 return is_compatible_types(type1, type2);
6257 } else if (bt1 == VT_STRUCT) {
6258 return (type1->ref == type2->ref);
6259 } else if (bt1 == VT_FUNC) {
6260 return is_compatible_func(type1, type2);
6261 } else {
6262 return 1;
6266 /* return true if type1 and type2 are exactly the same (including
6267 qualifiers).
6269 static int is_compatible_types(CType *type1, CType *type2)
6271 return compare_types(type1,type2,0);
6274 /* return true if type1 and type2 are the same (ignoring qualifiers).
6276 static int is_compatible_parameter_types(CType *type1, CType *type2)
6278 return compare_types(type1,type2,1);
6281 /* print a type. If 'varstr' is not NULL, then the variable is also
6282 printed in the type */
6283 /* XXX: union */
6284 /* XXX: add array and function pointers */
6285 void type_to_str(char *buf, int buf_size,
6286 CType *type, const char *varstr)
6288 int bt, v, t;
6289 Sym *s, *sa;
6290 char buf1[256];
6291 const char *tstr;
6293 t = type->t & VT_TYPE;
6294 bt = t & VT_BTYPE;
6295 buf[0] = '\0';
6296 if (t & VT_CONSTANT)
6297 pstrcat(buf, buf_size, "const ");
6298 if (t & VT_VOLATILE)
6299 pstrcat(buf, buf_size, "volatile ");
6300 if (t & VT_UNSIGNED)
6301 pstrcat(buf, buf_size, "unsigned ");
6302 switch(bt) {
6303 case VT_VOID:
6304 tstr = "void";
6305 goto add_tstr;
6306 case VT_BOOL:
6307 tstr = "_Bool";
6308 goto add_tstr;
6309 case VT_BYTE:
6310 tstr = "char";
6311 goto add_tstr;
6312 case VT_SHORT:
6313 tstr = "short";
6314 goto add_tstr;
6315 case VT_INT:
6316 tstr = "int";
6317 goto add_tstr;
6318 case VT_LONG:
6319 tstr = "long";
6320 goto add_tstr;
6321 case VT_LLONG:
6322 tstr = "long long";
6323 goto add_tstr;
6324 case VT_FLOAT:
6325 tstr = "float";
6326 goto add_tstr;
6327 case VT_DOUBLE:
6328 tstr = "double";
6329 goto add_tstr;
6330 case VT_LDOUBLE:
6331 tstr = "long double";
6332 add_tstr:
6333 pstrcat(buf, buf_size, tstr);
6334 break;
6335 case VT_ENUM:
6336 case VT_STRUCT:
6337 if (bt == VT_STRUCT)
6338 tstr = "struct ";
6339 else
6340 tstr = "enum ";
6341 pstrcat(buf, buf_size, tstr);
6342 v = type->ref->v & ~SYM_STRUCT;
6343 if (v >= SYM_FIRST_ANOM)
6344 pstrcat(buf, buf_size, "<anonymous>");
6345 else
6346 pstrcat(buf, buf_size, get_tok_str(v, NULL));
6347 break;
6348 case VT_FUNC:
6349 s = type->ref;
6350 type_to_str(buf, buf_size, &s->type, varstr);
6351 pstrcat(buf, buf_size, "(");
6352 sa = s->next;
6353 while (sa != NULL) {
6354 type_to_str(buf1, sizeof(buf1), &sa->type, NULL);
6355 pstrcat(buf, buf_size, buf1);
6356 sa = sa->next;
6357 if (sa)
6358 pstrcat(buf, buf_size, ", ");
6360 pstrcat(buf, buf_size, ")");
6361 goto no_var;
6362 case VT_PTR:
6363 s = type->ref;
6364 pstrcpy(buf1, sizeof(buf1), "*");
6365 if (varstr)
6366 pstrcat(buf1, sizeof(buf1), varstr);
6367 type_to_str(buf, buf_size, &s->type, buf1);
6368 goto no_var;
6370 if (varstr) {
6371 pstrcat(buf, buf_size, " ");
6372 pstrcat(buf, buf_size, varstr);
6374 no_var: ;
6377 /* verify type compatibility to store vtop in 'dt' type, and generate
6378 casts if needed. */
6379 static void gen_assign_cast(CType *dt)
6381 CType *st, *type1, *type2, tmp_type1, tmp_type2;
6382 char buf1[256], buf2[256];
6383 int dbt, sbt;
6385 st = &vtop->type; /* source type */
6386 dbt = dt->t & VT_BTYPE;
6387 sbt = st->t & VT_BTYPE;
6388 if (dt->t & VT_CONSTANT)
6389 warning("assignment of read-only location");
6390 switch(dbt) {
6391 case VT_PTR:
6392 /* special cases for pointers */
6393 /* '0' can also be a pointer */
6394 if (is_null_pointer(vtop))
6395 goto type_ok;
6396 /* accept implicit pointer to integer cast with warning */
6397 if (is_integer_btype(sbt)) {
6398 warning("assignment makes pointer from integer without a cast");
6399 goto type_ok;
6401 type1 = pointed_type(dt);
6402 /* a function is implicitely a function pointer */
6403 if (sbt == VT_FUNC) {
6404 if ((type1->t & VT_BTYPE) != VT_VOID &&
6405 !is_compatible_types(pointed_type(dt), st))
6406 goto error;
6407 else
6408 goto type_ok;
6410 if (sbt != VT_PTR)
6411 goto error;
6412 type2 = pointed_type(st);
6413 if ((type1->t & VT_BTYPE) == VT_VOID ||
6414 (type2->t & VT_BTYPE) == VT_VOID) {
6415 /* void * can match anything */
6416 } else {
6417 /* exact type match, except for unsigned */
6418 tmp_type1 = *type1;
6419 tmp_type2 = *type2;
6420 tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
6421 tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
6422 if (!is_compatible_types(&tmp_type1, &tmp_type2))
6423 warning("assignment from incompatible pointer type");
6425 /* check const and volatile */
6426 if ((!(type1->t & VT_CONSTANT) && (type2->t & VT_CONSTANT)) ||
6427 (!(type1->t & VT_VOLATILE) && (type2->t & VT_VOLATILE)))
6428 warning("assignment discards qualifiers from pointer target type");
6429 break;
6430 case VT_BYTE:
6431 case VT_SHORT:
6432 case VT_INT:
6433 case VT_LLONG:
6434 if (sbt == VT_PTR || sbt == VT_FUNC) {
6435 warning("assignment makes integer from pointer without a cast");
6437 /* XXX: more tests */
6438 break;
6439 case VT_STRUCT:
6440 tmp_type1 = *dt;
6441 tmp_type2 = *st;
6442 tmp_type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
6443 tmp_type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
6444 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
6445 error:
6446 type_to_str(buf1, sizeof(buf1), st, NULL);
6447 type_to_str(buf2, sizeof(buf2), dt, NULL);
6448 error("cannot cast '%s' to '%s'", buf1, buf2);
6450 break;
6452 type_ok:
6453 gen_cast(dt);
6456 /* store vtop in lvalue pushed on stack */
6457 void vstore(void)
6459 int sbt, dbt, ft, r, t, size, align, bit_size, bit_pos, rc, delayed_cast;
6461 ft = vtop[-1].type.t;
6462 sbt = vtop->type.t & VT_BTYPE;
6463 dbt = ft & VT_BTYPE;
6464 if (((sbt == VT_INT || sbt == VT_SHORT) && dbt == VT_BYTE) ||
6465 (sbt == VT_INT && dbt == VT_SHORT)) {
6466 /* optimize char/short casts */
6467 delayed_cast = VT_MUSTCAST;
6468 vtop->type.t = ft & VT_TYPE;
6469 /* XXX: factorize */
6470 if (ft & VT_CONSTANT)
6471 warning("assignment of read-only location");
6472 } else {
6473 delayed_cast = 0;
6474 if (!(ft & VT_BITFIELD))
6475 gen_assign_cast(&vtop[-1].type);
6478 if (sbt == VT_STRUCT) {
6479 /* if structure, only generate pointer */
6480 /* structure assignment : generate memcpy */
6481 /* XXX: optimize if small size */
6482 if (!nocode_wanted) {
6483 size = type_size(&vtop->type, &align);
6485 #ifdef TCC_ARM_EABI
6486 if(!(align & 7))
6487 vpush_global_sym(&func_old_type, TOK_memcpy8);
6488 else if(!(align & 3))
6489 vpush_global_sym(&func_old_type, TOK_memcpy4);
6490 else
6491 #endif
6492 vpush_global_sym(&func_old_type, TOK_memcpy);
6494 /* destination */
6495 vpushv(vtop - 2);
6496 vtop->type.t = VT_INT;
6497 gaddrof();
6498 /* source */
6499 vpushv(vtop - 2);
6500 vtop->type.t = VT_INT;
6501 gaddrof();
6502 /* type size */
6503 vpushi(size);
6504 gfunc_call(3);
6506 vswap();
6507 vpop();
6508 } else {
6509 vswap();
6510 vpop();
6512 /* leave source on stack */
6513 } else if (ft & VT_BITFIELD) {
6514 /* bitfield store handling */
6515 bit_pos = (ft >> VT_STRUCT_SHIFT) & 0x3f;
6516 bit_size = (ft >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
6517 /* remove bit field info to avoid loops */
6518 vtop[-1].type.t = ft & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT));
6520 /* duplicate source into other register */
6521 gv_dup();
6522 vswap();
6523 vrott(3);
6525 /* duplicate destination */
6526 vdup();
6527 vtop[-1] = vtop[-2];
6529 /* mask and shift source */
6530 vpushi((1 << bit_size) - 1);
6531 gen_op('&');
6532 vpushi(bit_pos);
6533 gen_op(TOK_SHL);
6534 /* load destination, mask and or with source */
6535 vswap();
6536 vpushi(~(((1 << bit_size) - 1) << bit_pos));
6537 gen_op('&');
6538 gen_op('|');
6539 /* store result */
6540 vstore();
6542 /* pop off shifted source from "duplicate source..." above */
6543 vpop();
6545 } else {
6546 #ifdef CONFIG_TCC_BCHECK
6547 /* bound check case */
6548 if (vtop[-1].r & VT_MUSTBOUND) {
6549 vswap();
6550 gbound();
6551 vswap();
6553 #endif
6554 if (!nocode_wanted) {
6555 rc = RC_INT;
6556 if (is_float(ft))
6557 rc = RC_FLOAT;
6558 r = gv(rc); /* generate value */
6559 /* if lvalue was saved on stack, must read it */
6560 if ((vtop[-1].r & VT_VALMASK) == VT_LLOCAL) {
6561 SValue sv;
6562 t = get_reg(RC_INT);
6563 sv.type.t = VT_INT;
6564 sv.r = VT_LOCAL | VT_LVAL;
6565 sv.c.ul = vtop[-1].c.ul;
6566 load(t, &sv);
6567 vtop[-1].r = t | VT_LVAL;
6569 store(r, vtop - 1);
6570 /* two word case handling : store second register at word + 4 */
6571 if ((ft & VT_BTYPE) == VT_LLONG) {
6572 vswap();
6573 /* convert to int to increment easily */
6574 vtop->type.t = VT_INT;
6575 gaddrof();
6576 vpushi(4);
6577 gen_op('+');
6578 vtop->r |= VT_LVAL;
6579 vswap();
6580 /* XXX: it works because r2 is spilled last ! */
6581 store(vtop->r2, vtop - 1);
6584 vswap();
6585 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
6586 vtop->r |= delayed_cast;
6590 /* post defines POST/PRE add. c is the token ++ or -- */
6591 void inc(int post, int c)
6593 test_lvalue();
6594 vdup(); /* save lvalue */
6595 if (post) {
6596 gv_dup(); /* duplicate value */
6597 vrotb(3);
6598 vrotb(3);
6600 /* add constant */
6601 vpushi(c - TOK_MID);
6602 gen_op('+');
6603 vstore(); /* store value */
6604 if (post)
6605 vpop(); /* if post op, return saved value */
6608 /* Parse GNUC __attribute__ extension. Currently, the following
6609 extensions are recognized:
6610 - aligned(n) : set data/function alignment.
6611 - packed : force data alignment to 1
6612 - section(x) : generate data/code in this section.
6613 - unused : currently ignored, but may be used someday.
6614 - regparm(n) : pass function parameters in registers (i386 only)
6616 static void parse_attribute(AttributeDef *ad)
6618 int t, n;
6620 while (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) {
6621 next();
6622 skip('(');
6623 skip('(');
6624 while (tok != ')') {
6625 if (tok < TOK_IDENT)
6626 expect("attribute name");
6627 t = tok;
6628 next();
6629 switch(t) {
6630 case TOK_SECTION1:
6631 case TOK_SECTION2:
6632 skip('(');
6633 if (tok != TOK_STR)
6634 expect("section name");
6635 ad->section = find_section(tcc_state, (char *)tokc.cstr->data);
6636 next();
6637 skip(')');
6638 break;
6639 case TOK_ALIGNED1:
6640 case TOK_ALIGNED2:
6641 if (tok == '(') {
6642 next();
6643 n = expr_const();
6644 if (n <= 0 || (n & (n - 1)) != 0)
6645 error("alignment must be a positive power of two");
6646 skip(')');
6647 } else {
6648 n = MAX_ALIGN;
6650 ad->aligned = n;
6651 break;
6652 case TOK_PACKED1:
6653 case TOK_PACKED2:
6654 ad->packed = 1;
6655 break;
6656 case TOK_UNUSED1:
6657 case TOK_UNUSED2:
6658 /* currently, no need to handle it because tcc does not
6659 track unused objects */
6660 break;
6661 case TOK_NORETURN1:
6662 case TOK_NORETURN2:
6663 /* currently, no need to handle it because tcc does not
6664 track unused objects */
6665 break;
6666 case TOK_CDECL1:
6667 case TOK_CDECL2:
6668 case TOK_CDECL3:
6669 FUNC_CALL(ad->func_attr) = FUNC_CDECL;
6670 break;
6671 case TOK_STDCALL1:
6672 case TOK_STDCALL2:
6673 case TOK_STDCALL3:
6674 FUNC_CALL(ad->func_attr) = FUNC_STDCALL;
6675 break;
6676 #ifdef TCC_TARGET_I386
6677 case TOK_REGPARM1:
6678 case TOK_REGPARM2:
6679 skip('(');
6680 n = expr_const();
6681 if (n > 3)
6682 n = 3;
6683 else if (n < 0)
6684 n = 0;
6685 if (n > 0)
6686 FUNC_CALL(ad->func_attr) = FUNC_FASTCALL1 + n - 1;
6687 skip(')');
6688 break;
6689 case TOK_FASTCALL1:
6690 case TOK_FASTCALL2:
6691 case TOK_FASTCALL3:
6692 FUNC_CALL(ad->func_attr) = FUNC_FASTCALLW;
6693 break;
6694 #endif
6695 case TOK_DLLEXPORT:
6696 FUNC_EXPORT(ad->func_attr) = 1;
6697 break;
6698 default:
6699 if (tcc_state->warn_unsupported)
6700 warning("'%s' attribute ignored", get_tok_str(t, NULL));
6701 /* skip parameters */
6702 if (tok == '(') {
6703 int parenthesis = 0;
6704 do {
6705 if (tok == '(')
6706 parenthesis++;
6707 else if (tok == ')')
6708 parenthesis--;
6709 next();
6710 } while (parenthesis && tok != -1);
6712 break;
6714 if (tok != ',')
6715 break;
6716 next();
6718 skip(')');
6719 skip(')');
6723 /* enum/struct/union declaration. u is either VT_ENUM or VT_STRUCT */
6724 static void struct_decl(CType *type, int u)
6726 int a, v, size, align, maxalign, c, offset;
6727 int bit_size, bit_pos, bsize, bt, lbit_pos;
6728 Sym *s, *ss, *ass, **ps;
6729 AttributeDef ad;
6730 CType type1, btype;
6732 a = tok; /* save decl type */
6733 next();
6734 if (tok != '{') {
6735 v = tok;
6736 next();
6737 /* struct already defined ? return it */
6738 if (v < TOK_IDENT)
6739 expect("struct/union/enum name");
6740 s = struct_find(v);
6741 if (s) {
6742 if (s->type.t != a)
6743 error("invalid type");
6744 goto do_decl;
6746 } else {
6747 v = anon_sym++;
6749 type1.t = a;
6750 /* we put an undefined size for struct/union */
6751 s = sym_push(v | SYM_STRUCT, &type1, 0, -1);
6752 s->r = 0; /* default alignment is zero as gcc */
6753 /* put struct/union/enum name in type */
6754 do_decl:
6755 type->t = u;
6756 type->ref = s;
6758 if (tok == '{') {
6759 next();
6760 if (s->c != -1)
6761 error("struct/union/enum already defined");
6762 /* cannot be empty */
6763 c = 0;
6764 /* non empty enums are not allowed */
6765 if (a == TOK_ENUM) {
6766 for(;;) {
6767 v = tok;
6768 if (v < TOK_UIDENT)
6769 expect("identifier");
6770 next();
6771 if (tok == '=') {
6772 next();
6773 c = expr_const();
6775 /* enum symbols have static storage */
6776 ss = sym_push(v, &int_type, VT_CONST, c);
6777 ss->type.t |= VT_STATIC;
6778 if (tok != ',')
6779 break;
6780 next();
6781 c++;
6782 /* NOTE: we accept a trailing comma */
6783 if (tok == '}')
6784 break;
6786 skip('}');
6787 } else {
6788 maxalign = 1;
6789 ps = &s->next;
6790 bit_pos = 0;
6791 offset = 0;
6792 while (tok != '}') {
6793 parse_btype(&btype, &ad);
6794 while (1) {
6795 bit_size = -1;
6796 v = 0;
6797 type1 = btype;
6798 if (tok != ':') {
6799 type_decl(&type1, &ad, &v, TYPE_DIRECT | TYPE_ABSTRACT);
6800 if (v == 0 && (type1.t & VT_BTYPE) != VT_STRUCT)
6801 expect("identifier");
6802 if ((type1.t & VT_BTYPE) == VT_FUNC ||
6803 (type1.t & (VT_TYPEDEF | VT_STATIC | VT_EXTERN | VT_INLINE)))
6804 error("invalid type for '%s'",
6805 get_tok_str(v, NULL));
6807 if (tok == ':') {
6808 next();
6809 bit_size = expr_const();
6810 /* XXX: handle v = 0 case for messages */
6811 if (bit_size < 0)
6812 error("negative width in bit-field '%s'",
6813 get_tok_str(v, NULL));
6814 if (v && bit_size == 0)
6815 error("zero width for bit-field '%s'",
6816 get_tok_str(v, NULL));
6818 size = type_size(&type1, &align);
6819 if (ad.aligned) {
6820 if (align < ad.aligned)
6821 align = ad.aligned;
6822 } else if (ad.packed) {
6823 align = 1;
6824 } else if (*tcc_state->pack_stack_ptr) {
6825 if (align > *tcc_state->pack_stack_ptr)
6826 align = *tcc_state->pack_stack_ptr;
6828 lbit_pos = 0;
6829 if (bit_size >= 0) {
6830 bt = type1.t & VT_BTYPE;
6831 if (bt != VT_INT &&
6832 bt != VT_BYTE &&
6833 bt != VT_SHORT &&
6834 bt != VT_BOOL &&
6835 bt != VT_ENUM)
6836 error("bitfields must have scalar type");
6837 bsize = size * 8;
6838 if (bit_size > bsize) {
6839 error("width of '%s' exceeds its type",
6840 get_tok_str(v, NULL));
6841 } else if (bit_size == bsize) {
6842 /* no need for bit fields */
6843 bit_pos = 0;
6844 } else if (bit_size == 0) {
6845 /* XXX: what to do if only padding in a
6846 structure ? */
6847 /* zero size: means to pad */
6848 if (bit_pos > 0)
6849 bit_pos = bsize;
6850 } else {
6851 /* we do not have enough room ? */
6852 if ((bit_pos + bit_size) > bsize)
6853 bit_pos = 0;
6854 lbit_pos = bit_pos;
6855 /* XXX: handle LSB first */
6856 type1.t |= VT_BITFIELD |
6857 (bit_pos << VT_STRUCT_SHIFT) |
6858 (bit_size << (VT_STRUCT_SHIFT + 6));
6859 bit_pos += bit_size;
6861 } else {
6862 bit_pos = 0;
6864 if (v != 0 || (type1.t & VT_BTYPE) == VT_STRUCT) {
6865 /* add new memory data only if starting
6866 bit field */
6867 if (lbit_pos == 0) {
6868 if (a == TOK_STRUCT) {
6869 c = (c + align - 1) & -align;
6870 offset = c;
6871 if (size > 0)
6872 c += size;
6873 } else {
6874 offset = 0;
6875 if (size > c)
6876 c = size;
6878 if (align > maxalign)
6879 maxalign = align;
6881 #if 0
6882 printf("add field %s offset=%d",
6883 get_tok_str(v, NULL), offset);
6884 if (type1.t & VT_BITFIELD) {
6885 printf(" pos=%d size=%d",
6886 (type1.t >> VT_STRUCT_SHIFT) & 0x3f,
6887 (type1.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f);
6889 printf("\n");
6890 #endif
6892 if (v == 0 && (type1.t & VT_BTYPE) == VT_STRUCT) {
6893 ass = type1.ref;
6894 while ((ass = ass->next) != NULL) {
6895 ss = sym_push(ass->v, &ass->type, 0, offset + ass->c);
6896 *ps = ss;
6897 ps = &ss->next;
6899 } else if (v) {
6900 ss = sym_push(v | SYM_FIELD, &type1, 0, offset);
6901 *ps = ss;
6902 ps = &ss->next;
6904 if (tok == ';' || tok == TOK_EOF)
6905 break;
6906 skip(',');
6908 skip(';');
6910 skip('}');
6911 /* store size and alignment */
6912 s->c = (c + maxalign - 1) & -maxalign;
6913 s->r = maxalign;
6918 /* return 0 if no type declaration. otherwise, return the basic type
6919 and skip it.
6921 static int parse_btype(CType *type, AttributeDef *ad)
6923 int t, u, type_found, typespec_found, typedef_found;
6924 Sym *s;
6925 CType type1;
6927 memset(ad, 0, sizeof(AttributeDef));
6928 type_found = 0;
6929 typespec_found = 0;
6930 typedef_found = 0;
6931 t = 0;
6932 while(1) {
6933 switch(tok) {
6934 case TOK_EXTENSION:
6935 /* currently, we really ignore extension */
6936 next();
6937 continue;
6939 /* basic types */
6940 case TOK_CHAR:
6941 u = VT_BYTE;
6942 basic_type:
6943 next();
6944 basic_type1:
6945 if ((t & VT_BTYPE) != 0)
6946 error("too many basic types");
6947 t |= u;
6948 typespec_found = 1;
6949 break;
6950 case TOK_VOID:
6951 u = VT_VOID;
6952 goto basic_type;
6953 case TOK_SHORT:
6954 u = VT_SHORT;
6955 goto basic_type;
6956 case TOK_INT:
6957 next();
6958 typespec_found = 1;
6959 break;
6960 case TOK_LONG:
6961 next();
6962 if ((t & VT_BTYPE) == VT_DOUBLE) {
6963 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
6964 } else if ((t & VT_BTYPE) == VT_LONG) {
6965 t = (t & ~VT_BTYPE) | VT_LLONG;
6966 } else {
6967 u = VT_LONG;
6968 goto basic_type1;
6970 break;
6971 case TOK_BOOL:
6972 u = VT_BOOL;
6973 goto basic_type;
6974 case TOK_FLOAT:
6975 u = VT_FLOAT;
6976 goto basic_type;
6977 case TOK_DOUBLE:
6978 next();
6979 if ((t & VT_BTYPE) == VT_LONG) {
6980 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
6981 } else {
6982 u = VT_DOUBLE;
6983 goto basic_type1;
6985 break;
6986 case TOK_ENUM:
6987 struct_decl(&type1, VT_ENUM);
6988 basic_type2:
6989 u = type1.t;
6990 type->ref = type1.ref;
6991 goto basic_type1;
6992 case TOK_STRUCT:
6993 case TOK_UNION:
6994 struct_decl(&type1, VT_STRUCT);
6995 goto basic_type2;
6997 /* type modifiers */
6998 case TOK_CONST1:
6999 case TOK_CONST2:
7000 case TOK_CONST3:
7001 t |= VT_CONSTANT;
7002 next();
7003 break;
7004 case TOK_VOLATILE1:
7005 case TOK_VOLATILE2:
7006 case TOK_VOLATILE3:
7007 t |= VT_VOLATILE;
7008 next();
7009 break;
7010 case TOK_SIGNED1:
7011 case TOK_SIGNED2:
7012 case TOK_SIGNED3:
7013 typespec_found = 1;
7014 t |= VT_SIGNED;
7015 next();
7016 break;
7017 case TOK_REGISTER:
7018 case TOK_AUTO:
7019 case TOK_RESTRICT1:
7020 case TOK_RESTRICT2:
7021 case TOK_RESTRICT3:
7022 next();
7023 break;
7024 case TOK_UNSIGNED:
7025 t |= VT_UNSIGNED;
7026 next();
7027 typespec_found = 1;
7028 break;
7030 /* storage */
7031 case TOK_EXTERN:
7032 t |= VT_EXTERN;
7033 next();
7034 break;
7035 case TOK_STATIC:
7036 t |= VT_STATIC;
7037 next();
7038 break;
7039 case TOK_TYPEDEF:
7040 t |= VT_TYPEDEF;
7041 next();
7042 break;
7043 case TOK_INLINE1:
7044 case TOK_INLINE2:
7045 case TOK_INLINE3:
7046 t |= VT_INLINE;
7047 next();
7048 break;
7050 /* GNUC attribute */
7051 case TOK_ATTRIBUTE1:
7052 case TOK_ATTRIBUTE2:
7053 parse_attribute(ad);
7054 break;
7055 /* GNUC typeof */
7056 case TOK_TYPEOF1:
7057 case TOK_TYPEOF2:
7058 case TOK_TYPEOF3:
7059 next();
7060 parse_expr_type(&type1);
7061 goto basic_type2;
7062 default:
7063 if (typespec_found || typedef_found)
7064 goto the_end;
7065 s = sym_find(tok);
7066 if (!s || !(s->type.t & VT_TYPEDEF))
7067 goto the_end;
7068 typedef_found = 1;
7069 t |= (s->type.t & ~VT_TYPEDEF);
7070 type->ref = s->type.ref;
7071 next();
7072 typespec_found = 1;
7073 break;
7075 type_found = 1;
7077 the_end:
7078 if ((t & (VT_SIGNED|VT_UNSIGNED)) == (VT_SIGNED|VT_UNSIGNED))
7079 error("signed and unsigned modifier");
7080 if (tcc_state->char_is_unsigned) {
7081 if ((t & (VT_SIGNED|VT_UNSIGNED|VT_BTYPE)) == VT_BYTE)
7082 t |= VT_UNSIGNED;
7084 t &= ~VT_SIGNED;
7086 /* long is never used as type */
7087 if ((t & VT_BTYPE) == VT_LONG)
7088 t = (t & ~VT_BTYPE) | VT_INT;
7089 type->t = t;
7090 return type_found;
7093 /* convert a function parameter type (array to pointer and function to
7094 function pointer) */
7095 static inline void convert_parameter_type(CType *pt)
7097 /* remove const and volatile qualifiers (XXX: const could be used
7098 to indicate a const function parameter */
7099 pt->t &= ~(VT_CONSTANT | VT_VOLATILE);
7100 /* array must be transformed to pointer according to ANSI C */
7101 pt->t &= ~VT_ARRAY;
7102 if ((pt->t & VT_BTYPE) == VT_FUNC) {
7103 mk_pointer(pt);
7107 static void post_type(CType *type, AttributeDef *ad)
7109 int n, l, t1, arg_size, align;
7110 Sym **plast, *s, *first;
7111 AttributeDef ad1;
7112 CType pt;
7114 if (tok == '(') {
7115 /* function declaration */
7116 next();
7117 l = 0;
7118 first = NULL;
7119 plast = &first;
7120 arg_size = 0;
7121 if (tok != ')') {
7122 for(;;) {
7123 /* read param name and compute offset */
7124 if (l != FUNC_OLD) {
7125 if (!parse_btype(&pt, &ad1)) {
7126 if (l) {
7127 error("invalid type");
7128 } else {
7129 l = FUNC_OLD;
7130 goto old_proto;
7133 l = FUNC_NEW;
7134 if ((pt.t & VT_BTYPE) == VT_VOID && tok == ')')
7135 break;
7136 type_decl(&pt, &ad1, &n, TYPE_DIRECT | TYPE_ABSTRACT);
7137 if ((pt.t & VT_BTYPE) == VT_VOID)
7138 error("parameter declared as void");
7139 arg_size += (type_size(&pt, &align) + 3) & ~3;
7140 } else {
7141 old_proto:
7142 n = tok;
7143 if (n < TOK_UIDENT)
7144 expect("identifier");
7145 pt.t = VT_INT;
7146 next();
7148 convert_parameter_type(&pt);
7149 s = sym_push(n | SYM_FIELD, &pt, 0, 0);
7150 *plast = s;
7151 plast = &s->next;
7152 if (tok == ')')
7153 break;
7154 skip(',');
7155 if (l == FUNC_NEW && tok == TOK_DOTS) {
7156 l = FUNC_ELLIPSIS;
7157 next();
7158 break;
7162 /* if no parameters, then old type prototype */
7163 if (l == 0)
7164 l = FUNC_OLD;
7165 skip(')');
7166 t1 = type->t & VT_STORAGE;
7167 /* NOTE: const is ignored in returned type as it has a special
7168 meaning in gcc / C++ */
7169 type->t &= ~(VT_STORAGE | VT_CONSTANT);
7170 post_type(type, ad);
7171 /* we push a anonymous symbol which will contain the function prototype */
7172 FUNC_ARGS(ad->func_attr) = arg_size;
7173 s = sym_push(SYM_FIELD, type, ad->func_attr, l);
7174 s->next = first;
7175 type->t = t1 | VT_FUNC;
7176 type->ref = s;
7177 } else if (tok == '[') {
7178 /* array definition */
7179 next();
7180 n = -1;
7181 if (tok != ']') {
7182 n = expr_const();
7183 if (n < 0)
7184 error("invalid array size");
7186 skip(']');
7187 /* parse next post type */
7188 t1 = type->t & VT_STORAGE;
7189 type->t &= ~VT_STORAGE;
7190 post_type(type, ad);
7192 /* we push a anonymous symbol which will contain the array
7193 element type */
7194 s = sym_push(SYM_FIELD, type, 0, n);
7195 type->t = t1 | VT_ARRAY | VT_PTR;
7196 type->ref = s;
7200 /* Parse a type declaration (except basic type), and return the type
7201 in 'type'. 'td' is a bitmask indicating which kind of type decl is
7202 expected. 'type' should contain the basic type. 'ad' is the
7203 attribute definition of the basic type. It can be modified by
7204 type_decl().
7206 static void type_decl(CType *type, AttributeDef *ad, int *v, int td)
7208 Sym *s;
7209 CType type1, *type2;
7210 int qualifiers;
7212 while (tok == '*') {
7213 qualifiers = 0;
7214 redo:
7215 next();
7216 switch(tok) {
7217 case TOK_CONST1:
7218 case TOK_CONST2:
7219 case TOK_CONST3:
7220 qualifiers |= VT_CONSTANT;
7221 goto redo;
7222 case TOK_VOLATILE1:
7223 case TOK_VOLATILE2:
7224 case TOK_VOLATILE3:
7225 qualifiers |= VT_VOLATILE;
7226 goto redo;
7227 case TOK_RESTRICT1:
7228 case TOK_RESTRICT2:
7229 case TOK_RESTRICT3:
7230 goto redo;
7232 mk_pointer(type);
7233 type->t |= qualifiers;
7236 /* XXX: clarify attribute handling */
7237 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7238 parse_attribute(ad);
7240 /* recursive type */
7241 /* XXX: incorrect if abstract type for functions (e.g. 'int ()') */
7242 type1.t = 0; /* XXX: same as int */
7243 if (tok == '(') {
7244 next();
7245 /* XXX: this is not correct to modify 'ad' at this point, but
7246 the syntax is not clear */
7247 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7248 parse_attribute(ad);
7249 type_decl(&type1, ad, v, td);
7250 skip(')');
7251 } else {
7252 /* type identifier */
7253 if (tok >= TOK_IDENT && (td & TYPE_DIRECT)) {
7254 *v = tok;
7255 next();
7256 } else {
7257 if (!(td & TYPE_ABSTRACT))
7258 expect("identifier");
7259 *v = 0;
7262 post_type(type, ad);
7263 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7264 parse_attribute(ad);
7265 if (!type1.t)
7266 return;
7267 /* append type at the end of type1 */
7268 type2 = &type1;
7269 for(;;) {
7270 s = type2->ref;
7271 type2 = &s->type;
7272 if (!type2->t) {
7273 *type2 = *type;
7274 break;
7277 *type = type1;
7280 /* compute the lvalue VT_LVAL_xxx needed to match type t. */
7281 static int lvalue_type(int t)
7283 int bt, r;
7284 r = VT_LVAL;
7285 bt = t & VT_BTYPE;
7286 if (bt == VT_BYTE || bt == VT_BOOL)
7287 r |= VT_LVAL_BYTE;
7288 else if (bt == VT_SHORT)
7289 r |= VT_LVAL_SHORT;
7290 else
7291 return r;
7292 if (t & VT_UNSIGNED)
7293 r |= VT_LVAL_UNSIGNED;
7294 return r;
7297 /* indirection with full error checking and bound check */
7298 static void indir(void)
7300 if ((vtop->type.t & VT_BTYPE) != VT_PTR) {
7301 if ((vtop->type.t & VT_BTYPE) == VT_FUNC)
7302 return;
7303 expect("pointer");
7305 if ((vtop->r & VT_LVAL) && !nocode_wanted)
7306 gv(RC_INT);
7307 vtop->type = *pointed_type(&vtop->type);
7308 /* Arrays and functions are never lvalues */
7309 if (!(vtop->type.t & VT_ARRAY)
7310 && (vtop->type.t & VT_BTYPE) != VT_FUNC) {
7311 vtop->r |= lvalue_type(vtop->type.t);
7312 /* if bound checking, the referenced pointer must be checked */
7313 if (do_bounds_check)
7314 vtop->r |= VT_MUSTBOUND;
7318 /* pass a parameter to a function and do type checking and casting */
7319 static void gfunc_param_typed(Sym *func, Sym *arg)
7321 int func_type;
7322 CType type;
7324 func_type = func->c;
7325 if (func_type == FUNC_OLD ||
7326 (func_type == FUNC_ELLIPSIS && arg == NULL)) {
7327 /* default casting : only need to convert float to double */
7328 if ((vtop->type.t & VT_BTYPE) == VT_FLOAT) {
7329 type.t = VT_DOUBLE;
7330 gen_cast(&type);
7332 } else if (arg == NULL) {
7333 error("too many arguments to function");
7334 } else {
7335 type = arg->type;
7336 type.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
7337 gen_assign_cast(&type);
7341 /* parse an expression of the form '(type)' or '(expr)' and return its
7342 type */
7343 static void parse_expr_type(CType *type)
7345 int n;
7346 AttributeDef ad;
7348 skip('(');
7349 if (parse_btype(type, &ad)) {
7350 type_decl(type, &ad, &n, TYPE_ABSTRACT);
7351 } else {
7352 expr_type(type);
7354 skip(')');
7357 static void parse_type(CType *type)
7359 AttributeDef ad;
7360 int n;
7362 if (!parse_btype(type, &ad)) {
7363 expect("type");
7365 type_decl(type, &ad, &n, TYPE_ABSTRACT);
7368 static void vpush_tokc(int t)
7370 CType type;
7371 type.t = t;
7372 vsetc(&type, VT_CONST, &tokc);
7375 static void unary(void)
7377 int n, t, align, size, r;
7378 CType type;
7379 Sym *s;
7380 AttributeDef ad;
7382 /* XXX: GCC 2.95.3 does not generate a table although it should be
7383 better here */
7384 tok_next:
7385 switch(tok) {
7386 case TOK_EXTENSION:
7387 next();
7388 goto tok_next;
7389 case TOK_CINT:
7390 case TOK_CCHAR:
7391 case TOK_LCHAR:
7392 vpushi(tokc.i);
7393 next();
7394 break;
7395 case TOK_CUINT:
7396 vpush_tokc(VT_INT | VT_UNSIGNED);
7397 next();
7398 break;
7399 case TOK_CLLONG:
7400 vpush_tokc(VT_LLONG);
7401 next();
7402 break;
7403 case TOK_CULLONG:
7404 vpush_tokc(VT_LLONG | VT_UNSIGNED);
7405 next();
7406 break;
7407 case TOK_CFLOAT:
7408 vpush_tokc(VT_FLOAT);
7409 next();
7410 break;
7411 case TOK_CDOUBLE:
7412 vpush_tokc(VT_DOUBLE);
7413 next();
7414 break;
7415 case TOK_CLDOUBLE:
7416 vpush_tokc(VT_LDOUBLE);
7417 next();
7418 break;
7419 case TOK___FUNCTION__:
7420 if (!gnu_ext)
7421 goto tok_identifier;
7422 /* fall thru */
7423 case TOK___FUNC__:
7425 void *ptr;
7426 int len;
7427 /* special function name identifier */
7428 len = strlen(funcname) + 1;
7429 /* generate char[len] type */
7430 type.t = VT_BYTE;
7431 mk_pointer(&type);
7432 type.t |= VT_ARRAY;
7433 type.ref->c = len;
7434 vpush_ref(&type, data_section, data_section->data_offset, len);
7435 ptr = section_ptr_add(data_section, len);
7436 memcpy(ptr, funcname, len);
7437 next();
7439 break;
7440 case TOK_LSTR:
7441 #ifdef TCC_TARGET_PE
7442 t = VT_SHORT | VT_UNSIGNED;
7443 #else
7444 t = VT_INT;
7445 #endif
7446 goto str_init;
7447 case TOK_STR:
7448 /* string parsing */
7449 t = VT_BYTE;
7450 str_init:
7451 if (tcc_state->warn_write_strings)
7452 t |= VT_CONSTANT;
7453 type.t = t;
7454 mk_pointer(&type);
7455 type.t |= VT_ARRAY;
7456 memset(&ad, 0, sizeof(AttributeDef));
7457 decl_initializer_alloc(&type, &ad, VT_CONST, 2, 0, 0);
7458 break;
7459 case '(':
7460 next();
7461 /* cast ? */
7462 if (parse_btype(&type, &ad)) {
7463 type_decl(&type, &ad, &n, TYPE_ABSTRACT);
7464 skip(')');
7465 /* check ISOC99 compound literal */
7466 if (tok == '{') {
7467 /* data is allocated locally by default */
7468 if (global_expr)
7469 r = VT_CONST;
7470 else
7471 r = VT_LOCAL;
7472 /* all except arrays are lvalues */
7473 if (!(type.t & VT_ARRAY))
7474 r |= lvalue_type(type.t);
7475 memset(&ad, 0, sizeof(AttributeDef));
7476 decl_initializer_alloc(&type, &ad, r, 1, 0, 0);
7477 } else {
7478 unary();
7479 gen_cast(&type);
7481 } else if (tok == '{') {
7482 /* save all registers */
7483 save_regs(0);
7484 /* statement expression : we do not accept break/continue
7485 inside as GCC does */
7486 block(NULL, NULL, NULL, NULL, 0, 1);
7487 skip(')');
7488 } else {
7489 gexpr();
7490 skip(')');
7492 break;
7493 case '*':
7494 next();
7495 unary();
7496 indir();
7497 break;
7498 case '&':
7499 next();
7500 unary();
7501 /* functions names must be treated as function pointers,
7502 except for unary '&' and sizeof. Since we consider that
7503 functions are not lvalues, we only have to handle it
7504 there and in function calls. */
7505 /* arrays can also be used although they are not lvalues */
7506 if ((vtop->type.t & VT_BTYPE) != VT_FUNC &&
7507 !(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_LLOCAL))
7508 test_lvalue();
7509 mk_pointer(&vtop->type);
7510 gaddrof();
7511 break;
7512 case '!':
7513 next();
7514 unary();
7515 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST)
7516 vtop->c.i = !vtop->c.i;
7517 else if ((vtop->r & VT_VALMASK) == VT_CMP)
7518 vtop->c.i = vtop->c.i ^ 1;
7519 else {
7520 save_regs(1);
7521 vseti(VT_JMP, gtst(1, 0));
7523 break;
7524 case '~':
7525 next();
7526 unary();
7527 vpushi(-1);
7528 gen_op('^');
7529 break;
7530 case '+':
7531 next();
7532 /* in order to force cast, we add zero */
7533 unary();
7534 if ((vtop->type.t & VT_BTYPE) == VT_PTR)
7535 error("pointer not accepted for unary plus");
7536 vpushi(0);
7537 gen_op('+');
7538 break;
7539 case TOK_SIZEOF:
7540 case TOK_ALIGNOF1:
7541 case TOK_ALIGNOF2:
7542 t = tok;
7543 next();
7544 if (tok == '(') {
7545 parse_expr_type(&type);
7546 } else {
7547 unary_type(&type);
7549 size = type_size(&type, &align);
7550 if (t == TOK_SIZEOF) {
7551 if (size < 0)
7552 error("sizeof applied to an incomplete type");
7553 vpushi(size);
7554 } else {
7555 vpushi(align);
7557 vtop->type.t |= VT_UNSIGNED;
7558 break;
7560 case TOK_builtin_types_compatible_p:
7562 CType type1, type2;
7563 next();
7564 skip('(');
7565 parse_type(&type1);
7566 skip(',');
7567 parse_type(&type2);
7568 skip(')');
7569 type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
7570 type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
7571 vpushi(is_compatible_types(&type1, &type2));
7573 break;
7574 case TOK_builtin_constant_p:
7576 int saved_nocode_wanted, res;
7577 next();
7578 skip('(');
7579 saved_nocode_wanted = nocode_wanted;
7580 nocode_wanted = 1;
7581 gexpr();
7582 res = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
7583 vpop();
7584 nocode_wanted = saved_nocode_wanted;
7585 skip(')');
7586 vpushi(res);
7588 break;
7589 case TOK_INC:
7590 case TOK_DEC:
7591 t = tok;
7592 next();
7593 unary();
7594 inc(0, t);
7595 break;
7596 case '-':
7597 next();
7598 vpushi(0);
7599 unary();
7600 gen_op('-');
7601 break;
7602 case TOK_LAND:
7603 if (!gnu_ext)
7604 goto tok_identifier;
7605 next();
7606 /* allow to take the address of a label */
7607 if (tok < TOK_UIDENT)
7608 expect("label identifier");
7609 s = label_find(tok);
7610 if (!s) {
7611 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
7612 } else {
7613 if (s->r == LABEL_DECLARED)
7614 s->r = LABEL_FORWARD;
7616 if (!s->type.t) {
7617 s->type.t = VT_VOID;
7618 mk_pointer(&s->type);
7619 s->type.t |= VT_STATIC;
7621 vset(&s->type, VT_CONST | VT_SYM, 0);
7622 vtop->sym = s;
7623 next();
7624 break;
7625 default:
7626 tok_identifier:
7627 t = tok;
7628 next();
7629 if (t < TOK_UIDENT)
7630 expect("identifier");
7631 s = sym_find(t);
7632 if (!s) {
7633 if (tok != '(')
7634 error("'%s' undeclared", get_tok_str(t, NULL));
7635 /* for simple function calls, we tolerate undeclared
7636 external reference to int() function */
7637 if (tcc_state->warn_implicit_function_declaration)
7638 warning("implicit declaration of function '%s'",
7639 get_tok_str(t, NULL));
7640 s = external_global_sym(t, &func_old_type, 0);
7642 if ((s->type.t & (VT_STATIC | VT_INLINE | VT_BTYPE)) ==
7643 (VT_STATIC | VT_INLINE | VT_FUNC)) {
7644 /* if referencing an inline function, then we generate a
7645 symbol to it if not already done. It will have the
7646 effect to generate code for it at the end of the
7647 compilation unit. Inline function as always
7648 generated in the text section. */
7649 if (!s->c)
7650 put_extern_sym(s, text_section, 0, 0);
7651 r = VT_SYM | VT_CONST;
7652 } else {
7653 r = s->r;
7655 vset(&s->type, r, s->c);
7656 /* if forward reference, we must point to s */
7657 if (vtop->r & VT_SYM) {
7658 vtop->sym = s;
7659 vtop->c.ul = 0;
7661 break;
7664 /* post operations */
7665 while (1) {
7666 if (tok == TOK_INC || tok == TOK_DEC) {
7667 inc(1, tok);
7668 next();
7669 } else if (tok == '.' || tok == TOK_ARROW) {
7670 /* field */
7671 if (tok == TOK_ARROW)
7672 indir();
7673 test_lvalue();
7674 gaddrof();
7675 next();
7676 /* expect pointer on structure */
7677 if ((vtop->type.t & VT_BTYPE) != VT_STRUCT)
7678 expect("struct or union");
7679 s = vtop->type.ref;
7680 /* find field */
7681 tok |= SYM_FIELD;
7682 while ((s = s->next) != NULL) {
7683 if (s->v == tok)
7684 break;
7686 if (!s)
7687 error("field not found: %s", get_tok_str(tok & ~SYM_FIELD, NULL));
7688 /* add field offset to pointer */
7689 vtop->type = char_pointer_type; /* change type to 'char *' */
7690 vpushi(s->c);
7691 gen_op('+');
7692 /* change type to field type, and set to lvalue */
7693 vtop->type = s->type;
7694 /* an array is never an lvalue */
7695 if (!(vtop->type.t & VT_ARRAY)) {
7696 vtop->r |= lvalue_type(vtop->type.t);
7697 /* if bound checking, the referenced pointer must be checked */
7698 if (do_bounds_check)
7699 vtop->r |= VT_MUSTBOUND;
7701 next();
7702 } else if (tok == '[') {
7703 next();
7704 gexpr();
7705 gen_op('+');
7706 indir();
7707 skip(']');
7708 } else if (tok == '(') {
7709 SValue ret;
7710 Sym *sa;
7711 int nb_args;
7713 /* function call */
7714 if ((vtop->type.t & VT_BTYPE) != VT_FUNC) {
7715 /* pointer test (no array accepted) */
7716 if ((vtop->type.t & (VT_BTYPE | VT_ARRAY)) == VT_PTR) {
7717 vtop->type = *pointed_type(&vtop->type);
7718 if ((vtop->type.t & VT_BTYPE) != VT_FUNC)
7719 goto error_func;
7720 } else {
7721 error_func:
7722 expect("function pointer");
7724 } else {
7725 vtop->r &= ~VT_LVAL; /* no lvalue */
7727 /* get return type */
7728 s = vtop->type.ref;
7729 next();
7730 sa = s->next; /* first parameter */
7731 nb_args = 0;
7732 ret.r2 = VT_CONST;
7733 /* compute first implicit argument if a structure is returned */
7734 if ((s->type.t & VT_BTYPE) == VT_STRUCT) {
7735 /* get some space for the returned structure */
7736 size = type_size(&s->type, &align);
7737 loc = (loc - size) & -align;
7738 ret.type = s->type;
7739 ret.r = VT_LOCAL | VT_LVAL;
7740 /* pass it as 'int' to avoid structure arg passing
7741 problems */
7742 vseti(VT_LOCAL, loc);
7743 ret.c = vtop->c;
7744 nb_args++;
7745 } else {
7746 ret.type = s->type;
7747 /* return in register */
7748 if (is_float(ret.type.t)) {
7749 ret.r = REG_FRET;
7750 } else {
7751 if ((ret.type.t & VT_BTYPE) == VT_LLONG)
7752 ret.r2 = REG_LRET;
7753 ret.r = REG_IRET;
7755 ret.c.i = 0;
7757 if (tok != ')') {
7758 for(;;) {
7759 expr_eq();
7760 gfunc_param_typed(s, sa);
7761 nb_args++;
7762 if (sa)
7763 sa = sa->next;
7764 if (tok == ')')
7765 break;
7766 skip(',');
7769 if (sa)
7770 error("too few arguments to function");
7771 skip(')');
7772 if (!nocode_wanted) {
7773 gfunc_call(nb_args);
7774 } else {
7775 vtop -= (nb_args + 1);
7777 /* return value */
7778 vsetc(&ret.type, ret.r, &ret.c);
7779 vtop->r2 = ret.r2;
7780 } else {
7781 break;
7786 static void uneq(void)
7788 int t;
7790 unary();
7791 if (tok == '=' ||
7792 (tok >= TOK_A_MOD && tok <= TOK_A_DIV) ||
7793 tok == TOK_A_XOR || tok == TOK_A_OR ||
7794 tok == TOK_A_SHL || tok == TOK_A_SAR) {
7795 test_lvalue();
7796 t = tok;
7797 next();
7798 if (t == '=') {
7799 expr_eq();
7800 } else {
7801 vdup();
7802 expr_eq();
7803 gen_op(t & 0x7f);
7805 vstore();
7809 static void expr_prod(void)
7811 int t;
7813 uneq();
7814 while (tok == '*' || tok == '/' || tok == '%') {
7815 t = tok;
7816 next();
7817 uneq();
7818 gen_op(t);
7822 static void expr_sum(void)
7824 int t;
7826 expr_prod();
7827 while (tok == '+' || tok == '-') {
7828 t = tok;
7829 next();
7830 expr_prod();
7831 gen_op(t);
7835 static void expr_shift(void)
7837 int t;
7839 expr_sum();
7840 while (tok == TOK_SHL || tok == TOK_SAR) {
7841 t = tok;
7842 next();
7843 expr_sum();
7844 gen_op(t);
7848 static void expr_cmp(void)
7850 int t;
7852 expr_shift();
7853 while ((tok >= TOK_ULE && tok <= TOK_GT) ||
7854 tok == TOK_ULT || tok == TOK_UGE) {
7855 t = tok;
7856 next();
7857 expr_shift();
7858 gen_op(t);
7862 static void expr_cmpeq(void)
7864 int t;
7866 expr_cmp();
7867 while (tok == TOK_EQ || tok == TOK_NE) {
7868 t = tok;
7869 next();
7870 expr_cmp();
7871 gen_op(t);
7875 static void expr_and(void)
7877 expr_cmpeq();
7878 while (tok == '&') {
7879 next();
7880 expr_cmpeq();
7881 gen_op('&');
7885 static void expr_xor(void)
7887 expr_and();
7888 while (tok == '^') {
7889 next();
7890 expr_and();
7891 gen_op('^');
7895 static void expr_or(void)
7897 expr_xor();
7898 while (tok == '|') {
7899 next();
7900 expr_xor();
7901 gen_op('|');
7905 /* XXX: fix this mess */
7906 static void expr_land_const(void)
7908 expr_or();
7909 while (tok == TOK_LAND) {
7910 next();
7911 expr_or();
7912 gen_op(TOK_LAND);
7916 /* XXX: fix this mess */
7917 static void expr_lor_const(void)
7919 expr_land_const();
7920 while (tok == TOK_LOR) {
7921 next();
7922 expr_land_const();
7923 gen_op(TOK_LOR);
7927 /* only used if non constant */
7928 static void expr_land(void)
7930 int t;
7932 expr_or();
7933 if (tok == TOK_LAND) {
7934 t = 0;
7935 save_regs(1);
7936 for(;;) {
7937 t = gtst(1, t);
7938 if (tok != TOK_LAND) {
7939 vseti(VT_JMPI, t);
7940 break;
7942 next();
7943 expr_or();
7948 static void expr_lor(void)
7950 int t;
7952 expr_land();
7953 if (tok == TOK_LOR) {
7954 t = 0;
7955 save_regs(1);
7956 for(;;) {
7957 t = gtst(0, t);
7958 if (tok != TOK_LOR) {
7959 vseti(VT_JMP, t);
7960 break;
7962 next();
7963 expr_land();
7968 /* XXX: better constant handling */
7969 static void expr_eq(void)
7971 int tt, u, r1, r2, rc, t1, t2, bt1, bt2;
7972 SValue sv;
7973 CType type, type1, type2;
7975 if (const_wanted) {
7976 int c1, c;
7977 expr_lor_const();
7978 if (tok == '?') {
7979 c = vtop->c.i;
7980 vpop();
7981 next();
7982 if (tok == ':' && gnu_ext) {
7983 c1 = c;
7984 } else {
7985 gexpr();
7986 c1 = vtop->c.i;
7987 vpop();
7989 skip(':');
7990 expr_eq();
7991 if (c)
7992 vtop->c.i = c1;
7994 } else {
7995 expr_lor();
7996 if (tok == '?') {
7997 next();
7998 if (vtop != vstack) {
7999 /* needed to avoid having different registers saved in
8000 each branch */
8001 if (is_float(vtop->type.t))
8002 rc = RC_FLOAT;
8003 else
8004 rc = RC_INT;
8005 gv(rc);
8006 save_regs(1);
8008 if (tok == ':' && gnu_ext) {
8009 gv_dup();
8010 tt = gtst(1, 0);
8011 } else {
8012 tt = gtst(1, 0);
8013 gexpr();
8015 type1 = vtop->type;
8016 sv = *vtop; /* save value to handle it later */
8017 vtop--; /* no vpop so that FP stack is not flushed */
8018 skip(':');
8019 u = gjmp(0);
8020 gsym(tt);
8021 expr_eq();
8022 type2 = vtop->type;
8024 t1 = type1.t;
8025 bt1 = t1 & VT_BTYPE;
8026 t2 = type2.t;
8027 bt2 = t2 & VT_BTYPE;
8028 /* cast operands to correct type according to ISOC rules */
8029 if (is_float(bt1) || is_float(bt2)) {
8030 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
8031 type.t = VT_LDOUBLE;
8032 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
8033 type.t = VT_DOUBLE;
8034 } else {
8035 type.t = VT_FLOAT;
8037 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
8038 /* cast to biggest op */
8039 type.t = VT_LLONG;
8040 /* convert to unsigned if it does not fit in a long long */
8041 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
8042 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
8043 type.t |= VT_UNSIGNED;
8044 } else if (bt1 == VT_PTR || bt2 == VT_PTR) {
8045 /* XXX: test pointer compatibility */
8046 type = type1;
8047 } else if (bt1 == VT_FUNC || bt2 == VT_FUNC) {
8048 /* XXX: test function pointer compatibility */
8049 type = type1;
8050 } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) {
8051 /* XXX: test structure compatibility */
8052 type = type1;
8053 } else if (bt1 == VT_VOID || bt2 == VT_VOID) {
8054 /* NOTE: as an extension, we accept void on only one side */
8055 type.t = VT_VOID;
8056 } else {
8057 /* integer operations */
8058 type.t = VT_INT;
8059 /* convert to unsigned if it does not fit in an integer */
8060 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
8061 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
8062 type.t |= VT_UNSIGNED;
8065 /* now we convert second operand */
8066 gen_cast(&type);
8067 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
8068 gaddrof();
8069 rc = RC_INT;
8070 if (is_float(type.t)) {
8071 rc = RC_FLOAT;
8072 } else if ((type.t & VT_BTYPE) == VT_LLONG) {
8073 /* for long longs, we use fixed registers to avoid having
8074 to handle a complicated move */
8075 rc = RC_IRET;
8078 r2 = gv(rc);
8079 /* this is horrible, but we must also convert first
8080 operand */
8081 tt = gjmp(0);
8082 gsym(u);
8083 /* put again first value and cast it */
8084 *vtop = sv;
8085 gen_cast(&type);
8086 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
8087 gaddrof();
8088 r1 = gv(rc);
8089 move_reg(r2, r1);
8090 vtop->r = r2;
8091 gsym(tt);
8096 static void gexpr(void)
8098 while (1) {
8099 expr_eq();
8100 if (tok != ',')
8101 break;
8102 vpop();
8103 next();
8107 /* parse an expression and return its type without any side effect. */
8108 static void expr_type(CType *type)
8110 int saved_nocode_wanted;
8112 saved_nocode_wanted = nocode_wanted;
8113 nocode_wanted = 1;
8114 gexpr();
8115 *type = vtop->type;
8116 vpop();
8117 nocode_wanted = saved_nocode_wanted;
8120 /* parse a unary expression and return its type without any side
8121 effect. */
8122 static void unary_type(CType *type)
8124 int a;
8126 a = nocode_wanted;
8127 nocode_wanted = 1;
8128 unary();
8129 *type = vtop->type;
8130 vpop();
8131 nocode_wanted = a;
8134 /* parse a constant expression and return value in vtop. */
8135 static void expr_const1(void)
8137 int a;
8138 a = const_wanted;
8139 const_wanted = 1;
8140 expr_eq();
8141 const_wanted = a;
8144 /* parse an integer constant and return its value. */
8145 static int expr_const(void)
8147 int c;
8148 expr_const1();
8149 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
8150 expect("constant expression");
8151 c = vtop->c.i;
8152 vpop();
8153 return c;
8156 /* return the label token if current token is a label, otherwise
8157 return zero */
8158 static int is_label(void)
8160 int last_tok;
8162 /* fast test first */
8163 if (tok < TOK_UIDENT)
8164 return 0;
8165 /* no need to save tokc because tok is an identifier */
8166 last_tok = tok;
8167 next();
8168 if (tok == ':') {
8169 next();
8170 return last_tok;
8171 } else {
8172 unget_tok(last_tok);
8173 return 0;
8177 static void block(int *bsym, int *csym, int *case_sym, int *def_sym,
8178 int case_reg, int is_expr)
8180 int a, b, c, d;
8181 Sym *s;
8183 /* generate line number info */
8184 if (do_debug &&
8185 (last_line_num != file->line_num || last_ind != ind)) {
8186 put_stabn(N_SLINE, 0, file->line_num, ind - func_ind);
8187 last_ind = ind;
8188 last_line_num = file->line_num;
8191 if (is_expr) {
8192 /* default return value is (void) */
8193 vpushi(0);
8194 vtop->type.t = VT_VOID;
8197 if (tok == TOK_IF) {
8198 /* if test */
8199 next();
8200 skip('(');
8201 gexpr();
8202 skip(')');
8203 a = gtst(1, 0);
8204 block(bsym, csym, case_sym, def_sym, case_reg, 0);
8205 c = tok;
8206 if (c == TOK_ELSE) {
8207 next();
8208 d = gjmp(0);
8209 gsym(a);
8210 block(bsym, csym, case_sym, def_sym, case_reg, 0);
8211 gsym(d); /* patch else jmp */
8212 } else
8213 gsym(a);
8214 } else if (tok == TOK_WHILE) {
8215 next();
8216 d = ind;
8217 skip('(');
8218 gexpr();
8219 skip(')');
8220 a = gtst(1, 0);
8221 b = 0;
8222 block(&a, &b, case_sym, def_sym, case_reg, 0);
8223 gjmp_addr(d);
8224 gsym(a);
8225 gsym_addr(b, d);
8226 } else if (tok == '{') {
8227 Sym *llabel;
8229 next();
8230 /* record local declaration stack position */
8231 s = local_stack;
8232 llabel = local_label_stack;
8233 /* handle local labels declarations */
8234 if (tok == TOK_LABEL) {
8235 next();
8236 for(;;) {
8237 if (tok < TOK_UIDENT)
8238 expect("label identifier");
8239 label_push(&local_label_stack, tok, LABEL_DECLARED);
8240 next();
8241 if (tok == ',') {
8242 next();
8243 } else {
8244 skip(';');
8245 break;
8249 while (tok != '}') {
8250 decl(VT_LOCAL);
8251 if (tok != '}') {
8252 if (is_expr)
8253 vpop();
8254 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
8257 /* pop locally defined labels */
8258 label_pop(&local_label_stack, llabel);
8259 /* pop locally defined symbols */
8260 sym_pop(&local_stack, s);
8261 next();
8262 } else if (tok == TOK_RETURN) {
8263 next();
8264 if (tok != ';') {
8265 gexpr();
8266 gen_assign_cast(&func_vt);
8267 if ((func_vt.t & VT_BTYPE) == VT_STRUCT) {
8268 CType type;
8269 /* if returning structure, must copy it to implicit
8270 first pointer arg location */
8271 #ifdef TCC_ARM_EABI
8272 int align, size;
8273 size = type_size(&func_vt,&align);
8274 if(size <= 4)
8276 if((vtop->r != (VT_LOCAL | VT_LVAL) || (vtop->c.i & 3))
8277 && (align & 3))
8279 int addr;
8280 loc = (loc - size) & -4;
8281 addr = loc;
8282 type = func_vt;
8283 vset(&type, VT_LOCAL | VT_LVAL, addr);
8284 vswap();
8285 vstore();
8286 vset(&int_type, VT_LOCAL | VT_LVAL, addr);
8288 vtop->type = int_type;
8289 gv(RC_IRET);
8290 } else {
8291 #endif
8292 type = func_vt;
8293 mk_pointer(&type);
8294 vset(&type, VT_LOCAL | VT_LVAL, func_vc);
8295 indir();
8296 vswap();
8297 /* copy structure value to pointer */
8298 vstore();
8299 #ifdef TCC_ARM_EABI
8301 #endif
8302 } else if (is_float(func_vt.t)) {
8303 gv(RC_FRET);
8304 } else {
8305 gv(RC_IRET);
8307 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
8309 skip(';');
8310 rsym = gjmp(rsym); /* jmp */
8311 } else if (tok == TOK_BREAK) {
8312 /* compute jump */
8313 if (!bsym)
8314 error("cannot break");
8315 *bsym = gjmp(*bsym);
8316 next();
8317 skip(';');
8318 } else if (tok == TOK_CONTINUE) {
8319 /* compute jump */
8320 if (!csym)
8321 error("cannot continue");
8322 *csym = gjmp(*csym);
8323 next();
8324 skip(';');
8325 } else if (tok == TOK_FOR) {
8326 int e;
8327 next();
8328 skip('(');
8329 if (tok != ';') {
8330 gexpr();
8331 vpop();
8333 skip(';');
8334 d = ind;
8335 c = ind;
8336 a = 0;
8337 b = 0;
8338 if (tok != ';') {
8339 gexpr();
8340 a = gtst(1, 0);
8342 skip(';');
8343 if (tok != ')') {
8344 e = gjmp(0);
8345 c = ind;
8346 gexpr();
8347 vpop();
8348 gjmp_addr(d);
8349 gsym(e);
8351 skip(')');
8352 block(&a, &b, case_sym, def_sym, case_reg, 0);
8353 gjmp_addr(c);
8354 gsym(a);
8355 gsym_addr(b, c);
8356 } else
8357 if (tok == TOK_DO) {
8358 next();
8359 a = 0;
8360 b = 0;
8361 d = ind;
8362 block(&a, &b, case_sym, def_sym, case_reg, 0);
8363 skip(TOK_WHILE);
8364 skip('(');
8365 gsym(b);
8366 gexpr();
8367 c = gtst(0, 0);
8368 gsym_addr(c, d);
8369 skip(')');
8370 gsym(a);
8371 skip(';');
8372 } else
8373 if (tok == TOK_SWITCH) {
8374 next();
8375 skip('(');
8376 gexpr();
8377 /* XXX: other types than integer */
8378 case_reg = gv(RC_INT);
8379 vpop();
8380 skip(')');
8381 a = 0;
8382 b = gjmp(0); /* jump to first case */
8383 c = 0;
8384 block(&a, csym, &b, &c, case_reg, 0);
8385 /* if no default, jmp after switch */
8386 if (c == 0)
8387 c = ind;
8388 /* default label */
8389 gsym_addr(b, c);
8390 /* break label */
8391 gsym(a);
8392 } else
8393 if (tok == TOK_CASE) {
8394 int v1, v2;
8395 if (!case_sym)
8396 expect("switch");
8397 next();
8398 v1 = expr_const();
8399 v2 = v1;
8400 if (gnu_ext && tok == TOK_DOTS) {
8401 next();
8402 v2 = expr_const();
8403 if (v2 < v1)
8404 warning("empty case range");
8406 /* since a case is like a label, we must skip it with a jmp */
8407 b = gjmp(0);
8408 gsym(*case_sym);
8409 vseti(case_reg, 0);
8410 vpushi(v1);
8411 if (v1 == v2) {
8412 gen_op(TOK_EQ);
8413 *case_sym = gtst(1, 0);
8414 } else {
8415 gen_op(TOK_GE);
8416 *case_sym = gtst(1, 0);
8417 vseti(case_reg, 0);
8418 vpushi(v2);
8419 gen_op(TOK_LE);
8420 *case_sym = gtst(1, *case_sym);
8422 gsym(b);
8423 skip(':');
8424 is_expr = 0;
8425 goto block_after_label;
8426 } else
8427 if (tok == TOK_DEFAULT) {
8428 next();
8429 skip(':');
8430 if (!def_sym)
8431 expect("switch");
8432 if (*def_sym)
8433 error("too many 'default'");
8434 *def_sym = ind;
8435 is_expr = 0;
8436 goto block_after_label;
8437 } else
8438 if (tok == TOK_GOTO) {
8439 next();
8440 if (tok == '*' && gnu_ext) {
8441 /* computed goto */
8442 next();
8443 gexpr();
8444 if ((vtop->type.t & VT_BTYPE) != VT_PTR)
8445 expect("pointer");
8446 ggoto();
8447 } else if (tok >= TOK_UIDENT) {
8448 s = label_find(tok);
8449 /* put forward definition if needed */
8450 if (!s) {
8451 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
8452 } else {
8453 if (s->r == LABEL_DECLARED)
8454 s->r = LABEL_FORWARD;
8456 /* label already defined */
8457 if (s->r & LABEL_FORWARD)
8458 s->next = (void *)gjmp((long)s->next);
8459 else
8460 gjmp_addr((long)s->next);
8461 next();
8462 } else {
8463 expect("label identifier");
8465 skip(';');
8466 } else if (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3) {
8467 asm_instr();
8468 } else {
8469 b = is_label();
8470 if (b) {
8471 /* label case */
8472 s = label_find(b);
8473 if (s) {
8474 if (s->r == LABEL_DEFINED)
8475 error("duplicate label '%s'", get_tok_str(s->v, NULL));
8476 gsym((long)s->next);
8477 s->r = LABEL_DEFINED;
8478 } else {
8479 s = label_push(&global_label_stack, b, LABEL_DEFINED);
8481 s->next = (void *)ind;
8482 /* we accept this, but it is a mistake */
8483 block_after_label:
8484 if (tok == '}') {
8485 warning("deprecated use of label at end of compound statement");
8486 } else {
8487 if (is_expr)
8488 vpop();
8489 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
8491 } else {
8492 /* expression case */
8493 if (tok != ';') {
8494 if (is_expr) {
8495 vpop();
8496 gexpr();
8497 } else {
8498 gexpr();
8499 vpop();
8502 skip(';');
8507 /* t is the array or struct type. c is the array or struct
8508 address. cur_index/cur_field is the pointer to the current
8509 value. 'size_only' is true if only size info is needed (only used
8510 in arrays) */
8511 static void decl_designator(CType *type, Section *sec, unsigned long c,
8512 int *cur_index, Sym **cur_field,
8513 int size_only)
8515 Sym *s, *f;
8516 int notfirst, index, index_last, align, l, nb_elems, elem_size;
8517 CType type1;
8519 notfirst = 0;
8520 elem_size = 0;
8521 nb_elems = 1;
8522 if (gnu_ext && (l = is_label()) != 0)
8523 goto struct_field;
8524 while (tok == '[' || tok == '.') {
8525 if (tok == '[') {
8526 if (!(type->t & VT_ARRAY))
8527 expect("array type");
8528 s = type->ref;
8529 next();
8530 index = expr_const();
8531 if (index < 0 || (s->c >= 0 && index >= s->c))
8532 expect("invalid index");
8533 if (tok == TOK_DOTS && gnu_ext) {
8534 next();
8535 index_last = expr_const();
8536 if (index_last < 0 ||
8537 (s->c >= 0 && index_last >= s->c) ||
8538 index_last < index)
8539 expect("invalid index");
8540 } else {
8541 index_last = index;
8543 skip(']');
8544 if (!notfirst)
8545 *cur_index = index_last;
8546 type = pointed_type(type);
8547 elem_size = type_size(type, &align);
8548 c += index * elem_size;
8549 /* NOTE: we only support ranges for last designator */
8550 nb_elems = index_last - index + 1;
8551 if (nb_elems != 1) {
8552 notfirst = 1;
8553 break;
8555 } else {
8556 next();
8557 l = tok;
8558 next();
8559 struct_field:
8560 if ((type->t & VT_BTYPE) != VT_STRUCT)
8561 expect("struct/union type");
8562 s = type->ref;
8563 l |= SYM_FIELD;
8564 f = s->next;
8565 while (f) {
8566 if (f->v == l)
8567 break;
8568 f = f->next;
8570 if (!f)
8571 expect("field");
8572 if (!notfirst)
8573 *cur_field = f;
8574 /* XXX: fix this mess by using explicit storage field */
8575 type1 = f->type;
8576 type1.t |= (type->t & ~VT_TYPE);
8577 type = &type1;
8578 c += f->c;
8580 notfirst = 1;
8582 if (notfirst) {
8583 if (tok == '=') {
8584 next();
8585 } else {
8586 if (!gnu_ext)
8587 expect("=");
8589 } else {
8590 if (type->t & VT_ARRAY) {
8591 index = *cur_index;
8592 type = pointed_type(type);
8593 c += index * type_size(type, &align);
8594 } else {
8595 f = *cur_field;
8596 if (!f)
8597 error("too many field init");
8598 /* XXX: fix this mess by using explicit storage field */
8599 type1 = f->type;
8600 type1.t |= (type->t & ~VT_TYPE);
8601 type = &type1;
8602 c += f->c;
8605 decl_initializer(type, sec, c, 0, size_only);
8607 /* XXX: make it more general */
8608 if (!size_only && nb_elems > 1) {
8609 unsigned long c_end;
8610 uint8_t *src, *dst;
8611 int i;
8613 if (!sec)
8614 error("range init not supported yet for dynamic storage");
8615 c_end = c + nb_elems * elem_size;
8616 if (c_end > sec->data_allocated)
8617 section_realloc(sec, c_end);
8618 src = sec->data + c;
8619 dst = src;
8620 for(i = 1; i < nb_elems; i++) {
8621 dst += elem_size;
8622 memcpy(dst, src, elem_size);
8627 #define EXPR_VAL 0
8628 #define EXPR_CONST 1
8629 #define EXPR_ANY 2
8631 /* store a value or an expression directly in global data or in local array */
8632 static void init_putv(CType *type, Section *sec, unsigned long c,
8633 int v, int expr_type)
8635 int saved_global_expr, bt, bit_pos, bit_size;
8636 void *ptr;
8637 unsigned long long bit_mask;
8638 CType dtype;
8640 switch(expr_type) {
8641 case EXPR_VAL:
8642 vpushi(v);
8643 break;
8644 case EXPR_CONST:
8645 /* compound literals must be allocated globally in this case */
8646 saved_global_expr = global_expr;
8647 global_expr = 1;
8648 expr_const1();
8649 global_expr = saved_global_expr;
8650 /* NOTE: symbols are accepted */
8651 if ((vtop->r & (VT_VALMASK | VT_LVAL)) != VT_CONST)
8652 error("initializer element is not constant");
8653 break;
8654 case EXPR_ANY:
8655 expr_eq();
8656 break;
8659 dtype = *type;
8660 dtype.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
8662 if (sec) {
8663 /* XXX: not portable */
8664 /* XXX: generate error if incorrect relocation */
8665 gen_assign_cast(&dtype);
8666 bt = type->t & VT_BTYPE;
8667 ptr = sec->data + c;
8668 /* XXX: make code faster ? */
8669 if (!(type->t & VT_BITFIELD)) {
8670 bit_pos = 0;
8671 bit_size = 32;
8672 bit_mask = -1LL;
8673 } else {
8674 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
8675 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
8676 bit_mask = (1LL << bit_size) - 1;
8678 if ((vtop->r & VT_SYM) &&
8679 (bt == VT_BYTE ||
8680 bt == VT_SHORT ||
8681 bt == VT_DOUBLE ||
8682 bt == VT_LDOUBLE ||
8683 bt == VT_LLONG ||
8684 (bt == VT_INT && bit_size != 32)))
8685 error("initializer element is not computable at load time");
8686 switch(bt) {
8687 case VT_BYTE:
8688 *(char *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8689 break;
8690 case VT_SHORT:
8691 *(short *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8692 break;
8693 case VT_DOUBLE:
8694 *(double *)ptr = vtop->c.d;
8695 break;
8696 case VT_LDOUBLE:
8697 *(long double *)ptr = vtop->c.ld;
8698 break;
8699 case VT_LLONG:
8700 *(long long *)ptr |= (vtop->c.ll & bit_mask) << bit_pos;
8701 break;
8702 default:
8703 if (vtop->r & VT_SYM) {
8704 greloc(sec, vtop->sym, c, R_DATA_32);
8706 *(int *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8707 break;
8709 vtop--;
8710 } else {
8711 vset(&dtype, VT_LOCAL|VT_LVAL, c);
8712 vswap();
8713 vstore();
8714 vpop();
8718 /* put zeros for variable based init */
8719 static void init_putz(CType *t, Section *sec, unsigned long c, int size)
8721 if (sec) {
8722 /* nothing to do because globals are already set to zero */
8723 } else {
8724 vpush_global_sym(&func_old_type, TOK_memset);
8725 vseti(VT_LOCAL, c);
8726 vpushi(0);
8727 vpushi(size);
8728 gfunc_call(3);
8732 /* 't' contains the type and storage info. 'c' is the offset of the
8733 object in section 'sec'. If 'sec' is NULL, it means stack based
8734 allocation. 'first' is true if array '{' must be read (multi
8735 dimension implicit array init handling). 'size_only' is true if
8736 size only evaluation is wanted (only for arrays). */
8737 static void decl_initializer(CType *type, Section *sec, unsigned long c,
8738 int first, int size_only)
8740 int index, array_length, n, no_oblock, nb, parlevel, i;
8741 int size1, align1, expr_type;
8742 Sym *s, *f;
8743 CType *t1;
8745 if (type->t & VT_ARRAY) {
8746 s = type->ref;
8747 n = s->c;
8748 array_length = 0;
8749 t1 = pointed_type(type);
8750 size1 = type_size(t1, &align1);
8752 no_oblock = 1;
8753 if ((first && tok != TOK_LSTR && tok != TOK_STR) ||
8754 tok == '{') {
8755 skip('{');
8756 no_oblock = 0;
8759 /* only parse strings here if correct type (otherwise: handle
8760 them as ((w)char *) expressions */
8761 if ((tok == TOK_LSTR &&
8762 #ifdef TCC_TARGET_PE
8763 (t1->t & VT_BTYPE) == VT_SHORT && (t1->t & VT_UNSIGNED)
8764 #else
8765 (t1->t & VT_BTYPE) == VT_INT
8766 #endif
8767 ) || (tok == TOK_STR && (t1->t & VT_BTYPE) == VT_BYTE)) {
8768 while (tok == TOK_STR || tok == TOK_LSTR) {
8769 int cstr_len, ch;
8770 CString *cstr;
8772 cstr = tokc.cstr;
8773 /* compute maximum number of chars wanted */
8774 if (tok == TOK_STR)
8775 cstr_len = cstr->size;
8776 else
8777 cstr_len = cstr->size / sizeof(nwchar_t);
8778 cstr_len--;
8779 nb = cstr_len;
8780 if (n >= 0 && nb > (n - array_length))
8781 nb = n - array_length;
8782 if (!size_only) {
8783 if (cstr_len > nb)
8784 warning("initializer-string for array is too long");
8785 /* in order to go faster for common case (char
8786 string in global variable, we handle it
8787 specifically */
8788 if (sec && tok == TOK_STR && size1 == 1) {
8789 memcpy(sec->data + c + array_length, cstr->data, nb);
8790 } else {
8791 for(i=0;i<nb;i++) {
8792 if (tok == TOK_STR)
8793 ch = ((unsigned char *)cstr->data)[i];
8794 else
8795 ch = ((nwchar_t *)cstr->data)[i];
8796 init_putv(t1, sec, c + (array_length + i) * size1,
8797 ch, EXPR_VAL);
8801 array_length += nb;
8802 next();
8804 /* only add trailing zero if enough storage (no
8805 warning in this case since it is standard) */
8806 if (n < 0 || array_length < n) {
8807 if (!size_only) {
8808 init_putv(t1, sec, c + (array_length * size1), 0, EXPR_VAL);
8810 array_length++;
8812 } else {
8813 index = 0;
8814 while (tok != '}') {
8815 decl_designator(type, sec, c, &index, NULL, size_only);
8816 if (n >= 0 && index >= n)
8817 error("index too large");
8818 /* must put zero in holes (note that doing it that way
8819 ensures that it even works with designators) */
8820 if (!size_only && array_length < index) {
8821 init_putz(t1, sec, c + array_length * size1,
8822 (index - array_length) * size1);
8824 index++;
8825 if (index > array_length)
8826 array_length = index;
8827 /* special test for multi dimensional arrays (may not
8828 be strictly correct if designators are used at the
8829 same time) */
8830 if (index >= n && no_oblock)
8831 break;
8832 if (tok == '}')
8833 break;
8834 skip(',');
8837 if (!no_oblock)
8838 skip('}');
8839 /* put zeros at the end */
8840 if (!size_only && n >= 0 && array_length < n) {
8841 init_putz(t1, sec, c + array_length * size1,
8842 (n - array_length) * size1);
8844 /* patch type size if needed */
8845 if (n < 0)
8846 s->c = array_length;
8847 } else if ((type->t & VT_BTYPE) == VT_STRUCT &&
8848 (sec || !first || tok == '{')) {
8849 int par_count;
8851 /* NOTE: the previous test is a specific case for automatic
8852 struct/union init */
8853 /* XXX: union needs only one init */
8855 /* XXX: this test is incorrect for local initializers
8856 beginning with ( without {. It would be much more difficult
8857 to do it correctly (ideally, the expression parser should
8858 be used in all cases) */
8859 par_count = 0;
8860 if (tok == '(') {
8861 AttributeDef ad1;
8862 CType type1;
8863 next();
8864 while (tok == '(') {
8865 par_count++;
8866 next();
8868 if (!parse_btype(&type1, &ad1))
8869 expect("cast");
8870 type_decl(&type1, &ad1, &n, TYPE_ABSTRACT);
8871 #if 0
8872 if (!is_assignable_types(type, &type1))
8873 error("invalid type for cast");
8874 #endif
8875 skip(')');
8877 no_oblock = 1;
8878 if (first || tok == '{') {
8879 skip('{');
8880 no_oblock = 0;
8882 s = type->ref;
8883 f = s->next;
8884 array_length = 0;
8885 index = 0;
8886 n = s->c;
8887 while (tok != '}') {
8888 decl_designator(type, sec, c, NULL, &f, size_only);
8889 index = f->c;
8890 if (!size_only && array_length < index) {
8891 init_putz(type, sec, c + array_length,
8892 index - array_length);
8894 index = index + type_size(&f->type, &align1);
8895 if (index > array_length)
8896 array_length = index;
8897 f = f->next;
8898 if (no_oblock && f == NULL)
8899 break;
8900 if (tok == '}')
8901 break;
8902 skip(',');
8904 /* put zeros at the end */
8905 if (!size_only && array_length < n) {
8906 init_putz(type, sec, c + array_length,
8907 n - array_length);
8909 if (!no_oblock)
8910 skip('}');
8911 while (par_count) {
8912 skip(')');
8913 par_count--;
8915 } else if (tok == '{') {
8916 next();
8917 decl_initializer(type, sec, c, first, size_only);
8918 skip('}');
8919 } else if (size_only) {
8920 /* just skip expression */
8921 parlevel = 0;
8922 while ((parlevel > 0 || (tok != '}' && tok != ',')) &&
8923 tok != -1) {
8924 if (tok == '(')
8925 parlevel++;
8926 else if (tok == ')')
8927 parlevel--;
8928 next();
8930 } else {
8931 /* currently, we always use constant expression for globals
8932 (may change for scripting case) */
8933 expr_type = EXPR_CONST;
8934 if (!sec)
8935 expr_type = EXPR_ANY;
8936 init_putv(type, sec, c, 0, expr_type);
8940 /* parse an initializer for type 't' if 'has_init' is non zero, and
8941 allocate space in local or global data space ('r' is either
8942 VT_LOCAL or VT_CONST). If 'v' is non zero, then an associated
8943 variable 'v' of scope 'scope' is declared before initializers are
8944 parsed. If 'v' is zero, then a reference to the new object is put
8945 in the value stack. If 'has_init' is 2, a special parsing is done
8946 to handle string constants. */
8947 static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r,
8948 int has_init, int v, int scope)
8950 int size, align, addr, data_offset;
8951 int level;
8952 ParseState saved_parse_state;
8953 TokenString init_str;
8954 Section *sec;
8956 size = type_size(type, &align);
8957 /* If unknown size, we must evaluate it before
8958 evaluating initializers because
8959 initializers can generate global data too
8960 (e.g. string pointers or ISOC99 compound
8961 literals). It also simplifies local
8962 initializers handling */
8963 tok_str_new(&init_str);
8964 if (size < 0) {
8965 if (!has_init)
8966 error("unknown type size");
8967 /* get all init string */
8968 if (has_init == 2) {
8969 /* only get strings */
8970 while (tok == TOK_STR || tok == TOK_LSTR) {
8971 tok_str_add_tok(&init_str);
8972 next();
8974 } else {
8975 level = 0;
8976 while (level > 0 || (tok != ',' && tok != ';')) {
8977 if (tok < 0)
8978 error("unexpected end of file in initializer");
8979 tok_str_add_tok(&init_str);
8980 if (tok == '{')
8981 level++;
8982 else if (tok == '}') {
8983 if (level == 0)
8984 break;
8985 level--;
8987 next();
8990 tok_str_add(&init_str, -1);
8991 tok_str_add(&init_str, 0);
8993 /* compute size */
8994 save_parse_state(&saved_parse_state);
8996 macro_ptr = init_str.str;
8997 next();
8998 decl_initializer(type, NULL, 0, 1, 1);
8999 /* prepare second initializer parsing */
9000 macro_ptr = init_str.str;
9001 next();
9003 /* if still unknown size, error */
9004 size = type_size(type, &align);
9005 if (size < 0)
9006 error("unknown type size");
9008 /* take into account specified alignment if bigger */
9009 if (ad->aligned) {
9010 if (ad->aligned > align)
9011 align = ad->aligned;
9012 } else if (ad->packed) {
9013 align = 1;
9015 if ((r & VT_VALMASK) == VT_LOCAL) {
9016 sec = NULL;
9017 if (do_bounds_check && (type->t & VT_ARRAY))
9018 loc--;
9019 loc = (loc - size) & -align;
9020 addr = loc;
9021 /* handles bounds */
9022 /* XXX: currently, since we do only one pass, we cannot track
9023 '&' operators, so we add only arrays */
9024 if (do_bounds_check && (type->t & VT_ARRAY)) {
9025 unsigned long *bounds_ptr;
9026 /* add padding between regions */
9027 loc--;
9028 /* then add local bound info */
9029 bounds_ptr = section_ptr_add(lbounds_section, 2 * sizeof(unsigned long));
9030 bounds_ptr[0] = addr;
9031 bounds_ptr[1] = size;
9033 if (v) {
9034 /* local variable */
9035 sym_push(v, type, r, addr);
9036 } else {
9037 /* push local reference */
9038 vset(type, r, addr);
9040 } else {
9041 Sym *sym;
9043 sym = NULL;
9044 if (v && scope == VT_CONST) {
9045 /* see if the symbol was already defined */
9046 sym = sym_find(v);
9047 if (sym) {
9048 if (!is_compatible_types(&sym->type, type))
9049 error("incompatible types for redefinition of '%s'",
9050 get_tok_str(v, NULL));
9051 if (sym->type.t & VT_EXTERN) {
9052 /* if the variable is extern, it was not allocated */
9053 sym->type.t &= ~VT_EXTERN;
9054 /* set array size if it was ommited in extern
9055 declaration */
9056 if ((sym->type.t & VT_ARRAY) &&
9057 sym->type.ref->c < 0 &&
9058 type->ref->c >= 0)
9059 sym->type.ref->c = type->ref->c;
9060 } else {
9061 /* we accept several definitions of the same
9062 global variable. this is tricky, because we
9063 must play with the SHN_COMMON type of the symbol */
9064 /* XXX: should check if the variable was already
9065 initialized. It is incorrect to initialized it
9066 twice */
9067 /* no init data, we won't add more to the symbol */
9068 if (!has_init)
9069 goto no_alloc;
9074 /* allocate symbol in corresponding section */
9075 sec = ad->section;
9076 if (!sec) {
9077 if (has_init)
9078 sec = data_section;
9079 else if (tcc_state->nocommon)
9080 sec = bss_section;
9082 if (sec) {
9083 data_offset = sec->data_offset;
9084 data_offset = (data_offset + align - 1) & -align;
9085 addr = data_offset;
9086 /* very important to increment global pointer at this time
9087 because initializers themselves can create new initializers */
9088 data_offset += size;
9089 /* add padding if bound check */
9090 if (do_bounds_check)
9091 data_offset++;
9092 sec->data_offset = data_offset;
9093 /* allocate section space to put the data */
9094 if (sec->sh_type != SHT_NOBITS &&
9095 data_offset > sec->data_allocated)
9096 section_realloc(sec, data_offset);
9097 /* align section if needed */
9098 if (align > sec->sh_addralign)
9099 sec->sh_addralign = align;
9100 } else {
9101 addr = 0; /* avoid warning */
9104 if (v) {
9105 if (scope != VT_CONST || !sym) {
9106 sym = sym_push(v, type, r | VT_SYM, 0);
9108 /* update symbol definition */
9109 if (sec) {
9110 put_extern_sym(sym, sec, addr, size);
9111 } else {
9112 Elf32_Sym *esym;
9113 /* put a common area */
9114 put_extern_sym(sym, NULL, align, size);
9115 /* XXX: find a nicer way */
9116 esym = &((Elf32_Sym *)symtab_section->data)[sym->c];
9117 esym->st_shndx = SHN_COMMON;
9119 } else {
9120 CValue cval;
9122 /* push global reference */
9123 sym = get_sym_ref(type, sec, addr, size);
9124 cval.ul = 0;
9125 vsetc(type, VT_CONST | VT_SYM, &cval);
9126 vtop->sym = sym;
9129 /* handles bounds now because the symbol must be defined
9130 before for the relocation */
9131 if (do_bounds_check) {
9132 unsigned long *bounds_ptr;
9134 greloc(bounds_section, sym, bounds_section->data_offset, R_DATA_32);
9135 /* then add global bound info */
9136 bounds_ptr = section_ptr_add(bounds_section, 2 * sizeof(long));
9137 bounds_ptr[0] = 0; /* relocated */
9138 bounds_ptr[1] = size;
9141 if (has_init) {
9142 decl_initializer(type, sec, addr, 1, 0);
9143 /* restore parse state if needed */
9144 if (init_str.str) {
9145 tok_str_free(init_str.str);
9146 restore_parse_state(&saved_parse_state);
9149 no_alloc: ;
9152 void put_func_debug(Sym *sym)
9154 char buf[512];
9156 /* stabs info */
9157 /* XXX: we put here a dummy type */
9158 snprintf(buf, sizeof(buf), "%s:%c1",
9159 funcname, sym->type.t & VT_STATIC ? 'f' : 'F');
9160 put_stabs_r(buf, N_FUN, 0, file->line_num, 0,
9161 cur_text_section, sym->c);
9162 /* //gr gdb wants a line at the function */
9163 put_stabn(N_SLINE, 0, file->line_num, 0);
9164 last_ind = 0;
9165 last_line_num = 0;
9168 /* parse an old style function declaration list */
9169 /* XXX: check multiple parameter */
9170 static void func_decl_list(Sym *func_sym)
9172 AttributeDef ad;
9173 int v;
9174 Sym *s;
9175 CType btype, type;
9177 /* parse each declaration */
9178 while (tok != '{' && tok != ';' && tok != ',' && tok != TOK_EOF) {
9179 if (!parse_btype(&btype, &ad))
9180 expect("declaration list");
9181 if (((btype.t & VT_BTYPE) == VT_ENUM ||
9182 (btype.t & VT_BTYPE) == VT_STRUCT) &&
9183 tok == ';') {
9184 /* we accept no variable after */
9185 } else {
9186 for(;;) {
9187 type = btype;
9188 type_decl(&type, &ad, &v, TYPE_DIRECT);
9189 /* find parameter in function parameter list */
9190 s = func_sym->next;
9191 while (s != NULL) {
9192 if ((s->v & ~SYM_FIELD) == v)
9193 goto found;
9194 s = s->next;
9196 error("declaration for parameter '%s' but no such parameter",
9197 get_tok_str(v, NULL));
9198 found:
9199 /* check that no storage specifier except 'register' was given */
9200 if (type.t & VT_STORAGE)
9201 error("storage class specified for '%s'", get_tok_str(v, NULL));
9202 convert_parameter_type(&type);
9203 /* we can add the type (NOTE: it could be local to the function) */
9204 s->type = type;
9205 /* accept other parameters */
9206 if (tok == ',')
9207 next();
9208 else
9209 break;
9212 skip(';');
9216 /* parse a function defined by symbol 'sym' and generate its code in
9217 'cur_text_section' */
9218 static void gen_function(Sym *sym)
9220 int saved_nocode_wanted = nocode_wanted;
9221 nocode_wanted = 0;
9222 ind = cur_text_section->data_offset;
9223 /* NOTE: we patch the symbol size later */
9224 put_extern_sym(sym, cur_text_section, ind, 0);
9225 funcname = get_tok_str(sym->v, NULL);
9226 func_ind = ind;
9227 /* put debug symbol */
9228 if (do_debug)
9229 put_func_debug(sym);
9230 /* push a dummy symbol to enable local sym storage */
9231 sym_push2(&local_stack, SYM_FIELD, 0, 0);
9232 gfunc_prolog(&sym->type);
9233 rsym = 0;
9234 block(NULL, NULL, NULL, NULL, 0, 0);
9235 gsym(rsym);
9236 gfunc_epilog();
9237 cur_text_section->data_offset = ind;
9238 label_pop(&global_label_stack, NULL);
9239 sym_pop(&local_stack, NULL); /* reset local stack */
9240 /* end of function */
9241 /* patch symbol size */
9242 ((Elf32_Sym *)symtab_section->data)[sym->c].st_size =
9243 ind - func_ind;
9244 if (do_debug) {
9245 put_stabn(N_FUN, 0, 0, ind - func_ind);
9247 funcname = ""; /* for safety */
9248 func_vt.t = VT_VOID; /* for safety */
9249 ind = 0; /* for safety */
9250 nocode_wanted = saved_nocode_wanted;
9253 static void gen_inline_functions(void)
9255 Sym *sym;
9256 CType *type;
9257 int *str, inline_generated;
9259 /* iterate while inline function are referenced */
9260 for(;;) {
9261 inline_generated = 0;
9262 for(sym = global_stack; sym != NULL; sym = sym->prev) {
9263 type = &sym->type;
9264 if (((type->t & VT_BTYPE) == VT_FUNC) &&
9265 (type->t & (VT_STATIC | VT_INLINE)) ==
9266 (VT_STATIC | VT_INLINE) &&
9267 sym->c != 0) {
9268 /* the function was used: generate its code and
9269 convert it to a normal function */
9270 str = INLINE_DEF(sym->r);
9271 sym->r = VT_SYM | VT_CONST;
9272 sym->type.t &= ~VT_INLINE;
9274 macro_ptr = str;
9275 next();
9276 cur_text_section = text_section;
9277 gen_function(sym);
9278 macro_ptr = NULL; /* fail safe */
9280 tok_str_free(str);
9281 inline_generated = 1;
9284 if (!inline_generated)
9285 break;
9288 /* free all remaining inline function tokens */
9289 for(sym = global_stack; sym != NULL; sym = sym->prev) {
9290 type = &sym->type;
9291 if (((type->t & VT_BTYPE) == VT_FUNC) &&
9292 (type->t & (VT_STATIC | VT_INLINE)) ==
9293 (VT_STATIC | VT_INLINE)) {
9294 //gr printf("sym %d %s\n", sym->r, get_tok_str(sym->v, NULL));
9295 if (sym->r == (VT_SYM | VT_CONST)) //gr beware!
9296 continue;
9297 str = INLINE_DEF(sym->r);
9298 tok_str_free(str);
9299 sym->r = 0; /* fail safe */
9304 /* 'l' is VT_LOCAL or VT_CONST to define default storage type */
9305 static void decl(int l)
9307 int v, has_init, r;
9308 CType type, btype;
9309 Sym *sym;
9310 AttributeDef ad;
9312 while (1) {
9313 if (!parse_btype(&btype, &ad)) {
9314 /* skip redundant ';' */
9315 /* XXX: find more elegant solution */
9316 if (tok == ';') {
9317 next();
9318 continue;
9320 if (l == VT_CONST &&
9321 (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
9322 /* global asm block */
9323 asm_global_instr();
9324 continue;
9326 /* special test for old K&R protos without explicit int
9327 type. Only accepted when defining global data */
9328 if (l == VT_LOCAL || tok < TOK_DEFINE)
9329 break;
9330 btype.t = VT_INT;
9332 if (((btype.t & VT_BTYPE) == VT_ENUM ||
9333 (btype.t & VT_BTYPE) == VT_STRUCT) &&
9334 tok == ';') {
9335 /* we accept no variable after */
9336 next();
9337 continue;
9339 while (1) { /* iterate thru each declaration */
9340 type = btype;
9341 type_decl(&type, &ad, &v, TYPE_DIRECT);
9342 #if 0
9344 char buf[500];
9345 type_to_str(buf, sizeof(buf), t, get_tok_str(v, NULL));
9346 printf("type = '%s'\n", buf);
9348 #endif
9349 if ((type.t & VT_BTYPE) == VT_FUNC) {
9350 /* if old style function prototype, we accept a
9351 declaration list */
9352 sym = type.ref;
9353 if (sym->c == FUNC_OLD)
9354 func_decl_list(sym);
9357 if (tok == '{') {
9358 if (l == VT_LOCAL)
9359 error("cannot use local functions");
9360 if ((type.t & VT_BTYPE) != VT_FUNC)
9361 expect("function definition");
9363 /* reject abstract declarators in function definition */
9364 sym = type.ref;
9365 while ((sym = sym->next) != NULL)
9366 if (!(sym->v & ~SYM_FIELD))
9367 expect("identifier");
9369 /* XXX: cannot do better now: convert extern line to static inline */
9370 if ((type.t & (VT_EXTERN | VT_INLINE)) == (VT_EXTERN | VT_INLINE))
9371 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
9373 sym = sym_find(v);
9374 if (sym) {
9375 if ((sym->type.t & VT_BTYPE) != VT_FUNC)
9376 goto func_error1;
9377 /* specific case: if not func_call defined, we put
9378 the one of the prototype */
9379 /* XXX: should have default value */
9380 r = sym->type.ref->r;
9381 if (FUNC_CALL(r) != FUNC_CDECL
9382 && FUNC_CALL(type.ref->r) == FUNC_CDECL)
9383 FUNC_CALL(type.ref->r) = FUNC_CALL(r);
9384 if (FUNC_EXPORT(r))
9385 FUNC_EXPORT(type.ref->r) = 1;
9387 if (!is_compatible_types(&sym->type, &type)) {
9388 func_error1:
9389 error("incompatible types for redefinition of '%s'",
9390 get_tok_str(v, NULL));
9392 /* if symbol is already defined, then put complete type */
9393 sym->type = type;
9394 } else {
9395 /* put function symbol */
9396 sym = global_identifier_push(v, type.t, 0);
9397 sym->type.ref = type.ref;
9400 /* static inline functions are just recorded as a kind
9401 of macro. Their code will be emitted at the end of
9402 the compilation unit only if they are used */
9403 if ((type.t & (VT_INLINE | VT_STATIC)) ==
9404 (VT_INLINE | VT_STATIC)) {
9405 TokenString func_str;
9406 int block_level;
9408 tok_str_new(&func_str);
9410 block_level = 0;
9411 for(;;) {
9412 int t;
9413 if (tok == TOK_EOF)
9414 error("unexpected end of file");
9415 tok_str_add_tok(&func_str);
9416 t = tok;
9417 next();
9418 if (t == '{') {
9419 block_level++;
9420 } else if (t == '}') {
9421 block_level--;
9422 if (block_level == 0)
9423 break;
9426 tok_str_add(&func_str, -1);
9427 tok_str_add(&func_str, 0);
9428 INLINE_DEF(sym->r) = func_str.str;
9429 } else {
9430 /* compute text section */
9431 cur_text_section = ad.section;
9432 if (!cur_text_section)
9433 cur_text_section = text_section;
9434 sym->r = VT_SYM | VT_CONST;
9435 gen_function(sym);
9437 break;
9438 } else {
9439 if (btype.t & VT_TYPEDEF) {
9440 /* save typedefed type */
9441 /* XXX: test storage specifiers ? */
9442 sym = sym_push(v, &type, 0, 0);
9443 sym->type.t |= VT_TYPEDEF;
9444 } else if ((type.t & VT_BTYPE) == VT_FUNC) {
9445 /* external function definition */
9446 /* specific case for func_call attribute */
9447 if (ad.func_attr)
9448 type.ref->r = ad.func_attr;
9449 external_sym(v, &type, 0);
9450 } else {
9451 /* not lvalue if array */
9452 r = 0;
9453 if (!(type.t & VT_ARRAY))
9454 r |= lvalue_type(type.t);
9455 has_init = (tok == '=');
9456 if ((btype.t & VT_EXTERN) ||
9457 ((type.t & VT_ARRAY) && (type.t & VT_STATIC) &&
9458 !has_init && l == VT_CONST && type.ref->c < 0)) {
9459 /* external variable */
9460 /* NOTE: as GCC, uninitialized global static
9461 arrays of null size are considered as
9462 extern */
9463 external_sym(v, &type, r);
9464 } else {
9465 type.t |= (btype.t & VT_STATIC); /* Retain "static". */
9466 if (type.t & VT_STATIC)
9467 r |= VT_CONST;
9468 else
9469 r |= l;
9470 if (has_init)
9471 next();
9472 decl_initializer_alloc(&type, &ad, r,
9473 has_init, v, l);
9476 if (tok != ',') {
9477 skip(';');
9478 break;
9480 next();
9486 /* better than nothing, but needs extension to handle '-E' option
9487 correctly too */
9488 static void preprocess_init(TCCState *s1)
9490 s1->include_stack_ptr = s1->include_stack;
9491 /* XXX: move that before to avoid having to initialize
9492 file->ifdef_stack_ptr ? */
9493 s1->ifdef_stack_ptr = s1->ifdef_stack;
9494 file->ifdef_stack_ptr = s1->ifdef_stack_ptr;
9496 /* XXX: not ANSI compliant: bound checking says error */
9497 vtop = vstack - 1;
9498 s1->pack_stack[0] = 0;
9499 s1->pack_stack_ptr = s1->pack_stack;
9502 /* compile the C file opened in 'file'. Return non zero if errors. */
9503 static int tcc_compile(TCCState *s1)
9505 Sym *define_start;
9506 char buf[512];
9507 volatile int section_sym;
9509 #ifdef INC_DEBUG
9510 printf("%s: **** new file\n", file->filename);
9511 #endif
9512 preprocess_init(s1);
9514 funcname = "";
9515 anon_sym = SYM_FIRST_ANOM;
9517 /* file info: full path + filename */
9518 section_sym = 0; /* avoid warning */
9519 if (do_debug) {
9520 section_sym = put_elf_sym(symtab_section, 0, 0,
9521 ELF32_ST_INFO(STB_LOCAL, STT_SECTION), 0,
9522 text_section->sh_num, NULL);
9523 getcwd(buf, sizeof(buf));
9524 #ifdef _WIN32
9525 normalize_slashes(buf);
9526 #endif
9527 pstrcat(buf, sizeof(buf), "/");
9528 put_stabs_r(buf, N_SO, 0, 0,
9529 text_section->data_offset, text_section, section_sym);
9530 put_stabs_r(file->filename, N_SO, 0, 0,
9531 text_section->data_offset, text_section, section_sym);
9533 /* an elf symbol of type STT_FILE must be put so that STB_LOCAL
9534 symbols can be safely used */
9535 put_elf_sym(symtab_section, 0, 0,
9536 ELF32_ST_INFO(STB_LOCAL, STT_FILE), 0,
9537 SHN_ABS, file->filename);
9539 /* define some often used types */
9540 int_type.t = VT_INT;
9542 char_pointer_type.t = VT_BYTE;
9543 mk_pointer(&char_pointer_type);
9545 func_old_type.t = VT_FUNC;
9546 func_old_type.ref = sym_push(SYM_FIELD, &int_type, FUNC_CDECL, FUNC_OLD);
9548 #if defined(TCC_ARM_EABI) && defined(TCC_ARM_VFP)
9549 float_type.t = VT_FLOAT;
9550 double_type.t = VT_DOUBLE;
9552 func_float_type.t = VT_FUNC;
9553 func_float_type.ref = sym_push(SYM_FIELD, &float_type, FUNC_CDECL, FUNC_OLD);
9554 func_double_type.t = VT_FUNC;
9555 func_double_type.ref = sym_push(SYM_FIELD, &double_type, FUNC_CDECL, FUNC_OLD);
9556 #endif
9558 #if 0
9559 /* define 'void *alloca(unsigned int)' builtin function */
9561 Sym *s1;
9563 p = anon_sym++;
9564 sym = sym_push(p, mk_pointer(VT_VOID), FUNC_CDECL, FUNC_NEW);
9565 s1 = sym_push(SYM_FIELD, VT_UNSIGNED | VT_INT, 0, 0);
9566 s1->next = NULL;
9567 sym->next = s1;
9568 sym_push(TOK_alloca, VT_FUNC | (p << VT_STRUCT_SHIFT), VT_CONST, 0);
9570 #endif
9572 define_start = define_stack;
9573 nocode_wanted = 1;
9575 if (setjmp(s1->error_jmp_buf) == 0) {
9576 s1->nb_errors = 0;
9577 s1->error_set_jmp_enabled = 1;
9579 ch = file->buf_ptr[0];
9580 tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF;
9581 parse_flags = PARSE_FLAG_PREPROCESS | PARSE_FLAG_TOK_NUM;
9582 next();
9583 decl(VT_CONST);
9584 if (tok != TOK_EOF)
9585 expect("declaration");
9587 /* end of translation unit info */
9588 if (do_debug) {
9589 put_stabs_r(NULL, N_SO, 0, 0,
9590 text_section->data_offset, text_section, section_sym);
9593 s1->error_set_jmp_enabled = 0;
9595 /* reset define stack, but leave -Dsymbols (may be incorrect if
9596 they are undefined) */
9597 free_defines(define_start);
9599 gen_inline_functions();
9601 sym_pop(&global_stack, NULL);
9602 sym_pop(&local_stack, NULL);
9604 return s1->nb_errors != 0 ? -1 : 0;
9607 /* Preprocess the current file */
9608 /* XXX: add line and file infos, add options to preserve spaces */
9609 static int tcc_preprocess(TCCState *s1)
9611 Sym *define_start;
9612 int last_is_space;
9614 preprocess_init(s1);
9616 define_start = define_stack;
9618 ch = file->buf_ptr[0];
9619 tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF;
9620 parse_flags = PARSE_FLAG_ASM_COMMENTS | PARSE_FLAG_PREPROCESS |
9621 PARSE_FLAG_LINEFEED;
9622 last_is_space = 1;
9623 next();
9624 for(;;) {
9625 if (tok == TOK_EOF) {
9626 break;
9627 } else if (tok == TOK_LINEFEED) {
9628 last_is_space = 1;
9629 } else {
9630 if (!last_is_space)
9631 fputc(' ', s1->outfile);
9632 last_is_space = 0;
9634 fputs(get_tok_str(tok, &tokc), s1->outfile);
9635 next();
9637 free_defines(define_start);
9638 return 0;
9641 #ifdef LIBTCC
9642 int tcc_compile_string(TCCState *s, const char *str)
9644 BufferedFile bf1, *bf = &bf1;
9645 int ret, len;
9646 char *buf;
9648 /* init file structure */
9649 bf->fd = -1;
9650 /* XXX: avoid copying */
9651 len = strlen(str);
9652 buf = tcc_malloc(len + 1);
9653 if (!buf)
9654 return -1;
9655 memcpy(buf, str, len);
9656 buf[len] = CH_EOB;
9657 bf->buf_ptr = buf;
9658 bf->buf_end = buf + len;
9659 pstrcpy(bf->filename, sizeof(bf->filename), "<string>");
9660 bf->line_num = 1;
9661 file = bf;
9662 ret = tcc_compile(s);
9663 file = NULL;
9664 tcc_free(buf);
9666 /* currently, no need to close */
9667 return ret;
9669 #endif
9671 /* define a preprocessor symbol. A value can also be provided with the '=' operator */
9672 void tcc_define_symbol(TCCState *s1, const char *sym, const char *value)
9674 BufferedFile bf1, *bf = &bf1;
9676 pstrcpy(bf->buffer, IO_BUF_SIZE, sym);
9677 pstrcat(bf->buffer, IO_BUF_SIZE, " ");
9678 /* default value */
9679 if (!value)
9680 value = "1";
9681 pstrcat(bf->buffer, IO_BUF_SIZE, value);
9683 /* init file structure */
9684 bf->fd = -1;
9685 bf->buf_ptr = bf->buffer;
9686 bf->buf_end = bf->buffer + strlen(bf->buffer);
9687 *bf->buf_end = CH_EOB;
9688 bf->filename[0] = '\0';
9689 bf->line_num = 1;
9690 file = bf;
9692 s1->include_stack_ptr = s1->include_stack;
9694 /* parse with define parser */
9695 ch = file->buf_ptr[0];
9696 next_nomacro();
9697 parse_define();
9698 file = NULL;
9701 /* undefine a preprocessor symbol */
9702 void tcc_undefine_symbol(TCCState *s1, const char *sym)
9704 TokenSym *ts;
9705 Sym *s;
9706 ts = tok_alloc(sym, strlen(sym));
9707 s = define_find(ts->tok);
9708 /* undefine symbol by putting an invalid name */
9709 if (s)
9710 define_undef(s);
9713 #ifdef CONFIG_TCC_ASM
9715 #ifdef TCC_TARGET_I386
9716 #include "i386-asm.c"
9717 #endif
9718 #include "tccasm.c"
9720 #else
9721 static void asm_instr(void)
9723 error("inline asm() not supported");
9725 static void asm_global_instr(void)
9727 error("inline asm() not supported");
9729 #endif
9731 #include "tccelf.c"
9733 #ifdef TCC_TARGET_COFF
9734 #include "tcccoff.c"
9735 #endif
9737 #ifdef TCC_TARGET_PE
9738 #include "tccpe.c"
9739 #endif
9741 /* print the position in the source file of PC value 'pc' by reading
9742 the stabs debug information */
9743 static void rt_printline(unsigned long wanted_pc)
9745 Stab_Sym *sym, *sym_end;
9746 char func_name[128], last_func_name[128];
9747 unsigned long func_addr, last_pc, pc;
9748 const char *incl_files[INCLUDE_STACK_SIZE];
9749 int incl_index, len, last_line_num, i;
9750 const char *str, *p;
9752 fprintf(stderr, "0x%08lx:", wanted_pc);
9754 func_name[0] = '\0';
9755 func_addr = 0;
9756 incl_index = 0;
9757 last_func_name[0] = '\0';
9758 last_pc = 0xffffffff;
9759 last_line_num = 1;
9760 sym = (Stab_Sym *)stab_section->data + 1;
9761 sym_end = (Stab_Sym *)(stab_section->data + stab_section->data_offset);
9762 while (sym < sym_end) {
9763 switch(sym->n_type) {
9764 /* function start or end */
9765 case N_FUN:
9766 if (sym->n_strx == 0) {
9767 /* we test if between last line and end of function */
9768 pc = sym->n_value + func_addr;
9769 if (wanted_pc >= last_pc && wanted_pc < pc)
9770 goto found;
9771 func_name[0] = '\0';
9772 func_addr = 0;
9773 } else {
9774 str = stabstr_section->data + sym->n_strx;
9775 p = strchr(str, ':');
9776 if (!p) {
9777 pstrcpy(func_name, sizeof(func_name), str);
9778 } else {
9779 len = p - str;
9780 if (len > sizeof(func_name) - 1)
9781 len = sizeof(func_name) - 1;
9782 memcpy(func_name, str, len);
9783 func_name[len] = '\0';
9785 func_addr = sym->n_value;
9787 break;
9788 /* line number info */
9789 case N_SLINE:
9790 pc = sym->n_value + func_addr;
9791 if (wanted_pc >= last_pc && wanted_pc < pc)
9792 goto found;
9793 last_pc = pc;
9794 last_line_num = sym->n_desc;
9795 /* XXX: slow! */
9796 strcpy(last_func_name, func_name);
9797 break;
9798 /* include files */
9799 case N_BINCL:
9800 str = stabstr_section->data + sym->n_strx;
9801 add_incl:
9802 if (incl_index < INCLUDE_STACK_SIZE) {
9803 incl_files[incl_index++] = str;
9805 break;
9806 case N_EINCL:
9807 if (incl_index > 1)
9808 incl_index--;
9809 break;
9810 case N_SO:
9811 if (sym->n_strx == 0) {
9812 incl_index = 0; /* end of translation unit */
9813 } else {
9814 str = stabstr_section->data + sym->n_strx;
9815 /* do not add path */
9816 len = strlen(str);
9817 if (len > 0 && str[len - 1] != '/')
9818 goto add_incl;
9820 break;
9822 sym++;
9825 /* second pass: we try symtab symbols (no line number info) */
9826 incl_index = 0;
9828 Elf32_Sym *sym, *sym_end;
9829 int type;
9831 sym_end = (Elf32_Sym *)(symtab_section->data + symtab_section->data_offset);
9832 for(sym = (Elf32_Sym *)symtab_section->data + 1;
9833 sym < sym_end;
9834 sym++) {
9835 type = ELF32_ST_TYPE(sym->st_info);
9836 if (type == STT_FUNC) {
9837 if (wanted_pc >= sym->st_value &&
9838 wanted_pc < sym->st_value + sym->st_size) {
9839 pstrcpy(last_func_name, sizeof(last_func_name),
9840 strtab_section->data + sym->st_name);
9841 goto found;
9846 /* did not find any info: */
9847 fprintf(stderr, " ???\n");
9848 return;
9849 found:
9850 if (last_func_name[0] != '\0') {
9851 fprintf(stderr, " %s()", last_func_name);
9853 if (incl_index > 0) {
9854 fprintf(stderr, " (%s:%d",
9855 incl_files[incl_index - 1], last_line_num);
9856 for(i = incl_index - 2; i >= 0; i--)
9857 fprintf(stderr, ", included from %s", incl_files[i]);
9858 fprintf(stderr, ")");
9860 fprintf(stderr, "\n");
9863 #if !defined(_WIN32) && !defined(CONFIG_TCCBOOT)
9865 #ifdef __i386__
9867 /* fix for glibc 2.1 */
9868 #ifndef REG_EIP
9869 #define REG_EIP EIP
9870 #define REG_EBP EBP
9871 #endif
9873 /* return the PC at frame level 'level'. Return non zero if not found */
9874 static int rt_get_caller_pc(unsigned long *paddr,
9875 ucontext_t *uc, int level)
9877 unsigned long fp;
9878 int i;
9880 if (level == 0) {
9881 #if defined(__FreeBSD__)
9882 *paddr = uc->uc_mcontext.mc_eip;
9883 #elif defined(__dietlibc__)
9884 *paddr = uc->uc_mcontext.eip;
9885 #else
9886 *paddr = uc->uc_mcontext.gregs[REG_EIP];
9887 #endif
9888 return 0;
9889 } else {
9890 #if defined(__FreeBSD__)
9891 fp = uc->uc_mcontext.mc_ebp;
9892 #elif defined(__dietlibc__)
9893 fp = uc->uc_mcontext.ebp;
9894 #else
9895 fp = uc->uc_mcontext.gregs[REG_EBP];
9896 #endif
9897 for(i=1;i<level;i++) {
9898 /* XXX: check address validity with program info */
9899 if (fp <= 0x1000 || fp >= 0xc0000000)
9900 return -1;
9901 fp = ((unsigned long *)fp)[0];
9903 *paddr = ((unsigned long *)fp)[1];
9904 return 0;
9907 #else
9909 #warning add arch specific rt_get_caller_pc()
9911 static int rt_get_caller_pc(unsigned long *paddr,
9912 ucontext_t *uc, int level)
9914 return -1;
9916 #endif
9918 /* emit a run time error at position 'pc' */
9919 void rt_error(ucontext_t *uc, const char *fmt, ...)
9921 va_list ap;
9922 unsigned long pc;
9923 int i;
9925 va_start(ap, fmt);
9926 fprintf(stderr, "Runtime error: ");
9927 vfprintf(stderr, fmt, ap);
9928 fprintf(stderr, "\n");
9929 for(i=0;i<num_callers;i++) {
9930 if (rt_get_caller_pc(&pc, uc, i) < 0)
9931 break;
9932 if (i == 0)
9933 fprintf(stderr, "at ");
9934 else
9935 fprintf(stderr, "by ");
9936 rt_printline(pc);
9938 exit(255);
9939 va_end(ap);
9942 /* signal handler for fatal errors */
9943 static void sig_error(int signum, siginfo_t *siginf, void *puc)
9945 ucontext_t *uc = puc;
9947 switch(signum) {
9948 case SIGFPE:
9949 switch(siginf->si_code) {
9950 case FPE_INTDIV:
9951 case FPE_FLTDIV:
9952 rt_error(uc, "division by zero");
9953 break;
9954 default:
9955 rt_error(uc, "floating point exception");
9956 break;
9958 break;
9959 case SIGBUS:
9960 case SIGSEGV:
9961 if (rt_bound_error_msg && *rt_bound_error_msg)
9962 rt_error(uc, *rt_bound_error_msg);
9963 else
9964 rt_error(uc, "dereferencing invalid pointer");
9965 break;
9966 case SIGILL:
9967 rt_error(uc, "illegal instruction");
9968 break;
9969 case SIGABRT:
9970 rt_error(uc, "abort() called");
9971 break;
9972 default:
9973 rt_error(uc, "caught signal %d", signum);
9974 break;
9976 exit(255);
9978 #endif
9980 /* do all relocations (needed before using tcc_get_symbol()) */
9981 int tcc_relocate(TCCState *s1)
9983 Section *s;
9984 int i;
9986 s1->nb_errors = 0;
9988 #ifdef TCC_TARGET_PE
9989 pe_add_runtime(s1);
9990 #else
9991 tcc_add_runtime(s1);
9992 #endif
9994 relocate_common_syms();
9996 tcc_add_linker_symbols(s1);
9997 #ifndef TCC_TARGET_PE
9998 build_got_entries(s1);
9999 #endif
10000 /* compute relocation address : section are relocated in place. We
10001 also alloc the bss space */
10002 for(i = 1; i < s1->nb_sections; i++) {
10003 s = s1->sections[i];
10004 if (s->sh_flags & SHF_ALLOC) {
10005 if (s->sh_type == SHT_NOBITS)
10006 s->data = tcc_mallocz(s->data_offset);
10007 s->sh_addr = (unsigned long)s->data;
10011 relocate_syms(s1, 1);
10013 if (s1->nb_errors != 0)
10014 return -1;
10016 /* relocate each section */
10017 for(i = 1; i < s1->nb_sections; i++) {
10018 s = s1->sections[i];
10019 if (s->reloc)
10020 relocate_section(s1, s);
10023 /* mark executable sections as executable in memory */
10024 for(i = 1; i < s1->nb_sections; i++) {
10025 s = s1->sections[i];
10026 if ((s->sh_flags & (SHF_ALLOC | SHF_EXECINSTR)) ==
10027 (SHF_ALLOC | SHF_EXECINSTR))
10028 set_pages_executable(s->data, s->data_offset);
10030 return 0;
10033 /* launch the compiled program with the given arguments */
10034 int tcc_run(TCCState *s1, int argc, char **argv)
10036 int (*prog_main)(int, char **);
10038 if (tcc_relocate(s1) < 0)
10039 return -1;
10041 prog_main = tcc_get_symbol_err(s1, "main");
10043 if (do_debug) {
10044 #if defined(_WIN32) || defined(CONFIG_TCCBOOT)
10045 error("debug mode currently not available for Windows");
10046 #else
10047 struct sigaction sigact;
10048 /* install TCC signal handlers to print debug info on fatal
10049 runtime errors */
10050 sigact.sa_flags = SA_SIGINFO | SA_RESETHAND;
10051 sigact.sa_sigaction = sig_error;
10052 sigemptyset(&sigact.sa_mask);
10053 sigaction(SIGFPE, &sigact, NULL);
10054 sigaction(SIGILL, &sigact, NULL);
10055 sigaction(SIGSEGV, &sigact, NULL);
10056 sigaction(SIGBUS, &sigact, NULL);
10057 sigaction(SIGABRT, &sigact, NULL);
10058 #endif
10061 #ifdef CONFIG_TCC_BCHECK
10062 if (do_bounds_check) {
10063 void (*bound_init)(void);
10065 /* set error function */
10066 rt_bound_error_msg = (void *)tcc_get_symbol_err(s1,
10067 "__bound_error_msg");
10069 /* XXX: use .init section so that it also work in binary ? */
10070 bound_init = (void *)tcc_get_symbol_err(s1, "__bound_init");
10071 bound_init();
10073 #endif
10074 return (*prog_main)(argc, argv);
10077 void tcc_memstats(void)
10079 #ifdef MEM_DEBUG
10080 printf("memory in use: %d\n", mem_cur_size);
10081 #endif
10084 static void tcc_cleanup(void)
10086 int i, n;
10088 if (NULL == tcc_state)
10089 return;
10090 tcc_state = NULL;
10092 /* free -D defines */
10093 free_defines(NULL);
10095 /* free tokens */
10096 n = tok_ident - TOK_IDENT;
10097 for(i = 0; i < n; i++)
10098 tcc_free(table_ident[i]);
10099 tcc_free(table_ident);
10101 /* free sym_pools */
10102 dynarray_reset(&sym_pools, &nb_sym_pools);
10103 /* string buffer */
10104 cstr_free(&tokcstr);
10105 /* reset symbol stack */
10106 sym_free_first = NULL;
10107 /* cleanup from error/setjmp */
10108 macro_ptr = NULL;
10111 TCCState *tcc_new(void)
10113 const char *p, *r;
10114 TCCState *s;
10115 TokenSym *ts;
10116 int i, c;
10118 tcc_cleanup();
10120 s = tcc_mallocz(sizeof(TCCState));
10121 if (!s)
10122 return NULL;
10123 tcc_state = s;
10124 s->output_type = TCC_OUTPUT_MEMORY;
10126 /* init isid table */
10127 for(i=CH_EOF;i<256;i++)
10128 isidnum_table[i-CH_EOF] = isid(i) || isnum(i);
10130 /* add all tokens */
10131 table_ident = NULL;
10132 memset(hash_ident, 0, TOK_HASH_SIZE * sizeof(TokenSym *));
10134 tok_ident = TOK_IDENT;
10135 p = tcc_keywords;
10136 while (*p) {
10137 r = p;
10138 for(;;) {
10139 c = *r++;
10140 if (c == '\0')
10141 break;
10143 ts = tok_alloc(p, r - p - 1);
10144 p = r;
10147 /* we add dummy defines for some special macros to speed up tests
10148 and to have working defined() */
10149 define_push(TOK___LINE__, MACRO_OBJ, NULL, NULL);
10150 define_push(TOK___FILE__, MACRO_OBJ, NULL, NULL);
10151 define_push(TOK___DATE__, MACRO_OBJ, NULL, NULL);
10152 define_push(TOK___TIME__, MACRO_OBJ, NULL, NULL);
10154 /* standard defines */
10155 tcc_define_symbol(s, "__STDC__", NULL);
10156 tcc_define_symbol(s, "__STDC_VERSION__", "199901L");
10157 #if defined(TCC_TARGET_I386)
10158 tcc_define_symbol(s, "__i386__", NULL);
10159 #endif
10160 #if defined(TCC_TARGET_ARM)
10161 tcc_define_symbol(s, "__ARM_ARCH_4__", NULL);
10162 tcc_define_symbol(s, "__arm_elf__", NULL);
10163 tcc_define_symbol(s, "__arm_elf", NULL);
10164 tcc_define_symbol(s, "arm_elf", NULL);
10165 tcc_define_symbol(s, "__arm__", NULL);
10166 tcc_define_symbol(s, "__arm", NULL);
10167 tcc_define_symbol(s, "arm", NULL);
10168 tcc_define_symbol(s, "__APCS_32__", NULL);
10169 #endif
10170 #ifdef TCC_TARGET_PE
10171 tcc_define_symbol(s, "_WIN32", NULL);
10172 #else
10173 tcc_define_symbol(s, "__unix__", NULL);
10174 tcc_define_symbol(s, "__unix", NULL);
10175 #if defined(__linux)
10176 tcc_define_symbol(s, "__linux__", NULL);
10177 tcc_define_symbol(s, "__linux", NULL);
10178 #endif
10179 #endif
10180 /* tiny C specific defines */
10181 tcc_define_symbol(s, "__TINYC__", NULL);
10183 /* tiny C & gcc defines */
10184 tcc_define_symbol(s, "__SIZE_TYPE__", "unsigned int");
10185 tcc_define_symbol(s, "__PTRDIFF_TYPE__", "int");
10186 #ifdef TCC_TARGET_PE
10187 tcc_define_symbol(s, "__WCHAR_TYPE__", "unsigned short");
10188 #else
10189 tcc_define_symbol(s, "__WCHAR_TYPE__", "int");
10190 #endif
10192 #ifndef TCC_TARGET_PE
10193 /* default library paths */
10194 tcc_add_library_path(s, CONFIG_SYSROOT "/usr/local/lib");
10195 tcc_add_library_path(s, CONFIG_SYSROOT "/usr/lib");
10196 tcc_add_library_path(s, CONFIG_SYSROOT "/lib");
10197 #endif
10199 /* no section zero */
10200 dynarray_add((void ***)&s->sections, &s->nb_sections, NULL);
10202 /* create standard sections */
10203 text_section = new_section(s, ".text", SHT_PROGBITS, SHF_ALLOC | SHF_EXECINSTR);
10204 data_section = new_section(s, ".data", SHT_PROGBITS, SHF_ALLOC | SHF_WRITE);
10205 bss_section = new_section(s, ".bss", SHT_NOBITS, SHF_ALLOC | SHF_WRITE);
10207 /* symbols are always generated for linking stage */
10208 symtab_section = new_symtab(s, ".symtab", SHT_SYMTAB, 0,
10209 ".strtab",
10210 ".hashtab", SHF_PRIVATE);
10211 strtab_section = symtab_section->link;
10213 /* private symbol table for dynamic symbols */
10214 s->dynsymtab_section = new_symtab(s, ".dynsymtab", SHT_SYMTAB, SHF_PRIVATE,
10215 ".dynstrtab",
10216 ".dynhashtab", SHF_PRIVATE);
10217 s->alacarte_link = 1;
10219 #ifdef CHAR_IS_UNSIGNED
10220 s->char_is_unsigned = 1;
10221 #endif
10222 #if defined(TCC_TARGET_PE) && 0
10223 /* XXX: currently the PE linker is not ready to support that */
10224 s->leading_underscore = 1;
10225 #endif
10226 return s;
10229 void tcc_delete(TCCState *s1)
10231 int i;
10233 tcc_cleanup();
10235 /* free all sections */
10236 free_section(s1->dynsymtab_section);
10238 for(i = 1; i < s1->nb_sections; i++)
10239 free_section(s1->sections[i]);
10240 tcc_free(s1->sections);
10242 /* free any loaded DLLs */
10243 for ( i = 0; i < s1->nb_loaded_dlls; i++)
10245 DLLReference *ref = s1->loaded_dlls[i];
10246 if ( ref->handle )
10247 dlclose(ref->handle);
10250 /* free loaded dlls array */
10251 dynarray_reset(&s1->loaded_dlls, &s1->nb_loaded_dlls);
10253 /* free library paths */
10254 dynarray_reset(&s1->library_paths, &s1->nb_library_paths);
10256 /* free include paths */
10257 dynarray_reset(&s1->cached_includes, &s1->nb_cached_includes);
10258 dynarray_reset(&s1->include_paths, &s1->nb_include_paths);
10259 dynarray_reset(&s1->sysinclude_paths, &s1->nb_sysinclude_paths);
10261 tcc_free(s1);
10264 int tcc_add_include_path(TCCState *s1, const char *pathname)
10266 char *pathname1;
10268 pathname1 = tcc_strdup(pathname);
10269 dynarray_add((void ***)&s1->include_paths, &s1->nb_include_paths, pathname1);
10270 return 0;
10273 int tcc_add_sysinclude_path(TCCState *s1, const char *pathname)
10275 char *pathname1;
10277 pathname1 = tcc_strdup(pathname);
10278 dynarray_add((void ***)&s1->sysinclude_paths, &s1->nb_sysinclude_paths, pathname1);
10279 return 0;
10282 static int tcc_add_file_internal(TCCState *s1, const char *filename, int flags)
10284 const char *ext;
10285 Elf32_Ehdr ehdr;
10286 int fd, ret;
10287 BufferedFile *saved_file;
10289 /* find source file type with extension */
10290 ext = tcc_fileextension(filename);
10291 if (ext[0])
10292 ext++;
10294 /* open the file */
10295 saved_file = file;
10296 file = tcc_open(s1, filename);
10297 if (!file) {
10298 if (flags & AFF_PRINT_ERROR) {
10299 error_noabort("file '%s' not found", filename);
10301 ret = -1;
10302 goto fail1;
10305 if (flags & AFF_PREPROCESS) {
10306 ret = tcc_preprocess(s1);
10307 } else if (!ext[0] || !strcmp(ext, "c")) {
10308 /* C file assumed */
10309 ret = tcc_compile(s1);
10310 } else
10311 #ifdef CONFIG_TCC_ASM
10312 if (!strcmp(ext, "S")) {
10313 /* preprocessed assembler */
10314 ret = tcc_assemble(s1, 1);
10315 } else if (!strcmp(ext, "s")) {
10316 /* non preprocessed assembler */
10317 ret = tcc_assemble(s1, 0);
10318 } else
10319 #endif
10320 #ifdef TCC_TARGET_PE
10321 if (!strcmp(ext, "def")) {
10322 ret = pe_load_def_file(s1, file->fd);
10323 } else
10324 #endif
10326 fd = file->fd;
10327 /* assume executable format: auto guess file type */
10328 ret = read(fd, &ehdr, sizeof(ehdr));
10329 lseek(fd, 0, SEEK_SET);
10330 if (ret <= 0) {
10331 error_noabort("could not read header");
10332 goto fail;
10333 } else if (ret != sizeof(ehdr)) {
10334 goto try_load_script;
10337 if (ehdr.e_ident[0] == ELFMAG0 &&
10338 ehdr.e_ident[1] == ELFMAG1 &&
10339 ehdr.e_ident[2] == ELFMAG2 &&
10340 ehdr.e_ident[3] == ELFMAG3) {
10341 file->line_num = 0; /* do not display line number if error */
10342 if (ehdr.e_type == ET_REL) {
10343 ret = tcc_load_object_file(s1, fd, 0);
10344 } else if (ehdr.e_type == ET_DYN) {
10345 if (s1->output_type == TCC_OUTPUT_MEMORY) {
10346 #ifdef TCC_TARGET_PE
10347 ret = -1;
10348 #else
10349 void *h;
10350 h = dlopen(filename, RTLD_GLOBAL | RTLD_LAZY);
10351 if (h)
10352 ret = 0;
10353 else
10354 ret = -1;
10355 #endif
10356 } else {
10357 ret = tcc_load_dll(s1, fd, filename,
10358 (flags & AFF_REFERENCED_DLL) != 0);
10360 } else {
10361 error_noabort("unrecognized ELF file");
10362 goto fail;
10364 } else if (memcmp((char *)&ehdr, ARMAG, 8) == 0) {
10365 file->line_num = 0; /* do not display line number if error */
10366 ret = tcc_load_archive(s1, fd);
10367 } else
10368 #ifdef TCC_TARGET_COFF
10369 if (*(uint16_t *)(&ehdr) == COFF_C67_MAGIC) {
10370 ret = tcc_load_coff(s1, fd);
10371 } else
10372 #endif
10373 #ifdef TCC_TARGET_PE
10374 if (pe_test_res_file(&ehdr, ret)) {
10375 ret = pe_load_res_file(s1, fd);
10376 } else
10377 #endif
10379 /* as GNU ld, consider it is an ld script if not recognized */
10380 try_load_script:
10381 ret = tcc_load_ldscript(s1);
10382 if (ret < 0) {
10383 error_noabort("unrecognized file type");
10384 goto fail;
10388 the_end:
10389 tcc_close(file);
10390 fail1:
10391 file = saved_file;
10392 return ret;
10393 fail:
10394 ret = -1;
10395 goto the_end;
10398 int tcc_add_file(TCCState *s, const char *filename)
10400 return tcc_add_file_internal(s, filename, AFF_PRINT_ERROR);
10403 int tcc_add_library_path(TCCState *s, const char *pathname)
10405 char *pathname1;
10407 pathname1 = tcc_strdup(pathname);
10408 dynarray_add((void ***)&s->library_paths, &s->nb_library_paths, pathname1);
10409 return 0;
10412 /* find and load a dll. Return non zero if not found */
10413 /* XXX: add '-rpath' option support ? */
10414 static int tcc_add_dll(TCCState *s, const char *filename, int flags)
10416 char buf[1024];
10417 int i;
10419 for(i = 0; i < s->nb_library_paths; i++) {
10420 snprintf(buf, sizeof(buf), "%s/%s",
10421 s->library_paths[i], filename);
10422 if (tcc_add_file_internal(s, buf, flags) == 0)
10423 return 0;
10425 return -1;
10428 /* the library name is the same as the argument of the '-l' option */
10429 int tcc_add_library(TCCState *s, const char *libraryname)
10431 char buf[1024];
10432 int i;
10434 /* first we look for the dynamic library if not static linking */
10435 if (!s->static_link) {
10436 #ifdef TCC_TARGET_PE
10437 snprintf(buf, sizeof(buf), "%s.def", libraryname);
10438 #else
10439 snprintf(buf, sizeof(buf), "lib%s.so", libraryname);
10440 #endif
10441 if (tcc_add_dll(s, buf, 0) == 0)
10442 return 0;
10445 /* then we look for the static library */
10446 for(i = 0; i < s->nb_library_paths; i++) {
10447 snprintf(buf, sizeof(buf), "%s/lib%s.a",
10448 s->library_paths[i], libraryname);
10449 if (tcc_add_file_internal(s, buf, 0) == 0)
10450 return 0;
10452 return -1;
10455 int tcc_add_symbol(TCCState *s, const char *name, unsigned long val)
10457 add_elf_sym(symtab_section, val, 0,
10458 ELF32_ST_INFO(STB_GLOBAL, STT_NOTYPE), 0,
10459 SHN_ABS, name);
10460 return 0;
10463 int tcc_set_output_type(TCCState *s, int output_type)
10465 char buf[1024];
10467 s->output_type = output_type;
10469 if (!s->nostdinc) {
10470 /* default include paths */
10471 /* XXX: reverse order needed if -isystem support */
10472 #ifndef TCC_TARGET_PE
10473 tcc_add_sysinclude_path(s, CONFIG_SYSROOT "/usr/local/include");
10474 tcc_add_sysinclude_path(s, CONFIG_SYSROOT "/usr/include");
10475 #endif
10476 snprintf(buf, sizeof(buf), "%s/include", tcc_lib_path);
10477 tcc_add_sysinclude_path(s, buf);
10478 #ifdef TCC_TARGET_PE
10479 snprintf(buf, sizeof(buf), "%s/include/winapi", tcc_lib_path);
10480 tcc_add_sysinclude_path(s, buf);
10481 #endif
10484 /* if bound checking, then add corresponding sections */
10485 #ifdef CONFIG_TCC_BCHECK
10486 if (do_bounds_check) {
10487 /* define symbol */
10488 tcc_define_symbol(s, "__BOUNDS_CHECKING_ON", NULL);
10489 /* create bounds sections */
10490 bounds_section = new_section(s, ".bounds",
10491 SHT_PROGBITS, SHF_ALLOC);
10492 lbounds_section = new_section(s, ".lbounds",
10493 SHT_PROGBITS, SHF_ALLOC);
10495 #endif
10497 if (s->char_is_unsigned) {
10498 tcc_define_symbol(s, "__CHAR_UNSIGNED__", NULL);
10501 /* add debug sections */
10502 if (do_debug) {
10503 /* stab symbols */
10504 stab_section = new_section(s, ".stab", SHT_PROGBITS, 0);
10505 stab_section->sh_entsize = sizeof(Stab_Sym);
10506 stabstr_section = new_section(s, ".stabstr", SHT_STRTAB, 0);
10507 put_elf_str(stabstr_section, "");
10508 stab_section->link = stabstr_section;
10509 /* put first entry */
10510 put_stabs("", 0, 0, 0, 0);
10513 /* add libc crt1/crti objects */
10514 #ifndef TCC_TARGET_PE
10515 if ((output_type == TCC_OUTPUT_EXE || output_type == TCC_OUTPUT_DLL) &&
10516 !s->nostdlib) {
10517 if (output_type != TCC_OUTPUT_DLL)
10518 tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crt1.o");
10519 tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crti.o");
10521 #endif
10523 #ifdef TCC_TARGET_PE
10524 snprintf(buf, sizeof(buf), "%s/lib", tcc_lib_path);
10525 tcc_add_library_path(s, buf);
10526 #endif
10528 return 0;
10531 #define WD_ALL 0x0001 /* warning is activated when using -Wall */
10532 #define FD_INVERT 0x0002 /* invert value before storing */
10534 typedef struct FlagDef {
10535 uint16_t offset;
10536 uint16_t flags;
10537 const char *name;
10538 } FlagDef;
10540 static const FlagDef warning_defs[] = {
10541 { offsetof(TCCState, warn_unsupported), 0, "unsupported" },
10542 { offsetof(TCCState, warn_write_strings), 0, "write-strings" },
10543 { offsetof(TCCState, warn_error), 0, "error" },
10544 { offsetof(TCCState, warn_implicit_function_declaration), WD_ALL,
10545 "implicit-function-declaration" },
10548 static int set_flag(TCCState *s, const FlagDef *flags, int nb_flags,
10549 const char *name, int value)
10551 int i;
10552 const FlagDef *p;
10553 const char *r;
10555 r = name;
10556 if (r[0] == 'n' && r[1] == 'o' && r[2] == '-') {
10557 r += 3;
10558 value = !value;
10560 for(i = 0, p = flags; i < nb_flags; i++, p++) {
10561 if (!strcmp(r, p->name))
10562 goto found;
10564 return -1;
10565 found:
10566 if (p->flags & FD_INVERT)
10567 value = !value;
10568 *(int *)((uint8_t *)s + p->offset) = value;
10569 return 0;
10573 /* set/reset a warning */
10574 int tcc_set_warning(TCCState *s, const char *warning_name, int value)
10576 int i;
10577 const FlagDef *p;
10579 if (!strcmp(warning_name, "all")) {
10580 for(i = 0, p = warning_defs; i < countof(warning_defs); i++, p++) {
10581 if (p->flags & WD_ALL)
10582 *(int *)((uint8_t *)s + p->offset) = 1;
10584 return 0;
10585 } else {
10586 return set_flag(s, warning_defs, countof(warning_defs),
10587 warning_name, value);
10591 static const FlagDef flag_defs[] = {
10592 { offsetof(TCCState, char_is_unsigned), 0, "unsigned-char" },
10593 { offsetof(TCCState, char_is_unsigned), FD_INVERT, "signed-char" },
10594 { offsetof(TCCState, nocommon), FD_INVERT, "common" },
10595 { offsetof(TCCState, leading_underscore), 0, "leading-underscore" },
10598 /* set/reset a flag */
10599 int tcc_set_flag(TCCState *s, const char *flag_name, int value)
10601 return set_flag(s, flag_defs, countof(flag_defs),
10602 flag_name, value);
10605 #if !defined(LIBTCC)
10607 static int64_t getclock_us(void)
10609 #ifdef _WIN32
10610 struct _timeb tb;
10611 _ftime(&tb);
10612 return (tb.time * 1000LL + tb.millitm) * 1000LL;
10613 #else
10614 struct timeval tv;
10615 gettimeofday(&tv, NULL);
10616 return tv.tv_sec * 1000000LL + tv.tv_usec;
10617 #endif
10620 void help(void)
10622 printf("tcc version " TCC_VERSION " - Tiny C Compiler - Copyright (C) 2001-2006 Fabrice Bellard\n"
10623 "usage: tcc [-v] [-c] [-o outfile] [-Bdir] [-bench] [-Idir] [-Dsym[=val]] [-Usym]\n"
10624 " [-Wwarn] [-g] [-b] [-bt N] [-Ldir] [-llib] [-shared] [-soname name]\n"
10625 " [-static] [infile1 infile2...] [-run infile args...]\n"
10626 "\n"
10627 "General options:\n"
10628 " -v display current version, increase verbosity\n"
10629 " -c compile only - generate an object file\n"
10630 " -o outfile set output filename\n"
10631 " -Bdir set tcc internal library path\n"
10632 " -bench output compilation statistics\n"
10633 " -run run compiled source\n"
10634 " -fflag set or reset (with 'no-' prefix) 'flag' (see man page)\n"
10635 " -Wwarning set or reset (with 'no-' prefix) 'warning' (see man page)\n"
10636 " -w disable all warnings\n"
10637 "Preprocessor options:\n"
10638 " -E preprocess only\n"
10639 " -Idir add include path 'dir'\n"
10640 " -Dsym[=val] define 'sym' with value 'val'\n"
10641 " -Usym undefine 'sym'\n"
10642 "Linker options:\n"
10643 " -Ldir add library path 'dir'\n"
10644 " -llib link with dynamic or static library 'lib'\n"
10645 " -shared generate a shared library\n"
10646 " -soname set name for shared library to be used at runtime\n"
10647 " -static static linking\n"
10648 " -rdynamic export all global symbols to dynamic linker\n"
10649 " -r generate (relocatable) object file\n"
10650 "Debugger options:\n"
10651 " -g generate runtime debug info\n"
10652 #ifdef CONFIG_TCC_BCHECK
10653 " -b compile with built-in memory and bounds checker (implies -g)\n"
10654 #endif
10655 " -bt N show N callers in stack traces\n"
10659 #define TCC_OPTION_HAS_ARG 0x0001
10660 #define TCC_OPTION_NOSEP 0x0002 /* cannot have space before option and arg */
10662 typedef struct TCCOption {
10663 const char *name;
10664 uint16_t index;
10665 uint16_t flags;
10666 } TCCOption;
10668 enum {
10669 TCC_OPTION_HELP,
10670 TCC_OPTION_I,
10671 TCC_OPTION_D,
10672 TCC_OPTION_U,
10673 TCC_OPTION_L,
10674 TCC_OPTION_B,
10675 TCC_OPTION_l,
10676 TCC_OPTION_bench,
10677 TCC_OPTION_bt,
10678 TCC_OPTION_b,
10679 TCC_OPTION_g,
10680 TCC_OPTION_c,
10681 TCC_OPTION_static,
10682 TCC_OPTION_shared,
10683 TCC_OPTION_soname,
10684 TCC_OPTION_o,
10685 TCC_OPTION_r,
10686 TCC_OPTION_Wl,
10687 TCC_OPTION_W,
10688 TCC_OPTION_O,
10689 TCC_OPTION_m,
10690 TCC_OPTION_f,
10691 TCC_OPTION_nostdinc,
10692 TCC_OPTION_nostdlib,
10693 TCC_OPTION_print_search_dirs,
10694 TCC_OPTION_rdynamic,
10695 TCC_OPTION_run,
10696 TCC_OPTION_v,
10697 TCC_OPTION_w,
10698 TCC_OPTION_pipe,
10699 TCC_OPTION_E,
10702 static const TCCOption tcc_options[] = {
10703 { "h", TCC_OPTION_HELP, 0 },
10704 { "?", TCC_OPTION_HELP, 0 },
10705 { "I", TCC_OPTION_I, TCC_OPTION_HAS_ARG },
10706 { "D", TCC_OPTION_D, TCC_OPTION_HAS_ARG },
10707 { "U", TCC_OPTION_U, TCC_OPTION_HAS_ARG },
10708 { "L", TCC_OPTION_L, TCC_OPTION_HAS_ARG },
10709 { "B", TCC_OPTION_B, TCC_OPTION_HAS_ARG },
10710 { "l", TCC_OPTION_l, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10711 { "bench", TCC_OPTION_bench, 0 },
10712 { "bt", TCC_OPTION_bt, TCC_OPTION_HAS_ARG },
10713 #ifdef CONFIG_TCC_BCHECK
10714 { "b", TCC_OPTION_b, 0 },
10715 #endif
10716 { "g", TCC_OPTION_g, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10717 { "c", TCC_OPTION_c, 0 },
10718 { "static", TCC_OPTION_static, 0 },
10719 { "shared", TCC_OPTION_shared, 0 },
10720 { "soname", TCC_OPTION_soname, TCC_OPTION_HAS_ARG },
10721 { "o", TCC_OPTION_o, TCC_OPTION_HAS_ARG },
10722 { "run", TCC_OPTION_run, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10723 { "rdynamic", TCC_OPTION_rdynamic, 0 },
10724 { "r", TCC_OPTION_r, 0 },
10725 { "Wl,", TCC_OPTION_Wl, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10726 { "W", TCC_OPTION_W, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10727 { "O", TCC_OPTION_O, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10728 { "m", TCC_OPTION_m, TCC_OPTION_HAS_ARG },
10729 { "f", TCC_OPTION_f, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10730 { "nostdinc", TCC_OPTION_nostdinc, 0 },
10731 { "nostdlib", TCC_OPTION_nostdlib, 0 },
10732 { "print-search-dirs", TCC_OPTION_print_search_dirs, 0 },
10733 { "v", TCC_OPTION_v, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10734 { "w", TCC_OPTION_w, 0 },
10735 { "pipe", TCC_OPTION_pipe, 0},
10736 { "E", TCC_OPTION_E, 0},
10737 { NULL },
10740 /* convert 'str' into an array of space separated strings */
10741 static int expand_args(char ***pargv, const char *str)
10743 const char *s1;
10744 char **argv, *arg;
10745 int argc, len;
10747 argc = 0;
10748 argv = NULL;
10749 for(;;) {
10750 while (is_space(*str))
10751 str++;
10752 if (*str == '\0')
10753 break;
10754 s1 = str;
10755 while (*str != '\0' && !is_space(*str))
10756 str++;
10757 len = str - s1;
10758 arg = tcc_malloc(len + 1);
10759 memcpy(arg, s1, len);
10760 arg[len] = '\0';
10761 dynarray_add((void ***)&argv, &argc, arg);
10763 *pargv = argv;
10764 return argc;
10767 static char **files;
10768 static int nb_files, nb_libraries;
10769 static int multiple_files;
10770 static int print_search_dirs;
10771 static int output_type;
10772 static int reloc_output;
10773 static const char *outfile;
10775 int parse_args(TCCState *s, int argc, char **argv)
10777 int optind;
10778 const TCCOption *popt;
10779 const char *optarg, *p1, *r1;
10780 char *r;
10782 optind = 0;
10783 while (optind < argc) {
10785 r = argv[optind++];
10786 if (r[0] != '-' || r[1] == '\0') {
10787 /* add a new file */
10788 dynarray_add((void ***)&files, &nb_files, r);
10789 if (!multiple_files) {
10790 optind--;
10791 /* argv[0] will be this file */
10792 break;
10794 } else {
10795 /* find option in table (match only the first chars */
10796 popt = tcc_options;
10797 for(;;) {
10798 p1 = popt->name;
10799 if (p1 == NULL)
10800 error("invalid option -- '%s'", r);
10801 r1 = r + 1;
10802 for(;;) {
10803 if (*p1 == '\0')
10804 goto option_found;
10805 if (*r1 != *p1)
10806 break;
10807 p1++;
10808 r1++;
10810 popt++;
10812 option_found:
10813 if (popt->flags & TCC_OPTION_HAS_ARG) {
10814 if (*r1 != '\0' || (popt->flags & TCC_OPTION_NOSEP)) {
10815 optarg = r1;
10816 } else {
10817 if (optind >= argc)
10818 error("argument to '%s' is missing", r);
10819 optarg = argv[optind++];
10821 } else {
10822 if (*r1 != '\0')
10823 return 0;
10824 optarg = NULL;
10827 switch(popt->index) {
10828 case TCC_OPTION_HELP:
10829 return 0;
10831 case TCC_OPTION_I:
10832 if (tcc_add_include_path(s, optarg) < 0)
10833 error("too many include paths");
10834 break;
10835 case TCC_OPTION_D:
10837 char *sym, *value;
10838 sym = (char *)optarg;
10839 value = strchr(sym, '=');
10840 if (value) {
10841 *value = '\0';
10842 value++;
10844 tcc_define_symbol(s, sym, value);
10846 break;
10847 case TCC_OPTION_U:
10848 tcc_undefine_symbol(s, optarg);
10849 break;
10850 case TCC_OPTION_L:
10851 tcc_add_library_path(s, optarg);
10852 break;
10853 case TCC_OPTION_B:
10854 /* set tcc utilities path (mainly for tcc development) */
10855 tcc_lib_path = optarg;
10856 break;
10857 case TCC_OPTION_l:
10858 dynarray_add((void ***)&files, &nb_files, r);
10859 nb_libraries++;
10860 break;
10861 case TCC_OPTION_bench:
10862 do_bench = 1;
10863 break;
10864 case TCC_OPTION_bt:
10865 num_callers = atoi(optarg);
10866 break;
10867 #ifdef CONFIG_TCC_BCHECK
10868 case TCC_OPTION_b:
10869 do_bounds_check = 1;
10870 do_debug = 1;
10871 break;
10872 #endif
10873 case TCC_OPTION_g:
10874 do_debug = 1;
10875 break;
10876 case TCC_OPTION_c:
10877 multiple_files = 1;
10878 output_type = TCC_OUTPUT_OBJ;
10879 break;
10880 case TCC_OPTION_static:
10881 s->static_link = 1;
10882 break;
10883 case TCC_OPTION_shared:
10884 output_type = TCC_OUTPUT_DLL;
10885 break;
10886 case TCC_OPTION_soname:
10887 s->soname = optarg;
10888 break;
10889 case TCC_OPTION_o:
10890 multiple_files = 1;
10891 outfile = optarg;
10892 break;
10893 case TCC_OPTION_r:
10894 /* generate a .o merging several output files */
10895 reloc_output = 1;
10896 output_type = TCC_OUTPUT_OBJ;
10897 break;
10898 case TCC_OPTION_nostdinc:
10899 s->nostdinc = 1;
10900 break;
10901 case TCC_OPTION_nostdlib:
10902 s->nostdlib = 1;
10903 break;
10904 case TCC_OPTION_print_search_dirs:
10905 print_search_dirs = 1;
10906 break;
10907 case TCC_OPTION_run:
10909 int argc1;
10910 char **argv1;
10911 argc1 = expand_args(&argv1, optarg);
10912 if (argc1 > 0) {
10913 parse_args(s, argc1, argv1);
10915 multiple_files = 0;
10916 output_type = TCC_OUTPUT_MEMORY;
10918 break;
10919 case TCC_OPTION_v:
10920 do {
10921 if (0 == verbose++)
10922 printf("tcc version %s\n", TCC_VERSION);
10923 } while (*optarg++ == 'v');
10924 break;
10925 case TCC_OPTION_f:
10926 if (tcc_set_flag(s, optarg, 1) < 0 && s->warn_unsupported)
10927 goto unsupported_option;
10928 break;
10929 case TCC_OPTION_W:
10930 if (tcc_set_warning(s, optarg, 1) < 0 &&
10931 s->warn_unsupported)
10932 goto unsupported_option;
10933 break;
10934 case TCC_OPTION_w:
10935 s->warn_none = 1;
10936 break;
10937 case TCC_OPTION_rdynamic:
10938 s->rdynamic = 1;
10939 break;
10940 case TCC_OPTION_Wl:
10942 const char *p;
10943 if (strstart(optarg, "-Ttext,", &p)) {
10944 s->text_addr = strtoul(p, NULL, 16);
10945 s->has_text_addr = 1;
10946 } else if (strstart(optarg, "--oformat,", &p)) {
10947 if (strstart(p, "elf32-", NULL)) {
10948 s->output_format = TCC_OUTPUT_FORMAT_ELF;
10949 } else if (!strcmp(p, "binary")) {
10950 s->output_format = TCC_OUTPUT_FORMAT_BINARY;
10951 } else
10952 #ifdef TCC_TARGET_COFF
10953 if (!strcmp(p, "coff")) {
10954 s->output_format = TCC_OUTPUT_FORMAT_COFF;
10955 } else
10956 #endif
10958 error("target %s not found", p);
10960 } else {
10961 error("unsupported linker option '%s'", optarg);
10964 break;
10965 case TCC_OPTION_E:
10966 output_type = TCC_OUTPUT_PREPROCESS;
10967 break;
10968 default:
10969 if (s->warn_unsupported) {
10970 unsupported_option:
10971 warning("unsupported option '%s'", r);
10973 break;
10977 return optind + 1;
10980 int main(int argc, char **argv)
10982 int i;
10983 TCCState *s;
10984 int nb_objfiles, ret, optind;
10985 char objfilename[1024];
10986 int64_t start_time = 0;
10988 #ifdef _WIN32
10989 tcc_lib_path = w32_tcc_lib_path();
10990 #endif
10992 s = tcc_new();
10993 output_type = TCC_OUTPUT_EXE;
10994 outfile = NULL;
10995 multiple_files = 1;
10996 files = NULL;
10997 nb_files = 0;
10998 nb_libraries = 0;
10999 reloc_output = 0;
11000 print_search_dirs = 0;
11001 ret = 0;
11003 optind = parse_args(s, argc - 1, argv + 1);
11004 if (print_search_dirs) {
11005 /* enough for Linux kernel */
11006 printf("install: %s/\n", tcc_lib_path);
11007 return 0;
11009 if (optind == 0 || nb_files == 0) {
11010 if (optind && verbose)
11011 return 0;
11012 help();
11013 return 1;
11016 nb_objfiles = nb_files - nb_libraries;
11018 /* if outfile provided without other options, we output an
11019 executable */
11020 if (outfile && output_type == TCC_OUTPUT_MEMORY)
11021 output_type = TCC_OUTPUT_EXE;
11023 /* check -c consistency : only single file handled. XXX: checks file type */
11024 if (output_type == TCC_OUTPUT_OBJ && !reloc_output) {
11025 /* accepts only a single input file */
11026 if (nb_objfiles != 1)
11027 error("cannot specify multiple files with -c");
11028 if (nb_libraries != 0)
11029 error("cannot specify libraries with -c");
11033 if (output_type == TCC_OUTPUT_PREPROCESS) {
11034 if (!outfile) {
11035 s->outfile = stdout;
11036 } else {
11037 s->outfile = fopen(outfile, "w");
11038 if (!s->outfile)
11039 error("could not open '%s", outfile);
11041 } else if (output_type != TCC_OUTPUT_MEMORY) {
11042 if (!outfile) {
11043 /* compute default outfile name */
11044 char *ext;
11045 const char *name =
11046 strcmp(files[0], "-") == 0 ? "a" : tcc_basename(files[0]);
11047 pstrcpy(objfilename, sizeof(objfilename), name);
11048 ext = tcc_fileextension(objfilename);
11049 #ifdef TCC_TARGET_PE
11050 if (output_type == TCC_OUTPUT_DLL)
11051 strcpy(ext, ".dll");
11052 else
11053 if (output_type == TCC_OUTPUT_EXE)
11054 strcpy(ext, ".exe");
11055 else
11056 #endif
11057 if (output_type == TCC_OUTPUT_OBJ && !reloc_output && *ext)
11058 strcpy(ext, ".o");
11059 else
11060 pstrcpy(objfilename, sizeof(objfilename), "a.out");
11061 outfile = objfilename;
11065 if (do_bench) {
11066 start_time = getclock_us();
11069 tcc_set_output_type(s, output_type);
11071 /* compile or add each files or library */
11072 for(i = 0; i < nb_files && ret == 0; i++) {
11073 const char *filename;
11075 filename = files[i];
11076 if (output_type == TCC_OUTPUT_PREPROCESS) {
11077 if (tcc_add_file_internal(s, filename,
11078 AFF_PRINT_ERROR | AFF_PREPROCESS) < 0)
11079 ret = 1;
11080 } else if (filename[0] == '-' && filename[1]) {
11081 if (tcc_add_library(s, filename + 2) < 0)
11082 error("cannot find %s", filename);
11083 } else {
11084 if (1 == verbose)
11085 printf("-> %s\n", filename);
11086 if (tcc_add_file(s, filename) < 0)
11087 ret = 1;
11091 /* free all files */
11092 tcc_free(files);
11094 if (ret)
11095 goto the_end;
11097 if (do_bench) {
11098 double total_time;
11099 total_time = (double)(getclock_us() - start_time) / 1000000.0;
11100 if (total_time < 0.001)
11101 total_time = 0.001;
11102 if (total_bytes < 1)
11103 total_bytes = 1;
11104 printf("%d idents, %d lines, %d bytes, %0.3f s, %d lines/s, %0.1f MB/s\n",
11105 tok_ident - TOK_IDENT, total_lines, total_bytes,
11106 total_time, (int)(total_lines / total_time),
11107 total_bytes / total_time / 1000000.0);
11110 if (s->output_type == TCC_OUTPUT_PREPROCESS) {
11111 if (outfile)
11112 fclose(s->outfile);
11113 } else if (s->output_type == TCC_OUTPUT_MEMORY) {
11114 ret = tcc_run(s, argc - optind, argv + optind);
11115 } else
11116 ret = tcc_output_file(s, outfile) ? 1 : 0;
11117 the_end:
11118 /* XXX: cannot do it with bound checking because of the malloc hooks */
11119 if (!do_bounds_check)
11120 tcc_delete(s);
11122 #ifdef MEM_DEBUG
11123 if (do_bench) {
11124 printf("memory: %d bytes, max = %d bytes\n", mem_cur_size, mem_max_size);
11126 #endif
11127 return ret;
11130 #endif