Searched refs:__node (Results 1 - 4 of 4) sorted by relevance

/haiku/headers/cpp/
H A Dstl_slist.h46 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 Dstl_deque.h1072 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 Dstl_tree.h1257 __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/src/libs/compat/openbsd_wlan/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, __lef
[all...]

Completed in 90 milliseconds