From e5eeded8449f55c64f6508b30fecf71b7160a953 Mon Sep 17 00:00:00 2001
From: Teddy <ted.sybil@gmail.com>
Date: Sun, 4 May 2014 22:01:38 +0800
Subject: ...

---
 ssa.c | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

(limited to 'ssa.c')

diff --git a/ssa.c b/ssa.c
index 16fa5ed..2df04be 100644
--- a/ssa.c
+++ b/ssa.c
@@ -1942,10 +1942,13 @@ const int avail_regs[] = {8, 9, 10, 11, 12, 13, 14, 15, 24, 25};
 const int MAX_AVAIL_REGS = sizeof(avail_regs) / sizeof(avail_regs[0]);
 
 void register_alloc() {
+    /* Algorithm from the paper:
+     * Linear Scan Register Allocation
+     * in the Context of SSA Form and Register Constraints */
     static int freg[32], f[32];
     int dn = 0, i;
-    COList_t p;
     COpr_t *unhandled;
+    COList_t p;
     COList_t active = NEW(COList),
              inactive = NEW(COList);
     active->next = active->prev = active;
-- 
cgit v1.2.3