------------------------------------------------------------------------------
-- --
--- GNU ADA RUNTIME LIBRARY COMPONENTS --
+-- GNAT RUN-TIME LIBRARY COMPONENTS --
-- --
--- S Y S T E M . C O M P A R E _ A R R A Y _ U N S I G N E D _ 16 --
+-- S Y S T E M . C O M P A R E _ A R R A Y _ U N S I G N E D _ 1 6 --
-- --
-- B o d y --
-- --
--- Copyright (C) 2002 Free Software Foundation, Inc. --
+-- Copyright (C) 2002-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 Unchecked_Conversion;
+with System.Address_Operations; use System.Address_Operations;
+
+with Ada.Unchecked_Conversion;
package body System.Compare_Array_Unsigned_16 is
for Half'Size use 16;
-- Used to process operands by half words
- type Uhalf is record
- H : Half;
- end record;
- pragma Pack (Uhalf);
+ type Uhalf is new Half;
for Uhalf'Alignment use 1;
-- Used to process operands when unaligned
type HP is access Half;
type UP is access Uhalf;
- function W is new Unchecked_Conversion (Address, WP);
- function H is new Unchecked_Conversion (Address, HP);
- function U is new Unchecked_Conversion (Address, UP);
+ function W is new Ada.Unchecked_Conversion (Address, WP);
+ function H is new Ada.Unchecked_Conversion (Address, HP);
+ function U is new Ada.Unchecked_Conversion (Address, UP);
-----------------------
-- Compare_Array_U16 --
(Left : System.Address;
Right : System.Address;
Left_Len : Natural;
- Right_Len : Natural)
- return Integer
+ Right_Len : Natural) return Integer
is
Clen : Natural := Natural'Min (Left_Len, Right_Len);
-- Number of elements left to compare
begin
-- Go by words if possible
- if ((Left or Right) and (4 - 1)) = 0 then
+ if ModA (OrA (Left, Right), 4) = 0 then
while Clen > 1
and then W (L).all = W (R).all
loop
Clen := Clen - 2;
- L := L + 4;
- R := R + 4;
+ L := AddA (L, 4);
+ R := AddA (R, 4);
end loop;
end if;
-- Case of going by aligned half words
- if ((Left or Right) and (2 - 1)) = 0 then
+ if ModA (OrA (Left, Right), 2) = 0 then
while Clen /= 0 loop
if H (L).all /= H (R).all then
if H (L).all > H (R).all then
end if;
Clen := Clen - 1;
- L := L + 2;
- R := R + 2;
+ L := AddA (L, 2);
+ R := AddA (R, 2);
end loop;
-- Case of going by unaligned half words
else
while Clen /= 0 loop
- if U (L).H /= U (R).H then
- if U (L).H > U (R).H then
+ if U (L).all /= U (R).all then
+ if U (L).all > U (R).all then
return +1;
else
return -1;
end if;
Clen := Clen - 1;
- L := L + 2;
- R := R + 2;
+ L := AddA (L, 2);
+ R := AddA (R, 2);
end loop;
end if;
OSDN Git Service
