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