Home
last modified time | relevance | path

Searched refs:__node (Results 1 – 25 of 43) sorted by relevance

12

/OK3568_Linux_fs/kernel/arch/sparc/include/asm/
H A Dmdesc.h24 #define mdesc_for_each_node_by_name(__hdl, __node, __name) \ argument
25 for (__node = mdesc_node_by_name(__hdl, MDESC_NODE_NULL, __name); \
26 (__node) != MDESC_NODE_NULL; \
27 __node = mdesc_node_by_name(__hdl, __node, __name))
57 #define mdesc_for_each_arc(__arc, __hdl, __node, __type) \ argument
58 for (__arc = mdesc_next_arc(__hdl, __node, __type); \
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/
H A Dslist74 const _Slist_node_base* __node)
76 while (__head && __head->_M_next != __node)
83 const _Slist_node_base* __node)
85 while (__head && __head->_M_next != __node)
119 __slist_reverse(_Slist_node_base* __node)
121 _Slist_node_base* __result = __node;
122 __node = __node->_M_next;
124 while(__node)
126 _Slist_node_base* __next = __node->_M_next;
127 __node->_M_next = __result;
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/
H A Dslist74 const _Slist_node_base* __node)
76 while (__head && __head->_M_next != __node)
83 const _Slist_node_base* __node)
85 while (__head && __head->_M_next != __node)
119 __slist_reverse(_Slist_node_base* __node)
121 _Slist_node_base* __result = __node;
122 __node = __node->_M_next;
124 while(__node)
126 _Slist_node_base* __next = __node->_M_next;
127 __node->_M_next = __result;
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/bits/
H A Ddeque.tcc859 for (_Map_pointer __node = __first._M_node + 1; in _M_insert_aux() local
860 __node < __last._M_node; ++__node) in _M_insert_aux()
861 std::_Destroy(*__node, *__node + _S_buffer_size(), in _M_insert_aux()
987 for (typename _Iter::_Map_pointer __node = __first._M_node + 1; in _M_insert_aux() local
988 __node < __last._M_node; ++__node) in _M_insert_aux()
989 std::__fill_a1(*__node, *__node + _Iter::_S_buffer_size(), __value); in _M_insert_aux()
1011 for (typename _Iter::_Map_pointer __node = __first._M_node + 1; in _M_insert_aux() local
1012 __node != __last._M_node; ++__node) in _M_insert_aux()
1014 = std::__copy_move_a1<_IsMove>(*__node, in _M_insert_aux()
1015 *__node + _Iter::_S_buffer_size(), in _M_insert_aux()
[all …]
H A Dhashtable.h1632 _M_insert_bucket_begin(size_type __bkt, __node_type* __node) in _GLIBCXX_VISIBILITY()
1638 __node->_M_nxt = _M_buckets[__bkt]->_M_nxt; in _GLIBCXX_VISIBILITY()
1639 _M_buckets[__bkt]->_M_nxt = __node; in _GLIBCXX_VISIBILITY()
1646 __node->_M_nxt = _M_before_begin._M_nxt; in _GLIBCXX_VISIBILITY()
1647 _M_before_begin._M_nxt = __node; in _GLIBCXX_VISIBILITY()
1648 if (__node->_M_nxt) in _GLIBCXX_VISIBILITY()
1651 _M_buckets[_M_bucket_index(__node->_M_next())] = __node; in _GLIBCXX_VISIBILITY()
1708 _Scoped_node __node { this, std::forward<_Args>(__args)... }; in _GLIBCXX_VISIBILITY()
1709 const key_type& __k = this->_M_extract()(__node._M_node->_M_v()); in _GLIBCXX_VISIBILITY()
1717 auto __pos = _M_insert_unique_node(__k, __bkt, __code, __node._M_node); in _GLIBCXX_VISIBILITY()
[all …]
H A Dforward_list.tcc375 _Node_base* __node = &this->_M_impl._M_head; in merge() local
376 while (__node->_M_next && __list._M_impl._M_head._M_next) in merge()
381 (__node->_M_next)->_M_valptr())) in merge()
382 __node->_M_transfer_after(&__list._M_impl._M_head, in merge()
384 __node = __node->_M_next; in merge()
388 *__node = std::move(__list._M_impl._M_head); in merge()
H A Dhashtable_policy.h126 __node_type* __node = _M_nodes; in _GLIBCXX_VISIBILITY() local
128 __node->_M_nxt = nullptr; in _GLIBCXX_VISIBILITY()
130 __node_alloc_traits::destroy(__a, __node->_M_valptr()); in _GLIBCXX_VISIBILITY()
133 __node_alloc_traits::construct(__a, __node->_M_valptr(), in _GLIBCXX_VISIBILITY()
138 _M_h._M_deallocate_node_ptr(__node); in _GLIBCXX_VISIBILITY()
141 return __node; in _GLIBCXX_VISIBILITY()
709 if (__node_type* __node = __h->_M_find_node(__bkt, __k, __code)) in _GLIBCXX_VISIBILITY()
710 return __node->_M_v().second; in _GLIBCXX_VISIBILITY()
712 typename __hashtable::_Scoped_node __node { in _GLIBCXX_VISIBILITY()
719 = __h->_M_insert_unique_node(__k, __bkt, __code, __node._M_node); in _GLIBCXX_VISIBILITY()
[all …]
H A Dstl_tree.h487 _Link_type __node = static_cast<_Link_type>(_M_extract()); in _GLIBCXX_VISIBILITY()
488 if (__node) in _GLIBCXX_VISIBILITY()
490 _M_t._M_destroy_node(__node); in _GLIBCXX_VISIBILITY()
491 _M_t._M_construct_node(__node, _GLIBCXX_FORWARD(_Arg, __arg)); in _GLIBCXX_VISIBILITY()
492 return __node; in _GLIBCXX_VISIBILITY()
505 _Base_ptr __node = _M_nodes; in _GLIBCXX_VISIBILITY()
509 if (_M_nodes->_M_right == __node) in _GLIBCXX_VISIBILITY()
530 return __node; in _GLIBCXX_VISIBILITY()
592 _M_construct_node(_Link_type __node, const value_type& __x) in _GLIBCXX_VISIBILITY()
595 { get_allocator().construct(__node->_M_valptr(), __x); } in _GLIBCXX_VISIBILITY()
[all …]
H A Dforward_list.h360 _Node* __node = this->_M_get_node(); in _GLIBCXX_VISIBILITY() local
363 ::new ((void*)__node) _Node; in _GLIBCXX_VISIBILITY()
365 __node->_M_valptr(), in _GLIBCXX_VISIBILITY()
370 this->_M_put_node(__node); in _GLIBCXX_VISIBILITY()
373 return __node; in _GLIBCXX_VISIBILITY()
H A Dstl_list.h136 _List_node_base* const __node = this->_M_base(); in _GLIBCXX_VISIBILITY() local
137 __node->_M_next = __xnode->_M_next; in _GLIBCXX_VISIBILITY()
138 __node->_M_prev = __xnode->_M_prev; in _GLIBCXX_VISIBILITY()
139 __node->_M_next->_M_prev = __node->_M_prev->_M_next = __node; in _GLIBCXX_VISIBILITY()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/bits/
H A Ddeque.tcc859 for (_Map_pointer __node = __first._M_node + 1; in _M_insert_aux() local
860 __node < __last._M_node; ++__node) in _M_insert_aux()
861 std::_Destroy(*__node, *__node + _S_buffer_size(), in _M_insert_aux()
987 for (typename _Iter::_Map_pointer __node = __first._M_node + 1; in _M_insert_aux() local
988 __node < __last._M_node; ++__node) in _M_insert_aux()
989 std::__fill_a1(*__node, *__node + _Iter::_S_buffer_size(), __value); in _M_insert_aux()
1011 for (typename _Iter::_Map_pointer __node = __first._M_node + 1; in _M_insert_aux() local
1012 __node != __last._M_node; ++__node) in _M_insert_aux()
1014 = std::__copy_move_a1<_IsMove>(*__node, in _M_insert_aux()
1015 *__node + _Iter::_S_buffer_size(), in _M_insert_aux()
[all …]
H A Dhashtable.h1632 _M_insert_bucket_begin(size_type __bkt, __node_type* __node) in _GLIBCXX_VISIBILITY()
1638 __node->_M_nxt = _M_buckets[__bkt]->_M_nxt; in _GLIBCXX_VISIBILITY()
1639 _M_buckets[__bkt]->_M_nxt = __node; in _GLIBCXX_VISIBILITY()
1646 __node->_M_nxt = _M_before_begin._M_nxt; in _GLIBCXX_VISIBILITY()
1647 _M_before_begin._M_nxt = __node; in _GLIBCXX_VISIBILITY()
1648 if (__node->_M_nxt) in _GLIBCXX_VISIBILITY()
1651 _M_buckets[_M_bucket_index(__node->_M_next())] = __node; in _GLIBCXX_VISIBILITY()
1708 _Scoped_node __node { this, std::forward<_Args>(__args)... }; in _GLIBCXX_VISIBILITY()
1709 const key_type& __k = this->_M_extract()(__node._M_node->_M_v()); in _GLIBCXX_VISIBILITY()
1717 auto __pos = _M_insert_unique_node(__k, __bkt, __code, __node._M_node); in _GLIBCXX_VISIBILITY()
[all …]
H A Dforward_list.tcc375 _Node_base* __node = &this->_M_impl._M_head; in merge() local
376 while (__node->_M_next && __list._M_impl._M_head._M_next) in merge()
381 (__node->_M_next)->_M_valptr())) in merge()
382 __node->_M_transfer_after(&__list._M_impl._M_head, in merge()
384 __node = __node->_M_next; in merge()
388 *__node = std::move(__list._M_impl._M_head); in merge()
H A Dhashtable_policy.h126 __node_type* __node = _M_nodes; in _GLIBCXX_VISIBILITY() local
128 __node->_M_nxt = nullptr; in _GLIBCXX_VISIBILITY()
130 __node_alloc_traits::destroy(__a, __node->_M_valptr()); in _GLIBCXX_VISIBILITY()
133 __node_alloc_traits::construct(__a, __node->_M_valptr(), in _GLIBCXX_VISIBILITY()
138 _M_h._M_deallocate_node_ptr(__node); in _GLIBCXX_VISIBILITY()
141 return __node; in _GLIBCXX_VISIBILITY()
709 if (__node_type* __node = __h->_M_find_node(__bkt, __k, __code)) in _GLIBCXX_VISIBILITY()
710 return __node->_M_v().second; in _GLIBCXX_VISIBILITY()
712 typename __hashtable::_Scoped_node __node { in _GLIBCXX_VISIBILITY()
719 = __h->_M_insert_unique_node(__k, __bkt, __code, __node._M_node); in _GLIBCXX_VISIBILITY()
[all …]
H A Dstl_tree.h487 _Link_type __node = static_cast<_Link_type>(_M_extract()); in _GLIBCXX_VISIBILITY()
488 if (__node) in _GLIBCXX_VISIBILITY()
490 _M_t._M_destroy_node(__node); in _GLIBCXX_VISIBILITY()
491 _M_t._M_construct_node(__node, _GLIBCXX_FORWARD(_Arg, __arg)); in _GLIBCXX_VISIBILITY()
492 return __node; in _GLIBCXX_VISIBILITY()
505 _Base_ptr __node = _M_nodes; in _GLIBCXX_VISIBILITY()
509 if (_M_nodes->_M_right == __node) in _GLIBCXX_VISIBILITY()
530 return __node; in _GLIBCXX_VISIBILITY()
592 _M_construct_node(_Link_type __node, const value_type& __x) in _GLIBCXX_VISIBILITY()
595 { get_allocator().construct(__node->_M_valptr(), __x); } in _GLIBCXX_VISIBILITY()
[all …]
H A Dforward_list.h360 _Node* __node = this->_M_get_node(); in _GLIBCXX_VISIBILITY() local
363 ::new ((void*)__node) _Node; in _GLIBCXX_VISIBILITY()
365 __node->_M_valptr(), in _GLIBCXX_VISIBILITY()
370 this->_M_put_node(__node); in _GLIBCXX_VISIBILITY()
373 return __node; in _GLIBCXX_VISIBILITY()
H A Dstl_list.h136 _List_node_base* const __node = this->_M_base(); in _GLIBCXX_VISIBILITY() local
137 __node->_M_next = __xnode->_M_next; in _GLIBCXX_VISIBILITY()
138 __node->_M_prev = __xnode->_M_prev; in _GLIBCXX_VISIBILITY()
139 __node->_M_next->_M_prev = __node->_M_prev->_M_next = __node; in _GLIBCXX_VISIBILITY()
/OK3568_Linux_fs/yocto/poky/meta/recipes-core/musl/bsd-headers/
H A Dsys-tree.h206 struct type __node, *__left, *__right, *__tmp; \
209 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
210 __left = __right = &__node; \
235 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
243 struct type __node, *__left, *__right, *__tmp; \
245 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
246 __left = __right = &__node; \
271 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
/OK3568_Linux_fs/kernel/mm/
H A Dslab.h636 #define for_each_kmem_cache_node(__s, __node, __n) \ argument
637 for (__node = 0; __node < nr_node_ids; __node++) \
638 if ((__n = get_node(__s, __node)))
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/
H A Dforward_list213 typename pointer_traits<_NodePtr>::element_type>::type __node;
214 typedef typename __forward_list_node_value_type<__node>::type __node_value_type;
369 typedef typename __traits::__node __node;
454 typedef __forward_list_node<value_type, void_pointer> __node;
456 …typedef typename __rebind_alloc_helper<allocator_traits<allocator_type>, __node>::type __node_allo…
630 typedef typename base::__node __node;
896 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
918 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
1125 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1141 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
[all …]
H A D__hash_table370 __hash_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
371 : __node_(__node)
377 __hash_iterator(__next_pointer __node) _NOEXCEPT
378 : __node_(__node)
486 __hash_const_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
487 : __node_(__node)
493 __hash_const_iterator(__next_pointer __node) _NOEXCEPT
494 : __node_(__node)
599 __hash_local_iterator(__next_pointer __node, size_t __bucket,
601 : __node_(__node),
[all …]
H A Dregex1308 template <class _CharT> class __node;
1339 const __node<_CharT>* __node_;
1349 // __node
1352 class __node
1354 __node(const __node&);
1355 __node& operator=(const __node&);
1360 __node() {}
1362 virtual ~__node() {}
1374 : public __node<_CharT>
1396 : public __node<_CharT>
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/
H A Dforward_list213 typename pointer_traits<_NodePtr>::element_type>::type __node;
214 typedef typename __forward_list_node_value_type<__node>::type __node_value_type;
369 typedef typename __traits::__node __node;
454 typedef __forward_list_node<value_type, void_pointer> __node;
456 …typedef typename __rebind_alloc_helper<allocator_traits<allocator_type>, __node>::type __node_allo…
630 typedef typename base::__node __node;
896 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
918 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
1125 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1141 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
[all …]
H A D__hash_table370 __hash_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
371 : __node_(__node)
377 __hash_iterator(__next_pointer __node) _NOEXCEPT
378 : __node_(__node)
486 __hash_const_iterator(__next_pointer __node, const void* __c) _NOEXCEPT
487 : __node_(__node)
493 __hash_const_iterator(__next_pointer __node) _NOEXCEPT
494 : __node_(__node)
599 __hash_local_iterator(__next_pointer __node, size_t __bucket,
601 : __node_(__node),
[all …]
H A Dregex1308 template <class _CharT> class __node;
1339 const __node<_CharT>* __node_;
1349 // __node
1352 class __node
1354 __node(const __node&);
1355 __node& operator=(const __node&);
1360 __node() {}
1362 virtual ~__node() {}
1374 : public __node<_CharT>
1396 : public __node<_CharT>
[all …]

12