tmi2_fluffos_v2/
tmi2_fluffos_v2/bin/
tmi2_fluffos_v2/etc/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/ChangeLog.old/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/Win32/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/compat/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/compat/simuls/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/include/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/clone/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/command/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/data/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/etc/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/include/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/inherit/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/inherit/master/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/log/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/single/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/single/tests/compiler/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/single/tests/efuns/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/single/tests/operators/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/testsuite/u/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/tmp/
tmi2_fluffos_v2/fluffos-2.7-ds2.018/windows/
tmi2_fluffos_v2/lib/
tmi2_fluffos_v2/lib/adm/
tmi2_fluffos_v2/lib/adm/daemons/languages/
tmi2_fluffos_v2/lib/adm/daemons/network/I3/
tmi2_fluffos_v2/lib/adm/daemons/virtual/
tmi2_fluffos_v2/lib/adm/daemons/virtual/template/
tmi2_fluffos_v2/lib/adm/news/
tmi2_fluffos_v2/lib/adm/obj/
tmi2_fluffos_v2/lib/adm/obj/master/
tmi2_fluffos_v2/lib/adm/priv/
tmi2_fluffos_v2/lib/adm/shell/
tmi2_fluffos_v2/lib/adm/tmp/
tmi2_fluffos_v2/lib/cmds/
tmi2_fluffos_v2/lib/d/
tmi2_fluffos_v2/lib/d/Conf/
tmi2_fluffos_v2/lib/d/Conf/adm/
tmi2_fluffos_v2/lib/d/Conf/boards/
tmi2_fluffos_v2/lib/d/Conf/cmds/
tmi2_fluffos_v2/lib/d/Conf/data/
tmi2_fluffos_v2/lib/d/Conf/logs/
tmi2_fluffos_v2/lib/d/Conf/obj/
tmi2_fluffos_v2/lib/d/Conf/text/help/
tmi2_fluffos_v2/lib/d/Fooland/adm/
tmi2_fluffos_v2/lib/d/Fooland/data/
tmi2_fluffos_v2/lib/d/Fooland/data/attic/
tmi2_fluffos_v2/lib/d/Fooland/items/
tmi2_fluffos_v2/lib/d/TMI/
tmi2_fluffos_v2/lib/d/TMI/adm/
tmi2_fluffos_v2/lib/d/TMI/boards/
tmi2_fluffos_v2/lib/d/TMI/data/
tmi2_fluffos_v2/lib/d/TMI/rooms/
tmi2_fluffos_v2/lib/d/grid/
tmi2_fluffos_v2/lib/d/grid/adm/
tmi2_fluffos_v2/lib/d/grid/data/
tmi2_fluffos_v2/lib/d/std/
tmi2_fluffos_v2/lib/d/std/adm/
tmi2_fluffos_v2/lib/data/adm/
tmi2_fluffos_v2/lib/data/adm/daemons/
tmi2_fluffos_v2/lib/data/adm/daemons/doc_d/
tmi2_fluffos_v2/lib/data/adm/daemons/emoted/
tmi2_fluffos_v2/lib/data/adm/daemons/network/http/
tmi2_fluffos_v2/lib/data/adm/daemons/network/services/mail_q/
tmi2_fluffos_v2/lib/data/adm/daemons/network/smtp/
tmi2_fluffos_v2/lib/data/adm/daemons/news/archives/
tmi2_fluffos_v2/lib/data/attic/connection/
tmi2_fluffos_v2/lib/data/attic/user/
tmi2_fluffos_v2/lib/data/std/connection/b/
tmi2_fluffos_v2/lib/data/std/connection/l/
tmi2_fluffos_v2/lib/data/std/user/a/
tmi2_fluffos_v2/lib/data/std/user/b/
tmi2_fluffos_v2/lib/data/std/user/d/
tmi2_fluffos_v2/lib/data/std/user/f/
tmi2_fluffos_v2/lib/data/std/user/l/
tmi2_fluffos_v2/lib/data/std/user/x/
tmi2_fluffos_v2/lib/data/u/d/dm/working/doc_d/
tmi2_fluffos_v2/lib/data/u/l/leto/doc_d/
tmi2_fluffos_v2/lib/data/u/l/leto/smtp/
tmi2_fluffos_v2/lib/doc/
tmi2_fluffos_v2/lib/doc/driverdoc/applies/
tmi2_fluffos_v2/lib/doc/driverdoc/applies/interactive/
tmi2_fluffos_v2/lib/doc/driverdoc/concepts/
tmi2_fluffos_v2/lib/doc/driverdoc/driver/
tmi2_fluffos_v2/lib/doc/driverdoc/efuns/arrays/
tmi2_fluffos_v2/lib/doc/driverdoc/efuns/buffers/
tmi2_fluffos_v2/lib/doc/driverdoc/efuns/compile/
tmi2_fluffos_v2/lib/doc/driverdoc/efuns/ed/
tmi2_fluffos_v2/lib/doc/driverdoc/efuns/filesystem/
tmi2_fluffos_v2/lib/doc/driverdoc/efuns/floats/
tmi2_fluffos_v2/lib/doc/driverdoc/efuns/functions/
tmi2_fluffos_v2/lib/doc/driverdoc/efuns/general/
tmi2_fluffos_v2/lib/doc/driverdoc/efuns/mappings/
tmi2_fluffos_v2/lib/doc/driverdoc/efuns/numbers/
tmi2_fluffos_v2/lib/doc/driverdoc/efuns/parsing/
tmi2_fluffos_v2/lib/doc/driverdoc/lpc/constructs/
tmi2_fluffos_v2/lib/doc/driverdoc/lpc/preprocessor/
tmi2_fluffos_v2/lib/doc/driverdoc/lpc/types/
tmi2_fluffos_v2/lib/doc/driverdoc/platforms/
tmi2_fluffos_v2/lib/doc/mudlib/
tmi2_fluffos_v2/lib/ftp/
tmi2_fluffos_v2/lib/include/driver/
tmi2_fluffos_v2/lib/log/
tmi2_fluffos_v2/lib/log/driver/
tmi2_fluffos_v2/lib/obj/net/
tmi2_fluffos_v2/lib/obj/shells/
tmi2_fluffos_v2/lib/obj/tools/
tmi2_fluffos_v2/lib/std/adt/
tmi2_fluffos_v2/lib/std/board/
tmi2_fluffos_v2/lib/std/body/
tmi2_fluffos_v2/lib/std/fun/
tmi2_fluffos_v2/lib/std/living/
tmi2_fluffos_v2/lib/std/object/
tmi2_fluffos_v2/lib/std/shop/
tmi2_fluffos_v2/lib/std/socket/
tmi2_fluffos_v2/lib/std/user/
tmi2_fluffos_v2/lib/std/virtual/
tmi2_fluffos_v2/lib/student/
tmi2_fluffos_v2/lib/student/kalypso/
tmi2_fluffos_v2/lib/student/kalypso/armor/
tmi2_fluffos_v2/lib/student/kalypso/rooms/
tmi2_fluffos_v2/lib/student/kalypso/weapons/
tmi2_fluffos_v2/lib/u/l/leto/
tmi2_fluffos_v2/lib/u/l/leto/cmds/
tmi2_fluffos_v2/lib/www/errors/
tmi2_fluffos_v2/lib/www/gateways/
tmi2_fluffos_v2/lib/www/images/
tmi2_fluffos_v2/old/
tmi2_fluffos_v2/win32/
/*
 * Defines and types for the compiler parse trees.
 */

