29#include "eval0proc.ic"
42 elsif_node_t* elsif_node;
46 node =
static_cast<if_node_t *
>(thr->run_node);
85 if (elsif_node == NULL) {
101 if (thr->run_node == NULL) {
121 node =
static_cast<while_node_t *
>(thr->run_node);
157 node =
static_cast<assign_node_t *
>(thr->run_node);
186 node =
static_cast<for_node_t *
>(thr->run_node);
192 if (thr->prev_node != parent) {
197 if (thr->run_node != NULL) {
223 thr->run_node = parent;
243 que_node_t* loop_node;
247 node =
static_cast<exit_node_t *
>(thr->run_node);
279 node =
static_cast<return_node_t *
>(thr->run_node);
UNIV_INLINE ibool eval_node_get_ibool_val(que_node_t *node)
UNIV_INLINE void eval_node_set_int_val(que_node_t *node, lint val)
UNIV_INLINE void eval_node_copy_val(que_node_t *node1, que_node_t *node2)
UNIV_INLINE void eval_exp(que_node_t *exp_node)
UNIV_INLINE lint eval_node_get_int_val(que_node_t *node)
UNIV_INLINE ulint que_node_get_type(que_node_t *node)
UNIV_INLINE que_node_t * que_node_get_parent(que_node_t *node)
UNIV_INLINE que_node_t * que_node_get_next(que_node_t *node)
UNIV_INTERN que_node_t * que_node_get_containing_loop_node(que_node_t *node)
que_node_t * loop_start_limit
que_node_t * loop_end_limit
elsif_node_t * elsif_list