Lines Matching refs:Left
437 SmallVectorImpl<Value *> &Left,
442 Left,
1271 ValueList Left, Right;
1272 reorderInputsAccordingToOpcode(VL, Left, Right);
1273 buildTree_rec(Left, Depth + 1);
1435 ValueList Left, Right;
1436 reorderAltShuffleOperands(VL, Left, Right);
1437 buildTree_rec(Left, Depth + 1);
1926 SmallVectorImpl<Value *> &Left,
1928 // Push left and right operands of binary operation into Left and Right
1930 Left.push_back(cast<Instruction>(i)->getOperand(0));
1937 if (LoadInst *L = dyn_cast<LoadInst>(Left[j])) {
1942 std::swap(Left[j], Right[j]);
1946 std::swap(Left[j + 1], Right[j + 1]);
1953 if (LoadInst *L1 = dyn_cast<LoadInst>(Left[j + 1])) {
1957 std::swap(Left[j], Right[j]);
1961 std::swap(Left[j + 1], Right[j + 1]);
1970 // Return true if I should be commuted before adding it's left and right
1971 // operands to the arrays Left and Right.
1977 SmallVectorImpl<Value *> &Left,
1993 if (SplatLeft && VLeft == Left[i - 1])
2000 if (VLeft == Left[i - 1])
2003 if (VRight == Left[i - 1])
2010 // If we have "AllSameOpcodeRight", try to see if the left operands preserves
2019 // not also a match on the existing operands on the Left to preserve
2023 cast<Instruction>(Left[i - 1])->getOpcode() == ILeft->getOpcode())
2028 // Symmetrically handle Left side.
2030 unsigned LeftPrevOpcode = cast<Instruction>(Left[i - 1])->getOpcode();
2040 SmallVectorImpl<Value *> &Left,
2051 Left.push_back(VLeft);
2056 bool AllSameOpcodeLeft = isa<Instruction>(Left[0]);
2067 if (shouldReorderOperands(i, *I, Left, Right, AllSameOpcodeLeft,
2069 Left.push_back(I->getOperand(1));
2072 Left.push_back(I->getOperand(0));
2077 SplatLeft = SplatLeft && (Left[i - 1] == Left[i]);
2078 AllSameOpcodeLeft = AllSameOpcodeLeft && isa<Instruction>(Left[i]) &&
2079 (cast<Instruction>(Left[i - 1])->getOpcode() ==
2080 cast<Instruction>(Left[i])->getOpcode());
2106 if (LoadInst *L = dyn_cast<LoadInst>(Left[j])) {
2109 std::swap(Left[j + 1], Right[j + 1]);
2115 if (LoadInst *L1 = dyn_cast<LoadInst>(Left[j + 1])) {
2117 std::swap(Left[j + 1], Right[j + 1]);
3902 // Build a mask of 0, 2, ... (left) or 1, 3, ... (right).
4051 // Visit left or right.