#ifndef _TREES_H
#define _TREES_H

#define NODES_PER_BLOCK         256

enum node_type {
    NODE_RETURN, NODE_TWO_VALUES, NODE_OPCODE, NODE_OPCODE_1, NODE_OPCODE_2,
    NODE_UNARY_OP, NODE_UNARY_OP_1, NODE_BINARY_OP, NODE_BINARY_OP_1,
    NODE_TERNARY_OP, NODE_TERNARY_OP_1, NODE_CONTROL_JUMP, NODE_LOOP,
    NODE_CALL, NODE_CALL_1, NODE_CALL_2, NODE_LAND_LOR, NODE_FOREACH,
    NODE_LVALUE_EFUN, NODE_SWITCH_RANGES, NODE_SWITCH_STRINGS, 
    NODE_SWITCH_DIRECT, NODE_SWITCH_NUMBERS, NODE_CASE_NUMBER,
    NODE_CASE_STRING, NODE_DEFAULT, NODE_IF, NODE_BRANCH_LINK, NODE_PARAMETER,
    NODE_PARAMETER_LVALUE, NODE_EFUN, NODE_ANON_FUNC, NODE_REAL, NODE_NUMBER,
    NODE_STRING, NODE_FUNCTION_CONSTRUCTOR, NODE_CATCH, NODE_TIME_EXPRESSION,
    NODE_FUNCTION
};

