/haiku-buildtools/gcc/gcc/testsuite/gcc.target/m68k/ |
H A D | pic-1.c | 10 int cnt = 0; local 12 for (cnt = 0; cnt < 4; ++cnt) 14 char *ptr = ary[cnt];
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/powerpc/ |
H A D | pr52199.c | 18 int cnt; local 20 for (cnt=0; cnt < 7; cnt++) 22 time->abday[cnt] = ""; 23 time->wabday[cnt] = empty_wstr;
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | array_section_1.f90 | 10 integer :: a(5), b(3), cnt variable 14 cnt = 0 16 if (cnt /= 1) call abort () 17 cnt = 0 19 if (cnt /= 1) call abort () 20 cnt = 0 22 if (cnt /= 1) call abort () 24 cnt = 0 26 if (cnt /= 1) call abort () 27 cnt [all...] |
H A D | finalize_18.f90 | 18 integer, save :: cnt = -1 variable in module:m 22 if (cnt == -1) call abort () 23 cnt = cnt + 1
|
H A D | finalize_25.f90 | 20 integer :: cnt = 0 variable in module:gn 26 cnt = cnt + 1 43 cnt = 0 45 if (cnt /= 2) call abort() 47 cnt = 0 49 if (cnt /= 3) call abort()
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/ |
H A D | pr36613.c | 8 lshifts (int val, int cnt) argument 12 return val << cnt; 16 lshiftu (unsigned int val, unsigned int cnt) argument 18 if (cnt >= sizeof (unsigned int) * __CHAR_BIT__ 19 || val > ((__INT_MAX__ * 2U) >> cnt)) 21 return val << cnt; 25 rshifts (int val, unsigned int cnt) argument 27 if (val < 0 || cnt >= sizeof (int) * __CHAR_BIT__) 29 return val >> cnt;
|
/haiku-buildtools/gcc/libgcc/config/nios2/ |
H A D | lib2-mul.c | 31 USItype cnt = a; local 33 while (cnt) 35 if (cnt & 1) 38 cnt >>= 1;
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | pr17906.c | 4 usc_recressive_func(int cnt, int max, struct usc_bigstack_t bstack) argument 6 usc_recressive_func(cnt+1, max, bstack);
|
H A D | lll.c | 8 unsigned w, cnt = 0; local 18 cnt += ((m1 & w) == 0); 19 cnt += ((m2 & w) == 0); 20 cnt += ((m3 & w) == 0); 21 cnt += ((m4 & w) == 0); 25 cnt += ((m1 & w) == 0); 26 cnt += ((m2 & w) == 0); 27 cnt += ((m3 & w) == 0); 28 cnt += ((m4 & w) == 0); 32 cnt [all...] |
H A D | 20020706-2.c | 12 unsigned short cnt; local 19 cnt = count + 1; 25 (void)(*func)(funcparm, buff, cnt);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 961213-1.c | 4 int cnt; local 6 for (cnt = 0; cnt < n; ++cnt) 7 *v = *v * b + a[cnt];
|
H A D | pr49039.c | 3 int cnt; variable 14 ++cnt; 16 ++cnt; 23 if (cnt != 2)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | Warray-bounds-3.c | 30 size_t cnt; local 37 for (cnt = 0; cnt < 7; ++cnt) 39 iov[2 + cnt].iov_base = (void *) (time->abday[cnt] ?: ""); 40 iov[2 + cnt].iov_len = strlen (iov[2 + cnt].iov_base) + 1; 43 for (; cnt < 14; ++cnt) [all...] |
H A D | pr39443.c | 13 test (char *s, char *t, int cnt) 15 if (__builtin_expect (cnt, 0)) 16 return memcmp (s, t, cnt);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.other/ |
H A D | init5.C | 2 // Objects must be destructed in decreasing cnt order 7 static int cnt; variable 12 A() : myCnt(cnt++) {} 13 ~A() { if (--cnt != myCnt) abort(); } 21 B() : myCnt(cnt+1) { f(); ++cnt; } 22 ~B() { if (--cnt != myCnt) abort(); }
|
H A D | init18.C | 15 static int cnt = 0; variable 21 ~Foo2() { if (++cnt == 2) _exit (0); } 34 ~Foo1() { if (++cnt != 1) abort(); GetFoo2(); }
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/debug/ |
H A D | pr36690-2.c | 11 int cnt; variable 16 cnt += i;
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/debug/dwarf2/ |
H A D | pr36690-2.c | 8 int cnt; variable 13 cnt += i;
|
/haiku-buildtools/gcc/libquadmath/printf/ |
H A D | flt1282mpn.c | 70 int cnt; local 75 count_leading_zeros (cnt, res_ptr[N - 1]); 76 cnt -= NUM_LEADING_ZEROS; 77 res_ptr[N - 1] = res_ptr[N - 1] << cnt 78 | (res_ptr[0] >> (BITS_PER_MP_LIMB - cnt)); 79 res_ptr[0] <<= cnt; local 80 *expt = FLT128_MIN_EXP - 1 - cnt; 84 count_leading_zeros (cnt, res_ptr[0]); 85 if (cnt >= NUM_LEADING_ZEROS) 87 res_ptr[N - 1] = res_ptr[0] << (cnt [all...] |
/haiku-buildtools/gcc/gmp/mpn/generic/ |
H A D | mod_1_1.c | 37 int cnt; local 39 count_leading_zeros (cnt, b); 41 b <<= cnt; local 44 if (UNLIKELY (cnt == 0)) 47 B1modb = -b * ((bi >> (GMP_LIMB_BITS-cnt)) | (CNST_LIMB(1) << cnt)); 52 cps[1] = cnt; 53 cps[2] = B1modb >> cnt; 54 cps[3] = B2modb >> cnt; 63 int cnt; local [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/25_algorithms/ |
H A D | lexicographical_compare.cc | 30 int cnt = 0; local 37 ++cnt; 39 ++cnt; 45 return cnt;
|
/haiku-buildtools/gcc/gmp/mpf/ |
H A D | get_d_2exp.c | 30 int cnt; local 42 count_leading_zeros (cnt, ptr[abs_size - 1]); 43 cnt -= GMP_NAIL_BITS; 45 exp = EXP(src) * GMP_NUMB_BITS - cnt; 49 (long) - (abs_size * GMP_NUMB_BITS - cnt));
|
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.c++/ |
H A D | simd-2.C | 21 int i, j, cnt = 0; local 26 for (j = 0; j < cnt; j++) 29 if (j != cnt) 31 if (cnt == 16) 33 arr2[cnt++] = arr[i];
|
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.c/ |
H A D | simd-2.c | 21 int i, j, cnt = 0; local 26 for (j = 0; j < cnt; j++) 29 if (j != cnt) 31 if (cnt == 16) 33 arr2[cnt++] = arr[i];
|
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.fortran/ |
H A D | reduction2.f90 | 5 integer :: n, cnt variable 12 cnt = -1 20 cnt = omp_get_num_threads () 35 if (cnt .eq. 3) then 45 cnt = -1 53 cnt = omp_get_num_threads () 68 if (cnt .eq. 3) then
|