Home
last modified time | relevance | path

Searched refs:i_bound (Results 1 – 6 of 6) sorted by relevance

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dcfgloop.cc1902 record_niter_bound (class loop *loop, const widest_int &i_bound, in record_niter_bound() argument
1909 || wi::ltu_p (i_bound, loop->nb_iterations_upper_bound))) in record_niter_bound()
1912 loop->nb_iterations_upper_bound = i_bound; in record_niter_bound()
1916 loop->nb_iterations_likely_upper_bound = i_bound; in record_niter_bound()
1921 || wi::ltu_p (i_bound, loop->nb_iterations_estimate))) in record_niter_bound()
1924 loop->nb_iterations_estimate = i_bound; in record_niter_bound()
1928 || wi::ltu_p (i_bound, loop->nb_iterations_likely_upper_bound))) in record_niter_bound()
1931 loop->nb_iterations_likely_upper_bound = i_bound; in record_niter_bound()
H A Dtree-ssa-loop-niter.cc3451 widest_int i_bound, gimple *stmt) in do_warn_aggressive_loop_optimizations() argument
3464 || wi::cmpu (i_bound, wi::to_widest (loop->nb_iterations)) >= 0 in do_warn_aggressive_loop_optimizations()
3475 print_dec (i_bound, buf, TYPE_UNSIGNED (TREE_TYPE (loop->nb_iterations)) in do_warn_aggressive_loop_optimizations()
3492 record_estimate (class loop *loop, tree bound, const widest_int &i_bound, in record_estimate() argument
3505 print_decu (i_bound, dump_file); in record_estimate()
3514 gcc_checking_assert (i_bound == wi::to_widest (bound)); in record_estimate()
3526 elt->bound = i_bound; in record_estimate()
3546 widest_int new_i_bound = i_bound + delta; in record_estimate()
H A DChangeLog-200725820 `i_bound' added. Do not call derive_constant_upper_bound.
H A DChangeLog-201515769 Print i_bound without converting it to a tree.
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dcfgloop.c1890 record_niter_bound (class loop *loop, const widest_int &i_bound, in record_niter_bound() argument
1897 || wi::ltu_p (i_bound, loop->nb_iterations_upper_bound))) in record_niter_bound()
1900 loop->nb_iterations_upper_bound = i_bound; in record_niter_bound()
1904 loop->nb_iterations_likely_upper_bound = i_bound; in record_niter_bound()
1909 || wi::ltu_p (i_bound, loop->nb_iterations_estimate))) in record_niter_bound()
1912 loop->nb_iterations_estimate = i_bound; in record_niter_bound()
1916 || wi::ltu_p (i_bound, loop->nb_iterations_likely_upper_bound))) in record_niter_bound()
1919 loop->nb_iterations_likely_upper_bound = i_bound; in record_niter_bound()
H A Dtree-ssa-loop-niter.c3337 widest_int i_bound, gimple *stmt) in do_warn_aggressive_loop_optimizations() argument
3350 || wi::cmpu (i_bound, wi::to_widest (loop->nb_iterations)) >= 0 in do_warn_aggressive_loop_optimizations()
3361 print_dec (i_bound, buf, TYPE_UNSIGNED (TREE_TYPE (loop->nb_iterations)) in do_warn_aggressive_loop_optimizations()
3378 record_estimate (class loop *loop, tree bound, const widest_int &i_bound, in record_estimate() argument
3391 print_decu (i_bound, dump_file); in record_estimate()
3400 gcc_checking_assert (i_bound == wi::to_widest (bound)); in record_estimate()
3412 elt->bound = i_bound; in record_estimate()
3432 widest_int new_i_bound = i_bound + delta; in record_estimate()