X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeirgmod.h;h=6f98d1a5c9d234f35eede50e8fc10c03f448e025;hb=0754bb717d5761ad49a36f0e29829ffac413d92e;hp=200a07491b86fbd9137e5777664ae1e1945d417b;hpb=06cf13e40f34e97ab54f16a88e1897780093ac98;p=libfirm

diff --git a/ir/be/beirgmod.h b/ir/be/beirgmod.h
index 200a07491..6f98d1a5c 100644
--- a/ir/be/beirgmod.h
+++ b/ir/be/beirgmod.h
@@ -1,78 +1,49 @@
-
-/**
- * IRG modifications for be routines.
- * @date 4.5.2005
- *
- * Copyright (C) 2005 Universitaet Karlsruhe.
- * Released under the GPL.
- */
-
-#ifndef _BEIRGMOD_H
-#define _BEIRGMOD_H
-
-#include "pset.h"
-
 /*
- * Forward type declaration.
+ * This file is part of libFirm.
+ * Copyright (C) 2012 University of Karlsruhe.
  */
-typedef struct _dom_front_info_t dom_front_info_t;
 
 /**
- * Compute the dominance frontiers for a given graph.
- * @param  irg The graphs.
- * @return A pointer to the dominance frontier information.
+ * @file
+ * @brief       Backend IRG modification routines.
+ * @author      Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig
+ * @date        04.05.2005
+ *
+ * This file contains the following IRG modifications for be routines:
+ * - insertion of Perm nodes
+ * - empty block elimination
+ * - a simple dead node elimination (set inputs of unreachable nodes to BAD)
  */
-dom_front_info_t *be_compute_dominance_frontiers(ir_graph *irg);
+#ifndef FIRM_BE_BEIRGMOD_H
+#define FIRM_BE_BEIRGMOD_H
 
-/**
- * Get the dominance frontier of a block.
- * @param info 	A pointer to the dominance frontier information.
- * @param block The block whose dominance frontier you want.
- * @return A set containing the all blocks in the dominance frontier of @p block.
- */
-pset *be_get_dominance_frontier(dom_front_info_t *info, ir_node *block);
+#include "be_types.h"
+#include "firm_types.h"
 
 /**
- * Free some dominance frontier information.
- * @param info Some dominance frontier information.
+ * Insert a Perm which permutes all (non-ignore) live values of a given register class
+ * before a certain instruction.
+ * @param lv        Liveness Information.
+ * @param irn       The node to insert the Perm before.
+ * @return          The Perm or NULL if nothing was live before @p irn.
  */
-void be_free_dominance_frontiers(dom_front_info_t *info);
+ir_node *insert_Perm_before(ir_graph *irg, const arch_register_class_t *cls,
+						   ir_node *irn);
 
 /**
- * Introduce several copies for one node.
- *
- * A copy in this context means, that you want to introduce several new
- * abstract values (in Firm: nodes) for which you know, that they
- * represent the same concrete value. This is the case if you
- * - copy
- * - spill and reload
- * - re-materialize
- * a value.
+ * Removes basic blocks that only contain a jump instruction
+ * (this will potentially create critical edges).
  *
- * This function reroutes all uses of the original value to the copies in the
- * corresponding dominance subtrees and creates Phi functions if necessary.
+ * @param irg  the graph that will be changed
  *
- * @param info		  Dominance frontier information.
- * @param n           Length of nodes array.
- * @param nodes       The nodes which shall represent the same SSA value.
- * @param ignore_uses A set of nodes probably using one of the nodes in @p nodes.
- *                    Their usage will not adjusted. They remain untouched by this function.
- */
-void be_ssa_constr_ignore(dom_front_info_t *info, int n, ir_node *nodes[], pset *ignore_uses);
-
-/**
- * Same as be_ssa_constr_ignore() but with empty ignore set.
- */
-void be_ssa_constr(dom_front_info_t *info, int n, ir_node *nodes[]);
-
-/**
- * Same as be_ssa_constr_ignore() but with pset instead of array.
+ * @return non-zero if the graph was changed, zero else
  */
-void be_ssa_constr_set_ignore(dom_front_info_t *df, pset *nodes, pset *ignore_uses);
+int be_remove_empty_blocks(ir_graph *irg);
 
 /**
- * Same as be_ssa_constr() but with pset instead of array.
+ * Removes dead nodes from schedule
+ * @param irg  the graph
  */
-void be_ssa_constr_set(dom_front_info_t *info, pset *nodes);
+void be_remove_dead_nodes_from_schedule(ir_graph *irg);
 
 #endif