------------------------------------------------------------------------------
-- --
--- GNU ADA RUNTIME LIBRARY (GNARL) COMPONENTS --
+-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . B I T _ O P S --
-- --
-- B o d y --
-- --
--- Copyright (C) 1996-2000 Free Software Foundation, Inc. --
+-- Copyright (C) 1996-2009, 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- --
--- ware Foundation; either version 2, or (at your option) any later ver- --
+-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
--- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
--- for more details. You should have received a copy of the GNU General --
--- Public License distributed with GNAT; see file COPYING. If not, write --
--- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
--- MA 02111-1307, USA. --
+-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
--- As a special exception, if other files instantiate generics from this --
--- unit, or you link this unit with other files to produce an executable, --
--- this unit does not by itself cause the resulting executable to be --
--- covered by the GNU General Public License. This exception does not --
--- however invalidate any other reasons why the executable file might be --
--- covered by the GNU Public License. --
+-- As a special exception under Section 7 of GPL version 3, you are granted --
+-- additional permissions described in the GCC Runtime Library Exception, --
+-- version 3.1, as published by the Free Software Foundation. --
+-- --
+-- You should have received a copy of the GNU General Public License and --
+-- a copy of the GCC Runtime Library Exception along with this program; --
+-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
+-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-with GNAT.Exceptions; use GNAT.Exceptions;
-with System; use System;
-with System.Unsigned_Types; use System.Unsigned_Types;
-with Unchecked_Conversion;
+pragma Compiler_Unit;
+
+with System; use System;
+with System.Unsigned_Types; use System.Unsigned_Types;
+
+with Ada.Unchecked_Conversion;
package body System.Bit_Ops is
subtype Bits_Array is System.Unsigned_Types.Packed_Bytes1 (Positive);
- -- Unconstrained array used to interprete the address values. We use the
+ -- Dummy array type used to interpret the address values. We use the
-- unaligned version always, since this will handle both the aligned and
-- unaligned cases, and we always do these operations by bytes anyway.
-- Note: we use a ones origin array here so that the computations of the
-- length in bytes work correctly (give a non-negative value) for the
- -- case of zero length bit strings).
+ -- case of zero length bit strings). Note that we never allocate any
+ -- objects of this type (we can't because they would be absurdly big).
type Bits is access Bits_Array;
-- This is the actual type into which address values are converted
- function To_Bits is new Unchecked_Conversion (Address, Bits);
+ function To_Bits is new Ada.Unchecked_Conversion (Address, Bits);
LE : constant := Standard'Default_Bit_Order;
-- Static constant set to 0 for big-endian, 1 for little-endian
(1 - LE) * 2#1111_1100# + LE * 2#0011_1111#,
(1 - LE) * 2#1111_1110# + LE * 2#0111_1111#);
-
-----------------------
-- Local Subprograms --
-----------------------
(Left : Address;
Llen : Natural;
Right : Address;
- Rlen : Natural)
- return Boolean
+ Rlen : Natural) return Boolean
is
LeftB : constant Bits := To_Bits (Left);
RightB : constant Bits := To_Bits (Right);
Bitc : constant Natural := Llen mod 8;
begin
- if Llen /= Rlen then
- return False;
-
- elsif LeftB (1 .. BLen) /= RightB (1 .. BLen) then
+ if LeftB (1 .. BLen) /= RightB (1 .. BLen) then
return False;
elsif Bitc /= 0 then
procedure Raise_Error is
begin
- Raise_Exception (CE, "unequal lengths in logical operation");
+ raise Constraint_Error;
end Raise_Error;
end System.Bit_Ops;