Futher changes to casts
[tinycc/daniel.git] / tcc.c
blobb05f65e7102df7e1543ab03c29bf20b7ebeb37ae
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->hash->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_LCHAR:
1774 cstr_ccat(&cstr_buf, 'L');
1775 case TOK_CCHAR:
1776 cstr_ccat(&cstr_buf, '\'');
1777 add_char(&cstr_buf, cv->i);
1778 cstr_ccat(&cstr_buf, '\'');
1779 cstr_ccat(&cstr_buf, '\0');
1780 break;
1781 case TOK_PPNUM:
1782 cstr = cv->cstr;
1783 len = cstr->size - 1;
1784 for(i=0;i<len;i++)
1785 add_char(&cstr_buf, ((unsigned char *)cstr->data)[i]);
1786 cstr_ccat(&cstr_buf, '\0');
1787 break;
1788 case TOK_LSTR:
1789 cstr_ccat(&cstr_buf, 'L');
1790 case TOK_STR:
1791 cstr = cv->cstr;
1792 cstr_ccat(&cstr_buf, '\"');
1793 if (v == TOK_STR) {
1794 len = cstr->size - 1;
1795 for(i=0;i<len;i++)
1796 add_char(&cstr_buf, ((unsigned char *)cstr->data)[i]);
1797 } else {
1798 len = (cstr->size / sizeof(nwchar_t)) - 1;
1799 for(i=0;i<len;i++)
1800 add_char(&cstr_buf, ((nwchar_t *)cstr->data)[i]);
1802 cstr_ccat(&cstr_buf, '\"');
1803 cstr_ccat(&cstr_buf, '\0');
1804 break;
1805 case TOK_LT:
1806 v = '<';
1807 goto addv;
1808 case TOK_GT:
1809 v = '>';
1810 goto addv;
1811 case TOK_DOTS:
1812 return strcpy(p, "...");
1813 case TOK_A_SHL:
1814 return strcpy(p, "<<=");
1815 case TOK_A_SAR:
1816 return strcpy(p, ">>=");
1817 default:
1818 if (v < TOK_IDENT) {
1819 /* search in two bytes table */
1820 q = tok_two_chars;
1821 while (*q) {
1822 if (q[2] == v) {
1823 *p++ = q[0];
1824 *p++ = q[1];
1825 *p = '\0';
1826 return buf;
1828 q += 3;
1830 addv:
1831 *p++ = v;
1832 *p = '\0';
1833 } else if (v < tok_ident) {
1834 return table_ident[v - TOK_IDENT]->str;
1835 } else if (v >= SYM_FIRST_ANOM) {
1836 /* special name for anonymous symbol */
1837 sprintf(p, "L.%u", v - SYM_FIRST_ANOM);
1838 } else {
1839 /* should never happen */
1840 return NULL;
1842 break;
1844 return cstr_buf.data;
1847 /* push, without hashing */
1848 static Sym *sym_push2(Sym **ps, int v, int t, int c)
1850 Sym *s;
1851 s = sym_malloc();
1852 s->v = v;
1853 s->type.t = t;
1854 s->c = c;
1855 s->next = NULL;
1856 /* add in stack */
1857 s->prev = *ps;
1858 *ps = s;
1859 return s;
1862 /* find a symbol and return its associated structure. 's' is the top
1863 of the symbol stack */
1864 static Sym *sym_find2(Sym *s, int v)
1866 while (s) {
1867 if (s->v == v)
1868 return s;
1869 s = s->prev;
1871 return NULL;
1874 /* structure lookup */
1875 static inline Sym *struct_find(int v)
1877 v -= TOK_IDENT;
1878 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
1879 return NULL;
1880 return table_ident[v]->sym_struct;
1883 /* find an identifier */
1884 static inline Sym *sym_find(int v)
1886 v -= TOK_IDENT;
1887 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
1888 return NULL;
1889 return table_ident[v]->sym_identifier;
1892 /* push a given symbol on the symbol stack */
1893 static Sym *sym_push(int v, CType *type, int r, int c)
1895 Sym *s, **ps;
1896 TokenSym *ts;
1898 if (local_stack)
1899 ps = &local_stack;
1900 else
1901 ps = &global_stack;
1902 s = sym_push2(ps, v, type->t, c);
1903 s->type.ref = type->ref;
1904 s->r = r;
1905 /* don't record fields or anonymous symbols */
1906 /* XXX: simplify */
1907 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
1908 /* record symbol in token array */
1909 ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT];
1910 if (v & SYM_STRUCT)
1911 ps = &ts->sym_struct;
1912 else
1913 ps = &ts->sym_identifier;
1914 s->prev_tok = *ps;
1915 *ps = s;
1917 return s;
1920 /* push a global identifier */
1921 static Sym *global_identifier_push(int v, int t, int c)
1923 Sym *s, **ps;
1924 s = sym_push2(&global_stack, v, t, c);
1925 /* don't record anonymous symbol */
1926 if (v < SYM_FIRST_ANOM) {
1927 ps = &table_ident[v - TOK_IDENT]->sym_identifier;
1928 /* modify the top most local identifier, so that
1929 sym_identifier will point to 's' when popped */
1930 while (*ps != NULL)
1931 ps = &(*ps)->prev_tok;
1932 s->prev_tok = NULL;
1933 *ps = s;
1935 return s;
1938 /* pop symbols until top reaches 'b' */
1939 static void sym_pop(Sym **ptop, Sym *b)
1941 Sym *s, *ss, **ps;
1942 TokenSym *ts;
1943 int v;
1945 s = *ptop;
1946 while(s != b) {
1947 ss = s->prev;
1948 v = s->v;
1949 /* remove symbol in token array */
1950 /* XXX: simplify */
1951 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
1952 ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT];
1953 if (v & SYM_STRUCT)
1954 ps = &ts->sym_struct;
1955 else
1956 ps = &ts->sym_identifier;
1957 *ps = s->prev_tok;
1959 sym_free(s);
1960 s = ss;
1962 *ptop = b;
1965 /* I/O layer */
1967 BufferedFile *tcc_open(TCCState *s1, const char *filename)
1969 int fd;
1970 BufferedFile *bf;
1972 if (strcmp(filename, "-") == 0)
1973 fd = 0, filename = "stdin";
1974 else
1975 fd = open(filename, O_RDONLY | O_BINARY);
1976 if ((verbose == 2 && fd >= 0) || verbose == 3)
1977 printf("%s %*s%s\n", fd < 0 ? "nf":"->",
1978 (s1->include_stack_ptr - s1->include_stack), "", filename);
1979 if (fd < 0)
1980 return NULL;
1981 bf = tcc_malloc(sizeof(BufferedFile));
1982 bf->fd = fd;
1983 bf->buf_ptr = bf->buffer;
1984 bf->buf_end = bf->buffer;
1985 bf->buffer[0] = CH_EOB; /* put eob symbol */
1986 pstrcpy(bf->filename, sizeof(bf->filename), filename);
1987 #ifdef _WIN32
1988 normalize_slashes(bf->filename);
1989 #endif
1990 bf->line_num = 1;
1991 bf->ifndef_macro = 0;
1992 bf->ifdef_stack_ptr = s1->ifdef_stack_ptr;
1993 // printf("opening '%s'\n", filename);
1994 return bf;
1997 void tcc_close(BufferedFile *bf)
1999 total_lines += bf->line_num;
2000 close(bf->fd);
2001 tcc_free(bf);
2004 /* fill input buffer and peek next char */
2005 static int tcc_peekc_slow(BufferedFile *bf)
2007 int len;
2008 /* only tries to read if really end of buffer */
2009 if (bf->buf_ptr >= bf->buf_end) {
2010 if (bf->fd != -1) {
2011 #if defined(PARSE_DEBUG)
2012 len = 8;
2013 #else
2014 len = IO_BUF_SIZE;
2015 #endif
2016 len = read(bf->fd, bf->buffer, len);
2017 if (len < 0)
2018 len = 0;
2019 } else {
2020 len = 0;
2022 total_bytes += len;
2023 bf->buf_ptr = bf->buffer;
2024 bf->buf_end = bf->buffer + len;
2025 *bf->buf_end = CH_EOB;
2027 if (bf->buf_ptr < bf->buf_end) {
2028 return bf->buf_ptr[0];
2029 } else {
2030 bf->buf_ptr = bf->buf_end;
2031 return CH_EOF;
2035 /* return the current character, handling end of block if necessary
2036 (but not stray) */
2037 static int handle_eob(void)
2039 return tcc_peekc_slow(file);
2042 /* read next char from current input file and handle end of input buffer */
2043 static inline void inp(void)
2045 ch = *(++(file->buf_ptr));
2046 /* end of buffer/file handling */
2047 if (ch == CH_EOB)
2048 ch = handle_eob();
2051 /* handle '\[\r]\n' */
2052 static int handle_stray_noerror(void)
2054 while (ch == '\\') {
2055 inp();
2056 if (ch == '\n') {
2057 file->line_num++;
2058 inp();
2059 } else if (ch == '\r') {
2060 inp();
2061 if (ch != '\n')
2062 goto fail;
2063 file->line_num++;
2064 inp();
2065 } else {
2066 fail:
2067 return 1;
2070 return 0;
2073 static void handle_stray(void)
2075 if (handle_stray_noerror())
2076 error("stray '\\' in program");
2079 /* skip the stray and handle the \\n case. Output an error if
2080 incorrect char after the stray */
2081 static int handle_stray1(uint8_t *p)
2083 int c;
2085 if (p >= file->buf_end) {
2086 file->buf_ptr = p;
2087 c = handle_eob();
2088 p = file->buf_ptr;
2089 if (c == '\\')
2090 goto parse_stray;
2091 } else {
2092 parse_stray:
2093 file->buf_ptr = p;
2094 ch = *p;
2095 handle_stray();
2096 p = file->buf_ptr;
2097 c = *p;
2099 return c;
2102 /* handle just the EOB case, but not stray */
2103 #define PEEKC_EOB(c, p)\
2105 p++;\
2106 c = *p;\
2107 if (c == '\\') {\
2108 file->buf_ptr = p;\
2109 c = handle_eob();\
2110 p = file->buf_ptr;\
2114 /* handle the complicated stray case */
2115 #define PEEKC(c, p)\
2117 p++;\
2118 c = *p;\
2119 if (c == '\\') {\
2120 c = handle_stray1(p);\
2121 p = file->buf_ptr;\
2125 /* input with '\[\r]\n' handling. Note that this function cannot
2126 handle other characters after '\', so you cannot call it inside
2127 strings or comments */
2128 static void minp(void)
2130 inp();
2131 if (ch == '\\')
2132 handle_stray();
2136 /* single line C++ comments */
2137 static uint8_t *parse_line_comment(uint8_t *p)
2139 int c;
2141 p++;
2142 for(;;) {
2143 c = *p;
2144 redo:
2145 if (c == '\n' || c == CH_EOF) {
2146 break;
2147 } else if (c == '\\') {
2148 file->buf_ptr = p;
2149 c = handle_eob();
2150 p = file->buf_ptr;
2151 if (c == '\\') {
2152 PEEKC_EOB(c, p);
2153 if (c == '\n') {
2154 file->line_num++;
2155 PEEKC_EOB(c, p);
2156 } else if (c == '\r') {
2157 PEEKC_EOB(c, p);
2158 if (c == '\n') {
2159 file->line_num++;
2160 PEEKC_EOB(c, p);
2163 } else {
2164 goto redo;
2166 } else {
2167 p++;
2170 return p;
2173 /* C comments */
2174 static uint8_t *parse_comment(uint8_t *p)
2176 int c;
2178 p++;
2179 for(;;) {
2180 /* fast skip loop */
2181 for(;;) {
2182 c = *p;
2183 if (c == '\n' || c == '*' || c == '\\')
2184 break;
2185 p++;
2186 c = *p;
2187 if (c == '\n' || c == '*' || c == '\\')
2188 break;
2189 p++;
2191 /* now we can handle all the cases */
2192 if (c == '\n') {
2193 file->line_num++;
2194 p++;
2195 } else if (c == '*') {
2196 p++;
2197 for(;;) {
2198 c = *p;
2199 if (c == '*') {
2200 p++;
2201 } else if (c == '/') {
2202 goto end_of_comment;
2203 } else if (c == '\\') {
2204 file->buf_ptr = p;
2205 c = handle_eob();
2206 p = file->buf_ptr;
2207 if (c == '\\') {
2208 /* skip '\[\r]\n', otherwise just skip the stray */
2209 while (c == '\\') {
2210 PEEKC_EOB(c, p);
2211 if (c == '\n') {
2212 file->line_num++;
2213 PEEKC_EOB(c, p);
2214 } else if (c == '\r') {
2215 PEEKC_EOB(c, p);
2216 if (c == '\n') {
2217 file->line_num++;
2218 PEEKC_EOB(c, p);
2220 } else {
2221 goto after_star;
2225 } else {
2226 break;
2229 after_star: ;
2230 } else {
2231 /* stray, eob or eof */
2232 file->buf_ptr = p;
2233 c = handle_eob();
2234 p = file->buf_ptr;
2235 if (c == CH_EOF) {
2236 error("unexpected end of file in comment");
2237 } else if (c == '\\') {
2238 p++;
2242 end_of_comment:
2243 p++;
2244 return p;
2247 #define cinp minp
2249 /* space exlcuding newline */
2250 static inline int is_space(int ch)
2252 return ch == ' ' || ch == '\t' || ch == '\v' || ch == '\f' || ch == '\r';
2255 static inline void skip_spaces(void)
2257 while (is_space(ch))
2258 cinp();
2261 /* parse a string without interpreting escapes */
2262 static uint8_t *parse_pp_string(uint8_t *p,
2263 int sep, CString *str)
2265 int c;
2266 p++;
2267 for(;;) {
2268 c = *p;
2269 if (c == sep) {
2270 break;
2271 } else if (c == '\\') {
2272 file->buf_ptr = p;
2273 c = handle_eob();
2274 p = file->buf_ptr;
2275 if (c == CH_EOF) {
2276 unterminated_string:
2277 /* XXX: indicate line number of start of string */
2278 error("missing terminating %c character", sep);
2279 } else if (c == '\\') {
2280 /* escape : just skip \[\r]\n */
2281 PEEKC_EOB(c, p);
2282 if (c == '\n') {
2283 file->line_num++;
2284 p++;
2285 } else if (c == '\r') {
2286 PEEKC_EOB(c, p);
2287 if (c != '\n')
2288 expect("'\n' after '\r'");
2289 file->line_num++;
2290 p++;
2291 } else if (c == CH_EOF) {
2292 goto unterminated_string;
2293 } else {
2294 if (str) {
2295 cstr_ccat(str, '\\');
2296 cstr_ccat(str, c);
2298 p++;
2301 } else if (c == '\n') {
2302 file->line_num++;
2303 goto add_char;
2304 } else if (c == '\r') {
2305 PEEKC_EOB(c, p);
2306 if (c != '\n') {
2307 if (str)
2308 cstr_ccat(str, '\r');
2309 } else {
2310 file->line_num++;
2311 goto add_char;
2313 } else {
2314 add_char:
2315 if (str)
2316 cstr_ccat(str, c);
2317 p++;
2320 p++;
2321 return p;
2324 /* skip block of text until #else, #elif or #endif. skip also pairs of
2325 #if/#endif */
2326 void preprocess_skip(void)
2328 int a, start_of_line, c, in_warn_or_error;
2329 uint8_t *p;
2331 p = file->buf_ptr;
2332 a = 0;
2333 redo_start:
2334 start_of_line = 1;
2335 in_warn_or_error = 0;
2336 for(;;) {
2337 redo_no_start:
2338 c = *p;
2339 switch(c) {
2340 case ' ':
2341 case '\t':
2342 case '\f':
2343 case '\v':
2344 case '\r':
2345 p++;
2346 goto redo_no_start;
2347 case '\n':
2348 file->line_num++;
2349 p++;
2350 goto redo_start;
2351 case '\\':
2352 file->buf_ptr = p;
2353 c = handle_eob();
2354 if (c == CH_EOF) {
2355 expect("#endif");
2356 } else if (c == '\\') {
2357 ch = file->buf_ptr[0];
2358 handle_stray_noerror();
2360 p = file->buf_ptr;
2361 goto redo_no_start;
2362 /* skip strings */
2363 case '\"':
2364 case '\'':
2365 if (in_warn_or_error)
2366 goto _default;
2367 p = parse_pp_string(p, c, NULL);
2368 break;
2369 /* skip comments */
2370 case '/':
2371 if (in_warn_or_error)
2372 goto _default;
2373 file->buf_ptr = p;
2374 ch = *p;
2375 minp();
2376 p = file->buf_ptr;
2377 if (ch == '*') {
2378 p = parse_comment(p);
2379 } else if (ch == '/') {
2380 p = parse_line_comment(p);
2382 break;
2383 case '#':
2384 p++;
2385 if (start_of_line) {
2386 file->buf_ptr = p;
2387 next_nomacro();
2388 p = file->buf_ptr;
2389 if (a == 0 &&
2390 (tok == TOK_ELSE || tok == TOK_ELIF || tok == TOK_ENDIF))
2391 goto the_end;
2392 if (tok == TOK_IF || tok == TOK_IFDEF || tok == TOK_IFNDEF)
2393 a++;
2394 else if (tok == TOK_ENDIF)
2395 a--;
2396 else if( tok == TOK_ERROR || tok == TOK_WARNING)
2397 in_warn_or_error = 1;
2399 break;
2400 _default:
2401 default:
2402 p++;
2403 break;
2405 start_of_line = 0;
2407 the_end: ;
2408 file->buf_ptr = p;
2411 /* ParseState handling */
2413 /* XXX: currently, no include file info is stored. Thus, we cannot display
2414 accurate messages if the function or data definition spans multiple
2415 files */
2417 /* save current parse state in 's' */
2418 void save_parse_state(ParseState *s)
2420 s->line_num = file->line_num;
2421 s->macro_ptr = macro_ptr;
2422 s->tok = tok;
2423 s->tokc = tokc;
2426 /* restore parse state from 's' */
2427 void restore_parse_state(ParseState *s)
2429 file->line_num = s->line_num;
2430 macro_ptr = s->macro_ptr;
2431 tok = s->tok;
2432 tokc = s->tokc;
2435 /* return the number of additional 'ints' necessary to store the
2436 token */
2437 static inline int tok_ext_size(int t)
2439 switch(t) {
2440 /* 4 bytes */
2441 case TOK_CINT:
2442 case TOK_CUINT:
2443 case TOK_CCHAR:
2444 case TOK_LCHAR:
2445 case TOK_CFLOAT:
2446 case TOK_LINENUM:
2447 return 1;
2448 case TOK_STR:
2449 case TOK_LSTR:
2450 case TOK_PPNUM:
2451 error("unsupported token");
2452 return 1;
2453 case TOK_CDOUBLE:
2454 case TOK_CLLONG:
2455 case TOK_CULLONG:
2456 return 2;
2457 case TOK_CLDOUBLE:
2458 return LDOUBLE_SIZE / 4;
2459 default:
2460 return 0;
2464 /* token string handling */
2466 static inline void tok_str_new(TokenString *s)
2468 s->str = NULL;
2469 s->len = 0;
2470 s->allocated_len = 0;
2471 s->last_line_num = -1;
2474 static void tok_str_free(int *str)
2476 tcc_free(str);
2479 static int *tok_str_realloc(TokenString *s)
2481 int *str, len;
2483 if (s->allocated_len == 0) {
2484 len = 8;
2485 } else {
2486 len = s->allocated_len * 2;
2488 str = tcc_realloc(s->str, len * sizeof(int));
2489 if (!str)
2490 error("memory full");
2491 s->allocated_len = len;
2492 s->str = str;
2493 return str;
2496 static void tok_str_add(TokenString *s, int t)
2498 int len, *str;
2500 len = s->len;
2501 str = s->str;
2502 if (len >= s->allocated_len)
2503 str = tok_str_realloc(s);
2504 str[len++] = t;
2505 s->len = len;
2508 static void tok_str_add2(TokenString *s, int t, CValue *cv)
2510 int len, *str;
2512 len = s->len;
2513 str = s->str;
2515 /* allocate space for worst case */
2516 if (len + TOK_MAX_SIZE > s->allocated_len)
2517 str = tok_str_realloc(s);
2518 str[len++] = t;
2519 switch(t) {
2520 case TOK_CINT:
2521 case TOK_CUINT:
2522 case TOK_CCHAR:
2523 case TOK_LCHAR:
2524 case TOK_CFLOAT:
2525 case TOK_LINENUM:
2526 str[len++] = cv->tab[0];
2527 break;
2528 case TOK_PPNUM:
2529 case TOK_STR:
2530 case TOK_LSTR:
2532 int nb_words;
2533 CString *cstr;
2535 nb_words = (sizeof(CString) + cv->cstr->size + 3) >> 2;
2536 while ((len + nb_words) > s->allocated_len)
2537 str = tok_str_realloc(s);
2538 cstr = (CString *)(str + len);
2539 cstr->data = NULL;
2540 cstr->size = cv->cstr->size;
2541 cstr->data_allocated = NULL;
2542 cstr->size_allocated = cstr->size;
2543 memcpy((char *)cstr + sizeof(CString),
2544 cv->cstr->data, cstr->size);
2545 len += nb_words;
2547 break;
2548 case TOK_CDOUBLE:
2549 case TOK_CLLONG:
2550 case TOK_CULLONG:
2551 #if LDOUBLE_SIZE == 8
2552 case TOK_CLDOUBLE:
2553 #endif
2554 str[len++] = cv->tab[0];
2555 str[len++] = cv->tab[1];
2556 break;
2557 #if LDOUBLE_SIZE == 12
2558 case TOK_CLDOUBLE:
2559 str[len++] = cv->tab[0];
2560 str[len++] = cv->tab[1];
2561 str[len++] = cv->tab[2];
2562 #elif LDOUBLE_SIZE != 8
2563 #error add long double size support
2564 #endif
2565 break;
2566 default:
2567 break;
2569 s->len = len;
2572 /* add the current parse token in token string 's' */
2573 static void tok_str_add_tok(TokenString *s)
2575 CValue cval;
2577 /* save line number info */
2578 if (file->line_num != s->last_line_num) {
2579 s->last_line_num = file->line_num;
2580 cval.i = s->last_line_num;
2581 tok_str_add2(s, TOK_LINENUM, &cval);
2583 tok_str_add2(s, tok, &tokc);
2586 #if LDOUBLE_SIZE == 12
2587 #define LDOUBLE_GET(p, cv) \
2588 cv.tab[0] = p[0]; \
2589 cv.tab[1] = p[1]; \
2590 cv.tab[2] = p[2];
2591 #elif LDOUBLE_SIZE == 8
2592 #define LDOUBLE_GET(p, cv) \
2593 cv.tab[0] = p[0]; \
2594 cv.tab[1] = p[1];
2595 #else
2596 #error add long double size support
2597 #endif
2600 /* get a token from an integer array and increment pointer
2601 accordingly. we code it as a macro to avoid pointer aliasing. */
2602 #define TOK_GET(t, p, cv) \
2604 t = *p++; \
2605 switch(t) { \
2606 case TOK_CINT: \
2607 case TOK_CUINT: \
2608 case TOK_CCHAR: \
2609 case TOK_LCHAR: \
2610 case TOK_CFLOAT: \
2611 case TOK_LINENUM: \
2612 cv.tab[0] = *p++; \
2613 break; \
2614 case TOK_STR: \
2615 case TOK_LSTR: \
2616 case TOK_PPNUM: \
2617 cv.cstr = (CString *)p; \
2618 cv.cstr->data = (char *)p + sizeof(CString);\
2619 p += (sizeof(CString) + cv.cstr->size + 3) >> 2;\
2620 break; \
2621 case TOK_CDOUBLE: \
2622 case TOK_CLLONG: \
2623 case TOK_CULLONG: \
2624 cv.tab[0] = p[0]; \
2625 cv.tab[1] = p[1]; \
2626 p += 2; \
2627 break; \
2628 case TOK_CLDOUBLE: \
2629 LDOUBLE_GET(p, cv); \
2630 p += LDOUBLE_SIZE / 4; \
2631 break; \
2632 default: \
2633 break; \
2637 /* defines handling */
2638 static inline void define_push(int v, int macro_type, int *str, Sym *first_arg)
2640 Sym *s;
2642 s = sym_push2(&define_stack, v, macro_type, (int)str);
2643 s->next = first_arg;
2644 table_ident[v - TOK_IDENT]->sym_define = s;
2647 /* undefined a define symbol. Its name is just set to zero */
2648 static void define_undef(Sym *s)
2650 int v;
2651 v = s->v;
2652 if (v >= TOK_IDENT && v < tok_ident)
2653 table_ident[v - TOK_IDENT]->sym_define = NULL;
2654 s->v = 0;
2657 static inline Sym *define_find(int v)
2659 v -= TOK_IDENT;
2660 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
2661 return NULL;
2662 return table_ident[v]->sym_define;
2665 /* free define stack until top reaches 'b' */
2666 static void free_defines(Sym *b)
2668 Sym *top, *top1;
2669 int v;
2671 top = define_stack;
2672 while (top != b) {
2673 top1 = top->prev;
2674 /* do not free args or predefined defines */
2675 if (top->c)
2676 tok_str_free((int *)top->c);
2677 v = top->v;
2678 if (v >= TOK_IDENT && v < tok_ident)
2679 table_ident[v - TOK_IDENT]->sym_define = NULL;
2680 sym_free(top);
2681 top = top1;
2683 define_stack = b;
2686 /* label lookup */
2687 static Sym *label_find(int v)
2689 v -= TOK_IDENT;
2690 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
2691 return NULL;
2692 return table_ident[v]->sym_label;
2695 static Sym *label_push(Sym **ptop, int v, int flags)
2697 Sym *s, **ps;
2698 s = sym_push2(ptop, v, 0, 0);
2699 s->r = flags;
2700 ps = &table_ident[v - TOK_IDENT]->sym_label;
2701 if (ptop == &global_label_stack) {
2702 /* modify the top most local identifier, so that
2703 sym_identifier will point to 's' when popped */
2704 while (*ps != NULL)
2705 ps = &(*ps)->prev_tok;
2707 s->prev_tok = *ps;
2708 *ps = s;
2709 return s;
2712 /* pop labels until element last is reached. Look if any labels are
2713 undefined. Define symbols if '&&label' was used. */
2714 static void label_pop(Sym **ptop, Sym *slast)
2716 Sym *s, *s1;
2717 for(s = *ptop; s != slast; s = s1) {
2718 s1 = s->prev;
2719 if (s->r == LABEL_DECLARED) {
2720 warning("label '%s' declared but not used", get_tok_str(s->v, NULL));
2721 } else if (s->r == LABEL_FORWARD) {
2722 error("label '%s' used but not defined",
2723 get_tok_str(s->v, NULL));
2724 } else {
2725 if (s->c) {
2726 /* define corresponding symbol. A size of
2727 1 is put. */
2728 put_extern_sym(s, cur_text_section, (long)s->next, 1);
2731 /* remove label */
2732 table_ident[s->v - TOK_IDENT]->sym_label = s->prev_tok;
2733 sym_free(s);
2735 *ptop = slast;
2738 /* eval an expression for #if/#elif */
2739 static int expr_preprocess(void)
2741 int c, t;
2742 TokenString str;
2744 tok_str_new(&str);
2745 while (tok != TOK_LINEFEED && tok != TOK_EOF) {
2746 next(); /* do macro subst */
2747 if (tok == TOK_DEFINED) {
2748 next_nomacro();
2749 t = tok;
2750 if (t == '(')
2751 next_nomacro();
2752 c = define_find(tok) != 0;
2753 if (t == '(')
2754 next_nomacro();
2755 tok = TOK_CINT;
2756 tokc.i = c;
2757 } else if (tok >= TOK_IDENT) {
2758 /* if undefined macro */
2759 tok = TOK_CINT;
2760 tokc.i = 0;
2762 tok_str_add_tok(&str);
2764 tok_str_add(&str, -1); /* simulate end of file */
2765 tok_str_add(&str, 0);
2766 /* now evaluate C constant expression */
2767 macro_ptr = str.str;
2768 next();
2769 c = expr_const();
2770 macro_ptr = NULL;
2771 tok_str_free(str.str);
2772 return c != 0;
2775 #if defined(PARSE_DEBUG) || defined(PP_DEBUG)
2776 static void tok_print(int *str)
2778 int t;
2779 CValue cval;
2781 while (1) {
2782 TOK_GET(t, str, cval);
2783 if (!t)
2784 break;
2785 printf(" %s", get_tok_str(t, &cval));
2787 printf("\n");
2789 #endif
2791 /* parse after #define */
2792 static void parse_define(void)
2794 Sym *s, *first, **ps;
2795 int v, t, varg, is_vaargs, c;
2796 TokenString str;
2798 v = tok;
2799 if (v < TOK_IDENT)
2800 error("invalid macro name '%s'", get_tok_str(tok, &tokc));
2801 /* XXX: should check if same macro (ANSI) */
2802 first = NULL;
2803 t = MACRO_OBJ;
2804 /* '(' must be just after macro definition for MACRO_FUNC */
2805 c = file->buf_ptr[0];
2806 if (c == '\\')
2807 c = handle_stray1(file->buf_ptr);
2808 if (c == '(') {
2809 next_nomacro();
2810 next_nomacro();
2811 ps = &first;
2812 while (tok != ')') {
2813 varg = tok;
2814 next_nomacro();
2815 is_vaargs = 0;
2816 if (varg == TOK_DOTS) {
2817 varg = TOK___VA_ARGS__;
2818 is_vaargs = 1;
2819 } else if (tok == TOK_DOTS && gnu_ext) {
2820 is_vaargs = 1;
2821 next_nomacro();
2823 if (varg < TOK_IDENT)
2824 error("badly punctuated parameter list");
2825 s = sym_push2(&define_stack, varg | SYM_FIELD, is_vaargs, 0);
2826 *ps = s;
2827 ps = &s->next;
2828 if (tok != ',')
2829 break;
2830 next_nomacro();
2832 t = MACRO_FUNC;
2834 tok_str_new(&str);
2835 next_nomacro();
2836 /* EOF testing necessary for '-D' handling */
2837 while (tok != TOK_LINEFEED && tok != TOK_EOF) {
2838 tok_str_add2(&str, tok, &tokc);
2839 next_nomacro();
2841 tok_str_add(&str, 0);
2842 #ifdef PP_DEBUG
2843 printf("define %s %d: ", get_tok_str(v, NULL), t);
2844 tok_print(str.str);
2845 #endif
2846 define_push(v, t, str.str, first);
2849 static inline int hash_cached_include(int type, const char *filename)
2851 const unsigned char *s;
2852 unsigned int h;
2854 h = TOK_HASH_INIT;
2855 h = TOK_HASH_FUNC(h, type);
2856 s = filename;
2857 while (*s) {
2858 h = TOK_HASH_FUNC(h, *s);
2859 s++;
2861 h &= (CACHED_INCLUDES_HASH_SIZE - 1);
2862 return h;
2865 /* XXX: use a token or a hash table to accelerate matching ? */
2866 static CachedInclude *search_cached_include(TCCState *s1,
2867 int type, const char *filename)
2869 CachedInclude *e;
2870 int i, h;
2871 h = hash_cached_include(type, filename);
2872 i = s1->cached_includes_hash[h];
2873 for(;;) {
2874 if (i == 0)
2875 break;
2876 e = s1->cached_includes[i - 1];
2877 if (e->type == type && !strcmp(e->filename, filename))
2878 return e;
2879 i = e->hash_next;
2881 return NULL;
2884 static inline void add_cached_include(TCCState *s1, int type,
2885 const char *filename, int ifndef_macro)
2887 CachedInclude *e;
2888 int h;
2890 if (search_cached_include(s1, type, filename))
2891 return;
2892 #ifdef INC_DEBUG
2893 printf("adding cached '%s' %s\n", filename, get_tok_str(ifndef_macro, NULL));
2894 #endif
2895 e = tcc_malloc(sizeof(CachedInclude) + strlen(filename));
2896 if (!e)
2897 return;
2898 e->type = type;
2899 strcpy(e->filename, filename);
2900 e->ifndef_macro = ifndef_macro;
2901 dynarray_add((void ***)&s1->cached_includes, &s1->nb_cached_includes, e);
2902 /* add in hash table */
2903 h = hash_cached_include(type, filename);
2904 e->hash_next = s1->cached_includes_hash[h];
2905 s1->cached_includes_hash[h] = s1->nb_cached_includes;
2908 static void pragma_parse(TCCState *s1)
2910 int val;
2912 next();
2913 if (tok == TOK_pack) {
2915 This may be:
2916 #pragma pack(1) // set
2917 #pragma pack() // reset to default
2918 #pragma pack(push,1) // push & set
2919 #pragma pack(pop) // restore previous
2921 next();
2922 skip('(');
2923 if (tok == TOK_ASM_pop) {
2924 next();
2925 if (s1->pack_stack_ptr <= s1->pack_stack) {
2926 stk_error:
2927 error("out of pack stack");
2929 s1->pack_stack_ptr--;
2930 } else {
2931 val = 0;
2932 if (tok != ')') {
2933 if (tok == TOK_ASM_push) {
2934 next();
2935 if (s1->pack_stack_ptr >= s1->pack_stack + PACK_STACK_SIZE - 1)
2936 goto stk_error;
2937 s1->pack_stack_ptr++;
2938 skip(',');
2940 if (tok != TOK_CINT) {
2941 pack_error:
2942 error("invalid pack pragma");
2944 val = tokc.i;
2945 if (val < 1 || val > 16 || (val & (val - 1)) != 0)
2946 goto pack_error;
2947 next();
2949 *s1->pack_stack_ptr = val;
2950 skip(')');
2955 /* is_bof is true if first non space token at beginning of file */
2956 static void preprocess(int is_bof)
2958 TCCState *s1 = tcc_state;
2959 int size, i, c, n, saved_parse_flags;
2960 char buf[1024], *q;
2961 char buf1[1024];
2962 BufferedFile *f;
2963 Sym *s;
2964 CachedInclude *e;
2966 saved_parse_flags = parse_flags;
2967 parse_flags = PARSE_FLAG_PREPROCESS | PARSE_FLAG_TOK_NUM |
2968 PARSE_FLAG_LINEFEED;
2969 next_nomacro();
2970 redo:
2971 switch(tok) {
2972 case TOK_DEFINE:
2973 next_nomacro();
2974 parse_define();
2975 break;
2976 case TOK_UNDEF:
2977 next_nomacro();
2978 s = define_find(tok);
2979 /* undefine symbol by putting an invalid name */
2980 if (s)
2981 define_undef(s);
2982 break;
2983 case TOK_INCLUDE:
2984 case TOK_INCLUDE_NEXT:
2985 ch = file->buf_ptr[0];
2986 /* XXX: incorrect if comments : use next_nomacro with a special mode */
2987 skip_spaces();
2988 if (ch == '<') {
2989 c = '>';
2990 goto read_name;
2991 } else if (ch == '\"') {
2992 c = ch;
2993 read_name:
2994 inp();
2995 q = buf;
2996 while (ch != c && ch != '\n' && ch != CH_EOF) {
2997 if ((q - buf) < sizeof(buf) - 1)
2998 *q++ = ch;
2999 if (ch == '\\') {
3000 if (handle_stray_noerror() == 0)
3001 --q;
3002 } else
3003 inp();
3005 *q = '\0';
3006 minp();
3007 #if 0
3008 /* eat all spaces and comments after include */
3009 /* XXX: slightly incorrect */
3010 while (ch1 != '\n' && ch1 != CH_EOF)
3011 inp();
3012 #endif
3013 } else {
3014 /* computed #include : either we have only strings or
3015 we have anything enclosed in '<>' */
3016 next();
3017 buf[0] = '\0';
3018 if (tok == TOK_STR) {
3019 while (tok != TOK_LINEFEED) {
3020 if (tok != TOK_STR) {
3021 include_syntax:
3022 error("'#include' expects \"FILENAME\" or <FILENAME>");
3024 pstrcat(buf, sizeof(buf), (char *)tokc.cstr->data);
3025 next();
3027 c = '\"';
3028 } else {
3029 int len;
3030 while (tok != TOK_LINEFEED) {
3031 pstrcat(buf, sizeof(buf), get_tok_str(tok, &tokc));
3032 next();
3034 len = strlen(buf);
3035 /* check syntax and remove '<>' */
3036 if (len < 2 || buf[0] != '<' || buf[len - 1] != '>')
3037 goto include_syntax;
3038 memmove(buf, buf + 1, len - 2);
3039 buf[len - 2] = '\0';
3040 c = '>';
3044 e = search_cached_include(s1, c, buf);
3045 if (e && define_find(e->ifndef_macro)) {
3046 /* no need to parse the include because the 'ifndef macro'
3047 is defined */
3048 #ifdef INC_DEBUG
3049 printf("%s: skipping %s\n", file->filename, buf);
3050 #endif
3051 } else {
3052 if (s1->include_stack_ptr >= s1->include_stack + INCLUDE_STACK_SIZE)
3053 error("#include recursion too deep");
3054 /* push current file in stack */
3055 /* XXX: fix current line init */
3056 *s1->include_stack_ptr++ = file;
3057 if (c == '\"') {
3058 /* first search in current dir if "header.h" */
3059 size = tcc_basename(file->filename) - file->filename;
3060 if (size > sizeof(buf1) - 1)
3061 size = sizeof(buf1) - 1;
3062 memcpy(buf1, file->filename, size);
3063 buf1[size] = '\0';
3064 pstrcat(buf1, sizeof(buf1), buf);
3065 f = tcc_open(s1, buf1);
3066 if (f) {
3067 if (tok == TOK_INCLUDE_NEXT)
3068 tok = TOK_INCLUDE;
3069 else
3070 goto found;
3073 /* now search in all the include paths */
3074 n = s1->nb_include_paths + s1->nb_sysinclude_paths;
3075 for(i = 0; i < n; i++) {
3076 const char *path;
3077 if (i < s1->nb_include_paths)
3078 path = s1->include_paths[i];
3079 else
3080 path = s1->sysinclude_paths[i - s1->nb_include_paths];
3081 pstrcpy(buf1, sizeof(buf1), path);
3082 pstrcat(buf1, sizeof(buf1), "/");
3083 pstrcat(buf1, sizeof(buf1), buf);
3084 f = tcc_open(s1, buf1);
3085 if (f) {
3086 if (tok == TOK_INCLUDE_NEXT)
3087 tok = TOK_INCLUDE;
3088 else
3089 goto found;
3092 --s1->include_stack_ptr;
3093 error("include file '%s' not found", buf);
3094 break;
3095 found:
3096 #ifdef INC_DEBUG
3097 printf("%s: including %s\n", file->filename, buf1);
3098 #endif
3099 f->inc_type = c;
3100 pstrcpy(f->inc_filename, sizeof(f->inc_filename), buf);
3101 file = f;
3102 /* add include file debug info */
3103 if (do_debug) {
3104 put_stabs(file->filename, N_BINCL, 0, 0, 0);
3106 tok_flags |= TOK_FLAG_BOF | TOK_FLAG_BOL;
3107 ch = file->buf_ptr[0];
3108 goto the_end;
3110 break;
3111 case TOK_IFNDEF:
3112 c = 1;
3113 goto do_ifdef;
3114 case TOK_IF:
3115 c = expr_preprocess();
3116 goto do_if;
3117 case TOK_IFDEF:
3118 c = 0;
3119 do_ifdef:
3120 next_nomacro();
3121 if (tok < TOK_IDENT)
3122 error("invalid argument for '#if%sdef'", c ? "n" : "");
3123 if (is_bof) {
3124 if (c) {
3125 #ifdef INC_DEBUG
3126 printf("#ifndef %s\n", get_tok_str(tok, NULL));
3127 #endif
3128 file->ifndef_macro = tok;
3131 c = (define_find(tok) != 0) ^ c;
3132 do_if:
3133 if (s1->ifdef_stack_ptr >= s1->ifdef_stack + IFDEF_STACK_SIZE)
3134 error("memory full");
3135 *s1->ifdef_stack_ptr++ = c;
3136 goto test_skip;
3137 case TOK_ELSE:
3138 if (s1->ifdef_stack_ptr == s1->ifdef_stack)
3139 error("#else without matching #if");
3140 if (s1->ifdef_stack_ptr[-1] & 2)
3141 error("#else after #else");
3142 c = (s1->ifdef_stack_ptr[-1] ^= 3);
3143 goto test_skip;
3144 case TOK_ELIF:
3145 if (s1->ifdef_stack_ptr == s1->ifdef_stack)
3146 error("#elif without matching #if");
3147 c = s1->ifdef_stack_ptr[-1];
3148 if (c > 1)
3149 error("#elif after #else");
3150 /* last #if/#elif expression was true: we skip */
3151 if (c == 1)
3152 goto skip;
3153 c = expr_preprocess();
3154 s1->ifdef_stack_ptr[-1] = c;
3155 test_skip:
3156 if (!(c & 1)) {
3157 skip:
3158 preprocess_skip();
3159 is_bof = 0;
3160 goto redo;
3162 break;
3163 case TOK_ENDIF:
3164 if (s1->ifdef_stack_ptr <= file->ifdef_stack_ptr)
3165 error("#endif without matching #if");
3166 s1->ifdef_stack_ptr--;
3167 /* '#ifndef macro' was at the start of file. Now we check if
3168 an '#endif' is exactly at the end of file */
3169 if (file->ifndef_macro &&
3170 s1->ifdef_stack_ptr == file->ifdef_stack_ptr) {
3171 file->ifndef_macro_saved = file->ifndef_macro;
3172 /* need to set to zero to avoid false matches if another
3173 #ifndef at middle of file */
3174 file->ifndef_macro = 0;
3175 while (tok != TOK_LINEFEED)
3176 next_nomacro();
3177 tok_flags |= TOK_FLAG_ENDIF;
3178 goto the_end;
3180 break;
3181 case TOK_LINE:
3182 next();
3183 if (tok != TOK_CINT)
3184 error("#line");
3185 file->line_num = tokc.i - 1; /* the line number will be incremented after */
3186 next();
3187 if (tok != TOK_LINEFEED) {
3188 if (tok != TOK_STR)
3189 error("#line");
3190 pstrcpy(file->filename, sizeof(file->filename),
3191 (char *)tokc.cstr->data);
3193 break;
3194 case TOK_ERROR:
3195 case TOK_WARNING:
3196 c = tok;
3197 ch = file->buf_ptr[0];
3198 skip_spaces();
3199 q = buf;
3200 while (ch != '\n' && ch != CH_EOF) {
3201 if ((q - buf) < sizeof(buf) - 1)
3202 *q++ = ch;
3203 if (ch == '\\') {
3204 if (handle_stray_noerror() == 0)
3205 --q;
3206 } else
3207 inp();
3209 *q = '\0';
3210 if (c == TOK_ERROR)
3211 error("#error %s", buf);
3212 else
3213 warning("#warning %s", buf);
3214 break;
3215 case TOK_PRAGMA:
3216 pragma_parse(s1);
3217 break;
3218 default:
3219 if (tok == TOK_LINEFEED || tok == '!' || tok == TOK_CINT) {
3220 /* '!' is ignored to allow C scripts. numbers are ignored
3221 to emulate cpp behaviour */
3222 } else {
3223 if (!(saved_parse_flags & PARSE_FLAG_ASM_COMMENTS))
3224 warning("Ignoring unknown preprocessing directive #%s", get_tok_str(tok, &tokc));
3226 break;
3228 /* ignore other preprocess commands or #! for C scripts */
3229 while (tok != TOK_LINEFEED)
3230 next_nomacro();
3231 the_end:
3232 parse_flags = saved_parse_flags;
3235 /* evaluate escape codes in a string. */
3236 static void parse_escape_string(CString *outstr, const uint8_t *buf, int is_long)
3238 int c, n;
3239 const uint8_t *p;
3241 p = buf;
3242 for(;;) {
3243 c = *p;
3244 if (c == '\0')
3245 break;
3246 if (c == '\\') {
3247 p++;
3248 /* escape */
3249 c = *p;
3250 switch(c) {
3251 case '0': case '1': case '2': case '3':
3252 case '4': case '5': case '6': case '7':
3253 /* at most three octal digits */
3254 n = c - '0';
3255 p++;
3256 c = *p;
3257 if (isoct(c)) {
3258 n = n * 8 + c - '0';
3259 p++;
3260 c = *p;
3261 if (isoct(c)) {
3262 n = n * 8 + c - '0';
3263 p++;
3266 c = n;
3267 goto add_char_nonext;
3268 case 'x':
3269 case 'u':
3270 case 'U':
3271 p++;
3272 n = 0;
3273 for(;;) {
3274 c = *p;
3275 if (c >= 'a' && c <= 'f')
3276 c = c - 'a' + 10;
3277 else if (c >= 'A' && c <= 'F')
3278 c = c - 'A' + 10;
3279 else if (isnum(c))
3280 c = c - '0';
3281 else
3282 break;
3283 n = n * 16 + c;
3284 p++;
3286 c = n;
3287 goto add_char_nonext;
3288 case 'a':
3289 c = '\a';
3290 break;
3291 case 'b':
3292 c = '\b';
3293 break;
3294 case 'f':
3295 c = '\f';
3296 break;
3297 case 'n':
3298 c = '\n';
3299 break;
3300 case 'r':
3301 c = '\r';
3302 break;
3303 case 't':
3304 c = '\t';
3305 break;
3306 case 'v':
3307 c = '\v';
3308 break;
3309 case 'e':
3310 if (!gnu_ext)
3311 goto invalid_escape;
3312 c = 27;
3313 break;
3314 case '\'':
3315 case '\"':
3316 case '\\':
3317 case '?':
3318 break;
3319 default:
3320 invalid_escape:
3321 if (c >= '!' && c <= '~')
3322 warning("unknown escape sequence: \'\\%c\'", c);
3323 else
3324 warning("unknown escape sequence: \'\\x%x\'", c);
3325 break;
3328 p++;
3329 add_char_nonext:
3330 if (!is_long)
3331 cstr_ccat(outstr, c);
3332 else
3333 cstr_wccat(outstr, c);
3335 /* add a trailing '\0' */
3336 if (!is_long)
3337 cstr_ccat(outstr, '\0');
3338 else
3339 cstr_wccat(outstr, '\0');
3342 /* we use 64 bit numbers */
3343 #define BN_SIZE 2
3345 /* bn = (bn << shift) | or_val */
3346 void bn_lshift(unsigned int *bn, int shift, int or_val)
3348 int i;
3349 unsigned int v;
3350 for(i=0;i<BN_SIZE;i++) {
3351 v = bn[i];
3352 bn[i] = (v << shift) | or_val;
3353 or_val = v >> (32 - shift);
3357 void bn_zero(unsigned int *bn)
3359 int i;
3360 for(i=0;i<BN_SIZE;i++) {
3361 bn[i] = 0;
3365 /* parse number in null terminated string 'p' and return it in the
3366 current token */
3367 void parse_number(const char *p)
3369 int b, t, shift, frac_bits, s, exp_val, ch;
3370 char *q;
3371 unsigned int bn[BN_SIZE];
3372 double d;
3374 /* number */
3375 q = token_buf;
3376 ch = *p++;
3377 t = ch;
3378 ch = *p++;
3379 *q++ = t;
3380 b = 10;
3381 if (t == '.') {
3382 goto float_frac_parse;
3383 } else if (t == '0') {
3384 if (ch == 'x' || ch == 'X') {
3385 q--;
3386 ch = *p++;
3387 b = 16;
3388 } else if (tcc_ext && (ch == 'b' || ch == 'B')) {
3389 q--;
3390 ch = *p++;
3391 b = 2;
3394 /* parse all digits. cannot check octal numbers at this stage
3395 because of floating point constants */
3396 while (1) {
3397 if (ch >= 'a' && ch <= 'f')
3398 t = ch - 'a' + 10;
3399 else if (ch >= 'A' && ch <= 'F')
3400 t = ch - 'A' + 10;
3401 else if (isnum(ch))
3402 t = ch - '0';
3403 else
3404 break;
3405 if (t >= b)
3406 break;
3407 if (q >= token_buf + STRING_MAX_SIZE) {
3408 num_too_long:
3409 error("number too long");
3411 *q++ = ch;
3412 ch = *p++;
3414 if (ch == '.' ||
3415 ((ch == 'e' || ch == 'E') && b == 10) ||
3416 ((ch == 'p' || ch == 'P') && (b == 16 || b == 2))) {
3417 if (b != 10) {
3418 /* NOTE: strtox should support that for hexa numbers, but
3419 non ISOC99 libcs do not support it, so we prefer to do
3420 it by hand */
3421 /* hexadecimal or binary floats */
3422 /* XXX: handle overflows */
3423 *q = '\0';
3424 if (b == 16)
3425 shift = 4;
3426 else
3427 shift = 2;
3428 bn_zero(bn);
3429 q = token_buf;
3430 while (1) {
3431 t = *q++;
3432 if (t == '\0') {
3433 break;
3434 } else if (t >= 'a') {
3435 t = t - 'a' + 10;
3436 } else if (t >= 'A') {
3437 t = t - 'A' + 10;
3438 } else {
3439 t = t - '0';
3441 bn_lshift(bn, shift, t);
3443 frac_bits = 0;
3444 if (ch == '.') {
3445 ch = *p++;
3446 while (1) {
3447 t = ch;
3448 if (t >= 'a' && t <= 'f') {
3449 t = t - 'a' + 10;
3450 } else if (t >= 'A' && t <= 'F') {
3451 t = t - 'A' + 10;
3452 } else if (t >= '0' && t <= '9') {
3453 t = t - '0';
3454 } else {
3455 break;
3457 if (t >= b)
3458 error("invalid digit");
3459 bn_lshift(bn, shift, t);
3460 frac_bits += shift;
3461 ch = *p++;
3464 if (ch != 'p' && ch != 'P')
3465 expect("exponent");
3466 ch = *p++;
3467 s = 1;
3468 exp_val = 0;
3469 if (ch == '+') {
3470 ch = *p++;
3471 } else if (ch == '-') {
3472 s = -1;
3473 ch = *p++;
3475 if (ch < '0' || ch > '9')
3476 expect("exponent digits");
3477 while (ch >= '0' && ch <= '9') {
3478 exp_val = exp_val * 10 + ch - '0';
3479 ch = *p++;
3481 exp_val = exp_val * s;
3483 /* now we can generate the number */
3484 /* XXX: should patch directly float number */
3485 d = (double)bn[1] * 4294967296.0 + (double)bn[0];
3486 d = ldexp(d, exp_val - frac_bits);
3487 t = toup(ch);
3488 if (t == 'F') {
3489 ch = *p++;
3490 tok = TOK_CFLOAT;
3491 /* float : should handle overflow */
3492 tokc.f = (float)d;
3493 } else if (t == 'L') {
3494 ch = *p++;
3495 tok = TOK_CLDOUBLE;
3496 /* XXX: not large enough */
3497 tokc.ld = (long double)d;
3498 } else {
3499 tok = TOK_CDOUBLE;
3500 tokc.d = d;
3502 } else {
3503 /* decimal floats */
3504 if (ch == '.') {
3505 if (q >= token_buf + STRING_MAX_SIZE)
3506 goto num_too_long;
3507 *q++ = ch;
3508 ch = *p++;
3509 float_frac_parse:
3510 while (ch >= '0' && ch <= '9') {
3511 if (q >= token_buf + STRING_MAX_SIZE)
3512 goto num_too_long;
3513 *q++ = ch;
3514 ch = *p++;
3517 if (ch == 'e' || ch == 'E') {
3518 if (q >= token_buf + STRING_MAX_SIZE)
3519 goto num_too_long;
3520 *q++ = ch;
3521 ch = *p++;
3522 if (ch == '-' || ch == '+') {
3523 if (q >= token_buf + STRING_MAX_SIZE)
3524 goto num_too_long;
3525 *q++ = ch;
3526 ch = *p++;
3528 if (ch < '0' || ch > '9')
3529 expect("exponent digits");
3530 while (ch >= '0' && ch <= '9') {
3531 if (q >= token_buf + STRING_MAX_SIZE)
3532 goto num_too_long;
3533 *q++ = ch;
3534 ch = *p++;
3537 *q = '\0';
3538 t = toup(ch);
3539 errno = 0;
3540 if (t == 'F') {
3541 ch = *p++;
3542 tok = TOK_CFLOAT;
3543 tokc.f = strtof(token_buf, NULL);
3544 } else if (t == 'L') {
3545 ch = *p++;
3546 tok = TOK_CLDOUBLE;
3547 tokc.ld = strtold(token_buf, NULL);
3548 } else {
3549 tok = TOK_CDOUBLE;
3550 tokc.d = strtod(token_buf, NULL);
3553 } else {
3554 unsigned long long n, n1;
3555 int lcount, ucount;
3557 /* integer number */
3558 *q = '\0';
3559 q = token_buf;
3560 if (b == 10 && *q == '0') {
3561 b = 8;
3562 q++;
3564 n = 0;
3565 while(1) {
3566 t = *q++;
3567 /* no need for checks except for base 10 / 8 errors */
3568 if (t == '\0') {
3569 break;
3570 } else if (t >= 'a') {
3571 t = t - 'a' + 10;
3572 } else if (t >= 'A') {
3573 t = t - 'A' + 10;
3574 } else {
3575 t = t - '0';
3576 if (t >= b)
3577 error("invalid digit");
3579 n1 = n;
3580 n = n * b + t;
3581 /* detect overflow */
3582 /* XXX: this test is not reliable */
3583 if (n < n1)
3584 error("integer constant overflow");
3587 /* XXX: not exactly ANSI compliant */
3588 if ((n & 0xffffffff00000000LL) != 0) {
3589 if ((n >> 63) != 0)
3590 tok = TOK_CULLONG;
3591 else
3592 tok = TOK_CLLONG;
3593 } else if (n > 0x7fffffff) {
3594 tok = TOK_CUINT;
3595 } else {
3596 tok = TOK_CINT;
3598 lcount = 0;
3599 ucount = 0;
3600 for(;;) {
3601 t = toup(ch);
3602 if (t == 'L') {
3603 if (lcount >= 2)
3604 error("three 'l's in integer constant");
3605 lcount++;
3606 if (lcount == 2) {
3607 if (tok == TOK_CINT)
3608 tok = TOK_CLLONG;
3609 else if (tok == TOK_CUINT)
3610 tok = TOK_CULLONG;
3612 ch = *p++;
3613 } else if (t == 'U') {
3614 if (ucount >= 1)
3615 error("two 'u's in integer constant");
3616 ucount++;
3617 if (tok == TOK_CINT)
3618 tok = TOK_CUINT;
3619 else if (tok == TOK_CLLONG)
3620 tok = TOK_CULLONG;
3621 ch = *p++;
3622 } else {
3623 break;
3626 if (tok == TOK_CINT || tok == TOK_CUINT)
3627 tokc.ui = n;
3628 else
3629 tokc.ull = n;
3634 #define PARSE2(c1, tok1, c2, tok2) \
3635 case c1: \
3636 PEEKC(c, p); \
3637 if (c == c2) { \
3638 p++; \
3639 tok = tok2; \
3640 } else { \
3641 tok = tok1; \
3643 break;
3645 /* return next token without macro substitution */
3646 static inline void next_nomacro1(void)
3648 int t, c, is_long;
3649 TokenSym *ts;
3650 uint8_t *p, *p1;
3651 unsigned int h;
3653 p = file->buf_ptr;
3654 redo_no_start:
3655 c = *p;
3656 switch(c) {
3657 case ' ':
3658 case '\t':
3659 case '\f':
3660 case '\v':
3661 case '\r':
3662 p++;
3663 goto redo_no_start;
3665 case '\\':
3666 /* first look if it is in fact an end of buffer */
3667 if (p >= file->buf_end) {
3668 file->buf_ptr = p;
3669 handle_eob();
3670 p = file->buf_ptr;
3671 if (p >= file->buf_end)
3672 goto parse_eof;
3673 else
3674 goto redo_no_start;
3675 } else {
3676 file->buf_ptr = p;
3677 ch = *p;
3678 handle_stray();
3679 p = file->buf_ptr;
3680 goto redo_no_start;
3682 parse_eof:
3684 TCCState *s1 = tcc_state;
3685 if ((parse_flags & PARSE_FLAG_LINEFEED)
3686 && !(tok_flags & TOK_FLAG_EOF)) {
3687 tok_flags |= TOK_FLAG_EOF;
3688 tok = TOK_LINEFEED;
3689 goto keep_tok_flags;
3690 } else if (s1->include_stack_ptr == s1->include_stack ||
3691 !(parse_flags & PARSE_FLAG_PREPROCESS)) {
3692 /* no include left : end of file. */
3693 tok = TOK_EOF;
3694 } else {
3695 tok_flags &= ~TOK_FLAG_EOF;
3696 /* pop include file */
3698 /* test if previous '#endif' was after a #ifdef at
3699 start of file */
3700 if (tok_flags & TOK_FLAG_ENDIF) {
3701 #ifdef INC_DEBUG
3702 printf("#endif %s\n", get_tok_str(file->ifndef_macro_saved, NULL));
3703 #endif
3704 add_cached_include(s1, file->inc_type, file->inc_filename,
3705 file->ifndef_macro_saved);
3708 /* add end of include file debug info */
3709 if (do_debug) {
3710 put_stabd(N_EINCL, 0, 0);
3712 /* pop include stack */
3713 tcc_close(file);
3714 s1->include_stack_ptr--;
3715 file = *s1->include_stack_ptr;
3716 p = file->buf_ptr;
3717 goto redo_no_start;
3720 break;
3722 case '\n':
3723 file->line_num++;
3724 tok_flags |= TOK_FLAG_BOL;
3725 p++;
3726 if (0 == (parse_flags & PARSE_FLAG_LINEFEED))
3727 goto redo_no_start;
3728 tok = TOK_LINEFEED;
3729 goto keep_tok_flags;
3731 case '#':
3732 /* XXX: simplify */
3733 PEEKC(c, p);
3734 if ((tok_flags & TOK_FLAG_BOL) &&
3735 (parse_flags & PARSE_FLAG_PREPROCESS)) {
3736 file->buf_ptr = p;
3737 preprocess(tok_flags & TOK_FLAG_BOF);
3738 p = file->buf_ptr;
3739 goto redo_no_start;
3740 } else {
3741 if (c == '#') {
3742 p++;
3743 tok = TOK_TWOSHARPS;
3744 } else {
3745 if (parse_flags & PARSE_FLAG_ASM_COMMENTS) {
3746 p = parse_line_comment(p - 1);
3747 goto redo_no_start;
3748 } else {
3749 tok = '#';
3753 break;
3755 case 'a': case 'b': case 'c': case 'd':
3756 case 'e': case 'f': case 'g': case 'h':
3757 case 'i': case 'j': case 'k': case 'l':
3758 case 'm': case 'n': case 'o': case 'p':
3759 case 'q': case 'r': case 's': case 't':
3760 case 'u': case 'v': case 'w': case 'x':
3761 case 'y': case 'z':
3762 case 'A': case 'B': case 'C': case 'D':
3763 case 'E': case 'F': case 'G': case 'H':
3764 case 'I': case 'J': case 'K':
3765 case 'M': case 'N': case 'O': case 'P':
3766 case 'Q': case 'R': case 'S': case 'T':
3767 case 'U': case 'V': case 'W': case 'X':
3768 case 'Y': case 'Z':
3769 case '_':
3770 parse_ident_fast:
3771 p1 = p;
3772 h = TOK_HASH_INIT;
3773 h = TOK_HASH_FUNC(h, c);
3774 p++;
3775 for(;;) {
3776 c = *p;
3777 if (!isidnum_table[c-CH_EOF])
3778 break;
3779 h = TOK_HASH_FUNC(h, c);
3780 p++;
3782 if (c != '\\') {
3783 TokenSym **pts;
3784 int len;
3786 /* fast case : no stray found, so we have the full token
3787 and we have already hashed it */
3788 len = p - p1;
3789 h &= (TOK_HASH_SIZE - 1);
3790 pts = &hash_ident[h];
3791 for(;;) {
3792 ts = *pts;
3793 if (!ts)
3794 break;
3795 if (ts->len == len && !memcmp(ts->str, p1, len))
3796 goto token_found;
3797 pts = &(ts->hash_next);
3799 ts = tok_alloc_new(pts, p1, len);
3800 token_found: ;
3801 } else {
3802 /* slower case */
3803 cstr_reset(&tokcstr);
3805 while (p1 < p) {
3806 cstr_ccat(&tokcstr, *p1);
3807 p1++;
3809 p--;
3810 PEEKC(c, p);
3811 parse_ident_slow:
3812 while (isidnum_table[c-CH_EOF]) {
3813 cstr_ccat(&tokcstr, c);
3814 PEEKC(c, p);
3816 ts = tok_alloc(tokcstr.data, tokcstr.size);
3818 tok = ts->tok;
3819 break;
3820 case 'L':
3821 t = p[1];
3822 if (t != '\\' && t != '\'' && t != '\"') {
3823 /* fast case */
3824 goto parse_ident_fast;
3825 } else {
3826 PEEKC(c, p);
3827 if (c == '\'' || c == '\"') {
3828 is_long = 1;
3829 goto str_const;
3830 } else {
3831 cstr_reset(&tokcstr);
3832 cstr_ccat(&tokcstr, 'L');
3833 goto parse_ident_slow;
3836 break;
3837 case '0': case '1': case '2': case '3':
3838 case '4': case '5': case '6': case '7':
3839 case '8': case '9':
3841 cstr_reset(&tokcstr);
3842 /* after the first digit, accept digits, alpha, '.' or sign if
3843 prefixed by 'eEpP' */
3844 parse_num:
3845 for(;;) {
3846 t = c;
3847 cstr_ccat(&tokcstr, c);
3848 PEEKC(c, p);
3849 if (!(isnum(c) || isid(c) || c == '.' ||
3850 ((c == '+' || c == '-') &&
3851 (t == 'e' || t == 'E' || t == 'p' || t == 'P'))))
3852 break;
3854 /* We add a trailing '\0' to ease parsing */
3855 cstr_ccat(&tokcstr, '\0');
3856 tokc.cstr = &tokcstr;
3857 tok = TOK_PPNUM;
3858 break;
3859 case '.':
3860 /* special dot handling because it can also start a number */
3861 PEEKC(c, p);
3862 if (isnum(c)) {
3863 cstr_reset(&tokcstr);
3864 cstr_ccat(&tokcstr, '.');
3865 goto parse_num;
3866 } else if (c == '.') {
3867 PEEKC(c, p);
3868 if (c != '.')
3869 expect("'.'");
3870 PEEKC(c, p);
3871 tok = TOK_DOTS;
3872 } else {
3873 tok = '.';
3875 break;
3876 case '\'':
3877 case '\"':
3878 is_long = 0;
3879 str_const:
3881 CString str;
3882 int sep;
3884 sep = c;
3886 /* parse the string */
3887 cstr_new(&str);
3888 p = parse_pp_string(p, sep, &str);
3889 cstr_ccat(&str, '\0');
3891 /* eval the escape (should be done as TOK_PPNUM) */
3892 cstr_reset(&tokcstr);
3893 parse_escape_string(&tokcstr, str.data, is_long);
3894 cstr_free(&str);
3896 if (sep == '\'') {
3897 int char_size;
3898 /* XXX: make it portable */
3899 if (!is_long)
3900 char_size = 1;
3901 else
3902 char_size = sizeof(nwchar_t);
3903 if (tokcstr.size <= char_size)
3904 error("empty character constant");
3905 if (tokcstr.size > 2 * char_size)
3906 warning("multi-character character constant");
3907 if (!is_long) {
3908 tokc.i = *(int8_t *)tokcstr.data;
3909 tok = TOK_CCHAR;
3910 } else {
3911 tokc.i = *(nwchar_t *)tokcstr.data;
3912 tok = TOK_LCHAR;
3914 } else {
3915 tokc.cstr = &tokcstr;
3916 if (!is_long)
3917 tok = TOK_STR;
3918 else
3919 tok = TOK_LSTR;
3922 break;
3924 case '<':
3925 PEEKC(c, p);
3926 if (c == '=') {
3927 p++;
3928 tok = TOK_LE;
3929 } else if (c == '<') {
3930 PEEKC(c, p);
3931 if (c == '=') {
3932 p++;
3933 tok = TOK_A_SHL;
3934 } else {
3935 tok = TOK_SHL;
3937 } else {
3938 tok = TOK_LT;
3940 break;
3942 case '>':
3943 PEEKC(c, p);
3944 if (c == '=') {
3945 p++;
3946 tok = TOK_GE;
3947 } else if (c == '>') {
3948 PEEKC(c, p);
3949 if (c == '=') {
3950 p++;
3951 tok = TOK_A_SAR;
3952 } else {
3953 tok = TOK_SAR;
3955 } else {
3956 tok = TOK_GT;
3958 break;
3960 case '&':
3961 PEEKC(c, p);
3962 if (c == '&') {
3963 p++;
3964 tok = TOK_LAND;
3965 } else if (c == '=') {
3966 p++;
3967 tok = TOK_A_AND;
3968 } else {
3969 tok = '&';
3971 break;
3973 case '|':
3974 PEEKC(c, p);
3975 if (c == '|') {
3976 p++;
3977 tok = TOK_LOR;
3978 } else if (c == '=') {
3979 p++;
3980 tok = TOK_A_OR;
3981 } else {
3982 tok = '|';
3984 break;
3986 case '+':
3987 PEEKC(c, p);
3988 if (c == '+') {
3989 p++;
3990 tok = TOK_INC;
3991 } else if (c == '=') {
3992 p++;
3993 tok = TOK_A_ADD;
3994 } else {
3995 tok = '+';
3997 break;
3999 case '-':
4000 PEEKC(c, p);
4001 if (c == '-') {
4002 p++;
4003 tok = TOK_DEC;
4004 } else if (c == '=') {
4005 p++;
4006 tok = TOK_A_SUB;
4007 } else if (c == '>') {
4008 p++;
4009 tok = TOK_ARROW;
4010 } else {
4011 tok = '-';
4013 break;
4015 PARSE2('!', '!', '=', TOK_NE)
4016 PARSE2('=', '=', '=', TOK_EQ)
4017 PARSE2('*', '*', '=', TOK_A_MUL)
4018 PARSE2('%', '%', '=', TOK_A_MOD)
4019 PARSE2('^', '^', '=', TOK_A_XOR)
4021 /* comments or operator */
4022 case '/':
4023 PEEKC(c, p);
4024 if (c == '*') {
4025 p = parse_comment(p);
4026 goto redo_no_start;
4027 } else if (c == '/') {
4028 p = parse_line_comment(p);
4029 goto redo_no_start;
4030 } else if (c == '=') {
4031 p++;
4032 tok = TOK_A_DIV;
4033 } else {
4034 tok = '/';
4036 break;
4038 /* simple tokens */
4039 case '(':
4040 case ')':
4041 case '[':
4042 case ']':
4043 case '{':
4044 case '}':
4045 case ',':
4046 case ';':
4047 case ':':
4048 case '?':
4049 case '~':
4050 case '$': /* only used in assembler */
4051 case '@': /* dito */
4052 tok = c;
4053 p++;
4054 break;
4055 default:
4056 error("unrecognized character \\x%02x", c);
4057 break;
4059 tok_flags = 0;
4060 keep_tok_flags:
4061 file->buf_ptr = p;
4062 #if defined(PARSE_DEBUG)
4063 printf("token = %s\n", get_tok_str(tok, &tokc));
4064 #endif
4067 /* return next token without macro substitution. Can read input from
4068 macro_ptr buffer */
4069 static void next_nomacro(void)
4071 if (macro_ptr) {
4072 redo:
4073 tok = *macro_ptr;
4074 if (tok) {
4075 TOK_GET(tok, macro_ptr, tokc);
4076 if (tok == TOK_LINENUM) {
4077 file->line_num = tokc.i;
4078 goto redo;
4081 } else {
4082 next_nomacro1();
4086 /* substitute args in macro_str and return allocated string */
4087 static int *macro_arg_subst(Sym **nested_list, int *macro_str, Sym *args)
4089 int *st, last_tok, t, notfirst;
4090 Sym *s;
4091 CValue cval;
4092 TokenString str;
4093 CString cstr;
4095 tok_str_new(&str);
4096 last_tok = 0;
4097 while(1) {
4098 TOK_GET(t, macro_str, cval);
4099 if (!t)
4100 break;
4101 if (t == '#') {
4102 /* stringize */
4103 TOK_GET(t, macro_str, cval);
4104 if (!t)
4105 break;
4106 s = sym_find2(args, t);
4107 if (s) {
4108 cstr_new(&cstr);
4109 st = (int *)s->c;
4110 notfirst = 0;
4111 while (*st) {
4112 if (notfirst)
4113 cstr_ccat(&cstr, ' ');
4114 TOK_GET(t, st, cval);
4115 cstr_cat(&cstr, get_tok_str(t, &cval));
4116 #ifndef PP_NOSPACES
4117 notfirst = 1;
4118 #endif
4120 cstr_ccat(&cstr, '\0');
4121 #ifdef PP_DEBUG
4122 printf("stringize: %s\n", (char *)cstr.data);
4123 #endif
4124 /* add string */
4125 cval.cstr = &cstr;
4126 tok_str_add2(&str, TOK_STR, &cval);
4127 cstr_free(&cstr);
4128 } else {
4129 tok_str_add2(&str, t, &cval);
4131 } else if (t >= TOK_IDENT) {
4132 s = sym_find2(args, t);
4133 if (s) {
4134 st = (int *)s->c;
4135 /* if '##' is present before or after, no arg substitution */
4136 if (*macro_str == TOK_TWOSHARPS || last_tok == TOK_TWOSHARPS) {
4137 /* special case for var arg macros : ## eats the
4138 ',' if empty VA_ARGS variable. */
4139 /* XXX: test of the ',' is not 100%
4140 reliable. should fix it to avoid security
4141 problems */
4142 if (gnu_ext && s->type.t &&
4143 last_tok == TOK_TWOSHARPS &&
4144 str.len >= 2 && str.str[str.len - 2] == ',') {
4145 if (*st == 0) {
4146 /* suppress ',' '##' */
4147 str.len -= 2;
4148 } else {
4149 /* suppress '##' and add variable */
4150 str.len--;
4151 goto add_var;
4153 } else {
4154 int t1;
4155 add_var:
4156 for(;;) {
4157 TOK_GET(t1, st, cval);
4158 if (!t1)
4159 break;
4160 tok_str_add2(&str, t1, &cval);
4163 } else {
4164 /* NOTE: the stream cannot be read when macro
4165 substituing an argument */
4166 macro_subst(&str, nested_list, st, NULL);
4168 } else {
4169 tok_str_add(&str, t);
4171 } else {
4172 tok_str_add2(&str, t, &cval);
4174 last_tok = t;
4176 tok_str_add(&str, 0);
4177 return str.str;
4180 static char const ab_month_name[12][4] =
4182 "Jan", "Feb", "Mar", "Apr", "May", "Jun",
4183 "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
4186 /* do macro substitution of current token with macro 's' and add
4187 result to (tok_str,tok_len). 'nested_list' is the list of all
4188 macros we got inside to avoid recursing. Return non zero if no
4189 substitution needs to be done */
4190 static int macro_subst_tok(TokenString *tok_str,
4191 Sym **nested_list, Sym *s, struct macro_level **can_read_stream)
4193 Sym *args, *sa, *sa1;
4194 int mstr_allocated, parlevel, *mstr, t, t1;
4195 TokenString str;
4196 char *cstrval;
4197 CValue cval;
4198 CString cstr;
4199 char buf[32];
4201 /* if symbol is a macro, prepare substitution */
4202 /* special macros */
4203 if (tok == TOK___LINE__) {
4204 snprintf(buf, sizeof(buf), "%d", file->line_num);
4205 cstrval = buf;
4206 t1 = TOK_PPNUM;
4207 goto add_cstr1;
4208 } else if (tok == TOK___FILE__) {
4209 cstrval = file->filename;
4210 goto add_cstr;
4211 } else if (tok == TOK___DATE__ || tok == TOK___TIME__) {
4212 time_t ti;
4213 struct tm *tm;
4215 time(&ti);
4216 tm = localtime(&ti);
4217 if (tok == TOK___DATE__) {
4218 snprintf(buf, sizeof(buf), "%s %2d %d",
4219 ab_month_name[tm->tm_mon], tm->tm_mday, tm->tm_year + 1900);
4220 } else {
4221 snprintf(buf, sizeof(buf), "%02d:%02d:%02d",
4222 tm->tm_hour, tm->tm_min, tm->tm_sec);
4224 cstrval = buf;
4225 add_cstr:
4226 t1 = TOK_STR;
4227 add_cstr1:
4228 cstr_new(&cstr);
4229 cstr_cat(&cstr, cstrval);
4230 cstr_ccat(&cstr, '\0');
4231 cval.cstr = &cstr;
4232 tok_str_add2(tok_str, t1, &cval);
4233 cstr_free(&cstr);
4234 } else {
4235 mstr = (int *)s->c;
4236 mstr_allocated = 0;
4237 if (s->type.t == MACRO_FUNC) {
4238 /* NOTE: we do not use next_nomacro to avoid eating the
4239 next token. XXX: find better solution */
4240 redo:
4241 if (macro_ptr) {
4242 t = *macro_ptr;
4243 if (t == 0 && can_read_stream) {
4244 /* end of macro stream: we must look at the token
4245 after in the file */
4246 struct macro_level *ml = *can_read_stream;
4247 macro_ptr = NULL;
4248 if (ml)
4250 macro_ptr = ml->p;
4251 ml->p = NULL;
4252 *can_read_stream = ml -> prev;
4254 goto redo;
4256 } else {
4257 /* XXX: incorrect with comments */
4258 ch = file->buf_ptr[0];
4259 while (is_space(ch) || ch == '\n')
4260 cinp();
4261 t = ch;
4263 if (t != '(') /* no macro subst */
4264 return -1;
4266 /* argument macro */
4267 next_nomacro();
4268 next_nomacro();
4269 args = NULL;
4270 sa = s->next;
4271 /* NOTE: empty args are allowed, except if no args */
4272 for(;;) {
4273 /* handle '()' case */
4274 if (!args && !sa && tok == ')')
4275 break;
4276 if (!sa)
4277 error("macro '%s' used with too many args",
4278 get_tok_str(s->v, 0));
4279 tok_str_new(&str);
4280 parlevel = 0;
4281 /* NOTE: non zero sa->t indicates VA_ARGS */
4282 while ((parlevel > 0 ||
4283 (tok != ')' &&
4284 (tok != ',' || sa->type.t))) &&
4285 tok != -1) {
4286 if (tok == '(')
4287 parlevel++;
4288 else if (tok == ')')
4289 parlevel--;
4290 if (tok != TOK_LINEFEED)
4291 tok_str_add2(&str, tok, &tokc);
4292 next_nomacro();
4294 tok_str_add(&str, 0);
4295 sym_push2(&args, sa->v & ~SYM_FIELD, sa->type.t, (int)str.str);
4296 sa = sa->next;
4297 if (tok == ')') {
4298 /* special case for gcc var args: add an empty
4299 var arg argument if it is omitted */
4300 if (sa && sa->type.t && gnu_ext)
4301 continue;
4302 else
4303 break;
4305 if (tok != ',')
4306 expect(",");
4307 next_nomacro();
4309 if (sa) {
4310 error("macro '%s' used with too few args",
4311 get_tok_str(s->v, 0));
4314 /* now subst each arg */
4315 mstr = macro_arg_subst(nested_list, mstr, args);
4316 /* free memory */
4317 sa = args;
4318 while (sa) {
4319 sa1 = sa->prev;
4320 tok_str_free((int *)sa->c);
4321 sym_free(sa);
4322 sa = sa1;
4324 mstr_allocated = 1;
4326 sym_push2(nested_list, s->v, 0, 0);
4327 macro_subst(tok_str, nested_list, mstr, can_read_stream);
4328 /* pop nested defined symbol */
4329 sa1 = *nested_list;
4330 *nested_list = sa1->prev;
4331 sym_free(sa1);
4332 if (mstr_allocated)
4333 tok_str_free(mstr);
4335 return 0;
4338 /* handle the '##' operator. Return NULL if no '##' seen. Otherwise
4339 return the resulting string (which must be freed). */
4340 static inline int *macro_twosharps(const int *macro_str)
4342 TokenSym *ts;
4343 const int *macro_ptr1, *start_macro_ptr, *ptr, *saved_macro_ptr;
4344 int t;
4345 const char *p1, *p2;
4346 CValue cval;
4347 TokenString macro_str1;
4348 CString cstr;
4350 start_macro_ptr = macro_str;
4351 /* we search the first '##' */
4352 for(;;) {
4353 macro_ptr1 = macro_str;
4354 TOK_GET(t, macro_str, cval);
4355 /* nothing more to do if end of string */
4356 if (t == 0)
4357 return NULL;
4358 if (*macro_str == TOK_TWOSHARPS)
4359 break;
4362 /* we saw '##', so we need more processing to handle it */
4363 cstr_new(&cstr);
4364 tok_str_new(&macro_str1);
4365 tok = t;
4366 tokc = cval;
4368 /* add all tokens seen so far */
4369 for(ptr = start_macro_ptr; ptr < macro_ptr1;) {
4370 TOK_GET(t, ptr, cval);
4371 tok_str_add2(&macro_str1, t, &cval);
4373 saved_macro_ptr = macro_ptr;
4374 /* XXX: get rid of the use of macro_ptr here */
4375 macro_ptr = (int *)macro_str;
4376 for(;;) {
4377 while (*macro_ptr == TOK_TWOSHARPS) {
4378 macro_ptr++;
4379 macro_ptr1 = macro_ptr;
4380 t = *macro_ptr;
4381 if (t) {
4382 TOK_GET(t, macro_ptr, cval);
4383 /* We concatenate the two tokens if we have an
4384 identifier or a preprocessing number */
4385 cstr_reset(&cstr);
4386 p1 = get_tok_str(tok, &tokc);
4387 cstr_cat(&cstr, p1);
4388 p2 = get_tok_str(t, &cval);
4389 cstr_cat(&cstr, p2);
4390 cstr_ccat(&cstr, '\0');
4392 if ((tok >= TOK_IDENT || tok == TOK_PPNUM) &&
4393 (t >= TOK_IDENT || t == TOK_PPNUM)) {
4394 if (tok == TOK_PPNUM) {
4395 /* if number, then create a number token */
4396 /* NOTE: no need to allocate because
4397 tok_str_add2() does it */
4398 cstr_reset(&tokcstr);
4399 tokcstr = cstr;
4400 cstr_new(&cstr);
4401 tokc.cstr = &tokcstr;
4402 } else {
4403 /* if identifier, we must do a test to
4404 validate we have a correct identifier */
4405 if (t == TOK_PPNUM) {
4406 const char *p;
4407 int c;
4409 p = p2;
4410 for(;;) {
4411 c = *p;
4412 if (c == '\0')
4413 break;
4414 p++;
4415 if (!isnum(c) && !isid(c))
4416 goto error_pasting;
4419 ts = tok_alloc(cstr.data, strlen(cstr.data));
4420 tok = ts->tok; /* modify current token */
4422 } else {
4423 const char *str = cstr.data;
4424 const unsigned char *q;
4426 /* we look for a valid token */
4427 /* XXX: do more extensive checks */
4428 if (!strcmp(str, ">>=")) {
4429 tok = TOK_A_SAR;
4430 } else if (!strcmp(str, "<<=")) {
4431 tok = TOK_A_SHL;
4432 } else if (strlen(str) == 2) {
4433 /* search in two bytes table */
4434 q = tok_two_chars;
4435 for(;;) {
4436 if (!*q)
4437 goto error_pasting;
4438 if (q[0] == str[0] && q[1] == str[1])
4439 break;
4440 q += 3;
4442 tok = q[2];
4443 } else {
4444 error_pasting:
4445 /* NOTE: because get_tok_str use a static buffer,
4446 we must save it */
4447 cstr_reset(&cstr);
4448 p1 = get_tok_str(tok, &tokc);
4449 cstr_cat(&cstr, p1);
4450 cstr_ccat(&cstr, '\0');
4451 p2 = get_tok_str(t, &cval);
4452 warning("pasting \"%s\" and \"%s\" does not give a valid preprocessing token", cstr.data, p2);
4453 /* cannot merge tokens: just add them separately */
4454 tok_str_add2(&macro_str1, tok, &tokc);
4455 /* XXX: free associated memory ? */
4456 tok = t;
4457 tokc = cval;
4462 tok_str_add2(&macro_str1, tok, &tokc);
4463 next_nomacro();
4464 if (tok == 0)
4465 break;
4467 macro_ptr = (int *)saved_macro_ptr;
4468 cstr_free(&cstr);
4469 tok_str_add(&macro_str1, 0);
4470 return macro_str1.str;
4474 /* do macro substitution of macro_str and add result to
4475 (tok_str,tok_len). 'nested_list' is the list of all macros we got
4476 inside to avoid recursing. */
4477 static void macro_subst(TokenString *tok_str, Sym **nested_list,
4478 const int *macro_str, struct macro_level ** can_read_stream)
4480 Sym *s;
4481 int *macro_str1;
4482 const int *ptr;
4483 int t, ret;
4484 CValue cval;
4485 struct macro_level ml;
4487 /* first scan for '##' operator handling */
4488 ptr = macro_str;
4489 macro_str1 = macro_twosharps(ptr);
4490 if (macro_str1)
4491 ptr = macro_str1;
4492 while (1) {
4493 /* NOTE: ptr == NULL can only happen if tokens are read from
4494 file stream due to a macro function call */
4495 if (ptr == NULL)
4496 break;
4497 TOK_GET(t, ptr, cval);
4498 if (t == 0)
4499 break;
4500 s = define_find(t);
4501 if (s != NULL) {
4502 /* if nested substitution, do nothing */
4503 if (sym_find2(*nested_list, t))
4504 goto no_subst;
4505 ml.p = macro_ptr;
4506 if (can_read_stream)
4507 ml.prev = *can_read_stream, *can_read_stream = &ml;
4508 macro_ptr = (int *)ptr;
4509 tok = t;
4510 ret = macro_subst_tok(tok_str, nested_list, s, can_read_stream);
4511 ptr = (int *)macro_ptr;
4512 macro_ptr = ml.p;
4513 if (can_read_stream && *can_read_stream == &ml)
4514 *can_read_stream = ml.prev;
4515 if (ret != 0)
4516 goto no_subst;
4517 } else {
4518 no_subst:
4519 tok_str_add2(tok_str, t, &cval);
4522 if (macro_str1)
4523 tok_str_free(macro_str1);
4526 /* return next token with macro substitution */
4527 static void next(void)
4529 Sym *nested_list, *s;
4530 TokenString str;
4531 struct macro_level *ml;
4533 redo:
4534 next_nomacro();
4535 if (!macro_ptr) {
4536 /* if not reading from macro substituted string, then try
4537 to substitute macros */
4538 if (tok >= TOK_IDENT &&
4539 (parse_flags & PARSE_FLAG_PREPROCESS)) {
4540 s = define_find(tok);
4541 if (s) {
4542 /* we have a macro: we try to substitute */
4543 tok_str_new(&str);
4544 nested_list = NULL;
4545 ml = NULL;
4546 if (macro_subst_tok(&str, &nested_list, s, &ml) == 0) {
4547 /* substitution done, NOTE: maybe empty */
4548 tok_str_add(&str, 0);
4549 macro_ptr = str.str;
4550 macro_ptr_allocated = str.str;
4551 goto redo;
4555 } else {
4556 if (tok == 0) {
4557 /* end of macro or end of unget buffer */
4558 if (unget_buffer_enabled) {
4559 macro_ptr = unget_saved_macro_ptr;
4560 unget_buffer_enabled = 0;
4561 } else {
4562 /* end of macro string: free it */
4563 tok_str_free(macro_ptr_allocated);
4564 macro_ptr = NULL;
4566 goto redo;
4570 /* convert preprocessor tokens into C tokens */
4571 if (tok == TOK_PPNUM &&
4572 (parse_flags & PARSE_FLAG_TOK_NUM)) {
4573 parse_number((char *)tokc.cstr->data);
4577 /* push back current token and set current token to 'last_tok'. Only
4578 identifier case handled for labels. */
4579 static inline void unget_tok(int last_tok)
4581 int i, n;
4582 int *q;
4583 unget_saved_macro_ptr = macro_ptr;
4584 unget_buffer_enabled = 1;
4585 q = unget_saved_buffer;
4586 macro_ptr = q;
4587 *q++ = tok;
4588 n = tok_ext_size(tok) - 1;
4589 for(i=0;i<n;i++)
4590 *q++ = tokc.tab[i];
4591 *q = 0; /* end of token string */
4592 tok = last_tok;
4596 void swap(int *p, int *q)
4598 int t;
4599 t = *p;
4600 *p = *q;
4601 *q = t;
4604 void vsetc(CType *type, int r, CValue *vc)
4606 int v;
4608 if (vtop >= vstack + (VSTACK_SIZE - 1))
4609 error("memory full");
4610 /* cannot let cpu flags if other instruction are generated. Also
4611 avoid leaving VT_JMP anywhere except on the top of the stack
4612 because it would complicate the code generator. */
4613 if (vtop >= vstack) {
4614 v = vtop->r & VT_VALMASK;
4615 if (v == VT_CMP || (v & ~1) == VT_JMP)
4616 gv(RC_INT);
4618 vtop++;
4619 vtop->type = *type;
4620 vtop->r = r;
4621 vtop->r2 = VT_CONST;
4622 vtop->c = *vc;
4625 /* push integer constant */
4626 void vpushi(int v)
4628 CValue cval;
4629 cval.i = v;
4630 vsetc(&int_type, VT_CONST, &cval);
4633 /* Return a static symbol pointing to a section */
4634 static Sym *get_sym_ref(CType *type, Section *sec,
4635 unsigned long offset, unsigned long size)
4637 int v;
4638 Sym *sym;
4640 v = anon_sym++;
4641 sym = global_identifier_push(v, type->t | VT_STATIC, 0);
4642 sym->type.ref = type->ref;
4643 sym->r = VT_CONST | VT_SYM;
4644 put_extern_sym(sym, sec, offset, size);
4645 return sym;
4648 /* push a reference to a section offset by adding a dummy symbol */
4649 static void vpush_ref(CType *type, Section *sec, unsigned long offset, unsigned long size)
4651 CValue cval;
4653 cval.ul = 0;
4654 vsetc(type, VT_CONST | VT_SYM, &cval);
4655 vtop->sym = get_sym_ref(type, sec, offset, size);
4658 /* define a new external reference to a symbol 'v' of type 'u' */
4659 static Sym *external_global_sym(int v, CType *type, int r)
4661 Sym *s;
4663 s = sym_find(v);
4664 if (!s) {
4665 /* push forward reference */
4666 s = global_identifier_push(v, type->t | VT_EXTERN, 0);
4667 s->type.ref = type->ref;
4668 s->r = r | VT_CONST | VT_SYM;
4670 return s;
4673 /* define a new external reference to a symbol 'v' of type 'u' */
4674 static Sym *external_sym(int v, CType *type, int r)
4676 Sym *s;
4678 s = sym_find(v);
4679 if (!s) {
4680 /* push forward reference */
4681 s = sym_push(v, type, r | VT_CONST | VT_SYM, 0);
4682 s->type.t |= VT_EXTERN;
4683 } else {
4684 if (!is_compatible_types(&s->type, type))
4685 error("incompatible types for redefinition of '%s'",
4686 get_tok_str(v, NULL));
4688 return s;
4691 /* push a reference to global symbol v */
4692 static void vpush_global_sym(CType *type, int v)
4694 Sym *sym;
4695 CValue cval;
4697 sym = external_global_sym(v, type, 0);
4698 cval.ul = 0;
4699 vsetc(type, VT_CONST | VT_SYM, &cval);
4700 vtop->sym = sym;
4703 void vset(CType *type, int r, int v)
4705 CValue cval;
4707 cval.i = v;
4708 vsetc(type, r, &cval);
4711 void vseti(int r, int v)
4713 CType type;
4714 type.t = VT_INT;
4715 vset(&type, r, v);
4718 void vswap(void)
4720 SValue tmp;
4722 tmp = vtop[0];
4723 vtop[0] = vtop[-1];
4724 vtop[-1] = tmp;
4727 void vpushv(SValue *v)
4729 if (vtop >= vstack + (VSTACK_SIZE - 1))
4730 error("memory full");
4731 vtop++;
4732 *vtop = *v;
4735 void vdup(void)
4737 vpushv(vtop);
4740 /* save r to the memory stack, and mark it as being free */
4741 void save_reg(int r)
4743 int l, saved, size, align;
4744 SValue *p, sv;
4745 CType *type;
4747 /* modify all stack values */
4748 saved = 0;
4749 l = 0;
4750 for(p=vstack;p<=vtop;p++) {
4751 if ((p->r & VT_VALMASK) == r ||
4752 ((p->type.t & VT_BTYPE) == VT_LLONG && (p->r2 & VT_VALMASK) == r)) {
4753 /* must save value on stack if not already done */
4754 if (!saved) {
4755 /* NOTE: must reload 'r' because r might be equal to r2 */
4756 r = p->r & VT_VALMASK;
4757 /* store register in the stack */
4758 type = &p->type;
4759 if ((p->r & VT_LVAL) ||
4760 (!is_float(type->t) && (type->t & VT_BTYPE) != VT_LLONG))
4761 type = &int_type;
4762 size = type_size(type, &align);
4763 loc = (loc - size) & -align;
4764 sv.type.t = type->t;
4765 sv.r = VT_LOCAL | VT_LVAL;
4766 sv.c.ul = loc;
4767 store(r, &sv);
4768 #ifdef TCC_TARGET_I386
4769 /* x86 specific: need to pop fp register ST0 if saved */
4770 if (r == TREG_ST0) {
4771 o(0xd9dd); /* fstp %st(1) */
4773 #endif
4774 /* special long long case */
4775 if ((type->t & VT_BTYPE) == VT_LLONG) {
4776 sv.c.ul += 4;
4777 store(p->r2, &sv);
4779 l = loc;
4780 saved = 1;
4782 /* mark that stack entry as being saved on the stack */
4783 if (p->r & VT_LVAL) {
4784 /* also clear the bounded flag because the
4785 relocation address of the function was stored in
4786 p->c.ul */
4787 p->r = (p->r & ~(VT_VALMASK | VT_BOUNDED)) | VT_LLOCAL;
4788 } else {
4789 p->r = lvalue_type(p->type.t) | VT_LOCAL;
4791 p->r2 = VT_CONST;
4792 p->c.ul = l;
4797 /* find a register of class 'rc2' with at most one reference on stack.
4798 * If none, call get_reg(rc) */
4799 int get_reg_ex(int rc, int rc2)
4801 int r;
4802 SValue *p;
4804 for(r=0;r<NB_REGS;r++) {
4805 if (reg_classes[r] & rc2) {
4806 int n;
4807 n=0;
4808 for(p = vstack; p <= vtop; p++) {
4809 if ((p->r & VT_VALMASK) == r ||
4810 (p->r2 & VT_VALMASK) == r)
4811 n++;
4813 if (n <= 1)
4814 return r;
4817 return get_reg(rc);
4820 /* find a free register of class 'rc'. If none, save one register */
4821 int get_reg(int rc)
4823 int r;
4824 SValue *p;
4826 /* find a free register */
4827 for(r=0;r<NB_REGS;r++) {
4828 if (reg_classes[r] & rc) {
4829 for(p=vstack;p<=vtop;p++) {
4830 if ((p->r & VT_VALMASK) == r ||
4831 (p->r2 & VT_VALMASK) == r)
4832 goto notfound;
4834 return r;
4836 notfound: ;
4839 /* no register left : free the first one on the stack (VERY
4840 IMPORTANT to start from the bottom to ensure that we don't
4841 spill registers used in gen_opi()) */
4842 for(p=vstack;p<=vtop;p++) {
4843 r = p->r & VT_VALMASK;
4844 if (r < VT_CONST && (reg_classes[r] & rc))
4845 goto save_found;
4846 /* also look at second register (if long long) */
4847 r = p->r2 & VT_VALMASK;
4848 if (r < VT_CONST && (reg_classes[r] & rc)) {
4849 save_found:
4850 save_reg(r);
4851 return r;
4854 /* Should never comes here */
4855 return -1;
4858 /* save registers up to (vtop - n) stack entry */
4859 void save_regs(int n)
4861 int r;
4862 SValue *p, *p1;
4863 p1 = vtop - n;
4864 for(p = vstack;p <= p1; p++) {
4865 r = p->r & VT_VALMASK;
4866 if (r < VT_CONST) {
4867 save_reg(r);
4872 /* move register 's' to 'r', and flush previous value of r to memory
4873 if needed */
4874 void move_reg(int r, int s)
4876 SValue sv;
4878 if (r != s) {
4879 save_reg(r);
4880 sv.type.t = VT_INT;
4881 sv.r = s;
4882 sv.c.ul = 0;
4883 load(r, &sv);
4887 /* get address of vtop (vtop MUST BE an lvalue) */
4888 void gaddrof(void)
4890 vtop->r &= ~VT_LVAL;
4891 /* tricky: if saved lvalue, then we can go back to lvalue */
4892 if ((vtop->r & VT_VALMASK) == VT_LLOCAL)
4893 vtop->r = (vtop->r & ~(VT_VALMASK | VT_LVAL_TYPE)) | VT_LOCAL | VT_LVAL;
4896 #ifdef CONFIG_TCC_BCHECK
4897 /* generate lvalue bound code */
4898 void gbound(void)
4900 int lval_type;
4901 CType type1;
4903 vtop->r &= ~VT_MUSTBOUND;
4904 /* if lvalue, then use checking code before dereferencing */
4905 if (vtop->r & VT_LVAL) {
4906 /* if not VT_BOUNDED value, then make one */
4907 if (!(vtop->r & VT_BOUNDED)) {
4908 lval_type = vtop->r & (VT_LVAL_TYPE | VT_LVAL);
4909 /* must save type because we must set it to int to get pointer */
4910 type1 = vtop->type;
4911 vtop->type.t = VT_INT;
4912 gaddrof();
4913 vpushi(0);
4914 gen_bounded_ptr_add();
4915 vtop->r |= lval_type;
4916 vtop->type = type1;
4918 /* then check for dereferencing */
4919 gen_bounded_ptr_deref();
4922 #endif
4924 /* store vtop a register belonging to class 'rc'. lvalues are
4925 converted to values. Cannot be used if cannot be converted to
4926 register value (such as structures). */
4927 int gv(int rc)
4929 int r, r2, rc2, bit_pos, bit_size, size, align, i;
4930 unsigned long long ll;
4932 /* NOTE: get_reg can modify vstack[] */
4933 if (vtop->type.t & VT_BITFIELD) {
4934 CType type;
4935 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
4936 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
4937 /* remove bit field info to avoid loops */
4938 vtop->type.t &= ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT));
4939 /* cast to int to propagate signedness in following ops */
4940 type.t = VT_INT;
4941 if((vtop->type.t & VT_UNSIGNED) ||
4942 (vtop->type.t & VT_BTYPE) == VT_BOOL)
4943 type.t |= VT_UNSIGNED;
4944 gen_cast(&type);
4945 /* generate shifts */
4946 vpushi(32 - (bit_pos + bit_size));
4947 gen_op(TOK_SHL);
4948 vpushi(32 - bit_size);
4949 /* NOTE: transformed to SHR if unsigned */
4950 gen_op(TOK_SAR);
4951 r = gv(rc);
4952 } else {
4953 if (is_float(vtop->type.t) &&
4954 (vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
4955 Sym *sym;
4956 int *ptr;
4957 unsigned long offset;
4958 #if defined(TCC_TARGET_ARM) && !defined(TCC_ARM_VFP)
4959 CValue check;
4960 #endif
4962 /* XXX: unify with initializers handling ? */
4963 /* CPUs usually cannot use float constants, so we store them
4964 generically in data segment */
4965 size = type_size(&vtop->type, &align);
4966 offset = (data_section->data_offset + align - 1) & -align;
4967 data_section->data_offset = offset;
4968 /* XXX: not portable yet */
4969 #ifdef __i386__
4970 /* Zero pad x87 tenbyte long doubles */
4971 if (size == 12)
4972 vtop->c.tab[2] &= 0xffff;
4973 #endif
4974 ptr = section_ptr_add(data_section, size);
4975 size = size >> 2;
4976 #if defined(TCC_TARGET_ARM) && !defined(TCC_ARM_VFP)
4977 check.d = 1;
4978 if(check.tab[0])
4979 for(i=0;i<size;i++)
4980 ptr[i] = vtop->c.tab[size-1-i];
4981 else
4982 #endif
4983 for(i=0;i<size;i++)
4984 ptr[i] = vtop->c.tab[i];
4985 sym = get_sym_ref(&vtop->type, data_section, offset, size << 2);
4986 vtop->r |= VT_LVAL | VT_SYM;
4987 vtop->sym = sym;
4988 vtop->c.ul = 0;
4990 #ifdef CONFIG_TCC_BCHECK
4991 if (vtop->r & VT_MUSTBOUND)
4992 gbound();
4993 #endif
4995 r = vtop->r & VT_VALMASK;
4996 rc2 = RC_INT;
4997 if (rc == RC_IRET)
4998 rc2 = RC_LRET;
4999 /* need to reload if:
5000 - constant
5001 - lvalue (need to dereference pointer)
5002 - already a register, but not in the right class */
5003 if (r >= VT_CONST ||
5004 (vtop->r & VT_LVAL) ||
5005 !(reg_classes[r] & rc) ||
5006 ((vtop->type.t & VT_BTYPE) == VT_LLONG &&
5007 !(reg_classes[vtop->r2] & rc2))) {
5008 r = get_reg(rc);
5009 if ((vtop->type.t & VT_BTYPE) == VT_LLONG) {
5010 /* two register type load : expand to two words
5011 temporarily */
5012 if ((vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
5013 /* load constant */
5014 ll = vtop->c.ull;
5015 vtop->c.ui = ll; /* first word */
5016 load(r, vtop);
5017 vtop->r = r; /* save register value */
5018 vpushi(ll >> 32); /* second word */
5019 } else if (r >= VT_CONST || /* XXX: test to VT_CONST incorrect ? */
5020 (vtop->r & VT_LVAL)) {
5021 /* We do not want to modifier the long long
5022 pointer here, so the safest (and less
5023 efficient) is to save all the other registers
5024 in the stack. XXX: totally inefficient. */
5025 save_regs(1);
5026 /* load from memory */
5027 load(r, vtop);
5028 vdup();
5029 vtop[-1].r = r; /* save register value */
5030 /* increment pointer to get second word */
5031 vtop->type.t = VT_INT;
5032 gaddrof();
5033 vpushi(4);
5034 gen_op('+');
5035 vtop->r |= VT_LVAL;
5036 } else {
5037 /* move registers */
5038 load(r, vtop);
5039 vdup();
5040 vtop[-1].r = r; /* save register value */
5041 vtop->r = vtop[-1].r2;
5043 /* allocate second register */
5044 r2 = get_reg(rc2);
5045 load(r2, vtop);
5046 vpop();
5047 /* write second register */
5048 vtop->r2 = r2;
5049 } else if ((vtop->r & VT_LVAL) && !is_float(vtop->type.t)) {
5050 int t1, t;
5051 /* lvalue of scalar type : need to use lvalue type
5052 because of possible cast */
5053 t = vtop->type.t;
5054 t1 = t;
5055 /* compute memory access type */
5056 if (vtop->r & VT_LVAL_BYTE)
5057 t = VT_BYTE;
5058 else if (vtop->r & VT_LVAL_SHORT)
5059 t = VT_SHORT;
5060 if (vtop->r & VT_LVAL_UNSIGNED)
5061 t |= VT_UNSIGNED;
5062 vtop->type.t = t;
5063 load(r, vtop);
5064 /* restore wanted type */
5065 vtop->type.t = t1;
5066 } else {
5067 /* one register type load */
5068 load(r, vtop);
5071 vtop->r = r;
5072 #ifdef TCC_TARGET_C67
5073 /* uses register pairs for doubles */
5074 if ((vtop->type.t & VT_BTYPE) == VT_DOUBLE)
5075 vtop->r2 = r+1;
5076 #endif
5078 return r;
5081 /* generate vtop[-1] and vtop[0] in resp. classes rc1 and rc2 */
5082 void gv2(int rc1, int rc2)
5084 int v;
5086 /* generate more generic register first. But VT_JMP or VT_CMP
5087 values must be generated first in all cases to avoid possible
5088 reload errors */
5089 v = vtop[0].r & VT_VALMASK;
5090 if (v != VT_CMP && (v & ~1) != VT_JMP && rc1 <= rc2) {
5091 vswap();
5092 gv(rc1);
5093 vswap();
5094 gv(rc2);
5095 /* test if reload is needed for first register */
5096 if ((vtop[-1].r & VT_VALMASK) >= VT_CONST) {
5097 vswap();
5098 gv(rc1);
5099 vswap();
5101 } else {
5102 gv(rc2);
5103 vswap();
5104 gv(rc1);
5105 vswap();
5106 /* test if reload is needed for first register */
5107 if ((vtop[0].r & VT_VALMASK) >= VT_CONST) {
5108 gv(rc2);
5113 /* expand long long on stack in two int registers */
5114 void lexpand(void)
5116 int u;
5118 u = vtop->type.t & VT_UNSIGNED;
5119 gv(RC_INT);
5120 vdup();
5121 vtop[0].r = vtop[-1].r2;
5122 vtop[0].r2 = VT_CONST;
5123 vtop[-1].r2 = VT_CONST;
5124 vtop[0].type.t = VT_INT | u;
5125 vtop[-1].type.t = VT_INT | u;
5128 #ifdef TCC_TARGET_ARM
5129 /* expand long long on stack */
5130 void lexpand_nr(void)
5132 int u,v;
5134 u = vtop->type.t & VT_UNSIGNED;
5135 vdup();
5136 vtop->r2 = VT_CONST;
5137 vtop->type.t = VT_INT | u;
5138 v=vtop[-1].r & (VT_VALMASK | VT_LVAL);
5139 if (v == VT_CONST) {
5140 vtop[-1].c.ui = vtop->c.ull;
5141 vtop->c.ui = vtop->c.ull >> 32;
5142 vtop->r = VT_CONST;
5143 } else if (v == (VT_LVAL|VT_CONST) || v == (VT_LVAL|VT_LOCAL)) {
5144 vtop->c.ui += 4;
5145 vtop->r = vtop[-1].r;
5146 } else if (v > VT_CONST) {
5147 vtop--;
5148 lexpand();
5149 } else
5150 vtop->r = vtop[-1].r2;
5151 vtop[-1].r2 = VT_CONST;
5152 vtop[-1].type.t = VT_INT | u;
5154 #endif
5156 /* build a long long from two ints */
5157 void lbuild(int t)
5159 gv2(RC_INT, RC_INT);
5160 vtop[-1].r2 = vtop[0].r;
5161 vtop[-1].type.t = t;
5162 vpop();
5165 /* rotate n first stack elements to the bottom
5166 I1 ... In -> I2 ... In I1 [top is right]
5168 void vrotb(int n)
5170 int i;
5171 SValue tmp;
5173 tmp = vtop[-n + 1];
5174 for(i=-n+1;i!=0;i++)
5175 vtop[i] = vtop[i+1];
5176 vtop[0] = tmp;
5179 /* rotate n first stack elements to the top
5180 I1 ... In -> In I1 ... I(n-1) [top is right]
5182 void vrott(int n)
5184 int i;
5185 SValue tmp;
5187 tmp = vtop[0];
5188 for(i = 0;i < n - 1; i++)
5189 vtop[-i] = vtop[-i - 1];
5190 vtop[-n + 1] = tmp;
5193 #ifdef TCC_TARGET_ARM
5194 /* like vrott but in other direction
5195 In ... I1 -> I(n-1) ... I1 In [top is right]
5197 void vnrott(int n)
5199 int i;
5200 SValue tmp;
5202 tmp = vtop[-n + 1];
5203 for(i = n - 1; i > 0; i--)
5204 vtop[-i] = vtop[-i + 1];
5205 vtop[0] = tmp;
5207 #endif
5209 /* pop stack value */
5210 void vpop(void)
5212 int v;
5213 v = vtop->r & VT_VALMASK;
5214 #ifdef TCC_TARGET_I386
5215 /* for x86, we need to pop the FP stack */
5216 if (v == TREG_ST0 && !nocode_wanted) {
5217 o(0xd9dd); /* fstp %st(1) */
5218 } else
5219 #endif
5220 if (v == VT_JMP || v == VT_JMPI) {
5221 /* need to put correct jump if && or || without test */
5222 gsym(vtop->c.ul);
5224 vtop--;
5227 /* convert stack entry to register and duplicate its value in another
5228 register */
5229 void gv_dup(void)
5231 int rc, t, r, r1;
5232 SValue sv;
5234 t = vtop->type.t;
5235 if ((t & VT_BTYPE) == VT_LLONG) {
5236 lexpand();
5237 gv_dup();
5238 vswap();
5239 vrotb(3);
5240 gv_dup();
5241 vrotb(4);
5242 /* stack: H L L1 H1 */
5243 lbuild(t);
5244 vrotb(3);
5245 vrotb(3);
5246 vswap();
5247 lbuild(t);
5248 vswap();
5249 } else {
5250 /* duplicate value */
5251 rc = RC_INT;
5252 sv.type.t = VT_INT;
5253 if (is_float(t)) {
5254 rc = RC_FLOAT;
5255 sv.type.t = t;
5257 r = gv(rc);
5258 r1 = get_reg(rc);
5259 sv.r = r;
5260 sv.c.ul = 0;
5261 load(r1, &sv); /* move r to r1 */
5262 vdup();
5263 /* duplicates value */
5264 vtop->r = r1;
5268 /* generate CPU independent (unsigned) long long operations */
5269 void gen_opl(int op)
5271 int t, a, b, op1, c, i;
5272 int func;
5273 unsigned short reg_iret = REG_IRET;
5274 unsigned short reg_lret = REG_LRET;
5275 SValue tmp;
5277 switch(op) {
5278 case '/':
5279 case TOK_PDIV:
5280 func = TOK___divdi3;
5281 goto gen_func;
5282 case TOK_UDIV:
5283 func = TOK___udivdi3;
5284 goto gen_func;
5285 case '%':
5286 func = TOK___moddi3;
5287 goto gen_mod_func;
5288 case TOK_UMOD:
5289 func = TOK___umoddi3;
5290 gen_mod_func:
5291 #ifdef TCC_ARM_EABI
5292 reg_iret = TREG_R2;
5293 reg_lret = TREG_R3;
5294 #endif
5295 gen_func:
5296 /* call generic long long function */
5297 vpush_global_sym(&func_old_type, func);
5298 vrott(3);
5299 gfunc_call(2);
5300 vpushi(0);
5301 vtop->r = reg_iret;
5302 vtop->r2 = reg_lret;
5303 break;
5304 case '^':
5305 case '&':
5306 case '|':
5307 case '*':
5308 case '+':
5309 case '-':
5310 t = vtop->type.t;
5311 vswap();
5312 lexpand();
5313 vrotb(3);
5314 lexpand();
5315 /* stack: L1 H1 L2 H2 */
5316 tmp = vtop[0];
5317 vtop[0] = vtop[-3];
5318 vtop[-3] = tmp;
5319 tmp = vtop[-2];
5320 vtop[-2] = vtop[-3];
5321 vtop[-3] = tmp;
5322 vswap();
5323 /* stack: H1 H2 L1 L2 */
5324 if (op == '*') {
5325 vpushv(vtop - 1);
5326 vpushv(vtop - 1);
5327 gen_op(TOK_UMULL);
5328 lexpand();
5329 /* stack: H1 H2 L1 L2 ML MH */
5330 for(i=0;i<4;i++)
5331 vrotb(6);
5332 /* stack: ML MH H1 H2 L1 L2 */
5333 tmp = vtop[0];
5334 vtop[0] = vtop[-2];
5335 vtop[-2] = tmp;
5336 /* stack: ML MH H1 L2 H2 L1 */
5337 gen_op('*');
5338 vrotb(3);
5339 vrotb(3);
5340 gen_op('*');
5341 /* stack: ML MH M1 M2 */
5342 gen_op('+');
5343 gen_op('+');
5344 } else if (op == '+' || op == '-') {
5345 /* XXX: add non carry method too (for MIPS or alpha) */
5346 if (op == '+')
5347 op1 = TOK_ADDC1;
5348 else
5349 op1 = TOK_SUBC1;
5350 gen_op(op1);
5351 /* stack: H1 H2 (L1 op L2) */
5352 vrotb(3);
5353 vrotb(3);
5354 gen_op(op1 + 1); /* TOK_xxxC2 */
5355 } else {
5356 gen_op(op);
5357 /* stack: H1 H2 (L1 op L2) */
5358 vrotb(3);
5359 vrotb(3);
5360 /* stack: (L1 op L2) H1 H2 */
5361 gen_op(op);
5362 /* stack: (L1 op L2) (H1 op H2) */
5364 /* stack: L H */
5365 lbuild(t);
5366 break;
5367 case TOK_SAR:
5368 case TOK_SHR:
5369 case TOK_SHL:
5370 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
5371 t = vtop[-1].type.t;
5372 vswap();
5373 lexpand();
5374 vrotb(3);
5375 /* stack: L H shift */
5376 c = (int)vtop->c.i;
5377 /* constant: simpler */
5378 /* NOTE: all comments are for SHL. the other cases are
5379 done by swaping words */
5380 vpop();
5381 if (op != TOK_SHL)
5382 vswap();
5383 if (c >= 32) {
5384 /* stack: L H */
5385 vpop();
5386 if (c > 32) {
5387 vpushi(c - 32);
5388 gen_op(op);
5390 if (op != TOK_SAR) {
5391 vpushi(0);
5392 } else {
5393 gv_dup();
5394 vpushi(31);
5395 gen_op(TOK_SAR);
5397 vswap();
5398 } else {
5399 vswap();
5400 gv_dup();
5401 /* stack: H L L */
5402 vpushi(c);
5403 gen_op(op);
5404 vswap();
5405 vpushi(32 - c);
5406 if (op == TOK_SHL)
5407 gen_op(TOK_SHR);
5408 else
5409 gen_op(TOK_SHL);
5410 vrotb(3);
5411 /* stack: L L H */
5412 vpushi(c);
5413 if (op == TOK_SHL)
5414 gen_op(TOK_SHL);
5415 else
5416 gen_op(TOK_SHR);
5417 gen_op('|');
5419 if (op != TOK_SHL)
5420 vswap();
5421 lbuild(t);
5422 } else {
5423 /* XXX: should provide a faster fallback on x86 ? */
5424 switch(op) {
5425 case TOK_SAR:
5426 func = TOK___ashrdi3;
5427 goto gen_func;
5428 case TOK_SHR:
5429 func = TOK___lshrdi3;
5430 goto gen_func;
5431 case TOK_SHL:
5432 func = TOK___ashldi3;
5433 goto gen_func;
5436 break;
5437 default:
5438 /* compare operations */
5439 t = vtop->type.t;
5440 vswap();
5441 lexpand();
5442 vrotb(3);
5443 lexpand();
5444 /* stack: L1 H1 L2 H2 */
5445 tmp = vtop[-1];
5446 vtop[-1] = vtop[-2];
5447 vtop[-2] = tmp;
5448 /* stack: L1 L2 H1 H2 */
5449 /* compare high */
5450 op1 = op;
5451 /* when values are equal, we need to compare low words. since
5452 the jump is inverted, we invert the test too. */
5453 if (op1 == TOK_LT)
5454 op1 = TOK_LE;
5455 else if (op1 == TOK_GT)
5456 op1 = TOK_GE;
5457 else if (op1 == TOK_ULT)
5458 op1 = TOK_ULE;
5459 else if (op1 == TOK_UGT)
5460 op1 = TOK_UGE;
5461 a = 0;
5462 b = 0;
5463 gen_op(op1);
5464 if (op1 != TOK_NE) {
5465 a = gtst(1, 0);
5467 if (op != TOK_EQ) {
5468 /* generate non equal test */
5469 /* XXX: NOT PORTABLE yet */
5470 if (a == 0) {
5471 b = gtst(0, 0);
5472 } else {
5473 #if defined(TCC_TARGET_I386)
5474 b = psym(0x850f, 0);
5475 #elif defined(TCC_TARGET_ARM)
5476 b = ind;
5477 o(0x1A000000 | encbranch(ind, 0, 1));
5478 #elif defined(TCC_TARGET_C67)
5479 error("not implemented");
5480 #else
5481 #error not supported
5482 #endif
5485 /* compare low. Always unsigned */
5486 op1 = op;
5487 if (op1 == TOK_LT)
5488 op1 = TOK_ULT;
5489 else if (op1 == TOK_LE)
5490 op1 = TOK_ULE;
5491 else if (op1 == TOK_GT)
5492 op1 = TOK_UGT;
5493 else if (op1 == TOK_GE)
5494 op1 = TOK_UGE;
5495 gen_op(op1);
5496 a = gtst(1, a);
5497 gsym(b);
5498 vseti(VT_JMPI, a);
5499 break;
5503 /* handle integer constant optimizations and various machine
5504 independent opt */
5505 void gen_opic(int op)
5507 int c1, c2, t1, t2, n;
5508 SValue *v1, *v2;
5509 long long l1, l2;
5510 typedef unsigned long long U;
5512 v1 = vtop - 1;
5513 v2 = vtop;
5514 t1 = v1->type.t & VT_BTYPE;
5515 t2 = v2->type.t & VT_BTYPE;
5516 l1 = (t1 == VT_LLONG) ? v1->c.ll : v1->c.i;
5517 l2 = (t2 == VT_LLONG) ? v2->c.ll : v2->c.i;
5519 /* currently, we cannot do computations with forward symbols */
5520 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5521 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5522 if (c1 && c2) {
5523 switch(op) {
5524 case '+': l1 += l2; break;
5525 case '-': l1 -= l2; break;
5526 case '&': l1 &= l2; break;
5527 case '^': l1 ^= l2; break;
5528 case '|': l1 |= l2; break;
5529 case '*': l1 *= l2; break;
5531 case TOK_PDIV:
5532 case '/':
5533 case '%':
5534 case TOK_UDIV:
5535 case TOK_UMOD:
5536 /* if division by zero, generate explicit division */
5537 if (l2 == 0) {
5538 if (const_wanted)
5539 error("division by zero in constant");
5540 goto general_case;
5542 switch(op) {
5543 default: l1 /= l2; break;
5544 case '%': l1 %= l2; break;
5545 case TOK_UDIV: l1 = (U)l1 / l2; break;
5546 case TOK_UMOD: l1 = (U)l1 % l2; break;
5548 break;
5549 case TOK_SHL: l1 <<= l2; break;
5550 case TOK_SHR: l1 = (U)l1 >> l2; break;
5551 case TOK_SAR: l1 >>= l2; break;
5552 /* tests */
5553 case TOK_ULT: l1 = (U)l1 < (U)l2; break;
5554 case TOK_UGE: l1 = (U)l1 >= (U)l2; break;
5555 case TOK_EQ: l1 = l1 == l2; break;
5556 case TOK_NE: l1 = l1 != l2; break;
5557 case TOK_ULE: l1 = (U)l1 <= (U)l2; break;
5558 case TOK_UGT: l1 = (U)l1 > (U)l2; break;
5559 case TOK_LT: l1 = l1 < l2; break;
5560 case TOK_GE: l1 = l1 >= l2; break;
5561 case TOK_LE: l1 = l1 <= l2; break;
5562 case TOK_GT: l1 = l1 > l2; break;
5563 /* logical */
5564 case TOK_LAND: l1 = l1 && l2; break;
5565 case TOK_LOR: l1 = l1 || l2; break;
5566 default:
5567 goto general_case;
5569 v1->c.ll = l1;
5570 vtop--;
5571 } else {
5572 /* if commutative ops, put c2 as constant */
5573 if (c1 && (op == '+' || op == '&' || op == '^' ||
5574 op == '|' || op == '*')) {
5575 vswap();
5576 c2 = c1; //c = c1, c1 = c2, c2 = c;
5577 l2 = l1; //l = l1, l1 = l2, l2 = l;
5579 /* Filter out NOP operations like x*1, x-0, x&-1... */
5580 if (c2 && (((op == '*' || op == '/' || op == TOK_UDIV ||
5581 op == TOK_PDIV) &&
5582 l2 == 1) ||
5583 ((op == '+' || op == '-' || op == '|' || op == '^' ||
5584 op == TOK_SHL || op == TOK_SHR || op == TOK_SAR) &&
5585 l2 == 0) ||
5586 (op == '&' &&
5587 l2 == -1))) {
5588 /* nothing to do */
5589 vtop--;
5590 } else if (c2 && (op == '*' || op == TOK_PDIV || op == TOK_UDIV)) {
5591 /* try to use shifts instead of muls or divs */
5592 if (l2 > 0 && (l2 & (l2 - 1)) == 0) {
5593 n = -1;
5594 while (l2) {
5595 l2 >>= 1;
5596 n++;
5598 vtop->c.ll = n;
5599 if (op == '*')
5600 op = TOK_SHL;
5601 else if (op == TOK_PDIV)
5602 op = TOK_SAR;
5603 else
5604 op = TOK_SHR;
5606 goto general_case;
5607 } else if (c2 && (op == '+' || op == '-') &&
5608 ((vtop[-1].r & (VT_VALMASK | VT_LVAL | VT_SYM)) ==
5609 (VT_CONST | VT_SYM) ||
5610 (vtop[-1].r & (VT_VALMASK | VT_LVAL)) == VT_LOCAL)) {
5611 /* symbol + constant case */
5612 if (op == '-')
5613 l2 = -l2;
5614 vtop--;
5615 vtop->c.ll += l2;
5616 } else {
5617 general_case:
5618 if (!nocode_wanted) {
5619 /* call low level op generator */
5620 if (t1 == VT_LLONG || t2 == VT_LLONG)
5621 gen_opl(op);
5622 else
5623 gen_opi(op);
5624 } else {
5625 vtop--;
5631 /* generate a floating point operation with constant propagation */
5632 void gen_opif(int op)
5634 int c1, c2;
5635 SValue *v1, *v2;
5636 long double f1, f2;
5638 v1 = vtop - 1;
5639 v2 = vtop;
5640 /* currently, we cannot do computations with forward symbols */
5641 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5642 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5643 if (c1 && c2) {
5644 if (v1->type.t == VT_FLOAT) {
5645 f1 = v1->c.f;
5646 f2 = v2->c.f;
5647 } else if (v1->type.t == VT_DOUBLE) {
5648 f1 = v1->c.d;
5649 f2 = v2->c.d;
5650 } else {
5651 f1 = v1->c.ld;
5652 f2 = v2->c.ld;
5655 /* NOTE: we only do constant propagation if finite number (not
5656 NaN or infinity) (ANSI spec) */
5657 if (!ieee_finite(f1) || !ieee_finite(f2))
5658 goto general_case;
5660 switch(op) {
5661 case '+': f1 += f2; break;
5662 case '-': f1 -= f2; break;
5663 case '*': f1 *= f2; break;
5664 case '/':
5665 if (f2 == 0.0) {
5666 if (const_wanted)
5667 error("division by zero in constant");
5668 goto general_case;
5670 f1 /= f2;
5671 break;
5672 /* XXX: also handles tests ? */
5673 default:
5674 goto general_case;
5676 /* XXX: overflow test ? */
5677 if (v1->type.t == VT_FLOAT) {
5678 v1->c.f = f1;
5679 } else if (v1->type.t == VT_DOUBLE) {
5680 v1->c.d = f1;
5681 } else {
5682 v1->c.ld = f1;
5684 vtop--;
5685 } else {
5686 general_case:
5687 if (!nocode_wanted) {
5688 gen_opf(op);
5689 } else {
5690 vtop--;
5695 static int pointed_size(CType *type)
5697 int align;
5698 return type_size(pointed_type(type), &align);
5701 static inline int is_null_pointer(SValue *p)
5703 if ((p->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
5704 return 0;
5705 return ((p->type.t & VT_BTYPE) == VT_INT && p->c.i == 0) ||
5706 ((p->type.t & VT_BTYPE) == VT_LLONG && p->c.ll == 0);
5709 static inline int is_integer_btype(int bt)
5711 return (bt == VT_BYTE || bt == VT_SHORT ||
5712 bt == VT_INT || bt == VT_LLONG);
5715 /* check types for comparison or substraction of pointers */
5716 static void check_comparison_pointer_types(SValue *p1, SValue *p2, int op)
5718 CType *type1, *type2, tmp_type1, tmp_type2;
5719 int bt1, bt2;
5721 /* null pointers are accepted for all comparisons as gcc */
5722 if (is_null_pointer(p1) || is_null_pointer(p2))
5723 return;
5724 type1 = &p1->type;
5725 type2 = &p2->type;
5726 bt1 = type1->t & VT_BTYPE;
5727 bt2 = type2->t & VT_BTYPE;
5728 /* accept comparison between pointer and integer with a warning */
5729 if ((is_integer_btype(bt1) || is_integer_btype(bt2)) && op != '-') {
5730 if (op != TOK_LOR && op != TOK_LAND )
5731 warning("comparison between pointer and integer");
5732 return;
5735 /* both must be pointers or implicit function pointers */
5736 if (bt1 == VT_PTR) {
5737 type1 = pointed_type(type1);
5738 } else if (bt1 != VT_FUNC)
5739 goto invalid_operands;
5741 if (bt2 == VT_PTR) {
5742 type2 = pointed_type(type2);
5743 } else if (bt2 != VT_FUNC) {
5744 invalid_operands:
5745 error("invalid operands to binary %s", get_tok_str(op, NULL));
5747 if ((type1->t & VT_BTYPE) == VT_VOID ||
5748 (type2->t & VT_BTYPE) == VT_VOID)
5749 return;
5750 tmp_type1 = *type1;
5751 tmp_type2 = *type2;
5752 tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
5753 tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
5754 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
5755 /* gcc-like error if '-' is used */
5756 if (op == '-')
5757 goto invalid_operands;
5758 else
5759 warning("comparison of distinct pointer types lacks a cast");
5763 /* generic gen_op: handles types problems */
5764 void gen_op(int op)
5766 int u, t1, t2, bt1, bt2, t;
5767 CType type1;
5769 t1 = vtop[-1].type.t;
5770 t2 = vtop[0].type.t;
5771 bt1 = t1 & VT_BTYPE;
5772 bt2 = t2 & VT_BTYPE;
5774 if (bt1 == VT_PTR || bt2 == VT_PTR) {
5775 /* at least one operand is a pointer */
5776 /* relationnal op: must be both pointers */
5777 if (op >= TOK_ULT && op <= TOK_LOR) {
5778 check_comparison_pointer_types(vtop - 1, vtop, op);
5779 /* pointers are handled are unsigned */
5780 t = VT_INT | VT_UNSIGNED;
5781 goto std_op;
5783 /* if both pointers, then it must be the '-' op */
5784 if (bt1 == VT_PTR && bt2 == VT_PTR) {
5785 if (op != '-')
5786 error("cannot use pointers here");
5787 check_comparison_pointer_types(vtop - 1, vtop, op);
5788 /* XXX: check that types are compatible */
5789 u = pointed_size(&vtop[-1].type);
5790 gen_opic(op);
5791 /* set to integer type */
5792 vtop->type.t = VT_INT;
5793 vpushi(u);
5794 gen_op(TOK_PDIV);
5795 } else {
5796 /* exactly one pointer : must be '+' or '-'. */
5797 if (op != '-' && op != '+')
5798 error("cannot use pointers here");
5799 /* Put pointer as first operand */
5800 if (bt2 == VT_PTR) {
5801 vswap();
5802 swap(&t1, &t2);
5804 type1 = vtop[-1].type;
5805 /* XXX: cast to int ? (long long case) */
5806 vpushi(pointed_size(&vtop[-1].type));
5807 gen_op('*');
5808 #ifdef CONFIG_TCC_BCHECK
5809 /* if evaluating constant expression, no code should be
5810 generated, so no bound check */
5811 if (do_bounds_check && !const_wanted) {
5812 /* if bounded pointers, we generate a special code to
5813 test bounds */
5814 if (op == '-') {
5815 vpushi(0);
5816 vswap();
5817 gen_op('-');
5819 gen_bounded_ptr_add();
5820 } else
5821 #endif
5823 gen_opic(op);
5825 /* put again type if gen_opic() swaped operands */
5826 vtop->type = type1;
5828 } else if (is_float(bt1) || is_float(bt2)) {
5829 /* compute bigger type and do implicit casts */
5830 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
5831 t = VT_LDOUBLE;
5832 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
5833 t = VT_DOUBLE;
5834 } else {
5835 t = VT_FLOAT;
5837 /* floats can only be used for a few operations */
5838 if (op != '+' && op != '-' && op != '*' && op != '/' &&
5839 (op < TOK_ULT || op > TOK_GT))
5840 error("invalid operands for binary operation");
5841 goto std_op;
5842 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
5843 /* cast to biggest op */
5844 t = VT_LLONG;
5845 /* convert to unsigned if it does not fit in a long long */
5846 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
5847 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
5848 t |= VT_UNSIGNED;
5849 goto std_op;
5850 } else {
5851 /* integer operations */
5852 t = VT_INT;
5853 /* convert to unsigned if it does not fit in an integer */
5854 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
5855 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
5856 t |= VT_UNSIGNED;
5857 std_op:
5858 /* XXX: currently, some unsigned operations are explicit, so
5859 we modify them here */
5860 if (t & VT_UNSIGNED) {
5861 if (op == TOK_SAR)
5862 op = TOK_SHR;
5863 else if (op == '/')
5864 op = TOK_UDIV;
5865 else if (op == '%')
5866 op = TOK_UMOD;
5867 else if (op == TOK_LT)
5868 op = TOK_ULT;
5869 else if (op == TOK_GT)
5870 op = TOK_UGT;
5871 else if (op == TOK_LE)
5872 op = TOK_ULE;
5873 else if (op == TOK_GE)
5874 op = TOK_UGE;
5876 vswap();
5877 type1.t = t;
5878 gen_cast(&type1);
5879 vswap();
5880 /* special case for shifts and long long: we keep the shift as
5881 an integer */
5882 if (op == TOK_SHR || op == TOK_SAR || op == TOK_SHL)
5883 type1.t = VT_INT;
5884 gen_cast(&type1);
5885 if (is_float(t))
5886 gen_opif(op);
5887 else
5888 gen_opic(op);
5889 if (op >= TOK_ULT && op <= TOK_GT) {
5890 /* relationnal op: the result is an int */
5891 vtop->type.t = VT_INT;
5892 } else {
5893 vtop->type.t = t;
5898 #ifndef TCC_TARGET_ARM
5899 /* generic itof for unsigned long long case */
5900 void gen_cvt_itof1(int t)
5902 if ((vtop->type.t & (VT_BTYPE | VT_UNSIGNED)) ==
5903 (VT_LLONG | VT_UNSIGNED)) {
5905 if (t == VT_FLOAT)
5906 vpush_global_sym(&func_old_type, TOK___floatundisf);
5907 #if LDOUBLE_SIZE != 8
5908 else if (t == VT_LDOUBLE)
5909 vpush_global_sym(&func_old_type, TOK___floatundixf);
5910 #endif
5911 else
5912 vpush_global_sym(&func_old_type, TOK___floatundidf);
5913 vrott(2);
5914 gfunc_call(1);
5915 vpushi(0);
5916 vtop->r = REG_FRET;
5917 } else {
5918 gen_cvt_itof(t);
5921 #endif
5923 /* generic ftoi for unsigned long long case */
5924 void gen_cvt_ftoi1(int t)
5926 int st;
5928 if (t == (VT_LLONG | VT_UNSIGNED)) {
5929 /* not handled natively */
5930 st = vtop->type.t & VT_BTYPE;
5931 if (st == VT_FLOAT)
5932 vpush_global_sym(&func_old_type, TOK___fixunssfdi);
5933 #if LDOUBLE_SIZE != 8
5934 else if (st == VT_LDOUBLE)
5935 vpush_global_sym(&func_old_type, TOK___fixunsxfdi);
5936 #endif
5937 else
5938 vpush_global_sym(&func_old_type, TOK___fixunsdfdi);
5939 vrott(2);
5940 gfunc_call(1);
5941 vpushi(0);
5942 vtop->r = REG_IRET;
5943 vtop->r2 = REG_LRET;
5944 } else {
5945 gen_cvt_ftoi(t);
5949 /* force char or short cast */
5950 void force_charshort_cast(int t)
5952 int bits, dbt;
5953 dbt = t & VT_BTYPE;
5954 /* XXX: add optimization if lvalue : just change type and offset */
5955 if (dbt == VT_BYTE)
5956 bits = 8;
5957 else
5958 bits = 16;
5959 if (t & VT_UNSIGNED) {
5960 vpushi((1 << bits) - 1);
5961 gen_op('&');
5962 } else {
5963 bits = 32 - bits;
5964 vpushi(bits);
5965 gen_op(TOK_SHL);
5966 /* result must be signed or the SAR is converted to an SHL
5967 This was not the case when "t" was a signed short
5968 and the last value on the stack was an unsigned int */
5969 vtop->type.t &= ~VT_UNSIGNED;
5970 vpushi(bits);
5971 gen_op(TOK_SAR);
5975 /* cast 'vtop' to 'type'. Casting to bitfields is forbidden. */
5976 static void gen_cast(CType *type)
5978 int sbt, dbt, sf, df, c, p;
5980 /* special delayed cast for char/short */
5981 /* XXX: in some cases (multiple cascaded casts), it may still
5982 be incorrect */
5983 if (vtop->r & VT_MUSTCAST) {
5984 vtop->r &= ~VT_MUSTCAST;
5985 force_charshort_cast(vtop->type.t);
5988 /* bitfields first get cast to ints */
5989 if (vtop->type.t & VT_BITFIELD) {
5990 gv(RC_INT);
5993 dbt = type->t & (VT_BTYPE | VT_UNSIGNED);
5994 sbt = vtop->type.t & (VT_BTYPE | VT_UNSIGNED);
5996 if (sbt != dbt) {
5997 sf = is_float(sbt);
5998 df = is_float(dbt);
5999 c = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
6000 p = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == (VT_CONST | VT_SYM);
6001 if (c) {
6002 /* constant case: we can do it now */
6003 /* XXX: in ISOC, cannot do it if error in convert */
6004 if (sbt == VT_FLOAT)
6005 vtop->c.ld = vtop->c.f;
6006 else if (sbt == VT_DOUBLE)
6007 vtop->c.ld = vtop->c.d;
6009 if (df) {
6010 if ((sbt & VT_BTYPE) == VT_LLONG) {
6011 if (sbt & VT_UNSIGNED)
6012 vtop->c.ld = vtop->c.ull;
6013 else
6014 vtop->c.ld = vtop->c.ll;
6015 } else if(!sf) {
6016 if (sbt & VT_UNSIGNED)
6017 vtop->c.ld = vtop->c.ui;
6018 else
6019 vtop->c.ld = vtop->c.i;
6022 if (dbt == VT_FLOAT)
6023 vtop->c.f = (float)vtop->c.ld;
6024 else if (dbt == VT_DOUBLE)
6025 vtop->c.d = (double)vtop->c.ld;
6026 } else if (sf && dbt == (VT_LLONG|VT_UNSIGNED)) {
6027 vtop->c.ull = (unsigned long long)vtop->c.ld;
6028 } else if (sf && dbt == VT_BOOL) {
6029 vtop->c.i = (vtop->c.ld != 0);
6030 } else {
6031 if(sf)
6032 vtop->c.ll = (long long)vtop->c.ld;
6033 else if (sbt == (VT_LLONG|VT_UNSIGNED))
6034 vtop->c.ll = vtop->c.ull;
6035 else if (sbt & VT_UNSIGNED)
6036 vtop->c.ll = vtop->c.ui;
6037 else if (sbt != VT_LLONG)
6038 vtop->c.ll = vtop->c.i;
6040 if (dbt == (VT_LLONG|VT_UNSIGNED))
6041 vtop->c.ull = vtop->c.ll;
6042 else if (dbt == VT_BOOL)
6043 vtop->c.i = (vtop->c.ll != 0);
6044 else if (dbt != VT_LLONG) {
6045 int s = 0;
6046 if ((dbt & VT_BTYPE) == VT_BYTE)
6047 s = 24;
6048 else if ((dbt & VT_BTYPE) == VT_SHORT)
6049 s = 16;
6051 if(dbt & VT_UNSIGNED)
6052 vtop->c.ui = ((unsigned int)vtop->c.ll << s) >> s;
6053 else
6054 vtop->c.i = ((int)vtop->c.ll << s) >> s;
6057 } else if (p && dbt == VT_BOOL) {
6058 vtop->r = VT_CONST;
6059 vtop->c.i = 1;
6060 } else if (!nocode_wanted) {
6061 /* non constant case: generate code */
6062 if (sf && df) {
6063 /* convert from fp to fp */
6064 gen_cvt_ftof(dbt);
6065 } else if (df) {
6066 /* convert int to fp */
6067 gen_cvt_itof1(dbt);
6068 } else if (sf) {
6069 /* convert fp to int */
6070 if (dbt == VT_BOOL) {
6071 vpushi(0);
6072 gen_op(TOK_NE);
6073 } else {
6074 /* we handle char/short/etc... with generic code */
6075 if (dbt != (VT_INT | VT_UNSIGNED) &&
6076 dbt != (VT_LLONG | VT_UNSIGNED) &&
6077 dbt != VT_LLONG)
6078 dbt = VT_INT;
6079 gen_cvt_ftoi1(dbt);
6080 if (dbt == VT_INT && (type->t & (VT_BTYPE | VT_UNSIGNED)) != dbt) {
6081 /* additional cast for char/short... */
6082 vtop->type.t = dbt;
6083 gen_cast(type);
6086 } else if ((dbt & VT_BTYPE) == VT_LLONG) {
6087 if ((sbt & VT_BTYPE) != VT_LLONG) {
6088 /* scalar to long long */
6089 /* machine independent conversion */
6090 gv(RC_INT);
6091 /* generate high word */
6092 if (sbt == (VT_INT | VT_UNSIGNED)) {
6093 vpushi(0);
6094 gv(RC_INT);
6095 } else {
6096 gv_dup();
6097 vpushi(31);
6098 gen_op(TOK_SAR);
6100 /* patch second register */
6101 vtop[-1].r2 = vtop->r;
6102 vpop();
6104 } else if (dbt == VT_BOOL) {
6105 /* scalar to bool */
6106 vpushi(0);
6107 gen_op(TOK_NE);
6108 } else if ((dbt & VT_BTYPE) == VT_BYTE ||
6109 (dbt & VT_BTYPE) == VT_SHORT) {
6110 if (sbt == VT_PTR) {
6111 vtop->type.t = VT_INT;
6112 warning("nonportable conversion from pointer to char/short");
6114 force_charshort_cast(dbt);
6115 } else if ((dbt & VT_BTYPE) == VT_INT) {
6116 /* scalar to int */
6117 if (sbt == VT_LLONG) {
6118 /* from long long: just take low order word */
6119 lexpand();
6120 vpop();
6122 /* if lvalue and single word type, nothing to do because
6123 the lvalue already contains the real type size (see
6124 VT_LVAL_xxx constants) */
6127 } else if ((dbt & VT_BTYPE) == VT_PTR && !(vtop->r & VT_LVAL)) {
6128 /* if we are casting between pointer types,
6129 we must update the VT_LVAL_xxx size */
6130 vtop->r = (vtop->r & ~VT_LVAL_TYPE)
6131 | (lvalue_type(type->ref->type.t) & VT_LVAL_TYPE);
6133 vtop->type = *type;
6136 /* return type size. Put alignment at 'a' */
6137 static int type_size(CType *type, int *a)
6139 Sym *s;
6140 int bt;
6142 bt = type->t & VT_BTYPE;
6143 if (bt == VT_STRUCT) {
6144 /* struct/union */
6145 s = type->ref;
6146 *a = s->r;
6147 return s->c;
6148 } else if (bt == VT_PTR) {
6149 if (type->t & VT_ARRAY) {
6150 s = type->ref;
6151 return type_size(&s->type, a) * s->c;
6152 } else {
6153 *a = PTR_SIZE;
6154 return PTR_SIZE;
6156 } else if (bt == VT_LDOUBLE) {
6157 *a = LDOUBLE_ALIGN;
6158 return LDOUBLE_SIZE;
6159 } else if (bt == VT_DOUBLE || bt == VT_LLONG) {
6160 #ifdef TCC_TARGET_I386
6161 *a = 4;
6162 #elif defined(TCC_TARGET_ARM)
6163 #ifdef TCC_ARM_EABI
6164 *a = 8;
6165 #else
6166 *a = 4;
6167 #endif
6168 #else
6169 *a = 8;
6170 #endif
6171 return 8;
6172 } else if (bt == VT_INT || bt == VT_ENUM || bt == VT_FLOAT) {
6173 *a = 4;
6174 return 4;
6175 } else if (bt == VT_SHORT) {
6176 *a = 2;
6177 return 2;
6178 } else {
6179 /* char, void, function, _Bool */
6180 *a = 1;
6181 return 1;
6185 /* return the pointed type of t */
6186 static inline CType *pointed_type(CType *type)
6188 return &type->ref->type;
6191 /* modify type so that its it is a pointer to type. */
6192 static void mk_pointer(CType *type)
6194 Sym *s;
6195 s = sym_push(SYM_FIELD, type, 0, -1);
6196 type->t = VT_PTR | (type->t & ~VT_TYPE);
6197 type->ref = s;
6200 /* compare function types. OLD functions match any new functions */
6201 static int is_compatible_func(CType *type1, CType *type2)
6203 Sym *s1, *s2;
6205 s1 = type1->ref;
6206 s2 = type2->ref;
6207 if (!is_compatible_types(&s1->type, &s2->type))
6208 return 0;
6209 /* check func_call */
6210 if (FUNC_CALL(s1->r) != FUNC_CALL(s2->r))
6211 return 0;
6212 /* XXX: not complete */
6213 if (s1->c == FUNC_OLD || s2->c == FUNC_OLD)
6214 return 1;
6215 if (s1->c != s2->c)
6216 return 0;
6217 while (s1 != NULL) {
6218 if (s2 == NULL)
6219 return 0;
6220 if (!is_compatible_parameter_types(&s1->type, &s2->type))
6221 return 0;
6222 s1 = s1->next;
6223 s2 = s2->next;
6225 if (s2)
6226 return 0;
6227 return 1;
6230 /* return true if type1 and type2 are the same. If unqualified is
6231 true, qualifiers on the types are ignored.
6233 - enums are not checked as gcc __builtin_types_compatible_p ()
6235 static int compare_types(CType *type1, CType *type2, int unqualified)
6237 int bt1, t1, t2;
6239 t1 = type1->t & VT_TYPE;
6240 t2 = type2->t & VT_TYPE;
6241 if (unqualified) {
6242 /* strip qualifiers before comparing */
6243 t1 &= ~(VT_CONSTANT | VT_VOLATILE);
6244 t2 &= ~(VT_CONSTANT | VT_VOLATILE);
6246 /* XXX: bitfields ? */
6247 if (t1 != t2)
6248 return 0;
6249 /* test more complicated cases */
6250 bt1 = t1 & VT_BTYPE;
6251 if (bt1 == VT_PTR) {
6252 type1 = pointed_type(type1);
6253 type2 = pointed_type(type2);
6254 return is_compatible_types(type1, type2);
6255 } else if (bt1 == VT_STRUCT) {
6256 return (type1->ref == type2->ref);
6257 } else if (bt1 == VT_FUNC) {
6258 return is_compatible_func(type1, type2);
6259 } else {
6260 return 1;
6264 /* return true if type1 and type2 are exactly the same (including
6265 qualifiers).
6267 static int is_compatible_types(CType *type1, CType *type2)
6269 return compare_types(type1,type2,0);
6272 /* return true if type1 and type2 are the same (ignoring qualifiers).
6274 static int is_compatible_parameter_types(CType *type1, CType *type2)
6276 return compare_types(type1,type2,1);
6279 /* print a type. If 'varstr' is not NULL, then the variable is also
6280 printed in the type */
6281 /* XXX: union */
6282 /* XXX: add array and function pointers */
6283 void type_to_str(char *buf, int buf_size,
6284 CType *type, const char *varstr)
6286 int bt, v, t;
6287 Sym *s, *sa;
6288 char buf1[256];
6289 const char *tstr;
6291 t = type->t & VT_TYPE;
6292 bt = t & VT_BTYPE;
6293 buf[0] = '\0';
6294 if (t & VT_CONSTANT)
6295 pstrcat(buf, buf_size, "const ");
6296 if (t & VT_VOLATILE)
6297 pstrcat(buf, buf_size, "volatile ");
6298 if (t & VT_UNSIGNED)
6299 pstrcat(buf, buf_size, "unsigned ");
6300 switch(bt) {
6301 case VT_VOID:
6302 tstr = "void";
6303 goto add_tstr;
6304 case VT_BOOL:
6305 tstr = "_Bool";
6306 goto add_tstr;
6307 case VT_BYTE:
6308 tstr = "char";
6309 goto add_tstr;
6310 case VT_SHORT:
6311 tstr = "short";
6312 goto add_tstr;
6313 case VT_INT:
6314 tstr = "int";
6315 goto add_tstr;
6316 case VT_LONG:
6317 tstr = "long";
6318 goto add_tstr;
6319 case VT_LLONG:
6320 tstr = "long long";
6321 goto add_tstr;
6322 case VT_FLOAT:
6323 tstr = "float";
6324 goto add_tstr;
6325 case VT_DOUBLE:
6326 tstr = "double";
6327 goto add_tstr;
6328 case VT_LDOUBLE:
6329 tstr = "long double";
6330 add_tstr:
6331 pstrcat(buf, buf_size, tstr);
6332 break;
6333 case VT_ENUM:
6334 case VT_STRUCT:
6335 if (bt == VT_STRUCT)
6336 tstr = "struct ";
6337 else
6338 tstr = "enum ";
6339 pstrcat(buf, buf_size, tstr);
6340 v = type->ref->v & ~SYM_STRUCT;
6341 if (v >= SYM_FIRST_ANOM)
6342 pstrcat(buf, buf_size, "<anonymous>");
6343 else
6344 pstrcat(buf, buf_size, get_tok_str(v, NULL));
6345 break;
6346 case VT_FUNC:
6347 s = type->ref;
6348 type_to_str(buf, buf_size, &s->type, varstr);
6349 pstrcat(buf, buf_size, "(");
6350 sa = s->next;
6351 while (sa != NULL) {
6352 type_to_str(buf1, sizeof(buf1), &sa->type, NULL);
6353 pstrcat(buf, buf_size, buf1);
6354 sa = sa->next;
6355 if (sa)
6356 pstrcat(buf, buf_size, ", ");
6358 pstrcat(buf, buf_size, ")");
6359 goto no_var;
6360 case VT_PTR:
6361 s = type->ref;
6362 pstrcpy(buf1, sizeof(buf1), "*");
6363 if (varstr)
6364 pstrcat(buf1, sizeof(buf1), varstr);
6365 type_to_str(buf, buf_size, &s->type, buf1);
6366 goto no_var;
6368 if (varstr) {
6369 pstrcat(buf, buf_size, " ");
6370 pstrcat(buf, buf_size, varstr);
6372 no_var: ;
6375 /* verify type compatibility to store vtop in 'dt' type, and generate
6376 casts if needed. */
6377 static void gen_assign_cast(CType *dt)
6379 CType *st, *type1, *type2, tmp_type1, tmp_type2;
6380 char buf1[256], buf2[256];
6381 int dbt, sbt;
6383 st = &vtop->type; /* source type */
6384 dbt = dt->t & VT_BTYPE;
6385 sbt = st->t & VT_BTYPE;
6386 if (dt->t & VT_CONSTANT)
6387 warning("assignment of read-only location");
6388 switch(dbt) {
6389 case VT_PTR:
6390 /* special cases for pointers */
6391 /* '0' can also be a pointer */
6392 if (is_null_pointer(vtop))
6393 goto type_ok;
6394 /* accept implicit pointer to integer cast with warning */
6395 if (is_integer_btype(sbt)) {
6396 warning("assignment makes pointer from integer without a cast");
6397 goto type_ok;
6399 type1 = pointed_type(dt);
6400 /* a function is implicitely a function pointer */
6401 if (sbt == VT_FUNC) {
6402 if ((type1->t & VT_BTYPE) != VT_VOID &&
6403 !is_compatible_types(pointed_type(dt), st))
6404 goto error;
6405 else
6406 goto type_ok;
6408 if (sbt != VT_PTR)
6409 goto error;
6410 type2 = pointed_type(st);
6411 if ((type1->t & VT_BTYPE) == VT_VOID ||
6412 (type2->t & VT_BTYPE) == VT_VOID) {
6413 /* void * can match anything */
6414 } else {
6415 /* exact type match, except for unsigned */
6416 tmp_type1 = *type1;
6417 tmp_type2 = *type2;
6418 tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
6419 tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
6420 if (!is_compatible_types(&tmp_type1, &tmp_type2))
6421 warning("assignment from incompatible pointer type");
6423 /* check const and volatile */
6424 if ((!(type1->t & VT_CONSTANT) && (type2->t & VT_CONSTANT)) ||
6425 (!(type1->t & VT_VOLATILE) && (type2->t & VT_VOLATILE)))
6426 warning("assignment discards qualifiers from pointer target type");
6427 break;
6428 case VT_BYTE:
6429 case VT_SHORT:
6430 case VT_INT:
6431 case VT_LLONG:
6432 if (sbt == VT_PTR || sbt == VT_FUNC) {
6433 warning("assignment makes integer from pointer without a cast");
6435 /* XXX: more tests */
6436 break;
6437 case VT_STRUCT:
6438 tmp_type1 = *dt;
6439 tmp_type2 = *st;
6440 tmp_type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
6441 tmp_type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
6442 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
6443 error:
6444 type_to_str(buf1, sizeof(buf1), st, NULL);
6445 type_to_str(buf2, sizeof(buf2), dt, NULL);
6446 error("cannot cast '%s' to '%s'", buf1, buf2);
6448 break;
6450 type_ok:
6451 gen_cast(dt);
6454 /* store vtop in lvalue pushed on stack */
6455 void vstore(void)
6457 int sbt, dbt, ft, r, t, size, align, bit_size, bit_pos, rc, delayed_cast;
6459 ft = vtop[-1].type.t;
6460 sbt = vtop->type.t & VT_BTYPE;
6461 dbt = ft & VT_BTYPE;
6462 if (((sbt == VT_INT || sbt == VT_SHORT) && dbt == VT_BYTE) ||
6463 (sbt == VT_INT && dbt == VT_SHORT)) {
6464 /* optimize char/short casts */
6465 delayed_cast = VT_MUSTCAST;
6466 vtop->type.t = ft & (VT_TYPE & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT)));
6467 /* XXX: factorize */
6468 if (ft & VT_CONSTANT)
6469 warning("assignment of read-only location");
6470 } else {
6471 delayed_cast = 0;
6472 if (!(ft & VT_BITFIELD))
6473 gen_assign_cast(&vtop[-1].type);
6476 if (sbt == VT_STRUCT) {
6477 /* if structure, only generate pointer */
6478 /* structure assignment : generate memcpy */
6479 /* XXX: optimize if small size */
6480 if (!nocode_wanted) {
6481 size = type_size(&vtop->type, &align);
6483 #ifdef TCC_ARM_EABI
6484 if(!(align & 7))
6485 vpush_global_sym(&func_old_type, TOK_memcpy8);
6486 else if(!(align & 3))
6487 vpush_global_sym(&func_old_type, TOK_memcpy4);
6488 else
6489 #endif
6490 vpush_global_sym(&func_old_type, TOK_memcpy);
6492 /* destination */
6493 vpushv(vtop - 2);
6494 vtop->type.t = VT_INT;
6495 gaddrof();
6496 /* source */
6497 vpushv(vtop - 2);
6498 vtop->type.t = VT_INT;
6499 gaddrof();
6500 /* type size */
6501 vpushi(size);
6502 gfunc_call(3);
6504 vswap();
6505 vpop();
6506 } else {
6507 vswap();
6508 vpop();
6510 /* leave source on stack */
6511 } else if (ft & VT_BITFIELD) {
6512 /* bitfield store handling */
6513 bit_pos = (ft >> VT_STRUCT_SHIFT) & 0x3f;
6514 bit_size = (ft >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
6515 /* remove bit field info to avoid loops */
6516 vtop[-1].type.t = ft & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT));
6518 /* duplicate source into other register */
6519 gv_dup();
6520 vswap();
6521 vrott(3);
6523 if((ft & VT_BTYPE) == VT_BOOL) {
6524 gen_cast(&vtop[-1].type);
6525 vtop[-1].type.t = (vtop[-1].type.t & ~VT_BTYPE) | (VT_BYTE | VT_UNSIGNED);
6528 /* duplicate destination */
6529 vdup();
6530 vtop[-1] = vtop[-2];
6532 /* mask and shift source */
6533 if((ft & VT_BTYPE) != VT_BOOL) {
6534 vpushi((1 << bit_size) - 1);
6535 gen_op('&');
6537 vpushi(bit_pos);
6538 gen_op(TOK_SHL);
6539 /* load destination, mask and or with source */
6540 vswap();
6541 vpushi(~(((1 << bit_size) - 1) << bit_pos));
6542 gen_op('&');
6543 gen_op('|');
6544 /* store result */
6545 vstore();
6547 /* pop off shifted source from "duplicate source..." above */
6548 vpop();
6550 } else {
6551 #ifdef CONFIG_TCC_BCHECK
6552 /* bound check case */
6553 if (vtop[-1].r & VT_MUSTBOUND) {
6554 vswap();
6555 gbound();
6556 vswap();
6558 #endif
6559 if (!nocode_wanted) {
6560 rc = RC_INT;
6561 if (is_float(ft))
6562 rc = RC_FLOAT;
6563 r = gv(rc); /* generate value */
6564 /* if lvalue was saved on stack, must read it */
6565 if ((vtop[-1].r & VT_VALMASK) == VT_LLOCAL) {
6566 SValue sv;
6567 t = get_reg(RC_INT);
6568 sv.type.t = VT_INT;
6569 sv.r = VT_LOCAL | VT_LVAL;
6570 sv.c.ul = vtop[-1].c.ul;
6571 load(t, &sv);
6572 vtop[-1].r = t | VT_LVAL;
6574 store(r, vtop - 1);
6575 /* two word case handling : store second register at word + 4 */
6576 if ((ft & VT_BTYPE) == VT_LLONG) {
6577 vswap();
6578 /* convert to int to increment easily */
6579 vtop->type.t = VT_INT;
6580 gaddrof();
6581 vpushi(4);
6582 gen_op('+');
6583 vtop->r |= VT_LVAL;
6584 vswap();
6585 /* XXX: it works because r2 is spilled last ! */
6586 store(vtop->r2, vtop - 1);
6589 vswap();
6590 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
6591 vtop->r |= delayed_cast;
6595 /* post defines POST/PRE add. c is the token ++ or -- */
6596 void inc(int post, int c)
6598 test_lvalue();
6599 vdup(); /* save lvalue */
6600 if (post) {
6601 gv_dup(); /* duplicate value */
6602 vrotb(3);
6603 vrotb(3);
6605 /* add constant */
6606 vpushi(c - TOK_MID);
6607 gen_op('+');
6608 vstore(); /* store value */
6609 if (post)
6610 vpop(); /* if post op, return saved value */
6613 /* Parse GNUC __attribute__ extension. Currently, the following
6614 extensions are recognized:
6615 - aligned(n) : set data/function alignment.
6616 - packed : force data alignment to 1
6617 - section(x) : generate data/code in this section.
6618 - unused : currently ignored, but may be used someday.
6619 - regparm(n) : pass function parameters in registers (i386 only)
6621 static void parse_attribute(AttributeDef *ad)
6623 int t, n;
6625 while (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) {
6626 next();
6627 skip('(');
6628 skip('(');
6629 while (tok != ')') {
6630 if (tok < TOK_IDENT)
6631 expect("attribute name");
6632 t = tok;
6633 next();
6634 switch(t) {
6635 case TOK_SECTION1:
6636 case TOK_SECTION2:
6637 skip('(');
6638 if (tok != TOK_STR)
6639 expect("section name");
6640 ad->section = find_section(tcc_state, (char *)tokc.cstr->data);
6641 next();
6642 skip(')');
6643 break;
6644 case TOK_ALIGNED1:
6645 case TOK_ALIGNED2:
6646 if (tok == '(') {
6647 next();
6648 n = expr_const();
6649 if (n <= 0 || (n & (n - 1)) != 0)
6650 error("alignment must be a positive power of two");
6651 skip(')');
6652 } else {
6653 n = MAX_ALIGN;
6655 ad->aligned = n;
6656 break;
6657 case TOK_PACKED1:
6658 case TOK_PACKED2:
6659 ad->packed = 1;
6660 break;
6661 case TOK_UNUSED1:
6662 case TOK_UNUSED2:
6663 /* currently, no need to handle it because tcc does not
6664 track unused objects */
6665 break;
6666 case TOK_NORETURN1:
6667 case TOK_NORETURN2:
6668 /* currently, no need to handle it because tcc does not
6669 track unused objects */
6670 break;
6671 case TOK_CDECL1:
6672 case TOK_CDECL2:
6673 case TOK_CDECL3:
6674 FUNC_CALL(ad->func_attr) = FUNC_CDECL;
6675 break;
6676 case TOK_STDCALL1:
6677 case TOK_STDCALL2:
6678 case TOK_STDCALL3:
6679 FUNC_CALL(ad->func_attr) = FUNC_STDCALL;
6680 break;
6681 #ifdef TCC_TARGET_I386
6682 case TOK_REGPARM1:
6683 case TOK_REGPARM2:
6684 skip('(');
6685 n = expr_const();
6686 if (n > 3)
6687 n = 3;
6688 else if (n < 0)
6689 n = 0;
6690 if (n > 0)
6691 FUNC_CALL(ad->func_attr) = FUNC_FASTCALL1 + n - 1;
6692 skip(')');
6693 break;
6694 case TOK_FASTCALL1:
6695 case TOK_FASTCALL2:
6696 case TOK_FASTCALL3:
6697 FUNC_CALL(ad->func_attr) = FUNC_FASTCALLW;
6698 break;
6699 #endif
6700 case TOK_DLLEXPORT:
6701 FUNC_EXPORT(ad->func_attr) = 1;
6702 break;
6703 default:
6704 if (tcc_state->warn_unsupported)
6705 warning("'%s' attribute ignored", get_tok_str(t, NULL));
6706 /* skip parameters */
6707 if (tok == '(') {
6708 int parenthesis = 0;
6709 do {
6710 if (tok == '(')
6711 parenthesis++;
6712 else if (tok == ')')
6713 parenthesis--;
6714 next();
6715 } while (parenthesis && tok != -1);
6717 break;
6719 if (tok != ',')
6720 break;
6721 next();
6723 skip(')');
6724 skip(')');
6728 /* enum/struct/union declaration. u is either VT_ENUM or VT_STRUCT */
6729 static void struct_decl(CType *type, int u)
6731 int a, v, size, align, maxalign, c, offset;
6732 int bit_size, bit_pos, bsize, bt, lbit_pos, prevbt;
6733 Sym *s, *ss, *ass, **ps;
6734 AttributeDef ad;
6735 CType type1, btype;
6737 a = tok; /* save decl type */
6738 next();
6739 if (tok != '{') {
6740 v = tok;
6741 next();
6742 /* struct already defined ? return it */
6743 if (v < TOK_IDENT)
6744 expect("struct/union/enum name");
6745 s = struct_find(v);
6746 if (s) {
6747 if (s->type.t != a)
6748 error("invalid type");
6749 goto do_decl;
6751 } else {
6752 v = anon_sym++;
6754 type1.t = a;
6755 /* we put an undefined size for struct/union */
6756 s = sym_push(v | SYM_STRUCT, &type1, 0, -1);
6757 s->r = 0; /* default alignment is zero as gcc */
6758 /* put struct/union/enum name in type */
6759 do_decl:
6760 type->t = u;
6761 type->ref = s;
6763 if (tok == '{') {
6764 next();
6765 if (s->c != -1)
6766 error("struct/union/enum already defined");
6767 /* cannot be empty */
6768 c = 0;
6769 /* non empty enums are not allowed */
6770 if (a == TOK_ENUM) {
6771 for(;;) {
6772 v = tok;
6773 if (v < TOK_UIDENT)
6774 expect("identifier");
6775 next();
6776 if (tok == '=') {
6777 next();
6778 c = expr_const();
6780 /* enum symbols have static storage */
6781 ss = sym_push(v, &int_type, VT_CONST, c);
6782 ss->type.t |= VT_STATIC;
6783 if (tok != ',')
6784 break;
6785 next();
6786 c++;
6787 /* NOTE: we accept a trailing comma */
6788 if (tok == '}')
6789 break;
6791 skip('}');
6792 } else {
6793 maxalign = 1;
6794 ps = &s->next;
6795 prevbt = VT_INT;
6796 bit_pos = 0;
6797 offset = 0;
6798 while (tok != '}') {
6799 parse_btype(&btype, &ad);
6800 while (1) {
6801 bit_size = -1;
6802 v = 0;
6803 type1 = btype;
6804 if (tok != ':') {
6805 type_decl(&type1, &ad, &v, TYPE_DIRECT | TYPE_ABSTRACT);
6806 if (v == 0 && (type1.t & VT_BTYPE) != VT_STRUCT)
6807 expect("identifier");
6808 if ((type1.t & VT_BTYPE) == VT_FUNC ||
6809 (type1.t & (VT_TYPEDEF | VT_STATIC | VT_EXTERN | VT_INLINE)))
6810 error("invalid type for '%s'",
6811 get_tok_str(v, NULL));
6813 if (tok == ':') {
6814 next();
6815 bit_size = expr_const();
6816 /* XXX: handle v = 0 case for messages */
6817 if (bit_size < 0)
6818 error("negative width in bit-field '%s'",
6819 get_tok_str(v, NULL));
6820 if (v && bit_size == 0)
6821 error("zero width for bit-field '%s'",
6822 get_tok_str(v, NULL));
6824 size = type_size(&type1, &align);
6825 if (ad.aligned) {
6826 if (align < ad.aligned)
6827 align = ad.aligned;
6828 } else if (ad.packed) {
6829 align = 1;
6830 } else if (*tcc_state->pack_stack_ptr) {
6831 if (align > *tcc_state->pack_stack_ptr)
6832 align = *tcc_state->pack_stack_ptr;
6834 lbit_pos = 0;
6835 if (bit_size >= 0) {
6836 bt = type1.t & VT_BTYPE;
6837 if (bt != VT_INT &&
6838 bt != VT_BYTE &&
6839 bt != VT_SHORT &&
6840 bt != VT_BOOL &&
6841 bt != VT_ENUM)
6842 error("bitfields must have scalar type");
6843 bsize = size * 8;
6844 if (bit_size > bsize) {
6845 error("width of '%s' exceeds its type",
6846 get_tok_str(v, NULL));
6847 } else if (bit_size == bsize) {
6848 /* no need for bit fields */
6849 bit_pos = 0;
6850 } else if (bit_size == 0) {
6851 /* XXX: what to do if only padding in a
6852 structure ? */
6853 /* zero size: means to pad */
6854 bit_pos = 0;
6855 } else {
6856 /* we do not have enough room ?
6857 did the type change?
6858 is it a union? */
6859 if ((bit_pos + bit_size) > bsize ||
6860 bt != prevbt || a == TOK_UNION)
6861 bit_pos = 0;
6862 lbit_pos = bit_pos;
6863 /* XXX: handle LSB first */
6864 type1.t |= VT_BITFIELD |
6865 (bit_pos << VT_STRUCT_SHIFT) |
6866 (bit_size << (VT_STRUCT_SHIFT + 6));
6867 bit_pos += bit_size;
6869 prevbt = bt;
6870 } else {
6871 bit_pos = 0;
6873 if (v != 0 || (type1.t & VT_BTYPE) == VT_STRUCT) {
6874 /* add new memory data only if starting
6875 bit field */
6876 if (lbit_pos == 0) {
6877 if (a == TOK_STRUCT) {
6878 c = (c + align - 1) & -align;
6879 offset = c;
6880 if (size > 0)
6881 c += size;
6882 } else {
6883 offset = 0;
6884 if (size > c)
6885 c = size;
6887 if (align > maxalign)
6888 maxalign = align;
6890 #if 0
6891 printf("add field %s offset=%d",
6892 get_tok_str(v, NULL), offset);
6893 if (type1.t & VT_BITFIELD) {
6894 printf(" pos=%d size=%d",
6895 (type1.t >> VT_STRUCT_SHIFT) & 0x3f,
6896 (type1.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f);
6898 printf("\n");
6899 #endif
6901 if (v == 0 && (type1.t & VT_BTYPE) == VT_STRUCT) {
6902 ass = type1.ref;
6903 while ((ass = ass->next) != NULL) {
6904 ss = sym_push(ass->v, &ass->type, 0, offset + ass->c);
6905 *ps = ss;
6906 ps = &ss->next;
6908 } else if (v) {
6909 ss = sym_push(v | SYM_FIELD, &type1, 0, offset);
6910 *ps = ss;
6911 ps = &ss->next;
6913 if (tok == ';' || tok == TOK_EOF)
6914 break;
6915 skip(',');
6917 skip(';');
6919 skip('}');
6920 /* store size and alignment */
6921 s->c = (c + maxalign - 1) & -maxalign;
6922 s->r = maxalign;
6927 /* return 0 if no type declaration. otherwise, return the basic type
6928 and skip it.
6930 static int parse_btype(CType *type, AttributeDef *ad)
6932 int t, u, type_found, typespec_found, typedef_found;
6933 Sym *s;
6934 CType type1;
6936 memset(ad, 0, sizeof(AttributeDef));
6937 type_found = 0;
6938 typespec_found = 0;
6939 typedef_found = 0;
6940 t = 0;
6941 while(1) {
6942 switch(tok) {
6943 case TOK_EXTENSION:
6944 /* currently, we really ignore extension */
6945 next();
6946 continue;
6948 /* basic types */
6949 case TOK_CHAR:
6950 u = VT_BYTE;
6951 basic_type:
6952 next();
6953 basic_type1:
6954 if ((t & VT_BTYPE) != 0)
6955 error("too many basic types");
6956 t |= u;
6957 typespec_found = 1;
6958 break;
6959 case TOK_VOID:
6960 u = VT_VOID;
6961 goto basic_type;
6962 case TOK_SHORT:
6963 u = VT_SHORT;
6964 goto basic_type;
6965 case TOK_INT:
6966 next();
6967 typespec_found = 1;
6968 break;
6969 case TOK_LONG:
6970 next();
6971 if ((t & VT_BTYPE) == VT_DOUBLE) {
6972 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
6973 } else if ((t & VT_BTYPE) == VT_LONG) {
6974 t = (t & ~VT_BTYPE) | VT_LLONG;
6975 } else {
6976 u = VT_LONG;
6977 goto basic_type1;
6979 break;
6980 case TOK_BOOL:
6981 u = VT_BOOL;
6982 goto basic_type;
6983 case TOK_FLOAT:
6984 u = VT_FLOAT;
6985 goto basic_type;
6986 case TOK_DOUBLE:
6987 next();
6988 if ((t & VT_BTYPE) == VT_LONG) {
6989 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
6990 } else {
6991 u = VT_DOUBLE;
6992 goto basic_type1;
6994 break;
6995 case TOK_ENUM:
6996 struct_decl(&type1, VT_ENUM);
6997 basic_type2:
6998 u = type1.t;
6999 type->ref = type1.ref;
7000 goto basic_type1;
7001 case TOK_STRUCT:
7002 case TOK_UNION:
7003 struct_decl(&type1, VT_STRUCT);
7004 goto basic_type2;
7006 /* type modifiers */
7007 case TOK_CONST1:
7008 case TOK_CONST2:
7009 case TOK_CONST3:
7010 t |= VT_CONSTANT;
7011 next();
7012 break;
7013 case TOK_VOLATILE1:
7014 case TOK_VOLATILE2:
7015 case TOK_VOLATILE3:
7016 t |= VT_VOLATILE;
7017 next();
7018 break;
7019 case TOK_SIGNED1:
7020 case TOK_SIGNED2:
7021 case TOK_SIGNED3:
7022 typespec_found = 1;
7023 t |= VT_SIGNED;
7024 next();
7025 break;
7026 case TOK_REGISTER:
7027 case TOK_AUTO:
7028 case TOK_RESTRICT1:
7029 case TOK_RESTRICT2:
7030 case TOK_RESTRICT3:
7031 next();
7032 break;
7033 case TOK_UNSIGNED:
7034 t |= VT_UNSIGNED;
7035 next();
7036 typespec_found = 1;
7037 break;
7039 /* storage */
7040 case TOK_EXTERN:
7041 t |= VT_EXTERN;
7042 next();
7043 break;
7044 case TOK_STATIC:
7045 t |= VT_STATIC;
7046 next();
7047 break;
7048 case TOK_TYPEDEF:
7049 t |= VT_TYPEDEF;
7050 next();
7051 break;
7052 case TOK_INLINE1:
7053 case TOK_INLINE2:
7054 case TOK_INLINE3:
7055 t |= VT_INLINE;
7056 next();
7057 break;
7059 /* GNUC attribute */
7060 case TOK_ATTRIBUTE1:
7061 case TOK_ATTRIBUTE2:
7062 parse_attribute(ad);
7063 break;
7064 /* GNUC typeof */
7065 case TOK_TYPEOF1:
7066 case TOK_TYPEOF2:
7067 case TOK_TYPEOF3:
7068 next();
7069 parse_expr_type(&type1);
7070 goto basic_type2;
7071 default:
7072 if (typespec_found || typedef_found)
7073 goto the_end;
7074 s = sym_find(tok);
7075 if (!s || !(s->type.t & VT_TYPEDEF))
7076 goto the_end;
7077 typedef_found = 1;
7078 t |= (s->type.t & ~VT_TYPEDEF);
7079 type->ref = s->type.ref;
7080 next();
7081 typespec_found = 1;
7082 break;
7084 type_found = 1;
7086 the_end:
7087 if ((t & (VT_SIGNED|VT_UNSIGNED)) == (VT_SIGNED|VT_UNSIGNED))
7088 error("signed and unsigned modifier");
7089 if (tcc_state->char_is_unsigned) {
7090 if ((t & (VT_SIGNED|VT_UNSIGNED|VT_BTYPE)) == VT_BYTE)
7091 t |= VT_UNSIGNED;
7093 t &= ~VT_SIGNED;
7095 /* long is never used as type */
7096 if ((t & VT_BTYPE) == VT_LONG)
7097 t = (t & ~VT_BTYPE) | VT_INT;
7098 type->t = t;
7099 return type_found;
7102 /* convert a function parameter type (array to pointer and function to
7103 function pointer) */
7104 static inline void convert_parameter_type(CType *pt)
7106 /* remove const and volatile qualifiers (XXX: const could be used
7107 to indicate a const function parameter */
7108 pt->t &= ~(VT_CONSTANT | VT_VOLATILE);
7109 /* array must be transformed to pointer according to ANSI C */
7110 pt->t &= ~VT_ARRAY;
7111 if ((pt->t & VT_BTYPE) == VT_FUNC) {
7112 mk_pointer(pt);
7116 static void post_type(CType *type, AttributeDef *ad)
7118 int n, l, t1, arg_size, align;
7119 Sym **plast, *s, *first;
7120 AttributeDef ad1;
7121 CType pt;
7123 if (tok == '(') {
7124 /* function declaration */
7125 next();
7126 l = 0;
7127 first = NULL;
7128 plast = &first;
7129 arg_size = 0;
7130 if (tok != ')') {
7131 for(;;) {
7132 /* read param name and compute offset */
7133 if (l != FUNC_OLD) {
7134 if (!parse_btype(&pt, &ad1)) {
7135 if (l) {
7136 error("invalid type");
7137 } else {
7138 l = FUNC_OLD;
7139 goto old_proto;
7142 l = FUNC_NEW;
7143 if ((pt.t & VT_BTYPE) == VT_VOID && tok == ')')
7144 break;
7145 type_decl(&pt, &ad1, &n, TYPE_DIRECT | TYPE_ABSTRACT);
7146 if ((pt.t & VT_BTYPE) == VT_VOID)
7147 error("parameter declared as void");
7148 arg_size += (type_size(&pt, &align) + 3) & ~3;
7149 } else {
7150 old_proto:
7151 n = tok;
7152 if (n < TOK_UIDENT)
7153 expect("identifier");
7154 pt.t = VT_INT;
7155 next();
7157 convert_parameter_type(&pt);
7158 s = sym_push(n | SYM_FIELD, &pt, 0, 0);
7159 *plast = s;
7160 plast = &s->next;
7161 if (tok == ')')
7162 break;
7163 skip(',');
7164 if (l == FUNC_NEW && tok == TOK_DOTS) {
7165 l = FUNC_ELLIPSIS;
7166 next();
7167 break;
7171 /* if no parameters, then old type prototype */
7172 if (l == 0)
7173 l = FUNC_OLD;
7174 skip(')');
7175 t1 = type->t & VT_STORAGE;
7176 /* NOTE: const is ignored in returned type as it has a special
7177 meaning in gcc / C++ */
7178 type->t &= ~(VT_STORAGE | VT_CONSTANT);
7179 post_type(type, ad);
7180 /* we push a anonymous symbol which will contain the function prototype */
7181 FUNC_ARGS(ad->func_attr) = arg_size;
7182 s = sym_push(SYM_FIELD, type, ad->func_attr, l);
7183 s->next = first;
7184 type->t = t1 | VT_FUNC;
7185 type->ref = s;
7186 } else if (tok == '[') {
7187 /* array definition */
7188 next();
7189 n = -1;
7190 if (tok != ']') {
7191 n = expr_const();
7192 if (n < 0)
7193 error("invalid array size");
7195 skip(']');
7196 /* parse next post type */
7197 t1 = type->t & VT_STORAGE;
7198 type->t &= ~VT_STORAGE;
7199 post_type(type, ad);
7201 /* we push a anonymous symbol which will contain the array
7202 element type */
7203 s = sym_push(SYM_FIELD, type, 0, n);
7204 type->t = t1 | VT_ARRAY | VT_PTR;
7205 type->ref = s;
7209 /* Parse a type declaration (except basic type), and return the type
7210 in 'type'. 'td' is a bitmask indicating which kind of type decl is
7211 expected. 'type' should contain the basic type. 'ad' is the
7212 attribute definition of the basic type. It can be modified by
7213 type_decl().
7215 static void type_decl(CType *type, AttributeDef *ad, int *v, int td)
7217 Sym *s;
7218 CType type1, *type2;
7219 int qualifiers;
7221 while (tok == '*') {
7222 qualifiers = 0;
7223 redo:
7224 next();
7225 switch(tok) {
7226 case TOK_CONST1:
7227 case TOK_CONST2:
7228 case TOK_CONST3:
7229 qualifiers |= VT_CONSTANT;
7230 goto redo;
7231 case TOK_VOLATILE1:
7232 case TOK_VOLATILE2:
7233 case TOK_VOLATILE3:
7234 qualifiers |= VT_VOLATILE;
7235 goto redo;
7236 case TOK_RESTRICT1:
7237 case TOK_RESTRICT2:
7238 case TOK_RESTRICT3:
7239 goto redo;
7241 mk_pointer(type);
7242 type->t |= qualifiers;
7245 /* XXX: clarify attribute handling */
7246 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7247 parse_attribute(ad);
7249 /* recursive type */
7250 /* XXX: incorrect if abstract type for functions (e.g. 'int ()') */
7251 type1.t = 0; /* XXX: same as int */
7252 if (tok == '(') {
7253 next();
7254 /* XXX: this is not correct to modify 'ad' at this point, but
7255 the syntax is not clear */
7256 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7257 parse_attribute(ad);
7258 type_decl(&type1, ad, v, td);
7259 skip(')');
7260 } else {
7261 /* type identifier */
7262 if (tok >= TOK_IDENT && (td & TYPE_DIRECT)) {
7263 *v = tok;
7264 next();
7265 } else {
7266 if (!(td & TYPE_ABSTRACT))
7267 expect("identifier");
7268 *v = 0;
7271 post_type(type, ad);
7272 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7273 parse_attribute(ad);
7274 if (!type1.t)
7275 return;
7276 /* append type at the end of type1 */
7277 type2 = &type1;
7278 for(;;) {
7279 s = type2->ref;
7280 type2 = &s->type;
7281 if (!type2->t) {
7282 *type2 = *type;
7283 break;
7286 *type = type1;
7289 /* compute the lvalue VT_LVAL_xxx needed to match type t. */
7290 static int lvalue_type(int t)
7292 int bt, r;
7293 r = VT_LVAL;
7294 bt = t & VT_BTYPE;
7295 if (bt == VT_BYTE || bt == VT_BOOL)
7296 r |= VT_LVAL_BYTE;
7297 else if (bt == VT_SHORT)
7298 r |= VT_LVAL_SHORT;
7299 else
7300 return r;
7301 if (t & VT_UNSIGNED)
7302 r |= VT_LVAL_UNSIGNED;
7303 return r;
7306 /* indirection with full error checking and bound check */
7307 static void indir(void)
7309 if ((vtop->type.t & VT_BTYPE) != VT_PTR) {
7310 if ((vtop->type.t & VT_BTYPE) == VT_FUNC)
7311 return;
7312 expect("pointer");
7314 if ((vtop->r & VT_LVAL) && !nocode_wanted)
7315 gv(RC_INT);
7316 vtop->type = *pointed_type(&vtop->type);
7317 /* Arrays and functions are never lvalues */
7318 if (!(vtop->type.t & VT_ARRAY)
7319 && (vtop->type.t & VT_BTYPE) != VT_FUNC) {
7320 vtop->r |= lvalue_type(vtop->type.t);
7321 /* if bound checking, the referenced pointer must be checked */
7322 if (do_bounds_check)
7323 vtop->r |= VT_MUSTBOUND;
7327 /* pass a parameter to a function and do type checking and casting */
7328 static void gfunc_param_typed(Sym *func, Sym *arg)
7330 int func_type;
7331 CType type;
7333 func_type = func->c;
7334 if (func_type == FUNC_OLD ||
7335 (func_type == FUNC_ELLIPSIS && arg == NULL)) {
7336 /* default casting : only need to convert float to double */
7337 if ((vtop->type.t & VT_BTYPE) == VT_FLOAT) {
7338 type.t = VT_DOUBLE;
7339 gen_cast(&type);
7341 } else if (arg == NULL) {
7342 error("too many arguments to function");
7343 } else {
7344 type = arg->type;
7345 type.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
7346 gen_assign_cast(&type);
7350 /* parse an expression of the form '(type)' or '(expr)' and return its
7351 type */
7352 static void parse_expr_type(CType *type)
7354 int n;
7355 AttributeDef ad;
7357 skip('(');
7358 if (parse_btype(type, &ad)) {
7359 type_decl(type, &ad, &n, TYPE_ABSTRACT);
7360 } else {
7361 expr_type(type);
7363 skip(')');
7366 static void parse_type(CType *type)
7368 AttributeDef ad;
7369 int n;
7371 if (!parse_btype(type, &ad)) {
7372 expect("type");
7374 type_decl(type, &ad, &n, TYPE_ABSTRACT);
7377 static void vpush_tokc(int t)
7379 CType type;
7380 type.t = t;
7381 vsetc(&type, VT_CONST, &tokc);
7384 static void unary(void)
7386 int n, t, align, size, r;
7387 CType type;
7388 Sym *s;
7389 AttributeDef ad;
7391 /* XXX: GCC 2.95.3 does not generate a table although it should be
7392 better here */
7393 tok_next:
7394 switch(tok) {
7395 case TOK_EXTENSION:
7396 next();
7397 goto tok_next;
7398 case TOK_CINT:
7399 case TOK_CCHAR:
7400 case TOK_LCHAR:
7401 vpushi(tokc.i);
7402 next();
7403 break;
7404 case TOK_CUINT:
7405 vpush_tokc(VT_INT | VT_UNSIGNED);
7406 next();
7407 break;
7408 case TOK_CLLONG:
7409 vpush_tokc(VT_LLONG);
7410 next();
7411 break;
7412 case TOK_CULLONG:
7413 vpush_tokc(VT_LLONG | VT_UNSIGNED);
7414 next();
7415 break;
7416 case TOK_CFLOAT:
7417 vpush_tokc(VT_FLOAT);
7418 next();
7419 break;
7420 case TOK_CDOUBLE:
7421 vpush_tokc(VT_DOUBLE);
7422 next();
7423 break;
7424 case TOK_CLDOUBLE:
7425 vpush_tokc(VT_LDOUBLE);
7426 next();
7427 break;
7428 case TOK___FUNCTION__:
7429 if (!gnu_ext)
7430 goto tok_identifier;
7431 /* fall thru */
7432 case TOK___FUNC__:
7434 void *ptr;
7435 int len;
7436 /* special function name identifier */
7437 len = strlen(funcname) + 1;
7438 /* generate char[len] type */
7439 type.t = VT_BYTE;
7440 mk_pointer(&type);
7441 type.t |= VT_ARRAY;
7442 type.ref->c = len;
7443 vpush_ref(&type, data_section, data_section->data_offset, len);
7444 ptr = section_ptr_add(data_section, len);
7445 memcpy(ptr, funcname, len);
7446 next();
7448 break;
7449 case TOK_LSTR:
7450 #ifdef TCC_TARGET_PE
7451 t = VT_SHORT | VT_UNSIGNED;
7452 #else
7453 t = VT_INT;
7454 #endif
7455 goto str_init;
7456 case TOK_STR:
7457 /* string parsing */
7458 t = VT_BYTE;
7459 str_init:
7460 if (tcc_state->warn_write_strings)
7461 t |= VT_CONSTANT;
7462 type.t = t;
7463 mk_pointer(&type);
7464 type.t |= VT_ARRAY;
7465 memset(&ad, 0, sizeof(AttributeDef));
7466 decl_initializer_alloc(&type, &ad, VT_CONST, 2, 0, 0);
7467 break;
7468 case '(':
7469 next();
7470 /* cast ? */
7471 if (parse_btype(&type, &ad)) {
7472 type_decl(&type, &ad, &n, TYPE_ABSTRACT);
7473 skip(')');
7474 /* check ISOC99 compound literal */
7475 if (tok == '{') {
7476 /* data is allocated locally by default */
7477 if (global_expr)
7478 r = VT_CONST;
7479 else
7480 r = VT_LOCAL;
7481 /* all except arrays are lvalues */
7482 if (!(type.t & VT_ARRAY))
7483 r |= lvalue_type(type.t);
7484 memset(&ad, 0, sizeof(AttributeDef));
7485 decl_initializer_alloc(&type, &ad, r, 1, 0, 0);
7486 } else {
7487 unary();
7488 gen_cast(&type);
7490 } else if (tok == '{') {
7491 /* save all registers */
7492 save_regs(0);
7493 /* statement expression : we do not accept break/continue
7494 inside as GCC does */
7495 block(NULL, NULL, NULL, NULL, 0, 1);
7496 skip(')');
7497 } else {
7498 gexpr();
7499 skip(')');
7501 break;
7502 case '*':
7503 next();
7504 unary();
7505 indir();
7506 break;
7507 case '&':
7508 next();
7509 unary();
7510 /* functions names must be treated as function pointers,
7511 except for unary '&' and sizeof. Since we consider that
7512 functions are not lvalues, we only have to handle it
7513 there and in function calls. */
7514 /* arrays can also be used although they are not lvalues */
7515 if ((vtop->type.t & VT_BTYPE) != VT_FUNC &&
7516 !(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_LLOCAL))
7517 test_lvalue();
7518 mk_pointer(&vtop->type);
7519 gaddrof();
7520 break;
7521 case '!':
7522 next();
7523 unary();
7524 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
7525 CType boolean;
7526 boolean.t = VT_BOOL;
7527 gen_cast(&boolean);
7528 vtop->c.i = !vtop->c.i;
7529 } else if ((vtop->r & VT_VALMASK) == VT_CMP)
7530 vtop->c.i = vtop->c.i ^ 1;
7531 else {
7532 save_regs(1);
7533 vseti(VT_JMP, gtst(1, 0));
7535 break;
7536 case '~':
7537 next();
7538 unary();
7539 vpushi(-1);
7540 gen_op('^');
7541 break;
7542 case '+':
7543 next();
7544 /* in order to force cast, we add zero */
7545 unary();
7546 if ((vtop->type.t & VT_BTYPE) == VT_PTR)
7547 error("pointer not accepted for unary plus");
7548 vpushi(0);
7549 gen_op('+');
7550 break;
7551 case TOK_SIZEOF:
7552 case TOK_ALIGNOF1:
7553 case TOK_ALIGNOF2:
7554 t = tok;
7555 next();
7556 if (tok == '(') {
7557 parse_expr_type(&type);
7558 } else {
7559 unary_type(&type);
7561 size = type_size(&type, &align);
7562 if (t == TOK_SIZEOF) {
7563 if (size < 0)
7564 error("sizeof applied to an incomplete type");
7565 vpushi(size);
7566 } else {
7567 vpushi(align);
7569 vtop->type.t |= VT_UNSIGNED;
7570 break;
7572 case TOK_builtin_types_compatible_p:
7574 CType type1, type2;
7575 next();
7576 skip('(');
7577 parse_type(&type1);
7578 skip(',');
7579 parse_type(&type2);
7580 skip(')');
7581 type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
7582 type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
7583 vpushi(is_compatible_types(&type1, &type2));
7585 break;
7586 case TOK_builtin_constant_p:
7588 int saved_nocode_wanted, res;
7589 next();
7590 skip('(');
7591 saved_nocode_wanted = nocode_wanted;
7592 nocode_wanted = 1;
7593 gexpr();
7594 res = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
7595 vpop();
7596 nocode_wanted = saved_nocode_wanted;
7597 skip(')');
7598 vpushi(res);
7600 break;
7601 case TOK_INC:
7602 case TOK_DEC:
7603 t = tok;
7604 next();
7605 unary();
7606 inc(0, t);
7607 break;
7608 case '-':
7609 next();
7610 vpushi(0);
7611 unary();
7612 gen_op('-');
7613 break;
7614 case TOK_LAND:
7615 if (!gnu_ext)
7616 goto tok_identifier;
7617 next();
7618 /* allow to take the address of a label */
7619 if (tok < TOK_UIDENT)
7620 expect("label identifier");
7621 s = label_find(tok);
7622 if (!s) {
7623 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
7624 } else {
7625 if (s->r == LABEL_DECLARED)
7626 s->r = LABEL_FORWARD;
7628 if (!s->type.t) {
7629 s->type.t = VT_VOID;
7630 mk_pointer(&s->type);
7631 s->type.t |= VT_STATIC;
7633 vset(&s->type, VT_CONST | VT_SYM, 0);
7634 vtop->sym = s;
7635 next();
7636 break;
7637 default:
7638 tok_identifier:
7639 t = tok;
7640 next();
7641 if (t < TOK_UIDENT)
7642 expect("identifier");
7643 s = sym_find(t);
7644 if (!s) {
7645 if (tok != '(')
7646 error("'%s' undeclared", get_tok_str(t, NULL));
7647 /* for simple function calls, we tolerate undeclared
7648 external reference to int() function */
7649 if (tcc_state->warn_implicit_function_declaration)
7650 warning("implicit declaration of function '%s'",
7651 get_tok_str(t, NULL));
7652 s = external_global_sym(t, &func_old_type, 0);
7654 if ((s->type.t & (VT_STATIC | VT_INLINE | VT_BTYPE)) ==
7655 (VT_STATIC | VT_INLINE | VT_FUNC)) {
7656 /* if referencing an inline function, then we generate a
7657 symbol to it if not already done. It will have the
7658 effect to generate code for it at the end of the
7659 compilation unit. Inline function as always
7660 generated in the text section. */
7661 if (!s->c)
7662 put_extern_sym(s, text_section, 0, 0);
7663 r = VT_SYM | VT_CONST;
7664 } else {
7665 r = s->r;
7667 vset(&s->type, r, s->c);
7668 /* if forward reference, we must point to s */
7669 if (vtop->r & VT_SYM) {
7670 vtop->sym = s;
7671 vtop->c.ul = 0;
7673 break;
7676 /* post operations */
7677 while (1) {
7678 if (tok == TOK_INC || tok == TOK_DEC) {
7679 inc(1, tok);
7680 next();
7681 } else if (tok == '.' || tok == TOK_ARROW) {
7682 /* field */
7683 if (tok == TOK_ARROW)
7684 indir();
7685 test_lvalue();
7686 gaddrof();
7687 next();
7688 /* expect pointer on structure */
7689 if ((vtop->type.t & VT_BTYPE) != VT_STRUCT)
7690 expect("struct or union");
7691 s = vtop->type.ref;
7692 /* find field */
7693 tok |= SYM_FIELD;
7694 while ((s = s->next) != NULL) {
7695 if (s->v == tok)
7696 break;
7698 if (!s)
7699 error("field not found: %s", get_tok_str(tok & ~SYM_FIELD, NULL));
7700 /* add field offset to pointer */
7701 vtop->type = char_pointer_type; /* change type to 'char *' */
7702 vpushi(s->c);
7703 gen_op('+');
7704 /* change type to field type, and set to lvalue */
7705 vtop->type = s->type;
7706 /* an array is never an lvalue */
7707 if (!(vtop->type.t & VT_ARRAY)) {
7708 vtop->r |= lvalue_type(vtop->type.t);
7709 /* if bound checking, the referenced pointer must be checked */
7710 if (do_bounds_check)
7711 vtop->r |= VT_MUSTBOUND;
7713 next();
7714 } else if (tok == '[') {
7715 next();
7716 gexpr();
7717 gen_op('+');
7718 indir();
7719 skip(']');
7720 } else if (tok == '(') {
7721 SValue ret;
7722 Sym *sa;
7723 int nb_args;
7725 /* function call */
7726 if ((vtop->type.t & VT_BTYPE) != VT_FUNC) {
7727 /* pointer test (no array accepted) */
7728 if ((vtop->type.t & (VT_BTYPE | VT_ARRAY)) == VT_PTR) {
7729 vtop->type = *pointed_type(&vtop->type);
7730 if ((vtop->type.t & VT_BTYPE) != VT_FUNC)
7731 goto error_func;
7732 } else {
7733 error_func:
7734 expect("function pointer");
7736 } else {
7737 vtop->r &= ~VT_LVAL; /* no lvalue */
7739 /* get return type */
7740 s = vtop->type.ref;
7741 next();
7742 sa = s->next; /* first parameter */
7743 nb_args = 0;
7744 ret.r2 = VT_CONST;
7745 /* compute first implicit argument if a structure is returned */
7746 if ((s->type.t & VT_BTYPE) == VT_STRUCT) {
7747 /* get some space for the returned structure */
7748 size = type_size(&s->type, &align);
7749 loc = (loc - size) & -align;
7750 ret.type = s->type;
7751 ret.r = VT_LOCAL | VT_LVAL;
7752 /* pass it as 'int' to avoid structure arg passing
7753 problems */
7754 vseti(VT_LOCAL, loc);
7755 ret.c = vtop->c;
7756 nb_args++;
7757 } else {
7758 ret.type = s->type;
7759 /* return in register */
7760 if (is_float(ret.type.t)) {
7761 ret.r = REG_FRET;
7762 } else {
7763 if ((ret.type.t & VT_BTYPE) == VT_LLONG)
7764 ret.r2 = REG_LRET;
7765 ret.r = REG_IRET;
7767 ret.c.i = 0;
7769 if (tok != ')') {
7770 for(;;) {
7771 expr_eq();
7772 gfunc_param_typed(s, sa);
7773 nb_args++;
7774 if (sa)
7775 sa = sa->next;
7776 if (tok == ')')
7777 break;
7778 skip(',');
7781 if (sa)
7782 error("too few arguments to function");
7783 skip(')');
7784 if (!nocode_wanted) {
7785 gfunc_call(nb_args);
7786 } else {
7787 vtop -= (nb_args + 1);
7789 /* return value */
7790 vsetc(&ret.type, ret.r, &ret.c);
7791 vtop->r2 = ret.r2;
7792 } else {
7793 break;
7798 static void uneq(void)
7800 int t;
7802 unary();
7803 if (tok == '=' ||
7804 (tok >= TOK_A_MOD && tok <= TOK_A_DIV) ||
7805 tok == TOK_A_XOR || tok == TOK_A_OR ||
7806 tok == TOK_A_SHL || tok == TOK_A_SAR) {
7807 test_lvalue();
7808 t = tok;
7809 next();
7810 if (t == '=') {
7811 expr_eq();
7812 } else {
7813 vdup();
7814 expr_eq();
7815 gen_op(t & 0x7f);
7817 vstore();
7821 static void expr_prod(void)
7823 int t;
7825 uneq();
7826 while (tok == '*' || tok == '/' || tok == '%') {
7827 t = tok;
7828 next();
7829 uneq();
7830 gen_op(t);
7834 static void expr_sum(void)
7836 int t;
7838 expr_prod();
7839 while (tok == '+' || tok == '-') {
7840 t = tok;
7841 next();
7842 expr_prod();
7843 gen_op(t);
7847 static void expr_shift(void)
7849 int t;
7851 expr_sum();
7852 while (tok == TOK_SHL || tok == TOK_SAR) {
7853 t = tok;
7854 next();
7855 expr_sum();
7856 gen_op(t);
7860 static void expr_cmp(void)
7862 int t;
7864 expr_shift();
7865 while ((tok >= TOK_ULE && tok <= TOK_GT) ||
7866 tok == TOK_ULT || tok == TOK_UGE) {
7867 t = tok;
7868 next();
7869 expr_shift();
7870 gen_op(t);
7874 static void expr_cmpeq(void)
7876 int t;
7878 expr_cmp();
7879 while (tok == TOK_EQ || tok == TOK_NE) {
7880 t = tok;
7881 next();
7882 expr_cmp();
7883 gen_op(t);
7887 static void expr_and(void)
7889 expr_cmpeq();
7890 while (tok == '&') {
7891 next();
7892 expr_cmpeq();
7893 gen_op('&');
7897 static void expr_xor(void)
7899 expr_and();
7900 while (tok == '^') {
7901 next();
7902 expr_and();
7903 gen_op('^');
7907 static void expr_or(void)
7909 expr_xor();
7910 while (tok == '|') {
7911 next();
7912 expr_xor();
7913 gen_op('|');
7917 /* XXX: fix this mess */
7918 static void expr_land_const(void)
7920 expr_or();
7921 while (tok == TOK_LAND) {
7922 next();
7923 expr_or();
7924 gen_op(TOK_LAND);
7928 /* XXX: fix this mess */
7929 static void expr_lor_const(void)
7931 expr_land_const();
7932 while (tok == TOK_LOR) {
7933 next();
7934 expr_land_const();
7935 gen_op(TOK_LOR);
7939 /* only used if non constant */
7940 static void expr_land(void)
7942 int t;
7944 expr_or();
7945 if (tok == TOK_LAND) {
7946 t = 0;
7947 save_regs(1);
7948 for(;;) {
7949 t = gtst(1, t);
7950 if (tok != TOK_LAND) {
7951 vseti(VT_JMPI, t);
7952 break;
7954 next();
7955 expr_or();
7960 static void expr_lor(void)
7962 int t;
7964 expr_land();
7965 if (tok == TOK_LOR) {
7966 t = 0;
7967 save_regs(1);
7968 for(;;) {
7969 t = gtst(0, t);
7970 if (tok != TOK_LOR) {
7971 vseti(VT_JMP, t);
7972 break;
7974 next();
7975 expr_land();
7980 /* XXX: better constant handling */
7981 static void expr_eq(void)
7983 int tt, u, r1, r2, rc, t1, t2, bt1, bt2;
7984 SValue sv;
7985 CType type, type1, type2;
7987 if (const_wanted) {
7988 expr_lor_const();
7989 if (tok == '?') {
7990 CType boolean;
7991 int c;
7992 boolean.t = VT_BOOL;
7993 vdup();
7994 gen_cast(&boolean);
7995 c = vtop->c.i;
7996 vpop();
7997 next();
7998 if (tok != ':' || !gnu_ext) {
7999 vpop();
8000 gexpr();
8002 if (!c)
8003 vpop();
8004 skip(':');
8005 expr_eq();
8006 if (c)
8007 vpop();
8009 } else {
8010 expr_lor();
8011 if (tok == '?') {
8012 next();
8013 if (vtop != vstack) {
8014 /* needed to avoid having different registers saved in
8015 each branch */
8016 if (is_float(vtop->type.t))
8017 rc = RC_FLOAT;
8018 else
8019 rc = RC_INT;
8020 gv(rc);
8021 save_regs(1);
8023 if (tok == ':' && gnu_ext) {
8024 gv_dup();
8025 tt = gtst(1, 0);
8026 } else {
8027 tt = gtst(1, 0);
8028 gexpr();
8030 type1 = vtop->type;
8031 sv = *vtop; /* save value to handle it later */
8032 vtop--; /* no vpop so that FP stack is not flushed */
8033 skip(':');
8034 u = gjmp(0);
8035 gsym(tt);
8036 expr_eq();
8037 type2 = vtop->type;
8039 t1 = type1.t;
8040 bt1 = t1 & VT_BTYPE;
8041 t2 = type2.t;
8042 bt2 = t2 & VT_BTYPE;
8043 /* cast operands to correct type according to ISOC rules */
8044 if (is_float(bt1) || is_float(bt2)) {
8045 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
8046 type.t = VT_LDOUBLE;
8047 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
8048 type.t = VT_DOUBLE;
8049 } else {
8050 type.t = VT_FLOAT;
8052 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
8053 /* cast to biggest op */
8054 type.t = VT_LLONG;
8055 /* convert to unsigned if it does not fit in a long long */
8056 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
8057 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
8058 type.t |= VT_UNSIGNED;
8059 } else if (bt1 == VT_PTR || bt2 == VT_PTR) {
8060 /* XXX: test pointer compatibility */
8061 type = type1;
8062 } else if (bt1 == VT_FUNC || bt2 == VT_FUNC) {
8063 /* XXX: test function pointer compatibility */
8064 type = type1;
8065 } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) {
8066 /* XXX: test structure compatibility */
8067 type = type1;
8068 } else if (bt1 == VT_VOID || bt2 == VT_VOID) {
8069 /* NOTE: as an extension, we accept void on only one side */
8070 type.t = VT_VOID;
8071 } else {
8072 /* integer operations */
8073 type.t = VT_INT;
8074 /* convert to unsigned if it does not fit in an integer */
8075 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
8076 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
8077 type.t |= VT_UNSIGNED;
8080 /* now we convert second operand */
8081 gen_cast(&type);
8082 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
8083 gaddrof();
8084 rc = RC_INT;
8085 if (is_float(type.t)) {
8086 rc = RC_FLOAT;
8087 } else if ((type.t & VT_BTYPE) == VT_LLONG) {
8088 /* for long longs, we use fixed registers to avoid having
8089 to handle a complicated move */
8090 rc = RC_IRET;
8093 r2 = gv(rc);
8094 /* this is horrible, but we must also convert first
8095 operand */
8096 tt = gjmp(0);
8097 gsym(u);
8098 /* put again first value and cast it */
8099 *vtop = sv;
8100 gen_cast(&type);
8101 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
8102 gaddrof();
8103 r1 = gv(rc);
8104 move_reg(r2, r1);
8105 vtop->r = r2;
8106 gsym(tt);
8111 static void gexpr(void)
8113 while (1) {
8114 expr_eq();
8115 if (tok != ',')
8116 break;
8117 vpop();
8118 next();
8122 /* parse an expression and return its type without any side effect. */
8123 static void expr_type(CType *type)
8125 int saved_nocode_wanted;
8127 saved_nocode_wanted = nocode_wanted;
8128 nocode_wanted = 1;
8129 gexpr();
8130 *type = vtop->type;
8131 vpop();
8132 nocode_wanted = saved_nocode_wanted;
8135 /* parse a unary expression and return its type without any side
8136 effect. */
8137 static void unary_type(CType *type)
8139 int a;
8141 a = nocode_wanted;
8142 nocode_wanted = 1;
8143 unary();
8144 *type = vtop->type;
8145 vpop();
8146 nocode_wanted = a;
8149 /* parse a constant expression and return value in vtop. */
8150 static void expr_const1(void)
8152 int a;
8153 a = const_wanted;
8154 const_wanted = 1;
8155 expr_eq();
8156 const_wanted = a;
8159 /* parse an integer constant and return its value. */
8160 static int expr_const(void)
8162 int c;
8163 expr_const1();
8164 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
8165 expect("constant expression");
8166 c = vtop->c.i;
8167 vpop();
8168 return c;
8171 /* return the label token if current token is a label, otherwise
8172 return zero */
8173 static int is_label(void)
8175 int last_tok;
8177 /* fast test first */
8178 if (tok < TOK_UIDENT)
8179 return 0;
8180 /* no need to save tokc because tok is an identifier */
8181 last_tok = tok;
8182 next();
8183 if (tok == ':') {
8184 next();
8185 return last_tok;
8186 } else {
8187 unget_tok(last_tok);
8188 return 0;
8192 static void block(int *bsym, int *csym, int *case_sym, int *def_sym,
8193 int case_reg, int is_expr)
8195 int a, b, c, d;
8196 Sym *s;
8198 /* generate line number info */
8199 if (do_debug &&
8200 (last_line_num != file->line_num || last_ind != ind)) {
8201 put_stabn(N_SLINE, 0, file->line_num, ind - func_ind);
8202 last_ind = ind;
8203 last_line_num = file->line_num;
8206 if (is_expr) {
8207 /* default return value is (void) */
8208 vpushi(0);
8209 vtop->type.t = VT_VOID;
8212 if (tok == TOK_IF) {
8213 /* if test */
8214 next();
8215 skip('(');
8216 gexpr();
8217 skip(')');
8218 a = gtst(1, 0);
8219 block(bsym, csym, case_sym, def_sym, case_reg, 0);
8220 c = tok;
8221 if (c == TOK_ELSE) {
8222 next();
8223 d = gjmp(0);
8224 gsym(a);
8225 block(bsym, csym, case_sym, def_sym, case_reg, 0);
8226 gsym(d); /* patch else jmp */
8227 } else
8228 gsym(a);
8229 } else if (tok == TOK_WHILE) {
8230 next();
8231 d = ind;
8232 skip('(');
8233 gexpr();
8234 skip(')');
8235 a = gtst(1, 0);
8236 b = 0;
8237 block(&a, &b, case_sym, def_sym, case_reg, 0);
8238 gjmp_addr(d);
8239 gsym(a);
8240 gsym_addr(b, d);
8241 } else if (tok == '{') {
8242 Sym *llabel;
8244 next();
8245 /* record local declaration stack position */
8246 s = local_stack;
8247 llabel = local_label_stack;
8248 /* handle local labels declarations */
8249 if (tok == TOK_LABEL) {
8250 next();
8251 for(;;) {
8252 if (tok < TOK_UIDENT)
8253 expect("label identifier");
8254 label_push(&local_label_stack, tok, LABEL_DECLARED);
8255 next();
8256 if (tok == ',') {
8257 next();
8258 } else {
8259 skip(';');
8260 break;
8264 while (tok != '}') {
8265 decl(VT_LOCAL);
8266 if (tok != '}') {
8267 if (is_expr)
8268 vpop();
8269 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
8272 /* pop locally defined labels */
8273 label_pop(&local_label_stack, llabel);
8274 /* pop locally defined symbols */
8275 if(is_expr) {
8276 /* XXX: this solution makes only valgrind happy...
8277 triggered by gcc.c-torture/execute/20000917-1.c */
8278 Sym *p;
8279 switch(vtop->type.t & VT_BTYPE) {
8280 case VT_PTR:
8281 case VT_STRUCT:
8282 case VT_ENUM:
8283 case VT_FUNC:
8284 for(p=vtop->type.ref;p;p=p->prev)
8285 if(p->prev==s)
8286 error("unsupported expression type");
8289 sym_pop(&local_stack, s);
8290 next();
8291 } else if (tok == TOK_RETURN) {
8292 next();
8293 if (tok != ';') {
8294 gexpr();
8295 gen_assign_cast(&func_vt);
8296 if ((func_vt.t & VT_BTYPE) == VT_STRUCT) {
8297 CType type;
8298 /* if returning structure, must copy it to implicit
8299 first pointer arg location */
8300 #ifdef TCC_ARM_EABI
8301 int align, size;
8302 size = type_size(&func_vt,&align);
8303 if(size <= 4)
8305 if((vtop->r != (VT_LOCAL | VT_LVAL) || (vtop->c.i & 3))
8306 && (align & 3))
8308 int addr;
8309 loc = (loc - size) & -4;
8310 addr = loc;
8311 type = func_vt;
8312 vset(&type, VT_LOCAL | VT_LVAL, addr);
8313 vswap();
8314 vstore();
8315 vset(&int_type, VT_LOCAL | VT_LVAL, addr);
8317 vtop->type = int_type;
8318 gv(RC_IRET);
8319 } else {
8320 #endif
8321 type = func_vt;
8322 mk_pointer(&type);
8323 vset(&type, VT_LOCAL | VT_LVAL, func_vc);
8324 indir();
8325 vswap();
8326 /* copy structure value to pointer */
8327 vstore();
8328 #ifdef TCC_ARM_EABI
8330 #endif
8331 } else if (is_float(func_vt.t)) {
8332 gv(RC_FRET);
8333 } else {
8334 gv(RC_IRET);
8336 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
8338 skip(';');
8339 rsym = gjmp(rsym); /* jmp */
8340 } else if (tok == TOK_BREAK) {
8341 /* compute jump */
8342 if (!bsym)
8343 error("cannot break");
8344 *bsym = gjmp(*bsym);
8345 next();
8346 skip(';');
8347 } else if (tok == TOK_CONTINUE) {
8348 /* compute jump */
8349 if (!csym)
8350 error("cannot continue");
8351 *csym = gjmp(*csym);
8352 next();
8353 skip(';');
8354 } else if (tok == TOK_FOR) {
8355 int e;
8356 next();
8357 skip('(');
8358 if (tok != ';') {
8359 gexpr();
8360 vpop();
8362 skip(';');
8363 d = ind;
8364 c = ind;
8365 a = 0;
8366 b = 0;
8367 if (tok != ';') {
8368 gexpr();
8369 a = gtst(1, 0);
8371 skip(';');
8372 if (tok != ')') {
8373 e = gjmp(0);
8374 c = ind;
8375 gexpr();
8376 vpop();
8377 gjmp_addr(d);
8378 gsym(e);
8380 skip(')');
8381 block(&a, &b, case_sym, def_sym, case_reg, 0);
8382 gjmp_addr(c);
8383 gsym(a);
8384 gsym_addr(b, c);
8385 } else
8386 if (tok == TOK_DO) {
8387 next();
8388 a = 0;
8389 b = 0;
8390 d = ind;
8391 block(&a, &b, case_sym, def_sym, case_reg, 0);
8392 skip(TOK_WHILE);
8393 skip('(');
8394 gsym(b);
8395 gexpr();
8396 c = gtst(0, 0);
8397 gsym_addr(c, d);
8398 skip(')');
8399 gsym(a);
8400 skip(';');
8401 } else
8402 if (tok == TOK_SWITCH) {
8403 next();
8404 skip('(');
8405 gexpr();
8406 /* XXX: other types than integer */
8407 case_reg = gv(RC_INT);
8408 vpop();
8409 skip(')');
8410 a = 0;
8411 b = gjmp(0); /* jump to first case */
8412 c = 0;
8413 block(&a, csym, &b, &c, case_reg, 0);
8414 /* if no default, jmp after switch */
8415 if (c == 0)
8416 c = ind;
8417 /* default label */
8418 gsym_addr(b, c);
8419 /* break label */
8420 gsym(a);
8421 } else
8422 if (tok == TOK_CASE) {
8423 int v1, v2;
8424 if (!case_sym)
8425 expect("switch");
8426 next();
8427 v1 = expr_const();
8428 v2 = v1;
8429 if (gnu_ext && tok == TOK_DOTS) {
8430 next();
8431 v2 = expr_const();
8432 if (v2 < v1)
8433 warning("empty case range");
8435 /* since a case is like a label, we must skip it with a jmp */
8436 b = gjmp(0);
8437 gsym(*case_sym);
8438 vseti(case_reg, 0);
8439 vpushi(v1);
8440 if (v1 == v2) {
8441 gen_op(TOK_EQ);
8442 *case_sym = gtst(1, 0);
8443 } else {
8444 gen_op(TOK_GE);
8445 *case_sym = gtst(1, 0);
8446 vseti(case_reg, 0);
8447 vpushi(v2);
8448 gen_op(TOK_LE);
8449 *case_sym = gtst(1, *case_sym);
8451 gsym(b);
8452 skip(':');
8453 is_expr = 0;
8454 goto block_after_label;
8455 } else
8456 if (tok == TOK_DEFAULT) {
8457 next();
8458 skip(':');
8459 if (!def_sym)
8460 expect("switch");
8461 if (*def_sym)
8462 error("too many 'default'");
8463 *def_sym = ind;
8464 is_expr = 0;
8465 goto block_after_label;
8466 } else
8467 if (tok == TOK_GOTO) {
8468 next();
8469 if (tok == '*' && gnu_ext) {
8470 /* computed goto */
8471 next();
8472 gexpr();
8473 if ((vtop->type.t & VT_BTYPE) != VT_PTR)
8474 expect("pointer");
8475 ggoto();
8476 } else if (tok >= TOK_UIDENT) {
8477 s = label_find(tok);
8478 /* put forward definition if needed */
8479 if (!s) {
8480 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
8481 } else {
8482 if (s->r == LABEL_DECLARED)
8483 s->r = LABEL_FORWARD;
8485 /* label already defined */
8486 if (s->r & LABEL_FORWARD)
8487 s->next = (void *)gjmp((long)s->next);
8488 else
8489 gjmp_addr((long)s->next);
8490 next();
8491 } else {
8492 expect("label identifier");
8494 skip(';');
8495 } else if (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3) {
8496 asm_instr();
8497 } else {
8498 b = is_label();
8499 if (b) {
8500 /* label case */
8501 s = label_find(b);
8502 if (s) {
8503 if (s->r == LABEL_DEFINED)
8504 error("duplicate label '%s'", get_tok_str(s->v, NULL));
8505 gsym((long)s->next);
8506 s->r = LABEL_DEFINED;
8507 } else {
8508 s = label_push(&global_label_stack, b, LABEL_DEFINED);
8510 s->next = (void *)ind;
8511 /* we accept this, but it is a mistake */
8512 block_after_label:
8513 if (tok == '}') {
8514 warning("deprecated use of label at end of compound statement");
8515 } else {
8516 if (is_expr)
8517 vpop();
8518 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
8520 } else {
8521 /* expression case */
8522 if (tok != ';') {
8523 if (is_expr) {
8524 vpop();
8525 gexpr();
8526 } else {
8527 gexpr();
8528 vpop();
8531 skip(';');
8536 /* t is the array or struct type. c is the array or struct
8537 address. cur_index/cur_field is the pointer to the current
8538 value. 'size_only' is true if only size info is needed (only used
8539 in arrays) */
8540 static void decl_designator(CType *type, Section *sec, unsigned long c,
8541 int *cur_index, Sym **cur_field,
8542 int size_only)
8544 Sym *s, *f;
8545 int notfirst, index, index_last, align, l, nb_elems, elem_size;
8546 CType type1;
8548 notfirst = 0;
8549 elem_size = 0;
8550 nb_elems = 1;
8551 if (gnu_ext && (l = is_label()) != 0)
8552 goto struct_field;
8553 while (tok == '[' || tok == '.') {
8554 if (tok == '[') {
8555 if (!(type->t & VT_ARRAY))
8556 expect("array type");
8557 s = type->ref;
8558 next();
8559 index = expr_const();
8560 if (index < 0 || (s->c >= 0 && index >= s->c))
8561 expect("invalid index");
8562 if (tok == TOK_DOTS && gnu_ext) {
8563 next();
8564 index_last = expr_const();
8565 if (index_last < 0 ||
8566 (s->c >= 0 && index_last >= s->c) ||
8567 index_last < index)
8568 expect("invalid index");
8569 } else {
8570 index_last = index;
8572 skip(']');
8573 if (!notfirst)
8574 *cur_index = index_last;
8575 type = pointed_type(type);
8576 elem_size = type_size(type, &align);
8577 c += index * elem_size;
8578 /* NOTE: we only support ranges for last designator */
8579 nb_elems = index_last - index + 1;
8580 if (nb_elems != 1) {
8581 notfirst = 1;
8582 break;
8584 } else {
8585 next();
8586 l = tok;
8587 next();
8588 struct_field:
8589 if ((type->t & VT_BTYPE) != VT_STRUCT)
8590 expect("struct/union type");
8591 s = type->ref;
8592 l |= SYM_FIELD;
8593 f = s->next;
8594 while (f) {
8595 if (f->v == l)
8596 break;
8597 f = f->next;
8599 if (!f)
8600 expect("field");
8601 if (!notfirst)
8602 *cur_field = f;
8603 /* XXX: fix this mess by using explicit storage field */
8604 type1 = f->type;
8605 type1.t |= (type->t & ~VT_TYPE);
8606 type = &type1;
8607 c += f->c;
8609 notfirst = 1;
8611 if (notfirst) {
8612 if (tok == '=') {
8613 next();
8614 } else {
8615 if (!gnu_ext)
8616 expect("=");
8618 } else {
8619 if (type->t & VT_ARRAY) {
8620 index = *cur_index;
8621 type = pointed_type(type);
8622 c += index * type_size(type, &align);
8623 } else {
8624 f = *cur_field;
8625 if (!f)
8626 error("too many field init");
8627 /* XXX: fix this mess by using explicit storage field */
8628 type1 = f->type;
8629 type1.t |= (type->t & ~VT_TYPE);
8630 type = &type1;
8631 c += f->c;
8634 decl_initializer(type, sec, c, 0, size_only);
8636 /* XXX: make it more general */
8637 if (!size_only && nb_elems > 1) {
8638 unsigned long c_end;
8639 uint8_t *src, *dst;
8640 int i;
8642 if (!sec)
8643 error("range init not supported yet for dynamic storage");
8644 c_end = c + nb_elems * elem_size;
8645 if (c_end > sec->data_allocated)
8646 section_realloc(sec, c_end);
8647 src = sec->data + c;
8648 dst = src;
8649 for(i = 1; i < nb_elems; i++) {
8650 dst += elem_size;
8651 memcpy(dst, src, elem_size);
8656 #define EXPR_VAL 0
8657 #define EXPR_CONST 1
8658 #define EXPR_ANY 2
8660 /* store a value or an expression directly in global data or in local array */
8661 static void init_putv(CType *type, Section *sec, unsigned long c,
8662 int v, int expr_type)
8664 int saved_global_expr, bt, bit_pos, bit_size;
8665 void *ptr;
8666 unsigned long long bit_mask;
8667 CType dtype;
8669 switch(expr_type) {
8670 case EXPR_VAL:
8671 vpushi(v);
8672 break;
8673 case EXPR_CONST:
8674 /* compound literals must be allocated globally in this case */
8675 saved_global_expr = global_expr;
8676 global_expr = 1;
8677 expr_const1();
8678 global_expr = saved_global_expr;
8679 /* NOTE: symbols are accepted */
8680 if ((vtop->r & (VT_VALMASK | VT_LVAL)) != VT_CONST)
8681 error("initializer element is not constant");
8682 break;
8683 case EXPR_ANY:
8684 expr_eq();
8685 break;
8688 dtype = *type;
8689 dtype.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
8691 if (sec) {
8692 /* XXX: not portable */
8693 /* XXX: generate error if incorrect relocation */
8694 gen_assign_cast(&dtype);
8695 bt = type->t & VT_BTYPE;
8696 ptr = sec->data + c;
8697 /* XXX: make code faster ? */
8698 if (!(type->t & VT_BITFIELD)) {
8699 bit_pos = 0;
8700 bit_size = 32;
8701 bit_mask = -1LL;
8702 } else {
8703 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
8704 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
8705 bit_mask = (1LL << bit_size) - 1;
8707 if ((vtop->r & VT_SYM) &&
8708 (bt == VT_BYTE ||
8709 bt == VT_SHORT ||
8710 bt == VT_DOUBLE ||
8711 bt == VT_LDOUBLE ||
8712 bt == VT_LLONG ||
8713 (bt == VT_INT && bit_size != 32)))
8714 error("initializer element is not computable at load time");
8715 switch(bt) {
8716 case VT_BOOL:
8717 vtop->c.i = (vtop->c.i != 0);
8718 case VT_BYTE:
8719 *(char *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8720 break;
8721 case VT_SHORT:
8722 *(short *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8723 break;
8724 case VT_DOUBLE:
8725 *(double *)ptr = vtop->c.d;
8726 break;
8727 case VT_LDOUBLE:
8728 *(long double *)ptr = vtop->c.ld;
8729 break;
8730 case VT_LLONG:
8731 *(long long *)ptr |= (vtop->c.ll & bit_mask) << bit_pos;
8732 break;
8733 default:
8734 if (vtop->r & VT_SYM) {
8735 greloc(sec, vtop->sym, c, R_DATA_32);
8737 *(int *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8738 break;
8740 vtop--;
8741 } else {
8742 vset(&dtype, VT_LOCAL|VT_LVAL, c);
8743 vswap();
8744 vstore();
8745 vpop();
8749 /* put zeros for variable based init */
8750 static void init_putz(CType *t, Section *sec, unsigned long c, int size)
8752 if (sec) {
8753 /* nothing to do because globals are already set to zero */
8754 } else {
8755 vpush_global_sym(&func_old_type, TOK_memset);
8756 vseti(VT_LOCAL, c);
8757 vpushi(0);
8758 vpushi(size);
8759 gfunc_call(3);
8763 /* 't' contains the type and storage info. 'c' is the offset of the
8764 object in section 'sec'. If 'sec' is NULL, it means stack based
8765 allocation. 'first' is true if array '{' must be read (multi
8766 dimension implicit array init handling). 'size_only' is true if
8767 size only evaluation is wanted (only for arrays). */
8768 static void decl_initializer(CType *type, Section *sec, unsigned long c,
8769 int first, int size_only)
8771 int index, array_length, n, no_oblock, nb, parlevel, i;
8772 int size1, align1, expr_type;
8773 Sym *s, *f;
8774 CType *t1;
8776 if (type->t & VT_ARRAY) {
8777 s = type->ref;
8778 n = s->c;
8779 array_length = 0;
8780 t1 = pointed_type(type);
8781 size1 = type_size(t1, &align1);
8783 no_oblock = 1;
8784 if ((first && tok != TOK_LSTR && tok != TOK_STR) ||
8785 tok == '{') {
8786 skip('{');
8787 no_oblock = 0;
8790 /* only parse strings here if correct type (otherwise: handle
8791 them as ((w)char *) expressions */
8792 if ((tok == TOK_LSTR &&
8793 #ifdef TCC_TARGET_PE
8794 (t1->t & VT_BTYPE) == VT_SHORT && (t1->t & VT_UNSIGNED)
8795 #else
8796 (t1->t & VT_BTYPE) == VT_INT
8797 #endif
8798 ) || (tok == TOK_STR && (t1->t & VT_BTYPE) == VT_BYTE)) {
8799 while (tok == TOK_STR || tok == TOK_LSTR) {
8800 int cstr_len, ch;
8801 CString *cstr;
8803 cstr = tokc.cstr;
8804 /* compute maximum number of chars wanted */
8805 if (tok == TOK_STR)
8806 cstr_len = cstr->size;
8807 else
8808 cstr_len = cstr->size / sizeof(nwchar_t);
8809 cstr_len--;
8810 nb = cstr_len;
8811 if (n >= 0 && nb > (n - array_length))
8812 nb = n - array_length;
8813 if (!size_only) {
8814 if (cstr_len > nb)
8815 warning("initializer-string for array is too long");
8816 /* in order to go faster for common case (char
8817 string in global variable, we handle it
8818 specifically */
8819 if (sec && tok == TOK_STR && size1 == 1) {
8820 memcpy(sec->data + c + array_length, cstr->data, nb);
8821 } else {
8822 for(i=0;i<nb;i++) {
8823 if (tok == TOK_STR)
8824 ch = ((unsigned char *)cstr->data)[i];
8825 else
8826 ch = ((nwchar_t *)cstr->data)[i];
8827 init_putv(t1, sec, c + (array_length + i) * size1,
8828 ch, EXPR_VAL);
8832 array_length += nb;
8833 next();
8835 /* only add trailing zero if enough storage (no
8836 warning in this case since it is standard) */
8837 if (n < 0 || array_length < n) {
8838 if (!size_only) {
8839 init_putv(t1, sec, c + (array_length * size1), 0, EXPR_VAL);
8841 array_length++;
8843 } else {
8844 index = 0;
8845 while (tok != '}') {
8846 decl_designator(type, sec, c, &index, NULL, size_only);
8847 if (n >= 0 && index >= n)
8848 error("index too large");
8849 /* must put zero in holes (note that doing it that way
8850 ensures that it even works with designators) */
8851 if (!size_only && array_length < index) {
8852 init_putz(t1, sec, c + array_length * size1,
8853 (index - array_length) * size1);
8855 index++;
8856 if (index > array_length)
8857 array_length = index;
8858 /* special test for multi dimensional arrays (may not
8859 be strictly correct if designators are used at the
8860 same time) */
8861 if (index >= n && no_oblock)
8862 break;
8863 if (tok == '}')
8864 break;
8865 skip(',');
8868 if (!no_oblock)
8869 skip('}');
8870 /* put zeros at the end */
8871 if (!size_only && n >= 0 && array_length < n) {
8872 init_putz(t1, sec, c + array_length * size1,
8873 (n - array_length) * size1);
8875 /* patch type size if needed */
8876 if (n < 0)
8877 s->c = array_length;
8878 } else if ((type->t & VT_BTYPE) == VT_STRUCT &&
8879 (sec || !first || tok == '{')) {
8880 int par_count;
8882 /* NOTE: the previous test is a specific case for automatic
8883 struct/union init */
8884 /* XXX: union needs only one init */
8886 /* XXX: this test is incorrect for local initializers
8887 beginning with ( without {. It would be much more difficult
8888 to do it correctly (ideally, the expression parser should
8889 be used in all cases) */
8890 par_count = 0;
8891 if (tok == '(') {
8892 AttributeDef ad1;
8893 CType type1;
8894 next();
8895 while (tok == '(') {
8896 par_count++;
8897 next();
8899 if (!parse_btype(&type1, &ad1))
8900 expect("cast");
8901 type_decl(&type1, &ad1, &n, TYPE_ABSTRACT);
8902 #if 0
8903 if (!is_assignable_types(type, &type1))
8904 error("invalid type for cast");
8905 #endif
8906 skip(')');
8908 no_oblock = 1;
8909 if (first || tok == '{') {
8910 skip('{');
8911 no_oblock = 0;
8913 s = type->ref;
8914 f = s->next;
8915 array_length = 0;
8916 index = 0;
8917 n = s->c;
8918 while (tok != '}') {
8919 decl_designator(type, sec, c, NULL, &f, size_only);
8920 index = f->c;
8921 if (!size_only && array_length < index) {
8922 init_putz(type, sec, c + array_length,
8923 index - array_length);
8925 index = index + type_size(&f->type, &align1);
8926 if (index > array_length)
8927 array_length = index;
8928 f = f->next;
8929 if (no_oblock && f == NULL)
8930 break;
8931 if (tok == '}')
8932 break;
8933 skip(',');
8935 /* put zeros at the end */
8936 if (!size_only && array_length < n) {
8937 init_putz(type, sec, c + array_length,
8938 n - array_length);
8940 if (!no_oblock)
8941 skip('}');
8942 while (par_count) {
8943 skip(')');
8944 par_count--;
8946 } else if (tok == '{') {
8947 next();
8948 decl_initializer(type, sec, c, first, size_only);
8949 skip('}');
8950 } else if (size_only) {
8951 /* just skip expression */
8952 parlevel = 0;
8953 while ((parlevel > 0 || (tok != '}' && tok != ',')) &&
8954 tok != -1) {
8955 if (tok == '(')
8956 parlevel++;
8957 else if (tok == ')')
8958 parlevel--;
8959 next();
8961 } else {
8962 /* currently, we always use constant expression for globals
8963 (may change for scripting case) */
8964 expr_type = EXPR_CONST;
8965 if (!sec)
8966 expr_type = EXPR_ANY;
8967 init_putv(type, sec, c, 0, expr_type);
8971 /* parse an initializer for type 't' if 'has_init' is non zero, and
8972 allocate space in local or global data space ('r' is either
8973 VT_LOCAL or VT_CONST). If 'v' is non zero, then an associated
8974 variable 'v' of scope 'scope' is declared before initializers are
8975 parsed. If 'v' is zero, then a reference to the new object is put
8976 in the value stack. If 'has_init' is 2, a special parsing is done
8977 to handle string constants. */
8978 static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r,
8979 int has_init, int v, int scope)
8981 int size, align, addr, data_offset;
8982 int level;
8983 ParseState saved_parse_state;
8984 TokenString init_str;
8985 Section *sec;
8987 size = type_size(type, &align);
8988 /* If unknown size, we must evaluate it before
8989 evaluating initializers because
8990 initializers can generate global data too
8991 (e.g. string pointers or ISOC99 compound
8992 literals). It also simplifies local
8993 initializers handling */
8994 tok_str_new(&init_str);
8995 if (size < 0) {
8996 if (!has_init)
8997 error("unknown type size");
8998 /* get all init string */
8999 if (has_init == 2) {
9000 /* only get strings */
9001 while (tok == TOK_STR || tok == TOK_LSTR) {
9002 tok_str_add_tok(&init_str);
9003 next();
9005 } else {
9006 level = 0;
9007 while (level > 0 || (tok != ',' && tok != ';')) {
9008 if (tok < 0)
9009 error("unexpected end of file in initializer");
9010 tok_str_add_tok(&init_str);
9011 if (tok == '{')
9012 level++;
9013 else if (tok == '}') {
9014 if (level == 0)
9015 break;
9016 level--;
9018 next();
9021 tok_str_add(&init_str, -1);
9022 tok_str_add(&init_str, 0);
9024 /* compute size */
9025 save_parse_state(&saved_parse_state);
9027 macro_ptr = init_str.str;
9028 next();
9029 decl_initializer(type, NULL, 0, 1, 1);
9030 /* prepare second initializer parsing */
9031 macro_ptr = init_str.str;
9032 next();
9034 /* if still unknown size, error */
9035 size = type_size(type, &align);
9036 if (size < 0)
9037 error("unknown type size");
9039 /* take into account specified alignment if bigger */
9040 if (ad->aligned) {
9041 if (ad->aligned > align)
9042 align = ad->aligned;
9043 } else if (ad->packed) {
9044 align = 1;
9046 if ((r & VT_VALMASK) == VT_LOCAL) {
9047 sec = NULL;
9048 if (do_bounds_check && (type->t & VT_ARRAY))
9049 loc--;
9050 loc = (loc - size) & -align;
9051 addr = loc;
9052 /* handles bounds */
9053 /* XXX: currently, since we do only one pass, we cannot track
9054 '&' operators, so we add only arrays */
9055 if (do_bounds_check && (type->t & VT_ARRAY)) {
9056 unsigned long *bounds_ptr;
9057 /* add padding between regions */
9058 loc--;
9059 /* then add local bound info */
9060 bounds_ptr = section_ptr_add(lbounds_section, 2 * sizeof(unsigned long));
9061 bounds_ptr[0] = addr;
9062 bounds_ptr[1] = size;
9064 if (v) {
9065 /* local variable */
9066 sym_push(v, type, r, addr);
9067 } else {
9068 /* push local reference */
9069 vset(type, r, addr);
9071 } else {
9072 Sym *sym;
9074 sym = NULL;
9075 if (v && scope == VT_CONST) {
9076 /* see if the symbol was already defined */
9077 sym = sym_find(v);
9078 if (sym) {
9079 if (!is_compatible_types(&sym->type, type))
9080 error("incompatible types for redefinition of '%s'",
9081 get_tok_str(v, NULL));
9082 if (sym->type.t & VT_EXTERN) {
9083 /* if the variable is extern, it was not allocated */
9084 sym->type.t &= ~VT_EXTERN;
9085 /* set array size if it was ommited in extern
9086 declaration */
9087 if ((sym->type.t & VT_ARRAY) &&
9088 sym->type.ref->c < 0 &&
9089 type->ref->c >= 0)
9090 sym->type.ref->c = type->ref->c;
9091 } else {
9092 /* we accept several definitions of the same
9093 global variable. this is tricky, because we
9094 must play with the SHN_COMMON type of the symbol */
9095 /* XXX: should check if the variable was already
9096 initialized. It is incorrect to initialized it
9097 twice */
9098 /* no init data, we won't add more to the symbol */
9099 if (!has_init)
9100 goto no_alloc;
9105 /* allocate symbol in corresponding section */
9106 sec = ad->section;
9107 if (!sec) {
9108 if (has_init)
9109 sec = data_section;
9110 else if (tcc_state->nocommon)
9111 sec = bss_section;
9113 if (sec) {
9114 data_offset = sec->data_offset;
9115 data_offset = (data_offset + align - 1) & -align;
9116 addr = data_offset;
9117 /* very important to increment global pointer at this time
9118 because initializers themselves can create new initializers */
9119 data_offset += size;
9120 /* add padding if bound check */
9121 if (do_bounds_check)
9122 data_offset++;
9123 sec->data_offset = data_offset;
9124 /* allocate section space to put the data */
9125 if (sec->sh_type != SHT_NOBITS &&
9126 data_offset > sec->data_allocated)
9127 section_realloc(sec, data_offset);
9128 /* align section if needed */
9129 if (align > sec->sh_addralign)
9130 sec->sh_addralign = align;
9131 } else {
9132 addr = 0; /* avoid warning */
9135 if (v) {
9136 if (scope != VT_CONST || !sym) {
9137 sym = sym_push(v, type, r | VT_SYM, 0);
9139 /* update symbol definition */
9140 if (sec) {
9141 put_extern_sym(sym, sec, addr, size);
9142 } else {
9143 Elf32_Sym *esym;
9144 /* put a common area */
9145 put_extern_sym(sym, NULL, align, size);
9146 /* XXX: find a nicer way */
9147 esym = &((Elf32_Sym *)symtab_section->data)[sym->c];
9148 esym->st_shndx = SHN_COMMON;
9150 } else {
9151 CValue cval;
9153 /* push global reference */
9154 sym = get_sym_ref(type, sec, addr, size);
9155 cval.ul = 0;
9156 vsetc(type, VT_CONST | VT_SYM, &cval);
9157 vtop->sym = sym;
9160 /* handles bounds now because the symbol must be defined
9161 before for the relocation */
9162 if (do_bounds_check) {
9163 unsigned long *bounds_ptr;
9165 greloc(bounds_section, sym, bounds_section->data_offset, R_DATA_32);
9166 /* then add global bound info */
9167 bounds_ptr = section_ptr_add(bounds_section, 2 * sizeof(long));
9168 bounds_ptr[0] = 0; /* relocated */
9169 bounds_ptr[1] = size;
9172 if (has_init) {
9173 decl_initializer(type, sec, addr, 1, 0);
9174 /* restore parse state if needed */
9175 if (init_str.str) {
9176 tok_str_free(init_str.str);
9177 restore_parse_state(&saved_parse_state);
9180 no_alloc: ;
9183 void put_func_debug(Sym *sym)
9185 char buf[512];
9187 /* stabs info */
9188 /* XXX: we put here a dummy type */
9189 snprintf(buf, sizeof(buf), "%s:%c1",
9190 funcname, sym->type.t & VT_STATIC ? 'f' : 'F');
9191 put_stabs_r(buf, N_FUN, 0, file->line_num, 0,
9192 cur_text_section, sym->c);
9193 /* //gr gdb wants a line at the function */
9194 put_stabn(N_SLINE, 0, file->line_num, 0);
9195 last_ind = 0;
9196 last_line_num = 0;
9199 /* parse an old style function declaration list */
9200 /* XXX: check multiple parameter */
9201 static void func_decl_list(Sym *func_sym)
9203 AttributeDef ad;
9204 int v;
9205 Sym *s;
9206 CType btype, type;
9208 /* parse each declaration */
9209 while (tok != '{' && tok != ';' && tok != ',' && tok != TOK_EOF) {
9210 if (!parse_btype(&btype, &ad))
9211 expect("declaration list");
9212 if (((btype.t & VT_BTYPE) == VT_ENUM ||
9213 (btype.t & VT_BTYPE) == VT_STRUCT) &&
9214 tok == ';') {
9215 /* we accept no variable after */
9216 } else {
9217 for(;;) {
9218 type = btype;
9219 type_decl(&type, &ad, &v, TYPE_DIRECT);
9220 /* find parameter in function parameter list */
9221 s = func_sym->next;
9222 while (s != NULL) {
9223 if ((s->v & ~SYM_FIELD) == v)
9224 goto found;
9225 s = s->next;
9227 error("declaration for parameter '%s' but no such parameter",
9228 get_tok_str(v, NULL));
9229 found:
9230 /* check that no storage specifier except 'register' was given */
9231 if (type.t & VT_STORAGE)
9232 error("storage class specified for '%s'", get_tok_str(v, NULL));
9233 convert_parameter_type(&type);
9234 /* we can add the type (NOTE: it could be local to the function) */
9235 s->type = type;
9236 /* accept other parameters */
9237 if (tok == ',')
9238 next();
9239 else
9240 break;
9243 skip(';');
9247 /* parse a function defined by symbol 'sym' and generate its code in
9248 'cur_text_section' */
9249 static void gen_function(Sym *sym)
9251 int saved_nocode_wanted = nocode_wanted;
9252 nocode_wanted = 0;
9253 ind = cur_text_section->data_offset;
9254 /* NOTE: we patch the symbol size later */
9255 put_extern_sym(sym, cur_text_section, ind, 0);
9256 funcname = get_tok_str(sym->v, NULL);
9257 func_ind = ind;
9258 /* put debug symbol */
9259 if (do_debug)
9260 put_func_debug(sym);
9261 /* push a dummy symbol to enable local sym storage */
9262 sym_push2(&local_stack, SYM_FIELD, 0, 0);
9263 gfunc_prolog(&sym->type);
9264 rsym = 0;
9265 block(NULL, NULL, NULL, NULL, 0, 0);
9266 gsym(rsym);
9267 gfunc_epilog();
9268 cur_text_section->data_offset = ind;
9269 label_pop(&global_label_stack, NULL);
9270 sym_pop(&local_stack, NULL); /* reset local stack */
9271 /* end of function */
9272 /* patch symbol size */
9273 ((Elf32_Sym *)symtab_section->data)[sym->c].st_size =
9274 ind - func_ind;
9275 if (do_debug) {
9276 put_stabn(N_FUN, 0, 0, ind - func_ind);
9278 /* It's better to crash than to generate wrong code */
9279 cur_text_section = NULL;
9280 funcname = ""; /* for safety */
9281 func_vt.t = VT_VOID; /* for safety */
9282 ind = 0; /* for safety */
9283 nocode_wanted = saved_nocode_wanted;
9286 static void gen_inline_functions(void)
9288 Sym *sym;
9289 CType *type;
9290 int *str, inline_generated;
9292 /* iterate while inline function are referenced */
9293 for(;;) {
9294 inline_generated = 0;
9295 for(sym = global_stack; sym != NULL; sym = sym->prev) {
9296 type = &sym->type;
9297 if (((type->t & VT_BTYPE) == VT_FUNC) &&
9298 (type->t & (VT_STATIC | VT_INLINE)) ==
9299 (VT_STATIC | VT_INLINE) &&
9300 sym->c != 0) {
9301 /* the function was used: generate its code and
9302 convert it to a normal function */
9303 str = INLINE_DEF(sym->r);
9304 sym->r = VT_SYM | VT_CONST;
9305 sym->type.t &= ~VT_INLINE;
9307 macro_ptr = str;
9308 next();
9309 cur_text_section = text_section;
9310 gen_function(sym);
9311 macro_ptr = NULL; /* fail safe */
9313 tok_str_free(str);
9314 inline_generated = 1;
9317 if (!inline_generated)
9318 break;
9321 /* free all remaining inline function tokens */
9322 for(sym = global_stack; sym != NULL; sym = sym->prev) {
9323 type = &sym->type;
9324 if (((type->t & VT_BTYPE) == VT_FUNC) &&
9325 (type->t & (VT_STATIC | VT_INLINE)) ==
9326 (VT_STATIC | VT_INLINE)) {
9327 //gr printf("sym %d %s\n", sym->r, get_tok_str(sym->v, NULL));
9328 if (sym->r == (VT_SYM | VT_CONST)) //gr beware!
9329 continue;
9330 str = INLINE_DEF(sym->r);
9331 tok_str_free(str);
9332 sym->r = 0; /* fail safe */
9337 /* 'l' is VT_LOCAL or VT_CONST to define default storage type */
9338 static void decl(int l)
9340 int v, has_init, r;
9341 CType type, btype;
9342 Sym *sym;
9343 AttributeDef ad;
9345 while (1) {
9346 if (!parse_btype(&btype, &ad)) {
9347 /* skip redundant ';' */
9348 /* XXX: find more elegant solution */
9349 if (tok == ';') {
9350 next();
9351 continue;
9353 if (l == VT_CONST &&
9354 (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
9355 /* global asm block */
9356 asm_global_instr();
9357 continue;
9359 /* special test for old K&R protos without explicit int
9360 type. Only accepted when defining global data */
9361 if (l == VT_LOCAL || tok < TOK_DEFINE)
9362 break;
9363 btype.t = VT_INT;
9365 if (((btype.t & VT_BTYPE) == VT_ENUM ||
9366 (btype.t & VT_BTYPE) == VT_STRUCT) &&
9367 tok == ';') {
9368 /* we accept no variable after */
9369 next();
9370 continue;
9372 while (1) { /* iterate thru each declaration */
9373 type = btype;
9374 type_decl(&type, &ad, &v, TYPE_DIRECT);
9375 #if 0
9377 char buf[500];
9378 type_to_str(buf, sizeof(buf), t, get_tok_str(v, NULL));
9379 printf("type = '%s'\n", buf);
9381 #endif
9382 if ((type.t & VT_BTYPE) == VT_FUNC) {
9383 /* if old style function prototype, we accept a
9384 declaration list */
9385 sym = type.ref;
9386 if (sym->c == FUNC_OLD)
9387 func_decl_list(sym);
9390 if (tok == '{') {
9391 if (l == VT_LOCAL)
9392 error("cannot use local functions");
9393 if ((type.t & VT_BTYPE) != VT_FUNC)
9394 expect("function definition");
9396 /* reject abstract declarators in function definition */
9397 sym = type.ref;
9398 while ((sym = sym->next) != NULL)
9399 if (!(sym->v & ~SYM_FIELD))
9400 expect("identifier");
9402 /* XXX: cannot do better now: convert extern line to static inline */
9403 if ((type.t & (VT_EXTERN | VT_INLINE)) == (VT_EXTERN | VT_INLINE))
9404 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
9406 sym = sym_find(v);
9407 if (sym) {
9408 if ((sym->type.t & VT_BTYPE) != VT_FUNC)
9409 goto func_error1;
9410 /* specific case: if not func_call defined, we put
9411 the one of the prototype */
9412 /* XXX: should have default value */
9413 r = sym->type.ref->r;
9414 if (FUNC_CALL(r) != FUNC_CDECL
9415 && FUNC_CALL(type.ref->r) == FUNC_CDECL)
9416 FUNC_CALL(type.ref->r) = FUNC_CALL(r);
9417 if (FUNC_EXPORT(r))
9418 FUNC_EXPORT(type.ref->r) = 1;
9420 if (!is_compatible_types(&sym->type, &type)) {
9421 func_error1:
9422 error("incompatible types for redefinition of '%s'",
9423 get_tok_str(v, NULL));
9425 /* if symbol is already defined, then put complete type */
9426 sym->type = type;
9427 } else {
9428 /* put function symbol */
9429 sym = global_identifier_push(v, type.t, 0);
9430 sym->type.ref = type.ref;
9433 /* static inline functions are just recorded as a kind
9434 of macro. Their code will be emitted at the end of
9435 the compilation unit only if they are used */
9436 if ((type.t & (VT_INLINE | VT_STATIC)) ==
9437 (VT_INLINE | VT_STATIC)) {
9438 TokenString func_str;
9439 int block_level;
9441 tok_str_new(&func_str);
9443 block_level = 0;
9444 for(;;) {
9445 int t;
9446 if (tok == TOK_EOF)
9447 error("unexpected end of file");
9448 tok_str_add_tok(&func_str);
9449 t = tok;
9450 next();
9451 if (t == '{') {
9452 block_level++;
9453 } else if (t == '}') {
9454 block_level--;
9455 if (block_level == 0)
9456 break;
9459 tok_str_add(&func_str, -1);
9460 tok_str_add(&func_str, 0);
9461 INLINE_DEF(sym->r) = func_str.str;
9462 } else {
9463 /* compute text section */
9464 cur_text_section = ad.section;
9465 if (!cur_text_section)
9466 cur_text_section = text_section;
9467 sym->r = VT_SYM | VT_CONST;
9468 gen_function(sym);
9470 break;
9471 } else {
9472 if (btype.t & VT_TYPEDEF) {
9473 /* save typedefed type */
9474 /* XXX: test storage specifiers ? */
9475 sym = sym_push(v, &type, 0, 0);
9476 sym->type.t |= VT_TYPEDEF;
9477 } else if ((type.t & VT_BTYPE) == VT_FUNC) {
9478 /* external function definition */
9479 /* specific case for func_call attribute */
9480 if (ad.func_attr)
9481 type.ref->r = ad.func_attr;
9482 external_sym(v, &type, 0);
9483 } else {
9484 /* not lvalue if array */
9485 r = 0;
9486 if (!(type.t & VT_ARRAY))
9487 r |= lvalue_type(type.t);
9488 has_init = (tok == '=');
9489 if ((btype.t & VT_EXTERN) ||
9490 ((type.t & VT_ARRAY) && (type.t & VT_STATIC) &&
9491 !has_init && l == VT_CONST && type.ref->c < 0)) {
9492 /* external variable */
9493 /* NOTE: as GCC, uninitialized global static
9494 arrays of null size are considered as
9495 extern */
9496 external_sym(v, &type, r);
9497 } else {
9498 type.t |= (btype.t & VT_STATIC); /* Retain "static". */
9499 if (type.t & VT_STATIC)
9500 r |= VT_CONST;
9501 else
9502 r |= l;
9503 if (has_init)
9504 next();
9505 decl_initializer_alloc(&type, &ad, r,
9506 has_init, v, l);
9509 if (tok != ',') {
9510 skip(';');
9511 break;
9513 next();
9519 /* better than nothing, but needs extension to handle '-E' option
9520 correctly too */
9521 static void preprocess_init(TCCState *s1)
9523 s1->include_stack_ptr = s1->include_stack;
9524 /* XXX: move that before to avoid having to initialize
9525 file->ifdef_stack_ptr ? */
9526 s1->ifdef_stack_ptr = s1->ifdef_stack;
9527 file->ifdef_stack_ptr = s1->ifdef_stack_ptr;
9529 /* XXX: not ANSI compliant: bound checking says error */
9530 vtop = vstack - 1;
9531 s1->pack_stack[0] = 0;
9532 s1->pack_stack_ptr = s1->pack_stack;
9535 /* compile the C file opened in 'file'. Return non zero if errors. */
9536 static int tcc_compile(TCCState *s1)
9538 Sym *define_start;
9539 char buf[512];
9540 volatile int section_sym;
9542 #ifdef INC_DEBUG
9543 printf("%s: **** new file\n", file->filename);
9544 #endif
9545 preprocess_init(s1);
9547 cur_text_section = NULL;
9548 funcname = "";
9549 anon_sym = SYM_FIRST_ANOM;
9551 /* file info: full path + filename */
9552 section_sym = 0; /* avoid warning */
9553 if (do_debug) {
9554 section_sym = put_elf_sym(symtab_section, 0, 0,
9555 ELF32_ST_INFO(STB_LOCAL, STT_SECTION), 0,
9556 text_section->sh_num, NULL);
9557 getcwd(buf, sizeof(buf));
9558 #ifdef _WIN32
9559 normalize_slashes(buf);
9560 #endif
9561 pstrcat(buf, sizeof(buf), "/");
9562 put_stabs_r(buf, N_SO, 0, 0,
9563 text_section->data_offset, text_section, section_sym);
9564 put_stabs_r(file->filename, N_SO, 0, 0,
9565 text_section->data_offset, text_section, section_sym);
9567 /* an elf symbol of type STT_FILE must be put so that STB_LOCAL
9568 symbols can be safely used */
9569 put_elf_sym(symtab_section, 0, 0,
9570 ELF32_ST_INFO(STB_LOCAL, STT_FILE), 0,
9571 SHN_ABS, file->filename);
9573 /* define some often used types */
9574 int_type.t = VT_INT;
9576 char_pointer_type.t = VT_BYTE;
9577 mk_pointer(&char_pointer_type);
9579 func_old_type.t = VT_FUNC;
9580 func_old_type.ref = sym_push(SYM_FIELD, &int_type, FUNC_CDECL, FUNC_OLD);
9582 #if defined(TCC_ARM_EABI) && defined(TCC_ARM_VFP)
9583 float_type.t = VT_FLOAT;
9584 double_type.t = VT_DOUBLE;
9586 func_float_type.t = VT_FUNC;
9587 func_float_type.ref = sym_push(SYM_FIELD, &float_type, FUNC_CDECL, FUNC_OLD);
9588 func_double_type.t = VT_FUNC;
9589 func_double_type.ref = sym_push(SYM_FIELD, &double_type, FUNC_CDECL, FUNC_OLD);
9590 #endif
9592 #if 0
9593 /* define 'void *alloca(unsigned int)' builtin function */
9595 Sym *s1;
9597 p = anon_sym++;
9598 sym = sym_push(p, mk_pointer(VT_VOID), FUNC_CDECL, FUNC_NEW);
9599 s1 = sym_push(SYM_FIELD, VT_UNSIGNED | VT_INT, 0, 0);
9600 s1->next = NULL;
9601 sym->next = s1;
9602 sym_push(TOK_alloca, VT_FUNC | (p << VT_STRUCT_SHIFT), VT_CONST, 0);
9604 #endif
9606 define_start = define_stack;
9607 nocode_wanted = 1;
9609 if (setjmp(s1->error_jmp_buf) == 0) {
9610 s1->nb_errors = 0;
9611 s1->error_set_jmp_enabled = 1;
9613 ch = file->buf_ptr[0];
9614 tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF;
9615 parse_flags = PARSE_FLAG_PREPROCESS | PARSE_FLAG_TOK_NUM;
9616 next();
9617 decl(VT_CONST);
9618 if (tok != TOK_EOF)
9619 expect("declaration");
9621 /* end of translation unit info */
9622 if (do_debug) {
9623 put_stabs_r(NULL, N_SO, 0, 0,
9624 text_section->data_offset, text_section, section_sym);
9627 s1->error_set_jmp_enabled = 0;
9629 /* reset define stack, but leave -Dsymbols (may be incorrect if
9630 they are undefined) */
9631 free_defines(define_start);
9633 gen_inline_functions();
9635 sym_pop(&global_stack, NULL);
9636 sym_pop(&local_stack, NULL);
9638 return s1->nb_errors != 0 ? -1 : 0;
9641 /* Preprocess the current file */
9642 /* XXX: add line and file infos, add options to preserve spaces */
9643 static int tcc_preprocess(TCCState *s1)
9645 Sym *define_start;
9646 int last_is_space;
9648 preprocess_init(s1);
9650 define_start = define_stack;
9652 ch = file->buf_ptr[0];
9653 tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF;
9654 parse_flags = PARSE_FLAG_ASM_COMMENTS | PARSE_FLAG_PREPROCESS |
9655 PARSE_FLAG_LINEFEED;
9656 last_is_space = 1;
9657 next();
9658 for(;;) {
9659 if (tok == TOK_EOF) {
9660 break;
9661 } else if (tok == TOK_LINEFEED) {
9662 last_is_space = 1;
9663 } else {
9664 if (!last_is_space)
9665 fputc(' ', s1->outfile);
9666 last_is_space = 0;
9668 fputs(get_tok_str(tok, &tokc), s1->outfile);
9669 next();
9671 free_defines(define_start);
9672 return 0;
9675 #ifdef LIBTCC
9676 int tcc_compile_string(TCCState *s, const char *str)
9678 BufferedFile bf1, *bf = &bf1;
9679 int ret, len;
9680 char *buf;
9682 /* init file structure */
9683 bf->fd = -1;
9684 /* XXX: avoid copying */
9685 len = strlen(str);
9686 buf = tcc_malloc(len + 1);
9687 if (!buf)
9688 return -1;
9689 memcpy(buf, str, len);
9690 buf[len] = CH_EOB;
9691 bf->buf_ptr = buf;
9692 bf->buf_end = buf + len;
9693 pstrcpy(bf->filename, sizeof(bf->filename), "<string>");
9694 bf->line_num = 1;
9695 file = bf;
9696 ret = tcc_compile(s);
9697 file = NULL;
9698 tcc_free(buf);
9700 /* currently, no need to close */
9701 return ret;
9703 #endif
9705 /* define a preprocessor symbol. A value can also be provided with the '=' operator */
9706 void tcc_define_symbol(TCCState *s1, const char *sym, const char *value)
9708 BufferedFile bf1, *bf = &bf1;
9710 pstrcpy(bf->buffer, IO_BUF_SIZE, sym);
9711 pstrcat(bf->buffer, IO_BUF_SIZE, " ");
9712 /* default value */
9713 if (!value)
9714 value = "1";
9715 pstrcat(bf->buffer, IO_BUF_SIZE, value);
9717 /* init file structure */
9718 bf->fd = -1;
9719 bf->buf_ptr = bf->buffer;
9720 bf->buf_end = bf->buffer + strlen(bf->buffer);
9721 *bf->buf_end = CH_EOB;
9722 bf->filename[0] = '\0';
9723 bf->line_num = 1;
9724 file = bf;
9726 s1->include_stack_ptr = s1->include_stack;
9728 /* parse with define parser */
9729 ch = file->buf_ptr[0];
9730 next_nomacro();
9731 parse_define();
9732 file = NULL;
9735 /* undefine a preprocessor symbol */
9736 void tcc_undefine_symbol(TCCState *s1, const char *sym)
9738 TokenSym *ts;
9739 Sym *s;
9740 ts = tok_alloc(sym, strlen(sym));
9741 s = define_find(ts->tok);
9742 /* undefine symbol by putting an invalid name */
9743 if (s)
9744 define_undef(s);
9747 #ifdef CONFIG_TCC_ASM
9749 #ifdef TCC_TARGET_I386
9750 #include "i386-asm.c"
9751 #endif
9752 #include "tccasm.c"
9754 #else
9755 static void asm_instr(void)
9757 error("inline asm() not supported");
9759 static void asm_global_instr(void)
9761 error("inline asm() not supported");
9763 #endif
9765 #include "tccelf.c"
9767 #ifdef TCC_TARGET_COFF
9768 #include "tcccoff.c"
9769 #endif
9771 #ifdef TCC_TARGET_PE
9772 #include "tccpe.c"
9773 #endif
9775 /* print the position in the source file of PC value 'pc' by reading
9776 the stabs debug information */
9777 static void rt_printline(unsigned long wanted_pc)
9779 Stab_Sym *sym, *sym_end;
9780 char func_name[128], last_func_name[128];
9781 unsigned long func_addr, last_pc, pc;
9782 const char *incl_files[INCLUDE_STACK_SIZE];
9783 int incl_index, len, last_line_num, i;
9784 const char *str, *p;
9786 fprintf(stderr, "0x%08lx:", wanted_pc);
9788 func_name[0] = '\0';
9789 func_addr = 0;
9790 incl_index = 0;
9791 last_func_name[0] = '\0';
9792 last_pc = 0xffffffff;
9793 last_line_num = 1;
9794 sym = (Stab_Sym *)stab_section->data + 1;
9795 sym_end = (Stab_Sym *)(stab_section->data + stab_section->data_offset);
9796 while (sym < sym_end) {
9797 switch(sym->n_type) {
9798 /* function start or end */
9799 case N_FUN:
9800 if (sym->n_strx == 0) {
9801 /* we test if between last line and end of function */
9802 pc = sym->n_value + func_addr;
9803 if (wanted_pc >= last_pc && wanted_pc < pc)
9804 goto found;
9805 func_name[0] = '\0';
9806 func_addr = 0;
9807 } else {
9808 str = stabstr_section->data + sym->n_strx;
9809 p = strchr(str, ':');
9810 if (!p) {
9811 pstrcpy(func_name, sizeof(func_name), str);
9812 } else {
9813 len = p - str;
9814 if (len > sizeof(func_name) - 1)
9815 len = sizeof(func_name) - 1;
9816 memcpy(func_name, str, len);
9817 func_name[len] = '\0';
9819 func_addr = sym->n_value;
9821 break;
9822 /* line number info */
9823 case N_SLINE:
9824 pc = sym->n_value + func_addr;
9825 if (wanted_pc >= last_pc && wanted_pc < pc)
9826 goto found;
9827 last_pc = pc;
9828 last_line_num = sym->n_desc;
9829 /* XXX: slow! */
9830 strcpy(last_func_name, func_name);
9831 break;
9832 /* include files */
9833 case N_BINCL:
9834 str = stabstr_section->data + sym->n_strx;
9835 add_incl:
9836 if (incl_index < INCLUDE_STACK_SIZE) {
9837 incl_files[incl_index++] = str;
9839 break;
9840 case N_EINCL:
9841 if (incl_index > 1)
9842 incl_index--;
9843 break;
9844 case N_SO:
9845 if (sym->n_strx == 0) {
9846 incl_index = 0; /* end of translation unit */
9847 } else {
9848 str = stabstr_section->data + sym->n_strx;
9849 /* do not add path */
9850 len = strlen(str);
9851 if (len > 0 && str[len - 1] != '/')
9852 goto add_incl;
9854 break;
9856 sym++;
9859 /* second pass: we try symtab symbols (no line number info) */
9860 incl_index = 0;
9862 Elf32_Sym *sym, *sym_end;
9863 int type;
9865 sym_end = (Elf32_Sym *)(symtab_section->data + symtab_section->data_offset);
9866 for(sym = (Elf32_Sym *)symtab_section->data + 1;
9867 sym < sym_end;
9868 sym++) {
9869 type = ELF32_ST_TYPE(sym->st_info);
9870 if (type == STT_FUNC) {
9871 if (wanted_pc >= sym->st_value &&
9872 wanted_pc < sym->st_value + sym->st_size) {
9873 pstrcpy(last_func_name, sizeof(last_func_name),
9874 strtab_section->data + sym->st_name);
9875 goto found;
9880 /* did not find any info: */
9881 fprintf(stderr, " ???\n");
9882 return;
9883 found:
9884 if (last_func_name[0] != '\0') {
9885 fprintf(stderr, " %s()", last_func_name);
9887 if (incl_index > 0) {
9888 fprintf(stderr, " (%s:%d",
9889 incl_files[incl_index - 1], last_line_num);
9890 for(i = incl_index - 2; i >= 0; i--)
9891 fprintf(stderr, ", included from %s", incl_files[i]);
9892 fprintf(stderr, ")");
9894 fprintf(stderr, "\n");
9897 #if !defined(_WIN32) && !defined(CONFIG_TCCBOOT)
9899 #ifdef __i386__
9901 /* fix for glibc 2.1 */
9902 #ifndef REG_EIP
9903 #define REG_EIP EIP
9904 #define REG_EBP EBP
9905 #endif
9907 /* return the PC at frame level 'level'. Return non zero if not found */
9908 static int rt_get_caller_pc(unsigned long *paddr,
9909 ucontext_t *uc, int level)
9911 unsigned long fp;
9912 int i;
9914 if (level == 0) {
9915 #if defined(__FreeBSD__)
9916 *paddr = uc->uc_mcontext.mc_eip;
9917 #elif defined(__dietlibc__)
9918 *paddr = uc->uc_mcontext.eip;
9919 #else
9920 *paddr = uc->uc_mcontext.gregs[REG_EIP];
9921 #endif
9922 return 0;
9923 } else {
9924 #if defined(__FreeBSD__)
9925 fp = uc->uc_mcontext.mc_ebp;
9926 #elif defined(__dietlibc__)
9927 fp = uc->uc_mcontext.ebp;
9928 #else
9929 fp = uc->uc_mcontext.gregs[REG_EBP];
9930 #endif
9931 for(i=1;i<level;i++) {
9932 /* XXX: check address validity with program info */
9933 if (fp <= 0x1000 || fp >= 0xc0000000)
9934 return -1;
9935 fp = ((unsigned long *)fp)[0];
9937 *paddr = ((unsigned long *)fp)[1];
9938 return 0;
9941 #else
9943 #warning add arch specific rt_get_caller_pc()
9945 static int rt_get_caller_pc(unsigned long *paddr,
9946 ucontext_t *uc, int level)
9948 return -1;
9950 #endif
9952 /* emit a run time error at position 'pc' */
9953 void rt_error(ucontext_t *uc, const char *fmt, ...)
9955 va_list ap;
9956 unsigned long pc;
9957 int i;
9959 va_start(ap, fmt);
9960 fprintf(stderr, "Runtime error: ");
9961 vfprintf(stderr, fmt, ap);
9962 fprintf(stderr, "\n");
9963 for(i=0;i<num_callers;i++) {
9964 if (rt_get_caller_pc(&pc, uc, i) < 0)
9965 break;
9966 if (i == 0)
9967 fprintf(stderr, "at ");
9968 else
9969 fprintf(stderr, "by ");
9970 rt_printline(pc);
9972 exit(255);
9973 va_end(ap);
9976 /* signal handler for fatal errors */
9977 static void sig_error(int signum, siginfo_t *siginf, void *puc)
9979 ucontext_t *uc = puc;
9981 switch(signum) {
9982 case SIGFPE:
9983 switch(siginf->si_code) {
9984 case FPE_INTDIV:
9985 case FPE_FLTDIV:
9986 rt_error(uc, "division by zero");
9987 break;
9988 default:
9989 rt_error(uc, "floating point exception");
9990 break;
9992 break;
9993 case SIGBUS:
9994 case SIGSEGV:
9995 if (rt_bound_error_msg && *rt_bound_error_msg)
9996 rt_error(uc, *rt_bound_error_msg);
9997 else
9998 rt_error(uc, "dereferencing invalid pointer");
9999 break;
10000 case SIGILL:
10001 rt_error(uc, "illegal instruction");
10002 break;
10003 case SIGABRT:
10004 rt_error(uc, "abort() called");
10005 break;
10006 default:
10007 rt_error(uc, "caught signal %d", signum);
10008 break;
10010 exit(255);
10012 #endif
10014 /* do all relocations (needed before using tcc_get_symbol()) */
10015 int tcc_relocate(TCCState *s1)
10017 Section *s;
10018 int i;
10020 s1->nb_errors = 0;
10022 #ifdef TCC_TARGET_PE
10023 pe_add_runtime(s1);
10024 #else
10025 tcc_add_runtime(s1);
10026 #endif
10028 relocate_common_syms();
10030 tcc_add_linker_symbols(s1);
10031 #ifndef TCC_TARGET_PE
10032 build_got_entries(s1);
10033 #endif
10034 /* compute relocation address : section are relocated in place. We
10035 also alloc the bss space */
10036 for(i = 1; i < s1->nb_sections; i++) {
10037 s = s1->sections[i];
10038 if (s->sh_flags & SHF_ALLOC) {
10039 if (s->sh_type == SHT_NOBITS)
10040 s->data = tcc_mallocz(s->data_offset);
10041 s->sh_addr = (unsigned long)s->data;
10045 relocate_syms(s1, 1);
10047 if (s1->nb_errors != 0)
10048 return -1;
10050 /* relocate each section */
10051 for(i = 1; i < s1->nb_sections; i++) {
10052 s = s1->sections[i];
10053 if (s->reloc)
10054 relocate_section(s1, s);
10057 /* mark executable sections as executable in memory */
10058 for(i = 1; i < s1->nb_sections; i++) {
10059 s = s1->sections[i];
10060 if ((s->sh_flags & (SHF_ALLOC | SHF_EXECINSTR)) ==
10061 (SHF_ALLOC | SHF_EXECINSTR))
10062 set_pages_executable(s->data, s->data_offset);
10064 return 0;
10067 /* launch the compiled program with the given arguments */
10068 int tcc_run(TCCState *s1, int argc, char **argv)
10070 int (*prog_main)(int, char **);
10072 if (tcc_relocate(s1) < 0)
10073 return -1;
10075 prog_main = tcc_get_symbol_err(s1, "main");
10077 if (do_debug) {
10078 #if defined(_WIN32) || defined(CONFIG_TCCBOOT)
10079 error("debug mode currently not available for Windows");
10080 #else
10081 struct sigaction sigact;
10082 /* install TCC signal handlers to print debug info on fatal
10083 runtime errors */
10084 sigact.sa_flags = SA_SIGINFO | SA_RESETHAND;
10085 sigact.sa_sigaction = sig_error;
10086 sigemptyset(&sigact.sa_mask);
10087 sigaction(SIGFPE, &sigact, NULL);
10088 sigaction(SIGILL, &sigact, NULL);
10089 sigaction(SIGSEGV, &sigact, NULL);
10090 sigaction(SIGBUS, &sigact, NULL);
10091 sigaction(SIGABRT, &sigact, NULL);
10092 #endif
10095 #ifdef CONFIG_TCC_BCHECK
10096 if (do_bounds_check) {
10097 void (*bound_init)(void);
10099 /* set error function */
10100 rt_bound_error_msg = (void *)tcc_get_symbol_err(s1,
10101 "__bound_error_msg");
10103 /* XXX: use .init section so that it also work in binary ? */
10104 bound_init = (void *)tcc_get_symbol_err(s1, "__bound_init");
10105 bound_init();
10107 #endif
10108 return (*prog_main)(argc, argv);
10111 void tcc_memstats(void)
10113 #ifdef MEM_DEBUG
10114 printf("memory in use: %d\n", mem_cur_size);
10115 #endif
10118 static void tcc_cleanup(void)
10120 int i, n;
10122 if (NULL == tcc_state)
10123 return;
10124 tcc_state = NULL;
10126 /* free -D defines */
10127 free_defines(NULL);
10129 /* free tokens */
10130 n = tok_ident - TOK_IDENT;
10131 for(i = 0; i < n; i++)
10132 tcc_free(table_ident[i]);
10133 tcc_free(table_ident);
10135 /* free sym_pools */
10136 dynarray_reset(&sym_pools, &nb_sym_pools);
10137 /* string buffer */
10138 cstr_free(&tokcstr);
10139 /* reset symbol stack */
10140 sym_free_first = NULL;
10141 /* cleanup from error/setjmp */
10142 macro_ptr = NULL;
10145 TCCState *tcc_new(void)
10147 const char *p, *r;
10148 TCCState *s;
10149 TokenSym *ts;
10150 int i, c;
10152 tcc_cleanup();
10154 s = tcc_mallocz(sizeof(TCCState));
10155 if (!s)
10156 return NULL;
10157 tcc_state = s;
10158 s->output_type = TCC_OUTPUT_MEMORY;
10160 /* init isid table */
10161 for(i=CH_EOF;i<256;i++)
10162 isidnum_table[i-CH_EOF] = isid(i) || isnum(i);
10164 /* add all tokens */
10165 table_ident = NULL;
10166 memset(hash_ident, 0, TOK_HASH_SIZE * sizeof(TokenSym *));
10168 tok_ident = TOK_IDENT;
10169 p = tcc_keywords;
10170 while (*p) {
10171 r = p;
10172 for(;;) {
10173 c = *r++;
10174 if (c == '\0')
10175 break;
10177 ts = tok_alloc(p, r - p - 1);
10178 p = r;
10181 /* we add dummy defines for some special macros to speed up tests
10182 and to have working defined() */
10183 define_push(TOK___LINE__, MACRO_OBJ, NULL, NULL);
10184 define_push(TOK___FILE__, MACRO_OBJ, NULL, NULL);
10185 define_push(TOK___DATE__, MACRO_OBJ, NULL, NULL);
10186 define_push(TOK___TIME__, MACRO_OBJ, NULL, NULL);
10188 /* standard defines */
10189 tcc_define_symbol(s, "__STDC__", NULL);
10190 tcc_define_symbol(s, "__STDC_VERSION__", "199901L");
10191 #if defined(TCC_TARGET_I386)
10192 tcc_define_symbol(s, "__i386__", NULL);
10193 #endif
10194 #if defined(TCC_TARGET_ARM)
10195 tcc_define_symbol(s, "__ARM_ARCH_4__", NULL);
10196 tcc_define_symbol(s, "__arm_elf__", NULL);
10197 tcc_define_symbol(s, "__arm_elf", NULL);
10198 tcc_define_symbol(s, "arm_elf", NULL);
10199 tcc_define_symbol(s, "__arm__", NULL);
10200 tcc_define_symbol(s, "__arm", NULL);
10201 tcc_define_symbol(s, "arm", NULL);
10202 tcc_define_symbol(s, "__APCS_32__", NULL);
10203 #endif
10204 #ifdef TCC_TARGET_PE
10205 tcc_define_symbol(s, "_WIN32", NULL);
10206 #else
10207 tcc_define_symbol(s, "__unix__", NULL);
10208 tcc_define_symbol(s, "__unix", NULL);
10209 #if defined(__linux)
10210 tcc_define_symbol(s, "__linux__", NULL);
10211 tcc_define_symbol(s, "__linux", NULL);
10212 #endif
10213 #endif
10214 /* tiny C specific defines */
10215 tcc_define_symbol(s, "__TINYC__", NULL);
10217 /* tiny C & gcc defines */
10218 tcc_define_symbol(s, "__SIZE_TYPE__", "unsigned int");
10219 tcc_define_symbol(s, "__PTRDIFF_TYPE__", "int");
10220 #ifdef TCC_TARGET_PE
10221 tcc_define_symbol(s, "__WCHAR_TYPE__", "unsigned short");
10222 #else
10223 tcc_define_symbol(s, "__WCHAR_TYPE__", "int");
10224 #endif
10226 #ifndef TCC_TARGET_PE
10227 /* default library paths */
10228 tcc_add_library_path(s, CONFIG_SYSROOT "/usr/local/lib");
10229 tcc_add_library_path(s, CONFIG_SYSROOT "/usr/lib");
10230 tcc_add_library_path(s, CONFIG_SYSROOT "/lib");
10231 #endif
10233 /* no section zero */
10234 dynarray_add((void ***)&s->sections, &s->nb_sections, NULL);
10236 /* create standard sections */
10237 text_section = new_section(s, ".text", SHT_PROGBITS, SHF_ALLOC | SHF_EXECINSTR);
10238 data_section = new_section(s, ".data", SHT_PROGBITS, SHF_ALLOC | SHF_WRITE);
10239 bss_section = new_section(s, ".bss", SHT_NOBITS, SHF_ALLOC | SHF_WRITE);
10241 /* symbols are always generated for linking stage */
10242 symtab_section = new_symtab(s, ".symtab", SHT_SYMTAB, 0,
10243 ".strtab",
10244 ".hashtab", SHF_PRIVATE);
10245 strtab_section = symtab_section->link;
10247 /* private symbol table for dynamic symbols */
10248 s->dynsymtab_section = new_symtab(s, ".dynsymtab", SHT_SYMTAB, SHF_PRIVATE,
10249 ".dynstrtab",
10250 ".dynhashtab", SHF_PRIVATE);
10251 s->alacarte_link = 1;
10253 #ifdef CHAR_IS_UNSIGNED
10254 s->char_is_unsigned = 1;
10255 #endif
10256 #if defined(TCC_TARGET_PE) && 0
10257 /* XXX: currently the PE linker is not ready to support that */
10258 s->leading_underscore = 1;
10259 #endif
10260 return s;
10263 void tcc_delete(TCCState *s1)
10265 int i;
10267 tcc_cleanup();
10269 /* free all sections */
10270 free_section(s1->dynsymtab_section);
10272 for(i = 1; i < s1->nb_sections; i++)
10273 free_section(s1->sections[i]);
10274 tcc_free(s1->sections);
10276 /* free any loaded DLLs */
10277 for ( i = 0; i < s1->nb_loaded_dlls; i++)
10279 DLLReference *ref = s1->loaded_dlls[i];
10280 if ( ref->handle )
10281 dlclose(ref->handle);
10284 /* free loaded dlls array */
10285 dynarray_reset(&s1->loaded_dlls, &s1->nb_loaded_dlls);
10287 /* free library paths */
10288 dynarray_reset(&s1->library_paths, &s1->nb_library_paths);
10290 /* free include paths */
10291 dynarray_reset(&s1->cached_includes, &s1->nb_cached_includes);
10292 dynarray_reset(&s1->include_paths, &s1->nb_include_paths);
10293 dynarray_reset(&s1->sysinclude_paths, &s1->nb_sysinclude_paths);
10295 tcc_free(s1);
10298 int tcc_add_include_path(TCCState *s1, const char *pathname)
10300 char *pathname1;
10302 pathname1 = tcc_strdup(pathname);
10303 dynarray_add((void ***)&s1->include_paths, &s1->nb_include_paths, pathname1);
10304 return 0;
10307 int tcc_add_sysinclude_path(TCCState *s1, const char *pathname)
10309 char *pathname1;
10311 pathname1 = tcc_strdup(pathname);
10312 dynarray_add((void ***)&s1->sysinclude_paths, &s1->nb_sysinclude_paths, pathname1);
10313 return 0;
10316 static int tcc_add_file_internal(TCCState *s1, const char *filename, int flags)
10318 const char *ext;
10319 Elf32_Ehdr ehdr;
10320 int fd, ret;
10321 BufferedFile *saved_file;
10323 /* find source file type with extension */
10324 ext = tcc_fileextension(filename);
10325 if (ext[0])
10326 ext++;
10328 /* open the file */
10329 saved_file = file;
10330 file = tcc_open(s1, filename);
10331 if (!file) {
10332 if (flags & AFF_PRINT_ERROR) {
10333 error_noabort("file '%s' not found", filename);
10335 ret = -1;
10336 goto fail1;
10339 if (flags & AFF_PREPROCESS) {
10340 ret = tcc_preprocess(s1);
10341 } else if (!ext[0] || !strcmp(ext, "c")) {
10342 /* C file assumed */
10343 ret = tcc_compile(s1);
10344 } else
10345 #ifdef CONFIG_TCC_ASM
10346 if (!strcmp(ext, "S")) {
10347 /* preprocessed assembler */
10348 ret = tcc_assemble(s1, 1);
10349 } else if (!strcmp(ext, "s")) {
10350 /* non preprocessed assembler */
10351 ret = tcc_assemble(s1, 0);
10352 } else
10353 #endif
10354 #ifdef TCC_TARGET_PE
10355 if (!strcmp(ext, "def")) {
10356 ret = pe_load_def_file(s1, file->fd);
10357 } else
10358 #endif
10360 fd = file->fd;
10361 /* assume executable format: auto guess file type */
10362 ret = read(fd, &ehdr, sizeof(ehdr));
10363 lseek(fd, 0, SEEK_SET);
10364 if (ret <= 0) {
10365 error_noabort("could not read header");
10366 goto fail;
10367 } else if (ret != sizeof(ehdr)) {
10368 goto try_load_script;
10371 if (ehdr.e_ident[0] == ELFMAG0 &&
10372 ehdr.e_ident[1] == ELFMAG1 &&
10373 ehdr.e_ident[2] == ELFMAG2 &&
10374 ehdr.e_ident[3] == ELFMAG3) {
10375 file->line_num = 0; /* do not display line number if error */
10376 if (ehdr.e_type == ET_REL) {
10377 ret = tcc_load_object_file(s1, fd, 0);
10378 } else if (ehdr.e_type == ET_DYN) {
10379 if (s1->output_type == TCC_OUTPUT_MEMORY) {
10380 #ifdef TCC_TARGET_PE
10381 ret = -1;
10382 #else
10383 void *h;
10384 h = dlopen(filename, RTLD_GLOBAL | RTLD_LAZY);
10385 if (h)
10386 ret = 0;
10387 else
10388 ret = -1;
10389 #endif
10390 } else {
10391 ret = tcc_load_dll(s1, fd, filename,
10392 (flags & AFF_REFERENCED_DLL) != 0);
10394 } else {
10395 error_noabort("unrecognized ELF file");
10396 goto fail;
10398 } else if (memcmp((char *)&ehdr, ARMAG, 8) == 0) {
10399 file->line_num = 0; /* do not display line number if error */
10400 ret = tcc_load_archive(s1, fd);
10401 } else
10402 #ifdef TCC_TARGET_COFF
10403 if (*(uint16_t *)(&ehdr) == COFF_C67_MAGIC) {
10404 ret = tcc_load_coff(s1, fd);
10405 } else
10406 #endif
10407 #ifdef TCC_TARGET_PE
10408 if (pe_test_res_file(&ehdr, ret)) {
10409 ret = pe_load_res_file(s1, fd);
10410 } else
10411 #endif
10413 /* as GNU ld, consider it is an ld script if not recognized */
10414 try_load_script:
10415 ret = tcc_load_ldscript(s1);
10416 if (ret < 0) {
10417 error_noabort("unrecognized file type");
10418 goto fail;
10422 the_end:
10423 tcc_close(file);
10424 fail1:
10425 file = saved_file;
10426 return ret;
10427 fail:
10428 ret = -1;
10429 goto the_end;
10432 int tcc_add_file(TCCState *s, const char *filename)
10434 return tcc_add_file_internal(s, filename, AFF_PRINT_ERROR);
10437 int tcc_add_library_path(TCCState *s, const char *pathname)
10439 char *pathname1;
10441 pathname1 = tcc_strdup(pathname);
10442 dynarray_add((void ***)&s->library_paths, &s->nb_library_paths, pathname1);
10443 return 0;
10446 /* find and load a dll. Return non zero if not found */
10447 /* XXX: add '-rpath' option support ? */
10448 static int tcc_add_dll(TCCState *s, const char *filename, int flags)
10450 char buf[1024];
10451 int i;
10453 for(i = 0; i < s->nb_library_paths; i++) {
10454 snprintf(buf, sizeof(buf), "%s/%s",
10455 s->library_paths[i], filename);
10456 if (tcc_add_file_internal(s, buf, flags) == 0)
10457 return 0;
10459 return -1;
10462 /* the library name is the same as the argument of the '-l' option */
10463 int tcc_add_library(TCCState *s, const char *libraryname)
10465 char buf[1024];
10466 int i;
10468 /* first we look for the dynamic library if not static linking */
10469 if (!s->static_link) {
10470 #ifdef TCC_TARGET_PE
10471 snprintf(buf, sizeof(buf), "%s.def", libraryname);
10472 #else
10473 snprintf(buf, sizeof(buf), "lib%s.so", libraryname);
10474 #endif
10475 if (tcc_add_dll(s, buf, 0) == 0)
10476 return 0;
10479 /* then we look for the static library */
10480 for(i = 0; i < s->nb_library_paths; i++) {
10481 snprintf(buf, sizeof(buf), "%s/lib%s.a",
10482 s->library_paths[i], libraryname);
10483 if (tcc_add_file_internal(s, buf, 0) == 0)
10484 return 0;
10486 return -1;
10489 int tcc_add_symbol(TCCState *s, const char *name, unsigned long val)
10491 add_elf_sym(symtab_section, val, 0,
10492 ELF32_ST_INFO(STB_GLOBAL, STT_NOTYPE), 0,
10493 SHN_ABS, name);
10494 return 0;
10497 int tcc_set_output_type(TCCState *s, int output_type)
10499 char buf[1024];
10501 s->output_type = output_type;
10503 if (!s->nostdinc) {
10504 /* default include paths */
10505 /* XXX: reverse order needed if -isystem support */
10506 #ifndef TCC_TARGET_PE
10507 tcc_add_sysinclude_path(s, CONFIG_SYSROOT "/usr/local/include");
10508 tcc_add_sysinclude_path(s, CONFIG_SYSROOT "/usr/include");
10509 #endif
10510 snprintf(buf, sizeof(buf), "%s/include", tcc_lib_path);
10511 tcc_add_sysinclude_path(s, buf);
10512 #ifdef TCC_TARGET_PE
10513 snprintf(buf, sizeof(buf), "%s/include/winapi", tcc_lib_path);
10514 tcc_add_sysinclude_path(s, buf);
10515 #endif
10518 /* if bound checking, then add corresponding sections */
10519 #ifdef CONFIG_TCC_BCHECK
10520 if (do_bounds_check) {
10521 /* define symbol */
10522 tcc_define_symbol(s, "__BOUNDS_CHECKING_ON", NULL);
10523 /* create bounds sections */
10524 bounds_section = new_section(s, ".bounds",
10525 SHT_PROGBITS, SHF_ALLOC);
10526 lbounds_section = new_section(s, ".lbounds",
10527 SHT_PROGBITS, SHF_ALLOC);
10529 #endif
10531 if (s->char_is_unsigned) {
10532 tcc_define_symbol(s, "__CHAR_UNSIGNED__", NULL);
10535 /* add debug sections */
10536 if (do_debug) {
10537 /* stab symbols */
10538 stab_section = new_section(s, ".stab", SHT_PROGBITS, 0);
10539 stab_section->sh_entsize = sizeof(Stab_Sym);
10540 stabstr_section = new_section(s, ".stabstr", SHT_STRTAB, 0);
10541 put_elf_str(stabstr_section, "");
10542 stab_section->link = stabstr_section;
10543 /* put first entry */
10544 put_stabs("", 0, 0, 0, 0);
10547 /* add libc crt1/crti objects */
10548 #ifndef TCC_TARGET_PE
10549 if ((output_type == TCC_OUTPUT_EXE || output_type == TCC_OUTPUT_DLL) &&
10550 !s->nostdlib) {
10551 if (output_type != TCC_OUTPUT_DLL)
10552 tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crt1.o");
10553 tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crti.o");
10555 #endif
10557 #ifdef TCC_TARGET_PE
10558 snprintf(buf, sizeof(buf), "%s/lib", tcc_lib_path);
10559 tcc_add_library_path(s, buf);
10560 #endif
10562 return 0;
10565 #define WD_ALL 0x0001 /* warning is activated when using -Wall */
10566 #define FD_INVERT 0x0002 /* invert value before storing */
10568 typedef struct FlagDef {
10569 uint16_t offset;
10570 uint16_t flags;
10571 const char *name;
10572 } FlagDef;
10574 static const FlagDef warning_defs[] = {
10575 { offsetof(TCCState, warn_unsupported), 0, "unsupported" },
10576 { offsetof(TCCState, warn_write_strings), 0, "write-strings" },
10577 { offsetof(TCCState, warn_error), 0, "error" },
10578 { offsetof(TCCState, warn_implicit_function_declaration), WD_ALL,
10579 "implicit-function-declaration" },
10582 static int set_flag(TCCState *s, const FlagDef *flags, int nb_flags,
10583 const char *name, int value)
10585 int i;
10586 const FlagDef *p;
10587 const char *r;
10589 r = name;
10590 if (r[0] == 'n' && r[1] == 'o' && r[2] == '-') {
10591 r += 3;
10592 value = !value;
10594 for(i = 0, p = flags; i < nb_flags; i++, p++) {
10595 if (!strcmp(r, p->name))
10596 goto found;
10598 return -1;
10599 found:
10600 if (p->flags & FD_INVERT)
10601 value = !value;
10602 *(int *)((uint8_t *)s + p->offset) = value;
10603 return 0;
10607 /* set/reset a warning */
10608 int tcc_set_warning(TCCState *s, const char *warning_name, int value)
10610 int i;
10611 const FlagDef *p;
10613 if (!strcmp(warning_name, "all")) {
10614 for(i = 0, p = warning_defs; i < countof(warning_defs); i++, p++) {
10615 if (p->flags & WD_ALL)
10616 *(int *)((uint8_t *)s + p->offset) = 1;
10618 return 0;
10619 } else {
10620 return set_flag(s, warning_defs, countof(warning_defs),
10621 warning_name, value);
10625 static const FlagDef flag_defs[] = {
10626 { offsetof(TCCState, char_is_unsigned), 0, "unsigned-char" },
10627 { offsetof(TCCState, char_is_unsigned), FD_INVERT, "signed-char" },
10628 { offsetof(TCCState, nocommon), FD_INVERT, "common" },
10629 { offsetof(TCCState, leading_underscore), 0, "leading-underscore" },
10632 /* set/reset a flag */
10633 int tcc_set_flag(TCCState *s, const char *flag_name, int value)
10635 return set_flag(s, flag_defs, countof(flag_defs),
10636 flag_name, value);
10639 #if !defined(LIBTCC)
10641 static int64_t getclock_us(void)
10643 #ifdef _WIN32
10644 struct _timeb tb;
10645 _ftime(&tb);
10646 return (tb.time * 1000LL + tb.millitm) * 1000LL;
10647 #else
10648 struct timeval tv;
10649 gettimeofday(&tv, NULL);
10650 return tv.tv_sec * 1000000LL + tv.tv_usec;
10651 #endif
10654 void help(void)
10656 printf("tcc version " TCC_VERSION " - Tiny C Compiler - Copyright (C) 2001-2006 Fabrice Bellard\n"
10657 "usage: tcc [-v] [-c] [-o outfile] [-Bdir] [-bench] [-Idir] [-Dsym[=val]] [-Usym]\n"
10658 " [-Wwarn] [-g] [-b] [-bt N] [-Ldir] [-llib] [-shared] [-soname name]\n"
10659 " [-static] [infile1 infile2...] [-run infile args...]\n"
10660 "\n"
10661 "General options:\n"
10662 " -v display current version, increase verbosity\n"
10663 " -c compile only - generate an object file\n"
10664 " -o outfile set output filename\n"
10665 " -Bdir set tcc internal library path\n"
10666 " -bench output compilation statistics\n"
10667 " -run run compiled source\n"
10668 " -fflag set or reset (with 'no-' prefix) 'flag' (see man page)\n"
10669 " -Wwarning set or reset (with 'no-' prefix) 'warning' (see man page)\n"
10670 " -w disable all warnings\n"
10671 "Preprocessor options:\n"
10672 " -E preprocess only\n"
10673 " -Idir add include path 'dir'\n"
10674 " -Dsym[=val] define 'sym' with value 'val'\n"
10675 " -Usym undefine 'sym'\n"
10676 "Linker options:\n"
10677 " -Ldir add library path 'dir'\n"
10678 " -llib link with dynamic or static library 'lib'\n"
10679 " -shared generate a shared library\n"
10680 " -soname set name for shared library to be used at runtime\n"
10681 " -static static linking\n"
10682 " -rdynamic export all global symbols to dynamic linker\n"
10683 " -r generate (relocatable) object file\n"
10684 "Debugger options:\n"
10685 " -g generate runtime debug info\n"
10686 #ifdef CONFIG_TCC_BCHECK
10687 " -b compile with built-in memory and bounds checker (implies -g)\n"
10688 #endif
10689 " -bt N show N callers in stack traces\n"
10693 #define TCC_OPTION_HAS_ARG 0x0001
10694 #define TCC_OPTION_NOSEP 0x0002 /* cannot have space before option and arg */
10696 typedef struct TCCOption {
10697 const char *name;
10698 uint16_t index;
10699 uint16_t flags;
10700 } TCCOption;
10702 enum {
10703 TCC_OPTION_HELP,
10704 TCC_OPTION_I,
10705 TCC_OPTION_D,
10706 TCC_OPTION_U,
10707 TCC_OPTION_L,
10708 TCC_OPTION_B,
10709 TCC_OPTION_l,
10710 TCC_OPTION_bench,
10711 TCC_OPTION_bt,
10712 TCC_OPTION_b,
10713 TCC_OPTION_g,
10714 TCC_OPTION_c,
10715 TCC_OPTION_static,
10716 TCC_OPTION_shared,
10717 TCC_OPTION_soname,
10718 TCC_OPTION_o,
10719 TCC_OPTION_r,
10720 TCC_OPTION_Wl,
10721 TCC_OPTION_W,
10722 TCC_OPTION_O,
10723 TCC_OPTION_m,
10724 TCC_OPTION_f,
10725 TCC_OPTION_nostdinc,
10726 TCC_OPTION_nostdlib,
10727 TCC_OPTION_print_search_dirs,
10728 TCC_OPTION_rdynamic,
10729 TCC_OPTION_run,
10730 TCC_OPTION_v,
10731 TCC_OPTION_w,
10732 TCC_OPTION_pipe,
10733 TCC_OPTION_E,
10736 static const TCCOption tcc_options[] = {
10737 { "h", TCC_OPTION_HELP, 0 },
10738 { "?", TCC_OPTION_HELP, 0 },
10739 { "I", TCC_OPTION_I, TCC_OPTION_HAS_ARG },
10740 { "D", TCC_OPTION_D, TCC_OPTION_HAS_ARG },
10741 { "U", TCC_OPTION_U, TCC_OPTION_HAS_ARG },
10742 { "L", TCC_OPTION_L, TCC_OPTION_HAS_ARG },
10743 { "B", TCC_OPTION_B, TCC_OPTION_HAS_ARG },
10744 { "l", TCC_OPTION_l, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10745 { "bench", TCC_OPTION_bench, 0 },
10746 { "bt", TCC_OPTION_bt, TCC_OPTION_HAS_ARG },
10747 #ifdef CONFIG_TCC_BCHECK
10748 { "b", TCC_OPTION_b, 0 },
10749 #endif
10750 { "g", TCC_OPTION_g, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10751 { "c", TCC_OPTION_c, 0 },
10752 { "static", TCC_OPTION_static, 0 },
10753 { "shared", TCC_OPTION_shared, 0 },
10754 { "soname", TCC_OPTION_soname, TCC_OPTION_HAS_ARG },
10755 { "o", TCC_OPTION_o, TCC_OPTION_HAS_ARG },
10756 { "run", TCC_OPTION_run, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10757 { "rdynamic", TCC_OPTION_rdynamic, 0 },
10758 { "r", TCC_OPTION_r, 0 },
10759 { "Wl,", TCC_OPTION_Wl, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10760 { "W", TCC_OPTION_W, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10761 { "O", TCC_OPTION_O, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10762 { "m", TCC_OPTION_m, TCC_OPTION_HAS_ARG },
10763 { "f", TCC_OPTION_f, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10764 { "nostdinc", TCC_OPTION_nostdinc, 0 },
10765 { "nostdlib", TCC_OPTION_nostdlib, 0 },
10766 { "print-search-dirs", TCC_OPTION_print_search_dirs, 0 },
10767 { "v", TCC_OPTION_v, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10768 { "w", TCC_OPTION_w, 0 },
10769 { "pipe", TCC_OPTION_pipe, 0},
10770 { "E", TCC_OPTION_E, 0},
10771 { NULL },
10774 /* convert 'str' into an array of space separated strings */
10775 static int expand_args(char ***pargv, const char *str)
10777 const char *s1;
10778 char **argv, *arg;
10779 int argc, len;
10781 argc = 0;
10782 argv = NULL;
10783 for(;;) {
10784 while (is_space(*str))
10785 str++;
10786 if (*str == '\0')
10787 break;
10788 s1 = str;
10789 while (*str != '\0' && !is_space(*str))
10790 str++;
10791 len = str - s1;
10792 arg = tcc_malloc(len + 1);
10793 memcpy(arg, s1, len);
10794 arg[len] = '\0';
10795 dynarray_add((void ***)&argv, &argc, arg);
10797 *pargv = argv;
10798 return argc;
10801 static char **files;
10802 static int nb_files, nb_libraries;
10803 static int multiple_files;
10804 static int print_search_dirs;
10805 static int output_type;
10806 static int reloc_output;
10807 static const char *outfile;
10809 int parse_args(TCCState *s, int argc, char **argv)
10811 int optind;
10812 const TCCOption *popt;
10813 const char *optarg, *p1, *r1;
10814 char *r;
10816 optind = 0;
10817 while (optind < argc) {
10819 r = argv[optind++];
10820 if (r[0] != '-' || r[1] == '\0') {
10821 /* add a new file */
10822 dynarray_add((void ***)&files, &nb_files, r);
10823 if (!multiple_files) {
10824 optind--;
10825 /* argv[0] will be this file */
10826 break;
10828 } else {
10829 /* find option in table (match only the first chars */
10830 popt = tcc_options;
10831 for(;;) {
10832 p1 = popt->name;
10833 if (p1 == NULL)
10834 error("invalid option -- '%s'", r);
10835 r1 = r + 1;
10836 for(;;) {
10837 if (*p1 == '\0')
10838 goto option_found;
10839 if (*r1 != *p1)
10840 break;
10841 p1++;
10842 r1++;
10844 popt++;
10846 option_found:
10847 if (popt->flags & TCC_OPTION_HAS_ARG) {
10848 if (*r1 != '\0' || (popt->flags & TCC_OPTION_NOSEP)) {
10849 optarg = r1;
10850 } else {
10851 if (optind >= argc)
10852 error("argument to '%s' is missing", r);
10853 optarg = argv[optind++];
10855 } else {
10856 if (*r1 != '\0')
10857 return 0;
10858 optarg = NULL;
10861 switch(popt->index) {
10862 case TCC_OPTION_HELP:
10863 return 0;
10865 case TCC_OPTION_I:
10866 if (tcc_add_include_path(s, optarg) < 0)
10867 error("too many include paths");
10868 break;
10869 case TCC_OPTION_D:
10871 char *sym, *value;
10872 sym = (char *)optarg;
10873 value = strchr(sym, '=');
10874 if (value) {
10875 *value = '\0';
10876 value++;
10878 tcc_define_symbol(s, sym, value);
10880 break;
10881 case TCC_OPTION_U:
10882 tcc_undefine_symbol(s, optarg);
10883 break;
10884 case TCC_OPTION_L:
10885 tcc_add_library_path(s, optarg);
10886 break;
10887 case TCC_OPTION_B:
10888 /* set tcc utilities path (mainly for tcc development) */
10889 tcc_lib_path = optarg;
10890 break;
10891 case TCC_OPTION_l:
10892 dynarray_add((void ***)&files, &nb_files, r);
10893 nb_libraries++;
10894 break;
10895 case TCC_OPTION_bench:
10896 do_bench = 1;
10897 break;
10898 case TCC_OPTION_bt:
10899 num_callers = atoi(optarg);
10900 break;
10901 #ifdef CONFIG_TCC_BCHECK
10902 case TCC_OPTION_b:
10903 do_bounds_check = 1;
10904 do_debug = 1;
10905 break;
10906 #endif
10907 case TCC_OPTION_g:
10908 do_debug = 1;
10909 break;
10910 case TCC_OPTION_c:
10911 multiple_files = 1;
10912 output_type = TCC_OUTPUT_OBJ;
10913 break;
10914 case TCC_OPTION_static:
10915 s->static_link = 1;
10916 break;
10917 case TCC_OPTION_shared:
10918 output_type = TCC_OUTPUT_DLL;
10919 break;
10920 case TCC_OPTION_soname:
10921 s->soname = optarg;
10922 break;
10923 case TCC_OPTION_o:
10924 multiple_files = 1;
10925 outfile = optarg;
10926 break;
10927 case TCC_OPTION_r:
10928 /* generate a .o merging several output files */
10929 reloc_output = 1;
10930 output_type = TCC_OUTPUT_OBJ;
10931 break;
10932 case TCC_OPTION_nostdinc:
10933 s->nostdinc = 1;
10934 break;
10935 case TCC_OPTION_nostdlib:
10936 s->nostdlib = 1;
10937 break;
10938 case TCC_OPTION_print_search_dirs:
10939 print_search_dirs = 1;
10940 break;
10941 case TCC_OPTION_run:
10943 int argc1;
10944 char **argv1;
10945 argc1 = expand_args(&argv1, optarg);
10946 if (argc1 > 0) {
10947 parse_args(s, argc1, argv1);
10949 multiple_files = 0;
10950 output_type = TCC_OUTPUT_MEMORY;
10952 break;
10953 case TCC_OPTION_v:
10954 do {
10955 if (0 == verbose++)
10956 printf("tcc version %s\n", TCC_VERSION);
10957 } while (*optarg++ == 'v');
10958 break;
10959 case TCC_OPTION_f:
10960 if (tcc_set_flag(s, optarg, 1) < 0 && s->warn_unsupported)
10961 goto unsupported_option;
10962 break;
10963 case TCC_OPTION_W:
10964 if (tcc_set_warning(s, optarg, 1) < 0 &&
10965 s->warn_unsupported)
10966 goto unsupported_option;
10967 break;
10968 case TCC_OPTION_w:
10969 s->warn_none = 1;
10970 break;
10971 case TCC_OPTION_rdynamic:
10972 s->rdynamic = 1;
10973 break;
10974 case TCC_OPTION_Wl:
10976 const char *p;
10977 if (strstart(optarg, "-Ttext,", &p)) {
10978 s->text_addr = strtoul(p, NULL, 16);
10979 s->has_text_addr = 1;
10980 } else if (strstart(optarg, "--oformat,", &p)) {
10981 if (strstart(p, "elf32-", NULL)) {
10982 s->output_format = TCC_OUTPUT_FORMAT_ELF;
10983 } else if (!strcmp(p, "binary")) {
10984 s->output_format = TCC_OUTPUT_FORMAT_BINARY;
10985 } else
10986 #ifdef TCC_TARGET_COFF
10987 if (!strcmp(p, "coff")) {
10988 s->output_format = TCC_OUTPUT_FORMAT_COFF;
10989 } else
10990 #endif
10992 error("target %s not found", p);
10994 } else {
10995 error("unsupported linker option '%s'", optarg);
10998 break;
10999 case TCC_OPTION_E:
11000 output_type = TCC_OUTPUT_PREPROCESS;
11001 break;
11002 default:
11003 if (s->warn_unsupported) {
11004 unsupported_option:
11005 warning("unsupported option '%s'", r);
11007 break;
11011 return optind + 1;
11014 int main(int argc, char **argv)
11016 int i;
11017 TCCState *s;
11018 int nb_objfiles, ret, optind;
11019 char objfilename[1024];
11020 int64_t start_time = 0;
11022 #ifdef _WIN32
11023 tcc_lib_path = w32_tcc_lib_path();
11024 #endif
11026 s = tcc_new();
11027 output_type = TCC_OUTPUT_EXE;
11028 outfile = NULL;
11029 multiple_files = 1;
11030 files = NULL;
11031 nb_files = 0;
11032 nb_libraries = 0;
11033 reloc_output = 0;
11034 print_search_dirs = 0;
11035 ret = 0;
11037 optind = parse_args(s, argc - 1, argv + 1);
11038 if (print_search_dirs) {
11039 /* enough for Linux kernel */
11040 printf("install: %s/\n", tcc_lib_path);
11041 return 0;
11043 if (optind == 0 || nb_files == 0) {
11044 if (optind && verbose)
11045 return 0;
11046 help();
11047 return 1;
11050 nb_objfiles = nb_files - nb_libraries;
11052 /* if outfile provided without other options, we output an
11053 executable */
11054 if (outfile && output_type == TCC_OUTPUT_MEMORY)
11055 output_type = TCC_OUTPUT_EXE;
11057 /* check -c consistency : only single file handled. XXX: checks file type */
11058 if (output_type == TCC_OUTPUT_OBJ && !reloc_output) {
11059 /* accepts only a single input file */
11060 if (nb_objfiles != 1)
11061 error("cannot specify multiple files with -c");
11062 if (nb_libraries != 0)
11063 error("cannot specify libraries with -c");
11067 if (output_type == TCC_OUTPUT_PREPROCESS) {
11068 if (!outfile) {
11069 s->outfile = stdout;
11070 } else {
11071 s->outfile = fopen(outfile, "w");
11072 if (!s->outfile)
11073 error("could not open '%s", outfile);
11075 } else if (output_type != TCC_OUTPUT_MEMORY) {
11076 if (!outfile) {
11077 /* compute default outfile name */
11078 char *ext;
11079 const char *name =
11080 strcmp(files[0], "-") == 0 ? "a" : tcc_basename(files[0]);
11081 pstrcpy(objfilename, sizeof(objfilename), name);
11082 ext = tcc_fileextension(objfilename);
11083 #ifdef TCC_TARGET_PE
11084 if (output_type == TCC_OUTPUT_DLL)
11085 strcpy(ext, ".dll");
11086 else
11087 if (output_type == TCC_OUTPUT_EXE)
11088 strcpy(ext, ".exe");
11089 else
11090 #endif
11091 if (output_type == TCC_OUTPUT_OBJ && !reloc_output && *ext)
11092 strcpy(ext, ".o");
11093 else
11094 pstrcpy(objfilename, sizeof(objfilename), "a.out");
11095 outfile = objfilename;
11099 if (do_bench) {
11100 start_time = getclock_us();
11103 tcc_set_output_type(s, output_type);
11105 /* compile or add each files or library */
11106 for(i = 0; i < nb_files && ret == 0; i++) {
11107 const char *filename;
11109 filename = files[i];
11110 if (output_type == TCC_OUTPUT_PREPROCESS) {
11111 if (tcc_add_file_internal(s, filename,
11112 AFF_PRINT_ERROR | AFF_PREPROCESS) < 0)
11113 ret = 1;
11114 } else if (filename[0] == '-' && filename[1]) {
11115 if (tcc_add_library(s, filename + 2) < 0)
11116 error("cannot find %s", filename);
11117 } else {
11118 if (1 == verbose)
11119 printf("-> %s\n", filename);
11120 if (tcc_add_file(s, filename) < 0)
11121 ret = 1;
11125 /* free all files */
11126 tcc_free(files);
11128 if (ret)
11129 goto the_end;
11131 if (do_bench) {
11132 double total_time;
11133 total_time = (double)(getclock_us() - start_time) / 1000000.0;
11134 if (total_time < 0.001)
11135 total_time = 0.001;
11136 if (total_bytes < 1)
11137 total_bytes = 1;
11138 printf("%d idents, %d lines, %d bytes, %0.3f s, %d lines/s, %0.1f MB/s\n",
11139 tok_ident - TOK_IDENT, total_lines, total_bytes,
11140 total_time, (int)(total_lines / total_time),
11141 total_bytes / total_time / 1000000.0);
11144 if (s->output_type == TCC_OUTPUT_PREPROCESS) {
11145 if (outfile)
11146 fclose(s->outfile);
11147 } else if (s->output_type == TCC_OUTPUT_MEMORY) {
11148 ret = tcc_run(s, argc - optind, argv + optind);
11149 } else
11150 ret = tcc_output_file(s, outfile) ? 1 : 0;
11151 the_end:
11152 /* XXX: cannot do it with bound checking because of the malloc hooks */
11153 if (!do_bounds_check)
11154 tcc_delete(s);
11156 #ifdef MEM_DEBUG
11157 if (do_bench) {
11158 printf("memory: %d bytes, max = %d bytes\n", mem_cur_size, mem_max_size);
11160 #endif
11161 return ret;
11164 #endif