[<<][staapl][>>][..]Thu Dec 13 14:34:51 CET 2007
* size or speed? in the end it should run on CATkit, which has little
flash memory, so i should really go for size.
* FOR..NEXT is not standard, so i can just make something up?
can't get for..next going.. debugging return stack stuff is
hard. wanted to have a quiet simple puzzle day, but it requires 'real
about size vs speed. the primitives need to be fast, so they can be
used in STC code with the VM eliminated, but the VM needs to be
SIMPLE. the return stack really should contain the same stuff as can
be found in straight line code.
i'm going to eliminate some macros. hmm.. too much thinking because
it's already too much optimized.. i find it difficult to throw this
kind of stuff away.
what to optimize:
* inner interpreter loop
* maybe math primitives (used elsewhere)
not so important:
* enter/leave + RS (once per highlevel word)