Simplify slightly in checkMaxBetweenExclusive
This commit is contained in:
@@ -2340,10 +2340,8 @@ bool checkMaxBetweenExclusiveImpl(Node *n, int begin, int end,
|
|||||||
int c = self->bitSet.firstSetGeq(begin + 1);
|
int c = self->bitSet.firstSetGeq(begin + 1);
|
||||||
if (c >= 0 && c < end) {
|
if (c >= 0 && c < end) {
|
||||||
auto *child = self->children[self->index[c]];
|
auto *child = self->children[self->index[c]];
|
||||||
if (child->entryPresent) {
|
if (child->entryPresent && child->entry.rangeVersion > readVersion) {
|
||||||
if (!(child->entry.rangeVersion <= readVersion)) {
|
return false;
|
||||||
return false;
|
|
||||||
};
|
|
||||||
}
|
}
|
||||||
begin = c;
|
begin = c;
|
||||||
} else {
|
} else {
|
||||||
@@ -2376,10 +2374,8 @@ bool checkMaxBetweenExclusiveImpl(Node *n, int begin, int end,
|
|||||||
int c = self->bitSet.firstSetGeq(begin + 1);
|
int c = self->bitSet.firstSetGeq(begin + 1);
|
||||||
if (c >= 0 && c < end) {
|
if (c >= 0 && c < end) {
|
||||||
auto *child = self->children[c];
|
auto *child = self->children[c];
|
||||||
if (child->entryPresent) {
|
if (child->entryPresent && child->entry.rangeVersion > readVersion) {
|
||||||
if (!(child->entry.rangeVersion <= readVersion)) {
|
return false;
|
||||||
return false;
|
|
||||||
};
|
|
||||||
}
|
}
|
||||||
begin = c;
|
begin = c;
|
||||||
} else {
|
} else {
|
||||||
@@ -2422,9 +2418,7 @@ bool checkMaxBetweenExclusiveImpl(Node *n, int begin, int end,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
// Check inner pages
|
// Check inner pages
|
||||||
const int innerPageBegin = (begin >> Node256::kMaxOfMaxShift) + 1;
|
return scan16<kAVX512>(self->maxOfMax, firstPage + 1, lastPage,
|
||||||
const int innerPageEnd = (end - 1) >> Node256::kMaxOfMaxShift;
|
|
||||||
return scan16<kAVX512>(self->maxOfMax, innerPageBegin, innerPageEnd,
|
|
||||||
readVersion);
|
readVersion);
|
||||||
}
|
}
|
||||||
default: // GCOVR_EXCL_LINE
|
default: // GCOVR_EXCL_LINE
|
||||||
|
Reference in New Issue
Block a user