gcc/loop-init.c

   1 /* Loop optimizer initialization routines.
   2    Copyright (C) 2002, 2003, 2004 Free Software Foundation, Inc.
   3
   4 This file is part of GCC.
   5
   6 GCC is free software; you can redistribute it and/or modify it under
   7 the terms of the GNU General Public License as published by the Free
   8 Software Foundation; either version 2, or (at your option) any later
   9 version.
  10
  11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  14 for more details.
  15
  16 You should have received a copy of the GNU General Public License
  17 along with GCC; see the file COPYING.  If not, write to the Free
  18 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
  19 02111-1307, USA.  */
  20
  21 #include "config.h"
  22 #include "system.h"
  23 #include "coretypes.h"
  24 #include "tm.h"
  25 #include "rtl.h"
  26 #include "hard-reg-set.h"
  27 #include "basic-block.h"
  28 #include "cfgloop.h"
  29 #include "cfglayout.h"
  30
  31 /* Initialize loop optimizer.  */
  32
  33 struct loops *
  34 loop_optimizer_init (FILE *dumpfile)
  35 {
  36   struct loops *loops = xcalloc (1, sizeof (struct loops));
  37   edge e;
  38   edge_iterator ei;
  39   static bool first_time = true;
  40
  41   if (first_time)
  42     {
  43       first_time = false;
  44       init_set_costs ();
  45     }
  46
  47   /* Avoid annoying special cases of edges going to exit
  48      block.  */
  49
  50   for (ei = ei_start (EXIT_BLOCK_PTR->preds); (e = ei_safe_edge (ei)); )
  51     if ((e->flags & EDGE_FALLTHRU) && EDGE_COUNT (e->src->succs) > 1)
  52       split_edge (e);
  53     else
  54       ei_next (&ei);
  55
  56   /* Find the loops.  */
  57
  58   if (flow_loops_find (loops, LOOP_TREE) <= 1)
  59     {
  60       /* No loops.  */
  61       flow_loops_free (loops);
  62       free (loops);
  63
  64       return NULL;
  65     }
  66
  67   /* Not going to update these.  */
  68   free (loops->cfg.rc_order);
  69   loops->cfg.rc_order = NULL;
  70   free (loops->cfg.dfs_order);
  71   loops->cfg.dfs_order = NULL;
  72
  73   /* Create pre-headers.  */
  74   create_preheaders (loops, CP_SIMPLE_PREHEADERS);
  75
  76   /* Force all latches to have only single successor.  */
  77   force_single_succ_latches (loops);
  78
  79   /* Mark irreducible loops.  */
  80   mark_irreducible_loops (loops);
  81
  82   /* Dump loops.  */
  83   flow_loops_dump (loops, dumpfile, NULL, 1);
  84
  85 #ifdef ENABLE_CHECKING
  86   verify_dominators (CDI_DOMINATORS);
  87   verify_loop_structure (loops);
  88 #endif
  89
  90   return loops;
  91 }
  92
  93 /* Finalize loop optimizer.  */
  94 void
  95 loop_optimizer_finalize (struct loops *loops, FILE *dumpfile)
  96 {
  97   unsigned i;
  98
  99   if (!loops)
 100     return;
 101
 102   for (i = 1; i < loops->num; i++)
 103     if (loops->parray[i])
 104       free_simple_loop_desc (loops->parray[i]);
 105
 106   /* Another dump.  */
 107   flow_loops_dump (loops, dumpfile, NULL, 1);
 108
 109   /* Clean up.  */
 110   flow_loops_free (loops);
 111   free (loops);
 112
 113   /* Checking.  */
 114 #ifdef ENABLE_CHECKING
 115   verify_flow_info ();
 116 #endif
 117 }