| /external/libvpx/libvpx/test/ |
| encode_test_driver.h | 55 const vpx_codec_cx_pkt_t *Next() {
|
| resize_test.cc | 108 virtual void Next() {
|
| /external/llvm/include/llvm/ADT/ |
| DepthFirstIterator.h | 77 // First element is node pointer, second is the 'next child' to visit
78 // if the int in PointerIntTy is 0, the 'next child' to visit is invalid
114 NodeType *Next = *It++;
115 // Has our next sibling been visited?
116 if (Next && !this->Visited.count(Next)) {
118 this->Visited.insert(Next);
119 VisitStack.push_back(std::make_pair(PointerIntTy(Next, 0),
120 GT::child_begin(Next)));
166 // skips all children of the current node and traverses to next nod
[all...] |
| EquivalenceClasses.h | 60 /// value itself, which provides the ordering that the set queries. Next, it
61 /// provides a "next pointer", which is used to enumerate all of the elements
70 mutable const ECValue *Leader, *Next;
72 // ECValue ctor - Start out with EndOfList pointing to this node, Next is
75 : Leader(this), Next((ECValue*)(intptr_t)1), Data(Elt) {}
89 assert(getNext() == nullptr && "Already has a next pointer!");
90 Next = (const ECValue*)((intptr_t)NewNext | (intptr_t)isLeader());
93 ECValue(const ECValue &RHS) : Leader(this), Next((ECValue*)(intptr_t)1),
101 bool isLeader() const { return (intptr_t)Next & 1; }
105 return (ECValue*)((intptr_t)Next & ~(intptr_t)1)
[all...] |
| SparseMultiSet.h | 85 /// circular in Prev indices, and INVALID-terminated in Next indices. This
94 unsigned Next;
96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { }
100 return Next == INVALID;
157 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) {
159 Dense.push_back(SMSNode(V, Prev, Next));
165 unsigned NextFree = Dense[Idx].Next;
168 Dense[Idx] = SMSNode(V, Prev, Next);
177 Dense[Idx].Next = FreelistIdx;
241 unsigned Next() const { return SMS->Dense[Idx].Next;
[all...] |
| /external/llvm/include/llvm/IR/ |
| ValueHandle.h | 56 ValueHandleBase *Next;
67 : PrevPair(nullptr, Kind), Next(nullptr), VP(nullptr, 0) {}
69 : PrevPair(nullptr, Kind), Next(nullptr), VP(V, 0) {
74 : PrevPair(nullptr, Kind), Next(nullptr), VP(RHS.VP) {
126 /// List is the address of either the head of the list or a Next node within
|
| /external/llvm/include/llvm/Support/ |
| Registry.h | 74 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
90 node *Next;
94 node(const entry& V) : Next(nullptr), Val(V) {
96 Tail->Next = this;
116 iterator &operator++() { Cur = Cur->Next; return *this; }
142 listener *Prev, *Next;
159 listener() : Prev(ListenerTail), Next(0) {
161 Prev->Next = this;
168 if (Next)
169 Next->Prev = Prev
[all...] |
| /external/llvm/lib/CodeGen/ |
| CriticalAntiDepBreaker.cpp | 132 /// CriticalPathStep - Return the next SUnit after SU on the bottom-up
135 const SDep *Next = nullptr;
148 Next = &*P;
151 return Next;
|
| MachineRegisterInfo.cpp | 179 // Next is NULL on the last list element.
185 MO->Contents.Reg.Next = nullptr;
202 MO->Contents.Reg.Next = Head;
206 MO->Contents.Reg.Next = nullptr;
207 Last->Contents.Reg.Next = MO;
219 MachineOperand *Next = MO->Contents.Reg.Next;
222 // Prev links are circular, next link is NULL instead of looping back to Head.
224 HeadRef = Next;
226 Prev->Contents.Reg.Next = Next
[all...] |
| /external/llvm/lib/Support/ |
| FoldingSet.cpp | 263 // Figure out the next link, remove NodeInBucket from the old link.
321 void *Next = *Bucket;
323 // If this is the first insertion into this bucket, its next pointer will be
326 if (!Next)
327 Next = reinterpret_cast<void*>(reinterpret_cast<intptr_t>(Bucket)|1);
329 // Set the node's next pointer, and make the bucket point to the node.
330 N->SetNextInBucket(Next);
354 // We found a node that points to N, change it to point to N's next node,
365 // whatever is next.
409 // Skip to the next non-null non-self-cycle bucket
[all...] |
| /external/llvm/lib/Target/R600/ |
| SILowerControlFlow.cpp | 158 // If the exec mask is non-zero, skip the next two instructions
354 // Read the next variant into VCC (lower 32 bits) <- also loop target
456 MachineBasicBlock::iterator I, Next;
457 for (I = MBB.begin(); I != MBB.end(); I = Next) {
458 Next = std::next(I);
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_program.h | 15 * next paragraph) shall be included in all copies or substantial
135 struct rc_instruction * Next;
153 * Instructions.Next points to the first instruction,
|
| /external/mesa3d/src/gallium/state_trackers/glx/xlib/ |
| xm_api.h | 349 struct xmesa_buffer *Next; /* Linked list pointer: */
|
| /external/protobuf/src/google/protobuf/io/ |
| coded_stream_unittest.cc | 704 // Skip to end of buffer and peek -- should get next buffer.
763 // Skip to end of buffer and peek -- should get next buffer.
[all...] |
| tokenizer.cc | 48 // The next approach that any good software engineer should look at is to
224 // Advance to the next character.
249 if (!input_->Next(&data, &buffer_size_)) {
464 bool Tokenizer::Next() {
|
| tokenizer_unittest.cc | 128 bool Next(const void** data, int* size) {
138 return array_stream_.Next(data, size);
255 // Before Next() is called, the initial token should always be TYPE_START.
262 ASSERT_TRUE(tokenizer.Next());
273 EXPECT_FALSE(tokenizer.Next());
275 // After Next() returns false, the token should have type TYPE_END.
296 ASSERT_TRUE(tokenizer.Next());
299 ASSERT_TRUE(tokenizer.Next());
302 ASSERT_TRUE(tokenizer.Next());
305 ASSERT_TRUE(tokenizer.Next());
[all...] |
| zero_copy_stream_impl.cc | 88 bool FileInputStream::Next(const void** data, int* size) {
89 return impl_.Next(data, size);
191 bool FileOutputStream::Next(void** data, int* size) {
192 return impl_.Next(data, size);
278 bool IstreamInputStream::Next(const void** data, int* size) {
279 return impl_.Next(data, size);
322 bool OstreamOutputStream::Next(void** data, int* size) {
323 return impl_.Next(data, size);
358 bool ConcatenatingInputStream::Next(const void** data, int* size) {
360 if (streams_[0]->Next(data, size)) return true
[all...] |
| /external/sfntly/cpp/src/sfntly/table/bitmap/ |
| bitmap_size_table.cc | 379 info.Attach(it->Next());
503 BitmapGlyphInfo* BitmapSizeTable::Builder::BitmapGlyphInfoIterator::Next() {
508 return Next(sub_table_glyph_info_iter_);
558 BitmapGlyphInfo* BitmapSizeTable::Builder::BitmapGlyphInfoIterator::Next(
566 return it->Next();
573 return it->Next();
580 return it->Next();
587 return it->Next();
594 return it->Next();
|
| index_sub_table_format4.cc | 364 IndexSubTableFormat4::Builder::BitmapGlyphInfoIterator::Next() {
|
| index_sub_table_format5.cc | 332 IndexSubTableFormat5::Builder::BitmapGlyphInfoIterator::Next() {
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| complement.h | 195 virtual void Next() {
197 siter_.Next();
247 virtual void Next() {
249 aiter_->Next();
|
| const-fst.h | 129 siter.Next()) {
134 aiter.Next())
148 aiter.Next()) {
351 void Next() { ++s_; }
377 void Next() { ++i_; }
|
| partition.h | 41 Element() : value(0), next(0), prev(0) {}
42 Element(T v) : value(v), next(0), prev(0) {}
45 Element* next; member in struct:fst::Partition::Element
65 // it current class and placing it at the head of the next class.
107 element->next = classes_[class_id];
121 if (element->next) element->next->prev = element->prev;
122 if (element->prev) element->prev->next = element->next;
123 else classes_[old_class_id] = element->next;
[all...] |
| relabel.h | 62 !siter.Done(); siter.Next()) {
65 !aiter.Done(); aiter.Next()) {
110 syms_iter.Next()) {
120 syms_iter.Next()) {
209 syms_iter.Next()) {
219 syms_iter.Next()) {
274 for (ArcIterator<Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next()) {
420 void Next() {
423 siter_.Next();
|
| string-weight.h | 170 void Next() {
202 void Next() {
242 for (StringWeightIterator<L, S> iter(*this); !iter.Done(); iter.Next()) {
261 for (StringWeightIterator<L, S> iter(*this); !iter.Done(); iter.Next())
269 for (StringWeightIterator<L, S> iter(*this); !iter.Done(); iter.Next())
281 // for (StringWeightIterator<L, S> iter(w); !iter.Done(); iter.Next())
296 for (; !iter1.Done() ; iter1.Next(), iter2.Next())
326 for (size_t i = 0; !iter.Done(); ++i, iter.Next()) {
390 iter1.Next(), iter2.Next()
[all...] |
