/freebsd/contrib/llvm-project/libcxx/src/ryu/ |
H A D | f2s.cpp | 90 const uint32_t __q = __value / 5; in __pow5Factor() local 95 __value = __q; in __pow5Factor() 142 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI inline uint32_t __mulPow5InvDivPow2(const uint32_t __m, const uint32_t __q, const int32_t __j) { in __mulPow5InvDivPow2() argument 143 return __mulShift(__m, __FLOAT_POW5_INV_SPLIT[__q], __j); in __mulPow5InvDivPow2() 184 const uint32_t __q = __log10Pow2(__e2); in __f2d() local 185 __e10 = static_cast<int32_t>(__q); in __f2d() 186 const int32_t __k = __FLOAT_POW5_INV_BITCOUNT + __pow5bits(static_cast<int32_t>(__q)) - 1; in __f2d() 187 const int32_t __i = -__e2 + static_cast<int32_t>(__q) + __k; in __f2d() 188 __vr = __mulPow5InvDivPow2(__mv, __q, __i); in __f2d() 189 __vp = __mulPow5InvDivPow2(__mp, __q, __ in __f2d() 211 const uint32_t __q = __log10Pow5(-__e2); __f2d() local [all...] |
H A D | d2s.cpp | 211 // I tried special-casing __q == 0, but there was no effect on performance. in __d2d() 213 const uint32_t __q = __log10Pow2(__e2) - (__e2 > 3); in __d2d() local 214 __e10 = static_cast<int32_t>(__q); in __d2d() 215 const int32_t __k = __DOUBLE_POW5_INV_BITCOUNT + __pow5bits(static_cast<int32_t>(__q)) - 1; in __d2d() 216 const int32_t __i = -__e2 + static_cast<int32_t>(__q) + __k; in __d2d() 217 __vr = __mulShiftAll(__m2, __DOUBLE_POW5_INV_SPLIT[__q], __i, &__vp, &__vm, __mmShift); in __d2d() 218 if (__q <= 21) { in __d2d() 219 // This should use __q <= 22, but I think 21 is also safe. Smaller values in __d2d() 224 __vrIsTrailingZeros = __multipleOfPowerOf5(__mv, __q); in __d2d() 226 // Same as min(__e2 + (~__mm & 1), __pow5Factor(__mm)) >= __q in __d2d() 237 const uint32_t __q = __log10Pow5(-__e2) - (-__e2 > 1); __d2d() local 518 const uint64_t __q = __div1e8(_Output); __to_chars() local 594 const uint64_t __q = __div1e8(_Output); __to_chars() local 766 const uint64_t __q = __div10(__v.__mantissa); __d2s_buffered_n() local [all...] |
/freebsd/contrib/llvm-project/libcxx/include/__debug_utils/ |
H A D | strict_weak_ordering_check.h | 41 __diff_t __q = __p + __diff_t(1); in __check_strict_weak_ordering_sorted() local 43 while (__q < __size && !__comp(*(__first + __p), *(__first + __q))) { in __check_strict_weak_ordering_sorted() 44 ++__q; in __check_strict_weak_ordering_sorted() 46 // Check that the elements from __p to __q are equal between each other. in __check_strict_weak_ordering_sorted() 47 for (__diff_t __b = __p; __b < __q; ++__b) { in __check_strict_weak_ordering_sorted() 55 // Check that elements between __p and __q are less than between __q and __size. in __check_strict_weak_ordering_sorted() 56 for (__diff_t __a = __p; __a < __q; ++__a) { in __check_strict_weak_ordering_sorted() 57 for (__diff_t __b = __q; __ in __check_strict_weak_ordering_sorted() [all...] |
/freebsd/contrib/llvm-project/libcxx/include/__random/ |
H A D | linear_congruential_engine.h | 86 const result_type __q = __m / __a; 88 const result_type __t0 = __a * (__x % __q); 89 const result_type __t1 = __r * (__x / __q); 101 const result_type __q = __m / __a; 103 const result_type __t0 = __a * (__x % __q); 104 const result_type __t1 = __r * (__x / __q); 151 const result_type __q = __m / __a; 153 const result_type __t0 = __a * (__x % __q); 154 const result_type __t1 = __r * (__x / __q); 168 const result_type __q = __m / __a; [all …]
|
H A D | subtract_with_carry_engine.h | 89 _LIBCPP_HIDE_FROM_ABI explicit subtract_with_carry_engine(_Sseq& __q) { in max() 90 seed(__q); 96 _LIBCPP_HIDE_FROM_ABI void seed(_Sseq& __q) { 97 __seed(__q, integral_constant<unsigned, 1 + (__w - 1) / 32>()); in subtract_with_carry_engine() 127 _LIBCPP_HIDE_FROM_ABI void __seed(_Sseq& __q, integral_constant<unsigned, 1>); 129 _LIBCPP_HIDE_FROM_ABI void __seed(_Sseq& __q, integral_constant<unsigned, 2>); 167 void subtract_with_carry_engine<_UIntType, __w, __s, __r>::__seed(_Sseq& __q, integral_constant<unsigned, 1>) { 170 __q.generate(__ar, __ar + __r * __k); 179 void subtract_with_carry_engine<_UIntType, __w, __s, __r>::__seed(_Sseq& __q, integral_constant<unsigned, 2>) { 182 __q in seed() 119 seed(_Sseq & __q) seed() argument 211 __seed(_Sseq & __q,integral_constant<unsigned,1>) __seed() argument 226 __seed(_Sseq & __q,integral_constant<unsigned,2>) __seed() argument [all...] |
H A D | discard_block_engine.h | 71 _LIBCPP_HIDE_FROM_ABI explicit discard_block_engine(_Sseq& __q) : __e_(__q), __n_(0) {} in discard_block_engine() argument 81 _LIBCPP_HIDE_FROM_ABI void seed(_Sseq& __q) { in seed() argument 82 __e_.seed(__q); in seed()
|
H A D | seed_seq.h | 94 const size_t __q = __p + __t; in generate() local 101 __first[__q] += __r; in generate() 109 size_t __kqmodn = __q % __n; // (__k + __q) % __n in generate()
|
H A D | independent_bits_engine.h | 99 _LIBCPP_HIDE_FROM_ABI explicit independent_bits_engine(_Sseq& __q) : __e_(__q) {} in independent_bits_engine() 103 _LIBCPP_HIDE_FROM_ABI void seed(_Sseq& __q) { in independent_bits_engine() 104 __e_.seed(__q); 112 __e_(__q) __e_() argument 124 seed(_Sseq & __q) seed() argument
|
H A D | shuffle_order_engine.h | 95 _LIBCPP_HIDE_FROM_ABI explicit shuffle_order_engine(_Sseq& __q) : __e_(__q) { 107 _LIBCPP_HIDE_FROM_ABI void seed(_Sseq& __q) { 108 __e_.seed(__q);
|
H A D | mersenne_twister_engine.h | 193 _LIBCPP_HIDE_FROM_ABI explicit mersenne_twister_engine(_Sseq& __q) { 194 seed(__q); 198 _LIBCPP_HIDE_FROM_ABI void seed(_Sseq& __q) { 199 __seed(__q, integral_constant<unsigned, 1 + (__w - 1) / 32>()); 287 _LIBCPP_HIDE_FROM_ABI void __seed(_Sseq& __q, integral_constant<unsigned, 1>); 289 _LIBCPP_HIDE_FROM_ABI void __seed(_Sseq& __q, integral_constant<unsigned, 2>); 673 _Sseq& __q, integral_constant<unsigned, 1>) { 676 __q.generate(__ar, __ar + __n * __k); 705 _Sseq& __q, integral_constant<unsigned, 2>) { 708 __q 151 seed(_Sseq & __q) seed() argument 350 __seed(_Sseq & __q,integral_constant<unsigned,1>) __seed() argument 375 __seed(_Sseq & __q,integral_constant<unsigned,2>) __seed() argument [all...] |
/freebsd/contrib/llvm-project/libcxx/include/ |
H A D | queue | 314 _LIBCPP_HIDE_FROM_ABI queue(const queue& __q) : c(__q.c) {} 338 _LIBCPP_HIDE_FROM_ABI queue& operator=(const queue& __q) { 339 c = __q.c; 344 …_LIBCPP_HIDE_FROM_ABI queue(queue&& __q) noexcept(is_nothrow_move_constructible<container_type>::v… 345 : c(std::move(__q.c)) {} 347 …_LIBCPP_HIDE_FROM_ABI queue& operator=(queue&& __q) noexcept(is_nothrow_move_assignable<container_… 348 c = std::move(__q.c); 362 _LIBCPP_HIDE_FROM_ABI queue(const queue& __q, const _Alloc& __a) : c(__q.c, __a) {} 372 _LIBCPP_HIDE_FROM_ABI queue(queue&& __q, const _Alloc& __a) : c(std::move(__q.c), __a) {} 414 _LIBCPP_HIDE_FROM_ABI void swap(queue& __q) _NOEXCEPT_(__is_nothrow_swappable_v<container_type>) { [all …]
|
H A D | stack | 168 _LIBCPP_HIDE_FROM_ABI stack(const stack& __q) : c(__q.c) {} 170 _LIBCPP_HIDE_FROM_ABI stack& operator=(const stack& __q) { 171 c = __q.c; 176 …_LIBCPP_HIDE_FROM_ABI stack(stack&& __q) noexcept(is_nothrow_move_constructible<container_type>::v… 177 : c(std::move(__q.c)) {} 179 …_LIBCPP_HIDE_FROM_ABI stack& operator=(stack&& __q) noexcept(is_nothrow_move_assignable<container_… 180 c = std::move(__q.c);
|
/freebsd/contrib/llvm-project/libcxx/src/include/ryu/ |
H A D | d2s_intrinsics.h | 231 const uint64_t __q = __div5(__value); in __pow5Factor() local 232 const uint32_t __r = static_cast<uint32_t>(__value) - 5 * static_cast<uint32_t>(__q); in __pow5Factor() 236 __value = __q; in __pow5Factor()
|
/freebsd/contrib/llvm-project/clang/lib/Headers/ |
H A D | emmintrin.h | 3655 static __inline__ __m128i __DEFAULT_FN_ATTRS _mm_set1_epi64x(long long __q) { in _mm_set1_epi64x() argument 3656 return _mm_set_epi64x(__q, __q); in _mm_set1_epi64x() 3672 static __inline__ __m128i __DEFAULT_FN_ATTRS _mm_set1_epi64(__m64 __q) { in _mm_set1_epi64() argument 3673 return _mm_set_epi64(__q, __q); in _mm_set1_epi64()
|
H A D | avxintrin.h | 4311 _mm256_set1_epi64x(long long __q) in _mm256_set1_epi64x() argument 4313 return _mm256_set_epi64x(__q, __q, __q, __q); in _mm256_set1_epi64x()
|
H A D | __clang_cuda_cmath.h | 182 __DEVICE__ float remquo(float __n, float __d, int *__q) { in remquo() argument 183 return ::remquof(__n, __d, __q); in remquo()
|
/freebsd/contrib/llvm-project/libcxx/include/__memory/ |
H A D | shared_ptr.h | 1614 shared_ptr<_Tp> __q = *__p; 1616 return __q;
|