X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=lib%2FTransforms%2FLevelRaise.cpp;h=b76e8baa4b2295787c4748679f5d636ee569db6c;hb=b3abf9d0d8978408b3cb8d8983db8d1aaa9ce64c;hp=af6555cc2034fde9d2fb558a62a96b576150390e;hpb=3c0193742a838ed91303d1efd099de10793cdc2a;p=oota-llvm.git diff --git a/lib/Transforms/LevelRaise.cpp b/lib/Transforms/LevelRaise.cpp index af6555cc203..b76e8baa4b2 100644 --- a/lib/Transforms/LevelRaise.cpp +++ b/lib/Transforms/LevelRaise.cpp @@ -26,14 +26,8 @@ static Statistic<> NumCastOfCast("raise\t\t- Number of cast-of-self removed"); static Statistic<> NumDCEorCP("raise\t\t- Number of insts DCE'd or constprop'd"); -//#define DEBUG_PEEPHOLE_INSTS 1 - -#ifdef DEBUG_PEEPHOLE_INSTS #define PRINT_PEEPHOLE(ID, NUM, I) \ - std::cerr << "Inst P/H " << ID << "[" << NUM << "] " << I; -#else -#define PRINT_PEEPHOLE(ID, NUM, I) -#endif + DEBUG(std::cerr << "Inst P/H " << ID << "[" << NUM << "] " << I) #define PRINT_PEEPHOLE1(ID, I1) do { PRINT_PEEPHOLE(ID, 0, I1); } while (0) #define PRINT_PEEPHOLE2(ID, I1, I2) \ @@ -217,9 +211,7 @@ static bool PeepholeOptimize(BasicBlock *BB, BasicBlock::iterator &BI) { if (ExpressionConvertableToType(Src, DestTy, ConvertedTypes)) { PRINT_PEEPHOLE3("CAST-SRC-EXPR-CONV:in ", Src, CI, BB->getParent()); -#ifdef DEBUG_PEEPHOLE_INSTS - cerr << "\nCONVERTING SRC EXPR TYPE:\n"; -#endif + DEBUG(cerr << "\nCONVERTING SRC EXPR TYPE:\n"); ValueMapCache ValueMap; Value *E = ConvertExpressionToType(Src, DestTy, ValueMap); if (Constant *CPV = dyn_cast(E)) @@ -227,9 +219,7 @@ static bool PeepholeOptimize(BasicBlock *BB, BasicBlock::iterator &BI) { BI = BB->begin(); // Rescan basic block. BI might be invalidated. PRINT_PEEPHOLE1("CAST-SRC-EXPR-CONV:out", E); -#ifdef DEBUG_PEEPHOLE_INSTS - cerr << "DONE CONVERTING SRC EXPR TYPE: \n" << BB->getParent(); -#endif + DEBUG(cerr << "DONE CONVERTING SRC EXPR TYPE: \n" << BB->getParent()); ++NumExprTreesConv; return true; } @@ -241,17 +231,13 @@ static bool PeepholeOptimize(BasicBlock *BB, BasicBlock::iterator &BI) { if (ValueConvertableToType(CI, Src->getType(), ConvertedTypes)) { PRINT_PEEPHOLE3("CAST-DEST-EXPR-CONV:in ", Src, CI, BB->getParent()); -#ifdef DEBUG_PEEPHOLE_INSTS - cerr << "\nCONVERTING EXPR TYPE:\n"; -#endif + DEBUG(cerr << "\nCONVERTING EXPR TYPE:\n"); ValueMapCache ValueMap; ConvertValueToNewType(CI, Src, ValueMap); // This will delete CI! BI = BB->begin(); // Rescan basic block. BI might be invalidated. PRINT_PEEPHOLE1("CAST-DEST-EXPR-CONV:out", Src); -#ifdef DEBUG_PEEPHOLE_INSTS - cerr << "DONE CONVERTING EXPR TYPE: \n\n" << BB->getParent(); -#endif + DEBUG(cerr << "DONE CONVERTING EXPR TYPE: \n\n" << BB->getParent()); ++NumExprTreesConv; return true; } @@ -279,7 +265,6 @@ static bool PeepholeOptimize(BasicBlock *BB, BasicBlock::iterator &BI) { // Into: %t2 = getelementptr {<...>} * %StructPtr, <0, 0, 0, ...> // %t1 = cast * %t1 to * // -#if 1 if (const CompositeType *CTy = getPointedToComposite(Src->getType())) if (const PointerType *DestPTy = dyn_cast(DestTy)) { @@ -354,9 +339,7 @@ static bool PeepholeOptimize(BasicBlock *BB, BasicBlock::iterator &BI) { } } } -#endif -#if 1 } else if (StoreInst *SI = dyn_cast(I)) { Value *Val = SI->getOperand(0); Value *Pointer = SI->getPointerOperand(); @@ -396,6 +379,46 @@ static bool PeepholeOptimize(BasicBlock *BB, BasicBlock::iterator &BI) { return true; } + } else if (LoadInst *LI = dyn_cast(I)) { + Value *Pointer = LI->getOperand(0); + const Type *PtrElType = + cast(Pointer->getType())->getElementType(); + + // Peephole optimize the following instructions: + // %Val = cast * to * ;; If T1 is losslessly convertable to T2 + // %t = load * %P + // + // Into: + // %t = load * %P + // %Val = cast to + // + // Note: This is not taken care of by expr conversion because there might + // not be a cast available for the store to convert the incoming value of. + // This code is basically here to make sure that pointers don't have casts + // if possible. + // + if (CastInst *CI = dyn_cast(Pointer)) + if (Value *CastSrc = CI->getOperand(0)) // CSPT = CastSrcPointerType + if (PointerType *CSPT = dyn_cast(CastSrc->getType())) + // convertable types? + if (PtrElType->isLosslesslyConvertableTo(CSPT->getElementType()) && + !LI->hasIndices()) { // No subscripts yet! + PRINT_PEEPHOLE2("load-src-cast:in ", Pointer, LI); + + // Create the new load instruction... loading the pre-casted value + LoadInst *NewLI = new LoadInst(CastSrc, LI->getName()); + + // Insert the new T cast instruction... stealing old T's name + CastInst *NCI = new CastInst(NewLI, LI->getType(), CI->getName()); + BI = BB->getInstList().insert(BI, NewLI)+1; + + // Replace the old store with a new one! + ReplaceInstWithInst(BB->getInstList(), BI, NCI); + PRINT_PEEPHOLE3("load-src-cast:out", NCI, CastSrc, NewLI); + ++NumLoadStorePeepholes; + return true; + } + } else if (I->getOpcode() == Instruction::Add && isa(I->getOperand(1))) { @@ -404,7 +427,6 @@ static bool PeepholeOptimize(BasicBlock *BB, BasicBlock::iterator &BI) { ++NumGEPInstFormed; return true; } -#endif } return false; @@ -420,15 +442,11 @@ static bool DoRaisePass(Function *F) { BasicBlock::InstListType &BIL = BB->getInstList(); for (BasicBlock::iterator BI = BB->begin(); BI != BB->end();) { -#if DEBUG_PEEPHOLE_INSTS - cerr << "Processing: " << *BI; -#endif + DEBUG(cerr << "Processing: " << *BI); if (dceInstruction(BIL, BI) || doConstantPropogation(BB, BI)) { Changed = true; ++NumDCEorCP; -#ifdef DEBUG_PEEPHOLE_INSTS - cerr << "***\t\t^^-- DeadCode Elinated!\n"; -#endif + DEBUG(cerr << "***\t\t^^-- DeadCode Elinated!\n"); } else if (PeepholeOptimize(BB, BI)) Changed = true; else @@ -443,9 +461,7 @@ static bool DoRaisePass(Function *F) { // level. // static bool doRPR(Function *F) { -#ifdef DEBUG_PEEPHOLE_INSTS - cerr << "\n\n\nStarting to work on Function '" << F->getName() << "'\n"; -#endif + DEBUG(cerr << "\n\n\nStarting to work on Function '" << F->getName()<< "'\n"); // Insert casts for all incoming pointer pointer values that are treated as // arrays... @@ -453,9 +469,7 @@ static bool doRPR(Function *F) { bool Changed = false, LocalChange; do { -#ifdef DEBUG_PEEPHOLE_INSTS - cerr << "Looping: \n" << F; -#endif + DEBUG(cerr << "Looping: \n" << F); // Iterate over the function, refining it, until it converges on a stable // state