[RS6000] Don't be too clever with dg-do run and dg-do compile
[official-gcc.git] / gcc / ada / sem_ch13.ads
blob7d9f38d87e9ef13e72484833972b764946384b76
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-2020, 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 ------------------------------------------------------------------------------
26 with Table;
27 with Types; use Types;
28 with Uintp; use Uintp;
30 package Sem_Ch13 is
31 function All_Membership_Choices_Static (Expr : Node_Id) return Boolean;
32 -- Given a membership test, returns True iff all choices are static.
34 procedure Analyze_At_Clause (N : Node_Id);
35 procedure Analyze_Attribute_Definition_Clause (N : Node_Id);
36 procedure Analyze_Enumeration_Representation_Clause (N : Node_Id);
37 procedure Analyze_Free_Statement (N : Node_Id);
38 procedure Analyze_Freeze_Entity (N : Node_Id);
39 procedure Analyze_Freeze_Generic_Entity (N : Node_Id);
40 procedure Analyze_Record_Representation_Clause (N : Node_Id);
41 procedure Analyze_Code_Statement (N : Node_Id);
43 procedure Analyze_Aspect_Specifications (N : Node_Id; E : Entity_Id);
44 -- This procedure is called to analyze aspect specifications for node N. E
45 -- is the corresponding entity declared by the declaration node N. Callers
46 -- should check that Has_Aspects (N) is True before calling this routine.
48 procedure Analyze_Aspects_On_Subprogram_Body_Or_Stub (N : Node_Id);
49 -- Analyze the aspect specifications of [generic] subprogram body or stub
50 -- N. Callers should check that Has_Aspects (N) is True before calling the
51 -- routine. This routine diagnoses misplaced aspects that should appear on
52 -- the initial declaration of N and offers suggestions for replacements.
54 procedure Adjust_Record_For_Reverse_Bit_Order (R : Entity_Id);
55 -- Called from Freeze where R is a record entity for which reverse bit
56 -- order is specified and there is at least one component clause. Note:
57 -- component positions are normally adjusted as per AI95-0133, unless
58 -- -gnatd.p is used to restore original Ada 95 mode.
60 procedure Check_Record_Representation_Clause (N : Node_Id);
61 -- This procedure completes the analysis of a record representation clause
62 -- N. It is called at freeze time after adjustment of component clause bit
63 -- positions for possible non-standard bit order. In the case of Ada 2005
64 -- (machine scalar) mode, this adjustment can make substantial changes, so
65 -- some checks, in particular for component overlaps cannot be done at the
66 -- time the record representation clause is first seen, but must be delayed
67 -- till freeze time, and in particular is called after calling the above
68 -- procedure for adjusting record bit positions for reverse bit order.
70 procedure Initialize;
71 -- Initialize internal tables for new compilation
73 procedure Kill_Rep_Clause (N : Node_Id);
74 -- This procedure is called for a rep clause N when we are in -gnatI mode
75 -- (Ignore_Rep_Clauses). It replaces the node N with a null statement. This
76 -- is only called if Ignore_Rep_Clauses is True.
78 procedure Set_Enum_Esize (T : Entity_Id);
79 -- This routine sets the Esize field for an enumeration type T, based
80 -- on the current representation information available for T. Note that
81 -- the setting of the RM_Size field is not affected. This routine also
82 -- initializes the alignment field to zero.
84 function Minimum_Size
85 (T : Entity_Id;
86 Biased : Boolean := False) return Nat;
87 -- Given an elementary type, determines the minimum number of bits required
88 -- to represent all values of the type. This function may not be called
89 -- with any other types. If the flag Biased is set True, then the minimum
90 -- size calculation that biased representation is used in the case of a
91 -- discrete type, e.g. the range 7..8 gives a minimum size of 4 with
92 -- Biased set to False, and 1 with Biased set to True. Note that the
93 -- biased parameter only has an effect if the type is not biased, it
94 -- causes Minimum_Size to indicate the minimum size of an object with
95 -- the given type, of the size the type would have if it were biased. If
96 -- the type is already biased, then Minimum_Size returns the biased size,
97 -- regardless of the setting of Biased. Also, fixed-point types are never
98 -- biased in the current implementation. If the size is not known at
99 -- compile time, this function returns 0.
101 procedure Check_Constant_Address_Clause (Expr : Node_Id; U_Ent : Entity_Id);
102 -- Expr is an expression for an address clause. This procedure checks
103 -- that the expression is constant, in the limited sense that it is safe
104 -- to evaluate it at the point the object U_Ent is declared, rather than
105 -- at the point of the address clause. The condition for this to be true
106 -- is that the expression has no variables, no constants declared after
107 -- U_Ent, and no calls to non-pure functions. If this condition is not
108 -- met, then an appropriate error message is posted. This check is applied
109 -- at the point an object with an address clause is frozen, as well as for
110 -- address clauses for tasks and entries.
112 procedure Check_Size
113 (N : Node_Id;
114 T : Entity_Id;
115 Siz : Uint;
116 Biased : out Boolean);
117 -- Called when size Siz is specified for subtype T. This subprogram checks
118 -- that the size is appropriate, posting errors on node N as required.
119 -- This check is effective for elementary types and bit-packed arrays.
120 -- For other non-elementary types, a check is only made if an explicit
121 -- size has been given for the type (and the specified size must match).
122 -- The parameter Biased is set False if the size specified did not require
123 -- the use of biased representation, and True if biased representation
124 -- was required to meet the size requirement. Note that Biased is only
125 -- set if the type is not currently biased, but biasing it is the only
126 -- way to meet the requirement. If the type is currently biased, then
127 -- this biased size is used in the initial check, and Biased is False.
128 -- If the size is too small, and an error message is given, then both
129 -- Esize and RM_Size are reset to the allowed minimum value in T.
131 function Has_Compatible_Representation
132 (Target_Type, Operand_Type : Entity_Id) return Boolean;
133 -- Given two types, where the two types are related by possible derivation,
134 -- determines if the two types have compatible representation, or different
135 -- representations, requiring the special processing for representation
136 -- change. A False result is possible only for array, enumeration or
137 -- record types.
139 procedure Parse_Aspect_Aggregate
140 (N : Node_Id;
141 Empty_Subp : in out Node_Id;
142 Add_Named_Subp : in out Node_Id;
143 Add_Unnamed_Subp : in out Node_Id;
144 New_Indexed_Subp : in out Node_Id;
145 Assign_Indexed_Subp : in out Node_Id);
146 -- Utility to unpack the subprograms in an occurrence of aspect Aggregate;
147 -- used to verify the structure of the aspect, and resolve and expand an
148 -- aggregate for a container type that carries the aspect.
150 function Rep_Item_Too_Early (T : Entity_Id; N : Node_Id) return Boolean;
151 -- Called at start of processing a representation clause/pragma. Used to
152 -- check that the representation item is not being applied to an incomplete
153 -- type or to a generic formal type or a type derived from a generic formal
154 -- type. Returns False if no such error occurs. If this error does occur,
155 -- appropriate error messages are posted on node N, and True is returned.
157 generic
158 with procedure Replace_Type_Reference (N : Node_Id);
159 procedure Replace_Type_References_Generic (N : Node_Id; T : Entity_Id);
160 -- This is used to scan an expression for a predicate or invariant aspect
161 -- replacing occurrences of the name of the subtype to which the aspect
162 -- applies with appropriate references to the parameter of the predicate
163 -- function or invariant procedure. The procedure passed as a generic
164 -- parameter does the actual replacement of node N, which is either a
165 -- simple direct reference to T, or a selected component that represents
166 -- an appropriately qualified occurrence of T.
168 -- This also replaces each reference to a component, entry, or protected
169 -- procedure with a selected component whose prefix is the parameter.
170 -- For example, Component_Name becomes Parameter.Component_Name, where
171 -- Parameter is the parameter, which is of type T.
173 function Rep_Item_Too_Late
174 (T : Entity_Id;
175 N : Node_Id;
176 FOnly : Boolean := False) return Boolean;
177 -- Called at the start of processing a representation clause or a
178 -- representation pragma. Used to check that a representation item for
179 -- entity T does not appear too late (according to the rules in RM 13.1(9)
180 -- and RM 13.1(10)). N is the associated node, which in the pragma case
181 -- is the pragma or representation clause itself, used for placing error
182 -- messages if the item is too late.
184 -- FOnly is a flag that causes only the freezing rule (para 9) to be
185 -- applied, and the tests of para 10 are skipped. This is appropriate for
186 -- both subtype related attributes (Alignment and Size) and for stream
187 -- attributes, which, although certainly not subtype related attributes,
188 -- clearly should not be subject to the para 10 restrictions (see
189 -- AI95-00137). Similarly, we also skip the para 10 restrictions for
190 -- the Storage_Size case where they also clearly do not apply, and for
191 -- Stream_Convert which is in the same category as the stream attributes.
193 -- If the rep item is too late, an appropriate message is output and True
194 -- is returned, which is a signal that the caller should abandon processing
195 -- for the item. If the item is not too late, then False is returned, and
196 -- the caller can continue processing the item.
198 -- If no error is detected, this call also as a side effect links the
199 -- representation item onto the head of the representation item chain
200 -- (referenced by the First_Rep_Item field of the entity).
202 -- Note: Rep_Item_Too_Late must be called with the underlying type in the
203 -- case of a private or incomplete type. The protocol is to first check for
204 -- Rep_Item_Too_Early using the initial entity, then take the underlying
205 -- type, then call Rep_Item_Too_Late on the result.
207 -- Note: Calls to Rep_Item_Too_Late are ignored for the case of attribute
208 -- definition clauses which have From_Aspect_Specification set. This is
209 -- because such clauses are linked on to the Rep_Item chain in procedure
210 -- Sem_Ch13.Analyze_Aspect_Specifications. See that procedure for details.
212 procedure Validate_Unchecked_Conversion
213 (N : Node_Id;
214 Act_Unit : Entity_Id);
215 -- Validate a call to unchecked conversion. N is the node for the actual
216 -- instantiation, which is used only for error messages. Act_Unit is the
217 -- entity for the instantiation, from which the actual types etc. for this
218 -- instantiation can be determined. This procedure makes an entry in a
219 -- table and/or generates an N_Validate_Unchecked_Conversion node. The
220 -- actual checking is done in Validate_Unchecked_Conversions or in the
221 -- back end as required.
223 procedure Validate_Unchecked_Conversions;
224 -- This routine is called after calling the back end to validate unchecked
225 -- conversions for size and alignment appropriateness. The reason it is
226 -- called that late is to take advantage of any back-annotation of size
227 -- and alignment performed by the back end.
229 procedure Validate_Address_Clauses;
230 -- This is called after the back end has been called (and thus after the
231 -- alignments of objects have been back annotated). It goes through the
232 -- table of saved address clauses checking for suspicious alignments and
233 -- if necessary issuing warnings.
235 procedure Validate_Independence;
236 -- This is called after the back end has been called (and thus after the
237 -- layout of components has been back annotated). It goes through the
238 -- table of saved pragma Independent[_Component] entries, checking that
239 -- independence can be achieved, and if necessary issuing error messages.
241 -------------------------------------
242 -- Table for Validate_Independence --
243 -------------------------------------
245 -- If a legal pragma Independent or Independent_Components is given for
246 -- an entity, then an entry is made in this table, to be checked by a
247 -- call to Validate_Independence after back annotation of layout is done.
249 type Independence_Check_Record is record
250 N : Node_Id;
251 -- The pragma Independent or Independent_Components
253 E : Entity_Id;
254 -- The entity to which it applies
255 end record;
257 package Independence_Checks is new Table.Table (
258 Table_Component_Type => Independence_Check_Record,
259 Table_Index_Type => Int,
260 Table_Low_Bound => 1,
261 Table_Initial => 20,
262 Table_Increment => 200,
263 Table_Name => "Independence_Checks");
265 -----------------------------------
266 -- Handling of Aspect Visibility --
267 -----------------------------------
269 -- The visibility of aspects is tricky. First, the visibility is delayed
270 -- to the freeze point. This is not too complicated, what we do is simply
271 -- to leave the aspect "laying in wait" for the freeze point, and at that
272 -- point materialize and analyze the corresponding attribute definition
273 -- clause or pragma. There is some special processing for preconditions
274 -- and postonditions, where the pragmas themselves deal with the required
275 -- delay, but basically the approach is the same, delay analysis of the
276 -- expression to the freeze point.
278 -- Much harder is the requirement for diagnosing cases in which an early
279 -- freeze causes a change in visibility. Consider:
281 -- package AspectVis is
282 -- R_Size : constant Integer := 32;
284 -- package Inner is
285 -- type R is new Integer with
286 -- Size => R_Size;
287 -- F : R; -- freezes
288 -- R_Size : constant Integer := 64;
289 -- S : constant Integer := R'Size; -- 32 not 64
290 -- end Inner;
291 -- end AspectVis;
293 -- Here the 32 not 64 shows what would be expected if this program were
294 -- legal, since the evaluation of R_Size has to be done at the freeze
295 -- point and gets the outer definition not the inner one.
297 -- But the language rule requires this program to be diagnosed as illegal
298 -- because the visibility changes between the freeze point and the end of
299 -- the declarative region.
301 -- To meet this requirement, we first note that the Expression field of the
302 -- N_Aspect_Specification node holds the raw unanalyzed expression, which
303 -- will get used in processing the aspect. At the time of analyzing the
304 -- N_Aspect_Specification node, we create a complete copy of the expression
305 -- and store it in the entity field of the Identifier (an odd usage, but
306 -- the identifier is not used except to identify the aspect, so its Entity
307 -- field is otherwise unused, and we are short of room in the node).
309 -- This copy stays unanalyzed up to the freeze point, where we analyze the
310 -- resulting pragma or attribute definition clause, except that in the
311 -- case of invariants and predicates, we mark occurrences of the subtype
312 -- name as having the entity of the subprogram parameter, so that they
313 -- will not cause trouble in the following steps.
315 -- Then at the freeze point, we create another copy of this unanalyzed
316 -- expression. By this time we no longer need the Expression field for
317 -- other purposes, so we can store it there. Now we have two copies of
318 -- the original unanalyzed expression. One of them gets preanalyzed at
319 -- the freeze point to capture the visibility at the freeze point.
321 -- Now when we hit the freeze all at the end of the declarative part, if
322 -- we come across a frozen entity with delayed aspects, we still have one
323 -- copy of the unanalyzed expression available in the node, and we again
324 -- do a preanalysis using that copy and the visibility at the end of the
325 -- declarative part. Now we have two preanalyzed expression (preanalysis
326 -- is good enough, since we are only interested in referenced entities).
327 -- One captures the visibility at the freeze point, the other captures the
328 -- visibility at the end of the declarative part. We see if the entities
329 -- in these two expressions are the same, by seeing if the two expressions
330 -- are fully conformant, and if not, issue appropriate error messages.
332 -- Quite an awkward approach, but this is an awkard requirement
334 procedure Analyze_Aspects_At_Freeze_Point (E : Entity_Id);
335 -- Analyze all the delayed aspects for entity E at freezing point. This
336 -- includes dealing with inheriting delayed aspects from the parent type
337 -- in the case where a derived type is frozen.
339 procedure Check_Aspect_At_Freeze_Point (ASN : Node_Id);
340 -- Performs the processing described above at the freeze point, ASN is the
341 -- N_Aspect_Specification node for the aspect.
343 procedure Check_Aspect_At_End_Of_Declarations (ASN : Node_Id);
344 -- Performs the processing described above at the freeze all point, and
345 -- issues appropriate error messages if the visibility has indeed changed.
346 -- Again, ASN is the N_Aspect_Specification node for the aspect.
348 procedure Inherit_Aspects_At_Freeze_Point (Typ : Entity_Id);
349 -- Given an entity Typ that denotes a derived type or a subtype, this
350 -- routine performs the inheritance of aspects at the freeze point.
352 procedure Resolve_Aspect_Expressions (E : Entity_Id);
353 -- Name resolution of an aspect expression happens at the end of the
354 -- current declarative part or at the freeze point for the entity,
355 -- whichever comes first. For declarations in the visible part of a
356 -- package, name resolution takes place before analysis of the private
357 -- part even though the freeze point of the entity may appear later.
359 procedure Validate_Iterable_Aspect (Typ : Entity_Id; ASN : Node_Id);
360 -- For SPARK 2014 formal containers. The expression has the form of an
361 -- aggregate, and each entry must denote a function with the proper syntax
362 -- for First, Next, and Has_Element. Optionally an Element primitive may
363 -- also be defined.
365 procedure Validate_Literal_Aspect (Typ : Entity_Id; ASN : Node_Id);
366 -- Check legality of Integer_Literal, Real_Literal, and String_Literal
367 -- aspect specifications.
369 procedure Install_Discriminants (E : Entity_Id);
370 -- Make visible the discriminants of type entity E
372 procedure Uninstall_Discriminants (E : Entity_Id);
373 -- Remove visibility to the discriminants of type entity E
375 end Sem_Ch13;