/external/llvm/include/llvm/ADT/ |
H A D | ilist_node.h | 28 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(0) {} 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 D | SparseMultiSet.h | 81 /// circular in Prev indices, and INVALID-terminated in Next indices. This 89 unsigned Prev; member in struct:llvm::SparseMultiSet::SMSNode 92 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { } 101 return Prev == INVALID; 104 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 105 /// Prev. 106 bool isValid() const { return Prev != INVALID; } 140 return Dense[D.Prev].isTail(); 148 return &Dense[N.Prev] == &N; 153 unsigned addValue(const ValueT& V, unsigned Prev, unsigne argument 235 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 D | radeon_list.c | 40 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 D | radeon_list.h | 35 struct rc_list * Prev; member in struct:rc_list
|
H A D | radeon_program_alu.c | 235 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 D | radeon_program.c | 186 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 D | radeon_list.c | 40 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 D | radeon_list.h | 35 struct rc_list * Prev; member in struct:rc_list
|
H A D | radeon_program_alu.c | 235 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 D | radeon_program.c | 186 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/chromium_org/content/browser/indexed_db/leveldb/ |
H A D | leveldb_iterator.h | 19 virtual void Prev() = 0;
|
/external/chromium_org/third_party/WebKit/public/platform/ |
H A D | WebIDBCursor.h | 44 Prev = 2, enumerator in enum:blink::WebIDBCursor::Direction
|
/external/llvm/include/llvm/Support/ |
H A D | Registry.h | 139 listener *Prev, *Next; member in class:llvm::Registry::listener 156 listener() : Prev(ListenerTail), Next(0) { 157 if (Prev) 158 Prev->Next = this; 166 Next->Prev = Prev; 168 ListenerTail = Prev; 169 if (Prev) 170 Prev->Next = Next;
|
H A D | UnicodeCharRanges.h | 43 uint32_t Prev = 0; local 46 if (I != CharSet.begin() && Prev >= I->Lower) { 48 DEBUG(llvm::dbgs().write_hex(Prev)); 60 Prev = I->Upper;
|
H A D | Recycler.h | 36 RecyclerStruct *Prev, *Next; member in struct:llvm::RecyclerStruct 42 static RecyclerStruct *getPrev(const RecyclerStruct *t) { return t->Prev; } 44 static void setPrev(RecyclerStruct *t, RecyclerStruct *p) { t->Prev = p; }
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRLinkBase.h | 37 + (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 D | ANTLRLinkBase.h | 37 + (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 D | ANTLRLinkBase.h | 37 + (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 D | ANTLRLinkBase.h | 41 + (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/lib/CodeGen/ |
H A D | MachineRegisterInfo.cpp | 182 // Prev pointers are circular, so Head->Prev == Last. 186 MO->Contents.Reg.Prev = MO; 193 // Insert MO between Last and Head in the circular Prev chain. 194 MachineOperand *Last = Head->Contents.Reg.Prev; 197 Head->Contents.Reg.Prev = MO; 198 MO->Contents.Reg.Prev = Last; 222 MachineOperand *Prev = MO->Contents.Reg.Prev; local 224 // Prev link 263 MachineOperand *Prev = Src->Contents.Reg.Prev; local [all...] |
/external/chromium_org/third_party/leveldatabase/src/issues/ |
H A D | issue200_test.cc | 41 iter->Prev(); 43 iter->Prev();
|
/external/chromium_org/third_party/leveldatabase/src/table/ |
H A D | iterator_wrapper.h | 43 void Prev() { assert(iter_); iter_->Prev(); Update(); } function in class:leveldb::IteratorWrapper
|
/external/llvm/tools/lli/ |
H A D | RemoteTarget.cpp | 25 sys::MemoryBlock *Prev = Allocations.size() ? &Allocations.back() : NULL; local 26 sys::MemoryBlock Mem = sys::Memory::AllocateRWX(Size, Prev, &ErrorMsg);
|
/external/llvm/lib/Support/ |
H A D | Timer.cpp | 259 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 D | Option.cpp | 142 const char *Prev = Str; local 147 if (Prev != Str) { 148 char *Value = new char[Str - Prev + 1]; 149 memcpy(Value, Prev, Str - Prev); 150 Value[Str - Prev] = '\0'; 157 Prev = Str + 1;
|