diff options
Diffstat (limited to 'gcc/tree-ssa-loop-im.c')
| -rw-r--r-- | gcc/tree-ssa-loop-im.c | 24 |
1 files changed, 12 insertions, 12 deletions
diff --git a/gcc/tree-ssa-loop-im.c b/gcc/tree-ssa-loop-im.c index 6c6a9f17a1d..1cc56595a9d 100644 --- a/gcc/tree-ssa-loop-im.c +++ b/gcc/tree-ssa-loop-im.c @@ -1,19 +1,19 @@ /* Loop invariant motion. Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 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/>. */ @@ -251,13 +251,13 @@ clear_lim_data (gimple stmt) /* Calls CBCK for each index in memory reference ADDR_P. There are two kinds situations handled; in each of these cases, the memory reference and DATA are passed to the callback: - + Access to an array: ARRAY_{RANGE_}REF (base, index). In this case we also pass the pointer to the index to the callback. Pointer dereference: INDIRECT_REF (addr). In this case we also pass the pointer to addr to the callback. - + If the callback returns false, the whole search stops and false is returned. Otherwise the function returns true after traversing through the whole reference *ADDR_P. */ @@ -452,14 +452,14 @@ outermost_invariant_loop (tree def, struct loop *loop) /* DATA is a structure containing information associated with a statement inside LOOP. DEF is one of the operands of this statement. - + Find the outermost loop enclosing LOOP in that value of DEF is invariant and record this in DATA->max_loop field. If DEF itself is defined inside this loop as well (i.e. we need to hoist it out of the loop if we want to hoist the statement represented by DATA), record the statement in that DEF is defined to the DATA->depends list. Additionally if ADD_COST is true, add the cost of the computation of DEF to the DATA->cost. - + If DEF is not invariant in LOOP, return false. Otherwise return TRUE. */ static bool @@ -657,7 +657,7 @@ mem_ref_in_stmt (gimple stmt) If MUST_PRESERVE_EXEC is true, additionally choose such a loop that we preserve the fact whether STMT is executed. It also fills other related information to LIM_DATA (STMT). - + The function returns false if STMT cannot be hoisted outside of the loop it is defined in, and true otherwise. */ @@ -670,7 +670,7 @@ determine_max_movement (gimple stmt, bool must_preserve_exec) struct lim_aux_data *lim_data = get_lim_data (stmt); tree val; ssa_op_iter iter; - + if (must_preserve_exec) level = ALWAYS_EXECUTED_IN (bb); else @@ -1138,7 +1138,7 @@ force_move_till_op (tree op, struct loop *orig_loop, struct loop *loop) return; gcc_assert (TREE_CODE (op) == SSA_NAME); - + stmt = SSA_NAME_DEF_STMT (op); if (gimple_nop_p (stmt)) return; @@ -1764,7 +1764,7 @@ gen_lsm_tmp_name (tree ref) gen_lsm_tmp_name (TREE_OPERAND (ref, 0)); lsm_tmp_name_add ("_RE"); break; - + case IMAGPART_EXPR: gen_lsm_tmp_name (TREE_OPERAND (ref, 0)); lsm_tmp_name_add ("_IM"); |