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