Home
last modified time | relevance | path

Searched refs:NFAVertex (Results 1 – 25 of 94) sorted by relevance

1234

/dports/devel/hyperscan/hyperscan-5.4.0/unit/internal/
H A Dnfagraph_util.cpp80 NFAVertex pivot = c; in TEST()
82 unordered_map<NFAVertex, NFAVertex> lhs_map; in TEST()
83 unordered_map<NFAVertex, NFAVertex> rhs_map; in TEST()
131 NFAVertex pivot = c; in TEST()
133 unordered_map<NFAVertex, NFAVertex> lhs_map; in TEST()
134 unordered_map<NFAVertex, NFAVertex> rhs_map; in TEST()
201 vector<NFAVertex> pivots; in TEST()
206 unordered_map<NFAVertex, NFAVertex> lhs_map; in TEST()
207 unordered_map<NFAVertex, NFAVertex> rhs_map; in TEST()
283 unordered_map<NFAVertex, NFAVertex> lhs_map; in TEST()
[all …]
H A Dnfagraph_equivalence.cpp517 NFAVertex a = add_vertex(g); in TEST()
518 NFAVertex b = add_vertex(g); in TEST()
519 NFAVertex c = add_vertex(g); in TEST()
541 NFAVertex a = add_vertex(g); in TEST()
542 NFAVertex b = add_vertex(g); in TEST()
543 NFAVertex c = add_vertex(g); in TEST()
566 NFAVertex a = add_vertex(g); in TEST()
567 NFAVertex b = add_vertex(g); in TEST()
568 NFAVertex c = add_vertex(g); in TEST()
591 NFAVertex a = add_vertex(g); in TEST()
[all …]
/dports/devel/hyperscan/hyperscan-5.4.0/src/nfagraph/
H A Dng_split.h57 void splitGraph(const NGHolder &base, NFAVertex pivot, NGHolder *lhs,
58 std::unordered_map<NFAVertex, NFAVertex> *lhs_map,
60 std::unordered_map<NFAVertex, NFAVertex> *rhs_map);
62 void splitGraph(const NGHolder &base, const std::vector<NFAVertex> &pivots,
64 std::unordered_map<NFAVertex, NFAVertex> *lhs_map,
66 std::unordered_map<NFAVertex, NFAVertex> *rhs_map);
68 void splitLHS(const NGHolder &base, NFAVertex pivot, NGHolder *lhs,
69 std::unordered_map<NFAVertex, NFAVertex> *lhs_map);
71 void splitRHS(const NGHolder &base, const std::vector<NFAVertex> &pivots,
72 NGHolder *rhs, std::unordered_map<NFAVertex, NFAVertex> *rhs_map);
H A Dng_split.cpp66 unordered_map<NFAVertex, NFAVertex> *out_map) { in filterSplitMap() argument
82 unordered_map<NFAVertex, NFAVertex> *lhs_map) { in splitLHS() argument
134 NGHolder *lhs, unordered_map<NFAVertex, NFAVertex> *lhs_map) { in splitLHS() argument
142 NGHolder *rhs, unordered_map<NFAVertex, NFAVertex> *rhs_map) { in splitRHS() argument
194 set<NFAVertex> adj; in findCommonSuccessors()
195 set<NFAVertex> adj_temp; in findCommonSuccessors()
200 NFAVertex pivot = *it; in findCommonSuccessors()
214 NGHolder *lhs, unordered_map<NFAVertex, NFAVertex> *lhs_map, in splitGraph() argument
215 NGHolder *rhs, unordered_map<NFAVertex, NFAVertex> *rhs_map) { in splitGraph()
238 NGHolder *lhs, unordered_map<NFAVertex, NFAVertex> *lhs_map, in splitGraph() argument
[all …]
H A Dng_misc_opt.cpp93 NFAVertex v = *it; in findCandidates()
124 NFAVertex v = *it; in findCandidates_rev()
180 set<NFAVertex> findSustainSet(const NGHolder &g, NFAVertex p, in findSustainSet()
193 NFAVertex u = *it; in findSustainSet()
216 set<NFAVertex> findSustainSet_rev(const NGHolder &g, NFAVertex p, in findSustainSet_rev()
406 NFAVertex predpred; in reduced_cr()
441 set<NFAVertex> v_succ; in reduced_cr()
443 set<NFAVertex> p_succ; in reduced_cr()
615 bool willBeEnabledConcurrently(NFAVertex main_cyclic, NFAVertex v, in willBeEnabledConcurrently()
621 bool sometimesEnabledConcurrently(NFAVertex main_cyclic, NFAVertex v, in sometimesEnabledConcurrently()
[all …]
H A Dng_limex.cpp345 flat_set<NFAVertex> succs; in attemptToUseAsStart()
391 vector<NFAVertex> cand_starts; in reusePredsAsStarts()
476 set<NFAVertex> zombies; in findZombies()
523 vector<NFAVertex> ordering; in reverseStateOrdering()
533 [&state_ids](NFAVertex a, NFAVertex b) { in reverseStateOrdering()
587 flat_set<NFAVertex> topVerts; in prepareGraph()
645 map<u32, set<NFAVertex>> tops; in constructNFA()
738 set<NFAVertex> zombies; in constructReversedNFA_i()
794 map<u32, set<NFAVertex>> tops; in isImplementableNFA()
841 map<u32, set<NFAVertex>> tops; in countAccelStates()
[all …]
H A Dng_edge_redundancy.cpp134 set<NFAVertex> happy; in removeEdgeRedundancyNearCyclesFwd()
135 set<NFAVertex> sad; in removeEdgeRedundancyNearCyclesFwd()
197 for (NFAVertex u : happy) { in checkReportsRev()
223 set<NFAVertex> happy; in removeEdgeRedundancyNearCyclesRev()
224 set<NFAVertex> sad; in removeEdgeRedundancyNearCyclesRev()
271 const flat_set<NFAVertex> &other_parents, NFAVertex other, in parentsSubsetOf()
298 NFAVertex w = source(candidate, g); in checkFwdCandidate()
299 NFAVertex v = target(candidate, g); in checkFwdCandidate()
427 map<NFAVertex, bool> done; in removeEdgeRedundancyFwd()
428 flat_set<NFAVertex> parents_u; in removeEdgeRedundancyFwd()
[all …]
H A Dng_repeat.cpp632 void buildTugTrigger(NGHolder &g, NFAVertex cyclic, NFAVertex v, in buildTugTrigger()
1219 unordered_map<NFAVertex, NFAVertex> &vmap) { in filterMap() argument
1224 unordered_map<NFAVertex, NFAVertex> fmap; // filtered map in filterMap()
1239 unordered_map<NFAVertex, NFAVertex> &rg_map, in buildRepeatGraph() argument
1377 unordered_map<NFAVertex, NFAVertex> rg_map; in hasSoleEntry()
1382 unordered_map<NFAVertex, NFAVertex> lhs_map; in hasSoleEntry()
1441 NFAVertex step(NFAVertex v) const { in step()
1490 NFAVertex walk(NFAVertex v, vector<NFAVertex> &straw) const { in walk()
1538 NFAVertex walkStrawToCyclicRev(const NGHolder &g, NFAVertex v, in walkStrawToCyclicRev()
1550 NFAVertex walkStrawToCyclicFwd(const NGHolder &g, NFAVertex v, in walkStrawToCyclicFwd()
[all …]
H A Dng_util.h79 bool is_dot(NFAVertex v, const GraphT &g) { in is_dot()
91 template<class ContTemp = flat_set<NFAVertex>>
106 template<class ContTemp = flat_set<NFAVertex>>
117 NFAVertex getSoleDestVertex(const NGHolder &g, NFAVertex v);
120 NFAVertex getSoleSourceVertex(const NGHolder &g, NFAVertex v);
216 NFAVertex clone_vertex(NGHolder &g, NFAVertex v);
224 void clone_out_edges(NGHolder &g, NFAVertex source, NFAVertex dest);
231 void clone_in_edges(NGHolder &g, NFAVertex source, NFAVertex dest);
284 bool mustBeSetBefore(NFAVertex u, NFAVertex v, const NGHolder &g,
294 std::unordered_map<NFAVertex, NFAVertex> *v_map_out);
[all …]
H A Dng_anchored_dots.cpp101 NFAVertex vertex;
111 NFAVertex findReformable(const NGHolder &g, const set<NFAVertex> &starts, in findReformable()
138 bool isStartNode(NFAVertex v, NFAVertex start, const NGHolder &g, in isStartNode()
169 set<NFAVertex> otherV; in reformAnchoredRepeatsComponent()
383 bool isOptionalDot(NFAVertex t, NFAVertex v, const NGHolder &g) { in isOptionalDot()
405 NFAVertex start, NFAVertex initialDot, in gatherParticipants()
406 set<NFAVertex> &dots, set<NFAVertex> &succ) { in gatherParticipants()
548 set<NFAVertex> dead; in collapseVariableRepeats()
558 void addDotsBetween(NGHolder &g, NFAVertex lhs, vector<NFAVertex> &rhs, in addDotsBetween()
567 NFAVertex u = lhs; in addDotsBetween()
[all …]
H A Dng_region.cpp82 NFAVertex exit;
83 flat_set<NFAVertex> open;
89 const unordered_set<NFAVertex> &r, NFAVertex v, in checkAndAddExitCandidate()
230 unordered_set<NFAVertex> candidate; in findDagLeaders()
231 flat_set<NFAVertex> open_jumps; in findDagLeaders()
259 NFAVertex curr = *t_it; in findDagLeaders()
278 NFAVertex u = source(e, g); in mergeUnderBackEdges()
279 NFAVertex v = target(e, g); in mergeUnderBackEdges()
346 unordered_set<NFAVertex> sinks; in liftSinks()
389 NFAVertex s = *ri; in liftSinks()
[all …]
H A Dng_restructuring.cpp55 for (NFAVertex v : tops) { in wireStartToTops()
71 set<NFAVertex> start; in startIsRedundant()
81 set<NFAVertex> startDs; in startIsRedundant()
103 vector<NFAVertex> temp = getTopoOrdering(g); in getStateOrdering()
134 unordered_map<NFAVertex, u32>
136 unordered_map<NFAVertex, u32> states; in getStateIndices()
155 deque<pair<NFAVertex, NFAVertex>> candidates; in optimiseTightLoops()
159 NFAVertex v = *it; in optimiseTightLoops()
176 NFAVertex v = cand.first, u = cand.second; in optimiseTightLoops()
193 unordered_map<NFAVertex, u32>
[all …]
H A Dng_squash.cpp124 using PostDomTree = unordered_map<NFAVertex, unordered_set<NFAVertex>>;
160 vector<NFAVertex> q; in buildSquashMask()
170 NFAVertex u = q.back(); in buildSquashMask()
282 deque<NFAVertex> remaining; in findDerivedSquashers()
331 NFAVertex a = it->first; in clearMutualSquashers()
400 NFAVertex v = vByIndex[i]; in findSquashers()
543 NFAVertex u = rev[sq]; in filterSquashers()
606 NFAVertex u = source(e, g); in removeEdgesToAccept()
639 vector<NFAVertex> unreach; in findUnreachable()
654 set<NFAVertex> verts; in findHighlanderSquashers()
[all …]
H A Dng_util.cpp63 NFAVertex getSoleDestVertex(const NGHolder &g, NFAVertex a) { in getSoleDestVertex()
90 NFAVertex getSoleSourceVertex(const NGHolder &g, NFAVertex a) { in getSoleSourceVertex()
117 NFAVertex clone_vertex(NGHolder &g, NFAVertex v) { in clone_vertex()
126 void clone_out_edges(NGHolder &g, NFAVertex source, NFAVertex dest) { in clone_out_edges()
139 void clone_in_edges(NGHolder &g, NFAVertex s, NFAVertex dest) { in clone_in_edges()
359 set<NFAVertex> s; in mustBeSetBefore_int()
379 bool mustBeSetBefore(NFAVertex u, NFAVertex v, const NGHolder &g, in mustBeSetBefore()
499 unordered_map<NFAVertex, NFAVertex> *v_map_out) { in fillHolder() argument
501 unordered_map<NFAVertex, NFAVertex> &v_map = *v_map_out; in fillHolder()
583 unordered_map<NFAVertex, NFAVertex> *mapping) { in cloneHolder() argument
[all …]
H A Dng_region.h46 std::unordered_map<NFAVertex, u32> assignRegions(const NGHolder &g);
50 bool inSameRegion(const Graph &g, NFAVertex a, NFAVertex b, in inSameRegion()
51 const std::unordered_map<NFAVertex, u32> &region_map) { in inSameRegion() argument
60 bool inLaterRegion(const Graph &g, NFAVertex a, NFAVertex b, in inLaterRegion()
61 const std::unordered_map<NFAVertex, u32> &region_map) { in inLaterRegion() argument
87 bool inEarlierRegion(const Graph &g, NFAVertex a, NFAVertex b, in inEarlierRegion()
114 bool isRegionEntry(const Graph &g, NFAVertex v, in isRegionEntry()
129 bool isRegionExit(const Graph &g, NFAVertex v, in isRegionExit()
130 const std::unordered_map<NFAVertex, u32> &region_map) { in isRegionExit() argument
142 bool isSingletonRegion(const Graph &g, NFAVertex v, in isSingletonRegion()
[all …]
H A Dng_fuzzy.cpp51 flat_set<NFAVertex> cur, next; in gatherSuccessorsByDepth()
98 flat_set<NFAVertex> cur, next; in gatherPredecessorsByDepth()
148 map<pair<NFAVertex, u32>, NFAVertex> shadow_map;
149 map<pair<NFAVertex, u32>, NFAVertex> helper_map;
150 map<NFAVertex, NFAVertex> clones;
152 vector<pair<NFAVertex, NFAVertex>> edges_to_be_added;
153 flat_set<NFAVertex> orig;
192 const NFAVertex& get_clone(const NFAVertex &v) { in get_clone()
197 void connect_to_clones(const NFAVertex &u, const NFAVertex &v) { in connect_to_clones()
393 void connect_removals(NFAVertex v) { in connect_removals()
[all …]
H A Dng_execute.h47 flat_set<NFAVertex> execute_graph(const NGHolder &g, const ue2_literal &input,
48 const flat_set<NFAVertex> &initial,
51 flat_set<NFAVertex> execute_graph(const NGHolder &g,
53 const flat_set<NFAVertex> &initial);
59 flat_set<NFAVertex> execute_graph(const NGHolder &g, const NGHolder &input_dag,
60 const flat_set<NFAVertex> &initial);
63 flat_set<NFAVertex> execute_graph(const NGHolder &g, const NGHolder &input_dag,
64 const flat_set<NFAVertex> &input_start_states,
65 const flat_set<NFAVertex> &initial);
H A Dng_som_util.cpp57 unordered_map<NFAVertex, NFAVertex> vmap; // vertex in g_orig to vertex in g in getDistancesFromSOM()
60 vector<NFAVertex> vstarts; in getDistancesFromSOM()
89 NFAVertex v_new = vmap[v_orig]; in getDistancesFromSOM()
139 flat_set<NFAVertex> states; in firstMatchIsFirst()
207 NFAVertex s = source(e, g); in somMayGoBackwards()
208 NFAVertex t = target(e, g); in somMayGoBackwards()
218 unordered_map<NFAVertex, NFAVertex> orig_to_copy; in somMayGoBackwards()
236 NFAVertex c_u = orig_to_copy[u]; in somMayGoBackwards()
246 set<NFAVertex> u_succ; in somMayGoBackwards()
271 NFAVertex s = source(e, c_g); in somMayGoBackwards()
[all …]
H A Dng_redundancy.cpp115 VertexInfo &operator[](NFAVertex v) { in operator []()
192 void succPredIntersection(const NFAVertex v, const flat_set<NFAVertex> &predSet, in succPredIntersection()
197 const flat_set<NFAVertex> *best = nullptr; in succPredIntersection()
240 void predSuccIntersection(const NFAVertex v, in predSuccIntersection()
246 const flat_set<NFAVertex> *best = nullptr; in predSuccIntersection()
290 set<NFAVertex> &removable) { in markForRemoval()
637 NFAVertex start = source(e, g); in reversePathReachSubset()
666 NFAVertex start = target(e, g); in forwardPathReachSubset()
758 NFAVertex dom = dominators[v]; in findCyclicDom()
802 NFAVertex postdom = postdominators[v]; in findCyclicPostDom()
[all …]
H A Dng_limex_accel.h58 void findAccelFriends(const NGHolder &g, NFAVertex v,
59 const std::map<NFAVertex, BoundedRepeatSummary> &br_cyclic,
60 u32 offset, flat_set<NFAVertex> *friends);
64 NFAVertex get_sds_or_proxy(const NGHolder &g);
66 AccelScheme nfaFindAccel(const NGHolder &g, const std::vector<NFAVertex> &verts,
68 const std::map<NFAVertex, BoundedRepeatSummary> &br_cyclic,
78 bool nfaCheckAccel(const NGHolder &g, NFAVertex v,
80 const std::map<NFAVertex, BoundedRepeatSummary> &br_cyclic,
H A Dng_builder.cpp91 pair<NFAEdge, bool> addEdge(NFAVertex u, NFAVertex v);
107 vector<NFAVertex> id2vertex;
135 const NFAVertex v = id2vertex[pos]; in getVertex()
147 NFAVertex v = add_vertex(*graph); in addVertex()
174 NFAVertex v = getVertex(pos); in setNodeReportID()
181 NFAVertex v = getVertex(pos); in addCharReach()
186 NFAVertex v = getVertex(pos); in setAssertFlag()
191 NFAVertex v = getVertex(pos); in getAssertFlag()
195 pair<NFAEdge, bool> NFABuilderImpl::addEdge(NFAVertex u, NFAVertex v) { in addEdge()
207 NFAVertex u = getVertex(startPos); in addEdge()
[all …]
H A Dng_execute.cpp62 NFAVertex vertex;
82 NFAVertex u = info[i].vertex; in step()
139 flat_set<NFAVertex> getVertices(const dynamic_bitset<> &in, in getVertices()
141 flat_set<NFAVertex> out; in getVertices()
173 flat_set<NFAVertex> execute_graph(const NGHolder &g, in execute_graph()
191 map<NFAVertex, dynamic_bitset<> > &states_in) in eg_visitor() argument
196 void finish_vertex(NFAVertex input_v, in finish_vertex()
279 flat_set<NFAVertex> execute_graph(const NGHolder &running_g, in execute_graph()
288 map<NFAVertex, boost::default_color_type> colours; in execute_graph()
292 map<NFAVertex, dynamic_bitset<> > dfs_states; in execute_graph()
[all …]
H A Dng_asserts.cpp104 void addToSplit(const NGHolder &g, NFAVertex v, map<u32, NFAVertex> *to_split) { in addToSplit()
118 NFAVertex u = source(e, g); in findSplitters()
119 NFAVertex v = target(e, g); in findSplitters()
189 NFAVertex v, s32 adj) { in setReportId()
264 NFAVertex u = source(e, g); in resolveEdges()
265 NFAVertex v = target(e, g); in resolveEdges()
505 NFAVertex v_a = add_vertex(g); in ensureCodePointStart()
510 NFAVertex v_2 = add_vertex(g); in ensureCodePointStart()
514 NFAVertex v_3 = add_vertex(g); in ensureCodePointStart()
518 NFAVertex v_4 = add_vertex(g); in ensureCodePointStart()
[all …]
H A Dng_utf8.cpp49 void allowIllegal(NGHolder &g, NFAVertex v, u8 pred_char) { in allowIllegal()
104 bool hasPredInSet(const NGHolder &g, NFAVertex v, const set<NFAVertex> &s) { in hasPredInSet()
114 bool hasSuccInSet(const NGHolder &g, NFAVertex v, const set<NFAVertex> &s) { in hasSuccInSet()
160 set<NFAVertex> already_seeds; /* already marked as seeds */ in findSeeds()
187 bool expandCyclic(NGHolder &h, NFAVertex v) { in expandCyclic()
194 set<NFAVertex> start_siblings; in expandCyclic()
195 set<NFAVertex> end_siblings; in expandCyclic()
234 NFAVertex m = *adjacent_vertices(s, h).first; in expandCyclic()
246 NFAVertex m1 = *adjacent_vertices(s, h).first; in expandCyclic()
253 NFAVertex m2 = *adjacent_vertices(m1, h).first; in expandCyclic()
[all …]
/dports/devel/hyperscan/hyperscan-5.4.0/src/nfa/
H A Dlimex_compile.h73 const std::unordered_map<NFAVertex, u32> &states,
75 const std::unordered_map<NFAVertex, NFAStateSet> &reportSquashMap,
76 const std::unordered_map<NFAVertex, NFAStateSet> &squashMap,
77 const std::map<u32, std::set<NFAVertex>> &tops,
78 const std::set<NFAVertex> &zombies,
92 const std::unordered_map<NFAVertex, u32> &states,
94 const std::unordered_map<NFAVertex, NFAStateSet> &reportSquashMap,
95 const std::unordered_map<NFAVertex, NFAStateSet> &squashMap,
96 const std::map<u32, std::set<NFAVertex>> &tops,
97 const std::set<NFAVertex> &zombies,

1234