Mailing-List: contact dev-help@apr.apache.org; run by ezmlm
Precedence: bulk
Message-Id: <5.1.0.14.2.20020711095836.00a8fe40@mail.charter.net>
Date: Thu, 11 Jul 2002 10:01:40 -0400
To: dev@apr.apache.org
From: Greg Marr <gregm@alum.wpi.edu>
Subject: Re: [PATCH 2] example binary BUSEC patch for benchmarking only
In-Reply-To: <5.1.0.14.2.20020711003245.04208bb0@pop3.rowe-clan.net>
References: <5.1.0.14.2.20020710223323.0467b258@pop3.rowe-clan.net>
 <3D2CF59F.5050707@apache.org>
 <JHEPKCEMGPKFFDHHDDKDAEJPELAA.bill@wstoddard.com>
Mime-Version: 1.0
Content-Type: text/plain; charset="us-ascii"; format=flowed

At 01:33 AM 07/11/2002, William A. Rowe, Jr. wrote:
>Ok, attached is the code redone as binary math.  I'm tired, could be 
>any number of major blunders in it, but on first pass, it looked right.
>
>-/** number of microseconds per second */
>-#define APR_USEC_PER_SEC APR_TIME_C(1000000)
>+/** number of binary microseconds per second (2^20) */
>+#define APR_USEC_PER_SEC APR_TIME_C(1048576)
>+#define APR_USEC_BITS 20

I keep thinking that APR_USEC_PER_SEC should be (1 << 20), or now
(1 << APR_USEC_BITS) instead of the magical constant.  I have no way 
of verifying with a quick glance that 1048576 is really 2^20.

-- 
Greg Marr
gregm@alum.wpi.edu
"We thought you were dead."
"I was, but I'm better now." - Sheridan, "The Summoning"