Searched refs:mHead (Results 1 – 5 of 5) sorted by relevance
105 uint32_t head = mHead.load(); in size()176 if (tail != 0 && tail == mQueue.mHead.load()) { in nextStorage()185 mQueue.mHead = 0; in nextStorage()227 return mQueue.data()[mQueue.mHead.load() % kCapacity]; in front()230 return mQueue.data()[mQueue.mHead.load() % kCapacity]; in front()241 uint32_t headRaw = mQueue.mHead; in pop()244 mQueue.mHead = headRaw + 1; in pop()284 uint32_t headRaw = mQueue.mHead; in extractInternal()298 mQueue.mHead = headRaw + elementsToCopy; in extractInternal()313 chre::AtomicUint32 mHead{0};
52 return StorageType::data()[mHead]; in front()58 return StorageType::data()[mHead]; in front()127 StorageType::data()[mHead].~ElementType(); in pop()178 mHead = 0; in clear()188 : iterator(StorageType::data() + mHead, StorageType::data(), in begin()217 : const_iterator(StorageType::data() + mHead, StorageType::data(), in cbegin()231 size_t absoluteIndex = mHead + index; in relativeIndexToAbsolute()241 if (mHead > index) { in absoluteIndexToRelative()244 return index - mHead; in absoluteIndexToRelative()277 mHead = advanceOrWrapAround(mHead); in removeAndPullHead()[all …]
126 return locateDataAddress(mHead); in front()133 return locateDataAddress(mHead); in front()140 doRemove(mHead); in pop_front()147 mHead = advanceOrWrapAround(mHead); in pop_front()189 while ((searchIndex != mHead || firstRound) && in searchMatches()309 if (!empty() && mHead >= blockIndex * kBlockSize) { in insertBlock()313 mHead += kBlockSize; in insertBlock()374 mHead = advanceOrWrapAround(mHead); in pullBackward()395 size_t absoluteIndex = mHead + index; in relativeIndexToAbsolute()405 if (mHead > index) { in absoluteIndexToRelative()[all …]
414 size_t mHead = 0; variable
224 size_t mHead = 0;