+/*
+ * 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.
+ */
+
/**
* Interblock liveness analysis.
* @author Sebastian Hack
* @date 6.12.2004
* @cvs-id $Id$
*/
-
-#ifndef _BELIVE_H
-#define _BELIVE_H
+#ifndef FIRM_BELIVE_H
+#define FIRM_BELIVE_H
#include "firm_types.h"
#include "pset.h"
-#include "bearch_t.h"
+#include "bearch.h"
#include <stdio.h>
/**
* 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);