Lines Matching defs:VecLen

999   unsigned VecLen = Mask.size();
1000   assert(MaskL.size() == VecLen && MaskR.size() == VecLen);
1001   for (unsigned I = 0; I != VecLen; ++I) {
1005     } else if (unsigned(M) < VecLen) {
1010       MaskR[I] = M-VecLen;
1232   auto VecLen = static_cast<int>(HwLen);
1236   if (Amount == VecLen)
1243     Amount += VecLen;
1244   if (Amount > VecLen) {
1245     Amount -= VecLen;
1252   } else if (isUInt<3>(VecLen - Amount)) {
1253     SDValue A = getConst32(VecLen - Amount, dl);
1286   unsigned VecLen = SM.Mask.size();
1349     for (int I = 0; I != static_cast<int>(VecLen); ++I) {
1431   assert(SMH.Mask.size() == VecLen);
1445   assert(SMA.Mask.size() == VecLen);
1456     for (int I = 0; I != static_cast<int>(VecLen); ++I) {
1476     for (int I = 0; I != static_cast<int>(VecLen); ++I) {
1560   unsigned VecLen = SM.Mask.size();
1561   assert(HwLen == VecLen);
1562   (void)VecLen;
1571   if (auto Dist = rotationDistance(SM, VecLen)) {
1611   int VecLen = SM.Mask.size();
1612   shuffles::MaskT PackedMask(VecLen);
1620   shuffles::MaskT MaskL(VecLen), MaskR(VecLen);
1628   SmallVector<uint8_t, 128> Bytes(VecLen);
1629   for (int I = 0; I != VecLen; ++I) {
1638   int VecLen = SM.Mask.size();
1645   shuffles::MaskT PackedMask(VecLen);
1685   int VecLen = SM.Mask.size();
1686   SmallVector<int,256> PackedMask(VecLen);
1691   SmallVector<int,256> MaskL(VecLen), MaskR(VecLen);
1700   SmallVector<uint8_t,256> Bytes(VecLen);
1701   for (int I = 0; I != VecLen; ++I) {
1848   unsigned VecLen = Mask.size();
1849   bool HavePairs = (2*HwLen == VecLen);
1875     if (M < VecLen) {
1879       M -= VecLen;
1897   if (2*HwLen == VecLen) {
2079   int VecLen = SM.Mask.size();
2082   if (auto Dist = rotationDistance(SM, 2 * VecLen)) {
2181   int VecLen = SM.Mask.size();
2182   assert(2*HwLen == unsigned(VecLen) && "Expecting vector-pair type");
2184   std::pair<int,unsigned> Strip = findStrip(SM.Mask, 1, VecLen);
2187   // consecutive strips (L = length of the strip, N = VecLen):
2198   int N = VecLen;
2231   int VecLen = SM.Mask.size();
2232   assert(isPowerOf2_32(VecLen) && Log2_32(VecLen) <= 8);
2233   unsigned LogLen = Log2_32(VecLen);
2343   // (equal to log2(VecLen)-1) as M. The cycle containing M can then be
2433   if (unsigned(VecLen) == HwLen) {
2513   int VecLen = SM.Mask.size();
2516     if (M != -1 && M >= VecLen)
2599   unsigned VecLen = Mask.size();
2600   bool HavePairs = (2*HwLen == VecLen);
2601   assert(ResTy.getSizeInBits() / 8 == VecLen);
2607   for (unsigned I = 0; I != VecLen; ++I) {
2611     assert(Idx < 2*VecLen);
2612     if (Idx < VecLen)
2619     dbgs() << "VecLen=" << VecLen << " HwLen=" << HwLen << " UseLeft="