summary refs log tree commit diff
path: root/ssa.c
diff options
context:
space:
mode:
authorQuentin Carbonneaux <quentin@c9x.me>2017-05-16 11:33:41 -0400
committerQuentin Carbonneaux <quentin@c9x.me>2017-05-16 11:33:41 -0400
commit425a2ed09c08222e1254d93dba24c7a50e7a08b9 (patch)
tree8637b9bcc9574e44e078994a4ea514289729e106 /ssa.c
parent51c46ba6914741cbca54d3351f8cf8d2689fd3dc (diff)
downloadroux-425a2ed09c08222e1254d93dba24c7a50e7a08b9.tar.gz
do not account for interferences in phi classes
Before this commit, I tried to make sure that
two interfering temporaries never ended up in
the same phi class.

This was to make sure that their register hints
were not counterproductively stepping on each
other's toes.  The idea is fine, but:

  * the implementation is clumsy because it
    mixes the orthogonal concepts of
    (i) interference and (ii) phi classes;

  * the hinting process in the register
    allocator is hard to understand because
    the disjoint-set data structure used for
    phi classes is cut in arbitrary places.

After this commit, the phi classes *really* are
phi classes represented with a proper disjoint-set
data structure.
Diffstat (limited to 'ssa.c')
-rw-r--r--ssa.c17
1 files changed, 9 insertions, 8 deletions
diff --git a/ssa.c b/ssa.c
index 632ebbe..9aff73c 100644
--- a/ssa.c
+++ b/ssa.c
@@ -40,7 +40,7 @@ filluse(Fn *fn)
 	Blk *b;
 	Phi *p;
 	Ins *i;
-	int m, t, w;
+	int m, t, tp, w;
 	uint a;
 	Tmp *tmp;
 
@@ -49,8 +49,8 @@ filluse(Fn *fn)
 	for (t=Tmp0; t<fn->ntmp; t++) {
 		tmp[t].ndef = 0;
 		tmp[t].nuse = 0;
-		tmp[t].phi = 0;
 		tmp[t].cls = 0;
+		tmp[t].phi = 0;
 		tmp[t].width = WFull;
 		if (tmp[t].use == 0)
 			tmp[t].use = vnew(0, sizeof(Use), Pfn);
@@ -58,16 +58,17 @@ filluse(Fn *fn)
 	for (b=fn->start; b; b=b->link) {
 		for (p=b->phi; p; p=p->link) {
 			assert(rtype(p->to) == RTmp);
-			t = p->to.val;
-			tmp[t].ndef++;
-			tmp[t].cls = p->cls;
-			tmp[t].phi = p->to.val;
+			tp = p->to.val;
+			tmp[tp].ndef++;
+			tmp[tp].cls = p->cls;
+			tp = phicls(tp, fn->tmp);
 			for (a=0; a<p->narg; a++)
 				if (rtype(p->arg[a]) == RTmp) {
 					t = p->arg[a].val;
 					adduse(&tmp[t], UPhi, b, p);
-					if (!tmp[t].phi)
-						tmp[t].phi = p->to.val;
+					t = phicls(t, fn->tmp);
+					if (t != tp)
+						tmp[t].phi = tp;
 				}
 		}
 		for (i=b->ins; i-b->ins < b->nins; i++) {