-
-/**
- * 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.
+ * 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.
*/
-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
+ * @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)
*/
-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 "firm_types.h"
+#include "beirg.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
+ * 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_free_dominance_frontiers(dom_front_info_t *info);
+ir_node *insert_Perm_after(ir_graph *irg, const arch_register_class_t *cls,
+ ir_node *irn);
/**
- * Introduce several copies for one node.
+ * Removes basic blocks that only contain a jump instruction
+ * (this will potentially create critical edges).
*
- * 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
- * - rematerialize
- * a value.
+ * @param irg the graph that will be changed
*
- * This function reroutes all uses of the original value to the copies in the
- * corresponding dominance subtrees and creates Phi functions if neccessary.
- *
- * @param info Dominance frontier information.
- * @param orig The node for which you want to introduce copies.
- * @param n The number of copies ypu introduce.
- * @param copies An array of nodes which are copies of @p orig.
+ * @return non-zero if the graph was changed, zero else
*/
-void be_introduce_copies_ignore(dom_front_info_t *info, ir_node *orig,
- int n, ir_node *copies[], pset *irgore_uses);
-
-void be_introduce_copies(dom_front_info_t *info, ir_node *orig, int n, ir_node *copies[]);
-
-void be_introduce_copies_for_set(dom_front_info_t *info, pset *origs, pset *copies);
-
-/* obsolete
-void be_introduce_copies_pset(dom_front_info_t *info, pset *nodes);
-*/
+int be_remove_empty_blocks(ir_graph *irg);
#endif
projects / libfirm / blobdiff