-
/**
- * IRG modifications for be routines.
- * @date 4.5.2005
+ * @file
+ * @brief
+ * 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)
*
- * 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.
+ * @author Sebastian Hack, Daniel Grund, Matthias Braun, Christian Wuerdig
+ * @date 04.05.2005
+ * @version $Id$
+ * Copyright: (c) Universitaet Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
*/
-dom_front_info_t *be_compute_dominance_frontiers(ir_graph *irg);
+#ifndef _FIRM_BE_IRGMOD_H_
+#define _FIRM_BE_IRGMOD_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);
-
-/**
- * Free some dominance frontier information.
- * @param info Some dominance frontier information.
- */
-void be_free_dominance_frontiers(dom_front_info_t *info);
+#include "irnode.h"
+#include "beirg.h"
+#if 0
/**
* Introduce several copies for one node.
*
* a value.
*
* This function reroutes all uses of the original value to the copies in the
- * corresponding dominance subtrees and creates Phi functions if necessary.
+ * corresponding dominance subtrees and creates Phi functions where necessary.
+ *
+ * @note The visited flag and link fields are used.
*
* @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.
- */
-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.
+ * @param lv Liveness information to be updated. If NULL, no liveness
+ * updating is performed.
+ * @param value The value that has been duplicated.
+ * @param copies_len the length of the copies array
+ * @param copie an array holding all copies of the value
+ * @param phis An ARR_F where all newly created phis will be inserted,
+ * may be NULL
+ * @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. May be NULL.
*/
-void be_ssa_constr_single_ignore(dom_front_info_t *info, ir_node *orig, int n, ir_node *copies[], pset *ignore_uses);
+ir_node **be_ssa_construction(const be_dom_front_info_t *info, be_lv_t *lv,
+ ir_node *value, int copies_len, ir_node **copies,
+ const ir_nodeset_t *ignore_uses, int need_new_phis);
-/**
- * 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[]);
+/** @deprecated */
+void be_ssa_constr_set_ignore(const be_dom_front_info_t *info, be_lv_t *lv,
+ pset *nodes, pset *ignores);
+#endif
/**
- * 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 /* _BEIRGMOD_H */
projects / libfirm / blobdiff