re-committing yesterday's r79938.

This time there is no additional include of llvm/Config/config.h
at all. Instead I use a hard-coded preprecessor symbol:
LLVM_COMPACTIFY_SENTINELS

(should this work on the self-hosting buildbot, then
 cleanups come next)


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@80035 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Gabor Greif 2009-08-25 21:25:22 +00:00
parent 0adcd35f78
commit 2600ca8b3f
7 changed files with 63 additions and 18 deletions

View File

@ -41,6 +41,21 @@
#include "llvm/ADT/iterator.h" #include "llvm/ADT/iterator.h"
#include <cassert> #include <cassert>
#undef LLVM_COMPACTIFY_SENTINELS
/// @brief activate small sentinel structs
/// Comment out if you want better debuggability
/// of ilist<> end() iterators.
/// See also llvm/ADT/ilist_node.h, where the
/// same change must be made.
///
#define LLVM_COMPACTIFY_SENTINELS 1
#if defined(LLVM_COMPACTIFY_SENTINELS) && LLVM_COMPACTIFY_SENTINELS
# define sentinel_tail_assert(COND)
#else
# define sentinel_tail_assert(COND) assert(COND)
#endif
namespace llvm { namespace llvm {
template<typename NodeTy, typename Traits> class iplist; template<typename NodeTy, typename Traits> class iplist;
@ -189,12 +204,12 @@ public:
// Accessors... // Accessors...
operator pointer() const { operator pointer() const {
assert(Traits::getNext(NodePtr) != 0 && "Dereferencing end()!"); sentinel_tail_assert(Traits::getNext(NodePtr) != 0 && "Dereferencing end()!");
return NodePtr; return NodePtr;
} }
reference operator*() const { reference operator*() const {
assert(Traits::getNext(NodePtr) != 0 && "Dereferencing end()!"); sentinel_tail_assert(Traits::getNext(NodePtr) != 0 && "Dereferencing end()!");
return *NodePtr; return *NodePtr;
} }
pointer operator->() const { return &operator*(); } pointer operator->() const { return &operator*(); }
@ -215,7 +230,7 @@ public:
} }
ilist_iterator &operator++() { // preincrement - Advance ilist_iterator &operator++() { // preincrement - Advance
NodePtr = Traits::getNext(NodePtr); NodePtr = Traits::getNext(NodePtr);
assert(NodePtr && "++'d off the end of an ilist!"); sentinel_tail_assert(NodePtr && "++'d off the end of an ilist!");
return *this; return *this;
} }
ilist_iterator operator--(int) { // postdecrement operators... ilist_iterator operator--(int) { // postdecrement operators...

View File

@ -15,33 +15,63 @@
#ifndef LLVM_ADT_ILIST_NODE_H #ifndef LLVM_ADT_ILIST_NODE_H
#define LLVM_ADT_ILIST_NODE_H #define LLVM_ADT_ILIST_NODE_H
#undef LLVM_COMPACTIFY_SENTINELS
/// @brief activate small sentinel structs
/// Comment out if you want better debuggability
/// of ilist<> end() iterators.
/// See also llvm/ADT/ilist.h, where the
/// same change must be made.
///
#define LLVM_COMPACTIFY_SENTINELS 1
namespace llvm { namespace llvm {
template<typename NodeTy> template<typename NodeTy>
struct ilist_nextprev_traits; struct ilist_traits;
/// ilist_half_node - Base class that provides prev services for sentinels.
///
template<typename NodeTy>
class ilist_half_node {
friend struct ilist_traits<NodeTy>;
NodeTy *Prev;
protected:
NodeTy *getPrev() { return Prev; }
const NodeTy *getPrev() const { return Prev; }
void setPrev(NodeTy *P) { Prev = P; }
ilist_half_node() : Prev(0) {}
};
template<typename NodeTy> template<typename NodeTy>
struct ilist_traits; struct ilist_nextprev_traits;
/// ilist_node - Base class that provides next/prev services for nodes /// ilist_node - Base class that provides next/prev services for nodes
/// that use ilist_nextprev_traits or ilist_default_traits. /// that use ilist_nextprev_traits or ilist_default_traits.
/// ///
template<typename NodeTy> template<typename NodeTy>
class ilist_node { class ilist_node : ilist_half_node<NodeTy> {
private:
friend struct ilist_nextprev_traits<NodeTy>; friend struct ilist_nextprev_traits<NodeTy>;
friend struct ilist_traits<NodeTy>; friend struct ilist_traits<NodeTy>;
NodeTy *Prev, *Next; NodeTy *Next;
NodeTy *getPrev() { return Prev; }
NodeTy *getNext() { return Next; } NodeTy *getNext() { return Next; }
const NodeTy *getPrev() const { return Prev; }
const NodeTy *getNext() const { return Next; } const NodeTy *getNext() const { return Next; }
void setPrev(NodeTy *N) { Prev = N; }
void setNext(NodeTy *N) { Next = N; } void setNext(NodeTy *N) { Next = N; }
protected: protected:
ilist_node() : Prev(0), Next(0) {} ilist_node() : Next(0) {}
}; };
/// When assertions are off, the Next field of sentinels
/// will not be accessed. So it is not necessary to allocate
/// space for it. The following macro selects the most
/// efficient traits class. The LLVM_COMPACTIFY_SENTINELS
/// preprocessor symbol controls this.
///
#if defined(LLVM_COMPACTIFY_SENTINELS) && LLVM_COMPACTIFY_SENTINELS
# define ILIST_NODE ilist_half_node
#else
# define ILIST_NODE ilist_node
#endif
} // End llvm namespace } // End llvm namespace
#endif #endif

View File

@ -47,7 +47,7 @@ template<> struct ilist_traits<Instruction>
Instruction *ensureHead(Instruction*) const { return createSentinel(); } Instruction *ensureHead(Instruction*) const { return createSentinel(); }
static void noteHead(Instruction*, Instruction*) {} static void noteHead(Instruction*, Instruction*) {}
private: private:
mutable ilist_node<Instruction> Sentinel; mutable ILIST_NODE<Instruction> Sentinel;
}; };
/// This represents a single basic block in LLVM. A basic block is simply a /// This represents a single basic block in LLVM. A basic block is simply a

