X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeverify.h;h=180ad5a638b3b5d15201d5623049955a87e043fd;hb=5db9cfb26b9524a5531404ae4911837e60783586;hp=869866f80b4d7cc1262ee66b067e05c48d7363e5;hpb=1ce363f80e6a204d4011f85813362d9bd1d0e7e4;p=libfirm

diff --git a/ir/be/beverify.h b/ir/be/beverify.h
index 869866f80..180ad5a63 100644
--- a/ir/be/beverify.h
+++ b/ir/be/beverify.h
@@ -57,7 +57,7 @@ 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
@@ -70,10 +70,13 @@ int be_verify_spillslots(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);