NetBSD master CVS tree commits

[The Source of All Evil <source>]

cgd
Wed Jun 12 00:15:37 EDT 1996
Update of /a/cvsroot/src/lib/libc/gmon
In directory pain.lcs.mit.edu:/a/tmp/cvs-serv15119

Modified Files:
        gmon.c mcount.c 
Log Message:
use p->hashfraction when doing non-time-critical calculations, rather than
using HASHFRACTION directly.  in time-critical calculations, if HASHFRACTION
is a power of two, check that p->hashfraction == HASHFRACTION and if so do
the calculation with the compiled-in value so that the compiler can optimize
out (potentially) expensive divisions.  if p->hashfraction != HASHFRACTION,
actually do the division.  This has the result that on machines with slow
division, the division can be optimized out of the common case, but that
if HASHFRACTION changes from the compiled-in value (for whatever reason),
profiling will still work.  Changes suggested by Chris Torek.


cgd
Wed Jun 12 00:16:54 EDT 1996
Update of /a/cvsroot/src/sys/lib/libkern
In directory pain.lcs.mit.edu:/a/tmp/cvs-serv15177

Modified Files:
        mcount.c 
Log Message:
copy down from libkern:
>use p->hashfraction when doing non-time-critical calculations, rather than
>using HASHFRACTION directly.  in time-critical calculations, if HASHFRACTION
>is a power of two, check that p->hashfraction == HASHFRACTION and if so do
>the calculation with the compiled-in value so that the compiler can optimize
>out (potentially) expensive divisions.  if p->hashfraction != HASHFRACTION,
>actually do the division.  This has the result that on machines with slow
>division, the division can be optimized out of the common case, but that
>if HASHFRACTION changes from the compiled-in value (for whatever reason),
>profiling will still work.  Changes suggested by Chris Torek.