enum control_jump_type {
    CJ_BREAK_SWITCH = 2, CJ_BREAK = 0, CJ_CONTINUE = 1
};

union parse_value {
    long number;
    float real;
    struct parse_node_s *expr;
};

typedef struct parse_node_s {
    short kind;
    short line;
    unsigned char type;
    union parse_value v, l, r; /* left, right, and value */
} parse_node_t;

typedef struct parse_node_block_s {
    struct parse_node_block_s *next;
    parse_node_t nodes[NODES_PER_BLOCK];
} parse_node_block_t;

#define IS_NODE(vn, nt, op) ((vn)->kind == nt && (vn)->v.number == op)

#define CREATE_TERNARY_OP(vn, op, t, x, y, z) SAFE(\
                                         (vn) = new_node();\
                                         (vn)->kind = NODE_TERNARY_OP;\
                                         INT_CREATE_TERNARY_OP(vn, op, t,\
                                                               x, y, z);\
                                                   )
#define INT_CREATE_TERNARY_OP(vn, op, t, x, y, z) SAFE(\
                                                       (vn)->l.expr = (x);\
                                                       (vn)->type = t;\
                                                       CREATE_BINARY_OP((vn)->r.expr, op, t, y, z);\
                                                       )
#define CREATE_BINARY_OP(vn, op, t, x, y) SAFE(\
                                               (vn) = new_node();\
                                               (vn)->kind = NODE_BINARY_OP;\
                                               INT_CREATE_BINARY_OP(vn, op,\
                                                                    t, x, y);\
                                               )
#define INT_CREATE_BINARY_OP(vn, op, t, x, y) SAFE(\
                                                   INT_CREATE_UNARY_OP(vn, op,\
                                                                       t, y);\
                                                   (vn)->l.expr = x;\
                                                   )
#define CREATE_UNARY_OP(vn, op, t, x) SAFE(\
                                           (vn) = new_node();\
                                           (vn)->kind = NODE_UNARY_OP;\
                                           INT_CREATE_UNARY_OP(vn, op, t, x);\
                                           )
#define INT_CREATE_UNARY_OP(vn, op, t, x) SAFE(\
                                               INT_CREATE_OPCODE(vn, op, t);\
                                               (vn)->r.expr = x;\
                                               )
#define CREATE_OPCODE(vn, op, t) SAFE(\
                                      (vn) = new_node();\
                                      (vn)->kind = NODE_OPCODE;\
                                      INT_CREATE_OPCODE(vn, op, t);\
                                      )
#define INT_CREATE_OPCODE(vn, op, t) SAFE(\
                                          (vn)->v.number = op;\
                                          (vn)->type = t;\
                                          )

#define CREATE_OPCODE_1(vn, op, t, p) SAFE(\
                                           (vn) = new_node();\
                                           (vn)->kind = NODE_OPCODE_1;\
                                           INT_CREATE_OPCODE(vn, op, t);\
                                           (vn)->l.number = p;\
                                           )
