| /src/external/gpl3/gcc.old/dist/fixincludes/tests/base/bits/ |
| fenv.h | 14 __asm__ __volatile__ ("divss %1, %0" : : "x" (__f), "x" (__g));
17 : "=t" (__f) : "0" (__f), "u" (__g) : "st(1)");
|
| /src/external/gpl3/gcc/dist/fixincludes/tests/base/bits/ |
| fenv.h | 14 __asm__ __volatile__ ("divss %1, %0" : : "x" (__f), "x" (__g));
17 : "=t" (__f) : "0" (__f), "u" (__g) : "st(1)");
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| gslice.h | 158 gslice::gslice(const gslice& __g)
159 : _M_index(__g._M_index)
170 gslice::operator=(const gslice& __g)
172 if (__g._M_index)
173 __g._M_index->_M_increment_use();
176 _M_index = __g._M_index;
|
| uniform_int_dist.h | 242 // Returns an unbiased random number from __g downscaled to [0,__range)
246 _S_nd(_Urbg& __g, _Up __range)
258 _Wp __product = _Wp(__g()) * _Wp(__range);
265 __product = _Wp(__g()) * _Wp(__range);
|
| stl_algo.h | 3661 * @param __g A UniformRandomBitGenerator.
3665 * Requires: __b0 * __b1 <= __g.max() - __g.min().
3680 _UniformRandomBitGenerator&& __g)
3683 = uniform_int_distribution<_IntType>{0, (__b0 * __b1) - 1}(__g);
3693 * @param __g A UniformRandomNumberGenerator (26.5.1.3).
3696 * Reorders the elements in the range @p [__first,__last) using @p __g to
3703 _UniformRandomNumberGenerator&& __g)
3725 const __uc_type __urngrange = __g.max() - __g.min()
[all...] |
| ranges_algo.h | 1550 iter_difference_t<_Iter> __n, _Gen&& __g) const
1559 __n, std::forward<_Gen>(__g));
1576 const auto __k = __d(__g, __param_type{0, __pop_sz});
1590 range_difference_t<_Range> __n, _Gen&& __g) const
1594 std::forward<_Gen>(__g));
1608 operator()(_Iter __first, _Sent __last, _Gen&& __g) const
1611 std::shuffle(std::move(__first), __lasti, std::forward<_Gen>(__g));
1619 operator()(_Range&& __r, _Gen&& __g) const
1622 std::forward<_Gen>(__g));
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| gslice.h | 158 gslice::gslice(const gslice& __g)
159 : _M_index(__g._M_index)
170 gslice::operator=(const gslice& __g)
174 if (__g._M_index)
175 __g._M_index->_M_increment_use();
178 _M_index = __g._M_index;
|
| uniform_int_dist.h | 253 // Returns an unbiased random number from __g downscaled to [0,__range)
257 _S_nd(_Urbg& __g, _Up __range)
269 _Wp __product = _Wp(__g()) * _Wp(__range);
276 __product = _Wp(__g()) * _Wp(__range);
|
| stl_algo.h | 3656 * @param __g A UniformRandomBitGenerator.
3660 * Requires: __b0 * __b1 <= __g.max() - __g.min().
3675 _UniformRandomBitGenerator&& __g)
3678 = uniform_int_distribution<_IntType>{0, (__b0 * __b1) - 1}(__g);
3688 * @param __g A UniformRandomNumberGenerator (26.5.1.3).
3691 * Reorders the elements in the range @p [__first,__last) using @p __g to
3698 _UniformRandomNumberGenerator&& __g)
3720 const __uc_type __urngrange = __g.max() - __g.min()
[all...] |
| unicode.h | 264 _Guard<_Iter> __g{this, _M_curr()};
364 _Guard<_Iter> __g{this, _M_curr()};
394 _Guard<_Iter> __g{this, _M_curr()};
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/ |
| random.h | 89 _Adaptor(const _Engine& __g)
90 : _M_g(__g) { }
161 _Adaptor(_Engine* __g)
162 : _M_g(__g) { }
380 * seeded from the generator function @p __g.
382 * @param __g The seed generator function.
385 linear_congruential(_Gen& __g)
386 { this->seed(__g); }
399 * sequence using values from the generator function @p __g.
401 * @param __g the seed generator function
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/ |
| random.h | 88 _Adaptor(const _Engine& __g)
89 : _M_g(__g) { }
343 * seeded from the generator function @p __g.
345 * @param __g The seed generator function.
348 linear_congruential(_Gen& __g)
349 { this->seed(__g); }
362 * sequence using values from the generator function @p __g.
364 * @param __g the seed generator function.
368 seed(_Gen& __g)
369 { seed(__g, typename is_fundamental<_Gen>::type());
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree.h | 3454 tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
3457 tree_check_failed (__t, __f, __l, __g, __c, 0);
3462 tree_not_check (tree __t, const char *__f, int __l, const char *__g,
3466 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3471 tree_check2 (tree __t, const char *__f, int __l, const char *__g,
3476 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3481 tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
3486 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3491 tree_check3 (tree __t, const char *__f, int __l, const char *__g,
3497 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0)
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| tree.h | 3621 tree_check (tree __t, const char *__f, int __l, const char *__g, tree_code __c)
3624 tree_check_failed (__t, __f, __l, __g, __c, 0);
3629 tree_not_check (tree __t, const char *__f, int __l, const char *__g,
3633 tree_not_check_failed (__t, __f, __l, __g, __c, 0);
3638 tree_check2 (tree __t, const char *__f, int __l, const char *__g,
3643 tree_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3648 tree_not_check2 (tree __t, const char *__f, int __l, const char *__g,
3653 tree_not_check_failed (__t, __f, __l, __g, __c1, __c2, 0);
3658 tree_check3 (tree __t, const char *__f, int __l, const char *__g,
3664 tree_check_failed (__t, __f, __l, __g, __c1, __c2, __c3, 0)
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/experimental/bits/ |
| simd_builtin.h | 213 _From __f, _From __g, index_sequence<_I...>)
219 static_cast<_Tp>(__g[_I])...};
225 _From __f, _From __g, _From __h, index_sequence<_I...>)
231 static_cast<_Tp>(__g[_I])..., static_cast<_Tp>(__h[_I])...};
237 _From __f, _From __g, _From __h, _From __i,
244 static_cast<_Tp>(__g[_I])..., static_cast<_Tp>(__h[_I])...,
251 _From __f, _From __g, _From __h, _From __i, _From __j,
258 static_cast<_Tp>(__g[_I])..., static_cast<_Tp>(__h[_I])...,
265 _From __f, _From __g, _From __h, _From __i, _From __j,
272 static_cast<_Tp>(__g[_I])..., static_cast<_Tp>(__h[_I])...
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/experimental/bits/ |
| simd_builtin.h | 213 _From __f, _From __g, index_sequence<_I...>)
219 static_cast<_Tp>(__g[_I])...};
225 _From __f, _From __g, _From __h, index_sequence<_I...>)
231 static_cast<_Tp>(__g[_I])..., static_cast<_Tp>(__h[_I])...};
237 _From __f, _From __g, _From __h, _From __i,
244 static_cast<_Tp>(__g[_I])..., static_cast<_Tp>(__h[_I])...,
251 _From __f, _From __g, _From __h, _From __i, _From __j,
258 static_cast<_Tp>(__g[_I])..., static_cast<_Tp>(__h[_I])...,
265 _From __f, _From __g, _From __h, _From __i, _From __j,
272 static_cast<_Tp>(__g[_I])..., static_cast<_Tp>(__h[_I])...
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/ |
| algorithm_impl.h | 2481 __brick_generate(_RandomAccessIterator __first, _RandomAccessIterator __last, _Generator __g,
2484 __unseq_backend::__simd_generate_n(__first, __last - __first, __g);
2489 __brick_generate(_ForwardIterator __first, _ForwardIterator __last, _Generator __g,
2492 std::generate(__first, __last, __g);
2497 __pattern_generate(_ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Generator __g,
2500 __internal::__brick_generate(__first, __last, __g, __is_vector);
2505 __pattern_generate(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Generator __g,
2510 [__g, __is_vector](_ForwardIterator __begin, _ForwardIterator __end) {
2511 __internal::__brick_generate(__begin, __end, __g, __is_vector);
2519 __brick_generate_n(OutputIterator __first, Size __count, _Generator __g, /* is_vector = */ std::true_type) noexcep
[all...] |
| unseq_backend_simd.h | 367 __simd_generate_n(_Index __first, _DifferenceType __size, _Generator __g) noexcept
372 __first[__i] = __g();
|
| glue_algorithm_impl.h | 432 generate(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Generator __g)
435 std::forward<_ExecutionPolicy>(__exec), __first, __last, __g,
442 generate_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __count, _Generator __g)
448 std::forward<_ExecutionPolicy>(__exec), __first, __count, __g,
|
| glue_algorithm_defs.h | 200 generate(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Generator __g);
204 generate_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size count, _Generator __g);
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/ |
| algorithm_impl.h | 2571 __brick_generate(_RandomAccessIterator __first, _RandomAccessIterator __last, _Generator __g,
2574 __unseq_backend::__simd_generate_n(__first, __last - __first, __g);
2579 __brick_generate(_ForwardIterator __first, _ForwardIterator __last, _Generator __g,
2582 std::generate(__first, __last, __g);
2587 __pattern_generate(_Tag, _ExecutionPolicy&&, _ForwardIterator __first, _ForwardIterator __last, _Generator __g) noexcept
2589 __internal::__brick_generate(__first, __last, __g, typename _Tag::__is_vector{});
2595 _RandomAccessIterator __last, _Generator __g)
2603 [__g](_RandomAccessIterator __begin, _RandomAccessIterator __end)
2604 { __internal::__brick_generate(__begin, __end, __g, _IsVector{}); });
2611 __brick_generate_n(_RandomAccessIterator __first, _Size __count, _Generator __g,
[all...] |
| unseq_backend_simd.h | 367 __simd_generate_n(_Index __first, _DifferenceType __size, _Generator __g) noexcept
372 __first[__i] = __g();
|
| glue_algorithm_impl.h | 410 generate(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Generator __g)
415 __g);
420 generate_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __count, _Generator __g)
428 __count, __g);
|
| glue_algorithm_defs.h | 200 generate(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Generator __g);
204 generate_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size count, _Generator __g);
|
| /src/external/apache2/llvm/dist/clang/lib/Headers/ |
| avxintrin.h | 3652 /// \param __g
3661 float __e, float __f, float __g, float __h)
3663 return __extension__ (__m256){ __h, __g, __f, __e, __d, __c, __b, __a };
3919 /// \param __g
3928 float __e, float __f, float __g, float __h)
3930 return _mm256_set_ps(__h, __g, __f, __e, __d, __c, __b, __a);
|
