/*
- * 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.
*/
/**
* @brief Various verify routines that check a scheduled graph for correctness.
* @author Matthias Braun
* @date 05.05.2006
- * @version $Id$
*/
#ifndef FIRM_BE_BEVERIFY_H
#define FIRM_BE_BEVERIFY_H
+#include <stdbool.h>
#include "irgraph.h"
-#include "beirg.h"
#include "bearch.h"
/**
- * Verifies, that the register pressure for a given register class doesn't exceed the limit
- * of available registers.
+ * Verifies, that the register pressure for a given register class doesn't
+ * exceed the limit of available registers.
*
- * @param birg The backend IRG.
- * @param cls The register class to check.
* @param irg The irg to check.
- * @return 1 if the pressure is valid, 0 otherwise.
+ * @param cls The register class to check.
+ * @return true if the pressure is valid, false otherwise.
*/
-int be_verify_register_pressure(const be_irg_t *birg, const arch_register_class_t* cls, ir_graph *irg);
+bool be_verify_register_pressure(ir_graph *irg,
+ const arch_register_class_t* cls);
/**
* Does some sanity checks on the schedule.
*
- * @param irg The irg to check
- * @return 1 if the schedule is valid, 0 otherwise
+ * @param irg The irg to check
+ * @return true if the schedule is valid, false otherwise
*/
-int be_verify_schedule(const be_irg_t *birg);
+bool be_verify_schedule(ir_graph *irg);
/**
* Verify spillslots
*
* @param irg The irg to check
- * @return 1 if spillslots are valid, 0 otherwise
+ * @return true if spillslots are valid, false otherwise
*/
-int be_verify_spillslots(ir_graph *irg);
+bool be_verify_spillslots(ir_graph *irg);
/**
* Verify register allocation: Checks that no 2 live nodes have the same
* register assigned, also checks that each scheduled node has a register
* assigned.
*
- * @param birg The birg to check
- * @return 1 if verify succeeded, 0 otherwise
+ * @param irg The graph to check
+ * @return true if verify succeeded, false otherwise
*/
-int be_verify_register_allocation(const be_irg_t *birg);
+bool be_verify_register_allocation(ir_graph *irg);
/**
- * Verify that out edges are valid.
- *
- * @param irg The irg to check
- * @param 1 if verify succeeded, 0 otherwise
- *
- * @note: This function requires O(|nodes|^2) memory. Too much for
- * the Java Grande benchmark for instance!
+ * Check the given liveness information against a freshly computed one.
*/
-int be_verify_out_edges(ir_graph *irg);
+void be_liveness_check(be_lv_t *lv);
-#endif /* FIRM_BE_BEVERIFY_H */
+#endif