| /external/stlport/stlport/stl/ |
| D | _slist_base.c | 40 const _Slist_node_base* __node) { in __previous() argument
41 while (__head && __head->_M_next != __node) in __previous()
74 _Sl_global<_Dummy>::__reverse(_Slist_node_base* __node) { in __reverse() argument
75 _Slist_node_base* __result = __node; in __reverse()
76 __node = __node->_M_next; in __reverse()
78 while(__node) { in __reverse()
79 _Slist_node_base* __next = __node->_M_next; in __reverse()
80 __node->_M_next = __result; in __reverse()
81 __result = __node; in __reverse()
82 __node = __next; in __reverse()
[all …]
|
| 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) { in __previous() argument
68 return _Sl_global<_Dummy>::__previous(__CONST_CAST(_Slist_node_base*, __head), __node); in __previous()
|
| D | _slist.h | 254 _Node* __node = this->_M_head.allocate(1);
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);
267 _STLP_STD::_Construct(&__node->_M_data);
268 __node->_M_next = 0;
270 _STLP_UNWIND(this->_M_head.deallocate(__node, 1))
271 return __node;
[all …]
|
| D | _slist.c | 93 _Node_base* __node = this->_M_head._M_data._M_next; in _M_fill_assign() local
94 for ( ; __node != 0 && __n > 0 ; --__n) { in _M_fill_assign()
95 __STATIC_CAST(_Node*, __node)->_M_data = __val; in _M_fill_assign()
96 __prev = __node; in _M_fill_assign()
97 __node = __node->_M_next; in _M_fill_assign()
|
| D | _tree.c | 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) { in __black_count() argument
669 if (__node == 0) in __black_count()
672 int __bc = __node->_M_color == _S_rb_tree_black ? 1 : 0; in __black_count()
673 if (__node == __root) in __black_count()
676 return __bc + __black_count(__node->_M_parent, __root); in __black_count()
|
| D | _deque.c | 347 for (_Map_pointer __node = this->_M_start._M_node + 1; in clear() local
348 __node < this->_M_finish._M_node; in clear()
349 ++__node) { in clear()
350 _STLP_STD::_Destroy_Range(*__node, *__node + this->buffer_size()); in clear()
351 this->_M_map_size.deallocate(*__node, this->buffer_size()); in clear()
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| D | list.h | 474 #define foreach_list_safe(__node, __list) \ argument
475 for (exec_node * __node = (__list)->head, * __next = __node->next \
477 ; __node = __next, __next = __next->next)
479 #define foreach_list(__node, __list) \ argument
480 for (exec_node * __node = (__list)->head \
481 ; (__node)->next != NULL \
482 ; (__node) = (__node)->next)
484 #define foreach_list_const(__node, __list) \ argument
485 for (const exec_node * __node = (__list)->head \
486 ; (__node)->next != NULL \
[all …]
|
| /external/mesa3d/src/glsl/ |
| D | list.h | 474 #define foreach_list_safe(__node, __list) \ argument
475 for (exec_node * __node = (__list)->head, * __next = __node->next \
477 ; __node = __next, __next = __next->next)
479 #define foreach_list(__node, __list) \ argument
480 for (exec_node * __node = (__list)->head \
481 ; (__node)->next != NULL \
482 ; (__node) = (__node)->next)
484 #define foreach_list_const(__node, __list) \ argument
485 for (const exec_node * __node = (__list)->head \
486 ; (__node)->next != NULL \
[all …]
|
| /external/openssh/openbsd-compat/ |
| D | sys-tree.h | 207 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); \
|
| /external/qemu/ |
| 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, __left, __right, field); \
|