weaselab/conflict-set
2
0
Fork 0
Code Issues 4 Packages Releases 13 Activity

Remove unnecessary branch for interleaved range writes
All checks were successful
Tests / 64 bit versions total: 8331, passed: 8331
Details
Tests / Debug total: 8329, passed: 8329
Details
Tests / SIMD fallback total: 8331, passed: 8331
Details
Tests / Release [clang] total: 8331, passed: 8331
Details
Clang |Total|New|Outstanding|Fixed|Trend |:-:|:-:|:-:|:-:|:-: |0|0|0|0|:clap:
Details
Tests / gcc total: 8331, passed: 8331
Details
GNU C Compiler (gcc) |Total|New|Outstanding|Fixed|Trend |:-:|:-:|:-:|:-:|:-: |0|0|0|0|:clap:
Details
Tests / Release [clang,aarch64] total: 5520, passed: 5520
Details
Tests / Coverage total: 5571, passed: 5571
Details
Code Coverage #### Project Overview No changes detected, that affect the code coverage. * Line Coverage: 97.75% (3080/3151) * Branch Coverage: 41.81% (18260/43676) * Complexity Density: 0.00 * Lines of Code: 3151 #### Quality Gates Summary Output truncated.
Details
weaselab/conflict-set/pipeline/head This commit looks good
Details

Browse Source
This commit is contained in:
Andrew Noyes
2024-12-11 21:53:44 -08:00
parent 7166811387
commit 2642d453dc
1 changed files with 8 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
ConflictSet.cpp
View File

@@ -4984,16 +4984,15 @@ struct __attribute__((visibility("hidden"))) ConflictSet::Impl {
// encounter invalidated nodes.
for (auto *iter = firstRangeWrite; iter != nullptr;
iter = iter->nextRangeWrite) {
if (iter->endInsertionPoint != nullptr) {
while (iter->insertionPoint->releaseDeferred) {
iter->insertionPoint = iter->insertionPoint->forwardTo;
}
while (iter->endInsertionPoint->releaseDeferred) {
iter->endInsertionPoint = iter->endInsertionPoint->forwardTo;
}
eraseInRange(iter->insertionPoint, iter->endInsertionPoint,
&writeContext);
assert(iter->endInsertionPoint != nullptr);
while (iter->insertionPoint->releaseDeferred) {
iter->insertionPoint = iter->insertionPoint->forwardTo;
}
while (iter->endInsertionPoint->releaseDeferred) {
iter->endInsertionPoint = iter->endInsertionPoint->forwardTo;
}
eraseInRange(iter->insertionPoint, iter->endInsertionPoint,
&writeContext);
}
if (count > kStackResultMax) [[unlikely]] {