dist/gcc/tree-ssa-loop-niter.c

54    Analysis of number of iterations of an affine exit test.
65 static bool number_of_iterations_popcount (loop_p loop, edge exit,
880 /* Derives the upper bound BND on the number of executions of loop with exit
883    that the loop ends through this exit, i.e., the induction variable ever
960    we know that the exit must be taken eventually, i.e., that the IV
1017      because loop with exit condition (IV != FINAL) usually will be guarded
1116       /* If we cannot assume that the exit is taken eventually, record the
1147    true if we know that the exit must be taken eventually.  */
1175   /* If the induction variable does not overflow and the exit is taken,
1357      Usually, for loops with exit condition iv0->base + step * i < iv1->base,
1462    that the exit must be taken eventually.  */
1650 /* Given exit condition IV0 CODE IV1 in TYPE, this function adjusts
1778   /* If the control induction variable does not overflow and the only exit
1858       fprintf (dump_file, "  exit condition ");
2057       /* Avoid propagating through loop exit phi nodes, which
2368 /* Returns true if EXIT is the only possible exit from LOOP.  */
2371 loop_only_exit_p (const class loop *loop, basic_block *body, const_edge exit)
2376   if (exit != single_exit (loop))
2388    EXIT (an exit edge of the LOOP) in NITER.  Returns true if some useful
2397 number_of_iterations_exit_assumptions (class loop *loop, edge exit,
2410   /* The condition at a fake exit (if it exists) does not control its
2412   if (exit->flags & EDGE_FAKE)
2419   safe = dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src);
2428   last = last_stmt (exit->src);
2437   if (exit->flags & EDGE_TRUE_VALUE)
2464     return number_of_iterations_popcount (loop, exit, code, niter);
2485   bool only_exit_p = loop_only_exit_p (loop, body, exit);
2576    exit block
2593    exit block
2606 number_of_iterations_popcount (loop_p loop, edge exit,
2618   gimple *stmt = last_stmt (exit->src);
2637       /* SSA used in exit condition is defined by PHI stmt
2730 number_of_iterations_exit (class loop *loop, edge exit,
2736   if (!number_of_iterations_exit_assumptions (loop, exit, niter,
2757 find_loop_niter (class loop *loop, edge *exit)
2765   *exit = NULL;
2773 	  /* We exit in the first iteration through this exit.
2776 	  *exit = ex;
2789 	  *exit = ex;
2800 	  *exit = ex;
2807 	  *exit = ex;
2848       /* If the loop has a normal exit, we can assume it will terminate.  */
2854 	      fprintf (dump_file, "Assume loop %i to be finite: it has an exit "
3018 loop_niter_by_eval (class loop *loop, edge exit)
3027   cond = last_stmt (exit->src);
3032   if (exit->flags & EDGE_TRUE_VALUE)
3111 /* Finds the exit of the LOOP by that the loop exits after a constant
3112    number of iterations and stores the exit edge to *EXIT.  The constant
3115    evaluation).  If we are unable to find the exit for that loop_niter_by_eval
3119 find_loop_niter_by_eval (class loop *loop, edge *exit)
3126   *exit = NULL;
3150       *exit = ex;
3371    is true if the loop is exited immediately after STMT, and this exit
3385       fprintf (dump_file, "Statement %s", is_exit ? "(exit)" : "");
3425      If at_stmt is an exit then the loop latch is executed at most BOUND times,
4172   /* If every path through the loop reach bounding statement before exit,
4447    in the LOOP.  For statements before the loop exit, this exceeds