| H A D | tree-ssa-loop-niter.c | 261 bounds *bnds)
283 mpz_set_ui (bnds->below, 0);
284 mpz_set_ui (bnds->up, 0);
291 mpz_sub (bnds->up, x, y);
292 mpz_set (bnds->below, bnds->up);
297 mpz_sub (bnds->below, bnds->below, m);
299 mpz_add (bnds->up, bnds
260 bound_difference_of_offsetted_base(tree type, mpz_t x, mpz_t y, bounds *bnds) argument
310 refine_bounds_using_guard(tree type, tree varx, mpz_t offx, tree vary, mpz_t offy, tree c0, enum tree_code cmp, tree c1, bounds *bnds) argument
476 bound_difference(struct loop *loop, tree x, tree y, bounds *bnds) argument
568 bounds_add(bounds *bnds, const widest_int &delta, tree type) argument
596 bounds_negate(bounds *bnds) argument
667 number_of_iterations_ne_max(mpz_t bnd, bool no_overflow, tree c, tree s, bounds *bnds, bool exit_must_be_taken) argument
734 number_of_iterations_ne(tree type, affine_iv *iv, tree final, struct tree_niter_desc *niter, bool exit_must_be_taken, bounds *bnds) argument
823 number_of_iterations_lt_to_ne(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, tree *delta, tree step, bool exit_must_be_taken, bounds *bnds) argument
1011 assert_loop_rolls_lt(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, bounds *bnds) argument
1138 number_of_iterations_lt(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, bool exit_must_be_taken, bounds *bnds) argument
1249 number_of_iterations_le(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, bool exit_must_be_taken, bounds *bnds) argument
1349 bounds bnds; local
[all...] |