Home
last modified time | relevance | path

Searched refs:find_node (Results 1 – 8 of 8) sorted by relevance

/l4re-core-master/l4re/util/include/
A Dregion_mapping167 Node area_find(Key_type const &c) const noexcept { return _am.find_node(c); }
177 Node n = _rm.find_node(key);
215 Node r = _am.find_node(c);
229 Node r = _am.find_node(c);
265 Node r = _am.find_node(Region(beg, beg + size - 1));
280 && _am.find_node(Region(beg, beg + size - 1)))
407 r = _rm.find_node(c);
411 if (!(flags & L4Re::Rm::F::In_area) && (r = _am.find_node(c)))
A Dname_space_svr209 Entry *find(Name const &name) const { return _tree.find_node(name); }
/l4re-core-master/sigma0/server/src/
A Dmem_man.cc44 Tree::Node n = _tree.find_node(rs); in add()
64 Tree::Node n = _tree.find_node(rs); in add()
102 Tree::Node n = _tree.find_node(r); in add_free()
/l4re-core-master/moe/server/src/
A Ddma_space.cc53 auto *m = _map.find_node(dma_addr); in unmap()
105 auto n = _map.find_node(Region(a, a + size - 1)); in find_free()
250 auto *m = _map.find_node(dma_addr); in unmap()
A Dname_space.h150 { return _tree.find_node(name); } in find()
/l4re-core-master/cxx/lib/tl/include/bits/
A Dbst.h231 Node *find_node(Key_param_type key) const;
276 Bst<Node, Get_key, Compare>::find_node(Key_param_type key) const in find_node() function
/l4re-core-master/cxx/lib/tl/include/
A Davl_map119 { return this->find_node(key)->second; }
132 Node n = this->find_node(key);
A Davl_set327 Node find_node(Key_type const &item) const
328 { return Node(_tree.find_node(item)); }

Completed in 11 milliseconds