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