/haiku-buildtools/gcc/gcc/testsuite/g++.dg/eh/ |
H A D | omit-frame-pointer2.C | 5 void step (int) function 12 step (2); 20 step (1); 22 step (-1); 26 step (3);
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | pr36192_1.f90 | 6 call step(x_hq) 8 subroutine step(x) subroutine in program:three_body 10 end subroutine step
|
H A D | sms-1.f90 | 15 subroutine test (a, l, u, step) 17 integer (kind = 8), intent (in) :: l, u, step local in subroutine:test 22 do i = l, u, step
|
H A D | pr20086.f90 | 8 if (line.ne.' stiffness reformed for this high step')call abort 13 2070 format (2x,37hstiffness reformed for this high step)
|
H A D | do_1.f90 | 8 ! limit=HUGE(i), step 1 14 ! limit=HUGE(i), step > 1 26 ! Same again, but unknown loop step 60 function test1(r, step) 62 integer test1, r, step local in function:test1 65 do n = HUGE(n) - r, HUGE(n), step 71 subroutine test2 (lim, step) 73 integer lim, step local in subroutine:test2 76 do n = 1, lim, step
|
H A D | do_3.F90 | 9 #define TEST_LOOP(var,from,to,step,total,test,final) \ 10 count = 0 ; do var = from, to, step ; count = count + 1 ; end do ; \ 12 if (test (from, to, step, final) /= total) call abort 77 function test_i1 (from, to, step, final) result(res) 78 integer(kind=1), intent(in) :: from, to, step, final local in function:test_i1 83 do i = from, to, step 89 function test_i (from, to, step, final) result(res) 90 integer, intent(in) :: from, to, step, final local in function:test_i 95 do i = from, to, step 101 function test_r (from, to, step, fina 102 real, intent(in) :: from, to, step local in function:test_r [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/ |
H A D | pr53397-2.c | 1 /* Not prefetching when the step is loop variant. */ 7 void donot_prefetch_when_non_constant_step_is_variant(int step, int n) argument 11 for (a = 1; a < step; a++,step*=2) { 12 for (b = 0; b < n; b += 2 * step) { 15 int j = 2*(b + a + step); 25 /* { dg-final { scan-tree-dump "loop variant step" "aprefetch" } } */
|
H A D | pr53397-1.c | 1 /* Prefetching when the step is loop invariant. */ 8 void prefetch_when_non_constant_step_is_invariant(int step, int n) argument 12 for (a = 1; a < step; a++) { 13 for (b = 0; b < n; b += 2 * step) { 16 int j = 2*(b + a + step);
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | loop-8.c | 1 /* A test for strength reduction of ivs with nonconstant step. */ 12 int iter, step = bar (); local 15 a[iter * step] = bar (); 19 the step, we need to calculate step * sizeof (int), thus we need to be 22 /* { dg-final { scan-tree-dump-times "step \\* \[^0-9\]" 0 "optimized" } } */ 23 /* { dg-final { scan-tree-dump-times "\[^0-9\] \\* step" 0 "optimized" } } */
|
H A D | pr64705.c | 8 register long step, iter; local 12 step = i + i + 3; 13 for(iter = i + step ; iter <= len ; iter += step) 24 /* Don't expand iv {base+step, step}_loop into {base+x+y, step}_loop 25 even if "step == x + y". */ 26 /* { dg-final { scan-tree-dump "base step_\[0-9\]* \\+ iter|base iter_\[0-9\]* \\+ step" "ivopts"} } */
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/aarch64/ |
H A D | vrecps.c | 14 float32_t step = vrecpes_f32 (value); local 17 step = step * vrecpss_f32 (step, value); 19 return fabs (step - reciprocal) < 0.001; 36 float32x2_t step = vrecpe_f32 (value); local 39 step = step * vrecps_f32 (step, value); 41 ret &= fabs (vget_lane_f32 (step, 63 float32x4_t step = vrecpeq_f32 (value); local 89 float64_t step = vrecped_f64 (value); local 111 float64x2_t step = vrecpeq_f64 (value); local [all...] |
/haiku-buildtools/gcc/gmp/mpz/ |
H A D | hamdist.c | 61 mp_size_t old_vsize, step; variable 116 step = old_vsize - vsize - 1; 117 count += step * GMP_NUMB_BITS; 118 step = MIN (step, usize); 119 if (step != 0) 121 count -= mpn_popcount (up, step); 122 usize -= step; 123 up += step; 140 step [all...] |
H A D | fac_ui.c | 240 /* start,step are mp_limb_t although they will fit in unsigned long */ 242 ap_product_small (mpz_t ret, mp_limb_t start, mp_limb_t step, argument 264 b = start + step; 265 for (a = 0; a < count - 1; b += step, a++) 269 MPZ_SET_1_NZ (ret, start * (start + step)); 272 for (b = start + 2 * step, a = count / 2 - 1; a != 0; 273 a--, b += 2 * step) 274 MPZ_MUL_1_POS (ret, ret, b * (b + step)); 281 MPZ_SET_1_NZ (ret, start * (start + step)); 284 MPZ_SET_1_NZ (ret, start * (start + step) * (star [all...] |
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.c/ |
H A D | omp-loop01.c | 10 int i, N1, N2, step; local 15 step = rand () % 7 + 1; 17 printf ("N1 = %d\nN2 = %d\nstep = %d\n", N1, N2, step); 19 for (i = N1; i <= N2; i += step) 24 #pragma omp parallel shared(a,b,N1,N2,step) private(i) 27 for (i = N1; i < N2; i += step) 32 for (i = N1; i < N2; i += step) 36 printf ("for (i = %d; i < %d; i += %d) [OK]\n", N1, N2, step); 40 #pragma omp parallel shared(a,b,N1,N2,step) private(i) 43 for (i = N1; i <= N2; i += step) [all...] |
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.c++/ |
H A D | loop-1.C | 10 int i, N1, N2, step; local 15 step = rand () % 7 + 1; 17 printf ("N1 = %d\nN2 = %d\nstep = %d\n", N1, N2, step); 19 for (i = N1; i <= N2; i += step) 24 #pragma omp parallel shared(a,b,N1,N2,step) private(i) 27 for (i = N1; i < N2; i += step) 32 for (i = N1; i < N2; i += step) 36 printf ("for (i = %d; i < %d; i += %d) [OK]\n", N1, N2, step); 40 #pragma omp parallel shared(a,b,N1,N2,step) private(i) 43 for (i = N1; i <= N2; i += step) [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | 20000605-1.c | 16 float step; local 21 step = 1.0 / info->scaley; 23 error = y * step; 24 error -= ((int) error) - step; 32 error += step;
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 20120917-1.c | 9 long step = (left > 0x7FFFFFFFLL - 0x1LL) ? 2147483647L - 1L : (long)left; local 10 left -= step;
|
H A D | 990523-1.c | 5 static const int step = 2; local 15 for (j=15;j;j--,b0-=0x20,window-=0x10,samples+=step)
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/ |
H A D | pr45393.C | 29 unsigned step = 0, num = 100; local 31 float angle = static_cast<float>(step) / num * 2.0f * piFloat; 34 step++; 35 if (step == 1)
|
/haiku-buildtools/gcc/gcc/testsuite/c-c++-common/tsan/ |
H A D | step.c | 7 void step (int i) function
|
/haiku-buildtools/gcc/gmp/scanf/ |
H A D | fscanffuns.c | 42 step (FILE *fp, int n) function 48 (gmp_doscan_step_t) step,
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/23_containers/create_from_sorted/ |
H A D | set.cc | 29 static const unsigned step = 50000; // keeping the total time reasonable local 35 for (test_type count = step; count <= max_size; count += step)
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/23_containers/insert_from_sorted/ |
H A D | set.cc | 32 static const unsigned step = 50000; local 44 for (unsigned int count = step; count <= max_size; count += step)
|
/haiku-buildtools/gcc/gcc/c-family/ |
H A D | c-cilkplus.c | 110 tree t, v, n1, n2, step, type, init, cond, incr, itype; local 151 step = NULL_TREE; 156 step = build_int_cst (TREE_TYPE (v), 1); 160 step = build_int_cst (TREE_TYPE (v), -1); 168 step = TREE_OPERAND (t, 1); 171 step = fold_convert (ssizetype, TREE_OPERAND (t, 1)); 174 step = TREE_OPERAND (t, 1); 175 step = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (step), step); [all...] |
/haiku-buildtools/gcc/gcc/ |
H A D | tree-ssa-loop-prefetch.c | 269 tree step; /* Step of the reference. */ member in struct:mem_ref_group 324 dump_mem_details (FILE *file, tree base, tree step, argument 329 fprintf (file, ", step "); 330 if (cst_and_fits_in_hwi (step)) 331 fprintf (file, HOST_WIDE_INT_PRINT_DEC, int_cst_value (step)); 333 print_generic_expr (file, step, TDF_TREE); 351 dump_mem_details (file, ref->group->base, ref->group->step, ref->delta, 359 find_or_create_group (struct mem_ref_group **groups, tree base, tree step) argument 365 if (operand_equal_p ((*groups)->step, step, 457 tree *step; /* Step of the memory reference. */ member in struct:ar_data 468 tree ibase, step, stepsize; local 520 analyze_ref(struct loop *loop, tree *ref_p, tree *base, tree *step, HOST_WIDE_INT *delta, gimple stmt) argument 572 tree base, step; local 701 HOST_WIDE_INT step; local 757 is_miss_rate_acceptable(unsigned HOST_WIDE_INT cache_line_size, HOST_WIDE_INT step, HOST_WIDE_INT delta, unsigned HOST_WIDE_INT distinct_iters, int align_unit) argument 803 HOST_WIDE_INT step; local 1481 tree step; local [all...] |