/haiku-buildtools/cloog/test/isl/ |
H A D | stride.c | 4 for (c2=max(ceild(2*c1-M+1,4),ceild(4*c1-M-2,4));c2<=min(0,floord(c1,2));c2++) { 5 for (c3=max(max(-4*c2-2,4*c2+3),4*c1-4*c2+1);c3<=min(min(min(M+3,-4*c2+9),4*c2+2*M),4*c1-4*c2+4);c3++) { 6 for (c4=max(3*c3-4*floord(c3+M+1,2)+6,4*c2-c3-4*floord(-c3+1,4)+2);c4<=min(min(4*c2+4,-c3+10),c3-2);c4+=4) {
|
/haiku-buildtools/cloog/test/ |
H A D | rectangle.c | 3 for (i=max(0,c1-n);i<=min(c1,n);i++) {
|
H A D | wavefront.c | 4 for (c2=max(1,c1-m);c2<=min(n,c1-1);c2++) {
|
/haiku-buildtools/cloog/test/reservoir/ |
H A D | bastoul3.c | 3 for (j=max(i-6,i-2*floord(i+1,2)+2);j<=min(3,i-2);j+=2) {
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | visibility-1.C | 14 T max (T t1, T t2); 18 T myClass<T>::max (T t1, T t2) { function in class:myClass
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.robertl/ |
H A D | eb11.C | 5 enum { max = (N1 > N2) ? N1 : N2 }; enumerator in enum:meta_max::__anon1342 25 n = meta_max<T1::n,T2::n>::max
|
H A D | eb12.C | 7 enum { max = (N1 > N2) ? N1 : N2 }; enumerator in enum:meta_max::__anon1347 28 n = meta_max<T1::n,T2::n>::max
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | vrp62.c | 13 int max = atoi (argv[2]); 15 printf ("/* Testing range [%d, %d] with operator %c. */\n", min, max, op); 17 for (amin = min; amin <= max; ++amin) 18 for (amax = amin; amax <= max; ++amax) 19 for (bmin = min; bmin <= max; ++bmin) 20 for (bmax = bmin; bmax <= max; ++bmax) 43 " {\n", min, max, min, max);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/init/ |
H A D | new36.C | 16 static int max; variable 33 max = count; 62 max = 0; 70 if (max != 2) 129 max = 0; 137 if (max != 2) 140 max = 0; 148 if (max != 2)
|
/haiku-buildtools/isl/test_inputs/codegen/cloog/ |
H A D | constant.c | 6 for (int c1 = max(M + 1025, 0); c1 <= 1023; c1 += 1) { 14 for (int c0 = max(M + 1025, 0); c0 <= 1023; c0 += 1) {
|
H A D | rectangle.c | 2 for (int c1 = max(0, -n + c0); c1 <= min(c0, n); c1 += 1)
|
H A D | wavefront.c | 2 for (int c1 = max(-m + c0, 1); c1 <= min(n, c0 - 1); c1 += 1)
|
/haiku-buildtools/isl/test_inputs/codegen/ |
H A D | hoist2.c | 2 for (int c1 = max(t1, t1 - 64 * b + 64); c1 <= min(70, -((c0 + 1) % 2) - c0 + 73); c1 += 64)
|
/haiku-buildtools/isl/test_inputs/codegen/omega/ |
H A D | substitution-0.c | 2 for (int c1 = max(2 * c0 - 4, c0); c1 <= min(2 * c0, c0 + 6); c1 += 1)
|
H A D | substitution-1.c | 2 for (int c1 = max(2 * c0 - 12, -c0 + 3 * floord(c0 - 1, 2) + 3); c1 <= min(2 * c0, c0 / 2 + 9); c1 += 3)
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/vect/ |
H A D | pr60836.cc | 6 max (int &p1, int &p2) function 17 return max (p1, p2);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/26_numerics/random/extreme_value_distribution/cons/ |
H A D | default.cc | 39 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
|
H A D | parms.cc | 39 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/26_numerics/random/cauchy_distribution/cons/ |
H A D | default.cc | 39 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
|
H A D | parms.cc | 39 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/26_numerics/random/normal_distribution/cons/ |
H A D | default.cc | 39 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
|
H A D | parms.cc | 39 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/26_numerics/random/random_device/cons/ |
H A D | token.cc | 41 VERIFY( x.max() == std::numeric_limits<std::random_device::result_type>::max() );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/26_numerics/random/student_t_distribution/cons/ |
H A D | default.cc | 38 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
|
H A D | parms.cc | 38 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
|