Searched refs:Next (Results 1 - 25 of 256) sorted by relevance

1234567891011

/macosx-10.10/llvmCore-3425.0.34/include/llvm/ADT/
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(0) {}
81 NodeTy *Next = getNext(); local
84 if (!Next->getNext())
87 return Next;
92 const NodeTy *Next = getNext(); local
95 if (!Next
[all...]
H A DEquivalenceClasses.h60 /// value itself, which provides the ordering that the set queries. Next, it
70 mutable const ECValue *Leader, *Next; member in class:llvm::EquivalenceClasses::ECValue
72 // ECValue ctor - Start out with EndOfList pointing to this node, Next is
75 : Leader(this), Next((ECValue*)(intptr_t)1), Data(Elt) {}
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);
232 L2LV.Next = L2LV.getNext();
/macosx-10.10/llvmCore-3425.0.34/lib/Support/
H A DManagedStatic.cpp42 Next = StaticList;
48 assert(Ptr == 0 && DeleterFn == 0 && Next == 0 &&
54 Next = StaticList;
64 StaticList = Next;
65 Next = 0;
H A DTimer.cpp259 TimerGroupList->Prev = &Next;
260 Next = TimerGroupList;
273 *Prev = Next;
274 if (Next)
275 Next->Prev = Prev;
289 *T.Prev = T.Next;
290 if (T.Next)
291 T.Next->Prev = T.Prev;
308 FirstTimer->Prev = &T.Next;
309 T.Next
[all...]
/macosx-10.10/llvmCore-3425.0.34/include/llvm/Support/
H A DRegistry.h69 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
85 node *Next; member in class:llvm::Registry::node
89 node(const entry& V) : Next(0), Val(V) {
91 Tail->Next = this;
111 iterator &operator++() { Cur = Cur->Next; return *this; }
137 listener *Prev, *Next; member in class:llvm::Registry::listener
154 listener() : Prev(ListenerTail), Next(0) {
156 Prev->Next = this;
163 if (Next)
164 Next
[all...]
H A DRecycler.h34 RecyclerStruct *Prev, *Next; member in struct:llvm::RecyclerStruct
41 static RecyclerStruct *getNext(const RecyclerStruct *t) { return t->Next; }
43 static void setNext(RecyclerStruct *t, RecyclerStruct *n) { t->Next = n; }
/macosx-10.10/WebCore-7600.1.25/Modules/indexeddb/
H A DIndexedDB.h43 Next = 0, member in class:WebCore::IndexedDB::CursorDirection
/macosx-10.10/llvmCore-3425.0.34/include/llvm/
H A DUse.h113 Use *getNext() const { return Next; }
128 Use *Next; member in class:llvm::Use
135 Next = *List;
136 if (Next) Next->setPrev(&Next);
142 *StrippedPrev = Next;
143 if (Next) Next->setPrev(StrippedPrev);
/macosx-10.10/hfs-285/fsck_hfs/
H A Dcache.c281 (&buf[i-1])->Next = &buf[i];
349 searchBuf = searchBuf->Next;
359 cache->FreeBufs = buf->Next;
363 buf->Next = NULL;
426 /* Next cache block */
481 buf->Next = cache->ActiveBufs;
573 /* Next cache block */
620 if (buf->Next != NULL)
621 buf->Next->Prev = buf->Prev;
623 buf->Prev->Next
[all...]
H A Dcache.h66 struct LRUNode_t * Next; /* Next node in the LRU */ member in struct:LRUNode_t
87 struct Buf_t * Next; /* Next active buffer */ member in struct:Buf_t
111 struct Tag_t * Next; /* Next tag in hash chain */ member in struct:Tag_t
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/virtchannel_base/
H A Drandom.tcl60 append buffer [binary format c [my Next]]
69 method Next {} {
/macosx-10.10/llvmCore-3425.0.34/lib/VMCore/
H A DValue.cpp480 Next = *List;
483 if (Next) {
484 Next->setPrevPtr(&Next);
485 assert(VP.getPointer() == Next->VP.getPointer() && "Added to wrong list?");
492 Next = List->Next;
493 setPrevPtr(&List->Next);
494 List->Next = this;
495 if (Next)
[all...]
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Utils/
H A DSimplifyInstructions.cpp51 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
70 Next->insert(cast<Instruction>(*UI));
80 std::swap(ToSimplify, Next);
81 Next->clear();
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/term/
H A Dbind.tcl58 method next {c} {Next $c ; return}
60 foreach c [split $str {}] {Next $c}
66 proc Next {c} { procedure
86 # Incomplete sequence. Next state.
/macosx-10.10/llvmCore-3425.0.34/include/llvm/CodeGen/
H A DMachinePassRegistry.h54 MachinePassRegistryNode *Next; // Next function pass in list. member in class:llvm::MachinePassRegistryNode
62 : Next(NULL)
69 MachinePassRegistryNode *getNext() const { return Next; }
70 MachinePassRegistryNode **getNextAddress() { return &Next; }
74 void setNext(MachinePassRegistryNode *N) { Next = N; }
/macosx-10.10/llvmCore-3425.0.34/lib/CodeGen/
H A DMachineRegisterInfo.cpp128 // Next is NULL on the last list element.
134 MO->Contents.Reg.Next = 0;
151 MO->Contents.Reg.Next = Head;
155 MO->Contents.Reg.Next = 0;
156 Last->Contents.Reg.Next = MO;
168 MachineOperand *Next = MO->Contents.Reg.Next; local
173 HeadRef = Next;
175 Prev->Contents.Reg.Next = Next;
[all...]
/macosx-10.10/libxml2-26/libxml2/python/tests/
H A Dreader5.py26 if reader.Next() != 1: # skip the subtree
H A Dreadernext.py52 ret = reader.Next()
60 ret = reader.Next()
/macosx-10.10/pyobjc-45/2.6/pyobjc/pyobjc-core/libxml2-src/python/tests/
H A Dreader5.py27 if reader.Next() != 1: # skip the subtree
H A Dreadernext.py47 ret = reader.Next()
55 ret = reader.Next()
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/pt/
H A Dpt_peg_interp.tcl110 $self Next
124 $self Next
136 $self Next
147 $self Next
337 method Next {} {
/macosx-10.10/llvmCore-3425.0.34/lib/ExecutionEngine/JIT/
H A DJITMemoryManager.cpp103 FreeRangeHeader *Next; member in struct:__anon10320::FreeRangeHeader
119 assert(Next->Prev == this && Prev->Next == this && "Freelist broken!");
120 Next->Prev = Prev;
121 return Prev->Next = Next;
125 Next = FreeList;
127 Prev->Next = this;
128 Next->Prev = this;
172 FreeList = FollowingFreeBlock.Next;
[all...]
/macosx-10.10/AppleUSBIrDA-145.2.4/IrDA/Utils/
H A DCBuffer.h34 virtual int Next(void) = 0;
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Scalar/
H A DLoopInstSimplify.cpp76 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
116 Next->insert(cast<Instruction>(*UI));
167 std::swap(ToSimplify, Next);
168 Next->clear();
/macosx-10.10/llvmCore-3425.0.34/tools/llvm-diff/
H A DDifferenceEngine.cpp502 DiffEntry *Next = Paths2.data(); local
519 Next[0] = Cur[0];
520 Next[0].Cost += RightCost;
521 Next[0].Path.push_back(DC_right);
526 Next[Index] = Cur[Index-1];
527 Next[Index].Cost += MatchCost;
528 Next[Index].Path.push_back(DC_match);
530 } else if (Next[Index-1].Cost <= Cur[Index].Cost) {
531 Next[Index] = Next[Inde
[all...]

Completed in 158 milliseconds

1234567891011