X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelive.h;h=9bab53992817714b372b5cae850c47437cfebee0;hb=9181bbbb24cd351c0e21c538bcf0341674e0c3fc;hp=360a56a6092f0270495ad1d10efb9e63b802f4e8;hpb=d2e85e5566577520ffc0a143d55a6eb6a3770ea4;p=libfirm diff --git a/ir/be/belive.h b/ir/be/belive.h index 360a56a60..9bab53992 100644 --- a/ir/be/belive.h +++ b/ir/be/belive.h @@ -1,20 +1,6 @@ /* - * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. - * * This file is part of libFirm. - * - * 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. - * - * 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. + * Copyright (C) 2012 University of Karlsruhe. */ /** @@ -22,52 +8,48 @@ * @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 "firm_types.h" -#include "pset.h" - -#include "irlivechk.h" -#include "bearch.h" +#include "be_types.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_none = 0, + 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; +ENUM_BITSET(be_lv_state_t) /** * Compute the inter block liveness for a graph. * @param irg The graph. */ -be_lv_t *be_liveness(ir_graph *irg); +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. @@ -91,27 +73,6 @@ void be_liveness_remove(be_lv_t *lv, const ir_node *irn); */ void be_liveness_introduce(be_lv_t *lv, ir_node *irn); -/** - * Add all nodes which are missing in the current liveness data. - * The liveness data of the already existing nodes (in the liveness data) is not touched. - * @param The liveness info. - */ -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 +97,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. @@ -168,36 +122,11 @@ void be_liveness_end_of_block(const be_lv_t *lv, const ir_node *bl, ir_nodeset_t *nodeset); /** - * Compute a set of nodes which are live at another node. - * BEWARE: This is the liveness immediately after the node, - * so the node itself is alive but its operands maybe not. + * Compute a set of nodes which are live just before the given node. * @param cls The register class to consider. * @param pos The node. * @param live The set to put them into. */ -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); +void be_liveness_nodes_live_before(be_lv_t const *lv, arch_register_class_t const *cls, ir_node const *pos, ir_nodeset_t *live); -#endif /* FIRM_BE_BELIVE_H */ +#endif