?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
CodingStyle: Add notes on language and testing.
[tinycc.git] / tccgen.c
blob3b5ad7594f51981a359a6d7ff4576fa30811cc29
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 *scope_stack_bottom;
54 ST_DATA Sym *define_stack;
55 ST_DATA Sym *global_label_stack;
56 ST_DATA Sym *local_label_stack;
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 unary_type(CType *type);
88 static void vla_runtime_type_size(CType *type, int *a);
89 static void vla_sp_restore(void);
90 static void vla_sp_restore_root(void);
91 static int is_compatible_parameter_types(CType *type1, CType *type2);
92 static void expr_type(CType *type);
93 ST_FUNC void vpush64(int ty, unsigned long long v);
94 ST_FUNC void vpush(CType *type);
95 ST_FUNC int gvtst(int inv, int t);
96 ST_FUNC int is_btype_size(int bt);
97
98 ST_INLN int is_float(int t)
99 {
100 int bt;
101 bt = t & VT_BTYPE;
102 return bt == VT_LDOUBLE || bt == VT_DOUBLE || bt == VT_FLOAT || bt == VT_QFLOAT;
103 }
104
105 /* we use our own 'finite' function to avoid potential problems with
106 non standard math libs */
107 /* XXX: endianness dependent */
108 ST_FUNC int ieee_finite(double d)
109 {
110 int p[4];
111 memcpy(p, &d, sizeof(double));
112 return ((unsigned)((p[1] | 0x800fffff) + 1)) >> 31;
113 }
114
115 ST_FUNC void test_lvalue(void)
116 {
117 if (!(vtop->r & VT_LVAL))
118 expect("lvalue");
119 }
120
121 ST_FUNC void check_vstack(void)
122 {
123 if (pvtop != vtop)
124 tcc_error("internal compiler error: vstack leak (%d)", vtop - pvtop);
125 }
126
127 /* ------------------------------------------------------------------------- */
128 /* symbol allocator */
129 static Sym *__sym_malloc(void)
130 {
131 Sym *sym_pool, *sym, *last_sym;
132 int i;
133
134 sym_pool = tcc_malloc(SYM_POOL_NB * sizeof(Sym));
135 dynarray_add(&sym_pools, &nb_sym_pools, sym_pool);
136
137 last_sym = sym_free_first;
138 sym = sym_pool;
139 for(i = 0; i < SYM_POOL_NB; i++) {
140 sym->next = last_sym;
141 last_sym = sym;
142 sym++;
143 }
144 sym_free_first = last_sym;
145 return last_sym;
146 }
147
148 static inline Sym *sym_malloc(void)
149 {
150 Sym *sym;
151 sym = sym_free_first;
152 if (!sym)
153 sym = __sym_malloc();
154 sym_free_first = sym->next;
155 return sym;
156 }
157
158 ST_INLN void sym_free(Sym *sym)
159 {
160 sym->next = sym_free_first;
161 sym_free_first = sym;
162 }
163
164 /* push, without hashing */
165 ST_FUNC Sym *sym_push2(Sym **ps, int v, int t, long c)
166 {
167 Sym *s;
168 if (ps == &local_stack) {
169 for (s = *ps; s && s != scope_stack_bottom; s = s->prev)
170 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM && s->v == v)
171 tcc_error("incompatible types for redefinition of '%s'",
172 get_tok_str(v, NULL));
173 }
174 s = sym_malloc();
175 s->asm_label = 0;
176 s->v = v;
177 s->type.t = t;
178 s->type.ref = NULL;
179 #ifdef _WIN64
180 s->d = NULL;
181 #endif
182 s->c = c;
183 s->next = NULL;
184 /* add in stack */
185 s->prev = *ps;
186 *ps = s;
187 return s;
188 }
189
190 /* find a symbol and return its associated structure. 's' is the top
191 of the symbol stack */
192 ST_FUNC Sym *sym_find2(Sym *s, int v)
193 {
194 while (s) {
195 if (s->v == v)
196 return s;
197 else if (s->v == -1)
198 return NULL;
199 s = s->prev;
200 }
201 return NULL;
202 }
203
204 /* structure lookup */
205 ST_INLN Sym *struct_find(int v)
206 {
207 v -= TOK_IDENT;
208 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
209 return NULL;
210 return table_ident[v]->sym_struct;
211 }
212
213 /* find an identifier */
214 ST_INLN Sym *sym_find(int v)
215 {
216 v -= TOK_IDENT;
217 if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT))
218 return NULL;
219 return table_ident[v]->sym_identifier;
220 }
221
222 /* push a given symbol on the symbol stack */
223 ST_FUNC Sym *sym_push(int v, CType *type, int r, int c)
224 {
225 Sym *s, **ps;
226 TokenSym *ts;
227
228 if (local_stack)
229 ps = &local_stack;
230 else
231 ps = &global_stack;
232 s = sym_push2(ps, v, type->t, c);
233 s->type.ref = type->ref;
234 s->r = r;
235 /* don't record fields or anonymous symbols */
236 /* XXX: simplify */
237 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
238 /* record symbol in token array */
239 ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT];
240 if (v & SYM_STRUCT)
241 ps = &ts->sym_struct;
242 else
243 ps = &ts->sym_identifier;
244 s->prev_tok = *ps;
245 *ps = s;
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_PTR || bt2 == VT_PTR) {
1703 /* at least one operand is a pointer */
1704 /* relationnal op: must be both pointers */
1705 if (op >= TOK_ULT && op <= TOK_LOR) {
1706 check_comparison_pointer_types(vtop - 1, vtop, op);
1707 /* pointers are handled are unsigned */
1708 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
1709 t = VT_LLONG | VT_UNSIGNED;
1710 #else
1711 t = VT_INT | VT_UNSIGNED;
1712 #endif
1713 goto std_op;
1714 }
1715 /* if both pointers, then it must be the '-' op */
1716 if (bt1 == VT_PTR && bt2 == VT_PTR) {
1717 if (op != '-')
1718 tcc_error("cannot use pointers here");
1719 check_comparison_pointer_types(vtop - 1, vtop, op);
1720 /* XXX: check that types are compatible */
1721 if (vtop[-1].type.t & VT_VLA) {
1722 vla_runtime_pointed_size(&vtop[-1].type);
1723 } else {
1724 vpushi(pointed_size(&vtop[-1].type));
1725 }
1726 vrott(3);
1727 gen_opic(op);
1728 /* set to integer type */
1729 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
1730 vtop->type.t = VT_LLONG;
1731 #else
1732 vtop->type.t = VT_INT;
1733 #endif
1734 vswap();
1735 gen_op(TOK_PDIV);
1736 } else {
1737 /* exactly one pointer : must be '+' or '-'. */
1738 if (op != '-' && op != '+')
1739 tcc_error("cannot use pointers here");
1740 /* Put pointer as first operand */
1741 if (bt2 == VT_PTR) {
1742 vswap();
1743 swap(&t1, &t2);
1744 }
1745 type1 = vtop[-1].type;
1746 type1.t &= ~VT_ARRAY;
1747 if (vtop[-1].type.t & VT_VLA)
1748 vla_runtime_pointed_size(&vtop[-1].type);
1749 else {
1750 u = pointed_size(&vtop[-1].type);
1751 if (u < 0)
1752 tcc_error("unknown array element size");
1753 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
1754 vpushll(u);
1755 #else
1756 /* XXX: cast to int ? (long long case) */
1757 vpushi(u);
1758 #endif
1759 }
1760 gen_op('*');
1761 #if 0
1762 /* #ifdef CONFIG_TCC_BCHECK
1763 The main reason to removing this code:
1764 #include <stdio.h>
1765 int main ()
1766 {
1767 int v[10];
1768 int i = 10;
1769 int j = 9;
1770 fprintf(stderr, "v+i-j = %p\n", v+i-j);
1771 fprintf(stderr, "v+(i-j) = %p\n", v+(i-j));
1772 }
1773 When this code is on. then the output looks like
1774 v+i-j = 0xfffffffe
1775 v+(i-j) = 0xbff84000
1776 */
1777 /* if evaluating constant expression, no code should be
1778 generated, so no bound check */
1779 if (tcc_state->do_bounds_check && !const_wanted) {
1780 /* if bounded pointers, we generate a special code to
1781 test bounds */
1782 if (op == '-') {
1783 vpushi(0);
1784 vswap();
1785 gen_op('-');
1786 }
1787 gen_bounded_ptr_add();
1788 } else
1789 #endif
1790 {
1791 gen_opic(op);
1792 }
1793 /* put again type if gen_opic() swaped operands */
1794 vtop->type = type1;
1795 }
1796 } else if (is_float(bt1) || is_float(bt2)) {
1797 /* compute bigger type and do implicit casts */
1798 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
1799 t = VT_LDOUBLE;
1800 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
1801 t = VT_DOUBLE;
1802 } else {
1803 t = VT_FLOAT;
1804 }
1805 /* floats can only be used for a few operations */
1806 if (op != '+' && op != '-' && op != '*' && op != '/' &&
1807 (op < TOK_ULT || op > TOK_GT))
1808 tcc_error("invalid operands for binary operation");
1809 goto std_op;
1810 } else if (op == TOK_SHR || op == TOK_SAR || op == TOK_SHL) {
1811 t = bt1 == VT_LLONG ? VT_LLONG : VT_INT;
1812 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (t | VT_UNSIGNED))
1813 t |= VT_UNSIGNED;
1814 goto std_op;
1815 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
1816 /* cast to biggest op */
1817 t = VT_LLONG;
1818 /* convert to unsigned if it does not fit in a long long */
1819 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
1820 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
1821 t |= VT_UNSIGNED;
1822 goto std_op;
1823 } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) {
1824 tcc_error("comparison of struct");
1825 } else {
1826 /* integer operations */
1827 t = VT_INT;
1828 /* convert to unsigned if it does not fit in an integer */
1829 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
1830 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
1831 t |= VT_UNSIGNED;
1832 std_op:
1833 /* XXX: currently, some unsigned operations are explicit, so
1834 we modify them here */
1835 if (t & VT_UNSIGNED) {
1836 if (op == TOK_SAR)
1837 op = TOK_SHR;
1838 else if (op == '/')
1839 op = TOK_UDIV;
1840 else if (op == '%')
1841 op = TOK_UMOD;
1842 else if (op == TOK_LT)
1843 op = TOK_ULT;
1844 else if (op == TOK_GT)
1845 op = TOK_UGT;
1846 else if (op == TOK_LE)
1847 op = TOK_ULE;
1848 else if (op == TOK_GE)
1849 op = TOK_UGE;
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_ENUM || 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 {
2213 /* char, void, function, _Bool */
2214 *a = 1;
2215 return 1;
2216 }
2217 }
2218
2219 /* push type size as known at runtime time on top of value stack. Put
2220 alignment at 'a' */
2221 ST_FUNC void vla_runtime_type_size(CType *type, int *a)
2222 {
2223 if (type->t & VT_VLA) {
2224 vset(&int_type, VT_LOCAL|VT_LVAL, type->ref->c);
2225 } else {
2226 vpushi(type_size(type, a));
2227 }
2228 }
2229
2230 static void vla_sp_restore(void) {
2231 if (vlas_in_scope) {
2232 gen_vla_sp_restore(vla_sp_loc);
2233 }
2234 }
2235
2236 static void vla_sp_restore_root(void) {
2237 if (vlas_in_scope) {
2238 gen_vla_sp_restore(vla_sp_root_loc);
2239 }
2240 }
2241
2242 /* return the pointed type of t */
2243 static inline CType *pointed_type(CType *type)
2244 {
2245 return &type->ref->type;
2246 }
2247
2248 /* modify type so that its it is a pointer to type. */
2249 ST_FUNC void mk_pointer(CType *type)
2250 {
2251 Sym *s;
2252 s = sym_push(SYM_FIELD, type, 0, -1);
2253 type->t = VT_PTR | (type->t & ~VT_TYPE);
2254 type->ref = s;
2255 }
2256
2257 /* compare function types. OLD functions match any new functions */
2258 static int is_compatible_func(CType *type1, CType *type2)
2259 {
2260 Sym *s1, *s2;
2261
2262 s1 = type1->ref;
2263 s2 = type2->ref;
2264 if (!is_compatible_types(&s1->type, &s2->type))
2265 return 0;
2266 /* check func_call */
2267 if (s1->a.func_call != s2->a.func_call)
2268 return 0;
2269 /* XXX: not complete */
2270 if (s1->c == FUNC_OLD || s2->c == FUNC_OLD)
2271 return 1;
2272 if (s1->c != s2->c)
2273 return 0;
2274 while (s1 != NULL) {
2275 if (s2 == NULL)
2276 return 0;
2277 if (!is_compatible_parameter_types(&s1->type, &s2->type))
2278 return 0;
2279 s1 = s1->next;
2280 s2 = s2->next;
2281 }
2282 if (s2)
2283 return 0;
2284 return 1;
2285 }
2286
2287 /* return true if type1 and type2 are the same. If unqualified is
2288 true, qualifiers on the types are ignored.
2289
2290 - enums are not checked as gcc __builtin_types_compatible_p ()
2291 */
2292 static int compare_types(CType *type1, CType *type2, int unqualified)
2293 {
2294 int bt1, t1, t2;
2295
2296 t1 = type1->t & VT_TYPE;
2297 t2 = type2->t & VT_TYPE;
2298 if (unqualified) {
2299 /* strip qualifiers before comparing */
2300 t1 &= ~(VT_CONSTANT | VT_VOLATILE);
2301 t2 &= ~(VT_CONSTANT | VT_VOLATILE);
2302 }
2303 /* Default Vs explicit signedness only matters for char */
2304 if ((t1 & VT_BTYPE) != VT_BYTE) {
2305 t1 &= ~VT_DEFSIGN;
2306 t2 &= ~VT_DEFSIGN;
2307 }
2308 /* XXX: bitfields ? */
2309 if (t1 != t2)
2310 return 0;
2311 /* test more complicated cases */
2312 bt1 = t1 & VT_BTYPE;
2313 if (bt1 == VT_PTR) {
2314 type1 = pointed_type(type1);
2315 type2 = pointed_type(type2);
2316 return is_compatible_types(type1, type2);
2317 } else if (bt1 == VT_STRUCT) {
2318 return (type1->ref == type2->ref);
2319 } else if (bt1 == VT_FUNC) {
2320 return is_compatible_func(type1, type2);
2321 } else {
2322 return 1;
2323 }
2324 }
2325
2326 /* return true if type1 and type2 are exactly the same (including
2327 qualifiers).
2328 */
2329 static int is_compatible_types(CType *type1, CType *type2)
2330 {
2331 return compare_types(type1,type2,0);
2332 }
2333
2334 /* return true if type1 and type2 are the same (ignoring qualifiers).
2335 */
2336 static int is_compatible_parameter_types(CType *type1, CType *type2)
2337 {
2338 return compare_types(type1,type2,1);
2339 }
2340
2341 /* print a type. If 'varstr' is not NULL, then the variable is also
2342 printed in the type */
2343 /* XXX: union */
2344 /* XXX: add array and function pointers */
2345 static void type_to_str(char *buf, int buf_size,
2346 CType *type, const char *varstr)
2347 {
2348 int bt, v, t;
2349 Sym *s, *sa;
2350 char buf1[256];
2351 const char *tstr;
2352
2353 t = type->t & VT_TYPE;
2354 bt = t & VT_BTYPE;
2355 buf[0] = '\0';
2356 if (t & VT_CONSTANT)
2357 pstrcat(buf, buf_size, "const ");
2358 if (t & VT_VOLATILE)
2359 pstrcat(buf, buf_size, "volatile ");
2360 if ((t & (VT_DEFSIGN | VT_UNSIGNED)) == (VT_DEFSIGN | VT_UNSIGNED))
2361 pstrcat(buf, buf_size, "unsigned ");
2362 else if (t & VT_DEFSIGN)
2363 pstrcat(buf, buf_size, "signed ");
2364 switch(bt) {
2365 case VT_VOID:
2366 tstr = "void";
2367 goto add_tstr;
2368 case VT_BOOL:
2369 tstr = "_Bool";
2370 goto add_tstr;
2371 case VT_BYTE:
2372 tstr = "char";
2373 goto add_tstr;
2374 case VT_SHORT:
2375 tstr = "short";
2376 goto add_tstr;
2377 case VT_INT:
2378 tstr = "int";
2379 goto add_tstr;
2380 case VT_LONG:
2381 tstr = "long";
2382 goto add_tstr;
2383 case VT_LLONG:
2384 tstr = "long long";
2385 goto add_tstr;
2386 case VT_FLOAT:
2387 tstr = "float";
2388 goto add_tstr;
2389 case VT_DOUBLE:
2390 tstr = "double";
2391 goto add_tstr;
2392 case VT_LDOUBLE:
2393 tstr = "long double";
2394 add_tstr:
2395 pstrcat(buf, buf_size, tstr);
2396 break;
2397 case VT_ENUM:
2398 case VT_STRUCT:
2399 if (bt == VT_STRUCT)
2400 tstr = "struct ";
2401 else
2402 tstr = "enum ";
2403 pstrcat(buf, buf_size, tstr);
2404 v = type->ref->v & ~SYM_STRUCT;
2405 if (v >= SYM_FIRST_ANOM)
2406 pstrcat(buf, buf_size, "<anonymous>");
2407 else
2408 pstrcat(buf, buf_size, get_tok_str(v, NULL));
2409 break;
2410 case VT_FUNC:
2411 s = type->ref;
2412 type_to_str(buf, buf_size, &s->type, varstr);
2413 pstrcat(buf, buf_size, "(");
2414 sa = s->next;
2415 while (sa != NULL) {
2416 type_to_str(buf1, sizeof(buf1), &sa->type, NULL);
2417 pstrcat(buf, buf_size, buf1);
2418 sa = sa->next;
2419 if (sa)
2420 pstrcat(buf, buf_size, ", ");
2421 }
2422 pstrcat(buf, buf_size, ")");
2423 goto no_var;
2424 case VT_PTR:
2425 s = type->ref;
2426 if (t & VT_ARRAY) {
2427 snprintf(buf1, sizeof(buf1), "%s[%ld]", varstr ? varstr : "", s->c);
2428 type_to_str(buf, buf_size, &s->type, buf1);
2429 goto no_var;
2430 }
2431 pstrcpy(buf1, sizeof(buf1), "*");
2432 if (t & VT_CONSTANT)
2433 pstrcat(buf1, buf_size, "const ");
2434 if (t & VT_VOLATILE)
2435 pstrcat(buf1, buf_size, "volatile ");
2436 if (varstr)
2437 pstrcat(buf1, sizeof(buf1), varstr);
2438 type_to_str(buf, buf_size, &s->type, buf1);
2439 goto no_var;
2440 }
2441 if (varstr) {
2442 pstrcat(buf, buf_size, " ");
2443 pstrcat(buf, buf_size, varstr);
2444 }
2445 no_var: ;
2446 }
2447
2448 /* verify type compatibility to store vtop in 'dt' type, and generate
2449 casts if needed. */
2450 static void gen_assign_cast(CType *dt)
2451 {
2452 CType *st, *type1, *type2, tmp_type1, tmp_type2;
2453 char buf1[256], buf2[256];
2454 int dbt, sbt;
2455
2456 st = &vtop->type; /* source type */
2457 dbt = dt->t & VT_BTYPE;
2458 sbt = st->t & VT_BTYPE;
2459 if (sbt == VT_VOID || dbt == VT_VOID) {
2460 if (sbt == VT_VOID && dbt == VT_VOID)
2461 ; /*
2462 It is Ok if both are void
2463 A test program:
2464 void func1() {}
2465 void func2() {
2466 return func1();
2467 }
2468 gcc accepts this program
2469 */
2470 else
2471 tcc_error("cannot cast from/to void");
2472 }
2473 if (dt->t & VT_CONSTANT)
2474 tcc_warning("assignment of read-only location");
2475 switch(dbt) {
2476 case VT_PTR:
2477 /* special cases for pointers */
2478 /* '0' can also be a pointer */
2479 if (is_null_pointer(vtop))
2480 goto type_ok;
2481 /* accept implicit pointer to integer cast with warning */
2482 if (is_integer_btype(sbt)) {
2483 tcc_warning("assignment makes pointer from integer without a cast");
2484 goto type_ok;
2485 }
2486 type1 = pointed_type(dt);
2487 /* a function is implicitely a function pointer */
2488 if (sbt == VT_FUNC) {
2489 if ((type1->t & VT_BTYPE) != VT_VOID &&
2490 !is_compatible_types(pointed_type(dt), st))
2491 tcc_warning("assignment from incompatible pointer type");
2492 goto type_ok;
2493 }
2494 if (sbt != VT_PTR)
2495 goto error;
2496 type2 = pointed_type(st);
2497 if ((type1->t & VT_BTYPE) == VT_VOID ||
2498 (type2->t & VT_BTYPE) == VT_VOID) {
2499 /* void * can match anything */
2500 } else {
2501 /* exact type match, except for unsigned */
2502 tmp_type1 = *type1;
2503 tmp_type2 = *type2;
2504 tmp_type1.t &= ~(VT_DEFSIGN | VT_UNSIGNED | VT_CONSTANT |
2505 VT_VOLATILE);
2506 tmp_type2.t &= ~(VT_DEFSIGN | VT_UNSIGNED | VT_CONSTANT |
2507 VT_VOLATILE);
2508 if (!is_compatible_types(&tmp_type1, &tmp_type2))
2509 tcc_warning("assignment from incompatible pointer type");
2510 }
2511 /* check const and volatile */
2512 if ((!(type1->t & VT_CONSTANT) && (type2->t & VT_CONSTANT)) ||
2513 (!(type1->t & VT_VOLATILE) && (type2->t & VT_VOLATILE)))
2514 tcc_warning("assignment discards qualifiers from pointer target type");
2515 break;
2516 case VT_BYTE:
2517 case VT_SHORT:
2518 case VT_INT:
2519 case VT_LLONG:
2520 if (sbt == VT_PTR || sbt == VT_FUNC) {
2521 tcc_warning("assignment makes integer from pointer without a cast");
2522 }
2523 /* XXX: more tests */
2524 break;
2525 case VT_STRUCT:
2526 tmp_type1 = *dt;
2527 tmp_type2 = *st;
2528 tmp_type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
2529 tmp_type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
2530 if (!is_compatible_types(&tmp_type1, &tmp_type2)) {
2531 error:
2532 type_to_str(buf1, sizeof(buf1), st, NULL);
2533 type_to_str(buf2, sizeof(buf2), dt, NULL);
2534 tcc_error("cannot cast '%s' to '%s'", buf1, buf2);
2535 }
2536 break;
2537 }
2538 type_ok:
2539 gen_cast(dt);
2540 }
2541
2542 /* store vtop in lvalue pushed on stack */
2543 ST_FUNC void vstore(void)
2544 {
2545 int sbt, dbt, ft, r, t, size, align, bit_size, bit_pos, rc, delayed_cast;
2546
2547 ft = vtop[-1].type.t;
2548 sbt = vtop->type.t & VT_BTYPE;
2549 dbt = ft & VT_BTYPE;
2550 if ((((sbt == VT_INT || sbt == VT_SHORT) && dbt == VT_BYTE) ||
2551 (sbt == VT_INT && dbt == VT_SHORT))
2552 && !(vtop->type.t & VT_BITFIELD)) {
2553 /* optimize char/short casts */
2554 delayed_cast = VT_MUSTCAST;
2555 vtop->type.t = (ft & VT_TYPE & ~VT_BITFIELD &
2556 ((1 << VT_STRUCT_SHIFT) - 1));
2557 /* XXX: factorize */
2558 if (ft & VT_CONSTANT)
2559 tcc_warning("assignment of read-only location");
2560 } else {
2561 delayed_cast = 0;
2562 if (!(ft & VT_BITFIELD))
2563 gen_assign_cast(&vtop[-1].type);
2564 }
2565
2566 if (sbt == VT_STRUCT) {
2567 /* if structure, only generate pointer */
2568 /* structure assignment : generate memcpy */
2569 /* XXX: optimize if small size */
2570 if (!nocode_wanted) {
2571 size = type_size(&vtop->type, &align);
2572
2573 /* destination */
2574 vswap();
2575 vtop->type.t = VT_PTR;
2576 gaddrof();
2577
2578 /* address of memcpy() */
2579 #ifdef TCC_ARM_EABI
2580 if(!(align & 7))
2581 vpush_global_sym(&func_old_type, TOK_memcpy8);
2582 else if(!(align & 3))
2583 vpush_global_sym(&func_old_type, TOK_memcpy4);
2584 else
2585 #endif
2586 /* Use memmove, rather than memcpy, as dest and src may be same: */
2587 vpush_global_sym(&func_old_type, TOK_memmove);
2588
2589 vswap();
2590 /* source */
2591 vpushv(vtop - 2);
2592 vtop->type.t = VT_PTR;
2593 gaddrof();
2594 /* type size */
2595 vpushi(size);
2596 gfunc_call(3);
2597 } else {
2598 vswap();
2599 vpop();
2600 }
2601 /* leave source on stack */
2602 } else if (ft & VT_BITFIELD) {
2603 /* bitfield store handling */
2604
2605 /* save lvalue as expression result (example: s.b = s.a = n;) */
2606 vdup(), vtop[-1] = vtop[-2];
2607
2608 bit_pos = (ft >> VT_STRUCT_SHIFT) & 0x3f;
2609 bit_size = (ft >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
2610 /* remove bit field info to avoid loops */
2611 vtop[-1].type.t = ft & ~VT_BITFIELD & ((1 << VT_STRUCT_SHIFT) - 1);
2612
2613 if((ft & VT_BTYPE) == VT_BOOL) {
2614 gen_cast(&vtop[-1].type);
2615 vtop[-1].type.t = (vtop[-1].type.t & ~VT_BTYPE) | (VT_BYTE | VT_UNSIGNED);
2616 }
2617
2618 /* duplicate destination */
2619 vdup();
2620 vtop[-1] = vtop[-2];
2621
2622 /* mask and shift source */
2623 if((ft & VT_BTYPE) != VT_BOOL) {
2624 if((ft & VT_BTYPE) == VT_LLONG) {
2625 vpushll((1ULL << bit_size) - 1ULL);
2626 } else {
2627 vpushi((1 << bit_size) - 1);
2628 }
2629 gen_op('&');
2630 }
2631 vpushi(bit_pos);
2632 gen_op(TOK_SHL);
2633 /* load destination, mask and or with source */
2634 vswap();
2635 if((ft & VT_BTYPE) == VT_LLONG) {
2636 vpushll(~(((1ULL << bit_size) - 1ULL) << bit_pos));
2637 } else {
2638 vpushi(~(((1 << bit_size) - 1) << bit_pos));
2639 }
2640 gen_op('&');
2641 gen_op('|');
2642 /* store result */
2643 vstore();
2644 /* ... and discard */
2645 vpop();
2646
2647 } else {
2648 if (!nocode_wanted) {
2649 #ifdef CONFIG_TCC_BCHECK
2650 /* bound check case */
2651 if (vtop[-1].r & VT_MUSTBOUND) {
2652 vswap();
2653 gbound();
2654 vswap();
2655 }
2656 #endif
2657 rc = RC_INT;
2658 if (is_float(ft)) {
2659 rc = RC_FLOAT;
2660 #ifdef TCC_TARGET_X86_64
2661 if ((ft & VT_BTYPE) == VT_LDOUBLE) {
2662 rc = RC_ST0;
2663 } else if ((ft & VT_BTYPE) == VT_QFLOAT) {
2664 rc = RC_FRET;
2665 }
2666 #endif
2667 }
2668 r = gv(rc); /* generate value */
2669 /* if lvalue was saved on stack, must read it */
2670 if ((vtop[-1].r & VT_VALMASK) == VT_LLOCAL) {
2671 SValue sv;
2672 t = get_reg(RC_INT);
2673 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
2674 sv.type.t = VT_PTR;
2675 #else
2676 sv.type.t = VT_INT;
2677 #endif
2678 sv.r = VT_LOCAL | VT_LVAL;
2679 sv.c.i = vtop[-1].c.i;
2680 load(t, &sv);
2681 vtop[-1].r = t | VT_LVAL;
2682 }
2683 /* two word case handling : store second register at word + 4 (or +8 for x86-64) */
2684 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
2685 if (((ft & VT_BTYPE) == VT_QLONG) || ((ft & VT_BTYPE) == VT_QFLOAT)) {
2686 int addr_type = VT_LLONG, load_size = 8, load_type = ((vtop->type.t & VT_BTYPE) == VT_QLONG) ? VT_LLONG : VT_DOUBLE;
2687 #else
2688 if ((ft & VT_BTYPE) == VT_LLONG) {
2689 int addr_type = VT_INT, load_size = 4, load_type = VT_INT;
2690 #endif
2691 vtop[-1].type.t = load_type;
2692 store(r, vtop - 1);
2693 vswap();
2694 /* convert to int to increment easily */
2695 vtop->type.t = addr_type;
2696 gaddrof();
2697 vpushi(load_size);
2698 gen_op('+');
2699 vtop->r |= VT_LVAL;
2700 vswap();
2701 vtop[-1].type.t = load_type;
2702 /* XXX: it works because r2 is spilled last ! */
2703 store(vtop->r2, vtop - 1);
2704 } else {
2705 store(r, vtop - 1);
2706 }
2707 }
2708 vswap();
2709 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
2710 vtop->r |= delayed_cast;
2711 }
2712 }
2713
2714 /* post defines POST/PRE add. c is the token ++ or -- */
2715 ST_FUNC void inc(int post, int c)
2716 {
2717 test_lvalue();
2718 vdup(); /* save lvalue */
2719 if (post) {
2720 if (!nocode_wanted)
2721 gv_dup(); /* duplicate value */
2722 else
2723 vdup(); /* duplicate value */
2724 vrotb(3);
2725 vrotb(3);
2726 }
2727 /* add constant */
2728 vpushi(c - TOK_MID);
2729 gen_op('+');
2730 vstore(); /* store value */
2731 if (post)
2732 vpop(); /* if post op, return saved value */
2733 }
2734
2735 /* Parse GNUC __attribute__ extension. Currently, the following
2736 extensions are recognized:
2737 - aligned(n) : set data/function alignment.
2738 - packed : force data alignment to 1
2739 - section(x) : generate data/code in this section.
2740 - unused : currently ignored, but may be used someday.
2741 - regparm(n) : pass function parameters in registers (i386 only)
2742 */
2743 static void parse_attribute(AttributeDef *ad)
2744 {
2745 int t, n;
2746
2747 while (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) {
2748 next();
2749 skip('(');
2750 skip('(');
2751 while (tok != ')') {
2752 if (tok < TOK_IDENT)
2753 expect("attribute name");
2754 t = tok;
2755 next();
2756 switch(t) {
2757 case TOK_SECTION1:
2758 case TOK_SECTION2:
2759 skip('(');
2760 if (tok != TOK_STR)
2761 expect("section name");
2762 ad->section = find_section(tcc_state, (char *)tokc.cstr->data);
2763 next();
2764 skip(')');
2765 break;
2766 case TOK_ALIAS1:
2767 case TOK_ALIAS2:
2768 skip('(');
2769 if (tok != TOK_STR)
2770 expect("alias(\"target\")");
2771 ad->alias_target = /* save string as token, for later */
2772 tok_alloc((char*)tokc.cstr->data, tokc.cstr->size-1)->tok;
2773 next();
2774 skip(')');
2775 break;
2776 case TOK_VISIBILITY1:
2777 case TOK_VISIBILITY2:
2778 skip('(');
2779 if (tok != TOK_STR)
2780 expect("visibility(\"default|hidden|internal|protected\")");
2781 if (!strcmp (tokc.cstr->data, "default"))
2782 ad->a.visibility = STV_DEFAULT;
2783 else if (!strcmp (tokc.cstr->data, "hidden"))
2784 ad->a.visibility = STV_HIDDEN;
2785 else if (!strcmp (tokc.cstr->data, "internal"))
2786 ad->a.visibility = STV_INTERNAL;
2787 else if (!strcmp (tokc.cstr->data, "protected"))
2788 ad->a.visibility = STV_PROTECTED;
2789 else
2790 expect("visibility(\"default|hidden|internal|protected\")");
2791 next();
2792 skip(')');
2793 break;
2794 case TOK_ALIGNED1:
2795 case TOK_ALIGNED2:
2796 if (tok == '(') {
2797 next();
2798 n = expr_const();
2799 if (n <= 0 || (n & (n - 1)) != 0)
2800 tcc_error("alignment must be a positive power of two");
2801 skip(')');
2802 } else {
2803 n = MAX_ALIGN;
2804 }
2805 ad->a.aligned = n;
2806 break;
2807 case TOK_PACKED1:
2808 case TOK_PACKED2:
2809 ad->a.packed = 1;
2810 break;
2811 case TOK_WEAK1:
2812 case TOK_WEAK2:
2813 ad->a.weak = 1;
2814 break;
2815 case TOK_UNUSED1:
2816 case TOK_UNUSED2:
2817 /* currently, no need to handle it because tcc does not
2818 track unused objects */
2819 break;
2820 case TOK_NORETURN1:
2821 case TOK_NORETURN2:
2822 /* currently, no need to handle it because tcc does not
2823 track unused objects */
2824 break;
2825 case TOK_CDECL1:
2826 case TOK_CDECL2:
2827 case TOK_CDECL3:
2828 ad->a.func_call = FUNC_CDECL;
2829 break;
2830 case TOK_STDCALL1:
2831 case TOK_STDCALL2:
2832 case TOK_STDCALL3:
2833 ad->a.func_call = FUNC_STDCALL;
2834 break;
2835 #ifdef TCC_TARGET_I386
2836 case TOK_REGPARM1:
2837 case TOK_REGPARM2:
2838 skip('(');
2839 n = expr_const();
2840 if (n > 3)
2841 n = 3;
2842 else if (n < 0)
2843 n = 0;
2844 if (n > 0)
2845 ad->a.func_call = FUNC_FASTCALL1 + n - 1;
2846 skip(')');
2847 break;
2848 case TOK_FASTCALL1:
2849 case TOK_FASTCALL2:
2850 case TOK_FASTCALL3:
2851 ad->a.func_call = FUNC_FASTCALLW;
2852 break;
2853 #endif
2854 case TOK_MODE:
2855 skip('(');
2856 switch(tok) {
2857 case TOK_MODE_DI:
2858 ad->a.mode = VT_LLONG + 1;
2859 break;
2860 case TOK_MODE_HI:
2861 ad->a.mode = VT_SHORT + 1;
2862 break;
2863 case TOK_MODE_SI:
2864 ad->a.mode = VT_INT + 1;
2865 break;
2866 default:
2867 tcc_warning("__mode__(%s) not supported\n", get_tok_str(tok, NULL));
2868 break;
2869 }
2870 next();
2871 skip(')');
2872 break;
2873 case TOK_DLLEXPORT:
2874 ad->a.func_export = 1;
2875 break;
2876 case TOK_DLLIMPORT:
2877 ad->a.func_import = 1;
2878 break;
2879 default:
2880 if (tcc_state->warn_unsupported)
2881 tcc_warning("'%s' attribute ignored", get_tok_str(t, NULL));
2882 /* skip parameters */
2883 if (tok == '(') {
2884 int parenthesis = 0;
2885 do {
2886 if (tok == '(')
2887 parenthesis++;
2888 else if (tok == ')')
2889 parenthesis--;
2890 next();
2891 } while (parenthesis && tok != -1);
2892 }
2893 break;
2894 }
2895 if (tok != ',')
2896 break;
2897 next();
2898 }
2899 skip(')');
2900 skip(')');
2901 }
2902 }
2903
2904 /* enum/struct/union declaration. u is either VT_ENUM or VT_STRUCT */
2905 static void struct_decl(CType *type, int u, int tdef)
2906 {
2907 int a, v, size, align, maxalign, c, offset, flexible;
2908 int bit_size, bit_pos, bsize, bt, lbit_pos, prevbt;
2909 Sym *s, *ss, *ass, **ps;
2910 AttributeDef ad;
2911 CType type1, btype;
2912
2913 a = tok; /* save decl type */
2914 next();
2915 if (tok != '{') {
2916 v = tok;
2917 next();
2918 /* struct already defined ? return it */
2919 if (v < TOK_IDENT)
2920 expect("struct/union/enum name");
2921 s = struct_find(v);
2922 if (s) {
2923 if (s->type.t != a)
2924 tcc_error("invalid type");
2925 goto do_decl;
2926 } else if (tok >= TOK_IDENT && !tdef)
2927 tcc_error("unknown struct/union/enum");
2928 } else {
2929 v = anon_sym++;
2930 }
2931 type1.t = a;
2932 type1.ref = NULL;
2933 /* we put an undefined size for struct/union */
2934 s = sym_push(v | SYM_STRUCT, &type1, 0, -1);
2935 s->r = 0; /* default alignment is zero as gcc */
2936 /* put struct/union/enum name in type */
2937 do_decl:
2938 type->t = u;
2939 type->ref = s;
2940
2941 if (tok == '{') {
2942 next();
2943 if (s->c != -1)
2944 tcc_error("struct/union/enum already defined");
2945 /* cannot be empty */
2946 c = 0;
2947 /* non empty enums are not allowed */
2948 if (a == TOK_ENUM) {
2949 for(;;) {
2950 v = tok;
2951 if (v < TOK_UIDENT)
2952 expect("identifier");
2953 ss = sym_find(v);
2954 if (ss && !local_stack)
2955 tcc_error("redefinition of enumerator '%s'",
2956 get_tok_str(v, NULL));
2957 next();
2958 if (tok == '=') {
2959 next();
2960 c = expr_const();
2961 }
2962 /* enum symbols have static storage */
2963 ss = sym_push(v, &int_type, VT_CONST, c);
2964 ss->type.t |= VT_STATIC;
2965 if (tok != ',')
2966 break;
2967 next();
2968 c++;
2969 /* NOTE: we accept a trailing comma */
2970 if (tok == '}')
2971 break;
2972 }
2973 s->c = type_size(&int_type, &align);
2974 skip('}');
2975 } else {
2976 maxalign = 1;
2977 ps = &s->next;
2978 prevbt = VT_INT;
2979 bit_pos = 0;
2980 offset = 0;
2981 flexible = 0;
2982 while (tok != '}') {
2983 parse_btype(&btype, &ad);
2984 while (1) {
2985 if (flexible)
2986 tcc_error("flexible array member '%s' not at the end of struct",
2987 get_tok_str(v, NULL));
2988 bit_size = -1;
2989 v = 0;
2990 type1 = btype;
2991 if (tok != ':') {
2992 type_decl(&type1, &ad, &v, TYPE_DIRECT | TYPE_ABSTRACT);
2993 if (v == 0) {
2994 if ((type1.t & VT_BTYPE) != VT_STRUCT)
2995 expect("identifier");
2996 else {
2997 int v = btype.ref->v;
2998 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) {
2999 if (tcc_state->ms_extensions == 0)
3000 expect("identifier");
3001 }
3002 }
3003 }
3004 if (type_size(&type1, &align) < 0) {
3005 if ((a == TOK_STRUCT) && (type1.t & VT_ARRAY) && c)
3006 flexible = 1;
3007 else
3008 tcc_error("field '%s' has incomplete type",
3009 get_tok_str(v, NULL));
3010 }
3011 if ((type1.t & VT_BTYPE) == VT_FUNC ||
3012 (type1.t & (VT_TYPEDEF | VT_STATIC | VT_EXTERN | VT_INLINE)))
3013 tcc_error("invalid type for '%s'",
3014 get_tok_str(v, NULL));
3015 }
3016 if (tok == ':') {
3017 next();
3018 bit_size = expr_const();
3019 /* XXX: handle v = 0 case for messages */
3020 if (bit_size < 0)
3021 tcc_error("negative width in bit-field '%s'",
3022 get_tok_str(v, NULL));
3023 if (v && bit_size == 0)
3024 tcc_error("zero width for bit-field '%s'",
3025 get_tok_str(v, NULL));
3026 }
3027 size = type_size(&type1, &align);
3028 if (ad.a.aligned) {
3029 if (align < ad.a.aligned)
3030 align = ad.a.aligned;
3031 } else if (ad.a.packed) {
3032 align = 1;
3033 } else if (*tcc_state->pack_stack_ptr) {
3034 if (align > *tcc_state->pack_stack_ptr)
3035 align = *tcc_state->pack_stack_ptr;
3036 }
3037 lbit_pos = 0;
3038 if (bit_size >= 0) {
3039 bt = type1.t & VT_BTYPE;
3040 if (bt != VT_INT &&
3041 bt != VT_BYTE &&
3042 bt != VT_SHORT &&
3043 bt != VT_BOOL &&
3044 bt != VT_ENUM &&
3045 bt != VT_LLONG)
3046 tcc_error("bitfields must have scalar type");
3047 bsize = size * 8;
3048 if (bit_size > bsize) {
3049 tcc_error("width of '%s' exceeds its type",
3050 get_tok_str(v, NULL));
3051 } else if (bit_size == bsize) {
3052 /* no need for bit fields */
3053 bit_pos = 0;
3054 } else if (bit_size == 0) {
3055 /* XXX: what to do if only padding in a
3056 structure ? */
3057 /* zero size: means to pad */
3058 bit_pos = 0;
3059 } else {
3060 /* we do not have enough room ?
3061 did the type change?
3062 is it a union? */
3063 if ((bit_pos + bit_size) > bsize ||
3064 bt != prevbt || a == TOK_UNION)
3065 bit_pos = 0;
3066 lbit_pos = bit_pos;
3067 /* XXX: handle LSB first */
3068 type1.t |= VT_BITFIELD |
3069 (bit_pos << VT_STRUCT_SHIFT) |
3070 (bit_size << (VT_STRUCT_SHIFT + 6));
3071 bit_pos += bit_size;
3072 }
3073 prevbt = bt;
3074 } else {
3075 bit_pos = 0;
3076 }
3077 if (v != 0 || (type1.t & VT_BTYPE) == VT_STRUCT) {
3078 /* add new memory data only if starting
3079 bit field */
3080 if (lbit_pos == 0) {
3081 if (a == TOK_STRUCT) {
3082 c = (c + align - 1) & -align;
3083 offset = c;
3084 if (size > 0)
3085 c += size;
3086 } else {
3087 offset = 0;
3088 if (size > c)
3089 c = size;
3090 }
3091 if (align > maxalign)
3092 maxalign = align;
3093 }
3094 #if 0
3095 printf("add field %s offset=%d",
3096 get_tok_str(v, NULL), offset);
3097 if (type1.t & VT_BITFIELD) {
3098 printf(" pos=%d size=%d",
3099 (type1.t >> VT_STRUCT_SHIFT) & 0x3f,
3100 (type1.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f);
3101 }
3102 printf("\n");
3103 #endif
3104 }
3105 if (v == 0 && (type1.t & VT_BTYPE) == VT_STRUCT) {
3106 ass = type1.ref;
3107 while ((ass = ass->next) != NULL) {
3108 ss = sym_push(ass->v, &ass->type, 0, offset + ass->c);
3109 *ps = ss;
3110 ps = &ss->next;
3111 }
3112 } else if (v) {
3113 ss = sym_push(v | SYM_FIELD, &type1, 0, offset);
3114 *ps = ss;
3115 ps = &ss->next;
3116 }
3117 if (tok == ';' || tok == TOK_EOF)
3118 break;
3119 skip(',');
3120 }
3121 skip(';');
3122 }
3123 skip('}');
3124 /* store size and alignment */
3125 s->c = (c + maxalign - 1) & -maxalign;
3126 s->r = maxalign;
3127 }
3128 }
3129 }
3130
3131 /* return 1 if basic type is a type size (short, long, long long) */
3132 ST_FUNC int is_btype_size(int bt)
3133 {
3134 return bt == VT_SHORT || bt == VT_LONG || bt == VT_LLONG;
3135 }
3136
3137 /* return 0 if no type declaration. otherwise, return the basic type
3138 and skip it.
3139 */
3140 static int parse_btype(CType *type, AttributeDef *ad)
3141 {
3142 int t, u, bt_size, complete, type_found, typespec_found;
3143 Sym *s;
3144 CType type1;
3145
3146 memset(ad, 0, sizeof(AttributeDef));
3147 complete = 0;
3148 type_found = 0;
3149 typespec_found = 0;
3150 t = 0;
3151 while(1) {
3152 switch(tok) {
3153 case TOK_EXTENSION:
3154 /* currently, we really ignore extension */
3155 next();
3156 continue;
3157
3158 /* basic types */
3159 case TOK_CHAR:
3160 u = VT_BYTE;
3161 basic_type:
3162 next();
3163 basic_type1:
3164 if (complete)
3165 tcc_error("too many basic types");
3166 t |= u;
3167 bt_size = is_btype_size (u & VT_BTYPE);
3168 if (u == VT_INT || (!bt_size && !(t & VT_TYPEDEF)))
3169 complete = 1;
3170 typespec_found = 1;
3171 break;
3172 case TOK_VOID:
3173 u = VT_VOID;
3174 goto basic_type;
3175 case TOK_SHORT:
3176 u = VT_SHORT;
3177 goto basic_type;
3178 case TOK_INT:
3179 u = VT_INT;
3180 goto basic_type;
3181 case TOK_LONG:
3182 next();
3183 if ((t & VT_BTYPE) == VT_DOUBLE) {
3184 #ifndef TCC_TARGET_PE
3185 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
3186 #endif
3187 } else if ((t & VT_BTYPE) == VT_LONG) {
3188 t = (t & ~VT_BTYPE) | VT_LLONG;
3189 } else {
3190 u = VT_LONG;
3191 goto basic_type1;
3192 }
3193 break;
3194 #ifdef TCC_TARGET_ARM64
3195 case TOK_UINT128:
3196 /* GCC's __uint128_t appears in some Linux header files. Make it a
3197 synonym for long double to get the size and alignment right. */
3198 u = VT_LDOUBLE;
3199 goto basic_type;
3200 #endif
3201 case TOK_BOOL:
3202 u = VT_BOOL;
3203 goto basic_type;
3204 case TOK_FLOAT:
3205 u = VT_FLOAT;
3206 goto basic_type;
3207 case TOK_DOUBLE:
3208 next();
3209 if ((t & VT_BTYPE) == VT_LONG) {
3210 #ifdef TCC_TARGET_PE
3211 t = (t & ~VT_BTYPE) | VT_DOUBLE;
3212 #else
3213 t = (t & ~VT_BTYPE) | VT_LDOUBLE;
3214 #endif
3215 } else {
3216 u = VT_DOUBLE;
3217 goto basic_type1;
3218 }
3219 break;
3220 case TOK_ENUM:
3221 struct_decl(&type1, VT_ENUM, t & (VT_TYPEDEF | VT_EXTERN));
3222 basic_type2:
3223 u = type1.t;
3224 type->ref = type1.ref;
3225 goto basic_type1;
3226 case TOK_STRUCT:
3227 case TOK_UNION:
3228 struct_decl(&type1, VT_STRUCT, t & (VT_TYPEDEF | VT_EXTERN));
3229 goto basic_type2;
3230
3231 /* type modifiers */
3232 case TOK_CONST1:
3233 case TOK_CONST2:
3234 case TOK_CONST3:
3235 t |= VT_CONSTANT;
3236 next();
3237 break;
3238 case TOK_VOLATILE1:
3239 case TOK_VOLATILE2:
3240 case TOK_VOLATILE3:
3241 t |= VT_VOLATILE;
3242 next();
3243 break;
3244 case TOK_SIGNED1:
3245 case TOK_SIGNED2:
3246 case TOK_SIGNED3:
3247 if ((t & (VT_DEFSIGN|VT_UNSIGNED)) == (VT_DEFSIGN|VT_UNSIGNED))
3248 tcc_error("signed and unsigned modifier");
3249 typespec_found = 1;
3250 t |= VT_DEFSIGN;
3251 next();
3252 break;
3253 case TOK_REGISTER:
3254 case TOK_AUTO:
3255 case TOK_RESTRICT1:
3256 case TOK_RESTRICT2:
3257 case TOK_RESTRICT3:
3258 next();
3259 break;
3260 case TOK_UNSIGNED:
3261 if ((t & (VT_DEFSIGN|VT_UNSIGNED)) == VT_DEFSIGN)
3262 tcc_error("signed and unsigned modifier");
3263 t |= VT_DEFSIGN | VT_UNSIGNED;
3264 next();
3265 typespec_found = 1;
3266 break;
3267
3268 /* storage */
3269 case TOK_EXTERN:
3270 t |= VT_EXTERN;
3271 next();
3272 break;
3273 case TOK_STATIC:
3274 t |= VT_STATIC;
3275 next();
3276 break;
3277 case TOK_TYPEDEF:
3278 t |= VT_TYPEDEF;
3279 next();
3280 break;
3281 case TOK_INLINE1:
3282 case TOK_INLINE2:
3283 case TOK_INLINE3:
3284 t |= VT_INLINE;
3285 next();
3286 break;
3287
3288 /* GNUC attribute */
3289 case TOK_ATTRIBUTE1:
3290 case TOK_ATTRIBUTE2:
3291 parse_attribute(ad);
3292 if (ad->a.mode) {
3293 u = ad->a.mode -1;
3294 t = (t & ~VT_BTYPE) | u;
3295 }
3296 break;
3297 /* GNUC typeof */
3298 case TOK_TYPEOF1:
3299 case TOK_TYPEOF2:
3300 case TOK_TYPEOF3:
3301 next();
3302 parse_expr_type(&type1);
3303 /* remove all storage modifiers except typedef */
3304 type1.t &= ~(VT_STORAGE&~VT_TYPEDEF);
3305 goto basic_type2;
3306 default:
3307 if (typespec_found)
3308 goto the_end;
3309 s = sym_find(tok);
3310 if (!s || !(s->type.t & VT_TYPEDEF))
3311 goto the_end;
3312 t |= (s->type.t & ~VT_TYPEDEF);
3313 if ((t & VT_ARRAY) &&
3314 t & (VT_CONSTANT | VT_VOLATILE) & ~s->type.ref->type.t) {
3315 /* This is a case like "typedef int T[1]; const T x;"
3316 in which which we must make a copy of the typedef
3317 type so that we can add the type qualifiers to it. */
3318 type->ref = sym_push(SYM_FIELD, &s->type.ref->type,
3319 0, s->type.ref->c);
3320 type->ref->type.t |= t & (VT_CONSTANT | VT_VOLATILE);
3321 }
3322 else
3323 type->ref = s->type.ref;
3324 if (s->r) {
3325 /* get attributes from typedef */
3326 if (0 == ad->a.aligned)
3327 ad->a.aligned = s->a.aligned;
3328 if (0 == ad->a.func_call)
3329 ad->a.func_call = s->a.func_call;
3330 ad->a.packed |= s->a.packed;
3331 }
3332 next();
3333 typespec_found = 1;
3334 break;
3335 }
3336 type_found = 1;
3337 }
3338 the_end:
3339 if (tcc_state->char_is_unsigned) {
3340 if ((t & (VT_DEFSIGN|VT_BTYPE)) == VT_BYTE)
3341 t |= VT_UNSIGNED;
3342 }
3343
3344 /* long is never used as type */
3345 if ((t & VT_BTYPE) == VT_LONG)
3346 #if (!defined TCC_TARGET_X86_64 && !defined TCC_TARGET_ARM64) || \
3347 defined TCC_TARGET_PE
3348 t = (t & ~VT_BTYPE) | VT_INT;
3349 #else
3350 t = (t & ~VT_BTYPE) | VT_LLONG;
3351 #endif
3352 type->t = t;
3353 return type_found;
3354 }
3355
3356 /* convert a function parameter type (array to pointer and function to
3357 function pointer) */
3358 static inline void convert_parameter_type(CType *pt)
3359 {
3360 /* remove const and volatile qualifiers (XXX: const could be used
3361 to indicate a const function parameter */
3362 pt->t &= ~(VT_CONSTANT | VT_VOLATILE);
3363 /* array must be transformed to pointer according to ANSI C */
3364 pt->t &= ~VT_ARRAY;
3365 if ((pt->t & VT_BTYPE) == VT_FUNC) {
3366 mk_pointer(pt);
3367 }
3368 }
3369
3370 ST_FUNC void parse_asm_str(CString *astr)
3371 {
3372 skip('(');
3373 /* read the string */
3374 if (tok != TOK_STR)
3375 expect("string constant");
3376 cstr_new(astr);
3377 while (tok == TOK_STR) {
3378 /* XXX: add \0 handling too ? */
3379 cstr_cat(astr, tokc.cstr->data);
3380 next();
3381 }
3382 cstr_ccat(astr, '\0');
3383 }
3384
3385 /* Parse an asm label and return the token */
3386 static int asm_label_instr(void)
3387 {
3388 int v;
3389 CString astr;
3390
3391 next();
3392 parse_asm_str(&astr);
3393 skip(')');
3394 #ifdef ASM_DEBUG
3395 printf("asm_alias: \"%s\"\n", (char *)astr.data);
3396 #endif
3397 v = tok_alloc(astr.data, astr.size - 1)->tok;
3398 cstr_free(&astr);
3399 return v;
3400 }
3401
3402 static void post_type(CType *type, AttributeDef *ad)
3403 {
3404 int n, l, t1, arg_size, align;
3405 Sym **plast, *s, *first;
3406 AttributeDef ad1;
3407 CType pt;
3408
3409 if (tok == '(') {
3410 /* function declaration */
3411 next();
3412 l = 0;
3413 first = NULL;
3414 plast = &first;
3415 arg_size = 0;
3416 if (tok != ')') {
3417 for(;;) {
3418 /* read param name and compute offset */
3419 if (l != FUNC_OLD) {
3420 if (!parse_btype(&pt, &ad1)) {
3421 if (l) {
3422 tcc_error("invalid type");
3423 } else {
3424 l = FUNC_OLD;
3425 goto old_proto;
3426 }
3427 }
3428 l = FUNC_NEW;
3429 if ((pt.t & VT_BTYPE) == VT_VOID && tok == ')')
3430 break;
3431 type_decl(&pt, &ad1, &n, TYPE_DIRECT | TYPE_ABSTRACT);
3432 if ((pt.t & VT_BTYPE) == VT_VOID)
3433 tcc_error("parameter declared as void");
3434 arg_size += (type_size(&pt, &align) + PTR_SIZE - 1) / PTR_SIZE;
3435 } else {
3436 old_proto:
3437 n = tok;
3438 if (n < TOK_UIDENT)
3439 expect("identifier");
3440 pt.t = VT_INT;
3441 next();
3442 }
3443 convert_parameter_type(&pt);
3444 s = sym_push(n | SYM_FIELD, &pt, 0, 0);
3445 *plast = s;
3446 plast = &s->next;
3447 if (tok == ')')
3448 break;
3449 skip(',');
3450 if (l == FUNC_NEW && tok == TOK_DOTS) {
3451 l = FUNC_ELLIPSIS;
3452 next();
3453 break;
3454 }
3455 }
3456 }
3457 /* if no parameters, then old type prototype */
3458 if (l == 0)
3459 l = FUNC_OLD;
3460 skip(')');
3461 /* NOTE: const is ignored in returned type as it has a special
3462 meaning in gcc / C++ */
3463 type->t &= ~VT_CONSTANT;
3464 /* some ancient pre-K&R C allows a function to return an array
3465 and the array brackets to be put after the arguments, such
3466 that "int c()[]" means something like "int[] c()" */
3467 if (tok == '[') {
3468 next();
3469 skip(']'); /* only handle simple "[]" */
3470 type->t |= VT_PTR;
3471 }
3472 /* we push a anonymous symbol which will contain the function prototype */
3473 ad->a.func_args = arg_size;
3474 s = sym_push(SYM_FIELD, type, 0, l);
3475 s->a = ad->a;
3476 s->next = first;
3477 type->t = VT_FUNC;
3478 type->ref = s;
3479 } else if (tok == '[') {
3480 /* array definition */
3481 next();
3482 if (tok == TOK_RESTRICT1)
3483 next();
3484 n = -1;
3485 t1 = 0;
3486 if (tok != ']') {
3487 if (!local_stack || nocode_wanted)
3488 vpushi(expr_const());
3489 else gexpr();
3490 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
3491 n = vtop->c.i;
3492 if (n < 0)
3493 tcc_error("invalid array size");
3494 } else {
3495 if (!is_integer_btype(vtop->type.t & VT_BTYPE))
3496 tcc_error("size of variable length array should be an integer");
3497 t1 = VT_VLA;
3498 }
3499 }
3500 skip(']');
3501 /* parse next post type */
3502 post_type(type, ad);
3503 if (type->t == VT_FUNC)
3504 tcc_error("declaration of an array of functions");
3505 t1 |= type->t & VT_VLA;
3506
3507 if (t1 & VT_VLA) {
3508 loc -= type_size(&int_type, &align);
3509 loc &= -align;
3510 n = loc;
3511
3512 vla_runtime_type_size(type, &align);
3513 gen_op('*');
3514 vset(&int_type, VT_LOCAL|VT_LVAL, n);
3515 vswap();
3516 vstore();
3517 }
3518 if (n != -1)
3519 vpop();
3520
3521 /* we push an anonymous symbol which will contain the array
3522 element type */
3523 s = sym_push(SYM_FIELD, type, 0, n);
3524 type->t = (t1 ? VT_VLA : VT_ARRAY) | VT_PTR;
3525 type->ref = s;
3526 }
3527 }
3528
3529 /* Parse a type declaration (except basic type), and return the type
3530 in 'type'. 'td' is a bitmask indicating which kind of type decl is
3531 expected. 'type' should contain the basic type. 'ad' is the
3532 attribute definition of the basic type. It can be modified by
3533 type_decl().
3534 */
3535 static void type_decl(CType *type, AttributeDef *ad, int *v, int td)
3536 {
3537 Sym *s;
3538 CType type1, *type2;
3539 int qualifiers, storage;
3540
3541 while (tok == '*') {
3542 qualifiers = 0;
3543 redo:
3544 next();
3545 switch(tok) {
3546 case TOK_CONST1:
3547 case TOK_CONST2:
3548 case TOK_CONST3:
3549 qualifiers |= VT_CONSTANT;
3550 goto redo;
3551 case TOK_VOLATILE1:
3552 case TOK_VOLATILE2:
3553 case TOK_VOLATILE3:
3554 qualifiers |= VT_VOLATILE;
3555 goto redo;
3556 case TOK_RESTRICT1:
3557 case TOK_RESTRICT2:
3558 case TOK_RESTRICT3:
3559 goto redo;
3560 }
3561 mk_pointer(type);
3562 type->t |= qualifiers;
3563 }
3564
3565 /* XXX: clarify attribute handling */
3566 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
3567 parse_attribute(ad);
3568
3569 /* recursive type */
3570 /* XXX: incorrect if abstract type for functions (e.g. 'int ()') */
3571 type1.t = 0; /* XXX: same as int */
3572 if (tok == '(') {
3573 next();
3574 /* XXX: this is not correct to modify 'ad' at this point, but
3575 the syntax is not clear */
3576 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
3577 parse_attribute(ad);
3578 type_decl(&type1, ad, v, td);
3579 skip(')');
3580 } else {
3581 /* type identifier */
3582 if (tok >= TOK_IDENT && (td & TYPE_DIRECT)) {
3583 *v = tok;
3584 next();
3585 } else {
3586 if (!(td & TYPE_ABSTRACT))
3587 expect("identifier");
3588 *v = 0;
3589 }
3590 }
3591 storage = type->t & VT_STORAGE;
3592 type->t &= ~VT_STORAGE;
3593 if (storage & VT_STATIC) {
3594 int saved_nocode_wanted = nocode_wanted;
3595 nocode_wanted = 1;
3596 post_type(type, ad);
3597 nocode_wanted = saved_nocode_wanted;
3598 } else
3599 post_type(type, ad);
3600 type->t |= storage;
3601 if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2)
3602 parse_attribute(ad);
3603
3604 if (!type1.t)
3605 return;
3606 /* append type at the end of type1 */
3607 type2 = &type1;
3608 for(;;) {
3609 s = type2->ref;
3610 type2 = &s->type;
3611 if (!type2->t) {
3612 *type2 = *type;
3613 break;
3614 }
3615 }
3616 *type = type1;
3617 }
3618
3619 /* compute the lvalue VT_LVAL_xxx needed to match type t. */
3620 ST_FUNC int lvalue_type(int t)
3621 {
3622 int bt, r;
3623 r = VT_LVAL;
3624 bt = t & VT_BTYPE;
3625 if (bt == VT_BYTE || bt == VT_BOOL)
3626 r |= VT_LVAL_BYTE;
3627 else if (bt == VT_SHORT)
3628 r |= VT_LVAL_SHORT;
3629 else
3630 return r;
3631 if (t & VT_UNSIGNED)
3632 r |= VT_LVAL_UNSIGNED;
3633 return r;
3634 }
3635
3636 /* indirection with full error checking and bound check */
3637 ST_FUNC void indir(void)
3638 {
3639 if ((vtop->type.t & VT_BTYPE) != VT_PTR) {
3640 if ((vtop->type.t & VT_BTYPE) == VT_FUNC)
3641 return;
3642 expect("pointer");
3643 }
3644 if ((vtop->r & VT_LVAL) && !nocode_wanted)
3645 gv(RC_INT);
3646 vtop->type = *pointed_type(&vtop->type);
3647 /* Arrays and functions are never lvalues */
3648 if (!(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_VLA)
3649 && (vtop->type.t & VT_BTYPE) != VT_FUNC) {
3650 vtop->r |= lvalue_type(vtop->type.t);
3651 /* if bound checking, the referenced pointer must be checked */
3652 #ifdef CONFIG_TCC_BCHECK
3653 if (tcc_state->do_bounds_check)
3654 vtop->r |= VT_MUSTBOUND;
3655 #endif
3656 }
3657 }
3658
3659 /* pass a parameter to a function and do type checking and casting */
3660 static void gfunc_param_typed(Sym *func, Sym *arg)
3661 {
3662 int func_type;
3663 CType type;
3664
3665 func_type = func->c;
3666 if (func_type == FUNC_OLD ||
3667 (func_type == FUNC_ELLIPSIS && arg == NULL)) {
3668 /* default casting : only need to convert float to double */
3669 if ((vtop->type.t & VT_BTYPE) == VT_FLOAT) {
3670 type.t = VT_DOUBLE;
3671 gen_cast(&type);
3672 } else if (vtop->type.t & VT_BITFIELD) {
3673 type.t = vtop->type.t & (VT_BTYPE | VT_UNSIGNED);
3674 gen_cast(&type);
3675 }
3676 } else if (arg == NULL) {
3677 tcc_error("too many arguments to function");
3678 } else {
3679 type = arg->type;
3680 type.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
3681 gen_assign_cast(&type);
3682 }
3683 }
3684
3685 /* parse an expression of the form '(type)' or '(expr)' and return its
3686 type */
3687 static void parse_expr_type(CType *type)
3688 {
3689 int n;
3690 AttributeDef ad;
3691
3692 skip('(');
3693 if (parse_btype(type, &ad)) {
3694 type_decl(type, &ad, &n, TYPE_ABSTRACT);
3695 } else {
3696 expr_type(type);
3697 }
3698 skip(')');
3699 }
3700
3701 static void parse_type(CType *type)
3702 {
3703 AttributeDef ad;
3704 int n;
3705
3706 if (!parse_btype(type, &ad)) {
3707 expect("type");
3708 }
3709 type_decl(type, &ad, &n, TYPE_ABSTRACT);
3710 }
3711
3712 static void vpush_tokc(int t)
3713 {
3714 CType type;
3715 type.t = t;
3716 type.ref = 0;
3717 vsetc(&type, VT_CONST, &tokc);
3718 }
3719
3720 ST_FUNC void unary(void)
3721 {
3722 int n, t, align, size, r, sizeof_caller;
3723 CType type;
3724 Sym *s;
3725 AttributeDef ad;
3726 static int in_sizeof = 0;
3727
3728 sizeof_caller = in_sizeof;
3729 in_sizeof = 0;
3730 /* XXX: GCC 2.95.3 does not generate a table although it should be
3731 better here */
3732 tok_next:
3733 switch(tok) {
3734 case TOK_EXTENSION:
3735 next();
3736 goto tok_next;
3737 case TOK_CINT:
3738 case TOK_CCHAR:
3739 case TOK_LCHAR:
3740 vpushi(tokc.i);
3741 next();
3742 break;
3743 case TOK_CUINT:
3744 vpush_tokc(VT_INT | VT_UNSIGNED);
3745 next();
3746 break;
3747 case TOK_CLLONG:
3748 vpush_tokc(VT_LLONG);
3749 next();
3750 break;
3751 case TOK_CULLONG:
3752 vpush_tokc(VT_LLONG | VT_UNSIGNED);
3753 next();
3754 break;
3755 case TOK_CFLOAT:
3756 vpush_tokc(VT_FLOAT);
3757 next();
3758 break;
3759 case TOK_CDOUBLE:
3760 vpush_tokc(VT_DOUBLE);
3761 next();
3762 break;
3763 case TOK_CLDOUBLE:
3764 vpush_tokc(VT_LDOUBLE);
3765 next();
3766 break;
3767 case TOK___FUNCTION__:
3768 if (!gnu_ext)
3769 goto tok_identifier;
3770 /* fall thru */
3771 case TOK___FUNC__:
3772 {
3773 void *ptr;
3774 int len;
3775 /* special function name identifier */
3776 len = strlen(funcname) + 1;
3777 /* generate char[len] type */
3778 type.t = VT_BYTE;
3779 mk_pointer(&type);
3780 type.t |= VT_ARRAY;
3781 type.ref->c = len;
3782 vpush_ref(&type, data_section, data_section->data_offset, len);
3783 ptr = section_ptr_add(data_section, len);
3784 memcpy(ptr, funcname, len);
3785 next();
3786 }
3787 break;
3788 case TOK_LSTR:
3789 #ifdef TCC_TARGET_PE
3790 t = VT_SHORT | VT_UNSIGNED;
3791 #else
3792 t = VT_INT;
3793 #endif
3794 goto str_init;
3795 case TOK_STR:
3796 /* string parsing */
3797 t = VT_BYTE;
3798 str_init:
3799 if (tcc_state->warn_write_strings)
3800 t |= VT_CONSTANT;
3801 type.t = t;
3802 mk_pointer(&type);
3803 type.t |= VT_ARRAY;
3804 memset(&ad, 0, sizeof(AttributeDef));
3805 decl_initializer_alloc(&type, &ad, VT_CONST, 2, 0, 0);
3806 break;
3807 case '(':
3808 next();
3809 /* cast ? */
3810 if (parse_btype(&type, &ad)) {
3811 type_decl(&type, &ad, &n, TYPE_ABSTRACT);
3812 skip(')');
3813 /* check ISOC99 compound literal */
3814 if (tok == '{') {
3815 /* data is allocated locally by default */
3816 if (global_expr)
3817 r = VT_CONST;
3818 else
3819 r = VT_LOCAL;
3820 /* all except arrays are lvalues */
3821 if (!(type.t & VT_ARRAY))
3822 r |= lvalue_type(type.t);
3823 memset(&ad, 0, sizeof(AttributeDef));
3824 decl_initializer_alloc(&type, &ad, r, 1, 0, 0);
3825 } else {
3826 if (sizeof_caller) {
3827 vpush(&type);
3828 return;
3829 }
3830 unary();
3831 gen_cast(&type);
3832 }
3833 } else if (tok == '{') {
3834 /*
3835 if (nocode_wanted)
3836 tcc_error("statement expression in global scope"); */
3837 /* this check breaks compilation of the linux 2.4.26 with the meesage:
3838 linux/include/net/tcp.h:945: error: statement expression in global scope */
3839
3840 /* save all registers */
3841 save_regs(0);
3842 /* statement expression : we do not accept break/continue
3843 inside as GCC does */
3844 block(NULL, NULL, NULL, NULL, 0, 1);
3845 skip(')');
3846 } else {
3847 gexpr();
3848 skip(')');
3849 }
3850 break;
3851 case '*':
3852 next();
3853 unary();
3854 indir();
3855 break;
3856 case '&':
3857 next();
3858 unary();
3859 /* functions names must be treated as function pointers,
3860 except for unary '&' and sizeof. Since we consider that
3861 functions are not lvalues, we only have to handle it
3862 there and in function calls. */
3863 /* arrays can also be used although they are not lvalues */
3864 if ((vtop->type.t & VT_BTYPE) != VT_FUNC &&
3865 !(vtop->type.t & VT_ARRAY) && !(vtop->type.t & VT_LLOCAL))
3866 test_lvalue();
3867 mk_pointer(&vtop->type);
3868 gaddrof();
3869 break;
3870 case '!':
3871 next();
3872 unary();
3873 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
3874 CType boolean;
3875 boolean.t = VT_BOOL;
3876 gen_cast(&boolean);
3877 vtop->c.i = !vtop->c.i;
3878 } else if ((vtop->r & VT_VALMASK) == VT_CMP)
3879 vtop->c.i ^= 1;
3880 else if (!nocode_wanted) {
3881 save_regs(1);
3882 vseti(VT_JMP, gvtst(1, 0));
3883 }
3884 else
3885 vtop--;
3886 break;
3887 case '~':
3888 next();
3889 unary();
3890 vpushi(-1);
3891 gen_op('^');
3892 break;
3893 case '+':
3894 next();
3895 unary();
3896 if ((vtop->type.t & VT_BTYPE) == VT_PTR)
3897 tcc_error("pointer not accepted for unary plus");
3898 /* In order to force cast, we add zero, except for floating point
3899 where we really need an noop (otherwise -0.0 will be transformed
3900 into +0.0). */
3901 if (!is_float(vtop->type.t)) {
3902 vpushi(0);
3903 gen_op('+');
3904 }
3905 break;
3906 case TOK_SIZEOF:
3907 case TOK_ALIGNOF1:
3908 case TOK_ALIGNOF2:
3909 t = tok;
3910 next();
3911 in_sizeof++;
3912 unary_type(&type); // Perform a in_sizeof = 0;
3913 size = type_size(&type, &align);
3914 if (t == TOK_SIZEOF) {
3915 if (!(type.t & VT_VLA)) {
3916 if (size < 0)
3917 tcc_error("sizeof applied to an incomplete type");
3918 vpushs(size);
3919 } else {
3920 vla_runtime_type_size(&type, &align);
3921 }
3922 } else {
3923 vpushs(align);
3924 }
3925 vtop->type.t |= VT_UNSIGNED;
3926 break;
3927
3928 case TOK_builtin_types_compatible_p:
3929 {
3930 CType type1, type2;
3931 next();
3932 skip('(');
3933 parse_type(&type1);
3934 skip(',');
3935 parse_type(&type2);
3936 skip(')');
3937 type1.t &= ~(VT_CONSTANT | VT_VOLATILE);
3938 type2.t &= ~(VT_CONSTANT | VT_VOLATILE);
3939 vpushi(is_compatible_types(&type1, &type2));
3940 }
3941 break;
3942 case TOK_builtin_constant_p:
3943 {
3944 int saved_nocode_wanted, res;
3945 next();
3946 skip('(');
3947 saved_nocode_wanted = nocode_wanted;
3948 nocode_wanted = 1;
3949 gexpr();
3950 res = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST;
3951 vpop();
3952 nocode_wanted = saved_nocode_wanted;
3953 skip(')');
3954 vpushi(res);
3955 }
3956 break;
3957 case TOK_builtin_frame_address:
3958 case TOK_builtin_return_address:
3959 {
3960 int tok1 = tok;
3961 int level;
3962 CType type;
3963 next();
3964 skip('(');
3965 if (tok != TOK_CINT) {
3966 tcc_error("%s only takes positive integers",
3967 tok1 == TOK_builtin_return_address ?
3968 "__builtin_return_address" :
3969 "__builtin_frame_address");
3970 }
3971 level = (uint32_t)tokc.i;
3972 next();
3973 skip(')');
3974 type.t = VT_VOID;
3975 mk_pointer(&type);
3976 vset(&type, VT_LOCAL, 0); /* local frame */
3977 while (level--) {
3978 mk_pointer(&vtop->type);
3979 indir(); /* -> parent frame */
3980 }
3981 if (tok1 == TOK_builtin_return_address) {
3982 // assume return address is just above frame pointer on stack
3983 vpushi(PTR_SIZE);
3984 gen_op('+');
3985 mk_pointer(&vtop->type);
3986 indir();
3987 }
3988 }
3989 break;
3990 #ifdef TCC_TARGET_X86_64
3991 #ifdef TCC_TARGET_PE
3992 case TOK_builtin_va_start:
3993 {
3994 next();
3995 skip('(');
3996 expr_eq();
3997 skip(',');
3998 expr_eq();
3999 skip(')');
4000 if ((vtop->r & VT_VALMASK) != VT_LOCAL)
4001 tcc_error("__builtin_va_start expects a local variable");
4002 vtop->r &= ~(VT_LVAL | VT_REF);
4003 vtop->type = char_pointer_type;
4004 vstore();
4005 }
4006 break;
4007 #else
4008 case TOK_builtin_va_arg_types:
4009 {
4010 CType type;
4011 next();
4012 skip('(');
4013 parse_type(&type);
4014 skip(')');
4015 vpushi(classify_x86_64_va_arg(&type));
4016 }
4017 break;
4018 #endif
4019 #endif
4020
4021 #ifdef TCC_TARGET_ARM64
4022 case TOK___va_start: {
4023 if (nocode_wanted)
4024 tcc_error("statement in global scope");
4025 next();
4026 skip('(');
4027 expr_eq();
4028 skip(',');
4029 expr_eq();
4030 skip(')');
4031 //xx check types
4032 gen_va_start();
4033 vpushi(0);
4034 vtop->type.t = VT_VOID;
4035 break;
4036 }
4037 case TOK___va_arg: {
4038 CType type;
4039 if (nocode_wanted)
4040 tcc_error("statement in global scope");
4041 next();
4042 skip('(');
4043 expr_eq();
4044 skip(',');
4045 parse_type(&type);
4046 skip(')');
4047 //xx check types
4048 gen_va_arg(&type);
4049 vtop->type = type;
4050 break;
4051 }
4052 case TOK___arm64_clear_cache: {
4053 next();
4054 skip('(');
4055 expr_eq();
4056 skip(',');
4057 expr_eq();
4058 skip(')');
4059 gen_clear_cache();
4060 vpushi(0);
4061 vtop->type.t = VT_VOID;
4062 break;
4063 }
4064 #endif
4065 /* pre operations */
4066 case TOK_INC:
4067 case TOK_DEC:
4068 t = tok;
4069 next();
4070 unary();
4071 inc(0, t);
4072 break;
4073 case '-':
4074 next();
4075 unary();
4076 t = vtop->type.t & VT_BTYPE;
4077 if (is_float(t)) {
4078 /* In IEEE negate(x) isn't subtract(0,x), but rather
4079 subtract(-0, x). */
4080 vpush(&vtop->type);
4081 if (t == VT_FLOAT)
4082 vtop->c.f = -0.0f;
4083 else if (t == VT_DOUBLE)
4084 vtop->c.d = -0.0;
4085 else
4086 vtop->c.ld = -0.0;
4087 } else
4088 vpushi(0);
4089 vswap();
4090 gen_op('-');
4091 break;
4092 case TOK_LAND:
4093 if (!gnu_ext)
4094 goto tok_identifier;
4095 next();
4096 /* allow to take the address of a label */
4097 if (tok < TOK_UIDENT)
4098 expect("label identifier");
4099 s = label_find(tok);
4100 if (!s) {
4101 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
4102 } else {
4103 if (s->r == LABEL_DECLARED)
4104 s->r = LABEL_FORWARD;
4105 }
4106 if (!s->type.t) {
4107 s->type.t = VT_VOID;
4108 mk_pointer(&s->type);
4109 s->type.t |= VT_STATIC;
4110 }
4111 vpushsym(&s->type, s);
4112 next();
4113 break;
4114
4115 // special qnan , snan and infinity values
4116 case TOK___NAN__:
4117 vpush64(VT_DOUBLE, 0x7ff8000000000000ULL);
4118 next();
4119 break;
4120 case TOK___SNAN__:
4121 vpush64(VT_DOUBLE, 0x7ff0000000000001ULL);
4122 next();
4123 break;
4124 case TOK___INF__:
4125 vpush64(VT_DOUBLE, 0x7ff0000000000000ULL);
4126 next();
4127 break;
4128
4129 default:
4130 tok_identifier:
4131 t = tok;
4132 next();
4133 if (t < TOK_UIDENT)
4134 expect("identifier");
4135 s = sym_find(t);
4136 if (!s) {
4137 const char *name = get_tok_str(t, NULL);
4138 if (tok != '(')
4139 tcc_error("'%s' undeclared", name);
4140 /* for simple function calls, we tolerate undeclared
4141 external reference to int() function */
4142 if (tcc_state->warn_implicit_function_declaration
4143 #ifdef TCC_TARGET_PE
4144 /* people must be warned about using undeclared WINAPI functions
4145 (which usually start with uppercase letter) */
4146 || (name[0] >= 'A' && name[0] <= 'Z')
4147 #endif
4148 )
4149 tcc_warning("implicit declaration of function '%s'", name);
4150 s = external_global_sym(t, &func_old_type, 0);
4151 }
4152 if ((s->type.t & (VT_STATIC | VT_INLINE | VT_BTYPE)) ==
4153 (VT_STATIC | VT_INLINE | VT_FUNC)) {
4154 /* if referencing an inline function, then we generate a
4155 symbol to it if not already done. It will have the
4156 effect to generate code for it at the end of the
4157 compilation unit. Inline function as always
4158 generated in the text section. */
4159 if (!s->c)
4160 put_extern_sym(s, text_section, 0, 0);
4161 r = VT_SYM | VT_CONST;
4162 } else {
4163 r = s->r;
4164 }
4165 vset(&s->type, r, s->c);
4166 /* if forward reference, we must point to s */
4167 if (vtop->r & VT_SYM) {
4168 vtop->sym = s;
4169 vtop->c.i = 0;
4170 }
4171 break;
4172 }
4173
4174 /* post operations */
4175 while (1) {
4176 if (tok == TOK_INC || tok == TOK_DEC) {
4177 inc(1, tok);
4178 next();
4179 } else if (tok == '.' || tok == TOK_ARROW || tok == TOK_CDOUBLE) {
4180 int qualifiers;
4181 /* field */
4182 if (tok == TOK_ARROW)
4183 indir();
4184 qualifiers = vtop->type.t & (VT_CONSTANT | VT_VOLATILE);
4185 test_lvalue();
4186 gaddrof();
4187 /* expect pointer on structure */
4188 if ((vtop->type.t & VT_BTYPE) != VT_STRUCT)
4189 expect("struct or union");
4190 if (tok == TOK_CDOUBLE)
4191 expect("field name");
4192 next();
4193 if (tok == TOK_CINT || tok == TOK_CUINT)
4194 expect("field name");
4195 s = vtop->type.ref;
4196 /* find field */
4197 tok |= SYM_FIELD;
4198 while ((s = s->next) != NULL) {
4199 if (s->v == tok)
4200 break;
4201 }
4202 if (!s)
4203 tcc_error("field not found: %s", get_tok_str(tok & ~SYM_FIELD, &tokc));
4204 /* add field offset to pointer */
4205 vtop->type = char_pointer_type; /* change type to 'char *' */
4206 vpushi(s->c);
4207 gen_op('+');
4208 /* change type to field type, and set to lvalue */
4209 vtop->type = s->type;
4210 vtop->type.t |= qualifiers;
4211 /* an array is never an lvalue */
4212 if (!(vtop->type.t & VT_ARRAY)) {
4213 vtop->r |= lvalue_type(vtop->type.t);
4214 #ifdef CONFIG_TCC_BCHECK
4215 /* if bound checking, the referenced pointer must be checked */
4216 if (tcc_state->do_bounds_check)
4217 vtop->r |= VT_MUSTBOUND;
4218 #endif
4219 }
4220 next();
4221 } else if (tok == '[') {
4222 next();
4223 gexpr();
4224 gen_op('+');
4225 indir();
4226 skip(']');
4227 } else if (tok == '(') {
4228 SValue ret;
4229 Sym *sa;
4230 int nb_args, ret_nregs, ret_align, regsize, variadic;
4231
4232 /* function call */
4233 if ((vtop->type.t & VT_BTYPE) != VT_FUNC) {
4234 /* pointer test (no array accepted) */
4235 if ((vtop->type.t & (VT_BTYPE | VT_ARRAY)) == VT_PTR) {
4236 vtop->type = *pointed_type(&vtop->type);
4237 if ((vtop->type.t & VT_BTYPE) != VT_FUNC)
4238 goto error_func;
4239 } else {
4240 error_func:
4241 expect("function pointer");
4242 }
4243 } else {
4244 vtop->r &= ~VT_LVAL; /* no lvalue */
4245 }
4246 /* get return type */
4247 s = vtop->type.ref;
4248 next();
4249 sa = s->next; /* first parameter */
4250 nb_args = 0;
4251 ret.r2 = VT_CONST;
4252 /* compute first implicit argument if a structure is returned */
4253 if ((s->type.t & VT_BTYPE) == VT_STRUCT) {
4254 variadic = (s->c == FUNC_ELLIPSIS);
4255 ret_nregs = gfunc_sret(&s->type, variadic, &ret.type,
4256 &ret_align, &regsize);
4257 if (!ret_nregs) {
4258 /* get some space for the returned structure */
4259 size = type_size(&s->type, &align);
4260 #ifdef TCC_TARGET_ARM64
4261 /* On arm64, a small struct is return in registers.
4262 It is much easier to write it to memory if we know
4263 that we are allowed to write some extra bytes, so
4264 round the allocated space up to a power of 2: */
4265 if (size < 16)
4266 while (size & (size - 1))
4267 size = (size | (size - 1)) + 1;
4268 #endif
4269 loc = (loc - size) & -align;
4270 ret.type = s->type;
4271 ret.r = VT_LOCAL | VT_LVAL;
4272 /* pass it as 'int' to avoid structure arg passing
4273 problems */
4274 vseti(VT_LOCAL, loc);
4275 ret.c = vtop->c;
4276 nb_args++;
4277 }
4278 } else {
4279 ret_nregs = 1;
4280 ret.type = s->type;
4281 }
4282
4283 if (ret_nregs) {
4284 /* return in register */
4285 if (is_float(ret.type.t)) {
4286 ret.r = reg_fret(ret.type.t);
4287 #ifdef TCC_TARGET_X86_64
4288 if ((ret.type.t & VT_BTYPE) == VT_QFLOAT)
4289 ret.r2 = REG_QRET;
4290 #endif
4291 } else {
4292 #ifndef TCC_TARGET_ARM64
4293 #ifdef TCC_TARGET_X86_64
4294 if ((ret.type.t & VT_BTYPE) == VT_QLONG)
4295 #else
4296 if ((ret.type.t & VT_BTYPE) == VT_LLONG)
4297 #endif
4298 ret.r2 = REG_LRET;
4299 #endif
4300 ret.r = REG_IRET;
4301 }
4302 ret.c.i = 0;
4303 }
4304 if (tok != ')') {
4305 for(;;) {
4306 expr_eq();
4307 gfunc_param_typed(s, sa);
4308 nb_args++;
4309 if (sa)
4310 sa = sa->next;
4311 if (tok == ')')
4312 break;
4313 skip(',');
4314 }
4315 }
4316 if (sa)
4317 tcc_error("too few arguments to function");
4318 skip(')');
4319 if (!nocode_wanted) {
4320 gfunc_call(nb_args);
4321 } else {
4322 vtop -= (nb_args + 1);
4323 }
4324
4325 /* return value */
4326 for (r = ret.r + ret_nregs + !ret_nregs; r-- > ret.r;) {
4327 vsetc(&ret.type, r, &ret.c);
4328 vtop->r2 = ret.r2; /* Loop only happens when r2 is VT_CONST */
4329 }
4330
4331 /* handle packed struct return */
4332 if (((s->type.t & VT_BTYPE) == VT_STRUCT) && ret_nregs) {
4333 int addr, offset;
4334
4335 size = type_size(&s->type, &align);
4336 /* We're writing whole regs often, make sure there's enough
4337 space. Assume register size is power of 2. */
4338 if (regsize > align)
4339 align = regsize;
4340 loc = (loc - size) & -align;
4341 addr = loc;
4342 offset = 0;
4343 for (;;) {
4344 vset(&ret.type, VT_LOCAL | VT_LVAL, addr + offset);
4345 vswap();
4346 vstore();
4347 vtop--;
4348 if (--ret_nregs == 0)
4349 break;
4350 offset += regsize;
4351 }
4352 vset(&s->type, VT_LOCAL | VT_LVAL, addr);
4353 }
4354 } else {
4355 break;
4356 }
4357 }
4358 }
4359
4360 ST_FUNC void expr_prod(void)
4361 {
4362 int t;
4363
4364 unary();
4365 while (tok == '*' || tok == '/' || tok == '%') {
4366 t = tok;
4367 next();
4368 unary();
4369 gen_op(t);
4370 }
4371 }
4372
4373 ST_FUNC void expr_sum(void)
4374 {
4375 int t;
4376
4377 expr_prod();
4378 while (tok == '+' || tok == '-') {
4379 t = tok;
4380 next();
4381 expr_prod();
4382 gen_op(t);
4383 }
4384 }
4385
4386 static void expr_shift(void)
4387 {
4388 int t;
4389
4390 expr_sum();
4391 while (tok == TOK_SHL || tok == TOK_SAR) {
4392 t = tok;
4393 next();
4394 expr_sum();
4395 gen_op(t);
4396 }
4397 }
4398
4399 static void expr_cmp(void)
4400 {
4401 int t;
4402
4403 expr_shift();
4404 while ((tok >= TOK_ULE && tok <= TOK_GT) ||
4405 tok == TOK_ULT || tok == TOK_UGE) {
4406 t = tok;
4407 next();
4408 expr_shift();
4409 gen_op(t);
4410 }
4411 }
4412
4413 static void expr_cmpeq(void)
4414 {
4415 int t;
4416
4417 expr_cmp();
4418 while (tok == TOK_EQ || tok == TOK_NE) {
4419 t = tok;
4420 next();
4421 expr_cmp();
4422 gen_op(t);
4423 }
4424 }
4425
4426 static void expr_and(void)
4427 {
4428 expr_cmpeq();
4429 while (tok == '&') {
4430 next();
4431 expr_cmpeq();
4432 gen_op('&');
4433 }
4434 }
4435
4436 static void expr_xor(void)
4437 {
4438 expr_and();
4439 while (tok == '^') {
4440 next();
4441 expr_and();
4442 gen_op('^');
4443 }
4444 }
4445
4446 static void expr_or(void)
4447 {
4448 expr_xor();
4449 while (tok == '|') {
4450 next();
4451 expr_xor();
4452 gen_op('|');
4453 }
4454 }
4455
4456 static void expr_land(void)
4457 {
4458 expr_or();
4459 if (tok == TOK_LAND) {
4460 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
4461 CType ctb, cti;
4462 ctb.t = VT_BOOL;
4463 cti.t = VT_INT;
4464 next();
4465 gen_cast(&ctb);
4466 if (vtop->c.i) {
4467 vpop();
4468 expr_land();
4469 gen_cast(&ctb);
4470 } else {
4471 expr_land();
4472 vpop();
4473 }
4474 gen_cast(&cti);
4475 } else {
4476 int t = 0;
4477 save_regs(1);
4478 for(;;) {
4479 t = gvtst(1, t);
4480 if (tok != TOK_LAND) {
4481 vseti(VT_JMPI, t);
4482 break;
4483 }
4484 next();
4485 expr_or();
4486 }
4487 }
4488 }
4489 }
4490
4491 static void expr_lor(void)
4492 {
4493 expr_land();
4494 if (tok == TOK_LOR) {
4495 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
4496 CType ctb, cti;
4497 ctb.t = VT_BOOL;
4498 cti.t = VT_INT;
4499 next();
4500 gen_cast(&ctb);
4501 if (vtop->c.i) {
4502 expr_lor();
4503 vpop();
4504 } else {
4505 vpop();
4506 expr_lor();
4507 gen_cast(&ctb);
4508 }
4509 gen_cast(&cti);
4510 } else {
4511 int t = 0;
4512 save_regs(1);
4513 for(;;) {
4514 t = gvtst(0, t);
4515 if (tok != TOK_LOR) {
4516 vseti(VT_JMP, t);
4517 break;
4518 }
4519 next();
4520 expr_land();
4521 }
4522 }
4523 }
4524 }
4525
4526 static void expr_cond(void)
4527 {
4528 int tt, u, r1, r2, rc, t1, t2, bt1, bt2;
4529 SValue sv;
4530 CType type, type1, type2;
4531
4532 expr_lor();
4533 if (tok == '?') {
4534 next();
4535 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) {
4536 CType boolean;
4537 int c;
4538 boolean.t = VT_BOOL;
4539 vdup();
4540 gen_cast(&boolean);
4541 c = vtop->c.i;
4542 vpop();
4543 if (tok != ':' || !gnu_ext) {
4544 vpop();
4545 gexpr();
4546 }
4547 if (!c)
4548 vpop();
4549 skip(':');
4550 expr_cond();
4551 if (c)
4552 vpop();
4553 }
4554 else {
4555 if (vtop != vstack) {
4556 /* needed to avoid having different registers saved in
4557 each branch */
4558 if (is_float(vtop->type.t)) {
4559 rc = RC_FLOAT;
4560 #ifdef TCC_TARGET_X86_64
4561 if ((vtop->type.t & VT_BTYPE) == VT_LDOUBLE) {
4562 rc = RC_ST0;
4563 }
4564 #endif
4565 }
4566 else
4567 rc = RC_INT;
4568 gv(rc);
4569 save_regs(1);
4570 }
4571 if (tok == ':' && gnu_ext) {
4572 gv_dup();
4573 tt = gvtst(1, 0);
4574 } else {
4575 tt = gvtst(1, 0);
4576 gexpr();
4577 }
4578 type1 = vtop->type;
4579 sv = *vtop; /* save value to handle it later */
4580 vtop--; /* no vpop so that FP stack is not flushed */
4581 skip(':');
4582 u = gjmp(0);
4583 gsym(tt);
4584 expr_cond();
4585 type2 = vtop->type;
4586
4587 t1 = type1.t;
4588 bt1 = t1 & VT_BTYPE;
4589 t2 = type2.t;
4590 bt2 = t2 & VT_BTYPE;
4591 /* cast operands to correct type according to ISOC rules */
4592 if (is_float(bt1) || is_float(bt2)) {
4593 if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) {
4594 type.t = VT_LDOUBLE;
4595 } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) {
4596 type.t = VT_DOUBLE;
4597 } else {
4598 type.t = VT_FLOAT;
4599 }
4600 } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) {
4601 /* cast to biggest op */
4602 type.t = VT_LLONG;
4603 /* convert to unsigned if it does not fit in a long long */
4604 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) ||
4605 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED))
4606 type.t |= VT_UNSIGNED;
4607 } else if (bt1 == VT_PTR || bt2 == VT_PTR) {
4608 /* If one is a null ptr constant the result type
4609 is the other. */
4610 if (is_null_pointer (vtop))
4611 type = type1;
4612 else if (is_null_pointer (&sv))
4613 type = type2;
4614 /* XXX: test pointer compatibility, C99 has more elaborate
4615 rules here. */
4616 else
4617 type = type1;
4618 } else if (bt1 == VT_FUNC || bt2 == VT_FUNC) {
4619 /* XXX: test function pointer compatibility */
4620 type = bt1 == VT_FUNC ? type1 : type2;
4621 } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) {
4622 /* XXX: test structure compatibility */
4623 type = bt1 == VT_STRUCT ? type1 : type2;
4624 } else if (bt1 == VT_VOID || bt2 == VT_VOID) {
4625 /* NOTE: as an extension, we accept void on only one side */
4626 type.t = VT_VOID;
4627 } else {
4628 /* integer operations */
4629 type.t = VT_INT;
4630 /* convert to unsigned if it does not fit in an integer */
4631 if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) ||
4632 (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED))
4633 type.t |= VT_UNSIGNED;
4634 }
4635
4636 /* now we convert second operand */
4637 gen_cast(&type);
4638 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
4639 gaddrof();
4640 rc = RC_INT;
4641 if (is_float(type.t)) {
4642 rc = RC_FLOAT;
4643 #ifdef TCC_TARGET_X86_64
4644 if ((type.t & VT_BTYPE) == VT_LDOUBLE) {
4645 rc = RC_ST0;
4646 }
4647 #endif
4648 } else if ((type.t & VT_BTYPE) == VT_LLONG) {
4649 /* for long longs, we use fixed registers to avoid having
4650 to handle a complicated move */
4651 rc = RC_IRET;
4652 }
4653
4654 r2 = gv(rc);
4655 /* this is horrible, but we must also convert first
4656 operand */
4657 tt = gjmp(0);
4658 gsym(u);
4659 /* put again first value and cast it */
4660 *vtop = sv;
4661 gen_cast(&type);
4662 if (VT_STRUCT == (vtop->type.t & VT_BTYPE))
4663 gaddrof();
4664 r1 = gv(rc);
4665 move_reg(r2, r1, type.t);
4666 vtop->r = r2;
4667 gsym(tt);
4668 }
4669 }
4670 }
4671
4672 static void expr_eq(void)
4673 {
4674 int t;
4675
4676 expr_cond();
4677 if (tok == '=' ||
4678 (tok >= TOK_A_MOD && tok <= TOK_A_DIV) ||
4679 tok == TOK_A_XOR || tok == TOK_A_OR ||
4680 tok == TOK_A_SHL || tok == TOK_A_SAR) {
4681 test_lvalue();
4682 t = tok;
4683 next();
4684 if (t == '=') {
4685 expr_eq();
4686 } else {
4687 vdup();
4688 expr_eq();
4689 gen_op(t & 0x7f);
4690 }
4691 vstore();
4692 }
4693 }
4694
4695 ST_FUNC void gexpr(void)
4696 {
4697 while (1) {
4698 expr_eq();
4699 if (tok != ',')
4700 break;
4701 vpop();
4702 next();
4703 }
4704 }
4705
4706 /* parse an expression and return its type without any side effect. */
4707 static void expr_type(CType *type)
4708 {
4709 int saved_nocode_wanted;
4710
4711 saved_nocode_wanted = nocode_wanted;
4712 nocode_wanted = 1;
4713 gexpr();
4714 *type = vtop->type;
4715 vpop();
4716 nocode_wanted = saved_nocode_wanted;
4717 }
4718
4719 /* parse a unary expression and return its type without any side
4720 effect. */
4721 static void unary_type(CType *type)
4722 {
4723 int a;
4724
4725 a = nocode_wanted;
4726 nocode_wanted = 1;
4727 unary();
4728 *type = vtop->type;
4729 vpop();
4730 nocode_wanted = a;
4731 }
4732
4733 /* parse a constant expression and return value in vtop. */
4734 static void expr_const1(void)
4735 {
4736 int a;
4737 a = const_wanted;
4738 const_wanted = 1;
4739 expr_cond();
4740 const_wanted = a;
4741 }
4742
4743 /* parse an integer constant and return its value. */
4744 ST_FUNC int expr_const(void)
4745 {
4746 int c;
4747 expr_const1();
4748 if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST)
4749 expect("constant expression");
4750 c = vtop->c.i;
4751 vpop();
4752 return c;
4753 }
4754
4755 /* return the label token if current token is a label, otherwise
4756 return zero */
4757 static int is_label(void)
4758 {
4759 int last_tok;
4760
4761 /* fast test first */
4762 if (tok < TOK_UIDENT)
4763 return 0;
4764 /* no need to save tokc because tok is an identifier */
4765 last_tok = tok;
4766 next();
4767 if (tok == ':') {
4768 next();
4769 return last_tok;
4770 } else {
4771 unget_tok(last_tok);
4772 return 0;
4773 }
4774 }
4775
4776 static void label_or_decl(int l)
4777 {
4778 int last_tok;
4779
4780 /* fast test first */
4781 if (tok >= TOK_UIDENT)
4782 {
4783 /* no need to save tokc because tok is an identifier */
4784 last_tok = tok;
4785 next();
4786 if (tok == ':') {
4787 unget_tok(last_tok);
4788 return;
4789 }
4790 unget_tok(last_tok);
4791 }
4792 decl(l);
4793 }
4794
4795 static void block(int *bsym, int *csym, int *case_sym, int *def_sym,
4796 int case_reg, int is_expr)
4797 {
4798 int a, b, c, d;
4799 Sym *s, *frame_bottom;
4800
4801 /* generate line number info */
4802 if (tcc_state->do_debug &&
4803 (last_line_num != file->line_num || last_ind != ind)) {
4804 put_stabn(N_SLINE, 0, file->line_num, ind - func_ind);
4805 last_ind = ind;
4806 last_line_num = file->line_num;
4807 }
4808
4809 if (is_expr) {
4810 /* default return value is (void) */
4811 vpushi(0);
4812 vtop->type.t = VT_VOID;
4813 }
4814
4815 if (tok == TOK_IF) {
4816 /* if test */
4817 next();
4818 skip('(');
4819 gexpr();
4820 skip(')');
4821 a = gvtst(1, 0);
4822 block(bsym, csym, case_sym, def_sym, case_reg, 0);
4823 c = tok;
4824 if (c == TOK_ELSE) {
4825 next();
4826 d = gjmp(0);
4827 gsym(a);
4828 block(bsym, csym, case_sym, def_sym, case_reg, 0);
4829 gsym(d); /* patch else jmp */
4830 } else
4831 gsym(a);
4832 } else if (tok == TOK_WHILE) {
4833 next();
4834 d = ind;
4835 vla_sp_restore();
4836 skip('(');
4837 gexpr();
4838 skip(')');
4839 a = gvtst(1, 0);
4840 b = 0;
4841 block(&a, &b, case_sym, def_sym, case_reg, 0);
4842 gjmp_addr(d);
4843 gsym(a);
4844 gsym_addr(b, d);
4845 } else if (tok == '{') {
4846 Sym *llabel;
4847 int block_vla_sp_loc = vla_sp_loc, saved_vlas_in_scope = vlas_in_scope;
4848
4849 next();
4850 /* record local declaration stack position */
4851 s = local_stack;
4852 frame_bottom = sym_push2(&local_stack, SYM_FIELD, 0, 0);
4853 frame_bottom->next = scope_stack_bottom;
4854 scope_stack_bottom = frame_bottom;
4855 llabel = local_label_stack;
4856
4857 /* handle local labels declarations */
4858 if (tok == TOK_LABEL) {
4859 next();
4860 for(;;) {
4861 if (tok < TOK_UIDENT)
4862 expect("label identifier");
4863 label_push(&local_label_stack, tok, LABEL_DECLARED);
4864 next();
4865 if (tok == ',') {
4866 next();
4867 } else {
4868 skip(';');
4869 break;
4870 }
4871 }
4872 }
4873 while (tok != '}') {
4874 label_or_decl(VT_LOCAL);
4875 if (tok != '}') {
4876 if (is_expr)
4877 vpop();
4878 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
4879 }
4880 }
4881 /* pop locally defined labels */
4882 label_pop(&local_label_stack, llabel);
4883 if(is_expr) {
4884 /* XXX: this solution makes only valgrind happy...
4885 triggered by gcc.c-torture/execute/20000917-1.c */
4886 Sym *p;
4887 switch(vtop->type.t & VT_BTYPE) {
4888 /* case VT_PTR: */
4889 /* this breaks a compilation of the linux kernel v2.4.26 */
4890 /* pmd_t *new = ({ __asm__ __volatile__("ud2\n") ; ((pmd_t *)1); }); */
4891 /* Look a commit a80acab: Display error on statement expressions with complex return type */
4892 /* A pointer is not a complex return type */
4893 case VT_STRUCT:
4894 case VT_ENUM:
4895 case VT_FUNC:
4896 for(p=vtop->type.ref;p;p=p->prev)
4897 if(p->prev==s)
4898 tcc_error("unsupported expression type");
4899 }
4900 }
4901 /* pop locally defined symbols */
4902 scope_stack_bottom = scope_stack_bottom->next;
4903 sym_pop(&local_stack, s);
4904
4905 /* Pop VLA frames and restore stack pointer if required */
4906 if (vlas_in_scope > saved_vlas_in_scope) {
4907 vla_sp_loc = saved_vlas_in_scope ? block_vla_sp_loc : vla_sp_root_loc;
4908 vla_sp_restore();
4909 }
4910 vlas_in_scope = saved_vlas_in_scope;
4911
4912 next();
4913 } else if (tok == TOK_RETURN) {
4914 next();
4915 if (tok != ';') {
4916 gexpr();
4917 gen_assign_cast(&func_vt);
4918 #ifdef TCC_TARGET_ARM64
4919 // Perhaps it would be better to use this for all backends:
4920 greturn();
4921 #else
4922 if ((func_vt.t & VT_BTYPE) == VT_STRUCT) {
4923 CType type, ret_type;
4924 int ret_align, ret_nregs, regsize;
4925 ret_nregs = gfunc_sret(&func_vt, func_var, &ret_type,
4926 &ret_align, &regsize);
4927 if (0 == ret_nregs) {
4928 /* if returning structure, must copy it to implicit
4929 first pointer arg location */
4930 type = func_vt;
4931 mk_pointer(&type);
4932 vset(&type, VT_LOCAL | VT_LVAL, func_vc);
4933 indir();
4934 vswap();
4935 /* copy structure value to pointer */
4936 vstore();
4937 } else {
4938 /* returning structure packed into registers */
4939 int r, size, addr, align;
4940 size = type_size(&func_vt,&align);
4941 if ((vtop->r != (VT_LOCAL | VT_LVAL) ||
4942 (vtop->c.i & (ret_align-1)))
4943 && (align & (ret_align-1))) {
4944 loc = (loc - size) & -ret_align;
4945 addr = loc;
4946 type = func_vt;
4947 vset(&type, VT_LOCAL | VT_LVAL, addr);
4948 vswap();
4949 vstore();
4950 vpop();
4951 vset(&ret_type, VT_LOCAL | VT_LVAL, addr);
4952 }
4953 vtop->type = ret_type;
4954 if (is_float(ret_type.t))
4955 r = rc_fret(ret_type.t);
4956 else
4957 r = RC_IRET;
4958
4959 for (;;) {
4960 gv(r);
4961 if (--ret_nregs == 0)
4962 break;
4963 /* We assume that when a structure is returned in multiple
4964 registers, their classes are consecutive values of the
4965 suite s(n) = 2^n */
4966 r <<= 1;
4967 vtop->c.i += regsize;
4968 vtop->r = VT_LOCAL | VT_LVAL;
4969 }
4970 }
4971 } else if (is_float(func_vt.t)) {
4972 gv(rc_fret(func_vt.t));
4973 } else {
4974 gv(RC_IRET);
4975 }
4976 #endif
4977 vtop--; /* NOT vpop() because on x86 it would flush the fp stack */
4978 }
4979 skip(';');
4980 rsym = gjmp(rsym); /* jmp */
4981 } else if (tok == TOK_BREAK) {
4982 /* compute jump */
4983 if (!bsym)
4984 tcc_error("cannot break");
4985 *bsym = gjmp(*bsym);
4986 next();
4987 skip(';');
4988 } else if (tok == TOK_CONTINUE) {
4989 /* compute jump */
4990 if (!csym)
4991 tcc_error("cannot continue");
4992 vla_sp_restore_root();
4993 *csym = gjmp(*csym);
4994 next();
4995 skip(';');
4996 } else if (tok == TOK_FOR) {
4997 int e;
4998 next();
4999 skip('(');
5000 s = local_stack;
5001 frame_bottom = sym_push2(&local_stack, SYM_FIELD, 0, 0);
5002 frame_bottom->next = scope_stack_bottom;
5003 scope_stack_bottom = frame_bottom;
5004 if (tok != ';') {
5005 /* c99 for-loop init decl? */
5006 if (!decl0(VT_LOCAL, 1)) {
5007 /* no, regular for-loop init expr */
5008 gexpr();
5009 vpop();
5010 }
5011 }
5012 skip(';');
5013 d = ind;
5014 c = ind;
5015 vla_sp_restore();
5016 a = 0;
5017 b = 0;
5018 if (tok != ';') {
5019 gexpr();
5020 a = gvtst(1, 0);
5021 }
5022 skip(';');
5023 if (tok != ')') {
5024 e = gjmp(0);
5025 c = ind;
5026 vla_sp_restore();
5027 gexpr();
5028 vpop();
5029 gjmp_addr(d);
5030 gsym(e);
5031 }
5032 skip(')');
5033 block(&a, &b, case_sym, def_sym, case_reg, 0);
5034 gjmp_addr(c);
5035 gsym(a);
5036 gsym_addr(b, c);
5037 scope_stack_bottom = scope_stack_bottom->next;
5038 sym_pop(&local_stack, s);
5039 } else
5040 if (tok == TOK_DO) {
5041 next();
5042 a = 0;
5043 b = 0;
5044 d = ind;
5045 vla_sp_restore();
5046 block(&a, &b, case_sym, def_sym, case_reg, 0);
5047 skip(TOK_WHILE);
5048 skip('(');
5049 gsym(b);
5050 gexpr();
5051 c = gvtst(0, 0);
5052 gsym_addr(c, d);
5053 skip(')');
5054 gsym(a);
5055 skip(';');
5056 } else
5057 if (tok == TOK_SWITCH) {
5058 next();
5059 skip('(');
5060 gexpr();
5061 /* XXX: other types than integer */
5062 case_reg = gv(RC_INT);
5063 vpop();
5064 skip(')');
5065 a = 0;
5066 b = gjmp(0); /* jump to first case */
5067 c = 0;
5068 block(&a, csym, &b, &c, case_reg, 0);
5069 /* if no default, jmp after switch */
5070 if (c == 0)
5071 c = ind;
5072 /* default label */
5073 gsym_addr(b, c);
5074 /* break label */
5075 gsym(a);
5076 } else
5077 if (tok == TOK_CASE) {
5078 int v1, v2;
5079 if (!case_sym)
5080 expect("switch");
5081 next();
5082 v1 = expr_const();
5083 v2 = v1;
5084 if (gnu_ext && tok == TOK_DOTS) {
5085 next();
5086 v2 = expr_const();
5087 if (v2 < v1)
5088 tcc_warning("empty case range");
5089 }
5090 /* since a case is like a label, we must skip it with a jmp */
5091 b = gjmp(0);
5092 gsym(*case_sym);
5093 vseti(case_reg, 0);
5094 vdup();
5095 vpushi(v1);
5096 if (v1 == v2) {
5097 gen_op(TOK_EQ);
5098 *case_sym = gtst(1, 0);
5099 } else {
5100 gen_op(TOK_GE);
5101 *case_sym = gtst(1, 0);
5102 vseti(case_reg, 0);
5103 vpushi(v2);
5104 gen_op(TOK_LE);
5105 *case_sym = gtst(1, *case_sym);
5106 }
5107 case_reg = gv(RC_INT);
5108 vpop();
5109 gsym(b);
5110 skip(':');
5111 is_expr = 0;
5112 goto block_after_label;
5113 } else
5114 if (tok == TOK_DEFAULT) {
5115 next();
5116 skip(':');
5117 if (!def_sym)
5118 expect("switch");
5119 if (*def_sym)
5120 tcc_error("too many 'default'");
5121 *def_sym = ind;
5122 is_expr = 0;
5123 goto block_after_label;
5124 } else
5125 if (tok == TOK_GOTO) {
5126 next();
5127 if (tok == '*' && gnu_ext) {
5128 /* computed goto */
5129 next();
5130 gexpr();
5131 if ((vtop->type.t & VT_BTYPE) != VT_PTR)
5132 expect("pointer");
5133 ggoto();
5134 } else if (tok >= TOK_UIDENT) {
5135 s = label_find(tok);
5136 /* put forward definition if needed */
5137 if (!s) {
5138 s = label_push(&global_label_stack, tok, LABEL_FORWARD);
5139 } else {
5140 if (s->r == LABEL_DECLARED)
5141 s->r = LABEL_FORWARD;
5142 }
5143 vla_sp_restore_root();
5144 if (s->r & LABEL_FORWARD)
5145 s->jnext = gjmp(s->jnext);
5146 else
5147 gjmp_addr(s->jnext);
5148 next();
5149 } else {
5150 expect("label identifier");
5151 }
5152 skip(';');
5153 } else if (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3) {
5154 asm_instr();
5155 } else {
5156 b = is_label();
5157 if (b) {
5158 /* label case */
5159 s = label_find(b);
5160 if (s) {
5161 if (s->r == LABEL_DEFINED)
5162 tcc_error("duplicate label '%s'", get_tok_str(s->v, NULL));
5163 gsym(s->jnext);
5164 s->r = LABEL_DEFINED;
5165 } else {
5166 s = label_push(&global_label_stack, b, LABEL_DEFINED);
5167 }
5168 s->jnext = ind;
5169 vla_sp_restore();
5170 /* we accept this, but it is a mistake */
5171 block_after_label:
5172 if (tok == '}') {
5173 tcc_warning("deprecated use of label at end of compound statement");
5174 } else {
5175 if (is_expr)
5176 vpop();
5177 block(bsym, csym, case_sym, def_sym, case_reg, is_expr);
5178 }
5179 } else {
5180 /* expression case */
5181 if (tok != ';') {
5182 if (is_expr) {
5183 vpop();
5184 gexpr();
5185 } else {
5186 gexpr();
5187 vpop();
5188 }
5189 }
5190 skip(';');
5191 }
5192 }
5193 }
5194
5195 /* t is the array or struct type. c is the array or struct
5196 address. cur_index/cur_field is the pointer to the current
5197 value. 'size_only' is true if only size info is needed (only used
5198 in arrays) */
5199 static void decl_designator(CType *type, Section *sec, unsigned long c,
5200 int *cur_index, Sym **cur_field,
5201 int size_only)
5202 {
5203 Sym *s, *f;
5204 int notfirst, index, index_last, align, l, nb_elems, elem_size;
5205 CType type1;
5206
5207 notfirst = 0;
5208 elem_size = 0;
5209 nb_elems = 1;
5210 if (gnu_ext && (l = is_label()) != 0)
5211 goto struct_field;
5212 while (tok == '[' || tok == '.') {
5213 if (tok == '[') {
5214 if (!(type->t & VT_ARRAY))
5215 expect("array type");
5216 s = type->ref;
5217 next();
5218 index = expr_const();
5219 if (index < 0 || (s->c >= 0 && index >= s->c))
5220 expect("invalid index");
5221 if (tok == TOK_DOTS && gnu_ext) {
5222 next();
5223 index_last = expr_const();
5224 if (index_last < 0 ||
5225 (s->c >= 0 && index_last >= s->c) ||
5226 index_last < index)
5227 expect("invalid index");
5228 } else {
5229 index_last = index;
5230 }
5231 skip(']');
5232 if (!notfirst)
5233 *cur_index = index_last;
5234 type = pointed_type(type);
5235 elem_size = type_size(type, &align);
5236 c += index * elem_size;
5237 /* NOTE: we only support ranges for last designator */
5238 nb_elems = index_last - index + 1;
5239 if (nb_elems != 1) {
5240 notfirst = 1;
5241 break;
5242 }
5243 } else {
5244 next();
5245 l = tok;
5246 next();
5247 struct_field:
5248 if ((type->t & VT_BTYPE) != VT_STRUCT)
5249 expect("struct/union type");
5250 s = type->ref;
5251 l |= SYM_FIELD;
5252 f = s->next;
5253 while (f) {
5254 if (f->v == l)
5255 break;
5256 f = f->next;
5257 }
5258 if (!f)
5259 expect("field");
5260 if (!notfirst)
5261 *cur_field = f;
5262 /* XXX: fix this mess by using explicit storage field */
5263 type1 = f->type;
5264 type1.t |= (type->t & ~VT_TYPE);
5265 type = &type1;
5266 c += f->c;
5267 }
5268 notfirst = 1;
5269 }
5270 if (notfirst) {
5271 if (tok == '=') {
5272 next();
5273 } else {
5274 if (!gnu_ext)
5275 expect("=");
5276 }
5277 } else {
5278 if (type->t & VT_ARRAY) {
5279 index = *cur_index;
5280 type = pointed_type(type);
5281 c += index * type_size(type, &align);
5282 } else {
5283 f = *cur_field;
5284 if (!f)
5285 tcc_error("too many field init");
5286 /* XXX: fix this mess by using explicit storage field */
5287 type1 = f->type;
5288 type1.t |= (type->t & ~VT_TYPE);
5289 type = &type1;
5290 c += f->c;
5291 }
5292 }
5293 decl_initializer(type, sec, c, 0, size_only);
5294
5295 /* XXX: make it more general */
5296 if (!size_only && nb_elems > 1) {
5297 unsigned long c_end;
5298 uint8_t *src, *dst;
5299 int i;
5300
5301 if (!sec)
5302 tcc_error("range init not supported yet for dynamic storage");
5303 c_end = c + nb_elems * elem_size;
5304 if (c_end > sec->data_allocated)
5305 section_realloc(sec, c_end);
5306 src = sec->data + c;
5307 dst = src;
5308 for(i = 1; i < nb_elems; i++) {
5309 dst += elem_size;
5310 memcpy(dst, src, elem_size);
5311 }
5312 }
5313 }
5314
5315 #define EXPR_VAL 0
5316 #define EXPR_CONST 1
5317 #define EXPR_ANY 2
5318
5319 /* store a value or an expression directly in global data or in local array */
5320 static void init_putv(CType *type, Section *sec, unsigned long c,
5321 int v, int expr_type)
5322 {
5323 int saved_global_expr, bt, bit_pos, bit_size;
5324 void *ptr;
5325 unsigned long long bit_mask;
5326 CType dtype;
5327
5328 switch(expr_type) {
5329 case EXPR_VAL:
5330 vpushi(v);
5331 break;
5332 case EXPR_CONST:
5333 /* compound literals must be allocated globally in this case */
5334 saved_global_expr = global_expr;
5335 global_expr = 1;
5336 expr_const1();
5337 global_expr = saved_global_expr;
5338 /* NOTE: symbols are accepted */
5339 if ((vtop->r & (VT_VALMASK | VT_LVAL)) != VT_CONST)
5340 tcc_error("initializer element is not constant");
5341 break;
5342 case EXPR_ANY:
5343 expr_eq();
5344 break;
5345 }
5346
5347 dtype = *type;
5348 dtype.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */
5349
5350 if (sec) {
5351 /* XXX: not portable */
5352 /* XXX: generate error if incorrect relocation */
5353 gen_assign_cast(&dtype);
5354 bt = type->t & VT_BTYPE;
5355 /* we'll write at most 16 bytes */
5356 if (c + 16 > sec->data_allocated) {
5357 section_realloc(sec, c + 16);
5358 }
5359 ptr = sec->data + c;
5360 /* XXX: make code faster ? */
5361 if (!(type->t & VT_BITFIELD)) {
5362 bit_pos = 0;
5363 bit_size = 32;
5364 bit_mask = -1LL;
5365 } else {
5366 bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f;
5367 bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
5368 bit_mask = (1LL << bit_size) - 1;
5369 }
5370 if ((vtop->r & VT_SYM) &&
5371 (bt == VT_BYTE ||
5372 bt == VT_SHORT ||
5373 bt == VT_DOUBLE ||
5374 bt == VT_LDOUBLE ||
5375 bt == VT_LLONG ||
5376 (bt == VT_INT && bit_size != 32)))
5377 tcc_error("initializer element is not computable at load time");
5378 switch(bt) {
5379 /* XXX: when cross-compiling we assume that each type has the
5380 same representation on host and target, which is likely to
5381 be wrong in the case of long double */
5382 case VT_BOOL:
5383 vtop->c.i = (vtop->c.i != 0);
5384 case VT_BYTE:
5385 *(char *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
5386 break;
5387 case VT_SHORT:
5388 *(short *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
5389 break;
5390 case VT_DOUBLE:
5391 *(double *)ptr = vtop->c.d;
5392 break;
5393 case VT_LDOUBLE:
5394 *(long double *)ptr = vtop->c.ld;
5395 break;
5396 case VT_LLONG:
5397 *(long long *)ptr |= (vtop->c.i & bit_mask) << bit_pos;
5398 break;
5399 case VT_PTR: {
5400 addr_t val = (vtop->c.i & bit_mask) << bit_pos;
5401 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
5402 if (vtop->r & VT_SYM)
5403 greloca(sec, vtop->sym, c, R_DATA_PTR, val);
5404 else
5405 *(addr_t *)ptr |= val;
5406 #else
5407 if (vtop->r & VT_SYM)
5408 greloc(sec, vtop->sym, c, R_DATA_PTR);
5409 *(addr_t *)ptr |= val;
5410 #endif
5411 break;
5412 }
5413 default: {
5414 int val = (vtop->c.i & bit_mask) << bit_pos;
5415 #if defined(TCC_TARGET_ARM64) || defined(TCC_TARGET_X86_64)
5416 if (vtop->r & VT_SYM)
5417 greloca(sec, vtop->sym, c, R_DATA_PTR, val);
5418 else
5419 *(int *)ptr |= val;
5420 #else
5421 if (vtop->r & VT_SYM)
5422 greloc(sec, vtop->sym, c, R_DATA_PTR);
5423 *(int *)ptr |= val;
5424 #endif
5425 break;
5426 }
5427 }
5428 vtop--;
5429 } else {
5430 vset(&dtype, VT_LOCAL|VT_LVAL, c);
5431 vswap();
5432 vstore();
5433 vpop();
5434 }
5435 }
5436
5437 /* put zeros for variable based init */
5438 static void init_putz(CType *t, Section *sec, unsigned long c, int size)
5439 {
5440 if (sec) {
5441 /* nothing to do because globals are already set to zero */
5442 } else {
5443 vpush_global_sym(&func_old_type, TOK_memset);
5444 vseti(VT_LOCAL, c);
5445 #ifdef TCC_TARGET_ARM
5446 vpushs(size);
5447 vpushi(0);
5448 #else
5449 vpushi(0);
5450 vpushs(size);
5451 #endif
5452 gfunc_call(3);
5453 }
5454 }
5455
5456 /* 't' contains the type and storage info. 'c' is the offset of the
5457 object in section 'sec'. If 'sec' is NULL, it means stack based
5458 allocation. 'first' is true if array '{' must be read (multi
5459 dimension implicit array init handling). 'size_only' is true if
5460 size only evaluation is wanted (only for arrays). */
5461 static void decl_initializer(CType *type, Section *sec, unsigned long c,
5462 int first, int size_only)
5463 {
5464 int index, array_length, n, no_oblock, nb, parlevel, parlevel1, i;
5465 int size1, align1, expr_type;
5466 Sym *s, *f;
5467 CType *t1;
5468
5469 if (type->t & VT_VLA) {
5470 int a;
5471
5472 /* save current stack pointer */
5473 if (vlas_in_scope == 0) {
5474 if (vla_sp_root_loc == -1)
5475 vla_sp_root_loc = (loc -= PTR_SIZE);
5476 gen_vla_sp_save(vla_sp_root_loc);
5477 }
5478
5479 vla_runtime_type_size(type, &a);
5480 gen_vla_alloc(type, a);
5481 gen_vla_sp_save(c);
5482 vla_sp_loc = c;
5483 vlas_in_scope++;
5484 } else if (type->t & VT_ARRAY) {
5485 s = type->ref;
5486 n = s->c;
5487 array_length = 0;
5488 t1 = pointed_type(type);
5489 size1 = type_size(t1, &align1);
5490
5491 no_oblock = 1;
5492 if ((first && tok != TOK_LSTR && tok != TOK_STR) ||
5493 tok == '{') {
5494 if (tok != '{')
5495 tcc_error("character array initializer must be a literal,"
5496 " optionally enclosed in braces");
5497 skip('{');
5498 no_oblock = 0;
5499 }
5500
5501 /* only parse strings here if correct type (otherwise: handle
5502 them as ((w)char *) expressions */
5503 if ((tok == TOK_LSTR &&
5504 #ifdef TCC_TARGET_PE
5505 (t1->t & VT_BTYPE) == VT_SHORT && (t1->t & VT_UNSIGNED)
5506 #else
5507 (t1->t & VT_BTYPE) == VT_INT
5508 #endif
5509 ) || (tok == TOK_STR && (t1->t & VT_BTYPE) == VT_BYTE)) {
5510 while (tok == TOK_STR || tok == TOK_LSTR) {
5511 int cstr_len, ch;
5512 CString *cstr;
5513
5514 cstr = tokc.cstr;
5515 /* compute maximum number of chars wanted */
5516 if (tok == TOK_STR)
5517 cstr_len = cstr->size;
5518 else
5519 cstr_len = cstr->size / sizeof(nwchar_t);
5520 cstr_len--;
5521 nb = cstr_len;
5522 if (n >= 0 && nb > (n - array_length))
5523 nb = n - array_length;
5524 if (!size_only) {
5525 if (cstr_len > nb)
5526 tcc_warning("initializer-string for array is too long");
5527 /* in order to go faster for common case (char
5528 string in global variable, we handle it
5529 specifically */
5530 if (sec && tok == TOK_STR && size1 == 1) {
5531 memcpy(sec->data + c + array_length, cstr->data, nb);
5532 } else {
5533 for(i=0;i<nb;i++) {
5534 if (tok == TOK_STR)
5535 ch = ((unsigned char *)cstr->data)[i];
5536 else
5537 ch = ((nwchar_t *)cstr->data)[i];
5538 init_putv(t1, sec, c + (array_length + i) * size1,
5539 ch, EXPR_VAL);
5540 }
5541 }
5542 }
5543 array_length += nb;
5544 next();
5545 }
5546 /* only add trailing zero if enough storage (no
5547 warning in this case since it is standard) */
5548 if (n < 0 || array_length < n) {
5549 if (!size_only) {
5550 init_putv(t1, sec, c + (array_length * size1), 0, EXPR_VAL);
5551 }
5552 array_length++;
5553 }
5554 } else {
5555 index = 0;
5556 while (tok != '}') {
5557 decl_designator(type, sec, c, &index, NULL, size_only);
5558 if (n >= 0 && index >= n)
5559 tcc_error("index too large");
5560 /* must put zero in holes (note that doing it that way
5561 ensures that it even works with designators) */
5562 if (!size_only && array_length < index) {
5563 init_putz(t1, sec, c + array_length * size1,
5564 (index - array_length) * size1);
5565 }
5566 index++;
5567 if (index > array_length)
5568 array_length = index;
5569 /* special test for multi dimensional arrays (may not
5570 be strictly correct if designators are used at the
5571 same time) */
5572 if (index >= n && no_oblock)
5573 break;
5574 if (tok == '}')
5575 break;
5576 skip(',');
5577 }
5578 }
5579 if (!no_oblock)
5580 skip('}');
5581 /* put zeros at the end */
5582 if (!size_only && n >= 0 && array_length < n) {
5583 init_putz(t1, sec, c + array_length * size1,
5584 (n - array_length) * size1);
5585 }
5586 /* patch type size if needed */
5587 if (n < 0)
5588 s->c = array_length;
5589 } else if ((type->t & VT_BTYPE) == VT_STRUCT &&
5590 (sec || !first || tok == '{')) {
5591
5592 /* NOTE: the previous test is a specific case for automatic
5593 struct/union init */
5594 /* XXX: union needs only one init */
5595
5596 int par_count = 0;
5597 if (tok == '(') {
5598 AttributeDef ad1;
5599 CType type1;
5600 next();
5601 if (tcc_state->old_struct_init_code) {
5602 /* an old version of struct initialization.
5603 It have a problems. But with a new version
5604 linux 2.4.26 can't load ramdisk.
5605 */
5606 while (tok == '(') {
5607 par_count++;
5608 next();
5609 }
5610 if (!parse_btype(&type1, &ad1))
5611 expect("cast");
5612 type_decl(&type1, &ad1, &n, TYPE_ABSTRACT);
5613 #if 0
5614 if (!is_assignable_types(type, &type1))
5615 tcc_error("invalid type for cast");
5616 #endif
5617 skip(')');
5618 }
5619 else
5620 {
5621 if (tok != '(') {
5622 if (!parse_btype(&type1, &ad1))
5623 expect("cast");
5624 type_decl(&type1, &ad1, &n, TYPE_ABSTRACT);
5625 #if 0
5626 if (!is_assignable_types(type, &type1))
5627 tcc_error("invalid type for cast");
5628 #endif
5629 skip(')');
5630 } else
5631 unget_tok(tok);
5632 }
5633 }
5634
5635 no_oblock = 1;
5636 if (first || tok == '{') {
5637 skip('{');
5638 no_oblock = 0;
5639 }
5640 s = type->ref;
5641 f = s->next;
5642 array_length = 0;
5643 index = 0;
5644 n = s->c;
5645 while (tok != '}') {
5646 decl_designator(type, sec, c, NULL, &f, size_only);
5647 index = f->c;
5648 if (!size_only && array_length < index) {
5649 init_putz(type, sec, c + array_length,
5650 index - array_length);
5651 }
5652 index = index + type_size(&f->type, &align1);
5653 if (index > array_length)
5654 array_length = index;
5655
5656 /* gr: skip fields from same union - ugly. */
5657 while (f->next) {
5658 int align = 0;
5659 int f_size = type_size(&f->type, &align);
5660 int f_type = (f->type.t & VT_BTYPE);
5661
5662 ///printf("index: %2d %08x -- %2d %08x\n", f->c, f->type.t, f->next->c, f->next->type.t);
5663 /* test for same offset */
5664 if (f->next->c != f->c)
5665 break;
5666 if ((f_type == VT_STRUCT) && (f_size == 0)) {
5667 /*
5668 Lets assume a structure of size 0 can't be a member of the union.
5669 This allow to compile the following code from a linux kernel v2.4.26
5670 typedef struct { } rwlock_t;
5671 struct fs_struct {
5672 int count;
5673 rwlock_t lock;
5674 int umask;
5675 };
5676 struct fs_struct init_fs = { { (1) }, (rwlock_t) {}, 0022, };
5677 tcc-0.9.23 can succesfully compile this version of the kernel.
5678 gcc don't have problems with this code too.
5679 */
5680 break;
5681 }
5682 /* if yes, test for bitfield shift */
5683 if ((f->type.t & VT_BITFIELD) && (f->next->type.t & VT_BITFIELD)) {
5684 int bit_pos_1 = (f->type.t >> VT_STRUCT_SHIFT) & 0x3f;
5685 int bit_pos_2 = (f->next->type.t >> VT_STRUCT_SHIFT) & 0x3f;
5686 //printf("bitfield %d %d\n", bit_pos_1, bit_pos_2);
5687 if (bit_pos_1 != bit_pos_2)
5688 break;
5689 }
5690 f = f->next;
5691 }
5692
5693 f = f->next;
5694 if (no_oblock && f == NULL)
5695 break;
5696 if (tok == '}')
5697 break;
5698 skip(',');
5699 }
5700 /* put zeros at the end */
5701 if (!size_only && array_length < n) {
5702 init_putz(type, sec, c + array_length,
5703 n - array_length);
5704 }
5705 if (!no_oblock)
5706 skip('}');
5707 while (par_count) {
5708 skip(')');
5709 par_count--;
5710 }
5711 } else if (tok == '{') {
5712 next();
5713 decl_initializer(type, sec, c, first, size_only);
5714 skip('}');
5715 } else if (size_only) {
5716 /* just skip expression */
5717 parlevel = parlevel1 = 0;
5718 while ((parlevel > 0 || parlevel1 > 0 ||
5719 (tok != '}' && tok != ',')) && tok != -1) {
5720 if (tok == '(')
5721 parlevel++;
5722 else if (tok == ')') {
5723 if (parlevel == 0 && parlevel1 == 0)
5724 break;
5725 parlevel--;
5726 }
5727 else if (tok == '{')
5728 parlevel1++;
5729 else if (tok == '}') {
5730 if (parlevel == 0 && parlevel1 == 0)
5731 break;
5732 parlevel1--;
5733 }
5734 next();
5735 }
5736 } else {
5737 /* currently, we always use constant expression for globals
5738 (may change for scripting case) */
5739 expr_type = EXPR_CONST;
5740 if (!sec)
5741 expr_type = EXPR_ANY;
5742 init_putv(type, sec, c, 0, expr_type);
5743 }
5744 }
5745
5746 /* parse an initializer for type 't' if 'has_init' is non zero, and
5747 allocate space in local or global data space ('r' is either
5748 VT_LOCAL or VT_CONST). If 'v' is non zero, then an associated
5749 variable 'v' of scope 'scope' is declared before initializers
5750 are parsed. If 'v' is zero, then a reference to the new object
5751 is put in the value stack. If 'has_init' is 2, a special parsing
5752 is done to handle string constants. */
5753 static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r,
5754 int has_init, int v, int scope)
5755 {
5756 int size, align, addr, data_offset;
5757 int level;
5758 ParseState saved_parse_state = {0};
5759 TokenString init_str;
5760 Section *sec;
5761 Sym *flexible_array;
5762
5763 flexible_array = NULL;
5764 if ((type->t & VT_BTYPE) == VT_STRUCT) {
5765 Sym *field = type->ref->next;
5766 if (field) {
5767 while (field->next)
5768 field = field->next;
5769 if (field->type.t & VT_ARRAY && field->type.ref->c < 0)
5770 flexible_array = field;
5771 }
5772 }
5773
5774 size = type_size(type, &align);
5775 /* If unknown size, we must evaluate it before
5776 evaluating initializers because
5777 initializers can generate global data too
5778 (e.g. string pointers or ISOC99 compound
5779 literals). It also simplifies local
5780 initializers handling */
5781 tok_str_new(&init_str);
5782 if (size < 0 || (flexible_array && has_init)) {
5783 if (!has_init)
5784 tcc_error("unknown type size");
5785 /* get all init string */
5786 if (has_init == 2) {
5787 /* only get strings */
5788 while (tok == TOK_STR || tok == TOK_LSTR) {
5789 tok_str_add_tok(&init_str);
5790 next();
5791 }
5792 } else {
5793 level = 0;
5794 while (level > 0 || (tok != ',' && tok != ';')) {
5795 if (tok < 0)
5796 tcc_error("unexpected end of file in initializer");
5797 tok_str_add_tok(&init_str);
5798 if (tok == '{')
5799 level++;
5800 else if (tok == '}') {
5801 level--;
5802 if (level <= 0) {
5803 next();
5804 break;
5805 }
5806 }
5807 next();
5808 }
5809 }
5810 tok_str_add(&init_str, -1);
5811 tok_str_add(&init_str, 0);
5812
5813 /* compute size */
5814 save_parse_state(&saved_parse_state);
5815
5816 begin_macro(&init_str, 0);
5817 next();
5818 decl_initializer(type, NULL, 0, 1, 1);
5819 /* prepare second initializer parsing */
5820 macro_ptr = init_str.str;
5821 next();
5822
5823 /* if still unknown size, error */
5824 size = type_size(type, &align);
5825 if (size < 0)
5826 tcc_error("unknown type size");
5827 }
5828 if (flexible_array)
5829 size += flexible_array->type.ref->c * pointed_size(&flexible_array->type);
5830 /* take into account specified alignment if bigger */
5831 if (ad->a.aligned) {
5832 if (ad->a.aligned > align)
5833 align = ad->a.aligned;
5834 } else if (ad->a.packed) {
5835 align = 1;
5836 }
5837 if ((r & VT_VALMASK) == VT_LOCAL) {
5838 sec = NULL;
5839 #ifdef CONFIG_TCC_BCHECK
5840 if (tcc_state->do_bounds_check && (type->t & VT_ARRAY)) {
5841 loc--;
5842 }
5843 #endif
5844 loc = (loc - size) & -align;
5845 addr = loc;
5846 #ifdef CONFIG_TCC_BCHECK
5847 /* handles bounds */
5848 /* XXX: currently, since we do only one pass, we cannot track
5849 '&' operators, so we add only arrays */
5850 if (tcc_state->do_bounds_check && (type->t & VT_ARRAY)) {
5851 addr_t *bounds_ptr;
5852 /* add padding between regions */
5853 loc--;
5854 /* then add local bound info */
5855 bounds_ptr = section_ptr_add(lbounds_section, 2 * sizeof(addr_t));
5856 bounds_ptr[0] = addr;
5857 bounds_ptr[1] = size;
5858 }
5859 #endif
5860 if (v) {
5861 /* local variable */
5862 sym_push(v, type, r, addr);
5863 } else {
5864 /* push local reference */
5865 vset(type, r, addr);
5866 }
5867 } else {
5868 Sym *sym;
5869
5870 sym = NULL;
5871 if (v && scope == VT_CONST) {
5872 /* see if the symbol was already defined */
5873 sym = sym_find(v);
5874 if (sym) {
5875 if (!is_compatible_types(&sym->type, type))
5876 tcc_error("incompatible types for redefinition of '%s'",
5877 get_tok_str(v, NULL));
5878 if (sym->type.t & VT_EXTERN) {
5879 /* if the variable is extern, it was not allocated */
5880 sym->type.t &= ~VT_EXTERN;
5881 /* set array size if it was omitted in extern
5882 declaration */
5883 if ((sym->type.t & VT_ARRAY) &&
5884 sym->type.ref->c < 0 &&
5885 type->ref->c >= 0)
5886 sym->type.ref->c = type->ref->c;
5887 } else {
5888 /* we accept several definitions of the same
5889 global variable. this is tricky, because we
5890 must play with the SHN_COMMON type of the symbol */
5891 /* XXX: should check if the variable was already
5892 initialized. It is incorrect to initialized it
5893 twice */
5894 /* no init data, we won't add more to the symbol */
5895 if (!has_init)
5896 goto no_alloc;
5897 }
5898 }
5899 }
5900
5901 /* allocate symbol in corresponding section */
5902 sec = ad->section;
5903 if (!sec) {
5904 if (has_init)
5905 sec = data_section;
5906 else if (tcc_state->nocommon)
5907 sec = bss_section;
5908 }
5909 if (sec) {
5910 data_offset = sec->data_offset;
5911 data_offset = (data_offset + align - 1) & -align;
5912 addr = data_offset;
5913 /* very important to increment global pointer at this time
5914 because initializers themselves can create new initializers */
5915 data_offset += size;
5916 #ifdef CONFIG_TCC_BCHECK
5917 /* add padding if bound check */
5918 if (tcc_state->do_bounds_check)
5919 data_offset++;
5920 #endif
5921 sec->data_offset = data_offset;
5922 /* allocate section space to put the data */
5923 if (sec->sh_type != SHT_NOBITS &&
5924 data_offset > sec->data_allocated)
5925 section_realloc(sec, data_offset);
5926 /* align section if needed */
5927 if (align > sec->sh_addralign)
5928 sec->sh_addralign = align;
5929 } else {
5930 addr = 0; /* avoid warning */
5931 }
5932
5933 if (v) {
5934 if (scope != VT_CONST || !sym) {
5935 sym = sym_push(v, type, r | VT_SYM, 0);
5936 sym->asm_label = ad->asm_label;
5937 }
5938 /* update symbol definition */
5939 if (sec) {
5940 put_extern_sym(sym, sec, addr, size);
5941 } else {
5942 ElfW(Sym) *esym;
5943 /* put a common area */
5944 put_extern_sym(sym, NULL, align, size);
5945 /* XXX: find a nicer way */
5946 esym = &((ElfW(Sym) *)symtab_section->data)[sym->c];
5947 esym->st_shndx = SHN_COMMON;
5948 }
5949 } else {
5950 /* push global reference */
5951 sym = get_sym_ref(type, sec, addr, size);
5952 vpushsym(type, sym);
5953 }
5954 /* patch symbol weakness */
5955 if (type->t & VT_WEAK)
5956 weaken_symbol(sym);
5957 apply_visibility(sym, type);
5958 #ifdef CONFIG_TCC_BCHECK
5959 /* handles bounds now because the symbol must be defined
5960 before for the relocation */
5961 if (tcc_state->do_bounds_check) {
5962 addr_t *bounds_ptr;
5963
5964 greloc(bounds_section, sym, bounds_section->data_offset, R_DATA_PTR);
5965 /* then add global bound info */
5966 bounds_ptr = section_ptr_add(bounds_section, 2 * sizeof(addr_t));
5967 bounds_ptr[0] = 0; /* relocated */
5968 bounds_ptr[1] = size;
5969 }
5970 #endif
5971 }
5972 if (has_init || (type->t & VT_VLA)) {
5973 decl_initializer(type, sec, addr, 1, 0);
5974 /* restore parse state if needed */
5975 if (init_str.str) {
5976 end_macro();
5977 restore_parse_state(&saved_parse_state);
5978 }
5979 /* patch flexible array member size back to -1, */
5980 /* for possible subsequent similar declarations */
5981 if (flexible_array)
5982 flexible_array->type.ref->c = -1;
5983 }
5984 no_alloc: ;
5985 }
5986
5987 static void put_func_debug(Sym *sym)
5988 {
5989 char buf[512];
5990
5991 /* stabs info */
5992 /* XXX: we put here a dummy type */
5993 snprintf(buf, sizeof(buf), "%s:%c1",
5994 funcname, sym->type.t & VT_STATIC ? 'f' : 'F');
5995 put_stabs_r(buf, N_FUN, 0, file->line_num, 0,
5996 cur_text_section, sym->c);
5997 /* //gr gdb wants a line at the function */
5998 put_stabn(N_SLINE, 0, file->line_num, 0);
5999 last_ind = 0;
6000 last_line_num = 0;
6001 }
6002
6003 /* parse an old style function declaration list */
6004 /* XXX: check multiple parameter */
6005 static void func_decl_list(Sym *func_sym)
6006 {
6007 AttributeDef ad;
6008 int v;
6009 Sym *s;
6010 CType btype, type;
6011
6012 /* parse each declaration */
6013 while (tok != '{' && tok != ';' && tok != ',' && tok != TOK_EOF &&
6014 tok != TOK_ASM1 && tok != TOK_ASM2 && tok != TOK_ASM3) {
6015 if (!parse_btype(&btype, &ad))
6016 expect("declaration list");
6017 if (((btype.t & VT_BTYPE) == VT_ENUM ||
6018 (btype.t & VT_BTYPE) == VT_STRUCT) &&
6019 tok == ';') {
6020 /* we accept no variable after */
6021 } else {
6022 for(;;) {
6023 type = btype;
6024 type_decl(&type, &ad, &v, TYPE_DIRECT);
6025 /* find parameter in function parameter list */
6026 s = func_sym->next;
6027 while (s != NULL) {
6028 if ((s->v & ~SYM_FIELD) == v)
6029 goto found;
6030 s = s->next;
6031 }
6032 tcc_error("declaration for parameter '%s' but no such parameter",
6033 get_tok_str(v, NULL));
6034 found:
6035 /* check that no storage specifier except 'register' was given */
6036 if (type.t & VT_STORAGE)
6037 tcc_error("storage class specified for '%s'", get_tok_str(v, NULL));
6038 convert_parameter_type(&type);
6039 /* we can add the type (NOTE: it could be local to the function) */
6040 s->type = type;
6041 /* accept other parameters */
6042 if (tok == ',')
6043 next();
6044 else
6045 break;
6046 }
6047 }
6048 skip(';');
6049 }
6050 }
6051
6052 /* parse a function defined by symbol 'sym' and generate its code in
6053 'cur_text_section' */
6054 static void gen_function(Sym *sym)
6055 {
6056 int saved_nocode_wanted = nocode_wanted;
6057
6058 nocode_wanted = 0;
6059 ind = cur_text_section->data_offset;
6060 /* NOTE: we patch the symbol size later */
6061 put_extern_sym(sym, cur_text_section, ind, 0);
6062 funcname = get_tok_str(sym->v, NULL);
6063 func_ind = ind;
6064 /* Initialize VLA state */
6065 vla_sp_loc = -1;
6066 vla_sp_root_loc = -1;
6067 /* put debug symbol */
6068 if (tcc_state->do_debug)
6069 put_func_debug(sym);
6070 /* push a dummy symbol to enable local sym storage */
6071 sym_push2(&local_stack, SYM_FIELD, 0, 0);
6072 gfunc_prolog(&sym->type);
6073 #ifdef CONFIG_TCC_BCHECK
6074 if (tcc_state->do_bounds_check && !strcmp(funcname, "main")) {
6075 int i;
6076 Sym *sym;
6077 for (i = 0, sym = local_stack; i < 2; i++, sym = sym->prev) {
6078 if (sym->v & SYM_FIELD || sym->prev->v & SYM_FIELD)
6079 break;
6080 vpush_global_sym(&func_old_type, TOK___bound_main_arg);
6081 vset(&sym->type, sym->r, sym->c);
6082 gfunc_call(1);
6083 }
6084 }
6085 #endif
6086 rsym = 0;
6087 block(NULL, NULL, NULL, NULL, 0, 0);
6088 gsym(rsym);
6089 gfunc_epilog();
6090 cur_text_section->data_offset = ind;
6091 label_pop(&global_label_stack, NULL);
6092 /* reset local stack */
6093 scope_stack_bottom = NULL;
6094 sym_pop(&local_stack, NULL);
6095 /* end of function */
6096 /* patch symbol size */
6097 ((ElfW(Sym) *)symtab_section->data)[sym->c].st_size =
6098 ind - func_ind;
6099 /* patch symbol weakness (this definition overrules any prototype) */
6100 if (sym->type.t & VT_WEAK)
6101 weaken_symbol(sym);
6102 apply_visibility(sym, &sym->type);
6103 if (tcc_state->do_debug) {
6104 put_stabn(N_FUN, 0, 0, ind - func_ind);
6105 }
6106 /* It's better to crash than to generate wrong code */
6107 cur_text_section = NULL;
6108 funcname = ""; /* for safety */
6109 func_vt.t = VT_VOID; /* for safety */
6110 func_var = 0; /* for safety */
6111 ind = 0; /* for safety */
6112 nocode_wanted = saved_nocode_wanted;
6113 check_vstack();
6114 }
6115
6116 ST_FUNC void gen_inline_functions(void)
6117 {
6118 Sym *sym;
6119 int inline_generated, i, ln;
6120 struct InlineFunc *fn;
6121
6122 ln = file->line_num;
6123 /* iterate while inline function are referenced */
6124 for(;;) {
6125 inline_generated = 0;
6126 for (i = 0; i < tcc_state->nb_inline_fns; ++i) {
6127 fn = tcc_state->inline_fns[i];
6128 sym = fn->sym;
6129 if (sym && sym->c) {
6130 /* the function was used: generate its code and
6131 convert it to a normal function */
6132 fn->sym = NULL;
6133 if (file)
6134 pstrcpy(file->filename, sizeof file->filename, fn->filename);
6135 sym->r = VT_SYM | VT_CONST;
6136 sym->type.t &= ~VT_INLINE;
6137
6138 begin_macro(&fn->func_str, 0);
6139 next();
6140 cur_text_section = text_section;
6141 gen_function(sym);
6142 end_macro();
6143
6144 inline_generated = 1;
6145 }
6146 }
6147 if (!inline_generated)
6148 break;
6149 }
6150 file->line_num = ln;
6151 /* free tokens of unused inline functions */
6152 for (i = 0; i < tcc_state->nb_inline_fns; ++i) {
6153 fn = tcc_state->inline_fns[i];
6154 if (fn->sym)
6155 tok_str_free(fn->func_str.str);
6156 }
6157 dynarray_reset(&tcc_state->inline_fns, &tcc_state->nb_inline_fns);
6158 }
6159
6160 /* 'l' is VT_LOCAL or VT_CONST to define default storage type */
6161 static int decl0(int l, int is_for_loop_init)
6162 {
6163 int v, has_init, r;
6164 CType type, btype;
6165 Sym *sym;
6166 AttributeDef ad;
6167
6168 while (1) {
6169 if (!parse_btype(&btype, &ad)) {
6170 if (is_for_loop_init)
6171 return 0;
6172 /* skip redundant ';' */
6173 /* XXX: find more elegant solution */
6174 if (tok == ';') {
6175 next();
6176 continue;
6177 }
6178 if (l == VT_CONST &&
6179 (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
6180 /* global asm block */
6181 asm_global_instr();
6182 continue;
6183 }
6184 /* special test for old K&R protos without explicit int
6185 type. Only accepted when defining global data */
6186 if (l == VT_LOCAL || tok < TOK_DEFINE)
6187 break;
6188 btype.t = VT_INT;
6189 }
6190 if (((btype.t & VT_BTYPE) == VT_ENUM ||
6191 (btype.t & VT_BTYPE) == VT_STRUCT) &&
6192 tok == ';') {
6193 if ((btype.t & VT_BTYPE) == VT_STRUCT) {
6194 int v = btype.ref->v;
6195 if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) >= SYM_FIRST_ANOM)
6196 tcc_warning("unnamed struct/union that defines no instances");
6197 }
6198 next();
6199 continue;
6200 }
6201 while (1) { /* iterate thru each declaration */
6202 type = btype;
6203 type_decl(&type, &ad, &v, TYPE_DIRECT);
6204 #if 0
6205 {
6206 char buf[500];
6207 type_to_str(buf, sizeof(buf), t, get_tok_str(v, NULL));
6208 printf("type = '%s'\n", buf);
6209 }
6210 #endif
6211 if ((type.t & VT_BTYPE) == VT_FUNC) {
6212 if ((type.t & VT_STATIC) && (l == VT_LOCAL)) {
6213 tcc_error("function without file scope cannot be static");
6214 }
6215 /* if old style function prototype, we accept a
6216 declaration list */
6217 sym = type.ref;
6218 if (sym->c == FUNC_OLD)
6219 func_decl_list(sym);
6220 }
6221
6222 if (gnu_ext && (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) {
6223 ad.asm_label = asm_label_instr();
6224 /* parse one last attribute list, after asm label */
6225 parse_attribute(&ad);
6226 if (tok == '{')
6227 expect(";");
6228 }
6229
6230 if (ad.a.weak)
6231 type.t |= VT_WEAK;
6232 #ifdef TCC_TARGET_PE
6233 if (ad.a.func_import)
6234 type.t |= VT_IMPORT;
6235 if (ad.a.func_export)
6236 type.t |= VT_EXPORT;
6237 #endif
6238 type.t |= ad.a.visibility << VT_VIS_SHIFT;
6239
6240 if (tok == '{') {
6241 if (l == VT_LOCAL)
6242 tcc_error("cannot use local functions");
6243 if ((type.t & VT_BTYPE) != VT_FUNC)
6244 expect("function definition");
6245
6246 /* reject abstract declarators in function definition */
6247 sym = type.ref;
6248 while ((sym = sym->next) != NULL)
6249 if (!(sym->v & ~SYM_FIELD))
6250 expect("identifier");
6251
6252 /* XXX: cannot do better now: convert extern line to static inline */
6253 if ((type.t & (VT_EXTERN | VT_INLINE)) == (VT_EXTERN | VT_INLINE))
6254 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
6255
6256 sym = sym_find(v);
6257 if (sym) {
6258 Sym *ref;
6259 if ((sym->type.t & VT_BTYPE) != VT_FUNC)
6260 goto func_error1;
6261
6262 ref = sym->type.ref;
6263 if (0 == ref->a.func_proto)
6264 tcc_error("redefinition of '%s'", get_tok_str(v, NULL));
6265
6266 /* use func_call from prototype if not defined */
6267 if (ref->a.func_call != FUNC_CDECL
6268 && type.ref->a.func_call == FUNC_CDECL)
6269 type.ref->a.func_call = ref->a.func_call;
6270
6271 /* use export from prototype */
6272 if (ref->a.func_export)
6273 type.ref->a.func_export = 1;
6274
6275 /* use static from prototype */
6276 if (sym->type.t & VT_STATIC)
6277 type.t = (type.t & ~VT_EXTERN) | VT_STATIC;
6278
6279 /* If the definition has no visibility use the
6280 one from prototype. */
6281 if (! (type.t & VT_VIS_MASK))
6282 type.t |= sym->type.t & VT_VIS_MASK;
6283
6284 if (!is_compatible_types(&sym->type, &type)) {
6285 func_error1:
6286 tcc_error("incompatible types for redefinition of '%s'",
6287 get_tok_str(v, NULL));
6288 }
6289 type.ref->a.func_proto = 0;
6290 /* if symbol is already defined, then put complete type */
6291 sym->type = type;
6292 } else {
6293 /* put function symbol */
6294 sym = global_identifier_push(v, type.t, 0);
6295 sym->type.ref = type.ref;
6296 }
6297
6298 /* static inline functions are just recorded as a kind
6299 of macro. Their code will be emitted at the end of
6300 the compilation unit only if they are used */
6301 if ((type.t & (VT_INLINE | VT_STATIC)) ==
6302 (VT_INLINE | VT_STATIC)) {
6303 int block_level;
6304 struct InlineFunc *fn;
6305 const char *filename;
6306
6307 filename = file ? file->filename : "";
6308 fn = tcc_malloc(sizeof *fn + strlen(filename));
6309 strcpy(fn->filename, filename);
6310 fn->sym = sym;
6311 tok_str_new(&fn->func_str);
6312
6313 block_level = 0;
6314 for(;;) {
6315 int t;
6316 if (tok == TOK_EOF)
6317 tcc_error("unexpected end of file");
6318 tok_str_add_tok(&fn->func_str);
6319 t = tok;
6320 next();
6321 if (t == '{') {
6322 block_level++;
6323 } else if (t == '}') {
6324 block_level--;
6325 if (block_level == 0)
6326 break;
6327 }
6328 }
6329 tok_str_add(&fn->func_str, -1);
6330 tok_str_add(&fn->func_str, 0);
6331 dynarray_add((void ***)&tcc_state->inline_fns, &tcc_state->nb_inline_fns, fn);
6332
6333 } else {
6334 /* compute text section */
6335 cur_text_section = ad.section;
6336 if (!cur_text_section)
6337 cur_text_section = text_section;
6338 sym->r = VT_SYM | VT_CONST;
6339 gen_function(sym);
6340 }
6341 break;
6342 } else {
6343 if (btype.t & VT_TYPEDEF) {
6344 /* save typedefed type */
6345 /* XXX: test storage specifiers ? */
6346 sym = sym_push(v, &type, 0, 0);
6347 sym->a = ad.a;
6348 sym->type.t |= VT_TYPEDEF;
6349 } else {
6350 r = 0;
6351 if ((type.t & VT_BTYPE) == VT_FUNC) {
6352 /* external function definition */
6353 /* specific case for func_call attribute */
6354 ad.a.func_proto = 1;
6355 type.ref->a = ad.a;
6356 } else if (!(type.t & VT_ARRAY)) {
6357 /* not lvalue if array */
6358 r |= lvalue_type(type.t);
6359 }
6360 has_init = (tok == '=');
6361 if (has_init && (type.t & VT_VLA))
6362 tcc_error("Variable length array cannot be initialized");
6363 if ((btype.t & VT_EXTERN) || ((type.t & VT_BTYPE) == VT_FUNC) ||
6364 ((type.t & VT_ARRAY) && (type.t & VT_STATIC) &&
6365 !has_init && l == VT_CONST && type.ref->c < 0)) {
6366 /* external variable or function */
6367 /* NOTE: as GCC, uninitialized global static
6368 arrays of null size are considered as
6369 extern */
6370 sym = external_sym(v, &type, r);
6371 sym->asm_label = ad.asm_label;
6372
6373 if (ad.alias_target) {
6374 Section tsec;
6375 Elf32_Sym *esym;
6376 Sym *alias_target;
6377
6378 alias_target = sym_find(ad.alias_target);
6379 if (!alias_target || !alias_target->c)
6380 tcc_error("unsupported forward __alias__ attribute");
6381 esym = &((Elf32_Sym *)symtab_section->data)[alias_target->c];
6382 tsec.sh_num = esym->st_shndx;
6383 put_extern_sym2(sym, &tsec, esym->st_value, esym->st_size, 0);
6384 }
6385 } else {
6386 type.t |= (btype.t & VT_STATIC); /* Retain "static". */
6387 if (type.t & VT_STATIC)
6388 r |= VT_CONST;
6389 else
6390 r |= l;
6391 if (has_init)
6392 next();
6393 decl_initializer_alloc(&type, &ad, r, has_init, v, l);
6394 }
6395 }
6396 if (tok != ',') {
6397 if (is_for_loop_init)
6398 return 1;
6399 skip(';');
6400 break;
6401 }
6402 next();
6403 }
6404 ad.a.aligned = 0;
6405 }
6406 }
6407 return 0;
6408 }
6409
6410 ST_FUNC void decl(int l)
6411 {
6412 decl0(l, 0);
6413 }
Tiny C Compiler main repository