| /openbsd/src/gnu/gcc/gcc/ |
| D | tree-ssa-loop-niter.c | 138 struct tree_niter_desc *niter, bool never_infinite) in number_of_iterations_ne() argument
143 niter->control = *iv; in number_of_iterations_ne()
144 niter->bound = final; in number_of_iterations_ne()
145 niter->cmp = NE_EXPR; in number_of_iterations_ne()
168 niter->niter = c; in number_of_iterations_ne()
192 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in number_of_iterations_ne()
193 niter->assumptions, assumption); in number_of_iterations_ne()
198 niter->niter = fold_build2 (BIT_AND_EXPR, niter_type, tmp, bound); in number_of_iterations_ne()
212 struct tree_niter_desc *niter, in number_of_iterations_lt_to_ne() argument
266 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, in number_of_iterations_lt_to_ne()
[all …]
|
| D | tree-ssa-loop-ivcanon.c | 73 create_canonical_iv (struct loop *loop, edge exit, tree niter) in create_canonical_iv() argument
83 print_generic_expr (dump_file, niter, TDF_SLIM); in create_canonical_iv()
97 type = TREE_TYPE (niter); in create_canonical_iv()
98 niter = fold_build2 (PLUS_EXPR, type, in create_canonical_iv()
99 niter, in create_canonical_iv()
102 create_iv (niter, in create_canonical_iv()
164 edge exit, tree niter, in try_unroll_loop_completely() argument
173 if (!host_integerp (niter, 1)) in try_unroll_loop_completely()
175 n_unroll = tree_low_cst (niter, 1); in try_unroll_loop_completely()
281 tree niter; in canonicalize_loop_induction_variables() local
[all …]
|
| D | loop-unroll.c | 368 || desc->niter != 0) in decide_peel_once_rolling()
445 if (desc->niter > npeel - 1) in decide_peel_completely()
451 fprintf (dump_file, HOST_WIDEST_INT_PRINT_DEC, desc->niter); in decide_peel_completely()
487 npeel = desc->niter; in peel_loop_completely()
592 if (desc->niter < 2 * nunroll) in decide_unroll_constant_iterations()
606 if (i - 1 >= desc->niter) in decide_unroll_constant_iterations()
607 i = desc->niter - 2; in decide_unroll_constant_iterations()
611 unsigned exit_mod = desc->niter % (i + 1); in decide_unroll_constant_iterations()
663 unsigned HOST_WIDE_INT niter; in unroll_loop_constant_iterations() local
674 niter = desc->niter; in unroll_loop_constant_iterations()
[all …]
|
| D | predict.c | 650 unsigned HOST_WIDE_INT niter; in predict_loops() local
663 niter = desc.niter + 1; in predict_loops()
664 if (niter == 0) /* We might overflow here. */ in predict_loops()
665 niter = desc.niter; in predict_loops()
666 if (niter in predict_loops()
668 niter = PARAM_VALUE (PARAM_MAX_PREDICTED_ITERATIONS); in predict_loops()
671 - (REG_BR_PROB_BASE + niter /2) / niter); in predict_loops()
686 tree niter = NULL; in predict_loops() local
689 niter = niter_desc.niter; in predict_loops()
690 if (!niter || TREE_CODE (niter_desc.niter) != INTEGER_CST) in predict_loops()
[all …]
|
| D | loop-iv.c | 1269 rtx niter = desc->niter_expr; in determine_max_iter() local
1273 if (GET_CODE (niter) == AND in determine_max_iter()
1274 && GET_CODE (XEXP (niter, 0)) == CONST_INT) in determine_max_iter()
1276 nmax = INTVAL (XEXP (niter, 0)); in determine_max_iter()
1287 if (GET_CODE (niter) == UDIV) in determine_max_iter()
1289 if (GET_CODE (XEXP (niter, 1)) != CONST_INT) in determine_max_iter()
1294 inc = INTVAL (XEXP (niter, 1)); in determine_max_iter()
1295 niter = XEXP (niter, 0); in determine_max_iter()
1300 if (GET_CODE (niter) == PLUS) in determine_max_iter()
1302 left = XEXP (niter, 0); in determine_max_iter()
[all …]
|
| D | tree-ssa-loop-manip.c | 641 struct tree_niter_desc *niter) in can_unroll_loop_p() argument
655 if (!number_of_iterations_exit (loop, exit, niter, false) in can_unroll_loop_p()
656 || niter->cmp == ERROR_MARK in can_unroll_loop_p()
662 || contains_abnormal_ssa_name_p (niter->may_be_zero) in can_unroll_loop_p()
663 || contains_abnormal_ssa_name_p (niter->control.base) in can_unroll_loop_p()
664 || contains_abnormal_ssa_name_p (niter->control.step) in can_unroll_loop_p()
665 || contains_abnormal_ssa_name_p (niter->bound)) in can_unroll_loop_p()
|
| D | tree-data-ref.c | 2639 compute_overlap_steps_for_affine_univar (int niter, int step_a, int step_b, in compute_overlap_steps_for_affine_univar() argument
2653 tau2 = FLOOR_DIV (niter, step_overlaps_a); in compute_overlap_steps_for_affine_univar()
2654 tau2 = MIN (tau2, FLOOR_DIV (niter, step_overlaps_b)); in compute_overlap_steps_for_affine_univar()
2697 int niter_x, niter_y, niter_z, niter; in compute_overlap_steps_for_affine_1_2() local
2727 niter = MIN (niter_x, niter_z); in compute_overlap_steps_for_affine_1_2()
2728 compute_overlap_steps_for_affine_univar (niter, step_x, step_z, in compute_overlap_steps_for_affine_1_2()
2732 niter = MIN (niter_y, niter_z); in compute_overlap_steps_for_affine_1_2()
2733 compute_overlap_steps_for_affine_univar (niter, step_y, step_z, in compute_overlap_steps_for_affine_1_2()
2737 niter = MIN (niter_x, niter_z); in compute_overlap_steps_for_affine_1_2()
2738 niter = MIN (niter_y, niter); in compute_overlap_steps_for_affine_1_2()
[all …]
|
| D | tree-flow.h | 773 tree niter; /* The expression giving the number of iterations of member
819 struct tree_niter_desc *niter, bool);
856 struct tree_niter_desc *niter);
|
| D | loop-doloop.c | 309 fprintf (dump_file, HOST_WIDEST_INT_PRINT_DEC, desc->niter); in doloop_modify()
513 est_niter = desc->niter; in doloop_optimize()
|
| D | cfgloop.h | 324 unsigned HOST_WIDEST_INT niter; member
|
| D | tree-ssa-loop-ivopts.c | 736 tree niter; member
786 && !contains_abnormal_ssa_name_p (desc.niter)) in niter_for_exit()
787 nfe_desc->niter = desc.niter; in niter_for_exit()
789 nfe_desc->niter = NULL_TREE; in niter_for_exit()
794 return nfe_desc->niter; in niter_for_exit()
1113 tree niter = niter_for_single_dom_exit (data); in find_induction_variables() local
1115 if (niter) in find_induction_variables()
1118 print_generic_expr (dump_file, niter, TDF_SLIM); in find_induction_variables()
4063 iv_value (struct iv *iv, tree niter) in iv_value() argument
4068 niter = fold_convert (type, niter); in iv_value()
[all …]
|
| D | tree-scalar-evolution.c | 2495 type = TREE_TYPE (niter_desc.niter); in number_of_iterations_in_loop()
2499 res = niter_desc.niter; in number_of_iterations_in_loop()
2954 tree def, rslt, ass, niter; in scev_const_prop() local
2967 niter = number_of_iterations_in_loop (loop); in scev_const_prop()
2968 if (niter == chrec_dont_know in scev_const_prop()
2971 || expression_expensive_p (niter)) in scev_const_prop()
|
| D | tree-ssa-loop-prefetch.c | 986 && cst_and_fits_in_hwi (desc.niter) in loop_prefetch_arrays()
987 && (unsigned HOST_WIDE_INT) int_cst_value (desc.niter) < unroll_factor) in loop_prefetch_arrays()
|
| /openbsd/src/gnu/usr.bin/cc/cc_int/ |
| D | Makefile | 32 tree-vect-generic.o tree-ssa-loop.o tree-ssa-loop-niter.o \
|
| /openbsd/src/gnu/gcc/gcc/doc/ |
| D | loop.texi | 419 @item @code{niter_expr} on RTL, @code{niter} on GIMPLE: The expression
|
| D | gccint.info | 8315 * `niter_expr' on RTL, `niter' on GIMPLE: The expression that gives
|
| /openbsd/src/gnu/usr.bin/binutils-2.17/cpu/ |
| D | mt.cpu | 1313 (dni loopi "LOOPI niter, label"
|
| /openbsd/src/gnu/gcc/gcc/config/sh/ |
| D | sh.c | 10473 n_iterations = desc->const_iter ? desc->niter : 0; in sh_adjust_unroll_max()
|
| /openbsd/src/share/dict/ |
| D | web2a | 37202 niter-blue
37203 niter cake
41872 potash niter
56616 soda niter
|
| D | web2 | 124709 niter
|