From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: *
X-Spam-Status: No, score=1.3 required=5.0 tests=BAYES_00,INVALID_MSGID,
	MSGID_RANDY autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,9507ab9875dc1d6a
X-Google-Attributes: gid103376,public
From: Robert Dewar <robert_dewar@my-deja.com>
Subject: Re: 32 bit integer multiply routine
Date: 1999/10/18
Message-ID: <7udut1$n3b$1@nnrp1.deja.com>#1/1
X-Deja-AN: 537271336
References: <38025D76.37AD9D5A@collins.rockwellDOTcom>
X-Http-Proxy: 1.0 x23.deja.com:80 (Squid/1.1.22) for client 205.232.38.14
Organization: Deja.com - Before you buy.
X-Article-Creation-Date: Mon Oct 18 01:59:00 1999 GMT
X-MyDeja-Info: XMYDJUIDrobert_dewar
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.04 [en] (OS/2; I)
Date: 1999-10-18T00:00:00+00:00
List-Id: <comp.lang.ada>

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.