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