Home
last modified time | relevance | path

Searched refs:_tree (Results 1 – 6 of 6) sorted by relevance

/l4re-core-master/sigma0/server/src/
A Dmem_man.cc26 if (n == _tree.end()) in find()
48 int err = _tree.remove(*n); in add()
82 while (_tree.insert(r).second == -_tree.E_nomem) in add()
112 int err = _tree.remove(*n); in add_free()
144 int err = _tree.remove(*r2); in alloc_from()
249 auto r2 = _tree.find(r); in reserve()
252 if (r2 == _tree.end()) in reserve()
318 _tree.remove(*r2); in reserve()
344 for (Tree::Rev_iterator i = _tree.rbegin(); i != _tree.rend(); ++i) in morecore()
384 for (Tree::Iterator i = _tree.begin(); i != _tree.end(); ++i) in alloc_first()
[all …]
A Dmem_man.h34 Tree _tree;
/l4re-core-master/moe/server/src/
A Dname_space.h147 Tree _tree; variable
150 { return _tree.find_node(name); } in find()
153 { return _tree.remove(name); } in remove()
156 { return _tree.insert(e).second; } in insert()
170 Const_iterator begin() const { return _tree.begin(); } in begin()
171 Const_iterator end() const { return _tree.end(); } in end()
A Dname_space.cc94 _tree.remove_all([](Entry *e) { delete e; }); in ~Name_space()
/l4re-core-master/cxx/lib/tl/include/
A Davl_set215 Tree _tree;
247 : _tree(), _alloc(alloc)
252 _tree.remove_all([this](_Node *n)
298 _Node *n = _tree.remove(item);
328 { return Node(_tree.find_node(item)); }
339 { return Node(_tree.lower_bound_node(key)); }
359 Iterator begin() { return _tree.begin(); }
364 Iterator end() { return _tree.end(); }
389 { return _tree.find(item); }
399 : _tree(), _alloc(o._alloc)
[all …]
/l4re-core-master/l4re/util/include/
A Dname_space_svr190 Tree _tree;
200 Const_iterator begin() const { return _tree.begin(); }
201 Const_iterator end() const { return _tree.end(); }
209 Entry *find(Name const &name) const { return _tree.find_node(name); }
210 Entry *remove(Name const &name) { return _tree.remove(name); }
212 bool insert(Entry *e) { return _tree.insert(e).second; }

Completed in 6 milliseconds