From: Robert Dewar <robert_dewar@my-deja.com>
Subject: Re: 32 bit integer multiply routine
Date: 1999/10/18
Date: 1999-10-18T00:00:00+00:00 [thread overview]
Message-ID: <7udut1$n3b$1@nnrp1.deja.com> (raw)
In-Reply-To: 38025D76.37AD9D5A@collins.rockwellDOTcom
In article <38025D76.37AD9D5A@collins.rockwellDOTcom>,
jeanne <jledward@collins.rockwellDOTcom> wrote:
> I am trying to write a low level 32 bit integer multiply
routine. I
> would entertain any suggestions. Because 32 bits is the
largest system
> integer type, I need a way to deal with the overflow. If
there is any
> canned routines or algorithms available I would appreciate you
pointing
> me to the right place. Thanks in advance for your help.
>
> Jeanne
Just look at the s-arit64.ads/adb package in GNAT used for
64-bit multiplication with overflow detection, This should
be trivial to adapt for your purpose (the adaptation will
be covered by the GMGPL, but that should not cause you any
difficulties in usage).
Sent via Deja.com http://www.deja.com/
Before you buy.
prev parent reply other threads:[~1999-10-18 0:00 UTC|newest]
Thread overview: 3+ messages / expand[flat|nested] mbox.gz Atom feed top
[not found] <38025D76.37AD9D5A@collins.rockwellDOTcom>
1999-10-12 0:00 ` 32 bit integer multiply routine Florian Weimer
1999-10-12 0:00 ` Lutz Donnerhacke
1999-10-18 0:00 ` Robert Dewar [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox