1------------------------------------------------------------------------------ 2-- -- 3-- GNAT COMPILER COMPONENTS -- 4-- -- 5-- S E M _ C H 4 -- 6-- -- 7-- S p e c -- 8-- -- 9-- Copyright (C) 1992-2021, 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 3, 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 COPYING3. If not, go to -- 19-- http://www.gnu.org/licenses for a complete copy of the license. -- 20-- -- 21-- GNAT was originally developed by the GNAT team at New York University. -- 22-- Extensive contributions were provided by Ada Core Technologies Inc. -- 23-- -- 24------------------------------------------------------------------------------ 25 26with Types; use Types; 27 28package Sem_Ch4 is 29 procedure Analyze_Aggregate (N : Node_Id); 30 procedure Analyze_Allocator (N : Node_Id); 31 procedure Analyze_Arithmetic_Op (N : Node_Id); 32 procedure Analyze_Call (N : Node_Id); 33 procedure Analyze_Case_Expression (N : Node_Id); 34 procedure Analyze_Comparison_Op (N : Node_Id); 35 procedure Analyze_Concatenation (N : Node_Id); 36 procedure Analyze_Equality_Op (N : Node_Id); 37 procedure Analyze_Explicit_Dereference (N : Node_Id); 38 procedure Analyze_Expression_With_Actions (N : Node_Id); 39 procedure Analyze_If_Expression (N : Node_Id); 40 procedure Analyze_Logical_Op (N : Node_Id); 41 procedure Analyze_Membership_Op (N : Node_Id); 42 procedure Analyze_Mod (N : Node_Id); 43 procedure Analyze_Negation (N : Node_Id); 44 procedure Analyze_Null (N : Node_Id); 45 procedure Analyze_Qualified_Expression (N : Node_Id); 46 procedure Analyze_Quantified_Expression (N : Node_Id); 47 procedure Analyze_Range (N : Node_Id); 48 procedure Analyze_Reference (N : Node_Id); 49 procedure Analyze_Selected_Component (N : Node_Id); 50 procedure Analyze_Short_Circuit (N : Node_Id); 51 procedure Analyze_Slice (N : Node_Id); 52 procedure Analyze_Type_Conversion (N : Node_Id); 53 procedure Analyze_Unary_Op (N : Node_Id); 54 procedure Analyze_Unchecked_Expression (N : Node_Id); 55 procedure Analyze_Unchecked_Type_Conversion (N : Node_Id); 56 57 procedure Analyze_Indexed_Component_Form (N : Node_Id); 58 -- Prior to semantic analysis, an indexed component node can denote any 59 -- of the following syntactic constructs: 60 -- a) An indexed component of an array 61 -- b) A function call 62 -- c) A conversion 63 -- d) A slice 64 -- The resolution of the construct requires some semantic information 65 -- on the prefix and the indexes. 66 67 function Try_Object_Operation 68 (N : Node_Id; 69 CW_Test_Only : Boolean := False; 70 Allow_Extensions : Boolean := False) return Boolean; 71 -- Ada 2005 (AI-252): Support the object.operation notation. If node N is 72 -- a call in this notation, it is transformed into a normal subprogram call 73 -- where the prefix is a parameter, and True is returned. If node N is not 74 -- of this form, it is unchanged, and False is returned. If CW_Test_Only is 75 -- true then N is an N_Selected_Component node which is part of a call to 76 -- an entry or procedure of a tagged concurrent type and this routine is 77 -- invoked to search for class-wide subprograms conflicting with the target 78 -- entity. If Allow_Extensions is True, then a prefixed call of a primitive 79 -- of a non-tagged type is allowed as if Extensions_Allowed returned True. 80 -- This is used to issue better error messages. 81 82end Sem_Ch4; 83