6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-05-18 06:38:41 +00:00
Code Issues Projects Releases Wiki Activity

Remove use of reserved identifier

Browse Source 
& some unnecessary 'inline' keywords

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@232307 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
David Blaikie 2015-03-15 03:03:41 +00:00
parent 469f438d4d
commit baddd24f31
1 changed files with 17 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
include/llvm/ADT/DepthFirstIterator.h
View File

@ -128,58 +128,57 @@ private:
public: public:
typedef typename super::pointer pointer; typedef typename super::pointer pointer;
typedef df_iterator<GraphT, SetType, ExtStorage, GT> _Self;
// Provide static begin and end methods as our public "constructors" // Provide static begin and end methods as our public "constructors"
static inline _Self begin(const GraphT& G) { static df_iterator begin(const GraphT &G) {
return _Self(GT::getEntryNode(G)); return df_iterator(GT::getEntryNode(G));
} }
static inline _Self end(const GraphT& G) { return _Self(); } static df_iterator end(const GraphT &G) { return df_iterator(); }
// 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(const GraphT& G, SetType &S) { static df_iterator begin(const GraphT &G, SetType &S) {
return _Self(GT::getEntryNode(G), S); return df_iterator(GT::getEntryNode(G), S);
} }
static inline _Self end(const GraphT& G, SetType &S) { return _Self(S); } static df_iterator end(const GraphT &G, SetType &S) { return df_iterator(S); }
inline bool operator==(const _Self& x) const { bool operator==(const df_iterator &x) const {
return VisitStack == x.VisitStack; return VisitStack == x.VisitStack;
} }
inline bool operator!=(const _Self& x) const { return !operator==(x); } bool operator!=(const df_iterator &x) const { return !(*this == x); }
inline pointer operator*() const { pointer operator*() const { return VisitStack.back().first.getPointer(); }
return VisitStack.back().first.getPointer();
}
// This is a nonstandard operator-> that dereferences the pointer an extra // This is a nonstandard operator-> that dereferences the pointer an extra
// time... so that you can actually call methods ON the Node, because // time... so that you can actually call methods ON the Node, because
// the contained type is a pointer. This allows BBIt->getTerminator() f.e. // the contained type is a pointer. This allows BBIt->getTerminator() f.e.
// //
inline NodeType *operator->() const { return operator*(); } NodeType *operator->() const { return **this; }
inline _Self& operator++() { // Preincrement df_iterator &operator++() { // Preincrement
toNext(); toNext();
return *this; return *this;
} }
// skips all children of the current node and traverses to next node // skips all children of the current node and traverses to next node
// //
inline _Self& skipChildren() { df_iterator &skipChildren() {
VisitStack.pop_back(); VisitStack.pop_back();
if (!VisitStack.empty()) if (!VisitStack.empty())
toNext(); toNext();
return *this; return *this;
} }
inline _Self operator++(int) { // Postincrement df_iterator operator++(int) { // Postincrement
_Self tmp = *this; ++*this; return tmp; df_iterator tmp = *this;
++*this;
return tmp;
} }
// nodeVisited - return true if this iterator has already visited the // nodeVisited - return true if this iterator has already visited the
// specified node. This is public, and will probably be used to iterate over // specified node. This is public, and will probably be used to iterate over
// nodes that a depth first iteration did not find: ie unreachable nodes. // nodes that a depth first iteration did not find: ie unreachable nodes.
// //
inline bool nodeVisited(NodeType *Node) const { bool nodeVisited(NodeType *Node) const {
return this->Visited.count(Node) != 0; return this->Visited.count(Node) != 0;
} }