Not a proposal, not an issue, just a way to show a different ISA which tries to use as much as possible all the field bits of an instruction. This ISA is not complete (no comparison instruction, no jump, missing stack alu, and so one).
- ARM instruction inspiration as combining arithmetic and constant bit shifting in one instruction,
- some look complex but they are indeed simple once you understand the underlying logic.
- fix-point computation can be feasible in easier way and less instructions.
- direct access to pushed arguments of a call or local variables.
Regarding stack operations, some ALU operations is missing (reserving/releasing N word in stack).
Now the example:
