| /haiku-buildtools/legacy/gcc/libstdc++/stl/ |
| H A D | stl_slist.h | 46 const _Slist_node_base* __node)
48 while (__head && __head->_M_next != __node)
55 const _Slist_node_base* __node)
57 while (__head && __head->_M_next != __node)
75 inline _Slist_node_base* __slist_reverse(_Slist_node_base* __node) argument
77 _Slist_node_base* __result = __node;
78 __node = __node->_M_next;
80 while(__node) {
81 _Slist_node_base* __next = __node
45 __slist_previous(_Slist_node_base* __head, const _Slist_node_base* __node) argument
54 __slist_previous(const _Slist_node_base* __head, const _Slist_node_base* __node) argument
89 __slist_size(_Slist_node_base* __node) argument
325 _Node* __node = _M_get_node(); local
335 _Node* __node = _M_get_node(); local
443 _Node* __node = (_Node*) _M_head._M_next; local
709 _Node* __node = (_Node*) _M_head._M_next; local
729 _Node* __node = (_Node*) _M_head._M_next; local
[all...] |
| H A D | stl_deque.h | 1072 for (_Map_pointer __node = _M_start._M_node + 1;
1073 __node < _M_finish._M_node;
1074 ++__node) {
1075 destroy(*__node, *__node + _S_buffer_size());
1076 _M_deallocate_node(*__node);
|
| H A D | stl_tree.h | 1257 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) argument
1259 if (__node == 0)
1262 int __bc = __node->_M_color == _S_rb_tree_black ? 1 : 0;
1263 if (__node == __root)
1266 return __bc + __black_count(__node->_M_parent, __root);
|
| /haiku-buildtools/gcc/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
|
| /haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
| H A D | hashtable.h | 1450 _M_insert_bucket_begin(size_type __bkt, __node_type* __node) argument
1456 __node->_M_nxt = _M_buckets[__bkt]->_M_nxt;
1457 _M_buckets[__bkt]->_M_nxt = __node;
1464 __node->_M_nxt = _M_before_begin._M_nxt;
1465 _M_before_begin._M_nxt = __node;
1466 if (__node->_M_nxt)
1469 _M_buckets[_M_bucket_index(__node->_M_next())] = __node;
1526 __node_type* __node = this->_M_allocate_node(std::forward<_Args>(__args)...); local
1527 const key_type& __k = this->_M_extract()(__node
1564 __node_type* __node = local
1725 __node_type* __node = __node_gen(std::forward<_Arg>(__v)); local
[all...] |
| H A D | stl_tree.h | 394 _Link_type __node = static_cast<_Link_type>(_M_extract());
395 if (__node)
397 _M_t._M_destroy_node(__node);
398 _M_t._M_construct_node(__node, _GLIBCXX_FORWARD(_Arg, __arg));
399 return __node;
412 _Base_ptr __node = _M_nodes;
416 if (_M_nodes->_M_right == __node)
431 else // __node is on the left.
437 return __node;
499 _M_construct_node(_Link_type __node, cons
[all...] |
| H A D | stl_list.h | 434 auto* const __node = std::__addressof(_M_impl._M_node);
435 __node->_M_next = __xnode->_M_next;
436 __node->_M_prev = __xnode->_M_prev;
437 __node->_M_next->_M_prev = __node->_M_prev->_M_next = __node;
|
| H A D | forward_list.h | 345 _Node* __node = this->_M_get_node();
350 ::new ((void*)__node) _Node;
351 _Alloc_traits::construct(__a, __node->_M_valptr(),
356 this->_M_put_node(__node);
359 return __node;
|
| H A D | hashtable_policy.h | 137 __node_type* __node = _M_nodes; local
139 __node->_M_nxt = nullptr;
141 __value_alloc_traits::destroy(__a, __node->_M_valptr());
144 __value_alloc_traits::construct(__a, __node->_M_valptr(),
149 __node->~__node_type();
151 __node, 1);
154 return __node;
|
| /haiku-buildtools/gcc/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;
|
| /haiku-buildtools/gcc/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) { }
|