View File

@ -26,7 +26,7 @@ class raw_ostream;
template <> template <>
struct ilist_traits<MachineInstr> : public ilist_default_traits<MachineInstr> { struct ilist_traits<MachineInstr> : public ilist_default_traits<MachineInstr> {
private: private:
mutable ilist_node<MachineInstr> Sentinel; mutable ILIST_NODE<MachineInstr> Sentinel;
// this is only set by the MachineBasicBlock owning the LiveList // this is only set by the MachineBasicBlock owning the LiveList
friend class MachineBasicBlock; friend class MachineBasicBlock;

View File

@ -38,7 +38,7 @@ class TargetRegisterClass;
template <> template <>
struct ilist_traits<MachineBasicBlock> struct ilist_traits<MachineBasicBlock>
: public ilist_default_traits<MachineBasicBlock> { : public ilist_default_traits<MachineBasicBlock> {
mutable ilist_node<MachineBasicBlock> Sentinel; mutable ILIST_NODE<MachineBasicBlock> Sentinel;
public: public:
MachineBasicBlock *createSentinel() const { MachineBasicBlock *createSentinel() const {
return static_cast<MachineBasicBlock*>(&Sentinel); return static_cast<MachineBasicBlock*>(&Sentinel);

View File

@ -37,7 +37,7 @@ class FunctionLoweringInfo;
template<> struct ilist_traits<SDNode> : public ilist_default_traits<SDNode> { template<> struct ilist_traits<SDNode> : public ilist_default_traits<SDNode> {
private: private:
mutable ilist_node<SDNode> Sentinel; mutable ILIST_NODE<SDNode> Sentinel;
public: public:
SDNode *createSentinel() const { SDNode *createSentinel() const {
return static_cast<SDNode*>(&Sentinel); return static_cast<SDNode*>(&Sentinel);

View File

@ -45,7 +45,7 @@ template<> struct ilist_traits<BasicBlock>
static ValueSymbolTable *getSymTab(Function *ItemParent); static ValueSymbolTable *getSymTab(Function *ItemParent);
private: private:
mutable ilist_node<BasicBlock> Sentinel; mutable ILIST_NODE<BasicBlock> Sentinel;
}; };
template<> struct ilist_traits<Argument> template<> struct ilist_traits<Argument>
@ -62,7 +62,7 @@ template<> struct ilist_traits<Argument>
static ValueSymbolTable *getSymTab(Function *ItemParent); static ValueSymbolTable *getSymTab(Function *ItemParent);
private: private:
mutable ilist_node<Argument> Sentinel; mutable ILIST_NODE<Argument> Sentinel;
}; };
class Function : public GlobalValue, class Function : public GlobalValue,