971   tree s, c, d, bits, assumption, tmp, bound;  in number_of_iterations_ne()  local
1159   tree assumption = boolean_true_node, bound, noloop;  in number_of_iterations_lt_to_ne()  local
1272   tree bound, d, assumption, diff;  in assert_no_overflow_lt()  local
1341   tree assumption = boolean_true_node, bound, diff;  in assert_loop_rolls_lt()  local
3378 record_estimate (class loop *loop, tree bound, const widest_int &i_bound,  in record_estimate()
3896 bound_index (vec<widest_int> bounds, const widest_int &bound)  in bound_index()
3936       widest_int bound = elt->bound;  in discover_iteration_bound_by_body_walk()  local
3969       widest_int bound = elt->bound;  in discover_iteration_bound_by_body_walk()  local
4249   widest_int bound;  in estimate_numbers_of_iterations()  local
4588   widest_int bound = niter_bound->bound;  in n_of_executions_at_most()  local
4676   class nb_iter_bound *bound;  in loop_exits_before_overflow()  local
4973   class nb_iter_bound *bound;  in free_numbers_of_iterations_estimates()  local