Searched refs:Stores (Results 1 - 20 of 20) sorted by relevance

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSink.cpp61 SmallPtrSetImpl<Instruction *> &Stores) {
64 Stores.insert(Inst);
70 for (Instruction *S : Stores)
85 for (Instruction *S : Stores)
140 SmallPtrSetImpl<Instruction *> &Stores,
150 if (!isSafeToMove(Inst, AA, Stores))
215 SmallPtrSet<Instruction *, 8> Stores; local
228 if (SinkInstruction(Inst, Stores, DT, LI, AA)) {
60 isSafeToMove(Instruction *Inst, AliasAnalysis &AA, SmallPtrSetImpl<Instruction *> &Stores) argument
139 SinkInstruction(Instruction *Inst, SmallPtrSetImpl<Instruction *> &Stores, DominatorTree &DT, LoopInfo &LI, AAResults &AA) argument
H A DLoopIdiomRecognize.cpp177 SmallPtrSetImpl<Instruction *> &Stores,
640 // If a store has multiple consecutive store candidates, search Stores
884 SmallPtrSetImpl<Instruction *> &Stores, const SCEVAddRecExpr *Ev,
924 StoreSize, *AA, Stores)) {
987 for (auto *I : Stores)
1040 SmallPtrSet<Instruction *, 1> Stores; local
1041 Stores.insert(SI);
1043 StoreSize, *AA, Stores)) {
1063 StoreSize, *AA, Stores)) {
881 processLoopStridedStore( Value *DestPtr, unsigned StoreSize, MaybeAlign StoreAlignment, Value *StoredVal, Instruction *TheStore, SmallPtrSetImpl<Instruction *> &Stores, const SCEVAddRecExpr *Ev, const SCEV *BECount, bool NegStride, bool IsLoopMemset) argument
H A DScalarizer.cpp828 ValueVector Stores; local
829 Stores.resize(NumElems);
832 Stores[I] = Builder.CreateAlignedStore(Val[I], Ptr[I], Align);
834 transferMetadataAndIRFlags(&SI, Stores);
H A DSROA.cpp3637 SmallVector<StoreInst *, 4> Stores;
3710 Stores.push_back(SI);
3752 Stores.erase(
3753 llvm::remove_if(Stores,
3790 Stores.end());
3795 Stores.erase(llvm::remove_if(Stores,
3801 Stores.end());
3812 if (Loads.empty() && Stores.empty())
3901 if (!Stores
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonStoreWidening.cpp96 bool instrAliased(InstrGroup &Stores, const MachineMemOperand &MMO);
97 bool instrAliased(InstrGroup &Stores, const MachineInstr *MI);
169 // stores in the store group Stores.
170 bool HexagonStoreWidening::instrAliased(InstrGroup &Stores, argument
177 for (auto SI : Stores) {
191 // any store in the group Stores.
192 bool HexagonStoreWidening::instrAliased(InstrGroup &Stores, argument
195 if (instrAliased(Stores, *I))
355 // Stores are sorted, so if S1 and S2 are not adjacent, there won't be
H A DHexagonLoopIdiomRecognition.cpp148 SmallVectorImpl<StoreInst*> &Stores);
2001 SmallVectorImpl<StoreInst*> &Stores) {
2002 Stores.clear();
2006 Stores.push_back(SI);
2368 SmallVector<StoreInst*,8> Stores; local
2369 collectStores(CurLoop, BB, Stores);
2372 for (auto &SI : Stores)
2000 collectStores(Loop *CurLoop, BasicBlock *BB, SmallVectorImpl<StoreInst*> &Stores) argument
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DAliasAnalysisEvaluator.cpp102 SetVector<Value *> Stores; local
114 Stores.insert(&*I);
179 for (Value *Store : Stores) {
204 for (SetVector<Value *>::iterator I1 = Stores.begin(), E = Stores.end();
206 for (SetVector<Value *>::iterator I2 = Stores.begin(); I2 != I1; ++I2) {
H A DLoopAccessAnalysis.cpp1797 SmallVector<StoreInst *, 16> Stores; local
1890 Stores.push_back(St);
1908 if (!Stores.size()) {
1929 for (StoreInst *ST : Stores) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DSLPVectorizer.h108 /// Vectorize the store instructions collected in Stores.
144 bool vectorizeStores(ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R);
147 StoreListMap Stores; member in struct:llvm::SLPVectorizerPass
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp78 // When Stores and Loads maps (or NonAliasStores and NonAliasLoads)
757 Value2SUsMap Stores, Loads(1 /*TrueMemOrderLatency*/); local
759 // Certain memory accesses are known to not alias any SU in Stores
899 addBarrierChain(Stores);
942 addChainDependencies(SU, Stores);
948 Stores.insert(SU, UnknownValue);
957 addChainDependencies(SU, (ThisMayAlias ? Stores : NonAliasStores), V);
967 (ThisMayAlias ? Stores : NonAliasStores).insert(SU, V);
972 addChainDependencies(SU, Stores, UnknownValue);
977 addChainDependencies(SU, Stores);
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DArgumentPromotion.cpp820 SmallVector<StoreInst *, 16> Stores; local
833 Stores.push_back(Store);
840 for (StoreInst *Store : Stores)
H A DGlobalOpt.cpp410 // Stores *to* the pointer are ok.
1817 SmallVector<StoreInst *, 4> Stores;
1824 Stores.push_back(SI);
1839 Stores.push_back(SI);
1854 // Stores array, making subsequent dominance checks more likely to succeed
1860 if (Loads.size() * Stores.size() > Threshold)
1865 if (none_of(Stores, [&](const StoreInst *S) {
/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/
H A DCGExprCXX.cpp508 SmallVector<std::pair<CharUnits, CharUnits>, 1> Stores; local
509 Stores.emplace_back(CharUnits::Zero(), NVSize);
519 std::pair<CharUnits, CharUnits> LastStore = Stores.pop_back_val();
527 Stores.emplace_back(SplitBeforeOffset, SplitBeforeSize);
533 Stores.emplace_back(SplitAfterOffset, SplitAfterSize);
556 for (std::pair<CharUnits, CharUnits> Store : Stores) {
570 for (std::pair<CharUnits, CharUnits> Store : Stores) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp5626 Stores.clear();
5653 if (!Stores.empty()) {
5654 LLVM_DEBUG(dbgs() << "SLP: Found stores for " << Stores.size()
5719 << "Stores SLP vectorized with cost " << NV("Cost", Cost)
5730 bool SLPVectorizerPass::vectorizeStores(ArrayRef<StoreInst *> Stores,
5737 int E = Stores.size();
5742 auto &&FindConsecutiveAccess = [this, &Stores, &Tails, &IterCnt, MaxIter,
5747 if (!isConsecutiveAccess(Stores[K], Stores[Idx], *DL, *SE))
5778 while (I != E + 1 && !VectorizedStores.count(Stores[
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DTargetLowering.cpp6658 SmallVector<SDValue, 8> Stores;
6671 Stores.push_back(Store);
6674 return DAG.getNode(ISD::TokenFactor, SL, MVT::Other, Stores);
6719 SmallVector<SDValue, 8> Stores;
6737 Stores.push_back(DAG.getStore(
6758 Stores.push_back(DAG.getTruncStore(
6763 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Stores);
6882 SmallVector<SDValue, 8> Stores;
6892 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, Ptr,
6913 Stores
[all...]
H A DLegalizeDAG.cpp638 "Vector Stores are handled in LegalizeVectorOps");
1406 SmallVector<SDValue, 8> Stores;
1422 Stores.push_back(DAG.getTruncStore(DAG.getEntryNode(), dl,
1426 Stores.push_back(DAG.getStore(DAG.getEntryNode(), dl, Node->getOperand(i),
1431 if (!Stores.empty()) // Not all undef elements?
1432 StoreChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Stores);
H A DDAGCombiner.cpp651 /// This is a helper function for MergeConsecutiveStores. Stores
6601 SmallVector<StoreSDNode *, 8> Stores; local
6607 Stores.push_back(Store);
6611 unsigned Width = Stores.size();
6628 for (auto Store : Stores) {
6655 // Stores must share the same combined value with different offsets.
6672 // Stores must share the same base address
15962 // Loop on Consecutive Stores on success.
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCISelLowering.cpp4844 /// StoreTailCallArgumentsToStackSlot - Stores arguments to their stack slot.
8678 SmallVector<SDValue, 4> Stores; local
8688 Stores.push_back(
8696 Stores.push_back(DAG.getStore(DAG.getEntryNode(), dl, StoreValue, Idx,
8702 if (!Stores.empty())
8703 StoreChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Stores);
10162 SDValue Stores[4]; local
10190 Stores[Idx] = Store;
10193 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Stores);
10196 SDValue RetOps[] = { TF, Stores[
10251 SDValue Stores[4]; local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMISelLowering.cpp13574 SmallVector<SDValue, 4> Stores; local
13585 Stores.push_back(Store);
13587 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Stores);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86ISelLowering.cpp22665 SmallVector<SDValue, 4> Stores;
22675 Stores.push_back(Ch);
22677 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Stores);
[all...]

Completed in 628 milliseconds