fix for the array in struct initialization w/o '{', case 2
[tinycc.git] / tccgen.c
blob9a6f3c912b7f0950d9e94163870f10695fb16d35
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, int *par_count_p);
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 if (sbt == VT_VOID && dbt == VT_VOID)
2417 ; /*
2418 It is Ok if both are void
2419 A test program:
2420 void func1() {}
2421 void func2() {
2422 return func1();
2424 gcc accepts this program
2426 else
2427 tcc_error("cannot cast from/to void");
2429 if (dt->t & VT_CONSTANT)
2430 tcc_warning("assignment of read-only location");
2431 switch(dbt) {
2432 case VT_PTR:
2433 /* special cases for pointers */
2434 /* '0' can also be a pointer */
2435 if (is_null_pointer(vtop))
2436 goto type_ok;
2437 /* accept implicit pointer to integer cast with warning */
2438 if (is_integer_btype(sbt)) {
2439 tcc_warning("assignment makes pointer from integer without a cast");
2440 goto type_ok;
2442 type1 = pointed_type(dt);
2443 /* a function is implicitely a function pointer */
2444 if (sbt == VT_FUNC) {
2445 if ((type1->t & VT_BTYPE) != VT_VOID &&
2446 !is_compatible_types(pointed_type(dt), st))
2447 tcc_warning("assignment from incompatible pointer type");
2448 goto type_ok;
2450 if (sbt != VT_PTR)
2451 goto error;
2452 type2 = pointed_type(st);
2453 if ((type1->t & VT_BTYPE) == VT_VOID ||
2454 (type2->t & VT_BTYPE) == VT_VOID) {
2455 /* void * can match anything */
2456 } else {
2457 /* exact type match, except for unsigned */
2458 tmp_type1 = *type1;
2459 tmp_type2 = *type2;
2460 tmp_type1.t &= ~(VT_DEFSIGN | VT_UNSIGNED | VT_CONSTANT |
2461 VT_VOLATILE);
2462 tmp_type2.t &= ~(VT_DEFSIGN | VT_UNSIGNED | VT_CONSTANT |
2463 VT_VOLATILE);
2464 if (!is_compatible_types(&tmp_type1, &tmp_type2))
2465 tcc_warning("assignment from incompatible pointer type");
2467 /* check const and volatile */
2468 if ((!(type1->t & VT_CONSTANT) && (type2->t & VT_CONSTANT)) ||
2469 (!(type1->t & VT_VOLATILE) && (type2->t & VT_VOLATILE)))
2470 tcc_warning("assignment discards qualifiers from pointer target type");
2471 break;
2472 case VT_BYTE:
2473 case VT_SHORT:
2474 case VT_INT:
2475 case VT_LLONG:
2476 if (sbt == VT_PTR || sbt == VT_FUNC) {
2477 tcc_warning("assignment makes integer from pointer without a cast");
2479 /* XXX: more tests */
2480 break;
2481 case VT_STRUCT:
2482 tmp_type1 = *dt;
2483 tmp_type2 = *st;
2484 tmp_type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
2485 tmp_type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
2486 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
2487 error:
2488 type_to_str(buf1, sizeof(buf1), st, NULL);
2489 type_to_str(buf2, sizeof(buf2), dt, NULL);
2490 tcc_error("cannot cast '%s' to '%s'", buf1, buf2);
2492 break;
2494 type_ok:
2495 gen_cast(dt);
2498 /* store vtop in lvalue pushed on stack */
2499 ST_FUNC void vstore(void)
2501 int sbt, dbt, ft, r, t, size, align, bit_size, bit_pos, rc, delayed_cast;
2503 ft = vtop[-1].type.t;
2504 sbt = vtop->type.t & VT_BTYPE;
2505 dbt = ft & VT_BTYPE;
2506 if ((((sbt == VT_INT || sbt == VT_SHORT) && dbt == VT_BYTE) ||
2507 (sbt == VT_INT && dbt == VT_SHORT))
2508 && !(vtop->type.t & VT_BITFIELD)) {
2509 /* optimize char/short casts */
2510 delayed_cast = VT_MUSTCAST;
2511 vtop->type.t = ft & (VT_TYPE & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT)));
2512 /* XXX: factorize */
2513 if (ft & VT_CONSTANT)
2514 tcc_warning("assignment of read-only location");
2515 } else {
2516 delayed_cast = 0;
2517 if (!(ft & VT_BITFIELD))
2518 gen_assign_cast(&vtop[-1].type);
2521 if (sbt == VT_STRUCT) {
2522 /* if structure, only generate pointer */
2523 /* structure assignment : generate memcpy */
2524 /* XXX: optimize if small size */
2525 if (!nocode_wanted) {
2526 size = type_size(&vtop->type, &align);
2528 /* destination */
2529 vswap();
2530 vtop->type.t = VT_PTR;
2531 gaddrof();
2533 /* address of memcpy() */
2534 #ifdef TCC_ARM_EABI
2535 if(!(align & 7))
2536 vpush_global_sym(&func_old_type, TOK_memcpy8);
2537 else if(!(align & 3))
2538 vpush_global_sym(&func_old_type, TOK_memcpy4);
2539 else
2540 #endif
2541 vpush_global_sym(&func_old_type, TOK_memcpy);
2543 vswap();
2544 /* source */
2545 vpushv(vtop - 2);
2546 vtop->type.t = VT_PTR;
2547 gaddrof();
2548 /* type size */
2549 vpushi(size);
2550 gfunc_call(3);
2551 } else {
2552 vswap();
2553 vpop();
2555 /* leave source on stack */
2556 } else if (ft & VT_BITFIELD) {
2557 /* bitfield store handling */
2559 /* save lvalue as expression result (example: s.b = s.a = n;) */
2560 vdup(), vtop[-1] = vtop[-2];
2562 bit_pos = (ft >> VT_STRUCT_SHIFT) & 0x3f;
2563 bit_size = (ft >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
2564 /* remove bit field info to avoid loops */
2565 vtop[-1].type.t = ft & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT));
2567 if((ft & VT_BTYPE) == VT_BOOL) {
2568 gen_cast(&vtop[-1].type);
2569 vtop[-1].type.t = (vtop[-1].type.t & ~VT_BTYPE) | (VT_BYTE | VT_UNSIGNED);
2572 /* duplicate destination */
2573 vdup();
2574 vtop[-1] = vtop[-2];
2576 /* mask and shift source */
2577 if((ft & VT_BTYPE) != VT_BOOL) {
2578 if((ft & VT_BTYPE) == VT_LLONG) {
2579 vpushll((1ULL << bit_size) - 1ULL);
2580 } else {
2581 vpushi((1 << bit_size) - 1);
2583 gen_op('&');
2585 vpushi(bit_pos);
2586 gen_op(TOK_SHL);
2587 /* load destination, mask and or with source */
2588 vswap();
2589 if((ft & VT_BTYPE) == VT_LLONG) {
2590 vpushll(~(((1ULL << bit_size) - 1ULL) << bit_pos));
2591 } else {
2592 vpushi(~(((1 << bit_size) - 1) << bit_pos));
2594 gen_op('&');
2595 gen_op('|');
2596 /* store result */
2597 vstore();
2598 /* ... and discard */
2599 vpop();
2601 } else {
2602 #ifdef CONFIG_TCC_BCHECK
2603 /* bound check case */
2604 if (vtop[-1].r & VT_MUSTBOUND) {
2605 vswap();
2606 gbound();
2607 vswap();
2609 #endif
2610 if (!nocode_wanted) {
2611 rc = RC_INT;
2612 if (is_float(ft)) {
2613 rc = RC_FLOAT;
2614 #ifdef TCC_TARGET_X86_64
2615 if ((ft & VT_BTYPE) == VT_LDOUBLE) {
2616 rc = RC_ST0;
2617 } else if ((ft & VT_BTYPE) == VT_QFLOAT) {
2618 rc = RC_FRET;
2620 #endif
2622 r = gv(rc); /* generate value */
2623 /* if lvalue was saved on stack, must read it */
2624 if ((vtop[-1].r & VT_VALMASK) == VT_LLOCAL) {
2625 SValue sv;
2626 t = get_reg(RC_INT);
2627 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
2628 sv.type.t = VT_PTR;
2629 #else
2630 sv.type.t = VT_INT;
2631 #endif
2632 sv.r = VT_LOCAL | VT_LVAL;
2633 sv.c.ul = vtop[-1].c.ul;
2634 load(t, &sv);
2635 vtop[-1].r = t | VT_LVAL;
2637 /* two word case handling : store second register at word + 4 (or +8 for x86-64) */
2638 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
2639 if (((ft & VT_BTYPE) == VT_QLONG) || ((ft & VT_BTYPE) == VT_QFLOAT)) {
2640 int addr_type = VT_LLONG, load_size = 8, load_type = ((vtop->type.t & VT_BTYPE) == VT_QLONG) ? VT_LLONG : VT_DOUBLE;
2641 #else
2642 if ((ft & VT_BTYPE) == VT_LLONG) {
2643 int addr_type = VT_INT, load_size = 4, load_type = VT_INT;
2644 #endif
2645 vtop[-1].type.t = load_type;
2646 store(r, vtop - 1);
2647 vswap();
2648 /* convert to int to increment easily */
2649 vtop->type.t = addr_type;
2650 gaddrof();
2651 vpushi(load_size);
2652 gen_op('+');
2653 vtop->r |= VT_LVAL;
2654 vswap();
2655 vtop[-1].type.t = load_type;
2656 /* XXX: it works because r2 is spilled last ! */
2657 store(vtop->r2, vtop - 1);
2658 } else {
2659 store(r, vtop - 1);
2662 vswap();
2663 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
2664 vtop->r |= delayed_cast;
2668 /* post defines POST/PRE add. c is the token ++ or -- */
2669 ST_FUNC void inc(int post, int c)
2671 test_lvalue();
2672 vdup(); /* save lvalue */
2673 if (post) {
2674 gv_dup(); /* duplicate value */
2675 vrotb(3);
2676 vrotb(3);
2678 /* add constant */
2679 vpushi(c - TOK_MID);
2680 gen_op('+');
2681 vstore(); /* store value */
2682 if (post)
2683 vpop(); /* if post op, return saved value */
2686 /* Parse GNUC __attribute__ extension. Currently, the following
2687 extensions are recognized:
2688 - aligned(n) : set data/function alignment.
2689 - packed : force data alignment to 1
2690 - section(x) : generate data/code in this section.
2691 - unused : currently ignored, but may be used someday.
2692 - regparm(n) : pass function parameters in registers (i386 only)
2694 static void parse_attribute(AttributeDef *ad)
2696 int t, n;
2698 while (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) {
2699 next();
2700 skip('(');
2701 skip('(');
2702 while (tok != ')') {
2703 if (tok < TOK_IDENT)
2704 expect("attribute name");
2705 t = tok;
2706 next();
2707 switch(t) {
2708 case TOK_SECTION1:
2709 case TOK_SECTION2:
2710 skip('(');
2711 if (tok != TOK_STR)
2712 expect("section name");
2713 ad->section = find_section(tcc_state, (char *)tokc.cstr->data);
2714 next();
2715 skip(')');
2716 break;
2717 case TOK_ALIAS1:
2718 case TOK_ALIAS2:
2719 skip('(');
2720 if (tok != TOK_STR)
2721 expect("alias(\"target\")");
2722 ad->alias_target = /* save string as token, for later */
2723 tok_alloc((char*)tokc.cstr->data, tokc.cstr->size-1)->tok;
2724 next();
2725 skip(')');
2726 break;
2727 case TOK_VISIBILITY1:
2728 case TOK_VISIBILITY2:
2729 skip('(');
2730 if (tok != TOK_STR)
2731 expect("visibility(\"default|hidden|internal|protected\")");
2732 if (!strcmp (tokc.cstr->data, "default"))
2733 ad->a.visibility = STV_DEFAULT;
2734 else if (!strcmp (tokc.cstr->data, "hidden"))
2735 ad->a.visibility = STV_HIDDEN;
2736 else if (!strcmp (tokc.cstr->data, "internal"))
2737 ad->a.visibility = STV_INTERNAL;
2738 else if (!strcmp (tokc.cstr->data, "protected"))
2739 ad->a.visibility = STV_PROTECTED;
2740 else
2741 expect("visibility(\"default|hidden|internal|protected\")");
2742 next();
2743 skip(')');
2744 break;
2745 case TOK_ALIGNED1:
2746 case TOK_ALIGNED2:
2747 if (tok == '(') {
2748 next();
2749 n = expr_const();
2750 if (n <= 0 || (n & (n - 1)) != 0)
2751 tcc_error("alignment must be a positive power of two");
2752 skip(')');
2753 } else {
2754 n = MAX_ALIGN;
2756 ad->a.aligned = n;
2757 break;
2758 case TOK_PACKED1:
2759 case TOK_PACKED2:
2760 ad->a.packed = 1;
2761 break;
2762 case TOK_WEAK1:
2763 case TOK_WEAK2:
2764 ad->a.weak = 1;
2765 break;
2766 case TOK_UNUSED1:
2767 case TOK_UNUSED2:
2768 /* currently, no need to handle it because tcc does not
2769 track unused objects */
2770 break;
2771 case TOK_NORETURN1:
2772 case TOK_NORETURN2:
2773 /* currently, no need to handle it because tcc does not
2774 track unused objects */
2775 break;
2776 case TOK_CDECL1:
2777 case TOK_CDECL2:
2778 case TOK_CDECL3:
2779 ad->a.func_call = FUNC_CDECL;
2780 break;
2781 case TOK_STDCALL1:
2782 case TOK_STDCALL2:
2783 case TOK_STDCALL3:
2784 ad->a.func_call = FUNC_STDCALL;
2785 break;
2786 #ifdef TCC_TARGET_I386
2787 case TOK_REGPARM1:
2788 case TOK_REGPARM2:
2789 skip('(');
2790 n = expr_const();
2791 if (n > 3)
2792 n = 3;
2793 else if (n < 0)
2794 n = 0;
2795 if (n > 0)
2796 ad->a.func_call = FUNC_FASTCALL1 + n - 1;
2797 skip(')');
2798 break;
2799 case TOK_FASTCALL1:
2800 case TOK_FASTCALL2:
2801 case TOK_FASTCALL3:
2802 ad->a.func_call = FUNC_FASTCALLW;
2803 break;
2804 #endif
2805 case TOK_MODE:
2806 skip('(');
2807 switch(tok) {
2808 case TOK_MODE_DI:
2809 ad->a.mode = VT_LLONG + 1;
2810 break;
2811 case TOK_MODE_HI:
2812 ad->a.mode = VT_SHORT + 1;
2813 break;
2814 case TOK_MODE_SI:
2815 ad->a.mode = VT_INT + 1;
2816 break;
2817 default:
2818 tcc_warning("__mode__(%s) not supported\n", get_tok_str(tok, NULL));
2819 break;
2821 next();
2822 skip(')');
2823 break;
2824 case TOK_DLLEXPORT:
2825 ad->a.func_export = 1;
2826 break;
2827 case TOK_DLLIMPORT:
2828 ad->a.func_import = 1;
2829 break;
2830 default:
2831 if (tcc_state->warn_unsupported)
2832 tcc_warning("'%s' attribute ignored", get_tok_str(t, NULL));
2833 /* skip parameters */
2834 if (tok == '(') {
2835 int parenthesis = 0;
2836 do {
2837 if (tok == '(')
2838 parenthesis++;
2839 else if (tok == ')')
2840 parenthesis--;
2841 next();
2842 } while (parenthesis && tok != -1);
2844 break;
2846 if (tok != ',')
2847 break;
2848 next();
2850 skip(')');
2851 skip(')');
2855 /* enum/struct/union declaration. u is either VT_ENUM or VT_STRUCT */
2856 static void struct_decl(CType *type, int u, int tdef)
2858 int a, v, size, align, maxalign, c, offset, flexible;
2859 int bit_size, bit_pos, bsize, bt, lbit_pos, prevbt;
2860 Sym *s, *ss, *ass, **ps;
2861 AttributeDef ad;
2862 CType type1, btype;
2864 a = tok; /* save decl type */
2865 next();
2866 if (tok != '{') {
2867 v = tok;
2868 next();
2869 /* struct already defined ? return it */
2870 if (v < TOK_IDENT)
2871 expect("struct/union/enum name");
2872 s = struct_find(v);
2873 if (s) {
2874 if (s->type.t != a)
2875 tcc_error("invalid type");
2876 goto do_decl;
2877 } else if (tok >= TOK_IDENT && !tdef)
2878 tcc_error("unknown struct/union/enum");
2879 } else {
2880 v = anon_sym++;
2882 type1.t = a;
2883 type1.ref = NULL;
2884 /* we put an undefined size for struct/union */
2885 s = sym_push(v | SYM_STRUCT, &type1, 0, -1);
2886 s->r = 0; /* default alignment is zero as gcc */
2887 /* put struct/union/enum name in type */
2888 do_decl:
2889 type->t = u;
2890 type->ref = s;
2892 if (tok == '{') {
2893 next();
2894 if (s->c != -1)
2895 tcc_error("struct/union/enum already defined");
2896 /* cannot be empty */
2897 c = 0;
2898 /* non empty enums are not allowed */
2899 if (a == TOK_ENUM) {
2900 for(;;) {
2901 v = tok;
2902 if (v < TOK_UIDENT)
2903 expect("identifier");
2904 ss = sym_find(v);
2905 if (ss && !local_stack)
2906 tcc_error("redefinition of enumerator '%s'",
2907 get_tok_str(v, NULL));
2908 next();
2909 if (tok == '=') {
2910 next();
2911 c = expr_const();
2913 /* enum symbols have static storage */
2914 ss = sym_push(v, &int_type, VT_CONST, c);
2915 ss->type.t |= VT_STATIC;
2916 if (tok != ',')
2917 break;
2918 next();
2919 c++;
2920 /* NOTE: we accept a trailing comma */
2921 if (tok == '}')
2922 break;
2924 s->c = type_size(&int_type, &align);
2925 skip('}');
2926 } else {
2927 maxalign = 1;
2928 ps = &s->next;
2929 prevbt = VT_INT;
2930 bit_pos = 0;
2931 offset = 0;
2932 flexible = 0;
2933 while (tok != '}') {
2934 parse_btype(&btype, &ad);
2935 while (1) {
2936 if (flexible)
2937 tcc_error("flexible array member '%s' not at the end of struct",
2938 get_tok_str(v, NULL));
2939 bit_size = -1;
2940 v = 0;
2941 type1 = btype;
2942 if (tok != ':') {
2943 type_decl(&type1, &ad, &v, TYPE_DIRECT | TYPE_ABSTRACT);
2944 if (v == 0 && (type1.t & VT_BTYPE) != VT_STRUCT)
2945 expect("identifier");
2946 if (type_size(&type1, &align) < 0) {
2947 if ((a == TOK_STRUCT) && (type1.t & VT_ARRAY) && c)
2948 flexible = 1;
2949 else
2950 tcc_error("field '%s' has incomplete type",
2951 get_tok_str(v, NULL));
2953 if ((type1.t & VT_BTYPE) == VT_FUNC ||
2954 (type1.t & (VT_TYPEDEF | VT_STATIC | VT_EXTERN | VT_INLINE)))
2955 tcc_error("invalid type for '%s'",
2956 get_tok_str(v, NULL));
2958 if (tok == ':') {
2959 next();
2960 bit_size = expr_const();
2961 /* XXX: handle v = 0 case for messages */
2962 if (bit_size < 0)
2963 tcc_error("negative width in bit-field '%s'",
2964 get_tok_str(v, NULL));
2965 if (v && bit_size == 0)
2966 tcc_error("zero width for bit-field '%s'",
2967 get_tok_str(v, NULL));
2969 size = type_size(&type1, &align);
2970 if (ad.a.aligned) {
2971 if (align < ad.a.aligned)
2972 align = ad.a.aligned;
2973 } else if (ad.a.packed) {
2974 align = 1;
2975 } else if (*tcc_state->pack_stack_ptr) {
2976 if (align > *tcc_state->pack_stack_ptr)
2977 align = *tcc_state->pack_stack_ptr;
2979 lbit_pos = 0;
2980 if (bit_size >= 0) {
2981 bt = type1.t & VT_BTYPE;
2982 if (bt != VT_INT &&
2983 bt != VT_BYTE &&
2984 bt != VT_SHORT &&
2985 bt != VT_BOOL &&
2986 bt != VT_ENUM &&
2987 bt != VT_LLONG)
2988 tcc_error("bitfields must have scalar type");
2989 bsize = size * 8;
2990 if (bit_size > bsize) {
2991 tcc_error("width of '%s' exceeds its type",
2992 get_tok_str(v, NULL));
2993 } else if (bit_size == bsize) {
2994 /* no need for bit fields */
2995 bit_pos = 0;
2996 } else if (bit_size == 0) {
2997 /* XXX: what to do if only padding in a
2998 structure ? */
2999 /* zero size: means to pad */
3000 bit_pos = 0;
3001 } else {
3002 /* we do not have enough room ?
3003 did the type change?
3004 is it a union? */
3005 if ((bit_pos + bit_size) > bsize ||
3006 bt != prevbt || a == TOK_UNION)
3007 bit_pos = 0;
3008 lbit_pos = bit_pos;
3009 /* XXX: handle LSB first */
3010 type1.t |= VT_BITFIELD |
3011 (bit_pos << VT_STRUCT_SHIFT) |
3012 (bit_size << (VT_STRUCT_SHIFT + 6));
3013 bit_pos += bit_size;
3015 prevbt = bt;
3016 } else {
3017 bit_pos = 0;
3019 if (v != 0 || (type1.t & VT_BTYPE) == VT_STRUCT) {
3020 /* add new memory data only if starting
3021 bit field */
3022 if (lbit_pos == 0) {
3023 if (a == TOK_STRUCT) {
3024 c = (c + align - 1) & -align;
3025 offset = c;
3026 if (size > 0)
3027 c += size;
3028 } else {
3029 offset = 0;
3030 if (size > c)
3031 c = size;
3033 if (align > maxalign)
3034 maxalign = align;
3036 #if 0
3037 printf("add field %s offset=%d",
3038 get_tok_str(v, NULL), offset);
3039 if (type1.t & VT_BITFIELD) {
3040 printf(" pos=%d size=%d",
3041 (type1.t >> VT_STRUCT_SHIFT) & 0x3f,
3042 (type1.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f);
3044 printf("\n");
3045 #endif
3047 if (v == 0 && (type1.t & VT_BTYPE) == VT_STRUCT) {
3048 ass = type1.ref;
3049 while ((ass = ass->next) != NULL) {
3050 ss = sym_push(ass->v, &ass->type, 0, offset + ass->c);
3051 *ps = ss;
3052 ps = &ss->next;
3054 } else if (v) {
3055 ss = sym_push(v | SYM_FIELD, &type1, 0, offset);
3056 *ps = ss;
3057 ps = &ss->next;
3059 if (tok == ';' || tok == TOK_EOF)
3060 break;
3061 skip(',');
3063 skip(';');
3065 skip('}');
3066 /* store size and alignment */
3067 s->c = (c + maxalign - 1) & -maxalign;
3068 s->r = maxalign;
3073 /* return 1 if basic type is a type size (short, long, long long) */
3074 ST_FUNC int is_btype_size(int bt)
3076 return bt == VT_SHORT || bt == VT_LONG || bt == VT_LLONG;
3079 /* return 0 if no type declaration. otherwise, return the basic type
3080 and skip it.
3082 static int parse_btype(CType *type, AttributeDef *ad)
3084 int t, u, bt_size, complete, type_found, typespec_found;
3085 Sym *s;
3086 CType type1;
3088 memset(ad, 0, sizeof(AttributeDef));
3089 complete = 0;
3090 type_found = 0;
3091 typespec_found = 0;
3092 t = 0;
3093 while(1) {
3094 switch(tok) {
3095 case TOK_EXTENSION:
3096 /* currently, we really ignore extension */
3097 next();
3098 continue;
3100 /* basic types */
3101 case TOK_CHAR:
3102 u = VT_BYTE;
3103 basic_type:
3104 next();
3105 basic_type1:
3106 if (complete)
3107 tcc_error("too many basic types");
3108 t |= u;
3109 bt_size = is_btype_size (u & VT_BTYPE);
3110 if (u == VT_INT || (!bt_size && !(t & VT_TYPEDEF)))
3111 complete = 1;
3112 typespec_found = 1;
3113 break;
3114 case TOK_VOID:
3115 u = VT_VOID;
3116 goto basic_type;
3117 case TOK_SHORT:
3118 u = VT_SHORT;
3119 goto basic_type;
3120 case TOK_INT:
3121 u = VT_INT;
3122 goto basic_type;
3123 case TOK_LONG:
3124 next();
3125 if ((t & VT_BTYPE) == VT_DOUBLE) {
3126 #ifndef TCC_TARGET_PE
3127 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
3128 #endif
3129 } else if ((t & VT_BTYPE) == VT_LONG) {
3130 t = (t & ~VT_BTYPE) | VT_LLONG;
3131 } else {
3132 u = VT_LONG;
3133 goto basic_type1;
3135 break;
3136 #ifdef TCC_TARGET_ARM64
3137 case TOK_UINT128:
3138 /* GCC's __uint128_t appears in some Linux header files. Make it a
3139 synonym for long double to get the size and alignment right. */
3140 u = VT_LDOUBLE;
3141 goto basic_type;
3142 #endif
3143 case TOK_BOOL:
3144 u = VT_BOOL;
3145 goto basic_type;
3146 case TOK_FLOAT:
3147 u = VT_FLOAT;
3148 goto basic_type;
3149 case TOK_DOUBLE:
3150 next();
3151 if ((t & VT_BTYPE) == VT_LONG) {
3152 #ifdef TCC_TARGET_PE
3153 t = (t & ~VT_BTYPE) | VT_DOUBLE;
3154 #else
3155 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
3156 #endif
3157 } else {
3158 u = VT_DOUBLE;
3159 goto basic_type1;
3161 break;
3162 case TOK_ENUM:
3163 struct_decl(&type1, VT_ENUM, t & (VT_TYPEDEF | VT_EXTERN));
3164 basic_type2:
3165 u = type1.t;
3166 type->ref = type1.ref;
3167 goto basic_type1;
3168 case TOK_STRUCT:
3169 case TOK_UNION:
3170 struct_decl(&type1, VT_STRUCT, t & (VT_TYPEDEF | VT_EXTERN));
3171 goto basic_type2;
3173 /* type modifiers */
3174 case TOK_CONST1:
3175 case TOK_CONST2:
3176 case TOK_CONST3:
3177 t |= VT_CONSTANT;
3178 next();
3179 break;
3180 case TOK_VOLATILE1:
3181 case TOK_VOLATILE2:
3182 case TOK_VOLATILE3:
3183 t |= VT_VOLATILE;
3184 next();
3185 break;
3186 case TOK_SIGNED1:
3187 case TOK_SIGNED2:
3188 case TOK_SIGNED3:
3189 if ((t & (VT_DEFSIGN|VT_UNSIGNED)) == (VT_DEFSIGN|VT_UNSIGNED))
3190 tcc_error("signed and unsigned modifier");
3191 typespec_found = 1;
3192 t |= VT_DEFSIGN;
3193 next();
3194 break;
3195 case TOK_REGISTER:
3196 case TOK_AUTO:
3197 case TOK_RESTRICT1:
3198 case TOK_RESTRICT2:
3199 case TOK_RESTRICT3:
3200 next();
3201 break;
3202 case TOK_UNSIGNED:
3203 if ((t & (VT_DEFSIGN|VT_UNSIGNED)) == VT_DEFSIGN)
3204 tcc_error("signed and unsigned modifier");
3205 t |= VT_DEFSIGN | VT_UNSIGNED;
3206 next();
3207 typespec_found = 1;
3208 break;
3210 /* storage */
3211 case TOK_EXTERN:
3212 t |= VT_EXTERN;
3213 next();
3214 break;
3215 case TOK_STATIC:
3216 t |= VT_STATIC;
3217 next();
3218 break;
3219 case TOK_TYPEDEF:
3220 t |= VT_TYPEDEF;
3221 next();
3222 break;
3223 case TOK_INLINE1:
3224 case TOK_INLINE2:
3225 case TOK_INLINE3:
3226 t |= VT_INLINE;
3227 next();
3228 break;
3230 /* GNUC attribute */
3231 case TOK_ATTRIBUTE1:
3232 case TOK_ATTRIBUTE2:
3233 parse_attribute(ad);
3234 if (ad->a.mode) {
3235 u = ad->a.mode -1;
3236 t = (t & ~VT_BTYPE) | u;
3238 break;
3239 /* GNUC typeof */
3240 case TOK_TYPEOF1:
3241 case TOK_TYPEOF2:
3242 case TOK_TYPEOF3:
3243 next();
3244 parse_expr_type(&type1);
3245 /* remove all storage modifiers except typedef */
3246 type1.t &= ~(VT_STORAGE&~VT_TYPEDEF);
3247 goto basic_type2;
3248 default:
3249 if (typespec_found)
3250 goto the_end;
3251 s = sym_find(tok);
3252 if (!s || !(s->type.t & VT_TYPEDEF))
3253 goto the_end;
3254 t |= (s->type.t & ~VT_TYPEDEF);
3255 type->ref = s->type.ref;
3256 if (s->r) {
3257 /* get attributes from typedef */
3258 if (0 == ad->a.aligned)
3259 ad->a.aligned = s->a.aligned;
3260 if (0 == ad->a.func_call)
3261 ad->a.func_call = s->a.func_call;
3262 ad->a.packed |= s->a.packed;
3264 next();
3265 typespec_found = 1;
3266 break;
3268 type_found = 1;
3270 the_end:
3271 if (tcc_state->char_is_unsigned) {
3272 if ((t & (VT_DEFSIGN|VT_BTYPE)) == VT_BYTE)
3273 t |= VT_UNSIGNED;
3276 /* long is never used as type */
3277 if ((t & VT_BTYPE) == VT_LONG)
3278 #if (!defined TCC_TARGET_X86_64 && !defined TCC_TARGET_ARM64) || \
3279 defined TCC_TARGET_PE
3280 t = (t & ~VT_BTYPE) | VT_INT;
3281 #else
3282 t = (t & ~VT_BTYPE) | VT_LLONG;
3283 #endif
3284 type->t = t;
3285 return type_found;
3288 /* convert a function parameter type (array to pointer and function to
3289 function pointer) */
3290 static inline void convert_parameter_type(CType *pt)
3292 /* remove const and volatile qualifiers (XXX: const could be used
3293 to indicate a const function parameter */
3294 pt->t &= ~(VT_CONSTANT | VT_VOLATILE);
3295 /* array must be transformed to pointer according to ANSI C */
3296 pt->t &= ~VT_ARRAY;
3297 if ((pt->t & VT_BTYPE) == VT_FUNC) {
3298 mk_pointer(pt);
3302 ST_FUNC void parse_asm_str(CString *astr)
3304 skip('(');
3305 /* read the string */
3306 if (tok != TOK_STR)
3307 expect("string constant");
3308 cstr_new(astr);
3309 while (tok == TOK_STR) {
3310 /* XXX: add \0 handling too ? */
3311 cstr_cat(astr, tokc.cstr->data);
3312 next();
3314 cstr_ccat(astr, '\0');
3317 /* Parse an asm label and return the label
3318 * Don't forget to free the CString in the caller! */
3319 static void asm_label_instr(CString *astr)
3321 next();
3322 parse_asm_str(astr);
3323 skip(')');
3324 #ifdef ASM_DEBUG
3325 printf("asm_alias: \"%s\"\n", (char *)astr->data);
3326 #endif
3329 static void post_type(CType *type, AttributeDef *ad)
3331 int n, l, t1, arg_size, align;
3332 Sym **plast, *s, *first;
3333 AttributeDef ad1;
3334 CType pt;
3336 if (tok == '(') {
3337 /* function declaration */
3338 next();
3339 l = 0;
3340 first = NULL;
3341 plast = &first;
3342 arg_size = 0;
3343 if (tok != ')') {
3344 for(;;) {
3345 /* read param name and compute offset */
3346 if (l != FUNC_OLD) {
3347 if (!parse_btype(&pt, &ad1)) {
3348 if (l) {
3349 tcc_error("invalid type");
3350 } else {
3351 l = FUNC_OLD;
3352 goto old_proto;
3355 l = FUNC_NEW;
3356 if ((pt.t & VT_BTYPE) == VT_VOID && tok == ')')
3357 break;
3358 type_decl(&pt, &ad1, &n, TYPE_DIRECT | TYPE_ABSTRACT);
3359 if ((pt.t & VT_BTYPE) == VT_VOID)
3360 tcc_error("parameter declared as void");
3361 arg_size += (type_size(&pt, &align) + PTR_SIZE - 1) / PTR_SIZE;
3362 } else {
3363 old_proto:
3364 n = tok;
3365 if (n < TOK_UIDENT)
3366 expect("identifier");
3367 pt.t = VT_INT;
3368 next();
3370 convert_parameter_type(&pt);
3371 s = sym_push(n | SYM_FIELD, &pt, 0, 0);
3372 *plast = s;
3373 plast = &s->next;
3374 if (tok == ')')
3375 break;
3376 skip(',');
3377 if (l == FUNC_NEW && tok == TOK_DOTS) {
3378 l = FUNC_ELLIPSIS;
3379 next();
3380 break;
3384 /* if no parameters, then old type prototype */
3385 if (l == 0)
3386 l = FUNC_OLD;
3387 skip(')');
3388 /* NOTE: const is ignored in returned type as it has a special
3389 meaning in gcc / C++ */
3390 type->t &= ~VT_CONSTANT;
3391 /* some ancient pre-K&R C allows a function to return an array
3392 and the array brackets to be put after the arguments, such
3393 that "int c()[]" means something like "int[] c()" */
3394 if (tok == '[') {
3395 next();
3396 skip(']'); /* only handle simple "[]" */
3397 type->t |= VT_PTR;
3399 /* we push a anonymous symbol which will contain the function prototype */
3400 ad->a.func_args = arg_size;
3401 s = sym_push(SYM_FIELD, type, 0, l);
3402 s->a = ad->a;
3403 s->next = first;
3404 type->t = VT_FUNC;
3405 type->ref = s;
3406 } else if (tok == '[') {
3407 /* array definition */
3408 next();
3409 if (tok == TOK_RESTRICT1)
3410 next();
3411 n = -1;
3412 t1 = 0;
3413 if (tok != ']') {
3414 if (!local_stack || nocode_wanted)
3415 vpushi(expr_const());
3416 else gexpr();
3417 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
3418 n = vtop->c.i;
3419 if (n < 0)
3420 tcc_error("invalid array size");
3421 } else {
3422 if (!is_integer_btype(vtop->type.t & VT_BTYPE))
3423 tcc_error("size of variable length array should be an integer");
3424 t1 = VT_VLA;
3427 skip(']');
3428 /* parse next post type */
3429 post_type(type, ad);
3430 if (type->t == VT_FUNC)
3431 tcc_error("declaration of an array of functions");
3432 t1 |= type->t & VT_VLA;
3434 if (t1 & VT_VLA) {
3435 loc -= type_size(&int_type, &align);
3436 loc &= -align;
3437 n = loc;
3439 vla_runtime_type_size(type, &align);
3440 gen_op('*');
3441 vset(&int_type, VT_LOCAL|VT_LVAL, loc);
3442 vswap();
3443 vstore();
3445 if (n != -1)
3446 vpop();
3448 /* we push an anonymous symbol which will contain the array
3449 element type */
3450 s = sym_push(SYM_FIELD, type, 0, n);
3451 type->t = (t1 ? VT_VLA : VT_ARRAY) | VT_PTR;
3452 type->ref = s;
3456 /* Parse a type declaration (except basic type), and return the type
3457 in 'type'. 'td' is a bitmask indicating which kind of type decl is
3458 expected. 'type' should contain the basic type. 'ad' is the
3459 attribute definition of the basic type. It can be modified by
3460 type_decl().
3462 static void type_decl(CType *type, AttributeDef *ad, int *v, int td)
3464 Sym *s;
3465 CType type1, *type2;
3466 int qualifiers, storage;
3468 while (tok == '*') {
3469 qualifiers = 0;
3470 redo:
3471 next();
3472 switch(tok) {
3473 case TOK_CONST1:
3474 case TOK_CONST2:
3475 case TOK_CONST3:
3476 qualifiers |= VT_CONSTANT;
3477 goto redo;
3478 case TOK_VOLATILE1:
3479 case TOK_VOLATILE2:
3480 case TOK_VOLATILE3:
3481 qualifiers |= VT_VOLATILE;
3482 goto redo;
3483 case TOK_RESTRICT1:
3484 case TOK_RESTRICT2:
3485 case TOK_RESTRICT3:
3486 goto redo;
3488 mk_pointer(type);
3489 type->t |= qualifiers;
3492 /* XXX: clarify attribute handling */
3493 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
3494 parse_attribute(ad);
3496 /* recursive type */
3497 /* XXX: incorrect if abstract type for functions (e.g. 'int ()') */
3498 type1.t = 0; /* XXX: same as int */
3499 if (tok == '(') {
3500 next();
3501 /* XXX: this is not correct to modify 'ad' at this point, but
3502 the syntax is not clear */
3503 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
3504 parse_attribute(ad);
3505 type_decl(&type1, ad, v, td);
3506 skip(')');
3507 } else {
3508 /* type identifier */
3509 if (tok >= TOK_IDENT && (td & TYPE_DIRECT)) {
3510 *v = tok;
3511 next();
3512 } else {
3513 if (!(td & TYPE_ABSTRACT))
3514 expect("identifier");
3515 *v = 0;
3518 storage = type->t & VT_STORAGE;
3519 type->t &= ~VT_STORAGE;
3520 if (storage & VT_STATIC) {
3521 int saved_nocode_wanted = nocode_wanted;
3522 nocode_wanted = 1;
3523 post_type(type, ad);
3524 nocode_wanted = saved_nocode_wanted;
3525 } else
3526 post_type(type, ad);
3527 type->t |= storage;
3528 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
3529 parse_attribute(ad);
3531 if (!type1.t)
3532 return;
3533 /* append type at the end of type1 */
3534 type2 = &type1;
3535 for(;;) {
3536 s = type2->ref;
3537 type2 = &s->type;
3538 if (!type2->t) {
3539 *type2 = *type;
3540 break;
3543 *type = type1;
3546 /* compute the lvalue VT_LVAL_xxx needed to match type t. */
3547 ST_FUNC int lvalue_type(int t)
3549 int bt, r;
3550 r = VT_LVAL;
3551 bt = t & VT_BTYPE;
3552 if (bt == VT_BYTE || bt == VT_BOOL)
3553 r |= VT_LVAL_BYTE;
3554 else if (bt == VT_SHORT)
3555 r |= VT_LVAL_SHORT;
3556 else
3557 return r;
3558 if (t & VT_UNSIGNED)
3559 r |= VT_LVAL_UNSIGNED;
3560 return r;
3563 /* indirection with full error checking and bound check */
3564 ST_FUNC void indir(void)
3566 if ((vtop->type.t & VT_BTYPE) != VT_PTR) {
3567 if ((vtop->type.t & VT_BTYPE) == VT_FUNC)
3568 return;
3569 expect("pointer");
3571 if ((vtop->r & VT_LVAL) && !nocode_wanted)
3572 gv(RC_INT);
3573 vtop->type = *pointed_type(&vtop->type);
3574 /* Arrays and functions are never lvalues */
3575 if (!(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_VLA)
3576 && (vtop->type.t & VT_BTYPE) != VT_FUNC) {
3577 vtop->r |= lvalue_type(vtop->type.t);
3578 /* if bound checking, the referenced pointer must be checked */
3579 #ifdef CONFIG_TCC_BCHECK
3580 if (tcc_state->do_bounds_check)
3581 vtop->r |= VT_MUSTBOUND;
3582 #endif
3586 /* pass a parameter to a function and do type checking and casting */
3587 static void gfunc_param_typed(Sym *func, Sym *arg)
3589 int func_type;
3590 CType type;
3592 func_type = func->c;
3593 if (func_type == FUNC_OLD ||
3594 (func_type == FUNC_ELLIPSIS && arg == NULL)) {
3595 /* default casting : only need to convert float to double */
3596 if ((vtop->type.t & VT_BTYPE) == VT_FLOAT) {
3597 type.t = VT_DOUBLE;
3598 gen_cast(&type);
3599 } else if (vtop->type.t & VT_BITFIELD) {
3600 type.t = vtop->type.t & (VT_BTYPE | VT_UNSIGNED);
3601 gen_cast(&type);
3603 } else if (arg == NULL) {
3604 tcc_error("too many arguments to function");
3605 } else {
3606 type = arg->type;
3607 type.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
3608 gen_assign_cast(&type);
3612 /* parse an expression of the form '(type)' or '(expr)' and return its
3613 type */
3614 static void parse_expr_type(CType *type)
3616 int n;
3617 AttributeDef ad;
3619 skip('(');
3620 if (parse_btype(type, &ad)) {
3621 type_decl(type, &ad, &n, TYPE_ABSTRACT);
3622 } else {
3623 expr_type(type);
3625 skip(')');
3628 static void parse_type(CType *type)
3630 AttributeDef ad;
3631 int n;
3633 if (!parse_btype(type, &ad)) {
3634 expect("type");
3636 type_decl(type, &ad, &n, TYPE_ABSTRACT);
3639 static void vpush_tokc(int t)
3641 CType type;
3642 type.t = t;
3643 type.ref = 0;
3644 vsetc(&type, VT_CONST, &tokc);
3647 ST_FUNC void unary(void)
3649 int n, t, align, size, r, sizeof_caller;
3650 CType type;
3651 Sym *s;
3652 AttributeDef ad;
3653 static int in_sizeof = 0;
3655 sizeof_caller = in_sizeof;
3656 in_sizeof = 0;
3657 /* XXX: GCC 2.95.3 does not generate a table although it should be
3658 better here */
3659 tok_next:
3660 switch(tok) {
3661 case TOK_EXTENSION:
3662 next();
3663 goto tok_next;
3664 case TOK_CINT:
3665 case TOK_CCHAR:
3666 case TOK_LCHAR:
3667 vpushi(tokc.i);
3668 next();
3669 break;
3670 case TOK_CUINT:
3671 vpush_tokc(VT_INT | VT_UNSIGNED);
3672 next();
3673 break;
3674 case TOK_CLLONG:
3675 vpush_tokc(VT_LLONG);
3676 next();
3677 break;
3678 case TOK_CULLONG:
3679 vpush_tokc(VT_LLONG | VT_UNSIGNED);
3680 next();
3681 break;
3682 case TOK_CFLOAT:
3683 vpush_tokc(VT_FLOAT);
3684 next();
3685 break;
3686 case TOK_CDOUBLE:
3687 vpush_tokc(VT_DOUBLE);
3688 next();
3689 break;
3690 case TOK_CLDOUBLE:
3691 vpush_tokc(VT_LDOUBLE);
3692 next();
3693 break;
3694 case TOK___FUNCTION__:
3695 if (!gnu_ext)
3696 goto tok_identifier;
3697 /* fall thru */
3698 case TOK___FUNC__:
3700 void *ptr;
3701 int len;
3702 /* special function name identifier */
3703 len = strlen(funcname) + 1;
3704 /* generate char[len] type */
3705 type.t = VT_BYTE;
3706 mk_pointer(&type);
3707 type.t |= VT_ARRAY;
3708 type.ref->c = len;
3709 vpush_ref(&type, data_section, data_section->data_offset, len);
3710 ptr = section_ptr_add(data_section, len);
3711 memcpy(ptr, funcname, len);
3712 next();
3714 break;
3715 case TOK_LSTR:
3716 #ifdef TCC_TARGET_PE
3717 t = VT_SHORT | VT_UNSIGNED;
3718 #else
3719 t = VT_INT;
3720 #endif
3721 goto str_init;
3722 case TOK_STR:
3723 /* string parsing */
3724 t = VT_BYTE;
3725 str_init:
3726 if (tcc_state->warn_write_strings)
3727 t |= VT_CONSTANT;
3728 type.t = t;
3729 mk_pointer(&type);
3730 type.t |= VT_ARRAY;
3731 memset(&ad, 0, sizeof(AttributeDef));
3732 decl_initializer_alloc(&type, &ad, VT_CONST, 2, 0, NULL, 0);
3733 break;
3734 case '(':
3735 next();
3736 /* cast ? */
3737 if (parse_btype(&type, &ad)) {
3738 type_decl(&type, &ad, &n, TYPE_ABSTRACT);
3739 skip(')');
3740 /* check ISOC99 compound literal */
3741 if (tok == '{') {
3742 /* data is allocated locally by default */
3743 if (global_expr)
3744 r = VT_CONST;
3745 else
3746 r = VT_LOCAL;
3747 /* all except arrays are lvalues */
3748 if (!(type.t & VT_ARRAY))
3749 r |= lvalue_type(type.t);
3750 memset(&ad, 0, sizeof(AttributeDef));
3751 decl_initializer_alloc(&type, &ad, r, 1, 0, NULL, 0);
3752 } else {
3753 if (sizeof_caller) {
3754 vpush(&type);
3755 return;
3757 unary();
3758 gen_cast(&type);
3760 } else if (tok == '{') {
3761 /* save all registers */
3762 save_regs(0);
3763 /* statement expression : we do not accept break/continue
3764 inside as GCC does */
3765 block(NULL, NULL, NULL, NULL, 0, 1);
3766 skip(')');
3767 } else {
3768 gexpr();
3769 skip(')');
3771 break;
3772 case '*':
3773 next();
3774 unary();
3775 indir();
3776 break;
3777 case '&':
3778 next();
3779 unary();
3780 /* functions names must be treated as function pointers,
3781 except for unary '&' and sizeof. Since we consider that
3782 functions are not lvalues, we only have to handle it
3783 there and in function calls. */
3784 /* arrays can also be used although they are not lvalues */
3785 if ((vtop->type.t & VT_BTYPE) != VT_FUNC &&
3786 !(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_LLOCAL))
3787 test_lvalue();
3788 mk_pointer(&vtop->type);
3789 gaddrof();
3790 break;
3791 case '!':
3792 next();
3793 unary();
3794 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
3795 CType boolean;
3796 boolean.t = VT_BOOL;
3797 gen_cast(&boolean);
3798 vtop->c.i = !vtop->c.i;
3799 } else if ((vtop->r & VT_VALMASK) == VT_CMP)
3800 vtop->c.i = vtop->c.i ^ 1;
3801 else {
3802 save_regs(1);
3803 vseti(VT_JMP, gvtst(1, 0));
3805 break;
3806 case '~':
3807 next();
3808 unary();
3809 vpushi(-1);
3810 gen_op('^');
3811 break;
3812 case '+':
3813 next();
3814 unary();
3815 if ((vtop->type.t & VT_BTYPE) == VT_PTR)
3816 tcc_error("pointer not accepted for unary plus");
3817 /* In order to force cast, we add zero, except for floating point
3818 where we really need an noop (otherwise -0.0 will be transformed
3819 into +0.0). */
3820 if (!is_float(vtop->type.t)) {
3821 vpushi(0);
3822 gen_op('+');
3824 break;
3825 case TOK_SIZEOF:
3826 case TOK_ALIGNOF1:
3827 case TOK_ALIGNOF2:
3828 t = tok;
3829 next();
3830 in_sizeof++;
3831 unary_type(&type); // Perform a in_sizeof = 0;
3832 size = type_size(&type, &align);
3833 if (t == TOK_SIZEOF) {
3834 if (!(type.t & VT_VLA)) {
3835 if (size < 0)
3836 tcc_error("sizeof applied to an incomplete type");
3837 vpushs(size);
3838 } else {
3839 vla_runtime_type_size(&type, &align);
3841 } else {
3842 vpushs(align);
3844 vtop->type.t |= VT_UNSIGNED;
3845 break;
3847 case TOK_builtin_types_compatible_p:
3849 CType type1, type2;
3850 next();
3851 skip('(');
3852 parse_type(&type1);
3853 skip(',');
3854 parse_type(&type2);
3855 skip(')');
3856 type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
3857 type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
3858 vpushi(is_compatible_types(&type1, &type2));
3860 break;
3861 case TOK_builtin_constant_p:
3863 int saved_nocode_wanted, res;
3864 next();
3865 skip('(');
3866 saved_nocode_wanted = nocode_wanted;
3867 nocode_wanted = 1;
3868 gexpr();
3869 res = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
3870 vpop();
3871 nocode_wanted = saved_nocode_wanted;
3872 skip(')');
3873 vpushi(res);
3875 break;
3876 case TOK_builtin_frame_address:
3877 case TOK_builtin_return_address:
3879 int tok1 = tok;
3880 int level;
3881 CType type;
3882 next();
3883 skip('(');
3884 if (tok != TOK_CINT || tokc.i < 0) {
3885 tcc_error("%s only takes positive integers",
3886 tok1 == TOK_builtin_return_address ?
3887 "__builtin_return_address" :
3888 "__builtin_frame_address");
3890 level = tokc.i;
3891 next();
3892 skip(')');
3893 type.t = VT_VOID;
3894 mk_pointer(&type);
3895 vset(&type, VT_LOCAL, 0); /* local frame */
3896 while (level--) {
3897 mk_pointer(&vtop->type);
3898 indir(); /* -> parent frame */
3900 if (tok1 == TOK_builtin_return_address) {
3901 // assume return address is just above frame pointer on stack
3902 vpushi(PTR_SIZE);
3903 gen_op('+');
3904 mk_pointer(&vtop->type);
3905 indir();
3908 break;
3909 #ifdef TCC_TARGET_X86_64
3910 #ifdef TCC_TARGET_PE
3911 case TOK_builtin_va_start:
3913 next();
3914 skip('(');
3915 expr_eq();
3916 skip(',');
3917 expr_eq();
3918 skip(')');
3919 if ((vtop->r & VT_VALMASK) != VT_LOCAL)
3920 tcc_error("__builtin_va_start expects a local variable");
3921 vtop->r &= ~(VT_LVAL | VT_REF);
3922 vtop->type = char_pointer_type;
3923 vstore();
3925 break;
3926 #else
3927 case TOK_builtin_va_arg_types:
3929 CType type;
3930 next();
3931 skip('(');
3932 parse_type(&type);
3933 skip(')');
3934 vpushi(classify_x86_64_va_arg(&type));
3936 break;
3937 #endif
3938 #endif
3940 #ifdef TCC_TARGET_ARM64
3941 case TOK___va_start: {
3942 next();
3943 skip('(');
3944 expr_eq();
3945 skip(',');
3946 expr_eq();
3947 skip(')');
3948 //xx check types
3949 gen_va_start();
3950 vpushi(0);
3951 vtop->type.t = VT_VOID;
3952 break;
3954 case TOK___va_arg: {
3955 CType type;
3956 next();
3957 skip('(');
3958 expr_eq();
3959 skip(',');
3960 parse_type(&type);
3961 skip(')');
3962 //xx check types
3963 gen_va_arg(&type);
3964 vtop->type = type;
3965 break;
3967 #endif
3969 case TOK_INC:
3970 case TOK_DEC:
3971 t = tok;
3972 next();
3973 unary();
3974 inc(0, t);
3975 break;
3976 case '-':
3977 next();
3978 unary();
3979 t = vtop->type.t & VT_BTYPE;
3980 if (is_float(t)) {
3981 /* In IEEE negate(x) isn't subtract(0,x), but rather
3982 subtract(-0, x). */
3983 vpush(&vtop->type);
3984 if (t == VT_FLOAT)
3985 vtop->c.f = -0.0f;
3986 else if (t == VT_DOUBLE)
3987 vtop->c.d = -0.0;
3988 else
3989 vtop->c.ld = -0.0;
3990 } else
3991 vpushi(0);
3992 vswap();
3993 gen_op('-');
3994 break;
3995 case TOK_LAND:
3996 if (!gnu_ext)
3997 goto tok_identifier;
3998 next();
3999 /* allow to take the address of a label */
4000 if (tok < TOK_UIDENT)
4001 expect("label identifier");
4002 s = label_find(tok);
4003 if (!s) {
4004 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
4005 } else {
4006 if (s->r == LABEL_DECLARED)
4007 s->r = LABEL_FORWARD;
4009 if (!s->type.t) {
4010 s->type.t = VT_VOID;
4011 mk_pointer(&s->type);
4012 s->type.t |= VT_STATIC;
4014 vpushsym(&s->type, s);
4015 next();
4016 break;
4018 // special qnan , snan and infinity values
4019 case TOK___NAN__:
4020 vpush64(VT_DOUBLE, 0x7ff8000000000000ULL);
4021 next();
4022 break;
4023 case TOK___SNAN__:
4024 vpush64(VT_DOUBLE, 0x7ff0000000000001ULL);
4025 next();
4026 break;
4027 case TOK___INF__:
4028 vpush64(VT_DOUBLE, 0x7ff0000000000000ULL);
4029 next();
4030 break;
4032 default:
4033 tok_identifier:
4034 t = tok;
4035 next();
4036 if (t < TOK_UIDENT)
4037 expect("identifier");
4038 s = sym_find(t);
4039 if (!s) {
4040 const char *name = get_tok_str(t, NULL);
4041 if (tok != '(')
4042 tcc_error("'%s' undeclared", name);
4043 /* for simple function calls, we tolerate undeclared
4044 external reference to int() function */
4045 if (tcc_state->warn_implicit_function_declaration
4046 #ifdef TCC_TARGET_PE
4047 /* people must be warned about using undeclared WINAPI functions
4048 (which usually start with uppercase letter) */
4049 || (name[0] >= 'A' && name[0] <= 'Z')
4050 #endif
4052 tcc_warning("implicit declaration of function '%s'", name);
4053 s = external_global_sym(t, &func_old_type, 0);
4055 if ((s->type.t & (VT_STATIC | VT_INLINE | VT_BTYPE)) ==
4056 (VT_STATIC | VT_INLINE | VT_FUNC)) {
4057 /* if referencing an inline function, then we generate a
4058 symbol to it if not already done. It will have the
4059 effect to generate code for it at the end of the
4060 compilation unit. Inline function as always
4061 generated in the text section. */
4062 if (!s->c)
4063 put_extern_sym(s, text_section, 0, 0);
4064 r = VT_SYM | VT_CONST;
4065 } else {
4066 r = s->r;
4068 vset(&s->type, r, s->c);
4069 /* if forward reference, we must point to s */
4070 if (vtop->r & VT_SYM) {
4071 vtop->sym = s;
4072 vtop->c.ptr_offset = 0;
4074 break;
4077 /* post operations */
4078 while (1) {
4079 if (tok == TOK_INC || tok == TOK_DEC) {
4080 inc(1, tok);
4081 next();
4082 } else if (tok == '.' || tok == TOK_ARROW) {
4083 int qualifiers;
4084 /* field */
4085 if (tok == TOK_ARROW)
4086 indir();
4087 qualifiers = vtop->type.t & (VT_CONSTANT | VT_VOLATILE);
4088 test_lvalue();
4089 gaddrof();
4090 next();
4091 /* expect pointer on structure */
4092 if ((vtop->type.t & VT_BTYPE) != VT_STRUCT)
4093 expect("struct or union");
4094 s = vtop->type.ref;
4095 /* find field */
4096 tok |= SYM_FIELD;
4097 while ((s = s->next) != NULL) {
4098 if (s->v == tok)
4099 break;
4101 if (!s)
4102 tcc_error("field not found: %s", get_tok_str(tok & ~SYM_FIELD, NULL));
4103 /* add field offset to pointer */
4104 vtop->type = char_pointer_type; /* change type to 'char *' */
4105 vpushi(s->c);
4106 gen_op('+');
4107 /* change type to field type, and set to lvalue */
4108 vtop->type = s->type;
4109 vtop->type.t |= qualifiers;
4110 /* an array is never an lvalue */
4111 if (!(vtop->type.t & VT_ARRAY)) {
4112 vtop->r |= lvalue_type(vtop->type.t);
4113 #ifdef CONFIG_TCC_BCHECK
4114 /* if bound checking, the referenced pointer must be checked */
4115 if (tcc_state->do_bounds_check)
4116 vtop->r |= VT_MUSTBOUND;
4117 #endif
4119 next();
4120 } else if (tok == '[') {
4121 next();
4122 gexpr();
4123 gen_op('+');
4124 indir();
4125 skip(']');
4126 } else if (tok == '(') {
4127 SValue ret;
4128 Sym *sa;
4129 int nb_args, ret_nregs, ret_align, variadic;
4131 /* function call */
4132 if ((vtop->type.t & VT_BTYPE) != VT_FUNC) {
4133 /* pointer test (no array accepted) */
4134 if ((vtop->type.t & (VT_BTYPE | VT_ARRAY)) == VT_PTR) {
4135 vtop->type = *pointed_type(&vtop->type);
4136 if ((vtop->type.t & VT_BTYPE) != VT_FUNC)
4137 goto error_func;
4138 } else {
4139 error_func:
4140 expect("function pointer");
4142 } else {
4143 vtop->r &= ~VT_LVAL; /* no lvalue */
4145 /* get return type */
4146 s = vtop->type.ref;
4147 next();
4148 sa = s->next; /* first parameter */
4149 nb_args = 0;
4150 ret.r2 = VT_CONST;
4151 /* compute first implicit argument if a structure is returned */
4152 if ((s->type.t & VT_BTYPE) == VT_STRUCT) {
4153 variadic = (s->c == FUNC_ELLIPSIS);
4154 ret_nregs = gfunc_sret(&s->type, variadic, &ret.type,
4155 &ret_align);
4156 if (!ret_nregs) {
4157 /* get some space for the returned structure */
4158 size = type_size(&s->type, &align);
4159 #ifdef TCC_TARGET_ARM64
4160 /* On arm64, a small struct is return in registers.
4161 It is much easier to write it to memory if we know
4162 that we are allowed to write some extra bytes, so
4163 round the allocated space up to a power of 2: */
4164 if (size < 16)
4165 while (size & (size - 1))
4166 size = (size | (size - 1)) + 1;
4167 #endif
4168 loc = (loc - size) & -align;
4169 ret.type = s->type;
4170 ret.r = VT_LOCAL | VT_LVAL;
4171 /* pass it as 'int' to avoid structure arg passing
4172 problems */
4173 vseti(VT_LOCAL, loc);
4174 ret.c = vtop->c;
4175 nb_args++;
4177 } else {
4178 ret_nregs = 1;
4179 ret.type = s->type;
4182 if (ret_nregs) {
4183 /* return in register */
4184 if (is_float(ret.type.t)) {
4185 ret.r = reg_fret(ret.type.t);
4186 #ifdef TCC_TARGET_X86_64
4187 if ((ret.type.t & VT_BTYPE) == VT_QFLOAT)
4188 ret.r2 = REG_QRET;
4189 #endif
4190 } else {
4191 #ifndef TCC_TARGET_ARM64
4192 #ifdef TCC_TARGET_X86_64
4193 if ((ret.type.t & VT_BTYPE) == VT_QLONG)
4194 #else
4195 if ((ret.type.t & VT_BTYPE) == VT_LLONG)
4196 #endif
4197 ret.r2 = REG_LRET;
4198 #endif
4199 ret.r = REG_IRET;
4201 ret.c.i = 0;
4203 if (tok != ')') {
4204 for(;;) {
4205 expr_eq();
4206 gfunc_param_typed(s, sa);
4207 nb_args++;
4208 if (sa)
4209 sa = sa->next;
4210 if (tok == ')')
4211 break;
4212 skip(',');
4215 if (sa)
4216 tcc_error("too few arguments to function");
4217 skip(')');
4218 if (!nocode_wanted) {
4219 gfunc_call(nb_args);
4220 } else {
4221 vtop -= (nb_args + 1);
4224 /* return value */
4225 for (r = ret.r + ret_nregs + !ret_nregs; r-- > ret.r;) {
4226 vsetc(&ret.type, r, &ret.c);
4227 vtop->r2 = ret.r2; /* Loop only happens when r2 is VT_CONST */
4230 /* handle packed struct return */
4231 if (((s->type.t & VT_BTYPE) == VT_STRUCT) && ret_nregs) {
4232 int addr, offset;
4234 size = type_size(&s->type, &align);
4235 loc = (loc - size) & -align;
4236 addr = loc;
4237 offset = 0;
4238 for (;;) {
4239 vset(&ret.type, VT_LOCAL | VT_LVAL, addr + offset);
4240 vswap();
4241 vstore();
4242 vtop--;
4243 if (--ret_nregs == 0)
4244 break;
4245 /* XXX: compatible with arm only: ret_align == register_size */
4246 offset += ret_align;
4248 vset(&s->type, VT_LOCAL | VT_LVAL, addr);
4250 } else {
4251 break;
4256 ST_FUNC void expr_prod(void)
4258 int t;
4260 unary();
4261 while (tok == '*' || tok == '/' || tok == '%') {
4262 t = tok;
4263 next();
4264 unary();
4265 gen_op(t);
4269 ST_FUNC void expr_sum(void)
4271 int t;
4273 expr_prod();
4274 while (tok == '+' || tok == '-') {
4275 t = tok;
4276 next();
4277 expr_prod();
4278 gen_op(t);
4282 static void expr_shift(void)
4284 int t;
4286 expr_sum();
4287 while (tok == TOK_SHL || tok == TOK_SAR) {
4288 t = tok;
4289 next();
4290 expr_sum();
4291 gen_op(t);
4295 static void expr_cmp(void)
4297 int t;
4299 expr_shift();
4300 while ((tok >= TOK_ULE && tok <= TOK_GT) ||
4301 tok == TOK_ULT || tok == TOK_UGE) {
4302 t = tok;
4303 next();
4304 expr_shift();
4305 gen_op(t);
4309 static void expr_cmpeq(void)
4311 int t;
4313 expr_cmp();
4314 while (tok == TOK_EQ || tok == TOK_NE) {
4315 t = tok;
4316 next();
4317 expr_cmp();
4318 gen_op(t);
4322 static void expr_and(void)
4324 expr_cmpeq();
4325 while (tok == '&') {
4326 next();
4327 expr_cmpeq();
4328 gen_op('&');
4332 static void expr_xor(void)
4334 expr_and();
4335 while (tok == '^') {
4336 next();
4337 expr_and();
4338 gen_op('^');
4342 static void expr_or(void)
4344 expr_xor();
4345 while (tok == '|') {
4346 next();
4347 expr_xor();
4348 gen_op('|');
4352 /* XXX: fix this mess */
4353 static void expr_land_const(void)
4355 expr_or();
4356 while (tok == TOK_LAND) {
4357 next();
4358 expr_or();
4359 gen_op(TOK_LAND);
4363 /* XXX: fix this mess */
4364 static void expr_lor_const(void)
4366 expr_land_const();
4367 while (tok == TOK_LOR) {
4368 next();
4369 expr_land_const();
4370 gen_op(TOK_LOR);
4374 /* only used if non constant */
4375 static void expr_land(void)
4377 int t;
4379 expr_or();
4380 if (tok == TOK_LAND) {
4381 t = 0;
4382 save_regs(1);
4383 for(;;) {
4384 t = gvtst(1, t);
4385 if (tok != TOK_LAND) {
4386 vseti(VT_JMPI, t);
4387 break;
4389 next();
4390 expr_or();
4395 static void expr_lor(void)
4397 int t;
4399 expr_land();
4400 if (tok == TOK_LOR) {
4401 t = 0;
4402 save_regs(1);
4403 for(;;) {
4404 t = gvtst(0, t);
4405 if (tok != TOK_LOR) {
4406 vseti(VT_JMP, t);
4407 break;
4409 next();
4410 expr_land();
4415 /* XXX: better constant handling */
4416 static void expr_cond(void)
4418 int tt, u, r1, r2, rc, t1, t2, bt1, bt2;
4419 SValue sv;
4420 CType type, type1, type2;
4422 if (const_wanted) {
4423 expr_lor_const();
4424 if (tok == '?') {
4425 CType boolean;
4426 int c;
4427 boolean.t = VT_BOOL;
4428 vdup();
4429 gen_cast(&boolean);
4430 c = vtop->c.i;
4431 vpop();
4432 next();
4433 if (tok != ':' || !gnu_ext) {
4434 vpop();
4435 gexpr();
4437 if (!c)
4438 vpop();
4439 skip(':');
4440 expr_cond();
4441 if (c)
4442 vpop();
4444 } else {
4445 expr_lor();
4446 if (tok == '?') {
4447 next();
4448 if (vtop != vstack) {
4449 /* needed to avoid having different registers saved in
4450 each branch */
4451 if (is_float(vtop->type.t)) {
4452 rc = RC_FLOAT;
4453 #ifdef TCC_TARGET_X86_64
4454 if ((vtop->type.t & VT_BTYPE) == VT_LDOUBLE) {
4455 rc = RC_ST0;
4457 #endif
4459 else
4460 rc = RC_INT;
4461 gv(rc);
4462 save_regs(1);
4464 if (tok == ':' && gnu_ext) {
4465 gv_dup();
4466 tt = gvtst(1, 0);
4467 } else {
4468 tt = gvtst(1, 0);
4469 gexpr();
4471 type1 = vtop->type;
4472 sv = *vtop; /* save value to handle it later */
4473 vtop--; /* no vpop so that FP stack is not flushed */
4474 skip(':');
4475 u = gjmp(0);
4476 gsym(tt);
4477 expr_cond();
4478 type2 = vtop->type;
4480 t1 = type1.t;
4481 bt1 = t1 & VT_BTYPE;
4482 t2 = type2.t;
4483 bt2 = t2 & VT_BTYPE;
4484 /* cast operands to correct type according to ISOC rules */
4485 if (is_float(bt1) || is_float(bt2)) {
4486 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
4487 type.t = VT_LDOUBLE;
4488 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
4489 type.t = VT_DOUBLE;
4490 } else {
4491 type.t = VT_FLOAT;
4493 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
4494 /* cast to biggest op */
4495 type.t = VT_LLONG;
4496 /* convert to unsigned if it does not fit in a long long */
4497 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
4498 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
4499 type.t |= VT_UNSIGNED;
4500 } else if (bt1 == VT_PTR || bt2 == VT_PTR) {
4501 /* If one is a null ptr constant the result type
4502 is the other. */
4503 if (is_null_pointer (vtop))
4504 type = type1;
4505 else if (is_null_pointer (&sv))
4506 type = type2;
4507 /* XXX: test pointer compatibility, C99 has more elaborate
4508 rules here. */
4509 else
4510 type = type1;
4511 } else if (bt1 == VT_FUNC || bt2 == VT_FUNC) {
4512 /* XXX: test function pointer compatibility */
4513 type = bt1 == VT_FUNC ? type1 : type2;
4514 } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) {
4515 /* XXX: test structure compatibility */
4516 type = bt1 == VT_STRUCT ? type1 : type2;
4517 } else if (bt1 == VT_VOID || bt2 == VT_VOID) {
4518 /* NOTE: as an extension, we accept void on only one side */
4519 type.t = VT_VOID;
4520 } else {
4521 /* integer operations */
4522 type.t = VT_INT;
4523 /* convert to unsigned if it does not fit in an integer */
4524 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
4525 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
4526 type.t |= VT_UNSIGNED;
4529 /* now we convert second operand */
4530 gen_cast(&type);
4531 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
4532 gaddrof();
4533 rc = RC_INT;
4534 if (is_float(type.t)) {
4535 rc = RC_FLOAT;
4536 #ifdef TCC_TARGET_X86_64
4537 if ((type.t & VT_BTYPE) == VT_LDOUBLE) {
4538 rc = RC_ST0;
4540 #endif
4541 } else if ((type.t & VT_BTYPE) == VT_LLONG) {
4542 /* for long longs, we use fixed registers to avoid having
4543 to handle a complicated move */
4544 rc = RC_IRET;
4547 r2 = gv(rc);
4548 /* this is horrible, but we must also convert first
4549 operand */
4550 tt = gjmp(0);
4551 gsym(u);
4552 /* put again first value and cast it */
4553 *vtop = sv;
4554 gen_cast(&type);
4555 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
4556 gaddrof();
4557 r1 = gv(rc);
4558 move_reg(r2, r1, type.t);
4559 vtop->r = r2;
4560 gsym(tt);
4565 static void expr_eq(void)
4567 int t;
4569 expr_cond();
4570 if (tok == '=' ||
4571 (tok >= TOK_A_MOD && tok <= TOK_A_DIV) ||
4572 tok == TOK_A_XOR || tok == TOK_A_OR ||
4573 tok == TOK_A_SHL || tok == TOK_A_SAR) {
4574 test_lvalue();
4575 t = tok;
4576 next();
4577 if (t == '=') {
4578 expr_eq();
4579 } else {
4580 vdup();
4581 expr_eq();
4582 gen_op(t & 0x7f);
4584 vstore();
4588 ST_FUNC void gexpr(void)
4590 while (1) {
4591 expr_eq();
4592 if (tok != ',')
4593 break;
4594 vpop();
4595 next();
4599 /* parse an expression and return its type without any side effect. */
4600 static void expr_type(CType *type)
4602 int saved_nocode_wanted;
4604 saved_nocode_wanted = nocode_wanted;
4605 nocode_wanted = 1;
4606 gexpr();
4607 *type = vtop->type;
4608 vpop();
4609 nocode_wanted = saved_nocode_wanted;
4612 /* parse a unary expression and return its type without any side
4613 effect. */
4614 static void unary_type(CType *type)
4616 int a;
4618 a = nocode_wanted;
4619 nocode_wanted = 1;
4620 unary();
4621 *type = vtop->type;
4622 vpop();
4623 nocode_wanted = a;
4626 /* parse a constant expression and return value in vtop. */
4627 static void expr_const1(void)
4629 int a;
4630 a = const_wanted;
4631 const_wanted = 1;
4632 expr_cond();
4633 const_wanted = a;
4636 /* parse an integer constant and return its value. */
4637 ST_FUNC int expr_const(void)
4639 int c;
4640 expr_const1();
4641 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
4642 expect("constant expression");
4643 c = vtop->c.i;
4644 vpop();
4645 return c;
4648 /* return the label token if current token is a label, otherwise
4649 return zero */
4650 static int is_label(void)
4652 int last_tok;
4654 /* fast test first */
4655 if (tok < TOK_UIDENT)
4656 return 0;
4657 /* no need to save tokc because tok is an identifier */
4658 last_tok = tok;
4659 next();
4660 if (tok == ':') {
4661 next();
4662 return last_tok;
4663 } else {
4664 unget_tok(last_tok);
4665 return 0;
4669 static void label_or_decl(int l)
4671 int last_tok;
4673 /* fast test first */
4674 if (tok >= TOK_UIDENT)
4676 /* no need to save tokc because tok is an identifier */
4677 last_tok = tok;
4678 next();
4679 if (tok == ':') {
4680 unget_tok(last_tok);
4681 return;
4683 unget_tok(last_tok);
4685 decl(l);
4688 static void block(int *bsym, int *csym, int *case_sym, int *def_sym,
4689 int case_reg, int is_expr)
4691 int a, b, c, d;
4692 Sym *s, *frame_bottom;
4694 /* generate line number info */
4695 if (tcc_state->do_debug &&
4696 (last_line_num != file->line_num || last_ind != ind)) {
4697 put_stabn(N_SLINE, 0, file->line_num, ind - func_ind);
4698 last_ind = ind;
4699 last_line_num = file->line_num;
4702 if (is_expr) {
4703 /* default return value is (void) */
4704 vpushi(0);
4705 vtop->type.t = VT_VOID;
4708 if (tok == TOK_IF) {
4709 /* if test */
4710 next();
4711 skip('(');
4712 gexpr();
4713 skip(')');
4714 a = gvtst(1, 0);
4715 block(bsym, csym, case_sym, def_sym, case_reg, 0);
4716 c = tok;
4717 if (c == TOK_ELSE) {
4718 next();
4719 d = gjmp(0);
4720 gsym(a);
4721 block(bsym, csym, case_sym, def_sym, case_reg, 0);
4722 gsym(d); /* patch else jmp */
4723 } else
4724 gsym(a);
4725 } else if (tok == TOK_WHILE) {
4726 next();
4727 d = ind;
4728 skip('(');
4729 gexpr();
4730 skip(')');
4731 a = gvtst(1, 0);
4732 b = 0;
4733 block(&a, &b, case_sym, def_sym, case_reg, 0);
4734 gjmp_addr(d);
4735 gsym(a);
4736 gsym_addr(b, d);
4737 } else if (tok == '{') {
4738 Sym *llabel;
4739 int block_vla_sp_loc, *saved_vla_sp_loc, saved_vla_flags;
4741 next();
4742 /* record local declaration stack position */
4743 s = local_stack;
4744 frame_bottom = sym_push2(&local_stack, SYM_FIELD, 0, 0);
4745 frame_bottom->next = scope_stack_bottom;
4746 scope_stack_bottom = frame_bottom;
4747 llabel = local_label_stack;
4749 /* save VLA state */
4750 block_vla_sp_loc = *(saved_vla_sp_loc = vla_sp_loc);
4751 if (saved_vla_sp_loc != &vla_sp_root_loc)
4752 vla_sp_loc = &block_vla_sp_loc;
4754 saved_vla_flags = vla_flags;
4755 vla_flags |= VLA_NEED_NEW_FRAME;
4757 /* handle local labels declarations */
4758 if (tok == TOK_LABEL) {
4759 next();
4760 for(;;) {
4761 if (tok < TOK_UIDENT)
4762 expect("label identifier");
4763 label_push(&local_label_stack, tok, LABEL_DECLARED);
4764 next();
4765 if (tok == ',') {
4766 next();
4767 } else {
4768 skip(';');
4769 break;
4773 while (tok != '}') {
4774 label_or_decl(VT_LOCAL);
4775 if (tok != '}') {
4776 if (is_expr)
4777 vpop();
4778 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
4781 /* pop locally defined labels */
4782 label_pop(&local_label_stack, llabel);
4783 if(is_expr) {
4784 /* XXX: this solution makes only valgrind happy...
4785 triggered by gcc.c-torture/execute/20000917-1.c */
4786 Sym *p;
4787 switch(vtop->type.t & VT_BTYPE) {
4788 /* case VT_PTR: */
4789 /* this breaks a compilation of the linux kernel v2.4.26 */
4790 /* pmd_t *new = ({ __asm__ __volatile__("ud2\n") ; ((pmd_t *)1); }); */
4791 /* Look a commit a80acab: Display error on statement expressions with complex return type */
4792 /* A pointer is not a complex return type */
4793 case VT_STRUCT:
4794 case VT_ENUM:
4795 case VT_FUNC:
4796 for(p=vtop->type.ref;p;p=p->prev)
4797 if(p->prev==s)
4798 tcc_error("unsupported expression type");
4801 /* pop locally defined symbols */
4802 scope_stack_bottom = scope_stack_bottom->next;
4803 sym_pop(&local_stack, s);
4805 /* Pop VLA frames and restore stack pointer if required */
4806 if (saved_vla_sp_loc != &vla_sp_root_loc)
4807 *saved_vla_sp_loc = block_vla_sp_loc;
4808 if (vla_sp_loc != (saved_vla_sp_loc == &vla_sp_root_loc ? &vla_sp_root_loc : &block_vla_sp_loc)) {
4809 vla_sp_loc = saved_vla_sp_loc;
4810 gen_vla_sp_restore(*vla_sp_loc);
4812 vla_flags = (vla_flags & ~VLA_SCOPE_FLAGS) | (saved_vla_flags & VLA_SCOPE_FLAGS);
4814 next();
4815 } else if (tok == TOK_RETURN) {
4816 next();
4817 if (tok != ';') {
4818 gexpr();
4819 gen_assign_cast(&func_vt);
4820 #ifdef TCC_TARGET_ARM64
4821 // Perhaps it would be better to use this for all backends:
4822 greturn();
4823 #else
4824 if ((func_vt.t & VT_BTYPE) == VT_STRUCT) {
4825 CType type, ret_type;
4826 int ret_align, ret_nregs;
4827 ret_nregs = gfunc_sret(&func_vt, func_var, &ret_type,
4828 &ret_align);
4829 if (0 == ret_nregs) {
4830 /* if returning structure, must copy it to implicit
4831 first pointer arg location */
4832 type = func_vt;
4833 mk_pointer(&type);
4834 vset(&type, VT_LOCAL | VT_LVAL, func_vc);
4835 indir();
4836 vswap();
4837 /* copy structure value to pointer */
4838 vstore();
4839 } else {
4840 /* returning structure packed into registers */
4841 int r, size, addr, align;
4842 size = type_size(&func_vt,&align);
4843 if ((vtop->r != (VT_LOCAL | VT_LVAL) || (vtop->c.i & (ret_align-1)))
4844 && (align & (ret_align-1))) {
4845 loc = (loc - size) & -align;
4846 addr = loc;
4847 type = func_vt;
4848 vset(&type, VT_LOCAL | VT_LVAL, addr);
4849 vswap();
4850 vstore();
4851 vset(&ret_type, VT_LOCAL | VT_LVAL, addr);
4853 vtop->type = ret_type;
4854 if (is_float(ret_type.t))
4855 r = rc_fret(ret_type.t);
4856 else
4857 r = RC_IRET;
4859 for (;;) {
4860 gv(r);
4861 if (--ret_nregs == 0)
4862 break;
4863 /* We assume that when a structure is returned in multiple
4864 registers, their classes are consecutive values of the
4865 suite s(n) = 2^n */
4866 r <<= 1;
4867 /* XXX: compatible with arm only: ret_align == register_size */
4868 vtop->c.i += ret_align;
4869 vtop->r = VT_LOCAL | VT_LVAL;
4872 } else if (is_float(func_vt.t)) {
4873 gv(rc_fret(func_vt.t));
4874 } else {
4875 gv(RC_IRET);
4877 #endif
4878 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
4880 skip(';');
4881 rsym = gjmp(rsym); /* jmp */
4882 } else if (tok == TOK_BREAK) {
4883 /* compute jump */
4884 if (!bsym)
4885 tcc_error("cannot break");
4886 *bsym = gjmp(*bsym);
4887 next();
4888 skip(';');
4889 } else if (tok == TOK_CONTINUE) {
4890 /* compute jump */
4891 if (!csym)
4892 tcc_error("cannot continue");
4893 *csym = gjmp(*csym);
4894 next();
4895 skip(';');
4896 } else if (tok == TOK_FOR) {
4897 int e;
4898 next();
4899 skip('(');
4900 s = local_stack;
4901 frame_bottom = sym_push2(&local_stack, SYM_FIELD, 0, 0);
4902 frame_bottom->next = scope_stack_bottom;
4903 scope_stack_bottom = frame_bottom;
4904 if (tok != ';') {
4905 /* c99 for-loop init decl? */
4906 if (!decl0(VT_LOCAL, 1)) {
4907 /* no, regular for-loop init expr */
4908 gexpr();
4909 vpop();
4912 skip(';');
4913 d = ind;
4914 c = ind;
4915 a = 0;
4916 b = 0;
4917 if (tok != ';') {
4918 gexpr();
4919 a = gvtst(1, 0);
4921 skip(';');
4922 if (tok != ')') {
4923 e = gjmp(0);
4924 c = ind;
4925 gexpr();
4926 vpop();
4927 gjmp_addr(d);
4928 gsym(e);
4930 skip(')');
4931 block(&a, &b, case_sym, def_sym, case_reg, 0);
4932 gjmp_addr(c);
4933 gsym(a);
4934 gsym_addr(b, c);
4935 scope_stack_bottom = scope_stack_bottom->next;
4936 sym_pop(&local_stack, s);
4937 } else
4938 if (tok == TOK_DO) {
4939 next();
4940 a = 0;
4941 b = 0;
4942 d = ind;
4943 block(&a, &b, case_sym, def_sym, case_reg, 0);
4944 skip(TOK_WHILE);
4945 skip('(');
4946 gsym(b);
4947 gexpr();
4948 c = gvtst(0, 0);
4949 gsym_addr(c, d);
4950 skip(')');
4951 gsym(a);
4952 skip(';');
4953 } else
4954 if (tok == TOK_SWITCH) {
4955 next();
4956 skip('(');
4957 gexpr();
4958 /* XXX: other types than integer */
4959 case_reg = gv(RC_INT);
4960 vpop();
4961 skip(')');
4962 a = 0;
4963 b = gjmp(0); /* jump to first case */
4964 c = 0;
4965 block(&a, csym, &b, &c, case_reg, 0);
4966 /* if no default, jmp after switch */
4967 if (c == 0)
4968 c = ind;
4969 /* default label */
4970 gsym_addr(b, c);
4971 /* break label */
4972 gsym(a);
4973 } else
4974 if (tok == TOK_CASE) {
4975 int v1, v2;
4976 if (!case_sym)
4977 expect("switch");
4978 next();
4979 v1 = expr_const();
4980 v2 = v1;
4981 if (gnu_ext && tok == TOK_DOTS) {
4982 next();
4983 v2 = expr_const();
4984 if (v2 < v1)
4985 tcc_warning("empty case range");
4987 /* since a case is like a label, we must skip it with a jmp */
4988 b = gjmp(0);
4989 gsym(*case_sym);
4990 vseti(case_reg, 0);
4991 vdup();
4992 vpushi(v1);
4993 if (v1 == v2) {
4994 gen_op(TOK_EQ);
4995 *case_sym = gtst(1, 0);
4996 } else {
4997 gen_op(TOK_GE);
4998 *case_sym = gtst(1, 0);
4999 vseti(case_reg, 0);
5000 vpushi(v2);
5001 gen_op(TOK_LE);
5002 *case_sym = gtst(1, *case_sym);
5004 case_reg = gv(RC_INT);
5005 vpop();
5006 gsym(b);
5007 skip(':');
5008 is_expr = 0;
5009 goto block_after_label;
5010 } else
5011 if (tok == TOK_DEFAULT) {
5012 next();
5013 skip(':');
5014 if (!def_sym)
5015 expect("switch");
5016 if (*def_sym)
5017 tcc_error("too many 'default'");
5018 *def_sym = ind;
5019 is_expr = 0;
5020 goto block_after_label;
5021 } else
5022 if (tok == TOK_GOTO) {
5023 next();
5024 if (tok == '*' && gnu_ext) {
5025 /* computed goto */
5026 next();
5027 gexpr();
5028 if ((vtop->type.t & VT_BTYPE) != VT_PTR)
5029 expect("pointer");
5030 ggoto();
5031 } else if (tok >= TOK_UIDENT) {
5032 s = label_find(tok);
5033 /* put forward definition if needed */
5034 if (!s) {
5035 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
5036 } else {
5037 if (s->r == LABEL_DECLARED)
5038 s->r = LABEL_FORWARD;
5040 /* label already defined */
5041 if (vla_flags & VLA_IN_SCOPE) {
5042 /* If VLAs are in use, save the current stack pointer and
5043 reset the stack pointer to what it was at function entry
5044 (label will restore stack pointer in inner scopes) */
5045 vla_sp_save();
5046 gen_vla_sp_restore(vla_sp_root_loc);
5048 if (s->r & LABEL_FORWARD)
5049 s->jnext = gjmp(s->jnext);
5050 else
5051 gjmp_addr(s->jnext);
5052 next();
5053 } else {
5054 expect("label identifier");
5056 skip(';');
5057 } else if (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3) {
5058 asm_instr();
5059 } else {
5060 b = is_label();
5061 if (b) {
5062 /* label case */
5063 if (vla_flags & VLA_IN_SCOPE) {
5064 /* save/restore stack pointer across label
5065 this is a no-op when combined with the load immediately
5066 after the label unless we arrive via goto */
5067 vla_sp_save();
5069 s = label_find(b);
5070 if (s) {
5071 if (s->r == LABEL_DEFINED)
5072 tcc_error("duplicate label '%s'", get_tok_str(s->v, NULL));
5073 gsym(s->jnext);
5074 s->r = LABEL_DEFINED;
5075 } else {
5076 s = label_push(&global_label_stack, b, LABEL_DEFINED);
5078 s->jnext = ind;
5079 if (vla_flags & VLA_IN_SCOPE) {
5080 gen_vla_sp_restore(*vla_sp_loc);
5081 vla_flags |= VLA_NEED_NEW_FRAME;
5083 /* we accept this, but it is a mistake */
5084 block_after_label:
5085 if (tok == '}') {
5086 tcc_warning("deprecated use of label at end of compound statement");
5087 } else {
5088 if (is_expr)
5089 vpop();
5090 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
5092 } else {
5093 /* expression case */
5094 if (tok != ';') {
5095 if (is_expr) {
5096 vpop();
5097 gexpr();
5098 } else {
5099 gexpr();
5100 vpop();
5103 skip(';');
5108 /* t is the array or struct type. c is the array or struct
5109 address. cur_index/cur_field is the pointer to the current
5110 value. 'size_only' is true if only size info is needed (only used
5111 in arrays) */
5112 static void decl_designator(CType *type, Section *sec, unsigned long c,
5113 int *cur_index, Sym **cur_field,
5114 int size_only, int *par_count_p)
5116 Sym *s, *f;
5117 int notfirst, index, index_last, align, l, nb_elems, elem_size;
5118 CType type1;
5120 notfirst = 0;
5121 elem_size = 0;
5122 nb_elems = 1;
5123 if (gnu_ext && (l = is_label()) != 0)
5124 goto struct_field;
5125 while (tok == '[' || tok == '.') {
5126 if (tok == '[') {
5127 if (!(type->t & VT_ARRAY))
5128 expect("array type");
5129 s = type->ref;
5130 next();
5131 index = expr_const();
5132 if (index < 0 || (s->c >= 0 && index >= s->c))
5133 expect("invalid index");
5134 if (tok == TOK_DOTS && gnu_ext) {
5135 next();
5136 index_last = expr_const();
5137 if (index_last < 0 ||
5138 (s->c >= 0 && index_last >= s->c) ||
5139 index_last < index)
5140 expect("invalid index");
5141 } else {
5142 index_last = index;
5144 skip(']');
5145 if (!notfirst)
5146 *cur_index = index_last;
5147 type = pointed_type(type);
5148 elem_size = type_size(type, &align);
5149 c += index * elem_size;
5150 /* NOTE: we only support ranges for last designator */
5151 nb_elems = index_last - index + 1;
5152 if (nb_elems != 1) {
5153 notfirst = 1;
5154 break;
5156 } else {
5157 next();
5158 l = tok;
5159 next();
5160 struct_field:
5161 if ((type->t & VT_BTYPE) != VT_STRUCT)
5162 expect("struct/union type");
5163 s = type->ref;
5164 l |= SYM_FIELD;
5165 f = s->next;
5166 while (f) {
5167 if (f->v == l)
5168 break;
5169 f = f->next;
5171 if (!f)
5172 expect("field");
5173 if (!notfirst)
5174 *cur_field = f;
5175 /* XXX: fix this mess by using explicit storage field */
5176 type1 = f->type;
5177 type1.t |= (type->t & ~VT_TYPE);
5178 type = &type1;
5179 c += f->c;
5181 notfirst = 1;
5183 if (notfirst) {
5184 if (tok == '=') {
5185 next();
5186 } else {
5187 if (!gnu_ext)
5188 expect("=");
5190 } else {
5191 if (type->t & VT_ARRAY) {
5192 index = *cur_index;
5193 type = pointed_type(type);
5194 c += index * type_size(type, &align);
5195 } else {
5196 f = *cur_field;
5197 if (!f)
5198 tcc_error("too many field init");
5199 /* XXX: fix this mess by using explicit storage field */
5200 type1 = f->type;
5201 type1.t |= (type->t & ~VT_TYPE);
5202 type = &type1;
5203 c += f->c;
5206 decl_initializer(type, sec, c, 0, size_only, par_count_p);
5208 /* XXX: make it more general */
5209 if (!size_only && nb_elems > 1) {
5210 unsigned long c_end;
5211 uint8_t *src, *dst;
5212 int i;
5214 if (!sec)
5215 tcc_error("range init not supported yet for dynamic storage");
5216 c_end = c + nb_elems * elem_size;
5217 if (c_end > sec->data_allocated)
5218 section_realloc(sec, c_end);
5219 src = sec->data + c;
5220 dst = src;
5221 for(i = 1; i < nb_elems; i++) {
5222 dst += elem_size;
5223 memcpy(dst, src, elem_size);
5228 #define EXPR_VAL 0
5229 #define EXPR_CONST 1
5230 #define EXPR_ANY 2
5232 /* store a value or an expression directly in global data or in local array */
5233 static void init_putv(CType *type, Section *sec, unsigned long c,
5234 int v, int expr_type)
5236 int saved_global_expr, bt, bit_pos, bit_size;
5237 void *ptr;
5238 unsigned long long bit_mask;
5239 CType dtype;
5241 switch(expr_type) {
5242 case EXPR_VAL:
5243 vpushi(v);
5244 break;
5245 case EXPR_CONST:
5246 /* compound literals must be allocated globally in this case */
5247 saved_global_expr = global_expr;
5248 global_expr = 1;
5249 expr_const1();
5250 global_expr = saved_global_expr;
5251 /* NOTE: symbols are accepted */
5252 if ((vtop->r & (VT_VALMASK | VT_LVAL)) != VT_CONST)
5253 tcc_error("initializer element is not constant");
5254 break;
5255 case EXPR_ANY:
5256 expr_eq();
5257 break;
5260 dtype = *type;
5261 dtype.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
5263 if (sec) {
5264 /* XXX: not portable */
5265 /* XXX: generate error if incorrect relocation */
5266 gen_assign_cast(&dtype);
5267 bt = type->t & VT_BTYPE;
5268 /* we'll write at most 16 bytes */
5269 if (c + 16 > sec->data_allocated) {
5270 section_realloc(sec, c + 16);
5272 ptr = sec->data + c;
5273 /* XXX: make code faster ? */
5274 if (!(type->t & VT_BITFIELD)) {
5275 bit_pos = 0;
5276 bit_size = 32;
5277 bit_mask = -1LL;
5278 } else {
5279 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
5280 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
5281 bit_mask = (1LL << bit_size) - 1;
5283 if ((vtop->r & VT_SYM) &&
5284 (bt == VT_BYTE ||
5285 bt == VT_SHORT ||
5286 bt == VT_DOUBLE ||
5287 bt == VT_LDOUBLE ||
5288 bt == VT_LLONG ||
5289 (bt == VT_INT && bit_size != 32)))
5290 tcc_error("initializer element is not computable at load time");
5291 switch(bt) {
5292 /* XXX: when cross-compiling we assume that each type has the
5293 same representation on host and target, which is likely to
5294 be wrong in the case of long double */
5295 case VT_BOOL:
5296 vtop->c.i = (vtop->c.i != 0);
5297 case VT_BYTE:
5298 *(char *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
5299 break;
5300 case VT_SHORT:
5301 *(short *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
5302 break;
5303 case VT_DOUBLE:
5304 *(double *)ptr = vtop->c.d;
5305 break;
5306 case VT_LDOUBLE:
5307 *(long double *)ptr = vtop->c.ld;
5308 break;
5309 case VT_LLONG:
5310 *(long long *)ptr |= (vtop->c.ll & bit_mask) << bit_pos;
5311 break;
5312 case VT_PTR: {
5313 addr_t val = (vtop->c.ptr_offset & bit_mask) << bit_pos;
5314 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
5315 if (vtop->r & VT_SYM)
5316 greloca(sec, vtop->sym, c, R_DATA_PTR, val);
5317 else
5318 *(addr_t *)ptr |= val;
5319 #else
5320 if (vtop->r & VT_SYM)
5321 greloc(sec, vtop->sym, c, R_DATA_PTR);
5322 *(addr_t *)ptr |= val;
5323 #endif
5324 break;
5326 default: {
5327 int val = (vtop->c.i & bit_mask) << bit_pos;
5328 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
5329 if (vtop->r & VT_SYM)
5330 greloca(sec, vtop->sym, c, R_DATA_PTR, val);
5331 else
5332 *(int *)ptr |= val;
5333 #else
5334 if (vtop->r & VT_SYM)
5335 greloc(sec, vtop->sym, c, R_DATA_PTR);
5336 *(int *)ptr |= val;
5337 #endif
5338 break;
5341 vtop--;
5342 } else {
5343 vset(&dtype, VT_LOCAL|VT_LVAL, c);
5344 vswap();
5345 vstore();
5346 vpop();
5350 /* put zeros for variable based init */
5351 static void init_putz(CType *t, Section *sec, unsigned long c, int size)
5353 if (sec) {
5354 /* nothing to do because globals are already set to zero */
5355 } else {
5356 vpush_global_sym(&func_old_type, TOK_memset);
5357 vseti(VT_LOCAL, c);
5358 #ifdef TCC_TARGET_ARM
5359 vpushs(size);
5360 vpushi(0);
5361 #else
5362 vpushi(0);
5363 vpushs(size);
5364 #endif
5365 gfunc_call(3);
5369 /* 't' contains the type and storage info. 'c' is the offset of the
5370 object in section 'sec'. If 'sec' is NULL, it means stack based
5371 allocation. 'first' is true if array '{' must be read (multi
5372 dimension implicit array init handling). 'size_only' is true if
5373 size only evaluation is wanted (only for arrays). */
5374 static void decl_initializer(CType *type, Section *sec, unsigned long c,
5375 int first, int size_only, int *par_count_p)
5377 int index, array_length, n, no_oblock, nb, parlevel, parlevel1, i;
5378 int size1, align1, expr_type;
5379 Sym *s, *f;
5380 CType *t1;
5382 if (type->t & VT_VLA) {
5383 int a;
5385 /* save current stack pointer */
5386 if (vla_flags & VLA_NEED_NEW_FRAME) {
5387 vla_sp_save();
5388 vla_flags = VLA_IN_SCOPE;
5389 vla_sp_loc = &vla_sp_loc_tmp;
5392 vla_runtime_type_size(type, &a);
5393 gen_vla_alloc(type, a);
5394 vset(type, VT_LOCAL|VT_LVAL, c);
5395 vswap();
5396 vstore();
5397 vpop();
5398 } else if (type->t & VT_ARRAY) {
5399 s = type->ref;
5400 n = s->c;
5401 array_length = 0;
5402 t1 = pointed_type(type);
5403 size1 = type_size(t1, &align1);
5405 no_oblock = 1;
5406 if ((first && tok != TOK_LSTR && tok != TOK_STR) ||
5407 tok == '{') {
5408 if (tok != '{')
5409 tcc_error("character array initializer must be a literal,"
5410 " optionally enclosed in braces");
5411 skip('{');
5412 no_oblock = 0;
5415 /* only parse strings here if correct type (otherwise: handle
5416 them as ((w)char *) expressions */
5417 if ((tok == TOK_LSTR &&
5418 #ifdef TCC_TARGET_PE
5419 (t1->t & VT_BTYPE) == VT_SHORT && (t1->t & VT_UNSIGNED)
5420 #else
5421 (t1->t & VT_BTYPE) == VT_INT
5422 #endif
5423 ) || (tok == TOK_STR && (t1->t & VT_BTYPE) == VT_BYTE)) {
5424 while (tok == TOK_STR || tok == TOK_LSTR) {
5425 int cstr_len, ch;
5426 CString *cstr;
5428 cstr = tokc.cstr;
5429 /* compute maximum number of chars wanted */
5430 if (tok == TOK_STR)
5431 cstr_len = cstr->size;
5432 else
5433 cstr_len = cstr->size / sizeof(nwchar_t);
5434 cstr_len--;
5435 nb = cstr_len;
5436 if (n >= 0 && nb > (n - array_length))
5437 nb = n - array_length;
5438 if (!size_only) {
5439 if (cstr_len > nb)
5440 tcc_warning("initializer-string for array is too long");
5441 /* in order to go faster for common case (char
5442 string in global variable, we handle it
5443 specifically */
5444 if (sec && tok == TOK_STR && size1 == 1) {
5445 memcpy(sec->data + c + array_length, cstr->data, nb);
5446 } else {
5447 for(i=0;i<nb;i++) {
5448 if (tok == TOK_STR)
5449 ch = ((unsigned char *)cstr->data)[i];
5450 else
5451 ch = ((nwchar_t *)cstr->data)[i];
5452 init_putv(t1, sec, c + (array_length + i) * size1,
5453 ch, EXPR_VAL);
5457 array_length += nb;
5458 next();
5460 /* only add trailing zero if enough storage (no
5461 warning in this case since it is standard) */
5462 if (n < 0 || array_length < n) {
5463 if (!size_only) {
5464 init_putv(t1, sec, c + (array_length * size1), 0, EXPR_VAL);
5466 array_length++;
5468 } else {
5469 index = 0;
5470 while (tok != '}') {
5471 decl_designator(type, sec, c, &index, NULL, size_only, par_count_p);
5472 if (n >= 0 && index >= n)
5473 tcc_error("index too large");
5474 /* must put zero in holes (note that doing it that way
5475 ensures that it even works with designators) */
5476 if (!size_only && array_length < index) {
5477 init_putz(t1, sec, c + array_length * size1,
5478 (index - array_length) * size1);
5480 index++;
5481 if (index > array_length)
5482 array_length = index;
5483 /* special test for multi dimensional arrays (may not
5484 be strictly correct if designators are used at the
5485 same time) */
5486 if (index >= n && no_oblock)
5487 break;
5488 if (*par_count_p != 0 && tok == ')') {
5489 skip(')');
5490 *par_count_p -= 1;
5492 if (tok == '}')
5493 break;
5494 skip(',');
5497 if (!no_oblock)
5498 skip('}');
5499 /* put zeros at the end */
5500 if (!size_only && n >= 0 && array_length < n) {
5501 init_putz(t1, sec, c + array_length * size1,
5502 (n - array_length) * size1);
5504 /* patch type size if needed */
5505 if (n < 0)
5506 s->c = array_length;
5507 } else if ((type->t & VT_BTYPE) == VT_STRUCT &&
5508 (sec || !first || tok == '{')) {
5509 int par_count;
5511 /* NOTE: the previous test is a specific case for automatic
5512 struct/union init */
5513 /* XXX: union needs only one init */
5515 /* XXX: this test is incorrect for local initializers
5516 beginning with ( without {. It would be much more difficult
5517 to do it correctly (ideally, the expression parser should
5518 be used in all cases) */
5519 par_count = 0;
5520 if (tok == '(') {
5521 AttributeDef ad1;
5522 CType type1;
5523 next();
5524 while (tok == '(') {
5525 par_count++;
5526 next();
5528 if (!parse_btype(&type1, &ad1))
5529 expect("cast");
5530 type_decl(&type1, &ad1, &n, TYPE_ABSTRACT);
5531 #if 0
5532 if (!is_assignable_types(type, &type1))
5533 tcc_error("invalid type for cast");
5534 #endif
5535 skip(')');
5537 no_oblock = 1;
5538 if (first || tok == '{') {
5539 skip('{');
5540 no_oblock = 0;
5542 s = type->ref;
5543 f = s->next;
5544 array_length = 0;
5545 index = 0;
5546 n = s->c;
5547 while (tok != '}') {
5548 decl_designator(type, sec, c, NULL, &f, size_only, &par_count);
5549 index = f->c;
5550 if (!size_only && array_length < index) {
5551 init_putz(type, sec, c + array_length,
5552 index - array_length);
5554 index = index + type_size(&f->type, &align1);
5555 if (index > array_length)
5556 array_length = index;
5558 /* gr: skip fields from same union - ugly. */
5559 while (f->next) {
5560 int align = 0;
5561 int f_size = type_size(&f->type, &align);
5562 int f_type = (f->type.t & VT_BTYPE);
5564 ///printf("index: %2d %08x -- %2d %08x\n", f->c, f->type.t, f->next->c, f->next->type.t);
5565 /* test for same offset */
5566 if (f->next->c != f->c)
5567 break;
5568 if ((f_type == VT_STRUCT) && (f_size == 0)) {
5570 Lets assume a structure of size 0 can't be a member of the union.
5571 This allow to compile the following code from a linux kernel v2.4.26
5572 typedef struct { } rwlock_t;
5573 struct fs_struct {
5574 int count;
5575 rwlock_t lock;
5576 int umask;
5578 struct fs_struct init_fs = { { (1) }, (rwlock_t) {}, 0022, };
5579 tcc-0.9.23 can succesfully compile this version of the kernel.
5580 gcc don't have problems with this code too.
5582 break;
5584 /* if yes, test for bitfield shift */
5585 if ((f->type.t & VT_BITFIELD) && (f->next->type.t & VT_BITFIELD)) {
5586 int bit_pos_1 = (f->type.t >> VT_STRUCT_SHIFT) & 0x3f;
5587 int bit_pos_2 = (f->next->type.t >> VT_STRUCT_SHIFT) & 0x3f;
5588 //printf("bitfield %d %d\n", bit_pos_1, bit_pos_2);
5589 if (bit_pos_1 != bit_pos_2)
5590 break;
5592 f = f->next;
5595 f = f->next;
5596 if (no_oblock && f == NULL)
5597 break;
5598 if (tok == '}')
5599 break;
5600 skip(',');
5602 /* put zeros at the end */
5603 if (!size_only && array_length < n) {
5604 init_putz(type, sec, c + array_length,
5605 n - array_length);
5607 if (!no_oblock)
5608 skip('}');
5609 while (par_count) {
5610 skip(')');
5611 par_count--;
5613 } else if (tok == '{') {
5614 int par_count = 0;
5615 next();
5616 decl_initializer(type, sec, c, first, size_only, &par_count);
5617 skip('}');
5618 } else if (size_only) {
5619 /* just skip expression */
5620 parlevel = parlevel1 = 0;
5621 while ((parlevel > 0 || parlevel1 > 0 ||
5622 (tok != '}' && tok != ',')) && tok != -1) {
5623 if (tok == '(')
5624 parlevel++;
5625 else if (tok == ')') {
5626 if (parlevel == 0 && parlevel1 == 0)
5627 break;
5628 parlevel--;
5630 else if (tok == '{')
5631 parlevel1++;
5632 else if (tok == '}') {
5633 if (parlevel == 0 && parlevel1 == 0)
5634 break;
5635 parlevel1--;
5637 next();
5639 } else {
5640 /* currently, we always use constant expression for globals
5641 (may change for scripting case) */
5642 expr_type = EXPR_CONST;
5643 if (!sec)
5644 expr_type = EXPR_ANY;
5645 init_putv(type, sec, c, 0, expr_type);
5649 /* parse an initializer for type 't' if 'has_init' is non zero, and
5650 allocate space in local or global data space ('r' is either
5651 VT_LOCAL or VT_CONST). If 'v' is non zero, then an associated
5652 variable 'v' with an associated name represented by 'asm_label' of
5653 scope 'scope' is declared before initializers are parsed. If 'v' is
5654 zero, then a reference to the new object is put in the value stack.
5655 If 'has_init' is 2, a special parsing is done to handle string
5656 constants. */
5657 static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r,
5658 int has_init, int v, char *asm_label,
5659 int scope)
5661 int size, align, addr, data_offset;
5662 int level;
5663 ParseState saved_parse_state = {0};
5664 TokenString init_str;
5665 Section *sec;
5666 Sym *flexible_array;
5668 flexible_array = NULL;
5669 if ((type->t & VT_BTYPE) == VT_STRUCT) {
5670 Sym *field = type->ref->next;
5671 if (field) {
5672 while (field->next)
5673 field = field->next;
5674 if (field->type.t & VT_ARRAY && field->type.ref->c < 0)
5675 flexible_array = field;
5679 size = type_size(type, &align);
5680 /* If unknown size, we must evaluate it before
5681 evaluating initializers because
5682 initializers can generate global data too
5683 (e.g. string pointers or ISOC99 compound
5684 literals). It also simplifies local
5685 initializers handling */
5686 tok_str_new(&init_str);
5687 if (size < 0 || (flexible_array && has_init)) {
5688 int par_count = 0;
5689 if (!has_init)
5690 tcc_error("unknown type size");
5691 /* get all init string */
5692 if (has_init == 2) {
5693 /* only get strings */
5694 while (tok == TOK_STR || tok == TOK_LSTR) {
5695 tok_str_add_tok(&init_str);
5696 next();
5698 } else {
5699 level = 0;
5700 while (level > 0 || (tok != ',' && tok != ';')) {
5701 if (tok < 0)
5702 tcc_error("unexpected end of file in initializer");
5703 tok_str_add_tok(&init_str);
5704 if (tok == '{')
5705 level++;
5706 else if (tok == '}') {
5707 level--;
5708 if (level <= 0) {
5709 next();
5710 break;
5713 next();
5716 tok_str_add(&init_str, -1);
5717 tok_str_add(&init_str, 0);
5719 /* compute size */
5720 save_parse_state(&saved_parse_state);
5722 macro_ptr = init_str.str;
5723 next();
5724 decl_initializer(type, NULL, 0, 1, 1, &par_count);
5725 /* prepare second initializer parsing */
5726 macro_ptr = init_str.str;
5727 next();
5729 /* if still unknown size, error */
5730 size = type_size(type, &align);
5731 if (size < 0)
5732 tcc_error("unknown type size");
5734 if (flexible_array)
5735 size += flexible_array->type.ref->c * pointed_size(&flexible_array->type);
5736 /* take into account specified alignment if bigger */
5737 if (ad->a.aligned) {
5738 if (ad->a.aligned > align)
5739 align = ad->a.aligned;
5740 } else if (ad->a.packed) {
5741 align = 1;
5743 if ((r & VT_VALMASK) == VT_LOCAL) {
5744 sec = NULL;
5745 #ifdef CONFIG_TCC_BCHECK
5746 if (tcc_state->do_bounds_check && (type->t & VT_ARRAY)) {
5747 loc--;
5749 #endif
5750 loc = (loc - size) & -align;
5751 addr = loc;
5752 #ifdef CONFIG_TCC_BCHECK
5753 /* handles bounds */
5754 /* XXX: currently, since we do only one pass, we cannot track
5755 '&' operators, so we add only arrays */
5756 if (tcc_state->do_bounds_check && (type->t & VT_ARRAY)) {
5757 unsigned long *bounds_ptr;
5758 /* add padding between regions */
5759 loc--;
5760 /* then add local bound info */
5761 bounds_ptr = section_ptr_add(lbounds_section, 2 * sizeof(unsigned long));
5762 bounds_ptr[0] = addr;
5763 bounds_ptr[1] = size;
5765 #endif
5766 if (v) {
5767 /* local variable */
5768 sym_push(v, type, r, addr);
5769 } else {
5770 /* push local reference */
5771 vset(type, r, addr);
5773 } else {
5774 Sym *sym;
5776 sym = NULL;
5777 if (v && scope == VT_CONST) {
5778 /* see if the symbol was already defined */
5779 sym = sym_find(v);
5780 if (sym) {
5781 if (!is_compatible_types(&sym->type, type))
5782 tcc_error("incompatible types for redefinition of '%s'",
5783 get_tok_str(v, NULL));
5784 if (sym->type.t & VT_EXTERN) {
5785 /* if the variable is extern, it was not allocated */
5786 sym->type.t &= ~VT_EXTERN;
5787 /* set array size if it was omitted in extern
5788 declaration */
5789 if ((sym->type.t & VT_ARRAY) &&
5790 sym->type.ref->c < 0 &&
5791 type->ref->c >= 0)
5792 sym->type.ref->c = type->ref->c;
5793 } else {
5794 /* we accept several definitions of the same
5795 global variable. this is tricky, because we
5796 must play with the SHN_COMMON type of the symbol */
5797 /* XXX: should check if the variable was already
5798 initialized. It is incorrect to initialized it
5799 twice */
5800 /* no init data, we won't add more to the symbol */
5801 if (!has_init)
5802 goto no_alloc;
5807 /* allocate symbol in corresponding section */
5808 sec = ad->section;
5809 if (!sec) {
5810 if (has_init)
5811 sec = data_section;
5812 else if (tcc_state->nocommon)
5813 sec = bss_section;
5815 if (sec) {
5816 data_offset = sec->data_offset;
5817 data_offset = (data_offset + align - 1) & -align;
5818 addr = data_offset;
5819 /* very important to increment global pointer at this time
5820 because initializers themselves can create new initializers */
5821 data_offset += size;
5822 #ifdef CONFIG_TCC_BCHECK
5823 /* add padding if bound check */
5824 if (tcc_state->do_bounds_check)
5825 data_offset++;
5826 #endif
5827 sec->data_offset = data_offset;
5828 /* allocate section space to put the data */
5829 if (sec->sh_type != SHT_NOBITS &&
5830 data_offset > sec->data_allocated)
5831 section_realloc(sec, data_offset);
5832 /* align section if needed */
5833 if (align > sec->sh_addralign)
5834 sec->sh_addralign = align;
5835 } else {
5836 addr = 0; /* avoid warning */
5839 if (v) {
5840 if (scope != VT_CONST || !sym) {
5841 sym = sym_push(v, type, r | VT_SYM, 0);
5842 sym->asm_label = asm_label;
5844 /* update symbol definition */
5845 if (sec) {
5846 put_extern_sym(sym, sec, addr, size);
5847 } else {
5848 ElfW(Sym) *esym;
5849 /* put a common area */
5850 put_extern_sym(sym, NULL, align, size);
5851 /* XXX: find a nicer way */
5852 esym = &((ElfW(Sym) *)symtab_section->data)[sym->c];
5853 esym->st_shndx = SHN_COMMON;
5855 } else {
5856 /* push global reference */
5857 sym = get_sym_ref(type, sec, addr, size);
5858 vpushsym(type, sym);
5860 /* patch symbol weakness */
5861 if (type->t & VT_WEAK)
5862 weaken_symbol(sym);
5863 apply_visibility(sym, type);
5864 #ifdef CONFIG_TCC_BCHECK
5865 /* handles bounds now because the symbol must be defined
5866 before for the relocation */
5867 if (tcc_state->do_bounds_check) {
5868 unsigned long *bounds_ptr;
5870 greloc(bounds_section, sym, bounds_section->data_offset, R_DATA_PTR);
5871 /* then add global bound info */
5872 bounds_ptr = section_ptr_add(bounds_section, 2 * sizeof(long));
5873 bounds_ptr[0] = 0; /* relocated */
5874 bounds_ptr[1] = size;
5876 #endif
5878 if (has_init || (type->t & VT_VLA)) {
5879 int par_count = 0;
5880 decl_initializer(type, sec, addr, 1, 0, &par_count);
5881 /* restore parse state if needed */
5882 if (init_str.str) {
5883 tok_str_free(init_str.str);
5884 restore_parse_state(&saved_parse_state);
5886 /* patch flexible array member size back to -1, */
5887 /* for possible subsequent similar declarations */
5888 if (flexible_array)
5889 flexible_array->type.ref->c = -1;
5891 no_alloc: ;
5894 static void put_func_debug(Sym *sym)
5896 char buf[512];
5898 /* stabs info */
5899 /* XXX: we put here a dummy type */
5900 snprintf(buf, sizeof(buf), "%s:%c1",
5901 funcname, sym->type.t & VT_STATIC ? 'f' : 'F');
5902 put_stabs_r(buf, N_FUN, 0, file->line_num, 0,
5903 cur_text_section, sym->c);
5904 /* //gr gdb wants a line at the function */
5905 put_stabn(N_SLINE, 0, file->line_num, 0);
5906 last_ind = 0;
5907 last_line_num = 0;
5910 /* parse an old style function declaration list */
5911 /* XXX: check multiple parameter */
5912 static void func_decl_list(Sym *func_sym)
5914 AttributeDef ad;
5915 int v;
5916 Sym *s;
5917 CType btype, type;
5919 /* parse each declaration */
5920 while (tok != '{' && tok != ';' && tok != ',' && tok != TOK_EOF &&
5921 tok != TOK_ASM1 && tok != TOK_ASM2 && tok != TOK_ASM3) {
5922 if (!parse_btype(&btype, &ad))
5923 expect("declaration list");
5924 if (((btype.t & VT_BTYPE) == VT_ENUM ||
5925 (btype.t & VT_BTYPE) == VT_STRUCT) &&
5926 tok == ';') {
5927 /* we accept no variable after */
5928 } else {
5929 for(;;) {
5930 type = btype;
5931 type_decl(&type, &ad, &v, TYPE_DIRECT);
5932 /* find parameter in function parameter list */
5933 s = func_sym->next;
5934 while (s != NULL) {
5935 if ((s->v & ~SYM_FIELD) == v)
5936 goto found;
5937 s = s->next;
5939 tcc_error("declaration for parameter '%s' but no such parameter",
5940 get_tok_str(v, NULL));
5941 found:
5942 /* check that no storage specifier except 'register' was given */
5943 if (type.t & VT_STORAGE)
5944 tcc_error("storage class specified for '%s'", get_tok_str(v, NULL));
5945 convert_parameter_type(&type);
5946 /* we can add the type (NOTE: it could be local to the function) */
5947 s->type = type;
5948 /* accept other parameters */
5949 if (tok == ',')
5950 next();
5951 else
5952 break;
5955 skip(';');
5959 /* parse a function defined by symbol 'sym' and generate its code in
5960 'cur_text_section' */
5961 static void gen_function(Sym *sym)
5963 int saved_nocode_wanted = nocode_wanted;
5964 nocode_wanted = 0;
5965 ind = cur_text_section->data_offset;
5966 /* NOTE: we patch the symbol size later */
5967 put_extern_sym(sym, cur_text_section, ind, 0);
5968 funcname = get_tok_str(sym->v, NULL);
5969 func_ind = ind;
5970 /* Initialize VLA state */
5971 vla_sp_loc = &vla_sp_root_loc;
5972 vla_flags = VLA_NEED_NEW_FRAME;
5973 /* put debug symbol */
5974 if (tcc_state->do_debug)
5975 put_func_debug(sym);
5976 /* push a dummy symbol to enable local sym storage */
5977 sym_push2(&local_stack, SYM_FIELD, 0, 0);
5978 gfunc_prolog(&sym->type);
5979 #ifdef CONFIG_TCC_BCHECK
5980 if (tcc_state->do_bounds_check
5981 && !strcmp(get_tok_str(sym->v, NULL), "main")) {
5982 int i;
5984 sym = local_stack;
5985 for (i = 0, sym = local_stack; i < 2; i++, sym = sym->prev) {
5986 if (sym->v & SYM_FIELD || sym->prev->v & SYM_FIELD)
5987 break;
5988 vpush_global_sym(&func_old_type, TOK___bound_main_arg);
5989 vset(&sym->type, sym->r, sym->c);
5990 gfunc_call(1);
5993 #endif
5994 rsym = 0;
5995 block(NULL, NULL, NULL, NULL, 0, 0);
5996 gsym(rsym);
5997 gfunc_epilog();
5998 cur_text_section->data_offset = ind;
5999 label_pop(&global_label_stack, NULL);
6000 /* reset local stack */
6001 scope_stack_bottom = NULL;
6002 sym_pop(&local_stack, NULL);
6003 /* end of function */
6004 /* patch symbol size */
6005 ((ElfW(Sym) *)symtab_section->data)[sym->c].st_size =
6006 ind - func_ind;
6007 /* patch symbol weakness (this definition overrules any prototype) */
6008 if (sym->type.t & VT_WEAK)
6009 weaken_symbol(sym);
6010 apply_visibility(sym, &sym->type);
6011 if (tcc_state->do_debug) {
6012 put_stabn(N_FUN, 0, 0, ind - func_ind);
6014 /* It's better to crash than to generate wrong code */
6015 cur_text_section = NULL;
6016 funcname = ""; /* for safety */
6017 func_vt.t = VT_VOID; /* for safety */
6018 func_var = 0; /* for safety */
6019 ind = 0; /* for safety */
6020 nocode_wanted = saved_nocode_wanted;
6023 ST_FUNC void gen_inline_functions(void)
6025 Sym *sym;
6026 int *str, inline_generated, i;
6027 struct InlineFunc *fn;
6029 /* iterate while inline function are referenced */
6030 for(;;) {
6031 inline_generated = 0;
6032 for (i = 0; i < tcc_state->nb_inline_fns; ++i) {
6033 fn = tcc_state->inline_fns[i];
6034 sym = fn->sym;
6035 if (sym && sym->c) {
6036 /* the function was used: generate its code and
6037 convert it to a normal function */
6038 str = fn->token_str;
6039 fn->sym = NULL;
6040 if (file)
6041 pstrcpy(file->filename, sizeof file->filename, fn->filename);
6042 sym->r = VT_SYM | VT_CONST;
6043 sym->type.t &= ~VT_INLINE;
6045 macro_ptr = str;
6046 next();
6047 cur_text_section = text_section;
6048 gen_function(sym);
6049 macro_ptr = NULL; /* fail safe */
6051 inline_generated = 1;
6054 if (!inline_generated)
6055 break;
6057 for (i = 0; i < tcc_state->nb_inline_fns; ++i) {
6058 fn = tcc_state->inline_fns[i];
6059 str = fn->token_str;
6060 tok_str_free(str);
6062 dynarray_reset(&tcc_state->inline_fns, &tcc_state->nb_inline_fns);
6065 /* 'l' is VT_LOCAL or VT_CONST to define default storage type */
6066 static int decl0(int l, int is_for_loop_init)
6068 int v, has_init, r;
6069 CType type, btype;
6070 Sym *sym;
6071 AttributeDef ad;
6073 while (1) {
6074 if (!parse_btype(&btype, &ad)) {
6075 if (is_for_loop_init)
6076 return 0;
6077 /* skip redundant ';' */
6078 /* XXX: find more elegant solution */
6079 if (tok == ';') {
6080 next();
6081 continue;
6083 if (l == VT_CONST &&
6084 (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
6085 /* global asm block */
6086 asm_global_instr();
6087 continue;
6089 /* special test for old K&R protos without explicit int
6090 type. Only accepted when defining global data */
6091 if (l == VT_LOCAL || tok < TOK_DEFINE)
6092 break;
6093 btype.t = VT_INT;
6095 if (((btype.t & VT_BTYPE) == VT_ENUM ||
6096 (btype.t & VT_BTYPE) == VT_STRUCT) &&
6097 tok == ';') {
6098 /* we accept no variable after */
6099 next();
6100 continue;
6102 while (1) { /* iterate thru each declaration */
6103 char *asm_label; // associated asm label
6104 type = btype;
6105 type_decl(&type, &ad, &v, TYPE_DIRECT);
6106 #if 0
6108 char buf[500];
6109 type_to_str(buf, sizeof(buf), t, get_tok_str(v, NULL));
6110 printf("type = '%s'\n", buf);
6112 #endif
6113 if ((type.t & VT_BTYPE) == VT_FUNC) {
6114 if ((type.t & VT_STATIC) && (l == VT_LOCAL)) {
6115 tcc_error("function without file scope cannot be static");
6117 /* if old style function prototype, we accept a
6118 declaration list */
6119 sym = type.ref;
6120 if (sym->c == FUNC_OLD)
6121 func_decl_list(sym);
6124 asm_label = NULL;
6125 if (gnu_ext && (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
6126 CString astr;
6128 asm_label_instr(&astr);
6129 asm_label = tcc_strdup(astr.data);
6130 cstr_free(&astr);
6132 /* parse one last attribute list, after asm label */
6133 parse_attribute(&ad);
6136 if (ad.a.weak)
6137 type.t |= VT_WEAK;
6138 #ifdef TCC_TARGET_PE
6139 if (ad.a.func_import)
6140 type.t |= VT_IMPORT;
6141 if (ad.a.func_export)
6142 type.t |= VT_EXPORT;
6143 #endif
6144 type.t |= ad.a.visibility << VT_VIS_SHIFT;
6146 if (tok == '{') {
6147 if (l == VT_LOCAL)
6148 tcc_error("cannot use local functions");
6149 if ((type.t & VT_BTYPE) != VT_FUNC)
6150 expect("function definition");
6152 /* reject abstract declarators in function definition */
6153 sym = type.ref;
6154 while ((sym = sym->next) != NULL)
6155 if (!(sym->v & ~SYM_FIELD))
6156 expect("identifier");
6158 /* XXX: cannot do better now: convert extern line to static inline */
6159 if ((type.t & (VT_EXTERN | VT_INLINE)) == (VT_EXTERN | VT_INLINE))
6160 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
6162 sym = sym_find(v);
6163 if (sym) {
6164 Sym *ref;
6165 if ((sym->type.t & VT_BTYPE) != VT_FUNC)
6166 goto func_error1;
6168 ref = sym->type.ref;
6169 if (0 == ref->a.func_proto)
6170 tcc_error("redefinition of '%s'", get_tok_str(v, NULL));
6172 /* use func_call from prototype if not defined */
6173 if (ref->a.func_call != FUNC_CDECL
6174 && type.ref->a.func_call == FUNC_CDECL)
6175 type.ref->a.func_call = ref->a.func_call;
6177 /* use export from prototype */
6178 if (ref->a.func_export)
6179 type.ref->a.func_export = 1;
6181 /* use static from prototype */
6182 if (sym->type.t & VT_STATIC)
6183 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
6185 /* If the definition has no visibility use the
6186 one from prototype. */
6187 if (! (type.t & VT_VIS_MASK))
6188 type.t |= sym->type.t & VT_VIS_MASK;
6190 if (!is_compatible_types(&sym->type, &type)) {
6191 func_error1:
6192 tcc_error("incompatible types for redefinition of '%s'",
6193 get_tok_str(v, NULL));
6195 type.ref->a.func_proto = 0;
6196 /* if symbol is already defined, then put complete type */
6197 sym->type = type;
6198 } else {
6199 /* put function symbol */
6200 sym = global_identifier_push(v, type.t, 0);
6201 sym->type.ref = type.ref;
6204 /* static inline functions are just recorded as a kind
6205 of macro. Their code will be emitted at the end of
6206 the compilation unit only if they are used */
6207 if ((type.t & (VT_INLINE | VT_STATIC)) ==
6208 (VT_INLINE | VT_STATIC)) {
6209 TokenString func_str;
6210 int block_level;
6211 struct InlineFunc *fn;
6212 const char *filename;
6214 tok_str_new(&func_str);
6216 block_level = 0;
6217 for(;;) {
6218 int t;
6219 if (tok == TOK_EOF)
6220 tcc_error("unexpected end of file");
6221 tok_str_add_tok(&func_str);
6222 t = tok;
6223 next();
6224 if (t == '{') {
6225 block_level++;
6226 } else if (t == '}') {
6227 block_level--;
6228 if (block_level == 0)
6229 break;
6232 tok_str_add(&func_str, -1);
6233 tok_str_add(&func_str, 0);
6234 filename = file ? file->filename : "";
6235 fn = tcc_malloc(sizeof *fn + strlen(filename));
6236 strcpy(fn->filename, filename);
6237 fn->sym = sym;
6238 fn->token_str = func_str.str;
6239 dynarray_add((void ***)&tcc_state->inline_fns, &tcc_state->nb_inline_fns, fn);
6241 } else {
6242 /* compute text section */
6243 cur_text_section = ad.section;
6244 if (!cur_text_section)
6245 cur_text_section = text_section;
6246 sym->r = VT_SYM | VT_CONST;
6247 gen_function(sym);
6249 break;
6250 } else {
6251 if (btype.t & VT_TYPEDEF) {
6252 /* save typedefed type */
6253 /* XXX: test storage specifiers ? */
6254 sym = sym_push(v, &type, 0, 0);
6255 sym->a = ad.a;
6256 sym->type.t |= VT_TYPEDEF;
6257 } else {
6258 r = 0;
6259 if ((type.t & VT_BTYPE) == VT_FUNC) {
6260 /* external function definition */
6261 /* specific case for func_call attribute */
6262 ad.a.func_proto = 1;
6263 type.ref->a = ad.a;
6264 } else if (!(type.t & VT_ARRAY)) {
6265 /* not lvalue if array */
6266 r |= lvalue_type(type.t);
6268 has_init = (tok == '=');
6269 if (has_init && (type.t & VT_VLA))
6270 tcc_error("Variable length array cannot be initialized");
6271 if ((btype.t & VT_EXTERN) || ((type.t & VT_BTYPE) == VT_FUNC) ||
6272 ((type.t & VT_ARRAY) && (type.t & VT_STATIC) &&
6273 !has_init && l == VT_CONST && type.ref->c < 0)) {
6274 /* external variable or function */
6275 /* NOTE: as GCC, uninitialized global static
6276 arrays of null size are considered as
6277 extern */
6278 sym = external_sym(v, &type, r, asm_label);
6280 if (ad.alias_target) {
6281 Section tsec;
6282 Elf32_Sym *esym;
6283 Sym *alias_target;
6285 alias_target = sym_find(ad.alias_target);
6286 if (!alias_target || !alias_target->c)
6287 tcc_error("unsupported forward __alias__ attribute");
6288 esym = &((Elf32_Sym *)symtab_section->data)[alias_target->c];
6289 tsec.sh_num = esym->st_shndx;
6290 put_extern_sym2(sym, &tsec, esym->st_value, esym->st_size, 0);
6292 } else {
6293 type.t |= (btype.t & VT_STATIC); /* Retain "static". */
6294 if (type.t & VT_STATIC)
6295 r |= VT_CONST;
6296 else
6297 r |= l;
6298 if (has_init)
6299 next();
6300 decl_initializer_alloc(&type, &ad, r, has_init, v, asm_label, l);
6303 if (tok != ',') {
6304 if (is_for_loop_init)
6305 return 1;
6306 skip(';');
6307 break;
6309 next();
6311 ad.a.aligned = 0;
6314 return 0;
6317 ST_FUNC void decl(int l)
6319 decl0(l, 0);