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

12

/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_);
H A Dcpu-profiler.cc72 events_buffer_.Enqueue(evt_rec);
92 events_buffer_.Enqueue(evt_rec);
109 events_buffer_.Enqueue(evt_rec);
126 events_buffer_.Enqueue(evt_rec);
137 events_buffer_.Enqueue(evt_rec);
150 events_buffer_.Enqueue(evt_rec);
168 events_buffer_.Enqueue(evt_rec);
183 ticks_from_vm_buffer_.Enqueue(record);
H A Dunbound-queue-inl.h78 void UnboundQueue<Record>::Enqueue(const Record& rec) { function in class:v8::internal::UnboundQueue
/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);
H A Dtest-circular-queue.cc25 Record* rec = reinterpret_cast<Record*>(scq.Enqueue());
34 Record* rec = reinterpret_cast<Record*>(scq.Enqueue());
40 Record* rec = reinterpret_cast<Record*>(scq.Enqueue());
97 Record* rec = reinterpret_cast<Record*>(scq_->Enqueue());
/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/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);
H A Dsample3-inl.h117 void Enqueue(const E& element) { function in class:Queue
157 new_queue->Enqueue(function(node->element()));
/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);
H A Dsample3-inl.h117 void Enqueue(const E& element) { function in class:Queue
157 new_queue->Enqueue(function(node->element()));
/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);
H A Dsample3-inl.h117 void Enqueue(const E & element) { function in class:Queue
157 new_queue->Enqueue(function(node->element()));
/external/openfst/src/include/fst/
H A Dqueue.h47 // void Enqueue(StateId s);
82 void Enqueue(StateId s) { Enqueue_(s); } function in class:fst::QueueBase
117 void Enqueue(StateId s) { front_ = s; } function in class:fst::TrivialQueue
129 virtual void Enqueue_(StateId s) { Enqueue(s); }
153 void Enqueue(StateId s) { push_front(s); } function in class:fst::FifoQueue
164 virtual void Enqueue_(StateId s) { Enqueue(s); }
186 void Enqueue(StateId s) { push_front(s); } function in class:fst::LifoQueue
197 virtual void Enqueue_(StateId s) { Enqueue(s); }
221 void Enqueue(StateId s) { function in class:fst::ShortestFirstQueue
242 Enqueue(
341 void Enqueue(StateId s) { function in class:fst::TopOrderQueue
393 void Enqueue(StateId s) { function in class:fst::StateOrderQueue
463 void Enqueue(StateId s) { function in class:fst::SccQueue
635 void Enqueue(StateId s) { queue_->Enqueue(s); } function in class:fst::AutoQueue
820 void Enqueue(StateId s) { function in class:fst::PruneQueue
[all...]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dqueue.h44 // void Enqueue(StateId s);
79 void Enqueue(StateId s) { Enqueue_(s); } function in class:fst::QueueBase
108 void Enqueue(StateId s) { front_ = s; } function in class:fst::TrivialQueue
117 virtual void Enqueue_(StateId s) { Enqueue(s); }
141 void Enqueue(StateId s) { push_front(s); } function in class:fst::FifoQueue
149 virtual void Enqueue_(StateId s) { Enqueue(s); }
171 void Enqueue(StateId s) { push_front(s); } function in class:fst::LifoQueue
179 virtual void Enqueue_(StateId s) { Enqueue(s); }
202 void Enqueue(StateId s) { function in class:fst::ShortestFirstQueue
214 Enqueue(
310 void Enqueue(StateId s) { function in class:fst::TopOrderQueue
360 void Enqueue(StateId s) { function in class:fst::StateOrderQueue
429 void Enqueue(StateId s) { function in class:fst::SccQueue
599 void Enqueue(StateId s) { queue_->Enqueue(s); } function in class:fst::AutoQueue
[all...]
/external/clang/lib/StaticAnalyzer/Checkers/
H A DVirtualCallChecker.cpp69 void Enqueue(WorkListUnit WLUnit) { function in class:__anon3936::WalkAST
134 Enqueue(CE);
159 Enqueue(CE);
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/
H A DFastQueue.cs104 public virtual void Enqueue(T o) { method in class:Antlr.Runtime.Misc.FastQueue
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/
H A DFastQueue.cs113 public virtual void Enqueue( T o ) method in class:Antlr.Runtime.Misc.FastQueue
/external/chromium/base/synchronization/
H A Dwaitable_event.h171 void Enqueue(Waiter* waiter);

Completed in 294 milliseconds

12