Any references for efficient division code sequences?

Shankar Unni <shankar@webnexus.com>
28 Jun 2001 23:34:34 -0400

          From comp.compilers
Related articles
Any references for efficient division code sequences? shankar@webnexus.com (Shankar Unni) (2001-06-28)
Re: Any references for efficient division code sequences? torbenm@diku.dk (2001-07-02)
Re: Any references for efficient division code sequences? rv3s@cobra.cs.virginia.edu (Raja Venkateswaran) (2001-07-02)
Re: Any references for efficient division code sequences? David.Chase@naturalbridge.com (David Chase) (2001-07-03)
Re: Any references for efficient division code sequences? kadiyala@home.com (Suresh Kadiyala) (2001-07-17)
| List of all articles for this month |
From: Shankar Unni <shankar@webnexus.com>
Newsgroups: comp.compilers
Date: 28 Jun 2001 23:34:34 -0400
Organization: Posted via Supernews, http://www.supernews.com
Keywords: arithmetic, question
Posted-Date: 28 Jun 2001 23:34:34 EDT

Specifically for dividing by small constants (< 16). We're working on a
small MIPS-like network processor that has no MUL/DIV unit, and need to
be able to do a *fast* mod by small numbers.


Are there any references that discuss code sequences for dividing (or
specifically in our case, remaindering) integers by small constants (for
any processor that doesn't have a MUL/DIV unit)?


Thanks,
--
Shankar Unni
shankar@webnexus.com

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.