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

141   tree s, c, d, bits, assumption, tmp, bound;
144   niter->bound = final;
176   bound = build_low_bits_mask (niter_type,
197   tmp = fold_build2 (MULT_EXPR, niter_type, c, inverse (s, bound));
198   niter->niter = fold_build2 (BIT_AND_EXPR, niter_type, tmp, bound);
218   tree assumption = boolean_true_node, bound, noloop;
233 	  bound = fold_build2 (MINUS_EXPR, type,
236 				    iv1->base, bound);
252 	  bound = fold_build2 (PLUS_EXPR, type,
255 				    iv0->base, bound);
286   tree bound, d, assumption, diff;
309       bound = fold_build2 (MINUS_EXPR, type,
312 				iv1->base, bound);
330       bound = fold_build2 (PLUS_EXPR, type,
333 				iv0->base, bound);
354   tree assumption = boolean_true_node, bound, diff;
367 	  bound = fold_build2 (PLUS_EXPR, type,
370 				    iv0->base, bound);
385 	  bound = fold_build2 (PLUS_EXPR, type,
388 				    iv1->base, bound);
421       niter->bound = iv1->base;
427       niter->bound = iv0->base;
569   niter->bound = NULL_TREE;
885    so that things like casts or incrementing the value of the bound before
1546 /* Returns a constant upper bound on the value of expression VAL.  VAL
1584 	     we cannot establish more useful upper bound than the precision
1590 	 bound for it.  */
1593       /* If the bound does not fit in TYPE, max. value of TYPE could be
1680    additional condition ADDITIONAL is recorded with the bound.  */
1683 record_estimate (struct loop *loop, tree bound, tree additional, tree at_stmt)
1686   double_int i_bound = derive_constant_upper_bound (bound, additional);
1687   tree c_bound = double_int_to_tree (unsigned_type_for (TREE_TYPE (bound)),
1695       print_generic_expr (dump_file, bound, TDF_SLIM);
1701   elt->bound = c_bound;
1713   struct nb_iter_bound *bound;
1715   for (bound = loop->bounds; bound; bound = bound->next)
1717       if (TREE_CODE (bound->bound) != INTEGER_CST)
1723 	  || tree_int_cst_lt (bound->bound, loop->estimated_nb_iterations))
1724 	loop->estimated_nb_iterations = bound->bound;
1751 	 use the operations in it to infer reliable upper bound on the
1768 		   and record a bound on the loop iteration domain.  */
1778 		   scalar evolution and record a bound of the loop
1940    NITER_BOUND->bound times.  */
1948   tree bound = niter_bound->bound;
1949   tree bound_type = TREE_TYPE (bound);
1955 	      && is_gimple_min_invariant (bound));
1957     bound = fold_convert (nit_type, bound);
1970   cond = fold_binary (cmp, boolean_type_node, niter, bound);
2004   struct nb_iter_bound *bound;
2042      bound of the type, and verify that the loop is exited before this
2066   for (bound = loop->bounds; bound; bound = bound->next)
2068       if (n_of_executions_at_most (at_stmt, bound, valid_niter))
2087   struct nb_iter_bound *bound, *next;
2091   for (bound = loop->bounds; bound; bound = next)
2093       next = bound->next;
2094       free (bound);