| /src/external/mit/isl/dist/test_inputs/codegen/ |
| 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);
|
| /src/external/bsd/jemalloc/dist/test/include/test/ |
| bench.h | 2 time_func(timedelta_t *timer, uint64_t nwarmup, uint64_t niter,
10 for (i = 0; i < niter; i++) {
31 compare_funcs(uint64_t nwarmup, uint64_t niter, const char *name_a,
43 time_func(&timer_a, nwarmup, niter, func_a);
44 time_func(&timer_b, nwarmup, niter, func_b);
48 fmt_nsecs(usec_a, niter, buf_a);
52 fmt_nsecs(usec_b, niter, buf_b);
57 niter, name_a, usec_a, buf_a, name_b, usec_b, buf_b, ratio_buf);
|
| /src/external/mit/libuv/dist/test/ |
| test-barrier.c | 31 unsigned niter; member in struct:__anon23846
44 for (i = 0; i < c->niter; i++)
54 wc.niter = 1;
77 wc.niter = 1;
99 wc.niter = 5;
104 for (i = 0; i < wc.niter; i++)
110 ASSERT_EQ(wc.niter, wc.main_barrier_wait_rval + wc.worker_barrier_wait_rval);
|
| /src/external/bsd/jemalloc.old/dist/test/stress/ |
| microbench.c | 4 time_func(timedelta_t *timer, uint64_t nwarmup, uint64_t niter,
12 for (i = 0; i < niter; i++) {
19 compare_funcs(uint64_t nwarmup, uint64_t niter, const char *name_a,
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),
|
| /src/external/lgpl3/mpc/dist/tools/bench/ |
| 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 */
|
| 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;
|
| /src/external/lgpl3/mpfr/dist/tools/bench/ |
| 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 */
|
| 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);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-loop-niter.cc | 39 #include "tree-ssa-loop-niter.h"
68 class tree_niter_desc *niter);
977 iterations is stored to NITER. EXIT_MUST_BE_TAKEN is true if
980 NITER->assumptions to make sure this is the case). BNDS contains the
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_overflo
2867 tree niter = NULL_TREE, aniter; local
3225 tree niter = NULL_TREE, aniter; local
4350 tree niter, type; local
4780 widest_int niter; local
[all...] |
| tree-ssa-loop-ivcanon.cc | 56 #include "tree-ssa-loop-niter.h"
79 /* Adds a canonical induction variable to LOOP iterating NITER times. EXIT
85 create_canonical_iv (class loop *loop, edge exit, tree niter,
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
1167 tree niter; local
[all...] |
| 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
|
| 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))
|
| tree-ssa-loop-manip.h | 49 class tree_niter_desc *niter);
|
| 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_unroll + 1)
872 rtx old_niter, niter, tmp; local
[all...] |
| tree-ssa-loop-niter.h | 28 class tree_niter_desc *niter, bool,
|
| tree-ssa-loop-split.cc | 31 #include "tree-ssa-loop-niter.h"
367 space in NITER, an arbitrary new bound BORDER, assumed to be some
394 compute_new_first_bound (gimple_seq *stmts, class tree_niter_desc *niter,
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);
523 loop was split. NITER must contain the iteration descriptor for th
529 class tree_niter_desc niter; local
[all...] |
| tree-ssa-loop-manip.cc | 38 #include "tree-ssa-loop-niter.h"
953 of iterations of the loop is returned in NITER. */
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
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-loop-ivcanon.cc | 56 #include "tree-ssa-loop-niter.h"
80 /* Adds a canonical induction variable to LOOP iterating NITER times. EXIT
86 create_canonical_iv (class loop *loop, edge exit, tree niter,
98 print_generic_expr (dump_file, niter, TDF_SLIM);
108 type of niter is always unsigned and all comparisons are
112 type = TREE_TYPE (niter);
113 niter = fold_build2 (PLUS_EXPR, type,
114 niter,
117 create_iv (niter, PLUS_EXPR,
485 loop-niter identified as having undefined effect in the last iteration
612 class tree_niter_desc niter; local
1233 tree niter; local
[all...] |
| tree-ssa-loop-niter.cc | 39 #include "tree-ssa-loop-niter.h"
965 iterations is stored to NITER. EXIT_MUST_BE_TAKEN is true if
968 NITER->assumptions to make sure this is the case). BNDS contains the
973 tree final, class tree_niter_desc *niter,
979 niter->control = *iv;
980 niter->bound = final;
981 niter->cmp = NE_EXPR;
1008 niter->max = widest_int::from (wi::from_mpz (niter_type, max, false),
1044 if (!niter->control.no_overflow
1094 niter->control.no_overflow = true
3268 tree niter = NULL_TREE, aniter; local
3632 tree niter = NULL_TREE, aniter; local
4781 tree niter, type; local
5217 widest_int niter; local
[all...] |
| 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
55 the loop. If niter is constant, then these values
|
| gimple-loop-jam.cc | 31 #include "tree-ssa-loop-niter.h"
194 class tree_niter_desc niter; local
225 if (!number_of_iterations_exit (loop, single_exit (loop), &niter,
227 || niter.cmp == ERROR_MARK
228 || !integer_zerop (niter.may_be_zero)
229 || !expr_invariant_in_loop_p (outer, niter.niter))
|
| tree-ssa-loop-manip.h | 46 class tree_niter_desc *niter);
|
| 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
493 niter = desc->niter;
496 gcc_assert (niter > max_unroll + 1)
880 rtx old_niter, niter, tmp; local
[all...] |
| tree-ssa-loop-split.cc | 31 #include "tree-ssa-loop-niter.h"
406 space in NITER, an arbitrary new bound BORDER, assumed to be some
433 compute_new_first_bound (gimple_seq *stmts, class tree_niter_desc *niter,
437 /* The niter structure contains the after-increment IV, we need
439 tree controlbase = force_gimple_operand (niter->control.base,
441 tree controlstep = niter->control.step;
458 tree end = force_gimple_operand (niter->bound, &stmts2,
493 if (niter->cmp == LT_EXPR)
502 gcc_assert (niter->cmp == GT_EXPR);
564 loop was split. NITER must contain the iteration descriptor for th
570 class tree_niter_desc niter; local
[all...] |
| tree-ssa-loop-niter.h | 28 class tree_niter_desc *niter, bool,
|
