X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelive.h;h=71c9586f3bcd9f95b37d6419361360778013c37a;hb=df2faee01a5832057bb3ca0ba5f67e979c916e19;hp=fddbcdb352059e80034e74964b86c5419a065959;hpb=cb0c12e4aa9e238abd067ec1e9bc8a55115e29a4;p=libfirm diff --git a/ir/be/belive.h b/ir/be/belive.h index fddbcdb35..71c9586f3 100644 --- a/ir/be/belive.h +++ b/ir/be/belive.h @@ -1,18 +1,33 @@ -/** - * Interblock liveness analysis. - * @author Sebastian Hack - * @date 6.12.2004 - * @cvs-id $Id$ - */ - -#ifndef _BELIVE_H -#define _BELIVE_H - -#include "firm_types.h" -#include "pset.h" -#include "bearch_t.h" - -#include +/* + * 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. + */ + +/** + * @file + * @brief Interblock liveness analysis. + * @author Sebastian Hack + * @date 06.12.2004 + */ +#ifndef FIRM_BE_BELIVE_H +#define FIRM_BE_BELIVE_H + +#include "be_types.h" +#include "irnodeset.h" typedef enum { be_lv_state_in = 1, @@ -20,45 +35,47 @@ typedef enum { 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(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. * It is irrelevant if there is liveness information present for the node. - * The liveness information for the node is firstly deleted and then recompute. - * So, if the node is fresh and never recorded inf the liveness information - * before, it is more efficient to call be_liveness_introduce(). + * The liveness information for the node is firstly deleted and then recomputed. + * If the node is fresh and never recorded inf the liveness information before, + * it is more efficient to call be_liveness_introduce(). */ void be_liveness_update(be_lv_t *lv, ir_node *irn); /** * Remove a node from the liveness information. */ -void be_liveness_remove(be_lv_t *lv, ir_node *irn); +void be_liveness_remove(be_lv_t *lv, const ir_node *irn); /** * Introduce a new node to the liveness information. @@ -68,27 +85,6 @@ void be_liveness_remove(be_lv_t *lv, 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. @@ -113,49 +109,36 @@ 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. - */ -void 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. * Everything defined at the node is removed from the set, the uses of the node get inserted. - * @param arch_env The architecture environment. * @param cls The register class to consider. * @param irn The node at which liveness should be computed. * @param live The set of nodes live before @p irn. This set gets modified by updating it to * the nodes live after irn. * @return live. */ -pset *be_liveness_transfer(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *irn, pset *live); +void be_liveness_transfer(const arch_register_class_t *cls, ir_node *node, + ir_nodeset_t *nodeset); /** * Put all node live at the end of a block into a set. - * @param arch_env The architecture environment. * @param cls The register class to consider. * @param bl The block. * @param live The set to put them into. * @return live. */ -pset *be_liveness_end_of_block(const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *bl, pset *live); +void be_liveness_end_of_block(const be_lv_t *lv, + const arch_register_class_t *cls, + const ir_node *bl, ir_nodeset_t *nodeset); /** - * Compute a set of nodes which are live at another node. - * @param arch_env The architecture environment. + * 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. - * @return live. - */ -pset *be_liveness_nodes_live_at(const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live); - - -/** - * FIXME: Need comment */ -void be_liveness_add_missing(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 /* _BELIVE_H */ +#endif