| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/libcxx/include/ |
| H A D | __tree | 1381 __node_base_pointer& __child, 2124 __parent_pointer __parent, __node_base_pointer& __child, 2131 __child = __new_node; 2134 __tree_balance_after_insert(__end_node()->__left_, __child); 2151 __node_base_pointer& __child = __find_equal(__parent, __k); 2152 __node_pointer __r = static_cast<__node_pointer>(__child); 2154 if (__child == nullptr) 2161 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); 2185 __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __k); 2186 __node_pointer __r = static_cast<__node_pointer>(__child); [all …]
|
| H A D | map | 1520 __node_base_pointer& __child = __tree_.__find_equal(__parent, __k); 1521 __node_pointer __r = static_cast<__node_pointer>(__child); 1522 if (__child == nullptr) 1525 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); 1538 __node_base_pointer& __child = __tree_.__find_equal(__parent, __k); 1540 if (__child == nullptr) 1543 return static_cast<__node_pointer>(__child)->__value_.__get_value().second; 1551 __node_base_pointer __child = __tree_.__find_equal(__parent, __k); 1553 if (__child == nullptr) 1556 return static_cast<__node_pointer>(__child)->__value_.__get_value().second;
|
| H A D | algorithm | 4831 difference_type __child = __start - __first; 4833 if (__len < 2 || (__len - 2) / 2 < __child) 4836 __child = 2 * __child + 1; 4837 _RandomAccessIterator __child_i = __first + __child; 4839 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 4842 ++__child; 4857 if ((__len - 2) / 2 < __child) 4861 __child = 2 * __child + 1; 4862 __child_i = __first + __child; 4864 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { [all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/libcxx/include/ |
| H A D | __tree | 1381 __node_base_pointer& __child, 2124 __parent_pointer __parent, __node_base_pointer& __child, 2131 __child = __new_node; 2134 __tree_balance_after_insert(__end_node()->__left_, __child); 2151 __node_base_pointer& __child = __find_equal(__parent, __k); 2152 __node_pointer __r = static_cast<__node_pointer>(__child); 2154 if (__child == nullptr) 2161 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); 2185 __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __k); 2186 __node_pointer __r = static_cast<__node_pointer>(__child); [all …]
|
| H A D | map | 1520 __node_base_pointer& __child = __tree_.__find_equal(__parent, __k); 1521 __node_pointer __r = static_cast<__node_pointer>(__child); 1522 if (__child == nullptr) 1525 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); 1538 __node_base_pointer& __child = __tree_.__find_equal(__parent, __k); 1540 if (__child == nullptr) 1543 return static_cast<__node_pointer>(__child)->__value_.__get_value().second; 1551 __node_base_pointer __child = __tree_.__find_equal(__parent, __k); 1553 if (__child == nullptr) 1556 return static_cast<__node_pointer>(__child)->__value_.__get_value().second;
|
| H A D | algorithm | 4831 difference_type __child = __start - __first; 4833 if (__len < 2 || (__len - 2) / 2 < __child) 4836 __child = 2 * __child + 1; 4837 _RandomAccessIterator __child_i = __first + __child; 4839 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { 4842 ++__child; 4857 if ((__len - 2) / 2 < __child) 4861 __child = 2 * __child + 1; 4862 __child_i = __first + __child; 4864 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { [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 D | stl_heap.h | 79 for (_Distance __child = 1; __child < __n; ++__child) in _GLIBCXX_VISIBILITY() local 81 if (__comp(__first + __parent, __first + __child)) in _GLIBCXX_VISIBILITY() 82 return __child; in _GLIBCXX_VISIBILITY() 83 if ((__child & 1) == 0) in _GLIBCXX_VISIBILITY()
|
| H A D | ranges_algo.h | 1961 iter_difference_t<_Iter> __parent = 0, __child = 1; in _GLIBCXX_VISIBILITY() local 1962 for (; __child < __n; ++__child) in _GLIBCXX_VISIBILITY() 1965 std::__invoke(__proj, *(__first + __child)))) in _GLIBCXX_VISIBILITY() 1966 return __first + __child; in _GLIBCXX_VISIBILITY() 1967 else if ((__child & 1) == 0) 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 D | stl_heap.h | 79 for (_Distance __child = 1; __child < __n; ++__child) in _GLIBCXX_VISIBILITY() local 81 if (__comp(__first + __parent, __first + __child)) in _GLIBCXX_VISIBILITY() 82 return __child; in _GLIBCXX_VISIBILITY() 83 if ((__child & 1) == 0) in _GLIBCXX_VISIBILITY()
|
| H A D | ranges_algo.h | 1961 iter_difference_t<_Iter> __parent = 0, __child = 1; in _GLIBCXX_VISIBILITY() local 1962 for (; __child < __n; ++__child) in _GLIBCXX_VISIBILITY() 1965 std::__invoke(__proj, *(__first + __child)))) in _GLIBCXX_VISIBILITY() 1966 return __first + __child; in _GLIBCXX_VISIBILITY() 1967 else if ((__child & 1) == 0) in _GLIBCXX_VISIBILITY()
|
| /OK3568_Linux_fs/kernel/tools/testing/selftests/pidfd/ |
| H A D | pidfd_getfd_test.c | 36 static int __child(int sk, int memfd) in __child() function 108 ret = __child(sk, memfd); in child()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/libc/usr/include/ |
| H A D | unistd.h | 1171 void (*__child) (void)) __THROW;
|
| H A D | pthread.h | 1192 void (*__child) (void)) __THROW;
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/libc/usr/include/ |
| H A D | unistd.h | 1171 void (*__child) (void)) __THROW;
|
| H A D | pthread.h | 1192 void (*__child) (void)) __THROW;
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/include-fixed/ |
| H A D | pthread.h | 1201 void (*__child) (void)) __THROW;
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/include-fixed/ |
| H A D | pthread.h | 1201 void (*__child) (void)) __THROW;
|