Searched defs:Next (Results 176 - 200 of 315) sorted by path

1234567891011>>

/external/llvm/include/llvm/ADT/
H A Dilist.h32 // 1. The user must provide {g|s}et{Next|Prev} methods, or specialize
63 static void setNext(NodeTy *N, NodeTy *Next) { N->setNext(Next); } argument
503 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next); local
505 this->setNext(Prev, Next);
507 L2.Head = Next;
508 this->setPrev(Next, Prev);
609 for (iterator I = begin(), E = end(), Next = begin(); ++Next !
[all...]
H A Dilist_node.h46 NodeTy *Next; member in class:llvm::ilist_node
47 NodeTy *getNext() { return Next; }
48 const NodeTy *getNext() const { return Next; }
49 void setNext(NodeTy *N) { Next = N; }
51 ilist_node() : Next(nullptr) {}
81 NodeTy *Next = getNext(); local
84 if (!Next->getNext())
87 return Next;
92 const NodeTy *Next = getNext(); local
95 if (!Next
[all...]
/external/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h1034 auto Next = std::next(L); local
1036 L = std::prev(Next);
H A DScalarEvolutionExpressions.h497 /// Next - The next pointer in the linked list of all
499 SCEVUnknown *Next; member in class:llvm::SCEVUnknown
503 SCEV(ID, scUnknown), CallbackVH(V), SE(se), Next(next) {}
/external/llvm/include/llvm/CodeGen/
H A DMachineOperand.h166 MachineOperand *Next; member in struct:llvm::MachineOperand::__anon25488::__anon25489
597 Op.Contents.Reg.Next = nullptr;
H A DMachinePassRegistry.h54 MachinePassRegistryNode *Next; // Next function pass in list. member in class:llvm::MachinePassRegistryNode
62 : Next(nullptr)
69 MachinePassRegistryNode *getNext() const { return Next; }
70 MachinePassRegistryNode **getNextAddress() { return &Next; }
74 void setNext(MachinePassRegistryNode *N) { Next = N; }
H A DSelectionDAG.h215 DAGUpdateListener *const Next; member in struct:llvm::SelectionDAG::DAGUpdateListener
219 : Next(D.UpdateListeners), DAG(D) {
226 DAG.UpdateListeners = Next;
H A DSelectionDAGNodes.h244 /// pointer to the SDNode using the value, and Next and Prev pointers,
252 /// Prev, Next - Pointers to the uses list of the SDNode referred by
254 SDUse **Prev, *Next; member in class:llvm::SDUse
260 SDUse() : Val(), User(nullptr), Prev(nullptr), Next(nullptr) {}
273 SDUse *getNext() const { return Next; }
314 Next = *List;
315 if (Next) Next->Prev = &Next;
321 *Prev = Next;
[all...]
/external/llvm/include/llvm/IR/
H A DConstants.h530 /// Next - This forms a link list of ConstantDataSequential nodes that have
534 ConstantDataSequential *Next; member in class:llvm::ConstantDataSequential
539 : Constant(ty, VT, nullptr, 0), DataElements(Data), Next(nullptr) {}
540 ~ConstantDataSequential() { delete Next; }
H A DUse.h117 Use *getNext() const { return Next; }
136 Use *Next; member in class:llvm::Use
141 Next = *List;
142 if (Next)
143 Next->setPrev(&Next);
149 *StrippedPrev = Next;
150 if (Next)
151 Next->setPrev(StrippedPrev);
H A DValueHandle.h56 ValueHandleBase *Next; member in class:llvm::ValueHandleBase
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/
H A DArrayRecycler.h34 FreeList *Next; member in struct:llvm::ArrayRecycler::FreeList
51 Bucket[Idx] = Entry->Next;
61 Entry->Next = Bucket[Idx];
H A DManagedStatic.h45 mutable const ManagedStaticBase *Next; member in class:llvm::ManagedStaticBase
H A DOnDiskHashTable.h64 Item *Next; member in class:llvm::OnDiskChainedHashTableGenerator::Item
69 : Key(Key), Data(Data), Next(nullptr), Hash(InfoObj.ComputeHash(Key)) {}
93 E->Next = B.Head;
104 Item *N = E->Next;
105 E->Next = nullptr;
163 for (Item *I = B.Head; I; I = I->Next) {
H A DRecycler.h35 RecyclerStruct *Prev, *Next; member in struct:llvm::RecyclerStruct
42 static RecyclerStruct *getNext(const RecyclerStruct *t) { return t->Next; }
44 static void setNext(RecyclerStruct *t, RecyclerStruct *n) { t->Next = n; }
H A DRegistry.h74 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
90 node *Next; member in class:llvm::Registry::node
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; member in class:llvm::Registry::listener
159 listener() : Prev(ListenerTail), Next(0) {
161 Prev->Next = this;
168 if (Next)
169 Next
[all...]
H A DTargetRegistry.h154 /// Next - The next registered target in the linked list, maintained by the
156 Target *Next; member in class:llvm::Target
251 const Target *getNext() const { return Next; }
H A DTimer.h86 Timer **Prev, *Next; // Doubly linked list of timers in the group. member in class:llvm::Timer
166 TimerGroup **Prev, *Next; // Doubly linked list of TimerGroup's. member in class:llvm::TimerGroup
/external/llvm/lib/CodeGen/
H A DAnalysis.cpp419 /// Find the first non-empty, scalar-like type in Next and setup the iterator
422 /// Assuming Next is an aggregate of some kind, this function will traverse the
426 /// For example, if Next was {[0 x i64], {{}, i32, {}}, i32} then we would setup
427 /// Path as [1, 1] and SubTypes as [Next, {{}, i32, {}}] to represent the first
429 static bool firstRealType(Type *Next, argument
435 while (Next->isAggregateType() &&
436 indexReallyValid(cast<CompositeType>(Next), 0)) {
437 SubTypes.push_back(cast<CompositeType>(Next));
439 Next = cast<CompositeType>(Next)
[all...]
H A DCriticalAntiDepBreaker.cpp135 const SDep *Next = nullptr; local
148 Next = &*P;
151 return Next;
H A DExecutionDepsFix.cpp63 // merged, Victim.Next is set to point to Victor, so old DomainValue
65 DomainValue *Next; member in struct:__anon25742::DomainValue
104 Next = nullptr;
217 assert(!dv->Next && "Chained DomainValue shouldn't have been recycled");
233 DomainValue *Next = DV->Next; local
237 DV = Next;
245 if (!DV || !DV->Next)
249 do DV = DV->Next;
250 while (DV->Next);
[all...]
H A DMachineRegisterInfo.cpp179 // 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; local
224 HeadRef = Next;
226 Prev->Contents.Reg.Next = Next;
262 MachineOperand *Next = Src->Contents.Reg.Next; local
[all...]
H A DShadowStackGC.cpp102 IRBuilder<> *Next() { function in class:__anon25820::EscapeEnumerator
286 // ShadowStackEntry *Next; // Caller's stack entry.
434 while (IRBuilder<> *AtExit = EE.Next()) {
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDebugLocEntry.h104 /// \brief Attempt to merge this DebugLocEntry with Next and return
106 /// share the same Loc/Constant and if Next immediately follows this
108 bool Merge(const DebugLocEntry &Next) { argument
109 if ((End == Next.Begin && Values == Next.Values)) {
110 End = Next.End;
/external/llvm/lib/ExecutionEngine/JIT/
H A DJITMemoryManager.cpp108 FreeRangeHeader *Next; member in struct:__anon25848::FreeRangeHeader
124 assert(Next->Prev == this && Prev->Next == this && "Freelist broken!");
125 Next->Prev = Prev;
126 return Prev->Next = Next;
130 Next = FreeList;
132 Prev->Next = this;
133 Next->Prev = this;
177 FreeList = FollowingFreeBlock.Next;
[all...]

Completed in 367 milliseconds

1234567891011>>