Home
last modified time | relevance | path

Searched refs:VFs (Results 1 – 4 of 4) sorted by relevance

/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
H A DLoopVectorizationPlanner.h311 bool hasPlanWithVFs(const ArrayRef<ElementCount> VFs) const { in hasPlanWithVFs() argument
313 return all_of(VFs, [&](const ElementCount &VF) { in hasPlanWithVFs()
H A DLoopVectorize.cpp1292 calculateRegisterUsage(ArrayRef<ElementCount> VFs);
5968 SmallVector<ElementCount, 8> VFs; in getMaximizedVFForTarget() local
5971 VFs.push_back(VS); in getMaximizedVFForTarget()
5974 auto RUs = calculateRegisterUsage(VFs); in getMaximizedVFForTarget()
5986 MaxVF = VFs[i]; in getMaximizedVFForTarget()
6490 LoopVectorizationCostModel::calculateRegisterUsage(ArrayRef<ElementCount> VFs) { in calculateRegisterUsage() argument
6562 SmallVector<RegisterUsage, 8> RUs(VFs.size()); in calculateRegisterUsage()
6563 SmallVector<SmallMapVector<unsigned, unsigned, 4>, 8> MaxUsages(VFs.size()); in calculateRegisterUsage()
6592 for (unsigned j = 0, e = VFs.size(); j < e; ++j) { in calculateRegisterUsage()
6596 if (VFs[j].isScalar()) { in calculateRegisterUsage()
[all …]
H A DVPlan.h1958 SmallSetVector<ElementCount, 2> VFs;
2026 void addVF(ElementCount VF) { VFs.insert(VF); }
2028 bool hasVF(ElementCount VF) { return VFs.count(VF); }
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Bitcode/Writer/
H A DBitcodeWriter.cpp3653 ArrayRef<FunctionSummary::VFuncId> VFs) { in writeFunctionTypeMetadataRecords() argument
3654 if (VFs.empty()) in writeFunctionTypeMetadataRecords()
3657 for (auto &VF : VFs) { in writeFunctionTypeMetadataRecords()
3727 [&](ArrayRef<FunctionSummary::VFuncId> VFs) { in getReferencedTypeIds() argument
3728 for (auto &VF : VFs) in getReferencedTypeIds()