Re: [cc65] looking for very fast integer mult and div 6502 asm code

From: Groepaz <groepaz1gmx.net>
Date: 2012-05-26 17:03:19
On Saturday 26 May 2012, you wrote:
> On Sat, May 26, 2012 at 1:27 AM, Egan Ford <egan@sense.net> wrote:
> > I've googled quite a bit and found some code.  Mostly mult.  But I
> > thought I'd also ask here just in case someone has something in their
> > back pocket.  I also have my own ideas, but wanted to avoid
> > reinventing the wheel so to speak.  Table methods are preferred if
> > they provide measurable speed up.  However tables should be limited to
> > about 1K or 2K of memory.
> 
> You probably already found this, but here goes:
> 
> http://codebase64.org/doku.php?id=base:seriously_fast_multiplication
> 
> It doesn't really get faster than this.

yes, thats pretty much the defacto standard fast mul =)

the nice thing about it is that you can mungle an additional operation into 
the lookup table (so you can eg do mul, then shift for fixedpoint arithmetics)
----------------------------------------------------------------------
To unsubscribe from the list send mail to majordomo@musoftware.de with
the string "unsubscribe cc65" in the body(!) of the mail.
Received on Sat May 26 17:03:18 2012

This archive was generated by hypermail 2.1.8 : 2012-05-26 17:03:22 CEST