Fix assembly example

This commit is contained in:
Josef Pospíšil 2020-11-04 10:16:02 +01:00
parent 2891d2b260
commit e33e182eb0
1 changed files with 16 additions and 17 deletions

View File

@ -1,23 +1,22 @@
# Example of dst bytecode assembly # Example of dst bytecode assembly
# Fibonacci sequence, implemented with naive recursion. # Fibonacci sequence, implemented with naive recursion.
(def fibasm (asm '{ (def fibasm
arity 1 (asm
bytecode [ '{:arity 1
(ltim 1 0 0x2) # $1 = $0 < 2 :bytecode @[(ltim 1 0 0x2) # $1 = $0 < 2
(jmpif 1 :done) # if ($1) goto :done (jmpif 1 :done) # if ($1) goto :done
(lds 1) # $1 = self (lds 1) # $1 = self
(addim 0 0 -0x1) # $0 = $0 - 1 (addim 0 0 -0x1) # $0 = $0 - 1
(push 0) # push($0), push argument for next function call (push 0) # push($0), push argument for next function call
(call 2 1) # $2 = call($1) (call 2 1) # $2 = call($1)
(addim 0 0 -0x1) # $0 = $0 - 1 (addim 0 0 -0x1) # $0 = $0 - 1
(push 0) # push($0) (push 0) # push($0)
(call 0 1) # $0 = call($1) (call 0 1) # $0 = call($1)
(add 0 0 2) # $0 = $0 + $2 (integers) (add 0 0 2) # $0 = $0 + $2 (integers)
:done :done
(ret 0) # return $0 (ret 0) # return $0
] ]}))
}))
# Test it # Test it