| /src/external/gpl3/gcc/dist/gcc/ |
| 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))
|
| cfgloop.h | 186 semantics of niter analyzer APIs. Currently the APIs affected are
190 1) Compute niter->assumptions by calling niter analyzer API and
192 2) Clear buffered result of niter/scev analyzer.
195 on niter/scev analyzer, the point is that niter/scev analysis
197 5) Version the loop with niter->assumptions computed in step 1).
198 6) Vectorize the versioned loop in which niter->assumptions is
200 7) Update constraints in versioned loops so that niter analyzer
205 that might result in hard to track down bugs in niter/scev consumers. *
485 uint64_t niter; variable
[all...] |
| graphite-scop-detection.cc | 40 #include "tree-ssa-loop-niter.h"
588 tree niter; local
618 "Loop niter not unconditional.\n"
623 niter = number_of_latch_executions (loop);
624 if (!niter)
626 DEBUG_PRINT (dp << "[can_represent_loop-fail] Loop niter unknown.\n");
631 DEBUG_PRINT (dp << "[can_represent_loop-fail] Loop niter can overflow.\n");
635 bool undetermined_coefficients = chrec_contains_undetermined (niter);
639 "Loop niter chrec contains undetermined "
644 bool can_represent_expr = graphite_can_represent_expr (scop, loop, niter);
[all...] |
| 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-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-manip.cc | 38 #include "tree-ssa-loop-niter.h"
876 of iterations of the loop is returned in NITER. */
880 class tree_niter_desc *niter)
894 if (!number_of_iterations_exit (loop, exit, niter, false)
895 || niter->cmp == ERROR_MARK
901 || contains_abnormal_ssa_name_p (niter->may_be_zero)
902 || contains_abnormal_ssa_name_p (niter->control.base)
903 || contains_abnormal_ssa_name_p (niter->control.step)
904 || contains_abnormal_ssa_name_p (niter->bound))
1010 tree niter = fold_build2 (PLUS_EXPR, type, desc->niter local
[all...] |
| loop-iv.cc | 64 #include "tree-ssa-loop-niter.h"
2237 rtx niter = desc->niter_expr; local
2244 gcc_checking_assert (GET_CODE (niter) != AND
2245 || !CONST_INT_P (XEXP (niter, 0)));
2247 if (GET_CODE (niter) == AND
2248 && CONST_INT_P (XEXP (niter, 1)))
2250 andmax = UINTVAL (XEXP (niter, 1));
2251 niter = XEXP (niter, 0);
2257 if (GET_CODE (niter) == UDIV
[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...] |
| predict.cc | 54 #include "tree-ssa-loop-niter.h"
1999 tree niter = NULL; local
2022 niter = niter_desc.niter;
2023 if (!niter || TREE_CODE (niter_desc.niter) != INTEGER_CST)
2024 niter = loop_niter_by_eval (loop, ex);
2026 && TREE_CODE (niter) == INTEGER_CST)
2031 print_generic_expr (dump_file, niter, TDF_SLIM);
2035 if (TREE_CODE (niter) == INTEGER_CST
[all...] |
| tree-if-conv.cc | 111 #include "tree-ssa-loop-niter.h"
782 widest_int niter, valid_niter, delta, wi_step; local
823 if (!max_loop_iterations (loop, &niter))
839 if (!overflow && niter <= valid_niter)
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| 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-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...] |
| cfgloop.h | 183 semantics of niter analyzer APIs. Currently the APIs affected are
187 1) Compute niter->assumptions by calling niter analyzer API and
189 2) Clear buffered result of niter/scev analyzer.
192 on niter/scev analyzer, the point is that niter/scev analysis
194 5) Version the loop with niter->assumptions computed in step 1).
195 6) Vectorize the versioned loop in which niter->assumptions is
197 7) Update constraints in versioned loops so that niter analyzer
202 that might result in hard to track down bugs in niter/scev consumers. *
477 uint64_t niter; variable
[all...] |
| graphite-scop-detection.cc | 40 #include "tree-ssa-loop-niter.h"
554 tree niter; local
568 && (niter = number_of_latch_executions (loop))
569 && !chrec_contains_undetermined (niter)
570 && graphite_can_represent_expr (scop, loop, 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...] |
| loop-iv.cc | 64 #include "tree-ssa-loop-niter.h"
2253 rtx niter = desc->niter_expr; local
2260 gcc_checking_assert (GET_CODE (niter) != AND
2261 || !CONST_INT_P (XEXP (niter, 0)));
2263 if (GET_CODE (niter) == AND
2264 && CONST_INT_P (XEXP (niter, 1)))
2266 andmax = UINTVAL (XEXP (niter, 1));
2267 niter = XEXP (niter, 0);
2273 if (GET_CODE (niter) == UDIV
[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...] |
| 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...] |
| /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/lgpl3/mpc/dist/tools/bench/ |
| 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/ |
| 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/dist/gcc/config/rs6000/ |
| rs6000-string.cc | 986 HOST_WIDE_INT niter; local
1109 niter = max_loop_iter;
1114 niter = bytes / loop_bytes;
1116 emit_move_insn (iter, GEN_INT (niter));
1117 emit_move_insn (loop_cmp, GEN_INT (niter * loop_bytes));
1118 emit_move_insn (cmp_rem, GEN_INT (bytes - niter * loop_bytes));
|
| /src/external/gpl3/gcc.old/dist/gcc/config/rs6000/ |
| rs6000-string.cc | 985 HOST_WIDE_INT niter; local
1108 niter = max_loop_iter;
1113 niter = bytes / loop_bytes;
1115 emit_move_insn (iter, GEN_INT (niter));
1116 emit_move_insn (loop_cmp, GEN_INT (niter * loop_bytes));
1117 emit_move_insn (cmp_rem, GEN_INT (bytes - niter * loop_bytes));
|
