1 //===--- ImmutableIntervalMap.h - Immutable (functional) map ---*- 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 ImmutableIntervalMap class.
12 //===----------------------------------------------------------------------===//
13 #include "llvm/ADT/ImmutableMap.h"
23 Interval(uint64_t S, uint64_t E) : Start(S), End(E) {}
25 uint64_t getStart() const { return Start; }
26 uint64_t getEnd() const { return End; }
30 struct ImutIntervalInfo {
31 typedef const std::pair<Interval, T> value_type;
32 typedef const value_type &value_type_ref;
33 typedef const Interval key_type;
34 typedef const Interval &key_type_ref;
35 typedef const T data_type;
36 typedef const T &data_type_ref;
38 static key_type_ref KeyOfValue(value_type_ref V) {
42 static data_type_ref DataOfValue(value_type_ref V) {
46 static bool isEqual(key_type_ref L, key_type_ref R) {
47 return L.getStart() == R.getStart() && L.getEnd() == R.getEnd();
50 static bool isDataEqual(data_type_ref L, data_type_ref R) {
51 return ImutContainerInfo<T>::isEqual(L,R);
54 static bool isLess(key_type_ref L, key_type_ref R) {
55 // Assume L and R does not overlap.
56 if (L.getStart() < R.getStart()) {
57 assert(L.getEnd() < R.getStart());
59 } else if (L.getStart() == R.getStart()) {
60 assert(L.getEnd() == R.getEnd());
63 assert(L.getStart() > R.getEnd());
68 static bool isContainedIn(key_type_ref K, key_type_ref L) {
69 if (K.getStart() >= L.getStart() && K.getEnd() <= L.getEnd())
75 static void Profile(FoldingSetNodeID &ID, value_type_ref V) {
76 ID.AddInteger(V.first.getStart());
77 ID.AddInteger(V.first.getEnd());
78 ImutProfileInfo<T>::Profile(ID, V.second);
82 template <typename ImutInfo> class ImutIntervalAVLFactory;
84 template <typename ImutInfo>
85 class ImutIntervalAVLFactory : public ImutAVLFactory<ImutInfo> {
86 typedef ImutAVLTree<ImutInfo> TreeTy;
87 typedef typename ImutInfo::value_type value_type;
88 typedef typename ImutInfo::value_type_ref value_type_ref;
89 typedef typename ImutInfo::key_type key_type;
90 typedef typename ImutInfo::key_type_ref key_type_ref;
91 typedef typename ImutInfo::data_type data_type;
92 typedef typename ImutInfo::data_type_ref data_type_ref;
95 TreeTy *Add(TreeTy *T, value_type_ref V) {
96 T = Add_internal(V,T);
101 TreeTy *Find(TreeTy *T, key_type_ref K) {
105 key_type_ref CurrentKey = ImutInfo::KeyOfValue(Value(T));
107 if (ImutInfo::isContainedIn(K, CurrentKey))
109 else if (ImutInfo::isLess(K, CurrentKey))
110 return Find(Left(T), K);
112 return Find(Right(T), K);
116 TreeTy *Add_internal(value_type_ref V, TreeTy *T) {
117 key_type_ref K = ImutInfo::KeyOfValue(V);
118 T = RemoveAllOverlaps(T, K);
120 return CreateNode(NULL, V, NULL);
122 assert(!T->isMutable());
124 key_type_ref KCurrent = ImutInfo::KeyOfValue(Value(T));
126 if (ImutInfo::isLess(K, KCurrent))
127 return Balance(Add_internal(V, Left(T)), Value(T), Right(T));
129 return Balance(Left(T), Value(T), Add_internal(V, Right(T)));
132 // Remove all overlaps from T.
133 TreeTy *RemoveAllOverlaps(TreeTy *T, key_type_ref K) {
137 T = RemoveOverlap(T, K, Changed);
144 // Remove one overlap from T.
145 TreeTy *RemoveOverlap(TreeTy *T, key_type_ref K, bool &Changed) {
148 Interval CurrentK = ImutInfo::KeyOfValue(Value(T));
150 // If current key does not overlap the inserted key.
151 if (CurrentK.getStart() > K.getEnd())
152 return Balance(RemoveOverlap(Left(T), K, Changed), Value(T), Right(T));
153 else if (CurrentK.getEnd() < K.getStart())
154 return Balance(Left(T), Value(T), RemoveOverlap(Right(T), K, Changed));
156 // Current key overlaps with the inserted key.
157 // Remove the current key.
159 data_type_ref OldData = ImutInfo::DataOfValue(Value(T));
160 T = Remove_internal(CurrentK, T);
161 // Add back the unoverlapped part of the current key.
162 if (CurrentK.getStart() < K.getStart()) {
163 if (CurrentK.getEnd() <= K.getEnd()) {
164 Interval NewK(CurrentK.getStart(), K.getStart()-1);
165 return Add_internal(std::make_pair(NewK, OldData), T);
167 Interval NewK1(CurrentK.getStart(), K.getStart()-1);
168 T = Add_internal(std::make_pair(NewK1, OldData), T);
170 Interval NewK2(K.getEnd()+1, CurrentK.getEnd());
171 return Add_internal(std::make_pair(NewK2, OldData), T);
174 if (CurrentK.getEnd() > K.getEnd()) {
175 Interval NewK(K.getEnd()+1, CurrentK.getEnd());
176 return Add_internal(std::make_pair(NewK, OldData), T);
183 /// ImmutableIntervalMap maps an interval [start, end] to a value. The intervals
184 /// in the map are guaranteed to be disjoint.
185 template <typename ValT>
186 class ImmutableIntervalMap
187 : public ImmutableMap<Interval, ValT, ImutIntervalInfo<ValT> > {
189 typedef typename ImutIntervalInfo<ValT>::value_type value_type;
190 typedef typename ImutIntervalInfo<ValT>::value_type_ref value_type_ref;
191 typedef typename ImutIntervalInfo<ValT>::key_type key_type;
192 typedef typename ImutIntervalInfo<ValT>::key_type_ref key_type_ref;
193 typedef typename ImutIntervalInfo<ValT>::data_type data_type;
194 typedef typename ImutIntervalInfo<ValT>::data_type_ref data_type_ref;
195 typedef ImutAVLTree<ImutIntervalInfo<ValT> > TreeTy;
198 explicit ImmutableIntervalMap(TreeTy *R)
199 : ImmutableMap<Interval, ValT, ImutIntervalInfo<ValT> >(R) {}
202 ImutIntervalAVLFactory<ImutIntervalInfo<ValT> > F;
205 ImmutableIntervalMap GetEmptyMap() {
206 return ImmutableIntervalMap(F.GetEmptyTree());
209 ImmutableIntervalMap Add(ImmutableIntervalMap Old,
210 key_type_ref K, data_type_ref D) {
211 TreeTy *T = F.Add(Old.Root, std::make_pair<key_type, data_type>(K, D));
212 return ImmutableIntervalMap(F.GetCanonicalTree(T));
215 ImmutableIntervalMap Remove(ImmutableIntervalMap Old, key_type_ref K) {
216 TreeTy *T = F.Remove(Old.Root, K);
217 return ImmutableIntervalMap(F.GetCanonicalTree(T));
220 data_type *Lookup(ImmutableIntervalMap M, key_type_ref K) {
221 TreeTy *T = F.Find(M.getRoot(), K);
223 return &T->getValue().second;
230 // For ImmutableIntervalMap, the lookup operation has to be done by the
232 data_type* lookup(key_type_ref K) const;
235 } // end namespace llvm