plonky2/evm/src/cpu/kernel/asm/util/basic_macros.asm
2022-10-03 14:07:21 -07:00

262 lines
4.4 KiB
NASM

%macro jump(dst)
PUSH $dst
jump
%endmacro
%macro jumpi(dst)
PUSH $dst
jumpi
%endmacro
%macro pop2
%rep 2
POP
%endrep
%endmacro
%macro pop3
%rep 3
POP
%endrep
%endmacro
%macro pop4
%rep 4
POP
%endrep
%endmacro
%macro pop5
%rep 5
POP
%endrep
%endmacro
%macro pop6
%rep 6
POP
%endrep
%endmacro
%macro pop7
%rep 7
POP
%endrep
%endmacro
%macro and_const(c)
// stack: input, ...
PUSH $c
AND
// stack: input & c, ...
%endmacro
%macro add_const(c)
// stack: input, ...
PUSH $c
ADD
// stack: input + c, ...
%endmacro
// Slightly inefficient as we need to swap the inputs.
// Consider avoiding this in performance-critical code.
%macro sub_const(c)
// stack: input, ...
PUSH $c
// stack: c, input, ...
SWAP1
// stack: input, c, ...
SUB
// stack: input - c, ...
%endmacro
%macro mul_const(c)
// stack: input, ...
PUSH $c
MUL
// stack: input * c, ...
%endmacro
// Slightly inefficient as we need to swap the inputs.
// Consider avoiding this in performance-critical code.
%macro div_const(c)
// stack: input, ...
PUSH $c
// stack: c, input, ...
SWAP1
// stack: input, c, ...
DIV
// stack: input / c, ...
%endmacro
// Slightly inefficient as we need to swap the inputs.
// Consider avoiding this in performance-critical code.
%macro mod_const(c)
// stack: input, ...
PUSH $c
// stack: c, input, ...
SWAP1
// stack: input, c, ...
MOD
// stack: input % c, ...
%endmacro
%macro shl_const(c)
// stack: input, ...
PUSH $c
SHL
// stack: input << c, ...
%endmacro
%macro shr_const(c)
// stack: input, ...
PUSH $c
SHR
// stack: input >> c, ...
%endmacro
%macro eq_const(c)
// stack: input, ...
PUSH $c
EQ
// stack: input == c, ...
%endmacro
%macro lt_const(c)
// stack: input, ...
PUSH $c
// stack: c, input, ...
GT // Check it backwards: (input < c) == (c > input)
// stack: input <= c, ...
%endmacro
%macro le_const(c)
// stack: input, ...
PUSH $c
// stack: c, input, ...
LT ISZERO // Check it backwards: (input <= c) == !(c < input)
// stack: input <= c, ...
%endmacro
%macro gt_const(c)
// stack: input, ...
PUSH $c
// stack: c, input, ...
LT // Check it backwards: (input > c) == (c < input)
// stack: input >= c, ...
%endmacro
%macro ge_const(c)
// stack: input, ...
PUSH $c
// stack: c, input, ...
GT ISZERO // Check it backwards: (input >= c) == !(c > input)
// stack: input >= c, ...
%endmacro
%macro consume_gas_const(c)
PUSH $c
CONSUME_GAS
%endmacro
// If pred is zero, yields z; otherwise, yields nz
%macro select
// stack: pred, nz, z
ISZERO
// stack: pred == 0, nz, z
DUP1
// stack: pred == 0, pred == 0, nz, z
ISZERO
// stack: pred != 0, pred == 0, nz, z
SWAP3
// stack: z, pred == 0, nz, pred != 0
MUL
// stack: (pred == 0) * z, nz, pred != 0
SWAP2
// stack: pred != 0, nz, (pred == 0) * z
MUL
// stack: (pred != 0) * nz, (pred == 0) * z
ADD
// stack: (pred != 0) * nz + (pred == 0) * z
%endmacro
// If pred, yields z; otherwise, yields nz
// Assumes pred is boolean (either 0 or 1).
%macro select_bool
// stack: pred, nz, z
DUP1
// stack: pred, pred, nz, z
ISZERO
// stack: notpred, pred, nz, z
SWAP3
// stack: z, pred, nz, notpred
MUL
// stack: pred * z, nz, notpred
SWAP2
// stack: notpred, nz, pred * z
MUL
// stack: notpred * nz, pred * z
ADD
// stack: notpred * nz + pred * z
%endmacro
%macro square
// stack: x
DUP1
// stack: x, x
MUL
// stack: x^2
%endmacro
%macro min
// stack: x, y
DUP2
DUP2
// stack: x, y, x, y
LT
// stack: x < y, x, y
%select_bool
// stack: min
%endmacro
%macro max
// stack: x, y
DUP2
DUP2
// stack: x, y, x, y
GT
// stack: x > y, x, y
%select_bool
// stack: max
%endmacro
%macro increment
%add_const(1)
%endmacro
%macro decrement
%sub_const(1)
%endmacro
%macro div2
%div_const(2)
%endmacro
%macro iseven
%mod_const(2)
ISZERO
%endmacro
%macro as_u32
%and_const(0xFFFFFFFF)
%endmacro
// u32 addition (discarding 2^32 bit)
%macro add_u32
// stack: x, y
ADD
// stack: x + y
%as_u32
// stack: (x + y) & u32::MAX
%endmacro