From: Christoph Mallon <christoph.mallon@gmx.de>
Date: Sun, 22 Feb 2009 12:16:42 +0000 (+0000)
Subject: When sorting calls enforce a total order, because qsort() needs one.
X-Git-Url: http://nsz.repo.hu/git/?a=commitdiff_plain;h=394833a760d9cde30428b1c1fc346d3c7366eabf;p=libfirm

When sorting calls enforce a total order, because qsort() needs one.
Revoke PhD from: shack
Revoke diploma from: chriswue

[r25555]
---

diff --git a/ir/be/beabi.c b/ir/be/beabi.c
index 52e9f2146..1cec3a67c 100644
--- a/ir/be/beabi.c
+++ b/ir/be/beabi.c
@@ -1110,7 +1110,9 @@ static int cmp_call_dependency(const void *c1, const void *c2)
 	if (dependent_on(n2, n1))
 		return 1;
 
-	return 0;
+	/* The nodes have no depth order, but we need a total order because qsort()
+	 * is not stable. */
+	return get_irn_idx(n1) - get_irn_idx(n2);
 }
 
 /**