diff options
author | Dan Albert <danalbert@google.com> | 2015-06-17 11:09:54 -0700 |
---|---|---|
committer | Dan Albert <danalbert@google.com> | 2015-06-17 14:15:22 -0700 |
commit | f378ebf14df0952eae870c9865bab8326aa8f137 (patch) | |
tree | 31794503eb2a8c64ea5f313b93100f1163afcffb /gcc-4.7/gcc/ada/s-pack41.adb | |
parent | 2c58169824949d3a597d9fa81931e001ef9b1bd0 (diff) | |
download | toolchain_gcc-f378ebf14df0952eae870c9865bab8326aa8f137.tar.gz toolchain_gcc-f378ebf14df0952eae870c9865bab8326aa8f137.tar.bz2 toolchain_gcc-f378ebf14df0952eae870c9865bab8326aa8f137.zip |
Delete old versions of GCC.
Change-Id: I710f125d905290e1024cbd67f48299861790c66c
Diffstat (limited to 'gcc-4.7/gcc/ada/s-pack41.adb')
-rw-r--r-- | gcc-4.7/gcc/ada/s-pack41.adb | 112 |
1 files changed, 0 insertions, 112 deletions
diff --git a/gcc-4.7/gcc/ada/s-pack41.adb b/gcc-4.7/gcc/ada/s-pack41.adb deleted file mode 100644 index 7ace35884..000000000 --- a/gcc-4.7/gcc/ada/s-pack41.adb +++ /dev/null @@ -1,112 +0,0 @@ ------------------------------------------------------------------------------- --- -- --- GNAT RUN-TIME COMPONENTS -- --- -- --- S Y S T E M . P A C K _ 4 1 -- --- -- --- B o d y -- --- -- --- Copyright (C) 1992-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 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. -- --- -- --- 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 System.Storage_Elements; -with System.Unsigned_Types; -with Ada.Unchecked_Conversion; - -package body System.Pack_41 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_41; - 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); - - ------------ - -- Get_41 -- - ------------ - - function Get_41 (Arr : System.Address; N : Natural) return Bits_41 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_41; - - ------------ - -- Set_41 -- - ------------ - - procedure Set_41 (Arr : System.Address; N : Natural; E : Bits_41) 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_41; - -end System.Pack_41; |