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