Home
last modified time | relevance | path

Searched refs:getNumLanes (Results 1 – 3 of 3) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/MC/
H A DLaneBitmask.h76 unsigned getNumLanes() const { return llvm::popcount(Mask); } in getNumLanes() function
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DTargetRegisterInfo.cpp537 unsigned PopCount = SubRegMask.getNumLanes(); in getCoveringSubRegIndexes()
572 const int Cover = (SubRegMask & LanesLeft).getNumLanes(); in getCoveringSubRegIndexes()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp1777 for (unsigned Lane = 0, NumLanes = getNumLanes(); Lane != NumLanes; in clearUsed()
1801 for (unsigned Ln = 0, E = getNumLanes(); Ln < E; ++Ln) { in getSplatScore()
1860 LookAheadHeuristics LookAhead(TLI, DL, SE, R, getNumLanes(), in getLookAheadScore()
2022 for (int I = getNumLanes(); I > 0; --I) { in getBestLaneToStartReordering()
2134 assert((empty() || VL.size() == getNumLanes()) && in appendOperandsOfVL()
2169 unsigned getNumLanes() const { return OpsVec[0].size(); } in getNumLanes() function in llvm::slpvectorizer::BoUpSLP::VLOperands
2189 for (unsigned Ln = 0, Lns = getNumLanes(); Ln != Lns; ++Ln) { in shouldBroadcast()
2234 return getNumLanes() == 2 || Cnt > 1; in shouldBroadcast()
2241 for (unsigned Ln = 0, Lns = getNumLanes(); Ln != Lns; ++Ln) { in canBeVectorized()
2272 assert(OpsVec[OpIdx].size() == getNumLanes() && in getVL()
[all …]