Subversion Repositories scarts

/* Loop header copying on trees.

   Copyright (C) 2004, 2005 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 2, 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 COPYING.  If not, write to the Free

Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA

02110-1301, USA.  */

#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"

#include "tree-pass.h"

#include "timevar.h"

#include "cfgloop.h"

#include "tree-inline.h"

#include "flags.h"

#include "tree-inline.h"

/* Duplicates headers of loops if they are small enough, so that the statements

   in the loop body are always executed when the loop is entered.  This

   increases effectiveness of code motion optimizations, and reduces the need

   for loop preconditioning.  */

/* Check whether we should duplicate HEADER of LOOP.  At most *LIMIT

   instructions should be duplicated, limit is decreased by the actual

   amount.  */

static bool

should_duplicate_loop_header_p (basic_block header, struct loop *loop,

                                int *limit)

{

  block_stmt_iterator bsi;

  tree last;

  /* Do not copy one block more than once (we do not really want to do

     loop peeling here).  */

  if (header->aux)

    return false;

  gcc_assert (EDGE_COUNT (header->succs) > 0);

  if (single_succ_p (header))

    return false;

  if (flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 0)->dest)

      && flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 1)->dest))

    return false;

  /* If this is not the original loop header, we want it to have just

     one predecessor in order to match the && pattern.  */

  if (header != loop->header && !single_pred_p (header))

    return false;

  last = last_stmt (header);

  if (TREE_CODE (last) != COND_EXPR)

    return false;

  /* Approximately copy the conditions that used to be used in jump.c --

     at most 20 insns and no calls.  */

  for (bsi = bsi_start (header); !bsi_end_p (bsi); bsi_next (&bsi))

    {

      last = bsi_stmt (bsi);

      if (TREE_CODE (last) == LABEL_EXPR)

        continue;

      if (get_call_expr_in (last))

        return false;

      *limit -= estimate_num_insns (last);

      if (*limit < 0)

        return false;

    }

  return true;

}

/* Checks whether LOOP is a do-while style loop.  */

static bool

do_while_loop_p (struct loop *loop)

{

  tree stmt = last_stmt (loop->latch);

  /* If the latch of the loop is not empty, it is not a do-while loop.  */

  if (stmt

      && TREE_CODE (stmt) != LABEL_EXPR)

    return false;

  /* If the header contains just a condition, it is not a do-while loop.  */

  stmt = last_and_only_stmt (loop->header);

  if (stmt

      && TREE_CODE (stmt) == COND_EXPR)

    return false;

  return true;

}

/* For all loops, copy the condition at the end of the loop body in front

   of the loop.  This is beneficial since it increases efficiency of

   code motion optimizations.  It also saves one jump on entry to the loop.  */

static void

copy_loop_headers (void)

{

  struct loops *loops;

  unsigned i;

  struct loop *loop;

  basic_block header;

  edge exit, entry;

  basic_block *bbs, *copied_bbs;

  unsigned n_bbs;

  unsigned bbs_size;

  bool copied_p;

  loops = loop_optimizer_init (dump_file);

  if (!loops)

    return;

  /* We do not try to keep the information about irreducible regions

     up-to-date.  */

  loops->state &= ~LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS;

#ifdef ENABLE_CHECKING

  verify_loop_structure (loops);

#endif

  bbs = xmalloc (sizeof (basic_block) * n_basic_blocks);

  copied_bbs = xmalloc (sizeof (basic_block) * n_basic_blocks);

  bbs_size = n_basic_blocks;

  copied_p = 0;

  for (i = 1; i < loops->num; i++)

    {

      /* Copy at most 20 insns.  */

      int limit = 20;

      loop = loops->parray[i];

      if (!loop)

        continue;

      header = loop->header;

      /* If the loop is already a do-while style one (either because it was

         written as such, or because jump threading transformed it into one),

         we might be in fact peeling the first iteration of the loop.  This

         in general is not a good idea.  */

      if (do_while_loop_p (loop))

        continue;

      /* Iterate the header copying up to limit; this takes care of the cases

         like while (a && b) {...}, where we want to have both of the conditions

         copied.  TODO -- handle while (a || b) - like cases, by not requiring

         the header to have just a single successor and copying up to

         postdominator.  */

      exit = NULL;

      n_bbs = 0;

      while (should_duplicate_loop_header_p (header, loop, &limit))

        {

          /* Find a successor of header that is inside a loop; i.e. the new

             header after the condition is copied.  */

          if (flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 0)->dest))

            exit = EDGE_SUCC (header, 0);

          else

            exit = EDGE_SUCC (header, 1);

          bbs[n_bbs++] = header;

          gcc_assert (bbs_size > n_bbs);

          header = exit->dest;

        }

      if (!exit)

        continue;

      if (dump_file && (dump_flags & TDF_DETAILS))

        fprintf (dump_file,

                 "Duplicating header of the loop %d up to edge %d->%d.\n",

                 loop->num, exit->src->index, exit->dest->index);

      /* Ensure that the header will have just the latch as a predecessor

         inside the loop.  */

      if (!single_pred_p (exit->dest))

        exit = single_pred_edge (loop_split_edge_with (exit, NULL));

      entry = loop_preheader_edge (loop);

      if (tree_duplicate_sese_region (entry, exit, bbs, n_bbs, copied_bbs))

        copied_p = true;

      else

        {

          fprintf (dump_file, "Duplication failed.\n");

          continue;

        }

      /* Ensure that the latch and the preheader is simple (we know that they

         are not now, since there was the loop exit condition.  */

      loop_split_edge_with (loop_preheader_edge (loop), NULL);

      loop_split_edge_with (loop_latch_edge (loop), NULL);

    }

  if (copied_p)

    update_ssa (TODO_update_ssa);

  free (bbs);

  free (copied_bbs);

  loop_optimizer_finalize (loops, NULL);

}

static bool

gate_ch (void)

{

  return flag_tree_ch != 0;

}

struct tree_opt_pass pass_ch =

{

  "ch",                                 /* name */

  gate_ch,                              /* gate */

  copy_loop_headers,                    /* execute */

  NULL,                                 /* sub */

  NULL,                                 /* next */

  0,                                     /* static_pass_number */

  TV_TREE_CH,                           /* tv_id */

  PROP_cfg | PROP_ssa,                  /* properties_required */

  0,                                     /* properties_provided */

  0,                                     /* properties_destroyed */

  0,                                     /* todo_flags_start */

  TODO_cleanup_cfg | TODO_dump_func

  | TODO_verify_ssa,                    /* todo_flags_finish */

};