mirror of
https://github.com/VectorCamp/vectorscan.git
synced 2025-06-28 16:41:01 +03:00
unreadVariable
This commit is contained in:
parent
2921e50ecc
commit
b5bf3d8d31
@ -108,7 +108,7 @@ static void run_benchmarks(int size, int loops, int max_matches,
|
|||||||
u64a total_size = 0;
|
u64a total_size = 0;
|
||||||
auto start = std::chrono::steady_clock::now();
|
auto start = std::chrono::steady_clock::now();
|
||||||
for (int i = 0; i < loops; i++) {
|
for (int i = 0; i < loops; i++) {
|
||||||
const u8 *res = func(bench);
|
func(bench);
|
||||||
}
|
}
|
||||||
auto end = std::chrono::steady_clock::now();
|
auto end = std::chrono::steady_clock::now();
|
||||||
total_sec +=
|
total_sec +=
|
||||||
|
@ -906,7 +906,6 @@ s64a castleLastKillLoc(const struct Castle *c, struct mq *q) {
|
|||||||
if (castleRevScan(c, q->history, sp + hlen, ep + hlen, &loc)) {
|
if (castleRevScan(c, q->history, sp + hlen, ep + hlen, &loc)) {
|
||||||
return (s64a)loc - hlen;
|
return (s64a)loc - hlen;
|
||||||
}
|
}
|
||||||
ep = 0;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
return sp - 1; /* the repeats are never killed */
|
return sp - 1; /* the repeats are never killed */
|
||||||
|
@ -655,7 +655,8 @@ buildCastle(const CastleProto &proto,
|
|||||||
if (!stale_iter.empty()) {
|
if (!stale_iter.empty()) {
|
||||||
c->staleIterOffset = verify_u32(ptr - base_ptr);
|
c->staleIterOffset = verify_u32(ptr - base_ptr);
|
||||||
copy_bytes(ptr, stale_iter);
|
copy_bytes(ptr, stale_iter);
|
||||||
ptr += byte_length(stale_iter);
|
// Removed unused increment operation
|
||||||
|
// ptr += byte_length(stale_iter);
|
||||||
}
|
}
|
||||||
|
|
||||||
return nfa;
|
return nfa;
|
||||||
|
@ -192,7 +192,7 @@ int roseCountingMiracleOccurs(const struct RoseEngine *t,
|
|||||||
|
|
||||||
u32 count = 0;
|
u32 count = 0;
|
||||||
|
|
||||||
s64a m_loc = start;
|
s64a m_loc;
|
||||||
|
|
||||||
if (!cm->shufti) {
|
if (!cm->shufti) {
|
||||||
u8 c = cm->c;
|
u8 c = cm->c;
|
||||||
|
@ -131,7 +131,6 @@ void findMaskLiteral(const vector<CharReach> &mask, bool streaming,
|
|||||||
if (better) {
|
if (better) {
|
||||||
best_begin = begin;
|
best_begin = begin;
|
||||||
best_end = end;
|
best_end = end;
|
||||||
best_len = len;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
for (size_t i = best_begin; i < best_end; i++) {
|
for (size_t i = best_begin; i < best_end; i++) {
|
||||||
|
@ -401,7 +401,7 @@ TEST_P(MultiBitCompTest, CompCompressDecompressDense) {
|
|||||||
|
|
||||||
TEST(MultiBitComp, CompIntegration1) {
|
TEST(MultiBitComp, CompIntegration1) {
|
||||||
// 256 + 1 --> smallest 2-level mmbit
|
// 256 + 1 --> smallest 2-level mmbit
|
||||||
u32 total_size = mmbit_size(257);
|
//u32 total_size = mmbit_size(257);
|
||||||
mmbit_holder ba(257);
|
mmbit_holder ba(257);
|
||||||
|
|
||||||
//-------------------- 1 -----------------------//
|
//-------------------- 1 -----------------------//
|
||||||
@ -516,7 +516,7 @@ TEST(MultiBitComp, CompIntegration1) {
|
|||||||
|
|
||||||
TEST(MultiBitComp, CompIntegration2) {
|
TEST(MultiBitComp, CompIntegration2) {
|
||||||
// 64^2 + 1 --> smallest 3-level mmbit
|
// 64^2 + 1 --> smallest 3-level mmbit
|
||||||
u32 total_size = mmbit_size(4097);
|
//u32 total_size = mmbit_size(4097);
|
||||||
mmbit_holder ba(4097);
|
mmbit_holder ba(4097);
|
||||||
|
|
||||||
//-------------------- 1 -----------------------//
|
//-------------------- 1 -----------------------//
|
||||||
@ -645,7 +645,7 @@ TEST(MultiBitComp, CompIntegration2) {
|
|||||||
|
|
||||||
TEST(MultiBitComp, CompIntegration3) {
|
TEST(MultiBitComp, CompIntegration3) {
|
||||||
// 64^3 + 1 --> smallest 4-level mmbit
|
// 64^3 + 1 --> smallest 4-level mmbit
|
||||||
u32 total_size = mmbit_size(262145);
|
//u32 total_size = mmbit_size(262145);
|
||||||
mmbit_holder ba(262145);
|
mmbit_holder ba(262145);
|
||||||
|
|
||||||
//-------------------- 1 -----------------------//
|
//-------------------- 1 -----------------------//
|
||||||
|
@ -55,7 +55,7 @@ unique_ptr<hs_platform_info> xcompileReadMode(const char *s) {
|
|||||||
assert(!err);
|
assert(!err);
|
||||||
|
|
||||||
string str(s);
|
string str(s);
|
||||||
string mode = str.substr(0, str.find(":"));
|
//string mode = str.substr(0, str.find(":"));
|
||||||
string opt = str.substr(str.find(":")+1, str.npos);
|
string opt = str.substr(str.find(":")+1, str.npos);
|
||||||
bool found_mode = false;
|
bool found_mode = false;
|
||||||
|
|
||||||
|
Loading…
x
Reference in New Issue
Block a user