summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAndrew Lenharth <andrewl@lenharth.org>2006-10-13 17:38:22 +0000
committerAndrew Lenharth <andrewl@lenharth.org>2006-10-13 17:38:22 +0000
commit7445ea6b177abcf7da1daa4abe5cbbb014fbb932 (patch)
tree1aef3aa88eaaf328b31866080f42413b3a52e465
parent33d06bcfd41447b94cd66126b948469d41f7f2ef (diff)
downloadllvm-7445ea6b177abcf7da1daa4abe5cbbb014fbb932.tar.gz
llvm-7445ea6b177abcf7da1daa4abe5cbbb014fbb932.tar.bz2
llvm-7445ea6b177abcf7da1daa4abe5cbbb014fbb932.tar.xz
Move some warnings to debug mode.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@30933 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r--lib/Analysis/DataStructure/BottomUpClosure.cpp19
-rw-r--r--lib/Analysis/DataStructure/CompleteBottomUp.cpp11
-rw-r--r--lib/Analysis/DataStructure/Local.cpp10
-rw-r--r--lib/Analysis/DataStructure/TopDownClosure.cpp4
4 files changed, 23 insertions, 21 deletions
diff --git a/lib/Analysis/DataStructure/BottomUpClosure.cpp b/lib/Analysis/DataStructure/BottomUpClosure.cpp
index d2708b0fb1..1a69e172a6 100644
--- a/lib/Analysis/DataStructure/BottomUpClosure.cpp
+++ b/lib/Analysis/DataStructure/BottomUpClosure.cpp
@@ -171,11 +171,9 @@ bool BUDataStructures::runOnModule(Module &M) {
// Calculate the graphs for any functions that are unreachable from main...
for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
if (!I->isExternal() && !DSInfo.count(I)) {
-#ifndef NDEBUG
if (MainFunc)
- std::cerr << "*** BU: Function unreachable from main: "
- << I->getName() << "\n";
-#endif
+ DEBUG(std::cerr << "*** BU: Function unreachable from main: "
+ << I->getName() << "\n");
calculateGraphs(I, Stack, NextID, ValMap); // Calculate all graphs.
}
@@ -206,7 +204,7 @@ bool BUDataStructures::runOnModule(Module &M) {
BuildGlobalECs(*GlobalsGraph, ECGlobals);
if (!ECGlobals.empty()) {
NamedRegionTimer X("Bottom-UP EC Cleanup");
- std::cerr << "Eliminating " << ECGlobals.size() << " EC Globals!\n";
+ DEBUG(std::cerr << "Eliminating " << ECGlobals.size() << " EC Globals!\n");
for (hash_map<Function*, DSGraph*>::iterator I = DSInfo.begin(),
E = DSInfo.end(); I != E; ++I)
EliminateUsesOfECGlobals(*I->second, ECGlobals);
@@ -237,11 +235,12 @@ bool BUDataStructures::runOnModule(Module &M) {
ee = MainGraph.afc_end(); ii != ee; ++ii) {
std::vector<Function*> Funcs;
GetAllCallees(*ii, Funcs);
- std::cerr << "Lost site\n";
+ DEBUG(std::cerr << "Lost site\n");
+ DEBUG(ii->getCallSite().getInstruction()->dump());
for (std::vector<Function*>::iterator iif = Funcs.begin(), eef = Funcs.end();
iif != eef; ++iif) {
AddGlobalToNode(this, *ii, *iif);
- std::cerr << "Adding\n";
+ DEBUG(std::cerr << "Adding\n");
ActualCallees.insert(std::make_pair(ii->getCallSite().getInstruction(), *iif));
}
}
@@ -421,8 +420,8 @@ unsigned BUDataStructures::calculateGraphs(Function *F,
}
Stack.pop_back();
- std::cerr << "Calculating graph for SCC #: " << MyID << " of size: "
- << SCCSize << "\n";
+ DEBUG(std::cerr << "Calculating graph for SCC #: " << MyID << " of size: "
+ << SCCSize << "\n");
// Compute the Max SCC Size.
if (MaxSCC < SCCSize)
@@ -441,7 +440,7 @@ unsigned BUDataStructures::calculateGraphs(Function *F,
DEBUG(std::cerr << "MISSING REDO\n");
}
- std::cerr << "DONE with SCC #: " << MyID << "\n";
+ DEBUG(std::cerr << "DONE with SCC #: " << MyID << "\n");
// We never have to revisit "SCC" processed functions...
return MyID;
diff --git a/lib/Analysis/DataStructure/CompleteBottomUp.cpp b/lib/Analysis/DataStructure/CompleteBottomUp.cpp
index ea21a4f030..90c14b408f 100644
--- a/lib/Analysis/DataStructure/CompleteBottomUp.cpp
+++ b/lib/Analysis/DataStructure/CompleteBottomUp.cpp
@@ -52,16 +52,15 @@ bool CompleteBUDataStructures::runOnModule(Module &M) {
if (!MainFunc->isExternal())
calculateSCCGraphs(getOrCreateGraph(*MainFunc), Stack, NextID, ValMap);
} else {
- std::cerr << "CBU-DSA: No 'main' function found!\n";
+ DEBUG(std::cerr << "CBU-DSA: No 'main' function found!\n");
}
for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
if (!I->isExternal() && !DSInfo.count(I)) {
-#ifndef NDEBUG
- if (MainFunc)
- std::cerr << "*** CBU: Function unreachable from main: "
- << I->getName() << "\n";
-#endif
+ if (MainFunc) {
+ DEBUG(std::cerr << "*** CBU: Function unreachable from main: "
+ << I->getName() << "\n");
+ }
calculateSCCGraphs(getOrCreateGraph(*I), Stack, NextID, ValMap);
}
diff --git a/lib/Analysis/DataStructure/Local.cpp b/lib/Analysis/DataStructure/Local.cpp
index c70970ac31..dbfbea3981 100644
--- a/lib/Analysis/DataStructure/Local.cpp
+++ b/lib/Analysis/DataStructure/Local.cpp
@@ -544,6 +544,9 @@ void GraphBuilder::visitCallSite(CallSite CS) {
mergeWith(getValueDest(**(CS.arg_begin())));
return;
case Intrinsic::vaend:
+ case Intrinsic::dbg_func_start:
+ case Intrinsic::dbg_region_end:
+ case Intrinsic::dbg_stoppoint:
return; // noop
case Intrinsic::memcpy_i32:
case Intrinsic::memcpy_i64:
@@ -1028,9 +1031,10 @@ void GraphBuilder::visitCallSite(CallSite CS) {
Warn = true;
break;
}
- if (Warn)
- std::cerr << "WARNING: Call to unknown external function '"
- << F->getName() << "' will cause pessimistic results!\n";
+ if (Warn) {
+ DEBUG(std::cerr << "WARNING: Call to unknown external function '"
+ << F->getName() << "' will cause pessimistic results!\n");
+ }
}
}
diff --git a/lib/Analysis/DataStructure/TopDownClosure.cpp b/lib/Analysis/DataStructure/TopDownClosure.cpp
index 9fdaac3c34..55a37dbcd1 100644
--- a/lib/Analysis/DataStructure/TopDownClosure.cpp
+++ b/lib/Analysis/DataStructure/TopDownClosure.cpp
@@ -371,8 +371,8 @@ void TDDataStructures::InlineCallersIntoGraph(DSGraph &DSG) {
// If we already have this graph, recycle it.
if (IndCallRecI != IndCallMap.end() && IndCallRecI->first == Callees) {
- std::cerr << " [TD] *** Reuse of indcall graph for " << Callees.size()
- << " callees!\n";
+ DEBUG(std::cerr << " [TD] *** Reuse of indcall graph for " << Callees.size()
+ << " callees!\n");
IndCallGraph = IndCallRecI->second;
} else {
// Otherwise, create a new DSGraph to represent this.