X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Fada%2Fs-arit64.adb;h=d91e08d462f755ea7ea1db104ef407669c7a329f;hb=ca5ca69c0dd2b9050c3fecda668841e150e7718e;hp=418c9b2d6c360ce166913a924f533bdaa0c30a6a;hpb=f27cea3abf8ded22456f5f46a812cc3915969815;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/ada/s-arit64.adb b/gcc/ada/s-arit64.adb index 418c9b2d6c3..d91e08d462f 100644 --- a/gcc/ada/s-arit64.adb +++ b/gcc/ada/s-arit64.adb @@ -6,7 +6,7 @@ -- -- -- B o d y -- -- -- --- Copyright (C) 1992-2004 Free Software Foundation, Inc. -- +-- Copyright (C) 1992-2006, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- @@ -83,7 +83,7 @@ package body System.Arith_64 is pragma Inline (Hi); -- High order half of 64-bit value - procedure Sub3 (X1, X2, X3 : in out Uns32; Y1, Y2, Y3 : in Uns32); + procedure Sub3 (X1, X2, X3 : in out Uns32; Y1, Y2, Y3 : Uns32); -- Computes X1&X2&X3 := X1&X2&X3 - Y1&Y1&Y3 with mod 2**96 wrap function To_Neg_Int (A : Uns64) return Int64; @@ -542,7 +542,7 @@ package body System.Arith_64 is D (3) := Lo (T2) or Hi (T3); D (4) := Lo (T3); - -- Loop to compute quotient digits, runs twice for Qd(1) and Qd(2). + -- Loop to compute quotient digits, runs twice for Qd(1) and Qd(2) for J in 0 .. 1 loop @@ -630,7 +630,7 @@ package body System.Arith_64 is -- Sub3 -- ---------- - procedure Sub3 (X1, X2, X3 : in out Uns32; Y1, Y2, Y3 : in Uns32) is + procedure Sub3 (X1, X2, X3 : in out Uns32; Y1, Y2, Y3 : Uns32) is begin if Y3 > X3 then if X2 = 0 then