fix trailing whitespaces and tabulators in the middle of a line

[libfirm] / ir / be / beverify.h

diff --git a/ir/be/beverify.h b/ir/be/beverify.h
index 180ad5a..bd8d2f7 100644 (file)
--- a/ir/be/beverify.h
+++ b/ir/be/beverify.h
@@ -36,12 +36,12 @@
  * 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.
+ * @param cls        The register class to check.
  * @return                      1 if the pressure is valid, 0 otherwise.
  */
-int be_verify_register_pressure(const be_irg_t *birg, const arch_register_class_t* cls, ir_graph *irg);
+int be_verify_register_pressure(ir_graph *irg,
+                                const arch_register_class_t* cls);
 
 /**
  * Does some sanity checks on the schedule.
@@ -49,7 +49,7 @@ int be_verify_register_pressure(const be_irg_t *birg, const arch_register_class_
  * @param irg  The irg to check
  * @return             1 if the schedule is valid, 0 otherwise
  */
-int be_verify_schedule(const be_irg_t *birg);
+int be_verify_schedule(ir_graph *irg);
 
 /**
  * Verify spillslots
@@ -64,20 +64,9 @@ int be_verify_spillslots(ir_graph *irg);
  * register assigned, also checks that each scheduled node has a register
  * assigned.
  *
- * @param birg  The birg to check
+ * @param irg   The graph to check
  * @return      1 if verify succeeded, 0 otherwise
  */
-int be_verify_register_allocation(const be_irg_t *birg);
-
-/**
- * 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);
+int be_verify_register_allocation(ir_graph *irg);
 
-#endif /* FIRM_BE_BEVERIFY_H */
+#endif