/haiku-buildtools/gcc/gcc/testsuite/g++.dg/opt/ |
H A D | complex6.C | 7 aaa(_Complex float __z) ; 10 aaa::aaa(_Complex float __z) argument 12 __z*=2.0f; 13 _M_value = __z;
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/ |
H A D | constexpr-complex.C | 10 constexpr complex(_ComplexT __z) : _M_value(__z) { } argument
|
H A D | variadic98.C | 297 _Link_type __z = _M_create_node(__v); local 300 _Link_type __z = _M_create_node(__v); local
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | 20030709-3.c | 29 const tree __z = type->type.binfo; local 33 if (__z->common.code != TREE_VEC)
|
H A D | 20030710-1.c | 30 const tree __z = type->type.binfo;
|
/haiku-buildtools/gcc/libstdc++-v3/src/c++98/ |
H A D | tree.cc | 286 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z, argument 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 [all...] |
H A D | valarray.cc | 77 const size_t __z = __i.size(); local 79 for (size_t __j = 0; __j < __z; ++__j)
|
/haiku-buildtools/gcc/libstdc++-v3/config/cpu/i486/opt/ext/ |
H A D | 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);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 20030903-1.c | 8 extern double carg (double _Complex __z);
|
/haiku-buildtools/legacy/gcc/libstdc++/ |
H A D | valarray.cc | 28 const size_t __z = __i.size(); local 29 __valarray_fill(&__i[0], __z, __o); 30 for (size_t __j=0; __j<__z; ++__j) {
|
/haiku-buildtools/gcc/libstdc++-v3/src/c++11/ |
H A D | 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);
|
/haiku-buildtools/gcc/libquadmath/ |
H A D | quadmath.h | 179 __quadmath_nth (cimagq (__complex128 __z)) argument 181 return __imag__ __z; 185 __quadmath_nth (crealq (__complex128 __z)) argument 187 return __real__ __z; 191 __quadmath_nth (conjq (__complex128 __z)) argument 193 return __extension__ ~__z;
|
/haiku-buildtools/legacy/gcc/libstdc++/stl/ |
H A D | stl_tree.h | 300 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* __z, argument 305 _Rb_tree_node_base* __y = __z; 308 if (__y->_M_left == 0) // __z has at most one non-null child. y == z. 311 if (__y->_M_right == 0) // __z has exactly one non-null child. y == z. 313 else { // __z has two non-null children. Set __y to 314 __y = __y->_M_right; // __z's successor. __x might be null. 319 if (__y != __z) { // relink y in place of z. y is z's successor 320 __z->_M_left->_M_parent = __y; 321 __y->_M_left = __z->_M_left; 322 if (__y != __z 827 _Link_type __z; local [all...] |
H A D | stl_function.h | 272 const _Operation3& __z) 273 : _M_op1(__x), _M_op2(__y), _M_op3(__z) { } 271 binary_compose(const _Operation1& __x, const _Operation2& __y, const _Operation3& __z) argument
|
/haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
H A D | stl_tree.h | 341 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z, 745 _M_insert_node(_Base_ptr __x, _Base_ptr __y, _Link_type __z); 756 _M_insert_lower_node(_Base_ptr __p, _Link_type __z); 759 _M_insert_equal_lower_node(_Link_type __z); 1509 _Link_type __z = __node_gen(_GLIBCXX_FORWARD(_Arg, __v)); 1511 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p, 1514 return iterator(__z); 1534 _Link_type __z = _M_create_node(_GLIBCXX_FORWARD(_Arg, __v)); 1536 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p, 1539 return iterator(__z); [all...] |
H A D | unordered_set.h | 709 * @param __z The new maximum load factor. 712 max_load_factor(float __z) argument 713 { _M_h.max_load_factor(__z); } 1360 * @param __z The new maximum load factor. 1363 max_load_factor(float __z) argument 1364 { _M_h.max_load_factor(__z); }
|
H A D | unordered_map.h | 789 * @param __z The new maximum load factor. 792 max_load_factor(float __z) argument 793 { _M_h.max_load_factor(__z); } 1479 * @param __z The new maximum load factor. 1482 max_load_factor(float __z) argument 1483 { _M_h.max_load_factor(__z); }
|
H A D | random.h | 320 discard(unsigned long long __z) 322 for (; __z != 0ULL; --__z) 536 discard(unsigned long long __z); 742 discard(unsigned long long __z) 744 for (; __z != 0ULL; --__z) 972 discard(unsigned long long __z) 974 for (; __z != 0ULL; --__z) [all...] |
H A D | hashtable_policy.h | 460 _Prime_rehash_policy(float __z = 1.0) noexcept 461 : _M_max_load_factor(__z), _M_next_resize(0) { } 947 max_load_factor(float __z) argument 950 __this->__rehash_policy(_Prime_rehash_policy(__z));
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/ |
H A D | pr64568.C | 18 void operator+=(complex __z) { _M_value = __z.imag (); } argument
|
H A D | pr64568-2.C | 25 void operator+=(complex __z) { _M_value += _M_value; _M_value += __z.imag (); } argument
|
/haiku-buildtools/gcc/gmp/mpz/ |
H A D | fac_ui.c | 38 mpz_ptr __z = (z); \ 40 PTR(__z)[0] = (n); \ 41 SIZ(__z) = 1; \
|
/haiku-buildtools/gcc/libstdc++-v3/include/tr1/ |
H A D | 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) { } 551 max_load_factor(float __z) argument 554 __this->__rehash_policy(_Prime_rehash_policy(__z));
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/gomp/ |
H A D | pr25990.c | 27 extern float cabsf (float _Complex __z) __attribute__ ((__nothrow__)); extern float __cabsf (float _Complex __z) __attribute__ ((__nothrow__));
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/tm/ |
H A D | pr46646.C | 636 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z, 822 _Link_type __z = _M_create_node(__v); local 823 return iterator(__z);
|