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

size output fixed

Browse Source
This commit is contained in:
apostolos
2021-09-09 12:02:33 +03:00
committed by Konstantinos Margaritis
parent 87f605b87c
commit 488517c45a
3 changed files with 14 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
benchmarks/shufti.cpp
View File

@@ -20,6 +20,7 @@
void shufti_benchmarks(int size, int loops, int M, bool has_match) {
size_t real_size = size;
m128 lo, hi;
ue2::CharReach chars;
chars.set('a');
@@ -53,7 +54,7 @@ void shufti_benchmarks(int size, int loops, int M, bool has_match) {
}
total_sec /= M;
bw /= M;
std::cout << "\x1B[35m Case with match in random pos and size: " << size << " for " << loops <<" loops ("
std::cout << "\x1B[35m Case with match in random pos and size: " << real_size << " for " << loops <<" loops ("
<< M << " random possisions checked): \x1B[36m shuftiExec elapsetime: \x1B[0m" << (total_sec)
<< " (μs) \x1B[36m bandwidth: \x1B[0m" << bw <<" (MB/μs)"<<std::endl;
} else {
@@ -70,13 +71,14 @@ void shufti_benchmarks(int size, int loops, int M, bool has_match) {
double mb_size = (double) size / 1048576;
mb_size /= loops;
bw = mb_size / total_sec;
std::cout<<"\x1B[35m Case with no match in random pos and size: "<<size<<" for "<<loops<<" loops:"
std::cout<<"\x1B[35m Case with no match in random pos and size: "<<real_size<<" for "<<loops<<" loops:"
<<"\x1B[36m shuftiExec elapsetime: \x1B[0m"<<(total_sec)<<" (μs) \x1B[36m bandwidth: \x1B[0m"<< bw <<" (MB/μs)"<<std::endl;
}
delete [] kt1;
}
void rshufti_benchmarks(int size, int loops, int M, bool has_match) {
size_t real_size = size;
m128 lo, hi;
ue2::CharReach chars;
chars.set('a');
@@ -110,7 +112,7 @@ void rshufti_benchmarks(int size, int loops, int M, bool has_match) {
}
total_sec /= M;
bw /= M;
std::cout << "\x1B[35m Case with match in random pos and size: " << size << " for " << loops<<" loops ("
std::cout << "\x1B[35m Case with match in random pos and size: " << real_size << " for " << loops<<" loops ("
<< M << " random possisions checked): \x1B[36m rshuftiExec elapsetime: \x1B[0m" << total_sec
<<" (μs) \x1B[36m bandwidth: \x1B[0m" << bw <<" (MB/μs)"<<std::endl;
} else {
@@ -126,7 +128,7 @@ void rshufti_benchmarks(int size, int loops, int M, bool has_match) {
size /=loops;
double mb_size = (double) size / 1048576;
bw = mb_size / total_sec;
std::cout<<"\x1B[35m Case with no match in random pos and size: "<< size <<" for "<< loops <<" loops:"
std::cout<<"\x1B[35m Case with no match in random pos and size: "<< real_size <<" for "<< loops <<" loops:"
<<"\x1B[36m rshuftiExec elapsetime: \x1B[0m"<< total_sec <<" (μs) \x1B[36m bandwidth: \x1B[0m"<< bw <<" (MB/μs)"<<std::endl;
}
delete [] kt1;