Home
last modified time | relevance | path

Searched refs:br_cyclic (Results 1 – 6 of 6) sorted by relevance

/dports/devel/hyperscan/hyperscan-5.4.0/src/nfagraph/
H A Dng_limex_accel.h59 const std::map<NFAVertex, BoundedRepeatSummary> &br_cyclic,
68 const std::map<NFAVertex, BoundedRepeatSummary> &br_cyclic,
80 const std::map<NFAVertex, BoundedRepeatSummary> &br_cyclic,
H A Dng_misc_opt.h67 const std::map<NFAVertex, BoundedRepeatSummary> &br_cyclic);
70 const std::map<NFAVertex, BoundedRepeatSummary> &br_cyclic);
H A Dng_limex_accel.cpp99 const map<NFAVertex, BoundedRepeatSummary> &br_cyclic, in findAccelFriends() argument
113 if (contains(br_cyclic, v) && !br_cyclic.at(v).unbounded()) { in findAccelFriends()
616 const map<NFAVertex, BoundedRepeatSummary> &br_cyclic, in nfaFindAccel() argument
642 for (auto v : br_cyclic | map_keys) { in nfaFindAccel()
707 const map<NFAVertex, BoundedRepeatSummary> &br_cyclic, in nfaCheckAccel() argument
832 *as = nfaFindAccel(g, verts, refined_cr, br_cyclic, allow_wide, true); in nfaCheckAccel()
H A Dng_misc_opt.cpp395 const map<NFAVertex, BoundedRepeatSummary> &br_cyclic) { in reduced_cr() argument
428 if (contains(br_cyclic, predpred) in reduced_cr()
429 && !br_cyclic.at(predpred).unbounded()) { in reduced_cr()
466 const map<NFAVertex, BoundedRepeatSummary> &br_cyclic) { in reduced_cr() argument
472 refined_cr[v_idx] = reduced_cr(v, g, br_cyclic); in reduced_cr()
H A Dng_limex.cpp473 const map<NFAVertex, BoundedRepeatSummary> &br_cyclic, in findZombies() argument
496 if (!contains(br_cyclic, v)) { in findZombies()
500 const BoundedRepeatSummary &sum = br_cyclic.at(v); in findZombies()
658 map<NFAVertex, BoundedRepeatSummary> br_cyclic; in constructNFA() local
660 br_cyclic[br.cyclic] = BoundedRepeatSummary(br.repeatMin, br.repeatMax); in constructNFA()
675 set<NFAVertex> zombies = findZombies(*h, br_cyclic, state_ids, cc); in constructNFA()
/dports/devel/hyperscan/hyperscan-5.4.0/src/nfa/
H A Dlimex_compile.cpp170 br_cyclic[br.cyclic] = in build_info()
190 map<NFAVertex, BoundedRepeatSummary> br_cyclic; member
500 vector<CharReach> refined_cr = reduced_cr(g, br_cyclic); in nfaFindAccelSchemes()
613 const map<NFAVertex, BoundedRepeatSummary> &br_cyclic = bi.br_cyclic; in fillAccelInfo() local
617 nfaFindAccelSchemes(g, br_cyclic, &accel_map); in fillAccelInfo()
622 vector<CharReach> refined_cr = reduced_cr(g, br_cyclic); in fillAccelInfo()
698 findAccelFriends(g, v, br_cyclic, offset, &accel.friends[v]); in fillAccelInfo()
796 if (contains(args.br_cyclic, v) in getEffectiveAccelStates()
823 assert(!contains(args.br_cyclic, v) in getEffectiveAccelStates()
1656 if (contains(args.br_cyclic, v) && in cannotDie()
[all …]