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