| /external/google-breakpad/src/testing/gtest/samples/ |
| sample3_unittest.cc | 128 // Tests Dequeue().
129 TEST_F(QueueTest, Dequeue) {
130 int * n = q0_.Dequeue();
133 n = q1_.Dequeue();
139 n = q2_.Dequeue();
|
| sample5_unittest.cc | 177 // Tests Dequeue().
178 TEST_F(QueueTest, Dequeue) {
179 int* n = q0_.Dequeue();
182 n = q1_.Dequeue();
188 n = q2_.Dequeue();
|
| /external/googletest/googletest/samples/ |
| sample3_unittest.cc | 128 // Tests Dequeue().
129 TEST_F(QueueTestSmpl3, Dequeue) {
130 int * n = q0_.Dequeue();
133 n = q1_.Dequeue();
139 n = q2_.Dequeue();
|
| sample5_unittest.cc | 177 // Tests Dequeue().
178 TEST_F(QueueTest, Dequeue) {
179 int* n = q0_.Dequeue();
182 n = q1_.Dequeue();
188 n = q2_.Dequeue();
|
| /external/protobuf/gtest/samples/ |
| sample3_unittest.cc | 128 // Tests Dequeue().
129 TEST_F(QueueTest, Dequeue) {
130 int * n = q0_.Dequeue();
133 n = q1_.Dequeue();
139 n = q2_.Dequeue();
|
| sample5_unittest.cc | 177 // Tests Dequeue().
178 TEST_F(QueueTest, Dequeue) {
179 int* n = q0_.Dequeue();
182 n = q1_.Dequeue();
188 n = q2_.Dequeue();
|
| /external/v8/testing/gtest/samples/ |
| sample3_unittest.cc | 128 // Tests Dequeue().
129 TEST_F(QueueTest, Dequeue) {
130 int * n = q0_.Dequeue();
133 n = q1_.Dequeue();
139 n = q2_.Dequeue();
|
| sample5_unittest.cc | 177 // Tests Dequeue().
178 TEST_F(QueueTest, Dequeue) {
179 int* n = q0_.Dequeue();
182 n = q1_.Dequeue();
188 n = q2_.Dequeue();
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| sample3_unittest.cc | 128 // Tests Dequeue().
129 TEST_F(QueueTest, Dequeue) {
130 int * n = q0_.Dequeue();
133 n = q1_.Dequeue();
139 n = q2_.Dequeue();
|
| sample5_unittest.cc | 177 // Tests Dequeue().
178 TEST_F(QueueTest, Dequeue) {
179 int* n = q0_.Dequeue();
182 n = q1_.Dequeue();
188 n = q2_.Dequeue();
|
| /prebuilts/ndk/r16/sources/third_party/googletest/googletest/samples/ |
| sample3_unittest.cc | 128 // Tests Dequeue().
129 TEST_F(QueueTest, Dequeue) {
130 int * n = q0_.Dequeue();
133 n = q1_.Dequeue();
139 n = q2_.Dequeue();
|
| sample5_unittest.cc | 177 // Tests Dequeue().
178 TEST_F(QueueTest, Dequeue) {
179 int* n = q0_.Dequeue();
182 n = q1_.Dequeue();
188 n = q2_.Dequeue();
|
| /external/v8/src/ |
| locked-queue.h | 25 inline bool Dequeue(Record* record);
|
| /external/v8/src/profiler/ |
| unbound-queue.h | 27 INLINE(bool Dequeue(Record* rec));
|
| /frameworks/native/libs/vr/libbufferhubqueue/tests/ |
| buffer_hub_queue-test.cpp | 96 // But dequeue multiple times.
103 auto p1_status = producer_queue_->Dequeue(kTimeoutMs, &slot, &mo, &fence);
113 auto c1_status = consumer_queue_->Dequeue(kTimeoutMs, &slot, &mo, &fence);
142 // Consumer queue does not import buffers until a dequeue is issued.
144 // Dequeue returns timeout since no buffer is ready to consumer, but
146 auto status = consumer_queue_->Dequeue(kNoTimeout, &slot, &mo, &fence);
156 // First time there is no buffer available to dequeue.
158 consumer_queue_->Dequeue(kNoTimeout, &slot, &mo, &fence);
163 // in the consumer's Dequeue() function.
165 producer_queue_->Dequeue(kTimeoutMs, &slot, &mo, &fence)
[all...] |
| /system/bt/osi/test/ |
| leaky_bonded_queue_test.cc | 66 MockItem* item2_2 = queue->Dequeue();
67 MockItem* item3_3 = queue->Dequeue();
68 MockItem* item4_4 = queue->Dequeue();
95 MockItem* item1_1 = queue->Dequeue();
108 MockItem* item4_4_4 = queue->Dequeue();
109 MockItem* item1_1_1 = queue->Dequeue();
129 MockItem* item1_1 = queue->Dequeue();
148 MockItem* item4_4_4 = queue->Dequeue();
149 MockItem* item1_1_1 = queue->Dequeue();
169 MockItem* item1_1 = queue->Dequeue();
[all...] |
| /frameworks/native/libs/vr/libbufferhubqueue/include/private/dvr/ |
| buffer_hub_queue_client.h | 74 // Returns the number of buffers avaiable for dequeue.
156 // Dequeue a buffer from the free queue, blocking until one is available. The
157 // timeout argument specifies the number of milliseconds that |Dequeue()| will
158 // block. Specifying a timeout of -1 causes Dequeue() to block indefinitely,
159 // while specifying a timeout equal to zero cause Dequeue() to return
161 pdx::Status<std::shared_ptr<BufferHubBuffer>> Dequeue(int timeout,
255 // Buffers and related data that are available for dequeue.
342 // Dequeue a producer buffer to write. The returned buffer in |Gain|'ed mode,
345 pdx::Status<std::shared_ptr<BufferProducer>> Dequeue(
347 pdx::Status<std::shared_ptr<BufferProducer>> Dequeue(
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeIterator.cs | 101 Current = nodes.Dequeue();
127 Current = nodes.Dequeue();
134 Current = nodes.Dequeue();
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| TreeIterator.cs | 114 Current = nodes.Dequeue();
150 Current = nodes.Dequeue();
159 Current = nodes.Dequeue();
|
| /bionic/tools/relocation_packer/src/ |
| sleb128.h | 60 int_t Dequeue();
|
| sleb128.cc | 96 uint_t Sleb128Decoder<uint_t>::Dequeue() {
122 values->push_back(Dequeue());
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/ |
| LookaheadStream.cs | 90 public override T Dequeue() {
104 _previousElement = Dequeue();
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/ |
| LookaheadStream.cs | 105 public override T Dequeue()
122 _previousElement = Dequeue();
|
| /frameworks/native/libs/vr/libdvr/ |
| dvr_buffer_queue_internal.h | 45 int Dequeue(int timeout, DvrWriteBuffer* write_buffer, int* out_fence_fd);
77 int Dequeue(int timeout, DvrReadBuffer* read_buffer, int* out_fence_fd,
|
| /system/bt/osi/include/ |
| leaky_bonded_queue.h | 33 * improvements could be made to lock enqueue and dequeue separately, it
55 * Add item NEW_ITEM to the underlining queue. If the queue is full, dequeue
62 T* Dequeue();
125 T* LeakyBondedQueue<T>::Dequeue() {
|
