Lines Matching refs:err
125 static re_dfastate_t *find_recover_state (reg_errcode_t *err,
127 static re_dfastate_t *transit_state (reg_errcode_t *err,
130 static re_dfastate_t *merge_state_with_log (reg_errcode_t *err,
138 static re_dfastate_t *transit_state_sb (reg_errcode_t *err,
229 reg_errcode_t err;
249 err = re_search_internal (preg, string, length, start, length - start,
252 err = re_search_internal (preg, string, length, start, length - start,
255 return err != REG_NOERROR;
631 reg_errcode_t err;
681 err = re_string_allocate (&mctx.input, string, length, dfa->nodes_len + 1,
683 if (BE (err != REG_NOERROR, 0))
689 err = match_ctx_init (&mctx, eflags, dfa->nbackref * 2);
690 if (BE (err != REG_NOERROR, 0))
702 err = REG_ESPACE;
727 err = REG_NOMATCH;
791 err = re_string_reconstruct (&mctx.input, match_first,
793 if (BE (err != REG_NOERROR, 0))
807 err = REG_NOMATCH;
816 err = re_string_reconstruct (&mctx.input, match_first, eflags);
817 if (BE (err != REG_NOERROR, 0))
836 err = REG_ESPACE;
851 err = prune_impossible_nodes (&mctx);
852 if (err == REG_NOERROR)
854 if (BE (err != REG_NOMATCH, 0))
868 assert (err == REG_NOERROR);
886 err = set_regs (preg, &mctx, nmatch, pmatch,
888 if (BE (err != REG_NOERROR, 0))
938 return err;
1034 acquire_init_state_context (reg_errcode_t *err, const re_match_context_t *mctx,
1053 return re_acquire_state_context (err, dfa,
1080 reg_errcode_t err;
1088 err = REG_NOERROR;
1089 cur_state = acquire_init_state_context (&err, mctx, cur_str_idx);
1093 assert (err == REG_ESPACE);
1106 err = check_subexp_matching_top (mctx, &cur_state->nodes, 0);
1107 if (BE (err != REG_NOERROR, 0))
1108 return err;
1112 err = transit_state_bkref (mctx, &cur_state->nodes);
1113 if (BE (err != REG_NOERROR, 0))
1114 return err;
1144 err = extend_buffers (mctx);
1145 if (BE (err != REG_NOERROR, 0))
1147 assert (err == REG_ESPACE);
1152 cur_state = transit_state (&err, mctx, cur_state);
1154 cur_state = merge_state_with_log (&err, mctx, cur_state);
1161 if (BE (err != REG_NOERROR, 0))
1166 || (cur_state = find_recover_state (&err, mctx)) == NULL)
1254 int i, err;
1260 err = re_node_set_insert (eps_via_nodes, node);
1261 if (BE (err < 0, 0))
1321 err = re_node_set_insert (eps_via_nodes, node);
1322 if (BE (err < 0, 0))
1352 reg_errcode_t err;
1370 err = re_node_set_init_copy (&fs->stack[num].eps_via_nodes, eps_via_nodes);
1371 return err;
1594 reg_errcode_t err;
1605 err = re_node_set_init_1 (&cur_dest, sctx->last_node);
1606 if (BE (err != REG_NOERROR, 0))
1607 return err;
1608 err = update_cur_sifted_state (mctx, sctx, str_idx, &cur_dest);
1609 if (BE (err != REG_NOERROR, 0))
1629 err = build_sifted_states (mctx, sctx, str_idx, &cur_dest);
1630 if (BE (err != REG_NOERROR, 0))
1638 err = update_cur_sifted_state (mctx, sctx, str_idx, &cur_dest);
1639 if (BE (err != REG_NOERROR, 0))
1642 err = REG_NOERROR;
1645 return err;
1720 reg_errcode_t err;
1721 err = extend_buffers (mctx);
1722 if (BE (err != REG_NOERROR, 0))
1723 return err;
1741 reg_errcode_t err;
1749 err = re_node_set_init_union (&merged_set, &dst[st_idx]->nodes,
1751 if (BE (err != REG_NOERROR, 0))
1752 return err;
1753 dst[st_idx] = re_acquire_state (&err, dfa, &merged_set);
1755 if (BE (err != REG_NOERROR, 0))
1756 return err;
1769 reg_errcode_t err = REG_NOERROR;
1782 err = add_epsilon_src_nodes (dfa, dest_nodes, candidates);
1783 if (BE (err != REG_NOERROR, 0))
1784 return err;
1789 err = check_subexp_limits (dfa, dest_nodes, candidates, &sctx->limits,
1791 if (BE (err != REG_NOERROR, 0))
1792 return err;
1796 sctx->sifted_states[str_idx] = re_acquire_state (&err, dfa, dest_nodes);
1797 if (BE (err != REG_NOERROR, 0))
1798 return err;
1803 err = sift_states_bkref (mctx, sctx, str_idx, candidates);
1804 if (BE (err != REG_NOERROR, 0))
1805 return err;
1815 reg_errcode_t err = REG_NOERROR;
1818 re_dfastate_t *state = re_acquire_state (&err, dfa, dest_nodes);
1819 if (BE (err != REG_NOERROR, 0))
1820 return err;
1824 err = re_node_set_alloc (&state->inveclosure, dest_nodes->nelem);
1825 if (BE (err != REG_NOERROR, 0))
1841 reg_errcode_t err;
1861 err = re_node_set_add_intersect (&except_nodes, candidates,
1863 if (BE (err != REG_NOERROR, 0))
1866 return err;
2037 reg_errcode_t err;
2070 err = sub_epsilon_src_nodes (dfa, ops_node, dest_nodes,
2072 if (BE (err != REG_NOERROR, 0))
2073 return err;
2088 err = sub_epsilon_src_nodes (dfa, node, dest_nodes,
2090 if (BE (err != REG_NOERROR, 0))
2091 return err;
2108 err = sub_epsilon_src_nodes (dfa, node, dest_nodes,
2110 if (BE (err != REG_NOERROR, 0))
2111 return err;
2125 reg_errcode_t err;
2175 err = re_node_set_init_copy (&local_sctx.limits, &sctx->limits);
2176 if (BE (err != REG_NOERROR, 0))
2184 err = REG_ESPACE;
2188 err = sift_states_backward (mctx, &local_sctx);
2189 if (BE (err != REG_NOERROR, 0))
2193 err = merge_state_array (dfa, sctx->limited_states,
2196 if (BE (err != REG_NOERROR, 0))
2207 err = REG_NOERROR;
2214 return err;
2252 transit_state (reg_errcode_t *err, re_match_context_t *mctx,
2262 *err = transit_state_mb (mctx, state);
2263 if (BE (*err != REG_NOERROR, 0))
2272 return transit_state_sb (err, mctx, state);
2299 *err = REG_ESPACE;
2310 merge_state_with_log (reg_errcode_t *err, re_match_context_t *mctx,
2339 *err = re_node_set_init_union (&next_nodes, table_nodes,
2341 if (BE (*err != REG_NOERROR, 0))
2353 = re_acquire_state_context (err, dfa, &next_nodes, context);
2366 *err = check_subexp_matching_top (mctx, &next_state->nodes,
2368 if (BE (*err != REG_NOERROR, 0))
2374 *err = transit_state_bkref (mctx, &next_state->nodes);
2375 if (BE (*err != REG_NOERROR, 0))
2389 find_recover_state (reg_errcode_t *err, re_match_context_t *mctx)
2405 cur_state = merge_state_with_log (err, mctx, NULL);
2407 while (*err == REG_NOERROR && cur_state == NULL);
2425 reg_errcode_t err;
2440 err = match_ctx_add_subtop (mctx, node, str_idx);
2441 if (BE (err != REG_NOERROR, 0))
2442 return err;
2453 transit_state_sb (reg_errcode_t *err, re_match_context_t *mctx,
2462 *err = re_node_set_alloc (&next_nodes, state->nodes.nelem + 1);
2463 if (BE (*err != REG_NOERROR, 0))
2470 *err = re_node_set_merge (&next_nodes,
2472 if (BE (*err != REG_NOERROR, 0))
2480 next_state = re_acquire_state_context (err, dfa, &next_nodes, context);
2496 reg_errcode_t err;
2530 err = clean_state_log_if_needed (mctx, dest_idx);
2531 if (BE (err != REG_NOERROR, 0))
2532 return err;
2543 err = re_node_set_init_union (&dest_nodes,
2545 if (BE (err != REG_NOERROR, 0))
2546 return err;
2551 = re_acquire_state_context (&err, dfa, &dest_nodes, context);
2554 if (BE (mctx->state_log[dest_idx] == NULL && err != REG_NOERROR, 0))
2555 return err;
2566 reg_errcode_t err;
2593 err = get_subexp (mctx, node_idx, cur_str_idx);
2594 if (BE (err != REG_NOERROR, 0))
2625 = re_acquire_state_context (&err, dfa, new_dest_nodes,
2628 && err != REG_NOERROR, 0))
2634 err = re_node_set_init_union (&dest_nodes,
2637 if (BE (err != REG_NOERROR, 0))
2643 = re_acquire_state_context (&err, dfa, &dest_nodes, context);
2646 && err != REG_NOERROR, 0))
2654 err = check_subexp_matching_top (mctx, new_dest_nodes,
2656 if (BE (err != REG_NOERROR, 0))
2658 err = transit_state_bkref (mctx, new_dest_nodes);
2659 if (BE (err != REG_NOERROR, 0))
2664 err = REG_NOERROR;
2666 return err;
2699 reg_errcode_t err;
2726 err = clean_state_log_if_needed (mctx,
2729 if (BE (err != REG_NOERROR, 0))
2730 return err;
2739 err = get_subexp_sub (mctx, sub_top, sub_last, bkref_node,
2746 if (err == REG_NOMATCH)
2748 if (BE (err != REG_NOERROR, 0))
2749 return err;
2772 err = extend_buffers (mctx);
2773 if (BE (err != REG_NOERROR, 0))
2774 return err;
2799 err = check_arrival (mctx, sub_top->path, sub_top->node,
2802 if (err == REG_NOMATCH)
2804 if (BE (err != REG_NOERROR, 0))
2805 return err;
2809 err = get_subexp_sub (mctx, sub_top, sub_last, bkref_node,
2811 if (err == REG_NOMATCH)
2829 reg_errcode_t err;
2832 err = check_arrival (mctx, &sub_last->path, sub_last->node,
2835 if (err != REG_NOERROR)
2836 return err;
2837 err = match_ctx_add_entry (mctx, bkref_node, bkref_str, sub_top->str_idx,
2839 if (BE (err != REG_NOERROR, 0))
2840 return err;
2881 reg_errcode_t err = REG_NOERROR;
2918 err = re_node_set_init_1 (&next_nodes, top_node);
2919 if (BE (err != REG_NOERROR, 0))
2920 return err;
2921 err = check_arrival_expand_ecl (dfa, &next_nodes, subexp_num, type);
2922 if (BE (err != REG_NOERROR, 0))
2925 return err;
2933 err = re_node_set_init_copy (&next_nodes, &cur_state->nodes);
2934 if (BE (err != REG_NOERROR, 0))
2935 return err;
2944 err = expand_bkref_cache (mctx, &next_nodes, str_idx,
2946 if (BE (err != REG_NOERROR, 0))
2949 return err;
2952 cur_state = re_acquire_state_context (&err, dfa, &next_nodes, context);
2953 if (BE (cur_state == NULL && err != REG_NOERROR, 0))
2956 return err;
2966 err = re_node_set_merge (&next_nodes,
2968 if (BE (err != REG_NOERROR, 0))
2971 return err;
2976 err = check_arrival_add_next_nodes (mctx, str_idx,
2979 if (BE (err != REG_NOERROR, 0))
2982 return err;
2988 err = check_arrival_expand_ecl (dfa, &next_nodes, subexp_num, type);
2989 if (BE (err != REG_NOERROR, 0))
2992 return err;
2994 err = expand_bkref_cache (mctx, &next_nodes, str_idx,
2996 if (BE (err != REG_NOERROR, 0))
2999 return err;
3003 cur_state = re_acquire_state_context (&err, dfa, &next_nodes, context);
3004 if (BE (cur_state == NULL && err != REG_NOERROR, 0))
3007 return err;
3044 reg_errcode_t err = REG_NOERROR;
3070 err = re_node_set_merge (&union_set, &dest_state->nodes);
3071 if (BE (err != REG_NOERROR, 0))
3074 return err;
3083 mctx->state_log[next_idx] = re_acquire_state (&err, dfa,
3086 && err != REG_NOERROR, 0))
3089 return err;
3120 reg_errcode_t err;
3126 err = re_node_set_alloc (&new_nodes, cur_nodes->nelem);
3127 if (BE (err != REG_NOERROR, 0))
3128 return err;
3140 err = re_node_set_merge (&new_nodes, eclosure);
3141 if (BE (err != REG_NOERROR, 0))
3144 return err;
3150 err = check_arrival_expand_ecl_sub (dfa, &new_nodes, cur_node,
3152 if (BE (err != REG_NOERROR, 0))
3155 return err;
3176 int err;
3183 err = re_node_set_insert (dst_nodes, cur_node);
3184 if (BE (err == -1, 0))
3189 err = re_node_set_insert (dst_nodes, cur_node);
3190 if (BE (err == -1, 0))
3196 err = check_arrival_expand_ecl_sub (dfa, dst_nodes,
3199 if (BE (err != REG_NOERROR, 0))
3200 return err;
3218 reg_errcode_t err;
3247 err = re_node_set_init_1 (&new_dests, next_node);
3251 if (BE (err != REG_NOERROR || err2 != REG_NOERROR
3254 err = (err != REG_NOERROR ? err
3256 return err;
3271 err = re_node_set_init_copy (&union_set,
3274 if (BE (err != REG_NOERROR || ret < 0, 0))
3277 err = err != REG_NOERROR ? err : REG_ESPACE;
3278 return err;
3283 err = re_node_set_init_1 (&union_set, next_node);
3284 if (BE (err != REG_NOERROR, 0))
3285 return err;
3287 mctx->state_log[to_idx] = re_acquire_state (&err, dfa, &union_set);
3290 && err != REG_NOERROR, 0))
3291 return err;
3305 reg_errcode_t err;
3359 err = re_node_set_alloc (&follows, ndests + 1);
3360 if (BE (err != REG_NOERROR, 0))
3400 err = re_node_set_merge (&follows, dfa->eclosures + next_node);
3401 if (BE (err != REG_NOERROR, 0))
3405 dest_states[i] = re_acquire_state_context (&err, dfa, &follows, 0);
3406 if (BE (dest_states[i] == NULL && err != REG_NOERROR, 0))
3412 dest_states_word[i] = re_acquire_state_context (&err, dfa, &follows,
3414 if (BE (dest_states_word[i] == NULL && err != REG_NOERROR, 0))
3420 dest_states_nl[i] = re_acquire_state_context (&err, dfa, &follows,
3422 if (BE (dest_states_nl[i] == NULL && err != REG_NOERROR, 0))
3533 reg_errcode_t err;
3676 err = re_node_set_init_copy (dests_node + ndests, &dests_node[j]);
3677 if (BE (err != REG_NOERROR, 0))
3695 err = re_node_set_init_1 (dests_node + ndests, cur_nodes->elems[i]);
3696 if (BE (err != REG_NOERROR, 0))