bfc8aa81e4
2006-10-31 Robert Dewar <dewar@adacore.com> Thomas Quinot <quinot@adacore.com> Arnaud Charlet <charlet@adacore.com> * fmap.adb: Put routines in alpha order * g-boumai.ads: Remove redundant 'in' keywords * g-cgi.adb: Minor reformatting * g-cgi.ads: Remove redundant 'in' keywords * get_targ.adb: Put routines in alpha order * prj-attr.ads: Minor reformatting * s-atacco.ads: Minor reformatting * scn.adb: Put routines in alpha order * sinput-l.adb: Minor comment fix * sinput-p.adb: Minor comment fix * s-maccod.ads: Minor reformatting * s-memory.adb: Minor reformatting * s-htable.adb: Fix typo in comment. * s-secsta.adb: Minor comment update. * s-soflin.adb: Minor reformatting * s-stoele.ads: Add comment about odd qualification in Storage_Offset declaration * s-strxdr.adb: Remove unnecessary 'in' keywords for formal parameters. * treeprs.adt: Minor reformatting * urealp.adb: Put routines in alpha order * s-wchcon.ads, s-wchcon.adb (Get_WC_Encoding_Method): New version taking string. * s-asthan-vms-alpha.adb: Remove redundant 'in' keywords * g-trasym-vms-ia64.adb: Remove redundant 'in' keywords * env.c (__gnat_unsetenv): Unsetenv is unavailable on LynxOS, so workaround as on other platforms. * g-eacodu-vms.adb: Remove redundant 'in' keywords * g-expect-vms.adb: Remove redundant 'in' keywords * gnatdll.adb (Add_Files_From_List): Handle Name_Error and report a clear error message if the list-of-files file cannot be opened. * g-thread.adb (Unregister_Thread_Id): Add use type Thread_Id so the equality operator is always visible. * lang.opt: Woverlength-strings: New option. * nmake.adt: Update copyright, since nmake.ads and nmake.adb have changed. * osint-b.ads, osint-b.adb (Time_From_Last_Bind): removed function . (Binder_Output_Time_Stamps_Set): removed. (Old_Binder_Output_Time_Stamp): idem. (New_Binder_Output_Time_Stamp): idem. (Recording_Time_From_Last_Bind): idem. (Recording_Time_From_Last_Bind): Make constant. * output.ads, output.adb (Write_Str): Allow LF characters (Write_Spaces): New procedure * prepcomp.adb (Preproc_Data_Table): Change Increment from 5% to 100% * inline.adb: Minor reformatting * s-asthan-vms-alpha.adb: Remove redundant 'in' keywords * s-mastop-vms.adb: Remove redundant 'in' keywords * s-osprim-vms.adb: Remove redundant 'in' keywords * s-trafor-default.adb: Remove redundant 'in' keywords * 9drpc.adb: Remove redundant 'in' keywords * s-osinte-mingw.ads: Minor reformatting * s-inmaop-posix.adb: Minor reformatting * a-direio.ads: Remove quotes from Compile_Time_Warning message * a-exexda.adb: Minor code reorganization * a-filico.adb: Minor reformatting * a-finali.adb: Minor reformatting * a-nudira.ads: Remove quote from Compile_Time_Warning message * a-numeri.ads: Minor reformatting * a-sequio.ads: Remove quotes from Compile_Time_Warning message * exp_pakd.ads: Fix obsolete comment * a-ztenau.adb, a-ztenio.adb, a-wtenau.adb, a-tienau.adb, a-wtenio.adb (Put): Avoid assuming low bound of string is 1. Probably not a bug, but certainly neater and more efficient. * a-tienio.adb: Minor reformatting * comperr.adb (Compiler_Abort): Call Cancel_Special_Output at start Avoid assuming low bound of string is 1. * gnatbind.adb: Change Bindusg to package and rename procedure as Display, which now ensures that it only outputs usage information once. (Scan_Bind_Arg): Avoid assuming low bound of string is 1. * g-pehage.adb (Build_Identical_Keysets): Replace use of 1 by Table'First. * g-regpat.adb (Insert_Operator): Add pragma Warnings (Off) to kill warning. (Match): Add pragma Assert to ensure that Matches'First is zero * g-regpat.ads (Match): Document that Matches lower bound must be zero * makeutl.adb (Is_External_Assignment): Add pragma Assert's to check documented preconditions (also kills warnings about bad indexes). * mdll.adb (Build_Dynamic_Library): Avoid assumption that Afiles'First is 1. (Build_Import_Library): Ditto; * mdll-utl.adb: (Gnatbind): Avoid assumption that Alis'First = 1 * rtsfind.adb (RTE_Error_Msg): Avoid assuming low bound of string is 1. * sem_case.adb (Analyze_Choices): Add pragma Assert to check that lower bound of choice table is 1. * sem_case.ads (Analyze_Choices): Document that lower bound of Choice_Table is 1. * s-imgdec.adb (Set_Decimal_Digits): Avoid assuming low bound of string is 1. * uintp.adb (Init_Operand): Document that low bound of Vec is always 1, and add appropriate Assert pragma to suppress warnings. * atree.h, atree.ads, atree.adb Change Elist24 to Elist25 Add definitions of Field28 and Node28 (Traverse_Field): Use new syntactic parent table in sinfo. * cstand.adb: Change name Is_Ada_2005 to Is_Ada_2005_Only * itypes.adb: Change name Is_Ada_2005 to Is_Ada_2005_Only * exp_tss.adb: Put routines in alpha order * fe.h: Remove redundant declarations. From-SVN: r118330
123 lines
6.1 KiB
Ada
123 lines
6.1 KiB
Ada
------------------------------------------------------------------------------
|
|
-- --
|
|
-- GNAT COMPILER COMPONENTS --
|
|
-- --
|
|
-- S E M _ C A S E --
|
|
-- --
|
|
-- S p e c --
|
|
-- --
|
|
-- Copyright (C) 1996-2006, 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. --
|
|
-- --
|
|
-- GNAT was originally developed by the GNAT team at New York University. --
|
|
-- Extensive contributions were provided by Ada Core Technologies Inc. --
|
|
-- --
|
|
------------------------------------------------------------------------------
|
|
|
|
-- Package containing the routines to process a list of discrete choices.
|
|
-- Such lists can occur in two different constructs: case statements and
|
|
-- record variants. We have factorized what used to be two very similar
|
|
-- sets of routines in one place. These are not currently used for the
|
|
-- aggregate case, since issues with nested aggregates make that case
|
|
-- substantially different.
|
|
|
|
with Types; use Types;
|
|
|
|
package Sem_Case is
|
|
|
|
type Choice_Bounds is record
|
|
Lo : Node_Id;
|
|
Hi : Node_Id;
|
|
Node : Node_Id;
|
|
end record;
|
|
|
|
type Choice_Table_Type is array (Pos range <>) of Choice_Bounds;
|
|
-- Table type used to sort the choices present in a case statement,
|
|
-- array aggregate or record variant.
|
|
|
|
procedure No_OP (C : Node_Id);
|
|
-- The no-operation routine. Does absolutely nothing. Can be used
|
|
-- in the following generic for the parameter Proces_Empty_Choice.
|
|
|
|
generic
|
|
with function Get_Alternatives (N : Node_Id) return List_Id;
|
|
-- Function needed to get to the actual list of case statement
|
|
-- alternatives, or array aggregate component associations or
|
|
-- record variants from which we can then access the actual lists
|
|
-- of discrete choices. N is the node for the original construct
|
|
-- ie a case statement, an array aggregate or a record variant.
|
|
|
|
with function Get_Choices (A : Node_Id) return List_Id;
|
|
-- Given a case statement alternative, array aggregate component
|
|
-- association or record variant A we need different access functions
|
|
-- to get to the actual list of discrete choices.
|
|
|
|
with procedure Process_Empty_Choice (Choice : Node_Id);
|
|
-- Processing to carry out for an empty Choice
|
|
|
|
with procedure Process_Non_Static_Choice (Choice : Node_Id);
|
|
-- Processing to carry out for a non static Choice
|
|
|
|
with procedure Process_Associated_Node (A : Node_Id);
|
|
-- Associated to each case alternative, aggregate component
|
|
-- association or record variant A there is a node or list of nodes
|
|
-- that need semantic processing. This routine implements that
|
|
-- processing.
|
|
|
|
package Generic_Choices_Processing is
|
|
|
|
function Number_Of_Choices (N : Node_Id) return Nat;
|
|
-- Iterates through the choices of N, (N can be a case statement,
|
|
-- array aggregate or record variant), counting all the Choice nodes
|
|
-- except for the Others choice.
|
|
|
|
procedure Analyze_Choices
|
|
(N : Node_Id;
|
|
Subtyp : Entity_Id;
|
|
Choice_Table : out Choice_Table_Type;
|
|
Last_Choice : out Nat;
|
|
Raises_CE : out Boolean;
|
|
Others_Present : out Boolean);
|
|
-- From a case statement, array aggregate or record variant N, this
|
|
-- routine analyzes the corresponding list of discrete choices.
|
|
-- Subtyp is the subtype of the discrete choices. The type against
|
|
-- which the discrete choices must be resolved is its base type.
|
|
--
|
|
-- On entry Choice_Table must be big enough to contain all the discrete
|
|
-- choices encountered. The lower bound of Choice_Table must be one.
|
|
--
|
|
-- On exit Choice_Table contains all the static and non empty discrete
|
|
-- choices in sorted order. Last_Choice gives the position of the last
|
|
-- valid choice in Choice_Table, Choice_Table'First contains the first.
|
|
-- We can have Last_Choice < Choice_Table'Last for one (or several) of
|
|
-- the following reasons:
|
|
--
|
|
-- (a) The list of choices contained a non static choice
|
|
--
|
|
-- (b) The list of choices contained an empty choice
|
|
-- (something like "1 .. 0 => ")
|
|
--
|
|
-- (c) One of the bounds of a discrete choice contains an
|
|
-- error or raises constraint error.
|
|
--
|
|
-- In one of the bounds of a discrete choice raises a constraint
|
|
-- error the flag Raise_CE is set.
|
|
--
|
|
-- Finally Others_Present is set to True if an Others choice is present
|
|
-- in the list of choices, and in this case the call also sets
|
|
-- Others_Discrete_Choices in the N_Others_Choice node.
|
|
|
|
end Generic_Choices_Processing;
|
|
|
|
end Sem_Case;
|