/external/deqp/external/vulkancts/modules/vulkan/spirv_assembly/ |
D | vktSpvAsmTerminateInvocationTests.cpp | 111 std::vector<std::string> Stores; in createTerminateInvocationGroup() local 112 Stores.push_back("Features.fragmentStoresAndAtomics"); in createTerminateInvocationGroup() 129 ….add("no_ssbo_store", "no store to SSBO when it occurs after terminate invocation", false, Stores); in createTerminateInvocationGroup() 130 …ssbo_atomic", "no atomic update to SSBO when it occurs after terminate invocation", false, Stores); in createTerminateInvocationGroup() 131 …before_terminate", "ssbo store commits when it occurs before terminate invocation", false, Stores); in createTerminateInvocationGroup() 132 …p.add("no_image_store", "no image write when it occurs after terminate invocation", false, Stores); in createTerminateInvocationGroup() 133 …image_atomic", "no image atomic updates when it occurs after terminate invocation", false, Stores); in createTerminateInvocationGroup()
|
/external/llvm-project/llvm/lib/Transforms/Scalar/ |
D | Sink.cpp | 36 SmallPtrSetImpl<Instruction *> &Stores) { in isSafeToMove() argument 39 Stores.insert(Inst); in isSafeToMove() 45 for (Instruction *S : Stores) in isSafeToMove() 60 for (Instruction *S : Stores) in isSafeToMove() 108 SmallPtrSetImpl<Instruction *> &Stores, in SinkInstruction() argument 118 if (!isSafeToMove(Inst, AA, Stores)) in SinkInstruction() 195 SmallPtrSet<Instruction *, 8> Stores; in ProcessBlock() local 208 if (SinkInstruction(Inst, Stores, DT, LI, AA)) { in ProcessBlock()
|
/external/llvm/lib/Transforms/Scalar/ |
D | Sink.cpp | 61 SmallPtrSetImpl<Instruction *> &Stores) { in isSafeToMove() argument 64 Stores.insert(Inst); in isSafeToMove() 70 for (Instruction *S : Stores) in isSafeToMove() 85 for (Instruction *S : Stores) in isSafeToMove() 140 SmallPtrSetImpl<Instruction *> &Stores, in SinkInstruction() argument 150 if (!isSafeToMove(Inst, AA, Stores)) in SinkInstruction() 216 SmallPtrSet<Instruction *, 8> Stores; in ProcessBlock() local 229 if (SinkInstruction(Inst, Stores, DT, LI, AA)) { in ProcessBlock()
|
D | LoopIdiomRecognize.cpp | 118 SmallPtrSetImpl<Instruction *> &Stores, 747 SmallPtrSetImpl<Instruction *> &Stores, const SCEVAddRecExpr *Ev, in processLoopStridedStore() argument 782 *AA, Stores)) { in processLoopStridedStore() 836 for (auto *I : Stores) in processLoopStridedStore() 889 SmallPtrSet<Instruction *, 1> Stores; in processLoopStoreOfLoopLoad() local 890 Stores.insert(SI); in processLoopStoreOfLoopLoad() 892 StoreSize, *AA, Stores)) { in processLoopStoreOfLoopLoad() 912 *AA, Stores)) { in processLoopStoreOfLoopLoad()
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
D | Sink.cpp | 61 SmallPtrSetImpl<Instruction *> &Stores) { in isSafeToMove() argument 64 Stores.insert(Inst); in isSafeToMove() 70 for (Instruction *S : Stores) in isSafeToMove() 85 for (Instruction *S : Stores) in isSafeToMove() 140 SmallPtrSetImpl<Instruction *> &Stores, in SinkInstruction() argument 150 if (!isSafeToMove(Inst, AA, Stores)) in SinkInstruction() 215 SmallPtrSet<Instruction *, 8> Stores; in ProcessBlock() local 228 if (SinkInstruction(Inst, Stores, DT, LI, AA)) { in ProcessBlock()
|
/external/llvm/lib/Analysis/ |
D | AliasAnalysisEvaluator.cpp | 104 SetVector<Value *> Stores; in runInternal() local 116 Stores.insert(&*I); in runInternal() 179 for (Value *Store : Stores) { in runInternal() 207 for (SetVector<Value *>::iterator I1 = Stores.begin(), E = Stores.end(); in runInternal() 209 for (SetVector<Value *>::iterator I2 = Stores.begin(); I2 != I1; ++I2) { in runInternal()
|
/external/llvm-project/llvm/lib/Analysis/ |
D | AliasAnalysisEvaluator.cpp | 102 SetVector<Value *> Stores; in runInternal() local 114 Stores.insert(&*I); in runInternal() 179 for (Value *Store : Stores) { in runInternal() 204 for (SetVector<Value *>::iterator I1 = Stores.begin(), E = Stores.end(); in runInternal() 206 for (SetVector<Value *>::iterator I2 = Stores.begin(); I2 != I1; ++I2) { in runInternal()
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
D | HexagonStoreWidening.cpp | 96 bool instrAliased(InstrGroup &Stores, const MachineMemOperand &MMO); 97 bool instrAliased(InstrGroup &Stores, const MachineInstr *MI); 170 bool HexagonStoreWidening::instrAliased(InstrGroup &Stores, in instrAliased() argument 177 for (auto SI : Stores) { in instrAliased() 192 bool HexagonStoreWidening::instrAliased(InstrGroup &Stores, in instrAliased() argument 195 if (instrAliased(Stores, *I)) in instrAliased()
|
/external/llvm/lib/Target/Hexagon/ |
D | HexagonStoreWidening.cpp | 86 bool instrAliased(InstrGroup &Stores, const MachineMemOperand &MMO); 87 bool instrAliased(InstrGroup &Stores, const MachineInstr *MI); 168 bool HexagonStoreWidening::instrAliased(InstrGroup &Stores, in instrAliased() argument 175 for (auto SI : Stores) { in instrAliased() 191 bool HexagonStoreWidening::instrAliased(InstrGroup &Stores, in instrAliased() argument 194 if (instrAliased(Stores, *I)) in instrAliased()
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
D | AliasAnalysisEvaluator.cpp | 102 SetVector<Value *> Stores; in runInternal() local 114 Stores.insert(&*I); in runInternal() 179 for (Value *Store : Stores) { in runInternal() 204 for (SetVector<Value *>::iterator I1 = Stores.begin(), E = Stores.end(); in runInternal() 206 for (SetVector<Value *>::iterator I2 = Stores.begin(); I2 != I1; ++I2) { in runInternal()
|
/external/llvm-project/llvm/lib/Target/Hexagon/ |
D | HexagonStoreWidening.cpp | 96 bool instrAliased(InstrGroup &Stores, const MachineMemOperand &MMO); 97 bool instrAliased(InstrGroup &Stores, const MachineInstr *MI); 170 bool HexagonStoreWidening::instrAliased(InstrGroup &Stores, in instrAliased() argument 177 for (auto SI : Stores) { in instrAliased() 192 bool HexagonStoreWidening::instrAliased(InstrGroup &Stores, in instrAliased() argument 195 if (instrAliased(Stores, *I)) in instrAliased()
|
/external/llvm/include/llvm/Transforms/Vectorize/ |
D | SLPVectorizer.h | 102 bool vectorizeStores(ArrayRef<StoreInst *> Stores, int costThreshold, 106 StoreListMap Stores; member
|
/external/llvm-project/llvm/lib/CodeGen/ |
D | ScheduleDAGInstrs.cpp | 761 Value2SUsMap Stores, Loads(1 /*TrueMemOrderLatency*/); in buildSchedGraph() local 903 addBarrierChain(Stores); in buildSchedGraph() 946 addChainDependencies(SU, Stores); in buildSchedGraph() 952 Stores.insert(SU, UnknownValue); in buildSchedGraph() 961 addChainDependencies(SU, (ThisMayAlias ? Stores : NonAliasStores), V); in buildSchedGraph() 971 (ThisMayAlias ? Stores : NonAliasStores).insert(SU, V); in buildSchedGraph() 976 addChainDependencies(SU, Stores, UnknownValue); in buildSchedGraph() 981 addChainDependencies(SU, Stores); in buildSchedGraph() 992 addChainDependencies(SU, (ThisMayAlias ? Stores : NonAliasStores), V); in buildSchedGraph() 998 addChainDependencies(SU, Stores, UnknownValue); in buildSchedGraph() [all …]
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
D | ScheduleDAGInstrs.cpp | 757 Value2SUsMap Stores, Loads(1 /*TrueMemOrderLatency*/); in buildSchedGraph() local 899 addBarrierChain(Stores); in buildSchedGraph() 942 addChainDependencies(SU, Stores); in buildSchedGraph() 948 Stores.insert(SU, UnknownValue); in buildSchedGraph() 957 addChainDependencies(SU, (ThisMayAlias ? Stores : NonAliasStores), V); in buildSchedGraph() 967 (ThisMayAlias ? Stores : NonAliasStores).insert(SU, V); in buildSchedGraph() 972 addChainDependencies(SU, Stores, UnknownValue); in buildSchedGraph() 977 addChainDependencies(SU, Stores); in buildSchedGraph() 988 addChainDependencies(SU, (ThisMayAlias ? Stores : NonAliasStores), V); in buildSchedGraph() 994 addChainDependencies(SU, Stores, UnknownValue); in buildSchedGraph() [all …]
|
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/Vectorize/ |
D | SLPVectorizer.h | 144 bool vectorizeStores(ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R); 147 StoreListMap Stores; member
|
/external/llvm-project/llvm/include/llvm/Transforms/Vectorize/ |
D | SLPVectorizer.h | 146 bool vectorizeStores(ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R); 149 StoreListMap Stores; member
|
/external/llvm/lib/CodeGen/ |
D | ScheduleDAGInstrs.cpp | 877 Value2SUsMap Stores, Loads(1 /*TrueMemOrderLatency*/); in buildSchedGraph() local 1017 addBarrierChain(Stores); in buildSchedGraph() 1043 addChainDependencies(SU, Stores); in buildSchedGraph() 1049 Stores.insert(SU, UnknownValue); in buildSchedGraph() 1058 addChainDependencies(SU, (ThisMayAlias ? Stores : NonAliasStores), V); in buildSchedGraph() 1068 (ThisMayAlias ? Stores : NonAliasStores).insert(SU, V); in buildSchedGraph() 1073 addChainDependencies(SU, Stores, UnknownValue); in buildSchedGraph() 1078 addChainDependencies(SU, Stores); in buildSchedGraph() 1089 addChainDependencies(SU, (ThisMayAlias ? Stores : NonAliasStores), V); in buildSchedGraph() 1095 addChainDependencies(SU, Stores, UnknownValue); in buildSchedGraph() [all …]
|
/external/llvm/test/MC/Disassembler/AArch64/ |
D | ldp-offset-predictable.txt | 4 # Stores are OK.
|
D | ldp-preind.predictable.txt | 8 # Stores from duplicated registers should be fine.
|
D | ldp-postind.predictable.txt | 8 # Stores from duplicated registers should be fine.
|
/external/llvm-project/llvm/test/MC/Disassembler/AArch64/ |
D | ldp-offset-predictable.txt | 4 # Stores are OK.
|
D | ldp-postind.predictable.txt | 8 # Stores from duplicated registers should be fine.
|
D | ldp-preind.predictable.txt | 8 # Stores from duplicated registers should be fine.
|
/external/llvm-project/polly/lib/Transform/ |
D | ZoneAlgo.cpp | 324 auto Stores = makeEmptyUnionMap(); in collectIncompatibleElts() local 343 if (!Stores.is_disjoint(AccRel)) { in collectIncompatibleElts() 349 R << " (previous stores: " << Stores; in collectIncompatibleElts() 374 if (!Stores.is_disjoint(AccRel) && !onlySameValueWrites(Stmt)) { in collectIncompatibleElts() 379 R << " (previous stores: " << Stores; in collectIncompatibleElts() 386 Stores = Stores.unite(AccRel); in collectIncompatibleElts()
|
/external/llvm/test/Analysis/CostModel/AArch64/ |
D | store.ll | 5 ; Stores of <2 x i64> should be expensive because we don't split them and
|