projects
/
oota-llvm.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
TLI: Add addVectorizableFunctionsFromVecLib.
[oota-llvm.git]
/
include
/
llvm
/
Analysis
/
Interval.h
diff --git
a/include/llvm/Analysis/Interval.h
b/include/llvm/Analysis/Interval.h
index e91e66d0d6565a525ae1879138ebe2aade0ec707..01eba3f16c014f13e51335cfcfb2c262bfbb9bfe 100644
(file)
--- a/
include/llvm/Analysis/Interval.h
+++ b/
include/llvm/Analysis/Interval.h
@@
-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.
//
//===----------------------------------------------------------------------===//
//
//
//===----------------------------------------------------------------------===//
//
@@
-17,16
+17,16
@@
//
//===----------------------------------------------------------------------===//
//
//===----------------------------------------------------------------------===//
-#ifndef LLVM_INTERVAL_H
-#define LLVM_INTERVAL_H
+#ifndef LLVM_
ANALYSIS_
INTERVAL_H
+#define LLVM_
ANALYSIS_
INTERVAL_H
#include "llvm/ADT/GraphTraits.h"
#include <vector>
#include "llvm/ADT/GraphTraits.h"
#include <vector>
-#include <iosfwd>
namespace llvm {
class BasicBlock;
namespace llvm {
class BasicBlock;
+class raw_ostream;
//===----------------------------------------------------------------------===//
//
//===----------------------------------------------------------------------===//
//
@@
-48,9
+48,6
@@
public:
Nodes.push_back(Header);
}
Nodes.push_back(Header);
}
- inline Interval(const Interval &I) // copy ctor
- : HeaderNode(I.HeaderNode), Nodes(I.Nodes), Successors(I.Successors) {}
-
inline BasicBlock *getHeaderNode() const { return HeaderNode; }
/// Nodes - The basic blocks in this interval.
inline BasicBlock *getHeaderNode() const { return HeaderNode; }
/// Nodes - The basic blocks in this interval.
@@
-98,7
+95,7
@@
public:
bool isLoop() const;
/// print - Show contents in human readable format...
bool isLoop() const;
/// print - Show contents in human readable format...
- void print(
std::
ostream &O) const;
+ void print(
raw_
ostream &O) const;
};
/// succ_begin/succ_end - define methods so that Intervals may be used
};
/// succ_begin/succ_end - define methods so that Intervals may be used
@@
-110,7
+107,7
@@
inline Interval::succ_iterator succ_begin(Interval *I) {
inline Interval::succ_iterator succ_end(Interval *I) {
return I->Successors.end();
}
inline Interval::succ_iterator succ_end(Interval *I) {
return I->Successors.end();
}
-
+
/// pred_begin/pred_end - define methods so that Intervals may be used
/// just like BasicBlocks can with the pred_* functions, and *::pred_iterator.
///
/// pred_begin/pred_end - define methods so that Intervals may be used
/// just like BasicBlocks can with the pred_* functions, and *::pred_iterator.
///
@@
-128,7
+125,7
@@
template <> struct GraphTraits<Interval*> {
static NodeType *getEntryNode(Interval *I) { return I; }
/// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
static NodeType *getEntryNode(Interval *I) { return I; }
/// nodes_iterator/begin/end - Allow iteration over all nodes in the graph
- static inline ChildIteratorType child_begin(NodeType *N) {
+ static inline ChildIteratorType child_begin(NodeType *N) {
return succ_begin(N);
}
static inline ChildIteratorType child_end(NodeType *N) {
return succ_begin(N);
}
static inline ChildIteratorType child_end(NodeType *N) {