/haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/random/hoyt_distribution/cons/ |
H A D | default.cc | 36 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
|
H A D | parms.cc | 36 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/random/k_distribution/cons/ |
H A D | default.cc | 40 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
|
H A D | parms.cc | 40 VERIFY( u.max() == std::numeric_limits<result_type>::max() );
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/random/nakagami_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/ext/random/pareto_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/ext/random/rice_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/tr1/5_numerical_facilities/random/random_device/cons/ |
H A D | token.cc | 39 VERIFY( x.max() == std::numeric_limits<random_device::result_type>::max() );
|
/haiku-buildtools/cloog/test/ |
H A D | otl.c | 4 for (outerProcTileScatter1=max(ceild(outerTimeTileScatter,2),ceild(5*outerTimeTileScatter-M-2,5));outerProcTileScatter1<=min(min(floord(M+2*N-5,5),floord(5*outerTimeTileScatter+2*N+1,10)),outerTimeTileScatter);outerProcTileScatter1++) { 5 for (outerProcTileScatter2=max(max(max(max(ceild(outerTimeTileScatter-outerProcTileScatter1-1,2),ceild(5*outerProcTileScatter1-N-1,5)),ceild(5*outerTimeTileScatter-M-N+1,5)),ceild(5*outerTimeTileScatter-N-2,10)),outerTimeTileScatter-outerProcTileScatter1-1);outerProcTileScatter2<=min(min(min(floord(M+N-2,5),floord(5*outerTimeTileScatter-5*outerProcTileScatter1+N+4,5)),floord(5*outerTimeTileScatter+N+3,10)),outerProcTileScatter1);outerProcTileScatter2++) { 6 for (innerTimeTileScatter=max(max(max(ceild(10*outerProcTileScatter1-2*N,5),ceild(10*outerProcTileScatter2-N-2,5)),ceild(5*outerProcTileScatter1+5*outerProcTileScatter2-N-3,5)),outerTimeTileScatter);innerTimeTileScatter<=min(min(min(min(min(floord(2*M+2*N-6,5),floord(5*outerProcTileScatter1+M+3,5)),floord(5*outerProcTileScatter2+M+N,5)),floord(10*outerProcTileScatter2+N+3,5)),outerTimeTileScatter+1),outerProcTileScatter1+outerProcTileScatter2+1);innerTimeTileScatter++) { 7 for (innerProcTileScatter1=max(max(ma [all...] |
H A D | sor1d.good.c | 7 #define max(x,y) ((x) > (y) ? (x) : (y)) macro 23 for (rp1=max(max(0,ceild(100*glT1-2*M-N+5,100)),ceild(100*glT1-N-193,300));rp1<=min(min(min(min(floord(glT1+1,2),floord(M,100)),floord(100*glT1+99,100)),floord(50*glT1+51,150)),floord(100*glT1+N+98,300));rp1++) { 24 for (vT1=max(max(max(max(0,100*glT1-100*rp1),100*rp1-1),200*rp1-3),200*rp1-N+1);vT1<=min(min(2*M+N-5,100*glT1-100*rp1+99),200*rp1+N+193);vT1++) { 25 if (rp1 >= max(1,ceild(vT1-N+7,200))) { 28 for (vP1=max(max( [all...] |
H A D | otl.good.c | 7 #define max(x,y) ((x) > (y) ? (x) : (y)) macro 20 for (outerProcTileScatter1=max(ceild(outerTimeTileScatter,2),ceild(5*outerTimeTileScatter-M-2,5));outerProcTileScatter1<=min(min(floord(M+2*N-5,5),floord(5*outerTimeTileScatter+2*N+1,10)),outerTimeTileScatter);outerProcTileScatter1++) { 21 for (outerProcTileScatter2=max(max(max(max(max(ceild(outerTimeTileScatter-outerProcTileScatter1-1,2),ceild(5*outerProcTileScatter1-N-1,5)),ceild(5*outerTimeTileScatter-M-N+1,5)),ceild(5*outerTimeTileScatter-N-2,10)),ceild(5*outerTimeTileScatter-N-3,15)),outerTimeTileScatter-outerProcTileScatter1-1);outerProcTileScatter2<=min(min(min(floord(M+N-2,5),floord(5*outerTimeTileScatter-5*outerProcTileScatter1+N+4,5)),floord(5*outerTimeTileScatter+N+3,10)),outerProcTileScatter1);outerProcTileScatter2++) { 22 for (innerTimeTileScatter=max(max(max(ceil [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/vect/ |
H A D | vect-double-reduc-3.c | 17 int max, min, i, j, k; local 21 max = x; 26 max = max < in[i+k][j] ? in[i+k][j] : max; 29 out_max[k] = max;
|
H A D | vect-reduc-2char-big-array.c | 17 signed char max = x; local 43 max = max < c[i] ? c[i] : max; 53 if (max != max_result)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | vrp93.c | 8 #define A(fn, arg, min, max) \ 9 if (__builtin_##fn (arg) < min || __builtin_##fn (arg) > max) \ 11 #define B(fn, min, max) \ 12 A (fn, a, min, max) A (fn##l, b, min, max) A (fn##ll, c, min, max)
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/27_io/ios_base/storage/ |
H A D | 2.cc | 43 int max = std::numeric_limits<int>::max() - 1; local 58 v = ios.pword(max); 74 // max is different code path from max-1 78 v = ios.pword(std::numeric_limits<int>::max()); 98 l = ios.iword(max); 114 // max is different code path from max-1 118 l = ios.iword(std::numeric_limits<int>::max()); [all...] |
/haiku-buildtools/isl/ |
H A D | isl_scan.c | 21 isl_int max; member in struct:isl_counter 33 if (isl_int_is_zero(cnt->max) || isl_int_lt(cnt->count, cnt->max)) 38 static int increment_range(struct isl_scan_callback *cb, isl_int min, isl_int max) argument 42 isl_int_add(cnt->count, cnt->count, max); 46 if (isl_int_is_zero(cnt->max) || isl_int_lt(cnt->count, cnt->max)) 48 isl_int_set(cnt->count, cnt->max); 108 struct isl_vec *max; local 122 max 247 isl_basic_set_count_upto(__isl_keep isl_basic_set *bset, isl_int max, isl_int *count) argument 274 isl_set_count_upto(__isl_keep isl_set *set, isl_int max, isl_int *count) argument [all...] |
/haiku-buildtools/legacy/gcc/gcc/config/i386/ |
H A D | dgux.c | 37 output_option (file, sep, type, name, indent, pos, max) 44 int max; 46 if (strlen (sep) + strlen (type) + strlen (name) + pos > max) 58 pos, max, sep, indent, term) 64 int max; 71 pos = output_option (file, sep, "-O", "", indent, pos, max); 73 pos = output_option (file, sep, "-g", "", indent, pos, max); 75 pos = output_option (file, sep, "-traditional", "", indent, pos, max);*/ 77 pos = output_option (file, sep, "-p", "", indent, pos, max); 79 pos = output_option (file, sep, "-a", "", indent, pos, max); [all...] |
/haiku-buildtools/isl/test_inputs/codegen/omega/ |
H A D | wak2-1.c | 6 for (int c0 = max(a1, a2); c0 <= min(b2, b1); c0 += 1) 22 for (int c1_0 = max(c2, c1); c1_0 <= min(d1, d2); c1_0 += 1) { 26 for (int c1_0 = max(d2 + 1, c1); c1_0 <= d1; c1_0 += 1) 28 for (int c1_0 = max(max(d1 + 1, c1), c2); c1_0 <= d2; c1_0 += 1) 31 for (int c0 = max(max(a1, a2), b2 + 1); c0 <= b1; c0 += 1)
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | genattr.c | 46 int max; member in struct:range 71 extend_range (range, min, max) 74 int max; 77 if (range->max < max) range->max = max; 85 range->max = -1; 180 printf ("#define MAX_MULTIPLICITY %d\n", multiplicity->max); 182 printf ("#define MAX_SIMULTANEITY %d\n", simultaneity->max); [all...] |
/haiku-buildtools/cloog/test/isl/ |
H A D | stride.good.c | 7 #define max(x,y) ((x) > (y) ? (x) : (y)) macro 20 for (c2=max(ceild(2*c1-M+1,4),ceild(4*c1-M-2,4));c2<=min(0,floord(c1,2));c2++) { 21 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++) { 22 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/reservoir/ |
H A D | tang-xue1.good.c | 7 #define max(x,y) ((x) > (y) ? (x) : (y)) macro 19 for (c4=max(-1,c2-9);c4<=min(4,c2+3);c4++) { 20 for (c6=max(max(c2,1),c2-c4);c6<=min(min(c2+1,9),c2-c4+4);c6++) { 21 for (c8=max(1,-c2+c4+c6);c8<=min(4,-c2+c4+c6+1);c8++) {
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/autopar/ |
H A D | reduc-2.c | 20 int max = x; local 28 max = max < c[i] ? c[i] : max; 38 if (max != max_result)
|