?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Remove multiple definition error caused by combination of x86-64 and va_list.
[tinycc/miki.git] / tcc.c
blobf707791ce9a1360384b8a12c690f2b6a5ef16237
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 #ifndef TCC_TARGET_X86_64
4806 if ((p->r & VT_LVAL) ||
4807 (!is_float(type->t) && (type->t & VT_BTYPE) != VT_LLONG))
4808 type = &int_type;
4809 #else
4810 if (p->r & VT_LVAL)
4811 type = &char_pointer_type;
4812 #endif
4813 size = type_size(type, &align);
4814 loc = (loc - size) & -align;
4815 sv.type.t = type->t;
4816 sv.r = VT_LOCAL | VT_LVAL;
4817 sv.c.ul = loc;
4818 store(r, &sv);
4819 #if defined(TCC_TARGET_I386) || defined(TCC_TARGET_X86_64)
4820 /* x86 specific: need to pop fp register ST0 if saved */
4821 if (r == TREG_ST0) {
4822 o(0xd9dd); /* fstp %st(1) */
4823 }
4824 #endif
4825 #ifndef TCC_TARGET_X86_64
4826 /* special long long case */
4827 if ((type->t & VT_BTYPE) == VT_LLONG) {
4828 sv.c.ul += 4;
4829 store(p->r2, &sv);
4830 }
4831 #endif
4832 l = loc;
4833 saved = 1;
4834 }
4835 /* mark that stack entry as being saved on the stack */
4836 if (p->r & VT_LVAL) {
4837 /* also clear the bounded flag because the
4838 relocation address of the function was stored in
4839 p->c.ul */
4840 p->r = (p->r & ~(VT_VALMASK | VT_BOUNDED)) | VT_LLOCAL;
4841 } else {
4842 p->r = lvalue_type(p->type.t) | VT_LOCAL;
4843 }
4844 p->r2 = VT_CONST;
4845 p->c.ul = l;
4846 }
4847 }
4848 }
4849
4850 /* find a register of class 'rc2' with at most one reference on stack.
4851 * If none, call get_reg(rc) */
4852 int get_reg_ex(int rc, int rc2)
4853 {
4854 int r;
4855 SValue *p;
4856
4857 for(r=0;r<NB_REGS;r++) {
4858 if (reg_classes[r] & rc2) {
4859 int n;
4860 n=0;
4861 for(p = vstack; p <= vtop; p++) {
4862 if ((p->r & VT_VALMASK) == r ||
4863 (p->r2 & VT_VALMASK) == r)
4864 n++;
4865 }
4866 if (n <= 1)
4867 return r;
4868 }
4869 }
4870 return get_reg(rc);
4871 }
4872
4873 /* find a free register of class 'rc'. If none, save one register */
4874 int get_reg(int rc)
4875 {
4876 int r;
4877 SValue *p;
4878
4879 /* find a free register */
4880 for(r=0;r<NB_REGS;r++) {
4881 if (reg_classes[r] & rc) {
4882 for(p=vstack;p<=vtop;p++) {
4883 if ((p->r & VT_VALMASK) == r ||
4884 (p->r2 & VT_VALMASK) == r)
4885 goto notfound;
4886 }
4887 return r;
4888 }
4889 notfound: ;
4890 }
4891
4892 /* no register left : free the first one on the stack (VERY
4893 IMPORTANT to start from the bottom to ensure that we don't
4894 spill registers used in gen_opi()) */
4895 for(p=vstack;p<=vtop;p++) {
4896 r = p->r & VT_VALMASK;
4897 if (r < VT_CONST && (reg_classes[r] & rc))
4898 goto save_found;
4899 /* also look at second register (if long long) */
4900 r = p->r2 & VT_VALMASK;
4901 if (r < VT_CONST && (reg_classes[r] & rc)) {
4902 save_found:
4903 save_reg(r);
4904 return r;
4905 }
4906 }
4907 /* Should never comes here */
4908 return -1;
4909 }
4910
4911 /* save registers up to (vtop - n) stack entry */
4912 void save_regs(int n)
4913 {
4914 int r;
4915 SValue *p, *p1;
4916 p1 = vtop - n;
4917 for(p = vstack;p <= p1; p++) {
4918 r = p->r & VT_VALMASK;
4919 if (r < VT_CONST) {
4920 save_reg(r);
4921 }
4922 }
4923 }
4924
4925 /* move register 's' to 'r', and flush previous value of r to memory
4926 if needed */
4927 void move_reg(int r, int s)
4928 {
4929 SValue sv;
4930
4931 if (r != s) {
4932 save_reg(r);
4933 sv.type.t = VT_INT;
4934 sv.r = s;
4935 sv.c.ul = 0;
4936 load(r, &sv);
4937 }
4938 }
4939
4940 /* get address of vtop (vtop MUST BE an lvalue) */
4941 void gaddrof(void)
4942 {
4943 vtop->r &= ~VT_LVAL;
4944 /* tricky: if saved lvalue, then we can go back to lvalue */
4945 if ((vtop->r & VT_VALMASK) == VT_LLOCAL)
4946 vtop->r = (vtop->r & ~(VT_VALMASK | VT_LVAL_TYPE)) | VT_LOCAL | VT_LVAL;
4947 }
4948
4949 #ifdef CONFIG_TCC_BCHECK
4950 /* generate lvalue bound code */
4951 void gbound(void)
4952 {
4953 int lval_type;
4954 CType type1;
4955
4956 vtop->r &= ~VT_MUSTBOUND;
4957 /* if lvalue, then use checking code before dereferencing */
4958 if (vtop->r & VT_LVAL) {
4959 /* if not VT_BOUNDED value, then make one */
4960 if (!(vtop->r & VT_BOUNDED)) {
4961 lval_type = vtop->r & (VT_LVAL_TYPE | VT_LVAL);
4962 /* must save type because we must set it to int to get pointer */
4963 type1 = vtop->type;
4964 vtop->type.t = VT_INT;
4965 gaddrof();
4966 vpushi(0);
4967 gen_bounded_ptr_add();
4968 vtop->r |= lval_type;
4969 vtop->type = type1;
4970 }
4971 /* then check for dereferencing */
4972 gen_bounded_ptr_deref();
4973 }
4974 }
4975 #endif
4976
4977 /* store vtop a register belonging to class 'rc'. lvalues are
4978 converted to values. Cannot be used if cannot be converted to
4979 register value (such as structures). */
4980 int gv(int rc)
4981 {
4982 int r, rc2, bit_pos, bit_size, size, align, i;
4983
4984 /* NOTE: get_reg can modify vstack[] */
4985 if (vtop->type.t & VT_BITFIELD) {
4986 CType type;
4987 int bits = 32;
4988 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
4989 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
4990 /* remove bit field info to avoid loops */
4991 vtop->type.t &= ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT));
4992 /* cast to int to propagate signedness in following ops */
4993 if ((vtop->type.t & VT_BTYPE) == VT_LLONG) {
4994 type.t = VT_LLONG;
4995 bits = 64;
4996 } else
4997 type.t = VT_INT;
4998 if((vtop->type.t & VT_UNSIGNED) ||
4999 (vtop->type.t & VT_BTYPE) == VT_BOOL)
5000 type.t |= VT_UNSIGNED;
5001 gen_cast(&type);
5002 /* generate shifts */
5003 vpushi(bits - (bit_pos + bit_size));
5004 gen_op(TOK_SHL);
5005 vpushi(bits - bit_size);
5006 /* NOTE: transformed to SHR if unsigned */
5007 gen_op(TOK_SAR);
5008 r = gv(rc);
5009 } else {
5010 if (is_float(vtop->type.t) &&
5011 (vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
5012 Sym *sym;
5013 int *ptr;
5014 unsigned long offset;
5015 #if defined(TCC_TARGET_ARM) && !defined(TCC_ARM_VFP)
5016 CValue check;
5017 #endif
5018
5019 /* XXX: unify with initializers handling ? */
5020 /* CPUs usually cannot use float constants, so we store them
5021 generically in data segment */
5022 size = type_size(&vtop->type, &align);
5023 offset = (data_section->data_offset + align - 1) & -align;
5024 data_section->data_offset = offset;
5025 /* XXX: not portable yet */
5026 #if defined(__i386__) || defined(__x86_64__)
5027 /* Zero pad x87 tenbyte long doubles */
5028 if (size == LDOUBLE_SIZE)
5029 vtop->c.tab[2] &= 0xffff;
5030 #endif
5031 ptr = section_ptr_add(data_section, size);
5032 size = size >> 2;
5033 #if defined(TCC_TARGET_ARM) && !defined(TCC_ARM_VFP)
5034 check.d = 1;
5035 if(check.tab[0])
5036 for(i=0;i<size;i++)
5037 ptr[i] = vtop->c.tab[size-1-i];
5038 else
5039 #endif
5040 for(i=0;i<size;i++)
5041 ptr[i] = vtop->c.tab[i];
5042 sym = get_sym_ref(&vtop->type, data_section, offset, size << 2);
5043 vtop->r |= VT_LVAL | VT_SYM;
5044 vtop->sym = sym;
5045 vtop->c.ul = 0;
5046 }
5047 #ifdef CONFIG_TCC_BCHECK
5048 if (vtop->r & VT_MUSTBOUND)
5049 gbound();
5050 #endif
5051
5052 r = vtop->r & VT_VALMASK;
5053 rc2 = RC_INT;
5054 if (rc == RC_IRET)
5055 rc2 = RC_LRET;
5056 /* need to reload if:
5057 - constant
5058 - lvalue (need to dereference pointer)
5059 - already a register, but not in the right class */
5060 if (r >= VT_CONST ||
5061 (vtop->r & VT_LVAL) ||
5062 !(reg_classes[r] & rc) ||
5063 ((vtop->type.t & VT_BTYPE) == VT_LLONG &&
5064 !(reg_classes[vtop->r2] & rc2))) {
5065 r = get_reg(rc);
5066 #ifndef TCC_TARGET_X86_64
5067 if ((vtop->type.t & VT_BTYPE) == VT_LLONG) {
5068 int r2;
5069 unsigned long long ll;
5070 /* two register type load : expand to two words
5071 temporarily */
5072 if ((vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
5073 /* load constant */
5074 ll = vtop->c.ull;
5075 vtop->c.ui = ll; /* first word */
5076 load(r, vtop);
5077 vtop->r = r; /* save register value */
5078 vpushi(ll >> 32); /* second word */
5079 } else if (r >= VT_CONST || /* XXX: test to VT_CONST incorrect ? */
5080 (vtop->r & VT_LVAL)) {
5081 /* We do not want to modifier the long long
5082 pointer here, so the safest (and less
5083 efficient) is to save all the other registers
5084 in the stack. XXX: totally inefficient. */
5085 save_regs(1);
5086 /* load from memory */
5087 load(r, vtop);
5088 vdup();
5089 vtop[-1].r = r; /* save register value */
5090 /* increment pointer to get second word */
5091 vtop->type.t = VT_INT;
5092 gaddrof();
5093 vpushi(4);
5094 gen_op('+');
5095 vtop->r |= VT_LVAL;
5096 } else {
5097 /* move registers */
5098 load(r, vtop);
5099 vdup();
5100 vtop[-1].r = r; /* save register value */
5101 vtop->r = vtop[-1].r2;
5102 }
5103 /* allocate second register */
5104 r2 = get_reg(rc2);
5105 load(r2, vtop);
5106 vpop();
5107 /* write second register */
5108 vtop->r2 = r2;
5109 } else
5110 #endif
5111 if ((vtop->r & VT_LVAL) && !is_float(vtop->type.t)) {
5112 int t1, t;
5113 /* lvalue of scalar type : need to use lvalue type
5114 because of possible cast */
5115 t = vtop->type.t;
5116 t1 = t;
5117 /* compute memory access type */
5118 if (vtop->r & VT_LVAL_BYTE)
5119 t = VT_BYTE;
5120 else if (vtop->r & VT_LVAL_SHORT)
5121 t = VT_SHORT;
5122 if (vtop->r & VT_LVAL_UNSIGNED)
5123 t |= VT_UNSIGNED;
5124 vtop->type.t = t;
5125 load(r, vtop);
5126 /* restore wanted type */
5127 vtop->type.t = t1;
5128 } else {
5129 /* one register type load */
5130 load(r, vtop);
5131 }
5132 }
5133 vtop->r = r;
5134 #ifdef TCC_TARGET_C67
5135 /* uses register pairs for doubles */
5136 if ((vtop->type.t & VT_BTYPE) == VT_DOUBLE)
5137 vtop->r2 = r+1;
5138 #endif
5139 }
5140 return r;
5141 }
5142
5143 /* generate vtop[-1] and vtop[0] in resp. classes rc1 and rc2 */
5144 void gv2(int rc1, int rc2)
5145 {
5146 int v;
5147
5148 /* generate more generic register first. But VT_JMP or VT_CMP
5149 values must be generated first in all cases to avoid possible
5150 reload errors */
5151 v = vtop[0].r & VT_VALMASK;
5152 if (v != VT_CMP && (v & ~1) != VT_JMP && rc1 <= rc2) {
5153 vswap();
5154 gv(rc1);
5155 vswap();
5156 gv(rc2);
5157 /* test if reload is needed for first register */
5158 if ((vtop[-1].r & VT_VALMASK) >= VT_CONST) {
5159 vswap();
5160 gv(rc1);
5161 vswap();
5162 }
5163 } else {
5164 gv(rc2);
5165 vswap();
5166 gv(rc1);
5167 vswap();
5168 /* test if reload is needed for first register */
5169 if ((vtop[0].r & VT_VALMASK) >= VT_CONST) {
5170 gv(rc2);
5171 }
5172 }
5173 }
5174
5175 /* expand long long on stack in two int registers */
5176 void lexpand(void)
5177 {
5178 int u;
5179
5180 u = vtop->type.t & VT_UNSIGNED;
5181 gv(RC_INT);
5182 vdup();
5183 vtop[0].r = vtop[-1].r2;
5184 vtop[0].r2 = VT_CONST;
5185 vtop[-1].r2 = VT_CONST;
5186 vtop[0].type.t = VT_INT | u;
5187 vtop[-1].type.t = VT_INT | u;
5188 }
5189
5190 #ifdef TCC_TARGET_ARM
5191 /* expand long long on stack */
5192 void lexpand_nr(void)
5193 {
5194 int u,v;
5195
5196 u = vtop->type.t & VT_UNSIGNED;
5197 vdup();
5198 vtop->r2 = VT_CONST;
5199 vtop->type.t = VT_INT | u;
5200 v=vtop[-1].r & (VT_VALMASK | VT_LVAL);
5201 if (v == VT_CONST) {
5202 vtop[-1].c.ui = vtop->c.ull;
5203 vtop->c.ui = vtop->c.ull >> 32;
5204 vtop->r = VT_CONST;
5205 } else if (v == (VT_LVAL|VT_CONST) || v == (VT_LVAL|VT_LOCAL)) {
5206 vtop->c.ui += 4;
5207 vtop->r = vtop[-1].r;
5208 } else if (v > VT_CONST) {
5209 vtop--;
5210 lexpand();
5211 } else
5212 vtop->r = vtop[-1].r2;
5213 vtop[-1].r2 = VT_CONST;
5214 vtop[-1].type.t = VT_INT | u;
5215 }
5216 #endif
5217
5218 /* build a long long from two ints */
5219 void lbuild(int t)
5220 {
5221 gv2(RC_INT, RC_INT);
5222 vtop[-1].r2 = vtop[0].r;
5223 vtop[-1].type.t = t;
5224 vpop();
5225 }
5226
5227 /* rotate n first stack elements to the bottom
5228 I1 ... In -> I2 ... In I1 [top is right]
5229 */
5230 void vrotb(int n)
5231 {
5232 int i;
5233 SValue tmp;
5234
5235 tmp = vtop[-n + 1];
5236 for(i=-n+1;i!=0;i++)
5237 vtop[i] = vtop[i+1];
5238 vtop[0] = tmp;
5239 }
5240
5241 /* rotate n first stack elements to the top
5242 I1 ... In -> In I1 ... I(n-1) [top is right]
5243 */
5244 void vrott(int n)
5245 {
5246 int i;
5247 SValue tmp;
5248
5249 tmp = vtop[0];
5250 for(i = 0;i < n - 1; i++)
5251 vtop[-i] = vtop[-i - 1];
5252 vtop[-n + 1] = tmp;
5253 }
5254
5255 #ifdef TCC_TARGET_ARM
5256 /* like vrott but in other direction
5257 In ... I1 -> I(n-1) ... I1 In [top is right]
5258 */
5259 void vnrott(int n)
5260 {
5261 int i;
5262 SValue tmp;
5263
5264 tmp = vtop[-n + 1];
5265 for(i = n - 1; i > 0; i--)
5266 vtop[-i] = vtop[-i + 1];
5267 vtop[0] = tmp;
5268 }
5269 #endif
5270
5271 /* pop stack value */
5272 void vpop(void)
5273 {
5274 int v;
5275 v = vtop->r & VT_VALMASK;
5276 #if defined(TCC_TARGET_I386) || defined(TCC_TARGET_X86_64)
5277 /* for x86, we need to pop the FP stack */
5278 if (v == TREG_ST0 && !nocode_wanted) {
5279 o(0xd9dd); /* fstp %st(1) */
5280 } else
5281 #endif
5282 if (v == VT_JMP || v == VT_JMPI) {
5283 /* need to put correct jump if && or || without test */
5284 gsym(vtop->c.ul);
5285 }
5286 vtop--;
5287 }
5288
5289 /* convert stack entry to register and duplicate its value in another
5290 register */
5291 void gv_dup(void)
5292 {
5293 int rc, t, r, r1;
5294 SValue sv;
5295
5296 t = vtop->type.t;
5297 if ((t & VT_BTYPE) == VT_LLONG) {
5298 lexpand();
5299 gv_dup();
5300 vswap();
5301 vrotb(3);
5302 gv_dup();
5303 vrotb(4);
5304 /* stack: H L L1 H1 */
5305 lbuild(t);
5306 vrotb(3);
5307 vrotb(3);
5308 vswap();
5309 lbuild(t);
5310 vswap();
5311 } else {
5312 /* duplicate value */
5313 rc = RC_INT;
5314 sv.type.t = VT_INT;
5315 if (is_float(t)) {
5316 rc = RC_FLOAT;
5317 #ifdef TCC_TARGET_X86_64
5318 if ((t & VT_BTYPE) == VT_LDOUBLE) {
5319 rc = RC_ST0;
5320 }
5321 #endif
5322 sv.type.t = t;
5323 }
5324 r = gv(rc);
5325 r1 = get_reg(rc);
5326 sv.r = r;
5327 sv.c.ul = 0;
5328 load(r1, &sv); /* move r to r1 */
5329 vdup();
5330 /* duplicates value */
5331 vtop->r = r1;
5332 }
5333 }
5334
5335 #ifndef TCC_TARGET_X86_64
5336 /* generate CPU independent (unsigned) long long operations */
5337 void gen_opl(int op)
5338 {
5339 int t, a, b, op1, c, i;
5340 int func;
5341 unsigned short reg_iret = REG_IRET;
5342 unsigned short reg_lret = REG_LRET;
5343 SValue tmp;
5344
5345 switch(op) {
5346 case '/':
5347 case TOK_PDIV:
5348 func = TOK___divdi3;
5349 goto gen_func;
5350 case TOK_UDIV:
5351 func = TOK___udivdi3;
5352 goto gen_func;
5353 case '%':
5354 func = TOK___moddi3;
5355 goto gen_mod_func;
5356 case TOK_UMOD:
5357 func = TOK___umoddi3;
5358 gen_mod_func:
5359 #ifdef TCC_ARM_EABI
5360 reg_iret = TREG_R2;
5361 reg_lret = TREG_R3;
5362 #endif
5363 gen_func:
5364 /* call generic long long function */
5365 vpush_global_sym(&func_old_type, func);
5366 vrott(3);
5367 gfunc_call(2);
5368 vpushi(0);
5369 vtop->r = reg_iret;
5370 vtop->r2 = reg_lret;
5371 break;
5372 case '^':
5373 case '&':
5374 case '|':
5375 case '*':
5376 case '+':
5377 case '-':
5378 t = vtop->type.t;
5379 vswap();
5380 lexpand();
5381 vrotb(3);
5382 lexpand();
5383 /* stack: L1 H1 L2 H2 */
5384 tmp = vtop[0];
5385 vtop[0] = vtop[-3];
5386 vtop[-3] = tmp;
5387 tmp = vtop[-2];
5388 vtop[-2] = vtop[-3];
5389 vtop[-3] = tmp;
5390 vswap();
5391 /* stack: H1 H2 L1 L2 */
5392 if (op == '*') {
5393 vpushv(vtop - 1);
5394 vpushv(vtop - 1);
5395 gen_op(TOK_UMULL);
5396 lexpand();
5397 /* stack: H1 H2 L1 L2 ML MH */
5398 for(i=0;i<4;i++)
5399 vrotb(6);
5400 /* stack: ML MH H1 H2 L1 L2 */
5401 tmp = vtop[0];
5402 vtop[0] = vtop[-2];
5403 vtop[-2] = tmp;
5404 /* stack: ML MH H1 L2 H2 L1 */
5405 gen_op('*');
5406 vrotb(3);
5407 vrotb(3);
5408 gen_op('*');
5409 /* stack: ML MH M1 M2 */
5410 gen_op('+');
5411 gen_op('+');
5412 } else if (op == '+' || op == '-') {
5413 /* XXX: add non carry method too (for MIPS or alpha) */
5414 if (op == '+')
5415 op1 = TOK_ADDC1;
5416 else
5417 op1 = TOK_SUBC1;
5418 gen_op(op1);
5419 /* stack: H1 H2 (L1 op L2) */
5420 vrotb(3);
5421 vrotb(3);
5422 gen_op(op1 + 1); /* TOK_xxxC2 */
5423 } else {
5424 gen_op(op);
5425 /* stack: H1 H2 (L1 op L2) */
5426 vrotb(3);
5427 vrotb(3);
5428 /* stack: (L1 op L2) H1 H2 */
5429 gen_op(op);
5430 /* stack: (L1 op L2) (H1 op H2) */
5431 }
5432 /* stack: L H */
5433 lbuild(t);
5434 break;
5435 case TOK_SAR:
5436 case TOK_SHR:
5437 case TOK_SHL:
5438 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
5439 t = vtop[-1].type.t;
5440 vswap();
5441 lexpand();
5442 vrotb(3);
5443 /* stack: L H shift */
5444 c = (int)vtop->c.i;
5445 /* constant: simpler */
5446 /* NOTE: all comments are for SHL. the other cases are
5447 done by swaping words */
5448 vpop();
5449 if (op != TOK_SHL)
5450 vswap();
5451 if (c >= 32) {
5452 /* stack: L H */
5453 vpop();
5454 if (c > 32) {
5455 vpushi(c - 32);
5456 gen_op(op);
5457 }
5458 if (op != TOK_SAR) {
5459 vpushi(0);
5460 } else {
5461 gv_dup();
5462 vpushi(31);
5463 gen_op(TOK_SAR);
5464 }
5465 vswap();
5466 } else {
5467 vswap();
5468 gv_dup();
5469 /* stack: H L L */
5470 vpushi(c);
5471 gen_op(op);
5472 vswap();
5473 vpushi(32 - c);
5474 if (op == TOK_SHL)
5475 gen_op(TOK_SHR);
5476 else
5477 gen_op(TOK_SHL);
5478 vrotb(3);
5479 /* stack: L L H */
5480 vpushi(c);
5481 if (op == TOK_SHL)
5482 gen_op(TOK_SHL);
5483 else
5484 gen_op(TOK_SHR);
5485 gen_op('|');
5486 }
5487 if (op != TOK_SHL)
5488 vswap();
5489 lbuild(t);
5490 } else {
5491 /* XXX: should provide a faster fallback on x86 ? */
5492 switch(op) {
5493 case TOK_SAR:
5494 func = TOK___ashrdi3;
5495 goto gen_func;
5496 case TOK_SHR:
5497 func = TOK___lshrdi3;
5498 goto gen_func;
5499 case TOK_SHL:
5500 func = TOK___ashldi3;
5501 goto gen_func;
5502 }
5503 }
5504 break;
5505 default:
5506 /* compare operations */
5507 t = vtop->type.t;
5508 vswap();
5509 lexpand();
5510 vrotb(3);
5511 lexpand();
5512 /* stack: L1 H1 L2 H2 */
5513 tmp = vtop[-1];
5514 vtop[-1] = vtop[-2];
5515 vtop[-2] = tmp;
5516 /* stack: L1 L2 H1 H2 */
5517 /* compare high */
5518 op1 = op;
5519 /* when values are equal, we need to compare low words. since
5520 the jump is inverted, we invert the test too. */
5521 if (op1 == TOK_LT)
5522 op1 = TOK_LE;
5523 else if (op1 == TOK_GT)
5524 op1 = TOK_GE;
5525 else if (op1 == TOK_ULT)
5526 op1 = TOK_ULE;
5527 else if (op1 == TOK_UGT)
5528 op1 = TOK_UGE;
5529 a = 0;
5530 b = 0;
5531 gen_op(op1);
5532 if (op1 != TOK_NE) {
5533 a = gtst(1, 0);
5534 }
5535 if (op != TOK_EQ) {
5536 /* generate non equal test */
5537 /* XXX: NOT PORTABLE yet */
5538 if (a == 0) {
5539 b = gtst(0, 0);
5540 } else {
5541 #if defined(TCC_TARGET_I386)
5542 b = psym(0x850f, 0);
5543 #elif defined(TCC_TARGET_ARM)
5544 b = ind;
5545 o(0x1A000000 | encbranch(ind, 0, 1));
5546 #elif defined(TCC_TARGET_C67)
5547 error("not implemented");
5548 #else
5549 #error not supported
5550 #endif
5551 }
5552 }
5553 /* compare low. Always unsigned */
5554 op1 = op;
5555 if (op1 == TOK_LT)
5556 op1 = TOK_ULT;
5557 else if (op1 == TOK_LE)
5558 op1 = TOK_ULE;
5559 else if (op1 == TOK_GT)
5560 op1 = TOK_UGT;
5561 else if (op1 == TOK_GE)
5562 op1 = TOK_UGE;
5563 gen_op(op1);
5564 a = gtst(1, a);
5565 gsym(b);
5566 vseti(VT_JMPI, a);
5567 break;
5568 }
5569 }
5570 #endif
5571
5572 /* handle integer constant optimizations and various machine
5573 independent opt */
5574 void gen_opic(int op)
5575 {
5576 int c1, c2, t1, t2, n;
5577 SValue *v1, *v2;
5578 long long l1, l2;
5579 typedef unsigned long long U;
5580
5581 v1 = vtop - 1;
5582 v2 = vtop;
5583 t1 = v1->type.t & VT_BTYPE;
5584 t2 = v2->type.t & VT_BTYPE;
5585
5586 if (t1 == VT_LLONG)
5587 l1 = v1->c.ll;
5588 else if (v1->type.t & VT_UNSIGNED)
5589 l1 = v1->c.ui;
5590 else
5591 l1 = v1->c.i;
5592
5593 if (t2 == VT_LLONG)
5594 l2 = v2->c.ll;
5595 else if (v2->type.t & VT_UNSIGNED)
5596 l2 = v2->c.ui;
5597 else
5598 l2 = v2->c.i;
5599
5600 /* currently, we cannot do computations with forward symbols */
5601 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5602 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5603 if (c1 && c2) {
5604 switch(op) {
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 case '*': l1 *= l2; break;
5611
5612 case TOK_PDIV:
5613 case '/':
5614 case '%':
5615 case TOK_UDIV:
5616 case TOK_UMOD:
5617 /* if division by zero, generate explicit division */
5618 if (l2 == 0) {
5619 if (const_wanted)
5620 error("division by zero in constant");
5621 goto general_case;
5622 }
5623 switch(op) {
5624 default: l1 /= l2; break;
5625 case '%': l1 %= l2; break;
5626 case TOK_UDIV: l1 = (U)l1 / l2; break;
5627 case TOK_UMOD: l1 = (U)l1 % l2; break;
5628 }
5629 break;
5630 case TOK_SHL: l1 <<= l2; break;
5631 case TOK_SHR: l1 = (U)l1 >> l2; break;
5632 case TOK_SAR: l1 >>= l2; break;
5633 /* tests */
5634 case TOK_ULT: l1 = (U)l1 < (U)l2; break;
5635 case TOK_UGE: l1 = (U)l1 >= (U)l2; break;
5636 case TOK_EQ: l1 = l1 == l2; break;
5637 case TOK_NE: l1 = l1 != l2; break;
5638 case TOK_ULE: l1 = (U)l1 <= (U)l2; break;
5639 case TOK_UGT: l1 = (U)l1 > (U)l2; break;
5640 case TOK_LT: l1 = l1 < l2; break;
5641 case TOK_GE: l1 = l1 >= l2; break;
5642 case TOK_LE: l1 = l1 <= l2; break;
5643 case TOK_GT: l1 = l1 > l2; break;
5644 /* logical */
5645 case TOK_LAND: l1 = l1 && l2; break;
5646 case TOK_LOR: l1 = l1 || l2; break;
5647 default:
5648 goto general_case;
5649 }
5650 v1->c.ll = l1;
5651 vtop--;
5652 } else {
5653 /* if commutative ops, put c2 as constant */
5654 if (c1 && (op == '+' || op == '&' || op == '^' ||
5655 op == '|' || op == '*')) {
5656 vswap();
5657 c2 = c1; //c = c1, c1 = c2, c2 = c;
5658 l2 = l1; //l = l1, l1 = l2, l2 = l;
5659 }
5660 /* Filter out NOP operations like x*1, x-0, x&-1... */
5661 if (c2 && (((op == '*' || op == '/' || op == TOK_UDIV ||
5662 op == TOK_PDIV) &&
5663 l2 == 1) ||
5664 ((op == '+' || op == '-' || op == '|' || op == '^' ||
5665 op == TOK_SHL || op == TOK_SHR || op == TOK_SAR) &&
5666 l2 == 0) ||
5667 (op == '&' &&
5668 l2 == -1))) {
5669 /* nothing to do */
5670 vtop--;
5671 } else if (c2 && (op == '*' || op == TOK_PDIV || op == TOK_UDIV)) {
5672 /* try to use shifts instead of muls or divs */
5673 if (l2 > 0 && (l2 & (l2 - 1)) == 0) {
5674 n = -1;
5675 while (l2) {
5676 l2 >>= 1;
5677 n++;
5678 }
5679 vtop->c.ll = n;
5680 if (op == '*')
5681 op = TOK_SHL;
5682 else if (op == TOK_PDIV)
5683 op = TOK_SAR;
5684 else
5685 op = TOK_SHR;
5686 }
5687 goto general_case;
5688 } else if (c2 && (op == '+' || op == '-') &&
5689 ((vtop[-1].r & (VT_VALMASK | VT_LVAL | VT_SYM)) ==
5690 (VT_CONST | VT_SYM) ||
5691 (vtop[-1].r & (VT_VALMASK | VT_LVAL)) == VT_LOCAL)) {
5692 /* symbol + constant case */
5693 if (op == '-')
5694 l2 = -l2;
5695 vtop--;
5696 vtop->c.ll += l2;
5697 } else {
5698 general_case:
5699 if (!nocode_wanted) {
5700 /* call low level op generator */
5701 if (t1 == VT_LLONG || t2 == VT_LLONG)
5702 gen_opl(op);
5703 else
5704 gen_opi(op);
5705 } else {
5706 vtop--;
5707 }
5708 }
5709 }
5710 }
5711
5712 /* generate a floating point operation with constant propagation */
5713 void gen_opif(int op)
5714 {
5715 int c1, c2;
5716 SValue *v1, *v2;
5717 long double f1, f2;
5718
5719 v1 = vtop - 1;
5720 v2 = vtop;
5721 /* currently, we cannot do computations with forward symbols */
5722 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5723 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
5724 if (c1 && c2) {
5725 if (v1->type.t == VT_FLOAT) {
5726 f1 = v1->c.f;
5727 f2 = v2->c.f;
5728 } else if (v1->type.t == VT_DOUBLE) {
5729 f1 = v1->c.d;
5730 f2 = v2->c.d;
5731 } else {
5732 f1 = v1->c.ld;
5733 f2 = v2->c.ld;
5734 }
5735
5736 /* NOTE: we only do constant propagation if finite number (not
5737 NaN or infinity) (ANSI spec) */
5738 if (!ieee_finite(f1) || !ieee_finite(f2))
5739 goto general_case;
5740
5741 switch(op) {
5742 case '+': f1 += f2; break;
5743 case '-': f1 -= f2; break;
5744 case '*': f1 *= f2; break;
5745 case '/':
5746 if (f2 == 0.0) {
5747 if (const_wanted)
5748 error("division by zero in constant");
5749 goto general_case;
5750 }
5751 f1 /= f2;
5752 break;
5753 /* XXX: also handles tests ? */
5754 default:
5755 goto general_case;
5756 }
5757 /* XXX: overflow test ? */
5758 if (v1->type.t == VT_FLOAT) {
5759 v1->c.f = f1;
5760 } else if (v1->type.t == VT_DOUBLE) {
5761 v1->c.d = f1;
5762 } else {
5763 v1->c.ld = f1;
5764 }
5765 vtop--;
5766 } else {
5767 general_case:
5768 if (!nocode_wanted) {
5769 gen_opf(op);
5770 } else {
5771 vtop--;
5772 }
5773 }
5774 }
5775
5776 static int pointed_size(CType *type)
5777 {
5778 int align;
5779 return type_size(pointed_type(type), &align);
5780 }
5781
5782 static inline int is_null_pointer(SValue *p)
5783 {
5784 if ((p->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
5785 return 0;
5786 return ((p->type.t & VT_BTYPE) == VT_INT && p->c.i == 0) ||
5787 ((p->type.t & VT_BTYPE) == VT_LLONG && p->c.ll == 0);
5788 }
5789
5790 static inline int is_integer_btype(int bt)
5791 {
5792 return (bt == VT_BYTE || bt == VT_SHORT ||
5793 bt == VT_INT || bt == VT_LLONG);
5794 }
5795
5796 /* check types for comparison or substraction of pointers */
5797 static void check_comparison_pointer_types(SValue *p1, SValue *p2, int op)
5798 {
5799 CType *type1, *type2, tmp_type1, tmp_type2;
5800 int bt1, bt2;
5801
5802 /* null pointers are accepted for all comparisons as gcc */
5803 if (is_null_pointer(p1) || is_null_pointer(p2))
5804 return;
5805 type1 = &p1->type;
5806 type2 = &p2->type;
5807 bt1 = type1->t & VT_BTYPE;
5808 bt2 = type2->t & VT_BTYPE;
5809 /* accept comparison between pointer and integer with a warning */
5810 if ((is_integer_btype(bt1) || is_integer_btype(bt2)) && op != '-') {
5811 if (op != TOK_LOR && op != TOK_LAND )
5812 warning("comparison between pointer and integer");
5813 return;
5814 }
5815
5816 /* both must be pointers or implicit function pointers */
5817 if (bt1 == VT_PTR) {
5818 type1 = pointed_type(type1);
5819 } else if (bt1 != VT_FUNC)
5820 goto invalid_operands;
5821
5822 if (bt2 == VT_PTR) {
5823 type2 = pointed_type(type2);
5824 } else if (bt2 != VT_FUNC) {
5825 invalid_operands:
5826 error("invalid operands to binary %s", get_tok_str(op, NULL));
5827 }
5828 if ((type1->t & VT_BTYPE) == VT_VOID ||
5829 (type2->t & VT_BTYPE) == VT_VOID)
5830 return;
5831 tmp_type1 = *type1;
5832 tmp_type2 = *type2;
5833 tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
5834 tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
5835 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
5836 /* gcc-like error if '-' is used */
5837 if (op == '-')
5838 goto invalid_operands;
5839 else
5840 warning("comparison of distinct pointer types lacks a cast");
5841 }
5842 }
5843
5844 /* generic gen_op: handles types problems */
5845 void gen_op(int op)
5846 {
5847 int u, t1, t2, bt1, bt2, t;
5848 CType type1;
5849
5850 t1 = vtop[-1].type.t;
5851 t2 = vtop[0].type.t;
5852 bt1 = t1 & VT_BTYPE;
5853 bt2 = t2 & VT_BTYPE;
5854
5855 if (bt1 == VT_PTR || bt2 == VT_PTR) {
5856 /* at least one operand is a pointer */
5857 /* relationnal op: must be both pointers */
5858 if (op >= TOK_ULT && op <= TOK_LOR) {
5859 check_comparison_pointer_types(vtop - 1, vtop, op);
5860 /* pointers are handled are unsigned */
5861 #ifdef TCC_TARGET_X86_64
5862 t = VT_LLONG | VT_UNSIGNED;
5863 #else
5864 t = VT_INT | VT_UNSIGNED;
5865 #endif
5866 goto std_op;
5867 }
5868 /* if both pointers, then it must be the '-' op */
5869 if (bt1 == VT_PTR && bt2 == VT_PTR) {
5870 if (op != '-')
5871 error("cannot use pointers here");
5872 check_comparison_pointer_types(vtop - 1, vtop, op);
5873 /* XXX: check that types are compatible */
5874 u = pointed_size(&vtop[-1].type);
5875 gen_opic(op);
5876 /* set to integer type */
5877 #ifdef TCC_TARGET_X86_64
5878 vtop->type.t = VT_LLONG;
5879 #else
5880 vtop->type.t = VT_INT;
5881 #endif
5882 vpushi(u);
5883 gen_op(TOK_PDIV);
5884 } else {
5885 /* exactly one pointer : must be '+' or '-'. */
5886 if (op != '-' && op != '+')
5887 error("cannot use pointers here");
5888 /* Put pointer as first operand */
5889 if (bt2 == VT_PTR) {
5890 vswap();
5891 swap(&t1, &t2);
5892 }
5893 type1 = vtop[-1].type;
5894 #ifdef TCC_TARGET_X86_64
5895 vpushll(pointed_size(&vtop[-1].type));
5896 #else
5897 /* XXX: cast to int ? (long long case) */
5898 vpushi(pointed_size(&vtop[-1].type));
5899 #endif
5900 gen_op('*');
5901 #ifdef CONFIG_TCC_BCHECK
5902 /* if evaluating constant expression, no code should be
5903 generated, so no bound check */
5904 if (do_bounds_check && !const_wanted) {
5905 /* if bounded pointers, we generate a special code to
5906 test bounds */
5907 if (op == '-') {
5908 vpushi(0);
5909 vswap();
5910 gen_op('-');
5911 }
5912 gen_bounded_ptr_add();
5913 } else
5914 #endif
5915 {
5916 gen_opic(op);
5917 }
5918 /* put again type if gen_opic() swaped operands */
5919 vtop->type = type1;
5920 }
5921 } else if (is_float(bt1) || is_float(bt2)) {
5922 /* compute bigger type and do implicit casts */
5923 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
5924 t = VT_LDOUBLE;
5925 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
5926 t = VT_DOUBLE;
5927 } else {
5928 t = VT_FLOAT;
5929 }
5930 /* floats can only be used for a few operations */
5931 if (op != '+' && op != '-' && op != '*' && op != '/' &&
5932 (op < TOK_ULT || op > TOK_GT))
5933 error("invalid operands for binary operation");
5934 goto std_op;
5935 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
5936 /* cast to biggest op */
5937 t = VT_LLONG;
5938 /* convert to unsigned if it does not fit in a long long */
5939 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
5940 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
5941 t |= VT_UNSIGNED;
5942 goto std_op;
5943 } else {
5944 /* integer operations */
5945 t = VT_INT;
5946 /* convert to unsigned if it does not fit in an integer */
5947 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
5948 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
5949 t |= VT_UNSIGNED;
5950 std_op:
5951 /* XXX: currently, some unsigned operations are explicit, so
5952 we modify them here */
5953 if (t & VT_UNSIGNED) {
5954 if (op == TOK_SAR)
5955 op = TOK_SHR;
5956 else if (op == '/')
5957 op = TOK_UDIV;
5958 else if (op == '%')
5959 op = TOK_UMOD;
5960 else if (op == TOK_LT)
5961 op = TOK_ULT;
5962 else if (op == TOK_GT)
5963 op = TOK_UGT;
5964 else if (op == TOK_LE)
5965 op = TOK_ULE;
5966 else if (op == TOK_GE)
5967 op = TOK_UGE;
5968 }
5969 vswap();
5970 type1.t = t;
5971 gen_cast(&type1);
5972 vswap();
5973 /* special case for shifts and long long: we keep the shift as
5974 an integer */
5975 if (op == TOK_SHR || op == TOK_SAR || op == TOK_SHL)
5976 type1.t = VT_INT;
5977 gen_cast(&type1);
5978 if (is_float(t))
5979 gen_opif(op);
5980 else
5981 gen_opic(op);
5982 if (op >= TOK_ULT && op <= TOK_GT) {
5983 /* relationnal op: the result is an int */
5984 vtop->type.t = VT_INT;
5985 } else {
5986 vtop->type.t = t;
5987 }
5988 }
5989 }
5990
5991 #ifndef TCC_TARGET_ARM
5992 /* generic itof for unsigned long long case */
5993 void gen_cvt_itof1(int t)
5994 {
5995 if ((vtop->type.t & (VT_BTYPE | VT_UNSIGNED)) ==
5996 (VT_LLONG | VT_UNSIGNED)) {
5997
5998 if (t == VT_FLOAT)
5999 vpush_global_sym(&func_old_type, TOK___floatundisf);
6000 #if LDOUBLE_SIZE != 8
6001 else if (t == VT_LDOUBLE)
6002 vpush_global_sym(&func_old_type, TOK___floatundixf);
6003 #endif
6004 else
6005 vpush_global_sym(&func_old_type, TOK___floatundidf);
6006 vrott(2);
6007 gfunc_call(1);
6008 vpushi(0);
6009 vtop->r = REG_FRET;
6010 } else {
6011 gen_cvt_itof(t);
6012 }
6013 }
6014 #endif
6015
6016 /* generic ftoi for unsigned long long case */
6017 void gen_cvt_ftoi1(int t)
6018 {
6019 int st;
6020
6021 if (t == (VT_LLONG | VT_UNSIGNED)) {
6022 /* not handled natively */
6023 st = vtop->type.t & VT_BTYPE;
6024 if (st == VT_FLOAT)
6025 vpush_global_sym(&func_old_type, TOK___fixunssfdi);
6026 #if LDOUBLE_SIZE != 8
6027 else if (st == VT_LDOUBLE)
6028 vpush_global_sym(&func_old_type, TOK___fixunsxfdi);
6029 #endif
6030 else
6031 vpush_global_sym(&func_old_type, TOK___fixunsdfdi);
6032 vrott(2);
6033 gfunc_call(1);
6034 vpushi(0);
6035 vtop->r = REG_IRET;
6036 vtop->r2 = REG_LRET;
6037 } else {
6038 gen_cvt_ftoi(t);
6039 }
6040 }
6041
6042 /* force char or short cast */
6043 void force_charshort_cast(int t)
6044 {
6045 int bits, dbt;
6046 dbt = t & VT_BTYPE;
6047 /* XXX: add optimization if lvalue : just change type and offset */
6048 if (dbt == VT_BYTE)
6049 bits = 8;
6050 else
6051 bits = 16;
6052 if (t & VT_UNSIGNED) {
6053 vpushi((1 << bits) - 1);
6054 gen_op('&');
6055 } else {
6056 bits = 32 - bits;
6057 vpushi(bits);
6058 gen_op(TOK_SHL);
6059 /* result must be signed or the SAR is converted to an SHL
6060 This was not the case when "t" was a signed short
6061 and the last value on the stack was an unsigned int */
6062 vtop->type.t &= ~VT_UNSIGNED;
6063 vpushi(bits);
6064 gen_op(TOK_SAR);
6065 }
6066 }
6067
6068 /* cast 'vtop' to 'type'. Casting to bitfields is forbidden. */
6069 static void gen_cast(CType *type)
6070 {
6071 int sbt, dbt, sf, df, c, p;
6072
6073 /* special delayed cast for char/short */
6074 /* XXX: in some cases (multiple cascaded casts), it may still
6075 be incorrect */
6076 if (vtop->r & VT_MUSTCAST) {
6077 vtop->r &= ~VT_MUSTCAST;
6078 force_charshort_cast(vtop->type.t);
6079 }
6080
6081 /* bitfields first get cast to ints */
6082 if (vtop->type.t & VT_BITFIELD) {
6083 gv(RC_INT);
6084 }
6085
6086 dbt = type->t & (VT_BTYPE | VT_UNSIGNED);
6087 sbt = vtop->type.t & (VT_BTYPE | VT_UNSIGNED);
6088
6089 if (sbt != dbt) {
6090 sf = is_float(sbt);
6091 df = is_float(dbt);
6092 c = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
6093 p = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == (VT_CONST | VT_SYM);
6094 if (c) {
6095 /* constant case: we can do it now */
6096 /* XXX: in ISOC, cannot do it if error in convert */
6097 if (sbt == VT_FLOAT)
6098 vtop->c.ld = vtop->c.f;
6099 else if (sbt == VT_DOUBLE)
6100 vtop->c.ld = vtop->c.d;
6101
6102 if (df) {
6103 if ((sbt & VT_BTYPE) == VT_LLONG) {
6104 if (sbt & VT_UNSIGNED)
6105 vtop->c.ld = vtop->c.ull;
6106 else
6107 vtop->c.ld = vtop->c.ll;
6108 } else if(!sf) {
6109 if (sbt & VT_UNSIGNED)
6110 vtop->c.ld = vtop->c.ui;
6111 else
6112 vtop->c.ld = vtop->c.i;
6113 }
6114
6115 if (dbt == VT_FLOAT)
6116 vtop->c.f = (float)vtop->c.ld;
6117 else if (dbt == VT_DOUBLE)
6118 vtop->c.d = (double)vtop->c.ld;
6119 } else if (sf && dbt == (VT_LLONG|VT_UNSIGNED)) {
6120 vtop->c.ull = (unsigned long long)vtop->c.ld;
6121 } else if (sf && dbt == VT_BOOL) {
6122 vtop->c.i = (vtop->c.ld != 0);
6123 } else {
6124 if(sf)
6125 vtop->c.ll = (long long)vtop->c.ld;
6126 else if (sbt == (VT_LLONG|VT_UNSIGNED))
6127 vtop->c.ll = vtop->c.ull;
6128 else if (sbt & VT_UNSIGNED)
6129 vtop->c.ll = vtop->c.ui;
6130 else if (sbt != VT_LLONG)
6131 vtop->c.ll = vtop->c.i;
6132
6133 if (dbt == (VT_LLONG|VT_UNSIGNED))
6134 vtop->c.ull = vtop->c.ll;
6135 else if (dbt == VT_BOOL)
6136 vtop->c.i = (vtop->c.ll != 0);
6137 else if (dbt != VT_LLONG) {
6138 int s = 0;
6139 if ((dbt & VT_BTYPE) == VT_BYTE)
6140 s = 24;
6141 else if ((dbt & VT_BTYPE) == VT_SHORT)
6142 s = 16;
6143
6144 if(dbt & VT_UNSIGNED)
6145 vtop->c.ui = ((unsigned int)vtop->c.ll << s) >> s;
6146 else
6147 vtop->c.i = ((int)vtop->c.ll << s) >> s;
6148 }
6149 }
6150 } else if (p && dbt == VT_BOOL) {
6151 vtop->r = VT_CONST;
6152 vtop->c.i = 1;
6153 } else if (!nocode_wanted) {
6154 /* non constant case: generate code */
6155 if (sf && df) {
6156 /* convert from fp to fp */
6157 gen_cvt_ftof(dbt);
6158 } else if (df) {
6159 /* convert int to fp */
6160 gen_cvt_itof1(dbt);
6161 } else if (sf) {
6162 /* convert fp to int */
6163 if (dbt == VT_BOOL) {
6164 vpushi(0);
6165 gen_op(TOK_NE);
6166 } else {
6167 /* we handle char/short/etc... with generic code */
6168 if (dbt != (VT_INT | VT_UNSIGNED) &&
6169 dbt != (VT_LLONG | VT_UNSIGNED) &&
6170 dbt != VT_LLONG)
6171 dbt = VT_INT;
6172 gen_cvt_ftoi1(dbt);
6173 if (dbt == VT_INT && (type->t & (VT_BTYPE | VT_UNSIGNED)) != dbt) {
6174 /* additional cast for char/short... */
6175 vtop->type.t = dbt;
6176 gen_cast(type);
6177 }
6178 }
6179 } else if ((dbt & VT_BTYPE) == VT_LLONG) {
6180 if ((sbt & VT_BTYPE) != VT_LLONG) {
6181 /* scalar to long long */
6182 #ifndef TCC_TARGET_X86_64
6183 /* machine independent conversion */
6184 gv(RC_INT);
6185 /* generate high word */
6186 if (sbt == (VT_INT | VT_UNSIGNED)) {
6187 vpushi(0);
6188 gv(RC_INT);
6189 } else {
6190 gv_dup();
6191 vpushi(31);
6192 gen_op(TOK_SAR);
6193 }
6194 /* patch second register */
6195 vtop[-1].r2 = vtop->r;
6196 vpop();
6197 #else
6198 int r = gv(RC_INT);
6199 if (sbt != (VT_INT | VT_UNSIGNED)) {
6200 /* x86_64 specific: movslq */
6201 o(0x6348);
6202 o(0xc0 + (REG_VALUE(r) << 3) + REG_VALUE(r));
6203 }
6204 #endif
6205 }
6206 } else if (dbt == VT_BOOL) {
6207 /* scalar to bool */
6208 vpushi(0);
6209 gen_op(TOK_NE);
6210 } else if ((dbt & VT_BTYPE) == VT_BYTE ||
6211 (dbt & VT_BTYPE) == VT_SHORT) {
6212 if (sbt == VT_PTR) {
6213 vtop->type.t = VT_INT;
6214 warning("nonportable conversion from pointer to char/short");
6215 }
6216 force_charshort_cast(dbt);
6217 } else if ((dbt & VT_BTYPE) == VT_INT) {
6218 /* scalar to int */
6219 if (sbt == VT_LLONG) {
6220 /* from long long: just take low order word */
6221 lexpand();
6222 vpop();
6223 }
6224 /* if lvalue and single word type, nothing to do because
6225 the lvalue already contains the real type size (see
6226 VT_LVAL_xxx constants) */
6227 }
6228 }
6229 } else if ((dbt & VT_BTYPE) == VT_PTR && !(vtop->r & VT_LVAL)) {
6230 /* if we are casting between pointer types,
6231 we must update the VT_LVAL_xxx size */
6232 vtop->r = (vtop->r & ~VT_LVAL_TYPE)
6233 | (lvalue_type(type->ref->type.t) & VT_LVAL_TYPE);
6234 }
6235 vtop->type = *type;
6236 }
6237
6238 /* return type size. Put alignment at 'a' */
6239 static int type_size(CType *type, int *a)
6240 {
6241 Sym *s;
6242 int bt;
6243
6244 bt = type->t & VT_BTYPE;
6245 if (bt == VT_STRUCT) {
6246 /* struct/union */
6247 s = type->ref;
6248 *a = s->r;
6249 return s->c;
6250 } else if (bt == VT_PTR) {
6251 if (type->t & VT_ARRAY) {
6252 int ts;
6253
6254 s = type->ref;
6255 ts = type_size(&s->type, a);
6256
6257 if (ts < 0 && s->c < 0)
6258 ts = -ts;
6259
6260 return ts * s->c;
6261 } else {
6262 *a = PTR_SIZE;
6263 return PTR_SIZE;
6264 }
6265 } else if (bt == VT_LDOUBLE) {
6266 *a = LDOUBLE_ALIGN;
6267 return LDOUBLE_SIZE;
6268 } else if (bt == VT_DOUBLE || bt == VT_LLONG) {
6269 #ifdef TCC_TARGET_I386
6270 *a = 8;
6271 #elif defined(TCC_TARGET_ARM)
6272 #ifdef TCC_ARM_EABI
6273 *a = 8;
6274 #else
6275 *a = 4;
6276 #endif
6277 #else
6278 *a = 8;
6279 #endif
6280 return 8;
6281 } else if (bt == VT_INT || bt == VT_ENUM || bt == VT_FLOAT) {
6282 *a = 4;
6283 return 4;
6284 } else if (bt == VT_SHORT) {
6285 *a = 2;
6286 return 2;
6287 } else {
6288 /* char, void, function, _Bool */
6289 *a = 1;
6290 return 1;
6291 }
6292 }
6293
6294 /* return the pointed type of t */
6295 static inline CType *pointed_type(CType *type)
6296 {
6297 return &type->ref->type;
6298 }
6299
6300 /* modify type so that its it is a pointer to type. */
6301 static void mk_pointer(CType *type)
6302 {
6303 Sym *s;
6304 s = sym_push(SYM_FIELD, type, 0, -1);
6305 type->t = VT_PTR | (type->t & ~VT_TYPE);
6306 type->ref = s;
6307 }
6308
6309 /* compare function types. OLD functions match any new functions */
6310 static int is_compatible_func(CType *type1, CType *type2)
6311 {
6312 Sym *s1, *s2;
6313
6314 s1 = type1->ref;
6315 s2 = type2->ref;
6316 if (!is_compatible_types(&s1->type, &s2->type))
6317 return 0;
6318 /* check func_call */
6319 if (FUNC_CALL(s1->r) != FUNC_CALL(s2->r))
6320 return 0;
6321 /* XXX: not complete */
6322 if (s1->c == FUNC_OLD || s2->c == FUNC_OLD)
6323 return 1;
6324 if (s1->c != s2->c)
6325 return 0;
6326 while (s1 != NULL) {
6327 if (s2 == NULL)
6328 return 0;
6329 if (!is_compatible_parameter_types(&s1->type, &s2->type))
6330 return 0;
6331 s1 = s1->next;
6332 s2 = s2->next;
6333 }
6334 if (s2)
6335 return 0;
6336 return 1;
6337 }
6338
6339 /* return true if type1 and type2 are the same. If unqualified is
6340 true, qualifiers on the types are ignored.
6341
6342 - enums are not checked as gcc __builtin_types_compatible_p ()
6343 */
6344 static int compare_types(CType *type1, CType *type2, int unqualified)
6345 {
6346 int bt1, t1, t2;
6347
6348 t1 = type1->t & VT_TYPE;
6349 t2 = type2->t & VT_TYPE;
6350 if (unqualified) {
6351 /* strip qualifiers before comparing */
6352 t1 &= ~(VT_CONSTANT | VT_VOLATILE);
6353 t2 &= ~(VT_CONSTANT | VT_VOLATILE);
6354 }
6355 /* XXX: bitfields ? */
6356 if (t1 != t2)
6357 return 0;
6358 /* test more complicated cases */
6359 bt1 = t1 & VT_BTYPE;
6360 if (bt1 == VT_PTR) {
6361 type1 = pointed_type(type1);
6362 type2 = pointed_type(type2);
6363 return is_compatible_types(type1, type2);
6364 } else if (bt1 == VT_STRUCT) {
6365 return (type1->ref == type2->ref);
6366 } else if (bt1 == VT_FUNC) {
6367 return is_compatible_func(type1, type2);
6368 } else {
6369 return 1;
6370 }
6371 }
6372
6373 /* return true if type1 and type2 are exactly the same (including
6374 qualifiers).
6375 */
6376 static int is_compatible_types(CType *type1, CType *type2)
6377 {
6378 return compare_types(type1,type2,0);
6379 }
6380
6381 /* return true if type1 and type2 are the same (ignoring qualifiers).
6382 */
6383 static int is_compatible_parameter_types(CType *type1, CType *type2)
6384 {
6385 return compare_types(type1,type2,1);
6386 }
6387
6388 /* print a type. If 'varstr' is not NULL, then the variable is also
6389 printed in the type */
6390 /* XXX: union */
6391 /* XXX: add array and function pointers */
6392 void type_to_str(char *buf, int buf_size,
6393 CType *type, const char *varstr)
6394 {
6395 int bt, v, t;
6396 Sym *s, *sa;
6397 char buf1[256];
6398 const char *tstr;
6399
6400 t = type->t & VT_TYPE;
6401 bt = t & VT_BTYPE;
6402 buf[0] = '\0';
6403 if (t & VT_CONSTANT)
6404 pstrcat(buf, buf_size, "const ");
6405 if (t & VT_VOLATILE)
6406 pstrcat(buf, buf_size, "volatile ");
6407 if (t & VT_UNSIGNED)
6408 pstrcat(buf, buf_size, "unsigned ");
6409 switch(bt) {
6410 case VT_VOID:
6411 tstr = "void";
6412 goto add_tstr;
6413 case VT_BOOL:
6414 tstr = "_Bool";
6415 goto add_tstr;
6416 case VT_BYTE:
6417 tstr = "char";
6418 goto add_tstr;
6419 case VT_SHORT:
6420 tstr = "short";
6421 goto add_tstr;
6422 case VT_INT:
6423 tstr = "int";
6424 goto add_tstr;
6425 case VT_LONG:
6426 tstr = "long";
6427 goto add_tstr;
6428 case VT_LLONG:
6429 tstr = "long long";
6430 goto add_tstr;
6431 case VT_FLOAT:
6432 tstr = "float";
6433 goto add_tstr;
6434 case VT_DOUBLE:
6435 tstr = "double";
6436 goto add_tstr;
6437 case VT_LDOUBLE:
6438 tstr = "long double";
6439 add_tstr:
6440 pstrcat(buf, buf_size, tstr);
6441 break;
6442 case VT_ENUM:
6443 case VT_STRUCT:
6444 if (bt == VT_STRUCT)
6445 tstr = "struct ";
6446 else
6447 tstr = "enum ";
6448 pstrcat(buf, buf_size, tstr);
6449 v = type->ref->v & ~SYM_STRUCT;
6450 if (v >= SYM_FIRST_ANOM)
6451 pstrcat(buf, buf_size, "<anonymous>");
6452 else
6453 pstrcat(buf, buf_size, get_tok_str(v, NULL));
6454 break;
6455 case VT_FUNC:
6456 s = type->ref;
6457 type_to_str(buf, buf_size, &s->type, varstr);
6458 pstrcat(buf, buf_size, "(");
6459 sa = s->next;
6460 while (sa != NULL) {
6461 type_to_str(buf1, sizeof(buf1), &sa->type, NULL);
6462 pstrcat(buf, buf_size, buf1);
6463 sa = sa->next;
6464 if (sa)
6465 pstrcat(buf, buf_size, ", ");
6466 }
6467 pstrcat(buf, buf_size, ")");
6468 goto no_var;
6469 case VT_PTR:
6470 s = type->ref;
6471 pstrcpy(buf1, sizeof(buf1), "*");
6472 if (varstr)
6473 pstrcat(buf1, sizeof(buf1), varstr);
6474 type_to_str(buf, buf_size, &s->type, buf1);
6475 goto no_var;
6476 }
6477 if (varstr) {
6478 pstrcat(buf, buf_size, " ");
6479 pstrcat(buf, buf_size, varstr);
6480 }
6481 no_var: ;
6482 }
6483
6484 /* verify type compatibility to store vtop in 'dt' type, and generate
6485 casts if needed. */
6486 static void gen_assign_cast(CType *dt)
6487 {
6488 CType *st, *type1, *type2, tmp_type1, tmp_type2;
6489 char buf1[256], buf2[256];
6490 int dbt, sbt;
6491
6492 st = &vtop->type; /* source type */
6493 dbt = dt->t & VT_BTYPE;
6494 sbt = st->t & VT_BTYPE;
6495 if (dt->t & VT_CONSTANT)
6496 warning("assignment of read-only location");
6497 switch(dbt) {
6498 case VT_PTR:
6499 /* special cases for pointers */
6500 /* '0' can also be a pointer */
6501 if (is_null_pointer(vtop))
6502 goto type_ok;
6503 /* accept implicit pointer to integer cast with warning */
6504 if (is_integer_btype(sbt)) {
6505 warning("assignment makes pointer from integer without a cast");
6506 goto type_ok;
6507 }
6508 type1 = pointed_type(dt);
6509 /* a function is implicitely a function pointer */
6510 if (sbt == VT_FUNC) {
6511 if ((type1->t & VT_BTYPE) != VT_VOID &&
6512 !is_compatible_types(pointed_type(dt), st))
6513 goto error;
6514 else
6515 goto type_ok;
6516 }
6517 if (sbt != VT_PTR)
6518 goto error;
6519 type2 = pointed_type(st);
6520 if ((type1->t & VT_BTYPE) == VT_VOID ||
6521 (type2->t & VT_BTYPE) == VT_VOID) {
6522 /* void * can match anything */
6523 } else {
6524 /* exact type match, except for unsigned */
6525 tmp_type1 = *type1;
6526 tmp_type2 = *type2;
6527 tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
6528 tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
6529 if (!is_compatible_types(&tmp_type1, &tmp_type2))
6530 warning("assignment from incompatible pointer type");
6531 }
6532 /* check const and volatile */
6533 if ((!(type1->t & VT_CONSTANT) && (type2->t & VT_CONSTANT)) ||
6534 (!(type1->t & VT_VOLATILE) && (type2->t & VT_VOLATILE)))
6535 warning("assignment discards qualifiers from pointer target type");
6536 break;
6537 case VT_BYTE:
6538 case VT_SHORT:
6539 case VT_INT:
6540 case VT_LLONG:
6541 if (sbt == VT_PTR || sbt == VT_FUNC) {
6542 warning("assignment makes integer from pointer without a cast");
6543 }
6544 /* XXX: more tests */
6545 break;
6546 case VT_STRUCT:
6547 tmp_type1 = *dt;
6548 tmp_type2 = *st;
6549 tmp_type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
6550 tmp_type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
6551 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
6552 error:
6553 type_to_str(buf1, sizeof(buf1), st, NULL);
6554 type_to_str(buf2, sizeof(buf2), dt, NULL);
6555 error("cannot cast '%s' to '%s'", buf1, buf2);
6556 }
6557 break;
6558 }
6559 type_ok:
6560 gen_cast(dt);
6561 }
6562
6563 /* store vtop in lvalue pushed on stack */
6564 void vstore(void)
6565 {
6566 int sbt, dbt, ft, r, t, size, align, bit_size, bit_pos, rc, delayed_cast;
6567
6568 ft = vtop[-1].type.t;
6569 sbt = vtop->type.t & VT_BTYPE;
6570 dbt = ft & VT_BTYPE;
6571 if (((sbt == VT_INT || sbt == VT_SHORT) && dbt == VT_BYTE) ||
6572 (sbt == VT_INT && dbt == VT_SHORT)) {
6573 /* optimize char/short casts */
6574 delayed_cast = VT_MUSTCAST;
6575 vtop->type.t = ft & (VT_TYPE & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT)));
6576 /* XXX: factorize */
6577 if (ft & VT_CONSTANT)
6578 warning("assignment of read-only location");
6579 } else {
6580 delayed_cast = 0;
6581 if (!(ft & VT_BITFIELD))
6582 gen_assign_cast(&vtop[-1].type);
6583 }
6584
6585 if (sbt == VT_STRUCT) {
6586 /* if structure, only generate pointer */
6587 /* structure assignment : generate memcpy */
6588 /* XXX: optimize if small size */
6589 if (!nocode_wanted) {
6590 size = type_size(&vtop->type, &align);
6591
6592 #ifdef TCC_ARM_EABI
6593 if(!(align & 7))
6594 vpush_global_sym(&func_old_type, TOK_memcpy8);
6595 else if(!(align & 3))
6596 vpush_global_sym(&func_old_type, TOK_memcpy4);
6597 else
6598 #endif
6599 vpush_global_sym(&func_old_type, TOK_memcpy);
6600
6601 /* destination */
6602 vpushv(vtop - 2);
6603 vtop->type.t = VT_INT;
6604 gaddrof();
6605 /* source */
6606 vpushv(vtop - 2);
6607 vtop->type.t = VT_INT;
6608 gaddrof();
6609 /* type size */
6610 vpushi(size);
6611 gfunc_call(3);
6612
6613 vswap();
6614 vpop();
6615 } else {
6616 vswap();
6617 vpop();
6618 }
6619 /* leave source on stack */
6620 } else if (ft & VT_BITFIELD) {
6621 /* bitfield store handling */
6622 bit_pos = (ft >> VT_STRUCT_SHIFT) & 0x3f;
6623 bit_size = (ft >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
6624 /* remove bit field info to avoid loops */
6625 vtop[-1].type.t = ft & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT));
6626
6627 /* duplicate source into other register */
6628 gv_dup();
6629 vswap();
6630 vrott(3);
6631
6632 if((ft & VT_BTYPE) == VT_BOOL) {
6633 gen_cast(&vtop[-1].type);
6634 vtop[-1].type.t = (vtop[-1].type.t & ~VT_BTYPE) | (VT_BYTE | VT_UNSIGNED);
6635 }
6636
6637 /* duplicate destination */
6638 vdup();
6639 vtop[-1] = vtop[-2];
6640
6641 /* mask and shift source */
6642 if((ft & VT_BTYPE) != VT_BOOL) {
6643 if((ft & VT_BTYPE) == VT_LLONG) {
6644 vpushll((1ULL << bit_size) - 1ULL);
6645 } else {
6646 vpushi((1 << bit_size) - 1);
6647 }
6648 gen_op('&');
6649 }
6650 vpushi(bit_pos);
6651 gen_op(TOK_SHL);
6652 /* load destination, mask and or with source */
6653 vswap();
6654 if((ft & VT_BTYPE) == VT_LLONG) {
6655 vpushll(~(((1ULL << bit_size) - 1ULL) << bit_pos));
6656 } else {
6657 vpushi(~(((1 << bit_size) - 1) << bit_pos));
6658 }
6659 gen_op('&');
6660 gen_op('|');
6661 /* store result */
6662 vstore();
6663
6664 /* pop off shifted source from "duplicate source..." above */
6665 vpop();
6666
6667 } else {
6668 #ifdef CONFIG_TCC_BCHECK
6669 /* bound check case */
6670 if (vtop[-1].r & VT_MUSTBOUND) {
6671 vswap();
6672 gbound();
6673 vswap();
6674 }
6675 #endif
6676 if (!nocode_wanted) {
6677 rc = RC_INT;
6678 if (is_float(ft)) {
6679 rc = RC_FLOAT;
6680 #ifdef TCC_TARGET_X86_64
6681 if ((ft & VT_BTYPE) == VT_LDOUBLE) {
6682 rc = RC_ST0;
6683 }
6684 #endif
6685 }
6686 r = gv(rc); /* generate value */
6687 /* if lvalue was saved on stack, must read it */
6688 if ((vtop[-1].r & VT_VALMASK) == VT_LLOCAL) {
6689 SValue sv;
6690 t = get_reg(RC_INT);
6691 #ifdef TCC_TARGET_X86_64
6692 sv.type.t = VT_PTR;
6693 #else
6694 sv.type.t = VT_INT;
6695 #endif
6696 sv.r = VT_LOCAL | VT_LVAL;
6697 sv.c.ul = vtop[-1].c.ul;
6698 load(t, &sv);
6699 vtop[-1].r = t | VT_LVAL;
6700 }
6701 store(r, vtop - 1);
6702 #ifndef TCC_TARGET_X86_64
6703 /* two word case handling : store second register at word + 4 */
6704 if ((ft & VT_BTYPE) == VT_LLONG) {
6705 vswap();
6706 /* convert to int to increment easily */
6707 vtop->type.t = VT_INT;
6708 gaddrof();
6709 vpushi(4);
6710 gen_op('+');
6711 vtop->r |= VT_LVAL;
6712 vswap();
6713 /* XXX: it works because r2 is spilled last ! */
6714 store(vtop->r2, vtop - 1);
6715 }
6716 #endif
6717 }
6718 vswap();
6719 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
6720 vtop->r |= delayed_cast;
6721 }
6722 }
6723
6724 /* post defines POST/PRE add. c is the token ++ or -- */
6725 void inc(int post, int c)
6726 {
6727 test_lvalue();
6728 vdup(); /* save lvalue */
6729 if (post) {
6730 gv_dup(); /* duplicate value */
6731 vrotb(3);
6732 vrotb(3);
6733 }
6734 /* add constant */
6735 vpushi(c - TOK_MID);
6736 gen_op('+');
6737 vstore(); /* store value */
6738 if (post)
6739 vpop(); /* if post op, return saved value */
6740 }
6741
6742 /* Parse GNUC __attribute__ extension. Currently, the following
6743 extensions are recognized:
6744 - aligned(n) : set data/function alignment.
6745 - packed : force data alignment to 1
6746 - section(x) : generate data/code in this section.
6747 - unused : currently ignored, but may be used someday.
6748 - regparm(n) : pass function parameters in registers (i386 only)
6749 */
6750 static void parse_attribute(AttributeDef *ad)
6751 {
6752 int t, n;
6753
6754 while (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) {
6755 next();
6756 skip('(');
6757 skip('(');
6758 while (tok != ')') {
6759 if (tok < TOK_IDENT)
6760 expect("attribute name");
6761 t = tok;
6762 next();
6763 switch(t) {
6764 case TOK_SECTION1:
6765 case TOK_SECTION2:
6766 skip('(');
6767 if (tok != TOK_STR)
6768 expect("section name");
6769 ad->section = find_section(tcc_state, (char *)tokc.cstr->data);
6770 next();
6771 skip(')');
6772 break;
6773 case TOK_ALIGNED1:
6774 case TOK_ALIGNED2:
6775 if (tok == '(') {
6776 next();
6777 n = expr_const();
6778 if (n <= 0 || (n & (n - 1)) != 0)
6779 error("alignment must be a positive power of two");
6780 skip(')');
6781 } else {
6782 n = MAX_ALIGN;
6783 }
6784 ad->aligned = n;
6785 break;
6786 case TOK_PACKED1:
6787 case TOK_PACKED2:
6788 ad->packed = 1;
6789 break;
6790 case TOK_UNUSED1:
6791 case TOK_UNUSED2:
6792 /* currently, no need to handle it because tcc does not
6793 track unused objects */
6794 break;
6795 case TOK_NORETURN1:
6796 case TOK_NORETURN2:
6797 /* currently, no need to handle it because tcc does not
6798 track unused objects */
6799 break;
6800 case TOK_CDECL1:
6801 case TOK_CDECL2:
6802 case TOK_CDECL3:
6803 FUNC_CALL(ad->func_attr) = FUNC_CDECL;
6804 break;
6805 case TOK_STDCALL1:
6806 case TOK_STDCALL2:
6807 case TOK_STDCALL3:
6808 FUNC_CALL(ad->func_attr) = FUNC_STDCALL;
6809 break;
6810 #ifdef TCC_TARGET_I386
6811 case TOK_REGPARM1:
6812 case TOK_REGPARM2:
6813 skip('(');
6814 n = expr_const();
6815 if (n > 3)
6816 n = 3;
6817 else if (n < 0)
6818 n = 0;
6819 if (n > 0)
6820 FUNC_CALL(ad->func_attr) = FUNC_FASTCALL1 + n - 1;
6821 skip(')');
6822 break;
6823 case TOK_FASTCALL1:
6824 case TOK_FASTCALL2:
6825 case TOK_FASTCALL3:
6826 FUNC_CALL(ad->func_attr) = FUNC_FASTCALLW;
6827 break;
6828 #endif
6829 case TOK_DLLEXPORT:
6830 FUNC_EXPORT(ad->func_attr) = 1;
6831 break;
6832 default:
6833 if (tcc_state->warn_unsupported)
6834 warning("'%s' attribute ignored", get_tok_str(t, NULL));
6835 /* skip parameters */
6836 if (tok == '(') {
6837 int parenthesis = 0;
6838 do {
6839 if (tok == '(')
6840 parenthesis++;
6841 else if (tok == ')')
6842 parenthesis--;
6843 next();
6844 } while (parenthesis && tok != -1);
6845 }
6846 break;
6847 }
6848 if (tok != ',')
6849 break;
6850 next();
6851 }
6852 skip(')');
6853 skip(')');
6854 }
6855 }
6856
6857 /* enum/struct/union declaration. u is either VT_ENUM or VT_STRUCT */
6858 static void struct_decl(CType *type, int u)
6859 {
6860 int a, v, size, align, maxalign, c, offset;
6861 int bit_size, bit_pos, bsize, bt, lbit_pos, prevbt;
6862 Sym *s, *ss, *ass, **ps;
6863 AttributeDef ad;
6864 CType type1, btype;
6865
6866 a = tok; /* save decl type */
6867 next();
6868 if (tok != '{') {
6869 v = tok;
6870 next();
6871 /* struct already defined ? return it */
6872 if (v < TOK_IDENT)
6873 expect("struct/union/enum name");
6874 s = struct_find(v);
6875 if (s) {
6876 if (s->type.t != a)
6877 error("invalid type");
6878 goto do_decl;
6879 }
6880 } else {
6881 v = anon_sym++;
6882 }
6883 type1.t = a;
6884 /* we put an undefined size for struct/union */
6885 s = sym_push(v | SYM_STRUCT, &type1, 0, -1);
6886 s->r = 0; /* default alignment is zero as gcc */
6887 /* put struct/union/enum name in type */
6888 do_decl:
6889 type->t = u;
6890 type->ref = s;
6891
6892 if (tok == '{') {
6893 next();
6894 if (s->c != -1)
6895 error("struct/union/enum already defined");
6896 /* cannot be empty */
6897 c = 0;
6898 /* non empty enums are not allowed */
6899 if (a == TOK_ENUM) {
6900 for(;;) {
6901 v = tok;
6902 if (v < TOK_UIDENT)
6903 expect("identifier");
6904 next();
6905 if (tok == '=') {
6906 next();
6907 c = expr_const();
6908 }
6909 /* enum symbols have static storage */
6910 ss = sym_push(v, &int_type, VT_CONST, c);
6911 ss->type.t |= VT_STATIC;
6912 if (tok != ',')
6913 break;
6914 next();
6915 c++;
6916 /* NOTE: we accept a trailing comma */
6917 if (tok == '}')
6918 break;
6919 }
6920 skip('}');
6921 } else {
6922 maxalign = 1;
6923 ps = &s->next;
6924 prevbt = VT_INT;
6925 bit_pos = 0;
6926 offset = 0;
6927 while (tok != '}') {
6928 parse_btype(&btype, &ad);
6929 while (1) {
6930 bit_size = -1;
6931 v = 0;
6932 type1 = btype;
6933 if (tok != ':') {
6934 type_decl(&type1, &ad, &v, TYPE_DIRECT | TYPE_ABSTRACT);
6935 if (v == 0 && (type1.t & VT_BTYPE) != VT_STRUCT)
6936 expect("identifier");
6937 if ((type1.t & VT_BTYPE) == VT_FUNC ||
6938 (type1.t & (VT_TYPEDEF | VT_STATIC | VT_EXTERN | VT_INLINE)))
6939 error("invalid type for '%s'",
6940 get_tok_str(v, NULL));
6941 }
6942 if (tok == ':') {
6943 next();
6944 bit_size = expr_const();
6945 /* XXX: handle v = 0 case for messages */
6946 if (bit_size < 0)
6947 error("negative width in bit-field '%s'",
6948 get_tok_str(v, NULL));
6949 if (v && bit_size == 0)
6950 error("zero width for bit-field '%s'",
6951 get_tok_str(v, NULL));
6952 }
6953 size = type_size(&type1, &align);
6954 if (ad.aligned) {
6955 if (align < ad.aligned)
6956 align = ad.aligned;
6957 } else if (ad.packed) {
6958 align = 1;
6959 } else if (*tcc_state->pack_stack_ptr) {
6960 if (align > *tcc_state->pack_stack_ptr)
6961 align = *tcc_state->pack_stack_ptr;
6962 }
6963 lbit_pos = 0;
6964 if (bit_size >= 0) {
6965 bt = type1.t & VT_BTYPE;
6966 if (bt != VT_INT &&
6967 bt != VT_BYTE &&
6968 bt != VT_SHORT &&
6969 bt != VT_BOOL &&
6970 bt != VT_ENUM &&
6971 bt != VT_LLONG)
6972 error("bitfields must have scalar type");
6973 bsize = size * 8;
6974 if (bit_size > bsize) {
6975 error("width of '%s' exceeds its type",
6976 get_tok_str(v, NULL));
6977 } else if (bit_size == bsize) {
6978 /* no need for bit fields */
6979 bit_pos = 0;
6980 } else if (bit_size == 0) {
6981 /* XXX: what to do if only padding in a
6982 structure ? */
6983 /* zero size: means to pad */
6984 bit_pos = 0;
6985 } else {
6986 /* we do not have enough room ?
6987 did the type change?
6988 is it a union? */
6989 if ((bit_pos + bit_size) > bsize ||
6990 bt != prevbt || a == TOK_UNION)
6991 bit_pos = 0;
6992 lbit_pos = bit_pos;
6993 /* XXX: handle LSB first */
6994 type1.t |= VT_BITFIELD |
6995 (bit_pos << VT_STRUCT_SHIFT) |
6996 (bit_size << (VT_STRUCT_SHIFT + 6));
6997 bit_pos += bit_size;
6998 }
6999 prevbt = bt;
7000 } else {
7001 bit_pos = 0;
7002 }
7003 if (v != 0 || (type1.t & VT_BTYPE) == VT_STRUCT) {
7004 /* add new memory data only if starting
7005 bit field */
7006 if (lbit_pos == 0) {
7007 if (a == TOK_STRUCT) {
7008 c = (c + align - 1) & -align;
7009 offset = c;
7010 if (size > 0)
7011 c += size;
7012 } else {
7013 offset = 0;
7014 if (size > c)
7015 c = size;
7016 }
7017 if (align > maxalign)
7018 maxalign = align;
7019 }
7020 #if 0
7021 printf("add field %s offset=%d",
7022 get_tok_str(v, NULL), offset);
7023 if (type1.t & VT_BITFIELD) {
7024 printf(" pos=%d size=%d",
7025 (type1.t >> VT_STRUCT_SHIFT) & 0x3f,
7026 (type1.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f);
7027 }
7028 printf("\n");
7029 #endif
7030 }
7031 if (v == 0 && (type1.t & VT_BTYPE) == VT_STRUCT) {
7032 ass = type1.ref;
7033 while ((ass = ass->next) != NULL) {
7034 ss = sym_push(ass->v, &ass->type, 0, offset + ass->c);
7035 *ps = ss;
7036 ps = &ss->next;
7037 }
7038 } else if (v) {
7039 ss = sym_push(v | SYM_FIELD, &type1, 0, offset);
7040 *ps = ss;
7041 ps = &ss->next;
7042 }
7043 if (tok == ';' || tok == TOK_EOF)
7044 break;
7045 skip(',');
7046 }
7047 skip(';');
7048 }
7049 skip('}');
7050 /* store size and alignment */
7051 s->c = (c + maxalign - 1) & -maxalign;
7052 s->r = maxalign;
7053 }
7054 }
7055 }
7056
7057 /* return 0 if no type declaration. otherwise, return the basic type
7058 and skip it.
7059 */
7060 static int parse_btype(CType *type, AttributeDef *ad)
7061 {
7062 int t, u, type_found, typespec_found, typedef_found;
7063 Sym *s;
7064 CType type1;
7065
7066 memset(ad, 0, sizeof(AttributeDef));
7067 type_found = 0;
7068 typespec_found = 0;
7069 typedef_found = 0;
7070 t = 0;
7071 while(1) {
7072 switch(tok) {
7073 case TOK_EXTENSION:
7074 /* currently, we really ignore extension */
7075 next();
7076 continue;
7077
7078 /* basic types */
7079 case TOK_CHAR:
7080 u = VT_BYTE;
7081 basic_type:
7082 next();
7083 basic_type1:
7084 if ((t & VT_BTYPE) != 0)
7085 error("too many basic types");
7086 t |= u;
7087 typespec_found = 1;
7088 break;
7089 case TOK_VOID:
7090 u = VT_VOID;
7091 goto basic_type;
7092 case TOK_SHORT:
7093 u = VT_SHORT;
7094 goto basic_type;
7095 case TOK_INT:
7096 next();
7097 typespec_found = 1;
7098 break;
7099 case TOK_LONG:
7100 next();
7101 if ((t & VT_BTYPE) == VT_DOUBLE) {
7102 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
7103 } else if ((t & VT_BTYPE) == VT_LONG) {
7104 t = (t & ~VT_BTYPE) | VT_LLONG;
7105 } else {
7106 u = VT_LONG;
7107 goto basic_type1;
7108 }
7109 break;
7110 case TOK_BOOL:
7111 u = VT_BOOL;
7112 goto basic_type;
7113 case TOK_FLOAT:
7114 u = VT_FLOAT;
7115 goto basic_type;
7116 case TOK_DOUBLE:
7117 next();
7118 if ((t & VT_BTYPE) == VT_LONG) {
7119 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
7120 } else {
7121 u = VT_DOUBLE;
7122 goto basic_type1;
7123 }
7124 break;
7125 case TOK_ENUM:
7126 struct_decl(&type1, VT_ENUM);
7127 basic_type2:
7128 u = type1.t;
7129 type->ref = type1.ref;
7130 goto basic_type1;
7131 case TOK_STRUCT:
7132 case TOK_UNION:
7133 struct_decl(&type1, VT_STRUCT);
7134 goto basic_type2;
7135
7136 /* type modifiers */
7137 case TOK_CONST1:
7138 case TOK_CONST2:
7139 case TOK_CONST3:
7140 t |= VT_CONSTANT;
7141 next();
7142 break;
7143 case TOK_VOLATILE1:
7144 case TOK_VOLATILE2:
7145 case TOK_VOLATILE3:
7146 t |= VT_VOLATILE;
7147 next();
7148 break;
7149 case TOK_SIGNED1:
7150 case TOK_SIGNED2:
7151 case TOK_SIGNED3:
7152 typespec_found = 1;
7153 t |= VT_SIGNED;
7154 next();
7155 break;
7156 case TOK_REGISTER:
7157 case TOK_AUTO:
7158 case TOK_RESTRICT1:
7159 case TOK_RESTRICT2:
7160 case TOK_RESTRICT3:
7161 next();
7162 break;
7163 case TOK_UNSIGNED:
7164 t |= VT_UNSIGNED;
7165 next();
7166 typespec_found = 1;
7167 break;
7168
7169 /* storage */
7170 case TOK_EXTERN:
7171 t |= VT_EXTERN;
7172 next();
7173 break;
7174 case TOK_STATIC:
7175 t |= VT_STATIC;
7176 next();
7177 break;
7178 case TOK_TYPEDEF:
7179 t |= VT_TYPEDEF;
7180 next();
7181 break;
7182 case TOK_INLINE1:
7183 case TOK_INLINE2:
7184 case TOK_INLINE3:
7185 t |= VT_INLINE;
7186 next();
7187 break;
7188
7189 /* GNUC attribute */
7190 case TOK_ATTRIBUTE1:
7191 case TOK_ATTRIBUTE2:
7192 parse_attribute(ad);
7193 break;
7194 /* GNUC typeof */
7195 case TOK_TYPEOF1:
7196 case TOK_TYPEOF2:
7197 case TOK_TYPEOF3:
7198 next();
7199 parse_expr_type(&type1);
7200 goto basic_type2;
7201 default:
7202 if (typespec_found || typedef_found)
7203 goto the_end;
7204 s = sym_find(tok);
7205 if (!s || !(s->type.t & VT_TYPEDEF))
7206 goto the_end;
7207 typedef_found = 1;
7208 t |= (s->type.t & ~VT_TYPEDEF);
7209 type->ref = s->type.ref;
7210 next();
7211 typespec_found = 1;
7212 break;
7213 }
7214 type_found = 1;
7215 }
7216 the_end:
7217 if ((t & (VT_SIGNED|VT_UNSIGNED)) == (VT_SIGNED|VT_UNSIGNED))
7218 error("signed and unsigned modifier");
7219 if (tcc_state->char_is_unsigned) {
7220 if ((t & (VT_SIGNED|VT_UNSIGNED|VT_BTYPE)) == VT_BYTE)
7221 t |= VT_UNSIGNED;
7222 }
7223 t &= ~VT_SIGNED;
7224
7225 /* long is never used as type */
7226 if ((t & VT_BTYPE) == VT_LONG)
7227 #ifndef TCC_TARGET_X86_64
7228 t = (t & ~VT_BTYPE) | VT_INT;
7229 #else
7230 t = (t & ~VT_BTYPE) | VT_LLONG;
7231 #endif
7232 type->t = t;
7233 return type_found;
7234 }
7235
7236 /* convert a function parameter type (array to pointer and function to
7237 function pointer) */
7238 static inline void convert_parameter_type(CType *pt)
7239 {
7240 /* remove const and volatile qualifiers (XXX: const could be used
7241 to indicate a const function parameter */
7242 pt->t &= ~(VT_CONSTANT | VT_VOLATILE);
7243 /* array must be transformed to pointer according to ANSI C */
7244 pt->t &= ~VT_ARRAY;
7245 if ((pt->t & VT_BTYPE) == VT_FUNC) {
7246 mk_pointer(pt);
7247 }
7248 }
7249
7250 static void post_type(CType *type, AttributeDef *ad)
7251 {
7252 int n, l, t1, arg_size, align;
7253 Sym **plast, *s, *first;
7254 AttributeDef ad1;
7255 CType pt;
7256
7257 if (tok == '(') {
7258 /* function declaration */
7259 next();
7260 l = 0;
7261 first = NULL;
7262 plast = &first;
7263 arg_size = 0;
7264 if (tok != ')') {
7265 for(;;) {
7266 /* read param name and compute offset */
7267 if (l != FUNC_OLD) {
7268 if (!parse_btype(&pt, &ad1)) {
7269 if (l) {
7270 error("invalid type");
7271 } else {
7272 l = FUNC_OLD;
7273 goto old_proto;
7274 }
7275 }
7276 l = FUNC_NEW;
7277 if ((pt.t & VT_BTYPE) == VT_VOID && tok == ')')
7278 break;
7279 type_decl(&pt, &ad1, &n, TYPE_DIRECT | TYPE_ABSTRACT);
7280 if ((pt.t & VT_BTYPE) == VT_VOID)
7281 error("parameter declared as void");
7282 arg_size += (type_size(&pt, &align) + 3) & ~3;
7283 } else {
7284 old_proto:
7285 n = tok;
7286 if (n < TOK_UIDENT)
7287 expect("identifier");
7288 pt.t = VT_INT;
7289 next();
7290 }
7291 convert_parameter_type(&pt);
7292 s = sym_push(n | SYM_FIELD, &pt, 0, 0);
7293 *plast = s;
7294 plast = &s->next;
7295 if (tok == ')')
7296 break;
7297 skip(',');
7298 if (l == FUNC_NEW && tok == TOK_DOTS) {
7299 l = FUNC_ELLIPSIS;
7300 next();
7301 break;
7302 }
7303 }
7304 }
7305 /* if no parameters, then old type prototype */
7306 if (l == 0)
7307 l = FUNC_OLD;
7308 skip(')');
7309 t1 = type->t & VT_STORAGE;
7310 /* NOTE: const is ignored in returned type as it has a special
7311 meaning in gcc / C++ */
7312 type->t &= ~(VT_STORAGE | VT_CONSTANT);
7313 post_type(type, ad);
7314 /* we push a anonymous symbol which will contain the function prototype */
7315 FUNC_ARGS(ad->func_attr) = arg_size;
7316 s = sym_push(SYM_FIELD, type, ad->func_attr, l);
7317 s->next = first;
7318 type->t = t1 | VT_FUNC;
7319 type->ref = s;
7320 } else if (tok == '[') {
7321 /* array definition */
7322 next();
7323 n = -1;
7324 if (tok != ']') {
7325 n = expr_const();
7326 if (n < 0)
7327 error("invalid array size");
7328 }
7329 skip(']');
7330 /* parse next post type */
7331 t1 = type->t & VT_STORAGE;
7332 type->t &= ~VT_STORAGE;
7333 post_type(type, ad);
7334
7335 /* we push a anonymous symbol which will contain the array
7336 element type */
7337 s = sym_push(SYM_FIELD, type, 0, n);
7338 type->t = t1 | VT_ARRAY | VT_PTR;
7339 type->ref = s;
7340 }
7341 }
7342
7343 /* Parse a type declaration (except basic type), and return the type
7344 in 'type'. 'td' is a bitmask indicating which kind of type decl is
7345 expected. 'type' should contain the basic type. 'ad' is the
7346 attribute definition of the basic type. It can be modified by
7347 type_decl().
7348 */
7349 static void type_decl(CType *type, AttributeDef *ad, int *v, int td)
7350 {
7351 Sym *s;
7352 CType type1, *type2;
7353 int qualifiers;
7354
7355 while (tok == '*') {
7356 qualifiers = 0;
7357 redo:
7358 next();
7359 switch(tok) {
7360 case TOK_CONST1:
7361 case TOK_CONST2:
7362 case TOK_CONST3:
7363 qualifiers |= VT_CONSTANT;
7364 goto redo;
7365 case TOK_VOLATILE1:
7366 case TOK_VOLATILE2:
7367 case TOK_VOLATILE3:
7368 qualifiers |= VT_VOLATILE;
7369 goto redo;
7370 case TOK_RESTRICT1:
7371 case TOK_RESTRICT2:
7372 case TOK_RESTRICT3:
7373 goto redo;
7374 }
7375 mk_pointer(type);
7376 type->t |= qualifiers;
7377 }
7378
7379 /* XXX: clarify attribute handling */
7380 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7381 parse_attribute(ad);
7382
7383 /* recursive type */
7384 /* XXX: incorrect if abstract type for functions (e.g. 'int ()') */
7385 type1.t = 0; /* XXX: same as int */
7386 if (tok == '(') {
7387 next();
7388 /* XXX: this is not correct to modify 'ad' at this point, but
7389 the syntax is not clear */
7390 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7391 parse_attribute(ad);
7392 type_decl(&type1, ad, v, td);
7393 skip(')');
7394 } else {
7395 /* type identifier */
7396 if (tok >= TOK_IDENT && (td & TYPE_DIRECT)) {
7397 *v = tok;
7398 next();
7399 } else {
7400 if (!(td & TYPE_ABSTRACT))
7401 expect("identifier");
7402 *v = 0;
7403 }
7404 }
7405 post_type(type, ad);
7406 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
7407 parse_attribute(ad);
7408 if (!type1.t)
7409 return;
7410 /* append type at the end of type1 */
7411 type2 = &type1;
7412 for(;;) {
7413 s = type2->ref;
7414 type2 = &s->type;
7415 if (!type2->t) {
7416 *type2 = *type;
7417 break;
7418 }
7419 }
7420 *type = type1;
7421 }
7422
7423 /* compute the lvalue VT_LVAL_xxx needed to match type t. */
7424 static int lvalue_type(int t)
7425 {
7426 int bt, r;
7427 r = VT_LVAL;
7428 bt = t & VT_BTYPE;
7429 if (bt == VT_BYTE || bt == VT_BOOL)
7430 r |= VT_LVAL_BYTE;
7431 else if (bt == VT_SHORT)
7432 r |= VT_LVAL_SHORT;
7433 else
7434 return r;
7435 if (t & VT_UNSIGNED)
7436 r |= VT_LVAL_UNSIGNED;
7437 return r;
7438 }
7439
7440 /* indirection with full error checking and bound check */
7441 static void indir(void)
7442 {
7443 if ((vtop->type.t & VT_BTYPE) != VT_PTR) {
7444 if ((vtop->type.t & VT_BTYPE) == VT_FUNC)
7445 return;
7446 expect("pointer");
7447 }
7448 if ((vtop->r & VT_LVAL) && !nocode_wanted)
7449 gv(RC_INT);
7450 vtop->type = *pointed_type(&vtop->type);
7451 /* Arrays and functions are never lvalues */
7452 if (!(vtop->type.t & VT_ARRAY)
7453 && (vtop->type.t & VT_BTYPE) != VT_FUNC) {
7454 vtop->r |= lvalue_type(vtop->type.t);
7455 /* if bound checking, the referenced pointer must be checked */
7456 if (do_bounds_check)
7457 vtop->r |= VT_MUSTBOUND;
7458 }
7459 }
7460
7461 /* pass a parameter to a function and do type checking and casting */
7462 static void gfunc_param_typed(Sym *func, Sym *arg)
7463 {
7464 int func_type;
7465 CType type;
7466
7467 func_type = func->c;
7468 if (func_type == FUNC_OLD ||
7469 (func_type == FUNC_ELLIPSIS && arg == NULL)) {
7470 /* default casting : only need to convert float to double */
7471 if ((vtop->type.t & VT_BTYPE) == VT_FLOAT) {
7472 type.t = VT_DOUBLE;
7473 gen_cast(&type);
7474 }
7475 } else if (arg == NULL) {
7476 error("too many arguments to function");
7477 } else {
7478 type = arg->type;
7479 type.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
7480 gen_assign_cast(&type);
7481 }
7482 }
7483
7484 /* parse an expression of the form '(type)' or '(expr)' and return its
7485 type */
7486 static void parse_expr_type(CType *type)
7487 {
7488 int n;
7489 AttributeDef ad;
7490
7491 skip('(');
7492 if (parse_btype(type, &ad)) {
7493 type_decl(type, &ad, &n, TYPE_ABSTRACT);
7494 } else {
7495 expr_type(type);
7496 }
7497 skip(')');
7498 }
7499
7500 static void parse_type(CType *type)
7501 {
7502 AttributeDef ad;
7503 int n;
7504
7505 if (!parse_btype(type, &ad)) {
7506 expect("type");
7507 }
7508 type_decl(type, &ad, &n, TYPE_ABSTRACT);
7509 }
7510
7511 static void vpush_tokc(int t)
7512 {
7513 CType type;
7514 type.t = t;
7515 vsetc(&type, VT_CONST, &tokc);
7516 }
7517
7518 static void unary(void)
7519 {
7520 int n, t, align, size, r;
7521 CType type;
7522 Sym *s;
7523 AttributeDef ad;
7524
7525 /* XXX: GCC 2.95.3 does not generate a table although it should be
7526 better here */
7527 tok_next:
7528 switch(tok) {
7529 case TOK_EXTENSION:
7530 next();
7531 goto tok_next;
7532 case TOK_CINT:
7533 case TOK_CCHAR:
7534 case TOK_LCHAR:
7535 vpushi(tokc.i);
7536 next();
7537 break;
7538 case TOK_CUINT:
7539 vpush_tokc(VT_INT | VT_UNSIGNED);
7540 next();
7541 break;
7542 case TOK_CLLONG:
7543 vpush_tokc(VT_LLONG);
7544 next();
7545 break;
7546 case TOK_CULLONG:
7547 vpush_tokc(VT_LLONG | VT_UNSIGNED);
7548 next();
7549 break;
7550 case TOK_CFLOAT:
7551 vpush_tokc(VT_FLOAT);
7552 next();
7553 break;
7554 case TOK_CDOUBLE:
7555 vpush_tokc(VT_DOUBLE);
7556 next();
7557 break;
7558 case TOK_CLDOUBLE:
7559 vpush_tokc(VT_LDOUBLE);
7560 next();
7561 break;
7562 case TOK___FUNCTION__:
7563 if (!gnu_ext)
7564 goto tok_identifier;
7565 /* fall thru */
7566 case TOK___FUNC__:
7567 {
7568 void *ptr;
7569 int len;
7570 /* special function name identifier */
7571 len = strlen(funcname) + 1;
7572 /* generate char[len] type */
7573 type.t = VT_BYTE;
7574 mk_pointer(&type);
7575 type.t |= VT_ARRAY;
7576 type.ref->c = len;
7577 vpush_ref(&type, data_section, data_section->data_offset, len);
7578 ptr = section_ptr_add(data_section, len);
7579 memcpy(ptr, funcname, len);
7580 next();
7581 }
7582 break;
7583 case TOK_LSTR:
7584 #ifdef TCC_TARGET_PE
7585 t = VT_SHORT | VT_UNSIGNED;
7586 #else
7587 t = VT_INT;
7588 #endif
7589 goto str_init;
7590 case TOK_STR:
7591 /* string parsing */
7592 t = VT_BYTE;
7593 str_init:
7594 if (tcc_state->warn_write_strings)
7595 t |= VT_CONSTANT;
7596 type.t = t;
7597 mk_pointer(&type);
7598 type.t |= VT_ARRAY;
7599 memset(&ad, 0, sizeof(AttributeDef));
7600 decl_initializer_alloc(&type, &ad, VT_CONST, 2, 0, 0);
7601 break;
7602 case '(':
7603 next();
7604 /* cast ? */
7605 if (parse_btype(&type, &ad)) {
7606 type_decl(&type, &ad, &n, TYPE_ABSTRACT);
7607 skip(')');
7608 /* check ISOC99 compound literal */
7609 if (tok == '{') {
7610 /* data is allocated locally by default */
7611 if (global_expr)
7612 r = VT_CONST;
7613 else
7614 r = VT_LOCAL;
7615 /* all except arrays are lvalues */
7616 if (!(type.t & VT_ARRAY))
7617 r |= lvalue_type(type.t);
7618 memset(&ad, 0, sizeof(AttributeDef));
7619 decl_initializer_alloc(&type, &ad, r, 1, 0, 0);
7620 } else {
7621 unary();
7622 gen_cast(&type);
7623 }
7624 } else if (tok == '{') {
7625 /* save all registers */
7626 save_regs(0);
7627 /* statement expression : we do not accept break/continue
7628 inside as GCC does */
7629 block(NULL, NULL, NULL, NULL, 0, 1);
7630 skip(')');
7631 } else {
7632 gexpr();
7633 skip(')');
7634 }
7635 break;
7636 case '*':
7637 next();
7638 unary();
7639 indir();
7640 break;
7641 case '&':
7642 next();
7643 unary();
7644 /* functions names must be treated as function pointers,
7645 except for unary '&' and sizeof. Since we consider that
7646 functions are not lvalues, we only have to handle it
7647 there and in function calls. */
7648 /* arrays can also be used although they are not lvalues */
7649 if ((vtop->type.t & VT_BTYPE) != VT_FUNC &&
7650 !(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_LLOCAL))
7651 test_lvalue();
7652 mk_pointer(&vtop->type);
7653 gaddrof();
7654 break;
7655 case '!':
7656 next();
7657 unary();
7658 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
7659 CType boolean;
7660 boolean.t = VT_BOOL;
7661 gen_cast(&boolean);
7662 vtop->c.i = !vtop->c.i;
7663 } else if ((vtop->r & VT_VALMASK) == VT_CMP)
7664 vtop->c.i = vtop->c.i ^ 1;
7665 else {
7666 save_regs(1);
7667 vseti(VT_JMP, gtst(1, 0));
7668 }
7669 break;
7670 case '~':
7671 next();
7672 unary();
7673 vpushi(-1);
7674 gen_op('^');
7675 break;
7676 case '+':
7677 next();
7678 /* in order to force cast, we add zero */
7679 unary();
7680 if ((vtop->type.t & VT_BTYPE) == VT_PTR)
7681 error("pointer not accepted for unary plus");
7682 vpushi(0);
7683 gen_op('+');
7684 break;
7685 case TOK_SIZEOF:
7686 case TOK_ALIGNOF1:
7687 case TOK_ALIGNOF2:
7688 t = tok;
7689 next();
7690 if (tok == '(') {
7691 parse_expr_type(&type);
7692 } else {
7693 unary_type(&type);
7694 }
7695 size = type_size(&type, &align);
7696 if (t == TOK_SIZEOF) {
7697 if (size < 0)
7698 error("sizeof applied to an incomplete type");
7699 vpushi(size);
7700 } else {
7701 vpushi(align);
7702 }
7703 vtop->type.t |= VT_UNSIGNED;
7704 break;
7705
7706 case TOK_builtin_types_compatible_p:
7707 {
7708 CType type1, type2;
7709 next();
7710 skip('(');
7711 parse_type(&type1);
7712 skip(',');
7713 parse_type(&type2);
7714 skip(')');
7715 type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
7716 type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
7717 vpushi(is_compatible_types(&type1, &type2));
7718 }
7719 break;
7720 case TOK_builtin_constant_p:
7721 {
7722 int saved_nocode_wanted, res;
7723 next();
7724 skip('(');
7725 saved_nocode_wanted = nocode_wanted;
7726 nocode_wanted = 1;
7727 gexpr();
7728 res = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
7729 vpop();
7730 nocode_wanted = saved_nocode_wanted;
7731 skip(')');
7732 vpushi(res);
7733 }
7734 break;
7735 case TOK_builtin_frame_address:
7736 {
7737 CType type;
7738 next();
7739 skip('(');
7740 if (tok != TOK_CINT) {
7741 error("__builtin_frame_address only takes integers");
7742 }
7743 if (tokc.i != 0) {
7744 error("TCC only supports __builtin_frame_address(0)");
7745 }
7746 next();
7747 skip(')');
7748 type.t = VT_VOID;
7749 mk_pointer(&type);
7750 vset(&type, VT_LOCAL, 0);
7751 }
7752 break;
7753 #ifdef TCC_TARGET_X86_64
7754 case TOK_builtin_malloc:
7755 {
7756 char *p = file->buf_ptr;
7757 file->buf_ptr = "malloc";
7758 next_nomacro1();
7759 file->buf_ptr = p;
7760 goto tok_identifier;
7761 }
7762 case TOK_builtin_free:
7763 {
7764 char *p = file->buf_ptr;
7765 file->buf_ptr = "free";
7766 next_nomacro1();
7767 file->buf_ptr = p;
7768 goto tok_identifier;
7769 }
7770 #endif
7771 case TOK_INC:
7772 case TOK_DEC:
7773 t = tok;
7774 next();
7775 unary();
7776 inc(0, t);
7777 break;
7778 case '-':
7779 next();
7780 vpushi(0);
7781 unary();
7782 gen_op('-');
7783 break;
7784 case TOK_LAND:
7785 if (!gnu_ext)
7786 goto tok_identifier;
7787 next();
7788 /* allow to take the address of a label */
7789 if (tok < TOK_UIDENT)
7790 expect("label identifier");
7791 s = label_find(tok);
7792 if (!s) {
7793 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
7794 } else {
7795 if (s->r == LABEL_DECLARED)
7796 s->r = LABEL_FORWARD;
7797 }
7798 if (!s->type.t) {
7799 s->type.t = VT_VOID;
7800 mk_pointer(&s->type);
7801 s->type.t |= VT_STATIC;
7802 }
7803 vset(&s->type, VT_CONST | VT_SYM, 0);
7804 vtop->sym = s;
7805 next();
7806 break;
7807 default:
7808 tok_identifier:
7809 t = tok;
7810 next();
7811 if (t < TOK_UIDENT)
7812 expect("identifier");
7813 s = sym_find(t);
7814 if (!s) {
7815 if (tok != '(')
7816 error("'%s' undeclared", get_tok_str(t, NULL));
7817 /* for simple function calls, we tolerate undeclared
7818 external reference to int() function */
7819 if (tcc_state->warn_implicit_function_declaration)
7820 warning("implicit declaration of function '%s'",
7821 get_tok_str(t, NULL));
7822 s = external_global_sym(t, &func_old_type, 0);
7823 }
7824 if ((s->type.t & (VT_STATIC | VT_INLINE | VT_BTYPE)) ==
7825 (VT_STATIC | VT_INLINE | VT_FUNC)) {
7826 /* if referencing an inline function, then we generate a
7827 symbol to it if not already done. It will have the
7828 effect to generate code for it at the end of the
7829 compilation unit. Inline function as always
7830 generated in the text section. */
7831 if (!s->c)
7832 put_extern_sym(s, text_section, 0, 0);
7833 r = VT_SYM | VT_CONST;
7834 } else {
7835 r = s->r;
7836 }
7837 vset(&s->type, r, s->c);
7838 /* if forward reference, we must point to s */
7839 if (vtop->r & VT_SYM) {
7840 vtop->sym = s;
7841 vtop->c.ul = 0;
7842 }
7843 break;
7844 }
7845
7846 /* post operations */
7847 while (1) {
7848 if (tok == TOK_INC || tok == TOK_DEC) {
7849 inc(1, tok);
7850 next();
7851 } else if (tok == '.' || tok == TOK_ARROW) {
7852 /* field */
7853 if (tok == TOK_ARROW)
7854 indir();
7855 test_lvalue();
7856 gaddrof();
7857 next();
7858 /* expect pointer on structure */
7859 if ((vtop->type.t & VT_BTYPE) != VT_STRUCT)
7860 expect("struct or union");
7861 s = vtop->type.ref;
7862 /* find field */
7863 tok |= SYM_FIELD;
7864 while ((s = s->next) != NULL) {
7865 if (s->v == tok)
7866 break;
7867 }
7868 if (!s)
7869 error("field not found: %s", get_tok_str(tok & ~SYM_FIELD, NULL));
7870 /* add field offset to pointer */
7871 vtop->type = char_pointer_type; /* change type to 'char *' */
7872 vpushi(s->c);
7873 gen_op('+');
7874 /* change type to field type, and set to lvalue */
7875 vtop->type = s->type;
7876 /* an array is never an lvalue */
7877 if (!(vtop->type.t & VT_ARRAY)) {
7878 vtop->r |= lvalue_type(vtop->type.t);
7879 /* if bound checking, the referenced pointer must be checked */
7880 if (do_bounds_check)
7881 vtop->r |= VT_MUSTBOUND;
7882 }
7883 next();
7884 } else if (tok == '[') {
7885 next();
7886 gexpr();
7887 gen_op('+');
7888 indir();
7889 skip(']');
7890 } else if (tok == '(') {
7891 SValue ret;
7892 Sym *sa;
7893 int nb_args;
7894
7895 /* function call */
7896 if ((vtop->type.t & VT_BTYPE) != VT_FUNC) {
7897 /* pointer test (no array accepted) */
7898 if ((vtop->type.t & (VT_BTYPE | VT_ARRAY)) == VT_PTR) {
7899 vtop->type = *pointed_type(&vtop->type);
7900 if ((vtop->type.t & VT_BTYPE) != VT_FUNC)
7901 goto error_func;
7902 } else {
7903 error_func:
7904 expect("function pointer");
7905 }
7906 } else {
7907 vtop->r &= ~VT_LVAL; /* no lvalue */
7908 }
7909 /* get return type */
7910 s = vtop->type.ref;
7911 next();
7912 sa = s->next; /* first parameter */
7913 nb_args = 0;
7914 ret.r2 = VT_CONST;
7915 /* compute first implicit argument if a structure is returned */
7916 if ((s->type.t & VT_BTYPE) == VT_STRUCT) {
7917 /* get some space for the returned structure */
7918 size = type_size(&s->type, &align);
7919 loc = (loc - size) & -align;
7920 ret.type = s->type;
7921 ret.r = VT_LOCAL | VT_LVAL;
7922 /* pass it as 'int' to avoid structure arg passing
7923 problems */
7924 vseti(VT_LOCAL, loc);
7925 ret.c = vtop->c;
7926 nb_args++;
7927 } else {
7928 ret.type = s->type;
7929 /* return in register */
7930 if (is_float(ret.type.t)) {
7931 ret.r = REG_FRET;
7932 } else {
7933 if ((ret.type.t & VT_BTYPE) == VT_LLONG)
7934 ret.r2 = REG_LRET;
7935 ret.r = REG_IRET;
7936 }
7937 ret.c.i = 0;
7938 }
7939 if (tok != ')') {
7940 for(;;) {
7941 expr_eq();
7942 gfunc_param_typed(s, sa);
7943 nb_args++;
7944 if (sa)
7945 sa = sa->next;
7946 if (tok == ')')
7947 break;
7948 skip(',');
7949 }
7950 }
7951 if (sa)
7952 error("too few arguments to function");
7953 skip(')');
7954 if (!nocode_wanted) {
7955 gfunc_call(nb_args);
7956 } else {
7957 vtop -= (nb_args + 1);
7958 }
7959 /* return value */
7960 vsetc(&ret.type, ret.r, &ret.c);
7961 vtop->r2 = ret.r2;
7962 } else {
7963 break;
7964 }
7965 }
7966 }
7967
7968 static void uneq(void)
7969 {
7970 int t;
7971
7972 unary();
7973 if (tok == '=' ||
7974 (tok >= TOK_A_MOD && tok <= TOK_A_DIV) ||
7975 tok == TOK_A_XOR || tok == TOK_A_OR ||
7976 tok == TOK_A_SHL || tok == TOK_A_SAR) {
7977 test_lvalue();
7978 t = tok;
7979 next();
7980 if (t == '=') {
7981 expr_eq();
7982 } else {
7983 vdup();
7984 expr_eq();
7985 gen_op(t & 0x7f);
7986 }
7987 vstore();
7988 }
7989 }
7990
7991 static void expr_prod(void)
7992 {
7993 int t;
7994
7995 uneq();
7996 while (tok == '*' || tok == '/' || tok == '%') {
7997 t = tok;
7998 next();
7999 uneq();
8000 gen_op(t);
8001 }
8002 }
8003
8004 static void expr_sum(void)
8005 {
8006 int t;
8007
8008 expr_prod();
8009 while (tok == '+' || tok == '-') {
8010 t = tok;
8011 next();
8012 expr_prod();
8013 gen_op(t);
8014 }
8015 }
8016
8017 static void expr_shift(void)
8018 {
8019 int t;
8020
8021 expr_sum();
8022 while (tok == TOK_SHL || tok == TOK_SAR) {
8023 t = tok;
8024 next();
8025 expr_sum();
8026 gen_op(t);
8027 }
8028 }
8029
8030 static void expr_cmp(void)
8031 {
8032 int t;
8033
8034 expr_shift();
8035 while ((tok >= TOK_ULE && tok <= TOK_GT) ||
8036 tok == TOK_ULT || tok == TOK_UGE) {
8037 t = tok;
8038 next();
8039 expr_shift();
8040 gen_op(t);
8041 }
8042 }
8043
8044 static void expr_cmpeq(void)
8045 {
8046 int t;
8047
8048 expr_cmp();
8049 while (tok == TOK_EQ || tok == TOK_NE) {
8050 t = tok;
8051 next();
8052 expr_cmp();
8053 gen_op(t);
8054 }
8055 }
8056
8057 static void expr_and(void)
8058 {
8059 expr_cmpeq();
8060 while (tok == '&') {
8061 next();
8062 expr_cmpeq();
8063 gen_op('&');
8064 }
8065 }
8066
8067 static void expr_xor(void)
8068 {
8069 expr_and();
8070 while (tok == '^') {
8071 next();
8072 expr_and();
8073 gen_op('^');
8074 }
8075 }
8076
8077 static void expr_or(void)
8078 {
8079 expr_xor();
8080 while (tok == '|') {
8081 next();
8082 expr_xor();
8083 gen_op('|');
8084 }
8085 }
8086
8087 /* XXX: fix this mess */
8088 static void expr_land_const(void)
8089 {
8090 expr_or();
8091 while (tok == TOK_LAND) {
8092 next();
8093 expr_or();
8094 gen_op(TOK_LAND);
8095 }
8096 }
8097
8098 /* XXX: fix this mess */
8099 static void expr_lor_const(void)
8100 {
8101 expr_land_const();
8102 while (tok == TOK_LOR) {
8103 next();
8104 expr_land_const();
8105 gen_op(TOK_LOR);
8106 }
8107 }
8108
8109 /* only used if non constant */
8110 static void expr_land(void)
8111 {
8112 int t;
8113
8114 expr_or();
8115 if (tok == TOK_LAND) {
8116 t = 0;
8117 save_regs(1);
8118 for(;;) {
8119 t = gtst(1, t);
8120 if (tok != TOK_LAND) {
8121 vseti(VT_JMPI, t);
8122 break;
8123 }
8124 next();
8125 expr_or();
8126 }
8127 }
8128 }
8129
8130 static void expr_lor(void)
8131 {
8132 int t;
8133
8134 expr_land();
8135 if (tok == TOK_LOR) {
8136 t = 0;
8137 save_regs(1);
8138 for(;;) {
8139 t = gtst(0, t);
8140 if (tok != TOK_LOR) {
8141 vseti(VT_JMP, t);
8142 break;
8143 }
8144 next();
8145 expr_land();
8146 }
8147 }
8148 }
8149
8150 /* XXX: better constant handling */
8151 static void expr_eq(void)
8152 {
8153 int tt, u, r1, r2, rc, t1, t2, bt1, bt2;
8154 SValue sv;
8155 CType type, type1, type2;
8156
8157 if (const_wanted) {
8158 expr_lor_const();
8159 if (tok == '?') {
8160 CType boolean;
8161 int c;
8162 boolean.t = VT_BOOL;
8163 vdup();
8164 gen_cast(&boolean);
8165 c = vtop->c.i;
8166 vpop();
8167 next();
8168 if (tok != ':' || !gnu_ext) {
8169 vpop();
8170 gexpr();
8171 }
8172 if (!c)
8173 vpop();
8174 skip(':');
8175 expr_eq();
8176 if (c)
8177 vpop();
8178 }
8179 } else {
8180 expr_lor();
8181 if (tok == '?') {
8182 next();
8183 if (vtop != vstack) {
8184 /* needed to avoid having different registers saved in
8185 each branch */
8186 if (is_float(vtop->type.t)) {
8187 rc = RC_FLOAT;
8188 #ifdef TCC_TARGET_X86_64
8189 if ((vtop->type.t & VT_BTYPE) == VT_LDOUBLE) {
8190 rc = RC_ST0;
8191 }
8192 #endif
8193 }
8194 else
8195 rc = RC_INT;
8196 gv(rc);
8197 save_regs(1);
8198 }
8199 if (tok == ':' && gnu_ext) {
8200 gv_dup();
8201 tt = gtst(1, 0);
8202 } else {
8203 tt = gtst(1, 0);
8204 gexpr();
8205 }
8206 type1 = vtop->type;
8207 sv = *vtop; /* save value to handle it later */
8208 vtop--; /* no vpop so that FP stack is not flushed */
8209 skip(':');
8210 u = gjmp(0);
8211 gsym(tt);
8212 expr_eq();
8213 type2 = vtop->type;
8214
8215 t1 = type1.t;
8216 bt1 = t1 & VT_BTYPE;
8217 t2 = type2.t;
8218 bt2 = t2 & VT_BTYPE;
8219 /* cast operands to correct type according to ISOC rules */
8220 if (is_float(bt1) || is_float(bt2)) {
8221 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
8222 type.t = VT_LDOUBLE;
8223 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
8224 type.t = VT_DOUBLE;
8225 } else {
8226 type.t = VT_FLOAT;
8227 }
8228 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
8229 /* cast to biggest op */
8230 type.t = VT_LLONG;
8231 /* convert to unsigned if it does not fit in a long long */
8232 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
8233 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
8234 type.t |= VT_UNSIGNED;
8235 } else if (bt1 == VT_PTR || bt2 == VT_PTR) {
8236 /* XXX: test pointer compatibility */
8237 type = type1;
8238 } else if (bt1 == VT_FUNC || bt2 == VT_FUNC) {
8239 /* XXX: test function pointer compatibility */
8240 type = type1;
8241 } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) {
8242 /* XXX: test structure compatibility */
8243 type = type1;
8244 } else if (bt1 == VT_VOID || bt2 == VT_VOID) {
8245 /* NOTE: as an extension, we accept void on only one side */
8246 type.t = VT_VOID;
8247 } else {
8248 /* integer operations */
8249 type.t = VT_INT;
8250 /* convert to unsigned if it does not fit in an integer */
8251 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
8252 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
8253 type.t |= VT_UNSIGNED;
8254 }
8255
8256 /* now we convert second operand */
8257 gen_cast(&type);
8258 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
8259 gaddrof();
8260 rc = RC_INT;
8261 if (is_float(type.t)) {
8262 rc = RC_FLOAT;
8263 #ifdef TCC_TARGET_X86_64
8264 if ((type.t & VT_BTYPE) == VT_LDOUBLE) {
8265 rc = RC_ST0;
8266 }
8267 #endif
8268 } else if ((type.t & VT_BTYPE) == VT_LLONG) {
8269 /* for long longs, we use fixed registers to avoid having
8270 to handle a complicated move */
8271 rc = RC_IRET;
8272 }
8273
8274 r2 = gv(rc);
8275 /* this is horrible, but we must also convert first
8276 operand */
8277 tt = gjmp(0);
8278 gsym(u);
8279 /* put again first value and cast it */
8280 *vtop = sv;
8281 gen_cast(&type);
8282 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
8283 gaddrof();
8284 r1 = gv(rc);
8285 move_reg(r2, r1);
8286 vtop->r = r2;
8287 gsym(tt);
8288 }
8289 }
8290 }
8291
8292 static void gexpr(void)
8293 {
8294 while (1) {
8295 expr_eq();
8296 if (tok != ',')
8297 break;
8298 vpop();
8299 next();
8300 }
8301 }
8302
8303 /* parse an expression and return its type without any side effect. */
8304 static void expr_type(CType *type)
8305 {
8306 int saved_nocode_wanted;
8307
8308 saved_nocode_wanted = nocode_wanted;
8309 nocode_wanted = 1;
8310 gexpr();
8311 *type = vtop->type;
8312 vpop();
8313 nocode_wanted = saved_nocode_wanted;
8314 }
8315
8316 /* parse a unary expression and return its type without any side
8317 effect. */
8318 static void unary_type(CType *type)
8319 {
8320 int a;
8321
8322 a = nocode_wanted;
8323 nocode_wanted = 1;
8324 unary();
8325 *type = vtop->type;
8326 vpop();
8327 nocode_wanted = a;
8328 }
8329
8330 /* parse a constant expression and return value in vtop. */
8331 static void expr_const1(void)
8332 {
8333 int a;
8334 a = const_wanted;
8335 const_wanted = 1;
8336 expr_eq();
8337 const_wanted = a;
8338 }
8339
8340 /* parse an integer constant and return its value. */
8341 static int expr_const(void)
8342 {
8343 int c;
8344 expr_const1();
8345 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
8346 expect("constant expression");
8347 c = vtop->c.i;
8348 vpop();
8349 return c;
8350 }
8351
8352 /* return the label token if current token is a label, otherwise
8353 return zero */
8354 static int is_label(void)
8355 {
8356 int last_tok;
8357
8358 /* fast test first */
8359 if (tok < TOK_UIDENT)
8360 return 0;
8361 /* no need to save tokc because tok is an identifier */
8362 last_tok = tok;
8363 next();
8364 if (tok == ':') {
8365 next();
8366 return last_tok;
8367 } else {
8368 unget_tok(last_tok);
8369 return 0;
8370 }
8371 }
8372
8373 static void block(int *bsym, int *csym, int *case_sym, int *def_sym,
8374 int case_reg, int is_expr)
8375 {
8376 int a, b, c, d;
8377 Sym *s;
8378
8379 /* generate line number info */
8380 if (do_debug &&
8381 (last_line_num != file->line_num || last_ind != ind)) {
8382 put_stabn(N_SLINE, 0, file->line_num, ind - func_ind);
8383 last_ind = ind;
8384 last_line_num = file->line_num;
8385 }
8386
8387 if (is_expr) {
8388 /* default return value is (void) */
8389 vpushi(0);
8390 vtop->type.t = VT_VOID;
8391 }
8392
8393 if (tok == TOK_IF) {
8394 /* if test */
8395 next();
8396 skip('(');
8397 gexpr();
8398 skip(')');
8399 a = gtst(1, 0);
8400 block(bsym, csym, case_sym, def_sym, case_reg, 0);
8401 c = tok;
8402 if (c == TOK_ELSE) {
8403 next();
8404 d = gjmp(0);
8405 gsym(a);
8406 block(bsym, csym, case_sym, def_sym, case_reg, 0);
8407 gsym(d); /* patch else jmp */
8408 } else
8409 gsym(a);
8410 } else if (tok == TOK_WHILE) {
8411 next();
8412 d = ind;
8413 skip('(');
8414 gexpr();
8415 skip(')');
8416 a = gtst(1, 0);
8417 b = 0;
8418 block(&a, &b, case_sym, def_sym, case_reg, 0);
8419 gjmp_addr(d);
8420 gsym(a);
8421 gsym_addr(b, d);
8422 } else if (tok == '{') {
8423 Sym *llabel;
8424
8425 next();
8426 /* record local declaration stack position */
8427 s = local_stack;
8428 llabel = local_label_stack;
8429 /* handle local labels declarations */
8430 if (tok == TOK_LABEL) {
8431 next();
8432 for(;;) {
8433 if (tok < TOK_UIDENT)
8434 expect("label identifier");
8435 label_push(&local_label_stack, tok, LABEL_DECLARED);
8436 next();
8437 if (tok == ',') {
8438 next();
8439 } else {
8440 skip(';');
8441 break;
8442 }
8443 }
8444 }
8445 while (tok != '}') {
8446 decl(VT_LOCAL);
8447 if (tok != '}') {
8448 if (is_expr)
8449 vpop();
8450 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
8451 }
8452 }
8453 /* pop locally defined labels */
8454 label_pop(&local_label_stack, llabel);
8455 /* pop locally defined symbols */
8456 if(is_expr) {
8457 /* XXX: this solution makes only valgrind happy...
8458 triggered by gcc.c-torture/execute/20000917-1.c */
8459 Sym *p;
8460 switch(vtop->type.t & VT_BTYPE) {
8461 case VT_PTR:
8462 case VT_STRUCT:
8463 case VT_ENUM:
8464 case VT_FUNC:
8465 for(p=vtop->type.ref;p;p=p->prev)
8466 if(p->prev==s)
8467 error("unsupported expression type");
8468 }
8469 }
8470 sym_pop(&local_stack, s);
8471 next();
8472 } else if (tok == TOK_RETURN) {
8473 next();
8474 if (tok != ';') {
8475 gexpr();
8476 gen_assign_cast(&func_vt);
8477 if ((func_vt.t & VT_BTYPE) == VT_STRUCT) {
8478 CType type;
8479 /* if returning structure, must copy it to implicit
8480 first pointer arg location */
8481 #ifdef TCC_ARM_EABI
8482 int align, size;
8483 size = type_size(&func_vt,&align);
8484 if(size <= 4)
8485 {
8486 if((vtop->r != (VT_LOCAL | VT_LVAL) || (vtop->c.i & 3))
8487 && (align & 3))
8488 {
8489 int addr;
8490 loc = (loc - size) & -4;
8491 addr = loc;
8492 type = func_vt;
8493 vset(&type, VT_LOCAL | VT_LVAL, addr);
8494 vswap();
8495 vstore();
8496 vset(&int_type, VT_LOCAL | VT_LVAL, addr);
8497 }
8498 vtop->type = int_type;
8499 gv(RC_IRET);
8500 } else {
8501 #endif
8502 type = func_vt;
8503 mk_pointer(&type);
8504 vset(&type, VT_LOCAL | VT_LVAL, func_vc);
8505 indir();
8506 vswap();
8507 /* copy structure value to pointer */
8508 vstore();
8509 #ifdef TCC_ARM_EABI
8510 }
8511 #endif
8512 } else if (is_float(func_vt.t)) {
8513 gv(RC_FRET);
8514 } else {
8515 gv(RC_IRET);
8516 }
8517 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
8518 }
8519 skip(';');
8520 rsym = gjmp(rsym); /* jmp */
8521 } else if (tok == TOK_BREAK) {
8522 /* compute jump */
8523 if (!bsym)
8524 error("cannot break");
8525 *bsym = gjmp(*bsym);
8526 next();
8527 skip(';');
8528 } else if (tok == TOK_CONTINUE) {
8529 /* compute jump */
8530 if (!csym)
8531 error("cannot continue");
8532 *csym = gjmp(*csym);
8533 next();
8534 skip(';');
8535 } else if (tok == TOK_FOR) {
8536 int e;
8537 next();
8538 skip('(');
8539 if (tok != ';') {
8540 gexpr();
8541 vpop();
8542 }
8543 skip(';');
8544 d = ind;
8545 c = ind;
8546 a = 0;
8547 b = 0;
8548 if (tok != ';') {
8549 gexpr();
8550 a = gtst(1, 0);
8551 }
8552 skip(';');
8553 if (tok != ')') {
8554 e = gjmp(0);
8555 c = ind;
8556 gexpr();
8557 vpop();
8558 gjmp_addr(d);
8559 gsym(e);
8560 }
8561 skip(')');
8562 block(&a, &b, case_sym, def_sym, case_reg, 0);
8563 gjmp_addr(c);
8564 gsym(a);
8565 gsym_addr(b, c);
8566 } else
8567 if (tok == TOK_DO) {
8568 next();
8569 a = 0;
8570 b = 0;
8571 d = ind;
8572 block(&a, &b, case_sym, def_sym, case_reg, 0);
8573 skip(TOK_WHILE);
8574 skip('(');
8575 gsym(b);
8576 gexpr();
8577 c = gtst(0, 0);
8578 gsym_addr(c, d);
8579 skip(')');
8580 gsym(a);
8581 skip(';');
8582 } else
8583 if (tok == TOK_SWITCH) {
8584 next();
8585 skip('(');
8586 gexpr();
8587 /* XXX: other types than integer */
8588 case_reg = gv(RC_INT);
8589 vpop();
8590 skip(')');
8591 a = 0;
8592 b = gjmp(0); /* jump to first case */
8593 c = 0;
8594 block(&a, csym, &b, &c, case_reg, 0);
8595 /* if no default, jmp after switch */
8596 if (c == 0)
8597 c = ind;
8598 /* default label */
8599 gsym_addr(b, c);
8600 /* break label */
8601 gsym(a);
8602 } else
8603 if (tok == TOK_CASE) {
8604 int v1, v2;
8605 if (!case_sym)
8606 expect("switch");
8607 next();
8608 v1 = expr_const();
8609 v2 = v1;
8610 if (gnu_ext && tok == TOK_DOTS) {
8611 next();
8612 v2 = expr_const();
8613 if (v2 < v1)
8614 warning("empty case range");
8615 }
8616 /* since a case is like a label, we must skip it with a jmp */
8617 b = gjmp(0);
8618 gsym(*case_sym);
8619 vseti(case_reg, 0);
8620 vpushi(v1);
8621 if (v1 == v2) {
8622 gen_op(TOK_EQ);
8623 *case_sym = gtst(1, 0);
8624 } else {
8625 gen_op(TOK_GE);
8626 *case_sym = gtst(1, 0);
8627 vseti(case_reg, 0);
8628 vpushi(v2);
8629 gen_op(TOK_LE);
8630 *case_sym = gtst(1, *case_sym);
8631 }
8632 gsym(b);
8633 skip(':');
8634 is_expr = 0;
8635 goto block_after_label;
8636 } else
8637 if (tok == TOK_DEFAULT) {
8638 next();
8639 skip(':');
8640 if (!def_sym)
8641 expect("switch");
8642 if (*def_sym)
8643 error("too many 'default'");
8644 *def_sym = ind;
8645 is_expr = 0;
8646 goto block_after_label;
8647 } else
8648 if (tok == TOK_GOTO) {
8649 next();
8650 if (tok == '*' && gnu_ext) {
8651 /* computed goto */
8652 next();
8653 gexpr();
8654 if ((vtop->type.t & VT_BTYPE) != VT_PTR)
8655 expect("pointer");
8656 ggoto();
8657 } else if (tok >= TOK_UIDENT) {
8658 s = label_find(tok);
8659 /* put forward definition if needed */
8660 if (!s) {
8661 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
8662 } else {
8663 if (s->r == LABEL_DECLARED)
8664 s->r = LABEL_FORWARD;
8665 }
8666 /* label already defined */
8667 if (s->r & LABEL_FORWARD)
8668 s->next = (void *)gjmp((long)s->next);
8669 else
8670 gjmp_addr((long)s->next);
8671 next();
8672 } else {
8673 expect("label identifier");
8674 }
8675 skip(';');
8676 } else if (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3) {
8677 asm_instr();
8678 } else {
8679 b = is_label();
8680 if (b) {
8681 /* label case */
8682 s = label_find(b);
8683 if (s) {
8684 if (s->r == LABEL_DEFINED)
8685 error("duplicate label '%s'", get_tok_str(s->v, NULL));
8686 gsym((long)s->next);
8687 s->r = LABEL_DEFINED;
8688 } else {
8689 s = label_push(&global_label_stack, b, LABEL_DEFINED);
8690 }
8691 s->next = (void *)ind;
8692 /* we accept this, but it is a mistake */
8693 block_after_label:
8694 if (tok == '}') {
8695 warning("deprecated use of label at end of compound statement");
8696 } else {
8697 if (is_expr)
8698 vpop();
8699 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
8700 }
8701 } else {
8702 /* expression case */
8703 if (tok != ';') {
8704 if (is_expr) {
8705 vpop();
8706 gexpr();
8707 } else {
8708 gexpr();
8709 vpop();
8710 }
8711 }
8712 skip(';');
8713 }
8714 }
8715 }
8716
8717 /* t is the array or struct type. c is the array or struct
8718 address. cur_index/cur_field is the pointer to the current
8719 value. 'size_only' is true if only size info is needed (only used
8720 in arrays) */
8721 static void decl_designator(CType *type, Section *sec, unsigned long c,
8722 int *cur_index, Sym **cur_field,
8723 int size_only)
8724 {
8725 Sym *s, *f;
8726 int notfirst, index, index_last, align, l, nb_elems, elem_size;
8727 CType type1;
8728
8729 notfirst = 0;
8730 elem_size = 0;
8731 nb_elems = 1;
8732 if (gnu_ext && (l = is_label()) != 0)
8733 goto struct_field;
8734 while (tok == '[' || tok == '.') {
8735 if (tok == '[') {
8736 if (!(type->t & VT_ARRAY))
8737 expect("array type");
8738 s = type->ref;
8739 next();
8740 index = expr_const();
8741 if (index < 0 || (s->c >= 0 && index >= s->c))
8742 expect("invalid index");
8743 if (tok == TOK_DOTS && gnu_ext) {
8744 next();
8745 index_last = expr_const();
8746 if (index_last < 0 ||
8747 (s->c >= 0 && index_last >= s->c) ||
8748 index_last < index)
8749 expect("invalid index");
8750 } else {
8751 index_last = index;
8752 }
8753 skip(']');
8754 if (!notfirst)
8755 *cur_index = index_last;
8756 type = pointed_type(type);
8757 elem_size = type_size(type, &align);
8758 c += index * elem_size;
8759 /* NOTE: we only support ranges for last designator */
8760 nb_elems = index_last - index + 1;
8761 if (nb_elems != 1) {
8762 notfirst = 1;
8763 break;
8764 }
8765 } else {
8766 next();
8767 l = tok;
8768 next();
8769 struct_field:
8770 if ((type->t & VT_BTYPE) != VT_STRUCT)
8771 expect("struct/union type");
8772 s = type->ref;
8773 l |= SYM_FIELD;
8774 f = s->next;
8775 while (f) {
8776 if (f->v == l)
8777 break;
8778 f = f->next;
8779 }
8780 if (!f)
8781 expect("field");
8782 if (!notfirst)
8783 *cur_field = f;
8784 /* XXX: fix this mess by using explicit storage field */
8785 type1 = f->type;
8786 type1.t |= (type->t & ~VT_TYPE);
8787 type = &type1;
8788 c += f->c;
8789 }
8790 notfirst = 1;
8791 }
8792 if (notfirst) {
8793 if (tok == '=') {
8794 next();
8795 } else {
8796 if (!gnu_ext)
8797 expect("=");
8798 }
8799 } else {
8800 if (type->t & VT_ARRAY) {
8801 index = *cur_index;
8802 type = pointed_type(type);
8803 c += index * type_size(type, &align);
8804 } else {
8805 f = *cur_field;
8806 if (!f)
8807 error("too many field init");
8808 /* XXX: fix this mess by using explicit storage field */
8809 type1 = f->type;
8810 type1.t |= (type->t & ~VT_TYPE);
8811 type = &type1;
8812 c += f->c;
8813 }
8814 }
8815 decl_initializer(type, sec, c, 0, size_only);
8816
8817 /* XXX: make it more general */
8818 if (!size_only && nb_elems > 1) {
8819 unsigned long c_end;
8820 uint8_t *src, *dst;
8821 int i;
8822
8823 if (!sec)
8824 error("range init not supported yet for dynamic storage");
8825 c_end = c + nb_elems * elem_size;
8826 if (c_end > sec->data_allocated)
8827 section_realloc(sec, c_end);
8828 src = sec->data + c;
8829 dst = src;
8830 for(i = 1; i < nb_elems; i++) {
8831 dst += elem_size;
8832 memcpy(dst, src, elem_size);
8833 }
8834 }
8835 }
8836
8837 #define EXPR_VAL 0
8838 #define EXPR_CONST 1
8839 #define EXPR_ANY 2
8840
8841 /* store a value or an expression directly in global data or in local array */
8842 static void init_putv(CType *type, Section *sec, unsigned long c,
8843 int v, int expr_type)
8844 {
8845 int saved_global_expr, bt, bit_pos, bit_size;
8846 void *ptr;
8847 unsigned long long bit_mask;
8848 CType dtype;
8849
8850 switch(expr_type) {
8851 case EXPR_VAL:
8852 vpushi(v);
8853 break;
8854 case EXPR_CONST:
8855 /* compound literals must be allocated globally in this case */
8856 saved_global_expr = global_expr;
8857 global_expr = 1;
8858 expr_const1();
8859 global_expr = saved_global_expr;
8860 /* NOTE: symbols are accepted */
8861 if ((vtop->r & (VT_VALMASK | VT_LVAL)) != VT_CONST)
8862 error("initializer element is not constant");
8863 break;
8864 case EXPR_ANY:
8865 expr_eq();
8866 break;
8867 }
8868
8869 dtype = *type;
8870 dtype.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
8871
8872 if (sec) {
8873 /* XXX: not portable */
8874 /* XXX: generate error if incorrect relocation */
8875 gen_assign_cast(&dtype);
8876 bt = type->t & VT_BTYPE;
8877 /* we'll write at most 12 bytes */
8878 if (c + 12 > sec->data_allocated) {
8879 section_realloc(sec, c + 12);
8880 }
8881 ptr = sec->data + c;
8882 /* XXX: make code faster ? */
8883 if (!(type->t & VT_BITFIELD)) {
8884 bit_pos = 0;
8885 bit_size = 32;
8886 bit_mask = -1LL;
8887 } else {
8888 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
8889 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
8890 bit_mask = (1LL << bit_size) - 1;
8891 }
8892 if ((vtop->r & VT_SYM) &&
8893 (bt == VT_BYTE ||
8894 bt == VT_SHORT ||
8895 bt == VT_DOUBLE ||
8896 bt == VT_LDOUBLE ||
8897 bt == VT_LLONG ||
8898 (bt == VT_INT && bit_size != 32)))
8899 error("initializer element is not computable at load time");
8900 switch(bt) {
8901 case VT_BOOL:
8902 vtop->c.i = (vtop->c.i != 0);
8903 case VT_BYTE:
8904 *(char *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8905 break;
8906 case VT_SHORT:
8907 *(short *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8908 break;
8909 case VT_DOUBLE:
8910 *(double *)ptr = vtop->c.d;
8911 break;
8912 case VT_LDOUBLE:
8913 *(long double *)ptr = vtop->c.ld;
8914 break;
8915 case VT_LLONG:
8916 *(long long *)ptr |= (vtop->c.ll & bit_mask) << bit_pos;
8917 break;
8918 default:
8919 if (vtop->r & VT_SYM) {
8920 greloc(sec, vtop->sym, c, R_DATA_32);
8921 }
8922 *(int *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
8923 break;
8924 }
8925 vtop--;
8926 } else {
8927 vset(&dtype, VT_LOCAL|VT_LVAL, c);
8928 vswap();
8929 vstore();
8930 vpop();
8931 }
8932 }
8933
8934 /* put zeros for variable based init */
8935 static void init_putz(CType *t, Section *sec, unsigned long c, int size)
8936 {
8937 if (sec) {
8938 /* nothing to do because globals are already set to zero */
8939 } else {
8940 vpush_global_sym(&func_old_type, TOK_memset);
8941 vseti(VT_LOCAL, c);
8942 vpushi(0);
8943 vpushi(size);
8944 gfunc_call(3);
8945 }
8946 }
8947
8948 /* 't' contains the type and storage info. 'c' is the offset of the
8949 object in section 'sec'. If 'sec' is NULL, it means stack based
8950 allocation. 'first' is true if array '{' must be read (multi
8951 dimension implicit array init handling). 'size_only' is true if
8952 size only evaluation is wanted (only for arrays). */
8953 static void decl_initializer(CType *type, Section *sec, unsigned long c,
8954 int first, int size_only)
8955 {
8956 int index, array_length, n, no_oblock, nb, parlevel, i;
8957 int size1, align1, expr_type;
8958 Sym *s, *f;
8959 CType *t1;
8960
8961 if (type->t & VT_ARRAY) {
8962 s = type->ref;
8963 n = s->c;
8964 array_length = 0;
8965 t1 = pointed_type(type);
8966 size1 = type_size(t1, &align1);
8967
8968 no_oblock = 1;
8969 if ((first && tok != TOK_LSTR && tok != TOK_STR) ||
8970 tok == '{') {
8971 skip('{');
8972 no_oblock = 0;
8973 }
8974
8975 /* only parse strings here if correct type (otherwise: handle
8976 them as ((w)char *) expressions */
8977 if ((tok == TOK_LSTR &&
8978 #ifdef TCC_TARGET_PE
8979 (t1->t & VT_BTYPE) == VT_SHORT && (t1->t & VT_UNSIGNED)
8980 #else
8981 (t1->t & VT_BTYPE) == VT_INT
8982 #endif
8983 ) || (tok == TOK_STR && (t1->t & VT_BTYPE) == VT_BYTE)) {
8984 while (tok == TOK_STR || tok == TOK_LSTR) {
8985 int cstr_len, ch;
8986 CString *cstr;
8987
8988 cstr = tokc.cstr;
8989 /* compute maximum number of chars wanted */
8990 if (tok == TOK_STR)
8991 cstr_len = cstr->size;
8992 else
8993 cstr_len = cstr->size / sizeof(nwchar_t);
8994 cstr_len--;
8995 nb = cstr_len;
8996 if (n >= 0 && nb > (n - array_length))
8997 nb = n - array_length;
8998 if (!size_only) {
8999 if (cstr_len > nb)
9000 warning("initializer-string for array is too long");
9001 /* in order to go faster for common case (char
9002 string in global variable, we handle it
9003 specifically */
9004 if (sec && tok == TOK_STR && size1 == 1) {
9005 memcpy(sec->data + c + array_length, cstr->data, nb);
9006 } else {
9007 for(i=0;i<nb;i++) {
9008 if (tok == TOK_STR)
9009 ch = ((unsigned char *)cstr->data)[i];
9010 else
9011 ch = ((nwchar_t *)cstr->data)[i];
9012 init_putv(t1, sec, c + (array_length + i) * size1,
9013 ch, EXPR_VAL);
9014 }
9015 }
9016 }
9017 array_length += nb;
9018 next();
9019 }
9020 /* only add trailing zero if enough storage (no
9021 warning in this case since it is standard) */
9022 if (n < 0 || array_length < n) {
9023 if (!size_only) {
9024 init_putv(t1, sec, c + (array_length * size1), 0, EXPR_VAL);
9025 }
9026 array_length++;
9027 }
9028 } else {
9029 index = 0;
9030 while (tok != '}') {
9031 decl_designator(type, sec, c, &index, NULL, size_only);
9032 if (n >= 0 && index >= n)
9033 error("index too large");
9034 /* must put zero in holes (note that doing it that way
9035 ensures that it even works with designators) */
9036 if (!size_only && array_length < index) {
9037 init_putz(t1, sec, c + array_length * size1,
9038 (index - array_length) * size1);
9039 }
9040 index++;
9041 if (index > array_length)
9042 array_length = index;
9043 /* special test for multi dimensional arrays (may not
9044 be strictly correct if designators are used at the
9045 same time) */
9046 if (index >= n && no_oblock)
9047 break;
9048 if (tok == '}')
9049 break;
9050 skip(',');
9051 }
9052 }
9053 if (!no_oblock)
9054 skip('}');
9055 /* put zeros at the end */
9056 if (!size_only && n >= 0 && array_length < n) {
9057 init_putz(t1, sec, c + array_length * size1,
9058 (n - array_length) * size1);
9059 }
9060 /* patch type size if needed */
9061 if (n < 0)
9062 s->c = array_length;
9063 } else if ((type->t & VT_BTYPE) == VT_STRUCT &&
9064 (sec || !first || tok == '{')) {
9065 int par_count;
9066
9067 /* NOTE: the previous test is a specific case for automatic
9068 struct/union init */
9069 /* XXX: union needs only one init */
9070
9071 /* XXX: this test is incorrect for local initializers
9072 beginning with ( without {. It would be much more difficult
9073 to do it correctly (ideally, the expression parser should
9074 be used in all cases) */
9075 par_count = 0;
9076 if (tok == '(') {
9077 AttributeDef ad1;
9078 CType type1;
9079 next();
9080 while (tok == '(') {
9081 par_count++;
9082 next();
9083 }
9084 if (!parse_btype(&type1, &ad1))
9085 expect("cast");
9086 type_decl(&type1, &ad1, &n, TYPE_ABSTRACT);
9087 #if 0
9088 if (!is_assignable_types(type, &type1))
9089 error("invalid type for cast");
9090 #endif
9091 skip(')');
9092 }
9093 no_oblock = 1;
9094 if (first || tok == '{') {
9095 skip('{');
9096 no_oblock = 0;
9097 }
9098 s = type->ref;
9099 f = s->next;
9100 array_length = 0;
9101 index = 0;
9102 n = s->c;
9103 while (tok != '}') {
9104 decl_designator(type, sec, c, NULL, &f, size_only);
9105 index = f->c;
9106 if (!size_only && array_length < index) {
9107 init_putz(type, sec, c + array_length,
9108 index - array_length);
9109 }
9110 index = index + type_size(&f->type, &align1);
9111 if (index > array_length)
9112 array_length = index;
9113 f = f->next;
9114 if (no_oblock && f == NULL)
9115 break;
9116 if (tok == '}')
9117 break;
9118 skip(',');
9119 }
9120 /* put zeros at the end */
9121 if (!size_only && array_length < n) {
9122 init_putz(type, sec, c + array_length,
9123 n - array_length);
9124 }
9125 if (!no_oblock)
9126 skip('}');
9127 while (par_count) {
9128 skip(')');
9129 par_count--;
9130 }
9131 } else if (tok == '{') {
9132 next();
9133 decl_initializer(type, sec, c, first, size_only);
9134 skip('}');
9135 } else if (size_only) {
9136 /* just skip expression */
9137 parlevel = 0;
9138 while ((parlevel > 0 || (tok != '}' && tok != ',')) &&
9139 tok != -1) {
9140 if (tok == '(')
9141 parlevel++;
9142 else if (tok == ')')
9143 parlevel--;
9144 next();
9145 }
9146 } else {
9147 /* currently, we always use constant expression for globals
9148 (may change for scripting case) */
9149 expr_type = EXPR_CONST;
9150 if (!sec)
9151 expr_type = EXPR_ANY;
9152 init_putv(type, sec, c, 0, expr_type);
9153 }
9154 }
9155
9156 /* parse an initializer for type 't' if 'has_init' is non zero, and
9157 allocate space in local or global data space ('r' is either
9158 VT_LOCAL or VT_CONST). If 'v' is non zero, then an associated
9159 variable 'v' of scope 'scope' is declared before initializers are
9160 parsed. If 'v' is zero, then a reference to the new object is put
9161 in the value stack. If 'has_init' is 2, a special parsing is done
9162 to handle string constants. */
9163 static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r,
9164 int has_init, int v, int scope)
9165 {
9166 int size, align, addr, data_offset;
9167 int level;
9168 ParseState saved_parse_state;
9169 TokenString init_str;
9170 Section *sec;
9171
9172 size = type_size(type, &align);
9173 /* If unknown size, we must evaluate it before
9174 evaluating initializers because
9175 initializers can generate global data too
9176 (e.g. string pointers or ISOC99 compound
9177 literals). It also simplifies local
9178 initializers handling */
9179 tok_str_new(&init_str);
9180 if (size < 0) {
9181 if (!has_init)
9182 error("unknown type size");
9183 /* get all init string */
9184 if (has_init == 2) {
9185 /* only get strings */
9186 while (tok == TOK_STR || tok == TOK_LSTR) {
9187 tok_str_add_tok(&init_str);
9188 next();
9189 }
9190 } else {
9191 level = 0;
9192 while (level > 0 || (tok != ',' && tok != ';')) {
9193 if (tok < 0)
9194 error("unexpected end of file in initializer");
9195 tok_str_add_tok(&init_str);
9196 if (tok == '{')
9197 level++;
9198 else if (tok == '}') {
9199 level--;
9200 if (level <= 0) {
9201 next();
9202 break;
9203 }
9204 }
9205 next();
9206 }
9207 }
9208 tok_str_add(&init_str, -1);
9209 tok_str_add(&init_str, 0);
9210
9211 /* compute size */
9212 save_parse_state(&saved_parse_state);
9213
9214 macro_ptr = init_str.str;
9215 next();
9216 decl_initializer(type, NULL, 0, 1, 1);
9217 /* prepare second initializer parsing */
9218 macro_ptr = init_str.str;
9219 next();
9220
9221 /* if still unknown size, error */
9222 size = type_size(type, &align);
9223 if (size < 0)
9224 error("unknown type size");
9225 }
9226 /* take into account specified alignment if bigger */
9227 if (ad->aligned) {
9228 if (ad->aligned > align)
9229 align = ad->aligned;
9230 } else if (ad->packed) {
9231 align = 1;
9232 }
9233 if ((r & VT_VALMASK) == VT_LOCAL) {
9234 sec = NULL;
9235 if (do_bounds_check && (type->t & VT_ARRAY))
9236 loc--;
9237 loc = (loc - size) & -align;
9238 addr = loc;
9239 /* handles bounds */
9240 /* XXX: currently, since we do only one pass, we cannot track
9241 '&' operators, so we add only arrays */
9242 if (do_bounds_check && (type->t & VT_ARRAY)) {
9243 unsigned long *bounds_ptr;
9244 /* add padding between regions */
9245 loc--;
9246 /* then add local bound info */
9247 bounds_ptr = section_ptr_add(lbounds_section, 2 * sizeof(unsigned long));
9248 bounds_ptr[0] = addr;
9249 bounds_ptr[1] = size;
9250 }
9251 if (v) {
9252 /* local variable */
9253 sym_push(v, type, r, addr);
9254 } else {
9255 /* push local reference */
9256 vset(type, r, addr);
9257 }
9258 } else {
9259 Sym *sym;
9260
9261 sym = NULL;
9262 if (v && scope == VT_CONST) {
9263 /* see if the symbol was already defined */
9264 sym = sym_find(v);
9265 if (sym) {
9266 if (!is_compatible_types(&sym->type, type))
9267 error("incompatible types for redefinition of '%s'",
9268 get_tok_str(v, NULL));
9269 if (sym->type.t & VT_EXTERN) {
9270 /* if the variable is extern, it was not allocated */
9271 sym->type.t &= ~VT_EXTERN;
9272 /* set array size if it was ommited in extern
9273 declaration */
9274 if ((sym->type.t & VT_ARRAY) &&
9275 sym->type.ref->c < 0 &&
9276 type->ref->c >= 0)
9277 sym->type.ref->c = type->ref->c;
9278 } else {
9279 /* we accept several definitions of the same
9280 global variable. this is tricky, because we
9281 must play with the SHN_COMMON type of the symbol */
9282 /* XXX: should check if the variable was already
9283 initialized. It is incorrect to initialized it
9284 twice */
9285 /* no init data, we won't add more to the symbol */
9286 if (!has_init)
9287 goto no_alloc;
9288 }
9289 }
9290 }
9291
9292 /* allocate symbol in corresponding section */
9293 sec = ad->section;
9294 if (!sec) {
9295 if (has_init)
9296 sec = data_section;
9297 else if (tcc_state->nocommon)
9298 sec = bss_section;
9299 }
9300 if (sec) {
9301 data_offset = sec->data_offset;
9302 data_offset = (data_offset + align - 1) & -align;
9303 addr = data_offset;
9304 /* very important to increment global pointer at this time
9305 because initializers themselves can create new initializers */
9306 data_offset += size;
9307 /* add padding if bound check */
9308 if (do_bounds_check)
9309 data_offset++;
9310 sec->data_offset = data_offset;
9311 /* allocate section space to put the data */
9312 if (sec->sh_type != SHT_NOBITS &&
9313 data_offset > sec->data_allocated)
9314 section_realloc(sec, data_offset);
9315 /* align section if needed */
9316 if (align > sec->sh_addralign)
9317 sec->sh_addralign = align;
9318 } else {
9319 addr = 0; /* avoid warning */
9320 }
9321
9322 if (v) {
9323 if (scope != VT_CONST || !sym) {
9324 sym = sym_push(v, type, r | VT_SYM, 0);
9325 }
9326 /* update symbol definition */
9327 if (sec) {
9328 put_extern_sym(sym, sec, addr, size);
9329 } else {
9330 ElfW(Sym) *esym;
9331 /* put a common area */
9332 put_extern_sym(sym, NULL, align, size);
9333 /* XXX: find a nicer way */
9334 esym = &((ElfW(Sym) *)symtab_section->data)[sym->c];
9335 esym->st_shndx = SHN_COMMON;
9336 }
9337 } else {
9338 CValue cval;
9339
9340 /* push global reference */
9341 sym = get_sym_ref(type, sec, addr, size);
9342 cval.ul = 0;
9343 vsetc(type, VT_CONST | VT_SYM, &cval);
9344 vtop->sym = sym;
9345 }
9346
9347 /* handles bounds now because the symbol must be defined
9348 before for the relocation */
9349 if (do_bounds_check) {
9350 unsigned long *bounds_ptr;
9351
9352 greloc(bounds_section, sym, bounds_section->data_offset, R_DATA_32);
9353 /* then add global bound info */
9354 bounds_ptr = section_ptr_add(bounds_section, 2 * sizeof(long));
9355 bounds_ptr[0] = 0; /* relocated */
9356 bounds_ptr[1] = size;
9357 }
9358 }
9359 if (has_init) {
9360 decl_initializer(type, sec, addr, 1, 0);
9361 /* restore parse state if needed */
9362 if (init_str.str) {
9363 tok_str_free(init_str.str);
9364 restore_parse_state(&saved_parse_state);
9365 }
9366 }
9367 no_alloc: ;
9368 }
9369
9370 void put_func_debug(Sym *sym)
9371 {
9372 char buf[512];
9373
9374 /* stabs info */
9375 /* XXX: we put here a dummy type */
9376 snprintf(buf, sizeof(buf), "%s:%c1",
9377 funcname, sym->type.t & VT_STATIC ? 'f' : 'F');
9378 put_stabs_r(buf, N_FUN, 0, file->line_num, 0,
9379 cur_text_section, sym->c);
9380 /* //gr gdb wants a line at the function */
9381 put_stabn(N_SLINE, 0, file->line_num, 0);
9382 last_ind = 0;
9383 last_line_num = 0;
9384 }
9385
9386 /* parse an old style function declaration list */
9387 /* XXX: check multiple parameter */
9388 static void func_decl_list(Sym *func_sym)
9389 {
9390 AttributeDef ad;
9391 int v;
9392 Sym *s;
9393 CType btype, type;
9394
9395 /* parse each declaration */
9396 while (tok != '{' && tok != ';' && tok != ',' && tok != TOK_EOF) {
9397 if (!parse_btype(&btype, &ad))
9398 expect("declaration list");
9399 if (((btype.t & VT_BTYPE) == VT_ENUM ||
9400 (btype.t & VT_BTYPE) == VT_STRUCT) &&
9401 tok == ';') {
9402 /* we accept no variable after */
9403 } else {
9404 for(;;) {
9405 type = btype;
9406 type_decl(&type, &ad, &v, TYPE_DIRECT);
9407 /* find parameter in function parameter list */
9408 s = func_sym->next;
9409 while (s != NULL) {
9410 if ((s->v & ~SYM_FIELD) == v)
9411 goto found;
9412 s = s->next;
9413 }
9414 error("declaration for parameter '%s' but no such parameter",
9415 get_tok_str(v, NULL));
9416 found:
9417 /* check that no storage specifier except 'register' was given */
9418 if (type.t & VT_STORAGE)
9419 error("storage class specified for '%s'", get_tok_str(v, NULL));
9420 convert_parameter_type(&type);
9421 /* we can add the type (NOTE: it could be local to the function) */
9422 s->type = type;
9423 /* accept other parameters */
9424 if (tok == ',')
9425 next();
9426 else
9427 break;
9428 }
9429 }
9430 skip(';');
9431 }
9432 }
9433
9434 /* parse a function defined by symbol 'sym' and generate its code in
9435 'cur_text_section' */
9436 static void gen_function(Sym *sym)
9437 {
9438 int saved_nocode_wanted = nocode_wanted;
9439 nocode_wanted = 0;
9440 ind = cur_text_section->data_offset;
9441 /* NOTE: we patch the symbol size later */
9442 put_extern_sym(sym, cur_text_section, ind, 0);
9443 funcname = get_tok_str(sym->v, NULL);
9444 func_ind = ind;
9445 /* put debug symbol */
9446 if (do_debug)
9447 put_func_debug(sym);
9448 /* push a dummy symbol to enable local sym storage */
9449 sym_push2(&local_stack, SYM_FIELD, 0, 0);
9450 gfunc_prolog(&sym->type);
9451 rsym = 0;
9452 block(NULL, NULL, NULL, NULL, 0, 0);
9453 gsym(rsym);
9454 gfunc_epilog();
9455 cur_text_section->data_offset = ind;
9456 label_pop(&global_label_stack, NULL);
9457 sym_pop(&local_stack, NULL); /* reset local stack */
9458 /* end of function */
9459 /* patch symbol size */
9460 ((ElfW(Sym) *)symtab_section->data)[sym->c].st_size =
9461 ind - func_ind;
9462 if (do_debug) {
9463 put_stabn(N_FUN, 0, 0, ind - func_ind);
9464 }
9465 /* It's better to crash than to generate wrong code */
9466 cur_text_section = NULL;
9467 funcname = ""; /* for safety */
9468 func_vt.t = VT_VOID; /* for safety */
9469 ind = 0; /* for safety */
9470 nocode_wanted = saved_nocode_wanted;
9471 }
9472
9473 static void gen_inline_functions(void)
9474 {
9475 Sym *sym;
9476 CType *type;
9477 int *str, inline_generated;
9478
9479 /* iterate while inline function are referenced */
9480 for(;;) {
9481 inline_generated = 0;
9482 for(sym = global_stack; sym != NULL; sym = sym->prev) {
9483 type = &sym->type;
9484 if (((type->t & VT_BTYPE) == VT_FUNC) &&
9485 (type->t & (VT_STATIC | VT_INLINE)) ==
9486 (VT_STATIC | VT_INLINE) &&
9487 sym->c != 0) {
9488 /* the function was used: generate its code and
9489 convert it to a normal function */
9490 str = INLINE_DEF(sym->r);
9491 sym->r = VT_SYM | VT_CONST;
9492 sym->type.t &= ~VT_INLINE;
9493
9494 macro_ptr = str;
9495 next();
9496 cur_text_section = text_section;
9497 gen_function(sym);
9498 macro_ptr = NULL; /* fail safe */
9499
9500 tok_str_free(str);
9501 inline_generated = 1;
9502 }
9503 }
9504 if (!inline_generated)
9505 break;
9506 }
9507
9508 /* free all remaining inline function tokens */
9509 for(sym = global_stack; sym != NULL; sym = sym->prev) {
9510 type = &sym->type;
9511 if (((type->t & VT_BTYPE) == VT_FUNC) &&
9512 (type->t & (VT_STATIC | VT_INLINE)) ==
9513 (VT_STATIC | VT_INLINE)) {
9514 //gr printf("sym %d %s\n", sym->r, get_tok_str(sym->v, NULL));
9515 if (sym->r == (VT_SYM | VT_CONST)) //gr beware!
9516 continue;
9517 str = INLINE_DEF(sym->r);
9518 tok_str_free(str);
9519 sym->r = 0; /* fail safe */
9520 }
9521 }
9522 }
9523
9524 /* 'l' is VT_LOCAL or VT_CONST to define default storage type */
9525 static void decl(int l)
9526 {
9527 int v, has_init, r;
9528 CType type, btype;
9529 Sym *sym;
9530 AttributeDef ad;
9531
9532 while (1) {
9533 if (!parse_btype(&btype, &ad)) {
9534 /* skip redundant ';' */
9535 /* XXX: find more elegant solution */
9536 if (tok == ';') {
9537 next();
9538 continue;
9539 }
9540 if (l == VT_CONST &&
9541 (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
9542 /* global asm block */
9543 asm_global_instr();
9544 continue;
9545 }
9546 /* special test for old K&R protos without explicit int
9547 type. Only accepted when defining global data */
9548 if (l == VT_LOCAL || tok < TOK_DEFINE)
9549 break;
9550 btype.t = VT_INT;
9551 }
9552 if (((btype.t & VT_BTYPE) == VT_ENUM ||
9553 (btype.t & VT_BTYPE) == VT_STRUCT) &&
9554 tok == ';') {
9555 /* we accept no variable after */
9556 next();
9557 continue;
9558 }
9559 while (1) { /* iterate thru each declaration */
9560 type = btype;
9561 type_decl(&type, &ad, &v, TYPE_DIRECT);
9562 #if 0
9563 {
9564 char buf[500];
9565 type_to_str(buf, sizeof(buf), t, get_tok_str(v, NULL));
9566 printf("type = '%s'\n", buf);
9567 }
9568 #endif
9569 if ((type.t & VT_BTYPE) == VT_FUNC) {
9570 /* if old style function prototype, we accept a
9571 declaration list */
9572 sym = type.ref;
9573 if (sym->c == FUNC_OLD)
9574 func_decl_list(sym);
9575 }
9576
9577 if (tok == '{') {
9578 if (l == VT_LOCAL)
9579 error("cannot use local functions");
9580 if ((type.t & VT_BTYPE) != VT_FUNC)
9581 expect("function definition");
9582
9583 /* reject abstract declarators in function definition */
9584 sym = type.ref;
9585 while ((sym = sym->next) != NULL)
9586 if (!(sym->v & ~SYM_FIELD))
9587 expect("identifier");
9588
9589 /* XXX: cannot do better now: convert extern line to static inline */
9590 if ((type.t & (VT_EXTERN | VT_INLINE)) == (VT_EXTERN | VT_INLINE))
9591 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
9592
9593 sym = sym_find(v);
9594 if (sym) {
9595 if ((sym->type.t & VT_BTYPE) != VT_FUNC)
9596 goto func_error1;
9597 /* specific case: if not func_call defined, we put
9598 the one of the prototype */
9599 /* XXX: should have default value */
9600 r = sym->type.ref->r;
9601 if (FUNC_CALL(r) != FUNC_CDECL
9602 && FUNC_CALL(type.ref->r) == FUNC_CDECL)
9603 FUNC_CALL(type.ref->r) = FUNC_CALL(r);
9604 if (FUNC_EXPORT(r))
9605 FUNC_EXPORT(type.ref->r) = 1;
9606
9607 if (!is_compatible_types(&sym->type, &type)) {
9608 func_error1:
9609 error("incompatible types for redefinition of '%s'",
9610 get_tok_str(v, NULL));
9611 }
9612 /* if symbol is already defined, then put complete type */
9613 sym->type = type;
9614 } else {
9615 /* put function symbol */
9616 sym = global_identifier_push(v, type.t, 0);
9617 sym->type.ref = type.ref;
9618 }
9619
9620 /* static inline functions are just recorded as a kind
9621 of macro. Their code will be emitted at the end of
9622 the compilation unit only if they are used */
9623 if ((type.t & (VT_INLINE | VT_STATIC)) ==
9624 (VT_INLINE | VT_STATIC)) {
9625 TokenString func_str;
9626 int block_level;
9627
9628 tok_str_new(&func_str);
9629
9630 block_level = 0;
9631 for(;;) {
9632 int t;
9633 if (tok == TOK_EOF)
9634 error("unexpected end of file");
9635 tok_str_add_tok(&func_str);
9636 t = tok;
9637 next();
9638 if (t == '{') {
9639 block_level++;
9640 } else if (t == '}') {
9641 block_level--;
9642 if (block_level == 0)
9643 break;
9644 }
9645 }
9646 tok_str_add(&func_str, -1);
9647 tok_str_add(&func_str, 0);
9648 INLINE_DEF(sym->r) = func_str.str;
9649 } else {
9650 /* compute text section */
9651 cur_text_section = ad.section;
9652 if (!cur_text_section)
9653 cur_text_section = text_section;
9654 sym->r = VT_SYM | VT_CONST;
9655 gen_function(sym);
9656 }
9657 break;
9658 } else {
9659 if (btype.t & VT_TYPEDEF) {
9660 /* save typedefed type */
9661 /* XXX: test storage specifiers ? */
9662 sym = sym_push(v, &type, 0, 0);
9663 sym->type.t |= VT_TYPEDEF;
9664 } else if ((type.t & VT_BTYPE) == VT_FUNC) {
9665 /* external function definition */
9666 /* specific case for func_call attribute */
9667 if (ad.func_attr)
9668 type.ref->r = ad.func_attr;
9669 external_sym(v, &type, 0);
9670 } else {
9671 /* not lvalue if array */
9672 r = 0;
9673 if (!(type.t & VT_ARRAY))
9674 r |= lvalue_type(type.t);
9675 has_init = (tok == '=');
9676 if ((btype.t & VT_EXTERN) ||
9677 ((type.t & VT_ARRAY) && (type.t & VT_STATIC) &&
9678 !has_init && l == VT_CONST && type.ref->c < 0)) {
9679 /* external variable */
9680 /* NOTE: as GCC, uninitialized global static
9681 arrays of null size are considered as
9682 extern */
9683 external_sym(v, &type, r);
9684 } else {
9685 type.t |= (btype.t & VT_STATIC); /* Retain "static". */
9686 if (type.t & VT_STATIC)
9687 r |= VT_CONST;
9688 else
9689 r |= l;
9690 if (has_init)
9691 next();
9692 decl_initializer_alloc(&type, &ad, r,
9693 has_init, v, l);
9694 }
9695 }
9696 if (tok != ',') {
9697 skip(';');
9698 break;
9699 }
9700 next();
9701 }
9702 }
9703 }
9704 }
9705
9706 /* better than nothing, but needs extension to handle '-E' option
9707 correctly too */
9708 static void preprocess_init(TCCState *s1)
9709 {
9710 s1->include_stack_ptr = s1->include_stack;
9711 /* XXX: move that before to avoid having to initialize
9712 file->ifdef_stack_ptr ? */
9713 s1->ifdef_stack_ptr = s1->ifdef_stack;
9714 file->ifdef_stack_ptr = s1->ifdef_stack_ptr;
9715
9716 /* XXX: not ANSI compliant: bound checking says error */
9717 vtop = vstack - 1;
9718 s1->pack_stack[0] = 0;
9719 s1->pack_stack_ptr = s1->pack_stack;
9720 }
9721
9722 /* compile the C file opened in 'file'. Return non zero if errors. */
9723 static int tcc_compile(TCCState *s1)
9724 {
9725 Sym *define_start;
9726 char buf[512];
9727 volatile int section_sym;
9728
9729 #ifdef INC_DEBUG
9730 printf("%s: **** new file\n", file->filename);
9731 #endif
9732 preprocess_init(s1);
9733
9734 cur_text_section = NULL;
9735 funcname = "";
9736 anon_sym = SYM_FIRST_ANOM;
9737
9738 /* file info: full path + filename */
9739 section_sym = 0; /* avoid warning */
9740 if (do_debug) {
9741 section_sym = put_elf_sym(symtab_section, 0, 0,
9742 ELFW(ST_INFO)(STB_LOCAL, STT_SECTION), 0,
9743 text_section->sh_num, NULL);
9744 getcwd(buf, sizeof(buf));
9745 #ifdef _WIN32
9746 normalize_slashes(buf);
9747 #endif
9748 pstrcat(buf, sizeof(buf), "/");
9749 put_stabs_r(buf, N_SO, 0, 0,
9750 text_section->data_offset, text_section, section_sym);
9751 put_stabs_r(file->filename, N_SO, 0, 0,
9752 text_section->data_offset, text_section, section_sym);
9753 }
9754 /* an elf symbol of type STT_FILE must be put so that STB_LOCAL
9755 symbols can be safely used */
9756 put_elf_sym(symtab_section, 0, 0,
9757 ELFW(ST_INFO)(STB_LOCAL, STT_FILE), 0,
9758 SHN_ABS, file->filename);
9759
9760 /* define some often used types */
9761 int_type.t = VT_INT;
9762
9763 char_pointer_type.t = VT_BYTE;
9764 mk_pointer(&char_pointer_type);
9765
9766 func_old_type.t = VT_FUNC;
9767 func_old_type.ref = sym_push(SYM_FIELD, &int_type, FUNC_CDECL, FUNC_OLD);
9768
9769 #if defined(TCC_ARM_EABI) && defined(TCC_ARM_VFP)
9770 float_type.t = VT_FLOAT;
9771 double_type.t = VT_DOUBLE;
9772
9773 func_float_type.t = VT_FUNC;
9774 func_float_type.ref = sym_push(SYM_FIELD, &float_type, FUNC_CDECL, FUNC_OLD);
9775 func_double_type.t = VT_FUNC;
9776 func_double_type.ref = sym_push(SYM_FIELD, &double_type, FUNC_CDECL, FUNC_OLD);
9777 #endif
9778
9779 #if 0
9780 /* define 'void *alloca(unsigned int)' builtin function */
9781 {
9782 Sym *s1;
9783
9784 p = anon_sym++;
9785 sym = sym_push(p, mk_pointer(VT_VOID), FUNC_CDECL, FUNC_NEW);
9786 s1 = sym_push(SYM_FIELD, VT_UNSIGNED | VT_INT, 0, 0);
9787 s1->next = NULL;
9788 sym->next = s1;
9789 sym_push(TOK_alloca, VT_FUNC | (p << VT_STRUCT_SHIFT), VT_CONST, 0);
9790 }
9791 #endif
9792
9793 define_start = define_stack;
9794 nocode_wanted = 1;
9795
9796 if (setjmp(s1->error_jmp_buf) == 0) {
9797 s1->nb_errors = 0;
9798 s1->error_set_jmp_enabled = 1;
9799
9800 ch = file->buf_ptr[0];
9801 tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF;
9802 parse_flags = PARSE_FLAG_PREPROCESS | PARSE_FLAG_TOK_NUM;
9803 next();
9804 decl(VT_CONST);
9805 if (tok != TOK_EOF)
9806 expect("declaration");
9807
9808 /* end of translation unit info */
9809 if (do_debug) {
9810 put_stabs_r(NULL, N_SO, 0, 0,
9811 text_section->data_offset, text_section, section_sym);
9812 }
9813 }
9814 s1->error_set_jmp_enabled = 0;
9815
9816 /* reset define stack, but leave -Dsymbols (may be incorrect if
9817 they are undefined) */
9818 free_defines(define_start);
9819
9820 gen_inline_functions();
9821
9822 sym_pop(&global_stack, NULL);
9823 sym_pop(&local_stack, NULL);
9824
9825 return s1->nb_errors != 0 ? -1 : 0;
9826 }
9827
9828 /* Preprocess the current file */
9829 /* XXX: add line and file infos,
9830 * XXX: add options to preserve spaces (partly done, only spaces in macro are
9831 * not preserved)
9832 */
9833 static int tcc_preprocess(TCCState *s1)
9834 {
9835 Sym *define_start;
9836 BufferedFile *file_ref;
9837 int token_seen, line_ref;
9838
9839 preprocess_init(s1);
9840 define_start = define_stack;
9841 ch = file->buf_ptr[0];
9842
9843 tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF;
9844 parse_flags = PARSE_FLAG_ASM_COMMENTS | PARSE_FLAG_PREPROCESS |
9845 PARSE_FLAG_LINEFEED;
9846
9847 token_seen = 0;
9848 line_ref = 0;
9849 file_ref = NULL;
9850
9851 for (;;) {
9852 next();
9853 if (tok == TOK_EOF) {
9854 break;
9855 } else if (tok == TOK_LINEFEED) {
9856 if (!token_seen)
9857 continue;
9858 ++line_ref;
9859 token_seen = 0;
9860 } else if (token_seen) {
9861 fwrite(tok_spaces.data, tok_spaces.size, 1, s1->outfile);
9862 } else {
9863 int d = file->line_num - line_ref;
9864 if (file != file_ref || d < 0 || d >= 8)
9865 fprintf(s1->outfile, "# %d \"%s\"\n", file->line_num, file->filename);
9866 else
9867 while (d)
9868 fputs("\n", s1->outfile), --d;
9869 line_ref = (file_ref = file)->line_num;
9870 token_seen = 1;
9871 }
9872 fputs(get_tok_str(tok, &tokc), s1->outfile);
9873 }
9874 free_defines(define_start);
9875 return 0;
9876 }
9877
9878 #ifdef LIBTCC
9879 int tcc_compile_string(TCCState *s, const char *str)
9880 {
9881 BufferedFile bf1, *bf = &bf1;
9882 int ret, len;
9883 char *buf;
9884
9885 /* init file structure */
9886 bf->fd = -1;
9887 /* XXX: avoid copying */
9888 len = strlen(str);
9889 buf = tcc_malloc(len + 1);
9890 if (!buf)
9891 return -1;
9892 memcpy(buf, str, len);
9893 buf[len] = CH_EOB;
9894 bf->buf_ptr = buf;
9895 bf->buf_end = buf + len;
9896 pstrcpy(bf->filename, sizeof(bf->filename), "<string>");
9897 bf->line_num = 1;
9898 file = bf;
9899 ret = tcc_compile(s);
9900 file = NULL;
9901 tcc_free(buf);
9902
9903 /* currently, no need to close */
9904 return ret;
9905 }
9906 #endif
9907
9908 /* define a preprocessor symbol. A value can also be provided with the '=' operator */
9909 void tcc_define_symbol(TCCState *s1, const char *sym, const char *value)
9910 {
9911 BufferedFile bf1, *bf = &bf1;
9912
9913 pstrcpy(bf->buffer, IO_BUF_SIZE, sym);
9914 pstrcat(bf->buffer, IO_BUF_SIZE, " ");
9915 /* default value */
9916 if (!value)
9917 value = "1";
9918 pstrcat(bf->buffer, IO_BUF_SIZE, value);
9919
9920 /* init file structure */
9921 bf->fd = -1;
9922 bf->buf_ptr = bf->buffer;
9923 bf->buf_end = bf->buffer + strlen(bf->buffer);
9924 *bf->buf_end = CH_EOB;
9925 bf->filename[0] = '\0';
9926 bf->line_num = 1;
9927 file = bf;
9928
9929 s1->include_stack_ptr = s1->include_stack;
9930
9931 /* parse with define parser */
9932 ch = file->buf_ptr[0];
9933 next_nomacro();
9934 parse_define();
9935 file = NULL;
9936 }
9937
9938 /* undefine a preprocessor symbol */
9939 void tcc_undefine_symbol(TCCState *s1, const char *sym)
9940 {
9941 TokenSym *ts;
9942 Sym *s;
9943 ts = tok_alloc(sym, strlen(sym));
9944 s = define_find(ts->tok);
9945 /* undefine symbol by putting an invalid name */
9946 if (s)
9947 define_undef(s);
9948 }
9949
9950 #ifdef CONFIG_TCC_ASM
9951
9952 #ifdef TCC_TARGET_I386
9953 #include "i386-asm.c"
9954 #endif
9955 #include "tccasm.c"
9956
9957 #else
9958 static void asm_instr(void)
9959 {
9960 error("inline asm() not supported");
9961 }
9962 static void asm_global_instr(void)
9963 {
9964 error("inline asm() not supported");
9965 }
9966 #endif
9967
9968 #include "tccelf.c"
9969
9970 #ifdef TCC_TARGET_COFF
9971 #include "tcccoff.c"
9972 #endif
9973
9974 #ifdef TCC_TARGET_PE
9975 #include "tccpe.c"
9976 #endif
9977
9978 /* print the position in the source file of PC value 'pc' by reading
9979 the stabs debug information */
9980 static void rt_printline(unsigned long wanted_pc)
9981 {
9982 Stab_Sym *sym, *sym_end;
9983 char func_name[128], last_func_name[128];
9984 unsigned long func_addr, last_pc, pc;
9985 const char *incl_files[INCLUDE_STACK_SIZE];
9986 int incl_index, len, last_line_num, i;
9987 const char *str, *p;
9988
9989 fprintf(stderr, "0x%08lx:", wanted_pc);
9990
9991 func_name[0] = '\0';
9992 func_addr = 0;
9993 incl_index = 0;
9994 last_func_name[0] = '\0';
9995 last_pc = 0xffffffff;
9996 last_line_num = 1;
9997 sym = (Stab_Sym *)stab_section->data + 1;
9998 sym_end = (Stab_Sym *)(stab_section->data + stab_section->data_offset);
9999 while (sym < sym_end) {
10000 switch(sym->n_type) {
10001 /* function start or end */
10002 case N_FUN:
10003 if (sym->n_strx == 0) {
10004 /* we test if between last line and end of function */
10005 pc = sym->n_value + func_addr;
10006 if (wanted_pc >= last_pc && wanted_pc < pc)
10007 goto found;
10008 func_name[0] = '\0';
10009 func_addr = 0;
10010 } else {
10011 str = stabstr_section->data + sym->n_strx;
10012 p = strchr(str, ':');
10013 if (!p) {
10014 pstrcpy(func_name, sizeof(func_name), str);
10015 } else {
10016 len = p - str;
10017 if (len > sizeof(func_name) - 1)
10018 len = sizeof(func_name) - 1;
10019 memcpy(func_name, str, len);
10020 func_name[len] = '\0';
10021 }
10022 func_addr = sym->n_value;
10023 }
10024 break;
10025 /* line number info */
10026 case N_SLINE:
10027 pc = sym->n_value + func_addr;
10028 if (wanted_pc >= last_pc && wanted_pc < pc)
10029 goto found;
10030 last_pc = pc;
10031 last_line_num = sym->n_desc;
10032 /* XXX: slow! */
10033 strcpy(last_func_name, func_name);
10034 break;
10035 /* include files */
10036 case N_BINCL:
10037 str = stabstr_section->data + sym->n_strx;
10038 add_incl:
10039 if (incl_index < INCLUDE_STACK_SIZE) {
10040 incl_files[incl_index++] = str;
10041 }
10042 break;
10043 case N_EINCL:
10044 if (incl_index > 1)
10045 incl_index--;
10046 break;
10047 case N_SO:
10048 if (sym->n_strx == 0) {
10049 incl_index = 0; /* end of translation unit */
10050 } else {
10051 str = stabstr_section->data + sym->n_strx;
10052 /* do not add path */
10053 len = strlen(str);
10054 if (len > 0 && str[len - 1] != '/')
10055 goto add_incl;
10056 }
10057 break;
10058 }
10059 sym++;
10060 }
10061
10062 /* second pass: we try symtab symbols (no line number info) */
10063 incl_index = 0;
10064 {
10065 ElfW(Sym) *sym, *sym_end;
10066 int type;
10067
10068 sym_end = (ElfW(Sym) *)(symtab_section->data + symtab_section->data_offset);
10069 for(sym = (ElfW(Sym) *)symtab_section->data + 1;
10070 sym < sym_end;
10071 sym++) {
10072 type = ELFW(ST_TYPE)(sym->st_info);
10073 if (type == STT_FUNC) {
10074 if (wanted_pc >= sym->st_value &&
10075 wanted_pc < sym->st_value + sym->st_size) {
10076 pstrcpy(last_func_name, sizeof(last_func_name),
10077 strtab_section->data + sym->st_name);
10078 goto found;
10079 }
10080 }
10081 }
10082 }
10083 /* did not find any info: */
10084 fprintf(stderr, " ???\n");
10085 return;
10086 found:
10087 if (last_func_name[0] != '\0') {
10088 fprintf(stderr, " %s()", last_func_name);
10089 }
10090 if (incl_index > 0) {
10091 fprintf(stderr, " (%s:%d",
10092 incl_files[incl_index - 1], last_line_num);
10093 for(i = incl_index - 2; i >= 0; i--)
10094 fprintf(stderr, ", included from %s", incl_files[i]);
10095 fprintf(stderr, ")");
10096 }
10097 fprintf(stderr, "\n");
10098 }
10099
10100 #if !defined(_WIN32) && !defined(CONFIG_TCCBOOT)
10101
10102 #ifdef __i386__
10103
10104 /* fix for glibc 2.1 */
10105 #ifndef REG_EIP
10106 #define REG_EIP EIP
10107 #define REG_EBP EBP
10108 #endif
10109
10110 /* return the PC at frame level 'level'. Return non zero if not found */
10111 static int rt_get_caller_pc(unsigned long *paddr,
10112 ucontext_t *uc, int level)
10113 {
10114 unsigned long fp;
10115 int i;
10116
10117 if (level == 0) {
10118 #if defined(__FreeBSD__)
10119 *paddr = uc->uc_mcontext.mc_eip;
10120 #elif defined(__dietlibc__)
10121 *paddr = uc->uc_mcontext.eip;
10122 #else
10123 *paddr = uc->uc_mcontext.gregs[REG_EIP];
10124 #endif
10125 return 0;
10126 } else {
10127 #if defined(__FreeBSD__)
10128 fp = uc->uc_mcontext.mc_ebp;
10129 #elif defined(__dietlibc__)
10130 fp = uc->uc_mcontext.ebp;
10131 #else
10132 fp = uc->uc_mcontext.gregs[REG_EBP];
10133 #endif
10134 for(i=1;i<level;i++) {
10135 /* XXX: check address validity with program info */
10136 if (fp <= 0x1000 || fp >= 0xc0000000)
10137 return -1;
10138 fp = ((unsigned long *)fp)[0];
10139 }
10140 *paddr = ((unsigned long *)fp)[1];
10141 return 0;
10142 }
10143 }
10144 #elif defined(__x86_64__)
10145 /* return the PC at frame level 'level'. Return non zero if not found */
10146 static int rt_get_caller_pc(unsigned long *paddr,
10147 ucontext_t *uc, int level)
10148 {
10149 unsigned long fp;
10150 int i;
10151
10152 if (level == 0) {
10153 /* XXX: only support linux */
10154 *paddr = uc->uc_mcontext.gregs[REG_RIP];
10155 return 0;
10156 } else {
10157 fp = uc->uc_mcontext.gregs[REG_RBP];
10158 for(i=1;i<level;i++) {
10159 /* XXX: check address validity with program info */
10160 if (fp <= 0x1000 || fp >= 0xc0000000)
10161 return -1;
10162 fp = ((unsigned long *)fp)[0];
10163 }
10164 *paddr = ((unsigned long *)fp)[1];
10165 return 0;
10166 }
10167 }
10168 #else
10169
10170 #warning add arch specific rt_get_caller_pc()
10171
10172 static int rt_get_caller_pc(unsigned long *paddr,
10173 ucontext_t *uc, int level)
10174 {
10175 return -1;
10176 }
10177 #endif
10178
10179 /* emit a run time error at position 'pc' */
10180 void rt_error(ucontext_t *uc, const char *fmt, ...)
10181 {
10182 va_list ap;
10183 unsigned long pc;
10184 int i;
10185
10186 va_start(ap, fmt);
10187 fprintf(stderr, "Runtime error: ");
10188 vfprintf(stderr, fmt, ap);
10189 fprintf(stderr, "\n");
10190 for(i=0;i<num_callers;i++) {
10191 if (rt_get_caller_pc(&pc, uc, i) < 0)
10192 break;
10193 if (i == 0)
10194 fprintf(stderr, "at ");
10195 else
10196 fprintf(stderr, "by ");
10197 rt_printline(pc);
10198 }
10199 exit(255);
10200 va_end(ap);
10201 }
10202
10203 /* signal handler for fatal errors */
10204 static void sig_error(int signum, siginfo_t *siginf, void *puc)
10205 {
10206 ucontext_t *uc = puc;
10207
10208 switch(signum) {
10209 case SIGFPE:
10210 switch(siginf->si_code) {
10211 case FPE_INTDIV:
10212 case FPE_FLTDIV:
10213 rt_error(uc, "division by zero");
10214 break;
10215 default:
10216 rt_error(uc, "floating point exception");
10217 break;
10218 }
10219 break;
10220 case SIGBUS:
10221 case SIGSEGV:
10222 if (rt_bound_error_msg && *rt_bound_error_msg)
10223 rt_error(uc, *rt_bound_error_msg);
10224 else
10225 rt_error(uc, "dereferencing invalid pointer");
10226 break;
10227 case SIGILL:
10228 rt_error(uc, "illegal instruction");
10229 break;
10230 case SIGABRT:
10231 rt_error(uc, "abort() called");
10232 break;
10233 default:
10234 rt_error(uc, "caught signal %d", signum);
10235 break;
10236 }
10237 exit(255);
10238 }
10239 #endif
10240
10241 /* do all relocations (needed before using tcc_get_symbol()) */
10242 int tcc_relocate(TCCState *s1)
10243 {
10244 Section *s;
10245 int i;
10246
10247 s1->nb_errors = 0;
10248
10249 #ifdef TCC_TARGET_PE
10250 pe_add_runtime(s1);
10251 #else
10252 tcc_add_runtime(s1);
10253 #endif
10254
10255 relocate_common_syms();
10256
10257 tcc_add_linker_symbols(s1);
10258 #ifndef TCC_TARGET_PE
10259 build_got_entries(s1);
10260 #endif
10261 /* compute relocation address : section are relocated in place. We
10262 also alloc the bss space */
10263 for(i = 1; i < s1->nb_sections; i++) {
10264 s = s1->sections[i];
10265 if (s->sh_flags & SHF_ALLOC) {
10266 if (s->sh_type == SHT_NOBITS)
10267 s->data = tcc_mallocz(s->data_offset);
10268 s->sh_addr = (unsigned long)s->data;
10269 }
10270 }
10271
10272 relocate_syms(s1, 1);
10273
10274 if (s1->nb_errors != 0)
10275 return -1;
10276
10277 /* relocate each section */
10278 for(i = 1; i < s1->nb_sections; i++) {
10279 s = s1->sections[i];
10280 if (s->reloc)
10281 relocate_section(s1, s);
10282 }
10283
10284 /* mark executable sections as executable in memory */
10285 for(i = 1; i < s1->nb_sections; i++) {
10286 s = s1->sections[i];
10287 if ((s->sh_flags & (SHF_ALLOC | SHF_EXECINSTR)) ==
10288 (SHF_ALLOC | SHF_EXECINSTR))
10289 set_pages_executable(s->data, s->data_offset);
10290 }
10291 return 0;
10292 }
10293
10294 /* launch the compiled program with the given arguments */
10295 int tcc_run(TCCState *s1, int argc, char **argv)
10296 {
10297 int (*prog_main)(int, char **);
10298
10299 if (tcc_relocate(s1) < 0)
10300 return -1;
10301
10302 prog_main = tcc_get_symbol_err(s1, "main");
10303
10304 if (do_debug) {
10305 #if defined(_WIN32) || defined(CONFIG_TCCBOOT)
10306 error("debug mode currently not available for Windows");
10307 #else
10308 struct sigaction sigact;
10309 /* install TCC signal handlers to print debug info on fatal
10310 runtime errors */
10311 sigact.sa_flags = SA_SIGINFO | SA_RESETHAND;
10312 sigact.sa_sigaction = sig_error;
10313 sigemptyset(&sigact.sa_mask);
10314 sigaction(SIGFPE, &sigact, NULL);
10315 sigaction(SIGILL, &sigact, NULL);
10316 sigaction(SIGSEGV, &sigact, NULL);
10317 sigaction(SIGBUS, &sigact, NULL);
10318 sigaction(SIGABRT, &sigact, NULL);
10319 #endif
10320 }
10321
10322 #ifdef CONFIG_TCC_BCHECK
10323 if (do_bounds_check) {
10324 void (*bound_init)(void);
10325
10326 /* set error function */
10327 rt_bound_error_msg = (void *)tcc_get_symbol_err(s1,
10328 "__bound_error_msg");
10329
10330 /* XXX: use .init section so that it also work in binary ? */
10331 bound_init = (void *)tcc_get_symbol_err(s1, "__bound_init");
10332 bound_init();
10333 }
10334 #endif
10335 return (*prog_main)(argc, argv);
10336 }
10337
10338 void tcc_memstats(void)
10339 {
10340 #ifdef MEM_DEBUG
10341 printf("memory in use: %d\n", mem_cur_size);
10342 #endif
10343 }
10344
10345 static void tcc_cleanup(void)
10346 {
10347 int i, n;
10348
10349 if (NULL == tcc_state)
10350 return;
10351 tcc_state = NULL;
10352
10353 /* free -D defines */
10354 free_defines(NULL);
10355
10356 /* free tokens */
10357 n = tok_ident - TOK_IDENT;
10358 for(i = 0; i < n; i++)
10359 tcc_free(table_ident[i]);
10360 tcc_free(table_ident);
10361
10362 /* free sym_pools */
10363 dynarray_reset(&sym_pools, &nb_sym_pools);
10364 /* string buffer */
10365 cstr_free(&tokcstr);
10366 /* reset symbol stack */
10367 sym_free_first = NULL;
10368 /* cleanup from error/setjmp */
10369 macro_ptr = NULL;
10370 }
10371
10372 TCCState *tcc_new(void)
10373 {
10374 const char *p, *r;
10375 TCCState *s;
10376 TokenSym *ts;
10377 int i, c;
10378
10379 tcc_cleanup();
10380
10381 s = tcc_mallocz(sizeof(TCCState));
10382 if (!s)
10383 return NULL;
10384 tcc_state = s;
10385 s->output_type = TCC_OUTPUT_MEMORY;
10386
10387 /* init isid table */
10388 for(i=CH_EOF;i<256;i++)
10389 isidnum_table[i-CH_EOF] = isid(i) || isnum(i);
10390
10391 /* add all tokens */
10392 table_ident = NULL;
10393 memset(hash_ident, 0, TOK_HASH_SIZE * sizeof(TokenSym *));
10394
10395 tok_ident = TOK_IDENT;
10396 p = tcc_keywords;
10397 while (*p) {
10398 r = p;
10399 for(;;) {
10400 c = *r++;
10401 if (c == '\0')
10402 break;
10403 }
10404 ts = tok_alloc(p, r - p - 1);
10405 p = r;
10406 }
10407
10408 /* we add dummy defines for some special macros to speed up tests
10409 and to have working defined() */
10410 define_push(TOK___LINE__, MACRO_OBJ, NULL, NULL);
10411 define_push(TOK___FILE__, MACRO_OBJ, NULL, NULL);
10412 define_push(TOK___DATE__, MACRO_OBJ, NULL, NULL);
10413 define_push(TOK___TIME__, MACRO_OBJ, NULL, NULL);
10414
10415 /* standard defines */
10416 tcc_define_symbol(s, "__STDC__", NULL);
10417 tcc_define_symbol(s, "__STDC_VERSION__", "199901L");
10418 #if defined(TCC_TARGET_I386)
10419 tcc_define_symbol(s, "__i386__", NULL);
10420 #endif
10421 #if defined(TCC_TARGET_X86_64)
10422 tcc_define_symbol(s, "__x86_64__", NULL);
10423 #endif
10424 #if defined(TCC_TARGET_ARM)
10425 tcc_define_symbol(s, "__ARM_ARCH_4__", NULL);
10426 tcc_define_symbol(s, "__arm_elf__", NULL);
10427 tcc_define_symbol(s, "__arm_elf", NULL);
10428 tcc_define_symbol(s, "arm_elf", NULL);
10429 tcc_define_symbol(s, "__arm__", NULL);
10430 tcc_define_symbol(s, "__arm", NULL);
10431 tcc_define_symbol(s, "arm", NULL);
10432 tcc_define_symbol(s, "__APCS_32__", NULL);
10433 #endif
10434 #ifdef TCC_TARGET_PE
10435 tcc_define_symbol(s, "_WIN32", NULL);
10436 #else
10437 tcc_define_symbol(s, "__unix__", NULL);
10438 tcc_define_symbol(s, "__unix", NULL);
10439 #if defined(__linux)
10440 tcc_define_symbol(s, "__linux__", NULL);
10441 tcc_define_symbol(s, "__linux", NULL);
10442 #endif
10443 #endif
10444 /* tiny C specific defines */
10445 tcc_define_symbol(s, "__TINYC__", NULL);
10446
10447 /* tiny C & gcc defines */
10448 tcc_define_symbol(s, "__SIZE_TYPE__", "unsigned int");
10449 tcc_define_symbol(s, "__PTRDIFF_TYPE__", "int");
10450 #ifdef TCC_TARGET_PE
10451 tcc_define_symbol(s, "__WCHAR_TYPE__", "unsigned short");
10452 #else
10453 tcc_define_symbol(s, "__WCHAR_TYPE__", "int");
10454 #endif
10455
10456 #ifndef TCC_TARGET_PE
10457 /* default library paths */
10458 tcc_add_library_path(s, CONFIG_SYSROOT "/usr/local/lib");
10459 tcc_add_library_path(s, CONFIG_SYSROOT "/usr/lib");
10460 tcc_add_library_path(s, CONFIG_SYSROOT "/lib");
10461 #endif
10462
10463 /* no section zero */
10464 dynarray_add((void ***)&s->sections, &s->nb_sections, NULL);
10465
10466 /* create standard sections */
10467 text_section = new_section(s, ".text", SHT_PROGBITS, SHF_ALLOC | SHF_EXECINSTR);
10468 data_section = new_section(s, ".data", SHT_PROGBITS, SHF_ALLOC | SHF_WRITE);
10469 bss_section = new_section(s, ".bss", SHT_NOBITS, SHF_ALLOC | SHF_WRITE);
10470
10471 /* symbols are always generated for linking stage */
10472 symtab_section = new_symtab(s, ".symtab", SHT_SYMTAB, 0,
10473 ".strtab",
10474 ".hashtab", SHF_PRIVATE);
10475 strtab_section = symtab_section->link;
10476
10477 /* private symbol table for dynamic symbols */
10478 s->dynsymtab_section = new_symtab(s, ".dynsymtab", SHT_SYMTAB, SHF_PRIVATE,
10479 ".dynstrtab",
10480 ".dynhashtab", SHF_PRIVATE);
10481 s->alacarte_link = 1;
10482
10483 #ifdef CHAR_IS_UNSIGNED
10484 s->char_is_unsigned = 1;
10485 #endif
10486 #if defined(TCC_TARGET_PE) && 0
10487 /* XXX: currently the PE linker is not ready to support that */
10488 s->leading_underscore = 1;
10489 #endif
10490
10491 #ifdef TCC_TARGET_X86_64
10492 s->jmp_table = NULL;
10493 #endif
10494 return s;
10495 }
10496
10497 void tcc_delete(TCCState *s1)
10498 {
10499 int i;
10500
10501 tcc_cleanup();
10502
10503 /* free all sections */
10504 free_section(s1->dynsymtab_section);
10505
10506 for(i = 1; i < s1->nb_sections; i++)
10507 free_section(s1->sections[i]);
10508 tcc_free(s1->sections);
10509
10510 /* free any loaded DLLs */
10511 for ( i = 0; i < s1->nb_loaded_dlls; i++)
10512 {
10513 DLLReference *ref = s1->loaded_dlls[i];
10514 if ( ref->handle )
10515 dlclose(ref->handle);
10516 }
10517
10518 /* free loaded dlls array */
10519 dynarray_reset(&s1->loaded_dlls, &s1->nb_loaded_dlls);
10520
10521 /* free library paths */
10522 dynarray_reset(&s1->library_paths, &s1->nb_library_paths);
10523
10524 /* free include paths */
10525 dynarray_reset(&s1->cached_includes, &s1->nb_cached_includes);
10526 dynarray_reset(&s1->include_paths, &s1->nb_include_paths);
10527 dynarray_reset(&s1->sysinclude_paths, &s1->nb_sysinclude_paths);
10528
10529 #ifdef TCC_TARGET_X86_64
10530 tcc_free(s1->jmp_table);
10531 #endif
10532 tcc_free(s1);
10533 }
10534
10535 int tcc_add_include_path(TCCState *s1, const char *pathname)
10536 {
10537 char *pathname1;
10538
10539 pathname1 = tcc_strdup(pathname);
10540 dynarray_add((void ***)&s1->include_paths, &s1->nb_include_paths, pathname1);
10541 return 0;
10542 }
10543
10544 int tcc_add_sysinclude_path(TCCState *s1, const char *pathname)
10545 {
10546 char *pathname1;
10547
10548 pathname1 = tcc_strdup(pathname);
10549 dynarray_add((void ***)&s1->sysinclude_paths, &s1->nb_sysinclude_paths, pathname1);
10550 return 0;
10551 }
10552
10553 static int tcc_add_file_internal(TCCState *s1, const char *filename, int flags)
10554 {
10555 const char *ext;
10556 ElfW(Ehdr) ehdr;
10557 int fd, ret;
10558 BufferedFile *saved_file;
10559
10560 /* find source file type with extension */
10561 ext = tcc_fileextension(filename);
10562 if (ext[0])
10563 ext++;
10564
10565 /* open the file */
10566 saved_file = file;
10567 file = tcc_open(s1, filename);
10568 if (!file) {
10569 if (flags & AFF_PRINT_ERROR) {
10570 error_noabort("file '%s' not found", filename);
10571 }
10572 ret = -1;
10573 goto fail1;
10574 }
10575
10576 if (flags & AFF_PREPROCESS) {
10577 ret = tcc_preprocess(s1);
10578 } else if (!ext[0] || !strcmp(ext, "c")) {
10579 /* C file assumed */
10580 ret = tcc_compile(s1);
10581 } else
10582 #ifdef CONFIG_TCC_ASM
10583 if (!strcmp(ext, "S")) {
10584 /* preprocessed assembler */
10585 ret = tcc_assemble(s1, 1);
10586 } else if (!strcmp(ext, "s")) {
10587 /* non preprocessed assembler */
10588 ret = tcc_assemble(s1, 0);
10589 } else
10590 #endif
10591 #ifdef TCC_TARGET_PE
10592 if (!strcmp(ext, "def")) {
10593 ret = pe_load_def_file(s1, file->fd);
10594 } else
10595 #endif
10596 {
10597 fd = file->fd;
10598 /* assume executable format: auto guess file type */
10599 ret = read(fd, &ehdr, sizeof(ehdr));
10600 lseek(fd, 0, SEEK_SET);
10601 if (ret <= 0) {
10602 error_noabort("could not read header");
10603 goto fail;
10604 } else if (ret != sizeof(ehdr)) {
10605 goto try_load_script;
10606 }
10607
10608 if (ehdr.e_ident[0] == ELFMAG0 &&
10609 ehdr.e_ident[1] == ELFMAG1 &&
10610 ehdr.e_ident[2] == ELFMAG2 &&
10611 ehdr.e_ident[3] == ELFMAG3) {
10612 file->line_num = 0; /* do not display line number if error */
10613 if (ehdr.e_type == ET_REL) {
10614 ret = tcc_load_object_file(s1, fd, 0);
10615 } else if (ehdr.e_type == ET_DYN) {
10616 if (s1->output_type == TCC_OUTPUT_MEMORY) {
10617 #ifdef TCC_TARGET_PE
10618 ret = -1;
10619 #else
10620 void *h;
10621 h = dlopen(filename, RTLD_GLOBAL | RTLD_LAZY);
10622 if (h)
10623 ret = 0;
10624 else
10625 ret = -1;
10626 #endif
10627 } else {
10628 ret = tcc_load_dll(s1, fd, filename,
10629 (flags & AFF_REFERENCED_DLL) != 0);
10630 }
10631 } else {
10632 error_noabort("unrecognized ELF file");
10633 goto fail;
10634 }
10635 } else if (memcmp((char *)&ehdr, ARMAG, 8) == 0) {
10636 file->line_num = 0; /* do not display line number if error */
10637 ret = tcc_load_archive(s1, fd);
10638 } else
10639 #ifdef TCC_TARGET_COFF
10640 if (*(uint16_t *)(&ehdr) == COFF_C67_MAGIC) {
10641 ret = tcc_load_coff(s1, fd);
10642 } else
10643 #endif
10644 #ifdef TCC_TARGET_PE
10645 if (pe_test_res_file(&ehdr, ret)) {
10646 ret = pe_load_res_file(s1, fd);
10647 } else
10648 #endif
10649 {
10650 /* as GNU ld, consider it is an ld script if not recognized */
10651 try_load_script:
10652 ret = tcc_load_ldscript(s1);
10653 if (ret < 0) {
10654 error_noabort("unrecognized file type");
10655 goto fail;
10656 }
10657 }
10658 }
10659 the_end:
10660 tcc_close(file);
10661 fail1:
10662 file = saved_file;
10663 return ret;
10664 fail:
10665 ret = -1;
10666 goto the_end;
10667 }
10668
10669 int tcc_add_file(TCCState *s, const char *filename)
10670 {
10671 return tcc_add_file_internal(s, filename, AFF_PRINT_ERROR);
10672 }
10673
10674 int tcc_add_library_path(TCCState *s, const char *pathname)
10675 {
10676 char *pathname1;
10677
10678 pathname1 = tcc_strdup(pathname);
10679 dynarray_add((void ***)&s->library_paths, &s->nb_library_paths, pathname1);
10680 return 0;
10681 }
10682
10683 /* find and load a dll. Return non zero if not found */
10684 /* XXX: add '-rpath' option support ? */
10685 static int tcc_add_dll(TCCState *s, const char *filename, int flags)
10686 {
10687 char buf[1024];
10688 int i;
10689
10690 for(i = 0; i < s->nb_library_paths; i++) {
10691 snprintf(buf, sizeof(buf), "%s/%s",
10692 s->library_paths[i], filename);
10693 if (tcc_add_file_internal(s, buf, flags) == 0)
10694 return 0;
10695 }
10696 return -1;
10697 }
10698
10699 /* the library name is the same as the argument of the '-l' option */
10700 int tcc_add_library(TCCState *s, const char *libraryname)
10701 {
10702 char buf[1024];
10703 int i;
10704
10705 /* first we look for the dynamic library if not static linking */
10706 if (!s->static_link) {
10707 #ifdef TCC_TARGET_PE
10708 snprintf(buf, sizeof(buf), "%s.def", libraryname);
10709 #else
10710 snprintf(buf, sizeof(buf), "lib%s.so", libraryname);
10711 #endif
10712 if (tcc_add_dll(s, buf, 0) == 0)
10713 return 0;
10714 }
10715
10716 /* then we look for the static library */
10717 for(i = 0; i < s->nb_library_paths; i++) {
10718 snprintf(buf, sizeof(buf), "%s/lib%s.a",
10719 s->library_paths[i], libraryname);
10720 if (tcc_add_file_internal(s, buf, 0) == 0)
10721 return 0;
10722 }
10723 return -1;
10724 }
10725
10726 int tcc_add_symbol(TCCState *s, const char *name, unsigned long val)
10727 {
10728 add_elf_sym(symtab_section, val, 0,
10729 ELFW(ST_INFO)(STB_GLOBAL, STT_NOTYPE), 0,
10730 SHN_ABS, name);
10731 return 0;
10732 }
10733
10734 int tcc_set_output_type(TCCState *s, int output_type)
10735 {
10736 char buf[1024];
10737
10738 s->output_type = output_type;
10739
10740 if (!s->nostdinc) {
10741 /* default include paths */
10742 /* XXX: reverse order needed if -isystem support */
10743 #ifndef TCC_TARGET_PE
10744 tcc_add_sysinclude_path(s, CONFIG_SYSROOT "/usr/local/include");
10745 tcc_add_sysinclude_path(s, CONFIG_SYSROOT "/usr/include");
10746 #endif
10747 snprintf(buf, sizeof(buf), "%s/include", tcc_lib_path);
10748 tcc_add_sysinclude_path(s, buf);
10749 #ifdef TCC_TARGET_PE
10750 snprintf(buf, sizeof(buf), "%s/include/winapi", tcc_lib_path);
10751 tcc_add_sysinclude_path(s, buf);
10752 #endif
10753 }
10754
10755 /* if bound checking, then add corresponding sections */
10756 #ifdef CONFIG_TCC_BCHECK
10757 if (do_bounds_check) {
10758 /* define symbol */
10759 tcc_define_symbol(s, "__BOUNDS_CHECKING_ON", NULL);
10760 /* create bounds sections */
10761 bounds_section = new_section(s, ".bounds",
10762 SHT_PROGBITS, SHF_ALLOC);
10763 lbounds_section = new_section(s, ".lbounds",
10764 SHT_PROGBITS, SHF_ALLOC);
10765 }
10766 #endif
10767
10768 if (s->char_is_unsigned) {
10769 tcc_define_symbol(s, "__CHAR_UNSIGNED__", NULL);
10770 }
10771
10772 /* add debug sections */
10773 if (do_debug) {
10774 /* stab symbols */
10775 stab_section = new_section(s, ".stab", SHT_PROGBITS, 0);
10776 stab_section->sh_entsize = sizeof(Stab_Sym);
10777 stabstr_section = new_section(s, ".stabstr", SHT_STRTAB, 0);
10778 put_elf_str(stabstr_section, "");
10779 stab_section->link = stabstr_section;
10780 /* put first entry */
10781 put_stabs("", 0, 0, 0, 0);
10782 }
10783
10784 /* add libc crt1/crti objects */
10785 #ifndef TCC_TARGET_PE
10786 if ((output_type == TCC_OUTPUT_EXE || output_type == TCC_OUTPUT_DLL) &&
10787 !s->nostdlib) {
10788 if (output_type != TCC_OUTPUT_DLL)
10789 tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crt1.o");
10790 tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crti.o");
10791 }
10792 #endif
10793
10794 #ifdef TCC_TARGET_PE
10795 snprintf(buf, sizeof(buf), "%s/lib", tcc_lib_path);
10796 tcc_add_library_path(s, buf);
10797 #endif
10798
10799 return 0;
10800 }
10801
10802 #define WD_ALL 0x0001 /* warning is activated when using -Wall */
10803 #define FD_INVERT 0x0002 /* invert value before storing */
10804
10805 typedef struct FlagDef {
10806 uint16_t offset;
10807 uint16_t flags;
10808 const char *name;
10809 } FlagDef;
10810
10811 static const FlagDef warning_defs[] = {
10812 { offsetof(TCCState, warn_unsupported), 0, "unsupported" },
10813 { offsetof(TCCState, warn_write_strings), 0, "write-strings" },
10814 { offsetof(TCCState, warn_error), 0, "error" },
10815 { offsetof(TCCState, warn_implicit_function_declaration), WD_ALL,
10816 "implicit-function-declaration" },
10817 };
10818
10819 static int set_flag(TCCState *s, const FlagDef *flags, int nb_flags,
10820 const char *name, int value)
10821 {
10822 int i;
10823 const FlagDef *p;
10824 const char *r;
10825
10826 r = name;
10827 if (r[0] == 'n' && r[1] == 'o' && r[2] == '-') {
10828 r += 3;
10829 value = !value;
10830 }
10831 for(i = 0, p = flags; i < nb_flags; i++, p++) {
10832 if (!strcmp(r, p->name))
10833 goto found;
10834 }
10835 return -1;
10836 found:
10837 if (p->flags & FD_INVERT)
10838 value = !value;
10839 *(int *)((uint8_t *)s + p->offset) = value;
10840 return 0;
10841 }
10842
10843
10844 /* set/reset a warning */
10845 int tcc_set_warning(TCCState *s, const char *warning_name, int value)
10846 {
10847 int i;
10848 const FlagDef *p;
10849
10850 if (!strcmp(warning_name, "all")) {
10851 for(i = 0, p = warning_defs; i < countof(warning_defs); i++, p++) {
10852 if (p->flags & WD_ALL)
10853 *(int *)((uint8_t *)s + p->offset) = 1;
10854 }
10855 return 0;
10856 } else {
10857 return set_flag(s, warning_defs, countof(warning_defs),
10858 warning_name, value);
10859 }
10860 }
10861
10862 static const FlagDef flag_defs[] = {
10863 { offsetof(TCCState, char_is_unsigned), 0, "unsigned-char" },
10864 { offsetof(TCCState, char_is_unsigned), FD_INVERT, "signed-char" },
10865 { offsetof(TCCState, nocommon), FD_INVERT, "common" },
10866 { offsetof(TCCState, leading_underscore), 0, "leading-underscore" },
10867 };
10868
10869 /* set/reset a flag */
10870 int tcc_set_flag(TCCState *s, const char *flag_name, int value)
10871 {
10872 return set_flag(s, flag_defs, countof(flag_defs),
10873 flag_name, value);
10874 }
10875
10876 #if !defined(LIBTCC)
10877
10878 static int64_t getclock_us(void)
10879 {
10880 #ifdef _WIN32
10881 struct _timeb tb;
10882 _ftime(&tb);
10883 return (tb.time * 1000LL + tb.millitm) * 1000LL;
10884 #else
10885 struct timeval tv;
10886 gettimeofday(&tv, NULL);
10887 return tv.tv_sec * 1000000LL + tv.tv_usec;
10888 #endif
10889 }
10890
10891 void help(void)
10892 {
10893 printf("tcc version " TCC_VERSION " - Tiny C Compiler - Copyright (C) 2001-2006 Fabrice Bellard\n"
10894 "usage: tcc [-v] [-c] [-o outfile] [-Bdir] [-bench] [-Idir] [-Dsym[=val]] [-Usym]\n"
10895 " [-Wwarn] [-g] [-b] [-bt N] [-Ldir] [-llib] [-shared] [-soname name]\n"
10896 " [-static] [infile1 infile2...] [-run infile args...]\n"
10897 "\n"
10898 "General options:\n"
10899 " -v display current version, increase verbosity\n"
10900 " -c compile only - generate an object file\n"
10901 " -o outfile set output filename\n"
10902 " -Bdir set tcc internal library path\n"
10903 " -bench output compilation statistics\n"
10904 " -run run compiled source\n"
10905 " -fflag set or reset (with 'no-' prefix) 'flag' (see man page)\n"
10906 " -Wwarning set or reset (with 'no-' prefix) 'warning' (see man page)\n"
10907 " -w disable all warnings\n"
10908 "Preprocessor options:\n"
10909 " -E preprocess only\n"
10910 " -Idir add include path 'dir'\n"
10911 " -Dsym[=val] define 'sym' with value 'val'\n"
10912 " -Usym undefine 'sym'\n"
10913 "Linker options:\n"
10914 " -Ldir add library path 'dir'\n"
10915 " -llib link with dynamic or static library 'lib'\n"
10916 " -shared generate a shared library\n"
10917 " -soname set name for shared library to be used at runtime\n"
10918 " -static static linking\n"
10919 " -rdynamic export all global symbols to dynamic linker\n"
10920 " -r generate (relocatable) object file\n"
10921 "Debugger options:\n"
10922 " -g generate runtime debug info\n"
10923 #ifdef CONFIG_TCC_BCHECK
10924 " -b compile with built-in memory and bounds checker (implies -g)\n"
10925 #endif
10926 " -bt N show N callers in stack traces\n"
10927 );
10928 }
10929
10930 #define TCC_OPTION_HAS_ARG 0x0001
10931 #define TCC_OPTION_NOSEP 0x0002 /* cannot have space before option and arg */
10932
10933 typedef struct TCCOption {
10934 const char *name;
10935 uint16_t index;
10936 uint16_t flags;
10937 } TCCOption;
10938
10939 enum {
10940 TCC_OPTION_HELP,
10941 TCC_OPTION_I,
10942 TCC_OPTION_D,
10943 TCC_OPTION_U,
10944 TCC_OPTION_L,
10945 TCC_OPTION_B,
10946 TCC_OPTION_l,
10947 TCC_OPTION_bench,
10948 TCC_OPTION_bt,
10949 TCC_OPTION_b,
10950 TCC_OPTION_g,
10951 TCC_OPTION_c,
10952 TCC_OPTION_static,
10953 TCC_OPTION_shared,
10954 TCC_OPTION_soname,
10955 TCC_OPTION_o,
10956 TCC_OPTION_r,
10957 TCC_OPTION_Wl,
10958 TCC_OPTION_W,
10959 TCC_OPTION_O,
10960 TCC_OPTION_m,
10961 TCC_OPTION_f,
10962 TCC_OPTION_nostdinc,
10963 TCC_OPTION_nostdlib,
10964 TCC_OPTION_print_search_dirs,
10965 TCC_OPTION_rdynamic,
10966 TCC_OPTION_run,
10967 TCC_OPTION_v,
10968 TCC_OPTION_w,
10969 TCC_OPTION_pipe,
10970 TCC_OPTION_E,
10971 };
10972
10973 static const TCCOption tcc_options[] = {
10974 { "h", TCC_OPTION_HELP, 0 },
10975 { "?", TCC_OPTION_HELP, 0 },
10976 { "I", TCC_OPTION_I, TCC_OPTION_HAS_ARG },
10977 { "D", TCC_OPTION_D, TCC_OPTION_HAS_ARG },
10978 { "U", TCC_OPTION_U, TCC_OPTION_HAS_ARG },
10979 { "L", TCC_OPTION_L, TCC_OPTION_HAS_ARG },
10980 { "B", TCC_OPTION_B, TCC_OPTION_HAS_ARG },
10981 { "l", TCC_OPTION_l, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10982 { "bench", TCC_OPTION_bench, 0 },
10983 { "bt", TCC_OPTION_bt, TCC_OPTION_HAS_ARG },
10984 #ifdef CONFIG_TCC_BCHECK
10985 { "b", TCC_OPTION_b, 0 },
10986 #endif
10987 { "g", TCC_OPTION_g, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10988 { "c", TCC_OPTION_c, 0 },
10989 { "static", TCC_OPTION_static, 0 },
10990 { "shared", TCC_OPTION_shared, 0 },
10991 { "soname", TCC_OPTION_soname, TCC_OPTION_HAS_ARG },
10992 { "o", TCC_OPTION_o, TCC_OPTION_HAS_ARG },
10993 { "run", TCC_OPTION_run, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10994 { "rdynamic", TCC_OPTION_rdynamic, 0 },
10995 { "r", TCC_OPTION_r, 0 },
10996 { "Wl,", TCC_OPTION_Wl, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10997 { "W", TCC_OPTION_W, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10998 { "O", TCC_OPTION_O, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
10999 { "m", TCC_OPTION_m, TCC_OPTION_HAS_ARG },
11000 { "f", TCC_OPTION_f, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
11001 { "nostdinc", TCC_OPTION_nostdinc, 0 },
11002 { "nostdlib", TCC_OPTION_nostdlib, 0 },
11003 { "print-search-dirs", TCC_OPTION_print_search_dirs, 0 },
11004 { "v", TCC_OPTION_v, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP },
11005 { "w", TCC_OPTION_w, 0 },
11006 { "pipe", TCC_OPTION_pipe, 0},
11007 { "E", TCC_OPTION_E, 0},
11008 { NULL },
11009 };
11010
11011 /* convert 'str' into an array of space separated strings */
11012 static int expand_args(char ***pargv, const char *str)
11013 {
11014 const char *s1;
11015 char **argv, *arg;
11016 int argc, len;
11017
11018 argc = 0;
11019 argv = NULL;
11020 for(;;) {
11021 while (is_space(*str))
11022 str++;
11023 if (*str == '\0')
11024 break;
11025 s1 = str;
11026 while (*str != '\0' && !is_space(*str))
11027 str++;
11028 len = str - s1;
11029 arg = tcc_malloc(len + 1);
11030 memcpy(arg, s1, len);
11031 arg[len] = '\0';
11032 dynarray_add((void ***)&argv, &argc, arg);
11033 }
11034 *pargv = argv;
11035 return argc;
11036 }
11037
11038 static char **files;
11039 static int nb_files, nb_libraries;
11040 static int multiple_files;
11041 static int print_search_dirs;
11042 static int output_type;
11043 static int reloc_output;
11044 static const char *outfile;
11045
11046 int parse_args(TCCState *s, int argc, char **argv)
11047 {
11048 int optind;
11049 const TCCOption *popt;
11050 const char *optarg, *p1, *r1;
11051 char *r;
11052
11053 optind = 0;
11054 while (optind < argc) {
11055
11056 r = argv[optind++];
11057 if (r[0] != '-' || r[1] == '\0') {
11058 /* add a new file */
11059 dynarray_add((void ***)&files, &nb_files, r);
11060 if (!multiple_files) {
11061 optind--;
11062 /* argv[0] will be this file */
11063 break;
11064 }
11065 } else {
11066 /* find option in table (match only the first chars */
11067 popt = tcc_options;
11068 for(;;) {
11069 p1 = popt->name;
11070 if (p1 == NULL)
11071 error("invalid option -- '%s'", r);
11072 r1 = r + 1;
11073 for(;;) {
11074 if (*p1 == '\0')
11075 goto option_found;
11076 if (*r1 != *p1)
11077 break;
11078 p1++;
11079 r1++;
11080 }
11081 popt++;
11082 }
11083 option_found:
11084 if (popt->flags & TCC_OPTION_HAS_ARG) {
11085 if (*r1 != '\0' || (popt->flags & TCC_OPTION_NOSEP)) {
11086 optarg = r1;
11087 } else {
11088 if (optind >= argc)
11089 error("argument to '%s' is missing", r);
11090 optarg = argv[optind++];
11091 }
11092 } else {
11093 if (*r1 != '\0')
11094 return 0;
11095 optarg = NULL;
11096 }
11097
11098 switch(popt->index) {
11099 case TCC_OPTION_HELP:
11100 return 0;
11101
11102 case TCC_OPTION_I:
11103 if (tcc_add_include_path(s, optarg) < 0)
11104 error("too many include paths");
11105 break;
11106 case TCC_OPTION_D:
11107 {
11108 char *sym, *value;
11109 sym = (char *)optarg;
11110 value = strchr(sym, '=');
11111 if (value) {
11112 *value = '\0';
11113 value++;
11114 }
11115 tcc_define_symbol(s, sym, value);
11116 }
11117 break;
11118 case TCC_OPTION_U:
11119 tcc_undefine_symbol(s, optarg);
11120 break;
11121 case TCC_OPTION_L:
11122 tcc_add_library_path(s, optarg);
11123 break;
11124 case TCC_OPTION_B:
11125 /* set tcc utilities path (mainly for tcc development) */
11126 tcc_lib_path = optarg;
11127 break;
11128 case TCC_OPTION_l:
11129 dynarray_add((void ***)&files, &nb_files, r);
11130 nb_libraries++;
11131 break;
11132 case TCC_OPTION_bench:
11133 do_bench = 1;
11134 break;
11135 case TCC_OPTION_bt:
11136 num_callers = atoi(optarg);
11137 break;
11138 #ifdef CONFIG_TCC_BCHECK
11139 case TCC_OPTION_b:
11140 do_bounds_check = 1;
11141 do_debug = 1;
11142 break;
11143 #endif
11144 case TCC_OPTION_g:
11145 do_debug = 1;
11146 break;
11147 case TCC_OPTION_c:
11148 multiple_files = 1;
11149 output_type = TCC_OUTPUT_OBJ;
11150 break;
11151 case TCC_OPTION_static:
11152 s->static_link = 1;
11153 break;
11154 case TCC_OPTION_shared:
11155 output_type = TCC_OUTPUT_DLL;
11156 break;
11157 case TCC_OPTION_soname:
11158 s->soname = optarg;
11159 break;
11160 case TCC_OPTION_o:
11161 multiple_files = 1;
11162 outfile = optarg;
11163 break;
11164 case TCC_OPTION_r:
11165 /* generate a .o merging several output files */
11166 reloc_output = 1;
11167 output_type = TCC_OUTPUT_OBJ;
11168 break;
11169 case TCC_OPTION_nostdinc:
11170 s->nostdinc = 1;
11171 break;
11172 case TCC_OPTION_nostdlib:
11173 s->nostdlib = 1;
11174 break;
11175 case TCC_OPTION_print_search_dirs:
11176 print_search_dirs = 1;
11177 break;
11178 case TCC_OPTION_run:
11179 {
11180 int argc1;
11181 char **argv1;
11182 argc1 = expand_args(&argv1, optarg);
11183 if (argc1 > 0) {
11184 parse_args(s, argc1, argv1);
11185 }
11186 multiple_files = 0;
11187 output_type = TCC_OUTPUT_MEMORY;
11188 }
11189 break;
11190 case TCC_OPTION_v:
11191 do {
11192 if (0 == verbose++)
11193 printf("tcc version %s\n", TCC_VERSION);
11194 } while (*optarg++ == 'v');
11195 break;
11196 case TCC_OPTION_f:
11197 if (tcc_set_flag(s, optarg, 1) < 0 && s->warn_unsupported)
11198 goto unsupported_option;
11199 break;
11200 case TCC_OPTION_W:
11201 if (tcc_set_warning(s, optarg, 1) < 0 &&
11202 s->warn_unsupported)
11203 goto unsupported_option;
11204 break;
11205 case TCC_OPTION_w:
11206 s->warn_none = 1;
11207 break;
11208 case TCC_OPTION_rdynamic:
11209 s->rdynamic = 1;
11210 break;
11211 case TCC_OPTION_Wl:
11212 {
11213 const char *p;
11214 if (strstart(optarg, "-Ttext,", &p)) {
11215 s->text_addr = strtoul(p, NULL, 16);
11216 s->has_text_addr = 1;
11217 } else if (strstart(optarg, "--oformat,", &p)) {
11218 if (strstart(p, "elf32-", NULL)) {
11219 s->output_format = TCC_OUTPUT_FORMAT_ELF;
11220 } else if (!strcmp(p, "binary")) {
11221 s->output_format = TCC_OUTPUT_FORMAT_BINARY;
11222 } else
11223 #ifdef TCC_TARGET_COFF
11224 if (!strcmp(p, "coff")) {
11225 s->output_format = TCC_OUTPUT_FORMAT_COFF;
11226 } else
11227 #endif
11228 {
11229 error("target %s not found", p);
11230 }
11231 } else {
11232 error("unsupported linker option '%s'", optarg);
11233 }
11234 }
11235 break;
11236 case TCC_OPTION_E:
11237 output_type = TCC_OUTPUT_PREPROCESS;
11238 break;
11239 default:
11240 if (s->warn_unsupported) {
11241 unsupported_option:
11242 warning("unsupported option '%s'", r);
11243 }
11244 break;
11245 }
11246 }
11247 }
11248 return optind + 1;
11249 }
11250
11251 int main(int argc, char **argv)
11252 {
11253 int i;
11254 TCCState *s;
11255 int nb_objfiles, ret, optind;
11256 char objfilename[1024];
11257 int64_t start_time = 0;
11258
11259 #ifdef _WIN32
11260 tcc_lib_path = w32_tcc_lib_path();
11261 #endif
11262
11263 s = tcc_new();
11264 output_type = TCC_OUTPUT_EXE;
11265 outfile = NULL;
11266 multiple_files = 1;
11267 files = NULL;
11268 nb_files = 0;
11269 nb_libraries = 0;
11270 reloc_output = 0;
11271 print_search_dirs = 0;
11272 ret = 0;
11273
11274 optind = parse_args(s, argc - 1, argv + 1);
11275 if (print_search_dirs) {
11276 /* enough for Linux kernel */
11277 printf("install: %s/\n", tcc_lib_path);
11278 return 0;
11279 }
11280 if (optind == 0 || nb_files == 0) {
11281 if (optind && verbose)
11282 return 0;
11283 help();
11284 return 1;
11285 }
11286
11287 nb_objfiles = nb_files - nb_libraries;
11288
11289 /* if outfile provided without other options, we output an
11290 executable */
11291 if (outfile && output_type == TCC_OUTPUT_MEMORY)
11292 output_type = TCC_OUTPUT_EXE;
11293
11294 /* check -c consistency : only single file handled. XXX: checks file type */
11295 if (output_type == TCC_OUTPUT_OBJ && !reloc_output) {
11296 /* accepts only a single input file */
11297 if (nb_objfiles != 1)
11298 error("cannot specify multiple files with -c");
11299 if (nb_libraries != 0)
11300 error("cannot specify libraries with -c");
11301 }
11302
11303
11304 if (output_type == TCC_OUTPUT_PREPROCESS) {
11305 if (!outfile) {
11306 s->outfile = stdout;
11307 } else {
11308 s->outfile = fopen(outfile, "w");
11309 if (!s->outfile)
11310 error("could not open '%s", outfile);
11311 }
11312 } else if (output_type != TCC_OUTPUT_MEMORY) {
11313 if (!outfile) {
11314 /* compute default outfile name */
11315 char *ext;
11316 const char *name =
11317 strcmp(files[0], "-") == 0 ? "a" : tcc_basename(files[0]);
11318 pstrcpy(objfilename, sizeof(objfilename), name);
11319 ext = tcc_fileextension(objfilename);
11320 #ifdef TCC_TARGET_PE
11321 if (output_type == TCC_OUTPUT_DLL)
11322 strcpy(ext, ".dll");
11323 else
11324 if (output_type == TCC_OUTPUT_EXE)
11325 strcpy(ext, ".exe");
11326 else
11327 #endif
11328 if (output_type == TCC_OUTPUT_OBJ && !reloc_output && *ext)
11329 strcpy(ext, ".o");
11330 else
11331 pstrcpy(objfilename, sizeof(objfilename), "a.out");
11332 outfile = objfilename;
11333 }
11334 }
11335
11336 if (do_bench) {
11337 start_time = getclock_us();
11338 }
11339
11340 tcc_set_output_type(s, output_type);
11341
11342 /* compile or add each files or library */
11343 for(i = 0; i < nb_files && ret == 0; i++) {
11344 const char *filename;
11345
11346 filename = files[i];
11347 if (output_type == TCC_OUTPUT_PREPROCESS) {
11348 if (tcc_add_file_internal(s, filename,
11349 AFF_PRINT_ERROR | AFF_PREPROCESS) < 0)
11350 ret = 1;
11351 } else if (filename[0] == '-' && filename[1]) {
11352 if (tcc_add_library(s, filename + 2) < 0)
11353 error("cannot find %s", filename);
11354 } else {
11355 if (1 == verbose)
11356 printf("-> %s\n", filename);
11357 if (tcc_add_file(s, filename) < 0)
11358 ret = 1;
11359 }
11360 }
11361
11362 /* free all files */
11363 tcc_free(files);
11364
11365 if (ret)
11366 goto the_end;
11367
11368 if (do_bench) {
11369 double total_time;
11370 total_time = (double)(getclock_us() - start_time) / 1000000.0;
11371 if (total_time < 0.001)
11372 total_time = 0.001;
11373 if (total_bytes < 1)
11374 total_bytes = 1;
11375 printf("%d idents, %d lines, %d bytes, %0.3f s, %d lines/s, %0.1f MB/s\n",
11376 tok_ident - TOK_IDENT, total_lines, total_bytes,
11377 total_time, (int)(total_lines / total_time),
11378 total_bytes / total_time / 1000000.0);
11379 }
11380
11381 if (s->output_type == TCC_OUTPUT_PREPROCESS) {
11382 if (outfile)
11383 fclose(s->outfile);
11384 } else if (s->output_type == TCC_OUTPUT_MEMORY) {
11385 ret = tcc_run(s, argc - optind, argv + optind);
11386 } else
11387 ret = tcc_output_file(s, outfile) ? 1 : 0;
11388 the_end:
11389 /* XXX: cannot do it with bound checking because of the malloc hooks */
11390 if (!do_bounds_check)
11391 tcc_delete(s);
11392
11393 #ifdef MEM_DEBUG
11394 if (do_bench) {
11395 printf("memory: %d bytes, max = %d bytes\n", mem_cur_size, mem_max_size);
11396 }
11397 #endif
11398 return ret;
11399 }
11400
11401 #endif
tinycc fork to help me test changes before commit to mob