6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-09-13 08:25:27 +00:00
Code Issues Projects Releases Wiki Activity

Improve conformance with the Misha spelling benchmark suite

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@19930 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2005-01-30 00:09:23 +00:00
parent 5c3fa1ec79
commit bca81448ac
11 changed files with 31 additions and 31 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
include/llvm/ADT/ilist
View File

@@ -60,8 +60,8 @@ struct ilist_traits {
static NodeTy *createNode(const NodeTy &V) { return new NodeTy(V); }
static NodeTy *createSentinal() { return new NodeTy(); }
static void destroySentinal(NodeTy *N) { delete N; }
static NodeTy *createSentinel() { return new NodeTy(); }
static void destroySentinel(NodeTy *N) { delete N; }
void addNodeToList(NodeTy *NTy) {}
void removeNodeFromList(NodeTy *NTy) {}
@@ -302,11 +302,11 @@ public:
typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
typedef std::reverse_iterator<iterator> reverse_iterator;
iplist() : Head(Traits::createSentinal()), Tail(Head) {
iplist() : Head(Traits::createSentinel()), Tail(Head) {
setNext(Head, 0);
setPrev(Head, 0);
}
~iplist() { clear(); Traits::destroySentinal(Tail); }
~iplist() { clear(); Traits::destroySentinel(Tail); }
// Iterator creation methods.
iterator begin() { return iterator(Head); }

4
include/llvm/Analysis/DataStructure/DSNode.h
View File

@@ -369,8 +369,8 @@ struct ilist_traits<DSNode> {
static void setPrev(DSNode *N, DSNode *Prev) { N->Prev = Prev; }
static void setNext(DSNode *N, DSNode *Next) { N->Next = Next; }
static DSNode *createSentinal() { return new DSNode(0,0); }
static void destroySentinal(DSNode *N) { delete N; }
static DSNode *createSentinel() { return new DSNode(0,0); }
static void destroySentinel(DSNode *N) { delete N; }
//static DSNode *createNode(const DSNode &V) { return new DSNode(V); }

6
include/llvm/BasicBlock.h
View File

@@ -40,9 +40,9 @@ template <class Ptr, class USE_iterator> class PredIterator;
template<> struct ilist_traits<Instruction>
: public SymbolTableListTraits<Instruction, BasicBlock, Function> {
// createSentinal is used to create a node that marks the end of the list...
static Instruction *createSentinal();
static void destroySentinal(Instruction *I) { delete I; }
// createSentinel is used to create a node that marks the end of the list...
static Instruction *createSentinel();
static void destroySentinel(Instruction *I) { delete I; }
static iplist<Instruction> &getList(BasicBlock *BB);
};

12
include/llvm/Function.h
View File

@@ -31,18 +31,18 @@ class FunctionType;
template<> struct ilist_traits<BasicBlock>
: public SymbolTableListTraits<BasicBlock, Function, Function> {
// createSentinal is used to create a node that marks the end of the list...
static BasicBlock *createSentinal();
static void destroySentinal(BasicBlock *BB) { delete BB; }
// createSentinel is used to create a node that marks the end of the list...
static BasicBlock *createSentinel();
static void destroySentinel(BasicBlock *BB) { delete BB; }
static iplist<BasicBlock> &getList(Function *F);
};
template<> struct ilist_traits<Argument>
: public SymbolTableListTraits<Argument, Function, Function> {
// createSentinal is used to create a node that marks the end of the list...
static Argument *createSentinal();
static void destroySentinal(Argument *A) { delete A; }
// createSentinel is used to create a node that marks the end of the list...
static Argument *createSentinel();
static void destroySentinel(Argument *A) { delete A; }
static iplist<Argument> &getList(Function *F);
};

12
include/llvm/Module.h
View File

@@ -32,16 +32,16 @@ class SymbolTable;
template<> struct ilist_traits<Function>
: public SymbolTableListTraits<Function, Module, Module> {
// createSentinal is used to create a node that marks the end of the list.
static Function *createSentinal();
static void destroySentinal(Function *F) { delete F; }
// createSentinel is used to create a node that marks the end of the list.
static Function *createSentinel();
static void destroySentinel(Function *F) { delete F; }
static iplist<Function> &getList(Module *M);
};
template<> struct ilist_traits<GlobalVariable>
: public SymbolTableListTraits<GlobalVariable, Module, Module> {
// createSentinal is used to create a node that marks the end of the list.
static GlobalVariable *createSentinal();
static void destroySentinal(GlobalVariable *GV) { delete GV; }
// createSentinel is used to create a node that marks the end of the list.
static GlobalVariable *createSentinel();
static void destroySentinel(GlobalVariable *GV) { delete GV; }
static iplist<GlobalVariable> &getList(Module *M);
};

6
include/llvm/Use.h
View File

@@ -84,12 +84,12 @@ struct ilist_traits<Use> {
static void setPrev(Use *N, Use *Prev) { N->UseLinks.Prev = Prev; }
static void setNext(Use *N, Use *Next) { N->UseLinks.Next = Next; }
/// createSentinal - this is used to create the end marker for the use list.
/// createSentinel - this is used to create the end marker for the use list.
/// Note that we only allocate a UseLinks structure, which is just enough to
/// hold the next/prev pointers. This saves us 8 bytes of memory for every
/// Value allocated.
static Use *createSentinal() { return (Use*)new Use::NextPrevPtrs(); }
static void destroySentinal(Use *S) { delete (Use::NextPrevPtrs*)S; }
static Use *createSentinel() { return (Use*)new Use::NextPrevPtrs(); }
static void destroySentinel(Use *S) { delete (Use::NextPrevPtrs*)S; }
void addNodeToList(Use *NTy) {}
void removeNodeFromList(Use *NTy) {}