| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| D | Sink.cpp | 55 bool SinkInstruction(Instruction *I, SmallPtrSet<Instruction *, 8> &Stores);
132 SmallPtrSet<Instruction *, 8> Stores; in ProcessBlock() local
145 if (SinkInstruction(Inst, Stores)) in ProcessBlock()
155 SmallPtrSet<Instruction *, 8> &Stores) { in isSafeToMove() argument
158 Stores.insert(Inst); in isSafeToMove()
164 for (SmallPtrSet<Instruction *, 8>::iterator I = Stores.begin(), in isSafeToMove()
165 E = Stores.end(); I != E; ++I) in isSafeToMove()
179 SmallPtrSet<Instruction *, 8> &Stores) { in SinkInstruction() argument
181 if (!isSafeToMove(Inst, AA, Stores)) in SinkInstruction()
|
| /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()
|
| D | Scalarizer.cpp | 635 ValueVector Stores; in visitStoreInst() local
636 Stores.resize(NumElems); in visitStoreInst()
639 Stores[I] = Builder.CreateAlignedStore(Val[I], Ptr[I], Align); in visitStoreInst()
641 transferMetadata(&SI, Stores); in visitStoreInst()
|
| D | SROA.cpp | 3343 SmallVector<StoreInst *, 4> Stores; in presplitLoadsAndStores() local
3416 Stores.push_back(SI); in presplitLoadsAndStores()
3458 Stores.erase( in presplitLoadsAndStores()
3459 std::remove_if(Stores.begin(), Stores.end(), in presplitLoadsAndStores()
3495 Stores.end()); in presplitLoadsAndStores()
3500 Stores.erase(std::remove_if(Stores.begin(), Stores.end(), in presplitLoadsAndStores()
3506 Stores.end()); in presplitLoadsAndStores()
3518 if (Loads.empty() && Stores.empty()) in presplitLoadsAndStores()
3603 if (!Stores.empty() && SplitOffsetsMap.count(SI)) { in presplitLoadsAndStores()
3659 for (StoreInst *SI : Stores) { in presplitLoadsAndStores()
|
| /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/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/llvm/include/llvm/Transforms/Vectorize/ |
| D | SLPVectorizer.h | 102 bool vectorizeStores(ArrayRef<StoreInst *> Stores, int costThreshold,
106 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/test/Analysis/CostModel/AArch64/ |
| D | store.ll | 5 ; Stores of <2 x i64> should be expensive because we don't split them and
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| D | LegalizeDAG.cpp | 422 SmallVector<SDValue, 8> Stores; in ExpandUnalignedStore() local
432 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, Ptr, in ExpandUnalignedStore()
454 Stores.push_back(DAG.getTruncStore(Load.getValue(1), dl, Load, Ptr, in ExpandUnalignedStore()
461 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Stores[0], in ExpandUnalignedStore()
462 Stores.size()); in ExpandUnalignedStore()
530 SmallVector<SDValue, 8> Stores; in ExpandUnalignedLoad() local
542 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, StackPtr, in ExpandUnalignedLoad()
562 Stores.push_back(DAG.getTruncStore(Load.getValue(1), dl, Load, StackPtr, in ExpandUnalignedLoad()
567 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Stores[0], in ExpandUnalignedLoad()
568 Stores.size()); in ExpandUnalignedLoad()
[all …]
|
| /external/llvm/test/Transforms/InstMerge/ |
| D | st_sink_no_barrier_call.ll | 2 ; Stores sunks into the footer.
|
| D | st_sink_barrier_call.ll | 2 ; Stores sunks into the footer.
|
| D | st_sink_no_barrier_load.ll | 2 ; Stores sunks into the footer.
|
| D | st_sink_two_stores.ll | 2 ; Stores sunks into the footer.
|
| D | st_sink_no_barrier_store.ll | 2 ; Stores sunks into the footer.
|
| /external/perf_data_converter/src/quipper/ |
| D | perf_stat.proto | 9 // Stores output generated by the "perf stat" command.
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | SLPVectorizer.cpp | 3517 Stores.clear(); in runImpl()
3544 if (!Stores.empty()) { in runImpl()
3545 DEBUG(dbgs() << "SLP: Found stores for " << Stores.size() in runImpl()
3630 bool SLPVectorizerPass::vectorizeStores(ArrayRef<StoreInst *> Stores, in vectorizeStores() argument
3643 for (unsigned i = 0, e = Stores.size(); i < e; ++i) { in vectorizeStores()
3656 if (isConsecutiveAccess(Stores[i], Stores[k], *DL, *SE)) { in vectorizeStores()
3657 Tails.insert(Stores[k]); in vectorizeStores()
3658 Heads.insert(Stores[i]); in vectorizeStores()
3659 ConsecutiveChain[Stores[i]] = Stores[k]; in vectorizeStores()
3702 Stores.clear(); in collectSeedInstructions()
[all …]
|
| /external/clang/lib/CodeGen/ |
| D | CGExprCXX.cpp | 366 SmallVector<std::pair<CharUnits, CharUnits>, 1> Stores; in EmitNullBaseClassInitialization() local
367 Stores.emplace_back(CharUnits::Zero(), NVSize); in EmitNullBaseClassInitialization()
377 std::pair<CharUnits, CharUnits> LastStore = Stores.pop_back_val(); in EmitNullBaseClassInitialization()
385 Stores.emplace_back(SplitBeforeOffset, SplitBeforeSize); in EmitNullBaseClassInitialization()
391 Stores.emplace_back(SplitAfterOffset, SplitAfterSize); in EmitNullBaseClassInitialization()
414 for (std::pair<CharUnits, CharUnits> Store : Stores) { in EmitNullBaseClassInitialization()
428 for (std::pair<CharUnits, CharUnits> Store : Stores) { in EmitNullBaseClassInitialization()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | ArgumentPromotion.cpp | 209 SmallVector<StoreInst *, 16> Stores; in canPaddingBeAccessed() local
222 Stores.push_back(Store); in canPaddingBeAccessed()
229 for (StoreInst *Store : Stores) in canPaddingBeAccessed()
|
| /external/llvm/lib/Target/AVR/ |
| D | AVRInstrInfo.td | 1229 // Stores the value of Rr into the location addressed by pointer P.
1239 // Stores the value of Rr into the location addressed by pointer P.
1255 // Stores the value of Rr into the location addressed by pointer P.
1267 // Stores the value of Rr into the location addressed by pointer P.
1281 // Stores the value of Rr into the location addressed by pointer P.
1293 // Stores the value of Rr into the location addressed by pointer P.
1309 // Stores the value of Rr into the location addressed by pointer P with a
1319 // Stores the value of Rr into the location addressed by pointer P with a
|
| /external/python/cpython2/Doc/library/ |
| D | aetools.rst | 35 Stores parameters and attributes in a pre-created ``Carbon.AE.AEDesc`` object.
|