/haiku-buildtools/gcc/zlib/examples/ |
H A D | enough.c | 15 Fix bug for initial root table size == max - 1 124 len: 1..max - 1 (max == maximum code length in bits) 131 len is less than max, since the code completes immediately when len == max. 135 We build the array with length max-1 lists for the len index, with syms-3 167 local int max; /* maximum allowed bit length for the codes */ variable 176 #define INDEX(i,j,k) (((size_t)((i-1)>>1)*((i-2)>>1)+(j>>1)-1)*(max-1)+k-1) 196 len through max inclusive, coding syms symbols, with left bit patterns of 199 calculation. Uses the globals max an [all...] |
/haiku-buildtools/binutils/zlib/examples/ |
H A D | enough.c | 15 Fix bug for initial root table size == max - 1 127 len: 1..max - 1 (max == maximum code length in bits) 134 len is less than max, since the code completes immediately when len == max. 138 We build the array with length max-1 lists for the len index, with syms-3 170 local int max; /* maximum allowed bit length for the codes */ variable 179 #define INDEX(i,j,k) (((size_t)((i-1)>>1)*((i-2)>>1)+(j>>1)-1)*(max-1)+k-1) 199 len through max inclusive, coding syms symbols, with left bit patterns of 202 calculation. Uses the globals max an [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.pt/ |
H A D | t16.C | 3 template <class T> T max (const T&x, const T&y) function 26 int j = max (1, 37); 27 complex m1 = max (c1, c2);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/ |
H A D | sse4_1-pmaxsb.c | 28 char max; local 42 max = src1.i[i] <= src2.i[i] ? src2.i[i] : src1.i[i]; 43 if (max != dst.i[i])
|
H A D | sse4_1-pmaxsd.c | 28 int max; local 42 max = src1.i[i] <= src2.i[i] ? src2.i[i] : src1.i[i]; 43 if (max != dst.i[i])
|
H A D | sse4_1-pmaxud.c | 28 unsigned int max; local 43 max = src1.i[i] <= src2.i[i] ? src2.i[i] : src1.i[i]; 44 if (max != dst.i[i])
|
H A D | sse4_1-pmaxuw.c | 28 unsigned short max; local 43 max = src1.i[i] <= src2.i[i] ? src2.i[i] : src1.i[i]; 44 if (max != dst.i[i])
|
/haiku-buildtools/gcc/zlib/ |
H A D | inftrees.c | 42 unsigned min, max; /* minimum and maximum code lengths */ local 114 for (max = MAXBITS; max >= 1; max--) 115 if (count[max] != 0) break; 116 if (root > max) root = max; 117 if (max == 0) { /* no symbols to code at all */ 126 for (min = 1; min < max; min++) 137 if (left > 0 && (type == CODES || max ! [all...] |
/haiku-buildtools/isl/test_inputs/codegen/omega/ |
H A D | wak3-1.c | 8 for (int c0 = max(a + 10, b + 1); c0 <= min(b + 10, a + 19); c0 += 1) 15 for (int c0 = max(a + 20, b + 1); c0 <= b + 10; c0 += 1) { 19 for (int c0 = max(a + 20, b + 11); c0 <= b + 20; c0 += 1)
|
H A D | lu-3.c | 5 for (int c4 = max(c3 + 1, c1); c4 <= min(c1 + 63, n); c4 += 1) 7 for (int c4 = max(c2 + 1, c1); c4 <= min(n, c1 + 63); c4 += 1) 12 for (int c4 = max(c3 + 1, c1); c4 <= min(c1 + 63, n); c4 += 1)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ipa/ |
H A D | ipa-icf-2.c | 12 static struct container max; variable in typeref:struct:container 30 max.x = 3; 52 max.x = 3;
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/27_io/types/ |
H A D | 3.cc | 39 check(std::numeric_limits<std::streamsize>::max()); 40 check(std::numeric_limits<std::streamsize>::max() - 1); 41 check(std::numeric_limits<std::streamsize>::max() / 2);
|
/haiku-buildtools/binutils/zlib/ |
H A D | inftrees.c | 42 unsigned min, max; /* minimum and maximum code lengths */ local 114 for (max = MAXBITS; max >= 1; max--) 115 if (count[max] != 0) break; 116 if (root > max) root = max; 117 if (max == 0) { /* no symbols to code at all */ 126 for (min = 1; min < max; min++) 137 if (left > 0 && (type == CODES || max ! [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | vrp89.c | 7 #define A(fn, arg, min, max) \ 8 if (__builtin_##fn (arg) < min || __builtin_##fn (arg) > max) \ 10 #define B(fn, min, max) \ 11 A (fn, a, min, max) A (fn##l, b, min, max) A (fn##ll, c, min, max)
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/22_locale/ctype/is/wchar_t/ |
H A D | 2.cc | 39 // const int max = numeric_limits<char>::max(); 40 const int max = 255; local 42 vector_type v_c(max); 43 vector_type v_de(max); 48 for (int i = 0; i < max; ++i) 65 for (int i = 0; i < max; ++i) 80 for (int i = 0; i < max; ++i)
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/22_locale/ctype/is/char/ |
H A D | 2.cc | 39 // const int max = numeric_limits<char>::max(); 40 const int max = 255; local 42 vector_type v_c(max); 43 vector_type v_de(max); 48 for (int i = 0; i < max; ++i) 65 for (int i = 0; i < max; ++i) 80 for (int i = 0; i < max; ++i)
|
/haiku-buildtools/binutils/ld/testsuite/ld-elf/ |
H A D | commonpage1.d | 2 #ld: -z max-page-size=0x200000 -z common-page-size=0x100000
|
H A D | commonpage2.d | 3 #ld: -z max-page-size=0x200000 -z common-page-size=0x100000 -T maxpage4.t
|
H A D | textaddr3.d | 2 #ld: -Ttext-segment 0x10000 -z max-page-size=0x200000
|
H A D | textaddr5.d | 2 #ld: -shared -z max-page-size=0x200000 -Ttext-segment 0x10000
|
H A D | textaddr7.d | 2 #ld: -n -z max-page-size=0x200000 -Ttext-segment 0x10000
|
/haiku-buildtools/legacy/binutils/gas/config/ |
H A D | tc-tic4x.h | 81 #define md_do_align(n,fill,len,max,label) if( tic4x_do_align (n,fill,len,max) ) goto label;
|
/haiku-buildtools/cloog/test/ |
H A D | iftest.good.c | 7 #define max(x,y) ((x) > (y) ? (x) : (y)) macro 20 if (i >= max(m,2*m+1)) {
|
H A D | min-4-1.good.c | 7 #define max(x,y) ((x) > (y) ? (x) : (y)) macro 16 for (i=max(-M,-N);i<=min(O,N);i++) {
|
/haiku-buildtools/cloog/test/isl/ |
H A D | unroll2.good.c | 7 #define max(x,y) ((x) > (y) ? (x) : (y)) macro 17 for (i=max(0,M);i<=M+1;i++) {
|