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