REG_MISSING      1377 lib/regcomp.c        if (BE (node->node_idx == REG_MISSING, 0))
REG_MISSING      1489 lib/regcomp.c  	  if (BE (clone_dest == REG_MISSING, 0))
REG_MISSING      1522 lib/regcomp.c  	  if (BE (clone_dest == REG_MISSING, 0))
REG_MISSING      1536 lib/regcomp.c  	  if (clone_dest == REG_MISSING)
REG_MISSING      1541 lib/regcomp.c  	      if (BE (clone_dest == REG_MISSING, 0))
REG_MISSING      1562 lib/regcomp.c  	  if (BE (clone_dest == REG_MISSING, 0))
REG_MISSING      1588 lib/regcomp.c    return REG_MISSING; /* Not found.  */
REG_MISSING      1599 lib/regcomp.c    if (BE (dup_idx != REG_MISSING, 1))
REG_MISSING      1658 lib/regcomp.c        assert (dfa->eclosures[node_idx].nelem != REG_MISSING);
REG_MISSING      1694 lib/regcomp.c    dfa->eclosures[node].nelem = REG_MISSING;
REG_MISSING      1716 lib/regcomp.c  	if (dfa->eclosures[edest].nelem == REG_MISSING)
REG_MISSING      2488 lib/regcomp.c        if (start == REG_MISSING)
REG_MISSING      2527 lib/regcomp.c        if (BE ((end != REG_MISSING && start > end)
REG_MISSING      2538 lib/regcomp.c        end = (token->type == OP_DUP_QUESTION) ? 1 : REG_MISSING;
REG_MISSING      2577 lib/regcomp.c  		      (end == REG_MISSING ? OP_DUP_ASTERISK : OP_ALT));
REG_MISSING      2588 lib/regcomp.c    if (TYPE_SIGNED (Idx) || end != REG_MISSING)
REG_MISSING      3718 lib/regcomp.c    Idx num = REG_MISSING;
REG_MISSING      3731 lib/regcomp.c  	     : ((num == REG_MISSING) ? c - '0' : num * 10 + c - '0'));
REG_MISSING      3791 lib/regcomp.c    tree->node_idx = REG_MISSING;
REG_MISSING      1429 lib/regex_internal.c 	return REG_MISSING;
REG_MISSING      1433 lib/regex_internal.c 	return REG_MISSING;
REG_MISSING      1441 lib/regex_internal.c 	return REG_MISSING;
REG_MISSING      1457 lib/regex_internal.c   dfa->nexts[dfa->nodes_len] = REG_MISSING;
REG_MISSING       663 lib/regexec.c    Idx match_last = REG_MISSING;
REG_MISSING       871 lib/regexec.c        if (match_last != REG_MISSING)
REG_MISSING       895 lib/regexec.c  		  match_last = REG_MISSING;
REG_MISSING       906 lib/regexec.c    assert (match_last != REG_MISSING);
REG_MISSING      1129 lib/regexec.c    Idx match_last = REG_MISSING;
REG_MISSING      1313 lib/regexec.c        for (dest_node = REG_MISSING, i = 0; i < edests->nelem; ++i)
REG_MISSING      1318 lib/regexec.c            if (dest_node == REG_MISSING)
REG_MISSING      1357 lib/regexec.c  		return REG_MISSING;
REG_MISSING      1363 lib/regexec.c  		    return REG_MISSING;
REG_MISSING      1388 lib/regexec.c  	    return REG_MISSING;
REG_MISSING      1393 lib/regexec.c    return REG_MISSING;
REG_MISSING      1907 lib/regexec.c  			 ? dfa->edests[cur_node].elems[1] : REG_MISSING);
REG_MISSING      1990 lib/regexec.c  	  if (bkref_idx != REG_MISSING)
REG_MISSING      2106 lib/regexec.c  	  Idx ops_node = REG_MISSING;
REG_MISSING      2107 lib/regexec.c  	  Idx cls_node = REG_MISSING;
REG_MISSING      2184 lib/regexec.c    if (first_idx == REG_MISSING)
REG_MISSING      2588 lib/regexec.c        assert (dfa->nexts[cur_node_idx] != REG_MISSING);
REG_MISSING      2654 lib/regexec.c        assert (dfa->nexts[node_idx] != REG_MISSING);
REG_MISSING      2738 lib/regexec.c    if (cache_idx != REG_MISSING)
REG_MISSING      2843 lib/regexec.c  	  if (cls_node == REG_MISSING)
REG_MISSING      2922 lib/regexec.c    return REG_MISSING;
REG_MISSING      3195 lib/regexec.c        if (outside_node == REG_MISSING)
REG_MISSING      3281 lib/regexec.c    if (cache_idx_start == REG_MISSING)
REG_MISSING      3467 lib/regexec.c  	  if (next_node != REG_MISSING)
REG_MISSING      3778 lib/regexec.c    return REG_MISSING;
REG_MISSING      4213 lib/regexec.c    mctx->match_last = REG_MISSING;
REG_MISSING      4354 lib/regexec.c      return REG_MISSING;