arm64: Improve constant generation, with tests.
[tinycc.git] / tccgen.c
blob383b14667f06da2f965ef5400e935583750e10a7
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 vla_sp_loc_tmp; /* vla_sp_loc is set to this when the value won't be needed later */
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 */
61 ST_DATA int vla_flags; /* VLA_* flags */
63 ST_DATA SValue __vstack[1+VSTACK_SIZE], *vtop;
65 ST_DATA int const_wanted; /* true if constant wanted */
66 ST_DATA int nocode_wanted; /* true if no code generation wanted for an expression */
67 ST_DATA int global_expr; /* true if compound literals must be allocated globally (used during initializers parsing */
68 ST_DATA CType func_vt; /* current function return type (used by return instruction) */
69 ST_DATA int func_var; /* true if current function is variadic (used by return instruction) */
70 ST_DATA int func_vc;
71 ST_DATA int last_line_num, last_ind, func_ind; /* debug last line number and pc */
72 ST_DATA char *funcname;
74 ST_DATA CType char_pointer_type, func_old_type, int_type, size_type;
76 /* ------------------------------------------------------------------------- */
77 static void gen_cast(CType *type);
78 static inline CType *pointed_type(CType *type);
79 static int is_compatible_types(CType *type1, CType *type2);
80 static int parse_btype(CType *type, AttributeDef *ad);
81 static void type_decl(CType *type, AttributeDef *ad, int *v, int td);
82 static void parse_expr_type(CType *type);
83 static void decl_initializer(CType *type, Section *sec, unsigned long c, int first, int size_only);
84 static void block(int *bsym, int *csym, int *case_sym, int *def_sym, int case_reg, int is_expr);
85 static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r, int has_init, int v, char *asm_label, int scope);
86 static int decl0(int l, int is_for_loop_init);
87 static void expr_eq(void);
88 static void unary_type(CType *type);
89 static void vla_runtime_type_size(CType *type, int *a);
90 static void vla_sp_save(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 /* ------------------------------------------------------------------------- */
122 /* symbol allocator */
123 static Sym *__sym_malloc(void)
125 Sym *sym_pool, *sym, *last_sym;
126 int i;
128 sym_pool = tcc_malloc(SYM_POOL_NB * sizeof(Sym));
129 dynarray_add(&sym_pools, &nb_sym_pools, sym_pool);
131 last_sym = sym_free_first;
132 sym = sym_pool;
133 for(i = 0; i < SYM_POOL_NB; i++) {
134 sym->next = last_sym;
135 last_sym = sym;
136 sym++;
138 sym_free_first = last_sym;
139 return last_sym;
142 static inline Sym *sym_malloc(void)
144 Sym *sym;
145 sym = sym_free_first;
146 if (!sym)
147 sym = __sym_malloc();
148 sym_free_first = sym->next;
149 return sym;
152 ST_INLN void sym_free(Sym *sym)
154 sym->next = sym_free_first;
155 tcc_free(sym->asm_label);
156 sym_free_first = sym;
159 /* push, without hashing */
160 ST_FUNC Sym *sym_push2(Sym **ps, int v, int t, long c)
162 Sym *s;
163 if (ps == &local_stack) {
164 for (s = *ps; s && s != scope_stack_bottom; s = s->prev)
165 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM && s->v == v)
166 tcc_error("incompatible types for redefinition of '%s'",
167 get_tok_str(v, NULL));
169 s = sym_malloc();
170 s->asm_label = NULL;
171 s->v = v;
172 s->type.t = t;
173 s->type.ref = NULL;
174 #ifdef _WIN64
175 s->d = NULL;
176 #endif
177 s->c = c;
178 s->next = NULL;
179 /* add in stack */
180 s->prev = *ps;
181 *ps = s;
182 return s;
185 /* find a symbol and return its associated structure. 's' is the top
186 of the symbol stack */
187 ST_FUNC Sym *sym_find2(Sym *s, int v)
189 while (s) {
190 if (s->v == v)
191 return s;
192 else if (s->v == -1)
193 return NULL;
194 s = s->prev;
196 return NULL;
199 /* structure lookup */
200 ST_INLN Sym *struct_find(int v)
202 v -= TOK_IDENT;
203 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
204 return NULL;
205 return table_ident[v]->sym_struct;
208 /* find an identifier */
209 ST_INLN Sym *sym_find(int v)
211 v -= TOK_IDENT;
212 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
213 return NULL;
214 return table_ident[v]->sym_identifier;
217 /* push a given symbol on the symbol stack */
218 ST_FUNC Sym *sym_push(int v, CType *type, int r, int c)
220 Sym *s, **ps;
221 TokenSym *ts;
223 if (local_stack)
224 ps = &local_stack;
225 else
226 ps = &global_stack;
227 s = sym_push2(ps, v, type->t, c);
228 s->type.ref = type->ref;
229 s->r = r;
230 /* don't record fields or anonymous symbols */
231 /* XXX: simplify */
232 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
233 /* record symbol in token array */
234 ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT];
235 if (v & SYM_STRUCT)
236 ps = &ts->sym_struct;
237 else
238 ps = &ts->sym_identifier;
239 s->prev_tok = *ps;
240 *ps = s;
242 return s;
245 /* push a global identifier */
246 ST_FUNC Sym *global_identifier_push(int v, int t, int c)
248 Sym *s, **ps;
249 s = sym_push2(&global_stack, v, t, c);
250 /* don't record anonymous symbol */
251 if (v < SYM_FIRST_ANOM) {
252 ps = &table_ident[v - TOK_IDENT]->sym_identifier;
253 /* modify the top most local identifier, so that
254 sym_identifier will point to 's' when popped */
255 while (*ps != NULL)
256 ps = &(*ps)->prev_tok;
257 s->prev_tok = NULL;
258 *ps = s;
260 return s;
263 /* pop symbols until top reaches 'b' */
264 ST_FUNC void sym_pop(Sym **ptop, Sym *b)
266 Sym *s, *ss, **ps;
267 TokenSym *ts;
268 int v;
270 s = *ptop;
271 while(s != b) {
272 ss = s->prev;
273 v = s->v;
274 /* remove symbol in token array */
275 /* XXX: simplify */
276 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
277 ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT];
278 if (v & SYM_STRUCT)
279 ps = &ts->sym_struct;
280 else
281 ps = &ts->sym_identifier;
282 *ps = s->prev_tok;
284 sym_free(s);
285 s = ss;
287 *ptop = b;
290 static void weaken_symbol(Sym *sym)
292 sym->type.t |= VT_WEAK;
293 if (sym->c > 0) {
294 int esym_type;
295 ElfW(Sym) *esym;
297 esym = &((ElfW(Sym) *)symtab_section->data)[sym->c];
298 esym_type = ELFW(ST_TYPE)(esym->st_info);
299 esym->st_info = ELFW(ST_INFO)(STB_WEAK, esym_type);
303 static void apply_visibility(Sym *sym, CType *type)
305 int vis = sym->type.t & VT_VIS_MASK;
306 int vis2 = type->t & VT_VIS_MASK;
307 if (vis == (STV_DEFAULT << VT_VIS_SHIFT))
308 vis = vis2;
309 else if (vis2 == (STV_DEFAULT << VT_VIS_SHIFT))
311 else
312 vis = (vis < vis2) ? vis : vis2;
313 sym->type.t &= ~VT_VIS_MASK;
314 sym->type.t |= vis;
316 if (sym->c > 0) {
317 ElfW(Sym) *esym;
319 esym = &((ElfW(Sym) *)symtab_section->data)[sym->c];
320 vis >>= VT_VIS_SHIFT;
321 esym->st_other = (esym->st_other & ~ELFW(ST_VISIBILITY)(-1)) | vis;
325 /* ------------------------------------------------------------------------- */
327 ST_FUNC void swap(int *p, int *q)
329 int t;
330 t = *p;
331 *p = *q;
332 *q = t;
335 static void vsetc(CType *type, int r, CValue *vc)
337 int v;
339 if (vtop >= vstack + (VSTACK_SIZE - 1))
340 tcc_error("memory full (vstack)");
341 /* cannot let cpu flags if other instruction are generated. Also
342 avoid leaving VT_JMP anywhere except on the top of the stack
343 because it would complicate the code generator. */
344 if (vtop >= vstack) {
345 v = vtop->r & VT_VALMASK;
346 if (v == VT_CMP || (v & ~1) == VT_JMP)
347 gv(RC_INT);
349 vtop++;
350 vtop->type = *type;
351 vtop->r = r;
352 vtop->r2 = VT_CONST;
353 vtop->c = *vc;
356 /* push constant of type "type" with useless value */
357 ST_FUNC void vpush(CType *type)
359 CValue cval;
360 vsetc(type, VT_CONST, &cval);
363 /* push integer constant */
364 ST_FUNC void vpushi(int v)
366 CValue cval;
367 cval.i = v;
368 vsetc(&int_type, VT_CONST, &cval);
371 /* push a pointer sized constant */
372 static void vpushs(addr_t v)
374 CValue cval;
375 cval.ptr_offset = v;
376 vsetc(&size_type, VT_CONST, &cval);
379 /* push arbitrary 64bit constant */
380 ST_FUNC void vpush64(int ty, unsigned long long v)
382 CValue cval;
383 CType ctype;
384 ctype.t = ty;
385 ctype.ref = NULL;
386 cval.ull = v;
387 vsetc(&ctype, VT_CONST, &cval);
390 /* push long long constant */
391 static inline void vpushll(long long v)
393 vpush64(VT_LLONG, v);
396 /* push a symbol value of TYPE */
397 static inline void vpushsym(CType *type, Sym *sym)
399 CValue cval;
400 cval.ptr_offset = 0;
401 vsetc(type, VT_CONST | VT_SYM, &cval);
402 vtop->sym = sym;
405 /* Return a static symbol pointing to a section */
406 ST_FUNC Sym *get_sym_ref(CType *type, Section *sec, unsigned long offset, unsigned long size)
408 int v;
409 Sym *sym;
411 v = anon_sym++;
412 sym = global_identifier_push(v, type->t | VT_STATIC, 0);
413 sym->type.ref = type->ref;
414 sym->r = VT_CONST | VT_SYM;
415 put_extern_sym(sym, sec, offset, size);
416 return sym;
419 /* push a reference to a section offset by adding a dummy symbol */
420 static void vpush_ref(CType *type, Section *sec, unsigned long offset, unsigned long size)
422 vpushsym(type, get_sym_ref(type, sec, offset, size));
425 /* define a new external reference to a symbol 'v' of type 'u' */
426 ST_FUNC Sym *external_global_sym(int v, CType *type, int r)
428 Sym *s;
430 s = sym_find(v);
431 if (!s) {
432 /* push forward reference */
433 s = global_identifier_push(v, type->t | VT_EXTERN, 0);
434 s->type.ref = type->ref;
435 s->r = r | VT_CONST | VT_SYM;
437 return s;
440 /* define a new external reference to a symbol 'v' with alternate asm
441 name 'asm_label' of type 'u'. 'asm_label' is equal to NULL if there
442 is no alternate name (most cases) */
443 static Sym *external_sym(int v, CType *type, int r, char *asm_label)
445 Sym *s;
447 s = sym_find(v);
448 if (!s) {
449 /* push forward reference */
450 s = sym_push(v, type, r | VT_CONST | VT_SYM, 0);
451 s->asm_label = asm_label;
452 s->type.t |= VT_EXTERN;
453 } else if (s->type.ref == func_old_type.ref) {
454 s->type.ref = type->ref;
455 s->r = r | VT_CONST | VT_SYM;
456 s->type.t |= VT_EXTERN;
457 } else if (!is_compatible_types(&s->type, type)) {
458 tcc_error("incompatible types for redefinition of '%s'",
459 get_tok_str(v, NULL));
461 /* Merge some storage attributes. */
462 if (type->t & VT_WEAK)
463 weaken_symbol(s);
465 if (type->t & VT_VIS_MASK)
466 apply_visibility(s, type);
468 return s;
471 /* push a reference to global symbol v */
472 ST_FUNC void vpush_global_sym(CType *type, int v)
474 vpushsym(type, external_global_sym(v, type, 0));
477 ST_FUNC void vset(CType *type, int r, int v)
479 CValue cval;
481 cval.i = v;
482 vsetc(type, r, &cval);
485 static void vseti(int r, int v)
487 CType type;
488 type.t = VT_INT;
489 type.ref = 0;
490 vset(&type, r, v);
493 ST_FUNC void vswap(void)
495 SValue tmp;
496 /* cannot let cpu flags if other instruction are generated. Also
497 avoid leaving VT_JMP anywhere except on the top of the stack
498 because it would complicate the code generator. */
499 if (vtop >= vstack) {
500 int v = vtop->r & VT_VALMASK;
501 if (v == VT_CMP || (v & ~1) == VT_JMP)
502 gv(RC_INT);
504 tmp = vtop[0];
505 vtop[0] = vtop[-1];
506 vtop[-1] = tmp;
508 /* XXX: +2% overall speed possible with optimized memswap
510 * memswap(&vtop[0], &vtop[1], sizeof *vtop);
514 ST_FUNC void vpushv(SValue *v)
516 if (vtop >= vstack + (VSTACK_SIZE - 1))
517 tcc_error("memory full (vstack)");
518 vtop++;
519 *vtop = *v;
522 static void vdup(void)
524 vpushv(vtop);
527 /* save r to the memory stack, and mark it as being free */
528 ST_FUNC void save_reg(int r)
530 int l, saved, size, align;
531 SValue *p, sv;
532 CType *type;
534 /* modify all stack values */
535 saved = 0;
536 l = 0;
537 for(p=vstack;p<=vtop;p++) {
538 if ((p->r & VT_VALMASK) == r ||
539 ((p->type.t & VT_BTYPE) == VT_LLONG && (p->r2 & VT_VALMASK) == r)) {
540 /* must save value on stack if not already done */
541 if (!saved) {
542 /* NOTE: must reload 'r' because r might be equal to r2 */
543 r = p->r & VT_VALMASK;
544 /* store register in the stack */
545 type = &p->type;
546 if ((p->r & VT_LVAL) ||
547 (!is_float(type->t) && (type->t & VT_BTYPE) != VT_LLONG))
548 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
549 type = &char_pointer_type;
550 #else
551 type = &int_type;
552 #endif
553 size = type_size(type, &align);
554 loc = (loc - size) & -align;
555 sv.type.t = type->t;
556 sv.r = VT_LOCAL | VT_LVAL;
557 sv.c.ul = loc;
558 store(r, &sv);
559 #if defined(TCC_TARGET_I386) || defined(TCC_TARGET_X86_64)
560 /* x86 specific: need to pop fp register ST0 if saved */
561 if (r == TREG_ST0) {
562 o(0xd8dd); /* fstp %st(0) */
564 #endif
565 #if !defined(TCC_TARGET_ARM64) && !defined(TCC_TARGET_X86_64)
566 /* special long long case */
567 if ((type->t & VT_BTYPE) == VT_LLONG) {
568 sv.c.ul += 4;
569 store(p->r2, &sv);
571 #endif
572 l = loc;
573 saved = 1;
575 /* mark that stack entry as being saved on the stack */
576 if (p->r & VT_LVAL) {
577 /* also clear the bounded flag because the
578 relocation address of the function was stored in
579 p->c.ul */
580 p->r = (p->r & ~(VT_VALMASK | VT_BOUNDED)) | VT_LLOCAL;
581 } else {
582 p->r = lvalue_type(p->type.t) | VT_LOCAL;
584 p->r2 = VT_CONST;
585 p->c.ul = l;
590 #ifdef TCC_TARGET_ARM
591 /* find a register of class 'rc2' with at most one reference on stack.
592 * If none, call get_reg(rc) */
593 ST_FUNC int get_reg_ex(int rc, int rc2)
595 int r;
596 SValue *p;
598 for(r=0;r<NB_REGS;r++) {
599 if (reg_classes[r] & rc2) {
600 int n;
601 n=0;
602 for(p = vstack; p <= vtop; p++) {
603 if ((p->r & VT_VALMASK) == r ||
604 (p->r2 & VT_VALMASK) == r)
605 n++;
607 if (n <= 1)
608 return r;
611 return get_reg(rc);
613 #endif
615 /* find a free register of class 'rc'. If none, save one register */
616 ST_FUNC int get_reg(int rc)
618 int r;
619 SValue *p;
621 /* find a free register */
622 for(r=0;r<NB_REGS;r++) {
623 if (reg_classes[r] & rc) {
624 for(p=vstack;p<=vtop;p++) {
625 if ((p->r & VT_VALMASK) == r ||
626 (p->r2 & VT_VALMASK) == r)
627 goto notfound;
629 return r;
631 notfound: ;
634 /* no register left : free the first one on the stack (VERY
635 IMPORTANT to start from the bottom to ensure that we don't
636 spill registers used in gen_opi()) */
637 for(p=vstack;p<=vtop;p++) {
638 /* look at second register (if long long) */
639 r = p->r2 & VT_VALMASK;
640 if (r < VT_CONST && (reg_classes[r] & rc))
641 goto save_found;
642 r = p->r & VT_VALMASK;
643 if (r < VT_CONST && (reg_classes[r] & rc)) {
644 save_found:
645 save_reg(r);
646 return r;
649 /* Should never comes here */
650 return -1;
653 /* save registers up to (vtop - n) stack entry */
654 ST_FUNC void save_regs(int n)
656 int r;
657 SValue *p, *p1;
658 p1 = vtop - n;
659 for(p = vstack;p <= p1; p++) {
660 r = p->r & VT_VALMASK;
661 if (r < VT_CONST) {
662 save_reg(r);
667 /* move register 's' (of type 't') to 'r', and flush previous value of r to memory
668 if needed */
669 static void move_reg(int r, int s, int t)
671 SValue sv;
673 if (r != s) {
674 save_reg(r);
675 sv.type.t = t;
676 sv.type.ref = NULL;
677 sv.r = s;
678 sv.c.ul = 0;
679 load(r, &sv);
683 /* get address of vtop (vtop MUST BE an lvalue) */
684 ST_FUNC void gaddrof(void)
686 if (vtop->r & VT_REF)
687 gv(RC_INT);
688 vtop->r &= ~VT_LVAL;
689 /* tricky: if saved lvalue, then we can go back to lvalue */
690 if ((vtop->r & VT_VALMASK) == VT_LLOCAL)
691 vtop->r = (vtop->r & ~(VT_VALMASK | VT_LVAL_TYPE)) | VT_LOCAL | VT_LVAL;
696 #ifdef CONFIG_TCC_BCHECK
697 /* generate lvalue bound code */
698 static void gbound(void)
700 int lval_type;
701 CType type1;
703 vtop->r &= ~VT_MUSTBOUND;
704 /* if lvalue, then use checking code before dereferencing */
705 if (vtop->r & VT_LVAL) {
706 /* if not VT_BOUNDED value, then make one */
707 if (!(vtop->r & VT_BOUNDED)) {
708 lval_type = vtop->r & (VT_LVAL_TYPE | VT_LVAL);
709 /* must save type because we must set it to int to get pointer */
710 type1 = vtop->type;
711 vtop->type.t = VT_INT;
712 gaddrof();
713 vpushi(0);
714 gen_bounded_ptr_add();
715 vtop->r |= lval_type;
716 vtop->type = type1;
718 /* then check for dereferencing */
719 gen_bounded_ptr_deref();
722 #endif
724 /* store vtop a register belonging to class 'rc'. lvalues are
725 converted to values. Cannot be used if cannot be converted to
726 register value (such as structures). */
727 ST_FUNC int gv(int rc)
729 int r, bit_pos, bit_size, size, align, i;
730 int rc2;
732 /* NOTE: get_reg can modify vstack[] */
733 if (vtop->type.t & VT_BITFIELD) {
734 CType type;
735 int bits = 32;
736 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
737 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
738 /* remove bit field info to avoid loops */
739 vtop->type.t &= ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT));
740 /* cast to int to propagate signedness in following ops */
741 if ((vtop->type.t & VT_BTYPE) == VT_LLONG) {
742 type.t = VT_LLONG;
743 bits = 64;
744 } else
745 type.t = VT_INT;
746 if((vtop->type.t & VT_UNSIGNED) ||
747 (vtop->type.t & VT_BTYPE) == VT_BOOL)
748 type.t |= VT_UNSIGNED;
749 gen_cast(&type);
750 /* generate shifts */
751 vpushi(bits - (bit_pos + bit_size));
752 gen_op(TOK_SHL);
753 vpushi(bits - bit_size);
754 /* NOTE: transformed to SHR if unsigned */
755 gen_op(TOK_SAR);
756 r = gv(rc);
757 } else {
758 if (is_float(vtop->type.t) &&
759 (vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
760 Sym *sym;
761 int *ptr;
762 unsigned long offset;
763 #if defined(TCC_TARGET_ARM) && !defined(TCC_ARM_VFP)
764 CValue check;
765 #endif
767 /* XXX: unify with initializers handling ? */
768 /* CPUs usually cannot use float constants, so we store them
769 generically in data segment */
770 size = type_size(&vtop->type, &align);
771 offset = (data_section->data_offset + align - 1) & -align;
772 data_section->data_offset = offset;
773 /* XXX: not portable yet */
774 #if defined(__i386__) || defined(__x86_64__)
775 /* Zero pad x87 tenbyte long doubles */
776 if (size == LDOUBLE_SIZE) {
777 vtop->c.tab[2] &= 0xffff;
778 #if LDOUBLE_SIZE == 16
779 vtop->c.tab[3] = 0;
780 #endif
782 #endif
783 ptr = section_ptr_add(data_section, size);
784 size = size >> 2;
785 #if defined(TCC_TARGET_ARM) && !defined(TCC_ARM_VFP)
786 check.d = 1;
787 if(check.tab[0])
788 for(i=0;i<size;i++)
789 ptr[i] = vtop->c.tab[size-1-i];
790 else
791 #endif
792 for(i=0;i<size;i++)
793 ptr[i] = vtop->c.tab[i];
794 sym = get_sym_ref(&vtop->type, data_section, offset, size << 2);
795 vtop->r |= VT_LVAL | VT_SYM;
796 vtop->sym = sym;
797 vtop->c.ptr_offset = 0;
799 #ifdef CONFIG_TCC_BCHECK
800 if (vtop->r & VT_MUSTBOUND)
801 gbound();
802 #endif
804 r = vtop->r & VT_VALMASK;
805 rc2 = (rc & RC_FLOAT) ? RC_FLOAT : RC_INT;
806 #ifndef TCC_TARGET_ARM64
807 if (rc == RC_IRET)
808 rc2 = RC_LRET;
809 #ifdef TCC_TARGET_X86_64
810 else if (rc == RC_FRET)
811 rc2 = RC_QRET;
812 #endif
813 #endif
815 /* need to reload if:
816 - constant
817 - lvalue (need to dereference pointer)
818 - already a register, but not in the right class */
819 if (r >= VT_CONST
820 || (vtop->r & VT_LVAL)
821 || !(reg_classes[r] & rc)
822 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
823 || ((vtop->type.t & VT_BTYPE) == VT_QLONG && !(reg_classes[vtop->r2] & rc2))
824 || ((vtop->type.t & VT_BTYPE) == VT_QFLOAT && !(reg_classes[vtop->r2] & rc2))
825 #else
826 || ((vtop->type.t & VT_BTYPE) == VT_LLONG && !(reg_classes[vtop->r2] & rc2))
827 #endif
830 r = get_reg(rc);
831 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
832 if (((vtop->type.t & VT_BTYPE) == VT_QLONG) || ((vtop->type.t & VT_BTYPE) == VT_QFLOAT)) {
833 int addr_type = VT_LLONG, load_size = 8, load_type = ((vtop->type.t & VT_BTYPE) == VT_QLONG) ? VT_LLONG : VT_DOUBLE;
834 #else
835 if ((vtop->type.t & VT_BTYPE) == VT_LLONG) {
836 int addr_type = VT_INT, load_size = 4, load_type = VT_INT;
837 unsigned long long ll;
838 #endif
839 int r2, original_type;
840 original_type = vtop->type.t;
841 /* two register type load : expand to two words
842 temporarily */
843 #if !defined(TCC_TARGET_ARM64) && !defined(TCC_TARGET_X86_64)
844 if ((vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) {
845 /* load constant */
846 ll = vtop->c.ull;
847 vtop->c.ui = ll; /* first word */
848 load(r, vtop);
849 vtop->r = r; /* save register value */
850 vpushi(ll >> 32); /* second word */
851 } else
852 #endif
853 if (r >= VT_CONST || /* XXX: test to VT_CONST incorrect ? */
854 (vtop->r & VT_LVAL)) {
855 /* We do not want to modifier the long long
856 pointer here, so the safest (and less
857 efficient) is to save all the other registers
858 in the stack. XXX: totally inefficient. */
859 save_regs(1);
860 /* load from memory */
861 vtop->type.t = load_type;
862 load(r, vtop);
863 vdup();
864 vtop[-1].r = r; /* save register value */
865 /* increment pointer to get second word */
866 vtop->type.t = addr_type;
867 gaddrof();
868 vpushi(load_size);
869 gen_op('+');
870 vtop->r |= VT_LVAL;
871 vtop->type.t = load_type;
872 } else {
873 /* move registers */
874 load(r, vtop);
875 vdup();
876 vtop[-1].r = r; /* save register value */
877 vtop->r = vtop[-1].r2;
879 /* Allocate second register. Here we rely on the fact that
880 get_reg() tries first to free r2 of an SValue. */
881 r2 = get_reg(rc2);
882 load(r2, vtop);
883 vpop();
884 /* write second register */
885 vtop->r2 = r2;
886 vtop->type.t = original_type;
887 } else if ((vtop->r & VT_LVAL) && !is_float(vtop->type.t)) {
888 int t1, t;
889 /* lvalue of scalar type : need to use lvalue type
890 because of possible cast */
891 t = vtop->type.t;
892 t1 = t;
893 /* compute memory access type */
894 if (vtop->r & VT_REF)
895 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
896 t = VT_PTR;
897 #else
898 t = VT_INT;
899 #endif
900 else if (vtop->r & VT_LVAL_BYTE)
901 t = VT_BYTE;
902 else if (vtop->r & VT_LVAL_SHORT)
903 t = VT_SHORT;
904 if (vtop->r & VT_LVAL_UNSIGNED)
905 t |= VT_UNSIGNED;
906 vtop->type.t = t;
907 load(r, vtop);
908 /* restore wanted type */
909 vtop->type.t = t1;
910 } else {
911 /* one register type load */
912 load(r, vtop);
915 vtop->r = r;
916 #ifdef TCC_TARGET_C67
917 /* uses register pairs for doubles */
918 if ((vtop->type.t & VT_BTYPE) == VT_DOUBLE)
919 vtop->r2 = r+1;
920 #endif
922 return r;
925 /* generate vtop[-1] and vtop[0] in resp. classes rc1 and rc2 */
926 ST_FUNC void gv2(int rc1, int rc2)
928 int v;
930 /* generate more generic register first. But VT_JMP or VT_CMP
931 values must be generated first in all cases to avoid possible
932 reload errors */
933 v = vtop[0].r & VT_VALMASK;
934 if (v != VT_CMP && (v & ~1) != VT_JMP && rc1 <= rc2) {
935 vswap();
936 gv(rc1);
937 vswap();
938 gv(rc2);
939 /* test if reload is needed for first register */
940 if ((vtop[-1].r & VT_VALMASK) >= VT_CONST) {
941 vswap();
942 gv(rc1);
943 vswap();
945 } else {
946 gv(rc2);
947 vswap();
948 gv(rc1);
949 vswap();
950 /* test if reload is needed for first register */
951 if ((vtop[0].r & VT_VALMASK) >= VT_CONST) {
952 gv(rc2);
957 #ifndef TCC_TARGET_ARM64
958 /* wrapper around RC_FRET to return a register by type */
959 static int rc_fret(int t)
961 #ifdef TCC_TARGET_X86_64
962 if (t == VT_LDOUBLE) {
963 return RC_ST0;
965 #endif
966 return RC_FRET;
968 #endif
970 /* wrapper around REG_FRET to return a register by type */
971 static int reg_fret(int t)
973 #ifdef TCC_TARGET_X86_64
974 if (t == VT_LDOUBLE) {
975 return TREG_ST0;
977 #endif
978 return REG_FRET;
981 /* expand long long on stack in two int registers */
982 static void lexpand(void)
984 int u;
986 u = vtop->type.t & (VT_DEFSIGN | VT_UNSIGNED);
987 gv(RC_INT);
988 vdup();
989 vtop[0].r = vtop[-1].r2;
990 vtop[0].r2 = VT_CONST;
991 vtop[-1].r2 = VT_CONST;
992 vtop[0].type.t = VT_INT | u;
993 vtop[-1].type.t = VT_INT | u;
996 #ifdef TCC_TARGET_ARM
997 /* expand long long on stack */
998 ST_FUNC void lexpand_nr(void)
1000 int u,v;
1002 u = vtop->type.t & (VT_DEFSIGN | VT_UNSIGNED);
1003 vdup();
1004 vtop->r2 = VT_CONST;
1005 vtop->type.t = VT_INT | u;
1006 v=vtop[-1].r & (VT_VALMASK | VT_LVAL);
1007 if (v == VT_CONST) {
1008 vtop[-1].c.ui = vtop->c.ull;
1009 vtop->c.ui = vtop->c.ull >> 32;
1010 vtop->r = VT_CONST;
1011 } else if (v == (VT_LVAL|VT_CONST) || v == (VT_LVAL|VT_LOCAL)) {
1012 vtop->c.ui += 4;
1013 vtop->r = vtop[-1].r;
1014 } else if (v > VT_CONST) {
1015 vtop--;
1016 lexpand();
1017 } else
1018 vtop->r = vtop[-1].r2;
1019 vtop[-1].r2 = VT_CONST;
1020 vtop[-1].type.t = VT_INT | u;
1022 #endif
1024 /* build a long long from two ints */
1025 static void lbuild(int t)
1027 gv2(RC_INT, RC_INT);
1028 vtop[-1].r2 = vtop[0].r;
1029 vtop[-1].type.t = t;
1030 vpop();
1033 /* rotate n first stack elements to the bottom
1034 I1 ... In -> I2 ... In I1 [top is right]
1036 ST_FUNC void vrotb(int n)
1038 int i;
1039 SValue tmp;
1041 tmp = vtop[-n + 1];
1042 for(i=-n+1;i!=0;i++)
1043 vtop[i] = vtop[i+1];
1044 vtop[0] = tmp;
1047 /* rotate the n elements before entry e towards the top
1048 I1 ... In ... -> In I1 ... I(n-1) ... [top is right]
1050 ST_FUNC void vrote(SValue *e, int n)
1052 int i;
1053 SValue tmp;
1055 tmp = *e;
1056 for(i = 0;i < n - 1; i++)
1057 e[-i] = e[-i - 1];
1058 e[-n + 1] = tmp;
1061 /* rotate n first stack elements to the top
1062 I1 ... In -> In I1 ... I(n-1) [top is right]
1064 ST_FUNC void vrott(int n)
1066 vrote(vtop, n);
1069 /* pop stack value */
1070 ST_FUNC void vpop(void)
1072 int v;
1073 v = vtop->r & VT_VALMASK;
1074 #if defined(TCC_TARGET_I386) || defined(TCC_TARGET_X86_64)
1075 /* for x86, we need to pop the FP stack */
1076 if (v == TREG_ST0 && !nocode_wanted) {
1077 o(0xd8dd); /* fstp %st(0) */
1078 } else
1079 #endif
1080 if (v == VT_JMP || v == VT_JMPI) {
1081 /* need to put correct jump if && or || without test */
1082 gsym(vtop->c.ul);
1084 vtop--;
1087 /* convert stack entry to register and duplicate its value in another
1088 register */
1089 static void gv_dup(void)
1091 int rc, t, r, r1;
1092 SValue sv;
1094 t = vtop->type.t;
1095 if ((t & VT_BTYPE) == VT_LLONG) {
1096 lexpand();
1097 gv_dup();
1098 vswap();
1099 vrotb(3);
1100 gv_dup();
1101 vrotb(4);
1102 /* stack: H L L1 H1 */
1103 lbuild(t);
1104 vrotb(3);
1105 vrotb(3);
1106 vswap();
1107 lbuild(t);
1108 vswap();
1109 } else {
1110 /* duplicate value */
1111 rc = RC_INT;
1112 sv.type.t = VT_INT;
1113 if (is_float(t)) {
1114 rc = RC_FLOAT;
1115 #ifdef TCC_TARGET_X86_64
1116 if ((t & VT_BTYPE) == VT_LDOUBLE) {
1117 rc = RC_ST0;
1119 #endif
1120 sv.type.t = t;
1122 r = gv(rc);
1123 r1 = get_reg(rc);
1124 sv.r = r;
1125 sv.c.ul = 0;
1126 load(r1, &sv); /* move r to r1 */
1127 vdup();
1128 /* duplicates value */
1129 if (r != r1)
1130 vtop->r = r1;
1134 /* Generate value test
1136 * Generate a test for any value (jump, comparison and integers) */
1137 ST_FUNC int gvtst(int inv, int t)
1139 int v = vtop->r & VT_VALMASK;
1140 if (v != VT_CMP && v != VT_JMP && v != VT_JMPI) {
1141 vpushi(0);
1142 gen_op(TOK_NE);
1144 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
1145 /* constant jmp optimization */
1146 if ((vtop->c.i != 0) != inv)
1147 t = gjmp(t);
1148 vtop--;
1149 return t;
1151 return gtst(inv, t);
1154 #if !defined(TCC_TARGET_ARM64) && !defined(TCC_TARGET_X86_64)
1155 /* generate CPU independent (unsigned) long long operations */
1156 static void gen_opl(int op)
1158 int t, a, b, op1, c, i;
1159 int func;
1160 unsigned short reg_iret = REG_IRET;
1161 unsigned short reg_lret = REG_LRET;
1162 SValue tmp;
1164 switch(op) {
1165 case '/':
1166 case TOK_PDIV:
1167 func = TOK___divdi3;
1168 goto gen_func;
1169 case TOK_UDIV:
1170 func = TOK___udivdi3;
1171 goto gen_func;
1172 case '%':
1173 func = TOK___moddi3;
1174 goto gen_mod_func;
1175 case TOK_UMOD:
1176 func = TOK___umoddi3;
1177 gen_mod_func:
1178 #ifdef TCC_ARM_EABI
1179 reg_iret = TREG_R2;
1180 reg_lret = TREG_R3;
1181 #endif
1182 gen_func:
1183 /* call generic long long function */
1184 vpush_global_sym(&func_old_type, func);
1185 vrott(3);
1186 gfunc_call(2);
1187 vpushi(0);
1188 vtop->r = reg_iret;
1189 vtop->r2 = reg_lret;
1190 break;
1191 case '^':
1192 case '&':
1193 case '|':
1194 case '*':
1195 case '+':
1196 case '-':
1197 t = vtop->type.t;
1198 vswap();
1199 lexpand();
1200 vrotb(3);
1201 lexpand();
1202 /* stack: L1 H1 L2 H2 */
1203 tmp = vtop[0];
1204 vtop[0] = vtop[-3];
1205 vtop[-3] = tmp;
1206 tmp = vtop[-2];
1207 vtop[-2] = vtop[-3];
1208 vtop[-3] = tmp;
1209 vswap();
1210 /* stack: H1 H2 L1 L2 */
1211 if (op == '*') {
1212 vpushv(vtop - 1);
1213 vpushv(vtop - 1);
1214 gen_op(TOK_UMULL);
1215 lexpand();
1216 /* stack: H1 H2 L1 L2 ML MH */
1217 for(i=0;i<4;i++)
1218 vrotb(6);
1219 /* stack: ML MH H1 H2 L1 L2 */
1220 tmp = vtop[0];
1221 vtop[0] = vtop[-2];
1222 vtop[-2] = tmp;
1223 /* stack: ML MH H1 L2 H2 L1 */
1224 gen_op('*');
1225 vrotb(3);
1226 vrotb(3);
1227 gen_op('*');
1228 /* stack: ML MH M1 M2 */
1229 gen_op('+');
1230 gen_op('+');
1231 } else if (op == '+' || op == '-') {
1232 /* XXX: add non carry method too (for MIPS or alpha) */
1233 if (op == '+')
1234 op1 = TOK_ADDC1;
1235 else
1236 op1 = TOK_SUBC1;
1237 gen_op(op1);
1238 /* stack: H1 H2 (L1 op L2) */
1239 vrotb(3);
1240 vrotb(3);
1241 gen_op(op1 + 1); /* TOK_xxxC2 */
1242 } else {
1243 gen_op(op);
1244 /* stack: H1 H2 (L1 op L2) */
1245 vrotb(3);
1246 vrotb(3);
1247 /* stack: (L1 op L2) H1 H2 */
1248 gen_op(op);
1249 /* stack: (L1 op L2) (H1 op H2) */
1251 /* stack: L H */
1252 lbuild(t);
1253 break;
1254 case TOK_SAR:
1255 case TOK_SHR:
1256 case TOK_SHL:
1257 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
1258 t = vtop[-1].type.t;
1259 vswap();
1260 lexpand();
1261 vrotb(3);
1262 /* stack: L H shift */
1263 c = (int)vtop->c.i;
1264 /* constant: simpler */
1265 /* NOTE: all comments are for SHL. the other cases are
1266 done by swaping words */
1267 vpop();
1268 if (op != TOK_SHL)
1269 vswap();
1270 if (c >= 32) {
1271 /* stack: L H */
1272 vpop();
1273 if (c > 32) {
1274 vpushi(c - 32);
1275 gen_op(op);
1277 if (op != TOK_SAR) {
1278 vpushi(0);
1279 } else {
1280 gv_dup();
1281 vpushi(31);
1282 gen_op(TOK_SAR);
1284 vswap();
1285 } else {
1286 vswap();
1287 gv_dup();
1288 /* stack: H L L */
1289 vpushi(c);
1290 gen_op(op);
1291 vswap();
1292 vpushi(32 - c);
1293 if (op == TOK_SHL)
1294 gen_op(TOK_SHR);
1295 else
1296 gen_op(TOK_SHL);
1297 vrotb(3);
1298 /* stack: L L H */
1299 vpushi(c);
1300 if (op == TOK_SHL)
1301 gen_op(TOK_SHL);
1302 else
1303 gen_op(TOK_SHR);
1304 gen_op('|');
1306 if (op != TOK_SHL)
1307 vswap();
1308 lbuild(t);
1309 } else {
1310 /* XXX: should provide a faster fallback on x86 ? */
1311 switch(op) {
1312 case TOK_SAR:
1313 func = TOK___ashrdi3;
1314 goto gen_func;
1315 case TOK_SHR:
1316 func = TOK___lshrdi3;
1317 goto gen_func;
1318 case TOK_SHL:
1319 func = TOK___ashldi3;
1320 goto gen_func;
1323 break;
1324 default:
1325 /* compare operations */
1326 t = vtop->type.t;
1327 vswap();
1328 lexpand();
1329 vrotb(3);
1330 lexpand();
1331 /* stack: L1 H1 L2 H2 */
1332 tmp = vtop[-1];
1333 vtop[-1] = vtop[-2];
1334 vtop[-2] = tmp;
1335 /* stack: L1 L2 H1 H2 */
1336 /* compare high */
1337 op1 = op;
1338 /* when values are equal, we need to compare low words. since
1339 the jump is inverted, we invert the test too. */
1340 if (op1 == TOK_LT)
1341 op1 = TOK_LE;
1342 else if (op1 == TOK_GT)
1343 op1 = TOK_GE;
1344 else if (op1 == TOK_ULT)
1345 op1 = TOK_ULE;
1346 else if (op1 == TOK_UGT)
1347 op1 = TOK_UGE;
1348 a = 0;
1349 b = 0;
1350 gen_op(op1);
1351 if (op1 != TOK_NE) {
1352 a = gvtst(1, 0);
1354 if (op != TOK_EQ) {
1355 /* generate non equal test */
1356 /* XXX: NOT PORTABLE yet */
1357 if (a == 0) {
1358 b = gvtst(0, 0);
1359 } else {
1360 #if defined(TCC_TARGET_I386)
1361 b = psym(0x850f, 0);
1362 #elif defined(TCC_TARGET_ARM)
1363 b = ind;
1364 o(0x1A000000 | encbranch(ind, 0, 1));
1365 #elif defined(TCC_TARGET_C67) || defined(TCC_TARGET_ARM64)
1366 tcc_error("not implemented");
1367 #else
1368 #error not supported
1369 #endif
1372 /* compare low. Always unsigned */
1373 op1 = op;
1374 if (op1 == TOK_LT)
1375 op1 = TOK_ULT;
1376 else if (op1 == TOK_LE)
1377 op1 = TOK_ULE;
1378 else if (op1 == TOK_GT)
1379 op1 = TOK_UGT;
1380 else if (op1 == TOK_GE)
1381 op1 = TOK_UGE;
1382 gen_op(op1);
1383 a = gvtst(1, a);
1384 gsym(b);
1385 vseti(VT_JMPI, a);
1386 break;
1389 #endif
1391 /* handle integer constant optimizations and various machine
1392 independent opt */
1393 static void gen_opic(int op)
1395 int c1, c2, t1, t2, n;
1396 SValue *v1, *v2;
1397 long long l1, l2;
1398 typedef unsigned long long U;
1400 v1 = vtop - 1;
1401 v2 = vtop;
1402 t1 = v1->type.t & VT_BTYPE;
1403 t2 = v2->type.t & VT_BTYPE;
1405 if (t1 == VT_LLONG)
1406 l1 = v1->c.ll;
1407 else if (v1->type.t & VT_UNSIGNED)
1408 l1 = v1->c.ui;
1409 else
1410 l1 = v1->c.i;
1412 if (t2 == VT_LLONG)
1413 l2 = v2->c.ll;
1414 else if (v2->type.t & VT_UNSIGNED)
1415 l2 = v2->c.ui;
1416 else
1417 l2 = v2->c.i;
1419 /* currently, we cannot do computations with forward symbols */
1420 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
1421 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
1422 if (c1 && c2) {
1423 switch(op) {
1424 case '+': l1 += l2; break;
1425 case '-': l1 -= l2; break;
1426 case '&': l1 &= l2; break;
1427 case '^': l1 ^= l2; break;
1428 case '|': l1 |= l2; break;
1429 case '*': l1 *= l2; break;
1431 case TOK_PDIV:
1432 case '/':
1433 case '%':
1434 case TOK_UDIV:
1435 case TOK_UMOD:
1436 /* if division by zero, generate explicit division */
1437 if (l2 == 0) {
1438 if (const_wanted)
1439 tcc_error("division by zero in constant");
1440 goto general_case;
1442 switch(op) {
1443 default: l1 /= l2; break;
1444 case '%': l1 %= l2; break;
1445 case TOK_UDIV: l1 = (U)l1 / l2; break;
1446 case TOK_UMOD: l1 = (U)l1 % l2; break;
1448 break;
1449 case TOK_SHL: l1 <<= l2; break;
1450 case TOK_SHR: l1 = (U)l1 >> l2; break;
1451 case TOK_SAR: l1 >>= l2; break;
1452 /* tests */
1453 case TOK_ULT: l1 = (U)l1 < (U)l2; break;
1454 case TOK_UGE: l1 = (U)l1 >= (U)l2; break;
1455 case TOK_EQ: l1 = l1 == l2; break;
1456 case TOK_NE: l1 = l1 != l2; break;
1457 case TOK_ULE: l1 = (U)l1 <= (U)l2; break;
1458 case TOK_UGT: l1 = (U)l1 > (U)l2; break;
1459 case TOK_LT: l1 = l1 < l2; break;
1460 case TOK_GE: l1 = l1 >= l2; break;
1461 case TOK_LE: l1 = l1 <= l2; break;
1462 case TOK_GT: l1 = l1 > l2; break;
1463 /* logical */
1464 case TOK_LAND: l1 = l1 && l2; break;
1465 case TOK_LOR: l1 = l1 || l2; break;
1466 default:
1467 goto general_case;
1469 v1->c.ll = l1;
1470 vtop--;
1471 } else {
1472 /* if commutative ops, put c2 as constant */
1473 if (c1 && (op == '+' || op == '&' || op == '^' ||
1474 op == '|' || op == '*')) {
1475 vswap();
1476 c2 = c1; //c = c1, c1 = c2, c2 = c;
1477 l2 = l1; //l = l1, l1 = l2, l2 = l;
1479 /* Filter out NOP operations like x*1, x-0, x&-1... */
1480 if (c2 && (((op == '*' || op == '/' || op == TOK_UDIV ||
1481 op == TOK_PDIV) &&
1482 l2 == 1) ||
1483 ((op == '+' || op == '-' || op == '|' || op == '^' ||
1484 op == TOK_SHL || op == TOK_SHR || op == TOK_SAR) &&
1485 l2 == 0) ||
1486 (op == '&' &&
1487 l2 == -1))) {
1488 /* nothing to do */
1489 vtop--;
1490 } else if (c2 && (op == '*' || op == TOK_PDIV || op == TOK_UDIV)) {
1491 /* try to use shifts instead of muls or divs */
1492 if (l2 > 0 && (l2 & (l2 - 1)) == 0) {
1493 n = -1;
1494 while (l2) {
1495 l2 >>= 1;
1496 n++;
1498 vtop->c.ll = n;
1499 if (op == '*')
1500 op = TOK_SHL;
1501 else if (op == TOK_PDIV)
1502 op = TOK_SAR;
1503 else
1504 op = TOK_SHR;
1506 goto general_case;
1507 } else if (c2 && (op == '+' || op == '-') &&
1508 (((vtop[-1].r & (VT_VALMASK | VT_LVAL | VT_SYM)) == (VT_CONST | VT_SYM))
1509 || (vtop[-1].r & (VT_VALMASK | VT_LVAL)) == VT_LOCAL)) {
1510 /* symbol + constant case */
1511 if (op == '-')
1512 l2 = -l2;
1513 vtop--;
1514 vtop->c.ll += l2;
1515 } else {
1516 general_case:
1517 if (!nocode_wanted) {
1518 /* call low level op generator */
1519 if (t1 == VT_LLONG || t2 == VT_LLONG ||
1520 (PTR_SIZE == 8 && (t1 == VT_PTR || t2 == VT_PTR)))
1521 gen_opl(op);
1522 else
1523 gen_opi(op);
1524 } else {
1525 vtop--;
1531 /* generate a floating point operation with constant propagation */
1532 static void gen_opif(int op)
1534 int c1, c2;
1535 SValue *v1, *v2;
1536 long double f1, f2;
1538 v1 = vtop - 1;
1539 v2 = vtop;
1540 /* currently, we cannot do computations with forward symbols */
1541 c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
1542 c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
1543 if (c1 && c2) {
1544 if (v1->type.t == VT_FLOAT) {
1545 f1 = v1->c.f;
1546 f2 = v2->c.f;
1547 } else if (v1->type.t == VT_DOUBLE) {
1548 f1 = v1->c.d;
1549 f2 = v2->c.d;
1550 } else {
1551 f1 = v1->c.ld;
1552 f2 = v2->c.ld;
1555 /* NOTE: we only do constant propagation if finite number (not
1556 NaN or infinity) (ANSI spec) */
1557 if (!ieee_finite(f1) || !ieee_finite(f2))
1558 goto general_case;
1560 switch(op) {
1561 case '+': f1 += f2; break;
1562 case '-': f1 -= f2; break;
1563 case '*': f1 *= f2; break;
1564 case '/':
1565 if (f2 == 0.0) {
1566 if (const_wanted)
1567 tcc_error("division by zero in constant");
1568 goto general_case;
1570 f1 /= f2;
1571 break;
1572 /* XXX: also handles tests ? */
1573 default:
1574 goto general_case;
1576 /* XXX: overflow test ? */
1577 if (v1->type.t == VT_FLOAT) {
1578 v1->c.f = f1;
1579 } else if (v1->type.t == VT_DOUBLE) {
1580 v1->c.d = f1;
1581 } else {
1582 v1->c.ld = f1;
1584 vtop--;
1585 } else {
1586 general_case:
1587 if (!nocode_wanted) {
1588 gen_opf(op);
1589 } else {
1590 vtop--;
1595 static int pointed_size(CType *type)
1597 int align;
1598 return type_size(pointed_type(type), &align);
1601 static void vla_runtime_pointed_size(CType *type)
1603 int align;
1604 vla_runtime_type_size(pointed_type(type), &align);
1607 static inline int is_null_pointer(SValue *p)
1609 if ((p->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
1610 return 0;
1611 return ((p->type.t & VT_BTYPE) == VT_INT && p->c.i == 0) ||
1612 ((p->type.t & VT_BTYPE) == VT_LLONG && p->c.ll == 0) ||
1613 ((p->type.t & VT_BTYPE) == VT_PTR && p->c.ptr_offset == 0);
1616 static inline int is_integer_btype(int bt)
1618 return (bt == VT_BYTE || bt == VT_SHORT ||
1619 bt == VT_INT || bt == VT_LLONG);
1622 /* check types for comparison or subtraction of pointers */
1623 static void check_comparison_pointer_types(SValue *p1, SValue *p2, int op)
1625 CType *type1, *type2, tmp_type1, tmp_type2;
1626 int bt1, bt2;
1628 /* null pointers are accepted for all comparisons as gcc */
1629 if (is_null_pointer(p1) || is_null_pointer(p2))
1630 return;
1631 type1 = &p1->type;
1632 type2 = &p2->type;
1633 bt1 = type1->t & VT_BTYPE;
1634 bt2 = type2->t & VT_BTYPE;
1635 /* accept comparison between pointer and integer with a warning */
1636 if ((is_integer_btype(bt1) || is_integer_btype(bt2)) && op != '-') {
1637 if (op != TOK_LOR && op != TOK_LAND )
1638 tcc_warning("comparison between pointer and integer");
1639 return;
1642 /* both must be pointers or implicit function pointers */
1643 if (bt1 == VT_PTR) {
1644 type1 = pointed_type(type1);
1645 } else if (bt1 != VT_FUNC)
1646 goto invalid_operands;
1648 if (bt2 == VT_PTR) {
1649 type2 = pointed_type(type2);
1650 } else if (bt2 != VT_FUNC) {
1651 invalid_operands:
1652 tcc_error("invalid operands to binary %s", get_tok_str(op, NULL));
1654 if ((type1->t & VT_BTYPE) == VT_VOID ||
1655 (type2->t & VT_BTYPE) == VT_VOID)
1656 return;
1657 tmp_type1 = *type1;
1658 tmp_type2 = *type2;
1659 tmp_type1.t &= ~(VT_DEFSIGN | VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
1660 tmp_type2.t &= ~(VT_DEFSIGN | VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE);
1661 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
1662 /* gcc-like error if '-' is used */
1663 if (op == '-')
1664 goto invalid_operands;
1665 else
1666 tcc_warning("comparison of distinct pointer types lacks a cast");
1670 /* generic gen_op: handles types problems */
1671 ST_FUNC void gen_op(int op)
1673 int u, t1, t2, bt1, bt2, t;
1674 CType type1;
1676 t1 = vtop[-1].type.t;
1677 t2 = vtop[0].type.t;
1678 bt1 = t1 & VT_BTYPE;
1679 bt2 = t2 & VT_BTYPE;
1681 if (bt1 == VT_PTR || bt2 == VT_PTR) {
1682 /* at least one operand is a pointer */
1683 /* relationnal op: must be both pointers */
1684 if (op >= TOK_ULT && op <= TOK_LOR) {
1685 check_comparison_pointer_types(vtop - 1, vtop, op);
1686 /* pointers are handled are unsigned */
1687 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
1688 t = VT_LLONG | VT_UNSIGNED;
1689 #else
1690 t = VT_INT | VT_UNSIGNED;
1691 #endif
1692 goto std_op;
1694 /* if both pointers, then it must be the '-' op */
1695 if (bt1 == VT_PTR && bt2 == VT_PTR) {
1696 if (op != '-')
1697 tcc_error("cannot use pointers here");
1698 check_comparison_pointer_types(vtop - 1, vtop, op);
1699 /* XXX: check that types are compatible */
1700 if (vtop[-1].type.t & VT_VLA) {
1701 vla_runtime_pointed_size(&vtop[-1].type);
1702 } else {
1703 vpushi(pointed_size(&vtop[-1].type));
1705 vrott(3);
1706 gen_opic(op);
1707 /* set to integer type */
1708 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
1709 vtop->type.t = VT_LLONG;
1710 #else
1711 vtop->type.t = VT_INT;
1712 #endif
1713 vswap();
1714 gen_op(TOK_PDIV);
1715 } else {
1716 /* exactly one pointer : must be '+' or '-'. */
1717 if (op != '-' && op != '+')
1718 tcc_error("cannot use pointers here");
1719 /* Put pointer as first operand */
1720 if (bt2 == VT_PTR) {
1721 vswap();
1722 swap(&t1, &t2);
1724 type1 = vtop[-1].type;
1725 type1.t &= ~VT_ARRAY;
1726 if (vtop[-1].type.t & VT_VLA)
1727 vla_runtime_pointed_size(&vtop[-1].type);
1728 else {
1729 u = pointed_size(&vtop[-1].type);
1730 if (u < 0)
1731 tcc_error("unknown array element size");
1732 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
1733 vpushll(u);
1734 #else
1735 /* XXX: cast to int ? (long long case) */
1736 vpushi(u);
1737 #endif
1739 gen_op('*');
1740 #ifdef CONFIG_TCC_BCHECK
1741 /* if evaluating constant expression, no code should be
1742 generated, so no bound check */
1743 if (tcc_state->do_bounds_check && !const_wanted) {
1744 /* if bounded pointers, we generate a special code to
1745 test bounds */
1746 if (op == '-') {
1747 vpushi(0);
1748 vswap();
1749 gen_op('-');
1751 gen_bounded_ptr_add();
1752 } else
1753 #endif
1755 gen_opic(op);
1757 /* put again type if gen_opic() swaped operands */
1758 vtop->type = type1;
1760 } else if (is_float(bt1) || is_float(bt2)) {
1761 /* compute bigger type and do implicit casts */
1762 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
1763 t = VT_LDOUBLE;
1764 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
1765 t = VT_DOUBLE;
1766 } else {
1767 t = VT_FLOAT;
1769 /* floats can only be used for a few operations */
1770 if (op != '+' && op != '-' && op != '*' && op != '/' &&
1771 (op < TOK_ULT || op > TOK_GT))
1772 tcc_error("invalid operands for binary operation");
1773 goto std_op;
1774 } else if (op == TOK_SHR || op == TOK_SAR || op == TOK_SHL) {
1775 t = bt1 == VT_LLONG ? VT_LLONG : VT_INT;
1776 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (t | VT_UNSIGNED))
1777 t |= VT_UNSIGNED;
1778 goto std_op;
1779 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
1780 /* cast to biggest op */
1781 t = VT_LLONG;
1782 /* convert to unsigned if it does not fit in a long long */
1783 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
1784 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
1785 t |= VT_UNSIGNED;
1786 goto std_op;
1787 } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) {
1788 tcc_error("comparison of struct");
1789 } else {
1790 /* integer operations */
1791 t = VT_INT;
1792 /* convert to unsigned if it does not fit in an integer */
1793 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
1794 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
1795 t |= VT_UNSIGNED;
1796 std_op:
1797 /* XXX: currently, some unsigned operations are explicit, so
1798 we modify them here */
1799 if (t & VT_UNSIGNED) {
1800 if (op == TOK_SAR)
1801 op = TOK_SHR;
1802 else if (op == '/')
1803 op = TOK_UDIV;
1804 else if (op == '%')
1805 op = TOK_UMOD;
1806 else if (op == TOK_LT)
1807 op = TOK_ULT;
1808 else if (op == TOK_GT)
1809 op = TOK_UGT;
1810 else if (op == TOK_LE)
1811 op = TOK_ULE;
1812 else if (op == TOK_GE)
1813 op = TOK_UGE;
1815 vswap();
1816 type1.t = t;
1817 gen_cast(&type1);
1818 vswap();
1819 /* special case for shifts and long long: we keep the shift as
1820 an integer */
1821 if (op == TOK_SHR || op == TOK_SAR || op == TOK_SHL)
1822 type1.t = VT_INT;
1823 gen_cast(&type1);
1824 if (is_float(t))
1825 gen_opif(op);
1826 else
1827 gen_opic(op);
1828 if (op >= TOK_ULT && op <= TOK_GT) {
1829 /* relationnal op: the result is an int */
1830 vtop->type.t = VT_INT;
1831 } else {
1832 vtop->type.t = t;
1835 // Make sure that we have converted to an rvalue:
1836 if (vtop->r & VT_LVAL)
1837 gv(is_float(vtop->type.t & VT_BTYPE) ? RC_FLOAT : RC_INT);
1840 #ifndef TCC_TARGET_ARM
1841 /* generic itof for unsigned long long case */
1842 static void gen_cvt_itof1(int t)
1844 #ifdef TCC_TARGET_ARM64
1845 gen_cvt_itof(t);
1846 #else
1847 if ((vtop->type.t & (VT_BTYPE | VT_UNSIGNED)) ==
1848 (VT_LLONG | VT_UNSIGNED)) {
1850 if (t == VT_FLOAT)
1851 vpush_global_sym(&func_old_type, TOK___floatundisf);
1852 #if LDOUBLE_SIZE != 8
1853 else if (t == VT_LDOUBLE)
1854 vpush_global_sym(&func_old_type, TOK___floatundixf);
1855 #endif
1856 else
1857 vpush_global_sym(&func_old_type, TOK___floatundidf);
1858 vrott(2);
1859 gfunc_call(1);
1860 vpushi(0);
1861 vtop->r = reg_fret(t);
1862 } else {
1863 gen_cvt_itof(t);
1865 #endif
1867 #endif
1869 /* generic ftoi for unsigned long long case */
1870 static void gen_cvt_ftoi1(int t)
1872 #ifdef TCC_TARGET_ARM64
1873 gen_cvt_ftoi(t);
1874 #else
1875 int st;
1877 if (t == (VT_LLONG | VT_UNSIGNED)) {
1878 /* not handled natively */
1879 st = vtop->type.t & VT_BTYPE;
1880 if (st == VT_FLOAT)
1881 vpush_global_sym(&func_old_type, TOK___fixunssfdi);
1882 #if LDOUBLE_SIZE != 8
1883 else if (st == VT_LDOUBLE)
1884 vpush_global_sym(&func_old_type, TOK___fixunsxfdi);
1885 #endif
1886 else
1887 vpush_global_sym(&func_old_type, TOK___fixunsdfdi);
1888 vrott(2);
1889 gfunc_call(1);
1890 vpushi(0);
1891 vtop->r = REG_IRET;
1892 vtop->r2 = REG_LRET;
1893 } else {
1894 gen_cvt_ftoi(t);
1896 #endif
1899 /* force char or short cast */
1900 static void force_charshort_cast(int t)
1902 int bits, dbt;
1903 dbt = t & VT_BTYPE;
1904 /* XXX: add optimization if lvalue : just change type and offset */
1905 if (dbt == VT_BYTE)
1906 bits = 8;
1907 else
1908 bits = 16;
1909 if (t & VT_UNSIGNED) {
1910 vpushi((1 << bits) - 1);
1911 gen_op('&');
1912 } else {
1913 bits = 32 - bits;
1914 vpushi(bits);
1915 gen_op(TOK_SHL);
1916 /* result must be signed or the SAR is converted to an SHL
1917 This was not the case when "t" was a signed short
1918 and the last value on the stack was an unsigned int */
1919 vtop->type.t &= ~VT_UNSIGNED;
1920 vpushi(bits);
1921 gen_op(TOK_SAR);
1925 /* cast 'vtop' to 'type'. Casting to bitfields is forbidden. */
1926 static void gen_cast(CType *type)
1928 int sbt, dbt, sf, df, c, p;
1930 /* special delayed cast for char/short */
1931 /* XXX: in some cases (multiple cascaded casts), it may still
1932 be incorrect */
1933 if (vtop->r & VT_MUSTCAST) {
1934 vtop->r &= ~VT_MUSTCAST;
1935 force_charshort_cast(vtop->type.t);
1938 /* bitfields first get cast to ints */
1939 if (vtop->type.t & VT_BITFIELD) {
1940 gv(RC_INT);
1943 dbt = type->t & (VT_BTYPE | VT_UNSIGNED);
1944 sbt = vtop->type.t & (VT_BTYPE | VT_UNSIGNED);
1946 if (sbt != dbt) {
1947 sf = is_float(sbt);
1948 df = is_float(dbt);
1949 c = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
1950 p = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == (VT_CONST | VT_SYM);
1951 if (c) {
1952 /* constant case: we can do it now */
1953 /* XXX: in ISOC, cannot do it if error in convert */
1954 if (sbt == VT_FLOAT)
1955 vtop->c.ld = vtop->c.f;
1956 else if (sbt == VT_DOUBLE)
1957 vtop->c.ld = vtop->c.d;
1959 if (df) {
1960 if ((sbt & VT_BTYPE) == VT_LLONG) {
1961 if (sbt & VT_UNSIGNED)
1962 vtop->c.ld = vtop->c.ull;
1963 else
1964 vtop->c.ld = vtop->c.ll;
1965 } else if(!sf) {
1966 if (sbt & VT_UNSIGNED)
1967 vtop->c.ld = vtop->c.ui;
1968 else
1969 vtop->c.ld = vtop->c.i;
1972 if (dbt == VT_FLOAT)
1973 vtop->c.f = (float)vtop->c.ld;
1974 else if (dbt == VT_DOUBLE)
1975 vtop->c.d = (double)vtop->c.ld;
1976 } else if (sf && dbt == (VT_LLONG|VT_UNSIGNED)) {
1977 vtop->c.ull = (unsigned long long)vtop->c.ld;
1978 } else if (sf && dbt == VT_BOOL) {
1979 vtop->c.i = (vtop->c.ld != 0);
1980 } else {
1981 if(sf)
1982 vtop->c.ll = (long long)vtop->c.ld;
1983 else if (sbt == (VT_LLONG|VT_UNSIGNED))
1984 vtop->c.ll = vtop->c.ull;
1985 else if (sbt & VT_UNSIGNED)
1986 vtop->c.ll = vtop->c.ui;
1987 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
1988 else if (sbt == VT_PTR)
1990 #endif
1991 else if (sbt != VT_LLONG)
1992 vtop->c.ll = vtop->c.i;
1994 if (dbt == (VT_LLONG|VT_UNSIGNED))
1995 vtop->c.ull = vtop->c.ll;
1996 else if (dbt == VT_BOOL)
1997 vtop->c.i = (vtop->c.ll != 0);
1998 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
1999 else if (dbt == VT_PTR)
2001 #endif
2002 else if (dbt != VT_LLONG) {
2003 int s = 0;
2004 if ((dbt & VT_BTYPE) == VT_BYTE)
2005 s = 24;
2006 else if ((dbt & VT_BTYPE) == VT_SHORT)
2007 s = 16;
2008 if(dbt & VT_UNSIGNED)
2009 vtop->c.ui = ((unsigned int)vtop->c.ll << s) >> s;
2010 else
2011 vtop->c.i = ((int)vtop->c.ll << s) >> s;
2014 } else if (p && dbt == VT_BOOL) {
2015 vtop->r = VT_CONST;
2016 vtop->c.i = 1;
2017 } else if (!nocode_wanted) {
2018 /* non constant case: generate code */
2019 if (sf && df) {
2020 /* convert from fp to fp */
2021 gen_cvt_ftof(dbt);
2022 } else if (df) {
2023 /* convert int to fp */
2024 gen_cvt_itof1(dbt);
2025 } else if (sf) {
2026 /* convert fp to int */
2027 if (dbt == VT_BOOL) {
2028 vpushi(0);
2029 gen_op(TOK_NE);
2030 } else {
2031 /* we handle char/short/etc... with generic code */
2032 if (dbt != (VT_INT | VT_UNSIGNED) &&
2033 dbt != (VT_LLONG | VT_UNSIGNED) &&
2034 dbt != VT_LLONG)
2035 dbt = VT_INT;
2036 gen_cvt_ftoi1(dbt);
2037 if (dbt == VT_INT && (type->t & (VT_BTYPE | VT_UNSIGNED)) != dbt) {
2038 /* additional cast for char/short... */
2039 vtop->type.t = dbt;
2040 gen_cast(type);
2043 #if !defined(TCC_TARGET_ARM64) && !defined(TCC_TARGET_X86_64)
2044 } else if ((dbt & VT_BTYPE) == VT_LLONG) {
2045 if ((sbt & VT_BTYPE) != VT_LLONG) {
2046 /* scalar to long long */
2047 /* machine independent conversion */
2048 gv(RC_INT);
2049 /* generate high word */
2050 if (sbt == (VT_INT | VT_UNSIGNED)) {
2051 vpushi(0);
2052 gv(RC_INT);
2053 } else {
2054 if (sbt == VT_PTR) {
2055 /* cast from pointer to int before we apply
2056 shift operation, which pointers don't support*/
2057 gen_cast(&int_type);
2059 gv_dup();
2060 vpushi(31);
2061 gen_op(TOK_SAR);
2063 /* patch second register */
2064 vtop[-1].r2 = vtop->r;
2065 vpop();
2067 #else
2068 } else if ((dbt & VT_BTYPE) == VT_LLONG ||
2069 (dbt & VT_BTYPE) == VT_PTR ||
2070 (dbt & VT_BTYPE) == VT_FUNC) {
2071 if ((sbt & VT_BTYPE) != VT_LLONG &&
2072 (sbt & VT_BTYPE) != VT_PTR &&
2073 (sbt & VT_BTYPE) != VT_FUNC) {
2074 /* need to convert from 32bit to 64bit */
2075 gv(RC_INT);
2076 if (sbt != (VT_INT | VT_UNSIGNED)) {
2077 #if defined(TCC_TARGET_ARM64)
2078 gen_cvt_sxtw();
2079 #elif defined(TCC_TARGET_X86_64)
2080 int r = gv(RC_INT);
2081 /* x86_64 specific: movslq */
2082 o(0x6348);
2083 o(0xc0 + (REG_VALUE(r) << 3) + REG_VALUE(r));
2084 #else
2085 #error
2086 #endif
2089 #endif
2090 } else if (dbt == VT_BOOL) {
2091 /* scalar to bool */
2092 vpushi(0);
2093 gen_op(TOK_NE);
2094 } else if ((dbt & VT_BTYPE) == VT_BYTE ||
2095 (dbt & VT_BTYPE) == VT_SHORT) {
2096 if (sbt == VT_PTR) {
2097 vtop->type.t = VT_INT;
2098 tcc_warning("nonportable conversion from pointer to char/short");
2100 force_charshort_cast(dbt);
2101 } else if ((dbt & VT_BTYPE) == VT_INT) {
2102 /* scalar to int */
2103 if (sbt == VT_LLONG) {
2104 /* from long long: just take low order word */
2105 lexpand();
2106 vpop();
2108 /* if lvalue and single word type, nothing to do because
2109 the lvalue already contains the real type size (see
2110 VT_LVAL_xxx constants) */
2113 } else if ((dbt & VT_BTYPE) == VT_PTR && !(vtop->r & VT_LVAL)) {
2114 /* if we are casting between pointer types,
2115 we must update the VT_LVAL_xxx size */
2116 vtop->r = (vtop->r & ~VT_LVAL_TYPE)
2117 | (lvalue_type(type->ref->type.t) & VT_LVAL_TYPE);
2119 vtop->type = *type;
2122 /* return type size as known at compile time. Put alignment at 'a' */
2123 ST_FUNC int type_size(CType *type, int *a)
2125 Sym *s;
2126 int bt;
2128 bt = type->t & VT_BTYPE;
2129 if (bt == VT_STRUCT) {
2130 /* struct/union */
2131 s = type->ref;
2132 *a = s->r;
2133 return s->c;
2134 } else if (bt == VT_PTR) {
2135 if (type->t & VT_ARRAY) {
2136 int ts;
2138 s = type->ref;
2139 ts = type_size(&s->type, a);
2141 if (ts < 0 && s->c < 0)
2142 ts = -ts;
2144 return ts * s->c;
2145 } else {
2146 *a = PTR_SIZE;
2147 return PTR_SIZE;
2149 } else if (bt == VT_LDOUBLE) {
2150 *a = LDOUBLE_ALIGN;
2151 return LDOUBLE_SIZE;
2152 } else if (bt == VT_DOUBLE || bt == VT_LLONG) {
2153 #ifdef TCC_TARGET_I386
2154 #ifdef TCC_TARGET_PE
2155 *a = 8;
2156 #else
2157 *a = 4;
2158 #endif
2159 #elif defined(TCC_TARGET_ARM)
2160 #ifdef TCC_ARM_EABI
2161 *a = 8;
2162 #else
2163 *a = 4;
2164 #endif
2165 #else
2166 *a = 8;
2167 #endif
2168 return 8;
2169 } else if (bt == VT_INT || bt == VT_ENUM || bt == VT_FLOAT) {
2170 *a = 4;
2171 return 4;
2172 } else if (bt == VT_SHORT) {
2173 *a = 2;
2174 return 2;
2175 } else if (bt == VT_QLONG || bt == VT_QFLOAT) {
2176 *a = 8;
2177 return 16;
2178 } else {
2179 /* char, void, function, _Bool */
2180 *a = 1;
2181 return 1;
2185 /* push type size as known at runtime time on top of value stack. Put
2186 alignment at 'a' */
2187 ST_FUNC void vla_runtime_type_size(CType *type, int *a)
2189 if (type->t & VT_VLA) {
2190 vset(&int_type, VT_LOCAL|VT_LVAL, type->ref->c);
2191 } else {
2192 vpushi(type_size(type, a));
2196 static void vla_sp_save(void) {
2197 if (!(vla_flags & VLA_SP_LOC_SET)) {
2198 *vla_sp_loc = (loc -= PTR_SIZE);
2199 vla_flags |= VLA_SP_LOC_SET;
2201 if (!(vla_flags & VLA_SP_SAVED)) {
2202 gen_vla_sp_save(*vla_sp_loc);
2203 vla_flags |= VLA_SP_SAVED;
2207 /* return the pointed type of t */
2208 static inline CType *pointed_type(CType *type)
2210 return &type->ref->type;
2213 /* modify type so that its it is a pointer to type. */
2214 ST_FUNC void mk_pointer(CType *type)
2216 Sym *s;
2217 s = sym_push(SYM_FIELD, type, 0, -1);
2218 type->t = VT_PTR | (type->t & ~VT_TYPE);
2219 type->ref = s;
2222 /* compare function types. OLD functions match any new functions */
2223 static int is_compatible_func(CType *type1, CType *type2)
2225 Sym *s1, *s2;
2227 s1 = type1->ref;
2228 s2 = type2->ref;
2229 if (!is_compatible_types(&s1->type, &s2->type))
2230 return 0;
2231 /* check func_call */
2232 if (s1->a.func_call != s2->a.func_call)
2233 return 0;
2234 /* XXX: not complete */
2235 if (s1->c == FUNC_OLD || s2->c == FUNC_OLD)
2236 return 1;
2237 if (s1->c != s2->c)
2238 return 0;
2239 while (s1 != NULL) {
2240 if (s2 == NULL)
2241 return 0;
2242 if (!is_compatible_parameter_types(&s1->type, &s2->type))
2243 return 0;
2244 s1 = s1->next;
2245 s2 = s2->next;
2247 if (s2)
2248 return 0;
2249 return 1;
2252 /* return true if type1 and type2 are the same. If unqualified is
2253 true, qualifiers on the types are ignored.
2255 - enums are not checked as gcc __builtin_types_compatible_p ()
2257 static int compare_types(CType *type1, CType *type2, int unqualified)
2259 int bt1, t1, t2;
2261 t1 = type1->t & VT_TYPE;
2262 t2 = type2->t & VT_TYPE;
2263 if (unqualified) {
2264 /* strip qualifiers before comparing */
2265 t1 &= ~(VT_CONSTANT | VT_VOLATILE);
2266 t2 &= ~(VT_CONSTANT | VT_VOLATILE);
2268 /* Default Vs explicit signedness only matters for char */
2269 if ((t1 & VT_BTYPE) != VT_BYTE) {
2270 t1 &= ~VT_DEFSIGN;
2271 t2 &= ~VT_DEFSIGN;
2273 /* XXX: bitfields ? */
2274 if (t1 != t2)
2275 return 0;
2276 /* test more complicated cases */
2277 bt1 = t1 & VT_BTYPE;
2278 if (bt1 == VT_PTR) {
2279 type1 = pointed_type(type1);
2280 type2 = pointed_type(type2);
2281 return is_compatible_types(type1, type2);
2282 } else if (bt1 == VT_STRUCT) {
2283 return (type1->ref == type2->ref);
2284 } else if (bt1 == VT_FUNC) {
2285 return is_compatible_func(type1, type2);
2286 } else {
2287 return 1;
2291 /* return true if type1 and type2 are exactly the same (including
2292 qualifiers).
2294 static int is_compatible_types(CType *type1, CType *type2)
2296 return compare_types(type1,type2,0);
2299 /* return true if type1 and type2 are the same (ignoring qualifiers).
2301 static int is_compatible_parameter_types(CType *type1, CType *type2)
2303 return compare_types(type1,type2,1);
2306 /* print a type. If 'varstr' is not NULL, then the variable is also
2307 printed in the type */
2308 /* XXX: union */
2309 /* XXX: add array and function pointers */
2310 static void type_to_str(char *buf, int buf_size,
2311 CType *type, const char *varstr)
2313 int bt, v, t;
2314 Sym *s, *sa;
2315 char buf1[256];
2316 const char *tstr;
2318 t = type->t & VT_TYPE;
2319 bt = t & VT_BTYPE;
2320 buf[0] = '\0';
2321 if (t & VT_CONSTANT)
2322 pstrcat(buf, buf_size, "const ");
2323 if (t & VT_VOLATILE)
2324 pstrcat(buf, buf_size, "volatile ");
2325 if ((t & (VT_DEFSIGN | VT_UNSIGNED)) == (VT_DEFSIGN | VT_UNSIGNED))
2326 pstrcat(buf, buf_size, "unsigned ");
2327 else if (t & VT_DEFSIGN)
2328 pstrcat(buf, buf_size, "signed ");
2329 switch(bt) {
2330 case VT_VOID:
2331 tstr = "void";
2332 goto add_tstr;
2333 case VT_BOOL:
2334 tstr = "_Bool";
2335 goto add_tstr;
2336 case VT_BYTE:
2337 tstr = "char";
2338 goto add_tstr;
2339 case VT_SHORT:
2340 tstr = "short";
2341 goto add_tstr;
2342 case VT_INT:
2343 tstr = "int";
2344 goto add_tstr;
2345 case VT_LONG:
2346 tstr = "long";
2347 goto add_tstr;
2348 case VT_LLONG:
2349 tstr = "long long";
2350 goto add_tstr;
2351 case VT_FLOAT:
2352 tstr = "float";
2353 goto add_tstr;
2354 case VT_DOUBLE:
2355 tstr = "double";
2356 goto add_tstr;
2357 case VT_LDOUBLE:
2358 tstr = "long double";
2359 add_tstr:
2360 pstrcat(buf, buf_size, tstr);
2361 break;
2362 case VT_ENUM:
2363 case VT_STRUCT:
2364 if (bt == VT_STRUCT)
2365 tstr = "struct ";
2366 else
2367 tstr = "enum ";
2368 pstrcat(buf, buf_size, tstr);
2369 v = type->ref->v & ~SYM_STRUCT;
2370 if (v >= SYM_FIRST_ANOM)
2371 pstrcat(buf, buf_size, "<anonymous>");
2372 else
2373 pstrcat(buf, buf_size, get_tok_str(v, NULL));
2374 break;
2375 case VT_FUNC:
2376 s = type->ref;
2377 type_to_str(buf, buf_size, &s->type, varstr);
2378 pstrcat(buf, buf_size, "(");
2379 sa = s->next;
2380 while (sa != NULL) {
2381 type_to_str(buf1, sizeof(buf1), &sa->type, NULL);
2382 pstrcat(buf, buf_size, buf1);
2383 sa = sa->next;
2384 if (sa)
2385 pstrcat(buf, buf_size, ", ");
2387 pstrcat(buf, buf_size, ")");
2388 goto no_var;
2389 case VT_PTR:
2390 s = type->ref;
2391 pstrcpy(buf1, sizeof(buf1), "*");
2392 if (varstr)
2393 pstrcat(buf1, sizeof(buf1), varstr);
2394 type_to_str(buf, buf_size, &s->type, buf1);
2395 goto no_var;
2397 if (varstr) {
2398 pstrcat(buf, buf_size, " ");
2399 pstrcat(buf, buf_size, varstr);
2401 no_var: ;
2404 /* verify type compatibility to store vtop in 'dt' type, and generate
2405 casts if needed. */
2406 static void gen_assign_cast(CType *dt)
2408 CType *st, *type1, *type2, tmp_type1, tmp_type2;
2409 char buf1[256], buf2[256];
2410 int dbt, sbt;
2412 st = &vtop->type; /* source type */
2413 dbt = dt->t & VT_BTYPE;
2414 sbt = st->t & VT_BTYPE;
2415 if (sbt == VT_VOID || dbt == VT_VOID)
2416 tcc_error("cannot cast from/to void");
2417 if (dt->t & VT_CONSTANT)
2418 tcc_warning("assignment of read-only location");
2419 switch(dbt) {
2420 case VT_PTR:
2421 /* special cases for pointers */
2422 /* '0' can also be a pointer */
2423 if (is_null_pointer(vtop))
2424 goto type_ok;
2425 /* accept implicit pointer to integer cast with warning */
2426 if (is_integer_btype(sbt)) {
2427 tcc_warning("assignment makes pointer from integer without a cast");
2428 goto type_ok;
2430 type1 = pointed_type(dt);
2431 /* a function is implicitely a function pointer */
2432 if (sbt == VT_FUNC) {
2433 if ((type1->t & VT_BTYPE) != VT_VOID &&
2434 !is_compatible_types(pointed_type(dt), st))
2435 tcc_warning("assignment from incompatible pointer type");
2436 goto type_ok;
2438 if (sbt != VT_PTR)
2439 goto error;
2440 type2 = pointed_type(st);
2441 if ((type1->t & VT_BTYPE) == VT_VOID ||
2442 (type2->t & VT_BTYPE) == VT_VOID) {
2443 /* void * can match anything */
2444 } else {
2445 /* exact type match, except for unsigned */
2446 tmp_type1 = *type1;
2447 tmp_type2 = *type2;
2448 tmp_type1.t &= ~(VT_DEFSIGN | VT_UNSIGNED | VT_CONSTANT |
2449 VT_VOLATILE);
2450 tmp_type2.t &= ~(VT_DEFSIGN | VT_UNSIGNED | VT_CONSTANT |
2451 VT_VOLATILE);
2452 if (!is_compatible_types(&tmp_type1, &tmp_type2))
2453 tcc_warning("assignment from incompatible pointer type");
2455 /* check const and volatile */
2456 if ((!(type1->t & VT_CONSTANT) && (type2->t & VT_CONSTANT)) ||
2457 (!(type1->t & VT_VOLATILE) && (type2->t & VT_VOLATILE)))
2458 tcc_warning("assignment discards qualifiers from pointer target type");
2459 break;
2460 case VT_BYTE:
2461 case VT_SHORT:
2462 case VT_INT:
2463 case VT_LLONG:
2464 if (sbt == VT_PTR || sbt == VT_FUNC) {
2465 tcc_warning("assignment makes integer from pointer without a cast");
2467 /* XXX: more tests */
2468 break;
2469 case VT_STRUCT:
2470 tmp_type1 = *dt;
2471 tmp_type2 = *st;
2472 tmp_type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
2473 tmp_type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
2474 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
2475 error:
2476 type_to_str(buf1, sizeof(buf1), st, NULL);
2477 type_to_str(buf2, sizeof(buf2), dt, NULL);
2478 tcc_error("cannot cast '%s' to '%s'", buf1, buf2);
2480 break;
2482 type_ok:
2483 gen_cast(dt);
2486 /* store vtop in lvalue pushed on stack */
2487 ST_FUNC void vstore(void)
2489 int sbt, dbt, ft, r, t, size, align, bit_size, bit_pos, rc, delayed_cast;
2491 ft = vtop[-1].type.t;
2492 sbt = vtop->type.t & VT_BTYPE;
2493 dbt = ft & VT_BTYPE;
2494 if ((((sbt == VT_INT || sbt == VT_SHORT) && dbt == VT_BYTE) ||
2495 (sbt == VT_INT && dbt == VT_SHORT))
2496 && !(vtop->type.t & VT_BITFIELD)) {
2497 /* optimize char/short casts */
2498 delayed_cast = VT_MUSTCAST;
2499 vtop->type.t = ft & (VT_TYPE & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT)));
2500 /* XXX: factorize */
2501 if (ft & VT_CONSTANT)
2502 tcc_warning("assignment of read-only location");
2503 } else {
2504 delayed_cast = 0;
2505 if (!(ft & VT_BITFIELD))
2506 gen_assign_cast(&vtop[-1].type);
2509 if (sbt == VT_STRUCT) {
2510 /* if structure, only generate pointer */
2511 /* structure assignment : generate memcpy */
2512 /* XXX: optimize if small size */
2513 if (!nocode_wanted) {
2514 size = type_size(&vtop->type, &align);
2516 /* destination */
2517 vswap();
2518 vtop->type.t = VT_PTR;
2519 gaddrof();
2521 /* address of memcpy() */
2522 #ifdef TCC_ARM_EABI
2523 if(!(align & 7))
2524 vpush_global_sym(&func_old_type, TOK_memcpy8);
2525 else if(!(align & 3))
2526 vpush_global_sym(&func_old_type, TOK_memcpy4);
2527 else
2528 #endif
2529 vpush_global_sym(&func_old_type, TOK_memcpy);
2531 vswap();
2532 /* source */
2533 vpushv(vtop - 2);
2534 vtop->type.t = VT_PTR;
2535 gaddrof();
2536 /* type size */
2537 vpushi(size);
2538 gfunc_call(3);
2539 } else {
2540 vswap();
2541 vpop();
2543 /* leave source on stack */
2544 } else if (ft & VT_BITFIELD) {
2545 /* bitfield store handling */
2547 /* save lvalue as expression result (example: s.b = s.a = n;) */
2548 vdup(), vtop[-1] = vtop[-2];
2550 bit_pos = (ft >> VT_STRUCT_SHIFT) & 0x3f;
2551 bit_size = (ft >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
2552 /* remove bit field info to avoid loops */
2553 vtop[-1].type.t = ft & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT));
2555 if((ft & VT_BTYPE) == VT_BOOL) {
2556 gen_cast(&vtop[-1].type);
2557 vtop[-1].type.t = (vtop[-1].type.t & ~VT_BTYPE) | (VT_BYTE | VT_UNSIGNED);
2560 /* duplicate destination */
2561 vdup();
2562 vtop[-1] = vtop[-2];
2564 /* mask and shift source */
2565 if((ft & VT_BTYPE) != VT_BOOL) {
2566 if((ft & VT_BTYPE) == VT_LLONG) {
2567 vpushll((1ULL << bit_size) - 1ULL);
2568 } else {
2569 vpushi((1 << bit_size) - 1);
2571 gen_op('&');
2573 vpushi(bit_pos);
2574 gen_op(TOK_SHL);
2575 /* load destination, mask and or with source */
2576 vswap();
2577 if((ft & VT_BTYPE) == VT_LLONG) {
2578 vpushll(~(((1ULL << bit_size) - 1ULL) << bit_pos));
2579 } else {
2580 vpushi(~(((1 << bit_size) - 1) << bit_pos));
2582 gen_op('&');
2583 gen_op('|');
2584 /* store result */
2585 vstore();
2586 /* ... and discard */
2587 vpop();
2589 } else {
2590 #ifdef CONFIG_TCC_BCHECK
2591 /* bound check case */
2592 if (vtop[-1].r & VT_MUSTBOUND) {
2593 vswap();
2594 gbound();
2595 vswap();
2597 #endif
2598 if (!nocode_wanted) {
2599 rc = RC_INT;
2600 if (is_float(ft)) {
2601 rc = RC_FLOAT;
2602 #ifdef TCC_TARGET_X86_64
2603 if ((ft & VT_BTYPE) == VT_LDOUBLE) {
2604 rc = RC_ST0;
2605 } else if ((ft & VT_BTYPE) == VT_QFLOAT) {
2606 rc = RC_FRET;
2608 #endif
2610 r = gv(rc); /* generate value */
2611 /* if lvalue was saved on stack, must read it */
2612 if ((vtop[-1].r & VT_VALMASK) == VT_LLOCAL) {
2613 SValue sv;
2614 t = get_reg(RC_INT);
2615 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
2616 sv.type.t = VT_PTR;
2617 #else
2618 sv.type.t = VT_INT;
2619 #endif
2620 sv.r = VT_LOCAL | VT_LVAL;
2621 sv.c.ul = vtop[-1].c.ul;
2622 load(t, &sv);
2623 vtop[-1].r = t | VT_LVAL;
2625 /* two word case handling : store second register at word + 4 (or +8 for x86-64) */
2626 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
2627 if (((ft & VT_BTYPE) == VT_QLONG) || ((ft & VT_BTYPE) == VT_QFLOAT)) {
2628 int addr_type = VT_LLONG, load_size = 8, load_type = ((vtop->type.t & VT_BTYPE) == VT_QLONG) ? VT_LLONG : VT_DOUBLE;
2629 #else
2630 if ((ft & VT_BTYPE) == VT_LLONG) {
2631 int addr_type = VT_INT, load_size = 4, load_type = VT_INT;
2632 #endif
2633 vtop[-1].type.t = load_type;
2634 store(r, vtop - 1);
2635 vswap();
2636 /* convert to int to increment easily */
2637 vtop->type.t = addr_type;
2638 gaddrof();
2639 vpushi(load_size);
2640 gen_op('+');
2641 vtop->r |= VT_LVAL;
2642 vswap();
2643 vtop[-1].type.t = load_type;
2644 /* XXX: it works because r2 is spilled last ! */
2645 store(vtop->r2, vtop - 1);
2646 } else {
2647 store(r, vtop - 1);
2650 vswap();
2651 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
2652 vtop->r |= delayed_cast;
2656 /* post defines POST/PRE add. c is the token ++ or -- */
2657 ST_FUNC void inc(int post, int c)
2659 test_lvalue();
2660 vdup(); /* save lvalue */
2661 if (post) {
2662 gv_dup(); /* duplicate value */
2663 vrotb(3);
2664 vrotb(3);
2666 /* add constant */
2667 vpushi(c - TOK_MID);
2668 gen_op('+');
2669 vstore(); /* store value */
2670 if (post)
2671 vpop(); /* if post op, return saved value */
2674 /* Parse GNUC __attribute__ extension. Currently, the following
2675 extensions are recognized:
2676 - aligned(n) : set data/function alignment.
2677 - packed : force data alignment to 1
2678 - section(x) : generate data/code in this section.
2679 - unused : currently ignored, but may be used someday.
2680 - regparm(n) : pass function parameters in registers (i386 only)
2682 static void parse_attribute(AttributeDef *ad)
2684 int t, n;
2686 while (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) {
2687 next();
2688 skip('(');
2689 skip('(');
2690 while (tok != ')') {
2691 if (tok < TOK_IDENT)
2692 expect("attribute name");
2693 t = tok;
2694 next();
2695 switch(t) {
2696 case TOK_SECTION1:
2697 case TOK_SECTION2:
2698 skip('(');
2699 if (tok != TOK_STR)
2700 expect("section name");
2701 ad->section = find_section(tcc_state, (char *)tokc.cstr->data);
2702 next();
2703 skip(')');
2704 break;
2705 case TOK_ALIAS1:
2706 case TOK_ALIAS2:
2707 skip('(');
2708 if (tok != TOK_STR)
2709 expect("alias(\"target\")");
2710 ad->alias_target = /* save string as token, for later */
2711 tok_alloc((char*)tokc.cstr->data, tokc.cstr->size-1)->tok;
2712 next();
2713 skip(')');
2714 break;
2715 case TOK_VISIBILITY1:
2716 case TOK_VISIBILITY2:
2717 skip('(');
2718 if (tok != TOK_STR)
2719 expect("visibility(\"default|hidden|internal|protected\")");
2720 if (!strcmp (tokc.cstr->data, "default"))
2721 ad->a.visibility = STV_DEFAULT;
2722 else if (!strcmp (tokc.cstr->data, "hidden"))
2723 ad->a.visibility = STV_HIDDEN;
2724 else if (!strcmp (tokc.cstr->data, "internal"))
2725 ad->a.visibility = STV_INTERNAL;
2726 else if (!strcmp (tokc.cstr->data, "protected"))
2727 ad->a.visibility = STV_PROTECTED;
2728 else
2729 expect("visibility(\"default|hidden|internal|protected\")");
2730 next();
2731 skip(')');
2732 break;
2733 case TOK_ALIGNED1:
2734 case TOK_ALIGNED2:
2735 if (tok == '(') {
2736 next();
2737 n = expr_const();
2738 if (n <= 0 || (n & (n - 1)) != 0)
2739 tcc_error("alignment must be a positive power of two");
2740 skip(')');
2741 } else {
2742 n = MAX_ALIGN;
2744 ad->a.aligned = n;
2745 break;
2746 case TOK_PACKED1:
2747 case TOK_PACKED2:
2748 ad->a.packed = 1;
2749 break;
2750 case TOK_WEAK1:
2751 case TOK_WEAK2:
2752 ad->a.weak = 1;
2753 break;
2754 case TOK_UNUSED1:
2755 case TOK_UNUSED2:
2756 /* currently, no need to handle it because tcc does not
2757 track unused objects */
2758 break;
2759 case TOK_NORETURN1:
2760 case TOK_NORETURN2:
2761 /* currently, no need to handle it because tcc does not
2762 track unused objects */
2763 break;
2764 case TOK_CDECL1:
2765 case TOK_CDECL2:
2766 case TOK_CDECL3:
2767 ad->a.func_call = FUNC_CDECL;
2768 break;
2769 case TOK_STDCALL1:
2770 case TOK_STDCALL2:
2771 case TOK_STDCALL3:
2772 ad->a.func_call = FUNC_STDCALL;
2773 break;
2774 #ifdef TCC_TARGET_I386
2775 case TOK_REGPARM1:
2776 case TOK_REGPARM2:
2777 skip('(');
2778 n = expr_const();
2779 if (n > 3)
2780 n = 3;
2781 else if (n < 0)
2782 n = 0;
2783 if (n > 0)
2784 ad->a.func_call = FUNC_FASTCALL1 + n - 1;
2785 skip(')');
2786 break;
2787 case TOK_FASTCALL1:
2788 case TOK_FASTCALL2:
2789 case TOK_FASTCALL3:
2790 ad->a.func_call = FUNC_FASTCALLW;
2791 break;
2792 #endif
2793 case TOK_MODE:
2794 skip('(');
2795 switch(tok) {
2796 case TOK_MODE_DI:
2797 ad->a.mode = VT_LLONG + 1;
2798 break;
2799 case TOK_MODE_HI:
2800 ad->a.mode = VT_SHORT + 1;
2801 break;
2802 case TOK_MODE_SI:
2803 ad->a.mode = VT_INT + 1;
2804 break;
2805 default:
2806 tcc_warning("__mode__(%s) not supported\n", get_tok_str(tok, NULL));
2807 break;
2809 next();
2810 skip(')');
2811 break;
2812 case TOK_DLLEXPORT:
2813 ad->a.func_export = 1;
2814 break;
2815 case TOK_DLLIMPORT:
2816 ad->a.func_import = 1;
2817 break;
2818 default:
2819 if (tcc_state->warn_unsupported)
2820 tcc_warning("'%s' attribute ignored", get_tok_str(t, NULL));
2821 /* skip parameters */
2822 if (tok == '(') {
2823 int parenthesis = 0;
2824 do {
2825 if (tok == '(')
2826 parenthesis++;
2827 else if (tok == ')')
2828 parenthesis--;
2829 next();
2830 } while (parenthesis && tok != -1);
2832 break;
2834 if (tok != ',')
2835 break;
2836 next();
2838 skip(')');
2839 skip(')');
2843 /* enum/struct/union declaration. u is either VT_ENUM or VT_STRUCT */
2844 static void struct_decl(CType *type, int u, int tdef)
2846 int a, v, size, align, maxalign, c, offset, flexible;
2847 int bit_size, bit_pos, bsize, bt, lbit_pos, prevbt;
2848 Sym *s, *ss, *ass, **ps;
2849 AttributeDef ad;
2850 CType type1, btype;
2852 a = tok; /* save decl type */
2853 next();
2854 if (tok != '{') {
2855 v = tok;
2856 next();
2857 /* struct already defined ? return it */
2858 if (v < TOK_IDENT)
2859 expect("struct/union/enum name");
2860 s = struct_find(v);
2861 if (s) {
2862 if (s->type.t != a)
2863 tcc_error("invalid type");
2864 goto do_decl;
2865 } else if (tok >= TOK_IDENT && !tdef)
2866 tcc_error("unknown struct/union/enum");
2867 } else {
2868 v = anon_sym++;
2870 type1.t = a;
2871 type1.ref = NULL;
2872 /* we put an undefined size for struct/union */
2873 s = sym_push(v | SYM_STRUCT, &type1, 0, -1);
2874 s->r = 0; /* default alignment is zero as gcc */
2875 /* put struct/union/enum name in type */
2876 do_decl:
2877 type->t = u;
2878 type->ref = s;
2880 if (tok == '{') {
2881 next();
2882 if (s->c != -1)
2883 tcc_error("struct/union/enum already defined");
2884 /* cannot be empty */
2885 c = 0;
2886 /* non empty enums are not allowed */
2887 if (a == TOK_ENUM) {
2888 for(;;) {
2889 v = tok;
2890 if (v < TOK_UIDENT)
2891 expect("identifier");
2892 ss = sym_find(v);
2893 if (ss && !local_stack)
2894 tcc_error("redefinition of enumerator '%s'",
2895 get_tok_str(v, NULL));
2896 next();
2897 if (tok == '=') {
2898 next();
2899 c = expr_const();
2901 /* enum symbols have static storage */
2902 ss = sym_push(v, &int_type, VT_CONST, c);
2903 ss->type.t |= VT_STATIC;
2904 if (tok != ',')
2905 break;
2906 next();
2907 c++;
2908 /* NOTE: we accept a trailing comma */
2909 if (tok == '}')
2910 break;
2912 s->c = type_size(&int_type, &align);
2913 skip('}');
2914 } else {
2915 maxalign = 1;
2916 ps = &s->next;
2917 prevbt = VT_INT;
2918 bit_pos = 0;
2919 offset = 0;
2920 flexible = 0;
2921 while (tok != '}') {
2922 parse_btype(&btype, &ad);
2923 while (1) {
2924 if (flexible)
2925 tcc_error("flexible array member '%s' not at the end of struct",
2926 get_tok_str(v, NULL));
2927 bit_size = -1;
2928 v = 0;
2929 type1 = btype;
2930 if (tok != ':') {
2931 type_decl(&type1, &ad, &v, TYPE_DIRECT | TYPE_ABSTRACT);
2932 if (v == 0 && (type1.t & VT_BTYPE) != VT_STRUCT)
2933 expect("identifier");
2934 if (type_size(&type1, &align) < 0) {
2935 if ((a == TOK_STRUCT) && (type1.t & VT_ARRAY) && c)
2936 flexible = 1;
2937 else
2938 tcc_error("field '%s' has incomplete type",
2939 get_tok_str(v, NULL));
2941 if ((type1.t & VT_BTYPE) == VT_FUNC ||
2942 (type1.t & (VT_TYPEDEF | VT_STATIC | VT_EXTERN | VT_INLINE)))
2943 tcc_error("invalid type for '%s'",
2944 get_tok_str(v, NULL));
2946 if (tok == ':') {
2947 next();
2948 bit_size = expr_const();
2949 /* XXX: handle v = 0 case for messages */
2950 if (bit_size < 0)
2951 tcc_error("negative width in bit-field '%s'",
2952 get_tok_str(v, NULL));
2953 if (v && bit_size == 0)
2954 tcc_error("zero width for bit-field '%s'",
2955 get_tok_str(v, NULL));
2957 size = type_size(&type1, &align);
2958 if (ad.a.aligned) {
2959 if (align < ad.a.aligned)
2960 align = ad.a.aligned;
2961 } else if (ad.a.packed) {
2962 align = 1;
2963 } else if (*tcc_state->pack_stack_ptr) {
2964 if (align > *tcc_state->pack_stack_ptr)
2965 align = *tcc_state->pack_stack_ptr;
2967 lbit_pos = 0;
2968 if (bit_size >= 0) {
2969 bt = type1.t & VT_BTYPE;
2970 if (bt != VT_INT &&
2971 bt != VT_BYTE &&
2972 bt != VT_SHORT &&
2973 bt != VT_BOOL &&
2974 bt != VT_ENUM &&
2975 bt != VT_LLONG)
2976 tcc_error("bitfields must have scalar type");
2977 bsize = size * 8;
2978 if (bit_size > bsize) {
2979 tcc_error("width of '%s' exceeds its type",
2980 get_tok_str(v, NULL));
2981 } else if (bit_size == bsize) {
2982 /* no need for bit fields */
2983 bit_pos = 0;
2984 } else if (bit_size == 0) {
2985 /* XXX: what to do if only padding in a
2986 structure ? */
2987 /* zero size: means to pad */
2988 bit_pos = 0;
2989 } else {
2990 /* we do not have enough room ?
2991 did the type change?
2992 is it a union? */
2993 if ((bit_pos + bit_size) > bsize ||
2994 bt != prevbt || a == TOK_UNION)
2995 bit_pos = 0;
2996 lbit_pos = bit_pos;
2997 /* XXX: handle LSB first */
2998 type1.t |= VT_BITFIELD |
2999 (bit_pos << VT_STRUCT_SHIFT) |
3000 (bit_size << (VT_STRUCT_SHIFT + 6));
3001 bit_pos += bit_size;
3003 prevbt = bt;
3004 } else {
3005 bit_pos = 0;
3007 if (v != 0 || (type1.t & VT_BTYPE) == VT_STRUCT) {
3008 /* add new memory data only if starting
3009 bit field */
3010 if (lbit_pos == 0) {
3011 if (a == TOK_STRUCT) {
3012 c = (c + align - 1) & -align;
3013 offset = c;
3014 if (size > 0)
3015 c += size;
3016 } else {
3017 offset = 0;
3018 if (size > c)
3019 c = size;
3021 if (align > maxalign)
3022 maxalign = align;
3024 #if 0
3025 printf("add field %s offset=%d",
3026 get_tok_str(v, NULL), offset);
3027 if (type1.t & VT_BITFIELD) {
3028 printf(" pos=%d size=%d",
3029 (type1.t >> VT_STRUCT_SHIFT) & 0x3f,
3030 (type1.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f);
3032 printf("\n");
3033 #endif
3035 if (v == 0 && (type1.t & VT_BTYPE) == VT_STRUCT) {
3036 ass = type1.ref;
3037 while ((ass = ass->next) != NULL) {
3038 ss = sym_push(ass->v, &ass->type, 0, offset + ass->c);
3039 *ps = ss;
3040 ps = &ss->next;
3042 } else if (v) {
3043 ss = sym_push(v | SYM_FIELD, &type1, 0, offset);
3044 *ps = ss;
3045 ps = &ss->next;
3047 if (tok == ';' || tok == TOK_EOF)
3048 break;
3049 skip(',');
3051 skip(';');
3053 skip('}');
3054 /* store size and alignment */
3055 s->c = (c + maxalign - 1) & -maxalign;
3056 s->r = maxalign;
3061 /* return 1 if basic type is a type size (short, long, long long) */
3062 ST_FUNC int is_btype_size(int bt)
3064 return bt == VT_SHORT || bt == VT_LONG || bt == VT_LLONG;
3067 /* return 0 if no type declaration. otherwise, return the basic type
3068 and skip it.
3070 static int parse_btype(CType *type, AttributeDef *ad)
3072 int t, u, bt_size, complete, type_found, typespec_found;
3073 Sym *s;
3074 CType type1;
3076 memset(ad, 0, sizeof(AttributeDef));
3077 complete = 0;
3078 type_found = 0;
3079 typespec_found = 0;
3080 t = 0;
3081 while(1) {
3082 switch(tok) {
3083 case TOK_EXTENSION:
3084 /* currently, we really ignore extension */
3085 next();
3086 continue;
3088 /* basic types */
3089 case TOK_CHAR:
3090 u = VT_BYTE;
3091 basic_type:
3092 next();
3093 basic_type1:
3094 if (complete)
3095 tcc_error("too many basic types");
3096 t |= u;
3097 bt_size = is_btype_size (u & VT_BTYPE);
3098 if (u == VT_INT || (!bt_size && !(t & VT_TYPEDEF)))
3099 complete = 1;
3100 typespec_found = 1;
3101 break;
3102 case TOK_VOID:
3103 u = VT_VOID;
3104 goto basic_type;
3105 case TOK_SHORT:
3106 u = VT_SHORT;
3107 goto basic_type;
3108 case TOK_INT:
3109 u = VT_INT;
3110 goto basic_type;
3111 case TOK_LONG:
3112 next();
3113 if ((t & VT_BTYPE) == VT_DOUBLE) {
3114 #ifndef TCC_TARGET_PE
3115 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
3116 #endif
3117 } else if ((t & VT_BTYPE) == VT_LONG) {
3118 t = (t & ~VT_BTYPE) | VT_LLONG;
3119 } else {
3120 u = VT_LONG;
3121 goto basic_type1;
3123 break;
3124 #ifdef TCC_TARGET_ARM64
3125 case TOK_UINT128:
3126 /* GCC's __uint128_t appears in some Linux header files. Make it a
3127 synonym for long double to get the size and alignment right. */
3128 u = VT_LDOUBLE;
3129 goto basic_type;
3130 #endif
3131 case TOK_BOOL:
3132 u = VT_BOOL;
3133 goto basic_type;
3134 case TOK_FLOAT:
3135 u = VT_FLOAT;
3136 goto basic_type;
3137 case TOK_DOUBLE:
3138 next();
3139 if ((t & VT_BTYPE) == VT_LONG) {
3140 #ifdef TCC_TARGET_PE
3141 t = (t & ~VT_BTYPE) | VT_DOUBLE;
3142 #else
3143 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
3144 #endif
3145 } else {
3146 u = VT_DOUBLE;
3147 goto basic_type1;
3149 break;
3150 case TOK_ENUM:
3151 struct_decl(&type1, VT_ENUM, t & VT_TYPEDEF);
3152 basic_type2:
3153 u = type1.t;
3154 type->ref = type1.ref;
3155 goto basic_type1;
3156 case TOK_STRUCT:
3157 case TOK_UNION:
3158 struct_decl(&type1, VT_STRUCT, t & VT_TYPEDEF);
3159 goto basic_type2;
3161 /* type modifiers */
3162 case TOK_CONST1:
3163 case TOK_CONST2:
3164 case TOK_CONST3:
3165 t |= VT_CONSTANT;
3166 next();
3167 break;
3168 case TOK_VOLATILE1:
3169 case TOK_VOLATILE2:
3170 case TOK_VOLATILE3:
3171 t |= VT_VOLATILE;
3172 next();
3173 break;
3174 case TOK_SIGNED1:
3175 case TOK_SIGNED2:
3176 case TOK_SIGNED3:
3177 if ((t & (VT_DEFSIGN|VT_UNSIGNED)) == (VT_DEFSIGN|VT_UNSIGNED))
3178 tcc_error("signed and unsigned modifier");
3179 typespec_found = 1;
3180 t |= VT_DEFSIGN;
3181 next();
3182 break;
3183 case TOK_REGISTER:
3184 case TOK_AUTO:
3185 case TOK_RESTRICT1:
3186 case TOK_RESTRICT2:
3187 case TOK_RESTRICT3:
3188 next();
3189 break;
3190 case TOK_UNSIGNED:
3191 if ((t & (VT_DEFSIGN|VT_UNSIGNED)) == VT_DEFSIGN)
3192 tcc_error("signed and unsigned modifier");
3193 t |= VT_DEFSIGN | VT_UNSIGNED;
3194 next();
3195 typespec_found = 1;
3196 break;
3198 /* storage */
3199 case TOK_EXTERN:
3200 t |= VT_EXTERN;
3201 next();
3202 break;
3203 case TOK_STATIC:
3204 t |= VT_STATIC;
3205 next();
3206 break;
3207 case TOK_TYPEDEF:
3208 t |= VT_TYPEDEF;
3209 next();
3210 break;
3211 case TOK_INLINE1:
3212 case TOK_INLINE2:
3213 case TOK_INLINE3:
3214 t |= VT_INLINE;
3215 next();
3216 break;
3218 /* GNUC attribute */
3219 case TOK_ATTRIBUTE1:
3220 case TOK_ATTRIBUTE2:
3221 parse_attribute(ad);
3222 if (ad->a.mode) {
3223 u = ad->a.mode -1;
3224 t = (t & ~VT_BTYPE) | u;
3226 break;
3227 /* GNUC typeof */
3228 case TOK_TYPEOF1:
3229 case TOK_TYPEOF2:
3230 case TOK_TYPEOF3:
3231 next();
3232 parse_expr_type(&type1);
3233 /* remove all storage modifiers except typedef */
3234 type1.t &= ~(VT_STORAGE&~VT_TYPEDEF);
3235 goto basic_type2;
3236 default:
3237 if (typespec_found)
3238 goto the_end;
3239 s = sym_find(tok);
3240 if (!s || !(s->type.t & VT_TYPEDEF))
3241 goto the_end;
3242 t |= (s->type.t & ~VT_TYPEDEF);
3243 type->ref = s->type.ref;
3244 if (s->r) {
3245 /* get attributes from typedef */
3246 if (0 == ad->a.aligned)
3247 ad->a.aligned = s->a.aligned;
3248 if (0 == ad->a.func_call)
3249 ad->a.func_call = s->a.func_call;
3250 ad->a.packed |= s->a.packed;
3252 next();
3253 typespec_found = 1;
3254 break;
3256 type_found = 1;
3258 the_end:
3259 if (tcc_state->char_is_unsigned) {
3260 if ((t & (VT_DEFSIGN|VT_BTYPE)) == VT_BYTE)
3261 t |= VT_UNSIGNED;
3264 /* long is never used as type */
3265 if ((t & VT_BTYPE) == VT_LONG)
3266 #if (!defined TCC_TARGET_X86_64 && !defined TCC_TARGET_ARM64) || \
3267 defined TCC_TARGET_PE
3268 t = (t & ~VT_BTYPE) | VT_INT;
3269 #else
3270 t = (t & ~VT_BTYPE) | VT_LLONG;
3271 #endif
3272 type->t = t;
3273 return type_found;
3276 /* convert a function parameter type (array to pointer and function to
3277 function pointer) */
3278 static inline void convert_parameter_type(CType *pt)
3280 /* remove const and volatile qualifiers (XXX: const could be used
3281 to indicate a const function parameter */
3282 pt->t &= ~(VT_CONSTANT | VT_VOLATILE);
3283 /* array must be transformed to pointer according to ANSI C */
3284 pt->t &= ~VT_ARRAY;
3285 if ((pt->t & VT_BTYPE) == VT_FUNC) {
3286 mk_pointer(pt);
3290 ST_FUNC void parse_asm_str(CString *astr)
3292 skip('(');
3293 /* read the string */
3294 if (tok != TOK_STR)
3295 expect("string constant");
3296 cstr_new(astr);
3297 while (tok == TOK_STR) {
3298 /* XXX: add \0 handling too ? */
3299 cstr_cat(astr, tokc.cstr->data);
3300 next();
3302 cstr_ccat(astr, '\0');
3305 /* Parse an asm label and return the label
3306 * Don't forget to free the CString in the caller! */
3307 static void asm_label_instr(CString *astr)
3309 next();
3310 parse_asm_str(astr);
3311 skip(')');
3312 #ifdef ASM_DEBUG
3313 printf("asm_alias: \"%s\"\n", (char *)astr->data);
3314 #endif
3317 static void post_type(CType *type, AttributeDef *ad)
3319 int n, l, t1, arg_size, align;
3320 Sym **plast, *s, *first;
3321 AttributeDef ad1;
3322 CType pt;
3324 if (tok == '(') {
3325 /* function declaration */
3326 next();
3327 l = 0;
3328 first = NULL;
3329 plast = &first;
3330 arg_size = 0;
3331 if (tok != ')') {
3332 for(;;) {
3333 /* read param name and compute offset */
3334 if (l != FUNC_OLD) {
3335 if (!parse_btype(&pt, &ad1)) {
3336 if (l) {
3337 tcc_error("invalid type");
3338 } else {
3339 l = FUNC_OLD;
3340 goto old_proto;
3343 l = FUNC_NEW;
3344 if ((pt.t & VT_BTYPE) == VT_VOID && tok == ')')
3345 break;
3346 type_decl(&pt, &ad1, &n, TYPE_DIRECT | TYPE_ABSTRACT);
3347 if ((pt.t & VT_BTYPE) == VT_VOID)
3348 tcc_error("parameter declared as void");
3349 arg_size += (type_size(&pt, &align) + PTR_SIZE - 1) / PTR_SIZE;
3350 } else {
3351 old_proto:
3352 n = tok;
3353 if (n < TOK_UIDENT)
3354 expect("identifier");
3355 pt.t = VT_INT;
3356 next();
3358 convert_parameter_type(&pt);
3359 s = sym_push(n | SYM_FIELD, &pt, 0, 0);
3360 *plast = s;
3361 plast = &s->next;
3362 if (tok == ')')
3363 break;
3364 skip(',');
3365 if (l == FUNC_NEW && tok == TOK_DOTS) {
3366 l = FUNC_ELLIPSIS;
3367 next();
3368 break;
3372 /* if no parameters, then old type prototype */
3373 if (l == 0)
3374 l = FUNC_OLD;
3375 skip(')');
3376 /* NOTE: const is ignored in returned type as it has a special
3377 meaning in gcc / C++ */
3378 type->t &= ~VT_CONSTANT;
3379 /* some ancient pre-K&R C allows a function to return an array
3380 and the array brackets to be put after the arguments, such
3381 that "int c()[]" means something like "int[] c()" */
3382 if (tok == '[') {
3383 next();
3384 skip(']'); /* only handle simple "[]" */
3385 type->t |= VT_PTR;
3387 /* we push a anonymous symbol which will contain the function prototype */
3388 ad->a.func_args = arg_size;
3389 s = sym_push(SYM_FIELD, type, 0, l);
3390 s->a = ad->a;
3391 s->next = first;
3392 type->t = VT_FUNC;
3393 type->ref = s;
3394 } else if (tok == '[') {
3395 /* array definition */
3396 next();
3397 if (tok == TOK_RESTRICT1)
3398 next();
3399 n = -1;
3400 t1 = 0;
3401 if (tok != ']') {
3402 if (!local_stack || nocode_wanted)
3403 vpushi(expr_const());
3404 else gexpr();
3405 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
3406 n = vtop->c.i;
3407 if (n < 0)
3408 tcc_error("invalid array size");
3409 } else {
3410 if (!is_integer_btype(vtop->type.t & VT_BTYPE))
3411 tcc_error("size of variable length array should be an integer");
3412 t1 = VT_VLA;
3415 skip(']');
3416 /* parse next post type */
3417 post_type(type, ad);
3418 if (type->t == VT_FUNC)
3419 tcc_error("declaration of an array of functions");
3420 t1 |= type->t & VT_VLA;
3422 if (t1 & VT_VLA) {
3423 loc -= type_size(&int_type, &align);
3424 loc &= -align;
3425 n = loc;
3427 vla_runtime_type_size(type, &align);
3428 gen_op('*');
3429 vset(&int_type, VT_LOCAL|VT_LVAL, loc);
3430 vswap();
3431 vstore();
3433 if (n != -1)
3434 vpop();
3436 /* we push an anonymous symbol which will contain the array
3437 element type */
3438 s = sym_push(SYM_FIELD, type, 0, n);
3439 type->t = (t1 ? VT_VLA : VT_ARRAY) | VT_PTR;
3440 type->ref = s;
3444 /* Parse a type declaration (except basic type), and return the type
3445 in 'type'. 'td' is a bitmask indicating which kind of type decl is
3446 expected. 'type' should contain the basic type. 'ad' is the
3447 attribute definition of the basic type. It can be modified by
3448 type_decl().
3450 static void type_decl(CType *type, AttributeDef *ad, int *v, int td)
3452 Sym *s;
3453 CType type1, *type2;
3454 int qualifiers, storage;
3456 while (tok == '*') {
3457 qualifiers = 0;
3458 redo:
3459 next();
3460 switch(tok) {
3461 case TOK_CONST1:
3462 case TOK_CONST2:
3463 case TOK_CONST3:
3464 qualifiers |= VT_CONSTANT;
3465 goto redo;
3466 case TOK_VOLATILE1:
3467 case TOK_VOLATILE2:
3468 case TOK_VOLATILE3:
3469 qualifiers |= VT_VOLATILE;
3470 goto redo;
3471 case TOK_RESTRICT1:
3472 case TOK_RESTRICT2:
3473 case TOK_RESTRICT3:
3474 goto redo;
3476 mk_pointer(type);
3477 type->t |= qualifiers;
3480 /* XXX: clarify attribute handling */
3481 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
3482 parse_attribute(ad);
3484 /* recursive type */
3485 /* XXX: incorrect if abstract type for functions (e.g. 'int ()') */
3486 type1.t = 0; /* XXX: same as int */
3487 if (tok == '(') {
3488 next();
3489 /* XXX: this is not correct to modify 'ad' at this point, but
3490 the syntax is not clear */
3491 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
3492 parse_attribute(ad);
3493 type_decl(&type1, ad, v, td);
3494 skip(')');
3495 } else {
3496 /* type identifier */
3497 if (tok >= TOK_IDENT && (td & TYPE_DIRECT)) {
3498 *v = tok;
3499 next();
3500 } else {
3501 if (!(td & TYPE_ABSTRACT))
3502 expect("identifier");
3503 *v = 0;
3506 storage = type->t & VT_STORAGE;
3507 type->t &= ~VT_STORAGE;
3508 if (storage & VT_STATIC) {
3509 int saved_nocode_wanted = nocode_wanted;
3510 nocode_wanted = 1;
3511 post_type(type, ad);
3512 nocode_wanted = saved_nocode_wanted;
3513 } else
3514 post_type(type, ad);
3515 type->t |= storage;
3516 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
3517 parse_attribute(ad);
3519 if (!type1.t)
3520 return;
3521 /* append type at the end of type1 */
3522 type2 = &type1;
3523 for(;;) {
3524 s = type2->ref;
3525 type2 = &s->type;
3526 if (!type2->t) {
3527 *type2 = *type;
3528 break;
3531 *type = type1;
3534 /* compute the lvalue VT_LVAL_xxx needed to match type t. */
3535 ST_FUNC int lvalue_type(int t)
3537 int bt, r;
3538 r = VT_LVAL;
3539 bt = t & VT_BTYPE;
3540 if (bt == VT_BYTE || bt == VT_BOOL)
3541 r |= VT_LVAL_BYTE;
3542 else if (bt == VT_SHORT)
3543 r |= VT_LVAL_SHORT;
3544 else
3545 return r;
3546 if (t & VT_UNSIGNED)
3547 r |= VT_LVAL_UNSIGNED;
3548 return r;
3551 /* indirection with full error checking and bound check */
3552 ST_FUNC void indir(void)
3554 if ((vtop->type.t & VT_BTYPE) != VT_PTR) {
3555 if ((vtop->type.t & VT_BTYPE) == VT_FUNC)
3556 return;
3557 expect("pointer");
3559 if ((vtop->r & VT_LVAL) && !nocode_wanted)
3560 gv(RC_INT);
3561 vtop->type = *pointed_type(&vtop->type);
3562 /* Arrays and functions are never lvalues */
3563 if (!(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_VLA)
3564 && (vtop->type.t & VT_BTYPE) != VT_FUNC) {
3565 vtop->r |= lvalue_type(vtop->type.t);
3566 /* if bound checking, the referenced pointer must be checked */
3567 #ifdef CONFIG_TCC_BCHECK
3568 if (tcc_state->do_bounds_check)
3569 vtop->r |= VT_MUSTBOUND;
3570 #endif
3574 /* pass a parameter to a function and do type checking and casting */
3575 static void gfunc_param_typed(Sym *func, Sym *arg)
3577 int func_type;
3578 CType type;
3580 func_type = func->c;
3581 if (func_type == FUNC_OLD ||
3582 (func_type == FUNC_ELLIPSIS && arg == NULL)) {
3583 /* default casting : only need to convert float to double */
3584 if ((vtop->type.t & VT_BTYPE) == VT_FLOAT) {
3585 type.t = VT_DOUBLE;
3586 gen_cast(&type);
3587 } else if (vtop->type.t & VT_BITFIELD) {
3588 type.t = vtop->type.t & (VT_BTYPE | VT_UNSIGNED);
3589 gen_cast(&type);
3591 } else if (arg == NULL) {
3592 tcc_error("too many arguments to function");
3593 } else {
3594 type = arg->type;
3595 type.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
3596 gen_assign_cast(&type);
3600 /* parse an expression of the form '(type)' or '(expr)' and return its
3601 type */
3602 static void parse_expr_type(CType *type)
3604 int n;
3605 AttributeDef ad;
3607 skip('(');
3608 if (parse_btype(type, &ad)) {
3609 type_decl(type, &ad, &n, TYPE_ABSTRACT);
3610 } else {
3611 expr_type(type);
3613 skip(')');
3616 static void parse_type(CType *type)
3618 AttributeDef ad;
3619 int n;
3621 if (!parse_btype(type, &ad)) {
3622 expect("type");
3624 type_decl(type, &ad, &n, TYPE_ABSTRACT);
3627 static void vpush_tokc(int t)
3629 CType type;
3630 type.t = t;
3631 type.ref = 0;
3632 vsetc(&type, VT_CONST, &tokc);
3635 ST_FUNC void unary(void)
3637 int n, t, align, size, r, sizeof_caller;
3638 CType type;
3639 Sym *s;
3640 AttributeDef ad;
3641 static int in_sizeof = 0;
3643 sizeof_caller = in_sizeof;
3644 in_sizeof = 0;
3645 /* XXX: GCC 2.95.3 does not generate a table although it should be
3646 better here */
3647 tok_next:
3648 switch(tok) {
3649 case TOK_EXTENSION:
3650 next();
3651 goto tok_next;
3652 case TOK_CINT:
3653 case TOK_CCHAR:
3654 case TOK_LCHAR:
3655 vpushi(tokc.i);
3656 next();
3657 break;
3658 case TOK_CUINT:
3659 vpush_tokc(VT_INT | VT_UNSIGNED);
3660 next();
3661 break;
3662 case TOK_CLLONG:
3663 vpush_tokc(VT_LLONG);
3664 next();
3665 break;
3666 case TOK_CULLONG:
3667 vpush_tokc(VT_LLONG | VT_UNSIGNED);
3668 next();
3669 break;
3670 case TOK_CFLOAT:
3671 vpush_tokc(VT_FLOAT);
3672 next();
3673 break;
3674 case TOK_CDOUBLE:
3675 vpush_tokc(VT_DOUBLE);
3676 next();
3677 break;
3678 case TOK_CLDOUBLE:
3679 vpush_tokc(VT_LDOUBLE);
3680 next();
3681 break;
3682 case TOK___FUNCTION__:
3683 if (!gnu_ext)
3684 goto tok_identifier;
3685 /* fall thru */
3686 case TOK___FUNC__:
3688 void *ptr;
3689 int len;
3690 /* special function name identifier */
3691 len = strlen(funcname) + 1;
3692 /* generate char[len] type */
3693 type.t = VT_BYTE;
3694 mk_pointer(&type);
3695 type.t |= VT_ARRAY;
3696 type.ref->c = len;
3697 vpush_ref(&type, data_section, data_section->data_offset, len);
3698 ptr = section_ptr_add(data_section, len);
3699 memcpy(ptr, funcname, len);
3700 next();
3702 break;
3703 case TOK_LSTR:
3704 #ifdef TCC_TARGET_PE
3705 t = VT_SHORT | VT_UNSIGNED;
3706 #else
3707 t = VT_INT;
3708 #endif
3709 goto str_init;
3710 case TOK_STR:
3711 /* string parsing */
3712 t = VT_BYTE;
3713 str_init:
3714 if (tcc_state->warn_write_strings)
3715 t |= VT_CONSTANT;
3716 type.t = t;
3717 mk_pointer(&type);
3718 type.t |= VT_ARRAY;
3719 memset(&ad, 0, sizeof(AttributeDef));
3720 decl_initializer_alloc(&type, &ad, VT_CONST, 2, 0, NULL, 0);
3721 break;
3722 case '(':
3723 next();
3724 /* cast ? */
3725 if (parse_btype(&type, &ad)) {
3726 type_decl(&type, &ad, &n, TYPE_ABSTRACT);
3727 skip(')');
3728 /* check ISOC99 compound literal */
3729 if (tok == '{') {
3730 /* data is allocated locally by default */
3731 if (global_expr)
3732 r = VT_CONST;
3733 else
3734 r = VT_LOCAL;
3735 /* all except arrays are lvalues */
3736 if (!(type.t & VT_ARRAY))
3737 r |= lvalue_type(type.t);
3738 memset(&ad, 0, sizeof(AttributeDef));
3739 decl_initializer_alloc(&type, &ad, r, 1, 0, NULL, 0);
3740 } else {
3741 if (sizeof_caller) {
3742 vpush(&type);
3743 return;
3745 unary();
3746 gen_cast(&type);
3748 } else if (tok == '{') {
3749 /* save all registers */
3750 save_regs(0);
3751 /* statement expression : we do not accept break/continue
3752 inside as GCC does */
3753 block(NULL, NULL, NULL, NULL, 0, 1);
3754 skip(')');
3755 } else {
3756 gexpr();
3757 skip(')');
3759 break;
3760 case '*':
3761 next();
3762 unary();
3763 indir();
3764 break;
3765 case '&':
3766 next();
3767 unary();
3768 /* functions names must be treated as function pointers,
3769 except for unary '&' and sizeof. Since we consider that
3770 functions are not lvalues, we only have to handle it
3771 there and in function calls. */
3772 /* arrays can also be used although they are not lvalues */
3773 if ((vtop->type.t & VT_BTYPE) != VT_FUNC &&
3774 !(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_LLOCAL))
3775 test_lvalue();
3776 mk_pointer(&vtop->type);
3777 gaddrof();
3778 break;
3779 case '!':
3780 next();
3781 unary();
3782 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
3783 CType boolean;
3784 boolean.t = VT_BOOL;
3785 gen_cast(&boolean);
3786 vtop->c.i = !vtop->c.i;
3787 } else if ((vtop->r & VT_VALMASK) == VT_CMP)
3788 vtop->c.i = vtop->c.i ^ 1;
3789 else {
3790 save_regs(1);
3791 vseti(VT_JMP, gvtst(1, 0));
3793 break;
3794 case '~':
3795 next();
3796 unary();
3797 vpushi(-1);
3798 gen_op('^');
3799 break;
3800 case '+':
3801 next();
3802 unary();
3803 if ((vtop->type.t & VT_BTYPE) == VT_PTR)
3804 tcc_error("pointer not accepted for unary plus");
3805 /* In order to force cast, we add zero, except for floating point
3806 where we really need an noop (otherwise -0.0 will be transformed
3807 into +0.0). */
3808 if (!is_float(vtop->type.t)) {
3809 vpushi(0);
3810 gen_op('+');
3812 break;
3813 case TOK_SIZEOF:
3814 case TOK_ALIGNOF1:
3815 case TOK_ALIGNOF2:
3816 t = tok;
3817 next();
3818 in_sizeof++;
3819 unary_type(&type); // Perform a in_sizeof = 0;
3820 size = type_size(&type, &align);
3821 if (t == TOK_SIZEOF) {
3822 if (!(type.t & VT_VLA)) {
3823 if (size < 0)
3824 tcc_error("sizeof applied to an incomplete type");
3825 vpushs(size);
3826 } else {
3827 vla_runtime_type_size(&type, &align);
3829 } else {
3830 vpushs(align);
3832 vtop->type.t |= VT_UNSIGNED;
3833 break;
3835 case TOK_builtin_types_compatible_p:
3837 CType type1, type2;
3838 next();
3839 skip('(');
3840 parse_type(&type1);
3841 skip(',');
3842 parse_type(&type2);
3843 skip(')');
3844 type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
3845 type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
3846 vpushi(is_compatible_types(&type1, &type2));
3848 break;
3849 case TOK_builtin_constant_p:
3851 int saved_nocode_wanted, res;
3852 next();
3853 skip('(');
3854 saved_nocode_wanted = nocode_wanted;
3855 nocode_wanted = 1;
3856 gexpr();
3857 res = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
3858 vpop();
3859 nocode_wanted = saved_nocode_wanted;
3860 skip(')');
3861 vpushi(res);
3863 break;
3864 case TOK_builtin_frame_address:
3866 int level;
3867 CType type;
3868 next();
3869 skip('(');
3870 if (tok != TOK_CINT || tokc.i < 0) {
3871 tcc_error("__builtin_frame_address only takes positive integers");
3873 level = tokc.i;
3874 next();
3875 skip(')');
3876 type.t = VT_VOID;
3877 mk_pointer(&type);
3878 vset(&type, VT_LOCAL, 0); /* local frame */
3879 while (level--) {
3880 mk_pointer(&vtop->type);
3881 indir(); /* -> parent frame */
3884 break;
3885 #ifdef TCC_TARGET_X86_64
3886 #ifdef TCC_TARGET_PE
3887 case TOK_builtin_va_start:
3889 next();
3890 skip('(');
3891 expr_eq();
3892 skip(',');
3893 expr_eq();
3894 skip(')');
3895 if ((vtop->r & VT_VALMASK) != VT_LOCAL)
3896 tcc_error("__builtin_va_start expects a local variable");
3897 vtop->r &= ~(VT_LVAL | VT_REF);
3898 vtop->type = char_pointer_type;
3899 vstore();
3901 break;
3902 #else
3903 case TOK_builtin_va_arg_types:
3905 CType type;
3906 next();
3907 skip('(');
3908 parse_type(&type);
3909 skip(')');
3910 vpushi(classify_x86_64_va_arg(&type));
3912 break;
3913 #endif
3914 #endif
3916 #ifdef TCC_TARGET_ARM64
3917 case TOK___va_start: {
3918 next();
3919 skip('(');
3920 expr_eq();
3921 skip(',');
3922 expr_eq();
3923 skip(')');
3924 //xx check types
3925 gen_va_start();
3926 vpushi(0);
3927 vtop->type.t = VT_VOID;
3928 break;
3930 case TOK___va_arg: {
3931 CType type;
3932 next();
3933 skip('(');
3934 expr_eq();
3935 skip(',');
3936 parse_type(&type);
3937 skip(')');
3938 //xx check types
3939 gen_va_arg(&type);
3940 vtop->type = type;
3941 break;
3943 #endif
3945 case TOK_INC:
3946 case TOK_DEC:
3947 t = tok;
3948 next();
3949 unary();
3950 inc(0, t);
3951 break;
3952 case '-':
3953 next();
3954 unary();
3955 t = vtop->type.t & VT_BTYPE;
3956 if (is_float(t)) {
3957 /* In IEEE negate(x) isn't subtract(0,x), but rather
3958 subtract(-0, x). */
3959 vpush(&vtop->type);
3960 if (t == VT_FLOAT)
3961 vtop->c.f = -0.0f;
3962 else if (t == VT_DOUBLE)
3963 vtop->c.d = -0.0;
3964 else
3965 vtop->c.ld = -0.0;
3966 } else
3967 vpushi(0);
3968 vswap();
3969 gen_op('-');
3970 break;
3971 case TOK_LAND:
3972 if (!gnu_ext)
3973 goto tok_identifier;
3974 next();
3975 /* allow to take the address of a label */
3976 if (tok < TOK_UIDENT)
3977 expect("label identifier");
3978 s = label_find(tok);
3979 if (!s) {
3980 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
3981 } else {
3982 if (s->r == LABEL_DECLARED)
3983 s->r = LABEL_FORWARD;
3985 if (!s->type.t) {
3986 s->type.t = VT_VOID;
3987 mk_pointer(&s->type);
3988 s->type.t |= VT_STATIC;
3990 vpushsym(&s->type, s);
3991 next();
3992 break;
3994 // special qnan , snan and infinity values
3995 case TOK___NAN__:
3996 vpush64(VT_DOUBLE, 0x7ff8000000000000ULL);
3997 next();
3998 break;
3999 case TOK___SNAN__:
4000 vpush64(VT_DOUBLE, 0x7ff0000000000001ULL);
4001 next();
4002 break;
4003 case TOK___INF__:
4004 vpush64(VT_DOUBLE, 0x7ff0000000000000ULL);
4005 next();
4006 break;
4008 default:
4009 tok_identifier:
4010 t = tok;
4011 next();
4012 if (t < TOK_UIDENT)
4013 expect("identifier");
4014 s = sym_find(t);
4015 if (!s) {
4016 const char *name = get_tok_str(t, NULL);
4017 if (tok != '(')
4018 tcc_error("'%s' undeclared", name);
4019 /* for simple function calls, we tolerate undeclared
4020 external reference to int() function */
4021 if (tcc_state->warn_implicit_function_declaration
4022 #ifdef TCC_TARGET_PE
4023 /* people must be warned about using undeclared WINAPI functions
4024 (which usually start with uppercase letter) */
4025 || (name[0] >= 'A' && name[0] <= 'Z')
4026 #endif
4028 tcc_warning("implicit declaration of function '%s'", name);
4029 s = external_global_sym(t, &func_old_type, 0);
4031 if ((s->type.t & (VT_STATIC | VT_INLINE | VT_BTYPE)) ==
4032 (VT_STATIC | VT_INLINE | VT_FUNC)) {
4033 /* if referencing an inline function, then we generate a
4034 symbol to it if not already done. It will have the
4035 effect to generate code for it at the end of the
4036 compilation unit. Inline function as always
4037 generated in the text section. */
4038 if (!s->c)
4039 put_extern_sym(s, text_section, 0, 0);
4040 r = VT_SYM | VT_CONST;
4041 } else {
4042 r = s->r;
4044 vset(&s->type, r, s->c);
4045 /* if forward reference, we must point to s */
4046 if (vtop->r & VT_SYM) {
4047 vtop->sym = s;
4048 vtop->c.ptr_offset = 0;
4050 break;
4053 /* post operations */
4054 while (1) {
4055 if (tok == TOK_INC || tok == TOK_DEC) {
4056 inc(1, tok);
4057 next();
4058 } else if (tok == '.' || tok == TOK_ARROW) {
4059 int qualifiers;
4060 /* field */
4061 if (tok == TOK_ARROW)
4062 indir();
4063 qualifiers = vtop->type.t & (VT_CONSTANT | VT_VOLATILE);
4064 test_lvalue();
4065 gaddrof();
4066 next();
4067 /* expect pointer on structure */
4068 if ((vtop->type.t & VT_BTYPE) != VT_STRUCT)
4069 expect("struct or union");
4070 s = vtop->type.ref;
4071 /* find field */
4072 tok |= SYM_FIELD;
4073 while ((s = s->next) != NULL) {
4074 if (s->v == tok)
4075 break;
4077 if (!s)
4078 tcc_error("field not found: %s", get_tok_str(tok & ~SYM_FIELD, NULL));
4079 /* add field offset to pointer */
4080 vtop->type = char_pointer_type; /* change type to 'char *' */
4081 vpushi(s->c);
4082 gen_op('+');
4083 /* change type to field type, and set to lvalue */
4084 vtop->type = s->type;
4085 vtop->type.t |= qualifiers;
4086 /* an array is never an lvalue */
4087 if (!(vtop->type.t & VT_ARRAY)) {
4088 vtop->r |= lvalue_type(vtop->type.t);
4089 #ifdef CONFIG_TCC_BCHECK
4090 /* if bound checking, the referenced pointer must be checked */
4091 if (tcc_state->do_bounds_check)
4092 vtop->r |= VT_MUSTBOUND;
4093 #endif
4095 next();
4096 } else if (tok == '[') {
4097 next();
4098 gexpr();
4099 gen_op('+');
4100 indir();
4101 skip(']');
4102 } else if (tok == '(') {
4103 SValue ret;
4104 Sym *sa;
4105 int nb_args, ret_nregs, ret_align, variadic;
4107 /* function call */
4108 if ((vtop->type.t & VT_BTYPE) != VT_FUNC) {
4109 /* pointer test (no array accepted) */
4110 if ((vtop->type.t & (VT_BTYPE | VT_ARRAY)) == VT_PTR) {
4111 vtop->type = *pointed_type(&vtop->type);
4112 if ((vtop->type.t & VT_BTYPE) != VT_FUNC)
4113 goto error_func;
4114 } else {
4115 error_func:
4116 expect("function pointer");
4118 } else {
4119 vtop->r &= ~VT_LVAL; /* no lvalue */
4121 /* get return type */
4122 s = vtop->type.ref;
4123 next();
4124 sa = s->next; /* first parameter */
4125 nb_args = 0;
4126 ret.r2 = VT_CONST;
4127 /* compute first implicit argument if a structure is returned */
4128 if ((s->type.t & VT_BTYPE) == VT_STRUCT) {
4129 variadic = (s->c == FUNC_ELLIPSIS);
4130 ret_nregs = gfunc_sret(&s->type, variadic, &ret.type,
4131 &ret_align);
4132 if (!ret_nregs) {
4133 /* get some space for the returned structure */
4134 size = type_size(&s->type, &align);
4135 #ifdef TCC_TARGET_ARM64
4136 /* On arm64, a small struct is return in registers.
4137 It is much easier to write it to memory if we know
4138 that we are allowed to write some extra bytes, so
4139 round the allocated space up to a power of 2: */
4140 if (size < 16)
4141 while (size & (size - 1))
4142 size = (size | (size - 1)) + 1;
4143 #endif
4144 loc = (loc - size) & -align;
4145 ret.type = s->type;
4146 ret.r = VT_LOCAL | VT_LVAL;
4147 /* pass it as 'int' to avoid structure arg passing
4148 problems */
4149 vseti(VT_LOCAL, loc);
4150 ret.c = vtop->c;
4151 nb_args++;
4153 } else {
4154 ret_nregs = 1;
4155 ret.type = s->type;
4158 if (ret_nregs) {
4159 /* return in register */
4160 if (is_float(ret.type.t)) {
4161 ret.r = reg_fret(ret.type.t);
4162 #ifdef TCC_TARGET_X86_64
4163 if ((ret.type.t & VT_BTYPE) == VT_QFLOAT)
4164 ret.r2 = REG_QRET;
4165 #endif
4166 } else {
4167 #ifndef TCC_TARGET_ARM64
4168 #ifdef TCC_TARGET_X86_64
4169 if ((ret.type.t & VT_BTYPE) == VT_QLONG)
4170 #else
4171 if ((ret.type.t & VT_BTYPE) == VT_LLONG)
4172 #endif
4173 ret.r2 = REG_LRET;
4174 #endif
4175 ret.r = REG_IRET;
4177 ret.c.i = 0;
4179 if (tok != ')') {
4180 for(;;) {
4181 expr_eq();
4182 gfunc_param_typed(s, sa);
4183 nb_args++;
4184 if (sa)
4185 sa = sa->next;
4186 if (tok == ')')
4187 break;
4188 skip(',');
4191 if (sa)
4192 tcc_error("too few arguments to function");
4193 skip(')');
4194 if (!nocode_wanted) {
4195 gfunc_call(nb_args);
4196 } else {
4197 vtop -= (nb_args + 1);
4200 /* return value */
4201 for (r = ret.r + ret_nregs + !ret_nregs; r-- > ret.r;) {
4202 vsetc(&ret.type, r, &ret.c);
4203 vtop->r2 = ret.r2; /* Loop only happens when r2 is VT_CONST */
4206 /* handle packed struct return */
4207 if (((s->type.t & VT_BTYPE) == VT_STRUCT) && ret_nregs) {
4208 int addr, offset;
4210 size = type_size(&s->type, &align);
4211 loc = (loc - size) & -align;
4212 addr = loc;
4213 offset = 0;
4214 for (;;) {
4215 vset(&ret.type, VT_LOCAL | VT_LVAL, addr + offset);
4216 vswap();
4217 vstore();
4218 vtop--;
4219 if (--ret_nregs == 0)
4220 break;
4221 /* XXX: compatible with arm only: ret_align == register_size */
4222 offset += ret_align;
4224 vset(&s->type, VT_LOCAL | VT_LVAL, addr);
4226 } else {
4227 break;
4232 ST_FUNC void expr_prod(void)
4234 int t;
4236 unary();
4237 while (tok == '*' || tok == '/' || tok == '%') {
4238 t = tok;
4239 next();
4240 unary();
4241 gen_op(t);
4245 ST_FUNC void expr_sum(void)
4247 int t;
4249 expr_prod();
4250 while (tok == '+' || tok == '-') {
4251 t = tok;
4252 next();
4253 expr_prod();
4254 gen_op(t);
4258 static void expr_shift(void)
4260 int t;
4262 expr_sum();
4263 while (tok == TOK_SHL || tok == TOK_SAR) {
4264 t = tok;
4265 next();
4266 expr_sum();
4267 gen_op(t);
4271 static void expr_cmp(void)
4273 int t;
4275 expr_shift();
4276 while ((tok >= TOK_ULE && tok <= TOK_GT) ||
4277 tok == TOK_ULT || tok == TOK_UGE) {
4278 t = tok;
4279 next();
4280 expr_shift();
4281 gen_op(t);
4285 static void expr_cmpeq(void)
4287 int t;
4289 expr_cmp();
4290 while (tok == TOK_EQ || tok == TOK_NE) {
4291 t = tok;
4292 next();
4293 expr_cmp();
4294 gen_op(t);
4298 static void expr_and(void)
4300 expr_cmpeq();
4301 while (tok == '&') {
4302 next();
4303 expr_cmpeq();
4304 gen_op('&');
4308 static void expr_xor(void)
4310 expr_and();
4311 while (tok == '^') {
4312 next();
4313 expr_and();
4314 gen_op('^');
4318 static void expr_or(void)
4320 expr_xor();
4321 while (tok == '|') {
4322 next();
4323 expr_xor();
4324 gen_op('|');
4328 /* XXX: fix this mess */
4329 static void expr_land_const(void)
4331 expr_or();
4332 while (tok == TOK_LAND) {
4333 next();
4334 expr_or();
4335 gen_op(TOK_LAND);
4339 /* XXX: fix this mess */
4340 static void expr_lor_const(void)
4342 expr_land_const();
4343 while (tok == TOK_LOR) {
4344 next();
4345 expr_land_const();
4346 gen_op(TOK_LOR);
4350 /* only used if non constant */
4351 static void expr_land(void)
4353 int t;
4355 expr_or();
4356 if (tok == TOK_LAND) {
4357 t = 0;
4358 save_regs(1);
4359 for(;;) {
4360 t = gvtst(1, t);
4361 if (tok != TOK_LAND) {
4362 vseti(VT_JMPI, t);
4363 break;
4365 next();
4366 expr_or();
4371 static void expr_lor(void)
4373 int t;
4375 expr_land();
4376 if (tok == TOK_LOR) {
4377 t = 0;
4378 save_regs(1);
4379 for(;;) {
4380 t = gvtst(0, t);
4381 if (tok != TOK_LOR) {
4382 vseti(VT_JMP, t);
4383 break;
4385 next();
4386 expr_land();
4391 /* XXX: better constant handling */
4392 static void expr_cond(void)
4394 int tt, u, r1, r2, rc, t1, t2, bt1, bt2;
4395 SValue sv;
4396 CType type, type1, type2;
4398 if (const_wanted) {
4399 expr_lor_const();
4400 if (tok == '?') {
4401 CType boolean;
4402 int c;
4403 boolean.t = VT_BOOL;
4404 vdup();
4405 gen_cast(&boolean);
4406 c = vtop->c.i;
4407 vpop();
4408 next();
4409 if (tok != ':' || !gnu_ext) {
4410 vpop();
4411 gexpr();
4413 if (!c)
4414 vpop();
4415 skip(':');
4416 expr_cond();
4417 if (c)
4418 vpop();
4420 } else {
4421 expr_lor();
4422 if (tok == '?') {
4423 next();
4424 if (vtop != vstack) {
4425 /* needed to avoid having different registers saved in
4426 each branch */
4427 if (is_float(vtop->type.t)) {
4428 rc = RC_FLOAT;
4429 #ifdef TCC_TARGET_X86_64
4430 if ((vtop->type.t & VT_BTYPE) == VT_LDOUBLE) {
4431 rc = RC_ST0;
4433 #endif
4435 else
4436 rc = RC_INT;
4437 gv(rc);
4438 save_regs(1);
4440 if (tok == ':' && gnu_ext) {
4441 gv_dup();
4442 tt = gvtst(1, 0);
4443 } else {
4444 tt = gvtst(1, 0);
4445 gexpr();
4447 type1 = vtop->type;
4448 sv = *vtop; /* save value to handle it later */
4449 vtop--; /* no vpop so that FP stack is not flushed */
4450 skip(':');
4451 u = gjmp(0);
4452 gsym(tt);
4453 expr_cond();
4454 type2 = vtop->type;
4456 t1 = type1.t;
4457 bt1 = t1 & VT_BTYPE;
4458 t2 = type2.t;
4459 bt2 = t2 & VT_BTYPE;
4460 /* cast operands to correct type according to ISOC rules */
4461 if (is_float(bt1) || is_float(bt2)) {
4462 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
4463 type.t = VT_LDOUBLE;
4464 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
4465 type.t = VT_DOUBLE;
4466 } else {
4467 type.t = VT_FLOAT;
4469 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
4470 /* cast to biggest op */
4471 type.t = VT_LLONG;
4472 /* convert to unsigned if it does not fit in a long long */
4473 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
4474 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
4475 type.t |= VT_UNSIGNED;
4476 } else if (bt1 == VT_PTR || bt2 == VT_PTR) {
4477 /* If one is a null ptr constant the result type
4478 is the other. */
4479 if (is_null_pointer (vtop))
4480 type = type1;
4481 else if (is_null_pointer (&sv))
4482 type = type2;
4483 /* XXX: test pointer compatibility, C99 has more elaborate
4484 rules here. */
4485 else
4486 type = type1;
4487 } else if (bt1 == VT_FUNC || bt2 == VT_FUNC) {
4488 /* XXX: test function pointer compatibility */
4489 type = bt1 == VT_FUNC ? type1 : type2;
4490 } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) {
4491 /* XXX: test structure compatibility */
4492 type = bt1 == VT_STRUCT ? type1 : type2;
4493 } else if (bt1 == VT_VOID || bt2 == VT_VOID) {
4494 /* NOTE: as an extension, we accept void on only one side */
4495 type.t = VT_VOID;
4496 } else {
4497 /* integer operations */
4498 type.t = VT_INT;
4499 /* convert to unsigned if it does not fit in an integer */
4500 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
4501 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
4502 type.t |= VT_UNSIGNED;
4505 /* now we convert second operand */
4506 gen_cast(&type);
4507 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
4508 gaddrof();
4509 rc = RC_INT;
4510 if (is_float(type.t)) {
4511 rc = RC_FLOAT;
4512 #ifdef TCC_TARGET_X86_64
4513 if ((type.t & VT_BTYPE) == VT_LDOUBLE) {
4514 rc = RC_ST0;
4516 #endif
4517 } else if ((type.t & VT_BTYPE) == VT_LLONG) {
4518 /* for long longs, we use fixed registers to avoid having
4519 to handle a complicated move */
4520 rc = RC_IRET;
4523 r2 = gv(rc);
4524 /* this is horrible, but we must also convert first
4525 operand */
4526 tt = gjmp(0);
4527 gsym(u);
4528 /* put again first value and cast it */
4529 *vtop = sv;
4530 gen_cast(&type);
4531 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
4532 gaddrof();
4533 r1 = gv(rc);
4534 move_reg(r2, r1, type.t);
4535 vtop->r = r2;
4536 gsym(tt);
4541 static void expr_eq(void)
4543 int t;
4545 expr_cond();
4546 if (tok == '=' ||
4547 (tok >= TOK_A_MOD && tok <= TOK_A_DIV) ||
4548 tok == TOK_A_XOR || tok == TOK_A_OR ||
4549 tok == TOK_A_SHL || tok == TOK_A_SAR) {
4550 test_lvalue();
4551 t = tok;
4552 next();
4553 if (t == '=') {
4554 expr_eq();
4555 } else {
4556 vdup();
4557 expr_eq();
4558 gen_op(t & 0x7f);
4560 vstore();
4564 ST_FUNC void gexpr(void)
4566 while (1) {
4567 expr_eq();
4568 if (tok != ',')
4569 break;
4570 vpop();
4571 next();
4575 /* parse an expression and return its type without any side effect. */
4576 static void expr_type(CType *type)
4578 int saved_nocode_wanted;
4580 saved_nocode_wanted = nocode_wanted;
4581 nocode_wanted = 1;
4582 gexpr();
4583 *type = vtop->type;
4584 vpop();
4585 nocode_wanted = saved_nocode_wanted;
4588 /* parse a unary expression and return its type without any side
4589 effect. */
4590 static void unary_type(CType *type)
4592 int a;
4594 a = nocode_wanted;
4595 nocode_wanted = 1;
4596 unary();
4597 *type = vtop->type;
4598 vpop();
4599 nocode_wanted = a;
4602 /* parse a constant expression and return value in vtop. */
4603 static void expr_const1(void)
4605 int a;
4606 a = const_wanted;
4607 const_wanted = 1;
4608 expr_cond();
4609 const_wanted = a;
4612 /* parse an integer constant and return its value. */
4613 ST_FUNC int expr_const(void)
4615 int c;
4616 expr_const1();
4617 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
4618 expect("constant expression");
4619 c = vtop->c.i;
4620 vpop();
4621 return c;
4624 /* return the label token if current token is a label, otherwise
4625 return zero */
4626 static int is_label(void)
4628 int last_tok;
4630 /* fast test first */
4631 if (tok < TOK_UIDENT)
4632 return 0;
4633 /* no need to save tokc because tok is an identifier */
4634 last_tok = tok;
4635 next();
4636 if (tok == ':') {
4637 next();
4638 return last_tok;
4639 } else {
4640 unget_tok(last_tok);
4641 return 0;
4645 static void label_or_decl(int l)
4647 int last_tok;
4649 /* fast test first */
4650 if (tok >= TOK_UIDENT)
4652 /* no need to save tokc because tok is an identifier */
4653 last_tok = tok;
4654 next();
4655 if (tok == ':') {
4656 unget_tok(last_tok);
4657 return;
4659 unget_tok(last_tok);
4661 decl(l);
4664 static void block(int *bsym, int *csym, int *case_sym, int *def_sym,
4665 int case_reg, int is_expr)
4667 int a, b, c, d;
4668 Sym *s, *frame_bottom;
4670 /* generate line number info */
4671 if (tcc_state->do_debug &&
4672 (last_line_num != file->line_num || last_ind != ind)) {
4673 put_stabn(N_SLINE, 0, file->line_num, ind - func_ind);
4674 last_ind = ind;
4675 last_line_num = file->line_num;
4678 if (is_expr) {
4679 /* default return value is (void) */
4680 vpushi(0);
4681 vtop->type.t = VT_VOID;
4684 if (tok == TOK_IF) {
4685 /* if test */
4686 next();
4687 skip('(');
4688 gexpr();
4689 skip(')');
4690 a = gvtst(1, 0);
4691 block(bsym, csym, case_sym, def_sym, case_reg, 0);
4692 c = tok;
4693 if (c == TOK_ELSE) {
4694 next();
4695 d = gjmp(0);
4696 gsym(a);
4697 block(bsym, csym, case_sym, def_sym, case_reg, 0);
4698 gsym(d); /* patch else jmp */
4699 } else
4700 gsym(a);
4701 } else if (tok == TOK_WHILE) {
4702 next();
4703 d = ind;
4704 skip('(');
4705 gexpr();
4706 skip(')');
4707 a = gvtst(1, 0);
4708 b = 0;
4709 block(&a, &b, case_sym, def_sym, case_reg, 0);
4710 gjmp_addr(d);
4711 gsym(a);
4712 gsym_addr(b, d);
4713 } else if (tok == '{') {
4714 Sym *llabel;
4715 int block_vla_sp_loc, *saved_vla_sp_loc, saved_vla_flags;
4717 next();
4718 /* record local declaration stack position */
4719 s = local_stack;
4720 frame_bottom = sym_push2(&local_stack, SYM_FIELD, 0, 0);
4721 frame_bottom->next = scope_stack_bottom;
4722 scope_stack_bottom = frame_bottom;
4723 llabel = local_label_stack;
4725 /* save VLA state */
4726 block_vla_sp_loc = *(saved_vla_sp_loc = vla_sp_loc);
4727 if (saved_vla_sp_loc != &vla_sp_root_loc)
4728 vla_sp_loc = &block_vla_sp_loc;
4730 saved_vla_flags = vla_flags;
4731 vla_flags |= VLA_NEED_NEW_FRAME;
4733 /* handle local labels declarations */
4734 if (tok == TOK_LABEL) {
4735 next();
4736 for(;;) {
4737 if (tok < TOK_UIDENT)
4738 expect("label identifier");
4739 label_push(&local_label_stack, tok, LABEL_DECLARED);
4740 next();
4741 if (tok == ',') {
4742 next();
4743 } else {
4744 skip(';');
4745 break;
4749 while (tok != '}') {
4750 label_or_decl(VT_LOCAL);
4751 if (tok != '}') {
4752 if (is_expr)
4753 vpop();
4754 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
4757 /* pop locally defined labels */
4758 label_pop(&local_label_stack, llabel);
4759 if(is_expr) {
4760 /* XXX: this solution makes only valgrind happy...
4761 triggered by gcc.c-torture/execute/20000917-1.c */
4762 Sym *p;
4763 switch(vtop->type.t & VT_BTYPE) {
4764 case VT_PTR:
4765 case VT_STRUCT:
4766 case VT_ENUM:
4767 case VT_FUNC:
4768 for(p=vtop->type.ref;p;p=p->prev)
4769 if(p->prev==s)
4770 tcc_error("unsupported expression type");
4773 /* pop locally defined symbols */
4774 scope_stack_bottom = scope_stack_bottom->next;
4775 sym_pop(&local_stack, s);
4777 /* Pop VLA frames and restore stack pointer if required */
4778 if (saved_vla_sp_loc != &vla_sp_root_loc)
4779 *saved_vla_sp_loc = block_vla_sp_loc;
4780 if (vla_sp_loc != (saved_vla_sp_loc == &vla_sp_root_loc ? &vla_sp_root_loc : &block_vla_sp_loc)) {
4781 vla_sp_loc = saved_vla_sp_loc;
4782 gen_vla_sp_restore(*vla_sp_loc);
4784 vla_flags = (vla_flags & ~VLA_SCOPE_FLAGS) | (saved_vla_flags & VLA_SCOPE_FLAGS);
4786 next();
4787 } else if (tok == TOK_RETURN) {
4788 next();
4789 if (tok != ';') {
4790 gexpr();
4791 gen_assign_cast(&func_vt);
4792 #ifdef TCC_TARGET_ARM64
4793 // Perhaps it would be better to use this for all backends:
4794 greturn();
4795 #else
4796 if ((func_vt.t & VT_BTYPE) == VT_STRUCT) {
4797 CType type, ret_type;
4798 int ret_align, ret_nregs;
4799 ret_nregs = gfunc_sret(&func_vt, func_var, &ret_type,
4800 &ret_align);
4801 if (0 == ret_nregs) {
4802 /* if returning structure, must copy it to implicit
4803 first pointer arg location */
4804 type = func_vt;
4805 mk_pointer(&type);
4806 vset(&type, VT_LOCAL | VT_LVAL, func_vc);
4807 indir();
4808 vswap();
4809 /* copy structure value to pointer */
4810 vstore();
4811 } else {
4812 /* returning structure packed into registers */
4813 int r, size, addr, align;
4814 size = type_size(&func_vt,&align);
4815 if ((vtop->r != (VT_LOCAL | VT_LVAL) || (vtop->c.i & (ret_align-1)))
4816 && (align & (ret_align-1))) {
4817 loc = (loc - size) & -align;
4818 addr = loc;
4819 type = func_vt;
4820 vset(&type, VT_LOCAL | VT_LVAL, addr);
4821 vswap();
4822 vstore();
4823 vset(&ret_type, VT_LOCAL | VT_LVAL, addr);
4825 vtop->type = ret_type;
4826 if (is_float(ret_type.t))
4827 r = rc_fret(ret_type.t);
4828 else
4829 r = RC_IRET;
4831 for (;;) {
4832 gv(r);
4833 if (--ret_nregs == 0)
4834 break;
4835 /* We assume that when a structure is returned in multiple
4836 registers, their classes are consecutive values of the
4837 suite s(n) = 2^n */
4838 r <<= 1;
4839 /* XXX: compatible with arm only: ret_align == register_size */
4840 vtop->c.i += ret_align;
4841 vtop->r = VT_LOCAL | VT_LVAL;
4844 } else if (is_float(func_vt.t)) {
4845 gv(rc_fret(func_vt.t));
4846 } else {
4847 gv(RC_IRET);
4849 #endif
4850 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
4852 skip(';');
4853 rsym = gjmp(rsym); /* jmp */
4854 } else if (tok == TOK_BREAK) {
4855 /* compute jump */
4856 if (!bsym)
4857 tcc_error("cannot break");
4858 *bsym = gjmp(*bsym);
4859 next();
4860 skip(';');
4861 } else if (tok == TOK_CONTINUE) {
4862 /* compute jump */
4863 if (!csym)
4864 tcc_error("cannot continue");
4865 *csym = gjmp(*csym);
4866 next();
4867 skip(';');
4868 } else if (tok == TOK_FOR) {
4869 int e;
4870 next();
4871 skip('(');
4872 s = local_stack;
4873 frame_bottom = sym_push2(&local_stack, SYM_FIELD, 0, 0);
4874 frame_bottom->next = scope_stack_bottom;
4875 scope_stack_bottom = frame_bottom;
4876 if (tok != ';') {
4877 /* c99 for-loop init decl? */
4878 if (!decl0(VT_LOCAL, 1)) {
4879 /* no, regular for-loop init expr */
4880 gexpr();
4881 vpop();
4884 skip(';');
4885 d = ind;
4886 c = ind;
4887 a = 0;
4888 b = 0;
4889 if (tok != ';') {
4890 gexpr();
4891 a = gvtst(1, 0);
4893 skip(';');
4894 if (tok != ')') {
4895 e = gjmp(0);
4896 c = ind;
4897 gexpr();
4898 vpop();
4899 gjmp_addr(d);
4900 gsym(e);
4902 skip(')');
4903 block(&a, &b, case_sym, def_sym, case_reg, 0);
4904 gjmp_addr(c);
4905 gsym(a);
4906 gsym_addr(b, c);
4907 scope_stack_bottom = scope_stack_bottom->next;
4908 sym_pop(&local_stack, s);
4909 } else
4910 if (tok == TOK_DO) {
4911 next();
4912 a = 0;
4913 b = 0;
4914 d = ind;
4915 block(&a, &b, case_sym, def_sym, case_reg, 0);
4916 skip(TOK_WHILE);
4917 skip('(');
4918 gsym(b);
4919 gexpr();
4920 c = gvtst(0, 0);
4921 gsym_addr(c, d);
4922 skip(')');
4923 gsym(a);
4924 skip(';');
4925 } else
4926 if (tok == TOK_SWITCH) {
4927 next();
4928 skip('(');
4929 gexpr();
4930 /* XXX: other types than integer */
4931 case_reg = gv(RC_INT);
4932 vpop();
4933 skip(')');
4934 a = 0;
4935 b = gjmp(0); /* jump to first case */
4936 c = 0;
4937 block(&a, csym, &b, &c, case_reg, 0);
4938 /* if no default, jmp after switch */
4939 if (c == 0)
4940 c = ind;
4941 /* default label */
4942 gsym_addr(b, c);
4943 /* break label */
4944 gsym(a);
4945 } else
4946 if (tok == TOK_CASE) {
4947 int v1, v2;
4948 if (!case_sym)
4949 expect("switch");
4950 next();
4951 v1 = expr_const();
4952 v2 = v1;
4953 if (gnu_ext && tok == TOK_DOTS) {
4954 next();
4955 v2 = expr_const();
4956 if (v2 < v1)
4957 tcc_warning("empty case range");
4959 /* since a case is like a label, we must skip it with a jmp */
4960 b = gjmp(0);
4961 gsym(*case_sym);
4962 vseti(case_reg, 0);
4963 vdup();
4964 vpushi(v1);
4965 if (v1 == v2) {
4966 gen_op(TOK_EQ);
4967 *case_sym = gtst(1, 0);
4968 } else {
4969 gen_op(TOK_GE);
4970 *case_sym = gtst(1, 0);
4971 vseti(case_reg, 0);
4972 vpushi(v2);
4973 gen_op(TOK_LE);
4974 *case_sym = gtst(1, *case_sym);
4976 case_reg = gv(RC_INT);
4977 vpop();
4978 gsym(b);
4979 skip(':');
4980 is_expr = 0;
4981 goto block_after_label;
4982 } else
4983 if (tok == TOK_DEFAULT) {
4984 next();
4985 skip(':');
4986 if (!def_sym)
4987 expect("switch");
4988 if (*def_sym)
4989 tcc_error("too many 'default'");
4990 *def_sym = ind;
4991 is_expr = 0;
4992 goto block_after_label;
4993 } else
4994 if (tok == TOK_GOTO) {
4995 next();
4996 if (tok == '*' && gnu_ext) {
4997 /* computed goto */
4998 next();
4999 gexpr();
5000 if ((vtop->type.t & VT_BTYPE) != VT_PTR)
5001 expect("pointer");
5002 ggoto();
5003 } else if (tok >= TOK_UIDENT) {
5004 s = label_find(tok);
5005 /* put forward definition if needed */
5006 if (!s) {
5007 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
5008 } else {
5009 if (s->r == LABEL_DECLARED)
5010 s->r = LABEL_FORWARD;
5012 /* label already defined */
5013 if (vla_flags & VLA_IN_SCOPE) {
5014 /* If VLAs are in use, save the current stack pointer and
5015 reset the stack pointer to what it was at function entry
5016 (label will restore stack pointer in inner scopes) */
5017 vla_sp_save();
5018 gen_vla_sp_restore(vla_sp_root_loc);
5020 if (s->r & LABEL_FORWARD)
5021 s->jnext = gjmp(s->jnext);
5022 else
5023 gjmp_addr(s->jnext);
5024 next();
5025 } else {
5026 expect("label identifier");
5028 skip(';');
5029 } else if (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3) {
5030 asm_instr();
5031 } else {
5032 b = is_label();
5033 if (b) {
5034 /* label case */
5035 if (vla_flags & VLA_IN_SCOPE) {
5036 /* save/restore stack pointer across label
5037 this is a no-op when combined with the load immediately
5038 after the label unless we arrive via goto */
5039 vla_sp_save();
5041 s = label_find(b);
5042 if (s) {
5043 if (s->r == LABEL_DEFINED)
5044 tcc_error("duplicate label '%s'", get_tok_str(s->v, NULL));
5045 gsym(s->jnext);
5046 s->r = LABEL_DEFINED;
5047 } else {
5048 s = label_push(&global_label_stack, b, LABEL_DEFINED);
5050 s->jnext = ind;
5051 if (vla_flags & VLA_IN_SCOPE) {
5052 gen_vla_sp_restore(*vla_sp_loc);
5053 vla_flags |= VLA_NEED_NEW_FRAME;
5055 /* we accept this, but it is a mistake */
5056 block_after_label:
5057 if (tok == '}') {
5058 tcc_warning("deprecated use of label at end of compound statement");
5059 } else {
5060 if (is_expr)
5061 vpop();
5062 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
5064 } else {
5065 /* expression case */
5066 if (tok != ';') {
5067 if (is_expr) {
5068 vpop();
5069 gexpr();
5070 } else {
5071 gexpr();
5072 vpop();
5075 skip(';');
5080 /* t is the array or struct type. c is the array or struct
5081 address. cur_index/cur_field is the pointer to the current
5082 value. 'size_only' is true if only size info is needed (only used
5083 in arrays) */
5084 static void decl_designator(CType *type, Section *sec, unsigned long c,
5085 int *cur_index, Sym **cur_field,
5086 int size_only)
5088 Sym *s, *f;
5089 int notfirst, index, index_last, align, l, nb_elems, elem_size;
5090 CType type1;
5092 notfirst = 0;
5093 elem_size = 0;
5094 nb_elems = 1;
5095 if (gnu_ext && (l = is_label()) != 0)
5096 goto struct_field;
5097 while (tok == '[' || tok == '.') {
5098 if (tok == '[') {
5099 if (!(type->t & VT_ARRAY))
5100 expect("array type");
5101 s = type->ref;
5102 next();
5103 index = expr_const();
5104 if (index < 0 || (s->c >= 0 && index >= s->c))
5105 expect("invalid index");
5106 if (tok == TOK_DOTS && gnu_ext) {
5107 next();
5108 index_last = expr_const();
5109 if (index_last < 0 ||
5110 (s->c >= 0 && index_last >= s->c) ||
5111 index_last < index)
5112 expect("invalid index");
5113 } else {
5114 index_last = index;
5116 skip(']');
5117 if (!notfirst)
5118 *cur_index = index_last;
5119 type = pointed_type(type);
5120 elem_size = type_size(type, &align);
5121 c += index * elem_size;
5122 /* NOTE: we only support ranges for last designator */
5123 nb_elems = index_last - index + 1;
5124 if (nb_elems != 1) {
5125 notfirst = 1;
5126 break;
5128 } else {
5129 next();
5130 l = tok;
5131 next();
5132 struct_field:
5133 if ((type->t & VT_BTYPE) != VT_STRUCT)
5134 expect("struct/union type");
5135 s = type->ref;
5136 l |= SYM_FIELD;
5137 f = s->next;
5138 while (f) {
5139 if (f->v == l)
5140 break;
5141 f = f->next;
5143 if (!f)
5144 expect("field");
5145 if (!notfirst)
5146 *cur_field = f;
5147 /* XXX: fix this mess by using explicit storage field */
5148 type1 = f->type;
5149 type1.t |= (type->t & ~VT_TYPE);
5150 type = &type1;
5151 c += f->c;
5153 notfirst = 1;
5155 if (notfirst) {
5156 if (tok == '=') {
5157 next();
5158 } else {
5159 if (!gnu_ext)
5160 expect("=");
5162 } else {
5163 if (type->t & VT_ARRAY) {
5164 index = *cur_index;
5165 type = pointed_type(type);
5166 c += index * type_size(type, &align);
5167 } else {
5168 f = *cur_field;
5169 if (!f)
5170 tcc_error("too many field init");
5171 /* XXX: fix this mess by using explicit storage field */
5172 type1 = f->type;
5173 type1.t |= (type->t & ~VT_TYPE);
5174 type = &type1;
5175 c += f->c;
5178 decl_initializer(type, sec, c, 0, size_only);
5180 /* XXX: make it more general */
5181 if (!size_only && nb_elems > 1) {
5182 unsigned long c_end;
5183 uint8_t *src, *dst;
5184 int i;
5186 if (!sec)
5187 tcc_error("range init not supported yet for dynamic storage");
5188 c_end = c + nb_elems * elem_size;
5189 if (c_end > sec->data_allocated)
5190 section_realloc(sec, c_end);
5191 src = sec->data + c;
5192 dst = src;
5193 for(i = 1; i < nb_elems; i++) {
5194 dst += elem_size;
5195 memcpy(dst, src, elem_size);
5200 #define EXPR_VAL 0
5201 #define EXPR_CONST 1
5202 #define EXPR_ANY 2
5204 /* store a value or an expression directly in global data or in local array */
5205 static void init_putv(CType *type, Section *sec, unsigned long c,
5206 int v, int expr_type)
5208 int saved_global_expr, bt, bit_pos, bit_size;
5209 void *ptr;
5210 unsigned long long bit_mask;
5211 CType dtype;
5213 switch(expr_type) {
5214 case EXPR_VAL:
5215 vpushi(v);
5216 break;
5217 case EXPR_CONST:
5218 /* compound literals must be allocated globally in this case */
5219 saved_global_expr = global_expr;
5220 global_expr = 1;
5221 expr_const1();
5222 global_expr = saved_global_expr;
5223 /* NOTE: symbols are accepted */
5224 if ((vtop->r & (VT_VALMASK | VT_LVAL)) != VT_CONST)
5225 tcc_error("initializer element is not constant");
5226 break;
5227 case EXPR_ANY:
5228 expr_eq();
5229 break;
5232 dtype = *type;
5233 dtype.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
5235 if (sec) {
5236 /* XXX: not portable */
5237 /* XXX: generate error if incorrect relocation */
5238 gen_assign_cast(&dtype);
5239 bt = type->t & VT_BTYPE;
5240 /* we'll write at most 16 bytes */
5241 if (c + 16 > sec->data_allocated) {
5242 section_realloc(sec, c + 16);
5244 ptr = sec->data + c;
5245 /* XXX: make code faster ? */
5246 if (!(type->t & VT_BITFIELD)) {
5247 bit_pos = 0;
5248 bit_size = 32;
5249 bit_mask = -1LL;
5250 } else {
5251 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
5252 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
5253 bit_mask = (1LL << bit_size) - 1;
5255 if ((vtop->r & VT_SYM) &&
5256 (bt == VT_BYTE ||
5257 bt == VT_SHORT ||
5258 bt == VT_DOUBLE ||
5259 bt == VT_LDOUBLE ||
5260 bt == VT_LLONG ||
5261 (bt == VT_INT && bit_size != 32)))
5262 tcc_error("initializer element is not computable at load time");
5263 switch(bt) {
5264 /* XXX: when cross-compiling we assume that each type has the
5265 same representation on host and target, which is likely to
5266 be wrong in the case of long double */
5267 case VT_BOOL:
5268 vtop->c.i = (vtop->c.i != 0);
5269 case VT_BYTE:
5270 *(char *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
5271 break;
5272 case VT_SHORT:
5273 *(short *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
5274 break;
5275 case VT_DOUBLE:
5276 *(double *)ptr = vtop->c.d;
5277 break;
5278 case VT_LDOUBLE:
5279 *(long double *)ptr = vtop->c.ld;
5280 break;
5281 case VT_LLONG:
5282 *(long long *)ptr |= (vtop->c.ll & bit_mask) << bit_pos;
5283 break;
5284 case VT_PTR: {
5285 addr_t val = (vtop->c.ptr_offset & bit_mask) << bit_pos;
5286 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
5287 if (vtop->r & VT_SYM)
5288 greloca(sec, vtop->sym, c, R_DATA_PTR, val);
5289 else
5290 *(addr_t *)ptr |= val;
5291 #else
5292 if (vtop->r & VT_SYM)
5293 greloc(sec, vtop->sym, c, R_DATA_PTR);
5294 *(addr_t *)ptr |= val;
5295 #endif
5296 break;
5298 default: {
5299 int val = (vtop->c.i & bit_mask) << bit_pos;
5300 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
5301 if (vtop->r & VT_SYM)
5302 greloca(sec, vtop->sym, c, R_DATA_PTR, val);
5303 else
5304 *(int *)ptr |= val;
5305 #else
5306 if (vtop->r & VT_SYM)
5307 greloc(sec, vtop->sym, c, R_DATA_PTR);
5308 *(int *)ptr |= val;
5309 #endif
5310 break;
5313 vtop--;
5314 } else {
5315 vset(&dtype, VT_LOCAL|VT_LVAL, c);
5316 vswap();
5317 vstore();
5318 vpop();
5322 /* put zeros for variable based init */
5323 static void init_putz(CType *t, Section *sec, unsigned long c, int size)
5325 if (sec) {
5326 /* nothing to do because globals are already set to zero */
5327 } else {
5328 vpush_global_sym(&func_old_type, TOK_memset);
5329 vseti(VT_LOCAL, c);
5330 #ifdef TCC_TARGET_ARM
5331 vpushs(size);
5332 vpushi(0);
5333 #else
5334 vpushi(0);
5335 vpushs(size);
5336 #endif
5337 gfunc_call(3);
5341 /* 't' contains the type and storage info. 'c' is the offset of the
5342 object in section 'sec'. If 'sec' is NULL, it means stack based
5343 allocation. 'first' is true if array '{' must be read (multi
5344 dimension implicit array init handling). 'size_only' is true if
5345 size only evaluation is wanted (only for arrays). */
5346 static void decl_initializer(CType *type, Section *sec, unsigned long c,
5347 int first, int size_only)
5349 int index, array_length, n, no_oblock, nb, parlevel, parlevel1, i;
5350 int size1, align1, expr_type;
5351 Sym *s, *f;
5352 CType *t1;
5354 if (type->t & VT_VLA) {
5355 int a;
5357 /* save current stack pointer */
5358 if (vla_flags & VLA_NEED_NEW_FRAME) {
5359 vla_sp_save();
5360 vla_flags = VLA_IN_SCOPE;
5361 vla_sp_loc = &vla_sp_loc_tmp;
5364 vla_runtime_type_size(type, &a);
5365 gen_vla_alloc(type, a);
5366 vset(type, VT_LOCAL|VT_LVAL, c);
5367 vswap();
5368 vstore();
5369 vpop();
5370 } else if (type->t & VT_ARRAY) {
5371 s = type->ref;
5372 n = s->c;
5373 array_length = 0;
5374 t1 = pointed_type(type);
5375 size1 = type_size(t1, &align1);
5377 no_oblock = 1;
5378 if ((first && tok != TOK_LSTR && tok != TOK_STR) ||
5379 tok == '{') {
5380 if (tok != '{')
5381 tcc_error("character array initializer must be a literal,"
5382 " optionally enclosed in braces");
5383 skip('{');
5384 no_oblock = 0;
5387 /* only parse strings here if correct type (otherwise: handle
5388 them as ((w)char *) expressions */
5389 if ((tok == TOK_LSTR &&
5390 #ifdef TCC_TARGET_PE
5391 (t1->t & VT_BTYPE) == VT_SHORT && (t1->t & VT_UNSIGNED)
5392 #else
5393 (t1->t & VT_BTYPE) == VT_INT
5394 #endif
5395 ) || (tok == TOK_STR && (t1->t & VT_BTYPE) == VT_BYTE)) {
5396 while (tok == TOK_STR || tok == TOK_LSTR) {
5397 int cstr_len, ch;
5398 CString *cstr;
5400 cstr = tokc.cstr;
5401 /* compute maximum number of chars wanted */
5402 if (tok == TOK_STR)
5403 cstr_len = cstr->size;
5404 else
5405 cstr_len = cstr->size / sizeof(nwchar_t);
5406 cstr_len--;
5407 nb = cstr_len;
5408 if (n >= 0 && nb > (n - array_length))
5409 nb = n - array_length;
5410 if (!size_only) {
5411 if (cstr_len > nb)
5412 tcc_warning("initializer-string for array is too long");
5413 /* in order to go faster for common case (char
5414 string in global variable, we handle it
5415 specifically */
5416 if (sec && tok == TOK_STR && size1 == 1) {
5417 memcpy(sec->data + c + array_length, cstr->data, nb);
5418 } else {
5419 for(i=0;i<nb;i++) {
5420 if (tok == TOK_STR)
5421 ch = ((unsigned char *)cstr->data)[i];
5422 else
5423 ch = ((nwchar_t *)cstr->data)[i];
5424 init_putv(t1, sec, c + (array_length + i) * size1,
5425 ch, EXPR_VAL);
5429 array_length += nb;
5430 next();
5432 /* only add trailing zero if enough storage (no
5433 warning in this case since it is standard) */
5434 if (n < 0 || array_length < n) {
5435 if (!size_only) {
5436 init_putv(t1, sec, c + (array_length * size1), 0, EXPR_VAL);
5438 array_length++;
5440 } else {
5441 index = 0;
5442 while (tok != '}') {
5443 decl_designator(type, sec, c, &index, NULL, size_only);
5444 if (n >= 0 && index >= n)
5445 tcc_error("index too large");
5446 /* must put zero in holes (note that doing it that way
5447 ensures that it even works with designators) */
5448 if (!size_only && array_length < index) {
5449 init_putz(t1, sec, c + array_length * size1,
5450 (index - array_length) * size1);
5452 index++;
5453 if (index > array_length)
5454 array_length = index;
5455 /* special test for multi dimensional arrays (may not
5456 be strictly correct if designators are used at the
5457 same time) */
5458 if (index >= n && no_oblock)
5459 break;
5460 if (tok == '}')
5461 break;
5462 skip(',');
5465 if (!no_oblock)
5466 skip('}');
5467 /* put zeros at the end */
5468 if (!size_only && n >= 0 && array_length < n) {
5469 init_putz(t1, sec, c + array_length * size1,
5470 (n - array_length) * size1);
5472 /* patch type size if needed */
5473 if (n < 0)
5474 s->c = array_length;
5475 } else if ((type->t & VT_BTYPE) == VT_STRUCT &&
5476 (sec || !first || tok == '{')) {
5477 int par_count;
5479 /* NOTE: the previous test is a specific case for automatic
5480 struct/union init */
5481 /* XXX: union needs only one init */
5483 /* XXX: this test is incorrect for local initializers
5484 beginning with ( without {. It would be much more difficult
5485 to do it correctly (ideally, the expression parser should
5486 be used in all cases) */
5487 par_count = 0;
5488 if (tok == '(') {
5489 AttributeDef ad1;
5490 CType type1;
5491 next();
5492 while (tok == '(') {
5493 par_count++;
5494 next();
5496 if (!parse_btype(&type1, &ad1))
5497 expect("cast");
5498 type_decl(&type1, &ad1, &n, TYPE_ABSTRACT);
5499 #if 0
5500 if (!is_assignable_types(type, &type1))
5501 tcc_error("invalid type for cast");
5502 #endif
5503 skip(')');
5505 no_oblock = 1;
5506 if (first || tok == '{') {
5507 skip('{');
5508 no_oblock = 0;
5510 s = type->ref;
5511 f = s->next;
5512 array_length = 0;
5513 index = 0;
5514 n = s->c;
5515 while (tok != '}') {
5516 decl_designator(type, sec, c, NULL, &f, size_only);
5517 index = f->c;
5518 if (!size_only && array_length < index) {
5519 init_putz(type, sec, c + array_length,
5520 index - array_length);
5522 index = index + type_size(&f->type, &align1);
5523 if (index > array_length)
5524 array_length = index;
5526 /* gr: skip fields from same union - ugly. */
5527 while (f->next) {
5528 ///printf("index: %2d %08x -- %2d %08x\n", f->c, f->type.t, f->next->c, f->next->type.t);
5529 /* test for same offset */
5530 if (f->next->c != f->c)
5531 break;
5532 /* if yes, test for bitfield shift */
5533 if ((f->type.t & VT_BITFIELD) && (f->next->type.t & VT_BITFIELD)) {
5534 int bit_pos_1 = (f->type.t >> VT_STRUCT_SHIFT) & 0x3f;
5535 int bit_pos_2 = (f->next->type.t >> VT_STRUCT_SHIFT) & 0x3f;
5536 //printf("bitfield %d %d\n", bit_pos_1, bit_pos_2);
5537 if (bit_pos_1 != bit_pos_2)
5538 break;
5540 f = f->next;
5543 f = f->next;
5544 if (no_oblock && f == NULL)
5545 break;
5546 if (tok == '}')
5547 break;
5548 skip(',');
5550 /* put zeros at the end */
5551 if (!size_only && array_length < n) {
5552 init_putz(type, sec, c + array_length,
5553 n - array_length);
5555 if (!no_oblock)
5556 skip('}');
5557 while (par_count) {
5558 skip(')');
5559 par_count--;
5561 } else if (tok == '{') {
5562 next();
5563 decl_initializer(type, sec, c, first, size_only);
5564 skip('}');
5565 } else if (size_only) {
5566 /* just skip expression */
5567 parlevel = parlevel1 = 0;
5568 while ((parlevel > 0 || parlevel1 > 0 ||
5569 (tok != '}' && tok != ',')) && tok != -1) {
5570 if (tok == '(')
5571 parlevel++;
5572 else if (tok == ')')
5573 parlevel--;
5574 else if (tok == '{')
5575 parlevel1++;
5576 else if (tok == '}')
5577 parlevel1--;
5578 next();
5580 } else {
5581 /* currently, we always use constant expression for globals
5582 (may change for scripting case) */
5583 expr_type = EXPR_CONST;
5584 if (!sec)
5585 expr_type = EXPR_ANY;
5586 init_putv(type, sec, c, 0, expr_type);
5590 /* parse an initializer for type 't' if 'has_init' is non zero, and
5591 allocate space in local or global data space ('r' is either
5592 VT_LOCAL or VT_CONST). If 'v' is non zero, then an associated
5593 variable 'v' with an associated name represented by 'asm_label' of
5594 scope 'scope' is declared before initializers are parsed. If 'v' is
5595 zero, then a reference to the new object is put in the value stack.
5596 If 'has_init' is 2, a special parsing is done to handle string
5597 constants. */
5598 static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r,
5599 int has_init, int v, char *asm_label,
5600 int scope)
5602 int size, align, addr, data_offset;
5603 int level;
5604 ParseState saved_parse_state = {0};
5605 TokenString init_str;
5606 Section *sec;
5607 Sym *flexible_array;
5609 flexible_array = NULL;
5610 if ((type->t & VT_BTYPE) == VT_STRUCT) {
5611 Sym *field = type->ref->next;
5612 if (field) {
5613 while (field->next)
5614 field = field->next;
5615 if (field->type.t & VT_ARRAY && field->type.ref->c < 0)
5616 flexible_array = field;
5620 size = type_size(type, &align);
5621 /* If unknown size, we must evaluate it before
5622 evaluating initializers because
5623 initializers can generate global data too
5624 (e.g. string pointers or ISOC99 compound
5625 literals). It also simplifies local
5626 initializers handling */
5627 tok_str_new(&init_str);
5628 if ((size < 0 || flexible_array) && has_init) {
5629 /* get all init string */
5630 if (has_init == 2) {
5631 /* only get strings */
5632 while (tok == TOK_STR || tok == TOK_LSTR) {
5633 tok_str_add_tok(&init_str);
5634 next();
5636 } else {
5637 level = 0;
5638 while (level > 0 || (tok != ',' && tok != ';')) {
5639 if (tok < 0)
5640 tcc_error("unexpected end of file in initializer");
5641 tok_str_add_tok(&init_str);
5642 if (tok == '{')
5643 level++;
5644 else if (tok == '}') {
5645 level--;
5646 if (level <= 0) {
5647 next();
5648 break;
5651 next();
5654 tok_str_add(&init_str, -1);
5655 tok_str_add(&init_str, 0);
5657 /* compute size */
5658 save_parse_state(&saved_parse_state);
5660 macro_ptr = init_str.str;
5661 next();
5662 decl_initializer(type, NULL, 0, 1, 1);
5663 /* prepare second initializer parsing */
5664 macro_ptr = init_str.str;
5665 next();
5667 size = type_size(type, &align);
5670 /* if still unknown size, error */
5671 if (size < 0)
5672 tcc_error("unknown type size");
5674 if (nocode_wanted) {
5675 //tcc_warning("nocode_wanted set for decl_initializer_alloc");
5676 vset(type, r, 0);
5677 goto no_alloc;
5680 if (flexible_array)
5681 size += flexible_array->type.ref->c * pointed_size(&flexible_array->type);
5682 /* take into account specified alignment if bigger */
5683 if (ad->a.aligned) {
5684 if (ad->a.aligned > align)
5685 align = ad->a.aligned;
5686 } else if (ad->a.packed) {
5687 align = 1;
5689 if ((r & VT_VALMASK) == VT_LOCAL) {
5690 sec = NULL;
5691 #ifdef CONFIG_TCC_BCHECK
5692 if (tcc_state->do_bounds_check && (type->t & VT_ARRAY)) {
5693 loc--;
5695 #endif
5696 loc = (loc - size) & -align;
5697 addr = loc;
5698 #ifdef CONFIG_TCC_BCHECK
5699 /* handles bounds */
5700 /* XXX: currently, since we do only one pass, we cannot track
5701 '&' operators, so we add only arrays */
5702 if (tcc_state->do_bounds_check && (type->t & VT_ARRAY)) {
5703 unsigned long *bounds_ptr;
5704 /* add padding between regions */
5705 loc--;
5706 /* then add local bound info */
5707 bounds_ptr = section_ptr_add(lbounds_section, 2 * sizeof(unsigned long));
5708 bounds_ptr[0] = addr;
5709 bounds_ptr[1] = size;
5711 #endif
5712 if (v) {
5713 /* local variable */
5714 sym_push(v, type, r, addr);
5715 } else {
5716 /* push local reference */
5717 vset(type, r, addr);
5719 } else {
5720 Sym *sym;
5722 sym = NULL;
5723 if (v && scope == VT_CONST) {
5724 /* see if the symbol was already defined */
5725 sym = sym_find(v);
5726 if (sym) {
5727 if (!is_compatible_types(&sym->type, type))
5728 tcc_error("incompatible types for redefinition of '%s'",
5729 get_tok_str(v, NULL));
5730 if (sym->type.t & VT_EXTERN) {
5731 /* if the variable is extern, it was not allocated */
5732 sym->type.t &= ~VT_EXTERN;
5733 /* set array size if it was omitted in extern
5734 declaration */
5735 if ((sym->type.t & VT_ARRAY) &&
5736 sym->type.ref->c < 0 &&
5737 type->ref->c >= 0)
5738 sym->type.ref->c = type->ref->c;
5739 } else {
5740 /* we accept several definitions of the same
5741 global variable. this is tricky, because we
5742 must play with the SHN_COMMON type of the symbol */
5743 /* XXX: should check if the variable was already
5744 initialized. It is incorrect to initialized it
5745 twice */
5746 /* no init data, we won't add more to the symbol */
5747 if (!has_init)
5748 goto no_alloc;
5753 /* allocate symbol in corresponding section */
5754 sec = ad->section;
5755 if (!sec) {
5756 if (has_init)
5757 sec = data_section;
5758 else if (tcc_state->nocommon)
5759 sec = bss_section;
5761 if (sec) {
5762 data_offset = sec->data_offset;
5763 data_offset = (data_offset + align - 1) & -align;
5764 addr = data_offset;
5765 /* very important to increment global pointer at this time
5766 because initializers themselves can create new initializers */
5767 data_offset += size;
5768 #ifdef CONFIG_TCC_BCHECK
5769 /* add padding if bound check */
5770 if (tcc_state->do_bounds_check)
5771 data_offset++;
5772 #endif
5773 sec->data_offset = data_offset;
5774 /* allocate section space to put the data */
5775 if (sec->sh_type != SHT_NOBITS &&
5776 data_offset > sec->data_allocated)
5777 section_realloc(sec, data_offset);
5778 /* align section if needed */
5779 if (align > sec->sh_addralign)
5780 sec->sh_addralign = align;
5781 } else {
5782 addr = 0; /* avoid warning */
5785 if (v) {
5786 if (scope != VT_CONST || !sym) {
5787 sym = sym_push(v, type, r | VT_SYM, 0);
5788 sym->asm_label = asm_label;
5790 /* update symbol definition */
5791 if (sec) {
5792 put_extern_sym(sym, sec, addr, size);
5793 } else {
5794 ElfW(Sym) *esym;
5795 /* put a common area */
5796 put_extern_sym(sym, NULL, align, size);
5797 /* XXX: find a nicer way */
5798 esym = &((ElfW(Sym) *)symtab_section->data)[sym->c];
5799 esym->st_shndx = SHN_COMMON;
5801 } else {
5802 /* push global reference */
5803 sym = get_sym_ref(type, sec, addr, size);
5804 vpushsym(type, sym);
5806 /* patch symbol weakness */
5807 if (type->t & VT_WEAK)
5808 weaken_symbol(sym);
5809 apply_visibility(sym, type);
5810 #ifdef CONFIG_TCC_BCHECK
5811 /* handles bounds now because the symbol must be defined
5812 before for the relocation */
5813 if (tcc_state->do_bounds_check) {
5814 unsigned long *bounds_ptr;
5816 greloc(bounds_section, sym, bounds_section->data_offset, R_DATA_PTR);
5817 /* then add global bound info */
5818 bounds_ptr = section_ptr_add(bounds_section, 2 * sizeof(long));
5819 bounds_ptr[0] = 0; /* relocated */
5820 bounds_ptr[1] = size;
5822 #endif
5824 if (has_init || (type->t & VT_VLA)) {
5825 decl_initializer(type, sec, addr, 1, 0);
5826 /* patch flexible array member size back to -1, */
5827 /* for possible subsequent similar declarations */
5828 if (flexible_array)
5829 flexible_array->type.ref->c = -1;
5831 no_alloc:
5832 /* restore parse state if needed */
5833 if (init_str.str) {
5834 tok_str_free(init_str.str);
5835 restore_parse_state(&saved_parse_state);
5839 static void put_func_debug(Sym *sym)
5841 char buf[512];
5843 /* stabs info */
5844 /* XXX: we put here a dummy type */
5845 snprintf(buf, sizeof(buf), "%s:%c1",
5846 funcname, sym->type.t & VT_STATIC ? 'f' : 'F');
5847 put_stabs_r(buf, N_FUN, 0, file->line_num, 0,
5848 cur_text_section, sym->c);
5849 /* //gr gdb wants a line at the function */
5850 put_stabn(N_SLINE, 0, file->line_num, 0);
5851 last_ind = 0;
5852 last_line_num = 0;
5855 /* parse an old style function declaration list */
5856 /* XXX: check multiple parameter */
5857 static void func_decl_list(Sym *func_sym)
5859 AttributeDef ad;
5860 int v;
5861 Sym *s;
5862 CType btype, type;
5864 /* parse each declaration */
5865 while (tok != '{' && tok != ';' && tok != ',' && tok != TOK_EOF &&
5866 tok != TOK_ASM1 && tok != TOK_ASM2 && tok != TOK_ASM3) {
5867 if (!parse_btype(&btype, &ad))
5868 expect("declaration list");
5869 if (((btype.t & VT_BTYPE) == VT_ENUM ||
5870 (btype.t & VT_BTYPE) == VT_STRUCT) &&
5871 tok == ';') {
5872 /* we accept no variable after */
5873 } else {
5874 for(;;) {
5875 type = btype;
5876 type_decl(&type, &ad, &v, TYPE_DIRECT);
5877 /* find parameter in function parameter list */
5878 s = func_sym->next;
5879 while (s != NULL) {
5880 if ((s->v & ~SYM_FIELD) == v)
5881 goto found;
5882 s = s->next;
5884 tcc_error("declaration for parameter '%s' but no such parameter",
5885 get_tok_str(v, NULL));
5886 found:
5887 /* check that no storage specifier except 'register' was given */
5888 if (type.t & VT_STORAGE)
5889 tcc_error("storage class specified for '%s'", get_tok_str(v, NULL));
5890 convert_parameter_type(&type);
5891 /* we can add the type (NOTE: it could be local to the function) */
5892 s->type = type;
5893 /* accept other parameters */
5894 if (tok == ',')
5895 next();
5896 else
5897 break;
5900 skip(';');
5904 /* parse a function defined by symbol 'sym' and generate its code in
5905 'cur_text_section' */
5906 static void gen_function(Sym *sym)
5908 ind = cur_text_section->data_offset;
5909 /* NOTE: we patch the symbol size later */
5910 put_extern_sym(sym, cur_text_section, ind, 0);
5911 funcname = get_tok_str(sym->v, NULL);
5912 func_ind = ind;
5913 /* Initialize VLA state */
5914 vla_sp_loc = &vla_sp_root_loc;
5915 vla_flags = VLA_NEED_NEW_FRAME;
5916 /* put debug symbol */
5917 if (tcc_state->do_debug)
5918 put_func_debug(sym);
5919 /* push a dummy symbol to enable local sym storage */
5920 sym_push2(&local_stack, SYM_FIELD, 0, 0);
5921 gfunc_prolog(&sym->type);
5922 #ifdef CONFIG_TCC_BCHECK
5923 if (tcc_state->do_bounds_check
5924 && !strcmp(get_tok_str(sym->v, NULL), "main")) {
5925 int i;
5927 sym = local_stack;
5928 for (i = 0, sym = local_stack; i < 2; i++, sym = sym->prev) {
5929 if (sym->v & SYM_FIELD || sym->prev->v & SYM_FIELD)
5930 break;
5931 vpush_global_sym(&func_old_type, TOK___bound_main_arg);
5932 vset(&sym->type, sym->r, sym->c);
5933 gfunc_call(1);
5936 #endif
5937 rsym = 0;
5938 block(NULL, NULL, NULL, NULL, 0, 0);
5939 gsym(rsym);
5940 gfunc_epilog();
5941 cur_text_section->data_offset = ind;
5942 label_pop(&global_label_stack, NULL);
5943 /* reset local stack */
5944 scope_stack_bottom = NULL;
5945 sym_pop(&local_stack, NULL);
5946 /* end of function */
5947 /* patch symbol size */
5948 ((ElfW(Sym) *)symtab_section->data)[sym->c].st_size =
5949 ind - func_ind;
5950 /* patch symbol weakness (this definition overrules any prototype) */
5951 if (sym->type.t & VT_WEAK)
5952 weaken_symbol(sym);
5953 apply_visibility(sym, &sym->type);
5954 if (tcc_state->do_debug) {
5955 put_stabn(N_FUN, 0, 0, ind - func_ind);
5957 /* It's better to crash than to generate wrong code */
5958 cur_text_section = NULL;
5959 funcname = ""; /* for safety */
5960 func_vt.t = VT_VOID; /* for safety */
5961 func_var = 0; /* for safety */
5962 ind = 0; /* for safety */
5965 ST_FUNC void gen_inline_functions(void)
5967 Sym *sym;
5968 int *str, inline_generated, i;
5969 struct InlineFunc *fn;
5971 /* iterate while inline function are referenced */
5972 for(;;) {
5973 inline_generated = 0;
5974 for (i = 0; i < tcc_state->nb_inline_fns; ++i) {
5975 fn = tcc_state->inline_fns[i];
5976 sym = fn->sym;
5977 if (sym && sym->c) {
5978 /* the function was used: generate its code and
5979 convert it to a normal function */
5980 str = fn->token_str;
5981 fn->sym = NULL;
5982 if (file)
5983 pstrcpy(file->filename, sizeof file->filename, fn->filename);
5984 sym->r = VT_SYM | VT_CONST;
5985 sym->type.t &= ~VT_INLINE;
5987 macro_ptr = str;
5988 next();
5989 cur_text_section = text_section;
5990 gen_function(sym);
5991 macro_ptr = NULL; /* fail safe */
5993 inline_generated = 1;
5996 if (!inline_generated)
5997 break;
5999 for (i = 0; i < tcc_state->nb_inline_fns; ++i) {
6000 fn = tcc_state->inline_fns[i];
6001 str = fn->token_str;
6002 tok_str_free(str);
6004 dynarray_reset(&tcc_state->inline_fns, &tcc_state->nb_inline_fns);
6007 /* 'l' is VT_LOCAL or VT_CONST to define default storage type */
6008 static int decl0(int l, int is_for_loop_init)
6010 int v, has_init, r;
6011 CType type, btype;
6012 Sym *sym;
6013 AttributeDef ad;
6015 while (1) {
6016 if (!parse_btype(&btype, &ad)) {
6017 if (is_for_loop_init)
6018 return 0;
6019 /* skip redundant ';' */
6020 /* XXX: find more elegant solution */
6021 if (tok == ';') {
6022 next();
6023 continue;
6025 if (l == VT_CONST &&
6026 (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
6027 /* global asm block */
6028 asm_global_instr();
6029 continue;
6031 /* special test for old K&R protos without explicit int
6032 type. Only accepted when defining global data */
6033 if (l == VT_LOCAL || tok < TOK_DEFINE)
6034 break;
6035 btype.t = VT_INT;
6037 if (((btype.t & VT_BTYPE) == VT_ENUM ||
6038 (btype.t & VT_BTYPE) == VT_STRUCT) &&
6039 tok == ';') {
6040 /* we accept no variable after */
6041 next();
6042 continue;
6044 while (1) { /* iterate thru each declaration */
6045 char *asm_label; // associated asm label
6046 type = btype;
6047 type_decl(&type, &ad, &v, TYPE_DIRECT);
6048 #if 0
6050 char buf[500];
6051 type_to_str(buf, sizeof(buf), t, get_tok_str(v, NULL));
6052 printf("type = '%s'\n", buf);
6054 #endif
6055 if ((type.t & VT_BTYPE) == VT_FUNC) {
6056 if ((type.t & VT_STATIC) && (l == VT_LOCAL)) {
6057 tcc_error("function without file scope cannot be static");
6059 /* if old style function prototype, we accept a
6060 declaration list */
6061 sym = type.ref;
6062 if (sym->c == FUNC_OLD)
6063 func_decl_list(sym);
6066 asm_label = NULL;
6067 if (gnu_ext && (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
6068 CString astr;
6070 asm_label_instr(&astr);
6071 asm_label = tcc_strdup(astr.data);
6072 cstr_free(&astr);
6074 /* parse one last attribute list, after asm label */
6075 parse_attribute(&ad);
6078 if (ad.a.weak)
6079 type.t |= VT_WEAK;
6080 #ifdef TCC_TARGET_PE
6081 if (ad.a.func_import)
6082 type.t |= VT_IMPORT;
6083 if (ad.a.func_export)
6084 type.t |= VT_EXPORT;
6085 #endif
6086 type.t |= ad.a.visibility << VT_VIS_SHIFT;
6088 if (tok == '{') {
6089 if (l == VT_LOCAL)
6090 tcc_error("cannot use local functions");
6091 if ((type.t & VT_BTYPE) != VT_FUNC)
6092 expect("function definition");
6094 /* reject abstract declarators in function definition */
6095 sym = type.ref;
6096 while ((sym = sym->next) != NULL)
6097 if (!(sym->v & ~SYM_FIELD))
6098 expect("identifier");
6100 /* XXX: cannot do better now: convert extern line to static inline */
6101 if ((type.t & (VT_EXTERN | VT_INLINE)) == (VT_EXTERN | VT_INLINE))
6102 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
6104 sym = sym_find(v);
6105 if (sym) {
6106 Sym *ref;
6107 if ((sym->type.t & VT_BTYPE) != VT_FUNC)
6108 goto func_error1;
6110 ref = sym->type.ref;
6111 if (0 == ref->a.func_proto)
6112 tcc_error("redefinition of '%s'", get_tok_str(v, NULL));
6114 /* use func_call from prototype if not defined */
6115 if (ref->a.func_call != FUNC_CDECL
6116 && type.ref->a.func_call == FUNC_CDECL)
6117 type.ref->a.func_call = ref->a.func_call;
6119 /* use export from prototype */
6120 if (ref->a.func_export)
6121 type.ref->a.func_export = 1;
6123 /* use static from prototype */
6124 if (sym->type.t & VT_STATIC)
6125 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
6127 /* If the definition has no visibility use the
6128 one from prototype. */
6129 if (! (type.t & VT_VIS_MASK))
6130 type.t |= sym->type.t & VT_VIS_MASK;
6132 if (!is_compatible_types(&sym->type, &type)) {
6133 func_error1:
6134 tcc_error("incompatible types for redefinition of '%s'",
6135 get_tok_str(v, NULL));
6137 type.ref->a.func_proto = 0;
6138 /* if symbol is already defined, then put complete type */
6139 sym->type = type;
6140 } else {
6141 /* put function symbol */
6142 sym = global_identifier_push(v, type.t, 0);
6143 sym->type.ref = type.ref;
6146 /* static inline functions are just recorded as a kind
6147 of macro. Their code will be emitted at the end of
6148 the compilation unit only if they are used */
6149 if ((type.t & (VT_INLINE | VT_STATIC)) ==
6150 (VT_INLINE | VT_STATIC)) {
6151 TokenString func_str;
6152 int block_level;
6153 struct InlineFunc *fn;
6154 const char *filename;
6156 tok_str_new(&func_str);
6158 block_level = 0;
6159 for(;;) {
6160 int t;
6161 if (tok == TOK_EOF)
6162 tcc_error("unexpected end of file");
6163 tok_str_add_tok(&func_str);
6164 t = tok;
6165 next();
6166 if (t == '{') {
6167 block_level++;
6168 } else if (t == '}') {
6169 block_level--;
6170 if (block_level == 0)
6171 break;
6174 tok_str_add(&func_str, -1);
6175 tok_str_add(&func_str, 0);
6176 filename = file ? file->filename : "";
6177 fn = tcc_malloc(sizeof *fn + strlen(filename));
6178 strcpy(fn->filename, filename);
6179 fn->sym = sym;
6180 fn->token_str = func_str.str;
6181 dynarray_add((void ***)&tcc_state->inline_fns, &tcc_state->nb_inline_fns, fn);
6183 } else {
6184 /* compute text section */
6185 cur_text_section = ad.section;
6186 if (!cur_text_section)
6187 cur_text_section = text_section;
6188 sym->r = VT_SYM | VT_CONST;
6189 gen_function(sym);
6191 break;
6192 } else {
6193 if (btype.t & VT_TYPEDEF) {
6194 /* save typedefed type */
6195 /* XXX: test storage specifiers ? */
6196 sym = sym_push(v, &type, 0, 0);
6197 sym->a = ad.a;
6198 sym->type.t |= VT_TYPEDEF;
6199 } else {
6200 r = 0;
6201 if ((type.t & VT_BTYPE) == VT_FUNC) {
6202 /* external function definition */
6203 /* specific case for func_call attribute */
6204 ad.a.func_proto = 1;
6205 type.ref->a = ad.a;
6206 } else if (!(type.t & VT_ARRAY)) {
6207 /* not lvalue if array */
6208 r |= lvalue_type(type.t);
6210 has_init = (tok == '=');
6211 if (has_init && (type.t & VT_VLA))
6212 tcc_error("Variable length array cannot be initialized");
6213 if ((btype.t & VT_EXTERN) || ((type.t & VT_BTYPE) == VT_FUNC) ||
6214 ((type.t & VT_ARRAY) && (type.t & VT_STATIC) &&
6215 !has_init && l == VT_CONST && type.ref->c < 0)) {
6216 /* external variable or function */
6217 /* NOTE: as GCC, uninitialized global static
6218 arrays of null size are considered as
6219 extern */
6220 sym = external_sym(v, &type, r, asm_label);
6222 if (ad.alias_target) {
6223 Section tsec;
6224 Elf32_Sym *esym;
6225 Sym *alias_target;
6227 alias_target = sym_find(ad.alias_target);
6228 if (!alias_target || !alias_target->c)
6229 tcc_error("unsupported forward __alias__ attribute");
6230 esym = &((Elf32_Sym *)symtab_section->data)[alias_target->c];
6231 tsec.sh_num = esym->st_shndx;
6232 put_extern_sym2(sym, &tsec, esym->st_value, esym->st_size, 0);
6234 } else {
6235 type.t |= (btype.t & VT_STATIC); /* Retain "static". */
6236 if (type.t & VT_STATIC)
6237 r |= VT_CONST;
6238 else
6239 r |= l;
6240 if (has_init)
6241 next();
6242 decl_initializer_alloc(&type, &ad, r, has_init, v, asm_label, l);
6245 if (tok != ',') {
6246 if (is_for_loop_init)
6247 return 1;
6248 skip(';');
6249 break;
6251 next();
6253 ad.a.aligned = 0;
6256 return 0;
6259 ST_FUNC void decl(int l)
6261 decl0(l, 0);