r = add_opcode(reg, OP_CALL);
if (r != 0) return r;
node->m.called_addr = BB_GET_OFFSET_POS(reg) + SIZE_ABSADDR + SIZE_OP_JUMP;
- NODE_STATUS_ADD(node, NST_ADDR_FIXED);
+ NODE_STATUS_ADD(node, ADDR_FIXED);
r = add_abs_addr(reg, (int )node->m.called_addr);
if (r != 0) return r;
len = compile_length_tree(NODE_ENCLOSURE_BODY(node), reg);
r = add_opcode(reg, OP_CALL);
if (r != 0) return r;
node->m.called_addr = BB_GET_OFFSET_POS(reg) + SIZE_ABSADDR + SIZE_OP_JUMP;
- NODE_STATUS_ADD(node, NST_ADDR_FIXED);
+ NODE_STATUS_ADD(node, ADDR_FIXED);
r = add_abs_addr(reg, (int )node->m.called_addr);
if (r != 0) return r;
len = compile_length_tree(NODE_ENCLOSURE_BODY(node), reg);
r = get_char_length_tree1(NODE_BODY(node), reg, len, level);
if (r == 0) {
en->char_len = *len;
- NODE_STATUS_ADD(node, NST_CLEN_FIXED);
+ NODE_STATUS_ADD(node, CLEN_FIXED);
}
}
break;
if (NODE_IS_MARK1(node))
len = 0; /* recursive */
else {
- NODE_STATUS_ADD(node, NST_MARK1);
+ NODE_STATUS_ADD(node, MARK1);
len = tree_min_len(NODE_BODY(node), env);
- NODE_STATUS_REMOVE(node, NST_MARK1);
+ NODE_STATUS_REMOVE(node, MARK1);
en->min_len = len;
- NODE_STATUS_ADD(node, NST_MIN_FIXED);
+ NODE_STATUS_ADD(node, MIN_FIXED);
}
}
break;
if (NODE_IS_MARK1(node))
len = INFINITE_LEN;
else {
- NODE_STATUS_ADD(node, NST_MARK1);
+ NODE_STATUS_ADD(node, MARK1);
len = tree_max_len(NODE_BODY(node), env);
- NODE_STATUS_REMOVE(node, NST_MARK1);
+ NODE_STATUS_REMOVE(node, MARK1);
en->max_len = len;
- NODE_STATUS_ADD(node, NST_MAX_FIXED);
+ NODE_STATUS_ADD(node, MAX_FIXED);
}
}
break;
if (backs[i] > env->num_mem)
return ONIGERR_INVALID_BACKREF;
- NODE_STATUS_ADD(mem_env[backs[i]].node, NST_BACKREF);
+ NODE_STATUS_ADD(mem_env[backs[i]].node, BACKREF);
}
r = 0;
}
return (head == 0 ? RECURSION_EXIST | RECURSION_MUST
: RECURSION_EXIST | RECURSION_MUST | RECURSION_INFINITE);
else {
- NODE_STATUS_ADD(node, NST_MARK2);
+ NODE_STATUS_ADD(node, MARK2);
r = infinite_recursive_call_check(NODE_BODY(node), env, head);
- NODE_STATUS_REMOVE(node, NST_MARK2);
+ NODE_STATUS_REMOVE(node, MARK2);
}
}
else if (en->type == ENCLOSURE_IF_ELSE) {
if (NODE_IS_RECURSION(node) && NODE_IS_CALLED(node)) {
int ret;
- NODE_STATUS_ADD(node, NST_MARK1);
+ NODE_STATUS_ADD(node, MARK1);
ret = infinite_recursive_call_check(NODE_BODY(node), env, 1);
if (ret < 0) return ret;
else if ((ret & (RECURSION_MUST | RECURSION_INFINITE)) != 0)
return ONIGERR_NEVER_ENDING_RECURSION;
- NODE_STATUS_REMOVE(node, NST_MARK1);
+ NODE_STATUS_REMOVE(node, MARK1);
}
}
else if (en->type == ENCLOSURE_IF_ELSE) {
r = recursive_call_check(NODE_BODY(node));
if (r != 0) {
if (NODE_IS_MARK1(NODE_BODY(node)))
- NODE_STATUS_ADD(node, NST_RECURSION);
+ NODE_STATUS_ADD(node, RECURSION);
}
break;
else if (NODE_IS_MARK1(node))
return 1; /* recursion */
else {
- NODE_STATUS_ADD(node, NST_MARK2);
+ NODE_STATUS_ADD(node, MARK2);
r = recursive_call_check(NODE_BODY(node));
- NODE_STATUS_REMOVE(node, NST_MARK2);
+ NODE_STATUS_REMOVE(node, MARK2);
}
}
else if (en->type == ENCLOSURE_IF_ELSE) {
if (en->type == ENCLOSURE_MEMORY) {
if (NODE_IS_CALLED(node) || (state & IN_RECURSION) != 0) {
if (! NODE_IS_RECURSION(node)) {
- NODE_STATUS_ADD(node, NST_MARK1);
+ NODE_STATUS_ADD(node, MARK1);
r = recursive_call_check(NODE_BODY(node));
if (r != 0)
- NODE_STATUS_ADD(node, NST_RECURSION);
- NODE_STATUS_REMOVE(node, NST_MARK1);
+ NODE_STATUS_ADD(node, RECURSION);
+ NODE_STATUS_REMOVE(node, MARK1);
}
if (NODE_IS_CALLED(node))
if (IS_NOT_NULL(y) && is_exclusive(x, y, reg)) {
Node* en = onig_node_new_enclosure(ENCLOSURE_STOP_BACKTRACK);
CHECK_NULL_RETURN_MEMERR(en);
- NODE_STATUS_ADD(en, NST_STOP_BT_SIMPLE_REPEAT);
+ NODE_STATUS_ADD(en, STOP_BT_SIMPLE_REPEAT);
swap_node(node, en);
NODE_BODY(node) = en;
}
if (en->type == ENCLOSURE_MEMORY) {
if (! NODE_IS_MARK1(node)) {
- NODE_STATUS_ADD(node, NST_MARK1);
+ NODE_STATUS_ADD(node, MARK1);
setup_call2_call(NODE_BODY(node));
- NODE_STATUS_REMOVE(node, NST_MARK1);
+ NODE_STATUS_REMOVE(node, MARK1);
}
}
else if (en->type == ENCLOSURE_IF_ELSE) {
case NODE_CALL:
if (! NODE_IS_MARK1(node)) {
- NODE_STATUS_ADD(node, NST_MARK1);
+ NODE_STATUS_ADD(node, MARK1);
{
CallNode* cn = CALL_(node);
Node* called = NODE_CALL_BODY(cn);
cn->entry_count++;
- NODE_STATUS_ADD(called, NST_CALLED);
+ NODE_STATUS_ADD(called, CALLED);
ENCLOSURE_(called)->m.entry_count++;
setup_call2_call(called);
}
- NODE_STATUS_REMOVE(node, NST_MARK1);
+ NODE_STATUS_REMOVE(node, MARK1);
}
break;
if (en->type == ENCLOSURE_MEMORY) {
if ((state & IN_ZERO_REPEAT) != 0) {
- NODE_STATUS_ADD(node, NST_IN_ZERO_REPEAT);
+ NODE_STATUS_ADD(node, IN_ZERO_REPEAT);
ENCLOSURE_(node)->m.entry_count--;
}
r = setup_call(NODE_BODY(node), env, state);
case NODE_CALL:
if ((state & IN_ZERO_REPEAT) != 0) {
- NODE_STATUS_ADD(node, NST_IN_ZERO_REPEAT);
+ NODE_STATUS_ADD(node, IN_ZERO_REPEAT);
CALL_(node)->entry_count--;
}
}
}
else {
- NODE_STATUS_ADD(node, NST_MARK1);
+ NODE_STATUS_ADD(node, MARK1);
en->m.called_state |= state;
setup_called_state_call(NODE_BODY(node), state);
- NODE_STATUS_REMOVE(node, NST_MARK1);
+ NODE_STATUS_REMOVE(node, MARK1);
}
}
else if (en->type == ENCLOSURE_IF_ELSE) {
Node* body = NODE_BODY(node);
if ((state & IN_REAL_REPEAT) != 0) {
- NODE_STATUS_ADD(node, NST_IN_REAL_REPEAT);
+ NODE_STATUS_ADD(node, IN_REAL_REPEAT);
}
if ((state & IN_MULTI_ENTRY) != 0) {
- NODE_STATUS_ADD(node, NST_IN_MULTI_ENTRY);
+ NODE_STATUS_ADD(node, IN_MULTI_ENTRY);
}
if (IS_REPEAT_INFINITE(qn->upper) || qn->upper >= 1) {
if (IS_REPEAT_INFINITE(tqn->upper) && tqn->lower <= 1 &&
tqn->greedy != 0) { /* (?>a*), a*+ etc... */
if (NODE_IS_SIMPLE_TYPE(NODE_BODY(target)))
- NODE_STATUS_ADD(node, NST_STOP_BT_SIMPLE_REPEAT);
+ NODE_STATUS_ADD(node, STOP_BT_SIMPLE_REPEAT);
}
}
}
node = node_new_anychar();
ct = CTYPE_(node);
ct->options = option;
- NODE_STATUS_ADD(node, NST_FIXED_OPTION);
+ NODE_STATUS_ADD(node, FIXED_OPTION);
return node;
}
BACKREF_(node)->back_num = back_num;
BACKREF_(node)->back_dynamic = (int* )NULL;
if (by_name != 0)
- NODE_STATUS_ADD(node, NST_BY_NAME);
+ NODE_STATUS_ADD(node, BY_NAME);
#ifdef USE_BACKREF_WITH_LEVEL
if (exist_level != 0) {
- NODE_STATUS_ADD(node, NST_NEST_LEVEL);
+ NODE_STATUS_ADD(node, NEST_LEVEL);
BACKREF_(node)->nest_level = nest_level;
}
#endif
for (i = 0; i < back_num; i++) {
if (backrefs[i] <= env->num_mem &&
IS_NULL(SCANENV_MEMENV(env)[backrefs[i]].node)) {
- NODE_STATUS_ADD(node, NST_RECURSION); /* /...(\1).../ */
+ NODE_STATUS_ADD(node, RECURSION); /* /...(\1).../ */
break;
}
}
env);
CHECK_NULL_RETURN(node);
- NODE_STATUS_ADD(node, NST_CHECKER);
+ NODE_STATUS_ADD(node, CHECKER);
return node;
}
QUANT_(node)->next_head_exact = NULL_NODE;
QUANT_(node)->is_refered = 0;
if (by_number != 0)
- NODE_STATUS_ADD(node, NST_BY_NUMBER);
+ NODE_STATUS_ADD(node, BY_NUMBER);
return node;
}
Node* node = node_new_enclosure(ENCLOSURE_MEMORY);
CHECK_NULL_RETURN(node);
if (is_named != 0)
- NODE_STATUS_ADD(node, NST_NAMED_GROUP);
+ NODE_STATUS_ADD(node, NAMED_GROUP);
return node;
}
if (IS_NULL(x)) goto err0;
if (is_range_cutter != 0)
- NODE_STATUS_ADD(x, NST_SUPER);
+ NODE_STATUS_ADD(x, SUPER);
*node = x;
return ONIG_NORMAL;
x = make_alt(2, ns);
if (IS_NULL(x)) goto err0;
- NODE_STATUS_ADD(x, NST_SUPER);
+ NODE_STATUS_ADD(x, SUPER);
ns[0] = save;
ns[1] = x;