Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/libstdc++/include/ext/
H A Dslist132 __node = __node->_M_next;
134 while(__node)
138 __result = __node;
139 __node = __next;
148 for (; __node != 0; __node = __node->_M_next)
340 return __node;
357 return __node;
763 __prev = __node;
764 __node = (_Node*) __node->_M_next;
784 __prev = __node;
[all …]
/freebsd-12.1/contrib/libstdc++/src/
H A Dtree.cc418 _Rb_tree_black_count(const _Rb_tree_node_base* __node, in _Rb_tree_black_count() argument
421 if (__node == 0) in _Rb_tree_black_count()
426 if (__node->_M_color == _S_black) in _Rb_tree_black_count()
428 if (__node == __root) in _Rb_tree_black_count()
430 __node = __node->_M_parent; in _Rb_tree_black_count()
/freebsd-12.1/contrib/libstdc++/include/bits/
H A Ddeque.tcc641 for (_Map_pointer __node = __first._M_node + 1; in _M_destroy_data_aux() local
642 __node < __last._M_node; ++__node) in _M_destroy_data_aux()
643 std::_Destroy(*__node, *__node + _S_buffer_size(), in _M_destroy_data_aux()
763 for (typename _Self::_Map_pointer __node = __first._M_node + 1; in fill() local
764 __node < __last._M_node; ++__node) in fill()
765 std::fill(*__node, *__node + _Self::_S_buffer_size(), __value); in fill()
H A Dstl_tree.h1533 _Rb_tree_black_count(const _Rb_tree_node_base* __node,
/freebsd-12.1/contrib/libevent/WIN32-Code/
H A Dtree.h205 struct type __node, *__left, *__right, *__tmp; \
208 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
209 __left = __right = &__node; \
234 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
242 struct type __node, *__left, *__right, *__tmp; \
244 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
245 __left = __right = &__node; \
270 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
/freebsd-12.1/contrib/ntp/sntp/libevent/WIN32-Code/
H A Dtree.h205 struct type __node, *__left, *__right, *__tmp; \
208 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
209 __left = __right = &__node; \
234 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
242 struct type __node, *__left, *__right, *__tmp; \
244 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
245 __left = __right = &__node; \
270 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
/freebsd-12.1/crypto/openssh/openbsd-compat/
H A Dsys-tree.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); \
/freebsd-12.1/contrib/ipfilter/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); \
/freebsd-12.1/sys/sys/
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); \
/freebsd-12.1/contrib/libc++/include/
H A Dforward_list213 typename pointer_traits<_NodePtr>::element_type>::type __node;
369 typedef typename __traits::__node __node;
454 typedef __forward_list_node<value_type, void_pointer> __node;
630 typedef typename base::__node __node;
896 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
918 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
1125 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1141 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1155 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1373 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
[all …]
H A D__hash_table371 : __node_(__node)
378 : __node_(__node)
487 : __node_(__node)
494 : __node_(__node)
601 : __node_(__node),
613 : __node_(__node),
742 : __node_(__node),
754 : __node_(__node),
922 // Create __node
2302 static_assert(is_same<__node, typename _Table::__node>::value, "");
[all …]
H A Dregex1333 const __node<_CharT>* __node_;
1343 // __node
1346 class __node
1348 __node(const __node&);
1349 __node& operator=(const __node&);
1354 __node() {}
1356 virtual ~__node() {}
1368 : public __node<_CharT>
1390 : public __node<_CharT>
1392 __node<_CharT>* __first_;
[all …]
H A Dmap952 typedef __map_node_handle<typename __base::__node, allocator_type> node_type;
1451 typedef typename __base::__node __node;
1458 typedef unique_ptr<__node, _Dp> __node_holder;
1688 typedef __map_node_handle<typename __base::__node, allocator_type> node_type;
2082 typedef typename __base::__node __node;
2087 typedef unique_ptr<__node, _Dp> __node_holder;
H A Dunordered_map875 typedef typename __table::__node __node;
877 typedef unique_ptr<__node, _Dp> __node_holder;
894 typedef __map_node_handle<__node, allocator_type> node_type;
1703 typedef typename __table::__node __node;
1705 typedef unique_ptr<__node, _Dp> __node_holder;
1722 typedef __map_node_handle<__node, allocator_type> node_type;
H A Dlist551 typedef __list_node<value_type, __void_pointer> __node;
552 typedef typename __rebind_alloc_helper<__alloc_traits, __node>::type __node_allocator;
838 typedef typename base::__node __node;
1104 typedef unique_ptr<__node, __node_destructor> __hold_pointer;
H A Dset476 typedef __set_node_handle<typename __base::__node, allocator_type> node_type;
964 typedef __set_node_handle<typename __base::__node, allocator_type> node_type;
H A Dunordered_set413 typedef __set_node_handle<typename __table::__node, allocator_type> node_type;
1013 typedef __set_node_handle<typename __table::__node, allocator_type> node_type;
H A D__tree998 typedef typename _NodeTypes::__node_type __node;
1010 typedef typename __rebind_alloc_helper<__alloc_traits, __node>::type __node_allocator;
1441 typedef unique_ptr<__node, _Dp> __node_holder;
/freebsd-12.1/contrib/libc++/include/ext/
H A Dhash_map494 typedef typename __table::__node __node;
496 typedef unique_ptr<__node, _Dp> __node_holder;
766 typedef typename __table::__node __node;
768 typedef unique_ptr<__node, _Dp> __node_holder;
/freebsd-12.1/contrib/libstdc++/include/tr1/
H A Dhashtable_policy.h317 _Hashtable_iterator_base(_Hash_node<_Value, __cache>* __node, in _GLIBCXX_BEGIN_NAMESPACE()
319 : _M_cur_node(__node), _M_cur_bucket(__bucket) { } in _GLIBCXX_BEGIN_NAMESPACE()