From: Chandler Carruth Date: Sat, 27 Jul 2013 10:17:49 +0000 (+0000) Subject: Don't use all the #ifdefs to hide the stats counters and instead rely on X-Git-Url: http://review.tizen.org/git/?a=commitdiff_plain;h=8e3c4dc50e652c55dcaa49b5bc10722efcd815ff;p=platform%2Fupstream%2Fllvm.git Don't use all the #ifdefs to hide the stats counters and instead rely on their being optimized out in debug mode. Realistically, this just isn't going to be the slow part anyways. This also fixes unused variable warnings that are breaking LLD build bots. =/ I didn't see these at first, and kept losing track of the fact that they were broken. llvm-svn: 187297 --- diff --git a/llvm/lib/Transforms/Scalar/SROA.cpp b/llvm/lib/Transforms/Scalar/SROA.cpp index 9ec39d2..5afd830 100644 --- a/llvm/lib/Transforms/Scalar/SROA.cpp +++ b/llvm/lib/Transforms/Scalar/SROA.cpp @@ -3051,10 +3051,7 @@ bool SROA::rewritePartition(AllocaInst &AI, AllocaSlices &S, unsigned PPWOldSize = PostPromotionWorklist.size(); unsigned SPOldSize = SpeculatablePHIs.size(); unsigned SSOldSize = SpeculatableSelects.size(); - -#if !defined(NDEBUG) || defined(LLVM_ENABLE_STATS) unsigned NumUses = 0; -#endif AllocaSliceRewriter Rewriter(*DL, S, *this, AI, *NewAI, BeginOffset, EndOffset, IsVectorPromotable, @@ -3066,24 +3063,18 @@ bool SROA::rewritePartition(AllocaInst &AI, AllocaSlices &S, DEBUG(dbgs() << " rewriting split "); DEBUG(S.printSlice(dbgs(), *SUI, "")); Promotable &= Rewriter.visit(*SUI); -#if !defined(NDEBUG) || defined(LLVM_ENABLE_STATS) ++NumUses; -#endif } for (AllocaSlices::iterator I = B; I != E; ++I) { DEBUG(dbgs() << " rewriting "); DEBUG(S.printSlice(dbgs(), I, "")); Promotable &= Rewriter.visit(I); -#if !defined(NDEBUG) || defined(LLVM_ENABLE_STATS) ++NumUses; -#endif } -#if !defined(NDEBUG) || defined(LLVM_ENABLE_STATS) NumAllocaPartitionUses += NumUses; MaxUsesPerAllocaPartition = std::max(NumUses, MaxUsesPerAllocaPartition); -#endif if (Promotable && !Rewriter.isUsedByRewrittenSpeculatableInstructions()) { DEBUG(dbgs() << " and queuing for promotion\n"); @@ -3160,10 +3151,7 @@ bool SROA::splitAlloca(AllocaInst &AI, AllocaSlices &S) { if (S.begin() == S.end()) return false; -#if !defined(NDEBUG) || defined(LLVM_ENABLE_STATS) unsigned NumPartitions = 0; -#endif - bool Changed = false; SmallVector SplitUses; uint64_t MaxSplitUseEndOffset = 0; @@ -3210,9 +3198,7 @@ bool SROA::splitAlloca(AllocaInst &AI, AllocaSlices &S) { // Rewrite a sequence of overlapping slices. Changed |= rewritePartition(AI, S, SI, SJ, BeginOffset, MaxEndOffset, SplitUses); -#if !defined(NDEBUG) || defined(LLVM_ENABLE_STATS) ++NumPartitions; -#endif removeFinishedSplitUses(SplitUses, MaxSplitUseEndOffset, MaxEndOffset); } @@ -3252,9 +3238,7 @@ bool SROA::splitAlloca(AllocaInst &AI, AllocaSlices &S) { Changed |= rewritePartition(AI, S, SJ, SJ, MaxEndOffset, PostSplitEndOffset, SplitUses); -#if !defined(NDEBUG) || defined(LLVM_ENABLE_STATS) ++NumPartitions; -#endif if (SJ == SE) break; // Skip the rest, we don't need to do any cleanup. @@ -3266,11 +3250,9 @@ bool SROA::splitAlloca(AllocaInst &AI, AllocaSlices &S) { BeginOffset = SJ->beginOffset(); } -#if !defined(NDEBUG) || defined(LLVM_ENABLE_STATS) NumAllocaPartitions += NumPartitions; MaxPartitionsPerAlloca = std::max(NumPartitions, MaxPartitionsPerAlloca); -#endif return Changed; }