Searched refs:max (Results 51 - 75 of 1128) sorted by relevance

1234567891011>>

/haiku-buildtools/isl/test_inputs/codegen/omega/
H A Dlefur01-0.c2 for (int c1 = max(2 * c0 - 15, c0 / 2); c1 <= min(c0 + 1, 15); c1 += 1)
3 for (int c2 = max(max(max(67 * c0 - (c0 + 1) / 3, 1), 67 * c1 - (c1 + 2) / 3), 133 * c0 - 67 * c1 + (c0 + c1 + 1) / 3 - 66); c2 <= min(min(100 * c0 + 99, 1000), 133 * c0 - 67 * c1 + floord(c0 + c1 - 1, 3) + 133); c2 += 1)
4 for (int c3 = max(max(100 * c1 + (c2 + 1) / 2, 200 * c0 - c2), c2); c3 <= min(min(200 * c0 - c2 + 199, 100 * c1 + (c2 + 1) / 2 + 99), 2 * c2 + 1); c3 += 1)
H A Dlefur01-1.c2 for (int c1 = max(2 * c0 - 15, c0 / 2); c1 <= min(c0 + 1, 15); c1 += 1)
3 for (int c2 = max(max(max(1, 67 * c1 - (c1 + 2) / 3), 67 * c0 - (c0 + 1) / 3), 133 * c0 - 67 * c1 + (c0 + c1 + 1) / 3 - 66); c2 <= min(min(100 * c0 + 99, 1000), 133 * c0 - 67 * c1 + floord(c0 + c1 - 1, 3) + 133); c2 += 1)
4 for (int c3 = max(max(100 * c1 + (c2 + 1) / 2, 200 * c0 - c2), c2); c3 <= min(min(200 * c0 - c2 + 199, 100 * c1 + (c2 + 1) / 2 + 99), 2 * c2 + 1); c3 += 1)
H A Dwak1-0.c9 for (int c0 = max(max(a3, b3 + 1), a2); c0 <= min(b2, a1 - 1); c0 += 1)
18 for (int c0 = max(max(a1, b1 + 1), a2); c0 <= min(b2, a3 - 1); c0 += 1)
20 for (int c0 = max(max(a1, b1 + 1), a3); c0 <= b3; c0 += 1) {
25 for (int c0 = max(max(max(max(a
[all...]
H A Diter8-0.c1 for (int c0 = max(exprVar2 + 8 * floord(-exprVar2 + exprVar1 - 1, 8) + 9, exprVar2 + 1); c0 <= 16; c0 += 8)
/haiku-buildtools/gcc/libstdc++-v3/testsuite/26_numerics/random/uniform_int_distribution/cons/
H A Ddefault.cc37 VERIFY( u.b() == std::numeric_limits<int>::max() );
39 VERIFY( u.max() == std::numeric_limits<int>::max() );
/haiku-buildtools/gcc/gcc/testsuite/c-c++-common/torture/
H A Dbuiltin-arith-overflow-1.h3 #define TESTS(type, min, max) \
5 ST (101, signed type, max, -1, max - 1, U(s, add), 0) \
6 ST (102, signed type, max, 0, max, U(s, add), 0) \
7 ST (103, signed type, 1, max, min, U(s, add), 1) \
10 ST (111, signed type, max, -1, min, U(s, sub), 1) \
11 ST (112, signed type, max, 0, max, U(s, sub), 0) \
12 ST (113, signed type, 1, max, mi
[all...]
/haiku-buildtools/cloog/test/
H A D4-param.c8 for (i=max(m,p);i<=min(n,q);i++) {
12 for (i=max(max(m,p),q+1);i<=n;i++) {
15 for (i=max(max(m,p),n+1);i<=q;i++) {
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/
H A Dpr46085-1.c18 float max = x; local
26 max = max < c[i] ? c[i] : max;
36 if (max != max_result)
H A Dpr46085-2.c18 double max = x; local
26 max = max < c[i] ? c[i] : max;
36 if (max != max_result)
/haiku-buildtools/isl/test_inputs/codegen/cloog/
H A D4-param.c6 for (int c0 = max(m, p); c0 <= min(q, n); c0 += 1) {
10 for (int c0 = max(max(m, p), q + 1); c0 <= n; c0 += 1)
12 for (int c0 = max(max(m, n + 1), p); c0 <= q; c0 += 1)
H A Dotl.c3 for (int c1 = max(c0 - (M + 2) / 5, (c0 + 1) / 2); c1 <= min(min((2 * N + 5 * c0 + 1) / 10, c0), (M + 2 * N) / 5 - 1); c1 += 1)
4 for (int c2 = max(max(max(max(c0 - (M + N + 4) / 5 + 1, c1 - (N + 6) / 5 + 1), floord(-N + 5 * c0 - 3, 10) + 1), 0), c0 - c1 - 1); c2 <= min(min(min((M + N - 2) / 5, (N + 5 * c0 + 3) / 10), c0 - c1 + (N - 1) / 5 + 1), c1); c2 += 1)
5 for (int c3 = max(max(max(2 * c1 - (2 * N + 5) / 5 + 1, 2 * c2 - (N + 2) / 5), c1 + c2 - (N + 3) / 5), c0); c3 <= min(min(min(min(min(c1 + (M - 2) / 5 + 1, 2 * c2 + (N - 2) / 5 + 1), c0 + 1), c1 + c2 + 1), (2 * M + 2 * N - 1) / 5 - 1), c2 + (M + N) / 5); c3 += 1)
6 for (int c4 = max(max(ma
[all...]
H A Dmin-4-1.c1 for (int c0 = max(-N, -M); c0 <= min(O, N); c0 += 1)
/haiku-buildtools/gcc/libstdc++-v3/testsuite/util/
H A Dtestsuite_rng.h68 unsigned long max = UINT_MAX - 1)
70 _GLIBCXX_DEBUG_ASSERT(max >= min);
72 const unsigned long r = (unsigned long)((max - min + 1) * prob) + min;
73 _GLIBCXX_DEBUG_ASSERT(r <= max);
81 const double max = m_base_generator.max(); local
82 const double range = static_cast<const double>(max - min);
/haiku-buildtools/isl/test_inputs/codegen/
H A Dstride6.c2 for (int c2 = max(-((niter - c1) % 32) + niter - c1 - 32, -((niter - 1) % 32) + niter - 1); c2 <= min(niter + 1022, niter - c1 - 1); c2 += 32)
3 for (int c5 = max(max(niter - c1 - c2 - 32, -c1 - 1023), 0); c5 <= min(min(-c1, niter - c1 - c2 - 1), 31); c5 += 1)
/haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/random/logistic_distribution/cons/
H A Ddefault.cc39 VERIFY( u.min() == -std::numeric_limits<result_type>::max() );
40 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
H A Dparms.cc39 VERIFY( u.min() == -std::numeric_limits<result_type>::max() );
40 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp1y/
H A Dconstexpr-initlist1.C5 constexpr int max(std::initializer_list<int> ints) function
18 constexpr int z = max({7,6,5,4,3,2,1});
19 constexpr int z2 = max({5,4,3,2,1});
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/
H A Dinline-1.c7 double max; member in struct:__anon2432
14 r.max = x.max + y.max;
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/powerpc/
H A Dpr48258-1.c53 float max = values[0]; local
56 max = __builtin_fmaxf (max, values[i]);
58 return max;
H A Dpr48258-2.c46 double max = values[0]; local
49 max = __builtin_fmax (max, values[i]);
51 return max;
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/atomic/
H A Dstdatomic-compare-exchange-1.c12 char max = ~0; variable
20 if (!atomic_compare_exchange_strong_explicit (&v, &expected, max, memory_order_relaxed, memory_order_relaxed))
27 if (expected != max)
32 if (expected != max)
46 if (v != max)
51 if (!atomic_compare_exchange_strong (&v, &expected, max))
58 if (expected != max)
63 if (expected != max)
77 if (v != max)
H A Dstdatomic-compare-exchange-2.c12 short max = ~0; variable
20 if (!atomic_compare_exchange_strong_explicit (&v, &expected, max, memory_order_relaxed, memory_order_relaxed))
27 if (expected != max)
32 if (expected != max)
46 if (v != max)
51 if (!atomic_compare_exchange_strong (&v, &expected, max))
58 if (expected != max)
63 if (expected != max)
77 if (v != max)
H A Dstdatomic-compare-exchange-3.c12 int max = ~0; variable
20 if (!atomic_compare_exchange_strong_explicit (&v, &expected, max, memory_order_relaxed, memory_order_relaxed))
27 if (expected != max)
32 if (expected != max)
46 if (v != max)
51 if (!atomic_compare_exchange_strong (&v, &expected, max))
58 if (expected != max)
63 if (expected != max)
77 if (v != max)
H A Dstdatomic-compare-exchange-4.c12 long long max = ~0LL; variable
20 if (!atomic_compare_exchange_strong_explicit (&v, &expected, max, memory_order_relaxed, memory_order_relaxed))
27 if (expected != max)
32 if (expected != max)
46 if (v != max)
51 if (!atomic_compare_exchange_strong (&v, &expected, max))
58 if (expected != max)
63 if (expected != max)
77 if (v != max)
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/
H A Datomic-compare-exchange-4.c14 long long max = ~0; variable
25 if (!__atomic_compare_exchange_n (&v, &expected, max, STRONG , __ATOMIC_RELAXED, __ATOMIC_RELAXED))
32 if (expected != max)
37 if (expected != max)
51 if (v != max)
58 if (!__atomic_compare_exchange (&v, &expected, &max, STRONG, __ATOMIC_RELAXED, __ATOMIC_RELAXED))
65 if (expected != max)
70 if (expected != max)
84 if (v != max)

Completed in 182 milliseconds

1234567891011>>