GCC Middle and Back End API Reference
|
#include <tree-ssa-loop.h>
Data Fields | |
tree | base |
tree | step |
bool | no_overflow |
Header file for SSA loop optimizations. Copyright (C) 2013-2024 Free Software Foundation, Inc. This file is part of GCC. GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3, or (at your option) any later version. GCC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GCC; see the file COPYING3. If not see <http://www.gnu.org/licenses/>.
Affine iv.
tree affine_iv::base |
Referenced by assert_loop_rolls_lt(), assert_no_overflow_lt(), can_unroll_loop_p(), cand_value_at(), compute_new_first_bound(), determine_exit_conditions(), dr_analyze_innermost(), is_comparison_with_loop_invariant_p(), number_of_iterations_cond(), number_of_iterations_exit_assumptions(), number_of_iterations_le(), number_of_iterations_lt(), number_of_iterations_lt_to_ne(), number_of_iterations_until_wrap(), record_control_iv(), split_at_bb_p(), and loop_distribution::transform_reduction_loop().
bool affine_iv::no_overflow |
tree affine_iv::step |
Referenced by assert_loop_rolls_lt(), assert_no_overflow_lt(), can_unroll_loop_p(), cand_value_at(), compute_new_first_bound(), determine_exit_conditions(), dr_analyze_innermost(), is_comparison_with_loop_invariant_p(), number_of_iterations_cond(), number_of_iterations_exit_assumptions(), number_of_iterations_le(), number_of_iterations_lt(), number_of_iterations_lt_to_ne(), number_of_iterations_until_wrap(), record_control_iv(), split_at_bb_p(), and loop_distribution::transform_reduction_loop().