GCC Code Coverage Report

Directory: Os/Generic/
File: Types/AtomicQueue.cpp
Date: 2026-09-23 21:12:40
Exec Total Coverage
Lines: 147 169 87.0%
Functions: 10 14 71.4%
Branches: 50 71 70.4%
Line Branch Exec Source
1 // ======================================================================
2 // \title AtomicQueue.cpp
3 // \author B. Duckett
4 // \brief Lock-free MPMC circular buffer with embedded buffer storage
5 //
6 // \copyright
7 // Copyright 2026, by the California Institute of Technology.
8 // ALL RIGHTS RESERVED. United States Government Sponsorship
9 // acknowledged.
10 //
11 // ======================================================================
12
13 #include <Fw/Types/Assert.hpp>
14 #include <Os/Generic/Types/AtomicQueue.hpp>
15 #include <cstdio>
16 #include <cstring>
17 #include <new>
18
19 namespace Types {
20
21 ✗ U32 AtomicQueue::computeChecksum(const U8* buffer, FwSizeType size) {
22 ✗ FW_ASSERT(buffer != nullptr);
23 ✗ U32 sum = 0;
24 ✗ for (FwSizeType i = 0; i < size; ++i) {
25 ✗ sum += buffer[i];
26 ✗ sum = (sum << 1) | (sum >> 31); // Rotate left
27 }
28 ✗ return sum;
29 }
30
31 1430 AtomicQueue::AtomicQueue()
32 1430 : m_slots(nullptr),
33 1430 m_bufferMemory(nullptr),
34 1430 m_capacity(0),
35 1430 m_bufferSize(0),
36 1430 m_mask(0),
37 1430 m_enqueuePos(0),
38 1430 m_dequeuePos(0),
39 1430 m_allocator(nullptr),
40 1430 m_allocatorId(0),
41 1430 m_notFullSem(nullptr) {}
42
43 1430 AtomicQueue::~AtomicQueue() {
44 1430 this->teardown();
45 1430 }
46
47 1430 void AtomicQueue::create(FwSizeType numBuffers,
48 FwSizeType bufferSize,
49 Fw::MemAllocator& allocator,
50 FwEnumStoreType allocatorId) {
51 1430 FW_ASSERT(numBuffers > 0, static_cast<FwAssertArgType>(numBuffers));
52 1430 FW_ASSERT(bufferSize > 0, static_cast<FwAssertArgType>(bufferSize));
53
54 1430 this->m_capacity = numBuffers;
55 1430 this->m_bufferSize = bufferSize;
56 1430 this->m_allocator = &allocator;
57 1430 this->m_allocatorId = allocatorId;
58
59 // Optimization: use bitwise AND for power-of-2, otherwise modulo
60 1430 bool isPowerOf2 = (numBuffers & (numBuffers - 1)) == 0;
61
2/2
✓ Branch 0 taken 166 times.
✓ Branch 1 taken 1264 times.
 1430 this->m_mask = isPowerOf2 ? (numBuffers - 1) : 0;
62
63 // Allocate slot array (with overflow check)
64 1430 FW_ASSERT(numBuffers <= std::numeric_limits<FwSizeType>::max() / sizeof(Slot),
65 static_cast<FwAssertArgType>(numBuffers), static_cast<FwAssertArgType>(sizeof(Slot)));
66 1430 FwSizeType slotsSize = numBuffers * sizeof(Slot);
67
1/1
✓ Branch 4 taken 1430 times.
 1430 void* slotMem = allocator.checkedAllocate(allocatorId, slotsSize, alignof(Slot));
68 1430 FW_ASSERT(slotMem != nullptr, static_cast<FwAssertArgType>(numBuffers), static_cast<FwAssertArgType>(bufferSize));
69 1430 this->m_slots = static_cast<Slot*>(slotMem);
70
71 // Allocate contiguous buffer memory for all slots (with overflow check)
72 1430 FW_ASSERT(numBuffers <= std::numeric_limits<FwSizeType>::max() / bufferSize,
73 static_cast<FwAssertArgType>(numBuffers), static_cast<FwAssertArgType>(bufferSize));
74 1430 FwSizeType totalBufferSize = numBuffers * bufferSize;
75
1/1
✓ Branch 4 taken 1430 times.
 1430 void* bufferMem = allocator.checkedAllocate(allocatorId, totalBufferSize, 64);
76 1430 FW_ASSERT(bufferMem != nullptr, static_cast<FwAssertArgType>(numBuffers), static_cast<FwAssertArgType>(bufferSize));
77 1430 this->m_bufferMemory = static_cast<U8*>(bufferMem);
78
79 // Initialize all slots with placement new and assign buffer pointers
80
2/2
✓ Branch 0 taken 27284 times.
✓ Branch 1 taken 1430 times.
 28714 for (FwSizeType i = 0; i < numBuffers; ++i) {
81 27284 Slot* slot = new (&this->m_slots[i]) Slot();
82
83 // Assign buffer from contiguous memory block
84 27284 slot->buffer = this->m_bufferMemory + (i * bufferSize);
85 27284 slot->size = 0;
86 27284 slot->sequence.store(i, std::memory_order_relaxed);
87
88 // Runtime verification that sequence atomics are lock-free
89 // This is critical for ISR safety and lock-free guarantee
90 27284 FW_ASSERT(slot->sequence.is_lock_free(), static_cast<FwAssertArgType>(i),
91 static_cast<FwAssertArgType>(numBuffers));
92 }
93
94 // Create semaphore for blocking enqueue support (all platforms)
95 // Allocate semaphore using provided allocator
96 1430 FwSizeType semSize = sizeof(Os::CountingSemaphore);
97
1/1
✓ Branch 4 taken 1430 times.
 1430 void* semMem = allocator.checkedAllocate(allocatorId, semSize, alignof(Os::CountingSemaphore));
98 1430 FW_ASSERT(semMem != nullptr, static_cast<FwAssertArgType>(numBuffers));
99
100 // Use placement new to construct semaphore with initial count = numBuffers (all slots available)
101
1/3
✓ Branch 3 taken 1430 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
 1430 this->m_notFullSem = new (semMem) Os::CountingSemaphore(static_cast<U32>(numBuffers));
102 1430 FW_ASSERT(this->m_notFullSem != nullptr, static_cast<FwAssertArgType>(numBuffers));
103
104 1430 this->m_enqueuePos.store(0, std::memory_order_relaxed);
105 1430 this->m_dequeuePos.store(0, std::memory_order_relaxed);
106 1430 }
107
108 4290 void AtomicQueue::teardown() {
109 // Destroy and deallocate semaphore
110
2/2
✓ Branch 2 taken 1430 times.
✓ Branch 3 taken 2860 times.
 4290 if (this->m_notFullSem != nullptr) {
111 1430 FW_ASSERT(this->m_allocator != nullptr, 0);
112
113 // Call destructor
114 1430 this->m_notFullSem->~CountingSemaphore();
115
116 // Deallocate memory
117 1430 this->m_allocator->deallocate(this->m_allocatorId, this->m_notFullSem);
118 1430 this->m_notFullSem = nullptr;
119 }
120
121 // Destroy slots and deallocate memory
122
2/2
✓ Branch 1 taken 1430 times.
✓ Branch 2 taken 2860 times.
 4290 if (this->m_slots != nullptr) {
123 1430 FW_ASSERT(this->m_capacity > 0, static_cast<FwAssertArgType>(this->m_capacity));
124 1430 FW_ASSERT(this->m_allocator != nullptr, 0);
125
126 // Call destructors on slots
127
2/2
✓ Branch 2 taken 27284 times.
✓ Branch 3 taken 1430 times.
 28714 for (FwSizeType i = 0; i < this->m_capacity; ++i) {
128 27284 FW_ASSERT(i < this->m_capacity, static_cast<FwAssertArgType>(i),
129 static_cast<FwAssertArgType>(this->m_capacity));
130 27284 this->m_slots[i].~Slot();
131 }
132
133 // Deallocate buffer memory
134
1/2
✓ Branch 2 taken 1430 times.
✗ Branch 3 not taken.
 1430 if (this->m_bufferMemory != nullptr) {
135 1430 this->m_allocator->deallocate(this->m_allocatorId, this->m_bufferMemory);
136 1430 this->m_bufferMemory = nullptr;
137 }
138
139 // Deallocate slot array
140 1430 this->m_allocator->deallocate(this->m_allocatorId, this->m_slots);
141 1430 this->m_slots = nullptr;
142 }
143
144 4290 this->m_enqueuePos.store(0, std::memory_order_relaxed);
145 4290 this->m_dequeuePos.store(0, std::memory_order_relaxed);
146 4290 this->m_capacity = 0;
147 4290 this->m_bufferSize = 0;
148 4290 this->m_mask = 0;
149 4290 this->m_allocator = nullptr;
150 4290 }
151
152 335821 bool AtomicQueue::enqueueInternal(const U8* buffer, FwSizeType size) {
153 335821 FW_ASSERT(this->m_slots != nullptr, 0);
154 339689 FW_ASSERT(buffer != nullptr, 0);
155 339689 FW_ASSERT(size > 0, static_cast<FwAssertArgType>(size));
156 339689 FW_ASSERT(size <= this->m_bufferSize, static_cast<FwAssertArgType>(size),
157 static_cast<FwAssertArgType>(this->m_bufferSize));
158
159
1/2
✓ Branch 0 taken 339259 times.
✗ Branch 1 not taken.
 338926 for (FwSizeType retry = 0; retry < MAX_CAS_RETRIES; ++retry) {
160 339259 FW_ASSERT(retry < MAX_CAS_RETRIES, static_cast<FwAssertArgType>(retry));
161
162 // acquire-release on slot->sequence ensures coherence, enqueuePos & dequeuePos are relaxed since strong memory
163 // ordering is not required
164
165 // Get current enqueue position
166 339259 FwSizeType pos = this->m_enqueuePos.load(std::memory_order_relaxed);
167
168 // Check against dequeue position to prevent lapping (detect full queue)
169 339200 FwSizeType deqPos = this->m_dequeuePos.load(std::memory_order_relaxed);
170 338637 FwSignedSizeType queueDiff = static_cast<FwSignedSizeType>(pos) - static_cast<FwSignedSizeType>(deqPos);
171
2/2
✓ Branch 2 taken 273562 times.
✓ Branch 3 taken 66302 times.
 338637 if (queueDiff >= static_cast<FwSignedSizeType>(this->m_capacity)) {
172 273562 return false; // Queue is full
173 }
174
175
1/1
✓ Branch 3 taken 66103 times.
 66302 Slot* slot = &this->m_slots[this->getIndex(pos)];
176 66255 FwSizeType seq = slot->sequence.load(std::memory_order_acquire);
177
178 // Check if slot is ready for write (seq == pos means available)
179 64983 FwSignedSizeType diff = static_cast<FwSignedSizeType>(seq) - static_cast<FwSignedSizeType>(pos);
180
181
2/2
✓ Branch 0 taken 64941 times.
✓ Branch 1 taken 42 times.
 64983 if (diff == 0) {
182 // Slot available, try to claim it
183
1/2
✓ Branch 4 taken 66718 times.
✗ Branch 5 not taken.
 129671 if (this->m_enqueuePos.compare_exchange_weak(pos, pos + 1, std::memory_order_release,
184 std::memory_order_relaxed)) {
185 // Claimed the slot, copy message data
186 66718 FW_ASSERT(slot->buffer != nullptr, static_cast<FwAssertArgType>(pos));
187
2/4
✗ Branch 1 not taken.
✓ Branch 2 taken 66348 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 66348 times.
 65825 (void)std::memcpy(slot->buffer, buffer, size);
188 66348 slot->size = size;
189
190 // Mark slot as ready for read
191 65611 slot->sequence.store(pos + 1, std::memory_order_release);
192 65172 return true;
193 }
194
1/2
✓ Branch 0 taken 72 times.
✗ Branch 1 not taken.
 42 } else if (diff < 0) {
195 // Queue is full (wrapped around)
196 72 return false;
197 }
198 // else: another producer claimed this slot, retry
199 }
200
201 ✗ return false;
202 }
203
204 336401 bool AtomicQueue::enqueue(const U8* buffer, FwSizeType size) {
205 336401 bool success = this->enqueueInternal(buffer, size);
206
207 // Decrement semaphore to track available slots (if semaphore exists)
208 // This ensures blocking sends see correct availability even when
209 // queue is filled via non-blocking sends.
210 //
211 // NOTE: tryWait() may fail due to race conditions when multiple threads
212 // concurrently enqueue. This is acceptable - the semaphore is a best-effort
213 // hint for blocking operations. The lock-free atomics in enqueueInternal()
214 // are the authoritative source of queue state.
215
3/4
✓ Branch 0 taken 66792 times.
✓ Branch 1 taken 271677 times.
✓ Branch 4 taken 66879 times.
✗ Branch 5 not taken.
 338469 if (success && this->m_notFullSem != nullptr) {
216 66879 (void)this->m_notFullSem->tryWait();
217 }
218
219 339146 return success;
220 }
221
222 1 bool AtomicQueue::enqueueBlocking(const U8* buffer, FwSizeType size, bool blockIfFull) {
223 1 FW_ASSERT(this->m_slots != nullptr, 0);
224 1 FW_ASSERT(buffer != nullptr, 0);
225
226 // If not blocking or no semaphore, just use non-blocking enqueue
227
2/4
✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 1 times.
 1 if (!blockIfFull || this->m_notFullSem == nullptr) {
228 ✗ return this->enqueue(buffer, size);
229 }
230
231 // Wait-first pattern: reserve slot via semaphore, then enqueue
232 // This prevents semaphore count drift under contention
233
1/2
✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
 1 for (FwSizeType attempt = 0; attempt < MAX_CAS_RETRIES; ++attempt) {
234 1 FW_ASSERT(attempt < MAX_CAS_RETRIES, static_cast<FwAssertArgType>(attempt));
235
236 // Reserve a slot by waiting on semaphore (blocks until space available)
237 1 Os::CountingSemaphoreInterface::Status status = this->m_notFullSem->wait();
238 1 FW_ASSERT(status == Os::CountingSemaphoreInterface::Status::OP_OK, static_cast<FwAssertArgType>(status));
239
240 // Try to enqueue (should succeed since we reserved a slot)
241 // Use internal method to avoid double-decrementing semaphore
242
1/2
✓ Branch 2 taken 1 times.
✗ Branch 3 not taken.
 1 if (this->enqueueInternal(buffer, size)) {
243 1 return true; // Success
244 }
245
246 // Extremely rare: slot was stolen between wait() and enqueue()
247 // Return the semaphore permit and retry
248 ✗ status = this->m_notFullSem->post();
249 ✗ FW_ASSERT(status == Os::CountingSemaphoreInterface::Status::OP_OK, static_cast<FwAssertArgType>(status));
250 }
251
252 // Exceeded retry limit (should never happen in practice)
253 ✗ return false;
254 }
255
256 67527 bool AtomicQueue::dequeue(U8* buffer, FwSizeType capacity, FwSizeType& actualSize) {
257 67527 FW_ASSERT(this->m_slots != nullptr, 0);
258 68523 FW_ASSERT(buffer != nullptr, 0);
259 68523 FW_ASSERT(capacity > 0, static_cast<FwAssertArgType>(capacity));
260
261
2/2
✓ Branch 0 taken 80421 times.
✓ Branch 1 taken 244 times.
 80665 for (FwSizeType retry = 0; retry < MAX_CAS_RETRIES; ++retry) {
262 80421 FW_ASSERT(retry < MAX_CAS_RETRIES, static_cast<FwAssertArgType>(retry));
263
264 // acquire-release on slot->sequence ensures coherence, enqueuePos & dequeuePos are relaxed since strong memory
265 // ordering is not required
266
267 // Get current dequeue & enqueue positions
268 80421 FwSizeType pos = this->m_dequeuePos.load(std::memory_order_relaxed);
269
1/1
✓ Branch 3 taken 79854 times.
 80249 Slot* slot = &this->m_slots[this->getIndex(pos)];
270 80012 FwSizeType seq = slot->sequence.load(std::memory_order_acquire);
271
272 // Check if slot is ready for read (seq == pos + 1 means data available)
273 79068 FwSignedSizeType diff = static_cast<FwSignedSizeType>(seq) - static_cast<FwSignedSizeType>(pos + 1);
274
275
2/2
✓ Branch 0 taken 75889 times.
✓ Branch 1 taken 3179 times.
 79068 if (diff == 0) {
276 // Slot has data, try to claim it
277
2/2
✓ Branch 4 taken 66190 times.
✓ Branch 5 taken 9949 times.
 152028 if (this->m_dequeuePos.compare_exchange_weak(pos, pos + 1, std::memory_order_release,
278 std::memory_order_relaxed)) {
279 // Claimed the slot, check size and copy data
280 // Note: sequence.load(acquire) at 10 lines above already synchronizes with
281 // enqueue's sequence.store(release), ensuring size & buffer coherency
282 66190 FW_ASSERT(slot->buffer != nullptr, static_cast<FwAssertArgType>(pos));
283 66194 FW_ASSERT(slot->size > 0, static_cast<FwAssertArgType>(slot->size));
284 66175 FW_ASSERT(slot->size <= capacity, static_cast<FwAssertArgType>(slot->size),
285 static_cast<FwAssertArgType>(capacity));
286
287 66172 actualSize = slot->size;
288
2/4
✗ Branch 2 not taken.
✓ Branch 3 taken 66170 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 66170 times.
 66170 (void)std::memcpy(buffer, slot->buffer, actualSize);
289
290 // Mark slot as available for next cycle (pos + capacity)
291 66170 slot->sequence.store(pos + this->m_capacity, std::memory_order_release);
292
293 // Post semaphore to wake up blocked enqueue threads (if semaphore exists)
294 // ISR-SAFETY NOTE: Calling from ISR depends on platform semaphore implementation.
295 // See header comments for details.
296
2/2
✓ Branch 2 taken 65982 times.
✓ Branch 3 taken 38 times.
 65770 if (this->m_notFullSem != nullptr) {
297
1/1
✓ Branch 6 taken 65579 times.
 65982 Os::CountingSemaphoreInterface::Status status = this->m_notFullSem->post();
298 65579 FW_ASSERT(status == Os::CountingSemaphoreInterface::Status::OP_OK,
299 static_cast<FwAssertArgType>(status));
300 }
301
302 65827 return true;
303 }
304
2/2
✓ Branch 0 taken 2867 times.
✓ Branch 1 taken 312 times.
 3179 } else if (diff < 0) {
305 // Queue is empty (no data written yet)
306 2867 return false;
307 }
308 // else: another consumer claimed this slot, retry
309 }
310
311 244 return false;
312 }
313
314 ✗ bool AtomicQueue::isFull() const {
315 // Queue is full if enqueue is exactly capacity ahead of dequeue
316 // Return false for uninitialized queue
317 ✗ if (this->m_capacity == 0) {
318 ✗ return false;
319 }
320 ✗ return this->getSize() >= this->m_capacity;
321 }
322
323 ✗ bool AtomicQueue::isEmpty() const {
324 ✗ return this->getSize() == 0;
325 }
326
327 172545 FwSizeType AtomicQueue::getSize() const {
328 // Safe to call on uninitialized queue
329
1/2
✗ Branch 2 not taken.
✓ Branch 3 taken 174692 times.
 172545 if (this->m_capacity == 0) {
330 ✗ return 0;
331 }
332 // A nonzero capacity implies the queue was created with backing storage
333 174692 FW_ASSERT(this->m_slots != nullptr);
334
335 174419 FwSizeType enq = this->m_enqueuePos.load(std::memory_order_relaxed);
336 172922 FwSizeType deq = this->m_dequeuePos.load(std::memory_order_relaxed);
337 169472 FwSignedSizeType diff = static_cast<FwSignedSizeType>(enq) - static_cast<FwSignedSizeType>(deq);
338
339 // Two independent relaxed loads provide no cross-variable consistency guarantee.
340 // Restrict to [0, capacity] rather than asserting — diff can be transiently negative
341 // or > capacity on concurrent access even though no real program state has that.
342
2/2
✓ Branch 0 taken 1 times.
✓ Branch 1 taken 169471 times.
 169472 if (diff < 0) {
343 1 return 0;
344 }
345
1/2
✗ Branch 2 not taken.
✓ Branch 3 taken 172840 times.
 169471 if (static_cast<FwSizeType>(diff) > this->m_capacity) {
346 ✗ return this->m_capacity;
347 }
348 172840 return static_cast<FwSizeType>(diff);
349 }
350
351 ✗ FwSizeType AtomicQueue::getCapacity() const {
352 // Safe to call on uninitialized queue - returns 0 if not created
353 ✗ return this->m_capacity;
354 }
355
356 336027 FwSizeType AtomicQueue::getBufferSize() const {
357 // Safe to call on uninitialized queue - returns 0 if not created
358 336027 return this->m_bufferSize;
359 }
360
361 } // namespace Types
362