Browse code

[2SF] Update from asmjit.

Naram Qashat authored on 2014/09/28 00:12:43
Showing 1 changed files
... ...
@@ -126,9 +126,12 @@ struct ConstPoolTree {
126 126
       if (link) {
127 127
         ASMJIT_ASSERT(top != kHeightLimit);
128 128
         stack[top++] = node;
129
+
130
+        node = link;
129 131
         continue;
130 132
       }
131 133
 
134
+_Visit:
132 135
       visitor.visit(node);
133 136
       link = node->_link[1];
134 137
 
... ...
@@ -141,6 +144,7 @@ struct ConstPoolTree {
141 144
         break;
142 145
 
143 146
       node = stack[--top];
147
+      goto _Visit;
144 148
     }
145 149
   }
146 150