Lines Matching refs:VecLen

1003   unsigned VecLen = Mask.size();
1004   assert(MaskL.size() == VecLen && MaskR.size() == VecLen);
1005   for (unsigned I = 0; I != VecLen; ++I) {
1009     } else if (unsigned(M) < VecLen) {
1014       MaskR[I] = M-VecLen;
1236   auto VecLen = static_cast<int>(HwLen);
1240   if (Amount == VecLen)
1247     Amount += VecLen;
1248   if (Amount > VecLen) {
1249     Amount -= VecLen;
1256   } else if (isUInt<3>(VecLen - Amount)) {
1257     SDValue A = getConst32(VecLen - Amount, dl);
1290   unsigned VecLen = SM.Mask.size();
1353     for (int I = 0; I != static_cast<int>(VecLen); ++I) {
1435   assert(SMH.Mask.size() == VecLen);
1449   assert(SMA.Mask.size() == VecLen);
1460     for (int I = 0; I != static_cast<int>(VecLen); ++I) {
1480     for (int I = 0; I != static_cast<int>(VecLen); ++I) {
1564   unsigned VecLen = SM.Mask.size();
1565   assert(HwLen == VecLen);
1566   (void)VecLen;
1575   if (auto Dist = rotationDistance(SM, VecLen)) {
1615   int VecLen = SM.Mask.size();
1616   shuffles::MaskT PackedMask(VecLen);
1624   shuffles::MaskT MaskL(VecLen), MaskR(VecLen);
1632   SmallVector<uint8_t, 128> Bytes(VecLen);
1633   for (int I = 0; I != VecLen; ++I) {
1642   int VecLen = SM.Mask.size();
1649   shuffles::MaskT PackedMask(VecLen);
1689   int VecLen = SM.Mask.size();
1690   SmallVector<int,256> PackedMask(VecLen);
1695   SmallVector<int,256> MaskL(VecLen), MaskR(VecLen);
1704   SmallVector<uint8_t,256> Bytes(VecLen);
1705   for (int I = 0; I != VecLen; ++I) {
1852   unsigned VecLen = Mask.size();
1853   bool HavePairs = (2*HwLen == VecLen);
1879     if (M < VecLen) {
1883       M -= VecLen;
1901   if (2*HwLen == VecLen) {
2086   int VecLen = SM.Mask.size();
2089   if (auto Dist = rotationDistance(SM, 2 * VecLen)) {
2188   int VecLen = SM.Mask.size();
2189   assert(2*HwLen == unsigned(VecLen) && "Expecting vector-pair type");
2191   std::pair<int,unsigned> Strip = findStrip(SM.Mask, 1, VecLen);
2194   // consecutive strips (L = length of the strip, N = VecLen):
2205   int N = VecLen;
2238   int VecLen = SM.Mask.size();
2239   assert(isPowerOf2_32(VecLen) && Log2_32(VecLen) <= 8);
2240   unsigned LogLen = Log2_32(VecLen);
2350   // (equal to log2(VecLen)-1) as M. The cycle containing M can then be
2440   if (unsigned(VecLen) == HwLen) {
2520   int VecLen = SM.Mask.size();
2523     if (M != -1 && M >= VecLen)
2606   unsigned VecLen = Mask.size();
2607   bool HavePairs = (2*HwLen == VecLen);
2608   assert(ResTy.getSizeInBits() / 8 == VecLen);
2614   for (unsigned I = 0; I != VecLen; ++I) {
2618     assert(Idx < 2*VecLen);
2619     if (Idx < VecLen)
2626     dbgs() << "VecLen=" << VecLen << " HwLen=" << HwLen << " UseLeft="