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.9 required=5.0 tests=BAYES_00 autolearn=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!news.glorb.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!buffer1.nntp.dca1.giganews.com!buffer2.nntp.dca1.giganews.com!nntp.earthlink.com!news.earthlink.com.POSTED!not-for-mail NNTP-Posting-Date: Thu, 04 May 2017 16:49:22 -0500 From: Dennis Lee Bieber Newsgroups: comp.lang.ada Subject: Re: Large Integer Overflow - Causing a Bottleneck - Any solution. Date: Thu, 04 May 2017 17:49:21 -0400 Organization: IISS Elusive Unicorn Message-ID: <858ngc9mg30b1ec36joah1m6o8j4t73go5@4ax.com> References: <45c389ad-5b2c-4f6a-9003-8a64d41d9ddc@googlegroups.com> User-Agent: ForteAgent/8.00.32.1272 X-No-Archive: YES MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Usenet-Provider: http://www.giganews.com NNTP-Posting-Host: 108.73.116.101 X-Trace: sv3-e0u+Nn01g0KDPuCY0SDP+ZNNsuXMKj2xGad+2HUCBOOJtmdc+6Y9FaJETDTnUIMvTlxtpFYkD5iH0rJ!eH9U1rIktoCH+43HF4A1AawN0Knza7ZQLDmcqSuOTYmhnN//IQRIyswLX5AMURP4/pgRI5Wo1x9g!KD4kYiYvPWWLjyCp+feaCdJNuPm2 X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly X-Postfilter: 1.3.40 X-Original-Bytes: 2259 X-Received-Bytes: 2381 X-Received-Body-CRC: 2992342393 Xref: news.eternal-september.org comp.lang.ada:46670 Date: 2017-05-04T17:49:21-04:00 List-Id: On Tue, 2 May 2017 07:48:17 -0700 (PDT), Austin Obyrne declaimed the following: >I am using a very old Ada compiler (gnat 311.p) in the Windows_7 operating system that has 64-bit architecture to write cryptography. > Frith preserve us... The last unencumbered AdaCore release was GNAT 3.15p, and even that is 20+ years old by now. >Everything has gone well thus far but now I find I am being stymied from expanding my cipher by the upper bound placed by my Ada compiler on positive integers to 2^31 -1 or 2147483647 for positive integers. > >Is there any solution to this that won't want me to leave the main program in order to do it. > Write (implement) your own math package using a split record for 64-bit integers... type Long_Int is record Upper : integer; Lower : integer; end record; function "+" (left : Long_Int, right : Long_int) return Long_Int; ... Don't forget to provide methods to convert regular integers to your new ones... -- Wulfraed Dennis Lee Bieber AF6VN wlfraed@ix.netcom.com HTTP://wlfraed.home.netcom.com/