Link/tracy
1
0
Fork 0
mirror of https://github.com/wolfpld/tracy.git synced 2025-03-20 07:40:02 +08:00
Code Issues Projects Wiki Activity

Queue MUST allocate memory.

Browse Source
This commit is contained in:
Bartosz Taudul 2017-10-13 20:33:53 +02:00
parent 7f36bb6846
commit 57afeb4588
1 changed files with 2 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
client/concurrentqueue.h
View File

@ -1915,34 +1915,16 @@ private:
// a block, a block index must have been successfully allocated. // a block, a block index must have been successfully allocated.
} }
else { else {
// Whatever head value we see here is >= the last value we saw here (relatively),
// and <= its current value. Since we have the most recent tail, the head must be
// <= to it.
auto head = this->headIndex.load(std::memory_order_relaxed);
assert(!details::circular_less_than<index_t>(currentTailIndex, head));
if (!details::circular_less_than<index_t>(head, currentTailIndex + BLOCK_SIZE)
|| (MAX_SUBQUEUE_SIZE != details::const_numeric_max<size_t>::value && (MAX_SUBQUEUE_SIZE == 0 || MAX_SUBQUEUE_SIZE - BLOCK_SIZE < currentTailIndex - head))) {
// We can't enqueue in another block because there's not enough leeway -- the
// tail could surpass the head by the time the block fills up! (Or we'll exceed
// the size limit, if the second part of the condition was true.)
return;
}
// We're going to need a new block; check that the block index has room // We're going to need a new block; check that the block index has room
if (pr_blockIndexRaw == nullptr || pr_blockIndexSlotsUsed == pr_blockIndexSize) { if (pr_blockIndexRaw == nullptr || pr_blockIndexSlotsUsed == pr_blockIndexSize) {
// Hmm, the circular block index is already full -- we'll need // Hmm, the circular block index is already full -- we'll need
// to allocate a new index. Note pr_blockIndexRaw can only be nullptr if // to allocate a new index. Note pr_blockIndexRaw can only be nullptr if
// the initial allocation failed in the constructor. // the initial allocation failed in the constructor.
new_block_index(pr_blockIndexSlotsUsed);
if (allocMode == CannotAlloc || !new_block_index(pr_blockIndexSlotsUsed)) {
return;
}
} }
// Insert a new block in the circular linked list // Insert a new block in the circular linked list
auto newBlock = this->parent->ConcurrentQueue::template requisition_block<allocMode>(); auto newBlock = this->parent->ConcurrentQueue::template requisition_block<allocMode>();
if (newBlock == nullptr) {
return;
}
#if MCDBGQ_TRACKMEM #if MCDBGQ_TRACKMEM
newBlock->owner = this; newBlock->owner = this;
#endif #endif
@ -3117,11 +3099,7 @@ private:
return block; return block;
} }
if (canAlloc == CanAlloc) { return create<Block>();
return create<Block>();
}
return nullptr;
} }