Home
last modified time | relevance | path

Searched defs:niter (Results 1 – 25 of 31) sorted by relevance

12

/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dtree-ssa-loop-ivcanon.c71 create_canonical_iv (struct loop *loop, edge exit, tree niter) in create_canonical_iv()
325 edge exit, tree niter, in try_unroll_loop_completely()
439 tree niter; in canonicalize_loop_induction_variables() local
H A Dtree-ssa-loop-niter.c618 struct tree_niter_desc *niter, bool exit_must_be_taken, in number_of_iterations_ne()
706 struct tree_niter_desc *niter, in number_of_iterations_lt_to_ne()
825 struct tree_niter_desc *niter, tree step) in assert_no_overflow_lt()
894 struct tree_niter_desc *niter, bounds *bnds) in assert_loop_rolls_lt()
1022 struct tree_niter_desc *niter, in number_of_iterations_lt()
1131 struct tree_niter_desc *niter, bool exit_must_be_taken, in number_of_iterations_le()
1224 affine_iv *iv1, struct tree_niter_desc *niter, in number_of_iterations_cond()
1804 struct tree_niter_desc *niter, in number_of_iterations_exit()
1934 tree niter = NULL_TREE, aniter; in find_loop_niter() local
2287 tree niter = NULL_TREE, aniter; in find_loop_niter_by_eval() local
[all …]
H A Dgraphite-blocking.c162 mpz_t niter, strip_stride; in lst_strip_mine_profitable_p() local
H A Dloop-unroll.c642 unsigned HOST_WIDE_INT niter; in unroll_loop_constant_iterations() local
965 rtx old_niter, niter, init_code, branch_code, tmp; in unroll_loop_runtime_iterations() local
1245 unsigned niter = expected_loop_iterations (loop); in decide_peel_simple() local
H A Dtree-flow.h650 tree niter; /* The expression giving the number of iterations of member
H A Dcfgloop.h375 unsigned HOST_WIDEST_INT niter; member
H A Dtree-data-ref.c2091 compute_overlap_steps_for_affine_univar (int niter, int step_a, int step_b, in compute_overlap_steps_for_affine_univar()
2155 HOST_WIDE_INT niter_x, niter_y, niter_z, niter; in compute_overlap_steps_for_affine_1_2() local
2491 HOST_WIDE_INT niter, niter_a, niter_b; in analyze_subscript_affine_affine() local
2606 HOST_WIDE_INT niter = MIN (niter_a, niter_b); in analyze_subscript_affine_affine() local
H A Dtree-parloops.c1754 unsigned n_threads, struct tree_niter_desc *niter) in gen_parallel_loop()
2007 try_get_loop_niter (loop_p loop, struct tree_niter_desc *niter) in try_get_loop_niter()
H A Dtree-ssa-loop-ivopts.c118 HOST_WIDE_INT niter = max_stmt_executions_int (loop, false); in avg_loop_niter() local
1173 struct tree_niter_desc *niter = niter_for_single_dom_exit (data); in find_induction_variables() local
4316 cand_value_at (struct loop *loop, struct iv_cand *cand, gimple at, tree niter, in cand_value_at()
4535 struct tree_niter_desc *niter) in iv_elimination_compare_lt()
6518 struct tree_niter_desc *const niter = (struct tree_niter_desc *) *value; in free_tree_niter_desc() local
H A Dgraphite-scop-detection.c392 tree niter; in graphite_can_represent_loop() local
H A Dtree-ssa-loop-manip.c646 struct tree_niter_desc *niter) in can_unroll_loop_p()
H A Dloop-iv.c2201 rtx niter = desc->niter_expr; in determine_max_iter() local
H A Dpredict.c972 tree niter = NULL; in predict_loops() local
/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dtree-ssa-loop-niter.c964 tree final, struct tree_niter_desc *niter, in number_of_iterations_ne()
1141 struct tree_niter_desc *niter, in number_of_iterations_lt_to_ne()
1260 struct tree_niter_desc *niter, tree step) in assert_no_overflow_lt()
1329 struct tree_niter_desc *niter, bounds *bnds) in assert_loop_rolls_lt()
1456 affine_iv *iv1, struct tree_niter_desc *niter, in number_of_iterations_lt()
1569 affine_iv *iv1, struct tree_niter_desc *niter, in number_of_iterations_le()
1664 affine_iv *iv1, struct tree_niter_desc *niter, in number_of_iterations_cond()
2300 struct tree_niter_desc *niter, in number_of_iterations_exit_assumptions()
2438 struct tree_niter_desc *niter, in number_of_iterations_exit()
2468 tree niter = NULL_TREE, aniter; in find_loop_niter() local
[all …]
H A Dtree-ssa-loop-split.c390 compute_new_first_bound (gimple_seq *stmts, struct tree_niter_desc *niter, in compute_new_first_bound()
490 split_loop (struct loop *loop1, struct tree_niter_desc *niter) in split_loop()
630 struct tree_niter_desc niter; in tree_ssa_split_loops() local
H A Dtree-ssa-loop-ivcanon.c571 struct tree_niter_desc niter; in remove_redundant_iv_tests() local
691 edge exit, tree niter, bool may_be_zero, in try_unroll_loop_completely()
989 edge exit, tree niter, bool may_be_zero, in try_peel_loop()
1162 tree niter; in canonicalize_loop_induction_variables() local
H A Dtree-ssa-loop.h49 tree niter; /* The expression giving the number of iterations of member
H A Dgimple-loop-jam.c193 struct tree_niter_desc niter; in unroll_jam_possible_p() local
H A Dloop-unroll.c484 unsigned HOST_WIDE_INT niter; in unroll_loop_constant_iterations() local
885 rtx old_niter, niter, tmp; in unroll_loop_runtime_iterations() local
H A Dtree-data-ref.c3240 compute_overlap_steps_for_affine_univar (HOST_WIDE_INT niter, in compute_overlap_steps_for_affine_univar()
3306 HOST_WIDE_INT niter_x, niter_y, niter_z, niter; in compute_overlap_steps_for_affine_1_2() local
3640 HOST_WIDE_INT niter, niter_a, niter_b; in analyze_subscript_affine_affine() local
3755 HOST_WIDE_INT niter = MIN (niter_a, niter_b); in analyze_subscript_affine_affine() local
H A Dcfgloop.h460 uint64_t niter; member
H A Dtree-parloops.c2267 unsigned n_threads, struct tree_niter_desc *niter, in gen_parallel_loop()
2695 try_get_loop_niter (loop_p loop, struct tree_niter_desc *niter) in try_get_loop_niter()
H A Dtree-ssa-loop-manip.c938 struct tree_niter_desc *niter) in can_unroll_loop_p()
H A Dtree-ssa-loop-ivopts.c126 HOST_WIDE_INT niter = estimated_stmt_executions_int (loop); in avg_loop_niter() local
1494 struct tree_niter_desc *niter = niter_for_single_dom_exit (data); in find_induction_variables() local
4776 cand_value_at (struct loop *loop, struct iv_cand *cand, gimple *at, tree niter, in cand_value_at()
4959 struct tree_niter_desc *niter) in iv_elimination_compare_lt()
H A Dloop-iv.c2250 rtx niter = desc->niter_expr; in determine_max_iter() local

12