Searched refs:max (Results 251 - 275 of 1128) sorted by relevance

<<11121314151617181920>>

/haiku-buildtools/cloog/test/non_optimal/
H A Dnul_complex1.c4 for (c2=max(ceild(2*c1,3),c1-n);c2<=min(floord(2*c1+2*n,3),c1);c2++) {
/haiku-buildtools/cloog/test/reservoir/
H A Dloechner3.c5 for (c6=max(1,-c2+c4);c6<=min(M,c4-1);c6++) {
H A Dloechner4.c6 for (c8=max(1,c2-M);c8<=min(M,c2-1);c8++) {
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/
H A D20090917-1.c47 build_access_matrix (unsigned max) argument
50 for (i = 0; i < max; i++)
/haiku-buildtools/isl/test_inputs/codegen/cloog/
H A Djacobi-shared.c2 for (int c0 = max(((g1 + t0 + 13) % 16) - g1 + 3, ((t0 + 15) % 16) + 1); c0 <= min(32, N - g1 - 1); c0 += 16)
H A Dnul_complex1.c2 for (int c1 = max(2 * floord(c0 - 1, 3) + 2, -((n + c0 + 1) % 2) - n + c0 + 1); c1 <= min(c0, n + c0 - (n + c0 + 2) / 3); c1 += 2)
H A Dreservoir-lim-lam1.c4 for (int c3 = max(-2 * c1 + 3, 1); c3 <= min(-2 * c1 + 199, 199); c3 += 2) {
H A Dreservoir-loechner3.c3 for (int c5 = max(-c1 + c3, 1); c5 <= min(M, c3 - 1); c5 += 1)
H A Dreservoir-loechner4.c4 for (int c7 = max(1, -M + c1); c7 <= min(c1 - 1, M); c7 += 1)
H A Dreservoir-pingali1.c3 for (int c5 = max(1, -N + c3); c5 < (c3 + 1) / 2; c5 += 1)
/haiku-buildtools/isl/test_inputs/codegen/omega/
H A Dwak2-0.c6 for (int c0 = max(a1, a2); c0 <= min(b2, b1); c0 += 1)
20 for (int c1_0 = max(d2 + 1, c1); c1_0 <= d1; c1_0 += 1)
23 for (int c0 = max(max(a1, a2), b2 + 1); c0 <= b1; c0 += 1)
H A Dts1d-mp-i_ts-m_b-0.c12 for (int c4 = max(1000 * c1 + 4000 * c3 - 3999, 500 * c1 + 1); c4 <= min(min(2 * N - 4000 * c3 + 3995, N + T - 3), 1000 * c1 + 4000 * c3 - 3000); c4 += 1)
13 for (int c5 = max(0, -N - 500 * c1 + c4 + 2); c5 <= min(min(-500 * c1 + c4 - 1, -500 * c1 - 2000 * c3 + (c4 + 1) / 2 + 1999), T - 500 * c1 - 1); c5 += 1)
15 for (int c3 = max(-((T + 4000) / 4000) + 2, -((c1 + 9) / 8) + 2); c3 <= floord(N - 500 * c1 - 3, 4000) + 1; c3 += 1)
16 for (int c4 = max(1000 * c1 + 4000 * c3 - 3999, -4000 * c3 + 4000); c4 <= min(min(2 * N - 4000 * c3 + 3995, 2 * T + 4000 * c3 - 4000), 1000 * c1 + 4000 * c3 - 3000); c4 += 1)
19 for (int c4 = max(1000 * c1 + 4000 * c3 - 2999, 500 * c1 + 1); c4 <= min(min(N + T - 3, N + 500 * c1 + 497), 1000 * c1 + 4000 * c3); c4 += 1)
20 for (int c5 = max(0, -N - 500 * c1 + c4 + 2); c5 <= min(min(-500 * c1 + c4 - 1, 499), T - 500 * c1 - 1); c5 += 1)
22 for (int c3 = max(-((T + 4000) / 4000) + 1, -((c1 + 9) / 8) + 1); c3 <= floord(N - 500 * c1 - 3, 4000); c3 += 1)
23 for (int c4 = max(1000 * c1 + 4000 * c3 + 1, -4000 * c3); c4 <= min(min(2 * N - 4000 * c3 - 5, 2 * T + 4000 * c3), 1000 * c1 + 4000 * c3 + 1000); c4 += 1)
26 for (int c4 = max(-4000 * c3 + 2, 1000 * c1 + 4000 * c3 + 1); c4 <= min(min(min(N + T - 3, N + 500 * c1 + 497), 2 * T + 4000 * c3 - 2), 1000 * c1 + 4000 * c3 + 998); c4 += 1)
27 for (int c5 = max(
[all...]
/haiku-buildtools/isl/test_inputs/codegen/
H A Dseparation_class4.c9 for (int c3 = max(4 * c0 - 2, 4 * c0 + 6 * c2 - 12); c3 <= min(4 * c0 + 6 * c2 - 7, 4 * c0 + 1); c3 += 1)
10 for (int c5 = max(4 * c0 - c3 + 57, -4 * c0 + c3 + 58); c5 <= min(-4 * c0 + c3 + 62, 4 * c0 - c3 + 61); c5 += 1)
13 for (int c3 = max(4 * c0 + 6 * c2 - 10, 4 * c0); c3 <= min(4 * c0 + 6 * c2 - 5, 4 * c0 + 3); c3 += 1)
14 for (int c5 = max(4 * c0 - c3 + 62, -4 * c0 + c3 + 59); c5 <= min(4 * c0 - c3 + 66, -4 * c0 + c3 + 63); c5 += 1)
/haiku-buildtools/binutils/ld/testsuite/ld-elf/
H A Dmaxpage4.d3 #ld: -z max-page-size=0x200000 -T maxpage4.t
H A Dnoload-2.d2 #ld: -T noload-1.t -z max-page-size=0x200000
/haiku-buildtools/binutils/ld/testsuite/ld-pie/
H A Dvaddr-1.d3 #ld: -pie -Ttext-segment 0x7000000 -z max-page-size=0x200000
/haiku-buildtools/gcc/libstdc++-v3/testsuite/27_io/basic_istream/extractors_arithmetic/char/
H A Ddr696.cc34 oss1 << numeric_limits<short>::max();
37 VERIFY( s1 == numeric_limits<short>::max() );
42 oss2 << static_cast<long long>(numeric_limits<short>::max()) + 1;
45 VERIFY( s2 == numeric_limits<short>::max() );
66 oss5 << numeric_limits<int>::max();
69 VERIFY( i1 == numeric_limits<int>::max() );
74 oss6 << static_cast<long long>(numeric_limits<int>::max()) + 1;
77 VERIFY( i1 == numeric_limits<int>::max() );
/haiku-buildtools/gcc/libstdc++-v3/testsuite/27_io/basic_istream/extractors_arithmetic/wchar_t/
H A Ddr696.cc34 oss1 << numeric_limits<short>::max();
37 VERIFY( s1 == numeric_limits<short>::max() );
42 oss2 << static_cast<long long>(numeric_limits<short>::max()) + 1;
45 VERIFY( s2 == numeric_limits<short>::max() );
66 oss5 << numeric_limits<int>::max();
69 VERIFY( i1 == numeric_limits<int>::max() );
74 oss6 << static_cast<long long>(numeric_limits<int>::max()) + 1;
77 VERIFY( i1 == numeric_limits<int>::max() );
/haiku-buildtools/gcc/gcc/testsuite/c-c++-common/gomp/
H A Dpr58809.c19 #pragma omp parallel reduction (max:j) /* { dg-error "has invalid type for|user defined reduction not found for" } */
29 #pragma omp parallel reduction (max:d) /* { dg-error "has invalid type for|user defined reduction not found for" } */
/haiku-buildtools/gcc/libstdc++-v3/testsuite/util/io/
H A Dprog_bar.cc44 prog_bar(std::size_t max, std::ostream& r_os, bool display/*= true*/) : argument
46 m_max(max),
/haiku-buildtools/binutils/gas/config/
H A Dtc-tic4x.h82 #define md_do_align(n,fill,len,max,label) if( tic4x_do_align (n,fill,len,max) ) goto label;
/haiku-buildtools/binutils/gas/
H A Dsb.c63 ptr->max = size;
131 if (want > ptr->max)
133 size_t max; local
139 max = (size_t) 1 << (CHAR_BIT * sizeof (want)
144 max = 128;
145 while (want > max)
146 max <<= 1;
148 max -= MALLOC_OVERHEAD + 1;
149 ptr->max = max;
[all...]
/haiku-buildtools/isl/
H A Disl_lp.c62 enum isl_lp_result isl_basic_map_solve_lp(struct isl_basic_map *bmap, int max, argument
75 return isl_pip_solve_lp(bmap, max, f, d, opt, opt_denom, sol);
77 return isl_tab_solve_lp(bmap, max, f, d, opt, opt_denom, sol);
83 enum isl_lp_result isl_basic_set_solve_lp(struct isl_basic_set *bset, int max, argument
88 return isl_basic_map_solve_lp((struct isl_basic_map *)bset, max,
92 enum isl_lp_result isl_map_solve_lp(__isl_keep isl_map *map, int max, argument
136 res = isl_basic_map_solve_lp(map->p[0], max, f, d,
149 res_i = isl_basic_map_solve_lp(map->p[i], max, f, d,
162 if (max)
169 if (max)
201 isl_set_solve_lp(__isl_keep isl_set *set, int max, isl_int *f, isl_int d, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) argument
220 basic_set_opt_lp( __isl_keep isl_basic_set *bset, int max, __isl_keep isl_aff *obj) argument
259 isl_basic_set_opt_lp_val_aligned( __isl_keep isl_basic_set *bset, int max, __isl_keep isl_aff *obj) argument
324 isl_basic_set_opt_lp_val( __isl_keep isl_basic_set *bset, int max, __isl_keep isl_aff *obj) argument
[all...]
/haiku-buildtools/binutils/gas/testsuite/gas/mmix/
H A Dgreg9.s1 % Check that we can allocate max number of GREGs.
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/mmix/
H A Dgreg9.s1 % Check that we can allocate max number of GREGs.

Completed in 125 milliseconds

<<11121314151617181920>>