Re: Large Integer Overflow - Causing a Bottleneck - Any solution.

[Dennis Lee Bieber <wlfraed@ix.netcom.com>]

On Tue, 2 May 2017 07:48:17 -0700 (PDT), Austin Obyrne
<austin.obyrne@hotmail.com> 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/