CbC/CbC_gcc: gcc/tree-ssa-loop-manip.c comparison

comparison gcc/tree-ssa-loop-manip.c @ 63:b7f97abdc517 gcc-4.6-20100522

update gcc from gcc-4.5.0 to gcc-4.6

author	ryoma <e075725@ie.u-ryukyu.ac.jp>
date	Mon, 24 May 2010 12:47:05 +0900
parents	77e2b8dfacca
children	f6334be47118

comparison

equal deleted inserted replaced

-:3c8a44c06a95
+:b7f97abdc517
 /* High-level loop manipulation functions.
-Copyright (C) 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
+Copyright (C) 2004, 2005, 2006, 2007, 2008, 2010
+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
 #include "config.h"
 #include "system.h"
 #include "coretypes.h"
 #include "tm.h"
 #include "tree.h"
-#include "rtl.h"
 #include "tm_p.h"
-#include "hard-reg-set.h"
 #include "basic-block.h"
 #include "output.h"
 #include "diagnostic.h"
 #include "tree-flow.h"
 #include "tree-dump.h"
 FOR_EACH_SSA_TREE_OPERAND (var, stmt, iter, SSA_OP_ALL_USES)
 check_loop_closed_ssa_use (bb, var);
 }
-/* Checks that invariants of the loop closed ssa form are preserved.  */
+/* Checks that invariants of the loop closed ssa form are preserved.
+Call verify_ssa when VERIFY_SSA_P is true.  */
 void
-verify_loop_closed_ssa (void)
+verify_loop_closed_ssa (bool verify_ssa_p)
 {
 basic_block bb;
 gimple_stmt_iterator bsi;
 gimple phi;
 edge e;
 edge_iterator ei;
 if (number_of_loops () <= 1)
 return;
-verify_ssa (false);
+if (verify_ssa_p)
+verify_ssa (false);
 FOR_EACH_BB (bb)
 {
 for (bsi = gsi_start_phis (bb); !gsi_end_p (bsi); gsi_next (&bsi))
 	{
 if (!loops_state_satisfies_p (LOOPS_HAVE_PREHEADERS))
 return false;
 #ifdef ENABLE_CHECKING
 if (loops_state_satisfies_p (LOOP_CLOSED_SSA))
-verify_loop_closed_ssa ();
+verify_loop_closed_ssa (true);
 #endif
 first_new_block = last_basic_block;
 if (!duplicate_loop_to_header_edge (loop, e, ndupl, wont_exit,
 				      orig, to_remove, flags))
 #ifdef ENABLE_CHECKING
 verify_flow_info ();
 verify_dominators (CDI_DOMINATORS);
 verify_loop_structure ();
-verify_loop_closed_ssa ();
+verify_loop_closed_ssa (true);
 #endif
 }
 /* Wrapper over tree_transform_and_unroll_loop for case we do not
 want to transform the loop before unrolling.  The meaning
 /* Bases all the induction variables in LOOP on a single induction
 variable (unsigned with base 0 and step 1), whose final value is
 compared with *NIT.  When the IV type precision has to be larger
 than *NIT type precision, *NIT is converted to the larger type, the
 conversion code is inserted before the loop, and *NIT is updated to
-the new definition.  The induction variable is incremented in the
+the new definition.  When BUMP_IN_LATCH is true, the induction
-loop latch.  Return the induction variable that was created.  */
+variable is incremented in the loop latch, otherwise it is
+incremented in the loop header.  Return the induction variable that
+was created.  */
 tree
-canonicalize_loop_ivs (struct loop *loop, tree *nit)
+canonicalize_loop_ivs (struct loop *loop, tree *nit, bool bump_in_latch)
 {
 unsigned precision = TYPE_PRECISION (TREE_TYPE (*nit));
 unsigned original_precision = precision;
 tree type, var_before;
 gimple_stmt_iterator gsi, psi;
 *nit = force_gimple_operand (*nit, &stmts, true, NULL_TREE);
 if (stmts)
 	gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts);
 }
-gsi = gsi_last_bb (loop->latch);
+gsi = gsi_last_bb (bump_in_latch ? loop->latch : loop->header);
 create_iv (build_int_cst_type (type, 0), build_int_cst (type, 1), NULL_TREE,
-	     loop, &gsi, true, &var_before, NULL);
+	     loop, &gsi, bump_in_latch, &var_before, NULL);
 rewrite_all_phi_nodes_with_iv (loop, var_before);
 stmt = last_stmt (exit->src);
 /* Make the loop exit if the control condition is not satisfied.  */

Mercurial > hg > CbC > CbC_gcc

comparison gcc/tree-ssa-loop-manip.c @ 63:b7f97abdc517 gcc-4.6-20100522