Home
last modified time | relevance | path

Searched refs:refined_cr (Results 1 – 4 of 4) sorted by relevance

/dports/devel/hyperscan/hyperscan-5.4.0/src/nfagraph/
H A Dng_limex_accel.h67 const std::vector<CharReach> &refined_cr,
79 const std::vector<CharReach> &refined_cr,
H A Dng_limex_accel.cpp140 const vector<CharReach> &refined_cr, in findPaths() argument
158 const CharReach &cr = refined_cr[g[v].index]; in findPaths()
180 findPaths(g, w, refined_cr, &curr, forbidden, new_depth); in findPaths()
615 const vector<CharReach> &refined_cr, in nfaFindAccel() argument
650 findPaths(g, w, refined_cr, &paths, ignore_vert_set, in nfaFindAccel()
706 const vector<CharReach> &refined_cr, in nfaCheckAccel() argument
769 cr |= refined_cr[g[t].index]; in nfaCheckAccel()
832 *as = nfaFindAccel(g, verts, refined_cr, br_cyclic, allow_wide, true); in nfaCheckAccel()
H A Dng_misc_opt.cpp468 vector<CharReach> refined_cr(num_vertices(g), CharReach()); in reduced_cr() local
472 refined_cr[v_idx] = reduced_cr(v, g, br_cyclic); in reduced_cr()
475 return refined_cr; in reduced_cr()
/dports/devel/hyperscan/hyperscan-5.4.0/src/nfa/
H A Dlimex_compile.cpp500 vector<CharReach> refined_cr = reduced_cr(g, br_cyclic); in nfaFindAccelSchemes() local
515 if (nfaCheckAccel(g, v, refined_cr, br_cyclic, &as, allow_wide)) { in nfaFindAccelSchemes()
622 vector<CharReach> refined_cr = reduced_cr(g, br_cyclic); in fillAccelInfo() local
659 AccelScheme as = nfaFindAccel(g, states, refined_cr, br_cyclic, in fillAccelInfo()