simple optimization to allow more registerization inside loops

1 files changed, 25 insertions, 25 deletions

diff --git a/tools/test-js-optimizer-regs-output.js b/tools/test-js-optimizer-regs-output.js
index f038a11c..3a0db393 100644
--- a/tools/test-js-optimizer-regs-output.js
+++ b/tools/test-js-optimizer-regs-output.js
@@ -1,8 +1,8 @@
 function test() {
-  var r1, r2, r3;
+  var r1, r2;
   r1 = 0;
   f(r1);
-  r1++;
+  r1 += 1;
   r2 = r1 + 2;
   g(r1, r2);
   f(r1);
@@ -18,47 +18,47 @@ function test() {
     r2 = 5;
     r1 = 12;
     gg(r2, r1 * 2);
-    r3 = 100;
-    gg(r3, 20);
+    r1 = 100;
+    gg(r1, 20);
   }
-  r3 = f(), r1 = 100, r1 = 1e3, r1 = 1e5;
-  f(r3());
+  r1 = f(), r2 = 100, r2 = 1e3, r2 = 1e5;
+  f(r1());
 }
 function primes() {
-  var r1, r2, r3, r4, r5, r6, r7, r8, r9, r10, r11, r12, r13, r14;
+  var r1, r2, r3, r4, r5, r6;
   r1 = 2;
   r2 = 0;
   $_$2 : while (1) {
     r3 = r1 | 0;
     r4 = _sqrtf(r3);
-    r5 = 2;
+    r3 = 2;
     $_$4 : while (1) {
-      r6 = r5 | 0;
-      r7 = r6 < r4;
-      if (!r7) {
-        r8 = 1;
+      r5 = r3 | 0;
+      r6 = r5 < r4;
+      if (!r6) {
+        r6 = 1;
         break $_$4;
       }
-      r9 = (r1 | 0) % (r5 | 0);
-      r10 = (r9 | 0) == 0;
-      if (r10) {
-        r8 = 0;
+      r4 = (r1 | 0) % (r3 | 0);
+      r5 = (r4 | 0) == 0;
+      if (r5) {
+        r6 = 0;
         break $_$4;
       }
-      r11 = r5 + 1 | 0;
-      r5 = r11;
+      r5 = r3 + 1 | 0;
+      r3 = r5;
     }
-    r12 = r8 + r2 | 0;
-    r13 = r1 + 1 | 0;
-    r14 = (r12 | 0) < 1e5;
-    if (r14) {
-      r1 = r13;
-      r2 = r12;
+    r5 = r6 + r2 | 0;
+    r3 = r1 + 1 | 0;
+    r4 = (r5 | 0) < 1e5;
+    if (r4) {
+      r1 = r3;
+      r2 = r5;
     } else {
       break $_$2;
     }
   }
-  r12 = _printf(STRING_TABLE.__str | 0, (tempInt = STACKTOP, STACKTOP += 4, HEAP32[tempInt >> 2] = r1, tempInt));
+  r6 = _printf(STRING_TABLE.__str | 0, (tempInt = STACKTOP, STACKTOP += 4, HEAP32[tempInt >> 2] = r1, tempInt));
   return 1;
   return null;
 }