34namespace L4Re {
namespace Util {
41 Region() noexcept : _start(~0UL), _end(~0UL) {}
42 Region(
l4_addr_t addr) noexcept : _start(addr), _end(addr) {}
44 : _start(start), _end(end) {}
45 l4_addr_t start() const noexcept {
return _start; }
46 l4_addr_t end() const noexcept {
return _end; }
47 unsigned long size() const noexcept {
return end() - start() + 1; }
48 bool invalid() const noexcept {
return _start == ~0UL && _end == ~0UL; }
49 bool operator < (Region
const &o)
const noexcept
50 {
return end() < o.start(); }
51 bool contains(Region
const &o)
const noexcept
52 {
return o.start() >= start() && o.end() <= end(); }
53 bool operator == (Region
const &o)
const noexcept
54 {
return o.start() == start() && o.end() == end(); }
58template<
typename DS,
typename OPS >
62 L4Re::Rm::Offset _offs;
70 typedef typename OPS::Map_result Map_result;
72 Region_handler() noexcept : _offs(0), _mem(), _flags() {}
73 Region_handler(Dataspace
const &mem,
l4_cap_idx_t client_cap,
74 L4Re::Rm::Offset offset = 0,
76 : _offs(offset), _mem(mem), _client_cap(client_cap), _flags(flags)
79 Dataspace
const &memory() const noexcept
89 L4Re::Rm::Offset offset() const noexcept
94 constexpr bool is_ro() const noexcept
109 Region_handler operator + (
l4_int64_t offset)
const noexcept
111 Region_handler n = *
this; n._offs += offset;
return n;
114 void free(
l4_addr_t start,
unsigned long size)
const noexcept
116 Ops::free(
this, start, size);
119 int map(
l4_addr_t addr, Region
const &r,
bool writable,
120 Map_result *result)
const
122 return Ops::map(
this, addr, r, writable, result);
128template<
typename Hdlr,
template<
typename T>
class Alloc >
151 typedef Hdlr Region_handler;
153 typedef typename Tree::Iterator Iterator;
154 typedef typename Tree::Const_iterator Const_iterator;
155 typedef typename Tree::Rev_iterator Rev_iterator;
156 typedef typename Tree::Const_rev_iterator Const_rev_iterator;
158 Iterator begin() noexcept {
return _rm.begin(); }
159 Const_iterator begin() const noexcept {
return _rm.begin(); }
160 Iterator end() noexcept {
return _rm.end(); }
161 Const_iterator end() const noexcept {
return _rm.end(); }
163 Iterator area_begin() noexcept {
return _am.begin(); }
164 Const_iterator area_begin() const noexcept {
return _am.begin(); }
165 Iterator area_end() noexcept {
return _am.end(); }
166 Const_iterator area_end() const noexcept {
return _am.end(); }
167 Node area_find(Key_type
const &c)
const noexcept {
return _am.find_node(c); }
169 l4_addr_t min_addr() const noexcept {
return _start; }
170 l4_addr_t max_addr() const noexcept {
return _end; }
175 Node find(Key_type
const &key)
const noexcept
177 Node n = _rm.find_node(key);
184 if (!n->first.contains(key))
190 Node lower_bound(Key_type
const &key)
const noexcept
192 Node n = _rm.lower_bound_node(key);
196 Node lower_bound_area(Key_type
const &key)
const noexcept
198 Node n = _am.lower_bound_node(key);
203 L4Re::Rm::Flags flags = L4Re::Rm::Flags(0),
214 c = Region(addr, addr + size - 1);
215 Node r = _am.find_node(c);
222 if (addr < min_addr() || (addr + size - 1) > max_addr())
224 addr = find_free(addr, max_addr(), size, align, flags);
228 c = Region(addr, addr + size - 1);
229 Node r = _am.find_node(c);
233 if (r->first.end() >= max_addr())
236 addr = r->first.end() + 1;
239 if (_am.insert(c, Hdlr(
typename Hdlr::Dataspace(), 0, 0, flags.region_flags())).second == 0)
245 bool detach_area(
l4_addr_t addr)
noexcept
247 if (_am.remove(addr))
253 void *attach(
void *addr,
unsigned long size, Hdlr
const &hdlr,
254 L4Re::Rm::Flags flags = L4Re::Rm::Flags(0),
265 Node r = _am.find_node(Region(beg, beg + size - 1));
269 end = r->first.end();
274 beg = find_free(beg, end, size, align, flags);
280 && _am.find_node(Region(beg, beg + size - 1)))
283 if (beg < min_addr() || beg + size -1 > end)
286 if (_rm.insert(Region(beg, beg + size -1), hdlr).second == 0)
292 int detach(
void *addr,
unsigned long sz,
unsigned flags,
293 Region *reg, Hdlr *hdlr)
noexcept
303 Hdlr
const &h = r->second;
321 else if (dr.start() <= g.start())
326 h.free(0, dr.end() + 1 - g.start());
328 unsigned long sz = dr.end() + 1 - g.start();
329 Item *cn =
const_cast<Item*
>((Item
const *)r);
330 cn->first = Region(dr.end() + 1, g.end());
331 cn->second = cn->second + sz;
332 if (hdlr) *hdlr = Hdlr();
333 if (reg) *reg = Region(g.start(), dr.end());
339 else if (dr.end() >= g.end())
344 h.free(dr.start() - g.start(), g.end() + 1 - dr.start());
346 Item *cn =
const_cast<Item*
>((Item
const*)r);
347 cn->first = Region(g.start(), dr.start() -1);
348 if (hdlr) *hdlr = Hdlr();
349 if (reg) *reg = Region(dr.start(), g.end());
356 else if (g.contains(dr))
361 h.free(dr.start() - g.start(), dr.size());
364 const_cast<Item*
>((Item
const *)r)->first = Region(g.start(), dr.start()-1);
370 err = _rm.insert(Region(dr.end() + 1, g.end()), h + (dr.end() + 1 - g.start())).second;
383 unsigned char align, L4Re::Rm::Flags flags)
const noexcept;
388template<
typename Hdlr,
template<
typename T>
class Alloc >
391 unsigned long size,
unsigned char align, L4Re::Rm::Flags flags)
const noexcept
395 if (addr == ~0UL || addr < min_addr() || addr >= end)
403 if (addr > 0 && addr - 1 > end - size)
406 Region c(addr, addr + size - 1);
407 r = _rm.find_node(c);
413 if (r->first.end() > end - size)
421 else if (r->first.end() > end - size)
@ Detached_ds
Detached data sapce.
@ Detach_again
Detached data space, more to do.
@ Split_ds
Splitted data space, and done.
@ Kept_ds
Kept data space.
@ Detach_overlap
Do an unmap of all overlapping regions.
@ Detach_keep
Do not free the detached data space, ignore the F::Detach_free.
Region Key_type
Type of the key values.
Base_type::Node Node
Return type for find.
ITEM_TYPE Item_type
Type for the items store in the set.
unsigned long l4_addr_t
Address type.
signed long long l4_int64_t
Signed 64bit value.
unsigned long l4_cap_idx_t
Capability selector type.
@ L4_INVALID_CAP
Invalid capability selector.
@ L4_ENOENT
No such entity.
#define L4_INVALID_PTR
Invalid address as pointer type.
#define L4_PAGESHIFT
Size of a page, log2-based.
l4_addr_t l4_round_size(l4_addr_t value, unsigned char bits) L4_NOTHROW
Round value up to the next alignment with bits size.
@ L4_INVALID_ADDR
Invalid address.
Common L4 ABI Data Types.
@ Reserved
Region is reserved (blocked)
@ Detach_free
Free the portion of the data space after detach.
@ Caching_mask
Mask of all Rm cache bits.
@ Search_addr
Search for a suitable address range.
@ In_area
Search only in area, or map into area.