HomeSort by relevance Sort by last modified time
    Searched full:__node (Results 1 - 25 of 173) sorted by null

1 2 3 4 5 6 7

  /prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/
_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) {
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;
    [all...]
_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);
_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...]
_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;
  /prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/
_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) {
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;
    [all...]
_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);
_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...]
_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;
  /prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/
_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) {
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;
    [all...]
_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);
_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...]
_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;
  /external/mesa3d/src/compiler/glsl/
list.h 663 #define foreach_in_list_safe(__type, __node, __list) \
664 for (__type *__node = (__type *)(__list)->head_sentinel.next, \
665 *__next = (__type *)__node->next; \
667 __node = __next, __next = (__type *)__next->next)
669 #define foreach_in_list_reverse_safe(__type, __node, __list) \
670 for (__type *__node = (__type *)(__list)->tail_sentinel.prev, \
671 *__prev = (__type *)__node->prev; \
673 __node = __prev, __prev = (__type *)__prev->prev)
696 #define foreach_list_typed(__type, __node, __field, __list) \
697 for (__type * __node =
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/
slist 81 const _Slist_node_base* __node)
83 while (__head && __head->_M_next != __node)
90 const _Slist_node_base* __node)
92 while (__head && __head->_M_next != __node)
126 __slist_reverse(_Slist_node_base* __node)
128 _Slist_node_base* __result = __node;
129 __node = __node->_M_next;
131 while(__node)
133 _Slist_node_base* __next = __node->_M_next
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/
slist 81 const _Slist_node_base* __node)
83 while (__head && __head->_M_next != __node)
90 const _Slist_node_base* __node)
92 while (__head && __head->_M_next != __node)
126 __slist_reverse(_Slist_node_base* __node)
128 _Slist_node_base* __result = __node;
129 __node = __node->_M_next;
131 while(__node)
133 _Slist_node_base* __next = __node->_M_next
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/
slist 81 const _Slist_node_base* __node)
83 while (__head && __head->_M_next != __node)
90 const _Slist_node_base* __node)
92 while (__head && __head->_M_next != __node)
126 __slist_reverse(_Slist_node_base* __node)
128 _Slist_node_base* __result = __node;
129 __node = __node->_M_next;
131 while(__node)
133 _Slist_node_base* __next = __node->_M_next
    [all...]
  /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/
slist 81 const _Slist_node_base* __node)
83 while (__head && __head->_M_next != __node)
90 const _Slist_node_base* __node)
92 while (__head && __head->_M_next != __node)
126 __slist_reverse(_Slist_node_base* __node)
128 _Slist_node_base* __result = __node;
129 __node = __node->_M_next;
131 while(__node)
133 _Slist_node_base* __next = __node->_M_next
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/
slist 81 const _Slist_node_base* __node)
83 while (__head && __head->_M_next != __node)
90 const _Slist_node_base* __node)
92 while (__head && __head->_M_next != __node)
126 __slist_reverse(_Slist_node_base* __node)
128 _Slist_node_base* __result = __node;
129 __node = __node->_M_next;
131 while(__node)
133 _Slist_node_base* __next = __node->_M_next
    [all...]
  /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/
slist 81 const _Slist_node_base* __node)
83 while (__head && __head->_M_next != __node)
90 const _Slist_node_base* __node)
92 while (__head && __head->_M_next != __node)
126 __slist_reverse(_Slist_node_base* __node)
128 _Slist_node_base* __result = __node;
129 __node = __node->_M_next;
131 while(__node)
133 _Slist_node_base* __next = __node->_M_next
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/profile/
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);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/profile/
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);
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/profile/
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);
  /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/
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);
  /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/
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);
  /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/
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);

Completed in 586 milliseconds

1 2 3 4 5 6 7