Hi, the f* routine (my template based) works now (a bug - I did not care on R0,1 - where MULT puts results..), so Marcin may redo it into amforth look, when required.
> : test_mul_asm timer-start 30000 0 do _pi _ln2 f* drop drop loop oktimer-stop 30000 s>f f/ fs. ." sec per mul-asm operation" ; ok > test_mul_asm 4.5088768E-5 sec per mul-asm operation ok > _pi _pi f* fs. 9.869605 ok > _1e9 _1e-12 _pi f* f* fs. 3.1415927E-3 ok > So f* is much faster as the previous one (f* in forth 5ms). As you may see the most of the time has been consumed by "_pi _ln2 f* drop drop" overhead comparable to f* duration (my estimation is: f* raw 8us, f/ raw 30us). Still thinking how to precisely measure duration of such forth words in the do loop.. And the fs. speed is now tremendous.. I like amforth! Pito. ------------------------------------------------------------------------------ Start uncovering the many advantages of virtual appliances and start using them to simplify application deployment and accelerate your shift to cloud computing. http://p.sf.net/sfu/novell-sfdev2dev _______________________________________________ Amforth-devel mailing list Amforth-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/amforth-devel
