X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelive.h;h=311448b369553cc67b6e8b42ffd8a3b6712b70c5;hb=c6571686bfbfb3c87ae24ae1dc568e685d6cd49a;hp=ceb84e068f650092efd7df29eab4c4951000aa22;hpb=441912f0da3d6e1acf5ef88fc38297f90bc774a3;p=libfirm diff --git a/ir/be/belive.h b/ir/be/belive.h index ceb84e068..311448b36 100644 --- a/ir/be/belive.h +++ b/ir/be/belive.h @@ -22,13 +22,14 @@ * @brief Interblock liveness analysis. * @author Sebastian Hack * @date 06.12.2004 - * @version $Id$ */ #ifndef FIRM_BE_BELIVE_H #define FIRM_BE_BELIVE_H #include +#include "be_types.h" + #include "firm_types.h" #include "pset.h" @@ -36,38 +37,39 @@ #include "bearch.h" #include "irnodeset.h" -struct be_irg_t; - typedef enum { be_lv_state_in = 1, be_lv_state_end = 2, be_lv_state_out = 4, } be_lv_state_t; -typedef struct _be_lv_t be_lv_t; - -typedef struct _be_lv_info_t be_lv_info_t; - /** * Compute the inter block liveness for a graph. * @param irg The graph. */ -be_lv_t *be_liveness(const struct be_irg_t *birg); +be_lv_t *be_liveness_new(ir_graph *irg); /** - * Check the given liveness information against a freshly computed one. + * Free the liveness information. */ -void be_liveness_check(be_lv_t *lv); +void be_liveness_free(be_lv_t *lv); /** - * Free the liveness information. + * (Re)compute the liveness information if necessary. */ -void be_liveness_free(be_lv_t *lv); +void be_liveness_compute_sets(be_lv_t *lv); +void be_liveness_compute_chk(be_lv_t *lv); /** - * Recompute the complete liveness information. + * Invalidate the liveness information. + * You must call this if you modify the program and do not + * update the liveness with the be_liveness_{update,remove,introduce} + * functions. + * @note If changed the control flow then you must also call + * be_liveness_invalidate_chk() */ -void be_liveness_recompute(be_lv_t *lv); +void be_liveness_invalidate_sets(be_lv_t *lv); +void be_liveness_invalidate_chk(be_lv_t *lv); /** * Update the liveness information for a single node. @@ -98,20 +100,6 @@ void be_liveness_introduce(be_lv_t *lv, ir_node *irn); */ void be_liveness_add_missing(be_lv_t *lv); -/** - * Dump the liveness information for a graph. - * @param f The output. - * @param irg The graph. - */ -void be_liveness_dump(const be_lv_t *lv, FILE *f); - -/** - * Dump the liveness information for a graph. - * @param irg The graph. - * @param cls_name A string used as substring in the filename. - */ -void be_liveness_dumpto(const be_lv_t *lv, const char *cls_name); - /** * Check, if a node is live in at a block. * @param block The block. @@ -136,13 +124,6 @@ int (be_is_live_out)(const be_lv_t *lv, const ir_node *block, const ir_node *irn */ int (be_is_live_end)(const be_lv_t *lv, const ir_node *block, const ir_node *irn); -/** - * Check, if the SSA dominance property is fulfilled. - * @param irg The graph. - * @return 1 if dominance property is fulfilled, 0 otherwise - */ -int be_check_dominance(ir_graph *irg); - /** * The liveness transfer function. * Updates a live set over a single step from a given node to its predecessor. @@ -179,25 +160,4 @@ void be_liveness_nodes_live_at(const be_lv_t *lv, const arch_register_class_t *cls, const ir_node *pos, ir_nodeset_t *live); -/** - * Make sure the live sets are computed. - * @param lv The liveness information. - */ -void be_liveness_assure_sets(be_lv_t *lv); - -/** - * Make sure all information needed for liveness checks is available. - * @param lv The liveness information. - */ -void be_liveness_assure_chk(be_lv_t *lv); - -/** - * Invalidate the liveness information. - * You must call this if you modify the program and do not - * update the liveness with the be_liveness_{update,remove,introduce} - * functions. - * @param lv The liveness info. - */ -void be_liveness_invalidate(be_lv_t *lv); - -#endif /* FIRM_BE_BELIVE_H */ +#endif