Home
last modified time | relevance | path

Searched refs:acceptEod (Results 1 – 25 of 59) sorted by relevance

123

/dports/devel/hyperscan/hyperscan-5.4.0/src/nfagraph/
H A Dng_vacuous.cpp71 remove_edge(g.start, g.acceptEod, g); in makeFirehose()
73 remove_edge(g.startDs, g.acceptEod, g); in makeFirehose()
89 remove_edge(g.start, g.acceptEod, g); in makeAnchoredAcceptor()
97 remove_edge(g.startDs, g.acceptEod, g); in makeEndAnchoredAcceptor()
98 remove_edge(g.start, g.acceptEod, g); in makeEndAnchoredAcceptor()
107 remove_edge(g.start, g.acceptEod, g); in makeNothingAcceptor()
128 if (edge(g.startDs, g.acceptEod, g).second) { in splitOffVacuous()
134 if (edge(g.start, g.acceptEod, g).second) { in splitOffVacuous()
H A Dng_holder.cpp51 acceptEod(addSpecialVertex(*this, NODE_ACCEPT_EOD)) { in NGHolder()
56 add_edge(accept, acceptEod, *this); in NGHolder()
85 add_edge(h.accept, h.acceptEod, h); in clear_graph()
93 case NODE_ACCEPT_EOD: return acceptEod; in getSpecialVertex()
H A Dng_prune.cpp61 if (in_degree(g.acceptEod, g) == 1 && !in_degree(g.accept, g) in pruneUnreachable()
62 && edge(g.accept, g.acceptEod, g).second) { in pruneUnreachable()
78 depth_first_visit(revg, g.acceptEod, in pruneUnreachable()
146 g.acceptEod, colors); in pruneUseless()
280 for (auto v : inv_adjacent_vertices_range(g.acceptEod, g)) { in pruneHighlanderDominated()
324 remove_edge(v, g.acceptEod, g); in pruneHighlanderDominated()
367 for (const auto &e : in_edges_range(g.acceptEod, g)) { in pruneReport()
409 for (const auto &e : in_edges_range(g.acceptEod, g)) { in pruneAllOtherReports()
H A Dng_util.cpp175 || edge(h.start, h.acceptEod, h).second in isVacuous()
177 || edge(h.startDs, h.acceptEod, h).second; in isVacuous()
248 assert(edge(g.accept, g.acceptEod, g).second); in can_never_match()
258 if (in_degree(h.acceptEod, h) > 1) { in can_match_at_eod()
408 assert(in_degree(h.acceptEod, h) == 1); in appendLiteral()
550 out_mapping[NODE_ACCEPT_EOD] = out.acceptEod; in cloneHolder()
613 NFAVertex start = vertexMap[g_in.acceptEod]; in reverseHolder()
616 NFAVertex acceptEod = vertexMap[g_in.start]; in reverseHolder() local
635 add_edge(u, g.acceptEod, g[e], g); in reverseHolder()
645 clear_vertex(acceptEod, g); in reverseHolder()
[all …]
H A Dng_asserts.cpp146 && v != g.acceptEod) { /* eod is always considered a nonword */ in findSplitters()
168 if (v == g.acceptEod /* eod is always considered a nonword */ in findSplitters()
229 assert(v != g.acceptEod); in splitVertex()
316 if ((v_cr & CHARREACH_NONWORD).none() && v != g.acceptEod) { in resolveEdges()
322 if ((v_cr & CHARREACH_WORD).none() || v == g.acceptEod) { in resolveEdges()
329 && v != g.acceptEod) { in resolveEdges()
336 || v == g.acceptEod) { in resolveEdges()
387 if (NFAEdge start_eod = edge(u, g.acceptEod, g)) { in resolveEdges()
391 add_edge(u, g.acceptEod, g[e], g); in resolveEdges()
440 if (NFAEdge start_eod = edge(u, g.acceptEod, g)) { in resolveEdges()
[all …]
H A Dng_mcclellan.cpp193 StateSet *accept, StateSet *acceptEod) { in populateAccepts() argument
200 for (auto v : inv_adjacent_vertices_range(g.acceptEod, g)) { in populateAccepts()
207 acceptEod->set(g[v].index); in populateAccepts()
238 for (auto v : inv_adjacent_vertices_range(g.acceptEod, g)) { in canPruneEdgesFromAccept()
359 acceptEod(Automaton_Traits::init_states(numStates)), in Automaton_Base()
364 populateAccepts(graph, unused, &accept, &acceptEod); in Automaton_Base()
411 StateSet acc = in & (eod ? acceptEod : accept); in reports_i()
448 StateSet acceptEod; member in ue2::__anonfd42d9600111::Automaton_Base
H A Dng_reports.cpp50 for (auto v : inv_adjacent_vertices_range(g.acceptEod, g)) { in all_reports()
80 for (auto v : inv_adjacent_vertices_range(g.acceptEod, g)) { in set_report()
H A Dng_som_util.cpp237 clear_in_edges(c_g.acceptEod, c_g); in somMayGoBackwards()
238 add_edge(c_g.accept, c_g.acceptEod, c_g); in somMayGoBackwards()
319 if (v != g.accept && v != g.acceptEod) { in sentClearsTail()
338 assert(v != g.accept && v != g.acceptEod); /* no cr */ in sentClearsTail()
H A Dng_fixed_width.cpp82 assert(v != g.acceptEod); in findMask()
115 if (in_degree(g.acceptEod,g) != 1) { in handleFixedWidth()
H A Dng_uncalc_components.cpp122 bool va_acceptEod = edge(va, ga.acceptEod, ga).second; in cplVerticesMatch()
123 bool vb_acceptEod = edge(vb, gb.acceptEod, gb).second; in cplVerticesMatch()
258 vmap[vic.acceptEod] = dest.acceptEod; in mergeNfaComponent()
515 NFAEdge e1_eod = edge(h1.start, h1.acceptEod, h1); in mergeableStarts()
516 NFAEdge e2_eod = edge(h2.start, h2.acceptEod, h2); in mergeableStarts()
H A Dng_split.cpp55 for (auto v : inv_adjacent_vertices_range(g.acceptEod, g)) { in clearAccepts()
60 clear_in_edges(g.acceptEod, g); in clearAccepts()
61 add_edge(g.accept, g.acceptEod, g); in clearAccepts()
H A Dng_haig.cpp103 void populateAccepts(const NGHolder &g, StateSet *accept, StateSet *acceptEod) { in populateAccepts() argument
107 for (auto v : inv_adjacent_vertices_range(g.acceptEod, g)) { in populateAccepts()
111 acceptEod->set(g[v].index); in populateAccepts()
131 acceptEod(Automaton_Traits::init_states(numStates)), in Automaton_Base()
138 populateAccepts(graph, &accept, &acceptEod); in Automaton_Base()
179 StateSet acc = in & (eod ? acceptEod : accept); in reports_i()
232 StateSet acceptEod; member in ue2::__anon1be7d8ae0111::Automaton_Base
553 haig_do_report(g, n.unused, g.acceptEod, source_states, n.v_by_index, in doHaig()
H A Dng_depth.cpp323 auto deadNodes = findLoopReachable(rg, g.acceptEod); in calcRevDepths()
332 rg, g.acceptEod, deadNodes, dMin, dMax, depths, in calcRevDepths()
364 deadNodes = findLoopReachable(rg, g.acceptEod); in calcBidiDepths()
373 rg, g.acceptEod, deadNodes, dMin, dMax, depths, in calcBidiDepths()
H A Dng_literal_component.cpp145 if (v == g.accept || v == g.acceptEod) { in splitOffLiteral()
169 bool eod = v == g.acceptEod; in splitOffLiteral()
H A Dng_som.cpp112 region == regions.at(g.acceptEod)) { in regionCanEstablishSom()
295 if (v != prefix.accept && v != prefix.acceptEod in validateEXSL()
384 clear_in_edges(prefix.acceptEod, prefix); in makePrefix()
385 add_edge(prefix.accept, prefix.acceptEod, prefix); in makePrefix()
733 if (w == g.accept || w == g.acceptEod) { in fillHolderForLockCheck()
807 if (w == g.accept || w == g.acceptEod) { in fillRoughMidfix()
850 if (w == g.accept || w == g.acceptEod in fillRoughMidfix()
1027 insert(&tmp, inv_adjacent_vertices(g.acceptEod, g)); in addReporterVertices()
2633 if (in_degree(g.acceptEod, g) > 1) { in doHaigLitHaigSom()
2896 makeSomAbsReports(rm, g, g.acceptEod); in doSom()
[all …]
H A Dng_literal_decorated.cpp97 assert(v == g.acceptEod); in findPaths()
178 is_eod(path.back() == g.acceptEod) { in PathMask()
H A Dng_small_literal_set.cpp140 bool eod = v == g.acceptEod; in findLiterals()
141 bool accept = v == g.accept || v == g.acceptEod; in findLiterals()
H A Dng_squash.cpp237 if (w == g.accept || w == g.acceptEod) { in buildSquashMask()
614 for (const auto &e : in_edges_range(g.acceptEod, g)) { in removeEdgesToAccept()
634 depth_first_visit(revg, g.acceptEod, in findUnreachable()
656 getHighlanderReporters(g, g.acceptEod, rm, verts); in findHighlanderSquashers()
H A Dng_netflow.cpp125 NFAVertex sink = h.acceptEod; in getMaxFlow()
130 assert(edge(h.accept, h.acceptEod, h).second); in getMaxFlow()
H A Dng_extparam.cpp133 for (auto v : inv_adjacent_vertices_range(g.acceptEod, g)) { in findMatchLengths()
160 assert(accept == g.acceptEod); in replaceReports()
191 replaceReports(g, g.acceptEod, seen, func); in replaceReports()
808 assert(accept == g.acceptEod); // stylised edge in pruneUnmatchable()
858 pruneUnmatchable(g, depths, rm, g.acceptEod); in pruneUnmatchable()
H A Dng_dominators.cpp91 g.acceptEod); in findPostDominators()
/dports/devel/hyperscan/hyperscan-5.4.0/unit/internal/
H A Dnfagraph_equivalence.cpp550 add_edge(c, g.acceptEod, g); in TEST()
559 ASSERT_EQ(in_degree(g.acceptEod, g), 2); in TEST()
575 add_edge(c, g.acceptEod, g); in TEST()
584 ASSERT_EQ(in_degree(g.acceptEod, g), 2); in TEST()
610 ASSERT_EQ(in_degree(g.acceptEod, g), 1); in TEST()
628 add_edge(b, g.acceptEod, g); in TEST()
636 ASSERT_EQ(in_degree(g.acceptEod, g), 2); in TEST()
H A Dnfagraph_util.cpp63 add_edge(f, src.acceptEod, src); in TEST()
124 add_edge(d, src.acceptEod, src); in TEST()
186 add_edge(i, src.acceptEod, src); in TEST()
259 add_edge(i, src.acceptEod, src); in TEST()
/dports/devel/hyperscan/hyperscan-5.4.0/util/
H A Dng_find_matches.cpp268 accept_eod.set(g[g.acceptEod].index); in populateAcceptCache()
321 for (auto v : inv_adjacent_vertices_range(g.acceptEod, g)) { in populateAcceptCache()
356 accept_eod.set(g[g.acceptEod].index); in dumpStateTransitionTable()
901 assert(accept_vertex == g.accept || accept_vertex == g.acceptEod); in getAcceptMatches()
903 const bool eod = accept_vertex == g.acceptEod; in getAcceptMatches()
952 getAcceptMatches(g, matches, state, g.acceptEod, wd.active); in getMatches()
/dports/devel/hyperscan/hyperscan-5.4.0/src/rose/
H A Drose_build_anchored.cpp364 || w == g.accept || w == g.acceptEod) { in transition()
548 assert(in_degree(h.acceptEod, h) == 1); in isSimple()
728 clear_in_edges(h.acceptEod, h); in addAnchoredNFA()
729 add_edge(h.accept, h.acceptEod, h); in addAnchoredNFA()
741 assert(in_degree(h.acceptEod, h) == 1); in addToAnchoredMatcher()

123