HelenOS sources
iterator 90 common/include/adt/list.h #define list_foreach(list, member, itype, iterator) \
iterator 91 common/include/adt/list.h for (itype *iterator = NULL; iterator == NULL; iterator = (itype *) sizeof(itype)) \
iterator 93 common/include/adt/list.h iterator = list_get_instance(_link, itype, member), \
iterator 96 common/include/adt/list.h #define list_foreach_rev(list, member, itype, iterator) \
iterator 97 common/include/adt/list.h for (itype *iterator = NULL; iterator == NULL; iterator = (itype *) sizeof(itype)) \
iterator 99 common/include/adt/list.h iterator = list_get_instance(_link, itype, member), \
iterator 127 common/include/adt/list.h #define list_foreach_safe(list, iterator, next_iter) \
iterator 128 common/include/adt/list.h for (link_t *iterator = (list).head.next, \
iterator 129 common/include/adt/list.h *next_iter = iterator->next; \
iterator 130 common/include/adt/list.h iterator != &(list).head; \
iterator 131 common/include/adt/list.h iterator = next_iter, next_iter = iterator->next)
iterator 90 kernel/generic/common/include/adt/list.h #define list_foreach(list, member, itype, iterator) \
iterator 91 kernel/generic/common/include/adt/list.h for (itype *iterator = NULL; iterator == NULL; iterator = (itype *) sizeof(itype)) \
iterator 93 kernel/generic/common/include/adt/list.h iterator = list_get_instance(_link, itype, member), \
iterator 96 kernel/generic/common/include/adt/list.h #define list_foreach_rev(list, member, itype, iterator) \
iterator 97 kernel/generic/common/include/adt/list.h for (itype *iterator = NULL; iterator == NULL; iterator = (itype *) sizeof(itype)) \
iterator 99 kernel/generic/common/include/adt/list.h iterator = list_get_instance(_link, itype, member), \
iterator 127 kernel/generic/common/include/adt/list.h #define list_foreach_safe(list, iterator, next_iter) \
iterator 128 kernel/generic/common/include/adt/list.h for (link_t *iterator = (list).head.next, \
iterator 129 kernel/generic/common/include/adt/list.h *next_iter = iterator->next; \
iterator 130 kernel/generic/common/include/adt/list.h iterator != &(list).head; \
iterator 131 kernel/generic/common/include/adt/list.h iterator = next_iter, next_iter = iterator->next)
iterator 90 uspace/lib/c/common/include/adt/list.h #define list_foreach(list, member, itype, iterator) \
iterator 91 uspace/lib/c/common/include/adt/list.h for (itype *iterator = NULL; iterator == NULL; iterator = (itype *) sizeof(itype)) \
iterator 93 uspace/lib/c/common/include/adt/list.h iterator = list_get_instance(_link, itype, member), \
iterator 96 uspace/lib/c/common/include/adt/list.h #define list_foreach_rev(list, member, itype, iterator) \
iterator 97 uspace/lib/c/common/include/adt/list.h for (itype *iterator = NULL; iterator == NULL; iterator = (itype *) sizeof(itype)) \
iterator 99 uspace/lib/c/common/include/adt/list.h iterator = list_get_instance(_link, itype, member), \
iterator 127 uspace/lib/c/common/include/adt/list.h #define list_foreach_safe(list, iterator, next_iter) \
iterator 128 uspace/lib/c/common/include/adt/list.h for (link_t *iterator = (list).head.next, \
iterator 129 uspace/lib/c/common/include/adt/list.h *next_iter = iterator->next; \
iterator 130 uspace/lib/c/common/include/adt/list.h iterator != &(list).head; \
iterator 131 uspace/lib/c/common/include/adt/list.h iterator = next_iter, next_iter = iterator->next)
iterator 53 uspace/lib/cpp/include/__bits/adt/array.hpp using reverse_iterator = std::reverse_iterator<iterator>;
iterator 76 uspace/lib/cpp/include/__bits/adt/array.hpp iterator begin() noexcept
iterator 81 uspace/lib/cpp/include/__bits/adt/array.hpp iterator end() noexcept
iterator 335 uspace/lib/cpp/include/__bits/adt/deque.hpp using reverse_iterator = std::reverse_iterator<iterator>;
iterator 503 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator begin() noexcept
iterator 513 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator end() noexcept
iterator 706 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator emplace(const_iterator position, Args&&... args)
iterator 718 uspace/lib/cpp/include/__bits/adt/deque.hpp return iterator{*this, idx};
iterator 757 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator insert(const_iterator position, const value_type& value)
iterator 772 uspace/lib/cpp/include/__bits/adt/deque.hpp return iterator{*this, idx};
iterator 775 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator insert(const_iterator position, value_type&& value)
iterator 783 uspace/lib/cpp/include/__bits/adt/deque.hpp return iterator{*this, idx};
iterator 786 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator insert(const_iterator position, size_type n, const value_type& value)
iterator 796 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator insert(const_iterator position, InputIterator first, InputIterator last)
iterator 805 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator it{*this, idx - 1};
iterator 813 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator it{*this, idx};
iterator 820 uspace/lib/cpp/include/__bits/adt/deque.hpp return iterator{*this, idx};
iterator 823 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator insert(const_iterator position, initializer_list<value_type> init)
iterator 873 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator erase(const_iterator position)
iterator 877 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator{*this, idx + 1},
iterator 879 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator{*this, idx}
iterator 890 uspace/lib/cpp/include/__bits/adt/deque.hpp return iterator{*this, idx};
iterator 893 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator erase(const_iterator first, const_iterator last)
iterator 903 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator{*this, last_idx},
iterator 905 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator{*this, first_idx}
iterator 911 uspace/lib/cpp/include/__bits/adt/deque.hpp return iterator{*this, first_idx};
iterator 1048 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator it{*this, idx};
iterator 1058 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator{*this, count},
iterator 1059 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator{*this, idx + count - 1},
iterator 1060 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator{*this, 0}
iterator 153 uspace/lib/cpp/include/__bits/adt/hash_table.hpp iterator begin() noexcept
iterator 156 uspace/lib/cpp/include/__bits/adt/hash_table.hpp return iterator{
iterator 167 uspace/lib/cpp/include/__bits/adt/hash_table.hpp iterator end() noexcept
iterator 169 uspace/lib/cpp/include/__bits/adt/hash_table.hpp return iterator{};
iterator 212 uspace/lib/cpp/include/__bits/adt/hash_table.hpp iterator erase(const_iterator it)
iterator 224 uspace/lib/cpp/include/__bits/adt/hash_table.hpp iterator res{table_, idx, size_, node};
iterator 275 uspace/lib/cpp/include/__bits/adt/hash_table.hpp iterator find(const key_type& key)
iterator 287 uspace/lib/cpp/include/__bits/adt/hash_table.hpp return iterator{table_, idx, size_, current};
iterator 307 uspace/lib/cpp/include/__bits/adt/hash_table.hpp return iterator{table_, idx, size_, current};
iterator 320 uspace/lib/cpp/include/__bits/adt/hash_table.hpp pair<iterator, iterator> equal_range(const key_type& key)
iterator 115 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp typename Table::iterator,
iterator 116 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp typename Table::iterator
iterator 142 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp typename Table::iterator, bool
iterator 147 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp using iterator = typename Table::iterator;
iterator 163 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp iterator{
iterator 175 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return make_pair(iterator{
iterator 185 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp typename Table::iterator, bool
iterator 189 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp using iterator = typename Table::iterator;
iterator 204 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp iterator{
iterator 216 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return make_pair(iterator{
iterator 226 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp typename Table::iterator, bool
iterator 231 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp using iterator = typename Table::iterator;
iterator 246 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp iterator{
iterator 258 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return make_pair(iterator{
iterator 370 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp typename Table::iterator,
iterator 371 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp typename Table::iterator
iterator 407 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::iterator emplace(Table& table, Args&&... args)
iterator 417 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::iterator insert(Table& table, const Value& val)
iterator 427 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::iterator insert(Table& table, Value&& val)
iterator 438 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::iterator insert(Table& table, typename Table::node_type* node)
iterator 440 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp using iterator = typename Table::iterator;
iterator 455 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return iterator{
iterator 60 uspace/lib/cpp/include/__bits/adt/initializer_list.hpp constexpr iterator begin() const noexcept
iterator 65 uspace/lib/cpp/include/__bits/adt/initializer_list.hpp constexpr iterator end() const noexcept
iterator 71 uspace/lib/cpp/include/__bits/adt/initializer_list.hpp iterator begin_;
iterator 74 uspace/lib/cpp/include/__bits/adt/initializer_list.hpp constexpr initializer_list(iterator begin, size_type size)
iterator 360 uspace/lib/cpp/include/__bits/adt/list.hpp using reverse_iterator = std::reverse_iterator<iterator>;
iterator 506 uspace/lib/cpp/include/__bits/adt/list.hpp iterator begin() noexcept
iterator 508 uspace/lib/cpp/include/__bits/adt/list.hpp return iterator{head_, head_, size_ == 0U};
iterator 516 uspace/lib/cpp/include/__bits/adt/list.hpp iterator end() noexcept
iterator 518 uspace/lib/cpp/include/__bits/adt/list.hpp return iterator{get_last_(), head_, true};
iterator 705 uspace/lib/cpp/include/__bits/adt/list.hpp iterator emplace(const_iterator position, Args&&... args)
iterator 714 uspace/lib/cpp/include/__bits/adt/list.hpp return iterator{node->prev, head_, false};
iterator 717 uspace/lib/cpp/include/__bits/adt/list.hpp iterator insert(const_iterator position, const value_type& val)
iterator 722 uspace/lib/cpp/include/__bits/adt/list.hpp iterator insert(const_iterator position, value_type&& val)
iterator 727 uspace/lib/cpp/include/__bits/adt/list.hpp iterator insert(const_iterator position, size_type n, const value_type& val)
iterator 737 uspace/lib/cpp/include/__bits/adt/list.hpp iterator insert(const_iterator position, InputIterator first, InputIterator last)
iterator 748 uspace/lib/cpp/include/__bits/adt/list.hpp return iterator{position.node()->next, head_, false};
iterator 751 uspace/lib/cpp/include/__bits/adt/list.hpp iterator insert(const_iterator position, initializer_list<value_type> init)
iterator 756 uspace/lib/cpp/include/__bits/adt/list.hpp iterator erase(const_iterator position)
iterator 781 uspace/lib/cpp/include/__bits/adt/list.hpp return iterator{next, head_, size_ == 0U};
iterator 784 uspace/lib/cpp/include/__bits/adt/list.hpp iterator erase(const_iterator first, const_iterator last)
iterator 814 uspace/lib/cpp/include/__bits/adt/list.hpp return iterator{next, head_, size_ == 0U};
iterator 958 uspace/lib/cpp/include/__bits/adt/list.hpp iterator{first_node, nullptr, false},
iterator 959 uspace/lib/cpp/include/__bits/adt/list.hpp iterator{last_node, nullptr, false}
iterator 74 uspace/lib/cpp/include/__bits/adt/map.hpp using reverse_iterator = std::reverse_iterator<iterator>;
iterator 195 uspace/lib/cpp/include/__bits/adt/map.hpp iterator begin() noexcept
iterator 205 uspace/lib/cpp/include/__bits/adt/map.hpp iterator end() noexcept
iterator 319 uspace/lib/cpp/include/__bits/adt/map.hpp pair<iterator, bool> emplace(Args&&... args)
iterator 325 uspace/lib/cpp/include/__bits/adt/map.hpp iterator emplace_hint(const_iterator, Args&&... args)
iterator 330 uspace/lib/cpp/include/__bits/adt/map.hpp pair<iterator, bool> insert(const value_type& val)
iterator 335 uspace/lib/cpp/include/__bits/adt/map.hpp pair<iterator, bool> insert(value_type&& val)
iterator 341 uspace/lib/cpp/include/__bits/adt/map.hpp pair<iterator, bool> insert(
iterator 349 uspace/lib/cpp/include/__bits/adt/map.hpp iterator insert(const_iterator, const value_type& val)
iterator 354 uspace/lib/cpp/include/__bits/adt/map.hpp iterator insert(const_iterator, value_type&& val)
iterator 360 uspace/lib/cpp/include/__bits/adt/map.hpp iterator insert(
iterator 382 uspace/lib/cpp/include/__bits/adt/map.hpp pair<iterator, bool> try_emplace(const key_type& key, Args&&... args)
iterator 386 uspace/lib/cpp/include/__bits/adt/map.hpp return make_pair(iterator{parent, false}, false);
iterator 392 uspace/lib/cpp/include/__bits/adt/map.hpp return make_pair(iterator{node, false}, true);
iterator 397 uspace/lib/cpp/include/__bits/adt/map.hpp pair<iterator, bool> try_emplace(key_type&& key, Args&&... args)
iterator 401 uspace/lib/cpp/include/__bits/adt/map.hpp return make_pair(iterator{parent, false}, false);
iterator 407 uspace/lib/cpp/include/__bits/adt/map.hpp return make_pair(iterator{node, false}, true);
iterator 412 uspace/lib/cpp/include/__bits/adt/map.hpp iterator try_emplace(const_iterator, const key_type& key, Args&&... args)
iterator 418 uspace/lib/cpp/include/__bits/adt/map.hpp iterator try_emplace(const_iterator, key_type&& key, Args&&... args)
iterator 424 uspace/lib/cpp/include/__bits/adt/map.hpp pair<iterator, bool> insert_or_assign(const key_type& key, T&& val)
iterator 431 uspace/lib/cpp/include/__bits/adt/map.hpp return make_pair(iterator{parent, false}, false);
iterator 438 uspace/lib/cpp/include/__bits/adt/map.hpp return make_pair(iterator{node, false}, true);
iterator 443 uspace/lib/cpp/include/__bits/adt/map.hpp pair<iterator, bool> insert_or_assign(key_type&& key, T&& val)
iterator 450 uspace/lib/cpp/include/__bits/adt/map.hpp return make_pair(iterator{parent, false}, false);
iterator 457 uspace/lib/cpp/include/__bits/adt/map.hpp return make_pair(iterator{node, false}, true);
iterator 462 uspace/lib/cpp/include/__bits/adt/map.hpp iterator insert_or_assign(const_iterator, const key_type& key, T&& val)
iterator 468 uspace/lib/cpp/include/__bits/adt/map.hpp iterator insert_or_assign(const_iterator, key_type&& key, T&& val)
iterator 473 uspace/lib/cpp/include/__bits/adt/map.hpp iterator erase(const_iterator position)
iterator 483 uspace/lib/cpp/include/__bits/adt/map.hpp iterator erase(const_iterator first, const_iterator last)
iterator 488 uspace/lib/cpp/include/__bits/adt/map.hpp return iterator{
iterator 516 uspace/lib/cpp/include/__bits/adt/map.hpp iterator find(const key_type& key)
iterator 527 uspace/lib/cpp/include/__bits/adt/map.hpp iterator find(
iterator 558 uspace/lib/cpp/include/__bits/adt/map.hpp iterator lower_bound(const key_type& key)
iterator 569 uspace/lib/cpp/include/__bits/adt/map.hpp iterator lower_bound(
iterator 586 uspace/lib/cpp/include/__bits/adt/map.hpp iterator upper_bound(const key_type& key)
iterator 597 uspace/lib/cpp/include/__bits/adt/map.hpp iterator upper_bound(
iterator 614 uspace/lib/cpp/include/__bits/adt/map.hpp pair<iterator, iterator> equal_range(const key_type& key)
iterator 625 uspace/lib/cpp/include/__bits/adt/map.hpp pair<iterator, iterator> equal_range(
iterator 646 uspace/lib/cpp/include/__bits/adt/map.hpp iterator, const_iterator,
iterator 759 uspace/lib/cpp/include/__bits/adt/map.hpp using reverse_iterator = std::reverse_iterator<iterator>;
iterator 854 uspace/lib/cpp/include/__bits/adt/map.hpp iterator begin() noexcept
iterator 864 uspace/lib/cpp/include/__bits/adt/map.hpp iterator end() noexcept
iterator 930 uspace/lib/cpp/include/__bits/adt/map.hpp iterator emplace(Args&&... args)
iterator 936 uspace/lib/cpp/include/__bits/adt/map.hpp iterator emplace_hint(const_iterator, Args&&... args)
iterator 941 uspace/lib/cpp/include/__bits/adt/map.hpp iterator insert(const value_type& val)
iterator 946 uspace/lib/cpp/include/__bits/adt/map.hpp iterator insert(value_type&& val)
iterator 952 uspace/lib/cpp/include/__bits/adt/map.hpp iterator insert(
iterator 960 uspace/lib/cpp/include/__bits/adt/map.hpp iterator insert(const_iterator, const value_type& val)
iterator 965 uspace/lib/cpp/include/__bits/adt/map.hpp iterator insert(const_iterator, value_type&& val)
iterator 971 uspace/lib/cpp/include/__bits/adt/map.hpp iterator insert(
iterator 992 uspace/lib/cpp/include/__bits/adt/map.hpp iterator erase(const_iterator position)
iterator 1002 uspace/lib/cpp/include/__bits/adt/map.hpp iterator erase(const_iterator first, const_iterator last)
iterator 1007 uspace/lib/cpp/include/__bits/adt/map.hpp return iterator{
iterator 1035 uspace/lib/cpp/include/__bits/adt/map.hpp iterator find(const key_type& key)
iterator 1046 uspace/lib/cpp/include/__bits/adt/map.hpp iterator find(
iterator 1077 uspace/lib/cpp/include/__bits/adt/map.hpp iterator lower_bound(const key_type& key)
iterator 1088 uspace/lib/cpp/include/__bits/adt/map.hpp iterator lower_bound(
iterator 1105 uspace/lib/cpp/include/__bits/adt/map.hpp iterator upper_bound(const key_type& key)
iterator 1116 uspace/lib/cpp/include/__bits/adt/map.hpp iterator upper_bound(
iterator 1133 uspace/lib/cpp/include/__bits/adt/map.hpp pair<iterator, iterator> equal_range(const key_type& key)
iterator 1144 uspace/lib/cpp/include/__bits/adt/map.hpp pair<iterator, iterator> equal_range(
iterator 1165 uspace/lib/cpp/include/__bits/adt/map.hpp iterator, const_iterator,
iterator 58 uspace/lib/cpp/include/__bits/adt/rbtree.hpp using reverse_iterator = std::reverse_iterator<iterator>;
iterator 115 uspace/lib/cpp/include/__bits/adt/rbtree.hpp iterator begin()
iterator 117 uspace/lib/cpp/include/__bits/adt/rbtree.hpp return iterator{find_smallest_(), false};
iterator 125 uspace/lib/cpp/include/__bits/adt/rbtree.hpp iterator end()
iterator 134 uspace/lib/cpp/include/__bits/adt/rbtree.hpp return iterator{res->get_end(), true};
iterator 136 uspace/lib/cpp/include/__bits/adt/rbtree.hpp return iterator{res, true};
iterator 209 uspace/lib/cpp/include/__bits/adt/rbtree.hpp iterator erase(const_iterator it)
iterator 218 uspace/lib/cpp/include/__bits/adt/rbtree.hpp return iterator{find_largest_(), true};
iterator 220 uspace/lib/cpp/include/__bits/adt/rbtree.hpp return iterator{const_cast<node_type*>(node), false};
iterator 248 uspace/lib/cpp/include/__bits/adt/rbtree.hpp iterator find(const key_type& key)
iterator 252 uspace/lib/cpp/include/__bits/adt/rbtree.hpp return iterator{node, false};
iterator 271 uspace/lib/cpp/include/__bits/adt/rbtree.hpp iterator upper_bound(const key_type& key)
iterator 281 uspace/lib/cpp/include/__bits/adt/rbtree.hpp iterator lower_bound(const key_type& key)
iterator 291 uspace/lib/cpp/include/__bits/adt/rbtree.hpp pair<iterator, iterator> equal_range(const key_type& key)
iterator 59 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp static typename Tree::iterator lower_bound(const Tree& tree, const Key& key)
iterator 61 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using iterator = typename Tree::iterator;
iterator 66 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return iterator{const_cast<node_type*>(it.node()), it.end()};
iterator 102 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp static typename Tree::iterator upper_bound(const Tree& tree, const Key& key)
iterator 104 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using iterator = typename Tree::iterator;
iterator 109 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return iterator{const_cast<node_type*>(it.node()), it.end()};
iterator 131 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp typename Tree::iterator,
iterator 132 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp typename Tree::iterator
iterator 162 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp typename Tree::iterator, bool
iterator 166 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using iterator = typename Tree::iterator;
iterator 173 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return make_pair(iterator{parent, false}, false);
iterator 182 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp typename Tree::iterator, bool
iterator 185 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using iterator = typename Tree::iterator;
iterator 190 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return make_pair(iterator{parent, false}, false);
iterator 199 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp typename Tree::iterator, bool
iterator 202 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using iterator = typename Tree::iterator;
iterator 207 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return make_pair(iterator{parent, false}, false);
iterator 216 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp typename Tree::iterator, bool
iterator 222 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using iterator = typename Tree::iterator;
iterator 244 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return make_pair(iterator{node, false}, true);
iterator 289 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp static typename Tree::iterator lower_bound(const Tree& tree, const Key& key)
iterator 293 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return typename Tree::iterator{
iterator 328 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp static typename Tree::iterator upper_bound(const Tree& tree, const Key& key)
iterator 332 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return typename Tree::iterator{
iterator 363 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp typename Tree::iterator,
iterator 364 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp typename Tree::iterator
iterator 386 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp static typename Tree::iterator emplace(Tree& tree, Args&&... args)
iterator 396 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp static typename Tree::iterator insert(Tree& tree, const Value& val)
iterator 406 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp static typename Tree::iterator insert(Tree& tree, Value&& val)
iterator 416 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp static typename Tree::iterator insert(
iterator 421 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp using iterator = typename Tree::iterator;
iterator 445 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return iterator{node, false};
iterator 452 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp return iterator{node, false};
iterator 74 uspace/lib/cpp/include/__bits/adt/set.hpp using const_iterator = iterator;
iterator 76 uspace/lib/cpp/include/__bits/adt/set.hpp using reverse_iterator = std::reverse_iterator<iterator>;
iterator 171 uspace/lib/cpp/include/__bits/adt/set.hpp iterator begin() noexcept
iterator 181 uspace/lib/cpp/include/__bits/adt/set.hpp iterator end() noexcept
iterator 247 uspace/lib/cpp/include/__bits/adt/set.hpp pair<iterator, bool> emplace(Args&&... args)
iterator 253 uspace/lib/cpp/include/__bits/adt/set.hpp iterator emplace_hint(const_iterator, Args&&... args)
iterator 258 uspace/lib/cpp/include/__bits/adt/set.hpp pair<iterator, bool> insert(const value_type& val)
iterator 263 uspace/lib/cpp/include/__bits/adt/set.hpp pair<iterator, bool> insert(value_type&& val)
iterator 268 uspace/lib/cpp/include/__bits/adt/set.hpp iterator insert(const_iterator, const value_type& val)
iterator 273 uspace/lib/cpp/include/__bits/adt/set.hpp iterator insert(const_iterator, value_type&& val)
iterator 290 uspace/lib/cpp/include/__bits/adt/set.hpp iterator erase(const_iterator position)
iterator 300 uspace/lib/cpp/include/__bits/adt/set.hpp iterator erase(const_iterator first, const_iterator last)
iterator 305 uspace/lib/cpp/include/__bits/adt/set.hpp return iterator{
iterator 333 uspace/lib/cpp/include/__bits/adt/set.hpp iterator find(const key_type& key)
iterator 344 uspace/lib/cpp/include/__bits/adt/set.hpp iterator find(
iterator 375 uspace/lib/cpp/include/__bits/adt/set.hpp iterator lower_bound(const key_type& key)
iterator 386 uspace/lib/cpp/include/__bits/adt/set.hpp iterator lower_bound(
iterator 403 uspace/lib/cpp/include/__bits/adt/set.hpp iterator upper_bound(const key_type& key)
iterator 414 uspace/lib/cpp/include/__bits/adt/set.hpp iterator upper_bound(
iterator 431 uspace/lib/cpp/include/__bits/adt/set.hpp pair<iterator, iterator> equal_range(const key_type& key)
iterator 442 uspace/lib/cpp/include/__bits/adt/set.hpp pair<iterator, iterator> equal_range(
iterator 463 uspace/lib/cpp/include/__bits/adt/set.hpp iterator, const_iterator,
iterator 555 uspace/lib/cpp/include/__bits/adt/set.hpp using const_iterator = iterator;
iterator 557 uspace/lib/cpp/include/__bits/adt/set.hpp using reverse_iterator = std::reverse_iterator<iterator>;
iterator 652 uspace/lib/cpp/include/__bits/adt/set.hpp iterator begin() noexcept
iterator 662 uspace/lib/cpp/include/__bits/adt/set.hpp iterator end() noexcept
iterator 728 uspace/lib/cpp/include/__bits/adt/set.hpp iterator emplace(Args&&... args)
iterator 734 uspace/lib/cpp/include/__bits/adt/set.hpp iterator emplace_hint(const_iterator, Args&&... args)
iterator 739 uspace/lib/cpp/include/__bits/adt/set.hpp iterator insert(const value_type& val)
iterator 744 uspace/lib/cpp/include/__bits/adt/set.hpp iterator insert(value_type&& val)
iterator 749 uspace/lib/cpp/include/__bits/adt/set.hpp iterator insert(const_iterator, const value_type& val)
iterator 754 uspace/lib/cpp/include/__bits/adt/set.hpp iterator insert(const_iterator, value_type&& val)
iterator 771 uspace/lib/cpp/include/__bits/adt/set.hpp iterator erase(const_iterator position)
iterator 781 uspace/lib/cpp/include/__bits/adt/set.hpp iterator erase(const_iterator first, const_iterator last)
iterator 786 uspace/lib/cpp/include/__bits/adt/set.hpp return iterator{
iterator 814 uspace/lib/cpp/include/__bits/adt/set.hpp iterator find(const key_type& key)
iterator 825 uspace/lib/cpp/include/__bits/adt/set.hpp iterator find(
iterator 856 uspace/lib/cpp/include/__bits/adt/set.hpp iterator lower_bound(const key_type& key)
iterator 867 uspace/lib/cpp/include/__bits/adt/set.hpp iterator lower_bound(
iterator 884 uspace/lib/cpp/include/__bits/adt/set.hpp iterator upper_bound(const key_type& key)
iterator 895 uspace/lib/cpp/include/__bits/adt/set.hpp iterator upper_bound(
iterator 912 uspace/lib/cpp/include/__bits/adt/set.hpp pair<iterator, iterator> equal_range(const key_type& key)
iterator 923 uspace/lib/cpp/include/__bits/adt/set.hpp pair<iterator, iterator> equal_range(
iterator 944 uspace/lib/cpp/include/__bits/adt/set.hpp iterator, const_iterator,
iterator 214 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator begin() noexcept
iterator 224 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator end() noexcept
iterator 245 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp pair<iterator, bool> emplace(Args&&... args)
iterator 251 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator emplace_hint(const_iterator, Args&&... args)
iterator 256 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp pair<iterator, bool> insert(const value_type& val)
iterator 261 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp pair<iterator, bool> insert(value_type&& val)
iterator 267 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp pair<iterator, bool> insert(
iterator 275 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator insert(const_iterator, const value_type& val)
iterator 280 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator insert(const_iterator, value_type&& val)
iterator 286 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator insert(
iterator 308 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp pair<iterator, bool> try_emplace(const key_type& key, Args&&... args)
iterator 329 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator{
iterator 341 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return make_pair(iterator{
iterator 350 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp pair<iterator, bool> try_emplace(key_type&& key, Args&&... args)
iterator 364 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator{
iterator 376 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return make_pair(iterator{
iterator 385 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator try_emplace(const_iterator, const key_type& key, Args&&... args)
iterator 391 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator try_emplace(const_iterator, key_type&& key, Args&&... args)
iterator 397 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp pair<iterator, bool> insert_or_assign(const key_type& key, T&& val)
iterator 412 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator{
iterator 424 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return make_pair(iterator{
iterator 433 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp pair<iterator, bool> insert_or_assign(key_type&& key, T&& val)
iterator 448 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator{
iterator 460 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return make_pair(iterator{
iterator 469 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator insert_or_assign(const_iterator, const key_type& key, T&& val)
iterator 475 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator insert_or_assign(const_iterator, key_type&& key, T&& val)
iterator 480 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator erase(const_iterator position)
iterator 490 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator erase(const_iterator first, const_iterator last)
iterator 495 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return iterator{
iterator 525 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator find(const key_type& key)
iterator 540 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp pair<iterator, iterator> equal_range(const key_type& key)
iterator 701 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator, const_iterator, local_iterator, const_local_iterator,
iterator 891 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator begin() noexcept
iterator 901 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator end() noexcept
iterator 922 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator emplace(Args&&... args)
iterator 928 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator emplace_hint(const_iterator, Args&&... args)
iterator 933 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator insert(const value_type& val)
iterator 938 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator insert(value_type&& val)
iterator 944 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator insert(
iterator 952 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator insert(const_iterator, const value_type& val)
iterator 957 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator insert(const_iterator, value_type&& val)
iterator 963 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator insert(
iterator 984 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator erase(const_iterator position)
iterator 994 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator erase(const_iterator first, const_iterator last)
iterator 999 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return iterator{
iterator 1029 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator find(const key_type& key)
iterator 1044 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp pair<iterator, iterator> equal_range(const key_type& key)
iterator 1133 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp iterator, const_iterator, local_iterator, const_local_iterator,
iterator 73 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp using const_iterator = iterator;
iterator 219 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator begin() noexcept
iterator 229 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator end() noexcept
iterator 250 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp pair<iterator, bool> emplace(Args&&... args)
iterator 256 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator emplace_hint(const_iterator, Args&&... args)
iterator 261 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp pair<iterator, bool> insert(const value_type& val)
iterator 266 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp pair<iterator, bool> insert(value_type&& val)
iterator 271 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator insert(const_iterator, const value_type& val)
iterator 276 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator insert(const_iterator, value_type&& val)
iterator 293 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator erase(const_iterator position)
iterator 303 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator erase(const_iterator first, const_iterator last)
iterator 308 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return iterator{
iterator 338 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator find(const key_type& key)
iterator 353 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp pair<iterator, iterator> equal_range(const key_type& key)
iterator 442 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator, const_iterator, local_iterator, const_local_iterator,
iterator 489 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp using const_iterator = iterator;
iterator 635 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator begin() noexcept
iterator 645 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator end() noexcept
iterator 666 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator emplace(Args&&... args)
iterator 672 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator emplace_hint(const_iterator, Args&&... args)
iterator 677 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator insert(const value_type& val)
iterator 682 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator insert(value_type&& val)
iterator 687 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator insert(const_iterator, const value_type& val)
iterator 692 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator insert(const_iterator, value_type&& val)
iterator 709 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator erase(const_iterator position)
iterator 719 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator erase(const_iterator first, const_iterator last)
iterator 724 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return iterator{
iterator 754 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator find(const key_type& key)
iterator 769 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp pair<iterator, iterator> equal_range(const key_type& key)
iterator 858 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp iterator, const_iterator, local_iterator, const_local_iterator,
iterator 58 uspace/lib/cpp/include/__bits/adt/vector.hpp using reverse_iterator = std::reverse_iterator<iterator>;
iterator 205 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator begin() noexcept
iterator 215 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator end() noexcept
iterator 405 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator emplace(const_iterator position, Args&&... args)
iterator 407 uspace/lib/cpp/include/__bits/adt/vector.hpp auto pos = const_cast<iterator>(position);
iterator 415 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator insert(const_iterator position, const value_type& x)
iterator 417 uspace/lib/cpp/include/__bits/adt/vector.hpp auto pos = const_cast<iterator>(position);
iterator 425 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator insert(const_iterator position, value_type&& x)
iterator 427 uspace/lib/cpp/include/__bits/adt/vector.hpp auto pos = const_cast<iterator>(position);
iterator 435 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator insert(const_iterator position, size_type count, const value_type& x)
iterator 437 uspace/lib/cpp/include/__bits/adt/vector.hpp auto pos = const_cast<iterator>(position);
iterator 448 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator insert(const_iterator position, InputIterator first,
iterator 451 uspace/lib/cpp/include/__bits/adt/vector.hpp auto pos = const_cast<iterator>(position);
iterator 460 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator insert(const_iterator position, initializer_list<T> init)
iterator 462 uspace/lib/cpp/include/__bits/adt/vector.hpp auto pos = const_cast<iterator>(position);
iterator 470 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator erase(const_iterator position)
iterator 472 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator pos = const_cast<iterator>(position);
iterator 479 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator erase(const_iterator first, const_iterator last)
iterator 481 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator pos = const_cast<iterator>(first);
iterator 542 uspace/lib/cpp/include/__bits/adt/vector.hpp void destroy_from_end_until_(iterator target)
iterator 560 uspace/lib/cpp/include/__bits/adt/vector.hpp iterator shift_(iterator position, size_type count)
iterator 169 uspace/lib/cpp/include/__bits/iterator.hpp : public iterator<
iterator 360 uspace/lib/cpp/include/__bits/iterator.hpp : public iterator<output_iterator_tag, void, void, void, void>
iterator 412 uspace/lib/cpp/include/__bits/iterator.hpp : public iterator<output_iterator_tag, void, void, void, void>
iterator 464 uspace/lib/cpp/include/__bits/iterator.hpp : public iterator<output_iterator_tag, void, void, void, void>
iterator 469 uspace/lib/cpp/include/__bits/iterator.hpp explicit insert_iterator(Container& cont, typename Container::iterator i)
iterator 506 uspace/lib/cpp/include/__bits/iterator.hpp typename Container::iterator iter;
iterator 510 uspace/lib/cpp/include/__bits/iterator.hpp insert_iterator<Container> inserter(Container& cont, typename Container::iterator i)
iterator 726 uspace/lib/cpp/include/__bits/iterator.hpp : public iterator<input_iterator_tag, T, Distance, const T*, const T&>
iterator 806 uspace/lib/cpp/include/__bits/iterator.hpp : public iterator<output_iterator_tag, void, void, void, void>
iterator 861 uspace/lib/cpp/include/__bits/iterator.hpp : public iterator<input_iterator_tag, Char, typename Traits::off_type, Char*, Char>
iterator 971 uspace/lib/cpp/include/__bits/iterator.hpp : public iterator<output_iterator_tag, void, void, void, void>
iterator 44 uspace/lib/cpp/include/__bits/memory/misc.hpp class raw_storage_iterator: public iterator<output_iterator_tag, void, void, void, void>
iterator 457 uspace/lib/cpp/include/__bits/string/string.hpp using reverse_iterator = std::reverse_iterator<iterator>;
iterator 622 uspace/lib/cpp/include/__bits/string/string.hpp iterator begin() noexcept
iterator 632 uspace/lib/cpp/include/__bits/string/string.hpp iterator end() noexcept
iterator 979 uspace/lib/cpp/include/__bits/string/string.hpp iterator insert(const_iterator pos, value_type c)
iterator 993 uspace/lib/cpp/include/__bits/string/string.hpp iterator insert(const_iterator pos, size_type n, value_type c)
iterator 996 uspace/lib/cpp/include/__bits/string/string.hpp return const_cast<iterator>(pos);
iterator 1013 uspace/lib/cpp/include/__bits/string/string.hpp iterator insert(const_iterator pos, InputIterator first,
iterator 1017 uspace/lib/cpp/include/__bits/string/string.hpp return const_cast<iterator>(pos);
iterator 1026 uspace/lib/cpp/include/__bits/string/string.hpp iterator insert(const_iterator pos, initializer_list<value_type> init)
iterator 1041 uspace/lib/cpp/include/__bits/string/string.hpp iterator erase(const_iterator pos)
iterator 1049 uspace/lib/cpp/include/__bits/string/string.hpp iterator erase(const_iterator first, const_iterator last)
iterator 90 uspace/lib/posix/include/common/adt/list.h #define list_foreach(list, member, itype, iterator) \
iterator 91 uspace/lib/posix/include/common/adt/list.h for (itype *iterator = NULL; iterator == NULL; iterator = (itype *) sizeof(itype)) \
iterator 93 uspace/lib/posix/include/common/adt/list.h iterator = list_get_instance(_link, itype, member), \
iterator 96 uspace/lib/posix/include/common/adt/list.h #define list_foreach_rev(list, member, itype, iterator) \
iterator 97 uspace/lib/posix/include/common/adt/list.h for (itype *iterator = NULL; iterator == NULL; iterator = (itype *) sizeof(itype)) \
iterator 99 uspace/lib/posix/include/common/adt/list.h iterator = list_get_instance(_link, itype, member), \
iterator 127 uspace/lib/posix/include/common/adt/list.h #define list_foreach_safe(list, iterator, next_iter) \
iterator 128 uspace/lib/posix/include/common/adt/list.h for (link_t *iterator = (list).head.next, \
iterator 129 uspace/lib/posix/include/common/adt/list.h *next_iter = iterator->next; \
iterator 130 uspace/lib/posix/include/common/adt/list.h iterator != &(list).head; \
iterator 131 uspace/lib/posix/include/common/adt/list.h iterator = next_iter, next_iter = iterator->next)
iterator 385 uspace/lib/posix/src/signal.c link_t *iterator = _signal_queue.head.next;
iterator 388 uspace/lib/posix/src/signal.c while (iterator != &(_signal_queue).head) {
iterator 389 uspace/lib/posix/src/signal.c next = iterator->next;
iterator 392 uspace/lib/posix/src/signal.c list_get_instance(iterator, signal_queue_item, link);
iterator 401 uspace/lib/posix/src/signal.c iterator = next;
iterator 131 uspace/lib/usbdev/src/altiface.c usb_alternate_interface_descriptors_t *iterator = alts;
iterator 132 uspace/lib/usbdev/src/altiface.c for (; iface_ptr != NULL && iterator < &alts[alt_count]; ++iterator) {
iterator 146 uspace/lib/usbdev/src/altiface.c iterator->interface = iface;
iterator 147 uspace/lib/usbdev/src/altiface.c iterator->nested_descriptors = iface_ptr + sizeof(*iface);
iterator 156 uspace/lib/usbdev/src/altiface.c iterator->nested_descriptors_size =
iterator 157 uspace/lib/usbdev/src/altiface.c next - iterator->nested_descriptors;
HelenOS homepage, sources at GitHub