Searched refs:mQueue (Results 1 – 12 of 12) sorted by relevance
39 delete mQueue; in TearDown()44 mQueue = new (std::nothrow) MessageQueueSync(kNumElementsInQueue); in SetUp()45 ASSERT_NE(nullptr, mQueue); in SetUp()46 ASSERT_TRUE(mQueue->isValid()); in SetUp()47 mNumMessagesMax = mQueue->getQuantumCount(); in SetUp()51 MessageQueueSync* mQueue = nullptr; member in SynchronizedReadWrites58 delete mQueue; in TearDown()63 mQueue = new (std::nothrow) MessageQueueUnsync(kNumElementsInQueue); in SetUp()64 ASSERT_NE(nullptr, mQueue); in SetUp()65 ASSERT_TRUE(mQueue->isValid()); in SetUp()[all …]
71 delete mQueue; in TearDown()80 mQueue = new (std::nothrow) in SetUp()82 ASSERT_NE(nullptr, mQueue); in SetUp()83 ASSERT_TRUE(mQueue->isValid()); in SetUp()84 mNumMessagesMax = mQueue->getQuantumCount(); in SetUp()87 ASSERT_TRUE(mService->configureFmqSyncReadWrite(*mQueue->getDesc())); in SetUp()91 MessageQueueSync* mQueue = nullptr; member in SynchronizedReadWriteClient98 delete mQueue; in TearDown()108 mQueue = new (std::nothrow) MessageQueueUnsync(in); in SetUp()110 ASSERT_NE(nullptr, mQueue); in SetUp()[all …]
32 mQueue = std::make_shared<SynchronizedQueue<Task>>(limit); in start()36 if (mQueue) { in ~TaskRunner()37 mQueue->push(nullptr); in ~TaskRunner()42 if (mQueue == nullptr || !t) { in push()47 std::unique_lock<std::mutex> lock = mQueue->lock(); in push()49 if (!mQueue->isInitializedLocked()) { in push()52 std::thread{[q = mQueue] { in push()61 mQueue->setInitializedLocked(true); in push()65 return this->mQueue->push(t); in push()
62 std::queue<T> mQueue; member76 return !this->mQueue.empty(); in wait_pop()79 T item = mQueue.front(); in wait_pop()80 mQueue.pop(); in wait_pop()90 if (mQueue.size() < mQueueLimit) { in push()91 mQueue.push(item); in push()106 return mQueue.size(); in size()
31 success = mQueue.push(element); in push()44 success = mQueue.push(std::move(element)); in push()55 while (mQueue.empty()) { in pop()59 ElementType element(std::move(mQueue.front())); in pop()60 mQueue.pop(); in pop()67 return mQueue.empty(); in empty()73 return mQueue.size(); in size()79 return mQueue.remove(index); in remove()86 return mQueue[index];93 return mQueue[index];
105 ArrayQueue<ElementType, kSize> mQueue; variable
31 bool pushed = mQueue.push(event); in push()40 CHRE_ASSERT(!mQueue.empty()); in pop()42 Event *event = mQueue.front(); in pop()43 mQueue.pop(); in pop()
35 mQueue.push_front(std::move(item)); in push()41 mQueue.swap(other); in swap()46 std::deque<T> mQueue GUARDED_BY(mLock);
110 LockedQueue<std::vector<uint8_t>> mQueue; variable
392 mQueue.swap(q); in loop()446 mQueue.push(std::move(buf)); in query()
38 return mQueue.empty(); in empty()64 ArrayQueue<Event *, kMaxPendingEvents> mQueue; variable
63 std::shared_ptr<SynchronizedQueue<Task>> mQueue;