beifg: Simplify the quite complicated way to divide a number by 2 in be_ifg_stat().

[libfirm] / ir / ana / irdom_t.h

diff --git a/ir/ana/irdom_t.h b/ir/ana/irdom_t.h
index 78e47bd..d3d42af 100644 (file)
--- a/ir/ana/irdom_t.h
+++ b/ir/ana/irdom_t.h
@@ -1,20 +1,6 @@
 /*
- * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
- *
  * This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
  */
 
 /**
@@ -22,12 +8,13 @@
  * @brief    Construct and access dominator tree -- private datastructures.
  * @author   Goetz Lindenmaier
  * @date     2.2002
- * @version  $Id$
  */
 #ifndef FIRM_ANA_IRDOM_T_H
 #define FIRM_ANA_IRDOM_T_H
 
 #include "irdom.h"
+#include "pmap.h"
+#include "obst.h"
 
 /** For dominator information */
 typedef struct ir_dom_info {
@@ -43,4 +30,33 @@ typedef struct ir_dom_info {
   int dom_depth;   /**< depth in dominator-tree */
 } ir_dom_info;
 
+typedef struct ir_dom_front_info_t {
+       pmap *df_map;         /**< A map, mapping every block to a list of its dominance frontier blocks. */
+       struct obstack obst;  /**< An obstack holding all the frontier data. */
+} ir_dom_front_info_t;
+
+void set_Block_idom(ir_node *bl, ir_node *n);
+
+int get_Block_dom_depth(const ir_node *bl);
+void set_Block_dom_depth(ir_node *bl, int depth);
+
+int get_Block_dom_pre_num(const ir_node *bl);
+void set_Block_dom_pre_num(ir_node *bl, int num);
+
+void set_Block_ipostdom(ir_node *bl, ir_node *n);
+
+int get_Block_postdom_depth(const ir_node *bl);
+void set_Block_postdom_depth(ir_node *bl, int depth);
+
+int get_Block_postdom_pre_num(const ir_node *bl);
+void set_Block_postdom_pre_num(ir_node *bl, int num);
+
+unsigned get_Block_dom_tree_pre_num(const ir_node *bl);
+unsigned get_Block_pdom_tree_pre_num(const ir_node *bl);
+
+unsigned get_Block_dom_max_subtree_pre_num(const ir_node *bl);
+unsigned get_Block_pdom_max_subtree_pre_num(const ir_node *bl);
+
+void ir_free_dominance_frontiers(ir_graph *irg);
+
 #endif