mirror of
https://github.com/VectorCamp/vectorscan.git
synced 2025-06-28 16:41:01 +03:00
redundantInitialization
This commit is contained in:
parent
adda613f51
commit
fd3e251afa
@ -1572,7 +1572,7 @@ u32 findMaxVarShift(const build_info &args, u32 nShifts) {
|
|||||||
static
|
static
|
||||||
int getLimexScore(const build_info &args, u32 nShifts) {
|
int getLimexScore(const build_info &args, u32 nShifts) {
|
||||||
const NGHolder &h = args.h;
|
const NGHolder &h = args.h;
|
||||||
u32 maxVarShift = nShifts;
|
u32 maxVarShift;
|
||||||
int score = 0;
|
int score = 0;
|
||||||
|
|
||||||
score += SHIFT_COST * nShifts;
|
score += SHIFT_COST * nShifts;
|
||||||
|
@ -512,7 +512,7 @@ size_t find_last_bad(const struct mpv_kilopuff *kp, const u8 *buf,
|
|||||||
|
|
||||||
verm_restart:;
|
verm_restart:;
|
||||||
assert(buf[curr] == kp->u.verm.c);
|
assert(buf[curr] == kp->u.verm.c);
|
||||||
size_t test = curr;
|
size_t test;
|
||||||
if (curr + min_rep < length) {
|
if (curr + min_rep < length) {
|
||||||
test = curr + min_rep;
|
test = curr + min_rep;
|
||||||
} else {
|
} else {
|
||||||
@ -534,7 +534,7 @@ size_t find_last_bad(const struct mpv_kilopuff *kp, const u8 *buf,
|
|||||||
m128 hi = kp->u.shuf.mask_hi;
|
m128 hi = kp->u.shuf.mask_hi;
|
||||||
shuf_restart:
|
shuf_restart:
|
||||||
assert(do_single_shufti(lo, hi, buf[curr]));
|
assert(do_single_shufti(lo, hi, buf[curr]));
|
||||||
size_t test = curr;
|
size_t test;
|
||||||
if (curr + min_rep < length) {
|
if (curr + min_rep < length) {
|
||||||
test = curr + min_rep;
|
test = curr + min_rep;
|
||||||
} else {
|
} else {
|
||||||
@ -556,7 +556,7 @@ size_t find_last_bad(const struct mpv_kilopuff *kp, const u8 *buf,
|
|||||||
const m128 mask1 = kp->u.truffle.mask1;
|
const m128 mask1 = kp->u.truffle.mask1;
|
||||||
const m128 mask2 = kp->u.truffle.mask2;
|
const m128 mask2 = kp->u.truffle.mask2;
|
||||||
truffle_restart:;
|
truffle_restart:;
|
||||||
size_t test = curr;
|
size_t test;
|
||||||
if (curr + min_rep < length) {
|
if (curr + min_rep < length) {
|
||||||
test = curr + min_rep;
|
test = curr + min_rep;
|
||||||
} else {
|
} else {
|
||||||
@ -582,7 +582,7 @@ size_t find_last_bad(const struct mpv_kilopuff *kp, const u8 *buf,
|
|||||||
|
|
||||||
nverm_restart:;
|
nverm_restart:;
|
||||||
assert(buf[curr] != kp->u.verm.c);
|
assert(buf[curr] != kp->u.verm.c);
|
||||||
size_t test = curr;
|
size_t test;
|
||||||
if (curr + min_rep < length) {
|
if (curr + min_rep < length) {
|
||||||
test = curr + min_rep;
|
test = curr + min_rep;
|
||||||
} else {
|
} else {
|
||||||
|
@ -165,9 +165,9 @@ void reformAnchoredRepeatsComponent(NGHolder &g,
|
|||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
NFAVertex dotV = NGHolder::null_vertex();
|
|
||||||
set<NFAVertex> otherV;
|
set<NFAVertex> otherV;
|
||||||
dotV = findReformable(g, compAnchoredStarts, otherV);
|
NFAVertex dotV = findReformable(g, compAnchoredStarts, otherV);
|
||||||
if (dotV == NGHolder::null_vertex()) {
|
if (dotV == NGHolder::null_vertex()) {
|
||||||
DEBUG_PRINTF("no candidate reformable dot found.\n");
|
DEBUG_PRINTF("no candidate reformable dot found.\n");
|
||||||
return;
|
return;
|
||||||
@ -268,9 +268,9 @@ void reformUnanchoredRepeatsComponent(NGHolder &g,
|
|||||||
}
|
}
|
||||||
|
|
||||||
while (true) {
|
while (true) {
|
||||||
NFAVertex dotV = NGHolder::null_vertex();
|
|
||||||
set<NFAVertex> otherV;
|
set<NFAVertex> otherV;
|
||||||
dotV = findReformable(g, compUnanchoredStarts, otherV);
|
NFAVertex dotV = findReformable(g, compUnanchoredStarts, otherV);
|
||||||
if (dotV == NGHolder::null_vertex()) {
|
if (dotV == NGHolder::null_vertex()) {
|
||||||
DEBUG_PRINTF("no candidate reformable dot found.\n");
|
DEBUG_PRINTF("no candidate reformable dot found.\n");
|
||||||
return;
|
return;
|
||||||
|
Loading…
x
Reference in New Issue
Block a user