projects
/
oota-llvm.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Add llvm::triple constructor from arch, vendor, os strings, and recognize
[oota-llvm.git]
/
include
/
llvm
/
ADT
/
DepthFirstIterator.h
diff --git
a/include/llvm/ADT/DepthFirstIterator.h
b/include/llvm/ADT/DepthFirstIterator.h
index 0cdd79b3c96dcb4e1b9102d4676ef33886d5223e..517768f402df9caf03f440906fd06b8c5af258ee 100644
(file)
--- a/
include/llvm/ADT/DepthFirstIterator.h
+++ b/
include/llvm/ADT/DepthFirstIterator.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.
//
//===----------------------------------------------------------------------===//
//
//
//===----------------------------------------------------------------------===//
//
@@
-34,10
+34,10
@@
#define LLVM_ADT_DEPTHFIRSTITERATOR_H
#include "llvm/ADT/GraphTraits.h"
#define LLVM_ADT_DEPTHFIRSTITERATOR_H
#include "llvm/ADT/GraphTraits.h"
-#include "llvm/ADT/iterator"
+#include "llvm/ADT/iterator
.h
"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/SmallPtrSet.h"
-#include <vector>
#include <set>
#include <set>
+#include <vector>
namespace llvm {
namespace llvm {
@@
-96,16
+96,16
@@
public:
typedef df_iterator<GraphT, SetType, ExtStorage, GT> _Self;
// Provide static begin and end methods as our public "constructors"
typedef df_iterator<GraphT, SetType, ExtStorage, GT> _Self;
// Provide static begin and end methods as our public "constructors"
- static inline _Self begin(
GraphT
G) {
+ static inline _Self begin(
const GraphT&
G) {
return _Self(GT::getEntryNode(G));
}
return _Self(GT::getEntryNode(G));
}
- static inline _Self end(
GraphT
G) { return _Self(); }
+ static inline _Self end(
const GraphT&
G) { return _Self(); }
// Static begin and end methods as our public ctors for external iterators
// Static begin and end methods as our public ctors for external iterators
- static inline _Self begin(
GraphT
G, SetType &S) {
+ static inline _Self begin(
const GraphT&
G, SetType &S) {
return _Self(GT::getEntryNode(G), S);
}
return _Self(GT::getEntryNode(G), S);
}
- static inline _Self end(
GraphT
G, SetType &S) { return _Self(S); }
+ static inline _Self end(
const GraphT&
G, SetType &S) { return _Self(S); }
inline bool operator==(const _Self& x) const {
return VisitStack.size() == x.VisitStack.size() &&
inline bool operator==(const _Self& x) const {
return VisitStack.size() == x.VisitStack.size() &&
@@
-162,12
+162,12
@@
public:
// Provide global constructors that automatically figure out correct types...
//
template <class T>
// Provide global constructors that automatically figure out correct types...
//
template <class T>
-df_iterator<T> df_begin(
T
G) {
+df_iterator<T> df_begin(
const T&
G) {
return df_iterator<T>::begin(G);
}
template <class T>
return df_iterator<T>::begin(G);
}
template <class T>
-df_iterator<T> df_end(
T
G) {
+df_iterator<T> df_end(
const T&
G) {
return df_iterator<T>::end(G);
}
return df_iterator<T>::end(G);
}
@@
-179,12
+179,12
@@
struct df_ext_iterator : public df_iterator<T, SetTy, true> {
};
template <class T, class SetTy>
};
template <class T, class SetTy>
-df_ext_iterator<T, SetTy> df_ext_begin(
T
G, SetTy &S) {
+df_ext_iterator<T, SetTy> df_ext_begin(
const T&
G, SetTy &S) {
return df_ext_iterator<T, SetTy>::begin(G, S);
}
template <class T, class SetTy>
return df_ext_iterator<T, SetTy>::begin(G, S);
}
template <class T, class SetTy>
-df_ext_iterator<T, SetTy> df_ext_end(
T
G, SetTy &S) {
+df_ext_iterator<T, SetTy> df_ext_end(
const T&
G, SetTy &S) {
return df_ext_iterator<T, SetTy>::end(G, S);
}
return df_ext_iterator<T, SetTy>::end(G, S);
}
@@
-199,13
+199,13
@@
struct idf_iterator : public df_iterator<Inverse<T>, SetTy, External> {
};
template <class T>
};
template <class T>
-idf_iterator<T> idf_begin(
T
G) {
- return idf_iterator<T>::begin(
G
);
+idf_iterator<T> idf_begin(
const T&
G) {
+ return idf_iterator<T>::begin(
Inverse<T>(G)
);
}
template <class T>
}
template <class T>
-idf_iterator<T> idf_end(
T
G){
- return idf_iterator<T>::end(
G
);
+idf_iterator<T> idf_end(
const T&
G){
+ return idf_iterator<T>::end(
Inverse<T>(G)
);
}
// Provide global definitions of external inverse depth first iterators...
}
// Provide global definitions of external inverse depth first iterators...
@@
-218,13
+218,13
@@
struct idf_ext_iterator : public idf_iterator<T, SetTy, true> {
};
template <class T, class SetTy>
};
template <class T, class SetTy>
-idf_ext_iterator<T, SetTy> idf_ext_begin(
T
G, SetTy &S) {
- return idf_ext_iterator<T, SetTy>::begin(
G
, S);
+idf_ext_iterator<T, SetTy> idf_ext_begin(
const T&
G, SetTy &S) {
+ return idf_ext_iterator<T, SetTy>::begin(
Inverse<T>(G)
, S);
}
template <class T, class SetTy>
}
template <class T, class SetTy>
-idf_ext_iterator<T, SetTy> idf_ext_end(
T
G, SetTy &S) {
- return idf_ext_iterator<T, SetTy>::end(
G
, S);
+idf_ext_iterator<T, SetTy> idf_ext_end(
const T&
G, SetTy &S) {
+ return idf_ext_iterator<T, SetTy>::end(
Inverse<T>(G)
, S);
}
} // End llvm namespace
}
} // End llvm namespace