/external/swiftshader/third_party/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...] |
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
H A D | ilist_node_base.h | 23 ilist_node_base *Prev = nullptr; member in class:llvm::ilist_node_base 27 void setPrev(ilist_node_base *Prev) { this->Prev = Prev; } argument 29 ilist_node_base *getPrev() const { return Prev; } 41 void setPrev(ilist_node_base *Prev) { PrevAndSentinel.setPointer(Prev); } argument
|
H A D | ilist_base.h | 26 node_base_type &Prev = *Next.getPrev(); local 28 N.setPrev(&Prev); 29 Prev.setNext(&N); 34 node_base_type *Prev = N.getPrev(); local 36 Next->setPrev(Prev); 37 Prev->setNext(Next); 45 node_base_type *Prev = First.getPrev(); local 47 Last.setPrev(Prev); 48 Prev->setNext(&Last); 72 node_base_type &Prev local [all...] |
/external/llvm/lib/Fuzzer/ |
H A D | FuzzerTracePC.cpp | 36 static thread_local uintptr_t Prev; member in namespace:fuzzer 39 if (Prev) { 40 Prev = 0; 46 if (!Prev) 53 uintptr_t Next = (Prev << 5) ^ (PC & 4095); 55 Prev = Next;
|
/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/llvm/include/llvm/Support/ |
H A D | UnicodeCharRanges.h | 76 uint32_t Prev = 0; local 79 if (I != Ranges.begin() && Prev >= I->Lower) { 81 DEBUG(dbgs().write_hex(Prev)); 93 Prev = I->Upper;
|
/external/llvm/include/llvm/ADT/ |
H A D | SparseMultiSet.h | 85 /// 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...] |
H A D | ilist_node.h | 31 NodeTy *Prev; member in class:llvm::ilist_half_node 33 NodeTy *getPrev() { return Prev; } 34 const NodeTy *getPrev() const { return Prev; } 35 void setPrev(NodeTy *P) { Prev = P; } 36 ilist_half_node() : Prev(nullptr) {}
|
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
H A D | Registry.h | 136 listener *Prev, *Next; member in class:llvm::Registry::listener 153 listener() : Prev(ListenerTail), Next(0) { 154 if (Prev) 155 Prev->Next = this; 163 Next->Prev = Prev; 165 ListenerTail = Prev; 166 if (Prev) 167 Prev->Next = Next;
|
H A D | Recycler.h | 33 RecyclerStruct *Prev, *Next; member in struct:llvm::RecyclerStruct 39 static RecyclerStruct *getPrev(const RecyclerStruct *t) { return t->Prev; } 41 static void setPrev(RecyclerStruct *t, RecyclerStruct *p) { t->Prev = p; }
|
/external/swiftshader/third_party/llvm-subzero/include/llvm/IR/ |
H A D | Use.h | 18 /// one of the fields (Prev) of the Use class are used to encode offsets to be 78 Use(PrevPtrTag tag) : Val(nullptr) { Prev.setInt(tag); } 118 PointerIntPair<Use **, 2, PrevPtrTag> Prev; member in class:llvm::Use 120 void setPrev(Use **NewPrev) { Prev.setPointer(NewPrev); } 131 Use **StrippedPrev = Prev.getPointer();
|
/external/llvm/lib/Target/NVPTX/ |
H A D | NVPTXPeephole.cpp | 110 auto &Prev = *MRI.getUniqueVRegDef(Root.getOperand(1).getReg()); local 113 BuildMI(MF, Root.getDebugLoc(), TII->get(Prev.getOpcode()), 116 .addOperand(Prev.getOperand(2)); 121 if (MRI.hasOneNonDBGUse(Prev.getOperand(0).getReg())) { 122 Prev.eraseFromParentAndMarkDBGValuesForRemoval();
|
/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/include/llvm/IR/ |
H A D | Use.h | 18 /// one of the fields (Prev) of the Use class are used to encode offsets to be 88 Use(PrevPtrTag tag) : Val(nullptr) { Prev.setInt(tag); } 128 PointerIntPair<Use **, 2, PrevPtrTag> Prev; member in class:llvm::Use 130 void setPrev(Use **NewPrev) { Prev.setPointer(NewPrev); } 139 Use **StrippedPrev = Prev.getPointer();
|
/external/llvm/lib/Support/ |
H A D | PrettyStackTrace.cpp | 45 PrettyStackTraceEntry *Prev = nullptr; local 47 std::tie(Prev, Head, Head->NextEntry) = 48 std::make_tuple(Head, Head->NextEntry, Prev); 49 return Prev;
|
H A D | Timer.cpp | 247 TimerGroupList->Prev = &Next; 249 Prev = &TimerGroupList; 261 *Prev = Next; 263 Next->Prev = Prev; 277 *T.Prev = T.Next; 279 T.Next->Prev = T.Prev; 295 FirstTimer->Prev = &T.Next; 297 T.Prev [all...] |
/external/llvm/lib/CodeGen/ |
H A D | MachineRegisterInfo.cpp | 207 // Prev pointers are circular, so Head->Prev == Last. 211 MO->Contents.Reg.Prev = MO; 218 // Insert MO between Last and Head in the circular Prev chain. 219 MachineOperand *Last = Head->Contents.Reg.Prev; 222 Head->Contents.Reg.Prev = MO; 223 MO->Contents.Reg.Prev = Last; 247 MachineOperand *Prev = MO->Contents.Reg.Prev; local 249 // Prev link 288 MachineOperand *Prev = Src->Contents.Reg.Prev; local [all...] |
/external/swiftshader/third_party/LLVM/lib/Support/ |
H A D | Timer.cpp | 261 TimerGroupList->Prev = &Next; 263 Prev = &TimerGroupList; 275 *Prev = Next; 277 Next->Prev = Prev; 291 *T.Prev = T.Next; 293 T.Next->Prev = T.Prev; 310 FirstTimer->Prev = &T.Next; 312 T.Prev [all...] |
/external/llvm/lib/Option/ |
H A D | Option.cpp | 149 const char *Prev = Str; local 154 if (Prev != Str) { 155 char *Value = new char[Str - Prev + 1]; 156 memcpy(Value, Prev, Str - Prev); 157 Value[Str - Prev] = '\0'; 164 Prev = Str + 1;
|