|
Classes |
| struct | local_variable |
| struct | compiler_frame |
| union | node_data |
| struct | node_s |
Defines |
| #define | MAX_GLOBAL_VARIABLES 1000 |
| #define | YYTE_IS_WARNING 1 |
| #define | OPT_OPTIMIZED 0x1 |
| #define | OPT_NOT_CONST 0x2 |
| #define | OPT_SIDE_EFFECT 0x4 |
| #define | OPT_ASSIGNMENT 0x8 |
| #define | OPT_TRY_OPTIMIZE 0x10 |
| #define | OPT_EXTERNAL_DEPEND 0x20 |
| #define | OPT_CASE 0x40 |
| #define | OPT_CONTINUE 0x80 |
| #define | OPT_BREAK 0x100 |
| #define | OPT_RETURN 0x200 |
| #define | OPT_TYPE_NOT_FIXED 0x400 |
| #define | OPT_WEAK_TYPE 0x800 |
| #define | OPT_APPLY 0x1000 |
| #define | OPT_FLAG_NODE 0x2000 |
| #define | OPT_DEFROSTED 0x4000 |
| #define | OPT_NOT_SHARED 0x8000 |
| #define | OPT_CUSTOM_LABELS 0x10000 |
| #define | SCOPE_LOCAL 1 |
| #define | SCOPE_SCOPED 2 |
| #define | SCOPE_SCOPE_USED 4 |
| #define | free_node(n) debug_free_node(dmalloc_touch(node *,n)) |
| #define | mknode(token, a, b) dmalloc_touch(node *, debug_mknode(token, dmalloc_touch(node *, a), dmalloc_touch(node *, b))) |
| #define | mkstrnode(str) dmalloc_touch(node *, debug_mkstrnode(str)) |
| #define | mkintnode(nr) dmalloc_touch(node *, debug_mkintnode(nr)) |
| #define | mknewintnode(nr) dmalloc_touch(node *, debug_mknewintnode(nr)) |
| #define | mkfloatnode(foo) dmalloc_touch(node *, debug_mkfloatnode(foo)) |
| #define | mkprgnode(p) dmalloc_touch(node *, debug_mkprgnode(p)) |
| #define | mkapplynode(func, args) dmalloc_touch(node *, debug_mkapplynode(dmalloc_touch(node *, func),dmalloc_touch(node *, args))) |
| #define | mkefuncallnode(function, args) dmalloc_touch(node *, debug_mkefuncallnode(function, dmalloc_touch(node *, args))) |
| #define | mkopernode(oper_id, arg1, arg2) dmalloc_touch(node *, debug_mkopernode(oper_id, dmalloc_touch(node *, arg1), dmalloc_touch(node *, arg2))) |
| #define | mklocalnode(var, depth) dmalloc_touch(node *, debug_mklocalnode(var, depth)) |
| #define | mkidentifiernode(i) dmalloc_touch(node *, debug_mkidentifiernode(i)) |
| #define | mktrampolinenode(i, f) dmalloc_touch(node *, debug_mktrampolinenode(i, f)) |
| #define | mkexternalnode(parent_prog, i) dmalloc_touch(node *, debug_mkexternalnode(parent_prog, i)) |
| #define | mkthisnode(parent_prog, i) dmalloc_touch(node *, debug_mkthisnode(parent_prog, i)) |
| #define | mkcastnode(type, n) dmalloc_touch(node *, debug_mkcastnode(type, dmalloc_touch(node *, n))) |
| #define | mksoftcastnode(type, n) dmalloc_touch(node *, debug_mksoftcastnode(type, dmalloc_touch(node *, n))) |
| #define | mktypenode(t) dmalloc_touch(node *, debug_mktypenode(t)) |
| #define | mkconstantsvaluenode(s) dmalloc_touch(node *, debug_mkconstantsvaluenode(dmalloc_touch(struct svalue *, s))) |
| #define | mkliteralsvaluenode(s) dmalloc_touch(node *, debug_mkliteralsvaluenode(dmalloc_touch(struct svalue *, s))) |
| #define | mksvaluenode(s) dmalloc_touch(node *, debug_mksvaluenode(dmalloc_touch(struct svalue *, s))) |
| #define | COPY_LINE_NUMBER_INFO(TO, FROM) |
| #define | check_node_hash(X) (X) |
| #define | _CAR(n) (dmalloc_touch(node *,(n))->u.node.a) |
| #define | _CDR(n) (dmalloc_touch(node *,(n))->u.node.b) |
| #define | _CAAR(n) _CAR(_CAR(n)) |
| #define | _CADR(n) _CAR(_CDR(n)) |
| #define | _CDAR(n) _CDR(_CAR(n)) |
| #define | _CDDR(n) _CDR(_CDR(n)) |
| #define | defrost_node(n) (n) |
| #define | ADD_NODE_REF(n) (n = 0) |
| #define | ADD_NODE_REF2(n, code) do { code; n = 0;} while(0) |
| #define | CAR(n) _CAR(n) |
| #define | CDR(n) _CDR(n) |
| #define | CAAR(n) CAR(CAR(n)) |
| #define | CADR(n) CAR(CDR(n)) |
| #define | CDAR(n) CDR(CAR(n)) |
| #define | CDDR(n) CDR(CDR(n)) |
| #define | CAAAR(n) CAR(CAR(CAR(n))) |
| #define | CAADR(n) CAR(CAR(CDR(n))) |
| #define | CADAR(n) CAR(CDR(CAR(n))) |
| #define | CADDR(n) CAR(CDR(CDR(n))) |
| #define | CDAAR(n) CDR(CAR(CAR(n))) |
| #define | CDADR(n) CDR(CAR(CDR(n))) |
| #define | CDDAR(n) CDR(CDR(CAR(n))) |
| #define | CDDDR(n) CDR(CDR(CDR(n))) |
| #define | CAAAAR(n) CAR(CAR(CAR(CAR(n)))) |
| #define | CAAADR(n) CAR(CAR(CAR(CDR(n)))) |
| #define | CAADAR(n) CAR(CAR(CDR(CAR(n)))) |
| #define | CAADDR(n) CAR(CAR(CDR(CDR(n)))) |
| #define | CADAAR(n) CAR(CDR(CAR(CAR(n)))) |
| #define | CADADR(n) CAR(CDR(CAR(CDR(n)))) |
| #define | CADDAR(n) CAR(CDR(CDR(CAR(n)))) |
| #define | CADDDR(n) CAR(CDR(CDR(CDR(n)))) |
| #define | CDAAAR(n) CDR(CAR(CAR(CAR(n)))) |
| #define | CDAADR(n) CDR(CAR(CAR(CDR(n)))) |
| #define | CDADAR(n) CDR(CAR(CDR(CAR(n)))) |
| #define | CDADDR(n) CDR(CAR(CDR(CDR(n)))) |
| #define | CDDAAR(n) CDR(CDR(CAR(CAR(n)))) |
| #define | CDDADR(n) CDR(CDR(CAR(CDR(n)))) |
| #define | CDDDAR(n) CDR(CDR(CDR(CAR(n)))) |
| #define | CDDDDR(n) CDR(CDR(CDR(CDR(n)))) |
| #define | CAAAAAR(n) CAR(CAR(CAR(CAR(CAR(n))))) |
| #define | CAAAADR(n) CAR(CAR(CAR(CAR(CDR(n))))) |
| #define | CAAADAR(n) CAR(CAR(CAR(CDR(CAR(n))))) |
| #define | CAAADDR(n) CAR(CAR(CAR(CDR(CDR(n))))) |
| #define | CAADAAR(n) CAR(CAR(CDR(CAR(CAR(n))))) |
| #define | CAADADR(n) CAR(CAR(CDR(CAR(CDR(n))))) |
| #define | CAADDAR(n) CAR(CAR(CDR(CDR(CAR(n))))) |
| #define | CAADDDR(n) CAR(CAR(CDR(CDR(CDR(n))))) |
| #define | CADAAAR(n) CAR(CDR(CAR(CAR(CAR(n))))) |
| #define | CADAADR(n) CAR(CDR(CAR(CAR(CDR(n))))) |
| #define | CADADAR(n) CAR(CDR(CAR(CDR(CAR(n))))) |
| #define | CADADDR(n) CAR(CDR(CAR(CDR(CDR(n))))) |
| #define | CADDAAR(n) CAR(CDR(CDR(CAR(CAR(n))))) |
| #define | CADDADR(n) CAR(CDR(CDR(CAR(CDR(n))))) |
| #define | CADDDAR(n) CAR(CDR(CDR(CDR(CAR(n))))) |
| #define | CADDDDR(n) CAR(CDR(CDR(CDR(CDR(n))))) |
| #define | CDAAAAR(n) CDR(CAR(CAR(CAR(CAR(n))))) |
| #define | CDAAADR(n) CDR(CAR(CAR(CAR(CDR(n))))) |
| #define | CDAADAR(n) CDR(CAR(CAR(CDR(CAR(n))))) |
| #define | CDAADDR(n) CDR(CAR(CAR(CDR(CDR(n))))) |
| #define | CDADAAR(n) CDR(CAR(CDR(CAR(CAR(n))))) |
| #define | CDADADR(n) CDR(CAR(CDR(CAR(CDR(n))))) |
| #define | CDADDAR(n) CDR(CAR(CDR(CDR(CAR(n))))) |
| #define | CDADDDR(n) CDR(CAR(CDR(CDR(CDR(n))))) |
| #define | CDDAAAR(n) CDR(CDR(CAR(CAR(CAR(n))))) |
| #define | CDDAADR(n) CDR(CDR(CAR(CAR(CDR(n))))) |
| #define | CDDADAR(n) CDR(CDR(CAR(CDR(CAR(n))))) |
| #define | CDDADDR(n) CDR(CDR(CAR(CDR(CDR(n))))) |
| #define | CDDDAAR(n) CDR(CDR(CDR(CAR(CAR(n))))) |
| #define | CDDDADR(n) CDR(CDR(CDR(CAR(CDR(n))))) |
| #define | CDDDDAR(n) CDR(CDR(CDR(CDR(CAR(n))))) |
| #define | CDDDDDR(n) CDR(CDR(CDR(CDR(CDR(n))))) |
| #define | CAAAAAAR(n) CAR(CAR(CAR(CAR(CAR(CAR(n)))))) |
| #define | CAAAAADR(n) CAR(CAR(CAR(CAR(CAR(CDR(n)))))) |
| #define | CAAAADAR(n) CAR(CAR(CAR(CAR(CDR(CAR(n)))))) |
| #define | CAAAADDR(n) CAR(CAR(CAR(CAR(CDR(CDR(n)))))) |
| #define | CAAADAAR(n) CAR(CAR(CAR(CDR(CAR(CAR(n)))))) |
| #define | CAAADADR(n) CAR(CAR(CAR(CDR(CAR(CDR(n)))))) |
| #define | CAAADDAR(n) CAR(CAR(CAR(CDR(CDR(CAR(n)))))) |
| #define | CAAADDDR(n) CAR(CAR(CAR(CDR(CDR(CDR(n)))))) |
| #define | CAADAAAR(n) CAR(CAR(CDR(CAR(CAR(CAR(n)))))) |
| #define | CAADAADR(n) CAR(CAR(CDR(CAR(CAR(CDR(n)))))) |
| #define | CAADADAR(n) CAR(CAR(CDR(CAR(CDR(CAR(n)))))) |
| #define | CAADADDR(n) CAR(CAR(CDR(CAR(CDR(CDR(n)))))) |
| #define | CAADDAAR(n) CAR(CAR(CDR(CDR(CAR(CAR(n)))))) |
| #define | CAADDADR(n) CAR(CAR(CDR(CDR(CAR(CDR(n)))))) |
| #define | CAADDDAR(n) CAR(CAR(CDR(CDR(CDR(CAR(n)))))) |
| #define | CAADDDDR(n) CAR(CAR(CDR(CDR(CDR(CDR(n)))))) |
| #define | CADAAAAR(n) CAR(CDR(CAR(CAR(CAR(CAR(n)))))) |
| #define | CADAAADR(n) CAR(CDR(CAR(CAR(CAR(CDR(n)))))) |
| #define | CADAADAR(n) CAR(CDR(CAR(CAR(CDR(CAR(n)))))) |
| #define | CADAADDR(n) CAR(CDR(CAR(CAR(CDR(CDR(n)))))) |
| #define | CADADAAR(n) CAR(CDR(CAR(CDR(CAR(CAR(n)))))) |
| #define | CADADADR(n) CAR(CDR(CAR(CDR(CAR(CDR(n)))))) |
| #define | CADADDAR(n) CAR(CDR(CAR(CDR(CDR(CAR(n)))))) |
| #define | CADADDDR(n) CAR(CDR(CAR(CDR(CDR(CDR(n)))))) |
| #define | CADDAAAR(n) CAR(CDR(CDR(CAR(CAR(CAR(n)))))) |
| #define | CADDAADR(n) CAR(CDR(CDR(CAR(CAR(CDR(n)))))) |
| #define | CADDADAR(n) CAR(CDR(CDR(CAR(CDR(CAR(n)))))) |
| #define | CADDADDR(n) CAR(CDR(CDR(CAR(CDR(CDR(n)))))) |
| #define | CADDDAAR(n) CAR(CDR(CDR(CDR(CAR(CAR(n)))))) |
| #define | CADDDADR(n) CAR(CDR(CDR(CDR(CAR(CDR(n)))))) |
| #define | CADDDDAR(n) CAR(CDR(CDR(CDR(CDR(CAR(n)))))) |
| #define | CADDDDDR(n) CAR(CDR(CDR(CDR(CDR(CDR(n)))))) |
| #define | CDAAAAAR(n) CDR(CAR(CAR(CAR(CAR(CAR(n)))))) |
| #define | CDAAAADR(n) CDR(CAR(CAR(CAR(CAR(CDR(n)))))) |
| #define | CDAAADAR(n) CDR(CAR(CAR(CAR(CDR(CAR(n)))))) |
| #define | CDAAADDR(n) CDR(CAR(CAR(CAR(CDR(CDR(n)))))) |
| #define | CDAADAAR(n) CDR(CAR(CAR(CDR(CAR(CAR(n)))))) |
| #define | CDAADADR(n) CDR(CAR(CAR(CDR(CAR(CDR(n)))))) |
| #define | CDAADDAR(n) CDR(CAR(CAR(CDR(CDR(CAR(n)))))) |
| #define | CDAADDDR(n) CDR(CAR(CAR(CDR(CDR(CDR(n)))))) |
| #define | CDADAAAR(n) CDR(CAR(CDR(CAR(CAR(CAR(n)))))) |
| #define | CDADAADR(n) CDR(CAR(CDR(CAR(CAR(CDR(n)))))) |
| #define | CDADADAR(n) CDR(CAR(CDR(CAR(CDR(CAR(n)))))) |
| #define | CDADADDR(n) CDR(CAR(CDR(CAR(CDR(CDR(n)))))) |
| #define | CDADDAAR(n) CDR(CAR(CDR(CDR(CAR(CAR(n)))))) |
| #define | CDADDADR(n) CDR(CAR(CDR(CDR(CAR(CDR(n)))))) |
| #define | CDADDDAR(n) CDR(CAR(CDR(CDR(CDR(CAR(n)))))) |
| #define | CDADDDDR(n) CDR(CAR(CDR(CDR(CDR(CDR(n)))))) |
| #define | CDDAAAAR(n) CDR(CDR(CAR(CAR(CAR(CAR(n)))))) |
| #define | CDDAAADR(n) CDR(CDR(CAR(CAR(CAR(CDR(n)))))) |
| #define | CDDAADAR(n) CDR(CDR(CAR(CAR(CDR(CAR(n)))))) |
| #define | CDDAADDR(n) CDR(CDR(CAR(CAR(CDR(CDR(n)))))) |
| #define | CDDADAAR(n) CDR(CDR(CAR(CDR(CAR(CAR(n)))))) |
| #define | CDDADADR(n) CDR(CDR(CAR(CDR(CAR(CDR(n)))))) |
| #define | CDDADDAR(n) CDR(CDR(CAR(CDR(CDR(CAR(n)))))) |
| #define | CDDADDDR(n) CDR(CDR(CAR(CDR(CDR(CDR(n)))))) |
| #define | CDDDAAAR(n) CDR(CDR(CDR(CAR(CAR(CAR(n)))))) |
| #define | CDDDAADR(n) CDR(CDR(CDR(CAR(CAR(CDR(n)))))) |
| #define | CDDDADAR(n) CDR(CDR(CDR(CAR(CDR(CAR(n)))))) |
| #define | CDDDADDR(n) CDR(CDR(CDR(CAR(CDR(CDR(n)))))) |
| #define | CDDDDAAR(n) CDR(CDR(CDR(CDR(CAR(CAR(n)))))) |
| #define | CDDDDADR(n) CDR(CDR(CDR(CDR(CAR(CDR(n)))))) |
| #define | CDDDDDAR(n) CDR(CDR(CDR(CDR(CDR(CAR(n)))))) |
| #define | CDDDDDDR(n) CDR(CDR(CDR(CDR(CDR(CDR(n)))))) |
| #define | GAUGE_RUSAGE_INDEX 0 |
| #define | add_to_mem_block(N, Data, Size) low_my_binary_strcat(Data,Size,areas+N) |
| #define | IDENTIFIERP(i) (Pike_compiler->new_program->identifier_references+(i)) |
| #define | INHERIT(i) (Pike_compiler->new_program->inherits+(i)) |
| #define | PIKE_PC (Pike_compiler->new_program->num_program) |
| #define | check_tree(X, Y) |
Typedefs |
| typedef void(* | c_fun )(INT32) |
Functions |
| void | yytype_error (char *msg, struct pike_type *expected_t, struct pike_type *got_t, unsigned int flags) |
| void | low_yyerror (struct pike_string *str) |
| void | yyerror (char *s) |
| int | islocal (struct pike_string *str) |
| int | verify_declared (struct pike_string *str) |
| void | cleanup_compiler (void) |
| | BLOCK_ALLOC_FILL_PAGES (node_s, 2) |
| int | car_is_node (node *n) |
| int | cdr_is_node (node *n) |
| void | check_tree (node *n, int depth) |
| INT32 | count_args (node *n) |
| pike_type * | find_return_type (node *n) |
| int | check_tailrecursion (void) |
| void | free_all_nodes (void) |
| void | debug_free_node (node *n) |
| node * | debug_check_node_hash (node *n) |
| node * | debug_mknode (int token, node *a, node *b) |
| node * | debug_mkstrnode (struct pike_string *str) |
| node * | debug_mkintnode (INT_TYPE nr) |
| node * | debug_mknewintnode (INT_TYPE nr) |
| node * | debug_mkfloatnode (FLOAT_TYPE foo) |
| node * | debug_mkprgnode (struct program *p) |
| node * | debug_mkapplynode (node *func, node *args) |
| node * | debug_mkefuncallnode (char *function, node *args) |
| node * | debug_mkopernode (char *oper_id, node *arg1, node *arg2) |
| node * | debug_mklocalnode (int var, int depth) |
| node * | debug_mkidentifiernode (int i) |
| node * | debug_mktrampolinenode (int i, struct compiler_frame *depth) |
| node * | debug_mkexternalnode (struct program *prog, int i) |
| node * | debug_mkthisnode (struct program *parent_prog, int inherit_num) |
| node * | debug_mkcastnode (struct pike_type *type, node *n) |
| node * | debug_mksoftcastnode (struct pike_type *type, node *n) |
| void | resolv_constant (node *n) |
| void | resolv_class (node *n) |
| node * | index_node (node *n, char *node_name, struct pike_string *id) |
| int | node_is_eq (node *a, node *b) |
| node * | debug_mktypenode (struct pike_type *t) |
| node * | debug_mkconstantsvaluenode (struct svalue *s) |
| node * | debug_mkliteralsvaluenode (struct svalue *s) |
| node * | debug_mksvaluenode (struct svalue *s) |
| node * | copy_node (node *n) |
| node * | defrost_node (node *n) |
| void | optimize_node (node *) |
| int | is_const (node *n) |
| int | node_is_tossable (node *n) |
| int | node_is_true (node *n) |
| int | node_is_false (node *n) |
| int | node_may_overload (node *n, int lfun) |
| node ** | last_cmd (node **a) |
| node ** | my_get_arg (node **a, int n) |
| node ** | is_call_to (node *n, c_fun f) |
| void | print_tree (node *n) |
| void | fix_type_field (node *n) |
| ptrdiff_t | eval_low (node *n, int print_error) |
| int | dooptcode (struct pike_string *name, node *n, struct pike_type *type, int modifiers) |
| void | resolv_program (node *n) |
Variables |
| int | cumulative_parse_error |