Home
last modified time | relevance | path

Searched refs:__node (Results 1 – 25 of 37) sorted by relevance

12

/netbsd-src/sys/external/bsd/drm2/include/linux/
H A Dinterval_tree_generic.h88 PREFIX##_insert(T *__node, struct rb_root_cached *__root) \
92 __collision = rb_tree_insert_node(&__root->rb_root.rbr_tree, __node); \
93 KASSERT(__collision == __node); \
97 PREFIX##_remove(T *__node, struct rb_root_cached *__root) \
99 rb_tree_remove_node(&__root->rb_root.rbr_tree, __node); \
105 T *__node; \
107 __node = rb_tree_find_node_geq(&__root->rb_root.rbr_tree, &__start); \
108 if (__node == NULL) \
110 KASSERT(__start <= START(__node)); \
111 if (__last < START(__node)) \
[all …]
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/
H A Dslist74 const _Slist_node_base* __node)
76 while (__head && __head->_M_next != __node)
83 const _Slist_node_base* __node)
85 while (__head && __head->_M_next != __node)
119 __slist_reverse(_Slist_node_base* __node)
121 _Slist_node_base* __result = __node;
122 __node = __node->_M_next;
124 while(__node)
126 _Slist_node_base* __next = __node->_M_next;
127 __node->_M_next = __result;
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/
H A Dslist74 const _Slist_node_base* __node)
76 while (__head && __head->_M_next != __node)
83 const _Slist_node_base* __node)
85 while (__head && __head->_M_next != __node)
119 __slist_reverse(_Slist_node_base* __node)
121 _Slist_node_base* __result = __node;
122 __node = __node->_M_next;
124 while(__node)
126 _Slist_node_base* __next = __node->_M_next;
127 __node->_M_next = __result;
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
H A Ddeque.tcc859 for (_Map_pointer __node = __first._M_node + 1; in _M_insert_aux() local
860 __node < __last._M_node; ++__node) in _M_insert_aux()
861 std::_Destroy(*__node, *__node + _S_buffer_size(), in _M_insert_aux()
987 for (typename _Iter::_Map_pointer __node = __first._M_node + 1; in _M_insert_aux() local
988 __node < __last._M_node; ++__node) in _M_insert_aux()
989 std::__fill_a1(*__node, *__node + _Iter::_S_buffer_size(), __value); in _M_insert_aux()
1011 for (typename _Iter::_Map_pointer __node = __first._M_node + 1; in _M_insert_aux() local
1012 __node != __last._M_node; ++__node) in _M_insert_aux()
1014 = std::__copy_move_a1<_IsMove>(*__node, in _M_insert_aux()
1015 *__node + _Iter::_S_buffer_size(), in _M_insert_aux()
[all …]
H A Dhashtable.h1652 _M_insert_bucket_begin(size_type __bkt, __node_type* __node) in _GLIBCXX_VISIBILITY()
1658 __node->_M_nxt = _M_buckets[__bkt]->_M_nxt; in _GLIBCXX_VISIBILITY()
1659 _M_buckets[__bkt]->_M_nxt = __node; in _GLIBCXX_VISIBILITY()
1666 __node->_M_nxt = _M_before_begin._M_nxt; in _GLIBCXX_VISIBILITY()
1667 _M_before_begin._M_nxt = __node; in _GLIBCXX_VISIBILITY()
1668 if (__node->_M_nxt) in _GLIBCXX_VISIBILITY()
1671 _M_buckets[_M_bucket_index(__node->_M_next())] = __node; in _GLIBCXX_VISIBILITY()
1728 _Scoped_node __node { this, std::forward<_Args>(__args)... }; in _GLIBCXX_VISIBILITY()
1729 const key_type& __k = this->_M_extract()(__node._M_node->_M_v()); in _GLIBCXX_VISIBILITY()
1737 auto __pos = _M_insert_unique_node(__k, __bkt, __code, __node._M_node); in _GLIBCXX_VISIBILITY()
[all …]
H A Dforward_list.tcc380 _Node_base* __node = &this->_M_impl._M_head; in merge() local
381 while (__node->_M_next && __list._M_impl._M_head._M_next) in merge()
386 (__node->_M_next)->_M_valptr())) in merge()
387 __node->_M_transfer_after(&__list._M_impl._M_head, in merge()
389 __node = __node->_M_next; in merge()
393 *__node = std::move(__list._M_impl._M_head); in merge()
H A Dhashtable_policy.h126 __node_type* __node = _M_nodes; in _GLIBCXX_VISIBILITY() local
128 __node->_M_nxt = nullptr; in _GLIBCXX_VISIBILITY()
130 __node_alloc_traits::destroy(__a, __node->_M_valptr()); in _GLIBCXX_VISIBILITY()
133 __node_alloc_traits::construct(__a, __node->_M_valptr(), in _GLIBCXX_VISIBILITY()
138 _M_h._M_deallocate_node_ptr(__node); in _GLIBCXX_VISIBILITY()
141 return __node; in _GLIBCXX_VISIBILITY()
709 if (__node_type* __node = __h->_M_find_node(__bkt, __k, __code)) in _GLIBCXX_VISIBILITY()
710 return __node->_M_v().second; in _GLIBCXX_VISIBILITY()
712 typename __hashtable::_Scoped_node __node { in _GLIBCXX_VISIBILITY()
719 = __h->_M_insert_unique_node(__k, __bkt, __code, __node._M_node); in _GLIBCXX_VISIBILITY()
[all …]
H A Dstl_tree.h487 _Link_type __node = static_cast<_Link_type>(_M_extract()); in _GLIBCXX_VISIBILITY()
488 if (__node) in _GLIBCXX_VISIBILITY()
490 _M_t._M_destroy_node(__node); in _GLIBCXX_VISIBILITY()
491 _M_t._M_construct_node(__node, _GLIBCXX_FORWARD(_Arg, __arg)); in _GLIBCXX_VISIBILITY()
492 return __node; in _GLIBCXX_VISIBILITY()
505 _Base_ptr __node = _M_nodes; in _GLIBCXX_VISIBILITY()
509 if (_M_nodes->_M_right == __node) in _GLIBCXX_VISIBILITY()
530 return __node; in _GLIBCXX_VISIBILITY()
592 _M_construct_node(_Link_type __node, const value_type& __x) in _GLIBCXX_VISIBILITY()
595 { get_allocator().construct(__node->_M_valptr(), __x); } in _GLIBCXX_VISIBILITY()
[all …]
H A Dforward_list.h360 _Node* __node = this->_M_get_node(); in _GLIBCXX_VISIBILITY() local
363 ::new ((void*)__node) _Node; in _GLIBCXX_VISIBILITY()
365 __node->_M_valptr(), in _GLIBCXX_VISIBILITY()
370 this->_M_put_node(__node); in _GLIBCXX_VISIBILITY()
373 return __node; in _GLIBCXX_VISIBILITY()
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/profile/
H A Dunordered_base.h44 const __detail::_Hash_node<_Value, true>* __node) in _GLIBCXX_VISIBILITY()
45 { return __node->_M_hash_code % __uc.bucket_count(); } in _GLIBCXX_VISIBILITY()
53 const __detail::_Hash_node<_Value, false>* __node) in _GLIBCXX_VISIBILITY()
54 { return __uc.bucket(__node->_M_v()); } in _GLIBCXX_VISIBILITY()
65 const __detail::_Hash_node<_Value, false>* __node) in _GLIBCXX_VISIBILITY()
66 { return __uc.bucket(__node->_M_v().first); } in _GLIBCXX_VISIBILITY()
72 const __detail::_Hash_node<_Value, _Cache_hash_code>* __node) in _GLIBCXX_VISIBILITY()
76 return __bucket_index_helper::bucket(__uc, __node); in _GLIBCXX_VISIBILITY()
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
H A Ddeque.tcc862 for (_Map_pointer __node = __first._M_node + 1; in _M_insert_aux() local
863 __node < __last._M_node; ++__node) in _M_insert_aux()
864 std::_Destroy(*__node, *__node + _S_buffer_size(), in _M_insert_aux()
990 for (typename _Iter::_Map_pointer __node = __first._M_node + 1; in _M_insert_aux() local
991 __node < __last._M_node; ++__node) in _M_insert_aux()
992 std::__fill_a1(*__node, *__node + _Iter::_S_buffer_size(), __value); in _M_insert_aux()
1014 for (typename _Iter::_Map_pointer __node = __first._M_node + 1; in _M_insert_aux() local
1015 __node != __last._M_node; ++__node) in _M_insert_aux()
1017 = std::__copy_move_a1<_IsMove>(*__node, in _M_insert_aux()
1018 *__node + _Iter::_S_buffer_size(), in _M_insert_aux()
[all …]
H A Dforward_list.tcc375 _Node_base* __node = &this->_M_impl._M_head; in merge() local
376 while (__node->_M_next && __list._M_impl._M_head._M_next) in merge()
381 (__node->_M_next)->_M_valptr())) in merge()
382 __node->_M_transfer_after(&__list._M_impl._M_head, in merge()
384 __node = __node->_M_next; in merge()
388 *__node = std::move(__list._M_impl._M_head); in merge()
H A Dhashtable.h2000 _M_insert_bucket_begin(size_type __bkt, __node_ptr __node) in _GLIBCXX_VISIBILITY()
2006 __node->_M_nxt = _M_buckets[__bkt]->_M_nxt; in _GLIBCXX_VISIBILITY()
2007 _M_buckets[__bkt]->_M_nxt = __node; in _GLIBCXX_VISIBILITY()
2014 __node->_M_nxt = _M_before_begin._M_nxt; in _GLIBCXX_VISIBILITY()
2015 _M_before_begin._M_nxt = __node; in _GLIBCXX_VISIBILITY()
2017 if (__node->_M_nxt) in _GLIBCXX_VISIBILITY()
2020 _M_buckets[_M_bucket_index(*__node->_M_next())] = __node; in _GLIBCXX_VISIBILITY()
2078 _Scoped_node __node { this, std::forward<_Args>(__args)... }; in _GLIBCXX_VISIBILITY()
2079 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v()); in _GLIBCXX_VISIBILITY()
2096 auto __pos = _M_insert_unique_node(__bkt, __code, __node._M_node); in _GLIBCXX_VISIBILITY()
[all …]
H A Dhashtable_policy.h170 __node_type* __node = _M_nodes; in _GLIBCXX_VISIBILITY()
172 __node->_M_nxt = nullptr; in _GLIBCXX_VISIBILITY()
174 __node_alloc_traits::destroy(__a, __node->_M_valptr()); in _GLIBCXX_VISIBILITY()
177 __node_alloc_traits::construct(__a, __node->_M_valptr(), in _GLIBCXX_VISIBILITY()
182 _M_h._M_deallocate_node_ptr(__node); in _GLIBCXX_VISIBILITY()
185 return __node; in _GLIBCXX_VISIBILITY()
779 if (auto __node = __h->_M_find_node(__bkt, __k, __code)) in _GLIBCXX_VISIBILITY()
780 return __node->_M_v().second; in _GLIBCXX_VISIBILITY()
782 typename __hashtable::_Scoped_node __node { in _GLIBCXX_VISIBILITY()
789 = __h->_M_insert_unique_node(__bkt, __code, __node._M_node); in _GLIBCXX_VISIBILITY()
[all …]
H A Dstl_tree.h470 _Link_type __node = static_cast<_Link_type>(_M_extract()); in _GLIBCXX_VISIBILITY() local
471 if (__node) in _GLIBCXX_VISIBILITY()
473 _M_t._M_destroy_node(__node); in _GLIBCXX_VISIBILITY()
474 _M_t._M_construct_node(__node, _GLIBCXX_FORWARD(_Arg, __arg)); in _GLIBCXX_VISIBILITY()
475 return __node; in _GLIBCXX_VISIBILITY()
488 _Base_ptr __node = _M_nodes; in _GLIBCXX_VISIBILITY() local
492 if (_M_nodes->_M_right == __node) in _GLIBCXX_VISIBILITY()
513 return __node; in _GLIBCXX_VISIBILITY()
571 _M_construct_node(_Link_type __node, const value_type& __x) in _GLIBCXX_VISIBILITY()
574 { get_allocator().construct(__node->_M_valptr(), __x); } in _GLIBCXX_VISIBILITY()
[all …]
H A Dforward_list.h368 _Node* __node = this->_M_get_node(); in _GLIBCXX_VISIBILITY() local
371 ::new ((void*)__node) _Node; in _GLIBCXX_VISIBILITY()
373 __node->_M_valptr(), in _GLIBCXX_VISIBILITY()
378 this->_M_put_node(__node); in _GLIBCXX_VISIBILITY()
381 return __node; in _GLIBCXX_VISIBILITY()
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/src/c++98/
H A Dtree.cc447 _Rb_tree_black_count(const _Rb_tree_node_base* __node, in _Rb_tree_black_count() argument
450 if (__node == 0) in _Rb_tree_black_count()
455 if (__node->_M_color == _S_black) in _Rb_tree_black_count()
457 if (__node == __root) in _Rb_tree_black_count()
459 __node = __node->_M_parent; in _Rb_tree_black_count()
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/
H A Dtree.cc447 _Rb_tree_black_count(const _Rb_tree_node_base* __node, in _Rb_tree_black_count() argument
450 if (__node == 0) in _Rb_tree_black_count()
455 if (__node->_M_color == _S_black) in _Rb_tree_black_count()
457 if (__node == __root) in _Rb_tree_black_count()
459 __node = __node->_M_parent; in _Rb_tree_black_count()
/netbsd-src/external/bsd/libevent/dist/WIN32-Code/
H A Dtree.h206 struct type __node, *__left, *__right, *__tmp; \
209 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
210 __left = __right = &__node; \
235 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
243 struct type __node, *__left, *__right, *__tmp; \
245 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
246 __left = __right = &__node; \
271 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
/netbsd-src/external/bsd/ntp/dist/sntp/libevent/WIN32-Code/
H A Dtree.h207 struct type __node, *__left, *__right, *__tmp; \
210 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
211 __left = __right = &__node; \
236 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
244 struct type __node, *__left, *__right, *__tmp; \
246 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
247 __left = __right = &__node; \
272 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
/netbsd-src/external/bsd/ipf/dist/sys/
H A Dtree.h208 struct type __node, *__left, *__right, *__tmp; \
211 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
212 __left = __right = &__node; \
237 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
245 struct type __node, *__left, *__right, *__tmp; \
247 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
248 __left = __right = &__node; \
273 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
/netbsd-src/external/mit/libuv/dist/include/uv/
H A Dtree.h212 struct type __node, *__left, *__right, *__tmp; \
215 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL; \
216 __left = __right = &__node; \
241 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
249 struct type __node, *__left, *__right, *__tmp; \
251 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL; \
252 __left = __right = &__node; \
277 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
/netbsd-src/sys/sys/
H A Dtree.h206 struct type __node, *__left, *__right, *__tmp; \
209 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
210 __left = __right = &__node; \
235 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
243 struct type __node, *__left, *__right, *__tmp; \
245 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
246 __left = __right = &__node; \
271 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
/netbsd-src/external/apache2/llvm/dist/libcxx/include/
H A Dforward_list216 typename pointer_traits<_NodePtr>::element_type>::type __node;
217 typedef typename __forward_list_node_value_type<__node>::type __node_value_type;
372 typedef typename __traits::__node __node;
457 typedef __forward_list_node<value_type, void_pointer> __node;
459 …typedef typename __rebind_alloc_helper<allocator_traits<allocator_type>, __node>::type __node_allo…
633 typedef typename base::__node __node;
902 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
924 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
1131 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1147 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
[all …]
H A D__hash_table364 __hash_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
365 : __node_(__node)
371 __hash_iterator(__next_pointer __node) _NOEXCEPT
372 : __node_(__node)
484 __hash_const_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
485 : __node_(__node)
491 __hash_const_iterator(__next_pointer __node) _NOEXCEPT
492 : __node_(__node)
599 __hash_local_iterator(__next_pointer __node, size_t __bucket,
601 : __node_(__node),
[all …]

12