Make MIR-code analogous to C code.
@@ -9,22 +9,20 @@ sieve: func i64\n\
local i64:iter, i64:count, i64:i, i64:k, i64:prime, i64:flags\n\
alloca flags, 819000\n\
mov iter, 0\n\
-loop: bge fin, iter, 100\n\
+loop: bge fin, iter, 1000\n\
mov count, 0; mov i, 0\n\
-loop2: bge fin2, i, 819000\n\
- mov u8:(flags, i), 1; add i, i, 1\n\
- jmp loop2\n\
-fin2: mov i, 1\n\
-loop3: bge fin3, i, 819000\n\
- beq cont3, u8:(flags,i), 0\n\
+loop2: mov u8:(flags, i), 1; add i, i, 1\n\
+ blt loop2, i, 819000\n\
+ mov i, 2\n\
+loop3: beq cont3, u8:(flags,i), 0\n\
add prime, i, 1; add k, i, prime\n\
loop4: bge fin4, k, 819000\n\
mov u8:(flags, k), 0; add k, k, prime\n\
jmp loop4\n\
fin4: add count, count, 1\n\
cont3: add i, i, 1\n\
- jmp loop3\n\
-fin3: add iter, iter, 1\n\
+ blt loop3, i, 819000\n\
+ add iter, iter, 1\n\
jmp loop\n\
fin: ret count\n\
endfunc\n\
