cdo/regex-engine
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Compare commits

base: cdo:97529fdd2b3a42b61ce8cf6f740ccd8e495a801d
Branches Tags
cdo:main
...
compare: cdo:de8cbb23b51fd01efb3ea4588dea9dd6ca5c2782
Branches Tags
cdo:main

3 Commits
97529fdd2b ... de8cbb23b5

Author SHA1 Message Date
Camden Dixie O'Brien
de8cbb23b5 Run benchmarks 100000x times instead of 10000 2024-11-10 16:30:09 +00:00
Camden Dixie O'Brien
601829bd29 Increase length of benchmark strings 2024-11-10 16:29:44 +00:00
Camden Dixie O'Brien
4131af3912 Assign match result to volatile in benchmarks 
This is needed to avoid the compiler eliding the call in
highly-optimised builds.
 2024-11-10 16:28:38 +00:00
1 changed files with 7 additions and 5 deletions
Show Stats Expand all files Collapse all files

12
benchmarks/matching_benchmarks.c
View File

@ -11,7 +11,7 @@
#include <string.h> #include <string.h>
#include <sys/time.h> #include <sys/time.h>
#define LEN 100 #define LEN 1000
#define RANGE_FIRST 'a' #define RANGE_FIRST 'a'
#define RANGE_LAST 'z' #define RANGE_LAST 'z'
@ -31,9 +31,11 @@ static void matching_benchmark(const fsa_t *fsa)
for (int j = 0; j < LEN; ++j) for (int j = 0; j < LEN; ++j)
s[j] = CLAMP_CHAR(rand()); s[j] = CLAMP_CHAR(rand());
volatile bool match;
START_CLOCK(); START_CLOCK();
fsa_accepts(fsa, s, LEN); match = fsa_accepts(fsa, s, LEN);
STOP_CLOCK(); STOP_CLOCK();
(void)match;
} }
int main(void) int main(void)
@ -44,9 +46,9 @@ int main(void)
BENCHMARKING_BEGIN(); BENCHMARKING_BEGIN();
RUN_MATCHING_BENCHMARK(10000, "foo or bar", ".*(foo|bar).*"); RUN_MATCHING_BENCHMARK(100000, "foo or bar", ".*(foo|bar).*");
RUN_MATCHING_BENCHMARK(10000, "regex #1", ".*(abc!?)*|dd+.*"); RUN_MATCHING_BENCHMARK(100000, "regex #1", ".*(abc!?)*|dd+.*");
RUN_MATCHING_BENCHMARK(10000, "regex #2", ".*(l|wh)?[aeiou]+.*"); RUN_MATCHING_BENCHMARK(100000, "regex #2", ".*(l|wh)?[aeiou]+.*");
return BENCHMARKING_END(); return BENCHMARKING_END();
} }