gcc/ada/s-valenu.adb

   1 ------------------------------------------------------------------------------
   2 --                                                                          --
   3 --                         GNAT COMPILER COMPONENTS                         --
   4 --                                                                          --
   5 --                      S Y S T E M . V A L _ E N U M                       --
   6 --                                                                          --
   7 --                                 B o d y                                  --
   8 --                                                                          --
   9 --                                                                          --
  10 --          Copyright (C) 1992-2000, Free Software Foundation, Inc.         --
  11 --                                                                          --
  12 -- GNAT is free software;  you can  redistribute it  and/or modify it under --
  13 -- terms of the  GNU General Public License as published  by the Free Soft- --
  14 -- ware  Foundation;  either version 2,  or (at your option) any later ver- --
  15 -- sion.  GNAT is distributed in the hope that it will be useful, but WITH- --
  16 -- OUT ANY WARRANTY;  without even the  implied warranty of MERCHANTABILITY --
  17 -- or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License --
  18 -- for  more details.  You should have  received  a copy of the GNU General --
  19 -- Public License  distributed with GNAT;  see file COPYING.  If not, write --
  20 -- to  the Free Software Foundation,  59 Temple Place - Suite 330,  Boston, --
  21 -- MA 02111-1307, USA.                                                      --
  22 --                                                                          --
  23 -- As a special exception,  if other files  instantiate  generics from this --
  24 -- unit, or you link  this unit with other files  to produce an executable, --
  25 -- this  unit  does not  by itself cause  the resulting  executable  to  be --
  26 -- covered  by the  GNU  General  Public  License.  This exception does not --
  27 -- however invalidate  any other reasons why  the executable file  might be --
  28 -- covered by the  GNU Public License.                                      --
  29 --                                                                          --
  30 -- GNAT was originally developed  by the GNAT team at  New York University. --
  31 -- Extensive contributions were provided by Ada Core Technologies Inc.      --
  32 --                                                                          --
  33 ------------------------------------------------------------------------------
  34
  35 with Unchecked_Conversion;
  36 with System.Val_Util; use System.Val_Util;
  37
  38 package body System.Val_Enum is
  39
  40    -------------------------
  41    -- Value_Enumeration_8 --
  42    -------------------------
  43
  44    function Value_Enumeration_8
  45      (Names   : String;
  46       Indexes : System.Address;
  47       Num     : Natural;
  48       Str     : String)
  49       return    Natural
  50    is
  51       F : Natural;
  52       L : Natural;
  53       S : String (Str'Range) := Str;
  54
  55       type Natural_8 is range 0 .. 2 ** 7 - 1;
  56       type Index_Table is array (Natural) of Natural_8;
  57       type Index_Table_Ptr is access Index_Table;
  58
  59       function To_Index_Table_Ptr is
  60         new Unchecked_Conversion (System.Address, Index_Table_Ptr);
  61
  62       IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes);
  63
  64    begin
  65       Normalize_String (S, F, L);
  66
  67       for J in 0 .. Num loop
  68          if Names
  69            (Natural (IndexesT (J)) ..
  70             Natural (IndexesT (J + 1)) - 1) = S (F .. L)
  71          then
  72             return J;
  73          end if;
  74       end loop;
  75
  76       raise Constraint_Error;
  77    end Value_Enumeration_8;
  78
  79    --------------------------
  80    -- Value_Enumeration_16 --
  81    --------------------------
  82
  83    function Value_Enumeration_16
  84      (Names   : String;
  85       Indexes : System.Address;
  86       Num     : Natural;
  87       Str     : String)
  88       return    Natural
  89    is
  90       F : Natural;
  91       L : Natural;
  92       S : String (Str'Range) := Str;
  93
  94       type Natural_16 is range 0 .. 2 ** 15 - 1;
  95       type Index_Table is array (Natural) of Natural_16;
  96       type Index_Table_Ptr is access Index_Table;
  97
  98       function To_Index_Table_Ptr is
  99         new Unchecked_Conversion (System.Address, Index_Table_Ptr);
 100
 101       IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes);
 102
 103    begin
 104       Normalize_String (S, F, L);
 105
 106       for J in 0 .. Num loop
 107          if Names
 108            (Natural (IndexesT (J)) ..
 109             Natural (IndexesT (J + 1)) - 1) = S (F .. L)
 110          then
 111             return J;
 112          end if;
 113       end loop;
 114
 115       raise Constraint_Error;
 116    end Value_Enumeration_16;
 117
 118    --------------------------
 119    -- Value_Enumeration_32 --
 120    --------------------------
 121
 122    function Value_Enumeration_32
 123      (Names   : String;
 124       Indexes : System.Address;
 125       Num     : Natural;
 126       Str     : String)
 127       return    Natural
 128    is
 129       F : Natural;
 130       L : Natural;
 131       S : String (Str'Range) := Str;
 132
 133       type Natural_32 is range 0 .. 2 ** 31 - 1;
 134       type Index_Table is array (Natural) of Natural_32;
 135       type Index_Table_Ptr is access Index_Table;
 136
 137       function To_Index_Table_Ptr is
 138         new Unchecked_Conversion (System.Address, Index_Table_Ptr);
 139
 140       IndexesT : constant Index_Table_Ptr := To_Index_Table_Ptr (Indexes);
 141
 142    begin
 143       Normalize_String (S, F, L);
 144
 145       for J in 0 .. Num loop
 146          if Names
 147            (Natural (IndexesT (J)) ..
 148             Natural (IndexesT (J + 1)) - 1) = S (F .. L)
 149          then
 150             return J;
 151          end if;
 152       end loop;
 153
 154       raise Constraint_Error;
 155    end Value_Enumeration_32;
 156
 157 end System.Val_Enum;