Home
last modified time | relevance | path

Searched refs:__nd (Results 1 – 7 of 7) sorted by relevance

/OK3568_Linux_fs/kernel/tools/perf/util/
H A Drb_resort.h127 #define resort_rb__for_each_entry(__nd, __name) \ argument
128 for (__nd = rb_first(&__name->entries); \
129 __name##_entry = rb_entry(__nd, struct __name##_sorted_entry, \
130 rb_node), __nd; \
131 __nd = rb_next(__nd))
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/
H A D__tree1329 pair<iterator, bool> __node_insert_unique(__node_pointer __nd);
1332 __node_pointer __nd);
1335 iterator __node_insert_multi(__node_pointer __nd);
1337 iterator __node_insert_multi(const_iterator __p, __node_pointer __nd);
1475 void destroy(__node_pointer __nd) _NOEXCEPT;
1847 __tree<_Tp, _Compare, _Allocator>::destroy(__node_pointer __nd) _NOEXCEPT
1849 if (__nd != nullptr)
1851 destroy(static_cast<__node_pointer>(__nd->__left_));
1852 destroy(static_cast<__node_pointer>(__nd->__right_));
1854 __node_traits::destroy(__na, _NodeTypes::__get_ptr(__nd->__value_));
[all …]
H A D__hash_table1061 pair<iterator, bool> __node_insert_unique(__node_pointer __nd);
1063 iterator __node_insert_multi(__node_pointer __nd);
1066 __node_pointer __nd);
1899 // Insert the node __nd into the container by pushing it into the right bucket,
1900 // and updating size(). Assumes that __nd->__hash is up-to-date, and that
1907 __node_pointer __nd) _NOEXCEPT
1910 size_t __chash = __constrain_hash(__nd->__hash(), __bc);
1916 __nd->__next_ = __pn->__next_;
1917 __pn->__next_ = __nd->__ptr();
1920 if (__nd->__next_ != nullptr)
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/
H A D__tree1329 pair<iterator, bool> __node_insert_unique(__node_pointer __nd);
1332 __node_pointer __nd);
1335 iterator __node_insert_multi(__node_pointer __nd);
1337 iterator __node_insert_multi(const_iterator __p, __node_pointer __nd);
1475 void destroy(__node_pointer __nd) _NOEXCEPT;
1847 __tree<_Tp, _Compare, _Allocator>::destroy(__node_pointer __nd) _NOEXCEPT
1849 if (__nd != nullptr)
1851 destroy(static_cast<__node_pointer>(__nd->__left_));
1852 destroy(static_cast<__node_pointer>(__nd->__right_));
1854 __node_traits::destroy(__na, _NodeTypes::__get_ptr(__nd->__value_));
[all …]
H A D__hash_table1061 pair<iterator, bool> __node_insert_unique(__node_pointer __nd);
1063 iterator __node_insert_multi(__node_pointer __nd);
1066 __node_pointer __nd);
1899 // Insert the node __nd into the container by pushing it into the right bucket,
1900 // and updating size(). Assumes that __nd->__hash is up-to-date, and that
1907 __node_pointer __nd) _NOEXCEPT
1910 size_t __chash = __constrain_hash(__nd->__hash(), __bc);
1916 __nd->__next_ = __pn->__next_;
1917 __pn->__next_ = __nd->__ptr();
1920 if (__nd->__next_ != nullptr)
[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 Drandom.tcc1571 result_type operator()(_NormalDistribution& __nd, in operator ()() argument
1582 [&__nd, &__urng, &__sum](){ in operator ()()
1583 _RealType __t = __nd(__urng); in operator ()()
/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 Drandom.tcc1571 result_type operator()(_NormalDistribution& __nd, in operator ()() argument
1582 [&__nd, &__urng, &__sum](){ in operator ()()
1583 _RealType __t = __nd(__urng); in operator ()()