X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeverify.h;h=180ad5a638b3b5d15201d5623049955a87e043fd;hb=64723d1bd8ace74ca5f0018db8655f2a1f443532;hp=32511f94afaa4b9abe3debdec7afc3dce34ac7cf;hpb=4d5c3365a58cba59993045a9e08e686d8ae079a7;p=libfirm

diff --git a/ir/be/beverify.h b/ir/be/beverify.h
index 32511f94a..180ad5a63 100644
--- a/ir/be/beverify.h
+++ b/ir/be/beverify.h
@@ -1,5 +1,5 @@
 /*
- * 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.
  *
@@ -18,24 +18,19 @@
  */
 
 /**
- * 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$
  */
+#ifndef FIRM_BE_BEVERIFY_H
+#define FIRM_BE_BEVERIFY_H
 
-/**
- * @file beverify.h
- *
- * Various verify routines that check a scheduled graph for correctness
- *
- * @author Matthias Braun
- */
-#ifndef BEVERIFY_H_
-#define BEVERIFY_H_
+#include "irgraph.h"
 
-#include "bechordal.h"
+#include "beirg.h"
+#include "bearch.h"
 
 /**
  * Verifies, that the register pressure for a given register class doesn't exceed the limit
@@ -62,24 +57,27 @@ int be_verify_schedule(const be_irg_t *birg);
  * @param irg   The irg to check
  * @return      1 if spillslots are valid, 0 otherwise
  */
-int be_verify_spillslots(const arch_env_t *arch_env, ir_graph *irg);
+int 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 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 */