Lines Matching refs:niters
1050 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",
2638 /* Niters for peeled prolog loop. */
2649 /* Niters for at least one iteration of vectorized loop. */
3834 int niters = LOOP_VINFO_INT_NITERS (loop_vinfo);
3835 peel_iters_prologue = MIN (niters, peel_iters_prologue);
3836 int peel_iters_epilogue = (niters - peel_iters_prologue) % assumed_vf;
3982 "versioning niters.\n");
4315 SIC * niters + SOC > VIC * ((niters - NPEEL) / VF) + VOC
4348 scalar iterations (niters) gives:
4374 find the minimum niters for which the scalar cost is larger:
4376 SIC * niters > VIC * vniters + VOC - SOC
4378 We know that the minimum niters is no more than
4441 Non-vectorized variant is SIC * niters and it must win over vector
4443 SIC * niters > VIC * ((niters - NPEEL) / VF) + VOC + SOC */
9164 /* Check the upper bound of loop niters. */
9731 tree niters = vect_build_loop_niters (loop_vinfo);
9732 LOOP_VINFO_NITERS_UNCHANGED (loop_vinfo) = niters;
9738 epilogue = vect_do_peeling (loop_vinfo, niters, nitersm1, &niters_vector,
9757 step_vector = build_one_cst (TREE_TYPE (niters));
9760 vect_gen_vector_loop_niters (loop_vinfo, niters, &niters_vector,
9956 a zero NITERS becomes a nonzero NITERS_VECTOR. */
Indexes created Sun Jul 19 00:25:04 UTC 2026