gcc/domwalk.h

   1 /* Generic dominator tree walker
   2    Copyright (C) 2003-2017 Free Software Foundation, Inc.
   3    Contributed by Diego Novillo <dnovillo@redhat.com>
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify
   8 it under the terms of the GNU General Public License as published by
   9 the Free Software Foundation; either version 3, or (at your option)
  10 any later version.
  11
  12 GCC is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU General Public License for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING3.  If not see
  19 <http://www.gnu.org/licenses/>.  */
  20
  21 #ifndef GCC_DOM_WALK_H
  22 #define GCC_DOM_WALK_H
  23
  24 /**
  25  * This is the main class for the dominator walker. It is expected that
  26  * consumers will have a custom class inheriting from it, which will over ride
  27  * at least one of before_dom_children and after_dom_children to implement the
  28  * custom behavior.
  29  */
  30 class dom_walker
  31 {
  32 public:
  33   /* Use SKIP_UNREACHBLE_BLOCKS = true when your client can discover
  34      that some edges are not executable.
  35
  36      If a client can discover that a COND, SWITCH or GOTO has a static
  37      target in the before_dom_children callback, the taken edge should
  38      be returned.  The generic walker will clear EDGE_EXECUTABLE on all
  39      edges it can determine are not executable.  */
  40   dom_walker (cdi_direction direction, bool skip_unreachable_blocks = false);
  41
  42   /* Walk the dominator tree.  */
  43   void walk (basic_block);
  44
  45   /* Function to call before the recursive walk of the dominator children.
  46
  47      Return value is the always taken edge if the block has multiple outgoing
  48      edges, NULL otherwise.  When skipping unreachable blocks, the walker
  49      uses the taken edge information to clear EDGE_EXECUTABLE on the other
  50      edges, exposing unreachable blocks.  A NULL return value means all
  51      outgoing edges should still be considered executable.  */
  52   virtual edge before_dom_children (basic_block) { return NULL; }
  53
  54   /* Function to call after the recursive walk of the dominator children.  */
  55   virtual void after_dom_children (basic_block) {}
  56
  57 private:
  58   /* This is the direction of the dominator tree we want to walk.  i.e.,
  59      if it is set to CDI_DOMINATORS, then we walk the dominator tree,
  60      if it is set to CDI_POST_DOMINATORS, then we walk the post
  61      dominator tree.  */
  62   const ENUM_BITFIELD (cdi_direction) m_dom_direction : 2;
  63   bool m_skip_unreachable_blocks;
  64   basic_block m_unreachable_dom;
  65
  66   /* Query whether or not the given block is reachable or not.  */
  67   bool bb_reachable (struct function *, basic_block);
  68
  69   /* Given an unreachable block, propagate that property to outgoing
  70      and possibly incoming edges for the block.  Typically called after
  71      determining a block is unreachable in the before_dom_children
  72      callback.  */
  73   void propagate_unreachable_to_edges (basic_block, FILE *, int);
  74
  75 };
  76
  77 #endif