1------------------------------------------------------------------------------ 2-- -- 3-- GNAT COMPILER COMPONENTS -- 4-- -- 5-- S E M _ C H 1 3 -- 6-- -- 7-- S p e c -- 8-- -- 9-- Copyright (C) 1992-2013, 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 Table; 27with Types; use Types; 28with Uintp; use Uintp; 29 30package Sem_Ch13 is 31 procedure Analyze_At_Clause (N : Node_Id); 32 procedure Analyze_Attribute_Definition_Clause (N : Node_Id); 33 procedure Analyze_Enumeration_Representation_Clause (N : Node_Id); 34 procedure Analyze_Free_Statement (N : Node_Id); 35 procedure Analyze_Freeze_Entity (N : Node_Id); 36 procedure Analyze_Freeze_Generic_Entity (N : Node_Id); 37 procedure Analyze_Record_Representation_Clause (N : Node_Id); 38 procedure Analyze_Code_Statement (N : Node_Id); 39 40 procedure Analyze_Aspect_Specifications (N : Node_Id; E : Entity_Id); 41 -- This procedure is called to analyze aspect specifications for node N. E 42 -- is the corresponding entity declared by the declaration node N. Callers 43 -- should check that Has_Aspects (N) is True before calling this routine. 44 45 procedure Adjust_Record_For_Reverse_Bit_Order (R : Entity_Id); 46 -- Called from Freeze where R is a record entity for which reverse bit 47 -- order is specified and there is at least one component clause. Adjusts 48 -- component positions according to either Ada 95 or Ada 2005 (AI-133). 49 50 function Build_Invariant_Procedure_Declaration 51 (Typ : Entity_Id) return Node_Id; 52 -- If a type declaration has a specified invariant aspect, build the 53 -- declaration for the procedure at once, so that calls to it can be 54 -- generated before the body of the invariant procedure is built. This 55 -- is needed in the presence of public expression functions that return 56 -- the type in question. 57 58 procedure Build_Invariant_Procedure (Typ : Entity_Id; N : Node_Id); 59 -- Typ is a private type with invariants (indicated by Has_Invariants being 60 -- set for Typ, indicating the presence of pragma Invariant entries on the 61 -- rep chain, note that Invariant aspects have already been converted to 62 -- pragma Invariant), then this procedure builds the spec and body for the 63 -- corresponding Invariant procedure, inserting them at appropriate points 64 -- in the package specification N. Invariant_Procedure is set for Typ. Note 65 -- that this procedure is called at the end of processing the declarations 66 -- in the visible part (i.e. the right point for visibility analysis of 67 -- the invariant expression). 68 69 procedure Check_Record_Representation_Clause (N : Node_Id); 70 -- This procedure completes the analysis of a record representation clause 71 -- N. It is called at freeze time after adjustment of component clause bit 72 -- positions for possible non-standard bit order. In the case of Ada 2005 73 -- (machine scalar) mode, this adjustment can make substantial changes, so 74 -- some checks, in particular for component overlaps cannot be done at the 75 -- time the record representation clause is first seen, but must be delayed 76 -- till freeze time, and in particular is called after calling the above 77 -- procedure for adjusting record bit positions for reverse bit order. 78 79 procedure Initialize; 80 -- Initialize internal tables for new compilation 81 82 procedure Set_Enum_Esize (T : Entity_Id); 83 -- This routine sets the Esize field for an enumeration type T, based 84 -- on the current representation information available for T. Note that 85 -- the setting of the RM_Size field is not affected. This routine also 86 -- initializes the alignment field to zero. 87 88 function Minimum_Size 89 (T : Entity_Id; 90 Biased : Boolean := False) return Nat; 91 -- Given an elementary type, determines the minimum number of bits required 92 -- to represent all values of the type. This function may not be called 93 -- with any other types. If the flag Biased is set True, then the minimum 94 -- size calculation that biased representation is used in the case of a 95 -- discrete type, e.g. the range 7..8 gives a minimum size of 4 with 96 -- Biased set to False, and 1 with Biased set to True. Note that the 97 -- biased parameter only has an effect if the type is not biased, it 98 -- causes Minimum_Size to indicate the minimum size of an object with 99 -- the given type, of the size the type would have if it were biased. If 100 -- the type is already biased, then Minimum_Size returns the biased size, 101 -- regardless of the setting of Biased. Also, fixed-point types are never 102 -- biased in the current implementation. If the size is not known at 103 -- compile time, this function returns 0. 104 105 procedure Check_Constant_Address_Clause (Expr : Node_Id; U_Ent : Entity_Id); 106 -- Expr is an expression for an address clause. This procedure checks 107 -- that the expression is constant, in the limited sense that it is safe 108 -- to evaluate it at the point the object U_Ent is declared, rather than 109 -- at the point of the address clause. The condition for this to be true 110 -- is that the expression has no variables, no constants declared after 111 -- U_Ent, and no calls to non-pure functions. If this condition is not 112 -- met, then an appropriate error message is posted. This check is applied 113 -- at the point an object with an address clause is frozen, as well as for 114 -- address clauses for tasks and entries. 115 116 procedure Check_Size 117 (N : Node_Id; 118 T : Entity_Id; 119 Siz : Uint; 120 Biased : out Boolean); 121 -- Called when size Siz is specified for subtype T. This subprogram checks 122 -- that the size is appropriate, posting errors on node N as required. 123 -- This check is effective for elementary types and bit-packed arrays. 124 -- For other non-elementary types, a check is only made if an explicit 125 -- size has been given for the type (and the specified size must match). 126 -- The parameter Biased is set False if the size specified did not require 127 -- the use of biased representation, and True if biased representation 128 -- was required to meet the size requirement. Note that Biased is only 129 -- set if the type is not currently biased, but biasing it is the only 130 -- way to meet the requirement. If the type is currently biased, then 131 -- this biased size is used in the initial check, and Biased is False. 132 -- If the size is too small, and an error message is given, then both 133 -- Esize and RM_Size are reset to the allowed minimum value in T. 134 135 function Rep_Item_Too_Early (T : Entity_Id; N : Node_Id) return Boolean; 136 -- Called at start of processing a representation clause/pragma. Used to 137 -- check that the representation item is not being applied to an incomplete 138 -- type or to a generic formal type or a type derived from a generic formal 139 -- type. Returns False if no such error occurs. If this error does occur, 140 -- appropriate error messages are posted on node N, and True is returned. 141 142 function Rep_Item_Too_Late 143 (T : Entity_Id; 144 N : Node_Id; 145 FOnly : Boolean := False) return Boolean; 146 -- Called at the start of processing a representation clause or a 147 -- representation pragma. Used to check that a representation item for 148 -- entity T does not appear too late (according to the rules in RM 13.1(9) 149 -- and RM 13.1(10)). N is the associated node, which in the pragma case 150 -- is the pragma or representation clause itself, used for placing error 151 -- messages if the item is too late. 152 -- 153 -- Fonly is a flag that causes only the freezing rule (para 9) to be 154 -- applied, and the tests of para 10 are skipped. This is appropriate for 155 -- both subtype related attributes (Alignment and Size) and for stream 156 -- attributes, which, although certainly not subtype related attributes, 157 -- clearly should not be subject to the para 10 restrictions (see 158 -- AI95-00137). Similarly, we also skip the para 10 restrictions for 159 -- the Storage_Size case where they also clearly do not apply, and for 160 -- Stream_Convert which is in the same category as the stream attributes. 161 -- 162 -- If the rep item is too late, an appropriate message is output and True 163 -- is returned, which is a signal that the caller should abandon processing 164 -- for the item. If the item is not too late, then False is returned, and 165 -- the caller can continue processing the item. 166 -- 167 -- If no error is detected, this call also as a side effect links the 168 -- representation item onto the head of the representation item chain 169 -- (referenced by the First_Rep_Item field of the entity). 170 -- 171 -- Note: Rep_Item_Too_Late must be called with the underlying type in the 172 -- case of a private or incomplete type. The protocol is to first check for 173 -- Rep_Item_Too_Early using the initial entity, then take the underlying 174 -- type, then call Rep_Item_Too_Late on the result. 175 -- 176 -- Note: Calls to Rep_Item_Too_Late are ignored for the case of attribute 177 -- definition clauses which have From_Aspect_Specification set. This is 178 -- because such clauses are linked on to the Rep_Item chain in procedure 179 -- Sem_Ch13.Analyze_Aspect_Specifications. See that procedure for details. 180 181 function Same_Representation (Typ1, Typ2 : Entity_Id) return Boolean; 182 -- Given two types, where the two types are related by possible derivation, 183 -- determines if the two types have the same representation, or different 184 -- representations, requiring the special processing for representation 185 -- change. A False result is possible only for array, enumeration or 186 -- record types. 187 188 procedure Validate_Unchecked_Conversion 189 (N : Node_Id; 190 Act_Unit : Entity_Id); 191 -- Validate a call to unchecked conversion. N is the node for the actual 192 -- instantiation, which is used only for error messages. Act_Unit is the 193 -- entity for the instantiation, from which the actual types etc. for this 194 -- instantiation can be determined. This procedure makes an entry in a 195 -- table and/or generates an N_Validate_Unchecked_Conversion node. The 196 -- actual checking is done in Validate_Unchecked_Conversions or in the 197 -- back end as required. 198 199 procedure Validate_Unchecked_Conversions; 200 -- This routine is called after calling the backend to validate unchecked 201 -- conversions for size and alignment appropriateness. The reason it is 202 -- called that late is to take advantage of any back-annotation of size 203 -- and alignment performed by the backend. 204 205 procedure Validate_Address_Clauses; 206 -- This is called after the back end has been called (and thus after the 207 -- alignments of objects have been back annotated). It goes through the 208 -- table of saved address clauses checking for suspicious alignments and 209 -- if necessary issuing warnings. 210 211 procedure Validate_Independence; 212 -- This is called after the back end has been called (and thus after the 213 -- layout of components has been back annotated). It goes through the 214 -- table of saved pragma Independent[_Component] entries, checking that 215 -- independence can be achieved, and if necessary issuing error messages. 216 217 ------------------------------------- 218 -- Table for Validate_Independence -- 219 ------------------------------------- 220 221 -- If a legal pragma Independent or Independent_Components is given for 222 -- an entity, then an entry is made in this table, to be checked by a 223 -- call to Validate_Independence after back annotation of layout is done. 224 225 type Independence_Check_Record is record 226 N : Node_Id; 227 -- The pragma Independent or Independent_Components 228 229 E : Entity_Id; 230 -- The entity to which it applies 231 end record; 232 233 package Independence_Checks is new Table.Table ( 234 Table_Component_Type => Independence_Check_Record, 235 Table_Index_Type => Int, 236 Table_Low_Bound => 1, 237 Table_Initial => 20, 238 Table_Increment => 200, 239 Table_Name => "Independence_Checks"); 240 241 ----------------------------------- 242 -- Handling of Aspect Visibility -- 243 ----------------------------------- 244 245 -- The visibility of aspects is tricky. First, the visibility is delayed 246 -- to the freeze point. This is not too complicated, what we do is simply 247 -- to leave the aspect "laying in wait" for the freeze point, and at that 248 -- point materialize and analyze the corresponding attribute definition 249 -- clause or pragma. There is some special processing for preconditions 250 -- and postonditions, where the pragmas themselves deal with the required 251 -- delay, but basically the approach is the same, delay analysis of the 252 -- expression to the freeze point. 253 254 -- Much harder is the requirement for diagnosing cases in which an early 255 -- freeze causes a change in visibility. Consider: 256 257 -- package AspectVis is 258 -- R_Size : constant Integer := 32; 259 -- 260 -- package Inner is 261 -- type R is new Integer with 262 -- Size => R_Size; 263 -- F : R; -- freezes 264 -- R_Size : constant Integer := 64; 265 -- S : constant Integer := R'Size; -- 32 not 64 266 -- end Inner; 267 -- end AspectVis; 268 269 -- Here the 32 not 64 shows what would be expected if this program were 270 -- legal, since the evaluation of R_Size has to be done at the freeze 271 -- point and gets the outer definition not the inner one. 272 273 -- But the language rule requires this program to be diagnosed as illegal 274 -- because the visibility changes between the freeze point and the end of 275 -- the declarative region. 276 277 -- To meet this requirement, we first note that the Expression field of the 278 -- N_Aspect_Specification node holds the raw unanalyzed expression, which 279 -- will get used in processing the aspect. At the time of analyzing the 280 -- N_Aspect_Specification node, we create a complete copy of the expression 281 -- and store it in the entity field of the Identifier (an odd usage, but 282 -- the identifier is not used except to identify the aspect, so its Entity 283 -- field is otherwise unused, and we are short of room in the node). 284 285 -- This copy stays unanalyzed up to the freeze point, where we analyze the 286 -- resulting pragma or attribute definition clause, except that in the 287 -- case of invariants and predicates, we mark occurrences of the subtype 288 -- name as having the entity of the subprogram parameter, so that they 289 -- will not cause trouble in the following steps. 290 291 -- Then at the freeze point, we create another copy of this unanalyzed 292 -- expression. By this time we no longer need the Expression field for 293 -- other purposes, so we can store it there. Now we have two copies of 294 -- the original unanalyzed expression. One of them gets preanalyzed at 295 -- the freeze point to capture the visibility at the freeze point. 296 297 -- Now when we hit the freeze all at the end of the declarative part, if 298 -- we come across a frozen entity with delayed aspects, we still have one 299 -- copy of the unanalyzed expression available in the node, and we again 300 -- do a preanalysis using that copy and the visibility at the end of the 301 -- declarative part. Now we have two preanalyzed expression (preanalysis 302 -- is good enough, since we are only interested in referenced entities). 303 -- One captures the visibility at the freeze point, the other captures the 304 -- visibility at the end of the declarative part. We see if the entities 305 -- in these two expressions are the same, by seeing if the two expressions 306 -- are fully conformant, and if not, issue appropriate error messages. 307 308 -- Quite an awkward approach, but this is an awkard requirement 309 310 procedure Analyze_Aspects_At_Freeze_Point (E : Entity_Id); 311 -- Analyze all the delayed aspects for entity E at freezing point. This 312 -- includes dealing with inheriting delayed aspects from the parent type 313 -- in the case where a derived type is frozen. 314 315 procedure Check_Aspect_At_Freeze_Point (ASN : Node_Id); 316 -- Performs the processing described above at the freeze point, ASN is the 317 -- N_Aspect_Specification node for the aspect. 318 319 procedure Check_Aspect_At_End_Of_Declarations (ASN : Node_Id); 320 -- Performs the processing described above at the freeze all point, and 321 -- issues appropriate error messages if the visibility has indeed changed. 322 -- Again, ASN is the N_Aspect_Specification node for the aspect. 323 324 procedure Inherit_Aspects_At_Freeze_Point (Typ : Entity_Id); 325 -- Given an entity Typ that denotes a derived type or a subtype, this 326 -- routine performs the inheritance of aspects at the freeze point. 327 328 procedure Validate_Iterable_Aspect (Typ : Entity_Id; ASN : Node_Id); 329 -- For SPARK 2014 formal containers. The expression has the form of an 330 -- aggregate, and each entry must denote a function with the proper syntax 331 -- for First, Next, and Has_Element. Optionally an Element primitive may 332 -- also be defined. 333 334end Sem_Ch13; 335