diff options
author | Chris Lattner <sabre@nondot.org> | 2002-04-28 16:21:30 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2002-04-28 16:21:30 +0000 |
commit | 78dd56fe624c015195ba8493b8ea627d7671a565 (patch) | |
tree | a9178fdfa065ee161e54d7d091e83d52521bead2 /llvm/lib/Analysis/IntervalPartition.cpp | |
parent | 002958cdbbd8b931a43c42a78d4a4a44531700c0 (diff) | |
download | bcm5719-llvm-78dd56fe624c015195ba8493b8ea627d7671a565.tar.gz bcm5719-llvm-78dd56fe624c015195ba8493b8ea627d7671a565.zip |
Eliminate the cfg namespace, moving LoopInfo, Dominators, Interval* classes
to the global namespace
llvm-svn: 2370
Diffstat (limited to 'llvm/lib/Analysis/IntervalPartition.cpp')
-rw-r--r-- | llvm/lib/Analysis/IntervalPartition.cpp | 7 |
1 files changed, 3 insertions, 4 deletions
diff --git a/llvm/lib/Analysis/IntervalPartition.cpp b/llvm/lib/Analysis/IntervalPartition.cpp index bb0f5821081..a774c5c2b2d 100644 --- a/llvm/lib/Analysis/IntervalPartition.cpp +++ b/llvm/lib/Analysis/IntervalPartition.cpp @@ -1,6 +1,6 @@ //===- IntervalPartition.cpp - Interval Partition module code ----*- C++ -*--=// // -// This file contains the definition of the cfg::IntervalPartition class, which +// This file contains the definition of the IntervalPartition class, which // calculates and represent the interval partition of a function. // //===----------------------------------------------------------------------===// @@ -8,7 +8,6 @@ #include "llvm/Analysis/IntervalIterator.h" #include "Support/STLExtras.h" -using namespace cfg; using std::make_pair; AnalysisID IntervalPartition::ID(AnalysisID::create<IntervalPartition>()); @@ -19,7 +18,7 @@ AnalysisID IntervalPartition::ID(AnalysisID::create<IntervalPartition>()); // destroy - Reset state back to before function was analyzed void IntervalPartition::destroy() { - for_each(begin(), end(), deleter<cfg::Interval>); + for_each(begin(), end(), deleter<Interval>); IntervalMap.clear(); RootInterval = 0; } @@ -42,7 +41,7 @@ void IntervalPartition::addIntervalToPartition(Interval *I) { // run through all of the intervals and propogate successor info as // predecessor info. // -void IntervalPartition::updatePredecessors(cfg::Interval *Int) { +void IntervalPartition::updatePredecessors(Interval *Int) { BasicBlock *Header = Int->getHeaderNode(); for (Interval::succ_iterator I = Int->Successors.begin(), E = Int->Successors.end(); I != E; ++I) |