Lines Matching defs:Stores

1624   bool isLoadCombineCandidate(ArrayRef<Value *> Stores) const;
6090       // Stores actually store the mask, not the order, need to invert.
6375         // Stores actually store the mask, not the order, need to invert.
6761   SmallVector<SmallVector<StoreInst *>> Stores = collectUserStores(TE);
6770   for (ArrayRef<StoreInst *> StoresVec : Stores) {
12038 bool BoUpSLP::isLoadCombineCandidate(ArrayRef<Value *> Stores) const {
12041   unsigned NumElts = Stores.size();
12042   for (Value *Scalar : Stores) {
18497   Stores.clear();
18535     if (!Stores.empty()) {
18536       LLVM_DEBUG(dbgs() << "SLP: Found stores for " << Stores.size()
18592     DenseSet<Value *> Stores(Chain.begin(), Chain.end());
18604                              return !Stores.contains(U);
18643                      << "Stores SLP vectorized with cost " << NV("Cost", Cost)
18685     ArrayRef<StoreInst *> Stores, BoUpSLP &R,
18699   // A set of pairs (index of store in Stores array ref, Distance of the store
18709         Operands.push_back(Stores[Data.first]);
18716         Operands.push_back(Stores[DataVar.first]);
18968   // Stores pair (first: index of the store into Stores array ref, address of
19001   // the IR (Stores are reversed already, see vectorizeStoreChains() function).
19012           Stores[Set.first]->getValueOperand()->getType(),
19013           Stores[Set.first]->getPointerOperand(),
19044         if (VectorizedStores.contains(Stores[Pair.first]))
19062   for (auto [I, SI] : enumerate(Stores)) {
19086   Stores.clear();
19090   // Stores and GEPs according to the underlying objects of their pointer
19100       Stores[getUnderlyingObject(SI->getPointerOperand())].push_back(SI);
21743         auto *I = Stores.find(getUnderlyingObject(SI->getPointerOperand()));
21750         TryToVectorizeRoot |= (I == Stores.end() || I->second.size() == 1) &&
21957   for (auto &Pair : Stores) {