* Makefile.in (OBJC-common): Add tree-ssa-threadupdate.c

        (tree-ssa-threadupdate.o): Add dependencies.
        * tree-ssa-threadupdate.c: New file.
        * tree-flow.h (incoming_edge_threaded): New flag in block annotation.
        (rewrite_vars_out_of_ssa): Remove prototype.
        (cleanup_tree_cfg): Returns a bool.
        * tree.h (thread_through_all_blocks): Prototype.
        * tree-outof-ssa.c  (SSANORM_*): Move into here.
        (remove_ssa_form): Now static.
        (rewrite_vars_out_of_ssa): Kill.
        * tree-ssa-live.c (register_ssa_partitions_for_vars): Kill.
        * tree-ssa-live.h (SSANORM_*): Moved into tree-outof-ssa.c.
        (remove_ssa_form, register_partitions_for_vars): Kill declarations.
        * tree-cfg.c (cleanup_tree_cfg): Return a value indicating if
        anything was changed.
        * tree-phinodes.c (add_phi_arg): Get the block for the PHI
        from the PHI's annotation rather than the edge associated with
        the new argument.
        * tree-ssa-dom.c (redirection_edges): Kill.
        (redirect_edges_and_update_ssa_graph): Kill.
        (tree_ssa_dominator_optimize): Do not reset forwardable flag
        for blocks anymore.  Do not initialize redirection_edges.
        Call thread_through_all_blocks.  Simplify code for cleanup
        of the CFG and iterating.  No longer call cleanup_tree_cfg
        outside the iteration loop.
        (thread_across_edge): No longer mess with forwardable blocks.


git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@85721 138bc75d-0d04-0410-961f-82ee72b054a4

1 files changed, 0 insertions, 92 deletions

diff --git a/gcc/tree-ssa-live.c b/gcc/tree-ssa-live.c
index 45df501ee1b..bd5e8fb22ae 100644
--- a/gcc/tree-ssa-live.c
+++ b/gcc/tree-ssa-live.c
@@ -1827,95 +1827,3 @@ dump_live_info (FILE *f, tree_live_info_p live, int flag)
 	}
     }
 }
-
-/* Register partitions in MAP so that we can take VARS out of SSA form. 
-   This requires a walk over all the PHI nodes and all the statements.  */
-
-void
-register_ssa_partitions_for_vars (bitmap vars, var_map map)
-{
-  basic_block bb;
-
-  if (bitmap_first_set_bit (vars) >= 0)
-    {
-
-      /* Find every instance (SSA_NAME) of variables in VARs and
-	 register a new partition for them.  This requires examining
-	 every statement and every PHI node once.  */
-      FOR_EACH_BB (bb)
-	{
-	  block_stmt_iterator bsi;
-	  tree next;
-	  tree phi;
-
-	  /* Register partitions for SSA_NAMEs appearing in the PHI
-	     nodes in this basic block.
-
-	     Note we delete PHI nodes in this loop if they are 
-	     associated with virtual vars which are going to be
-	     renamed.  */
-	  for (phi = phi_nodes (bb); phi; phi = next)
-	    {
-	      tree result = SSA_NAME_VAR (PHI_RESULT (phi));
-
-	      next = PHI_CHAIN (phi);
-	      if (bitmap_bit_p (vars, var_ann (result)->uid))
-		{
-		  if (! is_gimple_reg (result))
-		    remove_phi_node (phi, NULL_TREE, bb);
-		  else
-		    {
-		      int i;
-
-		      /* Register a partition for the result.  */
-		      register_ssa_partition (map, PHI_RESULT (phi), 0);
-
-		      /* Register a partition for each argument as needed.  */
-		      for (i = 0; i < PHI_NUM_ARGS (phi); i++)
-			{
-			  tree arg = PHI_ARG_DEF (phi, i);
-
-			  if (TREE_CODE (arg) != SSA_NAME)
-			    continue;
-			  if (!bitmap_bit_p (vars, 
-					     var_ann (SSA_NAME_VAR (arg))->uid))
-			    continue;
-
-			  register_ssa_partition (map, arg, 1);
-		        }
-		    }
-		}
-	    }
-
-	  /* Now register partitions for SSA_NAMEs appearing in each
-	     statement in this block.  */
-	  for (bsi = bsi_start (bb); ! bsi_end_p (bsi); bsi_next (&bsi))
-	    {
-	      stmt_ann_t ann = stmt_ann (bsi_stmt (bsi));
-	      use_optype uses = USE_OPS (ann);
-	      def_optype defs = DEF_OPS (ann);
-	      unsigned int i;
-
-	      for (i = 0; i < NUM_USES (uses); i++)
-		{
-		  tree op = USE_OP (uses, i);
-
-		  if (TREE_CODE (op) == SSA_NAME
-		      && bitmap_bit_p (vars, var_ann (SSA_NAME_VAR (op))->uid))
-		    register_ssa_partition (map, op, 1);
-		}
-		    
-	      for (i = 0; i < NUM_DEFS (defs); i++)
-		{
-		  tree op = DEF_OP (defs, i);
-
-		  if (TREE_CODE (op) == SSA_NAME
-			  && bitmap_bit_p (vars,
-			     var_ann (SSA_NAME_VAR (op))->uid))
-		    register_ssa_partition (map, op, 0);
-		}
-	    }
-	}
-    }
-}
-