Home
last modified time | relevance | path

Searched refs:startDs (Results 1 – 25 of 58) sorted by relevance

123

/dports/devel/hyperscan/hyperscan-5.4.0/src/nfagraph/
H A Dng_holder.cpp49 startDs(addSpecialVertex(*this, NODE_START_DOTSTAR)), in NGHolder()
54 add_edge(start, startDs, *this); in NGHolder()
55 add_edge(startDs, startDs, *this); in NGHolder()
59 (*this)[startDs].char_reach.setall(); in NGHolder()
83 add_edge(h.start, h.startDs, h); in clear_graph()
84 add_edge(h.startDs, h.startDs, h); in clear_graph()
91 case NODE_START_DOTSTAR: return startDs; in getSpecialVertex()
H A Dng_restructuring.cpp73 start.erase(g.startDs); in startIsRedundant()
81 set<NFAVertex> startDs; in startIsRedundant() local
82 insert(&startDs, adjacent_vertices_range(g.startDs, g)); in startIsRedundant()
83 startDs.erase(g.startDs); in startIsRedundant()
85 if (!is_subset_of(start, startDs)) { in startIsRedundant()
109 temp.erase(remove(temp.begin(), temp.end(), g.startDs)); in getStateOrdering()
111 if (proper_out_degree(g.startDs, g)) { in getStateOrdering()
112 temp.push_back(g.startDs); in getStateOrdering()
H A Dng_util.cpp157 explicit DetectCycles(const NGHolder &g) : startDs(g.startDs) {} in DetectCycles()
161 if (u == startDs && v == startDs) { in back_edge()
169 const NFAVertex startDs; member
182 if (v != g.startDs) { in isAnchored()
191 if (v != g.startDs && !edge(g.startDs, v, g).second) { in isFloating()
282 NFAEdge e = edge(h.startDs, h.accept, h); in matches_everywhere()
444 if (target(e, h) == h.startDs) { in setTops()
542 clear_vertex(out.startDs, out); in cloneHolder()
625 add_edge(g.startDs, v, g[e], g); in reverseHolder()
641 clear_vertex(startDs, g); in reverseHolder()
[all …]
H A Dng_vacuous.cpp72 remove_edge(g.startDs, g.accept, g); in makeFirehose()
73 remove_edge(g.startDs, g.acceptEod, g); in makeFirehose()
80 add_edge(g.startDs, v, g); in makeFirehose()
97 remove_edge(g.startDs, g.acceptEod, g); in makeEndAnchoredAcceptor()
100 g[g.startDs].reports.clear(); in makeEndAnchoredAcceptor()
113 if (edge(g.startDs, g.accept, g).second) { in splitOffVacuous()
128 if (edge(g.startDs, g.acceptEod, g).second) { in splitOffVacuous()
H A Dng_sep.cpp60 if (v == g.startDs) { in checkFromVertex()
66 if (!edge(g.startDs, v, g).second) { /* only floating starts */ in checkFromVertex()
83 if (!checkFromVertex(g, g.start) || !checkFromVertex(g, g.startDs)) { in isSEP()
87 assert(out_degree(g.start, g) || proper_out_degree(g.startDs, g)); in isSEP()
H A Dng_anchored_dots.cpp145 } else if (start == g.startDs && u == g.start) { in isStartNode()
242 add_edge_if_not_present(g.startDs, t, g); in reformAnchoredRepeatsComponent()
322 if (!isStartNode(dotV, g.startDs, g, true)) { in reformUnanchoredRepeatsComponent()
360 remove_edge(g.startDs, v, g); in reformUnanchoredRepeatsComponent()
367 add_edge(g.startDs, t, g); in reformUnanchoredRepeatsComponent()
393 } else if (u == g.start || u == g.startDs) { in isOptionalDot()
514 add_edge_if_not_present(g.startDs, v, g); in collapseVariableDotRepeat()
620 assert(edge(g.startDs, v, g).second); in restoreLeadingDots()
623 add_edge(g.start, g.startDs, g); in restoreLeadingDots()
627 NFAVertex root = unbounded ? g.startDs : g.start; in restoreLeadingDots()
[all …]
H A Dng_stop.cpp65 startDs(calcDepthsFrom(g, g.startDs)) {} in InitDepths()
69 assert(idx < start.size() && idx < startDs.size()); in maxDist()
71 const depth &d_startDs = startDs.at(idx).max; in maxDist()
82 vector<DepthMinMax> startDs; member
H A Dng_puff.cpp97 auto depthFromStartDs = calcDepthsFrom(g, g.startDs); in isFixedDepth()
141 for (auto v : adjacent_vertices_range(g.startDs, g)) { in singleStart()
203 if (s == g.start && !edge(g.startDs, head, g).second) { in triggerFloodsPuff()
276 if (a == g.startDs || a == g.start) { in constructPuff()
379 if (a != g.startDs && edge(g.startDs, a, g).second in doComponent()
383 a = g.startDs; in doComponent()
390 if (nodes.size() < MIN_PUFF_LENGTH || a == g.startDs) { in doComponent()
427 if (edge(g.startDs, a, g).second) { in doComponent()
H A Dng_fixed_width.cpp57 insert(&sds_succ, adjacent_vertices(g.startDs, g)); in findMask()
70 succs.erase(g.startDs); in findMask()
76 NFAVertex u = *anchored ? g.start : g.startDs; in findMask()
H A Dng_som_util.cpp66 vstarts.push_back(g.startDs); in getDistancesFromSOM()
95 if (v_orig == g_orig.startDs || is_virtual_start(v_orig, g_orig)) { in getDistancesFromSOM()
228 orig_to_copy[v] = c_g.startDs; in somMayGoBackwards()
230 add_edge_if_not_present(c_g.startDs, c_w, c_g); in somMayGoBackwards()
333 if (v == g.start || v == g.startDs) { in sentClearsTail()
H A Dng_uncalc_components.cpp256 vmap[vic.startDs] = dest.startDs; in mergeNfaComponent()
407 return (edge(ga.startDs, ga.startDs, ga).second == in compatibleStarts()
408 edge(gb.startDs, gb.startDs, gb).second) && in compatibleStarts()
500 if (is_match_vertex(h1.startDs, h1) || is_match_vertex(h2.startDs, h2)) { in mergeableStarts()
H A Dng_split.cpp148 clear_out_edges(rhs->startDs, *rhs); in splitRHS()
149 add_edge(rhs->start, rhs->startDs, *rhs); in splitRHS()
150 add_edge(rhs->startDs, rhs->startDs, *rhs); in splitRHS()
H A Dng_literal_component.cpp115 assert(edge(g.startDs, v, g).second); in splitOffLiteral()
202 insert(&unanchored, adjacent_vertices(g.startDs, g)); in splitOffLiterals()
212 for (auto v : adjacent_vertices_range(g.startDs, g)) { in splitOffLiterals()
H A Dng_asserts.cpp210 if (v == g.startDs) { in makeClone()
267 assert(u != g.startDs); in resolveEdges()
499 NFAEdge orig = edge(g.startDs, g.accept, g); in ensureCodePointStart()
545 add_edge(g.startDs, v_a, g); in ensureCodePointStart()
547 add_edge(g.startDs, v_2, g); in ensureCodePointStart()
549 add_edge(g.startDs, v_3, g); in ensureCodePointStart()
551 add_edge(g.startDs, v_4, g); in ensureCodePointStart()
H A Dng_mcclellan.cpp294 assert(u != g.startDs); /* triggered graphs should not use sds */ in triggerAllowed()
518 set<NFAVertex> startDs; in startIsRedundant() local
521 insert(&startDs, adjacent_vertices(g.startDs, g)); in startIsRedundant()
523 return start == startDs; in startIsRedundant()
531 if (proper_out_degree(g.startDs, g) == 0) { in getRedundantStarts()
532 dead.insert(g.startDs); in getRedundantStarts()
H A Dng_som.cpp699 v_map[g.startDs] = midfix.startDs; in fillHolderForLockCheck()
721 v_map[v] = midfix.startDs; in fillHolderForLockCheck()
793 add_edge(midfix.startDs, midfix.startDs, midfix); in fillRoughMidfix()
834 add_edge(midfix.startDs, midfix.startDs, midfix); in fillRoughMidfix()
882 succ.erase(g.startDs); in beginsWithDotStar()
1658 if (v == g.startDs) { in anchorStarts()
2214 sds_succ.erase(g.startDs); in leadingLiterals()
2232 if (v == g.startDs) { in leadingLiterals()
2251 if (v == g.startDs) { in leadingLiterals()
2304 if (t == g.startDs) { in leadingLiterals()
[all …]
H A Dng_extparam.cpp352 for (auto v : adjacent_vertices_range(g.startDs, g)) { in anchorPatternWithBoundedRepeat()
353 if (v == g.startDs) { in anchorPatternWithBoundedRepeat()
387 remove_edge(g.startDs, v, g); in anchorPatternWithBoundedRepeat()
414 if (source(e, g) == g.startDs) { in findSingleCyclic()
493 if (*ai == g.startDs) { in transformMinLengthToRepeat()
584 if (target(e, g) != g.startDs) { in transformMinLengthToRepeat()
670 if (u == g.start && edge(g.startDs, v, g).second) { in isEdgePrunable()
879 bool is_anchored = !has_proper_successor(g.startDs, g) in propagateExtendedParams()
927 if (has_proper_successor(g.startDs, g)) { in replaceMinLengthWithOffset()
H A Dng_width.cpp76 if (u == h->startDs) { in operator ()()
191 depth dotstarDepth = findMinWidth(h, filter, h.startDs); in findMinWidth()
217 depth dotstarDepth = findMaxWidth(h, filter, h.startDs); in findMaxWidth()
H A Dng_execute.cpp215 if (input_v != input_g.startDs && in finish_vertex()
240 if (v == input_g.startDs) { in finish_vertex()
321 auto input_start_states = {input_dag.start, input_dag.startDs}; in execute_graph()
362 if (proper_out_degree(g.startDs, g)) { in can_die_early()
H A Dng_misc_opt.cpp184 cand.erase(g.startDs); in findSustainSet()
414 && edge(g.startDs, pred, g).second) { in reduced_cr()
415 predpred = g.startDs; in reduced_cr()
493 if (out_degree(g.startDs, g) > 1) { in mergeCyclicDotStars()
525 add_edge_if_not_present(g.startDs, t, g); in mergeCyclicDotStars()
629 if (som && (is_virtual_start(u, g) || u == g.startDs)) { in pruneUsingSuccessors()
H A Dng_edge_redundancy.cpp158 if (u == g.startDs || is_virtual_start(u, g)) { in removeEdgeRedundancyNearCyclesFwd()
432 if (ignore_starts && (u == g.startDs || is_virtual_start(u, g))) { in removeEdgeRedundancyFwd()
484 for (auto v : adjacent_vertices_range(g.startDs, g)) { in removeSiblingsOfStartDotStar()
515 for (auto v : adjacent_vertices_range(g.startDs, g)) { in optimiseVirtualStarts()
H A Dng_builder.cpp124 id2vertex[NODE_START_DOTSTAR] = graph->startDs; in NFABuilderImpl()
210 if ((u == graph->start || u == graph->startDs) && v == graph->startDs) { in addEdge()
/dports/devel/hyperscan/hyperscan-5.4.0/unit/internal/
H A Dnfagraph_equivalence.cpp69 ASSERT_EQ(2U, out_degree(g.startDs, g)); in TEST()
78 if (a == g.startDs) { in TEST()
130 ASSERT_EQ(3U, out_degree(g.startDs, g)); in TEST()
191 ASSERT_EQ(2U, out_degree(g.startDs, g)); in TEST()
200 if (a == g.startDs) { in TEST()
280 ASSERT_EQ(3U, out_degree(g.startDs, g)); in TEST()
290 if (tmp == g.startDs) { in TEST()
376 ASSERT_EQ(2U, out_degree(g.startDs, g)); in TEST()
385 if (v == g.startDs) { in TEST()
440 if (v == g.startDs) { in TEST()
[all …]
H A Dnfagraph_redundancy.cpp68 ASSERT_EQ(2U, out_degree(graph->startDs, g)); in TEST()
72 for (NFAVertex t : adjacent_vertices_range(graph->startDs, g)) { in TEST()
74 if (v != graph->startDs) { in TEST()
110 ASSERT_EQ(2U, out_degree(graph->startDs, g)); in TEST()
114 for (NFAVertex t : adjacent_vertices_range(graph->startDs, g)) { in TEST()
116 if (v != graph->startDs) { in TEST()
/dports/devel/hyperscan/hyperscan-5.4.0/src/rose/
H A Drose_build_convert.cpp119 NFAVertex u = h->startDs; in makeRosePrefix()
429 NFAVertex hu = h.startDs; in handleStartDsPrefixCliche()
432 auto startds_succ = succs<set<NFAVertex>>(h.startDs, h); in handleStartDsPrefixCliche()
481 bool anchored = !proper_out_degree(h.startDs, h); in handleMixedPrefixCliche()
483 NFAVertex base = anchored ? h.start : h.startDs; in handleMixedPrefixCliche()
547 base_succ.erase(h.startDs); in handleMixedPrefixCliche()
578 if (w != h_new->startDs) { in handleMixedPrefixCliche()
579 add_edge(h_new->startDs, w, *h_new); in handleMixedPrefixCliche()
583 add_edge(h_new->start, h_new->startDs, *h_new); in handleMixedPrefixCliche()
660 if (!proper_out_degree(h.startDs, h)) { in convertPrefixToBounds()
[all …]

123