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