1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2015, 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 Exp_Disp; use Exp_Disp;
34 with Exp_Tss; use Exp_Tss;
35 with Exp_Util; use Exp_Util;
36 with Freeze; use Freeze;
38 with Lib.Xref; use Lib.Xref;
39 with Namet; use Namet;
40 with Nlists; use Nlists;
41 with Nmake; use Nmake;
43 with Restrict; use Restrict;
44 with Rident; use Rident;
45 with Rtsfind; use Rtsfind;
47 with Sem_Aux; use Sem_Aux;
48 with Sem_Case; use Sem_Case;
49 with Sem_Ch3; use Sem_Ch3;
50 with Sem_Ch6; use Sem_Ch6;
51 with Sem_Ch8; use Sem_Ch8;
52 with Sem_Dim; use Sem_Dim;
53 with Sem_Disp; use Sem_Disp;
54 with Sem_Eval; use Sem_Eval;
55 with Sem_Prag; use Sem_Prag;
56 with Sem_Res; use Sem_Res;
57 with Sem_Type; use Sem_Type;
58 with Sem_Util; use Sem_Util;
59 with Sem_Warn; use Sem_Warn;
60 with Sinput; use Sinput;
61 with Snames; use Snames;
62 with Stand; use Stand;
63 with Sinfo; use Sinfo;
64 with Stringt; use Stringt;
65 with Targparm; use Targparm;
66 with Ttypes; use Ttypes;
67 with Tbuild; use Tbuild;
68 with Urealp; use Urealp;
69 with Warnsw; use Warnsw;
71 with GNAT.Heap_Sort_G;
73 package body Sem_Ch13 is
75 SSU : constant Pos := System_Storage_Unit;
76 -- Convenient short hand for commonly used constant
78 -----------------------
79 -- Local Subprograms --
80 -----------------------
82 procedure Alignment_Check_For_Size_Change (Typ : Entity_Id; Size : Uint);
83 -- This routine is called after setting one of the sizes of type entity
84 -- Typ to Size. The purpose is to deal with the situation of a derived
85 -- type whose inherited alignment is no longer appropriate for the new
86 -- size value. In this case, we reset the Alignment to unknown.
88 procedure Build_Discrete_Static_Predicate
92 -- Given a predicated type Typ, where Typ is a discrete static subtype,
93 -- whose predicate expression is Expr, tests if Expr is a static predicate,
94 -- and if so, builds the predicate range list. Nam is the name of the one
95 -- argument to the predicate function. Occurrences of the type name in the
96 -- predicate expression have been replaced by identifier references to this
97 -- name, which is unique, so any identifier with Chars matching Nam must be
98 -- a reference to the type. If the predicate is non-static, this procedure
99 -- returns doing nothing. If the predicate is static, then the predicate
100 -- list is stored in Static_Discrete_Predicate (Typ), and the Expr is
101 -- rewritten as a canonicalized membership operation.
103 procedure Build_Predicate_Functions (Typ : Entity_Id; N : Node_Id);
104 -- If Typ has predicates (indicated by Has_Predicates being set for Typ),
105 -- then either there are pragma Predicate entries on the rep chain for the
106 -- type (note that Predicate aspects are converted to pragma Predicate), or
107 -- there are inherited aspects from a parent type, or ancestor subtypes.
108 -- This procedure builds the spec and body for the Predicate function that
109 -- tests these predicates. N is the freeze node for the type. The spec of
110 -- the function is inserted before the freeze node, and the body of the
111 -- function is inserted after the freeze node. If the predicate expression
112 -- has at least one Raise_Expression, then this procedure also builds the
113 -- M version of the predicate function for use in membership tests.
115 procedure Check_Pool_Size_Clash (Ent : Entity_Id; SP, SS : Node_Id);
116 -- Called if both Storage_Pool and Storage_Size attribute definition
117 -- clauses (SP and SS) are present for entity Ent. Issue error message.
119 procedure Freeze_Entity_Checks (N : Node_Id);
120 -- Called from Analyze_Freeze_Entity and Analyze_Generic_Freeze Entity
121 -- to generate appropriate semantic checks that are delayed until this
122 -- point (they had to be delayed this long for cases of delayed aspects,
123 -- e.g. analysis of statically predicated subtypes in choices, for which
124 -- we have to be sure the subtypes in question are frozen before checking.
126 function Get_Alignment_Value (Expr : Node_Id) return Uint;
127 -- Given the expression for an alignment value, returns the corresponding
128 -- Uint value. If the value is inappropriate, then error messages are
129 -- posted as required, and a value of No_Uint is returned.
131 function Is_Operational_Item (N : Node_Id) return Boolean;
132 -- A specification for a stream attribute is allowed before the full type
133 -- is declared, as explained in AI-00137 and the corrigendum. Attributes
134 -- that do not specify a representation characteristic are operational
137 function Is_Predicate_Static
139 Nam : Name_Id) return Boolean;
140 -- Given predicate expression Expr, tests if Expr is predicate-static in
141 -- the sense of the rules in (RM 3.2.4 (15-24)). Occurrences of the type
142 -- name in the predicate expression have been replaced by references to
143 -- an identifier whose Chars field is Nam. This name is unique, so any
144 -- identifier with Chars matching Nam must be a reference to the type.
145 -- Returns True if the expression is predicate-static and False otherwise,
146 -- but is not in the business of setting flags or issuing error messages.
148 -- Only scalar types can have static predicates, so False is always
149 -- returned for non-scalar types.
151 -- Note: the RM seems to suggest that string types can also have static
152 -- predicates. But that really makes lttle sense as very few useful
153 -- predicates can be constructed for strings. Remember that:
157 -- is not a static expression. So even though the clearly faulty RM wording
158 -- allows the following:
160 -- subtype S is String with Static_Predicate => S < "DEF"
162 -- We can't allow this, otherwise we have predicate-static applying to a
163 -- larger class than static expressions, which was never intended.
165 procedure New_Stream_Subprogram
169 Nam : TSS_Name_Type);
170 -- Create a subprogram renaming of a given stream attribute to the
171 -- designated subprogram and then in the tagged case, provide this as a
172 -- primitive operation, or in the untagged case make an appropriate TSS
173 -- entry. This is more properly an expansion activity than just semantics,
174 -- but the presence of user-defined stream functions for limited types
175 -- is a legality check, which is why this takes place here rather than in
176 -- exp_ch13, where it was previously. Nam indicates the name of the TSS
177 -- function to be generated.
179 -- To avoid elaboration anomalies with freeze nodes, for untagged types
180 -- we generate both a subprogram declaration and a subprogram renaming
181 -- declaration, so that the attribute specification is handled as a
182 -- renaming_as_body. For tagged types, the specification is one of the
185 procedure Resolve_Iterable_Operation
190 -- If the name of a primitive operation for an Iterable aspect is
191 -- overloaded, resolve according to required signature.
197 Biased : Boolean := True);
198 -- If Biased is True, sets Has_Biased_Representation flag for E, and
199 -- outputs a warning message at node N if Warn_On_Biased_Representation is
200 -- is True. This warning inserts the string Msg to describe the construct
203 ----------------------------------------------
204 -- Table for Validate_Unchecked_Conversions --
205 ----------------------------------------------
207 -- The following table collects unchecked conversions for validation.
208 -- Entries are made by Validate_Unchecked_Conversion and then the call
209 -- to Validate_Unchecked_Conversions does the actual error checking and
210 -- posting of warnings. The reason for this delayed processing is to take
211 -- advantage of back-annotations of size and alignment values performed by
214 -- Note: the reason we store a Source_Ptr value instead of a Node_Id is
215 -- that by the time Validate_Unchecked_Conversions is called, Sprint will
216 -- already have modified all Sloc values if the -gnatD option is set.
218 type UC_Entry is record
219 Eloc : Source_Ptr; -- node used for posting warnings
220 Source : Entity_Id; -- source type for unchecked conversion
221 Target : Entity_Id; -- target type for unchecked conversion
222 Act_Unit : Entity_Id; -- actual function instantiated
225 package Unchecked_Conversions is new Table.Table (
226 Table_Component_Type => UC_Entry,
227 Table_Index_Type => Int,
228 Table_Low_Bound => 1,
230 Table_Increment => 200,
231 Table_Name => "Unchecked_Conversions");
233 ----------------------------------------
234 -- Table for Validate_Address_Clauses --
235 ----------------------------------------
237 -- If an address clause has the form
239 -- for X'Address use Expr
241 -- where Expr is of the form Y'Address or recursively is a reference to a
242 -- constant of either of these forms, and X and Y are entities of objects,
243 -- then if Y has a smaller alignment than X, that merits a warning about
244 -- possible bad alignment. The following table collects address clauses of
245 -- this kind. We put these in a table so that they can be checked after the
246 -- back end has completed annotation of the alignments of objects, since we
247 -- can catch more cases that way.
249 type Address_Clause_Check_Record is record
251 -- The address clause
254 -- The entity of the object overlaying Y
257 -- The entity of the object being overlaid
260 -- Whether the address is offset within Y
263 package Address_Clause_Checks is new Table.Table (
264 Table_Component_Type => Address_Clause_Check_Record,
265 Table_Index_Type => Int,
266 Table_Low_Bound => 1,
268 Table_Increment => 200,
269 Table_Name => "Address_Clause_Checks");
271 -----------------------------------------
272 -- Adjust_Record_For_Reverse_Bit_Order --
273 -----------------------------------------
275 procedure Adjust_Record_For_Reverse_Bit_Order (R : Entity_Id) is
280 -- Processing depends on version of Ada
282 -- For Ada 95, we just renumber bits within a storage unit. We do the
283 -- same for Ada 83 mode, since we recognize the Bit_Order attribute in
284 -- Ada 83, and are free to add this extension.
286 if Ada_Version < Ada_2005 then
287 Comp := First_Component_Or_Discriminant (R);
288 while Present (Comp) loop
289 CC := Component_Clause (Comp);
291 -- If component clause is present, then deal with the non-default
292 -- bit order case for Ada 95 mode.
294 -- We only do this processing for the base type, and in fact that
295 -- is important, since otherwise if there are record subtypes, we
296 -- could reverse the bits once for each subtype, which is wrong.
298 if Present (CC) and then Ekind (R) = E_Record_Type then
300 CFB : constant Uint := Component_Bit_Offset (Comp);
301 CSZ : constant Uint := Esize (Comp);
302 CLC : constant Node_Id := Component_Clause (Comp);
303 Pos : constant Node_Id := Position (CLC);
304 FB : constant Node_Id := First_Bit (CLC);
306 Storage_Unit_Offset : constant Uint :=
307 CFB / System_Storage_Unit;
309 Start_Bit : constant Uint :=
310 CFB mod System_Storage_Unit;
313 -- Cases where field goes over storage unit boundary
315 if Start_Bit + CSZ > System_Storage_Unit then
317 -- Allow multi-byte field but generate warning
319 if Start_Bit mod System_Storage_Unit = 0
320 and then CSZ mod System_Storage_Unit = 0
323 ("info: multi-byte field specified with "
324 & "non-standard Bit_Order?V?", CLC);
326 if Bytes_Big_Endian then
328 ("\bytes are not reversed "
329 & "(component is big-endian)?V?", CLC);
332 ("\bytes are not reversed "
333 & "(component is little-endian)?V?", CLC);
336 -- Do not allow non-contiguous field
340 ("attempt to specify non-contiguous field "
341 & "not permitted", CLC);
343 ("\caused by non-standard Bit_Order "
346 ("\consider possibility of using "
347 & "Ada 2005 mode here", CLC);
350 -- Case where field fits in one storage unit
353 -- Give warning if suspicious component clause
355 if Intval (FB) >= System_Storage_Unit
356 and then Warn_On_Reverse_Bit_Order
359 ("info: Bit_Order clause does not affect " &
360 "byte ordering?V?", Pos);
362 Intval (Pos) + Intval (FB) /
365 ("info: position normalized to ^ before bit " &
366 "order interpreted?V?", Pos);
369 -- Here is where we fix up the Component_Bit_Offset value
370 -- to account for the reverse bit order. Some examples of
371 -- what needs to be done are:
373 -- First_Bit .. Last_Bit Component_Bit_Offset
385 -- The rule is that the first bit is is obtained by
386 -- subtracting the old ending bit from storage_unit - 1.
388 Set_Component_Bit_Offset
390 (Storage_Unit_Offset * System_Storage_Unit) +
391 (System_Storage_Unit - 1) -
392 (Start_Bit + CSZ - 1));
394 Set_Normalized_First_Bit
396 Component_Bit_Offset (Comp) mod
397 System_Storage_Unit);
402 Next_Component_Or_Discriminant (Comp);
405 -- For Ada 2005, we do machine scalar processing, as fully described In
406 -- AI-133. This involves gathering all components which start at the
407 -- same byte offset and processing them together. Same approach is still
408 -- valid in later versions including Ada 2012.
412 Max_Machine_Scalar_Size : constant Uint :=
414 (Standard_Long_Long_Integer_Size);
415 -- We use this as the maximum machine scalar size
418 SSU : constant Uint := UI_From_Int (System_Storage_Unit);
421 -- This first loop through components does two things. First it
422 -- deals with the case of components with component clauses whose
423 -- length is greater than the maximum machine scalar size (either
424 -- accepting them or rejecting as needed). Second, it counts the
425 -- number of components with component clauses whose length does
426 -- not exceed this maximum for later processing.
429 Comp := First_Component_Or_Discriminant (R);
430 while Present (Comp) loop
431 CC := Component_Clause (Comp);
435 Fbit : constant Uint := Static_Integer (First_Bit (CC));
436 Lbit : constant Uint := Static_Integer (Last_Bit (CC));
439 -- Case of component with last bit >= max machine scalar
441 if Lbit >= Max_Machine_Scalar_Size then
443 -- This is allowed only if first bit is zero, and
444 -- last bit + 1 is a multiple of storage unit size.
446 if Fbit = 0 and then (Lbit + 1) mod SSU = 0 then
448 -- This is the case to give a warning if enabled
450 if Warn_On_Reverse_Bit_Order then
452 ("info: multi-byte field specified with "
453 & " non-standard Bit_Order?V?", CC);
455 if Bytes_Big_Endian then
457 ("\bytes are not reversed "
458 & "(component is big-endian)?V?", CC);
461 ("\bytes are not reversed "
462 & "(component is little-endian)?V?", CC);
466 -- Give error message for RM 13.5.1(10) violation
470 ("machine scalar rules not followed for&",
471 First_Bit (CC), Comp);
473 Error_Msg_Uint_1 := Lbit;
474 Error_Msg_Uint_2 := Max_Machine_Scalar_Size;
476 ("\last bit (^) exceeds maximum machine "
480 if (Lbit + 1) mod SSU /= 0 then
481 Error_Msg_Uint_1 := SSU;
483 ("\and is not a multiple of Storage_Unit (^) "
488 Error_Msg_Uint_1 := Fbit;
490 ("\and first bit (^) is non-zero "
496 -- OK case of machine scalar related component clause,
497 -- For now, just count them.
500 Num_CC := Num_CC + 1;
505 Next_Component_Or_Discriminant (Comp);
508 -- We need to sort the component clauses on the basis of the
509 -- Position values in the clause, so we can group clauses with
510 -- the same Position together to determine the relevant machine
514 Comps : array (0 .. Num_CC) of Entity_Id;
515 -- Array to collect component and discriminant entities. The
516 -- data starts at index 1, the 0'th entry is for the sort
519 function CP_Lt (Op1, Op2 : Natural) return Boolean;
520 -- Compare routine for Sort
522 procedure CP_Move (From : Natural; To : Natural);
523 -- Move routine for Sort
525 package Sorting is new GNAT.Heap_Sort_G (CP_Move, CP_Lt);
529 -- Start and stop positions in the component list of the set of
530 -- components with the same starting position (that constitute
531 -- components in a single machine scalar).
534 -- Maximum last bit value of any component in this set
537 -- Corresponding machine scalar size
543 function CP_Lt (Op1, Op2 : Natural) return Boolean is
545 return Position (Component_Clause (Comps (Op1))) <
546 Position (Component_Clause (Comps (Op2)));
553 procedure CP_Move (From : Natural; To : Natural) is
555 Comps (To) := Comps (From);
558 -- Start of processing for Sort_CC
561 -- Collect the machine scalar relevant component clauses
564 Comp := First_Component_Or_Discriminant (R);
565 while Present (Comp) loop
567 CC : constant Node_Id := Component_Clause (Comp);
570 -- Collect only component clauses whose last bit is less
571 -- than machine scalar size. Any component clause whose
572 -- last bit exceeds this value does not take part in
573 -- machine scalar layout considerations. The test for
574 -- Error_Posted makes sure we exclude component clauses
575 -- for which we already posted an error.
578 and then not Error_Posted (Last_Bit (CC))
579 and then Static_Integer (Last_Bit (CC)) <
580 Max_Machine_Scalar_Size
582 Num_CC := Num_CC + 1;
583 Comps (Num_CC) := Comp;
587 Next_Component_Or_Discriminant (Comp);
590 -- Sort by ascending position number
592 Sorting.Sort (Num_CC);
594 -- We now have all the components whose size does not exceed
595 -- the max machine scalar value, sorted by starting position.
596 -- In this loop we gather groups of clauses starting at the
597 -- same position, to process them in accordance with AI-133.
600 while Stop < Num_CC loop
605 (Last_Bit (Component_Clause (Comps (Start))));
606 while Stop < Num_CC loop
608 (Position (Component_Clause (Comps (Stop + 1)))) =
610 (Position (Component_Clause (Comps (Stop))))
618 (Component_Clause (Comps (Stop)))));
624 -- Now we have a group of component clauses from Start to
625 -- Stop whose positions are identical, and MaxL is the
626 -- maximum last bit value of any of these components.
628 -- We need to determine the corresponding machine scalar
629 -- size. This loop assumes that machine scalar sizes are
630 -- even, and that each possible machine scalar has twice
631 -- as many bits as the next smaller one.
633 MSS := Max_Machine_Scalar_Size;
635 and then (MSS / 2) >= SSU
636 and then (MSS / 2) > MaxL
641 -- Here is where we fix up the Component_Bit_Offset value
642 -- to account for the reverse bit order. Some examples of
643 -- what needs to be done for the case of a machine scalar
646 -- First_Bit .. Last_Bit Component_Bit_Offset
658 -- The rule is that the first bit is obtained by subtracting
659 -- the old ending bit from machine scalar size - 1.
661 for C in Start .. Stop loop
663 Comp : constant Entity_Id := Comps (C);
664 CC : constant Node_Id := Component_Clause (Comp);
666 LB : constant Uint := Static_Integer (Last_Bit (CC));
667 NFB : constant Uint := MSS - Uint_1 - LB;
668 NLB : constant Uint := NFB + Esize (Comp) - 1;
669 Pos : constant Uint := Static_Integer (Position (CC));
672 if Warn_On_Reverse_Bit_Order then
673 Error_Msg_Uint_1 := MSS;
675 ("info: reverse bit order in machine " &
676 "scalar of length^?V?", First_Bit (CC));
677 Error_Msg_Uint_1 := NFB;
678 Error_Msg_Uint_2 := NLB;
680 if Bytes_Big_Endian then
682 ("\big-endian range for component "
683 & "& is ^ .. ^?V?", First_Bit (CC), Comp);
686 ("\little-endian range for component"
687 & "& is ^ .. ^?V?", First_Bit (CC), Comp);
691 Set_Component_Bit_Offset (Comp, Pos * SSU + NFB);
692 Set_Normalized_First_Bit (Comp, NFB mod SSU);
699 end Adjust_Record_For_Reverse_Bit_Order;
701 -------------------------------------
702 -- Alignment_Check_For_Size_Change --
703 -------------------------------------
705 procedure Alignment_Check_For_Size_Change (Typ : Entity_Id; Size : Uint) is
707 -- If the alignment is known, and not set by a rep clause, and is
708 -- inconsistent with the size being set, then reset it to unknown,
709 -- we assume in this case that the size overrides the inherited
710 -- alignment, and that the alignment must be recomputed.
712 if Known_Alignment (Typ)
713 and then not Has_Alignment_Clause (Typ)
714 and then Size mod (Alignment (Typ) * SSU) /= 0
716 Init_Alignment (Typ);
718 end Alignment_Check_For_Size_Change;
720 -------------------------------------
721 -- Analyze_Aspects_At_Freeze_Point --
722 -------------------------------------
724 procedure Analyze_Aspects_At_Freeze_Point (E : Entity_Id) is
729 procedure Analyze_Aspect_Default_Value (ASN : Node_Id);
730 -- This routine analyzes an Aspect_Default_[Component_]Value denoted by
731 -- the aspect specification node ASN.
733 procedure Inherit_Delayed_Rep_Aspects (ASN : Node_Id);
734 -- As discussed in the spec of Aspects (see Aspect_Delay declaration),
735 -- a derived type can inherit aspects from its parent which have been
736 -- specified at the time of the derivation using an aspect, as in:
738 -- type A is range 1 .. 10
739 -- with Size => Not_Defined_Yet;
743 -- Not_Defined_Yet : constant := 64;
745 -- In this example, the Size of A is considered to be specified prior
746 -- to the derivation, and thus inherited, even though the value is not
747 -- known at the time of derivation. To deal with this, we use two entity
748 -- flags. The flag Has_Derived_Rep_Aspects is set in the parent type (A
749 -- here), and then the flag May_Inherit_Delayed_Rep_Aspects is set in
750 -- the derived type (B here). If this flag is set when the derived type
751 -- is frozen, then this procedure is called to ensure proper inheritance
752 -- of all delayed aspects from the parent type. The derived type is E,
753 -- the argument to Analyze_Aspects_At_Freeze_Point. ASN is the first
754 -- aspect specification node in the Rep_Item chain for the parent type.
756 procedure Make_Pragma_From_Boolean_Aspect (ASN : Node_Id);
757 -- Given an aspect specification node ASN whose expression is an
758 -- optional Boolean, this routines creates the corresponding pragma
759 -- at the freezing point.
761 ----------------------------------
762 -- Analyze_Aspect_Default_Value --
763 ----------------------------------
765 procedure Analyze_Aspect_Default_Value (ASN : Node_Id) is
766 Ent : constant Entity_Id := Entity (ASN);
767 Expr : constant Node_Id := Expression (ASN);
768 Id : constant Node_Id := Identifier (ASN);
771 Error_Msg_Name_1 := Chars (Id);
773 if not Is_Type (Ent) then
774 Error_Msg_N ("aspect% can only apply to a type", Id);
777 elsif not Is_First_Subtype (Ent) then
778 Error_Msg_N ("aspect% cannot apply to subtype", Id);
781 elsif A_Id = Aspect_Default_Value
782 and then not Is_Scalar_Type (Ent)
784 Error_Msg_N ("aspect% can only be applied to scalar type", Id);
787 elsif A_Id = Aspect_Default_Component_Value then
788 if not Is_Array_Type (Ent) then
789 Error_Msg_N ("aspect% can only be applied to array type", Id);
792 elsif not Is_Scalar_Type (Component_Type (Ent)) then
793 Error_Msg_N ("aspect% requires scalar components", Id);
798 Set_Has_Default_Aspect (Base_Type (Ent));
800 if Is_Scalar_Type (Ent) then
801 Set_Default_Aspect_Value (Base_Type (Ent), Expr);
803 Set_Default_Aspect_Component_Value (Base_Type (Ent), Expr);
805 end Analyze_Aspect_Default_Value;
807 ---------------------------------
808 -- Inherit_Delayed_Rep_Aspects --
809 ---------------------------------
811 procedure Inherit_Delayed_Rep_Aspects (ASN : Node_Id) is
812 P : constant Entity_Id := Entity (ASN);
813 -- Entithy for parent type
816 -- Item from Rep_Item chain
821 -- Loop through delayed aspects for the parent type
824 while Present (N) loop
825 if Nkind (N) = N_Aspect_Specification then
826 exit when Entity (N) /= P;
828 if Is_Delayed_Aspect (N) then
829 A := Get_Aspect_Id (Chars (Identifier (N)));
831 -- Process delayed rep aspect. For Boolean attributes it is
832 -- not possible to cancel an attribute once set (the attempt
833 -- to use an aspect with xxx => False is an error) for a
834 -- derived type. So for those cases, we do not have to check
835 -- if a clause has been given for the derived type, since it
836 -- is harmless to set it again if it is already set.
842 when Aspect_Alignment =>
843 if not Has_Alignment_Clause (E) then
844 Set_Alignment (E, Alignment (P));
849 when Aspect_Atomic =>
850 if Is_Atomic (P) then
856 when Aspect_Atomic_Components =>
857 if Has_Atomic_Components (P) then
858 Set_Has_Atomic_Components (Base_Type (E));
863 when Aspect_Bit_Order =>
864 if Is_Record_Type (E)
865 and then No (Get_Attribute_Definition_Clause
866 (E, Attribute_Bit_Order))
867 and then Reverse_Bit_Order (P)
869 Set_Reverse_Bit_Order (Base_Type (E));
874 when Aspect_Component_Size =>
876 and then not Has_Component_Size_Clause (E)
879 (Base_Type (E), Component_Size (P));
884 when Aspect_Machine_Radix =>
885 if Is_Decimal_Fixed_Point_Type (E)
886 and then not Has_Machine_Radix_Clause (E)
888 Set_Machine_Radix_10 (E, Machine_Radix_10 (P));
891 -- Object_Size (also Size which also sets Object_Size)
893 when Aspect_Object_Size | Aspect_Size =>
894 if not Has_Size_Clause (E)
896 No (Get_Attribute_Definition_Clause
897 (E, Attribute_Object_Size))
899 Set_Esize (E, Esize (P));
905 if not Is_Packed (E) then
906 Set_Is_Packed (Base_Type (E));
908 if Is_Bit_Packed_Array (P) then
909 Set_Is_Bit_Packed_Array (Base_Type (E));
910 Set_Packed_Array_Impl_Type
911 (E, Packed_Array_Impl_Type (P));
915 -- Scalar_Storage_Order
917 when Aspect_Scalar_Storage_Order =>
918 if (Is_Record_Type (E) or else Is_Array_Type (E))
919 and then No (Get_Attribute_Definition_Clause
920 (E, Attribute_Scalar_Storage_Order))
921 and then Reverse_Storage_Order (P)
923 Set_Reverse_Storage_Order (Base_Type (E));
925 -- Clear default SSO indications, since the aspect
926 -- overrides the default.
928 Set_SSO_Set_Low_By_Default (Base_Type (E), False);
929 Set_SSO_Set_High_By_Default (Base_Type (E), False);
935 if Is_Fixed_Point_Type (E)
936 and then not Has_Small_Clause (E)
938 Set_Small_Value (E, Small_Value (P));
943 when Aspect_Storage_Size =>
944 if (Is_Access_Type (E) or else Is_Task_Type (E))
945 and then not Has_Storage_Size_Clause (E)
947 Set_Storage_Size_Variable
948 (Base_Type (E), Storage_Size_Variable (P));
953 when Aspect_Value_Size =>
955 -- Value_Size is never inherited, it is either set by
956 -- default, or it is explicitly set for the derived
957 -- type. So nothing to do here.
963 when Aspect_Volatile =>
964 if Is_Volatile (P) then
968 -- Volatile_Components
970 when Aspect_Volatile_Components =>
971 if Has_Volatile_Components (P) then
972 Set_Has_Volatile_Components (Base_Type (E));
975 -- That should be all the Rep Aspects
978 pragma Assert (Aspect_Delay (A_Id) /= Rep_Aspect);
985 N := Next_Rep_Item (N);
987 end Inherit_Delayed_Rep_Aspects;
989 -------------------------------------
990 -- Make_Pragma_From_Boolean_Aspect --
991 -------------------------------------
993 procedure Make_Pragma_From_Boolean_Aspect (ASN : Node_Id) is
994 Ident : constant Node_Id := Identifier (ASN);
995 A_Name : constant Name_Id := Chars (Ident);
996 A_Id : constant Aspect_Id := Get_Aspect_Id (A_Name);
997 Ent : constant Entity_Id := Entity (ASN);
998 Expr : constant Node_Id := Expression (ASN);
999 Loc : constant Source_Ptr := Sloc (ASN);
1003 procedure Check_False_Aspect_For_Derived_Type;
1004 -- This procedure checks for the case of a false aspect for a derived
1005 -- type, which improperly tries to cancel an aspect inherited from
1008 -----------------------------------------
1009 -- Check_False_Aspect_For_Derived_Type --
1010 -----------------------------------------
1012 procedure Check_False_Aspect_For_Derived_Type is
1016 -- We are only checking derived types
1018 if not Is_Derived_Type (E) then
1022 Par := Nearest_Ancestor (E);
1025 when Aspect_Atomic | Aspect_Shared =>
1026 if not Is_Atomic (Par) then
1030 when Aspect_Atomic_Components =>
1031 if not Has_Atomic_Components (Par) then
1035 when Aspect_Discard_Names =>
1036 if not Discard_Names (Par) then
1041 if not Is_Packed (Par) then
1045 when Aspect_Unchecked_Union =>
1046 if not Is_Unchecked_Union (Par) then
1050 when Aspect_Volatile =>
1051 if not Is_Volatile (Par) then
1055 when Aspect_Volatile_Components =>
1056 if not Has_Volatile_Components (Par) then
1064 -- Fall through means we are canceling an inherited aspect
1066 Error_Msg_Name_1 := A_Name;
1068 ("derived type& inherits aspect%, cannot cancel", Expr, E);
1070 end Check_False_Aspect_For_Derived_Type;
1072 -- Start of processing for Make_Pragma_From_Boolean_Aspect
1075 -- Note that we know Expr is present, because for a missing Expr
1076 -- argument, we knew it was True and did not need to delay the
1077 -- evaluation to the freeze point.
1079 if Is_False (Static_Boolean (Expr)) then
1080 Check_False_Aspect_For_Derived_Type;
1085 Pragma_Argument_Associations => New_List (
1086 Make_Pragma_Argument_Association (Sloc (Ident),
1087 Expression => New_Occurrence_Of (Ent, Sloc (Ident)))),
1089 Pragma_Identifier =>
1090 Make_Identifier (Sloc (Ident), Chars (Ident)));
1092 Set_From_Aspect_Specification (Prag, True);
1093 Set_Corresponding_Aspect (Prag, ASN);
1094 Set_Aspect_Rep_Item (ASN, Prag);
1095 Set_Is_Delayed_Aspect (Prag);
1096 Set_Parent (Prag, ASN);
1098 end Make_Pragma_From_Boolean_Aspect;
1100 -- Start of processing for Analyze_Aspects_At_Freeze_Point
1103 -- Must be visible in current scope
1105 if not Scope_Within_Or_Same (Current_Scope, Scope (E)) then
1109 -- Look for aspect specification entries for this entity
1111 ASN := First_Rep_Item (E);
1112 while Present (ASN) loop
1113 if Nkind (ASN) = N_Aspect_Specification then
1114 exit when Entity (ASN) /= E;
1116 if Is_Delayed_Aspect (ASN) then
1117 A_Id := Get_Aspect_Id (ASN);
1121 -- For aspects whose expression is an optional Boolean, make
1122 -- the corresponding pragma at the freeze point.
1124 when Boolean_Aspects |
1125 Library_Unit_Aspects =>
1126 Make_Pragma_From_Boolean_Aspect (ASN);
1128 -- Special handling for aspects that don't correspond to
1129 -- pragmas/attributes.
1131 when Aspect_Default_Value |
1132 Aspect_Default_Component_Value =>
1133 Analyze_Aspect_Default_Value (ASN);
1135 -- Ditto for iterator aspects, because the corresponding
1136 -- attributes may not have been analyzed yet.
1138 when Aspect_Constant_Indexing |
1139 Aspect_Variable_Indexing |
1140 Aspect_Default_Iterator |
1141 Aspect_Iterator_Element =>
1142 Analyze (Expression (ASN));
1144 if Etype (Expression (ASN)) = Any_Type then
1146 ("\aspect must be fully defined before & is frozen",
1150 when Aspect_Iterable =>
1151 Validate_Iterable_Aspect (E, ASN);
1157 Ritem := Aspect_Rep_Item (ASN);
1159 if Present (Ritem) then
1165 Next_Rep_Item (ASN);
1168 -- This is where we inherit delayed rep aspects from our parent. Note
1169 -- that if we fell out of the above loop with ASN non-empty, it means
1170 -- we hit an aspect for an entity other than E, and it must be the
1171 -- type from which we were derived.
1173 if May_Inherit_Delayed_Rep_Aspects (E) then
1174 Inherit_Delayed_Rep_Aspects (ASN);
1176 end Analyze_Aspects_At_Freeze_Point;
1178 -----------------------------------
1179 -- Analyze_Aspect_Specifications --
1180 -----------------------------------
1182 procedure Analyze_Aspect_Specifications (N : Node_Id; E : Entity_Id) is
1183 procedure Decorate (Asp : Node_Id; Prag : Node_Id);
1184 -- Establish linkages between an aspect and its corresponding
1187 procedure Insert_After_SPARK_Mode
1191 -- Subsidiary to the analysis of aspects Abstract_State, Ghost,
1192 -- Initializes, Initial_Condition and Refined_State. Insert node Prag
1193 -- before node Ins_Nod. If Ins_Nod is for pragma SPARK_Mode, then skip
1194 -- SPARK_Mode. Decls is the associated declarative list where Prag is to
1197 procedure Insert_Pragma (Prag : Node_Id);
1198 -- Subsidiary to the analysis of aspects Attach_Handler, Contract_Cases,
1199 -- Depends, Global, Post, Pre, Refined_Depends and Refined_Global.
1200 -- Insert pragma Prag such that it mimics the placement of a source
1201 -- pragma of the same kind.
1203 -- procedure Proc (Formal : ...) with Global => ...;
1205 -- procedure Proc (Formal : ...);
1206 -- pragma Global (...);
1212 procedure Decorate (Asp : Node_Id; Prag : Node_Id) is
1214 Set_Aspect_Rep_Item (Asp, Prag);
1215 Set_Corresponding_Aspect (Prag, Asp);
1216 Set_From_Aspect_Specification (Prag);
1217 Set_Parent (Prag, Asp);
1220 -----------------------------
1221 -- Insert_After_SPARK_Mode --
1222 -----------------------------
1224 procedure Insert_After_SPARK_Mode
1229 Decl : Node_Id := Ins_Nod;
1235 and then Nkind (Decl) = N_Pragma
1236 and then Pragma_Name (Decl) = Name_SPARK_Mode
1238 Decl := Next (Decl);
1241 if Present (Decl) then
1242 Insert_Before (Decl, Prag);
1244 -- Aitem acts as the last declaration
1247 Append_To (Decls, Prag);
1249 end Insert_After_SPARK_Mode;
1255 procedure Insert_Pragma (Prag : Node_Id) is
1260 -- When the context is a library unit, the pragma is added to the
1261 -- Pragmas_After list.
1263 if Nkind (Parent (N)) = N_Compilation_Unit then
1264 Aux := Aux_Decls_Node (Parent (N));
1266 if No (Pragmas_After (Aux)) then
1267 Set_Pragmas_After (Aux, New_List);
1270 Prepend (Prag, Pragmas_After (Aux));
1272 -- Pragmas associated with subprogram bodies are inserted in the
1273 -- declarative part.
1275 elsif Nkind (N) = N_Subprogram_Body then
1276 if Present (Declarations (N)) then
1278 -- Skip other internally generated pragmas from aspects to find
1279 -- the proper insertion point. As a result the order of pragmas
1280 -- is the same as the order of aspects.
1282 -- As precondition pragmas generated from conjuncts in the
1283 -- precondition aspect are presented in reverse order to
1284 -- Insert_Pragma, insert them in the correct order here by not
1285 -- skipping previously inserted precondition pragmas when the
1286 -- current pragma is a precondition.
1288 Decl := First (Declarations (N));
1289 while Present (Decl) loop
1290 if Nkind (Decl) = N_Pragma
1291 and then From_Aspect_Specification (Decl)
1292 and then not (Get_Pragma_Id (Decl) = Pragma_Precondition
1294 Get_Pragma_Id (Prag) = Pragma_Precondition)
1302 if Present (Decl) then
1303 Insert_Before (Decl, Prag);
1305 Append (Prag, Declarations (N));
1308 Set_Declarations (N, New_List (Prag));
1314 Insert_After (N, Prag);
1324 L : constant List_Id := Aspect_Specifications (N);
1326 Ins_Node : Node_Id := N;
1327 -- Insert pragmas/attribute definition clause after this node when no
1328 -- delayed analysis is required.
1330 -- Start of processing for Analyze_Aspect_Specifications
1332 -- The general processing involves building an attribute definition
1333 -- clause or a pragma node that corresponds to the aspect. Then in order
1334 -- to delay the evaluation of this aspect to the freeze point, we attach
1335 -- the corresponding pragma/attribute definition clause to the aspect
1336 -- specification node, which is then placed in the Rep Item chain. In
1337 -- this case we mark the entity by setting the flag Has_Delayed_Aspects
1338 -- and we evaluate the rep item at the freeze point. When the aspect
1339 -- doesn't have a corresponding pragma/attribute definition clause, then
1340 -- its analysis is simply delayed at the freeze point.
1342 -- Some special cases don't require delay analysis, thus the aspect is
1343 -- analyzed right now.
1345 -- Note that there is a special handling for Pre, Post, Test_Case,
1346 -- Contract_Cases aspects. In these cases, we do not have to worry
1347 -- about delay issues, since the pragmas themselves deal with delay
1348 -- of visibility for the expression analysis. Thus, we just insert
1349 -- the pragma after the node N.
1352 pragma Assert (Present (L));
1354 -- Loop through aspects
1356 Aspect := First (L);
1357 Aspect_Loop : while Present (Aspect) loop
1358 Analyze_One_Aspect : declare
1359 Expr : constant Node_Id := Expression (Aspect);
1360 Id : constant Node_Id := Identifier (Aspect);
1361 Loc : constant Source_Ptr := Sloc (Aspect);
1362 Nam : constant Name_Id := Chars (Id);
1363 A_Id : constant Aspect_Id := Get_Aspect_Id (Nam);
1366 Delay_Required : Boolean;
1367 -- Set False if delay is not required
1369 Eloc : Source_Ptr := No_Location;
1370 -- Source location of expression, modified when we split PPC's. It
1371 -- is set below when Expr is present.
1373 procedure Analyze_Aspect_External_Or_Link_Name;
1374 -- Perform analysis of the External_Name or Link_Name aspects
1376 procedure Analyze_Aspect_Implicit_Dereference;
1377 -- Perform analysis of the Implicit_Dereference aspects
1379 procedure Make_Aitem_Pragma
1380 (Pragma_Argument_Associations : List_Id;
1381 Pragma_Name : Name_Id);
1382 -- This is a wrapper for Make_Pragma used for converting aspects
1383 -- to pragmas. It takes care of Sloc (set from Loc) and building
1384 -- the pragma identifier from the given name. In addition the
1385 -- flags Class_Present and Split_PPC are set from the aspect
1386 -- node, as well as Is_Ignored. This routine also sets the
1387 -- From_Aspect_Specification in the resulting pragma node to
1388 -- True, and sets Corresponding_Aspect to point to the aspect.
1389 -- The resulting pragma is assigned to Aitem.
1391 ------------------------------------------
1392 -- Analyze_Aspect_External_Or_Link_Name --
1393 ------------------------------------------
1395 procedure Analyze_Aspect_External_Or_Link_Name is
1397 -- Verify that there is an Import/Export aspect defined for the
1398 -- entity. The processing of that aspect in turn checks that
1399 -- there is a Convention aspect declared. The pragma is
1400 -- constructed when processing the Convention aspect.
1407 while Present (A) loop
1408 exit when Nam_In (Chars (Identifier (A)), Name_Export,
1415 ("missing Import/Export for Link/External name",
1419 end Analyze_Aspect_External_Or_Link_Name;
1421 -----------------------------------------
1422 -- Analyze_Aspect_Implicit_Dereference --
1423 -----------------------------------------
1425 procedure Analyze_Aspect_Implicit_Dereference is
1427 if not Is_Type (E) or else not Has_Discriminants (E) then
1429 ("aspect must apply to a type with discriminants", N);
1436 Disc := First_Discriminant (E);
1437 while Present (Disc) loop
1438 if Chars (Expr) = Chars (Disc)
1439 and then Ekind (Etype (Disc)) =
1440 E_Anonymous_Access_Type
1442 Set_Has_Implicit_Dereference (E);
1443 Set_Has_Implicit_Dereference (Disc);
1447 Next_Discriminant (Disc);
1450 -- Error if no proper access discriminant.
1453 ("not an access discriminant of&", Expr, E);
1456 end Analyze_Aspect_Implicit_Dereference;
1458 -----------------------
1459 -- Make_Aitem_Pragma --
1460 -----------------------
1462 procedure Make_Aitem_Pragma
1463 (Pragma_Argument_Associations : List_Id;
1464 Pragma_Name : Name_Id)
1466 Args : List_Id := Pragma_Argument_Associations;
1469 -- We should never get here if aspect was disabled
1471 pragma Assert (not Is_Disabled (Aspect));
1473 -- Certain aspects allow for an optional name or expression. Do
1474 -- not generate a pragma with empty argument association list.
1476 if No (Args) or else No (Expression (First (Args))) then
1484 Pragma_Argument_Associations => Args,
1485 Pragma_Identifier =>
1486 Make_Identifier (Sloc (Id), Pragma_Name),
1487 Class_Present => Class_Present (Aspect),
1488 Split_PPC => Split_PPC (Aspect));
1490 -- Set additional semantic fields
1492 if Is_Ignored (Aspect) then
1493 Set_Is_Ignored (Aitem);
1494 elsif Is_Checked (Aspect) then
1495 Set_Is_Checked (Aitem);
1498 Set_Corresponding_Aspect (Aitem, Aspect);
1499 Set_From_Aspect_Specification (Aitem, True);
1500 end Make_Aitem_Pragma;
1502 -- Start of processing for Analyze_One_Aspect
1505 -- Skip aspect if already analyzed, to avoid looping in some cases
1507 if Analyzed (Aspect) then
1511 -- Skip looking at aspect if it is totally disabled. Just mark it
1512 -- as such for later reference in the tree. This also sets the
1513 -- Is_Ignored and Is_Checked flags appropriately.
1515 Check_Applicable_Policy (Aspect);
1517 if Is_Disabled (Aspect) then
1521 -- Set the source location of expression, used in the case of
1522 -- a failed precondition/postcondition or invariant. Note that
1523 -- the source location of the expression is not usually the best
1524 -- choice here. For example, it gets located on the last AND
1525 -- keyword in a chain of boolean expressiond AND'ed together.
1526 -- It is best to put the message on the first character of the
1527 -- assertion, which is the effect of the First_Node call here.
1529 if Present (Expr) then
1530 Eloc := Sloc (First_Node (Expr));
1533 -- Check restriction No_Implementation_Aspect_Specifications
1535 if Implementation_Defined_Aspect (A_Id) then
1537 (No_Implementation_Aspect_Specifications, Aspect);
1540 -- Check restriction No_Specification_Of_Aspect
1542 Check_Restriction_No_Specification_Of_Aspect (Aspect);
1544 -- Mark aspect analyzed (actual analysis is delayed till later)
1546 Set_Analyzed (Aspect);
1547 Set_Entity (Aspect, E);
1548 Ent := New_Occurrence_Of (E, Sloc (Id));
1550 -- Check for duplicate aspect. Note that the Comes_From_Source
1551 -- test allows duplicate Pre/Post's that we generate internally
1552 -- to escape being flagged here.
1554 if No_Duplicates_Allowed (A_Id) then
1556 while Anod /= Aspect loop
1557 if Comes_From_Source (Aspect)
1558 and then Same_Aspect (A_Id, Get_Aspect_Id (Anod))
1560 Error_Msg_Name_1 := Nam;
1561 Error_Msg_Sloc := Sloc (Anod);
1563 -- Case of same aspect specified twice
1565 if Class_Present (Anod) = Class_Present (Aspect) then
1566 if not Class_Present (Anod) then
1568 ("aspect% for & previously given#",
1572 ("aspect `%''Class` for & previously given#",
1582 -- Check some general restrictions on language defined aspects
1584 if not Implementation_Defined_Aspect (A_Id) then
1585 Error_Msg_Name_1 := Nam;
1587 -- Not allowed for renaming declarations
1589 if Nkind (N) in N_Renaming_Declaration then
1591 ("aspect % not allowed for renaming declaration",
1595 -- Not allowed for formal type declarations
1597 if Nkind (N) = N_Formal_Type_Declaration then
1599 ("aspect % not allowed for formal type declaration",
1604 -- Copy expression for later processing by the procedures
1605 -- Check_Aspect_At_[Freeze_Point | End_Of_Declarations]
1607 Set_Entity (Id, New_Copy_Tree (Expr));
1609 -- Set Delay_Required as appropriate to aspect
1611 case Aspect_Delay (A_Id) is
1612 when Always_Delay =>
1613 Delay_Required := True;
1616 Delay_Required := False;
1620 -- If expression has the form of an integer literal, then
1621 -- do not delay, since we know the value cannot change.
1622 -- This optimization catches most rep clause cases.
1624 -- For Boolean aspects, don't delay if no expression
1626 if A_Id in Boolean_Aspects and then No (Expr) then
1627 Delay_Required := False;
1629 -- For non-Boolean aspects, don't delay if integer literal
1631 elsif A_Id not in Boolean_Aspects
1632 and then Present (Expr)
1633 and then Nkind (Expr) = N_Integer_Literal
1635 Delay_Required := False;
1637 -- All other cases are delayed
1640 Delay_Required := True;
1641 Set_Has_Delayed_Rep_Aspects (E);
1645 -- Processing based on specific aspect
1649 -- No_Aspect should be impossible
1652 raise Program_Error;
1654 -- Case 1: Aspects corresponding to attribute definition
1657 when Aspect_Address |
1660 Aspect_Component_Size |
1661 Aspect_Constant_Indexing |
1662 Aspect_Default_Iterator |
1663 Aspect_Dispatching_Domain |
1664 Aspect_External_Tag |
1667 Aspect_Iterator_Element |
1668 Aspect_Machine_Radix |
1669 Aspect_Object_Size |
1672 Aspect_Scalar_Storage_Order |
1675 Aspect_Simple_Storage_Pool |
1676 Aspect_Storage_Pool |
1677 Aspect_Stream_Size |
1679 Aspect_Variable_Indexing |
1682 -- Indexing aspects apply only to tagged type
1684 if (A_Id = Aspect_Constant_Indexing
1686 A_Id = Aspect_Variable_Indexing)
1687 and then not (Is_Type (E)
1688 and then Is_Tagged_Type (E))
1691 ("indexing aspect can only apply to a tagged type",
1696 -- For the case of aspect Address, we don't consider that we
1697 -- know the entity is never set in the source, since it is
1698 -- is likely aliasing is occurring.
1700 -- Note: one might think that the analysis of the resulting
1701 -- attribute definition clause would take care of that, but
1702 -- that's not the case since it won't be from source.
1704 if A_Id = Aspect_Address then
1705 Set_Never_Set_In_Source (E, False);
1708 -- Correctness of the profile of a stream operation is
1709 -- verified at the freeze point, but we must detect the
1710 -- illegal specification of this aspect for a subtype now,
1711 -- to prevent malformed rep_item chains.
1713 if A_Id = Aspect_Input or else
1714 A_Id = Aspect_Output or else
1715 A_Id = Aspect_Read or else
1718 if not Is_First_Subtype (E) then
1720 ("local name must be a first subtype", Aspect);
1723 -- If stream aspect applies to the class-wide type,
1724 -- the generated attribute definition applies to the
1725 -- class-wide type as well.
1727 elsif Class_Present (Aspect) then
1729 Make_Attribute_Reference (Loc,
1731 Attribute_Name => Name_Class);
1735 -- Construct the attribute definition clause
1738 Make_Attribute_Definition_Clause (Loc,
1740 Chars => Chars (Id),
1741 Expression => Relocate_Node (Expr));
1743 -- If the address is specified, then we treat the entity as
1744 -- referenced, to avoid spurious warnings. This is analogous
1745 -- to what is done with an attribute definition clause, but
1746 -- here we don't want to generate a reference because this
1747 -- is the point of definition of the entity.
1749 if A_Id = Aspect_Address then
1753 -- Case 2: Aspects corresponding to pragmas
1755 -- Case 2a: Aspects corresponding to pragmas with two
1756 -- arguments, where the first argument is a local name
1757 -- referring to the entity, and the second argument is the
1758 -- aspect definition expression.
1760 -- Linker_Section/Suppress/Unsuppress
1762 when Aspect_Linker_Section |
1764 Aspect_Unsuppress =>
1767 (Pragma_Argument_Associations => New_List (
1768 Make_Pragma_Argument_Association (Loc,
1769 Expression => New_Occurrence_Of (E, Loc)),
1770 Make_Pragma_Argument_Association (Sloc (Expr),
1771 Expression => Relocate_Node (Expr))),
1772 Pragma_Name => Chars (Id));
1776 -- Corresponds to pragma Implemented, construct the pragma
1778 when Aspect_Synchronization =>
1780 (Pragma_Argument_Associations => New_List (
1781 Make_Pragma_Argument_Association (Loc,
1782 Expression => New_Occurrence_Of (E, Loc)),
1783 Make_Pragma_Argument_Association (Sloc (Expr),
1784 Expression => Relocate_Node (Expr))),
1785 Pragma_Name => Name_Implemented);
1789 when Aspect_Attach_Handler =>
1791 (Pragma_Argument_Associations => New_List (
1792 Make_Pragma_Argument_Association (Sloc (Ent),
1794 Make_Pragma_Argument_Association (Sloc (Expr),
1795 Expression => Relocate_Node (Expr))),
1796 Pragma_Name => Name_Attach_Handler);
1798 -- We need to insert this pragma into the tree to get proper
1799 -- processing and to look valid from a placement viewpoint.
1801 Insert_Pragma (Aitem);
1804 -- Dynamic_Predicate, Predicate, Static_Predicate
1806 when Aspect_Dynamic_Predicate |
1808 Aspect_Static_Predicate =>
1810 -- These aspects apply only to subtypes
1812 if not Is_Type (E) then
1814 ("predicate can only be specified for a subtype",
1818 elsif Is_Incomplete_Type (E) then
1820 ("predicate cannot apply to incomplete view", Aspect);
1824 -- Construct the pragma (always a pragma Predicate, with
1825 -- flags recording whether it is static/dynamic). We also
1826 -- set flags recording this in the type itself.
1829 (Pragma_Argument_Associations => New_List (
1830 Make_Pragma_Argument_Association (Sloc (Ent),
1832 Make_Pragma_Argument_Association (Sloc (Expr),
1833 Expression => Relocate_Node (Expr))),
1834 Pragma_Name => Name_Predicate);
1836 -- Mark type has predicates, and remember what kind of
1837 -- aspect lead to this predicate (we need this to access
1838 -- the right set of check policies later on).
1840 Set_Has_Predicates (E);
1842 if A_Id = Aspect_Dynamic_Predicate then
1843 Set_Has_Dynamic_Predicate_Aspect (E);
1844 elsif A_Id = Aspect_Static_Predicate then
1845 Set_Has_Static_Predicate_Aspect (E);
1848 -- If the type is private, indicate that its completion
1849 -- has a freeze node, because that is the one that will
1850 -- be visible at freeze time.
1852 if Is_Private_Type (E) and then Present (Full_View (E)) then
1853 Set_Has_Predicates (Full_View (E));
1855 if A_Id = Aspect_Dynamic_Predicate then
1856 Set_Has_Dynamic_Predicate_Aspect (Full_View (E));
1857 elsif A_Id = Aspect_Static_Predicate then
1858 Set_Has_Static_Predicate_Aspect (Full_View (E));
1861 Set_Has_Delayed_Aspects (Full_View (E));
1862 Ensure_Freeze_Node (Full_View (E));
1865 -- Case 2b: Aspects corresponding to pragmas with two
1866 -- arguments, where the second argument is a local name
1867 -- referring to the entity, and the first argument is the
1868 -- aspect definition expression.
1872 when Aspect_Convention =>
1874 -- The aspect may be part of the specification of an import
1875 -- or export pragma. Scan the aspect list to gather the
1876 -- other components, if any. The name of the generated
1877 -- pragma is one of Convention/Import/Export.
1880 Args : constant List_Id := New_List (
1881 Make_Pragma_Argument_Association (Sloc (Expr),
1882 Expression => Relocate_Node (Expr)),
1883 Make_Pragma_Argument_Association (Sloc (Ent),
1884 Expression => Ent));
1886 Imp_Exp_Seen : Boolean := False;
1887 -- Flag set when aspect Import or Export has been seen
1889 Imp_Seen : Boolean := False;
1890 -- Flag set when aspect Import has been seen
1894 Extern_Arg : Node_Id;
1899 Extern_Arg := Empty;
1901 Prag_Nam := Chars (Id);
1904 while Present (Asp) loop
1905 Asp_Nam := Chars (Identifier (Asp));
1907 -- Aspects Import and Export take precedence over
1908 -- aspect Convention. As a result the generated pragma
1909 -- must carry the proper interfacing aspect's name.
1911 if Nam_In (Asp_Nam, Name_Import, Name_Export) then
1912 if Imp_Exp_Seen then
1913 Error_Msg_N ("conflicting", Asp);
1915 Imp_Exp_Seen := True;
1917 if Asp_Nam = Name_Import then
1922 Prag_Nam := Asp_Nam;
1924 -- Aspect External_Name adds an extra argument to the
1925 -- generated pragma.
1927 elsif Asp_Nam = Name_External_Name then
1929 Make_Pragma_Argument_Association (Loc,
1931 Expression => Relocate_Node (Expression (Asp)));
1933 -- Aspect Link_Name adds an extra argument to the
1934 -- generated pragma.
1936 elsif Asp_Nam = Name_Link_Name then
1938 Make_Pragma_Argument_Association (Loc,
1940 Expression => Relocate_Node (Expression (Asp)));
1946 -- Assemble the full argument list
1948 if Present (Extern_Arg) then
1949 Append_To (Args, Extern_Arg);
1952 if Present (Link_Arg) then
1953 Append_To (Args, Link_Arg);
1957 (Pragma_Argument_Associations => Args,
1958 Pragma_Name => Prag_Nam);
1960 -- Store the generated pragma Import in the related
1963 if Imp_Seen and then Is_Subprogram (E) then
1964 Set_Import_Pragma (E, Aitem);
1968 -- CPU, Interrupt_Priority, Priority
1970 -- These three aspects can be specified for a subprogram spec
1971 -- or body, in which case we analyze the expression and export
1972 -- the value of the aspect.
1974 -- Previously, we generated an equivalent pragma for bodies
1975 -- (note that the specs cannot contain these pragmas). The
1976 -- pragma was inserted ahead of local declarations, rather than
1977 -- after the body. This leads to a certain duplication between
1978 -- the processing performed for the aspect and the pragma, but
1979 -- given the straightforward handling required it is simpler
1980 -- to duplicate than to translate the aspect in the spec into
1981 -- a pragma in the declarative part of the body.
1984 Aspect_Interrupt_Priority |
1987 if Nkind_In (N, N_Subprogram_Body,
1988 N_Subprogram_Declaration)
1990 -- Analyze the aspect expression
1992 Analyze_And_Resolve (Expr, Standard_Integer);
1994 -- Interrupt_Priority aspect not allowed for main
1995 -- subprograms. ARM D.1 does not forbid this explicitly,
1996 -- but ARM J.15.11 (6/3) does not permit pragma
1997 -- Interrupt_Priority for subprograms.
1999 if A_Id = Aspect_Interrupt_Priority then
2001 ("Interrupt_Priority aspect cannot apply to "
2002 & "subprogram", Expr);
2004 -- The expression must be static
2006 elsif not Is_OK_Static_Expression (Expr) then
2007 Flag_Non_Static_Expr
2008 ("aspect requires static expression!", Expr);
2010 -- Check whether this is the main subprogram. Issue a
2011 -- warning only if it is obviously not a main program
2012 -- (when it has parameters or when the subprogram is
2013 -- within a package).
2015 elsif Present (Parameter_Specifications
2016 (Specification (N)))
2017 or else not Is_Compilation_Unit (Defining_Entity (N))
2019 -- See ARM D.1 (14/3) and D.16 (12/3)
2022 ("aspect applied to subprogram other than the "
2023 & "main subprogram has no effect??", Expr);
2025 -- Otherwise check in range and export the value
2027 -- For the CPU aspect
2029 elsif A_Id = Aspect_CPU then
2030 if Is_In_Range (Expr, RTE (RE_CPU_Range)) then
2032 -- Value is correct so we export the value to make
2033 -- it available at execution time.
2036 (Main_Unit, UI_To_Int (Expr_Value (Expr)));
2040 ("main subprogram CPU is out of range", Expr);
2043 -- For the Priority aspect
2045 elsif A_Id = Aspect_Priority then
2046 if Is_In_Range (Expr, RTE (RE_Priority)) then
2048 -- Value is correct so we export the value to make
2049 -- it available at execution time.
2052 (Main_Unit, UI_To_Int (Expr_Value (Expr)));
2054 -- Ignore pragma if Relaxed_RM_Semantics to support
2055 -- other targets/non GNAT compilers.
2057 elsif not Relaxed_RM_Semantics then
2059 ("main subprogram priority is out of range",
2064 -- Load an arbitrary entity from System.Tasking.Stages
2065 -- or System.Tasking.Restricted.Stages (depending on
2066 -- the supported profile) to make sure that one of these
2067 -- packages is implicitly with'ed, since we need to have
2068 -- the tasking run time active for the pragma Priority to
2069 -- have any effect. Previously we with'ed the package
2070 -- System.Tasking, but this package does not trigger the
2071 -- required initialization of the run-time library.
2074 Discard : Entity_Id;
2076 if Restricted_Profile then
2077 Discard := RTE (RE_Activate_Restricted_Tasks);
2079 Discard := RTE (RE_Activate_Tasks);
2083 -- Handling for these Aspects in subprograms is complete
2090 -- Pass the aspect as an attribute
2093 Make_Attribute_Definition_Clause (Loc,
2095 Chars => Chars (Id),
2096 Expression => Relocate_Node (Expr));
2101 when Aspect_Warnings =>
2103 (Pragma_Argument_Associations => New_List (
2104 Make_Pragma_Argument_Association (Sloc (Expr),
2105 Expression => Relocate_Node (Expr)),
2106 Make_Pragma_Argument_Association (Loc,
2107 Expression => New_Occurrence_Of (E, Loc))),
2108 Pragma_Name => Chars (Id));
2110 -- Case 2c: Aspects corresponding to pragmas with three
2113 -- Invariant aspects have a first argument that references the
2114 -- entity, a second argument that is the expression and a third
2115 -- argument that is an appropriate message.
2117 -- Invariant, Type_Invariant
2119 when Aspect_Invariant |
2120 Aspect_Type_Invariant =>
2122 -- Analysis of the pragma will verify placement legality:
2123 -- an invariant must apply to a private type, or appear in
2124 -- the private part of a spec and apply to a completion.
2127 (Pragma_Argument_Associations => New_List (
2128 Make_Pragma_Argument_Association (Sloc (Ent),
2130 Make_Pragma_Argument_Association (Sloc (Expr),
2131 Expression => Relocate_Node (Expr))),
2132 Pragma_Name => Name_Invariant);
2134 -- Add message unless exception messages are suppressed
2136 if not Opt.Exception_Locations_Suppressed then
2137 Append_To (Pragma_Argument_Associations (Aitem),
2138 Make_Pragma_Argument_Association (Eloc,
2139 Chars => Name_Message,
2141 Make_String_Literal (Eloc,
2142 Strval => "failed invariant from "
2143 & Build_Location_String (Eloc))));
2146 -- For Invariant case, insert immediately after the entity
2147 -- declaration. We do not have to worry about delay issues
2148 -- since the pragma processing takes care of this.
2150 Delay_Required := False;
2152 -- Case 2d : Aspects that correspond to a pragma with one
2157 -- Aspect Abstract_State introduces implicit declarations for
2158 -- all state abstraction entities it defines. To emulate this
2159 -- behavior, insert the pragma at the beginning of the visible
2160 -- declarations of the related package so that it is analyzed
2163 when Aspect_Abstract_State => Abstract_State : declare
2164 Context : Node_Id := N;
2169 -- When aspect Abstract_State appears on a generic package,
2170 -- it is propageted to the package instance. The context in
2171 -- this case is the instance spec.
2173 if Nkind (Context) = N_Package_Instantiation then
2174 Context := Instance_Spec (Context);
2177 if Nkind_In (Context, N_Generic_Package_Declaration,
2178 N_Package_Declaration)
2181 (Pragma_Argument_Associations => New_List (
2182 Make_Pragma_Argument_Association (Loc,
2183 Expression => Relocate_Node (Expr))),
2184 Pragma_Name => Name_Abstract_State);
2185 Decorate (Aspect, Aitem);
2187 Decls := Visible_Declarations (Specification (Context));
2189 -- In general pragma Abstract_State must be at the top
2190 -- of the existing visible declarations to emulate its
2191 -- source counterpart. The only exception to this is a
2192 -- generic instance in which case the pragma must be
2193 -- inserted after the association renamings.
2195 if Present (Decls) then
2196 Decl := First (Decls);
2198 -- The visible declarations of a generic instance have
2199 -- the following structure:
2201 -- <renamings of generic formals>
2202 -- <renamings of internally-generated spec and body>
2203 -- <first source declaration>
2205 -- The pragma must be inserted before the first source
2206 -- declaration, skip the instance "header".
2208 if Is_Generic_Instance (Defining_Entity (Context)) then
2209 while Present (Decl)
2210 and then not Comes_From_Source (Decl)
2212 Decl := Next (Decl);
2216 -- When aspects Abstract_State, Ghost,
2217 -- Initial_Condition and Initializes are out of order,
2218 -- ensure that pragma SPARK_Mode is always at the top
2219 -- of the declarations to properly enabled/suppress
2222 Insert_After_SPARK_Mode
2227 -- Otherwise the pragma forms a new declarative list
2230 Set_Visible_Declarations
2231 (Specification (Context), New_List (Aitem));
2236 ("aspect & must apply to a package declaration",
2243 -- Aspect Default_Internal_Condition is never delayed because
2244 -- it is equivalent to a source pragma which appears after the
2245 -- related private type. To deal with forward references, the
2246 -- generated pragma is stored in the rep chain of the related
2247 -- private type as types do not carry contracts. The pragma is
2248 -- wrapped inside of a procedure at the freeze point of the
2249 -- private type's full view.
2251 when Aspect_Default_Initial_Condition =>
2253 (Pragma_Argument_Associations => New_List (
2254 Make_Pragma_Argument_Association (Loc,
2255 Expression => Relocate_Node (Expr))),
2257 Name_Default_Initial_Condition);
2259 Decorate (Aspect, Aitem);
2260 Insert_Pragma (Aitem);
2263 -- Default_Storage_Pool
2265 when Aspect_Default_Storage_Pool =>
2267 (Pragma_Argument_Associations => New_List (
2268 Make_Pragma_Argument_Association (Loc,
2269 Expression => Relocate_Node (Expr))),
2271 Name_Default_Storage_Pool);
2273 Decorate (Aspect, Aitem);
2274 Insert_Pragma (Aitem);
2279 -- Aspect Depends is never delayed because it is equivalent to
2280 -- a source pragma which appears after the related subprogram.
2281 -- To deal with forward references, the generated pragma is
2282 -- stored in the contract of the related subprogram and later
2283 -- analyzed at the end of the declarative region. See routine
2284 -- Analyze_Depends_In_Decl_Part for details.
2286 when Aspect_Depends =>
2288 (Pragma_Argument_Associations => New_List (
2289 Make_Pragma_Argument_Association (Loc,
2290 Expression => Relocate_Node (Expr))),
2291 Pragma_Name => Name_Depends);
2293 Decorate (Aspect, Aitem);
2294 Insert_Pragma (Aitem);
2297 -- Aspect Extensions_Visible is never delayed because it is
2298 -- equivalent to a source pragma which appears after the
2299 -- related subprogram.
2301 when Aspect_Extensions_Visible =>
2303 (Pragma_Argument_Associations => New_List (
2304 Make_Pragma_Argument_Association (Loc,
2305 Expression => Relocate_Node (Expr))),
2306 Pragma_Name => Name_Extensions_Visible);
2308 Decorate (Aspect, Aitem);
2309 Insert_Pragma (Aitem);
2312 -- Aspect Ghost is never delayed because it is equivalent to a
2313 -- source pragma which appears at the top of [generic] package
2314 -- declarations or after an object, a [generic] subprogram, or
2315 -- a type declaration.
2317 when Aspect_Ghost => Ghost : declare
2322 (Pragma_Argument_Associations => New_List (
2323 Make_Pragma_Argument_Association (Loc,
2324 Expression => Relocate_Node (Expr))),
2325 Pragma_Name => Name_Ghost);
2327 Decorate (Aspect, Aitem);
2329 -- When the aspect applies to a [generic] package, insert
2330 -- the pragma at the top of the visible declarations. This
2331 -- emulates the placement of a source pragma.
2333 if Nkind_In (N, N_Generic_Package_Declaration,
2334 N_Package_Declaration)
2336 Decls := Visible_Declarations (Specification (N));
2340 Set_Visible_Declarations (N, Decls);
2343 -- When aspects Abstract_State, Ghost, Initial_Condition
2344 -- and Initializes are out of order, ensure that pragma
2345 -- SPARK_Mode is always at the top of the declarations to
2346 -- properly enabled/suppress errors.
2348 Insert_After_SPARK_Mode
2350 Ins_Nod => First (Decls),
2353 -- Otherwise the context is an object, [generic] subprogram
2354 -- or type declaration.
2357 Insert_Pragma (Aitem);
2365 -- Aspect Global is never delayed because it is equivalent to
2366 -- a source pragma which appears after the related subprogram.
2367 -- To deal with forward references, the generated pragma is
2368 -- stored in the contract of the related subprogram and later
2369 -- analyzed at the end of the declarative region. See routine
2370 -- Analyze_Global_In_Decl_Part for details.
2372 when Aspect_Global =>
2374 (Pragma_Argument_Associations => New_List (
2375 Make_Pragma_Argument_Association (Loc,
2376 Expression => Relocate_Node (Expr))),
2377 Pragma_Name => Name_Global);
2379 Decorate (Aspect, Aitem);
2380 Insert_Pragma (Aitem);
2383 -- Initial_Condition
2385 -- Aspect Initial_Condition is never delayed because it is
2386 -- equivalent to a source pragma which appears after the
2387 -- related package. To deal with forward references, the
2388 -- generated pragma is stored in the contract of the related
2389 -- package and later analyzed at the end of the declarative
2390 -- region. See routine Analyze_Initial_Condition_In_Decl_Part
2393 when Aspect_Initial_Condition => Initial_Condition : declare
2394 Context : Node_Id := N;
2398 -- When aspect Initial_Condition appears on a generic
2399 -- package, it is propageted to the package instance. The
2400 -- context in this case is the instance spec.
2402 if Nkind (Context) = N_Package_Instantiation then
2403 Context := Instance_Spec (Context);
2406 if Nkind_In (Context, N_Generic_Package_Declaration,
2407 N_Package_Declaration)
2409 Decls := Visible_Declarations (Specification (Context));
2412 (Pragma_Argument_Associations => New_List (
2413 Make_Pragma_Argument_Association (Loc,
2414 Expression => Relocate_Node (Expr))),
2416 Name_Initial_Condition);
2417 Decorate (Aspect, Aitem);
2421 Set_Visible_Declarations (Context, Decls);
2424 -- When aspects Abstract_State, Ghost, Initial_Condition
2425 -- and Initializes are out of order, ensure that pragma
2426 -- SPARK_Mode is always at the top of the declarations to
2427 -- properly enabled/suppress errors.
2429 Insert_After_SPARK_Mode
2431 Ins_Nod => First (Decls),
2436 ("aspect & must apply to a package declaration",
2441 end Initial_Condition;
2445 -- Aspect Initializes is never delayed because it is equivalent
2446 -- to a source pragma appearing after the related package. To
2447 -- deal with forward references, the generated pragma is stored
2448 -- in the contract of the related package and later analyzed at
2449 -- the end of the declarative region. For details, see routine
2450 -- Analyze_Initializes_In_Decl_Part.
2452 when Aspect_Initializes => Initializes : declare
2453 Context : Node_Id := N;
2457 -- When aspect Initializes appears on a generic package,
2458 -- it is propageted to the package instance. The context
2459 -- in this case is the instance spec.
2461 if Nkind (Context) = N_Package_Instantiation then
2462 Context := Instance_Spec (Context);
2465 if Nkind_In (Context, N_Generic_Package_Declaration,
2466 N_Package_Declaration)
2468 Decls := Visible_Declarations (Specification (Context));
2471 (Pragma_Argument_Associations => New_List (
2472 Make_Pragma_Argument_Association (Loc,
2473 Expression => Relocate_Node (Expr))),
2474 Pragma_Name => Name_Initializes);
2475 Decorate (Aspect, Aitem);
2479 Set_Visible_Declarations (Context, Decls);
2482 -- When aspects Abstract_State, Ghost, Initial_Condition
2483 -- and Initializes are out of order, ensure that pragma
2484 -- SPARK_Mode is always at the top of the declarations to
2485 -- properly enabled/suppress errors.
2487 Insert_After_SPARK_Mode
2489 Ins_Nod => First (Decls),
2494 ("aspect & must apply to a package declaration",
2503 when Aspect_Obsolescent => declare
2511 Make_Pragma_Argument_Association (Sloc (Expr),
2512 Expression => Relocate_Node (Expr)));
2516 (Pragma_Argument_Associations => Args,
2517 Pragma_Name => Chars (Id));
2522 when Aspect_Part_Of =>
2523 if Nkind_In (N, N_Object_Declaration,
2524 N_Package_Instantiation)
2527 (Pragma_Argument_Associations => New_List (
2528 Make_Pragma_Argument_Association (Loc,
2529 Expression => Relocate_Node (Expr))),
2530 Pragma_Name => Name_Part_Of);
2534 ("aspect & must apply to a variable or package "
2535 & "instantiation", Aspect, Id);
2540 when Aspect_SPARK_Mode => SPARK_Mode : declare
2545 (Pragma_Argument_Associations => New_List (
2546 Make_Pragma_Argument_Association (Loc,
2547 Expression => Relocate_Node (Expr))),
2548 Pragma_Name => Name_SPARK_Mode);
2550 -- When the aspect appears on a package or a subprogram
2551 -- body, insert the generated pragma at the top of the body
2552 -- declarations to emulate the behavior of a source pragma.
2554 if Nkind_In (N, N_Package_Body, N_Subprogram_Body) then
2555 Decorate (Aspect, Aitem);
2557 Decls := Declarations (N);
2561 Set_Declarations (N, Decls);
2564 Prepend_To (Decls, Aitem);
2567 -- When the aspect is associated with a [generic] package
2568 -- declaration, insert the generated pragma at the top of
2569 -- the visible declarations to emulate the behavior of a
2572 elsif Nkind_In (N, N_Generic_Package_Declaration,
2573 N_Package_Declaration)
2575 Decorate (Aspect, Aitem);
2577 Decls := Visible_Declarations (Specification (N));
2581 Set_Visible_Declarations (Specification (N), Decls);
2584 Prepend_To (Decls, Aitem);
2591 -- Aspect Refined_Depends is never delayed because it is
2592 -- equivalent to a source pragma which appears in the
2593 -- declarations of the related subprogram body. To deal with
2594 -- forward references, the generated pragma is stored in the
2595 -- contract of the related subprogram body and later analyzed
2596 -- at the end of the declarative region. For details, see
2597 -- routine Analyze_Refined_Depends_In_Decl_Part.
2599 when Aspect_Refined_Depends =>
2601 (Pragma_Argument_Associations => New_List (
2602 Make_Pragma_Argument_Association (Loc,
2603 Expression => Relocate_Node (Expr))),
2604 Pragma_Name => Name_Refined_Depends);
2606 Decorate (Aspect, Aitem);
2607 Insert_Pragma (Aitem);
2612 -- Aspect Refined_Global is never delayed because it is
2613 -- equivalent to a source pragma which appears in the
2614 -- declarations of the related subprogram body. To deal with
2615 -- forward references, the generated pragma is stored in the
2616 -- contract of the related subprogram body and later analyzed
2617 -- at the end of the declarative region. For details, see
2618 -- routine Analyze_Refined_Global_In_Decl_Part.
2620 when Aspect_Refined_Global =>
2622 (Pragma_Argument_Associations => New_List (
2623 Make_Pragma_Argument_Association (Loc,
2624 Expression => Relocate_Node (Expr))),
2625 Pragma_Name => Name_Refined_Global);
2627 Decorate (Aspect, Aitem);
2628 Insert_Pragma (Aitem);
2633 when Aspect_Refined_Post =>
2635 (Pragma_Argument_Associations => New_List (
2636 Make_Pragma_Argument_Association (Loc,
2637 Expression => Relocate_Node (Expr))),
2638 Pragma_Name => Name_Refined_Post);
2642 when Aspect_Refined_State => Refined_State : declare
2646 -- The corresponding pragma for Refined_State is inserted in
2647 -- the declarations of the related package body. This action
2648 -- synchronizes both the source and from-aspect versions of
2651 if Nkind (N) = N_Package_Body then
2652 Decls := Declarations (N);
2655 (Pragma_Argument_Associations => New_List (
2656 Make_Pragma_Argument_Association (Loc,
2657 Expression => Relocate_Node (Expr))),
2658 Pragma_Name => Name_Refined_State);
2659 Decorate (Aspect, Aitem);
2663 Set_Declarations (N, Decls);
2666 -- Pragma Refined_State must be inserted after pragma
2667 -- SPARK_Mode in the tree. This ensures that any error
2668 -- messages dependent on SPARK_Mode will be properly
2669 -- enabled/suppressed.
2671 Insert_After_SPARK_Mode
2673 Ins_Nod => First (Decls),
2678 ("aspect & must apply to a package body", Aspect, Id);
2684 -- Relative_Deadline
2686 when Aspect_Relative_Deadline =>
2688 (Pragma_Argument_Associations => New_List (
2689 Make_Pragma_Argument_Association (Loc,
2690 Expression => Relocate_Node (Expr))),
2691 Pragma_Name => Name_Relative_Deadline);
2693 -- If the aspect applies to a task, the corresponding pragma
2694 -- must appear within its declarations, not after.
2696 if Nkind (N) = N_Task_Type_Declaration then
2702 if No (Task_Definition (N)) then
2703 Set_Task_Definition (N,
2704 Make_Task_Definition (Loc,
2705 Visible_Declarations => New_List,
2706 End_Label => Empty));
2709 Def := Task_Definition (N);
2710 V := Visible_Declarations (Def);
2711 if not Is_Empty_List (V) then
2712 Insert_Before (First (V), Aitem);
2715 Set_Visible_Declarations (Def, New_List (Aitem));
2722 -- Case 2e: Annotate aspect
2724 when Aspect_Annotate =>
2731 -- The argument can be a single identifier
2733 if Nkind (Expr) = N_Identifier then
2735 -- One level of parens is allowed
2737 if Paren_Count (Expr) > 1 then
2738 Error_Msg_F ("extra parentheses ignored", Expr);
2741 Set_Paren_Count (Expr, 0);
2743 -- Add the single item to the list
2745 Args := New_List (Expr);
2747 -- Otherwise we must have an aggregate
2749 elsif Nkind (Expr) = N_Aggregate then
2751 -- Must be positional
2753 if Present (Component_Associations (Expr)) then
2755 ("purely positional aggregate required", Expr);
2759 -- Must not be parenthesized
2761 if Paren_Count (Expr) /= 0 then
2762 Error_Msg_F ("extra parentheses ignored", Expr);
2765 -- List of arguments is list of aggregate expressions
2767 Args := Expressions (Expr);
2769 -- Anything else is illegal
2772 Error_Msg_F ("wrong form for Annotate aspect", Expr);
2776 -- Prepare pragma arguments
2779 Arg := First (Args);
2780 while Present (Arg) loop
2782 Make_Pragma_Argument_Association (Sloc (Arg),
2783 Expression => Relocate_Node (Arg)));
2788 Make_Pragma_Argument_Association (Sloc (Ent),
2789 Chars => Name_Entity,
2790 Expression => Ent));
2793 (Pragma_Argument_Associations => Pargs,
2794 Pragma_Name => Name_Annotate);
2797 -- Case 3 : Aspects that don't correspond to pragma/attribute
2798 -- definition clause.
2800 -- Case 3a: The aspects listed below don't correspond to
2801 -- pragmas/attributes but do require delayed analysis.
2803 -- Default_Value can only apply to a scalar type
2805 when Aspect_Default_Value =>
2806 if not Is_Scalar_Type (E) then
2808 ("aspect Default_Value must apply to a scalar type", N);
2813 -- Default_Component_Value can only apply to an array type
2814 -- with scalar components.
2816 when Aspect_Default_Component_Value =>
2817 if not (Is_Array_Type (E)
2818 and then Is_Scalar_Type (Component_Type (E)))
2820 Error_Msg_N ("aspect Default_Component_Value can only "
2821 & "apply to an array of scalar components", N);
2826 -- Case 3b: The aspects listed below don't correspond to
2827 -- pragmas/attributes and don't need delayed analysis.
2829 -- Implicit_Dereference
2831 -- For Implicit_Dereference, External_Name and Link_Name, only
2832 -- the legality checks are done during the analysis, thus no
2833 -- delay is required.
2835 when Aspect_Implicit_Dereference =>
2836 Analyze_Aspect_Implicit_Dereference;
2839 -- External_Name, Link_Name
2841 when Aspect_External_Name |
2843 Analyze_Aspect_External_Or_Link_Name;
2848 when Aspect_Dimension =>
2849 Analyze_Aspect_Dimension (N, Id, Expr);
2854 when Aspect_Dimension_System =>
2855 Analyze_Aspect_Dimension_System (N, Id, Expr);
2858 -- Case 4: Aspects requiring special handling
2860 -- Pre/Post/Test_Case/Contract_Cases whose corresponding
2861 -- pragmas take care of the delay.
2865 -- Aspects Pre/Post generate Precondition/Postcondition pragmas
2866 -- with a first argument that is the expression, and a second
2867 -- argument that is an informative message if the test fails.
2868 -- This is inserted right after the declaration, to get the
2869 -- required pragma placement. The processing for the pragmas
2870 -- takes care of the required delay.
2872 when Pre_Post_Aspects => Pre_Post : declare
2876 if A_Id = Aspect_Pre or else A_Id = Aspect_Precondition then
2877 Pname := Name_Precondition;
2879 Pname := Name_Postcondition;
2882 -- If the expressions is of the form A and then B, then
2883 -- we generate separate Pre/Post aspects for the separate
2884 -- clauses. Since we allow multiple pragmas, there is no
2885 -- problem in allowing multiple Pre/Post aspects internally.
2886 -- These should be treated in reverse order (B first and
2887 -- A second) since they are later inserted just after N in
2888 -- the order they are treated. This way, the pragma for A
2889 -- ends up preceding the pragma for B, which may have an
2890 -- importance for the error raised (either constraint error
2891 -- or precondition error).
2893 -- We do not do this for Pre'Class, since we have to put
2894 -- these conditions together in a complex OR expression.
2896 -- We do not do this in ASIS mode, as ASIS relies on the
2897 -- original node representing the complete expression, when
2898 -- retrieving it through the source aspect table.
2901 and then (Pname = Name_Postcondition
2902 or else not Class_Present (Aspect))
2904 while Nkind (Expr) = N_And_Then loop
2905 Insert_After (Aspect,
2906 Make_Aspect_Specification (Sloc (Left_Opnd (Expr)),
2907 Identifier => Identifier (Aspect),
2908 Expression => Relocate_Node (Left_Opnd (Expr)),
2909 Class_Present => Class_Present (Aspect),
2910 Split_PPC => True));
2911 Rewrite (Expr, Relocate_Node (Right_Opnd (Expr)));
2912 Eloc := Sloc (Expr);
2916 -- Build the precondition/postcondition pragma
2918 -- Add note about why we do NOT need Copy_Tree here???
2921 (Pragma_Argument_Associations => New_List (
2922 Make_Pragma_Argument_Association (Eloc,
2923 Chars => Name_Check,
2924 Expression => Relocate_Node (Expr))),
2925 Pragma_Name => Pname);
2927 -- Add message unless exception messages are suppressed
2929 if not Opt.Exception_Locations_Suppressed then
2930 Append_To (Pragma_Argument_Associations (Aitem),
2931 Make_Pragma_Argument_Association (Eloc,
2932 Chars => Name_Message,
2934 Make_String_Literal (Eloc,
2936 & Get_Name_String (Pname)
2938 & Build_Location_String (Eloc))));
2941 Set_Is_Delayed_Aspect (Aspect);
2943 -- For Pre/Post cases, insert immediately after the entity
2944 -- declaration, since that is the required pragma placement.
2945 -- Note that for these aspects, we do not have to worry
2946 -- about delay issues, since the pragmas themselves deal
2947 -- with delay of visibility for the expression analysis.
2949 Insert_Pragma (Aitem);
2956 when Aspect_Test_Case => Test_Case : declare
2958 Comp_Expr : Node_Id;
2959 Comp_Assn : Node_Id;
2965 if Nkind (Parent (N)) = N_Compilation_Unit then
2966 Error_Msg_Name_1 := Nam;
2967 Error_Msg_N ("incorrect placement of aspect `%`", E);
2971 if Nkind (Expr) /= N_Aggregate then
2972 Error_Msg_Name_1 := Nam;
2974 ("wrong syntax for aspect `%` for &", Id, E);
2978 -- Make pragma expressions refer to the original aspect
2979 -- expressions through the Original_Node link. This is used
2980 -- in semantic analysis for ASIS mode, so that the original
2981 -- expression also gets analyzed.
2983 Comp_Expr := First (Expressions (Expr));
2984 while Present (Comp_Expr) loop
2985 New_Expr := Relocate_Node (Comp_Expr);
2986 Set_Original_Node (New_Expr, Comp_Expr);
2988 Make_Pragma_Argument_Association (Sloc (Comp_Expr),
2989 Expression => New_Expr));
2993 Comp_Assn := First (Component_Associations (Expr));
2994 while Present (Comp_Assn) loop
2995 if List_Length (Choices (Comp_Assn)) /= 1
2997 Nkind (First (Choices (Comp_Assn))) /= N_Identifier
2999 Error_Msg_Name_1 := Nam;
3001 ("wrong syntax for aspect `%` for &", Id, E);
3005 New_Expr := Relocate_Node (Expression (Comp_Assn));
3006 Set_Original_Node (New_Expr, Expression (Comp_Assn));
3008 Make_Pragma_Argument_Association (Sloc (Comp_Assn),
3009 Chars => Chars (First (Choices (Comp_Assn))),
3010 Expression => New_Expr));
3014 -- Build the test-case pragma
3017 (Pragma_Argument_Associations => Args,
3018 Pragma_Name => Nam);
3023 when Aspect_Contract_Cases =>
3025 (Pragma_Argument_Associations => New_List (
3026 Make_Pragma_Argument_Association (Loc,
3027 Expression => Relocate_Node (Expr))),
3028 Pragma_Name => Nam);
3030 Decorate (Aspect, Aitem);
3031 Insert_Pragma (Aitem);
3034 -- Case 5: Special handling for aspects with an optional
3035 -- boolean argument.
3037 -- In the general case, the corresponding pragma cannot be
3038 -- generated yet because the evaluation of the boolean needs
3039 -- to be delayed till the freeze point.
3041 when Boolean_Aspects |
3042 Library_Unit_Aspects =>
3044 Set_Is_Boolean_Aspect (Aspect);
3046 -- Lock_Free aspect only apply to protected objects
3048 if A_Id = Aspect_Lock_Free then
3049 if Ekind (E) /= E_Protected_Type then
3050 Error_Msg_Name_1 := Nam;
3052 ("aspect % only applies to a protected object",
3056 -- Set the Uses_Lock_Free flag to True if there is no
3057 -- expression or if the expression is True. The
3058 -- evaluation of this aspect should be delayed to the
3059 -- freeze point (why???)
3062 or else Is_True (Static_Boolean (Expr))
3064 Set_Uses_Lock_Free (E);
3067 Record_Rep_Item (E, Aspect);
3072 elsif A_Id = Aspect_Import or else A_Id = Aspect_Export then
3074 -- For the case of aspects Import and Export, we don't
3075 -- consider that we know the entity is never set in the
3076 -- source, since it is is likely modified outside the
3079 -- Note: one might think that the analysis of the
3080 -- resulting pragma would take care of that, but
3081 -- that's not the case since it won't be from source.
3083 if Ekind (E) = E_Variable then
3084 Set_Never_Set_In_Source (E, False);
3087 -- In older versions of Ada the corresponding pragmas
3088 -- specified a Convention. In Ada 2012 the convention is
3089 -- specified as a separate aspect, and it is optional,
3090 -- given that it defaults to Convention_Ada. The code
3091 -- that verifed that there was a matching convention
3094 -- Resolve the expression of an Import or Export here,
3095 -- and require it to be of type Boolean and static. This
3096 -- is not quite right, because in general this should be
3097 -- delayed, but that seems tricky for these, because
3098 -- normally Boolean aspects are replaced with pragmas at
3099 -- the freeze point (in Make_Pragma_From_Boolean_Aspect),
3100 -- but in the case of these aspects we can't generate
3101 -- a simple pragma with just the entity name. ???
3103 if not Present (Expr)
3104 or else Is_True (Static_Boolean (Expr))
3106 if A_Id = Aspect_Import then
3107 Set_Is_Imported (E);
3109 -- An imported entity cannot have an explicit
3112 if Nkind (N) = N_Object_Declaration
3113 and then Present (Expression (N))
3116 ("imported entities cannot be initialized "
3117 & "(RM B.1(24))", Expression (N));
3120 elsif A_Id = Aspect_Export then
3121 Set_Is_Exported (E);
3128 -- Library unit aspects require special handling in the case
3129 -- of a package declaration, the pragma needs to be inserted
3130 -- in the list of declarations for the associated package.
3131 -- There is no issue of visibility delay for these aspects.
3133 if A_Id in Library_Unit_Aspects
3135 Nkind_In (N, N_Package_Declaration,
3136 N_Generic_Package_Declaration)
3137 and then Nkind (Parent (N)) /= N_Compilation_Unit
3139 -- Aspect is legal on a local instantiation of a library-
3140 -- level generic unit.
3142 and then not Is_Generic_Instance (Defining_Entity (N))
3145 ("incorrect context for library unit aspect&", Id);
3149 -- External property aspects are Boolean by nature, but
3150 -- their pragmas must contain two arguments, the second
3151 -- being the optional Boolean expression.
3153 if A_Id = Aspect_Async_Readers or else
3154 A_Id = Aspect_Async_Writers or else
3155 A_Id = Aspect_Effective_Reads or else
3156 A_Id = Aspect_Effective_Writes
3162 -- The first argument of the external property pragma
3163 -- is the related object.
3167 Make_Pragma_Argument_Association (Sloc (Ent),
3168 Expression => Ent));
3170 -- The second argument is the optional Boolean
3171 -- expression which must be propagated even if it
3172 -- evaluates to False as this has special semantic
3175 if Present (Expr) then
3177 Make_Pragma_Argument_Association (Loc,
3178 Expression => Relocate_Node (Expr)));
3182 (Pragma_Argument_Associations => Args,
3183 Pragma_Name => Nam);
3186 -- Cases where we do not delay, includes all cases where the
3187 -- expression is missing other than the above cases.
3189 elsif not Delay_Required or else No (Expr) then
3191 (Pragma_Argument_Associations => New_List (
3192 Make_Pragma_Argument_Association (Sloc (Ent),
3193 Expression => Ent)),
3194 Pragma_Name => Chars (Id));
3195 Delay_Required := False;
3197 -- In general cases, the corresponding pragma/attribute
3198 -- definition clause will be inserted later at the freezing
3199 -- point, and we do not need to build it now.
3207 -- This is special because for access types we need to generate
3208 -- an attribute definition clause. This also works for single
3209 -- task declarations, but it does not work for task type
3210 -- declarations, because we have the case where the expression
3211 -- references a discriminant of the task type. That can't use
3212 -- an attribute definition clause because we would not have
3213 -- visibility on the discriminant. For that case we must
3214 -- generate a pragma in the task definition.
3216 when Aspect_Storage_Size =>
3220 if Ekind (E) = E_Task_Type then
3222 Decl : constant Node_Id := Declaration_Node (E);
3225 pragma Assert (Nkind (Decl) = N_Task_Type_Declaration);
3227 -- If no task definition, create one
3229 if No (Task_Definition (Decl)) then
3230 Set_Task_Definition (Decl,
3231 Make_Task_Definition (Loc,
3232 Visible_Declarations => Empty_List,
3233 End_Label => Empty));
3236 -- Create a pragma and put it at the start of the task
3237 -- definition for the task type declaration.
3240 (Pragma_Argument_Associations => New_List (
3241 Make_Pragma_Argument_Association (Loc,
3242 Expression => Relocate_Node (Expr))),
3243 Pragma_Name => Name_Storage_Size);
3247 Visible_Declarations (Task_Definition (Decl)));
3251 -- All other cases, generate attribute definition
3255 Make_Attribute_Definition_Clause (Loc,
3257 Chars => Chars (Id),
3258 Expression => Relocate_Node (Expr));
3262 -- Attach the corresponding pragma/attribute definition clause to
3263 -- the aspect specification node.
3265 if Present (Aitem) then
3266 Set_From_Aspect_Specification (Aitem);
3269 -- In the context of a compilation unit, we directly put the
3270 -- pragma in the Pragmas_After list of the N_Compilation_Unit_Aux
3271 -- node (no delay is required here) except for aspects on a
3272 -- subprogram body (see below) and a generic package, for which we
3273 -- need to introduce the pragma before building the generic copy
3274 -- (see sem_ch12), and for package instantiations, where the
3275 -- library unit pragmas are better handled early.
3277 if Nkind (Parent (N)) = N_Compilation_Unit
3278 and then (Present (Aitem) or else Is_Boolean_Aspect (Aspect))
3281 Aux : constant Node_Id := Aux_Decls_Node (Parent (N));
3284 pragma Assert (Nkind (Aux) = N_Compilation_Unit_Aux);
3286 -- For a Boolean aspect, create the corresponding pragma if
3287 -- no expression or if the value is True.
3289 if Is_Boolean_Aspect (Aspect) and then No (Aitem) then
3290 if Is_True (Static_Boolean (Expr)) then
3292 (Pragma_Argument_Associations => New_List (
3293 Make_Pragma_Argument_Association (Sloc (Ent),
3294 Expression => Ent)),
3295 Pragma_Name => Chars (Id));
3297 Set_From_Aspect_Specification (Aitem, True);
3298 Set_Corresponding_Aspect (Aitem, Aspect);
3305 -- If the aspect is on a subprogram body (relevant aspect
3306 -- is Inline), add the pragma in front of the declarations.
3308 if Nkind (N) = N_Subprogram_Body then
3309 if No (Declarations (N)) then
3310 Set_Declarations (N, New_List);
3313 Prepend (Aitem, Declarations (N));
3315 elsif Nkind (N) = N_Generic_Package_Declaration then
3316 if No (Visible_Declarations (Specification (N))) then
3317 Set_Visible_Declarations (Specification (N), New_List);
3321 Visible_Declarations (Specification (N)));
3323 elsif Nkind (N) = N_Package_Instantiation then
3325 Spec : constant Node_Id :=
3326 Specification (Instance_Spec (N));
3328 if No (Visible_Declarations (Spec)) then
3329 Set_Visible_Declarations (Spec, New_List);
3332 Prepend (Aitem, Visible_Declarations (Spec));
3336 if No (Pragmas_After (Aux)) then
3337 Set_Pragmas_After (Aux, New_List);
3340 Append (Aitem, Pragmas_After (Aux));
3347 -- The evaluation of the aspect is delayed to the freezing point.
3348 -- The pragma or attribute clause if there is one is then attached
3349 -- to the aspect specification which is put in the rep item list.
3351 if Delay_Required then
3352 if Present (Aitem) then
3353 Set_Is_Delayed_Aspect (Aitem);
3354 Set_Aspect_Rep_Item (Aspect, Aitem);
3355 Set_Parent (Aitem, Aspect);
3358 Set_Is_Delayed_Aspect (Aspect);
3360 -- In the case of Default_Value, link the aspect to base type
3361 -- as well, even though it appears on a first subtype. This is
3362 -- mandated by the semantics of the aspect. Do not establish
3363 -- the link when processing the base type itself as this leads
3364 -- to a rep item circularity. Verify that we are dealing with
3365 -- a scalar type to prevent cascaded errors.
3367 if A_Id = Aspect_Default_Value
3368 and then Is_Scalar_Type (E)
3369 and then Base_Type (E) /= E
3371 Set_Has_Delayed_Aspects (Base_Type (E));
3372 Record_Rep_Item (Base_Type (E), Aspect);
3375 Set_Has_Delayed_Aspects (E);
3376 Record_Rep_Item (E, Aspect);
3378 -- When delay is not required and the context is a package or a
3379 -- subprogram body, insert the pragma in the body declarations.
3381 elsif Nkind_In (N, N_Package_Body, N_Subprogram_Body) then
3382 if No (Declarations (N)) then
3383 Set_Declarations (N, New_List);
3386 -- The pragma is added before source declarations
3388 Prepend_To (Declarations (N), Aitem);
3390 -- When delay is not required and the context is not a compilation
3391 -- unit, we simply insert the pragma/attribute definition clause
3395 Insert_After (Ins_Node, Aitem);
3398 end Analyze_One_Aspect;
3402 end loop Aspect_Loop;
3404 if Has_Delayed_Aspects (E) then
3405 Ensure_Freeze_Node (E);
3407 end Analyze_Aspect_Specifications;
3409 -----------------------
3410 -- Analyze_At_Clause --
3411 -----------------------
3413 -- An at clause is replaced by the corresponding Address attribute
3414 -- definition clause that is the preferred approach in Ada 95.
3416 procedure Analyze_At_Clause (N : Node_Id) is
3417 CS : constant Boolean := Comes_From_Source (N);
3420 -- This is an obsolescent feature
3422 Check_Restriction (No_Obsolescent_Features, N);
3424 if Warn_On_Obsolescent_Feature then
3426 ("?j?at clause is an obsolescent feature (RM J.7(2))", N);
3428 ("\?j?use address attribute definition clause instead", N);
3431 -- Rewrite as address clause
3434 Make_Attribute_Definition_Clause (Sloc (N),
3435 Name => Identifier (N),
3436 Chars => Name_Address,
3437 Expression => Expression (N)));
3439 -- We preserve Comes_From_Source, since logically the clause still comes
3440 -- from the source program even though it is changed in form.
3442 Set_Comes_From_Source (N, CS);
3444 -- Analyze rewritten clause
3446 Analyze_Attribute_Definition_Clause (N);
3447 end Analyze_At_Clause;
3449 -----------------------------------------
3450 -- Analyze_Attribute_Definition_Clause --
3451 -----------------------------------------
3453 procedure Analyze_Attribute_Definition_Clause (N : Node_Id) is
3454 Loc : constant Source_Ptr := Sloc (N);
3455 Nam : constant Node_Id := Name (N);
3456 Attr : constant Name_Id := Chars (N);
3457 Expr : constant Node_Id := Expression (N);
3458 Id : constant Attribute_Id := Get_Attribute_Id (Attr);
3461 -- The entity of Nam after it is analyzed. In the case of an incomplete
3462 -- type, this is the underlying type.
3465 -- The underlying entity to which the attribute applies. Generally this
3466 -- is the Underlying_Type of Ent, except in the case where the clause
3467 -- applies to full view of incomplete type or private type in which case
3468 -- U_Ent is just a copy of Ent.
3470 FOnly : Boolean := False;
3471 -- Reset to True for subtype specific attribute (Alignment, Size)
3472 -- and for stream attributes, i.e. those cases where in the call to
3473 -- Rep_Item_Too_Late, FOnly is set True so that only the freezing rules
3474 -- are checked. Note that the case of stream attributes is not clear
3475 -- from the RM, but see AI95-00137. Also, the RM seems to disallow
3476 -- Storage_Size for derived task types, but that is also clearly
3479 procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type);
3480 -- Common processing for 'Read, 'Write, 'Input and 'Output attribute
3481 -- definition clauses.
3483 function Duplicate_Clause return Boolean;
3484 -- This routine checks if the aspect for U_Ent being given by attribute
3485 -- definition clause N is for an aspect that has already been specified,
3486 -- and if so gives an error message. If there is a duplicate, True is
3487 -- returned, otherwise if there is no error, False is returned.
3489 procedure Check_Indexing_Functions;
3490 -- Check that the function in Constant_Indexing or Variable_Indexing
3491 -- attribute has the proper type structure. If the name is overloaded,
3492 -- check that some interpretation is legal.
3494 procedure Check_Iterator_Functions;
3495 -- Check that there is a single function in Default_Iterator attribute
3496 -- has the proper type structure.
3498 function Check_Primitive_Function (Subp : Entity_Id) return Boolean;
3499 -- Common legality check for the previous two
3501 -----------------------------------
3502 -- Analyze_Stream_TSS_Definition --
3503 -----------------------------------
3505 procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type) is
3506 Subp : Entity_Id := Empty;
3511 Is_Read : constant Boolean := (TSS_Nam = TSS_Stream_Read);
3512 -- True for Read attribute, false for other attributes
3514 function Has_Good_Profile (Subp : Entity_Id) return Boolean;
3515 -- Return true if the entity is a subprogram with an appropriate
3516 -- profile for the attribute being defined.
3518 ----------------------
3519 -- Has_Good_Profile --
3520 ----------------------
3522 function Has_Good_Profile (Subp : Entity_Id) return Boolean is
3524 Is_Function : constant Boolean := (TSS_Nam = TSS_Stream_Input);
3525 Expected_Ekind : constant array (Boolean) of Entity_Kind :=
3526 (False => E_Procedure, True => E_Function);
3530 if Ekind (Subp) /= Expected_Ekind (Is_Function) then
3534 F := First_Formal (Subp);
3537 or else Ekind (Etype (F)) /= E_Anonymous_Access_Type
3538 or else Designated_Type (Etype (F)) /=
3539 Class_Wide_Type (RTE (RE_Root_Stream_Type))
3544 if not Is_Function then
3548 Expected_Mode : constant array (Boolean) of Entity_Kind :=
3549 (False => E_In_Parameter,
3550 True => E_Out_Parameter);
3552 if Parameter_Mode (F) /= Expected_Mode (Is_Read) then
3559 -- If the attribute specification comes from an aspect
3560 -- specification for a class-wide stream, the parameter must be
3561 -- a class-wide type of the entity to which the aspect applies.
3563 if From_Aspect_Specification (N)
3564 and then Class_Present (Parent (N))
3565 and then Is_Class_Wide_Type (Typ)
3571 Typ := Etype (Subp);
3574 -- Verify that the prefix of the attribute and the local name for
3575 -- the type of the formal match, or one is the class-wide of the
3576 -- other, in the case of a class-wide stream operation.
3578 if Base_Type (Typ) = Base_Type (Ent)
3579 or else (Is_Class_Wide_Type (Typ)
3580 and then Typ = Class_Wide_Type (Base_Type (Ent)))
3581 or else (Is_Class_Wide_Type (Ent)
3582 and then Ent = Class_Wide_Type (Base_Type (Typ)))
3589 if Present ((Next_Formal (F)))
3593 elsif not Is_Scalar_Type (Typ)
3594 and then not Is_First_Subtype (Typ)
3595 and then not Is_Class_Wide_Type (Typ)
3602 end Has_Good_Profile;
3604 -- Start of processing for Analyze_Stream_TSS_Definition
3609 if not Is_Type (U_Ent) then
3610 Error_Msg_N ("local name must be a subtype", Nam);
3613 elsif not Is_First_Subtype (U_Ent) then
3614 Error_Msg_N ("local name must be a first subtype", Nam);
3618 Pnam := TSS (Base_Type (U_Ent), TSS_Nam);
3620 -- If Pnam is present, it can be either inherited from an ancestor
3621 -- type (in which case it is legal to redefine it for this type), or
3622 -- be a previous definition of the attribute for the same type (in
3623 -- which case it is illegal).
3625 -- In the first case, it will have been analyzed already, and we
3626 -- can check that its profile does not match the expected profile
3627 -- for a stream attribute of U_Ent. In the second case, either Pnam
3628 -- has been analyzed (and has the expected profile), or it has not
3629 -- been analyzed yet (case of a type that has not been frozen yet
3630 -- and for which the stream attribute has been set using Set_TSS).
3633 and then (No (First_Entity (Pnam)) or else Has_Good_Profile (Pnam))
3635 Error_Msg_Sloc := Sloc (Pnam);
3636 Error_Msg_Name_1 := Attr;
3637 Error_Msg_N ("% attribute already defined #", Nam);
3643 if Is_Entity_Name (Expr) then
3644 if not Is_Overloaded (Expr) then
3645 if Has_Good_Profile (Entity (Expr)) then
3646 Subp := Entity (Expr);
3650 Get_First_Interp (Expr, I, It);
3651 while Present (It.Nam) loop
3652 if Has_Good_Profile (It.Nam) then
3657 Get_Next_Interp (I, It);
3662 if Present (Subp) then
3663 if Is_Abstract_Subprogram (Subp) then
3664 Error_Msg_N ("stream subprogram must not be abstract", Expr);
3667 -- A stream subprogram for an interface type must be a null
3668 -- procedure (RM 13.13.2 (38/3)).
3670 elsif Is_Interface (U_Ent)
3671 and then not Is_Class_Wide_Type (U_Ent)
3672 and then not Inside_A_Generic
3674 (Ekind (Subp) = E_Function
3678 (Unit_Declaration_Node (Ultimate_Alias (Subp)))))
3681 ("stream subprogram for interface type "
3682 & "must be null procedure", Expr);
3685 Set_Entity (Expr, Subp);
3686 Set_Etype (Expr, Etype (Subp));
3688 New_Stream_Subprogram (N, U_Ent, Subp, TSS_Nam);
3691 Error_Msg_Name_1 := Attr;
3692 Error_Msg_N ("incorrect expression for% attribute", Expr);
3694 end Analyze_Stream_TSS_Definition;
3696 ------------------------------
3697 -- Check_Indexing_Functions --
3698 ------------------------------
3700 procedure Check_Indexing_Functions is
3701 Indexing_Found : Boolean := False;
3703 procedure Check_One_Function (Subp : Entity_Id);
3704 -- Check one possible interpretation. Sets Indexing_Found True if a
3705 -- legal indexing function is found.
3707 procedure Illegal_Indexing (Msg : String);
3708 -- Diagnose illegal indexing function if not overloaded. In the
3709 -- overloaded case indicate that no legal interpretation exists.
3711 ------------------------
3712 -- Check_One_Function --
3713 ------------------------
3715 procedure Check_One_Function (Subp : Entity_Id) is
3716 Default_Element : Node_Id;
3717 Ret_Type : constant Entity_Id := Etype (Subp);
3720 if not Is_Overloadable (Subp) then
3721 Illegal_Indexing ("illegal indexing function for type&");
3724 elsif Scope (Subp) /= Scope (Ent) then
3725 if Nkind (Expr) = N_Expanded_Name then
3727 -- Indexing function can't be declared elsewhere
3730 ("indexing function must be declared in scope of type&");
3735 elsif No (First_Formal (Subp)) then
3737 ("Indexing requires a function that applies to type&");
3740 elsif No (Next_Formal (First_Formal (Subp))) then
3742 ("indexing function must have at least two parameters");
3745 elsif Is_Derived_Type (Ent) then
3746 if (Attr = Name_Constant_Indexing
3748 (Find_Aspect (Etype (Ent), Aspect_Constant_Indexing)))
3750 (Attr = Name_Variable_Indexing
3752 (Find_Aspect (Etype (Ent), Aspect_Variable_Indexing)))
3754 if Debug_Flag_Dot_XX then
3759 ("indexing function already inherited "
3760 & "from parent type");
3766 if not Check_Primitive_Function (Subp) then
3768 ("Indexing aspect requires a function that applies to type&");
3772 -- If partial declaration exists, verify that it is not tagged.
3774 if Ekind (Current_Scope) = E_Package
3775 and then Has_Private_Declaration (Ent)
3776 and then From_Aspect_Specification (N)
3778 List_Containing (Parent (Ent)) =
3779 Private_Declarations
3780 (Specification (Unit_Declaration_Node (Current_Scope)))
3781 and then Nkind (N) = N_Attribute_Definition_Clause
3788 First (Visible_Declarations
3790 (Unit_Declaration_Node (Current_Scope))));
3792 while Present (Decl) loop
3793 if Nkind (Decl) = N_Private_Type_Declaration
3794 and then Ent = Full_View (Defining_Identifier (Decl))
3795 and then Tagged_Present (Decl)
3796 and then No (Aspect_Specifications (Decl))
3799 ("Indexing aspect cannot be specified on full view "
3800 & "if partial view is tagged");
3809 -- An indexing function must return either the default element of
3810 -- the container, or a reference type. For variable indexing it
3811 -- must be the latter.
3814 Find_Value_Of_Aspect
3815 (Etype (First_Formal (Subp)), Aspect_Iterator_Element);
3817 if Present (Default_Element) then
3818 Analyze (Default_Element);
3820 if Is_Entity_Name (Default_Element)
3821 and then not Covers (Entity (Default_Element), Ret_Type)
3825 ("wrong return type for indexing function");
3830 -- For variable_indexing the return type must be a reference type
3832 if Attr = Name_Variable_Indexing then
3833 if not Has_Implicit_Dereference (Ret_Type) then
3835 ("variable indexing must return a reference type");
3838 elsif Is_Access_Constant
3839 (Etype (First_Discriminant (Ret_Type)))
3842 ("variable indexing must return an access to variable");
3847 if Has_Implicit_Dereference (Ret_Type)
3849 Is_Access_Constant (Etype (First_Discriminant (Ret_Type)))
3852 ("constant indexing must return an access to constant");
3855 elsif Is_Access_Type (Etype (First_Formal (Subp)))
3856 and then not Is_Access_Constant (Etype (First_Formal (Subp)))
3859 ("constant indexing must apply to an access to constant");
3864 -- All checks succeeded.
3866 Indexing_Found := True;
3867 end Check_One_Function;
3869 -----------------------
3870 -- Illegal_Indexing --
3871 -----------------------
3873 procedure Illegal_Indexing (Msg : String) is
3875 Error_Msg_NE (Msg, N, Ent);
3876 end Illegal_Indexing;
3878 -- Start of processing for Check_Indexing_Functions
3887 if not Is_Overloaded (Expr) then
3888 Check_One_Function (Entity (Expr));
3896 Indexing_Found := False;
3897 Get_First_Interp (Expr, I, It);
3898 while Present (It.Nam) loop
3900 -- Note that analysis will have added the interpretation
3901 -- that corresponds to the dereference. We only check the
3902 -- subprogram itself.
3904 if Is_Overloadable (It.Nam) then
3905 Check_One_Function (It.Nam);
3908 Get_Next_Interp (I, It);
3913 if not Indexing_Found and then not Error_Posted (N) then
3915 ("aspect Indexing requires a local function that "
3916 & "applies to type&", Expr, Ent);
3918 end Check_Indexing_Functions;
3920 ------------------------------
3921 -- Check_Iterator_Functions --
3922 ------------------------------
3924 procedure Check_Iterator_Functions is
3925 Default : Entity_Id;
3927 function Valid_Default_Iterator (Subp : Entity_Id) return Boolean;
3928 -- Check one possible interpretation for validity
3930 ----------------------------
3931 -- Valid_Default_Iterator --
3932 ----------------------------
3934 function Valid_Default_Iterator (Subp : Entity_Id) return Boolean is
3938 if not Check_Primitive_Function (Subp) then
3941 Formal := First_Formal (Subp);
3944 -- False if any subsequent formal has no default expression
3946 Formal := Next_Formal (Formal);
3947 while Present (Formal) loop
3948 if No (Expression (Parent (Formal))) then
3952 Next_Formal (Formal);
3955 -- True if all subsequent formals have default expressions
3958 end Valid_Default_Iterator;
3960 -- Start of processing for Check_Iterator_Functions
3965 if not Is_Entity_Name (Expr) then
3966 Error_Msg_N ("aspect Iterator must be a function name", Expr);
3969 if not Is_Overloaded (Expr) then
3970 if not Check_Primitive_Function (Entity (Expr)) then
3972 ("aspect Indexing requires a function that applies to type&",
3973 Entity (Expr), Ent);
3976 if not Valid_Default_Iterator (Entity (Expr)) then
3977 Error_Msg_N ("improper function for default iterator", Expr);
3987 Get_First_Interp (Expr, I, It);
3988 while Present (It.Nam) loop
3989 if not Check_Primitive_Function (It.Nam)
3990 or else not Valid_Default_Iterator (It.Nam)
3994 elsif Present (Default) then
3995 Error_Msg_N ("default iterator must be unique", Expr);
4001 Get_Next_Interp (I, It);
4005 if Present (Default) then
4006 Set_Entity (Expr, Default);
4007 Set_Is_Overloaded (Expr, False);
4010 end Check_Iterator_Functions;
4012 -------------------------------
4013 -- Check_Primitive_Function --
4014 -------------------------------
4016 function Check_Primitive_Function (Subp : Entity_Id) return Boolean is
4020 if Ekind (Subp) /= E_Function then
4024 if No (First_Formal (Subp)) then
4027 Ctrl := Etype (First_Formal (Subp));
4030 -- Type of formal may be the class-wide type, an access to such,
4031 -- or an incomplete view.
4034 or else Ctrl = Class_Wide_Type (Ent)
4036 (Ekind (Ctrl) = E_Anonymous_Access_Type
4037 and then (Designated_Type (Ctrl) = Ent
4039 Designated_Type (Ctrl) = Class_Wide_Type (Ent)))
4041 (Ekind (Ctrl) = E_Incomplete_Type
4042 and then Full_View (Ctrl) = Ent)
4050 end Check_Primitive_Function;
4052 ----------------------
4053 -- Duplicate_Clause --
4054 ----------------------
4056 function Duplicate_Clause return Boolean is
4060 -- Nothing to do if this attribute definition clause comes from
4061 -- an aspect specification, since we could not be duplicating an
4062 -- explicit clause, and we dealt with the case of duplicated aspects
4063 -- in Analyze_Aspect_Specifications.
4065 if From_Aspect_Specification (N) then
4069 -- Otherwise current clause may duplicate previous clause, or a
4070 -- previously given pragma or aspect specification for the same
4073 A := Get_Rep_Item (U_Ent, Chars (N), Check_Parents => False);
4076 Error_Msg_Name_1 := Chars (N);
4077 Error_Msg_Sloc := Sloc (A);
4079 Error_Msg_NE ("aspect% for & previously given#", N, U_Ent);
4084 end Duplicate_Clause;
4086 -- Start of processing for Analyze_Attribute_Definition_Clause
4089 -- The following code is a defense against recursion. Not clear that
4090 -- this can happen legitimately, but perhaps some error situations can
4091 -- cause it, and we did see this recursion during testing.
4093 if Analyzed (N) then
4096 Set_Analyzed (N, True);
4099 -- Ignore some selected attributes in CodePeer mode since they are not
4100 -- relevant in this context.
4102 if CodePeer_Mode then
4105 -- Ignore Component_Size in CodePeer mode, to avoid changing the
4106 -- internal representation of types by implicitly packing them.
4108 when Attribute_Component_Size =>
4109 Rewrite (N, Make_Null_Statement (Sloc (N)));
4117 -- Process Ignore_Rep_Clauses option
4119 if Ignore_Rep_Clauses then
4122 -- The following should be ignored. They do not affect legality
4123 -- and may be target dependent. The basic idea of -gnatI is to
4124 -- ignore any rep clauses that may be target dependent but do not
4125 -- affect legality (except possibly to be rejected because they
4126 -- are incompatible with the compilation target).
4128 when Attribute_Alignment |
4129 Attribute_Bit_Order |
4130 Attribute_Component_Size |
4131 Attribute_Machine_Radix |
4132 Attribute_Object_Size |
4135 Attribute_Stream_Size |
4136 Attribute_Value_Size =>
4137 Kill_Rep_Clause (N);
4140 -- The following should not be ignored, because in the first place
4141 -- they are reasonably portable, and should not cause problems
4142 -- in compiling code from another target, and also they do affect
4143 -- legality, e.g. failing to provide a stream attribute for a type
4144 -- may make a program illegal.
4146 when Attribute_External_Tag |
4150 Attribute_Simple_Storage_Pool |
4151 Attribute_Storage_Pool |
4152 Attribute_Storage_Size |
4156 -- We do not do anything here with address clauses, they will be
4157 -- removed by Freeze later on, but for now, it works better to
4158 -- keep then in the tree.
4160 when Attribute_Address =>
4163 -- Other cases are errors ("attribute& cannot be set with
4164 -- definition clause"), which will be caught below.
4172 Ent := Entity (Nam);
4174 if Rep_Item_Too_Early (Ent, N) then
4178 -- Rep clause applies to full view of incomplete type or private type if
4179 -- we have one (if not, this is a premature use of the type). However,
4180 -- certain semantic checks need to be done on the specified entity (i.e.
4181 -- the private view), so we save it in Ent.
4183 if Is_Private_Type (Ent)
4184 and then Is_Derived_Type (Ent)
4185 and then not Is_Tagged_Type (Ent)
4186 and then No (Full_View (Ent))
4188 -- If this is a private type whose completion is a derivation from
4189 -- another private type, there is no full view, and the attribute
4190 -- belongs to the type itself, not its underlying parent.
4194 elsif Ekind (Ent) = E_Incomplete_Type then
4196 -- The attribute applies to the full view, set the entity of the
4197 -- attribute definition accordingly.
4199 Ent := Underlying_Type (Ent);
4201 Set_Entity (Nam, Ent);
4204 U_Ent := Underlying_Type (Ent);
4207 -- Avoid cascaded error
4209 if Etype (Nam) = Any_Type then
4212 -- Must be declared in current scope or in case of an aspect
4213 -- specification, must be visible in current scope.
4215 elsif Scope (Ent) /= Current_Scope
4217 not (From_Aspect_Specification (N)
4218 and then Scope_Within_Or_Same (Current_Scope, Scope (Ent)))
4220 Error_Msg_N ("entity must be declared in this scope", Nam);
4223 -- Must not be a source renaming (we do have some cases where the
4224 -- expander generates a renaming, and those cases are OK, in such
4225 -- cases any attribute applies to the renamed object as well).
4227 elsif Is_Object (Ent)
4228 and then Present (Renamed_Object (Ent))
4230 -- Case of renamed object from source, this is an error
4232 if Comes_From_Source (Renamed_Object (Ent)) then
4233 Get_Name_String (Chars (N));
4234 Error_Msg_Strlen := Name_Len;
4235 Error_Msg_String (1 .. Name_Len) := Name_Buffer (1 .. Name_Len);
4237 ("~ clause not allowed for a renaming declaration "
4238 & "(RM 13.1(6))", Nam);
4241 -- For the case of a compiler generated renaming, the attribute
4242 -- definition clause applies to the renamed object created by the
4243 -- expander. The easiest general way to handle this is to create a
4244 -- copy of the attribute definition clause for this object.
4246 elsif Is_Entity_Name (Renamed_Object (Ent)) then
4248 Make_Attribute_Definition_Clause (Loc,
4250 New_Occurrence_Of (Entity (Renamed_Object (Ent)), Loc),
4252 Expression => Duplicate_Subexpr (Expression (N))));
4254 -- If the renamed object is not an entity, it must be a dereference
4255 -- of an unconstrained function call, and we must introduce a new
4256 -- declaration to capture the expression. This is needed in the case
4257 -- of 'Alignment, where the original declaration must be rewritten.
4261 (Nkind (Renamed_Object (Ent)) = N_Explicit_Dereference);
4265 -- If no underlying entity, use entity itself, applies to some
4266 -- previously detected error cases ???
4268 elsif No (U_Ent) then
4271 -- Cannot specify for a subtype (exception Object/Value_Size)
4273 elsif Is_Type (U_Ent)
4274 and then not Is_First_Subtype (U_Ent)
4275 and then Id /= Attribute_Object_Size
4276 and then Id /= Attribute_Value_Size
4277 and then not From_At_Mod (N)
4279 Error_Msg_N ("cannot specify attribute for subtype", Nam);
4283 Set_Entity (N, U_Ent);
4284 Check_Restriction_No_Use_Of_Attribute (N);
4286 -- Switch on particular attribute
4294 -- Address attribute definition clause
4296 when Attribute_Address => Address : begin
4298 -- A little error check, catch for X'Address use X'Address;
4300 if Nkind (Nam) = N_Identifier
4301 and then Nkind (Expr) = N_Attribute_Reference
4302 and then Attribute_Name (Expr) = Name_Address
4303 and then Nkind (Prefix (Expr)) = N_Identifier
4304 and then Chars (Nam) = Chars (Prefix (Expr))
4307 ("address for & is self-referencing", Prefix (Expr), Ent);
4311 -- Not that special case, carry on with analysis of expression
4313 Analyze_And_Resolve (Expr, RTE (RE_Address));
4315 -- Even when ignoring rep clauses we need to indicate that the
4316 -- entity has an address clause and thus it is legal to declare
4317 -- it imported. Freeze will get rid of the address clause later.
4319 if Ignore_Rep_Clauses then
4320 if Ekind_In (U_Ent, E_Variable, E_Constant) then
4321 Record_Rep_Item (U_Ent, N);
4327 if Duplicate_Clause then
4330 -- Case of address clause for subprogram
4332 elsif Is_Subprogram (U_Ent) then
4333 if Has_Homonym (U_Ent) then
4335 ("address clause cannot be given " &
4336 "for overloaded subprogram",
4341 -- For subprograms, all address clauses are permitted, and we
4342 -- mark the subprogram as having a deferred freeze so that Gigi
4343 -- will not elaborate it too soon.
4345 -- Above needs more comments, what is too soon about???
4347 Set_Has_Delayed_Freeze (U_Ent);
4349 -- Case of address clause for entry
4351 elsif Ekind (U_Ent) = E_Entry then
4352 if Nkind (Parent (N)) = N_Task_Body then
4354 ("entry address must be specified in task spec", Nam);
4358 -- For entries, we require a constant address
4360 Check_Constant_Address_Clause (Expr, U_Ent);
4362 -- Special checks for task types
4364 if Is_Task_Type (Scope (U_Ent))
4365 and then Comes_From_Source (Scope (U_Ent))
4368 ("??entry address declared for entry in task type", N);
4370 ("\??only one task can be declared of this type", N);
4373 -- Entry address clauses are obsolescent
4375 Check_Restriction (No_Obsolescent_Features, N);
4377 if Warn_On_Obsolescent_Feature then
4379 ("?j?attaching interrupt to task entry is an " &
4380 "obsolescent feature (RM J.7.1)", N);
4382 ("\?j?use interrupt procedure instead", N);
4385 -- Case of an address clause for a controlled object which we
4386 -- consider to be erroneous.
4388 elsif Is_Controlled (Etype (U_Ent))
4389 or else Has_Controlled_Component (Etype (U_Ent))
4392 ("??controlled object& must not be overlaid", Nam, U_Ent);
4394 ("\??Program_Error will be raised at run time", Nam);
4395 Insert_Action (Declaration_Node (U_Ent),
4396 Make_Raise_Program_Error (Loc,
4397 Reason => PE_Overlaid_Controlled_Object));
4400 -- Case of address clause for a (non-controlled) object
4402 elsif Ekind_In (U_Ent, E_Variable, E_Constant) then
4404 Expr : constant Node_Id := Expression (N);
4409 -- Exported variables cannot have an address clause, because
4410 -- this cancels the effect of the pragma Export.
4412 if Is_Exported (U_Ent) then
4414 ("cannot export object with address clause", Nam);
4418 Find_Overlaid_Entity (N, O_Ent, Off);
4420 -- Overlaying controlled objects is erroneous
4423 and then (Has_Controlled_Component (Etype (O_Ent))
4424 or else Is_Controlled (Etype (O_Ent)))
4427 ("??cannot overlay with controlled object", Expr);
4429 ("\??Program_Error will be raised at run time", Expr);
4430 Insert_Action (Declaration_Node (U_Ent),
4431 Make_Raise_Program_Error (Loc,
4432 Reason => PE_Overlaid_Controlled_Object));
4435 elsif Present (O_Ent)
4436 and then Ekind (U_Ent) = E_Constant
4437 and then not Is_Constant_Object (O_Ent)
4439 Error_Msg_N ("??constant overlays a variable", Expr);
4441 -- Imported variables can have an address clause, but then
4442 -- the import is pretty meaningless except to suppress
4443 -- initializations, so we do not need such variables to
4444 -- be statically allocated (and in fact it causes trouble
4445 -- if the address clause is a local value).
4447 elsif Is_Imported (U_Ent) then
4448 Set_Is_Statically_Allocated (U_Ent, False);
4451 -- We mark a possible modification of a variable with an
4452 -- address clause, since it is likely aliasing is occurring.
4454 Note_Possible_Modification (Nam, Sure => False);
4456 -- Here we are checking for explicit overlap of one variable
4457 -- by another, and if we find this then mark the overlapped
4458 -- variable as also being volatile to prevent unwanted
4459 -- optimizations. This is a significant pessimization so
4460 -- avoid it when there is an offset, i.e. when the object
4461 -- is composite; they cannot be optimized easily anyway.
4464 and then Is_Object (O_Ent)
4467 -- The following test is an expedient solution to what
4468 -- is really a problem in CodePeer. Suppressing the
4469 -- Set_Treat_As_Volatile call here prevents later
4470 -- generation (in some cases) of trees that CodePeer
4471 -- should, but currently does not, handle correctly.
4472 -- This test should probably be removed when CodePeer
4473 -- is improved, just because we want the tree CodePeer
4474 -- analyzes to match the tree for which we generate code
4475 -- as closely as is practical. ???
4477 and then not CodePeer_Mode
4479 -- ??? O_Ent might not be in current unit
4481 Set_Treat_As_Volatile (O_Ent);
4484 -- Legality checks on the address clause for initialized
4485 -- objects is deferred until the freeze point, because
4486 -- a subsequent pragma might indicate that the object
4487 -- is imported and thus not initialized. Also, the address
4488 -- clause might involve entities that have yet to be
4491 Set_Has_Delayed_Freeze (U_Ent);
4493 -- If an initialization call has been generated for this
4494 -- object, it needs to be deferred to after the freeze node
4495 -- we have just now added, otherwise GIGI will see a
4496 -- reference to the variable (as actual to the IP call)
4497 -- before its definition.
4500 Init_Call : constant Node_Id :=
4501 Remove_Init_Call (U_Ent, N);
4504 if Present (Init_Call) then
4505 Append_Freeze_Action (U_Ent, Init_Call);
4507 -- Reset Initialization_Statements pointer so that
4508 -- if there is a pragma Import further down, it can
4509 -- clear any default initialization.
4511 Set_Initialization_Statements (U_Ent, Init_Call);
4515 if Is_Exported (U_Ent) then
4517 ("& cannot be exported if an address clause is given",
4520 ("\define and export a variable "
4521 & "that holds its address instead", Nam);
4524 -- Entity has delayed freeze, so we will generate an
4525 -- alignment check at the freeze point unless suppressed.
4527 if not Range_Checks_Suppressed (U_Ent)
4528 and then not Alignment_Checks_Suppressed (U_Ent)
4530 Set_Check_Address_Alignment (N);
4533 -- Kill the size check code, since we are not allocating
4534 -- the variable, it is somewhere else.
4536 Kill_Size_Check_Code (U_Ent);
4538 -- If the address clause is of the form:
4540 -- for Y'Address use X'Address
4544 -- Const : constant Address := X'Address;
4546 -- for Y'Address use Const;
4548 -- then we make an entry in the table for checking the size
4549 -- and alignment of the overlaying variable. We defer this
4550 -- check till after code generation to take full advantage
4551 -- of the annotation done by the back end.
4553 -- If the entity has a generic type, the check will be
4554 -- performed in the instance if the actual type justifies
4555 -- it, and we do not insert the clause in the table to
4556 -- prevent spurious warnings.
4558 -- Note: we used to test Comes_From_Source and only give
4559 -- this warning for source entities, but we have removed
4560 -- this test. It really seems bogus to generate overlays
4561 -- that would trigger this warning in generated code.
4562 -- Furthermore, by removing the test, we handle the
4563 -- aspect case properly.
4565 if Address_Clause_Overlay_Warnings
4566 and then Present (O_Ent)
4567 and then Is_Object (O_Ent)
4569 if not Is_Generic_Type (Etype (U_Ent)) then
4570 Address_Clause_Checks.Append ((N, U_Ent, O_Ent, Off));
4573 -- If variable overlays a constant view, and we are
4574 -- warning on overlays, then mark the variable as
4575 -- overlaying a constant (we will give warnings later
4576 -- if this variable is assigned).
4578 if Is_Constant_Object (O_Ent)
4579 and then Ekind (U_Ent) = E_Variable
4581 Set_Overlays_Constant (U_Ent);
4586 -- Not a valid entity for an address clause
4589 Error_Msg_N ("address cannot be given for &", Nam);
4597 -- Alignment attribute definition clause
4599 when Attribute_Alignment => Alignment : declare
4600 Align : constant Uint := Get_Alignment_Value (Expr);
4601 Max_Align : constant Uint := UI_From_Int (Maximum_Alignment);
4606 if not Is_Type (U_Ent)
4607 and then Ekind (U_Ent) /= E_Variable
4608 and then Ekind (U_Ent) /= E_Constant
4610 Error_Msg_N ("alignment cannot be given for &", Nam);
4612 elsif Duplicate_Clause then
4615 elsif Align /= No_Uint then
4616 Set_Has_Alignment_Clause (U_Ent);
4618 -- Tagged type case, check for attempt to set alignment to a
4619 -- value greater than Max_Align, and reset if so.
4621 if Is_Tagged_Type (U_Ent) and then Align > Max_Align then
4623 ("alignment for & set to Maximum_Aligment??", Nam);
4624 Set_Alignment (U_Ent, Max_Align);
4629 Set_Alignment (U_Ent, Align);
4632 -- For an array type, U_Ent is the first subtype. In that case,
4633 -- also set the alignment of the anonymous base type so that
4634 -- other subtypes (such as the itypes for aggregates of the
4635 -- type) also receive the expected alignment.
4637 if Is_Array_Type (U_Ent) then
4638 Set_Alignment (Base_Type (U_Ent), Align);
4647 -- Bit_Order attribute definition clause
4649 when Attribute_Bit_Order => Bit_Order : declare
4651 if not Is_Record_Type (U_Ent) then
4653 ("Bit_Order can only be defined for record type", Nam);
4655 elsif Duplicate_Clause then
4659 Analyze_And_Resolve (Expr, RTE (RE_Bit_Order));
4661 if Etype (Expr) = Any_Type then
4664 elsif not Is_OK_Static_Expression (Expr) then
4665 Flag_Non_Static_Expr
4666 ("Bit_Order requires static expression!", Expr);
4669 if (Expr_Value (Expr) = 0) /= Bytes_Big_Endian then
4670 Set_Reverse_Bit_Order (Base_Type (U_Ent), True);
4676 --------------------
4677 -- Component_Size --
4678 --------------------
4680 -- Component_Size attribute definition clause
4682 when Attribute_Component_Size => Component_Size_Case : declare
4683 Csize : constant Uint := Static_Integer (Expr);
4687 New_Ctyp : Entity_Id;
4691 if not Is_Array_Type (U_Ent) then
4692 Error_Msg_N ("component size requires array type", Nam);
4696 Btype := Base_Type (U_Ent);
4697 Ctyp := Component_Type (Btype);
4699 if Duplicate_Clause then
4702 elsif Rep_Item_Too_Early (Btype, N) then
4705 elsif Csize /= No_Uint then
4706 Check_Size (Expr, Ctyp, Csize, Biased);
4708 -- For the biased case, build a declaration for a subtype that
4709 -- will be used to represent the biased subtype that reflects
4710 -- the biased representation of components. We need the subtype
4711 -- to get proper conversions on referencing elements of the
4712 -- array. Note: component size clauses are ignored in VM mode.
4714 if VM_Target = No_VM then
4717 Make_Defining_Identifier (Loc,
4719 New_External_Name (Chars (U_Ent), 'C', 0, 'T'));
4722 Make_Subtype_Declaration (Loc,
4723 Defining_Identifier => New_Ctyp,
4724 Subtype_Indication =>
4725 New_Occurrence_Of (Component_Type (Btype), Loc));
4727 Set_Parent (Decl, N);
4728 Analyze (Decl, Suppress => All_Checks);
4730 Set_Has_Delayed_Freeze (New_Ctyp, False);
4731 Set_Esize (New_Ctyp, Csize);
4732 Set_RM_Size (New_Ctyp, Csize);
4733 Init_Alignment (New_Ctyp);
4734 Set_Is_Itype (New_Ctyp, True);
4735 Set_Associated_Node_For_Itype (New_Ctyp, U_Ent);
4737 Set_Component_Type (Btype, New_Ctyp);
4738 Set_Biased (New_Ctyp, N, "component size clause");
4741 Set_Component_Size (Btype, Csize);
4743 -- For VM case, we ignore component size clauses
4746 -- Give a warning unless we are in GNAT mode, in which case
4747 -- the warning is suppressed since it is not useful.
4749 if not GNAT_Mode then
4751 ("component size ignored in this configuration??", N);
4755 -- Deal with warning on overridden size
4757 if Warn_On_Overridden_Size
4758 and then Has_Size_Clause (Ctyp)
4759 and then RM_Size (Ctyp) /= Csize
4762 ("component size overrides size clause for&?S?", N, Ctyp);
4765 Set_Has_Component_Size_Clause (Btype, True);
4766 Set_Has_Non_Standard_Rep (Btype, True);
4768 end Component_Size_Case;
4770 -----------------------
4771 -- Constant_Indexing --
4772 -----------------------
4774 when Attribute_Constant_Indexing =>
4775 Check_Indexing_Functions;
4781 when Attribute_CPU => CPU :
4783 -- CPU attribute definition clause not allowed except from aspect
4786 if From_Aspect_Specification (N) then
4787 if not Is_Task_Type (U_Ent) then
4788 Error_Msg_N ("CPU can only be defined for task", Nam);
4790 elsif Duplicate_Clause then
4794 -- The expression must be analyzed in the special manner
4795 -- described in "Handling of Default and Per-Object
4796 -- Expressions" in sem.ads.
4798 -- The visibility to the discriminants must be restored
4800 Push_Scope_And_Install_Discriminants (U_Ent);
4801 Preanalyze_Spec_Expression (Expr, RTE (RE_CPU_Range));
4802 Uninstall_Discriminants_And_Pop_Scope (U_Ent);
4804 if not Is_OK_Static_Expression (Expr) then
4805 Check_Restriction (Static_Priorities, Expr);
4811 ("attribute& cannot be set with definition clause", N);
4815 ----------------------
4816 -- Default_Iterator --
4817 ----------------------
4819 when Attribute_Default_Iterator => Default_Iterator : declare
4824 if not Is_Tagged_Type (U_Ent) then
4826 ("aspect Default_Iterator applies to tagged type", Nam);
4829 Check_Iterator_Functions;
4833 if not Is_Entity_Name (Expr)
4834 or else Ekind (Entity (Expr)) /= E_Function
4836 Error_Msg_N ("aspect Iterator must be a function", Expr);
4838 Func := Entity (Expr);
4841 -- The type of the first parameter must be T, T'class, or a
4842 -- corresponding access type (5.5.1 (8/3)
4844 if No (First_Formal (Func)) then
4847 Typ := Etype (First_Formal (Func));
4851 or else Typ = Class_Wide_Type (U_Ent)
4852 or else (Is_Access_Type (Typ)
4853 and then Designated_Type (Typ) = U_Ent)
4854 or else (Is_Access_Type (Typ)
4855 and then Designated_Type (Typ) =
4856 Class_Wide_Type (U_Ent))
4862 ("Default Iterator must be a primitive of&", Func, U_Ent);
4864 end Default_Iterator;
4866 ------------------------
4867 -- Dispatching_Domain --
4868 ------------------------
4870 when Attribute_Dispatching_Domain => Dispatching_Domain :
4872 -- Dispatching_Domain attribute definition clause not allowed
4873 -- except from aspect specification.
4875 if From_Aspect_Specification (N) then
4876 if not Is_Task_Type (U_Ent) then
4878 ("Dispatching_Domain can only be defined for task", Nam);
4880 elsif Duplicate_Clause then
4884 -- The expression must be analyzed in the special manner
4885 -- described in "Handling of Default and Per-Object
4886 -- Expressions" in sem.ads.
4888 -- The visibility to the discriminants must be restored
4890 Push_Scope_And_Install_Discriminants (U_Ent);
4892 Preanalyze_Spec_Expression
4893 (Expr, RTE (RE_Dispatching_Domain));
4895 Uninstall_Discriminants_And_Pop_Scope (U_Ent);
4900 ("attribute& cannot be set with definition clause", N);
4902 end Dispatching_Domain;
4908 when Attribute_External_Tag => External_Tag :
4910 if not Is_Tagged_Type (U_Ent) then
4911 Error_Msg_N ("should be a tagged type", Nam);
4914 if Duplicate_Clause then
4918 Analyze_And_Resolve (Expr, Standard_String);
4920 if not Is_OK_Static_Expression (Expr) then
4921 Flag_Non_Static_Expr
4922 ("static string required for tag name!", Nam);
4925 if VM_Target /= No_VM then
4926 Error_Msg_Name_1 := Attr;
4928 ("% attribute unsupported in this configuration", Nam);
4931 if not Is_Library_Level_Entity (U_Ent) then
4933 ("??non-unique external tag supplied for &", N, U_Ent);
4935 ("\??same external tag applies to all "
4936 & "subprogram calls", N);
4938 ("\??corresponding internal tag cannot be obtained", N);
4943 --------------------------
4944 -- Implicit_Dereference --
4945 --------------------------
4947 when Attribute_Implicit_Dereference =>
4949 -- Legality checks already performed at the point of the type
4950 -- declaration, aspect is not delayed.
4958 when Attribute_Input =>
4959 Analyze_Stream_TSS_Definition (TSS_Stream_Input);
4960 Set_Has_Specified_Stream_Input (Ent);
4962 ------------------------
4963 -- Interrupt_Priority --
4964 ------------------------
4966 when Attribute_Interrupt_Priority => Interrupt_Priority :
4968 -- Interrupt_Priority attribute definition clause not allowed
4969 -- except from aspect specification.
4971 if From_Aspect_Specification (N) then
4972 if not Is_Concurrent_Type (U_Ent) then
4974 ("Interrupt_Priority can only be defined for task "
4975 & "and protected object", Nam);
4977 elsif Duplicate_Clause then
4981 -- The expression must be analyzed in the special manner
4982 -- described in "Handling of Default and Per-Object
4983 -- Expressions" in sem.ads.
4985 -- The visibility to the discriminants must be restored
4987 Push_Scope_And_Install_Discriminants (U_Ent);
4989 Preanalyze_Spec_Expression
4990 (Expr, RTE (RE_Interrupt_Priority));
4992 Uninstall_Discriminants_And_Pop_Scope (U_Ent);
4997 ("attribute& cannot be set with definition clause", N);
4999 end Interrupt_Priority;
5005 when Attribute_Iterable =>
5008 if Nkind (Expr) /= N_Aggregate then
5009 Error_Msg_N ("aspect Iterable must be an aggregate", Expr);
5016 Assoc := First (Component_Associations (Expr));
5017 while Present (Assoc) loop
5018 if not Is_Entity_Name (Expression (Assoc)) then
5019 Error_Msg_N ("value must be a function", Assoc);
5026 ----------------------
5027 -- Iterator_Element --
5028 ----------------------
5030 when Attribute_Iterator_Element =>
5033 if not Is_Entity_Name (Expr)
5034 or else not Is_Type (Entity (Expr))
5036 Error_Msg_N ("aspect Iterator_Element must be a type", Expr);
5043 -- Machine radix attribute definition clause
5045 when Attribute_Machine_Radix => Machine_Radix : declare
5046 Radix : constant Uint := Static_Integer (Expr);
5049 if not Is_Decimal_Fixed_Point_Type (U_Ent) then
5050 Error_Msg_N ("decimal fixed-point type expected for &", Nam);
5052 elsif Duplicate_Clause then
5055 elsif Radix /= No_Uint then
5056 Set_Has_Machine_Radix_Clause (U_Ent);
5057 Set_Has_Non_Standard_Rep (Base_Type (U_Ent));
5061 elsif Radix = 10 then
5062 Set_Machine_Radix_10 (U_Ent);
5064 Error_Msg_N ("machine radix value must be 2 or 10", Expr);
5073 -- Object_Size attribute definition clause
5075 when Attribute_Object_Size => Object_Size : declare
5076 Size : constant Uint := Static_Integer (Expr);
5079 pragma Warnings (Off, Biased);
5082 if not Is_Type (U_Ent) then
5083 Error_Msg_N ("Object_Size cannot be given for &", Nam);
5085 elsif Duplicate_Clause then
5089 Check_Size (Expr, U_Ent, Size, Biased);
5091 if Is_Scalar_Type (U_Ent) then
5092 if Size /= 8 and then Size /= 16 and then Size /= 32
5093 and then UI_Mod (Size, 64) /= 0
5096 ("Object_Size must be 8, 16, 32, or multiple of 64",
5100 elsif Size mod 8 /= 0 then
5101 Error_Msg_N ("Object_Size must be a multiple of 8", Expr);
5104 Set_Esize (U_Ent, Size);
5105 Set_Has_Object_Size_Clause (U_Ent);
5106 Alignment_Check_For_Size_Change (U_Ent, Size);
5114 when Attribute_Output =>
5115 Analyze_Stream_TSS_Definition (TSS_Stream_Output);
5116 Set_Has_Specified_Stream_Output (Ent);
5122 when Attribute_Priority => Priority :
5124 -- Priority attribute definition clause not allowed except from
5125 -- aspect specification.
5127 if From_Aspect_Specification (N) then
5128 if not (Is_Concurrent_Type (U_Ent)
5129 or else Ekind (U_Ent) = E_Procedure)
5132 ("Priority can only be defined for task and protected "
5135 elsif Duplicate_Clause then
5139 -- The expression must be analyzed in the special manner
5140 -- described in "Handling of Default and Per-Object
5141 -- Expressions" in sem.ads.
5143 -- The visibility to the discriminants must be restored
5145 Push_Scope_And_Install_Discriminants (U_Ent);
5146 Preanalyze_Spec_Expression (Expr, Standard_Integer);
5147 Uninstall_Discriminants_And_Pop_Scope (U_Ent);
5149 if not Is_OK_Static_Expression (Expr) then
5150 Check_Restriction (Static_Priorities, Expr);
5156 ("attribute& cannot be set with definition clause", N);
5164 when Attribute_Read =>
5165 Analyze_Stream_TSS_Definition (TSS_Stream_Read);
5166 Set_Has_Specified_Stream_Read (Ent);
5168 --------------------------
5169 -- Scalar_Storage_Order --
5170 --------------------------
5172 -- Scalar_Storage_Order attribute definition clause
5174 when Attribute_Scalar_Storage_Order => Scalar_Storage_Order : declare
5176 if not (Is_Record_Type (U_Ent) or else Is_Array_Type (U_Ent)) then
5178 ("Scalar_Storage_Order can only be defined for "
5179 & "record or array type", Nam);
5181 elsif Duplicate_Clause then
5185 Analyze_And_Resolve (Expr, RTE (RE_Bit_Order));
5187 if Etype (Expr) = Any_Type then
5190 elsif not Is_OK_Static_Expression (Expr) then
5191 Flag_Non_Static_Expr
5192 ("Scalar_Storage_Order requires static expression!", Expr);
5194 elsif (Expr_Value (Expr) = 0) /= Bytes_Big_Endian then
5196 -- Here for the case of a non-default (i.e. non-confirming)
5197 -- Scalar_Storage_Order attribute definition.
5199 if Support_Nondefault_SSO_On_Target then
5200 Set_Reverse_Storage_Order (Base_Type (U_Ent), True);
5203 ("non-default Scalar_Storage_Order "
5204 & "not supported on target", Expr);
5208 -- Clear SSO default indications since explicit setting of the
5209 -- order overrides the defaults.
5211 Set_SSO_Set_Low_By_Default (Base_Type (U_Ent), False);
5212 Set_SSO_Set_High_By_Default (Base_Type (U_Ent), False);
5214 end Scalar_Storage_Order;
5220 -- Size attribute definition clause
5222 when Attribute_Size => Size : declare
5223 Size : constant Uint := Static_Integer (Expr);
5230 if Duplicate_Clause then
5233 elsif not Is_Type (U_Ent)
5234 and then Ekind (U_Ent) /= E_Variable
5235 and then Ekind (U_Ent) /= E_Constant
5237 Error_Msg_N ("size cannot be given for &", Nam);
5239 elsif Is_Array_Type (U_Ent)
5240 and then not Is_Constrained (U_Ent)
5243 ("size cannot be given for unconstrained array", Nam);
5245 elsif Size /= No_Uint then
5246 if VM_Target /= No_VM and then not GNAT_Mode then
5248 -- Size clause is not handled properly on VM targets.
5249 -- Display a warning unless we are in GNAT mode, in which
5250 -- case this is useless.
5253 ("size clauses are ignored in this configuration??", N);
5256 if Is_Type (U_Ent) then
5259 Etyp := Etype (U_Ent);
5262 -- Check size, note that Gigi is in charge of checking that the
5263 -- size of an array or record type is OK. Also we do not check
5264 -- the size in the ordinary fixed-point case, since it is too
5265 -- early to do so (there may be subsequent small clause that
5266 -- affects the size). We can check the size if a small clause
5267 -- has already been given.
5269 if not Is_Ordinary_Fixed_Point_Type (U_Ent)
5270 or else Has_Small_Clause (U_Ent)
5272 Check_Size (Expr, Etyp, Size, Biased);
5273 Set_Biased (U_Ent, N, "size clause", Biased);
5276 -- For types set RM_Size and Esize if possible
5278 if Is_Type (U_Ent) then
5279 Set_RM_Size (U_Ent, Size);
5281 -- For elementary types, increase Object_Size to power of 2,
5282 -- but not less than a storage unit in any case (normally
5283 -- this means it will be byte addressable).
5285 -- For all other types, nothing else to do, we leave Esize
5286 -- (object size) unset, the back end will set it from the
5287 -- size and alignment in an appropriate manner.
5289 -- In both cases, we check whether the alignment must be
5290 -- reset in the wake of the size change.
5292 if Is_Elementary_Type (U_Ent) then
5293 if Size <= System_Storage_Unit then
5294 Init_Esize (U_Ent, System_Storage_Unit);
5295 elsif Size <= 16 then
5296 Init_Esize (U_Ent, 16);
5297 elsif Size <= 32 then
5298 Init_Esize (U_Ent, 32);
5300 Set_Esize (U_Ent, (Size + 63) / 64 * 64);
5303 Alignment_Check_For_Size_Change (U_Ent, Esize (U_Ent));
5305 Alignment_Check_For_Size_Change (U_Ent, Size);
5308 -- For objects, set Esize only
5311 if Is_Elementary_Type (Etyp) then
5312 if Size /= System_Storage_Unit
5314 Size /= System_Storage_Unit * 2
5316 Size /= System_Storage_Unit * 4
5318 Size /= System_Storage_Unit * 8
5320 Error_Msg_Uint_1 := UI_From_Int (System_Storage_Unit);
5321 Error_Msg_Uint_2 := Error_Msg_Uint_1 * 8;
5323 ("size for primitive object must be a power of 2"
5324 & " in the range ^-^", N);
5328 Set_Esize (U_Ent, Size);
5331 Set_Has_Size_Clause (U_Ent);
5339 -- Small attribute definition clause
5341 when Attribute_Small => Small : declare
5342 Implicit_Base : constant Entity_Id := Base_Type (U_Ent);
5346 Analyze_And_Resolve (Expr, Any_Real);
5348 if Etype (Expr) = Any_Type then
5351 elsif not Is_OK_Static_Expression (Expr) then
5352 Flag_Non_Static_Expr
5353 ("small requires static expression!", Expr);
5357 Small := Expr_Value_R (Expr);
5359 if Small <= Ureal_0 then
5360 Error_Msg_N ("small value must be greater than zero", Expr);
5366 if not Is_Ordinary_Fixed_Point_Type (U_Ent) then
5368 ("small requires an ordinary fixed point type", Nam);
5370 elsif Has_Small_Clause (U_Ent) then
5371 Error_Msg_N ("small already given for &", Nam);
5373 elsif Small > Delta_Value (U_Ent) then
5375 ("small value must not be greater than delta value", Nam);
5378 Set_Small_Value (U_Ent, Small);
5379 Set_Small_Value (Implicit_Base, Small);
5380 Set_Has_Small_Clause (U_Ent);
5381 Set_Has_Small_Clause (Implicit_Base);
5382 Set_Has_Non_Standard_Rep (Implicit_Base);
5390 -- Storage_Pool attribute definition clause
5392 when Attribute_Storage_Pool | Attribute_Simple_Storage_Pool => declare
5397 if Ekind (U_Ent) = E_Access_Subprogram_Type then
5399 ("storage pool cannot be given for access-to-subprogram type",
5404 Ekind_In (U_Ent, E_Access_Type, E_General_Access_Type)
5407 ("storage pool can only be given for access types", Nam);
5410 elsif Is_Derived_Type (U_Ent) then
5412 ("storage pool cannot be given for a derived access type",
5415 elsif Duplicate_Clause then
5418 elsif Present (Associated_Storage_Pool (U_Ent)) then
5419 Error_Msg_N ("storage pool already given for &", Nam);
5423 -- Check for Storage_Size previously given
5426 SS : constant Node_Id :=
5427 Get_Attribute_Definition_Clause
5428 (U_Ent, Attribute_Storage_Size);
5430 if Present (SS) then
5431 Check_Pool_Size_Clash (U_Ent, N, SS);
5435 -- Storage_Pool case
5437 if Id = Attribute_Storage_Pool then
5439 (Expr, Class_Wide_Type (RTE (RE_Root_Storage_Pool)));
5441 -- In the Simple_Storage_Pool case, we allow a variable of any
5442 -- simple storage pool type, so we Resolve without imposing an
5446 Analyze_And_Resolve (Expr);
5448 if not Present (Get_Rep_Pragma
5449 (Etype (Expr), Name_Simple_Storage_Pool_Type))
5452 ("expression must be of a simple storage pool type", Expr);
5456 if not Denotes_Variable (Expr) then
5457 Error_Msg_N ("storage pool must be a variable", Expr);
5461 if Nkind (Expr) = N_Type_Conversion then
5462 T := Etype (Expression (Expr));
5467 -- The Stack_Bounded_Pool is used internally for implementing
5468 -- access types with a Storage_Size. Since it only work properly
5469 -- when used on one specific type, we need to check that it is not
5470 -- hijacked improperly:
5472 -- type T is access Integer;
5473 -- for T'Storage_Size use n;
5474 -- type Q is access Float;
5475 -- for Q'Storage_Size use T'Storage_Size; -- incorrect
5477 if RTE_Available (RE_Stack_Bounded_Pool)
5478 and then Base_Type (T) = RTE (RE_Stack_Bounded_Pool)
5480 Error_Msg_N ("non-shareable internal Pool", Expr);
5484 -- If the argument is a name that is not an entity name, then
5485 -- we construct a renaming operation to define an entity of
5486 -- type storage pool.
5488 if not Is_Entity_Name (Expr)
5489 and then Is_Object_Reference (Expr)
5491 Pool := Make_Temporary (Loc, 'P', Expr);
5494 Rnode : constant Node_Id :=
5495 Make_Object_Renaming_Declaration (Loc,
5496 Defining_Identifier => Pool,
5498 New_Occurrence_Of (Etype (Expr), Loc),
5502 -- If the attribute definition clause comes from an aspect
5503 -- clause, then insert the renaming before the associated
5504 -- entity's declaration, since the attribute clause has
5505 -- not yet been appended to the declaration list.
5507 if From_Aspect_Specification (N) then
5508 Insert_Before (Parent (Entity (N)), Rnode);
5510 Insert_Before (N, Rnode);
5514 Set_Associated_Storage_Pool (U_Ent, Pool);
5517 elsif Is_Entity_Name (Expr) then
5518 Pool := Entity (Expr);
5520 -- If pool is a renamed object, get original one. This can
5521 -- happen with an explicit renaming, and within instances.
5523 while Present (Renamed_Object (Pool))
5524 and then Is_Entity_Name (Renamed_Object (Pool))
5526 Pool := Entity (Renamed_Object (Pool));
5529 if Present (Renamed_Object (Pool))
5530 and then Nkind (Renamed_Object (Pool)) = N_Type_Conversion
5531 and then Is_Entity_Name (Expression (Renamed_Object (Pool)))
5533 Pool := Entity (Expression (Renamed_Object (Pool)));
5536 Set_Associated_Storage_Pool (U_Ent, Pool);
5538 elsif Nkind (Expr) = N_Type_Conversion
5539 and then Is_Entity_Name (Expression (Expr))
5540 and then Nkind (Original_Node (Expr)) = N_Attribute_Reference
5542 Pool := Entity (Expression (Expr));
5543 Set_Associated_Storage_Pool (U_Ent, Pool);
5546 Error_Msg_N ("incorrect reference to a Storage Pool", Expr);
5555 -- Storage_Size attribute definition clause
5557 when Attribute_Storage_Size => Storage_Size : declare
5558 Btype : constant Entity_Id := Base_Type (U_Ent);
5561 if Is_Task_Type (U_Ent) then
5563 -- Check obsolescent (but never obsolescent if from aspect)
5565 if not From_Aspect_Specification (N) then
5566 Check_Restriction (No_Obsolescent_Features, N);
5568 if Warn_On_Obsolescent_Feature then
5570 ("?j?storage size clause for task is an " &
5571 "obsolescent feature (RM J.9)", N);
5572 Error_Msg_N ("\?j?use Storage_Size pragma instead", N);
5579 if not Is_Access_Type (U_Ent)
5580 and then Ekind (U_Ent) /= E_Task_Type
5582 Error_Msg_N ("storage size cannot be given for &", Nam);
5584 elsif Is_Access_Type (U_Ent) and Is_Derived_Type (U_Ent) then
5586 ("storage size cannot be given for a derived access type",
5589 elsif Duplicate_Clause then
5593 Analyze_And_Resolve (Expr, Any_Integer);
5595 if Is_Access_Type (U_Ent) then
5597 -- Check for Storage_Pool previously given
5600 SP : constant Node_Id :=
5601 Get_Attribute_Definition_Clause
5602 (U_Ent, Attribute_Storage_Pool);
5605 if Present (SP) then
5606 Check_Pool_Size_Clash (U_Ent, SP, N);
5610 -- Special case of for x'Storage_Size use 0
5612 if Is_OK_Static_Expression (Expr)
5613 and then Expr_Value (Expr) = 0
5615 Set_No_Pool_Assigned (Btype);
5619 Set_Has_Storage_Size_Clause (Btype);
5627 when Attribute_Stream_Size => Stream_Size : declare
5628 Size : constant Uint := Static_Integer (Expr);
5631 if Ada_Version <= Ada_95 then
5632 Check_Restriction (No_Implementation_Attributes, N);
5635 if Duplicate_Clause then
5638 elsif Is_Elementary_Type (U_Ent) then
5639 if Size /= System_Storage_Unit
5641 Size /= System_Storage_Unit * 2
5643 Size /= System_Storage_Unit * 4
5645 Size /= System_Storage_Unit * 8
5647 Error_Msg_Uint_1 := UI_From_Int (System_Storage_Unit);
5649 ("stream size for elementary type must be a"
5650 & " power of 2 and at least ^", N);
5652 elsif RM_Size (U_Ent) > Size then
5653 Error_Msg_Uint_1 := RM_Size (U_Ent);
5655 ("stream size for elementary type must be a"
5656 & " power of 2 and at least ^", N);
5659 Set_Has_Stream_Size_Clause (U_Ent);
5662 Error_Msg_N ("Stream_Size cannot be given for &", Nam);
5670 -- Value_Size attribute definition clause
5672 when Attribute_Value_Size => Value_Size : declare
5673 Size : constant Uint := Static_Integer (Expr);
5677 if not Is_Type (U_Ent) then
5678 Error_Msg_N ("Value_Size cannot be given for &", Nam);
5680 elsif Duplicate_Clause then
5683 elsif Is_Array_Type (U_Ent)
5684 and then not Is_Constrained (U_Ent)
5687 ("Value_Size cannot be given for unconstrained array", Nam);
5690 if Is_Elementary_Type (U_Ent) then
5691 Check_Size (Expr, U_Ent, Size, Biased);
5692 Set_Biased (U_Ent, N, "value size clause", Biased);
5695 Set_RM_Size (U_Ent, Size);
5699 -----------------------
5700 -- Variable_Indexing --
5701 -----------------------
5703 when Attribute_Variable_Indexing =>
5704 Check_Indexing_Functions;
5710 when Attribute_Write =>
5711 Analyze_Stream_TSS_Definition (TSS_Stream_Write);
5712 Set_Has_Specified_Stream_Write (Ent);
5714 -- All other attributes cannot be set
5718 ("attribute& cannot be set with definition clause", N);
5721 -- The test for the type being frozen must be performed after any
5722 -- expression the clause has been analyzed since the expression itself
5723 -- might cause freezing that makes the clause illegal.
5725 if Rep_Item_Too_Late (U_Ent, N, FOnly) then
5728 end Analyze_Attribute_Definition_Clause;
5730 ----------------------------
5731 -- Analyze_Code_Statement --
5732 ----------------------------
5734 procedure Analyze_Code_Statement (N : Node_Id) is
5735 HSS : constant Node_Id := Parent (N);
5736 SBody : constant Node_Id := Parent (HSS);
5737 Subp : constant Entity_Id := Current_Scope;
5744 -- Analyze and check we get right type, note that this implements the
5745 -- requirement (RM 13.8(1)) that Machine_Code be with'ed, since that
5746 -- is the only way that Asm_Insn could possibly be visible.
5748 Analyze_And_Resolve (Expression (N));
5750 if Etype (Expression (N)) = Any_Type then
5752 elsif Etype (Expression (N)) /= RTE (RE_Asm_Insn) then
5753 Error_Msg_N ("incorrect type for code statement", N);
5757 Check_Code_Statement (N);
5759 -- Make sure we appear in the handled statement sequence of a
5760 -- subprogram (RM 13.8(3)).
5762 if Nkind (HSS) /= N_Handled_Sequence_Of_Statements
5763 or else Nkind (SBody) /= N_Subprogram_Body
5766 ("code statement can only appear in body of subprogram", N);
5770 -- Do remaining checks (RM 13.8(3)) if not already done
5772 if not Is_Machine_Code_Subprogram (Subp) then
5773 Set_Is_Machine_Code_Subprogram (Subp);
5775 -- No exception handlers allowed
5777 if Present (Exception_Handlers (HSS)) then
5779 ("exception handlers not permitted in machine code subprogram",
5780 First (Exception_Handlers (HSS)));
5783 -- No declarations other than use clauses and pragmas (we allow
5784 -- certain internally generated declarations as well).
5786 Decl := First (Declarations (SBody));
5787 while Present (Decl) loop
5788 DeclO := Original_Node (Decl);
5789 if Comes_From_Source (DeclO)
5790 and not Nkind_In (DeclO, N_Pragma,
5791 N_Use_Package_Clause,
5793 N_Implicit_Label_Declaration)
5796 ("this declaration not allowed in machine code subprogram",
5803 -- No statements other than code statements, pragmas, and labels.
5804 -- Again we allow certain internally generated statements.
5806 -- In Ada 2012, qualified expressions are names, and the code
5807 -- statement is initially parsed as a procedure call.
5809 Stmt := First (Statements (HSS));
5810 while Present (Stmt) loop
5811 StmtO := Original_Node (Stmt);
5813 -- A procedure call transformed into a code statement is OK.
5815 if Ada_Version >= Ada_2012
5816 and then Nkind (StmtO) = N_Procedure_Call_Statement
5817 and then Nkind (Name (StmtO)) = N_Qualified_Expression
5821 elsif Comes_From_Source (StmtO)
5822 and then not Nkind_In (StmtO, N_Pragma,
5827 ("this statement is not allowed in machine code subprogram",
5834 end Analyze_Code_Statement;
5836 -----------------------------------------------
5837 -- Analyze_Enumeration_Representation_Clause --
5838 -----------------------------------------------
5840 procedure Analyze_Enumeration_Representation_Clause (N : Node_Id) is
5841 Ident : constant Node_Id := Identifier (N);
5842 Aggr : constant Node_Id := Array_Aggregate (N);
5843 Enumtype : Entity_Id;
5850 Err : Boolean := False;
5851 -- Set True to avoid cascade errors and crashes on incorrect source code
5853 Lo : constant Uint := Expr_Value (Type_Low_Bound (Universal_Integer));
5854 Hi : constant Uint := Expr_Value (Type_High_Bound (Universal_Integer));
5855 -- Allowed range of universal integer (= allowed range of enum lit vals)
5859 -- Minimum and maximum values of entries
5862 -- Pointer to node for literal providing max value
5865 if Ignore_Rep_Clauses then
5866 Kill_Rep_Clause (N);
5870 -- Ignore enumeration rep clauses by default in CodePeer mode,
5871 -- unless -gnatd.I is specified, as a work around for potential false
5872 -- positive messages.
5874 if CodePeer_Mode and not Debug_Flag_Dot_II then
5878 -- First some basic error checks
5881 Enumtype := Entity (Ident);
5883 if Enumtype = Any_Type
5884 or else Rep_Item_Too_Early (Enumtype, N)
5888 Enumtype := Underlying_Type (Enumtype);
5891 if not Is_Enumeration_Type (Enumtype) then
5893 ("enumeration type required, found}",
5894 Ident, First_Subtype (Enumtype));
5898 -- Ignore rep clause on generic actual type. This will already have
5899 -- been flagged on the template as an error, and this is the safest
5900 -- way to ensure we don't get a junk cascaded message in the instance.
5902 if Is_Generic_Actual_Type (Enumtype) then
5905 -- Type must be in current scope
5907 elsif Scope (Enumtype) /= Current_Scope then
5908 Error_Msg_N ("type must be declared in this scope", Ident);
5911 -- Type must be a first subtype
5913 elsif not Is_First_Subtype (Enumtype) then
5914 Error_Msg_N ("cannot give enumeration rep clause for subtype", N);
5917 -- Ignore duplicate rep clause
5919 elsif Has_Enumeration_Rep_Clause (Enumtype) then
5920 Error_Msg_N ("duplicate enumeration rep clause ignored", N);
5923 -- Don't allow rep clause for standard [wide_[wide_]]character
5925 elsif Is_Standard_Character_Type (Enumtype) then
5926 Error_Msg_N ("enumeration rep clause not allowed for this type", N);
5929 -- Check that the expression is a proper aggregate (no parentheses)
5931 elsif Paren_Count (Aggr) /= 0 then
5933 ("extra parentheses surrounding aggregate not allowed",
5937 -- All tests passed, so set rep clause in place
5940 Set_Has_Enumeration_Rep_Clause (Enumtype);
5941 Set_Has_Enumeration_Rep_Clause (Base_Type (Enumtype));
5944 -- Now we process the aggregate. Note that we don't use the normal
5945 -- aggregate code for this purpose, because we don't want any of the
5946 -- normal expansion activities, and a number of special semantic
5947 -- rules apply (including the component type being any integer type)
5949 Elit := First_Literal (Enumtype);
5951 -- First the positional entries if any
5953 if Present (Expressions (Aggr)) then
5954 Expr := First (Expressions (Aggr));
5955 while Present (Expr) loop
5957 Error_Msg_N ("too many entries in aggregate", Expr);
5961 Val := Static_Integer (Expr);
5963 -- Err signals that we found some incorrect entries processing
5964 -- the list. The final checks for completeness and ordering are
5965 -- skipped in this case.
5967 if Val = No_Uint then
5970 elsif Val < Lo or else Hi < Val then
5971 Error_Msg_N ("value outside permitted range", Expr);
5975 Set_Enumeration_Rep (Elit, Val);
5976 Set_Enumeration_Rep_Expr (Elit, Expr);
5982 -- Now process the named entries if present
5984 if Present (Component_Associations (Aggr)) then
5985 Assoc := First (Component_Associations (Aggr));
5986 while Present (Assoc) loop
5987 Choice := First (Choices (Assoc));
5989 if Present (Next (Choice)) then
5991 ("multiple choice not allowed here", Next (Choice));
5995 if Nkind (Choice) = N_Others_Choice then
5996 Error_Msg_N ("others choice not allowed here", Choice);
5999 elsif Nkind (Choice) = N_Range then
6001 -- ??? should allow zero/one element range here
6003 Error_Msg_N ("range not allowed here", Choice);
6007 Analyze_And_Resolve (Choice, Enumtype);
6009 if Error_Posted (Choice) then
6014 if Is_Entity_Name (Choice)
6015 and then Is_Type (Entity (Choice))
6017 Error_Msg_N ("subtype name not allowed here", Choice);
6020 -- ??? should allow static subtype with zero/one entry
6022 elsif Etype (Choice) = Base_Type (Enumtype) then
6023 if not Is_OK_Static_Expression (Choice) then
6024 Flag_Non_Static_Expr
6025 ("non-static expression used for choice!", Choice);
6029 Elit := Expr_Value_E (Choice);
6031 if Present (Enumeration_Rep_Expr (Elit)) then
6033 Sloc (Enumeration_Rep_Expr (Elit));
6035 ("representation for& previously given#",
6040 Set_Enumeration_Rep_Expr (Elit, Expression (Assoc));
6042 Expr := Expression (Assoc);
6043 Val := Static_Integer (Expr);
6045 if Val = No_Uint then
6048 elsif Val < Lo or else Hi < Val then
6049 Error_Msg_N ("value outside permitted range", Expr);
6053 Set_Enumeration_Rep (Elit, Val);
6063 -- Aggregate is fully processed. Now we check that a full set of
6064 -- representations was given, and that they are in range and in order.
6065 -- These checks are only done if no other errors occurred.
6071 Elit := First_Literal (Enumtype);
6072 while Present (Elit) loop
6073 if No (Enumeration_Rep_Expr (Elit)) then
6074 Error_Msg_NE ("missing representation for&!", N, Elit);
6077 Val := Enumeration_Rep (Elit);
6079 if Min = No_Uint then
6083 if Val /= No_Uint then
6084 if Max /= No_Uint and then Val <= Max then
6086 ("enumeration value for& not ordered!",
6087 Enumeration_Rep_Expr (Elit), Elit);
6090 Max_Node := Enumeration_Rep_Expr (Elit);
6094 -- If there is at least one literal whose representation is not
6095 -- equal to the Pos value, then note that this enumeration type
6096 -- has a non-standard representation.
6098 if Val /= Enumeration_Pos (Elit) then
6099 Set_Has_Non_Standard_Rep (Base_Type (Enumtype));
6106 -- Now set proper size information
6109 Minsize : Uint := UI_From_Int (Minimum_Size (Enumtype));
6112 if Has_Size_Clause (Enumtype) then
6114 -- All OK, if size is OK now
6116 if RM_Size (Enumtype) >= Minsize then
6120 -- Try if we can get by with biasing
6123 UI_From_Int (Minimum_Size (Enumtype, Biased => True));
6125 -- Error message if even biasing does not work
6127 if RM_Size (Enumtype) < Minsize then
6128 Error_Msg_Uint_1 := RM_Size (Enumtype);
6129 Error_Msg_Uint_2 := Max;
6131 ("previously given size (^) is too small "
6132 & "for this value (^)", Max_Node);
6134 -- If biasing worked, indicate that we now have biased rep
6138 (Enumtype, Size_Clause (Enumtype), "size clause");
6143 Set_RM_Size (Enumtype, Minsize);
6144 Set_Enum_Esize (Enumtype);
6147 Set_RM_Size (Base_Type (Enumtype), RM_Size (Enumtype));
6148 Set_Esize (Base_Type (Enumtype), Esize (Enumtype));
6149 Set_Alignment (Base_Type (Enumtype), Alignment (Enumtype));
6153 -- We repeat the too late test in case it froze itself
6155 if Rep_Item_Too_Late (Enumtype, N) then
6158 end Analyze_Enumeration_Representation_Clause;
6160 ----------------------------
6161 -- Analyze_Free_Statement --
6162 ----------------------------
6164 procedure Analyze_Free_Statement (N : Node_Id) is
6166 Analyze (Expression (N));
6167 end Analyze_Free_Statement;
6169 ---------------------------
6170 -- Analyze_Freeze_Entity --
6171 ---------------------------
6173 procedure Analyze_Freeze_Entity (N : Node_Id) is
6175 Freeze_Entity_Checks (N);
6176 end Analyze_Freeze_Entity;
6178 -----------------------------------
6179 -- Analyze_Freeze_Generic_Entity --
6180 -----------------------------------
6182 procedure Analyze_Freeze_Generic_Entity (N : Node_Id) is
6184 Freeze_Entity_Checks (N);
6185 end Analyze_Freeze_Generic_Entity;
6187 ------------------------------------------
6188 -- Analyze_Record_Representation_Clause --
6189 ------------------------------------------
6191 -- Note: we check as much as we can here, but we can't do any checks
6192 -- based on the position values (e.g. overlap checks) until freeze time
6193 -- because especially in Ada 2005 (machine scalar mode), the processing
6194 -- for non-standard bit order can substantially change the positions.
6195 -- See procedure Check_Record_Representation_Clause (called from Freeze)
6196 -- for the remainder of this processing.
6198 procedure Analyze_Record_Representation_Clause (N : Node_Id) is
6199 Ident : constant Node_Id := Identifier (N);
6204 Hbit : Uint := Uint_0;
6208 Rectype : Entity_Id;
6211 function Is_Inherited (Comp : Entity_Id) return Boolean;
6212 -- True if Comp is an inherited component in a record extension
6218 function Is_Inherited (Comp : Entity_Id) return Boolean is
6219 Comp_Base : Entity_Id;
6222 if Ekind (Rectype) = E_Record_Subtype then
6223 Comp_Base := Original_Record_Component (Comp);
6228 return Comp_Base /= Original_Record_Component (Comp_Base);
6233 Is_Record_Extension : Boolean;
6234 -- True if Rectype is a record extension
6236 CR_Pragma : Node_Id := Empty;
6237 -- Points to N_Pragma node if Complete_Representation pragma present
6239 -- Start of processing for Analyze_Record_Representation_Clause
6242 if Ignore_Rep_Clauses then
6243 Kill_Rep_Clause (N);
6248 Rectype := Entity (Ident);
6250 if Rectype = Any_Type or else Rep_Item_Too_Early (Rectype, N) then
6253 Rectype := Underlying_Type (Rectype);
6256 -- First some basic error checks
6258 if not Is_Record_Type (Rectype) then
6260 ("record type required, found}", Ident, First_Subtype (Rectype));
6263 elsif Scope (Rectype) /= Current_Scope then
6264 Error_Msg_N ("type must be declared in this scope", N);
6267 elsif not Is_First_Subtype (Rectype) then
6268 Error_Msg_N ("cannot give record rep clause for subtype", N);
6271 elsif Has_Record_Rep_Clause (Rectype) then
6272 Error_Msg_N ("duplicate record rep clause ignored", N);
6275 elsif Rep_Item_Too_Late (Rectype, N) then
6279 -- We know we have a first subtype, now possibly go the the anonymous
6280 -- base type to determine whether Rectype is a record extension.
6282 Recdef := Type_Definition (Declaration_Node (Base_Type (Rectype)));
6283 Is_Record_Extension :=
6284 Nkind (Recdef) = N_Derived_Type_Definition
6285 and then Present (Record_Extension_Part (Recdef));
6287 if Present (Mod_Clause (N)) then
6289 Loc : constant Source_Ptr := Sloc (N);
6290 M : constant Node_Id := Mod_Clause (N);
6291 P : constant List_Id := Pragmas_Before (M);
6295 pragma Warnings (Off, Mod_Val);
6298 Check_Restriction (No_Obsolescent_Features, Mod_Clause (N));
6300 if Warn_On_Obsolescent_Feature then
6302 ("?j?mod clause is an obsolescent feature (RM J.8)", N);
6304 ("\?j?use alignment attribute definition clause instead", N);
6311 -- In ASIS_Mode mode, expansion is disabled, but we must convert
6312 -- the Mod clause into an alignment clause anyway, so that the
6313 -- back-end can compute and back-annotate properly the size and
6314 -- alignment of types that may include this record.
6316 -- This seems dubious, this destroys the source tree in a manner
6317 -- not detectable by ASIS ???
6319 if Operating_Mode = Check_Semantics and then ASIS_Mode then
6321 Make_Attribute_Definition_Clause (Loc,
6322 Name => New_Occurrence_Of (Base_Type (Rectype), Loc),
6323 Chars => Name_Alignment,
6324 Expression => Relocate_Node (Expression (M)));
6326 Set_From_At_Mod (AtM_Nod);
6327 Insert_After (N, AtM_Nod);
6328 Mod_Val := Get_Alignment_Value (Expression (AtM_Nod));
6329 Set_Mod_Clause (N, Empty);
6332 -- Get the alignment value to perform error checking
6334 Mod_Val := Get_Alignment_Value (Expression (M));
6339 -- For untagged types, clear any existing component clauses for the
6340 -- type. If the type is derived, this is what allows us to override
6341 -- a rep clause for the parent. For type extensions, the representation
6342 -- of the inherited components is inherited, so we want to keep previous
6343 -- component clauses for completeness.
6345 if not Is_Tagged_Type (Rectype) then
6346 Comp := First_Component_Or_Discriminant (Rectype);
6347 while Present (Comp) loop
6348 Set_Component_Clause (Comp, Empty);
6349 Next_Component_Or_Discriminant (Comp);
6353 -- All done if no component clauses
6355 CC := First (Component_Clauses (N));
6361 -- A representation like this applies to the base type
6363 Set_Has_Record_Rep_Clause (Base_Type (Rectype));
6364 Set_Has_Non_Standard_Rep (Base_Type (Rectype));
6365 Set_Has_Specified_Layout (Base_Type (Rectype));
6367 -- Process the component clauses
6369 while Present (CC) loop
6373 if Nkind (CC) = N_Pragma then
6376 -- The only pragma of interest is Complete_Representation
6378 if Pragma_Name (CC) = Name_Complete_Representation then
6382 -- Processing for real component clause
6385 Posit := Static_Integer (Position (CC));
6386 Fbit := Static_Integer (First_Bit (CC));
6387 Lbit := Static_Integer (Last_Bit (CC));
6390 and then Fbit /= No_Uint
6391 and then Lbit /= No_Uint
6395 ("position cannot be negative", Position (CC));
6399 ("first bit cannot be negative", First_Bit (CC));
6401 -- The Last_Bit specified in a component clause must not be
6402 -- less than the First_Bit minus one (RM-13.5.1(10)).
6404 elsif Lbit < Fbit - 1 then
6406 ("last bit cannot be less than first bit minus one",
6409 -- Values look OK, so find the corresponding record component
6410 -- Even though the syntax allows an attribute reference for
6411 -- implementation-defined components, GNAT does not allow the
6412 -- tag to get an explicit position.
6414 elsif Nkind (Component_Name (CC)) = N_Attribute_Reference then
6415 if Attribute_Name (Component_Name (CC)) = Name_Tag then
6416 Error_Msg_N ("position of tag cannot be specified", CC);
6418 Error_Msg_N ("illegal component name", CC);
6422 Comp := First_Entity (Rectype);
6423 while Present (Comp) loop
6424 exit when Chars (Comp) = Chars (Component_Name (CC));
6430 -- Maybe component of base type that is absent from
6431 -- statically constrained first subtype.
6433 Comp := First_Entity (Base_Type (Rectype));
6434 while Present (Comp) loop
6435 exit when Chars (Comp) = Chars (Component_Name (CC));
6442 ("component clause is for non-existent field", CC);
6444 -- Ada 2012 (AI05-0026): Any name that denotes a
6445 -- discriminant of an object of an unchecked union type
6446 -- shall not occur within a record_representation_clause.
6448 -- The general restriction of using record rep clauses on
6449 -- Unchecked_Union types has now been lifted. Since it is
6450 -- possible to introduce a record rep clause which mentions
6451 -- the discriminant of an Unchecked_Union in non-Ada 2012
6452 -- code, this check is applied to all versions of the
6455 elsif Ekind (Comp) = E_Discriminant
6456 and then Is_Unchecked_Union (Rectype)
6459 ("cannot reference discriminant of unchecked union",
6460 Component_Name (CC));
6462 elsif Is_Record_Extension and then Is_Inherited (Comp) then
6464 ("component clause not allowed for inherited "
6465 & "component&", CC, Comp);
6467 elsif Present (Component_Clause (Comp)) then
6469 -- Diagnose duplicate rep clause, or check consistency
6470 -- if this is an inherited component. In a double fault,
6471 -- there may be a duplicate inconsistent clause for an
6472 -- inherited component.
6474 if Scope (Original_Record_Component (Comp)) = Rectype
6475 or else Parent (Component_Clause (Comp)) = N
6477 Error_Msg_Sloc := Sloc (Component_Clause (Comp));
6478 Error_Msg_N ("component clause previously given#", CC);
6482 Rep1 : constant Node_Id := Component_Clause (Comp);
6484 if Intval (Position (Rep1)) /=
6485 Intval (Position (CC))
6486 or else Intval (First_Bit (Rep1)) /=
6487 Intval (First_Bit (CC))
6488 or else Intval (Last_Bit (Rep1)) /=
6489 Intval (Last_Bit (CC))
6492 ("component clause inconsistent "
6493 & "with representation of ancestor", CC);
6495 elsif Warn_On_Redundant_Constructs then
6497 ("?r?redundant confirming component clause "
6498 & "for component!", CC);
6503 -- Normal case where this is the first component clause we
6504 -- have seen for this entity, so set it up properly.
6507 -- Make reference for field in record rep clause and set
6508 -- appropriate entity field in the field identifier.
6511 (Comp, Component_Name (CC), Set_Ref => False);
6512 Set_Entity (Component_Name (CC), Comp);
6514 -- Update Fbit and Lbit to the actual bit number
6516 Fbit := Fbit + UI_From_Int (SSU) * Posit;
6517 Lbit := Lbit + UI_From_Int (SSU) * Posit;
6519 if Has_Size_Clause (Rectype)
6520 and then RM_Size (Rectype) <= Lbit
6523 ("bit number out of range of specified size",
6526 Set_Component_Clause (Comp, CC);
6527 Set_Component_Bit_Offset (Comp, Fbit);
6528 Set_Esize (Comp, 1 + (Lbit - Fbit));
6529 Set_Normalized_First_Bit (Comp, Fbit mod SSU);
6530 Set_Normalized_Position (Comp, Fbit / SSU);
6532 if Warn_On_Overridden_Size
6533 and then Has_Size_Clause (Etype (Comp))
6534 and then RM_Size (Etype (Comp)) /= Esize (Comp)
6537 ("?S?component size overrides size clause for&",
6538 Component_Name (CC), Etype (Comp));
6541 -- This information is also set in the corresponding
6542 -- component of the base type, found by accessing the
6543 -- Original_Record_Component link if it is present.
6545 Ocomp := Original_Record_Component (Comp);
6552 (Component_Name (CC),
6558 (Comp, First_Node (CC), "component clause", Biased);
6560 if Present (Ocomp) then
6561 Set_Component_Clause (Ocomp, CC);
6562 Set_Component_Bit_Offset (Ocomp, Fbit);
6563 Set_Normalized_First_Bit (Ocomp, Fbit mod SSU);
6564 Set_Normalized_Position (Ocomp, Fbit / SSU);
6565 Set_Esize (Ocomp, 1 + (Lbit - Fbit));
6567 Set_Normalized_Position_Max
6568 (Ocomp, Normalized_Position (Ocomp));
6570 -- Note: we don't use Set_Biased here, because we
6571 -- already gave a warning above if needed, and we
6572 -- would get a duplicate for the same name here.
6574 Set_Has_Biased_Representation
6575 (Ocomp, Has_Biased_Representation (Comp));
6578 if Esize (Comp) < 0 then
6579 Error_Msg_N ("component size is negative", CC);
6590 -- Check missing components if Complete_Representation pragma appeared
6592 if Present (CR_Pragma) then
6593 Comp := First_Component_Or_Discriminant (Rectype);
6594 while Present (Comp) loop
6595 if No (Component_Clause (Comp)) then
6597 ("missing component clause for &", CR_Pragma, Comp);
6600 Next_Component_Or_Discriminant (Comp);
6603 -- Give missing components warning if required
6605 elsif Warn_On_Unrepped_Components then
6607 Num_Repped_Components : Nat := 0;
6608 Num_Unrepped_Components : Nat := 0;
6611 -- First count number of repped and unrepped components
6613 Comp := First_Component_Or_Discriminant (Rectype);
6614 while Present (Comp) loop
6615 if Present (Component_Clause (Comp)) then
6616 Num_Repped_Components := Num_Repped_Components + 1;
6618 Num_Unrepped_Components := Num_Unrepped_Components + 1;
6621 Next_Component_Or_Discriminant (Comp);
6624 -- We are only interested in the case where there is at least one
6625 -- unrepped component, and at least half the components have rep
6626 -- clauses. We figure that if less than half have them, then the
6627 -- partial rep clause is really intentional. If the component
6628 -- type has no underlying type set at this point (as for a generic
6629 -- formal type), we don't know enough to give a warning on the
6632 if Num_Unrepped_Components > 0
6633 and then Num_Unrepped_Components < Num_Repped_Components
6635 Comp := First_Component_Or_Discriminant (Rectype);
6636 while Present (Comp) loop
6637 if No (Component_Clause (Comp))
6638 and then Comes_From_Source (Comp)
6639 and then Present (Underlying_Type (Etype (Comp)))
6640 and then (Is_Scalar_Type (Underlying_Type (Etype (Comp)))
6641 or else Size_Known_At_Compile_Time
6642 (Underlying_Type (Etype (Comp))))
6643 and then not Has_Warnings_Off (Rectype)
6645 -- Ignore discriminant in unchecked union, since it is
6646 -- not there, and cannot have a component clause.
6648 and then (not Is_Unchecked_Union (Rectype)
6649 or else Ekind (Comp) /= E_Discriminant)
6651 Error_Msg_Sloc := Sloc (Comp);
6653 ("?C?no component clause given for & declared #",
6657 Next_Component_Or_Discriminant (Comp);
6662 end Analyze_Record_Representation_Clause;
6664 -------------------------------------
6665 -- Build_Discrete_Static_Predicate --
6666 -------------------------------------
6668 procedure Build_Discrete_Static_Predicate
6673 Loc : constant Source_Ptr := Sloc (Expr);
6675 Non_Static : exception;
6676 -- Raised if something non-static is found
6678 Btyp : constant Entity_Id := Base_Type (Typ);
6680 BLo : constant Uint := Expr_Value (Type_Low_Bound (Btyp));
6681 BHi : constant Uint := Expr_Value (Type_High_Bound (Btyp));
6682 -- Low bound and high bound value of base type of Typ
6684 TLo : constant Uint := Expr_Value (Type_Low_Bound (Typ));
6685 THi : constant Uint := Expr_Value (Type_High_Bound (Typ));
6686 -- Low bound and high bound values of static subtype Typ
6691 -- One entry in a Rlist value, a single REnt (range entry) value denotes
6692 -- one range from Lo to Hi. To represent a single value range Lo = Hi =
6695 type RList is array (Nat range <>) of REnt;
6696 -- A list of ranges. The ranges are sorted in increasing order, and are
6697 -- disjoint (there is a gap of at least one value between each range in
6698 -- the table). A value is in the set of ranges in Rlist if it lies
6699 -- within one of these ranges.
6701 False_Range : constant RList :=
6702 RList'(1 .. 0 => REnt'(No_Uint, No_Uint));
6703 -- An empty set of ranges represents a range list that can never be
6704 -- satisfied, since there are no ranges in which the value could lie,
6705 -- so it does not lie in any of them. False_Range is a canonical value
6706 -- for this empty set, but general processing should test for an Rlist
6707 -- with length zero (see Is_False predicate), since other null ranges
6708 -- may appear which must be treated as False.
6710 True_Range : constant RList := RList'(1 => REnt'(BLo, BHi));
6711 -- Range representing True, value must be in the base range
6713 function "and" (Left : RList; Right : RList) return RList;
6714 -- And's together two range lists, returning a range list. This is a set
6715 -- intersection operation.
6717 function "or" (Left : RList; Right : RList) return RList;
6718 -- Or's together two range lists, returning a range list. This is a set
6721 function "not" (Right : RList) return RList;
6722 -- Returns complement of a given range list, i.e. a range list
6723 -- representing all the values in TLo .. THi that are not in the input
6726 function Build_Val (V : Uint) return Node_Id;
6727 -- Return an analyzed N_Identifier node referencing this value, suitable
6728 -- for use as an entry in the Static_Discrte_Predicate list. This node
6729 -- is typed with the base type.
6731 function Build_Range (Lo : Uint; Hi : Uint) return Node_Id;
6732 -- Return an analyzed N_Range node referencing this range, suitable for
6733 -- use as an entry in the Static_Discrete_Predicate list. This node is
6734 -- typed with the base type.
6736 function Get_RList (Exp : Node_Id) return RList;
6737 -- This is a recursive routine that converts the given expression into a
6738 -- list of ranges, suitable for use in building the static predicate.
6740 function Is_False (R : RList) return Boolean;
6741 pragma Inline (Is_False);
6742 -- Returns True if the given range list is empty, and thus represents a
6743 -- False list of ranges that can never be satisfied.
6745 function Is_True (R : RList) return Boolean;
6746 -- Returns True if R trivially represents the True predicate by having a
6747 -- single range from BLo to BHi.
6749 function Is_Type_Ref (N : Node_Id) return Boolean;
6750 pragma Inline (Is_Type_Ref);
6751 -- Returns if True if N is a reference to the type for the predicate in
6752 -- the expression (i.e. if it is an identifier whose Chars field matches
6753 -- the Nam given in the call). N must not be parenthesized, if the type
6754 -- name appears in parens, this routine will return False.
6756 function Lo_Val (N : Node_Id) return Uint;
6757 -- Given an entry from a Static_Discrete_Predicate list that is either
6758 -- a static expression or static range, gets either the expression value
6759 -- or the low bound of the range.
6761 function Hi_Val (N : Node_Id) return Uint;
6762 -- Given an entry from a Static_Discrete_Predicate list that is either
6763 -- a static expression or static range, gets either the expression value
6764 -- or the high bound of the range.
6766 function Membership_Entry (N : Node_Id) return RList;
6767 -- Given a single membership entry (range, value, or subtype), returns
6768 -- the corresponding range list. Raises Static_Error if not static.
6770 function Membership_Entries (N : Node_Id) return RList;
6771 -- Given an element on an alternatives list of a membership operation,
6772 -- returns the range list corresponding to this entry and all following
6773 -- entries (i.e. returns the "or" of this list of values).
6775 function Stat_Pred (Typ : Entity_Id) return RList;
6776 -- Given a type, if it has a static predicate, then return the predicate
6777 -- as a range list, otherwise raise Non_Static.
6783 function "and" (Left : RList; Right : RList) return RList is
6785 -- First range of result
6787 SLeft : Nat := Left'First;
6788 -- Start of rest of left entries
6790 SRight : Nat := Right'First;
6791 -- Start of rest of right entries
6794 -- If either range is True, return the other
6796 if Is_True (Left) then
6798 elsif Is_True (Right) then
6802 -- If either range is False, return False
6804 if Is_False (Left) or else Is_False (Right) then
6808 -- Loop to remove entries at start that are disjoint, and thus just
6809 -- get discarded from the result entirely.
6812 -- If no operands left in either operand, result is false
6814 if SLeft > Left'Last or else SRight > Right'Last then
6817 -- Discard first left operand entry if disjoint with right
6819 elsif Left (SLeft).Hi < Right (SRight).Lo then
6822 -- Discard first right operand entry if disjoint with left
6824 elsif Right (SRight).Hi < Left (SLeft).Lo then
6825 SRight := SRight + 1;
6827 -- Otherwise we have an overlapping entry
6834 -- Now we have two non-null operands, and first entries overlap. The
6835 -- first entry in the result will be the overlapping part of these
6838 FEnt := REnt'(Lo => UI_Max (Left (SLeft).Lo, Right (SRight).Lo),
6839 Hi => UI_Min (Left (SLeft).Hi, Right (SRight).Hi));
6841 -- Now we can remove the entry that ended at a lower value, since its
6842 -- contribution is entirely contained in Fent.
6844 if Left (SLeft).Hi <= Right (SRight).Hi then
6847 SRight := SRight + 1;
6850 -- Compute result by concatenating this first entry with the "and" of
6851 -- the remaining parts of the left and right operands. Note that if
6852 -- either of these is empty, "and" will yield empty, so that we will
6853 -- end up with just Fent, which is what we want in that case.
6856 FEnt & (Left (SLeft .. Left'Last) and Right (SRight .. Right'Last));
6863 function "not" (Right : RList) return RList is
6865 -- Return True if False range
6867 if Is_False (Right) then
6871 -- Return False if True range
6873 if Is_True (Right) then
6877 -- Here if not trivial case
6880 Result : RList (1 .. Right'Length + 1);
6881 -- May need one more entry for gap at beginning and end
6884 -- Number of entries stored in Result
6889 if Right (Right'First).Lo > TLo then
6891 Result (Count) := REnt'(TLo, Right (Right'First).Lo - 1);
6894 -- Gaps between ranges
6896 for J in Right'First .. Right'Last - 1 loop
6898 Result (Count) := REnt'(Right (J).Hi + 1, Right (J + 1).Lo - 1);
6903 if Right (Right'Last).Hi < THi then
6905 Result (Count) := REnt'(Right (Right'Last).Hi + 1, THi);
6908 return Result (1 .. Count);
6916 function "or" (Left : RList; Right : RList) return RList is
6918 -- First range of result
6920 SLeft : Nat := Left'First;
6921 -- Start of rest of left entries
6923 SRight : Nat := Right'First;
6924 -- Start of rest of right entries
6927 -- If either range is True, return True
6929 if Is_True (Left) or else Is_True (Right) then
6933 -- If either range is False (empty), return the other
6935 if Is_False (Left) then
6937 elsif Is_False (Right) then
6941 -- Initialize result first entry from left or right operand depending
6942 -- on which starts with the lower range.
6944 if Left (SLeft).Lo < Right (SRight).Lo then
6945 FEnt := Left (SLeft);
6948 FEnt := Right (SRight);
6949 SRight := SRight + 1;
6952 -- This loop eats ranges from left and right operands that are
6953 -- contiguous with the first range we are gathering.
6956 -- Eat first entry in left operand if contiguous or overlapped by
6957 -- gathered first operand of result.
6959 if SLeft <= Left'Last
6960 and then Left (SLeft).Lo <= FEnt.Hi + 1
6962 FEnt.Hi := UI_Max (FEnt.Hi, Left (SLeft).Hi);
6965 -- Eat first entry in right operand if contiguous or overlapped by
6966 -- gathered right operand of result.
6968 elsif SRight <= Right'Last
6969 and then Right (SRight).Lo <= FEnt.Hi + 1
6971 FEnt.Hi := UI_Max (FEnt.Hi, Right (SRight).Hi);
6972 SRight := SRight + 1;
6974 -- All done if no more entries to eat
6981 -- Obtain result as the first entry we just computed, concatenated
6982 -- to the "or" of the remaining results (if one operand is empty,
6983 -- this will just concatenate with the other
6986 FEnt & (Left (SLeft .. Left'Last) or Right (SRight .. Right'Last));
6993 function Build_Range (Lo : Uint; Hi : Uint) return Node_Id is
6998 Low_Bound => Build_Val (Lo),
6999 High_Bound => Build_Val (Hi));
7000 Set_Etype (Result, Btyp);
7001 Set_Analyzed (Result);
7009 function Build_Val (V : Uint) return Node_Id is
7013 if Is_Enumeration_Type (Typ) then
7014 Result := Get_Enum_Lit_From_Pos (Typ, V, Loc);
7016 Result := Make_Integer_Literal (Loc, V);
7019 Set_Etype (Result, Btyp);
7020 Set_Is_Static_Expression (Result);
7021 Set_Analyzed (Result);
7029 function Get_RList (Exp : Node_Id) return RList is
7034 -- Static expression can only be true or false
7036 if Is_OK_Static_Expression (Exp) then
7037 if Expr_Value (Exp) = 0 then
7044 -- Otherwise test node type
7052 when N_Op_And | N_And_Then =>
7053 return Get_RList (Left_Opnd (Exp))
7055 Get_RList (Right_Opnd (Exp));
7059 when N_Op_Or | N_Or_Else =>
7060 return Get_RList (Left_Opnd (Exp))
7062 Get_RList (Right_Opnd (Exp));
7067 return not Get_RList (Right_Opnd (Exp));
7069 -- Comparisons of type with static value
7071 when N_Op_Compare =>
7073 -- Type is left operand
7075 if Is_Type_Ref (Left_Opnd (Exp))
7076 and then Is_OK_Static_Expression (Right_Opnd (Exp))
7078 Val := Expr_Value (Right_Opnd (Exp));
7080 -- Typ is right operand
7082 elsif Is_Type_Ref (Right_Opnd (Exp))
7083 and then Is_OK_Static_Expression (Left_Opnd (Exp))
7085 Val := Expr_Value (Left_Opnd (Exp));
7087 -- Invert sense of comparison
7090 when N_Op_Gt => Op := N_Op_Lt;
7091 when N_Op_Lt => Op := N_Op_Gt;
7092 when N_Op_Ge => Op := N_Op_Le;
7093 when N_Op_Le => Op := N_Op_Ge;
7094 when others => null;
7097 -- Other cases are non-static
7103 -- Construct range according to comparison operation
7107 return RList'(1 => REnt'(Val, Val));
7110 return RList'(1 => REnt'(Val, BHi));
7113 return RList'(1 => REnt'(Val + 1, BHi));
7116 return RList'(1 => REnt'(BLo, Val));
7119 return RList'(1 => REnt'(BLo, Val - 1));
7122 return RList'(REnt'(BLo, Val - 1), REnt'(Val + 1, BHi));
7125 raise Program_Error;
7131 if not Is_Type_Ref (Left_Opnd (Exp)) then
7135 if Present (Right_Opnd (Exp)) then
7136 return Membership_Entry (Right_Opnd (Exp));
7138 return Membership_Entries (First (Alternatives (Exp)));
7141 -- Negative membership (NOT IN)
7144 if not Is_Type_Ref (Left_Opnd (Exp)) then
7148 if Present (Right_Opnd (Exp)) then
7149 return not Membership_Entry (Right_Opnd (Exp));
7151 return not Membership_Entries (First (Alternatives (Exp)));
7154 -- Function call, may be call to static predicate
7156 when N_Function_Call =>
7157 if Is_Entity_Name (Name (Exp)) then
7159 Ent : constant Entity_Id := Entity (Name (Exp));
7161 if Is_Predicate_Function (Ent)
7163 Is_Predicate_Function_M (Ent)
7165 return Stat_Pred (Etype (First_Formal (Ent)));
7170 -- Other function call cases are non-static
7174 -- Qualified expression, dig out the expression
7176 when N_Qualified_Expression =>
7177 return Get_RList (Expression (Exp));
7179 when N_Case_Expression =>
7186 if not Is_Entity_Name (Expression (Expr))
7187 or else Etype (Expression (Expr)) /= Typ
7190 ("expression must denaote subtype", Expression (Expr));
7194 -- Collect discrete choices in all True alternatives
7196 Choices := New_List;
7197 Alt := First (Alternatives (Exp));
7198 while Present (Alt) loop
7199 Dep := Expression (Alt);
7201 if not Is_OK_Static_Expression (Dep) then
7204 elsif Is_True (Expr_Value (Dep)) then
7205 Append_List_To (Choices,
7206 New_Copy_List (Discrete_Choices (Alt)));
7212 return Membership_Entries (First (Choices));
7215 -- Expression with actions: if no actions, dig out expression
7217 when N_Expression_With_Actions =>
7218 if Is_Empty_List (Actions (Exp)) then
7219 return Get_RList (Expression (Exp));
7227 return (Get_RList (Left_Opnd (Exp))
7228 and not Get_RList (Right_Opnd (Exp)))
7229 or (Get_RList (Right_Opnd (Exp))
7230 and not Get_RList (Left_Opnd (Exp)));
7232 -- Any other node type is non-static
7243 function Hi_Val (N : Node_Id) return Uint is
7245 if Is_OK_Static_Expression (N) then
7246 return Expr_Value (N);
7248 pragma Assert (Nkind (N) = N_Range);
7249 return Expr_Value (High_Bound (N));
7257 function Is_False (R : RList) return Boolean is
7259 return R'Length = 0;
7266 function Is_True (R : RList) return Boolean is
7269 and then R (R'First).Lo = BLo
7270 and then R (R'First).Hi = BHi;
7277 function Is_Type_Ref (N : Node_Id) return Boolean is
7279 return Nkind (N) = N_Identifier
7280 and then Chars (N) = Nam
7281 and then Paren_Count (N) = 0;
7288 function Lo_Val (N : Node_Id) return Uint is
7290 if Is_OK_Static_Expression (N) then
7291 return Expr_Value (N);
7293 pragma Assert (Nkind (N) = N_Range);
7294 return Expr_Value (Low_Bound (N));
7298 ------------------------
7299 -- Membership_Entries --
7300 ------------------------
7302 function Membership_Entries (N : Node_Id) return RList is
7304 if No (Next (N)) then
7305 return Membership_Entry (N);
7307 return Membership_Entry (N) or Membership_Entries (Next (N));
7309 end Membership_Entries;
7311 ----------------------
7312 -- Membership_Entry --
7313 ----------------------
7315 function Membership_Entry (N : Node_Id) return RList is
7323 if Nkind (N) = N_Range then
7324 if not Is_OK_Static_Expression (Low_Bound (N))
7326 not Is_OK_Static_Expression (High_Bound (N))
7330 SLo := Expr_Value (Low_Bound (N));
7331 SHi := Expr_Value (High_Bound (N));
7332 return RList'(1 => REnt'(SLo, SHi));
7335 -- Static expression case
7337 elsif Is_OK_Static_Expression (N) then
7338 Val := Expr_Value (N);
7339 return RList'(1 => REnt'(Val, Val));
7341 -- Identifier (other than static expression) case
7343 else pragma Assert (Nkind (N) = N_Identifier);
7347 if Is_Type (Entity (N)) then
7349 -- If type has predicates, process them
7351 if Has_Predicates (Entity (N)) then
7352 return Stat_Pred (Entity (N));
7354 -- For static subtype without predicates, get range
7356 elsif Is_OK_Static_Subtype (Entity (N)) then
7357 SLo := Expr_Value (Type_Low_Bound (Entity (N)));
7358 SHi := Expr_Value (Type_High_Bound (Entity (N)));
7359 return RList'(1 => REnt'(SLo, SHi));
7361 -- Any other type makes us non-static
7367 -- Any other kind of identifier in predicate (e.g. a non-static
7368 -- expression value) means this is not a static predicate.
7374 end Membership_Entry;
7380 function Stat_Pred (Typ : Entity_Id) return RList is
7382 -- Not static if type does not have static predicates
7384 if not Has_Static_Predicate (Typ) then
7388 -- Otherwise we convert the predicate list to a range list
7391 Spred : constant List_Id := Static_Discrete_Predicate (Typ);
7392 Result : RList (1 .. List_Length (Spred));
7396 P := First (Static_Discrete_Predicate (Typ));
7397 for J in Result'Range loop
7398 Result (J) := REnt'(Lo_Val (P), Hi_Val (P));
7406 -- Start of processing for Build_Discrete_Static_Predicate
7409 -- Analyze the expression to see if it is a static predicate
7412 Ranges : constant RList := Get_RList (Expr);
7413 -- Range list from expression if it is static
7418 -- Convert range list into a form for the static predicate. In the
7419 -- Ranges array, we just have raw ranges, these must be converted
7420 -- to properly typed and analyzed static expressions or range nodes.
7422 -- Note: here we limit ranges to the ranges of the subtype, so that
7423 -- a predicate is always false for values outside the subtype. That
7424 -- seems fine, such values are invalid anyway, and considering them
7425 -- to fail the predicate seems allowed and friendly, and furthermore
7426 -- simplifies processing for case statements and loops.
7430 for J in Ranges'Range loop
7432 Lo : Uint := Ranges (J).Lo;
7433 Hi : Uint := Ranges (J).Hi;
7436 -- Ignore completely out of range entry
7438 if Hi < TLo or else Lo > THi then
7441 -- Otherwise process entry
7444 -- Adjust out of range value to subtype range
7454 -- Convert range into required form
7456 Append_To (Plist, Build_Range (Lo, Hi));
7461 -- Processing was successful and all entries were static, so now we
7462 -- can store the result as the predicate list.
7464 Set_Static_Discrete_Predicate (Typ, Plist);
7466 -- The processing for static predicates put the expression into
7467 -- canonical form as a series of ranges. It also eliminated
7468 -- duplicates and collapsed and combined ranges. We might as well
7469 -- replace the alternatives list of the right operand of the
7470 -- membership test with the static predicate list, which will
7471 -- usually be more efficient.
7474 New_Alts : constant List_Id := New_List;
7479 Old_Node := First (Plist);
7480 while Present (Old_Node) loop
7481 New_Node := New_Copy (Old_Node);
7483 if Nkind (New_Node) = N_Range then
7484 Set_Low_Bound (New_Node, New_Copy (Low_Bound (Old_Node)));
7485 Set_High_Bound (New_Node, New_Copy (High_Bound (Old_Node)));
7488 Append_To (New_Alts, New_Node);
7492 -- If empty list, replace by False
7494 if Is_Empty_List (New_Alts) then
7495 Rewrite (Expr, New_Occurrence_Of (Standard_False, Loc));
7497 -- Else replace by set membership test
7502 Left_Opnd => Make_Identifier (Loc, Nam),
7503 Right_Opnd => Empty,
7504 Alternatives => New_Alts));
7506 -- Resolve new expression in function context
7508 Install_Formals (Predicate_Function (Typ));
7509 Push_Scope (Predicate_Function (Typ));
7510 Analyze_And_Resolve (Expr, Standard_Boolean);
7516 -- If non-static, return doing nothing
7521 end Build_Discrete_Static_Predicate;
7523 -------------------------------------------
7524 -- Build_Invariant_Procedure_Declaration --
7525 -------------------------------------------
7527 function Build_Invariant_Procedure_Declaration
7528 (Typ : Entity_Id) return Node_Id
7530 Loc : constant Source_Ptr := Sloc (Typ);
7531 Object_Entity : constant Entity_Id :=
7532 Make_Defining_Identifier (Loc, New_Internal_Name ('I'));
7537 Set_Etype (Object_Entity, Typ);
7539 -- Check for duplicate definiations.
7541 if Has_Invariants (Typ) and then Present (Invariant_Procedure (Typ)) then
7546 Make_Defining_Identifier (Loc,
7547 Chars => New_External_Name (Chars (Typ), "Invariant"));
7548 Set_Has_Invariants (Typ);
7549 Set_Ekind (SId, E_Procedure);
7550 Set_Etype (SId, Standard_Void_Type);
7551 Set_Is_Invariant_Procedure (SId);
7552 Set_Invariant_Procedure (Typ, SId);
7555 Make_Procedure_Specification (Loc,
7556 Defining_Unit_Name => SId,
7557 Parameter_Specifications => New_List (
7558 Make_Parameter_Specification (Loc,
7559 Defining_Identifier => Object_Entity,
7560 Parameter_Type => New_Occurrence_Of (Typ, Loc))));
7562 return Make_Subprogram_Declaration (Loc, Specification => Spec);
7563 end Build_Invariant_Procedure_Declaration;
7565 -------------------------------
7566 -- Build_Invariant_Procedure --
7567 -------------------------------
7569 -- The procedure that is constructed here has the form
7571 -- procedure typInvariant (Ixxx : typ) is
7573 -- pragma Check (Invariant, exp, "failed invariant from xxx");
7574 -- pragma Check (Invariant, exp, "failed invariant from xxx");
7576 -- pragma Check (Invariant, exp, "failed inherited invariant from xxx");
7578 -- end typInvariant;
7580 procedure Build_Invariant_Procedure (Typ : Entity_Id; N : Node_Id) is
7581 Loc : constant Source_Ptr := Sloc (Typ);
7589 -- Name for Check pragma, usually Invariant, but might be Type_Invariant
7590 -- if we come from a Type_Invariant aspect, we make sure to build the
7591 -- Check pragma with the right name, so that Check_Policy works right.
7593 Visible_Decls : constant List_Id := Visible_Declarations (N);
7594 Private_Decls : constant List_Id := Private_Declarations (N);
7596 procedure Add_Invariants (T : Entity_Id; Inherit : Boolean);
7597 -- Appends statements to Stmts for any invariants in the rep item chain
7598 -- of the given type. If Inherit is False, then we only process entries
7599 -- on the chain for the type Typ. If Inherit is True, then we ignore any
7600 -- Invariant aspects, but we process all Invariant'Class aspects, adding
7601 -- "inherited" to the exception message and generating an informational
7602 -- message about the inheritance of an invariant.
7604 Object_Name : Name_Id;
7605 -- Name for argument of invariant procedure
7607 Object_Entity : Node_Id;
7608 -- The entity of the formal for the procedure
7610 --------------------
7611 -- Add_Invariants --
7612 --------------------
7614 procedure Add_Invariants (T : Entity_Id; Inherit : Boolean) is
7624 procedure Replace_Type_Reference (N : Node_Id);
7625 -- Replace a single occurrence N of the subtype name with a reference
7626 -- to the formal of the predicate function. N can be an identifier
7627 -- referencing the subtype, or a selected component, representing an
7628 -- appropriately qualified occurrence of the subtype name.
7630 procedure Replace_Type_References is
7631 new Replace_Type_References_Generic (Replace_Type_Reference);
7632 -- Traverse an expression replacing all occurrences of the subtype
7633 -- name with appropriate references to the object that is the formal
7634 -- parameter of the predicate function. Note that we must ensure
7635 -- that the type and entity information is properly set in the
7636 -- replacement node, since we will do a Preanalyze call of this
7637 -- expression without proper visibility of the procedure argument.
7639 ----------------------------
7640 -- Replace_Type_Reference --
7641 ----------------------------
7643 -- Note: See comments in Add_Predicates.Replace_Type_Reference
7644 -- regarding handling of Sloc and Comes_From_Source.
7646 procedure Replace_Type_Reference (N : Node_Id) is
7649 -- Add semantic information to node to be rewritten, for ASIS
7650 -- navigation needs.
7652 if Nkind (N) = N_Identifier then
7656 elsif Nkind (N) = N_Selected_Component then
7657 Analyze (Prefix (N));
7658 Set_Entity (Selector_Name (N), T);
7659 Set_Etype (Selector_Name (N), T);
7662 -- Invariant'Class, replace with T'Class (obj)
7663 -- In ASIS mode, an inherited item is analyzed already, and the
7664 -- replacement has been done, so do not repeat transformation
7665 -- to prevent ill-formed tree.
7667 if Class_Present (Ritem) then
7669 and then Nkind (Parent (N)) = N_Attribute_Reference
7670 and then Attribute_Name (Parent (N)) = Name_Class
7676 Make_Type_Conversion (Sloc (N),
7678 Make_Attribute_Reference (Sloc (N),
7679 Prefix => New_Occurrence_Of (T, Sloc (N)),
7680 Attribute_Name => Name_Class),
7682 Make_Identifier (Sloc (N), Object_Name)));
7684 Set_Entity (Expression (N), Object_Entity);
7685 Set_Etype (Expression (N), Typ);
7688 -- Invariant, replace with obj
7691 Rewrite (N, Make_Identifier (Sloc (N), Object_Name));
7692 Set_Entity (N, Object_Entity);
7696 Set_Comes_From_Source (N, True);
7697 end Replace_Type_Reference;
7699 -- Start of processing for Add_Invariants
7702 Ritem := First_Rep_Item (T);
7703 while Present (Ritem) loop
7704 if Nkind (Ritem) = N_Pragma
7705 and then Pragma_Name (Ritem) = Name_Invariant
7707 Arg1 := First (Pragma_Argument_Associations (Ritem));
7708 Arg2 := Next (Arg1);
7709 Arg3 := Next (Arg2);
7711 Arg1 := Get_Pragma_Arg (Arg1);
7712 Arg2 := Get_Pragma_Arg (Arg2);
7714 -- For Inherit case, ignore Invariant, process only Class case
7717 if not Class_Present (Ritem) then
7721 -- For Inherit false, process only item for right type
7724 if Entity (Arg1) /= Typ then
7730 Stmts := Empty_List;
7733 Exp := New_Copy_Tree (Arg2);
7735 -- Preserve sloc of original pragma Invariant
7737 Loc := Sloc (Ritem);
7739 -- We need to replace any occurrences of the name of the type
7740 -- with references to the object, converted to type'Class in
7741 -- the case of Invariant'Class aspects.
7743 Replace_Type_References (Exp, T);
7745 -- If this invariant comes from an aspect, find the aspect
7746 -- specification, and replace the saved expression because
7747 -- we need the subtype references replaced for the calls to
7748 -- Preanalyze_Spec_Expressin in Check_Aspect_At_Freeze_Point
7749 -- and Check_Aspect_At_End_Of_Declarations.
7751 if From_Aspect_Specification (Ritem) then
7756 -- Loop to find corresponding aspect, note that this
7757 -- must be present given the pragma is marked delayed.
7759 -- Note: in practice Next_Rep_Item (Ritem) is Empty so
7760 -- this loop does nothing. Furthermore, why isn't this
7761 -- simply Corresponding_Aspect ???
7763 Aitem := Next_Rep_Item (Ritem);
7764 while Present (Aitem) loop
7765 if Nkind (Aitem) = N_Aspect_Specification
7766 and then Aspect_Rep_Item (Aitem) = Ritem
7769 (Identifier (Aitem), New_Copy_Tree (Exp));
7773 Aitem := Next_Rep_Item (Aitem);
7778 -- Now we need to preanalyze the expression to properly capture
7779 -- the visibility in the visible part. The expression will not
7780 -- be analyzed for real until the body is analyzed, but that is
7781 -- at the end of the private part and has the wrong visibility.
7783 Set_Parent (Exp, N);
7784 Preanalyze_Assert_Expression (Exp, Any_Boolean);
7786 -- A class-wide invariant may be inherited in a separate unit,
7787 -- where the corresponding expression cannot be resolved by
7788 -- visibility, because it refers to a local function. Propagate
7789 -- semantic information to the original representation item, to
7790 -- be used when an invariant procedure for a derived type is
7793 -- Unclear how to handle class-wide invariants that are not
7794 -- function calls ???
7797 and then Class_Present (Ritem)
7798 and then Nkind (Exp) = N_Function_Call
7799 and then Nkind (Arg2) = N_Indexed_Component
7802 Make_Function_Call (Loc,
7804 New_Occurrence_Of (Entity (Name (Exp)), Loc),
7805 Parameter_Associations =>
7806 New_Copy_List (Expressions (Arg2))));
7809 -- In ASIS mode, even if assertions are not enabled, we must
7810 -- analyze the original expression in the aspect specification
7811 -- because it is part of the original tree.
7813 if ASIS_Mode and then From_Aspect_Specification (Ritem) then
7815 Inv : constant Node_Id :=
7816 Expression (Corresponding_Aspect (Ritem));
7818 Replace_Type_References (Inv, T);
7819 Preanalyze_Assert_Expression (Inv, Standard_Boolean);
7823 -- Get name to be used for Check pragma
7825 if not From_Aspect_Specification (Ritem) then
7826 Nam := Name_Invariant;
7828 Nam := Chars (Identifier (Corresponding_Aspect (Ritem)));
7831 -- Build first two arguments for Check pragma
7835 Make_Pragma_Argument_Association (Loc,
7836 Expression => Make_Identifier (Loc, Chars => Nam)),
7837 Make_Pragma_Argument_Association (Loc,
7838 Expression => Exp));
7840 -- Add message if present in Invariant pragma
7842 if Present (Arg3) then
7843 Str := Strval (Get_Pragma_Arg (Arg3));
7845 -- If inherited case, and message starts "failed invariant",
7846 -- change it to be "failed inherited invariant".
7849 String_To_Name_Buffer (Str);
7851 if Name_Buffer (1 .. 16) = "failed invariant" then
7852 Insert_Str_In_Name_Buffer ("inherited ", 8);
7853 Str := String_From_Name_Buffer;
7858 Make_Pragma_Argument_Association (Loc,
7859 Expression => Make_String_Literal (Loc, Str)));
7862 -- Add Check pragma to list of statements
7866 Pragma_Identifier =>
7867 Make_Identifier (Loc, Name_Check),
7868 Pragma_Argument_Associations => Assoc));
7870 -- If Inherited case and option enabled, output info msg. Note
7871 -- that we know this is a case of Invariant'Class.
7873 if Inherit and Opt.List_Inherited_Aspects then
7874 Error_Msg_Sloc := Sloc (Ritem);
7876 ("info: & inherits `Invariant''Class` aspect from #?L?",
7882 Next_Rep_Item (Ritem);
7886 -- Start of processing for Build_Invariant_Procedure
7894 -- If the aspect specification exists for some view of the type, the
7895 -- declaration for the procedure has been created.
7897 if Has_Invariants (Typ) then
7898 SId := Invariant_Procedure (Typ);
7901 -- If the body is already present, nothing to do. This will occur when
7902 -- the type is already frozen, which is the case when the invariant
7903 -- appears in a private part, and the freezing takes place before the
7904 -- final pass over full declarations.
7906 -- See Exp_Ch3.Insert_Component_Invariant_Checks for details.
7908 if Present (SId) then
7909 PDecl := Unit_Declaration_Node (SId);
7912 and then Nkind (PDecl) = N_Subprogram_Declaration
7913 and then Present (Corresponding_Body (PDecl))
7919 PDecl := Build_Invariant_Procedure_Declaration (Typ);
7922 -- Recover formal of procedure, for use in the calls to invariant
7923 -- functions (including inherited ones).
7927 (First (Parameter_Specifications (Specification (PDecl))));
7928 Object_Name := Chars (Object_Entity);
7930 -- Add invariants for the current type
7932 Add_Invariants (Typ, Inherit => False);
7934 -- Add invariants for parent types
7937 Current_Typ : Entity_Id;
7938 Parent_Typ : Entity_Id;
7943 Parent_Typ := Etype (Current_Typ);
7945 if Is_Private_Type (Parent_Typ)
7946 and then Present (Full_View (Base_Type (Parent_Typ)))
7948 Parent_Typ := Full_View (Base_Type (Parent_Typ));
7951 exit when Parent_Typ = Current_Typ;
7953 Current_Typ := Parent_Typ;
7954 Add_Invariants (Current_Typ, Inherit => True);
7958 -- Build the procedure if we generated at least one Check pragma
7960 if Stmts /= No_List then
7961 Spec := Copy_Separate_Tree (Specification (PDecl));
7964 Make_Subprogram_Body (Loc,
7965 Specification => Spec,
7966 Declarations => Empty_List,
7967 Handled_Statement_Sequence =>
7968 Make_Handled_Sequence_Of_Statements (Loc,
7969 Statements => Stmts));
7971 -- Insert procedure declaration and spec at the appropriate points.
7972 -- If declaration is already analyzed, it was processed by the
7973 -- generated pragma.
7975 if Present (Private_Decls) then
7977 -- The spec goes at the end of visible declarations, but they have
7978 -- already been analyzed, so we need to explicitly do the analyze.
7980 if not Analyzed (PDecl) then
7981 Append_To (Visible_Decls, PDecl);
7985 -- The body goes at the end of the private declarations, which we
7986 -- have not analyzed yet, so we do not need to perform an explicit
7987 -- analyze call. We skip this if there are no private declarations
7988 -- (this is an error that will be caught elsewhere);
7990 Append_To (Private_Decls, PBody);
7992 -- If the invariant appears on the full view of a type, the
7993 -- analysis of the private part is complete, and we must
7994 -- analyze the new body explicitly.
7996 if In_Private_Part (Current_Scope) then
8000 -- If there are no private declarations this may be an error that
8001 -- will be diagnosed elsewhere. However, if this is a non-private
8002 -- type that inherits invariants, it needs no completion and there
8003 -- may be no private part. In this case insert invariant procedure
8004 -- at end of current declarative list, and analyze at once, given
8005 -- that the type is about to be frozen.
8007 elsif not Is_Private_Type (Typ) then
8008 Append_To (Visible_Decls, PDecl);
8009 Append_To (Visible_Decls, PBody);
8014 end Build_Invariant_Procedure;
8016 -------------------------------
8017 -- Build_Predicate_Functions --
8018 -------------------------------
8020 -- The procedures that are constructed here have the form:
8022 -- function typPredicate (Ixxx : typ) return Boolean is
8025 -- exp1 and then exp2 and then ...
8026 -- and then typ1Predicate (typ1 (Ixxx))
8027 -- and then typ2Predicate (typ2 (Ixxx))
8029 -- end typPredicate;
8031 -- Here exp1, and exp2 are expressions from Predicate pragmas. Note that
8032 -- this is the point at which these expressions get analyzed, providing the
8033 -- required delay, and typ1, typ2, are entities from which predicates are
8034 -- inherited. Note that we do NOT generate Check pragmas, that's because we
8035 -- use this function even if checks are off, e.g. for membership tests.
8037 -- If the expression has at least one Raise_Expression, then we also build
8038 -- the typPredicateM version of the function, in which any occurrence of a
8039 -- Raise_Expression is converted to "return False".
8041 procedure Build_Predicate_Functions (Typ : Entity_Id; N : Node_Id) is
8042 Loc : constant Source_Ptr := Sloc (Typ);
8045 -- This is the expression for the result of the function. It is
8046 -- is build by connecting the component predicates with AND THEN.
8049 -- This is the corresponding return expression for the Predicate_M
8050 -- function. It differs in that raise expressions are marked for
8051 -- special expansion (see Process_REs).
8053 Object_Name : constant Name_Id := New_Internal_Name ('I');
8054 -- Name for argument of Predicate procedure. Note that we use the same
8055 -- name for both predicate functions. That way the reference within the
8056 -- predicate expression is the same in both functions.
8058 Object_Entity : constant Entity_Id :=
8059 Make_Defining_Identifier (Loc, Chars => Object_Name);
8060 -- Entity for argument of Predicate procedure
8062 Object_Entity_M : constant Entity_Id :=
8063 Make_Defining_Identifier (Loc, Chars => Object_Name);
8064 -- Entity for argument of Predicate_M procedure
8066 Raise_Expression_Present : Boolean := False;
8067 -- Set True if Expr has at least one Raise_Expression
8069 procedure Add_Call (T : Entity_Id);
8070 -- Includes a call to the predicate function for type T in Expr if T
8071 -- has predicates and Predicate_Function (T) is non-empty.
8073 procedure Add_Predicates;
8074 -- Appends expressions for any Predicate pragmas in the rep item chain
8075 -- Typ to Expr. Note that we look only at items for this exact entity.
8076 -- Inheritance of predicates for the parent type is done by calling the
8077 -- Predicate_Function of the parent type, using Add_Call above.
8079 function Test_RE (N : Node_Id) return Traverse_Result;
8080 -- Used in Test_REs, tests one node for being a raise expression, and if
8081 -- so sets Raise_Expression_Present True.
8083 procedure Test_REs is new Traverse_Proc (Test_RE);
8084 -- Tests to see if Expr contains any raise expressions
8086 function Process_RE (N : Node_Id) return Traverse_Result;
8087 -- Used in Process REs, tests if node N is a raise expression, and if
8088 -- so, marks it to be converted to return False.
8090 procedure Process_REs is new Traverse_Proc (Process_RE);
8091 -- Marks any raise expressions in Expr_M to return False
8097 procedure Add_Call (T : Entity_Id) is
8101 if Present (T) and then Present (Predicate_Function (T)) then
8102 Set_Has_Predicates (Typ);
8104 -- Build the call to the predicate function of T
8108 (T, Convert_To (T, Make_Identifier (Loc, Object_Name)));
8110 -- Add call to evolving expression, using AND THEN if needed
8117 Make_And_Then (Sloc (Expr),
8118 Left_Opnd => Relocate_Node (Expr),
8122 -- Output info message on inheritance if required. Note we do not
8123 -- give this information for generic actual types, since it is
8124 -- unwelcome noise in that case in instantiations. We also
8125 -- generally suppress the message in instantiations, and also
8126 -- if it involves internal names.
8128 if Opt.List_Inherited_Aspects
8129 and then not Is_Generic_Actual_Type (Typ)
8130 and then Instantiation_Depth (Sloc (Typ)) = 0
8131 and then not Is_Internal_Name (Chars (T))
8132 and then not Is_Internal_Name (Chars (Typ))
8134 Error_Msg_Sloc := Sloc (Predicate_Function (T));
8135 Error_Msg_Node_2 := T;
8136 Error_Msg_N ("info: & inherits predicate from & #?L?", Typ);
8141 --------------------
8142 -- Add_Predicates --
8143 --------------------
8145 procedure Add_Predicates is
8150 procedure Replace_Type_Reference (N : Node_Id);
8151 -- Replace a single occurrence N of the subtype name with a reference
8152 -- to the formal of the predicate function. N can be an identifier
8153 -- referencing the subtype, or a selected component, representing an
8154 -- appropriately qualified occurrence of the subtype name.
8156 procedure Replace_Type_References is
8157 new Replace_Type_References_Generic (Replace_Type_Reference);
8158 -- Traverse an expression changing every occurrence of an identifier
8159 -- whose name matches the name of the subtype with a reference to
8160 -- the formal parameter of the predicate function.
8162 ----------------------------
8163 -- Replace_Type_Reference --
8164 ----------------------------
8166 procedure Replace_Type_Reference (N : Node_Id) is
8168 Rewrite (N, Make_Identifier (Sloc (N), Object_Name));
8169 -- Use the Sloc of the usage name, not the defining name
8172 Set_Entity (N, Object_Entity);
8174 -- We want to treat the node as if it comes from source, so that
8175 -- ASIS will not ignore it
8177 Set_Comes_From_Source (N, True);
8178 end Replace_Type_Reference;
8180 -- Start of processing for Add_Predicates
8183 Ritem := First_Rep_Item (Typ);
8184 while Present (Ritem) loop
8185 if Nkind (Ritem) = N_Pragma
8186 and then Pragma_Name (Ritem) = Name_Predicate
8188 -- Acquire arguments
8190 Arg1 := First (Pragma_Argument_Associations (Ritem));
8191 Arg2 := Next (Arg1);
8193 Arg1 := Get_Pragma_Arg (Arg1);
8194 Arg2 := Get_Pragma_Arg (Arg2);
8196 -- See if this predicate pragma is for the current type or for
8197 -- its full view. A predicate on a private completion is placed
8198 -- on the partial view beause this is the visible entity that
8201 if Entity (Arg1) = Typ
8202 or else Full_View (Entity (Arg1)) = Typ
8204 -- We have a match, this entry is for our subtype
8206 -- We need to replace any occurrences of the name of the
8207 -- type with references to the object.
8209 Replace_Type_References (Arg2, Typ);
8211 -- If this predicate comes from an aspect, find the aspect
8212 -- specification, and replace the saved expression because
8213 -- we need the subtype references replaced for the calls to
8214 -- Preanalyze_Spec_Expressin in Check_Aspect_At_Freeze_Point
8215 -- and Check_Aspect_At_End_Of_Declarations.
8217 if From_Aspect_Specification (Ritem) then
8222 -- Loop to find corresponding aspect, note that this
8223 -- must be present given the pragma is marked delayed.
8225 Aitem := Next_Rep_Item (Ritem);
8227 if Nkind (Aitem) = N_Aspect_Specification
8228 and then Aspect_Rep_Item (Aitem) = Ritem
8231 (Identifier (Aitem), New_Copy_Tree (Arg2));
8235 Aitem := Next_Rep_Item (Aitem);
8240 -- Now we can add the expression
8243 Expr := Relocate_Node (Arg2);
8245 -- There already was a predicate, so add to it
8250 Left_Opnd => Relocate_Node (Expr),
8251 Right_Opnd => Relocate_Node (Arg2));
8256 Next_Rep_Item (Ritem);
8264 function Process_RE (N : Node_Id) return Traverse_Result is
8266 if Nkind (N) = N_Raise_Expression then
8267 Set_Convert_To_Return_False (N);
8278 function Test_RE (N : Node_Id) return Traverse_Result is
8280 if Nkind (N) = N_Raise_Expression then
8281 Raise_Expression_Present := True;
8288 -- Start of processing for Build_Predicate_Functions
8291 -- Return if already built or if type does not have predicates
8293 if not Has_Predicates (Typ)
8294 or else Present (Predicate_Function (Typ))
8299 -- Prepare to construct predicate expression
8303 -- Add Predicates for the current type
8307 -- Add predicates for ancestor if present
8310 Atyp : constant Entity_Id := Nearest_Ancestor (Typ);
8312 if Present (Atyp) then
8317 -- Case where predicates are present
8319 if Present (Expr) then
8321 -- Test for raise expression present
8325 -- If raise expression is present, capture a copy of Expr for use
8326 -- in building the predicateM function version later on. For this
8327 -- copy we replace references to Object_Entity by Object_Entity_M.
8329 if Raise_Expression_Present then
8331 Map : constant Elist_Id := New_Elmt_List;
8332 New_V : Entity_Id := Empty;
8334 -- The unanalyzed expression will be copied and appear in
8335 -- both functions. Normally expressions do not declare new
8336 -- entities, but quantified expressions do, so we need to
8337 -- create new entities for their bound variables, to prevent
8338 -- multiple definitions in gigi.
8340 function Reset_Loop_Variable (N : Node_Id)
8341 return Traverse_Result;
8343 procedure Collect_Loop_Variables is
8344 new Traverse_Proc (Reset_Loop_Variable);
8346 ------------------------
8347 -- Reset_Loop_Variable --
8348 ------------------------
8350 function Reset_Loop_Variable (N : Node_Id)
8351 return Traverse_Result
8354 if Nkind (N) = N_Iterator_Specification then
8355 New_V := Make_Defining_Identifier
8356 (Sloc (N), Chars (Defining_Identifier (N)));
8358 Set_Defining_Identifier (N, New_V);
8362 end Reset_Loop_Variable;
8365 Append_Elmt (Object_Entity, Map);
8366 Append_Elmt (Object_Entity_M, Map);
8367 Expr_M := New_Copy_Tree (Expr, Map => Map);
8368 Collect_Loop_Variables (Expr_M);
8372 -- Build the main predicate function
8375 SId : constant Entity_Id :=
8376 Make_Defining_Identifier (Loc,
8377 Chars => New_External_Name (Chars (Typ), "Predicate"));
8378 -- The entity for the the function spec
8380 SIdB : constant Entity_Id :=
8381 Make_Defining_Identifier (Loc,
8382 Chars => New_External_Name (Chars (Typ), "Predicate"));
8383 -- The entity for the function body
8390 -- Build function declaration
8392 Set_Ekind (SId, E_Function);
8393 Set_Is_Internal (SId);
8394 Set_Is_Predicate_Function (SId);
8395 Set_Predicate_Function (Typ, SId);
8397 -- The predicate function is shared between views of a type
8399 if Is_Private_Type (Typ) and then Present (Full_View (Typ)) then
8400 Set_Predicate_Function (Full_View (Typ), SId);
8404 Make_Function_Specification (Loc,
8405 Defining_Unit_Name => SId,
8406 Parameter_Specifications => New_List (
8407 Make_Parameter_Specification (Loc,
8408 Defining_Identifier => Object_Entity,
8409 Parameter_Type => New_Occurrence_Of (Typ, Loc))),
8410 Result_Definition =>
8411 New_Occurrence_Of (Standard_Boolean, Loc));
8414 Make_Subprogram_Declaration (Loc,
8415 Specification => Spec);
8417 -- Build function body
8420 Make_Function_Specification (Loc,
8421 Defining_Unit_Name => SIdB,
8422 Parameter_Specifications => New_List (
8423 Make_Parameter_Specification (Loc,
8424 Defining_Identifier =>
8425 Make_Defining_Identifier (Loc, Object_Name),
8427 New_Occurrence_Of (Typ, Loc))),
8428 Result_Definition =>
8429 New_Occurrence_Of (Standard_Boolean, Loc));
8432 Make_Subprogram_Body (Loc,
8433 Specification => Spec,
8434 Declarations => Empty_List,
8435 Handled_Statement_Sequence =>
8436 Make_Handled_Sequence_Of_Statements (Loc,
8437 Statements => New_List (
8438 Make_Simple_Return_Statement (Loc,
8439 Expression => Expr))));
8441 -- Insert declaration before freeze node and body after
8443 Insert_Before_And_Analyze (N, FDecl);
8444 Insert_After_And_Analyze (N, FBody);
8447 -- Test for raise expressions present and if so build M version
8449 if Raise_Expression_Present then
8451 SId : constant Entity_Id :=
8452 Make_Defining_Identifier (Loc,
8453 Chars => New_External_Name (Chars (Typ), "PredicateM"));
8454 -- The entity for the the function spec
8456 SIdB : constant Entity_Id :=
8457 Make_Defining_Identifier (Loc,
8458 Chars => New_External_Name (Chars (Typ), "PredicateM"));
8459 -- The entity for the function body
8467 -- Mark any raise expressions for special expansion
8469 Process_REs (Expr_M);
8471 -- Build function declaration
8473 Set_Ekind (SId, E_Function);
8474 Set_Is_Predicate_Function_M (SId);
8475 Set_Predicate_Function_M (Typ, SId);
8477 -- The predicate function is shared between views of a type
8479 if Is_Private_Type (Typ) and then Present (Full_View (Typ)) then
8480 Set_Predicate_Function_M (Full_View (Typ), SId);
8484 Make_Function_Specification (Loc,
8485 Defining_Unit_Name => SId,
8486 Parameter_Specifications => New_List (
8487 Make_Parameter_Specification (Loc,
8488 Defining_Identifier => Object_Entity_M,
8489 Parameter_Type => New_Occurrence_Of (Typ, Loc))),
8490 Result_Definition =>
8491 New_Occurrence_Of (Standard_Boolean, Loc));
8494 Make_Subprogram_Declaration (Loc,
8495 Specification => Spec);
8497 -- Build function body
8500 Make_Function_Specification (Loc,
8501 Defining_Unit_Name => SIdB,
8502 Parameter_Specifications => New_List (
8503 Make_Parameter_Specification (Loc,
8504 Defining_Identifier =>
8505 Make_Defining_Identifier (Loc, Object_Name),
8507 New_Occurrence_Of (Typ, Loc))),
8508 Result_Definition =>
8509 New_Occurrence_Of (Standard_Boolean, Loc));
8511 -- Build the body, we declare the boolean expression before
8512 -- doing the return, because we are not really confident of
8513 -- what happens if a return appears within a return.
8516 Make_Defining_Identifier (Loc,
8517 Chars => New_Internal_Name ('B'));
8520 Make_Subprogram_Body (Loc,
8521 Specification => Spec,
8523 Declarations => New_List (
8524 Make_Object_Declaration (Loc,
8525 Defining_Identifier => BTemp,
8526 Constant_Present => True,
8527 Object_Definition =>
8528 New_Occurrence_Of (Standard_Boolean, Loc),
8529 Expression => Expr_M)),
8531 Handled_Statement_Sequence =>
8532 Make_Handled_Sequence_Of_Statements (Loc,
8533 Statements => New_List (
8534 Make_Simple_Return_Statement (Loc,
8535 Expression => New_Occurrence_Of (BTemp, Loc)))));
8537 -- Insert declaration before freeze node and body after
8539 Insert_Before_And_Analyze (N, FDecl);
8540 Insert_After_And_Analyze (N, FBody);
8544 -- See if we have a static predicate. Note that the answer may be
8545 -- yes even if we have an explicit Dynamic_Predicate present.
8552 if not Is_Scalar_Type (Typ) and then not Is_String_Type (Typ) then
8555 PS := Is_Predicate_Static (Expr, Object_Name);
8558 -- Case where we have a predicate-static aspect
8562 -- We don't set Has_Static_Predicate_Aspect, since we can have
8563 -- any of the three cases (Predicate, Dynamic_Predicate, or
8564 -- Static_Predicate) generating a predicate with an expression
8565 -- that is predicate-static. We just indicate that we have a
8566 -- predicate that can be treated as static.
8568 Set_Has_Static_Predicate (Typ);
8570 -- For discrete subtype, build the static predicate list
8572 if Is_Discrete_Type (Typ) then
8573 if not Is_Static_Subtype (Typ) then
8575 -- This can only happen in the presence of previous
8578 pragma Assert (Serious_Errors_Detected > 0);
8582 Build_Discrete_Static_Predicate (Typ, Expr, Object_Name);
8584 -- If we don't get a static predicate list, it means that we
8585 -- have a case where this is not possible, most typically in
8586 -- the case where we inherit a dynamic predicate. We do not
8587 -- consider this an error, we just leave the predicate as
8588 -- dynamic. But if we do succeed in building the list, then
8589 -- we mark the predicate as static.
8591 if No (Static_Discrete_Predicate (Typ)) then
8592 Set_Has_Static_Predicate (Typ, False);
8595 -- For real or string subtype, save predicate expression
8597 elsif Is_Real_Type (Typ) or else Is_String_Type (Typ) then
8598 Set_Static_Real_Or_String_Predicate (Typ, Expr);
8601 -- Case of dynamic predicate (expression is not predicate-static)
8604 -- Again, we don't set Has_Dynamic_Predicate_Aspect, since that
8605 -- is only set if we have an explicit Dynamic_Predicate aspect
8606 -- given. Here we may simply have a Predicate aspect where the
8607 -- expression happens not to be predicate-static.
8609 -- Emit an error when the predicate is categorized as static
8610 -- but its expression is not predicate-static.
8612 -- First a little fiddling to get a nice location for the
8613 -- message. If the expression is of the form (A and then B),
8614 -- then use the left operand for the Sloc. This avoids getting
8615 -- confused by a call to a higher-level predicate with a less
8616 -- convenient source location.
8619 while Nkind (EN) = N_And_Then loop
8620 EN := Left_Opnd (EN);
8623 -- Now post appropriate message
8625 if Has_Static_Predicate_Aspect (Typ) then
8626 if Is_Scalar_Type (Typ) or else Is_String_Type (Typ) then
8628 ("expression is not predicate-static (RM 3.2.4(16-22))",
8632 ("static predicate requires scalar or string type", EN);
8638 end Build_Predicate_Functions;
8640 -----------------------------------------
8641 -- Check_Aspect_At_End_Of_Declarations --
8642 -----------------------------------------
8644 procedure Check_Aspect_At_End_Of_Declarations (ASN : Node_Id) is
8645 Ent : constant Entity_Id := Entity (ASN);
8646 Ident : constant Node_Id := Identifier (ASN);
8647 A_Id : constant Aspect_Id := Get_Aspect_Id (Chars (Ident));
8649 End_Decl_Expr : constant Node_Id := Entity (Ident);
8650 -- Expression to be analyzed at end of declarations
8652 Freeze_Expr : constant Node_Id := Expression (ASN);
8653 -- Expression from call to Check_Aspect_At_Freeze_Point
8655 T : constant Entity_Id := Etype (Freeze_Expr);
8656 -- Type required for preanalyze call
8659 -- Set False if error
8661 -- On entry to this procedure, Entity (Ident) contains a copy of the
8662 -- original expression from the aspect, saved for this purpose, and
8663 -- but Expression (Ident) is a preanalyzed copy of the expression,
8664 -- preanalyzed just after the freeze point.
8666 procedure Check_Overloaded_Name;
8667 -- For aspects whose expression is simply a name, this routine checks if
8668 -- the name is overloaded or not. If so, it verifies there is an
8669 -- interpretation that matches the entity obtained at the freeze point,
8670 -- otherwise the compiler complains.
8672 ---------------------------
8673 -- Check_Overloaded_Name --
8674 ---------------------------
8676 procedure Check_Overloaded_Name is
8678 if not Is_Overloaded (End_Decl_Expr) then
8679 Err := not Is_Entity_Name (End_Decl_Expr)
8680 or else Entity (End_Decl_Expr) /= Entity (Freeze_Expr);
8686 Index : Interp_Index;
8690 Get_First_Interp (End_Decl_Expr, Index, It);
8691 while Present (It.Typ) loop
8692 if It.Nam = Entity (Freeze_Expr) then
8697 Get_Next_Interp (Index, It);
8701 end Check_Overloaded_Name;
8703 -- Start of processing for Check_Aspect_At_End_Of_Declarations
8706 -- Case of aspects Dimension, Dimension_System and Synchronization
8708 if A_Id = Aspect_Synchronization then
8711 -- Case of stream attributes, just have to compare entities. However,
8712 -- the expression is just a name (possibly overloaded), and there may
8713 -- be stream operations declared for unrelated types, so we just need
8714 -- to verify that one of these interpretations is the one available at
8715 -- at the freeze point.
8717 elsif A_Id = Aspect_Input or else
8718 A_Id = Aspect_Output or else
8719 A_Id = Aspect_Read or else
8722 Analyze (End_Decl_Expr);
8723 Check_Overloaded_Name;
8725 elsif A_Id = Aspect_Variable_Indexing or else
8726 A_Id = Aspect_Constant_Indexing or else
8727 A_Id = Aspect_Default_Iterator or else
8728 A_Id = Aspect_Iterator_Element
8730 -- Make type unfrozen before analysis, to prevent spurious errors
8731 -- about late attributes.
8733 Set_Is_Frozen (Ent, False);
8734 Analyze (End_Decl_Expr);
8735 Set_Is_Frozen (Ent, True);
8737 -- If the end of declarations comes before any other freeze
8738 -- point, the Freeze_Expr is not analyzed: no check needed.
8740 if Analyzed (Freeze_Expr) and then not In_Instance then
8741 Check_Overloaded_Name;
8749 -- Indicate that the expression comes from an aspect specification,
8750 -- which is used in subsequent analysis even if expansion is off.
8752 Set_Parent (End_Decl_Expr, ASN);
8754 -- In a generic context the aspect expressions have not been
8755 -- preanalyzed, so do it now. There are no conformance checks
8756 -- to perform in this case.
8759 Check_Aspect_At_Freeze_Point (ASN);
8762 -- The default values attributes may be defined in the private part,
8763 -- and the analysis of the expression may take place when only the
8764 -- partial view is visible. The expression must be scalar, so use
8765 -- the full view to resolve.
8767 elsif (A_Id = Aspect_Default_Value
8769 A_Id = Aspect_Default_Component_Value)
8770 and then Is_Private_Type (T)
8772 Preanalyze_Spec_Expression (End_Decl_Expr, Full_View (T));
8775 Preanalyze_Spec_Expression (End_Decl_Expr, T);
8778 Err := not Fully_Conformant_Expressions (End_Decl_Expr, Freeze_Expr);
8781 -- Output error message if error. Force error on aspect specification
8782 -- even if there is an error on the expression itself.
8786 ("!visibility of aspect for& changes after freeze point",
8789 ("info: & is frozen here, aspects evaluated at this point??",
8790 Freeze_Node (Ent), Ent);
8792 end Check_Aspect_At_End_Of_Declarations;
8794 ----------------------------------
8795 -- Check_Aspect_At_Freeze_Point --
8796 ----------------------------------
8798 procedure Check_Aspect_At_Freeze_Point (ASN : Node_Id) is
8799 Ident : constant Node_Id := Identifier (ASN);
8800 -- Identifier (use Entity field to save expression)
8802 A_Id : constant Aspect_Id := Get_Aspect_Id (Chars (Ident));
8804 T : Entity_Id := Empty;
8805 -- Type required for preanalyze call
8808 -- On entry to this procedure, Entity (Ident) contains a copy of the
8809 -- original expression from the aspect, saved for this purpose.
8811 -- On exit from this procedure Entity (Ident) is unchanged, still
8812 -- containing that copy, but Expression (Ident) is a preanalyzed copy
8813 -- of the expression, preanalyzed just after the freeze point.
8815 -- Make a copy of the expression to be preanalyzed
8817 Set_Expression (ASN, New_Copy_Tree (Entity (Ident)));
8819 -- Find type for preanalyze call
8823 -- No_Aspect should be impossible
8826 raise Program_Error;
8828 -- Aspects taking an optional boolean argument
8830 when Boolean_Aspects |
8831 Library_Unit_Aspects =>
8833 T := Standard_Boolean;
8835 -- Aspects corresponding to attribute definition clauses
8837 when Aspect_Address =>
8838 T := RTE (RE_Address);
8840 when Aspect_Attach_Handler =>
8841 T := RTE (RE_Interrupt_ID);
8843 when Aspect_Bit_Order | Aspect_Scalar_Storage_Order =>
8844 T := RTE (RE_Bit_Order);
8846 when Aspect_Convention =>
8850 T := RTE (RE_CPU_Range);
8852 -- Default_Component_Value is resolved with the component type
8854 when Aspect_Default_Component_Value =>
8855 T := Component_Type (Entity (ASN));
8857 when Aspect_Default_Storage_Pool =>
8858 T := Class_Wide_Type (RTE (RE_Root_Storage_Pool));
8860 -- Default_Value is resolved with the type entity in question
8862 when Aspect_Default_Value =>
8865 when Aspect_Dispatching_Domain =>
8866 T := RTE (RE_Dispatching_Domain);
8868 when Aspect_External_Tag =>
8869 T := Standard_String;
8871 when Aspect_External_Name =>
8872 T := Standard_String;
8874 when Aspect_Link_Name =>
8875 T := Standard_String;
8877 when Aspect_Priority | Aspect_Interrupt_Priority =>
8878 T := Standard_Integer;
8880 when Aspect_Relative_Deadline =>
8881 T := RTE (RE_Time_Span);
8883 when Aspect_Small =>
8884 T := Universal_Real;
8886 -- For a simple storage pool, we have to retrieve the type of the
8887 -- pool object associated with the aspect's corresponding attribute
8888 -- definition clause.
8890 when Aspect_Simple_Storage_Pool =>
8891 T := Etype (Expression (Aspect_Rep_Item (ASN)));
8893 when Aspect_Storage_Pool =>
8894 T := Class_Wide_Type (RTE (RE_Root_Storage_Pool));
8896 when Aspect_Alignment |
8897 Aspect_Component_Size |
8898 Aspect_Machine_Radix |
8899 Aspect_Object_Size |
8901 Aspect_Storage_Size |
8902 Aspect_Stream_Size |
8903 Aspect_Value_Size =>
8906 when Aspect_Linker_Section =>
8907 T := Standard_String;
8909 when Aspect_Synchronization =>
8912 -- Special case, the expression of these aspects is just an entity
8913 -- that does not need any resolution, so just analyze.
8922 Analyze (Expression (ASN));
8925 -- Same for Iterator aspects, where the expression is a function
8926 -- name. Legality rules are checked separately.
8928 when Aspect_Constant_Indexing |
8929 Aspect_Default_Iterator |
8930 Aspect_Iterator_Element |
8931 Aspect_Variable_Indexing =>
8932 Analyze (Expression (ASN));
8935 -- Ditto for Iterable, legality checks in Validate_Iterable_Aspect.
8937 when Aspect_Iterable =>
8941 Cursor : constant Entity_Id := Get_Cursor_Type (ASN, T);
8946 if Cursor = Any_Type then
8950 Assoc := First (Component_Associations (Expression (ASN)));
8951 while Present (Assoc) loop
8952 Expr := Expression (Assoc);
8955 if not Error_Posted (Expr) then
8956 Resolve_Iterable_Operation
8957 (Expr, Cursor, T, Chars (First (Choices (Assoc))));
8966 -- Invariant/Predicate take boolean expressions
8968 when Aspect_Dynamic_Predicate |
8971 Aspect_Static_Predicate |
8972 Aspect_Type_Invariant =>
8973 T := Standard_Boolean;
8975 -- Here is the list of aspects that don't require delay analysis
8977 when Aspect_Abstract_State |
8979 Aspect_Contract_Cases |
8980 Aspect_Default_Initial_Condition |
8983 Aspect_Dimension_System |
8984 Aspect_Extensions_Visible |
8987 Aspect_Implicit_Dereference |
8988 Aspect_Initial_Condition |
8989 Aspect_Initializes |
8990 Aspect_Obsolescent |
8993 Aspect_Postcondition |
8995 Aspect_Precondition |
8996 Aspect_Refined_Depends |
8997 Aspect_Refined_Global |
8998 Aspect_Refined_Post |
8999 Aspect_Refined_State |
9002 raise Program_Error;
9006 -- Do the preanalyze call
9008 Preanalyze_Spec_Expression (Expression (ASN), T);
9009 end Check_Aspect_At_Freeze_Point;
9011 -----------------------------------
9012 -- Check_Constant_Address_Clause --
9013 -----------------------------------
9015 procedure Check_Constant_Address_Clause
9019 procedure Check_At_Constant_Address (Nod : Node_Id);
9020 -- Checks that the given node N represents a name whose 'Address is
9021 -- constant (in the same sense as OK_Constant_Address_Clause, i.e. the
9022 -- address value is the same at the point of declaration of U_Ent and at
9023 -- the time of elaboration of the address clause.
9025 procedure Check_Expr_Constants (Nod : Node_Id);
9026 -- Checks that Nod meets the requirements for a constant address clause
9027 -- in the sense of the enclosing procedure.
9029 procedure Check_List_Constants (Lst : List_Id);
9030 -- Check that all elements of list Lst meet the requirements for a
9031 -- constant address clause in the sense of the enclosing procedure.
9033 -------------------------------
9034 -- Check_At_Constant_Address --
9035 -------------------------------
9037 procedure Check_At_Constant_Address (Nod : Node_Id) is
9039 if Is_Entity_Name (Nod) then
9040 if Present (Address_Clause (Entity ((Nod)))) then
9042 ("invalid address clause for initialized object &!",
9045 ("address for& cannot" &
9046 " depend on another address clause! (RM 13.1(22))!",
9049 elsif In_Same_Source_Unit (Entity (Nod), U_Ent)
9050 and then Sloc (U_Ent) < Sloc (Entity (Nod))
9053 ("invalid address clause for initialized object &!",
9055 Error_Msg_Node_2 := U_Ent;
9057 ("\& must be defined before & (RM 13.1(22))!",
9061 elsif Nkind (Nod) = N_Selected_Component then
9063 T : constant Entity_Id := Etype (Prefix (Nod));
9066 if (Is_Record_Type (T)
9067 and then Has_Discriminants (T))
9070 and then Is_Record_Type (Designated_Type (T))
9071 and then Has_Discriminants (Designated_Type (T)))
9074 ("invalid address clause for initialized object &!",
9077 ("\address cannot depend on component" &
9078 " of discriminated record (RM 13.1(22))!",
9081 Check_At_Constant_Address (Prefix (Nod));
9085 elsif Nkind (Nod) = N_Indexed_Component then
9086 Check_At_Constant_Address (Prefix (Nod));
9087 Check_List_Constants (Expressions (Nod));
9090 Check_Expr_Constants (Nod);
9092 end Check_At_Constant_Address;
9094 --------------------------
9095 -- Check_Expr_Constants --
9096 --------------------------
9098 procedure Check_Expr_Constants (Nod : Node_Id) is
9099 Loc_U_Ent : constant Source_Ptr := Sloc (U_Ent);
9100 Ent : Entity_Id := Empty;
9103 if Nkind (Nod) in N_Has_Etype
9104 and then Etype (Nod) = Any_Type
9110 when N_Empty | N_Error =>
9113 when N_Identifier | N_Expanded_Name =>
9114 Ent := Entity (Nod);
9116 -- We need to look at the original node if it is different
9117 -- from the node, since we may have rewritten things and
9118 -- substituted an identifier representing the rewrite.
9120 if Original_Node (Nod) /= Nod then
9121 Check_Expr_Constants (Original_Node (Nod));
9123 -- If the node is an object declaration without initial
9124 -- value, some code has been expanded, and the expression
9125 -- is not constant, even if the constituents might be
9126 -- acceptable, as in A'Address + offset.
9128 if Ekind (Ent) = E_Variable
9130 Nkind (Declaration_Node (Ent)) = N_Object_Declaration
9132 No (Expression (Declaration_Node (Ent)))
9135 ("invalid address clause for initialized object &!",
9138 -- If entity is constant, it may be the result of expanding
9139 -- a check. We must verify that its declaration appears
9140 -- before the object in question, else we also reject the
9143 elsif Ekind (Ent) = E_Constant
9144 and then In_Same_Source_Unit (Ent, U_Ent)
9145 and then Sloc (Ent) > Loc_U_Ent
9148 ("invalid address clause for initialized object &!",
9155 -- Otherwise look at the identifier and see if it is OK
9157 if Ekind_In (Ent, E_Named_Integer, E_Named_Real)
9158 or else Is_Type (Ent)
9162 elsif Ekind_In (Ent, E_Constant, E_In_Parameter) then
9164 -- This is the case where we must have Ent defined before
9165 -- U_Ent. Clearly if they are in different units this
9166 -- requirement is met since the unit containing Ent is
9167 -- already processed.
9169 if not In_Same_Source_Unit (Ent, U_Ent) then
9172 -- Otherwise location of Ent must be before the location
9173 -- of U_Ent, that's what prior defined means.
9175 elsif Sloc (Ent) < Loc_U_Ent then
9180 ("invalid address clause for initialized object &!",
9182 Error_Msg_Node_2 := U_Ent;
9184 ("\& must be defined before & (RM 13.1(22))!",
9188 elsif Nkind (Original_Node (Nod)) = N_Function_Call then
9189 Check_Expr_Constants (Original_Node (Nod));
9193 ("invalid address clause for initialized object &!",
9196 if Comes_From_Source (Ent) then
9198 ("\reference to variable& not allowed"
9199 & " (RM 13.1(22))!", Nod, Ent);
9202 ("non-static expression not allowed"
9203 & " (RM 13.1(22))!", Nod);
9207 when N_Integer_Literal =>
9209 -- If this is a rewritten unchecked conversion, in a system
9210 -- where Address is an integer type, always use the base type
9211 -- for a literal value. This is user-friendly and prevents
9212 -- order-of-elaboration issues with instances of unchecked
9215 if Nkind (Original_Node (Nod)) = N_Function_Call then
9216 Set_Etype (Nod, Base_Type (Etype (Nod)));
9219 when N_Real_Literal |
9221 N_Character_Literal =>
9225 Check_Expr_Constants (Low_Bound (Nod));
9226 Check_Expr_Constants (High_Bound (Nod));
9228 when N_Explicit_Dereference =>
9229 Check_Expr_Constants (Prefix (Nod));
9231 when N_Indexed_Component =>
9232 Check_Expr_Constants (Prefix (Nod));
9233 Check_List_Constants (Expressions (Nod));
9236 Check_Expr_Constants (Prefix (Nod));
9237 Check_Expr_Constants (Discrete_Range (Nod));
9239 when N_Selected_Component =>
9240 Check_Expr_Constants (Prefix (Nod));
9242 when N_Attribute_Reference =>
9243 if Nam_In (Attribute_Name (Nod), Name_Address,
9245 Name_Unchecked_Access,
9246 Name_Unrestricted_Access)
9248 Check_At_Constant_Address (Prefix (Nod));
9251 Check_Expr_Constants (Prefix (Nod));
9252 Check_List_Constants (Expressions (Nod));
9256 Check_List_Constants (Component_Associations (Nod));
9257 Check_List_Constants (Expressions (Nod));
9259 when N_Component_Association =>
9260 Check_Expr_Constants (Expression (Nod));
9262 when N_Extension_Aggregate =>
9263 Check_Expr_Constants (Ancestor_Part (Nod));
9264 Check_List_Constants (Component_Associations (Nod));
9265 Check_List_Constants (Expressions (Nod));
9270 when N_Binary_Op | N_Short_Circuit | N_Membership_Test =>
9271 Check_Expr_Constants (Left_Opnd (Nod));
9272 Check_Expr_Constants (Right_Opnd (Nod));
9275 Check_Expr_Constants (Right_Opnd (Nod));
9277 when N_Type_Conversion |
9278 N_Qualified_Expression |
9280 N_Unchecked_Type_Conversion =>
9281 Check_Expr_Constants (Expression (Nod));
9283 when N_Function_Call =>
9284 if not Is_Pure (Entity (Name (Nod))) then
9286 ("invalid address clause for initialized object &!",
9290 ("\function & is not pure (RM 13.1(22))!",
9291 Nod, Entity (Name (Nod)));
9294 Check_List_Constants (Parameter_Associations (Nod));
9297 when N_Parameter_Association =>
9298 Check_Expr_Constants (Explicit_Actual_Parameter (Nod));
9302 ("invalid address clause for initialized object &!",
9305 ("\must be constant defined before& (RM 13.1(22))!",
9308 end Check_Expr_Constants;
9310 --------------------------
9311 -- Check_List_Constants --
9312 --------------------------
9314 procedure Check_List_Constants (Lst : List_Id) is
9318 if Present (Lst) then
9319 Nod1 := First (Lst);
9320 while Present (Nod1) loop
9321 Check_Expr_Constants (Nod1);
9325 end Check_List_Constants;
9327 -- Start of processing for Check_Constant_Address_Clause
9330 -- If rep_clauses are to be ignored, no need for legality checks. In
9331 -- particular, no need to pester user about rep clauses that violate the
9332 -- rule on constant addresses, given that these clauses will be removed
9333 -- by Freeze before they reach the back end. Similarly in CodePeer mode,
9334 -- we want to relax these checks.
9336 if not Ignore_Rep_Clauses and not CodePeer_Mode then
9337 Check_Expr_Constants (Expr);
9339 end Check_Constant_Address_Clause;
9341 ---------------------------
9342 -- Check_Pool_Size_Clash --
9343 ---------------------------
9345 procedure Check_Pool_Size_Clash (Ent : Entity_Id; SP, SS : Node_Id) is
9349 -- We need to find out which one came first. Note that in the case of
9350 -- aspects mixed with pragmas there are cases where the processing order
9351 -- is reversed, which is why we do the check here.
9353 if Sloc (SP) < Sloc (SS) then
9354 Error_Msg_Sloc := Sloc (SP);
9356 Error_Msg_NE ("Storage_Pool previously given for&#", Post, Ent);
9359 Error_Msg_Sloc := Sloc (SS);
9361 Error_Msg_NE ("Storage_Size previously given for&#", Post, Ent);
9365 ("\cannot have Storage_Size and Storage_Pool (RM 13.11(3))", Post);
9366 end Check_Pool_Size_Clash;
9368 ----------------------------------------
9369 -- Check_Record_Representation_Clause --
9370 ----------------------------------------
9372 procedure Check_Record_Representation_Clause (N : Node_Id) is
9373 Loc : constant Source_Ptr := Sloc (N);
9374 Ident : constant Node_Id := Identifier (N);
9375 Rectype : Entity_Id;
9380 Hbit : Uint := Uint_0;
9384 Max_Bit_So_Far : Uint;
9385 -- Records the maximum bit position so far. If all field positions
9386 -- are monotonically increasing, then we can skip the circuit for
9387 -- checking for overlap, since no overlap is possible.
9389 Tagged_Parent : Entity_Id := Empty;
9390 -- This is set in the case of a derived tagged type for which we have
9391 -- Is_Fully_Repped_Tagged_Type True (indicating that all components are
9392 -- positioned by record representation clauses). In this case we must
9393 -- check for overlap between components of this tagged type, and the
9394 -- components of its parent. Tagged_Parent will point to this parent
9395 -- type. For all other cases Tagged_Parent is left set to Empty.
9397 Parent_Last_Bit : Uint;
9398 -- Relevant only if Tagged_Parent is set, Parent_Last_Bit indicates the
9399 -- last bit position for any field in the parent type. We only need to
9400 -- check overlap for fields starting below this point.
9402 Overlap_Check_Required : Boolean;
9403 -- Used to keep track of whether or not an overlap check is required
9405 Overlap_Detected : Boolean := False;
9406 -- Set True if an overlap is detected
9408 Ccount : Natural := 0;
9409 -- Number of component clauses in record rep clause
9411 procedure Check_Component_Overlap (C1_Ent, C2_Ent : Entity_Id);
9412 -- Given two entities for record components or discriminants, checks
9413 -- if they have overlapping component clauses and issues errors if so.
9415 procedure Find_Component;
9416 -- Finds component entity corresponding to current component clause (in
9417 -- CC), and sets Comp to the entity, and Fbit/Lbit to the zero origin
9418 -- start/stop bits for the field. If there is no matching component or
9419 -- if the matching component does not have a component clause, then
9420 -- that's an error and Comp is set to Empty, but no error message is
9421 -- issued, since the message was already given. Comp is also set to
9422 -- Empty if the current "component clause" is in fact a pragma.
9424 -----------------------------
9425 -- Check_Component_Overlap --
9426 -----------------------------
9428 procedure Check_Component_Overlap (C1_Ent, C2_Ent : Entity_Id) is
9429 CC1 : constant Node_Id := Component_Clause (C1_Ent);
9430 CC2 : constant Node_Id := Component_Clause (C2_Ent);
9433 if Present (CC1) and then Present (CC2) then
9435 -- Exclude odd case where we have two tag components in the same
9436 -- record, both at location zero. This seems a bit strange, but
9437 -- it seems to happen in some circumstances, perhaps on an error.
9439 if Nam_In (Chars (C1_Ent), Name_uTag, Name_uTag) then
9443 -- Here we check if the two fields overlap
9446 S1 : constant Uint := Component_Bit_Offset (C1_Ent);
9447 S2 : constant Uint := Component_Bit_Offset (C2_Ent);
9448 E1 : constant Uint := S1 + Esize (C1_Ent);
9449 E2 : constant Uint := S2 + Esize (C2_Ent);
9452 if E2 <= S1 or else E1 <= S2 then
9455 Error_Msg_Node_2 := Component_Name (CC2);
9456 Error_Msg_Sloc := Sloc (Error_Msg_Node_2);
9457 Error_Msg_Node_1 := Component_Name (CC1);
9459 ("component& overlaps & #", Component_Name (CC1));
9460 Overlap_Detected := True;
9464 end Check_Component_Overlap;
9466 --------------------
9467 -- Find_Component --
9468 --------------------
9470 procedure Find_Component is
9472 procedure Search_Component (R : Entity_Id);
9473 -- Search components of R for a match. If found, Comp is set
9475 ----------------------
9476 -- Search_Component --
9477 ----------------------
9479 procedure Search_Component (R : Entity_Id) is
9481 Comp := First_Component_Or_Discriminant (R);
9482 while Present (Comp) loop
9484 -- Ignore error of attribute name for component name (we
9485 -- already gave an error message for this, so no need to
9488 if Nkind (Component_Name (CC)) = N_Attribute_Reference then
9491 exit when Chars (Comp) = Chars (Component_Name (CC));
9494 Next_Component_Or_Discriminant (Comp);
9496 end Search_Component;
9498 -- Start of processing for Find_Component
9501 -- Return with Comp set to Empty if we have a pragma
9503 if Nkind (CC) = N_Pragma then
9508 -- Search current record for matching component
9510 Search_Component (Rectype);
9512 -- If not found, maybe component of base type discriminant that is
9513 -- absent from statically constrained first subtype.
9516 Search_Component (Base_Type (Rectype));
9519 -- If no component, or the component does not reference the component
9520 -- clause in question, then there was some previous error for which
9521 -- we already gave a message, so just return with Comp Empty.
9523 if No (Comp) or else Component_Clause (Comp) /= CC then
9524 Check_Error_Detected;
9527 -- Normal case where we have a component clause
9530 Fbit := Component_Bit_Offset (Comp);
9531 Lbit := Fbit + Esize (Comp) - 1;
9535 -- Start of processing for Check_Record_Representation_Clause
9539 Rectype := Entity (Ident);
9541 if Rectype = Any_Type then
9544 Rectype := Underlying_Type (Rectype);
9547 -- See if we have a fully repped derived tagged type
9550 PS : constant Entity_Id := Parent_Subtype (Rectype);
9553 if Present (PS) and then Is_Fully_Repped_Tagged_Type (PS) then
9554 Tagged_Parent := PS;
9556 -- Find maximum bit of any component of the parent type
9558 Parent_Last_Bit := UI_From_Int (System_Address_Size - 1);
9559 Pcomp := First_Entity (Tagged_Parent);
9560 while Present (Pcomp) loop
9561 if Ekind_In (Pcomp, E_Discriminant, E_Component) then
9562 if Component_Bit_Offset (Pcomp) /= No_Uint
9563 and then Known_Static_Esize (Pcomp)
9568 Component_Bit_Offset (Pcomp) + Esize (Pcomp) - 1);
9571 Next_Entity (Pcomp);
9577 -- All done if no component clauses
9579 CC := First (Component_Clauses (N));
9585 -- If a tag is present, then create a component clause that places it
9586 -- at the start of the record (otherwise gigi may place it after other
9587 -- fields that have rep clauses).
9589 Fent := First_Entity (Rectype);
9591 if Nkind (Fent) = N_Defining_Identifier
9592 and then Chars (Fent) = Name_uTag
9594 Set_Component_Bit_Offset (Fent, Uint_0);
9595 Set_Normalized_Position (Fent, Uint_0);
9596 Set_Normalized_First_Bit (Fent, Uint_0);
9597 Set_Normalized_Position_Max (Fent, Uint_0);
9598 Init_Esize (Fent, System_Address_Size);
9600 Set_Component_Clause (Fent,
9601 Make_Component_Clause (Loc,
9602 Component_Name => Make_Identifier (Loc, Name_uTag),
9604 Position => Make_Integer_Literal (Loc, Uint_0),
9605 First_Bit => Make_Integer_Literal (Loc, Uint_0),
9607 Make_Integer_Literal (Loc,
9608 UI_From_Int (System_Address_Size))));
9610 Ccount := Ccount + 1;
9613 Max_Bit_So_Far := Uint_Minus_1;
9614 Overlap_Check_Required := False;
9616 -- Process the component clauses
9618 while Present (CC) loop
9621 if Present (Comp) then
9622 Ccount := Ccount + 1;
9624 -- We need a full overlap check if record positions non-monotonic
9626 if Fbit <= Max_Bit_So_Far then
9627 Overlap_Check_Required := True;
9630 Max_Bit_So_Far := Lbit;
9632 -- Check bit position out of range of specified size
9634 if Has_Size_Clause (Rectype)
9635 and then RM_Size (Rectype) <= Lbit
9638 ("bit number out of range of specified size",
9641 -- Check for overlap with tag component
9644 if Is_Tagged_Type (Rectype)
9645 and then Fbit < System_Address_Size
9648 ("component overlaps tag field of&",
9649 Component_Name (CC), Rectype);
9650 Overlap_Detected := True;
9658 -- Check parent overlap if component might overlap parent field
9660 if Present (Tagged_Parent) and then Fbit <= Parent_Last_Bit then
9661 Pcomp := First_Component_Or_Discriminant (Tagged_Parent);
9662 while Present (Pcomp) loop
9663 if not Is_Tag (Pcomp)
9664 and then Chars (Pcomp) /= Name_uParent
9666 Check_Component_Overlap (Comp, Pcomp);
9669 Next_Component_Or_Discriminant (Pcomp);
9677 -- Now that we have processed all the component clauses, check for
9678 -- overlap. We have to leave this till last, since the components can
9679 -- appear in any arbitrary order in the representation clause.
9681 -- We do not need this check if all specified ranges were monotonic,
9682 -- as recorded by Overlap_Check_Required being False at this stage.
9684 -- This first section checks if there are any overlapping entries at
9685 -- all. It does this by sorting all entries and then seeing if there are
9686 -- any overlaps. If there are none, then that is decisive, but if there
9687 -- are overlaps, they may still be OK (they may result from fields in
9688 -- different variants).
9690 if Overlap_Check_Required then
9691 Overlap_Check1 : declare
9693 OC_Fbit : array (0 .. Ccount) of Uint;
9694 -- First-bit values for component clauses, the value is the offset
9695 -- of the first bit of the field from start of record. The zero
9696 -- entry is for use in sorting.
9698 OC_Lbit : array (0 .. Ccount) of Uint;
9699 -- Last-bit values for component clauses, the value is the offset
9700 -- of the last bit of the field from start of record. The zero
9701 -- entry is for use in sorting.
9703 OC_Count : Natural := 0;
9704 -- Count of entries in OC_Fbit and OC_Lbit
9706 function OC_Lt (Op1, Op2 : Natural) return Boolean;
9707 -- Compare routine for Sort
9709 procedure OC_Move (From : Natural; To : Natural);
9710 -- Move routine for Sort
9712 package Sorting is new GNAT.Heap_Sort_G (OC_Move, OC_Lt);
9718 function OC_Lt (Op1, Op2 : Natural) return Boolean is
9720 return OC_Fbit (Op1) < OC_Fbit (Op2);
9727 procedure OC_Move (From : Natural; To : Natural) is
9729 OC_Fbit (To) := OC_Fbit (From);
9730 OC_Lbit (To) := OC_Lbit (From);
9733 -- Start of processing for Overlap_Check
9736 CC := First (Component_Clauses (N));
9737 while Present (CC) loop
9739 -- Exclude component clause already marked in error
9741 if not Error_Posted (CC) then
9744 if Present (Comp) then
9745 OC_Count := OC_Count + 1;
9746 OC_Fbit (OC_Count) := Fbit;
9747 OC_Lbit (OC_Count) := Lbit;
9754 Sorting.Sort (OC_Count);
9756 Overlap_Check_Required := False;
9757 for J in 1 .. OC_Count - 1 loop
9758 if OC_Lbit (J) >= OC_Fbit (J + 1) then
9759 Overlap_Check_Required := True;
9766 -- If Overlap_Check_Required is still True, then we have to do the full
9767 -- scale overlap check, since we have at least two fields that do
9768 -- overlap, and we need to know if that is OK since they are in
9769 -- different variant, or whether we have a definite problem.
9771 if Overlap_Check_Required then
9772 Overlap_Check2 : declare
9773 C1_Ent, C2_Ent : Entity_Id;
9774 -- Entities of components being checked for overlap
9777 -- Component_List node whose Component_Items are being checked
9780 -- Component declaration for component being checked
9783 C1_Ent := First_Entity (Base_Type (Rectype));
9785 -- Loop through all components in record. For each component check
9786 -- for overlap with any of the preceding elements on the component
9787 -- list containing the component and also, if the component is in
9788 -- a variant, check against components outside the case structure.
9789 -- This latter test is repeated recursively up the variant tree.
9791 Main_Component_Loop : while Present (C1_Ent) loop
9792 if not Ekind_In (C1_Ent, E_Component, E_Discriminant) then
9793 goto Continue_Main_Component_Loop;
9796 -- Skip overlap check if entity has no declaration node. This
9797 -- happens with discriminants in constrained derived types.
9798 -- Possibly we are missing some checks as a result, but that
9799 -- does not seem terribly serious.
9801 if No (Declaration_Node (C1_Ent)) then
9802 goto Continue_Main_Component_Loop;
9805 Clist := Parent (List_Containing (Declaration_Node (C1_Ent)));
9807 -- Loop through component lists that need checking. Check the
9808 -- current component list and all lists in variants above us.
9810 Component_List_Loop : loop
9812 -- If derived type definition, go to full declaration
9813 -- If at outer level, check discriminants if there are any.
9815 if Nkind (Clist) = N_Derived_Type_Definition then
9816 Clist := Parent (Clist);
9819 -- Outer level of record definition, check discriminants
9821 if Nkind_In (Clist, N_Full_Type_Declaration,
9822 N_Private_Type_Declaration)
9824 if Has_Discriminants (Defining_Identifier (Clist)) then
9826 First_Discriminant (Defining_Identifier (Clist));
9827 while Present (C2_Ent) loop
9828 exit when C1_Ent = C2_Ent;
9829 Check_Component_Overlap (C1_Ent, C2_Ent);
9830 Next_Discriminant (C2_Ent);
9834 -- Record extension case
9836 elsif Nkind (Clist) = N_Derived_Type_Definition then
9839 -- Otherwise check one component list
9842 Citem := First (Component_Items (Clist));
9843 while Present (Citem) loop
9844 if Nkind (Citem) = N_Component_Declaration then
9845 C2_Ent := Defining_Identifier (Citem);
9846 exit when C1_Ent = C2_Ent;
9847 Check_Component_Overlap (C1_Ent, C2_Ent);
9854 -- Check for variants above us (the parent of the Clist can
9855 -- be a variant, in which case its parent is a variant part,
9856 -- and the parent of the variant part is a component list
9857 -- whose components must all be checked against the current
9858 -- component for overlap).
9860 if Nkind (Parent (Clist)) = N_Variant then
9861 Clist := Parent (Parent (Parent (Clist)));
9863 -- Check for possible discriminant part in record, this
9864 -- is treated essentially as another level in the
9865 -- recursion. For this case the parent of the component
9866 -- list is the record definition, and its parent is the
9867 -- full type declaration containing the discriminant
9870 elsif Nkind (Parent (Clist)) = N_Record_Definition then
9871 Clist := Parent (Parent ((Clist)));
9873 -- If neither of these two cases, we are at the top of
9877 exit Component_List_Loop;
9879 end loop Component_List_Loop;
9881 <<Continue_Main_Component_Loop>>
9882 Next_Entity (C1_Ent);
9884 end loop Main_Component_Loop;
9888 -- The following circuit deals with warning on record holes (gaps). We
9889 -- skip this check if overlap was detected, since it makes sense for the
9890 -- programmer to fix this illegality before worrying about warnings.
9892 if not Overlap_Detected and Warn_On_Record_Holes then
9893 Record_Hole_Check : declare
9894 Decl : constant Node_Id := Declaration_Node (Base_Type (Rectype));
9895 -- Full declaration of record type
9897 procedure Check_Component_List
9901 -- Check component list CL for holes. The starting bit should be
9902 -- Sbit. which is zero for the main record component list and set
9903 -- appropriately for recursive calls for variants. DS is set to
9904 -- a list of discriminant specifications to be included in the
9905 -- consideration of components. It is No_List if none to consider.
9907 --------------------------
9908 -- Check_Component_List --
9909 --------------------------
9911 procedure Check_Component_List
9919 Compl := Integer (List_Length (Component_Items (CL)));
9921 if DS /= No_List then
9922 Compl := Compl + Integer (List_Length (DS));
9926 Comps : array (Natural range 0 .. Compl) of Entity_Id;
9927 -- Gather components (zero entry is for sort routine)
9929 Ncomps : Natural := 0;
9930 -- Number of entries stored in Comps (starting at Comps (1))
9933 -- One component item or discriminant specification
9936 -- Starting bit for next component
9944 function Lt (Op1, Op2 : Natural) return Boolean;
9945 -- Compare routine for Sort
9947 procedure Move (From : Natural; To : Natural);
9948 -- Move routine for Sort
9950 package Sorting is new GNAT.Heap_Sort_G (Move, Lt);
9956 function Lt (Op1, Op2 : Natural) return Boolean is
9958 return Component_Bit_Offset (Comps (Op1))
9960 Component_Bit_Offset (Comps (Op2));
9967 procedure Move (From : Natural; To : Natural) is
9969 Comps (To) := Comps (From);
9973 -- Gather discriminants into Comp
9975 if DS /= No_List then
9976 Citem := First (DS);
9977 while Present (Citem) loop
9978 if Nkind (Citem) = N_Discriminant_Specification then
9980 Ent : constant Entity_Id :=
9981 Defining_Identifier (Citem);
9983 if Ekind (Ent) = E_Discriminant then
9984 Ncomps := Ncomps + 1;
9985 Comps (Ncomps) := Ent;
9994 -- Gather component entities into Comp
9996 Citem := First (Component_Items (CL));
9997 while Present (Citem) loop
9998 if Nkind (Citem) = N_Component_Declaration then
9999 Ncomps := Ncomps + 1;
10000 Comps (Ncomps) := Defining_Identifier (Citem);
10006 -- Now sort the component entities based on the first bit.
10007 -- Note we already know there are no overlapping components.
10009 Sorting.Sort (Ncomps);
10011 -- Loop through entries checking for holes
10014 for J in 1 .. Ncomps loop
10016 Error_Msg_Uint_1 := Component_Bit_Offset (CEnt) - Nbit;
10018 if Error_Msg_Uint_1 > 0 then
10020 ("?H?^-bit gap before component&",
10021 Component_Name (Component_Clause (CEnt)), CEnt);
10024 Nbit := Component_Bit_Offset (CEnt) + Esize (CEnt);
10027 -- Process variant parts recursively if present
10029 if Present (Variant_Part (CL)) then
10030 Variant := First (Variants (Variant_Part (CL)));
10031 while Present (Variant) loop
10032 Check_Component_List
10033 (Component_List (Variant), Nbit, No_List);
10038 end Check_Component_List;
10040 -- Start of processing for Record_Hole_Check
10047 if Is_Tagged_Type (Rectype) then
10048 Sbit := UI_From_Int (System_Address_Size);
10053 if Nkind (Decl) = N_Full_Type_Declaration
10054 and then Nkind (Type_Definition (Decl)) = N_Record_Definition
10056 Check_Component_List
10057 (Component_List (Type_Definition (Decl)),
10059 Discriminant_Specifications (Decl));
10062 end Record_Hole_Check;
10065 -- For records that have component clauses for all components, and whose
10066 -- size is less than or equal to 32, we need to know the size in the
10067 -- front end to activate possible packed array processing where the
10068 -- component type is a record.
10070 -- At this stage Hbit + 1 represents the first unused bit from all the
10071 -- component clauses processed, so if the component clauses are
10072 -- complete, then this is the length of the record.
10074 -- For records longer than System.Storage_Unit, and for those where not
10075 -- all components have component clauses, the back end determines the
10076 -- length (it may for example be appropriate to round up the size
10077 -- to some convenient boundary, based on alignment considerations, etc).
10079 if Unknown_RM_Size (Rectype) and then Hbit + 1 <= 32 then
10081 -- Nothing to do if at least one component has no component clause
10083 Comp := First_Component_Or_Discriminant (Rectype);
10084 while Present (Comp) loop
10085 exit when No (Component_Clause (Comp));
10086 Next_Component_Or_Discriminant (Comp);
10089 -- If we fall out of loop, all components have component clauses
10090 -- and so we can set the size to the maximum value.
10093 Set_RM_Size (Rectype, Hbit + 1);
10096 end Check_Record_Representation_Clause;
10102 procedure Check_Size
10106 Biased : out Boolean)
10108 UT : constant Entity_Id := Underlying_Type (T);
10114 -- Reject patently improper size values.
10116 if Is_Elementary_Type (T)
10117 and then Siz > UI_From_Int (Int'Last)
10119 Error_Msg_N ("Size value too large for elementary type", N);
10121 if Nkind (Original_Node (N)) = N_Op_Expon then
10123 ("\maybe '* was meant, rather than '*'*", Original_Node (N));
10127 -- Dismiss generic types
10129 if Is_Generic_Type (T)
10131 Is_Generic_Type (UT)
10133 Is_Generic_Type (Root_Type (UT))
10137 -- Guard against previous errors
10139 elsif No (UT) or else UT = Any_Type then
10140 Check_Error_Detected;
10143 -- Check case of bit packed array
10145 elsif Is_Array_Type (UT)
10146 and then Known_Static_Component_Size (UT)
10147 and then Is_Bit_Packed_Array (UT)
10155 Asiz := Component_Size (UT);
10156 Indx := First_Index (UT);
10158 Ityp := Etype (Indx);
10160 -- If non-static bound, then we are not in the business of
10161 -- trying to check the length, and indeed an error will be
10162 -- issued elsewhere, since sizes of non-static array types
10163 -- cannot be set implicitly or explicitly.
10165 if not Is_OK_Static_Subtype (Ityp) then
10169 -- Otherwise accumulate next dimension
10171 Asiz := Asiz * (Expr_Value (Type_High_Bound (Ityp)) -
10172 Expr_Value (Type_Low_Bound (Ityp)) +
10176 exit when No (Indx);
10179 if Asiz <= Siz then
10183 Error_Msg_Uint_1 := Asiz;
10185 ("size for& too small, minimum allowed is ^", N, T);
10186 Set_Esize (T, Asiz);
10187 Set_RM_Size (T, Asiz);
10191 -- All other composite types are ignored
10193 elsif Is_Composite_Type (UT) then
10196 -- For fixed-point types, don't check minimum if type is not frozen,
10197 -- since we don't know all the characteristics of the type that can
10198 -- affect the size (e.g. a specified small) till freeze time.
10200 elsif Is_Fixed_Point_Type (UT)
10201 and then not Is_Frozen (UT)
10205 -- Cases for which a minimum check is required
10208 -- Ignore if specified size is correct for the type
10210 if Known_Esize (UT) and then Siz = Esize (UT) then
10214 -- Otherwise get minimum size
10216 M := UI_From_Int (Minimum_Size (UT));
10220 -- Size is less than minimum size, but one possibility remains
10221 -- that we can manage with the new size if we bias the type.
10223 M := UI_From_Int (Minimum_Size (UT, Biased => True));
10226 Error_Msg_Uint_1 := M;
10228 ("size for& too small, minimum allowed is ^", N, T);
10230 Set_RM_Size (T, M);
10238 --------------------------
10239 -- Freeze_Entity_Checks --
10240 --------------------------
10242 procedure Freeze_Entity_Checks (N : Node_Id) is
10243 procedure Hide_Non_Overridden_Subprograms (Typ : Entity_Id);
10244 -- Inspect the primitive operations of type Typ and hide all pairs of
10245 -- implicitly declared non-overridden non-fully conformant homographs
10246 -- (Ada RM 8.3 12.3/2).
10248 -------------------------------------
10249 -- Hide_Non_Overridden_Subprograms --
10250 -------------------------------------
10252 procedure Hide_Non_Overridden_Subprograms (Typ : Entity_Id) is
10253 procedure Hide_Matching_Homographs
10254 (Subp_Id : Entity_Id;
10255 Start_Elmt : Elmt_Id);
10256 -- Inspect a list of primitive operations starting with Start_Elmt
10257 -- and find matching implicitly declared non-overridden non-fully
10258 -- conformant homographs of Subp_Id. If found, all matches along
10259 -- with Subp_Id are hidden from all visibility.
10261 function Is_Non_Overridden_Or_Null_Procedure
10262 (Subp_Id : Entity_Id) return Boolean;
10263 -- Determine whether subprogram Subp_Id is implicitly declared non-
10264 -- overridden subprogram or an implicitly declared null procedure.
10266 ------------------------------
10267 -- Hide_Matching_Homographs --
10268 ------------------------------
10270 procedure Hide_Matching_Homographs
10271 (Subp_Id : Entity_Id;
10272 Start_Elmt : Elmt_Id)
10275 Prim_Elmt : Elmt_Id;
10278 Prim_Elmt := Start_Elmt;
10279 while Present (Prim_Elmt) loop
10280 Prim := Node (Prim_Elmt);
10282 -- The current primitive is implicitly declared non-overridden
10283 -- non-fully conformant homograph of Subp_Id. Both subprograms
10284 -- must be hidden from visibility.
10286 if Chars (Prim) = Chars (Subp_Id)
10287 and then Is_Non_Overridden_Or_Null_Procedure (Prim)
10288 and then not Fully_Conformant (Prim, Subp_Id)
10290 Set_Is_Hidden_Non_Overridden_Subpgm (Prim);
10291 Set_Is_Immediately_Visible (Prim, False);
10292 Set_Is_Potentially_Use_Visible (Prim, False);
10294 Set_Is_Hidden_Non_Overridden_Subpgm (Subp_Id);
10295 Set_Is_Immediately_Visible (Subp_Id, False);
10296 Set_Is_Potentially_Use_Visible (Subp_Id, False);
10299 Next_Elmt (Prim_Elmt);
10301 end Hide_Matching_Homographs;
10303 -----------------------------------------
10304 -- Is_Non_Overridden_Or_Null_Procedure --
10305 -----------------------------------------
10307 function Is_Non_Overridden_Or_Null_Procedure
10308 (Subp_Id : Entity_Id) return Boolean
10310 Alias_Id : Entity_Id;
10313 -- The subprogram is inherited (implicitly declared), it does not
10314 -- override and does not cover a primitive of an interface.
10316 if Ekind_In (Subp_Id, E_Function, E_Procedure)
10317 and then Present (Alias (Subp_Id))
10318 and then No (Interface_Alias (Subp_Id))
10319 and then No (Overridden_Operation (Subp_Id))
10321 Alias_Id := Alias (Subp_Id);
10323 if Requires_Overriding (Alias_Id) then
10326 elsif Nkind (Parent (Alias_Id)) = N_Procedure_Specification
10327 and then Null_Present (Parent (Alias_Id))
10334 end Is_Non_Overridden_Or_Null_Procedure;
10338 Prim_Ops : constant Elist_Id := Direct_Primitive_Operations (Typ);
10340 Prim_Elmt : Elmt_Id;
10342 -- Start of processing for Hide_Non_Overridden_Subprograms
10345 -- Inspect the list of primitives looking for non-overridden
10348 if Present (Prim_Ops) then
10349 Prim_Elmt := First_Elmt (Prim_Ops);
10350 while Present (Prim_Elmt) loop
10351 Prim := Node (Prim_Elmt);
10352 Next_Elmt (Prim_Elmt);
10354 if Is_Non_Overridden_Or_Null_Procedure (Prim) then
10355 Hide_Matching_Homographs
10357 Start_Elmt => Prim_Elmt);
10361 end Hide_Non_Overridden_Subprograms;
10363 ---------------------
10364 -- Local variables --
10365 ---------------------
10367 E : constant Entity_Id := Entity (N);
10369 Non_Generic_Case : constant Boolean := Nkind (N) = N_Freeze_Entity;
10370 -- True in non-generic case. Some of the processing here is skipped
10371 -- for the generic case since it is not needed. Basically in the
10372 -- generic case, we only need to do stuff that might generate error
10373 -- messages or warnings.
10375 -- Start of processing for Freeze_Entity_Checks
10378 -- Remember that we are processing a freezing entity. Required to
10379 -- ensure correct decoration of internal entities associated with
10380 -- interfaces (see New_Overloaded_Entity).
10382 Inside_Freezing_Actions := Inside_Freezing_Actions + 1;
10384 -- For tagged types covering interfaces add internal entities that link
10385 -- the primitives of the interfaces with the primitives that cover them.
10386 -- Note: These entities were originally generated only when generating
10387 -- code because their main purpose was to provide support to initialize
10388 -- the secondary dispatch tables. They are now generated also when
10389 -- compiling with no code generation to provide ASIS the relationship
10390 -- between interface primitives and tagged type primitives. They are
10391 -- also used to locate primitives covering interfaces when processing
10392 -- generics (see Derive_Subprograms).
10394 -- This is not needed in the generic case
10396 if Ada_Version >= Ada_2005
10397 and then Non_Generic_Case
10398 and then Ekind (E) = E_Record_Type
10399 and then Is_Tagged_Type (E)
10400 and then not Is_Interface (E)
10401 and then Has_Interfaces (E)
10403 -- This would be a good common place to call the routine that checks
10404 -- overriding of interface primitives (and thus factorize calls to
10405 -- Check_Abstract_Overriding located at different contexts in the
10406 -- compiler). However, this is not possible because it causes
10407 -- spurious errors in case of late overriding.
10409 Add_Internal_Interface_Entities (E);
10412 -- After all forms of overriding have been resolved, a tagged type may
10413 -- be left with a set of implicitly declared and possibly erroneous
10414 -- abstract subprograms, null procedures and subprograms that require
10415 -- overriding. If this set contains fully conformat homographs, then one
10416 -- is chosen arbitrarily (already done during resolution), otherwise all
10417 -- remaining non-fully conformant homographs are hidden from visibility
10418 -- (Ada RM 8.3 12.3/2).
10420 if Is_Tagged_Type (E) then
10421 Hide_Non_Overridden_Subprograms (E);
10426 if Ekind (E) = E_Record_Type
10427 and then Is_CPP_Class (E)
10428 and then Is_Tagged_Type (E)
10429 and then Tagged_Type_Expansion
10431 if CPP_Num_Prims (E) = 0 then
10433 -- If the CPP type has user defined components then it must import
10434 -- primitives from C++. This is required because if the C++ class
10435 -- has no primitives then the C++ compiler does not added the _tag
10436 -- component to the type.
10438 if First_Entity (E) /= Last_Entity (E) then
10440 ("'C'P'P type must import at least one primitive from C++??",
10445 -- Check that all its primitives are abstract or imported from C++.
10446 -- Check also availability of the C++ constructor.
10449 Has_Constructors : constant Boolean := Has_CPP_Constructors (E);
10451 Error_Reported : Boolean := False;
10455 Elmt := First_Elmt (Primitive_Operations (E));
10456 while Present (Elmt) loop
10457 Prim := Node (Elmt);
10459 if Comes_From_Source (Prim) then
10460 if Is_Abstract_Subprogram (Prim) then
10463 elsif not Is_Imported (Prim)
10464 or else Convention (Prim) /= Convention_CPP
10467 ("primitives of 'C'P'P types must be imported from C++ "
10468 & "or abstract??", Prim);
10470 elsif not Has_Constructors
10471 and then not Error_Reported
10473 Error_Msg_Name_1 := Chars (E);
10475 ("??'C'P'P constructor required for type %", Prim);
10476 Error_Reported := True;
10485 -- Check Ada derivation of CPP type
10487 if Expander_Active -- why? losing errors in -gnatc mode???
10488 and then Present (Etype (E)) -- defend against errors
10489 and then Tagged_Type_Expansion
10490 and then Ekind (E) = E_Record_Type
10491 and then Etype (E) /= E
10492 and then Is_CPP_Class (Etype (E))
10493 and then CPP_Num_Prims (Etype (E)) > 0
10494 and then not Is_CPP_Class (E)
10495 and then not Has_CPP_Constructors (Etype (E))
10497 -- If the parent has C++ primitives but it has no constructor then
10498 -- check that all the primitives are overridden in this derivation;
10499 -- otherwise the constructor of the parent is needed to build the
10507 Elmt := First_Elmt (Primitive_Operations (E));
10508 while Present (Elmt) loop
10509 Prim := Node (Elmt);
10511 if not Is_Abstract_Subprogram (Prim)
10512 and then No (Interface_Alias (Prim))
10513 and then Find_Dispatching_Type (Ultimate_Alias (Prim)) /= E
10515 Error_Msg_Name_1 := Chars (Etype (E));
10517 ("'C'P'P constructor required for parent type %", E);
10526 Inside_Freezing_Actions := Inside_Freezing_Actions - 1;
10528 -- If we have a type with predicates, build predicate function. This
10529 -- is not needed in the generic case, and is not needed within TSS
10530 -- subprograms and other predefined primitives.
10532 if Non_Generic_Case
10533 and then Is_Type (E)
10534 and then Has_Predicates (E)
10535 and then not Within_Internal_Subprogram
10537 Build_Predicate_Functions (E, N);
10540 -- If type has delayed aspects, this is where we do the preanalysis at
10541 -- the freeze point, as part of the consistent visibility check. Note
10542 -- that this must be done after calling Build_Predicate_Functions or
10543 -- Build_Invariant_Procedure since these subprograms fix occurrences of
10544 -- the subtype name in the saved expression so that they will not cause
10545 -- trouble in the preanalysis.
10547 -- This is also not needed in the generic case
10549 if Non_Generic_Case
10550 and then Has_Delayed_Aspects (E)
10551 and then Scope (E) = Current_Scope
10553 -- Retrieve the visibility to the discriminants in order to properly
10554 -- analyze the aspects.
10556 Push_Scope_And_Install_Discriminants (E);
10562 -- Look for aspect specification entries for this entity
10564 Ritem := First_Rep_Item (E);
10565 while Present (Ritem) loop
10566 if Nkind (Ritem) = N_Aspect_Specification
10567 and then Entity (Ritem) = E
10568 and then Is_Delayed_Aspect (Ritem)
10570 Check_Aspect_At_Freeze_Point (Ritem);
10573 Next_Rep_Item (Ritem);
10577 Uninstall_Discriminants_And_Pop_Scope (E);
10580 -- For a record type, deal with variant parts. This has to be delayed
10581 -- to this point, because of the issue of statically predicated
10582 -- subtypes, which we have to ensure are frozen before checking
10583 -- choices, since we need to have the static choice list set.
10585 if Is_Record_Type (E) then
10586 Check_Variant_Part : declare
10587 D : constant Node_Id := Declaration_Node (E);
10592 Others_Present : Boolean;
10593 pragma Warnings (Off, Others_Present);
10594 -- Indicates others present, not used in this case
10596 procedure Non_Static_Choice_Error (Choice : Node_Id);
10597 -- Error routine invoked by the generic instantiation below when
10598 -- the variant part has a non static choice.
10600 procedure Process_Declarations (Variant : Node_Id);
10601 -- Processes declarations associated with a variant. We analyzed
10602 -- the declarations earlier (in Sem_Ch3.Analyze_Variant_Part),
10603 -- but we still need the recursive call to Check_Choices for any
10604 -- nested variant to get its choices properly processed. This is
10605 -- also where we expand out the choices if expansion is active.
10607 package Variant_Choices_Processing is new
10608 Generic_Check_Choices
10609 (Process_Empty_Choice => No_OP,
10610 Process_Non_Static_Choice => Non_Static_Choice_Error,
10611 Process_Associated_Node => Process_Declarations);
10612 use Variant_Choices_Processing;
10614 -----------------------------
10615 -- Non_Static_Choice_Error --
10616 -----------------------------
10618 procedure Non_Static_Choice_Error (Choice : Node_Id) is
10620 Flag_Non_Static_Expr
10621 ("choice given in variant part is not static!", Choice);
10622 end Non_Static_Choice_Error;
10624 --------------------------
10625 -- Process_Declarations --
10626 --------------------------
10628 procedure Process_Declarations (Variant : Node_Id) is
10629 CL : constant Node_Id := Component_List (Variant);
10633 -- Check for static predicate present in this variant
10635 if Has_SP_Choice (Variant) then
10637 -- Here we expand. You might expect to find this call in
10638 -- Expand_N_Variant_Part, but that is called when we first
10639 -- see the variant part, and we cannot do this expansion
10640 -- earlier than the freeze point, since for statically
10641 -- predicated subtypes, the predicate is not known till
10642 -- the freeze point.
10644 -- Furthermore, we do this expansion even if the expander
10645 -- is not active, because other semantic processing, e.g.
10646 -- for aggregates, requires the expanded list of choices.
10648 -- If the expander is not active, then we can't just clobber
10649 -- the list since it would invalidate the ASIS -gnatct tree.
10650 -- So we have to rewrite the variant part with a Rewrite
10651 -- call that replaces it with a copy and clobber the copy.
10653 if not Expander_Active then
10655 NewV : constant Node_Id := New_Copy (Variant);
10657 Set_Discrete_Choices
10658 (NewV, New_Copy_List (Discrete_Choices (Variant)));
10659 Rewrite (Variant, NewV);
10663 Expand_Static_Predicates_In_Choices (Variant);
10666 -- We don't need to worry about the declarations in the variant
10667 -- (since they were analyzed by Analyze_Choices when we first
10668 -- encountered the variant), but we do need to take care of
10669 -- expansion of any nested variants.
10671 if not Null_Present (CL) then
10672 VP := Variant_Part (CL);
10674 if Present (VP) then
10676 (VP, Variants (VP), Etype (Name (VP)), Others_Present);
10679 end Process_Declarations;
10681 -- Start of processing for Check_Variant_Part
10684 -- Find component list
10688 if Nkind (D) = N_Full_Type_Declaration then
10689 T := Type_Definition (D);
10691 if Nkind (T) = N_Record_Definition then
10692 C := Component_List (T);
10694 elsif Nkind (T) = N_Derived_Type_Definition
10695 and then Present (Record_Extension_Part (T))
10697 C := Component_List (Record_Extension_Part (T));
10701 -- Case of variant part present
10703 if Present (C) and then Present (Variant_Part (C)) then
10704 VP := Variant_Part (C);
10709 (VP, Variants (VP), Etype (Name (VP)), Others_Present);
10711 -- If the last variant does not contain the Others choice,
10712 -- replace it with an N_Others_Choice node since Gigi always
10713 -- wants an Others. Note that we do not bother to call Analyze
10714 -- on the modified variant part, since its only effect would be
10715 -- to compute the Others_Discrete_Choices node laboriously, and
10716 -- of course we already know the list of choices corresponding
10717 -- to the others choice (it's the list we're replacing).
10719 -- We only want to do this if the expander is active, since
10720 -- we do not want to clobber the ASIS tree.
10722 if Expander_Active then
10724 Last_Var : constant Node_Id :=
10725 Last_Non_Pragma (Variants (VP));
10727 Others_Node : Node_Id;
10730 if Nkind (First (Discrete_Choices (Last_Var))) /=
10733 Others_Node := Make_Others_Choice (Sloc (Last_Var));
10734 Set_Others_Discrete_Choices
10735 (Others_Node, Discrete_Choices (Last_Var));
10736 Set_Discrete_Choices
10737 (Last_Var, New_List (Others_Node));
10742 end Check_Variant_Part;
10744 end Freeze_Entity_Checks;
10746 -------------------------
10747 -- Get_Alignment_Value --
10748 -------------------------
10750 function Get_Alignment_Value (Expr : Node_Id) return Uint is
10751 Align : constant Uint := Static_Integer (Expr);
10754 if Align = No_Uint then
10757 elsif Align <= 0 then
10758 Error_Msg_N ("alignment value must be positive", Expr);
10762 for J in Int range 0 .. 64 loop
10764 M : constant Uint := Uint_2 ** J;
10767 exit when M = Align;
10771 ("alignment value must be power of 2", Expr);
10779 end Get_Alignment_Value;
10781 -------------------------------------
10782 -- Inherit_Aspects_At_Freeze_Point --
10783 -------------------------------------
10785 procedure Inherit_Aspects_At_Freeze_Point (Typ : Entity_Id) is
10786 function Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
10787 (Rep_Item : Node_Id) return Boolean;
10788 -- This routine checks if Rep_Item is either a pragma or an aspect
10789 -- specification node whose correponding pragma (if any) is present in
10790 -- the Rep Item chain of the entity it has been specified to.
10792 --------------------------------------------------
10793 -- Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item --
10794 --------------------------------------------------
10796 function Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
10797 (Rep_Item : Node_Id) return Boolean
10801 Nkind (Rep_Item) = N_Pragma
10802 or else Present_In_Rep_Item
10803 (Entity (Rep_Item), Aspect_Rep_Item (Rep_Item));
10804 end Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item;
10806 -- Start of processing for Inherit_Aspects_At_Freeze_Point
10809 -- A representation item is either subtype-specific (Size and Alignment
10810 -- clauses) or type-related (all others). Subtype-specific aspects may
10811 -- differ for different subtypes of the same type (RM 13.1.8).
10813 -- A derived type inherits each type-related representation aspect of
10814 -- its parent type that was directly specified before the declaration of
10815 -- the derived type (RM 13.1.15).
10817 -- A derived subtype inherits each subtype-specific representation
10818 -- aspect of its parent subtype that was directly specified before the
10819 -- declaration of the derived type (RM 13.1.15).
10821 -- The general processing involves inheriting a representation aspect
10822 -- from a parent type whenever the first rep item (aspect specification,
10823 -- attribute definition clause, pragma) corresponding to the given
10824 -- representation aspect in the rep item chain of Typ, if any, isn't
10825 -- directly specified to Typ but to one of its parents.
10827 -- ??? Note that, for now, just a limited number of representation
10828 -- aspects have been inherited here so far. Many of them are
10829 -- still inherited in Sem_Ch3. This will be fixed soon. Here is
10830 -- a non- exhaustive list of aspects that likely also need to
10831 -- be moved to this routine: Alignment, Component_Alignment,
10832 -- Component_Size, Machine_Radix, Object_Size, Pack, Predicates,
10833 -- Preelaborable_Initialization, RM_Size and Small.
10835 -- In addition, Convention must be propagated from base type to subtype,
10836 -- because the subtype may have been declared on an incomplete view.
10838 if Nkind (Parent (Typ)) = N_Private_Extension_Declaration then
10844 if not Has_Rep_Item (Typ, Name_Ada_05, Name_Ada_2005, False)
10845 and then Has_Rep_Item (Typ, Name_Ada_05, Name_Ada_2005)
10846 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
10847 (Get_Rep_Item (Typ, Name_Ada_05, Name_Ada_2005))
10849 Set_Is_Ada_2005_Only (Typ);
10854 if not Has_Rep_Item (Typ, Name_Ada_12, Name_Ada_2012, False)
10855 and then Has_Rep_Item (Typ, Name_Ada_12, Name_Ada_2012)
10856 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
10857 (Get_Rep_Item (Typ, Name_Ada_12, Name_Ada_2012))
10859 Set_Is_Ada_2012_Only (Typ);
10864 if not Has_Rep_Item (Typ, Name_Atomic, Name_Shared, False)
10865 and then Has_Rep_Pragma (Typ, Name_Atomic, Name_Shared)
10866 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
10867 (Get_Rep_Item (Typ, Name_Atomic, Name_Shared))
10869 Set_Is_Atomic (Typ);
10870 Set_Treat_As_Volatile (Typ);
10871 Set_Is_Volatile (Typ);
10876 if Is_Record_Type (Typ)
10877 and then Typ /= Base_Type (Typ) and then Is_Frozen (Base_Type (Typ))
10879 Set_Convention (Typ, Convention (Base_Type (Typ)));
10882 -- Default_Component_Value
10884 if Is_Array_Type (Typ)
10885 and then Is_Base_Type (Typ)
10886 and then Has_Rep_Item (Typ, Name_Default_Component_Value, False)
10887 and then Has_Rep_Item (Typ, Name_Default_Component_Value)
10889 Set_Default_Aspect_Component_Value (Typ,
10890 Default_Aspect_Component_Value
10891 (Entity (Get_Rep_Item (Typ, Name_Default_Component_Value))));
10896 if Is_Scalar_Type (Typ)
10897 and then Is_Base_Type (Typ)
10898 and then Has_Rep_Item (Typ, Name_Default_Value, False)
10899 and then Has_Rep_Item (Typ, Name_Default_Value)
10901 Set_Default_Aspect_Value (Typ,
10902 Default_Aspect_Value
10903 (Entity (Get_Rep_Item (Typ, Name_Default_Value))));
10908 if not Has_Rep_Item (Typ, Name_Discard_Names, False)
10909 and then Has_Rep_Item (Typ, Name_Discard_Names)
10910 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
10911 (Get_Rep_Item (Typ, Name_Discard_Names))
10913 Set_Discard_Names (Typ);
10918 if not Has_Rep_Item (Typ, Name_Invariant, False)
10919 and then Has_Rep_Item (Typ, Name_Invariant)
10920 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
10921 (Get_Rep_Item (Typ, Name_Invariant))
10923 Set_Has_Invariants (Typ);
10925 if Class_Present (Get_Rep_Item (Typ, Name_Invariant)) then
10926 Set_Has_Inheritable_Invariants (Typ);
10929 -- If we have a subtype with invariants, whose base type does not have
10930 -- invariants, copy these invariants to the base type. This happens for
10931 -- the case of implicit base types created for scalar and array types.
10933 elsif Has_Invariants (Typ)
10934 and then not Has_Invariants (Base_Type (Typ))
10936 Set_Has_Invariants (Base_Type (Typ));
10937 Set_Invariant_Procedure (Base_Type (Typ), Invariant_Procedure (Typ));
10942 if not Has_Rep_Item (Typ, Name_Volatile, False)
10943 and then Has_Rep_Item (Typ, Name_Volatile)
10944 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
10945 (Get_Rep_Item (Typ, Name_Volatile))
10947 Set_Treat_As_Volatile (Typ);
10948 Set_Is_Volatile (Typ);
10951 -- Inheritance for derived types only
10953 if Is_Derived_Type (Typ) then
10955 Bas_Typ : constant Entity_Id := Base_Type (Typ);
10956 Imp_Bas_Typ : constant Entity_Id := Implementation_Base_Type (Typ);
10959 -- Atomic_Components
10961 if not Has_Rep_Item (Typ, Name_Atomic_Components, False)
10962 and then Has_Rep_Item (Typ, Name_Atomic_Components)
10963 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
10964 (Get_Rep_Item (Typ, Name_Atomic_Components))
10966 Set_Has_Atomic_Components (Imp_Bas_Typ);
10969 -- Volatile_Components
10971 if not Has_Rep_Item (Typ, Name_Volatile_Components, False)
10972 and then Has_Rep_Item (Typ, Name_Volatile_Components)
10973 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
10974 (Get_Rep_Item (Typ, Name_Volatile_Components))
10976 Set_Has_Volatile_Components (Imp_Bas_Typ);
10979 -- Finalize_Storage_Only
10981 if not Has_Rep_Pragma (Typ, Name_Finalize_Storage_Only, False)
10982 and then Has_Rep_Pragma (Typ, Name_Finalize_Storage_Only)
10984 Set_Finalize_Storage_Only (Bas_Typ);
10987 -- Universal_Aliasing
10989 if not Has_Rep_Item (Typ, Name_Universal_Aliasing, False)
10990 and then Has_Rep_Item (Typ, Name_Universal_Aliasing)
10991 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
10992 (Get_Rep_Item (Typ, Name_Universal_Aliasing))
10994 Set_Universal_Aliasing (Imp_Bas_Typ);
10999 if Is_Record_Type (Typ) then
11000 if not Has_Rep_Item (Typ, Name_Bit_Order, False)
11001 and then Has_Rep_Item (Typ, Name_Bit_Order)
11003 Set_Reverse_Bit_Order (Bas_Typ,
11004 Reverse_Bit_Order (Entity (Name
11005 (Get_Rep_Item (Typ, Name_Bit_Order)))));
11009 -- Scalar_Storage_Order
11011 -- Note: the aspect is specified on a first subtype, but recorded
11012 -- in a flag of the base type!
11014 if (Is_Record_Type (Typ) or else Is_Array_Type (Typ))
11015 and then Typ = Bas_Typ
11017 -- For a type extension, always inherit from parent; otherwise
11018 -- inherit if no default applies. Note: we do not check for
11019 -- an explicit rep item on the parent type when inheriting,
11020 -- because the parent SSO may itself have been set by default.
11022 if not Has_Rep_Item (First_Subtype (Typ),
11023 Name_Scalar_Storage_Order, False)
11024 and then (Is_Tagged_Type (Bas_Typ)
11025 or else not (SSO_Set_Low_By_Default (Bas_Typ)
11027 SSO_Set_High_By_Default (Bas_Typ)))
11029 Set_Reverse_Storage_Order (Bas_Typ,
11030 Reverse_Storage_Order
11031 (Implementation_Base_Type (Etype (Bas_Typ))));
11033 -- Clear default SSO indications, since the inherited aspect
11034 -- which was set explicitly overrides the default.
11036 Set_SSO_Set_Low_By_Default (Bas_Typ, False);
11037 Set_SSO_Set_High_By_Default (Bas_Typ, False);
11042 end Inherit_Aspects_At_Freeze_Point;
11048 procedure Initialize is
11050 Address_Clause_Checks.Init;
11051 Independence_Checks.Init;
11052 Unchecked_Conversions.Init;
11055 ---------------------------
11056 -- Install_Discriminants --
11057 ---------------------------
11059 procedure Install_Discriminants (E : Entity_Id) is
11063 Disc := First_Discriminant (E);
11064 while Present (Disc) loop
11065 Prev := Current_Entity (Disc);
11066 Set_Current_Entity (Disc);
11067 Set_Is_Immediately_Visible (Disc);
11068 Set_Homonym (Disc, Prev);
11069 Next_Discriminant (Disc);
11071 end Install_Discriminants;
11073 -------------------------
11074 -- Is_Operational_Item --
11075 -------------------------
11077 function Is_Operational_Item (N : Node_Id) return Boolean is
11079 if Nkind (N) /= N_Attribute_Definition_Clause then
11084 Id : constant Attribute_Id := Get_Attribute_Id (Chars (N));
11086 return Id = Attribute_Input
11087 or else Id = Attribute_Output
11088 or else Id = Attribute_Read
11089 or else Id = Attribute_Write
11090 or else Id = Attribute_External_Tag;
11093 end Is_Operational_Item;
11095 -------------------------
11096 -- Is_Predicate_Static --
11097 -------------------------
11099 -- Note: the basic legality of the expression has already been checked, so
11100 -- we don't need to worry about cases or ranges on strings for example.
11102 function Is_Predicate_Static
11104 Nam : Name_Id) return Boolean
11106 function All_Static_Case_Alternatives (L : List_Id) return Boolean;
11107 -- Given a list of case expression alternatives, returns True if all
11108 -- the alternatives are static (have all static choices, and a static
11111 function All_Static_Choices (L : List_Id) return Boolean;
11112 -- Returns true if all elements of the list are OK static choices
11113 -- as defined below for Is_Static_Choice. Used for case expression
11114 -- alternatives and for the right operand of a membership test. An
11115 -- others_choice is static if the corresponding expression is static.
11116 -- The staticness of the bounds is checked separately.
11118 function Is_Static_Choice (N : Node_Id) return Boolean;
11119 -- Returns True if N represents a static choice (static subtype, or
11120 -- static subtype indication, or static expression, or static range).
11122 -- Note that this is a bit more inclusive than we actually need
11123 -- (in particular membership tests do not allow the use of subtype
11124 -- indications). But that doesn't matter, we have already checked
11125 -- that the construct is legal to get this far.
11127 function Is_Type_Ref (N : Node_Id) return Boolean;
11128 pragma Inline (Is_Type_Ref);
11129 -- Returns True if N is a reference to the type for the predicate in the
11130 -- expression (i.e. if it is an identifier whose Chars field matches the
11131 -- Nam given in the call). N must not be parenthesized, if the type name
11132 -- appears in parens, this routine will return False.
11134 ----------------------------------
11135 -- All_Static_Case_Alternatives --
11136 ----------------------------------
11138 function All_Static_Case_Alternatives (L : List_Id) return Boolean is
11143 while Present (N) loop
11144 if not (All_Static_Choices (Discrete_Choices (N))
11145 and then Is_OK_Static_Expression (Expression (N)))
11154 end All_Static_Case_Alternatives;
11156 ------------------------
11157 -- All_Static_Choices --
11158 ------------------------
11160 function All_Static_Choices (L : List_Id) return Boolean is
11165 while Present (N) loop
11166 if not Is_Static_Choice (N) then
11174 end All_Static_Choices;
11176 ----------------------
11177 -- Is_Static_Choice --
11178 ----------------------
11180 function Is_Static_Choice (N : Node_Id) return Boolean is
11182 return Nkind (N) = N_Others_Choice
11183 or else Is_OK_Static_Expression (N)
11184 or else (Is_Entity_Name (N) and then Is_Type (Entity (N))
11185 and then Is_OK_Static_Subtype (Entity (N)))
11186 or else (Nkind (N) = N_Subtype_Indication
11187 and then Is_OK_Static_Subtype (Entity (N)))
11188 or else (Nkind (N) = N_Range and then Is_OK_Static_Range (N));
11189 end Is_Static_Choice;
11195 function Is_Type_Ref (N : Node_Id) return Boolean is
11197 return Nkind (N) = N_Identifier
11198 and then Chars (N) = Nam
11199 and then Paren_Count (N) = 0;
11202 -- Start of processing for Is_Predicate_Static
11205 -- Predicate_Static means one of the following holds. Numbers are the
11206 -- corresponding paragraph numbers in (RM 3.2.4(16-22)).
11208 -- 16: A static expression
11210 if Is_OK_Static_Expression (Expr) then
11213 -- 17: A membership test whose simple_expression is the current
11214 -- instance, and whose membership_choice_list meets the requirements
11215 -- for a static membership test.
11217 elsif Nkind (Expr) in N_Membership_Test
11218 and then ((Present (Right_Opnd (Expr))
11219 and then Is_Static_Choice (Right_Opnd (Expr)))
11221 (Present (Alternatives (Expr))
11222 and then All_Static_Choices (Alternatives (Expr))))
11226 -- 18. A case_expression whose selecting_expression is the current
11227 -- instance, and whose dependent expressions are static expressions.
11229 elsif Nkind (Expr) = N_Case_Expression
11230 and then Is_Type_Ref (Expression (Expr))
11231 and then All_Static_Case_Alternatives (Alternatives (Expr))
11235 -- 19. A call to a predefined equality or ordering operator, where one
11236 -- operand is the current instance, and the other is a static
11239 -- Note: the RM is clearly wrong here in not excluding string types.
11240 -- Without this exclusion, we would allow expressions like X > "ABC"
11241 -- to be considered as predicate-static, which is clearly not intended,
11242 -- since the idea is for predicate-static to be a subset of normal
11243 -- static expressions (and "DEF" > "ABC" is not a static expression).
11245 -- However, we do allow internally generated (not from source) equality
11246 -- and inequality operations to be valid on strings (this helps deal
11247 -- with cases where we transform A in "ABC" to A = "ABC).
11249 elsif Nkind (Expr) in N_Op_Compare
11250 and then ((not Is_String_Type (Etype (Left_Opnd (Expr))))
11251 or else (Nkind_In (Expr, N_Op_Eq, N_Op_Ne)
11252 and then not Comes_From_Source (Expr)))
11253 and then ((Is_Type_Ref (Left_Opnd (Expr))
11254 and then Is_OK_Static_Expression (Right_Opnd (Expr)))
11256 (Is_Type_Ref (Right_Opnd (Expr))
11257 and then Is_OK_Static_Expression (Left_Opnd (Expr))))
11261 -- 20. A call to a predefined boolean logical operator, where each
11262 -- operand is predicate-static.
11264 elsif (Nkind_In (Expr, N_Op_And, N_Op_Or, N_Op_Xor)
11265 and then Is_Predicate_Static (Left_Opnd (Expr), Nam)
11266 and then Is_Predicate_Static (Right_Opnd (Expr), Nam))
11268 (Nkind (Expr) = N_Op_Not
11269 and then Is_Predicate_Static (Right_Opnd (Expr), Nam))
11273 -- 21. A short-circuit control form where both operands are
11274 -- predicate-static.
11276 elsif Nkind (Expr) in N_Short_Circuit
11277 and then Is_Predicate_Static (Left_Opnd (Expr), Nam)
11278 and then Is_Predicate_Static (Right_Opnd (Expr), Nam)
11282 -- 22. A parenthesized predicate-static expression. This does not
11283 -- require any special test, since we just ignore paren levels in
11284 -- all the cases above.
11286 -- One more test that is an implementation artifact caused by the fact
11287 -- that we are analyzing not the original expression, but the generated
11288 -- expression in the body of the predicate function. This can include
11289 -- references to inherited predicates, so that the expression we are
11290 -- processing looks like:
11292 -- expression and then xxPredicate (typ (Inns))
11294 -- Where the call is to a Predicate function for an inherited predicate.
11295 -- We simply ignore such a call, which could be to either a dynamic or
11296 -- a static predicate. Note that if the parent predicate is dynamic then
11297 -- eventually this type will be marked as dynamic, but you are allowed
11298 -- to specify a static predicate for a subtype which is inheriting a
11299 -- dynamic predicate, so the static predicate validation here ignores
11300 -- the inherited predicate even if it is dynamic.
11302 elsif Nkind (Expr) = N_Function_Call
11303 and then Is_Predicate_Function (Entity (Name (Expr)))
11307 -- That's an exhaustive list of tests, all other cases are not
11308 -- predicate-static, so we return False.
11313 end Is_Predicate_Static;
11315 ---------------------
11316 -- Kill_Rep_Clause --
11317 ---------------------
11319 procedure Kill_Rep_Clause (N : Node_Id) is
11321 pragma Assert (Ignore_Rep_Clauses);
11323 -- Note: we use Replace rather than Rewrite, because we don't want
11324 -- ASIS to be able to use Original_Node to dig out the (undecorated)
11325 -- rep clause that is being replaced.
11327 Replace (N, Make_Null_Statement (Sloc (N)));
11329 -- The null statement must be marked as not coming from source. This is
11330 -- so that ASIS ignores it, and also the back end does not expect bogus
11331 -- "from source" null statements in weird places (e.g. in declarative
11332 -- regions where such null statements are not allowed).
11334 Set_Comes_From_Source (N, False);
11335 end Kill_Rep_Clause;
11341 function Minimum_Size
11343 Biased : Boolean := False) return Nat
11345 Lo : Uint := No_Uint;
11346 Hi : Uint := No_Uint;
11347 LoR : Ureal := No_Ureal;
11348 HiR : Ureal := No_Ureal;
11349 LoSet : Boolean := False;
11350 HiSet : Boolean := False;
11353 Ancest : Entity_Id;
11354 R_Typ : constant Entity_Id := Root_Type (T);
11357 -- If bad type, return 0
11359 if T = Any_Type then
11362 -- For generic types, just return zero. There cannot be any legitimate
11363 -- need to know such a size, but this routine may be called with a
11364 -- generic type as part of normal processing.
11366 elsif Is_Generic_Type (R_Typ) or else R_Typ = Any_Type then
11369 -- Access types (cannot have size smaller than System.Address)
11371 elsif Is_Access_Type (T) then
11372 return System_Address_Size;
11374 -- Floating-point types
11376 elsif Is_Floating_Point_Type (T) then
11377 return UI_To_Int (Esize (R_Typ));
11381 elsif Is_Discrete_Type (T) then
11383 -- The following loop is looking for the nearest compile time known
11384 -- bounds following the ancestor subtype chain. The idea is to find
11385 -- the most restrictive known bounds information.
11389 if Ancest = Any_Type or else Etype (Ancest) = Any_Type then
11394 if Compile_Time_Known_Value (Type_Low_Bound (Ancest)) then
11395 Lo := Expr_Rep_Value (Type_Low_Bound (Ancest));
11402 if Compile_Time_Known_Value (Type_High_Bound (Ancest)) then
11403 Hi := Expr_Rep_Value (Type_High_Bound (Ancest));
11409 Ancest := Ancestor_Subtype (Ancest);
11411 if No (Ancest) then
11412 Ancest := Base_Type (T);
11414 if Is_Generic_Type (Ancest) then
11420 -- Fixed-point types. We can't simply use Expr_Value to get the
11421 -- Corresponding_Integer_Value values of the bounds, since these do not
11422 -- get set till the type is frozen, and this routine can be called
11423 -- before the type is frozen. Similarly the test for bounds being static
11424 -- needs to include the case where we have unanalyzed real literals for
11425 -- the same reason.
11427 elsif Is_Fixed_Point_Type (T) then
11429 -- The following loop is looking for the nearest compile time known
11430 -- bounds following the ancestor subtype chain. The idea is to find
11431 -- the most restrictive known bounds information.
11435 if Ancest = Any_Type or else Etype (Ancest) = Any_Type then
11439 -- Note: In the following two tests for LoSet and HiSet, it may
11440 -- seem redundant to test for N_Real_Literal here since normally
11441 -- one would assume that the test for the value being known at
11442 -- compile time includes this case. However, there is a glitch.
11443 -- If the real literal comes from folding a non-static expression,
11444 -- then we don't consider any non- static expression to be known
11445 -- at compile time if we are in configurable run time mode (needed
11446 -- in some cases to give a clearer definition of what is and what
11447 -- is not accepted). So the test is indeed needed. Without it, we
11448 -- would set neither Lo_Set nor Hi_Set and get an infinite loop.
11451 if Nkind (Type_Low_Bound (Ancest)) = N_Real_Literal
11452 or else Compile_Time_Known_Value (Type_Low_Bound (Ancest))
11454 LoR := Expr_Value_R (Type_Low_Bound (Ancest));
11461 if Nkind (Type_High_Bound (Ancest)) = N_Real_Literal
11462 or else Compile_Time_Known_Value (Type_High_Bound (Ancest))
11464 HiR := Expr_Value_R (Type_High_Bound (Ancest));
11470 Ancest := Ancestor_Subtype (Ancest);
11472 if No (Ancest) then
11473 Ancest := Base_Type (T);
11475 if Is_Generic_Type (Ancest) then
11481 Lo := UR_To_Uint (LoR / Small_Value (T));
11482 Hi := UR_To_Uint (HiR / Small_Value (T));
11484 -- No other types allowed
11487 raise Program_Error;
11490 -- Fall through with Hi and Lo set. Deal with biased case
11493 and then not Is_Fixed_Point_Type (T)
11494 and then not (Is_Enumeration_Type (T)
11495 and then Has_Non_Standard_Rep (T)))
11496 or else Has_Biased_Representation (T)
11502 -- Signed case. Note that we consider types like range 1 .. -1 to be
11503 -- signed for the purpose of computing the size, since the bounds have
11504 -- to be accommodated in the base type.
11506 if Lo < 0 or else Hi < 0 then
11510 -- S = size, B = 2 ** (size - 1) (can accommodate -B .. +(B - 1))
11511 -- Note that we accommodate the case where the bounds cross. This
11512 -- can happen either because of the way the bounds are declared
11513 -- or because of the algorithm in Freeze_Fixed_Point_Type.
11527 -- If both bounds are positive, make sure that both are represen-
11528 -- table in the case where the bounds are crossed. This can happen
11529 -- either because of the way the bounds are declared, or because of
11530 -- the algorithm in Freeze_Fixed_Point_Type.
11536 -- S = size, (can accommodate 0 .. (2**size - 1))
11539 while Hi >= Uint_2 ** S loop
11547 ---------------------------
11548 -- New_Stream_Subprogram --
11549 ---------------------------
11551 procedure New_Stream_Subprogram
11555 Nam : TSS_Name_Type)
11557 Loc : constant Source_Ptr := Sloc (N);
11558 Sname : constant Name_Id := Make_TSS_Name (Base_Type (Ent), Nam);
11559 Subp_Id : Entity_Id;
11560 Subp_Decl : Node_Id;
11564 Defer_Declaration : constant Boolean :=
11565 Is_Tagged_Type (Ent) or else Is_Private_Type (Ent);
11566 -- For a tagged type, there is a declaration for each stream attribute
11567 -- at the freeze point, and we must generate only a completion of this
11568 -- declaration. We do the same for private types, because the full view
11569 -- might be tagged. Otherwise we generate a declaration at the point of
11570 -- the attribute definition clause.
11572 function Build_Spec return Node_Id;
11573 -- Used for declaration and renaming declaration, so that this is
11574 -- treated as a renaming_as_body.
11580 function Build_Spec return Node_Id is
11581 Out_P : constant Boolean := (Nam = TSS_Stream_Read);
11584 T_Ref : constant Node_Id := New_Occurrence_Of (Etyp, Loc);
11587 Subp_Id := Make_Defining_Identifier (Loc, Sname);
11589 -- S : access Root_Stream_Type'Class
11591 Formals := New_List (
11592 Make_Parameter_Specification (Loc,
11593 Defining_Identifier =>
11594 Make_Defining_Identifier (Loc, Name_S),
11596 Make_Access_Definition (Loc,
11598 New_Occurrence_Of (
11599 Designated_Type (Etype (F)), Loc))));
11601 if Nam = TSS_Stream_Input then
11603 Make_Function_Specification (Loc,
11604 Defining_Unit_Name => Subp_Id,
11605 Parameter_Specifications => Formals,
11606 Result_Definition => T_Ref);
11610 Append_To (Formals,
11611 Make_Parameter_Specification (Loc,
11612 Defining_Identifier => Make_Defining_Identifier (Loc, Name_V),
11613 Out_Present => Out_P,
11614 Parameter_Type => T_Ref));
11617 Make_Procedure_Specification (Loc,
11618 Defining_Unit_Name => Subp_Id,
11619 Parameter_Specifications => Formals);
11625 -- Start of processing for New_Stream_Subprogram
11628 F := First_Formal (Subp);
11630 if Ekind (Subp) = E_Procedure then
11631 Etyp := Etype (Next_Formal (F));
11633 Etyp := Etype (Subp);
11636 -- Prepare subprogram declaration and insert it as an action on the
11637 -- clause node. The visibility for this entity is used to test for
11638 -- visibility of the attribute definition clause (in the sense of
11639 -- 8.3(23) as amended by AI-195).
11641 if not Defer_Declaration then
11643 Make_Subprogram_Declaration (Loc,
11644 Specification => Build_Spec);
11646 -- For a tagged type, there is always a visible declaration for each
11647 -- stream TSS (it is a predefined primitive operation), and the
11648 -- completion of this declaration occurs at the freeze point, which is
11649 -- not always visible at places where the attribute definition clause is
11650 -- visible. So, we create a dummy entity here for the purpose of
11651 -- tracking the visibility of the attribute definition clause itself.
11655 Make_Defining_Identifier (Loc, New_External_Name (Sname, 'V'));
11657 Make_Object_Declaration (Loc,
11658 Defining_Identifier => Subp_Id,
11659 Object_Definition => New_Occurrence_Of (Standard_Boolean, Loc));
11662 Insert_Action (N, Subp_Decl);
11663 Set_Entity (N, Subp_Id);
11666 Make_Subprogram_Renaming_Declaration (Loc,
11667 Specification => Build_Spec,
11668 Name => New_Occurrence_Of (Subp, Loc));
11670 if Defer_Declaration then
11671 Set_TSS (Base_Type (Ent), Subp_Id);
11673 Insert_Action (N, Subp_Decl);
11674 Copy_TSS (Subp_Id, Base_Type (Ent));
11676 end New_Stream_Subprogram;
11678 ------------------------------------------
11679 -- Push_Scope_And_Install_Discriminants --
11680 ------------------------------------------
11682 procedure Push_Scope_And_Install_Discriminants (E : Entity_Id) is
11684 if Has_Discriminants (E) then
11687 -- Make discriminants visible for type declarations and protected
11688 -- type declarations, not for subtype declarations (RM 13.1.1 (12/3))
11690 if Nkind (Parent (E)) /= N_Subtype_Declaration then
11691 Install_Discriminants (E);
11694 end Push_Scope_And_Install_Discriminants;
11696 ------------------------
11697 -- Rep_Item_Too_Early --
11698 ------------------------
11700 function Rep_Item_Too_Early (T : Entity_Id; N : Node_Id) return Boolean is
11702 -- Cannot apply non-operational rep items to generic types
11704 if Is_Operational_Item (N) then
11708 and then Is_Generic_Type (Root_Type (T))
11710 Error_Msg_N ("representation item not allowed for generic type", N);
11714 -- Otherwise check for incomplete type
11716 if Is_Incomplete_Or_Private_Type (T)
11717 and then No (Underlying_Type (T))
11719 (Nkind (N) /= N_Pragma
11720 or else Get_Pragma_Id (N) /= Pragma_Import)
11723 ("representation item must be after full type declaration", N);
11726 -- If the type has incomplete components, a representation clause is
11727 -- illegal but stream attributes and Convention pragmas are correct.
11729 elsif Has_Private_Component (T) then
11730 if Nkind (N) = N_Pragma then
11735 ("representation item must appear after type is fully defined",
11742 end Rep_Item_Too_Early;
11744 -----------------------
11745 -- Rep_Item_Too_Late --
11746 -----------------------
11748 function Rep_Item_Too_Late
11751 FOnly : Boolean := False) return Boolean
11754 Parent_Type : Entity_Id;
11756 procedure No_Type_Rep_Item;
11757 -- Output message indicating that no type-related aspects can be
11758 -- specified due to some property of the parent type.
11760 procedure Too_Late;
11761 -- Output message for an aspect being specified too late
11763 -- Note that neither of the above errors is considered a serious one,
11764 -- since the effect is simply that we ignore the representation clause
11766 -- Is this really true? In any case if we make this change we must
11767 -- document the requirement in the spec of Rep_Item_Too_Late that
11768 -- if True is returned, then the rep item must be completely ignored???
11770 ----------------------
11771 -- No_Type_Rep_Item --
11772 ----------------------
11774 procedure No_Type_Rep_Item is
11776 Error_Msg_N ("|type-related representation item not permitted!", N);
11777 end No_Type_Rep_Item;
11783 procedure Too_Late is
11785 -- Other compilers seem more relaxed about rep items appearing too
11786 -- late. Since analysis tools typically don't care about rep items
11787 -- anyway, no reason to be too strict about this.
11789 if not Relaxed_RM_Semantics then
11790 Error_Msg_N ("|representation item appears too late!", N);
11794 -- Start of processing for Rep_Item_Too_Late
11797 -- First make sure entity is not frozen (RM 13.1(9))
11801 -- Exclude imported types, which may be frozen if they appear in a
11802 -- representation clause for a local type.
11804 and then not From_Limited_With (T)
11806 -- Exclude generated entities (not coming from source). The common
11807 -- case is when we generate a renaming which prematurely freezes the
11808 -- renamed internal entity, but we still want to be able to set copies
11809 -- of attribute values such as Size/Alignment.
11811 and then Comes_From_Source (T)
11814 S := First_Subtype (T);
11816 if Present (Freeze_Node (S)) then
11817 if not Relaxed_RM_Semantics then
11819 ("??no more representation items for }", Freeze_Node (S), S);
11825 -- Check for case of untagged derived type whose parent either has
11826 -- primitive operations, or is a by reference type (RM 13.1(10)). In
11827 -- this case we do not output a Too_Late message, since there is no
11828 -- earlier point where the rep item could be placed to make it legal.
11832 and then Is_Derived_Type (T)
11833 and then not Is_Tagged_Type (T)
11835 Parent_Type := Etype (Base_Type (T));
11837 if Has_Primitive_Operations (Parent_Type) then
11840 if not Relaxed_RM_Semantics then
11842 ("\parent type & has primitive operations!", N, Parent_Type);
11847 elsif Is_By_Reference_Type (Parent_Type) then
11850 if not Relaxed_RM_Semantics then
11852 ("\parent type & is a by reference type!", N, Parent_Type);
11859 -- No error, but one more warning to consider. The RM (surprisingly)
11860 -- allows this pattern:
11863 -- primitive operations for S
11864 -- type R is new S;
11865 -- rep clause for S
11867 -- Meaning that calls on the primitive operations of S for values of
11868 -- type R may require possibly expensive implicit conversion operations.
11869 -- This is not an error, but is worth a warning.
11871 if not Relaxed_RM_Semantics and then Is_Type (T) then
11873 DTL : constant Entity_Id := Derived_Type_Link (Base_Type (T));
11877 and then Has_Primitive_Operations (Base_Type (T))
11879 -- For now, do not generate this warning for the case of aspect
11880 -- specification using Ada 2012 syntax, since we get wrong
11881 -- messages we do not understand. The whole business of derived
11882 -- types and rep items seems a bit confused when aspects are
11883 -- used, since the aspects are not evaluated till freeze time.
11885 and then not From_Aspect_Specification (N)
11887 Error_Msg_Sloc := Sloc (DTL);
11889 ("representation item for& appears after derived type "
11890 & "declaration#??", N);
11892 ("\may result in implicit conversions for primitive "
11893 & "operations of&??", N, T);
11895 ("\to change representations when called with arguments "
11896 & "of type&??", N, DTL);
11901 -- No error, link item into head of chain of rep items for the entity,
11902 -- but avoid chaining if we have an overloadable entity, and the pragma
11903 -- is one that can apply to multiple overloaded entities.
11905 if Is_Overloadable (T) and then Nkind (N) = N_Pragma then
11907 Pname : constant Name_Id := Pragma_Name (N);
11909 if Nam_In (Pname, Name_Convention, Name_Import, Name_Export,
11910 Name_External, Name_Interface)
11917 Record_Rep_Item (T, N);
11919 end Rep_Item_Too_Late;
11921 -------------------------------------
11922 -- Replace_Type_References_Generic --
11923 -------------------------------------
11925 procedure Replace_Type_References_Generic (N : Node_Id; T : Entity_Id) is
11926 TName : constant Name_Id := Chars (T);
11928 function Replace_Node (N : Node_Id) return Traverse_Result;
11929 -- Processes a single node in the traversal procedure below, checking
11930 -- if node N should be replaced, and if so, doing the replacement.
11932 procedure Replace_Type_Refs is new Traverse_Proc (Replace_Node);
11933 -- This instantiation provides the body of Replace_Type_References
11939 function Replace_Node (N : Node_Id) return Traverse_Result is
11944 -- Case of identifier
11946 if Nkind (N) = N_Identifier then
11948 -- If not the type name, check whether it is a reference to
11949 -- some other type, which must be frozen before the predicate
11950 -- function is analyzed, i.e. before the freeze node of the
11951 -- type to which the predicate applies.
11953 if Chars (N) /= TName then
11954 if Present (Current_Entity (N))
11955 and then Is_Type (Current_Entity (N))
11957 Freeze_Before (Freeze_Node (T), Current_Entity (N));
11962 -- Otherwise do the replacement and we are done with this node
11965 Replace_Type_Reference (N);
11969 -- Case of selected component (which is what a qualification
11970 -- looks like in the unanalyzed tree, which is what we have.
11972 elsif Nkind (N) = N_Selected_Component then
11974 -- If selector name is not our type, keeping going (we might
11975 -- still have an occurrence of the type in the prefix).
11977 if Nkind (Selector_Name (N)) /= N_Identifier
11978 or else Chars (Selector_Name (N)) /= TName
11982 -- Selector name is our type, check qualification
11985 -- Loop through scopes and prefixes, doing comparison
11987 S := Current_Scope;
11990 -- Continue if no more scopes or scope with no name
11992 if No (S) or else Nkind (S) not in N_Has_Chars then
11996 -- Do replace if prefix is an identifier matching the
11997 -- scope that we are currently looking at.
11999 if Nkind (P) = N_Identifier
12000 and then Chars (P) = Chars (S)
12002 Replace_Type_Reference (N);
12006 -- Go check scope above us if prefix is itself of the
12007 -- form of a selected component, whose selector matches
12008 -- the scope we are currently looking at.
12010 if Nkind (P) = N_Selected_Component
12011 and then Nkind (Selector_Name (P)) = N_Identifier
12012 and then Chars (Selector_Name (P)) = Chars (S)
12017 -- For anything else, we don't have a match, so keep on
12018 -- going, there are still some weird cases where we may
12019 -- still have a replacement within the prefix.
12027 -- Continue for any other node kind
12035 Replace_Type_Refs (N);
12036 end Replace_Type_References_Generic;
12038 -------------------------
12039 -- Same_Representation --
12040 -------------------------
12042 function Same_Representation (Typ1, Typ2 : Entity_Id) return Boolean is
12043 T1 : constant Entity_Id := Underlying_Type (Typ1);
12044 T2 : constant Entity_Id := Underlying_Type (Typ2);
12047 -- A quick check, if base types are the same, then we definitely have
12048 -- the same representation, because the subtype specific representation
12049 -- attributes (Size and Alignment) do not affect representation from
12050 -- the point of view of this test.
12052 if Base_Type (T1) = Base_Type (T2) then
12055 elsif Is_Private_Type (Base_Type (T2))
12056 and then Base_Type (T1) = Full_View (Base_Type (T2))
12061 -- Tagged types never have differing representations
12063 if Is_Tagged_Type (T1) then
12067 -- Representations are definitely different if conventions differ
12069 if Convention (T1) /= Convention (T2) then
12073 -- Representations are different if component alignments or scalar
12074 -- storage orders differ.
12076 if (Is_Record_Type (T1) or else Is_Array_Type (T1))
12078 (Is_Record_Type (T2) or else Is_Array_Type (T2))
12080 (Component_Alignment (T1) /= Component_Alignment (T2)
12081 or else Reverse_Storage_Order (T1) /= Reverse_Storage_Order (T2))
12086 -- For arrays, the only real issue is component size. If we know the
12087 -- component size for both arrays, and it is the same, then that's
12088 -- good enough to know we don't have a change of representation.
12090 if Is_Array_Type (T1) then
12091 if Known_Component_Size (T1)
12092 and then Known_Component_Size (T2)
12093 and then Component_Size (T1) = Component_Size (T2)
12095 if VM_Target = No_VM then
12098 -- In VM targets the representation of arrays with aliased
12099 -- components differs from arrays with non-aliased components
12102 return Has_Aliased_Components (Base_Type (T1))
12104 Has_Aliased_Components (Base_Type (T2));
12109 -- Types definitely have same representation if neither has non-standard
12110 -- representation since default representations are always consistent.
12111 -- If only one has non-standard representation, and the other does not,
12112 -- then we consider that they do not have the same representation. They
12113 -- might, but there is no way of telling early enough.
12115 if Has_Non_Standard_Rep (T1) then
12116 if not Has_Non_Standard_Rep (T2) then
12120 return not Has_Non_Standard_Rep (T2);
12123 -- Here the two types both have non-standard representation, and we need
12124 -- to determine if they have the same non-standard representation.
12126 -- For arrays, we simply need to test if the component sizes are the
12127 -- same. Pragma Pack is reflected in modified component sizes, so this
12128 -- check also deals with pragma Pack.
12130 if Is_Array_Type (T1) then
12131 return Component_Size (T1) = Component_Size (T2);
12133 -- Tagged types always have the same representation, because it is not
12134 -- possible to specify different representations for common fields.
12136 elsif Is_Tagged_Type (T1) then
12139 -- Case of record types
12141 elsif Is_Record_Type (T1) then
12143 -- Packed status must conform
12145 if Is_Packed (T1) /= Is_Packed (T2) then
12148 -- Otherwise we must check components. Typ2 maybe a constrained
12149 -- subtype with fewer components, so we compare the components
12150 -- of the base types.
12153 Record_Case : declare
12154 CD1, CD2 : Entity_Id;
12156 function Same_Rep return Boolean;
12157 -- CD1 and CD2 are either components or discriminants. This
12158 -- function tests whether they have the same representation.
12164 function Same_Rep return Boolean is
12166 if No (Component_Clause (CD1)) then
12167 return No (Component_Clause (CD2));
12169 -- Note: at this point, component clauses have been
12170 -- normalized to the default bit order, so that the
12171 -- comparison of Component_Bit_Offsets is meaningful.
12174 Present (Component_Clause (CD2))
12176 Component_Bit_Offset (CD1) = Component_Bit_Offset (CD2)
12178 Esize (CD1) = Esize (CD2);
12182 -- Start of processing for Record_Case
12185 if Has_Discriminants (T1) then
12187 -- The number of discriminants may be different if the
12188 -- derived type has fewer (constrained by values). The
12189 -- invisible discriminants retain the representation of
12190 -- the original, so the discrepancy does not per se
12191 -- indicate a different representation.
12193 CD1 := First_Discriminant (T1);
12194 CD2 := First_Discriminant (T2);
12195 while Present (CD1) and then Present (CD2) loop
12196 if not Same_Rep then
12199 Next_Discriminant (CD1);
12200 Next_Discriminant (CD2);
12205 CD1 := First_Component (Underlying_Type (Base_Type (T1)));
12206 CD2 := First_Component (Underlying_Type (Base_Type (T2)));
12207 while Present (CD1) loop
12208 if not Same_Rep then
12211 Next_Component (CD1);
12212 Next_Component (CD2);
12220 -- For enumeration types, we must check each literal to see if the
12221 -- representation is the same. Note that we do not permit enumeration
12222 -- representation clauses for Character and Wide_Character, so these
12223 -- cases were already dealt with.
12225 elsif Is_Enumeration_Type (T1) then
12226 Enumeration_Case : declare
12227 L1, L2 : Entity_Id;
12230 L1 := First_Literal (T1);
12231 L2 := First_Literal (T2);
12232 while Present (L1) loop
12233 if Enumeration_Rep (L1) /= Enumeration_Rep (L2) then
12242 end Enumeration_Case;
12244 -- Any other types have the same representation for these purposes
12249 end Same_Representation;
12251 --------------------------------
12252 -- Resolve_Iterable_Operation --
12253 --------------------------------
12255 procedure Resolve_Iterable_Operation
12257 Cursor : Entity_Id;
12266 if not Is_Overloaded (N) then
12267 if not Is_Entity_Name (N)
12268 or else Ekind (Entity (N)) /= E_Function
12269 or else Scope (Entity (N)) /= Scope (Typ)
12270 or else No (First_Formal (Entity (N)))
12271 or else Etype (First_Formal (Entity (N))) /= Typ
12273 Error_Msg_N ("iterable primitive must be local function name "
12274 & "whose first formal is an iterable type", N);
12279 F1 := First_Formal (Ent);
12280 if Nam = Name_First then
12282 -- First (Container) => Cursor
12284 if Etype (Ent) /= Cursor then
12285 Error_Msg_N ("primitive for First must yield a curosr", N);
12288 elsif Nam = Name_Next then
12290 -- Next (Container, Cursor) => Cursor
12292 F2 := Next_Formal (F1);
12294 if Etype (F2) /= Cursor
12295 or else Etype (Ent) /= Cursor
12296 or else Present (Next_Formal (F2))
12298 Error_Msg_N ("no match for Next iterable primitive", N);
12301 elsif Nam = Name_Has_Element then
12303 -- Has_Element (Container, Cursor) => Boolean
12305 F2 := Next_Formal (F1);
12306 if Etype (F2) /= Cursor
12307 or else Etype (Ent) /= Standard_Boolean
12308 or else Present (Next_Formal (F2))
12310 Error_Msg_N ("no match for Has_Element iterable primitive", N);
12313 elsif Nam = Name_Element then
12314 F2 := Next_Formal (F1);
12317 or else Etype (F2) /= Cursor
12318 or else Present (Next_Formal (F2))
12320 Error_Msg_N ("no match for Element iterable primitive", N);
12325 raise Program_Error;
12329 -- Overloaded case: find subprogram with proper signature.
12330 -- Caller will report error if no match is found.
12337 Get_First_Interp (N, I, It);
12338 while Present (It.Typ) loop
12339 if Ekind (It.Nam) = E_Function
12340 and then Scope (It.Nam) = Scope (Typ)
12341 and then Etype (First_Formal (It.Nam)) = Typ
12343 F1 := First_Formal (It.Nam);
12345 if Nam = Name_First then
12346 if Etype (It.Nam) = Cursor
12347 and then No (Next_Formal (F1))
12349 Set_Entity (N, It.Nam);
12353 elsif Nam = Name_Next then
12354 F2 := Next_Formal (F1);
12357 and then No (Next_Formal (F2))
12358 and then Etype (F2) = Cursor
12359 and then Etype (It.Nam) = Cursor
12361 Set_Entity (N, It.Nam);
12365 elsif Nam = Name_Has_Element then
12366 F2 := Next_Formal (F1);
12369 and then No (Next_Formal (F2))
12370 and then Etype (F2) = Cursor
12371 and then Etype (It.Nam) = Standard_Boolean
12373 Set_Entity (N, It.Nam);
12374 F2 := Next_Formal (F1);
12378 elsif Nam = Name_Element then
12379 F2 := Next_Formal (F1);
12382 and then No (Next_Formal (F2))
12383 and then Etype (F2) = Cursor
12385 Set_Entity (N, It.Nam);
12391 Get_Next_Interp (I, It);
12395 end Resolve_Iterable_Operation;
12401 procedure Set_Biased
12405 Biased : Boolean := True)
12409 Set_Has_Biased_Representation (E);
12411 if Warn_On_Biased_Representation then
12413 ("?B?" & Msg & " forces biased representation for&", N, E);
12418 --------------------
12419 -- Set_Enum_Esize --
12420 --------------------
12422 procedure Set_Enum_Esize (T : Entity_Id) is
12428 Init_Alignment (T);
12430 -- Find the minimum standard size (8,16,32,64) that fits
12432 Lo := Enumeration_Rep (Entity (Type_Low_Bound (T)));
12433 Hi := Enumeration_Rep (Entity (Type_High_Bound (T)));
12436 if Lo >= -Uint_2**07 and then Hi < Uint_2**07 then
12437 Sz := Standard_Character_Size; -- May be > 8 on some targets
12439 elsif Lo >= -Uint_2**15 and then Hi < Uint_2**15 then
12442 elsif Lo >= -Uint_2**31 and then Hi < Uint_2**31 then
12445 else pragma Assert (Lo >= -Uint_2**63 and then Hi < Uint_2**63);
12450 if Hi < Uint_2**08 then
12451 Sz := Standard_Character_Size; -- May be > 8 on some targets
12453 elsif Hi < Uint_2**16 then
12456 elsif Hi < Uint_2**32 then
12459 else pragma Assert (Hi < Uint_2**63);
12464 -- That minimum is the proper size unless we have a foreign convention
12465 -- and the size required is 32 or less, in which case we bump the size
12466 -- up to 32. This is required for C and C++ and seems reasonable for
12467 -- all other foreign conventions.
12469 if Has_Foreign_Convention (T)
12470 and then Esize (T) < Standard_Integer_Size
12472 -- Don't do this if Short_Enums on target
12474 and then not Target_Short_Enums
12476 Init_Esize (T, Standard_Integer_Size);
12478 Init_Esize (T, Sz);
12480 end Set_Enum_Esize;
12482 -----------------------------
12483 -- Uninstall_Discriminants --
12484 -----------------------------
12486 procedure Uninstall_Discriminants (E : Entity_Id) is
12492 -- Discriminants have been made visible for type declarations and
12493 -- protected type declarations, not for subtype declarations.
12495 if Nkind (Parent (E)) /= N_Subtype_Declaration then
12496 Disc := First_Discriminant (E);
12497 while Present (Disc) loop
12498 if Disc /= Current_Entity (Disc) then
12499 Prev := Current_Entity (Disc);
12500 while Present (Prev)
12501 and then Present (Homonym (Prev))
12502 and then Homonym (Prev) /= Disc
12504 Prev := Homonym (Prev);
12510 Set_Is_Immediately_Visible (Disc, False);
12512 Outer := Homonym (Disc);
12513 while Present (Outer) and then Scope (Outer) = E loop
12514 Outer := Homonym (Outer);
12517 -- Reset homonym link of other entities, but do not modify link
12518 -- between entities in current scope, so that the back-end can
12519 -- have a proper count of local overloadings.
12522 Set_Name_Entity_Id (Chars (Disc), Outer);
12524 elsif Scope (Prev) /= Scope (Disc) then
12525 Set_Homonym (Prev, Outer);
12528 Next_Discriminant (Disc);
12531 end Uninstall_Discriminants;
12533 -------------------------------------------
12534 -- Uninstall_Discriminants_And_Pop_Scope --
12535 -------------------------------------------
12537 procedure Uninstall_Discriminants_And_Pop_Scope (E : Entity_Id) is
12539 if Has_Discriminants (E) then
12540 Uninstall_Discriminants (E);
12543 end Uninstall_Discriminants_And_Pop_Scope;
12545 ------------------------------
12546 -- Validate_Address_Clauses --
12547 ------------------------------
12549 procedure Validate_Address_Clauses is
12551 for J in Address_Clause_Checks.First .. Address_Clause_Checks.Last loop
12553 ACCR : Address_Clause_Check_Record
12554 renames Address_Clause_Checks.Table (J);
12558 X_Alignment : Uint;
12559 Y_Alignment : Uint;
12565 -- Skip processing of this entry if warning already posted
12567 if not Address_Warning_Posted (ACCR.N) then
12568 Expr := Original_Node (Expression (ACCR.N));
12572 X_Alignment := Alignment (ACCR.X);
12573 Y_Alignment := Alignment (ACCR.Y);
12575 -- Similarly obtain sizes
12577 X_Size := Esize (ACCR.X);
12578 Y_Size := Esize (ACCR.Y);
12580 -- Check for large object overlaying smaller one
12583 and then X_Size > Uint_0
12584 and then X_Size > Y_Size
12587 ("??& overlays smaller object", ACCR.N, ACCR.X);
12589 ("\??program execution may be erroneous", ACCR.N);
12590 Error_Msg_Uint_1 := X_Size;
12592 ("\??size of & is ^", ACCR.N, ACCR.X);
12593 Error_Msg_Uint_1 := Y_Size;
12595 ("\??size of & is ^", ACCR.N, ACCR.Y);
12597 -- Check for inadequate alignment, both of the base object
12598 -- and of the offset, if any.
12600 -- Note: we do not check the alignment if we gave a size
12601 -- warning, since it would likely be redundant.
12603 elsif Y_Alignment /= Uint_0
12604 and then (Y_Alignment < X_Alignment
12607 Nkind (Expr) = N_Attribute_Reference
12609 Attribute_Name (Expr) = Name_Address
12611 Has_Compatible_Alignment
12612 (ACCR.X, Prefix (Expr))
12613 /= Known_Compatible))
12616 ("??specified address for& may be inconsistent "
12617 & "with alignment", ACCR.N, ACCR.X);
12619 ("\??program execution may be erroneous (RM 13.3(27))",
12621 Error_Msg_Uint_1 := X_Alignment;
12623 ("\??alignment of & is ^", ACCR.N, ACCR.X);
12624 Error_Msg_Uint_1 := Y_Alignment;
12626 ("\??alignment of & is ^", ACCR.N, ACCR.Y);
12627 if Y_Alignment >= X_Alignment then
12629 ("\??but offset is not multiple of alignment", ACCR.N);
12635 end Validate_Address_Clauses;
12637 ---------------------------
12638 -- Validate_Independence --
12639 ---------------------------
12641 procedure Validate_Independence is
12642 SU : constant Uint := UI_From_Int (System_Storage_Unit);
12650 procedure Check_Array_Type (Atyp : Entity_Id);
12651 -- Checks if the array type Atyp has independent components, and
12652 -- if not, outputs an appropriate set of error messages.
12654 procedure No_Independence;
12655 -- Output message that independence cannot be guaranteed
12657 function OK_Component (C : Entity_Id) return Boolean;
12658 -- Checks one component to see if it is independently accessible, and
12659 -- if so yields True, otherwise yields False if independent access
12660 -- cannot be guaranteed. This is a conservative routine, it only
12661 -- returns True if it knows for sure, it returns False if it knows
12662 -- there is a problem, or it cannot be sure there is no problem.
12664 procedure Reason_Bad_Component (C : Entity_Id);
12665 -- Outputs continuation message if a reason can be determined for
12666 -- the component C being bad.
12668 ----------------------
12669 -- Check_Array_Type --
12670 ----------------------
12672 procedure Check_Array_Type (Atyp : Entity_Id) is
12673 Ctyp : constant Entity_Id := Component_Type (Atyp);
12676 -- OK if no alignment clause, no pack, and no component size
12678 if not Has_Component_Size_Clause (Atyp)
12679 and then not Has_Alignment_Clause (Atyp)
12680 and then not Is_Packed (Atyp)
12685 -- Case of component size is greater than or equal to 64 and the
12686 -- alignment of the array is at least as large as the alignment
12687 -- of the component. We are definitely OK in this situation.
12689 if Known_Component_Size (Atyp)
12690 and then Component_Size (Atyp) >= 64
12691 and then Known_Alignment (Atyp)
12692 and then Known_Alignment (Ctyp)
12693 and then Alignment (Atyp) >= Alignment (Ctyp)
12698 -- Check actual component size
12700 if not Known_Component_Size (Atyp)
12701 or else not (Addressable (Component_Size (Atyp))
12702 and then Component_Size (Atyp) < 64)
12703 or else Component_Size (Atyp) mod Esize (Ctyp) /= 0
12707 -- Bad component size, check reason
12709 if Has_Component_Size_Clause (Atyp) then
12710 P := Get_Attribute_Definition_Clause
12711 (Atyp, Attribute_Component_Size);
12713 if Present (P) then
12714 Error_Msg_Sloc := Sloc (P);
12715 Error_Msg_N ("\because of Component_Size clause#", N);
12720 if Is_Packed (Atyp) then
12721 P := Get_Rep_Pragma (Atyp, Name_Pack);
12723 if Present (P) then
12724 Error_Msg_Sloc := Sloc (P);
12725 Error_Msg_N ("\because of pragma Pack#", N);
12730 -- No reason found, just return
12735 -- Array type is OK independence-wise
12738 end Check_Array_Type;
12740 ---------------------
12741 -- No_Independence --
12742 ---------------------
12744 procedure No_Independence is
12746 if Pragma_Name (N) = Name_Independent then
12747 Error_Msg_NE ("independence cannot be guaranteed for&", N, E);
12750 ("independent components cannot be guaranteed for&", N, E);
12752 end No_Independence;
12758 function OK_Component (C : Entity_Id) return Boolean is
12759 Rec : constant Entity_Id := Scope (C);
12760 Ctyp : constant Entity_Id := Etype (C);
12763 -- OK if no component clause, no Pack, and no alignment clause
12765 if No (Component_Clause (C))
12766 and then not Is_Packed (Rec)
12767 and then not Has_Alignment_Clause (Rec)
12772 -- Here we look at the actual component layout. A component is
12773 -- addressable if its size is a multiple of the Esize of the
12774 -- component type, and its starting position in the record has
12775 -- appropriate alignment, and the record itself has appropriate
12776 -- alignment to guarantee the component alignment.
12778 -- Make sure sizes are static, always assume the worst for any
12779 -- cases where we cannot check static values.
12781 if not (Known_Static_Esize (C)
12783 Known_Static_Esize (Ctyp))
12788 -- Size of component must be addressable or greater than 64 bits
12789 -- and a multiple of bytes.
12791 if not Addressable (Esize (C)) and then Esize (C) < Uint_64 then
12795 -- Check size is proper multiple
12797 if Esize (C) mod Esize (Ctyp) /= 0 then
12801 -- Check alignment of component is OK
12803 if not Known_Component_Bit_Offset (C)
12804 or else Component_Bit_Offset (C) < Uint_0
12805 or else Component_Bit_Offset (C) mod Esize (Ctyp) /= 0
12810 -- Check alignment of record type is OK
12812 if not Known_Alignment (Rec)
12813 or else (Alignment (Rec) * SU) mod Esize (Ctyp) /= 0
12818 -- All tests passed, component is addressable
12823 --------------------------
12824 -- Reason_Bad_Component --
12825 --------------------------
12827 procedure Reason_Bad_Component (C : Entity_Id) is
12828 Rec : constant Entity_Id := Scope (C);
12829 Ctyp : constant Entity_Id := Etype (C);
12832 -- If component clause present assume that's the problem
12834 if Present (Component_Clause (C)) then
12835 Error_Msg_Sloc := Sloc (Component_Clause (C));
12836 Error_Msg_N ("\because of Component_Clause#", N);
12840 -- If pragma Pack clause present, assume that's the problem
12842 if Is_Packed (Rec) then
12843 P := Get_Rep_Pragma (Rec, Name_Pack);
12845 if Present (P) then
12846 Error_Msg_Sloc := Sloc (P);
12847 Error_Msg_N ("\because of pragma Pack#", N);
12852 -- See if record has bad alignment clause
12854 if Has_Alignment_Clause (Rec)
12855 and then Known_Alignment (Rec)
12856 and then (Alignment (Rec) * SU) mod Esize (Ctyp) /= 0
12858 P := Get_Attribute_Definition_Clause (Rec, Attribute_Alignment);
12860 if Present (P) then
12861 Error_Msg_Sloc := Sloc (P);
12862 Error_Msg_N ("\because of Alignment clause#", N);
12866 -- Couldn't find a reason, so return without a message
12869 end Reason_Bad_Component;
12871 -- Start of processing for Validate_Independence
12874 for J in Independence_Checks.First .. Independence_Checks.Last loop
12875 N := Independence_Checks.Table (J).N;
12876 E := Independence_Checks.Table (J).E;
12877 IC := Pragma_Name (N) = Name_Independent_Components;
12879 -- Deal with component case
12881 if Ekind (E) = E_Discriminant or else Ekind (E) = E_Component then
12882 if not OK_Component (E) then
12884 Reason_Bad_Component (E);
12889 -- Deal with record with Independent_Components
12891 if IC and then Is_Record_Type (E) then
12892 Comp := First_Component_Or_Discriminant (E);
12893 while Present (Comp) loop
12894 if not OK_Component (Comp) then
12896 Reason_Bad_Component (Comp);
12900 Next_Component_Or_Discriminant (Comp);
12904 -- Deal with address clause case
12906 if Is_Object (E) then
12907 Addr := Address_Clause (E);
12909 if Present (Addr) then
12911 Error_Msg_Sloc := Sloc (Addr);
12912 Error_Msg_N ("\because of Address clause#", N);
12917 -- Deal with independent components for array type
12919 if IC and then Is_Array_Type (E) then
12920 Check_Array_Type (E);
12923 -- Deal with independent components for array object
12925 if IC and then Is_Object (E) and then Is_Array_Type (Etype (E)) then
12926 Check_Array_Type (Etype (E));
12931 end Validate_Independence;
12933 ------------------------------
12934 -- Validate_Iterable_Aspect --
12935 ------------------------------
12937 procedure Validate_Iterable_Aspect (Typ : Entity_Id; ASN : Node_Id) is
12942 Cursor : constant Entity_Id := Get_Cursor_Type (ASN, Typ);
12944 First_Id : Entity_Id;
12945 Next_Id : Entity_Id;
12946 Has_Element_Id : Entity_Id;
12947 Element_Id : Entity_Id;
12950 -- If previous error aspect is unusable
12952 if Cursor = Any_Type then
12958 Has_Element_Id := Empty;
12959 Element_Id := Empty;
12961 -- Each expression must resolve to a function with the proper signature
12963 Assoc := First (Component_Associations (Expression (ASN)));
12964 while Present (Assoc) loop
12965 Expr := Expression (Assoc);
12968 Prim := First (Choices (Assoc));
12970 if Nkind (Prim) /= N_Identifier or else Present (Next (Prim)) then
12971 Error_Msg_N ("illegal name in association", Prim);
12973 elsif Chars (Prim) = Name_First then
12974 Resolve_Iterable_Operation (Expr, Cursor, Typ, Name_First);
12975 First_Id := Entity (Expr);
12977 elsif Chars (Prim) = Name_Next then
12978 Resolve_Iterable_Operation (Expr, Cursor, Typ, Name_Next);
12979 Next_Id := Entity (Expr);
12981 elsif Chars (Prim) = Name_Has_Element then
12982 Resolve_Iterable_Operation (Expr, Cursor, Typ, Name_Has_Element);
12983 Has_Element_Id := Entity (Expr);
12985 elsif Chars (Prim) = Name_Element then
12986 Resolve_Iterable_Operation (Expr, Cursor, Typ, Name_Element);
12987 Element_Id := Entity (Expr);
12990 Error_Msg_N ("invalid name for iterable function", Prim);
12996 if No (First_Id) then
12997 Error_Msg_N ("match for First primitive not found", ASN);
12999 elsif No (Next_Id) then
13000 Error_Msg_N ("match for Next primitive not found", ASN);
13002 elsif No (Has_Element_Id) then
13003 Error_Msg_N ("match for Has_Element primitive not found", ASN);
13005 elsif No (Element_Id) then
13008 end Validate_Iterable_Aspect;
13010 -----------------------------------
13011 -- Validate_Unchecked_Conversion --
13012 -----------------------------------
13014 procedure Validate_Unchecked_Conversion
13016 Act_Unit : Entity_Id)
13018 Source : Entity_Id;
13019 Target : Entity_Id;
13023 -- Obtain source and target types. Note that we call Ancestor_Subtype
13024 -- here because the processing for generic instantiation always makes
13025 -- subtypes, and we want the original frozen actual types.
13027 -- If we are dealing with private types, then do the check on their
13028 -- fully declared counterparts if the full declarations have been
13029 -- encountered (they don't have to be visible, but they must exist).
13031 Source := Ancestor_Subtype (Etype (First_Formal (Act_Unit)));
13033 if Is_Private_Type (Source)
13034 and then Present (Underlying_Type (Source))
13036 Source := Underlying_Type (Source);
13039 Target := Ancestor_Subtype (Etype (Act_Unit));
13041 -- If either type is generic, the instantiation happens within a generic
13042 -- unit, and there is nothing to check. The proper check will happen
13043 -- when the enclosing generic is instantiated.
13045 if Is_Generic_Type (Source) or else Is_Generic_Type (Target) then
13049 if Is_Private_Type (Target)
13050 and then Present (Underlying_Type (Target))
13052 Target := Underlying_Type (Target);
13055 -- Source may be unconstrained array, but not target
13057 if Is_Array_Type (Target) and then not Is_Constrained (Target) then
13059 ("unchecked conversion to unconstrained array not allowed", N);
13063 -- Warn if conversion between two different convention pointers
13065 if Is_Access_Type (Target)
13066 and then Is_Access_Type (Source)
13067 and then Convention (Target) /= Convention (Source)
13068 and then Warn_On_Unchecked_Conversion
13070 -- Give warnings for subprogram pointers only on most targets
13072 if Is_Access_Subprogram_Type (Target)
13073 or else Is_Access_Subprogram_Type (Source)
13076 ("?z?conversion between pointers with different conventions!",
13081 -- Warn if one of the operands is Ada.Calendar.Time. Do not emit a
13082 -- warning when compiling GNAT-related sources.
13084 if Warn_On_Unchecked_Conversion
13085 and then not In_Predefined_Unit (N)
13086 and then RTU_Loaded (Ada_Calendar)
13087 and then (Chars (Source) = Name_Time
13089 Chars (Target) = Name_Time)
13091 -- If Ada.Calendar is loaded and the name of one of the operands is
13092 -- Time, there is a good chance that this is Ada.Calendar.Time.
13095 Calendar_Time : constant Entity_Id := Full_View (RTE (RO_CA_Time));
13097 pragma Assert (Present (Calendar_Time));
13099 if Source = Calendar_Time or else Target = Calendar_Time then
13101 ("?z?representation of 'Time values may change between "
13102 & "'G'N'A'T versions", N);
13107 -- Make entry in unchecked conversion table for later processing by
13108 -- Validate_Unchecked_Conversions, which will check sizes and alignments
13109 -- (using values set by the back-end where possible). This is only done
13110 -- if the appropriate warning is active.
13112 if Warn_On_Unchecked_Conversion then
13113 Unchecked_Conversions.Append
13114 (New_Val => UC_Entry'(Eloc => Sloc (N),
13117 Act_Unit => Act_Unit));
13119 -- If both sizes are known statically now, then back end annotation
13120 -- is not required to do a proper check but if either size is not
13121 -- known statically, then we need the annotation.
13123 if Known_Static_RM_Size (Source)
13125 Known_Static_RM_Size (Target)
13129 Back_Annotate_Rep_Info := True;
13133 -- If unchecked conversion to access type, and access type is declared
13134 -- in the same unit as the unchecked conversion, then set the flag
13135 -- No_Strict_Aliasing (no strict aliasing is implicit here)
13137 if Is_Access_Type (Target) and then
13138 In_Same_Source_Unit (Target, N)
13140 Set_No_Strict_Aliasing (Implementation_Base_Type (Target));
13143 -- Generate N_Validate_Unchecked_Conversion node for back end in case
13144 -- the back end needs to perform special validation checks.
13146 -- Shouldn't this be in Exp_Ch13, since the check only gets done if we
13147 -- have full expansion and the back end is called ???
13150 Make_Validate_Unchecked_Conversion (Sloc (N));
13151 Set_Source_Type (Vnode, Source);
13152 Set_Target_Type (Vnode, Target);
13154 -- If the unchecked conversion node is in a list, just insert before it.
13155 -- If not we have some strange case, not worth bothering about.
13157 if Is_List_Member (N) then
13158 Insert_After (N, Vnode);
13160 end Validate_Unchecked_Conversion;
13162 ------------------------------------
13163 -- Validate_Unchecked_Conversions --
13164 ------------------------------------
13166 procedure Validate_Unchecked_Conversions is
13168 for N in Unchecked_Conversions.First .. Unchecked_Conversions.Last loop
13170 T : UC_Entry renames Unchecked_Conversions.Table (N);
13172 Eloc : constant Source_Ptr := T.Eloc;
13173 Source : constant Entity_Id := T.Source;
13174 Target : constant Entity_Id := T.Target;
13175 Act_Unit : constant Entity_Id := T.Act_Unit;
13181 -- Skip if function marked as warnings off
13183 if Warnings_Off (Act_Unit) then
13187 -- This validation check, which warns if we have unequal sizes for
13188 -- unchecked conversion, and thus potentially implementation
13189 -- dependent semantics, is one of the few occasions on which we
13190 -- use the official RM size instead of Esize. See description in
13191 -- Einfo "Handling of Type'Size Values" for details.
13193 if Serious_Errors_Detected = 0
13194 and then Known_Static_RM_Size (Source)
13195 and then Known_Static_RM_Size (Target)
13197 -- Don't do the check if warnings off for either type, note the
13198 -- deliberate use of OR here instead of OR ELSE to get the flag
13199 -- Warnings_Off_Used set for both types if appropriate.
13201 and then not (Has_Warnings_Off (Source)
13203 Has_Warnings_Off (Target))
13205 Source_Siz := RM_Size (Source);
13206 Target_Siz := RM_Size (Target);
13208 if Source_Siz /= Target_Siz then
13210 ("?z?types for unchecked conversion have different sizes!",
13213 if All_Errors_Mode then
13214 Error_Msg_Name_1 := Chars (Source);
13215 Error_Msg_Uint_1 := Source_Siz;
13216 Error_Msg_Name_2 := Chars (Target);
13217 Error_Msg_Uint_2 := Target_Siz;
13218 Error_Msg ("\size of % is ^, size of % is ^?z?", Eloc);
13220 Error_Msg_Uint_1 := UI_Abs (Source_Siz - Target_Siz);
13222 if Is_Discrete_Type (Source)
13224 Is_Discrete_Type (Target)
13226 if Source_Siz > Target_Siz then
13228 ("\?z?^ high order bits of source will "
13229 & "be ignored!", Eloc);
13231 elsif Is_Unsigned_Type (Source) then
13233 ("\?z?source will be extended with ^ high order "
13234 & "zero bits!", Eloc);
13238 ("\?z?source will be extended with ^ high order "
13239 & "sign bits!", Eloc);
13242 elsif Source_Siz < Target_Siz then
13243 if Is_Discrete_Type (Target) then
13244 if Bytes_Big_Endian then
13246 ("\?z?target value will include ^ undefined "
13247 & "low order bits!", Eloc);
13250 ("\?z?target value will include ^ undefined "
13251 & "high order bits!", Eloc);
13256 ("\?z?^ trailing bits of target value will be "
13257 & "undefined!", Eloc);
13260 else pragma Assert (Source_Siz > Target_Siz);
13262 ("\?z?^ trailing bits of source will be ignored!",
13269 -- If both types are access types, we need to check the alignment.
13270 -- If the alignment of both is specified, we can do it here.
13272 if Serious_Errors_Detected = 0
13273 and then Is_Access_Type (Source)
13274 and then Is_Access_Type (Target)
13275 and then Target_Strict_Alignment
13276 and then Present (Designated_Type (Source))
13277 and then Present (Designated_Type (Target))
13280 D_Source : constant Entity_Id := Designated_Type (Source);
13281 D_Target : constant Entity_Id := Designated_Type (Target);
13284 if Known_Alignment (D_Source)
13286 Known_Alignment (D_Target)
13289 Source_Align : constant Uint := Alignment (D_Source);
13290 Target_Align : constant Uint := Alignment (D_Target);
13293 if Source_Align < Target_Align
13294 and then not Is_Tagged_Type (D_Source)
13296 -- Suppress warning if warnings suppressed on either
13297 -- type or either designated type. Note the use of
13298 -- OR here instead of OR ELSE. That is intentional,
13299 -- we would like to set flag Warnings_Off_Used in
13300 -- all types for which warnings are suppressed.
13302 and then not (Has_Warnings_Off (D_Source)
13304 Has_Warnings_Off (D_Target)
13306 Has_Warnings_Off (Source)
13308 Has_Warnings_Off (Target))
13310 Error_Msg_Uint_1 := Target_Align;
13311 Error_Msg_Uint_2 := Source_Align;
13312 Error_Msg_Node_1 := D_Target;
13313 Error_Msg_Node_2 := D_Source;
13315 ("?z?alignment of & (^) is stricter than "
13316 & "alignment of & (^)!", Eloc);
13318 ("\?z?resulting access value may have invalid "
13319 & "alignment!", Eloc);
13330 end Validate_Unchecked_Conversions;
projects / thirdparty / gcc.git / blob