Re: Stack vs stackless operation

On 25/02/2025 6:04 pm, LIT wrote:

: +> ( addr1 addr2 addr3 -- )
 rot @ rot @ + swap ! ;
>
Of course the above is just an illustration; I mean coding
such word directly in ML. It should be significantly
faster than going through stack usual way.

>
A set of three addresses on the stack is messy even before
one does anything with them.

 
Yep, but I meant the case of, for example:
 
var1 @ var2 @ + var3 !
 
The above isn't messy at all.
 
So IMHO by using such OOS (out-of-stack) operation - coded
directly in ML - we can replace the above by:
 
var1 var2 var3 +>
 
...
In case of slower ITC non-optimizing Forths - like
fig-Forth, as the most obvious example - the "boost"
may be noticeable.
I'll check that.

code +> ( x y z -- )
  dx pop  cx pop  bx pop  0 [bx] ax mov  cx bx xchg
  0 [bx] ax add  dx bx xchg  ax 0 [bx] mov  next
end-code

Timing (adjusted for loop time):

 var1 @ var2 @ + var3 !   8019 mS
 var1 var2 var3 +>        5657 mS