diff options
author | Craig Topper <craig.topper@gmail.com> | 2016-06-19 15:37:33 +0000 |
---|---|---|
committer | Craig Topper <craig.topper@gmail.com> | 2016-06-19 15:37:33 +0000 |
commit | ae21810ce466cc7bb8f4cc1e70deef77d460a608 (patch) | |
tree | 1d9ce709fdb296107ff7a3db47a0220307a6cc22 /llvm/lib | |
parent | 4181c03c540ca048835bf9dff45f52822c945bf6 (diff) | |
download | bcm5719-llvm-ae21810ce466cc7bb8f4cc1e70deef77d460a608.tar.gz bcm5719-llvm-ae21810ce466cc7bb8f4cc1e70deef77d460a608.zip |
[X86] Pre-allocate a SmallVector instead of using push_back in a loop. NFC
llvm-svn: 273114
Diffstat (limited to 'llvm/lib')
-rw-r--r-- | llvm/lib/Target/X86/X86ISelLowering.cpp | 13 |
1 files changed, 7 insertions, 6 deletions
diff --git a/llvm/lib/Target/X86/X86ISelLowering.cpp b/llvm/lib/Target/X86/X86ISelLowering.cpp index bebfbf28535..1202549abb4 100644 --- a/llvm/lib/Target/X86/X86ISelLowering.cpp +++ b/llvm/lib/Target/X86/X86ISelLowering.cpp @@ -10561,26 +10561,27 @@ static SDValue lowerVectorShuffleAsLanePermuteAndBlend(const SDLoc &DL, MVT VT, SelectionDAG &DAG) { // FIXME: This should probably be generalized for 512-bit vectors as well. assert(VT.is256BitVector() && "Only for 256-bit vector shuffles!"); - int LaneSize = Mask.size() / 2; + int Size = Mask.size(); + int LaneSize = Size / 2; // If there are only inputs from one 128-bit lane, splitting will in fact be // less expensive. The flags track whether the given lane contains an element // that crosses to another lane. bool LaneCrossing[2] = {false, false}; - for (int i = 0, Size = Mask.size(); i < Size; ++i) + for (int i = 0; i < Size; ++i) if (Mask[i] >= 0 && (Mask[i] % Size) / LaneSize != i / LaneSize) LaneCrossing[(Mask[i] % Size) / LaneSize] = true; if (!LaneCrossing[0] || !LaneCrossing[1]) return splitAndLowerVectorShuffle(DL, VT, V1, V2, Mask, DAG); if (isSingleInputShuffleMask(Mask)) { - SmallVector<int, 32> FlippedBlendMask; - for (int i = 0, Size = Mask.size(); i < Size; ++i) - FlippedBlendMask.push_back( + SmallVector<int, 32> FlippedBlendMask(Size); + for (int i = 0; i < Size; ++i) + FlippedBlendMask[i] = Mask[i] < 0 ? -1 : (((Mask[i] % Size) / LaneSize == i / LaneSize) ? Mask[i] : Mask[i] % LaneSize + - (i / LaneSize) * LaneSize + Size)); + (i / LaneSize) * LaneSize + Size); // Flip the vector, and blend the results which should now be in-lane. The // VPERM2X128 mask uses the low 2 bits for the low source and bits 4 and |