#define CREATE_OPCODE_2(vn, op, t, p1, p2) SAFE(\
                                                (vn) = new_node();\
                                                (vn)->kind = NODE_OPCODE_2;\
                                                INT_CREATE_OPCODE(vn, op, t);\
                                                (vn)->l.number = p1;\
                                                (vn)->r.number = p2;\
                                                )
#define CREATE_UNARY_OP_1(vn, op, t, x, p) SAFE(\
                                                (vn) = new_node();\
                                                (vn)->kind = NODE_UNARY_OP_1;\
                                                INT_CREATE_UNARY_OP(vn,\
                                                                    op, t, x);\
                                                (vn)->l.number = p;\
                                                )
#define CREATE_BINARY_OP_1(vn, op, t, x, y, p) SAFE(\
                                            (vn) = new_node();\
                                            (vn)->kind = NODE_BINARY_OP_1;\
                                            INT_CREATE_BINARY_OP(vn, op,\
                                                                 t, x, y);\
                                            (vn)->type = p;\
                                                    )
#define CREATE_TERNARY_OP_1(vn, op, t, x, y, z, p) SAFE(\
                                             (vn) = new_node();\
                                             (vn)->kind = NODE_TERNARY_OP_1;\
                                             INT_CREATE_TERNARY_OP(vn, op, t,\
                                                                   x, y, z);\
                                             (vn)->r.expr->type = p;\
                                             )
#define CREATE_RETURN(vn, val) SAFE(\
                                    (vn) = new_node_no_line();\
                                    (vn)->kind = NODE_RETURN;\
                                    (vn)->r.expr = val;\
                                    )
#define CREATE_LAND_LOR(vn, op, x, y) SAFE(\
                                           (vn) = new_node();\
                                           (vn)->kind = NODE_LAND_LOR;\
                                           (vn)->v.number = op;\
                                           (vn)->l.expr = x;\
                                           (vn)->r.expr = y;\
                                           (vn)->type = ((x->type == y->type)\
                                                         ? x->type : TYPE_ANY);\
                                           )
#define CREATE_CALL(vn, op, t, el) SAFE(\
                                        (vn) = el;\
                                        (vn)->kind = NODE_CALL;\
                                        (vn)->l.number = (vn)->v.number;\
                                        (vn)->v.number = op;\
                                        (vn)->type = t;\
                                        )
#define CREATE_STATEMENTS(vn, ln, rn) SAFE(\
                                           (vn) = new_node_no_line();\
                                           (vn)->kind = NODE_TWO_VALUES;\
                                           (vn)->l.expr = ln;\
                                           (vn)->r.expr = rn;\
                                           )
#define CREATE_TWO_VALUES(vn, t, ln, rn) SAFE(\
                                              CREATE_STATEMENTS(vn, ln, rn);\
                                              (vn)->type = t;\
                                              )
#define CREATE_CONTROL_JUMP(vn, op) SAFE(\
                                         (vn) = new_node_no_line();\
                                         (vn)->kind = NODE_CONTROL_JUMP;\
                                         (vn)->v.number = op;\
                                         )
#define CREATE_PARAMETER(vn, t, p) SAFE(\
                                        (vn) = new_node_no_line();\
                                        (vn)->kind = NODE_PARAMETER;\
                                        (vn)->type = t;\
                                        (vn)->v.number = p;\
                                        )
#define CREATE_IF(vn, c, s, e) SAFE(\
                                    (vn) = new_node_no_line();\
                                    (vn)->kind = NODE_IF;\
                                    (vn)->v.expr = c;\
                                    (vn)->l.expr = s;\
                                    (vn)->r.expr = (e);\
                                    )

#define CREATE_IGNORE(vn, c,s,e) SAFE(\
                                      (vn) = new_node_no_line();\
                                      (vn)->kind = NODE_IGNORE;\
                                      (vn)->v.expr = c;\
                                      (vn)->l.expr = s;\
                                      (vn)->r.expr = (e);\
                                      )

