1 //==--- ImmutableList.h - Immutable (functional) list interface --*- C++ -*-==//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the ImmutableList class.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_ADT_IMLIST_H
15 #define LLVM_ADT_IMLIST_H
17 #include "llvm/Support/Allocator.h"
18 #include "llvm/ADT/FoldingSet.h"
19 #include "llvm/Support/DataTypes.h"
24 template <typename T> class ImmutableListFactory;
27 class ImmutableListImpl : public FoldingSetNode {
29 ImmutableListImpl* Tail;
31 ImmutableListImpl(const T& head, ImmutableListImpl* tail = 0)
32 : Head(head), Tail(tail) {}
34 friend class ImmutableListFactory<T>;
37 void operator=(const ImmutableListImpl&);
38 ImmutableListImpl(const ImmutableListImpl&);
41 const T& getHead() const { return Head; }
42 ImmutableListImpl* getTail() const { return Tail; }
44 static inline void Profile(FoldingSetNodeID& ID, const T& H,
45 ImmutableListImpl* L){
50 void Profile(FoldingSetNodeID& ID) {
51 Profile(ID, Head, Tail);
55 /// ImmutableList - This class represents an immutable (functional) list.
56 /// It is implemented as a smart pointer (wraps ImmutableListImpl), so it
57 /// it is intended to always be copied by value as if it were a pointer.
58 /// This interface matches ImmutableSet and ImmutableMap. ImmutableList
59 /// objects should almost never be created directly, and instead should
60 /// be created by ImmutableListFactory objects that manage the lifetime
61 /// of a group of lists. When the factory object is reclaimed, all lists
62 /// created by that factory are released as well.
67 typedef ImmutableListFactory<T> Factory;
70 ImmutableListImpl<T>* X;
73 // This constructor should normally only be called by ImmutableListFactory<T>.
74 // There may be cases, however, when one needs to extract the internal pointer
75 // and reconstruct a list object from that pointer.
76 ImmutableList(ImmutableListImpl<T>* x) : X(x) {}
78 ImmutableListImpl<T>* getInternalPointer() const {
83 ImmutableListImpl<T>* L;
86 iterator(ImmutableList l) : L(l.getInternalPointer()) {}
88 iterator& operator++() { L = L->getTail(); return *this; }
89 bool operator==(const iterator& I) const { return L == I.L; }
90 bool operator!=(const iterator& I) const { return L != I.L; }
91 ImmutableList operator*() const { return L; }
94 /// begin - Returns an iterator referring to the head of the list, or
95 /// an iterator denoting the end of the list if the list is empty.
96 iterator begin() const { return iterator(X); }
98 /// end - Returns an iterator denoting the end of the list. This iterator
99 /// does not refer to a valid list element.
100 iterator end() const { return iterator(); }
102 /// isEmpty - Returns true if the list is empty.
103 bool isEmpty() const { return !X; }
105 /// isEqual - Returns true if two lists are equal. Because all lists created
106 /// from the same ImmutableListFactory are uniqued, this has O(1) complexity
107 /// because it the contents of the list do not need to be compared. Note
108 /// that you should only compare two lists created from the same
109 /// ImmutableListFactory.
110 bool isEqual(const ImmutableList& L) const { return X == L.X; }
112 bool operator==(const ImmutableList& L) const { return isEqual(L); }
114 /// getHead - Returns the head of the list.
116 assert (!isEmpty() && "Cannot get the head of an empty list.");
120 /// getTail - Returns the tail of the list, which is another (possibly empty)
122 ImmutableList getTail() {
123 return X ? X->getTail() : 0;
127 template <typename T>
128 class ImmutableListFactory {
129 typedef ImmutableListImpl<T> ListTy;
130 typedef FoldingSet<ListTy> CacheTy;
135 bool ownsAllocator() const {
136 return Allocator & 0x1 ? false : true;
139 BumpPtrAllocator& getAllocator() const {
140 return *reinterpret_cast<BumpPtrAllocator*>(Allocator & ~0x1);
144 ImmutableListFactory()
145 : Allocator(reinterpret_cast<uintptr_t>(new BumpPtrAllocator())) {}
147 ImmutableListFactory(BumpPtrAllocator& Alloc)
148 : Allocator(reinterpret_cast<uintptr_t>(&Alloc) | 0x1) {}
150 ~ImmutableListFactory() {
151 if (ownsAllocator()) delete &getAllocator();
154 ImmutableList<T> Concat(const T& Head, ImmutableList<T> Tail) {
155 // Profile the new list to see if it already exists in our cache.
159 ListTy* TailImpl = Tail.getInternalPointer();
160 ListTy::Profile(ID, Head, TailImpl);
161 ListTy* L = Cache.FindNodeOrInsertPos(ID, InsertPos);
164 // The list does not exist in our cache. Create it.
165 BumpPtrAllocator& A = getAllocator();
166 L = (ListTy*) A.Allocate<ListTy>();
167 new (L) ListTy(Head, TailImpl);
169 // Insert the new list into the cache.
170 Cache.InsertNode(L, InsertPos);
176 ImmutableList<T> Add(const T& D, ImmutableList<T> L) {
180 ImmutableList<T> GetEmptyList() const {
181 return ImmutableList<T>(0);
184 ImmutableList<T> Create(const T& X) {
185 return Concat(X, GetEmptyList());
189 } // end llvm namespace