Searched refs:Prev (Results 1 - 25 of 141) sorted by relevance

123456

/external/llvm/include/llvm/ADT/
H A Dilist_node.h28 NodeTy *Prev; member in class:llvm::ilist_half_node
30 NodeTy *getPrev() { return Prev; }
31 const NodeTy *getPrev() const { return Prev; }
32 void setPrev(NodeTy *P) { Prev = P; }
33 ilist_half_node() : Prev(nullptr) {}
59 NodeTy *Prev = this->getPrev(); local
62 if (!Prev->getNext())
65 return Prev;
70 const NodeTy *Prev = this->getPrev(); local
73 if (!Prev
[all...]
H A DSparseMultiSet.h85 /// circular in Prev indices, and INVALID-terminated in Next indices. This
93 unsigned Prev; member in struct:llvm::SparseMultiSet::SMSNode
96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { }
105 return Prev == INVALID;
108 /// Since the list is circular in Prev, all non-tombstone nodes have a valid
109 /// Prev.
110 bool isValid() const { return Prev != INVALID; }
144 return Dense[D.Prev].isTail();
152 return &Dense[N.Prev] == &N;
157 unsigned addValue(const ValueT& V, unsigned Prev, unsigne argument
240 unsigned Prev() const { return SMS->Dense[Idx].Prev; } function in class:llvm::SparseMultiSet::iterator_base
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/
H A Dradeon_list.c40 new->Prev = NULL;
57 new_value->Prev = temp;
67 rm_value->Prev->Next = rm_value->Next;
69 rm_value->Next->Prev = rm_value->Prev;
H A Dradeon_list.h35 struct rc_list * Prev; member in struct:rc_list
H A Dradeon_program_alu.c235 emit1(c, inst->Prev, RC_OPCODE_MOV, &inst->U.I, inst->U.I.DstReg, src);
253 emit1(c, inst->Prev, RC_OPCODE_FRC, 0, dst, negate(inst->U.I.SrcReg[0]));
254 emit2(c, inst->Prev, RC_OPCODE_ADD, &inst->U.I, inst->U.I.DstReg,
268 emit2(c, inst->Prev, RC_OPCODE_MIN, 0, dst,
270 emit2(c, inst->Prev, RC_OPCODE_MAX, &inst->U.I, inst->U.I.DstReg,
286 emit2(c, inst->Prev, RC_OPCODE_DP3, &inst->U.I, inst->U.I.DstReg, src0, src1);
297 emit2(c, inst->Prev, RC_OPCODE_DP4, &inst->U.I, inst->U.I.DstReg, src0, inst->U.I.SrcReg[1]);
308 emit2(c, inst->Prev, RC_OPCODE_MUL, &inst->U.I, inst->U.I.DstReg,
318 emit1(c, inst->Prev, RC_OPCODE_FRC, 0, dst, inst->U.I.SrcReg[0]);
319 emit2(c, inst->Prev, RC_OPCODE_AD
[all...]
H A Dradeon_program.c186 inst->Prev = after;
189 inst->Prev->Next = inst;
190 inst->Next->Prev = inst;
204 inst->Prev->Next = inst->Next;
205 inst->Next->Prev = inst->Prev;
/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_list.c40 new->Prev = NULL;
57 new_value->Prev = temp;
67 rm_value->Prev->Next = rm_value->Next;
69 rm_value->Next->Prev = rm_value->Prev;
H A Dradeon_list.h35 struct rc_list * Prev; member in struct:rc_list
H A Dradeon_program_alu.c235 emit1(c, inst->Prev, RC_OPCODE_MOV, &inst->U.I, inst->U.I.DstReg, src);
253 emit1(c, inst->Prev, RC_OPCODE_FRC, 0, dst, negate(inst->U.I.SrcReg[0]));
254 emit2(c, inst->Prev, RC_OPCODE_ADD, &inst->U.I, inst->U.I.DstReg,
268 emit2(c, inst->Prev, RC_OPCODE_MIN, 0, dst,
270 emit2(c, inst->Prev, RC_OPCODE_MAX, &inst->U.I, inst->U.I.DstReg,
286 emit2(c, inst->Prev, RC_OPCODE_DP3, &inst->U.I, inst->U.I.DstReg, src0, src1);
297 emit2(c, inst->Prev, RC_OPCODE_DP4, &inst->U.I, inst->U.I.DstReg, src0, inst->U.I.SrcReg[1]);
308 emit2(c, inst->Prev, RC_OPCODE_MUL, &inst->U.I, inst->U.I.DstReg,
318 emit1(c, inst->Prev, RC_OPCODE_FRC, 0, dst, inst->U.I.SrcReg[0]);
319 emit2(c, inst->Prev, RC_OPCODE_AD
[all...]
H A Dradeon_program.c186 inst->Prev = after;
189 inst->Prev->Next = inst;
190 inst->Next->Prev = inst;
204 inst->Prev->Next = inst->Next;
205 inst->Next->Prev = inst->Prev;
/external/llvm/include/llvm/Support/
H A DUnicodeCharRanges.h67 uint32_t Prev = 0; local
70 if (I != Ranges.begin() && Prev >= I->Lower) {
72 DEBUG(dbgs().write_hex(Prev));
84 Prev = I->Upper;
H A DRegistry.h142 listener *Prev, *Next; member in class:llvm::Registry::listener
159 listener() : Prev(ListenerTail), Next(0) {
160 if (Prev)
161 Prev->Next = this;
169 Next->Prev = Prev;
171 ListenerTail = Prev;
172 if (Prev)
173 Prev->Next = Next;
/external/chromium_org/content/browser/indexed_db/leveldb/
H A Dleveldb_iterator.h21 virtual leveldb::Status Prev() = 0;
H A Dleveldb_iterator_impl.cc55 leveldb::Status LevelDBIteratorImpl::Prev() { function in class:content::LevelDBIteratorImpl
57 iterator_->Prev();
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRLinkBase.h37 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
60 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
62 - (id<ANTLRLinkList>)initWithPtr:(id)np Prev:(id)pp;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRLinkBase.h37 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
60 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
62 - (id<ANTLRLinkList>)initWithPtr:(id)np Prev:(id)pp;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRLinkBase.h37 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
60 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
62 - (id<ANTLRLinkList>)initWithPtr:(id)np Prev:(id)pp;
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRLinkBase.h41 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
66 + (id<ANTLRLinkList>)newANTLRLinkBase:(id<ANTLRLinkList>)np Prev:(id<ANTLRLinkList>)pp;
68 - (id<ANTLRLinkList>)initWithPtr:(id)np Prev:(id)pp;
/external/llvm/include/llvm/IR/
H A DUse.h18 /// one of the fields (Prev) of the Use class are used to encode offsets to be
91 Use(PrevPtrTag tag) : Val(nullptr) { Prev.setInt(tag); }
137 PointerIntPair<Use **, 2, PrevPtrTag> Prev; member in class:llvm::Use
139 void setPrev(Use **NewPrev) { Prev.setPointer(NewPrev); }
148 Use **StrippedPrev = Prev.getPointer();
/external/llvm/lib/CodeGen/
H A DMachineRegisterInfo.cpp180 // Prev pointers are circular, so Head->Prev == Last.
184 MO->Contents.Reg.Prev = MO;
191 // Insert MO between Last and Head in the circular Prev chain.
192 MachineOperand *Last = Head->Contents.Reg.Prev;
195 Head->Contents.Reg.Prev = MO;
196 MO->Contents.Reg.Prev = Last;
220 MachineOperand *Prev = MO->Contents.Reg.Prev; local
222 // Prev link
261 MachineOperand *Prev = Src->Contents.Reg.Prev; local
[all...]
/external/chromium_org/third_party/leveldatabase/src/issues/
H A Dissue200_test.cc41 iter->Prev();
43 iter->Prev();
/external/chromium_org/third_party/leveldatabase/src/table/
H A Diterator_wrapper.h43 void Prev() { assert(iter_); iter_->Prev(); Update(); } function in class:leveldb::IteratorWrapper
/external/llvm/tools/lli/
H A DRemoteTarget.cpp33 sys::MemoryBlock *Prev = Allocations.size() ? &Allocations.back() : nullptr; local
34 sys::MemoryBlock Mem = sys::Memory::AllocateRWX(Size, Prev, &ErrorMsg);
/external/llvm/lib/Support/
H A DTimer.cpp259 TimerGroupList->Prev = &Next;
261 Prev = &TimerGroupList;
273 *Prev = Next;
275 Next->Prev = Prev;
289 *T.Prev = T.Next;
291 T.Next->Prev = T.Prev;
308 FirstTimer->Prev = &T.Next;
310 T.Prev
[all...]
/external/llvm/lib/Option/
H A DOption.cpp143 const char *Prev = Str; local
148 if (Prev != Str) {
149 char *Value = new char[Str - Prev + 1];
150 memcpy(Value, Prev, Str - Prev);
151 Value[Str - Prev] = '\0';
158 Prev = Str + 1;

Completed in 3927 milliseconds

123456