InstCombinePHI.cpp revision 4130278fbee97b9cd1ea4069e9c666bbe89d61f9
1f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner//===- InstCombinePHI.cpp -------------------------------------------------===// 2f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner// 3f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner// The LLVM Compiler Infrastructure 4f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner// 5f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner// This file is distributed under the University of Illinois Open Source 6f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner// License. See LICENSE.TXT for details. 7f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner// 8f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner//===----------------------------------------------------------------------===// 9f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner// 10f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner// This file implements the visitPHINode function. 11f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner// 12f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner//===----------------------------------------------------------------------===// 13f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 14f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner#include "InstCombine.h" 15cd6636c737a82949ad13db2d0d918af6424fb78bDuncan Sands#include "llvm/Analysis/InstructionSimplify.h" 16f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner#include "llvm/Target/TargetData.h" 17f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner#include "llvm/ADT/SmallPtrSet.h" 18f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner#include "llvm/ADT/STLExtras.h" 19f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattnerusing namespace llvm; 20f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 21f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// FoldPHIArgBinOpIntoPHI - If we have something like phi [add (a,b), add(a,c)] 22f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// and if a/b/c and the add's all have a single use, turn this into a phi 23f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// and a single binop. 24f54e72962991005a3c0cc7dce0c550a14af90792Chris LattnerInstruction *InstCombiner::FoldPHIArgBinOpIntoPHI(PHINode &PN) { 25f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0)); 26f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner assert(isa<BinaryOperator>(FirstInst) || isa<CmpInst>(FirstInst)); 27f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner unsigned Opc = FirstInst->getOpcode(); 28f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *LHSVal = FirstInst->getOperand(0); 29f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *RHSVal = FirstInst->getOperand(1); 30f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 31f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner const Type *LHSType = LHSVal->getType(); 32f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner const Type *RHSType = RHSVal->getType(); 33f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 34c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner bool isNUW = false, isNSW = false, isExact = false; 35c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (OverflowingBinaryOperator *BO = 36c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner dyn_cast<OverflowingBinaryOperator>(FirstInst)) { 37c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner isNUW = BO->hasNoUnsignedWrap(); 38c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner isNSW = BO->hasNoSignedWrap(); 39c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner } else if (PossiblyExactOperator *PEO = 40c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner dyn_cast<PossiblyExactOperator>(FirstInst)) 41c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner isExact = PEO->isExact(); 42c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner 43f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Scan to see if all operands are the same opcode, and all have one use. 44f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) { 45f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i)); 46f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (!I || I->getOpcode() != Opc || !I->hasOneUse() || 47f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Verify type of the LHS matches so we don't fold cmp's of different 48c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner // types. 49f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner I->getOperand(0)->getType() != LHSType || 50f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner I->getOperand(1)->getType() != RHSType) 51f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 52f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 53f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If they are CmpInst instructions, check their predicates 54c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (CmpInst *CI = dyn_cast<CmpInst>(I)) 55c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (CI->getPredicate() != cast<CmpInst>(FirstInst)->getPredicate()) 56f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 57f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 58c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (isNUW) 59c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner isNUW = cast<OverflowingBinaryOperator>(I)->hasNoUnsignedWrap(); 60c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (isNSW) 61c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner isNSW = cast<OverflowingBinaryOperator>(I)->hasNoSignedWrap(); 62c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (isExact) 63c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner isExact = cast<PossiblyExactOperator>(I)->isExact(); 64c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner 65f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Keep track of which operand needs a phi node. 66f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (I->getOperand(0) != LHSVal) LHSVal = 0; 67f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (I->getOperand(1) != RHSVal) RHSVal = 0; 68f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 69f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 70f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If both LHS and RHS would need a PHI, don't do this transformation, 71f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // because it would increase the number of PHIs entering the block, 72f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // which leads to higher register pressure. This is especially 73f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // bad when the PHIs are in the header of a loop. 74f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (!LHSVal && !RHSVal) 75f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 76f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 77f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Otherwise, this is safe to transform! 78f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 79f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *InLHS = FirstInst->getOperand(0); 80f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *InRHS = FirstInst->getOperand(1); 81f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHINode *NewLHS = 0, *NewRHS = 0; 82f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (LHSVal == 0) { 833ecfc861b4365f341c5c969b40e1afccde676e6fJay Foad NewLHS = PHINode::Create(LHSType, PN.getNumIncomingValues(), 84f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner FirstInst->getOperand(0)->getName() + ".pn"); 85f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner NewLHS->addIncoming(InLHS, PN.getIncomingBlock(0)); 86f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner InsertNewInstBefore(NewLHS, PN); 87f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner LHSVal = NewLHS; 88f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 89f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 90f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (RHSVal == 0) { 913ecfc861b4365f341c5c969b40e1afccde676e6fJay Foad NewRHS = PHINode::Create(RHSType, PN.getNumIncomingValues(), 92f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner FirstInst->getOperand(1)->getName() + ".pn"); 93f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner NewRHS->addIncoming(InRHS, PN.getIncomingBlock(0)); 94f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner InsertNewInstBefore(NewRHS, PN); 95f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner RHSVal = NewRHS; 96f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 97f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 98f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Add all operands to the new PHIs. 99f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (NewLHS || NewRHS) { 100f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) { 101f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Instruction *InInst = cast<Instruction>(PN.getIncomingValue(i)); 102f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (NewLHS) { 103f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *NewInLHS = InInst->getOperand(0); 104f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner NewLHS->addIncoming(NewInLHS, PN.getIncomingBlock(i)); 105f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 106f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (NewRHS) { 107f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *NewInRHS = InInst->getOperand(1); 108f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner NewRHS->addIncoming(NewInRHS, PN.getIncomingBlock(i)); 109f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 110f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 111f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 112f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 113c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (CmpInst *CIOp = dyn_cast<CmpInst>(FirstInst)) 114c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner return CmpInst::Create(CIOp->getOpcode(), CIOp->getPredicate(), 115c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner LHSVal, RHSVal); 116c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner 117c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner BinaryOperator *BinOp = cast<BinaryOperator>(FirstInst); 118c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner BinaryOperator *NewBinOp = 119c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner BinaryOperator::Create(BinOp->getOpcode(), LHSVal, RHSVal); 120c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (isNUW) NewBinOp->setHasNoUnsignedWrap(); 121c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (isNSW) NewBinOp->setHasNoSignedWrap(); 122c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (isExact) NewBinOp->setIsExact(); 123c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner return NewBinOp; 124f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner} 125f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 126f54e72962991005a3c0cc7dce0c550a14af90792Chris LattnerInstruction *InstCombiner::FoldPHIArgGEPIntoPHI(PHINode &PN) { 127f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner GetElementPtrInst *FirstInst =cast<GetElementPtrInst>(PN.getIncomingValue(0)); 128f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 129f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner SmallVector<Value*, 16> FixedOperands(FirstInst->op_begin(), 130f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner FirstInst->op_end()); 131f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // This is true if all GEP bases are allocas and if all indices into them are 132f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // constants. 133f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner bool AllBasePointersAreAllocas = true; 134f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 135f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // We don't want to replace this phi if the replacement would require 136f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // more than one phi, which leads to higher register pressure. This is 137f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // especially bad when the PHIs are in the header of a loop. 138f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner bool NeededPhi = false; 139f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 1404bd8217af3cf38f9fcce378fbc687162e28a7cf8Chris Lattner bool AllInBounds = true; 1414bd8217af3cf38f9fcce378fbc687162e28a7cf8Chris Lattner 142f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Scan to see if all operands are the same opcode, and all have one use. 143f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 1; i != PN.getNumIncomingValues(); ++i) { 144f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner GetElementPtrInst *GEP= dyn_cast<GetElementPtrInst>(PN.getIncomingValue(i)); 145f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (!GEP || !GEP->hasOneUse() || GEP->getType() != FirstInst->getType() || 146f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner GEP->getNumOperands() != FirstInst->getNumOperands()) 147f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 148f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 1494bd8217af3cf38f9fcce378fbc687162e28a7cf8Chris Lattner AllInBounds &= GEP->isInBounds(); 1504bd8217af3cf38f9fcce378fbc687162e28a7cf8Chris Lattner 151f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Keep track of whether or not all GEPs are of alloca pointers. 152f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (AllBasePointersAreAllocas && 153f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner (!isa<AllocaInst>(GEP->getOperand(0)) || 154f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner !GEP->hasAllConstantIndices())) 155f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner AllBasePointersAreAllocas = false; 156f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 157f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Compare the operand lists. 158f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned op = 0, e = FirstInst->getNumOperands(); op != e; ++op) { 159f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (FirstInst->getOperand(op) == GEP->getOperand(op)) 160f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner continue; 161f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 162f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Don't merge two GEPs when two operands differ (introducing phi nodes) 163f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // if one of the PHIs has a constant for the index. The index may be 164f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // substantially cheaper to compute for the constants, so making it a 165f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // variable index could pessimize the path. This also handles the case 166f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // for struct indices, which must always be constant. 167f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (isa<ConstantInt>(FirstInst->getOperand(op)) || 168f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner isa<ConstantInt>(GEP->getOperand(op))) 169f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 170f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 171f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (FirstInst->getOperand(op)->getType() !=GEP->getOperand(op)->getType()) 172f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 173f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 174f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If we already needed a PHI for an earlier operand, and another operand 175f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // also requires a PHI, we'd be introducing more PHIs than we're 176f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // eliminating, which increases register pressure on entry to the PHI's 177f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // block. 178f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (NeededPhi) 179f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 180f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 181f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner FixedOperands[op] = 0; // Needs a PHI. 182f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner NeededPhi = true; 183f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 184f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 185f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 186f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If all of the base pointers of the PHI'd GEPs are from allocas, don't 187f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // bother doing this transformation. At best, this will just save a bit of 188f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // offset calculation, but all the predecessors will have to materialize the 189f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // stack address into a register anyway. We'd actually rather *clone* the 190f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // load up into the predecessors so that we have a load of a gep of an alloca, 191f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // which can usually all be folded into the load. 192f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (AllBasePointersAreAllocas) 193f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 194f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 195f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Otherwise, this is safe to transform. Insert PHI nodes for each operand 196f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // that is variable. 197f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner SmallVector<PHINode*, 16> OperandPhis(FixedOperands.size()); 198f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 199f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner bool HasAnyPHIs = false; 200f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 0, e = FixedOperands.size(); i != e; ++i) { 201f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (FixedOperands[i]) continue; // operand doesn't need a phi. 202f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *FirstOp = FirstInst->getOperand(i); 2033ecfc861b4365f341c5c969b40e1afccde676e6fJay Foad PHINode *NewPN = PHINode::Create(FirstOp->getType(), e, 204f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner FirstOp->getName()+".pn"); 205f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner InsertNewInstBefore(NewPN, PN); 206f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 207f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner NewPN->addIncoming(FirstOp, PN.getIncomingBlock(0)); 208f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner OperandPhis[i] = NewPN; 209f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner FixedOperands[i] = NewPN; 210f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner HasAnyPHIs = true; 211f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 212f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 213f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 214f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Add all operands to the new PHIs. 215f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (HasAnyPHIs) { 216f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) { 217f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner GetElementPtrInst *InGEP =cast<GetElementPtrInst>(PN.getIncomingValue(i)); 218f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner BasicBlock *InBB = PN.getIncomingBlock(i); 219f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 220f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned op = 0, e = OperandPhis.size(); op != e; ++op) 221f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHINode *OpPhi = OperandPhis[op]) 222f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner OpPhi->addIncoming(InGEP->getOperand(op), InBB); 223f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 224f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 225f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 226f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *Base = FixedOperands[0]; 2274bd8217af3cf38f9fcce378fbc687162e28a7cf8Chris Lattner GetElementPtrInst *NewGEP = 228f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner GetElementPtrInst::Create(Base, FixedOperands.begin()+1, 229f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner FixedOperands.end()); 2301521e91fc442b5c27d56118b45248e3d5707f7e2Chris Lattner if (AllInBounds) NewGEP->setIsInBounds(); 2314bd8217af3cf38f9fcce378fbc687162e28a7cf8Chris Lattner return NewGEP; 232f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner} 233f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 234f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 235f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// isSafeAndProfitableToSinkLoad - Return true if we know that it is safe to 236f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// sink the load out of the block that defines it. This means that it must be 237f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// obvious the value of the load is not changed from the point of the load to 238f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// the end of the block it is in. 239f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// 2407a2bdde0a0eebcd2125055e0eacaca040f0b766cChris Lattner/// Finally, it is safe, but not profitable, to sink a load targeting a 241f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// non-address-taken alloca. Doing so will cause us to not promote the alloca 242f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// to a register. 243f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattnerstatic bool isSafeAndProfitableToSinkLoad(LoadInst *L) { 244f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner BasicBlock::iterator BBI = L, E = L->getParent()->end(); 245f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 246f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (++BBI; BBI != E; ++BBI) 247f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (BBI->mayWriteToMemory()) 248f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return false; 249f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 250f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Check for non-address taken alloca. If not address-taken already, it isn't 251f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // profitable to do this xform. 252f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(L->getOperand(0))) { 253f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner bool isAddressTaken = false; 254f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (Value::use_iterator UI = AI->use_begin(), E = AI->use_end(); 255f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner UI != E; ++UI) { 25640119ceeecafdd6d47bd7bb7f520262858b931dfGabor Greif User *U = *UI; 25740119ceeecafdd6d47bd7bb7f520262858b931dfGabor Greif if (isa<LoadInst>(U)) continue; 25840119ceeecafdd6d47bd7bb7f520262858b931dfGabor Greif if (StoreInst *SI = dyn_cast<StoreInst>(U)) { 259f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If storing TO the alloca, then the address isn't taken. 260f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (SI->getOperand(1) == AI) continue; 261f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 262f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner isAddressTaken = true; 263f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner break; 264f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 265f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 266f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (!isAddressTaken && AI->isStaticAlloca()) 267f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return false; 268f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 269f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 270f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If this load is a load from a GEP with a constant offset from an alloca, 271f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // then we don't want to sink it. In its present form, it will be 272f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // load [constant stack offset]. Sinking it will cause us to have to 273f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // materialize the stack addresses in each predecessor in a register only to 274f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // do a shared load from register in the successor. 275f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(L->getOperand(0))) 276f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(GEP->getOperand(0))) 277f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (AI->isStaticAlloca() && GEP->hasAllConstantIndices()) 278f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return false; 279f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 280f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return true; 281f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner} 282f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 283f54e72962991005a3c0cc7dce0c550a14af90792Chris LattnerInstruction *InstCombiner::FoldPHIArgLoadIntoPHI(PHINode &PN) { 284f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner LoadInst *FirstLI = cast<LoadInst>(PN.getIncomingValue(0)); 285f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 286f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // When processing loads, we need to propagate two bits of information to the 287f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // sunk load: whether it is volatile, and what its alignment is. We currently 288f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // don't sink loads when some have their alignment specified and some don't. 289f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // visitLoadInst will propagate an alignment onto the load when TD is around, 290f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // and if TD isn't around, we can't handle the mixed case. 291f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner bool isVolatile = FirstLI->isVolatile(); 292f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner unsigned LoadAlignment = FirstLI->getAlignment(); 2934c5fb1a311a7a5e3ceb802f5b26329d30f2713b1Chris Lattner unsigned LoadAddrSpace = FirstLI->getPointerAddressSpace(); 294f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 295f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // We can't sink the load if the loaded value could be modified between the 296f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // load and the PHI. 297f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (FirstLI->getParent() != PN.getIncomingBlock(0) || 298f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner !isSafeAndProfitableToSinkLoad(FirstLI)) 299f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 300f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 301f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If the PHI is of volatile loads and the load block has multiple 302f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // successors, sinking it would remove a load of the volatile value from 303f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // the path through the other successor. 304f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (isVolatile && 305f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner FirstLI->getParent()->getTerminator()->getNumSuccessors() != 1) 306f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 307f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 308f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Check to see if all arguments are the same operation. 309f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) { 310f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner LoadInst *LI = dyn_cast<LoadInst>(PN.getIncomingValue(i)); 311f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (!LI || !LI->hasOneUse()) 312f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 313f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 314f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // We can't sink the load if the loaded value could be modified between 315f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // the load and the PHI. 316f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (LI->isVolatile() != isVolatile || 317f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner LI->getParent() != PN.getIncomingBlock(i) || 3184c5fb1a311a7a5e3ceb802f5b26329d30f2713b1Chris Lattner LI->getPointerAddressSpace() != LoadAddrSpace || 319f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner !isSafeAndProfitableToSinkLoad(LI)) 320f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 321f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 322f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If some of the loads have an alignment specified but not all of them, 323f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // we can't do the transformation. 324f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if ((LoadAlignment != 0) != (LI->getAlignment() != 0)) 325f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 326f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 327f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner LoadAlignment = std::min(LoadAlignment, LI->getAlignment()); 328f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 329f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If the PHI is of volatile loads and the load block has multiple 330f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // successors, sinking it would remove a load of the volatile value from 331f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // the path through the other successor. 332f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (isVolatile && 333f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner LI->getParent()->getTerminator()->getNumSuccessors() != 1) 334f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 335f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 336f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 337f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Okay, they are all the same operation. Create a new PHI node of the 338f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // correct type, and PHI together all of the LHS's of the instructions. 339f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHINode *NewPN = PHINode::Create(FirstLI->getOperand(0)->getType(), 3403ecfc861b4365f341c5c969b40e1afccde676e6fJay Foad PN.getNumIncomingValues(), 341f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PN.getName()+".in"); 342f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 343f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *InVal = FirstLI->getOperand(0); 344f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner NewPN->addIncoming(InVal, PN.getIncomingBlock(0)); 345f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 346f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Add all operands to the new PHI. 347f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) { 348f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *NewInVal = cast<LoadInst>(PN.getIncomingValue(i))->getOperand(0); 349f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (NewInVal != InVal) 350f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner InVal = 0; 351f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner NewPN->addIncoming(NewInVal, PN.getIncomingBlock(i)); 352f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 353f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 354f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *PhiVal; 355f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (InVal) { 356f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // The new PHI unions all of the same values together. This is really 357f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // common, so we handle it intelligently here for compile-time speed. 358f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PhiVal = InVal; 359f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner delete NewPN; 360f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } else { 361f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner InsertNewInstBefore(NewPN, PN); 362f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PhiVal = NewPN; 363f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 364f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 365f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If this was a volatile load that we are merging, make sure to loop through 366f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // and mark all the input loads as non-volatile. If we don't do this, we will 367f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // insert a new volatile load and the old ones will not be deletable. 368f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (isVolatile) 369f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) 370f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner cast<LoadInst>(PN.getIncomingValue(i))->setVolatile(false); 371f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 372f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return new LoadInst(PhiVal, "", isVolatile, LoadAlignment); 373f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner} 374f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 375f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 376f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 377f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// FoldPHIArgOpIntoPHI - If all operands to a PHI node are the same "unary" 378f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// operator and they all are only used by the PHI, PHI together their 379f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// inputs, and do the operation once, to the result of the PHI. 380f54e72962991005a3c0cc7dce0c550a14af90792Chris LattnerInstruction *InstCombiner::FoldPHIArgOpIntoPHI(PHINode &PN) { 381f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Instruction *FirstInst = cast<Instruction>(PN.getIncomingValue(0)); 382f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 383f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (isa<GetElementPtrInst>(FirstInst)) 384f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return FoldPHIArgGEPIntoPHI(PN); 385f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (isa<LoadInst>(FirstInst)) 386f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return FoldPHIArgLoadIntoPHI(PN); 387f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 388f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Scan the instruction, looking for input operations that can be folded away. 389f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If all input operands to the phi are the same instruction (e.g. a cast from 390f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // the same type or "+42") we can pull the operation through the PHI, reducing 391f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // code size and simplifying code. 392f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Constant *ConstantOp = 0; 393f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner const Type *CastSrcTy = 0; 394c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner bool isNUW = false, isNSW = false, isExact = false; 395f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 396f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (isa<CastInst>(FirstInst)) { 397f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner CastSrcTy = FirstInst->getOperand(0)->getType(); 398f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 399f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Be careful about transforming integer PHIs. We don't want to pessimize 400f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // the code by turning an i32 into an i1293. 4011df9859c40492511b8aa4321eb76496005d3b75bDuncan Sands if (PN.getType()->isIntegerTy() && CastSrcTy->isIntegerTy()) { 402f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (!ShouldChangeType(PN.getType(), CastSrcTy)) 403f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 404f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 405f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } else if (isa<BinaryOperator>(FirstInst) || isa<CmpInst>(FirstInst)) { 406f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Can fold binop, compare or shift here if the RHS is a constant, 407f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // otherwise call FoldPHIArgBinOpIntoPHI. 408f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner ConstantOp = dyn_cast<Constant>(FirstInst->getOperand(1)); 409f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (ConstantOp == 0) 410f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return FoldPHIArgBinOpIntoPHI(PN); 411c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner 412c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (OverflowingBinaryOperator *BO = 413c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner dyn_cast<OverflowingBinaryOperator>(FirstInst)) { 414c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner isNUW = BO->hasNoUnsignedWrap(); 415c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner isNSW = BO->hasNoSignedWrap(); 416c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner } else if (PossiblyExactOperator *PEO = 417c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner dyn_cast<PossiblyExactOperator>(FirstInst)) 418c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner isExact = PEO->isExact(); 419f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } else { 420f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; // Cannot fold this operation. 421f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 422f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 423f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Check to see if all arguments are the same operation. 424f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) { 425f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Instruction *I = dyn_cast<Instruction>(PN.getIncomingValue(i)); 426f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (I == 0 || !I->hasOneUse() || !I->isSameOperationAs(FirstInst)) 427f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 428f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (CastSrcTy) { 429f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (I->getOperand(0)->getType() != CastSrcTy) 430f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; // Cast operation must match. 431f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } else if (I->getOperand(1) != ConstantOp) { 432f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 433f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 434c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner 435c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (isNUW) 436c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner isNUW = cast<OverflowingBinaryOperator>(I)->hasNoUnsignedWrap(); 437c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (isNSW) 438c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner isNSW = cast<OverflowingBinaryOperator>(I)->hasNoSignedWrap(); 439c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (isExact) 440c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner isExact = cast<PossiblyExactOperator>(I)->isExact(); 441f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 442f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 443f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Okay, they are all the same operation. Create a new PHI node of the 444f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // correct type, and PHI together all of the LHS's of the instructions. 445f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHINode *NewPN = PHINode::Create(FirstInst->getOperand(0)->getType(), 4463ecfc861b4365f341c5c969b40e1afccde676e6fJay Foad PN.getNumIncomingValues(), 447f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PN.getName()+".in"); 448f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 449f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *InVal = FirstInst->getOperand(0); 450f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner NewPN->addIncoming(InVal, PN.getIncomingBlock(0)); 451f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 452f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Add all operands to the new PHI. 453f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 1, e = PN.getNumIncomingValues(); i != e; ++i) { 454f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *NewInVal = cast<Instruction>(PN.getIncomingValue(i))->getOperand(0); 455f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (NewInVal != InVal) 456f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner InVal = 0; 457f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner NewPN->addIncoming(NewInVal, PN.getIncomingBlock(i)); 458f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 459f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 460f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *PhiVal; 461f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (InVal) { 462f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // The new PHI unions all of the same values together. This is really 463f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // common, so we handle it intelligently here for compile-time speed. 464f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PhiVal = InVal; 465f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner delete NewPN; 466f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } else { 467f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner InsertNewInstBefore(NewPN, PN); 468f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PhiVal = NewPN; 469f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 470f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 471f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Insert and return the new operation. 472f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (CastInst *FirstCI = dyn_cast<CastInst>(FirstInst)) 473f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return CastInst::Create(FirstCI->getOpcode(), PhiVal, PN.getType()); 474f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 475c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst)) { 476c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner BinOp = BinaryOperator::Create(BinOp->getOpcode(), PhiVal, ConstantOp); 477c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (isNUW) BinOp->setHasNoUnsignedWrap(); 478c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (isNSW) BinOp->setHasNoSignedWrap(); 479c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner if (isExact) BinOp->setIsExact(); 480c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner return BinOp; 481c8cb8ef9c2d5e354db661022d707a19b3533c00eChris Lattner } 482f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 483f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner CmpInst *CIOp = cast<CmpInst>(FirstInst); 484f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return CmpInst::Create(CIOp->getOpcode(), CIOp->getPredicate(), 485f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PhiVal, ConstantOp); 486f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner} 487f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 488f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// DeadPHICycle - Return true if this PHI node is only used by a PHI node cycle 489f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// that is dead. 490f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattnerstatic bool DeadPHICycle(PHINode *PN, 491f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner SmallPtrSet<PHINode*, 16> &PotentiallyDeadPHIs) { 492f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PN->use_empty()) return true; 493f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (!PN->hasOneUse()) return false; 494f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 495f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Remember this node, and if we find the cycle, return. 496f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (!PotentiallyDeadPHIs.insert(PN)) 497f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return true; 498f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 499f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Don't scan crazily complex things. 500f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PotentiallyDeadPHIs.size() == 16) 501f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return false; 502f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 503f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHINode *PU = dyn_cast<PHINode>(PN->use_back())) 504f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return DeadPHICycle(PU, PotentiallyDeadPHIs); 505f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 506f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return false; 507f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner} 508f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 509f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// PHIsEqualValue - Return true if this phi node is always equal to 510f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// NonPhiInVal. This happens with mutually cyclic phi nodes like: 511f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// z = some value; x = phi (y, z); y = phi (x, z) 512f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattnerstatic bool PHIsEqualValue(PHINode *PN, Value *NonPhiInVal, 513f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner SmallPtrSet<PHINode*, 16> &ValueEqualPHIs) { 514f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // See if we already saw this PHI node. 515f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (!ValueEqualPHIs.insert(PN)) 516f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return true; 517f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 518f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Don't scan crazily complex things. 519f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (ValueEqualPHIs.size() == 16) 520f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return false; 521f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 522f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Scan the operands to see if they are either phi nodes or are equal to 523f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // the value. 524f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) { 525f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *Op = PN->getIncomingValue(i); 526f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHINode *OpPN = dyn_cast<PHINode>(Op)) { 527f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (!PHIsEqualValue(OpPN, NonPhiInVal, ValueEqualPHIs)) 528f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return false; 529f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } else if (Op != NonPhiInVal) 530f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return false; 531f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 532f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 533f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return true; 534f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner} 535f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 536f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 537f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattnernamespace { 538f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattnerstruct PHIUsageRecord { 539f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner unsigned PHIId; // The ID # of the PHI (something determinstic to sort on) 540f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner unsigned Shift; // The amount shifted. 541f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Instruction *Inst; // The trunc instruction. 542f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 543f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHIUsageRecord(unsigned pn, unsigned Sh, Instruction *User) 544f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner : PHIId(pn), Shift(Sh), Inst(User) {} 545f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 546f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner bool operator<(const PHIUsageRecord &RHS) const { 547f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHIId < RHS.PHIId) return true; 548f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHIId > RHS.PHIId) return false; 549f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (Shift < RHS.Shift) return true; 550f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (Shift > RHS.Shift) return false; 551f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return Inst->getType()->getPrimitiveSizeInBits() < 552f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner RHS.Inst->getType()->getPrimitiveSizeInBits(); 553f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 554f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner}; 555f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 556f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattnerstruct LoweredPHIRecord { 557f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHINode *PN; // The PHI that was lowered. 558f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner unsigned Shift; // The amount shifted. 559f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner unsigned Width; // The width extracted. 560f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 561f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner LoweredPHIRecord(PHINode *pn, unsigned Sh, const Type *Ty) 562f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner : PN(pn), Shift(Sh), Width(Ty->getPrimitiveSizeInBits()) {} 563f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 564f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Ctor form used by DenseMap. 565f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner LoweredPHIRecord(PHINode *pn, unsigned Sh) 566f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner : PN(pn), Shift(Sh), Width(0) {} 567f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner}; 568f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner} 569f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 570f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattnernamespace llvm { 571f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner template<> 572f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner struct DenseMapInfo<LoweredPHIRecord> { 573f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner static inline LoweredPHIRecord getEmptyKey() { 574f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return LoweredPHIRecord(0, 0); 575f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 576f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner static inline LoweredPHIRecord getTombstoneKey() { 577f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return LoweredPHIRecord(0, 1); 578f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 579f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner static unsigned getHashValue(const LoweredPHIRecord &Val) { 580f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return DenseMapInfo<PHINode*>::getHashValue(Val.PN) ^ (Val.Shift>>3) ^ 581f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner (Val.Width>>3); 582f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 583f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner static bool isEqual(const LoweredPHIRecord &LHS, 584f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner const LoweredPHIRecord &RHS) { 585f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return LHS.PN == RHS.PN && LHS.Shift == RHS.Shift && 586f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner LHS.Width == RHS.Width; 587f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 588f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner }; 589f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner template <> 590f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner struct isPodLike<LoweredPHIRecord> { static const bool value = true; }; 591f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner} 592f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 593f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 594f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// SliceUpIllegalIntegerPHI - This is an integer PHI and we know that it has an 595f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// illegal type: see if it is only used by trunc or trunc(lshr) operations. If 596f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// so, we split the PHI into the various pieces being extracted. This sort of 597f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// thing is introduced when SROA promotes an aggregate to large integer values. 598f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// 599f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// TODO: The user of the trunc may be an bitcast to float/double/vector or an 600f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// inttoptr. We should produce new PHIs in the right type. 601f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner/// 602f54e72962991005a3c0cc7dce0c550a14af90792Chris LattnerInstruction *InstCombiner::SliceUpIllegalIntegerPHI(PHINode &FirstPhi) { 603f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // PHIUsers - Keep track of all of the truncated values extracted from a set 604f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // of PHIs, along with their offset. These are the things we want to rewrite. 605f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner SmallVector<PHIUsageRecord, 16> PHIUsers; 606f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 607f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // PHIs are often mutually cyclic, so we keep track of a whole set of PHI 608f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // nodes which are extracted from. PHIsToSlice is a set we use to avoid 609f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // revisiting PHIs, PHIsInspected is a ordered list of PHIs that we need to 610f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // check the uses of (to ensure they are all extracts). 611f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner SmallVector<PHINode*, 8> PHIsToSlice; 612f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner SmallPtrSet<PHINode*, 8> PHIsInspected; 613f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 614f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHIsToSlice.push_back(&FirstPhi); 615f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHIsInspected.insert(&FirstPhi); 616f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 617f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned PHIId = 0; PHIId != PHIsToSlice.size(); ++PHIId) { 618f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHINode *PN = PHIsToSlice[PHIId]; 619f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 620f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Scan the input list of the PHI. If any input is an invoke, and if the 621f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // input is defined in the predecessor, then we won't be split the critical 622f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // edge which is required to insert a truncate. Because of this, we have to 623f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // bail out. 624f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) { 625f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner InvokeInst *II = dyn_cast<InvokeInst>(PN->getIncomingValue(i)); 626f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (II == 0) continue; 627f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (II->getParent() != PN->getIncomingBlock(i)) 628f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner continue; 629f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 630f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If we have a phi, and if it's directly in the predecessor, then we have 631f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // a critical edge where we need to put the truncate. Since we can't 632f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // split the edge in instcombine, we have to bail out. 633f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 634f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 635f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 636f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 637f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (Value::use_iterator UI = PN->use_begin(), E = PN->use_end(); 638f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner UI != E; ++UI) { 639f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Instruction *User = cast<Instruction>(*UI); 640f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 641f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If the user is a PHI, inspect its uses recursively. 642f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHINode *UserPN = dyn_cast<PHINode>(User)) { 643f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHIsInspected.insert(UserPN)) 644f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHIsToSlice.push_back(UserPN); 645f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner continue; 646f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 647f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 648f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Truncates are always ok. 649f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (isa<TruncInst>(User)) { 650f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHIUsers.push_back(PHIUsageRecord(PHIId, 0, User)); 651f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner continue; 652f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 653f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 654f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Otherwise it must be a lshr which can only be used by one trunc. 655f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (User->getOpcode() != Instruction::LShr || 656f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner !User->hasOneUse() || !isa<TruncInst>(User->use_back()) || 657f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner !isa<ConstantInt>(User->getOperand(1))) 658f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 659f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 660f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner unsigned Shift = cast<ConstantInt>(User->getOperand(1))->getZExtValue(); 661f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHIUsers.push_back(PHIUsageRecord(PHIId, Shift, User->use_back())); 662f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 663f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 664f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 665f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If we have no users, they must be all self uses, just nuke the PHI. 666f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHIUsers.empty()) 667f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return ReplaceInstUsesWith(FirstPhi, UndefValue::get(FirstPhi.getType())); 668f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 669f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If this phi node is transformable, create new PHIs for all the pieces 670f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // extracted out of it. First, sort the users by their offset and size. 671f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner array_pod_sort(PHIUsers.begin(), PHIUsers.end()); 672f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 673f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner DEBUG(errs() << "SLICING UP PHI: " << FirstPhi << '\n'; 674f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 1, e = PHIsToSlice.size(); i != e; ++i) 675f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner errs() << "AND USER PHI #" << i << ": " << *PHIsToSlice[i] <<'\n'; 676f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner ); 677f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 678f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // PredValues - This is a temporary used when rewriting PHI nodes. It is 679f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // hoisted out here to avoid construction/destruction thrashing. 680f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner DenseMap<BasicBlock*, Value*> PredValues; 681f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 682f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // ExtractedVals - Each new PHI we introduce is saved here so we don't 683f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // introduce redundant PHIs. 684f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner DenseMap<LoweredPHIRecord, PHINode*> ExtractedVals; 685f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 686f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned UserI = 0, UserE = PHIUsers.size(); UserI != UserE; ++UserI) { 687f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner unsigned PHIId = PHIUsers[UserI].PHIId; 688f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHINode *PN = PHIsToSlice[PHIId]; 689f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner unsigned Offset = PHIUsers[UserI].Shift; 690f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner const Type *Ty = PHIUsers[UserI].Inst->getType(); 691f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 692f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHINode *EltPHI; 693f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 694f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If we've already lowered a user like this, reuse the previously lowered 695f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // value. 696f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if ((EltPHI = ExtractedVals[LoweredPHIRecord(PN, Offset, Ty)]) == 0) { 697f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 698f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Otherwise, Create the new PHI node for this user. 6993ecfc861b4365f341c5c969b40e1afccde676e6fJay Foad EltPHI = PHINode::Create(Ty, PN->getNumIncomingValues(), 7003ecfc861b4365f341c5c969b40e1afccde676e6fJay Foad PN->getName()+".off"+Twine(Offset), PN); 701f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner assert(EltPHI->getType() != PN->getType() && 702f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner "Truncate didn't shrink phi?"); 703f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 704f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) { 705f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner BasicBlock *Pred = PN->getIncomingBlock(i); 706f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *&PredVal = PredValues[Pred]; 707f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 708f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If we already have a value for this predecessor, reuse it. 709f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PredVal) { 710f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner EltPHI->addIncoming(PredVal, Pred); 711f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner continue; 712f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 713f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 714f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Handle the PHI self-reuse case. 715f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *InVal = PN->getIncomingValue(i); 716f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (InVal == PN) { 717f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PredVal = EltPHI; 718f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner EltPHI->addIncoming(PredVal, Pred); 719f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner continue; 720f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 721f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 722f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHINode *InPHI = dyn_cast<PHINode>(PN)) { 723f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If the incoming value was a PHI, and if it was one of the PHIs we 724f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // already rewrote it, just use the lowered value. 725f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (Value *Res = ExtractedVals[LoweredPHIRecord(InPHI, Offset, Ty)]) { 726f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PredVal = Res; 727f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner EltPHI->addIncoming(PredVal, Pred); 728f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner continue; 729f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 730f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 731f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 732f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Otherwise, do an extract in the predecessor. 733f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Builder->SetInsertPoint(Pred, Pred->getTerminator()); 734f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *Res = InVal; 735f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (Offset) 736f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Res = Builder->CreateLShr(Res, ConstantInt::get(InVal->getType(), 737f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Offset), "extract"); 738f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Res = Builder->CreateTrunc(Res, Ty, "extract.t"); 739f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PredVal = Res; 740f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner EltPHI->addIncoming(Res, Pred); 741f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 742f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If the incoming value was a PHI, and if it was one of the PHIs we are 743f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // rewriting, we will ultimately delete the code we inserted. This 744f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // means we need to revisit that PHI to make sure we extract out the 745f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // needed piece. 746f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHINode *OldInVal = dyn_cast<PHINode>(PN->getIncomingValue(i))) 747f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHIsInspected.count(OldInVal)) { 748f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner unsigned RefPHIId = std::find(PHIsToSlice.begin(),PHIsToSlice.end(), 749f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner OldInVal)-PHIsToSlice.begin(); 750f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHIUsers.push_back(PHIUsageRecord(RefPHIId, Offset, 751f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner cast<Instruction>(Res))); 752f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner ++UserE; 753f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 754f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 755f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PredValues.clear(); 756f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 757f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner DEBUG(errs() << " Made element PHI for offset " << Offset << ": " 758f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner << *EltPHI << '\n'); 759f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner ExtractedVals[LoweredPHIRecord(PN, Offset, Ty)] = EltPHI; 760f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 761f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 762f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Replace the use of this piece with the PHI node. 763f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner ReplaceInstUsesWith(*PHIUsers[UserI].Inst, EltPHI); 764f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 765f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 766f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Replace all the remaining uses of the PHI nodes (self uses and the lshrs) 767f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // with undefs. 768f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *Undef = UndefValue::get(FirstPhi.getType()); 769f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 1, e = PHIsToSlice.size(); i != e; ++i) 770f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner ReplaceInstUsesWith(*PHIsToSlice[i], Undef); 771f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return ReplaceInstUsesWith(FirstPhi, Undef); 772f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner} 773f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 774f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner// PHINode simplification 775f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner// 776f54e72962991005a3c0cc7dce0c550a14af90792Chris LattnerInstruction *InstCombiner::visitPHINode(PHINode &PN) { 777f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If LCSSA is around, don't mess with Phi nodes 778f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (MustPreserveLCSSA) return 0; 779cd6636c737a82949ad13db2d0d918af6424fb78bDuncan Sands 780cd6636c737a82949ad13db2d0d918af6424fb78bDuncan Sands if (Value *V = SimplifyInstruction(&PN, TD)) 781f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return ReplaceInstUsesWith(PN, V); 782f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 783f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If all PHI operands are the same operation, pull them through the PHI, 784f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // reducing code size. 785f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (isa<Instruction>(PN.getIncomingValue(0)) && 786f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner isa<Instruction>(PN.getIncomingValue(1)) && 787f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner cast<Instruction>(PN.getIncomingValue(0))->getOpcode() == 788f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner cast<Instruction>(PN.getIncomingValue(1))->getOpcode() && 789f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // FIXME: The hasOneUse check will fail for PHIs that use the value more 790f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // than themselves more than once. 791f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PN.getIncomingValue(0)->hasOneUse()) 792f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (Instruction *Result = FoldPHIArgOpIntoPHI(PN)) 793f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return Result; 794f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 795f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If this is a trivial cycle in the PHI node graph, remove it. Basically, if 796f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // this PHI only has a single use (a PHI), and if that PHI only has one use (a 797f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // PHI)... break the cycle. 798f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PN.hasOneUse()) { 799f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Instruction *PHIUser = cast<Instruction>(PN.use_back()); 800f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHINode *PU = dyn_cast<PHINode>(PHIUser)) { 801f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner SmallPtrSet<PHINode*, 16> PotentiallyDeadPHIs; 802f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PotentiallyDeadPHIs.insert(&PN); 803f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (DeadPHICycle(PU, PotentiallyDeadPHIs)) 804f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType())); 805f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 806f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 807f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If this phi has a single use, and if that use just computes a value for 808f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // the next iteration of a loop, delete the phi. This occurs with unused 809f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // induction variables, e.g. "for (int j = 0; ; ++j);". Detecting this 810f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // common case here is good because the only other things that catch this 811f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // are induction variable analysis (sometimes) and ADCE, which is only run 812f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // late. 813f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHIUser->hasOneUse() && 814f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner (isa<BinaryOperator>(PHIUser) || isa<GetElementPtrInst>(PHIUser)) && 815f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHIUser->use_back() == &PN) { 816f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return ReplaceInstUsesWith(PN, UndefValue::get(PN.getType())); 817f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 818f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 819f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 820f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // We sometimes end up with phi cycles that non-obviously end up being the 821f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // same value, for example: 822f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // z = some value; x = phi (y, z); y = phi (x, z) 823f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // where the phi nodes don't necessarily need to be in the same block. Do a 824f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // quick check to see if the PHI node only contains a single non-phi value, if 825f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // so, scan to see if the phi cycle is actually equal to that value. 826f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner { 827f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner unsigned InValNo = 0, NumOperandVals = PN.getNumIncomingValues(); 828f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Scan for the first non-phi operand. 829f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner while (InValNo != NumOperandVals && 830f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner isa<PHINode>(PN.getIncomingValue(InValNo))) 831f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner ++InValNo; 832f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 833f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (InValNo != NumOperandVals) { 8344130278fbee97b9cd1ea4069e9c666bbe89d61f9Jay Foad Value *NonPhiInVal = PN.getIncomingValue(InValNo); 835f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 836f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // Scan the rest of the operands to see if there are any conflicts, if so 837f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // there is no need to recursively scan other phis. 838f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (++InValNo; InValNo != NumOperandVals; ++InValNo) { 839f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *OpVal = PN.getIncomingValue(InValNo); 840f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (OpVal != NonPhiInVal && !isa<PHINode>(OpVal)) 841f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner break; 842f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 843f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 844f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If we scanned over all operands, then we have one unique value plus 845f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // phi values. Scan PHI nodes to see if they all merge in each other or 846f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // the value. 847f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (InValNo == NumOperandVals) { 848f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner SmallPtrSet<PHINode*, 16> ValueEqualPHIs; 849f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (PHIsEqualValue(&PN, NonPhiInVal, ValueEqualPHIs)) 850f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return ReplaceInstUsesWith(PN, NonPhiInVal); 851f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 852f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 853f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 854f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 855f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If there are multiple PHIs, sort their operands so that they all list 856f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // the blocks in the same order. This will help identical PHIs be eliminated 857f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // by other passes. Other passes shouldn't depend on this for correctness 858f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // however. 859f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PHINode *FirstPN = cast<PHINode>(PN.getParent()->begin()); 860f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (&PN != FirstPN) 861f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner for (unsigned i = 0, e = FirstPN->getNumIncomingValues(); i != e; ++i) { 862f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner BasicBlock *BBA = PN.getIncomingBlock(i); 863f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner BasicBlock *BBB = FirstPN->getIncomingBlock(i); 864f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (BBA != BBB) { 865f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *VA = PN.getIncomingValue(i); 866f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner unsigned j = PN.getBasicBlockIndex(BBB); 867f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner Value *VB = PN.getIncomingValue(j); 868f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PN.setIncomingBlock(i, BBB); 869f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PN.setIncomingValue(i, VB); 870f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PN.setIncomingBlock(j, BBA); 871f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner PN.setIncomingValue(j, VA); 872f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // NOTE: Instcombine normally would want us to "return &PN" if we 873f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // modified any of the operands of an instruction. However, since we 874f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // aren't adding or removing uses (just rearranging them) we don't do 875f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // this in this case. 876f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 877f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner } 878f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 879f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // If this is an integer PHI and we know that it has an illegal type, see if 880f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // it is only used by trunc or trunc(lshr) operations. If so, we split the 881f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // PHI into the various pieces being extracted. This sort of thing is 882f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner // introduced when SROA promotes an aggregate to a single large integer type. 8831df9859c40492511b8aa4321eb76496005d3b75bDuncan Sands if (PN.getType()->isIntegerTy() && TD && 884f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner !TD->isLegalInteger(PN.getType()->getPrimitiveSizeInBits())) 885f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner if (Instruction *Res = SliceUpIllegalIntegerPHI(PN)) 886f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return Res; 887f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner 888f54e72962991005a3c0cc7dce0c550a14af90792Chris Lattner return 0; 889eade00209447c07953a609b30666ce5f6d9f9864Benjamin Kramer} 890