Re: Frequency of integer division in source code?

        meissner@osf.org writes:
        >[re division used for constant modulus in hash table, which can be
        > implemented by multiplying]


        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.


Powers-of-2 are, of course, the underlying principle of most hardware
cache and TLB lookups.


But they have this annoying property: seems many people like
allocating objects on, say, 64K or 1M boundaries...
--
Andy "Krazy" Glew, glew@ichips.intel.com, Intel,
M/S JF1-19, 5200 NE Elam Young Pkwy, Hillsboro, Oregon 97124-6497.
Place URGENT in email subject line for mail filter prioritization.
--

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