cecaf88a61
2007-04-20 Robert Dewar <dewar@adacore.com> * a-taster.adb, s-osinte-hpux.ads, s-osinte-solaris-posix.ads, s-osinte-irix.ads, s-interr-sigaction.adb, s-mastop-irix.adb, s-osinte-hpux-dce.ads, s-osinte-interix.ads, s-osinte-solaris.ads, s-taspri-solaris.ads, s-inmaop-vms.adb, s-interr-vms.adb, s-mastop-vms.adb, s-osinte-vms.ads, s-tpopde-vms.adb, s-osinte-mingw.ads, s-interr-vxworks.adb, i-cstrea-vms.adb, a-diocst.adb, a-direio.adb, a-interr.adb, a-sequio.adb, a-siocst.adb, a-ssicst.adb, a-storio.adb, a-ststio.adb, a-stwima.adb, a-tasatt.adb, a-taside.adb, a-tiocst.adb, a-witeio.adb, a-wtcstr.adb, g-crc32.adb, g-dirope.adb, g-dyntab.adb, g-memdum.adb, g-regexp.adb, g-spipat.adb, g-spitbo.adb, g-string.adb, g-string.ads, g-table.adb, g-thread.adb, i-cobol.adb, i-cpoint.adb, i-cstrea.adb, i-cstrin.adb, i-pacdec.adb, s-addima.adb, s-arit64.adb, s-auxdec.adb, s-auxdec.ads, s-auxdec-vms_64.ads, s-carsi8.adb, s-carun8.adb, s-casi16.adb, s-casi32.adb, s-casi64.adb, s-caun16.adb, s-caun32.adb, s-caun64.adb, s-direio.adb, s-fileio.adb, s-finimp.ads, s-geveop.adb, s-imgenu.adb, s-pack03.adb, s-pack05.adb, s-pack06.adb, s-pack07.adb, s-pack09.adb, s-pack10.adb, s-pack11.adb, s-pack12.adb, s-pack13.adb, s-pack14.adb, s-pack15.adb, s-pack17.adb, s-pack18.adb, s-pack19.adb, s-pack20.adb, s-pack21.adb, s-pack22.adb, s-pack23.adb, s-pack24.adb, s-pack25.adb, s-pack26.adb, s-pack27.adb, s-pack28.adb, s-pack29.adb, s-pack30.adb, s-pack31.adb, s-pack33.adb, s-pack34.adb, s-pack35.adb, s-pack36.adb, s-pack37.adb, s-pack38.adb, s-pack39.adb, s-pack40.adb, s-pack41.adb, s-pack42.adb, s-pack43.adb, s-pack44.adb, s-pack45.adb, s-pack46.adb, s-pack47.adb, s-pack48.adb, s-pack49.adb, s-pack50.adb, s-pack51.adb, s-pack52.adb, s-pack53.adb, s-pack54.adb, s-pack55.adb, s-pack56.adb, s-pack57.adb, s-pack58.adb, s-pack59.adb, s-pack60.adb, s-pack61.adb, s-pack62.adb, s-pack63.adb, s-pooloc.adb, s-poosiz.adb, s-scaval.adb, s-sequio.adb, s-shasto.adb, s-stalib.ads, s-stratt.adb, s-strcom.adb, s-taasde.adb, s-tasdeb.adb, s-tasuti.ads, s-tataat.ads, s-tpoben.ads, s-valenu.adb, s-widenu.adb, s-wwdenu.adb, s-addope.adb, a-stzmap.adb, a-ztcstr.adb, a-ztexio.adb, s-osinte-linux-hppa.ads: Replace Unchecked_* by Ada.Unchecked_* From-SVN: r125359
166 lines
6.4 KiB
Ada
166 lines
6.4 KiB
Ada
------------------------------------------------------------------------------
|
|
-- --
|
|
-- GNAT RUN-TIME COMPONENTS --
|
|
-- --
|
|
-- S Y S T E M . P A C K _ 2 8 --
|
|
-- --
|
|
-- B o d y --
|
|
-- --
|
|
-- Copyright (C) 1992-2007, 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- --
|
|
-- 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, 51 Franklin Street, Fifth Floor, --
|
|
-- Boston, MA 02110-1301, USA. --
|
|
-- --
|
|
-- 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. --
|
|
-- --
|
|
-- GNAT was originally developed by the GNAT team at New York University. --
|
|
-- Extensive contributions were provided by Ada Core Technologies Inc. --
|
|
-- --
|
|
------------------------------------------------------------------------------
|
|
|
|
with System.Storage_Elements;
|
|
with System.Unsigned_Types;
|
|
with Ada.Unchecked_Conversion;
|
|
|
|
package body System.Pack_28 is
|
|
|
|
subtype Ofs is System.Storage_Elements.Storage_Offset;
|
|
subtype Uns is System.Unsigned_Types.Unsigned;
|
|
subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7;
|
|
|
|
use type System.Storage_Elements.Storage_Offset;
|
|
use type System.Unsigned_Types.Unsigned;
|
|
|
|
type Cluster is record
|
|
E0, E1, E2, E3, E4, E5, E6, E7 : Bits_28;
|
|
end record;
|
|
|
|
for Cluster use record
|
|
E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1;
|
|
E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1;
|
|
E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1;
|
|
E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1;
|
|
E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1;
|
|
E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1;
|
|
E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1;
|
|
E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1;
|
|
end record;
|
|
|
|
for Cluster'Size use Bits * 8;
|
|
|
|
for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment,
|
|
1 +
|
|
1 * Boolean'Pos (Bits mod 2 = 0) +
|
|
2 * Boolean'Pos (Bits mod 4 = 0));
|
|
-- Use maximum possible alignment, given the bit field size, since this
|
|
-- will result in the most efficient code possible for the field.
|
|
|
|
type Cluster_Ref is access Cluster;
|
|
|
|
function To_Ref is new
|
|
Ada.Unchecked_Conversion (System.Address, Cluster_Ref);
|
|
|
|
-- The following declarations are for the case where the address
|
|
-- passed to GetU_28 or SetU_28 is not guaranteed to be aligned.
|
|
-- These routines are used when the packed array is itself a
|
|
-- component of a packed record, and therefore may not be aligned.
|
|
|
|
type ClusterU is new Cluster;
|
|
for ClusterU'Alignment use 1;
|
|
|
|
type ClusterU_Ref is access ClusterU;
|
|
|
|
function To_Ref is new
|
|
Ada.Unchecked_Conversion (System.Address, ClusterU_Ref);
|
|
|
|
------------
|
|
-- Get_28 --
|
|
------------
|
|
|
|
function Get_28 (Arr : System.Address; N : Natural) return Bits_28 is
|
|
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
|
|
begin
|
|
case N07 (Uns (N) mod 8) is
|
|
when 0 => return C.E0;
|
|
when 1 => return C.E1;
|
|
when 2 => return C.E2;
|
|
when 3 => return C.E3;
|
|
when 4 => return C.E4;
|
|
when 5 => return C.E5;
|
|
when 6 => return C.E6;
|
|
when 7 => return C.E7;
|
|
end case;
|
|
end Get_28;
|
|
|
|
-------------
|
|
-- GetU_28 --
|
|
-------------
|
|
|
|
function GetU_28 (Arr : System.Address; N : Natural) return Bits_28 is
|
|
C : constant ClusterU_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
|
|
begin
|
|
case N07 (Uns (N) mod 8) is
|
|
when 0 => return C.E0;
|
|
when 1 => return C.E1;
|
|
when 2 => return C.E2;
|
|
when 3 => return C.E3;
|
|
when 4 => return C.E4;
|
|
when 5 => return C.E5;
|
|
when 6 => return C.E6;
|
|
when 7 => return C.E7;
|
|
end case;
|
|
end GetU_28;
|
|
|
|
------------
|
|
-- Set_28 --
|
|
------------
|
|
|
|
procedure Set_28 (Arr : System.Address; N : Natural; E : Bits_28) is
|
|
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
|
|
begin
|
|
case N07 (Uns (N) mod 8) is
|
|
when 0 => C.E0 := E;
|
|
when 1 => C.E1 := E;
|
|
when 2 => C.E2 := E;
|
|
when 3 => C.E3 := E;
|
|
when 4 => C.E4 := E;
|
|
when 5 => C.E5 := E;
|
|
when 6 => C.E6 := E;
|
|
when 7 => C.E7 := E;
|
|
end case;
|
|
end Set_28;
|
|
|
|
-------------
|
|
-- SetU_28 --
|
|
-------------
|
|
|
|
procedure SetU_28 (Arr : System.Address; N : Natural; E : Bits_28) is
|
|
C : constant ClusterU_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
|
|
begin
|
|
case N07 (Uns (N) mod 8) is
|
|
when 0 => C.E0 := E;
|
|
when 1 => C.E1 := E;
|
|
when 2 => C.E2 := E;
|
|
when 3 => C.E3 := E;
|
|
when 4 => C.E4 := E;
|
|
when 5 => C.E5 := E;
|
|
when 6 => C.E6 := E;
|
|
when 7 => C.E7 := E;
|
|
end case;
|
|
end SetU_28;
|
|
|
|
end System.Pack_28;
|