Searched refs:Enqueue (Results 1 - 25 of 79) sorted by relevance

1234

/external/chromium_org/v8/test/cctest/
H A Dtest-unbound-queue.cc41 cq.Enqueue(1);
54 cq.Enqueue(1);
57 cq.Enqueue(i);
67 cq.Enqueue(i);
/external/v8/src/
H A Dcircular-queue-inl.h37 void* SamplingCircularQueue::Enqueue() { function in class:v8::internal::SamplingCircularQueue
H A Dunbound-queue.h50 INLINE(void Enqueue(const Record& rec));
H A Dcircular-queue.h53 // Enqueue returns a pointer to a memory location for storing the next
55 INLINE(void* Enqueue());
H A Dcpu-profiler-inl.h62 new(ticks_buffer_.Enqueue()) TickSampleEventRecord(enqueue_order_);
/external/v8/test/cctest/
H A Dtest-unbound-queue.cc16 cq.Enqueue(1);
29 cq.Enqueue(1);
32 cq.Enqueue(i);
42 cq.Enqueue(i);
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DTreeIterator.cs95 nodes.Enqueue(eof);
110 nodes.Enqueue(tree); // real node is next after DOWN
118 nodes.Enqueue(up); // we're moving back up
126 nodes.Enqueue(eof); // add to queue, might have UP nodes in there
133 nodes.Enqueue(tree); // add to queue, might have UP nodes in there
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
H A DTreeIterator.cs105 nodes.Enqueue( eof );
129 nodes.Enqueue( tree ); // real node is next after DOWN
140 nodes.Enqueue( up ); // we're moving back up
149 nodes.Enqueue( eof ); // add to queue, might have UP nodes in there
158 nodes.Enqueue( tree ); // add to queue, might have UP nodes in there
/external/chromium_org/net/spdy/
H A Dspdy_read_queue.h33 void Enqueue(scoped_ptr<SpdyBuffer> buffer);
H A Dspdy_write_queue_unittest.cc84 write_queue.Enqueue(
86 write_queue.Enqueue(
88 write_queue.Enqueue(
126 write_queue.Enqueue(DEFAULT_PRIORITY, SYN_STREAM, producer1.Pass(),
128 write_queue.Enqueue(DEFAULT_PRIORITY, SYN_REPLY, producer2.Pass(),
130 write_queue.Enqueue(DEFAULT_PRIORITY, RST_STREAM, producer3.Pass(),
154 // Enqueue a bunch of writes and then call
166 write_queue.Enqueue(DEFAULT_PRIORITY, SYN_STREAM, IntToProducer(i), stream);
187 // Enqueue a bunch of writes and then call
208 write_queue.Enqueue(DEFAULT_PRIORIT
[all...]
H A Dspdy_write_queue.h39 void Enqueue(RequestPriority priority,
/external/chromium_org/v8/src/
H A Dunbound-queue.h50 INLINE(void Enqueue(const Record& rec));
H A Dcircular-queue-inl.h37 void* SamplingCircularQueue::Enqueue() { function in class:v8::internal::SamplingCircularQueue
H A Dcircular-queue.h53 // Enqueue returns a pointer to a memory location for storing the next
55 INLINE(void* Enqueue());
H A Dcpu-profiler-inl.h72 new(ticks_buffer_.Enqueue()) TickSampleEventRecord(last_code_event_id_);
/external/chromium/testing/gtest/samples/
H A Dsample3_unittest.cc78 q1_.Enqueue(1);
79 q2_.Enqueue(2);
80 q2_.Enqueue(3);
H A Dsample5_unittest.cc151 q1_.Enqueue(1);
152 q2_.Enqueue(2);
153 q2_.Enqueue(3);
/external/chromium_org/testing/gtest/samples/
H A Dsample3_unittest.cc78 q1_.Enqueue(1);
79 q2_.Enqueue(2);
80 q2_.Enqueue(3);
H A Dsample5_unittest.cc151 q1_.Enqueue(1);
152 q2_.Enqueue(2);
153 q2_.Enqueue(3);
/external/gtest/samples/
H A Dsample3_unittest.cc78 q1_.Enqueue(1);
79 q2_.Enqueue(2);
80 q2_.Enqueue(3);
H A Dsample5_unittest.cc151 q1_.Enqueue(1);
152 q2_.Enqueue(2);
153 q2_.Enqueue(3);
/external/protobuf/gtest/samples/
H A Dsample3_unittest.cc78 q1_.Enqueue(1);
79 q2_.Enqueue(2);
80 q2_.Enqueue(3);
H A Dsample5_unittest.cc151 q1_.Enqueue(1);
152 q2_.Enqueue(2);
153 q2_.Enqueue(3);
/external/openfst/src/include/fst/
H A Dqueue.h48 // void Enqueue(StateId s);
83 void Enqueue(StateId s) { Enqueue_(s); } function in class:fst::QueueBase
118 void Enqueue(StateId s) { front_ = s; } function in class:fst::TrivialQueue
130 virtual void Enqueue_(StateId s) { Enqueue(s); }
154 void Enqueue(StateId s) { push_front(s); } function in class:fst::FifoQueue
165 virtual void Enqueue_(StateId s) { Enqueue(s); }
187 void Enqueue(StateId s) { push_front(s); } function in class:fst::LifoQueue
198 virtual void Enqueue_(StateId s) { Enqueue(s); }
222 void Enqueue(StateId s) { function in class:fst::ShortestFirstQueue
243 Enqueue(
342 void Enqueue(StateId s) { function in class:fst::TopOrderQueue
394 void Enqueue(StateId s) { function in class:fst::StateOrderQueue
464 void Enqueue(StateId s) { function in class:fst::SccQueue
636 void Enqueue(StateId s) { queue_->Enqueue(s); } function in class:fst::AutoQueue
821 void Enqueue(StateId s) { function in class:fst::PruneQueue
907 void Enqueue(StateId s) { function in class:fst::FilterQueue
[all...]
/external/chromium_org/native_client_sdk/src/libraries/sdk_util/
H A Dthread_safe_queue.h32 void Enqueue(T* item) { function in class:sdk_util::ThreadSafeQueue

Completed in 848 milliseconds

1234