Lines Matching refs:REG_MISSING
1377 if (BE (node->node_idx == REG_MISSING, 0))
1489 if (BE (clone_dest == REG_MISSING, 0))
1523 if (BE (clone_dest == REG_MISSING, 0))
1537 if (clone_dest == REG_MISSING)
1542 if (BE (clone_dest == REG_MISSING, 0))
1563 if (BE (clone_dest == REG_MISSING, 0))
1589 return REG_MISSING; /* Not found. */
1593 Return the index of the new node, or REG_MISSING if insufficient storage is
1600 if (BE (dup_idx != REG_MISSING, 1))
1659 assert (dfa->eclosures[node_idx].nelem != REG_MISSING);
1696 dfa->eclosures[node].nelem = REG_MISSING;
1718 if (dfa->eclosures[edest].nelem == REG_MISSING)
2490 if (start == REG_MISSING)
2529 if (BE (end != REG_MISSING && start > end, 0))
2539 end = (token->type == OP_DUP_QUESTION) ? 1 : REG_MISSING;
2578 (end == REG_MISSING ? OP_DUP_ASTERISK : OP_ALT));
2582 /* This loop is actually executed only when end != REG_MISSING,
2585 if ((Idx) -1 < 0 || end != REG_MISSING)
3693 Return REG_MISSING if the number field is empty like "{,1}".
3699 Idx num = REG_MISSING;
3712 : ((num == REG_MISSING) ? c - '0' : num * 10 + c - '0'));
3774 tree->node_idx = REG_MISSING;
