/netbsd-current/external/mit/isl/dist/test_inputs/codegen/ |
H A D | stride6.c | 2 for (int c2 = max(-((niter - 1) % 32) + niter - 1, -((niter - c1) % 32) + niter - c1 - 32); c2 <= min(niter + 1022, niter - c1 - 1); c2 += 32) 3 for (int c5 = max(max(0, -c1 - 1023), niter - c1 - c2 - 32); c5 <= min(min(31, -c1), niter - c1 - c2 - 1); c5 += 1) 4 S_4(niter - 1, -c1 - c5);
|
/netbsd-current/external/bsd/jemalloc/dist/test/stress/ |
H A D | microbench.c | 4 time_func(timedelta_t *timer, uint64_t nwarmup, uint64_t niter, argument 12 for (i = 0; i < niter; i++) { 19 compare_funcs(uint64_t nwarmup, uint64_t niter, const char *name_a, argument 31 time_func(&timer_a, nwarmup, niter, func_a); 32 time_func(&timer_b, nwarmup, niter, func_b); 37 niter, name_a, timer_usec(&timer_a), name_b, timer_usec(&timer_b),
|
/netbsd-current/external/lgpl3/mpc/dist/tools/bench/ |
H A D | benchtime.h | 22 /* compute the time to run accurately niter calls of the function for any number of inputs */ 24 unsigned long int ACCURATE_TIME_NOP##func( unsigned long int niter, int n, mpc_t* z, mpc_t* x, mpc_t* y, int nop);\ 25 unsigned long int ACCURATE_TIME_NOP##func( unsigned long int niter, int n, mpc_t* z, mpc_t* x, \ 31 for (i = niter, kn=0; i > 0; i--) \ 39 /* address of the function to time accurately niter calls of func */ 62 /* compute the time to run accurately niter calls of the function */
|
H A D | mpcbench.c | 56 unsigned long int (*func_accurate) (unsigned long int niter, int n, mpc_t * z, mpc_t * x, mpc_t * y, int nop); /* compute the time for "niter" calls (accurate) */ 190 unsigned long niter, ti; local 223 niter = 1 + (unsigned long) (1e6 / t); 225 printf ("%9lu iter:", niter); 229 niter = (niter + 9) / 10; 230 ti = arrayfunc[i].func_accurate (niter, NB_RAND_CPLX, zptr, xptr, yptr, arrayfunc[i].noperands); 232 ops_per_time = 1e5 * niter / (double) ti;
|
/netbsd-current/external/lgpl3/mpfr/dist/tools/bench/ |
H A D | benchtime.h | 24 /* compute the time to run accurately niter calls of the function for any 27 unsigned long int ACCURATE_TIME_NOP##func( unsigned long int niter, int n, mpfr_t* z, mpfr_t* x, mpfr_t* y, int nop);\ 28 unsigned long int ACCURATE_TIME_NOP##func( unsigned long int niter, int n, mpfr_t* z, mpfr_t* x, mpfr_t* y, int nop)\ 32 for (i = niter, kn=0; i > 0; i--) \ 44 /* address of the function to time accurately niter calls of func */ 66 /* compute the time to run accurately niter calls of the function */
|
H A D | mpfrbench.c | 56 unsigned long int (*func_accurate) (unsigned long int niter, int n, mpfr_t * z, mpfr_t * x, mpfr_t * y, int nop); /* compute the time for "niter" calls (accurate) */ 153 unsigned long niter, ti; local 185 niter = 1 + (unsigned long) (1e6 / t); 187 printf (" %10lu iterations ...", niter); 191 ti = arrayfunc[i].func_accurate (niter, NB_RAND_FLOAT, zptr, xptr, yptr, arrayfunc[i].noperands); 193 ops_per_sec = (unsigned long) (1000000E0 * niter / (double) ti);
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | tree-ssa-loop-niter.cc | 39 #include "tree-ssa-loop-niter.h" 68 class tree_niter_desc *niter); 985 tree final, class tree_niter_desc *niter, 992 niter->control = *iv; 993 niter->bound = final; 994 niter->cmp = NE_EXPR; 1021 niter->max = widest_int::from (wi::from_mpz (niter_type, max, false), 1058 if (!niter->control.no_overflow 1108 niter->control.no_overflow = true; 1109 niter 984 number_of_iterations_ne(class loop *loop, tree type, affine_iv *iv, tree final, class tree_niter_desc *niter, bool exit_must_be_taken, bounds *bnds) argument 1162 number_of_iterations_lt_to_ne(tree type, affine_iv *iv0, affine_iv *iv1, class tree_niter_desc *niter, tree *delta, tree step, bool exit_must_be_taken, bounds *bnds) argument 1281 assert_no_overflow_lt(tree type, affine_iv *iv0, affine_iv *iv1, class tree_niter_desc *niter, tree step) argument 1350 assert_loop_rolls_lt(tree type, affine_iv *iv0, affine_iv *iv1, class tree_niter_desc *niter, bounds *bnds) argument 1475 number_of_iterations_until_wrap(class loop *loop, tree type, affine_iv *iv0, affine_iv *iv1, class tree_niter_desc *niter) argument 1609 number_of_iterations_lt(class loop *loop, tree type, affine_iv *iv0, affine_iv *iv1, class tree_niter_desc *niter, bool exit_must_be_taken, bounds *bnds) argument 1727 number_of_iterations_le(class loop *loop, tree type, affine_iv *iv0, affine_iv *iv1, class tree_niter_desc *niter, bool exit_must_be_taken, bounds *bnds) argument 1821 number_of_iterations_cond(class loop *loop, tree type, affine_iv *iv0, enum tree_code code, affine_iv *iv1, class tree_niter_desc *niter, bool only_exit, bool every_iteration) argument 2502 number_of_iterations_exit_assumptions(class loop *loop, edge exit, class tree_niter_desc *niter, gcond **at_stmt, bool every_iteration, basic_block *body) argument 2711 number_of_iterations_popcount(loop_p loop, edge exit, enum tree_code code, class tree_niter_desc *niter) argument 2852 number_of_iterations_exit(class loop *loop, edge exit, class tree_niter_desc *niter, bool warn, bool every_iteration, basic_block *body) argument 2884 tree niter = NULL_TREE, aniter; local 3242 tree niter = NULL_TREE, aniter; local 3561 record_control_iv(class loop *loop, class tree_niter_desc *niter) argument 4367 tree niter, type; local 4707 n_of_executions_at_most(gimple *stmt, class nb_iter_bound *niter_bound, tree niter) argument 4797 widest_int niter; local [all...] |
H A D | tree-ssa-loop-ivcanon.cc | 56 #include "tree-ssa-loop-niter.h" 85 create_canonical_iv (class loop *loop, edge exit, tree niter, argument 97 print_generic_expr (dump_file, niter, TDF_SLIM); 107 type of niter is always unsigned and all comparisons are 111 type = TREE_TYPE (niter); 112 niter = fold_build2 (PLUS_EXPR, type, 113 niter, 116 create_iv (niter, 440 loop-niter identified as having undefined effect in the last iteration. 568 class tree_niter_desc niter; local 687 try_unroll_loop_completely(class loop *loop, edge exit, tree niter, bool may_be_zero, enum unroll_level ul, HOST_WIDE_INT maxiter, dump_user_location_t locus, bool allow_peel) argument 991 try_peel_loop(class loop *loop, edge exit, tree niter, bool may_be_zero, HOST_WIDE_INT maxiter) argument 1167 tree niter; local [all...] |
H A D | tree-ssa-loop.h | 48 its latch will not be executed), even if the niter 50 tree niter; /* The expression giving the number of iterations of member in class:tree_niter_desc
|
H A D | gimple-loop-jam.cc | 31 #include "tree-ssa-loop-niter.h" 193 class tree_niter_desc niter; local 224 if (!number_of_iterations_exit (loop, single_exit (loop), &niter, 226 || niter.cmp == ERROR_MARK 227 || !integer_zerop (niter.may_be_zero) 228 || !expr_invariant_in_loop_p (outer, niter.niter))
|
H A D | tree-ssa-loop-manip.h | 49 class tree_niter_desc *niter);
|
H A D | loop-unroll.cc | 399 if (desc->niter == 0 || (unsigned) loop->unroll > desc->niter - 1) 416 if (desc->niter < 2 * nunroll 433 if (i > desc->niter - 2) 434 i = desc->niter - 2; 438 unsigned exit_mod = desc->niter % (i + 1); 481 unsigned HOST_WIDE_INT niter; local 491 niter = desc->niter; 494 gcc_assert (niter > max_unrol 872 rtx old_niter, niter, tmp; local [all...] |
H A D | tree-ssa-loop-niter.h | 28 class tree_niter_desc *niter, bool,
|
H A D | tree-ssa-loop-split.cc | 31 #include "tree-ssa-loop-niter.h" 394 compute_new_first_bound (gimple_seq *stmts, class tree_niter_desc *niter, argument 398 /* The niter structure contains the after-increment IV, we need 400 tree controlbase = force_gimple_operand (niter->control.base, 402 tree controlstep = niter->control.step; 419 tree end = force_gimple_operand (niter->bound, &stmts2, 454 if (niter->cmp == LT_EXPR) 463 gcc_assert (niter->cmp == GT_EXPR); 529 class tree_niter_desc niter; local 546 || !number_of_iterations_exit (loop1, exit1, &niter, fals [all...] |
H A D | tree-ssa-loop-manip.cc | 38 #include "tree-ssa-loop-niter.h" 957 class tree_niter_desc *niter) 971 if (!number_of_iterations_exit (loop, exit, niter, false) 972 || niter->cmp == ERROR_MARK 978 || contains_abnormal_ssa_name_p (niter->may_be_zero) 979 || contains_abnormal_ssa_name_p (niter->control.base) 980 || contains_abnormal_ssa_name_p (niter->control.step) 981 || contains_abnormal_ssa_name_p (niter->bound)) 1087 tree niter = fold_build2 (PLUS_EXPR, type, desc->niter, local 956 can_unroll_loop_p(class loop *loop, unsigned factor, class tree_niter_desc *niter) argument [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | tree-ssa-loop-ivcanon.c | 56 #include "tree-ssa-loop-niter.h" 85 create_canonical_iv (class loop *loop, edge exit, tree niter, argument 97 print_generic_expr (dump_file, niter, TDF_SLIM); 107 type of niter is always unsigned and all comparisons are 111 type = TREE_TYPE (niter); 112 niter = fold_build2 (PLUS_EXPR, type, 113 niter, 116 create_iv (niter, 441 loop-niter identified as having undefined effect in the last iteration. 573 class tree_niter_desc niter; local 692 try_unroll_loop_completely(class loop *loop, edge exit, tree niter, bool may_be_zero, enum unroll_level ul, HOST_WIDE_INT maxiter, dump_user_location_t locus, bool allow_peel) argument 993 try_peel_loop(class loop *loop, edge exit, tree niter, bool may_be_zero, HOST_WIDE_INT maxiter) argument 1170 tree niter; local [all...] |
H A D | tree-ssa-loop-niter.c | 39 #include "tree-ssa-loop-niter.h" 67 class tree_niter_desc *niter); 967 tree final, class tree_niter_desc *niter, 974 niter->control = *iv; 975 niter->bound = final; 976 niter->cmp = NE_EXPR; 1003 niter->max = widest_int::from (wi::from_mpz (niter_type, max, false), 1034 if (!niter->control.no_overflow 1087 niter->control.no_overflow = true; 1093 niter 966 number_of_iterations_ne(class loop *loop, tree type, affine_iv *iv, tree final, class tree_niter_desc *niter, bool exit_must_be_taken, bounds *bnds) argument 1150 number_of_iterations_lt_to_ne(tree type, affine_iv *iv0, affine_iv *iv1, class tree_niter_desc *niter, tree *delta, tree step, bool exit_must_be_taken, bounds *bnds) argument 1269 assert_no_overflow_lt(tree type, affine_iv *iv0, affine_iv *iv1, class tree_niter_desc *niter, tree step) argument 1338 assert_loop_rolls_lt(tree type, affine_iv *iv0, affine_iv *iv1, class tree_niter_desc *niter, bounds *bnds) argument 1465 number_of_iterations_lt(class loop *loop, tree type, affine_iv *iv0, affine_iv *iv1, class tree_niter_desc *niter, bool exit_must_be_taken, bounds *bnds) argument 1578 number_of_iterations_le(class loop *loop, tree type, affine_iv *iv0, affine_iv *iv1, class tree_niter_desc *niter, bool exit_must_be_taken, bounds *bnds) argument 1728 number_of_iterations_cond(class loop *loop, tree type, affine_iv *iv0, enum tree_code code, affine_iv *iv1, class tree_niter_desc *niter, bool only_exit, bool every_iteration) argument 2397 number_of_iterations_exit_assumptions(class loop *loop, edge exit, class tree_niter_desc *niter, gcond **at_stmt, bool every_iteration, basic_block *body) argument 2606 number_of_iterations_popcount(loop_p loop, edge exit, enum tree_code code, class tree_niter_desc *niter) argument 2730 number_of_iterations_exit(class loop *loop, edge exit, class tree_niter_desc *niter, bool warn, bool every_iteration, basic_block *body) argument 2762 tree niter = NULL_TREE, aniter; local 3124 tree niter = NULL_TREE, aniter; local 3447 record_control_iv(class loop *loop, class tree_niter_desc *niter) argument 4245 tree niter, type; local 4584 n_of_executions_at_most(gimple *stmt, class nb_iter_bound *niter_bound, tree niter) argument 4674 widest_int niter; local [all...] |
H A D | tree-ssa-loop.h | 48 its latch will not be executed), even if the niter 50 tree niter; /* The expression giving the number of iterations of member in class:tree_niter_desc
|
H A D | gimple-loop-jam.c | 31 #include "tree-ssa-loop-niter.h" 192 class tree_niter_desc niter; local 222 if (!number_of_iterations_exit (loop, single_exit (loop), &niter, 224 || niter.cmp == ERROR_MARK 225 || !integer_zerop (niter.may_be_zero) 226 || !expr_invariant_in_loop_p (outer, niter.niter))
|
H A D | tree-ssa-loop-manip.h | 50 class tree_niter_desc *niter);
|
H A D | loop-unroll.c | 402 if (desc->niter == 0 || (unsigned) loop->unroll > desc->niter - 1) 419 if (desc->niter < 2 * nunroll 436 if (i > desc->niter - 2) 437 i = desc->niter - 2; 441 unsigned exit_mod = desc->niter % (i + 1); 484 unsigned HOST_WIDE_INT niter; local 494 niter = desc->niter; 497 gcc_assert (niter > max_unrol 885 rtx old_niter, niter, tmp; local [all...] |
H A D | tree-ssa-loop-niter.h | 28 class tree_niter_desc *niter, bool,
|
H A D | tree-ssa-loop-split.c | 31 #include "tree-ssa-loop-niter.h" 394 compute_new_first_bound (gimple_seq *stmts, class tree_niter_desc *niter, argument 398 /* The niter structure contains the after-increment IV, we need 400 tree controlbase = force_gimple_operand (niter->control.base, 402 tree controlstep = niter->control.step; 419 tree end = force_gimple_operand (niter->bound, &stmts2, 454 if (niter->cmp == LT_EXPR) 463 gcc_assert (niter->cmp == GT_EXPR); 496 class tree_niter_desc niter; local 511 || !number_of_iterations_exit (loop1, single_exit (loop1), &niter, [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/contrib/ |
H A D | analyze_brprob.py | 237 def add_loop_niter(self, niter): 238 if niter > 0: 239 self.niter_vector.append(niter)
|
/netbsd-current/external/gpl3/gcc/dist/contrib/ |
H A D | analyze_brprob.py | 240 def add_loop_niter(self, niter): 241 if niter > 0: 242 self.niter_vector.append(niter)
|