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

/freebsd-13-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.cpp184 SmallPtrSetImpl<Instruction *> &Stores,
649 // If a store has multiple consecutive store candidates, search Stores
893 SmallPtrSetImpl<Instruction *> &Stores, const SCEVAddRecExpr *Ev,
933 StoreSize, *AA, Stores)) {
1002 for (auto *I : Stores) {
1086 SmallPtrSet<Instruction *, 1> Stores; local
1087 Stores.insert(SI);
1089 StoreSize, *AA, Stores))
1106 StoreSize, *AA, Stores))
890 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.cpp906 ValueVector Stores; local
907 Stores.resize(NumElems);
911 Stores[I] = Builder.CreateAlignedStore(Val, Ptr, Layout->getElemAlign(I));
913 transferMetadataAndIRFlags(&SI, Stores);
H A DSROA.cpp3752 SmallVector<StoreInst *, 4> Stores;
3825 Stores.push_back(SI);
3867 Stores.erase(
3868 llvm::remove_if(Stores,
3905 Stores.end());
3910 Stores.erase(llvm::remove_if(Stores,
3916 Stores.end());
3927 if (Loads.empty() && Stores.empty())
4016 if (!Stores
[all...]
/freebsd-13-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-13-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.cpp1828 SmallVector<StoreInst *, 16> Stores; local
1925 Stores.push_back(St);
1943 if (!Stores.size()) {
1964 for (StoreInst *ST : Stores) {
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DSLPVectorizer.h109 /// Vectorize the store instructions collected in Stores.
145 bool vectorizeStores(ArrayRef<StoreInst *> Stores, slpvectorizer::BoUpSLP &R);
148 StoreListMap Stores; member in struct:llvm::SLPVectorizerPass
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp79 // When Stores and Loads maps (or NonAliasStores and NonAliasLoads)
758 Value2SUsMap Stores, Loads(1 /*TrueMemOrderLatency*/); local
760 // Certain memory accesses are known to not alias any SU in Stores
900 addBarrierChain(Stores);
943 addChainDependencies(SU, Stores);
949 Stores.insert(SU, UnknownValue);
958 addChainDependencies(SU, (ThisMayAlias ? Stores : NonAliasStores), V);
968 (ThisMayAlias ? Stores : NonAliasStores).insert(SU, V);
973 addChainDependencies(SU, Stores, UnknownValue);
978 addChainDependencies(SU, Stores);
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DArgumentPromotion.cpp815 SmallVector<StoreInst *, 16> Stores; local
828 Stores.push_back(Store);
835 for (StoreInst *Store : Stores)
H A DGlobalOpt.cpp414 // Stores *to* the pointer are ok.
1828 SmallVector<StoreInst *, 4> Stores;
1835 Stores.push_back(SI);
1850 Stores.push_back(SI);
1865 // Stores array, making subsequent dominance checks more likely to succeed
1871 if (Loads.size() * Stores.size() > Threshold)
1876 if (none_of(Stores, [&](const StoreInst *S) {
/freebsd-13-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-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp5702 Stores.clear();
5729 if (!Stores.empty()) {
5730 LLVM_DEBUG(dbgs() << "SLP: Found stores for " << Stores.size()
5796 << "Stores SLP vectorized with cost " << NV("Cost", Cost)
5807 bool SLPVectorizerPass::vectorizeStores(ArrayRef<StoreInst *> Stores,
5814 int E = Stores.size();
5819 auto &&FindConsecutiveAccess = [this, &Stores, &Tails, &IterCnt, MaxIter,
5824 if (!isConsecutiveAccess(Stores[K], Stores[Idx], *DL, *SE))
5855 while (I != E + 1 && !VectorizedStores.count(Stores[
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DTargetLowering.cpp6871 SmallVector<SDValue, 8> Stores;
6884 Stores.push_back(Store);
6887 return DAG.getNode(ISD::TokenFactor, SL, MVT::Other, Stores);
6932 SmallVector<SDValue, 8> Stores;
6950 Stores.push_back(DAG.getStore(
6971 Stores.push_back(DAG.getTruncStore(
6976 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Stores);
7095 SmallVector<SDValue, 8> Stores;
7105 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, Ptr,
7126 Stores
[all...]
H A DLegalizeDAG.cpp635 "Vector Stores are handled in LegalizeVectorOps");
1411 SmallVector<SDValue, 8> Stores;
1426 Stores.push_back(DAG.getTruncStore(DAG.getEntryNode(), dl,
1430 Stores.push_back(DAG.getStore(DAG.getEntryNode(), dl, Node->getOperand(i),
1435 if (!Stores.empty()) // Not all undef elements?
1436 StoreChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Stores);
H A DDAGCombiner.cpp695 /// This is a helper function for mergeConsecutiveStores. Stores that
6853 SmallVector<StoreSDNode *, 8> Stores; local
6859 Stores.push_back(Store);
6863 unsigned Width = Stores.size();
6880 for (auto Store : Stores) {
6906 // Stores must share the same combined value with different offsets.
6923 // Stores must share the same base address
16457 // Loop on Consecutive Stores on success.
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCISelLowering.cpp5026 /// StoreTailCallArgumentsToStackSlot - Stores arguments to their stack slot.
9217 SmallVector<SDValue, 4> Stores; local
9227 Stores.push_back(
9235 Stores.push_back(DAG.getStore(DAG.getEntryNode(), dl, StoreValue, Idx,
9241 if (!Stores.empty())
9242 StoreChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Stores);
10855 SDValue Stores[4]; local
10882 Stores[Idx] = Store;
10885 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Stores);
10888 SDValue RetOps[] = { TF, Stores[
10943 SDValue Stores[4]; local
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMISelLowering.cpp9459 assert(ST->isUnindexed() && "Stores should be unindexed at this point.");
14486 SmallVector<SDValue, 4> Stores; local
14505 Stores.push_back(Store);
14507 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Stores);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86ISelLowering.cpp23528 SmallVector<SDValue, 4> Stores;
23538 Stores.push_back(Ch);
23540 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Stores);
[all...]

Completed in 801 milliseconds