Home
last modified time | relevance | path

Searched refs:__z (Results 1 – 6 of 6) sorted by relevance

/haiku/src/system/libroot/posix/glibc/math/bits/
H A Dcmathcalls.h54 __MATHCALL (cacos, (_Mdouble_complex_ __z));
56 __MATHCALL (casin, (_Mdouble_complex_ __z));
58 __MATHCALL (catan, (_Mdouble_complex_ __z));
61 __MATHCALL (ccos, (_Mdouble_complex_ __z));
63 __MATHCALL (csin, (_Mdouble_complex_ __z));
65 __MATHCALL (ctan, (_Mdouble_complex_ __z));
71 __MATHCALL (cacosh, (_Mdouble_complex_ __z));
73 __MATHCALL (casinh, (_Mdouble_complex_ __z));
75 __MATHCALL (catanh, (_Mdouble_complex_ __z));
78 __MATHCALL (ccosh, (_Mdouble_complex_ __z));
[all …]
H A Dmathcalls.h338 __MATHCALL (fma,, (_Mdouble_ __x, _Mdouble_ __y, _Mdouble_ __z));
/haiku/headers/cpp/
H A Dstl_tree.h300 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* __z, in _Rb_tree_rebalance_for_erase() argument
305 _Rb_tree_node_base* __y = __z; in _Rb_tree_rebalance_for_erase()
319 if (__y != __z) { // relink y in place of z. y is z's successor in _Rb_tree_rebalance_for_erase()
320 __z->_M_left->_M_parent = __y; in _Rb_tree_rebalance_for_erase()
321 __y->_M_left = __z->_M_left; in _Rb_tree_rebalance_for_erase()
322 if (__y != __z->_M_right) { in _Rb_tree_rebalance_for_erase()
326 __y->_M_right = __z->_M_right; in _Rb_tree_rebalance_for_erase()
327 __z->_M_right->_M_parent = __y; in _Rb_tree_rebalance_for_erase()
331 if (__root == __z) in _Rb_tree_rebalance_for_erase()
333 else if (__z->_M_parent->_M_left == __z) in _Rb_tree_rebalance_for_erase()
[all …]
H A Dstl_function.h272 const _Operation3& __z) in binary_compose() argument
273 : _M_op1(__x), _M_op2(__y), _M_op3(__z) { } in binary_compose()
/haiku/src/libs/stdc++/legacy/
H A Dvalarray.cc28 const size_t __z = __i.size(); in __gslice_to_index() local
29 __valarray_fill(&__i[0], __z, __o); in __gslice_to_index()
30 for (size_t __j=0; __j<__z; ++__j) { in __gslice_to_index()
/haiku/src/system/libroot/posix/glibc/math/
H A Dmath_private.h322 extern double __slowpow (double __x, double __y, double __z);