Rewrote casts
[tinycc/daniel.git] / tcc.c
blob6a0f0da2c4fed2761fd27b8629344a0edfa97a7c
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_CCHAR:
1774 case TOK_LCHAR:
1775 cstr_ccat(&cstr_buf, '\'');
1776 add_char(&cstr_buf, cv->i);
1777 cstr_ccat(&cstr_buf, '\'');
1778 cstr_ccat(&cstr_buf, '\0');
1779 break;
1780 case TOK_PPNUM:
1781 cstr = cv->cstr;
1782 len = cstr->size - 1;
1783 for(i=0;i<len;i++)
1784 add_char(&cstr_buf, ((unsigned char *)cstr->data)[i]);
1785 cstr_ccat(&cstr_buf, '\0');
1786 break;
1787 case TOK_STR:
1788 case TOK_LSTR:
1789 cstr = cv->cstr;
1790 cstr_ccat(&cstr_buf, '\"');
1791 if (v == TOK_STR) {
1792 len = cstr->size - 1;
1793 for(i=0;i<len;i++)
1794 add_char(&cstr_buf, ((unsigned char *)cstr->data)[i]);
1795 } else {
1796 len = (cstr->size / sizeof(nwchar_t)) - 1;
1797 for(i=0;i<len;i++)
1798 add_char(&cstr_buf, ((nwchar_t *)cstr->data)[i]);
1800 cstr_ccat(&cstr_buf, '\"');
1801 cstr_ccat(&cstr_buf, '\0');
1802 break;
1803 case TOK_LT:
1804 v = '<';
1805 goto addv;
1806 case TOK_GT:
1807 v = '>';
1808 goto addv;
1809 case TOK_DOTS:
1810 return strcpy(p, "...");
1811 case TOK_A_SHL:
1812 return strcpy(p, "<<=");
1813 case TOK_A_SAR:
1814 return strcpy(p, ">>=");
1815 default:
1816 if (v < TOK_IDENT) {
1817 /* search in two bytes table */
1818 q = tok_two_chars;
1819 while (*q) {
1820 if (q[2] == v) {
1821 *p++ = q[0];
1822 *p++ = q[1];
1823 *p = '\0';
1824 return buf;
1826 q += 3;
1828 addv:
1829 *p++ = v;
1830 *p = '\0';
1831 } else if (v < tok_ident) {
1832 return table_ident[v - TOK_IDENT]->str;
1833 } else if (v >= SYM_FIRST_ANOM) {
1834 /* special name for anonymous symbol */
1835 sprintf(p, "L.%u", v - SYM_FIRST_ANOM);
1836 } else {
1837 /* should never happen */
1838 return NULL;
1840 break;
1842 return cstr_buf.data;
1845 /* push, without hashing */
1846 static Sym *sym_push2(Sym **ps, int v, int t, int c)
1848 Sym *s;
1849 s = sym_malloc();
1850 s->v = v;
1851 s->type.t = t;
1852 s->c = c;
1853 s->next = NULL;
1854 /* add in stack */
1855 s->prev = *ps;
1856 *ps = s;
1857 return s;
1860 /* find a symbol and return its associated structure. 's' is the top
1861 of the symbol stack */
1862 static Sym *sym_find2(Sym *s, int v)
1864 while (s) {
1865 if (s->v == v)
1866 return s;
1867 s = s->prev;
1869 return NULL;
1872 /* structure lookup */
1873 static inline Sym *struct_find(int v)
1875 v -= TOK_IDENT;
1876 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
1877 return NULL;
1878 return table_ident[v]->sym_struct;
1881 /* find an identifier */
1882 static inline Sym *sym_find(int v)
1884 v -= TOK_IDENT;
1885 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
1886 return NULL;
1887 return table_ident[v]->sym_identifier;
1890 /* push a given symbol on the symbol stack */
1891 static Sym *sym_push(int v, CType *type, int r, int c)
1893 Sym *s, **ps;
1894 TokenSym *ts;
1896 if (local_stack)
1897 ps = &local_stack;
1898 else
1899 ps = &global_stack;
1900 s = sym_push2(ps, v, type->t, c);
1901 s->type.ref = type->ref;
1902 s->r = r;
1903 /* don't record fields or anonymous symbols */
1904 /* XXX: simplify */
1905 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
1906 /* record symbol in token array */
1907 ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT];
1908 if (v & SYM_STRUCT)
1909 ps = &ts->sym_struct;
1910 else
1911 ps = &ts->sym_identifier;
1912 s->prev_tok = *ps;
1913 *ps = s;
1915 return s;
1918 /* push a global identifier */
1919 static Sym *global_identifier_push(int v, int t, int c)
1921 Sym *s, **ps;
1922 s = sym_push2(&global_stack, v, t, c);
1923 /* don't record anonymous symbol */
1924 if (v < SYM_FIRST_ANOM) {
1925 ps = &table_ident[v - TOK_IDENT]->sym_identifier;
1926 /* modify the top most local identifier, so that
1927 sym_identifier will point to 's' when popped */
1928 while (*ps != NULL)
1929 ps = &(*ps)->prev_tok;
1930 s->prev_tok = NULL;
1931 *ps = s;
1933 return s;
1936 /* pop symbols until top reaches 'b' */
1937 static void sym_pop(Sym **ptop, Sym *b)
1939 Sym *s, *ss, **ps;
1940 TokenSym *ts;
1941 int v;
1943 s = *ptop;
1944 while(s != b) {
1945 ss = s->prev;
1946 v = s->v;
1947 /* remove symbol in token array */
1948 /* XXX: simplify */
1949 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
1950 ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT];
1951 if (v & SYM_STRUCT)
1952 ps = &ts->sym_struct;
1953 else
1954 ps = &ts->sym_identifier;
1955 *ps = s->prev_tok;
1957 sym_free(s);
1958 s = ss;
1960 *ptop = b;
1963 /* I/O layer */
1965 BufferedFile *tcc_open(TCCState *s1, const char *filename)
1967 int fd;
1968 BufferedFile *bf;
1970 if (strcmp(filename, "-") == 0)
1971 fd = 0, filename = "stdin";
1972 else
1973 fd = open(filename, O_RDONLY | O_BINARY);
1974 if ((verbose == 2 && fd >= 0) || verbose == 3)
1975 printf("%s %*s%s\n", fd < 0 ? "nf":"->",
1976 (s1->include_stack_ptr - s1->include_stack), "", filename);
1977 if (fd < 0)
1978 return NULL;
1979 bf = tcc_malloc(sizeof(BufferedFile));
1980 bf->fd = fd;
1981 bf->buf_ptr = bf->buffer;
1982 bf->buf_end = bf->buffer;
1983 bf->buffer[0] = CH_EOB; /* put eob symbol */
1984 pstrcpy(bf->filename, sizeof(bf->filename), filename);
1985 #ifdef _WIN32
1986 normalize_slashes(bf->filename);
1987 #endif
1988 bf->line_num = 1;
1989 bf->ifndef_macro = 0;
1990 bf->ifdef_stack_ptr = s1->ifdef_stack_ptr;
1991 // printf("opening '%s'\n", filename);
1992 return bf;
1995 void tcc_close(BufferedFile *bf)
1997 total_lines += bf->line_num;
1998 close(bf->fd);
1999 tcc_free(bf);
2002 /* fill input buffer and peek next char */
2003 static int tcc_peekc_slow(BufferedFile *bf)
2005 int len;
2006 /* only tries to read if really end of buffer */
2007 if (bf->buf_ptr >= bf->buf_end) {
2008 if (bf->fd != -1) {
2009 #if defined(PARSE_DEBUG)
2010 len = 8;
2011 #else
2012 len = IO_BUF_SIZE;
2013 #endif
2014 len = read(bf->fd, bf->buffer, len);
2015 if (len < 0)
2016 len = 0;
2017 } else {
2018 len = 0;
2020 total_bytes += len;
2021 bf->buf_ptr = bf->buffer;
2022 bf->buf_end = bf->buffer + len;
2023 *bf->buf_end = CH_EOB;
2025 if (bf->buf_ptr < bf->buf_end) {
2026 return bf->buf_ptr[0];
2027 } else {
2028 bf->buf_ptr = bf->buf_end;
2029 return CH_EOF;
2033 /* return the current character, handling end of block if necessary
2034 (but not stray) */
2035 static int handle_eob(void)
2037 return tcc_peekc_slow(file);
2040 /* read next char from current input file and handle end of input buffer */
2041 static inline void inp(void)
2043 ch = *(++(file->buf_ptr));
2044 /* end of buffer/file handling */
2045 if (ch == CH_EOB)
2046 ch = handle_eob();
2049 /* handle '\[\r]\n' */
2050 static int handle_stray_noerror(void)
2052 while (ch == '\\') {
2053 inp();
2054 if (ch == '\n') {
2055 file->line_num++;
2056 inp();
2057 } else if (ch == '\r') {
2058 inp();
2059 if (ch != '\n')
2060 goto fail;
2061 file->line_num++;
2062 inp();
2063 } else {
2064 fail:
2065 return 1;
2068 return 0;
2071 static void handle_stray(void)
2073 if (handle_stray_noerror())
2074 error("stray '\\' in program");
2077 /* skip the stray and handle the \\n case. Output an error if
2078 incorrect char after the stray */
2079 static int handle_stray1(uint8_t *p)
2081 int c;
2083 if (p >= file->buf_end) {
2084 file->buf_ptr = p;
2085 c = handle_eob();
2086 p = file->buf_ptr;
2087 if (c == '\\')
2088 goto parse_stray;
2089 } else {
2090 parse_stray:
2091 file->buf_ptr = p;
2092 ch = *p;
2093 handle_stray();
2094 p = file->buf_ptr;
2095 c = *p;
2097 return c;
2100 /* handle just the EOB case, but not stray */
2101 #define PEEKC_EOB(c, p)\
2103 p++;\
2104 c = *p;\
2105 if (c == '\\') {\
2106 file->buf_ptr = p;\
2107 c = handle_eob();\
2108 p = file->buf_ptr;\
2112 /* handle the complicated stray case */
2113 #define PEEKC(c, p)\
2115 p++;\
2116 c = *p;\
2117 if (c == '\\') {\
2118 c = handle_stray1(p);\
2119 p = file->buf_ptr;\
2123 /* input with '\[\r]\n' handling. Note that this function cannot
2124 handle other characters after '\', so you cannot call it inside
2125 strings or comments */
2126 static void minp(void)
2128 inp();
2129 if (ch == '\\')
2130 handle_stray();
2134 /* single line C++ comments */
2135 static uint8_t *parse_line_comment(uint8_t *p)
2137 int c;
2139 p++;
2140 for(;;) {
2141 c = *p;
2142 redo:
2143 if (c == '\n' || c == CH_EOF) {
2144 break;
2145 } else if (c == '\\') {
2146 file->buf_ptr = p;
2147 c = handle_eob();
2148 p = file->buf_ptr;
2149 if (c == '\\') {
2150 PEEKC_EOB(c, p);
2151 if (c == '\n') {
2152 file->line_num++;
2153 PEEKC_EOB(c, p);
2154 } else if (c == '\r') {
2155 PEEKC_EOB(c, p);
2156 if (c == '\n') {
2157 file->line_num++;
2158 PEEKC_EOB(c, p);
2161 } else {
2162 goto redo;
2164 } else {
2165 p++;
2168 return p;
2171 /* C comments */
2172 static uint8_t *parse_comment(uint8_t *p)
2174 int c;
2176 p++;
2177 for(;;) {
2178 /* fast skip loop */
2179 for(;;) {
2180 c = *p;
2181 if (c == '\n' || c == '*' || c == '\\')
2182 break;
2183 p++;
2184 c = *p;
2185 if (c == '\n' || c == '*' || c == '\\')
2186 break;
2187 p++;
2189 /* now we can handle all the cases */
2190 if (c == '\n') {
2191 file->line_num++;
2192 p++;
2193 } else if (c == '*') {
2194 p++;
2195 for(;;) {
2196 c = *p;
2197 if (c == '*') {
2198 p++;
2199 } else if (c == '/') {
2200 goto end_of_comment;
2201 } else if (c == '\\') {
2202 file->buf_ptr = p;
2203 c = handle_eob();
2204 p = file->buf_ptr;
2205 if (c == '\\') {
2206 /* skip '\[\r]\n', otherwise just skip the stray */
2207 while (c == '\\') {
2208 PEEKC_EOB(c, p);
2209 if (c == '\n') {
2210 file->line_num++;
2211 PEEKC_EOB(c, p);
2212 } else if (c == '\r') {
2213 PEEKC_EOB(c, p);
2214 if (c == '\n') {
2215 file->line_num++;
2216 PEEKC_EOB(c, p);
2218 } else {
2219 goto after_star;
2223 } else {
2224 break;
2227 after_star: ;
2228 } else {
2229 /* stray, eob or eof */
2230 file->buf_ptr = p;
2231 c = handle_eob();
2232 p = file->buf_ptr;
2233 if (c == CH_EOF) {
2234 error("unexpected end of file in comment");
2235 } else if (c == '\\') {
2236 p++;
2240 end_of_comment:
2241 p++;
2242 return p;
2245 #define cinp minp
2247 /* space exlcuding newline */
2248 static inline int is_space(int ch)
2250 return ch == ' ' || ch == '\t' || ch == '\v' || ch == '\f' || ch == '\r';
2253 static inline void skip_spaces(void)
2255 while (is_space(ch))
2256 cinp();
2259 /* parse a string without interpreting escapes */
2260 static uint8_t *parse_pp_string(uint8_t *p,
2261 int sep, CString *str)
2263 int c;
2264 p++;
2265 for(;;) {
2266 c = *p;
2267 if (c == sep) {
2268 break;
2269 } else if (c == '\\') {
2270 file->buf_ptr = p;
2271 c = handle_eob();
2272 p = file->buf_ptr;
2273 if (c == CH_EOF) {
2274 unterminated_string:
2275 /* XXX: indicate line number of start of string */
2276 error("missing terminating %c character", sep);
2277 } else if (c == '\\') {
2278 /* escape : just skip \[\r]\n */
2279 PEEKC_EOB(c, p);
2280 if (c == '\n') {
2281 file->line_num++;
2282 p++;
2283 } else if (c == '\r') {
2284 PEEKC_EOB(c, p);
2285 if (c != '\n')
2286 expect("'\n' after '\r'");
2287 file->line_num++;
2288 p++;
2289 } else if (c == CH_EOF) {
2290 goto unterminated_string;
2291 } else {
2292 if (str) {
2293 cstr_ccat(str, '\\');
2294 cstr_ccat(str, c);
2296 p++;
2299 } else if (c == '\n') {
2300 file->line_num++;
2301 goto add_char;
2302 } else if (c == '\r') {
2303 PEEKC_EOB(c, p);
2304 if (c != '\n') {
2305 if (str)
2306 cstr_ccat(str, '\r');
2307 } else {
2308 file->line_num++;
2309 goto add_char;
2311 } else {
2312 add_char:
2313 if (str)
2314 cstr_ccat(str, c);
2315 p++;
2318 p++;
2319 return p;
2322 /* skip block of text until #else, #elif or #endif. skip also pairs of
2323 #if/#endif */
2324 void preprocess_skip(void)
2326 int a, start_of_line, c, in_warn_or_error;
2327 uint8_t *p;
2329 p = file->buf_ptr;
2330 a = 0;
2331 redo_start:
2332 start_of_line = 1;
2333 in_warn_or_error = 0;
2334 for(;;) {
2335 redo_no_start:
2336 c = *p;
2337 switch(c) {
2338 case ' ':
2339 case '\t':
2340 case '\f':
2341 case '\v':
2342 case '\r':
2343 p++;
2344 goto redo_no_start;
2345 case '\n':
2346 file->line_num++;
2347 p++;
2348 goto redo_start;
2349 case '\\':
2350 file->buf_ptr = p;
2351 c = handle_eob();
2352 if (c == CH_EOF) {
2353 expect("#endif");
2354 } else if (c == '\\') {
2355 ch = file->buf_ptr[0];
2356 handle_stray_noerror();
2358 p = file->buf_ptr;
2359 goto redo_no_start;
2360 /* skip strings */
2361 case '\"':
2362 case '\'':
2363 if (in_warn_or_error)
2364 goto _default;
2365 p = parse_pp_string(p, c, NULL);
2366 break;
2367 /* skip comments */
2368 case '/':
2369 if (in_warn_or_error)
2370 goto _default;
2371 file->buf_ptr = p;
2372 ch = *p;
2373 minp();
2374 p = file->buf_ptr;
2375 if (ch == '*') {
2376 p = parse_comment(p);
2377 } else if (ch == '/') {
2378 p = parse_line_comment(p);
2380 break;
2381 case '#':
2382 p++;
2383 if (start_of_line) {
2384 file->buf_ptr = p;
2385 next_nomacro();
2386 p = file->buf_ptr;
2387 if (a == 0 &&
2388 (tok == TOK_ELSE || tok == TOK_ELIF || tok == TOK_ENDIF))
2389 goto the_end;
2390 if (tok == TOK_IF || tok == TOK_IFDEF || tok == TOK_IFNDEF)
2391 a++;
2392 else if (tok == TOK_ENDIF)
2393 a--;
2394 else if( tok == TOK_ERROR || tok == TOK_WARNING)
2395 in_warn_or_error = 1;
2397 break;
2398 _default:
2399 default:
2400 p++;
2401 break;
2403 start_of_line = 0;
2405 the_end: ;
2406 file->buf_ptr = p;
2409 /* ParseState handling */
2411 /* XXX: currently, no include file info is stored. Thus, we cannot display
2412 accurate messages if the function or data definition spans multiple
2413 files */
2415 /* save current parse state in 's' */
2416 void save_parse_state(ParseState *s)
2418 s->line_num = file->line_num;
2419 s->macro_ptr = macro_ptr;
2420 s->tok = tok;
2421 s->tokc = tokc;
2424 /* restore parse state from 's' */
2425 void restore_parse_state(ParseState *s)
2427 file->line_num = s->line_num;
2428 macro_ptr = s->macro_ptr;
2429 tok = s->tok;
2430 tokc = s->tokc;
2433 /* return the number of additional 'ints' necessary to store the
2434 token */
2435 static inline int tok_ext_size(int t)
2437 switch(t) {
2438 /* 4 bytes */
2439 case TOK_CINT:
2440 case TOK_CUINT:
2441 case TOK_CCHAR:
2442 case TOK_LCHAR:
2443 case TOK_CFLOAT:
2444 case TOK_LINENUM:
2445 return 1;
2446 case TOK_STR:
2447 case TOK_LSTR:
2448 case TOK_PPNUM:
2449 error("unsupported token");
2450 return 1;
2451 case TOK_CDOUBLE:
2452 case TOK_CLLONG:
2453 case TOK_CULLONG:
2454 return 2;
2455 case TOK_CLDOUBLE:
2456 return LDOUBLE_SIZE / 4;
2457 default:
2458 return 0;
2462 /* token string handling */
2464 static inline void tok_str_new(TokenString *s)
2466 s->str = NULL;
2467 s->len = 0;
2468 s->allocated_len = 0;
2469 s->last_line_num = -1;
2472 static void tok_str_free(int *str)
2474 tcc_free(str);
2477 static int *tok_str_realloc(TokenString *s)
2479 int *str, len;
2481 if (s->allocated_len == 0) {
2482 len = 8;
2483 } else {
2484 len = s->allocated_len * 2;
2486 str = tcc_realloc(s->str, len * sizeof(int));
2487 if (!str)
2488 error("memory full");
2489 s->allocated_len = len;
2490 s->str = str;
2491 return str;
2494 static void tok_str_add(TokenString *s, int t)
2496 int len, *str;
2498 len = s->len;
2499 str = s->str;
2500 if (len >= s->allocated_len)
2501 str = tok_str_realloc(s);
2502 str[len++] = t;
2503 s->len = len;
2506 static void tok_str_add2(TokenString *s, int t, CValue *cv)
2508 int len, *str;
2510 len = s->len;
2511 str = s->str;
2513 /* allocate space for worst case */
2514 if (len + TOK_MAX_SIZE > s->allocated_len)
2515 str = tok_str_realloc(s);
2516 str[len++] = t;
2517 switch(t) {
2518 case TOK_CINT:
2519 case TOK_CUINT:
2520 case TOK_CCHAR:
2521 case TOK_LCHAR:
2522 case TOK_CFLOAT:
2523 case TOK_LINENUM:
2524 str[len++] = cv->tab[0];
2525 break;
2526 case TOK_PPNUM:
2527 case TOK_STR:
2528 case TOK_LSTR:
2530 int nb_words;
2531 CString *cstr;
2533 nb_words = (sizeof(CString) + cv->cstr->size + 3) >> 2;
2534 while ((len + nb_words) > s->allocated_len)
2535 str = tok_str_realloc(s);
2536 cstr = (CString *)(str + len);
2537 cstr->data = NULL;
2538 cstr->size = cv->cstr->size;
2539 cstr->data_allocated = NULL;
2540 cstr->size_allocated = cstr->size;
2541 memcpy((char *)cstr + sizeof(CString),
2542 cv->cstr->data, cstr->size);
2543 len += nb_words;
2545 break;
2546 case TOK_CDOUBLE:
2547 case TOK_CLLONG:
2548 case TOK_CULLONG:
2549 #if LDOUBLE_SIZE == 8
2550 case TOK_CLDOUBLE:
2551 #endif
2552 str[len++] = cv->tab[0];
2553 str[len++] = cv->tab[1];
2554 break;
2555 #if LDOUBLE_SIZE == 12
2556 case TOK_CLDOUBLE:
2557 str[len++] = cv->tab[0];
2558 str[len++] = cv->tab[1];
2559 str[len++] = cv->tab[2];
2560 #elif LDOUBLE_SIZE != 8
2561 #error add long double size support
2562 #endif
2563 break;
2564 default:
2565 break;
2567 s->len = len;
2570 /* add the current parse token in token string 's' */
2571 static void tok_str_add_tok(TokenString *s)
2573 CValue cval;
2575 /* save line number info */
2576 if (file->line_num != s->last_line_num) {
2577 s->last_line_num = file->line_num;
2578 cval.i = s->last_line_num;
2579 tok_str_add2(s, TOK_LINENUM, &cval);
2581 tok_str_add2(s, tok, &tokc);
2584 #if LDOUBLE_SIZE == 12
2585 #define LDOUBLE_GET(p, cv) \
2586 cv.tab[0] = p[0]; \
2587 cv.tab[1] = p[1]; \
2588 cv.tab[2] = p[2];
2589 #elif LDOUBLE_SIZE == 8
2590 #define LDOUBLE_GET(p, cv) \
2591 cv.tab[0] = p[0]; \
2592 cv.tab[1] = p[1];
2593 #else
2594 #error add long double size support
2595 #endif
2598 /* get a token from an integer array and increment pointer
2599 accordingly. we code it as a macro to avoid pointer aliasing. */
2600 #define TOK_GET(t, p, cv) \
2602 t = *p++; \
2603 switch(t) { \
2604 case TOK_CINT: \
2605 case TOK_CUINT: \
2606 case TOK_CCHAR: \
2607 case TOK_LCHAR: \
2608 case TOK_CFLOAT: \
2609 case TOK_LINENUM: \
2610 cv.tab[0] = *p++; \
2611 break; \
2612 case TOK_STR: \
2613 case TOK_LSTR: \
2614 case TOK_PPNUM: \
2615 cv.cstr = (CString *)p; \
2616 cv.cstr->data = (char *)p + sizeof(CString);\
2617 p += (sizeof(CString) + cv.cstr->size + 3) >> 2;\
2618 break; \
2619 case TOK_CDOUBLE: \
2620 case TOK_CLLONG: \
2621 case TOK_CULLONG: \
2622 cv.tab[0] = p[0]; \
2623 cv.tab[1] = p[1]; \
2624 p += 2; \
2625 break; \
2626 case TOK_CLDOUBLE: \
2627 LDOUBLE_GET(p, cv); \
2628 p += LDOUBLE_SIZE / 4; \
2629 break; \
2630 default: \
2631 break; \
2635 /* defines handling */
2636 static inline void define_push(int v, int macro_type, int *str, Sym *first_arg)
2638 Sym *s;
2640 s = sym_push2(&define_stack, v, macro_type, (int)str);
2641 s->next = first_arg;
2642 table_ident[v - TOK_IDENT]->sym_define = s;
2645 /* undefined a define symbol. Its name is just set to zero */
2646 static void define_undef(Sym *s)
2648 int v;
2649 v = s->v;
2650 if (v >= TOK_IDENT && v < tok_ident)
2651 table_ident[v - TOK_IDENT]->sym_define = NULL;
2652 s->v = 0;
2655 static inline Sym *define_find(int v)
2657 v -= TOK_IDENT;
2658 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
2659 return NULL;
2660 return table_ident[v]->sym_define;
2663 /* free define stack until top reaches 'b' */
2664 static void free_defines(Sym *b)
2666 Sym *top, *top1;
2667 int v;
2669 top = define_stack;
2670 while (top != b) {
2671 top1 = top->prev;
2672 /* do not free args or predefined defines */
2673 if (top->c)
2674 tok_str_free((int *)top->c);
2675 v = top->v;
2676 if (v >= TOK_IDENT && v < tok_ident)
2677 table_ident[v - TOK_IDENT]->sym_define = NULL;
2678 sym_free(top);
2679 top = top1;
2681 define_stack = b;
2684 /* label lookup */
2685 static Sym *label_find(int v)
2687 v -= TOK_IDENT;
2688 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
2689 return NULL;
2690 return table_ident[v]->sym_label;
2693 static Sym *label_push(Sym **ptop, int v, int flags)
2695 Sym *s, **ps;
2696 s = sym_push2(ptop, v, 0, 0);
2697 s->r = flags;
2698 ps = &table_ident[v - TOK_IDENT]->sym_label;
2699 if (ptop == &global_label_stack) {
2700 /* modify the top most local identifier, so that
2701 sym_identifier will point to 's' when popped */
2702 while (*ps != NULL)
2703 ps = &(*ps)->prev_tok;
2705 s->prev_tok = *ps;
2706 *ps = s;
2707 return s;
2710 /* pop labels until element last is reached. Look if any labels are
2711 undefined. Define symbols if '&&label' was used. */
2712 static void label_pop(Sym **ptop, Sym *slast)
2714 Sym *s, *s1;
2715 for(s = *ptop; s != slast; s = s1) {
2716 s1 = s->prev;
2717 if (s->r == LABEL_DECLARED) {
2718 warning("label '%s' declared but not used", get_tok_str(s->v, NULL));
2719 } else if (s->r == LABEL_FORWARD) {
2720 error("label '%s' used but not defined",
2721 get_tok_str(s->v, NULL));
2722 } else {
2723 if (s->c) {
2724 /* define corresponding symbol. A size of
2725 1 is put. */
2726 put_extern_sym(s, cur_text_section, (long)s->next, 1);
2729 /* remove label */
2730 table_ident[s->v - TOK_IDENT]->sym_label = s->prev_tok;
2731 sym_free(s);
2733 *ptop = slast;
2736 /* eval an expression for #if/#elif */
2737 static int expr_preprocess(void)
2739 int c, t;
2740 TokenString str;
2742 tok_str_new(&str);
2743 while (tok != TOK_LINEFEED && tok != TOK_EOF) {
2744 next(); /* do macro subst */
2745 if (tok == TOK_DEFINED) {
2746 next_nomacro();
2747 t = tok;
2748 if (t == '(')
2749 next_nomacro();
2750 c = define_find(tok) != 0;
2751 if (t == '(')
2752 next_nomacro();
2753 tok = TOK_CINT;
2754 tokc.i = c;
2755 } else if (tok >= TOK_IDENT) {
2756 /* if undefined macro */
2757 tok = TOK_CINT;
2758 tokc.i = 0;
2760 tok_str_add_tok(&str);
2762 tok_str_add(&str, -1); /* simulate end of file */
2763 tok_str_add(&str, 0);
2764 /* now evaluate C constant expression */
2765 macro_ptr = str.str;
2766 next();
2767 c = expr_const();
2768 macro_ptr = NULL;
2769 tok_str_free(str.str);
2770 return c != 0;
2773 #if defined(PARSE_DEBUG) || defined(PP_DEBUG)
2774 static void tok_print(int *str)
2776 int t;
2777 CValue cval;
2779 while (1) {
2780 TOK_GET(t, str, cval);
2781 if (!t)
2782 break;
2783 printf(" %s", get_tok_str(t, &cval));
2785 printf("\n");
2787 #endif
2789 /* parse after #define */
2790 static void parse_define(void)
2792 Sym *s, *first, **ps;
2793 int v, t, varg, is_vaargs, c;
2794 TokenString str;
2796 v = tok;
2797 if (v < TOK_IDENT)
2798 error("invalid macro name '%s'", get_tok_str(tok, &tokc));
2799 /* XXX: should check if same macro (ANSI) */
2800 first = NULL;
2801 t = MACRO_OBJ;
2802 /* '(' must be just after macro definition for MACRO_FUNC */
2803 c = file->buf_ptr[0];
2804 if (c == '\\')
2805 c = handle_stray1(file->buf_ptr);
2806 if (c == '(') {
2807 next_nomacro();
2808 next_nomacro();
2809 ps = &first;
2810 while (tok != ')') {
2811 varg = tok;
2812 next_nomacro();
2813 is_vaargs = 0;
2814 if (varg == TOK_DOTS) {
2815 varg = TOK___VA_ARGS__;
2816 is_vaargs = 1;
2817 } else if (tok == TOK_DOTS && gnu_ext) {
2818 is_vaargs = 1;
2819 next_nomacro();
2821 if (varg < TOK_IDENT)
2822 error("badly punctuated parameter list");
2823 s = sym_push2(&define_stack, varg | SYM_FIELD, is_vaargs, 0);
2824 *ps = s;
2825 ps = &s->next;
2826 if (tok != ',')
2827 break;
2828 next_nomacro();
2830 t = MACRO_FUNC;
2832 tok_str_new(&str);
2833 next_nomacro();
2834 /* EOF testing necessary for '-D' handling */
2835 while (tok != TOK_LINEFEED && tok != TOK_EOF) {
2836 tok_str_add2(&str, tok, &tokc);
2837 next_nomacro();
2839 tok_str_add(&str, 0);
2840 #ifdef PP_DEBUG
2841 printf("define %s %d: ", get_tok_str(v, NULL), t);
2842 tok_print(str.str);
2843 #endif
2844 define_push(v, t, str.str, first);
2847 static inline int hash_cached_include(int type, const char *filename)
2849 const unsigned char *s;
2850 unsigned int h;
2852 h = TOK_HASH_INIT;
2853 h = TOK_HASH_FUNC(h, type);
2854 s = filename;
2855 while (*s) {
2856 h = TOK_HASH_FUNC(h, *s);
2857 s++;
2859 h &= (CACHED_INCLUDES_HASH_SIZE - 1);
2860 return h;
2863 /* XXX: use a token or a hash table to accelerate matching ? */
2864 static CachedInclude *search_cached_include(TCCState *s1,
2865 int type, const char *filename)
2867 CachedInclude *e;
2868 int i, h;
2869 h = hash_cached_include(type, filename);
2870 i = s1->cached_includes_hash[h];
2871 for(;;) {
2872 if (i == 0)
2873 break;
2874 e = s1->cached_includes[i - 1];
2875 if (e->type == type && !strcmp(e->filename, filename))
2876 return e;
2877 i = e->hash_next;
2879 return NULL;
2882 static inline void add_cached_include(TCCState *s1, int type,
2883 const char *filename, int ifndef_macro)
2885 CachedInclude *e;
2886 int h;
2888 if (search_cached_include(s1, type, filename))
2889 return;
2890 #ifdef INC_DEBUG
2891 printf("adding cached '%s' %s\n", filename, get_tok_str(ifndef_macro, NULL));
2892 #endif
2893 e = tcc_malloc(sizeof(CachedInclude) + strlen(filename));
2894 if (!e)
2895 return;
2896 e->type = type;
2897 strcpy(e->filename, filename);
2898 e->ifndef_macro = ifndef_macro;
2899 dynarray_add((void ***)&s1->cached_includes, &s1->nb_cached_includes, e);
2900 /* add in hash table */
2901 h = hash_cached_include(type, filename);
2902 e->hash_next = s1->cached_includes_hash[h];
2903 s1->cached_includes_hash[h] = s1->nb_cached_includes;
2906 static void pragma_parse(TCCState *s1)
2908 int val;
2910 next();
2911 if (tok == TOK_pack) {
2913 This may be:
2914 #pragma pack(1) // set
2915 #pragma pack() // reset to default
2916 #pragma pack(push,1) // push & set
2917 #pragma pack(pop) // restore previous
2919 next();
2920 skip('(');
2921 if (tok == TOK_ASM_pop) {
2922 next();
2923 if (s1->pack_stack_ptr <= s1->pack_stack) {
2924 stk_error:
2925 error("out of pack stack");
2927 s1->pack_stack_ptr--;
2928 } else {
2929 val = 0;
2930 if (tok != ')') {
2931 if (tok == TOK_ASM_push) {
2932 next();
2933 if (s1->pack_stack_ptr >= s1->pack_stack + PACK_STACK_SIZE - 1)
2934 goto stk_error;
2935 s1->pack_stack_ptr++;
2936 skip(',');
2938 if (tok != TOK_CINT) {
2939 pack_error:
2940 error("invalid pack pragma");
2942 val = tokc.i;
2943 if (val < 1 || val > 16 || (val & (val - 1)) != 0)
2944 goto pack_error;
2945 next();
2947 *s1->pack_stack_ptr = val;
2948 skip(')');
2953 /* is_bof is true if first non space token at beginning of file */
2954 static void preprocess(int is_bof)
2956 TCCState *s1 = tcc_state;
2957 int size, i, c, n, saved_parse_flags;
2958 char buf[1024], *q;
2959 char buf1[1024];
2960 BufferedFile *f;
2961 Sym *s;
2962 CachedInclude *e;
2964 saved_parse_flags = parse_flags;
2965 parse_flags = PARSE_FLAG_PREPROCESS | PARSE_FLAG_TOK_NUM |
2966 PARSE_FLAG_LINEFEED;
2967 next_nomacro();
2968 redo:
2969 switch(tok) {
2970 case TOK_DEFINE:
2971 next_nomacro();
2972 parse_define();
2973 break;
2974 case TOK_UNDEF:
2975 next_nomacro();
2976 s = define_find(tok);
2977 /* undefine symbol by putting an invalid name */
2978 if (s)
2979 define_undef(s);
2980 break;
2981 case TOK_INCLUDE:
2982 case TOK_INCLUDE_NEXT:
2983 ch = file->buf_ptr[0];
2984 /* XXX: incorrect if comments : use next_nomacro with a special mode */
2985 skip_spaces();
2986 if (ch == '<') {
2987 c = '>';
2988 goto read_name;
2989 } else if (ch == '\"') {
2990 c = ch;
2991 read_name:
2992 inp();
2993 q = buf;
2994 while (ch != c && ch != '\n' && ch != CH_EOF) {
2995 if ((q - buf) < sizeof(buf) - 1)
2996 *q++ = ch;
2997 if (ch == '\\') {
2998 if (handle_stray_noerror() == 0)
2999 --q;
3000 } else
3001 inp();
3003 *q = '\0';
3004 minp();
3005 #if 0
3006 /* eat all spaces and comments after include */
3007 /* XXX: slightly incorrect */
3008 while (ch1 != '\n' && ch1 != CH_EOF)
3009 inp();
3010 #endif
3011 } else {
3012 /* computed #include : either we have only strings or
3013 we have anything enclosed in '<>' */
3014 next();
3015 buf[0] = '\0';
3016 if (tok == TOK_STR) {
3017 while (tok != TOK_LINEFEED) {
3018 if (tok != TOK_STR) {
3019 include_syntax:
3020 error("'#include' expects \"FILENAME\" or <FILENAME>");
3022 pstrcat(buf, sizeof(buf), (char *)tokc.cstr->data);
3023 next();
3025 c = '\"';
3026 } else {
3027 int len;
3028 while (tok != TOK_LINEFEED) {
3029 pstrcat(buf, sizeof(buf), get_tok_str(tok, &tokc));
3030 next();
3032 len = strlen(buf);
3033 /* check syntax and remove '<>' */
3034 if (len < 2 || buf[0] != '<' || buf[len - 1] != '>')
3035 goto include_syntax;
3036 memmove(buf, buf + 1, len - 2);
3037 buf[len - 2] = '\0';
3038 c = '>';
3042 e = search_cached_include(s1, c, buf);
3043 if (e && define_find(e->ifndef_macro)) {
3044 /* no need to parse the include because the 'ifndef macro'
3045 is defined */
3046 #ifdef INC_DEBUG
3047 printf("%s: skipping %s\n", file->filename, buf);
3048 #endif
3049 } else {
3050 if (s1->include_stack_ptr >= s1->include_stack + INCLUDE_STACK_SIZE)
3051 error("#include recursion too deep");
3052 /* push current file in stack */
3053 /* XXX: fix current line init */
3054 *s1->include_stack_ptr++ = file;
3055 if (c == '\"') {
3056 /* first search in current dir if "header.h" */
3057 size = tcc_basename(file->filename) - file->filename;
3058 if (size > sizeof(buf1) - 1)
3059 size = sizeof(buf1) - 1;
3060 memcpy(buf1, file->filename, size);
3061 buf1[size] = '\0';
3062 pstrcat(buf1, sizeof(buf1), buf);
3063 f = tcc_open(s1, buf1);
3064 if (f) {
3065 if (tok == TOK_INCLUDE_NEXT)
3066 tok = TOK_INCLUDE;
3067 else
3068 goto found;
3071 /* now search in all the include paths */
3072 n = s1->nb_include_paths + s1->nb_sysinclude_paths;
3073 for(i = 0; i < n; i++) {
3074 const char *path;
3075 if (i < s1->nb_include_paths)
3076 path = s1->include_paths[i];
3077 else
3078 path = s1->sysinclude_paths[i - s1->nb_include_paths];
3079 pstrcpy(buf1, sizeof(buf1), path);
3080 pstrcat(buf1, sizeof(buf1), "/");
3081 pstrcat(buf1, sizeof(buf1), buf);
3082 f = tcc_open(s1, buf1);
3083 if (f) {
3084 if (tok == TOK_INCLUDE_NEXT)
3085 tok = TOK_INCLUDE;
3086 else
3087 goto found;
3090 --s1->include_stack_ptr;
3091 error("include file '%s' not found", buf);
3092 break;
3093 found:
3094 #ifdef INC_DEBUG
3095 printf("%s: including %s\n", file->filename, buf1);
3096 #endif
3097 f->inc_type = c;
3098 pstrcpy(f->inc_filename, sizeof(f->inc_filename), buf);
3099 file = f;
3100 /* add include file debug info */
3101 if (do_debug) {
3102 put_stabs(file->filename, N_BINCL, 0, 0, 0);
3104 tok_flags |= TOK_FLAG_BOF | TOK_FLAG_BOL;
3105 ch = file->buf_ptr[0];
3106 goto the_end;
3108 break;
3109 case TOK_IFNDEF:
3110 c = 1;
3111 goto do_ifdef;
3112 case TOK_IF:
3113 c = expr_preprocess();
3114 goto do_if;
3115 case TOK_IFDEF:
3116 c = 0;
3117 do_ifdef:
3118 next_nomacro();
3119 if (tok < TOK_IDENT)
3120 error("invalid argument for '#if%sdef'", c ? "n" : "");
3121 if (is_bof) {
3122 if (c) {
3123 #ifdef INC_DEBUG
3124 printf("#ifndef %s\n", get_tok_str(tok, NULL));
3125 #endif
3126 file->ifndef_macro = tok;
3129 c = (define_find(tok) != 0) ^ c;
3130 do_if:
3131 if (s1->ifdef_stack_ptr >= s1->ifdef_stack + IFDEF_STACK_SIZE)
3132 error("memory full");
3133 *s1->ifdef_stack_ptr++ = c;
3134 goto test_skip;
3135 case TOK_ELSE:
3136 if (s1->ifdef_stack_ptr == s1->ifdef_stack)
3137 error("#else without matching #if");
3138 if (s1->ifdef_stack_ptr[-1] & 2)
3139 error("#else after #else");
3140 c = (s1->ifdef_stack_ptr[-1] ^= 3);
3141 goto test_skip;
3142 case TOK_ELIF:
3143 if (s1->ifdef_stack_ptr == s1->ifdef_stack)
3144 error("#elif without matching #if");
3145 c = s1->ifdef_stack_ptr[-1];
3146 if (c > 1)
3147 error("#elif after #else");
3148 /* last #if/#elif expression was true: we skip */
3149 if (c == 1)
3150 goto skip;
3151 c = expr_preprocess();
3152 s1->ifdef_stack_ptr[-1] = c;
3153 test_skip:
3154 if (!(c & 1)) {
3155 skip:
3156 preprocess_skip();
3157 is_bof = 0;
3158 goto redo;
3160 break;
3161 case TOK_ENDIF:
3162 if (s1->ifdef_stack_ptr <= file->ifdef_stack_ptr)
3163 error("#endif without matching #if");
3164 s1->ifdef_stack_ptr--;
3165 /* '#ifndef macro' was at the start of file. Now we check if
3166 an '#endif' is exactly at the end of file */
3167 if (file->ifndef_macro &&
3168 s1->ifdef_stack_ptr == file->ifdef_stack_ptr) {
3169 file->ifndef_macro_saved = file->ifndef_macro;
3170 /* need to set to zero to avoid false matches if another
3171 #ifndef at middle of file */
3172 file->ifndef_macro = 0;
3173 while (tok != TOK_LINEFEED)
3174 next_nomacro();
3175 tok_flags |= TOK_FLAG_ENDIF;
3176 goto the_end;
3178 break;
3179 case TOK_LINE:
3180 next();
3181 if (tok != TOK_CINT)
3182 error("#line");
3183 file->line_num = tokc.i - 1; /* the line number will be incremented after */
3184 next();
3185 if (tok != TOK_LINEFEED) {
3186 if (tok != TOK_STR)
3187 error("#line");
3188 pstrcpy(file->filename, sizeof(file->filename),
3189 (char *)tokc.cstr->data);
3191 break;
3192 case TOK_ERROR:
3193 case TOK_WARNING:
3194 c = tok;
3195 ch = file->buf_ptr[0];
3196 skip_spaces();
3197 q = buf;
3198 while (ch != '\n' && ch != CH_EOF) {
3199 if ((q - buf) < sizeof(buf) - 1)
3200 *q++ = ch;
3201 if (ch == '\\') {
3202 if (handle_stray_noerror() == 0)
3203 --q;
3204 } else
3205 inp();
3207 *q = '\0';
3208 if (c == TOK_ERROR)
3209 error("#error %s", buf);
3210 else
3211 warning("#warning %s", buf);
3212 break;
3213 case TOK_PRAGMA:
3214 pragma_parse(s1);
3215 break;
3216 default:
3217 if (tok == TOK_LINEFEED || tok == '!' || tok == TOK_CINT) {
3218 /* '!' is ignored to allow C scripts. numbers are ignored
3219 to emulate cpp behaviour */
3220 } else {
3221 if (!(saved_parse_flags & PARSE_FLAG_ASM_COMMENTS))
3222 warning("Ignoring unknown preprocessing directive #%s", get_tok_str(tok, &tokc));
3224 break;
3226 /* ignore other preprocess commands or #! for C scripts */
3227 while (tok != TOK_LINEFEED)
3228 next_nomacro();
3229 the_end:
3230 parse_flags = saved_parse_flags;
3233 /* evaluate escape codes in a string. */
3234 static void parse_escape_string(CString *outstr, const uint8_t *buf, int is_long)
3236 int c, n;
3237 const uint8_t *p;
3239 p = buf;
3240 for(;;) {
3241 c = *p;
3242 if (c == '\0')
3243 break;
3244 if (c == '\\') {
3245 p++;
3246 /* escape */
3247 c = *p;
3248 switch(c) {
3249 case '0': case '1': case '2': case '3':
3250 case '4': case '5': case '6': case '7':
3251 /* at most three octal digits */
3252 n = c - '0';
3253 p++;
3254 c = *p;
3255 if (isoct(c)) {
3256 n = n * 8 + c - '0';
3257 p++;
3258 c = *p;
3259 if (isoct(c)) {
3260 n = n * 8 + c - '0';
3261 p++;
3264 c = n;
3265 goto add_char_nonext;
3266 case 'x':
3267 case 'u':
3268 case 'U':
3269 p++;
3270 n = 0;
3271 for(;;) {
3272 c = *p;
3273 if (c >= 'a' && c <= 'f')
3274 c = c - 'a' + 10;
3275 else if (c >= 'A' && c <= 'F')
3276 c = c - 'A' + 10;
3277 else if (isnum(c))
3278 c = c - '0';
3279 else
3280 break;
3281 n = n * 16 + c;
3282 p++;
3284 c = n;
3285 goto add_char_nonext;
3286 case 'a':
3287 c = '\a';
3288 break;
3289 case 'b':
3290 c = '\b';
3291 break;
3292 case 'f':
3293 c = '\f';
3294 break;
3295 case 'n':
3296 c = '\n';
3297 break;
3298 case 'r':
3299 c = '\r';
3300 break;
3301 case 't':
3302 c = '\t';
3303 break;
3304 case 'v':
3305 c = '\v';
3306 break;
3307 case 'e':
3308 if (!gnu_ext)
3309 goto invalid_escape;
3310 c = 27;
3311 break;
3312 case '\'':
3313 case '\"':
3314 case '\\':
3315 case '?':
3316 break;
3317 default:
3318 invalid_escape:
3319 if (c >= '!' && c <= '~')
3320 warning("unknown escape sequence: \'\\%c\'", c);
3321 else
3322 warning("unknown escape sequence: \'\\x%x\'", c);
3323 break;
3326 p++;
3327 add_char_nonext:
3328 if (!is_long)
3329 cstr_ccat(outstr, c);
3330 else
3331 cstr_wccat(outstr, c);
3333 /* add a trailing '\0' */
3334 if (!is_long)
3335 cstr_ccat(outstr, '\0');
3336 else
3337 cstr_wccat(outstr, '\0');
3340 /* we use 64 bit numbers */
3341 #define BN_SIZE 2
3343 /* bn = (bn << shift) | or_val */
3344 void bn_lshift(unsigned int *bn, int shift, int or_val)
3346 int i;
3347 unsigned int v;
3348 for(i=0;i<BN_SIZE;i++) {
3349 v = bn[i];
3350 bn[i] = (v << shift) | or_val;
3351 or_val = v >> (32 - shift);
3355 void bn_zero(unsigned int *bn)
3357 int i;
3358 for(i=0;i<BN_SIZE;i++) {
3359 bn[i] = 0;
3363 /* parse number in null terminated string 'p' and return it in the
3364 current token */
3365 void parse_number(const char *p)
3367 int b, t, shift, frac_bits, s, exp_val, ch;
3368 char *q;
3369 unsigned int bn[BN_SIZE];
3370 double d;
3372 /* number */
3373 q = token_buf;
3374 ch = *p++;
3375 t = ch;
3376 ch = *p++;
3377 *q++ = t;
3378 b = 10;
3379 if (t == '.') {
3380 goto float_frac_parse;
3381 } else if (t == '0') {
3382 if (ch == 'x' || ch == 'X') {
3383 q--;
3384 ch = *p++;
3385 b = 16;
3386 } else if (tcc_ext && (ch == 'b' || ch == 'B')) {
3387 q--;
3388 ch = *p++;
3389 b = 2;
3392 /* parse all digits. cannot check octal numbers at this stage
3393 because of floating point constants */
3394 while (1) {
3395 if (ch >= 'a' && ch <= 'f')
3396 t = ch - 'a' + 10;
3397 else if (ch >= 'A' && ch <= 'F')
3398 t = ch - 'A' + 10;
3399 else if (isnum(ch))
3400 t = ch - '0';
3401 else
3402 break;
3403 if (t >= b)
3404 break;
3405 if (q >= token_buf + STRING_MAX_SIZE) {
3406 num_too_long:
3407 error("number too long");
3409 *q++ = ch;
3410 ch = *p++;
3412 if (ch == '.' ||
3413 ((ch == 'e' || ch == 'E') && b == 10) ||
3414 ((ch == 'p' || ch == 'P') && (b == 16 || b == 2))) {
3415 if (b != 10) {
3416 /* NOTE: strtox should support that for hexa numbers, but
3417 non ISOC99 libcs do not support it, so we prefer to do
3418 it by hand */
3419 /* hexadecimal or binary floats */
3420 /* XXX: handle overflows */
3421 *q = '\0';
3422 if (b == 16)
3423 shift = 4;
3424 else
3425 shift = 2;
3426 bn_zero(bn);
3427 q = token_buf;
3428 while (1) {
3429 t = *q++;
3430 if (t == '\0') {
3431 break;
3432 } else if (t >= 'a') {
3433 t = t - 'a' + 10;
3434 } else if (t >= 'A') {
3435 t = t - 'A' + 10;
3436 } else {
3437 t = t - '0';
3439 bn_lshift(bn, shift, t);
3441 frac_bits = 0;
3442 if (ch == '.') {
3443 ch = *p++;
3444 while (1) {
3445 t = ch;
3446 if (t >= 'a' && t <= 'f') {
3447 t = t - 'a' + 10;
3448 } else if (t >= 'A' && t <= 'F') {
3449 t = t - 'A' + 10;
3450 } else if (t >= '0' && t <= '9') {
3451 t = t - '0';
3452 } else {
3453 break;
3455 if (t >= b)
3456 error("invalid digit");
3457 bn_lshift(bn, shift, t);
3458 frac_bits += shift;
3459 ch = *p++;
3462 if (ch != 'p' && ch != 'P')
3463 expect("exponent");
3464 ch = *p++;
3465 s = 1;
3466 exp_val = 0;
3467 if (ch == '+') {
3468 ch = *p++;
3469 } else if (ch == '-') {
3470 s = -1;
3471 ch = *p++;
3473 if (ch < '0' || ch > '9')
3474 expect("exponent digits");
3475 while (ch >= '0' && ch <= '9') {
3476 exp_val = exp_val * 10 + ch - '0';
3477 ch = *p++;
3479 exp_val = exp_val * s;
3481 /* now we can generate the number */
3482 /* XXX: should patch directly float number */
3483 d = (double)bn[1] * 4294967296.0 + (double)bn[0];
3484 d = ldexp(d, exp_val - frac_bits);
3485 t = toup(ch);
3486 if (t == 'F') {
3487 ch = *p++;
3488 tok = TOK_CFLOAT;
3489 /* float : should handle overflow */
3490 tokc.f = (float)d;
3491 } else if (t == 'L') {
3492 ch = *p++;
3493 tok = TOK_CLDOUBLE;
3494 /* XXX: not large enough */
3495 tokc.ld = (long double)d;
3496 } else {
3497 tok = TOK_CDOUBLE;
3498 tokc.d = d;
3500 } else {
3501 /* decimal floats */
3502 if (ch == '.') {
3503 if (q >= token_buf + STRING_MAX_SIZE)
3504 goto num_too_long;
3505 *q++ = ch;
3506 ch = *p++;
3507 float_frac_parse:
3508 while (ch >= '0' && ch <= '9') {
3509 if (q >= token_buf + STRING_MAX_SIZE)
3510 goto num_too_long;
3511 *q++ = ch;
3512 ch = *p++;
3515 if (ch == 'e' || ch == 'E') {
3516 if (q >= token_buf + STRING_MAX_SIZE)
3517 goto num_too_long;
3518 *q++ = ch;
3519 ch = *p++;
3520 if (ch == '-' || ch == '+') {
3521 if (q >= token_buf + STRING_MAX_SIZE)
3522 goto num_too_long;
3523 *q++ = ch;
3524 ch = *p++;
3526 if (ch < '0' || ch > '9')
3527 expect("exponent digits");
3528 while (ch >= '0' && ch <= '9') {
3529 if (q >= token_buf + STRING_MAX_SIZE)
3530 goto num_too_long;
3531 *q++ = ch;
3532 ch = *p++;
3535 *q = '\0';
3536 t = toup(ch);
3537 errno = 0;
3538 if (t == 'F') {
3539 ch = *p++;
3540 tok = TOK_CFLOAT;
3541 tokc.f = strtof(token_buf, NULL);
3542 } else if (t == 'L') {
3543 ch = *p++;
3544 tok = TOK_CLDOUBLE;
3545 tokc.ld = strtold(token_buf, NULL);
3546 } else {
3547 tok = TOK_CDOUBLE;
3548 tokc.d = strtod(token_buf, NULL);
3551 } else {
3552 unsigned long long n, n1;
3553 int lcount, ucount;
3555 /* integer number */
3556 *q = '\0';
3557 q = token_buf;
3558 if (b == 10 && *q == '0') {
3559 b = 8;
3560 q++;
3562 n = 0;
3563 while(1) {
3564 t = *q++;
3565 /* no need for checks except for base 10 / 8 errors */
3566 if (t == '\0') {
3567 break;
3568 } else if (t >= 'a') {
3569 t = t - 'a' + 10;
3570 } else if (t >= 'A') {
3571 t = t - 'A' + 10;
3572 } else {
3573 t = t - '0';
3574 if (t >= b)
3575 error("invalid digit");
3577 n1 = n;
3578 n = n * b + t;
3579 /* detect overflow */
3580 /* XXX: this test is not reliable */
3581 if (n < n1)
3582 error("integer constant overflow");
3585 /* XXX: not exactly ANSI compliant */
3586 if ((n & 0xffffffff00000000LL) != 0) {
3587 if ((n >> 63) != 0)
3588 tok = TOK_CULLONG;
3589 else
3590 tok = TOK_CLLONG;
3591 } else if (n > 0x7fffffff) {
3592 tok = TOK_CUINT;
3593 } else {
3594 tok = TOK_CINT;
3596 lcount = 0;
3597 ucount = 0;
3598 for(;;) {
3599 t = toup(ch);
3600 if (t == 'L') {
3601 if (lcount >= 2)
3602 error("three 'l's in integer constant");
3603 lcount++;
3604 if (lcount == 2) {
3605 if (tok == TOK_CINT)
3606 tok = TOK_CLLONG;
3607 else if (tok == TOK_CUINT)
3608 tok = TOK_CULLONG;
3610 ch = *p++;
3611 } else if (t == 'U') {
3612 if (ucount >= 1)
3613 error("two 'u's in integer constant");
3614 ucount++;
3615 if (tok == TOK_CINT)
3616 tok = TOK_CUINT;
3617 else if (tok == TOK_CLLONG)
3618 tok = TOK_CULLONG;
3619 ch = *p++;
3620 } else {
3621 break;
3624 if (tok == TOK_CINT || tok == TOK_CUINT)
3625 tokc.ui = n;
3626 else
3627 tokc.ull = n;
3632 #define PARSE2(c1, tok1, c2, tok2) \
3633 case c1: \
3634 PEEKC(c, p); \
3635 if (c == c2) { \
3636 p++; \
3637 tok = tok2; \
3638 } else { \
3639 tok = tok1; \
3641 break;
3643 /* return next token without macro substitution */
3644 static inline void next_nomacro1(void)
3646 int t, c, is_long;
3647 TokenSym *ts;
3648 uint8_t *p, *p1;
3649 unsigned int h;
3651 p = file->buf_ptr;
3652 redo_no_start:
3653 c = *p;
3654 switch(c) {
3655 case ' ':
3656 case '\t':
3657 case '\f':
3658 case '\v':
3659 case '\r':
3660 p++;
3661 goto redo_no_start;
3663 case '\\':
3664 /* first look if it is in fact an end of buffer */
3665 if (p >= file->buf_end) {
3666 file->buf_ptr = p;
3667 handle_eob();
3668 p = file->buf_ptr;
3669 if (p >= file->buf_end)
3670 goto parse_eof;
3671 else
3672 goto redo_no_start;
3673 } else {
3674 file->buf_ptr = p;
3675 ch = *p;
3676 handle_stray();
3677 p = file->buf_ptr;
3678 goto redo_no_start;
3680 parse_eof:
3682 TCCState *s1 = tcc_state;
3683 if ((parse_flags & PARSE_FLAG_LINEFEED)
3684 && !(tok_flags & TOK_FLAG_EOF)) {
3685 tok_flags |= TOK_FLAG_EOF;
3686 tok = TOK_LINEFEED;
3687 goto keep_tok_flags;
3688 } else if (s1->include_stack_ptr == s1->include_stack ||
3689 !(parse_flags & PARSE_FLAG_PREPROCESS)) {
3690 /* no include left : end of file. */
3691 tok = TOK_EOF;
3692 } else {
3693 tok_flags &= ~TOK_FLAG_EOF;
3694 /* pop include file */
3696 /* test if previous '#endif' was after a #ifdef at
3697 start of file */
3698 if (tok_flags & TOK_FLAG_ENDIF) {
3699 #ifdef INC_DEBUG
3700 printf("#endif %s\n", get_tok_str(file->ifndef_macro_saved, NULL));
3701 #endif
3702 add_cached_include(s1, file->inc_type, file->inc_filename,
3703 file->ifndef_macro_saved);
3706 /* add end of include file debug info */
3707 if (do_debug) {
3708 put_stabd(N_EINCL, 0, 0);
3710 /* pop include stack */
3711 tcc_close(file);
3712 s1->include_stack_ptr--;
3713 file = *s1->include_stack_ptr;
3714 p = file->buf_ptr;
3715 goto redo_no_start;
3718 break;
3720 case '\n':
3721 file->line_num++;
3722 tok_flags |= TOK_FLAG_BOL;
3723 p++;
3724 if (0 == (parse_flags & PARSE_FLAG_LINEFEED))
3725 goto redo_no_start;
3726 tok = TOK_LINEFEED;
3727 goto keep_tok_flags;
3729 case '#':
3730 /* XXX: simplify */
3731 PEEKC(c, p);
3732 if ((tok_flags & TOK_FLAG_BOL) &&
3733 (parse_flags & PARSE_FLAG_PREPROCESS)) {
3734 file->buf_ptr = p;
3735 preprocess(tok_flags & TOK_FLAG_BOF);
3736 p = file->buf_ptr;
3737 goto redo_no_start;
3738 } else {
3739 if (c == '#') {
3740 p++;
3741 tok = TOK_TWOSHARPS;
3742 } else {
3743 if (parse_flags & PARSE_FLAG_ASM_COMMENTS) {
3744 p = parse_line_comment(p - 1);
3745 goto redo_no_start;
3746 } else {
3747 tok = '#';
3751 break;
3753 case 'a': case 'b': case 'c': case 'd':
3754 case 'e': case 'f': case 'g': case 'h':
3755 case 'i': case 'j': case 'k': case 'l':
3756 case 'm': case 'n': case 'o': case 'p':
3757 case 'q': case 'r': case 's': case 't':
3758 case 'u': case 'v': case 'w': case 'x':
3759 case 'y': case 'z':
3760 case 'A': case 'B': case 'C': case 'D':
3761 case 'E': case 'F': case 'G': case 'H':
3762 case 'I': case 'J': case 'K':
3763 case 'M': case 'N': case 'O': case 'P':
3764 case 'Q': case 'R': case 'S': case 'T':
3765 case 'U': case 'V': case 'W': case 'X':
3766 case 'Y': case 'Z':
3767 case '_':
3768 parse_ident_fast:
3769 p1 = p;
3770 h = TOK_HASH_INIT;
3771 h = TOK_HASH_FUNC(h, c);
3772 p++;
3773 for(;;) {
3774 c = *p;
3775 if (!isidnum_table[c-CH_EOF])
3776 break;
3777 h = TOK_HASH_FUNC(h, c);
3778 p++;
3780 if (c != '\\') {
3781 TokenSym **pts;
3782 int len;
3784 /* fast case : no stray found, so we have the full token
3785 and we have already hashed it */
3786 len = p - p1;
3787 h &= (TOK_HASH_SIZE - 1);
3788 pts = &hash_ident[h];
3789 for(;;) {
3790 ts = *pts;
3791 if (!ts)
3792 break;
3793 if (ts->len == len && !memcmp(ts->str, p1, len))
3794 goto token_found;
3795 pts = &(ts->hash_next);
3797 ts = tok_alloc_new(pts, p1, len);
3798 token_found: ;
3799 } else {
3800 /* slower case */
3801 cstr_reset(&tokcstr);
3803 while (p1 < p) {
3804 cstr_ccat(&tokcstr, *p1);
3805 p1++;
3807 p--;
3808 PEEKC(c, p);
3809 parse_ident_slow:
3810 while (isidnum_table[c-CH_EOF]) {
3811 cstr_ccat(&tokcstr, c);
3812 PEEKC(c, p);
3814 ts = tok_alloc(tokcstr.data, tokcstr.size);
3816 tok = ts->tok;
3817 break;
3818 case 'L':
3819 t = p[1];
3820 if (t != '\\' && t != '\'' && t != '\"') {
3821 /* fast case */
3822 goto parse_ident_fast;
3823 } else {
3824 PEEKC(c, p);
3825 if (c == '\'' || c == '\"') {
3826 is_long = 1;
3827 goto str_const;
3828 } else {
3829 cstr_reset(&tokcstr);
3830 cstr_ccat(&tokcstr, 'L');
3831 goto parse_ident_slow;
3834 break;
3835 case '0': case '1': case '2': case '3':
3836 case '4': case '5': case '6': case '7':
3837 case '8': case '9':
3839 cstr_reset(&tokcstr);
3840 /* after the first digit, accept digits, alpha, '.' or sign if
3841 prefixed by 'eEpP' */
3842 parse_num:
3843 for(;;) {
3844 t = c;
3845 cstr_ccat(&tokcstr, c);
3846 PEEKC(c, p);
3847 if (!(isnum(c) || isid(c) || c == '.' ||
3848 ((c == '+' || c == '-') &&
3849 (t == 'e' || t == 'E' || t == 'p' || t == 'P'))))
3850 break;
3852 /* We add a trailing '\0' to ease parsing */
3853 cstr_ccat(&tokcstr, '\0');
3854 tokc.cstr = &tokcstr;
3855 tok = TOK_PPNUM;
3856 break;
3857 case '.':
3858 /* special dot handling because it can also start a number */
3859 PEEKC(c, p);
3860 if (isnum(c)) {
3861 cstr_reset(&tokcstr);
3862 cstr_ccat(&tokcstr, '.');
3863 goto parse_num;
3864 } else if (c == '.') {
3865 PEEKC(c, p);
3866 if (c != '.')
3867 expect("'.'");
3868 PEEKC(c, p);
3869 tok = TOK_DOTS;
3870 } else {
3871 tok = '.';
3873 break;
3874 case '\'':
3875 case '\"':
3876 is_long = 0;
3877 str_const:
3879 CString str;
3880 int sep;
3882 sep = c;
3884 /* parse the string */
3885 cstr_new(&str);
3886 p = parse_pp_string(p, sep, &str);
3887 cstr_ccat(&str, '\0');
3889 /* eval the escape (should be done as TOK_PPNUM) */
3890 cstr_reset(&tokcstr);
3891 parse_escape_string(&tokcstr, str.data, is_long);
3892 cstr_free(&str);
3894 if (sep == '\'') {
3895 int char_size;
3896 /* XXX: make it portable */
3897 if (!is_long)
3898 char_size = 1;
3899 else
3900 char_size = sizeof(nwchar_t);
3901 if (tokcstr.size <= char_size)
3902 error("empty character constant");
3903 if (tokcstr.size > 2 * char_size)
3904 warning("multi-character character constant");
3905 if (!is_long) {
3906 tokc.i = *(int8_t *)tokcstr.data;
3907 tok = TOK_CCHAR;
3908 } else {
3909 tokc.i = *(nwchar_t *)tokcstr.data;
3910 tok = TOK_LCHAR;
3912 } else {
3913 tokc.cstr = &tokcstr;
3914 if (!is_long)
3915 tok = TOK_STR;
3916 else
3917 tok = TOK_LSTR;
3920 break;
3922 case '<':
3923 PEEKC(c, p);
3924 if (c == '=') {
3925 p++;
3926 tok = TOK_LE;
3927 } else if (c == '<') {
3928 PEEKC(c, p);
3929 if (c == '=') {
3930 p++;
3931 tok = TOK_A_SHL;
3932 } else {
3933 tok = TOK_SHL;
3935 } else {
3936 tok = TOK_LT;
3938 break;
3940 case '>':
3941 PEEKC(c, p);
3942 if (c == '=') {
3943 p++;
3944 tok = TOK_GE;
3945 } else if (c == '>') {
3946 PEEKC(c, p);
3947 if (c == '=') {
3948 p++;
3949 tok = TOK_A_SAR;
3950 } else {
3951 tok = TOK_SAR;
3953 } else {
3954 tok = TOK_GT;
3956 break;
3958 case '&':
3959 PEEKC(c, p);
3960 if (c == '&') {
3961 p++;
3962 tok = TOK_LAND;
3963 } else if (c == '=') {
3964 p++;
3965 tok = TOK_A_AND;
3966 } else {
3967 tok = '&';
3969 break;
3971 case '|':
3972 PEEKC(c, p);
3973 if (c == '|') {
3974 p++;
3975 tok = TOK_LOR;
3976 } else if (c == '=') {
3977 p++;
3978 tok = TOK_A_OR;
3979 } else {
3980 tok = '|';
3982 break;
3984 case '+':
3985 PEEKC(c, p);
3986 if (c == '+') {
3987 p++;
3988 tok = TOK_INC;
3989 } else if (c == '=') {
3990 p++;
3991 tok = TOK_A_ADD;
3992 } else {
3993 tok = '+';
3995 break;
3997 case '-':
3998 PEEKC(c, p);
3999 if (c == '-') {
4000 p++;
4001 tok = TOK_DEC;
4002 } else if (c == '=') {
4003 p++;
4004 tok = TOK_A_SUB;
4005 } else if (c == '>') {
4006 p++;
4007 tok = TOK_ARROW;
4008 } else {
4009 tok = '-';
4011 break;
4013 PARSE2('!', '!', '=', TOK_NE)
4014 PARSE2('=', '=', '=', TOK_EQ)
4015 PARSE2('*', '*', '=', TOK_A_MUL)
4016 PARSE2('%', '%', '=', TOK_A_MOD)
4017 PARSE2('^', '^', '=', TOK_A_XOR)
4019 /* comments or operator */
4020 case '/':
4021 PEEKC(c, p);
4022 if (c == '*') {
4023 p = parse_comment(p);
4024 goto redo_no_start;
4025 } else if (c == '/') {
4026 p = parse_line_comment(p);
4027 goto redo_no_start;
4028 } else if (c == '=') {
4029 p++;
4030 tok = TOK_A_DIV;
4031 } else {
4032 tok = '/';
4034 break;
4036 /* simple tokens */
4037 case '(':
4038 case ')':
4039 case '[':
4040 case ']':
4041 case '{':
4042 case '}':
4043 case ',':
4044 case ';':
4045 case ':':
4046 case '?':
4047 case '~':
4048 case '$': /* only used in assembler */
4049 case '@': /* dito */
4050 tok = c;
4051 p++;
4052 break;
4053 default:
4054 error("unrecognized character \\x%02x", c);
4055 break;
4057 tok_flags = 0;
4058 keep_tok_flags:
4059 file->buf_ptr = p;
4060 #if defined(PARSE_DEBUG)
4061 printf("token = %s\n", get_tok_str(tok, &tokc));
4062 #endif
4065 /* return next token without macro substitution. Can read input from
4066 macro_ptr buffer */
4067 static void next_nomacro(void)
4069 if (macro_ptr) {
4070 redo:
4071 tok = *macro_ptr;
4072 if (tok) {
4073 TOK_GET(tok, macro_ptr, tokc);
4074 if (tok == TOK_LINENUM) {
4075 file->line_num = tokc.i;
4076 goto redo;
4079 } else {
4080 next_nomacro1();
4084 /* substitute args in macro_str and return allocated string */
4085 static int *macro_arg_subst(Sym **nested_list, int *macro_str, Sym *args)
4087 int *st, last_tok, t, notfirst;
4088 Sym *s;
4089 CValue cval;
4090 TokenString str;
4091 CString cstr;
4093 tok_str_new(&str);
4094 last_tok = 0;
4095 while(1) {
4096 TOK_GET(t, macro_str, cval);
4097 if (!t)
4098 break;
4099 if (t == '#') {
4100 /* stringize */
4101 TOK_GET(t, macro_str, cval);
4102 if (!t)
4103 break;
4104 s = sym_find2(args, t);
4105 if (s) {
4106 cstr_new(&cstr);
4107 st = (int *)s->c;
4108 notfirst = 0;
4109 while (*st) {
4110 if (notfirst)
4111 cstr_ccat(&cstr, ' ');
4112 TOK_GET(t, st, cval);
4113 cstr_cat(&cstr, get_tok_str(t, &cval));
4114 #ifndef PP_NOSPACES
4115 notfirst = 1;
4116 #endif
4118 cstr_ccat(&cstr, '\0');
4119 #ifdef PP_DEBUG
4120 printf("stringize: %s\n", (char *)cstr.data);
4121 #endif
4122 /* add string */
4123 cval.cstr = &cstr;
4124 tok_str_add2(&str, TOK_STR, &cval);
4125 cstr_free(&cstr);
4126 } else {
4127 tok_str_add2(&str, t, &cval);
4129 } else if (t >= TOK_IDENT) {
4130 s = sym_find2(args, t);
4131 if (s) {
4132 st = (int *)s->c;
4133 /* if '##' is present before or after, no arg substitution */
4134 if (*macro_str == TOK_TWOSHARPS || last_tok == TOK_TWOSHARPS) {
4135 /* special case for var arg macros : ## eats the
4136 ',' if empty VA_ARGS variable. */
4137 /* XXX: test of the ',' is not 100%
4138 reliable. should fix it to avoid security
4139 problems */
4140 if (gnu_ext && s->type.t &&
4141 last_tok == TOK_TWOSHARPS &&
4142 str.len >= 2 && str.str[str.len - 2] == ',') {
4143 if (*st == 0) {
4144 /* suppress ',' '##' */
4145 str.len -= 2;
4146 } else {
4147 /* suppress '##' and add variable */
4148 str.len--;
4149 goto add_var;
4151 } else {
4152 int t1;
4153 add_var:
4154 for(;;) {
4155 TOK_GET(t1, st, cval);
4156 if (!t1)
4157 break;
4158 tok_str_add2(&str, t1, &cval);
4161 } else {
4162 /* NOTE: the stream cannot be read when macro
4163 substituing an argument */
4164 macro_subst(&str, nested_list, st, NULL);
4166 } else {
4167 tok_str_add(&str, t);
4169 } else {
4170 tok_str_add2(&str, t, &cval);
4172 last_tok = t;
4174 tok_str_add(&str, 0);
4175 return str.str;
4178 static char const ab_month_name[12][4] =
4180 "Jan", "Feb", "Mar", "Apr", "May", "Jun",
4181 "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
4184 /* do macro substitution of current token with macro 's' and add
4185 result to (tok_str,tok_len). 'nested_list' is the list of all
4186 macros we got inside to avoid recursing. Return non zero if no
4187 substitution needs to be done */
4188 static int macro_subst_tok(TokenString *tok_str,
4189 Sym **nested_list, Sym *s, struct macro_level **can_read_stream)
4191 Sym *args, *sa, *sa1;
4192 int mstr_allocated, parlevel, *mstr, t, t1;
4193 TokenString str;
4194 char *cstrval;
4195 CValue cval;
4196 CString cstr;
4197 char buf[32];
4199 /* if symbol is a macro, prepare substitution */
4200 /* special macros */
4201 if (tok == TOK___LINE__) {
4202 snprintf(buf, sizeof(buf), "%d", file->line_num);
4203 cstrval = buf;
4204 t1 = TOK_PPNUM;
4205 goto add_cstr1;
4206 } else if (tok == TOK___FILE__) {
4207 cstrval = file->filename;
4208 goto add_cstr;
4209 } else if (tok == TOK___DATE__ || tok == TOK___TIME__) {
4210 time_t ti;
4211 struct tm *tm;
4213 time(&ti);
4214 tm = localtime(&ti);
4215 if (tok == TOK___DATE__) {
4216 snprintf(buf, sizeof(buf), "%s %2d %d",
4217 ab_month_name[tm->tm_mon], tm->tm_mday, tm->tm_year + 1900);
4218 } else {
4219 snprintf(buf, sizeof(buf), "%02d:%02d:%02d",
4220 tm->tm_hour, tm->tm_min, tm->tm_sec);
4222 cstrval = buf;
4223 add_cstr:
4224 t1 = TOK_STR;
4225 add_cstr1:
4226 cstr_new(&cstr);
4227 cstr_cat(&cstr, cstrval);
4228 cstr_ccat(&cstr, '\0');
4229 cval.cstr = &cstr;
4230 tok_str_add2(tok_str, t1, &cval);
4231 cstr_free(&cstr);
4232 } else {
4233 mstr = (int *)s->c;
4234 mstr_allocated = 0;
4235 if (s->type.t == MACRO_FUNC) {
4236 /* NOTE: we do not use next_nomacro to avoid eating the
4237 next token. XXX: find better solution */
4238 redo:
4239 if (macro_ptr) {
4240 t = *macro_ptr;
4241 if (t == 0 && can_read_stream) {
4242 /* end of macro stream: we must look at the token
4243 after in the file */
4244 struct macro_level *ml = *can_read_stream;
4245 macro_ptr = NULL;
4246 if (ml)
4248 macro_ptr = ml->p;
4249 ml->p = NULL;
4250 *can_read_stream = ml -> prev;
4252 goto redo;
4254 } else {
4255 /* XXX: incorrect with comments */
4256 ch = file->buf_ptr[0];
4257 while (is_space(ch) || ch == '\n')
4258 cinp();
4259 t = ch;
4261 if (t != '(') /* no macro subst */
4262 return -1;
4264 /* argument macro */
4265 next_nomacro();
4266 next_nomacro();
4267 args = NULL;
4268 sa = s->next;
4269 /* NOTE: empty args are allowed, except if no args */
4270 for(;;) {
4271 /* handle '()' case */
4272 if (!args && !sa && tok == ')')
4273 break;
4274 if (!sa)
4275 error("macro '%s' used with too many args",
4276 get_tok_str(s->v, 0));
4277 tok_str_new(&str);
4278 parlevel = 0;
4279 /* NOTE: non zero sa->t indicates VA_ARGS */
4280 while ((parlevel > 0 ||
4281 (tok != ')' &&
4282 (tok != ',' || sa->type.t))) &&
4283 tok != -1) {
4284 if (tok == '(')
4285 parlevel++;
4286 else if (tok == ')')
4287 parlevel--;
4288 if (tok != TOK_LINEFEED)
4289 tok_str_add2(&str, tok, &tokc);
4290 next_nomacro();
4292 tok_str_add(&str, 0);
4293 sym_push2(&args, sa->v & ~SYM_FIELD, sa->type.t, (int)str.str);
4294 sa = sa->next;
4295 if (tok == ')') {
4296 /* special case for gcc var args: add an empty
4297 var arg argument if it is omitted */
4298 if (sa && sa->type.t && gnu_ext)
4299 continue;
4300 else
4301 break;
4303 if (tok != ',')
4304 expect(",");
4305 next_nomacro();
4307 if (sa) {
4308 error("macro '%s' used with too few args",
4309 get_tok_str(s->v, 0));
4312 /* now subst each arg */
4313 mstr = macro_arg_subst(nested_list, mstr, args);
4314 /* free memory */
4315 sa = args;
4316 while (sa) {
4317 sa1 = sa->prev;
4318 tok_str_free((int *)sa->c);
4319 sym_free(sa);
4320 sa = sa1;
4322 mstr_allocated = 1;
4324 sym_push2(nested_list, s->v, 0, 0);
4325 macro_subst(tok_str, nested_list, mstr, can_read_stream);
4326 /* pop nested defined symbol */
4327 sa1 = *nested_list;
4328 *nested_list = sa1->prev;
4329 sym_free(sa1);
4330 if (mstr_allocated)
4331 tok_str_free(mstr);
4333 return 0;
4336 /* handle the '##' operator. Return NULL if no '##' seen. Otherwise
4337 return the resulting string (which must be freed). */
4338 static inline int *macro_twosharps(const int *macro_str)
4340 TokenSym *ts;
4341 const int *macro_ptr1, *start_macro_ptr, *ptr, *saved_macro_ptr;
4342 int t;
4343 const char *p1, *p2;
4344 CValue cval;
4345 TokenString macro_str1;
4346 CString cstr;
4348 start_macro_ptr = macro_str;
4349 /* we search the first '##' */
4350 for(;;) {
4351 macro_ptr1 = macro_str;
4352 TOK_GET(t, macro_str, cval);
4353 /* nothing more to do if end of string */
4354 if (t == 0)
4355 return NULL;
4356 if (*macro_str == TOK_TWOSHARPS)
4357 break;
4360 /* we saw '##', so we need more processing to handle it */
4361 cstr_new(&cstr);
4362 tok_str_new(&macro_str1);
4363 tok = t;
4364 tokc = cval;
4366 /* add all tokens seen so far */
4367 for(ptr = start_macro_ptr; ptr < macro_ptr1;) {
4368 TOK_GET(t, ptr, cval);
4369 tok_str_add2(&macro_str1, t, &cval);
4371 saved_macro_ptr = macro_ptr;
4372 /* XXX: get rid of the use of macro_ptr here */
4373 macro_ptr = (int *)macro_str;
4374 for(;;) {
4375 while (*macro_ptr == TOK_TWOSHARPS) {
4376 macro_ptr++;
4377 macro_ptr1 = macro_ptr;
4378 t = *macro_ptr;
4379 if (t) {
4380 TOK_GET(t, macro_ptr, cval);
4381 /* We concatenate the two tokens if we have an
4382 identifier or a preprocessing number */
4383 cstr_reset(&cstr);
4384 p1 = get_tok_str(tok, &tokc);
4385 cstr_cat(&cstr, p1);
4386 p2 = get_tok_str(t, &cval);
4387 cstr_cat(&cstr, p2);
4388 cstr_ccat(&cstr, '\0');
4390 if ((tok >= TOK_IDENT || tok == TOK_PPNUM) &&
4391 (t >= TOK_IDENT || t == TOK_PPNUM)) {
4392 if (tok == TOK_PPNUM) {
4393 /* if number, then create a number token */
4394 /* NOTE: no need to allocate because
4395 tok_str_add2() does it */
4396 cstr_reset(&tokcstr);
4397 tokcstr = cstr;
4398 cstr_new(&cstr);
4399 tokc.cstr = &tokcstr;
4400 } else {
4401 /* if identifier, we must do a test to
4402 validate we have a correct identifier */
4403 if (t == TOK_PPNUM) {
4404 const char *p;
4405 int c;
4407 p = p2;
4408 for(;;) {
4409 c = *p;
4410 if (c == '\0')
4411 break;
4412 p++;
4413 if (!isnum(c) && !isid(c))
4414 goto error_pasting;
4417 ts = tok_alloc(cstr.data, strlen(cstr.data));
4418 tok = ts->tok; /* modify current token */
4420 } else {
4421 const char *str = cstr.data;
4422 const unsigned char *q;
4424 /* we look for a valid token */
4425 /* XXX: do more extensive checks */
4426 if (!strcmp(str, ">>=")) {
4427 tok = TOK_A_SAR;
4428 } else if (!strcmp(str, "<<=")) {
4429 tok = TOK_A_SHL;
4430 } else if (strlen(str) == 2) {
4431 /* search in two bytes table */
4432 q = tok_two_chars;
4433 for(;;) {
4434 if (!*q)
4435 goto error_pasting;
4436 if (q[0] == str[0] && q[1] == str[1])
4437 break;
4438 q += 3;
4440 tok = q[2];
4441 } else {
4442 error_pasting:
4443 /* NOTE: because get_tok_str use a static buffer,
4444 we must save it */
4445 cstr_reset(&cstr);
4446 p1 = get_tok_str(tok, &tokc);
4447 cstr_cat(&cstr, p1);
4448 cstr_ccat(&cstr, '\0');
4449 p2 = get_tok_str(t, &cval);
4450 warning("pasting \"%s\" and \"%s\" does not give a valid preprocessing token", cstr.data, p2);
4451 /* cannot merge tokens: just add them separately */
4452 tok_str_add2(&macro_str1, tok, &tokc);
4453 /* XXX: free associated memory ? */
4454 tok = t;
4455 tokc = cval;
4460 tok_str_add2(&macro_str1, tok, &tokc);
4461 next_nomacro();
4462 if (tok == 0)
4463 break;
4465 macro_ptr = (int *)saved_macro_ptr;
4466 cstr_free(&cstr);
4467 tok_str_add(&macro_str1, 0);
4468 return macro_str1.str;
4472 /* do macro substitution of macro_str and add result to
4473 (tok_str,tok_len). 'nested_list' is the list of all macros we got
4474 inside to avoid recursing. */
4475 static void macro_subst(TokenString *tok_str, Sym **nested_list,
4476 const int *macro_str, struct macro_level ** can_read_stream)
4478 Sym *s;
4479 int *macro_str1;
4480 const int *ptr;
4481 int t, ret;
4482 CValue cval;
4483 struct macro_level ml;
4485 /* first scan for '##' operator handling */
4486 ptr = macro_str;
4487 macro_str1 = macro_twosharps(ptr);
4488 if (macro_str1)
4489 ptr = macro_str1;
4490 while (1) {
4491 /* NOTE: ptr == NULL can only happen if tokens are read from
4492 file stream due to a macro function call */
4493 if (ptr == NULL)
4494 break;
4495 TOK_GET(t, ptr, cval);
4496 if (t == 0)
4497 break;
4498 s = define_find(t);
4499 if (s != NULL) {
4500 /* if nested substitution, do nothing */
4501 if (sym_find2(*nested_list, t))
4502 goto no_subst;
4503 ml.p = macro_ptr;
4504 if (can_read_stream)
4505 ml.prev = *can_read_stream, *can_read_stream = &ml;
4506 macro_ptr = (int *)ptr;
4507 tok = t;
4508 ret = macro_subst_tok(tok_str, nested_list, s, can_read_stream);
4509 ptr = (int *)macro_ptr;
4510 macro_ptr = ml.p;
4511 if (can_read_stream && *can_read_stream == &ml)
4512 *can_read_stream = ml.prev;
4513 if (ret != 0)
4514 goto no_subst;
4515 } else {
4516 no_subst:
4517 tok_str_add2(tok_str, t, &cval);
4520 if (macro_str1)
4521 tok_str_free(macro_str1);
4524 /* return next token with macro substitution */
4525 static void next(void)
4527 Sym *nested_list, *s;
4528 TokenString str;
4529 struct macro_level *ml;
4531 redo:
4532 next_nomacro();
4533 if (!macro_ptr) {
4534 /* if not reading from macro substituted string, then try
4535 to substitute macros */
4536 if (tok >= TOK_IDENT &&
4537 (parse_flags & PARSE_FLAG_PREPROCESS)) {
4538 s = define_find(tok);
4539 if (s) {
4540 /* we have a macro: we try to substitute */
4541 tok_str_new(&str);
4542 nested_list = NULL;
4543 ml = NULL;
4544 if (macro_subst_tok(&str, &nested_list, s, &ml) == 0) {
4545 /* substitution done, NOTE: maybe empty */
4546 tok_str_add(&str, 0);
4547 macro_ptr = str.str;
4548 macro_ptr_allocated = str.str;
4549 goto redo;
4553 } else {
4554 if (tok == 0) {
4555 /* end of macro or end of unget buffer */
4556 if (unget_buffer_enabled) {
4557 macro_ptr = unget_saved_macro_ptr;
4558 unget_buffer_enabled = 0;
4559 } else {
4560 /* end of macro string: free it */
4561 tok_str_free(macro_ptr_allocated);
4562 macro_ptr = NULL;
4564 goto redo;
4568 /* convert preprocessor tokens into C tokens */
4569 if (tok == TOK_PPNUM &&
4570 (parse_flags & PARSE_FLAG_TOK_NUM)) {
4571 parse_number((char *)tokc.cstr->data);
4575 /* push back current token and set current token to 'last_tok'. Only
4576 identifier case handled for labels. */
4577 static inline void unget_tok(int last_tok)
4579 int i, n;
4580 int *q;
4581 unget_saved_macro_ptr = macro_ptr;
4582 unget_buffer_enabled = 1;
4583 q = unget_saved_buffer;
4584 macro_ptr = q;
4585 *q++ = tok;
4586 n = tok_ext_size(tok) - 1;
4587 for(i=0;i<n;i++)
4588 *q++ = tokc.tab[i];
4589 *q = 0; /* end of token string */
4590 tok = last_tok;
4594 void swap(int *p, int *q)
4596 int t;
4597 t = *p;
4598 *p = *q;
4599 *q = t;
4602 void vsetc(CType *type, int r, CValue *vc)
4604 int v;
4606 if (vtop >= vstack + (VSTACK_SIZE - 1))
4607 error("memory full");
4608 /* cannot let cpu flags if other instruction are generated. Also
4609 avoid leaving VT_JMP anywhere except on the top of the stack
4610 because it would complicate the code generator. */
4611 if (vtop >= vstack) {
4612 v = vtop->r & VT_VALMASK;
4613 if (v == VT_CMP || (v & ~1) == VT_JMP)
4614 gv(RC_INT);
4616 vtop++;
4617 vtop->type = *type;
4618 vtop->r = r;
4619 vtop->r2 = VT_CONST;
4620 vtop->c = *vc;
4623 /* push integer constant */
4624 void vpushi(int v)
4626 CValue cval;
4627 cval.i = v;
4628 vsetc(&int_type, VT_CONST, &cval);
4631 /* Return a static symbol pointing to a section */
4632 static Sym *get_sym_ref(CType *type, Section *sec,
4633 unsigned long offset, unsigned long size)
4635 int v;
4636 Sym *sym;
4638 v = anon_sym++;
4639 sym = global_identifier_push(v, type->t | VT_STATIC, 0);
4640 sym->type.ref = type->ref;
4641 sym->r = VT_CONST | VT_SYM;
4642 put_extern_sym(sym, sec, offset, size);
4643 return sym;
4646 /* push a reference to a section offset by adding a dummy symbol */
4647 static void vpush_ref(CType *type, Section *sec, unsigned long offset, unsigned long size)
4649 CValue cval;
4651 cval.ul = 0;
4652 vsetc(type, VT_CONST | VT_SYM, &cval);
4653 vtop->sym = get_sym_ref(type, sec, offset, size);
4656 /* define a new external reference to a symbol 'v' of type 'u' */
4657 static Sym *external_global_sym(int v, CType *type, int r)
4659 Sym *s;
4661 s = sym_find(v);
4662 if (!s) {
4663 /* push forward reference */
4664 s = global_identifier_push(v, type->t | VT_EXTERN, 0);
4665 s->type.ref = type->ref;
4666 s->r = r | VT_CONST | VT_SYM;
4668 return s;
4671 /* define a new external reference to a symbol 'v' of type 'u' */
4672 static Sym *external_sym(int v, CType *type, int r)
4674 Sym *s;
4676 s = sym_find(v);
4677 if (!s) {
4678 /* push forward reference */
4679 s = sym_push(v, type, r | VT_CONST | VT_SYM, 0);
4680 s->type.t |= VT_EXTERN;
4681 } else {
4682 if (!is_compatible_types(&s->type, type))
4683 error("incompatible types for redefinition of '%s'",
4684 get_tok_str(v, NULL));
4686 return s;
4689 /* push a reference to global symbol v */
4690 static void vpush_global_sym(CType *type, int v)
4692 Sym *sym;
4693 CValue cval;
4695 sym = external_global_sym(v, type, 0);
4696 cval.ul = 0;
4697 vsetc(type, VT_CONST | VT_SYM, &cval);
4698 vtop->sym = sym;
4701 void vset(CType *type, int r, int v)
4703 CValue cval;
4705 cval.i = v;
4706 vsetc(type, r, &cval);
4709 void vseti(int r, int v)
4711 CType type;
4712 type.t = VT_INT;
4713 vset(&type, r, v);
4716 void vswap(void)
4718 SValue tmp;
4720 tmp = vtop[0];
4721 vtop[0] = vtop[-1];
4722 vtop[-1] = tmp;
4725 void vpushv(SValue *v)
4727 if (vtop >= vstack + (VSTACK_SIZE - 1))
4728 error("memory full");
4729 vtop++;
4730 *vtop = *v;
4733 void vdup(void)
4735 vpushv(vtop);
4738 /* save r to the memory stack, and mark it as being free */
4739 void save_reg(int r)
4741 int l, saved, size, align;
4742 SValue *p, sv;
4743 CType *type;
4745 /* modify all stack values */
4746 saved = 0;
4747 l = 0;
4748 for(p=vstack;p<=vtop;p++) {
4749 if ((p->r & VT_VALMASK) == r ||
4750 ((p->type.t & VT_BTYPE) == VT_LLONG && (p->r2 & VT_VALMASK) == r)) {
4751 /* must save value on stack if not already done */
4752 if (!saved) {
4753 /* NOTE: must reload 'r' because r might be equal to r2 */
4754 r = p->r & VT_VALMASK;
4755 /* store register in the stack */
4756 type = &p->type;
4757 if ((p->r & VT_LVAL) ||
4758 (!is_float(type->t) && (type->t & VT_BTYPE) != VT_LLONG))
4759 type = &int_type;
4760 size = type_size(type, &align);
4761 loc = (loc - size) & -align;
4762 sv.type.t = type->t;
4763 sv.r = VT_LOCAL | VT_LVAL;
4764 sv.c.ul = loc;
4765 store(r, &sv);
4766 #ifdef TCC_TARGET_I386
4767 /* x86 specific: need to pop fp register ST0 if saved */
4768 if (r == TREG_ST0) {
4769 o(0xd9dd); /* fstp %st(1) */
4771 #endif
4772 /* special long long case */
4773 if ((type->t & VT_BTYPE) == VT_LLONG) {
4774 sv.c.ul += 4;
4775 store(p->r2, &sv);
4777 l = loc;
4778 saved = 1;
4780 /* mark that stack entry as being saved on the stack */
4781 if (p->r & VT_LVAL) {
4782 /* also clear the bounded flag because the
4783 relocation address of the function was stored in
4784 p->c.ul */
4785 p->r = (p->r & ~(VT_VALMASK | VT_BOUNDED)) | VT_LLOCAL;
4786 } else {
4787 p->r = lvalue_type(p->type.t) | VT_LOCAL;
4789 p->r2 = VT_CONST;
4790 p->c.ul = l;
4795 /* find a register of class 'rc2' with at most one reference on stack.
4796 * If none, call get_reg(rc) */
4797 int get_reg_ex(int rc, int rc2)
4799 int r;
4800 SValue *p;
4802 for(r=0;r<NB_REGS;r++) {
4803 if (reg_classes[r] & rc2) {
4804 int n;
4805 n=0;
4806 for(p = vstack; p <= vtop; p++) {
4807 if ((p->r & VT_VALMASK) == r ||
4808 (p->r2 & VT_VALMASK) == r)
4809 n++;
4811 if (n <= 1)
4812 return r;
4815 return get_reg(rc);
4818 /* find a free register of class 'rc'. If none, save one register */
4819 int get_reg(int rc)
4821 int r;
4822 SValue *p;
4824 /* find a free register */
4825 for(r=0;r<NB_REGS;r++) {
4826 if (reg_classes[r] & rc) {
4827 for(p=vstack;p<=vtop;p++) {
4828 if ((p->r & VT_VALMASK) == r ||
4829 (p->r2 & VT_VALMASK) == r)
4830 goto notfound;
4832 return r;
4834 notfound: ;
4837 /* no register left : free the first one on the stack (VERY
4838 IMPORTANT to start from the bottom to ensure that we don't
4839 spill registers used in gen_opi()) */
4840 for(p=vstack;p<=vtop;p++) {
4841 r = p->r & VT_VALMASK;
4842 if (r < VT_CONST && (reg_classes[r] & rc))
4843 goto save_found;
4844 /* also look at second register (if long long) */
4845 r = p->r2 & VT_VALMASK;
4846 if (r < VT_CONST && (reg_classes[r] & rc)) {
4847 save_found:
4848 save_reg(r);
4849 return r;
4852 /* Should never comes here */
4853 return -1;
4856 /* save registers up to (vtop - n) stack entry */
4857 void save_regs(int n)
4859 int r;
4860 SValue *p, *p1;
4861 p1 = vtop - n;
4862 for(p = vstack;p <= p1; p++) {
4863 r = p->r & VT_VALMASK;
4864 if (r < VT_CONST) {
4865 save_reg(r);
4870 /* move register 's' to 'r', and flush previous value of r to memory
4871 if needed */
4872 void move_reg(int r, int s)
4874 SValue sv;
4876 if (r != s) {
4877 save_reg(r);
4878 sv.type.t = VT_INT;
4879 sv.r = s;
4880 sv.c.ul = 0;
4881 load(r, &sv);
4885 /* get address of vtop (vtop MUST BE an lvalue) */
4886 void gaddrof(void)
4888 vtop->r &= ~VT_LVAL;
4889 /* tricky: if saved lvalue, then we can go back to lvalue */
4890 if ((vtop->r & VT_VALMASK) == VT_LLOCAL)
4891 vtop->r = (vtop->r & ~(VT_VALMASK | VT_LVAL_TYPE)) | VT_LOCAL | VT_LVAL;
4894 #ifdef CONFIG_TCC_BCHECK
4895 /* generate lvalue bound code */
4896 void gbound(void)
4898 int lval_type;
4899 CType type1;
4901 vtop->r &= ~VT_MUSTBOUND;
4902 /* if lvalue, then use checking code before dereferencing */
4903 if (vtop->r & VT_LVAL) {
4904 /* if not VT_BOUNDED value, then make one */
4905 if (!(vtop->r & VT_BOUNDED)) {
4906 lval_type = vtop->r & (VT_LVAL_TYPE | VT_LVAL);
4907 /* must save type because we must set it to int to get pointer */
4908 type1 = vtop->type;
4909 vtop->type.t = VT_INT;
4910 gaddrof();
4911 vpushi(0);
4912 gen_bounded_ptr_add();
4913 vtop->r |= lval_type;
4914 vtop->type = type1;
4916 /* then check for dereferencing */
4917 gen_bounded_ptr_deref();
4920 #endif
4922 /* store vtop a register belonging to class 'rc'. lvalues are
4923 converted to values. Cannot be used if cannot be converted to
4924 register value (such as structures). */
4925 int gv(int rc)
4927 int r, r2, rc2, bit_pos, bit_size, size, align, i;
4928 unsigned long long ll;
4930 /* NOTE: get_reg can modify vstack[] */
4931 if (vtop->type.t & VT_BITFIELD) {
4932 CType type;
4933 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
4934 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
4935 /* remove bit field info to avoid loops */
4936 vtop->type.t &= ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT));
4937 /* cast to int to propagate signedness in following ops */
4938 type.t = VT_INT;
4939 if((vtop->type.t & VT_UNSIGNED) ||
4940 (vtop->type.t & VT_BTYPE) == VT_BOOL)
4941 type.t |= VT_UNSIGNED;
4942 gen_cast(&type);
4943 /* generate shifts */
4944 vpushi(32 - (bit_pos + bit_size));
4945 gen_op(TOK_SHL);
4946 vpushi(32 - bit_size);
4947 /* NOTE: transformed to SHR if unsigned */
4948 gen_op(TOK_SAR);
4949 r = gv(rc);
4950 } else {
4951 if (is_float(vtop->type.t) &&
4952 (vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
4953 Sym *sym;
4954 int *ptr;
4955 unsigned long offset;
4956 #if defined(TCC_TARGET_ARM) && !defined(TCC_ARM_VFP)
4957 CValue check;
4958 #endif
4960 /* XXX: unify with initializers handling ? */
4961 /* CPUs usually cannot use float constants, so we store them
4962 generically in data segment */
4963 size = type_size(&vtop->type, &align);
4964 offset = (data_section->data_offset + align - 1) & -align;
4965 data_section->data_offset = offset;
4966 /* XXX: not portable yet */
4967 #ifdef __i386__
4968 /* Zero pad x87 tenbyte long doubles */
4969 if (size == 12)
4970 vtop->c.tab[2] &= 0xffff;
4971 #endif
4972 ptr = section_ptr_add(data_section, size);
4973 size = size >> 2;
4974 #if defined(TCC_TARGET_ARM) && !defined(TCC_ARM_VFP)
4975 check.d = 1;
4976 if(check.tab[0])
4977 for(i=0;i<size;i++)
4978 ptr[i] = vtop->c.tab[size-1-i];
4979 else
4980 #endif
4981 for(i=0;i<size;i++)
4982 ptr[i] = vtop->c.tab[i];
4983 sym = get_sym_ref(&vtop->type, data_section, offset, size << 2);
4984 vtop->r |= VT_LVAL | VT_SYM;
4985 vtop->sym = sym;
4986 vtop->c.ul = 0;
4988 #ifdef CONFIG_TCC_BCHECK
4989 if (vtop->r & VT_MUSTBOUND)
4990 gbound();
4991 #endif
4993 r = vtop->r & VT_VALMASK;
4994 rc2 = RC_INT;
4995 if (rc == RC_IRET)
4996 rc2 = RC_LRET;
4997 /* need to reload if:
4998 - constant
4999 - lvalue (need to dereference pointer)
5000 - already a register, but not in the right class */
5001 if (r >= VT_CONST ||
5002 (vtop->r & VT_LVAL) ||
5003 !(reg_classes[r] & rc) ||
5004 ((vtop->type.t & VT_BTYPE) == VT_LLONG &&
5005 !(reg_classes[vtop->r2] & rc2))) {
5006 r = get_reg(rc);
5007 if ((vtop->type.t & VT_BTYPE) == VT_LLONG) {
5008 /* two register type load : expand to two words
5009 temporarily */
5010 if ((vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
5011 /* load constant */
5012 ll = vtop->c.ull;
5013 vtop->c.ui = ll; /* first word */
5014 load(r, vtop);
5015 vtop->r = r; /* save register value */
5016 vpushi(ll >> 32); /* second word */
5017 } else if (r >= VT_CONST || /* XXX: test to VT_CONST incorrect ? */
5018 (vtop->r & VT_LVAL)) {
5019 /* We do not want to modifier the long long
5020 pointer here, so the safest (and less
5021 efficient) is to save all the other registers
5022 in the stack. XXX: totally inefficient. */
5023 save_regs(1);
5024 /* load from memory */
5025 load(r, vtop);
5026 vdup();
5027 vtop[-1].r = r; /* save register value */
5028 /* increment pointer to get second word */
5029 vtop->type.t = VT_INT;
5030 gaddrof();
5031 vpushi(4);
5032 gen_op('+');
5033 vtop->r |= VT_LVAL;
5034 } else {
5035 /* move registers */
5036 load(r, vtop);
5037 vdup();
5038 vtop[-1].r = r; /* save register value */
5039 vtop->r = vtop[-1].r2;
5041 /* allocate second register */
5042 r2 = get_reg(rc2);
5043 load(r2, vtop);
5044 vpop();
5045 /* write second register */
5046 vtop->r2 = r2;
5047 } else if ((vtop->r & VT_LVAL) && !is_float(vtop->type.t)) {
5048 int t1, t;
5049 /* lvalue of scalar type : need to use lvalue type
5050 because of possible cast */
5051 t = vtop->type.t;
5052 t1 = t;
5053 /* compute memory access type */
5054 if (vtop->r & VT_LVAL_BYTE)
5055 t = VT_BYTE;
5056 else if (vtop->r & VT_LVAL_SHORT)
5057 t = VT_SHORT;
5058 if (vtop->r & VT_LVAL_UNSIGNED)
5059 t |= VT_UNSIGNED;
5060 vtop->type.t = t;
5061 load(r, vtop);
5062 /* restore wanted type */
5063 vtop->type.t = t1;
5064 } else {
5065 /* one register type load */
5066 load(r, vtop);
5069 vtop->r = r;
5070 #ifdef TCC_TARGET_C67
5071 /* uses register pairs for doubles */
5072 if ((vtop->type.t & VT_BTYPE) == VT_DOUBLE)
5073 vtop->r2 = r+1;
5074 #endif
5076 return r;
5079 /* generate vtop[-1] and vtop[0] in resp. classes rc1 and rc2 */
5080 void gv2(int rc1, int rc2)
5082 int v;
5084 /* generate more generic register first. But VT_JMP or VT_CMP
5085 values must be generated first in all cases to avoid possible
5086 reload errors */
5087 v = vtop[0].r & VT_VALMASK;
5088 if (v != VT_CMP && (v & ~1) != VT_JMP && rc1 <= rc2) {
5089 vswap();
5090 gv(rc1);
5091 vswap();
5092 gv(rc2);
5093 /* test if reload is needed for first register */
5094 if ((vtop[-1].r & VT_VALMASK) >= VT_CONST) {
5095 vswap();
5096 gv(rc1);
5097 vswap();
5099 } else {
5100 gv(rc2);
5101 vswap();
5102 gv(rc1);
5103 vswap();
5104 /* test if reload is needed for first register */
5105 if ((vtop[0].r & VT_VALMASK) >= VT_CONST) {
5106 gv(rc2);
5111 /* expand long long on stack in two int registers */
5112 void lexpand(void)
5114 int u;
5116 u = vtop->type.t & VT_UNSIGNED;
5117 gv(RC_INT);
5118 vdup();
5119 vtop[0].r = vtop[-1].r2;
5120 vtop[0].r2 = VT_CONST;
5121 vtop[-1].r2 = VT_CONST;
5122 vtop[0].type.t = VT_INT | u;
5123 vtop[-1].type.t = VT_INT | u;
5126 #ifdef TCC_TARGET_ARM
5127 /* expand long long on stack */
5128 void lexpand_nr(void)
5130 int u,v;
5132 u = vtop->type.t & VT_UNSIGNED;
5133 vdup();
5134 vtop->r2 = VT_CONST;
5135 vtop->type.t = VT_INT | u;
5136 v=vtop[-1].r & (VT_VALMASK | VT_LVAL);
5137 if (v == VT_CONST) {
5138 vtop[-1].c.ui = vtop->c.ull;
5139 vtop->c.ui = vtop->c.ull >> 32;
5140 vtop->r = VT_CONST;
5141 } else if (v == (VT_LVAL|VT_CONST) || v == (VT_LVAL|VT_LOCAL)) {
5142 vtop->c.ui += 4;
5143 vtop->r = vtop[-1].r;
5144 } else if (v > VT_CONST) {
5145 vtop--;
5146 lexpand();
5147 } else
5148 vtop->r = vtop[-1].r2;
5149 vtop[-1].r2 = VT_CONST;
5150 vtop[-1].type.t = VT_INT | u;
5152 #endif
5154 /* build a long long from two ints */
5155 void lbuild(int t)
5157 gv2(RC_INT, RC_INT);
5158 vtop[-1].r2 = vtop[0].r;
5159 vtop[-1].type.t = t;
5160 vpop();
5163 /* rotate n first stack elements to the bottom
5164 I1 ... In -> I2 ... In I1 [top is right]
5166 void vrotb(int n)
5168 int i;
5169 SValue tmp;
5171 tmp = vtop[-n + 1];
5172 for(i=-n+1;i!=0;i++)
5173 vtop[i] = vtop[i+1];
5174 vtop[0] = tmp;
5177 /* rotate n first stack elements to the top
5178 I1 ... In -> In I1 ... I(n-1) [top is right]
5180 void vrott(int n)
5182 int i;
5183 SValue tmp;
5185 tmp = vtop[0];
5186 for(i = 0;i < n - 1; i++)
5187 vtop[-i] = vtop[-i - 1];
5188 vtop[-n + 1] = tmp;
5191 #ifdef TCC_TARGET_ARM
5192 /* like vrott but in other direction
5193 In ... I1 -> I(n-1) ... I1 In [top is right]
5195 void vnrott(int n)
5197 int i;
5198 SValue tmp;
5200 tmp = vtop[-n + 1];
5201 for(i = n - 1; i > 0; i--)
5202 vtop[-i] = vtop[-i + 1];
5203 vtop[0] = tmp;
5205 #endif
5207 /* pop stack value */
5208 void vpop(void)
5210 int v;
5211 v = vtop->r & VT_VALMASK;
5212 #ifdef TCC_TARGET_I386
5213 /* for x86, we need to pop the FP stack */
5214 if (v == TREG_ST0 && !nocode_wanted) {
5215 o(0xd9dd); /* fstp %st(1) */
5216 } else
5217 #endif
5218 if (v == VT_JMP || v == VT_JMPI) {
5219 /* need to put correct jump if && or || without test */
5220 gsym(vtop->c.ul);
5222 vtop--;
5225 /* convert stack entry to register and duplicate its value in another
5226 register */
5227 void gv_dup(void)
5229 int rc, t, r, r1;
5230 SValue sv;
5232 t = vtop->type.t;
5233 if ((t & VT_BTYPE) == VT_LLONG) {
5234 lexpand();
5235 gv_dup();
5236 vswap();
5237 vrotb(3);
5238 gv_dup();
5239 vrotb(4);
5240 /* stack: H L L1 H1 */
5241 lbuild(t);
5242 vrotb(3);
5243 vrotb(3);
5244 vswap();
5245 lbuild(t);
5246 vswap();
5247 } else {
5248 /* duplicate value */
5249 rc = RC_INT;
5250 sv.type.t = VT_INT;
5251 if (is_float(t)) {
5252 rc = RC_FLOAT;
5253 sv.type.t = t;
5255 r = gv(rc);
5256 r1 = get_reg(rc);
5257 sv.r = r;
5258 sv.c.ul = 0;
5259 load(r1, &sv); /* move r to r1 */
5260 vdup();
5261 /* duplicates value */
5262 vtop->r = r1;
5266 /* generate CPU independent (unsigned) long long operations */
5267 void gen_opl(int op)
5269 int t, a, b, op1, c, i;
5270 int func;
5271 unsigned short reg_iret = REG_IRET;
5272 unsigned short reg_lret = REG_LRET;
5273 SValue tmp;
5275 switch(op) {
5276 case '/':
5277 case TOK_PDIV:
5278 func = TOK___divdi3;
5279 goto gen_func;
5280 case TOK_UDIV:
5281 func = TOK___udivdi3;
5282 goto gen_func;
5283 case '%':
5284 func = TOK___moddi3;
5285 goto gen_mod_func;
5286 case TOK_UMOD:
5287 func = TOK___umoddi3;
5288 gen_mod_func:
5289 #ifdef TCC_ARM_EABI
5290 reg_iret = TREG_R2;
5291 reg_lret = TREG_R3;
5292 #endif
5293 gen_func:
5294 /* call generic long long function */
5295 vpush_global_sym(&func_old_type, func);
5296 vrott(3);
5297 gfunc_call(2);
5298 vpushi(0);
5299 vtop->r = reg_iret;
5300 vtop->r2 = reg_lret;
5301 break;
5302 case '^':
5303 case '&':
5304 case '|':
5305 case '*':
5306 case '+':
5307 case '-':
5308 t = vtop->type.t;
5309 vswap();
5310 lexpand();
5311 vrotb(3);
5312 lexpand();
5313 /* stack: L1 H1 L2 H2 */
5314 tmp = vtop[0];
5315 vtop[0] = vtop[-3];
5316 vtop[-3] = tmp;
5317 tmp = vtop[-2];
5318 vtop[-2] = vtop[-3];
5319 vtop[-3] = tmp;
5320 vswap();
5321 /* stack: H1 H2 L1 L2 */
5322 if (op == '*') {
5323 vpushv(vtop - 1);
5324 vpushv(vtop - 1);
5325 gen_op(TOK_UMULL);
5326 lexpand();
5327 /* stack: H1 H2 L1 L2 ML MH */
5328 for(i=0;i<4;i++)
5329 vrotb(6);
5330 /* stack: ML MH H1 H2 L1 L2 */
5331 tmp = vtop[0];
5332 vtop[0] = vtop[-2];
5333 vtop[-2] = tmp;
5334 /* stack: ML MH H1 L2 H2 L1 */
5335 gen_op('*');
5336 vrotb(3);
5337 vrotb(3);
5338 gen_op('*');
5339 /* stack: ML MH M1 M2 */
5340 gen_op('+');
5341 gen_op('+');
5342 } else if (op == '+' || op == '-') {
5343 /* XXX: add non carry method too (for MIPS or alpha) */
5344 if (op == '+')
5345 op1 = TOK_ADDC1;
5346 else
5347 op1 = TOK_SUBC1;
5348 gen_op(op1);
5349 /* stack: H1 H2 (L1 op L2) */
5350 vrotb(3);
5351 vrotb(3);
5352 gen_op(op1 + 1); /* TOK_xxxC2 */
5353 } else {
5354 gen_op(op);
5355 /* stack: H1 H2 (L1 op L2) */
5356 vrotb(3);
5357 vrotb(3);
5358 /* stack: (L1 op L2) H1 H2 */
5359 gen_op(op);
5360 /* stack: (L1 op L2) (H1 op H2) */
5362 /* stack: L H */
5363 lbuild(t);
5364 break;
5365 case TOK_SAR:
5366 case TOK_SHR:
5367 case TOK_SHL:
5368 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
5369 t = vtop[-1].type.t;
5370 vswap();
5371 lexpand();
5372 vrotb(3);
5373 /* stack: L H shift */
5374 c = (int)vtop->c.i;
5375 /* constant: simpler */
5376 /* NOTE: all comments are for SHL. the other cases are
5377 done by swaping words */
5378 vpop();
5379 if (op != TOK_SHL)
5380 vswap();
5381 if (c >= 32) {
5382 /* stack: L H */
5383 vpop();
5384 if (c > 32) {
5385 vpushi(c - 32);
5386 gen_op(op);
5388 if (op != TOK_SAR) {
5389 vpushi(0);
5390 } else {
5391 gv_dup();
5392 vpushi(31);
5393 gen_op(TOK_SAR);
5395 vswap();
5396 } else {
5397 vswap();
5398 gv_dup();
5399 /* stack: H L L */
5400 vpushi(c);
5401 gen_op(op);
5402 vswap();
5403 vpushi(32 - c);
5404 if (op == TOK_SHL)
5405 gen_op(TOK_SHR);
5406 else
5407 gen_op(TOK_SHL);
5408 vrotb(3);
5409 /* stack: L L H */
5410 vpushi(c);
5411 if (op == TOK_SHL)
5412 gen_op(TOK_SHL);
5413 else
5414 gen_op(TOK_SHR);
5415 gen_op('|');
5417 if (op != TOK_SHL)
5418 vswap();
5419 lbuild(t);
5420 } else {
5421 /* XXX: should provide a faster fallback on x86 ? */
5422 switch(op) {
5423 case TOK_SAR:
5424 func = TOK___ashrdi3;
5425 goto gen_func;
5426 case TOK_SHR:
5427 func = TOK___lshrdi3;
5428 goto gen_func;
5429 case TOK_SHL:
5430 func = TOK___ashldi3;
5431 goto gen_func;
5434 break;
5435 default:
5436 /* compare operations */
5437 t = vtop->type.t;
5438 vswap();
5439 lexpand();
5440 vrotb(3);
5441 lexpand();
5442 /* stack: L1 H1 L2 H2 */
5443 tmp = vtop[-1];
5444 vtop[-1] = vtop[-2];
5445 vtop[-2] = tmp;
5446 /* stack: L1 L2 H1 H2 */
5447 /* compare high */
5448 op1 = op;
5449 /* when values are equal, we need to compare low words. since
5450 the jump is inverted, we invert the test too. */
5451 if (op1 == TOK_LT)
5452 op1 = TOK_LE;
5453 else if (op1 == TOK_GT)
5454 op1 = TOK_GE;
5455 else if (op1 == TOK_ULT)
5456 op1 = TOK_ULE;
5457 else if (op1 == TOK_UGT)
5458 op1 = TOK_UGE;
5459 a = 0;
5460 b = 0;
5461 gen_op(op1);
5462 if (op1 != TOK_NE) {
5463 a = gtst(1, 0);
5465 if (op != TOK_EQ) {
5466 /* generate non equal test */
5467 /* XXX: NOT PORTABLE yet */
5468 if (a == 0) {
5469 b = gtst(0, 0);
5470 } else {
5471 #if defined(TCC_TARGET_I386)
5472 b = psym(0x850f, 0);
5473 #elif defined(TCC_TARGET_ARM)
5474 b = ind;
5475 o(0x1A000000 | encbranch(ind, 0, 1));
5476 #elif defined(TCC_TARGET_C67)
5477 error("not implemented");
5478 #else
5479 #error not supported
5480 #endif
5483 /* compare low. Always unsigned */
5484 op1 = op;
5485 if (op1 == TOK_LT)
5486 op1 = TOK_ULT;
5487 else if (op1 == TOK_LE)
5488 op1 = TOK_ULE;
5489 else if (op1 == TOK_GT)
5490 op1 = TOK_UGT;
5491 else if (op1 == TOK_GE)
5492 op1 = TOK_UGE;
5493 gen_op(op1);
5494 a = gtst(1, a);
5495 gsym(b);
5496 vseti(VT_JMPI, a);
5497 break;
5501 /* handle integer constant optimizations and various machine
5502 independent opt */
5503 void gen_opic(int op)
5505 int c1, c2, t1, t2, n;
5506 SValue *v1, *v2;
5507 long long l1, l2;
5508 typedef unsigned long long U;
5510 v1 = vtop - 1;
5511 v2 = vtop;
5512 t1 = v1->type.t & VT_BTYPE;
5513 t2 = v2->type.t & VT_BTYPE;
5514 l1 = (t1 == VT_LLONG) ? v1->c.ll : v1->c.i;
5515 l2 = (t2 == VT_LLONG) ? v2->c.ll : v2->c.i;
5517 /* currently, we cannot do computations with forward symbols */
5518 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5519 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5520 if (c1 && c2) {
5521 switch(op) {
5522 case '+': l1 += l2; break;
5523 case '-': l1 -= l2; break;
5524 case '&': l1 &= l2; break;
5525 case '^': l1 ^= l2; break;
5526 case '|': l1 |= l2; break;
5527 case '*': l1 *= l2; break;
5529 case TOK_PDIV:
5530 case '/':
5531 case '%':
5532 case TOK_UDIV:
5533 case TOK_UMOD:
5534 /* if division by zero, generate explicit division */
5535 if (l2 == 0) {
5536 if (const_wanted)
5537 error("division by zero in constant");
5538 goto general_case;
5540 switch(op) {
5541 default: l1 /= l2; break;
5542 case '%': l1 %= l2; break;
5543 case TOK_UDIV: l1 = (U)l1 / l2; break;
5544 case TOK_UMOD: l1 = (U)l1 % l2; break;
5546 break;
5547 case TOK_SHL: l1 <<= l2; break;
5548 case TOK_SHR: l1 = (U)l1 >> l2; break;
5549 case TOK_SAR: l1 >>= l2; break;
5550 /* tests */
5551 case TOK_ULT: l1 = (U)l1 < (U)l2; break;
5552 case TOK_UGE: l1 = (U)l1 >= (U)l2; break;
5553 case TOK_EQ: l1 = l1 == l2; break;
5554 case TOK_NE: l1 = l1 != l2; break;
5555 case TOK_ULE: l1 = (U)l1 <= (U)l2; break;
5556 case TOK_UGT: l1 = (U)l1 > (U)l2; break;
5557 case TOK_LT: l1 = l1 < l2; break;
5558 case TOK_GE: l1 = l1 >= l2; break;
5559 case TOK_LE: l1 = l1 <= l2; break;
5560 case TOK_GT: l1 = l1 > l2; break;
5561 /* logical */
5562 case TOK_LAND: l1 = l1 && l2; break;
5563 case TOK_LOR: l1 = l1 || l2; break;
5564 default:
5565 goto general_case;
5567 v1->c.ll = l1;
5568 vtop--;
5569 } else {
5570 /* if commutative ops, put c2 as constant */
5571 if (c1 && (op == '+' || op == '&' || op == '^' ||
5572 op == '|' || op == '*')) {
5573 vswap();
5574 c2 = c1; //c = c1, c1 = c2, c2 = c;
5575 l2 = l1; //l = l1, l1 = l2, l2 = l;
5577 /* Filter out NOP operations like x*1, x-0, x&-1... */
5578 if (c2 && (((op == '*' || op == '/' || op == TOK_UDIV ||
5579 op == TOK_PDIV) &&
5580 l2 == 1) ||
5581 ((op == '+' || op == '-' || op == '|' || op == '^' ||
5582 op == TOK_SHL || op == TOK_SHR || op == TOK_SAR) &&
5583 l2 == 0) ||
5584 (op == '&' &&
5585 l2 == -1))) {
5586 /* nothing to do */
5587 vtop--;
5588 } else if (c2 && (op == '*' || op == TOK_PDIV || op == TOK_UDIV)) {
5589 /* try to use shifts instead of muls or divs */
5590 if (l2 > 0 && (l2 & (l2 - 1)) == 0) {
5591 n = -1;
5592 while (l2) {
5593 l2 >>= 1;
5594 n++;
5596 vtop->c.ll = n;
5597 if (op == '*')
5598 op = TOK_SHL;
5599 else if (op == TOK_PDIV)
5600 op = TOK_SAR;
5601 else
5602 op = TOK_SHR;
5604 goto general_case;
5605 } else if (c2 && (op == '+' || op == '-') &&
5606 ((vtop[-1].r & (VT_VALMASK | VT_LVAL | VT_SYM)) ==
5607 (VT_CONST | VT_SYM) ||
5608 (vtop[-1].r & (VT_VALMASK | VT_LVAL)) == VT_LOCAL)) {
5609 /* symbol + constant case */
5610 if (op == '-')
5611 l2 = -l2;
5612 vtop--;
5613 vtop->c.ll += l2;
5614 } else {
5615 general_case:
5616 if (!nocode_wanted) {
5617 /* call low level op generator */
5618 if (t1 == VT_LLONG || t2 == VT_LLONG)
5619 gen_opl(op);
5620 else
5621 gen_opi(op);
5622 } else {
5623 vtop--;
5629 /* generate a floating point operation with constant propagation */
5630 void gen_opif(int op)
5632 int c1, c2;
5633 SValue *v1, *v2;
5634 long double f1, f2;
5636 v1 = vtop - 1;
5637 v2 = vtop;
5638 /* currently, we cannot do computations with forward symbols */
5639 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5640 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5641 if (c1 && c2) {
5642 if (v1->type.t == VT_FLOAT) {
5643 f1 = v1->c.f;
5644 f2 = v2->c.f;
5645 } else if (v1->type.t == VT_DOUBLE) {
5646 f1 = v1->c.d;
5647 f2 = v2->c.d;
5648 } else {
5649 f1 = v1->c.ld;
5650 f2 = v2->c.ld;
5653 /* NOTE: we only do constant propagation if finite number (not
5654 NaN or infinity) (ANSI spec) */
5655 if (!ieee_finite(f1) || !ieee_finite(f2))
5656 goto general_case;
5658 switch(op) {
5659 case '+': f1 += f2; break;
5660 case '-': f1 -= f2; break;
5661 case '*': f1 *= f2; break;
5662 case '/':
5663 if (f2 == 0.0) {
5664 if (const_wanted)
5665 error("division by zero in constant");
5666 goto general_case;
5668 f1 /= f2;
5669 break;
5670 /* XXX: also handles tests ? */
5671 default:
5672 goto general_case;
5674 /* XXX: overflow test ? */
5675 if (v1->type.t == VT_FLOAT) {
5676 v1->c.f = f1;
5677 } else if (v1->type.t == VT_DOUBLE) {
5678 v1->c.d = f1;
5679 } else {
5680 v1->c.ld = f1;
5682 vtop--;
5683 } else {
5684 general_case:
5685 if (!nocode_wanted) {
5686 gen_opf(op);
5687 } else {
5688 vtop--;
5693 static int pointed_size(CType *type)
5695 int align;
5696 return type_size(pointed_type(type), &align);
5699 static inline int is_null_pointer(SValue *p)
5701 if ((p->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
5702 return 0;
5703 return ((p->type.t & VT_BTYPE) == VT_INT && p->c.i == 0) ||
5704 ((p->type.t & VT_BTYPE) == VT_LLONG && p->c.ll == 0);
5707 static inline int is_integer_btype(int bt)
5709 return (bt == VT_BYTE || bt == VT_SHORT ||
5710 bt == VT_INT || bt == VT_LLONG);
5713 /* check types for comparison or substraction of pointers */
5714 static void check_comparison_pointer_types(SValue *p1, SValue *p2, int op)
5716 CType *type1, *type2, tmp_type1, tmp_type2;
5717 int bt1, bt2;
5719 /* null pointers are accepted for all comparisons as gcc */
5720 if (is_null_pointer(p1) || is_null_pointer(p2))
5721 return;
5722 type1 = &p1->type;
5723 type2 = &p2->type;
5724 bt1 = type1->t & VT_BTYPE;
5725 bt2 = type2->t & VT_BTYPE;
5726 /* accept comparison between pointer and integer with a warning */
5727 if ((is_integer_btype(bt1) || is_integer_btype(bt2)) && op != '-') {
5728 if (op != TOK_LOR && op != TOK_LAND )
5729 warning("comparison between pointer and integer");
5730 return;
5733 /* both must be pointers or implicit function pointers */
5734 if (bt1 == VT_PTR) {
5735 type1 = pointed_type(type1);
5736 } else if (bt1 != VT_FUNC)
5737 goto invalid_operands;
5739 if (bt2 == VT_PTR) {
5740 type2 = pointed_type(type2);
5741 } else if (bt2 != VT_FUNC) {
5742 invalid_operands:
5743 error("invalid operands to binary %s", get_tok_str(op, NULL));
5745 if ((type1->t & VT_BTYPE) == VT_VOID ||
5746 (type2->t & VT_BTYPE) == VT_VOID)
5747 return;
5748 tmp_type1 = *type1;
5749 tmp_type2 = *type2;
5750 tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
5751 tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
5752 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
5753 /* gcc-like error if '-' is used */
5754 if (op == '-')
5755 goto invalid_operands;
5756 else
5757 warning("comparison of distinct pointer types lacks a cast");
5761 /* generic gen_op: handles types problems */
5762 void gen_op(int op)
5764 int u, t1, t2, bt1, bt2, t;
5765 CType type1;
5767 t1 = vtop[-1].type.t;
5768 t2 = vtop[0].type.t;
5769 bt1 = t1 & VT_BTYPE;
5770 bt2 = t2 & VT_BTYPE;
5772 if (bt1 == VT_PTR || bt2 == VT_PTR) {
5773 /* at least one operand is a pointer */
5774 /* relationnal op: must be both pointers */
5775 if (op >= TOK_ULT && op <= TOK_LOR) {
5776 check_comparison_pointer_types(vtop - 1, vtop, op);
5777 /* pointers are handled are unsigned */
5778 t = VT_INT | VT_UNSIGNED;
5779 goto std_op;
5781 /* if both pointers, then it must be the '-' op */
5782 if (bt1 == VT_PTR && bt2 == VT_PTR) {
5783 if (op != '-')
5784 error("cannot use pointers here");
5785 check_comparison_pointer_types(vtop - 1, vtop, op);
5786 /* XXX: check that types are compatible */
5787 u = pointed_size(&vtop[-1].type);
5788 gen_opic(op);
5789 /* set to integer type */
5790 vtop->type.t = VT_INT;
5791 vpushi(u);
5792 gen_op(TOK_PDIV);
5793 } else {
5794 /* exactly one pointer : must be '+' or '-'. */
5795 if (op != '-' && op != '+')
5796 error("cannot use pointers here");
5797 /* Put pointer as first operand */
5798 if (bt2 == VT_PTR) {
5799 vswap();
5800 swap(&t1, &t2);
5802 type1 = vtop[-1].type;
5803 /* XXX: cast to int ? (long long case) */
5804 vpushi(pointed_size(&vtop[-1].type));
5805 gen_op('*');
5806 #ifdef CONFIG_TCC_BCHECK
5807 /* if evaluating constant expression, no code should be
5808 generated, so no bound check */
5809 if (do_bounds_check && !const_wanted) {
5810 /* if bounded pointers, we generate a special code to
5811 test bounds */
5812 if (op == '-') {
5813 vpushi(0);
5814 vswap();
5815 gen_op('-');
5817 gen_bounded_ptr_add();
5818 } else
5819 #endif
5821 gen_opic(op);
5823 /* put again type if gen_opic() swaped operands */
5824 vtop->type = type1;
5826 } else if (is_float(bt1) || is_float(bt2)) {
5827 /* compute bigger type and do implicit casts */
5828 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
5829 t = VT_LDOUBLE;
5830 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
5831 t = VT_DOUBLE;
5832 } else {
5833 t = VT_FLOAT;
5835 /* floats can only be used for a few operations */
5836 if (op != '+' && op != '-' && op != '*' && op != '/' &&
5837 (op < TOK_ULT || op > TOK_GT))
5838 error("invalid operands for binary operation");
5839 goto std_op;
5840 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
5841 /* cast to biggest op */
5842 t = VT_LLONG;
5843 /* convert to unsigned if it does not fit in a long long */
5844 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
5845 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
5846 t |= VT_UNSIGNED;
5847 goto std_op;
5848 } else {
5849 /* integer operations */
5850 t = VT_INT;
5851 /* convert to unsigned if it does not fit in an integer */
5852 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
5853 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
5854 t |= VT_UNSIGNED;
5855 std_op:
5856 /* XXX: currently, some unsigned operations are explicit, so
5857 we modify them here */
5858 if (t & VT_UNSIGNED) {
5859 if (op == TOK_SAR)
5860 op = TOK_SHR;
5861 else if (op == '/')
5862 op = TOK_UDIV;
5863 else if (op == '%')
5864 op = TOK_UMOD;
5865 else if (op == TOK_LT)
5866 op = TOK_ULT;
5867 else if (op == TOK_GT)
5868 op = TOK_UGT;
5869 else if (op == TOK_LE)
5870 op = TOK_ULE;
5871 else if (op == TOK_GE)
5872 op = TOK_UGE;
5874 vswap();
5875 type1.t = t;
5876 gen_cast(&type1);
5877 vswap();
5878 /* special case for shifts and long long: we keep the shift as
5879 an integer */
5880 if (op == TOK_SHR || op == TOK_SAR || op == TOK_SHL)
5881 type1.t = VT_INT;
5882 gen_cast(&type1);
5883 if (is_float(t))
5884 gen_opif(op);
5885 else
5886 gen_opic(op);
5887 if (op >= TOK_ULT && op <= TOK_GT) {
5888 /* relationnal op: the result is an int */
5889 vtop->type.t = VT_INT;
5890 } else {
5891 vtop->type.t = t;
5896 #ifndef TCC_TARGET_ARM
5897 /* generic itof for unsigned long long case */
5898 void gen_cvt_itof1(int t)
5900 if ((vtop->type.t & (VT_BTYPE | VT_UNSIGNED)) ==
5901 (VT_LLONG | VT_UNSIGNED)) {
5903 if (t == VT_FLOAT)
5904 vpush_global_sym(&func_old_type, TOK___floatundisf);
5905 #if LDOUBLE_SIZE != 8
5906 else if (t == VT_LDOUBLE)
5907 vpush_global_sym(&func_old_type, TOK___floatundixf);
5908 #endif
5909 else
5910 vpush_global_sym(&func_old_type, TOK___floatundidf);
5911 vrott(2);
5912 gfunc_call(1);
5913 vpushi(0);
5914 vtop->r = REG_FRET;
5915 } else {
5916 gen_cvt_itof(t);
5919 #endif
5921 /* generic ftoi for unsigned long long case */
5922 void gen_cvt_ftoi1(int t)
5924 int st;
5926 if (t == (VT_LLONG | VT_UNSIGNED)) {
5927 /* not handled natively */
5928 st = vtop->type.t & VT_BTYPE;
5929 if (st == VT_FLOAT)
5930 vpush_global_sym(&func_old_type, TOK___fixunssfdi);
5931 #if LDOUBLE_SIZE != 8
5932 else if (st == VT_LDOUBLE)
5933 vpush_global_sym(&func_old_type, TOK___fixunsxfdi);
5934 #endif
5935 else
5936 vpush_global_sym(&func_old_type, TOK___fixunsdfdi);
5937 vrott(2);
5938 gfunc_call(1);
5939 vpushi(0);
5940 vtop->r = REG_IRET;
5941 vtop->r2 = REG_LRET;
5942 } else {
5943 gen_cvt_ftoi(t);
5947 /* force char or short cast */
5948 void force_charshort_cast(int t)
5950 int bits, dbt;
5951 dbt = t & VT_BTYPE;
5952 /* XXX: add optimization if lvalue : just change type and offset */
5953 if (dbt == VT_BYTE)
5954 bits = 8;
5955 else
5956 bits = 16;
5957 if (t & VT_UNSIGNED) {
5958 vpushi((1 << bits) - 1);
5959 gen_op('&');
5960 } else {
5961 bits = 32 - bits;
5962 vpushi(bits);
5963 gen_op(TOK_SHL);
5964 /* result must be signed or the SAR is converted to an SHL
5965 This was not the case when "t" was a signed short
5966 and the last value on the stack was an unsigned int */
5967 vtop->type.t &= ~VT_UNSIGNED;
5968 vpushi(bits);
5969 gen_op(TOK_SAR);
5973 /* cast 'vtop' to 'type'. Casting to bitfields is forbidden. */
5974 static void gen_cast(CType *type)
5976 int sbt, dbt, sf, df, c;
5978 /* special delayed cast for char/short */
5979 /* XXX: in some cases (multiple cascaded casts), it may still
5980 be incorrect */
5981 if (vtop->r & VT_MUSTCAST) {
5982 vtop->r &= ~VT_MUSTCAST;
5983 force_charshort_cast(vtop->type.t);
5986 /* bitfields first get cast to ints */
5987 if (vtop->type.t & VT_BITFIELD) {
5988 gv(RC_INT);
5991 dbt = type->t & (VT_BTYPE | VT_UNSIGNED);
5992 sbt = vtop->type.t & (VT_BTYPE | VT_UNSIGNED);
5994 if (sbt != dbt) {
5995 sf = is_float(sbt);
5996 df = is_float(dbt);
5997 c = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5998 if (c) {
5999 /* constant case: we can do it now */
6000 /* XXX: in ISOC, cannot do it if error in convert */
6001 if (sbt == VT_FLOAT)
6002 vtop->c.ld = vtop->c.f;
6003 else if (sbt == VT_DOUBLE)
6004 vtop->c.ld = vtop->c.d;
6006 if (df) {
6007 if ((sbt & VT_BTYPE) == VT_LLONG) {
6008 if (sbt & VT_UNSIGNED)
6009 vtop->c.ld = vtop->c.ull;
6010 else
6011 vtop->c.ld = vtop->c.ll;
6012 } else if(!sf) {
6013 if (sbt & VT_UNSIGNED)
6014 vtop->c.ld = vtop->c.ui;
6015 else
6016 vtop->c.ld = vtop->c.i;
6019 if (dbt == VT_FLOAT)
6020 vtop->c.f = (float)vtop->c.ld;
6021 else if (dbt == VT_DOUBLE)
6022 vtop->c.d = (double)vtop->c.ld;
6023 } else if (sf && dbt == (VT_LLONG|VT_UNSIGNED)) {
6024 vtop->c.ull = (unsigned long long)vtop->c.ld;
6025 } else if (sf && dbt == VT_BOOL) {
6026 vtop->c.i = (vtop->c.ld != 0);
6027 } else {
6028 if(sf)
6029 vtop->c.ll = (long long)vtop->c.ld;
6030 else if (sbt == (VT_LLONG|VT_UNSIGNED))
6031 vtop->c.ll = vtop->c.ull;
6032 else if (sbt & VT_UNSIGNED)
6033 vtop->c.ll = vtop->c.ui;
6034 else if (sbt != VT_LLONG)
6035 vtop->c.ll = vtop->c.i;
6037 if (dbt == (VT_LLONG|VT_UNSIGNED))
6038 vtop->c.ull = vtop->c.ll;
6039 else if (dbt == VT_BOOL)
6040 vtop->c.i = (vtop->c.ll != 0);
6041 else if (dbt != VT_LLONG) {
6042 int s = 0;
6043 if ((dbt & VT_BTYPE) == VT_BYTE)
6044 s = 24;
6045 else if ((dbt & VT_BTYPE) == VT_SHORT)
6046 s = 16;
6048 if(dbt & VT_UNSIGNED)
6049 vtop->c.ui = ((unsigned int)vtop->c.ll << s) >> s;
6050 else
6051 vtop->c.i = ((int)vtop->c.ll << s) >> s;
6054 } else if (!nocode_wanted) {
6055 /* non constant case: generate code */
6056 if (sf && df) {
6057 /* convert from fp to fp */
6058 gen_cvt_ftof(dbt);
6059 } else if (df) {
6060 /* convert int to fp */
6061 gen_cvt_itof1(dbt);
6062 } else if (sf) {
6063 /* convert fp to int */
6064 if (dbt == VT_BOOL) {
6065 vpushi(0);
6066 gen_op(TOK_NE);
6067 } else {
6068 /* we handle char/short/etc... with generic code */
6069 if (dbt != (VT_INT | VT_UNSIGNED) &&
6070 dbt != (VT_LLONG | VT_UNSIGNED) &&
6071 dbt != VT_LLONG)
6072 dbt = VT_INT;
6073 gen_cvt_ftoi1(dbt);
6074 if (dbt == VT_INT && (type->t & (VT_BTYPE | VT_UNSIGNED)) != dbt) {
6075 /* additional cast for char/short... */
6076 vtop->type.t = dbt;
6077 gen_cast(type);
6080 } else if ((dbt & VT_BTYPE) == VT_LLONG) {
6081 if ((sbt & VT_BTYPE) != VT_LLONG) {
6082 /* scalar to long long */
6083 /* machine independent conversion */
6084 gv(RC_INT);
6085 /* generate high word */
6086 if (sbt == (VT_INT | VT_UNSIGNED)) {
6087 vpushi(0);
6088 gv(RC_INT);
6089 } else {
6090 gv_dup();
6091 vpushi(31);
6092 gen_op(TOK_SAR);
6094 /* patch second register */
6095 vtop[-1].r2 = vtop->r;
6096 vpop();
6098 } else if (dbt == VT_BOOL) {
6099 /* scalar to bool */
6100 vpushi(0);
6101 gen_op(TOK_NE);
6102 } else if ((dbt & VT_BTYPE) == VT_BYTE ||
6103 (dbt & VT_BTYPE) == VT_SHORT) {
6104 if (sbt == VT_PTR) {
6105 vtop->type.t = VT_INT;
6106 warning("nonportable conversion from pointer to char/short");
6108 force_charshort_cast(dbt);
6109 } else if ((dbt & VT_BTYPE) == VT_INT) {
6110 /* scalar to int */
6111 if (sbt == VT_LLONG) {
6112 /* from long long: just take low order word */
6113 lexpand();
6114 vpop();
6116 /* if lvalue and single word type, nothing to do because
6117 the lvalue already contains the real type size (see
6118 VT_LVAL_xxx constants) */
6120 } else
6121 expect("constant expression");
6122 } else if ((dbt & VT_BTYPE) == VT_PTR && !(vtop->r & VT_LVAL)) {
6123 /* if we are casting between pointer types,
6124 we must update the VT_LVAL_xxx size */
6125 vtop->r = (vtop->r & ~VT_LVAL_TYPE)
6126 | (lvalue_type(type->ref->type.t) & VT_LVAL_TYPE);
6128 vtop->type = *type;
6131 /* return type size. Put alignment at 'a' */
6132 static int type_size(CType *type, int *a)
6134 Sym *s;
6135 int bt;
6137 bt = type->t & VT_BTYPE;
6138 if (bt == VT_STRUCT) {
6139 /* struct/union */
6140 s = type->ref;
6141 *a = s->r;
6142 return s->c;
6143 } else if (bt == VT_PTR) {
6144 if (type->t & VT_ARRAY) {
6145 s = type->ref;
6146 return type_size(&s->type, a) * s->c;
6147 } else {
6148 *a = PTR_SIZE;
6149 return PTR_SIZE;
6151 } else if (bt == VT_LDOUBLE) {
6152 *a = LDOUBLE_ALIGN;
6153 return LDOUBLE_SIZE;
6154 } else if (bt == VT_DOUBLE || bt == VT_LLONG) {
6155 #ifdef TCC_TARGET_I386
6156 *a = 4;
6157 #elif defined(TCC_TARGET_ARM)
6158 #ifdef TCC_ARM_EABI
6159 *a = 8;
6160 #else
6161 *a = 4;
6162 #endif
6163 #else
6164 *a = 8;
6165 #endif
6166 return 8;
6167 } else if (bt == VT_INT || bt == VT_ENUM || bt == VT_FLOAT) {
6168 *a = 4;
6169 return 4;
6170 } else if (bt == VT_SHORT) {
6171 *a = 2;
6172 return 2;
6173 } else {
6174 /* char, void, function, _Bool */
6175 *a = 1;
6176 return 1;
6180 /* return the pointed type of t */
6181 static inline CType *pointed_type(CType *type)
6183 return &type->ref->type;
6186 /* modify type so that its it is a pointer to type. */
6187 static void mk_pointer(CType *type)
6189 Sym *s;
6190 s = sym_push(SYM_FIELD, type, 0, -1);
6191 type->t = VT_PTR | (type->t & ~VT_TYPE);
6192 type->ref = s;
6195 /* compare function types. OLD functions match any new functions */
6196 static int is_compatible_func(CType *type1, CType *type2)
6198 Sym *s1, *s2;
6200 s1 = type1->ref;
6201 s2 = type2->ref;
6202 if (!is_compatible_types(&s1->type, &s2->type))
6203 return 0;
6204 /* check func_call */
6205 if (FUNC_CALL(s1->r) != FUNC_CALL(s2->r))
6206 return 0;
6207 /* XXX: not complete */
6208 if (s1->c == FUNC_OLD || s2->c == FUNC_OLD)
6209 return 1;
6210 if (s1->c != s2->c)
6211 return 0;
6212 while (s1 != NULL) {
6213 if (s2 == NULL)
6214 return 0;
6215 if (!is_compatible_parameter_types(&s1->type, &s2->type))
6216 return 0;
6217 s1 = s1->next;
6218 s2 = s2->next;
6220 if (s2)
6221 return 0;
6222 return 1;
6225 /* return true if type1 and type2 are the same. If unqualified is
6226 true, qualifiers on the types are ignored.
6228 - enums are not checked as gcc __builtin_types_compatible_p ()
6230 static int compare_types(CType *type1, CType *type2, int unqualified)
6232 int bt1, t1, t2;
6234 t1 = type1->t & VT_TYPE;
6235 t2 = type2->t & VT_TYPE;
6236 if (unqualified) {
6237 /* strip qualifiers before comparing */
6238 t1 &= ~(VT_CONSTANT | VT_VOLATILE);
6239 t2 &= ~(VT_CONSTANT | VT_VOLATILE);
6241 /* XXX: bitfields ? */
6242 if (t1 != t2)
6243 return 0;
6244 /* test more complicated cases */
6245 bt1 = t1 & VT_BTYPE;
6246 if (bt1 == VT_PTR) {
6247 type1 = pointed_type(type1);
6248 type2 = pointed_type(type2);
6249 return is_compatible_types(type1, type2);
6250 } else if (bt1 == VT_STRUCT) {
6251 return (type1->ref == type2->ref);
6252 } else if (bt1 == VT_FUNC) {
6253 return is_compatible_func(type1, type2);
6254 } else {
6255 return 1;
6259 /* return true if type1 and type2 are exactly the same (including
6260 qualifiers).
6262 static int is_compatible_types(CType *type1, CType *type2)
6264 return compare_types(type1,type2,0);
6267 /* return true if type1 and type2 are the same (ignoring qualifiers).
6269 static int is_compatible_parameter_types(CType *type1, CType *type2)
6271 return compare_types(type1,type2,1);
6274 /* print a type. If 'varstr' is not NULL, then the variable is also
6275 printed in the type */
6276 /* XXX: union */
6277 /* XXX: add array and function pointers */
6278 void type_to_str(char *buf, int buf_size,
6279 CType *type, const char *varstr)
6281 int bt, v, t;
6282 Sym *s, *sa;
6283 char buf1[256];
6284 const char *tstr;
6286 t = type->t & VT_TYPE;
6287 bt = t & VT_BTYPE;
6288 buf[0] = '\0';
6289 if (t & VT_CONSTANT)
6290 pstrcat(buf, buf_size, "const ");
6291 if (t & VT_VOLATILE)
6292 pstrcat(buf, buf_size, "volatile ");
6293 if (t & VT_UNSIGNED)
6294 pstrcat(buf, buf_size, "unsigned ");
6295 switch(bt) {
6296 case VT_VOID:
6297 tstr = "void";
6298 goto add_tstr;
6299 case VT_BOOL:
6300 tstr = "_Bool";
6301 goto add_tstr;
6302 case VT_BYTE:
6303 tstr = "char";
6304 goto add_tstr;
6305 case VT_SHORT:
6306 tstr = "short";
6307 goto add_tstr;
6308 case VT_INT:
6309 tstr = "int";
6310 goto add_tstr;
6311 case VT_LONG:
6312 tstr = "long";
6313 goto add_tstr;
6314 case VT_LLONG:
6315 tstr = "long long";
6316 goto add_tstr;
6317 case VT_FLOAT:
6318 tstr = "float";
6319 goto add_tstr;
6320 case VT_DOUBLE:
6321 tstr = "double";
6322 goto add_tstr;
6323 case VT_LDOUBLE:
6324 tstr = "long double";
6325 add_tstr:
6326 pstrcat(buf, buf_size, tstr);
6327 break;
6328 case VT_ENUM:
6329 case VT_STRUCT:
6330 if (bt == VT_STRUCT)
6331 tstr = "struct ";
6332 else
6333 tstr = "enum ";
6334 pstrcat(buf, buf_size, tstr);
6335 v = type->ref->v & ~SYM_STRUCT;
6336 if (v >= SYM_FIRST_ANOM)
6337 pstrcat(buf, buf_size, "<anonymous>");
6338 else
6339 pstrcat(buf, buf_size, get_tok_str(v, NULL));
6340 break;
6341 case VT_FUNC:
6342 s = type->ref;
6343 type_to_str(buf, buf_size, &s->type, varstr);
6344 pstrcat(buf, buf_size, "(");
6345 sa = s->next;
6346 while (sa != NULL) {
6347 type_to_str(buf1, sizeof(buf1), &sa->type, NULL);
6348 pstrcat(buf, buf_size, buf1);
6349 sa = sa->next;
6350 if (sa)
6351 pstrcat(buf, buf_size, ", ");
6353 pstrcat(buf, buf_size, ")");
6354 goto no_var;
6355 case VT_PTR:
6356 s = type->ref;
6357 pstrcpy(buf1, sizeof(buf1), "*");
6358 if (varstr)
6359 pstrcat(buf1, sizeof(buf1), varstr);
6360 type_to_str(buf, buf_size, &s->type, buf1);
6361 goto no_var;
6363 if (varstr) {
6364 pstrcat(buf, buf_size, " ");
6365 pstrcat(buf, buf_size, varstr);
6367 no_var: ;
6370 /* verify type compatibility to store vtop in 'dt' type, and generate
6371 casts if needed. */
6372 static void gen_assign_cast(CType *dt)
6374 CType *st, *type1, *type2, tmp_type1, tmp_type2;
6375 char buf1[256], buf2[256];
6376 int dbt, sbt;
6378 st = &vtop->type; /* source type */
6379 dbt = dt->t & VT_BTYPE;
6380 sbt = st->t & VT_BTYPE;
6381 if (dt->t & VT_CONSTANT)
6382 warning("assignment of read-only location");
6383 switch(dbt) {
6384 case VT_PTR:
6385 /* special cases for pointers */
6386 /* '0' can also be a pointer */
6387 if (is_null_pointer(vtop))
6388 goto type_ok;
6389 /* accept implicit pointer to integer cast with warning */
6390 if (is_integer_btype(sbt)) {
6391 warning("assignment makes pointer from integer without a cast");
6392 goto type_ok;
6394 type1 = pointed_type(dt);
6395 /* a function is implicitely a function pointer */
6396 if (sbt == VT_FUNC) {
6397 if ((type1->t & VT_BTYPE) != VT_VOID &&
6398 !is_compatible_types(pointed_type(dt), st))
6399 goto error;
6400 else
6401 goto type_ok;
6403 if (sbt != VT_PTR)
6404 goto error;
6405 type2 = pointed_type(st);
6406 if ((type1->t & VT_BTYPE) == VT_VOID ||
6407 (type2->t & VT_BTYPE) == VT_VOID) {
6408 /* void * can match anything */
6409 } else {
6410 /* exact type match, except for unsigned */
6411 tmp_type1 = *type1;
6412 tmp_type2 = *type2;
6413 tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
6414 tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
6415 if (!is_compatible_types(&tmp_type1, &tmp_type2))
6416 warning("assignment from incompatible pointer type");
6418 /* check const and volatile */
6419 if ((!(type1->t & VT_CONSTANT) && (type2->t & VT_CONSTANT)) ||
6420 (!(type1->t & VT_VOLATILE) && (type2->t & VT_VOLATILE)))
6421 warning("assignment discards qualifiers from pointer target type");
6422 break;
6423 case VT_BYTE:
6424 case VT_SHORT:
6425 case VT_INT:
6426 case VT_LLONG:
6427 if (sbt == VT_PTR || sbt == VT_FUNC) {
6428 warning("assignment makes integer from pointer without a cast");
6430 /* XXX: more tests */
6431 break;
6432 case VT_STRUCT:
6433 tmp_type1 = *dt;
6434 tmp_type2 = *st;
6435 tmp_type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
6436 tmp_type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
6437 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
6438 error:
6439 type_to_str(buf1, sizeof(buf1), st, NULL);
6440 type_to_str(buf2, sizeof(buf2), dt, NULL);
6441 error("cannot cast '%s' to '%s'", buf1, buf2);
6443 break;
6445 type_ok:
6446 gen_cast(dt);
6449 /* store vtop in lvalue pushed on stack */
6450 void vstore(void)
6452 int sbt, dbt, ft, r, t, size, align, bit_size, bit_pos, rc, delayed_cast;
6454 ft = vtop[-1].type.t;
6455 sbt = vtop->type.t & VT_BTYPE;
6456 dbt = ft & VT_BTYPE;
6457 if (((sbt == VT_INT || sbt == VT_SHORT) && dbt == VT_BYTE) ||
6458 (sbt == VT_INT && dbt == VT_SHORT)) {
6459 /* optimize char/short casts */
6460 delayed_cast = VT_MUSTCAST;
6461 vtop->type.t = ft & (VT_TYPE & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT)));
6462 /* XXX: factorize */
6463 if (ft & VT_CONSTANT)
6464 warning("assignment of read-only location");
6465 } else {
6466 delayed_cast = 0;
6467 if (!(ft & VT_BITFIELD))
6468 gen_assign_cast(&vtop[-1].type);
6471 if (sbt == VT_STRUCT) {
6472 /* if structure, only generate pointer */
6473 /* structure assignment : generate memcpy */
6474 /* XXX: optimize if small size */
6475 if (!nocode_wanted) {
6476 size = type_size(&vtop->type, &align);
6478 #ifdef TCC_ARM_EABI
6479 if(!(align & 7))
6480 vpush_global_sym(&func_old_type, TOK_memcpy8);
6481 else if(!(align & 3))
6482 vpush_global_sym(&func_old_type, TOK_memcpy4);
6483 else
6484 #endif
6485 vpush_global_sym(&func_old_type, TOK_memcpy);
6487 /* destination */
6488 vpushv(vtop - 2);
6489 vtop->type.t = VT_INT;
6490 gaddrof();
6491 /* source */
6492 vpushv(vtop - 2);
6493 vtop->type.t = VT_INT;
6494 gaddrof();
6495 /* type size */
6496 vpushi(size);
6497 gfunc_call(3);
6499 vswap();
6500 vpop();
6501 } else {
6502 vswap();
6503 vpop();
6505 /* leave source on stack */
6506 } else if (ft & VT_BITFIELD) {
6507 /* bitfield store handling */
6508 bit_pos = (ft >> VT_STRUCT_SHIFT) & 0x3f;
6509 bit_size = (ft >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
6510 /* remove bit field info to avoid loops */
6511 vtop[-1].type.t = ft & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT));
6513 /* duplicate source into other register */
6514 gv_dup();
6515 vswap();
6516 vrott(3);
6518 if((ft & VT_BTYPE) == VT_BOOL) {
6519 gen_cast(&vtop[-1].type);
6520 vtop[-1].type.t = (vtop[-1].type.t & ~VT_BTYPE) | (VT_BYTE | VT_UNSIGNED);
6523 /* duplicate destination */
6524 vdup();
6525 vtop[-1] = vtop[-2];
6527 /* mask and shift source */
6528 if((ft & VT_BTYPE) != VT_BOOL) {
6529 vpushi((1 << bit_size) - 1);
6530 gen_op('&');
6532 vpushi(bit_pos);
6533 gen_op(TOK_SHL);
6534 /* load destination, mask and or with source */
6535 vswap();
6536 vpushi(~(((1 << bit_size) - 1) << bit_pos));
6537 gen_op('&');
6538 gen_op('|');
6539 /* store result */
6540 vstore();
6542 /* pop off shifted source from "duplicate source..." above */
6543 vpop();
6545 } else {
6546 #ifdef CONFIG_TCC_BCHECK
6547 /* bound check case */
6548 if (vtop[-1].r & VT_MUSTBOUND) {
6549 vswap();
6550 gbound();
6551 vswap();
6553 #endif
6554 if (!nocode_wanted) {
6555 rc = RC_INT;
6556 if (is_float(ft))
6557 rc = RC_FLOAT;
6558 r = gv(rc); /* generate value */
6559 /* if lvalue was saved on stack, must read it */
6560 if ((vtop[-1].r & VT_VALMASK) == VT_LLOCAL) {
6561 SValue sv;
6562 t = get_reg(RC_INT);
6563 sv.type.t = VT_INT;
6564 sv.r = VT_LOCAL | VT_LVAL;
6565 sv.c.ul = vtop[-1].c.ul;
6566 load(t, &sv);
6567 vtop[-1].r = t | VT_LVAL;
6569 store(r, vtop - 1);
6570 /* two word case handling : store second register at word + 4 */
6571 if ((ft & VT_BTYPE) == VT_LLONG) {
6572 vswap();
6573 /* convert to int to increment easily */
6574 vtop->type.t = VT_INT;
6575 gaddrof();
6576 vpushi(4);
6577 gen_op('+');
6578 vtop->r |= VT_LVAL;
6579 vswap();
6580 /* XXX: it works because r2 is spilled last ! */
6581 store(vtop->r2, vtop - 1);
6584 vswap();
6585 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
6586 vtop->r |= delayed_cast;
6590 /* post defines POST/PRE add. c is the token ++ or -- */
6591 void inc(int post, int c)
6593 test_lvalue();
6594 vdup(); /* save lvalue */
6595 if (post) {
6596 gv_dup(); /* duplicate value */
6597 vrotb(3);
6598 vrotb(3);
6600 /* add constant */
6601 vpushi(c - TOK_MID);
6602 gen_op('+');
6603 vstore(); /* store value */
6604 if (post)
6605 vpop(); /* if post op, return saved value */
6608 /* Parse GNUC __attribute__ extension. Currently, the following
6609 extensions are recognized:
6610 - aligned(n) : set data/function alignment.
6611 - packed : force data alignment to 1
6612 - section(x) : generate data/code in this section.
6613 - unused : currently ignored, but may be used someday.
6614 - regparm(n) : pass function parameters in registers (i386 only)
6616 static void parse_attribute(AttributeDef *ad)
6618 int t, n;
6620 while (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) {
6621 next();
6622 skip('(');
6623 skip('(');
6624 while (tok != ')') {
6625 if (tok < TOK_IDENT)
6626 expect("attribute name");
6627 t = tok;
6628 next();
6629 switch(t) {
6630 case TOK_SECTION1:
6631 case TOK_SECTION2:
6632 skip('(');
6633 if (tok != TOK_STR)
6634 expect("section name");
6635 ad->section = find_section(tcc_state, (char *)tokc.cstr->data);
6636 next();
6637 skip(')');
6638 break;
6639 case TOK_ALIGNED1:
6640 case TOK_ALIGNED2:
6641 if (tok == '(') {
6642 next();
6643 n = expr_const();
6644 if (n <= 0 || (n & (n - 1)) != 0)
6645 error("alignment must be a positive power of two");
6646 skip(')');
6647 } else {
6648 n = MAX_ALIGN;
6650 ad->aligned = n;
6651 break;
6652 case TOK_PACKED1:
6653 case TOK_PACKED2:
6654 ad->packed = 1;
6655 break;
6656 case TOK_UNUSED1:
6657 case TOK_UNUSED2:
6658 /* currently, no need to handle it because tcc does not
6659 track unused objects */
6660 break;
6661 case TOK_NORETURN1:
6662 case TOK_NORETURN2:
6663 /* currently, no need to handle it because tcc does not
6664 track unused objects */
6665 break;
6666 case TOK_CDECL1:
6667 case TOK_CDECL2:
6668 case TOK_CDECL3:
6669 FUNC_CALL(ad->func_attr) = FUNC_CDECL;
6670 break;
6671 case TOK_STDCALL1:
6672 case TOK_STDCALL2:
6673 case TOK_STDCALL3:
6674 FUNC_CALL(ad->func_attr) = FUNC_STDCALL;
6675 break;
6676 #ifdef TCC_TARGET_I386
6677 case TOK_REGPARM1:
6678 case TOK_REGPARM2:
6679 skip('(');
6680 n = expr_const();
6681 if (n > 3)
6682 n = 3;
6683 else if (n < 0)
6684 n = 0;
6685 if (n > 0)
6686 FUNC_CALL(ad->func_attr) = FUNC_FASTCALL1 + n - 1;
6687 skip(')');
6688 break;
6689 case TOK_FASTCALL1:
6690 case TOK_FASTCALL2:
6691 case TOK_FASTCALL3:
6692 FUNC_CALL(ad->func_attr) = FUNC_FASTCALLW;
6693 break;
6694 #endif
6695 case TOK_DLLEXPORT:
6696 FUNC_EXPORT(ad->func_attr) = 1;
6697 break;
6698 default:
6699 if (tcc_state->warn_unsupported)
6700 warning("'%s' attribute ignored", get_tok_str(t, NULL));
6701 /* skip parameters */
6702 if (tok == '(') {
6703 int parenthesis = 0;
6704 do {
6705 if (tok == '(')
6706 parenthesis++;
6707 else if (tok == ')')
6708 parenthesis--;
6709 next();
6710 } while (parenthesis && tok != -1);
6712 break;
6714 if (tok != ',')
6715 break;
6716 next();
6718 skip(')');
6719 skip(')');
6723 /* enum/struct/union declaration. u is either VT_ENUM or VT_STRUCT */
6724 static void struct_decl(CType *type, int u)
6726 int a, v, size, align, maxalign, c, offset;
6727 int bit_size, bit_pos, bsize, bt, lbit_pos, prevbt;
6728 Sym *s, *ss, *ass, **ps;
6729 AttributeDef ad;
6730 CType type1, btype;
6732 a = tok; /* save decl type */
6733 next();
6734 if (tok != '{') {
6735 v = tok;
6736 next();
6737 /* struct already defined ? return it */
6738 if (v < TOK_IDENT)
6739 expect("struct/union/enum name");
6740 s = struct_find(v);
6741 if (s) {
6742 if (s->type.t != a)
6743 error("invalid type");
6744 goto do_decl;
6746 } else {
6747 v = anon_sym++;
6749 type1.t = a;
6750 /* we put an undefined size for struct/union */
6751 s = sym_push(v | SYM_STRUCT, &type1, 0, -1);
6752 s->r = 0; /* default alignment is zero as gcc */
6753 /* put struct/union/enum name in type */
6754 do_decl:
6755 type->t = u;
6756 type->ref = s;
6758 if (tok == '{') {
6759 next();
6760 if (s->c != -1)
6761 error("struct/union/enum already defined");
6762 /* cannot be empty */
6763 c = 0;
6764 /* non empty enums are not allowed */
6765 if (a == TOK_ENUM) {
6766 for(;;) {
6767 v = tok;
6768 if (v < TOK_UIDENT)
6769 expect("identifier");
6770 next();
6771 if (tok == '=') {
6772 next();
6773 c = expr_const();
6775 /* enum symbols have static storage */
6776 ss = sym_push(v, &int_type, VT_CONST, c);
6777 ss->type.t |= VT_STATIC;
6778 if (tok != ',')
6779 break;
6780 next();
6781 c++;
6782 /* NOTE: we accept a trailing comma */
6783 if (tok == '}')
6784 break;
6786 skip('}');
6787 } else {
6788 maxalign = 1;
6789 ps = &s->next;
6790 prevbt = VT_INT;
6791 bit_pos = 0;
6792 offset = 0;
6793 while (tok != '}') {
6794 parse_btype(&btype, &ad);
6795 while (1) {
6796 bit_size = -1;
6797 v = 0;
6798 type1 = btype;
6799 if (tok != ':') {
6800 type_decl(&type1, &ad, &v, TYPE_DIRECT | TYPE_ABSTRACT);
6801 if (v == 0 && (type1.t & VT_BTYPE) != VT_STRUCT)
6802 expect("identifier");
6803 if ((type1.t & VT_BTYPE) == VT_FUNC ||
6804 (type1.t & (VT_TYPEDEF | VT_STATIC | VT_EXTERN | VT_INLINE)))
6805 error("invalid type for '%s'",
6806 get_tok_str(v, NULL));
6808 if (tok == ':') {
6809 next();
6810 bit_size = expr_const();
6811 /* XXX: handle v = 0 case for messages */
6812 if (bit_size < 0)
6813 error("negative width in bit-field '%s'",
6814 get_tok_str(v, NULL));
6815 if (v && bit_size == 0)
6816 error("zero width for bit-field '%s'",
6817 get_tok_str(v, NULL));
6819 size = type_size(&type1, &align);
6820 if (ad.aligned) {
6821 if (align < ad.aligned)
6822 align = ad.aligned;
6823 } else if (ad.packed) {
6824 align = 1;
6825 } else if (*tcc_state->pack_stack_ptr) {
6826 if (align > *tcc_state->pack_stack_ptr)
6827 align = *tcc_state->pack_stack_ptr;
6829 lbit_pos = 0;
6830 if (bit_size >= 0) {
6831 bt = type1.t & VT_BTYPE;
6832 if (bt != VT_INT &&
6833 bt != VT_BYTE &&
6834 bt != VT_SHORT &&
6835 bt != VT_BOOL &&
6836 bt != VT_ENUM)
6837 error("bitfields must have scalar type");
6838 bsize = size * 8;
6839 if (bit_size > bsize) {
6840 error("width of '%s' exceeds its type",
6841 get_tok_str(v, NULL));
6842 } else if (bit_size == bsize) {
6843 /* no need for bit fields */
6844 bit_pos = 0;
6845 } else if (bit_size == 0) {
6846 /* XXX: what to do if only padding in a
6847 structure ? */
6848 /* zero size: means to pad */
6849 bit_pos = 0;
6850 } else {
6851 /* we do not have enough room ?
6852 did the type change?
6853 is it a union? */
6854 if ((bit_pos + bit_size) > bsize ||
6855 bt != prevbt || a == TOK_UNION)
6856 bit_pos = 0;
6857 lbit_pos = bit_pos;
6858 /* XXX: handle LSB first */
6859 type1.t |= VT_BITFIELD |
6860 (bit_pos << VT_STRUCT_SHIFT) |
6861 (bit_size << (VT_STRUCT_SHIFT + 6));
6862 bit_pos += bit_size;
6864 prevbt = bt;
6865 } else {
6866 bit_pos = 0;
6868 if (v != 0 || (type1.t & VT_BTYPE) == VT_STRUCT) {
6869 /* add new memory data only if starting
6870 bit field */
6871 if (lbit_pos == 0) {
6872 if (a == TOK_STRUCT) {
6873 c = (c + align - 1) & -align;
6874 offset = c;
6875 if (size > 0)
6876 c += size;
6877 } else {
6878 offset = 0;
6879 if (size > c)
6880 c = size;
6882 if (align > maxalign)
6883 maxalign = align;
6885 #if 0
6886 printf("add field %s offset=%d",
6887 get_tok_str(v, NULL), offset);
6888 if (type1.t & VT_BITFIELD) {
6889 printf(" pos=%d size=%d",
6890 (type1.t >> VT_STRUCT_SHIFT) & 0x3f,
6891 (type1.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f);
6893 printf("\n");
6894 #endif
6896 if (v == 0 && (type1.t & VT_BTYPE) == VT_STRUCT) {
6897 ass = type1.ref;
6898 while ((ass = ass->next) != NULL) {
6899 ss = sym_push(ass->v, &ass->type, 0, offset + ass->c);
6900 *ps = ss;
6901 ps = &ss->next;
6903 } else if (v) {
6904 ss = sym_push(v | SYM_FIELD, &type1, 0, offset);
6905 *ps = ss;
6906 ps = &ss->next;
6908 if (tok == ';' || tok == TOK_EOF)
6909 break;
6910 skip(',');
6912 skip(';');
6914 skip('}');
6915 /* store size and alignment */
6916 s->c = (c + maxalign - 1) & -maxalign;
6917 s->r = maxalign;
6922 /* return 0 if no type declaration. otherwise, return the basic type
6923 and skip it.
6925 static int parse_btype(CType *type, AttributeDef *ad)
6927 int t, u, type_found, typespec_found, typedef_found;
6928 Sym *s;
6929 CType type1;
6931 memset(ad, 0, sizeof(AttributeDef));
6932 type_found = 0;
6933 typespec_found = 0;
6934 typedef_found = 0;
6935 t = 0;
6936 while(1) {
6937 switch(tok) {
6938 case TOK_EXTENSION:
6939 /* currently, we really ignore extension */
6940 next();
6941 continue;
6943 /* basic types */
6944 case TOK_CHAR:
6945 u = VT_BYTE;
6946 basic_type:
6947 next();
6948 basic_type1:
6949 if ((t & VT_BTYPE) != 0)
6950 error("too many basic types");
6951 t |= u;
6952 typespec_found = 1;
6953 break;
6954 case TOK_VOID:
6955 u = VT_VOID;
6956 goto basic_type;
6957 case TOK_SHORT:
6958 u = VT_SHORT;
6959 goto basic_type;
6960 case TOK_INT:
6961 next();
6962 typespec_found = 1;
6963 break;
6964 case TOK_LONG:
6965 next();
6966 if ((t & VT_BTYPE) == VT_DOUBLE) {
6967 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
6968 } else if ((t & VT_BTYPE) == VT_LONG) {
6969 t = (t & ~VT_BTYPE) | VT_LLONG;
6970 } else {
6971 u = VT_LONG;
6972 goto basic_type1;
6974 break;
6975 case TOK_BOOL:
6976 u = VT_BOOL;
6977 goto basic_type;
6978 case TOK_FLOAT:
6979 u = VT_FLOAT;
6980 goto basic_type;
6981 case TOK_DOUBLE:
6982 next();
6983 if ((t & VT_BTYPE) == VT_LONG) {
6984 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
6985 } else {
6986 u = VT_DOUBLE;
6987 goto basic_type1;
6989 break;
6990 case TOK_ENUM:
6991 struct_decl(&type1, VT_ENUM);
6992 basic_type2:
6993 u = type1.t;
6994 type->ref = type1.ref;
6995 goto basic_type1;
6996 case TOK_STRUCT:
6997 case TOK_UNION:
6998 struct_decl(&type1, VT_STRUCT);
6999 goto basic_type2;
7001 /* type modifiers */
7002 case TOK_CONST1:
7003 case TOK_CONST2:
7004 case TOK_CONST3:
7005 t |= VT_CONSTANT;
7006 next();
7007 break;
7008 case TOK_VOLATILE1:
7009 case TOK_VOLATILE2:
7010 case TOK_VOLATILE3:
7011 t |= VT_VOLATILE;
7012 next();
7013 break;
7014 case TOK_SIGNED1:
7015 case TOK_SIGNED2:
7016 case TOK_SIGNED3:
7017 typespec_found = 1;
7018 t |= VT_SIGNED;
7019 next();
7020 break;
7021 case TOK_REGISTER:
7022 case TOK_AUTO:
7023 case TOK_RESTRICT1:
7024 case TOK_RESTRICT2:
7025 case TOK_RESTRICT3:
7026 next();
7027 break;
7028 case TOK_UNSIGNED:
7029 t |= VT_UNSIGNED;
7030 next();
7031 typespec_found = 1;
7032 break;
7034 /* storage */
7035 case TOK_EXTERN:
7036 t |= VT_EXTERN;
7037 next();
7038 break;
7039 case TOK_STATIC:
7040 t |= VT_STATIC;
7041 next();
7042 break;
7043 case TOK_TYPEDEF:
7044 t |= VT_TYPEDEF;
7045 next();
7046 break;
7047 case TOK_INLINE1:
7048 case TOK_INLINE2:
7049 case TOK_INLINE3:
7050 t |= VT_INLINE;
7051 next();
7052 break;
7054 /* GNUC attribute */
7055 case TOK_ATTRIBUTE1:
7056 case TOK_ATTRIBUTE2:
7057 parse_attribute(ad);
7058 break;
7059 /* GNUC typeof */
7060 case TOK_TYPEOF1:
7061 case TOK_TYPEOF2:
7062 case TOK_TYPEOF3:
7063 next();
7064 parse_expr_type(&type1);
7065 goto basic_type2;
7066 default:
7067 if (typespec_found || typedef_found)
7068 goto the_end;
7069 s = sym_find(tok);
7070 if (!s || !(s->type.t & VT_TYPEDEF))
7071 goto the_end;
7072 typedef_found = 1;
7073 t |= (s->type.t & ~VT_TYPEDEF);
7074 type->ref = s->type.ref;
7075 next();
7076 typespec_found = 1;
7077 break;
7079 type_found = 1;
7081 the_end:
7082 if ((t & (VT_SIGNED|VT_UNSIGNED)) == (VT_SIGNED|VT_UNSIGNED))
7083 error("signed and unsigned modifier");
7084 if (tcc_state->char_is_unsigned) {
7085 if ((t & (VT_SIGNED|VT_UNSIGNED|VT_BTYPE)) == VT_BYTE)
7086 t |= VT_UNSIGNED;
7088 t &= ~VT_SIGNED;
7090 /* long is never used as type */
7091 if ((t & VT_BTYPE) == VT_LONG)
7092 t = (t & ~VT_BTYPE) | VT_INT;
7093 type->t = t;
7094 return type_found;
7097 /* convert a function parameter type (array to pointer and function to
7098 function pointer) */
7099 static inline void convert_parameter_type(CType *pt)
7101 /* remove const and volatile qualifiers (XXX: const could be used
7102 to indicate a const function parameter */
7103 pt->t &= ~(VT_CONSTANT | VT_VOLATILE);
7104 /* array must be transformed to pointer according to ANSI C */
7105 pt->t &= ~VT_ARRAY;
7106 if ((pt->t & VT_BTYPE) == VT_FUNC) {
7107 mk_pointer(pt);
7111 static void post_type(CType *type, AttributeDef *ad)
7113 int n, l, t1, arg_size, align;
7114 Sym **plast, *s, *first;
7115 AttributeDef ad1;
7116 CType pt;
7118 if (tok == '(') {
7119 /* function declaration */
7120 next();
7121 l = 0;
7122 first = NULL;
7123 plast = &first;
7124 arg_size = 0;
7125 if (tok != ')') {
7126 for(;;) {
7127 /* read param name and compute offset */
7128 if (l != FUNC_OLD) {
7129 if (!parse_btype(&pt, &ad1)) {
7130 if (l) {
7131 error("invalid type");
7132 } else {
7133 l = FUNC_OLD;
7134 goto old_proto;
7137 l = FUNC_NEW;
7138 if ((pt.t & VT_BTYPE) == VT_VOID && tok == ')')
7139 break;
7140 type_decl(&pt, &ad1, &n, TYPE_DIRECT | TYPE_ABSTRACT);
7141 if ((pt.t & VT_BTYPE) == VT_VOID)
7142 error("parameter declared as void");
7143 arg_size += (type_size(&pt, &align) + 3) & ~3;
7144 } else {
7145 old_proto:
7146 n = tok;
7147 if (n < TOK_UIDENT)
7148 expect("identifier");
7149 pt.t = VT_INT;
7150 next();
7152 convert_parameter_type(&pt);
7153 s = sym_push(n | SYM_FIELD, &pt, 0, 0);
7154 *plast = s;
7155 plast = &s->next;
7156 if (tok == ')')
7157 break;
7158 skip(',');
7159 if (l == FUNC_NEW && tok == TOK_DOTS) {
7160 l = FUNC_ELLIPSIS;
7161 next();
7162 break;
7166 /* if no parameters, then old type prototype */
7167 if (l == 0)
7168 l = FUNC_OLD;
7169 skip(')');
7170 t1 = type->t & VT_STORAGE;
7171 /* NOTE: const is ignored in returned type as it has a special
7172 meaning in gcc / C++ */
7173 type->t &= ~(VT_STORAGE | VT_CONSTANT);
7174 post_type(type, ad);
7175 /* we push a anonymous symbol which will contain the function prototype */
7176 FUNC_ARGS(ad->func_attr) = arg_size;
7177 s = sym_push(SYM_FIELD, type, ad->func_attr, l);
7178 s->next = first;
7179 type->t = t1 | VT_FUNC;
7180 type->ref = s;
7181 } else if (tok == '[') {
7182 /* array definition */
7183 next();
7184 n = -1;
7185 if (tok != ']') {
7186 n = expr_const();
7187 if (n < 0)
7188 error("invalid array size");
7190 skip(']');
7191 /* parse next post type */
7192 t1 = type->t & VT_STORAGE;
7193 type->t &= ~VT_STORAGE;
7194 post_type(type, ad);
7196 /* we push a anonymous symbol which will contain the array
7197 element type */
7198 s = sym_push(SYM_FIELD, type, 0, n);
7199 type->t = t1 | VT_ARRAY | VT_PTR;
7200 type->ref = s;
7204 /* Parse a type declaration (except basic type), and return the type
7205 in 'type'. 'td' is a bitmask indicating which kind of type decl is
7206 expected. 'type' should contain the basic type. 'ad' is the
7207 attribute definition of the basic type. It can be modified by
7208 type_decl().
7210 static void type_decl(CType *type, AttributeDef *ad, int *v, int td)
7212 Sym *s;
7213 CType type1, *type2;
7214 int qualifiers;
7216 while (tok == '*') {
7217 qualifiers = 0;
7218 redo:
7219 next();
7220 switch(tok) {
7221 case TOK_CONST1:
7222 case TOK_CONST2:
7223 case TOK_CONST3:
7224 qualifiers |= VT_CONSTANT;
7225 goto redo;
7226 case TOK_VOLATILE1:
7227 case TOK_VOLATILE2:
7228 case TOK_VOLATILE3:
7229 qualifiers |= VT_VOLATILE;
7230 goto redo;
7231 case TOK_RESTRICT1:
7232 case TOK_RESTRICT2:
7233 case TOK_RESTRICT3:
7234 goto redo;
7236 mk_pointer(type);
7237 type->t |= qualifiers;
7240 /* XXX: clarify attribute handling */
7241 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7242 parse_attribute(ad);
7244 /* recursive type */
7245 /* XXX: incorrect if abstract type for functions (e.g. 'int ()') */
7246 type1.t = 0; /* XXX: same as int */
7247 if (tok == '(') {
7248 next();
7249 /* XXX: this is not correct to modify 'ad' at this point, but
7250 the syntax is not clear */
7251 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7252 parse_attribute(ad);
7253 type_decl(&type1, ad, v, td);
7254 skip(')');
7255 } else {
7256 /* type identifier */
7257 if (tok >= TOK_IDENT && (td & TYPE_DIRECT)) {
7258 *v = tok;
7259 next();
7260 } else {
7261 if (!(td & TYPE_ABSTRACT))
7262 expect("identifier");
7263 *v = 0;
7266 post_type(type, ad);
7267 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7268 parse_attribute(ad);
7269 if (!type1.t)
7270 return;
7271 /* append type at the end of type1 */
7272 type2 = &type1;
7273 for(;;) {
7274 s = type2->ref;
7275 type2 = &s->type;
7276 if (!type2->t) {
7277 *type2 = *type;
7278 break;
7281 *type = type1;
7284 /* compute the lvalue VT_LVAL_xxx needed to match type t. */
7285 static int lvalue_type(int t)
7287 int bt, r;
7288 r = VT_LVAL;
7289 bt = t & VT_BTYPE;
7290 if (bt == VT_BYTE || bt == VT_BOOL)
7291 r |= VT_LVAL_BYTE;
7292 else if (bt == VT_SHORT)
7293 r |= VT_LVAL_SHORT;
7294 else
7295 return r;
7296 if (t & VT_UNSIGNED)
7297 r |= VT_LVAL_UNSIGNED;
7298 return r;
7301 /* indirection with full error checking and bound check */
7302 static void indir(void)
7304 if ((vtop->type.t & VT_BTYPE) != VT_PTR) {
7305 if ((vtop->type.t & VT_BTYPE) == VT_FUNC)
7306 return;
7307 expect("pointer");
7309 if ((vtop->r & VT_LVAL) && !nocode_wanted)
7310 gv(RC_INT);
7311 vtop->type = *pointed_type(&vtop->type);
7312 /* Arrays and functions are never lvalues */
7313 if (!(vtop->type.t & VT_ARRAY)
7314 && (vtop->type.t & VT_BTYPE) != VT_FUNC) {
7315 vtop->r |= lvalue_type(vtop->type.t);
7316 /* if bound checking, the referenced pointer must be checked */
7317 if (do_bounds_check)
7318 vtop->r |= VT_MUSTBOUND;
7322 /* pass a parameter to a function and do type checking and casting */
7323 static void gfunc_param_typed(Sym *func, Sym *arg)
7325 int func_type;
7326 CType type;
7328 func_type = func->c;
7329 if (func_type == FUNC_OLD ||
7330 (func_type == FUNC_ELLIPSIS && arg == NULL)) {
7331 /* default casting : only need to convert float to double */
7332 if ((vtop->type.t & VT_BTYPE) == VT_FLOAT) {
7333 type.t = VT_DOUBLE;
7334 gen_cast(&type);
7336 } else if (arg == NULL) {
7337 error("too many arguments to function");
7338 } else {
7339 type = arg->type;
7340 type.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
7341 gen_assign_cast(&type);
7345 /* parse an expression of the form '(type)' or '(expr)' and return its
7346 type */
7347 static void parse_expr_type(CType *type)
7349 int n;
7350 AttributeDef ad;
7352 skip('(');
7353 if (parse_btype(type, &ad)) {
7354 type_decl(type, &ad, &n, TYPE_ABSTRACT);
7355 } else {
7356 expr_type(type);
7358 skip(')');
7361 static void parse_type(CType *type)
7363 AttributeDef ad;
7364 int n;
7366 if (!parse_btype(type, &ad)) {
7367 expect("type");
7369 type_decl(type, &ad, &n, TYPE_ABSTRACT);
7372 static void vpush_tokc(int t)
7374 CType type;
7375 type.t = t;
7376 vsetc(&type, VT_CONST, &tokc);
7379 static void unary(void)
7381 int n, t, align, size, r;
7382 CType type;
7383 Sym *s;
7384 AttributeDef ad;
7386 /* XXX: GCC 2.95.3 does not generate a table although it should be
7387 better here */
7388 tok_next:
7389 switch(tok) {
7390 case TOK_EXTENSION:
7391 next();
7392 goto tok_next;
7393 case TOK_CINT:
7394 case TOK_CCHAR:
7395 case TOK_LCHAR:
7396 vpushi(tokc.i);
7397 next();
7398 break;
7399 case TOK_CUINT:
7400 vpush_tokc(VT_INT | VT_UNSIGNED);
7401 next();
7402 break;
7403 case TOK_CLLONG:
7404 vpush_tokc(VT_LLONG);
7405 next();
7406 break;
7407 case TOK_CULLONG:
7408 vpush_tokc(VT_LLONG | VT_UNSIGNED);
7409 next();
7410 break;
7411 case TOK_CFLOAT:
7412 vpush_tokc(VT_FLOAT);
7413 next();
7414 break;
7415 case TOK_CDOUBLE:
7416 vpush_tokc(VT_DOUBLE);
7417 next();
7418 break;
7419 case TOK_CLDOUBLE:
7420 vpush_tokc(VT_LDOUBLE);
7421 next();
7422 break;
7423 case TOK___FUNCTION__:
7424 if (!gnu_ext)
7425 goto tok_identifier;
7426 /* fall thru */
7427 case TOK___FUNC__:
7429 void *ptr;
7430 int len;
7431 /* special function name identifier */
7432 len = strlen(funcname) + 1;
7433 /* generate char[len] type */
7434 type.t = VT_BYTE;
7435 mk_pointer(&type);
7436 type.t |= VT_ARRAY;
7437 type.ref->c = len;
7438 vpush_ref(&type, data_section, data_section->data_offset, len);
7439 ptr = section_ptr_add(data_section, len);
7440 memcpy(ptr, funcname, len);
7441 next();
7443 break;
7444 case TOK_LSTR:
7445 #ifdef TCC_TARGET_PE
7446 t = VT_SHORT | VT_UNSIGNED;
7447 #else
7448 t = VT_INT;
7449 #endif
7450 goto str_init;
7451 case TOK_STR:
7452 /* string parsing */
7453 t = VT_BYTE;
7454 str_init:
7455 if (tcc_state->warn_write_strings)
7456 t |= VT_CONSTANT;
7457 type.t = t;
7458 mk_pointer(&type);
7459 type.t |= VT_ARRAY;
7460 memset(&ad, 0, sizeof(AttributeDef));
7461 decl_initializer_alloc(&type, &ad, VT_CONST, 2, 0, 0);
7462 break;
7463 case '(':
7464 next();
7465 /* cast ? */
7466 if (parse_btype(&type, &ad)) {
7467 type_decl(&type, &ad, &n, TYPE_ABSTRACT);
7468 skip(')');
7469 /* check ISOC99 compound literal */
7470 if (tok == '{') {
7471 /* data is allocated locally by default */
7472 if (global_expr)
7473 r = VT_CONST;
7474 else
7475 r = VT_LOCAL;
7476 /* all except arrays are lvalues */
7477 if (!(type.t & VT_ARRAY))
7478 r |= lvalue_type(type.t);
7479 memset(&ad, 0, sizeof(AttributeDef));
7480 decl_initializer_alloc(&type, &ad, r, 1, 0, 0);
7481 } else {
7482 unary();
7483 gen_cast(&type);
7485 } else if (tok == '{') {
7486 /* save all registers */
7487 save_regs(0);
7488 /* statement expression : we do not accept break/continue
7489 inside as GCC does */
7490 block(NULL, NULL, NULL, NULL, 0, 1);
7491 skip(')');
7492 } else {
7493 gexpr();
7494 skip(')');
7496 break;
7497 case '*':
7498 next();
7499 unary();
7500 indir();
7501 break;
7502 case '&':
7503 next();
7504 unary();
7505 /* functions names must be treated as function pointers,
7506 except for unary '&' and sizeof. Since we consider that
7507 functions are not lvalues, we only have to handle it
7508 there and in function calls. */
7509 /* arrays can also be used although they are not lvalues */
7510 if ((vtop->type.t & VT_BTYPE) != VT_FUNC &&
7511 !(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_LLOCAL))
7512 test_lvalue();
7513 mk_pointer(&vtop->type);
7514 gaddrof();
7515 break;
7516 case '!':
7517 next();
7518 unary();
7519 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST)
7520 vtop->c.i = !vtop->c.i;
7521 else if ((vtop->r & VT_VALMASK) == VT_CMP)
7522 vtop->c.i = vtop->c.i ^ 1;
7523 else {
7524 save_regs(1);
7525 vseti(VT_JMP, gtst(1, 0));
7527 break;
7528 case '~':
7529 next();
7530 unary();
7531 vpushi(-1);
7532 gen_op('^');
7533 break;
7534 case '+':
7535 next();
7536 /* in order to force cast, we add zero */
7537 unary();
7538 if ((vtop->type.t & VT_BTYPE) == VT_PTR)
7539 error("pointer not accepted for unary plus");
7540 vpushi(0);
7541 gen_op('+');
7542 break;
7543 case TOK_SIZEOF:
7544 case TOK_ALIGNOF1:
7545 case TOK_ALIGNOF2:
7546 t = tok;
7547 next();
7548 if (tok == '(') {
7549 parse_expr_type(&type);
7550 } else {
7551 unary_type(&type);
7553 size = type_size(&type, &align);
7554 if (t == TOK_SIZEOF) {
7555 if (size < 0)
7556 error("sizeof applied to an incomplete type");
7557 vpushi(size);
7558 } else {
7559 vpushi(align);
7561 vtop->type.t |= VT_UNSIGNED;
7562 break;
7564 case TOK_builtin_types_compatible_p:
7566 CType type1, type2;
7567 next();
7568 skip('(');
7569 parse_type(&type1);
7570 skip(',');
7571 parse_type(&type2);
7572 skip(')');
7573 type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
7574 type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
7575 vpushi(is_compatible_types(&type1, &type2));
7577 break;
7578 case TOK_builtin_constant_p:
7580 int saved_nocode_wanted, res;
7581 next();
7582 skip('(');
7583 saved_nocode_wanted = nocode_wanted;
7584 nocode_wanted = 1;
7585 gexpr();
7586 res = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
7587 vpop();
7588 nocode_wanted = saved_nocode_wanted;
7589 skip(')');
7590 vpushi(res);
7592 break;
7593 case TOK_INC:
7594 case TOK_DEC:
7595 t = tok;
7596 next();
7597 unary();
7598 inc(0, t);
7599 break;
7600 case '-':
7601 next();
7602 vpushi(0);
7603 unary();
7604 gen_op('-');
7605 break;
7606 case TOK_LAND:
7607 if (!gnu_ext)
7608 goto tok_identifier;
7609 next();
7610 /* allow to take the address of a label */
7611 if (tok < TOK_UIDENT)
7612 expect("label identifier");
7613 s = label_find(tok);
7614 if (!s) {
7615 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
7616 } else {
7617 if (s->r == LABEL_DECLARED)
7618 s->r = LABEL_FORWARD;
7620 if (!s->type.t) {
7621 s->type.t = VT_VOID;
7622 mk_pointer(&s->type);
7623 s->type.t |= VT_STATIC;
7625 vset(&s->type, VT_CONST | VT_SYM, 0);
7626 vtop->sym = s;
7627 next();
7628 break;
7629 default:
7630 tok_identifier:
7631 t = tok;
7632 next();
7633 if (t < TOK_UIDENT)
7634 expect("identifier");
7635 s = sym_find(t);
7636 if (!s) {
7637 if (tok != '(')
7638 error("'%s' undeclared", get_tok_str(t, NULL));
7639 /* for simple function calls, we tolerate undeclared
7640 external reference to int() function */
7641 if (tcc_state->warn_implicit_function_declaration)
7642 warning("implicit declaration of function '%s'",
7643 get_tok_str(t, NULL));
7644 s = external_global_sym(t, &func_old_type, 0);
7646 if ((s->type.t & (VT_STATIC | VT_INLINE | VT_BTYPE)) ==
7647 (VT_STATIC | VT_INLINE | VT_FUNC)) {
7648 /* if referencing an inline function, then we generate a
7649 symbol to it if not already done. It will have the
7650 effect to generate code for it at the end of the
7651 compilation unit. Inline function as always
7652 generated in the text section. */
7653 if (!s->c)
7654 put_extern_sym(s, text_section, 0, 0);
7655 r = VT_SYM | VT_CONST;
7656 } else {
7657 r = s->r;
7659 vset(&s->type, r, s->c);
7660 /* if forward reference, we must point to s */
7661 if (vtop->r & VT_SYM) {
7662 vtop->sym = s;
7663 vtop->c.ul = 0;
7665 break;
7668 /* post operations */
7669 while (1) {
7670 if (tok == TOK_INC || tok == TOK_DEC) {
7671 inc(1, tok);
7672 next();
7673 } else if (tok == '.' || tok == TOK_ARROW) {
7674 /* field */
7675 if (tok == TOK_ARROW)
7676 indir();
7677 test_lvalue();
7678 gaddrof();
7679 next();
7680 /* expect pointer on structure */
7681 if ((vtop->type.t & VT_BTYPE) != VT_STRUCT)
7682 expect("struct or union");
7683 s = vtop->type.ref;
7684 /* find field */
7685 tok |= SYM_FIELD;
7686 while ((s = s->next) != NULL) {
7687 if (s->v == tok)
7688 break;
7690 if (!s)
7691 error("field not found: %s", get_tok_str(tok & ~SYM_FIELD, NULL));
7692 /* add field offset to pointer */
7693 vtop->type = char_pointer_type; /* change type to 'char *' */
7694 vpushi(s->c);
7695 gen_op('+');
7696 /* change type to field type, and set to lvalue */
7697 vtop->type = s->type;
7698 /* an array is never an lvalue */
7699 if (!(vtop->type.t & VT_ARRAY)) {
7700 vtop->r |= lvalue_type(vtop->type.t);
7701 /* if bound checking, the referenced pointer must be checked */
7702 if (do_bounds_check)
7703 vtop->r |= VT_MUSTBOUND;
7705 next();
7706 } else if (tok == '[') {
7707 next();
7708 gexpr();
7709 gen_op('+');
7710 indir();
7711 skip(']');
7712 } else if (tok == '(') {
7713 SValue ret;
7714 Sym *sa;
7715 int nb_args;
7717 /* function call */
7718 if ((vtop->type.t & VT_BTYPE) != VT_FUNC) {
7719 /* pointer test (no array accepted) */
7720 if ((vtop->type.t & (VT_BTYPE | VT_ARRAY)) == VT_PTR) {
7721 vtop->type = *pointed_type(&vtop->type);
7722 if ((vtop->type.t & VT_BTYPE) != VT_FUNC)
7723 goto error_func;
7724 } else {
7725 error_func:
7726 expect("function pointer");
7728 } else {
7729 vtop->r &= ~VT_LVAL; /* no lvalue */
7731 /* get return type */
7732 s = vtop->type.ref;
7733 next();
7734 sa = s->next; /* first parameter */
7735 nb_args = 0;
7736 ret.r2 = VT_CONST;
7737 /* compute first implicit argument if a structure is returned */
7738 if ((s->type.t & VT_BTYPE) == VT_STRUCT) {
7739 /* get some space for the returned structure */
7740 size = type_size(&s->type, &align);
7741 loc = (loc - size) & -align;
7742 ret.type = s->type;
7743 ret.r = VT_LOCAL | VT_LVAL;
7744 /* pass it as 'int' to avoid structure arg passing
7745 problems */
7746 vseti(VT_LOCAL, loc);
7747 ret.c = vtop->c;
7748 nb_args++;
7749 } else {
7750 ret.type = s->type;
7751 /* return in register */
7752 if (is_float(ret.type.t)) {
7753 ret.r = REG_FRET;
7754 } else {
7755 if ((ret.type.t & VT_BTYPE) == VT_LLONG)
7756 ret.r2 = REG_LRET;
7757 ret.r = REG_IRET;
7759 ret.c.i = 0;
7761 if (tok != ')') {
7762 for(;;) {
7763 expr_eq();
7764 gfunc_param_typed(s, sa);
7765 nb_args++;
7766 if (sa)
7767 sa = sa->next;
7768 if (tok == ')')
7769 break;
7770 skip(',');
7773 if (sa)
7774 error("too few arguments to function");
7775 skip(')');
7776 if (!nocode_wanted) {
7777 gfunc_call(nb_args);
7778 } else {
7779 vtop -= (nb_args + 1);
7781 /* return value */
7782 vsetc(&ret.type, ret.r, &ret.c);
7783 vtop->r2 = ret.r2;
7784 } else {
7785 break;
7790 static void uneq(void)
7792 int t;
7794 unary();
7795 if (tok == '=' ||
7796 (tok >= TOK_A_MOD && tok <= TOK_A_DIV) ||
7797 tok == TOK_A_XOR || tok == TOK_A_OR ||
7798 tok == TOK_A_SHL || tok == TOK_A_SAR) {
7799 test_lvalue();
7800 t = tok;
7801 next();
7802 if (t == '=') {
7803 expr_eq();
7804 } else {
7805 vdup();
7806 expr_eq();
7807 gen_op(t & 0x7f);
7809 vstore();
7813 static void expr_prod(void)
7815 int t;
7817 uneq();
7818 while (tok == '*' || tok == '/' || tok == '%') {
7819 t = tok;
7820 next();
7821 uneq();
7822 gen_op(t);
7826 static void expr_sum(void)
7828 int t;
7830 expr_prod();
7831 while (tok == '+' || tok == '-') {
7832 t = tok;
7833 next();
7834 expr_prod();
7835 gen_op(t);
7839 static void expr_shift(void)
7841 int t;
7843 expr_sum();
7844 while (tok == TOK_SHL || tok == TOK_SAR) {
7845 t = tok;
7846 next();
7847 expr_sum();
7848 gen_op(t);
7852 static void expr_cmp(void)
7854 int t;
7856 expr_shift();
7857 while ((tok >= TOK_ULE && tok <= TOK_GT) ||
7858 tok == TOK_ULT || tok == TOK_UGE) {
7859 t = tok;
7860 next();
7861 expr_shift();
7862 gen_op(t);
7866 static void expr_cmpeq(void)
7868 int t;
7870 expr_cmp();
7871 while (tok == TOK_EQ || tok == TOK_NE) {
7872 t = tok;
7873 next();
7874 expr_cmp();
7875 gen_op(t);
7879 static void expr_and(void)
7881 expr_cmpeq();
7882 while (tok == '&') {
7883 next();
7884 expr_cmpeq();
7885 gen_op('&');
7889 static void expr_xor(void)
7891 expr_and();
7892 while (tok == '^') {
7893 next();
7894 expr_and();
7895 gen_op('^');
7899 static void expr_or(void)
7901 expr_xor();
7902 while (tok == '|') {
7903 next();
7904 expr_xor();
7905 gen_op('|');
7909 /* XXX: fix this mess */
7910 static void expr_land_const(void)
7912 expr_or();
7913 while (tok == TOK_LAND) {
7914 next();
7915 expr_or();
7916 gen_op(TOK_LAND);
7920 /* XXX: fix this mess */
7921 static void expr_lor_const(void)
7923 expr_land_const();
7924 while (tok == TOK_LOR) {
7925 next();
7926 expr_land_const();
7927 gen_op(TOK_LOR);
7931 /* only used if non constant */
7932 static void expr_land(void)
7934 int t;
7936 expr_or();
7937 if (tok == TOK_LAND) {
7938 t = 0;
7939 save_regs(1);
7940 for(;;) {
7941 t = gtst(1, t);
7942 if (tok != TOK_LAND) {
7943 vseti(VT_JMPI, t);
7944 break;
7946 next();
7947 expr_or();
7952 static void expr_lor(void)
7954 int t;
7956 expr_land();
7957 if (tok == TOK_LOR) {
7958 t = 0;
7959 save_regs(1);
7960 for(;;) {
7961 t = gtst(0, t);
7962 if (tok != TOK_LOR) {
7963 vseti(VT_JMP, t);
7964 break;
7966 next();
7967 expr_land();
7972 /* XXX: better constant handling */
7973 static void expr_eq(void)
7975 int tt, u, r1, r2, rc, t1, t2, bt1, bt2;
7976 SValue sv;
7977 CType type, type1, type2;
7979 if (const_wanted) {
7980 int c1, c;
7981 expr_lor_const();
7982 if (tok == '?') {
7983 c = vtop->c.i;
7984 vpop();
7985 next();
7986 if (tok == ':' && gnu_ext) {
7987 c1 = c;
7988 } else {
7989 gexpr();
7990 c1 = vtop->c.i;
7991 vpop();
7993 skip(':');
7994 expr_eq();
7995 if (c)
7996 vtop->c.i = c1;
7998 } else {
7999 expr_lor();
8000 if (tok == '?') {
8001 next();
8002 if (vtop != vstack) {
8003 /* needed to avoid having different registers saved in
8004 each branch */
8005 if (is_float(vtop->type.t))
8006 rc = RC_FLOAT;
8007 else
8008 rc = RC_INT;
8009 gv(rc);
8010 save_regs(1);
8012 if (tok == ':' && gnu_ext) {
8013 gv_dup();
8014 tt = gtst(1, 0);
8015 } else {
8016 tt = gtst(1, 0);
8017 gexpr();
8019 type1 = vtop->type;
8020 sv = *vtop; /* save value to handle it later */
8021 vtop--; /* no vpop so that FP stack is not flushed */
8022 skip(':');
8023 u = gjmp(0);
8024 gsym(tt);
8025 expr_eq();
8026 type2 = vtop->type;
8028 t1 = type1.t;
8029 bt1 = t1 & VT_BTYPE;
8030 t2 = type2.t;
8031 bt2 = t2 & VT_BTYPE;
8032 /* cast operands to correct type according to ISOC rules */
8033 if (is_float(bt1) || is_float(bt2)) {
8034 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
8035 type.t = VT_LDOUBLE;
8036 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
8037 type.t = VT_DOUBLE;
8038 } else {
8039 type.t = VT_FLOAT;
8041 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
8042 /* cast to biggest op */
8043 type.t = VT_LLONG;
8044 /* convert to unsigned if it does not fit in a long long */
8045 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
8046 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
8047 type.t |= VT_UNSIGNED;
8048 } else if (bt1 == VT_PTR || bt2 == VT_PTR) {
8049 /* XXX: test pointer compatibility */
8050 type = type1;
8051 } else if (bt1 == VT_FUNC || bt2 == VT_FUNC) {
8052 /* XXX: test function pointer compatibility */
8053 type = type1;
8054 } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) {
8055 /* XXX: test structure compatibility */
8056 type = type1;
8057 } else if (bt1 == VT_VOID || bt2 == VT_VOID) {
8058 /* NOTE: as an extension, we accept void on only one side */
8059 type.t = VT_VOID;
8060 } else {
8061 /* integer operations */
8062 type.t = VT_INT;
8063 /* convert to unsigned if it does not fit in an integer */
8064 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
8065 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
8066 type.t |= VT_UNSIGNED;
8069 /* now we convert second operand */
8070 gen_cast(&type);
8071 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
8072 gaddrof();
8073 rc = RC_INT;
8074 if (is_float(type.t)) {
8075 rc = RC_FLOAT;
8076 } else if ((type.t & VT_BTYPE) == VT_LLONG) {
8077 /* for long longs, we use fixed registers to avoid having
8078 to handle a complicated move */
8079 rc = RC_IRET;
8082 r2 = gv(rc);
8083 /* this is horrible, but we must also convert first
8084 operand */
8085 tt = gjmp(0);
8086 gsym(u);
8087 /* put again first value and cast it */
8088 *vtop = sv;
8089 gen_cast(&type);
8090 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
8091 gaddrof();
8092 r1 = gv(rc);
8093 move_reg(r2, r1);
8094 vtop->r = r2;
8095 gsym(tt);
8100 static void gexpr(void)
8102 while (1) {
8103 expr_eq();
8104 if (tok != ',')
8105 break;
8106 vpop();
8107 next();
8111 /* parse an expression and return its type without any side effect. */
8112 static void expr_type(CType *type)
8114 int saved_nocode_wanted;
8116 saved_nocode_wanted = nocode_wanted;
8117 nocode_wanted = 1;
8118 gexpr();
8119 *type = vtop->type;
8120 vpop();
8121 nocode_wanted = saved_nocode_wanted;
8124 /* parse a unary expression and return its type without any side
8125 effect. */
8126 static void unary_type(CType *type)
8128 int a;
8130 a = nocode_wanted;
8131 nocode_wanted = 1;
8132 unary();
8133 *type = vtop->type;
8134 vpop();
8135 nocode_wanted = a;
8138 /* parse a constant expression and return value in vtop. */
8139 static void expr_const1(void)
8141 int a;
8142 a = const_wanted;
8143 const_wanted = 1;
8144 expr_eq();
8145 const_wanted = a;
8148 /* parse an integer constant and return its value. */
8149 static int expr_const(void)
8151 int c;
8152 expr_const1();
8153 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
8154 expect("constant expression");
8155 c = vtop->c.i;
8156 vpop();
8157 return c;
8160 /* return the label token if current token is a label, otherwise
8161 return zero */
8162 static int is_label(void)
8164 int last_tok;
8166 /* fast test first */
8167 if (tok < TOK_UIDENT)
8168 return 0;
8169 /* no need to save tokc because tok is an identifier */
8170 last_tok = tok;
8171 next();
8172 if (tok == ':') {
8173 next();
8174 return last_tok;
8175 } else {
8176 unget_tok(last_tok);
8177 return 0;
8181 static void block(int *bsym, int *csym, int *case_sym, int *def_sym,
8182 int case_reg, int is_expr)
8184 int a, b, c, d;
8185 Sym *s;
8187 /* generate line number info */
8188 if (do_debug &&
8189 (last_line_num != file->line_num || last_ind != ind)) {
8190 put_stabn(N_SLINE, 0, file->line_num, ind - func_ind);
8191 last_ind = ind;
8192 last_line_num = file->line_num;
8195 if (is_expr) {
8196 /* default return value is (void) */
8197 vpushi(0);
8198 vtop->type.t = VT_VOID;
8201 if (tok == TOK_IF) {
8202 /* if test */
8203 next();
8204 skip('(');
8205 gexpr();
8206 skip(')');
8207 a = gtst(1, 0);
8208 block(bsym, csym, case_sym, def_sym, case_reg, 0);
8209 c = tok;
8210 if (c == TOK_ELSE) {
8211 next();
8212 d = gjmp(0);
8213 gsym(a);
8214 block(bsym, csym, case_sym, def_sym, case_reg, 0);
8215 gsym(d); /* patch else jmp */
8216 } else
8217 gsym(a);
8218 } else if (tok == TOK_WHILE) {
8219 next();
8220 d = ind;
8221 skip('(');
8222 gexpr();
8223 skip(')');
8224 a = gtst(1, 0);
8225 b = 0;
8226 block(&a, &b, case_sym, def_sym, case_reg, 0);
8227 gjmp_addr(d);
8228 gsym(a);
8229 gsym_addr(b, d);
8230 } else if (tok == '{') {
8231 Sym *llabel;
8233 next();
8234 /* record local declaration stack position */
8235 s = local_stack;
8236 llabel = local_label_stack;
8237 /* handle local labels declarations */
8238 if (tok == TOK_LABEL) {
8239 next();
8240 for(;;) {
8241 if (tok < TOK_UIDENT)
8242 expect("label identifier");
8243 label_push(&local_label_stack, tok, LABEL_DECLARED);
8244 next();
8245 if (tok == ',') {
8246 next();
8247 } else {
8248 skip(';');
8249 break;
8253 while (tok != '}') {
8254 decl(VT_LOCAL);
8255 if (tok != '}') {
8256 if (is_expr)
8257 vpop();
8258 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
8261 /* pop locally defined labels */
8262 label_pop(&local_label_stack, llabel);
8263 /* pop locally defined symbols */
8264 if(is_expr) {
8265 /* XXX: this solution makes only valgrind happy...
8266 triggered by gcc.c-torture/execute/20000917-1.c */
8267 Sym *p;
8268 switch(vtop->type.t & VT_BTYPE) {
8269 case VT_PTR:
8270 case VT_STRUCT:
8271 case VT_ENUM:
8272 case VT_FUNC:
8273 for(p=vtop->type.ref;p;p=p->prev)
8274 if(p->prev==s)
8275 error("unsupported expression type");
8278 sym_pop(&local_stack, s);
8279 next();
8280 } else if (tok == TOK_RETURN) {
8281 next();
8282 if (tok != ';') {
8283 gexpr();
8284 gen_assign_cast(&func_vt);
8285 if ((func_vt.t & VT_BTYPE) == VT_STRUCT) {
8286 CType type;
8287 /* if returning structure, must copy it to implicit
8288 first pointer arg location */
8289 #ifdef TCC_ARM_EABI
8290 int align, size;
8291 size = type_size(&func_vt,&align);
8292 if(size <= 4)
8294 if((vtop->r != (VT_LOCAL | VT_LVAL) || (vtop->c.i & 3))
8295 && (align & 3))
8297 int addr;
8298 loc = (loc - size) & -4;
8299 addr = loc;
8300 type = func_vt;
8301 vset(&type, VT_LOCAL | VT_LVAL, addr);
8302 vswap();
8303 vstore();
8304 vset(&int_type, VT_LOCAL | VT_LVAL, addr);
8306 vtop->type = int_type;
8307 gv(RC_IRET);
8308 } else {
8309 #endif
8310 type = func_vt;
8311 mk_pointer(&type);
8312 vset(&type, VT_LOCAL | VT_LVAL, func_vc);
8313 indir();
8314 vswap();
8315 /* copy structure value to pointer */
8316 vstore();
8317 #ifdef TCC_ARM_EABI
8319 #endif
8320 } else if (is_float(func_vt.t)) {
8321 gv(RC_FRET);
8322 } else {
8323 gv(RC_IRET);
8325 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
8327 skip(';');
8328 rsym = gjmp(rsym); /* jmp */
8329 } else if (tok == TOK_BREAK) {
8330 /* compute jump */
8331 if (!bsym)
8332 error("cannot break");
8333 *bsym = gjmp(*bsym);
8334 next();
8335 skip(';');
8336 } else if (tok == TOK_CONTINUE) {
8337 /* compute jump */
8338 if (!csym)
8339 error("cannot continue");
8340 *csym = gjmp(*csym);
8341 next();
8342 skip(';');
8343 } else if (tok == TOK_FOR) {
8344 int e;
8345 next();
8346 skip('(');
8347 if (tok != ';') {
8348 gexpr();
8349 vpop();
8351 skip(';');
8352 d = ind;
8353 c = ind;
8354 a = 0;
8355 b = 0;
8356 if (tok != ';') {
8357 gexpr();
8358 a = gtst(1, 0);
8360 skip(';');
8361 if (tok != ')') {
8362 e = gjmp(0);
8363 c = ind;
8364 gexpr();
8365 vpop();
8366 gjmp_addr(d);
8367 gsym(e);
8369 skip(')');
8370 block(&a, &b, case_sym, def_sym, case_reg, 0);
8371 gjmp_addr(c);
8372 gsym(a);
8373 gsym_addr(b, c);
8374 } else
8375 if (tok == TOK_DO) {
8376 next();
8377 a = 0;
8378 b = 0;
8379 d = ind;
8380 block(&a, &b, case_sym, def_sym, case_reg, 0);
8381 skip(TOK_WHILE);
8382 skip('(');
8383 gsym(b);
8384 gexpr();
8385 c = gtst(0, 0);
8386 gsym_addr(c, d);
8387 skip(')');
8388 gsym(a);
8389 skip(';');
8390 } else
8391 if (tok == TOK_SWITCH) {
8392 next();
8393 skip('(');
8394 gexpr();
8395 /* XXX: other types than integer */
8396 case_reg = gv(RC_INT);
8397 vpop();
8398 skip(')');
8399 a = 0;
8400 b = gjmp(0); /* jump to first case */
8401 c = 0;
8402 block(&a, csym, &b, &c, case_reg, 0);
8403 /* if no default, jmp after switch */
8404 if (c == 0)
8405 c = ind;
8406 /* default label */
8407 gsym_addr(b, c);
8408 /* break label */
8409 gsym(a);
8410 } else
8411 if (tok == TOK_CASE) {
8412 int v1, v2;
8413 if (!case_sym)
8414 expect("switch");
8415 next();
8416 v1 = expr_const();
8417 v2 = v1;
8418 if (gnu_ext && tok == TOK_DOTS) {
8419 next();
8420 v2 = expr_const();
8421 if (v2 < v1)
8422 warning("empty case range");
8424 /* since a case is like a label, we must skip it with a jmp */
8425 b = gjmp(0);
8426 gsym(*case_sym);
8427 vseti(case_reg, 0);
8428 vpushi(v1);
8429 if (v1 == v2) {
8430 gen_op(TOK_EQ);
8431 *case_sym = gtst(1, 0);
8432 } else {
8433 gen_op(TOK_GE);
8434 *case_sym = gtst(1, 0);
8435 vseti(case_reg, 0);
8436 vpushi(v2);
8437 gen_op(TOK_LE);
8438 *case_sym = gtst(1, *case_sym);
8440 gsym(b);
8441 skip(':');
8442 is_expr = 0;
8443 goto block_after_label;
8444 } else
8445 if (tok == TOK_DEFAULT) {
8446 next();
8447 skip(':');
8448 if (!def_sym)
8449 expect("switch");
8450 if (*def_sym)
8451 error("too many 'default'");
8452 *def_sym = ind;
8453 is_expr = 0;
8454 goto block_after_label;
8455 } else
8456 if (tok == TOK_GOTO) {
8457 next();
8458 if (tok == '*' && gnu_ext) {
8459 /* computed goto */
8460 next();
8461 gexpr();
8462 if ((vtop->type.t & VT_BTYPE) != VT_PTR)
8463 expect("pointer");
8464 ggoto();
8465 } else if (tok >= TOK_UIDENT) {
8466 s = label_find(tok);
8467 /* put forward definition if needed */
8468 if (!s) {
8469 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
8470 } else {
8471 if (s->r == LABEL_DECLARED)
8472 s->r = LABEL_FORWARD;
8474 /* label already defined */
8475 if (s->r & LABEL_FORWARD)
8476 s->next = (void *)gjmp((long)s->next);
8477 else
8478 gjmp_addr((long)s->next);
8479 next();
8480 } else {
8481 expect("label identifier");
8483 skip(';');
8484 } else if (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3) {
8485 asm_instr();
8486 } else {
8487 b = is_label();
8488 if (b) {
8489 /* label case */
8490 s = label_find(b);
8491 if (s) {
8492 if (s->r == LABEL_DEFINED)
8493 error("duplicate label '%s'", get_tok_str(s->v, NULL));
8494 gsym((long)s->next);
8495 s->r = LABEL_DEFINED;
8496 } else {
8497 s = label_push(&global_label_stack, b, LABEL_DEFINED);
8499 s->next = (void *)ind;
8500 /* we accept this, but it is a mistake */
8501 block_after_label:
8502 if (tok == '}') {
8503 warning("deprecated use of label at end of compound statement");
8504 } else {
8505 if (is_expr)
8506 vpop();
8507 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
8509 } else {
8510 /* expression case */
8511 if (tok != ';') {
8512 if (is_expr) {
8513 vpop();
8514 gexpr();
8515 } else {
8516 gexpr();
8517 vpop();
8520 skip(';');
8525 /* t is the array or struct type. c is the array or struct
8526 address. cur_index/cur_field is the pointer to the current
8527 value. 'size_only' is true if only size info is needed (only used
8528 in arrays) */
8529 static void decl_designator(CType *type, Section *sec, unsigned long c,
8530 int *cur_index, Sym **cur_field,
8531 int size_only)
8533 Sym *s, *f;
8534 int notfirst, index, index_last, align, l, nb_elems, elem_size;
8535 CType type1;
8537 notfirst = 0;
8538 elem_size = 0;
8539 nb_elems = 1;
8540 if (gnu_ext && (l = is_label()) != 0)
8541 goto struct_field;
8542 while (tok == '[' || tok == '.') {
8543 if (tok == '[') {
8544 if (!(type->t & VT_ARRAY))
8545 expect("array type");
8546 s = type->ref;
8547 next();
8548 index = expr_const();
8549 if (index < 0 || (s->c >= 0 && index >= s->c))
8550 expect("invalid index");
8551 if (tok == TOK_DOTS && gnu_ext) {
8552 next();
8553 index_last = expr_const();
8554 if (index_last < 0 ||
8555 (s->c >= 0 && index_last >= s->c) ||
8556 index_last < index)
8557 expect("invalid index");
8558 } else {
8559 index_last = index;
8561 skip(']');
8562 if (!notfirst)
8563 *cur_index = index_last;
8564 type = pointed_type(type);
8565 elem_size = type_size(type, &align);
8566 c += index * elem_size;
8567 /* NOTE: we only support ranges for last designator */
8568 nb_elems = index_last - index + 1;
8569 if (nb_elems != 1) {
8570 notfirst = 1;
8571 break;
8573 } else {
8574 next();
8575 l = tok;
8576 next();
8577 struct_field:
8578 if ((type->t & VT_BTYPE) != VT_STRUCT)
8579 expect("struct/union type");
8580 s = type->ref;
8581 l |= SYM_FIELD;
8582 f = s->next;
8583 while (f) {
8584 if (f->v == l)
8585 break;
8586 f = f->next;
8588 if (!f)
8589 expect("field");
8590 if (!notfirst)
8591 *cur_field = f;
8592 /* XXX: fix this mess by using explicit storage field */
8593 type1 = f->type;
8594 type1.t |= (type->t & ~VT_TYPE);
8595 type = &type1;
8596 c += f->c;
8598 notfirst = 1;
8600 if (notfirst) {
8601 if (tok == '=') {
8602 next();
8603 } else {
8604 if (!gnu_ext)
8605 expect("=");
8607 } else {
8608 if (type->t & VT_ARRAY) {
8609 index = *cur_index;
8610 type = pointed_type(type);
8611 c += index * type_size(type, &align);
8612 } else {
8613 f = *cur_field;
8614 if (!f)
8615 error("too many field init");
8616 /* XXX: fix this mess by using explicit storage field */
8617 type1 = f->type;
8618 type1.t |= (type->t & ~VT_TYPE);
8619 type = &type1;
8620 c += f->c;
8623 decl_initializer(type, sec, c, 0, size_only);
8625 /* XXX: make it more general */
8626 if (!size_only && nb_elems > 1) {
8627 unsigned long c_end;
8628 uint8_t *src, *dst;
8629 int i;
8631 if (!sec)
8632 error("range init not supported yet for dynamic storage");
8633 c_end = c + nb_elems * elem_size;
8634 if (c_end > sec->data_allocated)
8635 section_realloc(sec, c_end);
8636 src = sec->data + c;
8637 dst = src;
8638 for(i = 1; i < nb_elems; i++) {
8639 dst += elem_size;
8640 memcpy(dst, src, elem_size);
8645 #define EXPR_VAL 0
8646 #define EXPR_CONST 1
8647 #define EXPR_ANY 2
8649 /* store a value or an expression directly in global data or in local array */
8650 static void init_putv(CType *type, Section *sec, unsigned long c,
8651 int v, int expr_type)
8653 int saved_global_expr, bt, bit_pos, bit_size;
8654 void *ptr;
8655 unsigned long long bit_mask;
8656 CType dtype;
8658 switch(expr_type) {
8659 case EXPR_VAL:
8660 vpushi(v);
8661 break;
8662 case EXPR_CONST:
8663 /* compound literals must be allocated globally in this case */
8664 saved_global_expr = global_expr;
8665 global_expr = 1;
8666 expr_const1();
8667 global_expr = saved_global_expr;
8668 /* NOTE: symbols are accepted */
8669 if ((vtop->r & (VT_VALMASK | VT_LVAL)) != VT_CONST)
8670 error("initializer element is not constant");
8671 break;
8672 case EXPR_ANY:
8673 expr_eq();
8674 break;
8677 dtype = *type;
8678 dtype.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
8680 if (sec) {
8681 /* XXX: not portable */
8682 /* XXX: generate error if incorrect relocation */
8683 gen_assign_cast(&dtype);
8684 bt = type->t & VT_BTYPE;
8685 ptr = sec->data + c;
8686 /* XXX: make code faster ? */
8687 if (!(type->t & VT_BITFIELD)) {
8688 bit_pos = 0;
8689 bit_size = 32;
8690 bit_mask = -1LL;
8691 } else {
8692 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
8693 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
8694 bit_mask = (1LL << bit_size) - 1;
8696 if ((vtop->r & VT_SYM) &&
8697 (bt == VT_BYTE ||
8698 bt == VT_SHORT ||
8699 bt == VT_DOUBLE ||
8700 bt == VT_LDOUBLE ||
8701 bt == VT_LLONG ||
8702 (bt == VT_INT && bit_size != 32)))
8703 error("initializer element is not computable at load time");
8704 switch(bt) {
8705 case VT_BOOL:
8706 vtop->c.i = (vtop->c.i != 0);
8707 case VT_BYTE:
8708 *(char *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8709 break;
8710 case VT_SHORT:
8711 *(short *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8712 break;
8713 case VT_DOUBLE:
8714 *(double *)ptr = vtop->c.d;
8715 break;
8716 case VT_LDOUBLE:
8717 *(long double *)ptr = vtop->c.ld;
8718 break;
8719 case VT_LLONG:
8720 *(long long *)ptr |= (vtop->c.ll & bit_mask) << bit_pos;
8721 break;
8722 default:
8723 if (vtop->r & VT_SYM) {
8724 greloc(sec, vtop->sym, c, R_DATA_32);
8726 *(int *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8727 break;
8729 vtop--;
8730 } else {
8731 vset(&dtype, VT_LOCAL|VT_LVAL, c);
8732 vswap();
8733 vstore();
8734 vpop();
8738 /* put zeros for variable based init */
8739 static void init_putz(CType *t, Section *sec, unsigned long c, int size)
8741 if (sec) {
8742 /* nothing to do because globals are already set to zero */
8743 } else {
8744 vpush_global_sym(&func_old_type, TOK_memset);
8745 vseti(VT_LOCAL, c);
8746 vpushi(0);
8747 vpushi(size);
8748 gfunc_call(3);
8752 /* 't' contains the type and storage info. 'c' is the offset of the
8753 object in section 'sec'. If 'sec' is NULL, it means stack based
8754 allocation. 'first' is true if array '{' must be read (multi
8755 dimension implicit array init handling). 'size_only' is true if
8756 size only evaluation is wanted (only for arrays). */
8757 static void decl_initializer(CType *type, Section *sec, unsigned long c,
8758 int first, int size_only)
8760 int index, array_length, n, no_oblock, nb, parlevel, i;
8761 int size1, align1, expr_type;
8762 Sym *s, *f;
8763 CType *t1;
8765 if (type->t & VT_ARRAY) {
8766 s = type->ref;
8767 n = s->c;
8768 array_length = 0;
8769 t1 = pointed_type(type);
8770 size1 = type_size(t1, &align1);
8772 no_oblock = 1;
8773 if ((first && tok != TOK_LSTR && tok != TOK_STR) ||
8774 tok == '{') {
8775 skip('{');
8776 no_oblock = 0;
8779 /* only parse strings here if correct type (otherwise: handle
8780 them as ((w)char *) expressions */
8781 if ((tok == TOK_LSTR &&
8782 #ifdef TCC_TARGET_PE
8783 (t1->t & VT_BTYPE) == VT_SHORT && (t1->t & VT_UNSIGNED)
8784 #else
8785 (t1->t & VT_BTYPE) == VT_INT
8786 #endif
8787 ) || (tok == TOK_STR && (t1->t & VT_BTYPE) == VT_BYTE)) {
8788 while (tok == TOK_STR || tok == TOK_LSTR) {
8789 int cstr_len, ch;
8790 CString *cstr;
8792 cstr = tokc.cstr;
8793 /* compute maximum number of chars wanted */
8794 if (tok == TOK_STR)
8795 cstr_len = cstr->size;
8796 else
8797 cstr_len = cstr->size / sizeof(nwchar_t);
8798 cstr_len--;
8799 nb = cstr_len;
8800 if (n >= 0 && nb > (n - array_length))
8801 nb = n - array_length;
8802 if (!size_only) {
8803 if (cstr_len > nb)
8804 warning("initializer-string for array is too long");
8805 /* in order to go faster for common case (char
8806 string in global variable, we handle it
8807 specifically */
8808 if (sec && tok == TOK_STR && size1 == 1) {
8809 memcpy(sec->data + c + array_length, cstr->data, nb);
8810 } else {
8811 for(i=0;i<nb;i++) {
8812 if (tok == TOK_STR)
8813 ch = ((unsigned char *)cstr->data)[i];
8814 else
8815 ch = ((nwchar_t *)cstr->data)[i];
8816 init_putv(t1, sec, c + (array_length + i) * size1,
8817 ch, EXPR_VAL);
8821 array_length += nb;
8822 next();
8824 /* only add trailing zero if enough storage (no
8825 warning in this case since it is standard) */
8826 if (n < 0 || array_length < n) {
8827 if (!size_only) {
8828 init_putv(t1, sec, c + (array_length * size1), 0, EXPR_VAL);
8830 array_length++;
8832 } else {
8833 index = 0;
8834 while (tok != '}') {
8835 decl_designator(type, sec, c, &index, NULL, size_only);
8836 if (n >= 0 && index >= n)
8837 error("index too large");
8838 /* must put zero in holes (note that doing it that way
8839 ensures that it even works with designators) */
8840 if (!size_only && array_length < index) {
8841 init_putz(t1, sec, c + array_length * size1,
8842 (index - array_length) * size1);
8844 index++;
8845 if (index > array_length)
8846 array_length = index;
8847 /* special test for multi dimensional arrays (may not
8848 be strictly correct if designators are used at the
8849 same time) */
8850 if (index >= n && no_oblock)
8851 break;
8852 if (tok == '}')
8853 break;
8854 skip(',');
8857 if (!no_oblock)
8858 skip('}');
8859 /* put zeros at the end */
8860 if (!size_only && n >= 0 && array_length < n) {
8861 init_putz(t1, sec, c + array_length * size1,
8862 (n - array_length) * size1);
8864 /* patch type size if needed */
8865 if (n < 0)
8866 s->c = array_length;
8867 } else if ((type->t & VT_BTYPE) == VT_STRUCT &&
8868 (sec || !first || tok == '{')) {
8869 int par_count;
8871 /* NOTE: the previous test is a specific case for automatic
8872 struct/union init */
8873 /* XXX: union needs only one init */
8875 /* XXX: this test is incorrect for local initializers
8876 beginning with ( without {. It would be much more difficult
8877 to do it correctly (ideally, the expression parser should
8878 be used in all cases) */
8879 par_count = 0;
8880 if (tok == '(') {
8881 AttributeDef ad1;
8882 CType type1;
8883 next();
8884 while (tok == '(') {
8885 par_count++;
8886 next();
8888 if (!parse_btype(&type1, &ad1))
8889 expect("cast");
8890 type_decl(&type1, &ad1, &n, TYPE_ABSTRACT);
8891 #if 0
8892 if (!is_assignable_types(type, &type1))
8893 error("invalid type for cast");
8894 #endif
8895 skip(')');
8897 no_oblock = 1;
8898 if (first || tok == '{') {
8899 skip('{');
8900 no_oblock = 0;
8902 s = type->ref;
8903 f = s->next;
8904 array_length = 0;
8905 index = 0;
8906 n = s->c;
8907 while (tok != '}') {
8908 decl_designator(type, sec, c, NULL, &f, size_only);
8909 index = f->c;
8910 if (!size_only && array_length < index) {
8911 init_putz(type, sec, c + array_length,
8912 index - array_length);
8914 index = index + type_size(&f->type, &align1);
8915 if (index > array_length)
8916 array_length = index;
8917 f = f->next;
8918 if (no_oblock && f == NULL)
8919 break;
8920 if (tok == '}')
8921 break;
8922 skip(',');
8924 /* put zeros at the end */
8925 if (!size_only && array_length < n) {
8926 init_putz(type, sec, c + array_length,
8927 n - array_length);
8929 if (!no_oblock)
8930 skip('}');
8931 while (par_count) {
8932 skip(')');
8933 par_count--;
8935 } else if (tok == '{') {
8936 next();
8937 decl_initializer(type, sec, c, first, size_only);
8938 skip('}');
8939 } else if (size_only) {
8940 /* just skip expression */
8941 parlevel = 0;
8942 while ((parlevel > 0 || (tok != '}' && tok != ',')) &&
8943 tok != -1) {
8944 if (tok == '(')
8945 parlevel++;
8946 else if (tok == ')')
8947 parlevel--;
8948 next();
8950 } else {
8951 /* currently, we always use constant expression for globals
8952 (may change for scripting case) */
8953 expr_type = EXPR_CONST;
8954 if (!sec)
8955 expr_type = EXPR_ANY;
8956 init_putv(type, sec, c, 0, expr_type);
8960 /* parse an initializer for type 't' if 'has_init' is non zero, and
8961 allocate space in local or global data space ('r' is either
8962 VT_LOCAL or VT_CONST). If 'v' is non zero, then an associated
8963 variable 'v' of scope 'scope' is declared before initializers are
8964 parsed. If 'v' is zero, then a reference to the new object is put
8965 in the value stack. If 'has_init' is 2, a special parsing is done
8966 to handle string constants. */
8967 static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r,
8968 int has_init, int v, int scope)
8970 int size, align, addr, data_offset;
8971 int level;
8972 ParseState saved_parse_state;
8973 TokenString init_str;
8974 Section *sec;
8976 size = type_size(type, &align);
8977 /* If unknown size, we must evaluate it before
8978 evaluating initializers because
8979 initializers can generate global data too
8980 (e.g. string pointers or ISOC99 compound
8981 literals). It also simplifies local
8982 initializers handling */
8983 tok_str_new(&init_str);
8984 if (size < 0) {
8985 if (!has_init)
8986 error("unknown type size");
8987 /* get all init string */
8988 if (has_init == 2) {
8989 /* only get strings */
8990 while (tok == TOK_STR || tok == TOK_LSTR) {
8991 tok_str_add_tok(&init_str);
8992 next();
8994 } else {
8995 level = 0;
8996 while (level > 0 || (tok != ',' && tok != ';')) {
8997 if (tok < 0)
8998 error("unexpected end of file in initializer");
8999 tok_str_add_tok(&init_str);
9000 if (tok == '{')
9001 level++;
9002 else if (tok == '}') {
9003 if (level == 0)
9004 break;
9005 level--;
9007 next();
9010 tok_str_add(&init_str, -1);
9011 tok_str_add(&init_str, 0);
9013 /* compute size */
9014 save_parse_state(&saved_parse_state);
9016 macro_ptr = init_str.str;
9017 next();
9018 decl_initializer(type, NULL, 0, 1, 1);
9019 /* prepare second initializer parsing */
9020 macro_ptr = init_str.str;
9021 next();
9023 /* if still unknown size, error */
9024 size = type_size(type, &align);
9025 if (size < 0)
9026 error("unknown type size");
9028 /* take into account specified alignment if bigger */
9029 if (ad->aligned) {
9030 if (ad->aligned > align)
9031 align = ad->aligned;
9032 } else if (ad->packed) {
9033 align = 1;
9035 if ((r & VT_VALMASK) == VT_LOCAL) {
9036 sec = NULL;
9037 if (do_bounds_check && (type->t & VT_ARRAY))
9038 loc--;
9039 loc = (loc - size) & -align;
9040 addr = loc;
9041 /* handles bounds */
9042 /* XXX: currently, since we do only one pass, we cannot track
9043 '&' operators, so we add only arrays */
9044 if (do_bounds_check && (type->t & VT_ARRAY)) {
9045 unsigned long *bounds_ptr;
9046 /* add padding between regions */
9047 loc--;
9048 /* then add local bound info */
9049 bounds_ptr = section_ptr_add(lbounds_section, 2 * sizeof(unsigned long));
9050 bounds_ptr[0] = addr;
9051 bounds_ptr[1] = size;
9053 if (v) {
9054 /* local variable */
9055 sym_push(v, type, r, addr);
9056 } else {
9057 /* push local reference */
9058 vset(type, r, addr);
9060 } else {
9061 Sym *sym;
9063 sym = NULL;
9064 if (v && scope == VT_CONST) {
9065 /* see if the symbol was already defined */
9066 sym = sym_find(v);
9067 if (sym) {
9068 if (!is_compatible_types(&sym->type, type))
9069 error("incompatible types for redefinition of '%s'",
9070 get_tok_str(v, NULL));
9071 if (sym->type.t & VT_EXTERN) {
9072 /* if the variable is extern, it was not allocated */
9073 sym->type.t &= ~VT_EXTERN;
9074 /* set array size if it was ommited in extern
9075 declaration */
9076 if ((sym->type.t & VT_ARRAY) &&
9077 sym->type.ref->c < 0 &&
9078 type->ref->c >= 0)
9079 sym->type.ref->c = type->ref->c;
9080 } else {
9081 /* we accept several definitions of the same
9082 global variable. this is tricky, because we
9083 must play with the SHN_COMMON type of the symbol */
9084 /* XXX: should check if the variable was already
9085 initialized. It is incorrect to initialized it
9086 twice */
9087 /* no init data, we won't add more to the symbol */
9088 if (!has_init)
9089 goto no_alloc;
9094 /* allocate symbol in corresponding section */
9095 sec = ad->section;
9096 if (!sec) {
9097 if (has_init)
9098 sec = data_section;
9099 else if (tcc_state->nocommon)
9100 sec = bss_section;
9102 if (sec) {
9103 data_offset = sec->data_offset;
9104 data_offset = (data_offset + align - 1) & -align;
9105 addr = data_offset;
9106 /* very important to increment global pointer at this time
9107 because initializers themselves can create new initializers */
9108 data_offset += size;
9109 /* add padding if bound check */
9110 if (do_bounds_check)
9111 data_offset++;
9112 sec->data_offset = data_offset;
9113 /* allocate section space to put the data */
9114 if (sec->sh_type != SHT_NOBITS &&
9115 data_offset > sec->data_allocated)
9116 section_realloc(sec, data_offset);
9117 /* align section if needed */
9118 if (align > sec->sh_addralign)
9119 sec->sh_addralign = align;
9120 } else {
9121 addr = 0; /* avoid warning */
9124 if (v) {
9125 if (scope != VT_CONST || !sym) {
9126 sym = sym_push(v, type, r | VT_SYM, 0);
9128 /* update symbol definition */
9129 if (sec) {
9130 put_extern_sym(sym, sec, addr, size);
9131 } else {
9132 Elf32_Sym *esym;
9133 /* put a common area */
9134 put_extern_sym(sym, NULL, align, size);
9135 /* XXX: find a nicer way */
9136 esym = &((Elf32_Sym *)symtab_section->data)[sym->c];
9137 esym->st_shndx = SHN_COMMON;
9139 } else {
9140 CValue cval;
9142 /* push global reference */
9143 sym = get_sym_ref(type, sec, addr, size);
9144 cval.ul = 0;
9145 vsetc(type, VT_CONST | VT_SYM, &cval);
9146 vtop->sym = sym;
9149 /* handles bounds now because the symbol must be defined
9150 before for the relocation */
9151 if (do_bounds_check) {
9152 unsigned long *bounds_ptr;
9154 greloc(bounds_section, sym, bounds_section->data_offset, R_DATA_32);
9155 /* then add global bound info */
9156 bounds_ptr = section_ptr_add(bounds_section, 2 * sizeof(long));
9157 bounds_ptr[0] = 0; /* relocated */
9158 bounds_ptr[1] = size;
9161 if (has_init) {
9162 decl_initializer(type, sec, addr, 1, 0);
9163 /* restore parse state if needed */
9164 if (init_str.str) {
9165 tok_str_free(init_str.str);
9166 restore_parse_state(&saved_parse_state);
9169 no_alloc: ;
9172 void put_func_debug(Sym *sym)
9174 char buf[512];
9176 /* stabs info */
9177 /* XXX: we put here a dummy type */
9178 snprintf(buf, sizeof(buf), "%s:%c1",
9179 funcname, sym->type.t & VT_STATIC ? 'f' : 'F');
9180 put_stabs_r(buf, N_FUN, 0, file->line_num, 0,
9181 cur_text_section, sym->c);
9182 /* //gr gdb wants a line at the function */
9183 put_stabn(N_SLINE, 0, file->line_num, 0);
9184 last_ind = 0;
9185 last_line_num = 0;
9188 /* parse an old style function declaration list */
9189 /* XXX: check multiple parameter */
9190 static void func_decl_list(Sym *func_sym)
9192 AttributeDef ad;
9193 int v;
9194 Sym *s;
9195 CType btype, type;
9197 /* parse each declaration */
9198 while (tok != '{' && tok != ';' && tok != ',' && tok != TOK_EOF) {
9199 if (!parse_btype(&btype, &ad))
9200 expect("declaration list");
9201 if (((btype.t & VT_BTYPE) == VT_ENUM ||
9202 (btype.t & VT_BTYPE) == VT_STRUCT) &&
9203 tok == ';') {
9204 /* we accept no variable after */
9205 } else {
9206 for(;;) {
9207 type = btype;
9208 type_decl(&type, &ad, &v, TYPE_DIRECT);
9209 /* find parameter in function parameter list */
9210 s = func_sym->next;
9211 while (s != NULL) {
9212 if ((s->v & ~SYM_FIELD) == v)
9213 goto found;
9214 s = s->next;
9216 error("declaration for parameter '%s' but no such parameter",
9217 get_tok_str(v, NULL));
9218 found:
9219 /* check that no storage specifier except 'register' was given */
9220 if (type.t & VT_STORAGE)
9221 error("storage class specified for '%s'", get_tok_str(v, NULL));
9222 convert_parameter_type(&type);
9223 /* we can add the type (NOTE: it could be local to the function) */
9224 s->type = type;
9225 /* accept other parameters */
9226 if (tok == ',')
9227 next();
9228 else
9229 break;
9232 skip(';');
9236 /* parse a function defined by symbol 'sym' and generate its code in
9237 'cur_text_section' */
9238 static void gen_function(Sym *sym)
9240 int saved_nocode_wanted = nocode_wanted;
9241 nocode_wanted = 0;
9242 ind = cur_text_section->data_offset;
9243 /* NOTE: we patch the symbol size later */
9244 put_extern_sym(sym, cur_text_section, ind, 0);
9245 funcname = get_tok_str(sym->v, NULL);
9246 func_ind = ind;
9247 /* put debug symbol */
9248 if (do_debug)
9249 put_func_debug(sym);
9250 /* push a dummy symbol to enable local sym storage */
9251 sym_push2(&local_stack, SYM_FIELD, 0, 0);
9252 gfunc_prolog(&sym->type);
9253 rsym = 0;
9254 block(NULL, NULL, NULL, NULL, 0, 0);
9255 gsym(rsym);
9256 gfunc_epilog();
9257 cur_text_section->data_offset = ind;
9258 label_pop(&global_label_stack, NULL);
9259 sym_pop(&local_stack, NULL); /* reset local stack */
9260 /* end of function */
9261 /* patch symbol size */
9262 ((Elf32_Sym *)symtab_section->data)[sym->c].st_size =
9263 ind - func_ind;
9264 if (do_debug) {
9265 put_stabn(N_FUN, 0, 0, ind - func_ind);
9267 /* It's better to crash than to generate wrong code */
9268 cur_text_section = NULL;
9269 funcname = ""; /* for safety */
9270 func_vt.t = VT_VOID; /* for safety */
9271 ind = 0; /* for safety */
9272 nocode_wanted = saved_nocode_wanted;
9275 static void gen_inline_functions(void)
9277 Sym *sym;
9278 CType *type;
9279 int *str, inline_generated;
9281 /* iterate while inline function are referenced */
9282 for(;;) {
9283 inline_generated = 0;
9284 for(sym = global_stack; sym != NULL; sym = sym->prev) {
9285 type = &sym->type;
9286 if (((type->t & VT_BTYPE) == VT_FUNC) &&
9287 (type->t & (VT_STATIC | VT_INLINE)) ==
9288 (VT_STATIC | VT_INLINE) &&
9289 sym->c != 0) {
9290 /* the function was used: generate its code and
9291 convert it to a normal function */
9292 str = INLINE_DEF(sym->r);
9293 sym->r = VT_SYM | VT_CONST;
9294 sym->type.t &= ~VT_INLINE;
9296 macro_ptr = str;
9297 next();
9298 cur_text_section = text_section;
9299 gen_function(sym);
9300 macro_ptr = NULL; /* fail safe */
9302 tok_str_free(str);
9303 inline_generated = 1;
9306 if (!inline_generated)
9307 break;
9310 /* free all remaining inline function tokens */
9311 for(sym = global_stack; sym != NULL; sym = sym->prev) {
9312 type = &sym->type;
9313 if (((type->t & VT_BTYPE) == VT_FUNC) &&
9314 (type->t & (VT_STATIC | VT_INLINE)) ==
9315 (VT_STATIC | VT_INLINE)) {
9316 //gr printf("sym %d %s\n", sym->r, get_tok_str(sym->v, NULL));
9317 if (sym->r == (VT_SYM | VT_CONST)) //gr beware!
9318 continue;
9319 str = INLINE_DEF(sym->r);
9320 tok_str_free(str);
9321 sym->r = 0; /* fail safe */
9326 /* 'l' is VT_LOCAL or VT_CONST to define default storage type */
9327 static void decl(int l)
9329 int v, has_init, r;
9330 CType type, btype;
9331 Sym *sym;
9332 AttributeDef ad;
9334 while (1) {
9335 if (!parse_btype(&btype, &ad)) {
9336 /* skip redundant ';' */
9337 /* XXX: find more elegant solution */
9338 if (tok == ';') {
9339 next();
9340 continue;
9342 if (l == VT_CONST &&
9343 (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
9344 /* global asm block */
9345 asm_global_instr();
9346 continue;
9348 /* special test for old K&R protos without explicit int
9349 type. Only accepted when defining global data */
9350 if (l == VT_LOCAL || tok < TOK_DEFINE)
9351 break;
9352 btype.t = VT_INT;
9354 if (((btype.t & VT_BTYPE) == VT_ENUM ||
9355 (btype.t & VT_BTYPE) == VT_STRUCT) &&
9356 tok == ';') {
9357 /* we accept no variable after */
9358 next();
9359 continue;
9361 while (1) { /* iterate thru each declaration */
9362 type = btype;
9363 type_decl(&type, &ad, &v, TYPE_DIRECT);
9364 #if 0
9366 char buf[500];
9367 type_to_str(buf, sizeof(buf), t, get_tok_str(v, NULL));
9368 printf("type = '%s'\n", buf);
9370 #endif
9371 if ((type.t & VT_BTYPE) == VT_FUNC) {
9372 /* if old style function prototype, we accept a
9373 declaration list */
9374 sym = type.ref;
9375 if (sym->c == FUNC_OLD)
9376 func_decl_list(sym);
9379 if (tok == '{') {
9380 if (l == VT_LOCAL)
9381 error("cannot use local functions");
9382 if ((type.t & VT_BTYPE) != VT_FUNC)
9383 expect("function definition");
9385 /* reject abstract declarators in function definition */
9386 sym = type.ref;
9387 while ((sym = sym->next) != NULL)
9388 if (!(sym->v & ~SYM_FIELD))
9389 expect("identifier");
9391 /* XXX: cannot do better now: convert extern line to static inline */
9392 if ((type.t & (VT_EXTERN | VT_INLINE)) == (VT_EXTERN | VT_INLINE))
9393 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
9395 sym = sym_find(v);
9396 if (sym) {
9397 if ((sym->type.t & VT_BTYPE) != VT_FUNC)
9398 goto func_error1;
9399 /* specific case: if not func_call defined, we put
9400 the one of the prototype */
9401 /* XXX: should have default value */
9402 r = sym->type.ref->r;
9403 if (FUNC_CALL(r) != FUNC_CDECL
9404 && FUNC_CALL(type.ref->r) == FUNC_CDECL)
9405 FUNC_CALL(type.ref->r) = FUNC_CALL(r);
9406 if (FUNC_EXPORT(r))
9407 FUNC_EXPORT(type.ref->r) = 1;
9409 if (!is_compatible_types(&sym->type, &type)) {
9410 func_error1:
9411 error("incompatible types for redefinition of '%s'",
9412 get_tok_str(v, NULL));
9414 /* if symbol is already defined, then put complete type */
9415 sym->type = type;
9416 } else {
9417 /* put function symbol */
9418 sym = global_identifier_push(v, type.t, 0);
9419 sym->type.ref = type.ref;
9422 /* static inline functions are just recorded as a kind
9423 of macro. Their code will be emitted at the end of
9424 the compilation unit only if they are used */
9425 if ((type.t & (VT_INLINE | VT_STATIC)) ==
9426 (VT_INLINE | VT_STATIC)) {
9427 TokenString func_str;
9428 int block_level;
9430 tok_str_new(&func_str);
9432 block_level = 0;
9433 for(;;) {
9434 int t;
9435 if (tok == TOK_EOF)
9436 error("unexpected end of file");
9437 tok_str_add_tok(&func_str);
9438 t = tok;
9439 next();
9440 if (t == '{') {
9441 block_level++;
9442 } else if (t == '}') {
9443 block_level--;
9444 if (block_level == 0)
9445 break;
9448 tok_str_add(&func_str, -1);
9449 tok_str_add(&func_str, 0);
9450 INLINE_DEF(sym->r) = func_str.str;
9451 } else {
9452 /* compute text section */
9453 cur_text_section = ad.section;
9454 if (!cur_text_section)
9455 cur_text_section = text_section;
9456 sym->r = VT_SYM | VT_CONST;
9457 gen_function(sym);
9459 break;
9460 } else {
9461 if (btype.t & VT_TYPEDEF) {
9462 /* save typedefed type */
9463 /* XXX: test storage specifiers ? */
9464 sym = sym_push(v, &type, 0, 0);
9465 sym->type.t |= VT_TYPEDEF;
9466 } else if ((type.t & VT_BTYPE) == VT_FUNC) {
9467 /* external function definition */
9468 /* specific case for func_call attribute */
9469 if (ad.func_attr)
9470 type.ref->r = ad.func_attr;
9471 external_sym(v, &type, 0);
9472 } else {
9473 /* not lvalue if array */
9474 r = 0;
9475 if (!(type.t & VT_ARRAY))
9476 r |= lvalue_type(type.t);
9477 has_init = (tok == '=');
9478 if ((btype.t & VT_EXTERN) ||
9479 ((type.t & VT_ARRAY) && (type.t & VT_STATIC) &&
9480 !has_init && l == VT_CONST && type.ref->c < 0)) {
9481 /* external variable */
9482 /* NOTE: as GCC, uninitialized global static
9483 arrays of null size are considered as
9484 extern */
9485 external_sym(v, &type, r);
9486 } else {
9487 type.t |= (btype.t & VT_STATIC); /* Retain "static". */
9488 if (type.t & VT_STATIC)
9489 r |= VT_CONST;
9490 else
9491 r |= l;
9492 if (has_init)
9493 next();
9494 decl_initializer_alloc(&type, &ad, r,
9495 has_init, v, l);
9498 if (tok != ',') {
9499 skip(';');
9500 break;
9502 next();
9508 /* better than nothing, but needs extension to handle '-E' option
9509 correctly too */
9510 static void preprocess_init(TCCState *s1)
9512 s1->include_stack_ptr = s1->include_stack;
9513 /* XXX: move that before to avoid having to initialize
9514 file->ifdef_stack_ptr ? */
9515 s1->ifdef_stack_ptr = s1->ifdef_stack;
9516 file->ifdef_stack_ptr = s1->ifdef_stack_ptr;
9518 /* XXX: not ANSI compliant: bound checking says error */
9519 vtop = vstack - 1;
9520 s1->pack_stack[0] = 0;
9521 s1->pack_stack_ptr = s1->pack_stack;
9524 /* compile the C file opened in 'file'. Return non zero if errors. */
9525 static int tcc_compile(TCCState *s1)
9527 Sym *define_start;
9528 char buf[512];
9529 volatile int section_sym;
9531 #ifdef INC_DEBUG
9532 printf("%s: **** new file\n", file->filename);
9533 #endif
9534 preprocess_init(s1);
9536 cur_text_section = NULL;
9537 funcname = "";
9538 anon_sym = SYM_FIRST_ANOM;
9540 /* file info: full path + filename */
9541 section_sym = 0; /* avoid warning */
9542 if (do_debug) {
9543 section_sym = put_elf_sym(symtab_section, 0, 0,
9544 ELF32_ST_INFO(STB_LOCAL, STT_SECTION), 0,
9545 text_section->sh_num, NULL);
9546 getcwd(buf, sizeof(buf));
9547 #ifdef _WIN32
9548 normalize_slashes(buf);
9549 #endif
9550 pstrcat(buf, sizeof(buf), "/");
9551 put_stabs_r(buf, N_SO, 0, 0,
9552 text_section->data_offset, text_section, section_sym);
9553 put_stabs_r(file->filename, N_SO, 0, 0,
9554 text_section->data_offset, text_section, section_sym);
9556 /* an elf symbol of type STT_FILE must be put so that STB_LOCAL
9557 symbols can be safely used */
9558 put_elf_sym(symtab_section, 0, 0,
9559 ELF32_ST_INFO(STB_LOCAL, STT_FILE), 0,
9560 SHN_ABS, file->filename);
9562 /* define some often used types */
9563 int_type.t = VT_INT;
9565 char_pointer_type.t = VT_BYTE;
9566 mk_pointer(&char_pointer_type);
9568 func_old_type.t = VT_FUNC;
9569 func_old_type.ref = sym_push(SYM_FIELD, &int_type, FUNC_CDECL, FUNC_OLD);
9571 #if defined(TCC_ARM_EABI) && defined(TCC_ARM_VFP)
9572 float_type.t = VT_FLOAT;
9573 double_type.t = VT_DOUBLE;
9575 func_float_type.t = VT_FUNC;
9576 func_float_type.ref = sym_push(SYM_FIELD, &float_type, FUNC_CDECL, FUNC_OLD);
9577 func_double_type.t = VT_FUNC;
9578 func_double_type.ref = sym_push(SYM_FIELD, &double_type, FUNC_CDECL, FUNC_OLD);
9579 #endif
9581 #if 0
9582 /* define 'void *alloca(unsigned int)' builtin function */
9584 Sym *s1;
9586 p = anon_sym++;
9587 sym = sym_push(p, mk_pointer(VT_VOID), FUNC_CDECL, FUNC_NEW);
9588 s1 = sym_push(SYM_FIELD, VT_UNSIGNED | VT_INT, 0, 0);
9589 s1->next = NULL;
9590 sym->next = s1;
9591 sym_push(TOK_alloca, VT_FUNC | (p << VT_STRUCT_SHIFT), VT_CONST, 0);
9593 #endif
9595 define_start = define_stack;
9596 nocode_wanted = 1;
9598 if (setjmp(s1->error_jmp_buf) == 0) {
9599 s1->nb_errors = 0;
9600 s1->error_set_jmp_enabled = 1;
9602 ch = file->buf_ptr[0];
9603 tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF;
9604 parse_flags = PARSE_FLAG_PREPROCESS | PARSE_FLAG_TOK_NUM;
9605 next();
9606 decl(VT_CONST);
9607 if (tok != TOK_EOF)
9608 expect("declaration");
9610 /* end of translation unit info */
9611 if (do_debug) {
9612 put_stabs_r(NULL, N_SO, 0, 0,
9613 text_section->data_offset, text_section, section_sym);
9616 s1->error_set_jmp_enabled = 0;
9618 /* reset define stack, but leave -Dsymbols (may be incorrect if
9619 they are undefined) */
9620 free_defines(define_start);
9622 gen_inline_functions();
9624 sym_pop(&global_stack, NULL);
9625 sym_pop(&local_stack, NULL);
9627 return s1->nb_errors != 0 ? -1 : 0;
9630 /* Preprocess the current file */
9631 /* XXX: add line and file infos, add options to preserve spaces */
9632 static int tcc_preprocess(TCCState *s1)
9634 Sym *define_start;
9635 int last_is_space;
9637 preprocess_init(s1);
9639 define_start = define_stack;
9641 ch = file->buf_ptr[0];
9642 tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF;
9643 parse_flags = PARSE_FLAG_ASM_COMMENTS | PARSE_FLAG_PREPROCESS |
9644 PARSE_FLAG_LINEFEED;
9645 last_is_space = 1;
9646 next();
9647 for(;;) {
9648 if (tok == TOK_EOF) {
9649 break;
9650 } else if (tok == TOK_LINEFEED) {
9651 last_is_space = 1;
9652 } else {
9653 if (!last_is_space)
9654 fputc(' ', s1->outfile);
9655 last_is_space = 0;
9657 fputs(get_tok_str(tok, &tokc), s1->outfile);
9658 next();
9660 free_defines(define_start);
9661 return 0;
9664 #ifdef LIBTCC
9665 int tcc_compile_string(TCCState *s, const char *str)
9667 BufferedFile bf1, *bf = &bf1;
9668 int ret, len;
9669 char *buf;
9671 /* init file structure */
9672 bf->fd = -1;
9673 /* XXX: avoid copying */
9674 len = strlen(str);
9675 buf = tcc_malloc(len + 1);
9676 if (!buf)
9677 return -1;
9678 memcpy(buf, str, len);
9679 buf[len] = CH_EOB;
9680 bf->buf_ptr = buf;
9681 bf->buf_end = buf + len;
9682 pstrcpy(bf->filename, sizeof(bf->filename), "<string>");
9683 bf->line_num = 1;
9684 file = bf;
9685 ret = tcc_compile(s);
9686 file = NULL;
9687 tcc_free(buf);
9689 /* currently, no need to close */
9690 return ret;
9692 #endif
9694 /* define a preprocessor symbol. A value can also be provided with the '=' operator */
9695 void tcc_define_symbol(TCCState *s1, const char *sym, const char *value)
9697 BufferedFile bf1, *bf = &bf1;
9699 pstrcpy(bf->buffer, IO_BUF_SIZE, sym);
9700 pstrcat(bf->buffer, IO_BUF_SIZE, " ");
9701 /* default value */
9702 if (!value)
9703 value = "1";
9704 pstrcat(bf->buffer, IO_BUF_SIZE, value);
9706 /* init file structure */
9707 bf->fd = -1;
9708 bf->buf_ptr = bf->buffer;
9709 bf->buf_end = bf->buffer + strlen(bf->buffer);
9710 *bf->buf_end = CH_EOB;
9711 bf->filename[0] = '\0';
9712 bf->line_num = 1;
9713 file = bf;
9715 s1->include_stack_ptr = s1->include_stack;
9717 /* parse with define parser */
9718 ch = file->buf_ptr[0];
9719 next_nomacro();
9720 parse_define();
9721 file = NULL;
9724 /* undefine a preprocessor symbol */
9725 void tcc_undefine_symbol(TCCState *s1, const char *sym)
9727 TokenSym *ts;
9728 Sym *s;
9729 ts = tok_alloc(sym, strlen(sym));
9730 s = define_find(ts->tok);
9731 /* undefine symbol by putting an invalid name */
9732 if (s)
9733 define_undef(s);
9736 #ifdef CONFIG_TCC_ASM
9738 #ifdef TCC_TARGET_I386
9739 #include "i386-asm.c"
9740 #endif
9741 #include "tccasm.c"
9743 #else
9744 static void asm_instr(void)
9746 error("inline asm() not supported");
9748 static void asm_global_instr(void)
9750 error("inline asm() not supported");
9752 #endif
9754 #include "tccelf.c"
9756 #ifdef TCC_TARGET_COFF
9757 #include "tcccoff.c"
9758 #endif
9760 #ifdef TCC_TARGET_PE
9761 #include "tccpe.c"
9762 #endif
9764 /* print the position in the source file of PC value 'pc' by reading
9765 the stabs debug information */
9766 static void rt_printline(unsigned long wanted_pc)
9768 Stab_Sym *sym, *sym_end;
9769 char func_name[128], last_func_name[128];
9770 unsigned long func_addr, last_pc, pc;
9771 const char *incl_files[INCLUDE_STACK_SIZE];
9772 int incl_index, len, last_line_num, i;
9773 const char *str, *p;
9775 fprintf(stderr, "0x%08lx:", wanted_pc);
9777 func_name[0] = '\0';
9778 func_addr = 0;
9779 incl_index = 0;
9780 last_func_name[0] = '\0';
9781 last_pc = 0xffffffff;
9782 last_line_num = 1;
9783 sym = (Stab_Sym *)stab_section->data + 1;
9784 sym_end = (Stab_Sym *)(stab_section->data + stab_section->data_offset);
9785 while (sym < sym_end) {
9786 switch(sym->n_type) {
9787 /* function start or end */
9788 case N_FUN:
9789 if (sym->n_strx == 0) {
9790 /* we test if between last line and end of function */
9791 pc = sym->n_value + func_addr;
9792 if (wanted_pc >= last_pc && wanted_pc < pc)
9793 goto found;
9794 func_name[0] = '\0';
9795 func_addr = 0;
9796 } else {
9797 str = stabstr_section->data + sym->n_strx;
9798 p = strchr(str, ':');
9799 if (!p) {
9800 pstrcpy(func_name, sizeof(func_name), str);
9801 } else {
9802 len = p - str;
9803 if (len > sizeof(func_name) - 1)
9804 len = sizeof(func_name) - 1;
9805 memcpy(func_name, str, len);
9806 func_name[len] = '\0';
9808 func_addr = sym->n_value;
9810 break;
9811 /* line number info */
9812 case N_SLINE:
9813 pc = sym->n_value + func_addr;
9814 if (wanted_pc >= last_pc && wanted_pc < pc)
9815 goto found;
9816 last_pc = pc;
9817 last_line_num = sym->n_desc;
9818 /* XXX: slow! */
9819 strcpy(last_func_name, func_name);
9820 break;
9821 /* include files */
9822 case N_BINCL:
9823 str = stabstr_section->data + sym->n_strx;
9824 add_incl:
9825 if (incl_index < INCLUDE_STACK_SIZE) {
9826 incl_files[incl_index++] = str;
9828 break;
9829 case N_EINCL:
9830 if (incl_index > 1)
9831 incl_index--;
9832 break;
9833 case N_SO:
9834 if (sym->n_strx == 0) {
9835 incl_index = 0; /* end of translation unit */
9836 } else {
9837 str = stabstr_section->data + sym->n_strx;
9838 /* do not add path */
9839 len = strlen(str);
9840 if (len > 0 && str[len - 1] != '/')
9841 goto add_incl;
9843 break;
9845 sym++;
9848 /* second pass: we try symtab symbols (no line number info) */
9849 incl_index = 0;
9851 Elf32_Sym *sym, *sym_end;
9852 int type;
9854 sym_end = (Elf32_Sym *)(symtab_section->data + symtab_section->data_offset);
9855 for(sym = (Elf32_Sym *)symtab_section->data + 1;
9856 sym < sym_end;
9857 sym++) {
9858 type = ELF32_ST_TYPE(sym->st_info);
9859 if (type == STT_FUNC) {
9860 if (wanted_pc >= sym->st_value &&
9861 wanted_pc < sym->st_value + sym->st_size) {
9862 pstrcpy(last_func_name, sizeof(last_func_name),
9863 strtab_section->data + sym->st_name);
9864 goto found;
9869 /* did not find any info: */
9870 fprintf(stderr, " ???\n");
9871 return;
9872 found:
9873 if (last_func_name[0] != '\0') {
9874 fprintf(stderr, " %s()", last_func_name);
9876 if (incl_index > 0) {
9877 fprintf(stderr, " (%s:%d",
9878 incl_files[incl_index - 1], last_line_num);
9879 for(i = incl_index - 2; i >= 0; i--)
9880 fprintf(stderr, ", included from %s", incl_files[i]);
9881 fprintf(stderr, ")");
9883 fprintf(stderr, "\n");
9886 #if !defined(_WIN32) && !defined(CONFIG_TCCBOOT)
9888 #ifdef __i386__
9890 /* fix for glibc 2.1 */
9891 #ifndef REG_EIP
9892 #define REG_EIP EIP
9893 #define REG_EBP EBP
9894 #endif
9896 /* return the PC at frame level 'level'. Return non zero if not found */
9897 static int rt_get_caller_pc(unsigned long *paddr,
9898 ucontext_t *uc, int level)
9900 unsigned long fp;
9901 int i;
9903 if (level == 0) {
9904 #if defined(__FreeBSD__)
9905 *paddr = uc->uc_mcontext.mc_eip;
9906 #elif defined(__dietlibc__)
9907 *paddr = uc->uc_mcontext.eip;
9908 #else
9909 *paddr = uc->uc_mcontext.gregs[REG_EIP];
9910 #endif
9911 return 0;
9912 } else {
9913 #if defined(__FreeBSD__)
9914 fp = uc->uc_mcontext.mc_ebp;
9915 #elif defined(__dietlibc__)
9916 fp = uc->uc_mcontext.ebp;
9917 #else
9918 fp = uc->uc_mcontext.gregs[REG_EBP];
9919 #endif
9920 for(i=1;i<level;i++) {
9921 /* XXX: check address validity with program info */
9922 if (fp <= 0x1000 || fp >= 0xc0000000)
9923 return -1;
9924 fp = ((unsigned long *)fp)[0];
9926 *paddr = ((unsigned long *)fp)[1];
9927 return 0;
9930 #else
9932 #warning add arch specific rt_get_caller_pc()
9934 static int rt_get_caller_pc(unsigned long *paddr,
9935 ucontext_t *uc, int level)
9937 return -1;
9939 #endif
9941 /* emit a run time error at position 'pc' */
9942 void rt_error(ucontext_t *uc, const char *fmt, ...)
9944 va_list ap;
9945 unsigned long pc;
9946 int i;
9948 va_start(ap, fmt);
9949 fprintf(stderr, "Runtime error: ");
9950 vfprintf(stderr, fmt, ap);
9951 fprintf(stderr, "\n");
9952 for(i=0;i<num_callers;i++) {
9953 if (rt_get_caller_pc(&pc, uc, i) < 0)
9954 break;
9955 if (i == 0)
9956 fprintf(stderr, "at ");
9957 else
9958 fprintf(stderr, "by ");
9959 rt_printline(pc);
9961 exit(255);
9962 va_end(ap);
9965 /* signal handler for fatal errors */
9966 static void sig_error(int signum, siginfo_t *siginf, void *puc)
9968 ucontext_t *uc = puc;
9970 switch(signum) {
9971 case SIGFPE:
9972 switch(siginf->si_code) {
9973 case FPE_INTDIV:
9974 case FPE_FLTDIV:
9975 rt_error(uc, "division by zero");
9976 break;
9977 default:
9978 rt_error(uc, "floating point exception");
9979 break;
9981 break;
9982 case SIGBUS:
9983 case SIGSEGV:
9984 if (rt_bound_error_msg && *rt_bound_error_msg)
9985 rt_error(uc, *rt_bound_error_msg);
9986 else
9987 rt_error(uc, "dereferencing invalid pointer");
9988 break;
9989 case SIGILL:
9990 rt_error(uc, "illegal instruction");
9991 break;
9992 case SIGABRT:
9993 rt_error(uc, "abort() called");
9994 break;
9995 default:
9996 rt_error(uc, "caught signal %d", signum);
9997 break;
9999 exit(255);
10001 #endif
10003 /* do all relocations (needed before using tcc_get_symbol()) */
10004 int tcc_relocate(TCCState *s1)
10006 Section *s;
10007 int i;
10009 s1->nb_errors = 0;
10011 #ifdef TCC_TARGET_PE
10012 pe_add_runtime(s1);
10013 #else
10014 tcc_add_runtime(s1);
10015 #endif
10017 relocate_common_syms();
10019 tcc_add_linker_symbols(s1);
10020 #ifndef TCC_TARGET_PE
10021 build_got_entries(s1);
10022 #endif
10023 /* compute relocation address : section are relocated in place. We
10024 also alloc the bss space */
10025 for(i = 1; i < s1->nb_sections; i++) {
10026 s = s1->sections[i];
10027 if (s->sh_flags & SHF_ALLOC) {
10028 if (s->sh_type == SHT_NOBITS)
10029 s->data = tcc_mallocz(s->data_offset);
10030 s->sh_addr = (unsigned long)s->data;
10034 relocate_syms(s1, 1);
10036 if (s1->nb_errors != 0)
10037 return -1;
10039 /* relocate each section */
10040 for(i = 1; i < s1->nb_sections; i++) {
10041 s = s1->sections[i];
10042 if (s->reloc)
10043 relocate_section(s1, s);
10046 /* mark executable sections as executable in memory */
10047 for(i = 1; i < s1->nb_sections; i++) {
10048 s = s1->sections[i];
10049 if ((s->sh_flags & (SHF_ALLOC | SHF_EXECINSTR)) ==
10050 (SHF_ALLOC | SHF_EXECINSTR))
10051 set_pages_executable(s->data, s->data_offset);
10053 return 0;
10056 /* launch the compiled program with the given arguments */
10057 int tcc_run(TCCState *s1, int argc, char **argv)
10059 int (*prog_main)(int, char **);
10061 if (tcc_relocate(s1) < 0)
10062 return -1;
10064 prog_main = tcc_get_symbol_err(s1, "main");
10066 if (do_debug) {
10067 #if defined(_WIN32) || defined(CONFIG_TCCBOOT)
10068 error("debug mode currently not available for Windows");
10069 #else
10070 struct sigaction sigact;
10071 /* install TCC signal handlers to print debug info on fatal
10072 runtime errors */
10073 sigact.sa_flags = SA_SIGINFO | SA_RESETHAND;
10074 sigact.sa_sigaction = sig_error;
10075 sigemptyset(&sigact.sa_mask);
10076 sigaction(SIGFPE, &sigact, NULL);
10077 sigaction(SIGILL, &sigact, NULL);
10078 sigaction(SIGSEGV, &sigact, NULL);
10079 sigaction(SIGBUS, &sigact, NULL);
10080 sigaction(SIGABRT, &sigact, NULL);
10081 #endif
10084 #ifdef CONFIG_TCC_BCHECK
10085 if (do_bounds_check) {
10086 void (*bound_init)(void);
10088 /* set error function */
10089 rt_bound_error_msg = (void *)tcc_get_symbol_err(s1,
10090 "__bound_error_msg");
10092 /* XXX: use .init section so that it also work in binary ? */
10093 bound_init = (void *)tcc_get_symbol_err(s1, "__bound_init");
10094 bound_init();
10096 #endif
10097 return (*prog_main)(argc, argv);
10100 void tcc_memstats(void)
10102 #ifdef MEM_DEBUG
10103 printf("memory in use: %d\n", mem_cur_size);
10104 #endif
10107 static void tcc_cleanup(void)
10109 int i, n;
10111 if (NULL == tcc_state)
10112 return;
10113 tcc_state = NULL;
10115 /* free -D defines */
10116 free_defines(NULL);
10118 /* free tokens */
10119 n = tok_ident - TOK_IDENT;
10120 for(i = 0; i < n; i++)
10121 tcc_free(table_ident[i]);
10122 tcc_free(table_ident);
10124 /* free sym_pools */
10125 dynarray_reset(&sym_pools, &nb_sym_pools);
10126 /* string buffer */
10127 cstr_free(&tokcstr);
10128 /* reset symbol stack */
10129 sym_free_first = NULL;
10130 /* cleanup from error/setjmp */
10131 macro_ptr = NULL;
10134 TCCState *tcc_new(void)
10136 const char *p, *r;
10137 TCCState *s;
10138 TokenSym *ts;
10139 int i, c;
10141 tcc_cleanup();
10143 s = tcc_mallocz(sizeof(TCCState));
10144 if (!s)
10145 return NULL;
10146 tcc_state = s;
10147 s->output_type = TCC_OUTPUT_MEMORY;
10149 /* init isid table */
10150 for(i=CH_EOF;i<256;i++)
10151 isidnum_table[i-CH_EOF] = isid(i) || isnum(i);
10153 /* add all tokens */
10154 table_ident = NULL;
10155 memset(hash_ident, 0, TOK_HASH_SIZE * sizeof(TokenSym *));
10157 tok_ident = TOK_IDENT;
10158 p = tcc_keywords;
10159 while (*p) {
10160 r = p;
10161 for(;;) {
10162 c = *r++;
10163 if (c == '\0')
10164 break;
10166 ts = tok_alloc(p, r - p - 1);
10167 p = r;
10170 /* we add dummy defines for some special macros to speed up tests
10171 and to have working defined() */
10172 define_push(TOK___LINE__, MACRO_OBJ, NULL, NULL);
10173 define_push(TOK___FILE__, MACRO_OBJ, NULL, NULL);
10174 define_push(TOK___DATE__, MACRO_OBJ, NULL, NULL);
10175 define_push(TOK___TIME__, MACRO_OBJ, NULL, NULL);
10177 /* standard defines */
10178 tcc_define_symbol(s, "__STDC__", NULL);
10179 tcc_define_symbol(s, "__STDC_VERSION__", "199901L");
10180 #if defined(TCC_TARGET_I386)
10181 tcc_define_symbol(s, "__i386__", NULL);
10182 #endif
10183 #if defined(TCC_TARGET_ARM)
10184 tcc_define_symbol(s, "__ARM_ARCH_4__", NULL);
10185 tcc_define_symbol(s, "__arm_elf__", NULL);
10186 tcc_define_symbol(s, "__arm_elf", NULL);
10187 tcc_define_symbol(s, "arm_elf", NULL);
10188 tcc_define_symbol(s, "__arm__", NULL);
10189 tcc_define_symbol(s, "__arm", NULL);
10190 tcc_define_symbol(s, "arm", NULL);
10191 tcc_define_symbol(s, "__APCS_32__", NULL);
10192 #endif
10193 #ifdef TCC_TARGET_PE
10194 tcc_define_symbol(s, "_WIN32", NULL);
10195 #else
10196 tcc_define_symbol(s, "__unix__", NULL);
10197 tcc_define_symbol(s, "__unix", NULL);
10198 #if defined(__linux)
10199 tcc_define_symbol(s, "__linux__", NULL);
10200 tcc_define_symbol(s, "__linux", NULL);
10201 #endif
10202 #endif
10203 /* tiny C specific defines */
10204 tcc_define_symbol(s, "__TINYC__", NULL);
10206 /* tiny C & gcc defines */
10207 tcc_define_symbol(s, "__SIZE_TYPE__", "unsigned int");
10208 tcc_define_symbol(s, "__PTRDIFF_TYPE__", "int");
10209 #ifdef TCC_TARGET_PE
10210 tcc_define_symbol(s, "__WCHAR_TYPE__", "unsigned short");
10211 #else
10212 tcc_define_symbol(s, "__WCHAR_TYPE__", "int");
10213 #endif
10215 #ifndef TCC_TARGET_PE
10216 /* default library paths */
10217 tcc_add_library_path(s, CONFIG_SYSROOT "/usr/local/lib");
10218 tcc_add_library_path(s, CONFIG_SYSROOT "/usr/lib");
10219 tcc_add_library_path(s, CONFIG_SYSROOT "/lib");
10220 #endif
10222 /* no section zero */
10223 dynarray_add((void ***)&s->sections, &s->nb_sections, NULL);
10225 /* create standard sections */
10226 text_section = new_section(s, ".text", SHT_PROGBITS, SHF_ALLOC | SHF_EXECINSTR);
10227 data_section = new_section(s, ".data", SHT_PROGBITS, SHF_ALLOC | SHF_WRITE);
10228 bss_section = new_section(s, ".bss", SHT_NOBITS, SHF_ALLOC | SHF_WRITE);
10230 /* symbols are always generated for linking stage */
10231 symtab_section = new_symtab(s, ".symtab", SHT_SYMTAB, 0,
10232 ".strtab",
10233 ".hashtab", SHF_PRIVATE);
10234 strtab_section = symtab_section->link;
10236 /* private symbol table for dynamic symbols */
10237 s->dynsymtab_section = new_symtab(s, ".dynsymtab", SHT_SYMTAB, SHF_PRIVATE,
10238 ".dynstrtab",
10239 ".dynhashtab", SHF_PRIVATE);
10240 s->alacarte_link = 1;
10242 #ifdef CHAR_IS_UNSIGNED
10243 s->char_is_unsigned = 1;
10244 #endif
10245 #if defined(TCC_TARGET_PE) && 0
10246 /* XXX: currently the PE linker is not ready to support that */
10247 s->leading_underscore = 1;
10248 #endif
10249 return s;
10252 void tcc_delete(TCCState *s1)
10254 int i;
10256 tcc_cleanup();
10258 /* free all sections */
10259 free_section(s1->dynsymtab_section);
10261 for(i = 1; i < s1->nb_sections; i++)
10262 free_section(s1->sections[i]);
10263 tcc_free(s1->sections);
10265 /* free any loaded DLLs */
10266 for ( i = 0; i < s1->nb_loaded_dlls; i++)
10268 DLLReference *ref = s1->loaded_dlls[i];
10269 if ( ref->handle )
10270 dlclose(ref->handle);
10273 /* free loaded dlls array */
10274 dynarray_reset(&s1->loaded_dlls, &s1->nb_loaded_dlls);
10276 /* free library paths */
10277 dynarray_reset(&s1->library_paths, &s1->nb_library_paths);
10279 /* free include paths */
10280 dynarray_reset(&s1->cached_includes, &s1->nb_cached_includes);
10281 dynarray_reset(&s1->include_paths, &s1->nb_include_paths);
10282 dynarray_reset(&s1->sysinclude_paths, &s1->nb_sysinclude_paths);
10284 tcc_free(s1);
10287 int tcc_add_include_path(TCCState *s1, const char *pathname)
10289 char *pathname1;
10291 pathname1 = tcc_strdup(pathname);
10292 dynarray_add((void ***)&s1->include_paths, &s1->nb_include_paths, pathname1);
10293 return 0;
10296 int tcc_add_sysinclude_path(TCCState *s1, const char *pathname)
10298 char *pathname1;
10300 pathname1 = tcc_strdup(pathname);
10301 dynarray_add((void ***)&s1->sysinclude_paths, &s1->nb_sysinclude_paths, pathname1);
10302 return 0;
10305 static int tcc_add_file_internal(TCCState *s1, const char *filename, int flags)
10307 const char *ext;
10308 Elf32_Ehdr ehdr;
10309 int fd, ret;
10310 BufferedFile *saved_file;
10312 /* find source file type with extension */
10313 ext = tcc_fileextension(filename);
10314 if (ext[0])
10315 ext++;
10317 /* open the file */
10318 saved_file = file;
10319 file = tcc_open(s1, filename);
10320 if (!file) {
10321 if (flags & AFF_PRINT_ERROR) {
10322 error_noabort("file '%s' not found", filename);
10324 ret = -1;
10325 goto fail1;
10328 if (flags & AFF_PREPROCESS) {
10329 ret = tcc_preprocess(s1);
10330 } else if (!ext[0] || !strcmp(ext, "c")) {
10331 /* C file assumed */
10332 ret = tcc_compile(s1);
10333 } else
10334 #ifdef CONFIG_TCC_ASM
10335 if (!strcmp(ext, "S")) {
10336 /* preprocessed assembler */
10337 ret = tcc_assemble(s1, 1);
10338 } else if (!strcmp(ext, "s")) {
10339 /* non preprocessed assembler */
10340 ret = tcc_assemble(s1, 0);
10341 } else
10342 #endif
10343 #ifdef TCC_TARGET_PE
10344 if (!strcmp(ext, "def")) {
10345 ret = pe_load_def_file(s1, file->fd);
10346 } else
10347 #endif
10349 fd = file->fd;
10350 /* assume executable format: auto guess file type */
10351 ret = read(fd, &ehdr, sizeof(ehdr));
10352 lseek(fd, 0, SEEK_SET);
10353 if (ret <= 0) {
10354 error_noabort("could not read header");
10355 goto fail;
10356 } else if (ret != sizeof(ehdr)) {
10357 goto try_load_script;
10360 if (ehdr.e_ident[0] == ELFMAG0 &&
10361 ehdr.e_ident[1] == ELFMAG1 &&
10362 ehdr.e_ident[2] == ELFMAG2 &&
10363 ehdr.e_ident[3] == ELFMAG3) {
10364 file->line_num = 0; /* do not display line number if error */
10365 if (ehdr.e_type == ET_REL) {
10366 ret = tcc_load_object_file(s1, fd, 0);
10367 } else if (ehdr.e_type == ET_DYN) {
10368 if (s1->output_type == TCC_OUTPUT_MEMORY) {
10369 #ifdef TCC_TARGET_PE
10370 ret = -1;
10371 #else
10372 void *h;
10373 h = dlopen(filename, RTLD_GLOBAL | RTLD_LAZY);
10374 if (h)
10375 ret = 0;
10376 else
10377 ret = -1;
10378 #endif
10379 } else {
10380 ret = tcc_load_dll(s1, fd, filename,
10381 (flags & AFF_REFERENCED_DLL) != 0);
10383 } else {
10384 error_noabort("unrecognized ELF file");
10385 goto fail;
10387 } else if (memcmp((char *)&ehdr, ARMAG, 8) == 0) {
10388 file->line_num = 0; /* do not display line number if error */
10389 ret = tcc_load_archive(s1, fd);
10390 } else
10391 #ifdef TCC_TARGET_COFF
10392 if (*(uint16_t *)(&ehdr) == COFF_C67_MAGIC) {
10393 ret = tcc_load_coff(s1, fd);
10394 } else
10395 #endif
10396 #ifdef TCC_TARGET_PE
10397 if (pe_test_res_file(&ehdr, ret)) {
10398 ret = pe_load_res_file(s1, fd);
10399 } else
10400 #endif
10402 /* as GNU ld, consider it is an ld script if not recognized */
10403 try_load_script:
10404 ret = tcc_load_ldscript(s1);
10405 if (ret < 0) {
10406 error_noabort("unrecognized file type");
10407 goto fail;
10411 the_end:
10412 tcc_close(file);
10413 fail1:
10414 file = saved_file;
10415 return ret;
10416 fail:
10417 ret = -1;
10418 goto the_end;
10421 int tcc_add_file(TCCState *s, const char *filename)
10423 return tcc_add_file_internal(s, filename, AFF_PRINT_ERROR);
10426 int tcc_add_library_path(TCCState *s, const char *pathname)
10428 char *pathname1;
10430 pathname1 = tcc_strdup(pathname);
10431 dynarray_add((void ***)&s->library_paths, &s->nb_library_paths, pathname1);
10432 return 0;
10435 /* find and load a dll. Return non zero if not found */
10436 /* XXX: add '-rpath' option support ? */
10437 static int tcc_add_dll(TCCState *s, const char *filename, int flags)
10439 char buf[1024];
10440 int i;
10442 for(i = 0; i < s->nb_library_paths; i++) {
10443 snprintf(buf, sizeof(buf), "%s/%s",
10444 s->library_paths[i], filename);
10445 if (tcc_add_file_internal(s, buf, flags) == 0)
10446 return 0;
10448 return -1;
10451 /* the library name is the same as the argument of the '-l' option */
10452 int tcc_add_library(TCCState *s, const char *libraryname)
10454 char buf[1024];
10455 int i;
10457 /* first we look for the dynamic library if not static linking */
10458 if (!s->static_link) {
10459 #ifdef TCC_TARGET_PE
10460 snprintf(buf, sizeof(buf), "%s.def", libraryname);
10461 #else
10462 snprintf(buf, sizeof(buf), "lib%s.so", libraryname);
10463 #endif
10464 if (tcc_add_dll(s, buf, 0) == 0)
10465 return 0;
10468 /* then we look for the static library */
10469 for(i = 0; i < s->nb_library_paths; i++) {
10470 snprintf(buf, sizeof(buf), "%s/lib%s.a",
10471 s->library_paths[i], libraryname);
10472 if (tcc_add_file_internal(s, buf, 0) == 0)
10473 return 0;
10475 return -1;
10478 int tcc_add_symbol(TCCState *s, const char *name, unsigned long val)
10480 add_elf_sym(symtab_section, val, 0,
10481 ELF32_ST_INFO(STB_GLOBAL, STT_NOTYPE), 0,
10482 SHN_ABS, name);
10483 return 0;
10486 int tcc_set_output_type(TCCState *s, int output_type)
10488 char buf[1024];
10490 s->output_type = output_type;
10492 if (!s->nostdinc) {
10493 /* default include paths */
10494 /* XXX: reverse order needed if -isystem support */
10495 #ifndef TCC_TARGET_PE
10496 tcc_add_sysinclude_path(s, CONFIG_SYSROOT "/usr/local/include");
10497 tcc_add_sysinclude_path(s, CONFIG_SYSROOT "/usr/include");
10498 #endif
10499 snprintf(buf, sizeof(buf), "%s/include", tcc_lib_path);
10500 tcc_add_sysinclude_path(s, buf);
10501 #ifdef TCC_TARGET_PE
10502 snprintf(buf, sizeof(buf), "%s/include/winapi", tcc_lib_path);
10503 tcc_add_sysinclude_path(s, buf);
10504 #endif
10507 /* if bound checking, then add corresponding sections */
10508 #ifdef CONFIG_TCC_BCHECK
10509 if (do_bounds_check) {
10510 /* define symbol */
10511 tcc_define_symbol(s, "__BOUNDS_CHECKING_ON", NULL);
10512 /* create bounds sections */
10513 bounds_section = new_section(s, ".bounds",
10514 SHT_PROGBITS, SHF_ALLOC);
10515 lbounds_section = new_section(s, ".lbounds",
10516 SHT_PROGBITS, SHF_ALLOC);
10518 #endif
10520 if (s->char_is_unsigned) {
10521 tcc_define_symbol(s, "__CHAR_UNSIGNED__", NULL);
10524 /* add debug sections */
10525 if (do_debug) {
10526 /* stab symbols */
10527 stab_section = new_section(s, ".stab", SHT_PROGBITS, 0);
10528 stab_section->sh_entsize = sizeof(Stab_Sym);
10529 stabstr_section = new_section(s, ".stabstr", SHT_STRTAB, 0);
10530 put_elf_str(stabstr_section, "");
10531 stab_section->link = stabstr_section;
10532 /* put first entry */
10533 put_stabs("", 0, 0, 0, 0);
10536 /* add libc crt1/crti objects */
10537 #ifndef TCC_TARGET_PE
10538 if ((output_type == TCC_OUTPUT_EXE || output_type == TCC_OUTPUT_DLL) &&
10539 !s->nostdlib) {
10540 if (output_type != TCC_OUTPUT_DLL)
10541 tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crt1.o");
10542 tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crti.o");
10544 #endif
10546 #ifdef TCC_TARGET_PE
10547 snprintf(buf, sizeof(buf), "%s/lib", tcc_lib_path);
10548 tcc_add_library_path(s, buf);
10549 #endif
10551 return 0;
10554 #define WD_ALL 0x0001 /* warning is activated when using -Wall */
10555 #define FD_INVERT 0x0002 /* invert value before storing */
10557 typedef struct FlagDef {
10558 uint16_t offset;
10559 uint16_t flags;
10560 const char *name;
10561 } FlagDef;
10563 static const FlagDef warning_defs[] = {
10564 { offsetof(TCCState, warn_unsupported), 0, "unsupported" },
10565 { offsetof(TCCState, warn_write_strings), 0, "write-strings" },
10566 { offsetof(TCCState, warn_error), 0, "error" },
10567 { offsetof(TCCState, warn_implicit_function_declaration), WD_ALL,
10568 "implicit-function-declaration" },
10571 static int set_flag(TCCState *s, const FlagDef *flags, int nb_flags,
10572 const char *name, int value)
10574 int i;
10575 const FlagDef *p;
10576 const char *r;
10578 r = name;
10579 if (r[0] == 'n' && r[1] == 'o' && r[2] == '-') {
10580 r += 3;
10581 value = !value;
10583 for(i = 0, p = flags; i < nb_flags; i++, p++) {
10584 if (!strcmp(r, p->name))
10585 goto found;
10587 return -1;
10588 found:
10589 if (p->flags & FD_INVERT)
10590 value = !value;
10591 *(int *)((uint8_t *)s + p->offset) = value;
10592 return 0;
10596 /* set/reset a warning */
10597 int tcc_set_warning(TCCState *s, const char *warning_name, int value)
10599 int i;
10600 const FlagDef *p;
10602 if (!strcmp(warning_name, "all")) {
10603 for(i = 0, p = warning_defs; i < countof(warning_defs); i++, p++) {
10604 if (p->flags & WD_ALL)
10605 *(int *)((uint8_t *)s + p->offset) = 1;
10607 return 0;
10608 } else {
10609 return set_flag(s, warning_defs, countof(warning_defs),
10610 warning_name, value);
10614 static const FlagDef flag_defs[] = {
10615 { offsetof(TCCState, char_is_unsigned), 0, "unsigned-char" },
10616 { offsetof(TCCState, char_is_unsigned), FD_INVERT, "signed-char" },
10617 { offsetof(TCCState, nocommon), FD_INVERT, "common" },
10618 { offsetof(TCCState, leading_underscore), 0, "leading-underscore" },
10621 /* set/reset a flag */
10622 int tcc_set_flag(TCCState *s, const char *flag_name, int value)
10624 return set_flag(s, flag_defs, countof(flag_defs),
10625 flag_name, value);
10628 #if !defined(LIBTCC)
10630 static int64_t getclock_us(void)
10632 #ifdef _WIN32
10633 struct _timeb tb;
10634 _ftime(&tb);
10635 return (tb.time * 1000LL + tb.millitm) * 1000LL;
10636 #else
10637 struct timeval tv;
10638 gettimeofday(&tv, NULL);
10639 return tv.tv_sec * 1000000LL + tv.tv_usec;
10640 #endif
10643 void help(void)
10645 printf("tcc version " TCC_VERSION " - Tiny C Compiler - Copyright (C) 2001-2006 Fabrice Bellard\n"
10646 "usage: tcc [-v] [-c] [-o outfile] [-Bdir] [-bench] [-Idir] [-Dsym[=val]] [-Usym]\n"
10647 " [-Wwarn] [-g] [-b] [-bt N] [-Ldir] [-llib] [-shared] [-soname name]\n"
10648 " [-static] [infile1 infile2...] [-run infile args...]\n"
10649 "\n"
10650 "General options:\n"
10651 " -v display current version, increase verbosity\n"
10652 " -c compile only - generate an object file\n"
10653 " -o outfile set output filename\n"
10654 " -Bdir set tcc internal library path\n"
10655 " -bench output compilation statistics\n"
10656 " -run run compiled source\n"
10657 " -fflag set or reset (with 'no-' prefix) 'flag' (see man page)\n"
10658 " -Wwarning set or reset (with 'no-' prefix) 'warning' (see man page)\n"
10659 " -w disable all warnings\n"
10660 "Preprocessor options:\n"
10661 " -E preprocess only\n"
10662 " -Idir add include path 'dir'\n"
10663 " -Dsym[=val] define 'sym' with value 'val'\n"
10664 " -Usym undefine 'sym'\n"
10665 "Linker options:\n"
10666 " -Ldir add library path 'dir'\n"
10667 " -llib link with dynamic or static library 'lib'\n"
10668 " -shared generate a shared library\n"
10669 " -soname set name for shared library to be used at runtime\n"
10670 " -static static linking\n"
10671 " -rdynamic export all global symbols to dynamic linker\n"
10672 " -r generate (relocatable) object file\n"
10673 "Debugger options:\n"
10674 " -g generate runtime debug info\n"
10675 #ifdef CONFIG_TCC_BCHECK
10676 " -b compile with built-in memory and bounds checker (implies -g)\n"
10677 #endif
10678 " -bt N show N callers in stack traces\n"
10682 #define TCC_OPTION_HAS_ARG 0x0001
10683 #define TCC_OPTION_NOSEP 0x0002 /* cannot have space before option and arg */
10685 typedef struct TCCOption {
10686 const char *name;
10687 uint16_t index;
10688 uint16_t flags;
10689 } TCCOption;
10691 enum {
10692 TCC_OPTION_HELP,
10693 TCC_OPTION_I,
10694 TCC_OPTION_D,
10695 TCC_OPTION_U,
10696 TCC_OPTION_L,
10697 TCC_OPTION_B,
10698 TCC_OPTION_l,
10699 TCC_OPTION_bench,
10700 TCC_OPTION_bt,
10701 TCC_OPTION_b,
10702 TCC_OPTION_g,
10703 TCC_OPTION_c,
10704 TCC_OPTION_static,
10705 TCC_OPTION_shared,
10706 TCC_OPTION_soname,
10707 TCC_OPTION_o,
10708 TCC_OPTION_r,
10709 TCC_OPTION_Wl,
10710 TCC_OPTION_W,
10711 TCC_OPTION_O,
10712 TCC_OPTION_m,
10713 TCC_OPTION_f,
10714 TCC_OPTION_nostdinc,
10715 TCC_OPTION_nostdlib,
10716 TCC_OPTION_print_search_dirs,
10717 TCC_OPTION_rdynamic,
10718 TCC_OPTION_run,
10719 TCC_OPTION_v,
10720 TCC_OPTION_w,
10721 TCC_OPTION_pipe,
10722 TCC_OPTION_E,
10725 static const TCCOption tcc_options[] = {
10726 { "h", TCC_OPTION_HELP, 0 },
10727 { "?", TCC_OPTION_HELP, 0 },
10728 { "I", TCC_OPTION_I, TCC_OPTION_HAS_ARG },
10729 { "D", TCC_OPTION_D, TCC_OPTION_HAS_ARG },
10730 { "U", TCC_OPTION_U, TCC_OPTION_HAS_ARG },
10731 { "L", TCC_OPTION_L, TCC_OPTION_HAS_ARG },
10732 { "B", TCC_OPTION_B, TCC_OPTION_HAS_ARG },
10733 { "l", TCC_OPTION_l, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10734 { "bench", TCC_OPTION_bench, 0 },
10735 { "bt", TCC_OPTION_bt, TCC_OPTION_HAS_ARG },
10736 #ifdef CONFIG_TCC_BCHECK
10737 { "b", TCC_OPTION_b, 0 },
10738 #endif
10739 { "g", TCC_OPTION_g, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10740 { "c", TCC_OPTION_c, 0 },
10741 { "static", TCC_OPTION_static, 0 },
10742 { "shared", TCC_OPTION_shared, 0 },
10743 { "soname", TCC_OPTION_soname, TCC_OPTION_HAS_ARG },
10744 { "o", TCC_OPTION_o, TCC_OPTION_HAS_ARG },
10745 { "run", TCC_OPTION_run, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10746 { "rdynamic", TCC_OPTION_rdynamic, 0 },
10747 { "r", TCC_OPTION_r, 0 },
10748 { "Wl,", TCC_OPTION_Wl, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10749 { "W", TCC_OPTION_W, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10750 { "O", TCC_OPTION_O, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10751 { "m", TCC_OPTION_m, TCC_OPTION_HAS_ARG },
10752 { "f", TCC_OPTION_f, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10753 { "nostdinc", TCC_OPTION_nostdinc, 0 },
10754 { "nostdlib", TCC_OPTION_nostdlib, 0 },
10755 { "print-search-dirs", TCC_OPTION_print_search_dirs, 0 },
10756 { "v", TCC_OPTION_v, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10757 { "w", TCC_OPTION_w, 0 },
10758 { "pipe", TCC_OPTION_pipe, 0},
10759 { "E", TCC_OPTION_E, 0},
10760 { NULL },
10763 /* convert 'str' into an array of space separated strings */
10764 static int expand_args(char ***pargv, const char *str)
10766 const char *s1;
10767 char **argv, *arg;
10768 int argc, len;
10770 argc = 0;
10771 argv = NULL;
10772 for(;;) {
10773 while (is_space(*str))
10774 str++;
10775 if (*str == '\0')
10776 break;
10777 s1 = str;
10778 while (*str != '\0' && !is_space(*str))
10779 str++;
10780 len = str - s1;
10781 arg = tcc_malloc(len + 1);
10782 memcpy(arg, s1, len);
10783 arg[len] = '\0';
10784 dynarray_add((void ***)&argv, &argc, arg);
10786 *pargv = argv;
10787 return argc;
10790 static char **files;
10791 static int nb_files, nb_libraries;
10792 static int multiple_files;
10793 static int print_search_dirs;
10794 static int output_type;
10795 static int reloc_output;
10796 static const char *outfile;
10798 int parse_args(TCCState *s, int argc, char **argv)
10800 int optind;
10801 const TCCOption *popt;
10802 const char *optarg, *p1, *r1;
10803 char *r;
10805 optind = 0;
10806 while (optind < argc) {
10808 r = argv[optind++];
10809 if (r[0] != '-' || r[1] == '\0') {
10810 /* add a new file */
10811 dynarray_add((void ***)&files, &nb_files, r);
10812 if (!multiple_files) {
10813 optind--;
10814 /* argv[0] will be this file */
10815 break;
10817 } else {
10818 /* find option in table (match only the first chars */
10819 popt = tcc_options;
10820 for(;;) {
10821 p1 = popt->name;
10822 if (p1 == NULL)
10823 error("invalid option -- '%s'", r);
10824 r1 = r + 1;
10825 for(;;) {
10826 if (*p1 == '\0')
10827 goto option_found;
10828 if (*r1 != *p1)
10829 break;
10830 p1++;
10831 r1++;
10833 popt++;
10835 option_found:
10836 if (popt->flags & TCC_OPTION_HAS_ARG) {
10837 if (*r1 != '\0' || (popt->flags & TCC_OPTION_NOSEP)) {
10838 optarg = r1;
10839 } else {
10840 if (optind >= argc)
10841 error("argument to '%s' is missing", r);
10842 optarg = argv[optind++];
10844 } else {
10845 if (*r1 != '\0')
10846 return 0;
10847 optarg = NULL;
10850 switch(popt->index) {
10851 case TCC_OPTION_HELP:
10852 return 0;
10854 case TCC_OPTION_I:
10855 if (tcc_add_include_path(s, optarg) < 0)
10856 error("too many include paths");
10857 break;
10858 case TCC_OPTION_D:
10860 char *sym, *value;
10861 sym = (char *)optarg;
10862 value = strchr(sym, '=');
10863 if (value) {
10864 *value = '\0';
10865 value++;
10867 tcc_define_symbol(s, sym, value);
10869 break;
10870 case TCC_OPTION_U:
10871 tcc_undefine_symbol(s, optarg);
10872 break;
10873 case TCC_OPTION_L:
10874 tcc_add_library_path(s, optarg);
10875 break;
10876 case TCC_OPTION_B:
10877 /* set tcc utilities path (mainly for tcc development) */
10878 tcc_lib_path = optarg;
10879 break;
10880 case TCC_OPTION_l:
10881 dynarray_add((void ***)&files, &nb_files, r);
10882 nb_libraries++;
10883 break;
10884 case TCC_OPTION_bench:
10885 do_bench = 1;
10886 break;
10887 case TCC_OPTION_bt:
10888 num_callers = atoi(optarg);
10889 break;
10890 #ifdef CONFIG_TCC_BCHECK
10891 case TCC_OPTION_b:
10892 do_bounds_check = 1;
10893 do_debug = 1;
10894 break;
10895 #endif
10896 case TCC_OPTION_g:
10897 do_debug = 1;
10898 break;
10899 case TCC_OPTION_c:
10900 multiple_files = 1;
10901 output_type = TCC_OUTPUT_OBJ;
10902 break;
10903 case TCC_OPTION_static:
10904 s->static_link = 1;
10905 break;
10906 case TCC_OPTION_shared:
10907 output_type = TCC_OUTPUT_DLL;
10908 break;
10909 case TCC_OPTION_soname:
10910 s->soname = optarg;
10911 break;
10912 case TCC_OPTION_o:
10913 multiple_files = 1;
10914 outfile = optarg;
10915 break;
10916 case TCC_OPTION_r:
10917 /* generate a .o merging several output files */
10918 reloc_output = 1;
10919 output_type = TCC_OUTPUT_OBJ;
10920 break;
10921 case TCC_OPTION_nostdinc:
10922 s->nostdinc = 1;
10923 break;
10924 case TCC_OPTION_nostdlib:
10925 s->nostdlib = 1;
10926 break;
10927 case TCC_OPTION_print_search_dirs:
10928 print_search_dirs = 1;
10929 break;
10930 case TCC_OPTION_run:
10932 int argc1;
10933 char **argv1;
10934 argc1 = expand_args(&argv1, optarg);
10935 if (argc1 > 0) {
10936 parse_args(s, argc1, argv1);
10938 multiple_files = 0;
10939 output_type = TCC_OUTPUT_MEMORY;
10941 break;
10942 case TCC_OPTION_v:
10943 do {
10944 if (0 == verbose++)
10945 printf("tcc version %s\n", TCC_VERSION);
10946 } while (*optarg++ == 'v');
10947 break;
10948 case TCC_OPTION_f:
10949 if (tcc_set_flag(s, optarg, 1) < 0 && s->warn_unsupported)
10950 goto unsupported_option;
10951 break;
10952 case TCC_OPTION_W:
10953 if (tcc_set_warning(s, optarg, 1) < 0 &&
10954 s->warn_unsupported)
10955 goto unsupported_option;
10956 break;
10957 case TCC_OPTION_w:
10958 s->warn_none = 1;
10959 break;
10960 case TCC_OPTION_rdynamic:
10961 s->rdynamic = 1;
10962 break;
10963 case TCC_OPTION_Wl:
10965 const char *p;
10966 if (strstart(optarg, "-Ttext,", &p)) {
10967 s->text_addr = strtoul(p, NULL, 16);
10968 s->has_text_addr = 1;
10969 } else if (strstart(optarg, "--oformat,", &p)) {
10970 if (strstart(p, "elf32-", NULL)) {
10971 s->output_format = TCC_OUTPUT_FORMAT_ELF;
10972 } else if (!strcmp(p, "binary")) {
10973 s->output_format = TCC_OUTPUT_FORMAT_BINARY;
10974 } else
10975 #ifdef TCC_TARGET_COFF
10976 if (!strcmp(p, "coff")) {
10977 s->output_format = TCC_OUTPUT_FORMAT_COFF;
10978 } else
10979 #endif
10981 error("target %s not found", p);
10983 } else {
10984 error("unsupported linker option '%s'", optarg);
10987 break;
10988 case TCC_OPTION_E:
10989 output_type = TCC_OUTPUT_PREPROCESS;
10990 break;
10991 default:
10992 if (s->warn_unsupported) {
10993 unsupported_option:
10994 warning("unsupported option '%s'", r);
10996 break;
11000 return optind + 1;
11003 int main(int argc, char **argv)
11005 int i;
11006 TCCState *s;
11007 int nb_objfiles, ret, optind;
11008 char objfilename[1024];
11009 int64_t start_time = 0;
11011 #ifdef _WIN32
11012 tcc_lib_path = w32_tcc_lib_path();
11013 #endif
11015 s = tcc_new();
11016 output_type = TCC_OUTPUT_EXE;
11017 outfile = NULL;
11018 multiple_files = 1;
11019 files = NULL;
11020 nb_files = 0;
11021 nb_libraries = 0;
11022 reloc_output = 0;
11023 print_search_dirs = 0;
11024 ret = 0;
11026 optind = parse_args(s, argc - 1, argv + 1);
11027 if (print_search_dirs) {
11028 /* enough for Linux kernel */
11029 printf("install: %s/\n", tcc_lib_path);
11030 return 0;
11032 if (optind == 0 || nb_files == 0) {
11033 if (optind && verbose)
11034 return 0;
11035 help();
11036 return 1;
11039 nb_objfiles = nb_files - nb_libraries;
11041 /* if outfile provided without other options, we output an
11042 executable */
11043 if (outfile && output_type == TCC_OUTPUT_MEMORY)
11044 output_type = TCC_OUTPUT_EXE;
11046 /* check -c consistency : only single file handled. XXX: checks file type */
11047 if (output_type == TCC_OUTPUT_OBJ && !reloc_output) {
11048 /* accepts only a single input file */
11049 if (nb_objfiles != 1)
11050 error("cannot specify multiple files with -c");
11051 if (nb_libraries != 0)
11052 error("cannot specify libraries with -c");
11056 if (output_type == TCC_OUTPUT_PREPROCESS) {
11057 if (!outfile) {
11058 s->outfile = stdout;
11059 } else {
11060 s->outfile = fopen(outfile, "w");
11061 if (!s->outfile)
11062 error("could not open '%s", outfile);
11064 } else if (output_type != TCC_OUTPUT_MEMORY) {
11065 if (!outfile) {
11066 /* compute default outfile name */
11067 char *ext;
11068 const char *name =
11069 strcmp(files[0], "-") == 0 ? "a" : tcc_basename(files[0]);
11070 pstrcpy(objfilename, sizeof(objfilename), name);
11071 ext = tcc_fileextension(objfilename);
11072 #ifdef TCC_TARGET_PE
11073 if (output_type == TCC_OUTPUT_DLL)
11074 strcpy(ext, ".dll");
11075 else
11076 if (output_type == TCC_OUTPUT_EXE)
11077 strcpy(ext, ".exe");
11078 else
11079 #endif
11080 if (output_type == TCC_OUTPUT_OBJ && !reloc_output && *ext)
11081 strcpy(ext, ".o");
11082 else
11083 pstrcpy(objfilename, sizeof(objfilename), "a.out");
11084 outfile = objfilename;
11088 if (do_bench) {
11089 start_time = getclock_us();
11092 tcc_set_output_type(s, output_type);
11094 /* compile or add each files or library */
11095 for(i = 0; i < nb_files && ret == 0; i++) {
11096 const char *filename;
11098 filename = files[i];
11099 if (output_type == TCC_OUTPUT_PREPROCESS) {
11100 if (tcc_add_file_internal(s, filename,
11101 AFF_PRINT_ERROR | AFF_PREPROCESS) < 0)
11102 ret = 1;
11103 } else if (filename[0] == '-' && filename[1]) {
11104 if (tcc_add_library(s, filename + 2) < 0)
11105 error("cannot find %s", filename);
11106 } else {
11107 if (1 == verbose)
11108 printf("-> %s\n", filename);
11109 if (tcc_add_file(s, filename) < 0)
11110 ret = 1;
11114 /* free all files */
11115 tcc_free(files);
11117 if (ret)
11118 goto the_end;
11120 if (do_bench) {
11121 double total_time;
11122 total_time = (double)(getclock_us() - start_time) / 1000000.0;
11123 if (total_time < 0.001)
11124 total_time = 0.001;
11125 if (total_bytes < 1)
11126 total_bytes = 1;
11127 printf("%d idents, %d lines, %d bytes, %0.3f s, %d lines/s, %0.1f MB/s\n",
11128 tok_ident - TOK_IDENT, total_lines, total_bytes,
11129 total_time, (int)(total_lines / total_time),
11130 total_bytes / total_time / 1000000.0);
11133 if (s->output_type == TCC_OUTPUT_PREPROCESS) {
11134 if (outfile)
11135 fclose(s->outfile);
11136 } else if (s->output_type == TCC_OUTPUT_MEMORY) {
11137 ret = tcc_run(s, argc - optind, argv + optind);
11138 } else
11139 ret = tcc_output_file(s, outfile) ? 1 : 0;
11140 the_end:
11141 /* XXX: cannot do it with bound checking because of the malloc hooks */
11142 if (!do_bounds_check)
11143 tcc_delete(s);
11145 #ifdef MEM_DEBUG
11146 if (do_bench) {
11147 printf("memory: %d bytes, max = %d bytes\n", mem_cur_size, mem_max_size);
11149 #endif
11150 return ret;
11153 #endif