tcc help output for the -xc -xa - options
[tinycc.git] / tccgen.c
bloba3ad066590d749b9a398cca02685ad9a1c8b9a78
1 /*
2 * TCC - Tiny C Compiler
3 *
4 * Copyright (c) 2001-2004 Fabrice Bellard
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21 #include "tcc.h"
23 /********************************************************/
24 /* global variables */
26 /* loc : local variable index
27 ind : output code index
28 rsym: return symbol
29 anon_sym: anonymous symbol index
31 ST_DATA int rsym, anon_sym, ind, loc;
33 ST_DATA Section *text_section, *data_section, *bss_section; /* predefined sections */
34 ST_DATA Section *cur_text_section; /* current section where function code is generated */
35 #ifdef CONFIG_TCC_ASM
36 ST_DATA Section *last_text_section; /* to handle .previous asm directive */
37 #endif
38 #ifdef CONFIG_TCC_BCHECK
39 /* bound check related sections */
40 ST_DATA Section *bounds_section; /* contains global data bound description */
41 ST_DATA Section *lbounds_section; /* contains local data bound description */
42 #endif
43 /* symbol sections */
44 ST_DATA Section *symtab_section, *strtab_section;
45 /* debug sections */
46 ST_DATA Section *stab_section, *stabstr_section;
47 ST_DATA Sym *sym_free_first;
48 ST_DATA void **sym_pools;
49 ST_DATA int nb_sym_pools;
51 ST_DATA Sym *global_stack;
52 ST_DATA Sym *local_stack;
53 ST_DATA Sym *scope_stack_bottom;
54 ST_DATA Sym *define_stack;
55 ST_DATA Sym *global_label_stack;
56 ST_DATA Sym *local_label_stack;
58 ST_DATA int vlas_in_scope; /* number of VLAs that are currently in scope */
59 ST_DATA int vla_sp_root_loc; /* vla_sp_loc for SP before any VLAs were pushed */
60 ST_DATA int vla_sp_loc; /* Pointer to variable holding location to store stack pointer on the stack when modifying stack pointer */
62 ST_DATA SValue __vstack[1+VSTACK_SIZE], *vtop, *pvtop;
64 ST_DATA int const_wanted; /* true if constant wanted */
65 ST_DATA int nocode_wanted; /* true if no code generation wanted for an expression */
66 ST_DATA int global_expr; /* true if compound literals must be allocated globally (used during initializers parsing */
67 ST_DATA CType func_vt; /* current function return type (used by return instruction) */
68 ST_DATA int func_var; /* true if current function is variadic (used by return instruction) */
69 ST_DATA int func_vc;
70 ST_DATA int last_line_num, last_ind, func_ind; /* debug last line number and pc */
71 ST_DATA const char *funcname;
73 ST_DATA CType char_pointer_type, func_old_type, int_type, size_type;
75 /* ------------------------------------------------------------------------- */
76 static void gen_cast(CType *type);
77 static inline CType *pointed_type(CType *type);
78 static int is_compatible_types(CType *type1, CType *type2);
79 static int parse_btype(CType *type, AttributeDef *ad);
80 static void type_decl(CType *type, AttributeDef *ad, int *v, int td);
81 static void parse_expr_type(CType *type);
82 static void decl_initializer(CType *type, Section *sec, unsigned long c, int first, int size_only);
83 static void block(int *bsym, int *csym, int *case_sym, int *def_sym, int case_reg, int is_expr);
84 static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r, int has_init, int v, char *asm_label, int scope);
85 static int decl0(int l, int is_for_loop_init);
86 static void expr_eq(void);
87 static void unary_type(CType *type);
88 static void vla_runtime_type_size(CType *type, int *a);
89 static void vla_sp_restore(void);
90 static void vla_sp_restore_root(void);
91 static int is_compatible_parameter_types(CType *type1, CType *type2);
92 static void expr_type(CType *type);
93 ST_FUNC void vpush64(int ty, unsigned long long v);
94 ST_FUNC void vpush(CType *type);
95 ST_FUNC int gvtst(int inv, int t);
96 ST_FUNC int is_btype_size(int bt);
98 ST_INLN int is_float(int t)
100 int bt;
101 bt = t & VT_BTYPE;
102 return bt == VT_LDOUBLE || bt == VT_DOUBLE || bt == VT_FLOAT || bt == VT_QFLOAT;
105 /* we use our own 'finite' function to avoid potential problems with
106 non standard math libs */
107 /* XXX: endianness dependent */
108 ST_FUNC int ieee_finite(double d)
110 int p[4];
111 memcpy(p, &d, sizeof(double));
112 return ((unsigned)((p[1] | 0x800fffff) + 1)) >> 31;
115 ST_FUNC void test_lvalue(void)
117 if (!(vtop->r & VT_LVAL))
118 expect("lvalue");
121 ST_FUNC void check_vstack(void)
123 if (pvtop != vtop)
124 tcc_error("internal compiler error: vstack leak (%d)", vtop - pvtop);
127 /* ------------------------------------------------------------------------- */
128 /* symbol allocator */
129 static Sym *__sym_malloc(void)
131 Sym *sym_pool, *sym, *last_sym;
132 int i;
134 sym_pool = tcc_malloc(SYM_POOL_NB * sizeof(Sym));
135 dynarray_add(&sym_pools, &nb_sym_pools, sym_pool);
137 last_sym = sym_free_first;
138 sym = sym_pool;
139 for(i = 0; i < SYM_POOL_NB; i++) {
140 sym->next = last_sym;
141 last_sym = sym;
142 sym++;
144 sym_free_first = last_sym;
145 return last_sym;
148 static inline Sym *sym_malloc(void)
150 Sym *sym;
151 sym = sym_free_first;
152 if (!sym)
153 sym = __sym_malloc();
154 sym_free_first = sym->next;
155 return sym;
158 ST_INLN void sym_free(Sym *sym)
160 sym->next = sym_free_first;
161 tcc_free(sym->asm_label);
162 sym_free_first = sym;
165 /* push, without hashing */
166 ST_FUNC Sym *sym_push2(Sym **ps, int v, int t, long c)
168 Sym *s;
169 if (ps == &local_stack) {
170 for (s = *ps; s && s != scope_stack_bottom; s = s->prev)
171 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM && s->v == v)
172 tcc_error("incompatible types for redefinition of '%s'",
173 get_tok_str(v, NULL));
175 s = sym_malloc();
176 s->asm_label = NULL;
177 s->v = v;
178 s->type.t = t;
179 s->type.ref = NULL;
180 #ifdef _WIN64
181 s->d = NULL;
182 #endif
183 s->c = c;
184 s->next = NULL;
185 /* add in stack */
186 s->prev = *ps;
187 *ps = s;
188 return s;
191 /* find a symbol and return its associated structure. 's' is the top
192 of the symbol stack */
193 ST_FUNC Sym *sym_find2(Sym *s, int v)
195 while (s) {
196 if (s->v == v)
197 return s;
198 else if (s->v == -1)
199 return NULL;
200 s = s->prev;
202 return NULL;
205 /* structure lookup */
206 ST_INLN Sym *struct_find(int v)
208 v -= TOK_IDENT;
209 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
210 return NULL;
211 return table_ident[v]->sym_struct;
214 /* find an identifier */
215 ST_INLN Sym *sym_find(int v)
217 v -= TOK_IDENT;
218 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
219 return NULL;
220 return table_ident[v]->sym_identifier;
223 /* push a given symbol on the symbol stack */
224 ST_FUNC Sym *sym_push(int v, CType *type, int r, int c)
226 Sym *s, **ps;
227 TokenSym *ts;
229 if (local_stack)
230 ps = &local_stack;
231 else
232 ps = &global_stack;
233 s = sym_push2(ps, v, type->t, c);
234 s->type.ref = type->ref;
235 s->r = r;
236 /* don't record fields or anonymous symbols */
237 /* XXX: simplify */
238 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
239 /* record symbol in token array */
240 ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT];
241 if (v & SYM_STRUCT)
242 ps = &ts->sym_struct;
243 else
244 ps = &ts->sym_identifier;
245 s->prev_tok = *ps;
246 *ps = s;
248 return s;
251 /* push a global identifier */
252 ST_FUNC Sym *global_identifier_push(int v, int t, int c)
254 Sym *s, **ps;
255 s = sym_push2(&global_stack, v, t, c);
256 /* don't record anonymous symbol */
257 if (v < SYM_FIRST_ANOM) {
258 ps = &table_ident[v - TOK_IDENT]->sym_identifier;
259 /* modify the top most local identifier, so that
260 sym_identifier will point to 's' when popped */
261 while (*ps != NULL)
262 ps = &(*ps)->prev_tok;
263 s->prev_tok = NULL;
264 *ps = s;
266 return s;
269 /* pop symbols until top reaches 'b' */
270 ST_FUNC void sym_pop(Sym **ptop, Sym *b)
272 Sym *s, *ss, **ps;
273 TokenSym *ts;
274 int v;
276 s = *ptop;
277 while(s != b) {
278 ss = s->prev;
279 v = s->v;
280 /* remove symbol in token array */
281 /* XXX: simplify */
282 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
283 ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT];
284 if (v & SYM_STRUCT)
285 ps = &ts->sym_struct;
286 else
287 ps = &ts->sym_identifier;
288 *ps = s->prev_tok;
290 sym_free(s);
291 s = ss;
293 *ptop = b;
296 static void weaken_symbol(Sym *sym)
298 sym->type.t |= VT_WEAK;
299 if (sym->c > 0) {
300 int esym_type;
301 ElfW(Sym) *esym;
303 esym = &((ElfW(Sym) *)symtab_section->data)[sym->c];
304 esym_type = ELFW(ST_TYPE)(esym->st_info);
305 esym->st_info = ELFW(ST_INFO)(STB_WEAK, esym_type);
309 static void apply_visibility(Sym *sym, CType *type)
311 int vis = sym->type.t & VT_VIS_MASK;
312 int vis2 = type->t & VT_VIS_MASK;
313 if (vis == (STV_DEFAULT << VT_VIS_SHIFT))
314 vis = vis2;
315 else if (vis2 == (STV_DEFAULT << VT_VIS_SHIFT))
317 else
318 vis = (vis < vis2) ? vis : vis2;
319 sym->type.t &= ~VT_VIS_MASK;
320 sym->type.t |= vis;
322 if (sym->c > 0) {
323 ElfW(Sym) *esym;
325 esym = &((ElfW(Sym) *)symtab_section->data)[sym->c];
326 vis >>= VT_VIS_SHIFT;
327 esym->st_other = (esym->st_other & ~ELFW(ST_VISIBILITY)(-1)) | vis;
331 /* ------------------------------------------------------------------------- */
333 ST_FUNC void swap(int *p, int *q)
335 int t;
336 t = *p;
337 *p = *q;
338 *q = t;
341 static void vsetc(CType *type, int r, CValue *vc)
343 int v;
345 if (vtop >= vstack + (VSTACK_SIZE - 1))
346 tcc_error("memory full (vstack)");
347 /* cannot let cpu flags if other instruction are generated. Also
348 avoid leaving VT_JMP anywhere except on the top of the stack
349 because it would complicate the code generator. */
350 if (vtop >= vstack) {
351 v = vtop->r & VT_VALMASK;
352 if (v == VT_CMP || (v & ~1) == VT_JMP)
353 gv(RC_INT);
355 vtop++;
356 vtop->type = *type;
357 vtop->r = r;
358 vtop->r2 = VT_CONST;
359 vtop->c = *vc;
362 /* push constant of type "type" with useless value */
363 ST_FUNC void vpush(CType *type)
365 CValue cval;
366 vsetc(type, VT_CONST, &cval);
369 /* push integer constant */
370 ST_FUNC void vpushi(int v)
372 CValue cval;
373 cval.i = v;
374 vsetc(&int_type, VT_CONST, &cval);
377 /* push a pointer sized constant */
378 static void vpushs(addr_t v)
380 CValue cval;
381 cval.ptr_offset = v;
382 vsetc(&size_type, VT_CONST, &cval);
385 /* push arbitrary 64bit constant */
386 ST_FUNC void vpush64(int ty, unsigned long long v)
388 CValue cval;
389 CType ctype;
390 ctype.t = ty;
391 ctype.ref = NULL;
392 cval.ull = v;
393 vsetc(&ctype, VT_CONST, &cval);
396 /* push long long constant */
397 static inline void vpushll(long long v)
399 vpush64(VT_LLONG, v);
402 /* push a symbol value of TYPE */
403 static inline void vpushsym(CType *type, Sym *sym)
405 CValue cval;
406 cval.ptr_offset = 0;
407 vsetc(type, VT_CONST | VT_SYM, &cval);
408 vtop->sym = sym;
411 /* Return a static symbol pointing to a section */
412 ST_FUNC Sym *get_sym_ref(CType *type, Section *sec, unsigned long offset, unsigned long size)
414 int v;
415 Sym *sym;
417 v = anon_sym++;
418 sym = global_identifier_push(v, type->t | VT_STATIC, 0);
419 sym->type.ref = type->ref;
420 sym->r = VT_CONST | VT_SYM;
421 put_extern_sym(sym, sec, offset, size);
422 return sym;
425 /* push a reference to a section offset by adding a dummy symbol */
426 static void vpush_ref(CType *type, Section *sec, unsigned long offset, unsigned long size)
428 vpushsym(type, get_sym_ref(type, sec, offset, size));
431 /* define a new external reference to a symbol 'v' of type 'u' */
432 ST_FUNC Sym *external_global_sym(int v, CType *type, int r)
434 Sym *s;
436 s = sym_find(v);
437 if (!s) {
438 /* push forward reference */
439 s = global_identifier_push(v, type->t | VT_EXTERN, 0);
440 s->type.ref = type->ref;
441 s->r = r | VT_CONST | VT_SYM;
443 return s;
446 /* define a new external reference to a symbol 'v' with alternate asm
447 name 'asm_label' of type 'u'. 'asm_label' is equal to NULL if there
448 is no alternate name (most cases) */
449 static Sym *external_sym(int v, CType *type, int r, char *asm_label)
451 Sym *s;
453 s = sym_find(v);
454 if (!s) {
455 /* push forward reference */
456 s = sym_push(v, type, r | VT_CONST | VT_SYM, 0);
457 s->asm_label = asm_label;
458 s->type.t |= VT_EXTERN;
459 } else if (s->type.ref == func_old_type.ref) {
460 s->type.ref = type->ref;
461 s->r = r | VT_CONST | VT_SYM;
462 s->type.t |= VT_EXTERN;
463 } else if (!is_compatible_types(&s->type, type)) {
464 tcc_error("incompatible types for redefinition of '%s'",
465 get_tok_str(v, NULL));
467 /* Merge some storage attributes. */
468 if (type->t & VT_WEAK)
469 weaken_symbol(s);
471 if (type->t & VT_VIS_MASK)
472 apply_visibility(s, type);
474 return s;
477 /* push a reference to global symbol v */
478 ST_FUNC void vpush_global_sym(CType *type, int v)
480 vpushsym(type, external_global_sym(v, type, 0));
483 ST_FUNC void vset(CType *type, int r, int v)
485 CValue cval;
487 cval.i = v;
488 vsetc(type, r, &cval);
491 static void vseti(int r, int v)
493 CType type;
494 type.t = VT_INT;
495 type.ref = 0;
496 vset(&type, r, v);
499 ST_FUNC void vswap(void)
501 SValue tmp;
502 /* cannot let cpu flags if other instruction are generated. Also
503 avoid leaving VT_JMP anywhere except on the top of the stack
504 because it would complicate the code generator. */
505 if (vtop >= vstack) {
506 int v = vtop->r & VT_VALMASK;
507 if (v == VT_CMP || (v & ~1) == VT_JMP)
508 gv(RC_INT);
510 tmp = vtop[0];
511 vtop[0] = vtop[-1];
512 vtop[-1] = tmp;
514 /* XXX: +2% overall speed possible with optimized memswap
516 * memswap(&vtop[0], &vtop[1], sizeof *vtop);
520 ST_FUNC void vpushv(SValue *v)
522 if (vtop >= vstack + (VSTACK_SIZE - 1))
523 tcc_error("memory full (vstack)");
524 vtop++;
525 *vtop = *v;
528 static void vdup(void)
530 vpushv(vtop);
533 /* save r to the memory stack, and mark it as being free */
534 ST_FUNC void save_reg(int r)
536 int l, saved, size, align;
537 SValue *p, sv;
538 CType *type;
540 /* modify all stack values */
541 saved = 0;
542 l = 0;
543 for(p=vstack;p<=vtop;p++) {
544 if ((p->r & VT_VALMASK) == r ||
545 ((p->type.t & VT_BTYPE) == VT_LLONG && (p->r2 & VT_VALMASK) == r)) {
546 /* must save value on stack if not already done */
547 if (!saved) {
548 /* NOTE: must reload 'r' because r might be equal to r2 */
549 r = p->r & VT_VALMASK;
550 /* store register in the stack */
551 type = &p->type;
552 if ((p->r & VT_LVAL) ||
553 (!is_float(type->t) && (type->t & VT_BTYPE) != VT_LLONG))
554 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
555 type = &char_pointer_type;
556 #else
557 type = &int_type;
558 #endif
559 size = type_size(type, &align);
560 loc = (loc - size) & -align;
561 sv.type.t = type->t;
562 sv.r = VT_LOCAL | VT_LVAL;
563 sv.c.ul = loc;
564 store(r, &sv);
565 #if defined(TCC_TARGET_I386) || defined(TCC_TARGET_X86_64)
566 /* x86 specific: need to pop fp register ST0 if saved */
567 if (r == TREG_ST0) {
568 o(0xd8dd); /* fstp %st(0) */
570 #endif
571 #if !defined(TCC_TARGET_ARM64) && !defined(TCC_TARGET_X86_64)
572 /* special long long case */
573 if ((type->t & VT_BTYPE) == VT_LLONG) {
574 sv.c.ul += 4;
575 store(p->r2, &sv);
577 #endif
578 l = loc;
579 saved = 1;
581 /* mark that stack entry as being saved on the stack */
582 if (p->r & VT_LVAL) {
583 /* also clear the bounded flag because the
584 relocation address of the function was stored in
585 p->c.ul */
586 p->r = (p->r & ~(VT_VALMASK | VT_BOUNDED)) | VT_LLOCAL;
587 } else {
588 p->r = lvalue_type(p->type.t) | VT_LOCAL;
590 p->r2 = VT_CONST;
591 p->c.ul = l;
596 #ifdef TCC_TARGET_ARM
597 /* find a register of class 'rc2' with at most one reference on stack.
598 * If none, call get_reg(rc) */
599 ST_FUNC int get_reg_ex(int rc, int rc2)
601 int r;
602 SValue *p;
604 for(r=0;r<NB_REGS;r++) {
605 if (reg_classes[r] & rc2) {
606 int n;
607 n=0;
608 for(p = vstack; p <= vtop; p++) {
609 if ((p->r & VT_VALMASK) == r ||
610 (p->r2 & VT_VALMASK) == r)
611 n++;
613 if (n <= 1)
614 return r;
617 return get_reg(rc);
619 #endif
621 /* find a free register of class 'rc'. If none, save one register */
622 ST_FUNC int get_reg(int rc)
624 int r;
625 SValue *p;
627 /* find a free register */
628 for(r=0;r<NB_REGS;r++) {
629 if (reg_classes[r] & rc) {
630 for(p=vstack;p<=vtop;p++) {
631 if ((p->r & VT_VALMASK) == r ||
632 (p->r2 & VT_VALMASK) == r)
633 goto notfound;
635 return r;
637 notfound: ;
640 /* no register left : free the first one on the stack (VERY
641 IMPORTANT to start from the bottom to ensure that we don't
642 spill registers used in gen_opi()) */
643 for(p=vstack;p<=vtop;p++) {
644 /* look at second register (if long long) */
645 r = p->r2 & VT_VALMASK;
646 if (r < VT_CONST && (reg_classes[r] & rc))
647 goto save_found;
648 r = p->r & VT_VALMASK;
649 if (r < VT_CONST && (reg_classes[r] & rc)) {
650 save_found:
651 save_reg(r);
652 return r;
655 /* Should never comes here */
656 return -1;
659 /* save registers up to (vtop - n) stack entry */
660 ST_FUNC void save_regs(int n)
662 int r;
663 SValue *p, *p1;
664 p1 = vtop - n;
665 for(p = vstack;p <= p1; p++) {
666 r = p->r & VT_VALMASK;
667 if (r < VT_CONST) {
668 save_reg(r);
673 /* move register 's' (of type 't') to 'r', and flush previous value of r to memory
674 if needed */
675 static void move_reg(int r, int s, int t)
677 SValue sv;
679 if (r != s) {
680 save_reg(r);
681 sv.type.t = t;
682 sv.type.ref = NULL;
683 sv.r = s;
684 sv.c.ul = 0;
685 load(r, &sv);
689 /* get address of vtop (vtop MUST BE an lvalue) */
690 ST_FUNC void gaddrof(void)
692 if (vtop->r & VT_REF && !nocode_wanted)
693 gv(RC_INT);
694 vtop->r &= ~VT_LVAL;
695 /* tricky: if saved lvalue, then we can go back to lvalue */
696 if ((vtop->r & VT_VALMASK) == VT_LLOCAL)
697 vtop->r = (vtop->r & ~(VT_VALMASK | VT_LVAL_TYPE)) | VT_LOCAL | VT_LVAL;
702 #ifdef CONFIG_TCC_BCHECK
703 /* generate lvalue bound code */
704 static void gbound(void)
706 int lval_type;
707 CType type1;
709 vtop->r &= ~VT_MUSTBOUND;
710 /* if lvalue, then use checking code before dereferencing */
711 if (vtop->r & VT_LVAL) {
712 /* if not VT_BOUNDED value, then make one */
713 if (!(vtop->r & VT_BOUNDED)) {
714 lval_type = vtop->r & (VT_LVAL_TYPE | VT_LVAL);
715 /* must save type because we must set it to int to get pointer */
716 type1 = vtop->type;
717 vtop->type.t = VT_PTR;
718 gaddrof();
719 vpushi(0);
720 gen_bounded_ptr_add();
721 vtop->r |= lval_type;
722 vtop->type = type1;
724 /* then check for dereferencing */
725 gen_bounded_ptr_deref();
728 #endif
730 /* store vtop a register belonging to class 'rc'. lvalues are
731 converted to values. Cannot be used if cannot be converted to
732 register value (such as structures). */
733 ST_FUNC int gv(int rc)
735 int r, bit_pos, bit_size, size, align, i;
736 int rc2;
738 /* NOTE: get_reg can modify vstack[] */
739 if (vtop->type.t & VT_BITFIELD) {
740 CType type;
741 int bits = 32;
742 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
743 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
744 /* remove bit field info to avoid loops */
745 vtop->type.t &= ~VT_BITFIELD & ((1 << VT_STRUCT_SHIFT) - 1);
746 /* cast to int to propagate signedness in following ops */
747 if ((vtop->type.t & VT_BTYPE) == VT_LLONG) {
748 type.t = VT_LLONG;
749 bits = 64;
750 } else
751 type.t = VT_INT;
752 if((vtop->type.t & VT_UNSIGNED) ||
753 (vtop->type.t & VT_BTYPE) == VT_BOOL)
754 type.t |= VT_UNSIGNED;
755 gen_cast(&type);
756 /* generate shifts */
757 vpushi(bits - (bit_pos + bit_size));
758 gen_op(TOK_SHL);
759 vpushi(bits - bit_size);
760 /* NOTE: transformed to SHR if unsigned */
761 gen_op(TOK_SAR);
762 r = gv(rc);
763 } else {
764 if (is_float(vtop->type.t) &&
765 (vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
766 Sym *sym;
767 int *ptr;
768 unsigned long offset;
769 #if defined(TCC_TARGET_ARM) && !defined(TCC_ARM_VFP)
770 CValue check;
771 #endif
773 /* XXX: unify with initializers handling ? */
774 /* CPUs usually cannot use float constants, so we store them
775 generically in data segment */
776 size = type_size(&vtop->type, &align);
777 offset = (data_section->data_offset + align - 1) & -align;
778 data_section->data_offset = offset;
779 /* XXX: not portable yet */
780 #if defined(__i386__) || defined(__x86_64__)
781 /* Zero pad x87 tenbyte long doubles */
782 if (size == LDOUBLE_SIZE) {
783 vtop->c.tab[2] &= 0xffff;
784 #if LDOUBLE_SIZE == 16
785 vtop->c.tab[3] = 0;
786 #endif
788 #endif
789 ptr = section_ptr_add(data_section, size);
790 size = size >> 2;
791 #if defined(TCC_TARGET_ARM) && !defined(TCC_ARM_VFP)
792 check.d = 1;
793 if(check.tab[0])
794 for(i=0;i<size;i++)
795 ptr[i] = vtop->c.tab[size-1-i];
796 else
797 #endif
798 for(i=0;i<size;i++)
799 ptr[i] = vtop->c.tab[i];
800 sym = get_sym_ref(&vtop->type, data_section, offset, size << 2);
801 vtop->r |= VT_LVAL | VT_SYM;
802 vtop->sym = sym;
803 vtop->c.ptr_offset = 0;
805 #ifdef CONFIG_TCC_BCHECK
806 if (vtop->r & VT_MUSTBOUND)
807 gbound();
808 #endif
810 r = vtop->r & VT_VALMASK;
811 rc2 = (rc & RC_FLOAT) ? RC_FLOAT : RC_INT;
812 #ifndef TCC_TARGET_ARM64
813 if (rc == RC_IRET)
814 rc2 = RC_LRET;
815 #ifdef TCC_TARGET_X86_64
816 else if (rc == RC_FRET)
817 rc2 = RC_QRET;
818 #endif
819 #endif
821 /* need to reload if:
822 - constant
823 - lvalue (need to dereference pointer)
824 - already a register, but not in the right class */
825 if (r >= VT_CONST
826 || (vtop->r & VT_LVAL)
827 || !(reg_classes[r] & rc)
828 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
829 || ((vtop->type.t & VT_BTYPE) == VT_QLONG && !(reg_classes[vtop->r2] & rc2))
830 || ((vtop->type.t & VT_BTYPE) == VT_QFLOAT && !(reg_classes[vtop->r2] & rc2))
831 #else
832 || ((vtop->type.t & VT_BTYPE) == VT_LLONG && !(reg_classes[vtop->r2] & rc2))
833 #endif
836 r = get_reg(rc);
837 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
838 if (((vtop->type.t & VT_BTYPE) == VT_QLONG) || ((vtop->type.t & VT_BTYPE) == VT_QFLOAT)) {
839 int addr_type = VT_LLONG, load_size = 8, load_type = ((vtop->type.t & VT_BTYPE) == VT_QLONG) ? VT_LLONG : VT_DOUBLE;
840 #else
841 if ((vtop->type.t & VT_BTYPE) == VT_LLONG) {
842 int addr_type = VT_INT, load_size = 4, load_type = VT_INT;
843 unsigned long long ll;
844 #endif
845 int r2, original_type;
846 original_type = vtop->type.t;
847 /* two register type load : expand to two words
848 temporarily */
849 #if !defined(TCC_TARGET_ARM64) && !defined(TCC_TARGET_X86_64)
850 if ((vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
851 /* load constant */
852 ll = vtop->c.ull;
853 vtop->c.ui = ll; /* first word */
854 load(r, vtop);
855 vtop->r = r; /* save register value */
856 vpushi(ll >> 32); /* second word */
857 } else
858 #endif
859 if (r >= VT_CONST || /* XXX: test to VT_CONST incorrect ? */
860 (vtop->r & VT_LVAL)) {
861 /* We do not want to modifier the long long
862 pointer here, so the safest (and less
863 efficient) is to save all the other registers
864 in the stack. XXX: totally inefficient. */
865 save_regs(1);
866 /* load from memory */
867 vtop->type.t = load_type;
868 load(r, vtop);
869 vdup();
870 vtop[-1].r = r; /* save register value */
871 /* increment pointer to get second word */
872 vtop->type.t = addr_type;
873 gaddrof();
874 vpushi(load_size);
875 gen_op('+');
876 vtop->r |= VT_LVAL;
877 vtop->type.t = load_type;
878 } else {
879 /* move registers */
880 load(r, vtop);
881 vdup();
882 vtop[-1].r = r; /* save register value */
883 vtop->r = vtop[-1].r2;
885 /* Allocate second register. Here we rely on the fact that
886 get_reg() tries first to free r2 of an SValue. */
887 r2 = get_reg(rc2);
888 load(r2, vtop);
889 vpop();
890 /* write second register */
891 vtop->r2 = r2;
892 vtop->type.t = original_type;
893 } else if ((vtop->r & VT_LVAL) && !is_float(vtop->type.t)) {
894 int t1, t;
895 /* lvalue of scalar type : need to use lvalue type
896 because of possible cast */
897 t = vtop->type.t;
898 t1 = t;
899 /* compute memory access type */
900 if (vtop->r & VT_REF)
901 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
902 t = VT_PTR;
903 #else
904 t = VT_INT;
905 #endif
906 else if (vtop->r & VT_LVAL_BYTE)
907 t = VT_BYTE;
908 else if (vtop->r & VT_LVAL_SHORT)
909 t = VT_SHORT;
910 if (vtop->r & VT_LVAL_UNSIGNED)
911 t |= VT_UNSIGNED;
912 vtop->type.t = t;
913 load(r, vtop);
914 /* restore wanted type */
915 vtop->type.t = t1;
916 } else {
917 /* one register type load */
918 load(r, vtop);
921 vtop->r = r;
922 #ifdef TCC_TARGET_C67
923 /* uses register pairs for doubles */
924 if ((vtop->type.t & VT_BTYPE) == VT_DOUBLE)
925 vtop->r2 = r+1;
926 #endif
928 return r;
931 /* generate vtop[-1] and vtop[0] in resp. classes rc1 and rc2 */
932 ST_FUNC void gv2(int rc1, int rc2)
934 int v;
936 /* generate more generic register first. But VT_JMP or VT_CMP
937 values must be generated first in all cases to avoid possible
938 reload errors */
939 v = vtop[0].r & VT_VALMASK;
940 if (v != VT_CMP && (v & ~1) != VT_JMP && rc1 <= rc2) {
941 vswap();
942 gv(rc1);
943 vswap();
944 gv(rc2);
945 /* test if reload is needed for first register */
946 if ((vtop[-1].r & VT_VALMASK) >= VT_CONST) {
947 vswap();
948 gv(rc1);
949 vswap();
951 } else {
952 gv(rc2);
953 vswap();
954 gv(rc1);
955 vswap();
956 /* test if reload is needed for first register */
957 if ((vtop[0].r & VT_VALMASK) >= VT_CONST) {
958 gv(rc2);
963 #ifndef TCC_TARGET_ARM64
964 /* wrapper around RC_FRET to return a register by type */
965 static int rc_fret(int t)
967 #ifdef TCC_TARGET_X86_64
968 if (t == VT_LDOUBLE) {
969 return RC_ST0;
971 #endif
972 return RC_FRET;
974 #endif
976 /* wrapper around REG_FRET to return a register by type */
977 static int reg_fret(int t)
979 #ifdef TCC_TARGET_X86_64
980 if (t == VT_LDOUBLE) {
981 return TREG_ST0;
983 #endif
984 return REG_FRET;
987 /* expand long long on stack in two int registers */
988 static void lexpand(void)
990 int u;
992 u = vtop->type.t & (VT_DEFSIGN | VT_UNSIGNED);
993 gv(RC_INT);
994 vdup();
995 vtop[0].r = vtop[-1].r2;
996 vtop[0].r2 = VT_CONST;
997 vtop[-1].r2 = VT_CONST;
998 vtop[0].type.t = VT_INT | u;
999 vtop[-1].type.t = VT_INT | u;
1002 #ifdef TCC_TARGET_ARM
1003 /* expand long long on stack */
1004 ST_FUNC void lexpand_nr(void)
1006 int u,v;
1008 u = vtop->type.t & (VT_DEFSIGN | VT_UNSIGNED);
1009 vdup();
1010 vtop->r2 = VT_CONST;
1011 vtop->type.t = VT_INT | u;
1012 v=vtop[-1].r & (VT_VALMASK | VT_LVAL);
1013 if (v == VT_CONST) {
1014 vtop[-1].c.ui = vtop->c.ull;
1015 vtop->c.ui = vtop->c.ull >> 32;
1016 vtop->r = VT_CONST;
1017 } else if (v == (VT_LVAL|VT_CONST) || v == (VT_LVAL|VT_LOCAL)) {
1018 vtop->c.ui += 4;
1019 vtop->r = vtop[-1].r;
1020 } else if (v > VT_CONST) {
1021 vtop--;
1022 lexpand();
1023 } else
1024 vtop->r = vtop[-1].r2;
1025 vtop[-1].r2 = VT_CONST;
1026 vtop[-1].type.t = VT_INT | u;
1028 #endif
1030 /* build a long long from two ints */
1031 static void lbuild(int t)
1033 gv2(RC_INT, RC_INT);
1034 vtop[-1].r2 = vtop[0].r;
1035 vtop[-1].type.t = t;
1036 vpop();
1039 /* rotate n first stack elements to the bottom
1040 I1 ... In -> I2 ... In I1 [top is right]
1042 ST_FUNC void vrotb(int n)
1044 int i;
1045 SValue tmp;
1047 tmp = vtop[-n + 1];
1048 for(i=-n+1;i!=0;i++)
1049 vtop[i] = vtop[i+1];
1050 vtop[0] = tmp;
1053 /* rotate the n elements before entry e towards the top
1054 I1 ... In ... -> In I1 ... I(n-1) ... [top is right]
1056 ST_FUNC void vrote(SValue *e, int n)
1058 int i;
1059 SValue tmp;
1061 tmp = *e;
1062 for(i = 0;i < n - 1; i++)
1063 e[-i] = e[-i - 1];
1064 e[-n + 1] = tmp;
1067 /* rotate n first stack elements to the top
1068 I1 ... In -> In I1 ... I(n-1) [top is right]
1070 ST_FUNC void vrott(int n)
1072 vrote(vtop, n);
1075 /* pop stack value */
1076 ST_FUNC void vpop(void)
1078 int v;
1079 v = vtop->r & VT_VALMASK;
1080 #if defined(TCC_TARGET_I386) || defined(TCC_TARGET_X86_64)
1081 /* for x86, we need to pop the FP stack */
1082 if (v == TREG_ST0 && !nocode_wanted) {
1083 o(0xd8dd); /* fstp %st(0) */
1084 } else
1085 #endif
1086 if (v == VT_JMP || v == VT_JMPI) {
1087 /* need to put correct jump if && or || without test */
1088 gsym(vtop->c.ul);
1090 vtop--;
1093 /* convert stack entry to register and duplicate its value in another
1094 register */
1095 static void gv_dup(void)
1097 int rc, t, r, r1;
1098 SValue sv;
1100 t = vtop->type.t;
1101 if ((t & VT_BTYPE) == VT_LLONG) {
1102 lexpand();
1103 gv_dup();
1104 vswap();
1105 vrotb(3);
1106 gv_dup();
1107 vrotb(4);
1108 /* stack: H L L1 H1 */
1109 lbuild(t);
1110 vrotb(3);
1111 vrotb(3);
1112 vswap();
1113 lbuild(t);
1114 vswap();
1115 } else {
1116 /* duplicate value */
1117 rc = RC_INT;
1118 sv.type.t = VT_INT;
1119 if (is_float(t)) {
1120 rc = RC_FLOAT;
1121 #ifdef TCC_TARGET_X86_64
1122 if ((t & VT_BTYPE) == VT_LDOUBLE) {
1123 rc = RC_ST0;
1125 #endif
1126 sv.type.t = t;
1128 r = gv(rc);
1129 r1 = get_reg(rc);
1130 sv.r = r;
1131 sv.c.ul = 0;
1132 load(r1, &sv); /* move r to r1 */
1133 vdup();
1134 /* duplicates value */
1135 if (r != r1)
1136 vtop->r = r1;
1140 /* Generate value test
1142 * Generate a test for any value (jump, comparison and integers) */
1143 ST_FUNC int gvtst(int inv, int t)
1145 int v = vtop->r & VT_VALMASK;
1146 if (v != VT_CMP && v != VT_JMP && v != VT_JMPI) {
1147 vpushi(0);
1148 gen_op(TOK_NE);
1150 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
1151 /* constant jmp optimization */
1152 if ((vtop->c.i != 0) != inv)
1153 t = gjmp(t);
1154 vtop--;
1155 return t;
1157 return gtst(inv, t);
1160 #if !defined(TCC_TARGET_ARM64) && !defined(TCC_TARGET_X86_64)
1161 /* generate CPU independent (unsigned) long long operations */
1162 static void gen_opl(int op)
1164 int t, a, b, op1, c, i;
1165 int func;
1166 unsigned short reg_iret = REG_IRET;
1167 unsigned short reg_lret = REG_LRET;
1168 SValue tmp;
1170 switch(op) {
1171 case '/':
1172 case TOK_PDIV:
1173 func = TOK___divdi3;
1174 goto gen_func;
1175 case TOK_UDIV:
1176 func = TOK___udivdi3;
1177 goto gen_func;
1178 case '%':
1179 func = TOK___moddi3;
1180 goto gen_mod_func;
1181 case TOK_UMOD:
1182 func = TOK___umoddi3;
1183 gen_mod_func:
1184 #ifdef TCC_ARM_EABI
1185 reg_iret = TREG_R2;
1186 reg_lret = TREG_R3;
1187 #endif
1188 gen_func:
1189 /* call generic long long function */
1190 vpush_global_sym(&func_old_type, func);
1191 vrott(3);
1192 gfunc_call(2);
1193 vpushi(0);
1194 vtop->r = reg_iret;
1195 vtop->r2 = reg_lret;
1196 break;
1197 case '^':
1198 case '&':
1199 case '|':
1200 case '*':
1201 case '+':
1202 case '-':
1203 t = vtop->type.t;
1204 vswap();
1205 lexpand();
1206 vrotb(3);
1207 lexpand();
1208 /* stack: L1 H1 L2 H2 */
1209 tmp = vtop[0];
1210 vtop[0] = vtop[-3];
1211 vtop[-3] = tmp;
1212 tmp = vtop[-2];
1213 vtop[-2] = vtop[-3];
1214 vtop[-3] = tmp;
1215 vswap();
1216 /* stack: H1 H2 L1 L2 */
1217 if (op == '*') {
1218 vpushv(vtop - 1);
1219 vpushv(vtop - 1);
1220 gen_op(TOK_UMULL);
1221 lexpand();
1222 /* stack: H1 H2 L1 L2 ML MH */
1223 for(i=0;i<4;i++)
1224 vrotb(6);
1225 /* stack: ML MH H1 H2 L1 L2 */
1226 tmp = vtop[0];
1227 vtop[0] = vtop[-2];
1228 vtop[-2] = tmp;
1229 /* stack: ML MH H1 L2 H2 L1 */
1230 gen_op('*');
1231 vrotb(3);
1232 vrotb(3);
1233 gen_op('*');
1234 /* stack: ML MH M1 M2 */
1235 gen_op('+');
1236 gen_op('+');
1237 } else if (op == '+' || op == '-') {
1238 /* XXX: add non carry method too (for MIPS or alpha) */
1239 if (op == '+')
1240 op1 = TOK_ADDC1;
1241 else
1242 op1 = TOK_SUBC1;
1243 gen_op(op1);
1244 /* stack: H1 H2 (L1 op L2) */
1245 vrotb(3);
1246 vrotb(3);
1247 gen_op(op1 + 1); /* TOK_xxxC2 */
1248 } else {
1249 gen_op(op);
1250 /* stack: H1 H2 (L1 op L2) */
1251 vrotb(3);
1252 vrotb(3);
1253 /* stack: (L1 op L2) H1 H2 */
1254 gen_op(op);
1255 /* stack: (L1 op L2) (H1 op H2) */
1257 /* stack: L H */
1258 lbuild(t);
1259 break;
1260 case TOK_SAR:
1261 case TOK_SHR:
1262 case TOK_SHL:
1263 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
1264 t = vtop[-1].type.t;
1265 vswap();
1266 lexpand();
1267 vrotb(3);
1268 /* stack: L H shift */
1269 c = (int)vtop->c.i;
1270 /* constant: simpler */
1271 /* NOTE: all comments are for SHL. the other cases are
1272 done by swaping words */
1273 vpop();
1274 if (op != TOK_SHL)
1275 vswap();
1276 if (c >= 32) {
1277 /* stack: L H */
1278 vpop();
1279 if (c > 32) {
1280 vpushi(c - 32);
1281 gen_op(op);
1283 if (op != TOK_SAR) {
1284 vpushi(0);
1285 } else {
1286 gv_dup();
1287 vpushi(31);
1288 gen_op(TOK_SAR);
1290 vswap();
1291 } else {
1292 vswap();
1293 gv_dup();
1294 /* stack: H L L */
1295 vpushi(c);
1296 gen_op(op);
1297 vswap();
1298 vpushi(32 - c);
1299 if (op == TOK_SHL)
1300 gen_op(TOK_SHR);
1301 else
1302 gen_op(TOK_SHL);
1303 vrotb(3);
1304 /* stack: L L H */
1305 vpushi(c);
1306 if (op == TOK_SHL)
1307 gen_op(TOK_SHL);
1308 else
1309 gen_op(TOK_SHR);
1310 gen_op('|');
1312 if (op != TOK_SHL)
1313 vswap();
1314 lbuild(t);
1315 } else {
1316 /* XXX: should provide a faster fallback on x86 ? */
1317 switch(op) {
1318 case TOK_SAR:
1319 func = TOK___ashrdi3;
1320 goto gen_func;
1321 case TOK_SHR:
1322 func = TOK___lshrdi3;
1323 goto gen_func;
1324 case TOK_SHL:
1325 func = TOK___ashldi3;
1326 goto gen_func;
1329 break;
1330 default:
1331 /* compare operations */
1332 t = vtop->type.t;
1333 vswap();
1334 lexpand();
1335 vrotb(3);
1336 lexpand();
1337 /* stack: L1 H1 L2 H2 */
1338 tmp = vtop[-1];
1339 vtop[-1] = vtop[-2];
1340 vtop[-2] = tmp;
1341 /* stack: L1 L2 H1 H2 */
1342 /* compare high */
1343 op1 = op;
1344 /* when values are equal, we need to compare low words. since
1345 the jump is inverted, we invert the test too. */
1346 if (op1 == TOK_LT)
1347 op1 = TOK_LE;
1348 else if (op1 == TOK_GT)
1349 op1 = TOK_GE;
1350 else if (op1 == TOK_ULT)
1351 op1 = TOK_ULE;
1352 else if (op1 == TOK_UGT)
1353 op1 = TOK_UGE;
1354 a = 0;
1355 b = 0;
1356 gen_op(op1);
1357 if (op1 != TOK_NE) {
1358 a = gvtst(1, 0);
1360 if (op != TOK_EQ) {
1361 /* generate non equal test */
1362 /* XXX: NOT PORTABLE yet */
1363 if (a == 0) {
1364 b = gvtst(0, 0);
1365 } else {
1366 #if defined(TCC_TARGET_I386)
1367 b = psym(0x850f, 0);
1368 #elif defined(TCC_TARGET_ARM)
1369 b = ind;
1370 o(0x1A000000 | encbranch(ind, 0, 1));
1371 #elif defined(TCC_TARGET_C67) || defined(TCC_TARGET_ARM64)
1372 tcc_error("not implemented");
1373 #else
1374 #error not supported
1375 #endif
1378 /* compare low. Always unsigned */
1379 op1 = op;
1380 if (op1 == TOK_LT)
1381 op1 = TOK_ULT;
1382 else if (op1 == TOK_LE)
1383 op1 = TOK_ULE;
1384 else if (op1 == TOK_GT)
1385 op1 = TOK_UGT;
1386 else if (op1 == TOK_GE)
1387 op1 = TOK_UGE;
1388 gen_op(op1);
1389 a = gvtst(1, a);
1390 gsym(b);
1391 vseti(VT_JMPI, a);
1392 break;
1395 #endif
1397 /* handle integer constant optimizations and various machine
1398 independent opt */
1399 static void gen_opic(int op)
1401 int c1, c2, t1, t2, n;
1402 SValue *v1, *v2;
1403 long long l1, l2;
1404 typedef unsigned long long U;
1406 v1 = vtop - 1;
1407 v2 = vtop;
1408 t1 = v1->type.t & VT_BTYPE;
1409 t2 = v2->type.t & VT_BTYPE;
1411 if (t1 == VT_LLONG)
1412 l1 = v1->c.ll;
1413 else if (v1->type.t & VT_UNSIGNED)
1414 l1 = v1->c.ui;
1415 else
1416 l1 = v1->c.i;
1418 if (t2 == VT_LLONG)
1419 l2 = v2->c.ll;
1420 else if (v2->type.t & VT_UNSIGNED)
1421 l2 = v2->c.ui;
1422 else
1423 l2 = v2->c.i;
1425 /* currently, we cannot do computations with forward symbols */
1426 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
1427 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
1428 if (c1 && c2) {
1429 switch(op) {
1430 case '+': l1 += l2; break;
1431 case '-': l1 -= l2; break;
1432 case '&': l1 &= l2; break;
1433 case '^': l1 ^= l2; break;
1434 case '|': l1 |= l2; break;
1435 case '*': l1 *= l2; break;
1437 case TOK_PDIV:
1438 case '/':
1439 case '%':
1440 case TOK_UDIV:
1441 case TOK_UMOD:
1442 /* if division by zero, generate explicit division */
1443 if (l2 == 0) {
1444 if (const_wanted)
1445 tcc_error("division by zero in constant");
1446 goto general_case;
1448 switch(op) {
1449 default: l1 /= l2; break;
1450 case '%': l1 %= l2; break;
1451 case TOK_UDIV: l1 = (U)l1 / l2; break;
1452 case TOK_UMOD: l1 = (U)l1 % l2; break;
1454 break;
1455 case TOK_SHL: l1 <<= l2; break;
1456 case TOK_SHR: l1 = (U)l1 >> l2; break;
1457 case TOK_SAR: l1 >>= l2; break;
1458 /* tests */
1459 case TOK_ULT: l1 = (U)l1 < (U)l2; break;
1460 case TOK_UGE: l1 = (U)l1 >= (U)l2; break;
1461 case TOK_EQ: l1 = l1 == l2; break;
1462 case TOK_NE: l1 = l1 != l2; break;
1463 case TOK_ULE: l1 = (U)l1 <= (U)l2; break;
1464 case TOK_UGT: l1 = (U)l1 > (U)l2; break;
1465 case TOK_LT: l1 = l1 < l2; break;
1466 case TOK_GE: l1 = l1 >= l2; break;
1467 case TOK_LE: l1 = l1 <= l2; break;
1468 case TOK_GT: l1 = l1 > l2; break;
1469 /* logical */
1470 case TOK_LAND: l1 = l1 && l2; break;
1471 case TOK_LOR: l1 = l1 || l2; break;
1472 default:
1473 goto general_case;
1475 v1->c.ll = l1;
1476 vtop--;
1477 } else {
1478 /* if commutative ops, put c2 as constant */
1479 if (c1 && (op == '+' || op == '&' || op == '^' ||
1480 op == '|' || op == '*')) {
1481 vswap();
1482 c2 = c1; //c = c1, c1 = c2, c2 = c;
1483 l2 = l1; //l = l1, l1 = l2, l2 = l;
1485 if (!const_wanted &&
1486 c1 && ((l1 == 0 &&
1487 (op == TOK_SHL || op == TOK_SHR || op == TOK_SAR)) ||
1488 (l1 == -1 && op == TOK_SAR))) {
1489 /* treat (0 << x), (0 >> x) and (-1 >> x) as constant */
1490 vtop--;
1491 } else if (!const_wanted &&
1492 c2 && ((l2 == 0 && (op == '&' || op == '*')) ||
1493 (l2 == -1 && op == '|') ||
1494 (l2 == 0xffffffff && t2 != VT_LLONG && op == '|') ||
1495 (l2 == 1 && (op == '%' || op == TOK_UMOD)))) {
1496 /* treat (x & 0), (x * 0), (x | -1) and (x % 1) as constant */
1497 if (l2 == 1)
1498 vtop->c.ll = 0;
1499 vswap();
1500 vtop--;
1501 } else if (c2 && (((op == '*' || op == '/' || op == TOK_UDIV ||
1502 op == TOK_PDIV) &&
1503 l2 == 1) ||
1504 ((op == '+' || op == '-' || op == '|' || op == '^' ||
1505 op == TOK_SHL || op == TOK_SHR || op == TOK_SAR) &&
1506 l2 == 0) ||
1507 (op == '&' &&
1508 l2 == -1))) {
1509 /* filter out NOP operations like x*1, x-0, x&-1... */
1510 vtop--;
1511 } else if (c2 && (op == '*' || op == TOK_PDIV || op == TOK_UDIV)) {
1512 /* try to use shifts instead of muls or divs */
1513 if (l2 > 0 && (l2 & (l2 - 1)) == 0) {
1514 n = -1;
1515 while (l2) {
1516 l2 >>= 1;
1517 n++;
1519 vtop->c.ll = n;
1520 if (op == '*')
1521 op = TOK_SHL;
1522 else if (op == TOK_PDIV)
1523 op = TOK_SAR;
1524 else
1525 op = TOK_SHR;
1527 goto general_case;
1528 } else if (c2 && (op == '+' || op == '-') &&
1529 (((vtop[-1].r & (VT_VALMASK | VT_LVAL | VT_SYM)) == (VT_CONST | VT_SYM))
1530 || (vtop[-1].r & (VT_VALMASK | VT_LVAL)) == VT_LOCAL)) {
1531 /* symbol + constant case */
1532 if (op == '-')
1533 l2 = -l2;
1534 vtop--;
1535 vtop->c.ll += l2;
1536 } else {
1537 general_case:
1538 if (!nocode_wanted) {
1539 /* call low level op generator */
1540 if (t1 == VT_LLONG || t2 == VT_LLONG ||
1541 (PTR_SIZE == 8 && (t1 == VT_PTR || t2 == VT_PTR)))
1542 gen_opl(op);
1543 else
1544 gen_opi(op);
1545 } else {
1546 vtop--;
1552 /* generate a floating point operation with constant propagation */
1553 static void gen_opif(int op)
1555 int c1, c2;
1556 SValue *v1, *v2;
1557 long double f1, f2;
1559 v1 = vtop - 1;
1560 v2 = vtop;
1561 /* currently, we cannot do computations with forward symbols */
1562 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
1563 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
1564 if (c1 && c2) {
1565 if (v1->type.t == VT_FLOAT) {
1566 f1 = v1->c.f;
1567 f2 = v2->c.f;
1568 } else if (v1->type.t == VT_DOUBLE) {
1569 f1 = v1->c.d;
1570 f2 = v2->c.d;
1571 } else {
1572 f1 = v1->c.ld;
1573 f2 = v2->c.ld;
1576 /* NOTE: we only do constant propagation if finite number (not
1577 NaN or infinity) (ANSI spec) */
1578 if (!ieee_finite(f1) || !ieee_finite(f2))
1579 goto general_case;
1581 switch(op) {
1582 case '+': f1 += f2; break;
1583 case '-': f1 -= f2; break;
1584 case '*': f1 *= f2; break;
1585 case '/':
1586 if (f2 == 0.0) {
1587 if (const_wanted)
1588 tcc_error("division by zero in constant");
1589 goto general_case;
1591 f1 /= f2;
1592 break;
1593 /* XXX: also handles tests ? */
1594 default:
1595 goto general_case;
1597 /* XXX: overflow test ? */
1598 if (v1->type.t == VT_FLOAT) {
1599 v1->c.f = f1;
1600 } else if (v1->type.t == VT_DOUBLE) {
1601 v1->c.d = f1;
1602 } else {
1603 v1->c.ld = f1;
1605 vtop--;
1606 } else {
1607 general_case:
1608 if (!nocode_wanted) {
1609 gen_opf(op);
1610 } else {
1611 vtop--;
1616 static int pointed_size(CType *type)
1618 int align;
1619 return type_size(pointed_type(type), &align);
1622 static void vla_runtime_pointed_size(CType *type)
1624 int align;
1625 vla_runtime_type_size(pointed_type(type), &align);
1628 static inline int is_null_pointer(SValue *p)
1630 if ((p->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
1631 return 0;
1632 return ((p->type.t & VT_BTYPE) == VT_INT && p->c.i == 0) ||
1633 ((p->type.t & VT_BTYPE) == VT_LLONG && p->c.ll == 0) ||
1634 ((p->type.t & VT_BTYPE) == VT_PTR && p->c.ptr_offset == 0);
1637 static inline int is_integer_btype(int bt)
1639 return (bt == VT_BYTE || bt == VT_SHORT ||
1640 bt == VT_INT || bt == VT_LLONG);
1643 /* check types for comparison or subtraction of pointers */
1644 static void check_comparison_pointer_types(SValue *p1, SValue *p2, int op)
1646 CType *type1, *type2, tmp_type1, tmp_type2;
1647 int bt1, bt2;
1649 /* null pointers are accepted for all comparisons as gcc */
1650 if (is_null_pointer(p1) || is_null_pointer(p2))
1651 return;
1652 type1 = &p1->type;
1653 type2 = &p2->type;
1654 bt1 = type1->t & VT_BTYPE;
1655 bt2 = type2->t & VT_BTYPE;
1656 /* accept comparison between pointer and integer with a warning */
1657 if ((is_integer_btype(bt1) || is_integer_btype(bt2)) && op != '-') {
1658 if (op != TOK_LOR && op != TOK_LAND )
1659 tcc_warning("comparison between pointer and integer");
1660 return;
1663 /* both must be pointers or implicit function pointers */
1664 if (bt1 == VT_PTR) {
1665 type1 = pointed_type(type1);
1666 } else if (bt1 != VT_FUNC)
1667 goto invalid_operands;
1669 if (bt2 == VT_PTR) {
1670 type2 = pointed_type(type2);
1671 } else if (bt2 != VT_FUNC) {
1672 invalid_operands:
1673 tcc_error("invalid operands to binary %s", get_tok_str(op, NULL));
1675 if ((type1->t & VT_BTYPE) == VT_VOID ||
1676 (type2->t & VT_BTYPE) == VT_VOID)
1677 return;
1678 tmp_type1 = *type1;
1679 tmp_type2 = *type2;
1680 tmp_type1.t &= ~(VT_DEFSIGN | VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
1681 tmp_type2.t &= ~(VT_DEFSIGN | VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
1682 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
1683 /* gcc-like error if '-' is used */
1684 if (op == '-')
1685 goto invalid_operands;
1686 else
1687 tcc_warning("comparison of distinct pointer types lacks a cast");
1691 /* generic gen_op: handles types problems */
1692 ST_FUNC void gen_op(int op)
1694 int u, t1, t2, bt1, bt2, t;
1695 CType type1;
1697 t1 = vtop[-1].type.t;
1698 t2 = vtop[0].type.t;
1699 bt1 = t1 & VT_BTYPE;
1700 bt2 = t2 & VT_BTYPE;
1702 if (bt1 == VT_PTR || bt2 == VT_PTR) {
1703 /* at least one operand is a pointer */
1704 /* relationnal op: must be both pointers */
1705 if (op >= TOK_ULT && op <= TOK_LOR) {
1706 check_comparison_pointer_types(vtop - 1, vtop, op);
1707 /* pointers are handled are unsigned */
1708 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
1709 t = VT_LLONG | VT_UNSIGNED;
1710 #else
1711 t = VT_INT | VT_UNSIGNED;
1712 #endif
1713 goto std_op;
1715 /* if both pointers, then it must be the '-' op */
1716 if (bt1 == VT_PTR && bt2 == VT_PTR) {
1717 if (op != '-')
1718 tcc_error("cannot use pointers here");
1719 check_comparison_pointer_types(vtop - 1, vtop, op);
1720 /* XXX: check that types are compatible */
1721 if (vtop[-1].type.t & VT_VLA) {
1722 vla_runtime_pointed_size(&vtop[-1].type);
1723 } else {
1724 vpushi(pointed_size(&vtop[-1].type));
1726 vrott(3);
1727 gen_opic(op);
1728 /* set to integer type */
1729 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
1730 vtop->type.t = VT_LLONG;
1731 #else
1732 vtop->type.t = VT_INT;
1733 #endif
1734 vswap();
1735 gen_op(TOK_PDIV);
1736 } else {
1737 /* exactly one pointer : must be '+' or '-'. */
1738 if (op != '-' && op != '+')
1739 tcc_error("cannot use pointers here");
1740 /* Put pointer as first operand */
1741 if (bt2 == VT_PTR) {
1742 vswap();
1743 swap(&t1, &t2);
1745 type1 = vtop[-1].type;
1746 type1.t &= ~VT_ARRAY;
1747 if (vtop[-1].type.t & VT_VLA)
1748 vla_runtime_pointed_size(&vtop[-1].type);
1749 else {
1750 u = pointed_size(&vtop[-1].type);
1751 if (u < 0)
1752 tcc_error("unknown array element size");
1753 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
1754 vpushll(u);
1755 #else
1756 /* XXX: cast to int ? (long long case) */
1757 vpushi(u);
1758 #endif
1760 gen_op('*');
1761 #if 0
1762 /* #ifdef CONFIG_TCC_BCHECK
1763 The main reason to removing this code:
1764 #include <stdio.h>
1765 int main ()
1767 int v[10];
1768 int i = 10;
1769 int j = 9;
1770 fprintf(stderr, "v+i-j = %p\n", v+i-j);
1771 fprintf(stderr, "v+(i-j) = %p\n", v+(i-j));
1773 When this code is on. then the output looks like
1774 v+i-j = 0xfffffffe
1775 v+(i-j) = 0xbff84000
1777 /* if evaluating constant expression, no code should be
1778 generated, so no bound check */
1779 if (tcc_state->do_bounds_check && !const_wanted) {
1780 /* if bounded pointers, we generate a special code to
1781 test bounds */
1782 if (op == '-') {
1783 vpushi(0);
1784 vswap();
1785 gen_op('-');
1787 gen_bounded_ptr_add();
1788 } else
1789 #endif
1791 gen_opic(op);
1793 /* put again type if gen_opic() swaped operands */
1794 vtop->type = type1;
1796 } else if (is_float(bt1) || is_float(bt2)) {
1797 /* compute bigger type and do implicit casts */
1798 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
1799 t = VT_LDOUBLE;
1800 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
1801 t = VT_DOUBLE;
1802 } else {
1803 t = VT_FLOAT;
1805 /* floats can only be used for a few operations */
1806 if (op != '+' && op != '-' && op != '*' && op != '/' &&
1807 (op < TOK_ULT || op > TOK_GT))
1808 tcc_error("invalid operands for binary operation");
1809 goto std_op;
1810 } else if (op == TOK_SHR || op == TOK_SAR || op == TOK_SHL) {
1811 t = bt1 == VT_LLONG ? VT_LLONG : VT_INT;
1812 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (t | VT_UNSIGNED))
1813 t |= VT_UNSIGNED;
1814 goto std_op;
1815 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
1816 /* cast to biggest op */
1817 t = VT_LLONG;
1818 /* convert to unsigned if it does not fit in a long long */
1819 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
1820 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
1821 t |= VT_UNSIGNED;
1822 goto std_op;
1823 } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) {
1824 tcc_error("comparison of struct");
1825 } else {
1826 /* integer operations */
1827 t = VT_INT;
1828 /* convert to unsigned if it does not fit in an integer */
1829 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
1830 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
1831 t |= VT_UNSIGNED;
1832 std_op:
1833 /* XXX: currently, some unsigned operations are explicit, so
1834 we modify them here */
1835 if (t & VT_UNSIGNED) {
1836 if (op == TOK_SAR)
1837 op = TOK_SHR;
1838 else if (op == '/')
1839 op = TOK_UDIV;
1840 else if (op == '%')
1841 op = TOK_UMOD;
1842 else if (op == TOK_LT)
1843 op = TOK_ULT;
1844 else if (op == TOK_GT)
1845 op = TOK_UGT;
1846 else if (op == TOK_LE)
1847 op = TOK_ULE;
1848 else if (op == TOK_GE)
1849 op = TOK_UGE;
1851 vswap();
1852 type1.t = t;
1853 gen_cast(&type1);
1854 vswap();
1855 /* special case for shifts and long long: we keep the shift as
1856 an integer */
1857 if (op == TOK_SHR || op == TOK_SAR || op == TOK_SHL)
1858 type1.t = VT_INT;
1859 gen_cast(&type1);
1860 if (is_float(t))
1861 gen_opif(op);
1862 else
1863 gen_opic(op);
1864 if (op >= TOK_ULT && op <= TOK_GT) {
1865 /* relationnal op: the result is an int */
1866 vtop->type.t = VT_INT;
1867 } else {
1868 vtop->type.t = t;
1871 // Make sure that we have converted to an rvalue:
1872 if (vtop->r & VT_LVAL && !nocode_wanted)
1873 gv(is_float(vtop->type.t & VT_BTYPE) ? RC_FLOAT : RC_INT);
1876 #ifndef TCC_TARGET_ARM
1877 /* generic itof for unsigned long long case */
1878 static void gen_cvt_itof1(int t)
1880 #ifdef TCC_TARGET_ARM64
1881 gen_cvt_itof(t);
1882 #else
1883 if ((vtop->type.t & (VT_BTYPE | VT_UNSIGNED)) ==
1884 (VT_LLONG | VT_UNSIGNED)) {
1886 if (t == VT_FLOAT)
1887 vpush_global_sym(&func_old_type, TOK___floatundisf);
1888 #if LDOUBLE_SIZE != 8
1889 else if (t == VT_LDOUBLE)
1890 vpush_global_sym(&func_old_type, TOK___floatundixf);
1891 #endif
1892 else
1893 vpush_global_sym(&func_old_type, TOK___floatundidf);
1894 vrott(2);
1895 gfunc_call(1);
1896 vpushi(0);
1897 vtop->r = reg_fret(t);
1898 } else {
1899 gen_cvt_itof(t);
1901 #endif
1903 #endif
1905 /* generic ftoi for unsigned long long case */
1906 static void gen_cvt_ftoi1(int t)
1908 #ifdef TCC_TARGET_ARM64
1909 gen_cvt_ftoi(t);
1910 #else
1911 int st;
1913 if (t == (VT_LLONG | VT_UNSIGNED)) {
1914 /* not handled natively */
1915 st = vtop->type.t & VT_BTYPE;
1916 if (st == VT_FLOAT)
1917 vpush_global_sym(&func_old_type, TOK___fixunssfdi);
1918 #if LDOUBLE_SIZE != 8
1919 else if (st == VT_LDOUBLE)
1920 vpush_global_sym(&func_old_type, TOK___fixunsxfdi);
1921 #endif
1922 else
1923 vpush_global_sym(&func_old_type, TOK___fixunsdfdi);
1924 vrott(2);
1925 gfunc_call(1);
1926 vpushi(0);
1927 vtop->r = REG_IRET;
1928 vtop->r2 = REG_LRET;
1929 } else {
1930 gen_cvt_ftoi(t);
1932 #endif
1935 /* force char or short cast */
1936 static void force_charshort_cast(int t)
1938 int bits, dbt;
1939 dbt = t & VT_BTYPE;
1940 /* XXX: add optimization if lvalue : just change type and offset */
1941 if (dbt == VT_BYTE)
1942 bits = 8;
1943 else
1944 bits = 16;
1945 if (t & VT_UNSIGNED) {
1946 vpushi((1 << bits) - 1);
1947 gen_op('&');
1948 } else {
1949 bits = 32 - bits;
1950 vpushi(bits);
1951 gen_op(TOK_SHL);
1952 /* result must be signed or the SAR is converted to an SHL
1953 This was not the case when "t" was a signed short
1954 and the last value on the stack was an unsigned int */
1955 vtop->type.t &= ~VT_UNSIGNED;
1956 vpushi(bits);
1957 gen_op(TOK_SAR);
1961 /* cast 'vtop' to 'type'. Casting to bitfields is forbidden. */
1962 static void gen_cast(CType *type)
1964 int sbt, dbt, sf, df, c, p;
1966 /* special delayed cast for char/short */
1967 /* XXX: in some cases (multiple cascaded casts), it may still
1968 be incorrect */
1969 if (vtop->r & VT_MUSTCAST) {
1970 vtop->r &= ~VT_MUSTCAST;
1971 force_charshort_cast(vtop->type.t);
1974 /* bitfields first get cast to ints */
1975 if (vtop->type.t & VT_BITFIELD && !nocode_wanted) {
1976 gv(RC_INT);
1979 dbt = type->t & (VT_BTYPE | VT_UNSIGNED);
1980 sbt = vtop->type.t & (VT_BTYPE | VT_UNSIGNED);
1982 if (sbt != dbt) {
1983 sf = is_float(sbt);
1984 df = is_float(dbt);
1985 c = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
1986 p = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == (VT_CONST | VT_SYM);
1987 if (c) {
1988 /* constant case: we can do it now */
1989 /* XXX: in ISOC, cannot do it if error in convert */
1990 if (sbt == VT_FLOAT)
1991 vtop->c.ld = vtop->c.f;
1992 else if (sbt == VT_DOUBLE)
1993 vtop->c.ld = vtop->c.d;
1995 if (df) {
1996 if ((sbt & VT_BTYPE) == VT_LLONG) {
1997 if (sbt & VT_UNSIGNED)
1998 vtop->c.ld = vtop->c.ull;
1999 else
2000 vtop->c.ld = vtop->c.ll;
2001 } else if(!sf) {
2002 if (sbt & VT_UNSIGNED)
2003 vtop->c.ld = vtop->c.ui;
2004 else
2005 vtop->c.ld = vtop->c.i;
2008 if (dbt == VT_FLOAT)
2009 vtop->c.f = (float)vtop->c.ld;
2010 else if (dbt == VT_DOUBLE)
2011 vtop->c.d = (double)vtop->c.ld;
2012 } else if (sf && dbt == (VT_LLONG|VT_UNSIGNED)) {
2013 vtop->c.ull = (unsigned long long)vtop->c.ld;
2014 } else if (sf && dbt == VT_BOOL) {
2015 vtop->c.i = (vtop->c.ld != 0);
2016 } else {
2017 if(sf)
2018 vtop->c.ll = (long long)vtop->c.ld;
2019 else if (sbt == (VT_LLONG|VT_UNSIGNED))
2020 vtop->c.ll = vtop->c.ull;
2021 else if (sbt & VT_UNSIGNED)
2022 vtop->c.ll = vtop->c.ui;
2023 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
2024 else if (sbt == VT_PTR)
2026 #endif
2027 else if (sbt != VT_LLONG)
2028 vtop->c.ll = vtop->c.i;
2030 if (dbt == (VT_LLONG|VT_UNSIGNED))
2031 vtop->c.ull = vtop->c.ll;
2032 else if (dbt == VT_BOOL)
2033 vtop->c.i = (vtop->c.ll != 0);
2034 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
2035 else if (dbt == VT_PTR)
2037 #endif
2038 else if (dbt != VT_LLONG) {
2039 int s = 0;
2040 if ((dbt & VT_BTYPE) == VT_BYTE)
2041 s = 24;
2042 else if ((dbt & VT_BTYPE) == VT_SHORT)
2043 s = 16;
2044 if(dbt & VT_UNSIGNED)
2045 vtop->c.ui = ((unsigned int)vtop->c.ll << s) >> s;
2046 else
2047 vtop->c.i = ((int)vtop->c.ll << s) >> s;
2050 } else if (p && dbt == VT_BOOL) {
2051 vtop->r = VT_CONST;
2052 vtop->c.i = 1;
2053 } else if (!nocode_wanted) {
2054 /* non constant case: generate code */
2055 if (sf && df) {
2056 /* convert from fp to fp */
2057 gen_cvt_ftof(dbt);
2058 } else if (df) {
2059 /* convert int to fp */
2060 gen_cvt_itof1(dbt);
2061 } else if (sf) {
2062 /* convert fp to int */
2063 if (dbt == VT_BOOL) {
2064 vpushi(0);
2065 gen_op(TOK_NE);
2066 } else {
2067 /* we handle char/short/etc... with generic code */
2068 if (dbt != (VT_INT | VT_UNSIGNED) &&
2069 dbt != (VT_LLONG | VT_UNSIGNED) &&
2070 dbt != VT_LLONG)
2071 dbt = VT_INT;
2072 gen_cvt_ftoi1(dbt);
2073 if (dbt == VT_INT && (type->t & (VT_BTYPE | VT_UNSIGNED)) != dbt) {
2074 /* additional cast for char/short... */
2075 vtop->type.t = dbt;
2076 gen_cast(type);
2079 #if !defined(TCC_TARGET_ARM64) && !defined(TCC_TARGET_X86_64)
2080 } else if ((dbt & VT_BTYPE) == VT_LLONG) {
2081 if ((sbt & VT_BTYPE) != VT_LLONG && !nocode_wanted) {
2082 /* scalar to long long */
2083 /* machine independent conversion */
2084 gv(RC_INT);
2085 /* generate high word */
2086 if (sbt == (VT_INT | VT_UNSIGNED)) {
2087 vpushi(0);
2088 gv(RC_INT);
2089 } else {
2090 if (sbt == VT_PTR) {
2091 /* cast from pointer to int before we apply
2092 shift operation, which pointers don't support*/
2093 gen_cast(&int_type);
2095 gv_dup();
2096 vpushi(31);
2097 gen_op(TOK_SAR);
2099 /* patch second register */
2100 vtop[-1].r2 = vtop->r;
2101 vpop();
2103 #else
2104 } else if ((dbt & VT_BTYPE) == VT_LLONG ||
2105 (dbt & VT_BTYPE) == VT_PTR ||
2106 (dbt & VT_BTYPE) == VT_FUNC) {
2107 if ((sbt & VT_BTYPE) != VT_LLONG &&
2108 (sbt & VT_BTYPE) != VT_PTR &&
2109 (sbt & VT_BTYPE) != VT_FUNC && !nocode_wanted) {
2110 /* need to convert from 32bit to 64bit */
2111 gv(RC_INT);
2112 if (sbt != (VT_INT | VT_UNSIGNED)) {
2113 #if defined(TCC_TARGET_ARM64)
2114 gen_cvt_sxtw();
2115 #elif defined(TCC_TARGET_X86_64)
2116 int r = gv(RC_INT);
2117 /* x86_64 specific: movslq */
2118 o(0x6348);
2119 o(0xc0 + (REG_VALUE(r) << 3) + REG_VALUE(r));
2120 #else
2121 #error
2122 #endif
2125 #endif
2126 } else if (dbt == VT_BOOL) {
2127 /* scalar to bool */
2128 vpushi(0);
2129 gen_op(TOK_NE);
2130 } else if ((dbt & VT_BTYPE) == VT_BYTE ||
2131 (dbt & VT_BTYPE) == VT_SHORT) {
2132 if (sbt == VT_PTR) {
2133 vtop->type.t = VT_INT;
2134 tcc_warning("nonportable conversion from pointer to char/short");
2136 force_charshort_cast(dbt);
2137 } else if ((dbt & VT_BTYPE) == VT_INT) {
2138 /* scalar to int */
2139 if (sbt == VT_LLONG && !nocode_wanted) {
2140 /* from long long: just take low order word */
2141 lexpand();
2142 vpop();
2144 /* if lvalue and single word type, nothing to do because
2145 the lvalue already contains the real type size (see
2146 VT_LVAL_xxx constants) */
2149 } else if ((dbt & VT_BTYPE) == VT_PTR && !(vtop->r & VT_LVAL)) {
2150 /* if we are casting between pointer types,
2151 we must update the VT_LVAL_xxx size */
2152 vtop->r = (vtop->r & ~VT_LVAL_TYPE)
2153 | (lvalue_type(type->ref->type.t) & VT_LVAL_TYPE);
2155 vtop->type = *type;
2158 /* return type size as known at compile time. Put alignment at 'a' */
2159 ST_FUNC int type_size(CType *type, int *a)
2161 Sym *s;
2162 int bt;
2164 bt = type->t & VT_BTYPE;
2165 if (bt == VT_STRUCT) {
2166 /* struct/union */
2167 s = type->ref;
2168 *a = s->r;
2169 return s->c;
2170 } else if (bt == VT_PTR) {
2171 if (type->t & VT_ARRAY) {
2172 int ts;
2174 s = type->ref;
2175 ts = type_size(&s->type, a);
2177 if (ts < 0 && s->c < 0)
2178 ts = -ts;
2180 return ts * s->c;
2181 } else {
2182 *a = PTR_SIZE;
2183 return PTR_SIZE;
2185 } else if (bt == VT_LDOUBLE) {
2186 *a = LDOUBLE_ALIGN;
2187 return LDOUBLE_SIZE;
2188 } else if (bt == VT_DOUBLE || bt == VT_LLONG) {
2189 #ifdef TCC_TARGET_I386
2190 #ifdef TCC_TARGET_PE
2191 *a = 8;
2192 #else
2193 *a = 4;
2194 #endif
2195 #elif defined(TCC_TARGET_ARM)
2196 #ifdef TCC_ARM_EABI
2197 *a = 8;
2198 #else
2199 *a = 4;
2200 #endif
2201 #else
2202 *a = 8;
2203 #endif
2204 return 8;
2205 } else if (bt == VT_INT || bt == VT_ENUM || bt == VT_FLOAT) {
2206 *a = 4;
2207 return 4;
2208 } else if (bt == VT_SHORT) {
2209 *a = 2;
2210 return 2;
2211 } else if (bt == VT_QLONG || bt == VT_QFLOAT) {
2212 *a = 8;
2213 return 16;
2214 } else {
2215 /* char, void, function, _Bool */
2216 *a = 1;
2217 return 1;
2221 /* push type size as known at runtime time on top of value stack. Put
2222 alignment at 'a' */
2223 ST_FUNC void vla_runtime_type_size(CType *type, int *a)
2225 if (type->t & VT_VLA) {
2226 vset(&int_type, VT_LOCAL|VT_LVAL, type->ref->c);
2227 } else {
2228 vpushi(type_size(type, a));
2232 static void vla_sp_restore(void) {
2233 if (vlas_in_scope) {
2234 gen_vla_sp_restore(vla_sp_loc);
2238 static void vla_sp_restore_root(void) {
2239 if (vlas_in_scope) {
2240 gen_vla_sp_restore(vla_sp_root_loc);
2244 /* return the pointed type of t */
2245 static inline CType *pointed_type(CType *type)
2247 return &type->ref->type;
2250 /* modify type so that its it is a pointer to type. */
2251 ST_FUNC void mk_pointer(CType *type)
2253 Sym *s;
2254 s = sym_push(SYM_FIELD, type, 0, -1);
2255 type->t = VT_PTR | (type->t & ~VT_TYPE);
2256 type->ref = s;
2259 /* compare function types. OLD functions match any new functions */
2260 static int is_compatible_func(CType *type1, CType *type2)
2262 Sym *s1, *s2;
2264 s1 = type1->ref;
2265 s2 = type2->ref;
2266 if (!is_compatible_types(&s1->type, &s2->type))
2267 return 0;
2268 /* check func_call */
2269 if (s1->a.func_call != s2->a.func_call)
2270 return 0;
2271 /* XXX: not complete */
2272 if (s1->c == FUNC_OLD || s2->c == FUNC_OLD)
2273 return 1;
2274 if (s1->c != s2->c)
2275 return 0;
2276 while (s1 != NULL) {
2277 if (s2 == NULL)
2278 return 0;
2279 if (!is_compatible_parameter_types(&s1->type, &s2->type))
2280 return 0;
2281 s1 = s1->next;
2282 s2 = s2->next;
2284 if (s2)
2285 return 0;
2286 return 1;
2289 /* return true if type1 and type2 are the same. If unqualified is
2290 true, qualifiers on the types are ignored.
2292 - enums are not checked as gcc __builtin_types_compatible_p ()
2294 static int compare_types(CType *type1, CType *type2, int unqualified)
2296 int bt1, t1, t2;
2298 t1 = type1->t & VT_TYPE;
2299 t2 = type2->t & VT_TYPE;
2300 if (unqualified) {
2301 /* strip qualifiers before comparing */
2302 t1 &= ~(VT_CONSTANT | VT_VOLATILE);
2303 t2 &= ~(VT_CONSTANT | VT_VOLATILE);
2305 /* Default Vs explicit signedness only matters for char */
2306 if ((t1 & VT_BTYPE) != VT_BYTE) {
2307 t1 &= ~VT_DEFSIGN;
2308 t2 &= ~VT_DEFSIGN;
2310 /* XXX: bitfields ? */
2311 if (t1 != t2)
2312 return 0;
2313 /* test more complicated cases */
2314 bt1 = t1 & VT_BTYPE;
2315 if (bt1 == VT_PTR) {
2316 type1 = pointed_type(type1);
2317 type2 = pointed_type(type2);
2318 return is_compatible_types(type1, type2);
2319 } else if (bt1 == VT_STRUCT) {
2320 return (type1->ref == type2->ref);
2321 } else if (bt1 == VT_FUNC) {
2322 return is_compatible_func(type1, type2);
2323 } else {
2324 return 1;
2328 /* return true if type1 and type2 are exactly the same (including
2329 qualifiers).
2331 static int is_compatible_types(CType *type1, CType *type2)
2333 return compare_types(type1,type2,0);
2336 /* return true if type1 and type2 are the same (ignoring qualifiers).
2338 static int is_compatible_parameter_types(CType *type1, CType *type2)
2340 return compare_types(type1,type2,1);
2343 /* print a type. If 'varstr' is not NULL, then the variable is also
2344 printed in the type */
2345 /* XXX: union */
2346 /* XXX: add array and function pointers */
2347 static void type_to_str(char *buf, int buf_size,
2348 CType *type, const char *varstr)
2350 int bt, v, t;
2351 Sym *s, *sa;
2352 char buf1[256];
2353 const char *tstr;
2355 t = type->t & VT_TYPE;
2356 bt = t & VT_BTYPE;
2357 buf[0] = '\0';
2358 if (t & VT_CONSTANT)
2359 pstrcat(buf, buf_size, "const ");
2360 if (t & VT_VOLATILE)
2361 pstrcat(buf, buf_size, "volatile ");
2362 if ((t & (VT_DEFSIGN | VT_UNSIGNED)) == (VT_DEFSIGN | VT_UNSIGNED))
2363 pstrcat(buf, buf_size, "unsigned ");
2364 else if (t & VT_DEFSIGN)
2365 pstrcat(buf, buf_size, "signed ");
2366 switch(bt) {
2367 case VT_VOID:
2368 tstr = "void";
2369 goto add_tstr;
2370 case VT_BOOL:
2371 tstr = "_Bool";
2372 goto add_tstr;
2373 case VT_BYTE:
2374 tstr = "char";
2375 goto add_tstr;
2376 case VT_SHORT:
2377 tstr = "short";
2378 goto add_tstr;
2379 case VT_INT:
2380 tstr = "int";
2381 goto add_tstr;
2382 case VT_LONG:
2383 tstr = "long";
2384 goto add_tstr;
2385 case VT_LLONG:
2386 tstr = "long long";
2387 goto add_tstr;
2388 case VT_FLOAT:
2389 tstr = "float";
2390 goto add_tstr;
2391 case VT_DOUBLE:
2392 tstr = "double";
2393 goto add_tstr;
2394 case VT_LDOUBLE:
2395 tstr = "long double";
2396 add_tstr:
2397 pstrcat(buf, buf_size, tstr);
2398 break;
2399 case VT_ENUM:
2400 case VT_STRUCT:
2401 if (bt == VT_STRUCT)
2402 tstr = "struct ";
2403 else
2404 tstr = "enum ";
2405 pstrcat(buf, buf_size, tstr);
2406 v = type->ref->v & ~SYM_STRUCT;
2407 if (v >= SYM_FIRST_ANOM)
2408 pstrcat(buf, buf_size, "<anonymous>");
2409 else
2410 pstrcat(buf, buf_size, get_tok_str(v, NULL));
2411 break;
2412 case VT_FUNC:
2413 s = type->ref;
2414 type_to_str(buf, buf_size, &s->type, varstr);
2415 pstrcat(buf, buf_size, "(");
2416 sa = s->next;
2417 while (sa != NULL) {
2418 type_to_str(buf1, sizeof(buf1), &sa->type, NULL);
2419 pstrcat(buf, buf_size, buf1);
2420 sa = sa->next;
2421 if (sa)
2422 pstrcat(buf, buf_size, ", ");
2424 pstrcat(buf, buf_size, ")");
2425 goto no_var;
2426 case VT_PTR:
2427 s = type->ref;
2428 pstrcpy(buf1, sizeof(buf1), "*");
2429 if (varstr)
2430 pstrcat(buf1, sizeof(buf1), varstr);
2431 type_to_str(buf, buf_size, &s->type, buf1);
2432 goto no_var;
2434 if (varstr) {
2435 pstrcat(buf, buf_size, " ");
2436 pstrcat(buf, buf_size, varstr);
2438 no_var: ;
2441 /* verify type compatibility to store vtop in 'dt' type, and generate
2442 casts if needed. */
2443 static void gen_assign_cast(CType *dt)
2445 CType *st, *type1, *type2, tmp_type1, tmp_type2;
2446 char buf1[256], buf2[256];
2447 int dbt, sbt;
2449 st = &vtop->type; /* source type */
2450 dbt = dt->t & VT_BTYPE;
2451 sbt = st->t & VT_BTYPE;
2452 if (sbt == VT_VOID || dbt == VT_VOID) {
2453 if (sbt == VT_VOID && dbt == VT_VOID)
2454 ; /*
2455 It is Ok if both are void
2456 A test program:
2457 void func1() {}
2458 void func2() {
2459 return func1();
2461 gcc accepts this program
2463 else
2464 tcc_error("cannot cast from/to void");
2466 if (dt->t & VT_CONSTANT)
2467 tcc_warning("assignment of read-only location");
2468 switch(dbt) {
2469 case VT_PTR:
2470 /* special cases for pointers */
2471 /* '0' can also be a pointer */
2472 if (is_null_pointer(vtop))
2473 goto type_ok;
2474 /* accept implicit pointer to integer cast with warning */
2475 if (is_integer_btype(sbt)) {
2476 tcc_warning("assignment makes pointer from integer without a cast");
2477 goto type_ok;
2479 type1 = pointed_type(dt);
2480 /* a function is implicitely a function pointer */
2481 if (sbt == VT_FUNC) {
2482 if ((type1->t & VT_BTYPE) != VT_VOID &&
2483 !is_compatible_types(pointed_type(dt), st))
2484 tcc_warning("assignment from incompatible pointer type");
2485 goto type_ok;
2487 if (sbt != VT_PTR)
2488 goto error;
2489 type2 = pointed_type(st);
2490 if ((type1->t & VT_BTYPE) == VT_VOID ||
2491 (type2->t & VT_BTYPE) == VT_VOID) {
2492 /* void * can match anything */
2493 } else {
2494 /* exact type match, except for unsigned */
2495 tmp_type1 = *type1;
2496 tmp_type2 = *type2;
2497 tmp_type1.t &= ~(VT_DEFSIGN | VT_UNSIGNED | VT_CONSTANT |
2498 VT_VOLATILE);
2499 tmp_type2.t &= ~(VT_DEFSIGN | VT_UNSIGNED | VT_CONSTANT |
2500 VT_VOLATILE);
2501 if (!is_compatible_types(&tmp_type1, &tmp_type2))
2502 tcc_warning("assignment from incompatible pointer type");
2504 /* check const and volatile */
2505 if ((!(type1->t & VT_CONSTANT) && (type2->t & VT_CONSTANT)) ||
2506 (!(type1->t & VT_VOLATILE) && (type2->t & VT_VOLATILE)))
2507 tcc_warning("assignment discards qualifiers from pointer target type");
2508 break;
2509 case VT_BYTE:
2510 case VT_SHORT:
2511 case VT_INT:
2512 case VT_LLONG:
2513 if (sbt == VT_PTR || sbt == VT_FUNC) {
2514 tcc_warning("assignment makes integer from pointer without a cast");
2516 /* XXX: more tests */
2517 break;
2518 case VT_STRUCT:
2519 tmp_type1 = *dt;
2520 tmp_type2 = *st;
2521 tmp_type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
2522 tmp_type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
2523 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
2524 error:
2525 type_to_str(buf1, sizeof(buf1), st, NULL);
2526 type_to_str(buf2, sizeof(buf2), dt, NULL);
2527 tcc_error("cannot cast '%s' to '%s'", buf1, buf2);
2529 break;
2531 type_ok:
2532 gen_cast(dt);
2535 /* store vtop in lvalue pushed on stack */
2536 ST_FUNC void vstore(void)
2538 int sbt, dbt, ft, r, t, size, align, bit_size, bit_pos, rc, delayed_cast;
2540 ft = vtop[-1].type.t;
2541 sbt = vtop->type.t & VT_BTYPE;
2542 dbt = ft & VT_BTYPE;
2543 if ((((sbt == VT_INT || sbt == VT_SHORT) && dbt == VT_BYTE) ||
2544 (sbt == VT_INT && dbt == VT_SHORT))
2545 && !(vtop->type.t & VT_BITFIELD)) {
2546 /* optimize char/short casts */
2547 delayed_cast = VT_MUSTCAST;
2548 vtop->type.t = (ft & VT_TYPE & ~VT_BITFIELD &
2549 ((1 << VT_STRUCT_SHIFT) - 1));
2550 /* XXX: factorize */
2551 if (ft & VT_CONSTANT)
2552 tcc_warning("assignment of read-only location");
2553 } else {
2554 delayed_cast = 0;
2555 if (!(ft & VT_BITFIELD))
2556 gen_assign_cast(&vtop[-1].type);
2559 if (sbt == VT_STRUCT) {
2560 /* if structure, only generate pointer */
2561 /* structure assignment : generate memcpy */
2562 /* XXX: optimize if small size */
2563 if (!nocode_wanted) {
2564 size = type_size(&vtop->type, &align);
2566 /* destination */
2567 vswap();
2568 vtop->type.t = VT_PTR;
2569 gaddrof();
2571 /* address of memcpy() */
2572 #ifdef TCC_ARM_EABI
2573 if(!(align & 7))
2574 vpush_global_sym(&func_old_type, TOK_memcpy8);
2575 else if(!(align & 3))
2576 vpush_global_sym(&func_old_type, TOK_memcpy4);
2577 else
2578 #endif
2579 vpush_global_sym(&func_old_type, TOK_memcpy);
2581 vswap();
2582 /* source */
2583 vpushv(vtop - 2);
2584 vtop->type.t = VT_PTR;
2585 gaddrof();
2586 /* type size */
2587 vpushi(size);
2588 gfunc_call(3);
2589 } else {
2590 vswap();
2591 vpop();
2593 /* leave source on stack */
2594 } else if (ft & VT_BITFIELD) {
2595 /* bitfield store handling */
2597 /* save lvalue as expression result (example: s.b = s.a = n;) */
2598 vdup(), vtop[-1] = vtop[-2];
2600 bit_pos = (ft >> VT_STRUCT_SHIFT) & 0x3f;
2601 bit_size = (ft >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
2602 /* remove bit field info to avoid loops */
2603 vtop[-1].type.t = ft & ~VT_BITFIELD & ((1 << VT_STRUCT_SHIFT) - 1);
2605 if((ft & VT_BTYPE) == VT_BOOL) {
2606 gen_cast(&vtop[-1].type);
2607 vtop[-1].type.t = (vtop[-1].type.t & ~VT_BTYPE) | (VT_BYTE | VT_UNSIGNED);
2610 /* duplicate destination */
2611 vdup();
2612 vtop[-1] = vtop[-2];
2614 /* mask and shift source */
2615 if((ft & VT_BTYPE) != VT_BOOL) {
2616 if((ft & VT_BTYPE) == VT_LLONG) {
2617 vpushll((1ULL << bit_size) - 1ULL);
2618 } else {
2619 vpushi((1 << bit_size) - 1);
2621 gen_op('&');
2623 vpushi(bit_pos);
2624 gen_op(TOK_SHL);
2625 /* load destination, mask and or with source */
2626 vswap();
2627 if((ft & VT_BTYPE) == VT_LLONG) {
2628 vpushll(~(((1ULL << bit_size) - 1ULL) << bit_pos));
2629 } else {
2630 vpushi(~(((1 << bit_size) - 1) << bit_pos));
2632 gen_op('&');
2633 gen_op('|');
2634 /* store result */
2635 vstore();
2636 /* ... and discard */
2637 vpop();
2639 } else {
2640 if (!nocode_wanted) {
2641 #ifdef CONFIG_TCC_BCHECK
2642 /* bound check case */
2643 if (vtop[-1].r & VT_MUSTBOUND) {
2644 vswap();
2645 gbound();
2646 vswap();
2648 #endif
2649 rc = RC_INT;
2650 if (is_float(ft)) {
2651 rc = RC_FLOAT;
2652 #ifdef TCC_TARGET_X86_64
2653 if ((ft & VT_BTYPE) == VT_LDOUBLE) {
2654 rc = RC_ST0;
2655 } else if ((ft & VT_BTYPE) == VT_QFLOAT) {
2656 rc = RC_FRET;
2658 #endif
2660 r = gv(rc); /* generate value */
2661 /* if lvalue was saved on stack, must read it */
2662 if ((vtop[-1].r & VT_VALMASK) == VT_LLOCAL) {
2663 SValue sv;
2664 t = get_reg(RC_INT);
2665 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
2666 sv.type.t = VT_PTR;
2667 #else
2668 sv.type.t = VT_INT;
2669 #endif
2670 sv.r = VT_LOCAL | VT_LVAL;
2671 sv.c.ul = vtop[-1].c.ul;
2672 load(t, &sv);
2673 vtop[-1].r = t | VT_LVAL;
2675 /* two word case handling : store second register at word + 4 (or +8 for x86-64) */
2676 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
2677 if (((ft & VT_BTYPE) == VT_QLONG) || ((ft & VT_BTYPE) == VT_QFLOAT)) {
2678 int addr_type = VT_LLONG, load_size = 8, load_type = ((vtop->type.t & VT_BTYPE) == VT_QLONG) ? VT_LLONG : VT_DOUBLE;
2679 #else
2680 if ((ft & VT_BTYPE) == VT_LLONG) {
2681 int addr_type = VT_INT, load_size = 4, load_type = VT_INT;
2682 #endif
2683 vtop[-1].type.t = load_type;
2684 store(r, vtop - 1);
2685 vswap();
2686 /* convert to int to increment easily */
2687 vtop->type.t = addr_type;
2688 gaddrof();
2689 vpushi(load_size);
2690 gen_op('+');
2691 vtop->r |= VT_LVAL;
2692 vswap();
2693 vtop[-1].type.t = load_type;
2694 /* XXX: it works because r2 is spilled last ! */
2695 store(vtop->r2, vtop - 1);
2696 } else {
2697 store(r, vtop - 1);
2700 vswap();
2701 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
2702 vtop->r |= delayed_cast;
2706 /* post defines POST/PRE add. c is the token ++ or -- */
2707 ST_FUNC void inc(int post, int c)
2709 test_lvalue();
2710 vdup(); /* save lvalue */
2711 if (post) {
2712 if (!nocode_wanted)
2713 gv_dup(); /* duplicate value */
2714 else
2715 vdup(); /* duplicate value */
2716 vrotb(3);
2717 vrotb(3);
2719 /* add constant */
2720 vpushi(c - TOK_MID);
2721 gen_op('+');
2722 vstore(); /* store value */
2723 if (post)
2724 vpop(); /* if post op, return saved value */
2727 /* Parse GNUC __attribute__ extension. Currently, the following
2728 extensions are recognized:
2729 - aligned(n) : set data/function alignment.
2730 - packed : force data alignment to 1
2731 - section(x) : generate data/code in this section.
2732 - unused : currently ignored, but may be used someday.
2733 - regparm(n) : pass function parameters in registers (i386 only)
2735 static void parse_attribute(AttributeDef *ad)
2737 int t, n;
2739 while (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) {
2740 next();
2741 skip('(');
2742 skip('(');
2743 while (tok != ')') {
2744 if (tok < TOK_IDENT)
2745 expect("attribute name");
2746 t = tok;
2747 next();
2748 switch(t) {
2749 case TOK_SECTION1:
2750 case TOK_SECTION2:
2751 skip('(');
2752 if (tok != TOK_STR)
2753 expect("section name");
2754 ad->section = find_section(tcc_state, (char *)tokc.cstr->data);
2755 next();
2756 skip(')');
2757 break;
2758 case TOK_ALIAS1:
2759 case TOK_ALIAS2:
2760 skip('(');
2761 if (tok != TOK_STR)
2762 expect("alias(\"target\")");
2763 ad->alias_target = /* save string as token, for later */
2764 tok_alloc((char*)tokc.cstr->data, tokc.cstr->size-1)->tok;
2765 next();
2766 skip(')');
2767 break;
2768 case TOK_VISIBILITY1:
2769 case TOK_VISIBILITY2:
2770 skip('(');
2771 if (tok != TOK_STR)
2772 expect("visibility(\"default|hidden|internal|protected\")");
2773 if (!strcmp (tokc.cstr->data, "default"))
2774 ad->a.visibility = STV_DEFAULT;
2775 else if (!strcmp (tokc.cstr->data, "hidden"))
2776 ad->a.visibility = STV_HIDDEN;
2777 else if (!strcmp (tokc.cstr->data, "internal"))
2778 ad->a.visibility = STV_INTERNAL;
2779 else if (!strcmp (tokc.cstr->data, "protected"))
2780 ad->a.visibility = STV_PROTECTED;
2781 else
2782 expect("visibility(\"default|hidden|internal|protected\")");
2783 next();
2784 skip(')');
2785 break;
2786 case TOK_ALIGNED1:
2787 case TOK_ALIGNED2:
2788 if (tok == '(') {
2789 next();
2790 n = expr_const();
2791 if (n <= 0 || (n & (n - 1)) != 0)
2792 tcc_error("alignment must be a positive power of two");
2793 skip(')');
2794 } else {
2795 n = MAX_ALIGN;
2797 ad->a.aligned = n;
2798 break;
2799 case TOK_PACKED1:
2800 case TOK_PACKED2:
2801 ad->a.packed = 1;
2802 break;
2803 case TOK_WEAK1:
2804 case TOK_WEAK2:
2805 ad->a.weak = 1;
2806 break;
2807 case TOK_UNUSED1:
2808 case TOK_UNUSED2:
2809 /* currently, no need to handle it because tcc does not
2810 track unused objects */
2811 break;
2812 case TOK_NORETURN1:
2813 case TOK_NORETURN2:
2814 /* currently, no need to handle it because tcc does not
2815 track unused objects */
2816 break;
2817 case TOK_CDECL1:
2818 case TOK_CDECL2:
2819 case TOK_CDECL3:
2820 ad->a.func_call = FUNC_CDECL;
2821 break;
2822 case TOK_STDCALL1:
2823 case TOK_STDCALL2:
2824 case TOK_STDCALL3:
2825 ad->a.func_call = FUNC_STDCALL;
2826 break;
2827 #ifdef TCC_TARGET_I386
2828 case TOK_REGPARM1:
2829 case TOK_REGPARM2:
2830 skip('(');
2831 n = expr_const();
2832 if (n > 3)
2833 n = 3;
2834 else if (n < 0)
2835 n = 0;
2836 if (n > 0)
2837 ad->a.func_call = FUNC_FASTCALL1 + n - 1;
2838 skip(')');
2839 break;
2840 case TOK_FASTCALL1:
2841 case TOK_FASTCALL2:
2842 case TOK_FASTCALL3:
2843 ad->a.func_call = FUNC_FASTCALLW;
2844 break;
2845 #endif
2846 case TOK_MODE:
2847 skip('(');
2848 switch(tok) {
2849 case TOK_MODE_DI:
2850 ad->a.mode = VT_LLONG + 1;
2851 break;
2852 case TOK_MODE_HI:
2853 ad->a.mode = VT_SHORT + 1;
2854 break;
2855 case TOK_MODE_SI:
2856 ad->a.mode = VT_INT + 1;
2857 break;
2858 default:
2859 tcc_warning("__mode__(%s) not supported\n", get_tok_str(tok, NULL));
2860 break;
2862 next();
2863 skip(')');
2864 break;
2865 case TOK_DLLEXPORT:
2866 ad->a.func_export = 1;
2867 break;
2868 case TOK_DLLIMPORT:
2869 ad->a.func_import = 1;
2870 break;
2871 default:
2872 if (tcc_state->warn_unsupported)
2873 tcc_warning("'%s' attribute ignored", get_tok_str(t, NULL));
2874 /* skip parameters */
2875 if (tok == '(') {
2876 int parenthesis = 0;
2877 do {
2878 if (tok == '(')
2879 parenthesis++;
2880 else if (tok == ')')
2881 parenthesis--;
2882 next();
2883 } while (parenthesis && tok != -1);
2885 break;
2887 if (tok != ',')
2888 break;
2889 next();
2891 skip(')');
2892 skip(')');
2896 /* enum/struct/union declaration. u is either VT_ENUM or VT_STRUCT */
2897 static void struct_decl(CType *type, int u, int tdef)
2899 int a, v, size, align, maxalign, c, offset, flexible;
2900 int bit_size, bit_pos, bsize, bt, lbit_pos, prevbt;
2901 Sym *s, *ss, *ass, **ps;
2902 AttributeDef ad;
2903 CType type1, btype;
2905 a = tok; /* save decl type */
2906 next();
2907 if (tok != '{') {
2908 v = tok;
2909 next();
2910 /* struct already defined ? return it */
2911 if (v < TOK_IDENT)
2912 expect("struct/union/enum name");
2913 s = struct_find(v);
2914 if (s) {
2915 if (s->type.t != a)
2916 tcc_error("invalid type");
2917 goto do_decl;
2918 } else if (tok >= TOK_IDENT && !tdef)
2919 tcc_error("unknown struct/union/enum");
2920 } else {
2921 v = anon_sym++;
2923 type1.t = a;
2924 type1.ref = NULL;
2925 /* we put an undefined size for struct/union */
2926 s = sym_push(v | SYM_STRUCT, &type1, 0, -1);
2927 s->r = 0; /* default alignment is zero as gcc */
2928 /* put struct/union/enum name in type */
2929 do_decl:
2930 type->t = u;
2931 type->ref = s;
2933 if (tok == '{') {
2934 next();
2935 if (s->c != -1)
2936 tcc_error("struct/union/enum already defined");
2937 /* cannot be empty */
2938 c = 0;
2939 /* non empty enums are not allowed */
2940 if (a == TOK_ENUM) {
2941 for(;;) {
2942 v = tok;
2943 if (v < TOK_UIDENT)
2944 expect("identifier");
2945 ss = sym_find(v);
2946 if (ss && !local_stack)
2947 tcc_error("redefinition of enumerator '%s'",
2948 get_tok_str(v, NULL));
2949 next();
2950 if (tok == '=') {
2951 next();
2952 c = expr_const();
2954 /* enum symbols have static storage */
2955 ss = sym_push(v, &int_type, VT_CONST, c);
2956 ss->type.t |= VT_STATIC;
2957 if (tok != ',')
2958 break;
2959 next();
2960 c++;
2961 /* NOTE: we accept a trailing comma */
2962 if (tok == '}')
2963 break;
2965 s->c = type_size(&int_type, &align);
2966 skip('}');
2967 } else {
2968 maxalign = 1;
2969 ps = &s->next;
2970 prevbt = VT_INT;
2971 bit_pos = 0;
2972 offset = 0;
2973 flexible = 0;
2974 while (tok != '}') {
2975 parse_btype(&btype, &ad);
2976 while (1) {
2977 if (flexible)
2978 tcc_error("flexible array member '%s' not at the end of struct",
2979 get_tok_str(v, NULL));
2980 bit_size = -1;
2981 v = 0;
2982 type1 = btype;
2983 if (tok != ':') {
2984 type_decl(&type1, &ad, &v, TYPE_DIRECT | TYPE_ABSTRACT);
2985 if (v == 0) {
2986 if ((type1.t & VT_BTYPE) != VT_STRUCT)
2987 expect("identifier");
2988 else {
2989 int v = btype.ref->v;
2990 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
2991 if (tcc_state->ms_extensions == 0)
2992 expect("identifier");
2996 if (type_size(&type1, &align) < 0) {
2997 if ((a == TOK_STRUCT) && (type1.t & VT_ARRAY) && c)
2998 flexible = 1;
2999 else
3000 tcc_error("field '%s' has incomplete type",
3001 get_tok_str(v, NULL));
3003 if ((type1.t & VT_BTYPE) == VT_FUNC ||
3004 (type1.t & (VT_TYPEDEF | VT_STATIC | VT_EXTERN | VT_INLINE)))
3005 tcc_error("invalid type for '%s'",
3006 get_tok_str(v, NULL));
3008 if (tok == ':') {
3009 next();
3010 bit_size = expr_const();
3011 /* XXX: handle v = 0 case for messages */
3012 if (bit_size < 0)
3013 tcc_error("negative width in bit-field '%s'",
3014 get_tok_str(v, NULL));
3015 if (v && bit_size == 0)
3016 tcc_error("zero width for bit-field '%s'",
3017 get_tok_str(v, NULL));
3019 size = type_size(&type1, &align);
3020 if (ad.a.aligned) {
3021 if (align < ad.a.aligned)
3022 align = ad.a.aligned;
3023 } else if (ad.a.packed) {
3024 align = 1;
3025 } else if (*tcc_state->pack_stack_ptr) {
3026 if (align > *tcc_state->pack_stack_ptr)
3027 align = *tcc_state->pack_stack_ptr;
3029 lbit_pos = 0;
3030 if (bit_size >= 0) {
3031 bt = type1.t & VT_BTYPE;
3032 if (bt != VT_INT &&
3033 bt != VT_BYTE &&
3034 bt != VT_SHORT &&
3035 bt != VT_BOOL &&
3036 bt != VT_ENUM &&
3037 bt != VT_LLONG)
3038 tcc_error("bitfields must have scalar type");
3039 bsize = size * 8;
3040 if (bit_size > bsize) {
3041 tcc_error("width of '%s' exceeds its type",
3042 get_tok_str(v, NULL));
3043 } else if (bit_size == bsize) {
3044 /* no need for bit fields */
3045 bit_pos = 0;
3046 } else if (bit_size == 0) {
3047 /* XXX: what to do if only padding in a
3048 structure ? */
3049 /* zero size: means to pad */
3050 bit_pos = 0;
3051 } else {
3052 /* we do not have enough room ?
3053 did the type change?
3054 is it a union? */
3055 if ((bit_pos + bit_size) > bsize ||
3056 bt != prevbt || a == TOK_UNION)
3057 bit_pos = 0;
3058 lbit_pos = bit_pos;
3059 /* XXX: handle LSB first */
3060 type1.t |= VT_BITFIELD |
3061 (bit_pos << VT_STRUCT_SHIFT) |
3062 (bit_size << (VT_STRUCT_SHIFT + 6));
3063 bit_pos += bit_size;
3065 prevbt = bt;
3066 } else {
3067 bit_pos = 0;
3069 if (v != 0 || (type1.t & VT_BTYPE) == VT_STRUCT) {
3070 /* add new memory data only if starting
3071 bit field */
3072 if (lbit_pos == 0) {
3073 if (a == TOK_STRUCT) {
3074 c = (c + align - 1) & -align;
3075 offset = c;
3076 if (size > 0)
3077 c += size;
3078 } else {
3079 offset = 0;
3080 if (size > c)
3081 c = size;
3083 if (align > maxalign)
3084 maxalign = align;
3086 #if 0
3087 printf("add field %s offset=%d",
3088 get_tok_str(v, NULL), offset);
3089 if (type1.t & VT_BITFIELD) {
3090 printf(" pos=%d size=%d",
3091 (type1.t >> VT_STRUCT_SHIFT) & 0x3f,
3092 (type1.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f);
3094 printf("\n");
3095 #endif
3097 if (v == 0 && (type1.t & VT_BTYPE) == VT_STRUCT) {
3098 ass = type1.ref;
3099 while ((ass = ass->next) != NULL) {
3100 ss = sym_push(ass->v, &ass->type, 0, offset + ass->c);
3101 *ps = ss;
3102 ps = &ss->next;
3104 } else if (v) {
3105 ss = sym_push(v | SYM_FIELD, &type1, 0, offset);
3106 *ps = ss;
3107 ps = &ss->next;
3109 if (tok == ';' || tok == TOK_EOF)
3110 break;
3111 skip(',');
3113 skip(';');
3115 skip('}');
3116 /* store size and alignment */
3117 s->c = (c + maxalign - 1) & -maxalign;
3118 s->r = maxalign;
3123 /* return 1 if basic type is a type size (short, long, long long) */
3124 ST_FUNC int is_btype_size(int bt)
3126 return bt == VT_SHORT || bt == VT_LONG || bt == VT_LLONG;
3129 /* return 0 if no type declaration. otherwise, return the basic type
3130 and skip it.
3132 static int parse_btype(CType *type, AttributeDef *ad)
3134 int t, u, bt_size, complete, type_found, typespec_found;
3135 Sym *s;
3136 CType type1;
3138 memset(ad, 0, sizeof(AttributeDef));
3139 complete = 0;
3140 type_found = 0;
3141 typespec_found = 0;
3142 t = 0;
3143 while(1) {
3144 switch(tok) {
3145 case TOK_EXTENSION:
3146 /* currently, we really ignore extension */
3147 next();
3148 continue;
3150 /* basic types */
3151 case TOK_CHAR:
3152 u = VT_BYTE;
3153 basic_type:
3154 next();
3155 basic_type1:
3156 if (complete)
3157 tcc_error("too many basic types");
3158 t |= u;
3159 bt_size = is_btype_size (u & VT_BTYPE);
3160 if (u == VT_INT || (!bt_size && !(t & VT_TYPEDEF)))
3161 complete = 1;
3162 typespec_found = 1;
3163 break;
3164 case TOK_VOID:
3165 u = VT_VOID;
3166 goto basic_type;
3167 case TOK_SHORT:
3168 u = VT_SHORT;
3169 goto basic_type;
3170 case TOK_INT:
3171 u = VT_INT;
3172 goto basic_type;
3173 case TOK_LONG:
3174 next();
3175 if ((t & VT_BTYPE) == VT_DOUBLE) {
3176 #ifndef TCC_TARGET_PE
3177 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
3178 #endif
3179 } else if ((t & VT_BTYPE) == VT_LONG) {
3180 t = (t & ~VT_BTYPE) | VT_LLONG;
3181 } else {
3182 u = VT_LONG;
3183 goto basic_type1;
3185 break;
3186 #ifdef TCC_TARGET_ARM64
3187 case TOK_UINT128:
3188 /* GCC's __uint128_t appears in some Linux header files. Make it a
3189 synonym for long double to get the size and alignment right. */
3190 u = VT_LDOUBLE;
3191 goto basic_type;
3192 #endif
3193 case TOK_BOOL:
3194 u = VT_BOOL;
3195 goto basic_type;
3196 case TOK_FLOAT:
3197 u = VT_FLOAT;
3198 goto basic_type;
3199 case TOK_DOUBLE:
3200 next();
3201 if ((t & VT_BTYPE) == VT_LONG) {
3202 #ifdef TCC_TARGET_PE
3203 t = (t & ~VT_BTYPE) | VT_DOUBLE;
3204 #else
3205 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
3206 #endif
3207 } else {
3208 u = VT_DOUBLE;
3209 goto basic_type1;
3211 break;
3212 case TOK_ENUM:
3213 struct_decl(&type1, VT_ENUM, t & (VT_TYPEDEF | VT_EXTERN));
3214 basic_type2:
3215 u = type1.t;
3216 type->ref = type1.ref;
3217 goto basic_type1;
3218 case TOK_STRUCT:
3219 case TOK_UNION:
3220 struct_decl(&type1, VT_STRUCT, t & (VT_TYPEDEF | VT_EXTERN));
3221 goto basic_type2;
3223 /* type modifiers */
3224 case TOK_CONST1:
3225 case TOK_CONST2:
3226 case TOK_CONST3:
3227 t |= VT_CONSTANT;
3228 next();
3229 break;
3230 case TOK_VOLATILE1:
3231 case TOK_VOLATILE2:
3232 case TOK_VOLATILE3:
3233 t |= VT_VOLATILE;
3234 next();
3235 break;
3236 case TOK_SIGNED1:
3237 case TOK_SIGNED2:
3238 case TOK_SIGNED3:
3239 if ((t & (VT_DEFSIGN|VT_UNSIGNED)) == (VT_DEFSIGN|VT_UNSIGNED))
3240 tcc_error("signed and unsigned modifier");
3241 typespec_found = 1;
3242 t |= VT_DEFSIGN;
3243 next();
3244 break;
3245 case TOK_REGISTER:
3246 case TOK_AUTO:
3247 case TOK_RESTRICT1:
3248 case TOK_RESTRICT2:
3249 case TOK_RESTRICT3:
3250 next();
3251 break;
3252 case TOK_UNSIGNED:
3253 if ((t & (VT_DEFSIGN|VT_UNSIGNED)) == VT_DEFSIGN)
3254 tcc_error("signed and unsigned modifier");
3255 t |= VT_DEFSIGN | VT_UNSIGNED;
3256 next();
3257 typespec_found = 1;
3258 break;
3260 /* storage */
3261 case TOK_EXTERN:
3262 t |= VT_EXTERN;
3263 next();
3264 break;
3265 case TOK_STATIC:
3266 t |= VT_STATIC;
3267 next();
3268 break;
3269 case TOK_TYPEDEF:
3270 t |= VT_TYPEDEF;
3271 next();
3272 break;
3273 case TOK_INLINE1:
3274 case TOK_INLINE2:
3275 case TOK_INLINE3:
3276 t |= VT_INLINE;
3277 next();
3278 break;
3280 /* GNUC attribute */
3281 case TOK_ATTRIBUTE1:
3282 case TOK_ATTRIBUTE2:
3283 parse_attribute(ad);
3284 if (ad->a.mode) {
3285 u = ad->a.mode -1;
3286 t = (t & ~VT_BTYPE) | u;
3288 break;
3289 /* GNUC typeof */
3290 case TOK_TYPEOF1:
3291 case TOK_TYPEOF2:
3292 case TOK_TYPEOF3:
3293 next();
3294 parse_expr_type(&type1);
3295 /* remove all storage modifiers except typedef */
3296 type1.t &= ~(VT_STORAGE&~VT_TYPEDEF);
3297 goto basic_type2;
3298 default:
3299 if (typespec_found)
3300 goto the_end;
3301 s = sym_find(tok);
3302 if (!s || !(s->type.t & VT_TYPEDEF))
3303 goto the_end;
3304 t |= (s->type.t & ~VT_TYPEDEF);
3305 type->ref = s->type.ref;
3306 if (s->r) {
3307 /* get attributes from typedef */
3308 if (0 == ad->a.aligned)
3309 ad->a.aligned = s->a.aligned;
3310 if (0 == ad->a.func_call)
3311 ad->a.func_call = s->a.func_call;
3312 ad->a.packed |= s->a.packed;
3314 next();
3315 typespec_found = 1;
3316 break;
3318 type_found = 1;
3320 the_end:
3321 if (tcc_state->char_is_unsigned) {
3322 if ((t & (VT_DEFSIGN|VT_BTYPE)) == VT_BYTE)
3323 t |= VT_UNSIGNED;
3326 /* long is never used as type */
3327 if ((t & VT_BTYPE) == VT_LONG)
3328 #if (!defined TCC_TARGET_X86_64 && !defined TCC_TARGET_ARM64) || \
3329 defined TCC_TARGET_PE
3330 t = (t & ~VT_BTYPE) | VT_INT;
3331 #else
3332 t = (t & ~VT_BTYPE) | VT_LLONG;
3333 #endif
3334 type->t = t;
3335 return type_found;
3338 /* convert a function parameter type (array to pointer and function to
3339 function pointer) */
3340 static inline void convert_parameter_type(CType *pt)
3342 /* remove const and volatile qualifiers (XXX: const could be used
3343 to indicate a const function parameter */
3344 pt->t &= ~(VT_CONSTANT | VT_VOLATILE);
3345 /* array must be transformed to pointer according to ANSI C */
3346 pt->t &= ~VT_ARRAY;
3347 if ((pt->t & VT_BTYPE) == VT_FUNC) {
3348 mk_pointer(pt);
3352 ST_FUNC void parse_asm_str(CString *astr)
3354 skip('(');
3355 /* read the string */
3356 if (tok != TOK_STR)
3357 expect("string constant");
3358 cstr_new(astr);
3359 while (tok == TOK_STR) {
3360 /* XXX: add \0 handling too ? */
3361 cstr_cat(astr, tokc.cstr->data);
3362 next();
3364 cstr_ccat(astr, '\0');
3367 /* Parse an asm label and return the label
3368 * Don't forget to free the CString in the caller! */
3369 static void asm_label_instr(CString *astr)
3371 next();
3372 parse_asm_str(astr);
3373 skip(')');
3374 #ifdef ASM_DEBUG
3375 printf("asm_alias: \"%s\"\n", (char *)astr->data);
3376 #endif
3379 static void post_type(CType *type, AttributeDef *ad)
3381 int n, l, t1, arg_size, align;
3382 Sym **plast, *s, *first;
3383 AttributeDef ad1;
3384 CType pt;
3386 if (tok == '(') {
3387 /* function declaration */
3388 next();
3389 l = 0;
3390 first = NULL;
3391 plast = &first;
3392 arg_size = 0;
3393 if (tok != ')') {
3394 for(;;) {
3395 /* read param name and compute offset */
3396 if (l != FUNC_OLD) {
3397 if (!parse_btype(&pt, &ad1)) {
3398 if (l) {
3399 tcc_error("invalid type");
3400 } else {
3401 l = FUNC_OLD;
3402 goto old_proto;
3405 l = FUNC_NEW;
3406 if ((pt.t & VT_BTYPE) == VT_VOID && tok == ')')
3407 break;
3408 type_decl(&pt, &ad1, &n, TYPE_DIRECT | TYPE_ABSTRACT);
3409 if ((pt.t & VT_BTYPE) == VT_VOID)
3410 tcc_error("parameter declared as void");
3411 arg_size += (type_size(&pt, &align) + PTR_SIZE - 1) / PTR_SIZE;
3412 } else {
3413 old_proto:
3414 n = tok;
3415 if (n < TOK_UIDENT)
3416 expect("identifier");
3417 pt.t = VT_INT;
3418 next();
3420 convert_parameter_type(&pt);
3421 s = sym_push(n | SYM_FIELD, &pt, 0, 0);
3422 *plast = s;
3423 plast = &s->next;
3424 if (tok == ')')
3425 break;
3426 skip(',');
3427 if (l == FUNC_NEW && tok == TOK_DOTS) {
3428 l = FUNC_ELLIPSIS;
3429 next();
3430 break;
3434 /* if no parameters, then old type prototype */
3435 if (l == 0)
3436 l = FUNC_OLD;
3437 skip(')');
3438 /* NOTE: const is ignored in returned type as it has a special
3439 meaning in gcc / C++ */
3440 type->t &= ~VT_CONSTANT;
3441 /* some ancient pre-K&R C allows a function to return an array
3442 and the array brackets to be put after the arguments, such
3443 that "int c()[]" means something like "int[] c()" */
3444 if (tok == '[') {
3445 next();
3446 skip(']'); /* only handle simple "[]" */
3447 type->t |= VT_PTR;
3449 /* we push a anonymous symbol which will contain the function prototype */
3450 ad->a.func_args = arg_size;
3451 s = sym_push(SYM_FIELD, type, 0, l);
3452 s->a = ad->a;
3453 s->next = first;
3454 type->t = VT_FUNC;
3455 type->ref = s;
3456 } else if (tok == '[') {
3457 /* array definition */
3458 next();
3459 if (tok == TOK_RESTRICT1)
3460 next();
3461 n = -1;
3462 t1 = 0;
3463 if (tok != ']') {
3464 if (!local_stack || nocode_wanted)
3465 vpushi(expr_const());
3466 else gexpr();
3467 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
3468 n = vtop->c.i;
3469 if (n < 0)
3470 tcc_error("invalid array size");
3471 } else {
3472 if (!is_integer_btype(vtop->type.t & VT_BTYPE))
3473 tcc_error("size of variable length array should be an integer");
3474 t1 = VT_VLA;
3477 skip(']');
3478 /* parse next post type */
3479 post_type(type, ad);
3480 if (type->t == VT_FUNC)
3481 tcc_error("declaration of an array of functions");
3482 t1 |= type->t & VT_VLA;
3484 if (t1 & VT_VLA) {
3485 loc -= type_size(&int_type, &align);
3486 loc &= -align;
3487 n = loc;
3489 vla_runtime_type_size(type, &align);
3490 gen_op('*');
3491 vset(&int_type, VT_LOCAL|VT_LVAL, n);
3492 vswap();
3493 vstore();
3495 if (n != -1)
3496 vpop();
3498 /* we push an anonymous symbol which will contain the array
3499 element type */
3500 s = sym_push(SYM_FIELD, type, 0, n);
3501 type->t = (t1 ? VT_VLA : VT_ARRAY) | VT_PTR;
3502 type->ref = s;
3506 /* Parse a type declaration (except basic type), and return the type
3507 in 'type'. 'td' is a bitmask indicating which kind of type decl is
3508 expected. 'type' should contain the basic type. 'ad' is the
3509 attribute definition of the basic type. It can be modified by
3510 type_decl().
3512 static void type_decl(CType *type, AttributeDef *ad, int *v, int td)
3514 Sym *s;
3515 CType type1, *type2;
3516 int qualifiers, storage;
3518 while (tok == '*') {
3519 qualifiers = 0;
3520 redo:
3521 next();
3522 switch(tok) {
3523 case TOK_CONST1:
3524 case TOK_CONST2:
3525 case TOK_CONST3:
3526 qualifiers |= VT_CONSTANT;
3527 goto redo;
3528 case TOK_VOLATILE1:
3529 case TOK_VOLATILE2:
3530 case TOK_VOLATILE3:
3531 qualifiers |= VT_VOLATILE;
3532 goto redo;
3533 case TOK_RESTRICT1:
3534 case TOK_RESTRICT2:
3535 case TOK_RESTRICT3:
3536 goto redo;
3538 mk_pointer(type);
3539 type->t |= qualifiers;
3542 /* XXX: clarify attribute handling */
3543 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
3544 parse_attribute(ad);
3546 /* recursive type */
3547 /* XXX: incorrect if abstract type for functions (e.g. 'int ()') */
3548 type1.t = 0; /* XXX: same as int */
3549 if (tok == '(') {
3550 next();
3551 /* XXX: this is not correct to modify 'ad' at this point, but
3552 the syntax is not clear */
3553 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
3554 parse_attribute(ad);
3555 type_decl(&type1, ad, v, td);
3556 skip(')');
3557 } else {
3558 /* type identifier */
3559 if (tok >= TOK_IDENT && (td & TYPE_DIRECT)) {
3560 *v = tok;
3561 next();
3562 } else {
3563 if (!(td & TYPE_ABSTRACT))
3564 expect("identifier");
3565 *v = 0;
3568 storage = type->t & VT_STORAGE;
3569 type->t &= ~VT_STORAGE;
3570 if (storage & VT_STATIC) {
3571 int saved_nocode_wanted = nocode_wanted;
3572 nocode_wanted = 1;
3573 post_type(type, ad);
3574 nocode_wanted = saved_nocode_wanted;
3575 } else
3576 post_type(type, ad);
3577 type->t |= storage;
3578 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
3579 parse_attribute(ad);
3581 if (!type1.t)
3582 return;
3583 /* append type at the end of type1 */
3584 type2 = &type1;
3585 for(;;) {
3586 s = type2->ref;
3587 type2 = &s->type;
3588 if (!type2->t) {
3589 *type2 = *type;
3590 break;
3593 *type = type1;
3596 /* compute the lvalue VT_LVAL_xxx needed to match type t. */
3597 ST_FUNC int lvalue_type(int t)
3599 int bt, r;
3600 r = VT_LVAL;
3601 bt = t & VT_BTYPE;
3602 if (bt == VT_BYTE || bt == VT_BOOL)
3603 r |= VT_LVAL_BYTE;
3604 else if (bt == VT_SHORT)
3605 r |= VT_LVAL_SHORT;
3606 else
3607 return r;
3608 if (t & VT_UNSIGNED)
3609 r |= VT_LVAL_UNSIGNED;
3610 return r;
3613 /* indirection with full error checking and bound check */
3614 ST_FUNC void indir(void)
3616 if ((vtop->type.t & VT_BTYPE) != VT_PTR) {
3617 if ((vtop->type.t & VT_BTYPE) == VT_FUNC)
3618 return;
3619 expect("pointer");
3621 if ((vtop->r & VT_LVAL) && !nocode_wanted)
3622 gv(RC_INT);
3623 vtop->type = *pointed_type(&vtop->type);
3624 /* Arrays and functions are never lvalues */
3625 if (!(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_VLA)
3626 && (vtop->type.t & VT_BTYPE) != VT_FUNC) {
3627 vtop->r |= lvalue_type(vtop->type.t);
3628 /* if bound checking, the referenced pointer must be checked */
3629 #ifdef CONFIG_TCC_BCHECK
3630 if (tcc_state->do_bounds_check)
3631 vtop->r |= VT_MUSTBOUND;
3632 #endif
3636 /* pass a parameter to a function and do type checking and casting */
3637 static void gfunc_param_typed(Sym *func, Sym *arg)
3639 int func_type;
3640 CType type;
3642 func_type = func->c;
3643 if (func_type == FUNC_OLD ||
3644 (func_type == FUNC_ELLIPSIS && arg == NULL)) {
3645 /* default casting : only need to convert float to double */
3646 if ((vtop->type.t & VT_BTYPE) == VT_FLOAT) {
3647 type.t = VT_DOUBLE;
3648 gen_cast(&type);
3649 } else if (vtop->type.t & VT_BITFIELD) {
3650 type.t = vtop->type.t & (VT_BTYPE | VT_UNSIGNED);
3651 gen_cast(&type);
3653 } else if (arg == NULL) {
3654 tcc_error("too many arguments to function");
3655 } else {
3656 type = arg->type;
3657 type.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
3658 gen_assign_cast(&type);
3662 /* parse an expression of the form '(type)' or '(expr)' and return its
3663 type */
3664 static void parse_expr_type(CType *type)
3666 int n;
3667 AttributeDef ad;
3669 skip('(');
3670 if (parse_btype(type, &ad)) {
3671 type_decl(type, &ad, &n, TYPE_ABSTRACT);
3672 } else {
3673 expr_type(type);
3675 skip(')');
3678 static void parse_type(CType *type)
3680 AttributeDef ad;
3681 int n;
3683 if (!parse_btype(type, &ad)) {
3684 expect("type");
3686 type_decl(type, &ad, &n, TYPE_ABSTRACT);
3689 static void vpush_tokc(int t)
3691 CType type;
3692 type.t = t;
3693 type.ref = 0;
3694 vsetc(&type, VT_CONST, &tokc);
3697 ST_FUNC void unary(void)
3699 int n, t, align, size, r, sizeof_caller;
3700 CType type;
3701 Sym *s;
3702 AttributeDef ad;
3703 static int in_sizeof = 0;
3705 sizeof_caller = in_sizeof;
3706 in_sizeof = 0;
3707 /* XXX: GCC 2.95.3 does not generate a table although it should be
3708 better here */
3709 tok_next:
3710 switch(tok) {
3711 case TOK_EXTENSION:
3712 next();
3713 goto tok_next;
3714 case TOK_CINT:
3715 case TOK_CCHAR:
3716 case TOK_LCHAR:
3717 vpushi(tokc.i);
3718 next();
3719 break;
3720 case TOK_CUINT:
3721 vpush_tokc(VT_INT | VT_UNSIGNED);
3722 next();
3723 break;
3724 case TOK_CLLONG:
3725 vpush_tokc(VT_LLONG);
3726 next();
3727 break;
3728 case TOK_CULLONG:
3729 vpush_tokc(VT_LLONG | VT_UNSIGNED);
3730 next();
3731 break;
3732 case TOK_CFLOAT:
3733 vpush_tokc(VT_FLOAT);
3734 next();
3735 break;
3736 case TOK_CDOUBLE:
3737 vpush_tokc(VT_DOUBLE);
3738 next();
3739 break;
3740 case TOK_CLDOUBLE:
3741 vpush_tokc(VT_LDOUBLE);
3742 next();
3743 break;
3744 case TOK___FUNCTION__:
3745 if (!gnu_ext)
3746 goto tok_identifier;
3747 /* fall thru */
3748 case TOK___FUNC__:
3750 void *ptr;
3751 int len;
3752 /* special function name identifier */
3753 len = strlen(funcname) + 1;
3754 /* generate char[len] type */
3755 type.t = VT_BYTE;
3756 mk_pointer(&type);
3757 type.t |= VT_ARRAY;
3758 type.ref->c = len;
3759 vpush_ref(&type, data_section, data_section->data_offset, len);
3760 ptr = section_ptr_add(data_section, len);
3761 memcpy(ptr, funcname, len);
3762 next();
3764 break;
3765 case TOK_LSTR:
3766 #ifdef TCC_TARGET_PE
3767 t = VT_SHORT | VT_UNSIGNED;
3768 #else
3769 t = VT_INT;
3770 #endif
3771 goto str_init;
3772 case TOK_STR:
3773 /* string parsing */
3774 t = VT_BYTE;
3775 str_init:
3776 if (tcc_state->warn_write_strings)
3777 t |= VT_CONSTANT;
3778 type.t = t;
3779 mk_pointer(&type);
3780 type.t |= VT_ARRAY;
3781 memset(&ad, 0, sizeof(AttributeDef));
3782 decl_initializer_alloc(&type, &ad, VT_CONST, 2, 0, NULL, 0);
3783 break;
3784 case '(':
3785 next();
3786 /* cast ? */
3787 if (parse_btype(&type, &ad)) {
3788 type_decl(&type, &ad, &n, TYPE_ABSTRACT);
3789 skip(')');
3790 /* check ISOC99 compound literal */
3791 if (tok == '{') {
3792 /* data is allocated locally by default */
3793 if (global_expr)
3794 r = VT_CONST;
3795 else
3796 r = VT_LOCAL;
3797 /* all except arrays are lvalues */
3798 if (!(type.t & VT_ARRAY))
3799 r |= lvalue_type(type.t);
3800 memset(&ad, 0, sizeof(AttributeDef));
3801 decl_initializer_alloc(&type, &ad, r, 1, 0, NULL, 0);
3802 } else {
3803 if (sizeof_caller) {
3804 vpush(&type);
3805 return;
3807 unary();
3808 gen_cast(&type);
3810 } else if (tok == '{') {
3812 if (nocode_wanted)
3813 tcc_error("statement expression in global scope"); */
3814 /* this check breaks compilation of the linux 2.4.26 with the meesage:
3815 linux/include/net/tcp.h:945: error: statement expression in global scope */
3817 /* save all registers */
3818 save_regs(0);
3819 /* statement expression : we do not accept break/continue
3820 inside as GCC does */
3821 block(NULL, NULL, NULL, NULL, 0, 1);
3822 skip(')');
3823 } else {
3824 gexpr();
3825 skip(')');
3827 break;
3828 case '*':
3829 next();
3830 unary();
3831 indir();
3832 break;
3833 case '&':
3834 next();
3835 unary();
3836 /* functions names must be treated as function pointers,
3837 except for unary '&' and sizeof. Since we consider that
3838 functions are not lvalues, we only have to handle it
3839 there and in function calls. */
3840 /* arrays can also be used although they are not lvalues */
3841 if ((vtop->type.t & VT_BTYPE) != VT_FUNC &&
3842 !(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_LLOCAL))
3843 test_lvalue();
3844 mk_pointer(&vtop->type);
3845 gaddrof();
3846 break;
3847 case '!':
3848 next();
3849 unary();
3850 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
3851 CType boolean;
3852 boolean.t = VT_BOOL;
3853 gen_cast(&boolean);
3854 vtop->c.i = !vtop->c.i;
3855 } else if ((vtop->r & VT_VALMASK) == VT_CMP)
3856 vtop->c.i = vtop->c.i ^ 1;
3857 else if (!nocode_wanted) {
3858 save_regs(1);
3859 vseti(VT_JMP, gvtst(1, 0));
3861 else
3862 vtop--;
3863 break;
3864 case '~':
3865 next();
3866 unary();
3867 vpushi(-1);
3868 gen_op('^');
3869 break;
3870 case '+':
3871 next();
3872 unary();
3873 if ((vtop->type.t & VT_BTYPE) == VT_PTR)
3874 tcc_error("pointer not accepted for unary plus");
3875 /* In order to force cast, we add zero, except for floating point
3876 where we really need an noop (otherwise -0.0 will be transformed
3877 into +0.0). */
3878 if (!is_float(vtop->type.t)) {
3879 vpushi(0);
3880 gen_op('+');
3882 break;
3883 case TOK_SIZEOF:
3884 case TOK_ALIGNOF1:
3885 case TOK_ALIGNOF2:
3886 t = tok;
3887 next();
3888 in_sizeof++;
3889 unary_type(&type); // Perform a in_sizeof = 0;
3890 size = type_size(&type, &align);
3891 if (t == TOK_SIZEOF) {
3892 if (!(type.t & VT_VLA)) {
3893 if (size < 0)
3894 tcc_error("sizeof applied to an incomplete type");
3895 vpushs(size);
3896 } else {
3897 vla_runtime_type_size(&type, &align);
3899 } else {
3900 vpushs(align);
3902 vtop->type.t |= VT_UNSIGNED;
3903 break;
3905 case TOK_builtin_types_compatible_p:
3907 CType type1, type2;
3908 next();
3909 skip('(');
3910 parse_type(&type1);
3911 skip(',');
3912 parse_type(&type2);
3913 skip(')');
3914 type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
3915 type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
3916 vpushi(is_compatible_types(&type1, &type2));
3918 break;
3919 case TOK_builtin_constant_p:
3921 int saved_nocode_wanted, res;
3922 next();
3923 skip('(');
3924 saved_nocode_wanted = nocode_wanted;
3925 nocode_wanted = 1;
3926 gexpr();
3927 res = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
3928 vpop();
3929 nocode_wanted = saved_nocode_wanted;
3930 skip(')');
3931 vpushi(res);
3933 break;
3934 case TOK_builtin_frame_address:
3935 case TOK_builtin_return_address:
3937 int tok1 = tok;
3938 int level;
3939 CType type;
3940 next();
3941 skip('(');
3942 if (tok != TOK_CINT || tokc.i < 0) {
3943 tcc_error("%s only takes positive integers",
3944 tok1 == TOK_builtin_return_address ?
3945 "__builtin_return_address" :
3946 "__builtin_frame_address");
3948 level = tokc.i;
3949 next();
3950 skip(')');
3951 type.t = VT_VOID;
3952 mk_pointer(&type);
3953 vset(&type, VT_LOCAL, 0); /* local frame */
3954 while (level--) {
3955 mk_pointer(&vtop->type);
3956 indir(); /* -> parent frame */
3958 if (tok1 == TOK_builtin_return_address) {
3959 // assume return address is just above frame pointer on stack
3960 vpushi(PTR_SIZE);
3961 gen_op('+');
3962 mk_pointer(&vtop->type);
3963 indir();
3966 break;
3967 #ifdef TCC_TARGET_X86_64
3968 #ifdef TCC_TARGET_PE
3969 case TOK_builtin_va_start:
3971 next();
3972 skip('(');
3973 expr_eq();
3974 skip(',');
3975 expr_eq();
3976 skip(')');
3977 if ((vtop->r & VT_VALMASK) != VT_LOCAL)
3978 tcc_error("__builtin_va_start expects a local variable");
3979 vtop->r &= ~(VT_LVAL | VT_REF);
3980 vtop->type = char_pointer_type;
3981 vstore();
3983 break;
3984 #else
3985 case TOK_builtin_va_arg_types:
3987 CType type;
3988 next();
3989 skip('(');
3990 parse_type(&type);
3991 skip(')');
3992 vpushi(classify_x86_64_va_arg(&type));
3994 break;
3995 #endif
3996 #endif
3998 #ifdef TCC_TARGET_ARM64
3999 case TOK___va_start: {
4000 if (nocode_wanted)
4001 tcc_error("statement in global scope");
4002 next();
4003 skip('(');
4004 expr_eq();
4005 skip(',');
4006 expr_eq();
4007 skip(')');
4008 //xx check types
4009 gen_va_start();
4010 vpushi(0);
4011 vtop->type.t = VT_VOID;
4012 break;
4014 case TOK___va_arg: {
4015 CType type;
4016 if (nocode_wanted)
4017 tcc_error("statement in global scope");
4018 next();
4019 skip('(');
4020 expr_eq();
4021 skip(',');
4022 parse_type(&type);
4023 skip(')');
4024 //xx check types
4025 gen_va_arg(&type);
4026 vtop->type = type;
4027 break;
4029 case TOK___arm64_clear_cache: {
4030 next();
4031 skip('(');
4032 expr_eq();
4033 skip(',');
4034 expr_eq();
4035 skip(')');
4036 gen_clear_cache();
4037 vpushi(0);
4038 vtop->type.t = VT_VOID;
4039 break;
4041 #endif
4042 /* pre operations */
4043 case TOK_INC:
4044 case TOK_DEC:
4045 t = tok;
4046 next();
4047 unary();
4048 inc(0, t);
4049 break;
4050 case '-':
4051 next();
4052 unary();
4053 t = vtop->type.t & VT_BTYPE;
4054 if (is_float(t)) {
4055 /* In IEEE negate(x) isn't subtract(0,x), but rather
4056 subtract(-0, x). */
4057 vpush(&vtop->type);
4058 if (t == VT_FLOAT)
4059 vtop->c.f = -0.0f;
4060 else if (t == VT_DOUBLE)
4061 vtop->c.d = -0.0;
4062 else
4063 vtop->c.ld = -0.0;
4064 } else
4065 vpushi(0);
4066 vswap();
4067 gen_op('-');
4068 break;
4069 case TOK_LAND:
4070 if (!gnu_ext)
4071 goto tok_identifier;
4072 next();
4073 /* allow to take the address of a label */
4074 if (tok < TOK_UIDENT)
4075 expect("label identifier");
4076 s = label_find(tok);
4077 if (!s) {
4078 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
4079 } else {
4080 if (s->r == LABEL_DECLARED)
4081 s->r = LABEL_FORWARD;
4083 if (!s->type.t) {
4084 s->type.t = VT_VOID;
4085 mk_pointer(&s->type);
4086 s->type.t |= VT_STATIC;
4088 vpushsym(&s->type, s);
4089 next();
4090 break;
4092 // special qnan , snan and infinity values
4093 case TOK___NAN__:
4094 vpush64(VT_DOUBLE, 0x7ff8000000000000ULL);
4095 next();
4096 break;
4097 case TOK___SNAN__:
4098 vpush64(VT_DOUBLE, 0x7ff0000000000001ULL);
4099 next();
4100 break;
4101 case TOK___INF__:
4102 vpush64(VT_DOUBLE, 0x7ff0000000000000ULL);
4103 next();
4104 break;
4106 default:
4107 tok_identifier:
4108 t = tok;
4109 next();
4110 if (t < TOK_UIDENT)
4111 expect("identifier");
4112 s = sym_find(t);
4113 if (!s) {
4114 const char *name = get_tok_str(t, NULL);
4115 if (tok != '(')
4116 tcc_error("'%s' undeclared", name);
4117 /* for simple function calls, we tolerate undeclared
4118 external reference to int() function */
4119 if (tcc_state->warn_implicit_function_declaration
4120 #ifdef TCC_TARGET_PE
4121 /* people must be warned about using undeclared WINAPI functions
4122 (which usually start with uppercase letter) */
4123 || (name[0] >= 'A' && name[0] <= 'Z')
4124 #endif
4126 tcc_warning("implicit declaration of function '%s'", name);
4127 s = external_global_sym(t, &func_old_type, 0);
4129 if ((s->type.t & (VT_STATIC | VT_INLINE | VT_BTYPE)) ==
4130 (VT_STATIC | VT_INLINE | VT_FUNC)) {
4131 /* if referencing an inline function, then we generate a
4132 symbol to it if not already done. It will have the
4133 effect to generate code for it at the end of the
4134 compilation unit. Inline function as always
4135 generated in the text section. */
4136 if (!s->c)
4137 put_extern_sym(s, text_section, 0, 0);
4138 r = VT_SYM | VT_CONST;
4139 } else {
4140 r = s->r;
4142 vset(&s->type, r, s->c);
4143 /* if forward reference, we must point to s */
4144 if (vtop->r & VT_SYM) {
4145 vtop->sym = s;
4146 vtop->c.ptr_offset = 0;
4148 break;
4151 /* post operations */
4152 while (1) {
4153 if (tok == TOK_INC || tok == TOK_DEC) {
4154 inc(1, tok);
4155 next();
4156 } else if (tok == '.' || tok == TOK_ARROW || tok == TOK_CDOUBLE) {
4157 int qualifiers;
4158 /* field */
4159 if (tok == TOK_ARROW)
4160 indir();
4161 qualifiers = vtop->type.t & (VT_CONSTANT | VT_VOLATILE);
4162 test_lvalue();
4163 gaddrof();
4164 /* expect pointer on structure */
4165 if ((vtop->type.t & VT_BTYPE) != VT_STRUCT)
4166 expect("struct or union");
4167 if (tok == TOK_CDOUBLE)
4168 expect("field name");
4169 next();
4170 if (tok == TOK_CINT || tok == TOK_CUINT)
4171 expect("field name");
4172 s = vtop->type.ref;
4173 /* find field */
4174 tok |= SYM_FIELD;
4175 while ((s = s->next) != NULL) {
4176 if (s->v == tok)
4177 break;
4179 if (!s)
4180 tcc_error("field not found: %s", get_tok_str(tok & ~SYM_FIELD, NULL));
4181 /* add field offset to pointer */
4182 vtop->type = char_pointer_type; /* change type to 'char *' */
4183 vpushi(s->c);
4184 gen_op('+');
4185 /* change type to field type, and set to lvalue */
4186 vtop->type = s->type;
4187 vtop->type.t |= qualifiers;
4188 /* an array is never an lvalue */
4189 if (!(vtop->type.t & VT_ARRAY)) {
4190 vtop->r |= lvalue_type(vtop->type.t);
4191 #ifdef CONFIG_TCC_BCHECK
4192 /* if bound checking, the referenced pointer must be checked */
4193 if (tcc_state->do_bounds_check)
4194 vtop->r |= VT_MUSTBOUND;
4195 #endif
4197 next();
4198 } else if (tok == '[') {
4199 next();
4200 gexpr();
4201 gen_op('+');
4202 indir();
4203 skip(']');
4204 } else if (tok == '(') {
4205 SValue ret;
4206 Sym *sa;
4207 int nb_args, ret_nregs, ret_align, regsize, variadic;
4209 /* function call */
4210 if ((vtop->type.t & VT_BTYPE) != VT_FUNC) {
4211 /* pointer test (no array accepted) */
4212 if ((vtop->type.t & (VT_BTYPE | VT_ARRAY)) == VT_PTR) {
4213 vtop->type = *pointed_type(&vtop->type);
4214 if ((vtop->type.t & VT_BTYPE) != VT_FUNC)
4215 goto error_func;
4216 } else {
4217 error_func:
4218 expect("function pointer");
4220 } else {
4221 vtop->r &= ~VT_LVAL; /* no lvalue */
4223 /* get return type */
4224 s = vtop->type.ref;
4225 next();
4226 sa = s->next; /* first parameter */
4227 nb_args = 0;
4228 ret.r2 = VT_CONST;
4229 /* compute first implicit argument if a structure is returned */
4230 if ((s->type.t & VT_BTYPE) == VT_STRUCT) {
4231 variadic = (s->c == FUNC_ELLIPSIS);
4232 ret_nregs = gfunc_sret(&s->type, variadic, &ret.type,
4233 &ret_align, &regsize);
4234 if (!ret_nregs) {
4235 /* get some space for the returned structure */
4236 size = type_size(&s->type, &align);
4237 #ifdef TCC_TARGET_ARM64
4238 /* On arm64, a small struct is return in registers.
4239 It is much easier to write it to memory if we know
4240 that we are allowed to write some extra bytes, so
4241 round the allocated space up to a power of 2: */
4242 if (size < 16)
4243 while (size & (size - 1))
4244 size = (size | (size - 1)) + 1;
4245 #endif
4246 loc = (loc - size) & -align;
4247 ret.type = s->type;
4248 ret.r = VT_LOCAL | VT_LVAL;
4249 /* pass it as 'int' to avoid structure arg passing
4250 problems */
4251 vseti(VT_LOCAL, loc);
4252 ret.c = vtop->c;
4253 nb_args++;
4255 } else {
4256 ret_nregs = 1;
4257 ret.type = s->type;
4260 if (ret_nregs) {
4261 /* return in register */
4262 if (is_float(ret.type.t)) {
4263 ret.r = reg_fret(ret.type.t);
4264 #ifdef TCC_TARGET_X86_64
4265 if ((ret.type.t & VT_BTYPE) == VT_QFLOAT)
4266 ret.r2 = REG_QRET;
4267 #endif
4268 } else {
4269 #ifndef TCC_TARGET_ARM64
4270 #ifdef TCC_TARGET_X86_64
4271 if ((ret.type.t & VT_BTYPE) == VT_QLONG)
4272 #else
4273 if ((ret.type.t & VT_BTYPE) == VT_LLONG)
4274 #endif
4275 ret.r2 = REG_LRET;
4276 #endif
4277 ret.r = REG_IRET;
4279 ret.c.i = 0;
4281 if (tok != ')') {
4282 for(;;) {
4283 expr_eq();
4284 gfunc_param_typed(s, sa);
4285 nb_args++;
4286 if (sa)
4287 sa = sa->next;
4288 if (tok == ')')
4289 break;
4290 skip(',');
4293 if (sa)
4294 tcc_error("too few arguments to function");
4295 skip(')');
4296 if (!nocode_wanted) {
4297 gfunc_call(nb_args);
4298 } else {
4299 vtop -= (nb_args + 1);
4302 /* return value */
4303 for (r = ret.r + ret_nregs + !ret_nregs; r-- > ret.r;) {
4304 vsetc(&ret.type, r, &ret.c);
4305 vtop->r2 = ret.r2; /* Loop only happens when r2 is VT_CONST */
4308 /* handle packed struct return */
4309 if (((s->type.t & VT_BTYPE) == VT_STRUCT) && ret_nregs) {
4310 int addr, offset;
4312 size = type_size(&s->type, &align);
4313 /* We're writing whole regs often, make sure there's enough
4314 space. Assume register size is power of 2. */
4315 if (regsize > align)
4316 align = regsize;
4317 loc = (loc - size) & -align;
4318 addr = loc;
4319 offset = 0;
4320 for (;;) {
4321 vset(&ret.type, VT_LOCAL | VT_LVAL, addr + offset);
4322 vswap();
4323 vstore();
4324 vtop--;
4325 if (--ret_nregs == 0)
4326 break;
4327 offset += regsize;
4329 vset(&s->type, VT_LOCAL | VT_LVAL, addr);
4331 } else {
4332 break;
4337 ST_FUNC void expr_prod(void)
4339 int t;
4341 unary();
4342 while (tok == '*' || tok == '/' || tok == '%') {
4343 t = tok;
4344 next();
4345 unary();
4346 gen_op(t);
4350 ST_FUNC void expr_sum(void)
4352 int t;
4354 expr_prod();
4355 while (tok == '+' || tok == '-') {
4356 t = tok;
4357 next();
4358 expr_prod();
4359 gen_op(t);
4363 static void expr_shift(void)
4365 int t;
4367 expr_sum();
4368 while (tok == TOK_SHL || tok == TOK_SAR) {
4369 t = tok;
4370 next();
4371 expr_sum();
4372 gen_op(t);
4376 static void expr_cmp(void)
4378 int t;
4380 expr_shift();
4381 while ((tok >= TOK_ULE && tok <= TOK_GT) ||
4382 tok == TOK_ULT || tok == TOK_UGE) {
4383 t = tok;
4384 next();
4385 expr_shift();
4386 gen_op(t);
4390 static void expr_cmpeq(void)
4392 int t;
4394 expr_cmp();
4395 while (tok == TOK_EQ || tok == TOK_NE) {
4396 t = tok;
4397 next();
4398 expr_cmp();
4399 gen_op(t);
4403 static void expr_and(void)
4405 expr_cmpeq();
4406 while (tok == '&') {
4407 next();
4408 expr_cmpeq();
4409 gen_op('&');
4413 static void expr_xor(void)
4415 expr_and();
4416 while (tok == '^') {
4417 next();
4418 expr_and();
4419 gen_op('^');
4423 static void expr_or(void)
4425 expr_xor();
4426 while (tok == '|') {
4427 next();
4428 expr_xor();
4429 gen_op('|');
4433 /* XXX: fix this mess */
4434 static void expr_land_const(void)
4436 expr_or();
4437 while (tok == TOK_LAND) {
4438 next();
4439 expr_or();
4440 gen_op(TOK_LAND);
4444 /* XXX: fix this mess */
4445 static void expr_lor_const(void)
4447 expr_land_const();
4448 while (tok == TOK_LOR) {
4449 next();
4450 expr_land_const();
4451 gen_op(TOK_LOR);
4455 /* only used if non constant */
4456 static void expr_land(void)
4458 int t;
4460 expr_or();
4461 if (tok == TOK_LAND) {
4462 t = 0;
4463 save_regs(1);
4464 for(;;) {
4465 t = gvtst(1, t);
4466 if (tok != TOK_LAND) {
4467 vseti(VT_JMPI, t);
4468 break;
4470 next();
4471 expr_or();
4476 static void expr_lor(void)
4478 int t;
4480 expr_land();
4481 if (tok == TOK_LOR) {
4482 t = 0;
4483 save_regs(1);
4484 for(;;) {
4485 t = gvtst(0, t);
4486 if (tok != TOK_LOR) {
4487 vseti(VT_JMP, t);
4488 break;
4490 next();
4491 expr_land();
4496 /* XXX: better constant handling */
4497 static void expr_cond(void)
4499 int tt, u, r1, r2, rc, t1, t2, bt1, bt2;
4500 SValue sv;
4501 CType type, type1, type2;
4503 if (const_wanted) {
4504 expr_lor_const();
4505 if (tok == '?') {
4506 CType boolean;
4507 int c;
4508 boolean.t = VT_BOOL;
4509 vdup();
4510 gen_cast(&boolean);
4511 c = vtop->c.i;
4512 vpop();
4513 next();
4514 if (tok != ':' || !gnu_ext) {
4515 vpop();
4516 gexpr();
4518 if (!c)
4519 vpop();
4520 skip(':');
4521 expr_cond();
4522 if (c)
4523 vpop();
4525 } else {
4526 expr_lor();
4527 if (tok == '?') {
4528 next();
4529 if (vtop != vstack) {
4530 /* needed to avoid having different registers saved in
4531 each branch */
4532 if (is_float(vtop->type.t)) {
4533 rc = RC_FLOAT;
4534 #ifdef TCC_TARGET_X86_64
4535 if ((vtop->type.t & VT_BTYPE) == VT_LDOUBLE) {
4536 rc = RC_ST0;
4538 #endif
4540 else
4541 rc = RC_INT;
4542 gv(rc);
4543 save_regs(1);
4545 if (tok == ':' && gnu_ext) {
4546 gv_dup();
4547 tt = gvtst(1, 0);
4548 } else {
4549 tt = gvtst(1, 0);
4550 gexpr();
4552 type1 = vtop->type;
4553 sv = *vtop; /* save value to handle it later */
4554 vtop--; /* no vpop so that FP stack is not flushed */
4555 skip(':');
4556 u = gjmp(0);
4557 gsym(tt);
4558 expr_cond();
4559 type2 = vtop->type;
4561 t1 = type1.t;
4562 bt1 = t1 & VT_BTYPE;
4563 t2 = type2.t;
4564 bt2 = t2 & VT_BTYPE;
4565 /* cast operands to correct type according to ISOC rules */
4566 if (is_float(bt1) || is_float(bt2)) {
4567 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
4568 type.t = VT_LDOUBLE;
4569 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
4570 type.t = VT_DOUBLE;
4571 } else {
4572 type.t = VT_FLOAT;
4574 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
4575 /* cast to biggest op */
4576 type.t = VT_LLONG;
4577 /* convert to unsigned if it does not fit in a long long */
4578 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
4579 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
4580 type.t |= VT_UNSIGNED;
4581 } else if (bt1 == VT_PTR || bt2 == VT_PTR) {
4582 /* If one is a null ptr constant the result type
4583 is the other. */
4584 if (is_null_pointer (vtop))
4585 type = type1;
4586 else if (is_null_pointer (&sv))
4587 type = type2;
4588 /* XXX: test pointer compatibility, C99 has more elaborate
4589 rules here. */
4590 else
4591 type = type1;
4592 } else if (bt1 == VT_FUNC || bt2 == VT_FUNC) {
4593 /* XXX: test function pointer compatibility */
4594 type = bt1 == VT_FUNC ? type1 : type2;
4595 } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) {
4596 /* XXX: test structure compatibility */
4597 type = bt1 == VT_STRUCT ? type1 : type2;
4598 } else if (bt1 == VT_VOID || bt2 == VT_VOID) {
4599 /* NOTE: as an extension, we accept void on only one side */
4600 type.t = VT_VOID;
4601 } else {
4602 /* integer operations */
4603 type.t = VT_INT;
4604 /* convert to unsigned if it does not fit in an integer */
4605 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
4606 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
4607 type.t |= VT_UNSIGNED;
4610 /* now we convert second operand */
4611 gen_cast(&type);
4612 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
4613 gaddrof();
4614 rc = RC_INT;
4615 if (is_float(type.t)) {
4616 rc = RC_FLOAT;
4617 #ifdef TCC_TARGET_X86_64
4618 if ((type.t & VT_BTYPE) == VT_LDOUBLE) {
4619 rc = RC_ST0;
4621 #endif
4622 } else if ((type.t & VT_BTYPE) == VT_LLONG) {
4623 /* for long longs, we use fixed registers to avoid having
4624 to handle a complicated move */
4625 rc = RC_IRET;
4628 r2 = gv(rc);
4629 /* this is horrible, but we must also convert first
4630 operand */
4631 tt = gjmp(0);
4632 gsym(u);
4633 /* put again first value and cast it */
4634 *vtop = sv;
4635 gen_cast(&type);
4636 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
4637 gaddrof();
4638 r1 = gv(rc);
4639 move_reg(r2, r1, type.t);
4640 vtop->r = r2;
4641 gsym(tt);
4646 static void expr_eq(void)
4648 int t;
4650 expr_cond();
4651 if (tok == '=' ||
4652 (tok >= TOK_A_MOD && tok <= TOK_A_DIV) ||
4653 tok == TOK_A_XOR || tok == TOK_A_OR ||
4654 tok == TOK_A_SHL || tok == TOK_A_SAR) {
4655 test_lvalue();
4656 t = tok;
4657 next();
4658 if (t == '=') {
4659 expr_eq();
4660 } else {
4661 vdup();
4662 expr_eq();
4663 gen_op(t & 0x7f);
4665 vstore();
4669 ST_FUNC void gexpr(void)
4671 while (1) {
4672 expr_eq();
4673 if (tok != ',')
4674 break;
4675 vpop();
4676 next();
4680 /* parse an expression and return its type without any side effect. */
4681 static void expr_type(CType *type)
4683 int saved_nocode_wanted;
4685 saved_nocode_wanted = nocode_wanted;
4686 nocode_wanted = 1;
4687 gexpr();
4688 *type = vtop->type;
4689 vpop();
4690 nocode_wanted = saved_nocode_wanted;
4693 /* parse a unary expression and return its type without any side
4694 effect. */
4695 static void unary_type(CType *type)
4697 int a;
4699 a = nocode_wanted;
4700 nocode_wanted = 1;
4701 unary();
4702 *type = vtop->type;
4703 vpop();
4704 nocode_wanted = a;
4707 /* parse a constant expression and return value in vtop. */
4708 static void expr_const1(void)
4710 int a;
4711 a = const_wanted;
4712 const_wanted = 1;
4713 expr_cond();
4714 const_wanted = a;
4717 /* parse an integer constant and return its value. */
4718 ST_FUNC int expr_const(void)
4720 int c;
4721 expr_const1();
4722 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
4723 expect("constant expression");
4724 c = vtop->c.i;
4725 vpop();
4726 return c;
4729 /* return the label token if current token is a label, otherwise
4730 return zero */
4731 static int is_label(void)
4733 int last_tok;
4735 /* fast test first */
4736 if (tok < TOK_UIDENT)
4737 return 0;
4738 /* no need to save tokc because tok is an identifier */
4739 last_tok = tok;
4740 next();
4741 if (tok == ':') {
4742 next();
4743 return last_tok;
4744 } else {
4745 unget_tok(last_tok);
4746 return 0;
4750 static void label_or_decl(int l)
4752 int last_tok;
4754 /* fast test first */
4755 if (tok >= TOK_UIDENT)
4757 /* no need to save tokc because tok is an identifier */
4758 last_tok = tok;
4759 next();
4760 if (tok == ':') {
4761 unget_tok(last_tok);
4762 return;
4764 unget_tok(last_tok);
4766 decl(l);
4769 static void block(int *bsym, int *csym, int *case_sym, int *def_sym,
4770 int case_reg, int is_expr)
4772 int a, b, c, d;
4773 Sym *s, *frame_bottom;
4775 /* generate line number info */
4776 if (tcc_state->do_debug &&
4777 (last_line_num != file->line_num || last_ind != ind)) {
4778 put_stabn(N_SLINE, 0, file->line_num, ind - func_ind);
4779 last_ind = ind;
4780 last_line_num = file->line_num;
4783 if (is_expr) {
4784 /* default return value is (void) */
4785 vpushi(0);
4786 vtop->type.t = VT_VOID;
4789 if (tok == TOK_IF) {
4790 /* if test */
4791 next();
4792 skip('(');
4793 gexpr();
4794 skip(')');
4795 a = gvtst(1, 0);
4796 block(bsym, csym, case_sym, def_sym, case_reg, 0);
4797 c = tok;
4798 if (c == TOK_ELSE) {
4799 next();
4800 d = gjmp(0);
4801 gsym(a);
4802 block(bsym, csym, case_sym, def_sym, case_reg, 0);
4803 gsym(d); /* patch else jmp */
4804 } else
4805 gsym(a);
4806 } else if (tok == TOK_WHILE) {
4807 next();
4808 d = ind;
4809 vla_sp_restore();
4810 skip('(');
4811 gexpr();
4812 skip(')');
4813 a = gvtst(1, 0);
4814 b = 0;
4815 block(&a, &b, case_sym, def_sym, case_reg, 0);
4816 gjmp_addr(d);
4817 gsym(a);
4818 gsym_addr(b, d);
4819 } else if (tok == '{') {
4820 Sym *llabel;
4821 int block_vla_sp_loc = vla_sp_loc, saved_vlas_in_scope = vlas_in_scope;
4823 next();
4824 /* record local declaration stack position */
4825 s = local_stack;
4826 frame_bottom = sym_push2(&local_stack, SYM_FIELD, 0, 0);
4827 frame_bottom->next = scope_stack_bottom;
4828 scope_stack_bottom = frame_bottom;
4829 llabel = local_label_stack;
4831 /* handle local labels declarations */
4832 if (tok == TOK_LABEL) {
4833 next();
4834 for(;;) {
4835 if (tok < TOK_UIDENT)
4836 expect("label identifier");
4837 label_push(&local_label_stack, tok, LABEL_DECLARED);
4838 next();
4839 if (tok == ',') {
4840 next();
4841 } else {
4842 skip(';');
4843 break;
4847 while (tok != '}') {
4848 label_or_decl(VT_LOCAL);
4849 if (tok != '}') {
4850 if (is_expr)
4851 vpop();
4852 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
4855 /* pop locally defined labels */
4856 label_pop(&local_label_stack, llabel);
4857 if(is_expr) {
4858 /* XXX: this solution makes only valgrind happy...
4859 triggered by gcc.c-torture/execute/20000917-1.c */
4860 Sym *p;
4861 switch(vtop->type.t & VT_BTYPE) {
4862 /* case VT_PTR: */
4863 /* this breaks a compilation of the linux kernel v2.4.26 */
4864 /* pmd_t *new = ({ __asm__ __volatile__("ud2\n") ; ((pmd_t *)1); }); */
4865 /* Look a commit a80acab: Display error on statement expressions with complex return type */
4866 /* A pointer is not a complex return type */
4867 case VT_STRUCT:
4868 case VT_ENUM:
4869 case VT_FUNC:
4870 for(p=vtop->type.ref;p;p=p->prev)
4871 if(p->prev==s)
4872 tcc_error("unsupported expression type");
4875 /* pop locally defined symbols */
4876 scope_stack_bottom = scope_stack_bottom->next;
4877 sym_pop(&local_stack, s);
4879 /* Pop VLA frames and restore stack pointer if required */
4880 if (vlas_in_scope > saved_vlas_in_scope) {
4881 vla_sp_loc = saved_vlas_in_scope ? block_vla_sp_loc : vla_sp_root_loc;
4882 vla_sp_restore();
4884 vlas_in_scope = saved_vlas_in_scope;
4886 next();
4887 } else if (tok == TOK_RETURN) {
4888 next();
4889 if (tok != ';') {
4890 gexpr();
4891 gen_assign_cast(&func_vt);
4892 #ifdef TCC_TARGET_ARM64
4893 // Perhaps it would be better to use this for all backends:
4894 greturn();
4895 #else
4896 if ((func_vt.t & VT_BTYPE) == VT_STRUCT) {
4897 CType type, ret_type;
4898 int ret_align, ret_nregs, regsize;
4899 ret_nregs = gfunc_sret(&func_vt, func_var, &ret_type,
4900 &ret_align, &regsize);
4901 if (0 == ret_nregs) {
4902 /* if returning structure, must copy it to implicit
4903 first pointer arg location */
4904 type = func_vt;
4905 mk_pointer(&type);
4906 vset(&type, VT_LOCAL | VT_LVAL, func_vc);
4907 indir();
4908 vswap();
4909 /* copy structure value to pointer */
4910 vstore();
4911 } else {
4912 /* returning structure packed into registers */
4913 int r, size, addr, align;
4914 size = type_size(&func_vt,&align);
4915 if ((vtop->r != (VT_LOCAL | VT_LVAL) || (vtop->c.i & (ret_align-1)))
4916 && (align & (ret_align-1))) {
4917 loc = (loc - size) & -ret_align;
4918 addr = loc;
4919 type = func_vt;
4920 vset(&type, VT_LOCAL | VT_LVAL, addr);
4921 vswap();
4922 vstore();
4923 vpop();
4924 vset(&ret_type, VT_LOCAL | VT_LVAL, addr);
4926 vtop->type = ret_type;
4927 if (is_float(ret_type.t))
4928 r = rc_fret(ret_type.t);
4929 else
4930 r = RC_IRET;
4932 for (;;) {
4933 gv(r);
4934 if (--ret_nregs == 0)
4935 break;
4936 /* We assume that when a structure is returned in multiple
4937 registers, their classes are consecutive values of the
4938 suite s(n) = 2^n */
4939 r <<= 1;
4940 vtop->c.i += regsize;
4941 vtop->r = VT_LOCAL | VT_LVAL;
4944 } else if (is_float(func_vt.t)) {
4945 gv(rc_fret(func_vt.t));
4946 } else {
4947 gv(RC_IRET);
4949 #endif
4950 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
4952 skip(';');
4953 rsym = gjmp(rsym); /* jmp */
4954 } else if (tok == TOK_BREAK) {
4955 /* compute jump */
4956 if (!bsym)
4957 tcc_error("cannot break");
4958 *bsym = gjmp(*bsym);
4959 next();
4960 skip(';');
4961 } else if (tok == TOK_CONTINUE) {
4962 /* compute jump */
4963 if (!csym)
4964 tcc_error("cannot continue");
4965 vla_sp_restore_root();
4966 *csym = gjmp(*csym);
4967 next();
4968 skip(';');
4969 } else if (tok == TOK_FOR) {
4970 int e;
4971 next();
4972 skip('(');
4973 s = local_stack;
4974 frame_bottom = sym_push2(&local_stack, SYM_FIELD, 0, 0);
4975 frame_bottom->next = scope_stack_bottom;
4976 scope_stack_bottom = frame_bottom;
4977 if (tok != ';') {
4978 /* c99 for-loop init decl? */
4979 if (!decl0(VT_LOCAL, 1)) {
4980 /* no, regular for-loop init expr */
4981 gexpr();
4982 vpop();
4985 skip(';');
4986 d = ind;
4987 c = ind;
4988 vla_sp_restore();
4989 a = 0;
4990 b = 0;
4991 if (tok != ';') {
4992 gexpr();
4993 a = gvtst(1, 0);
4995 skip(';');
4996 if (tok != ')') {
4997 e = gjmp(0);
4998 c = ind;
4999 vla_sp_restore();
5000 gexpr();
5001 vpop();
5002 gjmp_addr(d);
5003 gsym(e);
5005 skip(')');
5006 block(&a, &b, case_sym, def_sym, case_reg, 0);
5007 gjmp_addr(c);
5008 gsym(a);
5009 gsym_addr(b, c);
5010 scope_stack_bottom = scope_stack_bottom->next;
5011 sym_pop(&local_stack, s);
5012 } else
5013 if (tok == TOK_DO) {
5014 next();
5015 a = 0;
5016 b = 0;
5017 d = ind;
5018 vla_sp_restore();
5019 block(&a, &b, case_sym, def_sym, case_reg, 0);
5020 skip(TOK_WHILE);
5021 skip('(');
5022 gsym(b);
5023 gexpr();
5024 c = gvtst(0, 0);
5025 gsym_addr(c, d);
5026 skip(')');
5027 gsym(a);
5028 skip(';');
5029 } else
5030 if (tok == TOK_SWITCH) {
5031 next();
5032 skip('(');
5033 gexpr();
5034 /* XXX: other types than integer */
5035 case_reg = gv(RC_INT);
5036 vpop();
5037 skip(')');
5038 a = 0;
5039 b = gjmp(0); /* jump to first case */
5040 c = 0;
5041 block(&a, csym, &b, &c, case_reg, 0);
5042 /* if no default, jmp after switch */
5043 if (c == 0)
5044 c = ind;
5045 /* default label */
5046 gsym_addr(b, c);
5047 /* break label */
5048 gsym(a);
5049 } else
5050 if (tok == TOK_CASE) {
5051 int v1, v2;
5052 if (!case_sym)
5053 expect("switch");
5054 next();
5055 v1 = expr_const();
5056 v2 = v1;
5057 if (gnu_ext && tok == TOK_DOTS) {
5058 next();
5059 v2 = expr_const();
5060 if (v2 < v1)
5061 tcc_warning("empty case range");
5063 /* since a case is like a label, we must skip it with a jmp */
5064 b = gjmp(0);
5065 gsym(*case_sym);
5066 vseti(case_reg, 0);
5067 vdup();
5068 vpushi(v1);
5069 if (v1 == v2) {
5070 gen_op(TOK_EQ);
5071 *case_sym = gtst(1, 0);
5072 } else {
5073 gen_op(TOK_GE);
5074 *case_sym = gtst(1, 0);
5075 vseti(case_reg, 0);
5076 vpushi(v2);
5077 gen_op(TOK_LE);
5078 *case_sym = gtst(1, *case_sym);
5080 case_reg = gv(RC_INT);
5081 vpop();
5082 gsym(b);
5083 skip(':');
5084 is_expr = 0;
5085 goto block_after_label;
5086 } else
5087 if (tok == TOK_DEFAULT) {
5088 next();
5089 skip(':');
5090 if (!def_sym)
5091 expect("switch");
5092 if (*def_sym)
5093 tcc_error("too many 'default'");
5094 *def_sym = ind;
5095 is_expr = 0;
5096 goto block_after_label;
5097 } else
5098 if (tok == TOK_GOTO) {
5099 next();
5100 if (tok == '*' && gnu_ext) {
5101 /* computed goto */
5102 next();
5103 gexpr();
5104 if ((vtop->type.t & VT_BTYPE) != VT_PTR)
5105 expect("pointer");
5106 ggoto();
5107 } else if (tok >= TOK_UIDENT) {
5108 s = label_find(tok);
5109 /* put forward definition if needed */
5110 if (!s) {
5111 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
5112 } else {
5113 if (s->r == LABEL_DECLARED)
5114 s->r = LABEL_FORWARD;
5116 vla_sp_restore_root();
5117 if (s->r & LABEL_FORWARD)
5118 s->jnext = gjmp(s->jnext);
5119 else
5120 gjmp_addr(s->jnext);
5121 next();
5122 } else {
5123 expect("label identifier");
5125 skip(';');
5126 } else if (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3) {
5127 asm_instr();
5128 } else {
5129 b = is_label();
5130 if (b) {
5131 /* label case */
5132 s = label_find(b);
5133 if (s) {
5134 if (s->r == LABEL_DEFINED)
5135 tcc_error("duplicate label '%s'", get_tok_str(s->v, NULL));
5136 gsym(s->jnext);
5137 s->r = LABEL_DEFINED;
5138 } else {
5139 s = label_push(&global_label_stack, b, LABEL_DEFINED);
5141 s->jnext = ind;
5142 vla_sp_restore();
5143 /* we accept this, but it is a mistake */
5144 block_after_label:
5145 if (tok == '}') {
5146 tcc_warning("deprecated use of label at end of compound statement");
5147 } else {
5148 if (is_expr)
5149 vpop();
5150 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
5152 } else {
5153 /* expression case */
5154 if (tok != ';') {
5155 if (is_expr) {
5156 vpop();
5157 gexpr();
5158 } else {
5159 gexpr();
5160 vpop();
5163 skip(';');
5168 /* t is the array or struct type. c is the array or struct
5169 address. cur_index/cur_field is the pointer to the current
5170 value. 'size_only' is true if only size info is needed (only used
5171 in arrays) */
5172 static void decl_designator(CType *type, Section *sec, unsigned long c,
5173 int *cur_index, Sym **cur_field,
5174 int size_only)
5176 Sym *s, *f;
5177 int notfirst, index, index_last, align, l, nb_elems, elem_size;
5178 CType type1;
5180 notfirst = 0;
5181 elem_size = 0;
5182 nb_elems = 1;
5183 if (gnu_ext && (l = is_label()) != 0)
5184 goto struct_field;
5185 while (tok == '[' || tok == '.') {
5186 if (tok == '[') {
5187 if (!(type->t & VT_ARRAY))
5188 expect("array type");
5189 s = type->ref;
5190 next();
5191 index = expr_const();
5192 if (index < 0 || (s->c >= 0 && index >= s->c))
5193 expect("invalid index");
5194 if (tok == TOK_DOTS && gnu_ext) {
5195 next();
5196 index_last = expr_const();
5197 if (index_last < 0 ||
5198 (s->c >= 0 && index_last >= s->c) ||
5199 index_last < index)
5200 expect("invalid index");
5201 } else {
5202 index_last = index;
5204 skip(']');
5205 if (!notfirst)
5206 *cur_index = index_last;
5207 type = pointed_type(type);
5208 elem_size = type_size(type, &align);
5209 c += index * elem_size;
5210 /* NOTE: we only support ranges for last designator */
5211 nb_elems = index_last - index + 1;
5212 if (nb_elems != 1) {
5213 notfirst = 1;
5214 break;
5216 } else {
5217 next();
5218 l = tok;
5219 next();
5220 struct_field:
5221 if ((type->t & VT_BTYPE) != VT_STRUCT)
5222 expect("struct/union type");
5223 s = type->ref;
5224 l |= SYM_FIELD;
5225 f = s->next;
5226 while (f) {
5227 if (f->v == l)
5228 break;
5229 f = f->next;
5231 if (!f)
5232 expect("field");
5233 if (!notfirst)
5234 *cur_field = f;
5235 /* XXX: fix this mess by using explicit storage field */
5236 type1 = f->type;
5237 type1.t |= (type->t & ~VT_TYPE);
5238 type = &type1;
5239 c += f->c;
5241 notfirst = 1;
5243 if (notfirst) {
5244 if (tok == '=') {
5245 next();
5246 } else {
5247 if (!gnu_ext)
5248 expect("=");
5250 } else {
5251 if (type->t & VT_ARRAY) {
5252 index = *cur_index;
5253 type = pointed_type(type);
5254 c += index * type_size(type, &align);
5255 } else {
5256 f = *cur_field;
5257 if (!f)
5258 tcc_error("too many field init");
5259 /* XXX: fix this mess by using explicit storage field */
5260 type1 = f->type;
5261 type1.t |= (type->t & ~VT_TYPE);
5262 type = &type1;
5263 c += f->c;
5266 decl_initializer(type, sec, c, 0, size_only);
5268 /* XXX: make it more general */
5269 if (!size_only && nb_elems > 1) {
5270 unsigned long c_end;
5271 uint8_t *src, *dst;
5272 int i;
5274 if (!sec)
5275 tcc_error("range init not supported yet for dynamic storage");
5276 c_end = c + nb_elems * elem_size;
5277 if (c_end > sec->data_allocated)
5278 section_realloc(sec, c_end);
5279 src = sec->data + c;
5280 dst = src;
5281 for(i = 1; i < nb_elems; i++) {
5282 dst += elem_size;
5283 memcpy(dst, src, elem_size);
5288 #define EXPR_VAL 0
5289 #define EXPR_CONST 1
5290 #define EXPR_ANY 2
5292 /* store a value or an expression directly in global data or in local array */
5293 static void init_putv(CType *type, Section *sec, unsigned long c,
5294 int v, int expr_type)
5296 int saved_global_expr, bt, bit_pos, bit_size;
5297 void *ptr;
5298 unsigned long long bit_mask;
5299 CType dtype;
5301 switch(expr_type) {
5302 case EXPR_VAL:
5303 vpushi(v);
5304 break;
5305 case EXPR_CONST:
5306 /* compound literals must be allocated globally in this case */
5307 saved_global_expr = global_expr;
5308 global_expr = 1;
5309 expr_const1();
5310 global_expr = saved_global_expr;
5311 /* NOTE: symbols are accepted */
5312 if ((vtop->r & (VT_VALMASK | VT_LVAL)) != VT_CONST)
5313 tcc_error("initializer element is not constant");
5314 break;
5315 case EXPR_ANY:
5316 expr_eq();
5317 break;
5320 dtype = *type;
5321 dtype.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
5323 if (sec) {
5324 /* XXX: not portable */
5325 /* XXX: generate error if incorrect relocation */
5326 gen_assign_cast(&dtype);
5327 bt = type->t & VT_BTYPE;
5328 /* we'll write at most 16 bytes */
5329 if (c + 16 > sec->data_allocated) {
5330 section_realloc(sec, c + 16);
5332 ptr = sec->data + c;
5333 /* XXX: make code faster ? */
5334 if (!(type->t & VT_BITFIELD)) {
5335 bit_pos = 0;
5336 bit_size = 32;
5337 bit_mask = -1LL;
5338 } else {
5339 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
5340 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
5341 bit_mask = (1LL << bit_size) - 1;
5343 if ((vtop->r & VT_SYM) &&
5344 (bt == VT_BYTE ||
5345 bt == VT_SHORT ||
5346 bt == VT_DOUBLE ||
5347 bt == VT_LDOUBLE ||
5348 bt == VT_LLONG ||
5349 (bt == VT_INT && bit_size != 32)))
5350 tcc_error("initializer element is not computable at load time");
5351 switch(bt) {
5352 /* XXX: when cross-compiling we assume that each type has the
5353 same representation on host and target, which is likely to
5354 be wrong in the case of long double */
5355 case VT_BOOL:
5356 vtop->c.i = (vtop->c.i != 0);
5357 case VT_BYTE:
5358 *(char *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
5359 break;
5360 case VT_SHORT:
5361 *(short *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
5362 break;
5363 case VT_DOUBLE:
5364 *(double *)ptr = vtop->c.d;
5365 break;
5366 case VT_LDOUBLE:
5367 *(long double *)ptr = vtop->c.ld;
5368 break;
5369 case VT_LLONG:
5370 *(long long *)ptr |= (vtop->c.ll & bit_mask) << bit_pos;
5371 break;
5372 case VT_PTR: {
5373 addr_t val = (vtop->c.ptr_offset & bit_mask) << bit_pos;
5374 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
5375 if (vtop->r & VT_SYM)
5376 greloca(sec, vtop->sym, c, R_DATA_PTR, val);
5377 else
5378 *(addr_t *)ptr |= val;
5379 #else
5380 if (vtop->r & VT_SYM)
5381 greloc(sec, vtop->sym, c, R_DATA_PTR);
5382 *(addr_t *)ptr |= val;
5383 #endif
5384 break;
5386 default: {
5387 int val = (vtop->c.i & bit_mask) << bit_pos;
5388 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
5389 if (vtop->r & VT_SYM)
5390 greloca(sec, vtop->sym, c, R_DATA_PTR, val);
5391 else
5392 *(int *)ptr |= val;
5393 #else
5394 if (vtop->r & VT_SYM)
5395 greloc(sec, vtop->sym, c, R_DATA_PTR);
5396 *(int *)ptr |= val;
5397 #endif
5398 break;
5401 vtop--;
5402 } else {
5403 vset(&dtype, VT_LOCAL|VT_LVAL, c);
5404 vswap();
5405 vstore();
5406 vpop();
5410 /* put zeros for variable based init */
5411 static void init_putz(CType *t, Section *sec, unsigned long c, int size)
5413 if (sec) {
5414 /* nothing to do because globals are already set to zero */
5415 } else {
5416 vpush_global_sym(&func_old_type, TOK_memset);
5417 vseti(VT_LOCAL, c);
5418 #ifdef TCC_TARGET_ARM
5419 vpushs(size);
5420 vpushi(0);
5421 #else
5422 vpushi(0);
5423 vpushs(size);
5424 #endif
5425 gfunc_call(3);
5429 /* 't' contains the type and storage info. 'c' is the offset of the
5430 object in section 'sec'. If 'sec' is NULL, it means stack based
5431 allocation. 'first' is true if array '{' must be read (multi
5432 dimension implicit array init handling). 'size_only' is true if
5433 size only evaluation is wanted (only for arrays). */
5434 static void decl_initializer(CType *type, Section *sec, unsigned long c,
5435 int first, int size_only)
5437 int index, array_length, n, no_oblock, nb, parlevel, parlevel1, i;
5438 int size1, align1, expr_type;
5439 Sym *s, *f;
5440 CType *t1;
5442 if (type->t & VT_VLA) {
5443 int a;
5445 /* save current stack pointer */
5446 if (vlas_in_scope == 0) {
5447 if (vla_sp_root_loc == -1)
5448 vla_sp_root_loc = (loc -= PTR_SIZE);
5449 gen_vla_sp_save(vla_sp_root_loc);
5452 vla_runtime_type_size(type, &a);
5453 gen_vla_alloc(type, a);
5454 gen_vla_sp_save(c);
5455 vla_sp_loc = c;
5456 vlas_in_scope++;
5457 } else if (type->t & VT_ARRAY) {
5458 s = type->ref;
5459 n = s->c;
5460 array_length = 0;
5461 t1 = pointed_type(type);
5462 size1 = type_size(t1, &align1);
5464 no_oblock = 1;
5465 if ((first && tok != TOK_LSTR && tok != TOK_STR) ||
5466 tok == '{') {
5467 if (tok != '{')
5468 tcc_error("character array initializer must be a literal,"
5469 " optionally enclosed in braces");
5470 skip('{');
5471 no_oblock = 0;
5474 /* only parse strings here if correct type (otherwise: handle
5475 them as ((w)char *) expressions */
5476 if ((tok == TOK_LSTR &&
5477 #ifdef TCC_TARGET_PE
5478 (t1->t & VT_BTYPE) == VT_SHORT && (t1->t & VT_UNSIGNED)
5479 #else
5480 (t1->t & VT_BTYPE) == VT_INT
5481 #endif
5482 ) || (tok == TOK_STR && (t1->t & VT_BTYPE) == VT_BYTE)) {
5483 while (tok == TOK_STR || tok == TOK_LSTR) {
5484 int cstr_len, ch;
5485 CString *cstr;
5487 cstr = tokc.cstr;
5488 /* compute maximum number of chars wanted */
5489 if (tok == TOK_STR)
5490 cstr_len = cstr->size;
5491 else
5492 cstr_len = cstr->size / sizeof(nwchar_t);
5493 cstr_len--;
5494 nb = cstr_len;
5495 if (n >= 0 && nb > (n - array_length))
5496 nb = n - array_length;
5497 if (!size_only) {
5498 if (cstr_len > nb)
5499 tcc_warning("initializer-string for array is too long");
5500 /* in order to go faster for common case (char
5501 string in global variable, we handle it
5502 specifically */
5503 if (sec && tok == TOK_STR && size1 == 1) {
5504 memcpy(sec->data + c + array_length, cstr->data, nb);
5505 } else {
5506 for(i=0;i<nb;i++) {
5507 if (tok == TOK_STR)
5508 ch = ((unsigned char *)cstr->data)[i];
5509 else
5510 ch = ((nwchar_t *)cstr->data)[i];
5511 init_putv(t1, sec, c + (array_length + i) * size1,
5512 ch, EXPR_VAL);
5516 array_length += nb;
5517 next();
5519 /* only add trailing zero if enough storage (no
5520 warning in this case since it is standard) */
5521 if (n < 0 || array_length < n) {
5522 if (!size_only) {
5523 init_putv(t1, sec, c + (array_length * size1), 0, EXPR_VAL);
5525 array_length++;
5527 } else {
5528 index = 0;
5529 while (tok != '}') {
5530 decl_designator(type, sec, c, &index, NULL, size_only);
5531 if (n >= 0 && index >= n)
5532 tcc_error("index too large");
5533 /* must put zero in holes (note that doing it that way
5534 ensures that it even works with designators) */
5535 if (!size_only && array_length < index) {
5536 init_putz(t1, sec, c + array_length * size1,
5537 (index - array_length) * size1);
5539 index++;
5540 if (index > array_length)
5541 array_length = index;
5542 /* special test for multi dimensional arrays (may not
5543 be strictly correct if designators are used at the
5544 same time) */
5545 if (index >= n && no_oblock)
5546 break;
5547 if (tok == '}')
5548 break;
5549 skip(',');
5552 if (!no_oblock)
5553 skip('}');
5554 /* put zeros at the end */
5555 if (!size_only && n >= 0 && array_length < n) {
5556 init_putz(t1, sec, c + array_length * size1,
5557 (n - array_length) * size1);
5559 /* patch type size if needed */
5560 if (n < 0)
5561 s->c = array_length;
5562 } else if ((type->t & VT_BTYPE) == VT_STRUCT &&
5563 (sec || !first || tok == '{')) {
5565 /* NOTE: the previous test is a specific case for automatic
5566 struct/union init */
5567 /* XXX: union needs only one init */
5569 int par_count = 0;
5570 if (tok == '(') {
5571 AttributeDef ad1;
5572 CType type1;
5573 next();
5574 if (tcc_state->old_struct_init_code) {
5575 /* an old version of struct initialization.
5576 It have a problems. But with a new version
5577 linux 2.4.26 can't load ramdisk.
5579 while (tok == '(') {
5580 par_count++;
5581 next();
5583 if (!parse_btype(&type1, &ad1))
5584 expect("cast");
5585 type_decl(&type1, &ad1, &n, TYPE_ABSTRACT);
5586 #if 0
5587 if (!is_assignable_types(type, &type1))
5588 tcc_error("invalid type for cast");
5589 #endif
5590 skip(')');
5592 else
5594 if (tok != '(') {
5595 if (!parse_btype(&type1, &ad1))
5596 expect("cast");
5597 type_decl(&type1, &ad1, &n, TYPE_ABSTRACT);
5598 #if 0
5599 if (!is_assignable_types(type, &type1))
5600 tcc_error("invalid type for cast");
5601 #endif
5602 skip(')');
5603 } else
5604 unget_tok(tok);
5608 no_oblock = 1;
5609 if (first || tok == '{') {
5610 skip('{');
5611 no_oblock = 0;
5613 s = type->ref;
5614 f = s->next;
5615 array_length = 0;
5616 index = 0;
5617 n = s->c;
5618 while (tok != '}') {
5619 decl_designator(type, sec, c, NULL, &f, size_only);
5620 index = f->c;
5621 if (!size_only && array_length < index) {
5622 init_putz(type, sec, c + array_length,
5623 index - array_length);
5625 index = index + type_size(&f->type, &align1);
5626 if (index > array_length)
5627 array_length = index;
5629 /* gr: skip fields from same union - ugly. */
5630 while (f->next) {
5631 int align = 0;
5632 int f_size = type_size(&f->type, &align);
5633 int f_type = (f->type.t & VT_BTYPE);
5635 ///printf("index: %2d %08x -- %2d %08x\n", f->c, f->type.t, f->next->c, f->next->type.t);
5636 /* test for same offset */
5637 if (f->next->c != f->c)
5638 break;
5639 if ((f_type == VT_STRUCT) && (f_size == 0)) {
5641 Lets assume a structure of size 0 can't be a member of the union.
5642 This allow to compile the following code from a linux kernel v2.4.26
5643 typedef struct { } rwlock_t;
5644 struct fs_struct {
5645 int count;
5646 rwlock_t lock;
5647 int umask;
5649 struct fs_struct init_fs = { { (1) }, (rwlock_t) {}, 0022, };
5650 tcc-0.9.23 can succesfully compile this version of the kernel.
5651 gcc don't have problems with this code too.
5653 break;
5655 /* if yes, test for bitfield shift */
5656 if ((f->type.t & VT_BITFIELD) && (f->next->type.t & VT_BITFIELD)) {
5657 int bit_pos_1 = (f->type.t >> VT_STRUCT_SHIFT) & 0x3f;
5658 int bit_pos_2 = (f->next->type.t >> VT_STRUCT_SHIFT) & 0x3f;
5659 //printf("bitfield %d %d\n", bit_pos_1, bit_pos_2);
5660 if (bit_pos_1 != bit_pos_2)
5661 break;
5663 f = f->next;
5666 f = f->next;
5667 if (no_oblock && f == NULL)
5668 break;
5669 if (tok == '}')
5670 break;
5671 skip(',');
5673 /* put zeros at the end */
5674 if (!size_only && array_length < n) {
5675 init_putz(type, sec, c + array_length,
5676 n - array_length);
5678 if (!no_oblock)
5679 skip('}');
5680 while (par_count) {
5681 skip(')');
5682 par_count--;
5684 } else if (tok == '{') {
5685 next();
5686 decl_initializer(type, sec, c, first, size_only);
5687 skip('}');
5688 } else if (size_only) {
5689 /* just skip expression */
5690 parlevel = parlevel1 = 0;
5691 while ((parlevel > 0 || parlevel1 > 0 ||
5692 (tok != '}' && tok != ',')) && tok != -1) {
5693 if (tok == '(')
5694 parlevel++;
5695 else if (tok == ')') {
5696 if (parlevel == 0 && parlevel1 == 0)
5697 break;
5698 parlevel--;
5700 else if (tok == '{')
5701 parlevel1++;
5702 else if (tok == '}') {
5703 if (parlevel == 0 && parlevel1 == 0)
5704 break;
5705 parlevel1--;
5707 next();
5709 } else {
5710 /* currently, we always use constant expression for globals
5711 (may change for scripting case) */
5712 expr_type = EXPR_CONST;
5713 if (!sec)
5714 expr_type = EXPR_ANY;
5715 init_putv(type, sec, c, 0, expr_type);
5719 /* parse an initializer for type 't' if 'has_init' is non zero, and
5720 allocate space in local or global data space ('r' is either
5721 VT_LOCAL or VT_CONST). If 'v' is non zero, then an associated
5722 variable 'v' with an associated name represented by 'asm_label' of
5723 scope 'scope' is declared before initializers are parsed. If 'v' is
5724 zero, then a reference to the new object is put in the value stack.
5725 If 'has_init' is 2, a special parsing is done to handle string
5726 constants. */
5727 static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r,
5728 int has_init, int v, char *asm_label,
5729 int scope)
5731 int size, align, addr, data_offset;
5732 int level;
5733 ParseState saved_parse_state = {0};
5734 TokenString init_str;
5735 Section *sec;
5736 Sym *flexible_array;
5738 flexible_array = NULL;
5739 if ((type->t & VT_BTYPE) == VT_STRUCT) {
5740 Sym *field = type->ref->next;
5741 if (field) {
5742 while (field->next)
5743 field = field->next;
5744 if (field->type.t & VT_ARRAY && field->type.ref->c < 0)
5745 flexible_array = field;
5749 size = type_size(type, &align);
5750 /* If unknown size, we must evaluate it before
5751 evaluating initializers because
5752 initializers can generate global data too
5753 (e.g. string pointers or ISOC99 compound
5754 literals). It also simplifies local
5755 initializers handling */
5756 tok_str_new(&init_str);
5757 if (size < 0 || (flexible_array && has_init)) {
5758 if (!has_init)
5759 tcc_error("unknown type size");
5760 /* get all init string */
5761 if (has_init == 2) {
5762 /* only get strings */
5763 while (tok == TOK_STR || tok == TOK_LSTR) {
5764 tok_str_add_tok(&init_str);
5765 next();
5767 } else {
5768 level = 0;
5769 while (level > 0 || (tok != ',' && tok != ';')) {
5770 if (tok < 0)
5771 tcc_error("unexpected end of file in initializer");
5772 tok_str_add_tok(&init_str);
5773 if (tok == '{')
5774 level++;
5775 else if (tok == '}') {
5776 level--;
5777 if (level <= 0) {
5778 next();
5779 break;
5782 next();
5785 tok_str_add(&init_str, -1);
5786 tok_str_add(&init_str, 0);
5788 /* compute size */
5789 save_parse_state(&saved_parse_state);
5791 begin_macro(&init_str, 0);
5792 next();
5793 decl_initializer(type, NULL, 0, 1, 1);
5794 /* prepare second initializer parsing */
5795 macro_ptr = init_str.str;
5796 next();
5798 /* if still unknown size, error */
5799 size = type_size(type, &align);
5800 if (size < 0)
5801 tcc_error("unknown type size");
5803 if (flexible_array)
5804 size += flexible_array->type.ref->c * pointed_size(&flexible_array->type);
5805 /* take into account specified alignment if bigger */
5806 if (ad->a.aligned) {
5807 if (ad->a.aligned > align)
5808 align = ad->a.aligned;
5809 } else if (ad->a.packed) {
5810 align = 1;
5812 if ((r & VT_VALMASK) == VT_LOCAL) {
5813 sec = NULL;
5814 #ifdef CONFIG_TCC_BCHECK
5815 if (tcc_state->do_bounds_check && (type->t & VT_ARRAY)) {
5816 loc--;
5818 #endif
5819 loc = (loc - size) & -align;
5820 addr = loc;
5821 #ifdef CONFIG_TCC_BCHECK
5822 /* handles bounds */
5823 /* XXX: currently, since we do only one pass, we cannot track
5824 '&' operators, so we add only arrays */
5825 if (tcc_state->do_bounds_check && (type->t & VT_ARRAY)) {
5826 addr_t *bounds_ptr;
5827 /* add padding between regions */
5828 loc--;
5829 /* then add local bound info */
5830 bounds_ptr = section_ptr_add(lbounds_section, 2 * sizeof(addr_t));
5831 bounds_ptr[0] = addr;
5832 bounds_ptr[1] = size;
5834 #endif
5835 if (v) {
5836 /* local variable */
5837 sym_push(v, type, r, addr);
5838 } else {
5839 /* push local reference */
5840 vset(type, r, addr);
5842 } else {
5843 Sym *sym;
5845 sym = NULL;
5846 if (v && scope == VT_CONST) {
5847 /* see if the symbol was already defined */
5848 sym = sym_find(v);
5849 if (sym) {
5850 if (!is_compatible_types(&sym->type, type))
5851 tcc_error("incompatible types for redefinition of '%s'",
5852 get_tok_str(v, NULL));
5853 if (sym->type.t & VT_EXTERN) {
5854 /* if the variable is extern, it was not allocated */
5855 sym->type.t &= ~VT_EXTERN;
5856 /* set array size if it was omitted in extern
5857 declaration */
5858 if ((sym->type.t & VT_ARRAY) &&
5859 sym->type.ref->c < 0 &&
5860 type->ref->c >= 0)
5861 sym->type.ref->c = type->ref->c;
5862 } else {
5863 /* we accept several definitions of the same
5864 global variable. this is tricky, because we
5865 must play with the SHN_COMMON type of the symbol */
5866 /* XXX: should check if the variable was already
5867 initialized. It is incorrect to initialized it
5868 twice */
5869 /* no init data, we won't add more to the symbol */
5870 if (!has_init)
5871 goto no_alloc;
5876 /* allocate symbol in corresponding section */
5877 sec = ad->section;
5878 if (!sec) {
5879 if (has_init)
5880 sec = data_section;
5881 else if (tcc_state->nocommon)
5882 sec = bss_section;
5884 if (sec) {
5885 data_offset = sec->data_offset;
5886 data_offset = (data_offset + align - 1) & -align;
5887 addr = data_offset;
5888 /* very important to increment global pointer at this time
5889 because initializers themselves can create new initializers */
5890 data_offset += size;
5891 #ifdef CONFIG_TCC_BCHECK
5892 /* add padding if bound check */
5893 if (tcc_state->do_bounds_check)
5894 data_offset++;
5895 #endif
5896 sec->data_offset = data_offset;
5897 /* allocate section space to put the data */
5898 if (sec->sh_type != SHT_NOBITS &&
5899 data_offset > sec->data_allocated)
5900 section_realloc(sec, data_offset);
5901 /* align section if needed */
5902 if (align > sec->sh_addralign)
5903 sec->sh_addralign = align;
5904 } else {
5905 addr = 0; /* avoid warning */
5908 if (v) {
5909 if (scope != VT_CONST || !sym) {
5910 sym = sym_push(v, type, r | VT_SYM, 0);
5911 sym->asm_label = asm_label;
5913 /* update symbol definition */
5914 if (sec) {
5915 put_extern_sym(sym, sec, addr, size);
5916 } else {
5917 ElfW(Sym) *esym;
5918 /* put a common area */
5919 put_extern_sym(sym, NULL, align, size);
5920 /* XXX: find a nicer way */
5921 esym = &((ElfW(Sym) *)symtab_section->data)[sym->c];
5922 esym->st_shndx = SHN_COMMON;
5924 } else {
5925 /* push global reference */
5926 sym = get_sym_ref(type, sec, addr, size);
5927 vpushsym(type, sym);
5929 /* patch symbol weakness */
5930 if (type->t & VT_WEAK)
5931 weaken_symbol(sym);
5932 apply_visibility(sym, type);
5933 #ifdef CONFIG_TCC_BCHECK
5934 /* handles bounds now because the symbol must be defined
5935 before for the relocation */
5936 if (tcc_state->do_bounds_check) {
5937 addr_t *bounds_ptr;
5939 greloc(bounds_section, sym, bounds_section->data_offset, R_DATA_PTR);
5940 /* then add global bound info */
5941 bounds_ptr = section_ptr_add(bounds_section, 2 * sizeof(addr_t));
5942 bounds_ptr[0] = 0; /* relocated */
5943 bounds_ptr[1] = size;
5945 #endif
5947 if (has_init || (type->t & VT_VLA)) {
5948 decl_initializer(type, sec, addr, 1, 0);
5949 /* restore parse state if needed */
5950 if (init_str.str) {
5951 end_macro();
5952 restore_parse_state(&saved_parse_state);
5954 /* patch flexible array member size back to -1, */
5955 /* for possible subsequent similar declarations */
5956 if (flexible_array)
5957 flexible_array->type.ref->c = -1;
5959 no_alloc: ;
5962 static void put_func_debug(Sym *sym)
5964 char buf[512];
5966 /* stabs info */
5967 /* XXX: we put here a dummy type */
5968 snprintf(buf, sizeof(buf), "%s:%c1",
5969 funcname, sym->type.t & VT_STATIC ? 'f' : 'F');
5970 put_stabs_r(buf, N_FUN, 0, file->line_num, 0,
5971 cur_text_section, sym->c);
5972 /* //gr gdb wants a line at the function */
5973 put_stabn(N_SLINE, 0, file->line_num, 0);
5974 last_ind = 0;
5975 last_line_num = 0;
5978 /* parse an old style function declaration list */
5979 /* XXX: check multiple parameter */
5980 static void func_decl_list(Sym *func_sym)
5982 AttributeDef ad;
5983 int v;
5984 Sym *s;
5985 CType btype, type;
5987 /* parse each declaration */
5988 while (tok != '{' && tok != ';' && tok != ',' && tok != TOK_EOF &&
5989 tok != TOK_ASM1 && tok != TOK_ASM2 && tok != TOK_ASM3) {
5990 if (!parse_btype(&btype, &ad))
5991 expect("declaration list");
5992 if (((btype.t & VT_BTYPE) == VT_ENUM ||
5993 (btype.t & VT_BTYPE) == VT_STRUCT) &&
5994 tok == ';') {
5995 /* we accept no variable after */
5996 } else {
5997 for(;;) {
5998 type = btype;
5999 type_decl(&type, &ad, &v, TYPE_DIRECT);
6000 /* find parameter in function parameter list */
6001 s = func_sym->next;
6002 while (s != NULL) {
6003 if ((s->v & ~SYM_FIELD) == v)
6004 goto found;
6005 s = s->next;
6007 tcc_error("declaration for parameter '%s' but no such parameter",
6008 get_tok_str(v, NULL));
6009 found:
6010 /* check that no storage specifier except 'register' was given */
6011 if (type.t & VT_STORAGE)
6012 tcc_error("storage class specified for '%s'", get_tok_str(v, NULL));
6013 convert_parameter_type(&type);
6014 /* we can add the type (NOTE: it could be local to the function) */
6015 s->type = type;
6016 /* accept other parameters */
6017 if (tok == ',')
6018 next();
6019 else
6020 break;
6023 skip(';');
6027 /* parse a function defined by symbol 'sym' and generate its code in
6028 'cur_text_section' */
6029 static void gen_function(Sym *sym)
6031 int saved_nocode_wanted = nocode_wanted;
6033 nocode_wanted = 0;
6034 ind = cur_text_section->data_offset;
6035 /* NOTE: we patch the symbol size later */
6036 put_extern_sym(sym, cur_text_section, ind, 0);
6037 funcname = get_tok_str(sym->v, NULL);
6038 func_ind = ind;
6039 /* Initialize VLA state */
6040 vla_sp_loc = -1;
6041 vla_sp_root_loc = -1;
6042 /* put debug symbol */
6043 if (tcc_state->do_debug)
6044 put_func_debug(sym);
6045 /* push a dummy symbol to enable local sym storage */
6046 sym_push2(&local_stack, SYM_FIELD, 0, 0);
6047 gfunc_prolog(&sym->type);
6048 #ifdef CONFIG_TCC_BCHECK
6049 if (tcc_state->do_bounds_check && !strcmp(funcname, "main")) {
6050 int i;
6051 Sym *sym;
6052 for (i = 0, sym = local_stack; i < 2; i++, sym = sym->prev) {
6053 if (sym->v & SYM_FIELD || sym->prev->v & SYM_FIELD)
6054 break;
6055 vpush_global_sym(&func_old_type, TOK___bound_main_arg);
6056 vset(&sym->type, sym->r, sym->c);
6057 gfunc_call(1);
6060 #endif
6061 rsym = 0;
6062 block(NULL, NULL, NULL, NULL, 0, 0);
6063 gsym(rsym);
6064 gfunc_epilog();
6065 cur_text_section->data_offset = ind;
6066 label_pop(&global_label_stack, NULL);
6067 /* reset local stack */
6068 scope_stack_bottom = NULL;
6069 sym_pop(&local_stack, NULL);
6070 /* end of function */
6071 /* patch symbol size */
6072 ((ElfW(Sym) *)symtab_section->data)[sym->c].st_size =
6073 ind - func_ind;
6074 /* patch symbol weakness (this definition overrules any prototype) */
6075 if (sym->type.t & VT_WEAK)
6076 weaken_symbol(sym);
6077 apply_visibility(sym, &sym->type);
6078 if (tcc_state->do_debug) {
6079 put_stabn(N_FUN, 0, 0, ind - func_ind);
6081 /* It's better to crash than to generate wrong code */
6082 cur_text_section = NULL;
6083 funcname = ""; /* for safety */
6084 func_vt.t = VT_VOID; /* for safety */
6085 func_var = 0; /* for safety */
6086 ind = 0; /* for safety */
6087 nocode_wanted = saved_nocode_wanted;
6088 check_vstack();
6091 ST_FUNC void gen_inline_functions(void)
6093 Sym *sym;
6094 int inline_generated, i, ln;
6095 struct InlineFunc *fn;
6097 ln = file->line_num;
6098 /* iterate while inline function are referenced */
6099 for(;;) {
6100 inline_generated = 0;
6101 for (i = 0; i < tcc_state->nb_inline_fns; ++i) {
6102 fn = tcc_state->inline_fns[i];
6103 sym = fn->sym;
6104 if (sym && sym->c) {
6105 /* the function was used: generate its code and
6106 convert it to a normal function */
6107 fn->sym = NULL;
6108 if (file)
6109 pstrcpy(file->filename, sizeof file->filename, fn->filename);
6110 sym->r = VT_SYM | VT_CONST;
6111 sym->type.t &= ~VT_INLINE;
6113 begin_macro(&fn->func_str, 0);
6114 next();
6115 cur_text_section = text_section;
6116 gen_function(sym);
6117 end_macro();
6119 inline_generated = 1;
6122 if (!inline_generated)
6123 break;
6125 file->line_num = ln;
6126 /* free tokens of unused inline functions */
6127 for (i = 0; i < tcc_state->nb_inline_fns; ++i) {
6128 fn = tcc_state->inline_fns[i];
6129 if (fn->sym)
6130 tok_str_free(fn->func_str.str);
6132 dynarray_reset(&tcc_state->inline_fns, &tcc_state->nb_inline_fns);
6135 /* 'l' is VT_LOCAL or VT_CONST to define default storage type */
6136 static int decl0(int l, int is_for_loop_init)
6138 int v, has_init, r;
6139 CType type, btype;
6140 Sym *sym;
6141 AttributeDef ad;
6143 while (1) {
6144 if (!parse_btype(&btype, &ad)) {
6145 if (is_for_loop_init)
6146 return 0;
6147 /* skip redundant ';' */
6148 /* XXX: find more elegant solution */
6149 if (tok == ';') {
6150 next();
6151 continue;
6153 if (l == VT_CONST &&
6154 (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
6155 /* global asm block */
6156 asm_global_instr();
6157 continue;
6159 /* special test for old K&R protos without explicit int
6160 type. Only accepted when defining global data */
6161 if (l == VT_LOCAL || tok < TOK_DEFINE)
6162 break;
6163 btype.t = VT_INT;
6165 if (((btype.t & VT_BTYPE) == VT_ENUM ||
6166 (btype.t & VT_BTYPE) == VT_STRUCT) &&
6167 tok == ';') {
6168 if ((btype.t & VT_BTYPE) == VT_STRUCT) {
6169 int v = btype.ref->v;
6170 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) >= SYM_FIRST_ANOM)
6171 tcc_warning("unnamed struct/union that defines no instances");
6173 next();
6174 continue;
6176 while (1) { /* iterate thru each declaration */
6177 char *asm_label; // associated asm label
6178 type = btype;
6179 type_decl(&type, &ad, &v, TYPE_DIRECT);
6180 #if 0
6182 char buf[500];
6183 type_to_str(buf, sizeof(buf), t, get_tok_str(v, NULL));
6184 printf("type = '%s'\n", buf);
6186 #endif
6187 if ((type.t & VT_BTYPE) == VT_FUNC) {
6188 if ((type.t & VT_STATIC) && (l == VT_LOCAL)) {
6189 tcc_error("function without file scope cannot be static");
6191 /* if old style function prototype, we accept a
6192 declaration list */
6193 sym = type.ref;
6194 if (sym->c == FUNC_OLD)
6195 func_decl_list(sym);
6198 asm_label = NULL;
6199 if (gnu_ext && (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
6200 CString astr;
6202 asm_label_instr(&astr);
6203 asm_label = tcc_strdup(astr.data);
6204 cstr_free(&astr);
6206 /* parse one last attribute list, after asm label */
6207 parse_attribute(&ad);
6210 if (ad.a.weak)
6211 type.t |= VT_WEAK;
6212 #ifdef TCC_TARGET_PE
6213 if (ad.a.func_import)
6214 type.t |= VT_IMPORT;
6215 if (ad.a.func_export)
6216 type.t |= VT_EXPORT;
6217 #endif
6218 type.t |= ad.a.visibility << VT_VIS_SHIFT;
6220 if (tok == '{') {
6221 if (l == VT_LOCAL)
6222 tcc_error("cannot use local functions");
6223 if ((type.t & VT_BTYPE) != VT_FUNC)
6224 expect("function definition");
6226 /* reject abstract declarators in function definition */
6227 sym = type.ref;
6228 while ((sym = sym->next) != NULL)
6229 if (!(sym->v & ~SYM_FIELD))
6230 expect("identifier");
6232 /* XXX: cannot do better now: convert extern line to static inline */
6233 if ((type.t & (VT_EXTERN | VT_INLINE)) == (VT_EXTERN | VT_INLINE))
6234 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
6236 sym = sym_find(v);
6237 if (sym) {
6238 Sym *ref;
6239 if ((sym->type.t & VT_BTYPE) != VT_FUNC)
6240 goto func_error1;
6242 ref = sym->type.ref;
6243 if (0 == ref->a.func_proto)
6244 tcc_error("redefinition of '%s'", get_tok_str(v, NULL));
6246 /* use func_call from prototype if not defined */
6247 if (ref->a.func_call != FUNC_CDECL
6248 && type.ref->a.func_call == FUNC_CDECL)
6249 type.ref->a.func_call = ref->a.func_call;
6251 /* use export from prototype */
6252 if (ref->a.func_export)
6253 type.ref->a.func_export = 1;
6255 /* use static from prototype */
6256 if (sym->type.t & VT_STATIC)
6257 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
6259 /* If the definition has no visibility use the
6260 one from prototype. */
6261 if (! (type.t & VT_VIS_MASK))
6262 type.t |= sym->type.t & VT_VIS_MASK;
6264 if (!is_compatible_types(&sym->type, &type)) {
6265 func_error1:
6266 tcc_error("incompatible types for redefinition of '%s'",
6267 get_tok_str(v, NULL));
6269 type.ref->a.func_proto = 0;
6270 /* if symbol is already defined, then put complete type */
6271 sym->type = type;
6272 } else {
6273 /* put function symbol */
6274 sym = global_identifier_push(v, type.t, 0);
6275 sym->type.ref = type.ref;
6278 /* static inline functions are just recorded as a kind
6279 of macro. Their code will be emitted at the end of
6280 the compilation unit only if they are used */
6281 if ((type.t & (VT_INLINE | VT_STATIC)) ==
6282 (VT_INLINE | VT_STATIC)) {
6283 int block_level;
6284 struct InlineFunc *fn;
6285 const char *filename;
6287 filename = file ? file->filename : "";
6288 fn = tcc_malloc(sizeof *fn + strlen(filename));
6289 strcpy(fn->filename, filename);
6290 fn->sym = sym;
6291 tok_str_new(&fn->func_str);
6293 block_level = 0;
6294 for(;;) {
6295 int t;
6296 if (tok == TOK_EOF)
6297 tcc_error("unexpected end of file");
6298 tok_str_add_tok(&fn->func_str);
6299 t = tok;
6300 next();
6301 if (t == '{') {
6302 block_level++;
6303 } else if (t == '}') {
6304 block_level--;
6305 if (block_level == 0)
6306 break;
6309 tok_str_add(&fn->func_str, -1);
6310 tok_str_add(&fn->func_str, 0);
6311 dynarray_add((void ***)&tcc_state->inline_fns, &tcc_state->nb_inline_fns, fn);
6313 } else {
6314 /* compute text section */
6315 cur_text_section = ad.section;
6316 if (!cur_text_section)
6317 cur_text_section = text_section;
6318 sym->r = VT_SYM | VT_CONST;
6319 gen_function(sym);
6321 break;
6322 } else {
6323 if (btype.t & VT_TYPEDEF) {
6324 /* save typedefed type */
6325 /* XXX: test storage specifiers ? */
6326 sym = sym_push(v, &type, 0, 0);
6327 sym->a = ad.a;
6328 sym->type.t |= VT_TYPEDEF;
6329 } else {
6330 r = 0;
6331 if ((type.t & VT_BTYPE) == VT_FUNC) {
6332 /* external function definition */
6333 /* specific case for func_call attribute */
6334 ad.a.func_proto = 1;
6335 type.ref->a = ad.a;
6336 } else if (!(type.t & VT_ARRAY)) {
6337 /* not lvalue if array */
6338 r |= lvalue_type(type.t);
6340 has_init = (tok == '=');
6341 if (has_init && (type.t & VT_VLA))
6342 tcc_error("Variable length array cannot be initialized");
6343 if ((btype.t & VT_EXTERN) || ((type.t & VT_BTYPE) == VT_FUNC) ||
6344 ((type.t & VT_ARRAY) && (type.t & VT_STATIC) &&
6345 !has_init && l == VT_CONST && type.ref->c < 0)) {
6346 /* external variable or function */
6347 /* NOTE: as GCC, uninitialized global static
6348 arrays of null size are considered as
6349 extern */
6350 sym = external_sym(v, &type, r, asm_label);
6352 if (ad.alias_target) {
6353 Section tsec;
6354 Elf32_Sym *esym;
6355 Sym *alias_target;
6357 alias_target = sym_find(ad.alias_target);
6358 if (!alias_target || !alias_target->c)
6359 tcc_error("unsupported forward __alias__ attribute");
6360 esym = &((Elf32_Sym *)symtab_section->data)[alias_target->c];
6361 tsec.sh_num = esym->st_shndx;
6362 put_extern_sym2(sym, &tsec, esym->st_value, esym->st_size, 0);
6364 } else {
6365 type.t |= (btype.t & VT_STATIC); /* Retain "static". */
6366 if (type.t & VT_STATIC)
6367 r |= VT_CONST;
6368 else
6369 r |= l;
6370 if (has_init)
6371 next();
6372 decl_initializer_alloc(&type, &ad, r, has_init, v, asm_label, l);
6375 if (tok != ',') {
6376 if (is_for_loop_init)
6377 return 1;
6378 skip(';');
6379 break;
6381 next();
6383 ad.a.aligned = 0;
6386 return 0;
6389 ST_FUNC void decl(int l)
6391 decl0(l, 0);