changed solve function, return now 0 or negative on number, cost are pointer param

[r8279]

diff --git a/ir/adt/hungarian.c b/ir/adt/hungarian.c
index 5be8b71..bbb8590 100644 (file)
--- a/ir/adt/hungarian.c
+++ b/ir/adt/hungarian.c
@@ -184,7 +184,7 @@ void hungarian_free(hungarian_problem_t* p) {
 /**
  * Do the assignment.
  */
-int hungarian_solve(hungarian_problem_t* p, int *assignment) {
+int hungarian_solve(hungarian_problem_t* p, int *assignment, int *final_cost) {
        int i, j, m, n, k, l, s, t, q, unmatched, cost;
        int *col_mate;
        int *row_mate;
@@ -442,5 +442,7 @@ done:
        xfree(unchosen_row);
        xfree(col_mate);
 
-       return cost;
+       *final_cost = cost;
+
+       return 0;
 }

diff --git a/ir/adt/hungarian.h b/ir/adt/hungarian.h
index 0fe7d9e..2ac922d 100644 (file)
--- a/ir/adt/hungarian.h
+++ b/ir/adt/hungarian.h
@@ -76,9 +76,10 @@ void hungarian_free(hungarian_problem_t *p);
  * This method computes the optimal assignment.
  * @param p          The hungarian object
  * @param assignment The final assignment
- * @return The resulting cost or a negative value if matching is invalid.
+ * @param final_cost The final costs
+ * @return 0 on success, negative number otherwise
  */
-int hungarian_solve(hungarian_problem_t *p, int *assignment);
+int hungarian_solve(hungarian_problem_t *p, int *assignment, int *final_cost);
 
 /**
  * Print the cost matrix.