Home | History | Annotate | Download | only in gcc

Lines Matching defs:nit

2498    without duplication of the loop body.  NIT is the number of iterations of the
2505 				      tree nit)
2531   tree nit_type = TREE_TYPE (nit);
2533   /* Figure out whether nit + 1 overflows.  */
2534   if (TREE_CODE (nit) == INTEGER_CST)
2536       if (!tree_int_cst_equal (nit, TYPE_MAX_VALUE (nit_type)))
2539 				       nit, build_one_cst (nit_type));
2553   gcc_assert (TREE_CODE (nit) == SSA_NAME);
2555   /* Variable nit is the loop bound as returned by canonicalize_loop_ivs, for an
2561      if (iv_1 < nit)
2570      The range of iv_1 is [0, nit].  The latch edge is taken for
2571      iv_1 == [0, nit - 1] and the exit edge is taken for iv_1 == nit.  So the
2572      number of latch executions is equal to nit.
2575      executions, so it gives us the maximum value of nit.  */
2580   /* Check if nit + 1 overflows.  */
2585   gimple *def = SSA_NAME_DEF_STMT (nit);
2587   /* Try to find nit + 1, in the form of n in an assignment nit = n - 1.  */
2600   /* If not found, insert nit + 1.  */
2603       alt_bound = fold_build2 (PLUS_EXPR, nit_type, nit,
2617 /* Moves the exit condition of LOOP to the beginning of its header.  NIT is the
2624 			      tree nit)
2642   gcc_assert (gimple_cond_rhs (cond_stmt) == nit);
2975   tree many_iterations_cond, type, nit;
3044     we should compute nit = n * m, not nit = n.  
3048   nit = force_gimple_operand (unshare_expr (niter->niter), &stmts, true,
3063 		     nit, build_int_cst (type, m_p_thread * n_threads - 1));
3096   canonicalize_loop_ivs (loop, &nit, true);
3123   if (try_transform_to_exit_first_loop_alt (loop, reduction_list, nit))
3140       transform_to_exit_first_loop (loop, reduction_list, nit);