| /external/openssh/openbsd-compat/ |
| 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);
[all...] |
| /external/qemu/ |
| 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);
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| forward_list.h | 334 typename _Node::_Pointer __node = this->_M_get_node(); local
337 _M_get_Node_allocator().construct(__node,
339 __node->_M_next = 0;
343 this->_M_put_node(__node);
346 return __node;
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| forward_list.h | 345 _Node* __node = this->_M_get_node(); local
348 _M_get_Node_allocator().construct(__node,
350 __node->_M_next = 0;
354 this->_M_put_node(__node);
357 return __node;
[all...] |
| hashtable_policy.h | 217 _Hashtable_iterator_base(_Hash_node<_Value, __cache>* __node,
219 : _M_cur_node(__node), _M_cur_bucket(__bucket) { }
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| forward_list.h | 345 _Node* __node = this->_M_get_node(); local
348 _M_get_Node_allocator().construct(__node,
350 __node->_M_next = 0;
354 this->_M_put_node(__node);
357 return __node;
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| forward_list.h | 334 typename _Node::_Pointer __node = this->_M_get_node(); local
337 _M_get_Node_allocator().construct(__node,
339 __node->_M_next = 0;
343 this->_M_put_node(__node);
346 return __node;
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| forward_list.h | 334 typename _Node::_Pointer __node = this->_M_get_node(); local
337 _M_get_Node_allocator().construct(__node,
339 __node->_M_next = 0;
343 this->_M_put_node(__node);
346 return __node;
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| forward_list.h | 334 typename _Node::_Pointer __node = this->_M_get_node(); local
337 _M_get_Node_allocator().construct(__node,
339 __node->_M_next = 0;
343 this->_M_put_node(__node);
346 return __node;
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| forward_list.h | 334 typename _Node::_Pointer __node = this->_M_get_node(); local
337 _M_get_Node_allocator().construct(__node,
339 __node->_M_next = 0;
343 this->_M_put_node(__node);
346 return __node;
[all...] |
| /external/stlport/stlport/stl/ |
| _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());
|
| _tree.c | 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) {
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);
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _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());
|
| _tree.c | 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) {
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);
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _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());
|
| _tree.c | 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) {
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);
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _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());
|
| _tree.c | 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) {
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);
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _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());
|
| _tree.c | 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) {
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);
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _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());
|
| _tree.c | 668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) {
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);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/ |
| hashtable_policy.h | 208 _Hashtable_iterator_base(_Hash_node<_Value, __cache>* __node,
210 : _M_cur_node(__node), _M_cur_bucket(__bucket) { }
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/ |
| hashtable_policy.h | 208 _Hashtable_iterator_base(_Hash_node<_Value, __cache>* __node,
210 : _M_cur_node(__node), _M_cur_bucket(__bucket) { }
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| hashtable_policy.h | 242 _Hashtable_iterator_base(_Hash_node<_Value, __cache>* __node,
244 : _M_cur_node(__node), _M_cur_bucket(__bucket) { }
|
