Searched refs:__node (Results 1 - 10 of 10) sorted by relevance
/external/stlport/stlport/stl/ |
H A D | _slist_base.c | 40 const _Slist_node_base* __node) { 41 while (__head && __head->_M_next != __node) 74 _Sl_global<_Dummy>::__reverse(_Slist_node_base* __node) { argument 75 _Slist_node_base* __result = __node; 76 __node = __node->_M_next; 78 while(__node) { 79 _Slist_node_base* __next = __node->_M_next; 80 __node->_M_next = __result; 81 __result = __node; 39 __previous(_Slist_node_base* __head, const _Slist_node_base* __node) argument 89 size(_Slist_node_base* __node) argument [all...] |
H A D | _slist_base.h | 56 static size_t _STLP_CALL size(_Slist_node_base* __node); 57 static _Slist_node_base* _STLP_CALL __reverse(_Slist_node_base* __node); 65 const _Slist_node_base* __node); 67 const _Slist_node_base* __node) { 68 return _Sl_global<_Dummy>::__previous(__CONST_CAST(_Slist_node_base*, __head), __node); 66 __previous(const _Slist_node_base* __head, const _Slist_node_base* __node) argument
|
H A D | _slist.c | 93 _Node_base* __node = this->_M_head._M_data._M_next; local 94 for ( ; __node != 0 && __n > 0 ; --__n) { 95 __STATIC_CAST(_Node*, __node)->_M_data = __val; 96 __prev = __node; 97 __node = __node->_M_next;
|
H A D | _slist.h | 254 _Node* __node = this->_M_head.allocate(1); local 256 _Copy_Construct(&__node->_M_data, __x); 257 __node->_M_next = 0; 259 _STLP_UNWIND(this->_M_head.deallocate(__node, 1)) 260 return __node; 265 _Node* __node = this->_M_head.allocate(1); local 267 _STLP_STD::_Construct(&__node->_M_data); 268 __node->_M_next = 0; 270 _STLP_UNWIND(this->_M_head.deallocate(__node, 1)) 271 return __node; 390 _Node_base* __node = this->_M_head._M_data._M_next; local 452 _Node* __node = __STATIC_CAST(_Node*, this->_M_head._M_data._M_next); local [all...] |
H A D | _tree.c | 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) { argument 669 if (__node == 0) 672 int __bc = __node->_M_color == _S_rb_tree_black ? 1 : 0; 673 if (__node == __root) 676 return __bc + __black_count(__node->_M_parent, __root);
|
H A D | _deque.c | 347 for (_Map_pointer __node = this->_M_start._M_node + 1; 348 __node < this->_M_finish._M_node; 349 ++__node) { 350 _STLP_STD::_Destroy_Range(*__node, *__node + this->buffer_size()); 351 this->_M_map_size.deallocate(*__node, this->buffer_size());
|
/external/chromium_org/third_party/mesa/src/src/glsl/ |
H A D | list.h | 474 #define foreach_list_safe(__node, __list) \ 475 for (exec_node * __node = (__list)->head, * __next = __node->next \ 477 ; __node = __next, __next = __next->next) 479 #define foreach_list(__node, __list) \ 480 for (exec_node * __node = (__list)->head \ 481 ; (__node)->next != NULL \ 482 ; (__node) = (__node)->next) 484 #define foreach_list_const(__node, __lis [all...] |
/external/mesa3d/src/glsl/ |
H A D | list.h | 474 #define foreach_list_safe(__node, __list) \ 475 for (exec_node * __node = (__list)->head, * __next = __node->next \ 477 ; __node = __next, __next = __next->next) 479 #define foreach_list(__node, __list) \ 480 for (exec_node * __node = (__list)->head \ 481 ; (__node)->next != NULL \ 482 ; (__node) = (__node)->next) 484 #define foreach_list_const(__node, __lis [all...] |
/external/chromium_org/third_party/bsdtrees/ |
H A D | tree.h | 205 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, __lef [all...] |
/external/qemu/ |
H A D | sys-tree.h | 216 SYS_TREE_STRUCT type __node, *__left, *__right, *__tmp; \ 219 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\ 220 __left = __right = &__node; \ 245 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \ 253 SYS_TREE_STRUCT type __node, *__left, *__right, *__tmp; \ 255 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\ 256 __left = __right = &__node; \ 281 SPLAY_ASSEMBLE(head, &__node, __lef [all...] |
Completed in 247 milliseconds