X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeirgmod.h;h=5447a389aa3f7df3846fe13616b2ec3748bad3ff;hb=6f965967e27f2e4db1a7dbf5d050bd415fceeb5b;hp=3b6029538d727f7e17e1279c0c830929f589c82f;hpb=cfb8a4615249a15a31b61f16d3d13f2fe4ba4a0c;p=libfirm diff --git a/ir/be/beirgmod.h b/ir/be/beirgmod.h index 3b6029538..5447a389a 100644 --- a/ir/be/beirgmod.h +++ b/ir/be/beirgmod.h @@ -1,129 +1,63 @@ - -/** - * 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 "firm_types.h" -#include "pset.h" - -#include "belive.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 lv Liveness information to be updated. If NULL, liveness updating is simply ignored. - * @param n Length of nodes array. - * @param nodes The nodes which shall represent the same SSA value. - * @param phis A set to which all inserted Phis are added. - * @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_phis_ignore(dom_front_info_t *info, be_lv_t *lv, int n, ir_node *nodes[], pset *phis, pset *ignore_uses); - -/** - * Same as be_ssa_constr_phis_ignore() but without the ignore set. - */ -void be_ssa_constr_phis(dom_front_info_t *info, be_lv_t *lv, int n, ir_node *nodes[], pset *phis); - -/** - * Same as be_ssa_constr_phis_ignore() but without the Phi set. - */ -void be_ssa_constr_ignore(dom_front_info_t *info, be_lv_t *lv, 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, be_lv_t *lv, int n, ir_node *nodes[]); - -/** - * Same as be_ssa_constr_ignore() but with pset instead of array. - */ -void be_ssa_constr_set_ignore(dom_front_info_t *df, be_lv_t *lv, pset *nodes, pset *ignore_uses); - -/** - * Same as be_ssa_constr() but with pset instead of array. + * 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_set(dom_front_info_t *info, be_lv_t *lv, pset *nodes); /** - * Same as be_ssa_constr_phis_ignore() but with set instead of array. + * @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) */ -void be_ssa_constr_set_phis_ignore(dom_front_info_t *info, be_lv_t *lv, pset *nodes, pset *phis, pset *ignore); +#ifndef FIRM_BE_BEIRGMOD_H +#define FIRM_BE_BEIRGMOD_H -/** - * Same as be_ssa_constr_phis_ignore() but without ignore set. - */ -void be_ssa_constr_set_phis(dom_front_info_t *info, be_lv_t *lv, pset *nodes, pset *phis); +#include "be_types.h" +#include "firm_types.h" /** * Insert a Perm which permutes all (non-ignore) live values of a given register class - * after a certain instruction. - * @param arch_env The architecture environment. + * before a certain instruction. * @param lv Liveness Information. - * @param cls The register class. - * @param dom_front Dominance frontier information. - * @param irn The node to insert the Perm after. + * @param irn The node to insert the Perm before. * @return The Perm or NULL if nothing was live before @p irn. */ -ir_node *insert_Perm_after(const arch_env_t *arch_env, - be_lv_t *lv, - const arch_register_class_t *cls, - dom_front_info_t *dom_front, +ir_node *insert_Perm_before(ir_graph *irg, const arch_register_class_t *cls, ir_node *irn); -struct _be_chordal_env_t; - -void extreme_liverange_splitting(struct _be_chordal_env_t *cenv); +/** + * 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 + */ +int be_remove_empty_blocks(ir_graph *irg); /** - * removes basic blocks that only contain a jump instruction - * (this will potentially create critical edges) + * Removes dead nodes from schedule + * @param irg the graph */ -void be_remove_empty_bocks(ir_graph *irg); +void be_remove_dead_nodes_from_schedule(ir_graph *irg); -#endif /* _BEIRGMOD_H */ +#endif