Program
This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA
Overview
Download & View Program as PDF for free.
More details
- Words: 38,287
- Pages: 218
Aki szeretné elkezdeni tanulni programozni a C-ben, ime egy példa kis algoritmus, amit én irtam: Za učenje C jezika pored literature i softvera neophodan je i neki pomoćni primer malog gotovog koda nekog programčića, evo šta sam ja prvi put napisao u C-u: (Pelles C-Version 5.00.1) and (Borland Delphi 6) /* * * * * */
Otto Virag Cirkus program
#include <stdio.h> #include #include <stdint.h>
/* Ovog zbog velikih celih brojeva */
int mondo(int ne) { return ne; }
/* PROTOTIP FUNKCIJA */
int main(void) { // Nisu postavljene varijable float dax, dox, lina, some; /* Postavljene varijable */ printf("C programcic --> CALCULATOR\n\nUnesi broj x:"); scanf("%e", &dax); printf("Unesi broj y:"); scanf("%e", &dox); printf("Unesi broj operacije:"); /* pocetak izbora operacije */ scanf("%e", &some); if (some == 1) lina = dax + dox; if (some == 2) lina = dax - dox; if (some == 3) lina = dax / dox; if (some == 4) lina = dax * dox; /* to care */ printf("\nDecimalni rezultat: %f", lina); puts("\n"); puts("Ovaj program je napisao Virag Otto @ 2009.\n"); printf("%i", mondo(5)); /* TO, USPELO JE */ printf("\n"); _sleep(2); /* Otisao na spavanje */ return 0; } // I tako je gotov moj prvi mali c program
Tökéletös segéd kód a C nyelv tanulására: /* * TCC - Tiny C Compiler * * Copyright (c) 2001-2004 Fabrice Bellard * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #define _GNU_SOURCE #include "config.h" #ifdef CONFIG_TCCBOOT #include "tccboot.h" #define CONFIG_TCC_STATIC #else #include <stdlib.h> #include <stdio.h> #include <stdarg.h> #include <string.h> #include <errno.h> #include <math.h> #include #include <signal.h> #include #include <setjmp.h> #include #ifdef WIN32 #include <sys/timeb.h> #endif #ifndef WIN32 #include <sys/time.h> #include <sys/ucontext.h> #endif #endif /* !CONFIG_TCCBOOT */ #include "elf.h"
#include "stab.h" #ifndef O_BINARY #define O_BINARY 0 #endif #include "libtcc.h" /* parser debug */ //#define PARSE_DEBUG /* preprocessor debug */ //#define PP_DEBUG /* include file debug */ //#define INC_DEBUG //#define MEM_DEBUG /* assembler debug */ //#define ASM_DEBUG /* target selection */ //#define TCC_TARGET_I386 /* i386 code generator */ //#define TCC_TARGET_ARM /* ARMv4 code generator */ //#define TCC_TARGET_C67 /* TMS320C67xx code generator */ /* default target is I386 */ #if !defined(TCC_TARGET_I386) && !defined(TCC_TARGET_ARM) && \ !defined(TCC_TARGET_C67) #define TCC_TARGET_I386 #endif #if !defined(WIN32) && !defined(TCC_UCLIBC) && !defined(TCC_TARGET_ARM) && \ !defined(TCC_TARGET_C67) #define CONFIG_TCC_BCHECK /* enable bound checking code */ #endif #if defined(WIN32) && !defined(TCC_TARGET_PE) #define CONFIG_TCC_STATIC #endif /* define it to include assembler support */ #if !defined(TCC_TARGET_ARM) && !defined(TCC_TARGET_C67) #define CONFIG_TCC_ASM #endif /* object format selection */ #if defined(TCC_TARGET_C67) #define TCC_TARGET_COFF #endif #define FALSE 0 #define false 0 #define TRUE 1
#define true 1 typedef int BOOL; /* path to find crt1.o, crti.o and crtn.o. Only needed when generating executables or dlls */ #define CONFIG_TCC_CRT_PREFIX "/usr/lib" #define INCLUDE_STACK_SIZE 32 #define IFDEF_STACK_SIZE 64 #define VSTACK_SIZE 256 #define STRING_MAX_SIZE 1024 #define PACK_STACK_SIZE 8 #define TOK_HASH_SIZE 8192 /* must be a power of two */ #define TOK_ALLOC_INCR 512 /* must be a power of two */ #define TOK_MAX_SIZE 4 /* token max size in int unit when stored in string */ /* token symbol management */ typedef struct TokenSym { struct TokenSym *hash_next; struct Sym *sym_define; /* direct pointer to define */ struct Sym *sym_label; /* direct pointer to label */ struct Sym *sym_struct; /* direct pointer to structure */ struct Sym *sym_identifier; /* direct pointer to identifier */ int tok; /* token number */ int len; char str[1]; } TokenSym; typedef struct CString { int size; /* size in bytes */ void *data; /* either 'char *' or 'int *' */ int size_allocated; void *data_allocated; /* if non NULL, data has been malloced */ } CString; /* type definition */ typedef struct CType { int t; struct Sym *ref; } CType; /* constant value */ typedef union CValue { long double ld; double d; float f; int i; unsigned int ui; unsigned int ul; /* address (should be unsigned long on 64 bit cpu) */ long long ll; unsigned long long ull; struct CString *cstr;
void *ptr; int tab[1]; } CValue; /* value on stack */ typedef struct SValue { CType type; /* type */ unsigned short r; /* register + flags */ unsigned short r2; /* second register, used for 'long long' type. If not used, set to VT_CONST */ CValue c; /* constant, if VT_CONST */ struct Sym *sym; /* symbol, if (VT_SYM | VT_CONST) */ } SValue; /* symbol management */ typedef struct Sym { int v; /* symbol token */ int r; /* associated register */ int c; /* associated number */ CType type; /* associated type */ struct Sym *next; /* next related symbol */ struct Sym *prev; /* prev symbol in stack */ struct Sym *prev_tok; /* previous symbol for this token */ } Sym; /* section definition */ /* XXX: use directly ELF structure for parameters ? */ /* special flag to indicate that the section should not be linked to the other ones */ #define SHF_PRIVATE 0x80000000 typedef struct Section { unsigned long data_offset; /* current data offset */ unsigned char *data; /* section data */ unsigned long data_allocated; /* used for realloc() handling */ int sh_name; /* elf section name (only used during output) */ int sh_num; /* elf section number */ int sh_type; /* elf section type */ int sh_flags; /* elf section flags */ int sh_info; /* elf section info */ int sh_addralign; /* elf section alignment */ int sh_entsize; /* elf entry size */ unsigned long sh_size; /* section size (only used during output) */ unsigned long sh_addr; /* address at which the section is relocated */ unsigned long sh_offset; /* address at which the section is relocated */ int nb_hashed_syms; /* used to resize the hash table */ struct Section *link; /* link to another section */ struct Section *reloc; /* corresponding section for relocation, if any */ struct Section *hash; /* hash table for symbols */ struct Section *next; char name[1]; /* section name */ } Section;
typedef struct DLLReference { int level; char name[1]; } DLLReference; /* GNUC attribute definition */ typedef struct AttributeDef { int aligned; int packed; Section *section; unsigned char func_call; /* FUNC_CDECL, FUNC_STDCALL, FUNC_FASTCALLx */ unsigned char dllexport; } AttributeDef; #define SYM_STRUCT 0x40000000 /* struct/union/enum symbol space */ #define SYM_FIELD 0x20000000 /* struct/union field symbol space */ #define SYM_FIRST_ANOM 0x10000000 /* first anonymous sym */ /* stored in 'Sym.c' field */ #define FUNC_NEW 1 /* ansi function prototype */ #define FUNC_OLD 2 /* old function prototype */ #define FUNC_ELLIPSIS 3 /* ansi function prototype with ... */ /* stored in 'Sym.r' field */ #define FUNC_CDECL 0 /* standard c call */ #define FUNC_STDCALL 1 /* pascal c call */ #define FUNC_FASTCALL1 2 /* first param in %eax */ #define FUNC_FASTCALL2 3 /* first parameters in %eax, %edx */ #define FUNC_FASTCALL3 4 /* first parameter in %eax, %edx, %ecx */ /* field 'Sym.t' for macros */ #define MACRO_OBJ 0 /* object like macro */ #define MACRO_FUNC 1 /* function like macro */ /* field 'Sym.r' for C labels */ #define LABEL_DEFINED 0 /* label is defined */ #define LABEL_FORWARD 1 /* label is forward defined */ #define LABEL_DECLARED 2 /* label is declared but never used */ /* type_decl() types */ #define TYPE_ABSTRACT 1 /* type without variable */ #define TYPE_DIRECT 2 /* type with variable */ #define IO_BUF_SIZE 8192 typedef struct BufferedFile { uint8_t *buf_ptr; uint8_t *buf_end; int fd; int line_num; /* current line number - here to simplify code */ int ifndef_macro; /* #ifndef macro / #endif search */ int ifndef_macro_saved; /* saved ifndef_macro */ int *ifdef_stack_ptr; /* ifdef_stack value at the start of the file */
char inc_type; /* type of include */ char inc_filename[512]; /* filename specified by the user */ char filename[1024]; /* current filename - here to simplify code */ unsigned char buffer[IO_BUF_SIZE + 1]; /* extra size for CH_EOB char */ } BufferedFile; #define CH_EOB '\\' /* end of buffer or '\0' char in file */ #define CH_EOF (-1) /* end of file */ /* parsing state (used to save parser state to reparse part of the source several times) */ typedef struct ParseState { int *macro_ptr; int line_num; int tok; CValue tokc; } ParseState; /* used to record tokens */ typedef struct TokenString { int *str; int len; int allocated_len; int last_line_num; } TokenString; /* include file cache, used to find files faster and also to eliminate inclusion if the include file is protected by #ifndef ... #endif */ typedef struct CachedInclude { int ifndef_macro; int hash_next; /* -1 if none */ char type; /* '"' or '>' to give include type */ char filename[1]; /* path specified in #include */ } CachedInclude; #define CACHED_INCLUDES_HASH_SIZE 512 /* parser */ static struct BufferedFile *file; static int ch, tok; static CValue tokc; static CString tokcstr; /* current parsed string, if any */ /* additional informations about token */ static int tok_flags; #define TOK_FLAG_BOL 0x0001 /* beginning of line before */ #define TOK_FLAG_BOF 0x0002 /* beginning of file before */ #define TOK_FLAG_ENDIF 0x0004 /* a endif was found matching starting #ifdef */ static int *macro_ptr, *macro_ptr_allocated; static int *unget_saved_macro_ptr; static int unget_saved_buffer[TOK_MAX_SIZE + 1]; static int unget_buffer_enabled; static int parse_flags;
#define PARSE_FLAG_PREPROCESS 0x0001 /* activate preprocessing */ #define PARSE_FLAG_TOK_NUM 0x0002 /* return numbers instead of TOK_PPNUM */ #define PARSE_FLAG_LINEFEED 0x0004 /* line feed is returned as a token. line feed is also returned at eof */ #define PARSE_FLAG_ASM_COMMENTS 0x0008 /* '#' can be used for line comment */ static Section *text_section, *data_section, *bss_section; /* predefined sections */ static Section *cur_text_section; /* current section where function code is generated */ #ifdef CONFIG_TCC_ASM static Section *last_text_section; /* to handle .previous asm directive */ #endif /* bound check related sections */ static Section *bounds_section; /* contains global data bound description */ static Section *lbounds_section; /* contains local data bound description */ /* symbol sections */ static Section *symtab_section, *strtab_section; /* debug sections */ static Section *stab_section, *stabstr_section; /* loc : local variable index ind : output code index rsym: return symbol anon_sym: anonymous symbol index */ static int rsym, anon_sym, ind, loc; /* expression generation modifiers */ static int const_wanted; /* true if constant wanted */ static int nocode_wanted; /* true if no code generation wanted for an expression */ static int global_expr; /* true if compound literals must be allocated globally (used during initializers parsing */ static CType func_vt; /* current function return type (used by return instruction) */ static int func_vc; static int last_line_num, last_ind, func_ind; /* debug last line number and pc */ static int tok_ident; static TokenSym **table_ident; static TokenSym *hash_ident[TOK_HASH_SIZE]; static char token_buf[STRING_MAX_SIZE + 1]; static char *funcname; static Sym *global_stack, *local_stack; static Sym *define_stack; static Sym *global_label_stack, *local_label_stack; /* symbol allocator */ #define SYM_POOL_NB (8192 / sizeof(Sym)) static Sym *sym_free_first; static SValue vstack[VSTACK_SIZE], *vtop; /* some predefined types */ static CType char_pointer_type, func_old_type, int_type; /* true if isid(c) || isnum(c) */
static unsigned char isidnum_table[256]; /* compile with debug symbol (and use them if error during execution) */ static int do_debug = 0; /* compile with built-in memory and bounds checker */ static int do_bounds_check = 0; /* display benchmark infos */ #if !defined(LIBTCC) static int do_bench = 0; #endif static int total_lines; static int total_bytes; /* use GNU C extensions */ static int gnu_ext = 1; /* use Tiny C extensions */ static int tcc_ext = 1; /* max number of callers shown if error */ static int num_callers = 6; static const char **rt_bound_error_msg; /* XXX: get rid of this ASAP */ static struct TCCState *tcc_state; /* give the path of the tcc libraries */ static const char *tcc_lib_path = CONFIG_TCCDIR; struct TCCState { int output_type; BufferedFile **include_stack_ptr; int *ifdef_stack_ptr; /* include file handling */ char **include_paths; int nb_include_paths; char **sysinclude_paths; int nb_sysinclude_paths; CachedInclude **cached_includes; int nb_cached_includes; char **library_paths; int nb_library_paths; /* array of all loaded dlls (including those referenced by loaded dlls) */ DLLReference **loaded_dlls; int nb_loaded_dlls;
/* sections */ Section **sections; int nb_sections; /* number of sections, including first dummy section */ /* got handling */ Section *got; Section *plt; unsigned long *got_offsets; int nb_got_offsets; /* give the correspondance from symtab indexes to dynsym indexes */ int *symtab_to_dynsym; /* temporary dynamic symbol sections (for dll loading) */ Section *dynsymtab_section; /* exported dynamic symbol section */ Section *dynsym; int nostdinc; /* if true, no standard headers are added */ int nostdlib; /* if true, no standard libraries are added */ int nocommon; /* if true, do not use common symbols for .bss data */ /* if true, static linking is performed */ int static_link; /* if true, all symbols are exported */ int rdynamic; /* if true, only link in referenced objects from archive */ int alacarte_link; /* address of text section */ unsigned long text_addr; int has_text_addr; /* output format, see TCC_OUTPUT_FORMAT_xxx */ int output_format; /* C language options */ int char_is_unsigned; int leading_underscore; /* warning switches */ int warn_write_strings; int warn_unsupported; int warn_error; int warn_none; int warn_implicit_function_declaration; /* error handling */ void *error_opaque; void (*error_func)(void *opaque, const char *msg); int error_set_jmp_enabled;
jmp_buf error_jmp_buf; int nb_errors; /* tiny assembler state */ Sym *asm_labels; /* see include_stack_ptr */ BufferedFile *include_stack[INCLUDE_STACK_SIZE]; /* see ifdef_stack_ptr */ int ifdef_stack[IFDEF_STACK_SIZE]; /* see cached_includes */ int cached_includes_hash[CACHED_INCLUDES_HASH_SIZE]; /* pack stack */ int pack_stack[PACK_STACK_SIZE]; int *pack_stack_ptr; }; /* The current value can be: */ #define VT_VALMASK 0x00ff #define VT_CONST 0x00f0 /* constant in vc (must be first non register value) */ #define VT_LLOCAL 0x00f1 /* lvalue, offset on stack */ #define VT_LOCAL 0x00f2 /* offset on stack */ #define VT_CMP 0x00f3 /* the value is stored in processor flags (in vc) */ #define VT_JMP 0x00f4 /* value is the consequence of jmp true (even) */ #define VT_JMPI 0x00f5 /* value is the consequence of jmp false (odd) */ #define VT_LVAL 0x0100 /* var is an lvalue */ #define VT_SYM 0x0200 /* a symbol value is added */ #define VT_MUSTCAST 0x0400 /* value must be casted to be correct (used for char/short stored in integer registers) */ #define VT_MUSTBOUND 0x0800 /* bound checking must be done before dereferencing value */ #define VT_BOUNDED 0x8000 /* value is bounded. The address of the bounding function call point is in vc */ #define VT_LVAL_BYTE 0x1000 /* lvalue is a byte */ #define VT_LVAL_SHORT 0x2000 /* lvalue is a short */ #define VT_LVAL_UNSIGNED 0x4000 /* lvalue is unsigned */ #define VT_LVAL_TYPE (VT_LVAL_BYTE | VT_LVAL_SHORT | VT_LVAL_UNSIGNED) /* types */ #define VT_INT 0 /* integer type */ #define VT_BYTE 1 /* signed byte type */ #define VT_SHORT 2 /* short type */ #define VT_VOID 3 /* void type */ #define VT_PTR 4 /* pointer */ #define VT_ENUM 5 /* enum definition */ #define VT_FUNC 6 /* function type */ #define VT_STRUCT 7 /* struct/union definition */ #define VT_FLOAT 8 /* IEEE float */ #define VT_DOUBLE 9 /* IEEE double */
#define VT_LDOUBLE 10 /* IEEE long double */ #define VT_BOOL 11 /* ISOC99 boolean type */ #define VT_LLONG 12 /* 64 bit integer */ #define VT_LONG 13 /* long integer (NEVER USED as type, only during parsing) */ #define VT_BTYPE 0x000f /* mask for basic type */ #define VT_UNSIGNED 0x0010 /* unsigned type */ #define VT_ARRAY 0x0020 /* array type (also has VT_PTR) */ #define VT_BITFIELD 0x0040 /* bitfield modifier */ #define VT_CONSTANT 0x0800 /* const modifier */ #define VT_VOLATILE 0x1000 /* volatile modifier */ #define VT_SIGNED 0x2000 /* signed type */ /* storage */ #define VT_EXTERN 0x00000080 /* extern definition */ #define VT_STATIC 0x00000100 /* static variable */ #define VT_TYPEDEF 0x00000200 /* typedef definition */ #define VT_INLINE 0x00000400 /* inline definition */ #define VT_STRUCT_SHIFT 16 /* shift for bitfield shift values */ /* type mask (except storage) */ #define VT_STORAGE (VT_EXTERN | VT_STATIC | VT_TYPEDEF | VT_INLINE) #define VT_TYPE (~(VT_STORAGE)) /* token values */ /* warning: the following compare tokens depend on i386 asm code */ #define TOK_ULT 0x92 #define TOK_UGE 0x93 #define TOK_EQ 0x94 #define TOK_NE 0x95 #define TOK_ULE 0x96 #define TOK_UGT 0x97 #define TOK_LT 0x9c #define TOK_GE 0x9d #define TOK_LE 0x9e #define TOK_GT 0x9f #define TOK_LAND 0xa0 #define TOK_LOR 0xa1 #define TOK_DEC 0xa2 #define TOK_MID 0xa3 /* inc/dec, to void constant */ #define TOK_INC 0xa4 #define TOK_UDIV 0xb0 /* unsigned division */ #define TOK_UMOD 0xb1 /* unsigned modulo */ #define TOK_PDIV 0xb2 /* fast division with undefined rounding for pointers */ #define TOK_CINT 0xb3 /* number in tokc */ #define TOK_CCHAR 0xb4 /* char constant in tokc */ #define TOK_STR 0xb5 /* pointer to string in tokc */ #define TOK_TWOSHARPS 0xb6 /* ## preprocessing token */ #define TOK_LCHAR 0xb7
#define TOK_LSTR 0xb8 #define TOK_CFLOAT 0xb9 /* float constant */ #define TOK_LINENUM 0xba /* line number info */ #define TOK_CDOUBLE 0xc0 /* double constant */ #define TOK_CLDOUBLE 0xc1 /* long double constant */ #define TOK_UMULL 0xc2 /* unsigned 32x32 -> 64 mul */ #define TOK_ADDC1 0xc3 /* add with carry generation */ #define TOK_ADDC2 0xc4 /* add with carry use */ #define TOK_SUBC1 0xc5 /* add with carry generation */ #define TOK_SUBC2 0xc6 /* add with carry use */ #define TOK_CUINT 0xc8 /* unsigned int constant */ #define TOK_CLLONG 0xc9 /* long long constant */ #define TOK_CULLONG 0xca /* unsigned long long constant */ #define TOK_ARROW 0xcb #define TOK_DOTS 0xcc /* three dots */ #define TOK_SHR 0xcd /* unsigned shift right */ #define TOK_PPNUM 0xce /* preprocessor number */ #define TOK_SHL 0x01 /* shift left */ #define TOK_SAR 0x02 /* signed shift right */ /* assignement operators : normal operator or 0x80 */ #define TOK_A_MOD 0xa5 #define TOK_A_AND 0xa6 #define TOK_A_MUL 0xaa #define TOK_A_ADD 0xab #define TOK_A_SUB 0xad #define TOK_A_DIV 0xaf #define TOK_A_XOR 0xde #define TOK_A_OR 0xfc #define TOK_A_SHL 0x81 #define TOK_A_SAR 0x82 #ifndef offsetof #define offsetof(type, field) ((size_t) &((type *)0)->field) #endif #ifndef countof #define countof(tab) (sizeof(tab) / sizeof((tab)[0])) #endif /* WARNING: the content of this string encodes token numbers */ static char tok_two_chars[] = "<=\236>=\235!=\225&&\240||\241++\244--\242==\224<<\1>>\2+=\253=\255*=\252/=\257%=\245&=\246^=\336|=\374->\313..\250##\266"; #define TOK_EOF (-1) /* end of file */ #define TOK_LINEFEED 10 /* line feed */ /* all identificators and strings have token above that */ #define TOK_IDENT 256 /* only used for i386 asm opcodes definitions */ #define DEF_ASM(x) DEF(TOK_ASM_ ## x, #x)
#define DEF_BWL(x) \ DEF(TOK_ASM_ ## x ## b, #x "b") \ DEF(TOK_ASM_ ## x ## w, #x "w") \ DEF(TOK_ASM_ ## x ## l, #x "l") \ DEF(TOK_ASM_ ## x, #x) #define DEF_WL(x) \ DEF(TOK_ASM_ ## x ## w, #x "w") \ DEF(TOK_ASM_ ## x ## l, #x "l") \ DEF(TOK_ASM_ ## x, #x) #define DEF_FP1(x) \ DEF(TOK_ASM_ ## f ## x ## s, "f" #x "s") \ DEF(TOK_ASM_ ## fi ## x ## l, "fi" #x "l") \ DEF(TOK_ASM_ ## f ## x ## l, "f" #x "l") \ DEF(TOK_ASM_ ## fi ## x ## s, "fi" #x "s") #define DEF_FP(x) \ DEF(TOK_ASM_ ## f ## x, "f" #x ) \ DEF(TOK_ASM_ ## f ## x ## p, "f" #x "p") \ DEF_FP1(x) #define DEF_ASMTEST(x) \ DEF_ASM(x ## o) \ DEF_ASM(x ## no) \ DEF_ASM(x ## b) \ DEF_ASM(x ## c) \ DEF_ASM(x ## nae) \ DEF_ASM(x ## nb) \ DEF_ASM(x ## nc) \ DEF_ASM(x ## ae) \ DEF_ASM(x ## e) \ DEF_ASM(x ## z) \ DEF_ASM(x ## ne) \ DEF_ASM(x ## nz) \ DEF_ASM(x ## be) \ DEF_ASM(x ## na) \ DEF_ASM(x ## nbe) \ DEF_ASM(x ## a) \ DEF_ASM(x ## s) \ DEF_ASM(x ## ns) \ DEF_ASM(x ## p) \ DEF_ASM(x ## pe) \ DEF_ASM(x ## np) \ DEF_ASM(x ## po) \ DEF_ASM(x ## l) \ DEF_ASM(x ## nge) \ DEF_ASM(x ## nl) \ DEF_ASM(x ## ge) \ DEF_ASM(x ## le) \ DEF_ASM(x ## ng) \ DEF_ASM(x ## nle) \
DEF_ASM(x ## g) #define TOK_ASM_int TOK_INT enum tcc_token { TOK_LAST = TOK_IDENT - 1, #define DEF(id, str) id, #include "tcctok.h" #undef DEF }; static const char tcc_keywords[] = #define DEF(id, str) str "\0" #include "tcctok.h" #undef DEF ; #define TOK_UIDENT TOK_DEFINE #ifdef WIN32 int __stdcall GetModuleFileNameA(void *, char *, int); void *__stdcall GetProcAddress(void *, const char *); void *__stdcall GetModuleHandleA(const char *); void *__stdcall LoadLibraryA(const char *); int __stdcall FreeConsole(void); #define snprintf _snprintf #define vsnprintf _vsnprintf #ifndef __GNUC__ #define strtold (long double)strtod #define strtof (float)strtod #define strtoll (long long)strtol #endif #elif defined(TCC_UCLIBC) || defined(__FreeBSD__) /* currently incorrect */ long double strtold(const char *nptr, char **endptr) { return (long double)strtod(nptr, endptr); } float strtof(const char *nptr, char **endptr) { return (float)strtod(nptr, endptr); } #else /* XXX: need to define this to use them in non ISOC99 context */ extern float strtof (const char *__nptr, char **__endptr); extern long double strtold (const char *__nptr, char **__endptr); #endif static char *pstrcpy(char *buf, int buf_size, const char *s); static char *pstrcat(char *buf, int buf_size, const char *s); static const char *tcc_basename(const char *name);
static void next(void); static void next_nomacro(void); static void parse_expr_type(CType *type); static void expr_type(CType *type); static void unary_type(CType *type); static void block(int *bsym, int *csym, int *case_sym, int *def_sym, int case_reg, int is_expr); static int expr_const(void); static void expr_eq(void); static void gexpr(void); static void gen_inline_functions(void); static void decl(int l); static void decl_initializer(CType *type, Section *sec, unsigned long c, int first, int size_only); static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r, int has_init, int v, int scope); int gv(int rc); void gv2(int rc1, int rc2); void move_reg(int r, int s); void save_regs(int n); void save_reg(int r); void vpop(void); void vswap(void); void vdup(void); int get_reg(int rc); int get_reg_ex(int rc,int rc2); struct macro_level { struct macro_level *prev; int *p; }; static void macro_subst(TokenString *tok_str, Sym **nested_list, const int *macro_str, struct macro_level **can_read_stream); void gen_op(int op); void force_charshort_cast(int t); static void gen_cast(CType *type); void vstore(void); static Sym *sym_find(int v); static Sym *sym_push(int v, CType *type, int r, int c); /* type handling */ static int type_size(CType *type, int *a); static inline CType *pointed_type(CType *type); static int pointed_size(CType *type); static int lvalue_type(int t); static int parse_btype(CType *type, AttributeDef *ad); static void type_decl(CType *type, AttributeDef *ad, int *v, int td); static int is_compatible_types(CType *type1, CType *type2); int ieee_finite(double d); void error(const char *fmt, ...); void vpushi(int v);
void vrott(int n); void vnrott(int n); void lexpand_nr(void); static void vpush_global_sym(CType *type, int v); void vset(CType *type, int r, int v); void type_to_str(char *buf, int buf_size, CType *type, const char *varstr); char *get_tok_str(int v, CValue *cv); static Sym *get_sym_ref(CType *type, Section *sec, unsigned long offset, unsigned long size); static Sym *external_global_sym(int v, CType *type, int r); /* section generation */ static void section_realloc(Section *sec, unsigned long new_size); static void *section_ptr_add(Section *sec, unsigned long size); static void put_extern_sym(Sym *sym, Section *section, unsigned long value, unsigned long size); static void greloc(Section *s, Sym *sym, unsigned long addr, int type); static int put_elf_str(Section *s, const char *sym); static int put_elf_sym(Section *s, unsigned long value, unsigned long size, int info, int other, int shndx, const char *name); static int add_elf_sym(Section *s, unsigned long value, unsigned long size, int info, int other, int sh_num, const char *name); static void put_elf_reloc(Section *symtab, Section *s, unsigned long offset, int type, int symbol); static void put_stabs(const char *str, int type, int other, int desc, unsigned long value); static void put_stabs_r(const char *str, int type, int other, int desc, unsigned long value, Section *sec, int sym_index); static void put_stabn(int type, int other, int desc, int value); static void put_stabd(int type, int other, int desc); static int tcc_add_dll(TCCState *s, const char *filename, int flags); #define AFF_PRINT_ERROR 0x0001 /* print error if file not found */ #define AFF_REFERENCED_DLL 0x0002 /* load a referenced dll from another dll */ static int tcc_add_file_internal(TCCState *s, const char *filename, int flags); /* tcccoff.c */ int tcc_output_coff(TCCState *s1, FILE *f); /* tccpe.c */ void *resolve_sym(TCCState *s1, const char *sym, int type); int pe_load_def_file(struct TCCState *s1, FILE *fp); void pe_setup_paths(struct TCCState *s1, int *p_output_type, const char **p_outfile, char *first_file); unsigned long pe_add_runtime(struct TCCState *s1); int tcc_output_pe(struct TCCState *s1, const char *filename); /* tccasm.c */ #ifdef CONFIG_TCC_ASM typedef struct ExprValue {
uint32_t v; Sym *sym; } ExprValue; #define MAX_ASM_OPERANDS 30 typedef struct ASMOperand { int id; /* GCC 3 optionnal identifier (0 if number only supported */ char *constraint; char asm_str[16]; /* computed asm string for operand */ SValue *vt; /* C value of the expression */ int ref_index; /* if >= 0, gives reference to a output constraint */ int input_index; /* if >= 0, gives reference to an input constraint */ int priority; /* priority, used to assign registers */ int reg; /* if >= 0, register number used for this operand */ int is_llong; /* true if double register value */ int is_memory; /* true if memory operand */ int is_rw; /* for '+' modifier */ } ASMOperand; static void asm_expr(TCCState *s1, ExprValue *pe); static int asm_int_expr(TCCState *s1); static int find_constraint(ASMOperand *operands, int nb_operands, const char *name, const char **pp); static int tcc_assemble(TCCState *s1, int do_preprocess); #endif static void asm_instr(void); static void asm_global_instr(void); /* true if float/double/long double type */ static inline int is_float(int t) { int bt; bt = t & VT_BTYPE; return bt == VT_LDOUBLE || bt == VT_DOUBLE || bt == VT_FLOAT; } #ifdef TCC_TARGET_I386 #include "i386-gen.c" #endif #ifdef TCC_TARGET_ARM #include "arm-gen.c" #endif #ifdef TCC_TARGET_C67 #include "c67-gen.c" #endif #ifdef CONFIG_TCC_STATIC
#define RTLD_LAZY 0x001 #define RTLD_NOW 0x002 #define RTLD_GLOBAL 0x100 #define RTLD_DEFAULT NULL /* dummy function for profiling */ void *dlopen(const char *filename, int flag) { return NULL; } const char *dlerror(void) { return "error"; } typedef struct TCCSyms { char *str; void *ptr; } TCCSyms; #define TCCSYM(a) { #a, &a, }, /* add the symbol you want here if no dynamic linking is done */ static TCCSyms tcc_syms[] = { #if !defined(CONFIG_TCCBOOT) TCCSYM(printf) TCCSYM(fprintf) TCCSYM(fopen) TCCSYM(fclose) #endif { NULL, NULL }, }; void *resolve_sym(TCCState *s1, const char *symbol, int type) { TCCSyms *p; p = tcc_syms; while (p->str != NULL) { if (!strcmp(p->str, symbol)) return p->ptr; p++; } return NULL; } #elif !defined(WIN32) #include void *resolve_sym(TCCState *s1, const char *sym, int type) {
return dlsym(RTLD_DEFAULT, sym); } #endif /********************************************************/ /* we use our own 'finite' function to avoid potential problems with non standard math libs */ /* XXX: endianness dependent */ int ieee_finite(double d) { int *p = (int *)&d; return ((unsigned)((p[1] | 0x800fffff) + 1)) >> 31; } /* copy a string and truncate it. */ static char *pstrcpy(char *buf, int buf_size, const char *s) { char *q, *q_end; int c; if (buf_size > 0) { q = buf; q_end = buf + buf_size - 1; while (q < q_end) { c = *s++; if (c == '\0') break; *q++ = c; } *q = '\0'; } return buf; } /* strcat and truncate. */ static char *pstrcat(char *buf, int buf_size, const char *s) { int len; len = strlen(buf); if (len < buf_size) pstrcpy(buf + len, buf_size - len, s); return buf; } static int strstart(const char *str, const char *val, const char **ptr) { const char *p, *q; p = str; q = val; while (*q != '\0') { if (*p != *q)
return 0; p++; q++; } if (ptr) *ptr = p; return 1; } /* memory management */ #ifdef MEM_DEBUG int mem_cur_size; int mem_max_size; #endif static inline void tcc_free(void *ptr) { #ifdef MEM_DEBUG mem_cur_size -= malloc_usable_size(ptr); #endif free(ptr); } static void *tcc_malloc(unsigned long size) { void *ptr; ptr = malloc(size); if (!ptr && size) error("memory full"); #ifdef MEM_DEBUG mem_cur_size += malloc_usable_size(ptr); if (mem_cur_size > mem_max_size) mem_max_size = mem_cur_size; #endif return ptr; } static void *tcc_mallocz(unsigned long size) { void *ptr; ptr = tcc_malloc(size); memset(ptr, 0, size); return ptr; } static inline void *tcc_realloc(void *ptr, unsigned long size) { void *ptr1; #ifdef MEM_DEBUG mem_cur_size -= malloc_usable_size(ptr); #endif ptr1 = realloc(ptr, size); #ifdef MEM_DEBUG
/* NOTE: count not correct if alloc error, but not critical */ mem_cur_size += malloc_usable_size(ptr1); if (mem_cur_size > mem_max_size) mem_max_size = mem_cur_size; #endif return ptr1; } static char *tcc_strdup(const char *str) { char *ptr; ptr = tcc_malloc(strlen(str) + 1); strcpy(ptr, str); return ptr; } #define free(p) use_tcc_free(p) #define malloc(s) use_tcc_malloc(s) #define realloc(p, s) use_tcc_realloc(p, s) static void dynarray_add(void ***ptab, int *nb_ptr, void *data) { int nb, nb_alloc; void **pp; nb = *nb_ptr; pp = *ptab; /* every power of two we double array size */ if ((nb & (nb - 1)) == 0) { if (!nb) nb_alloc = 1; else nb_alloc = nb * 2; pp = tcc_realloc(pp, nb_alloc * sizeof(void *)); if (!pp) error("memory full"); *ptab = pp; } pp[nb++] = data; *nb_ptr = nb; } /* symbol allocator */ static Sym *__sym_malloc(void) { Sym *sym_pool, *sym, *last_sym; int i; sym_pool = tcc_malloc(SYM_POOL_NB * sizeof(Sym)); last_sym = sym_free_first; sym = sym_pool; for(i = 0; i < SYM_POOL_NB; i++) {
sym->next = last_sym; last_sym = sym; sym++; } sym_free_first = last_sym; return last_sym; } static inline Sym *sym_malloc(void) { Sym *sym; sym = sym_free_first; if (!sym) sym = __sym_malloc(); sym_free_first = sym->next; return sym; } static inline void sym_free(Sym *sym) { sym->next = sym_free_first; sym_free_first = sym; } Section *new_section(TCCState *s1, const char *name, int sh_type, int sh_flags) { Section *sec; sec = tcc_mallocz(sizeof(Section) + strlen(name)); strcpy(sec->name, name); sec->sh_type = sh_type; sec->sh_flags = sh_flags; switch(sh_type) { case SHT_HASH: case SHT_REL: case SHT_DYNSYM: case SHT_SYMTAB: case SHT_DYNAMIC: sec->sh_addralign = 4; break; case SHT_STRTAB: sec->sh_addralign = 1; break; default: sec->sh_addralign = 32; /* default conservative alignment */ break; } /* only add section if not private */ if (!(sh_flags & SHF_PRIVATE)) { sec->sh_num = s1->nb_sections; dynarray_add((void ***)&s1->sections, &s1->nb_sections, sec); }
return sec; } static void free_section(Section *s) { tcc_free(s->data); tcc_free(s); } /* realloc section and set its content to zero */ static void section_realloc(Section *sec, unsigned long new_size) { unsigned long size; unsigned char *data; size = sec->data_allocated; if (size == 0) size = 1; while (size < new_size) size = size * 2; data = tcc_realloc(sec->data, size); if (!data) error("memory full"); memset(data + sec->data_allocated, 0, size - sec->data_allocated); sec->data = data; sec->data_allocated = size; } /* reserve at least 'size' bytes in section 'sec' from sec->data_offset. */ static void *section_ptr_add(Section *sec, unsigned long size) { unsigned long offset, offset1; offset = sec->data_offset; offset1 = offset + size; if (offset1 > sec->data_allocated) section_realloc(sec, offset1); sec->data_offset = offset1; return sec->data + offset; } /* return a reference to a section, and create it if it does not exists */ Section *find_section(TCCState *s1, const char *name) { Section *sec; int i; for(i = 1; i < s1->nb_sections; i++) { sec = s1->sections[i]; if (!strcmp(name, sec->name)) return sec; }
/* sections are created as PROGBITS */ return new_section(s1, name, SHT_PROGBITS, SHF_ALLOC); } #define SECTION_ABS ((void *)1) /* update sym->c so that it points to an external symbol in section 'section' with value 'value' */ static void put_extern_sym2(Sym *sym, Section *section, unsigned long value, unsigned long size, int can_add_underscore) { int sym_type, sym_bind, sh_num, info; Elf32_Sym *esym; const char *name; char buf1[256]; if (section == NULL) sh_num = SHN_UNDEF; else if (section == SECTION_ABS) sh_num = SHN_ABS; else sh_num = section->sh_num; if (!sym->c) { if ((sym->type.t & VT_BTYPE) == VT_FUNC) sym_type = STT_FUNC; else sym_type = STT_OBJECT; if (sym->type.t & VT_STATIC) sym_bind = STB_LOCAL; else sym_bind = STB_GLOBAL; name = get_tok_str(sym->v, NULL); #ifdef CONFIG_TCC_BCHECK if (do_bounds_check) { char buf[32]; /* XXX: avoid doing that for statics ? */ /* if bound checking is activated, we change some function names by adding the "__bound" prefix */ switch(sym->v) { #if 0 /* XXX: we rely only on malloc hooks */ case TOK_malloc: case TOK_free: case TOK_realloc: case TOK_memalign: case TOK_calloc: #endif case TOK_memcpy: case TOK_memmove: case TOK_memset:
case TOK_strlen: case TOK_strcpy: strcpy(buf, "__bound_"); strcat(buf, name); name = buf; break; } } #endif if (tcc_state->leading_underscore && can_add_underscore) { buf1[0] = '_'; pstrcpy(buf1 + 1, sizeof(buf1) - 1, name); name = buf1; } info = ELF32_ST_INFO(sym_bind, sym_type); sym->c = add_elf_sym(symtab_section, value, size, info, 0, sh_num, name); } else { esym = &((Elf32_Sym *)symtab_section->data)[sym->c]; esym->st_value = value; esym->st_size = size; esym->st_shndx = sh_num; } } static void put_extern_sym(Sym *sym, Section *section, unsigned long value, unsigned long size) { put_extern_sym2(sym, section, value, size, 1); } /* add a new relocation entry to symbol 'sym' in section 's' */ static void greloc(Section *s, Sym *sym, unsigned long offset, int type) { if (!sym->c) put_extern_sym(sym, NULL, 0, 0); /* now we can add ELF relocation info */ put_elf_reloc(symtab_section, s, offset, type, sym->c); } static inline int isid(int c) { return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '_'; } static inline int isnum(int c) { return c >= '0' && c <= '9'; } static inline int isoct(int c) {
return c >= '0' && c <= '7'; } static inline int toup(int c) { if (c >= 'a' && c <= 'z') return c - 'a' + 'A'; else return c; } static void strcat_vprintf(char *buf, int buf_size, const char *fmt, va_list ap) { int len; len = strlen(buf); vsnprintf(buf + len, buf_size - len, fmt, ap); } static void strcat_printf(char *buf, int buf_size, const char *fmt, ...) { va_list ap; va_start(ap, fmt); strcat_vprintf(buf, buf_size, fmt, ap); va_end(ap); } void error1(TCCState *s1, int is_warning, const char *fmt, va_list ap) { char buf[2048]; BufferedFile **f; buf[0] = '\0'; if (file) { for(f = s1->include_stack; f < s1->include_stack_ptr; f++) strcat_printf(buf, sizeof(buf), "In file included from %s:%d:\n", (*f)->filename, (*f)->line_num); if (file->line_num > 0) { strcat_printf(buf, sizeof(buf), "%s:%d: ", file->filename, file->line_num); } else { strcat_printf(buf, sizeof(buf), "%s: ", file->filename); } } else { strcat_printf(buf, sizeof(buf), "tcc: "); } if (is_warning) strcat_printf(buf, sizeof(buf), "warning: "); strcat_vprintf(buf, sizeof(buf), fmt, ap); if (!s1->error_func) { /* default case: stderr */
fprintf(stderr, "%s\n", buf); } else { s1->error_func(s1->error_opaque, buf); } if (!is_warning || s1->warn_error) s1->nb_errors++; } #ifdef LIBTCC void tcc_set_error_func(TCCState *s, void *error_opaque, void (*error_func)(void *opaque, const char *msg)) { s->error_opaque = error_opaque; s->error_func = error_func; } #endif /* error without aborting current compilation */ void error_noabort(const char *fmt, ...) { TCCState *s1 = tcc_state; va_list ap; va_start(ap, fmt); error1(s1, 0, fmt, ap); va_end(ap); } void error(const char *fmt, ...) { TCCState *s1 = tcc_state; va_list ap; va_start(ap, fmt); error1(s1, 0, fmt, ap); va_end(ap); /* better than nothing: in some cases, we accept to handle errors */ if (s1->error_set_jmp_enabled) { longjmp(s1->error_jmp_buf, 1); } else { /* XXX: eliminate this someday */ exit(1); } } void expect(const char *msg) { error("%s expected", msg); } void warning(const char *fmt, ...) { TCCState *s1 = tcc_state;
va_list ap; if (s1->warn_none) return; va_start(ap, fmt); error1(s1, 1, fmt, ap); va_end(ap); } void skip(int c) { if (tok != c) error("'%c' expected", c); next(); } static void test_lvalue(void) { if (!(vtop->r & VT_LVAL)) expect("lvalue"); } /* allocate a new token */ static TokenSym *tok_alloc_new(TokenSym **pts, const char *str, int len) { TokenSym *ts, **ptable; int i; if (tok_ident >= SYM_FIRST_ANOM) error("memory full"); /* expand token table if needed */ i = tok_ident - TOK_IDENT; if ((i % TOK_ALLOC_INCR) == 0) { ptable = tcc_realloc(table_ident, (i + TOK_ALLOC_INCR) * sizeof(TokenSym *)); if (!ptable) error("memory full"); table_ident = ptable; } ts = tcc_malloc(sizeof(TokenSym) + len); table_ident[i] = ts; ts->tok = tok_ident++; ts->sym_define = NULL; ts->sym_label = NULL; ts->sym_struct = NULL; ts->sym_identifier = NULL; ts->len = len; ts->hash_next = NULL; memcpy(ts->str, str, len); ts->str[len] = '\0'; *pts = ts;
return ts; } #define TOK_HASH_INIT 1 #define TOK_HASH_FUNC(h, c) ((h) * 263 + (c)) /* find a token and add it if not found */ static TokenSym *tok_alloc(const char *str, int len) { TokenSym *ts, **pts; int i; unsigned int h; h = TOK_HASH_INIT; for(i=0;ilen == len && !memcmp(ts->str, str, len)) return ts; pts = &(ts->hash_next); } return tok_alloc_new(pts, str, len); } /* CString handling */ static void cstr_realloc(CString *cstr, int new_size) { int size; void *data; size = cstr->size_allocated; if (size == 0) size = 8; /* no need to allocate a too small first string */ while (size < new_size) size = size * 2; data = tcc_realloc(cstr->data_allocated, size); if (!data) error("memory full"); cstr->data_allocated = data; cstr->size_allocated = size; cstr->data = data; } /* add a byte */ static inline void cstr_ccat(CString *cstr, int ch) {
int size; size = cstr->size + 1; if (size > cstr->size_allocated) cstr_realloc(cstr, size); ((unsigned char *)cstr->data)[size - 1] = ch; cstr->size = size; } static void cstr_cat(CString *cstr, const char *str) { int c; for(;;) { c = *str; if (c == '\0') break; cstr_ccat(cstr, c); str++; } } /* add a wide char */ static void cstr_wccat(CString *cstr, int ch) { int size; size = cstr->size + sizeof(int); if (size > cstr->size_allocated) cstr_realloc(cstr, size); *(int *)(((unsigned char *)cstr->data) + size - sizeof(int)) = ch; cstr->size = size; } static void cstr_new(CString *cstr) { memset(cstr, 0, sizeof(CString)); } /* free string and reset it to NULL */ static void cstr_free(CString *cstr) { tcc_free(cstr->data_allocated); cstr_new(cstr); } #define cstr_reset(cstr) cstr_free(cstr) /* XXX: unicode ? */ static void add_char(CString *cstr, int c) { if (c == '\'' || c == '\"' || c == '\\') { /* XXX: could be more precise if char or string */ cstr_ccat(cstr, '\\'); } if (c >= 32 && c <= 126) {
cstr_ccat(cstr, c); } else { cstr_ccat(cstr, '\\'); if (c == '\n') { cstr_ccat(cstr, 'n'); } else { cstr_ccat(cstr, '0' + ((c >> 6) & 7)); cstr_ccat(cstr, '0' + ((c >> 3) & 7)); cstr_ccat(cstr, '0' + (c & 7)); } } } /* XXX: buffer overflow */ /* XXX: float tokens */ char *get_tok_str(int v, CValue *cv) { static char buf[STRING_MAX_SIZE + 1]; static CString cstr_buf; CString *cstr; unsigned char *q; char *p; int i, len; /* NOTE: to go faster, we give a fixed buffer for small strings */ cstr_reset(&cstr_buf); cstr_buf.data = buf; cstr_buf.size_allocated = sizeof(buf); p = buf; switch(v) { case TOK_CINT: case TOK_CUINT: /* XXX: not quite exact, but only useful for testing */ sprintf(p, "%u", cv->ui); break; case TOK_CLLONG: case TOK_CULLONG: /* XXX: not quite exact, but only useful for testing */ sprintf(p, "%Lu", cv->ull); break; case TOK_CCHAR: case TOK_LCHAR: cstr_ccat(&cstr_buf, '\''); add_char(&cstr_buf, cv->i); cstr_ccat(&cstr_buf, '\''); cstr_ccat(&cstr_buf, '\0'); break; case TOK_PPNUM: cstr = cv->cstr; len = cstr->size - 1; for(i=0;idata)[i]);
cstr_ccat(&cstr_buf, '\0'); break; case TOK_STR: case TOK_LSTR: cstr = cv->cstr; cstr_ccat(&cstr_buf, '\"'); if (v == TOK_STR) { len = cstr->size - 1; for(i=0;idata)[i]); } else { len = (cstr->size / sizeof(int)) - 1; for(i=0;idata)[i]); } cstr_ccat(&cstr_buf, '\"'); cstr_ccat(&cstr_buf, '\0'); break; case TOK_LT: v = '<'; goto addv; case TOK_GT: v = '>'; goto addv; case TOK_A_SHL: return strcpy(p, "<<="); case TOK_A_SAR: return strcpy(p, ">>="); default: if (v < TOK_IDENT) { /* search in two bytes table */ q = tok_two_chars; while (*q) { if (q[2] == v) { *p++ = q[0]; *p++ = q[1]; *p = '\0'; return buf; } q += 3; } addv: *p++ = v; *p = '\0'; } else if (v < tok_ident) { return table_ident[v - TOK_IDENT]->str; } else if (v >= SYM_FIRST_ANOM) { /* special name for anonymous symbol */ sprintf(p, "L.%u", v - SYM_FIRST_ANOM); } else { /* should never happen */ return NULL; }
break; } return cstr_buf.data; } /* push, without hashing */ static Sym *sym_push2(Sym **ps, int v, int t, int c) { Sym *s; s = sym_malloc(); s->v = v; s->type.t = t; s->c = c; s->next = NULL; /* add in stack */ s->prev = *ps; *ps = s; return s; } /* find a symbol and return its associated structure. 's' is the top of the symbol stack */ static Sym *sym_find2(Sym *s, int v) { while (s) { if (s->v == v) return s; s = s->prev; } return NULL; } /* structure lookup */ static inline Sym *struct_find(int v) { v -= TOK_IDENT; if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT)) return NULL; return table_ident[v]->sym_struct; } /* find an identifier */ static inline Sym *sym_find(int v) { v -= TOK_IDENT; if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT)) return NULL; return table_ident[v]->sym_identifier; } /* push a given symbol on the symbol stack */ static Sym *sym_push(int v, CType *type, int r, int c) {
Sym *s, **ps; TokenSym *ts; if (local_stack) ps = &local_stack; else ps = &global_stack; s = sym_push2(ps, v, type->t, c); s->type.ref = type->ref; s->r = r; /* don't record fields or anonymous symbols */ /* XXX: simplify */ if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) { /* record symbol in token array */ ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT]; if (v & SYM_STRUCT) ps = &ts->sym_struct; else ps = &ts->sym_identifier; s->prev_tok = *ps; *ps = s; } return s; } /* push a global identifier */ static Sym *global_identifier_push(int v, int t, int c) { Sym *s, **ps; s = sym_push2(&global_stack, v, t, c); /* don't record anonymous symbol */ if (v < SYM_FIRST_ANOM) { ps = &table_ident[v - TOK_IDENT]->sym_identifier; /* modify the top most local identifier, so that sym_identifier will point to 's' when popped */ while (*ps != NULL) ps = &(*ps)->prev_tok; s->prev_tok = NULL; *ps = s; } return s; } /* pop symbols until top reaches 'b' */ static void sym_pop(Sym **ptop, Sym *b) { Sym *s, *ss, **ps; TokenSym *ts; int v; s = *ptop; while(s != b) { ss = s->prev;
v = s->v; /* remove symbol in token array */ /* XXX: simplify */ if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) { ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT]; if (v & SYM_STRUCT) ps = &ts->sym_struct; else ps = &ts->sym_identifier; *ps = s->prev_tok; } sym_free(s); s = ss; } *ptop = b; } /* I/O layer */ BufferedFile *tcc_open(TCCState *s1, const char *filename) { int fd; BufferedFile *bf; fd = open(filename, O_RDONLY | O_BINARY); if (fd < 0) return NULL; bf = tcc_malloc(sizeof(BufferedFile)); if (!bf) { close(fd); return NULL; } bf->fd = fd; bf->buf_ptr = bf->buffer; bf->buf_end = bf->buffer; bf->buffer[0] = CH_EOB; /* put eob symbol */ pstrcpy(bf->filename, sizeof(bf->filename), filename); bf->line_num = 1; bf->ifndef_macro = 0; bf->ifdef_stack_ptr = s1->ifdef_stack_ptr; // printf("opening '%s'\n", filename); return bf; } void tcc_close(BufferedFile *bf) { total_lines += bf->line_num; close(bf->fd); tcc_free(bf); } /* fill input buffer and peek next char */ static int tcc_peekc_slow(BufferedFile *bf)
{ int len; /* only tries to read if really end of buffer */ if (bf->buf_ptr >= bf->buf_end) { if (bf->fd != -1) { #if defined(PARSE_DEBUG) len = 8; #else len = IO_BUF_SIZE; #endif len = read(bf->fd, bf->buffer, len); if (len < 0) len = 0; } else { len = 0; } total_bytes += len; bf->buf_ptr = bf->buffer; bf->buf_end = bf->buffer + len; *bf->buf_end = CH_EOB; } if (bf->buf_ptr < bf->buf_end) { return bf->buf_ptr[0]; } else { bf->buf_ptr = bf->buf_end; return CH_EOF; } } /* return the current character, handling end of block if necessary (but not stray) */ static int handle_eob(void) { return tcc_peekc_slow(file); } /* read next char from current input file and handle end of input buffer */ static inline void inp(void) { ch = *(++(file->buf_ptr)); /* end of buffer/file handling */ if (ch == CH_EOB) ch = handle_eob(); } /* handle '\[\r]\n' */ static void handle_stray(void) { while (ch == '\\') { inp(); if (ch == '\n') { file->line_num++; inp();
} else if (ch == '\r') { inp(); if (ch != '\n') goto fail; file->line_num++; inp(); } else { fail: error("stray '\\' in program"); } } } /* skip the stray and handle the \\n case. Output an error if incorrect char after the stray */ static int handle_stray1(uint8_t *p) { int c; if (p >= file->buf_end) { file->buf_ptr = p; c = handle_eob(); p = file->buf_ptr; if (c == '\\') goto parse_stray; } else { parse_stray: file->buf_ptr = p; ch = *p; handle_stray(); p = file->buf_ptr; c = *p; } return c; } /* handle just the EOB case, but not stray */ #define PEEKC_EOB(c, p)\ {\ p++;\ c = *p;\ if (c == '\\') {\ file->buf_ptr = p;\ c = handle_eob();\ p = file->buf_ptr;\ }\ } /* handle the complicated stray case */ #define PEEKC(c, p)\ {\ p++;\ c = *p;\
if (c == '\\') {\ c = handle_stray1(p);\ p = file->buf_ptr;\ }\ } /* input with '\[\r]\n' handling. Note that this function cannot handle other characters after '\', so you cannot call it inside strings or comments */ static void minp(void) { inp(); if (ch == '\\') handle_stray(); } /* single line C++ comments */ static uint8_t *parse_line_comment(uint8_t *p) { int c; p++; for(;;) { c = *p; redo: if (c == '\n' || c == CH_EOF) { break; } else if (c == '\\') { file->buf_ptr = p; c = handle_eob(); p = file->buf_ptr; if (c == '\\') { PEEKC_EOB(c, p); if (c == '\n') { file->line_num++; PEEKC_EOB(c, p); } else if (c == '\r') { PEEKC_EOB(c, p); if (c == '\n') { file->line_num++; PEEKC_EOB(c, p); } } } else { goto redo; } } else { p++; } } return p; }
/* C comments */ static uint8_t *parse_comment(uint8_t *p) { int c; p++; for(;;) { /* fast skip loop */ for(;;) { c = *p; if (c == '\n' || c == '*' || c == '\\') break; p++; c = *p; if (c == '\n' || c == '*' || c == '\\') break; p++; } /* now we can handle all the cases */ if (c == '\n') { file->line_num++; p++; } else if (c == '*') { p++; for(;;) { c = *p; if (c == '*') { p++; } else if (c == '/') { goto end_of_comment; } else if (c == '\\') { file->buf_ptr = p; c = handle_eob(); p = file->buf_ptr; if (c == '\\') { /* skip '\[\r]\n', otherwise just skip the stray */ while (c == '\\') { PEEKC_EOB(c, p); if (c == '\n') { file->line_num++; PEEKC_EOB(c, p); } else if (c == '\r') { PEEKC_EOB(c, p); if (c == '\n') { file->line_num++; PEEKC_EOB(c, p); } } else { goto after_star; } } }
} else { break; } } after_star: ; } else { /* stray, eob or eof */ file->buf_ptr = p; c = handle_eob(); p = file->buf_ptr; if (c == CH_EOF) { error("unexpected end of file in comment"); } else if (c == '\\') { p++; } } } end_of_comment: p++; return p; } #define cinp minp /* space exlcuding newline */ static inline int is_space(int ch) { return ch == ' ' || ch == '\t' || ch == '\v' || ch == '\f' || ch == '\r'; } static inline void skip_spaces(void) { while (is_space(ch)) cinp(); } /* parse a string without interpreting escapes */ static uint8_t *parse_pp_string(uint8_t *p, int sep, CString *str) { int c; p++; for(;;) { c = *p; if (c == sep) { break; } else if (c == '\\') { file->buf_ptr = p; c = handle_eob(); p = file->buf_ptr; if (c == CH_EOF) { unterminated_string: /* XXX: indicate line number of start of string */
error("missing terminating %c character", sep); } else if (c == '\\') { /* escape : just skip \[\r]\n */ PEEKC_EOB(c, p); if (c == '\n') { file->line_num++; p++; } else if (c == '\r') { PEEKC_EOB(c, p); if (c != '\n') expect("'\n' after '\r'"); file->line_num++; p++; } else if (c == CH_EOF) { goto unterminated_string; } else { if (str) { cstr_ccat(str, '\\'); cstr_ccat(str, c); } p++; } } } else if (c == '\n') { file->line_num++; goto add_char; } else if (c == '\r') { PEEKC_EOB(c, p); if (c != '\n') { if (str) cstr_ccat(str, '\r'); } else { file->line_num++; goto add_char; } } else { add_char: if (str) cstr_ccat(str, c); p++; } } p++; return p; } /* skip block of text until #else, #elif or #endif. skip also pairs of #if/#endif */ void preprocess_skip(void) { int a, start_of_line, c; uint8_t *p;
p = file->buf_ptr; start_of_line = 1; a = 0; for(;;) { redo_no_start: c = *p; switch(c) { case ' ': case '\t': case '\f': case '\v': case '\r': p++; goto redo_no_start; case '\n': start_of_line = 1; file->line_num++; p++; goto redo_no_start; case '\\': file->buf_ptr = p; c = handle_eob(); if (c == CH_EOF) { expect("#endif"); } else if (c == '\\') { /* XXX: incorrect: should not give an error */ ch = file->buf_ptr[0]; handle_stray(); } p = file->buf_ptr; goto redo_no_start; /* skip strings */ case '\"': case '\'': p = parse_pp_string(p, c, NULL); break; /* skip comments */ case '/': file->buf_ptr = p; ch = *p; minp(); p = file->buf_ptr; if (ch == '*') { p = parse_comment(p); } else if (ch == '/') { p = parse_line_comment(p); } break; case '#': p++; if (start_of_line) { file->buf_ptr = p;
next_nomacro(); p = file->buf_ptr; if (a == 0 && (tok == TOK_ELSE || tok == TOK_ELIF || tok == TOK_ENDIF)) goto the_end; if (tok == TOK_IF || tok == TOK_IFDEF || tok == TOK_IFNDEF) a++; else if (tok == TOK_ENDIF) a--; } break; default: p++; break; } start_of_line = 0; } the_end: ; file->buf_ptr = p; } /* ParseState handling */ /* XXX: currently, no include file info is stored. Thus, we cannot display accurate messages if the function or data definition spans multiple files */ /* save current parse state in 's' */ void save_parse_state(ParseState *s) { s->line_num = file->line_num; s->macro_ptr = macro_ptr; s->tok = tok; s->tokc = tokc; } /* restore parse state from 's' */ void restore_parse_state(ParseState *s) { file->line_num = s->line_num; macro_ptr = s->macro_ptr; tok = s->tok; tokc = s->tokc; } /* return the number of additional 'ints' necessary to store the token */ static inline int tok_ext_size(int t) { switch(t) { /* 4 bytes */ case TOK_CINT: case TOK_CUINT:
case TOK_CCHAR: case TOK_LCHAR: case TOK_CFLOAT: case TOK_LINENUM: return 1; case TOK_STR: case TOK_LSTR: case TOK_PPNUM: error("unsupported token"); return 1; case TOK_CDOUBLE: case TOK_CLLONG: case TOK_CULLONG: return 2; case TOK_CLDOUBLE: return LDOUBLE_SIZE / 4; default: return 0; } } /* token string handling */ static inline void tok_str_new(TokenString *s) { s->str = NULL; s->len = 0; s->allocated_len = 0; s->last_line_num = -1; } static void tok_str_free(int *str) { tcc_free(str); } static int *tok_str_realloc(TokenString *s) { int *str, len; if (s->allocated_len == 0) { len = 8; } else { len = s->allocated_len * 2; } str = tcc_realloc(s->str, len * sizeof(int)); if (!str) error("memory full"); s->allocated_len = len; s->str = str; return str; }
static void tok_str_add(TokenString *s, int t) { int len, *str; len = s->len; str = s->str; if (len >= s->allocated_len) str = tok_str_realloc(s); str[len++] = t; s->len = len; } static void tok_str_add2(TokenString *s, int t, CValue *cv) { int len, *str; len = s->len; str = s->str; /* allocate space for worst case */ if (len + TOK_MAX_SIZE > s->allocated_len) str = tok_str_realloc(s); str[len++] = t; switch(t) { case TOK_CINT: case TOK_CUINT: case TOK_CCHAR: case TOK_LCHAR: case TOK_CFLOAT: case TOK_LINENUM: str[len++] = cv->tab[0]; break; case TOK_PPNUM: case TOK_STR: case TOK_LSTR: { int nb_words; CString *cstr; nb_words = (sizeof(CString) + cv->cstr->size + 3) >> 2; while ((len + nb_words) > s->allocated_len) str = tok_str_realloc(s); cstr = (CString *)(str + len); cstr->data = NULL; cstr->size = cv->cstr->size; cstr->data_allocated = NULL; cstr->size_allocated = cstr->size; memcpy((char *)cstr + sizeof(CString), cv->cstr->data, cstr->size); len += nb_words; } break; case TOK_CDOUBLE:
case TOK_CLLONG: case TOK_CULLONG: #if LDOUBLE_SIZE == 8 case TOK_CLDOUBLE: #endif str[len++] = cv->tab[0]; str[len++] = cv->tab[1]; break; #if LDOUBLE_SIZE == 12 case TOK_CLDOUBLE: str[len++] = cv->tab[0]; str[len++] = cv->tab[1]; str[len++] = cv->tab[2]; #elif LDOUBLE_SIZE != 8 #error add long double size support #endif break; default: break; } s->len = len; } /* add the current parse token in token string 's' */ static void tok_str_add_tok(TokenString *s) { CValue cval; /* save line number info */ if (file->line_num != s->last_line_num) { s->last_line_num = file->line_num; cval.i = s->last_line_num; tok_str_add2(s, TOK_LINENUM, &cval); } tok_str_add2(s, tok, &tokc); } #if LDOUBLE_SIZE == 12 #define LDOUBLE_GET(p, cv) cv.tab[0] = p[0]; \ cv.tab[1] = p[1]; \ cv.tab[2] = p[2]; #elif LDOUBLE_SIZE == 8 #define LDOUBLE_GET(p, cv) cv.tab[0] = p[0]; \ cv.tab[1] = p[1]; #else #error add long double size support #endif
\
\
/* get a token from an integer array and increment pointer accordingly. we code it as a macro to avoid pointer aliasing. */
#define TOK_GET(t, p, cv) \ { \ t = *p++; \ switch(t) { \ case TOK_CINT: \ case TOK_CUINT: \ case TOK_CCHAR: \ case TOK_LCHAR: \ case TOK_CFLOAT: \ case TOK_LINENUM: \ cv.tab[0] = *p++; \ break; \ case TOK_STR: \ case TOK_LSTR: \ case TOK_PPNUM: \ cv.cstr = (CString *)p; \ cv.cstr->data = (char *)p + sizeof(CString);\ p += (sizeof(CString) + cv.cstr->size + 3) >> 2;\ break; \ case TOK_CDOUBLE: \ case TOK_CLLONG: \ case TOK_CULLONG: \ cv.tab[0] = p[0]; \ cv.tab[1] = p[1]; \ p += 2; \ break; \ case TOK_CLDOUBLE: \ LDOUBLE_GET(p, cv); \ p += LDOUBLE_SIZE / 4; \ break; \ default: \ break; \ } \ } /* defines handling */ static inline void define_push(int v, int macro_type, int *str, Sym *first_arg) { Sym *s; s = sym_push2(&define_stack, v, macro_type, (int)str); s->next = first_arg; table_ident[v - TOK_IDENT]->sym_define = s; } /* undefined a define symbol. Its name is just set to zero */ static void define_undef(Sym *s) { int v; v = s->v; if (v >= TOK_IDENT && v < tok_ident) table_ident[v - TOK_IDENT]->sym_define = NULL; s->v = 0;
} static inline Sym *define_find(int v) { v -= TOK_IDENT; if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT)) return NULL; return table_ident[v]->sym_define; } /* free define stack until top reaches 'b' */ static void free_defines(Sym *b) { Sym *top, *top1; int v; top = define_stack; while (top != b) { top1 = top->prev; /* do not free args or predefined defines */ if (top->c) tok_str_free((int *)top->c); v = top->v; if (v >= TOK_IDENT && v < tok_ident) table_ident[v - TOK_IDENT]->sym_define = NULL; sym_free(top); top = top1; } define_stack = b; } /* label lookup */ static Sym *label_find(int v) { v -= TOK_IDENT; if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT)) return NULL; return table_ident[v]->sym_label; } static Sym *label_push(Sym **ptop, int v, int flags) { Sym *s, **ps; s = sym_push2(ptop, v, 0, 0); s->r = flags; ps = &table_ident[v - TOK_IDENT]->sym_label; if (ptop == &global_label_stack) { /* modify the top most local identifier, so that sym_identifier will point to 's' when popped */ while (*ps != NULL) ps = &(*ps)->prev_tok; } s->prev_tok = *ps;
*ps = s; return s; } /* pop labels until element last is reached. Look if any labels are undefined. Define symbols if '&&label' was used. */ static void label_pop(Sym **ptop, Sym *slast) { Sym *s, *s1; for(s = *ptop; s != slast; s = s1) { s1 = s->prev; if (s->r == LABEL_DECLARED) { warning("label '%s' declared but not used", get_tok_str(s->v, NULL)); } else if (s->r == LABEL_FORWARD) { error("label '%s' used but not defined", get_tok_str(s->v, NULL)); } else { if (s->c) { /* define corresponding symbol. A size of 1 is put. */ put_extern_sym(s, cur_text_section, (long)s->next, 1); } } /* remove label */ table_ident[s->v - TOK_IDENT]->sym_label = s->prev_tok; sym_free(s); } *ptop = slast; } /* eval an expression for #if/#elif */ static int expr_preprocess(void) { int c, t; TokenString str; tok_str_new(&str); while (tok != TOK_LINEFEED && tok != TOK_EOF) { next(); /* do macro subst */ if (tok == TOK_DEFINED) { next_nomacro(); t = tok; if (t == '(') next_nomacro(); c = define_find(tok) != 0; if (t == '(') next_nomacro(); tok = TOK_CINT; tokc.i = c; } else if (tok >= TOK_IDENT) { /* if undefined macro */ tok = TOK_CINT; tokc.i = 0;
} tok_str_add_tok(&str); } tok_str_add(&str, -1); /* simulate end of file */ tok_str_add(&str, 0); /* now evaluate C constant expression */ macro_ptr = str.str; next(); c = expr_const(); macro_ptr = NULL; tok_str_free(str.str); return c != 0; } #if defined(PARSE_DEBUG) || defined(PP_DEBUG) static void tok_print(int *str) { int t; CValue cval; while (1) { TOK_GET(t, str, cval); if (!t) break; printf(" %s", get_tok_str(t, &cval)); } printf("\n"); } #endif /* parse after #define */ static void parse_define(void) { Sym *s, *first, **ps; int v, t, varg, is_vaargs, c; TokenString str; v = tok; if (v < TOK_IDENT) error("invalid macro name '%s'", get_tok_str(tok, &tokc)); /* XXX: should check if same macro (ANSI) */ first = NULL; t = MACRO_OBJ; /* '(' must be just after macro definition for MACRO_FUNC */ c = file->buf_ptr[0]; if (c == '\\') c = handle_stray1(file->buf_ptr); if (c == '(') { next_nomacro(); next_nomacro(); ps = &first; while (tok != ')') { varg = tok;
next_nomacro(); is_vaargs = 0; if (varg == TOK_DOTS) { varg = TOK___VA_ARGS__; is_vaargs = 1; } else if (tok == TOK_DOTS && gnu_ext) { is_vaargs = 1; next_nomacro(); } if (varg < TOK_IDENT) error("badly punctuated parameter list"); s = sym_push2(&define_stack, varg | SYM_FIELD, is_vaargs, 0); *ps = s; ps = &s->next; if (tok != ',') break; next_nomacro(); } t = MACRO_FUNC; } tok_str_new(&str); next_nomacro(); /* EOF testing necessary for '-D' handling */ while (tok != TOK_LINEFEED && tok != TOK_EOF) { tok_str_add2(&str, tok, &tokc); next_nomacro(); } tok_str_add(&str, 0); #ifdef PP_DEBUG printf("define %s %d: ", get_tok_str(v, NULL), t); tok_print(str.str); #endif define_push(v, t, str.str, first); } static inline int hash_cached_include(int type, const char *filename) { const unsigned char *s; unsigned int h; h = TOK_HASH_INIT; h = TOK_HASH_FUNC(h, type); s = filename; while (*s) { h = TOK_HASH_FUNC(h, *s); s++; } h &= (CACHED_INCLUDES_HASH_SIZE - 1); return h; } /* XXX: use a token or a hash table to accelerate matching ? */ static CachedInclude *search_cached_include(TCCState *s1,
int type, const char *filename) { CachedInclude *e; int i, h; h = hash_cached_include(type, filename); i = s1->cached_includes_hash[h]; for(;;) { if (i == 0) break; e = s1->cached_includes[i - 1]; if (e->type == type && !strcmp(e->filename, filename)) return e; i = e->hash_next; } return NULL; } static inline void add_cached_include(TCCState *s1, int type, const char *filename, int ifndef_macro) { CachedInclude *e; int h; if (search_cached_include(s1, type, filename)) return; #ifdef INC_DEBUG printf("adding cached '%s' %s\n", filename, get_tok_str(ifndef_macro, NULL)); #endif e = tcc_malloc(sizeof(CachedInclude) + strlen(filename)); if (!e) return; e->type = type; strcpy(e->filename, filename); e->ifndef_macro = ifndef_macro; dynarray_add((void ***)&s1->cached_includes, &s1->nb_cached_includes, e); /* add in hash table */ h = hash_cached_include(type, filename); e->hash_next = s1->cached_includes_hash[h]; s1->cached_includes_hash[h] = s1->nb_cached_includes; } static void pragma_parse(TCCState *s1) { int val; next(); if (tok == TOK_pack) { /* This may be: #pragma pack(1) // set #pragma pack() // reset to default #pragma pack(push,1) // push & set #pragma pack(pop) // restore previous
*/ next(); skip('('); if (tok == TOK_ASM_pop) { next(); if (s1->pack_stack_ptr <= s1->pack_stack) { stk_error: error("out of pack stack"); } s1->pack_stack_ptr--; } else { val = 0; if (tok != ')') { if (tok == TOK_ASM_push) { next(); if (s1->pack_stack_ptr >= s1->pack_stack + PACK_STACK_SIZE - 1) goto stk_error; s1->pack_stack_ptr++; skip(','); } if (tok != TOK_CINT) { pack_error: error("invalid pack pragma"); } val = tokc.i; if (val < 1 || val > 16 || (val & (val - 1)) != 0) goto pack_error; next(); } *s1->pack_stack_ptr = val; skip(')'); } } } /* is_bof is true if first non space token at beginning of file */ static void preprocess(int is_bof) { TCCState *s1 = tcc_state; int size, i, c, n, saved_parse_flags; char buf[1024], *q, *p; char buf1[1024]; BufferedFile *f; Sym *s; CachedInclude *e; saved_parse_flags = parse_flags; parse_flags = PARSE_FLAG_PREPROCESS | PARSE_FLAG_TOK_NUM | PARSE_FLAG_LINEFEED; next_nomacro(); redo: switch(tok) { case TOK_DEFINE:
next_nomacro(); parse_define(); break; case TOK_UNDEF: next_nomacro(); s = define_find(tok); /* undefine symbol by putting an invalid name */ if (s) define_undef(s); break; case TOK_INCLUDE: case TOK_INCLUDE_NEXT: ch = file->buf_ptr[0]; /* XXX: incorrect if comments : use next_nomacro with a special mode */ skip_spaces(); if (ch == '<') { c = '>'; goto read_name; } else if (ch == '\"') { c = ch; read_name: /* XXX: better stray handling */ minp(); q = buf; while (ch != c && ch != '\n' && ch != CH_EOF) { if ((q - buf) < sizeof(buf) - 1) *q++ = ch; minp(); } *q = '\0'; minp(); #if 0 /* eat all spaces and comments after include */ /* XXX: slightly incorrect */ while (ch1 != '\n' && ch1 != CH_EOF) inp(); #endif } else { /* computed #include : either we have only strings or we have anything enclosed in '<>' */ next(); buf[0] = '\0'; if (tok == TOK_STR) { while (tok != TOK_LINEFEED) { if (tok != TOK_STR) { include_syntax: error("'#include' expects \"FILENAME\" or"); } pstrcat(buf, sizeof(buf), (char *)tokc.cstr->data); next(); } c = '\"'; } else {
int len; while (tok != TOK_LINEFEED) { pstrcat(buf, sizeof(buf), get_tok_str(tok, &tokc)); next(); } len = strlen(buf); /* check syntax and remove '<>' */ if (len < 2 || buf[0] != '<' || buf[len - 1] != '>') goto include_syntax; memmove(buf, buf + 1, len - 2); buf[len - 2] = '\0'; c = '>'; } } e = search_cached_include(s1, c, buf); if (e && define_find(e->ifndef_macro)) { /* no need to parse the include because the 'ifndef macro' is defined */ #ifdef INC_DEBUG printf("%s: skipping %s\n", file->filename, buf); #endif } else { if (c == '\"') { /* first search in current dir if "header.h" */ size = 0; p = strrchr(file->filename, '/'); if (p) size = p + 1 - file->filename; if (size > sizeof(buf1) - 1) size = sizeof(buf1) - 1; memcpy(buf1, file->filename, size); buf1[size] = '\0'; pstrcat(buf1, sizeof(buf1), buf); f = tcc_open(s1, buf1); if (f) { if (tok == TOK_INCLUDE_NEXT) tok = TOK_INCLUDE; else goto found; } } if (s1->include_stack_ptr >= s1->include_stack + INCLUDE_STACK_SIZE) error("#include recursion too deep"); /* now search in all the include paths */ n = s1->nb_include_paths + s1->nb_sysinclude_paths; for(i = 0; i < n; i++) { const char *path; if (i < s1->nb_include_paths) path = s1->include_paths[i]; else path = s1->sysinclude_paths[i - s1->nb_include_paths]; pstrcpy(buf1, sizeof(buf1), path);
pstrcat(buf1, sizeof(buf1), "/"); pstrcat(buf1, sizeof(buf1), buf); f = tcc_open(s1, buf1); if (f) { if (tok == TOK_INCLUDE_NEXT) tok = TOK_INCLUDE; else goto found; } } error("include file '%s' not found", buf); f = NULL; found: #ifdef INC_DEBUG printf("%s: including %s\n", file->filename, buf1); #endif f->inc_type = c; pstrcpy(f->inc_filename, sizeof(f->inc_filename), buf); /* push current file in stack */ /* XXX: fix current line init */ *s1->include_stack_ptr++ = file; file = f; /* add include file debug info */ if (do_debug) { put_stabs(file->filename, N_BINCL, 0, 0, 0); } tok_flags |= TOK_FLAG_BOF | TOK_FLAG_BOL; ch = file->buf_ptr[0]; goto the_end; } break; case TOK_IFNDEF: c = 1; goto do_ifdef; case TOK_IF: c = expr_preprocess(); goto do_if; case TOK_IFDEF: c = 0; do_ifdef: next_nomacro(); if (tok < TOK_IDENT) error("invalid argument for '#if%sdef'", c ? "n" : ""); if (is_bof) { if (c) { #ifdef INC_DEBUG printf("#ifndef %s\n", get_tok_str(tok, NULL)); #endif file->ifndef_macro = tok; } } c = (define_find(tok) != 0) ^ c; do_if:
if (s1->ifdef_stack_ptr >= s1->ifdef_stack + IFDEF_STACK_SIZE) error("memory full"); *s1->ifdef_stack_ptr++ = c; goto test_skip; case TOK_ELSE: if (s1->ifdef_stack_ptr == s1->ifdef_stack) error("#else without matching #if"); if (s1->ifdef_stack_ptr[-1] & 2) error("#else after #else"); c = (s1->ifdef_stack_ptr[-1] ^= 3); goto test_skip; case TOK_ELIF: if (s1->ifdef_stack_ptr == s1->ifdef_stack) error("#elif without matching #if"); c = s1->ifdef_stack_ptr[-1]; if (c > 1) error("#elif after #else"); /* last #if/#elif expression was true: we skip */ if (c == 1) goto skip; c = expr_preprocess(); s1->ifdef_stack_ptr[-1] = c; test_skip: if (!(c & 1)) { skip: preprocess_skip(); is_bof = 0; goto redo; } break; case TOK_ENDIF: if (s1->ifdef_stack_ptr <= file->ifdef_stack_ptr) error("#endif without matching #if"); s1->ifdef_stack_ptr--; /* '#ifndef macro' was at the start of file. Now we check if an '#endif' is exactly at the end of file */ if (file->ifndef_macro && s1->ifdef_stack_ptr == file->ifdef_stack_ptr) { file->ifndef_macro_saved = file->ifndef_macro; /* need to set to zero to avoid false matches if another #ifndef at middle of file */ file->ifndef_macro = 0; while (tok != TOK_LINEFEED) next_nomacro(); tok_flags |= TOK_FLAG_ENDIF; goto the_end; } break; case TOK_LINE: next(); if (tok != TOK_CINT) error("#line"); file->line_num = tokc.i - 1; /* the line number will be incremented after */
next(); if (tok != TOK_LINEFEED) { if (tok != TOK_STR) error("#line"); pstrcpy(file->filename, sizeof(file->filename), (char *)tokc.cstr->data); } break; case TOK_ERROR: case TOK_WARNING: c = tok; ch = file->buf_ptr[0]; skip_spaces(); q = buf; while (ch != '\n' && ch != CH_EOF) { if ((q - buf) < sizeof(buf) - 1) *q++ = ch; minp(); } *q = '\0'; if (c == TOK_ERROR) error("#error %s", buf); else warning("#warning %s", buf); break; case TOK_PRAGMA: pragma_parse(s1); break; default: if (tok == TOK_LINEFEED || tok == '!' || tok == TOK_CINT) { /* '!' is ignored to allow C scripts. numbers are ignored to emulate cpp behaviour */ } else { if (!(saved_parse_flags & PARSE_FLAG_ASM_COMMENTS)) error("invalid preprocessing directive #%s", get_tok_str(tok, &tokc)); } break; } /* ignore other preprocess commands or #! for C scripts */ while (tok != TOK_LINEFEED) next_nomacro(); the_end: parse_flags = saved_parse_flags; } /* evaluate escape codes in a string. */ static void parse_escape_string(CString *outstr, const uint8_t *buf, int is_long) { int c, n; const uint8_t *p; p = buf; for(;;) {
c = *p; if (c == '\0') break; if (c == '\\') { p++; /* escape */ c = *p; switch(c) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': /* at most three octal digits */ n = c - '0'; p++; c = *p; if (isoct(c)) { n = n * 8 + c - '0'; p++; c = *p; if (isoct(c)) { n = n * 8 + c - '0'; p++; } } c = n; goto add_char_nonext; case 'x': p++; n = 0; for(;;) { c = *p; if (c >= 'a' && c <= 'f') c = c - 'a' + 10; else if (c >= 'A' && c <= 'F') c = c - 'A' + 10; else if (isnum(c)) c = c - '0'; else break; n = n * 16 + c; p++; } c = n; goto add_char_nonext; case 'a': c = '\a'; break; case 'b': c = '\b'; break; case 'f': c = '\f'; break; case 'n':
c = '\n'; break; case 'r': c = '\r'; break; case 't': c = '\t'; break; case 'v': c = '\v'; break; case 'e': if (!gnu_ext) goto invalid_escape; c = 27; break; case '\'': case '\"': case '\\': case '?': break; default: invalid_escape: if (c >= '!' && c <= '~') warning("unknown escape sequence: \'\\%c\'", c); else warning("unknown escape sequence: \'\\x%x\'", c); break; } } p++; add_char_nonext: if (!is_long) cstr_ccat(outstr, c); else cstr_wccat(outstr, c); } /* add a trailing '\0' */ if (!is_long) cstr_ccat(outstr, '\0'); else cstr_wccat(outstr, '\0'); } /* we use 64 bit numbers */ #define BN_SIZE 2 /* bn = (bn << shift) | or_val */ void bn_lshift(unsigned int *bn, int shift, int or_val) { int i; unsigned int v; for(i=0;i
v = bn[i]; bn[i] = (v << shift) | or_val; or_val = v >> (32 - shift); } } void bn_zero(unsigned int *bn) { int i; for(i=0;i= 'a' && ch <= 'f') t = ch - 'a' + 10; else if (ch >= 'A' && ch <= 'F') t = ch - 'A' + 10; else if (isnum(ch)) t = ch - '0'; else
break; if (t >= b) break; if (q >= token_buf + STRING_MAX_SIZE) { num_too_long: error("number too long"); } *q++ = ch; ch = *p++; } if (ch == '.' || ((ch == 'e' || ch == 'E') && b == 10) || ((ch == 'p' || ch == 'P') && (b == 16 || b == 2))) { if (b != 10) { /* NOTE: strtox should support that for hexa numbers, but non ISOC99 libcs do not support it, so we prefer to do it by hand */ /* hexadecimal or binary floats */ /* XXX: handle overflows */ *q = '\0'; if (b == 16) shift = 4; else shift = 2; bn_zero(bn); q = token_buf; while (1) { t = *q++; if (t == '\0') { break; } else if (t >= 'a') { t = t - 'a' + 10; } else if (t >= 'A') { t = t - 'A' + 10; } else { t = t - '0'; } bn_lshift(bn, shift, t); } frac_bits = 0; if (ch == '.') { ch = *p++; while (1) { t = ch; if (t >= 'a' && t <= 'f') { t = t - 'a' + 10; } else if (t >= 'A' && t <= 'F') { t = t - 'A' + 10; } else if (t >= '0' && t <= '9') { t = t - '0'; } else { break; }
if (t >= b) error("invalid digit"); bn_lshift(bn, shift, t); frac_bits += shift; ch = *p++; } } if (ch != 'p' && ch != 'P') expect("exponent"); ch = *p++; s = 1; exp_val = 0; if (ch == '+') { ch = *p++; } else if (ch == '-') { s = -1; ch = *p++; } if (ch < '0' || ch > '9') expect("exponent digits"); while (ch >= '0' && ch <= '9') { exp_val = exp_val * 10 + ch - '0'; ch = *p++; } exp_val = exp_val * s; /* now we can generate the number */ /* XXX: should patch directly float number */ d = (double)bn[1] * 4294967296.0 + (double)bn[0]; d = ldexp(d, exp_val - frac_bits); t = toup(ch); if (t == 'F') { ch = *p++; tok = TOK_CFLOAT; /* float : should handle overflow */ tokc.f = (float)d; } else if (t == 'L') { ch = *p++; tok = TOK_CLDOUBLE; /* XXX: not large enough */ tokc.ld = (long double)d; } else { tok = TOK_CDOUBLE; tokc.d = d; } } else { /* decimal floats */ if (ch == '.') { if (q >= token_buf + STRING_MAX_SIZE) goto num_too_long; *q++ = ch; ch = *p++; float_frac_parse:
while (ch >= '0' && ch <= '9') { if (q >= token_buf + STRING_MAX_SIZE) goto num_too_long; *q++ = ch; ch = *p++; } } if (ch == 'e' || ch == 'E') { if (q >= token_buf + STRING_MAX_SIZE) goto num_too_long; *q++ = ch; ch = *p++; if (ch == '-' || ch == '+') { if (q >= token_buf + STRING_MAX_SIZE) goto num_too_long; *q++ = ch; ch = *p++; } if (ch < '0' || ch > '9') expect("exponent digits"); while (ch >= '0' && ch <= '9') { if (q >= token_buf + STRING_MAX_SIZE) goto num_too_long; *q++ = ch; ch = *p++; } } *q = '\0'; t = toup(ch); errno = 0; if (t == 'F') { ch = *p++; tok = TOK_CFLOAT; tokc.f = strtof(token_buf, NULL); } else if (t == 'L') { ch = *p++; tok = TOK_CLDOUBLE; tokc.ld = strtold(token_buf, NULL); } else { tok = TOK_CDOUBLE; tokc.d = strtod(token_buf, NULL); } } } else { unsigned long long n, n1; int lcount, ucount; /* integer number */ *q = '\0'; q = token_buf; if (b == 10 && *q == '0') { b = 8; q++;
} n = 0; while(1) { t = *q++; /* no need for checks except for base 10 / 8 errors */ if (t == '\0') { break; } else if (t >= 'a') { t = t - 'a' + 10; } else if (t >= 'A') { t = t - 'A' + 10; } else { t = t - '0'; if (t >= b) error("invalid digit"); } n1 = n; n = n * b + t; /* detect overflow */ /* XXX: this test is not reliable */ if (n < n1) error("integer constant overflow"); } /* XXX: not exactly ANSI compliant */ if ((n & 0xffffffff00000000LL) != 0) { if ((n >> 63) != 0) tok = TOK_CULLONG; else tok = TOK_CLLONG; } else if (n > 0x7fffffff) { tok = TOK_CUINT; } else { tok = TOK_CINT; } lcount = 0; ucount = 0; for(;;) { t = toup(ch); if (t == 'L') { if (lcount >= 2) error("three 'l's in integer constant"); lcount++; if (lcount == 2) { if (tok == TOK_CINT) tok = TOK_CLLONG; else if (tok == TOK_CUINT) tok = TOK_CULLONG; } ch = *p++; } else if (t == 'U') { if (ucount >= 1) error("two 'u's in integer constant");
ucount++; if (tok == TOK_CINT) tok = TOK_CUINT; else if (tok == TOK_CLLONG) tok = TOK_CULLONG; ch = *p++; } else { break; } } if (tok == TOK_CINT || tok == TOK_CUINT) tokc.ui = n; else tokc.ull = n; } } #define PARSE2(c1, tok1, c2, tok2) case c1: \ PEEKC(c, p); \ if (c == c2) { \ p++; \ tok = tok2; \ } else { \ tok = tok1; \ } \ break;
\
/* return next token without macro substitution */ static inline void next_nomacro1(void) { int t, c, is_long; TokenSym *ts; uint8_t *p, *p1; unsigned int h; p = file->buf_ptr; redo_no_start: c = *p; switch(c) { case ' ': case '\t': case '\f': case '\v': case '\r': p++; goto redo_no_start; case '\\': /* first look if it is in fact an end of buffer */ if (p >= file->buf_end) { file->buf_ptr = p;
handle_eob(); p = file->buf_ptr; if (p >= file->buf_end) goto parse_eof; else goto redo_no_start; } else { file->buf_ptr = p; ch = *p; handle_stray(); p = file->buf_ptr; goto redo_no_start; } parse_eof: { TCCState *s1 = tcc_state; if (parse_flags & PARSE_FLAG_LINEFEED) { tok = TOK_LINEFEED; } else if (s1->include_stack_ptr == s1->include_stack || !(parse_flags & PARSE_FLAG_PREPROCESS)) { /* no include left : end of file. */ tok = TOK_EOF; } else { /* pop include file */ /* test if previous '#endif' was after a #ifdef at start of file */ if (tok_flags & TOK_FLAG_ENDIF) { #ifdef INC_DEBUG printf("#endif %s\n", get_tok_str(file->ifndef_macro_saved, NULL)); #endif add_cached_include(s1, file->inc_type, file->inc_filename, file->ifndef_macro_saved); } /* add end of include file debug info */ if (do_debug) { put_stabd(N_EINCL, 0, 0); } /* pop include stack */ tcc_close(file); s1->include_stack_ptr--; file = *s1->include_stack_ptr; p = file->buf_ptr; goto redo_no_start; } } break; case '\n': if (parse_flags & PARSE_FLAG_LINEFEED) { tok = TOK_LINEFEED; } else {
file->line_num++; tok_flags |= TOK_FLAG_BOL; p++; goto redo_no_start; } break; case '#': /* XXX: simplify */ PEEKC(c, p); if ((tok_flags & TOK_FLAG_BOL) && (parse_flags & PARSE_FLAG_PREPROCESS)) { file->buf_ptr = p; preprocess(tok_flags & TOK_FLAG_BOF); p = file->buf_ptr; goto redo_no_start; } else { if (c == '#') { p++; tok = TOK_TWOSHARPS; } else { if (parse_flags & PARSE_FLAG_ASM_COMMENTS) { p = parse_line_comment(p - 1); goto redo_no_start; } else { tok = '#'; } } } break; case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': case 'g': case 'h': case 'i': case 'j': case 'k': case 'l': case 'm': case 'n': case 'o': case 'p': case 'q': case 'r': case 's': case 't': case 'u': case 'v': case 'w': case 'x': case 'y': case 'z': case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': case 'G': case 'H': case 'I': case 'J': case 'K': case 'M': case 'N': case 'O': case 'P': case 'Q': case 'R': case 'S': case 'T': case 'U': case 'V': case 'W': case 'X': case 'Y': case 'Z': case '_': parse_ident_fast: p1 = p; h = TOK_HASH_INIT; h = TOK_HASH_FUNC(h, c); p++; for(;;) { c = *p;
if (!isidnum_table[c]) break; h = TOK_HASH_FUNC(h, c); p++; } if (c != '\\') { TokenSym **pts; int len; /* fast case : no stray found, so we have the full token and we have already hashed it */ len = p - p1; h &= (TOK_HASH_SIZE - 1); pts = &hash_ident[h]; for(;;) { ts = *pts; if (!ts) break; if (ts->len == len && !memcmp(ts->str, p1, len)) goto token_found; pts = &(ts->hash_next); } ts = tok_alloc_new(pts, p1, len); token_found: ; } else { /* slower case */ cstr_reset(&tokcstr); while (p1 < p) { cstr_ccat(&tokcstr, *p1); p1++; } p--; PEEKC(c, p); parse_ident_slow: while (isidnum_table[c]) { cstr_ccat(&tokcstr, c); PEEKC(c, p); } ts = tok_alloc(tokcstr.data, tokcstr.size); } tok = ts->tok; break; case 'L': t = p[1]; if (t != '\\' && t != '\'' && t != '\"') { /* fast case */ goto parse_ident_fast; } else { PEEKC(c, p); if (c == '\'' || c == '\"') { is_long = 1; goto str_const;
} else { cstr_reset(&tokcstr); cstr_ccat(&tokcstr, 'L'); goto parse_ident_slow; } } break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': cstr_reset(&tokcstr); /* after the first digit, accept digits, alpha, '.' or sign if prefixed by 'eEpP' */ parse_num: for(;;) { t = c; cstr_ccat(&tokcstr, c); PEEKC(c, p); if (!(isnum(c) || isid(c) || c == '.' || ((c == '+' || c == '-') && (t == 'e' || t == 'E' || t == 'p' || t == 'P')))) break; } /* We add a trailing '\0' to ease parsing */ cstr_ccat(&tokcstr, '\0'); tokc.cstr = &tokcstr; tok = TOK_PPNUM; break; case '.': /* special dot handling because it can also start a number */ PEEKC(c, p); if (isnum(c)) { cstr_reset(&tokcstr); cstr_ccat(&tokcstr, '.'); goto parse_num; } else if (c == '.') { PEEKC(c, p); if (c != '.') expect("'.'"); PEEKC(c, p); tok = TOK_DOTS; } else { tok = '.'; } break; case '\'': case '\"': is_long = 0; str_const: { CString str; int sep;
sep = c; /* parse the string */ cstr_new(&str); p = parse_pp_string(p, sep, &str); cstr_ccat(&str, '\0'); /* eval the escape (should be done as TOK_PPNUM) */ cstr_reset(&tokcstr); parse_escape_string(&tokcstr, str.data, is_long); cstr_free(&str); if (sep == '\'') { int char_size; /* XXX: make it portable */ if (!is_long) char_size = 1; else char_size = sizeof(int); if (tokcstr.size <= char_size) error("empty character constant"); if (tokcstr.size > 2 * char_size) warning("multi-character character constant"); if (!is_long) { tokc.i = *(int8_t *)tokcstr.data; tok = TOK_CCHAR; } else { tokc.i = *(int *)tokcstr.data; tok = TOK_LCHAR; } } else { tokc.cstr = &tokcstr; if (!is_long) tok = TOK_STR; else tok = TOK_LSTR; } } break; case '<': PEEKC(c, p); if (c == '=') { p++; tok = TOK_LE; } else if (c == '<') { PEEKC(c, p); if (c == '=') { p++; tok = TOK_A_SHL; } else { tok = TOK_SHL;
} } else { tok = TOK_LT; } break; case '>': PEEKC(c, p); if (c == '=') { p++; tok = TOK_GE; } else if (c == '>') { PEEKC(c, p); if (c == '=') { p++; tok = TOK_A_SAR; } else { tok = TOK_SAR; } } else { tok = TOK_GT; } break; case '&': PEEKC(c, p); if (c == '&') { p++; tok = TOK_LAND; } else if (c == '=') { p++; tok = TOK_A_AND; } else { tok = '&'; } break; case '|': PEEKC(c, p); if (c == '|') { p++; tok = TOK_LOR; } else if (c == '=') { p++; tok = TOK_A_OR; } else { tok = '|'; } break; case '+': PEEKC(c, p); if (c == '+') {
p++; tok = TOK_INC; } else if (c == '=') { p++; tok = TOK_A_ADD; } else { tok = '+'; } break; case '-': PEEKC(c, p); if (c == '-') { p++; tok = TOK_DEC; } else if (c == '=') { p++; tok = TOK_A_SUB; } else if (c == '>') { p++; tok = TOK_ARROW; } else { tok = '-'; } break; PARSE2('!', '!', '=', TOK_NE) PARSE2('=', '=', '=', TOK_EQ) PARSE2('*', '*', '=', TOK_A_MUL) PARSE2('%', '%', '=', TOK_A_MOD) PARSE2('^', '^', '=', TOK_A_XOR) /* comments or operator */ case '/': PEEKC(c, p); if (c == '*') { p = parse_comment(p); goto redo_no_start; } else if (c == '/') { p = parse_line_comment(p); goto redo_no_start; } else if (c == '=') { p++; tok = TOK_A_DIV; } else { tok = '/'; } break; /* simple tokens */ case '(': case ')': case '[':
case ']': case '{': case '}': case ',': case ';': case ':': case '?': case '~': case '$': /* only used in assembler */ case '@': /* dito */ tok = c; p++; break; default: error("unrecognized character \\x%02x", c); break; } file->buf_ptr = p; tok_flags = 0; #if defined(PARSE_DEBUG) printf("token = %s\n", get_tok_str(tok, &tokc)); #endif } /* return next token without macro substitution. Can read input from macro_ptr buffer */ static void next_nomacro(void) { if (macro_ptr) { redo: tok = *macro_ptr; if (tok) { TOK_GET(tok, macro_ptr, tokc); if (tok == TOK_LINENUM) { file->line_num = tokc.i; goto redo; } } } else { next_nomacro1(); } } /* substitute args in macro_str and return allocated string */ static int *macro_arg_subst(Sym **nested_list, int *macro_str, Sym *args) { int *st, last_tok, t, notfirst; Sym *s; CValue cval; TokenString str; CString cstr; tok_str_new(&str);
last_tok = 0; while(1) { TOK_GET(t, macro_str, cval); if (!t) break; if (t == '#') { /* stringize */ TOK_GET(t, macro_str, cval); if (!t) break; s = sym_find2(args, t); if (s) { cstr_new(&cstr); st = (int *)s->c; notfirst = 0; while (*st) { if (notfirst) cstr_ccat(&cstr, ' '); TOK_GET(t, st, cval); cstr_cat(&cstr, get_tok_str(t, &cval)); notfirst = 1; } cstr_ccat(&cstr, '\0'); #ifdef PP_DEBUG printf("stringize: %s\n", (char *)cstr.data); #endif /* add string */ cval.cstr = &cstr; tok_str_add2(&str, TOK_STR, &cval); cstr_free(&cstr); } else { tok_str_add2(&str, t, &cval); } } else if (t >= TOK_IDENT) { s = sym_find2(args, t); if (s) { st = (int *)s->c; /* if '##' is present before or after, no arg substitution */ if (*macro_str == TOK_TWOSHARPS || last_tok == TOK_TWOSHARPS) { /* special case for var arg macros : ## eats the ',' if empty VA_ARGS variable. */ /* XXX: test of the ',' is not 100% reliable. should fix it to avoid security problems */ if (gnu_ext && s->type.t && last_tok == TOK_TWOSHARPS && str.len >= 2 && str.str[str.len - 2] == ',') { if (*st == 0) { /* suppress ',' '##' */ str.len -= 2; } else { /* suppress '##' and add variable */ str.len--;
goto add_var; } } else { int t1; add_var: for(;;) { TOK_GET(t1, st, cval); if (!t1) break; tok_str_add2(&str, t1, &cval); } } } else { /* NOTE: the stream cannot be read when macro substituing an argument */ macro_subst(&str, nested_list, st, NULL); } } else { tok_str_add(&str, t); } } else { tok_str_add2(&str, t, &cval); } last_tok = t; } tok_str_add(&str, 0); return str.str; } static char const ab_month_name[12][4] = { "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec" }; /* do macro substitution of current token with macro 's' and add result to (tok_str,tok_len). 'nested_list' is the list of all macros we got inside to avoid recursing. Return non zero if no substitution needs to be done */ static int macro_subst_tok(TokenString *tok_str, Sym **nested_list, Sym *s, struct macro_level **can_read_stream) { Sym *args, *sa, *sa1; int mstr_allocated, parlevel, *mstr, t, t1; TokenString str; char *cstrval; CValue cval; CString cstr; char buf[32]; /* if symbol is a macro, prepare substitution */ /* special macros */ if (tok == TOK___LINE__) {
snprintf(buf, sizeof(buf), "%d", file->line_num); cstrval = buf; t1 = TOK_PPNUM; goto add_cstr1; } else if (tok == TOK___FILE__) { cstrval = file->filename; goto add_cstr; } else if (tok == TOK___DATE__ || tok == TOK___TIME__) { time_t ti; struct tm *tm; time(&ti); tm = localtime(&ti); if (tok == TOK___DATE__) { snprintf(buf, sizeof(buf), "%s %2d %d", ab_month_name[tm->tm_mon], tm->tm_mday, tm->tm_year + 1900); } else { snprintf(buf, sizeof(buf), "%02d:%02d:%02d", tm->tm_hour, tm->tm_min, tm->tm_sec); } cstrval = buf; add_cstr: t1 = TOK_STR; add_cstr1: cstr_new(&cstr); cstr_cat(&cstr, cstrval); cstr_ccat(&cstr, '\0'); cval.cstr = &cstr; tok_str_add2(tok_str, t1, &cval); cstr_free(&cstr); } else { mstr = (int *)s->c; mstr_allocated = 0; if (s->type.t == MACRO_FUNC) { /* NOTE: we do not use next_nomacro to avoid eating the next token. XXX: find better solution */ redo: if (macro_ptr) { t = *macro_ptr; if (t == 0 && can_read_stream) { /* end of macro stream: we must look at the token after in the file */ struct macro_level *ml = *can_read_stream; macro_ptr = NULL; if (ml) { macro_ptr = ml->p; ml->p = NULL; *can_read_stream = ml -> prev; } goto redo; } } else {
/* XXX: incorrect with comments */ ch = file->buf_ptr[0]; while (is_space(ch) || ch == '\n') cinp(); t = ch; } if (t != '(') /* no macro subst */ return -1; /* argument macro */ next_nomacro(); next_nomacro(); args = NULL; sa = s->next; /* NOTE: empty args are allowed, except if no args */ for(;;) { /* handle '()' case */ if (!args && !sa && tok == ')') break; if (!sa) error("macro '%s' used with too many args", get_tok_str(s->v, 0)); tok_str_new(&str); parlevel = 0; /* NOTE: non zero sa->t indicates VA_ARGS */ while ((parlevel > 0 || (tok != ')' && (tok != ',' || sa->type.t))) && tok != -1) { if (tok == '(') parlevel++; else if (tok == ')') parlevel--; tok_str_add2(&str, tok, &tokc); next_nomacro(); } tok_str_add(&str, 0); sym_push2(&args, sa->v & ~SYM_FIELD, sa->type.t, (int)str.str); sa = sa->next; if (tok == ')') { /* special case for gcc var args: add an empty var arg argument if it is omitted */ if (sa && sa->type.t && gnu_ext) continue; else break; } if (tok != ',') expect(","); next_nomacro(); } if (sa) { error("macro '%s' used with too few args",
get_tok_str(s->v, 0)); } /* now subst each arg */ mstr = macro_arg_subst(nested_list, mstr, args); /* free memory */ sa = args; while (sa) { sa1 = sa->prev; tok_str_free((int *)sa->c); sym_free(sa); sa = sa1; } mstr_allocated = 1; } sym_push2(nested_list, s->v, 0, 0); macro_subst(tok_str, nested_list, mstr, can_read_stream); /* pop nested defined symbol */ sa1 = *nested_list; *nested_list = sa1->prev; sym_free(sa1); if (mstr_allocated) tok_str_free(mstr); } return 0; } /* handle the '##' operator. Return NULL if no '##' seen. Otherwise return the resulting string (which must be freed). */ static inline int *macro_twosharps(const int *macro_str) { TokenSym *ts; const int *macro_ptr1, *start_macro_ptr, *ptr, *saved_macro_ptr; int t; const char *p1, *p2; CValue cval; TokenString macro_str1; CString cstr; start_macro_ptr = macro_str; /* we search the first '##' */ for(;;) { macro_ptr1 = macro_str; TOK_GET(t, macro_str, cval); /* nothing more to do if end of string */ if (t == 0) return NULL; if (*macro_str == TOK_TWOSHARPS) break; } /* we saw '##', so we need more processing to handle it */ cstr_new(&cstr);
tok_str_new(¯o_str1); tok = t; tokc = cval; /* add all tokens seen so far */ for(ptr = start_macro_ptr; ptr < macro_ptr1;) { TOK_GET(t, ptr, cval); tok_str_add2(¯o_str1, t, &cval); } saved_macro_ptr = macro_ptr; /* XXX: get rid of the use of macro_ptr here */ macro_ptr = (int *)macro_str; for(;;) { while (*macro_ptr == TOK_TWOSHARPS) { macro_ptr++; macro_ptr1 = macro_ptr; t = *macro_ptr; if (t) { TOK_GET(t, macro_ptr, cval); /* We concatenate the two tokens if we have an identifier or a preprocessing number */ cstr_reset(&cstr); p1 = get_tok_str(tok, &tokc); cstr_cat(&cstr, p1); p2 = get_tok_str(t, &cval); cstr_cat(&cstr, p2); cstr_ccat(&cstr, '\0'); if ((tok >= TOK_IDENT || tok == TOK_PPNUM) && (t >= TOK_IDENT || t == TOK_PPNUM)) { if (tok == TOK_PPNUM) { /* if number, then create a number token */ /* NOTE: no need to allocate because tok_str_add2() does it */ tokc.cstr = &cstr; } else { /* if identifier, we must do a test to validate we have a correct identifier */ if (t == TOK_PPNUM) { const char *p; int c; p = p2; for(;;) { c = *p; if (c == '\0') break; p++; if (!isnum(c) && !isid(c)) goto error_pasting; } } ts = tok_alloc(cstr.data, strlen(cstr.data));
tok = ts->tok; /* modify current token */ } } else { const char *str = cstr.data; const unsigned char *q; /* we look for a valid token */ /* XXX: do more extensive checks */ if (!strcmp(str, ">>=")) { tok = TOK_A_SAR; } else if (!strcmp(str, "<<=")) { tok = TOK_A_SHL; } else if (strlen(str) == 2) { /* search in two bytes table */ q = tok_two_chars; for(;;) { if (!*q) goto error_pasting; if (q[0] == str[0] && q[1] == str[1]) break; q += 3; } tok = q[2]; } else { error_pasting: /* NOTE: because get_tok_str use a static buffer, we must save it */ cstr_reset(&cstr); p1 = get_tok_str(tok, &tokc); cstr_cat(&cstr, p1); cstr_ccat(&cstr, '\0'); p2 = get_tok_str(t, &cval); warning("pasting \"%s\" and \"%s\" does not give a valid preprocessing token", cstr.data, p2); /* cannot merge tokens: just add them separately */ tok_str_add2(¯o_str1, tok, &tokc); /* XXX: free associated memory ? */ tok = t; tokc = cval; } } } } tok_str_add2(¯o_str1, tok, &tokc); next_nomacro(); if (tok == 0) break; } macro_ptr = (int *)saved_macro_ptr; cstr_free(&cstr); tok_str_add(¯o_str1, 0); return macro_str1.str; }
/* do macro substitution of macro_str and add result to (tok_str,tok_len). 'nested_list' is the list of all macros we got inside to avoid recursing. */ static void macro_subst(TokenString *tok_str, Sym **nested_list, const int *macro_str, struct macro_level ** can_read_stream) { Sym *s; int *macro_str1; const int *ptr; int t, ret; CValue cval; struct macro_level ml; /* first scan for '##' operator handling */ ptr = macro_str; macro_str1 = macro_twosharps(ptr); if (macro_str1) ptr = macro_str1; while (1) { /* NOTE: ptr == NULL can only happen if tokens are read from file stream due to a macro function call */ if (ptr == NULL) break; TOK_GET(t, ptr, cval); if (t == 0) break; s = define_find(t); if (s != NULL) { /* if nested substitution, do nothing */ if (sym_find2(*nested_list, t)) goto no_subst; ml.p = macro_ptr; if (can_read_stream) ml.prev = *can_read_stream, *can_read_stream = &ml; macro_ptr = (int *)ptr; tok = t; ret = macro_subst_tok(tok_str, nested_list, s, can_read_stream); ptr = (int *)macro_ptr; macro_ptr = ml.p; if (can_read_stream && *can_read_stream == &ml) *can_read_stream = ml.prev; if (ret != 0) goto no_subst; } else { no_subst: tok_str_add2(tok_str, t, &cval); } } if (macro_str1) tok_str_free(macro_str1); }
/* return next token with macro substitution */ static void next(void) { Sym *nested_list, *s; TokenString str; struct macro_level *ml; redo: next_nomacro(); if (!macro_ptr) { /* if not reading from macro substituted string, then try to substitute macros */ if (tok >= TOK_IDENT && (parse_flags & PARSE_FLAG_PREPROCESS)) { s = define_find(tok); if (s) { /* we have a macro: we try to substitute */ tok_str_new(&str); nested_list = NULL; ml = NULL; if (macro_subst_tok(&str, &nested_list, s, &ml) == 0) { /* substitution done, NOTE: maybe empty */ tok_str_add(&str, 0); macro_ptr = str.str; macro_ptr_allocated = str.str; goto redo; } } } } else { if (tok == 0) { /* end of macro or end of unget buffer */ if (unget_buffer_enabled) { macro_ptr = unget_saved_macro_ptr; unget_buffer_enabled = 0; } else { /* end of macro string: free it */ tok_str_free(macro_ptr_allocated); macro_ptr = NULL; } goto redo; } } /* convert preprocessor tokens into C tokens */ if (tok == TOK_PPNUM && (parse_flags & PARSE_FLAG_TOK_NUM)) { parse_number((char *)tokc.cstr->data); } } /* push back current token and set current token to 'last_tok'. Only
identifier case handled for labels. */ static inline void unget_tok(int last_tok) { int i, n; int *q; unget_saved_macro_ptr = macro_ptr; unget_buffer_enabled = 1; q = unget_saved_buffer; macro_ptr = q; *q++ = tok; n = tok_ext_size(tok) - 1; for(i=0;i= vstack + (VSTACK_SIZE - 1)) error("memory full"); /* cannot let cpu flags if other instruction are generated. Also avoid leaving VT_JMP anywhere except on the top of the stack because it would complicate the code generator. */ if (vtop >= vstack) { v = vtop->r & VT_VALMASK; if (v == VT_CMP || (v & ~1) == VT_JMP) gv(RC_INT); } vtop++; vtop->type = *type; vtop->r = r; vtop->r2 = VT_CONST; vtop->c = *vc; } /* push integer constant */ void vpushi(int v) { CValue cval; cval.i = v; vsetc(&int_type, VT_CONST, &cval);
} /* Return a static symbol pointing to a section */ static Sym *get_sym_ref(CType *type, Section *sec, unsigned long offset, unsigned long size) { int v; Sym *sym; v = anon_sym++; sym = global_identifier_push(v, type->t | VT_STATIC, 0); sym->type.ref = type->ref; sym->r = VT_CONST | VT_SYM; put_extern_sym(sym, sec, offset, size); return sym; } /* push a reference to a section offset by adding a dummy symbol */ static void vpush_ref(CType *type, Section *sec, unsigned long offset, unsigned long size) { CValue cval; cval.ul = 0; vsetc(type, VT_CONST | VT_SYM, &cval); vtop->sym = get_sym_ref(type, sec, offset, size); } /* define a new external reference to a symbol 'v' of type 'u' */ static Sym *external_global_sym(int v, CType *type, int r) { Sym *s; s = sym_find(v); if (!s) { /* push forward reference */ s = global_identifier_push(v, type->t | VT_EXTERN, 0); s->type.ref = type->ref; s->r = r | VT_CONST | VT_SYM; } return s; } /* define a new external reference to a symbol 'v' of type 'u' */ static Sym *external_sym(int v, CType *type, int r) { Sym *s; s = sym_find(v); if (!s) { /* push forward reference */ s = sym_push(v, type, r | VT_CONST | VT_SYM, 0); s->type.t |= VT_EXTERN; } else {
if (!is_compatible_types(&s->type, type)) error("incompatible types for redefinition of '%s'", get_tok_str(v, NULL)); } return s; } /* push a reference to global symbol v */ static void vpush_global_sym(CType *type, int v) { Sym *sym; CValue cval; sym = external_global_sym(v, type, 0); cval.ul = 0; vsetc(type, VT_CONST | VT_SYM, &cval); vtop->sym = sym; } void vset(CType *type, int r, int v) { CValue cval; cval.i = v; vsetc(type, r, &cval); } void vseti(int r, int v) { CType type; type.t = VT_INT; vset(&type, r, v); } void vswap(void) { SValue tmp; tmp = vtop[0]; vtop[0] = vtop[-1]; vtop[-1] = tmp; } void vpushv(SValue *v) { if (vtop >= vstack + (VSTACK_SIZE - 1)) error("memory full"); vtop++; *vtop = *v; } void vdup(void) {
vpushv(vtop); } /* save r to the memory stack, and mark it as being free */ void save_reg(int r) { int l, saved, size, align; SValue *p, sv; CType *type; /* modify all stack values */ saved = 0; l = 0; for(p=vstack;p<=vtop;p++) { if ((p->r & VT_VALMASK) == r || (p->r2 & VT_VALMASK) == r) { /* must save value on stack if not already done */ if (!saved) { /* NOTE: must reload 'r' because r might be equal to r2 */ r = p->r & VT_VALMASK; /* store register in the stack */ type = &p->type; if ((p->r & VT_LVAL) || (!is_float(type->t) && (type->t & VT_BTYPE) != VT_LLONG)) type = &int_type; size = type_size(type, &align); loc = (loc - size) & -align; sv.type.t = type->t; sv.r = VT_LOCAL | VT_LVAL; sv.c.ul = loc; store(r, &sv); #ifdef TCC_TARGET_I386 /* x86 specific: need to pop fp register ST0 if saved */ if (r == TREG_ST0) { o(0xd9dd); /* fstp %st(1) */ } #endif /* special long long case */ if ((type->t & VT_BTYPE) == VT_LLONG) { sv.c.ul += 4; store(p->r2, &sv); } l = loc; saved = 1; } /* mark that stack entry as being saved on the stack */ if (p->r & VT_LVAL) { /* also clear the bounded flag because the relocation address of the function was stored in p->c.ul */ p->r = (p->r & ~(VT_VALMASK | VT_BOUNDED)) | VT_LLOCAL; } else { p->r = lvalue_type(p->type.t) | VT_LOCAL;
} p->r2 = VT_CONST; p->c.ul = l; } } } /* find a register of class 'rc2' with at most one reference on stack. * If none, call get_reg(rc) */ int get_reg_ex(int rc, int rc2) { int r; SValue *p; for(r=0;rr & VT_VALMASK) == r || (p->r2 & VT_VALMASK) == r) n++; } if (n <= 1) return r; } } return get_reg(rc); } /* find a free register of class 'rc'. If none, save one register */ int get_reg(int rc) { int r; SValue *p; /* find a free register */ for(r=0;rr & VT_VALMASK) == r || (p->r2 & VT_VALMASK) == r) goto notfound; } return r; } notfound: ; } /* no register left : free the first one on the stack (VERY IMPORTANT to start from the bottom to ensure that we don't spill registers used in gen_opi()) */ for(p=vstack;p<=vtop;p++) {
r = p->r & VT_VALMASK; if (r < VT_CONST && (reg_classes[r] & rc)) goto save_found; /* also look at second register (if long long) */ r = p->r2 & VT_VALMASK; if (r < VT_CONST && (reg_classes[r] & rc)) { save_found: save_reg(r); return r; } } /* Should never comes here */ return -1; } /* save registers up to (vtop - n) stack entry */ void save_regs(int n) { int r; SValue *p, *p1; p1 = vtop - n; for(p = vstack;p <= p1; p++) { r = p->r & VT_VALMASK; if (r < VT_CONST) { save_reg(r); } } } /* move register 's' to 'r', and flush previous value of r to memory if needed */ void move_reg(int r, int s) { SValue sv; if (r != s) { save_reg(r); sv.type.t = VT_INT; sv.r = s; sv.c.ul = 0; load(r, &sv); } } /* get address of vtop (vtop MUST BE an lvalue) */ void gaddrof(void) { vtop->r &= ~VT_LVAL; /* tricky: if saved lvalue, then we can go back to lvalue */ if ((vtop->r & VT_VALMASK) == VT_LLOCAL) vtop->r = (vtop->r & ~(VT_VALMASK | VT_LVAL_TYPE)) | VT_LOCAL | VT_LVAL; }
#ifdef CONFIG_TCC_BCHECK /* generate lvalue bound code */ void gbound(void) { int lval_type; CType type1; vtop->r &= ~VT_MUSTBOUND; /* if lvalue, then use checking code before dereferencing */ if (vtop->r & VT_LVAL) { /* if not VT_BOUNDED value, then make one */ if (!(vtop->r & VT_BOUNDED)) { lval_type = vtop->r & (VT_LVAL_TYPE | VT_LVAL); /* must save type because we must set it to int to get pointer */ type1 = vtop->type; vtop->type.t = VT_INT; gaddrof(); vpushi(0); gen_bounded_ptr_add(); vtop->r |= lval_type; vtop->type = type1; } /* then check for dereferencing */ gen_bounded_ptr_deref(); } } #endif /* store vtop a register belonging to class 'rc'. lvalues are converted to values. Cannot be used if cannot be converted to register value (such as structures). */ int gv(int rc) { int r, r2, rc2, bit_pos, bit_size, size, align, i; unsigned long long ll; /* NOTE: get_reg can modify vstack[] */ if (vtop->type.t & VT_BITFIELD) { bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f; bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f; /* remove bit field info to avoid loops */ vtop->type.t &= ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT)); /* generate shifts */ vpushi(32 - (bit_pos + bit_size)); gen_op(TOK_SHL); vpushi(32 - bit_size); /* NOTE: transformed to SHR if unsigned */ gen_op(TOK_SAR); r = gv(rc); } else { if (is_float(vtop->type.t) && (vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) { Sym *sym;
int *ptr; unsigned long offset; /* XXX: unify with initializers handling ? */ /* CPUs usually cannot use float constants, so we store them generically in data segment */ size = type_size(&vtop->type, &align); offset = (data_section->data_offset + align - 1) & -align; data_section->data_offset = offset; /* XXX: not portable yet */ ptr = section_ptr_add(data_section, size); size = size >> 2; for(i=0;i<size;i++) ptr[i] = vtop->c.tab[i]; sym = get_sym_ref(&vtop->type, data_section, offset, size << 2); vtop->r |= VT_LVAL | VT_SYM; vtop->sym = sym; vtop->c.ul = 0; } #ifdef CONFIG_TCC_BCHECK if (vtop->r & VT_MUSTBOUND) gbound(); #endif r = vtop->r & VT_VALMASK; /* need to reload if: - constant - lvalue (need to dereference pointer) - already a register, but not in the right class */ if (r >= VT_CONST || (vtop->r & VT_LVAL) || !(reg_classes[r] & rc) || ((vtop->type.t & VT_BTYPE) == VT_LLONG && !(reg_classes[vtop->r2] & rc))) { r = get_reg(rc); if ((vtop->type.t & VT_BTYPE) == VT_LLONG) { /* two register type load : expand to two words temporarily */ if ((vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) { /* load constant */ ll = vtop->c.ull; vtop->c.ui = ll; /* first word */ load(r, vtop); vtop->r = r; /* save register value */ vpushi(ll >> 32); /* second word */ } else if (r >= VT_CONST || /* XXX: test to VT_CONST incorrect ? */ (vtop->r & VT_LVAL)) { /* We do not want to modifier the long long pointer here, so the safest (and less efficient) is to save all the other registers in the stack. XXX: totally inefficient. */ save_regs(1); /* load from memory */
load(r, vtop); vdup(); vtop[-1].r = r; /* save register value */ /* increment pointer to get second word */ vtop->type.t = VT_INT; gaddrof(); vpushi(4); gen_op('+'); vtop->r |= VT_LVAL; } else { /* move registers */ load(r, vtop); vdup(); vtop[-1].r = r; /* save register value */ vtop->r = vtop[-1].r2; } /* allocate second register */ rc2 = RC_INT; if (rc == RC_IRET) rc2 = RC_LRET; r2 = get_reg(rc2); load(r2, vtop); vpop(); /* write second register */ vtop->r2 = r2; } else if ((vtop->r & VT_LVAL) && !is_float(vtop->type.t)) { int t1, t; /* lvalue of scalar type : need to use lvalue type because of possible cast */ t = vtop->type.t; t1 = t; /* compute memory access type */ if (vtop->r & VT_LVAL_BYTE) t = VT_BYTE; else if (vtop->r & VT_LVAL_SHORT) t = VT_SHORT; if (vtop->r & VT_LVAL_UNSIGNED) t |= VT_UNSIGNED; vtop->type.t = t; load(r, vtop); /* restore wanted type */ vtop->type.t = t1; } else { /* one register type load */ load(r, vtop); } } vtop->r = r; #ifdef TCC_TARGET_C67 /* uses register pairs for doubles */ if ((vtop->type.t & VT_BTYPE) == VT_DOUBLE) vtop->r2 = r+1; #endif
} return r; } /* generate vtop[-1] and vtop[0] in resp. classes rc1 and rc2 */ void gv2(int rc1, int rc2) { int v; /* generate more generic register first. But VT_JMP or VT_CMP values must be generated first in all cases to avoid possible reload errors */ v = vtop[0].r & VT_VALMASK; if (v != VT_CMP && (v & ~1) != VT_JMP && rc1 <= rc2) { vswap(); gv(rc1); vswap(); gv(rc2); /* test if reload is needed for first register */ if ((vtop[-1].r & VT_VALMASK) >= VT_CONST) { vswap(); gv(rc1); vswap(); } } else { gv(rc2); vswap(); gv(rc1); vswap(); /* test if reload is needed for first register */ if ((vtop[0].r & VT_VALMASK) >= VT_CONST) { gv(rc2); } } } /* expand long long on stack in two int registers */ void lexpand(void) { int u; u = vtop->type.t & VT_UNSIGNED; gv(RC_INT); vdup(); vtop[0].r = vtop[-1].r2; vtop[0].r2 = VT_CONST; vtop[-1].r2 = VT_CONST; vtop[0].type.t = VT_INT | u; vtop[-1].type.t = VT_INT | u; } #ifdef TCC_TARGET_ARM /* expand long long on stack */
void lexpand_nr(void) { int u,v; u = vtop->type.t & VT_UNSIGNED; vdup(); vtop->r2 = VT_CONST; vtop->type.t = VT_INT | u; v=vtop[-1].r & (VT_VALMASK | VT_LVAL); if (v == VT_CONST) { vtop[-1].c.ui = vtop->c.ull; vtop->c.ui = vtop->c.ull >> 32; vtop->r = VT_CONST; } else if (v == (VT_LVAL|VT_CONST) || v == (VT_LVAL|VT_LOCAL)) { vtop->c.ui += 4; vtop->r = vtop[-1].r; } else if (v > VT_CONST) { vtop--; lexpand(); } else vtop->r = vtop[-1].r2; vtop[-1].r2 = VT_CONST; vtop[-1].type.t = VT_INT | u; } #endif /* build a long long from two ints */ void lbuild(int t) { gv2(RC_INT, RC_INT); vtop[-1].r2 = vtop[0].r; vtop[-1].type.t = t; vpop(); } /* rotate n first stack elements to the bottom I1 ... In -> I2 ... In I1 [top is right] */ void vrotb(int n) { int i; SValue tmp; tmp = vtop[-n + 1]; for(i=-n+1;i!=0;i++) vtop[i] = vtop[i+1]; vtop[0] = tmp; } /* rotate n first stack elements to the top I1 ... In -> In I1 ... I(n-1) [top is right] */ void vrott(int n)
{ int i; SValue tmp; tmp = vtop[0]; for(i = 0;i < n - 1; i++) vtop[-i] = vtop[-i - 1]; vtop[-n + 1] = tmp; } #ifdef TCC_TARGET_ARM /* like vrott but in other direction In ... I1 -> I(n-1) ... I1 In [top is right] */ void vnrott(int n) { int i; SValue tmp; tmp = vtop[-n + 1]; for(i = n - 1; i > 0; i--) vtop[-i] = vtop[-i + 1]; vtop[0] = tmp; } #endif /* pop stack value */ void vpop(void) { int v; v = vtop->r & VT_VALMASK; #ifdef TCC_TARGET_I386 /* for x86, we need to pop the FP stack */ if (v == TREG_ST0 && !nocode_wanted) { o(0xd9dd); /* fstp %st(1) */ } else #endif if (v == VT_JMP || v == VT_JMPI) { /* need to put correct jump if && or || without test */ gsym(vtop->c.ul); } vtop--; } /* convert stack entry to register and duplicate its value in another register */ void gv_dup(void) { int rc, t, r, r1; SValue sv; t = vtop->type.t; if ((t & VT_BTYPE) == VT_LLONG) {
lexpand(); gv_dup(); vswap(); vrotb(3); gv_dup(); vrotb(4); /* stack: H L L1 H1 */ lbuild(t); vrotb(3); vrotb(3); vswap(); lbuild(t); vswap(); } else { /* duplicate value */ rc = RC_INT; sv.type.t = VT_INT; if (is_float(t)) { rc = RC_FLOAT; sv.type.t = t; } r = gv(rc); r1 = get_reg(rc); sv.r = r; sv.c.ul = 0; load(r1, &sv); /* move r to r1 */ vdup(); /* duplicates value */ vtop->r = r1; } } /* generate CPU independent (unsigned) long long operations */ void gen_opl(int op) { int t, a, b, op1, c, i; int func; SValue tmp; switch(op) { case '/': case TOK_PDIV: func = TOK___divdi3; goto gen_func; case TOK_UDIV: func = TOK___udivdi3; goto gen_func; case '%': func = TOK___moddi3; goto gen_func; case TOK_UMOD: func = TOK___umoddi3; gen_func:
/* call generic long long function */ vpush_global_sym(&func_old_type, func); vrott(3); gfunc_call(2); vpushi(0); vtop->r = REG_IRET; vtop->r2 = REG_LRET; break; case '^': case '&': case '|': case '*': case '+': case '-': t = vtop->type.t; vswap(); lexpand(); vrotb(3); lexpand(); /* stack: L1 H1 L2 H2 */ tmp = vtop[0]; vtop[0] = vtop[-3]; vtop[-3] = tmp; tmp = vtop[-2]; vtop[-2] = vtop[-3]; vtop[-3] = tmp; vswap(); /* stack: H1 H2 L1 L2 */ if (op == '*') { vpushv(vtop - 1); vpushv(vtop - 1); gen_op(TOK_UMULL); lexpand(); /* stack: H1 H2 L1 L2 ML MH */ for(i=0;i<4;i++) vrotb(6); /* stack: ML MH H1 H2 L1 L2 */ tmp = vtop[0]; vtop[0] = vtop[-2]; vtop[-2] = tmp; /* stack: ML MH H1 L2 H2 L1 */ gen_op('*'); vrotb(3); vrotb(3); gen_op('*'); /* stack: ML MH M1 M2 */ gen_op('+'); gen_op('+'); } else if (op == '+' || op == '-') { /* XXX: add non carry method too (for MIPS or alpha) */ if (op == '+') op1 = TOK_ADDC1; else
op1 = TOK_SUBC1; gen_op(op1); /* stack: H1 H2 (L1 op L2) */ vrotb(3); vrotb(3); gen_op(op1 + 1); /* TOK_xxxC2 */ } else { gen_op(op); /* stack: H1 H2 (L1 op L2) */ vrotb(3); vrotb(3); /* stack: (L1 op L2) H1 H2 */ gen_op(op); /* stack: (L1 op L2) (H1 op H2) */ } /* stack: L H */ lbuild(t); break; case TOK_SAR: case TOK_SHR: case TOK_SHL: if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) { t = vtop[-1].type.t; vswap(); lexpand(); vrotb(3); /* stack: L H shift */ c = (int)vtop->c.i; /* constant: simpler */ /* NOTE: all comments are for SHL. the other cases are done by swaping words */ vpop(); if (op != TOK_SHL) vswap(); if (c >= 32) { /* stack: L H */ vpop(); if (c > 32) { vpushi(c - 32); gen_op(op); } if (op != TOK_SAR) { vpushi(0); } else { gv_dup(); vpushi(31); gen_op(TOK_SAR); } vswap(); } else { vswap(); gv_dup(); /* stack: H L L */
vpushi(c); gen_op(op); vswap(); vpushi(32 - c); if (op == TOK_SHL) gen_op(TOK_SHR); else gen_op(TOK_SHL); vrotb(3); /* stack: L L H */ vpushi(c); if (op == TOK_SHL) gen_op(TOK_SHL); else gen_op(TOK_SHR); gen_op('|'); } if (op != TOK_SHL) vswap(); lbuild(t); } else { /* XXX: should provide a faster fallback on x86 ? */ switch(op) { case TOK_SAR: func = TOK___sardi3; goto gen_func; case TOK_SHR: func = TOK___shrdi3; goto gen_func; case TOK_SHL: func = TOK___shldi3; goto gen_func; } } break; default: /* compare operations */ t = vtop->type.t; vswap(); lexpand(); vrotb(3); lexpand(); /* stack: L1 H1 L2 H2 */ tmp = vtop[-1]; vtop[-1] = vtop[-2]; vtop[-2] = tmp; /* stack: L1 L2 H1 H2 */ /* compare high */ op1 = op; /* when values are equal, we need to compare low words. since the jump is inverted, we invert the test too. */ if (op1 == TOK_LT) op1 = TOK_LE;
else if (op1 == TOK_GT) op1 = TOK_GE; else if (op1 == TOK_ULT) op1 = TOK_ULE; else if (op1 == TOK_UGT) op1 = TOK_UGE; a = 0; b = 0; gen_op(op1); if (op1 != TOK_NE) { a = gtst(1, 0); } if (op != TOK_EQ) { /* generate non equal test */ /* XXX: NOT PORTABLE yet */ if (a == 0) { b = gtst(0, 0); } else { #if defined(TCC_TARGET_I386) b = psym(0x850f, 0); #elif defined(TCC_TARGET_ARM) b = ind; o(0x1A000000 | encbranch(ind, 0, 1)); #elif defined(TCC_TARGET_C67) error("not implemented"); #else #error not supported #endif } } /* compare low. Always unsigned */ op1 = op; if (op1 == TOK_LT) op1 = TOK_ULT; else if (op1 == TOK_LE) op1 = TOK_ULE; else if (op1 == TOK_GT) op1 = TOK_UGT; else if (op1 == TOK_GE) op1 = TOK_UGE; gen_op(op1); a = gtst(1, a); gsym(b); vseti(VT_JMPI, a); break; } } /* handle integer constant optimizations and various machine independent opt */ void gen_opic(int op) { int fc, c1, c2, n;
SValue *v1, *v2; v1 = vtop - 1; v2 = vtop; /* currently, we cannot do computations with forward symbols */ c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST; c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST; if (c1 && c2) { fc = v2->c.i; switch(op) { case '+': v1->c.i += fc; break; case '-': v1->c.i -= fc; break; case '&': v1->c.i &= fc; break; case '^': v1->c.i ^= fc; break; case '|': v1->c.i |= fc; break; case '*': v1->c.i *= fc; break; case TOK_PDIV: case '/': case '%': case TOK_UDIV: case TOK_UMOD: /* if division by zero, generate explicit division */ if (fc == 0) { if (const_wanted) error("division by zero in constant"); goto general_case; } switch(op) { default: v1->c.i /= fc; break; case '%': v1->c.i %= fc; break; case TOK_UDIV: v1->c.i = (unsigned)v1->c.i / fc; break; case TOK_UMOD: v1->c.i = (unsigned)v1->c.i % fc; break; } break; case TOK_SHL: v1->c.i <<= fc; break; case TOK_SHR: v1->c.i = (unsigned)v1->c.i >> fc; break; case TOK_SAR: v1->c.i >>= fc; break; /* tests */ case TOK_ULT: v1->c.i = (unsigned)v1->c.i < (unsigned)fc; break; case TOK_UGE: v1->c.i = (unsigned)v1->c.i >= (unsigned)fc; break; case TOK_EQ: v1->c.i = v1->c.i == fc; break; case TOK_NE: v1->c.i = v1->c.i != fc; break; case TOK_ULE: v1->c.i = (unsigned)v1->c.i <= (unsigned)fc; break; case TOK_UGT: v1->c.i = (unsigned)v1->c.i > (unsigned)fc; break; case TOK_LT: v1->c.i = v1->c.i < fc; break; case TOK_GE: v1->c.i = v1->c.i >= fc; break; case TOK_LE: v1->c.i = v1->c.i <= fc; break; case TOK_GT: v1->c.i = v1->c.i > fc; break; /* logical */ case TOK_LAND: v1->c.i = v1->c.i && fc; break; case TOK_LOR: v1->c.i = v1->c.i || fc; break; default:
goto general_case; } vtop--; } else { /* if commutative ops, put c2 as constant */ if (c1 && (op == '+' || op == '&' || op == '^' || op == '|' || op == '*')) { vswap(); swap(&c1, &c2); } fc = vtop->c.i; if (c2 && (((op == '*' || op == '/' || op == TOK_UDIV || op == TOK_PDIV) && fc == 1) || ((op == '+' || op == '-' || op == '|' || op == '^' || op == TOK_SHL || op == TOK_SHR || op == TOK_SAR) && fc == 0) || (op == '&' && fc == -1))) { /* nothing to do */ vtop--; } else if (c2 && (op == '*' || op == TOK_PDIV || op == TOK_UDIV)) { /* try to use shifts instead of muls or divs */ if (fc > 0 && (fc & (fc - 1)) == 0) { n = -1; while (fc) { fc >>= 1; n++; } vtop->c.i = n; if (op == '*') op = TOK_SHL; else if (op == TOK_PDIV) op = TOK_SAR; else op = TOK_SHR; } goto general_case; } else if (c2 && (op == '+' || op == '-') && (vtop[-1].r & (VT_VALMASK | VT_LVAL | VT_SYM)) == (VT_CONST | VT_SYM)) { /* symbol + constant case */ if (op == '-') fc = -fc; vtop--; vtop->c.i += fc; } else { general_case: if (!nocode_wanted) { /* call low level op generator */ gen_opi(op); } else { vtop--;
} } } } /* generate a floating point operation with constant propagation */ void gen_opif(int op) { int c1, c2; SValue *v1, *v2; long double f1, f2; v1 = vtop - 1; v2 = vtop; /* currently, we cannot do computations with forward symbols */ c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST; c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST; if (c1 && c2) { if (v1->type.t == VT_FLOAT) { f1 = v1->c.f; f2 = v2->c.f; } else if (v1->type.t == VT_DOUBLE) { f1 = v1->c.d; f2 = v2->c.d; } else { f1 = v1->c.ld; f2 = v2->c.ld; } /* NOTE: we only do constant propagation if finite number (not NaN or infinity) (ANSI spec) */ if (!ieee_finite(f1) || !ieee_finite(f2)) goto general_case; switch(op) { case '+': f1 += f2; break; case '-': f1 -= f2; break; case '*': f1 *= f2; break; case '/': if (f2 == 0.0) { if (const_wanted) error("division by zero in constant"); goto general_case; } f1 /= f2; break; /* XXX: also handles tests ? */ default: goto general_case; } /* XXX: overflow test ? */ if (v1->type.t == VT_FLOAT) { v1->c.f = f1;
} else if (v1->type.t == VT_DOUBLE) { v1->c.d = f1; } else { v1->c.ld = f1; } vtop--; } else { general_case: if (!nocode_wanted) { gen_opf(op); } else { vtop--; } } } static int pointed_size(CType *type) { int align; return type_size(pointed_type(type), &align); } static inline int is_null_pointer(SValue *p) { if ((p->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST) return 0; return ((p->type.t & VT_BTYPE) == VT_INT && p->c.i == 0) || ((p->type.t & VT_BTYPE) == VT_LLONG && p->c.ll == 0); } static inline int is_integer_btype(int bt) { return (bt == VT_BYTE || bt == VT_SHORT || bt == VT_INT || bt == VT_LLONG); } /* check types for comparison or substraction of pointers */ static void check_comparison_pointer_types(SValue *p1, SValue *p2, int op) { CType *type1, *type2, tmp_type1, tmp_type2; int bt1, bt2; /* null pointers are accepted for all comparisons as gcc */ if (is_null_pointer(p1) || is_null_pointer(p2)) return; type1 = &p1->type; type2 = &p2->type; bt1 = type1->t & VT_BTYPE; bt2 = type2->t & VT_BTYPE; /* accept comparison between pointer and integer with a warning */ if ((is_integer_btype(bt1) || is_integer_btype(bt2)) && op != '-') { warning("comparison between pointer and integer"); return;
} /* both must be pointers or implicit function pointers */ if (bt1 == VT_PTR) { type1 = pointed_type(type1); } else if (bt1 != VT_FUNC) goto invalid_operands; if (bt2 == VT_PTR) { type2 = pointed_type(type2); } else if (bt2 != VT_FUNC) { invalid_operands: error("invalid operands to binary %s", get_tok_str(op, NULL)); } if ((type1->t & VT_BTYPE) == VT_VOID || (type2->t & VT_BTYPE) == VT_VOID) return; tmp_type1 = *type1; tmp_type2 = *type2; tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE); tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE); if (!is_compatible_types(&tmp_type1, &tmp_type2)) { /* gcc-like error if '-' is used */ if (op == '-') goto invalid_operands; else warning("comparison of distinct pointer types lacks a cast"); } } /* generic gen_op: handles types problems */ void gen_op(int op) { int u, t1, t2, bt1, bt2, t; CType type1; t1 = vtop[-1].type.t; t2 = vtop[0].type.t; bt1 = t1 & VT_BTYPE; bt2 = t2 & VT_BTYPE; if (bt1 == VT_PTR || bt2 == VT_PTR) { /* at least one operand is a pointer */ /* relationnal op: must be both pointers */ if (op >= TOK_ULT && op <= TOK_GT) { check_comparison_pointer_types(vtop - 1, vtop, op); /* pointers are handled are unsigned */ t = VT_INT | VT_UNSIGNED; goto std_op; } /* if both pointers, then it must be the '-' op */ if (bt1 == VT_PTR && bt2 == VT_PTR) { if (op != '-')
error("cannot use pointers here"); check_comparison_pointer_types(vtop - 1, vtop, op); /* XXX: check that types are compatible */ u = pointed_size(&vtop[-1].type); gen_opic(op); /* set to integer type */ vtop->type.t = VT_INT; vpushi(u); gen_op(TOK_PDIV); } else { /* exactly one pointer : must be '+' or '-'. */ if (op != '-' && op != '+') error("cannot use pointers here"); /* Put pointer as first operand */ if (bt2 == VT_PTR) { vswap(); swap(&t1, &t2); } type1 = vtop[-1].type; /* XXX: cast to int ? (long long case) */ vpushi(pointed_size(&vtop[-1].type)); gen_op('*'); #ifdef CONFIG_TCC_BCHECK /* if evaluating constant expression, no code should be generated, so no bound check */ if (do_bounds_check && !const_wanted) { /* if bounded pointers, we generate a special code to test bounds */ if (op == '-') { vpushi(0); vswap(); gen_op('-'); } gen_bounded_ptr_add(); } else #endif { gen_opic(op); } /* put again type if gen_opic() swaped operands */ vtop->type = type1; } } else if (is_float(bt1) || is_float(bt2)) { /* compute bigger type and do implicit casts */ if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) { t = VT_LDOUBLE; } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) { t = VT_DOUBLE; } else { t = VT_FLOAT; } /* floats can only be used for a few operations */ if (op != '+' && op != '-' && op != '*' && op != '/' &&
(op < TOK_ULT || op > TOK_GT)) error("invalid operands for binary operation"); goto std_op; } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) { /* cast to biggest op */ t = VT_LLONG; /* convert to unsigned if it does not fit in a long long */ if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) || (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED)) t |= VT_UNSIGNED; goto std_op; } else { /* integer operations */ t = VT_INT; /* convert to unsigned if it does not fit in an integer */ if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) || (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED)) t |= VT_UNSIGNED; std_op: /* XXX: currently, some unsigned operations are explicit, so we modify them here */ if (t & VT_UNSIGNED) { if (op == TOK_SAR) op = TOK_SHR; else if (op == '/') op = TOK_UDIV; else if (op == '%') op = TOK_UMOD; else if (op == TOK_LT) op = TOK_ULT; else if (op == TOK_GT) op = TOK_UGT; else if (op == TOK_LE) op = TOK_ULE; else if (op == TOK_GE) op = TOK_UGE; } vswap(); type1.t = t; gen_cast(&type1); vswap(); /* special case for shifts and long long: we keep the shift as an integer */ if (op == TOK_SHR || op == TOK_SAR || op == TOK_SHL) type1.t = VT_INT; gen_cast(&type1); if (is_float(t)) gen_opif(op); else if ((t & VT_BTYPE) == VT_LLONG) gen_opl(op); else gen_opic(op); if (op >= TOK_ULT && op <= TOK_GT) {
/* relationnal op: the result is an int */ vtop->type.t = VT_INT; } else { vtop->type.t = t; } } } /* generic itof for unsigned long long case */ void gen_cvt_itof1(int t) { if ((vtop->type.t & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED)) { if (t == VT_FLOAT) vpush_global_sym(&func_old_type, TOK___ulltof); else if (t == VT_DOUBLE) vpush_global_sym(&func_old_type, TOK___ulltod); else vpush_global_sym(&func_old_type, TOK___ulltold); vrott(2); gfunc_call(1); vpushi(0); vtop->r = REG_FRET; } else { gen_cvt_itof(t); } } /* generic ftoi for unsigned long long case */ void gen_cvt_ftoi1(int t) { int st; if (t == (VT_LLONG | VT_UNSIGNED)) { /* not handled natively */ st = vtop->type.t & VT_BTYPE; if (st == VT_FLOAT) vpush_global_sym(&func_old_type, TOK___fixunssfdi); else if (st == VT_DOUBLE) vpush_global_sym(&func_old_type, TOK___fixunsdfdi); else vpush_global_sym(&func_old_type, TOK___fixunsxfdi); vrott(2); gfunc_call(1); vpushi(0); vtop->r = REG_IRET; vtop->r2 = REG_LRET; } else { gen_cvt_ftoi(t); } }
/* force char or short cast */ void force_charshort_cast(int t) { int bits, dbt; dbt = t & VT_BTYPE; /* XXX: add optimization if lvalue : just change type and offset */ if (dbt == VT_BYTE) bits = 8; else bits = 16; if (t & VT_UNSIGNED) { vpushi((1 << bits) - 1); gen_op('&'); } else { bits = 32 - bits; vpushi(bits); gen_op(TOK_SHL); vpushi(bits); gen_op(TOK_SAR); } } /* cast 'vtop' to 'type'. Casting to bitfields is forbidden. */ static void gen_cast(CType *type) { int sbt, dbt, sf, df, c; /* special delayed cast for char/short */ /* XXX: in some cases (multiple cascaded casts), it may still be incorrect */ if (vtop->r & VT_MUSTCAST) { vtop->r &= ~VT_MUSTCAST; force_charshort_cast(vtop->type.t); } /* bitfields first get cast to ints */ if (vtop->type.t & VT_BITFIELD) { gv(RC_INT); } dbt = type->t & (VT_BTYPE | VT_UNSIGNED); sbt = vtop->type.t & (VT_BTYPE | VT_UNSIGNED); if (sbt != dbt && !nocode_wanted) { sf = is_float(sbt); df = is_float(dbt); c = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST; if (sf && df) { /* convert from fp to fp */ if (c) { /* constant case: we can do it now */ /* XXX: in ISOC, cannot do it if error in convert */ if (dbt == VT_FLOAT && sbt == VT_DOUBLE)
vtop->c.f = (float)vtop->c.d; else if (dbt == VT_FLOAT && sbt == VT_LDOUBLE) vtop->c.f = (float)vtop->c.ld; else if (dbt == VT_DOUBLE && sbt == VT_FLOAT) vtop->c.d = (double)vtop->c.f; else if (dbt == VT_DOUBLE && sbt == VT_LDOUBLE) vtop->c.d = (double)vtop->c.ld; else if (dbt == VT_LDOUBLE && sbt == VT_FLOAT) vtop->c.ld = (long double)vtop->c.f; else if (dbt == VT_LDOUBLE && sbt == VT_DOUBLE) vtop->c.ld = (long double)vtop->c.d; } else { /* non constant case: generate code */ gen_cvt_ftof(dbt); } } else if (df) { /* convert int to fp */ if (c) { switch(sbt) { case VT_LLONG | VT_UNSIGNED: case VT_LLONG: /* XXX: add const cases for long long */ goto do_itof; case VT_INT | VT_UNSIGNED: switch(dbt) { case VT_FLOAT: vtop->c.f = (float)vtop->c.ui; break; case VT_DOUBLE: vtop->c.d = (double)vtop->c.ui; break; case VT_LDOUBLE: vtop->c.ld = (long double)vtop->c.ui; break; } break; default: switch(dbt) { case VT_FLOAT: vtop->c.f = (float)vtop->c.i; break; case VT_DOUBLE: vtop->c.d = (double)vtop->c.i; break; case VT_LDOUBLE: vtop->c.ld = (long double)vtop->c.i; break; } break; } } else { do_itof: #if !defined(TCC_TARGET_ARM) gen_cvt_itof1(dbt); #else gen_cvt_itof(dbt); #endif } } else if (sf) { /* convert fp to int */ /* we handle char/short/etc... with generic code */ if (dbt != (VT_INT | VT_UNSIGNED) && dbt != (VT_LLONG | VT_UNSIGNED) && dbt != VT_LLONG) dbt = VT_INT;
if (c) { switch(dbt) { case VT_LLONG | VT_UNSIGNED: case VT_LLONG: /* XXX: add const cases for long long */ goto do_ftoi; case VT_INT | VT_UNSIGNED: switch(sbt) { case VT_FLOAT: vtop->c.ui = (unsigned int)vtop->c.d; break; case VT_DOUBLE: vtop->c.ui = (unsigned int)vtop->c.d; break; case VT_LDOUBLE: vtop->c.ui = (unsigned int)vtop->c.d; break; } break; default: /* int case */ switch(sbt) { case VT_FLOAT: vtop->c.i = (int)vtop->c.d; break; case VT_DOUBLE: vtop->c.i = (int)vtop->c.d; break; case VT_LDOUBLE: vtop->c.i = (int)vtop->c.d; break; } break; } } else { do_ftoi: gen_cvt_ftoi1(dbt); } if (dbt == VT_INT && (type->t & (VT_BTYPE | VT_UNSIGNED)) != dbt) { /* additional cast for char/short/bool... */ vtop->type.t = dbt; gen_cast(type); } } else if ((dbt & VT_BTYPE) == VT_LLONG) { if ((sbt & VT_BTYPE) != VT_LLONG) { /* scalar to long long */ if (c) { if (sbt == (VT_INT | VT_UNSIGNED)) vtop->c.ll = vtop->c.ui; else vtop->c.ll = vtop->c.i; } else { /* machine independent conversion */ gv(RC_INT); /* generate high word */ if (sbt == (VT_INT | VT_UNSIGNED)) { vpushi(0); gv(RC_INT); } else { gv_dup(); vpushi(31); gen_op(TOK_SAR); } /* patch second register */ vtop[-1].r2 = vtop->r;
vpop(); } } } else if (dbt == VT_BOOL) { /* scalar to bool */ vpushi(0); gen_op(TOK_NE); } else if ((dbt & VT_BTYPE) == VT_BYTE || (dbt & VT_BTYPE) == VT_SHORT) { force_charshort_cast(dbt); } else if ((dbt & VT_BTYPE) == VT_INT) { /* scalar to int */ if (sbt == VT_LLONG) { /* from long long: just take low order word */ lexpand(); vpop(); } /* if lvalue and single word type, nothing to do because the lvalue already contains the real type size (see VT_LVAL_xxx constants) */ } } vtop->type = *type; } /* return type size. Put alignment at 'a' */ static int type_size(CType *type, int *a) { Sym *s; int bt; bt = type->t & VT_BTYPE; if (bt == VT_STRUCT) { /* struct/union */ s = type->ref; *a = s->r; return s->c; } else if (bt == VT_PTR) { if (type->t & VT_ARRAY) { s = type->ref; return type_size(&s->type, a) * s->c; } else { *a = PTR_SIZE; return PTR_SIZE; } } else if (bt == VT_LDOUBLE) { *a = LDOUBLE_ALIGN; return LDOUBLE_SIZE; } else if (bt == VT_DOUBLE || bt == VT_LLONG) { #ifdef TCC_TARGET_I386 *a = 4; #else *a = 8;
#endif return 8; } else if (bt == VT_INT || bt == VT_ENUM || bt == VT_FLOAT) { *a = 4; return 4; } else if (bt == VT_SHORT) { *a = 2; return 2; } else { /* char, void, function, _Bool */ *a = 1; return 1; } } /* return the pointed type of t */ static inline CType *pointed_type(CType *type) { return &type->ref->type; } /* modify type so that its it is a pointer to type. */ static void mk_pointer(CType *type) { Sym *s; s = sym_push(SYM_FIELD, type, 0, -1); type->t = VT_PTR | (type->t & ~VT_TYPE); type->ref = s; } /* compare function types. OLD functions match any new functions */ static int is_compatible_func(CType *type1, CType *type2) { Sym *s1, *s2; s1 = type1->ref; s2 = type2->ref; if (!is_compatible_types(&s1->type, &s2->type)) return 0; /* check func_call */ if (s1->r != s2->r) return 0; /* XXX: not complete */ if (s1->c == FUNC_OLD || s2->c == FUNC_OLD) return 1; if (s1->c != s2->c) return 0; while (s1 != NULL) { if (s2 == NULL) return 0; if (!is_compatible_types(&s1->type, &s2->type)) return 0; s1 = s1->next;
s2 = s2->next; } if (s2) return 0; return 1; } /* return true if type1 and type2 are exactly the same (including qualifiers). - enums are not checked as gcc __builtin_types_compatible_p () */ static int is_compatible_types(CType *type1, CType *type2) { int bt1, t1, t2; t1 = type1->t & VT_TYPE; t2 = type2->t & VT_TYPE; /* XXX: bitfields ? */ if (t1 != t2) return 0; /* test more complicated cases */ bt1 = t1 & VT_BTYPE; if (bt1 == VT_PTR) { type1 = pointed_type(type1); type2 = pointed_type(type2); return is_compatible_types(type1, type2); } else if (bt1 == VT_STRUCT) { return (type1->ref == type2->ref); } else if (bt1 == VT_FUNC) { return is_compatible_func(type1, type2); } else { return 1; } } /* print a type. If 'varstr' is not NULL, then the variable is also printed in the type */ /* XXX: union */ /* XXX: add array and function pointers */ void type_to_str(char *buf, int buf_size, CType *type, const char *varstr) { int bt, v, t; Sym *s, *sa; char buf1[256]; const char *tstr; t = type->t & VT_TYPE; bt = t & VT_BTYPE; buf[0] = '\0'; if (t & VT_CONSTANT) pstrcat(buf, buf_size, "const ");
if (t & VT_VOLATILE) pstrcat(buf, buf_size, "volatile "); if (t & VT_UNSIGNED) pstrcat(buf, buf_size, "unsigned "); switch(bt) { case VT_VOID: tstr = "void"; goto add_tstr; case VT_BOOL: tstr = "_Bool"; goto add_tstr; case VT_BYTE: tstr = "char"; goto add_tstr; case VT_SHORT: tstr = "short"; goto add_tstr; case VT_INT: tstr = "int"; goto add_tstr; case VT_LONG: tstr = "long"; goto add_tstr; case VT_LLONG: tstr = "long long"; goto add_tstr; case VT_FLOAT: tstr = "float"; goto add_tstr; case VT_DOUBLE: tstr = "double"; goto add_tstr; case VT_LDOUBLE: tstr = "long double"; add_tstr: pstrcat(buf, buf_size, tstr); break; case VT_ENUM: case VT_STRUCT: if (bt == VT_STRUCT) tstr = "struct "; else tstr = "enum "; pstrcat(buf, buf_size, tstr); v = type->ref->v & ~SYM_STRUCT; if (v >= SYM_FIRST_ANOM) pstrcat(buf, buf_size, ""); else pstrcat(buf, buf_size, get_tok_str(v, NULL)); break; case VT_FUNC: s = type->ref; type_to_str(buf, buf_size, &s->type, varstr);
pstrcat(buf, buf_size, "("); sa = s->next; while (sa != NULL) { type_to_str(buf1, sizeof(buf1), &sa->type, NULL); pstrcat(buf, buf_size, buf1); sa = sa->next; if (sa) pstrcat(buf, buf_size, ", "); } pstrcat(buf, buf_size, ")"); goto no_var; case VT_PTR: s = type->ref; pstrcpy(buf1, sizeof(buf1), "*"); if (varstr) pstrcat(buf1, sizeof(buf1), varstr); type_to_str(buf, buf_size, &s->type, buf1); goto no_var; } if (varstr) { pstrcat(buf, buf_size, " "); pstrcat(buf, buf_size, varstr); } no_var: ; } /* verify type compatibility to store vtop in 'dt' type, and generate casts if needed. */ static void gen_assign_cast(CType *dt) { CType *st, *type1, *type2, tmp_type1, tmp_type2; char buf1[256], buf2[256]; int dbt, sbt; st = &vtop->type; /* source type */ dbt = dt->t & VT_BTYPE; sbt = st->t & VT_BTYPE; if (dt->t & VT_CONSTANT) warning("assignment of read-only location"); switch(dbt) { case VT_PTR: /* special cases for pointers */ /* '0' can also be a pointer */ if (is_null_pointer(vtop)) goto type_ok; /* accept implicit pointer to integer cast with warning */ if (is_integer_btype(sbt)) { warning("assignment makes pointer from integer without a cast"); goto type_ok; } type1 = pointed_type(dt); /* a function is implicitely a function pointer */ if (sbt == VT_FUNC) {
if ((type1->t & VT_BTYPE) != VT_VOID && !is_compatible_types(pointed_type(dt), st)) goto error; else goto type_ok; } if (sbt != VT_PTR) goto error; type2 = pointed_type(st); if ((type1->t & VT_BTYPE) == VT_VOID || (type2->t & VT_BTYPE) == VT_VOID) { /* void * can match anything */ } else { /* exact type match, except for unsigned */ tmp_type1 = *type1; tmp_type2 = *type2; tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE); tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE); if (!is_compatible_types(&tmp_type1, &tmp_type2)) goto error; } /* check const and volatile */ if ((!(type1->t & VT_CONSTANT) && (type2->t & VT_CONSTANT)) || (!(type1->t & VT_VOLATILE) && (type2->t & VT_VOLATILE))) warning("assignment discards qualifiers from pointer target type"); break; case VT_BYTE: case VT_SHORT: case VT_INT: case VT_LLONG: if (sbt == VT_PTR || sbt == VT_FUNC) { warning("assignment makes integer from pointer without a cast"); } /* XXX: more tests */ break; case VT_STRUCT: tmp_type1 = *dt; tmp_type2 = *st; tmp_type1.t &= ~(VT_CONSTANT | VT_VOLATILE); tmp_type2.t &= ~(VT_CONSTANT | VT_VOLATILE); if (!is_compatible_types(&tmp_type1, &tmp_type2)) { error: type_to_str(buf1, sizeof(buf1), st, NULL); type_to_str(buf2, sizeof(buf2), dt, NULL); error("cannot cast '%s' to '%s'", buf1, buf2); } break; } type_ok: gen_cast(dt); } /* store vtop in lvalue pushed on stack */
void vstore(void) { int sbt, dbt, ft, r, t, size, align, bit_size, bit_pos, rc, delayed_cast; ft = vtop[-1].type.t; sbt = vtop->type.t & VT_BTYPE; dbt = ft & VT_BTYPE; if (((sbt == VT_INT || sbt == VT_SHORT) && dbt == VT_BYTE) || (sbt == VT_INT && dbt == VT_SHORT)) { /* optimize char/short casts */ delayed_cast = VT_MUSTCAST; vtop->type.t = ft & VT_TYPE; /* XXX: factorize */ if (ft & VT_CONSTANT) warning("assignment of read-only location"); } else { delayed_cast = 0; if (!(ft & VT_BITFIELD)) gen_assign_cast(&vtop[-1].type); } if (sbt == VT_STRUCT) { /* if structure, only generate pointer */ /* structure assignment : generate memcpy */ /* XXX: optimize if small size */ if (!nocode_wanted) { size = type_size(&vtop->type, &align); vpush_global_sym(&func_old_type, TOK_memcpy); /* destination */ vpushv(vtop - 2); vtop->type.t = VT_INT; gaddrof(); /* source */ vpushv(vtop - 2); vtop->type.t = VT_INT; gaddrof(); /* type size */ vpushi(size); gfunc_call(3); vswap(); vpop(); } else { vswap(); vpop(); } /* leave source on stack */ } else if (ft & VT_BITFIELD) { /* bitfield store handling */ bit_pos = (ft >> VT_STRUCT_SHIFT) & 0x3f; bit_size = (ft >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
/* remove bit field info to avoid loops */ vtop[-1].type.t = ft & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT)); /* duplicate destination */ vdup(); vtop[-1] = vtop[-2]; /* mask and shift source */ vpushi((1 << bit_size) - 1); gen_op('&'); vpushi(bit_pos); gen_op(TOK_SHL); /* load destination, mask and or with source */ vswap(); vpushi(~(((1 << bit_size) - 1) << bit_pos)); gen_op('&'); gen_op('|'); /* store result */ vstore(); } else { #ifdef CONFIG_TCC_BCHECK /* bound check case */ if (vtop[-1].r & VT_MUSTBOUND) { vswap(); gbound(); vswap(); } #endif if (!nocode_wanted) { rc = RC_INT; if (is_float(ft)) rc = RC_FLOAT; r = gv(rc); /* generate value */ /* if lvalue was saved on stack, must read it */ if ((vtop[-1].r & VT_VALMASK) == VT_LLOCAL) { SValue sv; t = get_reg(RC_INT); sv.type.t = VT_INT; sv.r = VT_LOCAL | VT_LVAL; sv.c.ul = vtop[-1].c.ul; load(t, &sv); vtop[-1].r = t | VT_LVAL; } store(r, vtop - 1); /* two word case handling : store second register at word + 4 */ if ((ft & VT_BTYPE) == VT_LLONG) { vswap(); /* convert to int to increment easily */ vtop->type.t = VT_INT; gaddrof(); vpushi(4); gen_op('+'); vtop->r |= VT_LVAL;
vswap(); /* XXX: it works because r2 is spilled last ! */ store(vtop->r2, vtop - 1); } } vswap(); vtop--; /* NOT vpop() because on x86 it would flush the fp stack */ vtop->r |= delayed_cast; } } /* post defines POST/PRE add. c is the token ++ or -- */ void inc(int post, int c) { test_lvalue(); vdup(); /* save lvalue */ if (post) { gv_dup(); /* duplicate value */ vrotb(3); vrotb(3); } /* add constant */ vpushi(c - TOK_MID); gen_op('+'); vstore(); /* store value */ if (post) vpop(); /* if post op, return saved value */ } /* Parse GNUC __attribute__ extension. Currently, the following extensions are recognized: - aligned(n) : set data/function alignment. - packed : force data alignment to 1 - section(x) : generate data/code in this section. - unused : currently ignored, but may be used someday. - regparm(n) : pass function parameters in registers (i386 only) */ static void parse_attribute(AttributeDef *ad) { int t, n; while (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) { next(); skip('('); skip('('); while (tok != ')') { if (tok < TOK_IDENT) expect("attribute name"); t = tok; next(); switch(t) { case TOK_SECTION1: case TOK_SECTION2:
skip('('); if (tok != TOK_STR) expect("section name"); ad->section = find_section(tcc_state, (char *)tokc.cstr->data); next(); skip(')'); break; case TOK_ALIGNED1: case TOK_ALIGNED2: if (tok == '(') { next(); n = expr_const(); if (n <= 0 || (n & (n - 1)) != 0) error("alignment must be a positive power of two"); skip(')'); } else { n = MAX_ALIGN; } ad->aligned = n; break; case TOK_PACKED1: case TOK_PACKED2: ad->packed = 1; break; case TOK_UNUSED1: case TOK_UNUSED2: /* currently, no need to handle it because tcc does not track unused objects */ break; case TOK_NORETURN1: case TOK_NORETURN2: /* currently, no need to handle it because tcc does not track unused objects */ break; case TOK_CDECL1: case TOK_CDECL2: case TOK_CDECL3: ad->func_call = FUNC_CDECL; break; case TOK_STDCALL1: case TOK_STDCALL2: case TOK_STDCALL3: ad->func_call = FUNC_STDCALL; break; #ifdef TCC_TARGET_I386 case TOK_REGPARM1: case TOK_REGPARM2: skip('('); n = expr_const(); if (n > 3) n = 3; else if (n < 0) n = 0;
if (n > 0) ad->func_call = FUNC_FASTCALL1 + n - 1; skip(')'); break; #endif case TOK_DLLEXPORT: ad->dllexport = 1; break; default: if (tcc_state->warn_unsupported) warning("'%s' attribute ignored", get_tok_str(t, NULL)); /* skip parameters */ /* XXX: skip parenthesis too */ if (tok == '(') { next(); while (tok != ')' && tok != -1) next(); next(); } break; } if (tok != ',') break; next(); } skip(')'); skip(')'); } } /* enum/struct/union declaration. u is either VT_ENUM or VT_STRUCT */ static void struct_decl(CType *type, int u) { int a, v, size, align, maxalign, c, offset; int bit_size, bit_pos, bsize, bt, lbit_pos; Sym *s, *ss, **ps; AttributeDef ad; CType type1, btype; a = tok; /* save decl type */ next(); if (tok != '{') { v = tok; next(); /* struct already defined ? return it */ if (v < TOK_IDENT) expect("struct/union/enum name"); s = struct_find(v); if (s) { if (s->type.t != a) error("invalid type"); goto do_decl; }
} else { v = anon_sym++; } type1.t = a; /* we put an undefined size for struct/union */ s = sym_push(v | SYM_STRUCT, &type1, 0, -1); s->r = 0; /* default alignment is zero as gcc */ /* put struct/union/enum name in type */ do_decl: type->t = u; type->ref = s; if (tok == '{') { next(); if (s->c != -1) error("struct/union/enum already defined"); /* cannot be empty */ c = 0; /* non empty enums are not allowed */ if (a == TOK_ENUM) { for(;;) { v = tok; if (v < TOK_UIDENT) expect("identifier"); next(); if (tok == '=') { next(); c = expr_const(); } /* enum symbols have static storage */ ss = sym_push(v, &int_type, VT_CONST, c); ss->type.t |= VT_STATIC; if (tok != ',') break; next(); c++; /* NOTE: we accept a trailing comma */ if (tok == '}') break; } skip('}'); } else { maxalign = 1; ps = &s->next; bit_pos = 0; offset = 0; while (tok != '}') { parse_btype(&btype, &ad); while (1) { bit_size = -1; v = 0; type1 = btype; if (tok != ':') {
type_decl(&type1, &ad, &v, TYPE_DIRECT); if ((type1.t & VT_BTYPE) == VT_FUNC || (type1.t & (VT_TYPEDEF | VT_STATIC | VT_EXTERN | VT_INLINE))) error("invalid type for '%s'", get_tok_str(v, NULL)); } if (tok == ':') { next(); bit_size = expr_const(); /* XXX: handle v = 0 case for messages */ if (bit_size < 0) error("negative width in bit-field '%s'", get_tok_str(v, NULL)); if (v && bit_size == 0) error("zero width for bit-field '%s'", get_tok_str(v, NULL)); } size = type_size(&type1, &align); if (ad.aligned) { if (align < ad.aligned) align = ad.aligned; } else if (ad.packed) { align = 1; } else if (*tcc_state->pack_stack_ptr) { if (align > *tcc_state->pack_stack_ptr) align = *tcc_state->pack_stack_ptr; } lbit_pos = 0; if (bit_size >= 0) { bt = type1.t & VT_BTYPE; if (bt != VT_INT && bt != VT_BYTE && bt != VT_SHORT && bt != VT_BOOL && bt != VT_ENUM) error("bitfields must have scalar type"); bsize = size * 8; if (bit_size > bsize) { error("width of '%s' exceeds its type", get_tok_str(v, NULL)); } else if (bit_size == bsize) { /* no need for bit fields */ bit_pos = 0; } else if (bit_size == 0) { /* XXX: what to do if only padding in a structure ? */ /* zero size: means to pad */ if (bit_pos > 0) bit_pos = bsize; } else { /* we do not have enough room ? */ if ((bit_pos + bit_size) > bsize) bit_pos = 0;
lbit_pos = bit_pos; /* XXX: handle LSB first */ type1.t |= VT_BITFIELD | (bit_pos << VT_STRUCT_SHIFT) | (bit_size << (VT_STRUCT_SHIFT + 6)); bit_pos += bit_size; } } else { bit_pos = 0; } if (v) { /* add new memory data only if starting bit field */ if (lbit_pos == 0) { if (a == TOK_STRUCT) { c = (c + align - 1) & -align; offset = c; c += size; } else { offset = 0; if (size > c) c = size; } if (align > maxalign) maxalign = align; } #if 0 printf("add field %s offset=%d", get_tok_str(v, NULL), offset); if (type1.t & VT_BITFIELD) { printf(" pos=%d size=%d", (type1.t >> VT_STRUCT_SHIFT) & 0x3f, (type1.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f); } printf("\n"); #endif ss = sym_push(v | SYM_FIELD, &type1, 0, offset); *ps = ss; ps = &ss->next; } if (tok == ';' || tok == TOK_EOF) break; skip(','); } skip(';'); } skip('}'); /* store size and alignment */ s->c = (c + maxalign - 1) & -maxalign; s->r = maxalign; } } }
/* return 0 if no type declaration. otherwise, return the basic type and skip it. */ static int parse_btype(CType *type, AttributeDef *ad) { int t, u, type_found, typespec_found; Sym *s; CType type1; memset(ad, 0, sizeof(AttributeDef)); type_found = 0; typespec_found = 0; t = 0; while(1) { switch(tok) { case TOK_EXTENSION: /* currently, we really ignore extension */ next(); continue; /* basic types */ case TOK_CHAR: u = VT_BYTE; basic_type: next(); basic_type1: if ((t & VT_BTYPE) != 0) error("too many basic types"); t |= u; typespec_found = 1; break; case TOK_VOID: u = VT_VOID; goto basic_type; case TOK_SHORT: u = VT_SHORT; goto basic_type; case TOK_INT: next(); typespec_found = 1; break; case TOK_LONG: next(); if ((t & VT_BTYPE) == VT_DOUBLE) { t = (t & ~VT_BTYPE) | VT_LDOUBLE; } else if ((t & VT_BTYPE) == VT_LONG) { t = (t & ~VT_BTYPE) | VT_LLONG; } else { u = VT_LONG; goto basic_type1; } break;
case TOK_BOOL: u = VT_BOOL; goto basic_type; case TOK_FLOAT: u = VT_FLOAT; goto basic_type; case TOK_DOUBLE: next(); if ((t & VT_BTYPE) == VT_LONG) { t = (t & ~VT_BTYPE) | VT_LDOUBLE; } else { u = VT_DOUBLE; goto basic_type1; } break; case TOK_ENUM: struct_decl(&type1, VT_ENUM); basic_type2: u = type1.t; type->ref = type1.ref; goto basic_type1; case TOK_STRUCT: case TOK_UNION: struct_decl(&type1, VT_STRUCT); goto basic_type2; /* type modifiers */ case TOK_CONST1: case TOK_CONST2: case TOK_CONST3: t |= VT_CONSTANT; next(); break; case TOK_VOLATILE1: case TOK_VOLATILE2: case TOK_VOLATILE3: t |= VT_VOLATILE; next(); break; case TOK_SIGNED1: case TOK_SIGNED2: case TOK_SIGNED3: typespec_found = 1; t |= VT_SIGNED; next(); break; case TOK_REGISTER: case TOK_AUTO: case TOK_RESTRICT1: case TOK_RESTRICT2: case TOK_RESTRICT3: next(); break;
case TOK_UNSIGNED: t |= VT_UNSIGNED; next(); typespec_found = 1; break; /* storage */ case TOK_EXTERN: t |= VT_EXTERN; next(); break; case TOK_STATIC: t |= VT_STATIC; next(); break; case TOK_TYPEDEF: t |= VT_TYPEDEF; next(); break; case TOK_INLINE1: case TOK_INLINE2: case TOK_INLINE3: t |= VT_INLINE; next(); break; /* GNUC attribute */ case TOK_ATTRIBUTE1: case TOK_ATTRIBUTE2: parse_attribute(ad); break; /* GNUC typeof */ case TOK_TYPEOF1: case TOK_TYPEOF2: case TOK_TYPEOF3: next(); parse_expr_type(&type1); goto basic_type2; default: if (typespec_found) goto the_end; s = sym_find(tok); if (!s || !(s->type.t & VT_TYPEDEF)) goto the_end; t |= (s->type.t & ~VT_TYPEDEF); type->ref = s->type.ref; next(); break; } type_found = 1; } the_end: if ((t & (VT_SIGNED|VT_UNSIGNED)) == (VT_SIGNED|VT_UNSIGNED))
error("signed and unsigned modifier"); if (tcc_state->char_is_unsigned) { if ((t & (VT_SIGNED|VT_UNSIGNED|VT_BTYPE)) == VT_BYTE) t |= VT_UNSIGNED; } t &= ~VT_SIGNED; /* long is never used as type */ if ((t & VT_BTYPE) == VT_LONG) t = (t & ~VT_BTYPE) | VT_INT; type->t = t; return type_found; } /* convert a function parameter type (array to pointer and function to function pointer) */ static inline void convert_parameter_type(CType *pt) { /* remove const and volatile qualifiers (XXX: const could be used to indicate a const function parameter */ pt->t &= ~(VT_CONSTANT | VT_VOLATILE); /* array must be transformed to pointer according to ANSI C */ pt->t &= ~VT_ARRAY; if ((pt->t & VT_BTYPE) == VT_FUNC) { mk_pointer(pt); } } static void post_type(CType *type, AttributeDef *ad) { int n, l, t1; Sym **plast, *s, *first; AttributeDef ad1; CType pt; if (tok == '(') { /* function declaration */ next(); l = 0; first = NULL; plast = &first; while (tok != ')') { /* read param name and compute offset */ if (l != FUNC_OLD) { if (!parse_btype(&pt, &ad1)) { if (l) { error("invalid type"); } else { l = FUNC_OLD; goto old_proto; } } l = FUNC_NEW;
if ((pt.t & VT_BTYPE) == VT_VOID && tok == ')') break; type_decl(&pt, &ad1, &n, TYPE_DIRECT | TYPE_ABSTRACT); if ((pt.t & VT_BTYPE) == VT_VOID) error("parameter declared as void"); } else { old_proto: n = tok; pt.t = VT_INT; next(); } convert_parameter_type(&pt); s = sym_push(n | SYM_FIELD, &pt, 0, 0); *plast = s; plast = &s->next; if (tok == ',') { next(); if (l == FUNC_NEW && tok == TOK_DOTS) { l = FUNC_ELLIPSIS; next(); break; } } } /* if no parameters, then old type prototype */ if (l == 0) l = FUNC_OLD; skip(')'); t1 = type->t & VT_STORAGE; /* NOTE: const is ignored in returned type as it has a special meaning in gcc / C++ */ type->t &= ~(VT_STORAGE | VT_CONSTANT); post_type(type, ad); /* we push a anonymous symbol which will contain the function prototype */ s = sym_push(SYM_FIELD, type, ad->func_call, l); s->next = first; type->t = t1 | VT_FUNC; type->ref = s; } else if (tok == '[') { /* array definition */ next(); n = -1; if (tok != ']') { n = expr_const(); if (n < 0) error("invalid array size"); } skip(']'); /* parse next post type */ t1 = type->t & VT_STORAGE; type->t &= ~VT_STORAGE; post_type(type, ad);
/* we push a anonymous symbol which will contain the array element type */ s = sym_push(SYM_FIELD, type, 0, n); type->t = t1 | VT_ARRAY | VT_PTR; type->ref = s; } } /* Parse a type declaration (except basic type), and return the type in 'type'. 'td' is a bitmask indicating which kind of type decl is expected. 'type' should contain the basic type. 'ad' is the attribute definition of the basic type. It can be modified by type_decl(). */ static void type_decl(CType *type, AttributeDef *ad, int *v, int td) { Sym *s; CType type1, *type2; int qualifiers; while (tok == '*') { qualifiers = 0; redo: next(); switch(tok) { case TOK_CONST1: case TOK_CONST2: case TOK_CONST3: qualifiers |= VT_CONSTANT; goto redo; case TOK_VOLATILE1: case TOK_VOLATILE2: case TOK_VOLATILE3: qualifiers |= VT_VOLATILE; goto redo; case TOK_RESTRICT1: case TOK_RESTRICT2: case TOK_RESTRICT3: goto redo; } mk_pointer(type); type->t |= qualifiers; } /* XXX: clarify attribute handling */ if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) parse_attribute(ad); /* recursive type */ /* XXX: incorrect if abstract type for functions (e.g. 'int ()') */ type1.t = 0; /* XXX: same as int */ if (tok == '(') { next();
/* XXX: this is not correct to modify 'ad' at this point, but the syntax is not clear */ if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) parse_attribute(ad); type_decl(&type1, ad, v, td); skip(')'); } else { /* type identifier */ if (tok >= TOK_IDENT && (td & TYPE_DIRECT)) { *v = tok; next(); } else { if (!(td & TYPE_ABSTRACT)) expect("identifier"); *v = 0; } } post_type(type, ad); if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) parse_attribute(ad); if (!type1.t) return; /* append type at the end of type1 */ type2 = &type1; for(;;) { s = type2->ref; type2 = &s->type; if (!type2->t) { *type2 = *type; break; } } *type = type1; } /* compute the lvalue VT_LVAL_xxx needed to match type t. */ static int lvalue_type(int t) { int bt, r; r = VT_LVAL; bt = t & VT_BTYPE; if (bt == VT_BYTE || bt == VT_BOOL) r |= VT_LVAL_BYTE; else if (bt == VT_SHORT) r |= VT_LVAL_SHORT; else return r; if (t & VT_UNSIGNED) r |= VT_LVAL_UNSIGNED; return r; } /* indirection with full error checking and bound check */
static void indir(void) { if ((vtop->type.t & VT_BTYPE) != VT_PTR) expect("pointer"); if ((vtop->r & VT_LVAL) && !nocode_wanted) gv(RC_INT); vtop->type = *pointed_type(&vtop->type); /* an array is never an lvalue */ if (!(vtop->type.t & VT_ARRAY)) { vtop->r |= lvalue_type(vtop->type.t); /* if bound checking, the referenced pointer must be checked */ if (do_bounds_check) vtop->r |= VT_MUSTBOUND; } } /* pass a parameter to a function and do type checking and casting */ static void gfunc_param_typed(Sym *func, Sym *arg) { int func_type; CType type; func_type = func->c; if (func_type == FUNC_OLD || (func_type == FUNC_ELLIPSIS && arg == NULL)) { /* default casting : only need to convert float to double */ if ((vtop->type.t & VT_BTYPE) == VT_FLOAT) { type.t = VT_DOUBLE; gen_cast(&type); } } else if (arg == NULL) { error("too many arguments to function"); } else { type = arg->type; type.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */ gen_assign_cast(&type); } } /* parse an expression of the form '(type)' or '(expr)' and return its type */ static void parse_expr_type(CType *type) { int n; AttributeDef ad; skip('('); if (parse_btype(type, &ad)) { type_decl(type, &ad, &n, TYPE_ABSTRACT); } else { expr_type(type); } skip(')');
} static void parse_type(CType *type) { AttributeDef ad; int n; if (!parse_btype(type, &ad)) { expect("type"); } type_decl(type, &ad, &n, TYPE_ABSTRACT); } static void vpush_tokc(int t) { CType type; type.t = t; vsetc(&type, VT_CONST, &tokc); } static void unary(void) { int n, t, align, size, r; CType type; Sym *s; AttributeDef ad; /* XXX: GCC 2.95.3 does not generate a table although it should be better here */ tok_next: switch(tok) { case TOK_EXTENSION: next(); goto tok_next; case TOK_CINT: case TOK_CCHAR: case TOK_LCHAR: vpushi(tokc.i); next(); break; case TOK_CUINT: vpush_tokc(VT_INT | VT_UNSIGNED); next(); break; case TOK_CLLONG: vpush_tokc(VT_LLONG); next(); break; case TOK_CULLONG: vpush_tokc(VT_LLONG | VT_UNSIGNED); next(); break; case TOK_CFLOAT:
vpush_tokc(VT_FLOAT); next(); break; case TOK_CDOUBLE: vpush_tokc(VT_DOUBLE); next(); break; case TOK_CLDOUBLE: vpush_tokc(VT_LDOUBLE); next(); break; case TOK___FUNCTION__: if (!gnu_ext) goto tok_identifier; /* fall thru */ case TOK___FUNC__: { void *ptr; int len; /* special function name identifier */ len = strlen(funcname) + 1; /* generate char[len] type */ type.t = VT_BYTE; mk_pointer(&type); type.t |= VT_ARRAY; type.ref->c = len; vpush_ref(&type, data_section, data_section->data_offset, len); ptr = section_ptr_add(data_section, len); memcpy(ptr, funcname, len); next(); } break; case TOK_LSTR: t = VT_INT; goto str_init; case TOK_STR: /* string parsing */ t = VT_BYTE; str_init: if (tcc_state->warn_write_strings) t |= VT_CONSTANT; type.t = t; mk_pointer(&type); type.t |= VT_ARRAY; memset(&ad, 0, sizeof(AttributeDef)); decl_initializer_alloc(&type, &ad, VT_CONST, 2, 0, 0); break; case '(': next(); /* cast ? */ if (parse_btype(&type, &ad)) { type_decl(&type, &ad, &n, TYPE_ABSTRACT); skip(')');
/* check ISOC99 compound literal */ if (tok == '{') { /* data is allocated locally by default */ if (global_expr) r = VT_CONST; else r = VT_LOCAL; /* all except arrays are lvalues */ if (!(type.t & VT_ARRAY)) r |= lvalue_type(type.t); memset(&ad, 0, sizeof(AttributeDef)); decl_initializer_alloc(&type, &ad, r, 1, 0, 0); } else { unary(); gen_cast(&type); } } else if (tok == '{') { /* save all registers */ save_regs(0); /* statement expression : we do not accept break/continue inside as GCC does */ block(NULL, NULL, NULL, NULL, 0, 1); skip(')'); } else { gexpr(); skip(')'); } break; case '*': next(); unary(); indir(); break; case '&': next(); unary(); /* functions names must be treated as function pointers, except for unary '&' and sizeof. Since we consider that functions are not lvalues, we only have to handle it there and in function calls. */ /* arrays can also be used although they are not lvalues */ if ((vtop->type.t & VT_BTYPE) != VT_FUNC && !(vtop->type.t & VT_ARRAY)) test_lvalue(); mk_pointer(&vtop->type); gaddrof(); break; case '!': next(); unary(); if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) vtop->c.i = !vtop->c.i; else if ((vtop->r & VT_VALMASK) == VT_CMP)
vtop->c.i = vtop->c.i ^ 1; else vseti(VT_JMP, gtst(1, 0)); break; case '~': next(); unary(); vpushi(-1); gen_op('^'); break; case '+': next(); /* in order to force cast, we add zero */ unary(); if ((vtop->type.t & VT_BTYPE) == VT_PTR) error("pointer not accepted for unary plus"); vpushi(0); gen_op('+'); break; case TOK_SIZEOF: case TOK_ALIGNOF1: case TOK_ALIGNOF2: t = tok; next(); if (tok == '(') { parse_expr_type(&type); } else { unary_type(&type); } size = type_size(&type, &align); if (t == TOK_SIZEOF) { if (size < 0) error("sizeof applied to an incomplete type"); vpushi(size); } else { vpushi(align); } break; case TOK_builtin_types_compatible_p: { CType type1, type2; next(); skip('('); parse_type(&type1); skip(','); parse_type(&type2); skip(')'); type1.t &= ~(VT_CONSTANT | VT_VOLATILE); type2.t &= ~(VT_CONSTANT | VT_VOLATILE); vpushi(is_compatible_types(&type1, &type2)); } break;
case TOK_builtin_constant_p: { int saved_nocode_wanted, res; next(); skip('('); saved_nocode_wanted = nocode_wanted; nocode_wanted = 1; gexpr(); res = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST; vpop(); nocode_wanted = saved_nocode_wanted; skip(')'); vpushi(res); } break; case TOK_INC: case TOK_DEC: t = tok; next(); unary(); inc(0, t); break; case '-': next(); vpushi(0); unary(); gen_op('-'); break; case TOK_LAND: if (!gnu_ext) goto tok_identifier; next(); /* allow to take the address of a label */ if (tok < TOK_UIDENT) expect("label identifier"); s = label_find(tok); if (!s) { s = label_push(&global_label_stack, tok, LABEL_FORWARD); } else { if (s->r == LABEL_DECLARED) s->r = LABEL_FORWARD; } if (!s->type.t) { s->type.t = VT_VOID; mk_pointer(&s->type); s->type.t |= VT_STATIC; } vset(&s->type, VT_CONST | VT_SYM, 0); vtop->sym = s; next(); break; default: tok_identifier:
t = tok; next(); if (t < TOK_UIDENT) expect("identifier"); s = sym_find(t); if (!s) { if (tok != '(') error("'%s' undeclared", get_tok_str(t, NULL)); /* for simple function calls, we tolerate undeclared external reference to int() function */ if (tcc_state->warn_implicit_function_declaration) warning("implicit declaration of function '%s'", get_tok_str(t, NULL)); s = external_global_sym(t, &func_old_type, 0); } if ((s->type.t & (VT_STATIC | VT_INLINE | VT_BTYPE)) == (VT_STATIC | VT_INLINE | VT_FUNC)) { /* if referencing an inline function, then we generate a symbol to it if not already done. It will have the effect to generate code for it at the end of the compilation unit. Inline function as always generated in the text section. */ if (!s->c) put_extern_sym(s, text_section, 0, 0); r = VT_SYM | VT_CONST; } else { r = s->r; } vset(&s->type, r, s->c); /* if forward reference, we must point to s */ if (vtop->r & VT_SYM) { vtop->sym = s; vtop->c.ul = 0; } break; } /* post operations */ while (1) { if (tok == TOK_INC || tok == TOK_DEC) { inc(1, tok); next(); } else if (tok == '.' || tok == TOK_ARROW) { /* field */ if (tok == TOK_ARROW) indir(); test_lvalue(); gaddrof(); next(); /* expect pointer on structure */ if ((vtop->type.t & VT_BTYPE) != VT_STRUCT) expect("struct or union"); s = vtop->type.ref;
/* find field */ tok |= SYM_FIELD; while ((s = s->next) != NULL) { if (s->v == tok) break; } if (!s) error("field not found"); /* add field offset to pointer */ vtop->type = char_pointer_type; /* change type to 'char *' */ vpushi(s->c); gen_op('+'); /* change type to field type, and set to lvalue */ vtop->type = s->type; /* an array is never an lvalue */ if (!(vtop->type.t & VT_ARRAY)) { vtop->r |= lvalue_type(vtop->type.t); /* if bound checking, the referenced pointer must be checked */ if (do_bounds_check) vtop->r |= VT_MUSTBOUND; } next(); } else if (tok == '[') { next(); gexpr(); gen_op('+'); indir(); skip(']'); } else if (tok == '(') { SValue ret; Sym *sa; int nb_args; /* function call */ if ((vtop->type.t & VT_BTYPE) != VT_FUNC) { /* pointer test (no array accepted) */ if ((vtop->type.t & (VT_BTYPE | VT_ARRAY)) == VT_PTR) { vtop->type = *pointed_type(&vtop->type); if ((vtop->type.t & VT_BTYPE) != VT_FUNC) goto error_func; } else { error_func: expect("function pointer"); } } else { vtop->r &= ~VT_LVAL; /* no lvalue */ } /* get return type */ s = vtop->type.ref; next(); sa = s->next; /* first parameter */ nb_args = 0; /* compute first implicit argument if a structure is returned */
if ((s->type.t & VT_BTYPE) == VT_STRUCT) { /* get some space for the returned structure */ size = type_size(&s->type, &align); loc = (loc - size) & -align; ret.type = s->type; ret.r = VT_LOCAL | VT_LVAL; /* pass it as 'int' to avoid structure arg passing problems */ vseti(VT_LOCAL, loc); ret.c = vtop->c; nb_args++; } else { ret.type = s->type; ret.r2 = VT_CONST; /* return in register */ if (is_float(ret.type.t)) { ret.r = REG_FRET; } else { if ((ret.type.t & VT_BTYPE) == VT_LLONG) ret.r2 = REG_LRET; ret.r = REG_IRET; } ret.c.i = 0; } if (tok != ')') { for(;;) { expr_eq(); gfunc_param_typed(s, sa); nb_args++; if (sa) sa = sa->next; if (tok == ')') break; skip(','); } } if (sa) error("too few arguments to function"); skip(')'); if (!nocode_wanted) { gfunc_call(nb_args); } else { vtop -= (nb_args + 1); } /* return value */ vsetc(&ret.type, ret.r, &ret.c); vtop->r2 = ret.r2; } else { break; } } }
static void uneq(void) { int t; unary(); if (tok == '=' || (tok >= TOK_A_MOD && tok <= TOK_A_DIV) || tok == TOK_A_XOR || tok == TOK_A_OR || tok == TOK_A_SHL || tok == TOK_A_SAR) { test_lvalue(); t = tok; next(); if (t == '=') { expr_eq(); } else { vdup(); expr_eq(); gen_op(t & 0x7f); } vstore(); } } static void expr_prod(void) { int t; uneq(); while (tok == '*' || tok == '/' || tok == '%') { t = tok; next(); uneq(); gen_op(t); } } static void expr_sum(void) { int t; expr_prod(); while (tok == '+' || tok == '-') { t = tok; next(); expr_prod(); gen_op(t); } } static void expr_shift(void) { int t;
expr_sum(); while (tok == TOK_SHL || tok == TOK_SAR) { t = tok; next(); expr_sum(); gen_op(t); } } static void expr_cmp(void) { int t; expr_shift(); while ((tok >= TOK_ULE && tok <= TOK_GT) || tok == TOK_ULT || tok == TOK_UGE) { t = tok; next(); expr_shift(); gen_op(t); } } static void expr_cmpeq(void) { int t; expr_cmp(); while (tok == TOK_EQ || tok == TOK_NE) { t = tok; next(); expr_cmp(); gen_op(t); } } static void expr_and(void) { expr_cmpeq(); while (tok == '&') { next(); expr_cmpeq(); gen_op('&'); } } static void expr_xor(void) { expr_and(); while (tok == '^') { next(); expr_and(); gen_op('^');
} } static void expr_or(void) { expr_xor(); while (tok == '|') { next(); expr_xor(); gen_op('|'); } } /* XXX: fix this mess */ static void expr_land_const(void) { expr_or(); while (tok == TOK_LAND) { next(); expr_or(); gen_op(TOK_LAND); } } /* XXX: fix this mess */ static void expr_lor_const(void) { expr_land_const(); while (tok == TOK_LOR) { next(); expr_land_const(); gen_op(TOK_LOR); } } /* only used if non constant */ static void expr_land(void) { int t; expr_or(); if (tok == TOK_LAND) { t = 0; for(;;) { t = gtst(1, t); if (tok != TOK_LAND) { vseti(VT_JMPI, t); break; } next(); expr_or(); } }
} static void expr_lor(void) { int t; expr_land(); if (tok == TOK_LOR) { t = 0; for(;;) { t = gtst(0, t); if (tok != TOK_LOR) { vseti(VT_JMP, t); break; } next(); expr_land(); } } } /* XXX: better constant handling */ static void expr_eq(void) { int tt, u, r1, r2, rc, t1, t2, bt1, bt2; SValue sv; CType type, type1, type2; if (const_wanted) { int c1, c; expr_lor_const(); if (tok == '?') { c = vtop->c.i; vpop(); next(); if (tok == ':' && gnu_ext) { c1 = c; } else { gexpr(); c1 = vtop->c.i; vpop(); } skip(':'); expr_eq(); if (c) vtop->c.i = c1; } } else { expr_lor(); if (tok == '?') { next(); if (vtop != vstack) { /* needed to avoid having different registers saved in
each branch */ if (is_float(vtop->type.t)) rc = RC_FLOAT; else rc = RC_INT; gv(rc); save_regs(1); } if (tok == ':' && gnu_ext) { gv_dup(); tt = gtst(1, 0); } else { tt = gtst(1, 0); gexpr(); } type1 = vtop->type; sv = *vtop; /* save value to handle it later */ vtop--; /* no vpop so that FP stack is not flushed */ skip(':'); u = gjmp(0); gsym(tt); expr_eq(); type2 = vtop->type; t1 = type1.t; bt1 = t1 & VT_BTYPE; t2 = type2.t; bt2 = t2 & VT_BTYPE; /* cast operands to correct type according to ISOC rules */ if (is_float(bt1) || is_float(bt2)) { if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) { type.t = VT_LDOUBLE; } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) { type.t = VT_DOUBLE; } else { type.t = VT_FLOAT; } } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) { /* cast to biggest op */ type.t = VT_LLONG; /* convert to unsigned if it does not fit in a long long */ if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) || (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED)) type.t |= VT_UNSIGNED; } else if (bt1 == VT_PTR || bt2 == VT_PTR) { /* XXX: test pointer compatibility */ type = type1; } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) { /* XXX: test structure compatibility */ type = type1; } else if (bt1 == VT_VOID || bt2 == VT_VOID) { /* NOTE: as an extension, we accept void on only one side */ type.t = VT_VOID;
} else { /* integer operations */ type.t = VT_INT; /* convert to unsigned if it does not fit in an integer */ if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) || (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED)) type.t |= VT_UNSIGNED; } /* now we convert second operand */ gen_cast(&type); rc = RC_INT; if (is_float(type.t)) { rc = RC_FLOAT; } else if ((type.t & VT_BTYPE) == VT_LLONG) { /* for long longs, we use fixed registers to avoid having to handle a complicated move */ rc = RC_IRET; } r2 = gv(rc); /* this is horrible, but we must also convert first operand */ tt = gjmp(0); gsym(u); /* put again first value and cast it */ *vtop = sv; gen_cast(&type); r1 = gv(rc); move_reg(r2, r1); vtop->r = r2; gsym(tt); } } } static void gexpr(void) { while (1) { expr_eq(); if (tok != ',') break; vpop(); next(); } } /* parse an expression and return its type without any side effect. */ static void expr_type(CType *type) { int saved_nocode_wanted; saved_nocode_wanted = nocode_wanted;
nocode_wanted = 1; gexpr(); *type = vtop->type; vpop(); nocode_wanted = saved_nocode_wanted; } /* parse a unary expression and return its type without any side effect. */ static void unary_type(CType *type) { int a; a = nocode_wanted; nocode_wanted = 1; unary(); *type = vtop->type; vpop(); nocode_wanted = a; } /* parse a constant expression and return value in vtop. */ static void expr_const1(void) { int a; a = const_wanted; const_wanted = 1; expr_eq(); const_wanted = a; } /* parse an integer constant and return its value. */ static int expr_const(void) { int c; expr_const1(); if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST) expect("constant expression"); c = vtop->c.i; vpop(); return c; } /* return the label token if current token is a label, otherwise return zero */ static int is_label(void) { int last_tok; /* fast test first */ if (tok < TOK_UIDENT) return 0; /* no need to save tokc because tok is an identifier */
last_tok = tok; next(); if (tok == ':') { next(); return last_tok; } else { unget_tok(last_tok); return 0; } } static void block(int *bsym, int *csym, int *case_sym, int *def_sym, int case_reg, int is_expr) { int a, b, c, d; Sym *s; /* generate line number info */ if (do_debug && (last_line_num != file->line_num || last_ind != ind)) { put_stabn(N_SLINE, 0, file->line_num, ind - func_ind); last_ind = ind; last_line_num = file->line_num; } if (is_expr) { /* default return value is (void) */ vpushi(0); vtop->type.t = VT_VOID; } if (tok == TOK_IF) { /* if test */ next(); skip('('); gexpr(); skip(')'); a = gtst(1, 0); block(bsym, csym, case_sym, def_sym, case_reg, 0); c = tok; if (c == TOK_ELSE) { next(); d = gjmp(0); gsym(a); block(bsym, csym, case_sym, def_sym, case_reg, 0); gsym(d); /* patch else jmp */ } else gsym(a); } else if (tok == TOK_WHILE) { next(); d = ind; skip('('); gexpr();
skip(')'); a = gtst(1, 0); b = 0; block(&a, &b, case_sym, def_sym, case_reg, 0); gjmp_addr(d); gsym(a); gsym_addr(b, d); } else if (tok == '{') { Sym *llabel; next(); /* record local declaration stack position */ s = local_stack; llabel = local_label_stack; /* handle local labels declarations */ if (tok == TOK_LABEL) { next(); for(;;) { if (tok < TOK_UIDENT) expect("label identifier"); label_push(&local_label_stack, tok, LABEL_DECLARED); next(); if (tok == ',') { next(); } else { skip(';'); break; } } } while (tok != '}') { decl(VT_LOCAL); if (tok != '}') { if (is_expr) vpop(); block(bsym, csym, case_sym, def_sym, case_reg, is_expr); } } /* pop locally defined labels */ label_pop(&local_label_stack, llabel); /* pop locally defined symbols */ sym_pop(&local_stack, s); next(); } else if (tok == TOK_RETURN) { next(); if (tok != ';') { gexpr(); gen_assign_cast(&func_vt); if ((func_vt.t & VT_BTYPE) == VT_STRUCT) { CType type; /* if returning structure, must copy it to implicit first pointer arg location */ type = func_vt;
mk_pointer(&type); vset(&type, VT_LOCAL | VT_LVAL, func_vc); indir(); vswap(); /* copy structure value to pointer */ vstore(); } else if (is_float(func_vt.t)) { gv(RC_FRET); } else { gv(RC_IRET); } vtop--; /* NOT vpop() because on x86 it would flush the fp stack */ } skip(';'); rsym = gjmp(rsym); /* jmp */ } else if (tok == TOK_BREAK) { /* compute jump */ if (!bsym) error("cannot break"); *bsym = gjmp(*bsym); next(); skip(';'); } else if (tok == TOK_CONTINUE) { /* compute jump */ if (!csym) error("cannot continue"); *csym = gjmp(*csym); next(); skip(';'); } else if (tok == TOK_FOR) { int e; next(); skip('('); if (tok != ';') { gexpr(); vpop(); } skip(';'); d = ind; c = ind; a = 0; b = 0; if (tok != ';') { gexpr(); a = gtst(1, 0); } skip(';'); if (tok != ')') { e = gjmp(0); c = ind; gexpr(); vpop(); gjmp_addr(d);
gsym(e); } skip(')'); block(&a, &b, case_sym, def_sym, case_reg, 0); gjmp_addr(c); gsym(a); gsym_addr(b, c); } else if (tok == TOK_DO) { next(); a = 0; b = 0; d = ind; block(&a, &b, case_sym, def_sym, case_reg, 0); skip(TOK_WHILE); skip('('); gsym(b); gexpr(); c = gtst(0, 0); gsym_addr(c, d); skip(')'); gsym(a); skip(';'); } else if (tok == TOK_SWITCH) { next(); skip('('); gexpr(); /* XXX: other types than integer */ case_reg = gv(RC_INT); vpop(); skip(')'); a = 0; b = gjmp(0); /* jump to first case */ c = 0; block(&a, csym, &b, &c, case_reg, 0); /* if no default, jmp after switch */ if (c == 0) c = ind; /* default label */ gsym_addr(b, c); /* break label */ gsym(a); } else if (tok == TOK_CASE) { int v1, v2; if (!case_sym) expect("switch"); next(); v1 = expr_const(); v2 = v1; if (gnu_ext && tok == TOK_DOTS) { next();
v2 = expr_const(); if (v2 < v1) warning("empty case range"); } /* since a case is like a label, we must skip it with a jmp */ b = gjmp(0); gsym(*case_sym); vseti(case_reg, 0); vpushi(v1); if (v1 == v2) { gen_op(TOK_EQ); *case_sym = gtst(1, 0); } else { gen_op(TOK_GE); *case_sym = gtst(1, 0); vseti(case_reg, 0); vpushi(v2); gen_op(TOK_LE); *case_sym = gtst(1, *case_sym); } gsym(b); skip(':'); is_expr = 0; goto block_after_label; } else if (tok == TOK_DEFAULT) { next(); skip(':'); if (!def_sym) expect("switch"); if (*def_sym) error("too many 'default'"); *def_sym = ind; is_expr = 0; goto block_after_label; } else if (tok == TOK_GOTO) { next(); if (tok == '*' && gnu_ext) { /* computed goto */ next(); gexpr(); if ((vtop->type.t & VT_BTYPE) != VT_PTR) expect("pointer"); ggoto(); } else if (tok >= TOK_UIDENT) { s = label_find(tok); /* put forward definition if needed */ if (!s) { s = label_push(&global_label_stack, tok, LABEL_FORWARD); } else { if (s->r == LABEL_DECLARED) s->r = LABEL_FORWARD;
} /* label already defined */ if (s->r & LABEL_FORWARD) s->next = (void *)gjmp((long)s->next); else gjmp_addr((long)s->next); next(); } else { expect("label identifier"); } skip(';'); } else if (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3) { asm_instr(); } else { b = is_label(); if (b) { /* label case */ s = label_find(b); if (s) { if (s->r == LABEL_DEFINED) error("duplicate label '%s'", get_tok_str(s->v, NULL)); gsym((long)s->next); s->r = LABEL_DEFINED; } else { s = label_push(&global_label_stack, b, LABEL_DEFINED); } s->next = (void *)ind; /* we accept this, but it is a mistake */ block_after_label: if (tok == '}') { warning("deprecated use of label at end of compound statement"); } else { if (is_expr) vpop(); block(bsym, csym, case_sym, def_sym, case_reg, is_expr); } } else { /* expression case */ if (tok != ';') { if (is_expr) { vpop(); gexpr(); } else { gexpr(); vpop(); } } skip(';'); } } } /* t is the array or struct type. c is the array or struct
address. cur_index/cur_field is the pointer to the current value. 'size_only' is true if only size info is needed (only used in arrays) */ static void decl_designator(CType *type, Section *sec, unsigned long c, int *cur_index, Sym **cur_field, int size_only) { Sym *s, *f; int notfirst, index, index_last, align, l, nb_elems, elem_size; CType type1; notfirst = 0; elem_size = 0; nb_elems = 1; if (gnu_ext && (l = is_label()) != 0) goto struct_field; while (tok == '[' || tok == '.') { if (tok == '[') { if (!(type->t & VT_ARRAY)) expect("array type"); s = type->ref; next(); index = expr_const(); if (index < 0 || (s->c >= 0 && index >= s->c)) expect("invalid index"); if (tok == TOK_DOTS && gnu_ext) { next(); index_last = expr_const(); if (index_last < 0 || (s->c >= 0 && index_last >= s->c) || index_last < index) expect("invalid index"); } else { index_last = index; } skip(']'); if (!notfirst) *cur_index = index_last; type = pointed_type(type); elem_size = type_size(type, &align); c += index * elem_size; /* NOTE: we only support ranges for last designator */ nb_elems = index_last - index + 1; if (nb_elems != 1) { notfirst = 1; break; } } else { next(); l = tok; next(); struct_field: if ((type->t & VT_BTYPE) != VT_STRUCT)
expect("struct/union type"); s = type->ref; l |= SYM_FIELD; f = s->next; while (f) { if (f->v == l) break; f = f->next; } if (!f) expect("field"); if (!notfirst) *cur_field = f; /* XXX: fix this mess by using explicit storage field */ type1 = f->type; type1.t |= (type->t & ~VT_TYPE); type = &type1; c += f->c; } notfirst = 1; } if (notfirst) { if (tok == '=') { next(); } else { if (!gnu_ext) expect("="); } } else { if (type->t & VT_ARRAY) { index = *cur_index; type = pointed_type(type); c += index * type_size(type, &align); } else { f = *cur_field; if (!f) error("too many field init"); /* XXX: fix this mess by using explicit storage field */ type1 = f->type; type1.t |= (type->t & ~VT_TYPE); type = &type1; c += f->c; } } decl_initializer(type, sec, c, 0, size_only); /* XXX: make it more general */ if (!size_only && nb_elems > 1) { unsigned long c_end; uint8_t *src, *dst; int i; if (!sec)
error("range init not supported yet for dynamic storage"); c_end = c + nb_elems * elem_size; if (c_end > sec->data_allocated) section_realloc(sec, c_end); src = sec->data + c; dst = src; for(i = 1; i < nb_elems; i++) { dst += elem_size; memcpy(dst, src, elem_size); } } } #define EXPR_VAL 0 #define EXPR_CONST 1 #define EXPR_ANY 2 /* store a value or an expression directly in global data or in local array */ static void init_putv(CType *type, Section *sec, unsigned long c, int v, int expr_type) { int saved_global_expr, bt, bit_pos, bit_size; void *ptr; unsigned long long bit_mask; CType dtype; switch(expr_type) { case EXPR_VAL: vpushi(v); break; case EXPR_CONST: /* compound literals must be allocated globally in this case */ saved_global_expr = global_expr; global_expr = 1; expr_const1(); global_expr = saved_global_expr; /* NOTE: symbols are accepted */ if ((vtop->r & (VT_VALMASK | VT_LVAL)) != VT_CONST) error("initializer element is not constant"); break; case EXPR_ANY: expr_eq(); break; } dtype = *type; dtype.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */ if (sec) { /* XXX: not portable */ /* XXX: generate error if incorrect relocation */ gen_assign_cast(&dtype); bt = type->t & VT_BTYPE;
ptr = sec->data + c; /* XXX: make code faster ? */ if (!(type->t & VT_BITFIELD)) { bit_pos = 0; bit_size = 32; bit_mask = -1LL; } else { bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f; bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f; bit_mask = (1LL << bit_size) - 1; } if ((vtop->r & VT_SYM) && (bt == VT_BYTE || bt == VT_SHORT || bt == VT_DOUBLE || bt == VT_LDOUBLE || bt == VT_LLONG || (bt == VT_INT && bit_size != 32))) error("initializer element is not computable at load time"); switch(bt) { case VT_BYTE: *(char *)ptr |= (vtop->c.i & bit_mask) << bit_pos; break; case VT_SHORT: *(short *)ptr |= (vtop->c.i & bit_mask) << bit_pos; break; case VT_DOUBLE: *(double *)ptr = vtop->c.d; break; case VT_LDOUBLE: *(long double *)ptr = vtop->c.ld; break; case VT_LLONG: *(long long *)ptr |= (vtop->c.ll & bit_mask) << bit_pos; break; default: if (vtop->r & VT_SYM) { greloc(sec, vtop->sym, c, R_DATA_32); } *(int *)ptr |= (vtop->c.i & bit_mask) << bit_pos; break; } vtop--; } else { vset(&dtype, VT_LOCAL, c); vswap(); vstore(); vpop(); } } /* put zeros for variable based init */ static void init_putz(CType *t, Section *sec, unsigned long c, int size)
{ if (sec) { /* nothing to do because globals are already set to zero */ } else { vpush_global_sym(&func_old_type, TOK_memset); vseti(VT_LOCAL, c); vpushi(0); vpushi(size); gfunc_call(3); } } /* 't' contains the type and storage info. 'c' is the offset of the object in section 'sec'. If 'sec' is NULL, it means stack based allocation. 'first' is true if array '{' must be read (multi dimension implicit array init handling). 'size_only' is true if size only evaluation is wanted (only for arrays). */ static void decl_initializer(CType *type, Section *sec, unsigned long c, int first, int size_only) { int index, array_length, n, no_oblock, nb, parlevel, i; int size1, align1, expr_type; Sym *s, *f; CType *t1; if (type->t & VT_ARRAY) { s = type->ref; n = s->c; array_length = 0; t1 = pointed_type(type); size1 = type_size(t1, &align1); no_oblock = 1; if ((first && tok != TOK_LSTR && tok != TOK_STR) || tok == '{') { skip('{'); no_oblock = 0; } /* only parse strings here if correct type (otherwise: handle them as ((w)char *) expressions */ if ((tok == TOK_LSTR && (t1->t & VT_BTYPE) == VT_INT) || (tok == TOK_STR && (t1->t & VT_BTYPE) == VT_BYTE)) { while (tok == TOK_STR || tok == TOK_LSTR) { int cstr_len, ch; CString *cstr; cstr = tokc.cstr; /* compute maximum number of chars wanted */ if (tok == TOK_STR) cstr_len = cstr->size;
else cstr_len = cstr->size / sizeof(int); cstr_len--; nb = cstr_len; if (n >= 0 && nb > (n - array_length)) nb = n - array_length; if (!size_only) { if (cstr_len > nb) warning("initializer-string for array is too long"); /* in order to go faster for common case (char string in global variable, we handle it specifically */ if (sec && tok == TOK_STR && size1 == 1) { memcpy(sec->data + c + array_length, cstr->data, nb); } else { for(i=0;idata)[i]; else ch = ((int *)cstr->data)[i]; init_putv(t1, sec, c + (array_length + i) * size1, ch, EXPR_VAL); } } } array_length += nb; next(); } /* only add trailing zero if enough storage (no warning in this case since it is standard) */ if (n < 0 || array_length < n) { if (!size_only) { init_putv(t1, sec, c + (array_length * size1), 0, EXPR_VAL); } array_length++; } } else { index = 0; while (tok != '}') { decl_designator(type, sec, c, &index, NULL, size_only); if (n >= 0 && index >= n) error("index too large"); /* must put zero in holes (note that doing it that way ensures that it even works with designators) */ if (!size_only && array_length < index) { init_putz(t1, sec, c + array_length * size1, (index - array_length) * size1); } index++; if (index > array_length) array_length = index; /* special test for multi dimensional arrays (may not be strictly correct if designators are used at the
same time) */ if (index >= n && no_oblock) break; if (tok == '}') break; skip(','); } } if (!no_oblock) skip('}'); /* put zeros at the end */ if (!size_only && n >= 0 && array_length < n) { init_putz(t1, sec, c + array_length * size1, (n - array_length) * size1); } /* patch type size if needed */ if (n < 0) s->c = array_length; } else if ((type->t & VT_BTYPE) == VT_STRUCT && (sec || !first || tok == '{')) { int par_count; /* NOTE: the previous test is a specific case for automatic struct/union init */ /* XXX: union needs only one init */ /* XXX: this test is incorrect for local initializers beginning with ( without {. It would be much more difficult to do it correctly (ideally, the expression parser should be used in all cases) */ par_count = 0; if (tok == '(') { AttributeDef ad1; CType type1; next(); while (tok == '(') { par_count++; next(); } if (!parse_btype(&type1, &ad1)) expect("cast"); type_decl(&type1, &ad1, &n, TYPE_ABSTRACT); #if 0 if (!is_assignable_types(type, &type1)) error("invalid type for cast"); #endif skip(')'); } no_oblock = 1; if (first || tok == '{') { skip('{'); no_oblock = 0; }
s = type->ref; f = s->next; array_length = 0; index = 0; n = s->c; while (tok != '}') { decl_designator(type, sec, c, NULL, &f, size_only); index = f->c; if (!size_only && array_length < index) { init_putz(type, sec, c + array_length, index - array_length); } index = index + type_size(&f->type, &align1); if (index > array_length) array_length = index; f = f->next; if (no_oblock && f == NULL) break; if (tok == '}') break; skip(','); } /* put zeros at the end */ if (!size_only && array_length < n) { init_putz(type, sec, c + array_length, n - array_length); } if (!no_oblock) skip('}'); while (par_count) { skip(')'); par_count--; } } else if (tok == '{') { next(); decl_initializer(type, sec, c, first, size_only); skip('}'); } else if (size_only) { /* just skip expression */ parlevel = 0; while ((parlevel > 0 || (tok != '}' && tok != ',')) && tok != -1) { if (tok == '(') parlevel++; else if (tok == ')') parlevel--; next(); } } else { /* currently, we always use constant expression for globals (may change for scripting case) */ expr_type = EXPR_CONST; if (!sec)
expr_type = EXPR_ANY; init_putv(type, sec, c, 0, expr_type); } } /* parse an initializer for type 't' if 'has_init' is non zero, and allocate space in local or global data space ('r' is either VT_LOCAL or VT_CONST). If 'v' is non zero, then an associated variable 'v' of scope 'scope' is declared before initializers are parsed. If 'v' is zero, then a reference to the new object is put in the value stack. If 'has_init' is 2, a special parsing is done to handle string constants. */ static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r, int has_init, int v, int scope) { int size, align, addr, data_offset; int level; ParseState saved_parse_state; TokenString init_str; Section *sec; size = type_size(type, &align); /* If unknown size, we must evaluate it before evaluating initializers because initializers can generate global data too (e.g. string pointers or ISOC99 compound literals). It also simplifies local initializers handling */ tok_str_new(&init_str); if (size < 0) { if (!has_init) error("unknown type size"); /* get all init string */ if (has_init == 2) { /* only get strings */ while (tok == TOK_STR || tok == TOK_LSTR) { tok_str_add_tok(&init_str); next(); } } else { level = 0; while (level > 0 || (tok != ',' && tok != ';')) { if (tok < 0) error("unexpected end of file in initializer"); tok_str_add_tok(&init_str); if (tok == '{') level++; else if (tok == '}') { if (level == 0) break; level--; } next();
} } tok_str_add(&init_str, -1); tok_str_add(&init_str, 0); /* compute size */ save_parse_state(&saved_parse_state); macro_ptr = init_str.str; next(); decl_initializer(type, NULL, 0, 1, 1); /* prepare second initializer parsing */ macro_ptr = init_str.str; next(); /* if still unknown size, error */ size = type_size(type, &align); if (size < 0) error("unknown type size"); } /* take into account specified alignment if bigger */ if (ad->aligned) { if (ad->aligned > align) align = ad->aligned; } else if (ad->packed) { align = 1; } if ((r & VT_VALMASK) == VT_LOCAL) { sec = NULL; if (do_bounds_check && (type->t & VT_ARRAY)) loc--; loc = (loc - size) & -align; addr = loc; /* handles bounds */ /* XXX: currently, since we do only one pass, we cannot track '&' operators, so we add only arrays */ if (do_bounds_check && (type->t & VT_ARRAY)) { unsigned long *bounds_ptr; /* add padding between regions */ loc--; /* then add local bound info */ bounds_ptr = section_ptr_add(lbounds_section, 2 * sizeof(unsigned long)); bounds_ptr[0] = addr; bounds_ptr[1] = size; } if (v) { /* local variable */ sym_push(v, type, r, addr); } else { /* push local reference */ vset(type, r, addr); } } else {
Sym *sym; sym = NULL; if (v && scope == VT_CONST) { /* see if the symbol was already defined */ sym = sym_find(v); if (sym) { if (!is_compatible_types(&sym->type, type)) error("incompatible types for redefinition of '%s'", get_tok_str(v, NULL)); if (sym->type.t & VT_EXTERN) { /* if the variable is extern, it was not allocated */ sym->type.t &= ~VT_EXTERN; /* set array size if it was ommited in extern declaration */ if ((sym->type.t & VT_ARRAY) && sym->type.ref->c < 0 && type->ref->c >= 0) sym->type.ref->c = type->ref->c; } else { /* we accept several definitions of the same global variable. this is tricky, because we must play with the SHN_COMMON type of the symbol */ /* XXX: should check if the variable was already initialized. It is incorrect to initialized it twice */ /* no init data, we won't add more to the symbol */ if (!has_init) goto no_alloc; } } } /* allocate symbol in corresponding section */ sec = ad->section; if (!sec) { if (has_init) sec = data_section; else if (tcc_state->nocommon) sec = bss_section; } if (sec) { data_offset = sec->data_offset; data_offset = (data_offset + align - 1) & -align; addr = data_offset; /* very important to increment global pointer at this time because initializers themselves can create new initializers */ data_offset += size; /* add padding if bound check */ if (do_bounds_check) data_offset++; sec->data_offset = data_offset; /* allocate section space to put the data */
if (sec->sh_type != SHT_NOBITS && data_offset > sec->data_allocated) section_realloc(sec, data_offset); /* align section if needed */ if (align > sec->sh_addralign) sec->sh_addralign = align; } else { addr = 0; /* avoid warning */ } if (v) { if (scope == VT_CONST) { if (!sym) goto do_def; } else { do_def: sym = sym_push(v, type, r | VT_SYM, 0); } /* update symbol definition */ if (sec) { put_extern_sym(sym, sec, addr, size); } else { Elf32_Sym *esym; /* put a common area */ put_extern_sym(sym, NULL, align, size); /* XXX: find a nicer way */ esym = &((Elf32_Sym *)symtab_section->data)[sym->c]; esym->st_shndx = SHN_COMMON; } } else { CValue cval; /* push global reference */ sym = get_sym_ref(type, sec, addr, size); cval.ul = 0; vsetc(type, VT_CONST | VT_SYM, &cval); vtop->sym = sym; } /* handles bounds now because the symbol must be defined before for the relocation */ if (do_bounds_check) { unsigned long *bounds_ptr; greloc(bounds_section, sym, bounds_section->data_offset, R_DATA_32); /* then add global bound info */ bounds_ptr = section_ptr_add(bounds_section, 2 * sizeof(long)); bounds_ptr[0] = 0; /* relocated */ bounds_ptr[1] = size; } } if (has_init) { decl_initializer(type, sec, addr, 1, 0);
/* restore parse state if needed */ if (init_str.str) { tok_str_free(init_str.str); restore_parse_state(&saved_parse_state); } } no_alloc: ; } void put_func_debug(Sym *sym) { char buf[512]; /* stabs info */ /* XXX: we put here a dummy type */ snprintf(buf, sizeof(buf), "%s:%c1", funcname, sym->type.t & VT_STATIC ? 'f' : 'F'); put_stabs_r(buf, N_FUN, 0, file->line_num, 0, cur_text_section, sym->c); last_ind = 0; last_line_num = 0; } /* parse an old style function declaration list */ /* XXX: check multiple parameter */ static void func_decl_list(Sym *func_sym) { AttributeDef ad; int v; Sym *s; CType btype, type; /* parse each declaration */ while (tok != '{' && tok != ';' && tok != ',' && tok != TOK_EOF) { if (!parse_btype(&btype, &ad)) expect("declaration list"); if (((btype.t & VT_BTYPE) == VT_ENUM || (btype.t & VT_BTYPE) == VT_STRUCT) && tok == ';') { /* we accept no variable after */ } else { for(;;) { type = btype; type_decl(&type, &ad, &v, TYPE_DIRECT); /* find parameter in function parameter list */ s = func_sym->next; while (s != NULL) { if ((s->v & ~SYM_FIELD) == v) goto found; s = s->next; } error("declaration for parameter '%s' but no such parameter", get_tok_str(v, NULL));
found: /* check that no storage specifier except 'register' was given */ if (type.t & VT_STORAGE) error("storage class specified for '%s'", get_tok_str(v, NULL)); convert_parameter_type(&type); /* we can add the type (NOTE: it could be local to the function) */ s->type = type; /* accept other parameters */ if (tok == ',') next(); else break; } } skip(';'); } } /* parse a function defined by symbol 'sym' and generate its code in 'cur_text_section' */ static void gen_function(Sym *sym) { ind = cur_text_section->data_offset; /* NOTE: we patch the symbol size later */ put_extern_sym(sym, cur_text_section, ind, 0); funcname = get_tok_str(sym->v, NULL); func_ind = ind; /* put debug symbol */ if (do_debug) put_func_debug(sym); /* push a dummy symbol to enable local sym storage */ sym_push2(&local_stack, SYM_FIELD, 0, 0); gfunc_prolog(&sym->type); rsym = 0; block(NULL, NULL, NULL, NULL, 0, 0); gsym(rsym); gfunc_epilog(); cur_text_section->data_offset = ind; label_pop(&global_label_stack, NULL); sym_pop(&local_stack, NULL); /* reset local stack */ /* end of function */ /* patch symbol size */ ((Elf32_Sym *)symtab_section->data)[sym->c].st_size = ind - func_ind; if (do_debug) { put_stabn(N_FUN, 0, 0, ind - func_ind); } funcname = ""; /* for safety */ func_vt.t = VT_VOID; /* for safety */ ind = 0; /* for safety */ } static void gen_inline_functions(void)
{ Sym *sym; CType *type; int *str, inline_generated; /* iterate while inline function are referenced */ for(;;) { inline_generated = 0; for(sym = global_stack; sym != NULL; sym = sym->prev) { type = &sym->type; if (((type->t & VT_BTYPE) == VT_FUNC) && (type->t & (VT_STATIC | VT_INLINE)) == (VT_STATIC | VT_INLINE) && sym->c != 0) { /* the function was used: generate its code and convert it to a normal function */ str = (int *)sym->r; sym->r = VT_SYM | VT_CONST; type->t &= ~VT_INLINE; macro_ptr = str; next(); cur_text_section = text_section; gen_function(sym); macro_ptr = NULL; /* fail safe */ tok_str_free(str); inline_generated = 1; } } if (!inline_generated) break; } /* free all remaining inline function tokens */ for(sym = global_stack; sym != NULL; sym = sym->prev) { type = &sym->type; if (((type->t & VT_BTYPE) == VT_FUNC) && (type->t & (VT_STATIC | VT_INLINE)) == (VT_STATIC | VT_INLINE)) { str = (int *)sym->r; tok_str_free(str); sym->r = 0; /* fail safe */ } } } /* 'l' is VT_LOCAL or VT_CONST to define default storage type */ static void decl(int l) { int v, has_init, r; CType type, btype; Sym *sym;
AttributeDef ad; while (1) { if (!parse_btype(&btype, &ad)) { /* skip redundant ';' */ /* XXX: find more elegant solution */ if (tok == ';') { next(); continue; } if (l == VT_CONST && (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) { /* global asm block */ asm_global_instr(); continue; } /* special test for old K&R protos without explicit int type. Only accepted when defining global data */ if (l == VT_LOCAL || tok < TOK_DEFINE) break; btype.t = VT_INT; } if (((btype.t & VT_BTYPE) == VT_ENUM || (btype.t & VT_BTYPE) == VT_STRUCT) && tok == ';') { /* we accept no variable after */ next(); continue; } while (1) { /* iterate thru each declaration */ type = btype; type_decl(&type, &ad, &v, TYPE_DIRECT); #if 0 { char buf[500]; type_to_str(buf, sizeof(buf), t, get_tok_str(v, NULL)); printf("type = '%s'\n", buf); } #endif if ((type.t & VT_BTYPE) == VT_FUNC) { /* if old style function prototype, we accept a declaration list */ sym = type.ref; if (sym->c == FUNC_OLD) func_decl_list(sym); } if (tok == '{') { if (l == VT_LOCAL) error("cannot use local functions"); if (!(type.t & VT_FUNC)) expect("function definition");
/* reject abstract declarators in function definition */ sym = type.ref; while ((sym = sym->next) != NULL) if (!(sym->v & ~SYM_FIELD)) expect("identifier"); /* XXX: cannot do better now: convert extern line to static inline */ if ((type.t & (VT_EXTERN | VT_INLINE)) == (VT_EXTERN | VT_INLINE)) type.t = (type.t & ~VT_EXTERN) | VT_STATIC; sym = sym_find(v); if (sym) { if ((sym->type.t & VT_BTYPE) != VT_FUNC) goto func_error1; /* specific case: if not func_call defined, we put the one of the prototype */ /* XXX: should have default value */ if (sym->type.ref->r != FUNC_CDECL && type.ref->r == FUNC_CDECL) type.ref->r = sym->type.ref->r; if (!is_compatible_types(&sym->type, &type)) { func_error1: error("incompatible types for redefinition of '%s'", get_tok_str(v, NULL)); } /* if symbol is already defined, then put complete type */ sym->type = type; } else { /* put function symbol */ sym = global_identifier_push(v, type.t, 0); sym->type.ref = type.ref; } /* static inline functions are just recorded as a kind of macro. Their code will be emitted at the end of the compilation unit only if they are used */ if ((type.t & (VT_INLINE | VT_STATIC)) == (VT_INLINE | VT_STATIC)) { TokenString func_str; int block_level; tok_str_new(&func_str); block_level = 0; for(;;) { int t; if (tok == TOK_EOF) error("unexpected end of file"); tok_str_add_tok(&func_str); t = tok; next(); if (t == '{') { block_level++;
} else if (t == '}') { block_level--; if (block_level == 0) break; } } tok_str_add(&func_str, -1); tok_str_add(&func_str, 0); sym->r = (int)func_str.str; } else { /* compute text section */ cur_text_section = ad.section; if (!cur_text_section) cur_text_section = text_section; sym->r = VT_SYM | VT_CONST; gen_function(sym); #ifdef TCC_TARGET_PE if (ad.dllexport) { ((Elf32_Sym *)symtab_section->data)[sym->c].st_other |= 1; } #endif } break; } else { if (btype.t & VT_TYPEDEF) { /* save typedefed type */ /* XXX: test storage specifiers ? */ sym = sym_push(v, &type, 0, 0); sym->type.t |= VT_TYPEDEF; } else if ((type.t & VT_BTYPE) == VT_FUNC) { /* external function definition */ /* specific case for func_call attribute */ if (ad.func_call) type.ref->r = ad.func_call; external_sym(v, &type, 0); } else { /* not lvalue if array */ r = 0; if (!(type.t & VT_ARRAY)) r |= lvalue_type(type.t); has_init = (tok == '='); if ((btype.t & VT_EXTERN) || ((type.t & VT_ARRAY) && (type.t & VT_STATIC) && !has_init && l == VT_CONST && type.ref->c < 0)) { /* external variable */ /* NOTE: as GCC, uninitialized global static arrays of null size are considered as extern */ external_sym(v, &type, r); } else { if (type.t & VT_STATIC) r |= VT_CONST; else
r |= l; if (has_init) next(); decl_initializer_alloc(&type, &ad, r, has_init, v, l); } } if (tok != ',') { skip(';'); break; } next(); } } } } /* better than nothing, but needs extension to handle '-E' option correctly too */ static void preprocess_init(TCCState *s1) { s1->include_stack_ptr = s1->include_stack; /* XXX: move that before to avoid having to initialize file->ifdef_stack_ptr ? */ s1->ifdef_stack_ptr = s1->ifdef_stack; file->ifdef_stack_ptr = s1->ifdef_stack_ptr; /* XXX: not ANSI compliant: bound checking says error */ vtop = vstack - 1; s1->pack_stack[0] = 0; s1->pack_stack_ptr = s1->pack_stack; } /* compile the C file opened in 'file'. Return non zero if errors. */ static int tcc_compile(TCCState *s1) { Sym *define_start; char buf[512]; volatile int section_sym; #ifdef INC_DEBUG printf("%s: **** new file\n", file->filename); #endif preprocess_init(s1); funcname = ""; anon_sym = SYM_FIRST_ANOM; /* file info: full path + filename */ section_sym = 0; /* avoid warning */ if (do_debug) { section_sym = put_elf_sym(symtab_section, 0, 0, ELF32_ST_INFO(STB_LOCAL, STT_SECTION), 0,
text_section->sh_num, NULL); getcwd(buf, sizeof(buf)); pstrcat(buf, sizeof(buf), "/"); put_stabs_r(buf, N_SO, 0, 0, text_section->data_offset, text_section, section_sym); put_stabs_r(file->filename, N_SO, 0, 0, text_section->data_offset, text_section, section_sym); } /* an elf symbol of type STT_FILE must be put so that STB_LOCAL symbols can be safely used */ put_elf_sym(symtab_section, 0, 0, ELF32_ST_INFO(STB_LOCAL, STT_FILE), 0, SHN_ABS, file->filename); /* define some often used types */ int_type.t = VT_INT; char_pointer_type.t = VT_BYTE; mk_pointer(&char_pointer_type); func_old_type.t = VT_FUNC; func_old_type.ref = sym_push(SYM_FIELD, &int_type, FUNC_CDECL, FUNC_OLD); #if 0 /* define 'void *alloca(unsigned int)' builtin function */ { Sym *s1; p = anon_sym++; sym = sym_push(p, mk_pointer(VT_VOID), FUNC_CDECL, FUNC_NEW); s1 = sym_push(SYM_FIELD, VT_UNSIGNED | VT_INT, 0, 0); s1->next = NULL; sym->next = s1; sym_push(TOK_alloca, VT_FUNC | (p << VT_STRUCT_SHIFT), VT_CONST, 0); } #endif define_start = define_stack; if (setjmp(s1->error_jmp_buf) == 0) { s1->nb_errors = 0; s1->error_set_jmp_enabled = 1; ch = file->buf_ptr[0]; tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF; parse_flags = PARSE_FLAG_PREPROCESS | PARSE_FLAG_TOK_NUM; next(); decl(VT_CONST); if (tok != TOK_EOF) expect("declaration"); /* end of translation unit info */ if (do_debug) {
put_stabs_r(NULL, N_SO, 0, 0, text_section->data_offset, text_section, section_sym); } } s1->error_set_jmp_enabled = 0; /* reset define stack, but leave -Dsymbols (may be incorrect if they are undefined) */ free_defines(define_start); gen_inline_functions(); sym_pop(&global_stack, NULL); return s1->nb_errors != 0 ? -1 : 0; } #ifdef LIBTCC int tcc_compile_string(TCCState *s, const char *str) { BufferedFile bf1, *bf = &bf1; int ret, len; char *buf; /* init file structure */ bf->fd = -1; /* XXX: avoid copying */ len = strlen(str); buf = tcc_malloc(len + 1); if (!buf) return -1; memcpy(buf, str, len); buf[len] = CH_EOB; bf->buf_ptr = buf; bf->buf_end = buf + len; pstrcpy(bf->filename, sizeof(bf->filename), "<string>"); bf->line_num = 1; file = bf; ret = tcc_compile(s); tcc_free(buf); /* currently, no need to close */ return ret; } #endif /* define a preprocessor symbol. A value can also be provided with the '=' operator */ void tcc_define_symbol(TCCState *s1, const char *sym, const char *value) { BufferedFile bf1, *bf = &bf1;
pstrcpy(bf->buffer, IO_BUF_SIZE, sym); pstrcat(bf->buffer, IO_BUF_SIZE, " "); /* default value */ if (!value) value = "1"; pstrcat(bf->buffer, IO_BUF_SIZE, value); /* init file structure */ bf->fd = -1; bf->buf_ptr = bf->buffer; bf->buf_end = bf->buffer + strlen(bf->buffer); *bf->buf_end = CH_EOB; bf->filename[0] = '\0'; bf->line_num = 1; file = bf; s1->include_stack_ptr = s1->include_stack; /* parse with define parser */ ch = file->buf_ptr[0]; next_nomacro(); parse_define(); file = NULL; } /* undefine a preprocessor symbol */ void tcc_undefine_symbol(TCCState *s1, const char *sym) { TokenSym *ts; Sym *s; ts = tok_alloc(sym, strlen(sym)); s = define_find(ts->tok); /* undefine symbol by putting an invalid name */ if (s) define_undef(s); } #ifdef CONFIG_TCC_ASM #ifdef TCC_TARGET_I386 #include "i386-asm.c" #endif #include "tccasm.c" #else static void asm_instr(void) { error("inline asm() not supported"); } static void asm_global_instr(void) { error("inline asm() not supported"); }
#endif #include "tccelf.c" #ifdef TCC_TARGET_COFF #include "tcccoff.c" #endif #ifdef TCC_TARGET_PE #include "tccpe.c" #endif /* print the position in the source file of PC value 'pc' by reading the stabs debug information */ static void rt_printline(unsigned long wanted_pc) { Stab_Sym *sym, *sym_end; char func_name[128], last_func_name[128]; unsigned long func_addr, last_pc, pc; const char *incl_files[INCLUDE_STACK_SIZE]; int incl_index, len, last_line_num, i; const char *str, *p; fprintf(stderr, "0x%08lx:", wanted_pc); func_name[0] = '\0'; func_addr = 0; incl_index = 0; last_func_name[0] = '\0'; last_pc = 0xffffffff; last_line_num = 1; sym = (Stab_Sym *)stab_section->data + 1; sym_end = (Stab_Sym *)(stab_section->data + stab_section->data_offset); while (sym < sym_end) { switch(sym->n_type) { /* function start or end */ case N_FUN: if (sym->n_strx == 0) { /* we test if between last line and end of function */ pc = sym->n_value + func_addr; if (wanted_pc >= last_pc && wanted_pc < pc) goto found; func_name[0] = '\0'; func_addr = 0; } else { str = stabstr_section->data + sym->n_strx; p = strchr(str, ':'); if (!p) { pstrcpy(func_name, sizeof(func_name), str); } else { len = p - str; if (len > sizeof(func_name) - 1) len = sizeof(func_name) - 1;
memcpy(func_name, str, len); func_name[len] = '\0'; } func_addr = sym->n_value; } break; /* line number info */ case N_SLINE: pc = sym->n_value + func_addr; if (wanted_pc >= last_pc && wanted_pc < pc) goto found; last_pc = pc; last_line_num = sym->n_desc; /* XXX: slow! */ strcpy(last_func_name, func_name); break; /* include files */ case N_BINCL: str = stabstr_section->data + sym->n_strx; add_incl: if (incl_index < INCLUDE_STACK_SIZE) { incl_files[incl_index++] = str; } break; case N_EINCL: if (incl_index > 1) incl_index--; break; case N_SO: if (sym->n_strx == 0) { incl_index = 0; /* end of translation unit */ } else { str = stabstr_section->data + sym->n_strx; /* do not add path */ len = strlen(str); if (len > 0 && str[len - 1] != '/') goto add_incl; } break; } sym++; } /* second pass: we try symtab symbols (no line number info) */ incl_index = 0; { Elf32_Sym *sym, *sym_end; int type; sym_end = (Elf32_Sym *)(symtab_section->data + symtab_section->data_offset); for(sym = (Elf32_Sym *)symtab_section->data + 1; sym < sym_end; sym++) {
type = ELF32_ST_TYPE(sym->st_info); if (type == STT_FUNC) { if (wanted_pc >= sym->st_value && wanted_pc < sym->st_value + sym->st_size) { pstrcpy(last_func_name, sizeof(last_func_name), strtab_section->data + sym->st_name); goto found; } } } } /* did not find any info: */ fprintf(stderr, " ???\n"); return; found: if (last_func_name[0] != '\0') { fprintf(stderr, " %s()", last_func_name); } if (incl_index > 0) { fprintf(stderr, " (%s:%d", incl_files[incl_index - 1], last_line_num); for(i = incl_index - 2; i >= 0; i--) fprintf(stderr, ", included from %s", incl_files[i]); fprintf(stderr, ")"); } fprintf(stderr, "\n"); } #if !defined(WIN32) && !defined(CONFIG_TCCBOOT) #ifdef __i386__ /* fix for glibc 2.1 */ #ifndef REG_EIP #define REG_EIP EIP #define REG_EBP EBP #endif /* return the PC at frame level 'level'. Return non zero if not found */ static int rt_get_caller_pc(unsigned long *paddr, ucontext_t *uc, int level) { unsigned long fp; int i; if (level == 0) { #if defined(__FreeBSD__) *paddr = uc->uc_mcontext.mc_eip; #elif defined(__dietlibc__) *paddr = uc->uc_mcontext.eip; #else *paddr = uc->uc_mcontext.gregs[REG_EIP]; #endif
return 0; } else { #if defined(__FreeBSD__) fp = uc->uc_mcontext.mc_ebp; #elif defined(__dietlibc__) fp = uc->uc_mcontext.ebp; #else fp = uc->uc_mcontext.gregs[REG_EBP]; #endif for(i=1;i= 0xc0000000) return -1; fp = ((unsigned long *)fp)[0]; } *paddr = ((unsigned long *)fp)[1]; return 0; } } #else #warning add arch specific rt_get_caller_pc() static int rt_get_caller_pc(unsigned long *paddr, ucontext_t *uc, int level) { return -1; } #endif /* emit a run time error at position 'pc' */ void rt_error(ucontext_t *uc, const char *fmt, ...) { va_list ap; unsigned long pc; int i; va_start(ap, fmt); fprintf(stderr, "Runtime error: "); vfprintf(stderr, fmt, ap); fprintf(stderr, "\n"); for(i=0;i
/* signal handler for fatal errors */ static void sig_error(int signum, siginfo_t *siginf, void *puc) { ucontext_t *uc = puc; switch(signum) { case SIGFPE: switch(siginf->si_code) { case FPE_INTDIV: case FPE_FLTDIV: rt_error(uc, "division by zero"); break; default: rt_error(uc, "floating point exception"); break; } break; case SIGBUS: case SIGSEGV: if (rt_bound_error_msg && *rt_bound_error_msg) rt_error(uc, *rt_bound_error_msg); else rt_error(uc, "dereferencing invalid pointer"); break; case SIGILL: rt_error(uc, "illegal instruction"); break; case SIGABRT: rt_error(uc, "abort() called"); break; default: rt_error(uc, "caught signal %d", signum); break; } exit(255); } #endif /* do all relocations (needed before using tcc_get_symbol()) */ int tcc_relocate(TCCState *s1) { Section *s; int i; s1->nb_errors = 0; #ifdef TCC_TARGET_PE pe_add_runtime(s1); #else tcc_add_runtime(s1); #endif
relocate_common_syms(); tcc_add_linker_symbols(s1); build_got_entries(s1); /* compute relocation address : section are relocated in place. We also alloc the bss space */ for(i = 1; i < s1->nb_sections; i++) { s = s1->sections[i]; if (s->sh_flags & SHF_ALLOC) { if (s->sh_type == SHT_NOBITS) s->data = tcc_mallocz(s->data_offset); s->sh_addr = (unsigned long)s->data; } } relocate_syms(s1, 1); if (s1->nb_errors != 0) return -1; /* relocate each section */ for(i = 1; i < s1->nb_sections; i++) { s = s1->sections[i]; if (s->reloc) relocate_section(s1, s); } return 0; } /* launch the compiled program with the given arguments */ int tcc_run(TCCState *s1, int argc, char **argv) { int (*prog_main)(int, char **); if (tcc_relocate(s1) < 0) return -1; prog_main = tcc_get_symbol_err(s1, "main"); if (do_debug) { #if defined(WIN32) || defined(CONFIG_TCCBOOT) error("debug mode currently not available for Windows"); #else struct sigaction sigact; /* install TCC signal handlers to print debug info on fatal runtime errors */ sigact.sa_flags = SA_SIGINFO | SA_RESETHAND; sigact.sa_sigaction = sig_error; sigemptyset(&sigact.sa_mask); sigaction(SIGFPE, &sigact, NULL); sigaction(SIGILL, &sigact, NULL);
sigaction(SIGSEGV, &sigact, NULL); sigaction(SIGBUS, &sigact, NULL); sigaction(SIGABRT, &sigact, NULL); #endif } #ifdef CONFIG_TCC_BCHECK if (do_bounds_check) { void (*bound_init)(void); /* set error function */ rt_bound_error_msg = (void *)tcc_get_symbol_err(s1, "__bound_error_msg"); /* XXX: use .init section so that it also work in binary ? */ bound_init = (void *)tcc_get_symbol_err(s1, "__bound_init"); bound_init(); } #endif return (*prog_main)(argc, argv); } TCCState *tcc_new(void) { const char *p, *r; TCCState *s; TokenSym *ts; int i, c; s = tcc_mallocz(sizeof(TCCState)); if (!s) return NULL; tcc_state = s; s->output_type = TCC_OUTPUT_MEMORY; /* init isid table */ for(i=0;i<256;i++) isidnum_table[i] = isid(i) || isnum(i); /* add all tokens */ table_ident = NULL; memset(hash_ident, 0, TOK_HASH_SIZE * sizeof(TokenSym *)); tok_ident = TOK_IDENT; p = tcc_keywords; while (*p) { r = p; for(;;) { c = *r++; if (c == '\0') break; } ts = tok_alloc(p, r - p - 1);
p = r; } /* we add dummy defines for some special macros to speed up tests and to have working defined() */ define_push(TOK___LINE__, MACRO_OBJ, NULL, NULL); define_push(TOK___FILE__, MACRO_OBJ, NULL, NULL); define_push(TOK___DATE__, MACRO_OBJ, NULL, NULL); define_push(TOK___TIME__, MACRO_OBJ, NULL, NULL); /* standard defines */ tcc_define_symbol(s, "__STDC__", NULL); #if defined(TCC_TARGET_I386) tcc_define_symbol(s, "__i386__", NULL); #endif #if defined(TCC_TARGET_ARM) tcc_define_symbol(s, "__ARM_ARCH_4__", NULL); tcc_define_symbol(s, "__arm_elf__", NULL); tcc_define_symbol(s, "__arm_elf", NULL); tcc_define_symbol(s, "arm_elf", NULL); tcc_define_symbol(s, "__arm__", NULL); tcc_define_symbol(s, "__arm", NULL); tcc_define_symbol(s, "arm", NULL); tcc_define_symbol(s, "__APCS_32__", NULL); #endif #if defined(linux) tcc_define_symbol(s, "__linux__", NULL); tcc_define_symbol(s, "linux", NULL); #endif /* tiny C specific defines */ tcc_define_symbol(s, "__TINYC__", NULL); /* tiny C & gcc defines */ tcc_define_symbol(s, "__SIZE_TYPE__", "unsigned int"); tcc_define_symbol(s, "__PTRDIFF_TYPE__", "int"); tcc_define_symbol(s, "__WCHAR_TYPE__", "int"); /* default library paths */ #ifdef TCC_TARGET_PE { char buf[1024]; snprintf(buf, sizeof(buf), "%s/lib", tcc_lib_path); tcc_add_library_path(s, buf); } #else tcc_add_library_path(s, "/usr/local/lib"); tcc_add_library_path(s, "/usr/lib"); tcc_add_library_path(s, "/lib"); #endif /* no section zero */ dynarray_add((void ***)&s->sections, &s->nb_sections, NULL);
/* create standard sections */ text_section = new_section(s, ".text", SHT_PROGBITS, SHF_ALLOC | SHF_EXECINSTR); data_section = new_section(s, ".data", SHT_PROGBITS, SHF_ALLOC | SHF_WRITE); bss_section = new_section(s, ".bss", SHT_NOBITS, SHF_ALLOC | SHF_WRITE); /* symbols are always generated for linking stage */ symtab_section = new_symtab(s, ".symtab", SHT_SYMTAB, 0, ".strtab", ".hashtab", SHF_PRIVATE); strtab_section = symtab_section->link; /* private symbol table for dynamic symbols */ s->dynsymtab_section = new_symtab(s, ".dynsymtab", SHT_SYMTAB, SHF_PRIVATE, ".dynstrtab", ".dynhashtab", SHF_PRIVATE); s->alacarte_link = 1; #ifdef CHAR_IS_UNSIGNED s->char_is_unsigned = 1; #endif #if defined(TCC_TARGET_PE) && 0 /* XXX: currently the PE linker is not ready to support that */ s->leading_underscore = 1; #endif return s; } void tcc_delete(TCCState *s1) { int i, n; /* free -D defines */ free_defines(NULL); /* free tokens */ n = tok_ident - TOK_IDENT; for(i = 0; i < n; i++) tcc_free(table_ident[i]); tcc_free(table_ident); /* free all sections */ free_section(symtab_section->hash); free_section(s1->dynsymtab_section->hash); free_section(s1->dynsymtab_section->link); free_section(s1->dynsymtab_section); for(i = 1; i < s1->nb_sections; i++) free_section(s1->sections[i]); tcc_free(s1->sections); /* free loaded dlls array */
for(i = 0; i < s1->nb_loaded_dlls; i++) tcc_free(s1->loaded_dlls[i]); tcc_free(s1->loaded_dlls); /* library paths */ for(i = 0; i < s1->nb_library_paths; i++) tcc_free(s1->library_paths[i]); tcc_free(s1->library_paths); /* cached includes */ for(i = 0; i < s1->nb_cached_includes; i++) tcc_free(s1->cached_includes[i]); tcc_free(s1->cached_includes); for(i = 0; i < s1->nb_include_paths; i++) tcc_free(s1->include_paths[i]); tcc_free(s1->include_paths); for(i = 0; i < s1->nb_sysinclude_paths; i++) tcc_free(s1->sysinclude_paths[i]); tcc_free(s1->sysinclude_paths); tcc_free(s1); } int tcc_add_include_path(TCCState *s1, const char *pathname) { char *pathname1; pathname1 = tcc_strdup(pathname); dynarray_add((void ***)&s1->include_paths, &s1->nb_include_paths, pathname1); return 0; } int tcc_add_sysinclude_path(TCCState *s1, const char *pathname) { char *pathname1; pathname1 = tcc_strdup(pathname); dynarray_add((void ***)&s1->sysinclude_paths, &s1->nb_sysinclude_paths, pathname1); return 0; } static int tcc_add_file_internal(TCCState *s1, const char *filename, int flags) { const char *ext, *filename1; Elf32_Ehdr ehdr; int fd, ret; BufferedFile *saved_file; /* find source file type with extension */ filename1 = strrchr(filename, '/'); if (filename1)
filename1++; else filename1 = filename; ext = strrchr(filename1, '.'); if (ext) ext++; /* open the file */ saved_file = file; file = tcc_open(s1, filename); if (!file) { if (flags & AFF_PRINT_ERROR) { error_noabort("file '%s' not found", filename); } ret = -1; goto fail1; } if (!ext || !strcmp(ext, "c")) { /* C file assumed */ ret = tcc_compile(s1); } else #ifdef CONFIG_TCC_ASM if (!strcmp(ext, "S")) { /* preprocessed assembler */ ret = tcc_assemble(s1, 1); } else if (!strcmp(ext, "s")) { /* non preprocessed assembler */ ret = tcc_assemble(s1, 0); } else #endif #ifdef TCC_TARGET_PE if (!strcmp(ext, "def")) { ret = pe_load_def_file(s1, fdopen(file->fd, "rb")); } else #endif { fd = file->fd; /* assume executable format: auto guess file type */ ret = read(fd, &ehdr, sizeof(ehdr)); lseek(fd, 0, SEEK_SET); if (ret <= 0) { error_noabort("could not read header"); goto fail; } else if (ret != sizeof(ehdr)) { goto try_load_script; } if (ehdr.e_ident[0] == ELFMAG0 && ehdr.e_ident[1] == ELFMAG1 && ehdr.e_ident[2] == ELFMAG2 && ehdr.e_ident[3] == ELFMAG3) { file->line_num = 0; /* do not display line number if error */
if (ehdr.e_type == ET_REL) { ret = tcc_load_object_file(s1, fd, 0); } else if (ehdr.e_type == ET_DYN) { if (s1->output_type == TCC_OUTPUT_MEMORY) { #ifdef TCC_TARGET_PE ret = -1; #else void *h; h = dlopen(filename, RTLD_GLOBAL | RTLD_LAZY); if (h) ret = 0; else ret = -1; #endif } else { ret = tcc_load_dll(s1, fd, filename, (flags & AFF_REFERENCED_DLL) != 0); } } else { error_noabort("unrecognized ELF file"); goto fail; } } else if (memcmp((char *)&ehdr, ARMAG, 8) == 0) { file->line_num = 0; /* do not display line number if error */ ret = tcc_load_archive(s1, fd); } else #ifdef TCC_TARGET_COFF if (*(uint16_t *)(&ehdr) == COFF_C67_MAGIC) { ret = tcc_load_coff(s1, fd); } else #endif { /* as GNU ld, consider it is an ld script if not recognized */ try_load_script: ret = tcc_load_ldscript(s1); if (ret < 0) { error_noabort("unrecognized file type"); goto fail; } } } the_end: tcc_close(file); fail1: file = saved_file; return ret; fail: ret = -1; goto the_end; } int tcc_add_file(TCCState *s, const char *filename) {
return tcc_add_file_internal(s, filename, AFF_PRINT_ERROR); } int tcc_add_library_path(TCCState *s, const char *pathname) { char *pathname1; pathname1 = tcc_strdup(pathname); dynarray_add((void ***)&s->library_paths, &s->nb_library_paths, pathname1); return 0; } /* find and load a dll. Return non zero if not found */ /* XXX: add '-rpath' option support ? */ static int tcc_add_dll(TCCState *s, const char *filename, int flags) { char buf[1024]; int i; for(i = 0; i < s->nb_library_paths; i++) { snprintf(buf, sizeof(buf), "%s/%s", s->library_paths[i], filename); if (tcc_add_file_internal(s, buf, flags) == 0) return 0; } return -1; } /* the library name is the same as the argument of the '-l' option */ int tcc_add_library(TCCState *s, const char *libraryname) { char buf[1024]; int i; /* first we look for the dynamic library if not static linking */ if (!s->static_link) { #ifdef TCC_TARGET_PE snprintf(buf, sizeof(buf), "%s.def", libraryname); #else snprintf(buf, sizeof(buf), "lib%s.so", libraryname); #endif if (tcc_add_dll(s, buf, 0) == 0) return 0; } /* then we look for the static library */ for(i = 0; i < s->nb_library_paths; i++) { snprintf(buf, sizeof(buf), "%s/lib%s.a", s->library_paths[i], libraryname); if (tcc_add_file_internal(s, buf, 0) == 0) return 0; } return -1;
} int tcc_add_symbol(TCCState *s, const char *name, unsigned long val) { add_elf_sym(symtab_section, val, 0, ELF32_ST_INFO(STB_GLOBAL, STT_NOTYPE), 0, SHN_ABS, name); return 0; } int tcc_set_output_type(TCCState *s, int output_type) { s->output_type = output_type; if (!s->nostdinc) { char buf[1024]; /* default include paths */ /* XXX: reverse order needed if -isystem support */ #ifndef TCC_TARGET_PE tcc_add_sysinclude_path(s, "/usr/local/include"); tcc_add_sysinclude_path(s, "/usr/include"); #endif snprintf(buf, sizeof(buf), "%s/include", tcc_lib_path); tcc_add_sysinclude_path(s, buf); #ifdef TCC_TARGET_PE snprintf(buf, sizeof(buf), "%s/include/winapi", tcc_lib_path); tcc_add_sysinclude_path(s, buf); #endif } /* if bound checking, then add corresponding sections */ #ifdef CONFIG_TCC_BCHECK if (do_bounds_check) { /* define symbol */ tcc_define_symbol(s, "__BOUNDS_CHECKING_ON", NULL); /* create bounds sections */ bounds_section = new_section(s, ".bounds", SHT_PROGBITS, SHF_ALLOC); lbounds_section = new_section(s, ".lbounds", SHT_PROGBITS, SHF_ALLOC); } #endif if (s->char_is_unsigned) { tcc_define_symbol(s, "__CHAR_UNSIGNED__", NULL); } /* add debug sections */ if (do_debug) { /* stab symbols */ stab_section = new_section(s, ".stab", SHT_PROGBITS, 0); stab_section->sh_entsize = sizeof(Stab_Sym);
stabstr_section = new_section(s, ".stabstr", SHT_STRTAB, 0); put_elf_str(stabstr_section, ""); stab_section->link = stabstr_section; /* put first entry */ put_stabs("", 0, 0, 0, 0); } /* add libc crt1/crti objects */ #ifndef TCC_TARGET_PE if ((output_type == TCC_OUTPUT_EXE || output_type == TCC_OUTPUT_DLL) && !s->nostdlib) { if (output_type != TCC_OUTPUT_DLL) tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crt1.o"); tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crti.o"); } #endif return 0; } #define WD_ALL 0x0001 /* warning is activated when using -Wall */ #define FD_INVERT 0x0002 /* invert value before storing */ typedef struct FlagDef { uint16_t offset; uint16_t flags; const char *name; } FlagDef; static const FlagDef warning_defs[] = { { offsetof(TCCState, warn_unsupported), 0, "unsupported" }, { offsetof(TCCState, warn_write_strings), 0, "write-strings" }, { offsetof(TCCState, warn_error), 0, "error" }, { offsetof(TCCState, warn_implicit_function_declaration), WD_ALL, "implicit-function-declaration" }, }; static int set_flag(TCCState *s, const FlagDef *flags, int nb_flags, const char *name, int value) { int i; const FlagDef *p; const char *r; r = name; if (r[0] == 'n' && r[1] == 'o' && r[2] == '-') { r += 3; value = !value; } for(i = 0, p = flags; i < nb_flags; i++, p++) { if (!strcmp(r, p->name)) goto found; } return -1;
found: if (p->flags & FD_INVERT) value = !value; *(int *)((uint8_t *)s + p->offset) = value; return 0; } /* set/reset a warning */ int tcc_set_warning(TCCState *s, const char *warning_name, int value) { int i; const FlagDef *p; if (!strcmp(warning_name, "all")) { for(i = 0, p = warning_defs; i < countof(warning_defs); i++, p++) { if (p->flags & WD_ALL) *(int *)((uint8_t *)s + p->offset) = 1; } return 0; } else { return set_flag(s, warning_defs, countof(warning_defs), warning_name, value); } } static const FlagDef flag_defs[] = { { offsetof(TCCState, char_is_unsigned), 0, "unsigned-char" }, { offsetof(TCCState, char_is_unsigned), FD_INVERT, "signed-char" }, { offsetof(TCCState, nocommon), FD_INVERT, "common" }, { offsetof(TCCState, leading_underscore), 0, "leading-underscore" }, }; /* set/reset a flag */ int tcc_set_flag(TCCState *s, const char *flag_name, int value) { return set_flag(s, flag_defs, countof(flag_defs), flag_name, value); } #if !defined(LIBTCC) /* extract the basename of a file */ static const char *tcc_basename(const char *name) { const char *p; p = strrchr(name, '/'); #ifdef WIN32 if (!p) p = strrchr(name, '\\'); #endif if (!p) p = name;
else p++; return p; } static int64_t getclock_us(void) { #ifdef WIN32 struct _timeb tb; _ftime(&tb); return (tb.time * 1000LL + tb.millitm) * 1000LL; #else struct timeval tv; gettimeofday(&tv, NULL); return tv.tv_sec * 1000000LL + tv.tv_usec; #endif } void help(void) { printf("tcc version " TCC_VERSION " - Tiny C Compiler - Copyright (C) 2001-2005 Fabrice Bellard\n" "usage: tcc [-v] [-c] [-o outfile] [-Bdir] [-bench] [-Idir] [-Dsym[=val]] [-Usym]\n" " [-Wwarn] [-g] [-b] [-bt N] [-Ldir] [-llib] [-shared] [-static]\n" " [infile1 infile2...] [-run infile args...]\n" "\n" "General options:\n" " -v display current version\n" " -c compile only - generate an object file\n" " -o outfile set output filename\n" " -Bdir set tcc internal library path\n" " -bench output compilation statistics\n" " -run run compiled source\n" " -fflag set or reset (with 'no-' prefix) 'flag' (see man page)\n" " -Wwarning set or reset (with 'no-' prefix) 'warning' (see man page)\n" " -w disable all warnings\n" "Preprocessor options:\n" " -Idir add include path 'dir'\n" " -Dsym[=val] define 'sym' with value 'val'\n" " -Usym undefine 'sym'\n" "Linker options:\n" " -Ldir add library path 'dir'\n" " -llib link with dynamic or static library 'lib'\n" " -shared generate a shared library\n" " -static static linking\n" " -rdynamic export all global symbols to dynamic linker\n" " -r relocatable output\n" "Debugger options:\n" " -g generate runtime debug info\n" #ifdef CONFIG_TCC_BCHECK " -b compile with built-in memory and bounds checker (implies -g)\n" #endif " -bt N show N callers in stack traces\n" );
} #define TCC_OPTION_HAS_ARG 0x0001 #define TCC_OPTION_NOSEP 0x0002 /* cannot have space before option and arg */ typedef struct TCCOption { const char *name; uint16_t index; uint16_t flags; } TCCOption; enum { TCC_OPTION_HELP, TCC_OPTION_I, TCC_OPTION_D, TCC_OPTION_U, TCC_OPTION_L, TCC_OPTION_B, TCC_OPTION_l, TCC_OPTION_bench, TCC_OPTION_bt, TCC_OPTION_b, TCC_OPTION_g, TCC_OPTION_c, TCC_OPTION_static, TCC_OPTION_shared, TCC_OPTION_o, TCC_OPTION_r, TCC_OPTION_Wl, TCC_OPTION_W, TCC_OPTION_O, TCC_OPTION_m, TCC_OPTION_f, TCC_OPTION_nostdinc, TCC_OPTION_nostdlib, TCC_OPTION_print_search_dirs, TCC_OPTION_rdynamic, TCC_OPTION_run, TCC_OPTION_v, TCC_OPTION_w, TCC_OPTION_pipe, }; static const TCCOption tcc_options[] = { { "h", TCC_OPTION_HELP, 0 }, { "?", TCC_OPTION_HELP, 0 }, { "I", TCC_OPTION_I, TCC_OPTION_HAS_ARG }, { "D", TCC_OPTION_D, TCC_OPTION_HAS_ARG }, { "U", TCC_OPTION_U, TCC_OPTION_HAS_ARG }, { "L", TCC_OPTION_L, TCC_OPTION_HAS_ARG }, { "B", TCC_OPTION_B, TCC_OPTION_HAS_ARG }, { "l", TCC_OPTION_l, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "bench", TCC_OPTION_bench, 0 },
{ "bt", TCC_OPTION_bt, TCC_OPTION_HAS_ARG }, #ifdef CONFIG_TCC_BCHECK { "b", TCC_OPTION_b, 0 }, #endif { "g", TCC_OPTION_g, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "c", TCC_OPTION_c, 0 }, { "static", TCC_OPTION_static, 0 }, { "shared", TCC_OPTION_shared, 0 }, { "o", TCC_OPTION_o, TCC_OPTION_HAS_ARG }, { "run", TCC_OPTION_run, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "rdynamic", TCC_OPTION_rdynamic, 0 }, { "r", TCC_OPTION_r, 0 }, { "Wl,", TCC_OPTION_Wl, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "W", TCC_OPTION_W, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "O", TCC_OPTION_O, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "m", TCC_OPTION_m, TCC_OPTION_HAS_ARG }, { "f", TCC_OPTION_f, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "nostdinc", TCC_OPTION_nostdinc, 0 }, { "nostdlib", TCC_OPTION_nostdlib, 0 }, { "print-search-dirs", TCC_OPTION_print_search_dirs, 0 }, { "v", TCC_OPTION_v, 0 }, { "w", TCC_OPTION_w, 0 }, { "pipe", TCC_OPTION_pipe, 0}, { NULL }, }; /* convert 'str' into an array of space separated strings */ static int expand_args(char ***pargv, const char *str) { const char *s1; char **argv, *arg; int argc, len; argc = 0; argv = NULL; for(;;) { while (is_space(*str)) str++; if (*str == '\0') break; s1 = str; while (*str != '\0' && !is_space(*str)) str++; len = str - s1; arg = tcc_malloc(len + 1); memcpy(arg, s1, len); arg[len] = '\0'; dynarray_add((void ***)&argv, &argc, arg); } *pargv = argv; return argc; }
static char **files; static int nb_files, nb_libraries; static int multiple_files; static int print_search_dirs; static int output_type; static int reloc_output; static const char *outfile; int parse_args(TCCState *s, int argc, char **argv) { int optind; const TCCOption *popt; const char *optarg, *p1, *r1; char *r; optind = 0; while (1) { if (optind >= argc) { if (nb_files == 0 && !print_search_dirs) goto show_help; else break; } r = argv[optind++]; if (r[0] != '-') { /* add a new file */ dynarray_add((void ***)&files, &nb_files, r); if (!multiple_files) { optind--; /* argv[0] will be this file */ break; } } else { /* find option in table (match only the first chars */ popt = tcc_options; for(;;) { p1 = popt->name; if (p1 == NULL) error("invalid option -- '%s'", r); r1 = r + 1; for(;;) { if (*p1 == '\0') goto option_found; if (*r1 != *p1) break; p1++; r1++; } popt++; } option_found: if (popt->flags & TCC_OPTION_HAS_ARG) { if (*r1 != '\0' || (popt->flags & TCC_OPTION_NOSEP)) {
optarg = r1; } else { if (optind >= argc) error("argument to '%s' is missing", r); optarg = argv[optind++]; } } else { if (*r1 != '\0') goto show_help; optarg = NULL; } switch(popt->index) { case TCC_OPTION_HELP: show_help: help(); exit(1); case TCC_OPTION_I: if (tcc_add_include_path(s, optarg) < 0) error("too many include paths"); break; case TCC_OPTION_D: { char *sym, *value; sym = (char *)optarg; value = strchr(sym, '='); if (value) { *value = '\0'; value++; } tcc_define_symbol(s, sym, value); } break; case TCC_OPTION_U: tcc_undefine_symbol(s, optarg); break; case TCC_OPTION_L: tcc_add_library_path(s, optarg); break; case TCC_OPTION_B: /* set tcc utilities path (mainly for tcc development) */ tcc_lib_path = optarg; break; case TCC_OPTION_l: dynarray_add((void ***)&files, &nb_files, r); nb_libraries++; break; case TCC_OPTION_bench: do_bench = 1; break; case TCC_OPTION_bt: num_callers = atoi(optarg); break;
#ifdef CONFIG_TCC_BCHECK case TCC_OPTION_b: do_bounds_check = 1; do_debug = 1; break; #endif case TCC_OPTION_g: do_debug = 1; break; case TCC_OPTION_c: multiple_files = 1; output_type = TCC_OUTPUT_OBJ; break; case TCC_OPTION_static: s->static_link = 1; break; case TCC_OPTION_shared: output_type = TCC_OUTPUT_DLL; break; case TCC_OPTION_o: multiple_files = 1; outfile = optarg; break; case TCC_OPTION_r: /* generate a .o merging several output files */ reloc_output = 1; output_type = TCC_OUTPUT_OBJ; break; case TCC_OPTION_nostdinc: s->nostdinc = 1; break; case TCC_OPTION_nostdlib: s->nostdlib = 1; break; case TCC_OPTION_print_search_dirs: print_search_dirs = 1; break; case TCC_OPTION_run: { int argc1; char **argv1; argc1 = expand_args(&argv1, optarg); if (argc1 > 0) { parse_args(s, argc1, argv1); } multiple_files = 0; output_type = TCC_OUTPUT_MEMORY; } break; case TCC_OPTION_v: printf("tcc version %s\n", TCC_VERSION); exit(0); case TCC_OPTION_f:
if (tcc_set_flag(s, optarg, 1) < 0 && s->warn_unsupported) goto unsupported_option; break; case TCC_OPTION_W: if (tcc_set_warning(s, optarg, 1) < 0 && s->warn_unsupported) goto unsupported_option; break; case TCC_OPTION_w: s->warn_none = 1; break; case TCC_OPTION_rdynamic: s->rdynamic = 1; break; case TCC_OPTION_Wl: { const char *p; if (strstart(optarg, "-Ttext,", &p)) { s->text_addr = strtoul(p, NULL, 16); s->has_text_addr = 1; } else if (strstart(optarg, "--oformat,", &p)) { if (strstart(p, "elf32-", NULL)) { s->output_format = TCC_OUTPUT_FORMAT_ELF; } else if (!strcmp(p, "binary")) { s->output_format = TCC_OUTPUT_FORMAT_BINARY; } else #ifdef TCC_TARGET_COFF if (!strcmp(p, "coff")) { s->output_format = TCC_OUTPUT_FORMAT_COFF; } else #endif { error("target %s not found", p); } } else { error("unsupported linker option '%s'", optarg); } } break; default: if (s->warn_unsupported) { unsupported_option: warning("unsupported option '%s'", r); } break; } } } return optind; } int main(int argc, char **argv) {
int i; TCCState *s; int nb_objfiles, ret, optind; char objfilename[1024]; int64_t start_time = 0; #ifdef WIN32 /* on win32, we suppose the lib and includes are at the location of 'tcc.exe' */ { static char path[1024]; char *p, *d; GetModuleFileNameA(NULL, path, sizeof path); p = d = strlwr(path); while (*d) { if (*d == '\\') *d = '/', p = d; ++d; } *p = '\0'; tcc_lib_path = path; } #endif s = tcc_new(); output_type = TCC_OUTPUT_EXE; outfile = NULL; multiple_files = 1; files = NULL; nb_files = 0; nb_libraries = 0; reloc_output = 0; print_search_dirs = 0; optind = parse_args(s, argc - 1, argv + 1) + 1; if (print_search_dirs) { /* enough for Linux kernel */ printf("install: %s/\n", tcc_lib_path); return 0; } nb_objfiles = nb_files - nb_libraries; /* if outfile provided without other options, we output an executable */ if (outfile && output_type == TCC_OUTPUT_MEMORY) output_type = TCC_OUTPUT_EXE; /* check -c consistency : only single file handled. XXX: checks file type */ if (output_type == TCC_OUTPUT_OBJ && !reloc_output) { /* accepts only a single input file */
if (nb_objfiles != 1) error("cannot specify multiple files with -c"); if (nb_libraries != 0) error("cannot specify libraries with -c"); } if (output_type != TCC_OUTPUT_MEMORY) { if (!outfile) { /* compute default outfile name */ pstrcpy(objfilename, sizeof(objfilename) - 1, /* strip path */ tcc_basename(files[0])); #ifdef TCC_TARGET_PE pe_guess_outfile(objfilename, output_type); #else if (output_type == TCC_OUTPUT_OBJ && !reloc_output) { char *ext = strrchr(objfilename, '.'); if (!ext) goto default_outfile; /* add .o extension */ strcpy(ext + 1, "o"); } else { default_outfile: pstrcpy(objfilename, sizeof(objfilename), "a.out"); } #endif outfile = objfilename; } } if (do_bench) { start_time = getclock_us(); } tcc_set_output_type(s, output_type); /* compile or add each files or library */ for(i = 0;i < nb_files; i++) { const char *filename; filename = files[i]; if (filename[0] == '-') { if (tcc_add_library(s, filename + 2) < 0) error("cannot find %s", filename); } else { if (tcc_add_file(s, filename) < 0) { ret = 1; goto the_end; } } } /* free all files */
tcc_free(files); if (do_bench) { double total_time; total_time = (double)(getclock_us() - start_time) / 1000000.0; if (total_time < 0.001) total_time = 0.001; if (total_bytes < 1) total_bytes = 1; printf("%d idents, %d lines, %d bytes, %0.3f s, %d lines/s, %0.1f MB/s\n", tok_ident - TOK_IDENT, total_lines, total_bytes, total_time, (int)(total_lines / total_time), total_bytes / total_time / 1000000.0); } if (s->output_type == TCC_OUTPUT_MEMORY) { ret = tcc_run(s, argc - optind, argv + optind); } else #ifdef TCC_TARGET_PE if (s->output_type != TCC_OUTPUT_OBJ) { ret = tcc_output_pe(s, outfile); } else #endif { tcc_output_file(s, outfile); ret = 0; } the_end: /* XXX: cannot do it with bound checking because of the malloc hooks */ if (!do_bounds_check) tcc_delete(s); #ifdef MEM_DEBUG if (do_bench) { printf("memory: %d bytes, max = %d bytes\n", mem_cur_size, mem_max_size); } #endif return ret; } #endif
Pascal programozás a Borland Delphi unit Investicija; interface uses Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms, Dialogs, StdCtrls, ExtCtrls, Math, Buttons, ComCtrls; type
TForm1 = class(TForm) Memo1: TMemo; BitBtn1: TBitBtn; ListBox1: TListBox; TrackBar1: TTrackBar; Lab1: TLabeledEdit; Lab2: TLabeledEdit; Lab3: TLabeledEdit; Lab4: TLabeledEdit; Lab5: TLabeledEdit; Lab6: TLabeledEdit; UpDown1: TUpDown; UpDown2: TUpDown; procedure BitBtn1Enter(Sender: TObject); procedure FormActivate(Sender: TObject); procedure ListBox1Click(Sender: TObject); procedure Lab1SubLabelClick(Sender: TObject); procedure Lab2SubLabelClick(Sender: TObject); procedure Lab3SubLabelClick(Sender: TObject); procedure Lab4SubLabelClick(Sender: TObject); procedure Lab5SubLabelClick(Sender: TObject); procedure Lab6SubLabelClick(Sender: TObject); procedure UpDown1Click(Sender: TObject; Button: TUDBtnType); procedure UpDown2Click(Sender: TObject; Button: TUDBtnType); private { Private declarations } public { Public declarations } end; var Form1: TForm1; implementation {$R *.dfm} procedure TForm1.BitBtn1Enter(Sender: TObject); var Za: Array[0..7] of Real; Mi: Array[0..2] of Integer; B : String; begin if ListBox1.ItemIndex = 0 then begin Za[0] := StrToFloat(Lab1.Text); Za[4] := 25.937 * Exp(-0.1646 * Za[0])/100; end; if ListBox1.ItemIndex = 1 then begin Za[0] := StrToFloat(Lab1.Text); Za[4] := 22 * Power(Za[0],-0.6435)/100; end; if ListBox1.ItemIndex = 2 then begin Za[0] := StrToFloat(Lab1.Text);
Za[1] := StrToFloat(Lab2.Text); Za[4] := Za[0]+Za[1]+Za[0]*Za[1]; end; if ListBox1.ItemIndex = 3 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Power(1+(Za[0]/Za[1]),Za[1])-1; end; if ListBox1.ItemIndex = 4 then begin Za[0] := StrToFloat(Lab1.Text);{k} Za[1] := StrToFloat(Lab2.Text); {p} Za[2] := StrToFloat(Lab3.Text); {q} Za[4] := Power(1+(Za[0]/(Za[1]*Za[2])),Za[1])-1; end; if ListBox1.ItemIndex = 5 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Exp(Za[0]/Za[1])-1; {kontinualni obracun} end; if ListBox1.ItemIndex = 6 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Power(1+Za[0],-Za[1]); {buduce na sadasnje} end; if ListBox1.ItemIndex = 7 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Power(1+Za[0],Za[1]); {sadasnje na buduce} end; if ListBox1.ItemIndex = 8 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-1; Za[2] := Za[0] * Power(1+Za[0],Za[1]); Za[4] := Za[3]/Za[2]; end; if ListBox1.ItemIndex = 9 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-1; Za[2] := Za[0] * Power(1+Za[0],Za[1]); Za[4] := Za[2]/Za[3]; end; if ListBox1.ItemIndex = 10 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1]) - 1; Za[4] := Za[3]/Za[0]; end; if ListBox1.ItemIndex = 11 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1]) - 1;
Za[4] := Za[0]/Za[3]; end; if ListBox1.ItemIndex = 12 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := 2 + (Za[0]*Za[1]); Za[4] := (2*Za[1])/Za[3]; {uprosceni} end; if ListBox1.ItemIndex = 13 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := 2 + (Za[0]*Za[1]); Za[4] := Za[3]/(2*Za[1]); end; if ListBox1.ItemIndex = 14 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-Za[0]*Za[1]-1; Za[2] := Power(Za[0],2)*Power(1+Za[0],Za[1]); Za[4] := Za[3]/Za[2]; end; if ListBox1.ItemIndex = 15 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-Za[0]*Za[1]-1; Za[2] := Power(Za[0],2)*Power(1+Za[0],Za[1]); Za[4] := Za[2]/Za[3]; end; if ListBox1.ItemIndex = 16 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-Za[0]*Za[1]-1; Za[2] := Power(Za[0],2); Za[4] := Za[3]/Za[2]; end; if ListBox1.ItemIndex = 17 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-Za[0]*Za[1]-1; Za[2] := Power(Za[0],2); Za[4] := Za[2]/Za[3]; end; if ListBox1.ItemIndex = 18 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-Za[0]*Za[1]-1; Za[2] := Za[0] * Power(1+Za[0],Za[1]) - Za[0]; Za[4] := Za[3]/Za[2]; end; if ListBox1.ItemIndex = 19 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-Za[0]*Za[1]-1;
Za[2] := Za[0] * Power(1+Za[0],Za[1]) - Za[0]; Za[4] := Za[2]/Za[3]; end; if ListBox1.ItemIndex = 20 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := (Za[0]/Za[1])*100; {aproksimatni} end; if ListBox1.ItemIndex = 21 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := StrToFloat(Lab3.Text); Za[2] := 1-Power(1+Za[1],Za[3])*Power(1+Za[0],-Za[3]); Za[4] := Za[2]/(Za[0]-Za[1]); end; if ListBox1.ItemIndex = 22 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := StrToFloat(Lab3.Text); Za[2] := 1-Power(1+Za[1],Za[3])*Power(1+Za[0],-Za[3]); Za[4] := (Za[0]-Za[1])/Za[2]; end; if ListBox1.ItemIndex = 23 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := StrToFloat(Lab3.Text); Za[2] := Power(1+Za[0],Za[3])-Power(1+Za[1],Za[3]); Za[4] := Za[2]/(Za[0]-Za[1]); end; if ListBox1.ItemIndex = 24 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := StrToFloat(Lab3.Text); Za[2] := Power(1+Za[0],Za[3])-Power(1+Za[1],Za[3]); Za[4] := (Za[0]-Za[1])/Za[2]; end; if ListBox1.ItemIndex = 25 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := StrToFloat(Lab3.Text); Za[4] := (Power(1+Za[1],Za[3])/Power(1+Za[0],Za[3]))*(1/(1+Za[1])); {modifikovani} end; {A na S} if ListBox1.ItemIndex = 26 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(Za[0]/Za[1],2); Za[2] := Power((Za[0]-1)/Za[1],2); Za[4] := Za[3]-Za[2]; end; if ListBox1.ItemIndex = 27 then begin Za[0] := StrToFloat(Lab1.Text); {n} Za[1] := StrToFloat(Lab2.Text); {k} Za[3] := Za[0] - Za[1] + 1;
Za[2] := (Za[0]*(Za[0]+1))/2; Za[4] := Za[3]/Za[2]; end; if ListBox1.ItemIndex = 28 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Power(Za[1],Za[0]); end; if ListBox1.ItemIndex = 29 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Za[0] * Za[1]; end; if ListBox1.ItemIndex = 30 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Za[0] / Za[1]; end; if ListBox1.ItemIndex = 31 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Za[0] + Za[1]; end; if ListBox1.ItemIndex = 32 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Za[0] - Za[1]; end; if ListBox1.ItemIndex = 33 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Mi[0] := StrToInt(Lab3.Text); Mi[1] := StrToInt(Lab4.Text); Za[4] := DoubleDecliningBalance(Za[0],Za[1],Mi[0],Mi[1]); end; if ListBox1.ItemIndex = 34 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Mi[0] := StrToInt(Lab4.Text); Mi[1] := StrToInt(Lab5.Text); if Mi[1] = 0 then Za[4] := FutureValue(Za[0],Mi[0],Za[1],Za[2],ptStartOfPeriod) else Za[4] := FutureValue(Za[0],Mi[0],Za[1],Za[2],ptEndOfPeriod); end; if ListBox1.ItemIndex = 35 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Mi[0] := StrToInt(Lab4.Text); Mi[1] := StrToInt(Lab5.Text); Mi[2] := StrToInt(Lab6.Text);
if Mi[2] = 0 then Za[4] := InterestPayment(Za[0],Mi[0],Mi[1],Za[1],Za[2],ptStartOfPeriod) else Za[4] := InterestPayment(Za[0],Mi[0],Mi[1],Za[1],Za[2],ptEndOfPeriod); end; if ListBox1.ItemIndex = 36 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Mi[0] := StrToInt(Lab4.Text); Mi[1] := StrToInt(Lab5.Text); if Mi[1] = 0 then Za[4] := InterestRate(Mi[0],Za[0],Za[1],Za[2],ptStartOfPeriod) else Za[4] := InterestRate(Mi[0],Za[0],Za[1],Za[2],ptEndOfPeriod); end; {Broj Perioda} if ListBox1.ItemIndex = 37 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Za[3] := StrToFloat(Lab4.Text); Mi[0] := StrToInt(Lab5.Text); if Mi[0] = 0 then Za[4] := NumberOfPeriods(Za[0],Za[1],Za[2],Za[3],ptStartOfPeriod) else Za[4] := NumberOfPeriods(Za[0],Za[1],Za[2],ZA[3],ptEndOfPeriod); end; if ListBox1.ItemIndex = 38 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Mi[0] := StrToInt(Lab4.Text); Mi[1] := StrToInt(Lab5.Text); if Mi[1] = 0 then Za[4] := Payment(Za[0],Mi[0],Za[1],Za[2],ptStartOfPeriod) else {Isplata} Za[4] := Payment(Za[0],Mi[0],Za[1],Za[2],ptEndOfPeriod); end; if ListBox1.ItemIndex = 39 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Mi[0] := StrToInt(Lab4.Text); Mi[1] := StrToInt(Lab5.Text); Mi[2] := StrToInt(Lab6.Text); if Mi[2] = 0 then Za[4] := PeriodPayment(Za[0],Mi[0],Mi[1],Za[1],Za[2],ptStartOfPeriod) else {Isplata za period} Za[4] := PeriodPayment(Za[0],Mi[0],Mi[1],Za[1],Za[2],ptEndOfPeriod); end; if ListBox1.ItemIndex = 40 then begin Za[0] := StrToFloat(Lab1.Text);
Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Mi[0] := StrToInt(Lab4.Text); Mi[1] := StrToInt(Lab5.Text); if Mi[1] = 0 then Za[4] := PresentValue(Za[0],Mi[0],Za[1],Za[2],ptStartOfPeriod) else {Sadasnja vrednost} Za[4] := PresentValue(Za[0],Mi[0],Za[1],Za[2],ptEndOfPeriod); end; if ListBox1.ItemIndex = 41 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Mi[0] := StrToInt(Lab3.Text); Mi[1] := StrToInt(Lab4.Text); Za[4] := SYDDepreciation(Za[0],Za[1],Mi[0],Mi[1]); end; {amortizacija sid} if ListBox1.ItemIndex = 42 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := RandG(Za[0],Za[1]); end; if ListBox1.ItemIndex = 43 then begin Randomize; Mi[0] := StrToInt(Lab1.Text); Za[4] := Random(Mi[0]); end; if ListBox1.ItemIndex = 44 then begin Randomize; Mi[0] := StrToInt(Lab1.Text); Mi[1] := StrToInt(Lab2.Text); Za[4] := RandomRange(Mi[0],Mi[1]); end; if ListBox1.ItemIndex = 45 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Za[3] := StrToFloat(Lab4.Text); Za[4] := Za[0]+(Za[1]/Za[2])+Za[1]*Za[3]; end; if ListBox1.ItemIndex = 46 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Za[3] := StrToFloat(Lab4.Text); Za[4] := Sqrt(2*Za[3]*(Za[0]-Za[1]))+ ((Za[0]+Za[1])*Za[2]-Za[3])/2; end; if ListBox1.ItemIndex = 47 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Sqrt(2*Za[0]/Za[1]); end; if ListBox1.ItemIndex = 48 then begin
Za[0] := StrToFloat(Lab1.Text); {in} Za[1] := StrToFloat(Lab2.Text); {ln} Za[2] := StrToFloat(Lab3.Text); {g} Za[3] := StrToFloat(Lab4.Text); {K} Za[5] := StrToFloat(Lab5.Text); {n} Za[6] := (Za[3]*Power(1+Za[3],Za[5]))/ (Power(1+Za[3],Za[5])-1); Za[7] := (Power(1+Za[3],Za[5])-Za[3]*Za[5]-1)/ (Za[3]*Power(1+Za[3],Za[5])-Za[3]); Za[4] := (Za[0]-Za[1])*Za[6]+Za[1]*Za[3]+Za[2]*Za[7]; end; if TrackBar1.Position = 1 then B := '0.#'; if TrackBar1.Position = 2 then B := '0.##'; if TrackBar1.Position = 3 then B := '0.###'; if TrackBar1.Position = 4 then B := '0.####'; if TrackBar1.Position = 5 then B := '0.#####'; if TrackBar1.Position = 6 then B := '0.######'; if TrackBar1.Position = 7 then B := '0.#######'; if TrackBar1.Position = 8 then B := '0.########'; if TrackBar1.Position = 9 then B := '0.#########'; if TrackBar1.Position = 10 then B := '0.##########'; if TrackBar1.Position = 11 then B := '0.###########'; if TrackBar1.Position = 12 then B := '0.############'; if TrackBar1.Position = 13 then B := '0.#############'; if TrackBar1.Position = 14 then B := '0.##############'; if TrackBar1.Position = 15 then B := '0.###############'; Memo1.Lines.Add(FormatFloat(B,Za[4])); end; procedure TForm1.FormActivate(Sender: TObject); begin ListBox1.ItemIndex := 0; TrackBar1.Position := 4; Lab1.EditLabel.Caption := 'Odaberes broj i kliknes'; Lab2.EditLabel.Caption := ' '; Lab3.EditLabel.Caption := ' '; Lab4.EditLabel.Caption := ' '; Lab5.EditLabel.Caption := ' ';
Lab6.EditLabel.Caption := ' end;
';
procedure TForm1.ListBox1Click(Sender: TObject); var D : Integer; begin Lab1.EditLabel.Caption := ' '; Lab2.EditLabel.Caption := ' '; Lab3.EditLabel.Caption := ' '; Lab4.EditLabel.Caption := ' '; Lab5.EditLabel.Caption := ' '; Lab6.EditLabel.Caption := ' '; D := ListBox1.ItemIndex; if D = 0 then Lab1.EditLabel.Caption := 'Trajanje projekta u godinama:'; if D = 1 then Lab1.EditLabel.Caption := 'Trajanje projekta u godinama:'; if D = 2 then begin Lab1.EditLabel.Caption := 'Moc zaradjivanja:'; Lab2.EditLabel.Caption := 'Godisnja inflaciona stopa:'; end; if D = 3 then begin Lab1.EditLabel.Caption := 'nominalna stopa:'; Lab2.EditLabel.Caption := 'broj kamatnih perioda:'; end; if D = 4 then begin Lab1.EditLabel.Caption := 'Nominalna stopa:'; Lab2.EditLabel.Caption := 'Broj kamatnih perioda:'; Lab3.EditLabel.Caption := 'Broj perioda obracuna:'; end; if D = 5 then begin Lab1.EditLabel.Caption := 'Nominalna stopa:'; Lab2.EditLabel.Caption := 'Broj perioda obracuna:'; end; if (D = 6) or (D = 7) then begin Lab1.EditLabel.Caption := 'Kamatna stopa:'; Lab2.EditLabel.Caption := 'Broj godina:'; end; if (D = 8) or (D = 9) or (D = 10) or (D = 11) or (D = 12) or (D = 13) or (D = 14) or (D = 15) or (D = 16) or (D = 17) or (D = 18) or (D = 19) then begin Lab1.EditLabel.Caption := 'Kamatna stopa:'; Lab2.EditLabel.Caption := 'Broj godina:'; end; if D = 20 then begin Lab1.EditLabel.Caption := 'Iznos novca:'; Lab2.EditLabel.Caption := 'Procentualni udeo:'; end; if (D = 21) or (D = 22) or (D = 23) or (D = 24) or (D = 25) then begin Lab1.EditLabel.Caption := 'Kamatna stopa:';
Lab2.EditLabel.Caption := 'Stopa geometrijske progresije:'; Lab3.EditLabel.Caption := 'Broj godina:'; end; if D = 26 then begin Lab1.EditLabel.Caption := 'Godina amortizacije:'; Lab2.EditLabel.Caption := 'Vek upotrebe:'; end; if D = 27 then begin Lab1.EditLabel.Caption := 'Vek upotrebe:'; Lab2.EditLabel.Caption := 'Godina amortizacije:'; end; if (D = 28) or (D = 29) or (D = 30) or (D = 31) or (D = 32) then begin Lab1.EditLabel.Caption := 'Y:'; Lab2.EditLabel.Caption := 'X:'; end; if D = 33 then begin Lab1.EditLabel.Caption := 'Investicioni trosak:'; Lab2.EditLabel.Caption := 'Likvidaciona vrednost:'; Lab3.EditLabel.Caption := 'Vek trajanja:'; Lab4.EditLabel.Caption := 'Period:'; end; if D = 45 then begin Lab1.EditLabel.Caption := 'Radna inferiornost starog:'; Lab2.EditLabel.Caption := 'Razlika:'; Lab3.EditLabel.Caption := 'Broj godina:'; Lab4.EditLabel.Caption := 'Kamatna stopa:'; end; if D = 46 then begin Lab1.EditLabel.Caption := 'Investicioni trosak novog:'; Lab2.EditLabel.Caption := 'Likvidaciona vrednost novog:'; Lab3.EditLabel.Caption := 'Kamatna stopa:'; Lab4.EditLabel.Caption := 'Nagib inferiornosti starog:'; end; end; procedure TForm1.Lab1SubLabelClick(Sender: TObject); var Ma : String; begin Ma := Memo1.SelText; if (Ma = '') or (Ma = ' ') then Ma := Memo1.Lines.Strings[Memo1.CaretPos.Y]; Lab1.Text := Ma; end; procedure TForm1.Lab2SubLabelClick(Sender: TObject); var Ma : String; begin Ma := Memo1.SelText; if (Ma = '') or (Ma = ' ') then Ma := Memo1.Lines.Strings[Memo1.CaretPos.Y]; Lab2.Text := Ma;
end; procedure TForm1.Lab3SubLabelClick(Sender: TObject); var Ma : String; begin Ma := Memo1.SelText; if (Ma = '') or (Ma = ' ') then Ma := Memo1.Lines.Strings[Memo1.CaretPos.Y]; Lab3.Text := Ma; end; procedure TForm1.Lab4SubLabelClick(Sender: TObject); var Ma : String; begin Ma := Memo1.SelText; if (Ma = '') or (Ma = ' ') then Ma := Memo1.Lines.Strings[Memo1.CaretPos.Y]; Lab4.Text := Ma; end; procedure TForm1.Lab5SubLabelClick(Sender: TObject); var Ma : String; begin Ma := Memo1.SelText; if (Ma = '') or (Ma = ' ') then Ma := Memo1.Lines.Strings[Memo1.CaretPos.Y]; Lab5.Text := Ma; end; procedure TForm1.Lab6SubLabelClick(Sender: TObject); var Ma : String; begin Ma := Memo1.SelText; if (Ma = '') or (Ma = ' ') then Ma := Memo1.Lines.Strings[Memo1.CaretPos.Y]; Lab6.Text := Ma; end; procedure TForm1.UpDown1Click(Sender: TObject; Button: TUDBtnType); begin Memo1.Font.Size := UpDown1.Position; end; procedure TForm1.UpDown2Click(Sender: TObject; Button: TUDBtnType); begin ListBox1.Font.Size := UpDown2.Position; end; end.
Még egy program a Borland Delphi-ben: unit Neurolitik; interface uses Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms, Dialogs, StdCtrls, ExtCtrls, Math, StrUtils, ComCtrls, TabNotBk; type TForm1 = class(TForm) TabbedNotebook1: TTabbedNotebook; LabeledEdit1: TLabeledEdit; LabeledEdit2: TLabeledEdit; Button1: TButton; TrackBar1: TTrackBar; ScrollBar1: TScrollBar; Label1: TLabel; RadioGroup1: TRadioGroup; LabeledEdit3: TLabeledEdit; Label2: TLabel; Button2: TButton; Button3: TButton; ScrollBar2: TScrollBar; Label3: TLabel; procedure Button1Click(Sender: TObject); procedure ScrollBar1Change(Sender: TObject); procedure Button2Click(Sender: TObject); procedure Button3Click(Sender: TObject); procedure ScrollBar2Change(Sender: TObject); private { Private declarations } public { Public declarations } end; var Form1: TForm1; implementation {$R *.dfm} procedure TForm1.Button1Click(Sender: TObject); var Prebaceno, Sluc : Integer; Rec : String; begin Randomize; if RadioGroup1.ItemIndex = 0 then begin
Rec := LabeledEdit2.Text; Prebaceno := SoundExInt(Rec, TrackBar1.Position); Sluc := RandomRange(1, ScrollBar1.Position); LabeledEdit1.Text := IntToStr(Prebaceno) + IntToStr(Sluc); end else begin Rec := LabeledEdit2.Text; Prebaceno := SoundExInt(Rec, TrackBar1.Position); Sluc := RandomRange(1, ScrollBar1.Position); LabeledEdit1.Text := IntToStr(Prebaceno + Sluc); end; end; procedure TForm1.ScrollBar1Change(Sender: TObject); begin Label1.Caption := 'Vrednost: ' + IntToStr(ScrollBar1.Position); end; procedure TForm1.Button2Click(Sender: TObject); var Rajt : Integer; begin Randomize; Rajt := RandomRange(0, 255 - ScrollBar2.Position + RandomRange(0, 255)); Label2.Caption := 'Vrednost: ' + IntToStr(Rajt); LabeledEdit3.Text := LabeledEdit3.Text + Chr(Rajt); end; procedure TForm1.Button3Click(Sender: TObject); begin LabeledEdit3.Text := ''; end; procedure TForm1.ScrollBar2Change(Sender: TObject); begin Label3.Caption := 'Humani faktor: ' + IntToStr(ScrollBar2.Position); end; end.
Otto Virag Cirkus program
#include <stdio.h> #include
/* Ovog zbog velikih celih brojeva */
int mondo(int ne) { return ne; }
/* PROTOTIP FUNKCIJA */
int main(void) { // Nisu postavljene varijable float dax, dox, lina, some; /* Postavljene varijable */ printf("C programcic --> CALCULATOR\n\nUnesi broj x:"); scanf("%e", &dax); printf("Unesi broj y:"); scanf("%e", &dox); printf("Unesi broj operacije:"); /* pocetak izbora operacije */ scanf("%e", &some); if (some == 1) lina = dax + dox; if (some == 2) lina = dax - dox; if (some == 3) lina = dax / dox; if (some == 4) lina = dax * dox; /* to care */ printf("\nDecimalni rezultat: %f", lina); puts("\n"); puts("Ovaj program je napisao Virag Otto @ 2009.\n"); printf("%i", mondo(5)); /* TO, USPELO JE */ printf("\n"); _sleep(2); /* Otisao na spavanje */ return 0; } // I tako je gotov moj prvi mali c program
Tökéletös segéd kód a C nyelv tanulására: /* * TCC - Tiny C Compiler * * Copyright (c) 2001-2004 Fabrice Bellard * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #define _GNU_SOURCE #include "config.h" #ifdef CONFIG_TCCBOOT #include "tccboot.h" #define CONFIG_TCC_STATIC #else #include <stdlib.h> #include <stdio.h> #include <stdarg.h> #include <string.h> #include <errno.h> #include <math.h> #include
#include "stab.h" #ifndef O_BINARY #define O_BINARY 0 #endif #include "libtcc.h" /* parser debug */ //#define PARSE_DEBUG /* preprocessor debug */ //#define PP_DEBUG /* include file debug */ //#define INC_DEBUG //#define MEM_DEBUG /* assembler debug */ //#define ASM_DEBUG /* target selection */ //#define TCC_TARGET_I386 /* i386 code generator */ //#define TCC_TARGET_ARM /* ARMv4 code generator */ //#define TCC_TARGET_C67 /* TMS320C67xx code generator */ /* default target is I386 */ #if !defined(TCC_TARGET_I386) && !defined(TCC_TARGET_ARM) && \ !defined(TCC_TARGET_C67) #define TCC_TARGET_I386 #endif #if !defined(WIN32) && !defined(TCC_UCLIBC) && !defined(TCC_TARGET_ARM) && \ !defined(TCC_TARGET_C67) #define CONFIG_TCC_BCHECK /* enable bound checking code */ #endif #if defined(WIN32) && !defined(TCC_TARGET_PE) #define CONFIG_TCC_STATIC #endif /* define it to include assembler support */ #if !defined(TCC_TARGET_ARM) && !defined(TCC_TARGET_C67) #define CONFIG_TCC_ASM #endif /* object format selection */ #if defined(TCC_TARGET_C67) #define TCC_TARGET_COFF #endif #define FALSE 0 #define false 0 #define TRUE 1
#define true 1 typedef int BOOL; /* path to find crt1.o, crti.o and crtn.o. Only needed when generating executables or dlls */ #define CONFIG_TCC_CRT_PREFIX "/usr/lib" #define INCLUDE_STACK_SIZE 32 #define IFDEF_STACK_SIZE 64 #define VSTACK_SIZE 256 #define STRING_MAX_SIZE 1024 #define PACK_STACK_SIZE 8 #define TOK_HASH_SIZE 8192 /* must be a power of two */ #define TOK_ALLOC_INCR 512 /* must be a power of two */ #define TOK_MAX_SIZE 4 /* token max size in int unit when stored in string */ /* token symbol management */ typedef struct TokenSym { struct TokenSym *hash_next; struct Sym *sym_define; /* direct pointer to define */ struct Sym *sym_label; /* direct pointer to label */ struct Sym *sym_struct; /* direct pointer to structure */ struct Sym *sym_identifier; /* direct pointer to identifier */ int tok; /* token number */ int len; char str[1]; } TokenSym; typedef struct CString { int size; /* size in bytes */ void *data; /* either 'char *' or 'int *' */ int size_allocated; void *data_allocated; /* if non NULL, data has been malloced */ } CString; /* type definition */ typedef struct CType { int t; struct Sym *ref; } CType; /* constant value */ typedef union CValue { long double ld; double d; float f; int i; unsigned int ui; unsigned int ul; /* address (should be unsigned long on 64 bit cpu) */ long long ll; unsigned long long ull; struct CString *cstr;
void *ptr; int tab[1]; } CValue; /* value on stack */ typedef struct SValue { CType type; /* type */ unsigned short r; /* register + flags */ unsigned short r2; /* second register, used for 'long long' type. If not used, set to VT_CONST */ CValue c; /* constant, if VT_CONST */ struct Sym *sym; /* symbol, if (VT_SYM | VT_CONST) */ } SValue; /* symbol management */ typedef struct Sym { int v; /* symbol token */ int r; /* associated register */ int c; /* associated number */ CType type; /* associated type */ struct Sym *next; /* next related symbol */ struct Sym *prev; /* prev symbol in stack */ struct Sym *prev_tok; /* previous symbol for this token */ } Sym; /* section definition */ /* XXX: use directly ELF structure for parameters ? */ /* special flag to indicate that the section should not be linked to the other ones */ #define SHF_PRIVATE 0x80000000 typedef struct Section { unsigned long data_offset; /* current data offset */ unsigned char *data; /* section data */ unsigned long data_allocated; /* used for realloc() handling */ int sh_name; /* elf section name (only used during output) */ int sh_num; /* elf section number */ int sh_type; /* elf section type */ int sh_flags; /* elf section flags */ int sh_info; /* elf section info */ int sh_addralign; /* elf section alignment */ int sh_entsize; /* elf entry size */ unsigned long sh_size; /* section size (only used during output) */ unsigned long sh_addr; /* address at which the section is relocated */ unsigned long sh_offset; /* address at which the section is relocated */ int nb_hashed_syms; /* used to resize the hash table */ struct Section *link; /* link to another section */ struct Section *reloc; /* corresponding section for relocation, if any */ struct Section *hash; /* hash table for symbols */ struct Section *next; char name[1]; /* section name */ } Section;
typedef struct DLLReference { int level; char name[1]; } DLLReference; /* GNUC attribute definition */ typedef struct AttributeDef { int aligned; int packed; Section *section; unsigned char func_call; /* FUNC_CDECL, FUNC_STDCALL, FUNC_FASTCALLx */ unsigned char dllexport; } AttributeDef; #define SYM_STRUCT 0x40000000 /* struct/union/enum symbol space */ #define SYM_FIELD 0x20000000 /* struct/union field symbol space */ #define SYM_FIRST_ANOM 0x10000000 /* first anonymous sym */ /* stored in 'Sym.c' field */ #define FUNC_NEW 1 /* ansi function prototype */ #define FUNC_OLD 2 /* old function prototype */ #define FUNC_ELLIPSIS 3 /* ansi function prototype with ... */ /* stored in 'Sym.r' field */ #define FUNC_CDECL 0 /* standard c call */ #define FUNC_STDCALL 1 /* pascal c call */ #define FUNC_FASTCALL1 2 /* first param in %eax */ #define FUNC_FASTCALL2 3 /* first parameters in %eax, %edx */ #define FUNC_FASTCALL3 4 /* first parameter in %eax, %edx, %ecx */ /* field 'Sym.t' for macros */ #define MACRO_OBJ 0 /* object like macro */ #define MACRO_FUNC 1 /* function like macro */ /* field 'Sym.r' for C labels */ #define LABEL_DEFINED 0 /* label is defined */ #define LABEL_FORWARD 1 /* label is forward defined */ #define LABEL_DECLARED 2 /* label is declared but never used */ /* type_decl() types */ #define TYPE_ABSTRACT 1 /* type without variable */ #define TYPE_DIRECT 2 /* type with variable */ #define IO_BUF_SIZE 8192 typedef struct BufferedFile { uint8_t *buf_ptr; uint8_t *buf_end; int fd; int line_num; /* current line number - here to simplify code */ int ifndef_macro; /* #ifndef macro / #endif search */ int ifndef_macro_saved; /* saved ifndef_macro */ int *ifdef_stack_ptr; /* ifdef_stack value at the start of the file */
char inc_type; /* type of include */ char inc_filename[512]; /* filename specified by the user */ char filename[1024]; /* current filename - here to simplify code */ unsigned char buffer[IO_BUF_SIZE + 1]; /* extra size for CH_EOB char */ } BufferedFile; #define CH_EOB '\\' /* end of buffer or '\0' char in file */ #define CH_EOF (-1) /* end of file */ /* parsing state (used to save parser state to reparse part of the source several times) */ typedef struct ParseState { int *macro_ptr; int line_num; int tok; CValue tokc; } ParseState; /* used to record tokens */ typedef struct TokenString { int *str; int len; int allocated_len; int last_line_num; } TokenString; /* include file cache, used to find files faster and also to eliminate inclusion if the include file is protected by #ifndef ... #endif */ typedef struct CachedInclude { int ifndef_macro; int hash_next; /* -1 if none */ char type; /* '"' or '>' to give include type */ char filename[1]; /* path specified in #include */ } CachedInclude; #define CACHED_INCLUDES_HASH_SIZE 512 /* parser */ static struct BufferedFile *file; static int ch, tok; static CValue tokc; static CString tokcstr; /* current parsed string, if any */ /* additional informations about token */ static int tok_flags; #define TOK_FLAG_BOL 0x0001 /* beginning of line before */ #define TOK_FLAG_BOF 0x0002 /* beginning of file before */ #define TOK_FLAG_ENDIF 0x0004 /* a endif was found matching starting #ifdef */ static int *macro_ptr, *macro_ptr_allocated; static int *unget_saved_macro_ptr; static int unget_saved_buffer[TOK_MAX_SIZE + 1]; static int unget_buffer_enabled; static int parse_flags;
#define PARSE_FLAG_PREPROCESS 0x0001 /* activate preprocessing */ #define PARSE_FLAG_TOK_NUM 0x0002 /* return numbers instead of TOK_PPNUM */ #define PARSE_FLAG_LINEFEED 0x0004 /* line feed is returned as a token. line feed is also returned at eof */ #define PARSE_FLAG_ASM_COMMENTS 0x0008 /* '#' can be used for line comment */ static Section *text_section, *data_section, *bss_section; /* predefined sections */ static Section *cur_text_section; /* current section where function code is generated */ #ifdef CONFIG_TCC_ASM static Section *last_text_section; /* to handle .previous asm directive */ #endif /* bound check related sections */ static Section *bounds_section; /* contains global data bound description */ static Section *lbounds_section; /* contains local data bound description */ /* symbol sections */ static Section *symtab_section, *strtab_section; /* debug sections */ static Section *stab_section, *stabstr_section; /* loc : local variable index ind : output code index rsym: return symbol anon_sym: anonymous symbol index */ static int rsym, anon_sym, ind, loc; /* expression generation modifiers */ static int const_wanted; /* true if constant wanted */ static int nocode_wanted; /* true if no code generation wanted for an expression */ static int global_expr; /* true if compound literals must be allocated globally (used during initializers parsing */ static CType func_vt; /* current function return type (used by return instruction) */ static int func_vc; static int last_line_num, last_ind, func_ind; /* debug last line number and pc */ static int tok_ident; static TokenSym **table_ident; static TokenSym *hash_ident[TOK_HASH_SIZE]; static char token_buf[STRING_MAX_SIZE + 1]; static char *funcname; static Sym *global_stack, *local_stack; static Sym *define_stack; static Sym *global_label_stack, *local_label_stack; /* symbol allocator */ #define SYM_POOL_NB (8192 / sizeof(Sym)) static Sym *sym_free_first; static SValue vstack[VSTACK_SIZE], *vtop; /* some predefined types */ static CType char_pointer_type, func_old_type, int_type; /* true if isid(c) || isnum(c) */
static unsigned char isidnum_table[256]; /* compile with debug symbol (and use them if error during execution) */ static int do_debug = 0; /* compile with built-in memory and bounds checker */ static int do_bounds_check = 0; /* display benchmark infos */ #if !defined(LIBTCC) static int do_bench = 0; #endif static int total_lines; static int total_bytes; /* use GNU C extensions */ static int gnu_ext = 1; /* use Tiny C extensions */ static int tcc_ext = 1; /* max number of callers shown if error */ static int num_callers = 6; static const char **rt_bound_error_msg; /* XXX: get rid of this ASAP */ static struct TCCState *tcc_state; /* give the path of the tcc libraries */ static const char *tcc_lib_path = CONFIG_TCCDIR; struct TCCState { int output_type; BufferedFile **include_stack_ptr; int *ifdef_stack_ptr; /* include file handling */ char **include_paths; int nb_include_paths; char **sysinclude_paths; int nb_sysinclude_paths; CachedInclude **cached_includes; int nb_cached_includes; char **library_paths; int nb_library_paths; /* array of all loaded dlls (including those referenced by loaded dlls) */ DLLReference **loaded_dlls; int nb_loaded_dlls;
/* sections */ Section **sections; int nb_sections; /* number of sections, including first dummy section */ /* got handling */ Section *got; Section *plt; unsigned long *got_offsets; int nb_got_offsets; /* give the correspondance from symtab indexes to dynsym indexes */ int *symtab_to_dynsym; /* temporary dynamic symbol sections (for dll loading) */ Section *dynsymtab_section; /* exported dynamic symbol section */ Section *dynsym; int nostdinc; /* if true, no standard headers are added */ int nostdlib; /* if true, no standard libraries are added */ int nocommon; /* if true, do not use common symbols for .bss data */ /* if true, static linking is performed */ int static_link; /* if true, all symbols are exported */ int rdynamic; /* if true, only link in referenced objects from archive */ int alacarte_link; /* address of text section */ unsigned long text_addr; int has_text_addr; /* output format, see TCC_OUTPUT_FORMAT_xxx */ int output_format; /* C language options */ int char_is_unsigned; int leading_underscore; /* warning switches */ int warn_write_strings; int warn_unsupported; int warn_error; int warn_none; int warn_implicit_function_declaration; /* error handling */ void *error_opaque; void (*error_func)(void *opaque, const char *msg); int error_set_jmp_enabled;
jmp_buf error_jmp_buf; int nb_errors; /* tiny assembler state */ Sym *asm_labels; /* see include_stack_ptr */ BufferedFile *include_stack[INCLUDE_STACK_SIZE]; /* see ifdef_stack_ptr */ int ifdef_stack[IFDEF_STACK_SIZE]; /* see cached_includes */ int cached_includes_hash[CACHED_INCLUDES_HASH_SIZE]; /* pack stack */ int pack_stack[PACK_STACK_SIZE]; int *pack_stack_ptr; }; /* The current value can be: */ #define VT_VALMASK 0x00ff #define VT_CONST 0x00f0 /* constant in vc (must be first non register value) */ #define VT_LLOCAL 0x00f1 /* lvalue, offset on stack */ #define VT_LOCAL 0x00f2 /* offset on stack */ #define VT_CMP 0x00f3 /* the value is stored in processor flags (in vc) */ #define VT_JMP 0x00f4 /* value is the consequence of jmp true (even) */ #define VT_JMPI 0x00f5 /* value is the consequence of jmp false (odd) */ #define VT_LVAL 0x0100 /* var is an lvalue */ #define VT_SYM 0x0200 /* a symbol value is added */ #define VT_MUSTCAST 0x0400 /* value must be casted to be correct (used for char/short stored in integer registers) */ #define VT_MUSTBOUND 0x0800 /* bound checking must be done before dereferencing value */ #define VT_BOUNDED 0x8000 /* value is bounded. The address of the bounding function call point is in vc */ #define VT_LVAL_BYTE 0x1000 /* lvalue is a byte */ #define VT_LVAL_SHORT 0x2000 /* lvalue is a short */ #define VT_LVAL_UNSIGNED 0x4000 /* lvalue is unsigned */ #define VT_LVAL_TYPE (VT_LVAL_BYTE | VT_LVAL_SHORT | VT_LVAL_UNSIGNED) /* types */ #define VT_INT 0 /* integer type */ #define VT_BYTE 1 /* signed byte type */ #define VT_SHORT 2 /* short type */ #define VT_VOID 3 /* void type */ #define VT_PTR 4 /* pointer */ #define VT_ENUM 5 /* enum definition */ #define VT_FUNC 6 /* function type */ #define VT_STRUCT 7 /* struct/union definition */ #define VT_FLOAT 8 /* IEEE float */ #define VT_DOUBLE 9 /* IEEE double */
#define VT_LDOUBLE 10 /* IEEE long double */ #define VT_BOOL 11 /* ISOC99 boolean type */ #define VT_LLONG 12 /* 64 bit integer */ #define VT_LONG 13 /* long integer (NEVER USED as type, only during parsing) */ #define VT_BTYPE 0x000f /* mask for basic type */ #define VT_UNSIGNED 0x0010 /* unsigned type */ #define VT_ARRAY 0x0020 /* array type (also has VT_PTR) */ #define VT_BITFIELD 0x0040 /* bitfield modifier */ #define VT_CONSTANT 0x0800 /* const modifier */ #define VT_VOLATILE 0x1000 /* volatile modifier */ #define VT_SIGNED 0x2000 /* signed type */ /* storage */ #define VT_EXTERN 0x00000080 /* extern definition */ #define VT_STATIC 0x00000100 /* static variable */ #define VT_TYPEDEF 0x00000200 /* typedef definition */ #define VT_INLINE 0x00000400 /* inline definition */ #define VT_STRUCT_SHIFT 16 /* shift for bitfield shift values */ /* type mask (except storage) */ #define VT_STORAGE (VT_EXTERN | VT_STATIC | VT_TYPEDEF | VT_INLINE) #define VT_TYPE (~(VT_STORAGE)) /* token values */ /* warning: the following compare tokens depend on i386 asm code */ #define TOK_ULT 0x92 #define TOK_UGE 0x93 #define TOK_EQ 0x94 #define TOK_NE 0x95 #define TOK_ULE 0x96 #define TOK_UGT 0x97 #define TOK_LT 0x9c #define TOK_GE 0x9d #define TOK_LE 0x9e #define TOK_GT 0x9f #define TOK_LAND 0xa0 #define TOK_LOR 0xa1 #define TOK_DEC 0xa2 #define TOK_MID 0xa3 /* inc/dec, to void constant */ #define TOK_INC 0xa4 #define TOK_UDIV 0xb0 /* unsigned division */ #define TOK_UMOD 0xb1 /* unsigned modulo */ #define TOK_PDIV 0xb2 /* fast division with undefined rounding for pointers */ #define TOK_CINT 0xb3 /* number in tokc */ #define TOK_CCHAR 0xb4 /* char constant in tokc */ #define TOK_STR 0xb5 /* pointer to string in tokc */ #define TOK_TWOSHARPS 0xb6 /* ## preprocessing token */ #define TOK_LCHAR 0xb7
#define TOK_LSTR 0xb8 #define TOK_CFLOAT 0xb9 /* float constant */ #define TOK_LINENUM 0xba /* line number info */ #define TOK_CDOUBLE 0xc0 /* double constant */ #define TOK_CLDOUBLE 0xc1 /* long double constant */ #define TOK_UMULL 0xc2 /* unsigned 32x32 -> 64 mul */ #define TOK_ADDC1 0xc3 /* add with carry generation */ #define TOK_ADDC2 0xc4 /* add with carry use */ #define TOK_SUBC1 0xc5 /* add with carry generation */ #define TOK_SUBC2 0xc6 /* add with carry use */ #define TOK_CUINT 0xc8 /* unsigned int constant */ #define TOK_CLLONG 0xc9 /* long long constant */ #define TOK_CULLONG 0xca /* unsigned long long constant */ #define TOK_ARROW 0xcb #define TOK_DOTS 0xcc /* three dots */ #define TOK_SHR 0xcd /* unsigned shift right */ #define TOK_PPNUM 0xce /* preprocessor number */ #define TOK_SHL 0x01 /* shift left */ #define TOK_SAR 0x02 /* signed shift right */ /* assignement operators : normal operator or 0x80 */ #define TOK_A_MOD 0xa5 #define TOK_A_AND 0xa6 #define TOK_A_MUL 0xaa #define TOK_A_ADD 0xab #define TOK_A_SUB 0xad #define TOK_A_DIV 0xaf #define TOK_A_XOR 0xde #define TOK_A_OR 0xfc #define TOK_A_SHL 0x81 #define TOK_A_SAR 0x82 #ifndef offsetof #define offsetof(type, field) ((size_t) &((type *)0)->field) #endif #ifndef countof #define countof(tab) (sizeof(tab) / sizeof((tab)[0])) #endif /* WARNING: the content of this string encodes token numbers */ static char tok_two_chars[] = "<=\236>=\235!=\225&&\240||\241++\244--\242==\224<<\1>>\2+=\253=\255*=\252/=\257%=\245&=\246^=\336|=\374->\313..\250##\266"; #define TOK_EOF (-1) /* end of file */ #define TOK_LINEFEED 10 /* line feed */ /* all identificators and strings have token above that */ #define TOK_IDENT 256 /* only used for i386 asm opcodes definitions */ #define DEF_ASM(x) DEF(TOK_ASM_ ## x, #x)
#define DEF_BWL(x) \ DEF(TOK_ASM_ ## x ## b, #x "b") \ DEF(TOK_ASM_ ## x ## w, #x "w") \ DEF(TOK_ASM_ ## x ## l, #x "l") \ DEF(TOK_ASM_ ## x, #x) #define DEF_WL(x) \ DEF(TOK_ASM_ ## x ## w, #x "w") \ DEF(TOK_ASM_ ## x ## l, #x "l") \ DEF(TOK_ASM_ ## x, #x) #define DEF_FP1(x) \ DEF(TOK_ASM_ ## f ## x ## s, "f" #x "s") \ DEF(TOK_ASM_ ## fi ## x ## l, "fi" #x "l") \ DEF(TOK_ASM_ ## f ## x ## l, "f" #x "l") \ DEF(TOK_ASM_ ## fi ## x ## s, "fi" #x "s") #define DEF_FP(x) \ DEF(TOK_ASM_ ## f ## x, "f" #x ) \ DEF(TOK_ASM_ ## f ## x ## p, "f" #x "p") \ DEF_FP1(x) #define DEF_ASMTEST(x) \ DEF_ASM(x ## o) \ DEF_ASM(x ## no) \ DEF_ASM(x ## b) \ DEF_ASM(x ## c) \ DEF_ASM(x ## nae) \ DEF_ASM(x ## nb) \ DEF_ASM(x ## nc) \ DEF_ASM(x ## ae) \ DEF_ASM(x ## e) \ DEF_ASM(x ## z) \ DEF_ASM(x ## ne) \ DEF_ASM(x ## nz) \ DEF_ASM(x ## be) \ DEF_ASM(x ## na) \ DEF_ASM(x ## nbe) \ DEF_ASM(x ## a) \ DEF_ASM(x ## s) \ DEF_ASM(x ## ns) \ DEF_ASM(x ## p) \ DEF_ASM(x ## pe) \ DEF_ASM(x ## np) \ DEF_ASM(x ## po) \ DEF_ASM(x ## l) \ DEF_ASM(x ## nge) \ DEF_ASM(x ## nl) \ DEF_ASM(x ## ge) \ DEF_ASM(x ## le) \ DEF_ASM(x ## ng) \ DEF_ASM(x ## nle) \
DEF_ASM(x ## g) #define TOK_ASM_int TOK_INT enum tcc_token { TOK_LAST = TOK_IDENT - 1, #define DEF(id, str) id, #include "tcctok.h" #undef DEF }; static const char tcc_keywords[] = #define DEF(id, str) str "\0" #include "tcctok.h" #undef DEF ; #define TOK_UIDENT TOK_DEFINE #ifdef WIN32 int __stdcall GetModuleFileNameA(void *, char *, int); void *__stdcall GetProcAddress(void *, const char *); void *__stdcall GetModuleHandleA(const char *); void *__stdcall LoadLibraryA(const char *); int __stdcall FreeConsole(void); #define snprintf _snprintf #define vsnprintf _vsnprintf #ifndef __GNUC__ #define strtold (long double)strtod #define strtof (float)strtod #define strtoll (long long)strtol #endif #elif defined(TCC_UCLIBC) || defined(__FreeBSD__) /* currently incorrect */ long double strtold(const char *nptr, char **endptr) { return (long double)strtod(nptr, endptr); } float strtof(const char *nptr, char **endptr) { return (float)strtod(nptr, endptr); } #else /* XXX: need to define this to use them in non ISOC99 context */ extern float strtof (const char *__nptr, char **__endptr); extern long double strtold (const char *__nptr, char **__endptr); #endif static char *pstrcpy(char *buf, int buf_size, const char *s); static char *pstrcat(char *buf, int buf_size, const char *s); static const char *tcc_basename(const char *name);
static void next(void); static void next_nomacro(void); static void parse_expr_type(CType *type); static void expr_type(CType *type); static void unary_type(CType *type); static void block(int *bsym, int *csym, int *case_sym, int *def_sym, int case_reg, int is_expr); static int expr_const(void); static void expr_eq(void); static void gexpr(void); static void gen_inline_functions(void); static void decl(int l); static void decl_initializer(CType *type, Section *sec, unsigned long c, int first, int size_only); static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r, int has_init, int v, int scope); int gv(int rc); void gv2(int rc1, int rc2); void move_reg(int r, int s); void save_regs(int n); void save_reg(int r); void vpop(void); void vswap(void); void vdup(void); int get_reg(int rc); int get_reg_ex(int rc,int rc2); struct macro_level { struct macro_level *prev; int *p; }; static void macro_subst(TokenString *tok_str, Sym **nested_list, const int *macro_str, struct macro_level **can_read_stream); void gen_op(int op); void force_charshort_cast(int t); static void gen_cast(CType *type); void vstore(void); static Sym *sym_find(int v); static Sym *sym_push(int v, CType *type, int r, int c); /* type handling */ static int type_size(CType *type, int *a); static inline CType *pointed_type(CType *type); static int pointed_size(CType *type); static int lvalue_type(int t); static int parse_btype(CType *type, AttributeDef *ad); static void type_decl(CType *type, AttributeDef *ad, int *v, int td); static int is_compatible_types(CType *type1, CType *type2); int ieee_finite(double d); void error(const char *fmt, ...); void vpushi(int v);
void vrott(int n); void vnrott(int n); void lexpand_nr(void); static void vpush_global_sym(CType *type, int v); void vset(CType *type, int r, int v); void type_to_str(char *buf, int buf_size, CType *type, const char *varstr); char *get_tok_str(int v, CValue *cv); static Sym *get_sym_ref(CType *type, Section *sec, unsigned long offset, unsigned long size); static Sym *external_global_sym(int v, CType *type, int r); /* section generation */ static void section_realloc(Section *sec, unsigned long new_size); static void *section_ptr_add(Section *sec, unsigned long size); static void put_extern_sym(Sym *sym, Section *section, unsigned long value, unsigned long size); static void greloc(Section *s, Sym *sym, unsigned long addr, int type); static int put_elf_str(Section *s, const char *sym); static int put_elf_sym(Section *s, unsigned long value, unsigned long size, int info, int other, int shndx, const char *name); static int add_elf_sym(Section *s, unsigned long value, unsigned long size, int info, int other, int sh_num, const char *name); static void put_elf_reloc(Section *symtab, Section *s, unsigned long offset, int type, int symbol); static void put_stabs(const char *str, int type, int other, int desc, unsigned long value); static void put_stabs_r(const char *str, int type, int other, int desc, unsigned long value, Section *sec, int sym_index); static void put_stabn(int type, int other, int desc, int value); static void put_stabd(int type, int other, int desc); static int tcc_add_dll(TCCState *s, const char *filename, int flags); #define AFF_PRINT_ERROR 0x0001 /* print error if file not found */ #define AFF_REFERENCED_DLL 0x0002 /* load a referenced dll from another dll */ static int tcc_add_file_internal(TCCState *s, const char *filename, int flags); /* tcccoff.c */ int tcc_output_coff(TCCState *s1, FILE *f); /* tccpe.c */ void *resolve_sym(TCCState *s1, const char *sym, int type); int pe_load_def_file(struct TCCState *s1, FILE *fp); void pe_setup_paths(struct TCCState *s1, int *p_output_type, const char **p_outfile, char *first_file); unsigned long pe_add_runtime(struct TCCState *s1); int tcc_output_pe(struct TCCState *s1, const char *filename); /* tccasm.c */ #ifdef CONFIG_TCC_ASM typedef struct ExprValue {
uint32_t v; Sym *sym; } ExprValue; #define MAX_ASM_OPERANDS 30 typedef struct ASMOperand { int id; /* GCC 3 optionnal identifier (0 if number only supported */ char *constraint; char asm_str[16]; /* computed asm string for operand */ SValue *vt; /* C value of the expression */ int ref_index; /* if >= 0, gives reference to a output constraint */ int input_index; /* if >= 0, gives reference to an input constraint */ int priority; /* priority, used to assign registers */ int reg; /* if >= 0, register number used for this operand */ int is_llong; /* true if double register value */ int is_memory; /* true if memory operand */ int is_rw; /* for '+' modifier */ } ASMOperand; static void asm_expr(TCCState *s1, ExprValue *pe); static int asm_int_expr(TCCState *s1); static int find_constraint(ASMOperand *operands, int nb_operands, const char *name, const char **pp); static int tcc_assemble(TCCState *s1, int do_preprocess); #endif static void asm_instr(void); static void asm_global_instr(void); /* true if float/double/long double type */ static inline int is_float(int t) { int bt; bt = t & VT_BTYPE; return bt == VT_LDOUBLE || bt == VT_DOUBLE || bt == VT_FLOAT; } #ifdef TCC_TARGET_I386 #include "i386-gen.c" #endif #ifdef TCC_TARGET_ARM #include "arm-gen.c" #endif #ifdef TCC_TARGET_C67 #include "c67-gen.c" #endif #ifdef CONFIG_TCC_STATIC
#define RTLD_LAZY 0x001 #define RTLD_NOW 0x002 #define RTLD_GLOBAL 0x100 #define RTLD_DEFAULT NULL /* dummy function for profiling */ void *dlopen(const char *filename, int flag) { return NULL; } const char *dlerror(void) { return "error"; } typedef struct TCCSyms { char *str; void *ptr; } TCCSyms; #define TCCSYM(a) { #a, &a, }, /* add the symbol you want here if no dynamic linking is done */ static TCCSyms tcc_syms[] = { #if !defined(CONFIG_TCCBOOT) TCCSYM(printf) TCCSYM(fprintf) TCCSYM(fopen) TCCSYM(fclose) #endif { NULL, NULL }, }; void *resolve_sym(TCCState *s1, const char *symbol, int type) { TCCSyms *p; p = tcc_syms; while (p->str != NULL) { if (!strcmp(p->str, symbol)) return p->ptr; p++; } return NULL; } #elif !defined(WIN32) #include
return dlsym(RTLD_DEFAULT, sym); } #endif /********************************************************/ /* we use our own 'finite' function to avoid potential problems with non standard math libs */ /* XXX: endianness dependent */ int ieee_finite(double d) { int *p = (int *)&d; return ((unsigned)((p[1] | 0x800fffff) + 1)) >> 31; } /* copy a string and truncate it. */ static char *pstrcpy(char *buf, int buf_size, const char *s) { char *q, *q_end; int c; if (buf_size > 0) { q = buf; q_end = buf + buf_size - 1; while (q < q_end) { c = *s++; if (c == '\0') break; *q++ = c; } *q = '\0'; } return buf; } /* strcat and truncate. */ static char *pstrcat(char *buf, int buf_size, const char *s) { int len; len = strlen(buf); if (len < buf_size) pstrcpy(buf + len, buf_size - len, s); return buf; } static int strstart(const char *str, const char *val, const char **ptr) { const char *p, *q; p = str; q = val; while (*q != '\0') { if (*p != *q)
return 0; p++; q++; } if (ptr) *ptr = p; return 1; } /* memory management */ #ifdef MEM_DEBUG int mem_cur_size; int mem_max_size; #endif static inline void tcc_free(void *ptr) { #ifdef MEM_DEBUG mem_cur_size -= malloc_usable_size(ptr); #endif free(ptr); } static void *tcc_malloc(unsigned long size) { void *ptr; ptr = malloc(size); if (!ptr && size) error("memory full"); #ifdef MEM_DEBUG mem_cur_size += malloc_usable_size(ptr); if (mem_cur_size > mem_max_size) mem_max_size = mem_cur_size; #endif return ptr; } static void *tcc_mallocz(unsigned long size) { void *ptr; ptr = tcc_malloc(size); memset(ptr, 0, size); return ptr; } static inline void *tcc_realloc(void *ptr, unsigned long size) { void *ptr1; #ifdef MEM_DEBUG mem_cur_size -= malloc_usable_size(ptr); #endif ptr1 = realloc(ptr, size); #ifdef MEM_DEBUG
/* NOTE: count not correct if alloc error, but not critical */ mem_cur_size += malloc_usable_size(ptr1); if (mem_cur_size > mem_max_size) mem_max_size = mem_cur_size; #endif return ptr1; } static char *tcc_strdup(const char *str) { char *ptr; ptr = tcc_malloc(strlen(str) + 1); strcpy(ptr, str); return ptr; } #define free(p) use_tcc_free(p) #define malloc(s) use_tcc_malloc(s) #define realloc(p, s) use_tcc_realloc(p, s) static void dynarray_add(void ***ptab, int *nb_ptr, void *data) { int nb, nb_alloc; void **pp; nb = *nb_ptr; pp = *ptab; /* every power of two we double array size */ if ((nb & (nb - 1)) == 0) { if (!nb) nb_alloc = 1; else nb_alloc = nb * 2; pp = tcc_realloc(pp, nb_alloc * sizeof(void *)); if (!pp) error("memory full"); *ptab = pp; } pp[nb++] = data; *nb_ptr = nb; } /* symbol allocator */ static Sym *__sym_malloc(void) { Sym *sym_pool, *sym, *last_sym; int i; sym_pool = tcc_malloc(SYM_POOL_NB * sizeof(Sym)); last_sym = sym_free_first; sym = sym_pool; for(i = 0; i < SYM_POOL_NB; i++) {
sym->next = last_sym; last_sym = sym; sym++; } sym_free_first = last_sym; return last_sym; } static inline Sym *sym_malloc(void) { Sym *sym; sym = sym_free_first; if (!sym) sym = __sym_malloc(); sym_free_first = sym->next; return sym; } static inline void sym_free(Sym *sym) { sym->next = sym_free_first; sym_free_first = sym; } Section *new_section(TCCState *s1, const char *name, int sh_type, int sh_flags) { Section *sec; sec = tcc_mallocz(sizeof(Section) + strlen(name)); strcpy(sec->name, name); sec->sh_type = sh_type; sec->sh_flags = sh_flags; switch(sh_type) { case SHT_HASH: case SHT_REL: case SHT_DYNSYM: case SHT_SYMTAB: case SHT_DYNAMIC: sec->sh_addralign = 4; break; case SHT_STRTAB: sec->sh_addralign = 1; break; default: sec->sh_addralign = 32; /* default conservative alignment */ break; } /* only add section if not private */ if (!(sh_flags & SHF_PRIVATE)) { sec->sh_num = s1->nb_sections; dynarray_add((void ***)&s1->sections, &s1->nb_sections, sec); }
return sec; } static void free_section(Section *s) { tcc_free(s->data); tcc_free(s); } /* realloc section and set its content to zero */ static void section_realloc(Section *sec, unsigned long new_size) { unsigned long size; unsigned char *data; size = sec->data_allocated; if (size == 0) size = 1; while (size < new_size) size = size * 2; data = tcc_realloc(sec->data, size); if (!data) error("memory full"); memset(data + sec->data_allocated, 0, size - sec->data_allocated); sec->data = data; sec->data_allocated = size; } /* reserve at least 'size' bytes in section 'sec' from sec->data_offset. */ static void *section_ptr_add(Section *sec, unsigned long size) { unsigned long offset, offset1; offset = sec->data_offset; offset1 = offset + size; if (offset1 > sec->data_allocated) section_realloc(sec, offset1); sec->data_offset = offset1; return sec->data + offset; } /* return a reference to a section, and create it if it does not exists */ Section *find_section(TCCState *s1, const char *name) { Section *sec; int i; for(i = 1; i < s1->nb_sections; i++) { sec = s1->sections[i]; if (!strcmp(name, sec->name)) return sec; }
/* sections are created as PROGBITS */ return new_section(s1, name, SHT_PROGBITS, SHF_ALLOC); } #define SECTION_ABS ((void *)1) /* update sym->c so that it points to an external symbol in section 'section' with value 'value' */ static void put_extern_sym2(Sym *sym, Section *section, unsigned long value, unsigned long size, int can_add_underscore) { int sym_type, sym_bind, sh_num, info; Elf32_Sym *esym; const char *name; char buf1[256]; if (section == NULL) sh_num = SHN_UNDEF; else if (section == SECTION_ABS) sh_num = SHN_ABS; else sh_num = section->sh_num; if (!sym->c) { if ((sym->type.t & VT_BTYPE) == VT_FUNC) sym_type = STT_FUNC; else sym_type = STT_OBJECT; if (sym->type.t & VT_STATIC) sym_bind = STB_LOCAL; else sym_bind = STB_GLOBAL; name = get_tok_str(sym->v, NULL); #ifdef CONFIG_TCC_BCHECK if (do_bounds_check) { char buf[32]; /* XXX: avoid doing that for statics ? */ /* if bound checking is activated, we change some function names by adding the "__bound" prefix */ switch(sym->v) { #if 0 /* XXX: we rely only on malloc hooks */ case TOK_malloc: case TOK_free: case TOK_realloc: case TOK_memalign: case TOK_calloc: #endif case TOK_memcpy: case TOK_memmove: case TOK_memset:
case TOK_strlen: case TOK_strcpy: strcpy(buf, "__bound_"); strcat(buf, name); name = buf; break; } } #endif if (tcc_state->leading_underscore && can_add_underscore) { buf1[0] = '_'; pstrcpy(buf1 + 1, sizeof(buf1) - 1, name); name = buf1; } info = ELF32_ST_INFO(sym_bind, sym_type); sym->c = add_elf_sym(symtab_section, value, size, info, 0, sh_num, name); } else { esym = &((Elf32_Sym *)symtab_section->data)[sym->c]; esym->st_value = value; esym->st_size = size; esym->st_shndx = sh_num; } } static void put_extern_sym(Sym *sym, Section *section, unsigned long value, unsigned long size) { put_extern_sym2(sym, section, value, size, 1); } /* add a new relocation entry to symbol 'sym' in section 's' */ static void greloc(Section *s, Sym *sym, unsigned long offset, int type) { if (!sym->c) put_extern_sym(sym, NULL, 0, 0); /* now we can add ELF relocation info */ put_elf_reloc(symtab_section, s, offset, type, sym->c); } static inline int isid(int c) { return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '_'; } static inline int isnum(int c) { return c >= '0' && c <= '9'; } static inline int isoct(int c) {
return c >= '0' && c <= '7'; } static inline int toup(int c) { if (c >= 'a' && c <= 'z') return c - 'a' + 'A'; else return c; } static void strcat_vprintf(char *buf, int buf_size, const char *fmt, va_list ap) { int len; len = strlen(buf); vsnprintf(buf + len, buf_size - len, fmt, ap); } static void strcat_printf(char *buf, int buf_size, const char *fmt, ...) { va_list ap; va_start(ap, fmt); strcat_vprintf(buf, buf_size, fmt, ap); va_end(ap); } void error1(TCCState *s1, int is_warning, const char *fmt, va_list ap) { char buf[2048]; BufferedFile **f; buf[0] = '\0'; if (file) { for(f = s1->include_stack; f < s1->include_stack_ptr; f++) strcat_printf(buf, sizeof(buf), "In file included from %s:%d:\n", (*f)->filename, (*f)->line_num); if (file->line_num > 0) { strcat_printf(buf, sizeof(buf), "%s:%d: ", file->filename, file->line_num); } else { strcat_printf(buf, sizeof(buf), "%s: ", file->filename); } } else { strcat_printf(buf, sizeof(buf), "tcc: "); } if (is_warning) strcat_printf(buf, sizeof(buf), "warning: "); strcat_vprintf(buf, sizeof(buf), fmt, ap); if (!s1->error_func) { /* default case: stderr */
fprintf(stderr, "%s\n", buf); } else { s1->error_func(s1->error_opaque, buf); } if (!is_warning || s1->warn_error) s1->nb_errors++; } #ifdef LIBTCC void tcc_set_error_func(TCCState *s, void *error_opaque, void (*error_func)(void *opaque, const char *msg)) { s->error_opaque = error_opaque; s->error_func = error_func; } #endif /* error without aborting current compilation */ void error_noabort(const char *fmt, ...) { TCCState *s1 = tcc_state; va_list ap; va_start(ap, fmt); error1(s1, 0, fmt, ap); va_end(ap); } void error(const char *fmt, ...) { TCCState *s1 = tcc_state; va_list ap; va_start(ap, fmt); error1(s1, 0, fmt, ap); va_end(ap); /* better than nothing: in some cases, we accept to handle errors */ if (s1->error_set_jmp_enabled) { longjmp(s1->error_jmp_buf, 1); } else { /* XXX: eliminate this someday */ exit(1); } } void expect(const char *msg) { error("%s expected", msg); } void warning(const char *fmt, ...) { TCCState *s1 = tcc_state;
va_list ap; if (s1->warn_none) return; va_start(ap, fmt); error1(s1, 1, fmt, ap); va_end(ap); } void skip(int c) { if (tok != c) error("'%c' expected", c); next(); } static void test_lvalue(void) { if (!(vtop->r & VT_LVAL)) expect("lvalue"); } /* allocate a new token */ static TokenSym *tok_alloc_new(TokenSym **pts, const char *str, int len) { TokenSym *ts, **ptable; int i; if (tok_ident >= SYM_FIRST_ANOM) error("memory full"); /* expand token table if needed */ i = tok_ident - TOK_IDENT; if ((i % TOK_ALLOC_INCR) == 0) { ptable = tcc_realloc(table_ident, (i + TOK_ALLOC_INCR) * sizeof(TokenSym *)); if (!ptable) error("memory full"); table_ident = ptable; } ts = tcc_malloc(sizeof(TokenSym) + len); table_ident[i] = ts; ts->tok = tok_ident++; ts->sym_define = NULL; ts->sym_label = NULL; ts->sym_struct = NULL; ts->sym_identifier = NULL; ts->len = len; ts->hash_next = NULL; memcpy(ts->str, str, len); ts->str[len] = '\0'; *pts = ts;
return ts; } #define TOK_HASH_INIT 1 #define TOK_HASH_FUNC(h, c) ((h) * 263 + (c)) /* find a token and add it if not found */ static TokenSym *tok_alloc(const char *str, int len) { TokenSym *ts, **pts; int i; unsigned int h; h = TOK_HASH_INIT; for(i=0;i
int size; size = cstr->size + 1; if (size > cstr->size_allocated) cstr_realloc(cstr, size); ((unsigned char *)cstr->data)[size - 1] = ch; cstr->size = size; } static void cstr_cat(CString *cstr, const char *str) { int c; for(;;) { c = *str; if (c == '\0') break; cstr_ccat(cstr, c); str++; } } /* add a wide char */ static void cstr_wccat(CString *cstr, int ch) { int size; size = cstr->size + sizeof(int); if (size > cstr->size_allocated) cstr_realloc(cstr, size); *(int *)(((unsigned char *)cstr->data) + size - sizeof(int)) = ch; cstr->size = size; } static void cstr_new(CString *cstr) { memset(cstr, 0, sizeof(CString)); } /* free string and reset it to NULL */ static void cstr_free(CString *cstr) { tcc_free(cstr->data_allocated); cstr_new(cstr); } #define cstr_reset(cstr) cstr_free(cstr) /* XXX: unicode ? */ static void add_char(CString *cstr, int c) { if (c == '\'' || c == '\"' || c == '\\') { /* XXX: could be more precise if char or string */ cstr_ccat(cstr, '\\'); } if (c >= 32 && c <= 126) {
cstr_ccat(cstr, c); } else { cstr_ccat(cstr, '\\'); if (c == '\n') { cstr_ccat(cstr, 'n'); } else { cstr_ccat(cstr, '0' + ((c >> 6) & 7)); cstr_ccat(cstr, '0' + ((c >> 3) & 7)); cstr_ccat(cstr, '0' + (c & 7)); } } } /* XXX: buffer overflow */ /* XXX: float tokens */ char *get_tok_str(int v, CValue *cv) { static char buf[STRING_MAX_SIZE + 1]; static CString cstr_buf; CString *cstr; unsigned char *q; char *p; int i, len; /* NOTE: to go faster, we give a fixed buffer for small strings */ cstr_reset(&cstr_buf); cstr_buf.data = buf; cstr_buf.size_allocated = sizeof(buf); p = buf; switch(v) { case TOK_CINT: case TOK_CUINT: /* XXX: not quite exact, but only useful for testing */ sprintf(p, "%u", cv->ui); break; case TOK_CLLONG: case TOK_CULLONG: /* XXX: not quite exact, but only useful for testing */ sprintf(p, "%Lu", cv->ull); break; case TOK_CCHAR: case TOK_LCHAR: cstr_ccat(&cstr_buf, '\''); add_char(&cstr_buf, cv->i); cstr_ccat(&cstr_buf, '\''); cstr_ccat(&cstr_buf, '\0'); break; case TOK_PPNUM: cstr = cv->cstr; len = cstr->size - 1; for(i=0;i
cstr_ccat(&cstr_buf, '\0'); break; case TOK_STR: case TOK_LSTR: cstr = cv->cstr; cstr_ccat(&cstr_buf, '\"'); if (v == TOK_STR) { len = cstr->size - 1; for(i=0;i
break; } return cstr_buf.data; } /* push, without hashing */ static Sym *sym_push2(Sym **ps, int v, int t, int c) { Sym *s; s = sym_malloc(); s->v = v; s->type.t = t; s->c = c; s->next = NULL; /* add in stack */ s->prev = *ps; *ps = s; return s; } /* find a symbol and return its associated structure. 's' is the top of the symbol stack */ static Sym *sym_find2(Sym *s, int v) { while (s) { if (s->v == v) return s; s = s->prev; } return NULL; } /* structure lookup */ static inline Sym *struct_find(int v) { v -= TOK_IDENT; if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT)) return NULL; return table_ident[v]->sym_struct; } /* find an identifier */ static inline Sym *sym_find(int v) { v -= TOK_IDENT; if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT)) return NULL; return table_ident[v]->sym_identifier; } /* push a given symbol on the symbol stack */ static Sym *sym_push(int v, CType *type, int r, int c) {
Sym *s, **ps; TokenSym *ts; if (local_stack) ps = &local_stack; else ps = &global_stack; s = sym_push2(ps, v, type->t, c); s->type.ref = type->ref; s->r = r; /* don't record fields or anonymous symbols */ /* XXX: simplify */ if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) { /* record symbol in token array */ ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT]; if (v & SYM_STRUCT) ps = &ts->sym_struct; else ps = &ts->sym_identifier; s->prev_tok = *ps; *ps = s; } return s; } /* push a global identifier */ static Sym *global_identifier_push(int v, int t, int c) { Sym *s, **ps; s = sym_push2(&global_stack, v, t, c); /* don't record anonymous symbol */ if (v < SYM_FIRST_ANOM) { ps = &table_ident[v - TOK_IDENT]->sym_identifier; /* modify the top most local identifier, so that sym_identifier will point to 's' when popped */ while (*ps != NULL) ps = &(*ps)->prev_tok; s->prev_tok = NULL; *ps = s; } return s; } /* pop symbols until top reaches 'b' */ static void sym_pop(Sym **ptop, Sym *b) { Sym *s, *ss, **ps; TokenSym *ts; int v; s = *ptop; while(s != b) { ss = s->prev;
v = s->v; /* remove symbol in token array */ /* XXX: simplify */ if (!(v & SYM_FIELD) && (v & ~SYM_STRUCT) < SYM_FIRST_ANOM) { ts = table_ident[(v & ~SYM_STRUCT) - TOK_IDENT]; if (v & SYM_STRUCT) ps = &ts->sym_struct; else ps = &ts->sym_identifier; *ps = s->prev_tok; } sym_free(s); s = ss; } *ptop = b; } /* I/O layer */ BufferedFile *tcc_open(TCCState *s1, const char *filename) { int fd; BufferedFile *bf; fd = open(filename, O_RDONLY | O_BINARY); if (fd < 0) return NULL; bf = tcc_malloc(sizeof(BufferedFile)); if (!bf) { close(fd); return NULL; } bf->fd = fd; bf->buf_ptr = bf->buffer; bf->buf_end = bf->buffer; bf->buffer[0] = CH_EOB; /* put eob symbol */ pstrcpy(bf->filename, sizeof(bf->filename), filename); bf->line_num = 1; bf->ifndef_macro = 0; bf->ifdef_stack_ptr = s1->ifdef_stack_ptr; // printf("opening '%s'\n", filename); return bf; } void tcc_close(BufferedFile *bf) { total_lines += bf->line_num; close(bf->fd); tcc_free(bf); } /* fill input buffer and peek next char */ static int tcc_peekc_slow(BufferedFile *bf)
{ int len; /* only tries to read if really end of buffer */ if (bf->buf_ptr >= bf->buf_end) { if (bf->fd != -1) { #if defined(PARSE_DEBUG) len = 8; #else len = IO_BUF_SIZE; #endif len = read(bf->fd, bf->buffer, len); if (len < 0) len = 0; } else { len = 0; } total_bytes += len; bf->buf_ptr = bf->buffer; bf->buf_end = bf->buffer + len; *bf->buf_end = CH_EOB; } if (bf->buf_ptr < bf->buf_end) { return bf->buf_ptr[0]; } else { bf->buf_ptr = bf->buf_end; return CH_EOF; } } /* return the current character, handling end of block if necessary (but not stray) */ static int handle_eob(void) { return tcc_peekc_slow(file); } /* read next char from current input file and handle end of input buffer */ static inline void inp(void) { ch = *(++(file->buf_ptr)); /* end of buffer/file handling */ if (ch == CH_EOB) ch = handle_eob(); } /* handle '\[\r]\n' */ static void handle_stray(void) { while (ch == '\\') { inp(); if (ch == '\n') { file->line_num++; inp();
} else if (ch == '\r') { inp(); if (ch != '\n') goto fail; file->line_num++; inp(); } else { fail: error("stray '\\' in program"); } } } /* skip the stray and handle the \\n case. Output an error if incorrect char after the stray */ static int handle_stray1(uint8_t *p) { int c; if (p >= file->buf_end) { file->buf_ptr = p; c = handle_eob(); p = file->buf_ptr; if (c == '\\') goto parse_stray; } else { parse_stray: file->buf_ptr = p; ch = *p; handle_stray(); p = file->buf_ptr; c = *p; } return c; } /* handle just the EOB case, but not stray */ #define PEEKC_EOB(c, p)\ {\ p++;\ c = *p;\ if (c == '\\') {\ file->buf_ptr = p;\ c = handle_eob();\ p = file->buf_ptr;\ }\ } /* handle the complicated stray case */ #define PEEKC(c, p)\ {\ p++;\ c = *p;\
if (c == '\\') {\ c = handle_stray1(p);\ p = file->buf_ptr;\ }\ } /* input with '\[\r]\n' handling. Note that this function cannot handle other characters after '\', so you cannot call it inside strings or comments */ static void minp(void) { inp(); if (ch == '\\') handle_stray(); } /* single line C++ comments */ static uint8_t *parse_line_comment(uint8_t *p) { int c; p++; for(;;) { c = *p; redo: if (c == '\n' || c == CH_EOF) { break; } else if (c == '\\') { file->buf_ptr = p; c = handle_eob(); p = file->buf_ptr; if (c == '\\') { PEEKC_EOB(c, p); if (c == '\n') { file->line_num++; PEEKC_EOB(c, p); } else if (c == '\r') { PEEKC_EOB(c, p); if (c == '\n') { file->line_num++; PEEKC_EOB(c, p); } } } else { goto redo; } } else { p++; } } return p; }
/* C comments */ static uint8_t *parse_comment(uint8_t *p) { int c; p++; for(;;) { /* fast skip loop */ for(;;) { c = *p; if (c == '\n' || c == '*' || c == '\\') break; p++; c = *p; if (c == '\n' || c == '*' || c == '\\') break; p++; } /* now we can handle all the cases */ if (c == '\n') { file->line_num++; p++; } else if (c == '*') { p++; for(;;) { c = *p; if (c == '*') { p++; } else if (c == '/') { goto end_of_comment; } else if (c == '\\') { file->buf_ptr = p; c = handle_eob(); p = file->buf_ptr; if (c == '\\') { /* skip '\[\r]\n', otherwise just skip the stray */ while (c == '\\') { PEEKC_EOB(c, p); if (c == '\n') { file->line_num++; PEEKC_EOB(c, p); } else if (c == '\r') { PEEKC_EOB(c, p); if (c == '\n') { file->line_num++; PEEKC_EOB(c, p); } } else { goto after_star; } } }
} else { break; } } after_star: ; } else { /* stray, eob or eof */ file->buf_ptr = p; c = handle_eob(); p = file->buf_ptr; if (c == CH_EOF) { error("unexpected end of file in comment"); } else if (c == '\\') { p++; } } } end_of_comment: p++; return p; } #define cinp minp /* space exlcuding newline */ static inline int is_space(int ch) { return ch == ' ' || ch == '\t' || ch == '\v' || ch == '\f' || ch == '\r'; } static inline void skip_spaces(void) { while (is_space(ch)) cinp(); } /* parse a string without interpreting escapes */ static uint8_t *parse_pp_string(uint8_t *p, int sep, CString *str) { int c; p++; for(;;) { c = *p; if (c == sep) { break; } else if (c == '\\') { file->buf_ptr = p; c = handle_eob(); p = file->buf_ptr; if (c == CH_EOF) { unterminated_string: /* XXX: indicate line number of start of string */
error("missing terminating %c character", sep); } else if (c == '\\') { /* escape : just skip \[\r]\n */ PEEKC_EOB(c, p); if (c == '\n') { file->line_num++; p++; } else if (c == '\r') { PEEKC_EOB(c, p); if (c != '\n') expect("'\n' after '\r'"); file->line_num++; p++; } else if (c == CH_EOF) { goto unterminated_string; } else { if (str) { cstr_ccat(str, '\\'); cstr_ccat(str, c); } p++; } } } else if (c == '\n') { file->line_num++; goto add_char; } else if (c == '\r') { PEEKC_EOB(c, p); if (c != '\n') { if (str) cstr_ccat(str, '\r'); } else { file->line_num++; goto add_char; } } else { add_char: if (str) cstr_ccat(str, c); p++; } } p++; return p; } /* skip block of text until #else, #elif or #endif. skip also pairs of #if/#endif */ void preprocess_skip(void) { int a, start_of_line, c; uint8_t *p;
p = file->buf_ptr; start_of_line = 1; a = 0; for(;;) { redo_no_start: c = *p; switch(c) { case ' ': case '\t': case '\f': case '\v': case '\r': p++; goto redo_no_start; case '\n': start_of_line = 1; file->line_num++; p++; goto redo_no_start; case '\\': file->buf_ptr = p; c = handle_eob(); if (c == CH_EOF) { expect("#endif"); } else if (c == '\\') { /* XXX: incorrect: should not give an error */ ch = file->buf_ptr[0]; handle_stray(); } p = file->buf_ptr; goto redo_no_start; /* skip strings */ case '\"': case '\'': p = parse_pp_string(p, c, NULL); break; /* skip comments */ case '/': file->buf_ptr = p; ch = *p; minp(); p = file->buf_ptr; if (ch == '*') { p = parse_comment(p); } else if (ch == '/') { p = parse_line_comment(p); } break; case '#': p++; if (start_of_line) { file->buf_ptr = p;
next_nomacro(); p = file->buf_ptr; if (a == 0 && (tok == TOK_ELSE || tok == TOK_ELIF || tok == TOK_ENDIF)) goto the_end; if (tok == TOK_IF || tok == TOK_IFDEF || tok == TOK_IFNDEF) a++; else if (tok == TOK_ENDIF) a--; } break; default: p++; break; } start_of_line = 0; } the_end: ; file->buf_ptr = p; } /* ParseState handling */ /* XXX: currently, no include file info is stored. Thus, we cannot display accurate messages if the function or data definition spans multiple files */ /* save current parse state in 's' */ void save_parse_state(ParseState *s) { s->line_num = file->line_num; s->macro_ptr = macro_ptr; s->tok = tok; s->tokc = tokc; } /* restore parse state from 's' */ void restore_parse_state(ParseState *s) { file->line_num = s->line_num; macro_ptr = s->macro_ptr; tok = s->tok; tokc = s->tokc; } /* return the number of additional 'ints' necessary to store the token */ static inline int tok_ext_size(int t) { switch(t) { /* 4 bytes */ case TOK_CINT: case TOK_CUINT:
case TOK_CCHAR: case TOK_LCHAR: case TOK_CFLOAT: case TOK_LINENUM: return 1; case TOK_STR: case TOK_LSTR: case TOK_PPNUM: error("unsupported token"); return 1; case TOK_CDOUBLE: case TOK_CLLONG: case TOK_CULLONG: return 2; case TOK_CLDOUBLE: return LDOUBLE_SIZE / 4; default: return 0; } } /* token string handling */ static inline void tok_str_new(TokenString *s) { s->str = NULL; s->len = 0; s->allocated_len = 0; s->last_line_num = -1; } static void tok_str_free(int *str) { tcc_free(str); } static int *tok_str_realloc(TokenString *s) { int *str, len; if (s->allocated_len == 0) { len = 8; } else { len = s->allocated_len * 2; } str = tcc_realloc(s->str, len * sizeof(int)); if (!str) error("memory full"); s->allocated_len = len; s->str = str; return str; }
static void tok_str_add(TokenString *s, int t) { int len, *str; len = s->len; str = s->str; if (len >= s->allocated_len) str = tok_str_realloc(s); str[len++] = t; s->len = len; } static void tok_str_add2(TokenString *s, int t, CValue *cv) { int len, *str; len = s->len; str = s->str; /* allocate space for worst case */ if (len + TOK_MAX_SIZE > s->allocated_len) str = tok_str_realloc(s); str[len++] = t; switch(t) { case TOK_CINT: case TOK_CUINT: case TOK_CCHAR: case TOK_LCHAR: case TOK_CFLOAT: case TOK_LINENUM: str[len++] = cv->tab[0]; break; case TOK_PPNUM: case TOK_STR: case TOK_LSTR: { int nb_words; CString *cstr; nb_words = (sizeof(CString) + cv->cstr->size + 3) >> 2; while ((len + nb_words) > s->allocated_len) str = tok_str_realloc(s); cstr = (CString *)(str + len); cstr->data = NULL; cstr->size = cv->cstr->size; cstr->data_allocated = NULL; cstr->size_allocated = cstr->size; memcpy((char *)cstr + sizeof(CString), cv->cstr->data, cstr->size); len += nb_words; } break; case TOK_CDOUBLE:
case TOK_CLLONG: case TOK_CULLONG: #if LDOUBLE_SIZE == 8 case TOK_CLDOUBLE: #endif str[len++] = cv->tab[0]; str[len++] = cv->tab[1]; break; #if LDOUBLE_SIZE == 12 case TOK_CLDOUBLE: str[len++] = cv->tab[0]; str[len++] = cv->tab[1]; str[len++] = cv->tab[2]; #elif LDOUBLE_SIZE != 8 #error add long double size support #endif break; default: break; } s->len = len; } /* add the current parse token in token string 's' */ static void tok_str_add_tok(TokenString *s) { CValue cval; /* save line number info */ if (file->line_num != s->last_line_num) { s->last_line_num = file->line_num; cval.i = s->last_line_num; tok_str_add2(s, TOK_LINENUM, &cval); } tok_str_add2(s, tok, &tokc); } #if LDOUBLE_SIZE == 12 #define LDOUBLE_GET(p, cv) cv.tab[0] = p[0]; \ cv.tab[1] = p[1]; \ cv.tab[2] = p[2]; #elif LDOUBLE_SIZE == 8 #define LDOUBLE_GET(p, cv) cv.tab[0] = p[0]; \ cv.tab[1] = p[1]; #else #error add long double size support #endif
\
\
/* get a token from an integer array and increment pointer accordingly. we code it as a macro to avoid pointer aliasing. */
#define TOK_GET(t, p, cv) \ { \ t = *p++; \ switch(t) { \ case TOK_CINT: \ case TOK_CUINT: \ case TOK_CCHAR: \ case TOK_LCHAR: \ case TOK_CFLOAT: \ case TOK_LINENUM: \ cv.tab[0] = *p++; \ break; \ case TOK_STR: \ case TOK_LSTR: \ case TOK_PPNUM: \ cv.cstr = (CString *)p; \ cv.cstr->data = (char *)p + sizeof(CString);\ p += (sizeof(CString) + cv.cstr->size + 3) >> 2;\ break; \ case TOK_CDOUBLE: \ case TOK_CLLONG: \ case TOK_CULLONG: \ cv.tab[0] = p[0]; \ cv.tab[1] = p[1]; \ p += 2; \ break; \ case TOK_CLDOUBLE: \ LDOUBLE_GET(p, cv); \ p += LDOUBLE_SIZE / 4; \ break; \ default: \ break; \ } \ } /* defines handling */ static inline void define_push(int v, int macro_type, int *str, Sym *first_arg) { Sym *s; s = sym_push2(&define_stack, v, macro_type, (int)str); s->next = first_arg; table_ident[v - TOK_IDENT]->sym_define = s; } /* undefined a define symbol. Its name is just set to zero */ static void define_undef(Sym *s) { int v; v = s->v; if (v >= TOK_IDENT && v < tok_ident) table_ident[v - TOK_IDENT]->sym_define = NULL; s->v = 0;
} static inline Sym *define_find(int v) { v -= TOK_IDENT; if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT)) return NULL; return table_ident[v]->sym_define; } /* free define stack until top reaches 'b' */ static void free_defines(Sym *b) { Sym *top, *top1; int v; top = define_stack; while (top != b) { top1 = top->prev; /* do not free args or predefined defines */ if (top->c) tok_str_free((int *)top->c); v = top->v; if (v >= TOK_IDENT && v < tok_ident) table_ident[v - TOK_IDENT]->sym_define = NULL; sym_free(top); top = top1; } define_stack = b; } /* label lookup */ static Sym *label_find(int v) { v -= TOK_IDENT; if ((unsigned)v >= (unsigned)(tok_ident - TOK_IDENT)) return NULL; return table_ident[v]->sym_label; } static Sym *label_push(Sym **ptop, int v, int flags) { Sym *s, **ps; s = sym_push2(ptop, v, 0, 0); s->r = flags; ps = &table_ident[v - TOK_IDENT]->sym_label; if (ptop == &global_label_stack) { /* modify the top most local identifier, so that sym_identifier will point to 's' when popped */ while (*ps != NULL) ps = &(*ps)->prev_tok; } s->prev_tok = *ps;
*ps = s; return s; } /* pop labels until element last is reached. Look if any labels are undefined. Define symbols if '&&label' was used. */ static void label_pop(Sym **ptop, Sym *slast) { Sym *s, *s1; for(s = *ptop; s != slast; s = s1) { s1 = s->prev; if (s->r == LABEL_DECLARED) { warning("label '%s' declared but not used", get_tok_str(s->v, NULL)); } else if (s->r == LABEL_FORWARD) { error("label '%s' used but not defined", get_tok_str(s->v, NULL)); } else { if (s->c) { /* define corresponding symbol. A size of 1 is put. */ put_extern_sym(s, cur_text_section, (long)s->next, 1); } } /* remove label */ table_ident[s->v - TOK_IDENT]->sym_label = s->prev_tok; sym_free(s); } *ptop = slast; } /* eval an expression for #if/#elif */ static int expr_preprocess(void) { int c, t; TokenString str; tok_str_new(&str); while (tok != TOK_LINEFEED && tok != TOK_EOF) { next(); /* do macro subst */ if (tok == TOK_DEFINED) { next_nomacro(); t = tok; if (t == '(') next_nomacro(); c = define_find(tok) != 0; if (t == '(') next_nomacro(); tok = TOK_CINT; tokc.i = c; } else if (tok >= TOK_IDENT) { /* if undefined macro */ tok = TOK_CINT; tokc.i = 0;
} tok_str_add_tok(&str); } tok_str_add(&str, -1); /* simulate end of file */ tok_str_add(&str, 0); /* now evaluate C constant expression */ macro_ptr = str.str; next(); c = expr_const(); macro_ptr = NULL; tok_str_free(str.str); return c != 0; } #if defined(PARSE_DEBUG) || defined(PP_DEBUG) static void tok_print(int *str) { int t; CValue cval; while (1) { TOK_GET(t, str, cval); if (!t) break; printf(" %s", get_tok_str(t, &cval)); } printf("\n"); } #endif /* parse after #define */ static void parse_define(void) { Sym *s, *first, **ps; int v, t, varg, is_vaargs, c; TokenString str; v = tok; if (v < TOK_IDENT) error("invalid macro name '%s'", get_tok_str(tok, &tokc)); /* XXX: should check if same macro (ANSI) */ first = NULL; t = MACRO_OBJ; /* '(' must be just after macro definition for MACRO_FUNC */ c = file->buf_ptr[0]; if (c == '\\') c = handle_stray1(file->buf_ptr); if (c == '(') { next_nomacro(); next_nomacro(); ps = &first; while (tok != ')') { varg = tok;
next_nomacro(); is_vaargs = 0; if (varg == TOK_DOTS) { varg = TOK___VA_ARGS__; is_vaargs = 1; } else if (tok == TOK_DOTS && gnu_ext) { is_vaargs = 1; next_nomacro(); } if (varg < TOK_IDENT) error("badly punctuated parameter list"); s = sym_push2(&define_stack, varg | SYM_FIELD, is_vaargs, 0); *ps = s; ps = &s->next; if (tok != ',') break; next_nomacro(); } t = MACRO_FUNC; } tok_str_new(&str); next_nomacro(); /* EOF testing necessary for '-D' handling */ while (tok != TOK_LINEFEED && tok != TOK_EOF) { tok_str_add2(&str, tok, &tokc); next_nomacro(); } tok_str_add(&str, 0); #ifdef PP_DEBUG printf("define %s %d: ", get_tok_str(v, NULL), t); tok_print(str.str); #endif define_push(v, t, str.str, first); } static inline int hash_cached_include(int type, const char *filename) { const unsigned char *s; unsigned int h; h = TOK_HASH_INIT; h = TOK_HASH_FUNC(h, type); s = filename; while (*s) { h = TOK_HASH_FUNC(h, *s); s++; } h &= (CACHED_INCLUDES_HASH_SIZE - 1); return h; } /* XXX: use a token or a hash table to accelerate matching ? */ static CachedInclude *search_cached_include(TCCState *s1,
int type, const char *filename) { CachedInclude *e; int i, h; h = hash_cached_include(type, filename); i = s1->cached_includes_hash[h]; for(;;) { if (i == 0) break; e = s1->cached_includes[i - 1]; if (e->type == type && !strcmp(e->filename, filename)) return e; i = e->hash_next; } return NULL; } static inline void add_cached_include(TCCState *s1, int type, const char *filename, int ifndef_macro) { CachedInclude *e; int h; if (search_cached_include(s1, type, filename)) return; #ifdef INC_DEBUG printf("adding cached '%s' %s\n", filename, get_tok_str(ifndef_macro, NULL)); #endif e = tcc_malloc(sizeof(CachedInclude) + strlen(filename)); if (!e) return; e->type = type; strcpy(e->filename, filename); e->ifndef_macro = ifndef_macro; dynarray_add((void ***)&s1->cached_includes, &s1->nb_cached_includes, e); /* add in hash table */ h = hash_cached_include(type, filename); e->hash_next = s1->cached_includes_hash[h]; s1->cached_includes_hash[h] = s1->nb_cached_includes; } static void pragma_parse(TCCState *s1) { int val; next(); if (tok == TOK_pack) { /* This may be: #pragma pack(1) // set #pragma pack() // reset to default #pragma pack(push,1) // push & set #pragma pack(pop) // restore previous
*/ next(); skip('('); if (tok == TOK_ASM_pop) { next(); if (s1->pack_stack_ptr <= s1->pack_stack) { stk_error: error("out of pack stack"); } s1->pack_stack_ptr--; } else { val = 0; if (tok != ')') { if (tok == TOK_ASM_push) { next(); if (s1->pack_stack_ptr >= s1->pack_stack + PACK_STACK_SIZE - 1) goto stk_error; s1->pack_stack_ptr++; skip(','); } if (tok != TOK_CINT) { pack_error: error("invalid pack pragma"); } val = tokc.i; if (val < 1 || val > 16 || (val & (val - 1)) != 0) goto pack_error; next(); } *s1->pack_stack_ptr = val; skip(')'); } } } /* is_bof is true if first non space token at beginning of file */ static void preprocess(int is_bof) { TCCState *s1 = tcc_state; int size, i, c, n, saved_parse_flags; char buf[1024], *q, *p; char buf1[1024]; BufferedFile *f; Sym *s; CachedInclude *e; saved_parse_flags = parse_flags; parse_flags = PARSE_FLAG_PREPROCESS | PARSE_FLAG_TOK_NUM | PARSE_FLAG_LINEFEED; next_nomacro(); redo: switch(tok) { case TOK_DEFINE:
next_nomacro(); parse_define(); break; case TOK_UNDEF: next_nomacro(); s = define_find(tok); /* undefine symbol by putting an invalid name */ if (s) define_undef(s); break; case TOK_INCLUDE: case TOK_INCLUDE_NEXT: ch = file->buf_ptr[0]; /* XXX: incorrect if comments : use next_nomacro with a special mode */ skip_spaces(); if (ch == '<') { c = '>'; goto read_name; } else if (ch == '\"') { c = ch; read_name: /* XXX: better stray handling */ minp(); q = buf; while (ch != c && ch != '\n' && ch != CH_EOF) { if ((q - buf) < sizeof(buf) - 1) *q++ = ch; minp(); } *q = '\0'; minp(); #if 0 /* eat all spaces and comments after include */ /* XXX: slightly incorrect */ while (ch1 != '\n' && ch1 != CH_EOF) inp(); #endif } else { /* computed #include : either we have only strings or we have anything enclosed in '<>' */ next(); buf[0] = '\0'; if (tok == TOK_STR) { while (tok != TOK_LINEFEED) { if (tok != TOK_STR) { include_syntax: error("'#include' expects \"FILENAME\" or
int len; while (tok != TOK_LINEFEED) { pstrcat(buf, sizeof(buf), get_tok_str(tok, &tokc)); next(); } len = strlen(buf); /* check syntax and remove '<>' */ if (len < 2 || buf[0] != '<' || buf[len - 1] != '>') goto include_syntax; memmove(buf, buf + 1, len - 2); buf[len - 2] = '\0'; c = '>'; } } e = search_cached_include(s1, c, buf); if (e && define_find(e->ifndef_macro)) { /* no need to parse the include because the 'ifndef macro' is defined */ #ifdef INC_DEBUG printf("%s: skipping %s\n", file->filename, buf); #endif } else { if (c == '\"') { /* first search in current dir if "header.h" */ size = 0; p = strrchr(file->filename, '/'); if (p) size = p + 1 - file->filename; if (size > sizeof(buf1) - 1) size = sizeof(buf1) - 1; memcpy(buf1, file->filename, size); buf1[size] = '\0'; pstrcat(buf1, sizeof(buf1), buf); f = tcc_open(s1, buf1); if (f) { if (tok == TOK_INCLUDE_NEXT) tok = TOK_INCLUDE; else goto found; } } if (s1->include_stack_ptr >= s1->include_stack + INCLUDE_STACK_SIZE) error("#include recursion too deep"); /* now search in all the include paths */ n = s1->nb_include_paths + s1->nb_sysinclude_paths; for(i = 0; i < n; i++) { const char *path; if (i < s1->nb_include_paths) path = s1->include_paths[i]; else path = s1->sysinclude_paths[i - s1->nb_include_paths]; pstrcpy(buf1, sizeof(buf1), path);
pstrcat(buf1, sizeof(buf1), "/"); pstrcat(buf1, sizeof(buf1), buf); f = tcc_open(s1, buf1); if (f) { if (tok == TOK_INCLUDE_NEXT) tok = TOK_INCLUDE; else goto found; } } error("include file '%s' not found", buf); f = NULL; found: #ifdef INC_DEBUG printf("%s: including %s\n", file->filename, buf1); #endif f->inc_type = c; pstrcpy(f->inc_filename, sizeof(f->inc_filename), buf); /* push current file in stack */ /* XXX: fix current line init */ *s1->include_stack_ptr++ = file; file = f; /* add include file debug info */ if (do_debug) { put_stabs(file->filename, N_BINCL, 0, 0, 0); } tok_flags |= TOK_FLAG_BOF | TOK_FLAG_BOL; ch = file->buf_ptr[0]; goto the_end; } break; case TOK_IFNDEF: c = 1; goto do_ifdef; case TOK_IF: c = expr_preprocess(); goto do_if; case TOK_IFDEF: c = 0; do_ifdef: next_nomacro(); if (tok < TOK_IDENT) error("invalid argument for '#if%sdef'", c ? "n" : ""); if (is_bof) { if (c) { #ifdef INC_DEBUG printf("#ifndef %s\n", get_tok_str(tok, NULL)); #endif file->ifndef_macro = tok; } } c = (define_find(tok) != 0) ^ c; do_if:
if (s1->ifdef_stack_ptr >= s1->ifdef_stack + IFDEF_STACK_SIZE) error("memory full"); *s1->ifdef_stack_ptr++ = c; goto test_skip; case TOK_ELSE: if (s1->ifdef_stack_ptr == s1->ifdef_stack) error("#else without matching #if"); if (s1->ifdef_stack_ptr[-1] & 2) error("#else after #else"); c = (s1->ifdef_stack_ptr[-1] ^= 3); goto test_skip; case TOK_ELIF: if (s1->ifdef_stack_ptr == s1->ifdef_stack) error("#elif without matching #if"); c = s1->ifdef_stack_ptr[-1]; if (c > 1) error("#elif after #else"); /* last #if/#elif expression was true: we skip */ if (c == 1) goto skip; c = expr_preprocess(); s1->ifdef_stack_ptr[-1] = c; test_skip: if (!(c & 1)) { skip: preprocess_skip(); is_bof = 0; goto redo; } break; case TOK_ENDIF: if (s1->ifdef_stack_ptr <= file->ifdef_stack_ptr) error("#endif without matching #if"); s1->ifdef_stack_ptr--; /* '#ifndef macro' was at the start of file. Now we check if an '#endif' is exactly at the end of file */ if (file->ifndef_macro && s1->ifdef_stack_ptr == file->ifdef_stack_ptr) { file->ifndef_macro_saved = file->ifndef_macro; /* need to set to zero to avoid false matches if another #ifndef at middle of file */ file->ifndef_macro = 0; while (tok != TOK_LINEFEED) next_nomacro(); tok_flags |= TOK_FLAG_ENDIF; goto the_end; } break; case TOK_LINE: next(); if (tok != TOK_CINT) error("#line"); file->line_num = tokc.i - 1; /* the line number will be incremented after */
next(); if (tok != TOK_LINEFEED) { if (tok != TOK_STR) error("#line"); pstrcpy(file->filename, sizeof(file->filename), (char *)tokc.cstr->data); } break; case TOK_ERROR: case TOK_WARNING: c = tok; ch = file->buf_ptr[0]; skip_spaces(); q = buf; while (ch != '\n' && ch != CH_EOF) { if ((q - buf) < sizeof(buf) - 1) *q++ = ch; minp(); } *q = '\0'; if (c == TOK_ERROR) error("#error %s", buf); else warning("#warning %s", buf); break; case TOK_PRAGMA: pragma_parse(s1); break; default: if (tok == TOK_LINEFEED || tok == '!' || tok == TOK_CINT) { /* '!' is ignored to allow C scripts. numbers are ignored to emulate cpp behaviour */ } else { if (!(saved_parse_flags & PARSE_FLAG_ASM_COMMENTS)) error("invalid preprocessing directive #%s", get_tok_str(tok, &tokc)); } break; } /* ignore other preprocess commands or #! for C scripts */ while (tok != TOK_LINEFEED) next_nomacro(); the_end: parse_flags = saved_parse_flags; } /* evaluate escape codes in a string. */ static void parse_escape_string(CString *outstr, const uint8_t *buf, int is_long) { int c, n; const uint8_t *p; p = buf; for(;;) {
c = *p; if (c == '\0') break; if (c == '\\') { p++; /* escape */ c = *p; switch(c) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': /* at most three octal digits */ n = c - '0'; p++; c = *p; if (isoct(c)) { n = n * 8 + c - '0'; p++; c = *p; if (isoct(c)) { n = n * 8 + c - '0'; p++; } } c = n; goto add_char_nonext; case 'x': p++; n = 0; for(;;) { c = *p; if (c >= 'a' && c <= 'f') c = c - 'a' + 10; else if (c >= 'A' && c <= 'F') c = c - 'A' + 10; else if (isnum(c)) c = c - '0'; else break; n = n * 16 + c; p++; } c = n; goto add_char_nonext; case 'a': c = '\a'; break; case 'b': c = '\b'; break; case 'f': c = '\f'; break; case 'n':
c = '\n'; break; case 'r': c = '\r'; break; case 't': c = '\t'; break; case 'v': c = '\v'; break; case 'e': if (!gnu_ext) goto invalid_escape; c = 27; break; case '\'': case '\"': case '\\': case '?': break; default: invalid_escape: if (c >= '!' && c <= '~') warning("unknown escape sequence: \'\\%c\'", c); else warning("unknown escape sequence: \'\\x%x\'", c); break; } } p++; add_char_nonext: if (!is_long) cstr_ccat(outstr, c); else cstr_wccat(outstr, c); } /* add a trailing '\0' */ if (!is_long) cstr_ccat(outstr, '\0'); else cstr_wccat(outstr, '\0'); } /* we use 64 bit numbers */ #define BN_SIZE 2 /* bn = (bn << shift) | or_val */ void bn_lshift(unsigned int *bn, int shift, int or_val) { int i; unsigned int v; for(i=0;i
v = bn[i]; bn[i] = (v << shift) | or_val; or_val = v >> (32 - shift); } } void bn_zero(unsigned int *bn) { int i; for(i=0;i
break; if (t >= b) break; if (q >= token_buf + STRING_MAX_SIZE) { num_too_long: error("number too long"); } *q++ = ch; ch = *p++; } if (ch == '.' || ((ch == 'e' || ch == 'E') && b == 10) || ((ch == 'p' || ch == 'P') && (b == 16 || b == 2))) { if (b != 10) { /* NOTE: strtox should support that for hexa numbers, but non ISOC99 libcs do not support it, so we prefer to do it by hand */ /* hexadecimal or binary floats */ /* XXX: handle overflows */ *q = '\0'; if (b == 16) shift = 4; else shift = 2; bn_zero(bn); q = token_buf; while (1) { t = *q++; if (t == '\0') { break; } else if (t >= 'a') { t = t - 'a' + 10; } else if (t >= 'A') { t = t - 'A' + 10; } else { t = t - '0'; } bn_lshift(bn, shift, t); } frac_bits = 0; if (ch == '.') { ch = *p++; while (1) { t = ch; if (t >= 'a' && t <= 'f') { t = t - 'a' + 10; } else if (t >= 'A' && t <= 'F') { t = t - 'A' + 10; } else if (t >= '0' && t <= '9') { t = t - '0'; } else { break; }
if (t >= b) error("invalid digit"); bn_lshift(bn, shift, t); frac_bits += shift; ch = *p++; } } if (ch != 'p' && ch != 'P') expect("exponent"); ch = *p++; s = 1; exp_val = 0; if (ch == '+') { ch = *p++; } else if (ch == '-') { s = -1; ch = *p++; } if (ch < '0' || ch > '9') expect("exponent digits"); while (ch >= '0' && ch <= '9') { exp_val = exp_val * 10 + ch - '0'; ch = *p++; } exp_val = exp_val * s; /* now we can generate the number */ /* XXX: should patch directly float number */ d = (double)bn[1] * 4294967296.0 + (double)bn[0]; d = ldexp(d, exp_val - frac_bits); t = toup(ch); if (t == 'F') { ch = *p++; tok = TOK_CFLOAT; /* float : should handle overflow */ tokc.f = (float)d; } else if (t == 'L') { ch = *p++; tok = TOK_CLDOUBLE; /* XXX: not large enough */ tokc.ld = (long double)d; } else { tok = TOK_CDOUBLE; tokc.d = d; } } else { /* decimal floats */ if (ch == '.') { if (q >= token_buf + STRING_MAX_SIZE) goto num_too_long; *q++ = ch; ch = *p++; float_frac_parse:
while (ch >= '0' && ch <= '9') { if (q >= token_buf + STRING_MAX_SIZE) goto num_too_long; *q++ = ch; ch = *p++; } } if (ch == 'e' || ch == 'E') { if (q >= token_buf + STRING_MAX_SIZE) goto num_too_long; *q++ = ch; ch = *p++; if (ch == '-' || ch == '+') { if (q >= token_buf + STRING_MAX_SIZE) goto num_too_long; *q++ = ch; ch = *p++; } if (ch < '0' || ch > '9') expect("exponent digits"); while (ch >= '0' && ch <= '9') { if (q >= token_buf + STRING_MAX_SIZE) goto num_too_long; *q++ = ch; ch = *p++; } } *q = '\0'; t = toup(ch); errno = 0; if (t == 'F') { ch = *p++; tok = TOK_CFLOAT; tokc.f = strtof(token_buf, NULL); } else if (t == 'L') { ch = *p++; tok = TOK_CLDOUBLE; tokc.ld = strtold(token_buf, NULL); } else { tok = TOK_CDOUBLE; tokc.d = strtod(token_buf, NULL); } } } else { unsigned long long n, n1; int lcount, ucount; /* integer number */ *q = '\0'; q = token_buf; if (b == 10 && *q == '0') { b = 8; q++;
} n = 0; while(1) { t = *q++; /* no need for checks except for base 10 / 8 errors */ if (t == '\0') { break; } else if (t >= 'a') { t = t - 'a' + 10; } else if (t >= 'A') { t = t - 'A' + 10; } else { t = t - '0'; if (t >= b) error("invalid digit"); } n1 = n; n = n * b + t; /* detect overflow */ /* XXX: this test is not reliable */ if (n < n1) error("integer constant overflow"); } /* XXX: not exactly ANSI compliant */ if ((n & 0xffffffff00000000LL) != 0) { if ((n >> 63) != 0) tok = TOK_CULLONG; else tok = TOK_CLLONG; } else if (n > 0x7fffffff) { tok = TOK_CUINT; } else { tok = TOK_CINT; } lcount = 0; ucount = 0; for(;;) { t = toup(ch); if (t == 'L') { if (lcount >= 2) error("three 'l's in integer constant"); lcount++; if (lcount == 2) { if (tok == TOK_CINT) tok = TOK_CLLONG; else if (tok == TOK_CUINT) tok = TOK_CULLONG; } ch = *p++; } else if (t == 'U') { if (ucount >= 1) error("two 'u's in integer constant");
ucount++; if (tok == TOK_CINT) tok = TOK_CUINT; else if (tok == TOK_CLLONG) tok = TOK_CULLONG; ch = *p++; } else { break; } } if (tok == TOK_CINT || tok == TOK_CUINT) tokc.ui = n; else tokc.ull = n; } } #define PARSE2(c1, tok1, c2, tok2) case c1: \ PEEKC(c, p); \ if (c == c2) { \ p++; \ tok = tok2; \ } else { \ tok = tok1; \ } \ break;
\
/* return next token without macro substitution */ static inline void next_nomacro1(void) { int t, c, is_long; TokenSym *ts; uint8_t *p, *p1; unsigned int h; p = file->buf_ptr; redo_no_start: c = *p; switch(c) { case ' ': case '\t': case '\f': case '\v': case '\r': p++; goto redo_no_start; case '\\': /* first look if it is in fact an end of buffer */ if (p >= file->buf_end) { file->buf_ptr = p;
handle_eob(); p = file->buf_ptr; if (p >= file->buf_end) goto parse_eof; else goto redo_no_start; } else { file->buf_ptr = p; ch = *p; handle_stray(); p = file->buf_ptr; goto redo_no_start; } parse_eof: { TCCState *s1 = tcc_state; if (parse_flags & PARSE_FLAG_LINEFEED) { tok = TOK_LINEFEED; } else if (s1->include_stack_ptr == s1->include_stack || !(parse_flags & PARSE_FLAG_PREPROCESS)) { /* no include left : end of file. */ tok = TOK_EOF; } else { /* pop include file */ /* test if previous '#endif' was after a #ifdef at start of file */ if (tok_flags & TOK_FLAG_ENDIF) { #ifdef INC_DEBUG printf("#endif %s\n", get_tok_str(file->ifndef_macro_saved, NULL)); #endif add_cached_include(s1, file->inc_type, file->inc_filename, file->ifndef_macro_saved); } /* add end of include file debug info */ if (do_debug) { put_stabd(N_EINCL, 0, 0); } /* pop include stack */ tcc_close(file); s1->include_stack_ptr--; file = *s1->include_stack_ptr; p = file->buf_ptr; goto redo_no_start; } } break; case '\n': if (parse_flags & PARSE_FLAG_LINEFEED) { tok = TOK_LINEFEED; } else {
file->line_num++; tok_flags |= TOK_FLAG_BOL; p++; goto redo_no_start; } break; case '#': /* XXX: simplify */ PEEKC(c, p); if ((tok_flags & TOK_FLAG_BOL) && (parse_flags & PARSE_FLAG_PREPROCESS)) { file->buf_ptr = p; preprocess(tok_flags & TOK_FLAG_BOF); p = file->buf_ptr; goto redo_no_start; } else { if (c == '#') { p++; tok = TOK_TWOSHARPS; } else { if (parse_flags & PARSE_FLAG_ASM_COMMENTS) { p = parse_line_comment(p - 1); goto redo_no_start; } else { tok = '#'; } } } break; case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': case 'g': case 'h': case 'i': case 'j': case 'k': case 'l': case 'm': case 'n': case 'o': case 'p': case 'q': case 'r': case 's': case 't': case 'u': case 'v': case 'w': case 'x': case 'y': case 'z': case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': case 'G': case 'H': case 'I': case 'J': case 'K': case 'M': case 'N': case 'O': case 'P': case 'Q': case 'R': case 'S': case 'T': case 'U': case 'V': case 'W': case 'X': case 'Y': case 'Z': case '_': parse_ident_fast: p1 = p; h = TOK_HASH_INIT; h = TOK_HASH_FUNC(h, c); p++; for(;;) { c = *p;
if (!isidnum_table[c]) break; h = TOK_HASH_FUNC(h, c); p++; } if (c != '\\') { TokenSym **pts; int len; /* fast case : no stray found, so we have the full token and we have already hashed it */ len = p - p1; h &= (TOK_HASH_SIZE - 1); pts = &hash_ident[h]; for(;;) { ts = *pts; if (!ts) break; if (ts->len == len && !memcmp(ts->str, p1, len)) goto token_found; pts = &(ts->hash_next); } ts = tok_alloc_new(pts, p1, len); token_found: ; } else { /* slower case */ cstr_reset(&tokcstr); while (p1 < p) { cstr_ccat(&tokcstr, *p1); p1++; } p--; PEEKC(c, p); parse_ident_slow: while (isidnum_table[c]) { cstr_ccat(&tokcstr, c); PEEKC(c, p); } ts = tok_alloc(tokcstr.data, tokcstr.size); } tok = ts->tok; break; case 'L': t = p[1]; if (t != '\\' && t != '\'' && t != '\"') { /* fast case */ goto parse_ident_fast; } else { PEEKC(c, p); if (c == '\'' || c == '\"') { is_long = 1; goto str_const;
} else { cstr_reset(&tokcstr); cstr_ccat(&tokcstr, 'L'); goto parse_ident_slow; } } break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': cstr_reset(&tokcstr); /* after the first digit, accept digits, alpha, '.' or sign if prefixed by 'eEpP' */ parse_num: for(;;) { t = c; cstr_ccat(&tokcstr, c); PEEKC(c, p); if (!(isnum(c) || isid(c) || c == '.' || ((c == '+' || c == '-') && (t == 'e' || t == 'E' || t == 'p' || t == 'P')))) break; } /* We add a trailing '\0' to ease parsing */ cstr_ccat(&tokcstr, '\0'); tokc.cstr = &tokcstr; tok = TOK_PPNUM; break; case '.': /* special dot handling because it can also start a number */ PEEKC(c, p); if (isnum(c)) { cstr_reset(&tokcstr); cstr_ccat(&tokcstr, '.'); goto parse_num; } else if (c == '.') { PEEKC(c, p); if (c != '.') expect("'.'"); PEEKC(c, p); tok = TOK_DOTS; } else { tok = '.'; } break; case '\'': case '\"': is_long = 0; str_const: { CString str; int sep;
sep = c; /* parse the string */ cstr_new(&str); p = parse_pp_string(p, sep, &str); cstr_ccat(&str, '\0'); /* eval the escape (should be done as TOK_PPNUM) */ cstr_reset(&tokcstr); parse_escape_string(&tokcstr, str.data, is_long); cstr_free(&str); if (sep == '\'') { int char_size; /* XXX: make it portable */ if (!is_long) char_size = 1; else char_size = sizeof(int); if (tokcstr.size <= char_size) error("empty character constant"); if (tokcstr.size > 2 * char_size) warning("multi-character character constant"); if (!is_long) { tokc.i = *(int8_t *)tokcstr.data; tok = TOK_CCHAR; } else { tokc.i = *(int *)tokcstr.data; tok = TOK_LCHAR; } } else { tokc.cstr = &tokcstr; if (!is_long) tok = TOK_STR; else tok = TOK_LSTR; } } break; case '<': PEEKC(c, p); if (c == '=') { p++; tok = TOK_LE; } else if (c == '<') { PEEKC(c, p); if (c == '=') { p++; tok = TOK_A_SHL; } else { tok = TOK_SHL;
} } else { tok = TOK_LT; } break; case '>': PEEKC(c, p); if (c == '=') { p++; tok = TOK_GE; } else if (c == '>') { PEEKC(c, p); if (c == '=') { p++; tok = TOK_A_SAR; } else { tok = TOK_SAR; } } else { tok = TOK_GT; } break; case '&': PEEKC(c, p); if (c == '&') { p++; tok = TOK_LAND; } else if (c == '=') { p++; tok = TOK_A_AND; } else { tok = '&'; } break; case '|': PEEKC(c, p); if (c == '|') { p++; tok = TOK_LOR; } else if (c == '=') { p++; tok = TOK_A_OR; } else { tok = '|'; } break; case '+': PEEKC(c, p); if (c == '+') {
p++; tok = TOK_INC; } else if (c == '=') { p++; tok = TOK_A_ADD; } else { tok = '+'; } break; case '-': PEEKC(c, p); if (c == '-') { p++; tok = TOK_DEC; } else if (c == '=') { p++; tok = TOK_A_SUB; } else if (c == '>') { p++; tok = TOK_ARROW; } else { tok = '-'; } break; PARSE2('!', '!', '=', TOK_NE) PARSE2('=', '=', '=', TOK_EQ) PARSE2('*', '*', '=', TOK_A_MUL) PARSE2('%', '%', '=', TOK_A_MOD) PARSE2('^', '^', '=', TOK_A_XOR) /* comments or operator */ case '/': PEEKC(c, p); if (c == '*') { p = parse_comment(p); goto redo_no_start; } else if (c == '/') { p = parse_line_comment(p); goto redo_no_start; } else if (c == '=') { p++; tok = TOK_A_DIV; } else { tok = '/'; } break; /* simple tokens */ case '(': case ')': case '[':
case ']': case '{': case '}': case ',': case ';': case ':': case '?': case '~': case '$': /* only used in assembler */ case '@': /* dito */ tok = c; p++; break; default: error("unrecognized character \\x%02x", c); break; } file->buf_ptr = p; tok_flags = 0; #if defined(PARSE_DEBUG) printf("token = %s\n", get_tok_str(tok, &tokc)); #endif } /* return next token without macro substitution. Can read input from macro_ptr buffer */ static void next_nomacro(void) { if (macro_ptr) { redo: tok = *macro_ptr; if (tok) { TOK_GET(tok, macro_ptr, tokc); if (tok == TOK_LINENUM) { file->line_num = tokc.i; goto redo; } } } else { next_nomacro1(); } } /* substitute args in macro_str and return allocated string */ static int *macro_arg_subst(Sym **nested_list, int *macro_str, Sym *args) { int *st, last_tok, t, notfirst; Sym *s; CValue cval; TokenString str; CString cstr; tok_str_new(&str);
last_tok = 0; while(1) { TOK_GET(t, macro_str, cval); if (!t) break; if (t == '#') { /* stringize */ TOK_GET(t, macro_str, cval); if (!t) break; s = sym_find2(args, t); if (s) { cstr_new(&cstr); st = (int *)s->c; notfirst = 0; while (*st) { if (notfirst) cstr_ccat(&cstr, ' '); TOK_GET(t, st, cval); cstr_cat(&cstr, get_tok_str(t, &cval)); notfirst = 1; } cstr_ccat(&cstr, '\0'); #ifdef PP_DEBUG printf("stringize: %s\n", (char *)cstr.data); #endif /* add string */ cval.cstr = &cstr; tok_str_add2(&str, TOK_STR, &cval); cstr_free(&cstr); } else { tok_str_add2(&str, t, &cval); } } else if (t >= TOK_IDENT) { s = sym_find2(args, t); if (s) { st = (int *)s->c; /* if '##' is present before or after, no arg substitution */ if (*macro_str == TOK_TWOSHARPS || last_tok == TOK_TWOSHARPS) { /* special case for var arg macros : ## eats the ',' if empty VA_ARGS variable. */ /* XXX: test of the ',' is not 100% reliable. should fix it to avoid security problems */ if (gnu_ext && s->type.t && last_tok == TOK_TWOSHARPS && str.len >= 2 && str.str[str.len - 2] == ',') { if (*st == 0) { /* suppress ',' '##' */ str.len -= 2; } else { /* suppress '##' and add variable */ str.len--;
goto add_var; } } else { int t1; add_var: for(;;) { TOK_GET(t1, st, cval); if (!t1) break; tok_str_add2(&str, t1, &cval); } } } else { /* NOTE: the stream cannot be read when macro substituing an argument */ macro_subst(&str, nested_list, st, NULL); } } else { tok_str_add(&str, t); } } else { tok_str_add2(&str, t, &cval); } last_tok = t; } tok_str_add(&str, 0); return str.str; } static char const ab_month_name[12][4] = { "Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec" }; /* do macro substitution of current token with macro 's' and add result to (tok_str,tok_len). 'nested_list' is the list of all macros we got inside to avoid recursing. Return non zero if no substitution needs to be done */ static int macro_subst_tok(TokenString *tok_str, Sym **nested_list, Sym *s, struct macro_level **can_read_stream) { Sym *args, *sa, *sa1; int mstr_allocated, parlevel, *mstr, t, t1; TokenString str; char *cstrval; CValue cval; CString cstr; char buf[32]; /* if symbol is a macro, prepare substitution */ /* special macros */ if (tok == TOK___LINE__) {
snprintf(buf, sizeof(buf), "%d", file->line_num); cstrval = buf; t1 = TOK_PPNUM; goto add_cstr1; } else if (tok == TOK___FILE__) { cstrval = file->filename; goto add_cstr; } else if (tok == TOK___DATE__ || tok == TOK___TIME__) { time_t ti; struct tm *tm; time(&ti); tm = localtime(&ti); if (tok == TOK___DATE__) { snprintf(buf, sizeof(buf), "%s %2d %d", ab_month_name[tm->tm_mon], tm->tm_mday, tm->tm_year + 1900); } else { snprintf(buf, sizeof(buf), "%02d:%02d:%02d", tm->tm_hour, tm->tm_min, tm->tm_sec); } cstrval = buf; add_cstr: t1 = TOK_STR; add_cstr1: cstr_new(&cstr); cstr_cat(&cstr, cstrval); cstr_ccat(&cstr, '\0'); cval.cstr = &cstr; tok_str_add2(tok_str, t1, &cval); cstr_free(&cstr); } else { mstr = (int *)s->c; mstr_allocated = 0; if (s->type.t == MACRO_FUNC) { /* NOTE: we do not use next_nomacro to avoid eating the next token. XXX: find better solution */ redo: if (macro_ptr) { t = *macro_ptr; if (t == 0 && can_read_stream) { /* end of macro stream: we must look at the token after in the file */ struct macro_level *ml = *can_read_stream; macro_ptr = NULL; if (ml) { macro_ptr = ml->p; ml->p = NULL; *can_read_stream = ml -> prev; } goto redo; } } else {
/* XXX: incorrect with comments */ ch = file->buf_ptr[0]; while (is_space(ch) || ch == '\n') cinp(); t = ch; } if (t != '(') /* no macro subst */ return -1; /* argument macro */ next_nomacro(); next_nomacro(); args = NULL; sa = s->next; /* NOTE: empty args are allowed, except if no args */ for(;;) { /* handle '()' case */ if (!args && !sa && tok == ')') break; if (!sa) error("macro '%s' used with too many args", get_tok_str(s->v, 0)); tok_str_new(&str); parlevel = 0; /* NOTE: non zero sa->t indicates VA_ARGS */ while ((parlevel > 0 || (tok != ')' && (tok != ',' || sa->type.t))) && tok != -1) { if (tok == '(') parlevel++; else if (tok == ')') parlevel--; tok_str_add2(&str, tok, &tokc); next_nomacro(); } tok_str_add(&str, 0); sym_push2(&args, sa->v & ~SYM_FIELD, sa->type.t, (int)str.str); sa = sa->next; if (tok == ')') { /* special case for gcc var args: add an empty var arg argument if it is omitted */ if (sa && sa->type.t && gnu_ext) continue; else break; } if (tok != ',') expect(","); next_nomacro(); } if (sa) { error("macro '%s' used with too few args",
get_tok_str(s->v, 0)); } /* now subst each arg */ mstr = macro_arg_subst(nested_list, mstr, args); /* free memory */ sa = args; while (sa) { sa1 = sa->prev; tok_str_free((int *)sa->c); sym_free(sa); sa = sa1; } mstr_allocated = 1; } sym_push2(nested_list, s->v, 0, 0); macro_subst(tok_str, nested_list, mstr, can_read_stream); /* pop nested defined symbol */ sa1 = *nested_list; *nested_list = sa1->prev; sym_free(sa1); if (mstr_allocated) tok_str_free(mstr); } return 0; } /* handle the '##' operator. Return NULL if no '##' seen. Otherwise return the resulting string (which must be freed). */ static inline int *macro_twosharps(const int *macro_str) { TokenSym *ts; const int *macro_ptr1, *start_macro_ptr, *ptr, *saved_macro_ptr; int t; const char *p1, *p2; CValue cval; TokenString macro_str1; CString cstr; start_macro_ptr = macro_str; /* we search the first '##' */ for(;;) { macro_ptr1 = macro_str; TOK_GET(t, macro_str, cval); /* nothing more to do if end of string */ if (t == 0) return NULL; if (*macro_str == TOK_TWOSHARPS) break; } /* we saw '##', so we need more processing to handle it */ cstr_new(&cstr);
tok_str_new(¯o_str1); tok = t; tokc = cval; /* add all tokens seen so far */ for(ptr = start_macro_ptr; ptr < macro_ptr1;) { TOK_GET(t, ptr, cval); tok_str_add2(¯o_str1, t, &cval); } saved_macro_ptr = macro_ptr; /* XXX: get rid of the use of macro_ptr here */ macro_ptr = (int *)macro_str; for(;;) { while (*macro_ptr == TOK_TWOSHARPS) { macro_ptr++; macro_ptr1 = macro_ptr; t = *macro_ptr; if (t) { TOK_GET(t, macro_ptr, cval); /* We concatenate the two tokens if we have an identifier or a preprocessing number */ cstr_reset(&cstr); p1 = get_tok_str(tok, &tokc); cstr_cat(&cstr, p1); p2 = get_tok_str(t, &cval); cstr_cat(&cstr, p2); cstr_ccat(&cstr, '\0'); if ((tok >= TOK_IDENT || tok == TOK_PPNUM) && (t >= TOK_IDENT || t == TOK_PPNUM)) { if (tok == TOK_PPNUM) { /* if number, then create a number token */ /* NOTE: no need to allocate because tok_str_add2() does it */ tokc.cstr = &cstr; } else { /* if identifier, we must do a test to validate we have a correct identifier */ if (t == TOK_PPNUM) { const char *p; int c; p = p2; for(;;) { c = *p; if (c == '\0') break; p++; if (!isnum(c) && !isid(c)) goto error_pasting; } } ts = tok_alloc(cstr.data, strlen(cstr.data));
tok = ts->tok; /* modify current token */ } } else { const char *str = cstr.data; const unsigned char *q; /* we look for a valid token */ /* XXX: do more extensive checks */ if (!strcmp(str, ">>=")) { tok = TOK_A_SAR; } else if (!strcmp(str, "<<=")) { tok = TOK_A_SHL; } else if (strlen(str) == 2) { /* search in two bytes table */ q = tok_two_chars; for(;;) { if (!*q) goto error_pasting; if (q[0] == str[0] && q[1] == str[1]) break; q += 3; } tok = q[2]; } else { error_pasting: /* NOTE: because get_tok_str use a static buffer, we must save it */ cstr_reset(&cstr); p1 = get_tok_str(tok, &tokc); cstr_cat(&cstr, p1); cstr_ccat(&cstr, '\0'); p2 = get_tok_str(t, &cval); warning("pasting \"%s\" and \"%s\" does not give a valid preprocessing token", cstr.data, p2); /* cannot merge tokens: just add them separately */ tok_str_add2(¯o_str1, tok, &tokc); /* XXX: free associated memory ? */ tok = t; tokc = cval; } } } } tok_str_add2(¯o_str1, tok, &tokc); next_nomacro(); if (tok == 0) break; } macro_ptr = (int *)saved_macro_ptr; cstr_free(&cstr); tok_str_add(¯o_str1, 0); return macro_str1.str; }
/* do macro substitution of macro_str and add result to (tok_str,tok_len). 'nested_list' is the list of all macros we got inside to avoid recursing. */ static void macro_subst(TokenString *tok_str, Sym **nested_list, const int *macro_str, struct macro_level ** can_read_stream) { Sym *s; int *macro_str1; const int *ptr; int t, ret; CValue cval; struct macro_level ml; /* first scan for '##' operator handling */ ptr = macro_str; macro_str1 = macro_twosharps(ptr); if (macro_str1) ptr = macro_str1; while (1) { /* NOTE: ptr == NULL can only happen if tokens are read from file stream due to a macro function call */ if (ptr == NULL) break; TOK_GET(t, ptr, cval); if (t == 0) break; s = define_find(t); if (s != NULL) { /* if nested substitution, do nothing */ if (sym_find2(*nested_list, t)) goto no_subst; ml.p = macro_ptr; if (can_read_stream) ml.prev = *can_read_stream, *can_read_stream = &ml; macro_ptr = (int *)ptr; tok = t; ret = macro_subst_tok(tok_str, nested_list, s, can_read_stream); ptr = (int *)macro_ptr; macro_ptr = ml.p; if (can_read_stream && *can_read_stream == &ml) *can_read_stream = ml.prev; if (ret != 0) goto no_subst; } else { no_subst: tok_str_add2(tok_str, t, &cval); } } if (macro_str1) tok_str_free(macro_str1); }
/* return next token with macro substitution */ static void next(void) { Sym *nested_list, *s; TokenString str; struct macro_level *ml; redo: next_nomacro(); if (!macro_ptr) { /* if not reading from macro substituted string, then try to substitute macros */ if (tok >= TOK_IDENT && (parse_flags & PARSE_FLAG_PREPROCESS)) { s = define_find(tok); if (s) { /* we have a macro: we try to substitute */ tok_str_new(&str); nested_list = NULL; ml = NULL; if (macro_subst_tok(&str, &nested_list, s, &ml) == 0) { /* substitution done, NOTE: maybe empty */ tok_str_add(&str, 0); macro_ptr = str.str; macro_ptr_allocated = str.str; goto redo; } } } } else { if (tok == 0) { /* end of macro or end of unget buffer */ if (unget_buffer_enabled) { macro_ptr = unget_saved_macro_ptr; unget_buffer_enabled = 0; } else { /* end of macro string: free it */ tok_str_free(macro_ptr_allocated); macro_ptr = NULL; } goto redo; } } /* convert preprocessor tokens into C tokens */ if (tok == TOK_PPNUM && (parse_flags & PARSE_FLAG_TOK_NUM)) { parse_number((char *)tokc.cstr->data); } } /* push back current token and set current token to 'last_tok'. Only
identifier case handled for labels. */ static inline void unget_tok(int last_tok) { int i, n; int *q; unget_saved_macro_ptr = macro_ptr; unget_buffer_enabled = 1; q = unget_saved_buffer; macro_ptr = q; *q++ = tok; n = tok_ext_size(tok) - 1; for(i=0;i
} /* Return a static symbol pointing to a section */ static Sym *get_sym_ref(CType *type, Section *sec, unsigned long offset, unsigned long size) { int v; Sym *sym; v = anon_sym++; sym = global_identifier_push(v, type->t | VT_STATIC, 0); sym->type.ref = type->ref; sym->r = VT_CONST | VT_SYM; put_extern_sym(sym, sec, offset, size); return sym; } /* push a reference to a section offset by adding a dummy symbol */ static void vpush_ref(CType *type, Section *sec, unsigned long offset, unsigned long size) { CValue cval; cval.ul = 0; vsetc(type, VT_CONST | VT_SYM, &cval); vtop->sym = get_sym_ref(type, sec, offset, size); } /* define a new external reference to a symbol 'v' of type 'u' */ static Sym *external_global_sym(int v, CType *type, int r) { Sym *s; s = sym_find(v); if (!s) { /* push forward reference */ s = global_identifier_push(v, type->t | VT_EXTERN, 0); s->type.ref = type->ref; s->r = r | VT_CONST | VT_SYM; } return s; } /* define a new external reference to a symbol 'v' of type 'u' */ static Sym *external_sym(int v, CType *type, int r) { Sym *s; s = sym_find(v); if (!s) { /* push forward reference */ s = sym_push(v, type, r | VT_CONST | VT_SYM, 0); s->type.t |= VT_EXTERN; } else {
if (!is_compatible_types(&s->type, type)) error("incompatible types for redefinition of '%s'", get_tok_str(v, NULL)); } return s; } /* push a reference to global symbol v */ static void vpush_global_sym(CType *type, int v) { Sym *sym; CValue cval; sym = external_global_sym(v, type, 0); cval.ul = 0; vsetc(type, VT_CONST | VT_SYM, &cval); vtop->sym = sym; } void vset(CType *type, int r, int v) { CValue cval; cval.i = v; vsetc(type, r, &cval); } void vseti(int r, int v) { CType type; type.t = VT_INT; vset(&type, r, v); } void vswap(void) { SValue tmp; tmp = vtop[0]; vtop[0] = vtop[-1]; vtop[-1] = tmp; } void vpushv(SValue *v) { if (vtop >= vstack + (VSTACK_SIZE - 1)) error("memory full"); vtop++; *vtop = *v; } void vdup(void) {
vpushv(vtop); } /* save r to the memory stack, and mark it as being free */ void save_reg(int r) { int l, saved, size, align; SValue *p, sv; CType *type; /* modify all stack values */ saved = 0; l = 0; for(p=vstack;p<=vtop;p++) { if ((p->r & VT_VALMASK) == r || (p->r2 & VT_VALMASK) == r) { /* must save value on stack if not already done */ if (!saved) { /* NOTE: must reload 'r' because r might be equal to r2 */ r = p->r & VT_VALMASK; /* store register in the stack */ type = &p->type; if ((p->r & VT_LVAL) || (!is_float(type->t) && (type->t & VT_BTYPE) != VT_LLONG)) type = &int_type; size = type_size(type, &align); loc = (loc - size) & -align; sv.type.t = type->t; sv.r = VT_LOCAL | VT_LVAL; sv.c.ul = loc; store(r, &sv); #ifdef TCC_TARGET_I386 /* x86 specific: need to pop fp register ST0 if saved */ if (r == TREG_ST0) { o(0xd9dd); /* fstp %st(1) */ } #endif /* special long long case */ if ((type->t & VT_BTYPE) == VT_LLONG) { sv.c.ul += 4; store(p->r2, &sv); } l = loc; saved = 1; } /* mark that stack entry as being saved on the stack */ if (p->r & VT_LVAL) { /* also clear the bounded flag because the relocation address of the function was stored in p->c.ul */ p->r = (p->r & ~(VT_VALMASK | VT_BOUNDED)) | VT_LLOCAL; } else { p->r = lvalue_type(p->type.t) | VT_LOCAL;
} p->r2 = VT_CONST; p->c.ul = l; } } } /* find a register of class 'rc2' with at most one reference on stack. * If none, call get_reg(rc) */ int get_reg_ex(int rc, int rc2) { int r; SValue *p; for(r=0;r
r = p->r & VT_VALMASK; if (r < VT_CONST && (reg_classes[r] & rc)) goto save_found; /* also look at second register (if long long) */ r = p->r2 & VT_VALMASK; if (r < VT_CONST && (reg_classes[r] & rc)) { save_found: save_reg(r); return r; } } /* Should never comes here */ return -1; } /* save registers up to (vtop - n) stack entry */ void save_regs(int n) { int r; SValue *p, *p1; p1 = vtop - n; for(p = vstack;p <= p1; p++) { r = p->r & VT_VALMASK; if (r < VT_CONST) { save_reg(r); } } } /* move register 's' to 'r', and flush previous value of r to memory if needed */ void move_reg(int r, int s) { SValue sv; if (r != s) { save_reg(r); sv.type.t = VT_INT; sv.r = s; sv.c.ul = 0; load(r, &sv); } } /* get address of vtop (vtop MUST BE an lvalue) */ void gaddrof(void) { vtop->r &= ~VT_LVAL; /* tricky: if saved lvalue, then we can go back to lvalue */ if ((vtop->r & VT_VALMASK) == VT_LLOCAL) vtop->r = (vtop->r & ~(VT_VALMASK | VT_LVAL_TYPE)) | VT_LOCAL | VT_LVAL; }
#ifdef CONFIG_TCC_BCHECK /* generate lvalue bound code */ void gbound(void) { int lval_type; CType type1; vtop->r &= ~VT_MUSTBOUND; /* if lvalue, then use checking code before dereferencing */ if (vtop->r & VT_LVAL) { /* if not VT_BOUNDED value, then make one */ if (!(vtop->r & VT_BOUNDED)) { lval_type = vtop->r & (VT_LVAL_TYPE | VT_LVAL); /* must save type because we must set it to int to get pointer */ type1 = vtop->type; vtop->type.t = VT_INT; gaddrof(); vpushi(0); gen_bounded_ptr_add(); vtop->r |= lval_type; vtop->type = type1; } /* then check for dereferencing */ gen_bounded_ptr_deref(); } } #endif /* store vtop a register belonging to class 'rc'. lvalues are converted to values. Cannot be used if cannot be converted to register value (such as structures). */ int gv(int rc) { int r, r2, rc2, bit_pos, bit_size, size, align, i; unsigned long long ll; /* NOTE: get_reg can modify vstack[] */ if (vtop->type.t & VT_BITFIELD) { bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f; bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f; /* remove bit field info to avoid loops */ vtop->type.t &= ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT)); /* generate shifts */ vpushi(32 - (bit_pos + bit_size)); gen_op(TOK_SHL); vpushi(32 - bit_size); /* NOTE: transformed to SHR if unsigned */ gen_op(TOK_SAR); r = gv(rc); } else { if (is_float(vtop->type.t) && (vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) { Sym *sym;
int *ptr; unsigned long offset; /* XXX: unify with initializers handling ? */ /* CPUs usually cannot use float constants, so we store them generically in data segment */ size = type_size(&vtop->type, &align); offset = (data_section->data_offset + align - 1) & -align; data_section->data_offset = offset; /* XXX: not portable yet */ ptr = section_ptr_add(data_section, size); size = size >> 2; for(i=0;i<size;i++) ptr[i] = vtop->c.tab[i]; sym = get_sym_ref(&vtop->type, data_section, offset, size << 2); vtop->r |= VT_LVAL | VT_SYM; vtop->sym = sym; vtop->c.ul = 0; } #ifdef CONFIG_TCC_BCHECK if (vtop->r & VT_MUSTBOUND) gbound(); #endif r = vtop->r & VT_VALMASK; /* need to reload if: - constant - lvalue (need to dereference pointer) - already a register, but not in the right class */ if (r >= VT_CONST || (vtop->r & VT_LVAL) || !(reg_classes[r] & rc) || ((vtop->type.t & VT_BTYPE) == VT_LLONG && !(reg_classes[vtop->r2] & rc))) { r = get_reg(rc); if ((vtop->type.t & VT_BTYPE) == VT_LLONG) { /* two register type load : expand to two words temporarily */ if ((vtop->r & (VT_VALMASK | VT_LVAL)) == VT_CONST) { /* load constant */ ll = vtop->c.ull; vtop->c.ui = ll; /* first word */ load(r, vtop); vtop->r = r; /* save register value */ vpushi(ll >> 32); /* second word */ } else if (r >= VT_CONST || /* XXX: test to VT_CONST incorrect ? */ (vtop->r & VT_LVAL)) { /* We do not want to modifier the long long pointer here, so the safest (and less efficient) is to save all the other registers in the stack. XXX: totally inefficient. */ save_regs(1); /* load from memory */
load(r, vtop); vdup(); vtop[-1].r = r; /* save register value */ /* increment pointer to get second word */ vtop->type.t = VT_INT; gaddrof(); vpushi(4); gen_op('+'); vtop->r |= VT_LVAL; } else { /* move registers */ load(r, vtop); vdup(); vtop[-1].r = r; /* save register value */ vtop->r = vtop[-1].r2; } /* allocate second register */ rc2 = RC_INT; if (rc == RC_IRET) rc2 = RC_LRET; r2 = get_reg(rc2); load(r2, vtop); vpop(); /* write second register */ vtop->r2 = r2; } else if ((vtop->r & VT_LVAL) && !is_float(vtop->type.t)) { int t1, t; /* lvalue of scalar type : need to use lvalue type because of possible cast */ t = vtop->type.t; t1 = t; /* compute memory access type */ if (vtop->r & VT_LVAL_BYTE) t = VT_BYTE; else if (vtop->r & VT_LVAL_SHORT) t = VT_SHORT; if (vtop->r & VT_LVAL_UNSIGNED) t |= VT_UNSIGNED; vtop->type.t = t; load(r, vtop); /* restore wanted type */ vtop->type.t = t1; } else { /* one register type load */ load(r, vtop); } } vtop->r = r; #ifdef TCC_TARGET_C67 /* uses register pairs for doubles */ if ((vtop->type.t & VT_BTYPE) == VT_DOUBLE) vtop->r2 = r+1; #endif
} return r; } /* generate vtop[-1] and vtop[0] in resp. classes rc1 and rc2 */ void gv2(int rc1, int rc2) { int v; /* generate more generic register first. But VT_JMP or VT_CMP values must be generated first in all cases to avoid possible reload errors */ v = vtop[0].r & VT_VALMASK; if (v != VT_CMP && (v & ~1) != VT_JMP && rc1 <= rc2) { vswap(); gv(rc1); vswap(); gv(rc2); /* test if reload is needed for first register */ if ((vtop[-1].r & VT_VALMASK) >= VT_CONST) { vswap(); gv(rc1); vswap(); } } else { gv(rc2); vswap(); gv(rc1); vswap(); /* test if reload is needed for first register */ if ((vtop[0].r & VT_VALMASK) >= VT_CONST) { gv(rc2); } } } /* expand long long on stack in two int registers */ void lexpand(void) { int u; u = vtop->type.t & VT_UNSIGNED; gv(RC_INT); vdup(); vtop[0].r = vtop[-1].r2; vtop[0].r2 = VT_CONST; vtop[-1].r2 = VT_CONST; vtop[0].type.t = VT_INT | u; vtop[-1].type.t = VT_INT | u; } #ifdef TCC_TARGET_ARM /* expand long long on stack */
void lexpand_nr(void) { int u,v; u = vtop->type.t & VT_UNSIGNED; vdup(); vtop->r2 = VT_CONST; vtop->type.t = VT_INT | u; v=vtop[-1].r & (VT_VALMASK | VT_LVAL); if (v == VT_CONST) { vtop[-1].c.ui = vtop->c.ull; vtop->c.ui = vtop->c.ull >> 32; vtop->r = VT_CONST; } else if (v == (VT_LVAL|VT_CONST) || v == (VT_LVAL|VT_LOCAL)) { vtop->c.ui += 4; vtop->r = vtop[-1].r; } else if (v > VT_CONST) { vtop--; lexpand(); } else vtop->r = vtop[-1].r2; vtop[-1].r2 = VT_CONST; vtop[-1].type.t = VT_INT | u; } #endif /* build a long long from two ints */ void lbuild(int t) { gv2(RC_INT, RC_INT); vtop[-1].r2 = vtop[0].r; vtop[-1].type.t = t; vpop(); } /* rotate n first stack elements to the bottom I1 ... In -> I2 ... In I1 [top is right] */ void vrotb(int n) { int i; SValue tmp; tmp = vtop[-n + 1]; for(i=-n+1;i!=0;i++) vtop[i] = vtop[i+1]; vtop[0] = tmp; } /* rotate n first stack elements to the top I1 ... In -> In I1 ... I(n-1) [top is right] */ void vrott(int n)
{ int i; SValue tmp; tmp = vtop[0]; for(i = 0;i < n - 1; i++) vtop[-i] = vtop[-i - 1]; vtop[-n + 1] = tmp; } #ifdef TCC_TARGET_ARM /* like vrott but in other direction In ... I1 -> I(n-1) ... I1 In [top is right] */ void vnrott(int n) { int i; SValue tmp; tmp = vtop[-n + 1]; for(i = n - 1; i > 0; i--) vtop[-i] = vtop[-i + 1]; vtop[0] = tmp; } #endif /* pop stack value */ void vpop(void) { int v; v = vtop->r & VT_VALMASK; #ifdef TCC_TARGET_I386 /* for x86, we need to pop the FP stack */ if (v == TREG_ST0 && !nocode_wanted) { o(0xd9dd); /* fstp %st(1) */ } else #endif if (v == VT_JMP || v == VT_JMPI) { /* need to put correct jump if && or || without test */ gsym(vtop->c.ul); } vtop--; } /* convert stack entry to register and duplicate its value in another register */ void gv_dup(void) { int rc, t, r, r1; SValue sv; t = vtop->type.t; if ((t & VT_BTYPE) == VT_LLONG) {
lexpand(); gv_dup(); vswap(); vrotb(3); gv_dup(); vrotb(4); /* stack: H L L1 H1 */ lbuild(t); vrotb(3); vrotb(3); vswap(); lbuild(t); vswap(); } else { /* duplicate value */ rc = RC_INT; sv.type.t = VT_INT; if (is_float(t)) { rc = RC_FLOAT; sv.type.t = t; } r = gv(rc); r1 = get_reg(rc); sv.r = r; sv.c.ul = 0; load(r1, &sv); /* move r to r1 */ vdup(); /* duplicates value */ vtop->r = r1; } } /* generate CPU independent (unsigned) long long operations */ void gen_opl(int op) { int t, a, b, op1, c, i; int func; SValue tmp; switch(op) { case '/': case TOK_PDIV: func = TOK___divdi3; goto gen_func; case TOK_UDIV: func = TOK___udivdi3; goto gen_func; case '%': func = TOK___moddi3; goto gen_func; case TOK_UMOD: func = TOK___umoddi3; gen_func:
/* call generic long long function */ vpush_global_sym(&func_old_type, func); vrott(3); gfunc_call(2); vpushi(0); vtop->r = REG_IRET; vtop->r2 = REG_LRET; break; case '^': case '&': case '|': case '*': case '+': case '-': t = vtop->type.t; vswap(); lexpand(); vrotb(3); lexpand(); /* stack: L1 H1 L2 H2 */ tmp = vtop[0]; vtop[0] = vtop[-3]; vtop[-3] = tmp; tmp = vtop[-2]; vtop[-2] = vtop[-3]; vtop[-3] = tmp; vswap(); /* stack: H1 H2 L1 L2 */ if (op == '*') { vpushv(vtop - 1); vpushv(vtop - 1); gen_op(TOK_UMULL); lexpand(); /* stack: H1 H2 L1 L2 ML MH */ for(i=0;i<4;i++) vrotb(6); /* stack: ML MH H1 H2 L1 L2 */ tmp = vtop[0]; vtop[0] = vtop[-2]; vtop[-2] = tmp; /* stack: ML MH H1 L2 H2 L1 */ gen_op('*'); vrotb(3); vrotb(3); gen_op('*'); /* stack: ML MH M1 M2 */ gen_op('+'); gen_op('+'); } else if (op == '+' || op == '-') { /* XXX: add non carry method too (for MIPS or alpha) */ if (op == '+') op1 = TOK_ADDC1; else
op1 = TOK_SUBC1; gen_op(op1); /* stack: H1 H2 (L1 op L2) */ vrotb(3); vrotb(3); gen_op(op1 + 1); /* TOK_xxxC2 */ } else { gen_op(op); /* stack: H1 H2 (L1 op L2) */ vrotb(3); vrotb(3); /* stack: (L1 op L2) H1 H2 */ gen_op(op); /* stack: (L1 op L2) (H1 op H2) */ } /* stack: L H */ lbuild(t); break; case TOK_SAR: case TOK_SHR: case TOK_SHL: if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) { t = vtop[-1].type.t; vswap(); lexpand(); vrotb(3); /* stack: L H shift */ c = (int)vtop->c.i; /* constant: simpler */ /* NOTE: all comments are for SHL. the other cases are done by swaping words */ vpop(); if (op != TOK_SHL) vswap(); if (c >= 32) { /* stack: L H */ vpop(); if (c > 32) { vpushi(c - 32); gen_op(op); } if (op != TOK_SAR) { vpushi(0); } else { gv_dup(); vpushi(31); gen_op(TOK_SAR); } vswap(); } else { vswap(); gv_dup(); /* stack: H L L */
vpushi(c); gen_op(op); vswap(); vpushi(32 - c); if (op == TOK_SHL) gen_op(TOK_SHR); else gen_op(TOK_SHL); vrotb(3); /* stack: L L H */ vpushi(c); if (op == TOK_SHL) gen_op(TOK_SHL); else gen_op(TOK_SHR); gen_op('|'); } if (op != TOK_SHL) vswap(); lbuild(t); } else { /* XXX: should provide a faster fallback on x86 ? */ switch(op) { case TOK_SAR: func = TOK___sardi3; goto gen_func; case TOK_SHR: func = TOK___shrdi3; goto gen_func; case TOK_SHL: func = TOK___shldi3; goto gen_func; } } break; default: /* compare operations */ t = vtop->type.t; vswap(); lexpand(); vrotb(3); lexpand(); /* stack: L1 H1 L2 H2 */ tmp = vtop[-1]; vtop[-1] = vtop[-2]; vtop[-2] = tmp; /* stack: L1 L2 H1 H2 */ /* compare high */ op1 = op; /* when values are equal, we need to compare low words. since the jump is inverted, we invert the test too. */ if (op1 == TOK_LT) op1 = TOK_LE;
else if (op1 == TOK_GT) op1 = TOK_GE; else if (op1 == TOK_ULT) op1 = TOK_ULE; else if (op1 == TOK_UGT) op1 = TOK_UGE; a = 0; b = 0; gen_op(op1); if (op1 != TOK_NE) { a = gtst(1, 0); } if (op != TOK_EQ) { /* generate non equal test */ /* XXX: NOT PORTABLE yet */ if (a == 0) { b = gtst(0, 0); } else { #if defined(TCC_TARGET_I386) b = psym(0x850f, 0); #elif defined(TCC_TARGET_ARM) b = ind; o(0x1A000000 | encbranch(ind, 0, 1)); #elif defined(TCC_TARGET_C67) error("not implemented"); #else #error not supported #endif } } /* compare low. Always unsigned */ op1 = op; if (op1 == TOK_LT) op1 = TOK_ULT; else if (op1 == TOK_LE) op1 = TOK_ULE; else if (op1 == TOK_GT) op1 = TOK_UGT; else if (op1 == TOK_GE) op1 = TOK_UGE; gen_op(op1); a = gtst(1, a); gsym(b); vseti(VT_JMPI, a); break; } } /* handle integer constant optimizations and various machine independent opt */ void gen_opic(int op) { int fc, c1, c2, n;
SValue *v1, *v2; v1 = vtop - 1; v2 = vtop; /* currently, we cannot do computations with forward symbols */ c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST; c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST; if (c1 && c2) { fc = v2->c.i; switch(op) { case '+': v1->c.i += fc; break; case '-': v1->c.i -= fc; break; case '&': v1->c.i &= fc; break; case '^': v1->c.i ^= fc; break; case '|': v1->c.i |= fc; break; case '*': v1->c.i *= fc; break; case TOK_PDIV: case '/': case '%': case TOK_UDIV: case TOK_UMOD: /* if division by zero, generate explicit division */ if (fc == 0) { if (const_wanted) error("division by zero in constant"); goto general_case; } switch(op) { default: v1->c.i /= fc; break; case '%': v1->c.i %= fc; break; case TOK_UDIV: v1->c.i = (unsigned)v1->c.i / fc; break; case TOK_UMOD: v1->c.i = (unsigned)v1->c.i % fc; break; } break; case TOK_SHL: v1->c.i <<= fc; break; case TOK_SHR: v1->c.i = (unsigned)v1->c.i >> fc; break; case TOK_SAR: v1->c.i >>= fc; break; /* tests */ case TOK_ULT: v1->c.i = (unsigned)v1->c.i < (unsigned)fc; break; case TOK_UGE: v1->c.i = (unsigned)v1->c.i >= (unsigned)fc; break; case TOK_EQ: v1->c.i = v1->c.i == fc; break; case TOK_NE: v1->c.i = v1->c.i != fc; break; case TOK_ULE: v1->c.i = (unsigned)v1->c.i <= (unsigned)fc; break; case TOK_UGT: v1->c.i = (unsigned)v1->c.i > (unsigned)fc; break; case TOK_LT: v1->c.i = v1->c.i < fc; break; case TOK_GE: v1->c.i = v1->c.i >= fc; break; case TOK_LE: v1->c.i = v1->c.i <= fc; break; case TOK_GT: v1->c.i = v1->c.i > fc; break; /* logical */ case TOK_LAND: v1->c.i = v1->c.i && fc; break; case TOK_LOR: v1->c.i = v1->c.i || fc; break; default:
goto general_case; } vtop--; } else { /* if commutative ops, put c2 as constant */ if (c1 && (op == '+' || op == '&' || op == '^' || op == '|' || op == '*')) { vswap(); swap(&c1, &c2); } fc = vtop->c.i; if (c2 && (((op == '*' || op == '/' || op == TOK_UDIV || op == TOK_PDIV) && fc == 1) || ((op == '+' || op == '-' || op == '|' || op == '^' || op == TOK_SHL || op == TOK_SHR || op == TOK_SAR) && fc == 0) || (op == '&' && fc == -1))) { /* nothing to do */ vtop--; } else if (c2 && (op == '*' || op == TOK_PDIV || op == TOK_UDIV)) { /* try to use shifts instead of muls or divs */ if (fc > 0 && (fc & (fc - 1)) == 0) { n = -1; while (fc) { fc >>= 1; n++; } vtop->c.i = n; if (op == '*') op = TOK_SHL; else if (op == TOK_PDIV) op = TOK_SAR; else op = TOK_SHR; } goto general_case; } else if (c2 && (op == '+' || op == '-') && (vtop[-1].r & (VT_VALMASK | VT_LVAL | VT_SYM)) == (VT_CONST | VT_SYM)) { /* symbol + constant case */ if (op == '-') fc = -fc; vtop--; vtop->c.i += fc; } else { general_case: if (!nocode_wanted) { /* call low level op generator */ gen_opi(op); } else { vtop--;
} } } } /* generate a floating point operation with constant propagation */ void gen_opif(int op) { int c1, c2; SValue *v1, *v2; long double f1, f2; v1 = vtop - 1; v2 = vtop; /* currently, we cannot do computations with forward symbols */ c1 = (v1->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST; c2 = (v2->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST; if (c1 && c2) { if (v1->type.t == VT_FLOAT) { f1 = v1->c.f; f2 = v2->c.f; } else if (v1->type.t == VT_DOUBLE) { f1 = v1->c.d; f2 = v2->c.d; } else { f1 = v1->c.ld; f2 = v2->c.ld; } /* NOTE: we only do constant propagation if finite number (not NaN or infinity) (ANSI spec) */ if (!ieee_finite(f1) || !ieee_finite(f2)) goto general_case; switch(op) { case '+': f1 += f2; break; case '-': f1 -= f2; break; case '*': f1 *= f2; break; case '/': if (f2 == 0.0) { if (const_wanted) error("division by zero in constant"); goto general_case; } f1 /= f2; break; /* XXX: also handles tests ? */ default: goto general_case; } /* XXX: overflow test ? */ if (v1->type.t == VT_FLOAT) { v1->c.f = f1;
} else if (v1->type.t == VT_DOUBLE) { v1->c.d = f1; } else { v1->c.ld = f1; } vtop--; } else { general_case: if (!nocode_wanted) { gen_opf(op); } else { vtop--; } } } static int pointed_size(CType *type) { int align; return type_size(pointed_type(type), &align); } static inline int is_null_pointer(SValue *p) { if ((p->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST) return 0; return ((p->type.t & VT_BTYPE) == VT_INT && p->c.i == 0) || ((p->type.t & VT_BTYPE) == VT_LLONG && p->c.ll == 0); } static inline int is_integer_btype(int bt) { return (bt == VT_BYTE || bt == VT_SHORT || bt == VT_INT || bt == VT_LLONG); } /* check types for comparison or substraction of pointers */ static void check_comparison_pointer_types(SValue *p1, SValue *p2, int op) { CType *type1, *type2, tmp_type1, tmp_type2; int bt1, bt2; /* null pointers are accepted for all comparisons as gcc */ if (is_null_pointer(p1) || is_null_pointer(p2)) return; type1 = &p1->type; type2 = &p2->type; bt1 = type1->t & VT_BTYPE; bt2 = type2->t & VT_BTYPE; /* accept comparison between pointer and integer with a warning */ if ((is_integer_btype(bt1) || is_integer_btype(bt2)) && op != '-') { warning("comparison between pointer and integer"); return;
} /* both must be pointers or implicit function pointers */ if (bt1 == VT_PTR) { type1 = pointed_type(type1); } else if (bt1 != VT_FUNC) goto invalid_operands; if (bt2 == VT_PTR) { type2 = pointed_type(type2); } else if (bt2 != VT_FUNC) { invalid_operands: error("invalid operands to binary %s", get_tok_str(op, NULL)); } if ((type1->t & VT_BTYPE) == VT_VOID || (type2->t & VT_BTYPE) == VT_VOID) return; tmp_type1 = *type1; tmp_type2 = *type2; tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE); tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE); if (!is_compatible_types(&tmp_type1, &tmp_type2)) { /* gcc-like error if '-' is used */ if (op == '-') goto invalid_operands; else warning("comparison of distinct pointer types lacks a cast"); } } /* generic gen_op: handles types problems */ void gen_op(int op) { int u, t1, t2, bt1, bt2, t; CType type1; t1 = vtop[-1].type.t; t2 = vtop[0].type.t; bt1 = t1 & VT_BTYPE; bt2 = t2 & VT_BTYPE; if (bt1 == VT_PTR || bt2 == VT_PTR) { /* at least one operand is a pointer */ /* relationnal op: must be both pointers */ if (op >= TOK_ULT && op <= TOK_GT) { check_comparison_pointer_types(vtop - 1, vtop, op); /* pointers are handled are unsigned */ t = VT_INT | VT_UNSIGNED; goto std_op; } /* if both pointers, then it must be the '-' op */ if (bt1 == VT_PTR && bt2 == VT_PTR) { if (op != '-')
error("cannot use pointers here"); check_comparison_pointer_types(vtop - 1, vtop, op); /* XXX: check that types are compatible */ u = pointed_size(&vtop[-1].type); gen_opic(op); /* set to integer type */ vtop->type.t = VT_INT; vpushi(u); gen_op(TOK_PDIV); } else { /* exactly one pointer : must be '+' or '-'. */ if (op != '-' && op != '+') error("cannot use pointers here"); /* Put pointer as first operand */ if (bt2 == VT_PTR) { vswap(); swap(&t1, &t2); } type1 = vtop[-1].type; /* XXX: cast to int ? (long long case) */ vpushi(pointed_size(&vtop[-1].type)); gen_op('*'); #ifdef CONFIG_TCC_BCHECK /* if evaluating constant expression, no code should be generated, so no bound check */ if (do_bounds_check && !const_wanted) { /* if bounded pointers, we generate a special code to test bounds */ if (op == '-') { vpushi(0); vswap(); gen_op('-'); } gen_bounded_ptr_add(); } else #endif { gen_opic(op); } /* put again type if gen_opic() swaped operands */ vtop->type = type1; } } else if (is_float(bt1) || is_float(bt2)) { /* compute bigger type and do implicit casts */ if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) { t = VT_LDOUBLE; } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) { t = VT_DOUBLE; } else { t = VT_FLOAT; } /* floats can only be used for a few operations */ if (op != '+' && op != '-' && op != '*' && op != '/' &&
(op < TOK_ULT || op > TOK_GT)) error("invalid operands for binary operation"); goto std_op; } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) { /* cast to biggest op */ t = VT_LLONG; /* convert to unsigned if it does not fit in a long long */ if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) || (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED)) t |= VT_UNSIGNED; goto std_op; } else { /* integer operations */ t = VT_INT; /* convert to unsigned if it does not fit in an integer */ if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) || (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED)) t |= VT_UNSIGNED; std_op: /* XXX: currently, some unsigned operations are explicit, so we modify them here */ if (t & VT_UNSIGNED) { if (op == TOK_SAR) op = TOK_SHR; else if (op == '/') op = TOK_UDIV; else if (op == '%') op = TOK_UMOD; else if (op == TOK_LT) op = TOK_ULT; else if (op == TOK_GT) op = TOK_UGT; else if (op == TOK_LE) op = TOK_ULE; else if (op == TOK_GE) op = TOK_UGE; } vswap(); type1.t = t; gen_cast(&type1); vswap(); /* special case for shifts and long long: we keep the shift as an integer */ if (op == TOK_SHR || op == TOK_SAR || op == TOK_SHL) type1.t = VT_INT; gen_cast(&type1); if (is_float(t)) gen_opif(op); else if ((t & VT_BTYPE) == VT_LLONG) gen_opl(op); else gen_opic(op); if (op >= TOK_ULT && op <= TOK_GT) {
/* relationnal op: the result is an int */ vtop->type.t = VT_INT; } else { vtop->type.t = t; } } } /* generic itof for unsigned long long case */ void gen_cvt_itof1(int t) { if ((vtop->type.t & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED)) { if (t == VT_FLOAT) vpush_global_sym(&func_old_type, TOK___ulltof); else if (t == VT_DOUBLE) vpush_global_sym(&func_old_type, TOK___ulltod); else vpush_global_sym(&func_old_type, TOK___ulltold); vrott(2); gfunc_call(1); vpushi(0); vtop->r = REG_FRET; } else { gen_cvt_itof(t); } } /* generic ftoi for unsigned long long case */ void gen_cvt_ftoi1(int t) { int st; if (t == (VT_LLONG | VT_UNSIGNED)) { /* not handled natively */ st = vtop->type.t & VT_BTYPE; if (st == VT_FLOAT) vpush_global_sym(&func_old_type, TOK___fixunssfdi); else if (st == VT_DOUBLE) vpush_global_sym(&func_old_type, TOK___fixunsdfdi); else vpush_global_sym(&func_old_type, TOK___fixunsxfdi); vrott(2); gfunc_call(1); vpushi(0); vtop->r = REG_IRET; vtop->r2 = REG_LRET; } else { gen_cvt_ftoi(t); } }
/* force char or short cast */ void force_charshort_cast(int t) { int bits, dbt; dbt = t & VT_BTYPE; /* XXX: add optimization if lvalue : just change type and offset */ if (dbt == VT_BYTE) bits = 8; else bits = 16; if (t & VT_UNSIGNED) { vpushi((1 << bits) - 1); gen_op('&'); } else { bits = 32 - bits; vpushi(bits); gen_op(TOK_SHL); vpushi(bits); gen_op(TOK_SAR); } } /* cast 'vtop' to 'type'. Casting to bitfields is forbidden. */ static void gen_cast(CType *type) { int sbt, dbt, sf, df, c; /* special delayed cast for char/short */ /* XXX: in some cases (multiple cascaded casts), it may still be incorrect */ if (vtop->r & VT_MUSTCAST) { vtop->r &= ~VT_MUSTCAST; force_charshort_cast(vtop->type.t); } /* bitfields first get cast to ints */ if (vtop->type.t & VT_BITFIELD) { gv(RC_INT); } dbt = type->t & (VT_BTYPE | VT_UNSIGNED); sbt = vtop->type.t & (VT_BTYPE | VT_UNSIGNED); if (sbt != dbt && !nocode_wanted) { sf = is_float(sbt); df = is_float(dbt); c = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST; if (sf && df) { /* convert from fp to fp */ if (c) { /* constant case: we can do it now */ /* XXX: in ISOC, cannot do it if error in convert */ if (dbt == VT_FLOAT && sbt == VT_DOUBLE)
vtop->c.f = (float)vtop->c.d; else if (dbt == VT_FLOAT && sbt == VT_LDOUBLE) vtop->c.f = (float)vtop->c.ld; else if (dbt == VT_DOUBLE && sbt == VT_FLOAT) vtop->c.d = (double)vtop->c.f; else if (dbt == VT_DOUBLE && sbt == VT_LDOUBLE) vtop->c.d = (double)vtop->c.ld; else if (dbt == VT_LDOUBLE && sbt == VT_FLOAT) vtop->c.ld = (long double)vtop->c.f; else if (dbt == VT_LDOUBLE && sbt == VT_DOUBLE) vtop->c.ld = (long double)vtop->c.d; } else { /* non constant case: generate code */ gen_cvt_ftof(dbt); } } else if (df) { /* convert int to fp */ if (c) { switch(sbt) { case VT_LLONG | VT_UNSIGNED: case VT_LLONG: /* XXX: add const cases for long long */ goto do_itof; case VT_INT | VT_UNSIGNED: switch(dbt) { case VT_FLOAT: vtop->c.f = (float)vtop->c.ui; break; case VT_DOUBLE: vtop->c.d = (double)vtop->c.ui; break; case VT_LDOUBLE: vtop->c.ld = (long double)vtop->c.ui; break; } break; default: switch(dbt) { case VT_FLOAT: vtop->c.f = (float)vtop->c.i; break; case VT_DOUBLE: vtop->c.d = (double)vtop->c.i; break; case VT_LDOUBLE: vtop->c.ld = (long double)vtop->c.i; break; } break; } } else { do_itof: #if !defined(TCC_TARGET_ARM) gen_cvt_itof1(dbt); #else gen_cvt_itof(dbt); #endif } } else if (sf) { /* convert fp to int */ /* we handle char/short/etc... with generic code */ if (dbt != (VT_INT | VT_UNSIGNED) && dbt != (VT_LLONG | VT_UNSIGNED) && dbt != VT_LLONG) dbt = VT_INT;
if (c) { switch(dbt) { case VT_LLONG | VT_UNSIGNED: case VT_LLONG: /* XXX: add const cases for long long */ goto do_ftoi; case VT_INT | VT_UNSIGNED: switch(sbt) { case VT_FLOAT: vtop->c.ui = (unsigned int)vtop->c.d; break; case VT_DOUBLE: vtop->c.ui = (unsigned int)vtop->c.d; break; case VT_LDOUBLE: vtop->c.ui = (unsigned int)vtop->c.d; break; } break; default: /* int case */ switch(sbt) { case VT_FLOAT: vtop->c.i = (int)vtop->c.d; break; case VT_DOUBLE: vtop->c.i = (int)vtop->c.d; break; case VT_LDOUBLE: vtop->c.i = (int)vtop->c.d; break; } break; } } else { do_ftoi: gen_cvt_ftoi1(dbt); } if (dbt == VT_INT && (type->t & (VT_BTYPE | VT_UNSIGNED)) != dbt) { /* additional cast for char/short/bool... */ vtop->type.t = dbt; gen_cast(type); } } else if ((dbt & VT_BTYPE) == VT_LLONG) { if ((sbt & VT_BTYPE) != VT_LLONG) { /* scalar to long long */ if (c) { if (sbt == (VT_INT | VT_UNSIGNED)) vtop->c.ll = vtop->c.ui; else vtop->c.ll = vtop->c.i; } else { /* machine independent conversion */ gv(RC_INT); /* generate high word */ if (sbt == (VT_INT | VT_UNSIGNED)) { vpushi(0); gv(RC_INT); } else { gv_dup(); vpushi(31); gen_op(TOK_SAR); } /* patch second register */ vtop[-1].r2 = vtop->r;
vpop(); } } } else if (dbt == VT_BOOL) { /* scalar to bool */ vpushi(0); gen_op(TOK_NE); } else if ((dbt & VT_BTYPE) == VT_BYTE || (dbt & VT_BTYPE) == VT_SHORT) { force_charshort_cast(dbt); } else if ((dbt & VT_BTYPE) == VT_INT) { /* scalar to int */ if (sbt == VT_LLONG) { /* from long long: just take low order word */ lexpand(); vpop(); } /* if lvalue and single word type, nothing to do because the lvalue already contains the real type size (see VT_LVAL_xxx constants) */ } } vtop->type = *type; } /* return type size. Put alignment at 'a' */ static int type_size(CType *type, int *a) { Sym *s; int bt; bt = type->t & VT_BTYPE; if (bt == VT_STRUCT) { /* struct/union */ s = type->ref; *a = s->r; return s->c; } else if (bt == VT_PTR) { if (type->t & VT_ARRAY) { s = type->ref; return type_size(&s->type, a) * s->c; } else { *a = PTR_SIZE; return PTR_SIZE; } } else if (bt == VT_LDOUBLE) { *a = LDOUBLE_ALIGN; return LDOUBLE_SIZE; } else if (bt == VT_DOUBLE || bt == VT_LLONG) { #ifdef TCC_TARGET_I386 *a = 4; #else *a = 8;
#endif return 8; } else if (bt == VT_INT || bt == VT_ENUM || bt == VT_FLOAT) { *a = 4; return 4; } else if (bt == VT_SHORT) { *a = 2; return 2; } else { /* char, void, function, _Bool */ *a = 1; return 1; } } /* return the pointed type of t */ static inline CType *pointed_type(CType *type) { return &type->ref->type; } /* modify type so that its it is a pointer to type. */ static void mk_pointer(CType *type) { Sym *s; s = sym_push(SYM_FIELD, type, 0, -1); type->t = VT_PTR | (type->t & ~VT_TYPE); type->ref = s; } /* compare function types. OLD functions match any new functions */ static int is_compatible_func(CType *type1, CType *type2) { Sym *s1, *s2; s1 = type1->ref; s2 = type2->ref; if (!is_compatible_types(&s1->type, &s2->type)) return 0; /* check func_call */ if (s1->r != s2->r) return 0; /* XXX: not complete */ if (s1->c == FUNC_OLD || s2->c == FUNC_OLD) return 1; if (s1->c != s2->c) return 0; while (s1 != NULL) { if (s2 == NULL) return 0; if (!is_compatible_types(&s1->type, &s2->type)) return 0; s1 = s1->next;
s2 = s2->next; } if (s2) return 0; return 1; } /* return true if type1 and type2 are exactly the same (including qualifiers). - enums are not checked as gcc __builtin_types_compatible_p () */ static int is_compatible_types(CType *type1, CType *type2) { int bt1, t1, t2; t1 = type1->t & VT_TYPE; t2 = type2->t & VT_TYPE; /* XXX: bitfields ? */ if (t1 != t2) return 0; /* test more complicated cases */ bt1 = t1 & VT_BTYPE; if (bt1 == VT_PTR) { type1 = pointed_type(type1); type2 = pointed_type(type2); return is_compatible_types(type1, type2); } else if (bt1 == VT_STRUCT) { return (type1->ref == type2->ref); } else if (bt1 == VT_FUNC) { return is_compatible_func(type1, type2); } else { return 1; } } /* print a type. If 'varstr' is not NULL, then the variable is also printed in the type */ /* XXX: union */ /* XXX: add array and function pointers */ void type_to_str(char *buf, int buf_size, CType *type, const char *varstr) { int bt, v, t; Sym *s, *sa; char buf1[256]; const char *tstr; t = type->t & VT_TYPE; bt = t & VT_BTYPE; buf[0] = '\0'; if (t & VT_CONSTANT) pstrcat(buf, buf_size, "const ");
if (t & VT_VOLATILE) pstrcat(buf, buf_size, "volatile "); if (t & VT_UNSIGNED) pstrcat(buf, buf_size, "unsigned "); switch(bt) { case VT_VOID: tstr = "void"; goto add_tstr; case VT_BOOL: tstr = "_Bool"; goto add_tstr; case VT_BYTE: tstr = "char"; goto add_tstr; case VT_SHORT: tstr = "short"; goto add_tstr; case VT_INT: tstr = "int"; goto add_tstr; case VT_LONG: tstr = "long"; goto add_tstr; case VT_LLONG: tstr = "long long"; goto add_tstr; case VT_FLOAT: tstr = "float"; goto add_tstr; case VT_DOUBLE: tstr = "double"; goto add_tstr; case VT_LDOUBLE: tstr = "long double"; add_tstr: pstrcat(buf, buf_size, tstr); break; case VT_ENUM: case VT_STRUCT: if (bt == VT_STRUCT) tstr = "struct "; else tstr = "enum "; pstrcat(buf, buf_size, tstr); v = type->ref->v & ~SYM_STRUCT; if (v >= SYM_FIRST_ANOM) pstrcat(buf, buf_size, "
pstrcat(buf, buf_size, "("); sa = s->next; while (sa != NULL) { type_to_str(buf1, sizeof(buf1), &sa->type, NULL); pstrcat(buf, buf_size, buf1); sa = sa->next; if (sa) pstrcat(buf, buf_size, ", "); } pstrcat(buf, buf_size, ")"); goto no_var; case VT_PTR: s = type->ref; pstrcpy(buf1, sizeof(buf1), "*"); if (varstr) pstrcat(buf1, sizeof(buf1), varstr); type_to_str(buf, buf_size, &s->type, buf1); goto no_var; } if (varstr) { pstrcat(buf, buf_size, " "); pstrcat(buf, buf_size, varstr); } no_var: ; } /* verify type compatibility to store vtop in 'dt' type, and generate casts if needed. */ static void gen_assign_cast(CType *dt) { CType *st, *type1, *type2, tmp_type1, tmp_type2; char buf1[256], buf2[256]; int dbt, sbt; st = &vtop->type; /* source type */ dbt = dt->t & VT_BTYPE; sbt = st->t & VT_BTYPE; if (dt->t & VT_CONSTANT) warning("assignment of read-only location"); switch(dbt) { case VT_PTR: /* special cases for pointers */ /* '0' can also be a pointer */ if (is_null_pointer(vtop)) goto type_ok; /* accept implicit pointer to integer cast with warning */ if (is_integer_btype(sbt)) { warning("assignment makes pointer from integer without a cast"); goto type_ok; } type1 = pointed_type(dt); /* a function is implicitely a function pointer */ if (sbt == VT_FUNC) {
if ((type1->t & VT_BTYPE) != VT_VOID && !is_compatible_types(pointed_type(dt), st)) goto error; else goto type_ok; } if (sbt != VT_PTR) goto error; type2 = pointed_type(st); if ((type1->t & VT_BTYPE) == VT_VOID || (type2->t & VT_BTYPE) == VT_VOID) { /* void * can match anything */ } else { /* exact type match, except for unsigned */ tmp_type1 = *type1; tmp_type2 = *type2; tmp_type1.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE); tmp_type2.t &= ~(VT_UNSIGNED | VT_CONSTANT | VT_VOLATILE); if (!is_compatible_types(&tmp_type1, &tmp_type2)) goto error; } /* check const and volatile */ if ((!(type1->t & VT_CONSTANT) && (type2->t & VT_CONSTANT)) || (!(type1->t & VT_VOLATILE) && (type2->t & VT_VOLATILE))) warning("assignment discards qualifiers from pointer target type"); break; case VT_BYTE: case VT_SHORT: case VT_INT: case VT_LLONG: if (sbt == VT_PTR || sbt == VT_FUNC) { warning("assignment makes integer from pointer without a cast"); } /* XXX: more tests */ break; case VT_STRUCT: tmp_type1 = *dt; tmp_type2 = *st; tmp_type1.t &= ~(VT_CONSTANT | VT_VOLATILE); tmp_type2.t &= ~(VT_CONSTANT | VT_VOLATILE); if (!is_compatible_types(&tmp_type1, &tmp_type2)) { error: type_to_str(buf1, sizeof(buf1), st, NULL); type_to_str(buf2, sizeof(buf2), dt, NULL); error("cannot cast '%s' to '%s'", buf1, buf2); } break; } type_ok: gen_cast(dt); } /* store vtop in lvalue pushed on stack */
void vstore(void) { int sbt, dbt, ft, r, t, size, align, bit_size, bit_pos, rc, delayed_cast; ft = vtop[-1].type.t; sbt = vtop->type.t & VT_BTYPE; dbt = ft & VT_BTYPE; if (((sbt == VT_INT || sbt == VT_SHORT) && dbt == VT_BYTE) || (sbt == VT_INT && dbt == VT_SHORT)) { /* optimize char/short casts */ delayed_cast = VT_MUSTCAST; vtop->type.t = ft & VT_TYPE; /* XXX: factorize */ if (ft & VT_CONSTANT) warning("assignment of read-only location"); } else { delayed_cast = 0; if (!(ft & VT_BITFIELD)) gen_assign_cast(&vtop[-1].type); } if (sbt == VT_STRUCT) { /* if structure, only generate pointer */ /* structure assignment : generate memcpy */ /* XXX: optimize if small size */ if (!nocode_wanted) { size = type_size(&vtop->type, &align); vpush_global_sym(&func_old_type, TOK_memcpy); /* destination */ vpushv(vtop - 2); vtop->type.t = VT_INT; gaddrof(); /* source */ vpushv(vtop - 2); vtop->type.t = VT_INT; gaddrof(); /* type size */ vpushi(size); gfunc_call(3); vswap(); vpop(); } else { vswap(); vpop(); } /* leave source on stack */ } else if (ft & VT_BITFIELD) { /* bitfield store handling */ bit_pos = (ft >> VT_STRUCT_SHIFT) & 0x3f; bit_size = (ft >> (VT_STRUCT_SHIFT + 6)) & 0x3f;
/* remove bit field info to avoid loops */ vtop[-1].type.t = ft & ~(VT_BITFIELD | (-1 << VT_STRUCT_SHIFT)); /* duplicate destination */ vdup(); vtop[-1] = vtop[-2]; /* mask and shift source */ vpushi((1 << bit_size) - 1); gen_op('&'); vpushi(bit_pos); gen_op(TOK_SHL); /* load destination, mask and or with source */ vswap(); vpushi(~(((1 << bit_size) - 1) << bit_pos)); gen_op('&'); gen_op('|'); /* store result */ vstore(); } else { #ifdef CONFIG_TCC_BCHECK /* bound check case */ if (vtop[-1].r & VT_MUSTBOUND) { vswap(); gbound(); vswap(); } #endif if (!nocode_wanted) { rc = RC_INT; if (is_float(ft)) rc = RC_FLOAT; r = gv(rc); /* generate value */ /* if lvalue was saved on stack, must read it */ if ((vtop[-1].r & VT_VALMASK) == VT_LLOCAL) { SValue sv; t = get_reg(RC_INT); sv.type.t = VT_INT; sv.r = VT_LOCAL | VT_LVAL; sv.c.ul = vtop[-1].c.ul; load(t, &sv); vtop[-1].r = t | VT_LVAL; } store(r, vtop - 1); /* two word case handling : store second register at word + 4 */ if ((ft & VT_BTYPE) == VT_LLONG) { vswap(); /* convert to int to increment easily */ vtop->type.t = VT_INT; gaddrof(); vpushi(4); gen_op('+'); vtop->r |= VT_LVAL;
vswap(); /* XXX: it works because r2 is spilled last ! */ store(vtop->r2, vtop - 1); } } vswap(); vtop--; /* NOT vpop() because on x86 it would flush the fp stack */ vtop->r |= delayed_cast; } } /* post defines POST/PRE add. c is the token ++ or -- */ void inc(int post, int c) { test_lvalue(); vdup(); /* save lvalue */ if (post) { gv_dup(); /* duplicate value */ vrotb(3); vrotb(3); } /* add constant */ vpushi(c - TOK_MID); gen_op('+'); vstore(); /* store value */ if (post) vpop(); /* if post op, return saved value */ } /* Parse GNUC __attribute__ extension. Currently, the following extensions are recognized: - aligned(n) : set data/function alignment. - packed : force data alignment to 1 - section(x) : generate data/code in this section. - unused : currently ignored, but may be used someday. - regparm(n) : pass function parameters in registers (i386 only) */ static void parse_attribute(AttributeDef *ad) { int t, n; while (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) { next(); skip('('); skip('('); while (tok != ')') { if (tok < TOK_IDENT) expect("attribute name"); t = tok; next(); switch(t) { case TOK_SECTION1: case TOK_SECTION2:
skip('('); if (tok != TOK_STR) expect("section name"); ad->section = find_section(tcc_state, (char *)tokc.cstr->data); next(); skip(')'); break; case TOK_ALIGNED1: case TOK_ALIGNED2: if (tok == '(') { next(); n = expr_const(); if (n <= 0 || (n & (n - 1)) != 0) error("alignment must be a positive power of two"); skip(')'); } else { n = MAX_ALIGN; } ad->aligned = n; break; case TOK_PACKED1: case TOK_PACKED2: ad->packed = 1; break; case TOK_UNUSED1: case TOK_UNUSED2: /* currently, no need to handle it because tcc does not track unused objects */ break; case TOK_NORETURN1: case TOK_NORETURN2: /* currently, no need to handle it because tcc does not track unused objects */ break; case TOK_CDECL1: case TOK_CDECL2: case TOK_CDECL3: ad->func_call = FUNC_CDECL; break; case TOK_STDCALL1: case TOK_STDCALL2: case TOK_STDCALL3: ad->func_call = FUNC_STDCALL; break; #ifdef TCC_TARGET_I386 case TOK_REGPARM1: case TOK_REGPARM2: skip('('); n = expr_const(); if (n > 3) n = 3; else if (n < 0) n = 0;
if (n > 0) ad->func_call = FUNC_FASTCALL1 + n - 1; skip(')'); break; #endif case TOK_DLLEXPORT: ad->dllexport = 1; break; default: if (tcc_state->warn_unsupported) warning("'%s' attribute ignored", get_tok_str(t, NULL)); /* skip parameters */ /* XXX: skip parenthesis too */ if (tok == '(') { next(); while (tok != ')' && tok != -1) next(); next(); } break; } if (tok != ',') break; next(); } skip(')'); skip(')'); } } /* enum/struct/union declaration. u is either VT_ENUM or VT_STRUCT */ static void struct_decl(CType *type, int u) { int a, v, size, align, maxalign, c, offset; int bit_size, bit_pos, bsize, bt, lbit_pos; Sym *s, *ss, **ps; AttributeDef ad; CType type1, btype; a = tok; /* save decl type */ next(); if (tok != '{') { v = tok; next(); /* struct already defined ? return it */ if (v < TOK_IDENT) expect("struct/union/enum name"); s = struct_find(v); if (s) { if (s->type.t != a) error("invalid type"); goto do_decl; }
} else { v = anon_sym++; } type1.t = a; /* we put an undefined size for struct/union */ s = sym_push(v | SYM_STRUCT, &type1, 0, -1); s->r = 0; /* default alignment is zero as gcc */ /* put struct/union/enum name in type */ do_decl: type->t = u; type->ref = s; if (tok == '{') { next(); if (s->c != -1) error("struct/union/enum already defined"); /* cannot be empty */ c = 0; /* non empty enums are not allowed */ if (a == TOK_ENUM) { for(;;) { v = tok; if (v < TOK_UIDENT) expect("identifier"); next(); if (tok == '=') { next(); c = expr_const(); } /* enum symbols have static storage */ ss = sym_push(v, &int_type, VT_CONST, c); ss->type.t |= VT_STATIC; if (tok != ',') break; next(); c++; /* NOTE: we accept a trailing comma */ if (tok == '}') break; } skip('}'); } else { maxalign = 1; ps = &s->next; bit_pos = 0; offset = 0; while (tok != '}') { parse_btype(&btype, &ad); while (1) { bit_size = -1; v = 0; type1 = btype; if (tok != ':') {
type_decl(&type1, &ad, &v, TYPE_DIRECT); if ((type1.t & VT_BTYPE) == VT_FUNC || (type1.t & (VT_TYPEDEF | VT_STATIC | VT_EXTERN | VT_INLINE))) error("invalid type for '%s'", get_tok_str(v, NULL)); } if (tok == ':') { next(); bit_size = expr_const(); /* XXX: handle v = 0 case for messages */ if (bit_size < 0) error("negative width in bit-field '%s'", get_tok_str(v, NULL)); if (v && bit_size == 0) error("zero width for bit-field '%s'", get_tok_str(v, NULL)); } size = type_size(&type1, &align); if (ad.aligned) { if (align < ad.aligned) align = ad.aligned; } else if (ad.packed) { align = 1; } else if (*tcc_state->pack_stack_ptr) { if (align > *tcc_state->pack_stack_ptr) align = *tcc_state->pack_stack_ptr; } lbit_pos = 0; if (bit_size >= 0) { bt = type1.t & VT_BTYPE; if (bt != VT_INT && bt != VT_BYTE && bt != VT_SHORT && bt != VT_BOOL && bt != VT_ENUM) error("bitfields must have scalar type"); bsize = size * 8; if (bit_size > bsize) { error("width of '%s' exceeds its type", get_tok_str(v, NULL)); } else if (bit_size == bsize) { /* no need for bit fields */ bit_pos = 0; } else if (bit_size == 0) { /* XXX: what to do if only padding in a structure ? */ /* zero size: means to pad */ if (bit_pos > 0) bit_pos = bsize; } else { /* we do not have enough room ? */ if ((bit_pos + bit_size) > bsize) bit_pos = 0;
lbit_pos = bit_pos; /* XXX: handle LSB first */ type1.t |= VT_BITFIELD | (bit_pos << VT_STRUCT_SHIFT) | (bit_size << (VT_STRUCT_SHIFT + 6)); bit_pos += bit_size; } } else { bit_pos = 0; } if (v) { /* add new memory data only if starting bit field */ if (lbit_pos == 0) { if (a == TOK_STRUCT) { c = (c + align - 1) & -align; offset = c; c += size; } else { offset = 0; if (size > c) c = size; } if (align > maxalign) maxalign = align; } #if 0 printf("add field %s offset=%d", get_tok_str(v, NULL), offset); if (type1.t & VT_BITFIELD) { printf(" pos=%d size=%d", (type1.t >> VT_STRUCT_SHIFT) & 0x3f, (type1.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f); } printf("\n"); #endif ss = sym_push(v | SYM_FIELD, &type1, 0, offset); *ps = ss; ps = &ss->next; } if (tok == ';' || tok == TOK_EOF) break; skip(','); } skip(';'); } skip('}'); /* store size and alignment */ s->c = (c + maxalign - 1) & -maxalign; s->r = maxalign; } } }
/* return 0 if no type declaration. otherwise, return the basic type and skip it. */ static int parse_btype(CType *type, AttributeDef *ad) { int t, u, type_found, typespec_found; Sym *s; CType type1; memset(ad, 0, sizeof(AttributeDef)); type_found = 0; typespec_found = 0; t = 0; while(1) { switch(tok) { case TOK_EXTENSION: /* currently, we really ignore extension */ next(); continue; /* basic types */ case TOK_CHAR: u = VT_BYTE; basic_type: next(); basic_type1: if ((t & VT_BTYPE) != 0) error("too many basic types"); t |= u; typespec_found = 1; break; case TOK_VOID: u = VT_VOID; goto basic_type; case TOK_SHORT: u = VT_SHORT; goto basic_type; case TOK_INT: next(); typespec_found = 1; break; case TOK_LONG: next(); if ((t & VT_BTYPE) == VT_DOUBLE) { t = (t & ~VT_BTYPE) | VT_LDOUBLE; } else if ((t & VT_BTYPE) == VT_LONG) { t = (t & ~VT_BTYPE) | VT_LLONG; } else { u = VT_LONG; goto basic_type1; } break;
case TOK_BOOL: u = VT_BOOL; goto basic_type; case TOK_FLOAT: u = VT_FLOAT; goto basic_type; case TOK_DOUBLE: next(); if ((t & VT_BTYPE) == VT_LONG) { t = (t & ~VT_BTYPE) | VT_LDOUBLE; } else { u = VT_DOUBLE; goto basic_type1; } break; case TOK_ENUM: struct_decl(&type1, VT_ENUM); basic_type2: u = type1.t; type->ref = type1.ref; goto basic_type1; case TOK_STRUCT: case TOK_UNION: struct_decl(&type1, VT_STRUCT); goto basic_type2; /* type modifiers */ case TOK_CONST1: case TOK_CONST2: case TOK_CONST3: t |= VT_CONSTANT; next(); break; case TOK_VOLATILE1: case TOK_VOLATILE2: case TOK_VOLATILE3: t |= VT_VOLATILE; next(); break; case TOK_SIGNED1: case TOK_SIGNED2: case TOK_SIGNED3: typespec_found = 1; t |= VT_SIGNED; next(); break; case TOK_REGISTER: case TOK_AUTO: case TOK_RESTRICT1: case TOK_RESTRICT2: case TOK_RESTRICT3: next(); break;
case TOK_UNSIGNED: t |= VT_UNSIGNED; next(); typespec_found = 1; break; /* storage */ case TOK_EXTERN: t |= VT_EXTERN; next(); break; case TOK_STATIC: t |= VT_STATIC; next(); break; case TOK_TYPEDEF: t |= VT_TYPEDEF; next(); break; case TOK_INLINE1: case TOK_INLINE2: case TOK_INLINE3: t |= VT_INLINE; next(); break; /* GNUC attribute */ case TOK_ATTRIBUTE1: case TOK_ATTRIBUTE2: parse_attribute(ad); break; /* GNUC typeof */ case TOK_TYPEOF1: case TOK_TYPEOF2: case TOK_TYPEOF3: next(); parse_expr_type(&type1); goto basic_type2; default: if (typespec_found) goto the_end; s = sym_find(tok); if (!s || !(s->type.t & VT_TYPEDEF)) goto the_end; t |= (s->type.t & ~VT_TYPEDEF); type->ref = s->type.ref; next(); break; } type_found = 1; } the_end: if ((t & (VT_SIGNED|VT_UNSIGNED)) == (VT_SIGNED|VT_UNSIGNED))
error("signed and unsigned modifier"); if (tcc_state->char_is_unsigned) { if ((t & (VT_SIGNED|VT_UNSIGNED|VT_BTYPE)) == VT_BYTE) t |= VT_UNSIGNED; } t &= ~VT_SIGNED; /* long is never used as type */ if ((t & VT_BTYPE) == VT_LONG) t = (t & ~VT_BTYPE) | VT_INT; type->t = t; return type_found; } /* convert a function parameter type (array to pointer and function to function pointer) */ static inline void convert_parameter_type(CType *pt) { /* remove const and volatile qualifiers (XXX: const could be used to indicate a const function parameter */ pt->t &= ~(VT_CONSTANT | VT_VOLATILE); /* array must be transformed to pointer according to ANSI C */ pt->t &= ~VT_ARRAY; if ((pt->t & VT_BTYPE) == VT_FUNC) { mk_pointer(pt); } } static void post_type(CType *type, AttributeDef *ad) { int n, l, t1; Sym **plast, *s, *first; AttributeDef ad1; CType pt; if (tok == '(') { /* function declaration */ next(); l = 0; first = NULL; plast = &first; while (tok != ')') { /* read param name and compute offset */ if (l != FUNC_OLD) { if (!parse_btype(&pt, &ad1)) { if (l) { error("invalid type"); } else { l = FUNC_OLD; goto old_proto; } } l = FUNC_NEW;
if ((pt.t & VT_BTYPE) == VT_VOID && tok == ')') break; type_decl(&pt, &ad1, &n, TYPE_DIRECT | TYPE_ABSTRACT); if ((pt.t & VT_BTYPE) == VT_VOID) error("parameter declared as void"); } else { old_proto: n = tok; pt.t = VT_INT; next(); } convert_parameter_type(&pt); s = sym_push(n | SYM_FIELD, &pt, 0, 0); *plast = s; plast = &s->next; if (tok == ',') { next(); if (l == FUNC_NEW && tok == TOK_DOTS) { l = FUNC_ELLIPSIS; next(); break; } } } /* if no parameters, then old type prototype */ if (l == 0) l = FUNC_OLD; skip(')'); t1 = type->t & VT_STORAGE; /* NOTE: const is ignored in returned type as it has a special meaning in gcc / C++ */ type->t &= ~(VT_STORAGE | VT_CONSTANT); post_type(type, ad); /* we push a anonymous symbol which will contain the function prototype */ s = sym_push(SYM_FIELD, type, ad->func_call, l); s->next = first; type->t = t1 | VT_FUNC; type->ref = s; } else if (tok == '[') { /* array definition */ next(); n = -1; if (tok != ']') { n = expr_const(); if (n < 0) error("invalid array size"); } skip(']'); /* parse next post type */ t1 = type->t & VT_STORAGE; type->t &= ~VT_STORAGE; post_type(type, ad);
/* we push a anonymous symbol which will contain the array element type */ s = sym_push(SYM_FIELD, type, 0, n); type->t = t1 | VT_ARRAY | VT_PTR; type->ref = s; } } /* Parse a type declaration (except basic type), and return the type in 'type'. 'td' is a bitmask indicating which kind of type decl is expected. 'type' should contain the basic type. 'ad' is the attribute definition of the basic type. It can be modified by type_decl(). */ static void type_decl(CType *type, AttributeDef *ad, int *v, int td) { Sym *s; CType type1, *type2; int qualifiers; while (tok == '*') { qualifiers = 0; redo: next(); switch(tok) { case TOK_CONST1: case TOK_CONST2: case TOK_CONST3: qualifiers |= VT_CONSTANT; goto redo; case TOK_VOLATILE1: case TOK_VOLATILE2: case TOK_VOLATILE3: qualifiers |= VT_VOLATILE; goto redo; case TOK_RESTRICT1: case TOK_RESTRICT2: case TOK_RESTRICT3: goto redo; } mk_pointer(type); type->t |= qualifiers; } /* XXX: clarify attribute handling */ if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) parse_attribute(ad); /* recursive type */ /* XXX: incorrect if abstract type for functions (e.g. 'int ()') */ type1.t = 0; /* XXX: same as int */ if (tok == '(') { next();
/* XXX: this is not correct to modify 'ad' at this point, but the syntax is not clear */ if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) parse_attribute(ad); type_decl(&type1, ad, v, td); skip(')'); } else { /* type identifier */ if (tok >= TOK_IDENT && (td & TYPE_DIRECT)) { *v = tok; next(); } else { if (!(td & TYPE_ABSTRACT)) expect("identifier"); *v = 0; } } post_type(type, ad); if (tok == TOK_ATTRIBUTE1 || tok == TOK_ATTRIBUTE2) parse_attribute(ad); if (!type1.t) return; /* append type at the end of type1 */ type2 = &type1; for(;;) { s = type2->ref; type2 = &s->type; if (!type2->t) { *type2 = *type; break; } } *type = type1; } /* compute the lvalue VT_LVAL_xxx needed to match type t. */ static int lvalue_type(int t) { int bt, r; r = VT_LVAL; bt = t & VT_BTYPE; if (bt == VT_BYTE || bt == VT_BOOL) r |= VT_LVAL_BYTE; else if (bt == VT_SHORT) r |= VT_LVAL_SHORT; else return r; if (t & VT_UNSIGNED) r |= VT_LVAL_UNSIGNED; return r; } /* indirection with full error checking and bound check */
static void indir(void) { if ((vtop->type.t & VT_BTYPE) != VT_PTR) expect("pointer"); if ((vtop->r & VT_LVAL) && !nocode_wanted) gv(RC_INT); vtop->type = *pointed_type(&vtop->type); /* an array is never an lvalue */ if (!(vtop->type.t & VT_ARRAY)) { vtop->r |= lvalue_type(vtop->type.t); /* if bound checking, the referenced pointer must be checked */ if (do_bounds_check) vtop->r |= VT_MUSTBOUND; } } /* pass a parameter to a function and do type checking and casting */ static void gfunc_param_typed(Sym *func, Sym *arg) { int func_type; CType type; func_type = func->c; if (func_type == FUNC_OLD || (func_type == FUNC_ELLIPSIS && arg == NULL)) { /* default casting : only need to convert float to double */ if ((vtop->type.t & VT_BTYPE) == VT_FLOAT) { type.t = VT_DOUBLE; gen_cast(&type); } } else if (arg == NULL) { error("too many arguments to function"); } else { type = arg->type; type.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */ gen_assign_cast(&type); } } /* parse an expression of the form '(type)' or '(expr)' and return its type */ static void parse_expr_type(CType *type) { int n; AttributeDef ad; skip('('); if (parse_btype(type, &ad)) { type_decl(type, &ad, &n, TYPE_ABSTRACT); } else { expr_type(type); } skip(')');
} static void parse_type(CType *type) { AttributeDef ad; int n; if (!parse_btype(type, &ad)) { expect("type"); } type_decl(type, &ad, &n, TYPE_ABSTRACT); } static void vpush_tokc(int t) { CType type; type.t = t; vsetc(&type, VT_CONST, &tokc); } static void unary(void) { int n, t, align, size, r; CType type; Sym *s; AttributeDef ad; /* XXX: GCC 2.95.3 does not generate a table although it should be better here */ tok_next: switch(tok) { case TOK_EXTENSION: next(); goto tok_next; case TOK_CINT: case TOK_CCHAR: case TOK_LCHAR: vpushi(tokc.i); next(); break; case TOK_CUINT: vpush_tokc(VT_INT | VT_UNSIGNED); next(); break; case TOK_CLLONG: vpush_tokc(VT_LLONG); next(); break; case TOK_CULLONG: vpush_tokc(VT_LLONG | VT_UNSIGNED); next(); break; case TOK_CFLOAT:
vpush_tokc(VT_FLOAT); next(); break; case TOK_CDOUBLE: vpush_tokc(VT_DOUBLE); next(); break; case TOK_CLDOUBLE: vpush_tokc(VT_LDOUBLE); next(); break; case TOK___FUNCTION__: if (!gnu_ext) goto tok_identifier; /* fall thru */ case TOK___FUNC__: { void *ptr; int len; /* special function name identifier */ len = strlen(funcname) + 1; /* generate char[len] type */ type.t = VT_BYTE; mk_pointer(&type); type.t |= VT_ARRAY; type.ref->c = len; vpush_ref(&type, data_section, data_section->data_offset, len); ptr = section_ptr_add(data_section, len); memcpy(ptr, funcname, len); next(); } break; case TOK_LSTR: t = VT_INT; goto str_init; case TOK_STR: /* string parsing */ t = VT_BYTE; str_init: if (tcc_state->warn_write_strings) t |= VT_CONSTANT; type.t = t; mk_pointer(&type); type.t |= VT_ARRAY; memset(&ad, 0, sizeof(AttributeDef)); decl_initializer_alloc(&type, &ad, VT_CONST, 2, 0, 0); break; case '(': next(); /* cast ? */ if (parse_btype(&type, &ad)) { type_decl(&type, &ad, &n, TYPE_ABSTRACT); skip(')');
/* check ISOC99 compound literal */ if (tok == '{') { /* data is allocated locally by default */ if (global_expr) r = VT_CONST; else r = VT_LOCAL; /* all except arrays are lvalues */ if (!(type.t & VT_ARRAY)) r |= lvalue_type(type.t); memset(&ad, 0, sizeof(AttributeDef)); decl_initializer_alloc(&type, &ad, r, 1, 0, 0); } else { unary(); gen_cast(&type); } } else if (tok == '{') { /* save all registers */ save_regs(0); /* statement expression : we do not accept break/continue inside as GCC does */ block(NULL, NULL, NULL, NULL, 0, 1); skip(')'); } else { gexpr(); skip(')'); } break; case '*': next(); unary(); indir(); break; case '&': next(); unary(); /* functions names must be treated as function pointers, except for unary '&' and sizeof. Since we consider that functions are not lvalues, we only have to handle it there and in function calls. */ /* arrays can also be used although they are not lvalues */ if ((vtop->type.t & VT_BTYPE) != VT_FUNC && !(vtop->type.t & VT_ARRAY)) test_lvalue(); mk_pointer(&vtop->type); gaddrof(); break; case '!': next(); unary(); if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST) vtop->c.i = !vtop->c.i; else if ((vtop->r & VT_VALMASK) == VT_CMP)
vtop->c.i = vtop->c.i ^ 1; else vseti(VT_JMP, gtst(1, 0)); break; case '~': next(); unary(); vpushi(-1); gen_op('^'); break; case '+': next(); /* in order to force cast, we add zero */ unary(); if ((vtop->type.t & VT_BTYPE) == VT_PTR) error("pointer not accepted for unary plus"); vpushi(0); gen_op('+'); break; case TOK_SIZEOF: case TOK_ALIGNOF1: case TOK_ALIGNOF2: t = tok; next(); if (tok == '(') { parse_expr_type(&type); } else { unary_type(&type); } size = type_size(&type, &align); if (t == TOK_SIZEOF) { if (size < 0) error("sizeof applied to an incomplete type"); vpushi(size); } else { vpushi(align); } break; case TOK_builtin_types_compatible_p: { CType type1, type2; next(); skip('('); parse_type(&type1); skip(','); parse_type(&type2); skip(')'); type1.t &= ~(VT_CONSTANT | VT_VOLATILE); type2.t &= ~(VT_CONSTANT | VT_VOLATILE); vpushi(is_compatible_types(&type1, &type2)); } break;
case TOK_builtin_constant_p: { int saved_nocode_wanted, res; next(); skip('('); saved_nocode_wanted = nocode_wanted; nocode_wanted = 1; gexpr(); res = (vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) == VT_CONST; vpop(); nocode_wanted = saved_nocode_wanted; skip(')'); vpushi(res); } break; case TOK_INC: case TOK_DEC: t = tok; next(); unary(); inc(0, t); break; case '-': next(); vpushi(0); unary(); gen_op('-'); break; case TOK_LAND: if (!gnu_ext) goto tok_identifier; next(); /* allow to take the address of a label */ if (tok < TOK_UIDENT) expect("label identifier"); s = label_find(tok); if (!s) { s = label_push(&global_label_stack, tok, LABEL_FORWARD); } else { if (s->r == LABEL_DECLARED) s->r = LABEL_FORWARD; } if (!s->type.t) { s->type.t = VT_VOID; mk_pointer(&s->type); s->type.t |= VT_STATIC; } vset(&s->type, VT_CONST | VT_SYM, 0); vtop->sym = s; next(); break; default: tok_identifier:
t = tok; next(); if (t < TOK_UIDENT) expect("identifier"); s = sym_find(t); if (!s) { if (tok != '(') error("'%s' undeclared", get_tok_str(t, NULL)); /* for simple function calls, we tolerate undeclared external reference to int() function */ if (tcc_state->warn_implicit_function_declaration) warning("implicit declaration of function '%s'", get_tok_str(t, NULL)); s = external_global_sym(t, &func_old_type, 0); } if ((s->type.t & (VT_STATIC | VT_INLINE | VT_BTYPE)) == (VT_STATIC | VT_INLINE | VT_FUNC)) { /* if referencing an inline function, then we generate a symbol to it if not already done. It will have the effect to generate code for it at the end of the compilation unit. Inline function as always generated in the text section. */ if (!s->c) put_extern_sym(s, text_section, 0, 0); r = VT_SYM | VT_CONST; } else { r = s->r; } vset(&s->type, r, s->c); /* if forward reference, we must point to s */ if (vtop->r & VT_SYM) { vtop->sym = s; vtop->c.ul = 0; } break; } /* post operations */ while (1) { if (tok == TOK_INC || tok == TOK_DEC) { inc(1, tok); next(); } else if (tok == '.' || tok == TOK_ARROW) { /* field */ if (tok == TOK_ARROW) indir(); test_lvalue(); gaddrof(); next(); /* expect pointer on structure */ if ((vtop->type.t & VT_BTYPE) != VT_STRUCT) expect("struct or union"); s = vtop->type.ref;
/* find field */ tok |= SYM_FIELD; while ((s = s->next) != NULL) { if (s->v == tok) break; } if (!s) error("field not found"); /* add field offset to pointer */ vtop->type = char_pointer_type; /* change type to 'char *' */ vpushi(s->c); gen_op('+'); /* change type to field type, and set to lvalue */ vtop->type = s->type; /* an array is never an lvalue */ if (!(vtop->type.t & VT_ARRAY)) { vtop->r |= lvalue_type(vtop->type.t); /* if bound checking, the referenced pointer must be checked */ if (do_bounds_check) vtop->r |= VT_MUSTBOUND; } next(); } else if (tok == '[') { next(); gexpr(); gen_op('+'); indir(); skip(']'); } else if (tok == '(') { SValue ret; Sym *sa; int nb_args; /* function call */ if ((vtop->type.t & VT_BTYPE) != VT_FUNC) { /* pointer test (no array accepted) */ if ((vtop->type.t & (VT_BTYPE | VT_ARRAY)) == VT_PTR) { vtop->type = *pointed_type(&vtop->type); if ((vtop->type.t & VT_BTYPE) != VT_FUNC) goto error_func; } else { error_func: expect("function pointer"); } } else { vtop->r &= ~VT_LVAL; /* no lvalue */ } /* get return type */ s = vtop->type.ref; next(); sa = s->next; /* first parameter */ nb_args = 0; /* compute first implicit argument if a structure is returned */
if ((s->type.t & VT_BTYPE) == VT_STRUCT) { /* get some space for the returned structure */ size = type_size(&s->type, &align); loc = (loc - size) & -align; ret.type = s->type; ret.r = VT_LOCAL | VT_LVAL; /* pass it as 'int' to avoid structure arg passing problems */ vseti(VT_LOCAL, loc); ret.c = vtop->c; nb_args++; } else { ret.type = s->type; ret.r2 = VT_CONST; /* return in register */ if (is_float(ret.type.t)) { ret.r = REG_FRET; } else { if ((ret.type.t & VT_BTYPE) == VT_LLONG) ret.r2 = REG_LRET; ret.r = REG_IRET; } ret.c.i = 0; } if (tok != ')') { for(;;) { expr_eq(); gfunc_param_typed(s, sa); nb_args++; if (sa) sa = sa->next; if (tok == ')') break; skip(','); } } if (sa) error("too few arguments to function"); skip(')'); if (!nocode_wanted) { gfunc_call(nb_args); } else { vtop -= (nb_args + 1); } /* return value */ vsetc(&ret.type, ret.r, &ret.c); vtop->r2 = ret.r2; } else { break; } } }
static void uneq(void) { int t; unary(); if (tok == '=' || (tok >= TOK_A_MOD && tok <= TOK_A_DIV) || tok == TOK_A_XOR || tok == TOK_A_OR || tok == TOK_A_SHL || tok == TOK_A_SAR) { test_lvalue(); t = tok; next(); if (t == '=') { expr_eq(); } else { vdup(); expr_eq(); gen_op(t & 0x7f); } vstore(); } } static void expr_prod(void) { int t; uneq(); while (tok == '*' || tok == '/' || tok == '%') { t = tok; next(); uneq(); gen_op(t); } } static void expr_sum(void) { int t; expr_prod(); while (tok == '+' || tok == '-') { t = tok; next(); expr_prod(); gen_op(t); } } static void expr_shift(void) { int t;
expr_sum(); while (tok == TOK_SHL || tok == TOK_SAR) { t = tok; next(); expr_sum(); gen_op(t); } } static void expr_cmp(void) { int t; expr_shift(); while ((tok >= TOK_ULE && tok <= TOK_GT) || tok == TOK_ULT || tok == TOK_UGE) { t = tok; next(); expr_shift(); gen_op(t); } } static void expr_cmpeq(void) { int t; expr_cmp(); while (tok == TOK_EQ || tok == TOK_NE) { t = tok; next(); expr_cmp(); gen_op(t); } } static void expr_and(void) { expr_cmpeq(); while (tok == '&') { next(); expr_cmpeq(); gen_op('&'); } } static void expr_xor(void) { expr_and(); while (tok == '^') { next(); expr_and(); gen_op('^');
} } static void expr_or(void) { expr_xor(); while (tok == '|') { next(); expr_xor(); gen_op('|'); } } /* XXX: fix this mess */ static void expr_land_const(void) { expr_or(); while (tok == TOK_LAND) { next(); expr_or(); gen_op(TOK_LAND); } } /* XXX: fix this mess */ static void expr_lor_const(void) { expr_land_const(); while (tok == TOK_LOR) { next(); expr_land_const(); gen_op(TOK_LOR); } } /* only used if non constant */ static void expr_land(void) { int t; expr_or(); if (tok == TOK_LAND) { t = 0; for(;;) { t = gtst(1, t); if (tok != TOK_LAND) { vseti(VT_JMPI, t); break; } next(); expr_or(); } }
} static void expr_lor(void) { int t; expr_land(); if (tok == TOK_LOR) { t = 0; for(;;) { t = gtst(0, t); if (tok != TOK_LOR) { vseti(VT_JMP, t); break; } next(); expr_land(); } } } /* XXX: better constant handling */ static void expr_eq(void) { int tt, u, r1, r2, rc, t1, t2, bt1, bt2; SValue sv; CType type, type1, type2; if (const_wanted) { int c1, c; expr_lor_const(); if (tok == '?') { c = vtop->c.i; vpop(); next(); if (tok == ':' && gnu_ext) { c1 = c; } else { gexpr(); c1 = vtop->c.i; vpop(); } skip(':'); expr_eq(); if (c) vtop->c.i = c1; } } else { expr_lor(); if (tok == '?') { next(); if (vtop != vstack) { /* needed to avoid having different registers saved in
each branch */ if (is_float(vtop->type.t)) rc = RC_FLOAT; else rc = RC_INT; gv(rc); save_regs(1); } if (tok == ':' && gnu_ext) { gv_dup(); tt = gtst(1, 0); } else { tt = gtst(1, 0); gexpr(); } type1 = vtop->type; sv = *vtop; /* save value to handle it later */ vtop--; /* no vpop so that FP stack is not flushed */ skip(':'); u = gjmp(0); gsym(tt); expr_eq(); type2 = vtop->type; t1 = type1.t; bt1 = t1 & VT_BTYPE; t2 = type2.t; bt2 = t2 & VT_BTYPE; /* cast operands to correct type according to ISOC rules */ if (is_float(bt1) || is_float(bt2)) { if (bt1 == VT_LDOUBLE || bt2 == VT_LDOUBLE) { type.t = VT_LDOUBLE; } else if (bt1 == VT_DOUBLE || bt2 == VT_DOUBLE) { type.t = VT_DOUBLE; } else { type.t = VT_FLOAT; } } else if (bt1 == VT_LLONG || bt2 == VT_LLONG) { /* cast to biggest op */ type.t = VT_LLONG; /* convert to unsigned if it does not fit in a long long */ if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED) || (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_LLONG | VT_UNSIGNED)) type.t |= VT_UNSIGNED; } else if (bt1 == VT_PTR || bt2 == VT_PTR) { /* XXX: test pointer compatibility */ type = type1; } else if (bt1 == VT_STRUCT || bt2 == VT_STRUCT) { /* XXX: test structure compatibility */ type = type1; } else if (bt1 == VT_VOID || bt2 == VT_VOID) { /* NOTE: as an extension, we accept void on only one side */ type.t = VT_VOID;
} else { /* integer operations */ type.t = VT_INT; /* convert to unsigned if it does not fit in an integer */ if ((t1 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED) || (t2 & (VT_BTYPE | VT_UNSIGNED)) == (VT_INT | VT_UNSIGNED)) type.t |= VT_UNSIGNED; } /* now we convert second operand */ gen_cast(&type); rc = RC_INT; if (is_float(type.t)) { rc = RC_FLOAT; } else if ((type.t & VT_BTYPE) == VT_LLONG) { /* for long longs, we use fixed registers to avoid having to handle a complicated move */ rc = RC_IRET; } r2 = gv(rc); /* this is horrible, but we must also convert first operand */ tt = gjmp(0); gsym(u); /* put again first value and cast it */ *vtop = sv; gen_cast(&type); r1 = gv(rc); move_reg(r2, r1); vtop->r = r2; gsym(tt); } } } static void gexpr(void) { while (1) { expr_eq(); if (tok != ',') break; vpop(); next(); } } /* parse an expression and return its type without any side effect. */ static void expr_type(CType *type) { int saved_nocode_wanted; saved_nocode_wanted = nocode_wanted;
nocode_wanted = 1; gexpr(); *type = vtop->type; vpop(); nocode_wanted = saved_nocode_wanted; } /* parse a unary expression and return its type without any side effect. */ static void unary_type(CType *type) { int a; a = nocode_wanted; nocode_wanted = 1; unary(); *type = vtop->type; vpop(); nocode_wanted = a; } /* parse a constant expression and return value in vtop. */ static void expr_const1(void) { int a; a = const_wanted; const_wanted = 1; expr_eq(); const_wanted = a; } /* parse an integer constant and return its value. */ static int expr_const(void) { int c; expr_const1(); if ((vtop->r & (VT_VALMASK | VT_LVAL | VT_SYM)) != VT_CONST) expect("constant expression"); c = vtop->c.i; vpop(); return c; } /* return the label token if current token is a label, otherwise return zero */ static int is_label(void) { int last_tok; /* fast test first */ if (tok < TOK_UIDENT) return 0; /* no need to save tokc because tok is an identifier */
last_tok = tok; next(); if (tok == ':') { next(); return last_tok; } else { unget_tok(last_tok); return 0; } } static void block(int *bsym, int *csym, int *case_sym, int *def_sym, int case_reg, int is_expr) { int a, b, c, d; Sym *s; /* generate line number info */ if (do_debug && (last_line_num != file->line_num || last_ind != ind)) { put_stabn(N_SLINE, 0, file->line_num, ind - func_ind); last_ind = ind; last_line_num = file->line_num; } if (is_expr) { /* default return value is (void) */ vpushi(0); vtop->type.t = VT_VOID; } if (tok == TOK_IF) { /* if test */ next(); skip('('); gexpr(); skip(')'); a = gtst(1, 0); block(bsym, csym, case_sym, def_sym, case_reg, 0); c = tok; if (c == TOK_ELSE) { next(); d = gjmp(0); gsym(a); block(bsym, csym, case_sym, def_sym, case_reg, 0); gsym(d); /* patch else jmp */ } else gsym(a); } else if (tok == TOK_WHILE) { next(); d = ind; skip('('); gexpr();
skip(')'); a = gtst(1, 0); b = 0; block(&a, &b, case_sym, def_sym, case_reg, 0); gjmp_addr(d); gsym(a); gsym_addr(b, d); } else if (tok == '{') { Sym *llabel; next(); /* record local declaration stack position */ s = local_stack; llabel = local_label_stack; /* handle local labels declarations */ if (tok == TOK_LABEL) { next(); for(;;) { if (tok < TOK_UIDENT) expect("label identifier"); label_push(&local_label_stack, tok, LABEL_DECLARED); next(); if (tok == ',') { next(); } else { skip(';'); break; } } } while (tok != '}') { decl(VT_LOCAL); if (tok != '}') { if (is_expr) vpop(); block(bsym, csym, case_sym, def_sym, case_reg, is_expr); } } /* pop locally defined labels */ label_pop(&local_label_stack, llabel); /* pop locally defined symbols */ sym_pop(&local_stack, s); next(); } else if (tok == TOK_RETURN) { next(); if (tok != ';') { gexpr(); gen_assign_cast(&func_vt); if ((func_vt.t & VT_BTYPE) == VT_STRUCT) { CType type; /* if returning structure, must copy it to implicit first pointer arg location */ type = func_vt;
mk_pointer(&type); vset(&type, VT_LOCAL | VT_LVAL, func_vc); indir(); vswap(); /* copy structure value to pointer */ vstore(); } else if (is_float(func_vt.t)) { gv(RC_FRET); } else { gv(RC_IRET); } vtop--; /* NOT vpop() because on x86 it would flush the fp stack */ } skip(';'); rsym = gjmp(rsym); /* jmp */ } else if (tok == TOK_BREAK) { /* compute jump */ if (!bsym) error("cannot break"); *bsym = gjmp(*bsym); next(); skip(';'); } else if (tok == TOK_CONTINUE) { /* compute jump */ if (!csym) error("cannot continue"); *csym = gjmp(*csym); next(); skip(';'); } else if (tok == TOK_FOR) { int e; next(); skip('('); if (tok != ';') { gexpr(); vpop(); } skip(';'); d = ind; c = ind; a = 0; b = 0; if (tok != ';') { gexpr(); a = gtst(1, 0); } skip(';'); if (tok != ')') { e = gjmp(0); c = ind; gexpr(); vpop(); gjmp_addr(d);
gsym(e); } skip(')'); block(&a, &b, case_sym, def_sym, case_reg, 0); gjmp_addr(c); gsym(a); gsym_addr(b, c); } else if (tok == TOK_DO) { next(); a = 0; b = 0; d = ind; block(&a, &b, case_sym, def_sym, case_reg, 0); skip(TOK_WHILE); skip('('); gsym(b); gexpr(); c = gtst(0, 0); gsym_addr(c, d); skip(')'); gsym(a); skip(';'); } else if (tok == TOK_SWITCH) { next(); skip('('); gexpr(); /* XXX: other types than integer */ case_reg = gv(RC_INT); vpop(); skip(')'); a = 0; b = gjmp(0); /* jump to first case */ c = 0; block(&a, csym, &b, &c, case_reg, 0); /* if no default, jmp after switch */ if (c == 0) c = ind; /* default label */ gsym_addr(b, c); /* break label */ gsym(a); } else if (tok == TOK_CASE) { int v1, v2; if (!case_sym) expect("switch"); next(); v1 = expr_const(); v2 = v1; if (gnu_ext && tok == TOK_DOTS) { next();
v2 = expr_const(); if (v2 < v1) warning("empty case range"); } /* since a case is like a label, we must skip it with a jmp */ b = gjmp(0); gsym(*case_sym); vseti(case_reg, 0); vpushi(v1); if (v1 == v2) { gen_op(TOK_EQ); *case_sym = gtst(1, 0); } else { gen_op(TOK_GE); *case_sym = gtst(1, 0); vseti(case_reg, 0); vpushi(v2); gen_op(TOK_LE); *case_sym = gtst(1, *case_sym); } gsym(b); skip(':'); is_expr = 0; goto block_after_label; } else if (tok == TOK_DEFAULT) { next(); skip(':'); if (!def_sym) expect("switch"); if (*def_sym) error("too many 'default'"); *def_sym = ind; is_expr = 0; goto block_after_label; } else if (tok == TOK_GOTO) { next(); if (tok == '*' && gnu_ext) { /* computed goto */ next(); gexpr(); if ((vtop->type.t & VT_BTYPE) != VT_PTR) expect("pointer"); ggoto(); } else if (tok >= TOK_UIDENT) { s = label_find(tok); /* put forward definition if needed */ if (!s) { s = label_push(&global_label_stack, tok, LABEL_FORWARD); } else { if (s->r == LABEL_DECLARED) s->r = LABEL_FORWARD;
} /* label already defined */ if (s->r & LABEL_FORWARD) s->next = (void *)gjmp((long)s->next); else gjmp_addr((long)s->next); next(); } else { expect("label identifier"); } skip(';'); } else if (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3) { asm_instr(); } else { b = is_label(); if (b) { /* label case */ s = label_find(b); if (s) { if (s->r == LABEL_DEFINED) error("duplicate label '%s'", get_tok_str(s->v, NULL)); gsym((long)s->next); s->r = LABEL_DEFINED; } else { s = label_push(&global_label_stack, b, LABEL_DEFINED); } s->next = (void *)ind; /* we accept this, but it is a mistake */ block_after_label: if (tok == '}') { warning("deprecated use of label at end of compound statement"); } else { if (is_expr) vpop(); block(bsym, csym, case_sym, def_sym, case_reg, is_expr); } } else { /* expression case */ if (tok != ';') { if (is_expr) { vpop(); gexpr(); } else { gexpr(); vpop(); } } skip(';'); } } } /* t is the array or struct type. c is the array or struct
address. cur_index/cur_field is the pointer to the current value. 'size_only' is true if only size info is needed (only used in arrays) */ static void decl_designator(CType *type, Section *sec, unsigned long c, int *cur_index, Sym **cur_field, int size_only) { Sym *s, *f; int notfirst, index, index_last, align, l, nb_elems, elem_size; CType type1; notfirst = 0; elem_size = 0; nb_elems = 1; if (gnu_ext && (l = is_label()) != 0) goto struct_field; while (tok == '[' || tok == '.') { if (tok == '[') { if (!(type->t & VT_ARRAY)) expect("array type"); s = type->ref; next(); index = expr_const(); if (index < 0 || (s->c >= 0 && index >= s->c)) expect("invalid index"); if (tok == TOK_DOTS && gnu_ext) { next(); index_last = expr_const(); if (index_last < 0 || (s->c >= 0 && index_last >= s->c) || index_last < index) expect("invalid index"); } else { index_last = index; } skip(']'); if (!notfirst) *cur_index = index_last; type = pointed_type(type); elem_size = type_size(type, &align); c += index * elem_size; /* NOTE: we only support ranges for last designator */ nb_elems = index_last - index + 1; if (nb_elems != 1) { notfirst = 1; break; } } else { next(); l = tok; next(); struct_field: if ((type->t & VT_BTYPE) != VT_STRUCT)
expect("struct/union type"); s = type->ref; l |= SYM_FIELD; f = s->next; while (f) { if (f->v == l) break; f = f->next; } if (!f) expect("field"); if (!notfirst) *cur_field = f; /* XXX: fix this mess by using explicit storage field */ type1 = f->type; type1.t |= (type->t & ~VT_TYPE); type = &type1; c += f->c; } notfirst = 1; } if (notfirst) { if (tok == '=') { next(); } else { if (!gnu_ext) expect("="); } } else { if (type->t & VT_ARRAY) { index = *cur_index; type = pointed_type(type); c += index * type_size(type, &align); } else { f = *cur_field; if (!f) error("too many field init"); /* XXX: fix this mess by using explicit storage field */ type1 = f->type; type1.t |= (type->t & ~VT_TYPE); type = &type1; c += f->c; } } decl_initializer(type, sec, c, 0, size_only); /* XXX: make it more general */ if (!size_only && nb_elems > 1) { unsigned long c_end; uint8_t *src, *dst; int i; if (!sec)
error("range init not supported yet for dynamic storage"); c_end = c + nb_elems * elem_size; if (c_end > sec->data_allocated) section_realloc(sec, c_end); src = sec->data + c; dst = src; for(i = 1; i < nb_elems; i++) { dst += elem_size; memcpy(dst, src, elem_size); } } } #define EXPR_VAL 0 #define EXPR_CONST 1 #define EXPR_ANY 2 /* store a value or an expression directly in global data or in local array */ static void init_putv(CType *type, Section *sec, unsigned long c, int v, int expr_type) { int saved_global_expr, bt, bit_pos, bit_size; void *ptr; unsigned long long bit_mask; CType dtype; switch(expr_type) { case EXPR_VAL: vpushi(v); break; case EXPR_CONST: /* compound literals must be allocated globally in this case */ saved_global_expr = global_expr; global_expr = 1; expr_const1(); global_expr = saved_global_expr; /* NOTE: symbols are accepted */ if ((vtop->r & (VT_VALMASK | VT_LVAL)) != VT_CONST) error("initializer element is not constant"); break; case EXPR_ANY: expr_eq(); break; } dtype = *type; dtype.t &= ~VT_CONSTANT; /* need to do that to avoid false warning */ if (sec) { /* XXX: not portable */ /* XXX: generate error if incorrect relocation */ gen_assign_cast(&dtype); bt = type->t & VT_BTYPE;
ptr = sec->data + c; /* XXX: make code faster ? */ if (!(type->t & VT_BITFIELD)) { bit_pos = 0; bit_size = 32; bit_mask = -1LL; } else { bit_pos = (vtop->type.t >> VT_STRUCT_SHIFT) & 0x3f; bit_size = (vtop->type.t >> (VT_STRUCT_SHIFT + 6)) & 0x3f; bit_mask = (1LL << bit_size) - 1; } if ((vtop->r & VT_SYM) && (bt == VT_BYTE || bt == VT_SHORT || bt == VT_DOUBLE || bt == VT_LDOUBLE || bt == VT_LLONG || (bt == VT_INT && bit_size != 32))) error("initializer element is not computable at load time"); switch(bt) { case VT_BYTE: *(char *)ptr |= (vtop->c.i & bit_mask) << bit_pos; break; case VT_SHORT: *(short *)ptr |= (vtop->c.i & bit_mask) << bit_pos; break; case VT_DOUBLE: *(double *)ptr = vtop->c.d; break; case VT_LDOUBLE: *(long double *)ptr = vtop->c.ld; break; case VT_LLONG: *(long long *)ptr |= (vtop->c.ll & bit_mask) << bit_pos; break; default: if (vtop->r & VT_SYM) { greloc(sec, vtop->sym, c, R_DATA_32); } *(int *)ptr |= (vtop->c.i & bit_mask) << bit_pos; break; } vtop--; } else { vset(&dtype, VT_LOCAL, c); vswap(); vstore(); vpop(); } } /* put zeros for variable based init */ static void init_putz(CType *t, Section *sec, unsigned long c, int size)
{ if (sec) { /* nothing to do because globals are already set to zero */ } else { vpush_global_sym(&func_old_type, TOK_memset); vseti(VT_LOCAL, c); vpushi(0); vpushi(size); gfunc_call(3); } } /* 't' contains the type and storage info. 'c' is the offset of the object in section 'sec'. If 'sec' is NULL, it means stack based allocation. 'first' is true if array '{' must be read (multi dimension implicit array init handling). 'size_only' is true if size only evaluation is wanted (only for arrays). */ static void decl_initializer(CType *type, Section *sec, unsigned long c, int first, int size_only) { int index, array_length, n, no_oblock, nb, parlevel, i; int size1, align1, expr_type; Sym *s, *f; CType *t1; if (type->t & VT_ARRAY) { s = type->ref; n = s->c; array_length = 0; t1 = pointed_type(type); size1 = type_size(t1, &align1); no_oblock = 1; if ((first && tok != TOK_LSTR && tok != TOK_STR) || tok == '{') { skip('{'); no_oblock = 0; } /* only parse strings here if correct type (otherwise: handle them as ((w)char *) expressions */ if ((tok == TOK_LSTR && (t1->t & VT_BTYPE) == VT_INT) || (tok == TOK_STR && (t1->t & VT_BTYPE) == VT_BYTE)) { while (tok == TOK_STR || tok == TOK_LSTR) { int cstr_len, ch; CString *cstr; cstr = tokc.cstr; /* compute maximum number of chars wanted */ if (tok == TOK_STR) cstr_len = cstr->size;
else cstr_len = cstr->size / sizeof(int); cstr_len--; nb = cstr_len; if (n >= 0 && nb > (n - array_length)) nb = n - array_length; if (!size_only) { if (cstr_len > nb) warning("initializer-string for array is too long"); /* in order to go faster for common case (char string in global variable, we handle it specifically */ if (sec && tok == TOK_STR && size1 == 1) { memcpy(sec->data + c + array_length, cstr->data, nb); } else { for(i=0;i
same time) */ if (index >= n && no_oblock) break; if (tok == '}') break; skip(','); } } if (!no_oblock) skip('}'); /* put zeros at the end */ if (!size_only && n >= 0 && array_length < n) { init_putz(t1, sec, c + array_length * size1, (n - array_length) * size1); } /* patch type size if needed */ if (n < 0) s->c = array_length; } else if ((type->t & VT_BTYPE) == VT_STRUCT && (sec || !first || tok == '{')) { int par_count; /* NOTE: the previous test is a specific case for automatic struct/union init */ /* XXX: union needs only one init */ /* XXX: this test is incorrect for local initializers beginning with ( without {. It would be much more difficult to do it correctly (ideally, the expression parser should be used in all cases) */ par_count = 0; if (tok == '(') { AttributeDef ad1; CType type1; next(); while (tok == '(') { par_count++; next(); } if (!parse_btype(&type1, &ad1)) expect("cast"); type_decl(&type1, &ad1, &n, TYPE_ABSTRACT); #if 0 if (!is_assignable_types(type, &type1)) error("invalid type for cast"); #endif skip(')'); } no_oblock = 1; if (first || tok == '{') { skip('{'); no_oblock = 0; }
s = type->ref; f = s->next; array_length = 0; index = 0; n = s->c; while (tok != '}') { decl_designator(type, sec, c, NULL, &f, size_only); index = f->c; if (!size_only && array_length < index) { init_putz(type, sec, c + array_length, index - array_length); } index = index + type_size(&f->type, &align1); if (index > array_length) array_length = index; f = f->next; if (no_oblock && f == NULL) break; if (tok == '}') break; skip(','); } /* put zeros at the end */ if (!size_only && array_length < n) { init_putz(type, sec, c + array_length, n - array_length); } if (!no_oblock) skip('}'); while (par_count) { skip(')'); par_count--; } } else if (tok == '{') { next(); decl_initializer(type, sec, c, first, size_only); skip('}'); } else if (size_only) { /* just skip expression */ parlevel = 0; while ((parlevel > 0 || (tok != '}' && tok != ',')) && tok != -1) { if (tok == '(') parlevel++; else if (tok == ')') parlevel--; next(); } } else { /* currently, we always use constant expression for globals (may change for scripting case) */ expr_type = EXPR_CONST; if (!sec)
expr_type = EXPR_ANY; init_putv(type, sec, c, 0, expr_type); } } /* parse an initializer for type 't' if 'has_init' is non zero, and allocate space in local or global data space ('r' is either VT_LOCAL or VT_CONST). If 'v' is non zero, then an associated variable 'v' of scope 'scope' is declared before initializers are parsed. If 'v' is zero, then a reference to the new object is put in the value stack. If 'has_init' is 2, a special parsing is done to handle string constants. */ static void decl_initializer_alloc(CType *type, AttributeDef *ad, int r, int has_init, int v, int scope) { int size, align, addr, data_offset; int level; ParseState saved_parse_state; TokenString init_str; Section *sec; size = type_size(type, &align); /* If unknown size, we must evaluate it before evaluating initializers because initializers can generate global data too (e.g. string pointers or ISOC99 compound literals). It also simplifies local initializers handling */ tok_str_new(&init_str); if (size < 0) { if (!has_init) error("unknown type size"); /* get all init string */ if (has_init == 2) { /* only get strings */ while (tok == TOK_STR || tok == TOK_LSTR) { tok_str_add_tok(&init_str); next(); } } else { level = 0; while (level > 0 || (tok != ',' && tok != ';')) { if (tok < 0) error("unexpected end of file in initializer"); tok_str_add_tok(&init_str); if (tok == '{') level++; else if (tok == '}') { if (level == 0) break; level--; } next();
} } tok_str_add(&init_str, -1); tok_str_add(&init_str, 0); /* compute size */ save_parse_state(&saved_parse_state); macro_ptr = init_str.str; next(); decl_initializer(type, NULL, 0, 1, 1); /* prepare second initializer parsing */ macro_ptr = init_str.str; next(); /* if still unknown size, error */ size = type_size(type, &align); if (size < 0) error("unknown type size"); } /* take into account specified alignment if bigger */ if (ad->aligned) { if (ad->aligned > align) align = ad->aligned; } else if (ad->packed) { align = 1; } if ((r & VT_VALMASK) == VT_LOCAL) { sec = NULL; if (do_bounds_check && (type->t & VT_ARRAY)) loc--; loc = (loc - size) & -align; addr = loc; /* handles bounds */ /* XXX: currently, since we do only one pass, we cannot track '&' operators, so we add only arrays */ if (do_bounds_check && (type->t & VT_ARRAY)) { unsigned long *bounds_ptr; /* add padding between regions */ loc--; /* then add local bound info */ bounds_ptr = section_ptr_add(lbounds_section, 2 * sizeof(unsigned long)); bounds_ptr[0] = addr; bounds_ptr[1] = size; } if (v) { /* local variable */ sym_push(v, type, r, addr); } else { /* push local reference */ vset(type, r, addr); } } else {
Sym *sym; sym = NULL; if (v && scope == VT_CONST) { /* see if the symbol was already defined */ sym = sym_find(v); if (sym) { if (!is_compatible_types(&sym->type, type)) error("incompatible types for redefinition of '%s'", get_tok_str(v, NULL)); if (sym->type.t & VT_EXTERN) { /* if the variable is extern, it was not allocated */ sym->type.t &= ~VT_EXTERN; /* set array size if it was ommited in extern declaration */ if ((sym->type.t & VT_ARRAY) && sym->type.ref->c < 0 && type->ref->c >= 0) sym->type.ref->c = type->ref->c; } else { /* we accept several definitions of the same global variable. this is tricky, because we must play with the SHN_COMMON type of the symbol */ /* XXX: should check if the variable was already initialized. It is incorrect to initialized it twice */ /* no init data, we won't add more to the symbol */ if (!has_init) goto no_alloc; } } } /* allocate symbol in corresponding section */ sec = ad->section; if (!sec) { if (has_init) sec = data_section; else if (tcc_state->nocommon) sec = bss_section; } if (sec) { data_offset = sec->data_offset; data_offset = (data_offset + align - 1) & -align; addr = data_offset; /* very important to increment global pointer at this time because initializers themselves can create new initializers */ data_offset += size; /* add padding if bound check */ if (do_bounds_check) data_offset++; sec->data_offset = data_offset; /* allocate section space to put the data */
if (sec->sh_type != SHT_NOBITS && data_offset > sec->data_allocated) section_realloc(sec, data_offset); /* align section if needed */ if (align > sec->sh_addralign) sec->sh_addralign = align; } else { addr = 0; /* avoid warning */ } if (v) { if (scope == VT_CONST) { if (!sym) goto do_def; } else { do_def: sym = sym_push(v, type, r | VT_SYM, 0); } /* update symbol definition */ if (sec) { put_extern_sym(sym, sec, addr, size); } else { Elf32_Sym *esym; /* put a common area */ put_extern_sym(sym, NULL, align, size); /* XXX: find a nicer way */ esym = &((Elf32_Sym *)symtab_section->data)[sym->c]; esym->st_shndx = SHN_COMMON; } } else { CValue cval; /* push global reference */ sym = get_sym_ref(type, sec, addr, size); cval.ul = 0; vsetc(type, VT_CONST | VT_SYM, &cval); vtop->sym = sym; } /* handles bounds now because the symbol must be defined before for the relocation */ if (do_bounds_check) { unsigned long *bounds_ptr; greloc(bounds_section, sym, bounds_section->data_offset, R_DATA_32); /* then add global bound info */ bounds_ptr = section_ptr_add(bounds_section, 2 * sizeof(long)); bounds_ptr[0] = 0; /* relocated */ bounds_ptr[1] = size; } } if (has_init) { decl_initializer(type, sec, addr, 1, 0);
/* restore parse state if needed */ if (init_str.str) { tok_str_free(init_str.str); restore_parse_state(&saved_parse_state); } } no_alloc: ; } void put_func_debug(Sym *sym) { char buf[512]; /* stabs info */ /* XXX: we put here a dummy type */ snprintf(buf, sizeof(buf), "%s:%c1", funcname, sym->type.t & VT_STATIC ? 'f' : 'F'); put_stabs_r(buf, N_FUN, 0, file->line_num, 0, cur_text_section, sym->c); last_ind = 0; last_line_num = 0; } /* parse an old style function declaration list */ /* XXX: check multiple parameter */ static void func_decl_list(Sym *func_sym) { AttributeDef ad; int v; Sym *s; CType btype, type; /* parse each declaration */ while (tok != '{' && tok != ';' && tok != ',' && tok != TOK_EOF) { if (!parse_btype(&btype, &ad)) expect("declaration list"); if (((btype.t & VT_BTYPE) == VT_ENUM || (btype.t & VT_BTYPE) == VT_STRUCT) && tok == ';') { /* we accept no variable after */ } else { for(;;) { type = btype; type_decl(&type, &ad, &v, TYPE_DIRECT); /* find parameter in function parameter list */ s = func_sym->next; while (s != NULL) { if ((s->v & ~SYM_FIELD) == v) goto found; s = s->next; } error("declaration for parameter '%s' but no such parameter", get_tok_str(v, NULL));
found: /* check that no storage specifier except 'register' was given */ if (type.t & VT_STORAGE) error("storage class specified for '%s'", get_tok_str(v, NULL)); convert_parameter_type(&type); /* we can add the type (NOTE: it could be local to the function) */ s->type = type; /* accept other parameters */ if (tok == ',') next(); else break; } } skip(';'); } } /* parse a function defined by symbol 'sym' and generate its code in 'cur_text_section' */ static void gen_function(Sym *sym) { ind = cur_text_section->data_offset; /* NOTE: we patch the symbol size later */ put_extern_sym(sym, cur_text_section, ind, 0); funcname = get_tok_str(sym->v, NULL); func_ind = ind; /* put debug symbol */ if (do_debug) put_func_debug(sym); /* push a dummy symbol to enable local sym storage */ sym_push2(&local_stack, SYM_FIELD, 0, 0); gfunc_prolog(&sym->type); rsym = 0; block(NULL, NULL, NULL, NULL, 0, 0); gsym(rsym); gfunc_epilog(); cur_text_section->data_offset = ind; label_pop(&global_label_stack, NULL); sym_pop(&local_stack, NULL); /* reset local stack */ /* end of function */ /* patch symbol size */ ((Elf32_Sym *)symtab_section->data)[sym->c].st_size = ind - func_ind; if (do_debug) { put_stabn(N_FUN, 0, 0, ind - func_ind); } funcname = ""; /* for safety */ func_vt.t = VT_VOID; /* for safety */ ind = 0; /* for safety */ } static void gen_inline_functions(void)
{ Sym *sym; CType *type; int *str, inline_generated; /* iterate while inline function are referenced */ for(;;) { inline_generated = 0; for(sym = global_stack; sym != NULL; sym = sym->prev) { type = &sym->type; if (((type->t & VT_BTYPE) == VT_FUNC) && (type->t & (VT_STATIC | VT_INLINE)) == (VT_STATIC | VT_INLINE) && sym->c != 0) { /* the function was used: generate its code and convert it to a normal function */ str = (int *)sym->r; sym->r = VT_SYM | VT_CONST; type->t &= ~VT_INLINE; macro_ptr = str; next(); cur_text_section = text_section; gen_function(sym); macro_ptr = NULL; /* fail safe */ tok_str_free(str); inline_generated = 1; } } if (!inline_generated) break; } /* free all remaining inline function tokens */ for(sym = global_stack; sym != NULL; sym = sym->prev) { type = &sym->type; if (((type->t & VT_BTYPE) == VT_FUNC) && (type->t & (VT_STATIC | VT_INLINE)) == (VT_STATIC | VT_INLINE)) { str = (int *)sym->r; tok_str_free(str); sym->r = 0; /* fail safe */ } } } /* 'l' is VT_LOCAL or VT_CONST to define default storage type */ static void decl(int l) { int v, has_init, r; CType type, btype; Sym *sym;
AttributeDef ad; while (1) { if (!parse_btype(&btype, &ad)) { /* skip redundant ';' */ /* XXX: find more elegant solution */ if (tok == ';') { next(); continue; } if (l == VT_CONST && (tok == TOK_ASM1 || tok == TOK_ASM2 || tok == TOK_ASM3)) { /* global asm block */ asm_global_instr(); continue; } /* special test for old K&R protos without explicit int type. Only accepted when defining global data */ if (l == VT_LOCAL || tok < TOK_DEFINE) break; btype.t = VT_INT; } if (((btype.t & VT_BTYPE) == VT_ENUM || (btype.t & VT_BTYPE) == VT_STRUCT) && tok == ';') { /* we accept no variable after */ next(); continue; } while (1) { /* iterate thru each declaration */ type = btype; type_decl(&type, &ad, &v, TYPE_DIRECT); #if 0 { char buf[500]; type_to_str(buf, sizeof(buf), t, get_tok_str(v, NULL)); printf("type = '%s'\n", buf); } #endif if ((type.t & VT_BTYPE) == VT_FUNC) { /* if old style function prototype, we accept a declaration list */ sym = type.ref; if (sym->c == FUNC_OLD) func_decl_list(sym); } if (tok == '{') { if (l == VT_LOCAL) error("cannot use local functions"); if (!(type.t & VT_FUNC)) expect("function definition");
/* reject abstract declarators in function definition */ sym = type.ref; while ((sym = sym->next) != NULL) if (!(sym->v & ~SYM_FIELD)) expect("identifier"); /* XXX: cannot do better now: convert extern line to static inline */ if ((type.t & (VT_EXTERN | VT_INLINE)) == (VT_EXTERN | VT_INLINE)) type.t = (type.t & ~VT_EXTERN) | VT_STATIC; sym = sym_find(v); if (sym) { if ((sym->type.t & VT_BTYPE) != VT_FUNC) goto func_error1; /* specific case: if not func_call defined, we put the one of the prototype */ /* XXX: should have default value */ if (sym->type.ref->r != FUNC_CDECL && type.ref->r == FUNC_CDECL) type.ref->r = sym->type.ref->r; if (!is_compatible_types(&sym->type, &type)) { func_error1: error("incompatible types for redefinition of '%s'", get_tok_str(v, NULL)); } /* if symbol is already defined, then put complete type */ sym->type = type; } else { /* put function symbol */ sym = global_identifier_push(v, type.t, 0); sym->type.ref = type.ref; } /* static inline functions are just recorded as a kind of macro. Their code will be emitted at the end of the compilation unit only if they are used */ if ((type.t & (VT_INLINE | VT_STATIC)) == (VT_INLINE | VT_STATIC)) { TokenString func_str; int block_level; tok_str_new(&func_str); block_level = 0; for(;;) { int t; if (tok == TOK_EOF) error("unexpected end of file"); tok_str_add_tok(&func_str); t = tok; next(); if (t == '{') { block_level++;
} else if (t == '}') { block_level--; if (block_level == 0) break; } } tok_str_add(&func_str, -1); tok_str_add(&func_str, 0); sym->r = (int)func_str.str; } else { /* compute text section */ cur_text_section = ad.section; if (!cur_text_section) cur_text_section = text_section; sym->r = VT_SYM | VT_CONST; gen_function(sym); #ifdef TCC_TARGET_PE if (ad.dllexport) { ((Elf32_Sym *)symtab_section->data)[sym->c].st_other |= 1; } #endif } break; } else { if (btype.t & VT_TYPEDEF) { /* save typedefed type */ /* XXX: test storage specifiers ? */ sym = sym_push(v, &type, 0, 0); sym->type.t |= VT_TYPEDEF; } else if ((type.t & VT_BTYPE) == VT_FUNC) { /* external function definition */ /* specific case for func_call attribute */ if (ad.func_call) type.ref->r = ad.func_call; external_sym(v, &type, 0); } else { /* not lvalue if array */ r = 0; if (!(type.t & VT_ARRAY)) r |= lvalue_type(type.t); has_init = (tok == '='); if ((btype.t & VT_EXTERN) || ((type.t & VT_ARRAY) && (type.t & VT_STATIC) && !has_init && l == VT_CONST && type.ref->c < 0)) { /* external variable */ /* NOTE: as GCC, uninitialized global static arrays of null size are considered as extern */ external_sym(v, &type, r); } else { if (type.t & VT_STATIC) r |= VT_CONST; else
r |= l; if (has_init) next(); decl_initializer_alloc(&type, &ad, r, has_init, v, l); } } if (tok != ',') { skip(';'); break; } next(); } } } } /* better than nothing, but needs extension to handle '-E' option correctly too */ static void preprocess_init(TCCState *s1) { s1->include_stack_ptr = s1->include_stack; /* XXX: move that before to avoid having to initialize file->ifdef_stack_ptr ? */ s1->ifdef_stack_ptr = s1->ifdef_stack; file->ifdef_stack_ptr = s1->ifdef_stack_ptr; /* XXX: not ANSI compliant: bound checking says error */ vtop = vstack - 1; s1->pack_stack[0] = 0; s1->pack_stack_ptr = s1->pack_stack; } /* compile the C file opened in 'file'. Return non zero if errors. */ static int tcc_compile(TCCState *s1) { Sym *define_start; char buf[512]; volatile int section_sym; #ifdef INC_DEBUG printf("%s: **** new file\n", file->filename); #endif preprocess_init(s1); funcname = ""; anon_sym = SYM_FIRST_ANOM; /* file info: full path + filename */ section_sym = 0; /* avoid warning */ if (do_debug) { section_sym = put_elf_sym(symtab_section, 0, 0, ELF32_ST_INFO(STB_LOCAL, STT_SECTION), 0,
text_section->sh_num, NULL); getcwd(buf, sizeof(buf)); pstrcat(buf, sizeof(buf), "/"); put_stabs_r(buf, N_SO, 0, 0, text_section->data_offset, text_section, section_sym); put_stabs_r(file->filename, N_SO, 0, 0, text_section->data_offset, text_section, section_sym); } /* an elf symbol of type STT_FILE must be put so that STB_LOCAL symbols can be safely used */ put_elf_sym(symtab_section, 0, 0, ELF32_ST_INFO(STB_LOCAL, STT_FILE), 0, SHN_ABS, file->filename); /* define some often used types */ int_type.t = VT_INT; char_pointer_type.t = VT_BYTE; mk_pointer(&char_pointer_type); func_old_type.t = VT_FUNC; func_old_type.ref = sym_push(SYM_FIELD, &int_type, FUNC_CDECL, FUNC_OLD); #if 0 /* define 'void *alloca(unsigned int)' builtin function */ { Sym *s1; p = anon_sym++; sym = sym_push(p, mk_pointer(VT_VOID), FUNC_CDECL, FUNC_NEW); s1 = sym_push(SYM_FIELD, VT_UNSIGNED | VT_INT, 0, 0); s1->next = NULL; sym->next = s1; sym_push(TOK_alloca, VT_FUNC | (p << VT_STRUCT_SHIFT), VT_CONST, 0); } #endif define_start = define_stack; if (setjmp(s1->error_jmp_buf) == 0) { s1->nb_errors = 0; s1->error_set_jmp_enabled = 1; ch = file->buf_ptr[0]; tok_flags = TOK_FLAG_BOL | TOK_FLAG_BOF; parse_flags = PARSE_FLAG_PREPROCESS | PARSE_FLAG_TOK_NUM; next(); decl(VT_CONST); if (tok != TOK_EOF) expect("declaration"); /* end of translation unit info */ if (do_debug) {
put_stabs_r(NULL, N_SO, 0, 0, text_section->data_offset, text_section, section_sym); } } s1->error_set_jmp_enabled = 0; /* reset define stack, but leave -Dsymbols (may be incorrect if they are undefined) */ free_defines(define_start); gen_inline_functions(); sym_pop(&global_stack, NULL); return s1->nb_errors != 0 ? -1 : 0; } #ifdef LIBTCC int tcc_compile_string(TCCState *s, const char *str) { BufferedFile bf1, *bf = &bf1; int ret, len; char *buf; /* init file structure */ bf->fd = -1; /* XXX: avoid copying */ len = strlen(str); buf = tcc_malloc(len + 1); if (!buf) return -1; memcpy(buf, str, len); buf[len] = CH_EOB; bf->buf_ptr = buf; bf->buf_end = buf + len; pstrcpy(bf->filename, sizeof(bf->filename), "<string>"); bf->line_num = 1; file = bf; ret = tcc_compile(s); tcc_free(buf); /* currently, no need to close */ return ret; } #endif /* define a preprocessor symbol. A value can also be provided with the '=' operator */ void tcc_define_symbol(TCCState *s1, const char *sym, const char *value) { BufferedFile bf1, *bf = &bf1;
pstrcpy(bf->buffer, IO_BUF_SIZE, sym); pstrcat(bf->buffer, IO_BUF_SIZE, " "); /* default value */ if (!value) value = "1"; pstrcat(bf->buffer, IO_BUF_SIZE, value); /* init file structure */ bf->fd = -1; bf->buf_ptr = bf->buffer; bf->buf_end = bf->buffer + strlen(bf->buffer); *bf->buf_end = CH_EOB; bf->filename[0] = '\0'; bf->line_num = 1; file = bf; s1->include_stack_ptr = s1->include_stack; /* parse with define parser */ ch = file->buf_ptr[0]; next_nomacro(); parse_define(); file = NULL; } /* undefine a preprocessor symbol */ void tcc_undefine_symbol(TCCState *s1, const char *sym) { TokenSym *ts; Sym *s; ts = tok_alloc(sym, strlen(sym)); s = define_find(ts->tok); /* undefine symbol by putting an invalid name */ if (s) define_undef(s); } #ifdef CONFIG_TCC_ASM #ifdef TCC_TARGET_I386 #include "i386-asm.c" #endif #include "tccasm.c" #else static void asm_instr(void) { error("inline asm() not supported"); } static void asm_global_instr(void) { error("inline asm() not supported"); }
#endif #include "tccelf.c" #ifdef TCC_TARGET_COFF #include "tcccoff.c" #endif #ifdef TCC_TARGET_PE #include "tccpe.c" #endif /* print the position in the source file of PC value 'pc' by reading the stabs debug information */ static void rt_printline(unsigned long wanted_pc) { Stab_Sym *sym, *sym_end; char func_name[128], last_func_name[128]; unsigned long func_addr, last_pc, pc; const char *incl_files[INCLUDE_STACK_SIZE]; int incl_index, len, last_line_num, i; const char *str, *p; fprintf(stderr, "0x%08lx:", wanted_pc); func_name[0] = '\0'; func_addr = 0; incl_index = 0; last_func_name[0] = '\0'; last_pc = 0xffffffff; last_line_num = 1; sym = (Stab_Sym *)stab_section->data + 1; sym_end = (Stab_Sym *)(stab_section->data + stab_section->data_offset); while (sym < sym_end) { switch(sym->n_type) { /* function start or end */ case N_FUN: if (sym->n_strx == 0) { /* we test if between last line and end of function */ pc = sym->n_value + func_addr; if (wanted_pc >= last_pc && wanted_pc < pc) goto found; func_name[0] = '\0'; func_addr = 0; } else { str = stabstr_section->data + sym->n_strx; p = strchr(str, ':'); if (!p) { pstrcpy(func_name, sizeof(func_name), str); } else { len = p - str; if (len > sizeof(func_name) - 1) len = sizeof(func_name) - 1;
memcpy(func_name, str, len); func_name[len] = '\0'; } func_addr = sym->n_value; } break; /* line number info */ case N_SLINE: pc = sym->n_value + func_addr; if (wanted_pc >= last_pc && wanted_pc < pc) goto found; last_pc = pc; last_line_num = sym->n_desc; /* XXX: slow! */ strcpy(last_func_name, func_name); break; /* include files */ case N_BINCL: str = stabstr_section->data + sym->n_strx; add_incl: if (incl_index < INCLUDE_STACK_SIZE) { incl_files[incl_index++] = str; } break; case N_EINCL: if (incl_index > 1) incl_index--; break; case N_SO: if (sym->n_strx == 0) { incl_index = 0; /* end of translation unit */ } else { str = stabstr_section->data + sym->n_strx; /* do not add path */ len = strlen(str); if (len > 0 && str[len - 1] != '/') goto add_incl; } break; } sym++; } /* second pass: we try symtab symbols (no line number info) */ incl_index = 0; { Elf32_Sym *sym, *sym_end; int type; sym_end = (Elf32_Sym *)(symtab_section->data + symtab_section->data_offset); for(sym = (Elf32_Sym *)symtab_section->data + 1; sym < sym_end; sym++) {
type = ELF32_ST_TYPE(sym->st_info); if (type == STT_FUNC) { if (wanted_pc >= sym->st_value && wanted_pc < sym->st_value + sym->st_size) { pstrcpy(last_func_name, sizeof(last_func_name), strtab_section->data + sym->st_name); goto found; } } } } /* did not find any info: */ fprintf(stderr, " ???\n"); return; found: if (last_func_name[0] != '\0') { fprintf(stderr, " %s()", last_func_name); } if (incl_index > 0) { fprintf(stderr, " (%s:%d", incl_files[incl_index - 1], last_line_num); for(i = incl_index - 2; i >= 0; i--) fprintf(stderr, ", included from %s", incl_files[i]); fprintf(stderr, ")"); } fprintf(stderr, "\n"); } #if !defined(WIN32) && !defined(CONFIG_TCCBOOT) #ifdef __i386__ /* fix for glibc 2.1 */ #ifndef REG_EIP #define REG_EIP EIP #define REG_EBP EBP #endif /* return the PC at frame level 'level'. Return non zero if not found */ static int rt_get_caller_pc(unsigned long *paddr, ucontext_t *uc, int level) { unsigned long fp; int i; if (level == 0) { #if defined(__FreeBSD__) *paddr = uc->uc_mcontext.mc_eip; #elif defined(__dietlibc__) *paddr = uc->uc_mcontext.eip; #else *paddr = uc->uc_mcontext.gregs[REG_EIP]; #endif
return 0; } else { #if defined(__FreeBSD__) fp = uc->uc_mcontext.mc_ebp; #elif defined(__dietlibc__) fp = uc->uc_mcontext.ebp; #else fp = uc->uc_mcontext.gregs[REG_EBP]; #endif for(i=1;i
/* signal handler for fatal errors */ static void sig_error(int signum, siginfo_t *siginf, void *puc) { ucontext_t *uc = puc; switch(signum) { case SIGFPE: switch(siginf->si_code) { case FPE_INTDIV: case FPE_FLTDIV: rt_error(uc, "division by zero"); break; default: rt_error(uc, "floating point exception"); break; } break; case SIGBUS: case SIGSEGV: if (rt_bound_error_msg && *rt_bound_error_msg) rt_error(uc, *rt_bound_error_msg); else rt_error(uc, "dereferencing invalid pointer"); break; case SIGILL: rt_error(uc, "illegal instruction"); break; case SIGABRT: rt_error(uc, "abort() called"); break; default: rt_error(uc, "caught signal %d", signum); break; } exit(255); } #endif /* do all relocations (needed before using tcc_get_symbol()) */ int tcc_relocate(TCCState *s1) { Section *s; int i; s1->nb_errors = 0; #ifdef TCC_TARGET_PE pe_add_runtime(s1); #else tcc_add_runtime(s1); #endif
relocate_common_syms(); tcc_add_linker_symbols(s1); build_got_entries(s1); /* compute relocation address : section are relocated in place. We also alloc the bss space */ for(i = 1; i < s1->nb_sections; i++) { s = s1->sections[i]; if (s->sh_flags & SHF_ALLOC) { if (s->sh_type == SHT_NOBITS) s->data = tcc_mallocz(s->data_offset); s->sh_addr = (unsigned long)s->data; } } relocate_syms(s1, 1); if (s1->nb_errors != 0) return -1; /* relocate each section */ for(i = 1; i < s1->nb_sections; i++) { s = s1->sections[i]; if (s->reloc) relocate_section(s1, s); } return 0; } /* launch the compiled program with the given arguments */ int tcc_run(TCCState *s1, int argc, char **argv) { int (*prog_main)(int, char **); if (tcc_relocate(s1) < 0) return -1; prog_main = tcc_get_symbol_err(s1, "main"); if (do_debug) { #if defined(WIN32) || defined(CONFIG_TCCBOOT) error("debug mode currently not available for Windows"); #else struct sigaction sigact; /* install TCC signal handlers to print debug info on fatal runtime errors */ sigact.sa_flags = SA_SIGINFO | SA_RESETHAND; sigact.sa_sigaction = sig_error; sigemptyset(&sigact.sa_mask); sigaction(SIGFPE, &sigact, NULL); sigaction(SIGILL, &sigact, NULL);
sigaction(SIGSEGV, &sigact, NULL); sigaction(SIGBUS, &sigact, NULL); sigaction(SIGABRT, &sigact, NULL); #endif } #ifdef CONFIG_TCC_BCHECK if (do_bounds_check) { void (*bound_init)(void); /* set error function */ rt_bound_error_msg = (void *)tcc_get_symbol_err(s1, "__bound_error_msg"); /* XXX: use .init section so that it also work in binary ? */ bound_init = (void *)tcc_get_symbol_err(s1, "__bound_init"); bound_init(); } #endif return (*prog_main)(argc, argv); } TCCState *tcc_new(void) { const char *p, *r; TCCState *s; TokenSym *ts; int i, c; s = tcc_mallocz(sizeof(TCCState)); if (!s) return NULL; tcc_state = s; s->output_type = TCC_OUTPUT_MEMORY; /* init isid table */ for(i=0;i<256;i++) isidnum_table[i] = isid(i) || isnum(i); /* add all tokens */ table_ident = NULL; memset(hash_ident, 0, TOK_HASH_SIZE * sizeof(TokenSym *)); tok_ident = TOK_IDENT; p = tcc_keywords; while (*p) { r = p; for(;;) { c = *r++; if (c == '\0') break; } ts = tok_alloc(p, r - p - 1);
p = r; } /* we add dummy defines for some special macros to speed up tests and to have working defined() */ define_push(TOK___LINE__, MACRO_OBJ, NULL, NULL); define_push(TOK___FILE__, MACRO_OBJ, NULL, NULL); define_push(TOK___DATE__, MACRO_OBJ, NULL, NULL); define_push(TOK___TIME__, MACRO_OBJ, NULL, NULL); /* standard defines */ tcc_define_symbol(s, "__STDC__", NULL); #if defined(TCC_TARGET_I386) tcc_define_symbol(s, "__i386__", NULL); #endif #if defined(TCC_TARGET_ARM) tcc_define_symbol(s, "__ARM_ARCH_4__", NULL); tcc_define_symbol(s, "__arm_elf__", NULL); tcc_define_symbol(s, "__arm_elf", NULL); tcc_define_symbol(s, "arm_elf", NULL); tcc_define_symbol(s, "__arm__", NULL); tcc_define_symbol(s, "__arm", NULL); tcc_define_symbol(s, "arm", NULL); tcc_define_symbol(s, "__APCS_32__", NULL); #endif #if defined(linux) tcc_define_symbol(s, "__linux__", NULL); tcc_define_symbol(s, "linux", NULL); #endif /* tiny C specific defines */ tcc_define_symbol(s, "__TINYC__", NULL); /* tiny C & gcc defines */ tcc_define_symbol(s, "__SIZE_TYPE__", "unsigned int"); tcc_define_symbol(s, "__PTRDIFF_TYPE__", "int"); tcc_define_symbol(s, "__WCHAR_TYPE__", "int"); /* default library paths */ #ifdef TCC_TARGET_PE { char buf[1024]; snprintf(buf, sizeof(buf), "%s/lib", tcc_lib_path); tcc_add_library_path(s, buf); } #else tcc_add_library_path(s, "/usr/local/lib"); tcc_add_library_path(s, "/usr/lib"); tcc_add_library_path(s, "/lib"); #endif /* no section zero */ dynarray_add((void ***)&s->sections, &s->nb_sections, NULL);
/* create standard sections */ text_section = new_section(s, ".text", SHT_PROGBITS, SHF_ALLOC | SHF_EXECINSTR); data_section = new_section(s, ".data", SHT_PROGBITS, SHF_ALLOC | SHF_WRITE); bss_section = new_section(s, ".bss", SHT_NOBITS, SHF_ALLOC | SHF_WRITE); /* symbols are always generated for linking stage */ symtab_section = new_symtab(s, ".symtab", SHT_SYMTAB, 0, ".strtab", ".hashtab", SHF_PRIVATE); strtab_section = symtab_section->link; /* private symbol table for dynamic symbols */ s->dynsymtab_section = new_symtab(s, ".dynsymtab", SHT_SYMTAB, SHF_PRIVATE, ".dynstrtab", ".dynhashtab", SHF_PRIVATE); s->alacarte_link = 1; #ifdef CHAR_IS_UNSIGNED s->char_is_unsigned = 1; #endif #if defined(TCC_TARGET_PE) && 0 /* XXX: currently the PE linker is not ready to support that */ s->leading_underscore = 1; #endif return s; } void tcc_delete(TCCState *s1) { int i, n; /* free -D defines */ free_defines(NULL); /* free tokens */ n = tok_ident - TOK_IDENT; for(i = 0; i < n; i++) tcc_free(table_ident[i]); tcc_free(table_ident); /* free all sections */ free_section(symtab_section->hash); free_section(s1->dynsymtab_section->hash); free_section(s1->dynsymtab_section->link); free_section(s1->dynsymtab_section); for(i = 1; i < s1->nb_sections; i++) free_section(s1->sections[i]); tcc_free(s1->sections); /* free loaded dlls array */
for(i = 0; i < s1->nb_loaded_dlls; i++) tcc_free(s1->loaded_dlls[i]); tcc_free(s1->loaded_dlls); /* library paths */ for(i = 0; i < s1->nb_library_paths; i++) tcc_free(s1->library_paths[i]); tcc_free(s1->library_paths); /* cached includes */ for(i = 0; i < s1->nb_cached_includes; i++) tcc_free(s1->cached_includes[i]); tcc_free(s1->cached_includes); for(i = 0; i < s1->nb_include_paths; i++) tcc_free(s1->include_paths[i]); tcc_free(s1->include_paths); for(i = 0; i < s1->nb_sysinclude_paths; i++) tcc_free(s1->sysinclude_paths[i]); tcc_free(s1->sysinclude_paths); tcc_free(s1); } int tcc_add_include_path(TCCState *s1, const char *pathname) { char *pathname1; pathname1 = tcc_strdup(pathname); dynarray_add((void ***)&s1->include_paths, &s1->nb_include_paths, pathname1); return 0; } int tcc_add_sysinclude_path(TCCState *s1, const char *pathname) { char *pathname1; pathname1 = tcc_strdup(pathname); dynarray_add((void ***)&s1->sysinclude_paths, &s1->nb_sysinclude_paths, pathname1); return 0; } static int tcc_add_file_internal(TCCState *s1, const char *filename, int flags) { const char *ext, *filename1; Elf32_Ehdr ehdr; int fd, ret; BufferedFile *saved_file; /* find source file type with extension */ filename1 = strrchr(filename, '/'); if (filename1)
filename1++; else filename1 = filename; ext = strrchr(filename1, '.'); if (ext) ext++; /* open the file */ saved_file = file; file = tcc_open(s1, filename); if (!file) { if (flags & AFF_PRINT_ERROR) { error_noabort("file '%s' not found", filename); } ret = -1; goto fail1; } if (!ext || !strcmp(ext, "c")) { /* C file assumed */ ret = tcc_compile(s1); } else #ifdef CONFIG_TCC_ASM if (!strcmp(ext, "S")) { /* preprocessed assembler */ ret = tcc_assemble(s1, 1); } else if (!strcmp(ext, "s")) { /* non preprocessed assembler */ ret = tcc_assemble(s1, 0); } else #endif #ifdef TCC_TARGET_PE if (!strcmp(ext, "def")) { ret = pe_load_def_file(s1, fdopen(file->fd, "rb")); } else #endif { fd = file->fd; /* assume executable format: auto guess file type */ ret = read(fd, &ehdr, sizeof(ehdr)); lseek(fd, 0, SEEK_SET); if (ret <= 0) { error_noabort("could not read header"); goto fail; } else if (ret != sizeof(ehdr)) { goto try_load_script; } if (ehdr.e_ident[0] == ELFMAG0 && ehdr.e_ident[1] == ELFMAG1 && ehdr.e_ident[2] == ELFMAG2 && ehdr.e_ident[3] == ELFMAG3) { file->line_num = 0; /* do not display line number if error */
if (ehdr.e_type == ET_REL) { ret = tcc_load_object_file(s1, fd, 0); } else if (ehdr.e_type == ET_DYN) { if (s1->output_type == TCC_OUTPUT_MEMORY) { #ifdef TCC_TARGET_PE ret = -1; #else void *h; h = dlopen(filename, RTLD_GLOBAL | RTLD_LAZY); if (h) ret = 0; else ret = -1; #endif } else { ret = tcc_load_dll(s1, fd, filename, (flags & AFF_REFERENCED_DLL) != 0); } } else { error_noabort("unrecognized ELF file"); goto fail; } } else if (memcmp((char *)&ehdr, ARMAG, 8) == 0) { file->line_num = 0; /* do not display line number if error */ ret = tcc_load_archive(s1, fd); } else #ifdef TCC_TARGET_COFF if (*(uint16_t *)(&ehdr) == COFF_C67_MAGIC) { ret = tcc_load_coff(s1, fd); } else #endif { /* as GNU ld, consider it is an ld script if not recognized */ try_load_script: ret = tcc_load_ldscript(s1); if (ret < 0) { error_noabort("unrecognized file type"); goto fail; } } } the_end: tcc_close(file); fail1: file = saved_file; return ret; fail: ret = -1; goto the_end; } int tcc_add_file(TCCState *s, const char *filename) {
return tcc_add_file_internal(s, filename, AFF_PRINT_ERROR); } int tcc_add_library_path(TCCState *s, const char *pathname) { char *pathname1; pathname1 = tcc_strdup(pathname); dynarray_add((void ***)&s->library_paths, &s->nb_library_paths, pathname1); return 0; } /* find and load a dll. Return non zero if not found */ /* XXX: add '-rpath' option support ? */ static int tcc_add_dll(TCCState *s, const char *filename, int flags) { char buf[1024]; int i; for(i = 0; i < s->nb_library_paths; i++) { snprintf(buf, sizeof(buf), "%s/%s", s->library_paths[i], filename); if (tcc_add_file_internal(s, buf, flags) == 0) return 0; } return -1; } /* the library name is the same as the argument of the '-l' option */ int tcc_add_library(TCCState *s, const char *libraryname) { char buf[1024]; int i; /* first we look for the dynamic library if not static linking */ if (!s->static_link) { #ifdef TCC_TARGET_PE snprintf(buf, sizeof(buf), "%s.def", libraryname); #else snprintf(buf, sizeof(buf), "lib%s.so", libraryname); #endif if (tcc_add_dll(s, buf, 0) == 0) return 0; } /* then we look for the static library */ for(i = 0; i < s->nb_library_paths; i++) { snprintf(buf, sizeof(buf), "%s/lib%s.a", s->library_paths[i], libraryname); if (tcc_add_file_internal(s, buf, 0) == 0) return 0; } return -1;
} int tcc_add_symbol(TCCState *s, const char *name, unsigned long val) { add_elf_sym(symtab_section, val, 0, ELF32_ST_INFO(STB_GLOBAL, STT_NOTYPE), 0, SHN_ABS, name); return 0; } int tcc_set_output_type(TCCState *s, int output_type) { s->output_type = output_type; if (!s->nostdinc) { char buf[1024]; /* default include paths */ /* XXX: reverse order needed if -isystem support */ #ifndef TCC_TARGET_PE tcc_add_sysinclude_path(s, "/usr/local/include"); tcc_add_sysinclude_path(s, "/usr/include"); #endif snprintf(buf, sizeof(buf), "%s/include", tcc_lib_path); tcc_add_sysinclude_path(s, buf); #ifdef TCC_TARGET_PE snprintf(buf, sizeof(buf), "%s/include/winapi", tcc_lib_path); tcc_add_sysinclude_path(s, buf); #endif } /* if bound checking, then add corresponding sections */ #ifdef CONFIG_TCC_BCHECK if (do_bounds_check) { /* define symbol */ tcc_define_symbol(s, "__BOUNDS_CHECKING_ON", NULL); /* create bounds sections */ bounds_section = new_section(s, ".bounds", SHT_PROGBITS, SHF_ALLOC); lbounds_section = new_section(s, ".lbounds", SHT_PROGBITS, SHF_ALLOC); } #endif if (s->char_is_unsigned) { tcc_define_symbol(s, "__CHAR_UNSIGNED__", NULL); } /* add debug sections */ if (do_debug) { /* stab symbols */ stab_section = new_section(s, ".stab", SHT_PROGBITS, 0); stab_section->sh_entsize = sizeof(Stab_Sym);
stabstr_section = new_section(s, ".stabstr", SHT_STRTAB, 0); put_elf_str(stabstr_section, ""); stab_section->link = stabstr_section; /* put first entry */ put_stabs("", 0, 0, 0, 0); } /* add libc crt1/crti objects */ #ifndef TCC_TARGET_PE if ((output_type == TCC_OUTPUT_EXE || output_type == TCC_OUTPUT_DLL) && !s->nostdlib) { if (output_type != TCC_OUTPUT_DLL) tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crt1.o"); tcc_add_file(s, CONFIG_TCC_CRT_PREFIX "/crti.o"); } #endif return 0; } #define WD_ALL 0x0001 /* warning is activated when using -Wall */ #define FD_INVERT 0x0002 /* invert value before storing */ typedef struct FlagDef { uint16_t offset; uint16_t flags; const char *name; } FlagDef; static const FlagDef warning_defs[] = { { offsetof(TCCState, warn_unsupported), 0, "unsupported" }, { offsetof(TCCState, warn_write_strings), 0, "write-strings" }, { offsetof(TCCState, warn_error), 0, "error" }, { offsetof(TCCState, warn_implicit_function_declaration), WD_ALL, "implicit-function-declaration" }, }; static int set_flag(TCCState *s, const FlagDef *flags, int nb_flags, const char *name, int value) { int i; const FlagDef *p; const char *r; r = name; if (r[0] == 'n' && r[1] == 'o' && r[2] == '-') { r += 3; value = !value; } for(i = 0, p = flags; i < nb_flags; i++, p++) { if (!strcmp(r, p->name)) goto found; } return -1;
found: if (p->flags & FD_INVERT) value = !value; *(int *)((uint8_t *)s + p->offset) = value; return 0; } /* set/reset a warning */ int tcc_set_warning(TCCState *s, const char *warning_name, int value) { int i; const FlagDef *p; if (!strcmp(warning_name, "all")) { for(i = 0, p = warning_defs; i < countof(warning_defs); i++, p++) { if (p->flags & WD_ALL) *(int *)((uint8_t *)s + p->offset) = 1; } return 0; } else { return set_flag(s, warning_defs, countof(warning_defs), warning_name, value); } } static const FlagDef flag_defs[] = { { offsetof(TCCState, char_is_unsigned), 0, "unsigned-char" }, { offsetof(TCCState, char_is_unsigned), FD_INVERT, "signed-char" }, { offsetof(TCCState, nocommon), FD_INVERT, "common" }, { offsetof(TCCState, leading_underscore), 0, "leading-underscore" }, }; /* set/reset a flag */ int tcc_set_flag(TCCState *s, const char *flag_name, int value) { return set_flag(s, flag_defs, countof(flag_defs), flag_name, value); } #if !defined(LIBTCC) /* extract the basename of a file */ static const char *tcc_basename(const char *name) { const char *p; p = strrchr(name, '/'); #ifdef WIN32 if (!p) p = strrchr(name, '\\'); #endif if (!p) p = name;
else p++; return p; } static int64_t getclock_us(void) { #ifdef WIN32 struct _timeb tb; _ftime(&tb); return (tb.time * 1000LL + tb.millitm) * 1000LL; #else struct timeval tv; gettimeofday(&tv, NULL); return tv.tv_sec * 1000000LL + tv.tv_usec; #endif } void help(void) { printf("tcc version " TCC_VERSION " - Tiny C Compiler - Copyright (C) 2001-2005 Fabrice Bellard\n" "usage: tcc [-v] [-c] [-o outfile] [-Bdir] [-bench] [-Idir] [-Dsym[=val]] [-Usym]\n" " [-Wwarn] [-g] [-b] [-bt N] [-Ldir] [-llib] [-shared] [-static]\n" " [infile1 infile2...] [-run infile args...]\n" "\n" "General options:\n" " -v display current version\n" " -c compile only - generate an object file\n" " -o outfile set output filename\n" " -Bdir set tcc internal library path\n" " -bench output compilation statistics\n" " -run run compiled source\n" " -fflag set or reset (with 'no-' prefix) 'flag' (see man page)\n" " -Wwarning set or reset (with 'no-' prefix) 'warning' (see man page)\n" " -w disable all warnings\n" "Preprocessor options:\n" " -Idir add include path 'dir'\n" " -Dsym[=val] define 'sym' with value 'val'\n" " -Usym undefine 'sym'\n" "Linker options:\n" " -Ldir add library path 'dir'\n" " -llib link with dynamic or static library 'lib'\n" " -shared generate a shared library\n" " -static static linking\n" " -rdynamic export all global symbols to dynamic linker\n" " -r relocatable output\n" "Debugger options:\n" " -g generate runtime debug info\n" #ifdef CONFIG_TCC_BCHECK " -b compile with built-in memory and bounds checker (implies -g)\n" #endif " -bt N show N callers in stack traces\n" );
} #define TCC_OPTION_HAS_ARG 0x0001 #define TCC_OPTION_NOSEP 0x0002 /* cannot have space before option and arg */ typedef struct TCCOption { const char *name; uint16_t index; uint16_t flags; } TCCOption; enum { TCC_OPTION_HELP, TCC_OPTION_I, TCC_OPTION_D, TCC_OPTION_U, TCC_OPTION_L, TCC_OPTION_B, TCC_OPTION_l, TCC_OPTION_bench, TCC_OPTION_bt, TCC_OPTION_b, TCC_OPTION_g, TCC_OPTION_c, TCC_OPTION_static, TCC_OPTION_shared, TCC_OPTION_o, TCC_OPTION_r, TCC_OPTION_Wl, TCC_OPTION_W, TCC_OPTION_O, TCC_OPTION_m, TCC_OPTION_f, TCC_OPTION_nostdinc, TCC_OPTION_nostdlib, TCC_OPTION_print_search_dirs, TCC_OPTION_rdynamic, TCC_OPTION_run, TCC_OPTION_v, TCC_OPTION_w, TCC_OPTION_pipe, }; static const TCCOption tcc_options[] = { { "h", TCC_OPTION_HELP, 0 }, { "?", TCC_OPTION_HELP, 0 }, { "I", TCC_OPTION_I, TCC_OPTION_HAS_ARG }, { "D", TCC_OPTION_D, TCC_OPTION_HAS_ARG }, { "U", TCC_OPTION_U, TCC_OPTION_HAS_ARG }, { "L", TCC_OPTION_L, TCC_OPTION_HAS_ARG }, { "B", TCC_OPTION_B, TCC_OPTION_HAS_ARG }, { "l", TCC_OPTION_l, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "bench", TCC_OPTION_bench, 0 },
{ "bt", TCC_OPTION_bt, TCC_OPTION_HAS_ARG }, #ifdef CONFIG_TCC_BCHECK { "b", TCC_OPTION_b, 0 }, #endif { "g", TCC_OPTION_g, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "c", TCC_OPTION_c, 0 }, { "static", TCC_OPTION_static, 0 }, { "shared", TCC_OPTION_shared, 0 }, { "o", TCC_OPTION_o, TCC_OPTION_HAS_ARG }, { "run", TCC_OPTION_run, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "rdynamic", TCC_OPTION_rdynamic, 0 }, { "r", TCC_OPTION_r, 0 }, { "Wl,", TCC_OPTION_Wl, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "W", TCC_OPTION_W, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "O", TCC_OPTION_O, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "m", TCC_OPTION_m, TCC_OPTION_HAS_ARG }, { "f", TCC_OPTION_f, TCC_OPTION_HAS_ARG | TCC_OPTION_NOSEP }, { "nostdinc", TCC_OPTION_nostdinc, 0 }, { "nostdlib", TCC_OPTION_nostdlib, 0 }, { "print-search-dirs", TCC_OPTION_print_search_dirs, 0 }, { "v", TCC_OPTION_v, 0 }, { "w", TCC_OPTION_w, 0 }, { "pipe", TCC_OPTION_pipe, 0}, { NULL }, }; /* convert 'str' into an array of space separated strings */ static int expand_args(char ***pargv, const char *str) { const char *s1; char **argv, *arg; int argc, len; argc = 0; argv = NULL; for(;;) { while (is_space(*str)) str++; if (*str == '\0') break; s1 = str; while (*str != '\0' && !is_space(*str)) str++; len = str - s1; arg = tcc_malloc(len + 1); memcpy(arg, s1, len); arg[len] = '\0'; dynarray_add((void ***)&argv, &argc, arg); } *pargv = argv; return argc; }
static char **files; static int nb_files, nb_libraries; static int multiple_files; static int print_search_dirs; static int output_type; static int reloc_output; static const char *outfile; int parse_args(TCCState *s, int argc, char **argv) { int optind; const TCCOption *popt; const char *optarg, *p1, *r1; char *r; optind = 0; while (1) { if (optind >= argc) { if (nb_files == 0 && !print_search_dirs) goto show_help; else break; } r = argv[optind++]; if (r[0] != '-') { /* add a new file */ dynarray_add((void ***)&files, &nb_files, r); if (!multiple_files) { optind--; /* argv[0] will be this file */ break; } } else { /* find option in table (match only the first chars */ popt = tcc_options; for(;;) { p1 = popt->name; if (p1 == NULL) error("invalid option -- '%s'", r); r1 = r + 1; for(;;) { if (*p1 == '\0') goto option_found; if (*r1 != *p1) break; p1++; r1++; } popt++; } option_found: if (popt->flags & TCC_OPTION_HAS_ARG) { if (*r1 != '\0' || (popt->flags & TCC_OPTION_NOSEP)) {
optarg = r1; } else { if (optind >= argc) error("argument to '%s' is missing", r); optarg = argv[optind++]; } } else { if (*r1 != '\0') goto show_help; optarg = NULL; } switch(popt->index) { case TCC_OPTION_HELP: show_help: help(); exit(1); case TCC_OPTION_I: if (tcc_add_include_path(s, optarg) < 0) error("too many include paths"); break; case TCC_OPTION_D: { char *sym, *value; sym = (char *)optarg; value = strchr(sym, '='); if (value) { *value = '\0'; value++; } tcc_define_symbol(s, sym, value); } break; case TCC_OPTION_U: tcc_undefine_symbol(s, optarg); break; case TCC_OPTION_L: tcc_add_library_path(s, optarg); break; case TCC_OPTION_B: /* set tcc utilities path (mainly for tcc development) */ tcc_lib_path = optarg; break; case TCC_OPTION_l: dynarray_add((void ***)&files, &nb_files, r); nb_libraries++; break; case TCC_OPTION_bench: do_bench = 1; break; case TCC_OPTION_bt: num_callers = atoi(optarg); break;
#ifdef CONFIG_TCC_BCHECK case TCC_OPTION_b: do_bounds_check = 1; do_debug = 1; break; #endif case TCC_OPTION_g: do_debug = 1; break; case TCC_OPTION_c: multiple_files = 1; output_type = TCC_OUTPUT_OBJ; break; case TCC_OPTION_static: s->static_link = 1; break; case TCC_OPTION_shared: output_type = TCC_OUTPUT_DLL; break; case TCC_OPTION_o: multiple_files = 1; outfile = optarg; break; case TCC_OPTION_r: /* generate a .o merging several output files */ reloc_output = 1; output_type = TCC_OUTPUT_OBJ; break; case TCC_OPTION_nostdinc: s->nostdinc = 1; break; case TCC_OPTION_nostdlib: s->nostdlib = 1; break; case TCC_OPTION_print_search_dirs: print_search_dirs = 1; break; case TCC_OPTION_run: { int argc1; char **argv1; argc1 = expand_args(&argv1, optarg); if (argc1 > 0) { parse_args(s, argc1, argv1); } multiple_files = 0; output_type = TCC_OUTPUT_MEMORY; } break; case TCC_OPTION_v: printf("tcc version %s\n", TCC_VERSION); exit(0); case TCC_OPTION_f:
if (tcc_set_flag(s, optarg, 1) < 0 && s->warn_unsupported) goto unsupported_option; break; case TCC_OPTION_W: if (tcc_set_warning(s, optarg, 1) < 0 && s->warn_unsupported) goto unsupported_option; break; case TCC_OPTION_w: s->warn_none = 1; break; case TCC_OPTION_rdynamic: s->rdynamic = 1; break; case TCC_OPTION_Wl: { const char *p; if (strstart(optarg, "-Ttext,", &p)) { s->text_addr = strtoul(p, NULL, 16); s->has_text_addr = 1; } else if (strstart(optarg, "--oformat,", &p)) { if (strstart(p, "elf32-", NULL)) { s->output_format = TCC_OUTPUT_FORMAT_ELF; } else if (!strcmp(p, "binary")) { s->output_format = TCC_OUTPUT_FORMAT_BINARY; } else #ifdef TCC_TARGET_COFF if (!strcmp(p, "coff")) { s->output_format = TCC_OUTPUT_FORMAT_COFF; } else #endif { error("target %s not found", p); } } else { error("unsupported linker option '%s'", optarg); } } break; default: if (s->warn_unsupported) { unsupported_option: warning("unsupported option '%s'", r); } break; } } } return optind; } int main(int argc, char **argv) {
int i; TCCState *s; int nb_objfiles, ret, optind; char objfilename[1024]; int64_t start_time = 0; #ifdef WIN32 /* on win32, we suppose the lib and includes are at the location of 'tcc.exe' */ { static char path[1024]; char *p, *d; GetModuleFileNameA(NULL, path, sizeof path); p = d = strlwr(path); while (*d) { if (*d == '\\') *d = '/', p = d; ++d; } *p = '\0'; tcc_lib_path = path; } #endif s = tcc_new(); output_type = TCC_OUTPUT_EXE; outfile = NULL; multiple_files = 1; files = NULL; nb_files = 0; nb_libraries = 0; reloc_output = 0; print_search_dirs = 0; optind = parse_args(s, argc - 1, argv + 1) + 1; if (print_search_dirs) { /* enough for Linux kernel */ printf("install: %s/\n", tcc_lib_path); return 0; } nb_objfiles = nb_files - nb_libraries; /* if outfile provided without other options, we output an executable */ if (outfile && output_type == TCC_OUTPUT_MEMORY) output_type = TCC_OUTPUT_EXE; /* check -c consistency : only single file handled. XXX: checks file type */ if (output_type == TCC_OUTPUT_OBJ && !reloc_output) { /* accepts only a single input file */
if (nb_objfiles != 1) error("cannot specify multiple files with -c"); if (nb_libraries != 0) error("cannot specify libraries with -c"); } if (output_type != TCC_OUTPUT_MEMORY) { if (!outfile) { /* compute default outfile name */ pstrcpy(objfilename, sizeof(objfilename) - 1, /* strip path */ tcc_basename(files[0])); #ifdef TCC_TARGET_PE pe_guess_outfile(objfilename, output_type); #else if (output_type == TCC_OUTPUT_OBJ && !reloc_output) { char *ext = strrchr(objfilename, '.'); if (!ext) goto default_outfile; /* add .o extension */ strcpy(ext + 1, "o"); } else { default_outfile: pstrcpy(objfilename, sizeof(objfilename), "a.out"); } #endif outfile = objfilename; } } if (do_bench) { start_time = getclock_us(); } tcc_set_output_type(s, output_type); /* compile or add each files or library */ for(i = 0;i < nb_files; i++) { const char *filename; filename = files[i]; if (filename[0] == '-') { if (tcc_add_library(s, filename + 2) < 0) error("cannot find %s", filename); } else { if (tcc_add_file(s, filename) < 0) { ret = 1; goto the_end; } } } /* free all files */
tcc_free(files); if (do_bench) { double total_time; total_time = (double)(getclock_us() - start_time) / 1000000.0; if (total_time < 0.001) total_time = 0.001; if (total_bytes < 1) total_bytes = 1; printf("%d idents, %d lines, %d bytes, %0.3f s, %d lines/s, %0.1f MB/s\n", tok_ident - TOK_IDENT, total_lines, total_bytes, total_time, (int)(total_lines / total_time), total_bytes / total_time / 1000000.0); } if (s->output_type == TCC_OUTPUT_MEMORY) { ret = tcc_run(s, argc - optind, argv + optind); } else #ifdef TCC_TARGET_PE if (s->output_type != TCC_OUTPUT_OBJ) { ret = tcc_output_pe(s, outfile); } else #endif { tcc_output_file(s, outfile); ret = 0; } the_end: /* XXX: cannot do it with bound checking because of the malloc hooks */ if (!do_bounds_check) tcc_delete(s); #ifdef MEM_DEBUG if (do_bench) { printf("memory: %d bytes, max = %d bytes\n", mem_cur_size, mem_max_size); } #endif return ret; } #endif
Pascal programozás a Borland Delphi unit Investicija; interface uses Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms, Dialogs, StdCtrls, ExtCtrls, Math, Buttons, ComCtrls; type
TForm1 = class(TForm) Memo1: TMemo; BitBtn1: TBitBtn; ListBox1: TListBox; TrackBar1: TTrackBar; Lab1: TLabeledEdit; Lab2: TLabeledEdit; Lab3: TLabeledEdit; Lab4: TLabeledEdit; Lab5: TLabeledEdit; Lab6: TLabeledEdit; UpDown1: TUpDown; UpDown2: TUpDown; procedure BitBtn1Enter(Sender: TObject); procedure FormActivate(Sender: TObject); procedure ListBox1Click(Sender: TObject); procedure Lab1SubLabelClick(Sender: TObject); procedure Lab2SubLabelClick(Sender: TObject); procedure Lab3SubLabelClick(Sender: TObject); procedure Lab4SubLabelClick(Sender: TObject); procedure Lab5SubLabelClick(Sender: TObject); procedure Lab6SubLabelClick(Sender: TObject); procedure UpDown1Click(Sender: TObject; Button: TUDBtnType); procedure UpDown2Click(Sender: TObject; Button: TUDBtnType); private { Private declarations } public { Public declarations } end; var Form1: TForm1; implementation {$R *.dfm} procedure TForm1.BitBtn1Enter(Sender: TObject); var Za: Array[0..7] of Real; Mi: Array[0..2] of Integer; B : String; begin if ListBox1.ItemIndex = 0 then begin Za[0] := StrToFloat(Lab1.Text); Za[4] := 25.937 * Exp(-0.1646 * Za[0])/100; end; if ListBox1.ItemIndex = 1 then begin Za[0] := StrToFloat(Lab1.Text); Za[4] := 22 * Power(Za[0],-0.6435)/100; end; if ListBox1.ItemIndex = 2 then begin Za[0] := StrToFloat(Lab1.Text);
Za[1] := StrToFloat(Lab2.Text); Za[4] := Za[0]+Za[1]+Za[0]*Za[1]; end; if ListBox1.ItemIndex = 3 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Power(1+(Za[0]/Za[1]),Za[1])-1; end; if ListBox1.ItemIndex = 4 then begin Za[0] := StrToFloat(Lab1.Text);{k} Za[1] := StrToFloat(Lab2.Text); {p} Za[2] := StrToFloat(Lab3.Text); {q} Za[4] := Power(1+(Za[0]/(Za[1]*Za[2])),Za[1])-1; end; if ListBox1.ItemIndex = 5 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Exp(Za[0]/Za[1])-1; {kontinualni obracun} end; if ListBox1.ItemIndex = 6 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Power(1+Za[0],-Za[1]); {buduce na sadasnje} end; if ListBox1.ItemIndex = 7 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Power(1+Za[0],Za[1]); {sadasnje na buduce} end; if ListBox1.ItemIndex = 8 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-1; Za[2] := Za[0] * Power(1+Za[0],Za[1]); Za[4] := Za[3]/Za[2]; end; if ListBox1.ItemIndex = 9 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-1; Za[2] := Za[0] * Power(1+Za[0],Za[1]); Za[4] := Za[2]/Za[3]; end; if ListBox1.ItemIndex = 10 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1]) - 1; Za[4] := Za[3]/Za[0]; end; if ListBox1.ItemIndex = 11 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1]) - 1;
Za[4] := Za[0]/Za[3]; end; if ListBox1.ItemIndex = 12 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := 2 + (Za[0]*Za[1]); Za[4] := (2*Za[1])/Za[3]; {uprosceni} end; if ListBox1.ItemIndex = 13 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := 2 + (Za[0]*Za[1]); Za[4] := Za[3]/(2*Za[1]); end; if ListBox1.ItemIndex = 14 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-Za[0]*Za[1]-1; Za[2] := Power(Za[0],2)*Power(1+Za[0],Za[1]); Za[4] := Za[3]/Za[2]; end; if ListBox1.ItemIndex = 15 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-Za[0]*Za[1]-1; Za[2] := Power(Za[0],2)*Power(1+Za[0],Za[1]); Za[4] := Za[2]/Za[3]; end; if ListBox1.ItemIndex = 16 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-Za[0]*Za[1]-1; Za[2] := Power(Za[0],2); Za[4] := Za[3]/Za[2]; end; if ListBox1.ItemIndex = 17 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-Za[0]*Za[1]-1; Za[2] := Power(Za[0],2); Za[4] := Za[2]/Za[3]; end; if ListBox1.ItemIndex = 18 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-Za[0]*Za[1]-1; Za[2] := Za[0] * Power(1+Za[0],Za[1]) - Za[0]; Za[4] := Za[3]/Za[2]; end; if ListBox1.ItemIndex = 19 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(1+Za[0],Za[1])-Za[0]*Za[1]-1;
Za[2] := Za[0] * Power(1+Za[0],Za[1]) - Za[0]; Za[4] := Za[2]/Za[3]; end; if ListBox1.ItemIndex = 20 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := (Za[0]/Za[1])*100; {aproksimatni} end; if ListBox1.ItemIndex = 21 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := StrToFloat(Lab3.Text); Za[2] := 1-Power(1+Za[1],Za[3])*Power(1+Za[0],-Za[3]); Za[4] := Za[2]/(Za[0]-Za[1]); end; if ListBox1.ItemIndex = 22 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := StrToFloat(Lab3.Text); Za[2] := 1-Power(1+Za[1],Za[3])*Power(1+Za[0],-Za[3]); Za[4] := (Za[0]-Za[1])/Za[2]; end; if ListBox1.ItemIndex = 23 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := StrToFloat(Lab3.Text); Za[2] := Power(1+Za[0],Za[3])-Power(1+Za[1],Za[3]); Za[4] := Za[2]/(Za[0]-Za[1]); end; if ListBox1.ItemIndex = 24 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := StrToFloat(Lab3.Text); Za[2] := Power(1+Za[0],Za[3])-Power(1+Za[1],Za[3]); Za[4] := (Za[0]-Za[1])/Za[2]; end; if ListBox1.ItemIndex = 25 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := StrToFloat(Lab3.Text); Za[4] := (Power(1+Za[1],Za[3])/Power(1+Za[0],Za[3]))*(1/(1+Za[1])); {modifikovani} end; {A na S} if ListBox1.ItemIndex = 26 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[3] := Power(Za[0]/Za[1],2); Za[2] := Power((Za[0]-1)/Za[1],2); Za[4] := Za[3]-Za[2]; end; if ListBox1.ItemIndex = 27 then begin Za[0] := StrToFloat(Lab1.Text); {n} Za[1] := StrToFloat(Lab2.Text); {k} Za[3] := Za[0] - Za[1] + 1;
Za[2] := (Za[0]*(Za[0]+1))/2; Za[4] := Za[3]/Za[2]; end; if ListBox1.ItemIndex = 28 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Power(Za[1],Za[0]); end; if ListBox1.ItemIndex = 29 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Za[0] * Za[1]; end; if ListBox1.ItemIndex = 30 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Za[0] / Za[1]; end; if ListBox1.ItemIndex = 31 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Za[0] + Za[1]; end; if ListBox1.ItemIndex = 32 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Za[0] - Za[1]; end; if ListBox1.ItemIndex = 33 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Mi[0] := StrToInt(Lab3.Text); Mi[1] := StrToInt(Lab4.Text); Za[4] := DoubleDecliningBalance(Za[0],Za[1],Mi[0],Mi[1]); end; if ListBox1.ItemIndex = 34 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Mi[0] := StrToInt(Lab4.Text); Mi[1] := StrToInt(Lab5.Text); if Mi[1] = 0 then Za[4] := FutureValue(Za[0],Mi[0],Za[1],Za[2],ptStartOfPeriod) else Za[4] := FutureValue(Za[0],Mi[0],Za[1],Za[2],ptEndOfPeriod); end; if ListBox1.ItemIndex = 35 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Mi[0] := StrToInt(Lab4.Text); Mi[1] := StrToInt(Lab5.Text); Mi[2] := StrToInt(Lab6.Text);
if Mi[2] = 0 then Za[4] := InterestPayment(Za[0],Mi[0],Mi[1],Za[1],Za[2],ptStartOfPeriod) else Za[4] := InterestPayment(Za[0],Mi[0],Mi[1],Za[1],Za[2],ptEndOfPeriod); end; if ListBox1.ItemIndex = 36 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Mi[0] := StrToInt(Lab4.Text); Mi[1] := StrToInt(Lab5.Text); if Mi[1] = 0 then Za[4] := InterestRate(Mi[0],Za[0],Za[1],Za[2],ptStartOfPeriod) else Za[4] := InterestRate(Mi[0],Za[0],Za[1],Za[2],ptEndOfPeriod); end; {Broj Perioda} if ListBox1.ItemIndex = 37 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Za[3] := StrToFloat(Lab4.Text); Mi[0] := StrToInt(Lab5.Text); if Mi[0] = 0 then Za[4] := NumberOfPeriods(Za[0],Za[1],Za[2],Za[3],ptStartOfPeriod) else Za[4] := NumberOfPeriods(Za[0],Za[1],Za[2],ZA[3],ptEndOfPeriod); end; if ListBox1.ItemIndex = 38 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Mi[0] := StrToInt(Lab4.Text); Mi[1] := StrToInt(Lab5.Text); if Mi[1] = 0 then Za[4] := Payment(Za[0],Mi[0],Za[1],Za[2],ptStartOfPeriod) else {Isplata} Za[4] := Payment(Za[0],Mi[0],Za[1],Za[2],ptEndOfPeriod); end; if ListBox1.ItemIndex = 39 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Mi[0] := StrToInt(Lab4.Text); Mi[1] := StrToInt(Lab5.Text); Mi[2] := StrToInt(Lab6.Text); if Mi[2] = 0 then Za[4] := PeriodPayment(Za[0],Mi[0],Mi[1],Za[1],Za[2],ptStartOfPeriod) else {Isplata za period} Za[4] := PeriodPayment(Za[0],Mi[0],Mi[1],Za[1],Za[2],ptEndOfPeriod); end; if ListBox1.ItemIndex = 40 then begin Za[0] := StrToFloat(Lab1.Text);
Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Mi[0] := StrToInt(Lab4.Text); Mi[1] := StrToInt(Lab5.Text); if Mi[1] = 0 then Za[4] := PresentValue(Za[0],Mi[0],Za[1],Za[2],ptStartOfPeriod) else {Sadasnja vrednost} Za[4] := PresentValue(Za[0],Mi[0],Za[1],Za[2],ptEndOfPeriod); end; if ListBox1.ItemIndex = 41 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Mi[0] := StrToInt(Lab3.Text); Mi[1] := StrToInt(Lab4.Text); Za[4] := SYDDepreciation(Za[0],Za[1],Mi[0],Mi[1]); end; {amortizacija sid} if ListBox1.ItemIndex = 42 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := RandG(Za[0],Za[1]); end; if ListBox1.ItemIndex = 43 then begin Randomize; Mi[0] := StrToInt(Lab1.Text); Za[4] := Random(Mi[0]); end; if ListBox1.ItemIndex = 44 then begin Randomize; Mi[0] := StrToInt(Lab1.Text); Mi[1] := StrToInt(Lab2.Text); Za[4] := RandomRange(Mi[0],Mi[1]); end; if ListBox1.ItemIndex = 45 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Za[3] := StrToFloat(Lab4.Text); Za[4] := Za[0]+(Za[1]/Za[2])+Za[1]*Za[3]; end; if ListBox1.ItemIndex = 46 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[2] := StrToFloat(Lab3.Text); Za[3] := StrToFloat(Lab4.Text); Za[4] := Sqrt(2*Za[3]*(Za[0]-Za[1]))+ ((Za[0]+Za[1])*Za[2]-Za[3])/2; end; if ListBox1.ItemIndex = 47 then begin Za[0] := StrToFloat(Lab1.Text); Za[1] := StrToFloat(Lab2.Text); Za[4] := Sqrt(2*Za[0]/Za[1]); end; if ListBox1.ItemIndex = 48 then begin
Za[0] := StrToFloat(Lab1.Text); {in} Za[1] := StrToFloat(Lab2.Text); {ln} Za[2] := StrToFloat(Lab3.Text); {g} Za[3] := StrToFloat(Lab4.Text); {K} Za[5] := StrToFloat(Lab5.Text); {n} Za[6] := (Za[3]*Power(1+Za[3],Za[5]))/ (Power(1+Za[3],Za[5])-1); Za[7] := (Power(1+Za[3],Za[5])-Za[3]*Za[5]-1)/ (Za[3]*Power(1+Za[3],Za[5])-Za[3]); Za[4] := (Za[0]-Za[1])*Za[6]+Za[1]*Za[3]+Za[2]*Za[7]; end; if TrackBar1.Position = 1 then B := '0.#'; if TrackBar1.Position = 2 then B := '0.##'; if TrackBar1.Position = 3 then B := '0.###'; if TrackBar1.Position = 4 then B := '0.####'; if TrackBar1.Position = 5 then B := '0.#####'; if TrackBar1.Position = 6 then B := '0.######'; if TrackBar1.Position = 7 then B := '0.#######'; if TrackBar1.Position = 8 then B := '0.########'; if TrackBar1.Position = 9 then B := '0.#########'; if TrackBar1.Position = 10 then B := '0.##########'; if TrackBar1.Position = 11 then B := '0.###########'; if TrackBar1.Position = 12 then B := '0.############'; if TrackBar1.Position = 13 then B := '0.#############'; if TrackBar1.Position = 14 then B := '0.##############'; if TrackBar1.Position = 15 then B := '0.###############'; Memo1.Lines.Add(FormatFloat(B,Za[4])); end; procedure TForm1.FormActivate(Sender: TObject); begin ListBox1.ItemIndex := 0; TrackBar1.Position := 4; Lab1.EditLabel.Caption := 'Odaberes broj i kliknes'; Lab2.EditLabel.Caption := ' '; Lab3.EditLabel.Caption := ' '; Lab4.EditLabel.Caption := ' '; Lab5.EditLabel.Caption := ' ';
Lab6.EditLabel.Caption := ' end;
';
procedure TForm1.ListBox1Click(Sender: TObject); var D : Integer; begin Lab1.EditLabel.Caption := ' '; Lab2.EditLabel.Caption := ' '; Lab3.EditLabel.Caption := ' '; Lab4.EditLabel.Caption := ' '; Lab5.EditLabel.Caption := ' '; Lab6.EditLabel.Caption := ' '; D := ListBox1.ItemIndex; if D = 0 then Lab1.EditLabel.Caption := 'Trajanje projekta u godinama:'; if D = 1 then Lab1.EditLabel.Caption := 'Trajanje projekta u godinama:'; if D = 2 then begin Lab1.EditLabel.Caption := 'Moc zaradjivanja:'; Lab2.EditLabel.Caption := 'Godisnja inflaciona stopa:'; end; if D = 3 then begin Lab1.EditLabel.Caption := 'nominalna stopa:'; Lab2.EditLabel.Caption := 'broj kamatnih perioda:'; end; if D = 4 then begin Lab1.EditLabel.Caption := 'Nominalna stopa:'; Lab2.EditLabel.Caption := 'Broj kamatnih perioda:'; Lab3.EditLabel.Caption := 'Broj perioda obracuna:'; end; if D = 5 then begin Lab1.EditLabel.Caption := 'Nominalna stopa:'; Lab2.EditLabel.Caption := 'Broj perioda obracuna:'; end; if (D = 6) or (D = 7) then begin Lab1.EditLabel.Caption := 'Kamatna stopa:'; Lab2.EditLabel.Caption := 'Broj godina:'; end; if (D = 8) or (D = 9) or (D = 10) or (D = 11) or (D = 12) or (D = 13) or (D = 14) or (D = 15) or (D = 16) or (D = 17) or (D = 18) or (D = 19) then begin Lab1.EditLabel.Caption := 'Kamatna stopa:'; Lab2.EditLabel.Caption := 'Broj godina:'; end; if D = 20 then begin Lab1.EditLabel.Caption := 'Iznos novca:'; Lab2.EditLabel.Caption := 'Procentualni udeo:'; end; if (D = 21) or (D = 22) or (D = 23) or (D = 24) or (D = 25) then begin Lab1.EditLabel.Caption := 'Kamatna stopa:';
Lab2.EditLabel.Caption := 'Stopa geometrijske progresije:'; Lab3.EditLabel.Caption := 'Broj godina:'; end; if D = 26 then begin Lab1.EditLabel.Caption := 'Godina amortizacije:'; Lab2.EditLabel.Caption := 'Vek upotrebe:'; end; if D = 27 then begin Lab1.EditLabel.Caption := 'Vek upotrebe:'; Lab2.EditLabel.Caption := 'Godina amortizacije:'; end; if (D = 28) or (D = 29) or (D = 30) or (D = 31) or (D = 32) then begin Lab1.EditLabel.Caption := 'Y:'; Lab2.EditLabel.Caption := 'X:'; end; if D = 33 then begin Lab1.EditLabel.Caption := 'Investicioni trosak:'; Lab2.EditLabel.Caption := 'Likvidaciona vrednost:'; Lab3.EditLabel.Caption := 'Vek trajanja:'; Lab4.EditLabel.Caption := 'Period:'; end; if D = 45 then begin Lab1.EditLabel.Caption := 'Radna inferiornost starog:'; Lab2.EditLabel.Caption := 'Razlika:'; Lab3.EditLabel.Caption := 'Broj godina:'; Lab4.EditLabel.Caption := 'Kamatna stopa:'; end; if D = 46 then begin Lab1.EditLabel.Caption := 'Investicioni trosak novog:'; Lab2.EditLabel.Caption := 'Likvidaciona vrednost novog:'; Lab3.EditLabel.Caption := 'Kamatna stopa:'; Lab4.EditLabel.Caption := 'Nagib inferiornosti starog:'; end; end; procedure TForm1.Lab1SubLabelClick(Sender: TObject); var Ma : String; begin Ma := Memo1.SelText; if (Ma = '') or (Ma = ' ') then Ma := Memo1.Lines.Strings[Memo1.CaretPos.Y]; Lab1.Text := Ma; end; procedure TForm1.Lab2SubLabelClick(Sender: TObject); var Ma : String; begin Ma := Memo1.SelText; if (Ma = '') or (Ma = ' ') then Ma := Memo1.Lines.Strings[Memo1.CaretPos.Y]; Lab2.Text := Ma;
end; procedure TForm1.Lab3SubLabelClick(Sender: TObject); var Ma : String; begin Ma := Memo1.SelText; if (Ma = '') or (Ma = ' ') then Ma := Memo1.Lines.Strings[Memo1.CaretPos.Y]; Lab3.Text := Ma; end; procedure TForm1.Lab4SubLabelClick(Sender: TObject); var Ma : String; begin Ma := Memo1.SelText; if (Ma = '') or (Ma = ' ') then Ma := Memo1.Lines.Strings[Memo1.CaretPos.Y]; Lab4.Text := Ma; end; procedure TForm1.Lab5SubLabelClick(Sender: TObject); var Ma : String; begin Ma := Memo1.SelText; if (Ma = '') or (Ma = ' ') then Ma := Memo1.Lines.Strings[Memo1.CaretPos.Y]; Lab5.Text := Ma; end; procedure TForm1.Lab6SubLabelClick(Sender: TObject); var Ma : String; begin Ma := Memo1.SelText; if (Ma = '') or (Ma = ' ') then Ma := Memo1.Lines.Strings[Memo1.CaretPos.Y]; Lab6.Text := Ma; end; procedure TForm1.UpDown1Click(Sender: TObject; Button: TUDBtnType); begin Memo1.Font.Size := UpDown1.Position; end; procedure TForm1.UpDown2Click(Sender: TObject; Button: TUDBtnType); begin ListBox1.Font.Size := UpDown2.Position; end; end.
Még egy program a Borland Delphi-ben: unit Neurolitik; interface uses Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms, Dialogs, StdCtrls, ExtCtrls, Math, StrUtils, ComCtrls, TabNotBk; type TForm1 = class(TForm) TabbedNotebook1: TTabbedNotebook; LabeledEdit1: TLabeledEdit; LabeledEdit2: TLabeledEdit; Button1: TButton; TrackBar1: TTrackBar; ScrollBar1: TScrollBar; Label1: TLabel; RadioGroup1: TRadioGroup; LabeledEdit3: TLabeledEdit; Label2: TLabel; Button2: TButton; Button3: TButton; ScrollBar2: TScrollBar; Label3: TLabel; procedure Button1Click(Sender: TObject); procedure ScrollBar1Change(Sender: TObject); procedure Button2Click(Sender: TObject); procedure Button3Click(Sender: TObject); procedure ScrollBar2Change(Sender: TObject); private { Private declarations } public { Public declarations } end; var Form1: TForm1; implementation {$R *.dfm} procedure TForm1.Button1Click(Sender: TObject); var Prebaceno, Sluc : Integer; Rec : String; begin Randomize; if RadioGroup1.ItemIndex = 0 then begin
Rec := LabeledEdit2.Text; Prebaceno := SoundExInt(Rec, TrackBar1.Position); Sluc := RandomRange(1, ScrollBar1.Position); LabeledEdit1.Text := IntToStr(Prebaceno) + IntToStr(Sluc); end else begin Rec := LabeledEdit2.Text; Prebaceno := SoundExInt(Rec, TrackBar1.Position); Sluc := RandomRange(1, ScrollBar1.Position); LabeledEdit1.Text := IntToStr(Prebaceno + Sluc); end; end; procedure TForm1.ScrollBar1Change(Sender: TObject); begin Label1.Caption := 'Vrednost: ' + IntToStr(ScrollBar1.Position); end; procedure TForm1.Button2Click(Sender: TObject); var Rajt : Integer; begin Randomize; Rajt := RandomRange(0, 255 - ScrollBar2.Position + RandomRange(0, 255)); Label2.Caption := 'Vrednost: ' + IntToStr(Rajt); LabeledEdit3.Text := LabeledEdit3.Text + Chr(Rajt); end; procedure TForm1.Button3Click(Sender: TObject); begin LabeledEdit3.Text := ''; end; procedure TForm1.ScrollBar2Change(Sender: TObject); begin Label3.Caption := 'Humani faktor: ' + IntToStr(ScrollBar2.Position); end; end.
Related Documents
Program
May 2020 25
Program
October 2019 41
Program
June 2020 15
Program
July 2020 18
Program
April 2020 23
Program
April 2020 34More Documents from "Otto"
Drvo
December 2019 30
Melisa
April 2020 16
Trabajo Encargado De Vida Util Weibulll.pdf
May 2020 17
Program
April 2020 34