Re: Frequency of integer division in source code?

bazyar@netcom.com (Jawaid Bazyar)
Thu, 10 Feb 1994 00:45:18 GMT

          From comp.compilers
Related articles
Frequency of integer division in source code? Peter-Lawrence.Montgomery@cwi.nl (1994-02-07)
Re: Frequency of integer division in source code? hbaker@netcom.com (1994-02-08)
Re: Frequency of integer division in source code? meissner@osf.org (1994-02-09)
Re: Frequency of integer division in source code? tfj@apusapus.demon.co.uk (1994-02-10)
Re: Frequency of integer division in source code? glew@ichips.intel.com (1994-02-11)
Re: Frequency of integer division in source code? bazyar@netcom.com (1994-02-10)
Re: Frequency of integer division in source code? cliffc@dawn.cs.rice.edu (1994-02-14)
Re: Frequency of integer division in source code? chase@Think.COM (1994-02-15)
Re: Frequency of integer division in source code? pardo@cs.washington.edu (1994-02-17)
| List of all articles for this month |
Newsgroups: comp.compilers
From: bazyar@netcom.com (Jawaid Bazyar)
Keywords: architecture, optimize
Organization: NETCOM On-line Communication Services (408 241-9760 guest)
References: 94-02-058 94-02-070
Date: Thu, 10 Feb 1994 00:45:18 GMT

tfj@apusapus.demon.co.uk (Trevor Jenkins) writes:


>Better yet is not to be mis-lead by Maurer's paper and to ignore his
>advice by using a table whose size is a power of two. Then the integer
>divide becomes an AND operation which is faster that division or
>multiplication on almost all architectures.


>The ``theory'' of using powers of two is explained in various papers by
>Hopgood et all from the late-60/early-70s.


    The "practice" is used in the lcc compiler, quite effectively. (lcc's
hash tables use power-of-two "primes").


--
  Jawaid Bazyar
  Procyon, Inc.
  P.O Box 620334
  Littleton, CO 80162-0334 (303) 781-3273
  bazyar@cs.uiuc.edu
--

Post a followup to this message

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