Searched defs:Next (Results 51 - 75 of 222) sorted by relevance

123456789

/external/llvm/include/llvm/ADT/
H A DDepthFirstIterator.h114 NodeType *Next = *It++; local
116 if (Next && this->Visited.insert(Next).second) {
118 VisitStack.push_back(std::make_pair(PointerIntTy(Next, 0),
119 GT::child_begin(Next)));
H A DEquivalenceClasses.h61 /// value itself, which provides the ordering that the set queries. Next, it
71 mutable const ECValue *Leader, *Next; member in class:llvm::EquivalenceClasses::ECValue
73 // ECValue ctor - Start out with EndOfList pointing to this node, Next is
76 : Leader(this), Next((ECValue*)(intptr_t)1), Data(Elt) {}
91 Next = (const ECValue*)((intptr_t)NewNext | (intptr_t)isLeader());
94 ECValue(const ECValue &RHS) : Leader(this), Next((ECValue*)(intptr_t)1),
102 bool isLeader() const { return (intptr_t)Next & 1; }
106 return (ECValue*)((intptr_t)Next & ~(intptr_t)1);
233 L2LV.Next = L2LV.getNext();
H A DMapVector.h136 auto Next = Vector.erase(Iterator); local
137 if (Next == Vector.end())
138 return Next;
141 size_t Index = Next - Vector.begin();
147 return Next;
/external/llvm/include/llvm/IR/
H A DValueHandle.h57 ValueHandleBase *Next; member in class:llvm::ValueHandleBase
64 : PrevPair(nullptr, Kind), Next(nullptr), V(nullptr) {}
66 : PrevPair(nullptr, Kind), Next(nullptr), V(V) {
71 : PrevPair(nullptr, Kind), Next(nullptr), V(RHS.V) {
121 /// List is the address of either the head of the list or a Next node within
/external/llvm/include/llvm/Support/
H A DRegistry.h73 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
89 node *Next; member in class:llvm::Registry::node
93 node(const entry& V) : Next(nullptr), Val(V) {
95 Tail->Next = this;
115 iterator &operator++() { Cur = Cur->Next; return *this; }
145 listener *Prev, *Next; member in class:llvm::Registry::listener
162 listener() : Prev(ListenerTail), Next(0) {
164 Prev->Next = this;
171 if (Next)
172 Next
[all...]
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDebugLocEntry.h99 /// \brief If this and Next are describing different pieces of the same
100 /// variable, merge them by appending Next's values to the current
103 bool MergeValues(const DebugLocEntry &Next) { argument
104 if (Begin == Next.Begin) {
108 cast_or_null<MDExpression>(Next.Values[0].Expression);
109 DIVariable NextVar = cast_or_null<MDLocalVariable>(Next.Values[0].Variable);
111 addValues(Next.Values);
112 End = Next.End;
119 /// \brief Attempt to merge this DebugLocEntry with Next and return
121 /// share the same Loc/Constant and if Next immediatel
123 MergeRanges(const DebugLocEntry &Next) argument
[all...]
/external/llvm/lib/CodeGen/
H A DCriticalAntiDepBreaker.cpp131 const SDep *Next = nullptr; local
144 Next = &*P;
147 return Next;
H A DExecutionDepsFix.cpp65 // merged, Victim.Next is set to point to Victor, so old DomainValue
67 DomainValue *Next; member in struct:__anon10417::DomainValue
109 Next = nullptr;
224 assert(!dv->Next && "Chained DomainValue shouldn't have been recycled");
240 DomainValue *Next = DV->Next; local
244 DV = Next;
252 if (!DV || !DV->Next)
256 do DV = DV->Next;
257 while (DV->Next);
[all...]
H A DMachineRegisterInfo.cpp175 // Next is NULL on the last list element.
181 MO->Contents.Reg.Next = nullptr;
198 MO->Contents.Reg.Next = Head;
202 MO->Contents.Reg.Next = nullptr;
203 Last->Contents.Reg.Next = MO;
215 MachineOperand *Next = MO->Contents.Reg.Next; local
220 HeadRef = Next;
222 Prev->Contents.Reg.Next = Next;
258 MachineOperand *Next = Src->Contents.Reg.Next; local
[all...]
/external/llvm/lib/Support/
H A DFoldingSet.cpp324 void *Next = *Bucket; local
329 if (!Next)
330 Next = reinterpret_cast<void*>(reinterpret_cast<intptr_t>(Bucket)|1);
333 N->SetNextInBucket(Next);
/external/llvm/lib/Target/NVPTX/
H A DNVPTXGenericToNVVM.cpp151 auto Next = std::next(I); local
153 I = Next;
/external/llvm/lib/Target/R600/
H A DSIFoldOperands.cpp168 MachineBasicBlock::iterator I, Next; local
169 for (I = MBB.begin(); I != MBB.end(); I = Next) {
170 Next = std::next(I);
H A DSILowerControlFlow.cpp445 MachineBasicBlock::iterator I, Next; local
446 for (I = MBB.begin(); I != MBB.end(); I = Next) {
447 Next = std::next(I);
/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_program.h135 struct rc_instruction * Next; member in struct:rc_instruction
153 * Instructions.Next points to the first instruction,
/external/mesa3d/src/gallium/state_trackers/glx/xlib/
H A Dxm_api.h349 struct xmesa_buffer *Next; /* Linked list pointer: */ member in struct:xmesa_buffer
/external/openfst/src/include/fst/
H A Darcsort.h60 for (ArcIterator< Fst<Arc> > aiter(fst_, s); !aiter.Done(); aiter.Next())
67 void Next() { ++i_; } function in class:fst::ArcSortMapper
H A Dcomplement.h205 void Next() { function in class:fst::StateIterator
207 siter_.Next();
222 virtual void Next_() { Next(); }
268 void Next() { function in class:fst::ArcIterator
270 aiter_->Next();
307 virtual void Next_() { Next(); }
H A Dpartition.h273 void Next() { function in class:fst::PartitionIterator
/external/openfst/src/include/fst/extensions/far/
H A Dcompile-strings.h38 // for (StringReader<Arc> reader(...); !reader.Done(); reader.Next()) {
61 Next(); // Initialize the reader to the first input.
68 void Next() { function in class:fst::StringReader
249 reader.Next()) {
H A Dstlist.h215 void Next() { function in class:fst::STListReader
H A Dsttable.h204 void Next() { function in class:fst::STTableReader
/external/protobuf/src/google/protobuf/io/
H A Dtokenizer_unittest.cc129 bool Next(const void** data, int* size) { function in class:google::protobuf::io::__anon13532::TestInputStream
139 return array_stream_.Next(data, size);
256 // Before Next() is called, the initial token should always be TYPE_START.
264 ASSERT_TRUE(tokenizer.Next());
277 EXPECT_FALSE(tokenizer.Next());
279 // After Next() returns false, the token should have type TYPE_END.
302 ASSERT_TRUE(tokenizer.Next());
305 ASSERT_TRUE(tokenizer.Next());
308 ASSERT_TRUE(tokenizer.Next());
311 ASSERT_TRUE(tokenizer.Next());
[all...]
H A Dzero_copy_stream_impl.cc89 bool FileInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::FileInputStream
90 return impl_.Next(data, size);
192 bool FileOutputStream::Next(void** data, int* size) { function in class:google::protobuf::io::FileOutputStream
193 return impl_.Next(data, size);
279 bool IstreamInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::IstreamInputStream
280 return impl_.Next(data, size);
323 bool OstreamOutputStream::Next(void** data, int* size) { function in class:google::protobuf::io::OstreamOutputStream
324 return impl_.Next(data, size);
359 bool ConcatenatingInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::ConcatenatingInputStream
361 if (streams_[0]->Next(dat
425 bool LimitingInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::LimitingInputStream
[all...]
H A Dzero_copy_stream_impl_lite.cc68 bool ArrayInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::ArrayInputStream
84 << "BackUp() can only be called after a successful Next().";
121 bool ArrayOutputStream::Next(void** data, int* size) { function in class:google::protobuf::io::ArrayOutputStream
137 << "BackUp() can only be called after a successful Next().";
157 bool StringOutputStream::Next(void** data, int* size) { function in class:google::protobuf::io::StringOutputStream
233 bool CopyingInputStreamAdaptor::Next(const void** data, int* size) { function in class:google::protobuf::io::CopyingInputStreamAdaptor
269 << " BackUp() can only be called after Next().";
272 " to Next().";
343 bool CopyingOutputStreamAdaptor::Next(void** data, int* size) { function in class:google::protobuf::io::CopyingOutputStreamAdaptor
359 << " BackUp() can only be called after Next()
[all...]
/external/sfntly/cpp/src/sfntly/table/bitmap/
H A Dindex_sub_table_format1.cc287 IndexSubTableFormat1::Builder::BitmapGlyphInfoIterator::Next() { function in class:sfntly::IndexSubTableFormat1::Builder::BitmapGlyphInfoIterator

Completed in 3313 milliseconds

123456789