Home
last modified time | relevance | path

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

/openbsd/gnu/lib/libstdc++/libstdc++/include/ext/
H A Dslist128 __node = __node->_M_next;
130 while(__node) {
133 __result = __node;
134 __node = __next;
142 for ( ; __node != 0; __node = __node->_M_next)
342 return __node;
356 return __node;
672 __prev = __node;
673 __node = (_Node*) __node->_M_next;
690 __prev = __node;
[all …]
/openbsd/gnu/gcc/libstdc++-v3/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 …]
/openbsd/gnu/gcc/libstdc++-v3/src/
H A Dtree.cc414 _Rb_tree_black_count(const _Rb_tree_node_base* __node, in _Rb_tree_black_count() argument
417 if (__node == 0) in _Rb_tree_black_count()
422 if (__node->_M_color == _S_black) in _Rb_tree_black_count()
424 if (__node == __root) in _Rb_tree_black_count()
426 __node = __node->_M_parent; in _Rb_tree_black_count()
/openbsd/gnu/gcc/libstdc++-v3/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.h1514 _Rb_tree_black_count(const _Rb_tree_node_base* __node,
/openbsd/gnu/lib/libstdc++/libstdc++/include/bits/
H A Ddeque.tcc167 for (_Map_pointer __node = _M_start._M_node + 1; in clear() local
168 __node < _M_finish._M_node; in clear()
169 ++__node) in clear()
171 _Destroy(*__node, *__node + _S_buffer_size()); in clear()
172 _M_deallocate_node(*__node); in clear()
H A Dstl_tree.h1407 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) in __black_count() argument
1409 if (__node == 0) in __black_count()
1414 if (__node->_M_color == _M_black) in __black_count()
1416 if (__node == __root) in __black_count()
1418 __node = __node->_M_parent; in __black_count()
/openbsd/sys/sys/
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); \
/openbsd/gnu/llvm/libcxx/include/
H A Dforward_list246 typename pointer_traits<_NodePtr>::element_type> __node;
390 typedef typename __traits::__node __node;
475 typedef __forward_list_node<value_type, void_pointer> __node;
653 typedef typename base::__node __node;
918 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
940 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));
1161 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1375 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
[all …]
H A Dregex1427 const __node<_CharT>* __node_;
1437 // __node
1440 class __node
1442 __node(const __node&);
1443 __node& operator=(const __node&);
1448 __node() {}
1450 virtual ~__node() {}
1462 : public __node<_CharT>
1484 : public __node<_CharT>
1486 __node<_CharT>* __first_;
[all …]
H A D__hash_table370 : __node_(__node)
484 : __node_(__node)
594 : __node_(__node),
622 typedef typename __pointer_traits::element_type __node;
623 typedef __remove_const_t<__node> __non_const_node;
898 // Create __node
900 typedef typename _NodeTypes::__node_type __node;
901 typedef __rebind_alloc<__alloc_traits, __node> __node_allocator;
1196 typedef unique_ptr<__node, _Dp> __node_holder;
2153 static_assert(is_same<__node, typename _Table::__node>::value, "");
[all …]
H A Dmap1024 typedef __map_node_handle<typename __base::__node, allocator_type> node_type;
1538 typedef typename __base::__node __node;
1545 typedef unique_ptr<__node, _Dp> __node_holder;
1804 typedef __map_node_handle<typename __base::__node, allocator_type> node_type;
2213 typedef typename __base::__node __node;
2218 typedef unique_ptr<__node, _Dp> __node_holder;
H A Dunordered_map1056 typedef typename __table::__node __node;
1058 typedef unique_ptr<__node, _Dp> __node_holder;
1079 typedef __map_node_handle<__node, allocator_type> node_type;
1947 typedef typename __table::__node __node;
1949 typedef unique_ptr<__node, _Dp> __node_holder;
1971 typedef __map_node_handle<__node, allocator_type> node_type;
H A Dlist553 typedef __list_node<value_type, __void_pointer> __node;
554 typedef __rebind_alloc<__alloc_traits, __node> __node_allocator;
815 typedef typename base::__node __node;
1093 typedef unique_ptr<__node, __node_destructor> __hold_pointer;
H A Dset551 typedef __set_node_handle<typename __base::__node, allocator_type> node_type;
1088 typedef __set_node_handle<typename __base::__node, allocator_type> node_type;
H A D__tree1024 typedef typename _NodeTypes::__node_type __node;
1036 typedef __rebind_alloc<__alloc_traits, __node> __node_allocator;
1432 typedef unique_ptr<__node, _Dp> __node_holder;
H A Dunordered_set539 typedef __set_node_handle<typename __table::__node, allocator_type> node_type;
1195 typedef __set_node_handle<typename __table::__node, allocator_type> node_type;
/openbsd/gnu/llvm/libcxx/include/ext/
H A Dhash_map497 typedef typename __table::__node __node;
499 typedef std::unique_ptr<__node, _Dp> __node_holder;
768 typedef typename __table::__node __node;
770 typedef std::unique_ptr<__node, _Dp> __node_holder;
/openbsd/gnu/gcc/libstdc++-v3/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()