| /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(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/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/r11/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();
|
| /prebuilts/ndk/r13/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();
|
| /frameworks/native/libs/vr/libbufferhubqueue/tests/ |
| buffer_hub_queue-test.cpp | 76 // But dequeue multiple times.
80 auto p1_status = producer_queue_->Dequeue(0, &slot, &fence);
87 auto c1_status = consumer_queue_->Dequeue(100, &slot, &mo, &fence);
112 // Consumer queue does not import buffers until a dequeue is issued.
114 // Dequeue returns timeout since no buffer is ready to consumer, but
117 auto status = consumer_queue_->Dequeue(0, &slot, &seq, &fence);
125 // First time, there is no buffer available to dequeue.
126 auto consumer_status = consumer_queue_->Dequeue(0, &slot, &seq, &fence);
131 // in the consumer's Dequeue() function.
132 auto producer_status = producer_queue_->Dequeue(0, &slot, &fence)
[all...] |
| /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));
|
| /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...] |
| /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/libbufferhubqueue/include/private/dvr/ |
| buffer_hub_queue_client.h | 53 // Return the number of buffers avaiable for dequeue.
101 // When pass |kNoTimeout| to |Dequeue|, it will block indefinitely without a
127 // Dequeue a buffer from the free queue, blocking until one is available. The
128 // timeout argument specifies the number of milliseconds that |Dequeue()| will
129 // block. Specifying a timeout of -1 causes |Dequeue()| to block indefinitely,
130 // while specifying a timeout equal to zero cause |Dequeue()| to return
132 pdx::Status<std::shared_ptr<BufferHubBuffer>> Dequeue(int timeout,
153 // additional dynamic memory allocation in each |Enqueue| and |Dequeue| call.
179 // buffer and should not be confused with the enqueue and dequeue order.
253 // sematics. When |Dequeue|, we pop the front element fro
[all...] |
