HomeSort by: relevance | last modified time | path
    Searched refs:__z (Results 1 - 25 of 53) sorted by relevancy

1 2 3

  /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++98/
tree.cc 286 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
292 _Rb_tree_node_base* __y = __z;
296 if (__y->_M_left == 0) // __z has at most one non-null child. y == z.
299 if (__y->_M_right == 0) // __z has exactly one non-null child. y == z.
303 // __z has two non-null children. Set __y to
304 __y = __y->_M_right; // __z's successor. __x might be null.
309 if (__y != __z)
312 __z->_M_left->_M_parent = __y;
313 __y->_M_left = __z->_M_left;
314 if (__y != __z->_M_right
    [all...]
valarray.cc 83 const size_t __z = __i.size(); local
85 for (size_t __j = 0; __j < __z; ++__j)
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/
tree.cc 286 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
292 _Rb_tree_node_base* __y = __z;
296 if (__y->_M_left == 0) // __z has at most one non-null child. y == z.
299 if (__y->_M_right == 0) // __z has exactly one non-null child. y == z.
303 // __z has two non-null children. Set __y to
304 __y = __y->_M_right; // __z's successor. __x might be null.
309 if (__y != __z)
312 __z->_M_left->_M_parent = __y;
313 __y->_M_left = __z->_M_left;
314 if (__y != __z->_M_right
    [all...]
valarray.cc 83 const size_t __z = __i.size(); local
85 for (size_t __j = 0; __j < __z; ++__j)
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
sat_arith.h 51 _Tp __z; local
52 if (!__builtin_add_overflow(__x, __y, &__z))
53 return __z;
67 _Tp __z; local
68 if (!__builtin_sub_overflow(__x, __y, &__z))
69 return __z;
83 _Tp __z; local
84 if (!__builtin_mul_overflow(__x, __y, &__z))
85 return __z;
stl_tree.h 413 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
847 _M_insert_node(_Base_ptr __x, _Base_ptr __y, _Link_type __z);
858 _M_insert_lower_node(_Base_ptr __p, _Link_type __z);
861 _M_insert_equal_lower_node(_Link_type __z);
1827 _Link_type __z = __node_gen(_GLIBCXX_FORWARD(_Arg, __v));
1829 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
1832 return iterator(__z);
1852 _Link_type __z = _M_create_node(_GLIBCXX_FORWARD(_Arg, __v));
1854 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
1857 return iterator(__z);
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/config/cpu/i486/opt/ext/
opt_random.h 51 __m128i __z = _mm_srli_si128(__c, __sr2); local
53 __z = _mm_xor_si128(__z, __a);
54 __z = _mm_xor_si128(__z, __v);
57 __z = _mm_xor_si128(__z, __x);
58 return _mm_xor_si128(__z, __y);
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/config/cpu/i486/opt/ext/
opt_random.h 51 __m128i __z = _mm_srli_si128(__c, __sr2); local
53 __z = _mm_xor_si128(__z, __a);
54 __z = _mm_xor_si128(__z, __v);
57 __z = _mm_xor_si128(__z, __x);
58 return _mm_xor_si128(__z, __y);
  /src/external/gpl3/gcc/dist/libstdc++-v3/config/cpu/aarch64/opt/ext/
opt_random.h 85 __Uint32x4_t __z = __aarch64_lsr_128 ((__Uint8x16_t) __c, __sr2); local
89 __z = __z ^ __a;
90 __z = __z ^ __v;
95 __z = __z ^ __x;
96 return __z ^ __y;
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/config/cpu/aarch64/opt/ext/
opt_random.h 85 __Uint32x4_t __z = __aarch64_lsr_128 ((__Uint8x16_t) __c, __sr2); local
89 __z = __z ^ __a;
90 __z = __z ^ __v;
95 __z = __z ^ __x;
96 return __z ^ __y;
  /src/external/apache2/llvm/dist/clang/lib/Headers/
__clang_hip_math.h 236 float fmaf(float __x, float __y, float __z) {
237 return __ocml_fma_f32(__x, __y, __z);
373 float norm3df(float __x, float __y, float __z) {
374 return __ocml_len3_f32(__x, __y, __z);
378 float norm4df(float __x, float __y, float __z, float __w) {
379 return __ocml_len4_f32(__x, __y, __z, __w);
431 float rnorm3df(float __x, float __y, float __z) {
432 return __ocml_rlen3_f32(__x, __y, __z);
436 float rnorm4df(float __x, float __y, float __z, float __w) {
437 return __ocml_rlen4_f32(__x, __y, __z, __w)
    [all...]
tgmath.h 52 #define __tg_promote3(__x, __y, __z) (__typeof__(__tg_promote(__x) + \
54 __tg_promote(__z)))
728 __tg_fma(float __x, float __y, float __z)
729 {return fmaf(__x, __y, __z);}
733 __tg_fma(double __x, double __y, double __z)
734 {return fma(__x, __y, __z);}
738 __tg_fma(long double __x,long double __y, long double __z)
739 {return fmal(__x, __y, __z);}
742 #define fma(__x, __y, __z) \
743 __tg_fma(__tg_promote3((__x), (__y), (__z))(__x),
    [all...]
__clang_hip_cmath.h 36 __DEVICE__ float fma(float __x, float __y, float __z) {
37 return ::fmaf(__x, __y, __z);
120 __DEVICE__ _Float16 fma(_Float16 __x, _Float16 __y, _Float16 __z) {
121 return __ocml_fma_f16(__x, __y, __z);
499 fma(__T1 __x, __T2 __y, __T3 __z) {
501 return ::fma((__result_type)__x, (__result_type)__y, (__result_type)__z);
509 fma(__T1 __x, __T2 __y, __T3 __z) {
510 return ::fma((double)__x, (double)__y, (double)__z);
  /src/external/apache2/llvm/dist/clang/lib/Headers/openmp_wrappers/
complex_cmath.h 194 std::complex<_Tp> __z = log(__x + sqrt(__sqr(__x) + _Tp(1)));
195 return std::complex<_Tp>(copysign(__z.real(), __x.real()),
196 copysign(__z.imag(), __x.imag()));
227 std::complex<_Tp> __z = log(__x + sqrt(__sqr(__x) - _Tp(1)));
228 return std::complex<_Tp>(copysign(__z.real(), _Tp(0)),
229 copysign(__z.imag(), __x.imag()));
257 std::complex<_Tp> __z = log((_Tp(1) + __x) / (_Tp(1) - __x)) / _Tp(2); local
258 return std::complex<_Tp>(copysign(__z.real(), __x.real()),
259 copysign(__z.imag(), __x.imag()));
318 std::complex<_Tp> __z = asinh(complex<_Tp>(-__x.imag(), __x.real())) local
360 std::complex<_Tp> __z = atanh(complex<_Tp>(-__x.imag(), __x.real())); local
368 std::complex<_Tp> __z = sinh(complex<_Tp>(-__x.imag(), __x.real())); local
382 std::complex<_Tp> __z = tanh(complex<_Tp>(-__x.imag(), __x.real())); local
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++11/
compatibility-atomic-c++0x.cc 119 __atomic_flag_for_address(const volatile void* __z) _GLIBCXX_NOTHROW
122 guintptr_t __u = reinterpret_cast<guintptr_t>(__z);
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++11/
compatibility-atomic-c++0x.cc 120 __atomic_flag_for_address(const volatile void* __z) _GLIBCXX_NOTHROW
122 uintptr_t __u = reinterpret_cast<uintptr_t>(__z);
  /src/external/gpl3/gcc/dist/libquadmath/
quadmath.h 186 __quadmath_nth (cimagq (__complex128 __z))
188 return __imag__ __z;
192 __quadmath_nth (crealq (__complex128 __z))
194 return __real__ __z;
198 __quadmath_nth (conjq (__complex128 __z))
200 return __extension__ ~__z;
  /src/external/gpl3/gcc.old/dist/libquadmath/
quadmath.h 186 __quadmath_nth (cimagq (__complex128 __z))
188 return __imag__ __z;
192 __quadmath_nth (crealq (__complex128 __z))
194 return __real__ __z;
198 __quadmath_nth (conjq (__complex128 __z))
200 return __extension__ ~__z;
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
stl_tree.h 417 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
851 _M_insert_node(_Base_ptr __x, _Base_ptr __y, _Link_type __z);
862 _M_insert_lower_node(_Base_ptr __p, _Link_type __z);
865 _M_insert_equal_lower_node(_Link_type __z);
1832 _Link_type __z = __node_gen(_GLIBCXX_FORWARD(_Arg, __v));
1834 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
1837 return iterator(__z);
1857 _Link_type __z = _M_create_node(_GLIBCXX_FORWARD(_Arg, __v));
1859 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
1862 return iterator(__z);
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/experimental/bits/
simd_math.h 163 const typename _Arg3::type& __z) \
167 _Arg3::_S_data(__z))}; \
894 const simd<_Tp, _Abi>& __z) \
896 return _NAME(__x, __y, __z); \
902 const simd<_Tp, _Abi>& __z) \
904 return _NAME(__x, __y, __z); \
910 const __type_identity_t<simd<_Tp, _Abi>>& __z) \
912 return _NAME(__x, __y, __z); \
918 const __type_identity_t<simd<_Tp, _Abi>>& __z) \
920 return _NAME(__x, __y, __z); \
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/experimental/bits/
simd_math.h 163 const typename _Arg3::type& __z) \
167 _Arg3::_S_data(__z))}; \
882 const simd<_Tp, _Abi>& __z) \
884 return _NAME(__x, __y, __z); \
890 const simd<_Tp, _Abi>& __z) \
892 return _NAME(__x, __y, __z); \
898 const __type_identity_t<simd<_Tp, _Abi>>& __z) \
900 return _NAME(__x, __y, __z); \
906 const __type_identity_t<simd<_Tp, _Abi>>& __z) \
908 return _NAME(__x, __y, __z); \
    [all...]
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/
numeric_impl.h 339 [&__op](_ReferenceType1 __x, _ReferenceType1 __y, _ReferenceType2 __z) { __z = __op(__x, __y); });
370 [&__op](_ReferenceType1 __x, _ReferenceType1 __y, _ReferenceType2 __z)
371 { __z = __op(__y, __x); },
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/
hashtable_policy.h 383 _Prime_rehash_policy(float __z = 1.0)
384 : _M_max_load_factor(__z), _M_growth_factor(2.f), _M_next_resize(0) { }
546 max_load_factor(float __z)
549 __this->__rehash_policy(_Prime_rehash_policy(__z));
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/
numeric_impl.h 314 [&__op](_ReferenceType1 __x, _ReferenceType1 __y, _ReferenceType2 __z) { __z = __op(__x, __y); });
345 [&__op](_ReferenceType1 __x, _ReferenceType1 __y, _ReferenceType2 __z) { __z = __op(__y, __x); },
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/
hashtable_policy.h 383 _Prime_rehash_policy(float __z = 1.0)
384 : _M_max_load_factor(__z), _M_growth_factor(2.f), _M_next_resize(0) { }
546 max_load_factor(float __z)
549 __this->__rehash_policy(_Prime_rehash_policy(__z));

Completed in 73 milliseconds

1 2 3