/external/llvm/include/llvm/Transforms/Vectorize/ |
SLPVectorizer.h | 10 // stores that can be put together into vector-stores. Next, it attempts to 88 /// \brief Vectorize the store instructions collected in Stores. 102 bool vectorizeStores(ArrayRef<StoreInst *> Stores, int costThreshold, 106 StoreListMap Stores;
|
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Vectorize/ |
SLPVectorizer.h | 10 // stores that can be put together into vector-stores. Next, it attempts to 88 /// \brief Vectorize the store instructions collected in Stores. 108 bool vectorizeStores(ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R); 111 StoreListMap Stores;
|
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Vectorize/ |
SLPVectorizer.h | 10 // stores that can be put together into vector-stores. Next, it attempts to 88 /// \brief Vectorize the store instructions collected in Stores. 108 bool vectorizeStores(ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R); 111 StoreListMap Stores;
|
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/Vectorize/ |
SLPVectorizer.h | 10 // stores that can be put together into vector-stores. Next, it attempts to 88 /// \brief Vectorize the store instructions collected in Stores. 108 bool vectorizeStores(ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R); 111 StoreListMap Stores;
|
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Vectorize/ |
SLPVectorizer.h | 10 // stores that can be put together into vector-stores. Next, it attempts to 88 /// \brief Vectorize the store instructions collected in Stores. 108 bool vectorizeStores(ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R); 111 StoreListMap Stores;
|
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Vectorize/ |
SLPVectorizer.h | 10 // stores that can be put together into vector-stores. Next, it attempts to 88 /// \brief Vectorize the store instructions collected in Stores. 108 bool vectorizeStores(ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R); 111 StoreListMap Stores;
|
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Vectorize/ |
SLPVectorizer.h | 10 // stores that can be put together into vector-stores. Next, it attempts to 88 /// \brief Vectorize the store instructions collected in Stores. 108 bool vectorizeStores(ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R); 111 StoreListMap Stores;
|
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/Vectorize/ |
SLPVectorizer.h | 10 // stores that can be put together into vector-stores. Next, it attempts to 88 /// \brief Vectorize the store instructions collected in Stores. 108 bool vectorizeStores(ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R); 111 StoreListMap Stores;
|
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Vectorize/ |
SLPVectorizer.h | 10 // stores that can be put together into vector-stores. Next, it attempts to 88 /// \brief Vectorize the store instructions collected in Stores. 108 bool vectorizeStores(ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R); 111 StoreListMap Stores;
|
/external/llvm/lib/Transforms/Scalar/ |
Sink.cpp | 61 SmallPtrSetImpl<Instruction *> &Stores) { 64 Stores.insert(Inst); 70 for (Instruction *S : Stores) 85 for (Instruction *S : Stores) 115 // We cannot sink a load across a critical edge - there may be stores in 140 SmallPtrSetImpl<Instruction *> &Stores, 150 if (!isSafeToMove(Inst, AA, Stores)) 216 SmallPtrSet<Instruction *, 8> Stores; 229 if (SinkInstruction(Inst, Stores, DT, LI, AA)) {
|
Scalarizer.cpp | 153 // This is disabled by default because having separate loads and stores 635 ValueVector Stores; 636 Stores.resize(NumElems); 639 Stores[I] = Builder.CreateAlignedStore(Val[I], Ptr[I], Align); 641 transferMetadata(&SI, Stores);
|
LoopIdiomRecognize.cpp | 65 STATISTIC(NumMemSet, "Number of memset's formed from loop stores"); 66 STATISTIC(NumMemCpy, "Number of memcpy's formed from loop load+stores"); 118 SmallPtrSetImpl<Instruction *> &Stores, 264 // The following transforms hoist stores/memsets into the loop pre-header. 337 // Don't touch volatile stores. 341 // Avoid merging nontemporal stores. 348 // Reject stores that are so large that they overflow an unsigned. 462 // We can only promote stores in this block if they are unconditionally 473 // Look for a single store or sets of stores with a common base, which can be 510 // Try to find consecutive stores that can be transformed into memsets [all...] |
/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
Sink.cpp | 55 bool SinkInstruction(Instruction *I, SmallPtrSet<Instruction *, 8> &Stores); 132 SmallPtrSet<Instruction *, 8> Stores; 145 if (SinkInstruction(Inst, Stores)) 155 SmallPtrSet<Instruction *, 8> &Stores) { 158 Stores.insert(Inst); 164 for (SmallPtrSet<Instruction *, 8>::iterator I = Stores.begin(), 165 E = Stores.end(); I != E; ++I) 179 SmallPtrSet<Instruction *, 8> &Stores) { 181 if (!isSafeToMove(Inst, AA, Stores)) 241 // We cannot sink a load across a critical edge - there may be stores i [all...] |
/external/llvm/lib/Analysis/ |
AliasAnalysisEvaluator.cpp | 104 SetVector<Value *> Stores; 116 Stores.insert(&*I); 179 for (Value *Store : Stores) { 207 for (SetVector<Value *>::iterator I1 = Stores.begin(), E = Stores.end(); 209 for (SetVector<Value *>::iterator I2 = Stores.begin(); I2 != I1; ++I2) {
|
LoopAccessAnalysis.cpp | [all...] |
/external/llvm/lib/Transforms/IPO/ |
ArgumentPromotion.cpp | 208 // Track all of the stores. 209 SmallVector<StoreInst *, 16> Stores; 222 Stores.push_back(Store); 229 for (StoreInst *Store : Stores) [all...] |
GlobalOpt.cpp | 69 /// we might not really want to eliminate the stores to it. 269 // Pointer cast, delete any stores and memsets to the global. 332 // Stores *to* the pointer are ok. 631 // Ignore stores to the global. 729 // Ignore the store that stores "LV" to the global. 741 "Only expect load and stores!"); 750 // If we nuked all of the loads, then none of the stores are needed either, [all...] |
/external/llvm/lib/CodeGen/ |
ScheduleDAGInstrs.cpp | 57 // When Stores and Loads maps (or NonAliasStores and NonAliasLoads) 561 /// This is called on normal stores and loads. 732 /// 1 for loads, 0 for stores. (see comment in SUList) 874 // on it, stores and loads kept separately. Two SUs are trivially 877 Value2SUsMap Stores, Loads(1 /*TrueMemOrderLatency*/); 879 // Certain memory accesses are known to not alias any SU in Stores [all...] |
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
LegalizeDAG.cpp | 382 /// ExpandUnalignedStore - Expands an unaligned store to 2 half-size stores. 398 // FIXME: Does not handle truncating floating point stores! 404 // to the final destination using (unaligned) integer loads and stores. 422 SmallVector<SDValue, 8> Stores; 432 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, Ptr, 454 Stores.push_back(DAG.getTruncStore(Load.getValue(1), dl, Load, Ptr, 460 // The order of the stores doesn't matter - say it with a TokenFactor. 461 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Stores[0], 462 Stores.size()); 520 // loads and stores, then do a (aligned) load from the stack slot [all...] |
/external/clang/lib/CodeGen/ |
CGExprCXX.cpp | 366 SmallVector<std::pair<CharUnits, CharUnits>, 1> Stores; 367 Stores.emplace_back(CharUnits::Zero(), NVSize); 377 std::pair<CharUnits, CharUnits> LastStore = Stores.pop_back_val(); 385 Stores.emplace_back(SplitBeforeOffset, SplitBeforeSize); 391 Stores.emplace_back(SplitAfterOffset, SplitAfterSize); 414 for (std::pair<CharUnits, CharUnits> Store : Stores) { 428 for (std::pair<CharUnits, CharUnits> Store : Stores) { [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
TargetLowering.cpp | [all...] |
/external/llvm/lib/Target/PowerPC/ |
PPCISelLowering.cpp | 259 // PowerPC turns FP_TO_SINT into FCTIWZ and some load/stores. [all...] |