/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
*/
/**
- * Author: Matthias Braun
- * Date: 05.05.2006
- * Copyright: (c) Universitaet Karlsruhe
- * License: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
- * CVS-Id: $Id$
+ * @file
+ * @brief Various verify routines that check a scheduled graph for correctness.
+ * @author Matthias Braun
+ * @date 05.05.2006
+ * @version $Id$
*/
-
-/**
- * @file beverify.h
- *
- * Various verify routines that check a scheduled graph for correctness
- *
- * @author Matthias Braun
- */
-#ifndef BEVERIFY_H_
-#define BEVERIFY_H_
+#ifndef FIRM_BE_BEVERIFY_H
+#define FIRM_BE_BEVERIFY_H
#include "irgraph.h"
* register assigned, also checks that each scheduled node has a register
* assigned.
*
- * @param irg The irg to check
- * @return 1 if verify succeeded, 0 otherwise
+ * @param birg The birg to check
+ * @return 1 if verify succeeded, 0 otherwise
*/
-int be_verify_register_allocation(const arch_env_t *arch_env, ir_graph *irg);
+int be_verify_register_allocation(const be_irg_t *birg);
/**
- * Verify that out edges are valid
+ * 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!
*/
int be_verify_out_edges(ir_graph *irg);
-#endif /* BEVERIFY_H_ */
+#endif /* FIRM_BE_BEVERIFY_H */