From 8dabc86a69cb5a36336807f1c228f3ab7e77f4a0 Mon Sep 17 00:00:00 2001 From: "G.E" Date: Tue, 23 Apr 2024 23:46:08 +0300 Subject: [PATCH] removed commented lines. --- src/nfagraph/ng_limex_accel.cpp | 2 -- src/nfagraph/ng_som_util.cpp | 13 ------------- src/rose/rose_build_castle.cpp | 1 - 3 files changed, 16 deletions(-) diff --git a/src/nfagraph/ng_limex_accel.cpp b/src/nfagraph/ng_limex_accel.cpp index 58149ad3..d31f84c0 100644 --- a/src/nfagraph/ng_limex_accel.cpp +++ b/src/nfagraph/ng_limex_accel.cpp @@ -811,11 +811,9 @@ depth_done: return true; } } - // } // Second option: a two-byte shufti (i.e. less than eight 2-byte // literals) - // if (depth > 1) { for (unsigned int i = 0; i < (depth - 1); i++) { if (depthReach[i].count() * depthReach[i+1].count() <= DOUBLE_SHUFTI_LIMIT) { diff --git a/src/nfagraph/ng_som_util.cpp b/src/nfagraph/ng_som_util.cpp index 01beec8d..0c44f063 100644 --- a/src/nfagraph/ng_som_util.cpp +++ b/src/nfagraph/ng_som_util.cpp @@ -267,19 +267,6 @@ bool somMayGoBackwards(NFAVertex u, const NGHolder &g, boost::depth_first_search(c_g, visitor(backEdgeVisitor) .root_vertex(c_g.start)); - // with be.clear right above does this ever run at all? - //for (const auto &e : be) { - // NFAVertex s = source(e, c_g); - // NFAVertex t = target(e, c_g); - // DEBUG_PRINTF("back edge %zu %zu\n", c_g[s].index, c_g[t].index); - // if (s != t) { - // assert(0); - // DEBUG_PRINTF("eek big cycle\n"); - // rv = true; /* big cycle -> eek */ - // goto exit; - // } - //} - DEBUG_PRINTF("checking acyclic+selfloop graph\n"); rv = !firstMatchIsFirst(c_g); diff --git a/src/rose/rose_build_castle.cpp b/src/rose/rose_build_castle.cpp index 2a1dcdd9..990f0c55 100644 --- a/src/rose/rose_build_castle.cpp +++ b/src/rose/rose_build_castle.cpp @@ -170,7 +170,6 @@ void renovateCastle(RoseBuildImpl &tbi, CastleProto *castle, return; /* bail - TODO: be less lazy */ } - //vector rem_local_cr; u32 ok_count = 0; for (auto it = e.s.end() - g[v].left.lag; it != e.s.end(); ++it) { if (!isSubsetOf(*it, cr)) {