1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2017, Free Software Foundation, Inc. --
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. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Aspects; use Aspects;
27 with Atree; use Atree;
28 with Checks; use Checks;
29 with Debug; use Debug;
30 with Einfo; use Einfo;
31 with Elists; use Elists;
32 with Errout; use Errout;
33 with Expander; use Expander;
34 with Exp_Disp; use Exp_Disp;
35 with Exp_Tss; use Exp_Tss;
36 with Exp_Util; use Exp_Util;
37 with Freeze; use Freeze;
38 with Ghost; use Ghost;
40 with Lib.Xref; use Lib.Xref;
41 with Namet; use Namet;
42 with Nlists; use Nlists;
43 with Nmake; use Nmake;
45 with Par_SCO; use Par_SCO;
46 with Restrict; use Restrict;
47 with Rident; use Rident;
48 with Rtsfind; use Rtsfind;
50 with Sem_Aux; use Sem_Aux;
51 with Sem_Case; use Sem_Case;
52 with Sem_Ch3; use Sem_Ch3;
53 with Sem_Ch6; use Sem_Ch6;
54 with Sem_Ch7; use Sem_Ch7;
55 with Sem_Ch8; use Sem_Ch8;
56 with Sem_Dim; use Sem_Dim;
57 with Sem_Disp; use Sem_Disp;
58 with Sem_Eval; use Sem_Eval;
59 with Sem_Prag; use Sem_Prag;
60 with Sem_Res; use Sem_Res;
61 with Sem_Type; use Sem_Type;
62 with Sem_Util; use Sem_Util;
63 with Sem_Warn; use Sem_Warn;
64 with Sinfo; use Sinfo;
65 with Sinput; use Sinput;
66 with Snames; use Snames;
67 with Stand; use Stand;
68 with Targparm; use Targparm;
69 with Ttypes; use Ttypes;
70 with Tbuild; use Tbuild;
71 with Urealp; use Urealp;
72 with Warnsw; use Warnsw;
74 with GNAT.Heap_Sort_G;
76 package body Sem_Ch13 is
78 SSU : constant Pos := System_Storage_Unit;
79 -- Convenient short hand for commonly used constant
81 -----------------------
82 -- Local Subprograms --
83 -----------------------
85 procedure Adjust_Record_For_Reverse_Bit_Order_Ada_95 (R : Entity_Id);
86 -- Helper routine providing the original (pre-AI95-0133) behavior for
87 -- Adjust_Record_For_Reverse_Bit_Order.
89 procedure Alignment_Check_For_Size_Change (Typ : Entity_Id; Size : Uint);
90 -- This routine is called after setting one of the sizes of type entity
91 -- Typ to Size. The purpose is to deal with the situation of a derived
92 -- type whose inherited alignment is no longer appropriate for the new
93 -- size value. In this case, we reset the Alignment to unknown.
95 procedure Build_Discrete_Static_Predicate
99 -- Given a predicated type Typ, where Typ is a discrete static subtype,
100 -- whose predicate expression is Expr, tests if Expr is a static predicate,
101 -- and if so, builds the predicate range list. Nam is the name of the one
102 -- argument to the predicate function. Occurrences of the type name in the
103 -- predicate expression have been replaced by identifier references to this
104 -- name, which is unique, so any identifier with Chars matching Nam must be
105 -- a reference to the type. If the predicate is non-static, this procedure
106 -- returns doing nothing. If the predicate is static, then the predicate
107 -- list is stored in Static_Discrete_Predicate (Typ), and the Expr is
108 -- rewritten as a canonicalized membership operation.
110 function Build_Export_Import_Pragma
112 Id : Entity_Id) return Node_Id;
113 -- Create the corresponding pragma for aspect Export or Import denoted by
114 -- Asp. Id is the related entity subject to the aspect. Return Empty when
115 -- the expression of aspect Asp evaluates to False or is erroneous.
117 function Build_Predicate_Function_Declaration
118 (Typ : Entity_Id) return Node_Id;
119 -- Build the declaration for a predicate function. The declaration is built
120 -- at the end of the declarative part containing the type definition, which
121 -- may be before the freeze point of the type. The predicate expression is
122 -- pre-analyzed at this point, to catch visibility errors.
124 procedure Build_Predicate_Functions (Typ : Entity_Id; N : Node_Id);
125 -- If Typ has predicates (indicated by Has_Predicates being set for Typ),
126 -- then either there are pragma Predicate entries on the rep chain for the
127 -- type (note that Predicate aspects are converted to pragma Predicate), or
128 -- there are inherited aspects from a parent type, or ancestor subtypes.
129 -- This procedure builds body for the Predicate function that tests these
130 -- predicates. N is the freeze node for the type. The spec of the function
131 -- is inserted before the freeze node, and the body of the function is
132 -- inserted after the freeze node. If the predicate expression has a least
133 -- one Raise_Expression, then this procedure also builds the M version of
134 -- the predicate function for use in membership tests.
136 procedure Check_Pool_Size_Clash (Ent : Entity_Id; SP, SS : Node_Id);
137 -- Called if both Storage_Pool and Storage_Size attribute definition
138 -- clauses (SP and SS) are present for entity Ent. Issue error message.
140 procedure Freeze_Entity_Checks (N : Node_Id);
141 -- Called from Analyze_Freeze_Entity and Analyze_Generic_Freeze Entity
142 -- to generate appropriate semantic checks that are delayed until this
143 -- point (they had to be delayed this long for cases of delayed aspects,
144 -- e.g. analysis of statically predicated subtypes in choices, for which
145 -- we have to be sure the subtypes in question are frozen before checking).
147 function Get_Alignment_Value (Expr : Node_Id) return Uint;
148 -- Given the expression for an alignment value, returns the corresponding
149 -- Uint value. If the value is inappropriate, then error messages are
150 -- posted as required, and a value of No_Uint is returned.
152 function Is_Operational_Item (N : Node_Id) return Boolean;
153 -- A specification for a stream attribute is allowed before the full type
154 -- is declared, as explained in AI-00137 and the corrigendum. Attributes
155 -- that do not specify a representation characteristic are operational
158 function Is_Predicate_Static
160 Nam : Name_Id) return Boolean;
161 -- Given predicate expression Expr, tests if Expr is predicate-static in
162 -- the sense of the rules in (RM 3.2.4 (15-24)). Occurrences of the type
163 -- name in the predicate expression have been replaced by references to
164 -- an identifier whose Chars field is Nam. This name is unique, so any
165 -- identifier with Chars matching Nam must be a reference to the type.
166 -- Returns True if the expression is predicate-static and False otherwise,
167 -- but is not in the business of setting flags or issuing error messages.
169 -- Only scalar types can have static predicates, so False is always
170 -- returned for non-scalar types.
172 -- Note: the RM seems to suggest that string types can also have static
173 -- predicates. But that really makes lttle sense as very few useful
174 -- predicates can be constructed for strings. Remember that:
178 -- is not a static expression. So even though the clearly faulty RM wording
179 -- allows the following:
181 -- subtype S is String with Static_Predicate => S < "DEF"
183 -- We can't allow this, otherwise we have predicate-static applying to a
184 -- larger class than static expressions, which was never intended.
186 procedure New_Stream_Subprogram
190 Nam : TSS_Name_Type);
191 -- Create a subprogram renaming of a given stream attribute to the
192 -- designated subprogram and then in the tagged case, provide this as a
193 -- primitive operation, or in the untagged case make an appropriate TSS
194 -- entry. This is more properly an expansion activity than just semantics,
195 -- but the presence of user-defined stream functions for limited types
196 -- is a legality check, which is why this takes place here rather than in
197 -- exp_ch13, where it was previously. Nam indicates the name of the TSS
198 -- function to be generated.
200 -- To avoid elaboration anomalies with freeze nodes, for untagged types
201 -- we generate both a subprogram declaration and a subprogram renaming
202 -- declaration, so that the attribute specification is handled as a
203 -- renaming_as_body. For tagged types, the specification is one of the
206 procedure Resolve_Iterable_Operation
211 -- If the name of a primitive operation for an Iterable aspect is
212 -- overloaded, resolve according to required signature.
218 Biased : Boolean := True);
219 -- If Biased is True, sets Has_Biased_Representation flag for E, and
220 -- outputs a warning message at node N if Warn_On_Biased_Representation is
221 -- is True. This warning inserts the string Msg to describe the construct
224 ---------------------------------------------------
225 -- Table for Validate_Compile_Time_Warning_Error --
226 ---------------------------------------------------
228 -- The following table collects pragmas Compile_Time_Error and Compile_
229 -- Time_Warning for validation. Entries are made by calls to subprogram
230 -- Validate_Compile_Time_Warning_Error, and the call to the procedure
231 -- Validate_Compile_Time_Warning_Errors does the actual error checking
232 -- and posting of warning and error messages. The reason for this delayed
233 -- processing is to take advantage of back-annotations of attributes size
234 -- and alignment values performed by the back end.
236 -- Note: the reason we store a Source_Ptr value instead of a Node_Id is
237 -- that by the time Validate_Unchecked_Conversions is called, Sprint will
238 -- already have modified all Sloc values if the -gnatD option is set.
240 type CTWE_Entry is record
242 -- Source location used in warnings and error messages
245 -- Pragma Compile_Time_Error or Compile_Time_Warning
248 -- The scope which encloses the pragma
251 package Compile_Time_Warnings_Errors is new Table.Table (
252 Table_Component_Type => CTWE_Entry,
253 Table_Index_Type => Int,
254 Table_Low_Bound => 1,
256 Table_Increment => 200,
257 Table_Name => "Compile_Time_Warnings_Errors");
259 ----------------------------------------------
260 -- Table for Validate_Unchecked_Conversions --
261 ----------------------------------------------
263 -- The following table collects unchecked conversions for validation.
264 -- Entries are made by Validate_Unchecked_Conversion and then the call
265 -- to Validate_Unchecked_Conversions does the actual error checking and
266 -- posting of warnings. The reason for this delayed processing is to take
267 -- advantage of back-annotations of size and alignment values performed by
270 -- Note: the reason we store a Source_Ptr value instead of a Node_Id is
271 -- that by the time Validate_Unchecked_Conversions is called, Sprint will
272 -- already have modified all Sloc values if the -gnatD option is set.
274 type UC_Entry is record
275 Eloc : Source_Ptr; -- node used for posting warnings
276 Source : Entity_Id; -- source type for unchecked conversion
277 Target : Entity_Id; -- target type for unchecked conversion
278 Act_Unit : Entity_Id; -- actual function instantiated
281 package Unchecked_Conversions is new Table.Table (
282 Table_Component_Type => UC_Entry,
283 Table_Index_Type => Int,
284 Table_Low_Bound => 1,
286 Table_Increment => 200,
287 Table_Name => "Unchecked_Conversions");
289 ----------------------------------------
290 -- Table for Validate_Address_Clauses --
291 ----------------------------------------
293 -- If an address clause has the form
295 -- for X'Address use Expr
297 -- where Expr has a value known at compile time or is of the form Y'Address
298 -- or recursively is a reference to a constant initialized with either of
299 -- these forms, and the value of Expr is not a multiple of X's alignment,
300 -- or if Y has a smaller alignment than X, then that merits a warning about
301 -- possible bad alignment. The following table collects address clauses of
302 -- this kind. We put these in a table so that they can be checked after the
303 -- back end has completed annotation of the alignments of objects, since we
304 -- can catch more cases that way.
306 type Address_Clause_Check_Record is record
308 -- The address clause
311 -- The entity of the object subject to the address clause
314 -- The value of the address in the first case
317 -- The entity of the object being overlaid in the second case
320 -- Whether the address is offset within Y in the second case
323 package Address_Clause_Checks is new Table.Table (
324 Table_Component_Type => Address_Clause_Check_Record,
325 Table_Index_Type => Int,
326 Table_Low_Bound => 1,
328 Table_Increment => 200,
329 Table_Name => "Address_Clause_Checks");
331 -----------------------------------------
332 -- Adjust_Record_For_Reverse_Bit_Order --
333 -----------------------------------------
335 procedure Adjust_Record_For_Reverse_Bit_Order (R : Entity_Id) is
336 Max_Machine_Scalar_Size : constant Uint :=
338 (Standard_Long_Long_Integer_Size);
339 -- We use this as the maximum machine scalar size
341 SSU : constant Uint := UI_From_Int (System_Storage_Unit);
348 -- Processing here used to depend on Ada version: the behavior was
349 -- changed by AI95-0133. However this AI is a Binding interpretation,
350 -- so we now implement it even in Ada 95 mode. The original behavior
351 -- from unamended Ada 95 is still available for compatibility under
352 -- debugging switch -gnatd.
354 if Ada_Version < Ada_2005 and then Debug_Flag_Dot_P then
355 Adjust_Record_For_Reverse_Bit_Order_Ada_95 (R);
359 -- For Ada 2005, we do machine scalar processing, as fully described In
360 -- AI-133. This involves gathering all components which start at the
361 -- same byte offset and processing them together. Same approach is still
362 -- valid in later versions including Ada 2012.
364 -- This first loop through components does two things. First it deals
365 -- with the case of components with component clauses whose length is
366 -- greater than the maximum machine scalar size (either accepting them
367 -- or rejecting as needed). Second, it counts the number of components
368 -- with component clauses whose length does not exceed this maximum for
372 Comp := First_Component_Or_Discriminant (R);
373 while Present (Comp) loop
374 CC := Component_Clause (Comp);
378 Fbit : constant Uint := Static_Integer (First_Bit (CC));
379 Lbit : constant Uint := Static_Integer (Last_Bit (CC));
382 -- Case of component with last bit >= max machine scalar
384 if Lbit >= Max_Machine_Scalar_Size then
386 -- This is allowed only if first bit is zero, and last bit
387 -- + 1 is a multiple of storage unit size.
389 if Fbit = 0 and then (Lbit + 1) mod SSU = 0 then
391 -- This is the case to give a warning if enabled
393 if Warn_On_Reverse_Bit_Order then
395 ("info: multi-byte field specified with "
396 & "non-standard Bit_Order?V?", CC);
398 if Bytes_Big_Endian then
400 ("\bytes are not reversed "
401 & "(component is big-endian)?V?", CC);
404 ("\bytes are not reversed "
405 & "(component is little-endian)?V?", CC);
409 -- Give error message for RM 13.5.1(10) violation
413 ("machine scalar rules not followed for&",
414 First_Bit (CC), Comp);
416 Error_Msg_Uint_1 := Lbit + 1;
417 Error_Msg_Uint_2 := Max_Machine_Scalar_Size;
419 ("\last bit + 1 (^) exceeds maximum machine scalar "
420 & "size (^)", First_Bit (CC));
422 if (Lbit + 1) mod SSU /= 0 then
423 Error_Msg_Uint_1 := SSU;
425 ("\and is not a multiple of Storage_Unit (^) "
426 & "(RM 13.5.1(10))", First_Bit (CC));
429 Error_Msg_Uint_1 := Fbit;
431 ("\and first bit (^) is non-zero "
432 & "(RM 13.4.1(10))", First_Bit (CC));
436 -- OK case of machine scalar related component clause. For now,
440 Num_CC := Num_CC + 1;
445 Next_Component_Or_Discriminant (Comp);
448 -- We need to sort the component clauses on the basis of the Position
449 -- values in the clause, so we can group clauses with the same Position
450 -- together to determine the relevant machine scalar size.
453 Comps : array (0 .. Num_CC) of Entity_Id;
454 -- Array to collect component and discriminant entities. The data
455 -- starts at index 1, the 0'th entry is for the sort routine.
457 function CP_Lt (Op1, Op2 : Natural) return Boolean;
458 -- Compare routine for Sort
460 procedure CP_Move (From : Natural; To : Natural);
461 -- Move routine for Sort
463 package Sorting is new GNAT.Heap_Sort_G (CP_Move, CP_Lt);
466 -- Maximum last bit value of any component in this set
469 -- Corresponding machine scalar size
473 -- Start and stop positions in the component list of the set of
474 -- components with the same starting position (that constitute
475 -- components in a single machine scalar).
481 function CP_Lt (Op1, Op2 : Natural) return Boolean is
484 Position (Component_Clause (Comps (Op1))) <
485 Position (Component_Clause (Comps (Op2)));
492 procedure CP_Move (From : Natural; To : Natural) is
494 Comps (To) := Comps (From);
497 -- Start of processing for Sort_CC
500 -- Collect the machine scalar relevant component clauses
503 Comp := First_Component_Or_Discriminant (R);
504 while Present (Comp) loop
506 CC : constant Node_Id := Component_Clause (Comp);
509 -- Collect only component clauses whose last bit is less than
510 -- machine scalar size. Any component clause whose last bit
511 -- exceeds this value does not take part in machine scalar
512 -- layout considerations. The test for Error_Posted makes sure
513 -- we exclude component clauses for which we already posted an
517 and then not Error_Posted (Last_Bit (CC))
518 and then Static_Integer (Last_Bit (CC)) <
519 Max_Machine_Scalar_Size
521 Num_CC := Num_CC + 1;
522 Comps (Num_CC) := Comp;
526 Next_Component_Or_Discriminant (Comp);
529 -- Sort by ascending position number
531 Sorting.Sort (Num_CC);
533 -- We now have all the components whose size does not exceed the max
534 -- machine scalar value, sorted by starting position. In this loop we
535 -- gather groups of clauses starting at the same position, to process
536 -- them in accordance with AI-133.
539 while Stop < Num_CC loop
544 (Last_Bit (Component_Clause (Comps (Start))));
545 while Stop < Num_CC loop
547 (Position (Component_Clause (Comps (Stop + 1)))) =
549 (Position (Component_Clause (Comps (Stop))))
557 (Component_Clause (Comps (Stop)))));
563 -- Now we have a group of component clauses from Start to Stop
564 -- whose positions are identical, and MaxL is the maximum last
565 -- bit value of any of these components.
567 -- We need to determine the corresponding machine scalar size.
568 -- This loop assumes that machine scalar sizes are even, and that
569 -- each possible machine scalar has twice as many bits as the next
572 MSS := Max_Machine_Scalar_Size;
574 and then (MSS / 2) >= SSU
575 and then (MSS / 2) > MaxL
580 -- Here is where we fix up the Component_Bit_Offset value to
581 -- account for the reverse bit order. Some examples of what needs
582 -- to be done for the case of a machine scalar size of 8 are:
584 -- First_Bit .. Last_Bit Component_Bit_Offset
596 -- The rule is that the first bit is obtained by subtracting the
597 -- old ending bit from machine scalar size - 1.
599 for C in Start .. Stop loop
601 Comp : constant Entity_Id := Comps (C);
602 CC : constant Node_Id := Component_Clause (Comp);
604 LB : constant Uint := Static_Integer (Last_Bit (CC));
605 NFB : constant Uint := MSS - Uint_1 - LB;
606 NLB : constant Uint := NFB + Esize (Comp) - 1;
607 Pos : constant Uint := Static_Integer (Position (CC));
610 if Warn_On_Reverse_Bit_Order then
611 Error_Msg_Uint_1 := MSS;
613 ("info: reverse bit order in machine scalar of "
614 & "length^?V?", First_Bit (CC));
615 Error_Msg_Uint_1 := NFB;
616 Error_Msg_Uint_2 := NLB;
618 if Bytes_Big_Endian then
620 ("\big-endian range for component & is ^ .. ^?V?",
621 First_Bit (CC), Comp);
624 ("\little-endian range for component & is ^ .. ^?V?",
625 First_Bit (CC), Comp);
629 Set_Component_Bit_Offset (Comp, Pos * SSU + NFB);
630 Set_Normalized_First_Bit (Comp, NFB mod SSU);
635 end Adjust_Record_For_Reverse_Bit_Order;
637 ------------------------------------------------
638 -- Adjust_Record_For_Reverse_Bit_Order_Ada_95 --
639 ------------------------------------------------
641 procedure Adjust_Record_For_Reverse_Bit_Order_Ada_95 (R : Entity_Id) is
646 -- For Ada 95, we just renumber bits within a storage unit. We do the
647 -- same for Ada 83 mode, since we recognize the Bit_Order attribute in
648 -- Ada 83, and are free to add this extension.
650 Comp := First_Component_Or_Discriminant (R);
651 while Present (Comp) loop
652 CC := Component_Clause (Comp);
654 -- If component clause is present, then deal with the non-default
655 -- bit order case for Ada 95 mode.
657 -- We only do this processing for the base type, and in fact that
658 -- is important, since otherwise if there are record subtypes, we
659 -- could reverse the bits once for each subtype, which is wrong.
661 if Present (CC) and then Ekind (R) = E_Record_Type then
663 CFB : constant Uint := Component_Bit_Offset (Comp);
664 CSZ : constant Uint := Esize (Comp);
665 CLC : constant Node_Id := Component_Clause (Comp);
666 Pos : constant Node_Id := Position (CLC);
667 FB : constant Node_Id := First_Bit (CLC);
669 Storage_Unit_Offset : constant Uint :=
670 CFB / System_Storage_Unit;
672 Start_Bit : constant Uint :=
673 CFB mod System_Storage_Unit;
676 -- Cases where field goes over storage unit boundary
678 if Start_Bit + CSZ > System_Storage_Unit then
680 -- Allow multi-byte field but generate warning
682 if Start_Bit mod System_Storage_Unit = 0
683 and then CSZ mod System_Storage_Unit = 0
686 ("info: multi-byte field specified with non-standard "
687 & "Bit_Order?V?", CLC);
689 if Bytes_Big_Endian then
691 ("\bytes are not reversed "
692 & "(component is big-endian)?V?", CLC);
695 ("\bytes are not reversed "
696 & "(component is little-endian)?V?", CLC);
699 -- Do not allow non-contiguous field
703 ("attempt to specify non-contiguous field not "
706 ("\caused by non-standard Bit_Order specified in "
707 & "legacy Ada 95 mode", CLC);
710 -- Case where field fits in one storage unit
713 -- Give warning if suspicious component clause
715 if Intval (FB) >= System_Storage_Unit
716 and then Warn_On_Reverse_Bit_Order
719 ("info: Bit_Order clause does not affect byte "
720 & "ordering?V?", Pos);
722 Intval (Pos) + Intval (FB) /
725 ("info: position normalized to ^ before bit order "
726 & "interpreted?V?", Pos);
729 -- Here is where we fix up the Component_Bit_Offset value
730 -- to account for the reverse bit order. Some examples of
731 -- what needs to be done are:
733 -- First_Bit .. Last_Bit Component_Bit_Offset
745 -- The rule is that the first bit is is obtained by
746 -- subtracting the old ending bit from storage_unit - 1.
748 Set_Component_Bit_Offset (Comp,
749 (Storage_Unit_Offset * System_Storage_Unit) +
750 (System_Storage_Unit - 1) -
751 (Start_Bit + CSZ - 1));
753 Set_Normalized_First_Bit (Comp,
754 Component_Bit_Offset (Comp) mod System_Storage_Unit);
759 Next_Component_Or_Discriminant (Comp);
761 end Adjust_Record_For_Reverse_Bit_Order_Ada_95;
763 -------------------------------------
764 -- Alignment_Check_For_Size_Change --
765 -------------------------------------
767 procedure Alignment_Check_For_Size_Change (Typ : Entity_Id; Size : Uint) is
769 -- If the alignment is known, and not set by a rep clause, and is
770 -- inconsistent with the size being set, then reset it to unknown,
771 -- we assume in this case that the size overrides the inherited
772 -- alignment, and that the alignment must be recomputed.
774 if Known_Alignment (Typ)
775 and then not Has_Alignment_Clause (Typ)
776 and then Size mod (Alignment (Typ) * SSU) /= 0
778 Init_Alignment (Typ);
780 end Alignment_Check_For_Size_Change;
782 -------------------------------------
783 -- Analyze_Aspects_At_Freeze_Point --
784 -------------------------------------
786 procedure Analyze_Aspects_At_Freeze_Point (E : Entity_Id) is
787 procedure Analyze_Aspect_Default_Value (ASN : Node_Id);
788 -- This routine analyzes an Aspect_Default_[Component_]Value denoted by
789 -- the aspect specification node ASN.
791 procedure Inherit_Delayed_Rep_Aspects (ASN : Node_Id);
792 -- As discussed in the spec of Aspects (see Aspect_Delay declaration),
793 -- a derived type can inherit aspects from its parent which have been
794 -- specified at the time of the derivation using an aspect, as in:
796 -- type A is range 1 .. 10
797 -- with Size => Not_Defined_Yet;
801 -- Not_Defined_Yet : constant := 64;
803 -- In this example, the Size of A is considered to be specified prior
804 -- to the derivation, and thus inherited, even though the value is not
805 -- known at the time of derivation. To deal with this, we use two entity
806 -- flags. The flag Has_Derived_Rep_Aspects is set in the parent type (A
807 -- here), and then the flag May_Inherit_Delayed_Rep_Aspects is set in
808 -- the derived type (B here). If this flag is set when the derived type
809 -- is frozen, then this procedure is called to ensure proper inheritance
810 -- of all delayed aspects from the parent type. The derived type is E,
811 -- the argument to Analyze_Aspects_At_Freeze_Point. ASN is the first
812 -- aspect specification node in the Rep_Item chain for the parent type.
814 procedure Make_Pragma_From_Boolean_Aspect (ASN : Node_Id);
815 -- Given an aspect specification node ASN whose expression is an
816 -- optional Boolean, this routines creates the corresponding pragma
817 -- at the freezing point.
819 ----------------------------------
820 -- Analyze_Aspect_Default_Value --
821 ----------------------------------
823 procedure Analyze_Aspect_Default_Value (ASN : Node_Id) is
824 A_Id : constant Aspect_Id := Get_Aspect_Id (ASN);
825 Ent : constant Entity_Id := Entity (ASN);
826 Expr : constant Node_Id := Expression (ASN);
827 Id : constant Node_Id := Identifier (ASN);
830 Error_Msg_Name_1 := Chars (Id);
832 if not Is_Type (Ent) then
833 Error_Msg_N ("aspect% can only apply to a type", Id);
836 elsif not Is_First_Subtype (Ent) then
837 Error_Msg_N ("aspect% cannot apply to subtype", Id);
840 elsif A_Id = Aspect_Default_Value
841 and then not Is_Scalar_Type (Ent)
843 Error_Msg_N ("aspect% can only be applied to scalar type", Id);
846 elsif A_Id = Aspect_Default_Component_Value then
847 if not Is_Array_Type (Ent) then
848 Error_Msg_N ("aspect% can only be applied to array type", Id);
851 elsif not Is_Scalar_Type (Component_Type (Ent)) then
852 Error_Msg_N ("aspect% requires scalar components", Id);
857 Set_Has_Default_Aspect (Base_Type (Ent));
859 if Is_Scalar_Type (Ent) then
860 Set_Default_Aspect_Value (Base_Type (Ent), Expr);
862 Set_Default_Aspect_Component_Value (Base_Type (Ent), Expr);
864 end Analyze_Aspect_Default_Value;
866 ---------------------------------
867 -- Inherit_Delayed_Rep_Aspects --
868 ---------------------------------
870 procedure Inherit_Delayed_Rep_Aspects (ASN : Node_Id) is
871 A_Id : constant Aspect_Id := Get_Aspect_Id (ASN);
872 P : constant Entity_Id := Entity (ASN);
873 -- Entithy for parent type
876 -- Item from Rep_Item chain
881 -- Loop through delayed aspects for the parent type
884 while Present (N) loop
885 if Nkind (N) = N_Aspect_Specification then
886 exit when Entity (N) /= P;
888 if Is_Delayed_Aspect (N) then
889 A := Get_Aspect_Id (Chars (Identifier (N)));
891 -- Process delayed rep aspect. For Boolean attributes it is
892 -- not possible to cancel an attribute once set (the attempt
893 -- to use an aspect with xxx => False is an error) for a
894 -- derived type. So for those cases, we do not have to check
895 -- if a clause has been given for the derived type, since it
896 -- is harmless to set it again if it is already set.
902 when Aspect_Alignment =>
903 if not Has_Alignment_Clause (E) then
904 Set_Alignment (E, Alignment (P));
909 when Aspect_Atomic =>
910 if Is_Atomic (P) then
916 when Aspect_Atomic_Components =>
917 if Has_Atomic_Components (P) then
918 Set_Has_Atomic_Components (Base_Type (E));
923 when Aspect_Bit_Order =>
924 if Is_Record_Type (E)
925 and then No (Get_Attribute_Definition_Clause
926 (E, Attribute_Bit_Order))
927 and then Reverse_Bit_Order (P)
929 Set_Reverse_Bit_Order (Base_Type (E));
934 when Aspect_Component_Size =>
936 and then not Has_Component_Size_Clause (E)
939 (Base_Type (E), Component_Size (P));
944 when Aspect_Machine_Radix =>
945 if Is_Decimal_Fixed_Point_Type (E)
946 and then not Has_Machine_Radix_Clause (E)
948 Set_Machine_Radix_10 (E, Machine_Radix_10 (P));
951 -- Object_Size (also Size which also sets Object_Size)
953 when Aspect_Object_Size
956 if not Has_Size_Clause (E)
958 No (Get_Attribute_Definition_Clause
959 (E, Attribute_Object_Size))
961 Set_Esize (E, Esize (P));
967 if not Is_Packed (E) then
968 Set_Is_Packed (Base_Type (E));
970 if Is_Bit_Packed_Array (P) then
971 Set_Is_Bit_Packed_Array (Base_Type (E));
972 Set_Packed_Array_Impl_Type
973 (E, Packed_Array_Impl_Type (P));
977 -- Scalar_Storage_Order
979 when Aspect_Scalar_Storage_Order =>
980 if (Is_Record_Type (E) or else Is_Array_Type (E))
981 and then No (Get_Attribute_Definition_Clause
982 (E, Attribute_Scalar_Storage_Order))
983 and then Reverse_Storage_Order (P)
985 Set_Reverse_Storage_Order (Base_Type (E));
987 -- Clear default SSO indications, since the aspect
988 -- overrides the default.
990 Set_SSO_Set_Low_By_Default (Base_Type (E), False);
991 Set_SSO_Set_High_By_Default (Base_Type (E), False);
997 if Is_Fixed_Point_Type (E)
998 and then not Has_Small_Clause (E)
1000 Set_Small_Value (E, Small_Value (P));
1005 when Aspect_Storage_Size =>
1006 if (Is_Access_Type (E) or else Is_Task_Type (E))
1007 and then not Has_Storage_Size_Clause (E)
1009 Set_Storage_Size_Variable
1010 (Base_Type (E), Storage_Size_Variable (P));
1015 when Aspect_Value_Size =>
1017 -- Value_Size is never inherited, it is either set by
1018 -- default, or it is explicitly set for the derived
1019 -- type. So nothing to do here.
1025 when Aspect_Volatile =>
1026 if Is_Volatile (P) then
1027 Set_Is_Volatile (E);
1030 -- Volatile_Full_Access
1032 when Aspect_Volatile_Full_Access =>
1033 if Is_Volatile_Full_Access (P) then
1034 Set_Is_Volatile_Full_Access (E);
1037 -- Volatile_Components
1039 when Aspect_Volatile_Components =>
1040 if Has_Volatile_Components (P) then
1041 Set_Has_Volatile_Components (Base_Type (E));
1044 -- That should be all the Rep Aspects
1047 pragma Assert (Aspect_Delay (A_Id) /= Rep_Aspect);
1053 N := Next_Rep_Item (N);
1055 end Inherit_Delayed_Rep_Aspects;
1057 -------------------------------------
1058 -- Make_Pragma_From_Boolean_Aspect --
1059 -------------------------------------
1061 procedure Make_Pragma_From_Boolean_Aspect (ASN : Node_Id) is
1062 Ident : constant Node_Id := Identifier (ASN);
1063 A_Name : constant Name_Id := Chars (Ident);
1064 A_Id : constant Aspect_Id := Get_Aspect_Id (A_Name);
1065 Ent : constant Entity_Id := Entity (ASN);
1066 Expr : constant Node_Id := Expression (ASN);
1067 Loc : constant Source_Ptr := Sloc (ASN);
1069 procedure Check_False_Aspect_For_Derived_Type;
1070 -- This procedure checks for the case of a false aspect for a derived
1071 -- type, which improperly tries to cancel an aspect inherited from
1074 -----------------------------------------
1075 -- Check_False_Aspect_For_Derived_Type --
1076 -----------------------------------------
1078 procedure Check_False_Aspect_For_Derived_Type is
1082 -- We are only checking derived types
1084 if not Is_Derived_Type (E) then
1088 Par := Nearest_Ancestor (E);
1094 if not Is_Atomic (Par) then
1098 when Aspect_Atomic_Components =>
1099 if not Has_Atomic_Components (Par) then
1103 when Aspect_Discard_Names =>
1104 if not Discard_Names (Par) then
1109 if not Is_Packed (Par) then
1113 when Aspect_Unchecked_Union =>
1114 if not Is_Unchecked_Union (Par) then
1118 when Aspect_Volatile =>
1119 if not Is_Volatile (Par) then
1123 when Aspect_Volatile_Components =>
1124 if not Has_Volatile_Components (Par) then
1128 when Aspect_Volatile_Full_Access =>
1129 if not Is_Volatile_Full_Access (Par) then
1137 -- Fall through means we are canceling an inherited aspect
1139 Error_Msg_Name_1 := A_Name;
1141 ("derived type& inherits aspect%, cannot cancel", Expr, E);
1142 end Check_False_Aspect_For_Derived_Type;
1148 -- Start of processing for Make_Pragma_From_Boolean_Aspect
1151 -- Note that we know Expr is present, because for a missing Expr
1152 -- argument, we knew it was True and did not need to delay the
1153 -- evaluation to the freeze point.
1155 if Is_False (Static_Boolean (Expr)) then
1156 Check_False_Aspect_For_Derived_Type;
1161 Pragma_Identifier =>
1162 Make_Identifier (Sloc (Ident), Chars (Ident)),
1163 Pragma_Argument_Associations => New_List (
1164 Make_Pragma_Argument_Association (Sloc (Ident),
1165 Expression => New_Occurrence_Of (Ent, Sloc (Ident)))));
1167 Set_From_Aspect_Specification (Prag, True);
1168 Set_Corresponding_Aspect (Prag, ASN);
1169 Set_Aspect_Rep_Item (ASN, Prag);
1170 Set_Is_Delayed_Aspect (Prag);
1171 Set_Parent (Prag, ASN);
1173 end Make_Pragma_From_Boolean_Aspect;
1181 -- Start of processing for Analyze_Aspects_At_Freeze_Point
1184 -- Must be visible in current scope, but if this is a type from a nested
1185 -- package it may be frozen from an object declaration in the enclosing
1186 -- scope, so install the package declarations to complete the analysis
1187 -- of the aspects, if any. If the package itself is frozen the type will
1188 -- have been frozen as well.
1190 if not Scope_Within_Or_Same (Current_Scope, Scope (E)) then
1191 if Is_Type (E) and then From_Nested_Package (E) then
1193 Pack : constant Entity_Id := Scope (E);
1197 Install_Visible_Declarations (Pack);
1198 Install_Private_Declarations (Pack);
1199 Analyze_Aspects_At_Freeze_Point (E);
1201 if Is_Private_Type (E)
1202 and then Present (Full_View (E))
1204 Analyze_Aspects_At_Freeze_Point (Full_View (E));
1207 End_Package_Scope (Pack);
1211 -- Aspects from other entities in different contexts are analyzed
1219 -- Look for aspect specification entries for this entity
1221 ASN := First_Rep_Item (E);
1222 while Present (ASN) loop
1223 if Nkind (ASN) = N_Aspect_Specification then
1224 exit when Entity (ASN) /= E;
1226 if Is_Delayed_Aspect (ASN) then
1227 A_Id := Get_Aspect_Id (ASN);
1231 -- For aspects whose expression is an optional Boolean, make
1232 -- the corresponding pragma at the freeze point.
1234 when Boolean_Aspects
1235 | Library_Unit_Aspects
1237 -- Aspects Export and Import require special handling.
1238 -- Both are by definition Boolean and may benefit from
1239 -- forward references, however their expressions are
1240 -- treated as static. In addition, the syntax of their
1241 -- corresponding pragmas requires extra "pieces" which
1242 -- may also contain forward references. To account for
1243 -- all of this, the corresponding pragma is created by
1244 -- Analyze_Aspect_Export_Import, but is not analyzed as
1245 -- the complete analysis must happen now.
1247 if A_Id = Aspect_Export or else A_Id = Aspect_Import then
1250 -- Otherwise create a corresponding pragma
1253 Make_Pragma_From_Boolean_Aspect (ASN);
1256 -- Special handling for aspects that don't correspond to
1257 -- pragmas/attributes.
1259 when Aspect_Default_Value
1260 | Aspect_Default_Component_Value
1262 -- Do not inherit aspect for anonymous base type of a
1263 -- scalar or array type, because they apply to the first
1264 -- subtype of the type, and will be processed when that
1265 -- first subtype is frozen.
1267 if Is_Derived_Type (E)
1268 and then not Comes_From_Source (E)
1269 and then E /= First_Subtype (E)
1273 Analyze_Aspect_Default_Value (ASN);
1276 -- Ditto for iterator aspects, because the corresponding
1277 -- attributes may not have been analyzed yet.
1279 when Aspect_Constant_Indexing
1280 | Aspect_Default_Iterator
1281 | Aspect_Iterator_Element
1282 | Aspect_Variable_Indexing
1284 Analyze (Expression (ASN));
1286 if Etype (Expression (ASN)) = Any_Type then
1288 ("\aspect must be fully defined before & is frozen",
1292 when Aspect_Iterable =>
1293 Validate_Iterable_Aspect (E, ASN);
1299 Ritem := Aspect_Rep_Item (ASN);
1301 if Present (Ritem) then
1307 Next_Rep_Item (ASN);
1310 -- This is where we inherit delayed rep aspects from our parent. Note
1311 -- that if we fell out of the above loop with ASN non-empty, it means
1312 -- we hit an aspect for an entity other than E, and it must be the
1313 -- type from which we were derived.
1315 if May_Inherit_Delayed_Rep_Aspects (E) then
1316 Inherit_Delayed_Rep_Aspects (ASN);
1318 end Analyze_Aspects_At_Freeze_Point;
1320 -----------------------------------
1321 -- Analyze_Aspect_Specifications --
1322 -----------------------------------
1324 procedure Analyze_Aspect_Specifications (N : Node_Id; E : Entity_Id) is
1325 procedure Decorate (Asp : Node_Id; Prag : Node_Id);
1326 -- Establish linkages between an aspect and its corresponding pragma
1328 procedure Insert_Pragma
1330 Is_Instance : Boolean := False);
1331 -- Subsidiary to the analysis of aspects
1338 -- Initial_Condition
1347 -- Insert pragma Prag such that it mimics the placement of a source
1348 -- pragma of the same kind. Flag Is_Generic should be set when the
1349 -- context denotes a generic instance.
1355 procedure Decorate (Asp : Node_Id; Prag : Node_Id) is
1357 Set_Aspect_Rep_Item (Asp, Prag);
1358 Set_Corresponding_Aspect (Prag, Asp);
1359 Set_From_Aspect_Specification (Prag);
1360 Set_Parent (Prag, Asp);
1367 procedure Insert_Pragma
1369 Is_Instance : Boolean := False)
1375 Inserted : Boolean := False;
1378 -- When the aspect appears on an entry, package, protected unit,
1379 -- subprogram, or task unit body, insert the generated pragma at the
1380 -- top of the body declarations to emulate the behavior of a source
1383 -- package body Pack with Aspect is
1385 -- package body Pack is
1388 if Nkind_In (N, N_Entry_Body,
1394 Decls := Declarations (N);
1398 Set_Declarations (N, Decls);
1401 Prepend_To (Decls, Prag);
1403 -- When the aspect is associated with a [generic] package declaration
1404 -- insert the generated pragma at the top of the visible declarations
1405 -- to emulate the behavior of a source pragma.
1407 -- package Pack with Aspect is
1412 elsif Nkind_In (N, N_Generic_Package_Declaration,
1413 N_Package_Declaration)
1415 Decls := Visible_Declarations (Specification (N));
1419 Set_Visible_Declarations (Specification (N), Decls);
1422 -- The visible declarations of a generic instance have the
1423 -- following structure:
1425 -- <renamings of generic formals>
1426 -- <renamings of internally-generated spec and body>
1427 -- <first source declaration>
1429 -- Insert the pragma before the first source declaration by
1430 -- skipping the instance "header" to ensure proper visibility of
1434 Decl := First (Decls);
1435 while Present (Decl) loop
1436 if Comes_From_Source (Decl) then
1437 Insert_Before (Decl, Prag);
1445 -- The pragma is placed after the instance "header"
1447 if not Inserted then
1448 Append_To (Decls, Prag);
1451 -- Otherwise this is not a generic instance
1454 Prepend_To (Decls, Prag);
1457 -- When the aspect is associated with a protected unit declaration,
1458 -- insert the generated pragma at the top of the visible declarations
1459 -- the emulate the behavior of a source pragma.
1461 -- protected [type] Prot with Aspect is
1463 -- protected [type] Prot is
1466 elsif Nkind (N) = N_Protected_Type_Declaration then
1467 Def := Protected_Definition (N);
1471 Make_Protected_Definition (Sloc (N),
1472 Visible_Declarations => New_List,
1473 End_Label => Empty);
1475 Set_Protected_Definition (N, Def);
1478 Decls := Visible_Declarations (Def);
1482 Set_Visible_Declarations (Def, Decls);
1485 Prepend_To (Decls, Prag);
1487 -- When the aspect is associated with a task unit declaration, insert
1488 -- insert the generated pragma at the top of the visible declarations
1489 -- the emulate the behavior of a source pragma.
1491 -- task [type] Prot with Aspect is
1493 -- task [type] Prot is
1496 elsif Nkind (N) = N_Task_Type_Declaration then
1497 Def := Task_Definition (N);
1501 Make_Task_Definition (Sloc (N),
1502 Visible_Declarations => New_List,
1503 End_Label => Empty);
1505 Set_Task_Definition (N, Def);
1508 Decls := Visible_Declarations (Def);
1512 Set_Visible_Declarations (Def, Decls);
1515 Prepend_To (Decls, Prag);
1517 -- When the context is a library unit, the pragma is added to the
1518 -- Pragmas_After list.
1520 elsif Nkind (Parent (N)) = N_Compilation_Unit then
1521 Aux := Aux_Decls_Node (Parent (N));
1523 if No (Pragmas_After (Aux)) then
1524 Set_Pragmas_After (Aux, New_List);
1527 Prepend (Prag, Pragmas_After (Aux));
1529 -- Default, the pragma is inserted after the context
1532 Insert_After (N, Prag);
1542 L : constant List_Id := Aspect_Specifications (N);
1544 Ins_Node : Node_Id := N;
1545 -- Insert pragmas/attribute definition clause after this node when no
1546 -- delayed analysis is required.
1548 -- Start of processing for Analyze_Aspect_Specifications
1551 -- The general processing involves building an attribute definition
1552 -- clause or a pragma node that corresponds to the aspect. Then in order
1553 -- to delay the evaluation of this aspect to the freeze point, we attach
1554 -- the corresponding pragma/attribute definition clause to the aspect
1555 -- specification node, which is then placed in the Rep Item chain. In
1556 -- this case we mark the entity by setting the flag Has_Delayed_Aspects
1557 -- and we evaluate the rep item at the freeze point. When the aspect
1558 -- doesn't have a corresponding pragma/attribute definition clause, then
1559 -- its analysis is simply delayed at the freeze point.
1561 -- Some special cases don't require delay analysis, thus the aspect is
1562 -- analyzed right now.
1564 -- Note that there is a special handling for Pre, Post, Test_Case,
1565 -- Contract_Cases aspects. In these cases, we do not have to worry
1566 -- about delay issues, since the pragmas themselves deal with delay
1567 -- of visibility for the expression analysis. Thus, we just insert
1568 -- the pragma after the node N.
1570 pragma Assert (Present (L));
1572 -- Loop through aspects
1574 Aspect := First (L);
1575 Aspect_Loop : while Present (Aspect) loop
1576 Analyze_One_Aspect : declare
1577 Expr : constant Node_Id := Expression (Aspect);
1578 Id : constant Node_Id := Identifier (Aspect);
1579 Loc : constant Source_Ptr := Sloc (Aspect);
1580 Nam : constant Name_Id := Chars (Id);
1581 A_Id : constant Aspect_Id := Get_Aspect_Id (Nam);
1584 Delay_Required : Boolean;
1585 -- Set False if delay is not required
1587 Eloc : Source_Ptr := No_Location;
1588 -- Source location of expression, modified when we split PPC's. It
1589 -- is set below when Expr is present.
1591 procedure Analyze_Aspect_Convention;
1592 -- Perform analysis of aspect Convention
1594 procedure Analyze_Aspect_Export_Import;
1595 -- Perform analysis of aspects Export or Import
1597 procedure Analyze_Aspect_External_Link_Name;
1598 -- Perform analysis of aspects External_Name or Link_Name
1600 procedure Analyze_Aspect_Implicit_Dereference;
1601 -- Perform analysis of the Implicit_Dereference aspects
1603 procedure Make_Aitem_Pragma
1604 (Pragma_Argument_Associations : List_Id;
1605 Pragma_Name : Name_Id);
1606 -- This is a wrapper for Make_Pragma used for converting aspects
1607 -- to pragmas. It takes care of Sloc (set from Loc) and building
1608 -- the pragma identifier from the given name. In addition the
1609 -- flags Class_Present and Split_PPC are set from the aspect
1610 -- node, as well as Is_Ignored. This routine also sets the
1611 -- From_Aspect_Specification in the resulting pragma node to
1612 -- True, and sets Corresponding_Aspect to point to the aspect.
1613 -- The resulting pragma is assigned to Aitem.
1615 -------------------------------
1616 -- Analyze_Aspect_Convention --
1617 -------------------------------
1619 procedure Analyze_Aspect_Convention is
1628 -- Obtain all interfacing aspects that apply to the related
1631 Get_Interfacing_Aspects
1632 (Iface_Asp => Aspect,
1633 Conv_Asp => Dummy_1,
1640 -- The related entity is subject to aspect Export or Import.
1641 -- Do not process Convention now because it must be analysed
1642 -- as part of Export or Import.
1644 if Present (Expo) or else Present (Imp) then
1647 -- Otherwise Convention appears by itself
1650 -- The aspect specifies a particular convention
1652 if Present (Expr) then
1653 Conv := New_Copy_Tree (Expr);
1655 -- Otherwise assume convention Ada
1658 Conv := Make_Identifier (Loc, Name_Ada);
1662 -- pragma Convention (<Conv>, <E>);
1665 (Pragma_Name => Name_Convention,
1666 Pragma_Argument_Associations => New_List (
1667 Make_Pragma_Argument_Association (Loc,
1668 Expression => Conv),
1669 Make_Pragma_Argument_Association (Loc,
1670 Expression => New_Occurrence_Of (E, Loc))));
1672 Decorate (Aspect, Aitem);
1673 Insert_Pragma (Aitem);
1675 end Analyze_Aspect_Convention;
1677 ----------------------------------
1678 -- Analyze_Aspect_Export_Import --
1679 ----------------------------------
1681 procedure Analyze_Aspect_Export_Import is
1689 -- Obtain all interfacing aspects that apply to the related
1692 Get_Interfacing_Aspects
1693 (Iface_Asp => Aspect,
1694 Conv_Asp => Dummy_1,
1701 -- The related entity cannot be subject to both aspects Export
1704 if Present (Expo) and then Present (Imp) then
1706 ("incompatible interfacing aspects given for &", E);
1707 Error_Msg_Sloc := Sloc (Expo);
1708 Error_Msg_N ("\aspect `Export` #", E);
1709 Error_Msg_Sloc := Sloc (Imp);
1710 Error_Msg_N ("\aspect `Import` #", E);
1713 -- A variable is most likely modified from the outside. Take
1714 -- the optimistic approach to avoid spurious errors.
1716 if Ekind (E) = E_Variable then
1717 Set_Never_Set_In_Source (E, False);
1720 -- Resolve the expression of an Import or Export here, and
1721 -- require it to be of type Boolean and static. This is not
1722 -- quite right, because in general this should be delayed,
1723 -- but that seems tricky for these, because normally Boolean
1724 -- aspects are replaced with pragmas at the freeze point in
1725 -- Make_Pragma_From_Boolean_Aspect.
1727 if not Present (Expr)
1728 or else Is_True (Static_Boolean (Expr))
1730 if A_Id = Aspect_Import then
1731 Set_Has_Completion (E);
1732 Set_Is_Imported (E);
1734 -- An imported object cannot be explicitly initialized
1736 if Nkind (N) = N_Object_Declaration
1737 and then Present (Expression (N))
1740 ("imported entities cannot be initialized "
1741 & "(RM B.1(24))", Expression (N));
1745 pragma Assert (A_Id = Aspect_Export);
1746 Set_Is_Exported (E);
1749 -- Create the proper form of pragma Export or Import taking
1750 -- into account Conversion, External_Name, and Link_Name.
1752 Aitem := Build_Export_Import_Pragma (Aspect, E);
1754 -- Otherwise the expression is either False or erroneous. There
1755 -- is no corresponding pragma.
1760 end Analyze_Aspect_Export_Import;
1762 ---------------------------------------
1763 -- Analyze_Aspect_External_Link_Name --
1764 ---------------------------------------
1766 procedure Analyze_Aspect_External_Link_Name is
1774 -- Obtain all interfacing aspects that apply to the related
1777 Get_Interfacing_Aspects
1778 (Iface_Asp => Aspect,
1779 Conv_Asp => Dummy_1,
1786 -- Ensure that aspect External_Name applies to aspect Export or
1789 if A_Id = Aspect_External_Name then
1790 if No (Expo) and then No (Imp) then
1792 ("aspect `External_Name` requires aspect `Import` or "
1793 & "`Export`", Aspect);
1796 -- Otherwise ensure that aspect Link_Name applies to aspect
1797 -- Export or Import.
1800 pragma Assert (A_Id = Aspect_Link_Name);
1801 if No (Expo) and then No (Imp) then
1803 ("aspect `Link_Name` requires aspect `Import` or "
1804 & "`Export`", Aspect);
1807 end Analyze_Aspect_External_Link_Name;
1809 -----------------------------------------
1810 -- Analyze_Aspect_Implicit_Dereference --
1811 -----------------------------------------
1813 procedure Analyze_Aspect_Implicit_Dereference is
1815 Parent_Disc : Entity_Id;
1818 if not Is_Type (E) or else not Has_Discriminants (E) then
1820 ("aspect must apply to a type with discriminants", Expr);
1822 elsif not Is_Entity_Name (Expr) then
1824 ("aspect must name a discriminant of current type", Expr);
1827 -- Discriminant type be an anonymous access type or an
1828 -- anonymous access to subprogram.
1830 -- Missing synchronized types???
1832 Disc := First_Discriminant (E);
1833 while Present (Disc) loop
1834 if Chars (Expr) = Chars (Disc)
1835 and then Ekind_In (Etype (Disc),
1836 E_Anonymous_Access_Subprogram_Type,
1837 E_Anonymous_Access_Type)
1839 Set_Has_Implicit_Dereference (E);
1840 Set_Has_Implicit_Dereference (Disc);
1844 Next_Discriminant (Disc);
1847 -- Error if no proper access discriminant
1850 Error_Msg_NE ("not an access discriminant of&", Expr, E);
1855 -- For a type extension, check whether parent has a
1856 -- reference discriminant, to verify that use is proper.
1858 if Is_Derived_Type (E)
1859 and then Has_Discriminants (Etype (E))
1861 Parent_Disc := Get_Reference_Discriminant (Etype (E));
1863 if Present (Parent_Disc)
1864 and then Corresponding_Discriminant (Disc) /= Parent_Disc
1867 ("reference discriminant does not match discriminant "
1868 & "of parent type", Expr);
1871 end Analyze_Aspect_Implicit_Dereference;
1873 -----------------------
1874 -- Make_Aitem_Pragma --
1875 -----------------------
1877 procedure Make_Aitem_Pragma
1878 (Pragma_Argument_Associations : List_Id;
1879 Pragma_Name : Name_Id)
1881 Args : List_Id := Pragma_Argument_Associations;
1884 -- We should never get here if aspect was disabled
1886 pragma Assert (not Is_Disabled (Aspect));
1888 -- Certain aspects allow for an optional name or expression. Do
1889 -- not generate a pragma with empty argument association list.
1891 if No (Args) or else No (Expression (First (Args))) then
1899 Pragma_Argument_Associations => Args,
1900 Pragma_Identifier =>
1901 Make_Identifier (Sloc (Id), Pragma_Name),
1902 Class_Present => Class_Present (Aspect),
1903 Split_PPC => Split_PPC (Aspect));
1905 -- Set additional semantic fields
1907 if Is_Ignored (Aspect) then
1908 Set_Is_Ignored (Aitem);
1909 elsif Is_Checked (Aspect) then
1910 Set_Is_Checked (Aitem);
1913 Set_Corresponding_Aspect (Aitem, Aspect);
1914 Set_From_Aspect_Specification (Aitem);
1915 end Make_Aitem_Pragma;
1917 -- Start of processing for Analyze_One_Aspect
1920 -- Skip aspect if already analyzed, to avoid looping in some cases
1922 if Analyzed (Aspect) then
1926 -- Skip looking at aspect if it is totally disabled. Just mark it
1927 -- as such for later reference in the tree. This also sets the
1928 -- Is_Ignored and Is_Checked flags appropriately.
1930 Check_Applicable_Policy (Aspect);
1932 if Is_Disabled (Aspect) then
1936 -- Set the source location of expression, used in the case of
1937 -- a failed precondition/postcondition or invariant. Note that
1938 -- the source location of the expression is not usually the best
1939 -- choice here. For example, it gets located on the last AND
1940 -- keyword in a chain of boolean expressiond AND'ed together.
1941 -- It is best to put the message on the first character of the
1942 -- assertion, which is the effect of the First_Node call here.
1944 if Present (Expr) then
1945 Eloc := Sloc (First_Node (Expr));
1948 -- Check restriction No_Implementation_Aspect_Specifications
1950 if Implementation_Defined_Aspect (A_Id) then
1952 (No_Implementation_Aspect_Specifications, Aspect);
1955 -- Check restriction No_Specification_Of_Aspect
1957 Check_Restriction_No_Specification_Of_Aspect (Aspect);
1959 -- Mark aspect analyzed (actual analysis is delayed till later)
1961 Set_Analyzed (Aspect);
1962 Set_Entity (Aspect, E);
1964 -- Build the reference to E that will be used in the built pragmas
1966 Ent := New_Occurrence_Of (E, Sloc (Id));
1968 if A_Id = Aspect_Attach_Handler
1969 or else A_Id = Aspect_Interrupt_Handler
1971 -- Decorate the reference as comming from the sources and force
1972 -- its reanalysis to generate the reference to E; required to
1973 -- avoid reporting spurious warning on E as unreferenced entity
1974 -- (because aspects are not fully analyzed).
1976 Set_Comes_From_Source (Ent, Comes_From_Source (Id));
1977 Set_Entity (Ent, Empty);
1982 -- Check for duplicate aspect. Note that the Comes_From_Source
1983 -- test allows duplicate Pre/Post's that we generate internally
1984 -- to escape being flagged here.
1986 if No_Duplicates_Allowed (A_Id) then
1988 while Anod /= Aspect loop
1989 if Comes_From_Source (Aspect)
1990 and then Same_Aspect (A_Id, Get_Aspect_Id (Anod))
1992 Error_Msg_Name_1 := Nam;
1993 Error_Msg_Sloc := Sloc (Anod);
1995 -- Case of same aspect specified twice
1997 if Class_Present (Anod) = Class_Present (Aspect) then
1998 if not Class_Present (Anod) then
2000 ("aspect% for & previously given#",
2004 ("aspect `%''Class` for & previously given#",
2014 -- Check some general restrictions on language defined aspects
2016 if not Implementation_Defined_Aspect (A_Id) then
2017 Error_Msg_Name_1 := Nam;
2019 -- Not allowed for renaming declarations. Examine the original
2020 -- node because a subprogram renaming may have been rewritten
2023 if Nkind (Original_Node (N)) in N_Renaming_Declaration then
2025 ("aspect % not allowed for renaming declaration",
2029 -- Not allowed for formal type declarations
2031 if Nkind (N) = N_Formal_Type_Declaration then
2033 ("aspect % not allowed for formal type declaration",
2038 -- Copy expression for later processing by the procedures
2039 -- Check_Aspect_At_[Freeze_Point | End_Of_Declarations]
2041 Set_Entity (Id, New_Copy_Tree (Expr));
2043 -- Set Delay_Required as appropriate to aspect
2045 case Aspect_Delay (A_Id) is
2046 when Always_Delay =>
2047 Delay_Required := True;
2050 Delay_Required := False;
2054 -- If expression has the form of an integer literal, then
2055 -- do not delay, since we know the value cannot change.
2056 -- This optimization catches most rep clause cases.
2058 -- For Boolean aspects, don't delay if no expression
2060 if A_Id in Boolean_Aspects and then No (Expr) then
2061 Delay_Required := False;
2063 -- For non-Boolean aspects, don't delay if integer literal,
2064 -- unless the aspect is Alignment, which affects the
2065 -- freezing of an initialized object.
2067 elsif A_Id not in Boolean_Aspects
2068 and then A_Id /= Aspect_Alignment
2069 and then Present (Expr)
2070 and then Nkind (Expr) = N_Integer_Literal
2072 Delay_Required := False;
2074 -- All other cases are delayed
2077 Delay_Required := True;
2078 Set_Has_Delayed_Rep_Aspects (E);
2082 -- Processing based on specific aspect
2085 when Aspect_Unimplemented =>
2086 null; -- ??? temp for now
2088 -- No_Aspect should be impossible
2091 raise Program_Error;
2093 -- Case 1: Aspects corresponding to attribute definition
2099 | Aspect_Component_Size
2100 | Aspect_Constant_Indexing
2101 | Aspect_Default_Iterator
2102 | Aspect_Dispatching_Domain
2103 | Aspect_External_Tag
2106 | Aspect_Iterator_Element
2107 | Aspect_Machine_Radix
2108 | Aspect_Object_Size
2111 | Aspect_Scalar_Storage_Order
2112 | Aspect_Secondary_Stack_Size
2113 | Aspect_Simple_Storage_Pool
2116 | Aspect_Storage_Pool
2117 | Aspect_Stream_Size
2119 | Aspect_Variable_Indexing
2122 -- Indexing aspects apply only to tagged type
2124 if (A_Id = Aspect_Constant_Indexing
2126 A_Id = Aspect_Variable_Indexing)
2127 and then not (Is_Type (E)
2128 and then Is_Tagged_Type (E))
2131 ("indexing aspect can only apply to a tagged type",
2136 -- For the case of aspect Address, we don't consider that we
2137 -- know the entity is never set in the source, since it is
2138 -- is likely aliasing is occurring.
2140 -- Note: one might think that the analysis of the resulting
2141 -- attribute definition clause would take care of that, but
2142 -- that's not the case since it won't be from source.
2144 if A_Id = Aspect_Address then
2145 Set_Never_Set_In_Source (E, False);
2148 -- Correctness of the profile of a stream operation is
2149 -- verified at the freeze point, but we must detect the
2150 -- illegal specification of this aspect for a subtype now,
2151 -- to prevent malformed rep_item chains.
2153 if A_Id = Aspect_Input or else
2154 A_Id = Aspect_Output or else
2155 A_Id = Aspect_Read or else
2158 if not Is_First_Subtype (E) then
2160 ("local name must be a first subtype", Aspect);
2163 -- If stream aspect applies to the class-wide type,
2164 -- the generated attribute definition applies to the
2165 -- class-wide type as well.
2167 elsif Class_Present (Aspect) then
2169 Make_Attribute_Reference (Loc,
2171 Attribute_Name => Name_Class);
2175 -- Construct the attribute definition clause
2178 Make_Attribute_Definition_Clause (Loc,
2180 Chars => Chars (Id),
2181 Expression => Relocate_Node (Expr));
2183 -- If the address is specified, then we treat the entity as
2184 -- referenced, to avoid spurious warnings. This is analogous
2185 -- to what is done with an attribute definition clause, but
2186 -- here we don't want to generate a reference because this
2187 -- is the point of definition of the entity.
2189 if A_Id = Aspect_Address then
2193 -- Case 2: Aspects corresponding to pragmas
2195 -- Case 2a: Aspects corresponding to pragmas with two
2196 -- arguments, where the first argument is a local name
2197 -- referring to the entity, and the second argument is the
2198 -- aspect definition expression.
2200 -- Linker_Section/Suppress/Unsuppress
2202 when Aspect_Linker_Section
2207 (Pragma_Argument_Associations => New_List (
2208 Make_Pragma_Argument_Association (Loc,
2209 Expression => New_Occurrence_Of (E, Loc)),
2210 Make_Pragma_Argument_Association (Sloc (Expr),
2211 Expression => Relocate_Node (Expr))),
2212 Pragma_Name => Chars (Id));
2216 -- Corresponds to pragma Implemented, construct the pragma
2218 when Aspect_Synchronization =>
2220 (Pragma_Argument_Associations => New_List (
2221 Make_Pragma_Argument_Association (Loc,
2222 Expression => New_Occurrence_Of (E, Loc)),
2223 Make_Pragma_Argument_Association (Sloc (Expr),
2224 Expression => Relocate_Node (Expr))),
2225 Pragma_Name => Name_Implemented);
2229 when Aspect_Attach_Handler =>
2231 (Pragma_Argument_Associations => New_List (
2232 Make_Pragma_Argument_Association (Sloc (Ent),
2234 Make_Pragma_Argument_Association (Sloc (Expr),
2235 Expression => Relocate_Node (Expr))),
2236 Pragma_Name => Name_Attach_Handler);
2238 -- We need to insert this pragma into the tree to get proper
2239 -- processing and to look valid from a placement viewpoint.
2241 Insert_Pragma (Aitem);
2244 -- Dynamic_Predicate, Predicate, Static_Predicate
2246 when Aspect_Dynamic_Predicate
2248 | Aspect_Static_Predicate
2250 -- These aspects apply only to subtypes
2252 if not Is_Type (E) then
2254 ("predicate can only be specified for a subtype",
2258 elsif Is_Incomplete_Type (E) then
2260 ("predicate cannot apply to incomplete view", Aspect);
2264 -- Construct the pragma (always a pragma Predicate, with
2265 -- flags recording whether it is static/dynamic). We also
2266 -- set flags recording this in the type itself.
2269 (Pragma_Argument_Associations => New_List (
2270 Make_Pragma_Argument_Association (Sloc (Ent),
2272 Make_Pragma_Argument_Association (Sloc (Expr),
2273 Expression => Relocate_Node (Expr))),
2274 Pragma_Name => Name_Predicate);
2276 -- Mark type has predicates, and remember what kind of
2277 -- aspect lead to this predicate (we need this to access
2278 -- the right set of check policies later on).
2280 Set_Has_Predicates (E);
2282 if A_Id = Aspect_Dynamic_Predicate then
2283 Set_Has_Dynamic_Predicate_Aspect (E);
2285 -- If the entity has a dynamic predicate, any inherited
2286 -- static predicate becomes dynamic as well, and the
2287 -- predicate function includes the conjunction of both.
2289 Set_Has_Static_Predicate_Aspect (E, False);
2291 elsif A_Id = Aspect_Static_Predicate then
2292 Set_Has_Static_Predicate_Aspect (E);
2295 -- If the type is private, indicate that its completion
2296 -- has a freeze node, because that is the one that will
2297 -- be visible at freeze time.
2299 if Is_Private_Type (E) and then Present (Full_View (E)) then
2300 Set_Has_Predicates (Full_View (E));
2302 if A_Id = Aspect_Dynamic_Predicate then
2303 Set_Has_Dynamic_Predicate_Aspect (Full_View (E));
2304 elsif A_Id = Aspect_Static_Predicate then
2305 Set_Has_Static_Predicate_Aspect (Full_View (E));
2308 Set_Has_Delayed_Aspects (Full_View (E));
2309 Ensure_Freeze_Node (Full_View (E));
2312 -- Predicate_Failure
2314 when Aspect_Predicate_Failure =>
2316 -- This aspect applies only to subtypes
2318 if not Is_Type (E) then
2320 ("predicate can only be specified for a subtype",
2324 elsif Is_Incomplete_Type (E) then
2326 ("predicate cannot apply to incomplete view", Aspect);
2330 -- Construct the pragma
2333 (Pragma_Argument_Associations => New_List (
2334 Make_Pragma_Argument_Association (Sloc (Ent),
2336 Make_Pragma_Argument_Association (Sloc (Expr),
2337 Expression => Relocate_Node (Expr))),
2338 Pragma_Name => Name_Predicate_Failure);
2340 Set_Has_Predicates (E);
2342 -- If the type is private, indicate that its completion
2343 -- has a freeze node, because that is the one that will
2344 -- be visible at freeze time.
2346 if Is_Private_Type (E) and then Present (Full_View (E)) then
2347 Set_Has_Predicates (Full_View (E));
2348 Set_Has_Delayed_Aspects (Full_View (E));
2349 Ensure_Freeze_Node (Full_View (E));
2352 -- Case 2b: Aspects corresponding to pragmas with two
2353 -- arguments, where the second argument is a local name
2354 -- referring to the entity, and the first argument is the
2355 -- aspect definition expression.
2359 when Aspect_Convention =>
2360 Analyze_Aspect_Convention;
2363 -- External_Name, Link_Name
2365 when Aspect_External_Name
2368 Analyze_Aspect_External_Link_Name;
2371 -- CPU, Interrupt_Priority, Priority
2373 -- These three aspects can be specified for a subprogram spec
2374 -- or body, in which case we analyze the expression and export
2375 -- the value of the aspect.
2377 -- Previously, we generated an equivalent pragma for bodies
2378 -- (note that the specs cannot contain these pragmas). The
2379 -- pragma was inserted ahead of local declarations, rather than
2380 -- after the body. This leads to a certain duplication between
2381 -- the processing performed for the aspect and the pragma, but
2382 -- given the straightforward handling required it is simpler
2383 -- to duplicate than to translate the aspect in the spec into
2384 -- a pragma in the declarative part of the body.
2387 | Aspect_Interrupt_Priority
2390 if Nkind_In (N, N_Subprogram_Body,
2391 N_Subprogram_Declaration)
2393 -- Analyze the aspect expression
2395 Analyze_And_Resolve (Expr, Standard_Integer);
2397 -- Interrupt_Priority aspect not allowed for main
2398 -- subprograms. RM D.1 does not forbid this explicitly,
2399 -- but RM J.15.11(6/3) does not permit pragma
2400 -- Interrupt_Priority for subprograms.
2402 if A_Id = Aspect_Interrupt_Priority then
2404 ("Interrupt_Priority aspect cannot apply to "
2405 & "subprogram", Expr);
2407 -- The expression must be static
2409 elsif not Is_OK_Static_Expression (Expr) then
2410 Flag_Non_Static_Expr
2411 ("aspect requires static expression!", Expr);
2413 -- Check whether this is the main subprogram. Issue a
2414 -- warning only if it is obviously not a main program
2415 -- (when it has parameters or when the subprogram is
2416 -- within a package).
2418 elsif Present (Parameter_Specifications
2419 (Specification (N)))
2420 or else not Is_Compilation_Unit (Defining_Entity (N))
2422 -- See RM D.1(14/3) and D.16(12/3)
2425 ("aspect applied to subprogram other than the "
2426 & "main subprogram has no effect??", Expr);
2428 -- Otherwise check in range and export the value
2430 -- For the CPU aspect
2432 elsif A_Id = Aspect_CPU then
2433 if Is_In_Range (Expr, RTE (RE_CPU_Range)) then
2435 -- Value is correct so we export the value to make
2436 -- it available at execution time.
2439 (Main_Unit, UI_To_Int (Expr_Value (Expr)));
2443 ("main subprogram CPU is out of range", Expr);
2446 -- For the Priority aspect
2448 elsif A_Id = Aspect_Priority then
2449 if Is_In_Range (Expr, RTE (RE_Priority)) then
2451 -- Value is correct so we export the value to make
2452 -- it available at execution time.
2455 (Main_Unit, UI_To_Int (Expr_Value (Expr)));
2457 -- Ignore pragma if Relaxed_RM_Semantics to support
2458 -- other targets/non GNAT compilers.
2460 elsif not Relaxed_RM_Semantics then
2462 ("main subprogram priority is out of range",
2467 -- Load an arbitrary entity from System.Tasking.Stages
2468 -- or System.Tasking.Restricted.Stages (depending on
2469 -- the supported profile) to make sure that one of these
2470 -- packages is implicitly with'ed, since we need to have
2471 -- the tasking run time active for the pragma Priority to
2472 -- have any effect. Previously we with'ed the package
2473 -- System.Tasking, but this package does not trigger the
2474 -- required initialization of the run-time library.
2477 Discard : Entity_Id;
2479 if Restricted_Profile then
2480 Discard := RTE (RE_Activate_Restricted_Tasks);
2482 Discard := RTE (RE_Activate_Tasks);
2486 -- Handling for these aspects in subprograms is complete
2490 -- For task and protected types pass the aspect as an
2495 Make_Attribute_Definition_Clause (Loc,
2497 Chars => Chars (Id),
2498 Expression => Relocate_Node (Expr));
2503 when Aspect_Warnings =>
2505 (Pragma_Argument_Associations => New_List (
2506 Make_Pragma_Argument_Association (Sloc (Expr),
2507 Expression => Relocate_Node (Expr)),
2508 Make_Pragma_Argument_Association (Loc,
2509 Expression => New_Occurrence_Of (E, Loc))),
2510 Pragma_Name => Chars (Id));
2512 Decorate (Aspect, Aitem);
2513 Insert_Pragma (Aitem);
2516 -- Case 2c: Aspects corresponding to pragmas with three
2519 -- Invariant aspects have a first argument that references the
2520 -- entity, a second argument that is the expression and a third
2521 -- argument that is an appropriate message.
2523 -- Invariant, Type_Invariant
2525 when Aspect_Invariant
2526 | Aspect_Type_Invariant
2528 -- Analysis of the pragma will verify placement legality:
2529 -- an invariant must apply to a private type, or appear in
2530 -- the private part of a spec and apply to a completion.
2533 (Pragma_Argument_Associations => New_List (
2534 Make_Pragma_Argument_Association (Sloc (Ent),
2536 Make_Pragma_Argument_Association (Sloc (Expr),
2537 Expression => Relocate_Node (Expr))),
2538 Pragma_Name => Name_Invariant);
2540 -- Add message unless exception messages are suppressed
2542 if not Opt.Exception_Locations_Suppressed then
2543 Append_To (Pragma_Argument_Associations (Aitem),
2544 Make_Pragma_Argument_Association (Eloc,
2545 Chars => Name_Message,
2547 Make_String_Literal (Eloc,
2548 Strval => "failed invariant from "
2549 & Build_Location_String (Eloc))));
2552 -- For Invariant case, insert immediately after the entity
2553 -- declaration. We do not have to worry about delay issues
2554 -- since the pragma processing takes care of this.
2556 Delay_Required := False;
2558 -- Case 2d : Aspects that correspond to a pragma with one
2563 -- Aspect Abstract_State introduces implicit declarations for
2564 -- all state abstraction entities it defines. To emulate this
2565 -- behavior, insert the pragma at the beginning of the visible
2566 -- declarations of the related package so that it is analyzed
2569 when Aspect_Abstract_State => Abstract_State : declare
2570 Context : Node_Id := N;
2573 -- When aspect Abstract_State appears on a generic package,
2574 -- it is propageted to the package instance. The context in
2575 -- this case is the instance spec.
2577 if Nkind (Context) = N_Package_Instantiation then
2578 Context := Instance_Spec (Context);
2581 if Nkind_In (Context, N_Generic_Package_Declaration,
2582 N_Package_Declaration)
2585 (Pragma_Argument_Associations => New_List (
2586 Make_Pragma_Argument_Association (Loc,
2587 Expression => Relocate_Node (Expr))),
2588 Pragma_Name => Name_Abstract_State);
2590 Decorate (Aspect, Aitem);
2594 Is_Generic_Instance (Defining_Entity (Context)));
2598 ("aspect & must apply to a package declaration",
2605 -- Aspect Async_Readers is never delayed because it is
2606 -- equivalent to a source pragma which appears after the
2607 -- related object declaration.
2609 when Aspect_Async_Readers =>
2611 (Pragma_Argument_Associations => New_List (
2612 Make_Pragma_Argument_Association (Loc,
2613 Expression => Relocate_Node (Expr))),
2614 Pragma_Name => Name_Async_Readers);
2616 Decorate (Aspect, Aitem);
2617 Insert_Pragma (Aitem);
2620 -- Aspect Async_Writers is never delayed because it is
2621 -- equivalent to a source pragma which appears after the
2622 -- related object declaration.
2624 when Aspect_Async_Writers =>
2626 (Pragma_Argument_Associations => New_List (
2627 Make_Pragma_Argument_Association (Loc,
2628 Expression => Relocate_Node (Expr))),
2629 Pragma_Name => Name_Async_Writers);
2631 Decorate (Aspect, Aitem);
2632 Insert_Pragma (Aitem);
2635 -- Aspect Constant_After_Elaboration is never delayed because
2636 -- it is equivalent to a source pragma which appears after the
2637 -- related object declaration.
2639 when Aspect_Constant_After_Elaboration =>
2641 (Pragma_Argument_Associations => New_List (
2642 Make_Pragma_Argument_Association (Loc,
2643 Expression => Relocate_Node (Expr))),
2645 Name_Constant_After_Elaboration);
2647 Decorate (Aspect, Aitem);
2648 Insert_Pragma (Aitem);
2651 -- Aspect Default_Internal_Condition is never delayed because
2652 -- it is equivalent to a source pragma which appears after the
2653 -- related private type. To deal with forward references, the
2654 -- generated pragma is stored in the rep chain of the related
2655 -- private type as types do not carry contracts. The pragma is
2656 -- wrapped inside of a procedure at the freeze point of the
2657 -- private type's full view.
2659 when Aspect_Default_Initial_Condition =>
2661 (Pragma_Argument_Associations => New_List (
2662 Make_Pragma_Argument_Association (Loc,
2663 Expression => Relocate_Node (Expr))),
2665 Name_Default_Initial_Condition);
2667 Decorate (Aspect, Aitem);
2668 Insert_Pragma (Aitem);
2671 -- Default_Storage_Pool
2673 when Aspect_Default_Storage_Pool =>
2675 (Pragma_Argument_Associations => New_List (
2676 Make_Pragma_Argument_Association (Loc,
2677 Expression => Relocate_Node (Expr))),
2679 Name_Default_Storage_Pool);
2681 Decorate (Aspect, Aitem);
2682 Insert_Pragma (Aitem);
2687 -- Aspect Depends is never delayed because it is equivalent to
2688 -- a source pragma which appears after the related subprogram.
2689 -- To deal with forward references, the generated pragma is
2690 -- stored in the contract of the related subprogram and later
2691 -- analyzed at the end of the declarative region. See routine
2692 -- Analyze_Depends_In_Decl_Part for details.
2694 when Aspect_Depends =>
2696 (Pragma_Argument_Associations => New_List (
2697 Make_Pragma_Argument_Association (Loc,
2698 Expression => Relocate_Node (Expr))),
2699 Pragma_Name => Name_Depends);
2701 Decorate (Aspect, Aitem);
2702 Insert_Pragma (Aitem);
2705 -- Aspect Effecitve_Reads is never delayed because it is
2706 -- equivalent to a source pragma which appears after the
2707 -- related object declaration.
2709 when Aspect_Effective_Reads =>
2711 (Pragma_Argument_Associations => New_List (
2712 Make_Pragma_Argument_Association (Loc,
2713 Expression => Relocate_Node (Expr))),
2714 Pragma_Name => Name_Effective_Reads);
2716 Decorate (Aspect, Aitem);
2717 Insert_Pragma (Aitem);
2720 -- Aspect Effective_Writes is never delayed because it is
2721 -- equivalent to a source pragma which appears after the
2722 -- related object declaration.
2724 when Aspect_Effective_Writes =>
2726 (Pragma_Argument_Associations => New_List (
2727 Make_Pragma_Argument_Association (Loc,
2728 Expression => Relocate_Node (Expr))),
2729 Pragma_Name => Name_Effective_Writes);
2731 Decorate (Aspect, Aitem);
2732 Insert_Pragma (Aitem);
2735 -- Aspect Extensions_Visible is never delayed because it is
2736 -- equivalent to a source pragma which appears after the
2737 -- related subprogram.
2739 when Aspect_Extensions_Visible =>
2741 (Pragma_Argument_Associations => New_List (
2742 Make_Pragma_Argument_Association (Loc,
2743 Expression => Relocate_Node (Expr))),
2744 Pragma_Name => Name_Extensions_Visible);
2746 Decorate (Aspect, Aitem);
2747 Insert_Pragma (Aitem);
2750 -- Aspect Ghost is never delayed because it is equivalent to a
2751 -- source pragma which appears at the top of [generic] package
2752 -- declarations or after an object, a [generic] subprogram, or
2753 -- a type declaration.
2755 when Aspect_Ghost =>
2757 (Pragma_Argument_Associations => New_List (
2758 Make_Pragma_Argument_Association (Loc,
2759 Expression => Relocate_Node (Expr))),
2760 Pragma_Name => Name_Ghost);
2762 Decorate (Aspect, Aitem);
2763 Insert_Pragma (Aitem);
2768 -- Aspect Global is never delayed because it is equivalent to
2769 -- a source pragma which appears after the related subprogram.
2770 -- To deal with forward references, the generated pragma is
2771 -- stored in the contract of the related subprogram and later
2772 -- analyzed at the end of the declarative region. See routine
2773 -- Analyze_Global_In_Decl_Part for details.
2775 when Aspect_Global =>
2777 (Pragma_Argument_Associations => New_List (
2778 Make_Pragma_Argument_Association (Loc,
2779 Expression => Relocate_Node (Expr))),
2780 Pragma_Name => Name_Global);
2782 Decorate (Aspect, Aitem);
2783 Insert_Pragma (Aitem);
2786 -- Initial_Condition
2788 -- Aspect Initial_Condition is never delayed because it is
2789 -- equivalent to a source pragma which appears after the
2790 -- related package. To deal with forward references, the
2791 -- generated pragma is stored in the contract of the related
2792 -- package and later analyzed at the end of the declarative
2793 -- region. See routine Analyze_Initial_Condition_In_Decl_Part
2796 when Aspect_Initial_Condition => Initial_Condition : declare
2797 Context : Node_Id := N;
2800 -- When aspect Initial_Condition appears on a generic
2801 -- package, it is propageted to the package instance. The
2802 -- context in this case is the instance spec.
2804 if Nkind (Context) = N_Package_Instantiation then
2805 Context := Instance_Spec (Context);
2808 if Nkind_In (Context, N_Generic_Package_Declaration,
2809 N_Package_Declaration)
2812 (Pragma_Argument_Associations => New_List (
2813 Make_Pragma_Argument_Association (Loc,
2814 Expression => Relocate_Node (Expr))),
2816 Name_Initial_Condition);
2818 Decorate (Aspect, Aitem);
2822 Is_Generic_Instance (Defining_Entity (Context)));
2824 -- Otherwise the context is illegal
2828 ("aspect & must apply to a package declaration",
2833 end Initial_Condition;
2837 -- Aspect Initializes is never delayed because it is equivalent
2838 -- to a source pragma appearing after the related package. To
2839 -- deal with forward references, the generated pragma is stored
2840 -- in the contract of the related package and later analyzed at
2841 -- the end of the declarative region. For details, see routine
2842 -- Analyze_Initializes_In_Decl_Part.
2844 when Aspect_Initializes => Initializes : declare
2845 Context : Node_Id := N;
2848 -- When aspect Initializes appears on a generic package,
2849 -- it is propageted to the package instance. The context
2850 -- in this case is the instance spec.
2852 if Nkind (Context) = N_Package_Instantiation then
2853 Context := Instance_Spec (Context);
2856 if Nkind_In (Context, N_Generic_Package_Declaration,
2857 N_Package_Declaration)
2860 (Pragma_Argument_Associations => New_List (
2861 Make_Pragma_Argument_Association (Loc,
2862 Expression => Relocate_Node (Expr))),
2863 Pragma_Name => Name_Initializes);
2865 Decorate (Aspect, Aitem);
2869 Is_Generic_Instance (Defining_Entity (Context)));
2871 -- Otherwise the context is illegal
2875 ("aspect & must apply to a package declaration",
2884 when Aspect_Max_Queue_Length =>
2886 (Pragma_Argument_Associations => New_List (
2887 Make_Pragma_Argument_Association (Loc,
2888 Expression => Relocate_Node (Expr))),
2889 Pragma_Name => Name_Max_Queue_Length);
2891 Decorate (Aspect, Aitem);
2892 Insert_Pragma (Aitem);
2897 when Aspect_Obsolescent => declare
2905 Make_Pragma_Argument_Association (Sloc (Expr),
2906 Expression => Relocate_Node (Expr)));
2910 (Pragma_Argument_Associations => Args,
2911 Pragma_Name => Chars (Id));
2916 when Aspect_Part_Of =>
2917 if Nkind_In (N, N_Object_Declaration,
2918 N_Package_Instantiation)
2919 or else Is_Single_Concurrent_Type_Declaration (N)
2922 (Pragma_Argument_Associations => New_List (
2923 Make_Pragma_Argument_Association (Loc,
2924 Expression => Relocate_Node (Expr))),
2925 Pragma_Name => Name_Part_Of);
2927 Decorate (Aspect, Aitem);
2928 Insert_Pragma (Aitem);
2932 ("aspect & must apply to package instantiation, "
2933 & "object, single protected type or single task type",
2941 when Aspect_SPARK_Mode =>
2943 (Pragma_Argument_Associations => New_List (
2944 Make_Pragma_Argument_Association (Loc,
2945 Expression => Relocate_Node (Expr))),
2946 Pragma_Name => Name_SPARK_Mode);
2948 Decorate (Aspect, Aitem);
2949 Insert_Pragma (Aitem);
2954 -- Aspect Refined_Depends is never delayed because it is
2955 -- equivalent to a source pragma which appears in the
2956 -- declarations of the related subprogram body. To deal with
2957 -- forward references, the generated pragma is stored in the
2958 -- contract of the related subprogram body and later analyzed
2959 -- at the end of the declarative region. For details, see
2960 -- routine Analyze_Refined_Depends_In_Decl_Part.
2962 when Aspect_Refined_Depends =>
2964 (Pragma_Argument_Associations => New_List (
2965 Make_Pragma_Argument_Association (Loc,
2966 Expression => Relocate_Node (Expr))),
2967 Pragma_Name => Name_Refined_Depends);
2969 Decorate (Aspect, Aitem);
2970 Insert_Pragma (Aitem);
2975 -- Aspect Refined_Global is never delayed because it is
2976 -- equivalent to a source pragma which appears in the
2977 -- declarations of the related subprogram body. To deal with
2978 -- forward references, the generated pragma is stored in the
2979 -- contract of the related subprogram body and later analyzed
2980 -- at the end of the declarative region. For details, see
2981 -- routine Analyze_Refined_Global_In_Decl_Part.
2983 when Aspect_Refined_Global =>
2985 (Pragma_Argument_Associations => New_List (
2986 Make_Pragma_Argument_Association (Loc,
2987 Expression => Relocate_Node (Expr))),
2988 Pragma_Name => Name_Refined_Global);
2990 Decorate (Aspect, Aitem);
2991 Insert_Pragma (Aitem);
2996 when Aspect_Refined_Post =>
2998 (Pragma_Argument_Associations => New_List (
2999 Make_Pragma_Argument_Association (Loc,
3000 Expression => Relocate_Node (Expr))),
3001 Pragma_Name => Name_Refined_Post);
3003 Decorate (Aspect, Aitem);
3004 Insert_Pragma (Aitem);
3009 when Aspect_Refined_State =>
3011 -- The corresponding pragma for Refined_State is inserted in
3012 -- the declarations of the related package body. This action
3013 -- synchronizes both the source and from-aspect versions of
3016 if Nkind (N) = N_Package_Body then
3018 (Pragma_Argument_Associations => New_List (
3019 Make_Pragma_Argument_Association (Loc,
3020 Expression => Relocate_Node (Expr))),
3021 Pragma_Name => Name_Refined_State);
3023 Decorate (Aspect, Aitem);
3024 Insert_Pragma (Aitem);
3026 -- Otherwise the context is illegal
3030 ("aspect & must apply to a package body", Aspect, Id);
3035 -- Relative_Deadline
3037 when Aspect_Relative_Deadline =>
3039 (Pragma_Argument_Associations => New_List (
3040 Make_Pragma_Argument_Association (Loc,
3041 Expression => Relocate_Node (Expr))),
3042 Pragma_Name => Name_Relative_Deadline);
3044 -- If the aspect applies to a task, the corresponding pragma
3045 -- must appear within its declarations, not after.
3047 if Nkind (N) = N_Task_Type_Declaration then
3053 if No (Task_Definition (N)) then
3054 Set_Task_Definition (N,
3055 Make_Task_Definition (Loc,
3056 Visible_Declarations => New_List,
3057 End_Label => Empty));
3060 Def := Task_Definition (N);
3061 V := Visible_Declarations (Def);
3062 if not Is_Empty_List (V) then
3063 Insert_Before (First (V), Aitem);
3066 Set_Visible_Declarations (Def, New_List (Aitem));
3073 -- Aspect Volatile_Function is never delayed because it is
3074 -- equivalent to a source pragma which appears after the
3075 -- related subprogram.
3077 when Aspect_Volatile_Function =>
3079 (Pragma_Argument_Associations => New_List (
3080 Make_Pragma_Argument_Association (Loc,
3081 Expression => Relocate_Node (Expr))),
3082 Pragma_Name => Name_Volatile_Function);
3084 Decorate (Aspect, Aitem);
3085 Insert_Pragma (Aitem);
3088 -- Case 2e: Annotate aspect
3090 when Aspect_Annotate =>
3097 -- The argument can be a single identifier
3099 if Nkind (Expr) = N_Identifier then
3101 -- One level of parens is allowed
3103 if Paren_Count (Expr) > 1 then
3104 Error_Msg_F ("extra parentheses ignored", Expr);
3107 Set_Paren_Count (Expr, 0);
3109 -- Add the single item to the list
3111 Args := New_List (Expr);
3113 -- Otherwise we must have an aggregate
3115 elsif Nkind (Expr) = N_Aggregate then
3117 -- Must be positional
3119 if Present (Component_Associations (Expr)) then
3121 ("purely positional aggregate required", Expr);
3125 -- Must not be parenthesized
3127 if Paren_Count (Expr) /= 0 then
3128 Error_Msg_F ("extra parentheses ignored", Expr);
3131 -- List of arguments is list of aggregate expressions
3133 Args := Expressions (Expr);
3135 -- Anything else is illegal
3138 Error_Msg_F ("wrong form for Annotate aspect", Expr);
3142 -- Prepare pragma arguments
3145 Arg := First (Args);
3146 while Present (Arg) loop
3148 Make_Pragma_Argument_Association (Sloc (Arg),
3149 Expression => Relocate_Node (Arg)));
3154 Make_Pragma_Argument_Association (Sloc (Ent),
3155 Chars => Name_Entity,
3156 Expression => Ent));
3159 (Pragma_Argument_Associations => Pargs,
3160 Pragma_Name => Name_Annotate);
3163 -- Case 3 : Aspects that don't correspond to pragma/attribute
3164 -- definition clause.
3166 -- Case 3a: The aspects listed below don't correspond to
3167 -- pragmas/attributes but do require delayed analysis.
3169 -- Default_Value can only apply to a scalar type
3171 when Aspect_Default_Value =>
3172 if not Is_Scalar_Type (E) then
3174 ("aspect Default_Value must apply to a scalar type", N);
3179 -- Default_Component_Value can only apply to an array type
3180 -- with scalar components.
3182 when Aspect_Default_Component_Value =>
3183 if not (Is_Array_Type (E)
3184 and then Is_Scalar_Type (Component_Type (E)))
3187 ("aspect Default_Component_Value can only apply to an "
3188 & "array of scalar components", N);
3193 -- Case 3b: The aspects listed below don't correspond to
3194 -- pragmas/attributes and don't need delayed analysis.
3196 -- Implicit_Dereference
3198 -- For Implicit_Dereference, External_Name and Link_Name, only
3199 -- the legality checks are done during the analysis, thus no
3200 -- delay is required.
3202 when Aspect_Implicit_Dereference =>
3203 Analyze_Aspect_Implicit_Dereference;
3208 when Aspect_Dimension =>
3209 Analyze_Aspect_Dimension (N, Id, Expr);
3214 when Aspect_Dimension_System =>
3215 Analyze_Aspect_Dimension_System (N, Id, Expr);
3218 -- Case 4: Aspects requiring special handling
3220 -- Pre/Post/Test_Case/Contract_Cases whose corresponding
3221 -- pragmas take care of the delay.
3225 -- Aspects Pre/Post generate Precondition/Postcondition pragmas
3226 -- with a first argument that is the expression, and a second
3227 -- argument that is an informative message if the test fails.
3228 -- This is inserted right after the declaration, to get the
3229 -- required pragma placement. The processing for the pragmas
3230 -- takes care of the required delay.
3232 when Pre_Post_Aspects => Pre_Post : declare
3236 if A_Id = Aspect_Pre or else A_Id = Aspect_Precondition then
3237 Pname := Name_Precondition;
3239 Pname := Name_Postcondition;
3242 -- Check that the class-wide predicate cannot be applied to
3243 -- an operation of a synchronized type. AI12-0182 forbids
3244 -- these altogether, while earlier language semantics made
3245 -- them legal on tagged synchronized types.
3247 -- Other legality checks are performed when analyzing the
3248 -- contract of the operation.
3250 if Class_Present (Aspect)
3251 and then Is_Concurrent_Type (Current_Scope)
3252 and then Ekind_In (E, E_Entry, E_Function, E_Procedure)
3254 Error_Msg_Name_1 := Original_Aspect_Pragma_Name (Aspect);
3256 ("aspect % can only be specified for a primitive "
3257 & "operation of a tagged type", Aspect);
3262 -- If the expressions is of the form A and then B, then
3263 -- we generate separate Pre/Post aspects for the separate
3264 -- clauses. Since we allow multiple pragmas, there is no
3265 -- problem in allowing multiple Pre/Post aspects internally.
3266 -- These should be treated in reverse order (B first and
3267 -- A second) since they are later inserted just after N in
3268 -- the order they are treated. This way, the pragma for A
3269 -- ends up preceding the pragma for B, which may have an
3270 -- importance for the error raised (either constraint error
3271 -- or precondition error).
3273 -- We do not do this for Pre'Class, since we have to put
3274 -- these conditions together in a complex OR expression.
3276 -- We do not do this in ASIS mode, as ASIS relies on the
3277 -- original node representing the complete expression, when
3278 -- retrieving it through the source aspect table.
3281 and then (Pname = Name_Postcondition
3282 or else not Class_Present (Aspect))
3284 while Nkind (Expr) = N_And_Then loop
3285 Insert_After (Aspect,
3286 Make_Aspect_Specification (Sloc (Left_Opnd (Expr)),
3287 Identifier => Identifier (Aspect),
3288 Expression => Relocate_Node (Left_Opnd (Expr)),
3289 Class_Present => Class_Present (Aspect),
3290 Split_PPC => True));
3291 Rewrite (Expr, Relocate_Node (Right_Opnd (Expr)));
3292 Eloc := Sloc (Expr);
3296 -- Build the precondition/postcondition pragma
3298 -- Add note about why we do NOT need Copy_Tree here???
3301 (Pragma_Argument_Associations => New_List (
3302 Make_Pragma_Argument_Association (Eloc,
3303 Chars => Name_Check,
3304 Expression => Relocate_Node (Expr))),
3305 Pragma_Name => Pname);
3307 -- Add message unless exception messages are suppressed
3309 if not Opt.Exception_Locations_Suppressed then
3310 Append_To (Pragma_Argument_Associations (Aitem),
3311 Make_Pragma_Argument_Association (Eloc,
3312 Chars => Name_Message,
3314 Make_String_Literal (Eloc,
3316 & Get_Name_String (Pname)
3318 & Build_Location_String (Eloc))));
3321 Set_Is_Delayed_Aspect (Aspect);
3323 -- For Pre/Post cases, insert immediately after the entity
3324 -- declaration, since that is the required pragma placement.
3325 -- Note that for these aspects, we do not have to worry
3326 -- about delay issues, since the pragmas themselves deal
3327 -- with delay of visibility for the expression analysis.
3329 Insert_Pragma (Aitem);
3336 when Aspect_Test_Case => Test_Case : declare
3338 Comp_Expr : Node_Id;
3339 Comp_Assn : Node_Id;
3345 if Nkind (Parent (N)) = N_Compilation_Unit then
3346 Error_Msg_Name_1 := Nam;
3347 Error_Msg_N ("incorrect placement of aspect `%`", E);
3351 if Nkind (Expr) /= N_Aggregate then
3352 Error_Msg_Name_1 := Nam;
3354 ("wrong syntax for aspect `%` for &", Id, E);
3358 -- Make pragma expressions refer to the original aspect
3359 -- expressions through the Original_Node link. This is used
3360 -- in semantic analysis for ASIS mode, so that the original
3361 -- expression also gets analyzed.
3363 Comp_Expr := First (Expressions (Expr));
3364 while Present (Comp_Expr) loop
3365 New_Expr := Relocate_Node (Comp_Expr);
3367 Make_Pragma_Argument_Association (Sloc (Comp_Expr),
3368 Expression => New_Expr));
3372 Comp_Assn := First (Component_Associations (Expr));
3373 while Present (Comp_Assn) loop
3374 if List_Length (Choices (Comp_Assn)) /= 1
3376 Nkind (First (Choices (Comp_Assn))) /= N_Identifier
3378 Error_Msg_Name_1 := Nam;
3380 ("wrong syntax for aspect `%` for &", Id, E);
3385 Make_Pragma_Argument_Association (Sloc (Comp_Assn),
3386 Chars => Chars (First (Choices (Comp_Assn))),
3388 Relocate_Node (Expression (Comp_Assn))));
3392 -- Build the test-case pragma
3395 (Pragma_Argument_Associations => Args,
3396 Pragma_Name => Nam);
3401 when Aspect_Contract_Cases =>
3403 (Pragma_Argument_Associations => New_List (
3404 Make_Pragma_Argument_Association (Loc,
3405 Expression => Relocate_Node (Expr))),
3406 Pragma_Name => Nam);
3408 Decorate (Aspect, Aitem);
3409 Insert_Pragma (Aitem);
3412 -- Case 5: Special handling for aspects with an optional
3413 -- boolean argument.
3415 -- In the delayed case, the corresponding pragma cannot be
3416 -- generated yet because the evaluation of the boolean needs
3417 -- to be delayed till the freeze point.
3419 when Boolean_Aspects
3420 | Library_Unit_Aspects
3422 Set_Is_Boolean_Aspect (Aspect);
3424 -- Lock_Free aspect only apply to protected objects
3426 if A_Id = Aspect_Lock_Free then
3427 if Ekind (E) /= E_Protected_Type then
3428 Error_Msg_Name_1 := Nam;
3430 ("aspect % only applies to a protected object",
3434 -- Set the Uses_Lock_Free flag to True if there is no
3435 -- expression or if the expression is True. The
3436 -- evaluation of this aspect should be delayed to the
3437 -- freeze point (why???)
3440 or else Is_True (Static_Boolean (Expr))
3442 Set_Uses_Lock_Free (E);
3445 Record_Rep_Item (E, Aspect);
3450 elsif A_Id = Aspect_Export or else A_Id = Aspect_Import then
3451 Analyze_Aspect_Export_Import;
3453 -- Disable_Controlled
3455 elsif A_Id = Aspect_Disable_Controlled then
3456 if Ekind (E) /= E_Record_Type
3457 or else not Is_Controlled (E)
3460 ("aspect % requires controlled record type", Aspect);
3464 -- If we're in a generic template, we don't want to try
3465 -- to disable controlled types, because typical usage is
3466 -- "Disable_Controlled => not <some_check>'Enabled", and
3467 -- the value of Enabled is not known until we see a
3468 -- particular instance. In such a context, we just need
3469 -- to preanalyze the expression for legality.
3471 if Expander_Active then
3472 Analyze_And_Resolve (Expr, Standard_Boolean);
3474 if not Present (Expr)
3475 or else Is_True (Static_Boolean (Expr))
3477 Set_Disable_Controlled (E);
3480 elsif Serious_Errors_Detected = 0 then
3481 Preanalyze_And_Resolve (Expr, Standard_Boolean);
3487 -- Library unit aspects require special handling in the case
3488 -- of a package declaration, the pragma needs to be inserted
3489 -- in the list of declarations for the associated package.
3490 -- There is no issue of visibility delay for these aspects.
3492 if A_Id in Library_Unit_Aspects
3494 Nkind_In (N, N_Package_Declaration,
3495 N_Generic_Package_Declaration)
3496 and then Nkind (Parent (N)) /= N_Compilation_Unit
3498 -- Aspect is legal on a local instantiation of a library-
3499 -- level generic unit.
3501 and then not Is_Generic_Instance (Defining_Entity (N))
3504 ("incorrect context for library unit aspect&", Id);
3508 -- Cases where we do not delay, includes all cases where the
3509 -- expression is missing other than the above cases.
3511 if not Delay_Required or else No (Expr) then
3513 -- Exclude aspects Export and Import because their pragma
3514 -- syntax does not map directly to a Boolean aspect.
3516 if A_Id /= Aspect_Export
3517 and then A_Id /= Aspect_Import
3520 (Pragma_Argument_Associations => New_List (
3521 Make_Pragma_Argument_Association (Sloc (Ent),
3522 Expression => Ent)),
3523 Pragma_Name => Chars (Id));
3526 Delay_Required := False;
3528 -- In general cases, the corresponding pragma/attribute
3529 -- definition clause will be inserted later at the freezing
3530 -- point, and we do not need to build it now.
3538 -- This is special because for access types we need to generate
3539 -- an attribute definition clause. This also works for single
3540 -- task declarations, but it does not work for task type
3541 -- declarations, because we have the case where the expression
3542 -- references a discriminant of the task type. That can't use
3543 -- an attribute definition clause because we would not have
3544 -- visibility on the discriminant. For that case we must
3545 -- generate a pragma in the task definition.
3547 when Aspect_Storage_Size =>
3551 if Ekind (E) = E_Task_Type then
3553 Decl : constant Node_Id := Declaration_Node (E);
3556 pragma Assert (Nkind (Decl) = N_Task_Type_Declaration);
3558 -- If no task definition, create one
3560 if No (Task_Definition (Decl)) then
3561 Set_Task_Definition (Decl,
3562 Make_Task_Definition (Loc,
3563 Visible_Declarations => Empty_List,
3564 End_Label => Empty));
3567 -- Create a pragma and put it at the start of the task
3568 -- definition for the task type declaration.
3571 (Pragma_Argument_Associations => New_List (
3572 Make_Pragma_Argument_Association (Loc,
3573 Expression => Relocate_Node (Expr))),
3574 Pragma_Name => Name_Storage_Size);
3578 Visible_Declarations (Task_Definition (Decl)));
3582 -- All other cases, generate attribute definition
3586 Make_Attribute_Definition_Clause (Loc,
3588 Chars => Chars (Id),
3589 Expression => Relocate_Node (Expr));
3593 -- Attach the corresponding pragma/attribute definition clause to
3594 -- the aspect specification node.
3596 if Present (Aitem) then
3597 Set_From_Aspect_Specification (Aitem);
3600 -- In the context of a compilation unit, we directly put the
3601 -- pragma in the Pragmas_After list of the N_Compilation_Unit_Aux
3602 -- node (no delay is required here) except for aspects on a
3603 -- subprogram body (see below) and a generic package, for which we
3604 -- need to introduce the pragma before building the generic copy
3605 -- (see sem_ch12), and for package instantiations, where the
3606 -- library unit pragmas are better handled early.
3608 if Nkind (Parent (N)) = N_Compilation_Unit
3609 and then (Present (Aitem) or else Is_Boolean_Aspect (Aspect))
3612 Aux : constant Node_Id := Aux_Decls_Node (Parent (N));
3615 pragma Assert (Nkind (Aux) = N_Compilation_Unit_Aux);
3617 -- For a Boolean aspect, create the corresponding pragma if
3618 -- no expression or if the value is True.
3620 if Is_Boolean_Aspect (Aspect) and then No (Aitem) then
3621 if Is_True (Static_Boolean (Expr)) then
3623 (Pragma_Argument_Associations => New_List (
3624 Make_Pragma_Argument_Association (Sloc (Ent),
3625 Expression => Ent)),
3626 Pragma_Name => Chars (Id));
3628 Set_From_Aspect_Specification (Aitem, True);
3629 Set_Corresponding_Aspect (Aitem, Aspect);
3636 -- If the aspect is on a subprogram body (relevant aspect
3637 -- is Inline), add the pragma in front of the declarations.
3639 if Nkind (N) = N_Subprogram_Body then
3640 if No (Declarations (N)) then
3641 Set_Declarations (N, New_List);
3644 Prepend (Aitem, Declarations (N));
3646 elsif Nkind (N) = N_Generic_Package_Declaration then
3647 if No (Visible_Declarations (Specification (N))) then
3648 Set_Visible_Declarations (Specification (N), New_List);
3652 Visible_Declarations (Specification (N)));
3654 elsif Nkind (N) = N_Package_Instantiation then
3656 Spec : constant Node_Id :=
3657 Specification (Instance_Spec (N));
3659 if No (Visible_Declarations (Spec)) then
3660 Set_Visible_Declarations (Spec, New_List);
3663 Prepend (Aitem, Visible_Declarations (Spec));
3667 if No (Pragmas_After (Aux)) then
3668 Set_Pragmas_After (Aux, New_List);
3671 Append (Aitem, Pragmas_After (Aux));
3678 -- The evaluation of the aspect is delayed to the freezing point.
3679 -- The pragma or attribute clause if there is one is then attached
3680 -- to the aspect specification which is put in the rep item list.
3682 if Delay_Required then
3683 if Present (Aitem) then
3684 Set_Is_Delayed_Aspect (Aitem);
3685 Set_Aspect_Rep_Item (Aspect, Aitem);
3686 Set_Parent (Aitem, Aspect);
3689 Set_Is_Delayed_Aspect (Aspect);
3691 -- In the case of Default_Value, link the aspect to base type
3692 -- as well, even though it appears on a first subtype. This is
3693 -- mandated by the semantics of the aspect. Do not establish
3694 -- the link when processing the base type itself as this leads
3695 -- to a rep item circularity. Verify that we are dealing with
3696 -- a scalar type to prevent cascaded errors.
3698 if A_Id = Aspect_Default_Value
3699 and then Is_Scalar_Type (E)
3700 and then Base_Type (E) /= E
3702 Set_Has_Delayed_Aspects (Base_Type (E));
3703 Record_Rep_Item (Base_Type (E), Aspect);
3706 Set_Has_Delayed_Aspects (E);
3707 Record_Rep_Item (E, Aspect);
3709 -- When delay is not required and the context is a package or a
3710 -- subprogram body, insert the pragma in the body declarations.
3712 elsif Nkind_In (N, N_Package_Body, N_Subprogram_Body) then
3713 if No (Declarations (N)) then
3714 Set_Declarations (N, New_List);
3717 -- The pragma is added before source declarations
3719 Prepend_To (Declarations (N), Aitem);
3721 -- When delay is not required and the context is not a compilation
3722 -- unit, we simply insert the pragma/attribute definition clause
3725 elsif Present (Aitem) then
3726 Insert_After (Ins_Node, Aitem);
3729 end Analyze_One_Aspect;
3733 end loop Aspect_Loop;
3735 if Has_Delayed_Aspects (E) then
3736 Ensure_Freeze_Node (E);
3738 end Analyze_Aspect_Specifications;
3740 ---------------------------------------------------
3741 -- Analyze_Aspect_Specifications_On_Body_Or_Stub --
3742 ---------------------------------------------------
3744 procedure Analyze_Aspect_Specifications_On_Body_Or_Stub (N : Node_Id) is
3745 Body_Id : constant Entity_Id := Defining_Entity (N);
3747 procedure Diagnose_Misplaced_Aspects (Spec_Id : Entity_Id);
3748 -- Body [stub] N has aspects, but they are not properly placed. Emit an
3749 -- error message depending on the aspects involved. Spec_Id denotes the
3750 -- entity of the corresponding spec.
3752 --------------------------------
3753 -- Diagnose_Misplaced_Aspects --
3754 --------------------------------
3756 procedure Diagnose_Misplaced_Aspects (Spec_Id : Entity_Id) is
3757 procedure Misplaced_Aspect_Error
3760 -- Emit an error message concerning misplaced aspect Asp. Ref_Nam is
3761 -- the name of the refined version of the aspect.
3763 ----------------------------
3764 -- Misplaced_Aspect_Error --
3765 ----------------------------
3767 procedure Misplaced_Aspect_Error
3771 Asp_Nam : constant Name_Id := Chars (Identifier (Asp));
3772 Asp_Id : constant Aspect_Id := Get_Aspect_Id (Asp_Nam);
3775 -- The corresponding spec already contains the aspect in question
3776 -- and the one appearing on the body must be the refined form:
3778 -- procedure P with Global ...;
3779 -- procedure P with Global ... is ... end P;
3783 if Has_Aspect (Spec_Id, Asp_Id) then
3784 Error_Msg_Name_1 := Asp_Nam;
3786 -- Subunits cannot carry aspects that apply to a subprogram
3789 if Nkind (Parent (N)) = N_Subunit then
3790 Error_Msg_N ("aspect % cannot apply to a subunit", Asp);
3792 -- Otherwise suggest the refined form
3795 Error_Msg_Name_2 := Ref_Nam;
3796 Error_Msg_N ("aspect % should be %", Asp);
3799 -- Otherwise the aspect must appear on the spec, not on the body
3802 -- procedure P with Global ... is ... end P;
3806 ("aspect specification must appear on initial declaration",
3809 end Misplaced_Aspect_Error;
3816 -- Start of processing for Diagnose_Misplaced_Aspects
3819 -- Iterate over the aspect specifications and emit specific errors
3820 -- where applicable.
3822 Asp := First (Aspect_Specifications (N));
3823 while Present (Asp) loop
3824 Asp_Nam := Chars (Identifier (Asp));
3826 -- Do not emit errors on aspects that can appear on a subprogram
3827 -- body. This scenario occurs when the aspect specification list
3828 -- contains both misplaced and properly placed aspects.
3830 if Aspect_On_Body_Or_Stub_OK (Get_Aspect_Id (Asp_Nam)) then
3833 -- Special diagnostics for SPARK aspects
3835 elsif Asp_Nam = Name_Depends then
3836 Misplaced_Aspect_Error (Asp, Name_Refined_Depends);
3838 elsif Asp_Nam = Name_Global then
3839 Misplaced_Aspect_Error (Asp, Name_Refined_Global);
3841 elsif Asp_Nam = Name_Post then
3842 Misplaced_Aspect_Error (Asp, Name_Refined_Post);
3844 -- Otherwise a language-defined aspect is misplaced
3848 ("aspect specification must appear on initial declaration",
3854 end Diagnose_Misplaced_Aspects;
3858 Spec_Id : constant Entity_Id := Unique_Defining_Entity (N);
3860 -- Start of processing for Analyze_Aspects_On_Body_Or_Stub
3863 -- Language-defined aspects cannot be associated with a subprogram body
3864 -- [stub] if the subprogram has a spec. Certain implementation defined
3865 -- aspects are allowed to break this rule (for all applicable cases, see
3866 -- table Aspects.Aspect_On_Body_Or_Stub_OK).
3868 if Spec_Id /= Body_Id and then not Aspects_On_Body_Or_Stub_OK (N) then
3869 Diagnose_Misplaced_Aspects (Spec_Id);
3871 Analyze_Aspect_Specifications (N, Body_Id);
3873 end Analyze_Aspect_Specifications_On_Body_Or_Stub;
3875 -----------------------
3876 -- Analyze_At_Clause --
3877 -----------------------
3879 -- An at clause is replaced by the corresponding Address attribute
3880 -- definition clause that is the preferred approach in Ada 95.
3882 procedure Analyze_At_Clause (N : Node_Id) is
3883 CS : constant Boolean := Comes_From_Source (N);
3886 -- This is an obsolescent feature
3888 Check_Restriction (No_Obsolescent_Features, N);
3890 if Warn_On_Obsolescent_Feature then
3892 ("?j?at clause is an obsolescent feature (RM J.7(2))", N);
3894 ("\?j?use address attribute definition clause instead", N);
3897 -- Rewrite as address clause
3900 Make_Attribute_Definition_Clause (Sloc (N),
3901 Name => Identifier (N),
3902 Chars => Name_Address,
3903 Expression => Expression (N)));
3905 -- We preserve Comes_From_Source, since logically the clause still comes
3906 -- from the source program even though it is changed in form.
3908 Set_Comes_From_Source (N, CS);
3910 -- Analyze rewritten clause
3912 Analyze_Attribute_Definition_Clause (N);
3913 end Analyze_At_Clause;
3915 -----------------------------------------
3916 -- Analyze_Attribute_Definition_Clause --
3917 -----------------------------------------
3919 procedure Analyze_Attribute_Definition_Clause (N : Node_Id) is
3920 Loc : constant Source_Ptr := Sloc (N);
3921 Nam : constant Node_Id := Name (N);
3922 Attr : constant Name_Id := Chars (N);
3923 Expr : constant Node_Id := Expression (N);
3924 Id : constant Attribute_Id := Get_Attribute_Id (Attr);
3927 -- The entity of Nam after it is analyzed. In the case of an incomplete
3928 -- type, this is the underlying type.
3931 -- The underlying entity to which the attribute applies. Generally this
3932 -- is the Underlying_Type of Ent, except in the case where the clause
3933 -- applies to the full view of an incomplete or private type, in which
3934 -- case U_Ent is just a copy of Ent.
3936 FOnly : Boolean := False;
3937 -- Reset to True for subtype specific attribute (Alignment, Size)
3938 -- and for stream attributes, i.e. those cases where in the call to
3939 -- Rep_Item_Too_Late, FOnly is set True so that only the freezing rules
3940 -- are checked. Note that the case of stream attributes is not clear
3941 -- from the RM, but see AI95-00137. Also, the RM seems to disallow
3942 -- Storage_Size for derived task types, but that is also clearly
3945 procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type);
3946 -- Common processing for 'Read, 'Write, 'Input and 'Output attribute
3947 -- definition clauses.
3949 function Duplicate_Clause return Boolean;
3950 -- This routine checks if the aspect for U_Ent being given by attribute
3951 -- definition clause N is for an aspect that has already been specified,
3952 -- and if so gives an error message. If there is a duplicate, True is
3953 -- returned, otherwise if there is no error, False is returned.
3955 procedure Check_Indexing_Functions;
3956 -- Check that the function in Constant_Indexing or Variable_Indexing
3957 -- attribute has the proper type structure. If the name is overloaded,
3958 -- check that some interpretation is legal.
3960 procedure Check_Iterator_Functions;
3961 -- Check that there is a single function in Default_Iterator attribute
3962 -- has the proper type structure.
3964 function Check_Primitive_Function (Subp : Entity_Id) return Boolean;
3965 -- Common legality check for the previous two
3967 -----------------------------------
3968 -- Analyze_Stream_TSS_Definition --
3969 -----------------------------------
3971 procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type) is
3972 Subp : Entity_Id := Empty;
3977 Is_Read : constant Boolean := (TSS_Nam = TSS_Stream_Read);
3978 -- True for Read attribute, False for other attributes
3980 function Has_Good_Profile
3982 Report : Boolean := False) return Boolean;
3983 -- Return true if the entity is a subprogram with an appropriate
3984 -- profile for the attribute being defined. If result is False and
3985 -- Report is True, function emits appropriate error.
3987 ----------------------
3988 -- Has_Good_Profile --
3989 ----------------------
3991 function Has_Good_Profile
3993 Report : Boolean := False) return Boolean
3995 Expected_Ekind : constant array (Boolean) of Entity_Kind :=
3996 (False => E_Procedure, True => E_Function);
3997 Is_Function : constant Boolean := (TSS_Nam = TSS_Stream_Input);
4002 if Ekind (Subp) /= Expected_Ekind (Is_Function) then
4006 F := First_Formal (Subp);
4009 or else Ekind (Etype (F)) /= E_Anonymous_Access_Type
4010 or else Designated_Type (Etype (F)) /=
4011 Class_Wide_Type (RTE (RE_Root_Stream_Type))
4016 if not Is_Function then
4020 Expected_Mode : constant array (Boolean) of Entity_Kind :=
4021 (False => E_In_Parameter,
4022 True => E_Out_Parameter);
4024 if Parameter_Mode (F) /= Expected_Mode (Is_Read) then
4031 -- If the attribute specification comes from an aspect
4032 -- specification for a class-wide stream, the parameter must be
4033 -- a class-wide type of the entity to which the aspect applies.
4035 if From_Aspect_Specification (N)
4036 and then Class_Present (Parent (N))
4037 and then Is_Class_Wide_Type (Typ)
4043 Typ := Etype (Subp);
4046 -- Verify that the prefix of the attribute and the local name for
4047 -- the type of the formal match, or one is the class-wide of the
4048 -- other, in the case of a class-wide stream operation.
4050 if Base_Type (Typ) = Base_Type (Ent)
4051 or else (Is_Class_Wide_Type (Typ)
4052 and then Typ = Class_Wide_Type (Base_Type (Ent)))
4053 or else (Is_Class_Wide_Type (Ent)
4054 and then Ent = Class_Wide_Type (Base_Type (Typ)))
4061 if Present (Next_Formal (F)) then
4064 elsif not Is_Scalar_Type (Typ)
4065 and then not Is_First_Subtype (Typ)
4066 and then not Is_Class_Wide_Type (Typ)
4068 if Report and not Is_First_Subtype (Typ) then
4070 ("subtype of formal in stream operation must be a first "
4071 & "subtype", Parameter_Type (Parent (F)));
4079 end Has_Good_Profile;
4081 -- Start of processing for Analyze_Stream_TSS_Definition
4086 if not Is_Type (U_Ent) then
4087 Error_Msg_N ("local name must be a subtype", Nam);
4090 elsif not Is_First_Subtype (U_Ent) then
4091 Error_Msg_N ("local name must be a first subtype", Nam);
4095 Pnam := TSS (Base_Type (U_Ent), TSS_Nam);
4097 -- If Pnam is present, it can be either inherited from an ancestor
4098 -- type (in which case it is legal to redefine it for this type), or
4099 -- be a previous definition of the attribute for the same type (in
4100 -- which case it is illegal).
4102 -- In the first case, it will have been analyzed already, and we
4103 -- can check that its profile does not match the expected profile
4104 -- for a stream attribute of U_Ent. In the second case, either Pnam
4105 -- has been analyzed (and has the expected profile), or it has not
4106 -- been analyzed yet (case of a type that has not been frozen yet
4107 -- and for which the stream attribute has been set using Set_TSS).
4110 and then (No (First_Entity (Pnam)) or else Has_Good_Profile (Pnam))
4112 Error_Msg_Sloc := Sloc (Pnam);
4113 Error_Msg_Name_1 := Attr;
4114 Error_Msg_N ("% attribute already defined #", Nam);
4120 if Is_Entity_Name (Expr) then
4121 if not Is_Overloaded (Expr) then
4122 if Has_Good_Profile (Entity (Expr), Report => True) then
4123 Subp := Entity (Expr);
4127 Get_First_Interp (Expr, I, It);
4128 while Present (It.Nam) loop
4129 if Has_Good_Profile (It.Nam) then
4134 Get_Next_Interp (I, It);
4139 if Present (Subp) then
4140 if Is_Abstract_Subprogram (Subp) then
4141 Error_Msg_N ("stream subprogram must not be abstract", Expr);
4144 -- A stream subprogram for an interface type must be a null
4145 -- procedure (RM 13.13.2 (38/3)). Note that the class-wide type
4146 -- of an interface is not an interface type (3.9.4 (6.b/2)).
4148 elsif Is_Interface (U_Ent)
4149 and then not Is_Class_Wide_Type (U_Ent)
4150 and then not Inside_A_Generic
4152 (Ekind (Subp) = E_Function
4156 (Unit_Declaration_Node (Ultimate_Alias (Subp)))))
4159 ("stream subprogram for interface type must be null "
4160 & "procedure", Expr);
4163 Set_Entity (Expr, Subp);
4164 Set_Etype (Expr, Etype (Subp));
4166 New_Stream_Subprogram (N, U_Ent, Subp, TSS_Nam);
4169 Error_Msg_Name_1 := Attr;
4170 Error_Msg_N ("incorrect expression for% attribute", Expr);
4172 end Analyze_Stream_TSS_Definition;
4174 ------------------------------
4175 -- Check_Indexing_Functions --
4176 ------------------------------
4178 procedure Check_Indexing_Functions is
4179 Indexing_Found : Boolean := False;
4181 procedure Check_Inherited_Indexing;
4182 -- For a derived type, check that no indexing aspect is specified
4183 -- for the type if it is also inherited
4185 procedure Check_One_Function (Subp : Entity_Id);
4186 -- Check one possible interpretation. Sets Indexing_Found True if a
4187 -- legal indexing function is found.
4189 procedure Illegal_Indexing (Msg : String);
4190 -- Diagnose illegal indexing function if not overloaded. In the
4191 -- overloaded case indicate that no legal interpretation exists.
4193 ------------------------------
4194 -- Check_Inherited_Indexing --
4195 ------------------------------
4197 procedure Check_Inherited_Indexing is
4198 Inherited : Node_Id;
4201 if Attr = Name_Constant_Indexing then
4203 Find_Aspect (Etype (Ent), Aspect_Constant_Indexing);
4204 else pragma Assert (Attr = Name_Variable_Indexing);
4206 Find_Aspect (Etype (Ent), Aspect_Variable_Indexing);
4209 if Present (Inherited) then
4210 if Debug_Flag_Dot_XX then
4213 -- OK if current attribute_definition_clause is expansion of
4214 -- inherited aspect.
4216 elsif Aspect_Rep_Item (Inherited) = N then
4219 -- Indicate the operation that must be overridden, rather than
4220 -- redefining the indexing aspect.
4224 ("indexing function already inherited from parent type");
4226 ("!override & instead",
4227 N, Entity (Expression (Inherited)));
4230 end Check_Inherited_Indexing;
4232 ------------------------
4233 -- Check_One_Function --
4234 ------------------------
4236 procedure Check_One_Function (Subp : Entity_Id) is
4237 Default_Element : Node_Id;
4238 Ret_Type : constant Entity_Id := Etype (Subp);
4241 if not Is_Overloadable (Subp) then
4242 Illegal_Indexing ("illegal indexing function for type&");
4245 elsif Scope (Subp) /= Scope (Ent) then
4246 if Nkind (Expr) = N_Expanded_Name then
4248 -- Indexing function can't be declared elsewhere
4251 ("indexing function must be declared in scope of type&");
4256 elsif No (First_Formal (Subp)) then
4258 ("Indexing requires a function that applies to type&");
4261 elsif No (Next_Formal (First_Formal (Subp))) then
4263 ("indexing function must have at least two parameters");
4266 elsif Is_Derived_Type (Ent) then
4267 Check_Inherited_Indexing;
4270 if not Check_Primitive_Function (Subp) then
4272 ("Indexing aspect requires a function that applies to type&");
4276 -- If partial declaration exists, verify that it is not tagged.
4278 if Ekind (Current_Scope) = E_Package
4279 and then Has_Private_Declaration (Ent)
4280 and then From_Aspect_Specification (N)
4282 List_Containing (Parent (Ent)) =
4283 Private_Declarations
4284 (Specification (Unit_Declaration_Node (Current_Scope)))
4285 and then Nkind (N) = N_Attribute_Definition_Clause
4292 First (Visible_Declarations
4294 (Unit_Declaration_Node (Current_Scope))));
4296 while Present (Decl) loop
4297 if Nkind (Decl) = N_Private_Type_Declaration
4298 and then Ent = Full_View (Defining_Identifier (Decl))
4299 and then Tagged_Present (Decl)
4300 and then No (Aspect_Specifications (Decl))
4303 ("Indexing aspect cannot be specified on full view "
4304 & "if partial view is tagged");
4313 -- An indexing function must return either the default element of
4314 -- the container, or a reference type. For variable indexing it
4315 -- must be the latter.
4318 Find_Value_Of_Aspect
4319 (Etype (First_Formal (Subp)), Aspect_Iterator_Element);
4321 if Present (Default_Element) then
4322 Analyze (Default_Element);
4324 if Is_Entity_Name (Default_Element)
4325 and then not Covers (Entity (Default_Element), Ret_Type)
4329 ("wrong return type for indexing function");
4334 -- For variable_indexing the return type must be a reference type
4336 if Attr = Name_Variable_Indexing then
4337 if not Has_Implicit_Dereference (Ret_Type) then
4339 ("variable indexing must return a reference type");
4342 elsif Is_Access_Constant
4343 (Etype (First_Discriminant (Ret_Type)))
4346 ("variable indexing must return an access to variable");
4351 if Has_Implicit_Dereference (Ret_Type)
4353 Is_Access_Constant (Etype (First_Discriminant (Ret_Type)))
4356 ("constant indexing must return an access to constant");
4359 elsif Is_Access_Type (Etype (First_Formal (Subp)))
4360 and then not Is_Access_Constant (Etype (First_Formal (Subp)))
4363 ("constant indexing must apply to an access to constant");
4368 -- All checks succeeded.
4370 Indexing_Found := True;
4371 end Check_One_Function;
4373 -----------------------
4374 -- Illegal_Indexing --
4375 -----------------------
4377 procedure Illegal_Indexing (Msg : String) is
4379 Error_Msg_NE (Msg, N, Ent);
4380 end Illegal_Indexing;
4382 -- Start of processing for Check_Indexing_Functions
4386 Check_Inherited_Indexing;
4391 if not Is_Overloaded (Expr) then
4392 Check_One_Function (Entity (Expr));
4400 Indexing_Found := False;
4401 Get_First_Interp (Expr, I, It);
4402 while Present (It.Nam) loop
4404 -- Note that analysis will have added the interpretation
4405 -- that corresponds to the dereference. We only check the
4406 -- subprogram itself. Ignore homonyms that may come from
4407 -- derived types in the context.
4409 if Is_Overloadable (It.Nam)
4410 and then Comes_From_Source (It.Nam)
4412 Check_One_Function (It.Nam);
4415 Get_Next_Interp (I, It);
4420 if not Indexing_Found and then not Error_Posted (N) then
4422 ("aspect Indexing requires a local function that applies to "
4423 & "type&", Expr, Ent);
4425 end Check_Indexing_Functions;
4427 ------------------------------
4428 -- Check_Iterator_Functions --
4429 ------------------------------
4431 procedure Check_Iterator_Functions is
4432 function Valid_Default_Iterator (Subp : Entity_Id) return Boolean;
4433 -- Check one possible interpretation for validity
4435 ----------------------------
4436 -- Valid_Default_Iterator --
4437 ----------------------------
4439 function Valid_Default_Iterator (Subp : Entity_Id) return Boolean is
4440 Root_T : constant Entity_Id := Root_Type (Etype (Etype (Subp)));
4444 if not Check_Primitive_Function (Subp) then
4447 -- The return type must be derived from a type in an instance
4448 -- of Iterator.Interfaces, and thus its root type must have a
4451 elsif Chars (Root_T) /= Name_Forward_Iterator
4452 and then Chars (Root_T) /= Name_Reversible_Iterator
4457 Formal := First_Formal (Subp);
4460 -- False if any subsequent formal has no default expression
4462 Formal := Next_Formal (Formal);
4463 while Present (Formal) loop
4464 if No (Expression (Parent (Formal))) then
4468 Next_Formal (Formal);
4471 -- True if all subsequent formals have default expressions
4474 end Valid_Default_Iterator;
4476 -- Start of processing for Check_Iterator_Functions
4481 if not Is_Entity_Name (Expr) then
4482 Error_Msg_N ("aspect Iterator must be a function name", Expr);
4485 if not Is_Overloaded (Expr) then
4486 if not Check_Primitive_Function (Entity (Expr)) then
4488 ("aspect Indexing requires a function that applies to type&",
4489 Entity (Expr), Ent);
4492 -- Flag the default_iterator as well as the denoted function.
4494 if not Valid_Default_Iterator (Entity (Expr)) then
4495 Error_Msg_N ("improper function for default iterator!", Expr);
4500 Default : Entity_Id := Empty;
4505 Get_First_Interp (Expr, I, It);
4506 while Present (It.Nam) loop
4507 if not Check_Primitive_Function (It.Nam)
4508 or else not Valid_Default_Iterator (It.Nam)
4512 elsif Present (Default) then
4514 -- An explicit one should override an implicit one
4516 if Comes_From_Source (Default) =
4517 Comes_From_Source (It.Nam)
4519 Error_Msg_N ("default iterator must be unique", Expr);
4520 Error_Msg_Sloc := Sloc (Default);
4521 Error_Msg_N ("\\possible interpretation#", Expr);
4522 Error_Msg_Sloc := Sloc (It.Nam);
4523 Error_Msg_N ("\\possible interpretation#", Expr);
4525 elsif Comes_From_Source (It.Nam) then
4532 Get_Next_Interp (I, It);
4535 if Present (Default) then
4536 Set_Entity (Expr, Default);
4537 Set_Is_Overloaded (Expr, False);
4540 ("no interpretation is a valid default iterator!", Expr);
4544 end Check_Iterator_Functions;
4546 -------------------------------
4547 -- Check_Primitive_Function --
4548 -------------------------------
4550 function Check_Primitive_Function (Subp : Entity_Id) return Boolean is
4554 if Ekind (Subp) /= E_Function then
4558 if No (First_Formal (Subp)) then
4561 Ctrl := Etype (First_Formal (Subp));
4564 -- To be a primitive operation subprogram has to be in same scope.
4566 if Scope (Ctrl) /= Scope (Subp) then
4570 -- Type of formal may be the class-wide type, an access to such,
4571 -- or an incomplete view.
4574 or else Ctrl = Class_Wide_Type (Ent)
4576 (Ekind (Ctrl) = E_Anonymous_Access_Type
4577 and then (Designated_Type (Ctrl) = Ent
4579 Designated_Type (Ctrl) = Class_Wide_Type (Ent)))
4581 (Ekind (Ctrl) = E_Incomplete_Type
4582 and then Full_View (Ctrl) = Ent)
4590 end Check_Primitive_Function;
4592 ----------------------
4593 -- Duplicate_Clause --
4594 ----------------------
4596 function Duplicate_Clause return Boolean is
4600 -- Nothing to do if this attribute definition clause comes from
4601 -- an aspect specification, since we could not be duplicating an
4602 -- explicit clause, and we dealt with the case of duplicated aspects
4603 -- in Analyze_Aspect_Specifications.
4605 if From_Aspect_Specification (N) then
4609 -- Otherwise current clause may duplicate previous clause, or a
4610 -- previously given pragma or aspect specification for the same
4613 A := Get_Rep_Item (U_Ent, Chars (N), Check_Parents => False);
4616 Error_Msg_Name_1 := Chars (N);
4617 Error_Msg_Sloc := Sloc (A);
4619 Error_Msg_NE ("aspect% for & previously given#", N, U_Ent);
4624 end Duplicate_Clause;
4626 -- Start of processing for Analyze_Attribute_Definition_Clause
4629 -- The following code is a defense against recursion. Not clear that
4630 -- this can happen legitimately, but perhaps some error situations can
4631 -- cause it, and we did see this recursion during testing.
4633 if Analyzed (N) then
4636 Set_Analyzed (N, True);
4639 Check_Restriction_No_Use_Of_Attribute (N);
4641 -- Ignore some selected attributes in CodePeer mode since they are not
4642 -- relevant in this context.
4644 if CodePeer_Mode then
4647 -- Ignore Component_Size in CodePeer mode, to avoid changing the
4648 -- internal representation of types by implicitly packing them.
4650 when Attribute_Component_Size =>
4651 Rewrite (N, Make_Null_Statement (Sloc (N)));
4659 -- Process Ignore_Rep_Clauses option
4661 if Ignore_Rep_Clauses then
4664 -- The following should be ignored. They do not affect legality
4665 -- and may be target dependent. The basic idea of -gnatI is to
4666 -- ignore any rep clauses that may be target dependent but do not
4667 -- affect legality (except possibly to be rejected because they
4668 -- are incompatible with the compilation target).
4670 when Attribute_Alignment
4671 | Attribute_Bit_Order
4672 | Attribute_Component_Size
4673 | Attribute_Default_Scalar_Storage_Order
4674 | Attribute_Machine_Radix
4675 | Attribute_Object_Size
4676 | Attribute_Scalar_Storage_Order
4679 | Attribute_Stream_Size
4680 | Attribute_Value_Size
4682 Kill_Rep_Clause (N);
4685 -- The following should not be ignored, because in the first place
4686 -- they are reasonably portable, and should not cause problems
4687 -- in compiling code from another target, and also they do affect
4688 -- legality, e.g. failing to provide a stream attribute for a type
4689 -- may make a program illegal.
4691 when Attribute_External_Tag
4695 | Attribute_Simple_Storage_Pool
4696 | Attribute_Storage_Pool
4697 | Attribute_Storage_Size
4702 -- We do not do anything here with address clauses, they will be
4703 -- removed by Freeze later on, but for now, it works better to
4704 -- keep them in the tree.
4706 when Attribute_Address =>
4709 -- Other cases are errors ("attribute& cannot be set with
4710 -- definition clause"), which will be caught below.
4718 Ent := Entity (Nam);
4720 if Rep_Item_Too_Early (Ent, N) then
4724 -- Rep clause applies to full view of incomplete type or private type if
4725 -- we have one (if not, this is a premature use of the type). However,
4726 -- certain semantic checks need to be done on the specified entity (i.e.
4727 -- the private view), so we save it in Ent.
4729 if Is_Private_Type (Ent)
4730 and then Is_Derived_Type (Ent)
4731 and then not Is_Tagged_Type (Ent)
4732 and then No (Full_View (Ent))
4734 -- If this is a private type whose completion is a derivation from
4735 -- another private type, there is no full view, and the attribute
4736 -- belongs to the type itself, not its underlying parent.
4740 elsif Ekind (Ent) = E_Incomplete_Type then
4742 -- The attribute applies to the full view, set the entity of the
4743 -- attribute definition accordingly.
4745 Ent := Underlying_Type (Ent);
4747 Set_Entity (Nam, Ent);
4750 U_Ent := Underlying_Type (Ent);
4753 -- Avoid cascaded error
4755 if Etype (Nam) = Any_Type then
4758 -- Must be declared in current scope or in case of an aspect
4759 -- specification, must be visible in current scope.
4761 elsif Scope (Ent) /= Current_Scope
4763 not (From_Aspect_Specification (N)
4764 and then Scope_Within_Or_Same (Current_Scope, Scope (Ent)))
4766 Error_Msg_N ("entity must be declared in this scope", Nam);
4769 -- Must not be a source renaming (we do have some cases where the
4770 -- expander generates a renaming, and those cases are OK, in such
4771 -- cases any attribute applies to the renamed object as well).
4773 elsif Is_Object (Ent)
4774 and then Present (Renamed_Object (Ent))
4776 -- Case of renamed object from source, this is an error
4778 if Comes_From_Source (Renamed_Object (Ent)) then
4779 Get_Name_String (Chars (N));
4780 Error_Msg_Strlen := Name_Len;
4781 Error_Msg_String (1 .. Name_Len) := Name_Buffer (1 .. Name_Len);
4783 ("~ clause not allowed for a renaming declaration "
4784 & "(RM 13.1(6))", Nam);
4787 -- For the case of a compiler generated renaming, the attribute
4788 -- definition clause applies to the renamed object created by the
4789 -- expander. The easiest general way to handle this is to create a
4790 -- copy of the attribute definition clause for this object.
4792 elsif Is_Entity_Name (Renamed_Object (Ent)) then
4794 Make_Attribute_Definition_Clause (Loc,
4796 New_Occurrence_Of (Entity (Renamed_Object (Ent)), Loc),
4798 Expression => Duplicate_Subexpr (Expression (N))));
4800 -- If the renamed object is not an entity, it must be a dereference
4801 -- of an unconstrained function call, and we must introduce a new
4802 -- declaration to capture the expression. This is needed in the case
4803 -- of 'Alignment, where the original declaration must be rewritten.
4807 (Nkind (Renamed_Object (Ent)) = N_Explicit_Dereference);
4811 -- If no underlying entity, use entity itself, applies to some
4812 -- previously detected error cases ???
4814 elsif No (U_Ent) then
4817 -- Cannot specify for a subtype (exception Object/Value_Size)
4819 elsif Is_Type (U_Ent)
4820 and then not Is_First_Subtype (U_Ent)
4821 and then Id /= Attribute_Object_Size
4822 and then Id /= Attribute_Value_Size
4823 and then not From_At_Mod (N)
4825 Error_Msg_N ("cannot specify attribute for subtype", Nam);
4829 Set_Entity (N, U_Ent);
4831 -- Switch on particular attribute
4839 -- Address attribute definition clause
4841 when Attribute_Address => Address : begin
4843 -- A little error check, catch for X'Address use X'Address;
4845 if Nkind (Nam) = N_Identifier
4846 and then Nkind (Expr) = N_Attribute_Reference
4847 and then Attribute_Name (Expr) = Name_Address
4848 and then Nkind (Prefix (Expr)) = N_Identifier
4849 and then Chars (Nam) = Chars (Prefix (Expr))
4852 ("address for & is self-referencing", Prefix (Expr), Ent);
4856 -- Not that special case, carry on with analysis of expression
4858 Analyze_And_Resolve (Expr, RTE (RE_Address));
4860 -- Even when ignoring rep clauses we need to indicate that the
4861 -- entity has an address clause and thus it is legal to declare
4862 -- it imported. Freeze will get rid of the address clause later.
4863 -- Also call Set_Address_Taken to indicate that an address clause
4864 -- was present, even if we are about to remove it.
4866 if Ignore_Rep_Clauses then
4867 Set_Address_Taken (U_Ent);
4869 if Ekind_In (U_Ent, E_Variable, E_Constant) then
4870 Record_Rep_Item (U_Ent, N);
4876 if Duplicate_Clause then
4879 -- Case of address clause for subprogram
4881 elsif Is_Subprogram (U_Ent) then
4882 if Has_Homonym (U_Ent) then
4884 ("address clause cannot be given for overloaded "
4885 & "subprogram", Nam);
4889 -- For subprograms, all address clauses are permitted, and we
4890 -- mark the subprogram as having a deferred freeze so that Gigi
4891 -- will not elaborate it too soon.
4893 -- Above needs more comments, what is too soon about???
4895 Set_Has_Delayed_Freeze (U_Ent);
4897 -- Case of address clause for entry
4899 elsif Ekind (U_Ent) = E_Entry then
4900 if Nkind (Parent (N)) = N_Task_Body then
4902 ("entry address must be specified in task spec", Nam);
4906 -- For entries, we require a constant address
4908 Check_Constant_Address_Clause (Expr, U_Ent);
4910 -- Special checks for task types
4912 if Is_Task_Type (Scope (U_Ent))
4913 and then Comes_From_Source (Scope (U_Ent))
4916 ("??entry address declared for entry in task type", N);
4918 ("\??only one task can be declared of this type", N);
4921 -- Entry address clauses are obsolescent
4923 Check_Restriction (No_Obsolescent_Features, N);
4925 if Warn_On_Obsolescent_Feature then
4927 ("?j?attaching interrupt to task entry is an obsolescent "
4928 & "feature (RM J.7.1)", N);
4930 ("\?j?use interrupt procedure instead", N);
4933 -- Case of an address clause for a class-wide object, which is
4934 -- considered erroneous.
4936 elsif Is_Class_Wide_Type (Etype (U_Ent)) then
4938 ("??class-wide object & must not be overlaid", Nam, U_Ent);
4940 ("\??Program_Error will be raised at run time", Nam);
4941 Insert_Action (Declaration_Node (U_Ent),
4942 Make_Raise_Program_Error (Loc,
4943 Reason => PE_Overlaid_Controlled_Object));
4946 -- Case of address clause for an object
4948 elsif Ekind_In (U_Ent, E_Constant, E_Variable) then
4950 Expr : constant Node_Id := Expression (N);
4955 -- Exported variables cannot have an address clause, because
4956 -- this cancels the effect of the pragma Export.
4958 if Is_Exported (U_Ent) then
4960 ("cannot export object with address clause", Nam);
4964 Find_Overlaid_Entity (N, O_Ent, Off);
4966 if Present (O_Ent) then
4968 -- If the object overlays a constant object, mark it so
4970 if Is_Constant_Object (O_Ent) then
4971 Set_Overlays_Constant (U_Ent);
4974 -- If the address clause is of the form:
4976 -- for X'Address use Y'Address;
4980 -- C : constant Address := Y'Address;
4982 -- for X'Address use C;
4984 -- then we make an entry in the table to check the size
4985 -- and alignment of the overlaying variable. But we defer
4986 -- this check till after code generation to take full
4987 -- advantage of the annotation done by the back end.
4989 -- If the entity has a generic type, the check will be
4990 -- performed in the instance if the actual type justifies
4991 -- it, and we do not insert the clause in the table to
4992 -- prevent spurious warnings.
4994 -- Note: we used to test Comes_From_Source and only give
4995 -- this warning for source entities, but we have removed
4996 -- this test. It really seems bogus to generate overlays
4997 -- that would trigger this warning in generated code.
4998 -- Furthermore, by removing the test, we handle the
4999 -- aspect case properly.
5001 if Is_Object (O_Ent)
5002 and then not Is_Generic_Type (Etype (U_Ent))
5003 and then Address_Clause_Overlay_Warnings
5005 Address_Clause_Checks.Append
5006 ((N, U_Ent, No_Uint, O_Ent, Off));
5009 -- If this is not an overlay, mark a variable as being
5010 -- volatile to prevent unwanted optimizations. It's a
5011 -- conservative interpretation of RM 13.3(19) for the
5012 -- cases where the compiler cannot detect potential
5013 -- aliasing issues easily and it also covers the case
5014 -- of an absolute address where the volatile aspect is
5015 -- kind of implicit.
5017 if Ekind (U_Ent) = E_Variable then
5018 Set_Treat_As_Volatile (U_Ent);
5021 -- Make an entry in the table for an absolute address as
5022 -- above to check that the value is compatible with the
5023 -- alignment of the object.
5026 Addr : constant Node_Id := Address_Value (Expr);
5028 if Compile_Time_Known_Value (Addr)
5029 and then Address_Clause_Overlay_Warnings
5031 Address_Clause_Checks.Append
5032 ((N, U_Ent, Expr_Value (Addr), Empty, False));
5037 -- Issue an unconditional warning for a constant overlaying
5038 -- a variable. For the reverse case, we will issue it only
5039 -- if the variable is modified.
5041 if Ekind (U_Ent) = E_Constant
5042 and then Present (O_Ent)
5043 and then not Overlays_Constant (U_Ent)
5044 and then Address_Clause_Overlay_Warnings
5046 Error_Msg_N ("??constant overlays a variable", Expr);
5048 -- Imported variables can have an address clause, but then
5049 -- the import is pretty meaningless except to suppress
5050 -- initializations, so we do not need such variables to
5051 -- be statically allocated (and in fact it causes trouble
5052 -- if the address clause is a local value).
5054 elsif Is_Imported (U_Ent) then
5055 Set_Is_Statically_Allocated (U_Ent, False);
5058 -- We mark a possible modification of a variable with an
5059 -- address clause, since it is likely aliasing is occurring.
5061 Note_Possible_Modification (Nam, Sure => False);
5063 -- Legality checks on the address clause for initialized
5064 -- objects is deferred until the freeze point, because
5065 -- a subsequent pragma might indicate that the object
5066 -- is imported and thus not initialized. Also, the address
5067 -- clause might involve entities that have yet to be
5070 Set_Has_Delayed_Freeze (U_Ent);
5072 -- If an initialization call has been generated for this
5073 -- object, it needs to be deferred to after the freeze node
5074 -- we have just now added, otherwise GIGI will see a
5075 -- reference to the variable (as actual to the IP call)
5076 -- before its definition.
5079 Init_Call : constant Node_Id :=
5080 Remove_Init_Call (U_Ent, N);
5083 if Present (Init_Call) then
5084 Append_Freeze_Action (U_Ent, Init_Call);
5086 -- Reset Initialization_Statements pointer so that
5087 -- if there is a pragma Import further down, it can
5088 -- clear any default initialization.
5090 Set_Initialization_Statements (U_Ent, Init_Call);
5094 -- Entity has delayed freeze, so we will generate an
5095 -- alignment check at the freeze point unless suppressed.
5097 if not Range_Checks_Suppressed (U_Ent)
5098 and then not Alignment_Checks_Suppressed (U_Ent)
5100 Set_Check_Address_Alignment (N);
5103 -- Kill the size check code, since we are not allocating
5104 -- the variable, it is somewhere else.
5106 Kill_Size_Check_Code (U_Ent);
5109 -- Not a valid entity for an address clause
5112 Error_Msg_N ("address cannot be given for &", Nam);
5120 -- Alignment attribute definition clause
5122 when Attribute_Alignment => Alignment : declare
5123 Align : constant Uint := Get_Alignment_Value (Expr);
5124 Max_Align : constant Uint := UI_From_Int (Maximum_Alignment);
5129 if not Is_Type (U_Ent)
5130 and then Ekind (U_Ent) /= E_Variable
5131 and then Ekind (U_Ent) /= E_Constant
5133 Error_Msg_N ("alignment cannot be given for &", Nam);
5135 elsif Duplicate_Clause then
5138 elsif Align /= No_Uint then
5139 Set_Has_Alignment_Clause (U_Ent);
5141 -- Tagged type case, check for attempt to set alignment to a
5142 -- value greater than Max_Align, and reset if so. This error
5143 -- is suppressed in ASIS mode to allow for different ASIS
5144 -- back ends or ASIS-based tools to query the illegal clause.
5146 if Is_Tagged_Type (U_Ent)
5147 and then Align > Max_Align
5148 and then not ASIS_Mode
5151 ("alignment for & set to Maximum_Aligment??", Nam);
5152 Set_Alignment (U_Ent, Max_Align);
5157 Set_Alignment (U_Ent, Align);
5160 -- For an array type, U_Ent is the first subtype. In that case,
5161 -- also set the alignment of the anonymous base type so that
5162 -- other subtypes (such as the itypes for aggregates of the
5163 -- type) also receive the expected alignment.
5165 if Is_Array_Type (U_Ent) then
5166 Set_Alignment (Base_Type (U_Ent), Align);
5175 -- Bit_Order attribute definition clause
5177 when Attribute_Bit_Order =>
5178 if not Is_Record_Type (U_Ent) then
5180 ("Bit_Order can only be defined for record type", Nam);
5182 elsif Duplicate_Clause then
5186 Analyze_And_Resolve (Expr, RTE (RE_Bit_Order));
5188 if Etype (Expr) = Any_Type then
5191 elsif not Is_OK_Static_Expression (Expr) then
5192 Flag_Non_Static_Expr
5193 ("Bit_Order requires static expression!", Expr);
5196 if (Expr_Value (Expr) = 0) /= Bytes_Big_Endian then
5197 Set_Reverse_Bit_Order (Base_Type (U_Ent), True);
5202 --------------------
5203 -- Component_Size --
5204 --------------------
5206 -- Component_Size attribute definition clause
5208 when Attribute_Component_Size => Component_Size_Case : declare
5209 Csize : constant Uint := Static_Integer (Expr);
5213 New_Ctyp : Entity_Id;
5217 if not Is_Array_Type (U_Ent) then
5218 Error_Msg_N ("component size requires array type", Nam);
5222 Btype := Base_Type (U_Ent);
5223 Ctyp := Component_Type (Btype);
5225 if Duplicate_Clause then
5228 elsif Rep_Item_Too_Early (Btype, N) then
5231 elsif Csize /= No_Uint then
5232 Check_Size (Expr, Ctyp, Csize, Biased);
5234 -- For the biased case, build a declaration for a subtype that
5235 -- will be used to represent the biased subtype that reflects
5236 -- the biased representation of components. We need the subtype
5237 -- to get proper conversions on referencing elements of the
5242 Make_Defining_Identifier (Loc,
5244 New_External_Name (Chars (U_Ent), 'C', 0, 'T'));
5247 Make_Subtype_Declaration (Loc,
5248 Defining_Identifier => New_Ctyp,
5249 Subtype_Indication =>
5250 New_Occurrence_Of (Component_Type (Btype), Loc));
5252 Set_Parent (Decl, N);
5253 Analyze (Decl, Suppress => All_Checks);
5255 Set_Has_Delayed_Freeze (New_Ctyp, False);
5256 Set_Esize (New_Ctyp, Csize);
5257 Set_RM_Size (New_Ctyp, Csize);
5258 Init_Alignment (New_Ctyp);
5259 Set_Is_Itype (New_Ctyp, True);
5260 Set_Associated_Node_For_Itype (New_Ctyp, U_Ent);
5262 Set_Component_Type (Btype, New_Ctyp);
5263 Set_Biased (New_Ctyp, N, "component size clause");
5266 Set_Component_Size (Btype, Csize);
5268 -- Deal with warning on overridden size
5270 if Warn_On_Overridden_Size
5271 and then Has_Size_Clause (Ctyp)
5272 and then RM_Size (Ctyp) /= Csize
5275 ("component size overrides size clause for&?S?", N, Ctyp);
5278 Set_Has_Component_Size_Clause (Btype, True);
5279 Set_Has_Non_Standard_Rep (Btype, True);
5281 end Component_Size_Case;
5283 -----------------------
5284 -- Constant_Indexing --
5285 -----------------------
5287 when Attribute_Constant_Indexing =>
5288 Check_Indexing_Functions;
5294 when Attribute_CPU =>
5296 -- CPU attribute definition clause not allowed except from aspect
5299 if From_Aspect_Specification (N) then
5300 if not Is_Task_Type (U_Ent) then
5301 Error_Msg_N ("CPU can only be defined for task", Nam);
5303 elsif Duplicate_Clause then
5307 -- The expression must be analyzed in the special manner
5308 -- described in "Handling of Default and Per-Object
5309 -- Expressions" in sem.ads.
5311 -- The visibility to the discriminants must be restored
5313 Push_Scope_And_Install_Discriminants (U_Ent);
5314 Preanalyze_Spec_Expression (Expr, RTE (RE_CPU_Range));
5315 Uninstall_Discriminants_And_Pop_Scope (U_Ent);
5317 if not Is_OK_Static_Expression (Expr) then
5318 Check_Restriction (Static_Priorities, Expr);
5324 ("attribute& cannot be set with definition clause", N);
5327 ----------------------
5328 -- Default_Iterator --
5329 ----------------------
5331 when Attribute_Default_Iterator => Default_Iterator : declare
5336 -- If target type is untagged, further checks are irrelevant
5338 if not Is_Tagged_Type (U_Ent) then
5340 ("aspect Default_Iterator applies to tagged type", Nam);
5344 Check_Iterator_Functions;
5348 if not Is_Entity_Name (Expr)
5349 or else Ekind (Entity (Expr)) /= E_Function
5351 Error_Msg_N ("aspect Iterator must be a function", Expr);
5354 Func := Entity (Expr);
5357 -- The type of the first parameter must be T, T'class, or a
5358 -- corresponding access type (5.5.1 (8/3). If function is
5359 -- parameterless label type accordingly.
5361 if No (First_Formal (Func)) then
5364 Typ := Etype (First_Formal (Func));
5368 or else Typ = Class_Wide_Type (U_Ent)
5369 or else (Is_Access_Type (Typ)
5370 and then Designated_Type (Typ) = U_Ent)
5371 or else (Is_Access_Type (Typ)
5372 and then Designated_Type (Typ) =
5373 Class_Wide_Type (U_Ent))
5379 ("Default Iterator must be a primitive of&", Func, U_Ent);
5381 end Default_Iterator;
5383 ------------------------
5384 -- Dispatching_Domain --
5385 ------------------------
5387 when Attribute_Dispatching_Domain =>
5389 -- Dispatching_Domain attribute definition clause not allowed
5390 -- except from aspect specification.
5392 if From_Aspect_Specification (N) then
5393 if not Is_Task_Type (U_Ent) then
5395 ("Dispatching_Domain can only be defined for task", Nam);
5397 elsif Duplicate_Clause then
5401 -- The expression must be analyzed in the special manner
5402 -- described in "Handling of Default and Per-Object
5403 -- Expressions" in sem.ads.
5405 -- The visibility to the discriminants must be restored
5407 Push_Scope_And_Install_Discriminants (U_Ent);
5409 Preanalyze_Spec_Expression
5410 (Expr, RTE (RE_Dispatching_Domain));
5412 Uninstall_Discriminants_And_Pop_Scope (U_Ent);
5417 ("attribute& cannot be set with definition clause", N);
5424 when Attribute_External_Tag =>
5425 if not Is_Tagged_Type (U_Ent) then
5426 Error_Msg_N ("should be a tagged type", Nam);
5429 if Duplicate_Clause then
5433 Analyze_And_Resolve (Expr, Standard_String);
5435 if not Is_OK_Static_Expression (Expr) then
5436 Flag_Non_Static_Expr
5437 ("static string required for tag name!", Nam);
5440 if not Is_Library_Level_Entity (U_Ent) then
5442 ("??non-unique external tag supplied for &", N, U_Ent);
5444 ("\??same external tag applies to all subprogram calls",
5447 ("\??corresponding internal tag cannot be obtained", N);
5451 --------------------------
5452 -- Implicit_Dereference --
5453 --------------------------
5455 when Attribute_Implicit_Dereference =>
5457 -- Legality checks already performed at the point of the type
5458 -- declaration, aspect is not delayed.
5466 when Attribute_Input =>
5467 Analyze_Stream_TSS_Definition (TSS_Stream_Input);
5468 Set_Has_Specified_Stream_Input (Ent);
5470 ------------------------
5471 -- Interrupt_Priority --
5472 ------------------------
5474 when Attribute_Interrupt_Priority =>
5476 -- Interrupt_Priority attribute definition clause not allowed
5477 -- except from aspect specification.
5479 if From_Aspect_Specification (N) then
5480 if not Is_Concurrent_Type (U_Ent) then
5482 ("Interrupt_Priority can only be defined for task and "
5483 & "protected object", Nam);
5485 elsif Duplicate_Clause then
5489 -- The expression must be analyzed in the special manner
5490 -- described in "Handling of Default and Per-Object
5491 -- Expressions" in sem.ads.
5493 -- The visibility to the discriminants must be restored
5495 Push_Scope_And_Install_Discriminants (U_Ent);
5497 Preanalyze_Spec_Expression
5498 (Expr, RTE (RE_Interrupt_Priority));
5500 Uninstall_Discriminants_And_Pop_Scope (U_Ent);
5502 -- Check the No_Task_At_Interrupt_Priority restriction
5504 if Is_Task_Type (U_Ent) then
5505 Check_Restriction (No_Task_At_Interrupt_Priority, N);
5511 ("attribute& cannot be set with definition clause", N);
5518 when Attribute_Iterable =>
5521 if Nkind (Expr) /= N_Aggregate then
5522 Error_Msg_N ("aspect Iterable must be an aggregate", Expr);
5529 Assoc := First (Component_Associations (Expr));
5530 while Present (Assoc) loop
5531 if not Is_Entity_Name (Expression (Assoc)) then
5532 Error_Msg_N ("value must be a function", Assoc);
5539 ----------------------
5540 -- Iterator_Element --
5541 ----------------------
5543 when Attribute_Iterator_Element =>
5546 if not Is_Entity_Name (Expr)
5547 or else not Is_Type (Entity (Expr))
5549 Error_Msg_N ("aspect Iterator_Element must be a type", Expr);
5556 -- Machine radix attribute definition clause
5558 when Attribute_Machine_Radix => Machine_Radix : declare
5559 Radix : constant Uint := Static_Integer (Expr);
5562 if not Is_Decimal_Fixed_Point_Type (U_Ent) then
5563 Error_Msg_N ("decimal fixed-point type expected for &", Nam);
5565 elsif Duplicate_Clause then
5568 elsif Radix /= No_Uint then
5569 Set_Has_Machine_Radix_Clause (U_Ent);
5570 Set_Has_Non_Standard_Rep (Base_Type (U_Ent));
5575 elsif Radix = 10 then
5576 Set_Machine_Radix_10 (U_Ent);
5578 -- The following error is suppressed in ASIS mode to allow for
5579 -- different ASIS back ends or ASIS-based tools to query the
5582 elsif not ASIS_Mode then
5583 Error_Msg_N ("machine radix value must be 2 or 10", Expr);
5592 -- Object_Size attribute definition clause
5594 when Attribute_Object_Size => Object_Size : declare
5595 Size : constant Uint := Static_Integer (Expr);
5598 pragma Warnings (Off, Biased);
5601 if not Is_Type (U_Ent) then
5602 Error_Msg_N ("Object_Size cannot be given for &", Nam);
5604 elsif Duplicate_Clause then
5608 Check_Size (Expr, U_Ent, Size, Biased);
5610 -- The following errors are suppressed in ASIS mode to allow
5611 -- for different ASIS back ends or ASIS-based tools to query
5612 -- the illegal clause.
5617 elsif Is_Scalar_Type (U_Ent) then
5618 if Size /= 8 and then Size /= 16 and then Size /= 32
5619 and then UI_Mod (Size, 64) /= 0
5622 ("Object_Size must be 8, 16, 32, or multiple of 64",
5626 elsif Size mod 8 /= 0 then
5627 Error_Msg_N ("Object_Size must be a multiple of 8", Expr);
5630 Set_Esize (U_Ent, Size);
5631 Set_Has_Object_Size_Clause (U_Ent);
5632 Alignment_Check_For_Size_Change (U_Ent, Size);
5640 when Attribute_Output =>
5641 Analyze_Stream_TSS_Definition (TSS_Stream_Output);
5642 Set_Has_Specified_Stream_Output (Ent);
5648 when Attribute_Priority =>
5650 -- Priority attribute definition clause not allowed except from
5651 -- aspect specification.
5653 if From_Aspect_Specification (N) then
5654 if not (Is_Concurrent_Type (U_Ent)
5655 or else Ekind (U_Ent) = E_Procedure)
5658 ("Priority can only be defined for task and protected "
5661 elsif Duplicate_Clause then
5665 -- The expression must be analyzed in the special manner
5666 -- described in "Handling of Default and Per-Object
5667 -- Expressions" in sem.ads.
5669 -- The visibility to the discriminants must be restored
5671 Push_Scope_And_Install_Discriminants (U_Ent);
5672 Preanalyze_Spec_Expression (Expr, Standard_Integer);
5673 Uninstall_Discriminants_And_Pop_Scope (U_Ent);
5675 if not Is_OK_Static_Expression (Expr) then
5676 Check_Restriction (Static_Priorities, Expr);
5682 ("attribute& cannot be set with definition clause", N);
5689 when Attribute_Read =>
5690 Analyze_Stream_TSS_Definition (TSS_Stream_Read);
5691 Set_Has_Specified_Stream_Read (Ent);
5693 --------------------------
5694 -- Scalar_Storage_Order --
5695 --------------------------
5697 -- Scalar_Storage_Order attribute definition clause
5699 when Attribute_Scalar_Storage_Order =>
5700 if not (Is_Record_Type (U_Ent) or else Is_Array_Type (U_Ent)) then
5702 ("Scalar_Storage_Order can only be defined for record or "
5703 & "array type", Nam);
5705 elsif Duplicate_Clause then
5709 Analyze_And_Resolve (Expr, RTE (RE_Bit_Order));
5711 if Etype (Expr) = Any_Type then
5714 elsif not Is_OK_Static_Expression (Expr) then
5715 Flag_Non_Static_Expr
5716 ("Scalar_Storage_Order requires static expression!", Expr);
5718 elsif (Expr_Value (Expr) = 0) /= Bytes_Big_Endian then
5720 -- Here for the case of a non-default (i.e. non-confirming)
5721 -- Scalar_Storage_Order attribute definition.
5723 if Support_Nondefault_SSO_On_Target then
5724 Set_Reverse_Storage_Order (Base_Type (U_Ent), True);
5727 ("non-default Scalar_Storage_Order not supported on "
5732 -- Clear SSO default indications since explicit setting of the
5733 -- order overrides the defaults.
5735 Set_SSO_Set_Low_By_Default (Base_Type (U_Ent), False);
5736 Set_SSO_Set_High_By_Default (Base_Type (U_Ent), False);
5739 --------------------------
5740 -- Secondary_Stack_Size --
5741 --------------------------
5743 when Attribute_Secondary_Stack_Size =>
5745 -- Secondary_Stack_Size attribute definition clause not allowed
5746 -- except from aspect specification.
5748 if From_Aspect_Specification (N) then
5749 if not Is_Task_Type (U_Ent) then
5751 ("Secondary Stack Size can only be defined for task", Nam);
5753 elsif Duplicate_Clause then
5757 Check_Restriction (No_Secondary_Stack, Expr);
5759 -- The expression must be analyzed in the special manner
5760 -- described in "Handling of Default and Per-Object
5761 -- Expressions" in sem.ads.
5763 -- The visibility to the discriminants must be restored
5765 Push_Scope_And_Install_Discriminants (U_Ent);
5766 Preanalyze_Spec_Expression (Expr, Any_Integer);
5767 Uninstall_Discriminants_And_Pop_Scope (U_Ent);
5769 if not Is_OK_Static_Expression (Expr) then
5770 Check_Restriction (Static_Storage_Size, Expr);
5776 ("attribute& cannot be set with definition clause", N);
5783 -- Size attribute definition clause
5785 when Attribute_Size => Size : declare
5786 Size : constant Uint := Static_Integer (Expr);
5793 if Duplicate_Clause then
5796 elsif not Is_Type (U_Ent)
5797 and then Ekind (U_Ent) /= E_Variable
5798 and then Ekind (U_Ent) /= E_Constant
5800 Error_Msg_N ("size cannot be given for &", Nam);
5802 elsif Is_Array_Type (U_Ent)
5803 and then not Is_Constrained (U_Ent)
5806 ("size cannot be given for unconstrained array", Nam);
5808 elsif Size /= No_Uint then
5809 if Is_Type (U_Ent) then
5812 Etyp := Etype (U_Ent);
5815 -- Check size, note that Gigi is in charge of checking that the
5816 -- size of an array or record type is OK. Also we do not check
5817 -- the size in the ordinary fixed-point case, since it is too
5818 -- early to do so (there may be subsequent small clause that
5819 -- affects the size). We can check the size if a small clause
5820 -- has already been given.
5822 if not Is_Ordinary_Fixed_Point_Type (U_Ent)
5823 or else Has_Small_Clause (U_Ent)
5825 Check_Size (Expr, Etyp, Size, Biased);
5826 Set_Biased (U_Ent, N, "size clause", Biased);
5829 -- For types set RM_Size and Esize if possible
5831 if Is_Type (U_Ent) then
5832 Set_RM_Size (U_Ent, Size);
5834 -- For elementary types, increase Object_Size to power of 2,
5835 -- but not less than a storage unit in any case (normally
5836 -- this means it will be byte addressable).
5838 -- For all other types, nothing else to do, we leave Esize
5839 -- (object size) unset, the back end will set it from the
5840 -- size and alignment in an appropriate manner.
5842 -- In both cases, we check whether the alignment must be
5843 -- reset in the wake of the size change.
5845 if Is_Elementary_Type (U_Ent) then
5846 if Size <= System_Storage_Unit then
5847 Init_Esize (U_Ent, System_Storage_Unit);
5848 elsif Size <= 16 then
5849 Init_Esize (U_Ent, 16);
5850 elsif Size <= 32 then
5851 Init_Esize (U_Ent, 32);
5853 Set_Esize (U_Ent, (Size + 63) / 64 * 64);
5856 Alignment_Check_For_Size_Change (U_Ent, Esize (U_Ent));
5858 Alignment_Check_For_Size_Change (U_Ent, Size);
5861 -- For objects, set Esize only
5864 -- The following error is suppressed in ASIS mode to allow
5865 -- for different ASIS back ends or ASIS-based tools to query
5866 -- the illegal clause.
5868 if Is_Elementary_Type (Etyp)
5869 and then Size /= System_Storage_Unit
5870 and then Size /= System_Storage_Unit * 2
5871 and then Size /= System_Storage_Unit * 4
5872 and then Size /= System_Storage_Unit * 8
5873 and then not ASIS_Mode
5875 Error_Msg_Uint_1 := UI_From_Int (System_Storage_Unit);
5876 Error_Msg_Uint_2 := Error_Msg_Uint_1 * 8;
5878 ("size for primitive object must be a power of 2 in "
5879 & "the range ^-^", N);
5882 Set_Esize (U_Ent, Size);
5885 Set_Has_Size_Clause (U_Ent);
5893 -- Small attribute definition clause
5895 when Attribute_Small => Small : declare
5896 Implicit_Base : constant Entity_Id := Base_Type (U_Ent);
5900 Analyze_And_Resolve (Expr, Any_Real);
5902 if Etype (Expr) = Any_Type then
5905 elsif not Is_OK_Static_Expression (Expr) then
5906 Flag_Non_Static_Expr
5907 ("small requires static expression!", Expr);
5911 Small := Expr_Value_R (Expr);
5913 if Small <= Ureal_0 then
5914 Error_Msg_N ("small value must be greater than zero", Expr);
5920 if not Is_Ordinary_Fixed_Point_Type (U_Ent) then
5922 ("small requires an ordinary fixed point type", Nam);
5924 elsif Has_Small_Clause (U_Ent) then
5925 Error_Msg_N ("small already given for &", Nam);
5927 elsif Small > Delta_Value (U_Ent) then
5929 ("small value must not be greater than delta value", Nam);
5932 Set_Small_Value (U_Ent, Small);
5933 Set_Small_Value (Implicit_Base, Small);
5934 Set_Has_Small_Clause (U_Ent);
5935 Set_Has_Small_Clause (Implicit_Base);
5936 Set_Has_Non_Standard_Rep (Implicit_Base);
5944 -- Storage_Pool attribute definition clause
5946 when Attribute_Simple_Storage_Pool
5947 | Attribute_Storage_Pool
5949 Storage_Pool : declare
5954 if Ekind (U_Ent) = E_Access_Subprogram_Type then
5956 ("storage pool cannot be given for access-to-subprogram type",
5960 elsif not Ekind_In (U_Ent, E_Access_Type, E_General_Access_Type)
5963 ("storage pool can only be given for access types", Nam);
5966 elsif Is_Derived_Type (U_Ent) then
5968 ("storage pool cannot be given for a derived access type",
5971 elsif Duplicate_Clause then
5974 elsif Present (Associated_Storage_Pool (U_Ent)) then
5975 Error_Msg_N ("storage pool already given for &", Nam);
5979 -- Check for Storage_Size previously given
5982 SS : constant Node_Id :=
5983 Get_Attribute_Definition_Clause
5984 (U_Ent, Attribute_Storage_Size);
5986 if Present (SS) then
5987 Check_Pool_Size_Clash (U_Ent, N, SS);
5991 -- Storage_Pool case
5993 if Id = Attribute_Storage_Pool then
5995 (Expr, Class_Wide_Type (RTE (RE_Root_Storage_Pool)));
5997 -- In the Simple_Storage_Pool case, we allow a variable of any
5998 -- simple storage pool type, so we Resolve without imposing an
6002 Analyze_And_Resolve (Expr);
6004 if not Present (Get_Rep_Pragma
6005 (Etype (Expr), Name_Simple_Storage_Pool_Type))
6008 ("expression must be of a simple storage pool type", Expr);
6012 if not Denotes_Variable (Expr) then
6013 Error_Msg_N ("storage pool must be a variable", Expr);
6017 if Nkind (Expr) = N_Type_Conversion then
6018 T := Etype (Expression (Expr));
6023 -- The Stack_Bounded_Pool is used internally for implementing
6024 -- access types with a Storage_Size. Since it only work properly
6025 -- when used on one specific type, we need to check that it is not
6026 -- hijacked improperly:
6028 -- type T is access Integer;
6029 -- for T'Storage_Size use n;
6030 -- type Q is access Float;
6031 -- for Q'Storage_Size use T'Storage_Size; -- incorrect
6033 if RTE_Available (RE_Stack_Bounded_Pool)
6034 and then Base_Type (T) = RTE (RE_Stack_Bounded_Pool)
6036 Error_Msg_N ("non-shareable internal Pool", Expr);
6040 -- If the argument is a name that is not an entity name, then
6041 -- we construct a renaming operation to define an entity of
6042 -- type storage pool.
6044 if not Is_Entity_Name (Expr)
6045 and then Is_Object_Reference (Expr)
6047 Pool := Make_Temporary (Loc, 'P', Expr);
6050 Rnode : constant Node_Id :=
6051 Make_Object_Renaming_Declaration (Loc,
6052 Defining_Identifier => Pool,
6054 New_Occurrence_Of (Etype (Expr), Loc),
6058 -- If the attribute definition clause comes from an aspect
6059 -- clause, then insert the renaming before the associated
6060 -- entity's declaration, since the attribute clause has
6061 -- not yet been appended to the declaration list.
6063 if From_Aspect_Specification (N) then
6064 Insert_Before (Parent (Entity (N)), Rnode);
6066 Insert_Before (N, Rnode);
6070 Set_Associated_Storage_Pool (U_Ent, Pool);
6073 elsif Is_Entity_Name (Expr) then
6074 Pool := Entity (Expr);
6076 -- If pool is a renamed object, get original one. This can
6077 -- happen with an explicit renaming, and within instances.
6079 while Present (Renamed_Object (Pool))
6080 and then Is_Entity_Name (Renamed_Object (Pool))
6082 Pool := Entity (Renamed_Object (Pool));
6085 if Present (Renamed_Object (Pool))
6086 and then Nkind (Renamed_Object (Pool)) = N_Type_Conversion
6087 and then Is_Entity_Name (Expression (Renamed_Object (Pool)))
6089 Pool := Entity (Expression (Renamed_Object (Pool)));
6092 Set_Associated_Storage_Pool (U_Ent, Pool);
6094 elsif Nkind (Expr) = N_Type_Conversion
6095 and then Is_Entity_Name (Expression (Expr))
6096 and then Nkind (Original_Node (Expr)) = N_Attribute_Reference
6098 Pool := Entity (Expression (Expr));
6099 Set_Associated_Storage_Pool (U_Ent, Pool);
6102 Error_Msg_N ("incorrect reference to a Storage Pool", Expr);
6111 -- Storage_Size attribute definition clause
6113 when Attribute_Storage_Size => Storage_Size : declare
6114 Btype : constant Entity_Id := Base_Type (U_Ent);
6117 if Is_Task_Type (U_Ent) then
6119 -- Check obsolescent (but never obsolescent if from aspect)
6121 if not From_Aspect_Specification (N) then
6122 Check_Restriction (No_Obsolescent_Features, N);
6124 if Warn_On_Obsolescent_Feature then
6126 ("?j?storage size clause for task is an obsolescent "
6127 & "feature (RM J.9)", N);
6128 Error_Msg_N ("\?j?use Storage_Size pragma instead", N);
6135 if not Is_Access_Type (U_Ent)
6136 and then Ekind (U_Ent) /= E_Task_Type
6138 Error_Msg_N ("storage size cannot be given for &", Nam);
6140 elsif Is_Access_Type (U_Ent) and Is_Derived_Type (U_Ent) then
6142 ("storage size cannot be given for a derived access type",
6145 elsif Duplicate_Clause then
6149 Analyze_And_Resolve (Expr, Any_Integer);
6151 if Is_Access_Type (U_Ent) then
6153 -- Check for Storage_Pool previously given
6156 SP : constant Node_Id :=
6157 Get_Attribute_Definition_Clause
6158 (U_Ent, Attribute_Storage_Pool);
6161 if Present (SP) then
6162 Check_Pool_Size_Clash (U_Ent, SP, N);
6166 -- Special case of for x'Storage_Size use 0
6168 if Is_OK_Static_Expression (Expr)
6169 and then Expr_Value (Expr) = 0
6171 Set_No_Pool_Assigned (Btype);
6175 Set_Has_Storage_Size_Clause (Btype);
6183 when Attribute_Stream_Size => Stream_Size : declare
6184 Size : constant Uint := Static_Integer (Expr);
6187 if Ada_Version <= Ada_95 then
6188 Check_Restriction (No_Implementation_Attributes, N);
6191 if Duplicate_Clause then
6194 elsif Is_Elementary_Type (U_Ent) then
6196 -- The following errors are suppressed in ASIS mode to allow
6197 -- for different ASIS back ends or ASIS-based tools to query
6198 -- the illegal clause.
6203 elsif Size /= System_Storage_Unit
6204 and then Size /= System_Storage_Unit * 2
6205 and then Size /= System_Storage_Unit * 4
6206 and then Size /= System_Storage_Unit * 8
6208 Error_Msg_Uint_1 := UI_From_Int (System_Storage_Unit);
6210 ("stream size for elementary type must be a power of 2 "
6211 & "and at least ^", N);
6213 elsif RM_Size (U_Ent) > Size then
6214 Error_Msg_Uint_1 := RM_Size (U_Ent);
6216 ("stream size for elementary type must be a power of 2 "
6217 & "and at least ^", N);
6220 Set_Has_Stream_Size_Clause (U_Ent);
6223 Error_Msg_N ("Stream_Size cannot be given for &", Nam);
6231 -- Value_Size attribute definition clause
6233 when Attribute_Value_Size => Value_Size : declare
6234 Size : constant Uint := Static_Integer (Expr);
6238 if not Is_Type (U_Ent) then
6239 Error_Msg_N ("Value_Size cannot be given for &", Nam);
6241 elsif Duplicate_Clause then
6244 elsif Is_Array_Type (U_Ent)
6245 and then not Is_Constrained (U_Ent)
6248 ("Value_Size cannot be given for unconstrained array", Nam);
6251 if Is_Elementary_Type (U_Ent) then
6252 Check_Size (Expr, U_Ent, Size, Biased);
6253 Set_Biased (U_Ent, N, "value size clause", Biased);
6256 Set_RM_Size (U_Ent, Size);
6260 -----------------------
6261 -- Variable_Indexing --
6262 -----------------------
6264 when Attribute_Variable_Indexing =>
6265 Check_Indexing_Functions;
6271 when Attribute_Write =>
6272 Analyze_Stream_TSS_Definition (TSS_Stream_Write);
6273 Set_Has_Specified_Stream_Write (Ent);
6275 -- All other attributes cannot be set
6279 ("attribute& cannot be set with definition clause", N);
6282 -- The test for the type being frozen must be performed after any
6283 -- expression the clause has been analyzed since the expression itself
6284 -- might cause freezing that makes the clause illegal.
6286 if Rep_Item_Too_Late (U_Ent, N, FOnly) then
6289 end Analyze_Attribute_Definition_Clause;
6291 ----------------------------
6292 -- Analyze_Code_Statement --
6293 ----------------------------
6295 procedure Analyze_Code_Statement (N : Node_Id) is
6296 HSS : constant Node_Id := Parent (N);
6297 SBody : constant Node_Id := Parent (HSS);
6298 Subp : constant Entity_Id := Current_Scope;
6305 -- Accept foreign code statements for CodePeer. The analysis is skipped
6306 -- to avoid rejecting unrecognized constructs.
6308 if CodePeer_Mode then
6313 -- Analyze and check we get right type, note that this implements the
6314 -- requirement (RM 13.8(1)) that Machine_Code be with'ed, since that is
6315 -- the only way that Asm_Insn could possibly be visible.
6317 Analyze_And_Resolve (Expression (N));
6319 if Etype (Expression (N)) = Any_Type then
6321 elsif Etype (Expression (N)) /= RTE (RE_Asm_Insn) then
6322 Error_Msg_N ("incorrect type for code statement", N);
6326 Check_Code_Statement (N);
6328 -- Make sure we appear in the handled statement sequence of a subprogram
6331 if Nkind (HSS) /= N_Handled_Sequence_Of_Statements
6332 or else Nkind (SBody) /= N_Subprogram_Body
6335 ("code statement can only appear in body of subprogram", N);
6339 -- Do remaining checks (RM 13.8(3)) if not already done
6341 if not Is_Machine_Code_Subprogram (Subp) then
6342 Set_Is_Machine_Code_Subprogram (Subp);
6344 -- No exception handlers allowed
6346 if Present (Exception_Handlers (HSS)) then
6348 ("exception handlers not permitted in machine code subprogram",
6349 First (Exception_Handlers (HSS)));
6352 -- No declarations other than use clauses and pragmas (we allow
6353 -- certain internally generated declarations as well).
6355 Decl := First (Declarations (SBody));
6356 while Present (Decl) loop
6357 DeclO := Original_Node (Decl);
6358 if Comes_From_Source (DeclO)
6359 and not Nkind_In (DeclO, N_Pragma,
6360 N_Use_Package_Clause,
6362 N_Implicit_Label_Declaration)
6365 ("this declaration not allowed in machine code subprogram",
6372 -- No statements other than code statements, pragmas, and labels.
6373 -- Again we allow certain internally generated statements.
6375 -- In Ada 2012, qualified expressions are names, and the code
6376 -- statement is initially parsed as a procedure call.
6378 Stmt := First (Statements (HSS));
6379 while Present (Stmt) loop
6380 StmtO := Original_Node (Stmt);
6382 -- A procedure call transformed into a code statement is OK
6384 if Ada_Version >= Ada_2012
6385 and then Nkind (StmtO) = N_Procedure_Call_Statement
6386 and then Nkind (Name (StmtO)) = N_Qualified_Expression
6390 elsif Comes_From_Source (StmtO)
6391 and then not Nkind_In (StmtO, N_Pragma,
6396 ("this statement is not allowed in machine code subprogram",
6403 end Analyze_Code_Statement;
6405 -----------------------------------------------
6406 -- Analyze_Enumeration_Representation_Clause --
6407 -----------------------------------------------
6409 procedure Analyze_Enumeration_Representation_Clause (N : Node_Id) is
6410 Ident : constant Node_Id := Identifier (N);
6411 Aggr : constant Node_Id := Array_Aggregate (N);
6412 Enumtype : Entity_Id;
6419 Err : Boolean := False;
6420 -- Set True to avoid cascade errors and crashes on incorrect source code
6422 Lo : constant Uint := Expr_Value (Type_Low_Bound (Universal_Integer));
6423 Hi : constant Uint := Expr_Value (Type_High_Bound (Universal_Integer));
6424 -- Allowed range of universal integer (= allowed range of enum lit vals)
6428 -- Minimum and maximum values of entries
6431 -- Pointer to node for literal providing max value
6434 if Ignore_Rep_Clauses then
6435 Kill_Rep_Clause (N);
6439 -- Ignore enumeration rep clauses by default in CodePeer mode,
6440 -- unless -gnatd.I is specified, as a work around for potential false
6441 -- positive messages.
6443 if CodePeer_Mode and not Debug_Flag_Dot_II then
6447 -- First some basic error checks
6450 Enumtype := Entity (Ident);
6452 if Enumtype = Any_Type
6453 or else Rep_Item_Too_Early (Enumtype, N)
6457 Enumtype := Underlying_Type (Enumtype);
6460 if not Is_Enumeration_Type (Enumtype) then
6462 ("enumeration type required, found}",
6463 Ident, First_Subtype (Enumtype));
6467 -- Ignore rep clause on generic actual type. This will already have
6468 -- been flagged on the template as an error, and this is the safest
6469 -- way to ensure we don't get a junk cascaded message in the instance.
6471 if Is_Generic_Actual_Type (Enumtype) then
6474 -- Type must be in current scope
6476 elsif Scope (Enumtype) /= Current_Scope then
6477 Error_Msg_N ("type must be declared in this scope", Ident);
6480 -- Type must be a first subtype
6482 elsif not Is_First_Subtype (Enumtype) then
6483 Error_Msg_N ("cannot give enumeration rep clause for subtype", N);
6486 -- Ignore duplicate rep clause
6488 elsif Has_Enumeration_Rep_Clause (Enumtype) then
6489 Error_Msg_N ("duplicate enumeration rep clause ignored", N);
6492 -- Don't allow rep clause for standard [wide_[wide_]]character
6494 elsif Is_Standard_Character_Type (Enumtype) then
6495 Error_Msg_N ("enumeration rep clause not allowed for this type", N);
6498 -- Check that the expression is a proper aggregate (no parentheses)
6500 elsif Paren_Count (Aggr) /= 0 then
6502 ("extra parentheses surrounding aggregate not allowed",
6506 -- All tests passed, so set rep clause in place
6509 Set_Has_Enumeration_Rep_Clause (Enumtype);
6510 Set_Has_Enumeration_Rep_Clause (Base_Type (Enumtype));
6513 -- Now we process the aggregate. Note that we don't use the normal
6514 -- aggregate code for this purpose, because we don't want any of the
6515 -- normal expansion activities, and a number of special semantic
6516 -- rules apply (including the component type being any integer type)
6518 Elit := First_Literal (Enumtype);
6520 -- First the positional entries if any
6522 if Present (Expressions (Aggr)) then
6523 Expr := First (Expressions (Aggr));
6524 while Present (Expr) loop
6526 Error_Msg_N ("too many entries in aggregate", Expr);
6530 Val := Static_Integer (Expr);
6532 -- Err signals that we found some incorrect entries processing
6533 -- the list. The final checks for completeness and ordering are
6534 -- skipped in this case.
6536 if Val = No_Uint then
6539 elsif Val < Lo or else Hi < Val then
6540 Error_Msg_N ("value outside permitted range", Expr);
6544 Set_Enumeration_Rep (Elit, Val);
6545 Set_Enumeration_Rep_Expr (Elit, Expr);
6551 -- Now process the named entries if present
6553 if Present (Component_Associations (Aggr)) then
6554 Assoc := First (Component_Associations (Aggr));
6555 while Present (Assoc) loop
6556 Choice := First (Choices (Assoc));
6558 if Present (Next (Choice)) then
6560 ("multiple choice not allowed here", Next (Choice));
6564 if Nkind (Choice) = N_Others_Choice then
6565 Error_Msg_N ("others choice not allowed here", Choice);
6568 elsif Nkind (Choice) = N_Range then
6570 -- ??? should allow zero/one element range here
6572 Error_Msg_N ("range not allowed here", Choice);
6576 Analyze_And_Resolve (Choice, Enumtype);
6578 if Error_Posted (Choice) then
6583 if Is_Entity_Name (Choice)
6584 and then Is_Type (Entity (Choice))
6586 Error_Msg_N ("subtype name not allowed here", Choice);
6589 -- ??? should allow static subtype with zero/one entry
6591 elsif Etype (Choice) = Base_Type (Enumtype) then
6592 if not Is_OK_Static_Expression (Choice) then
6593 Flag_Non_Static_Expr
6594 ("non-static expression used for choice!", Choice);
6598 Elit := Expr_Value_E (Choice);
6600 if Present (Enumeration_Rep_Expr (Elit)) then
6602 Sloc (Enumeration_Rep_Expr (Elit));
6604 ("representation for& previously given#",
6609 Set_Enumeration_Rep_Expr (Elit, Expression (Assoc));
6611 Expr := Expression (Assoc);
6612 Val := Static_Integer (Expr);
6614 if Val = No_Uint then
6617 elsif Val < Lo or else Hi < Val then
6618 Error_Msg_N ("value outside permitted range", Expr);
6622 Set_Enumeration_Rep (Elit, Val);
6632 -- Aggregate is fully processed. Now we check that a full set of
6633 -- representations was given, and that they are in range and in order.
6634 -- These checks are only done if no other errors occurred.
6640 Elit := First_Literal (Enumtype);
6641 while Present (Elit) loop
6642 if No (Enumeration_Rep_Expr (Elit)) then
6643 Error_Msg_NE ("missing representation for&!", N, Elit);
6646 Val := Enumeration_Rep (Elit);
6648 if Min = No_Uint then
6652 if Val /= No_Uint then
6653 if Max /= No_Uint and then Val <= Max then
6655 ("enumeration value for& not ordered!",
6656 Enumeration_Rep_Expr (Elit), Elit);
6659 Max_Node := Enumeration_Rep_Expr (Elit);
6663 -- If there is at least one literal whose representation is not
6664 -- equal to the Pos value, then note that this enumeration type
6665 -- has a non-standard representation.
6667 if Val /= Enumeration_Pos (Elit) then
6668 Set_Has_Non_Standard_Rep (Base_Type (Enumtype));
6675 -- Now set proper size information
6678 Minsize : Uint := UI_From_Int (Minimum_Size (Enumtype));
6681 if Has_Size_Clause (Enumtype) then
6683 -- All OK, if size is OK now
6685 if RM_Size (Enumtype) >= Minsize then
6689 -- Try if we can get by with biasing
6692 UI_From_Int (Minimum_Size (Enumtype, Biased => True));
6694 -- Error message if even biasing does not work
6696 if RM_Size (Enumtype) < Minsize then
6697 Error_Msg_Uint_1 := RM_Size (Enumtype);
6698 Error_Msg_Uint_2 := Max;
6700 ("previously given size (^) is too small "
6701 & "for this value (^)", Max_Node);
6703 -- If biasing worked, indicate that we now have biased rep
6707 (Enumtype, Size_Clause (Enumtype), "size clause");
6712 Set_RM_Size (Enumtype, Minsize);
6713 Set_Enum_Esize (Enumtype);
6716 Set_RM_Size (Base_Type (Enumtype), RM_Size (Enumtype));
6717 Set_Esize (Base_Type (Enumtype), Esize (Enumtype));
6718 Set_Alignment (Base_Type (Enumtype), Alignment (Enumtype));
6722 -- We repeat the too late test in case it froze itself
6724 if Rep_Item_Too_Late (Enumtype, N) then
6727 end Analyze_Enumeration_Representation_Clause;
6729 ----------------------------
6730 -- Analyze_Free_Statement --
6731 ----------------------------
6733 procedure Analyze_Free_Statement (N : Node_Id) is
6735 Analyze (Expression (N));
6736 end Analyze_Free_Statement;
6738 ---------------------------
6739 -- Analyze_Freeze_Entity --
6740 ---------------------------
6742 procedure Analyze_Freeze_Entity (N : Node_Id) is
6744 Freeze_Entity_Checks (N);
6745 end Analyze_Freeze_Entity;
6747 -----------------------------------
6748 -- Analyze_Freeze_Generic_Entity --
6749 -----------------------------------
6751 procedure Analyze_Freeze_Generic_Entity (N : Node_Id) is
6752 E : constant Entity_Id := Entity (N);
6755 if not Is_Frozen (E) and then Has_Delayed_Aspects (E) then
6756 Analyze_Aspects_At_Freeze_Point (E);
6759 Freeze_Entity_Checks (N);
6760 end Analyze_Freeze_Generic_Entity;
6762 ------------------------------------------
6763 -- Analyze_Record_Representation_Clause --
6764 ------------------------------------------
6766 -- Note: we check as much as we can here, but we can't do any checks
6767 -- based on the position values (e.g. overlap checks) until freeze time
6768 -- because especially in Ada 2005 (machine scalar mode), the processing
6769 -- for non-standard bit order can substantially change the positions.
6770 -- See procedure Check_Record_Representation_Clause (called from Freeze)
6771 -- for the remainder of this processing.
6773 procedure Analyze_Record_Representation_Clause (N : Node_Id) is
6774 Ident : constant Node_Id := Identifier (N);
6779 Hbit : Uint := Uint_0;
6783 Rectype : Entity_Id;
6786 function Is_Inherited (Comp : Entity_Id) return Boolean;
6787 -- True if Comp is an inherited component in a record extension
6793 function Is_Inherited (Comp : Entity_Id) return Boolean is
6794 Comp_Base : Entity_Id;
6797 if Ekind (Rectype) = E_Record_Subtype then
6798 Comp_Base := Original_Record_Component (Comp);
6803 return Comp_Base /= Original_Record_Component (Comp_Base);
6808 Is_Record_Extension : Boolean;
6809 -- True if Rectype is a record extension
6811 CR_Pragma : Node_Id := Empty;
6812 -- Points to N_Pragma node if Complete_Representation pragma present
6814 -- Start of processing for Analyze_Record_Representation_Clause
6817 if Ignore_Rep_Clauses then
6818 Kill_Rep_Clause (N);
6823 Rectype := Entity (Ident);
6825 if Rectype = Any_Type or else Rep_Item_Too_Early (Rectype, N) then
6828 Rectype := Underlying_Type (Rectype);
6831 -- First some basic error checks
6833 if not Is_Record_Type (Rectype) then
6835 ("record type required, found}", Ident, First_Subtype (Rectype));
6838 elsif Scope (Rectype) /= Current_Scope then
6839 Error_Msg_N ("type must be declared in this scope", N);
6842 elsif not Is_First_Subtype (Rectype) then
6843 Error_Msg_N ("cannot give record rep clause for subtype", N);
6846 elsif Has_Record_Rep_Clause (Rectype) then
6847 Error_Msg_N ("duplicate record rep clause ignored", N);
6850 elsif Rep_Item_Too_Late (Rectype, N) then
6854 -- We know we have a first subtype, now possibly go to the anonymous
6855 -- base type to determine whether Rectype is a record extension.
6857 Recdef := Type_Definition (Declaration_Node (Base_Type (Rectype)));
6858 Is_Record_Extension :=
6859 Nkind (Recdef) = N_Derived_Type_Definition
6860 and then Present (Record_Extension_Part (Recdef));
6862 if Present (Mod_Clause (N)) then
6864 Loc : constant Source_Ptr := Sloc (N);
6865 M : constant Node_Id := Mod_Clause (N);
6866 P : constant List_Id := Pragmas_Before (M);
6870 pragma Warnings (Off, Mod_Val);
6873 Check_Restriction (No_Obsolescent_Features, Mod_Clause (N));
6875 if Warn_On_Obsolescent_Feature then
6877 ("?j?mod clause is an obsolescent feature (RM J.8)", N);
6879 ("\?j?use alignment attribute definition clause instead", N);
6886 -- In ASIS_Mode mode, expansion is disabled, but we must convert
6887 -- the Mod clause into an alignment clause anyway, so that the
6888 -- back end can compute and back-annotate properly the size and
6889 -- alignment of types that may include this record.
6891 -- This seems dubious, this destroys the source tree in a manner
6892 -- not detectable by ASIS ???
6894 if Operating_Mode = Check_Semantics and then ASIS_Mode then
6896 Make_Attribute_Definition_Clause (Loc,
6897 Name => New_Occurrence_Of (Base_Type (Rectype), Loc),
6898 Chars => Name_Alignment,
6899 Expression => Relocate_Node (Expression (M)));
6901 Set_From_At_Mod (AtM_Nod);
6902 Insert_After (N, AtM_Nod);
6903 Mod_Val := Get_Alignment_Value (Expression (AtM_Nod));
6904 Set_Mod_Clause (N, Empty);
6907 -- Get the alignment value to perform error checking
6909 Mod_Val := Get_Alignment_Value (Expression (M));
6914 -- For untagged types, clear any existing component clauses for the
6915 -- type. If the type is derived, this is what allows us to override
6916 -- a rep clause for the parent. For type extensions, the representation
6917 -- of the inherited components is inherited, so we want to keep previous
6918 -- component clauses for completeness.
6920 if not Is_Tagged_Type (Rectype) then
6921 Comp := First_Component_Or_Discriminant (Rectype);
6922 while Present (Comp) loop
6923 Set_Component_Clause (Comp, Empty);
6924 Next_Component_Or_Discriminant (Comp);
6928 -- All done if no component clauses
6930 CC := First (Component_Clauses (N));
6936 -- A representation like this applies to the base type
6938 Set_Has_Record_Rep_Clause (Base_Type (Rectype));
6939 Set_Has_Non_Standard_Rep (Base_Type (Rectype));
6940 Set_Has_Specified_Layout (Base_Type (Rectype));
6942 -- Process the component clauses
6944 while Present (CC) loop
6948 if Nkind (CC) = N_Pragma then
6951 -- The only pragma of interest is Complete_Representation
6953 if Pragma_Name (CC) = Name_Complete_Representation then
6957 -- Processing for real component clause
6960 Posit := Static_Integer (Position (CC));
6961 Fbit := Static_Integer (First_Bit (CC));
6962 Lbit := Static_Integer (Last_Bit (CC));
6965 and then Fbit /= No_Uint
6966 and then Lbit /= No_Uint
6969 Error_Msg_N ("position cannot be negative", Position (CC));
6972 Error_Msg_N ("first bit cannot be negative", First_Bit (CC));
6974 -- The Last_Bit specified in a component clause must not be
6975 -- less than the First_Bit minus one (RM-13.5.1(10)).
6977 elsif Lbit < Fbit - 1 then
6979 ("last bit cannot be less than first bit minus one",
6982 -- Values look OK, so find the corresponding record component
6983 -- Even though the syntax allows an attribute reference for
6984 -- implementation-defined components, GNAT does not allow the
6985 -- tag to get an explicit position.
6987 elsif Nkind (Component_Name (CC)) = N_Attribute_Reference then
6988 if Attribute_Name (Component_Name (CC)) = Name_Tag then
6989 Error_Msg_N ("position of tag cannot be specified", CC);
6991 Error_Msg_N ("illegal component name", CC);
6995 Comp := First_Entity (Rectype);
6996 while Present (Comp) loop
6997 exit when Chars (Comp) = Chars (Component_Name (CC));
7003 -- Maybe component of base type that is absent from
7004 -- statically constrained first subtype.
7006 Comp := First_Entity (Base_Type (Rectype));
7007 while Present (Comp) loop
7008 exit when Chars (Comp) = Chars (Component_Name (CC));
7015 ("component clause is for non-existent field", CC);
7017 -- Ada 2012 (AI05-0026): Any name that denotes a
7018 -- discriminant of an object of an unchecked union type
7019 -- shall not occur within a record_representation_clause.
7021 -- The general restriction of using record rep clauses on
7022 -- Unchecked_Union types has now been lifted. Since it is
7023 -- possible to introduce a record rep clause which mentions
7024 -- the discriminant of an Unchecked_Union in non-Ada 2012
7025 -- code, this check is applied to all versions of the
7028 elsif Ekind (Comp) = E_Discriminant
7029 and then Is_Unchecked_Union (Rectype)
7032 ("cannot reference discriminant of unchecked union",
7033 Component_Name (CC));
7035 elsif Is_Record_Extension and then Is_Inherited (Comp) then
7037 ("component clause not allowed for inherited "
7038 & "component&", CC, Comp);
7040 elsif Present (Component_Clause (Comp)) then
7042 -- Diagnose duplicate rep clause, or check consistency
7043 -- if this is an inherited component. In a double fault,
7044 -- there may be a duplicate inconsistent clause for an
7045 -- inherited component.
7047 if Scope (Original_Record_Component (Comp)) = Rectype
7048 or else Parent (Component_Clause (Comp)) = N
7050 Error_Msg_Sloc := Sloc (Component_Clause (Comp));
7051 Error_Msg_N ("component clause previously given#", CC);
7055 Rep1 : constant Node_Id := Component_Clause (Comp);
7057 if Intval (Position (Rep1)) /=
7058 Intval (Position (CC))
7059 or else Intval (First_Bit (Rep1)) /=
7060 Intval (First_Bit (CC))
7061 or else Intval (Last_Bit (Rep1)) /=
7062 Intval (Last_Bit (CC))
7065 ("component clause inconsistent with "
7066 & "representation of ancestor", CC);
7068 elsif Warn_On_Redundant_Constructs then
7070 ("?r?redundant confirming component clause "
7071 & "for component!", CC);
7076 -- Normal case where this is the first component clause we
7077 -- have seen for this entity, so set it up properly.
7080 -- Make reference for field in record rep clause and set
7081 -- appropriate entity field in the field identifier.
7084 (Comp, Component_Name (CC), Set_Ref => False);
7085 Set_Entity (Component_Name (CC), Comp);
7087 -- Update Fbit and Lbit to the actual bit number
7089 Fbit := Fbit + UI_From_Int (SSU) * Posit;
7090 Lbit := Lbit + UI_From_Int (SSU) * Posit;
7092 if Has_Size_Clause (Rectype)
7093 and then RM_Size (Rectype) <= Lbit
7096 ("bit number out of range of specified size",
7099 Set_Component_Clause (Comp, CC);
7100 Set_Component_Bit_Offset (Comp, Fbit);
7101 Set_Esize (Comp, 1 + (Lbit - Fbit));
7102 Set_Normalized_First_Bit (Comp, Fbit mod SSU);
7103 Set_Normalized_Position (Comp, Fbit / SSU);
7105 if Warn_On_Overridden_Size
7106 and then Has_Size_Clause (Etype (Comp))
7107 and then RM_Size (Etype (Comp)) /= Esize (Comp)
7110 ("?S?component size overrides size clause for&",
7111 Component_Name (CC), Etype (Comp));
7114 -- This information is also set in the corresponding
7115 -- component of the base type, found by accessing the
7116 -- Original_Record_Component link if it is present.
7118 Ocomp := Original_Record_Component (Comp);
7125 (Component_Name (CC),
7131 (Comp, First_Node (CC), "component clause", Biased);
7133 if Present (Ocomp) then
7134 Set_Component_Clause (Ocomp, CC);
7135 Set_Component_Bit_Offset (Ocomp, Fbit);
7136 Set_Normalized_First_Bit (Ocomp, Fbit mod SSU);
7137 Set_Normalized_Position (Ocomp, Fbit / SSU);
7138 Set_Esize (Ocomp, 1 + (Lbit - Fbit));
7140 Set_Normalized_Position_Max
7141 (Ocomp, Normalized_Position (Ocomp));
7143 -- Note: we don't use Set_Biased here, because we
7144 -- already gave a warning above if needed, and we
7145 -- would get a duplicate for the same name here.
7147 Set_Has_Biased_Representation
7148 (Ocomp, Has_Biased_Representation (Comp));
7151 if Esize (Comp) < 0 then
7152 Error_Msg_N ("component size is negative", CC);
7163 -- Check missing components if Complete_Representation pragma appeared
7165 if Present (CR_Pragma) then
7166 Comp := First_Component_Or_Discriminant (Rectype);
7167 while Present (Comp) loop
7168 if No (Component_Clause (Comp)) then
7170 ("missing component clause for &", CR_Pragma, Comp);
7173 Next_Component_Or_Discriminant (Comp);
7176 -- Give missing components warning if required
7178 elsif Warn_On_Unrepped_Components then
7180 Num_Repped_Components : Nat := 0;
7181 Num_Unrepped_Components : Nat := 0;
7184 -- First count number of repped and unrepped components
7186 Comp := First_Component_Or_Discriminant (Rectype);
7187 while Present (Comp) loop
7188 if Present (Component_Clause (Comp)) then
7189 Num_Repped_Components := Num_Repped_Components + 1;
7191 Num_Unrepped_Components := Num_Unrepped_Components + 1;
7194 Next_Component_Or_Discriminant (Comp);
7197 -- We are only interested in the case where there is at least one
7198 -- unrepped component, and at least half the components have rep
7199 -- clauses. We figure that if less than half have them, then the
7200 -- partial rep clause is really intentional. If the component
7201 -- type has no underlying type set at this point (as for a generic
7202 -- formal type), we don't know enough to give a warning on the
7205 if Num_Unrepped_Components > 0
7206 and then Num_Unrepped_Components < Num_Repped_Components
7208 Comp := First_Component_Or_Discriminant (Rectype);
7209 while Present (Comp) loop
7210 if No (Component_Clause (Comp))
7211 and then Comes_From_Source (Comp)
7212 and then Present (Underlying_Type (Etype (Comp)))
7213 and then (Is_Scalar_Type (Underlying_Type (Etype (Comp)))
7214 or else Size_Known_At_Compile_Time
7215 (Underlying_Type (Etype (Comp))))
7216 and then not Has_Warnings_Off (Rectype)
7218 -- Ignore discriminant in unchecked union, since it is
7219 -- not there, and cannot have a component clause.
7221 and then (not Is_Unchecked_Union (Rectype)
7222 or else Ekind (Comp) /= E_Discriminant)
7224 Error_Msg_Sloc := Sloc (Comp);
7226 ("?C?no component clause given for & declared #",
7230 Next_Component_Or_Discriminant (Comp);
7235 end Analyze_Record_Representation_Clause;
7237 -------------------------------------
7238 -- Build_Discrete_Static_Predicate --
7239 -------------------------------------
7241 procedure Build_Discrete_Static_Predicate
7246 Loc : constant Source_Ptr := Sloc (Expr);
7248 Non_Static : exception;
7249 -- Raised if something non-static is found
7251 Btyp : constant Entity_Id := Base_Type (Typ);
7253 BLo : constant Uint := Expr_Value (Type_Low_Bound (Btyp));
7254 BHi : constant Uint := Expr_Value (Type_High_Bound (Btyp));
7255 -- Low bound and high bound value of base type of Typ
7259 -- Bounds for constructing the static predicate. We use the bound of the
7260 -- subtype if it is static, otherwise the corresponding base type bound.
7261 -- Note: a non-static subtype can have a static predicate.
7266 -- One entry in a Rlist value, a single REnt (range entry) value denotes
7267 -- one range from Lo to Hi. To represent a single value range Lo = Hi =
7270 type RList is array (Nat range <>) of REnt;
7271 -- A list of ranges. The ranges are sorted in increasing order, and are
7272 -- disjoint (there is a gap of at least one value between each range in
7273 -- the table). A value is in the set of ranges in Rlist if it lies
7274 -- within one of these ranges.
7276 False_Range : constant RList :=
7277 RList'(1 .. 0 => REnt'(No_Uint, No_Uint));
7278 -- An empty set of ranges represents a range list that can never be
7279 -- satisfied, since there are no ranges in which the value could lie,
7280 -- so it does not lie in any of them. False_Range is a canonical value
7281 -- for this empty set, but general processing should test for an Rlist
7282 -- with length zero (see Is_False predicate), since other null ranges
7283 -- may appear which must be treated as False.
7285 True_Range : constant RList := RList'(1 => REnt'(BLo, BHi));
7286 -- Range representing True, value must be in the base range
7288 function "and" (Left : RList; Right : RList) return RList;
7289 -- And's together two range lists, returning a range list. This is a set
7290 -- intersection operation.
7292 function "or" (Left : RList; Right : RList) return RList;
7293 -- Or's together two range lists, returning a range list. This is a set
7296 function "not" (Right : RList) return RList;
7297 -- Returns complement of a given range list, i.e. a range list
7298 -- representing all the values in TLo .. THi that are not in the input
7301 function Build_Val (V : Uint) return Node_Id;
7302 -- Return an analyzed N_Identifier node referencing this value, suitable
7303 -- for use as an entry in the Static_Discrte_Predicate list. This node
7304 -- is typed with the base type.
7306 function Build_Range (Lo : Uint; Hi : Uint) return Node_Id;
7307 -- Return an analyzed N_Range node referencing this range, suitable for
7308 -- use as an entry in the Static_Discrete_Predicate list. This node is
7309 -- typed with the base type.
7311 function Get_RList (Exp : Node_Id) return RList;
7312 -- This is a recursive routine that converts the given expression into a
7313 -- list of ranges, suitable for use in building the static predicate.
7315 function Is_False (R : RList) return Boolean;
7316 pragma Inline (Is_False);
7317 -- Returns True if the given range list is empty, and thus represents a
7318 -- False list of ranges that can never be satisfied.
7320 function Is_True (R : RList) return Boolean;
7321 -- Returns True if R trivially represents the True predicate by having a
7322 -- single range from BLo to BHi.
7324 function Is_Type_Ref (N : Node_Id) return Boolean;
7325 pragma Inline (Is_Type_Ref);
7326 -- Returns if True if N is a reference to the type for the predicate in
7327 -- the expression (i.e. if it is an identifier whose Chars field matches
7328 -- the Nam given in the call). N must not be parenthesized, if the type
7329 -- name appears in parens, this routine will return False.
7331 function Lo_Val (N : Node_Id) return Uint;
7332 -- Given an entry from a Static_Discrete_Predicate list that is either
7333 -- a static expression or static range, gets either the expression value
7334 -- or the low bound of the range.
7336 function Hi_Val (N : Node_Id) return Uint;
7337 -- Given an entry from a Static_Discrete_Predicate list that is either
7338 -- a static expression or static range, gets either the expression value
7339 -- or the high bound of the range.
7341 function Membership_Entry (N : Node_Id) return RList;
7342 -- Given a single membership entry (range, value, or subtype), returns
7343 -- the corresponding range list. Raises Static_Error if not static.
7345 function Membership_Entries (N : Node_Id) return RList;
7346 -- Given an element on an alternatives list of a membership operation,
7347 -- returns the range list corresponding to this entry and all following
7348 -- entries (i.e. returns the "or" of this list of values).
7350 function Stat_Pred (Typ : Entity_Id) return RList;
7351 -- Given a type, if it has a static predicate, then return the predicate
7352 -- as a range list, otherwise raise Non_Static.
7358 function "and" (Left : RList; Right : RList) return RList is
7360 -- First range of result
7362 SLeft : Nat := Left'First;
7363 -- Start of rest of left entries
7365 SRight : Nat := Right'First;
7366 -- Start of rest of right entries
7369 -- If either range is True, return the other
7371 if Is_True (Left) then
7373 elsif Is_True (Right) then
7377 -- If either range is False, return False
7379 if Is_False (Left) or else Is_False (Right) then
7383 -- Loop to remove entries at start that are disjoint, and thus just
7384 -- get discarded from the result entirely.
7387 -- If no operands left in either operand, result is false
7389 if SLeft > Left'Last or else SRight > Right'Last then
7392 -- Discard first left operand entry if disjoint with right
7394 elsif Left (SLeft).Hi < Right (SRight).Lo then
7397 -- Discard first right operand entry if disjoint with left
7399 elsif Right (SRight).Hi < Left (SLeft).Lo then
7400 SRight := SRight + 1;
7402 -- Otherwise we have an overlapping entry
7409 -- Now we have two non-null operands, and first entries overlap. The
7410 -- first entry in the result will be the overlapping part of these
7413 FEnt := REnt'(Lo => UI_Max (Left (SLeft).Lo, Right (SRight).Lo),
7414 Hi => UI_Min (Left (SLeft).Hi, Right (SRight).Hi));
7416 -- Now we can remove the entry that ended at a lower value, since its
7417 -- contribution is entirely contained in Fent.
7419 if Left (SLeft).Hi <= Right (SRight).Hi then
7422 SRight := SRight + 1;
7425 -- Compute result by concatenating this first entry with the "and" of
7426 -- the remaining parts of the left and right operands. Note that if
7427 -- either of these is empty, "and" will yield empty, so that we will
7428 -- end up with just Fent, which is what we want in that case.
7431 FEnt & (Left (SLeft .. Left'Last) and Right (SRight .. Right'Last));
7438 function "not" (Right : RList) return RList is
7440 -- Return True if False range
7442 if Is_False (Right) then
7446 -- Return False if True range
7448 if Is_True (Right) then
7452 -- Here if not trivial case
7455 Result : RList (1 .. Right'Length + 1);
7456 -- May need one more entry for gap at beginning and end
7459 -- Number of entries stored in Result
7464 if Right (Right'First).Lo > TLo then
7466 Result (Count) := REnt'(TLo, Right (Right'First).Lo - 1);
7469 -- Gaps between ranges
7471 for J in Right'First .. Right'Last - 1 loop
7473 Result (Count) := REnt'(Right (J).Hi + 1, Right (J + 1).Lo - 1);
7478 if Right (Right'Last).Hi < THi then
7480 Result (Count) := REnt'(Right (Right'Last).Hi + 1, THi);
7483 return Result (1 .. Count);
7491 function "or" (Left : RList; Right : RList) return RList is
7493 -- First range of result
7495 SLeft : Nat := Left'First;
7496 -- Start of rest of left entries
7498 SRight : Nat := Right'First;
7499 -- Start of rest of right entries
7502 -- If either range is True, return True
7504 if Is_True (Left) or else Is_True (Right) then
7508 -- If either range is False (empty), return the other
7510 if Is_False (Left) then
7512 elsif Is_False (Right) then
7516 -- Initialize result first entry from left or right operand depending
7517 -- on which starts with the lower range.
7519 if Left (SLeft).Lo < Right (SRight).Lo then
7520 FEnt := Left (SLeft);
7523 FEnt := Right (SRight);
7524 SRight := SRight + 1;
7527 -- This loop eats ranges from left and right operands that are
7528 -- contiguous with the first range we are gathering.
7531 -- Eat first entry in left operand if contiguous or overlapped by
7532 -- gathered first operand of result.
7534 if SLeft <= Left'Last
7535 and then Left (SLeft).Lo <= FEnt.Hi + 1
7537 FEnt.Hi := UI_Max (FEnt.Hi, Left (SLeft).Hi);
7540 -- Eat first entry in right operand if contiguous or overlapped by
7541 -- gathered right operand of result.
7543 elsif SRight <= Right'Last
7544 and then Right (SRight).Lo <= FEnt.Hi + 1
7546 FEnt.Hi := UI_Max (FEnt.Hi, Right (SRight).Hi);
7547 SRight := SRight + 1;
7549 -- All done if no more entries to eat
7556 -- Obtain result as the first entry we just computed, concatenated
7557 -- to the "or" of the remaining results (if one operand is empty,
7558 -- this will just concatenate with the other
7561 FEnt & (Left (SLeft .. Left'Last) or Right (SRight .. Right'Last));
7568 function Build_Range (Lo : Uint; Hi : Uint) return Node_Id is
7573 Low_Bound => Build_Val (Lo),
7574 High_Bound => Build_Val (Hi));
7575 Set_Etype (Result, Btyp);
7576 Set_Analyzed (Result);
7584 function Build_Val (V : Uint) return Node_Id is
7588 if Is_Enumeration_Type (Typ) then
7589 Result := Get_Enum_Lit_From_Pos (Typ, V, Loc);
7591 Result := Make_Integer_Literal (Loc, V);
7594 Set_Etype (Result, Btyp);
7595 Set_Is_Static_Expression (Result);
7596 Set_Analyzed (Result);
7604 function Get_RList (Exp : Node_Id) return RList is
7609 -- Static expression can only be true or false
7611 if Is_OK_Static_Expression (Exp) then
7612 if Expr_Value (Exp) = 0 then
7619 -- Otherwise test node type
7630 return Get_RList (Left_Opnd (Exp))
7632 Get_RList (Right_Opnd (Exp));
7639 return Get_RList (Left_Opnd (Exp))
7641 Get_RList (Right_Opnd (Exp));
7646 return not Get_RList (Right_Opnd (Exp));
7648 -- Comparisons of type with static value
7650 when N_Op_Compare =>
7652 -- Type is left operand
7654 if Is_Type_Ref (Left_Opnd (Exp))
7655 and then Is_OK_Static_Expression (Right_Opnd (Exp))
7657 Val := Expr_Value (Right_Opnd (Exp));
7659 -- Typ is right operand
7661 elsif Is_Type_Ref (Right_Opnd (Exp))
7662 and then Is_OK_Static_Expression (Left_Opnd (Exp))
7664 Val := Expr_Value (Left_Opnd (Exp));
7666 -- Invert sense of comparison
7669 when N_Op_Gt => Op := N_Op_Lt;
7670 when N_Op_Lt => Op := N_Op_Gt;
7671 when N_Op_Ge => Op := N_Op_Le;
7672 when N_Op_Le => Op := N_Op_Ge;
7673 when others => null;
7676 -- Other cases are non-static
7682 -- Construct range according to comparison operation
7686 return RList'(1 => REnt'(Val, Val));
7689 return RList'(1 => REnt'(Val, BHi));
7692 return RList'(1 => REnt'(Val + 1, BHi));
7695 return RList'(1 => REnt'(BLo, Val));
7698 return RList'(1 => REnt'(BLo, Val - 1));
7701 return RList'(REnt'(BLo, Val - 1), REnt'(Val + 1, BHi));
7704 raise Program_Error;
7710 if not Is_Type_Ref (Left_Opnd (Exp)) then
7714 if Present (Right_Opnd (Exp)) then
7715 return Membership_Entry (Right_Opnd (Exp));
7717 return Membership_Entries (First (Alternatives (Exp)));
7720 -- Negative membership (NOT IN)
7723 if not Is_Type_Ref (Left_Opnd (Exp)) then
7727 if Present (Right_Opnd (Exp)) then
7728 return not Membership_Entry (Right_Opnd (Exp));
7730 return not Membership_Entries (First (Alternatives (Exp)));
7733 -- Function call, may be call to static predicate
7735 when N_Function_Call =>
7736 if Is_Entity_Name (Name (Exp)) then
7738 Ent : constant Entity_Id := Entity (Name (Exp));
7740 if Is_Predicate_Function (Ent)
7742 Is_Predicate_Function_M (Ent)
7744 return Stat_Pred (Etype (First_Formal (Ent)));
7749 -- Other function call cases are non-static
7753 -- Qualified expression, dig out the expression
7755 when N_Qualified_Expression =>
7756 return Get_RList (Expression (Exp));
7758 when N_Case_Expression =>
7765 if not Is_Entity_Name (Expression (Expr))
7766 or else Etype (Expression (Expr)) /= Typ
7769 ("expression must denaote subtype", Expression (Expr));
7773 -- Collect discrete choices in all True alternatives
7775 Choices := New_List;
7776 Alt := First (Alternatives (Exp));
7777 while Present (Alt) loop
7778 Dep := Expression (Alt);
7780 if not Is_OK_Static_Expression (Dep) then
7783 elsif Is_True (Expr_Value (Dep)) then
7784 Append_List_To (Choices,
7785 New_Copy_List (Discrete_Choices (Alt)));
7791 return Membership_Entries (First (Choices));
7794 -- Expression with actions: if no actions, dig out expression
7796 when N_Expression_With_Actions =>
7797 if Is_Empty_List (Actions (Exp)) then
7798 return Get_RList (Expression (Exp));
7806 return (Get_RList (Left_Opnd (Exp))
7807 and not Get_RList (Right_Opnd (Exp)))
7808 or (Get_RList (Right_Opnd (Exp))
7809 and not Get_RList (Left_Opnd (Exp)));
7811 -- Any other node type is non-static
7822 function Hi_Val (N : Node_Id) return Uint is
7824 if Is_OK_Static_Expression (N) then
7825 return Expr_Value (N);
7827 pragma Assert (Nkind (N) = N_Range);
7828 return Expr_Value (High_Bound (N));
7836 function Is_False (R : RList) return Boolean is
7838 return R'Length = 0;
7845 function Is_True (R : RList) return Boolean is
7848 and then R (R'First).Lo = BLo
7849 and then R (R'First).Hi = BHi;
7856 function Is_Type_Ref (N : Node_Id) return Boolean is
7858 return Nkind (N) = N_Identifier
7859 and then Chars (N) = Nam
7860 and then Paren_Count (N) = 0;
7867 function Lo_Val (N : Node_Id) return Uint is
7869 if Is_OK_Static_Expression (N) then
7870 return Expr_Value (N);
7872 pragma Assert (Nkind (N) = N_Range);
7873 return Expr_Value (Low_Bound (N));
7877 ------------------------
7878 -- Membership_Entries --
7879 ------------------------
7881 function Membership_Entries (N : Node_Id) return RList is
7883 if No (Next (N)) then
7884 return Membership_Entry (N);
7886 return Membership_Entry (N) or Membership_Entries (Next (N));
7888 end Membership_Entries;
7890 ----------------------
7891 -- Membership_Entry --
7892 ----------------------
7894 function Membership_Entry (N : Node_Id) return RList is
7902 if Nkind (N) = N_Range then
7903 if not Is_OK_Static_Expression (Low_Bound (N))
7905 not Is_OK_Static_Expression (High_Bound (N))
7909 SLo := Expr_Value (Low_Bound (N));
7910 SHi := Expr_Value (High_Bound (N));
7911 return RList'(1 => REnt'(SLo, SHi));
7914 -- Static expression case
7916 elsif Is_OK_Static_Expression (N) then
7917 Val := Expr_Value (N);
7918 return RList'(1 => REnt'(Val, Val));
7920 -- Identifier (other than static expression) case
7922 else pragma Assert (Nkind (N) = N_Identifier);
7926 if Is_Type (Entity (N)) then
7928 -- If type has predicates, process them
7930 if Has_Predicates (Entity (N)) then
7931 return Stat_Pred (Entity (N));
7933 -- For static subtype without predicates, get range
7935 elsif Is_OK_Static_Subtype (Entity (N)) then
7936 SLo := Expr_Value (Type_Low_Bound (Entity (N)));
7937 SHi := Expr_Value (Type_High_Bound (Entity (N)));
7938 return RList'(1 => REnt'(SLo, SHi));
7940 -- Any other type makes us non-static
7946 -- Any other kind of identifier in predicate (e.g. a non-static
7947 -- expression value) means this is not a static predicate.
7953 end Membership_Entry;
7959 function Stat_Pred (Typ : Entity_Id) return RList is
7961 -- Not static if type does not have static predicates
7963 if not Has_Static_Predicate (Typ) then
7967 -- Otherwise we convert the predicate list to a range list
7970 Spred : constant List_Id := Static_Discrete_Predicate (Typ);
7971 Result : RList (1 .. List_Length (Spred));
7975 P := First (Static_Discrete_Predicate (Typ));
7976 for J in Result'Range loop
7977 Result (J) := REnt'(Lo_Val (P), Hi_Val (P));
7985 -- Start of processing for Build_Discrete_Static_Predicate
7988 -- Establish bounds for the predicate
7990 if Compile_Time_Known_Value (Type_Low_Bound (Typ)) then
7991 TLo := Expr_Value (Type_Low_Bound (Typ));
7996 if Compile_Time_Known_Value (Type_High_Bound (Typ)) then
7997 THi := Expr_Value (Type_High_Bound (Typ));
8002 -- Analyze the expression to see if it is a static predicate
8005 Ranges : constant RList := Get_RList (Expr);
8006 -- Range list from expression if it is static
8011 -- Convert range list into a form for the static predicate. In the
8012 -- Ranges array, we just have raw ranges, these must be converted
8013 -- to properly typed and analyzed static expressions or range nodes.
8015 -- Note: here we limit ranges to the ranges of the subtype, so that
8016 -- a predicate is always false for values outside the subtype. That
8017 -- seems fine, such values are invalid anyway, and considering them
8018 -- to fail the predicate seems allowed and friendly, and furthermore
8019 -- simplifies processing for case statements and loops.
8023 for J in Ranges'Range loop
8025 Lo : Uint := Ranges (J).Lo;
8026 Hi : Uint := Ranges (J).Hi;
8029 -- Ignore completely out of range entry
8031 if Hi < TLo or else Lo > THi then
8034 -- Otherwise process entry
8037 -- Adjust out of range value to subtype range
8047 -- Convert range into required form
8049 Append_To (Plist, Build_Range (Lo, Hi));
8054 -- Processing was successful and all entries were static, so now we
8055 -- can store the result as the predicate list.
8057 Set_Static_Discrete_Predicate (Typ, Plist);
8059 -- The processing for static predicates put the expression into
8060 -- canonical form as a series of ranges. It also eliminated
8061 -- duplicates and collapsed and combined ranges. We might as well
8062 -- replace the alternatives list of the right operand of the
8063 -- membership test with the static predicate list, which will
8064 -- usually be more efficient.
8067 New_Alts : constant List_Id := New_List;
8072 Old_Node := First (Plist);
8073 while Present (Old_Node) loop
8074 New_Node := New_Copy (Old_Node);
8076 if Nkind (New_Node) = N_Range then
8077 Set_Low_Bound (New_Node, New_Copy (Low_Bound (Old_Node)));
8078 Set_High_Bound (New_Node, New_Copy (High_Bound (Old_Node)));
8081 Append_To (New_Alts, New_Node);
8085 -- If empty list, replace by False
8087 if Is_Empty_List (New_Alts) then
8088 Rewrite (Expr, New_Occurrence_Of (Standard_False, Loc));
8090 -- Else replace by set membership test
8095 Left_Opnd => Make_Identifier (Loc, Nam),
8096 Right_Opnd => Empty,
8097 Alternatives => New_Alts));
8099 -- Resolve new expression in function context
8101 Install_Formals (Predicate_Function (Typ));
8102 Push_Scope (Predicate_Function (Typ));
8103 Analyze_And_Resolve (Expr, Standard_Boolean);
8109 -- If non-static, return doing nothing
8114 end Build_Discrete_Static_Predicate;
8116 --------------------------------
8117 -- Build_Export_Import_Pragma --
8118 --------------------------------
8120 function Build_Export_Import_Pragma
8122 Id : Entity_Id) return Node_Id
8124 Asp_Id : constant Aspect_Id := Get_Aspect_Id (Asp);
8125 Expr : constant Node_Id := Expression (Asp);
8126 Loc : constant Source_Ptr := Sloc (Asp);
8137 Create_Pragma : Boolean := False;
8138 -- This flag is set when the aspect form is such that it warrants the
8139 -- creation of a corresponding pragma.
8142 if Present (Expr) then
8143 if Error_Posted (Expr) then
8146 elsif Is_True (Expr_Value (Expr)) then
8147 Create_Pragma := True;
8150 -- Otherwise the aspect defaults to True
8153 Create_Pragma := True;
8156 -- Nothing to do when the expression is False or is erroneous
8158 if not Create_Pragma then
8162 -- Obtain all interfacing aspects that apply to the related entity
8164 Get_Interfacing_Aspects
8168 Expo_Asp => Dummy_1,
8174 -- Handle the convention argument
8176 if Present (Conv) then
8177 Conv_Arg := New_Copy_Tree (Expression (Conv));
8179 -- Assume convention "Ada' when aspect Convention is missing
8182 Conv_Arg := Make_Identifier (Loc, Name_Ada);
8186 Make_Pragma_Argument_Association (Loc,
8187 Chars => Name_Convention,
8188 Expression => Conv_Arg));
8190 -- Handle the entity argument
8193 Make_Pragma_Argument_Association (Loc,
8194 Chars => Name_Entity,
8195 Expression => New_Occurrence_Of (Id, Loc)));
8197 -- Handle the External_Name argument
8199 if Present (EN) then
8201 Make_Pragma_Argument_Association (Loc,
8202 Chars => Name_External_Name,
8203 Expression => New_Copy_Tree (Expression (EN))));
8206 -- Handle the Link_Name argument
8208 if Present (LN) then
8210 Make_Pragma_Argument_Association (Loc,
8211 Chars => Name_Link_Name,
8212 Expression => New_Copy_Tree (Expression (LN))));
8216 -- pragma Export/Import
8217 -- (Convention => <Conv>/Ada,
8219 -- [External_Name => <EN>,]
8220 -- [Link_Name => <LN>]);
8224 Pragma_Identifier =>
8225 Make_Identifier (Loc, Chars (Identifier (Asp))),
8226 Pragma_Argument_Associations => Args);
8228 -- Decorate the relevant aspect and the pragma
8230 Set_Aspect_Rep_Item (Asp, Prag);
8232 Set_Corresponding_Aspect (Prag, Asp);
8233 Set_From_Aspect_Specification (Prag);
8234 Set_Parent (Prag, Asp);
8236 if Asp_Id = Aspect_Import and then Is_Subprogram (Id) then
8237 Set_Import_Pragma (Id, Prag);
8241 end Build_Export_Import_Pragma;
8243 -------------------------------
8244 -- Build_Predicate_Functions --
8245 -------------------------------
8247 -- The procedures that are constructed here have the form:
8249 -- function typPredicate (Ixxx : typ) return Boolean is
8252 -- typ1Predicate (typ1 (Ixxx))
8253 -- and then typ2Predicate (typ2 (Ixxx))
8255 -- exp1 and then exp2 and then ...
8256 -- end typPredicate;
8258 -- Here exp1, and exp2 are expressions from Predicate pragmas. Note that
8259 -- this is the point at which these expressions get analyzed, providing the
8260 -- required delay, and typ1, typ2, are entities from which predicates are
8261 -- inherited. Note that we do NOT generate Check pragmas, that's because we
8262 -- use this function even if checks are off, e.g. for membership tests.
8264 -- Note that the inherited predicates are evaluated first, as required by
8267 -- Note that Sem_Eval.Real_Or_String_Static_Predicate_Matches depends on
8268 -- the form of this return expression.
8270 -- If the expression has at least one Raise_Expression, then we also build
8271 -- the typPredicateM version of the function, in which any occurrence of a
8272 -- Raise_Expression is converted to "return False".
8274 -- WARNING: This routine manages Ghost regions. Return statements must be
8275 -- replaced by gotos which jump to the end of the routine and restore the
8278 procedure Build_Predicate_Functions (Typ : Entity_Id; N : Node_Id) is
8279 Loc : constant Source_Ptr := Sloc (Typ);
8282 -- This is the expression for the result of the function. It is
8283 -- is build by connecting the component predicates with AND THEN.
8286 -- This is the corresponding return expression for the Predicate_M
8287 -- function. It differs in that raise expressions are marked for
8288 -- special expansion (see Process_REs).
8290 Object_Name : Name_Id;
8291 -- Name for argument of Predicate procedure. Note that we use the same
8292 -- name for both predicate functions. That way the reference within the
8293 -- predicate expression is the same in both functions.
8295 Object_Entity : Entity_Id;
8296 -- Entity for argument of Predicate procedure
8298 Object_Entity_M : Entity_Id;
8299 -- Entity for argument of separate Predicate procedure when exceptions
8300 -- are present in expression.
8303 -- The function declaration
8308 Raise_Expression_Present : Boolean := False;
8309 -- Set True if Expr has at least one Raise_Expression
8311 procedure Add_Condition (Cond : Node_Id);
8312 -- Append Cond to Expr using "and then" (or just copy Cond to Expr if
8315 procedure Add_Predicates;
8316 -- Appends expressions for any Predicate pragmas in the rep item chain
8317 -- Typ to Expr. Note that we look only at items for this exact entity.
8318 -- Inheritance of predicates for the parent type is done by calling the
8319 -- Predicate_Function of the parent type, using Add_Call above.
8321 procedure Add_Call (T : Entity_Id);
8322 -- Includes a call to the predicate function for type T in Expr if T
8323 -- has predicates and Predicate_Function (T) is non-empty.
8325 function Process_RE (N : Node_Id) return Traverse_Result;
8326 -- Used in Process REs, tests if node N is a raise expression, and if
8327 -- so, marks it to be converted to return False.
8329 procedure Process_REs is new Traverse_Proc (Process_RE);
8330 -- Marks any raise expressions in Expr_M to return False
8332 function Test_RE (N : Node_Id) return Traverse_Result;
8333 -- Used in Test_REs, tests one node for being a raise expression, and if
8334 -- so sets Raise_Expression_Present True.
8336 procedure Test_REs is new Traverse_Proc (Test_RE);
8337 -- Tests to see if Expr contains any raise expressions
8343 procedure Add_Call (T : Entity_Id) is
8347 if Present (T) and then Present (Predicate_Function (T)) then
8348 Set_Has_Predicates (Typ);
8350 -- Build the call to the predicate function of T. The type may be
8351 -- derived, so use an unchecked conversion for the actual.
8357 Unchecked_Convert_To (T,
8358 Make_Identifier (Loc, Object_Name)));
8360 -- "and"-in the call to evolving expression
8362 Add_Condition (Exp);
8364 -- Output info message on inheritance if required. Note we do not
8365 -- give this information for generic actual types, since it is
8366 -- unwelcome noise in that case in instantiations. We also
8367 -- generally suppress the message in instantiations, and also
8368 -- if it involves internal names.
8370 if Opt.List_Inherited_Aspects
8371 and then not Is_Generic_Actual_Type (Typ)
8372 and then Instantiation_Depth (Sloc (Typ)) = 0
8373 and then not Is_Internal_Name (Chars (T))
8374 and then not Is_Internal_Name (Chars (Typ))
8376 Error_Msg_Sloc := Sloc (Predicate_Function (T));
8377 Error_Msg_Node_2 := T;
8378 Error_Msg_N ("info: & inherits predicate from & #?L?", Typ);
8387 procedure Add_Condition (Cond : Node_Id) is
8389 -- This is the first predicate expression
8394 -- Otherwise concatenate to the existing predicate expressions by
8395 -- using "and then".
8400 Left_Opnd => Relocate_Node (Expr),
8401 Right_Opnd => Cond);
8405 --------------------
8406 -- Add_Predicates --
8407 --------------------
8409 procedure Add_Predicates is
8410 procedure Add_Predicate (Prag : Node_Id);
8411 -- Concatenate the expression of predicate pragma Prag to Expr by
8412 -- using a short circuit "and then" operator.
8418 procedure Add_Predicate (Prag : Node_Id) is
8419 procedure Replace_Type_Reference (N : Node_Id);
8420 -- Replace a single occurrence N of the subtype name with a
8421 -- reference to the formal of the predicate function. N can be an
8422 -- identifier referencing the subtype, or a selected component,
8423 -- representing an appropriately qualified occurrence of the
8426 procedure Replace_Type_References is
8427 new Replace_Type_References_Generic (Replace_Type_Reference);
8428 -- Traverse an expression changing every occurrence of an
8429 -- identifier whose name matches the name of the subtype with a
8430 -- reference to the formal parameter of the predicate function.
8432 ----------------------------
8433 -- Replace_Type_Reference --
8434 ----------------------------
8436 procedure Replace_Type_Reference (N : Node_Id) is
8438 Rewrite (N, Make_Identifier (Sloc (N), Object_Name));
8439 -- Use the Sloc of the usage name, not the defining name
8442 Set_Entity (N, Object_Entity);
8444 -- We want to treat the node as if it comes from source, so
8445 -- that ASIS will not ignore it.
8447 Set_Comes_From_Source (N, True);
8448 end Replace_Type_Reference;
8452 Asp : constant Node_Id := Corresponding_Aspect (Prag);
8456 -- Start of processing for Add_Predicate
8459 -- Mark corresponding SCO as enabled
8461 Set_SCO_Pragma_Enabled (Sloc (Prag));
8463 -- Extract the arguments of the pragma. The expression itself
8464 -- is copied for use in the predicate function, to preserve the
8465 -- original version for ASIS use.
8467 Arg1 := First (Pragma_Argument_Associations (Prag));
8468 Arg2 := Next (Arg1);
8470 Arg1 := Get_Pragma_Arg (Arg1);
8471 Arg2 := New_Copy_Tree (Get_Pragma_Arg (Arg2));
8473 -- When the predicate pragma applies to the current type or its
8474 -- full view, replace all occurrences of the subtype name with
8475 -- references to the formal parameter of the predicate function.
8477 if Entity (Arg1) = Typ
8478 or else Full_View (Entity (Arg1)) = Typ
8480 Replace_Type_References (Arg2, Typ);
8482 -- If the predicate pragma comes from an aspect, replace the
8483 -- saved expression because we need the subtype references
8484 -- replaced for the calls to Preanalyze_Spec_Expression in
8485 -- Check_Aspect_At_xxx routines.
8487 if Present (Asp) then
8488 Set_Entity (Identifier (Asp), New_Copy_Tree (Arg2));
8491 -- "and"-in the Arg2 condition to evolving expression
8493 Add_Condition (Relocate_Node (Arg2));
8501 -- Start of processing for Add_Predicates
8504 Ritem := First_Rep_Item (Typ);
8506 -- If the type is private, check whether full view has inherited
8509 if Is_Private_Type (Typ) and then No (Ritem) then
8510 Ritem := First_Rep_Item (Full_View (Typ));
8513 while Present (Ritem) loop
8514 if Nkind (Ritem) = N_Pragma
8515 and then Pragma_Name (Ritem) = Name_Predicate
8517 Add_Predicate (Ritem);
8519 -- If the type is declared in an inner package it may be frozen
8520 -- outside of the package, and the generated pragma has not been
8521 -- analyzed yet, so capture the expression for the predicate
8522 -- function at this point.
8524 elsif Nkind (Ritem) = N_Aspect_Specification
8525 and then Present (Aspect_Rep_Item (Ritem))
8526 and then Scope (Typ) /= Current_Scope
8529 Prag : constant Node_Id := Aspect_Rep_Item (Ritem);
8532 if Nkind (Prag) = N_Pragma
8533 and then Pragma_Name (Prag) = Name_Predicate
8535 Add_Predicate (Prag);
8540 Next_Rep_Item (Ritem);
8548 function Process_RE (N : Node_Id) return Traverse_Result is
8550 if Nkind (N) = N_Raise_Expression then
8551 Set_Convert_To_Return_False (N);
8562 function Test_RE (N : Node_Id) return Traverse_Result is
8564 if Nkind (N) = N_Raise_Expression then
8565 Raise_Expression_Present := True;
8574 Saved_GM : constant Ghost_Mode_Type := Ghost_Mode;
8575 -- Save the Ghost mode to restore on exit
8577 -- Start of processing for Build_Predicate_Functions
8580 -- Return if already built or if type does not have predicates
8582 SId := Predicate_Function (Typ);
8583 if not Has_Predicates (Typ)
8584 or else (Present (SId) and then Has_Completion (SId))
8589 -- The related type may be subject to pragma Ghost. Set the mode now to
8590 -- ensure that the predicate functions are properly marked as Ghost.
8592 Set_Ghost_Mode (Typ);
8594 -- Prepare to construct predicate expression
8598 if Present (SId) then
8599 FDecl := Unit_Declaration_Node (SId);
8602 FDecl := Build_Predicate_Function_Declaration (Typ);
8603 SId := Defining_Entity (FDecl);
8606 -- Recover name of formal parameter of function that replaces references
8607 -- to the type in predicate expressions.
8611 (First (Parameter_Specifications (Specification (FDecl))));
8613 Object_Name := Chars (Object_Entity);
8614 Object_Entity_M := Make_Defining_Identifier (Loc, Chars => Object_Name);
8616 -- Add predicates for ancestor if present. These must come before the
8617 -- ones for the current type, as required by AI12-0071-1.
8622 Atyp := Nearest_Ancestor (Typ);
8624 -- The type may be private but the full view may inherit predicates
8626 if No (Atyp) and then Is_Private_Type (Typ) then
8627 Atyp := Nearest_Ancestor (Full_View (Typ));
8630 if Present (Atyp) then
8635 -- Add Predicates for the current type
8639 -- Case where predicates are present
8641 if Present (Expr) then
8643 -- Test for raise expression present
8647 -- If raise expression is present, capture a copy of Expr for use
8648 -- in building the predicateM function version later on. For this
8649 -- copy we replace references to Object_Entity by Object_Entity_M.
8651 if Raise_Expression_Present then
8653 Map : constant Elist_Id := New_Elmt_List;
8654 New_V : Entity_Id := Empty;
8656 -- The unanalyzed expression will be copied and appear in
8657 -- both functions. Normally expressions do not declare new
8658 -- entities, but quantified expressions do, so we need to
8659 -- create new entities for their bound variables, to prevent
8660 -- multiple definitions in gigi.
8662 function Reset_Loop_Variable (N : Node_Id)
8663 return Traverse_Result;
8665 procedure Collect_Loop_Variables is
8666 new Traverse_Proc (Reset_Loop_Variable);
8668 ------------------------
8669 -- Reset_Loop_Variable --
8670 ------------------------
8672 function Reset_Loop_Variable (N : Node_Id)
8673 return Traverse_Result
8676 if Nkind (N) = N_Iterator_Specification then
8677 New_V := Make_Defining_Identifier
8678 (Sloc (N), Chars (Defining_Identifier (N)));
8680 Set_Defining_Identifier (N, New_V);
8684 end Reset_Loop_Variable;
8687 Append_Elmt (Object_Entity, Map);
8688 Append_Elmt (Object_Entity_M, Map);
8689 Expr_M := New_Copy_Tree (Expr, Map => Map);
8690 Collect_Loop_Variables (Expr_M);
8694 -- Build the main predicate function
8697 SIdB : constant Entity_Id :=
8698 Make_Defining_Identifier (Loc,
8699 Chars => New_External_Name (Chars (Typ), "Predicate"));
8700 -- The entity for the function body
8706 -- The predicate function is shared between views of a type
8708 if Is_Private_Type (Typ) and then Present (Full_View (Typ)) then
8709 Set_Predicate_Function (Full_View (Typ), SId);
8712 -- Build function body
8715 Make_Function_Specification (Loc,
8716 Defining_Unit_Name => SIdB,
8717 Parameter_Specifications => New_List (
8718 Make_Parameter_Specification (Loc,
8719 Defining_Identifier =>
8720 Make_Defining_Identifier (Loc, Object_Name),
8722 New_Occurrence_Of (Typ, Loc))),
8723 Result_Definition =>
8724 New_Occurrence_Of (Standard_Boolean, Loc));
8727 Make_Subprogram_Body (Loc,
8728 Specification => Spec,
8729 Declarations => Empty_List,
8730 Handled_Statement_Sequence =>
8731 Make_Handled_Sequence_Of_Statements (Loc,
8732 Statements => New_List (
8733 Make_Simple_Return_Statement (Loc,
8734 Expression => Expr))));
8736 -- If declaration has not been analyzed yet, Insert declaration
8737 -- before freeze node. Insert body itself after freeze node.
8739 if not Analyzed (FDecl) then
8740 Insert_Before_And_Analyze (N, FDecl);
8743 Insert_After_And_Analyze (N, FBody);
8745 -- Static predicate functions are always side-effect free, and
8746 -- in most cases dynamic predicate functions are as well. Mark
8747 -- them as such whenever possible, so redundant predicate checks
8748 -- can be optimized. If there is a variable reference within the
8749 -- expression, the function is not pure.
8751 if Expander_Active then
8753 Side_Effect_Free (Expr, Variable_Ref => True));
8754 Set_Is_Inlined (SId);
8758 -- Test for raise expressions present and if so build M version
8760 if Raise_Expression_Present then
8762 SId : constant Entity_Id :=
8763 Make_Defining_Identifier (Loc,
8764 Chars => New_External_Name (Chars (Typ), "PredicateM"));
8765 -- The entity for the function spec
8767 SIdB : constant Entity_Id :=
8768 Make_Defining_Identifier (Loc,
8769 Chars => New_External_Name (Chars (Typ), "PredicateM"));
8770 -- The entity for the function body
8778 -- Mark any raise expressions for special expansion
8780 Process_REs (Expr_M);
8782 -- Build function declaration
8784 Set_Ekind (SId, E_Function);
8785 Set_Is_Predicate_Function_M (SId);
8786 Set_Predicate_Function_M (Typ, SId);
8788 -- The predicate function is shared between views of a type
8790 if Is_Private_Type (Typ) and then Present (Full_View (Typ)) then
8791 Set_Predicate_Function_M (Full_View (Typ), SId);
8795 Make_Function_Specification (Loc,
8796 Defining_Unit_Name => SId,
8797 Parameter_Specifications => New_List (
8798 Make_Parameter_Specification (Loc,
8799 Defining_Identifier => Object_Entity_M,
8800 Parameter_Type => New_Occurrence_Of (Typ, Loc))),
8801 Result_Definition =>
8802 New_Occurrence_Of (Standard_Boolean, Loc));
8805 Make_Subprogram_Declaration (Loc,
8806 Specification => Spec);
8808 -- Build function body
8811 Make_Function_Specification (Loc,
8812 Defining_Unit_Name => SIdB,
8813 Parameter_Specifications => New_List (
8814 Make_Parameter_Specification (Loc,
8815 Defining_Identifier =>
8816 Make_Defining_Identifier (Loc, Object_Name),
8818 New_Occurrence_Of (Typ, Loc))),
8819 Result_Definition =>
8820 New_Occurrence_Of (Standard_Boolean, Loc));
8822 -- Build the body, we declare the boolean expression before
8823 -- doing the return, because we are not really confident of
8824 -- what happens if a return appears within a return.
8827 Make_Defining_Identifier (Loc,
8828 Chars => New_Internal_Name ('B'));
8831 Make_Subprogram_Body (Loc,
8832 Specification => Spec,
8834 Declarations => New_List (
8835 Make_Object_Declaration (Loc,
8836 Defining_Identifier => BTemp,
8837 Constant_Present => True,
8838 Object_Definition =>
8839 New_Occurrence_Of (Standard_Boolean, Loc),
8840 Expression => Expr_M)),
8842 Handled_Statement_Sequence =>
8843 Make_Handled_Sequence_Of_Statements (Loc,
8844 Statements => New_List (
8845 Make_Simple_Return_Statement (Loc,
8846 Expression => New_Occurrence_Of (BTemp, Loc)))));
8848 -- Insert declaration before freeze node and body after
8850 Insert_Before_And_Analyze (N, FDecl);
8851 Insert_After_And_Analyze (N, FBody);
8855 -- See if we have a static predicate. Note that the answer may be
8856 -- yes even if we have an explicit Dynamic_Predicate present.
8863 if not Is_Scalar_Type (Typ) and then not Is_String_Type (Typ) then
8866 PS := Is_Predicate_Static (Expr, Object_Name);
8869 -- Case where we have a predicate-static aspect
8873 -- We don't set Has_Static_Predicate_Aspect, since we can have
8874 -- any of the three cases (Predicate, Dynamic_Predicate, or
8875 -- Static_Predicate) generating a predicate with an expression
8876 -- that is predicate-static. We just indicate that we have a
8877 -- predicate that can be treated as static.
8879 Set_Has_Static_Predicate (Typ);
8881 -- For discrete subtype, build the static predicate list
8883 if Is_Discrete_Type (Typ) then
8884 Build_Discrete_Static_Predicate (Typ, Expr, Object_Name);
8886 -- If we don't get a static predicate list, it means that we
8887 -- have a case where this is not possible, most typically in
8888 -- the case where we inherit a dynamic predicate. We do not
8889 -- consider this an error, we just leave the predicate as
8890 -- dynamic. But if we do succeed in building the list, then
8891 -- we mark the predicate as static.
8893 if No (Static_Discrete_Predicate (Typ)) then
8894 Set_Has_Static_Predicate (Typ, False);
8897 -- For real or string subtype, save predicate expression
8899 elsif Is_Real_Type (Typ) or else Is_String_Type (Typ) then
8900 Set_Static_Real_Or_String_Predicate (Typ, Expr);
8903 -- Case of dynamic predicate (expression is not predicate-static)
8906 -- Again, we don't set Has_Dynamic_Predicate_Aspect, since that
8907 -- is only set if we have an explicit Dynamic_Predicate aspect
8908 -- given. Here we may simply have a Predicate aspect where the
8909 -- expression happens not to be predicate-static.
8911 -- Emit an error when the predicate is categorized as static
8912 -- but its expression is not predicate-static.
8914 -- First a little fiddling to get a nice location for the
8915 -- message. If the expression is of the form (A and then B),
8916 -- where A is an inherited predicate, then use the right
8917 -- operand for the Sloc. This avoids getting confused by a call
8918 -- to an inherited predicate with a less convenient source
8922 while Nkind (EN) = N_And_Then
8923 and then Nkind (Left_Opnd (EN)) = N_Function_Call
8924 and then Is_Predicate_Function
8925 (Entity (Name (Left_Opnd (EN))))
8927 EN := Right_Opnd (EN);
8930 -- Now post appropriate message
8932 if Has_Static_Predicate_Aspect (Typ) then
8933 if Is_Scalar_Type (Typ) or else Is_String_Type (Typ) then
8935 ("expression is not predicate-static (RM 3.2.4(16-22))",
8939 ("static predicate requires scalar or string type", EN);
8946 Restore_Ghost_Mode (Saved_GM);
8947 end Build_Predicate_Functions;
8949 ------------------------------------------
8950 -- Build_Predicate_Function_Declaration --
8951 ------------------------------------------
8953 -- WARNING: This routine manages Ghost regions. Return statements must be
8954 -- replaced by gotos which jump to the end of the routine and restore the
8957 function Build_Predicate_Function_Declaration
8958 (Typ : Entity_Id) return Node_Id
8960 Loc : constant Source_Ptr := Sloc (Typ);
8962 Saved_GM : constant Ghost_Mode_Type := Ghost_Mode;
8963 -- Save the Ghost mode to restore on exit
8965 Func_Decl : Node_Id;
8966 Func_Id : Entity_Id;
8970 -- The related type may be subject to pragma Ghost. Set the mode now to
8971 -- ensure that the predicate functions are properly marked as Ghost.
8973 Set_Ghost_Mode (Typ);
8976 Make_Defining_Identifier (Loc,
8977 Chars => New_External_Name (Chars (Typ), "Predicate"));
8979 -- The predicate function requires debug info when the predicates are
8980 -- subject to Source Coverage Obligations.
8982 if Opt.Generate_SCO then
8983 Set_Debug_Info_Needed (Func_Id);
8987 Make_Function_Specification (Loc,
8988 Defining_Unit_Name => Func_Id,
8989 Parameter_Specifications => New_List (
8990 Make_Parameter_Specification (Loc,
8991 Defining_Identifier => Make_Temporary (Loc, 'I'),
8992 Parameter_Type => New_Occurrence_Of (Typ, Loc))),
8993 Result_Definition =>
8994 New_Occurrence_Of (Standard_Boolean, Loc));
8996 Func_Decl := Make_Subprogram_Declaration (Loc, Specification => Spec);
8998 Set_Ekind (Func_Id, E_Function);
8999 Set_Etype (Func_Id, Standard_Boolean);
9000 Set_Is_Internal (Func_Id);
9001 Set_Is_Predicate_Function (Func_Id);
9002 Set_Predicate_Function (Typ, Func_Id);
9004 Insert_After (Parent (Typ), Func_Decl);
9005 Analyze (Func_Decl);
9007 Restore_Ghost_Mode (Saved_GM);
9010 end Build_Predicate_Function_Declaration;
9012 -----------------------------------------
9013 -- Check_Aspect_At_End_Of_Declarations --
9014 -----------------------------------------
9016 procedure Check_Aspect_At_End_Of_Declarations (ASN : Node_Id) is
9017 Ent : constant Entity_Id := Entity (ASN);
9018 Ident : constant Node_Id := Identifier (ASN);
9019 A_Id : constant Aspect_Id := Get_Aspect_Id (Chars (Ident));
9021 End_Decl_Expr : constant Node_Id := Entity (Ident);
9022 -- Expression to be analyzed at end of declarations
9024 Freeze_Expr : constant Node_Id := Expression (ASN);
9025 -- Expression from call to Check_Aspect_At_Freeze_Point.
9027 T : constant Entity_Id := Etype (Original_Node (Freeze_Expr));
9028 -- Type required for preanalyze call. We use the original expression to
9029 -- get the proper type, to prevent cascaded errors when the expression
9030 -- is constant-folded.
9033 -- Set False if error
9035 -- On entry to this procedure, Entity (Ident) contains a copy of the
9036 -- original expression from the aspect, saved for this purpose, and
9037 -- but Expression (Ident) is a preanalyzed copy of the expression,
9038 -- preanalyzed just after the freeze point.
9040 procedure Check_Overloaded_Name;
9041 -- For aspects whose expression is simply a name, this routine checks if
9042 -- the name is overloaded or not. If so, it verifies there is an
9043 -- interpretation that matches the entity obtained at the freeze point,
9044 -- otherwise the compiler complains.
9046 ---------------------------
9047 -- Check_Overloaded_Name --
9048 ---------------------------
9050 procedure Check_Overloaded_Name is
9052 if not Is_Overloaded (End_Decl_Expr) then
9053 Err := not Is_Entity_Name (End_Decl_Expr)
9054 or else Entity (End_Decl_Expr) /= Entity (Freeze_Expr);
9060 Index : Interp_Index;
9064 Get_First_Interp (End_Decl_Expr, Index, It);
9065 while Present (It.Typ) loop
9066 if It.Nam = Entity (Freeze_Expr) then
9071 Get_Next_Interp (Index, It);
9075 end Check_Overloaded_Name;
9077 -- Start of processing for Check_Aspect_At_End_Of_Declarations
9080 -- In an instance we do not perform the consistency check between freeze
9081 -- point and end of declarations, because it was done already in the
9082 -- analysis of the generic. Furthermore, the delayed analysis of an
9083 -- aspect of the instance may produce spurious errors when the generic
9084 -- is a child unit that references entities in the parent (which might
9085 -- not be in scope at the freeze point of the instance).
9090 -- The enclosing scope may have been rewritten during expansion (.e.g.
9091 -- a task body is rewritten as a procedure) after this conformance check
9092 -- has been performed, so do not perform it again (it may not easily
9093 -- be done if full visibility of local entities is not available).
9095 elsif not Comes_From_Source (Current_Scope) then
9098 -- Case of aspects Dimension, Dimension_System and Synchronization
9100 elsif A_Id = Aspect_Synchronization then
9103 -- Case of stream attributes, just have to compare entities. However,
9104 -- the expression is just a name (possibly overloaded), and there may
9105 -- be stream operations declared for unrelated types, so we just need
9106 -- to verify that one of these interpretations is the one available at
9107 -- at the freeze point.
9109 elsif A_Id = Aspect_Input or else
9110 A_Id = Aspect_Output or else
9111 A_Id = Aspect_Read or else
9114 Analyze (End_Decl_Expr);
9115 Check_Overloaded_Name;
9117 elsif A_Id = Aspect_Variable_Indexing or else
9118 A_Id = Aspect_Constant_Indexing or else
9119 A_Id = Aspect_Default_Iterator or else
9120 A_Id = Aspect_Iterator_Element
9122 -- Make type unfrozen before analysis, to prevent spurious errors
9123 -- about late attributes.
9125 Set_Is_Frozen (Ent, False);
9126 Analyze (End_Decl_Expr);
9127 Set_Is_Frozen (Ent, True);
9129 -- If the end of declarations comes before any other freeze
9130 -- point, the Freeze_Expr is not analyzed: no check needed.
9132 if Analyzed (Freeze_Expr) and then not In_Instance then
9133 Check_Overloaded_Name;
9141 -- Indicate that the expression comes from an aspect specification,
9142 -- which is used in subsequent analysis even if expansion is off.
9144 Set_Parent (End_Decl_Expr, ASN);
9146 -- In a generic context the aspect expressions have not been
9147 -- preanalyzed, so do it now. There are no conformance checks
9148 -- to perform in this case.
9151 Check_Aspect_At_Freeze_Point (ASN);
9154 -- The default values attributes may be defined in the private part,
9155 -- and the analysis of the expression may take place when only the
9156 -- partial view is visible. The expression must be scalar, so use
9157 -- the full view to resolve.
9159 elsif (A_Id = Aspect_Default_Value
9161 A_Id = Aspect_Default_Component_Value)
9162 and then Is_Private_Type (T)
9164 Preanalyze_Spec_Expression (End_Decl_Expr, Full_View (T));
9167 Preanalyze_Spec_Expression (End_Decl_Expr, T);
9170 Err := not Fully_Conformant_Expressions (End_Decl_Expr, Freeze_Expr);
9173 -- Output error message if error. Force error on aspect specification
9174 -- even if there is an error on the expression itself.
9178 ("!visibility of aspect for& changes after freeze point",
9181 ("info: & is frozen here, aspects evaluated at this point??",
9182 Freeze_Node (Ent), Ent);
9184 end Check_Aspect_At_End_Of_Declarations;
9186 ----------------------------------
9187 -- Check_Aspect_At_Freeze_Point --
9188 ----------------------------------
9190 procedure Check_Aspect_At_Freeze_Point (ASN : Node_Id) is
9191 Ident : constant Node_Id := Identifier (ASN);
9192 -- Identifier (use Entity field to save expression)
9194 A_Id : constant Aspect_Id := Get_Aspect_Id (Chars (Ident));
9196 T : Entity_Id := Empty;
9197 -- Type required for preanalyze call
9200 -- On entry to this procedure, Entity (Ident) contains a copy of the
9201 -- original expression from the aspect, saved for this purpose.
9203 -- On exit from this procedure Entity (Ident) is unchanged, still
9204 -- containing that copy, but Expression (Ident) is a preanalyzed copy
9205 -- of the expression, preanalyzed just after the freeze point.
9207 -- Make a copy of the expression to be preanalyzed
9209 Set_Expression (ASN, New_Copy_Tree (Entity (Ident)));
9211 -- Find type for preanalyze call
9215 -- No_Aspect should be impossible
9218 raise Program_Error;
9220 -- Aspects taking an optional boolean argument
9222 when Boolean_Aspects
9223 | Library_Unit_Aspects
9225 T := Standard_Boolean;
9227 -- Aspects corresponding to attribute definition clauses
9229 when Aspect_Address =>
9230 T := RTE (RE_Address);
9232 when Aspect_Attach_Handler =>
9233 T := RTE (RE_Interrupt_ID);
9235 when Aspect_Bit_Order
9236 | Aspect_Scalar_Storage_Order
9238 T := RTE (RE_Bit_Order);
9240 when Aspect_Convention =>
9244 T := RTE (RE_CPU_Range);
9246 -- Default_Component_Value is resolved with the component type
9248 when Aspect_Default_Component_Value =>
9249 T := Component_Type (Entity (ASN));
9251 when Aspect_Default_Storage_Pool =>
9252 T := Class_Wide_Type (RTE (RE_Root_Storage_Pool));
9254 -- Default_Value is resolved with the type entity in question
9256 when Aspect_Default_Value =>
9259 when Aspect_Dispatching_Domain =>
9260 T := RTE (RE_Dispatching_Domain);
9262 when Aspect_External_Tag =>
9263 T := Standard_String;
9265 when Aspect_External_Name =>
9266 T := Standard_String;
9268 when Aspect_Link_Name =>
9269 T := Standard_String;
9271 when Aspect_Interrupt_Priority
9274 T := Standard_Integer;
9276 when Aspect_Relative_Deadline =>
9277 T := RTE (RE_Time_Span);
9279 when Aspect_Secondary_Stack_Size =>
9280 T := Standard_Integer;
9282 when Aspect_Small =>
9283 T := Universal_Real;
9285 -- For a simple storage pool, we have to retrieve the type of the
9286 -- pool object associated with the aspect's corresponding attribute
9287 -- definition clause.
9289 when Aspect_Simple_Storage_Pool =>
9290 T := Etype (Expression (Aspect_Rep_Item (ASN)));
9292 when Aspect_Storage_Pool =>
9293 T := Class_Wide_Type (RTE (RE_Root_Storage_Pool));
9295 when Aspect_Alignment
9296 | Aspect_Component_Size
9297 | Aspect_Machine_Radix
9298 | Aspect_Object_Size
9300 | Aspect_Storage_Size
9301 | Aspect_Stream_Size
9306 when Aspect_Linker_Section =>
9307 T := Standard_String;
9309 when Aspect_Synchronization =>
9312 -- Special case, the expression of these aspects is just an entity
9313 -- that does not need any resolution, so just analyze.
9323 Analyze (Expression (ASN));
9326 -- Same for Iterator aspects, where the expression is a function
9327 -- name. Legality rules are checked separately.
9329 when Aspect_Constant_Indexing
9330 | Aspect_Default_Iterator
9331 | Aspect_Iterator_Element
9332 | Aspect_Variable_Indexing
9334 Analyze (Expression (ASN));
9337 -- Ditto for Iterable, legality checks in Validate_Iterable_Aspect.
9339 when Aspect_Iterable =>
9343 Cursor : constant Entity_Id := Get_Cursor_Type (ASN, T);
9348 if Cursor = Any_Type then
9352 Assoc := First (Component_Associations (Expression (ASN)));
9353 while Present (Assoc) loop
9354 Expr := Expression (Assoc);
9357 if not Error_Posted (Expr) then
9358 Resolve_Iterable_Operation
9359 (Expr, Cursor, T, Chars (First (Choices (Assoc))));
9368 -- Invariant/Predicate take boolean expressions
9370 when Aspect_Dynamic_Predicate
9373 | Aspect_Static_Predicate
9374 | Aspect_Type_Invariant
9376 T := Standard_Boolean;
9378 when Aspect_Predicate_Failure =>
9379 T := Standard_String;
9381 -- Here is the list of aspects that don't require delay analysis
9383 when Aspect_Abstract_State
9385 | Aspect_Async_Readers
9386 | Aspect_Async_Writers
9387 | Aspect_Constant_After_Elaboration
9388 | Aspect_Contract_Cases
9389 | Aspect_Default_Initial_Condition
9392 | Aspect_Dimension_System
9393 | Aspect_Effective_Reads
9394 | Aspect_Effective_Writes
9395 | Aspect_Extensions_Visible
9398 | Aspect_Implicit_Dereference
9399 | Aspect_Initial_Condition
9400 | Aspect_Initializes
9401 | Aspect_Max_Queue_Length
9402 | Aspect_Obsolescent
9405 | Aspect_Postcondition
9407 | Aspect_Precondition
9408 | Aspect_Refined_Depends
9409 | Aspect_Refined_Global
9410 | Aspect_Refined_Post
9411 | Aspect_Refined_State
9414 | Aspect_Unimplemented
9415 | Aspect_Volatile_Function
9417 raise Program_Error;
9421 -- Do the preanalyze call
9423 Preanalyze_Spec_Expression (Expression (ASN), T);
9424 end Check_Aspect_At_Freeze_Point;
9426 -----------------------------------
9427 -- Check_Constant_Address_Clause --
9428 -----------------------------------
9430 procedure Check_Constant_Address_Clause
9434 procedure Check_At_Constant_Address (Nod : Node_Id);
9435 -- Checks that the given node N represents a name whose 'Address is
9436 -- constant (in the same sense as OK_Constant_Address_Clause, i.e. the
9437 -- address value is the same at the point of declaration of U_Ent and at
9438 -- the time of elaboration of the address clause.
9440 procedure Check_Expr_Constants (Nod : Node_Id);
9441 -- Checks that Nod meets the requirements for a constant address clause
9442 -- in the sense of the enclosing procedure.
9444 procedure Check_List_Constants (Lst : List_Id);
9445 -- Check that all elements of list Lst meet the requirements for a
9446 -- constant address clause in the sense of the enclosing procedure.
9448 -------------------------------
9449 -- Check_At_Constant_Address --
9450 -------------------------------
9452 procedure Check_At_Constant_Address (Nod : Node_Id) is
9454 if Is_Entity_Name (Nod) then
9455 if Present (Address_Clause (Entity ((Nod)))) then
9457 ("invalid address clause for initialized object &!",
9460 ("address for& cannot depend on another address clause! "
9461 & "(RM 13.1(22))!", Nod, U_Ent);
9463 elsif In_Same_Source_Unit (Entity (Nod), U_Ent)
9464 and then Sloc (U_Ent) < Sloc (Entity (Nod))
9467 ("invalid address clause for initialized object &!",
9469 Error_Msg_Node_2 := U_Ent;
9471 ("\& must be defined before & (RM 13.1(22))!",
9475 elsif Nkind (Nod) = N_Selected_Component then
9477 T : constant Entity_Id := Etype (Prefix (Nod));
9480 if (Is_Record_Type (T)
9481 and then Has_Discriminants (T))
9484 and then Is_Record_Type (Designated_Type (T))
9485 and then Has_Discriminants (Designated_Type (T)))
9488 ("invalid address clause for initialized object &!",
9491 ("\address cannot depend on component of discriminated "
9492 & "record (RM 13.1(22))!", Nod);
9494 Check_At_Constant_Address (Prefix (Nod));
9498 elsif Nkind (Nod) = N_Indexed_Component then
9499 Check_At_Constant_Address (Prefix (Nod));
9500 Check_List_Constants (Expressions (Nod));
9503 Check_Expr_Constants (Nod);
9505 end Check_At_Constant_Address;
9507 --------------------------
9508 -- Check_Expr_Constants --
9509 --------------------------
9511 procedure Check_Expr_Constants (Nod : Node_Id) is
9512 Loc_U_Ent : constant Source_Ptr := Sloc (U_Ent);
9513 Ent : Entity_Id := Empty;
9516 if Nkind (Nod) in N_Has_Etype
9517 and then Etype (Nod) = Any_Type
9528 when N_Expanded_Name
9531 Ent := Entity (Nod);
9533 -- We need to look at the original node if it is different
9534 -- from the node, since we may have rewritten things and
9535 -- substituted an identifier representing the rewrite.
9537 if Original_Node (Nod) /= Nod then
9538 Check_Expr_Constants (Original_Node (Nod));
9540 -- If the node is an object declaration without initial
9541 -- value, some code has been expanded, and the expression
9542 -- is not constant, even if the constituents might be
9543 -- acceptable, as in A'Address + offset.
9545 if Ekind (Ent) = E_Variable
9547 Nkind (Declaration_Node (Ent)) = N_Object_Declaration
9549 No (Expression (Declaration_Node (Ent)))
9552 ("invalid address clause for initialized object &!",
9555 -- If entity is constant, it may be the result of expanding
9556 -- a check. We must verify that its declaration appears
9557 -- before the object in question, else we also reject the
9560 elsif Ekind (Ent) = E_Constant
9561 and then In_Same_Source_Unit (Ent, U_Ent)
9562 and then Sloc (Ent) > Loc_U_Ent
9565 ("invalid address clause for initialized object &!",
9572 -- Otherwise look at the identifier and see if it is OK
9574 if Ekind_In (Ent, E_Named_Integer, E_Named_Real)
9575 or else Is_Type (Ent)
9579 elsif Ekind_In (Ent, E_Constant, E_In_Parameter) then
9581 -- This is the case where we must have Ent defined before
9582 -- U_Ent. Clearly if they are in different units this
9583 -- requirement is met since the unit containing Ent is
9584 -- already processed.
9586 if not In_Same_Source_Unit (Ent, U_Ent) then
9589 -- Otherwise location of Ent must be before the location
9590 -- of U_Ent, that's what prior defined means.
9592 elsif Sloc (Ent) < Loc_U_Ent then
9597 ("invalid address clause for initialized object &!",
9599 Error_Msg_Node_2 := U_Ent;
9601 ("\& must be defined before & (RM 13.1(22))!",
9605 elsif Nkind (Original_Node (Nod)) = N_Function_Call then
9606 Check_Expr_Constants (Original_Node (Nod));
9610 ("invalid address clause for initialized object &!",
9613 if Comes_From_Source (Ent) then
9615 ("\reference to variable& not allowed"
9616 & " (RM 13.1(22))!", Nod, Ent);
9619 ("non-static expression not allowed"
9620 & " (RM 13.1(22))!", Nod);
9624 when N_Integer_Literal =>
9626 -- If this is a rewritten unchecked conversion, in a system
9627 -- where Address is an integer type, always use the base type
9628 -- for a literal value. This is user-friendly and prevents
9629 -- order-of-elaboration issues with instances of unchecked
9632 if Nkind (Original_Node (Nod)) = N_Function_Call then
9633 Set_Etype (Nod, Base_Type (Etype (Nod)));
9636 when N_Character_Literal
9643 Check_Expr_Constants (Low_Bound (Nod));
9644 Check_Expr_Constants (High_Bound (Nod));
9646 when N_Explicit_Dereference =>
9647 Check_Expr_Constants (Prefix (Nod));
9649 when N_Indexed_Component =>
9650 Check_Expr_Constants (Prefix (Nod));
9651 Check_List_Constants (Expressions (Nod));
9654 Check_Expr_Constants (Prefix (Nod));
9655 Check_Expr_Constants (Discrete_Range (Nod));
9657 when N_Selected_Component =>
9658 Check_Expr_Constants (Prefix (Nod));
9660 when N_Attribute_Reference =>
9661 if Nam_In (Attribute_Name (Nod), Name_Address,
9663 Name_Unchecked_Access,
9664 Name_Unrestricted_Access)
9666 Check_At_Constant_Address (Prefix (Nod));
9669 Check_Expr_Constants (Prefix (Nod));
9670 Check_List_Constants (Expressions (Nod));
9674 Check_List_Constants (Component_Associations (Nod));
9675 Check_List_Constants (Expressions (Nod));
9677 when N_Component_Association =>
9678 Check_Expr_Constants (Expression (Nod));
9680 when N_Extension_Aggregate =>
9681 Check_Expr_Constants (Ancestor_Part (Nod));
9682 Check_List_Constants (Component_Associations (Nod));
9683 Check_List_Constants (Expressions (Nod));
9692 Check_Expr_Constants (Left_Opnd (Nod));
9693 Check_Expr_Constants (Right_Opnd (Nod));
9696 Check_Expr_Constants (Right_Opnd (Nod));
9699 | N_Qualified_Expression
9701 | N_Unchecked_Type_Conversion
9703 Check_Expr_Constants (Expression (Nod));
9705 when N_Function_Call =>
9706 if not Is_Pure (Entity (Name (Nod))) then
9708 ("invalid address clause for initialized object &!",
9712 ("\function & is not pure (RM 13.1(22))!",
9713 Nod, Entity (Name (Nod)));
9716 Check_List_Constants (Parameter_Associations (Nod));
9719 when N_Parameter_Association =>
9720 Check_Expr_Constants (Explicit_Actual_Parameter (Nod));
9724 ("invalid address clause for initialized object &!",
9727 ("\must be constant defined before& (RM 13.1(22))!",
9730 end Check_Expr_Constants;
9732 --------------------------
9733 -- Check_List_Constants --
9734 --------------------------
9736 procedure Check_List_Constants (Lst : List_Id) is
9740 if Present (Lst) then
9741 Nod1 := First (Lst);
9742 while Present (Nod1) loop
9743 Check_Expr_Constants (Nod1);
9747 end Check_List_Constants;
9749 -- Start of processing for Check_Constant_Address_Clause
9752 -- If rep_clauses are to be ignored, no need for legality checks. In
9753 -- particular, no need to pester user about rep clauses that violate the
9754 -- rule on constant addresses, given that these clauses will be removed
9755 -- by Freeze before they reach the back end. Similarly in CodePeer mode,
9756 -- we want to relax these checks.
9758 if not Ignore_Rep_Clauses and not CodePeer_Mode then
9759 Check_Expr_Constants (Expr);
9761 end Check_Constant_Address_Clause;
9763 ---------------------------
9764 -- Check_Pool_Size_Clash --
9765 ---------------------------
9767 procedure Check_Pool_Size_Clash (Ent : Entity_Id; SP, SS : Node_Id) is
9771 -- We need to find out which one came first. Note that in the case of
9772 -- aspects mixed with pragmas there are cases where the processing order
9773 -- is reversed, which is why we do the check here.
9775 if Sloc (SP) < Sloc (SS) then
9776 Error_Msg_Sloc := Sloc (SP);
9778 Error_Msg_NE ("Storage_Pool previously given for&#", Post, Ent);
9781 Error_Msg_Sloc := Sloc (SS);
9783 Error_Msg_NE ("Storage_Size previously given for&#", Post, Ent);
9787 ("\cannot have Storage_Size and Storage_Pool (RM 13.11(3))", Post);
9788 end Check_Pool_Size_Clash;
9790 ----------------------------------------
9791 -- Check_Record_Representation_Clause --
9792 ----------------------------------------
9794 procedure Check_Record_Representation_Clause (N : Node_Id) is
9795 Loc : constant Source_Ptr := Sloc (N);
9796 Ident : constant Node_Id := Identifier (N);
9797 Rectype : Entity_Id;
9802 Hbit : Uint := Uint_0;
9806 Max_Bit_So_Far : Uint;
9807 -- Records the maximum bit position so far. If all field positions
9808 -- are monotonically increasing, then we can skip the circuit for
9809 -- checking for overlap, since no overlap is possible.
9811 Tagged_Parent : Entity_Id := Empty;
9812 -- This is set in the case of a derived tagged type for which we have
9813 -- Is_Fully_Repped_Tagged_Type True (indicating that all components are
9814 -- positioned by record representation clauses). In this case we must
9815 -- check for overlap between components of this tagged type, and the
9816 -- components of its parent. Tagged_Parent will point to this parent
9817 -- type. For all other cases Tagged_Parent is left set to Empty.
9819 Parent_Last_Bit : Uint;
9820 -- Relevant only if Tagged_Parent is set, Parent_Last_Bit indicates the
9821 -- last bit position for any field in the parent type. We only need to
9822 -- check overlap for fields starting below this point.
9824 Overlap_Check_Required : Boolean;
9825 -- Used to keep track of whether or not an overlap check is required
9827 Overlap_Detected : Boolean := False;
9828 -- Set True if an overlap is detected
9830 Ccount : Natural := 0;
9831 -- Number of component clauses in record rep clause
9833 procedure Check_Component_Overlap (C1_Ent, C2_Ent : Entity_Id);
9834 -- Given two entities for record components or discriminants, checks
9835 -- if they have overlapping component clauses and issues errors if so.
9837 procedure Find_Component;
9838 -- Finds component entity corresponding to current component clause (in
9839 -- CC), and sets Comp to the entity, and Fbit/Lbit to the zero origin
9840 -- start/stop bits for the field. If there is no matching component or
9841 -- if the matching component does not have a component clause, then
9842 -- that's an error and Comp is set to Empty, but no error message is
9843 -- issued, since the message was already given. Comp is also set to
9844 -- Empty if the current "component clause" is in fact a pragma.
9846 -----------------------------
9847 -- Check_Component_Overlap --
9848 -----------------------------
9850 procedure Check_Component_Overlap (C1_Ent, C2_Ent : Entity_Id) is
9851 CC1 : constant Node_Id := Component_Clause (C1_Ent);
9852 CC2 : constant Node_Id := Component_Clause (C2_Ent);
9855 if Present (CC1) and then Present (CC2) then
9857 -- Exclude odd case where we have two tag components in the same
9858 -- record, both at location zero. This seems a bit strange, but
9859 -- it seems to happen in some circumstances, perhaps on an error.
9861 if Nam_In (Chars (C1_Ent), Name_uTag, Name_uTag) then
9865 -- Here we check if the two fields overlap
9868 S1 : constant Uint := Component_Bit_Offset (C1_Ent);
9869 S2 : constant Uint := Component_Bit_Offset (C2_Ent);
9870 E1 : constant Uint := S1 + Esize (C1_Ent);
9871 E2 : constant Uint := S2 + Esize (C2_Ent);
9874 if E2 <= S1 or else E1 <= S2 then
9877 Error_Msg_Node_2 := Component_Name (CC2);
9878 Error_Msg_Sloc := Sloc (Error_Msg_Node_2);
9879 Error_Msg_Node_1 := Component_Name (CC1);
9881 ("component& overlaps & #", Component_Name (CC1));
9882 Overlap_Detected := True;
9886 end Check_Component_Overlap;
9888 --------------------
9889 -- Find_Component --
9890 --------------------
9892 procedure Find_Component is
9894 procedure Search_Component (R : Entity_Id);
9895 -- Search components of R for a match. If found, Comp is set
9897 ----------------------
9898 -- Search_Component --
9899 ----------------------
9901 procedure Search_Component (R : Entity_Id) is
9903 Comp := First_Component_Or_Discriminant (R);
9904 while Present (Comp) loop
9906 -- Ignore error of attribute name for component name (we
9907 -- already gave an error message for this, so no need to
9910 if Nkind (Component_Name (CC)) = N_Attribute_Reference then
9913 exit when Chars (Comp) = Chars (Component_Name (CC));
9916 Next_Component_Or_Discriminant (Comp);
9918 end Search_Component;
9920 -- Start of processing for Find_Component
9923 -- Return with Comp set to Empty if we have a pragma
9925 if Nkind (CC) = N_Pragma then
9930 -- Search current record for matching component
9932 Search_Component (Rectype);
9934 -- If not found, maybe component of base type discriminant that is
9935 -- absent from statically constrained first subtype.
9938 Search_Component (Base_Type (Rectype));
9941 -- If no component, or the component does not reference the component
9942 -- clause in question, then there was some previous error for which
9943 -- we already gave a message, so just return with Comp Empty.
9945 if No (Comp) or else Component_Clause (Comp) /= CC then
9946 Check_Error_Detected;
9949 -- Normal case where we have a component clause
9952 Fbit := Component_Bit_Offset (Comp);
9953 Lbit := Fbit + Esize (Comp) - 1;
9957 -- Start of processing for Check_Record_Representation_Clause
9961 Rectype := Entity (Ident);
9963 if Rectype = Any_Type then
9966 Rectype := Underlying_Type (Rectype);
9969 -- See if we have a fully repped derived tagged type
9972 PS : constant Entity_Id := Parent_Subtype (Rectype);
9975 if Present (PS) and then Is_Fully_Repped_Tagged_Type (PS) then
9976 Tagged_Parent := PS;
9978 -- Find maximum bit of any component of the parent type
9980 Parent_Last_Bit := UI_From_Int (System_Address_Size - 1);
9981 Pcomp := First_Entity (Tagged_Parent);
9982 while Present (Pcomp) loop
9983 if Ekind_In (Pcomp, E_Discriminant, E_Component) then
9984 if Component_Bit_Offset (Pcomp) /= No_Uint
9985 and then Known_Static_Esize (Pcomp)
9990 Component_Bit_Offset (Pcomp) + Esize (Pcomp) - 1);
9994 -- Skip anonymous types generated for constrained array
9995 -- or record components.
10000 Next_Entity (Pcomp);
10005 -- All done if no component clauses
10007 CC := First (Component_Clauses (N));
10013 -- If a tag is present, then create a component clause that places it
10014 -- at the start of the record (otherwise gigi may place it after other
10015 -- fields that have rep clauses).
10017 Fent := First_Entity (Rectype);
10019 if Nkind (Fent) = N_Defining_Identifier
10020 and then Chars (Fent) = Name_uTag
10022 Set_Component_Bit_Offset (Fent, Uint_0);
10023 Set_Normalized_Position (Fent, Uint_0);
10024 Set_Normalized_First_Bit (Fent, Uint_0);
10025 Set_Normalized_Position_Max (Fent, Uint_0);
10026 Init_Esize (Fent, System_Address_Size);
10028 Set_Component_Clause (Fent,
10029 Make_Component_Clause (Loc,
10030 Component_Name => Make_Identifier (Loc, Name_uTag),
10032 Position => Make_Integer_Literal (Loc, Uint_0),
10033 First_Bit => Make_Integer_Literal (Loc, Uint_0),
10035 Make_Integer_Literal (Loc,
10036 UI_From_Int (System_Address_Size))));
10038 Ccount := Ccount + 1;
10041 Max_Bit_So_Far := Uint_Minus_1;
10042 Overlap_Check_Required := False;
10044 -- Process the component clauses
10046 while Present (CC) loop
10049 if Present (Comp) then
10050 Ccount := Ccount + 1;
10052 -- We need a full overlap check if record positions non-monotonic
10054 if Fbit <= Max_Bit_So_Far then
10055 Overlap_Check_Required := True;
10058 Max_Bit_So_Far := Lbit;
10060 -- Check bit position out of range of specified size
10062 if Has_Size_Clause (Rectype)
10063 and then RM_Size (Rectype) <= Lbit
10066 ("bit number out of range of specified size",
10069 -- Check for overlap with tag component
10072 if Is_Tagged_Type (Rectype)
10073 and then Fbit < System_Address_Size
10076 ("component overlaps tag field of&",
10077 Component_Name (CC), Rectype);
10078 Overlap_Detected := True;
10081 if Hbit < Lbit then
10086 -- Check parent overlap if component might overlap parent field
10088 if Present (Tagged_Parent) and then Fbit <= Parent_Last_Bit then
10089 Pcomp := First_Component_Or_Discriminant (Tagged_Parent);
10090 while Present (Pcomp) loop
10091 if not Is_Tag (Pcomp)
10092 and then Chars (Pcomp) /= Name_uParent
10094 Check_Component_Overlap (Comp, Pcomp);
10097 Next_Component_Or_Discriminant (Pcomp);
10105 -- Now that we have processed all the component clauses, check for
10106 -- overlap. We have to leave this till last, since the components can
10107 -- appear in any arbitrary order in the representation clause.
10109 -- We do not need this check if all specified ranges were monotonic,
10110 -- as recorded by Overlap_Check_Required being False at this stage.
10112 -- This first section checks if there are any overlapping entries at
10113 -- all. It does this by sorting all entries and then seeing if there are
10114 -- any overlaps. If there are none, then that is decisive, but if there
10115 -- are overlaps, they may still be OK (they may result from fields in
10116 -- different variants).
10118 if Overlap_Check_Required then
10119 Overlap_Check1 : declare
10121 OC_Fbit : array (0 .. Ccount) of Uint;
10122 -- First-bit values for component clauses, the value is the offset
10123 -- of the first bit of the field from start of record. The zero
10124 -- entry is for use in sorting.
10126 OC_Lbit : array (0 .. Ccount) of Uint;
10127 -- Last-bit values for component clauses, the value is the offset
10128 -- of the last bit of the field from start of record. The zero
10129 -- entry is for use in sorting.
10131 OC_Count : Natural := 0;
10132 -- Count of entries in OC_Fbit and OC_Lbit
10134 function OC_Lt (Op1, Op2 : Natural) return Boolean;
10135 -- Compare routine for Sort
10137 procedure OC_Move (From : Natural; To : Natural);
10138 -- Move routine for Sort
10140 package Sorting is new GNAT.Heap_Sort_G (OC_Move, OC_Lt);
10146 function OC_Lt (Op1, Op2 : Natural) return Boolean is
10148 return OC_Fbit (Op1) < OC_Fbit (Op2);
10155 procedure OC_Move (From : Natural; To : Natural) is
10157 OC_Fbit (To) := OC_Fbit (From);
10158 OC_Lbit (To) := OC_Lbit (From);
10161 -- Start of processing for Overlap_Check
10164 CC := First (Component_Clauses (N));
10165 while Present (CC) loop
10167 -- Exclude component clause already marked in error
10169 if not Error_Posted (CC) then
10172 if Present (Comp) then
10173 OC_Count := OC_Count + 1;
10174 OC_Fbit (OC_Count) := Fbit;
10175 OC_Lbit (OC_Count) := Lbit;
10182 Sorting.Sort (OC_Count);
10184 Overlap_Check_Required := False;
10185 for J in 1 .. OC_Count - 1 loop
10186 if OC_Lbit (J) >= OC_Fbit (J + 1) then
10187 Overlap_Check_Required := True;
10191 end Overlap_Check1;
10194 -- If Overlap_Check_Required is still True, then we have to do the full
10195 -- scale overlap check, since we have at least two fields that do
10196 -- overlap, and we need to know if that is OK since they are in
10197 -- different variant, or whether we have a definite problem.
10199 if Overlap_Check_Required then
10200 Overlap_Check2 : declare
10201 C1_Ent, C2_Ent : Entity_Id;
10202 -- Entities of components being checked for overlap
10205 -- Component_List node whose Component_Items are being checked
10208 -- Component declaration for component being checked
10211 C1_Ent := First_Entity (Base_Type (Rectype));
10213 -- Loop through all components in record. For each component check
10214 -- for overlap with any of the preceding elements on the component
10215 -- list containing the component and also, if the component is in
10216 -- a variant, check against components outside the case structure.
10217 -- This latter test is repeated recursively up the variant tree.
10219 Main_Component_Loop : while Present (C1_Ent) loop
10220 if not Ekind_In (C1_Ent, E_Component, E_Discriminant) then
10221 goto Continue_Main_Component_Loop;
10224 -- Skip overlap check if entity has no declaration node. This
10225 -- happens with discriminants in constrained derived types.
10226 -- Possibly we are missing some checks as a result, but that
10227 -- does not seem terribly serious.
10229 if No (Declaration_Node (C1_Ent)) then
10230 goto Continue_Main_Component_Loop;
10233 Clist := Parent (List_Containing (Declaration_Node (C1_Ent)));
10235 -- Loop through component lists that need checking. Check the
10236 -- current component list and all lists in variants above us.
10238 Component_List_Loop : loop
10240 -- If derived type definition, go to full declaration
10241 -- If at outer level, check discriminants if there are any.
10243 if Nkind (Clist) = N_Derived_Type_Definition then
10244 Clist := Parent (Clist);
10247 -- Outer level of record definition, check discriminants
10249 if Nkind_In (Clist, N_Full_Type_Declaration,
10250 N_Private_Type_Declaration)
10252 if Has_Discriminants (Defining_Identifier (Clist)) then
10254 First_Discriminant (Defining_Identifier (Clist));
10255 while Present (C2_Ent) loop
10256 exit when C1_Ent = C2_Ent;
10257 Check_Component_Overlap (C1_Ent, C2_Ent);
10258 Next_Discriminant (C2_Ent);
10262 -- Record extension case
10264 elsif Nkind (Clist) = N_Derived_Type_Definition then
10267 -- Otherwise check one component list
10270 Citem := First (Component_Items (Clist));
10271 while Present (Citem) loop
10272 if Nkind (Citem) = N_Component_Declaration then
10273 C2_Ent := Defining_Identifier (Citem);
10274 exit when C1_Ent = C2_Ent;
10275 Check_Component_Overlap (C1_Ent, C2_Ent);
10282 -- Check for variants above us (the parent of the Clist can
10283 -- be a variant, in which case its parent is a variant part,
10284 -- and the parent of the variant part is a component list
10285 -- whose components must all be checked against the current
10286 -- component for overlap).
10288 if Nkind (Parent (Clist)) = N_Variant then
10289 Clist := Parent (Parent (Parent (Clist)));
10291 -- Check for possible discriminant part in record, this
10292 -- is treated essentially as another level in the
10293 -- recursion. For this case the parent of the component
10294 -- list is the record definition, and its parent is the
10295 -- full type declaration containing the discriminant
10298 elsif Nkind (Parent (Clist)) = N_Record_Definition then
10299 Clist := Parent (Parent ((Clist)));
10301 -- If neither of these two cases, we are at the top of
10305 exit Component_List_Loop;
10307 end loop Component_List_Loop;
10309 <<Continue_Main_Component_Loop>>
10310 Next_Entity (C1_Ent);
10312 end loop Main_Component_Loop;
10313 end Overlap_Check2;
10316 -- The following circuit deals with warning on record holes (gaps). We
10317 -- skip this check if overlap was detected, since it makes sense for the
10318 -- programmer to fix this illegality before worrying about warnings.
10320 if not Overlap_Detected and Warn_On_Record_Holes then
10321 Record_Hole_Check : declare
10322 Decl : constant Node_Id := Declaration_Node (Base_Type (Rectype));
10323 -- Full declaration of record type
10325 procedure Check_Component_List
10329 -- Check component list CL for holes. The starting bit should be
10330 -- Sbit. which is zero for the main record component list and set
10331 -- appropriately for recursive calls for variants. DS is set to
10332 -- a list of discriminant specifications to be included in the
10333 -- consideration of components. It is No_List if none to consider.
10335 --------------------------
10336 -- Check_Component_List --
10337 --------------------------
10339 procedure Check_Component_List
10347 Compl := Integer (List_Length (Component_Items (CL)));
10349 if DS /= No_List then
10350 Compl := Compl + Integer (List_Length (DS));
10354 Comps : array (Natural range 0 .. Compl) of Entity_Id;
10355 -- Gather components (zero entry is for sort routine)
10357 Ncomps : Natural := 0;
10358 -- Number of entries stored in Comps (starting at Comps (1))
10361 -- One component item or discriminant specification
10364 -- Starting bit for next component
10367 -- Component entity
10372 function Lt (Op1, Op2 : Natural) return Boolean;
10373 -- Compare routine for Sort
10375 procedure Move (From : Natural; To : Natural);
10376 -- Move routine for Sort
10378 package Sorting is new GNAT.Heap_Sort_G (Move, Lt);
10384 function Lt (Op1, Op2 : Natural) return Boolean is
10386 return Component_Bit_Offset (Comps (Op1))
10388 Component_Bit_Offset (Comps (Op2));
10395 procedure Move (From : Natural; To : Natural) is
10397 Comps (To) := Comps (From);
10401 -- Gather discriminants into Comp
10403 if DS /= No_List then
10404 Citem := First (DS);
10405 while Present (Citem) loop
10406 if Nkind (Citem) = N_Discriminant_Specification then
10408 Ent : constant Entity_Id :=
10409 Defining_Identifier (Citem);
10411 if Ekind (Ent) = E_Discriminant then
10412 Ncomps := Ncomps + 1;
10413 Comps (Ncomps) := Ent;
10422 -- Gather component entities into Comp
10424 Citem := First (Component_Items (CL));
10425 while Present (Citem) loop
10426 if Nkind (Citem) = N_Component_Declaration then
10427 Ncomps := Ncomps + 1;
10428 Comps (Ncomps) := Defining_Identifier (Citem);
10434 -- Now sort the component entities based on the first bit.
10435 -- Note we already know there are no overlapping components.
10437 Sorting.Sort (Ncomps);
10439 -- Loop through entries checking for holes
10442 for J in 1 .. Ncomps loop
10446 CBO : constant Uint := Component_Bit_Offset (CEnt);
10449 -- Skip components with unknown offsets
10451 if CBO /= No_Uint and then CBO >= 0 then
10452 Error_Msg_Uint_1 := CBO - Nbit;
10454 if Error_Msg_Uint_1 > 0 then
10456 ("?H?^-bit gap before component&",
10457 Component_Name (Component_Clause (CEnt)),
10461 Nbit := CBO + Esize (CEnt);
10466 -- Process variant parts recursively if present
10468 if Present (Variant_Part (CL)) then
10469 Variant := First (Variants (Variant_Part (CL)));
10470 while Present (Variant) loop
10471 Check_Component_List
10472 (Component_List (Variant), Nbit, No_List);
10477 end Check_Component_List;
10479 -- Start of processing for Record_Hole_Check
10486 if Is_Tagged_Type (Rectype) then
10487 Sbit := UI_From_Int (System_Address_Size);
10492 if Nkind (Decl) = N_Full_Type_Declaration
10493 and then Nkind (Type_Definition (Decl)) = N_Record_Definition
10495 Check_Component_List
10496 (Component_List (Type_Definition (Decl)),
10498 Discriminant_Specifications (Decl));
10501 end Record_Hole_Check;
10504 -- For records that have component clauses for all components, and whose
10505 -- size is less than or equal to 32, we need to know the size in the
10506 -- front end to activate possible packed array processing where the
10507 -- component type is a record.
10509 -- At this stage Hbit + 1 represents the first unused bit from all the
10510 -- component clauses processed, so if the component clauses are
10511 -- complete, then this is the length of the record.
10513 -- For records longer than System.Storage_Unit, and for those where not
10514 -- all components have component clauses, the back end determines the
10515 -- length (it may for example be appropriate to round up the size
10516 -- to some convenient boundary, based on alignment considerations, etc).
10518 if Unknown_RM_Size (Rectype) and then Hbit + 1 <= 32 then
10520 -- Nothing to do if at least one component has no component clause
10522 Comp := First_Component_Or_Discriminant (Rectype);
10523 while Present (Comp) loop
10524 exit when No (Component_Clause (Comp));
10525 Next_Component_Or_Discriminant (Comp);
10528 -- If we fall out of loop, all components have component clauses
10529 -- and so we can set the size to the maximum value.
10532 Set_RM_Size (Rectype, Hbit + 1);
10535 end Check_Record_Representation_Clause;
10541 procedure Check_Size
10545 Biased : out Boolean)
10547 procedure Size_Too_Small_Error (Min_Siz : Uint);
10548 -- Emit an error concerning illegal size Siz. Min_Siz denotes the
10551 --------------------------
10552 -- Size_Too_Small_Error --
10553 --------------------------
10555 procedure Size_Too_Small_Error (Min_Siz : Uint) is
10557 -- This error is suppressed in ASIS mode to allow for different ASIS
10558 -- back ends or ASIS-based tools to query the illegal clause.
10560 if not ASIS_Mode then
10561 Error_Msg_Uint_1 := Min_Siz;
10562 Error_Msg_NE ("size for& too small, minimum allowed is ^", N, T);
10564 end Size_Too_Small_Error;
10568 UT : constant Entity_Id := Underlying_Type (T);
10571 -- Start of processing for Check_Size
10576 -- Reject patently improper size values
10578 if Is_Elementary_Type (T)
10579 and then Siz > UI_From_Int (Int'Last)
10581 Error_Msg_N ("Size value too large for elementary type", N);
10583 if Nkind (Original_Node (N)) = N_Op_Expon then
10585 ("\maybe '* was meant, rather than '*'*", Original_Node (N));
10589 -- Dismiss generic types
10591 if Is_Generic_Type (T)
10593 Is_Generic_Type (UT)
10595 Is_Generic_Type (Root_Type (UT))
10599 -- Guard against previous errors
10601 elsif No (UT) or else UT = Any_Type then
10602 Check_Error_Detected;
10605 -- Check case of bit packed array
10607 elsif Is_Array_Type (UT)
10608 and then Known_Static_Component_Size (UT)
10609 and then Is_Bit_Packed_Array (UT)
10617 Asiz := Component_Size (UT);
10618 Indx := First_Index (UT);
10620 Ityp := Etype (Indx);
10622 -- If non-static bound, then we are not in the business of
10623 -- trying to check the length, and indeed an error will be
10624 -- issued elsewhere, since sizes of non-static array types
10625 -- cannot be set implicitly or explicitly.
10627 if not Is_OK_Static_Subtype (Ityp) then
10631 -- Otherwise accumulate next dimension
10633 Asiz := Asiz * (Expr_Value (Type_High_Bound (Ityp)) -
10634 Expr_Value (Type_Low_Bound (Ityp)) +
10638 exit when No (Indx);
10641 if Asiz <= Siz then
10645 Size_Too_Small_Error (Asiz);
10646 Set_Esize (T, Asiz);
10647 Set_RM_Size (T, Asiz);
10651 -- All other composite types are ignored
10653 elsif Is_Composite_Type (UT) then
10656 -- For fixed-point types, don't check minimum if type is not frozen,
10657 -- since we don't know all the characteristics of the type that can
10658 -- affect the size (e.g. a specified small) till freeze time.
10660 elsif Is_Fixed_Point_Type (UT) and then not Is_Frozen (UT) then
10663 -- Cases for which a minimum check is required
10666 -- Ignore if specified size is correct for the type
10668 if Known_Esize (UT) and then Siz = Esize (UT) then
10672 -- Otherwise get minimum size
10674 M := UI_From_Int (Minimum_Size (UT));
10678 -- Size is less than minimum size, but one possibility remains
10679 -- that we can manage with the new size if we bias the type.
10681 M := UI_From_Int (Minimum_Size (UT, Biased => True));
10684 Size_Too_Small_Error (M);
10686 Set_RM_Size (T, M);
10694 --------------------------
10695 -- Freeze_Entity_Checks --
10696 --------------------------
10698 procedure Freeze_Entity_Checks (N : Node_Id) is
10699 procedure Hide_Non_Overridden_Subprograms (Typ : Entity_Id);
10700 -- Inspect the primitive operations of type Typ and hide all pairs of
10701 -- implicitly declared non-overridden non-fully conformant homographs
10702 -- (Ada RM 8.3 12.3/2).
10704 -------------------------------------
10705 -- Hide_Non_Overridden_Subprograms --
10706 -------------------------------------
10708 procedure Hide_Non_Overridden_Subprograms (Typ : Entity_Id) is
10709 procedure Hide_Matching_Homographs
10710 (Subp_Id : Entity_Id;
10711 Start_Elmt : Elmt_Id);
10712 -- Inspect a list of primitive operations starting with Start_Elmt
10713 -- and find matching implicitly declared non-overridden non-fully
10714 -- conformant homographs of Subp_Id. If found, all matches along
10715 -- with Subp_Id are hidden from all visibility.
10717 function Is_Non_Overridden_Or_Null_Procedure
10718 (Subp_Id : Entity_Id) return Boolean;
10719 -- Determine whether subprogram Subp_Id is implicitly declared non-
10720 -- overridden subprogram or an implicitly declared null procedure.
10722 ------------------------------
10723 -- Hide_Matching_Homographs --
10724 ------------------------------
10726 procedure Hide_Matching_Homographs
10727 (Subp_Id : Entity_Id;
10728 Start_Elmt : Elmt_Id)
10731 Prim_Elmt : Elmt_Id;
10734 Prim_Elmt := Start_Elmt;
10735 while Present (Prim_Elmt) loop
10736 Prim := Node (Prim_Elmt);
10738 -- The current primitive is implicitly declared non-overridden
10739 -- non-fully conformant homograph of Subp_Id. Both subprograms
10740 -- must be hidden from visibility.
10742 if Chars (Prim) = Chars (Subp_Id)
10743 and then Is_Non_Overridden_Or_Null_Procedure (Prim)
10744 and then not Fully_Conformant (Prim, Subp_Id)
10746 Set_Is_Hidden_Non_Overridden_Subpgm (Prim);
10747 Set_Is_Immediately_Visible (Prim, False);
10748 Set_Is_Potentially_Use_Visible (Prim, False);
10750 Set_Is_Hidden_Non_Overridden_Subpgm (Subp_Id);
10751 Set_Is_Immediately_Visible (Subp_Id, False);
10752 Set_Is_Potentially_Use_Visible (Subp_Id, False);
10755 Next_Elmt (Prim_Elmt);
10757 end Hide_Matching_Homographs;
10759 -----------------------------------------
10760 -- Is_Non_Overridden_Or_Null_Procedure --
10761 -----------------------------------------
10763 function Is_Non_Overridden_Or_Null_Procedure
10764 (Subp_Id : Entity_Id) return Boolean
10766 Alias_Id : Entity_Id;
10769 -- The subprogram is inherited (implicitly declared), it does not
10770 -- override and does not cover a primitive of an interface.
10772 if Ekind_In (Subp_Id, E_Function, E_Procedure)
10773 and then Present (Alias (Subp_Id))
10774 and then No (Interface_Alias (Subp_Id))
10775 and then No (Overridden_Operation (Subp_Id))
10777 Alias_Id := Alias (Subp_Id);
10779 if Requires_Overriding (Alias_Id) then
10782 elsif Nkind (Parent (Alias_Id)) = N_Procedure_Specification
10783 and then Null_Present (Parent (Alias_Id))
10790 end Is_Non_Overridden_Or_Null_Procedure;
10794 Prim_Ops : constant Elist_Id := Direct_Primitive_Operations (Typ);
10796 Prim_Elmt : Elmt_Id;
10798 -- Start of processing for Hide_Non_Overridden_Subprograms
10801 -- Inspect the list of primitives looking for non-overridden
10804 if Present (Prim_Ops) then
10805 Prim_Elmt := First_Elmt (Prim_Ops);
10806 while Present (Prim_Elmt) loop
10807 Prim := Node (Prim_Elmt);
10808 Next_Elmt (Prim_Elmt);
10810 if Is_Non_Overridden_Or_Null_Procedure (Prim) then
10811 Hide_Matching_Homographs
10813 Start_Elmt => Prim_Elmt);
10817 end Hide_Non_Overridden_Subprograms;
10821 E : constant Entity_Id := Entity (N);
10823 Non_Generic_Case : constant Boolean := Nkind (N) = N_Freeze_Entity;
10824 -- True in non-generic case. Some of the processing here is skipped
10825 -- for the generic case since it is not needed. Basically in the
10826 -- generic case, we only need to do stuff that might generate error
10827 -- messages or warnings.
10829 -- Start of processing for Freeze_Entity_Checks
10832 -- Remember that we are processing a freezing entity. Required to
10833 -- ensure correct decoration of internal entities associated with
10834 -- interfaces (see New_Overloaded_Entity).
10836 Inside_Freezing_Actions := Inside_Freezing_Actions + 1;
10838 -- For tagged types covering interfaces add internal entities that link
10839 -- the primitives of the interfaces with the primitives that cover them.
10840 -- Note: These entities were originally generated only when generating
10841 -- code because their main purpose was to provide support to initialize
10842 -- the secondary dispatch tables. They are now generated also when
10843 -- compiling with no code generation to provide ASIS the relationship
10844 -- between interface primitives and tagged type primitives. They are
10845 -- also used to locate primitives covering interfaces when processing
10846 -- generics (see Derive_Subprograms).
10848 -- This is not needed in the generic case
10850 if Ada_Version >= Ada_2005
10851 and then Non_Generic_Case
10852 and then Ekind (E) = E_Record_Type
10853 and then Is_Tagged_Type (E)
10854 and then not Is_Interface (E)
10855 and then Has_Interfaces (E)
10857 -- This would be a good common place to call the routine that checks
10858 -- overriding of interface primitives (and thus factorize calls to
10859 -- Check_Abstract_Overriding located at different contexts in the
10860 -- compiler). However, this is not possible because it causes
10861 -- spurious errors in case of late overriding.
10863 Add_Internal_Interface_Entities (E);
10866 -- After all forms of overriding have been resolved, a tagged type may
10867 -- be left with a set of implicitly declared and possibly erroneous
10868 -- abstract subprograms, null procedures and subprograms that require
10869 -- overriding. If this set contains fully conformant homographs, then
10870 -- one is chosen arbitrarily (already done during resolution), otherwise
10871 -- all remaining non-fully conformant homographs are hidden from
10872 -- visibility (Ada RM 8.3 12.3/2).
10874 if Is_Tagged_Type (E) then
10875 Hide_Non_Overridden_Subprograms (E);
10880 if Ekind (E) = E_Record_Type
10881 and then Is_CPP_Class (E)
10882 and then Is_Tagged_Type (E)
10883 and then Tagged_Type_Expansion
10885 if CPP_Num_Prims (E) = 0 then
10887 -- If the CPP type has user defined components then it must import
10888 -- primitives from C++. This is required because if the C++ class
10889 -- has no primitives then the C++ compiler does not added the _tag
10890 -- component to the type.
10892 if First_Entity (E) /= Last_Entity (E) then
10894 ("'C'P'P type must import at least one primitive from C++??",
10899 -- Check that all its primitives are abstract or imported from C++.
10900 -- Check also availability of the C++ constructor.
10903 Has_Constructors : constant Boolean := Has_CPP_Constructors (E);
10905 Error_Reported : Boolean := False;
10909 Elmt := First_Elmt (Primitive_Operations (E));
10910 while Present (Elmt) loop
10911 Prim := Node (Elmt);
10913 if Comes_From_Source (Prim) then
10914 if Is_Abstract_Subprogram (Prim) then
10917 elsif not Is_Imported (Prim)
10918 or else Convention (Prim) /= Convention_CPP
10921 ("primitives of 'C'P'P types must be imported from C++ "
10922 & "or abstract??", Prim);
10924 elsif not Has_Constructors
10925 and then not Error_Reported
10927 Error_Msg_Name_1 := Chars (E);
10929 ("??'C'P'P constructor required for type %", Prim);
10930 Error_Reported := True;
10939 -- Check Ada derivation of CPP type
10941 if Expander_Active -- why? losing errors in -gnatc mode???
10942 and then Present (Etype (E)) -- defend against errors
10943 and then Tagged_Type_Expansion
10944 and then Ekind (E) = E_Record_Type
10945 and then Etype (E) /= E
10946 and then Is_CPP_Class (Etype (E))
10947 and then CPP_Num_Prims (Etype (E)) > 0
10948 and then not Is_CPP_Class (E)
10949 and then not Has_CPP_Constructors (Etype (E))
10951 -- If the parent has C++ primitives but it has no constructor then
10952 -- check that all the primitives are overridden in this derivation;
10953 -- otherwise the constructor of the parent is needed to build the
10961 Elmt := First_Elmt (Primitive_Operations (E));
10962 while Present (Elmt) loop
10963 Prim := Node (Elmt);
10965 if not Is_Abstract_Subprogram (Prim)
10966 and then No (Interface_Alias (Prim))
10967 and then Find_Dispatching_Type (Ultimate_Alias (Prim)) /= E
10969 Error_Msg_Name_1 := Chars (Etype (E));
10971 ("'C'P'P constructor required for parent type %", E);
10980 Inside_Freezing_Actions := Inside_Freezing_Actions - 1;
10982 -- If we have a type with predicates, build predicate function. This is
10983 -- not needed in the generic case, nor within TSS subprograms and other
10984 -- predefined primitives.
10987 and then Non_Generic_Case
10988 and then not Within_Internal_Subprogram
10989 and then Has_Predicates (E)
10991 Build_Predicate_Functions (E, N);
10994 -- If type has delayed aspects, this is where we do the preanalysis at
10995 -- the freeze point, as part of the consistent visibility check. Note
10996 -- that this must be done after calling Build_Predicate_Functions or
10997 -- Build_Invariant_Procedure since these subprograms fix occurrences of
10998 -- the subtype name in the saved expression so that they will not cause
10999 -- trouble in the preanalysis.
11001 -- This is also not needed in the generic case
11003 if Non_Generic_Case
11004 and then Has_Delayed_Aspects (E)
11005 and then Scope (E) = Current_Scope
11007 -- Retrieve the visibility to the discriminants in order to properly
11008 -- analyze the aspects.
11010 Push_Scope_And_Install_Discriminants (E);
11016 -- Look for aspect specification entries for this entity
11018 Ritem := First_Rep_Item (E);
11019 while Present (Ritem) loop
11020 if Nkind (Ritem) = N_Aspect_Specification
11021 and then Entity (Ritem) = E
11022 and then Is_Delayed_Aspect (Ritem)
11024 Check_Aspect_At_Freeze_Point (Ritem);
11027 Next_Rep_Item (Ritem);
11031 Uninstall_Discriminants_And_Pop_Scope (E);
11034 -- For a record type, deal with variant parts. This has to be delayed
11035 -- to this point, because of the issue of statically predicated
11036 -- subtypes, which we have to ensure are frozen before checking
11037 -- choices, since we need to have the static choice list set.
11039 if Is_Record_Type (E) then
11040 Check_Variant_Part : declare
11041 D : constant Node_Id := Declaration_Node (E);
11046 Others_Present : Boolean;
11047 pragma Warnings (Off, Others_Present);
11048 -- Indicates others present, not used in this case
11050 procedure Non_Static_Choice_Error (Choice : Node_Id);
11051 -- Error routine invoked by the generic instantiation below when
11052 -- the variant part has a non static choice.
11054 procedure Process_Declarations (Variant : Node_Id);
11055 -- Processes declarations associated with a variant. We analyzed
11056 -- the declarations earlier (in Sem_Ch3.Analyze_Variant_Part),
11057 -- but we still need the recursive call to Check_Choices for any
11058 -- nested variant to get its choices properly processed. This is
11059 -- also where we expand out the choices if expansion is active.
11061 package Variant_Choices_Processing is new
11062 Generic_Check_Choices
11063 (Process_Empty_Choice => No_OP,
11064 Process_Non_Static_Choice => Non_Static_Choice_Error,
11065 Process_Associated_Node => Process_Declarations);
11066 use Variant_Choices_Processing;
11068 -----------------------------
11069 -- Non_Static_Choice_Error --
11070 -----------------------------
11072 procedure Non_Static_Choice_Error (Choice : Node_Id) is
11074 Flag_Non_Static_Expr
11075 ("choice given in variant part is not static!", Choice);
11076 end Non_Static_Choice_Error;
11078 --------------------------
11079 -- Process_Declarations --
11080 --------------------------
11082 procedure Process_Declarations (Variant : Node_Id) is
11083 CL : constant Node_Id := Component_List (Variant);
11087 -- Check for static predicate present in this variant
11089 if Has_SP_Choice (Variant) then
11091 -- Here we expand. You might expect to find this call in
11092 -- Expand_N_Variant_Part, but that is called when we first
11093 -- see the variant part, and we cannot do this expansion
11094 -- earlier than the freeze point, since for statically
11095 -- predicated subtypes, the predicate is not known till
11096 -- the freeze point.
11098 -- Furthermore, we do this expansion even if the expander
11099 -- is not active, because other semantic processing, e.g.
11100 -- for aggregates, requires the expanded list of choices.
11102 -- If the expander is not active, then we can't just clobber
11103 -- the list since it would invalidate the ASIS -gnatct tree.
11104 -- So we have to rewrite the variant part with a Rewrite
11105 -- call that replaces it with a copy and clobber the copy.
11107 if not Expander_Active then
11109 NewV : constant Node_Id := New_Copy (Variant);
11111 Set_Discrete_Choices
11112 (NewV, New_Copy_List (Discrete_Choices (Variant)));
11113 Rewrite (Variant, NewV);
11117 Expand_Static_Predicates_In_Choices (Variant);
11120 -- We don't need to worry about the declarations in the variant
11121 -- (since they were analyzed by Analyze_Choices when we first
11122 -- encountered the variant), but we do need to take care of
11123 -- expansion of any nested variants.
11125 if not Null_Present (CL) then
11126 VP := Variant_Part (CL);
11128 if Present (VP) then
11130 (VP, Variants (VP), Etype (Name (VP)), Others_Present);
11133 end Process_Declarations;
11135 -- Start of processing for Check_Variant_Part
11138 -- Find component list
11142 if Nkind (D) = N_Full_Type_Declaration then
11143 T := Type_Definition (D);
11145 if Nkind (T) = N_Record_Definition then
11146 C := Component_List (T);
11148 elsif Nkind (T) = N_Derived_Type_Definition
11149 and then Present (Record_Extension_Part (T))
11151 C := Component_List (Record_Extension_Part (T));
11155 -- Case of variant part present
11157 if Present (C) and then Present (Variant_Part (C)) then
11158 VP := Variant_Part (C);
11163 (VP, Variants (VP), Etype (Name (VP)), Others_Present);
11165 -- If the last variant does not contain the Others choice,
11166 -- replace it with an N_Others_Choice node since Gigi always
11167 -- wants an Others. Note that we do not bother to call Analyze
11168 -- on the modified variant part, since its only effect would be
11169 -- to compute the Others_Discrete_Choices node laboriously, and
11170 -- of course we already know the list of choices corresponding
11171 -- to the others choice (it's the list we're replacing).
11173 -- We only want to do this if the expander is active, since
11174 -- we do not want to clobber the ASIS tree.
11176 if Expander_Active then
11178 Last_Var : constant Node_Id :=
11179 Last_Non_Pragma (Variants (VP));
11181 Others_Node : Node_Id;
11184 if Nkind (First (Discrete_Choices (Last_Var))) /=
11187 Others_Node := Make_Others_Choice (Sloc (Last_Var));
11188 Set_Others_Discrete_Choices
11189 (Others_Node, Discrete_Choices (Last_Var));
11190 Set_Discrete_Choices
11191 (Last_Var, New_List (Others_Node));
11196 end Check_Variant_Part;
11198 end Freeze_Entity_Checks;
11200 -------------------------
11201 -- Get_Alignment_Value --
11202 -------------------------
11204 function Get_Alignment_Value (Expr : Node_Id) return Uint is
11205 Align : constant Uint := Static_Integer (Expr);
11208 if Align = No_Uint then
11211 elsif Align <= 0 then
11213 -- This error is suppressed in ASIS mode to allow for different ASIS
11214 -- back ends or ASIS-based tools to query the illegal clause.
11216 if not ASIS_Mode then
11217 Error_Msg_N ("alignment value must be positive", Expr);
11223 for J in Int range 0 .. 64 loop
11225 M : constant Uint := Uint_2 ** J;
11228 exit when M = Align;
11232 -- This error is suppressed in ASIS mode to allow for
11233 -- different ASIS back ends or ASIS-based tools to query the
11236 if not ASIS_Mode then
11237 Error_Msg_N ("alignment value must be power of 2", Expr);
11247 end Get_Alignment_Value;
11249 -------------------------------------
11250 -- Inherit_Aspects_At_Freeze_Point --
11251 -------------------------------------
11253 procedure Inherit_Aspects_At_Freeze_Point (Typ : Entity_Id) is
11254 function Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11255 (Rep_Item : Node_Id) return Boolean;
11256 -- This routine checks if Rep_Item is either a pragma or an aspect
11257 -- specification node whose correponding pragma (if any) is present in
11258 -- the Rep Item chain of the entity it has been specified to.
11260 --------------------------------------------------
11261 -- Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item --
11262 --------------------------------------------------
11264 function Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11265 (Rep_Item : Node_Id) return Boolean
11269 Nkind (Rep_Item) = N_Pragma
11270 or else Present_In_Rep_Item
11271 (Entity (Rep_Item), Aspect_Rep_Item (Rep_Item));
11272 end Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item;
11274 -- Start of processing for Inherit_Aspects_At_Freeze_Point
11277 -- A representation item is either subtype-specific (Size and Alignment
11278 -- clauses) or type-related (all others). Subtype-specific aspects may
11279 -- differ for different subtypes of the same type (RM 13.1.8).
11281 -- A derived type inherits each type-related representation aspect of
11282 -- its parent type that was directly specified before the declaration of
11283 -- the derived type (RM 13.1.15).
11285 -- A derived subtype inherits each subtype-specific representation
11286 -- aspect of its parent subtype that was directly specified before the
11287 -- declaration of the derived type (RM 13.1.15).
11289 -- The general processing involves inheriting a representation aspect
11290 -- from a parent type whenever the first rep item (aspect specification,
11291 -- attribute definition clause, pragma) corresponding to the given
11292 -- representation aspect in the rep item chain of Typ, if any, isn't
11293 -- directly specified to Typ but to one of its parents.
11295 -- ??? Note that, for now, just a limited number of representation
11296 -- aspects have been inherited here so far. Many of them are
11297 -- still inherited in Sem_Ch3. This will be fixed soon. Here is
11298 -- a non- exhaustive list of aspects that likely also need to
11299 -- be moved to this routine: Alignment, Component_Alignment,
11300 -- Component_Size, Machine_Radix, Object_Size, Pack, Predicates,
11301 -- Preelaborable_Initialization, RM_Size and Small.
11303 -- In addition, Convention must be propagated from base type to subtype,
11304 -- because the subtype may have been declared on an incomplete view.
11306 if Nkind (Parent (Typ)) = N_Private_Extension_Declaration then
11312 if not Has_Rep_Item (Typ, Name_Ada_05, Name_Ada_2005, False)
11313 and then Has_Rep_Item (Typ, Name_Ada_05, Name_Ada_2005)
11314 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11315 (Get_Rep_Item (Typ, Name_Ada_05, Name_Ada_2005))
11317 Set_Is_Ada_2005_Only (Typ);
11322 if not Has_Rep_Item (Typ, Name_Ada_12, Name_Ada_2012, False)
11323 and then Has_Rep_Item (Typ, Name_Ada_12, Name_Ada_2012)
11324 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11325 (Get_Rep_Item (Typ, Name_Ada_12, Name_Ada_2012))
11327 Set_Is_Ada_2012_Only (Typ);
11332 if not Has_Rep_Item (Typ, Name_Atomic, Name_Shared, False)
11333 and then Has_Rep_Pragma (Typ, Name_Atomic, Name_Shared)
11334 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11335 (Get_Rep_Item (Typ, Name_Atomic, Name_Shared))
11337 Set_Is_Atomic (Typ);
11338 Set_Is_Volatile (Typ);
11339 Set_Treat_As_Volatile (Typ);
11344 if Is_Record_Type (Typ)
11345 and then Typ /= Base_Type (Typ) and then Is_Frozen (Base_Type (Typ))
11347 Set_Convention (Typ, Convention (Base_Type (Typ)));
11350 -- Default_Component_Value
11352 -- Verify that there is no rep_item declared for the type, and there
11353 -- is one coming from an ancestor.
11355 if Is_Array_Type (Typ)
11356 and then Is_Base_Type (Typ)
11357 and then not Has_Rep_Item (Typ, Name_Default_Component_Value, False)
11358 and then Has_Rep_Item (Typ, Name_Default_Component_Value)
11360 Set_Default_Aspect_Component_Value (Typ,
11361 Default_Aspect_Component_Value
11362 (Entity (Get_Rep_Item (Typ, Name_Default_Component_Value))));
11367 if Is_Scalar_Type (Typ)
11368 and then Is_Base_Type (Typ)
11369 and then not Has_Rep_Item (Typ, Name_Default_Value, False)
11370 and then Has_Rep_Item (Typ, Name_Default_Value)
11372 Set_Has_Default_Aspect (Typ);
11373 Set_Default_Aspect_Value (Typ,
11374 Default_Aspect_Value
11375 (Entity (Get_Rep_Item (Typ, Name_Default_Value))));
11380 if not Has_Rep_Item (Typ, Name_Discard_Names, False)
11381 and then Has_Rep_Item (Typ, Name_Discard_Names)
11382 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11383 (Get_Rep_Item (Typ, Name_Discard_Names))
11385 Set_Discard_Names (Typ);
11390 if not Has_Rep_Item (Typ, Name_Volatile, False)
11391 and then Has_Rep_Item (Typ, Name_Volatile)
11392 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11393 (Get_Rep_Item (Typ, Name_Volatile))
11395 Set_Is_Volatile (Typ);
11396 Set_Treat_As_Volatile (Typ);
11399 -- Volatile_Full_Access
11401 if not Has_Rep_Item (Typ, Name_Volatile_Full_Access, False)
11402 and then Has_Rep_Pragma (Typ, Name_Volatile_Full_Access)
11403 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11404 (Get_Rep_Item (Typ, Name_Volatile_Full_Access))
11406 Set_Is_Volatile_Full_Access (Typ);
11407 Set_Is_Volatile (Typ);
11408 Set_Treat_As_Volatile (Typ);
11411 -- Inheritance for derived types only
11413 if Is_Derived_Type (Typ) then
11415 Bas_Typ : constant Entity_Id := Base_Type (Typ);
11416 Imp_Bas_Typ : constant Entity_Id := Implementation_Base_Type (Typ);
11419 -- Atomic_Components
11421 if not Has_Rep_Item (Typ, Name_Atomic_Components, False)
11422 and then Has_Rep_Item (Typ, Name_Atomic_Components)
11423 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11424 (Get_Rep_Item (Typ, Name_Atomic_Components))
11426 Set_Has_Atomic_Components (Imp_Bas_Typ);
11429 -- Volatile_Components
11431 if not Has_Rep_Item (Typ, Name_Volatile_Components, False)
11432 and then Has_Rep_Item (Typ, Name_Volatile_Components)
11433 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11434 (Get_Rep_Item (Typ, Name_Volatile_Components))
11436 Set_Has_Volatile_Components (Imp_Bas_Typ);
11439 -- Finalize_Storage_Only
11441 if not Has_Rep_Pragma (Typ, Name_Finalize_Storage_Only, False)
11442 and then Has_Rep_Pragma (Typ, Name_Finalize_Storage_Only)
11444 Set_Finalize_Storage_Only (Bas_Typ);
11447 -- Universal_Aliasing
11449 if not Has_Rep_Item (Typ, Name_Universal_Aliasing, False)
11450 and then Has_Rep_Item (Typ, Name_Universal_Aliasing)
11451 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11452 (Get_Rep_Item (Typ, Name_Universal_Aliasing))
11454 Set_Universal_Aliasing (Imp_Bas_Typ);
11459 if Is_Record_Type (Typ) then
11460 if not Has_Rep_Item (Typ, Name_Bit_Order, False)
11461 and then Has_Rep_Item (Typ, Name_Bit_Order)
11463 Set_Reverse_Bit_Order (Bas_Typ,
11464 Reverse_Bit_Order (Entity (Name
11465 (Get_Rep_Item (Typ, Name_Bit_Order)))));
11469 -- Scalar_Storage_Order
11471 -- Note: the aspect is specified on a first subtype, but recorded
11472 -- in a flag of the base type!
11474 if (Is_Record_Type (Typ) or else Is_Array_Type (Typ))
11475 and then Typ = Bas_Typ
11477 -- For a type extension, always inherit from parent; otherwise
11478 -- inherit if no default applies. Note: we do not check for
11479 -- an explicit rep item on the parent type when inheriting,
11480 -- because the parent SSO may itself have been set by default.
11482 if not Has_Rep_Item (First_Subtype (Typ),
11483 Name_Scalar_Storage_Order, False)
11484 and then (Is_Tagged_Type (Bas_Typ)
11485 or else not (SSO_Set_Low_By_Default (Bas_Typ)
11487 SSO_Set_High_By_Default (Bas_Typ)))
11489 Set_Reverse_Storage_Order (Bas_Typ,
11490 Reverse_Storage_Order
11491 (Implementation_Base_Type (Etype (Bas_Typ))));
11493 -- Clear default SSO indications, since the inherited aspect
11494 -- which was set explicitly overrides the default.
11496 Set_SSO_Set_Low_By_Default (Bas_Typ, False);
11497 Set_SSO_Set_High_By_Default (Bas_Typ, False);
11502 end Inherit_Aspects_At_Freeze_Point;
11508 procedure Initialize is
11510 Address_Clause_Checks.Init;
11511 Compile_Time_Warnings_Errors.Init;
11512 Unchecked_Conversions.Init;
11514 if AAMP_On_Target then
11515 Independence_Checks.Init;
11519 ---------------------------
11520 -- Install_Discriminants --
11521 ---------------------------
11523 procedure Install_Discriminants (E : Entity_Id) is
11527 Disc := First_Discriminant (E);
11528 while Present (Disc) loop
11529 Prev := Current_Entity (Disc);
11530 Set_Current_Entity (Disc);
11531 Set_Is_Immediately_Visible (Disc);
11532 Set_Homonym (Disc, Prev);
11533 Next_Discriminant (Disc);
11535 end Install_Discriminants;
11537 -------------------------
11538 -- Is_Operational_Item --
11539 -------------------------
11541 function Is_Operational_Item (N : Node_Id) return Boolean is
11543 if Nkind (N) /= N_Attribute_Definition_Clause then
11548 Id : constant Attribute_Id := Get_Attribute_Id (Chars (N));
11551 -- List of operational items is given in AARM 13.1(8.mm/1).
11552 -- It is clearly incomplete, as it does not include iterator
11553 -- aspects, among others.
11555 return Id = Attribute_Constant_Indexing
11556 or else Id = Attribute_Default_Iterator
11557 or else Id = Attribute_Implicit_Dereference
11558 or else Id = Attribute_Input
11559 or else Id = Attribute_Iterator_Element
11560 or else Id = Attribute_Iterable
11561 or else Id = Attribute_Output
11562 or else Id = Attribute_Read
11563 or else Id = Attribute_Variable_Indexing
11564 or else Id = Attribute_Write
11565 or else Id = Attribute_External_Tag;
11568 end Is_Operational_Item;
11570 -------------------------
11571 -- Is_Predicate_Static --
11572 -------------------------
11574 -- Note: the basic legality of the expression has already been checked, so
11575 -- we don't need to worry about cases or ranges on strings for example.
11577 function Is_Predicate_Static
11579 Nam : Name_Id) return Boolean
11581 function All_Static_Case_Alternatives (L : List_Id) return Boolean;
11582 -- Given a list of case expression alternatives, returns True if all
11583 -- the alternatives are static (have all static choices, and a static
11586 function All_Static_Choices (L : List_Id) return Boolean;
11587 -- Returns true if all elements of the list are OK static choices
11588 -- as defined below for Is_Static_Choice. Used for case expression
11589 -- alternatives and for the right operand of a membership test. An
11590 -- others_choice is static if the corresponding expression is static.
11591 -- The staticness of the bounds is checked separately.
11593 function Is_Static_Choice (N : Node_Id) return Boolean;
11594 -- Returns True if N represents a static choice (static subtype, or
11595 -- static subtype indication, or static expression, or static range).
11597 -- Note that this is a bit more inclusive than we actually need
11598 -- (in particular membership tests do not allow the use of subtype
11599 -- indications). But that doesn't matter, we have already checked
11600 -- that the construct is legal to get this far.
11602 function Is_Type_Ref (N : Node_Id) return Boolean;
11603 pragma Inline (Is_Type_Ref);
11604 -- Returns True if N is a reference to the type for the predicate in the
11605 -- expression (i.e. if it is an identifier whose Chars field matches the
11606 -- Nam given in the call). N must not be parenthesized, if the type name
11607 -- appears in parens, this routine will return False.
11609 -- The routine also returns True for function calls generated during the
11610 -- expansion of comparison operators on strings, which are intended to
11611 -- be legal in static predicates, and are converted into calls to array
11612 -- comparison routines in the body of the corresponding predicate
11615 ----------------------------------
11616 -- All_Static_Case_Alternatives --
11617 ----------------------------------
11619 function All_Static_Case_Alternatives (L : List_Id) return Boolean is
11624 while Present (N) loop
11625 if not (All_Static_Choices (Discrete_Choices (N))
11626 and then Is_OK_Static_Expression (Expression (N)))
11635 end All_Static_Case_Alternatives;
11637 ------------------------
11638 -- All_Static_Choices --
11639 ------------------------
11641 function All_Static_Choices (L : List_Id) return Boolean is
11646 while Present (N) loop
11647 if not Is_Static_Choice (N) then
11655 end All_Static_Choices;
11657 ----------------------
11658 -- Is_Static_Choice --
11659 ----------------------
11661 function Is_Static_Choice (N : Node_Id) return Boolean is
11663 return Nkind (N) = N_Others_Choice
11664 or else Is_OK_Static_Expression (N)
11665 or else (Is_Entity_Name (N) and then Is_Type (Entity (N))
11666 and then Is_OK_Static_Subtype (Entity (N)))
11667 or else (Nkind (N) = N_Subtype_Indication
11668 and then Is_OK_Static_Subtype (Entity (N)))
11669 or else (Nkind (N) = N_Range and then Is_OK_Static_Range (N));
11670 end Is_Static_Choice;
11676 function Is_Type_Ref (N : Node_Id) return Boolean is
11678 return (Nkind (N) = N_Identifier
11679 and then Chars (N) = Nam
11680 and then Paren_Count (N) = 0)
11681 or else Nkind (N) = N_Function_Call;
11684 -- Start of processing for Is_Predicate_Static
11687 -- Predicate_Static means one of the following holds. Numbers are the
11688 -- corresponding paragraph numbers in (RM 3.2.4(16-22)).
11690 -- 16: A static expression
11692 if Is_OK_Static_Expression (Expr) then
11695 -- 17: A membership test whose simple_expression is the current
11696 -- instance, and whose membership_choice_list meets the requirements
11697 -- for a static membership test.
11699 elsif Nkind (Expr) in N_Membership_Test
11700 and then ((Present (Right_Opnd (Expr))
11701 and then Is_Static_Choice (Right_Opnd (Expr)))
11703 (Present (Alternatives (Expr))
11704 and then All_Static_Choices (Alternatives (Expr))))
11708 -- 18. A case_expression whose selecting_expression is the current
11709 -- instance, and whose dependent expressions are static expressions.
11711 elsif Nkind (Expr) = N_Case_Expression
11712 and then Is_Type_Ref (Expression (Expr))
11713 and then All_Static_Case_Alternatives (Alternatives (Expr))
11717 -- 19. A call to a predefined equality or ordering operator, where one
11718 -- operand is the current instance, and the other is a static
11721 -- Note: the RM is clearly wrong here in not excluding string types.
11722 -- Without this exclusion, we would allow expressions like X > "ABC"
11723 -- to be considered as predicate-static, which is clearly not intended,
11724 -- since the idea is for predicate-static to be a subset of normal
11725 -- static expressions (and "DEF" > "ABC" is not a static expression).
11727 -- However, we do allow internally generated (not from source) equality
11728 -- and inequality operations to be valid on strings (this helps deal
11729 -- with cases where we transform A in "ABC" to A = "ABC).
11731 -- In fact, it appears that the intent of the ARG is to extend static
11732 -- predicates to strings, and that the extension should probably apply
11733 -- to static expressions themselves. The code below accepts comparison
11734 -- operators that apply to static strings.
11736 elsif Nkind (Expr) in N_Op_Compare
11737 and then ((Is_Type_Ref (Left_Opnd (Expr))
11738 and then Is_OK_Static_Expression (Right_Opnd (Expr)))
11740 (Is_Type_Ref (Right_Opnd (Expr))
11741 and then Is_OK_Static_Expression (Left_Opnd (Expr))))
11745 -- 20. A call to a predefined boolean logical operator, where each
11746 -- operand is predicate-static.
11748 elsif (Nkind_In (Expr, N_Op_And, N_Op_Or, N_Op_Xor)
11749 and then Is_Predicate_Static (Left_Opnd (Expr), Nam)
11750 and then Is_Predicate_Static (Right_Opnd (Expr), Nam))
11752 (Nkind (Expr) = N_Op_Not
11753 and then Is_Predicate_Static (Right_Opnd (Expr), Nam))
11757 -- 21. A short-circuit control form where both operands are
11758 -- predicate-static.
11760 elsif Nkind (Expr) in N_Short_Circuit
11761 and then Is_Predicate_Static (Left_Opnd (Expr), Nam)
11762 and then Is_Predicate_Static (Right_Opnd (Expr), Nam)
11766 -- 22. A parenthesized predicate-static expression. This does not
11767 -- require any special test, since we just ignore paren levels in
11768 -- all the cases above.
11770 -- One more test that is an implementation artifact caused by the fact
11771 -- that we are analyzing not the original expression, but the generated
11772 -- expression in the body of the predicate function. This can include
11773 -- references to inherited predicates, so that the expression we are
11774 -- processing looks like:
11776 -- xxPredicate (typ (Inns)) and then expression
11778 -- Where the call is to a Predicate function for an inherited predicate.
11779 -- We simply ignore such a call, which could be to either a dynamic or
11780 -- a static predicate. Note that if the parent predicate is dynamic then
11781 -- eventually this type will be marked as dynamic, but you are allowed
11782 -- to specify a static predicate for a subtype which is inheriting a
11783 -- dynamic predicate, so the static predicate validation here ignores
11784 -- the inherited predicate even if it is dynamic.
11785 -- In all cases, a static predicate can only apply to a scalar type.
11787 elsif Nkind (Expr) = N_Function_Call
11788 and then Is_Predicate_Function (Entity (Name (Expr)))
11789 and then Is_Scalar_Type (Etype (First_Entity (Entity (Name (Expr)))))
11793 -- That's an exhaustive list of tests, all other cases are not
11794 -- predicate-static, so we return False.
11799 end Is_Predicate_Static;
11801 ---------------------
11802 -- Kill_Rep_Clause --
11803 ---------------------
11805 procedure Kill_Rep_Clause (N : Node_Id) is
11807 pragma Assert (Ignore_Rep_Clauses);
11809 -- Note: we use Replace rather than Rewrite, because we don't want
11810 -- ASIS to be able to use Original_Node to dig out the (undecorated)
11811 -- rep clause that is being replaced.
11813 Replace (N, Make_Null_Statement (Sloc (N)));
11815 -- The null statement must be marked as not coming from source. This is
11816 -- so that ASIS ignores it, and also the back end does not expect bogus
11817 -- "from source" null statements in weird places (e.g. in declarative
11818 -- regions where such null statements are not allowed).
11820 Set_Comes_From_Source (N, False);
11821 end Kill_Rep_Clause;
11827 function Minimum_Size
11829 Biased : Boolean := False) return Nat
11831 Lo : Uint := No_Uint;
11832 Hi : Uint := No_Uint;
11833 LoR : Ureal := No_Ureal;
11834 HiR : Ureal := No_Ureal;
11835 LoSet : Boolean := False;
11836 HiSet : Boolean := False;
11839 Ancest : Entity_Id;
11840 R_Typ : constant Entity_Id := Root_Type (T);
11843 -- If bad type, return 0
11845 if T = Any_Type then
11848 -- For generic types, just return zero. There cannot be any legitimate
11849 -- need to know such a size, but this routine may be called with a
11850 -- generic type as part of normal processing.
11852 elsif Is_Generic_Type (R_Typ) or else R_Typ = Any_Type then
11855 -- Access types (cannot have size smaller than System.Address)
11857 elsif Is_Access_Type (T) then
11858 return System_Address_Size;
11860 -- Floating-point types
11862 elsif Is_Floating_Point_Type (T) then
11863 return UI_To_Int (Esize (R_Typ));
11867 elsif Is_Discrete_Type (T) then
11869 -- The following loop is looking for the nearest compile time known
11870 -- bounds following the ancestor subtype chain. The idea is to find
11871 -- the most restrictive known bounds information.
11875 if Ancest = Any_Type or else Etype (Ancest) = Any_Type then
11880 if Compile_Time_Known_Value (Type_Low_Bound (Ancest)) then
11881 Lo := Expr_Rep_Value (Type_Low_Bound (Ancest));
11888 if Compile_Time_Known_Value (Type_High_Bound (Ancest)) then
11889 Hi := Expr_Rep_Value (Type_High_Bound (Ancest));
11895 Ancest := Ancestor_Subtype (Ancest);
11897 if No (Ancest) then
11898 Ancest := Base_Type (T);
11900 if Is_Generic_Type (Ancest) then
11906 -- Fixed-point types. We can't simply use Expr_Value to get the
11907 -- Corresponding_Integer_Value values of the bounds, since these do not
11908 -- get set till the type is frozen, and this routine can be called
11909 -- before the type is frozen. Similarly the test for bounds being static
11910 -- needs to include the case where we have unanalyzed real literals for
11911 -- the same reason.
11913 elsif Is_Fixed_Point_Type (T) then
11915 -- The following loop is looking for the nearest compile time known
11916 -- bounds following the ancestor subtype chain. The idea is to find
11917 -- the most restrictive known bounds information.
11921 if Ancest = Any_Type or else Etype (Ancest) = Any_Type then
11925 -- Note: In the following two tests for LoSet and HiSet, it may
11926 -- seem redundant to test for N_Real_Literal here since normally
11927 -- one would assume that the test for the value being known at
11928 -- compile time includes this case. However, there is a glitch.
11929 -- If the real literal comes from folding a non-static expression,
11930 -- then we don't consider any non- static expression to be known
11931 -- at compile time if we are in configurable run time mode (needed
11932 -- in some cases to give a clearer definition of what is and what
11933 -- is not accepted). So the test is indeed needed. Without it, we
11934 -- would set neither Lo_Set nor Hi_Set and get an infinite loop.
11937 if Nkind (Type_Low_Bound (Ancest)) = N_Real_Literal
11938 or else Compile_Time_Known_Value (Type_Low_Bound (Ancest))
11940 LoR := Expr_Value_R (Type_Low_Bound (Ancest));
11947 if Nkind (Type_High_Bound (Ancest)) = N_Real_Literal
11948 or else Compile_Time_Known_Value (Type_High_Bound (Ancest))
11950 HiR := Expr_Value_R (Type_High_Bound (Ancest));
11956 Ancest := Ancestor_Subtype (Ancest);
11958 if No (Ancest) then
11959 Ancest := Base_Type (T);
11961 if Is_Generic_Type (Ancest) then
11967 Lo := UR_To_Uint (LoR / Small_Value (T));
11968 Hi := UR_To_Uint (HiR / Small_Value (T));
11970 -- No other types allowed
11973 raise Program_Error;
11976 -- Fall through with Hi and Lo set. Deal with biased case
11979 and then not Is_Fixed_Point_Type (T)
11980 and then not (Is_Enumeration_Type (T)
11981 and then Has_Non_Standard_Rep (T)))
11982 or else Has_Biased_Representation (T)
11988 -- Null range case, size is always zero. We only do this in the discrete
11989 -- type case, since that's the odd case that came up. Probably we should
11990 -- also do this in the fixed-point case, but doing so causes peculiar
11991 -- gigi failures, and it is not worth worrying about this incredibly
11992 -- marginal case (explicit null-range fixed-point type declarations)???
11994 if Lo > Hi and then Is_Discrete_Type (T) then
11997 -- Signed case. Note that we consider types like range 1 .. -1 to be
11998 -- signed for the purpose of computing the size, since the bounds have
11999 -- to be accommodated in the base type.
12001 elsif Lo < 0 or else Hi < 0 then
12005 -- S = size, B = 2 ** (size - 1) (can accommodate -B .. +(B - 1))
12006 -- Note that we accommodate the case where the bounds cross. This
12007 -- can happen either because of the way the bounds are declared
12008 -- or because of the algorithm in Freeze_Fixed_Point_Type.
12022 -- If both bounds are positive, make sure that both are represen-
12023 -- table in the case where the bounds are crossed. This can happen
12024 -- either because of the way the bounds are declared, or because of
12025 -- the algorithm in Freeze_Fixed_Point_Type.
12031 -- S = size, (can accommodate 0 .. (2**size - 1))
12034 while Hi >= Uint_2 ** S loop
12042 ---------------------------
12043 -- New_Stream_Subprogram --
12044 ---------------------------
12046 procedure New_Stream_Subprogram
12050 Nam : TSS_Name_Type)
12052 Loc : constant Source_Ptr := Sloc (N);
12053 Sname : constant Name_Id := Make_TSS_Name (Base_Type (Ent), Nam);
12054 Subp_Id : Entity_Id;
12055 Subp_Decl : Node_Id;
12059 Defer_Declaration : constant Boolean :=
12060 Is_Tagged_Type (Ent) or else Is_Private_Type (Ent);
12061 -- For a tagged type, there is a declaration for each stream attribute
12062 -- at the freeze point, and we must generate only a completion of this
12063 -- declaration. We do the same for private types, because the full view
12064 -- might be tagged. Otherwise we generate a declaration at the point of
12065 -- the attribute definition clause. If the attribute definition comes
12066 -- from an aspect specification the declaration is part of the freeze
12067 -- actions of the type.
12069 function Build_Spec return Node_Id;
12070 -- Used for declaration and renaming declaration, so that this is
12071 -- treated as a renaming_as_body.
12077 function Build_Spec return Node_Id is
12078 Out_P : constant Boolean := (Nam = TSS_Stream_Read);
12081 T_Ref : constant Node_Id := New_Occurrence_Of (Etyp, Loc);
12084 Subp_Id := Make_Defining_Identifier (Loc, Sname);
12086 -- S : access Root_Stream_Type'Class
12088 Formals := New_List (
12089 Make_Parameter_Specification (Loc,
12090 Defining_Identifier =>
12091 Make_Defining_Identifier (Loc, Name_S),
12093 Make_Access_Definition (Loc,
12095 New_Occurrence_Of (
12096 Designated_Type (Etype (F)), Loc))));
12098 if Nam = TSS_Stream_Input then
12100 Make_Function_Specification (Loc,
12101 Defining_Unit_Name => Subp_Id,
12102 Parameter_Specifications => Formals,
12103 Result_Definition => T_Ref);
12107 Append_To (Formals,
12108 Make_Parameter_Specification (Loc,
12109 Defining_Identifier => Make_Defining_Identifier (Loc, Name_V),
12110 Out_Present => Out_P,
12111 Parameter_Type => T_Ref));
12114 Make_Procedure_Specification (Loc,
12115 Defining_Unit_Name => Subp_Id,
12116 Parameter_Specifications => Formals);
12122 -- Start of processing for New_Stream_Subprogram
12125 F := First_Formal (Subp);
12127 if Ekind (Subp) = E_Procedure then
12128 Etyp := Etype (Next_Formal (F));
12130 Etyp := Etype (Subp);
12133 -- Prepare subprogram declaration and insert it as an action on the
12134 -- clause node. The visibility for this entity is used to test for
12135 -- visibility of the attribute definition clause (in the sense of
12136 -- 8.3(23) as amended by AI-195).
12138 if not Defer_Declaration then
12140 Make_Subprogram_Declaration (Loc,
12141 Specification => Build_Spec);
12143 -- For a tagged type, there is always a visible declaration for each
12144 -- stream TSS (it is a predefined primitive operation), and the
12145 -- completion of this declaration occurs at the freeze point, which is
12146 -- not always visible at places where the attribute definition clause is
12147 -- visible. So, we create a dummy entity here for the purpose of
12148 -- tracking the visibility of the attribute definition clause itself.
12152 Make_Defining_Identifier (Loc, New_External_Name (Sname, 'V'));
12154 Make_Object_Declaration (Loc,
12155 Defining_Identifier => Subp_Id,
12156 Object_Definition => New_Occurrence_Of (Standard_Boolean, Loc));
12159 if not Defer_Declaration
12160 and then From_Aspect_Specification (N)
12161 and then Has_Delayed_Freeze (Ent)
12163 Append_Freeze_Action (Ent, Subp_Decl);
12166 Insert_Action (N, Subp_Decl);
12167 Set_Entity (N, Subp_Id);
12171 Make_Subprogram_Renaming_Declaration (Loc,
12172 Specification => Build_Spec,
12173 Name => New_Occurrence_Of (Subp, Loc));
12175 if Defer_Declaration then
12176 Set_TSS (Base_Type (Ent), Subp_Id);
12179 if From_Aspect_Specification (N) then
12180 Append_Freeze_Action (Ent, Subp_Decl);
12182 Insert_Action (N, Subp_Decl);
12185 Copy_TSS (Subp_Id, Base_Type (Ent));
12187 end New_Stream_Subprogram;
12189 ------------------------------------------
12190 -- Push_Scope_And_Install_Discriminants --
12191 ------------------------------------------
12193 procedure Push_Scope_And_Install_Discriminants (E : Entity_Id) is
12195 if Has_Discriminants (E) then
12198 -- Make the discriminants visible for type declarations and protected
12199 -- type declarations, not for subtype declarations (RM 13.1.1 (12/3))
12201 if Nkind (Parent (E)) /= N_Subtype_Declaration then
12202 Install_Discriminants (E);
12205 end Push_Scope_And_Install_Discriminants;
12207 ------------------------
12208 -- Rep_Item_Too_Early --
12209 ------------------------
12211 function Rep_Item_Too_Early (T : Entity_Id; N : Node_Id) return Boolean is
12213 -- Cannot apply non-operational rep items to generic types
12215 if Is_Operational_Item (N) then
12219 and then Is_Generic_Type (Root_Type (T))
12220 and then (Nkind (N) /= N_Pragma
12221 or else Get_Pragma_Id (N) /= Pragma_Convention)
12223 Error_Msg_N ("representation item not allowed for generic type", N);
12227 -- Otherwise check for incomplete type
12229 if Is_Incomplete_Or_Private_Type (T)
12230 and then No (Underlying_Type (T))
12232 (Nkind (N) /= N_Pragma
12233 or else Get_Pragma_Id (N) /= Pragma_Import)
12236 ("representation item must be after full type declaration", N);
12239 -- If the type has incomplete components, a representation clause is
12240 -- illegal but stream attributes and Convention pragmas are correct.
12242 elsif Has_Private_Component (T) then
12243 if Nkind (N) = N_Pragma then
12248 ("representation item must appear after type is fully defined",
12255 end Rep_Item_Too_Early;
12257 -----------------------
12258 -- Rep_Item_Too_Late --
12259 -----------------------
12261 function Rep_Item_Too_Late
12264 FOnly : Boolean := False) return Boolean
12267 Parent_Type : Entity_Id;
12269 procedure No_Type_Rep_Item;
12270 -- Output message indicating that no type-related aspects can be
12271 -- specified due to some property of the parent type.
12273 procedure Too_Late;
12274 -- Output message for an aspect being specified too late
12276 -- Note that neither of the above errors is considered a serious one,
12277 -- since the effect is simply that we ignore the representation clause
12279 -- Is this really true? In any case if we make this change we must
12280 -- document the requirement in the spec of Rep_Item_Too_Late that
12281 -- if True is returned, then the rep item must be completely ignored???
12283 ----------------------
12284 -- No_Type_Rep_Item --
12285 ----------------------
12287 procedure No_Type_Rep_Item is
12289 Error_Msg_N ("|type-related representation item not permitted!", N);
12290 end No_Type_Rep_Item;
12296 procedure Too_Late is
12298 -- Other compilers seem more relaxed about rep items appearing too
12299 -- late. Since analysis tools typically don't care about rep items
12300 -- anyway, no reason to be too strict about this.
12302 if not Relaxed_RM_Semantics then
12303 Error_Msg_N ("|representation item appears too late!", N);
12307 -- Start of processing for Rep_Item_Too_Late
12310 -- First make sure entity is not frozen (RM 13.1(9))
12314 -- Exclude imported types, which may be frozen if they appear in a
12315 -- representation clause for a local type.
12317 and then not From_Limited_With (T)
12319 -- Exclude generated entities (not coming from source). The common
12320 -- case is when we generate a renaming which prematurely freezes the
12321 -- renamed internal entity, but we still want to be able to set copies
12322 -- of attribute values such as Size/Alignment.
12324 and then Comes_From_Source (T)
12326 -- A self-referential aspect is illegal if it forces freezing the
12327 -- entity before the corresponding pragma has been analyzed.
12329 if Nkind_In (N, N_Attribute_Definition_Clause, N_Pragma)
12330 and then From_Aspect_Specification (N)
12333 ("aspect specification causes premature freezing of&", N, T);
12334 Set_Has_Delayed_Freeze (T, False);
12339 S := First_Subtype (T);
12341 if Present (Freeze_Node (S)) then
12342 if not Relaxed_RM_Semantics then
12344 ("??no more representation items for }", Freeze_Node (S), S);
12350 -- Check for case of untagged derived type whose parent either has
12351 -- primitive operations, or is a by reference type (RM 13.1(10)). In
12352 -- this case we do not output a Too_Late message, since there is no
12353 -- earlier point where the rep item could be placed to make it legal.
12357 and then Is_Derived_Type (T)
12358 and then not Is_Tagged_Type (T)
12360 Parent_Type := Etype (Base_Type (T));
12362 if Has_Primitive_Operations (Parent_Type) then
12365 if not Relaxed_RM_Semantics then
12367 ("\parent type & has primitive operations!", N, Parent_Type);
12372 elsif Is_By_Reference_Type (Parent_Type) then
12375 if not Relaxed_RM_Semantics then
12377 ("\parent type & is a by reference type!", N, Parent_Type);
12384 -- No error, but one more warning to consider. The RM (surprisingly)
12385 -- allows this pattern:
12388 -- primitive operations for S
12389 -- type R is new S;
12390 -- rep clause for S
12392 -- Meaning that calls on the primitive operations of S for values of
12393 -- type R may require possibly expensive implicit conversion operations.
12394 -- This is not an error, but is worth a warning.
12396 if not Relaxed_RM_Semantics and then Is_Type (T) then
12398 DTL : constant Entity_Id := Derived_Type_Link (Base_Type (T));
12402 and then Has_Primitive_Operations (Base_Type (T))
12404 -- For now, do not generate this warning for the case of aspect
12405 -- specification using Ada 2012 syntax, since we get wrong
12406 -- messages we do not understand. The whole business of derived
12407 -- types and rep items seems a bit confused when aspects are
12408 -- used, since the aspects are not evaluated till freeze time.
12410 and then not From_Aspect_Specification (N)
12412 Error_Msg_Sloc := Sloc (DTL);
12414 ("representation item for& appears after derived type "
12415 & "declaration#??", N);
12417 ("\may result in implicit conversions for primitive "
12418 & "operations of&??", N, T);
12420 ("\to change representations when called with arguments "
12421 & "of type&??", N, DTL);
12426 -- No error, link item into head of chain of rep items for the entity,
12427 -- but avoid chaining if we have an overloadable entity, and the pragma
12428 -- is one that can apply to multiple overloaded entities.
12430 if Is_Overloadable (T) and then Nkind (N) = N_Pragma then
12432 Pname : constant Name_Id := Pragma_Name (N);
12434 if Nam_In (Pname, Name_Convention, Name_Import, Name_Export,
12435 Name_External, Name_Interface)
12442 Record_Rep_Item (T, N);
12444 end Rep_Item_Too_Late;
12446 -------------------------------------
12447 -- Replace_Type_References_Generic --
12448 -------------------------------------
12450 procedure Replace_Type_References_Generic (N : Node_Id; T : Entity_Id) is
12451 TName : constant Name_Id := Chars (T);
12453 function Replace_Type_Ref (N : Node_Id) return Traverse_Result;
12454 -- Processes a single node in the traversal procedure below, checking
12455 -- if node N should be replaced, and if so, doing the replacement.
12457 function Visible_Component (Comp : Name_Id) return Entity_Id;
12458 -- Given an identifier in the expression, check whether there is a
12459 -- discriminant or component of the type that is directy visible, and
12460 -- rewrite it as the corresponding selected component of the formal of
12461 -- the subprogram. The entity is located by a sequential search, which
12462 -- seems acceptable given the typical size of component lists and check
12463 -- expressions. Possible optimization ???
12465 ----------------------
12466 -- Replace_Type_Ref --
12467 ----------------------
12469 function Replace_Type_Ref (N : Node_Id) return Traverse_Result is
12470 Loc : constant Source_Ptr := Sloc (N);
12472 procedure Add_Prefix (Ref : Node_Id; Comp : Entity_Id);
12473 -- Add the proper prefix to a reference to a component of the type
12474 -- when it is not already a selected component.
12480 procedure Add_Prefix (Ref : Node_Id; Comp : Entity_Id) is
12483 Make_Selected_Component (Loc,
12484 Prefix => New_Occurrence_Of (T, Loc),
12485 Selector_Name => New_Occurrence_Of (Comp, Loc)));
12486 Replace_Type_Reference (Prefix (Ref));
12495 -- Start of processing for Replace_Type_Ref
12498 if Nkind (N) = N_Identifier then
12500 -- If not the type name, check whether it is a reference to some
12501 -- other type, which must be frozen before the predicate function
12502 -- is analyzed, i.e. before the freeze node of the type to which
12503 -- the predicate applies.
12505 if Chars (N) /= TName then
12506 if Present (Current_Entity (N))
12507 and then Is_Type (Current_Entity (N))
12509 Freeze_Before (Freeze_Node (T), Current_Entity (N));
12512 -- The components of the type are directly visible and can
12513 -- be referenced without a prefix.
12515 if Nkind (Parent (N)) = N_Selected_Component then
12518 -- In expression C (I), C may be a directly visible function
12519 -- or a visible component that has an array type. Disambiguate
12520 -- by examining the component type.
12522 elsif Nkind (Parent (N)) = N_Indexed_Component
12523 and then N = Prefix (Parent (N))
12525 Comp := Visible_Component (Chars (N));
12527 if Present (Comp) and then Is_Array_Type (Etype (Comp)) then
12528 Add_Prefix (N, Comp);
12532 Comp := Visible_Component (Chars (N));
12534 if Present (Comp) then
12535 Add_Prefix (N, Comp);
12541 -- Otherwise do the replacement and we are done with this node
12544 Replace_Type_Reference (N);
12548 -- Case of selected component (which is what a qualification looks
12549 -- like in the unanalyzed tree, which is what we have.
12551 elsif Nkind (N) = N_Selected_Component then
12553 -- If selector name is not our type, keeping going (we might still
12554 -- have an occurrence of the type in the prefix).
12556 if Nkind (Selector_Name (N)) /= N_Identifier
12557 or else Chars (Selector_Name (N)) /= TName
12561 -- Selector name is our type, check qualification
12564 -- Loop through scopes and prefixes, doing comparison
12566 Scop := Current_Scope;
12567 Pref := Prefix (N);
12569 -- Continue if no more scopes or scope with no name
12571 if No (Scop) or else Nkind (Scop) not in N_Has_Chars then
12575 -- Do replace if prefix is an identifier matching the scope
12576 -- that we are currently looking at.
12578 if Nkind (Pref) = N_Identifier
12579 and then Chars (Pref) = Chars (Scop)
12581 Replace_Type_Reference (N);
12585 -- Go check scope above us if prefix is itself of the form
12586 -- of a selected component, whose selector matches the scope
12587 -- we are currently looking at.
12589 if Nkind (Pref) = N_Selected_Component
12590 and then Nkind (Selector_Name (Pref)) = N_Identifier
12591 and then Chars (Selector_Name (Pref)) = Chars (Scop)
12593 Scop := Scope (Scop);
12594 Pref := Prefix (Pref);
12596 -- For anything else, we don't have a match, so keep on
12597 -- going, there are still some weird cases where we may
12598 -- still have a replacement within the prefix.
12606 -- Continue for any other node kind
12611 end Replace_Type_Ref;
12613 procedure Replace_Type_Refs is new Traverse_Proc (Replace_Type_Ref);
12615 -----------------------
12616 -- Visible_Component --
12617 -----------------------
12619 function Visible_Component (Comp : Name_Id) return Entity_Id is
12623 -- Types with nameable components are records and discriminated
12626 if Ekind (T) = E_Record_Type
12627 or else (Is_Private_Type (T) and then Has_Discriminants (T))
12629 E := First_Entity (T);
12630 while Present (E) loop
12631 if Comes_From_Source (E) and then Chars (E) = Comp then
12639 -- Nothing by that name, or the type has no components
12642 end Visible_Component;
12644 -- Start of processing for Replace_Type_References_Generic
12647 Replace_Type_Refs (N);
12648 end Replace_Type_References_Generic;
12650 --------------------------------
12651 -- Resolve_Aspect_Expressions --
12652 --------------------------------
12654 procedure Resolve_Aspect_Expressions (E : Entity_Id) is
12659 function Resolve_Name (N : Node_Id) return Traverse_Result;
12660 -- Verify that all identifiers in the expression, with the exception
12661 -- of references to the current entity, denote visible entities. This
12662 -- is done only to detect visibility errors, as the expression will be
12663 -- properly analyzed/expanded during analysis of the predicate function
12664 -- body. We omit quantified expressions from this test, given that they
12665 -- introduce a local identifier that would require proper expansion to
12666 -- handle properly.
12668 -- In ASIS_Mode we preserve the entity in the source because there is
12669 -- no subsequent expansion to decorate the tree.
12675 function Resolve_Name (N : Node_Id) return Traverse_Result is
12677 if Nkind (N) = N_Selected_Component then
12678 if Nkind (Prefix (N)) = N_Identifier
12679 and then Chars (Prefix (N)) /= Chars (E)
12681 Find_Selected_Component (N);
12686 elsif Nkind (N) = N_Identifier and then Chars (N) /= Chars (E) then
12687 Find_Direct_Name (N);
12689 if not ASIS_Mode then
12690 Set_Entity (N, Empty);
12693 elsif Nkind (N) = N_Quantified_Expression then
12700 procedure Resolve_Aspect_Expression is new Traverse_Proc (Resolve_Name);
12702 -- Start of processing for Resolve_Aspect_Expressions
12705 ASN := First_Rep_Item (E);
12706 while Present (ASN) loop
12707 if Nkind (ASN) = N_Aspect_Specification and then Entity (ASN) = E then
12708 A_Id := Get_Aspect_Id (ASN);
12709 Expr := Expression (ASN);
12713 -- For now we only deal with aspects that do not generate
12714 -- subprograms, or that may mention current instances of
12715 -- types. These will require special handling (???TBD).
12717 when Aspect_Invariant
12719 | Aspect_Predicate_Failure
12723 when Aspect_Dynamic_Predicate
12724 | Aspect_Static_Predicate
12726 -- Build predicate function specification and preanalyze
12727 -- expression after type replacement.
12729 if No (Predicate_Function (E)) then
12731 FDecl : constant Node_Id :=
12732 Build_Predicate_Function_Declaration (E);
12733 pragma Unreferenced (FDecl);
12735 Resolve_Aspect_Expression (Expr);
12739 when Pre_Post_Aspects =>
12742 when Aspect_Iterable =>
12743 if Nkind (Expr) = N_Aggregate then
12748 Assoc := First (Component_Associations (Expr));
12749 while Present (Assoc) loop
12750 Find_Direct_Name (Expression (Assoc));
12757 if Present (Expr) then
12758 case Aspect_Argument (A_Id) is
12760 | Optional_Expression
12762 Analyze_And_Resolve (Expression (ASN));
12767 if Nkind (Expr) = N_Identifier then
12768 Find_Direct_Name (Expr);
12770 elsif Nkind (Expr) = N_Selected_Component then
12771 Find_Selected_Component (Expr);
12778 ASN := Next_Rep_Item (ASN);
12780 end Resolve_Aspect_Expressions;
12782 -------------------------
12783 -- Same_Representation --
12784 -------------------------
12786 function Same_Representation (Typ1, Typ2 : Entity_Id) return Boolean is
12787 T1 : constant Entity_Id := Underlying_Type (Typ1);
12788 T2 : constant Entity_Id := Underlying_Type (Typ2);
12791 -- A quick check, if base types are the same, then we definitely have
12792 -- the same representation, because the subtype specific representation
12793 -- attributes (Size and Alignment) do not affect representation from
12794 -- the point of view of this test.
12796 if Base_Type (T1) = Base_Type (T2) then
12799 elsif Is_Private_Type (Base_Type (T2))
12800 and then Base_Type (T1) = Full_View (Base_Type (T2))
12805 -- Tagged types never have differing representations
12807 if Is_Tagged_Type (T1) then
12811 -- Representations are definitely different if conventions differ
12813 if Convention (T1) /= Convention (T2) then
12817 -- Representations are different if component alignments or scalar
12818 -- storage orders differ.
12820 if (Is_Record_Type (T1) or else Is_Array_Type (T1))
12822 (Is_Record_Type (T2) or else Is_Array_Type (T2))
12824 (Component_Alignment (T1) /= Component_Alignment (T2)
12825 or else Reverse_Storage_Order (T1) /= Reverse_Storage_Order (T2))
12830 -- For arrays, the only real issue is component size. If we know the
12831 -- component size for both arrays, and it is the same, then that's
12832 -- good enough to know we don't have a change of representation.
12834 if Is_Array_Type (T1) then
12835 if Known_Component_Size (T1)
12836 and then Known_Component_Size (T2)
12837 and then Component_Size (T1) = Component_Size (T2)
12843 -- Types definitely have same representation if neither has non-standard
12844 -- representation since default representations are always consistent.
12845 -- If only one has non-standard representation, and the other does not,
12846 -- then we consider that they do not have the same representation. They
12847 -- might, but there is no way of telling early enough.
12849 if Has_Non_Standard_Rep (T1) then
12850 if not Has_Non_Standard_Rep (T2) then
12854 return not Has_Non_Standard_Rep (T2);
12857 -- Here the two types both have non-standard representation, and we need
12858 -- to determine if they have the same non-standard representation.
12860 -- For arrays, we simply need to test if the component sizes are the
12861 -- same. Pragma Pack is reflected in modified component sizes, so this
12862 -- check also deals with pragma Pack.
12864 if Is_Array_Type (T1) then
12865 return Component_Size (T1) = Component_Size (T2);
12867 -- Tagged types always have the same representation, because it is not
12868 -- possible to specify different representations for common fields.
12870 elsif Is_Tagged_Type (T1) then
12873 -- Case of record types
12875 elsif Is_Record_Type (T1) then
12877 -- Packed status must conform
12879 if Is_Packed (T1) /= Is_Packed (T2) then
12882 -- Otherwise we must check components. Typ2 maybe a constrained
12883 -- subtype with fewer components, so we compare the components
12884 -- of the base types.
12887 Record_Case : declare
12888 CD1, CD2 : Entity_Id;
12890 function Same_Rep return Boolean;
12891 -- CD1 and CD2 are either components or discriminants. This
12892 -- function tests whether they have the same representation.
12898 function Same_Rep return Boolean is
12900 if No (Component_Clause (CD1)) then
12901 return No (Component_Clause (CD2));
12903 -- Note: at this point, component clauses have been
12904 -- normalized to the default bit order, so that the
12905 -- comparison of Component_Bit_Offsets is meaningful.
12908 Present (Component_Clause (CD2))
12910 Component_Bit_Offset (CD1) = Component_Bit_Offset (CD2)
12912 Esize (CD1) = Esize (CD2);
12916 -- Start of processing for Record_Case
12919 if Has_Discriminants (T1) then
12921 -- The number of discriminants may be different if the
12922 -- derived type has fewer (constrained by values). The
12923 -- invisible discriminants retain the representation of
12924 -- the original, so the discrepancy does not per se
12925 -- indicate a different representation.
12927 CD1 := First_Discriminant (T1);
12928 CD2 := First_Discriminant (T2);
12929 while Present (CD1) and then Present (CD2) loop
12930 if not Same_Rep then
12933 Next_Discriminant (CD1);
12934 Next_Discriminant (CD2);
12939 CD1 := First_Component (Underlying_Type (Base_Type (T1)));
12940 CD2 := First_Component (Underlying_Type (Base_Type (T2)));
12941 while Present (CD1) loop
12942 if not Same_Rep then
12945 Next_Component (CD1);
12946 Next_Component (CD2);
12954 -- For enumeration types, we must check each literal to see if the
12955 -- representation is the same. Note that we do not permit enumeration
12956 -- representation clauses for Character and Wide_Character, so these
12957 -- cases were already dealt with.
12959 elsif Is_Enumeration_Type (T1) then
12960 Enumeration_Case : declare
12961 L1, L2 : Entity_Id;
12964 L1 := First_Literal (T1);
12965 L2 := First_Literal (T2);
12966 while Present (L1) loop
12967 if Enumeration_Rep (L1) /= Enumeration_Rep (L2) then
12976 end Enumeration_Case;
12978 -- Any other types have the same representation for these purposes
12983 end Same_Representation;
12985 --------------------------------
12986 -- Resolve_Iterable_Operation --
12987 --------------------------------
12989 procedure Resolve_Iterable_Operation
12991 Cursor : Entity_Id;
13000 if not Is_Overloaded (N) then
13001 if not Is_Entity_Name (N)
13002 or else Ekind (Entity (N)) /= E_Function
13003 or else Scope (Entity (N)) /= Scope (Typ)
13004 or else No (First_Formal (Entity (N)))
13005 or else Etype (First_Formal (Entity (N))) /= Typ
13007 Error_Msg_N ("iterable primitive must be local function name "
13008 & "whose first formal is an iterable type", N);
13013 F1 := First_Formal (Ent);
13014 if Nam = Name_First then
13016 -- First (Container) => Cursor
13018 if Etype (Ent) /= Cursor then
13019 Error_Msg_N ("primitive for First must yield a curosr", N);
13022 elsif Nam = Name_Next then
13024 -- Next (Container, Cursor) => Cursor
13026 F2 := Next_Formal (F1);
13028 if Etype (F2) /= Cursor
13029 or else Etype (Ent) /= Cursor
13030 or else Present (Next_Formal (F2))
13032 Error_Msg_N ("no match for Next iterable primitive", N);
13035 elsif Nam = Name_Has_Element then
13037 -- Has_Element (Container, Cursor) => Boolean
13039 F2 := Next_Formal (F1);
13040 if Etype (F2) /= Cursor
13041 or else Etype (Ent) /= Standard_Boolean
13042 or else Present (Next_Formal (F2))
13044 Error_Msg_N ("no match for Has_Element iterable primitive", N);
13047 elsif Nam = Name_Element then
13048 F2 := Next_Formal (F1);
13051 or else Etype (F2) /= Cursor
13052 or else Present (Next_Formal (F2))
13054 Error_Msg_N ("no match for Element iterable primitive", N);
13059 raise Program_Error;
13063 -- Overloaded case: find subprogram with proper signature.
13064 -- Caller will report error if no match is found.
13071 Get_First_Interp (N, I, It);
13072 while Present (It.Typ) loop
13073 if Ekind (It.Nam) = E_Function
13074 and then Scope (It.Nam) = Scope (Typ)
13075 and then Etype (First_Formal (It.Nam)) = Typ
13077 F1 := First_Formal (It.Nam);
13079 if Nam = Name_First then
13080 if Etype (It.Nam) = Cursor
13081 and then No (Next_Formal (F1))
13083 Set_Entity (N, It.Nam);
13087 elsif Nam = Name_Next then
13088 F2 := Next_Formal (F1);
13091 and then No (Next_Formal (F2))
13092 and then Etype (F2) = Cursor
13093 and then Etype (It.Nam) = Cursor
13095 Set_Entity (N, It.Nam);
13099 elsif Nam = Name_Has_Element then
13100 F2 := Next_Formal (F1);
13103 and then No (Next_Formal (F2))
13104 and then Etype (F2) = Cursor
13105 and then Etype (It.Nam) = Standard_Boolean
13107 Set_Entity (N, It.Nam);
13108 F2 := Next_Formal (F1);
13112 elsif Nam = Name_Element then
13113 F2 := Next_Formal (F1);
13116 and then No (Next_Formal (F2))
13117 and then Etype (F2) = Cursor
13119 Set_Entity (N, It.Nam);
13125 Get_Next_Interp (I, It);
13129 end Resolve_Iterable_Operation;
13135 procedure Set_Biased
13139 Biased : Boolean := True)
13143 Set_Has_Biased_Representation (E);
13145 if Warn_On_Biased_Representation then
13147 ("?B?" & Msg & " forces biased representation for&", N, E);
13152 --------------------
13153 -- Set_Enum_Esize --
13154 --------------------
13156 procedure Set_Enum_Esize (T : Entity_Id) is
13162 Init_Alignment (T);
13164 -- Find the minimum standard size (8,16,32,64) that fits
13166 Lo := Enumeration_Rep (Entity (Type_Low_Bound (T)));
13167 Hi := Enumeration_Rep (Entity (Type_High_Bound (T)));
13170 if Lo >= -Uint_2**07 and then Hi < Uint_2**07 then
13171 Sz := Standard_Character_Size; -- May be > 8 on some targets
13173 elsif Lo >= -Uint_2**15 and then Hi < Uint_2**15 then
13176 elsif Lo >= -Uint_2**31 and then Hi < Uint_2**31 then
13179 else pragma Assert (Lo >= -Uint_2**63 and then Hi < Uint_2**63);
13184 if Hi < Uint_2**08 then
13185 Sz := Standard_Character_Size; -- May be > 8 on some targets
13187 elsif Hi < Uint_2**16 then
13190 elsif Hi < Uint_2**32 then
13193 else pragma Assert (Hi < Uint_2**63);
13198 -- That minimum is the proper size unless we have a foreign convention
13199 -- and the size required is 32 or less, in which case we bump the size
13200 -- up to 32. This is required for C and C++ and seems reasonable for
13201 -- all other foreign conventions.
13203 if Has_Foreign_Convention (T)
13204 and then Esize (T) < Standard_Integer_Size
13206 -- Don't do this if Short_Enums on target
13208 and then not Target_Short_Enums
13210 Init_Esize (T, Standard_Integer_Size);
13212 Init_Esize (T, Sz);
13214 end Set_Enum_Esize;
13216 -----------------------------
13217 -- Uninstall_Discriminants --
13218 -----------------------------
13220 procedure Uninstall_Discriminants (E : Entity_Id) is
13226 -- Discriminants have been made visible for type declarations and
13227 -- protected type declarations, not for subtype declarations.
13229 if Nkind (Parent (E)) /= N_Subtype_Declaration then
13230 Disc := First_Discriminant (E);
13231 while Present (Disc) loop
13232 if Disc /= Current_Entity (Disc) then
13233 Prev := Current_Entity (Disc);
13234 while Present (Prev)
13235 and then Present (Homonym (Prev))
13236 and then Homonym (Prev) /= Disc
13238 Prev := Homonym (Prev);
13244 Set_Is_Immediately_Visible (Disc, False);
13246 Outer := Homonym (Disc);
13247 while Present (Outer) and then Scope (Outer) = E loop
13248 Outer := Homonym (Outer);
13251 -- Reset homonym link of other entities, but do not modify link
13252 -- between entities in current scope, so that the back end can
13253 -- have a proper count of local overloadings.
13256 Set_Name_Entity_Id (Chars (Disc), Outer);
13258 elsif Scope (Prev) /= Scope (Disc) then
13259 Set_Homonym (Prev, Outer);
13262 Next_Discriminant (Disc);
13265 end Uninstall_Discriminants;
13267 -------------------------------------------
13268 -- Uninstall_Discriminants_And_Pop_Scope --
13269 -------------------------------------------
13271 procedure Uninstall_Discriminants_And_Pop_Scope (E : Entity_Id) is
13273 if Has_Discriminants (E) then
13274 Uninstall_Discriminants (E);
13277 end Uninstall_Discriminants_And_Pop_Scope;
13279 ------------------------------
13280 -- Validate_Address_Clauses --
13281 ------------------------------
13283 procedure Validate_Address_Clauses is
13284 function Offset_Value (Expr : Node_Id) return Uint;
13285 -- Given an Address attribute reference, return the value in bits of its
13286 -- offset from the first bit of the underlying entity, or 0 if it is not
13287 -- known at compile time.
13293 function Offset_Value (Expr : Node_Id) return Uint is
13294 N : Node_Id := Prefix (Expr);
13296 Val : Uint := Uint_0;
13299 -- Climb the prefix chain and compute the cumulative offset
13302 if Is_Entity_Name (N) then
13305 elsif Nkind (N) = N_Selected_Component then
13306 Off := Component_Bit_Offset (Entity (Selector_Name (N)));
13307 if Off /= No_Uint and then Off >= Uint_0 then
13314 elsif Nkind (N) = N_Indexed_Component then
13315 Off := Indexed_Component_Bit_Offset (N);
13316 if Off /= No_Uint then
13329 -- Start of processing for Validate_Address_Clauses
13332 for J in Address_Clause_Checks.First .. Address_Clause_Checks.Last loop
13334 ACCR : Address_Clause_Check_Record
13335 renames Address_Clause_Checks.Table (J);
13339 X_Alignment : Uint;
13340 Y_Alignment : Uint;
13348 -- Skip processing of this entry if warning already posted
13350 if not Address_Warning_Posted (ACCR.N) then
13351 Expr := Original_Node (Expression (ACCR.N));
13353 -- Get alignments, sizes and offset, if any
13355 X_Alignment := Alignment (ACCR.X);
13356 X_Size := Esize (ACCR.X);
13358 if Present (ACCR.Y) then
13359 Y_Alignment := Alignment (ACCR.Y);
13360 Y_Size := Esize (ACCR.Y);
13364 and then Nkind (Expr) = N_Attribute_Reference
13365 and then Attribute_Name (Expr) = Name_Address
13367 X_Offs := Offset_Value (Expr);
13372 -- Check for known value not multiple of alignment
13374 if No (ACCR.Y) then
13375 if not Alignment_Checks_Suppressed (ACCR.X)
13376 and then X_Alignment /= 0
13377 and then ACCR.A mod X_Alignment /= 0
13380 ("??specified address for& is inconsistent with "
13381 & "alignment", ACCR.N, ACCR.X);
13383 ("\??program execution may be erroneous (RM 13.3(27))",
13386 Error_Msg_Uint_1 := X_Alignment;
13387 Error_Msg_NE ("\??alignment of & is ^", ACCR.N, ACCR.X);
13390 -- Check for large object overlaying smaller one
13392 elsif Y_Size > Uint_0
13393 and then X_Size > Uint_0
13394 and then X_Offs + X_Size > Y_Size
13396 Error_Msg_NE ("??& overlays smaller object", ACCR.N, ACCR.X);
13398 ("\??program execution may be erroneous", ACCR.N);
13400 Error_Msg_Uint_1 := X_Size;
13401 Error_Msg_NE ("\??size of & is ^", ACCR.N, ACCR.X);
13403 Error_Msg_Uint_1 := Y_Size;
13404 Error_Msg_NE ("\??size of & is ^", ACCR.N, ACCR.Y);
13406 if Y_Size >= X_Size then
13407 Error_Msg_Uint_1 := X_Offs;
13408 Error_Msg_NE ("\??but offset of & is ^", ACCR.N, ACCR.X);
13411 -- Check for inadequate alignment, both of the base object
13412 -- and of the offset, if any. We only do this check if the
13413 -- run-time Alignment_Check is active. No point in warning
13414 -- if this check has been suppressed (or is suppressed by
13415 -- default in the non-strict alignment machine case).
13417 -- Note: we do not check the alignment if we gave a size
13418 -- warning, since it would likely be redundant.
13420 elsif not Alignment_Checks_Suppressed (ACCR.X)
13421 and then Y_Alignment /= Uint_0
13423 (Y_Alignment < X_Alignment
13426 and then Nkind (Expr) = N_Attribute_Reference
13427 and then Attribute_Name (Expr) = Name_Address
13428 and then Has_Compatible_Alignment
13429 (ACCR.X, Prefix (Expr), True) /=
13433 ("??specified address for& may be inconsistent with "
13434 & "alignment", ACCR.N, ACCR.X);
13436 ("\??program execution may be erroneous (RM 13.3(27))",
13439 Error_Msg_Uint_1 := X_Alignment;
13440 Error_Msg_NE ("\??alignment of & is ^", ACCR.N, ACCR.X);
13442 Error_Msg_Uint_1 := Y_Alignment;
13443 Error_Msg_NE ("\??alignment of & is ^", ACCR.N, ACCR.Y);
13445 if Y_Alignment >= X_Alignment then
13447 ("\??but offset is not multiple of alignment", ACCR.N);
13453 end Validate_Address_Clauses;
13455 -----------------------------------------
13456 -- Validate_Compile_Time_Warning_Error --
13457 -----------------------------------------
13459 procedure Validate_Compile_Time_Warning_Error (N : Node_Id) is
13461 Compile_Time_Warnings_Errors.Append
13462 (New_Val => CTWE_Entry'(Eloc => Sloc (N),
13463 Scope => Current_Scope,
13465 end Validate_Compile_Time_Warning_Error;
13467 ------------------------------------------
13468 -- Validate_Compile_Time_Warning_Errors --
13469 ------------------------------------------
13471 procedure Validate_Compile_Time_Warning_Errors is
13472 procedure Set_Scope (S : Entity_Id);
13473 -- Install all enclosing scopes of S along with S itself
13475 procedure Unset_Scope (S : Entity_Id);
13476 -- Uninstall all enclosing scopes of S along with S itself
13482 procedure Set_Scope (S : Entity_Id) is
13484 if S /= Standard_Standard then
13485 Set_Scope (Scope (S));
13495 procedure Unset_Scope (S : Entity_Id) is
13497 if S /= Standard_Standard then
13498 Unset_Scope (Scope (S));
13504 -- Start of processing for Validate_Compile_Time_Warning_Errors
13507 Expander_Mode_Save_And_Set (False);
13508 In_Compile_Time_Warning_Or_Error := True;
13510 for N in Compile_Time_Warnings_Errors.First ..
13511 Compile_Time_Warnings_Errors.Last
13514 T : CTWE_Entry renames Compile_Time_Warnings_Errors.Table (N);
13517 Set_Scope (T.Scope);
13518 Reset_Analyzed_Flags (T.Prag);
13519 Process_Compile_Time_Warning_Or_Error (T.Prag, T.Eloc);
13520 Unset_Scope (T.Scope);
13524 In_Compile_Time_Warning_Or_Error := False;
13525 Expander_Mode_Restore;
13526 end Validate_Compile_Time_Warning_Errors;
13528 ---------------------------
13529 -- Validate_Independence --
13530 ---------------------------
13532 procedure Validate_Independence is
13533 SU : constant Uint := UI_From_Int (System_Storage_Unit);
13541 procedure Check_Array_Type (Atyp : Entity_Id);
13542 -- Checks if the array type Atyp has independent components, and
13543 -- if not, outputs an appropriate set of error messages.
13545 procedure No_Independence;
13546 -- Output message that independence cannot be guaranteed
13548 function OK_Component (C : Entity_Id) return Boolean;
13549 -- Checks one component to see if it is independently accessible, and
13550 -- if so yields True, otherwise yields False if independent access
13551 -- cannot be guaranteed. This is a conservative routine, it only
13552 -- returns True if it knows for sure, it returns False if it knows
13553 -- there is a problem, or it cannot be sure there is no problem.
13555 procedure Reason_Bad_Component (C : Entity_Id);
13556 -- Outputs continuation message if a reason can be determined for
13557 -- the component C being bad.
13559 ----------------------
13560 -- Check_Array_Type --
13561 ----------------------
13563 procedure Check_Array_Type (Atyp : Entity_Id) is
13564 Ctyp : constant Entity_Id := Component_Type (Atyp);
13567 -- OK if no alignment clause, no pack, and no component size
13569 if not Has_Component_Size_Clause (Atyp)
13570 and then not Has_Alignment_Clause (Atyp)
13571 and then not Is_Packed (Atyp)
13576 -- Case of component size is greater than or equal to 64 and the
13577 -- alignment of the array is at least as large as the alignment
13578 -- of the component. We are definitely OK in this situation.
13580 if Known_Component_Size (Atyp)
13581 and then Component_Size (Atyp) >= 64
13582 and then Known_Alignment (Atyp)
13583 and then Known_Alignment (Ctyp)
13584 and then Alignment (Atyp) >= Alignment (Ctyp)
13589 -- Check actual component size
13591 if not Known_Component_Size (Atyp)
13592 or else not (Addressable (Component_Size (Atyp))
13593 and then Component_Size (Atyp) < 64)
13594 or else Component_Size (Atyp) mod Esize (Ctyp) /= 0
13598 -- Bad component size, check reason
13600 if Has_Component_Size_Clause (Atyp) then
13601 P := Get_Attribute_Definition_Clause
13602 (Atyp, Attribute_Component_Size);
13604 if Present (P) then
13605 Error_Msg_Sloc := Sloc (P);
13606 Error_Msg_N ("\because of Component_Size clause#", N);
13611 if Is_Packed (Atyp) then
13612 P := Get_Rep_Pragma (Atyp, Name_Pack);
13614 if Present (P) then
13615 Error_Msg_Sloc := Sloc (P);
13616 Error_Msg_N ("\because of pragma Pack#", N);
13621 -- No reason found, just return
13626 -- Array type is OK independence-wise
13629 end Check_Array_Type;
13631 ---------------------
13632 -- No_Independence --
13633 ---------------------
13635 procedure No_Independence is
13637 if Pragma_Name (N) = Name_Independent then
13638 Error_Msg_NE ("independence cannot be guaranteed for&", N, E);
13641 ("independent components cannot be guaranteed for&", N, E);
13643 end No_Independence;
13649 function OK_Component (C : Entity_Id) return Boolean is
13650 Rec : constant Entity_Id := Scope (C);
13651 Ctyp : constant Entity_Id := Etype (C);
13654 -- OK if no component clause, no Pack, and no alignment clause
13656 if No (Component_Clause (C))
13657 and then not Is_Packed (Rec)
13658 and then not Has_Alignment_Clause (Rec)
13663 -- Here we look at the actual component layout. A component is
13664 -- addressable if its size is a multiple of the Esize of the
13665 -- component type, and its starting position in the record has
13666 -- appropriate alignment, and the record itself has appropriate
13667 -- alignment to guarantee the component alignment.
13669 -- Make sure sizes are static, always assume the worst for any
13670 -- cases where we cannot check static values.
13672 if not (Known_Static_Esize (C)
13674 Known_Static_Esize (Ctyp))
13679 -- Size of component must be addressable or greater than 64 bits
13680 -- and a multiple of bytes.
13682 if not Addressable (Esize (C)) and then Esize (C) < Uint_64 then
13686 -- Check size is proper multiple
13688 if Esize (C) mod Esize (Ctyp) /= 0 then
13692 -- Check alignment of component is OK
13694 if not Known_Component_Bit_Offset (C)
13695 or else Component_Bit_Offset (C) < Uint_0
13696 or else Component_Bit_Offset (C) mod Esize (Ctyp) /= 0
13701 -- Check alignment of record type is OK
13703 if not Known_Alignment (Rec)
13704 or else (Alignment (Rec) * SU) mod Esize (Ctyp) /= 0
13709 -- All tests passed, component is addressable
13714 --------------------------
13715 -- Reason_Bad_Component --
13716 --------------------------
13718 procedure Reason_Bad_Component (C : Entity_Id) is
13719 Rec : constant Entity_Id := Scope (C);
13720 Ctyp : constant Entity_Id := Etype (C);
13723 -- If component clause present assume that's the problem
13725 if Present (Component_Clause (C)) then
13726 Error_Msg_Sloc := Sloc (Component_Clause (C));
13727 Error_Msg_N ("\because of Component_Clause#", N);
13731 -- If pragma Pack clause present, assume that's the problem
13733 if Is_Packed (Rec) then
13734 P := Get_Rep_Pragma (Rec, Name_Pack);
13736 if Present (P) then
13737 Error_Msg_Sloc := Sloc (P);
13738 Error_Msg_N ("\because of pragma Pack#", N);
13743 -- See if record has bad alignment clause
13745 if Has_Alignment_Clause (Rec)
13746 and then Known_Alignment (Rec)
13747 and then (Alignment (Rec) * SU) mod Esize (Ctyp) /= 0
13749 P := Get_Attribute_Definition_Clause (Rec, Attribute_Alignment);
13751 if Present (P) then
13752 Error_Msg_Sloc := Sloc (P);
13753 Error_Msg_N ("\because of Alignment clause#", N);
13757 -- Couldn't find a reason, so return without a message
13760 end Reason_Bad_Component;
13762 -- Start of processing for Validate_Independence
13765 for J in Independence_Checks.First .. Independence_Checks.Last loop
13766 N := Independence_Checks.Table (J).N;
13767 E := Independence_Checks.Table (J).E;
13768 IC := Pragma_Name (N) = Name_Independent_Components;
13770 -- Deal with component case
13772 if Ekind (E) = E_Discriminant or else Ekind (E) = E_Component then
13773 if not OK_Component (E) then
13775 Reason_Bad_Component (E);
13780 -- Deal with record with Independent_Components
13782 if IC and then Is_Record_Type (E) then
13783 Comp := First_Component_Or_Discriminant (E);
13784 while Present (Comp) loop
13785 if not OK_Component (Comp) then
13787 Reason_Bad_Component (Comp);
13791 Next_Component_Or_Discriminant (Comp);
13795 -- Deal with address clause case
13797 if Is_Object (E) then
13798 Addr := Address_Clause (E);
13800 if Present (Addr) then
13802 Error_Msg_Sloc := Sloc (Addr);
13803 Error_Msg_N ("\because of Address clause#", N);
13808 -- Deal with independent components for array type
13810 if IC and then Is_Array_Type (E) then
13811 Check_Array_Type (E);
13814 -- Deal with independent components for array object
13816 if IC and then Is_Object (E) and then Is_Array_Type (Etype (E)) then
13817 Check_Array_Type (Etype (E));
13822 end Validate_Independence;
13824 ------------------------------
13825 -- Validate_Iterable_Aspect --
13826 ------------------------------
13828 procedure Validate_Iterable_Aspect (Typ : Entity_Id; ASN : Node_Id) is
13833 Cursor : constant Entity_Id := Get_Cursor_Type (ASN, Typ);
13835 First_Id : Entity_Id;
13836 Next_Id : Entity_Id;
13837 Has_Element_Id : Entity_Id;
13838 Element_Id : Entity_Id;
13841 -- If previous error aspect is unusable
13843 if Cursor = Any_Type then
13849 Has_Element_Id := Empty;
13850 Element_Id := Empty;
13852 -- Each expression must resolve to a function with the proper signature
13854 Assoc := First (Component_Associations (Expression (ASN)));
13855 while Present (Assoc) loop
13856 Expr := Expression (Assoc);
13859 Prim := First (Choices (Assoc));
13861 if Nkind (Prim) /= N_Identifier or else Present (Next (Prim)) then
13862 Error_Msg_N ("illegal name in association", Prim);
13864 elsif Chars (Prim) = Name_First then
13865 Resolve_Iterable_Operation (Expr, Cursor, Typ, Name_First);
13866 First_Id := Entity (Expr);
13868 elsif Chars (Prim) = Name_Next then
13869 Resolve_Iterable_Operation (Expr, Cursor, Typ, Name_Next);
13870 Next_Id := Entity (Expr);
13872 elsif Chars (Prim) = Name_Has_Element then
13873 Resolve_Iterable_Operation (Expr, Cursor, Typ, Name_Has_Element);
13874 Has_Element_Id := Entity (Expr);
13876 elsif Chars (Prim) = Name_Element then
13877 Resolve_Iterable_Operation (Expr, Cursor, Typ, Name_Element);
13878 Element_Id := Entity (Expr);
13881 Error_Msg_N ("invalid name for iterable function", Prim);
13887 if No (First_Id) then
13888 Error_Msg_N ("match for First primitive not found", ASN);
13890 elsif No (Next_Id) then
13891 Error_Msg_N ("match for Next primitive not found", ASN);
13893 elsif No (Has_Element_Id) then
13894 Error_Msg_N ("match for Has_Element primitive not found", ASN);
13896 elsif No (Element_Id) then
13899 end Validate_Iterable_Aspect;
13901 -----------------------------------
13902 -- Validate_Unchecked_Conversion --
13903 -----------------------------------
13905 procedure Validate_Unchecked_Conversion
13907 Act_Unit : Entity_Id)
13909 Source : Entity_Id;
13910 Target : Entity_Id;
13914 -- Obtain source and target types. Note that we call Ancestor_Subtype
13915 -- here because the processing for generic instantiation always makes
13916 -- subtypes, and we want the original frozen actual types.
13918 -- If we are dealing with private types, then do the check on their
13919 -- fully declared counterparts if the full declarations have been
13920 -- encountered (they don't have to be visible, but they must exist).
13922 Source := Ancestor_Subtype (Etype (First_Formal (Act_Unit)));
13924 if Is_Private_Type (Source)
13925 and then Present (Underlying_Type (Source))
13927 Source := Underlying_Type (Source);
13930 Target := Ancestor_Subtype (Etype (Act_Unit));
13932 -- If either type is generic, the instantiation happens within a generic
13933 -- unit, and there is nothing to check. The proper check will happen
13934 -- when the enclosing generic is instantiated.
13936 if Is_Generic_Type (Source) or else Is_Generic_Type (Target) then
13940 if Is_Private_Type (Target)
13941 and then Present (Underlying_Type (Target))
13943 Target := Underlying_Type (Target);
13946 -- Source may be unconstrained array, but not target, except in relaxed
13949 if Is_Array_Type (Target)
13950 and then not Is_Constrained (Target)
13951 and then not Relaxed_RM_Semantics
13954 ("unchecked conversion to unconstrained array not allowed", N);
13958 -- Warn if conversion between two different convention pointers
13960 if Is_Access_Type (Target)
13961 and then Is_Access_Type (Source)
13962 and then Convention (Target) /= Convention (Source)
13963 and then Warn_On_Unchecked_Conversion
13965 -- Give warnings for subprogram pointers only on most targets
13967 if Is_Access_Subprogram_Type (Target)
13968 or else Is_Access_Subprogram_Type (Source)
13971 ("?z?conversion between pointers with different conventions!",
13976 -- Warn if one of the operands is Ada.Calendar.Time. Do not emit a
13977 -- warning when compiling GNAT-related sources.
13979 if Warn_On_Unchecked_Conversion
13980 and then not In_Predefined_Unit (N)
13981 and then RTU_Loaded (Ada_Calendar)
13982 and then (Chars (Source) = Name_Time
13984 Chars (Target) = Name_Time)
13986 -- If Ada.Calendar is loaded and the name of one of the operands is
13987 -- Time, there is a good chance that this is Ada.Calendar.Time.
13990 Calendar_Time : constant Entity_Id := Full_View (RTE (RO_CA_Time));
13992 pragma Assert (Present (Calendar_Time));
13994 if Source = Calendar_Time or else Target = Calendar_Time then
13996 ("?z?representation of 'Time values may change between "
13997 & "'G'N'A'T versions", N);
14002 -- Make entry in unchecked conversion table for later processing by
14003 -- Validate_Unchecked_Conversions, which will check sizes and alignments
14004 -- (using values set by the back end where possible). This is only done
14005 -- if the appropriate warning is active.
14007 if Warn_On_Unchecked_Conversion then
14008 Unchecked_Conversions.Append
14009 (New_Val => UC_Entry'(Eloc => Sloc (N),
14012 Act_Unit => Act_Unit));
14014 -- If both sizes are known statically now, then back-end annotation
14015 -- is not required to do a proper check but if either size is not
14016 -- known statically, then we need the annotation.
14018 if Known_Static_RM_Size (Source)
14020 Known_Static_RM_Size (Target)
14024 Back_Annotate_Rep_Info := True;
14028 -- If unchecked conversion to access type, and access type is declared
14029 -- in the same unit as the unchecked conversion, then set the flag
14030 -- No_Strict_Aliasing (no strict aliasing is implicit here)
14032 if Is_Access_Type (Target) and then
14033 In_Same_Source_Unit (Target, N)
14035 Set_No_Strict_Aliasing (Implementation_Base_Type (Target));
14038 -- Generate N_Validate_Unchecked_Conversion node for back end in case
14039 -- the back end needs to perform special validation checks.
14041 -- Shouldn't this be in Exp_Ch13, since the check only gets done if we
14042 -- have full expansion and the back end is called ???
14045 Make_Validate_Unchecked_Conversion (Sloc (N));
14046 Set_Source_Type (Vnode, Source);
14047 Set_Target_Type (Vnode, Target);
14049 -- If the unchecked conversion node is in a list, just insert before it.
14050 -- If not we have some strange case, not worth bothering about.
14052 if Is_List_Member (N) then
14053 Insert_After (N, Vnode);
14055 end Validate_Unchecked_Conversion;
14057 ------------------------------------
14058 -- Validate_Unchecked_Conversions --
14059 ------------------------------------
14061 procedure Validate_Unchecked_Conversions is
14063 for N in Unchecked_Conversions.First .. Unchecked_Conversions.Last loop
14065 T : UC_Entry renames Unchecked_Conversions.Table (N);
14067 Act_Unit : constant Entity_Id := T.Act_Unit;
14068 Eloc : constant Source_Ptr := T.Eloc;
14069 Source : constant Entity_Id := T.Source;
14070 Target : constant Entity_Id := T.Target;
14076 -- Skip if function marked as warnings off
14078 if Warnings_Off (Act_Unit) then
14082 -- This validation check, which warns if we have unequal sizes for
14083 -- unchecked conversion, and thus potentially implementation
14084 -- dependent semantics, is one of the few occasions on which we
14085 -- use the official RM size instead of Esize. See description in
14086 -- Einfo "Handling of Type'Size Values" for details.
14088 if Serious_Errors_Detected = 0
14089 and then Known_Static_RM_Size (Source)
14090 and then Known_Static_RM_Size (Target)
14092 -- Don't do the check if warnings off for either type, note the
14093 -- deliberate use of OR here instead of OR ELSE to get the flag
14094 -- Warnings_Off_Used set for both types if appropriate.
14096 and then not (Has_Warnings_Off (Source)
14098 Has_Warnings_Off (Target))
14100 Source_Siz := RM_Size (Source);
14101 Target_Siz := RM_Size (Target);
14103 if Source_Siz /= Target_Siz then
14105 ("?z?types for unchecked conversion have different sizes!",
14108 if All_Errors_Mode then
14109 Error_Msg_Name_1 := Chars (Source);
14110 Error_Msg_Uint_1 := Source_Siz;
14111 Error_Msg_Name_2 := Chars (Target);
14112 Error_Msg_Uint_2 := Target_Siz;
14113 Error_Msg ("\size of % is ^, size of % is ^?z?", Eloc);
14115 Error_Msg_Uint_1 := UI_Abs (Source_Siz - Target_Siz);
14117 if Is_Discrete_Type (Source)
14119 Is_Discrete_Type (Target)
14121 if Source_Siz > Target_Siz then
14123 ("\?z?^ high order bits of source will "
14124 & "be ignored!", Eloc);
14126 elsif Is_Unsigned_Type (Source) then
14128 ("\?z?source will be extended with ^ high order "
14129 & "zero bits!", Eloc);
14133 ("\?z?source will be extended with ^ high order "
14134 & "sign bits!", Eloc);
14137 elsif Source_Siz < Target_Siz then
14138 if Is_Discrete_Type (Target) then
14139 if Bytes_Big_Endian then
14141 ("\?z?target value will include ^ undefined "
14142 & "low order bits!", Eloc);
14145 ("\?z?target value will include ^ undefined "
14146 & "high order bits!", Eloc);
14151 ("\?z?^ trailing bits of target value will be "
14152 & "undefined!", Eloc);
14155 else pragma Assert (Source_Siz > Target_Siz);
14156 if Is_Discrete_Type (Source) then
14157 if Bytes_Big_Endian then
14159 ("\?z?^ low order bits of source will be "
14160 & "ignored!", Eloc);
14163 ("\?z?^ high order bits of source will be "
14164 & "ignored!", Eloc);
14169 ("\?z?^ trailing bits of source will be "
14170 & "ignored!", Eloc);
14177 -- If both types are access types, we need to check the alignment.
14178 -- If the alignment of both is specified, we can do it here.
14180 if Serious_Errors_Detected = 0
14181 and then Is_Access_Type (Source)
14182 and then Is_Access_Type (Target)
14183 and then Target_Strict_Alignment
14184 and then Present (Designated_Type (Source))
14185 and then Present (Designated_Type (Target))
14188 D_Source : constant Entity_Id := Designated_Type (Source);
14189 D_Target : constant Entity_Id := Designated_Type (Target);
14192 if Known_Alignment (D_Source)
14194 Known_Alignment (D_Target)
14197 Source_Align : constant Uint := Alignment (D_Source);
14198 Target_Align : constant Uint := Alignment (D_Target);
14201 if Source_Align < Target_Align
14202 and then not Is_Tagged_Type (D_Source)
14204 -- Suppress warning if warnings suppressed on either
14205 -- type or either designated type. Note the use of
14206 -- OR here instead of OR ELSE. That is intentional,
14207 -- we would like to set flag Warnings_Off_Used in
14208 -- all types for which warnings are suppressed.
14210 and then not (Has_Warnings_Off (D_Source)
14212 Has_Warnings_Off (D_Target)
14214 Has_Warnings_Off (Source)
14216 Has_Warnings_Off (Target))
14218 Error_Msg_Uint_1 := Target_Align;
14219 Error_Msg_Uint_2 := Source_Align;
14220 Error_Msg_Node_1 := D_Target;
14221 Error_Msg_Node_2 := D_Source;
14223 ("?z?alignment of & (^) is stricter than "
14224 & "alignment of & (^)!", Eloc);
14226 ("\?z?resulting access value may have invalid "
14227 & "alignment!", Eloc);
14238 end Validate_Unchecked_Conversions;