1/*
2 * Copyright (c) 2012 ARM Limited
3 * All rights reserved
4 *
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder. You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated

--- 43 unchanged lines hidden (view full) ---

54 * address decoding. The value stored is a template type and can be
55 * e.g. a port identifier, or a pointer.
56 */
57template <typename V>
58class AddrRangeMap
59{
60 private:
61 typedef std::map<AddrRange, V> RangeMap;
62 RangeMap tree;
63
64 public:
65 typedef typename RangeMap::iterator iterator;
66 typedef typename RangeMap::const_iterator const_iterator;
67
68 const_iterator
69 find(const AddrRange &r) const
70 {
71 if (tree.empty())
72 return tree.end();
73
74 const_iterator i = tree.upper_bound(r);
75
76 if (i == tree.begin()) {
77 if (i->first.intersects(r)) {
78 return i;
79 } else {
80 return tree.end();
81 }
82 }
83
84 --i;
85
86 if (i->first.intersects(r))
87 return i;
88
89 // if we are looking at an interleaved range, also step
90 // backwards through the ranges while we are looking at ranges
91 // that are part of the same contigous chunk
92 if (i->first.interleaved()) {
93 AddrRange orig_range = i->first;
94
95 while (i != tree.begin() && i->first.mergesWith(orig_range)) {
96 --i;
97 if (i->first.intersects(r)) {
98 return i;
99 }
100 }
101
102 // we could leave the loop based on reaching the first
103 // element, so we must still check for an intersection
104 if (i->first.intersects(r))
105 return i;
106 }
107
108 return tree.end();
109 }
110
111 const_iterator
112 find(const Addr &r) const
113 {
114 return find(RangeSize(r, 1));
115 }
116
117 bool
118 intersect(const AddrRange &r) const
119 {
120 return find(r) != tree.end();
121 }
122
123 const_iterator
124 insert(const AddrRange &r, const V& d)
125 {
126 if (intersect(r))
127 return tree.end();
128
129 return tree.insert(std::make_pair(r, d)).first;
130 }
131
132 void
133 erase(iterator p)
134 {

--- 42 unchanged lines hidden (view full) ---

177 return tree.size();
178 }
179
180 bool
181 empty() const
182 {
183 return tree.empty();
184 }
185};
186
187#endif //__BASE_ADDR_RANGE_MAP_HH__