-/**
- * Interblock liveness analysis.
- * @author Sebastian Hack
- * @date 6.12.2004
- * @cvs-id $Id$
- */
+/*
+ * Copyright (C) 1995-2007 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
+ * @version $Id$
+ */
+#ifndef FIRM_BE_BELIVE_H
+#define FIRM_BE_BELIVE_H
-#ifndef _BELIVE_H
-#define _BELIVE_H
+#include <stdio.h>
#include "firm_types.h"
#include "pset.h"
-#include "bearch_t.h"
-#include <stdio.h>
+#include "irlivechk.h"
+#include "bearch.h"
typedef enum {
be_lv_state_in = 1,
typedef struct _be_lv_info_t be_lv_info_t;
-
/**
* Compute the inter block liveness for a graph.
* @param irg The graph.
/**
* 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);
/**
* 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 it's operands maybe not.
* @param arch_env The architecture environment.
* @param cls The register class to consider.
* @param pos The node.
*/
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
+ * Compute a set of nodes which are live at another node.
+ * BEWARE: This is the liveness immediately before the node,
+ * so the node itself is not alive but it's operands are.
+ * @param arch_env The architecture environment.
+ * @param cls The register class to consider.
+ * @param pos The node.
+ * @param live The set to put them into.
+ * @return live.
*/
-void be_liveness_add_missing(be_lv_t *lv);
+pset *be_liveness_nodes_live_at_input(const be_lv_t *lv, const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live);
+
-#endif /* _BELIVE_H */
+#endif /* FIRM_BE_BELIVE_H */