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

repeatRecurTable: no need for u64a return type

Browse Source
This commit is contained in:
Justin Viiret 2015-11-02 14:41:17 +11:00 committed by Matthew Barr
parent e8bfe5478b
commit ae7dbc2472
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/nfa/repeatcompile.cpp
View File

@ -75,8 +75,8 @@ u32 calcPackedBytes(u64a val) {
}
static
u64a repeatRecurTable(struct RepeatStateInfo *info, const depth &repeatMax,
const u32 minPeriod) {
u32 repeatRecurTable(struct RepeatStateInfo *info, const depth &repeatMax,
const u32 minPeriod) {
u32 repeatTmp = info->patchCount > 2 ? 64 : (u32)repeatMax;
u32 repeat_index = repeatTmp < minPeriod ? repeatTmp : minPeriod;
for (u32 i = 0; i <= repeat_index; i++) {
@ -93,7 +93,7 @@ u64a repeatRecurTable(struct RepeatStateInfo *info, const depth &repeatMax,
static
u32 findOptimalPatchSize(struct RepeatStateInfo *info, const depth &repeatMax,
const u32 minPeriod, u64a rv) {
const u32 minPeriod, u32 rv) {
u32 cnt = 0;
u32 patch_bits = 0;
u32 total_size = 0;
@ -171,7 +171,7 @@ RepeatStateInfo::RepeatStateInfo(enum RepeatType type, const depth &repeatMin,
assert(minPeriod);
assert(repeatMax.is_finite());
{
u64a rv = repeatRecurTable(this, repeatMax, minPeriod);
u32 rv = repeatRecurTable(this, repeatMax, minPeriod);
u32 repeatTmp = 0;
if ((u32)repeatMax < minPeriod) {
repeatTmp = repeatMax;