X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeirgmod.h;h=54fa679137e7ad74cad6e135449a2f11c4fa4ea9;hb=36c6b99832fbea890115a89d3122d5399c7164a0;hp=6d5240c4e50c3b32bca834527e48ca5fbfbc6702;hpb=03ffa62ef4f525aa0c45dbe766a17bc94b161695;p=libfirm diff --git a/ir/be/beirgmod.h b/ir/be/beirgmod.h index 6d5240c4e..54fa67913 100644 --- a/ir/be/beirgmod.h +++ b/ir/be/beirgmod.h @@ -10,13 +10,105 @@ #ifndef _BEIRGMOD_H #define _BEIRGMOD_H +#include "firm_types.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); -void be_introduce_copies(dom_front_info_t *info, ir_node *orig, - int n, ir_node *copy_nodes[]); +/** + * 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. + * + * This function reroutes all uses of the original value to the copies in the + * corresponding dominance subtrees and creates Phi functions if necessary. + * + * @param info Dominance frontier information. + * @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, 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, 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, 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. + */ +void be_ssa_constr_set_ignore(dom_front_info_t *df, pset *nodes, pset *ignore_uses); + +/** + * Same as be_ssa_constr() but with pset instead of array. + */ +void be_ssa_constr_set(dom_front_info_t *info, pset *nodes); + +/** + * Same as be_ssa_constr_phis_ignore() but with set instead of array. + */ +void be_ssa_constr_set_phis_ignore(dom_front_info_t *info, pset *nodes, pset *phis, pset *ignore); + +/** + * Same as be_ssa_constr_phis_ignore() but without ignore set. + */ +void be_ssa_constr_set_phis(dom_front_info_t *info, pset *nodes, pset *phis); + +/** + * Insert a Perm which permutates all (non-ignore) live values of a given register class + * after a certain instruction. + * @param arch_env The architecture environment. + * @param cls The register class. + * @param dom_front Dominance frontier information. + * @param irn The node to insert the Perm after. + * @return The Perm or NULL if nothing was live before @p irn. + */ +ir_node *insert_Perm_after(const arch_env_t *arch_env, + const arch_register_class_t *cls, + dom_front_info_t *dom_front, + ir_node *irn); -#endif +#endif /* _BEIRGMOD_H */