33#include < algorithm>
44
55#include " barretenberg/common/assert.hpp"
6- <<<<<<< HEAD
7- =======
86#include " barretenberg/common/compiler_hints.hpp"
97#include " barretenberg/common/log.hpp"
10- >>>>>>> origin/public-next
118#include " barretenberg/common/ref_vector.hpp"
129#include " barretenberg/vm2/tracegen/lib/trace_conversion.hpp"
1310
@@ -16,8 +13,6 @@ namespace {
1613
1714// We need a zero value to return (a reference to) when a value is not found.
1815const FF zero = FF ::zero();
19- <<<<<<< HEAD
20- =======
2116
2217// Writes each 64-bit limb of the field with a relaxed atomic store. Each limb is naturally aligned (FF is
2318// alignas(32), 4x uint64_t), so this lowers to 4 plain `movq` stores on x86-64 — no lock, no libatomic call
@@ -30,7 +25,6 @@ inline void store_per_limb(FF& cell, const FF& value)
3025 std::atomic_ref<uint64_t >(cell.data [i]).store (value.data [i], std::memory_order_relaxed);
3126 }
3227}
33- >>>>>>> origin/public-next
3428
3529} // namespace
3630
@@ -101,15 +95,11 @@ void TraceContainer::set(Column col, uint32_t row, const FF& value, bool use_ato
10195 // materialized (an unset cell already reads as zero).
10296 ColumnInterval* shard = column_data.slots [shard_idx].load (std::memory_order_acquire);
10397 if (shard != nullptr ) {
104- <<<<<<< HEAD
105- shard->rows [offset] = zero;
106- =======
10798 if (BB_UNLIKELY (use_atomic_limbs)) {
10899 store_per_limb (shard->rows [offset], zero);
109100 } else {
110- shard->rows [offset] = FF:: zero() ;
101+ shard->rows [offset] = zero;
111102 }
112- >>>>>>> origin/public-next
113103 }
114104 }
115105}
0 commit comments