mu/406int32.mu
Kartik Agaram 6f65b65f7d 7290
I've wrestled for a long time with how to support integer division with
its hard-coded registers. The answer's always been staring me in the face:
just turn it into a function! We already expect function outputs to go
to hard-coded registers.
2020-11-27 21:37:20 -08:00

40 lines
739 B
Forth

# Some slow but convenient helpers
# slow, iterative shift-left instruction
# preconditions: _nr >= 0, _dr > 0
fn repeated-shift-left nr: int, dr: int -> _/eax: int {
var result/eax: int <- copy nr
{
compare dr, 0
break-if-<=
result <- shift-left 1
decrement dr
loop
}
return result
}
# slow, iterative shift-right instruction
# preconditions: _nr >= 0, _dr > 0
fn repeated-shift-right nr: int, dr: int -> _/eax: int {
var result/eax: int <- copy nr
{
compare dr, 0
break-if-<=
result <- shift-right 1
decrement dr
loop
}
return result
}
fn abs n: int -> _/eax: int {
var result/eax: int <- copy n
{
compare n, 0
break-if->=
result <- negate
}
return result
}