4.11 Arithmetic Instructions

Remove two elements S0 and S1 and push their sum: S1+S0.

Remove two elements S0 and S1, perform a bitwise AND on them and push the result: S1 & S0.

Invert each bit of the top element: ~S0.

Remove two elements S0 and S1, perform a bitwise OR on them and push the result: S1 | S0.

Remove two elements S0 and S1, shift the bits of S1 to the left by S0 positions and push the result: S1 << S0.

Remove two elements S0 and S1, shift the bits of S1 to the right by S0 positions and push the result: S1 >> S0.

Remove two elements S0 and S1, perform a bitwise XOR on them and push the result: S1 ^ S0.

Remove two elements S0 and S1, compute the (signed) integer part of their quotient and push it: S1 / S0. If S0=0, signal a fatal error and halt.

Add the value N to the memory cell located at the address A. This is exactly the same as

LDG A NUM N ADD SAVG A

but more efficient.

Add the value N to the memory cell whose absolute address is SELF + M*BPW. INCI M N is equal to

LDI M NUM N ADD SAVI M

but more efficient.

Add the value N to the memory cell whose absolute address is FP - M*BPW. INCL M N is equal to

LDL M NUM N ADD SAVL M

but more efficient.

If the top element is equal to zero, replace it with -1 and otherwise with zero: S0=0-> -1: 0.

Remove two elements S0 and S1, compute their division remainder and push it: S1 MOD S0. S1 MOD S0 is defined as S1 - S1./S0.*S0 where './' denotes an unsigned integer division and '.*' an unsigned multiplication. If S0=0, signal a fatal error and halt.

Remove two elements S0 and S1, compute their (signed) product and push it: S1 * S0. Do not perform any overflow checking.

Negate the top element: -S0.

Rest for a cycle.

Remove two elements S0 and S1 and push their difference: S1-S0.

Remove two elements S0 and S1, compute the unsigned integer part of their quotient and push it: .S1 / .S0. If S0=0, signal a fatal error and halt.

Remove two elements S0 and S1, compute their unsigned product and push it: .S1 * .S0. Do not perform any overflow checking.