maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Fix -Asserts warnings. 

llvm-svn: 79849
This commit is contained in:
Daniel Dunbar 2009-08-23 10:29:55 +00:00
parent c9aa480832
commit 5e0a58bef4
2 changed files with 5 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
llvm/lib/Analysis/IPA/Andersens.cpp
View File

@ -85,7 +85,9 @@
#define FULL_UNIVERSAL 0
using namespace llvm;
#ifndef NDEBUG
STATISTIC(NumIters , "Number of iterations to reach convergence");
#endif
STATISTIC(NumConstraints, "Number of constraints");
STATISTIC(NumNodes , "Number of nodes");
STATISTIC(NumUnified , "Number of variables unified");

3
llvm/lib/Transforms/Utils/SimplifyCFG.cpp
View File

@ -614,6 +614,7 @@ static bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI,
assert(ThisCases.size() == 1 && "Branch can only have one case!");
// Insert the new branch.
Instruction *NI = BranchInst::Create(ThisDef, TI);
(void) NI;
// Remove PHI node entries for the dead edge.
ThisCases[0].second->removePredecessor(TI->getParent());
@ -681,6 +682,7 @@ static bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI,
// Insert the new branch.
Instruction *NI = BranchInst::Create(TheRealDest, TI);
(void) NI;
DEBUG(errs() << "Threading pred instr: " << *Pred->getTerminator()
<< "Through successor TI: " << *TI << "Leaving: " << *NI << "\n");
@ -1450,6 +1452,7 @@ static bool SimplifyCondBranchToTwoReturns(BranchInst *BI) {
Value *RI = !TrueValue ?
ReturnInst::Create(BI->getContext(), BI) :
ReturnInst::Create(BI->getContext(), TrueValue, BI);
(void) RI;
DEBUG(errs() << "\nCHANGING BRANCH TO TWO RETURNS INTO SELECT:"
<< "\n " << *BI << "NewRet = " << *RI