X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeirgmod.h;h=398e56b39915b107c0248e4d156859cb63b0696c;hb=ccdf802c598f7adc5e35fff42fed029c59f48a57;hp=b16b692a6b518ce19b9dec1044daf342e9e432b8;hpb=8786fa72e7744afaaecdab0d002fc821539b79b9;p=libfirm

diff --git a/ir/be/beirgmod.h b/ir/be/beirgmod.h
index b16b692a6..398e56b39 100644
--- a/ir/be/beirgmod.h
+++ b/ir/be/beirgmod.h
@@ -1,85 +1,58 @@
-
-/**
- * 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.
- */
-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.
- */
-dom_front_info_t *be_compute_dominance_frontiers(ir_graph *irg);
-
-/**
- * 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);
-
-/**
- * Free some dominance frontier information.
- * @param info Some dominance frontier information.
- */
-void be_free_dominance_frontiers(dom_front_info_t *info);
-
-/**
- * Introduce several copies for one node.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
- * 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.
+ * This file is part of libFirm.
  *
- * This function reroutes all uses of the original value to the copies in the
- * corresponding dominance subtrees and creates Phi functions if necessary.
+ * 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.
  *
- * @param info		  Dominance frontier information.
- * @param n_origs     The number of nodes for which the copies are introduced.
- * @param orig_nodes  The nodes for which you want to introduce copies.
- * @param n_copies    The number of copies you introduce.
- * @param copy_nodes  An array of nodes which are copies of @p orig.
- * @param ignore_uses A set containing uses which shall not be rerouted.
+ * 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.
  */
-void be_ssa_constr_ignore(dom_front_info_t *info, int n_origs, ir_node *orig_nodes[],
-						  int n_copies, ir_node *copy_nodes[], pset *ignore_uses);
 
 /**
- * Same as be_ssa_constr_ignore() but with a single original node.
+ * @file
+ * @brief       Backend IRG modification routines.
+ * @author      Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig
+ * @date        04.05.2005
+ * @version     $Id$
+ *
+ * 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)
  */
-void be_ssa_constr_single_ignore(dom_front_info_t *info, ir_node *orig, int n, ir_node *copies[], pset *ignore_uses);
+#ifndef FIRM_BE_BEIRGMOD_H
+#define FIRM_BE_BEIRGMOD_H
 
-/**
- * Same as be_ssa_constr_single_ignore() but without ignoring nodes.
- */
-void be_ssa_constr_single(dom_front_info_t *info, ir_node *orig, int n, ir_node *copy_nodes[]);
+#include "firm_types.h"
+#include "beirg.h"
 
 /**
- * Same as be_ssa_constr_ignore() but without ignoring nodes.
+ * Insert a Perm which permutes all (non-ignore) live values of a given register class
+ * after a certain instruction.
+ * @param lv        Liveness Information.
+ * @param irn       The node to insert the Perm after.
+ * @return          The Perm or NULL if nothing was live before @p irn.
  */
-void be_ssa_constr(dom_front_info_t *info, int n_orig, ir_node *orig[], int n, ir_node *copy_nodes[]);
+ir_node *insert_Perm_after(be_irg_t *birg, const arch_register_class_t *cls,
+						   ir_node *irn);
 
 /**
- * Same as be_ssa_constr() but with psets.
+ * Removes basic blocks that only contain a jump instruction
+ * (this will potentially create critical edges).
+ *
+ * @param irg  the graph that will be changed
+ *
+ * @return non-zero if the graph was changed, zero else
  */
-void be_ssa_constr_sets(dom_front_info_t *info, pset *origs, pset *copies);
+int be_remove_empty_blocks(ir_graph *irg);
 
-#endif
+#endif /* FIRM_BE_BEIRGMOD_H */