projects
/
oota-llvm.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
PR7959: Handle negative scales in GEPs correctly in BasicAA for non-64-bit
[oota-llvm.git]
/
lib
/
Analysis
/
IntervalPartition.cpp
diff --git
a/lib/Analysis/IntervalPartition.cpp
b/lib/Analysis/IntervalPartition.cpp
index 2385a7d2470436991ae0073bef0e00f10f1c62a5..1c9e14884316b14a5622054a11913726801e2660 100644
(file)
--- a/
lib/Analysis/IntervalPartition.cpp
+++ b/
lib/Analysis/IntervalPartition.cpp
@@
-2,8
+2,8
@@
//
// The LLVM Compiler Infrastructure
//
//
// The LLVM Compiler Infrastructure
//
-// This file
was developed by the LLVM research group and is distributed under
-//
the University of Illinois Open Source
License. See LICENSE.TXT for details.
+// This file
is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
//
//===----------------------------------------------------------------------===//
//
@@
-15,22
+15,24
@@
#include "llvm/Analysis/IntervalIterator.h"
using namespace llvm;
#include "llvm/Analysis/IntervalIterator.h"
using namespace llvm;
-static RegisterPass<IntervalPartition>
-X("intervals", "Interval Partition Construction", true);
+char IntervalPartition::ID = 0;
+INITIALIZE_PASS(IntervalPartition, "intervals",
+ "Interval Partition Construction", true, true);
//===----------------------------------------------------------------------===//
// IntervalPartition Implementation
//===----------------------------------------------------------------------===//
//===----------------------------------------------------------------------===//
// IntervalPartition Implementation
//===----------------------------------------------------------------------===//
-//
destro
y - Reset state back to before function was analyzed
-void IntervalPartition::
destro
y() {
+//
releaseMemor
y - Reset state back to before function was analyzed
+void IntervalPartition::
releaseMemor
y() {
for (unsigned i = 0, e = Intervals.size(); i != e; ++i)
delete Intervals[i];
IntervalMap.clear();
for (unsigned i = 0, e = Intervals.size(); i != e; ++i)
delete Intervals[i];
IntervalMap.clear();
+ Intervals.clear();
RootInterval = 0;
}
RootInterval = 0;
}
-void IntervalPartition::print(
std::
ostream &O, const Module*) const {
+void IntervalPartition::print(
raw_
ostream &O, const Module*) const {
for(unsigned i = 0, e = Intervals.size(); i != e; ++i)
Intervals[i]->print(O);
}
for(unsigned i = 0, e = Intervals.size(); i != e; ++i)
Intervals[i]->print(O);
}
@@
-88,9
+90,9
@@
bool IntervalPartition::runOnFunction(Function &F) {
// existing interval graph. This takes an additional boolean parameter to
// distinguish it from a copy constructor. Always pass in false for now.
//
// existing interval graph. This takes an additional boolean parameter to
// distinguish it from a copy constructor. Always pass in false for now.
//
-IntervalPartition::IntervalPartition(IntervalPartition &IP, bool)
{
- Interval *FunctionStart = IP.getRootInterval();
- assert(
FunctionStart
&& "Cannot operate on empty IntervalPartitions!");
+IntervalPartition::IntervalPartition(IntervalPartition &IP, bool)
+ : FunctionPass(ID) {
+ assert(
IP.getRootInterval()
&& "Cannot operate on empty IntervalPartitions!");
// Pass false to intervals_begin because we take ownership of it's memory
interval_part_interval_iterator I = intervals_begin(IP, false);
// Pass false to intervals_begin because we take ownership of it's memory
interval_part_interval_iterator I = intervals_begin(IP, false);