github_mirrors/vectorscan
3
0
Fork 1
mirror of https://github.com/VectorCamp/vectorscan.git synced 2025-06-28 16:41:01 +03:00
Code Issues Packages Projects Releases Wiki Activity

removed commented lines.

Browse Source
This commit is contained in:
G.E 2024-04-23 23:46:08 +03:00
parent 01dee390a9
commit 8dabc86a69
3 changed files with 0 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/nfagraph/ng_limex_accel.cpp
View File

@ -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) {

13
src/nfagraph/ng_som_util.cpp
View File

@ -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);

1
src/rose/rose_build_castle.cpp
View File

@ -170,7 +170,6 @@ void renovateCastle(RoseBuildImpl &tbi, CastleProto *castle,
return; /* bail - TODO: be less lazy */
}
//vector<CharReach> 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)) {