1 ------------------------------------------------------------------------------
3 -- GNAT RUNTIME COMPONENTS --
5 -- S Y S T E M . E X P _ U N S --
9 -- $Revision: 1.10 $ --
11 -- Copyright (C) 1992-1997 Free Software Foundation, Inc. --
13 -- GNAT is free software; you can redistribute it and/or modify it under --
14 -- terms of the GNU General Public License as published by the Free Soft- --
15 -- ware Foundation; either version 2, or (at your option) any later ver- --
16 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
17 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
18 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
19 -- for more details. You should have received a copy of the GNU General --
20 -- Public License distributed with GNAT; see file COPYING. If not, write --
21 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
22 -- MA 02111-1307, USA. --
24 -- As a special exception, if other files instantiate generics from this --
25 -- unit, or you link this unit with other files to produce an executable, --
26 -- this unit does not by itself cause the resulting executable to be --
27 -- covered by the GNU General Public License. This exception does not --
28 -- however invalidate any other reasons why the executable file might be --
29 -- covered by the GNU Public License. --
31 -- GNAT was originally developed by the GNAT team at New York University. --
32 -- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
34 ------------------------------------------------------------------------------
36 with System
.Unsigned_Types
; use System
.Unsigned_Types
;
38 package body System
.Exp_Uns
is
49 Result
: Unsigned
:= 1;
50 Factor
: Unsigned
:= Left
;
51 Exp
: Natural := Right
;
54 -- We use the standard logarithmic approach, Exp gets shifted right
55 -- testing successive low order bits and Factor is the value of the
56 -- base raised to the next power of 2.
58 -- Note: it is not worth special casing the cases of base values -1,0,+1
59 -- since the expander does this when the base is a literal, and other
60 -- cases will be extremely rare.
64 if Exp
rem 2 /= 0 then
65 Result
:= Result
* Factor
;
70 Factor
:= Factor
* Factor
;