#define CREATE_LOOP(vn, tf, b, i, t) SAFE(\
                                          (vn) = new_node_no_line();\
                                          (vn)->kind = NODE_LOOP;\
                                          (vn)->type = tf;\
                                          (vn)->v.expr = b;\
                                          (vn)->l.expr = i;\
                                          (vn)->r.expr = t;\
                                      )
#define CREATE_LVALUE_EFUN(vn, t, lvl) SAFE(\
                                            (vn) = new_node();\
                                            (vn)->kind = NODE_LVALUE_EFUN;\
                                            (vn)->r.expr = lvl;\
                                            (vn)->type = t;\
                                            )
#define CREATE_FOREACH(vn, ln, rn) SAFE(\
                                        (vn) = new_node();\
                                        (vn)->kind = NODE_FOREACH;\
                                        (vn)->l.expr = ln;\
                                        (vn)->r.expr = rn;\
                                        )
#define CREATE_ERROR(vn) SAFE(\
                              (vn) = new_node_no_line();\
                              (vn)->kind = NODE_NUMBER;\
                              (vn)->type = TYPE_ANY;\
                              )
#define CREATE_REAL(vn, val) SAFE(\
                                  (vn) = new_node_no_line();\
                                  (vn)->kind = NODE_REAL;\
                                  (vn)->type = TYPE_REAL;\
                                  (vn)->v.real = val;\
                                  )
#define CREATE_NUMBER(vn, val) SAFE(\
                                    (vn) = new_node_no_line();\
                                    (vn)->kind = NODE_NUMBER;\
                                    (vn)->type = (val ? TYPE_NUMBER : TYPE_ANY);\
                                    (vn)->v.number = val;\
 )
#define CREATE_STRING(vn, val) SAFE(\
                                    (vn) = new_node_no_line();\
                                    (vn)->kind = NODE_STRING;\
                                    (vn)->type = TYPE_STRING;\
                                    (vn)->v.number = store_prog_string(val);\
                                    )
#define CREATE_EXPR_LIST(vn, pn) SAFE(\
                                      (vn) = new_node();\
                                      (vn)->v.number = (pn ? ((parse_node_t *)pn)->kind : 0);\
                                      (vn)->l.expr = (pn ? ((parse_node_t *)pn)->l.expr : (vn));\
                                      (vn)->r.expr = pn;\
                                      )
#define CREATE_EXPR_NODE(vn, pn, f) SAFE(\
                                         (vn) = new_node_no_line();\
                                         (vn)->v.expr = pn;\
                                         (vn)->l.expr = vn;\
                                         (vn)->r.expr = 0;\
                                         (vn)->type = f;\
                                         )
#define CREATE_CATCH(vn, pn) SAFE(\
                                  (vn) = new_node();\
                                  (vn)->kind = NODE_CATCH;\
                                  (vn)->type = TYPE_ANY;\
                                  (vn)->r.expr = pn;\
                                  )
#define CREATE_TIME_EXPRESSION(vn, pn) SAFE(\
                                          (vn) = new_node();\
                                          (vn)->kind = NODE_TIME_EXPRESSION;\
                                          (vn)->type = TYPE_ANY;\
                                          (vn)->r.expr = pn;\
                                          )

#define NODE_NO_LINE(x,y) SAFE(\
                               (x) = new_node_no_line();\
                               (x)->kind = y;\
                               )

/* tree functions */
void free_tree (void);
void release_tree (void);
void lock_expressions (void);
void unlock_expressions (void);
/* node functions */
parse_node_t *new_node (void);
parse_node_t *new_node_no_line (void);
parse_node_t *make_branched_node (short, char, 
                                       parse_node_t *, parse_node_t *);
/* parser grammar functions */
parse_node_t *binary_int_op (parse_node_t *, parse_node_t *, 
                                  char, const char *);
parse_node_t *make_range_node (int, parse_node_t *,
                                         parse_node_t *,
                                         parse_node_t *);
parse_node_t *insert_pop_value (parse_node_t *);
parse_node_t *pop_value (parse_node_t *);
parse_node_t *optimize_loop_test (parse_node_t *);
int is_boolean (parse_node_t *);

#endif