Searched refs:niters (Results 1 - 17 of 17) sorted by relevance

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dtree-vect-loop-manip.c420 rgroup_masks *rgm, tree niters, tree niters_skip,
434 tree nscalars_total = niters;
647 tree niters, tree final_iv,
656 tree orig_niters = niters;
659 tree ni_actual_type = TREE_TYPE (niters);
671 niters = gimple_build (&preheader_seq, PLUS_EXPR, ni_actual_type,
672 niters, build_minus_one_cst (ni_actual_type));
673 niters = gimple_convert (&preheader_seq, compare_type, niters);
674 niters
417 vect_set_loop_masks_directly(class loop *loop, loop_vec_info loop_vinfo, gimple_seq *preheader_seq, gimple_stmt_iterator loop_cond_gsi, rgroup_masks *rgm, tree niters, tree niters_skip, bool might_wrap_p) argument
646 vect_set_loop_condition_masked(class loop *loop, loop_vec_info loop_vinfo, tree niters, tree final_iv, bool niters_maybe_zero, gimple_stmt_iterator loop_cond_gsi) argument
754 vect_set_loop_condition_unmasked(class loop *loop, tree niters, tree step, tree final_iv, bool niters_maybe_zero, gimple_stmt_iterator loop_cond_gsi) argument
907 vect_set_loop_condition(class loop *loop, loop_vec_info loop_vinfo, tree niters, tree step, tree final_iv, bool niters_maybe_zero) argument
1477 vect_update_ivs_after_vectorizer(loop_vec_info loop_vinfo, tree niters, edge update_e) argument
1722 vect_update_init_of_dr(dr_vec_info *dr_info, tree niters, tree_code code) argument
1744 vect_update_inits_of_drs(loop_vec_info loop_vinfo, tree niters, tree_code code) argument
1861 tree niters = fold_build2 (PLUS_EXPR, type, niters_prolog, local
1911 vect_gen_vector_loop_niters(loop_vec_info loop_vinfo, tree niters, tree *niters_vector_ptr, tree *step_vector_ptr, bool niters_no_overflow) argument
2465 vect_do_peeling(loop_vec_info loop_vinfo, tree niters, tree nitersm1, tree *niters_vector, tree *step_vector, tree *niters_vector_mult_vf_var, int th, bool check_profitability, bool niters_no_overflow, tree *advance) argument
2942 tree niters = fold_build2 (PLUS_EXPR, TREE_TYPE (niters_vector_mult_vf), local
[all...]
H A Dtree-loop-distribution.c1658 tree niters = number_of_latch_executions (loop); local
1659 niters = fold_convert_loc (loc, sizetype, niters);
1661 niters = size_binop_loc (loc, PLUS_EXPR, niters, size_one_node);
1665 niters, scev_step);
2587 data_ref_segment_size (struct data_reference *dr, tree niters) argument
2589 niters = size_binop (MINUS_EXPR,
2590 fold_convert (sizetype, niters),
2594 fold_convert (sizetype, niters));
2616 tree niters_plus_one, niters = number_of_latch_executions (loop); local
3288 tree niters = number_of_latch_executions (loop); local
3346 tree niters = number_of_latch_executions (loop); local
[all...]
H A Dtree-predcom.c881 tree niters = number_of_latch_executions (loop); local
883 /* Don't do store elimination if niters info is unknown because stores
886 eliminate_store_p = (niters != NULL_TREE && niters != chrec_dont_know);
1591 gimple_seq *stmts, tree niters = NULL_TREE)
1611 if (niters != NULL_TREE)
1613 niters = fold_convert (ssizetype, niters);
1614 new_offset = size_binop (MULT_EXPR, DR_STEP (dr), niters);
1615 if (TREE_CODE (niters)
1766 tree niters = number_of_latch_executions (loop); local
3110 tree fini, niters = number_of_latch_executions (loop); local
[all...]
H A Dgimple-loop-interchange.cc1085 /* Prepare niters for both loops. */
1124 /* Scrap niters estimation of interchanged loops. */
1796 tree niters = number_of_latch_executions (loop); local
1797 niters = analyze_scalar_evolution (loop_outer (loop), niters);
1798 if (!niters || chrec_contains_undetermined (niters))
1806 niters = instantiate_scev (loop_preheader_edge (loop2),
1807 loop_outer (loop), niters);
1808 if (!evolution_function_is_invariant_p (niters, loop
[all...]
H A Dgimple-loop-versioning.cc405 for (unsigned int niters = 0; niters < MAX_NITERS; ++niters)
H A Dtree-ssa-loop-ivopts.c591 hash_map<edge, tree_niter_desc *> *niters; member in struct:ivopts_data
1024 if (!data->niters)
1026 data->niters = new hash_map<edge, tree_niter_desc *>;
1030 slot = data->niters->get (exit);
1045 data->niters->put (exit, desc);
1080 data->niters = NULL;
3850 " unexpected niters.\n");
4215 int64_t niters = (int64_t) avg_loop_niter (data->current_loop); local
4216 return (cost + (round_up_p ? niters - 1 : 0)) / niters;
[all...]
H A Dtree-vect-loop.c1869 peeled for reasons other than niters. */
1879 try to check whether the (variable) niters is known to be
2066 dump_printf (MSG_NOTE, ", niters = %wd\n",
3393 int niters = LOOP_VINFO_INT_NITERS (loop_vinfo); local
3394 peel_iters_prologue = niters < peel_iters_prologue ?
3395 niters : peel_iters_prologue;
3396 *peel_iters_epilogue = (niters - peel_iters_prologue) % assumed_vf;
3516 "versioning niters.\n");
3763 SIC * niters + SOC > VIC * ((niters
8761 tree niters = vect_build_loop_niters (loop_vinfo); local
[all...]
H A Dtree-scalar-evolution.c3127 derive_simple_iv_with_niters (tree ev, tree *niters)
3166 *niters = fold_build2 (FLOOR_DIV_EXPR, type, delta, step);
3120 derive_simple_iv_with_niters(tree ev, tree *niters) argument
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dtree-vect-loop-manip.cc426 rgroup_controls *rgc, tree niters,
446 tree nitems_total = niters;
696 loop_vec_info loop_vinfo, tree niters,
706 tree orig_niters = niters;
709 tree ni_actual_type = TREE_TYPE (niters);
721 niters = gimple_build (&preheader_seq, PLUS_EXPR, ni_actual_type,
722 niters, build_minus_one_cst (ni_actual_type));
723 niters = gimple_convert (&preheader_seq, compare_type, niters);
724 niters
422 vect_set_loop_controls_directly(class loop *loop, loop_vec_info loop_vinfo, gimple_seq *preheader_seq, gimple_seq *header_seq, gimple_stmt_iterator loop_cond_gsi, rgroup_controls *rgc, tree niters, tree niters_skip, bool might_wrap_p) argument
695 vect_set_loop_condition_partial_vectors(class loop *loop, loop_vec_info loop_vinfo, tree niters, tree final_iv, bool niters_maybe_zero, gimple_stmt_iterator loop_cond_gsi) argument
801 vect_set_loop_condition_normal(class loop *loop, tree niters, tree step, tree final_iv, bool niters_maybe_zero, gimple_stmt_iterator loop_cond_gsi) argument
953 vect_set_loop_condition(class loop *loop, loop_vec_info loop_vinfo, tree niters, tree step, tree final_iv, bool niters_maybe_zero) argument
1551 vect_update_ivs_after_vectorizer(loop_vec_info loop_vinfo, tree niters, edge update_e) argument
1823 vect_update_inits_of_drs(loop_vec_info loop_vinfo, tree niters, tree_code code) argument
1940 tree niters = fold_build2 (PLUS_EXPR, type, niters_prolog, local
1990 vect_gen_vector_loop_niters(loop_vec_info loop_vinfo, tree niters, tree *niters_vector_ptr, tree *step_vector_ptr, bool niters_no_overflow) argument
2594 vect_do_peeling(loop_vec_info loop_vinfo, tree niters, tree nitersm1, tree *niters_vector, tree *step_vector, tree *niters_vector_mult_vf_var, int th, bool check_profitability, bool niters_no_overflow, tree *advance) argument
3068 tree niters = fold_build2 (PLUS_EXPR, TREE_TYPE (niters_vector_mult_vf), local
[all...]
H A Dtree-predcom.cc1013 tree niters = number_of_latch_executions (m_loop); local
1015 /* Don't do store elimination if niters info is unknown because stores
1018 eliminate_store_p = (niters != NULL_TREE && niters != chrec_dont_know);
1710 gimple_seq *stmts, tree niters = NULL_TREE)
1730 if (niters != NULL_TREE)
1732 niters = fold_convert (ssizetype, niters);
1733 new_offset = size_binop (MULT_EXPR, DR_STEP (dr), niters);
1734 if (TREE_CODE (niters)
1899 tree niters = number_of_latch_executions (loop); local
3241 tree fini, niters = number_of_latch_executions (m_loop); local
[all...]
H A Dtree-loop-distribution.cc1671 tree niters = number_of_latch_executions (loop);
1672 niters = fold_convert_loc (loc, sizetype, niters);
1674 niters = size_binop_loc (loc, PLUS_EXPR, niters, size_one_node);
1678 niters, scev_step);
2616 data_ref_segment_size (struct data_reference *dr, tree niters)
2618 niters = size_binop (MINUS_EXPR,
2619 fold_convert (sizetype, niters),
2623 fold_convert (sizetype, niters));
[all...]
H A Dgimple-loop-interchange.cc1085 /* Prepare niters for both loops. */
1124 /* Scrap niters estimation of interchanged loops. */
1808 tree niters = number_of_latch_executions (loop); local
1809 niters = analyze_scalar_evolution (loop_outer (loop), niters);
1810 if (!niters || chrec_contains_undetermined (niters))
1818 niters = instantiate_scev (loop_preheader_edge (loop2),
1819 loop_outer (loop), niters);
1820 if (!evolution_function_is_invariant_p (niters, loop
[all...]
H A Dtree-vectorizer.cc1873 unsigned HOST_WIDE_INT niters
1882 other_factor = niters / other_likely_vf;
1884 && niters % other_likely_vf != 0)
1887 this_factor = niters / this_likely_vf;
1889 && niters % this_likely_vf != 0)
1871 unsigned HOST_WIDE_INT niters local
H A Dgimple-loop-versioning.cc399 for (unsigned int niters = 0; niters < MAX_NITERS; ++niters)
H A Dtree-ssa-loop-ivopts.cc592 hash_map<edge, tree_niter_desc *> *niters; member in struct:ivopts_data
1025 if (!data->niters)
1027 data->niters = new hash_map<edge, tree_niter_desc *>;
1031 slot = data->niters->get (exit);
1046 data->niters->put (exit, desc);
1081 data->niters = NULL;
3881 " unexpected niters.\n");
4246 int64_t niters = (int64_t) avg_loop_niter (data->current_loop); local
4247 return (cost + (round_up_p ? niters - 1 : 0)) / niters;
[all...]
H A Dtree-vect-loop.cc1050 peeled for reasons other than niters. */
1060 try to check whether the (variable) niters is known to be
1163 required by loop niters. */
1216 If min_ni_prec is less than the precision of the current niters,
1217 we perfer to still use the niters type. Prefer to use Pmode and
2409 dump_printf (MSG_NOTE, ", niters = %wd\n",
3841 int niters = LOOP_VINFO_INT_NITERS (loop_vinfo); local
3842 peel_iters_prologue = MIN (niters, peel_iters_prologue);
3843 int peel_iters_epilogue = (niters - peel_iters_prologue) % assumed_vf;
3989 "versioning niters
9734 tree niters = vect_build_loop_niters (loop_vinfo); local
[all...]
H A Dtree-scalar-evolution.cc3118 derive_simple_iv_with_niters (tree ev, tree *niters)
3157 *niters = fold_build2 (FLOOR_DIV_EXPR, type, delta, step);
3111 derive_simple_iv_with_niters(tree ev, tree *niters) argument

Completed in 234 milliseconds