Lines Matching defs:Second
2527 // or second operand, then it might still be profitable to move the shuffle
3266 // and N1 as the second operand.
3268 // and N0 as the second operand.
4022 // For this to be valid, the second form must not preserve any of the bits
4641 // Do the same for the second half of the BuildVector
7946 // Now we replace use of chain2 with chain1. This makes the second load
8388 /// \brief Check whether or not \p First and \p Second are next to each other
8390 /// by \p First and the bits loaded by \p Second.
8392 const LoadedSlice &Second) {
8393 assert(First.Origin == Second.Origin && First.Origin &&
8396 Second.getUsedBits()) == 0 &&
8398 UsedBits |= Second.getUsedBits();
8421 // First (resp. Second) is the first (resp. Second) potentially candidate
8424 const LoadedSlice *Second = nullptr;
8427 First = Second) {
8429 Second = &LoadedSlices[CurrSlice];
8439 if (LoadedType != Second->getLoadedType())
8446 Second = nullptr;
8454 if (!areSlicesNextToEachOther(*First, *Second))
8460 Second = nullptr;
8679 Result.second = NotMaskTZ/8;
8692 unsigned ByteShift = MaskInfo.second;
9153 // Check that the addresses are consecutive starting from the second
10716 // Check that all the elements come from the second shuffle operand.
