X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeirgmod.h;h=ed5922b132b3bec8ecc2352d3f93494290ca9f13;hb=e6ad8ee4680a88db8652483c2c6f3124f3d9a888;hp=3d5c797348ac2bf08355754f561326fc7eecaf95;hpb=f6803e61a5c32b49e3d8f9cdd3ce10d0036c5b37;p=libfirm diff --git a/ir/be/beirgmod.h b/ir/be/beirgmod.h index 3d5c79734..ed5922b13 100644 --- a/ir/be/beirgmod.h +++ b/ir/be/beirgmod.h @@ -46,22 +46,54 @@ void be_free_dominance_frontiers(dom_front_info_t *info); * represent the same concrete value. This is the case if you * - copy * - spill and reload - * - rematerialize + * - 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 neccessary. + * corresponding dominance subtrees and creates Phi functions if necessary. * - * @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. + * @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_introduce_copies_ignore(dom_front_info_t *info, ir_node *orig, - int n, ir_node *copies[], pset *irgore_uses); +void be_ssa_constr_phis_ignore(dom_front_info_t *info, int n, ir_node *nodes[], pset *phis, pset *ignore_uses); -void be_introduce_copies(dom_front_info_t *info, ir_node *orig, int n, ir_node *copies[]); +/** + * 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); -void be_introduce_copies_pset(dom_front_info_t *info, pset *nodes); +/** + * 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); #endif