/netbsd-current/sys/external/bsd/drm2/include/linux/ |
H A D | interval_tree_generic.h | 88 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-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/profile/ |
H A D | unordered_base.h | 44 const __detail::_Hash_node<_Value, true>* __node) 45 { return __node->_M_hash_code % __uc.bucket_count(); } 53 const __detail::_Hash_node<_Value, false>* __node) 54 { return __uc.bucket(__node->_M_v()); } 65 const __detail::_Hash_node<_Value, false>* __node) 66 { return __uc.bucket(__node->_M_v().first); } 72 const __detail::_Hash_node<_Value, _Cache_hash_code>* __node) 76 return __bucket_index_helper::bucket(__uc, __node); 43 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, true>* __node) argument 52 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument 64 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument 71 __get_bucket_index(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, _Cache_hash_code>* __node) argument
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
H A D | hashtable.h | 1652 _M_insert_bucket_begin(size_type __bkt, __node_type* __node) argument 1658 __node->_M_nxt = _M_buckets[__bkt]->_M_nxt; 1659 _M_buckets[__bkt]->_M_nxt = __node; 1666 __node->_M_nxt = _M_before_begin._M_nxt; 1667 _M_before_begin._M_nxt = __node; 1668 if (__node->_M_nxt) 1671 _M_buckets[_M_bucket_index(__node->_M_next())] = __node; 1728 _Scoped_node __node { this, std::forward<_Args>(__args)... }; 1729 const key_type& __k = this->_M_extract()(__node [all...] |
H A D | hashtable_policy.h | 126 __node_type* __node = _M_nodes; local 128 __node->_M_nxt = nullptr; 130 __node_alloc_traits::destroy(__a, __node->_M_valptr()); 133 __node_alloc_traits::construct(__a, __node->_M_valptr(), 138 _M_h._M_deallocate_node_ptr(__node); 141 return __node; 709 if (__node_type* __node = __h->_M_find_node(__bkt, __k, __code)) 710 return __node->_M_v().second; 712 typename __hashtable::_Scoped_node __node { 719 = __h->_M_insert_unique_node(__k, __bkt, __code, __node [all...] |
H A D | forward_list.h | 360 _Node* __node = this->_M_get_node(); 363 ::new ((void*)__node) _Node; 365 __node->_M_valptr(), 370 this->_M_put_node(__node); 373 return __node;
|
H A D | stl_list.h | 136 _List_node_base* const __node = this->_M_base(); local 137 __node->_M_next = __xnode->_M_next; 138 __node->_M_prev = __xnode->_M_prev; 139 __node->_M_next->_M_prev = __node->_M_prev->_M_next = __node;
|
H A D | stl_tree.h | 487 _Link_type __node = static_cast<_Link_type>(_M_extract()); 488 if (__node) 490 _M_t._M_destroy_node(__node); 491 _M_t._M_construct_node(__node, _GLIBCXX_FORWARD(_Arg, __arg)); 492 return __node; 505 _Base_ptr __node = _M_nodes; 509 if (_M_nodes->_M_right == __node) 524 else // __node is on the left. 530 return __node; 592 _M_construct_node(_Link_type __node, cons [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/ |
H A D | tree.cc | 447 _Rb_tree_black_count(const _Rb_tree_node_base* __node, argument 450 if (__node == 0) 455 if (__node->_M_color == _S_black) 457 if (__node == __root) 459 __node = __node->_M_parent;
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/src/c++98/ |
H A D | tree.cc | 447 _Rb_tree_black_count(const _Rb_tree_node_base* __node, argument 450 if (__node == 0) 455 if (__node->_M_color == _S_black) 457 if (__node == __root) 459 __node = __node->_M_parent;
|
/netbsd-current/external/bsd/ipf/dist/sys/ |
H A D | tree.h | 208 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, __lef [all...] |
/netbsd-current/external/bsd/libevent/dist/WIN32-Code/ |
H A D | tree.h | 206 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, __lef [all...] |
/netbsd-current/external/bsd/ntp/dist/sntp/libevent/WIN32-Code/ |
H A D | tree.h | 207 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, __lef [all...] |
/netbsd-current/external/mit/libuv/dist/include/uv/ |
H A D | tree.h | 212 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, __lef [all...] |
/netbsd-current/sys/sys/ |
H A D | tree.h | 206 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, __lef [all...] |
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
H A D | hashtable.h | 2000 _M_insert_bucket_begin(size_type __bkt, __node_ptr __node) argument 2006 __node->_M_nxt = _M_buckets[__bkt]->_M_nxt; 2007 _M_buckets[__bkt]->_M_nxt = __node; 2014 __node->_M_nxt = _M_before_begin._M_nxt; 2015 _M_before_begin._M_nxt = __node; 2017 if (__node->_M_nxt) 2020 _M_buckets[_M_bucket_index(*__node->_M_next())] = __node; 2078 _Scoped_node __node { this, std::forward<_Args>(__args)... }; 2079 const key_type& __k = _ExtractKey{}(__node [all...] |
H A D | hashtable_policy.h | 170 __node_type* __node = _M_nodes; local 172 __node->_M_nxt = nullptr; 174 __node_alloc_traits::destroy(__a, __node->_M_valptr()); 177 __node_alloc_traits::construct(__a, __node->_M_valptr(), 182 _M_h._M_deallocate_node_ptr(__node); 185 return __node; 779 if (auto __node = __h->_M_find_node(__bkt, __k, __code)) 780 return __node->_M_v().second; 782 typename __hashtable::_Scoped_node __node { 789 = __h->_M_insert_unique_node(__bkt, __code, __node [all...] |
H A D | stl_tree.h | 470 _Link_type __node = static_cast<_Link_type>(_M_extract()); 471 if (__node) 473 _M_t._M_destroy_node(__node); 474 _M_t._M_construct_node(__node, _GLIBCXX_FORWARD(_Arg, __arg)); 475 return __node; 488 _Base_ptr __node = _M_nodes; 492 if (_M_nodes->_M_right == __node) 507 else // __node is on the left. 513 return __node; 571 _M_construct_node(_Link_type __node, cons [all...] |
H A D | forward_list.h | 368 _Node* __node = this->_M_get_node(); 371 ::new ((void*)__node) _Node; 373 __node->_M_valptr(), 378 this->_M_put_node(__node); 381 return __node;
|
H A D | stl_list.h | 137 _List_node_base* const __node = this->_M_base(); local 138 __node->_M_next = __xnode->_M_next; 139 __node->_M_prev = __xnode->_M_prev; 140 __node->_M_next->_M_prev = __node->_M_prev->_M_next = __node;
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/ |
H A D | hashtable_policy.h | 208 _Hashtable_iterator_base(_Hash_node<_Value, __cache>* __node, argument 210 : _M_cur_node(__node), _M_cur_bucket(__bucket) { }
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/ |
H A D | hashtable_policy.h | 208 _Hashtable_iterator_base(_Hash_node<_Value, __cache>* __node, argument 210 : _M_cur_node(__node), _M_cur_bucket(__bucket) { }
|