1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2011, 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 Einfo; use Einfo;
30 with Elists; use Elists;
31 with Errout; use Errout;
32 with Exp_Disp; use Exp_Disp;
33 with Exp_Tss; use Exp_Tss;
34 with Exp_Util; use Exp_Util;
36 with Lib.Xref; use Lib.Xref;
37 with Namet; use Namet;
38 with Nlists; use Nlists;
39 with Nmake; use Nmake;
41 with Restrict; use Restrict;
42 with Rident; use Rident;
43 with Rtsfind; use Rtsfind;
45 with Sem_Aux; use Sem_Aux;
46 with Sem_Ch3; use Sem_Ch3;
47 with Sem_Ch6; use Sem_Ch6;
48 with Sem_Ch8; use Sem_Ch8;
49 with Sem_Eval; use Sem_Eval;
50 with Sem_Res; use Sem_Res;
51 with Sem_Type; use Sem_Type;
52 with Sem_Util; use Sem_Util;
53 with Sem_Warn; use Sem_Warn;
54 with Sinput; use Sinput;
55 with Snames; use Snames;
56 with Stand; use Stand;
57 with Sinfo; use Sinfo;
58 with Stringt; use Stringt;
59 with Targparm; use Targparm;
60 with Ttypes; use Ttypes;
61 with Tbuild; use Tbuild;
62 with Urealp; use Urealp;
63 with Warnsw; use Warnsw;
65 with GNAT.Heap_Sort_G;
67 package body Sem_Ch13 is
69 SSU : constant Pos := System_Storage_Unit;
70 -- Convenient short hand for commonly used constant
72 -----------------------
73 -- Local Subprograms --
74 -----------------------
76 procedure Alignment_Check_For_Size_Change (Typ : Entity_Id; Size : Uint);
77 -- This routine is called after setting one of the sizes of type entity
78 -- Typ to Size. The purpose is to deal with the situation of a derived
79 -- type whose inherited alignment is no longer appropriate for the new
80 -- size value. In this case, we reset the Alignment to unknown.
82 procedure Build_Predicate_Function (Typ : Entity_Id; N : Node_Id);
83 -- If Typ has predicates (indicated by Has_Predicates being set for Typ,
84 -- then either there are pragma Invariant entries on the rep chain for the
85 -- type (note that Predicate aspects are converted to pragma Predicate), or
86 -- there are inherited aspects from a parent type, or ancestor subtypes.
87 -- This procedure builds the spec and body for the Predicate function that
88 -- tests these predicates. N is the freeze node for the type. The spec of
89 -- the function is inserted before the freeze node, and the body of the
90 -- function is inserted after the freeze node.
92 procedure Build_Static_Predicate
96 -- Given a predicated type Typ, where Typ is a discrete static subtype,
97 -- whose predicate expression is Expr, tests if Expr is a static predicate,
98 -- and if so, builds the predicate range list. Nam is the name of the one
99 -- argument to the predicate function. Occurrences of the type name in the
100 -- predicate expression have been replaced by identifier references to this
101 -- name, which is unique, so any identifier with Chars matching Nam must be
102 -- a reference to the type. If the predicate is non-static, this procedure
103 -- returns doing nothing. If the predicate is static, then the predicate
104 -- list is stored in Static_Predicate (Typ), and the Expr is rewritten as
105 -- a canonicalized membership operation.
107 function Get_Alignment_Value (Expr : Node_Id) return Uint;
108 -- Given the expression for an alignment value, returns the corresponding
109 -- Uint value. If the value is inappropriate, then error messages are
110 -- posted as required, and a value of No_Uint is returned.
112 function Is_Operational_Item (N : Node_Id) return Boolean;
113 -- A specification for a stream attribute is allowed before the full type
114 -- is declared, as explained in AI-00137 and the corrigendum. Attributes
115 -- that do not specify a representation characteristic are operational
118 procedure New_Stream_Subprogram
122 Nam : TSS_Name_Type);
123 -- Create a subprogram renaming of a given stream attribute to the
124 -- designated subprogram and then in the tagged case, provide this as a
125 -- primitive operation, or in the non-tagged case make an appropriate TSS
126 -- entry. This is more properly an expansion activity than just semantics,
127 -- but the presence of user-defined stream functions for limited types is a
128 -- legality check, which is why this takes place here rather than in
129 -- exp_ch13, where it was previously. Nam indicates the name of the TSS
130 -- function to be generated.
132 -- To avoid elaboration anomalies with freeze nodes, for untagged types
133 -- we generate both a subprogram declaration and a subprogram renaming
134 -- declaration, so that the attribute specification is handled as a
135 -- renaming_as_body. For tagged types, the specification is one of the
139 with procedure Replace_Type_Reference (N : Node_Id);
140 procedure Replace_Type_References_Generic (N : Node_Id; TName : Name_Id);
141 -- This is used to scan an expression for a predicate or invariant aspect
142 -- replacing occurrences of the name TName (the name of the subtype to
143 -- which the aspect applies) with appropriate references to the parameter
144 -- of the predicate function or invariant procedure. The procedure passed
145 -- as a generic parameter does the actual replacement of node N, which is
146 -- either a simple direct reference to TName, or a selected component that
147 -- represents an appropriately qualified occurrence of TName.
153 Biased : Boolean := True);
154 -- If Biased is True, sets Has_Biased_Representation flag for E, and
155 -- outputs a warning message at node N if Warn_On_Biased_Representation is
156 -- is True. This warning inserts the string Msg to describe the construct
159 ----------------------------------------------
160 -- Table for Validate_Unchecked_Conversions --
161 ----------------------------------------------
163 -- The following table collects unchecked conversions for validation.
164 -- Entries are made by Validate_Unchecked_Conversion and then the
165 -- call to Validate_Unchecked_Conversions does the actual error
166 -- checking and posting of warnings. The reason for this delayed
167 -- processing is to take advantage of back-annotations of size and
168 -- alignment values performed by the back end.
170 -- Note: the reason we store a Source_Ptr value instead of a Node_Id
171 -- is that by the time Validate_Unchecked_Conversions is called, Sprint
172 -- will already have modified all Sloc values if the -gnatD option is set.
174 type UC_Entry is record
175 Eloc : Source_Ptr; -- node used for posting warnings
176 Source : Entity_Id; -- source type for unchecked conversion
177 Target : Entity_Id; -- target type for unchecked conversion
180 package Unchecked_Conversions is new Table.Table (
181 Table_Component_Type => UC_Entry,
182 Table_Index_Type => Int,
183 Table_Low_Bound => 1,
185 Table_Increment => 200,
186 Table_Name => "Unchecked_Conversions");
188 ----------------------------------------
189 -- Table for Validate_Address_Clauses --
190 ----------------------------------------
192 -- If an address clause has the form
194 -- for X'Address use Expr
196 -- where Expr is of the form Y'Address or recursively is a reference
197 -- to a constant of either of these forms, and X and Y are entities of
198 -- objects, then if Y has a smaller alignment than X, that merits a
199 -- warning about possible bad alignment. The following table collects
200 -- address clauses of this kind. We put these in a table so that they
201 -- can be checked after the back end has completed annotation of the
202 -- alignments of objects, since we can catch more cases that way.
204 type Address_Clause_Check_Record is record
206 -- The address clause
209 -- The entity of the object overlaying Y
212 -- The entity of the object being overlaid
215 -- Whether the address is offset within Y
218 package Address_Clause_Checks is new Table.Table (
219 Table_Component_Type => Address_Clause_Check_Record,
220 Table_Index_Type => Int,
221 Table_Low_Bound => 1,
223 Table_Increment => 200,
224 Table_Name => "Address_Clause_Checks");
226 -----------------------------------------
227 -- Adjust_Record_For_Reverse_Bit_Order --
228 -----------------------------------------
230 procedure Adjust_Record_For_Reverse_Bit_Order (R : Entity_Id) is
235 -- Processing depends on version of Ada
237 -- For Ada 95, we just renumber bits within a storage unit. We do the
238 -- same for Ada 83 mode, since we recognize the Bit_Order attribute in
239 -- Ada 83, and are free to add this extension.
241 if Ada_Version < Ada_2005 then
242 Comp := First_Component_Or_Discriminant (R);
243 while Present (Comp) loop
244 CC := Component_Clause (Comp);
246 -- If component clause is present, then deal with the non-default
247 -- bit order case for Ada 95 mode.
249 -- We only do this processing for the base type, and in fact that
250 -- is important, since otherwise if there are record subtypes, we
251 -- could reverse the bits once for each subtype, which is wrong.
254 and then Ekind (R) = E_Record_Type
257 CFB : constant Uint := Component_Bit_Offset (Comp);
258 CSZ : constant Uint := Esize (Comp);
259 CLC : constant Node_Id := Component_Clause (Comp);
260 Pos : constant Node_Id := Position (CLC);
261 FB : constant Node_Id := First_Bit (CLC);
263 Storage_Unit_Offset : constant Uint :=
264 CFB / System_Storage_Unit;
266 Start_Bit : constant Uint :=
267 CFB mod System_Storage_Unit;
270 -- Cases where field goes over storage unit boundary
272 if Start_Bit + CSZ > System_Storage_Unit then
274 -- Allow multi-byte field but generate warning
276 if Start_Bit mod System_Storage_Unit = 0
277 and then CSZ mod System_Storage_Unit = 0
280 ("multi-byte field specified with non-standard"
281 & " Bit_Order?", CLC);
283 if Bytes_Big_Endian then
285 ("bytes are not reversed "
286 & "(component is big-endian)?", CLC);
289 ("bytes are not reversed "
290 & "(component is little-endian)?", CLC);
293 -- Do not allow non-contiguous field
297 ("attempt to specify non-contiguous field "
298 & "not permitted", CLC);
300 ("\caused by non-standard Bit_Order "
303 ("\consider possibility of using "
304 & "Ada 2005 mode here", CLC);
307 -- Case where field fits in one storage unit
310 -- Give warning if suspicious component clause
312 if Intval (FB) >= System_Storage_Unit
313 and then Warn_On_Reverse_Bit_Order
316 ("?Bit_Order clause does not affect " &
317 "byte ordering", Pos);
319 Intval (Pos) + Intval (FB) /
322 ("?position normalized to ^ before bit " &
323 "order interpreted", Pos);
326 -- Here is where we fix up the Component_Bit_Offset value
327 -- to account for the reverse bit order. Some examples of
328 -- what needs to be done are:
330 -- First_Bit .. Last_Bit Component_Bit_Offset
342 -- The rule is that the first bit is is obtained by
343 -- subtracting the old ending bit from storage_unit - 1.
345 Set_Component_Bit_Offset
347 (Storage_Unit_Offset * System_Storage_Unit) +
348 (System_Storage_Unit - 1) -
349 (Start_Bit + CSZ - 1));
351 Set_Normalized_First_Bit
353 Component_Bit_Offset (Comp) mod
354 System_Storage_Unit);
359 Next_Component_Or_Discriminant (Comp);
362 -- For Ada 2005, we do machine scalar processing, as fully described In
363 -- AI-133. This involves gathering all components which start at the
364 -- same byte offset and processing them together. Same approach is still
365 -- valid in later versions including Ada 2012.
369 Max_Machine_Scalar_Size : constant Uint :=
371 (Standard_Long_Long_Integer_Size);
372 -- We use this as the maximum machine scalar size
375 SSU : constant Uint := UI_From_Int (System_Storage_Unit);
378 -- This first loop through components does two things. First it
379 -- deals with the case of components with component clauses whose
380 -- length is greater than the maximum machine scalar size (either
381 -- accepting them or rejecting as needed). Second, it counts the
382 -- number of components with component clauses whose length does
383 -- not exceed this maximum for later processing.
386 Comp := First_Component_Or_Discriminant (R);
387 while Present (Comp) loop
388 CC := Component_Clause (Comp);
392 Fbit : constant Uint :=
393 Static_Integer (First_Bit (CC));
394 Lbit : constant Uint :=
395 Static_Integer (Last_Bit (CC));
398 -- Case of component with last bit >= max machine scalar
400 if Lbit >= Max_Machine_Scalar_Size then
402 -- This is allowed only if first bit is zero, and
403 -- last bit + 1 is a multiple of storage unit size.
405 if Fbit = 0 and then (Lbit + 1) mod SSU = 0 then
407 -- This is the case to give a warning if enabled
409 if Warn_On_Reverse_Bit_Order then
411 ("multi-byte field specified with "
412 & " non-standard Bit_Order?", CC);
414 if Bytes_Big_Endian then
416 ("\bytes are not reversed "
417 & "(component is big-endian)?", CC);
420 ("\bytes are not reversed "
421 & "(component is little-endian)?", CC);
425 -- Give error message for RM 13.4.1(10) violation
429 ("machine scalar rules not followed for&",
430 First_Bit (CC), Comp);
432 Error_Msg_Uint_1 := Lbit;
433 Error_Msg_Uint_2 := Max_Machine_Scalar_Size;
435 ("\last bit (^) exceeds maximum machine "
439 if (Lbit + 1) mod SSU /= 0 then
440 Error_Msg_Uint_1 := SSU;
442 ("\and is not a multiple of Storage_Unit (^) "
447 Error_Msg_Uint_1 := Fbit;
449 ("\and first bit (^) is non-zero "
455 -- OK case of machine scalar related component clause,
456 -- For now, just count them.
459 Num_CC := Num_CC + 1;
464 Next_Component_Or_Discriminant (Comp);
467 -- We need to sort the component clauses on the basis of the
468 -- Position values in the clause, so we can group clauses with
469 -- the same Position. together to determine the relevant machine
473 Comps : array (0 .. Num_CC) of Entity_Id;
474 -- Array to collect component and discriminant entities. The
475 -- data starts at index 1, the 0'th entry is for the sort
478 function CP_Lt (Op1, Op2 : Natural) return Boolean;
479 -- Compare routine for Sort
481 procedure CP_Move (From : Natural; To : Natural);
482 -- Move routine for Sort
484 package Sorting is new GNAT.Heap_Sort_G (CP_Move, CP_Lt);
488 -- Start and stop positions in the component list of the set of
489 -- components with the same starting position (that constitute
490 -- components in a single machine scalar).
493 -- Maximum last bit value of any component in this set
496 -- Corresponding machine scalar size
502 function CP_Lt (Op1, Op2 : Natural) return Boolean is
504 return Position (Component_Clause (Comps (Op1))) <
505 Position (Component_Clause (Comps (Op2)));
512 procedure CP_Move (From : Natural; To : Natural) is
514 Comps (To) := Comps (From);
517 -- Start of processing for Sort_CC
520 -- Collect the machine scalar relevant component clauses
523 Comp := First_Component_Or_Discriminant (R);
524 while Present (Comp) loop
526 CC : constant Node_Id := Component_Clause (Comp);
529 -- Collect only component clauses whose last bit is less
530 -- than machine scalar size. Any component clause whose
531 -- last bit exceeds this value does not take part in
532 -- machine scalar layout considerations. The test for
533 -- Error_Posted makes sure we exclude component clauses
534 -- for which we already posted an error.
537 and then not Error_Posted (Last_Bit (CC))
538 and then Static_Integer (Last_Bit (CC)) <
539 Max_Machine_Scalar_Size
541 Num_CC := Num_CC + 1;
542 Comps (Num_CC) := Comp;
546 Next_Component_Or_Discriminant (Comp);
549 -- Sort by ascending position number
551 Sorting.Sort (Num_CC);
553 -- We now have all the components whose size does not exceed
554 -- the max machine scalar value, sorted by starting position.
555 -- In this loop we gather groups of clauses starting at the
556 -- same position, to process them in accordance with AI-133.
559 while Stop < Num_CC loop
564 (Last_Bit (Component_Clause (Comps (Start))));
565 while Stop < Num_CC loop
567 (Position (Component_Clause (Comps (Stop + 1)))) =
569 (Position (Component_Clause (Comps (Stop))))
577 (Component_Clause (Comps (Stop)))));
583 -- Now we have a group of component clauses from Start to
584 -- Stop whose positions are identical, and MaxL is the
585 -- maximum last bit value of any of these components.
587 -- We need to determine the corresponding machine scalar
588 -- size. This loop assumes that machine scalar sizes are
589 -- even, and that each possible machine scalar has twice
590 -- as many bits as the next smaller one.
592 MSS := Max_Machine_Scalar_Size;
594 and then (MSS / 2) >= SSU
595 and then (MSS / 2) > MaxL
600 -- Here is where we fix up the Component_Bit_Offset value
601 -- to account for the reverse bit order. Some examples of
602 -- what needs to be done for the case of a machine scalar
605 -- First_Bit .. Last_Bit Component_Bit_Offset
617 -- The rule is that the first bit is obtained by subtracting
618 -- the old ending bit from machine scalar size - 1.
620 for C in Start .. Stop loop
622 Comp : constant Entity_Id := Comps (C);
623 CC : constant Node_Id :=
624 Component_Clause (Comp);
625 LB : constant Uint :=
626 Static_Integer (Last_Bit (CC));
627 NFB : constant Uint := MSS - Uint_1 - LB;
628 NLB : constant Uint := NFB + Esize (Comp) - 1;
629 Pos : constant Uint :=
630 Static_Integer (Position (CC));
633 if Warn_On_Reverse_Bit_Order then
634 Error_Msg_Uint_1 := MSS;
636 ("info: reverse bit order in machine " &
637 "scalar of length^?", First_Bit (CC));
638 Error_Msg_Uint_1 := NFB;
639 Error_Msg_Uint_2 := NLB;
641 if Bytes_Big_Endian then
643 ("?\info: big-endian range for "
644 & "component & is ^ .. ^",
645 First_Bit (CC), Comp);
648 ("?\info: little-endian range "
649 & "for component & is ^ .. ^",
650 First_Bit (CC), Comp);
654 Set_Component_Bit_Offset (Comp, Pos * SSU + NFB);
655 Set_Normalized_First_Bit (Comp, NFB mod SSU);
662 end Adjust_Record_For_Reverse_Bit_Order;
664 -------------------------------------
665 -- Alignment_Check_For_Size_Change --
666 -------------------------------------
668 procedure Alignment_Check_For_Size_Change (Typ : Entity_Id; Size : Uint) is
670 -- If the alignment is known, and not set by a rep clause, and is
671 -- inconsistent with the size being set, then reset it to unknown,
672 -- we assume in this case that the size overrides the inherited
673 -- alignment, and that the alignment must be recomputed.
675 if Known_Alignment (Typ)
676 and then not Has_Alignment_Clause (Typ)
677 and then Size mod (Alignment (Typ) * SSU) /= 0
679 Init_Alignment (Typ);
681 end Alignment_Check_For_Size_Change;
683 -----------------------------------
684 -- Analyze_Aspect_Specifications --
685 -----------------------------------
687 procedure Analyze_Aspect_Specifications (N : Node_Id; E : Entity_Id) is
692 L : constant List_Id := Aspect_Specifications (N);
694 Ins_Node : Node_Id := N;
695 -- Insert pragmas (except Pre/Post/Invariant/Predicate) after this node
697 -- The general processing involves building an attribute definition
698 -- clause or a pragma node that corresponds to the aspect. Then one
699 -- of two things happens:
701 -- If we are required to delay the evaluation of this aspect to the
702 -- freeze point, we attach the corresponding pragma/attribute definition
703 -- clause to the aspect specification node, which is then placed in the
704 -- Rep Item chain. In this case we mark the entity by setting the flag
705 -- Has_Delayed_Aspects and we evaluate the rep item at the freeze point.
707 -- If no delay is required, we just insert the pragma or attribute
708 -- after the declaration, and it will get processed by the normal
709 -- circuit. The From_Aspect_Specification flag is set on the pragma
710 -- or attribute definition node in either case to activate special
711 -- processing (e.g. not traversing the list of homonyms for inline).
713 Delay_Required : Boolean;
714 -- Set True if delay is required
717 pragma Assert (Present (L));
719 -- Loop through aspects
722 Aspect_Loop : while Present (Aspect) loop
724 Loc : constant Source_Ptr := Sloc (Aspect);
725 Id : constant Node_Id := Identifier (Aspect);
726 Expr : constant Node_Id := Expression (Aspect);
727 Nam : constant Name_Id := Chars (Id);
728 A_Id : constant Aspect_Id := Get_Aspect_Id (Nam);
731 Eloc : Source_Ptr := Sloc (Expr);
732 -- Source location of expression, modified when we split PPC's
734 procedure Check_False_Aspect_For_Derived_Type;
735 -- This procedure checks for the case of a false aspect for a
736 -- derived type, which improperly tries to cancel an aspect
737 -- inherited from the parent;
739 -----------------------------------------
740 -- Check_False_Aspect_For_Derived_Type --
741 -----------------------------------------
743 procedure Check_False_Aspect_For_Derived_Type is
745 -- We are only checking derived types
747 if not Is_Derived_Type (E) then
752 when Aspect_Atomic | Aspect_Shared =>
753 if not Is_Atomic (E) then
757 when Aspect_Atomic_Components =>
758 if not Has_Atomic_Components (E) then
762 when Aspect_Discard_Names =>
763 if not Discard_Names (E) then
768 if not Is_Packed (E) then
772 when Aspect_Unchecked_Union =>
773 if not Is_Unchecked_Union (E) then
777 when Aspect_Volatile =>
778 if not Is_Volatile (E) then
782 when Aspect_Volatile_Components =>
783 if not Has_Volatile_Components (E) then
791 -- Fall through means we are canceling an inherited aspect
793 Error_Msg_Name_1 := Nam;
795 ("derived type& inherits aspect%, cannot cancel", Expr, E);
796 end Check_False_Aspect_For_Derived_Type;
798 -- Start of processing for Aspect_Loop
801 -- Skip aspect if already analyzed (not clear if this is needed)
803 if Analyzed (Aspect) then
807 Set_Analyzed (Aspect);
808 Set_Entity (Aspect, E);
809 Ent := New_Occurrence_Of (E, Sloc (Id));
811 -- Check for duplicate aspect. Note that the Comes_From_Source
812 -- test allows duplicate Pre/Post's that we generate internally
813 -- to escape being flagged here.
815 if No_Duplicates_Allowed (A_Id) then
817 while Anod /= Aspect loop
819 (A_Id, Get_Aspect_Id (Chars (Identifier (Anod))))
820 and then Comes_From_Source (Aspect)
822 Error_Msg_Name_1 := Nam;
823 Error_Msg_Sloc := Sloc (Anod);
825 -- Case of same aspect specified twice
827 if Class_Present (Anod) = Class_Present (Aspect) then
828 if not Class_Present (Anod) then
830 ("aspect% for & previously given#",
834 ("aspect `%''Class` for & previously given#",
838 -- Case of Pre and Pre'Class both specified
840 elsif Nam = Name_Pre then
841 if Class_Present (Aspect) then
843 ("aspect `Pre''Class` for & is not allowed here",
846 ("\since aspect `Pre` previously given#",
851 ("aspect `Pre` for & is not allowed here",
854 ("\since aspect `Pre''Class` previously given#",
859 -- Allowed case of X and X'Class both specified
866 -- Copy expression for later processing by the procedures
867 -- Check_Aspect_At_[Freeze_Point | End_Of_Declarations]
869 Set_Entity (Id, New_Copy_Tree (Expr));
871 -- Processing based on specific aspect
875 -- No_Aspect should be impossible
880 -- Aspects taking an optional boolean argument. For all of
881 -- these we just create a matching pragma and insert it, if
882 -- the expression is missing or set to True. If the expression
883 -- is False, we can ignore the aspect with the exception that
884 -- in the case of a derived type, we must check for an illegal
885 -- attempt to cancel an inherited aspect.
887 when Boolean_Aspects =>
888 Set_Is_Boolean_Aspect (Aspect);
891 and then Is_False (Static_Boolean (Expr))
893 Check_False_Aspect_For_Derived_Type;
897 -- If True, build corresponding pragma node
901 Pragma_Argument_Associations => New_List (Ent),
903 Make_Identifier (Sloc (Id), Chars (Id)));
905 -- Never need to delay for boolean aspects
907 Delay_Required := False;
909 -- Library unit aspects. These are boolean aspects, but we
910 -- have to do special things with the insertion, since the
911 -- pragma belongs inside the declarations of a package.
913 when Library_Unit_Aspects =>
915 and then Is_False (Static_Boolean (Expr))
920 -- Build corresponding pragma node
924 Pragma_Argument_Associations => New_List (Ent),
926 Make_Identifier (Sloc (Id), Chars (Id)));
928 -- This requires special handling in the case of a package
929 -- declaration, the pragma needs to be inserted in the list
930 -- of declarations for the associated package. There is no
931 -- issue of visibility delay for these aspects.
933 if Nkind (N) = N_Package_Declaration then
934 if Nkind (Parent (N)) /= N_Compilation_Unit then
936 ("incorrect context for library unit aspect&", Id);
939 (Aitem, Visible_Declarations (Specification (N)));
945 -- If not package declaration, no delay is required
947 Delay_Required := False;
949 -- Aspects related to container iterators. These aspects denote
950 -- subprograms, and thus must be delayed.
952 when Aspect_Constant_Indexing |
953 Aspect_Variable_Indexing =>
955 if not Is_Type (E) or else not Is_Tagged_Type (E) then
956 Error_Msg_N ("indexing applies to a tagged type", N);
960 Make_Attribute_Definition_Clause (Loc,
963 Expression => Relocate_Node (Expr));
965 Delay_Required := True;
966 Set_Is_Delayed_Aspect (Aspect);
968 when Aspect_Default_Iterator |
969 Aspect_Iterator_Element =>
972 Make_Attribute_Definition_Clause (Loc,
975 Expression => Relocate_Node (Expr));
977 Delay_Required := True;
978 Set_Is_Delayed_Aspect (Aspect);
980 when Aspect_Implicit_Dereference =>
982 or else not Has_Discriminants (E)
985 ("Aspect must apply to a type with discriminants", N);
993 Disc := First_Discriminant (E);
994 while Present (Disc) loop
995 if Chars (Expr) = Chars (Disc)
996 and then Ekind (Etype (Disc)) =
997 E_Anonymous_Access_Type
999 Set_Has_Implicit_Dereference (E);
1000 Set_Has_Implicit_Dereference (Disc);
1004 Next_Discriminant (Disc);
1007 -- Error if no proper access discriminant.
1010 ("not an access discriminant of&", Expr, E);
1016 -- Aspects corresponding to attribute definition clauses
1018 when Aspect_Address |
1021 Aspect_Component_Size |
1022 Aspect_External_Tag |
1024 Aspect_Machine_Radix |
1025 Aspect_Object_Size |
1030 Aspect_Storage_Pool |
1031 Aspect_Storage_Size |
1032 Aspect_Stream_Size |
1036 -- Construct the attribute definition clause
1039 Make_Attribute_Definition_Clause (Loc,
1041 Chars => Chars (Id),
1042 Expression => Relocate_Node (Expr));
1044 -- A delay is required except in the common case where
1045 -- the expression is a literal, in which case it is fine
1046 -- to take care of it right away.
1048 if Nkind_In (Expr, N_Integer_Literal, N_String_Literal) then
1049 Delay_Required := False;
1051 Delay_Required := True;
1052 Set_Is_Delayed_Aspect (Aspect);
1055 -- Aspects corresponding to pragmas with two arguments, where
1056 -- the first argument is a local name referring to the entity,
1057 -- and the second argument is the aspect definition expression
1058 -- which is an expression that does not get analyzed.
1060 when Aspect_Suppress |
1061 Aspect_Unsuppress =>
1063 -- Construct the pragma
1067 Pragma_Argument_Associations => New_List (
1068 New_Occurrence_Of (E, Loc),
1069 Relocate_Node (Expr)),
1070 Pragma_Identifier =>
1071 Make_Identifier (Sloc (Id), Chars (Id)));
1073 -- We don't have to play the delay game here, since the only
1074 -- values are check names which don't get analyzed anyway.
1076 Delay_Required := False;
1078 -- Aspects corresponding to pragmas with two arguments, where
1079 -- the second argument is a local name referring to the entity,
1080 -- and the first argument is the aspect definition expression.
1082 when Aspect_Warnings =>
1084 -- Construct the pragma
1088 Pragma_Argument_Associations => New_List (
1089 Relocate_Node (Expr),
1090 New_Occurrence_Of (E, Loc)),
1091 Pragma_Identifier =>
1092 Make_Identifier (Sloc (Id), Chars (Id)),
1093 Class_Present => Class_Present (Aspect));
1095 -- We don't have to play the delay game here, since the only
1096 -- values are ON/OFF which don't get analyzed anyway.
1098 Delay_Required := False;
1100 -- Default_Value and Default_Component_Value aspects. These
1101 -- are specially handled because they have no corresponding
1102 -- pragmas or attributes.
1104 when Aspect_Default_Value | Aspect_Default_Component_Value =>
1105 Error_Msg_Name_1 := Chars (Id);
1107 if not Is_Type (E) then
1108 Error_Msg_N ("aspect% can only apply to a type", Id);
1111 elsif not Is_First_Subtype (E) then
1112 Error_Msg_N ("aspect% cannot apply to subtype", Id);
1115 elsif A_Id = Aspect_Default_Value
1116 and then not Is_Scalar_Type (E)
1119 ("aspect% can only be applied to scalar type", Id);
1122 elsif A_Id = Aspect_Default_Component_Value then
1123 if not Is_Array_Type (E) then
1125 ("aspect% can only be applied to array type", Id);
1127 elsif not Is_Scalar_Type (Component_Type (E)) then
1129 ("aspect% requires scalar components", Id);
1135 Delay_Required := True;
1136 Set_Is_Delayed_Aspect (Aspect);
1137 Set_Has_Default_Aspect (Base_Type (Entity (Ent)));
1139 when Aspect_Attach_Handler =>
1142 Pragma_Identifier =>
1143 Make_Identifier (Sloc (Id), Name_Attach_Handler),
1144 Pragma_Argument_Associations =>
1145 New_List (Ent, Relocate_Node (Expr)));
1147 Set_From_Aspect_Specification (Aitem, True);
1149 when Aspect_Priority | Aspect_Interrupt_Priority => declare
1153 if A_Id = Aspect_Priority then
1154 Pname := Name_Priority;
1156 Pname := Name_Interrupt_Priority;
1161 Pragma_Identifier =>
1162 Make_Identifier (Sloc (Id), Pname),
1163 Pragma_Argument_Associations =>
1164 New_List (Relocate_Node (Expr)));
1166 Set_From_Aspect_Specification (Aitem, True);
1169 -- Aspects Pre/Post generate Precondition/Postcondition pragmas
1170 -- with a first argument that is the expression, and a second
1171 -- argument that is an informative message if the test fails.
1172 -- This is inserted right after the declaration, to get the
1173 -- required pragma placement. The processing for the pragmas
1174 -- takes care of the required delay.
1176 when Pre_Post_Aspects => declare
1180 if A_Id = Aspect_Pre or else A_Id = Aspect_Precondition then
1181 Pname := Name_Precondition;
1183 Pname := Name_Postcondition;
1186 -- If the expressions is of the form A and then B, then
1187 -- we generate separate Pre/Post aspects for the separate
1188 -- clauses. Since we allow multiple pragmas, there is no
1189 -- problem in allowing multiple Pre/Post aspects internally.
1190 -- These should be treated in reverse order (B first and
1191 -- A second) since they are later inserted just after N in
1192 -- the order they are treated. This way, the pragma for A
1193 -- ends up preceding the pragma for B, which may have an
1194 -- importance for the error raised (either constraint error
1195 -- or precondition error).
1197 -- We do not do this for Pre'Class, since we have to put
1198 -- these conditions together in a complex OR expression
1200 if Pname = Name_Postcondition
1201 or else not Class_Present (Aspect)
1203 while Nkind (Expr) = N_And_Then loop
1204 Insert_After (Aspect,
1205 Make_Aspect_Specification (Sloc (Left_Opnd (Expr)),
1206 Identifier => Identifier (Aspect),
1207 Expression => Relocate_Node (Left_Opnd (Expr)),
1208 Class_Present => Class_Present (Aspect),
1209 Split_PPC => True));
1210 Rewrite (Expr, Relocate_Node (Right_Opnd (Expr)));
1211 Eloc := Sloc (Expr);
1215 -- Build the precondition/postcondition pragma
1219 Pragma_Identifier =>
1220 Make_Identifier (Sloc (Id), Pname),
1221 Class_Present => Class_Present (Aspect),
1222 Split_PPC => Split_PPC (Aspect),
1223 Pragma_Argument_Associations => New_List (
1224 Make_Pragma_Argument_Association (Eloc,
1225 Chars => Name_Check,
1226 Expression => Relocate_Node (Expr))));
1228 -- Add message unless exception messages are suppressed
1230 if not Opt.Exception_Locations_Suppressed then
1231 Append_To (Pragma_Argument_Associations (Aitem),
1232 Make_Pragma_Argument_Association (Eloc,
1233 Chars => Name_Message,
1235 Make_String_Literal (Eloc,
1237 & Get_Name_String (Pname)
1239 & Build_Location_String (Eloc))));
1242 Set_From_Aspect_Specification (Aitem, True);
1243 Set_Is_Delayed_Aspect (Aspect);
1245 -- For Pre/Post cases, insert immediately after the entity
1246 -- declaration, since that is the required pragma placement.
1247 -- Note that for these aspects, we do not have to worry
1248 -- about delay issues, since the pragmas themselves deal
1249 -- with delay of visibility for the expression analysis.
1251 -- If the entity is a library-level subprogram, the pre/
1252 -- postconditions must be treated as late pragmas.
1254 if Nkind (Parent (N)) = N_Compilation_Unit then
1255 Add_Global_Declaration (Aitem);
1257 Insert_After (N, Aitem);
1263 -- Invariant aspects generate a corresponding pragma with a
1264 -- first argument that is the entity, a second argument that is
1265 -- the expression and a third argument that is an appropriate
1266 -- message. This is inserted right after the declaration, to
1267 -- get the required pragma placement. The pragma processing
1268 -- takes care of the required delay.
1270 when Aspect_Invariant |
1271 Aspect_Type_Invariant =>
1273 -- Check placement legality
1275 if not Nkind_In (N, N_Private_Type_Declaration,
1276 N_Private_Extension_Declaration)
1279 ("invariant aspect must apply to a private type", N);
1282 -- Construct the pragma
1286 Pragma_Argument_Associations =>
1287 New_List (Ent, Relocate_Node (Expr)),
1288 Class_Present => Class_Present (Aspect),
1289 Pragma_Identifier =>
1290 Make_Identifier (Sloc (Id), Name_Invariant));
1292 -- Add message unless exception messages are suppressed
1294 if not Opt.Exception_Locations_Suppressed then
1295 Append_To (Pragma_Argument_Associations (Aitem),
1296 Make_Pragma_Argument_Association (Eloc,
1297 Chars => Name_Message,
1299 Make_String_Literal (Eloc,
1300 Strval => "failed invariant from "
1301 & Build_Location_String (Eloc))));
1304 Set_From_Aspect_Specification (Aitem, True);
1305 Set_Is_Delayed_Aspect (Aspect);
1307 -- For Invariant case, insert immediately after the entity
1308 -- declaration. We do not have to worry about delay issues
1309 -- since the pragma processing takes care of this.
1311 Insert_After (N, Aitem);
1314 -- Predicate aspects generate a corresponding pragma with a
1315 -- first argument that is the entity, and the second argument
1316 -- is the expression.
1318 when Aspect_Dynamic_Predicate |
1320 Aspect_Static_Predicate =>
1322 -- Construct the pragma (always a pragma Predicate, with
1323 -- flags recording whether it is static/dynamic).
1327 Pragma_Argument_Associations =>
1328 New_List (Ent, Relocate_Node (Expr)),
1329 Class_Present => Class_Present (Aspect),
1330 Pragma_Identifier =>
1331 Make_Identifier (Sloc (Id), Name_Predicate));
1333 Set_From_Aspect_Specification (Aitem, True);
1335 -- Set special flags for dynamic/static cases
1337 if A_Id = Aspect_Dynamic_Predicate then
1338 Set_From_Dynamic_Predicate (Aitem);
1339 elsif A_Id = Aspect_Static_Predicate then
1340 Set_From_Static_Predicate (Aitem);
1343 -- Make sure we have a freeze node (it might otherwise be
1344 -- missing in cases like subtype X is Y, and we would not
1345 -- have a place to build the predicate function).
1347 Set_Has_Predicates (E);
1349 if Is_Private_Type (E)
1350 and then Present (Full_View (E))
1352 Set_Has_Predicates (Full_View (E));
1353 Set_Has_Delayed_Aspects (Full_View (E));
1356 Ensure_Freeze_Node (E);
1357 Set_Is_Delayed_Aspect (Aspect);
1358 Delay_Required := True;
1360 when Aspect_Test_Case => declare
1362 Comp_Expr : Node_Id;
1363 Comp_Assn : Node_Id;
1368 if Nkind (Parent (N)) = N_Compilation_Unit then
1370 ("incorrect placement of aspect `Test_Case`", E);
1374 if Nkind (Expr) /= N_Aggregate then
1376 ("wrong syntax for aspect `Test_Case` for &", Id, E);
1380 Comp_Expr := First (Expressions (Expr));
1381 while Present (Comp_Expr) loop
1382 Append (Relocate_Node (Comp_Expr), Args);
1386 Comp_Assn := First (Component_Associations (Expr));
1387 while Present (Comp_Assn) loop
1388 if List_Length (Choices (Comp_Assn)) /= 1
1390 Nkind (First (Choices (Comp_Assn))) /= N_Identifier
1393 ("wrong syntax for aspect `Test_Case` for &", Id, E);
1397 Append (Make_Pragma_Argument_Association (
1398 Sloc => Sloc (Comp_Assn),
1399 Chars => Chars (First (Choices (Comp_Assn))),
1400 Expression => Relocate_Node (Expression (Comp_Assn))),
1405 -- Build the test-case pragma
1409 Pragma_Identifier =>
1410 Make_Identifier (Sloc (Id), Name_Test_Case),
1411 Pragma_Argument_Associations =>
1414 Set_From_Aspect_Specification (Aitem, True);
1415 Set_Is_Delayed_Aspect (Aspect);
1417 -- Insert immediately after the entity declaration
1419 Insert_After (N, Aitem);
1425 -- If a delay is required, we delay the freeze (not much point in
1426 -- delaying the aspect if we don't delay the freeze!). The pragma
1427 -- or attribute clause if there is one is then attached to the
1428 -- aspect specification which is placed in the rep item list.
1430 if Delay_Required then
1431 if Present (Aitem) then
1432 Set_From_Aspect_Specification (Aitem, True);
1433 Set_Is_Delayed_Aspect (Aitem);
1434 Set_Aspect_Rep_Item (Aspect, Aitem);
1437 Ensure_Freeze_Node (E);
1438 Set_Has_Delayed_Aspects (E);
1439 Record_Rep_Item (E, Aspect);
1441 -- If no delay required, insert the pragma/clause in the tree
1444 Set_From_Aspect_Specification (Aitem, True);
1446 -- If this is a compilation unit, we will put the pragma in
1447 -- the Pragmas_After list of the N_Compilation_Unit_Aux node.
1449 if Nkind (Parent (Ins_Node)) = N_Compilation_Unit then
1451 Aux : constant Node_Id :=
1452 Aux_Decls_Node (Parent (Ins_Node));
1455 pragma Assert (Nkind (Aux) = N_Compilation_Unit_Aux);
1457 if No (Pragmas_After (Aux)) then
1458 Set_Pragmas_After (Aux, Empty_List);
1461 -- For Pre_Post put at start of list, otherwise at end
1463 if A_Id in Pre_Post_Aspects then
1464 Prepend (Aitem, Pragmas_After (Aux));
1466 Append (Aitem, Pragmas_After (Aux));
1470 -- Here if not compilation unit case
1474 -- For Pre/Post cases, insert immediately after the
1475 -- entity declaration, since that is the required pragma
1478 when Pre_Post_Aspects =>
1479 Insert_After (N, Aitem);
1481 -- For Priority aspects, insert into the task or
1482 -- protected definition, which we need to create if it's
1485 when Aspect_Priority | Aspect_Interrupt_Priority =>
1487 T : Node_Id; -- the type declaration
1488 L : List_Id; -- list of decls of task/protected
1491 if Nkind (N) = N_Object_Declaration then
1492 T := Parent (Etype (Defining_Identifier (N)));
1498 if Nkind (T) = N_Protected_Type_Declaration then
1500 (Present (Protected_Definition (T)));
1502 L := Visible_Declarations
1503 (Protected_Definition (T));
1505 elsif Nkind (T) = N_Task_Type_Declaration then
1506 if No (Task_Definition (T)) then
1509 Make_Task_Definition
1511 Visible_Declarations => New_List,
1512 End_Label => Empty));
1515 L := Visible_Declarations
1516 (Task_Definition (T));
1519 raise Program_Error;
1522 Prepend (Aitem, To => L);
1525 -- For all other cases, insert in sequence
1528 Insert_After (Ins_Node, Aitem);
1537 end loop Aspect_Loop;
1538 end Analyze_Aspect_Specifications;
1540 -----------------------
1541 -- Analyze_At_Clause --
1542 -----------------------
1544 -- An at clause is replaced by the corresponding Address attribute
1545 -- definition clause that is the preferred approach in Ada 95.
1547 procedure Analyze_At_Clause (N : Node_Id) is
1548 CS : constant Boolean := Comes_From_Source (N);
1551 -- This is an obsolescent feature
1553 Check_Restriction (No_Obsolescent_Features, N);
1555 if Warn_On_Obsolescent_Feature then
1557 ("at clause is an obsolescent feature (RM J.7(2))?", N);
1559 ("\use address attribute definition clause instead?", N);
1562 -- Rewrite as address clause
1565 Make_Attribute_Definition_Clause (Sloc (N),
1566 Name => Identifier (N),
1567 Chars => Name_Address,
1568 Expression => Expression (N)));
1570 -- We preserve Comes_From_Source, since logically the clause still
1571 -- comes from the source program even though it is changed in form.
1573 Set_Comes_From_Source (N, CS);
1575 -- Analyze rewritten clause
1577 Analyze_Attribute_Definition_Clause (N);
1578 end Analyze_At_Clause;
1580 -----------------------------------------
1581 -- Analyze_Attribute_Definition_Clause --
1582 -----------------------------------------
1584 procedure Analyze_Attribute_Definition_Clause (N : Node_Id) is
1585 Loc : constant Source_Ptr := Sloc (N);
1586 Nam : constant Node_Id := Name (N);
1587 Attr : constant Name_Id := Chars (N);
1588 Expr : constant Node_Id := Expression (N);
1589 Id : constant Attribute_Id := Get_Attribute_Id (Attr);
1592 -- The entity of Nam after it is analyzed. In the case of an incomplete
1593 -- type, this is the underlying type.
1596 -- The underlying entity to which the attribute applies. Generally this
1597 -- is the Underlying_Type of Ent, except in the case where the clause
1598 -- applies to full view of incomplete type or private type in which case
1599 -- U_Ent is just a copy of Ent.
1601 FOnly : Boolean := False;
1602 -- Reset to True for subtype specific attribute (Alignment, Size)
1603 -- and for stream attributes, i.e. those cases where in the call
1604 -- to Rep_Item_Too_Late, FOnly is set True so that only the freezing
1605 -- rules are checked. Note that the case of stream attributes is not
1606 -- clear from the RM, but see AI95-00137. Also, the RM seems to
1607 -- disallow Storage_Size for derived task types, but that is also
1608 -- clearly unintentional.
1610 procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type);
1611 -- Common processing for 'Read, 'Write, 'Input and 'Output attribute
1612 -- definition clauses.
1614 function Duplicate_Clause return Boolean;
1615 -- This routine checks if the aspect for U_Ent being given by attribute
1616 -- definition clause N is for an aspect that has already been specified,
1617 -- and if so gives an error message. If there is a duplicate, True is
1618 -- returned, otherwise if there is no error, False is returned.
1620 procedure Check_Indexing_Functions;
1621 -- Check that the function in Constant_Indexing or Variable_Indexing
1622 -- attribute has the proper type structure. If the name is overloaded,
1623 -- check that all interpretations are legal.
1625 procedure Check_Iterator_Functions;
1626 -- Check that there is a single function in Default_Iterator attribute
1627 -- has the proper type structure.
1629 function Check_Primitive_Function (Subp : Entity_Id) return Boolean;
1630 -- Common legality check for the previous two
1632 -----------------------------------
1633 -- Analyze_Stream_TSS_Definition --
1634 -----------------------------------
1636 procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type) is
1637 Subp : Entity_Id := Empty;
1642 Is_Read : constant Boolean := (TSS_Nam = TSS_Stream_Read);
1643 -- True for Read attribute, false for other attributes
1645 function Has_Good_Profile (Subp : Entity_Id) return Boolean;
1646 -- Return true if the entity is a subprogram with an appropriate
1647 -- profile for the attribute being defined.
1649 ----------------------
1650 -- Has_Good_Profile --
1651 ----------------------
1653 function Has_Good_Profile (Subp : Entity_Id) return Boolean is
1655 Is_Function : constant Boolean := (TSS_Nam = TSS_Stream_Input);
1656 Expected_Ekind : constant array (Boolean) of Entity_Kind :=
1657 (False => E_Procedure, True => E_Function);
1661 if Ekind (Subp) /= Expected_Ekind (Is_Function) then
1665 F := First_Formal (Subp);
1668 or else Ekind (Etype (F)) /= E_Anonymous_Access_Type
1669 or else Designated_Type (Etype (F)) /=
1670 Class_Wide_Type (RTE (RE_Root_Stream_Type))
1675 if not Is_Function then
1679 Expected_Mode : constant array (Boolean) of Entity_Kind :=
1680 (False => E_In_Parameter,
1681 True => E_Out_Parameter);
1683 if Parameter_Mode (F) /= Expected_Mode (Is_Read) then
1691 Typ := Etype (Subp);
1694 return Base_Type (Typ) = Base_Type (Ent)
1695 and then No (Next_Formal (F));
1696 end Has_Good_Profile;
1698 -- Start of processing for Analyze_Stream_TSS_Definition
1703 if not Is_Type (U_Ent) then
1704 Error_Msg_N ("local name must be a subtype", Nam);
1708 Pnam := TSS (Base_Type (U_Ent), TSS_Nam);
1710 -- If Pnam is present, it can be either inherited from an ancestor
1711 -- type (in which case it is legal to redefine it for this type), or
1712 -- be a previous definition of the attribute for the same type (in
1713 -- which case it is illegal).
1715 -- In the first case, it will have been analyzed already, and we
1716 -- can check that its profile does not match the expected profile
1717 -- for a stream attribute of U_Ent. In the second case, either Pnam
1718 -- has been analyzed (and has the expected profile), or it has not
1719 -- been analyzed yet (case of a type that has not been frozen yet
1720 -- and for which the stream attribute has been set using Set_TSS).
1723 and then (No (First_Entity (Pnam)) or else Has_Good_Profile (Pnam))
1725 Error_Msg_Sloc := Sloc (Pnam);
1726 Error_Msg_Name_1 := Attr;
1727 Error_Msg_N ("% attribute already defined #", Nam);
1733 if Is_Entity_Name (Expr) then
1734 if not Is_Overloaded (Expr) then
1735 if Has_Good_Profile (Entity (Expr)) then
1736 Subp := Entity (Expr);
1740 Get_First_Interp (Expr, I, It);
1741 while Present (It.Nam) loop
1742 if Has_Good_Profile (It.Nam) then
1747 Get_Next_Interp (I, It);
1752 if Present (Subp) then
1753 if Is_Abstract_Subprogram (Subp) then
1754 Error_Msg_N ("stream subprogram must not be abstract", Expr);
1758 Set_Entity (Expr, Subp);
1759 Set_Etype (Expr, Etype (Subp));
1761 New_Stream_Subprogram (N, U_Ent, Subp, TSS_Nam);
1764 Error_Msg_Name_1 := Attr;
1765 Error_Msg_N ("incorrect expression for% attribute", Expr);
1767 end Analyze_Stream_TSS_Definition;
1769 ------------------------------
1770 -- Check_Indexing_Functions --
1771 ------------------------------
1773 procedure Check_Indexing_Functions is
1775 procedure Check_One_Function (Subp : Entity_Id);
1776 -- Check one possible interpretation
1778 ------------------------
1779 -- Check_One_Function --
1780 ------------------------
1782 procedure Check_One_Function (Subp : Entity_Id) is
1784 if not Check_Primitive_Function (Subp) then
1786 ("aspect Indexing requires a function that applies to type&",
1790 if not Has_Implicit_Dereference (Etype (Subp)) then
1792 ("function for indexing must return a reference type", Subp);
1794 end Check_One_Function;
1796 -- Start of processing for Check_Indexing_Functions
1805 if not Is_Overloaded (Expr) then
1806 Check_One_Function (Entity (Expr));
1814 Get_First_Interp (Expr, I, It);
1815 while Present (It.Nam) loop
1817 -- Note that analysis will have added the interpretation
1818 -- that corresponds to the dereference. We only check the
1819 -- subprogram itself.
1821 if Is_Overloadable (It.Nam) then
1822 Check_One_Function (It.Nam);
1825 Get_Next_Interp (I, It);
1829 end Check_Indexing_Functions;
1831 ------------------------------
1832 -- Check_Iterator_Functions --
1833 ------------------------------
1835 procedure Check_Iterator_Functions is
1836 Default : Entity_Id;
1838 function Valid_Default_Iterator (Subp : Entity_Id) return Boolean;
1839 -- Check one possible interpretation for validity
1841 ----------------------------
1842 -- Valid_Default_Iterator --
1843 ----------------------------
1845 function Valid_Default_Iterator (Subp : Entity_Id) return Boolean is
1849 if not Check_Primitive_Function (Subp) then
1852 Formal := First_Formal (Subp);
1855 -- False if any subsequent formal has no default expression
1857 Formal := Next_Formal (Formal);
1858 while Present (Formal) loop
1859 if No (Expression (Parent (Formal))) then
1863 Next_Formal (Formal);
1866 -- True if all subsequent formals have default expressions
1869 end Valid_Default_Iterator;
1871 -- Start of processing for Check_Iterator_Functions
1876 if not Is_Entity_Name (Expr) then
1877 Error_Msg_N ("aspect Iterator must be a function name", Expr);
1880 if not Is_Overloaded (Expr) then
1881 if not Check_Primitive_Function (Entity (Expr)) then
1883 ("aspect Indexing requires a function that applies to type&",
1884 Entity (Expr), Ent);
1887 if not Valid_Default_Iterator (Entity (Expr)) then
1888 Error_Msg_N ("improper function for default iterator", Expr);
1898 Get_First_Interp (Expr, I, It);
1899 while Present (It.Nam) loop
1900 if not Check_Primitive_Function (It.Nam)
1901 or else Valid_Default_Iterator (It.Nam)
1905 elsif Present (Default) then
1906 Error_Msg_N ("default iterator must be unique", Expr);
1912 Get_Next_Interp (I, It);
1916 if Present (Default) then
1917 Set_Entity (Expr, Default);
1918 Set_Is_Overloaded (Expr, False);
1921 end Check_Iterator_Functions;
1923 -------------------------------
1924 -- Check_Primitive_Function --
1925 -------------------------------
1927 function Check_Primitive_Function (Subp : Entity_Id) return Boolean is
1931 if Ekind (Subp) /= E_Function then
1935 if No (First_Formal (Subp)) then
1938 Ctrl := Etype (First_Formal (Subp));
1942 or else Ctrl = Class_Wide_Type (Ent)
1944 (Ekind (Ctrl) = E_Anonymous_Access_Type
1946 (Designated_Type (Ctrl) = Ent
1947 or else Designated_Type (Ctrl) = Class_Wide_Type (Ent)))
1956 end Check_Primitive_Function;
1958 ----------------------
1959 -- Duplicate_Clause --
1960 ----------------------
1962 function Duplicate_Clause return Boolean is
1966 -- Nothing to do if this attribute definition clause comes from
1967 -- an aspect specification, since we could not be duplicating an
1968 -- explicit clause, and we dealt with the case of duplicated aspects
1969 -- in Analyze_Aspect_Specifications.
1971 if From_Aspect_Specification (N) then
1975 -- Otherwise current clause may duplicate previous clause or a
1976 -- previously given aspect specification for the same aspect.
1978 A := Get_Rep_Item_For_Entity (U_Ent, Chars (N));
1981 if Entity (A) = U_Ent then
1982 Error_Msg_Name_1 := Chars (N);
1983 Error_Msg_Sloc := Sloc (A);
1984 Error_Msg_NE ("aspect% for & previously given#", N, U_Ent);
1990 end Duplicate_Clause;
1992 -- Start of processing for Analyze_Attribute_Definition_Clause
1995 -- The following code is a defense against recursion. Not clear that
1996 -- this can happen legitimately, but perhaps some error situations
1997 -- can cause it, and we did see this recursion during testing.
1999 if Analyzed (N) then
2002 Set_Analyzed (N, True);
2005 -- Process Ignore_Rep_Clauses option (we also ignore rep clauses in
2006 -- CodePeer mode, since they are not relevant in that context).
2008 if Ignore_Rep_Clauses or CodePeer_Mode then
2011 -- The following should be ignored. They do not affect legality
2012 -- and may be target dependent. The basic idea of -gnatI is to
2013 -- ignore any rep clauses that may be target dependent but do not
2014 -- affect legality (except possibly to be rejected because they
2015 -- are incompatible with the compilation target).
2017 when Attribute_Alignment |
2018 Attribute_Bit_Order |
2019 Attribute_Component_Size |
2020 Attribute_Machine_Radix |
2021 Attribute_Object_Size |
2023 Attribute_Stream_Size |
2024 Attribute_Value_Size =>
2025 Rewrite (N, Make_Null_Statement (Sloc (N)));
2028 -- We do not want too ignore 'Small in CodePeer_Mode, since it
2029 -- has an impact on the exact computations performed.
2031 -- Perhaps 'Small should also not be ignored by
2032 -- Ignore_Rep_Clauses ???
2034 when Attribute_Small =>
2035 if Ignore_Rep_Clauses then
2036 Rewrite (N, Make_Null_Statement (Sloc (N)));
2040 -- The following should not be ignored, because in the first place
2041 -- they are reasonably portable, and should not cause problems in
2042 -- compiling code from another target, and also they do affect
2043 -- legality, e.g. failing to provide a stream attribute for a
2044 -- type may make a program illegal.
2046 when Attribute_External_Tag |
2050 Attribute_Storage_Pool |
2051 Attribute_Storage_Size |
2055 -- Other cases are errors ("attribute& cannot be set with
2056 -- definition clause"), which will be caught below.
2064 Ent := Entity (Nam);
2066 if Rep_Item_Too_Early (Ent, N) then
2070 -- Rep clause applies to full view of incomplete type or private type if
2071 -- we have one (if not, this is a premature use of the type). However,
2072 -- certain semantic checks need to be done on the specified entity (i.e.
2073 -- the private view), so we save it in Ent.
2075 if Is_Private_Type (Ent)
2076 and then Is_Derived_Type (Ent)
2077 and then not Is_Tagged_Type (Ent)
2078 and then No (Full_View (Ent))
2080 -- If this is a private type whose completion is a derivation from
2081 -- another private type, there is no full view, and the attribute
2082 -- belongs to the type itself, not its underlying parent.
2086 elsif Ekind (Ent) = E_Incomplete_Type then
2088 -- The attribute applies to the full view, set the entity of the
2089 -- attribute definition accordingly.
2091 Ent := Underlying_Type (Ent);
2093 Set_Entity (Nam, Ent);
2096 U_Ent := Underlying_Type (Ent);
2099 -- Complete other routine error checks
2101 if Etype (Nam) = Any_Type then
2104 elsif Scope (Ent) /= Current_Scope then
2105 Error_Msg_N ("entity must be declared in this scope", Nam);
2108 elsif No (U_Ent) then
2111 elsif Is_Type (U_Ent)
2112 and then not Is_First_Subtype (U_Ent)
2113 and then Id /= Attribute_Object_Size
2114 and then Id /= Attribute_Value_Size
2115 and then not From_At_Mod (N)
2117 Error_Msg_N ("cannot specify attribute for subtype", Nam);
2121 Set_Entity (N, U_Ent);
2123 -- Switch on particular attribute
2131 -- Address attribute definition clause
2133 when Attribute_Address => Address : begin
2135 -- A little error check, catch for X'Address use X'Address;
2137 if Nkind (Nam) = N_Identifier
2138 and then Nkind (Expr) = N_Attribute_Reference
2139 and then Attribute_Name (Expr) = Name_Address
2140 and then Nkind (Prefix (Expr)) = N_Identifier
2141 and then Chars (Nam) = Chars (Prefix (Expr))
2144 ("address for & is self-referencing", Prefix (Expr), Ent);
2148 -- Not that special case, carry on with analysis of expression
2150 Analyze_And_Resolve (Expr, RTE (RE_Address));
2152 -- Even when ignoring rep clauses we need to indicate that the
2153 -- entity has an address clause and thus it is legal to declare
2156 if Ignore_Rep_Clauses then
2157 if Ekind_In (U_Ent, E_Variable, E_Constant) then
2158 Record_Rep_Item (U_Ent, N);
2164 if Duplicate_Clause then
2167 -- Case of address clause for subprogram
2169 elsif Is_Subprogram (U_Ent) then
2170 if Has_Homonym (U_Ent) then
2172 ("address clause cannot be given " &
2173 "for overloaded subprogram",
2178 -- For subprograms, all address clauses are permitted, and we
2179 -- mark the subprogram as having a deferred freeze so that Gigi
2180 -- will not elaborate it too soon.
2182 -- Above needs more comments, what is too soon about???
2184 Set_Has_Delayed_Freeze (U_Ent);
2186 -- Case of address clause for entry
2188 elsif Ekind (U_Ent) = E_Entry then
2189 if Nkind (Parent (N)) = N_Task_Body then
2191 ("entry address must be specified in task spec", Nam);
2195 -- For entries, we require a constant address
2197 Check_Constant_Address_Clause (Expr, U_Ent);
2199 -- Special checks for task types
2201 if Is_Task_Type (Scope (U_Ent))
2202 and then Comes_From_Source (Scope (U_Ent))
2205 ("?entry address declared for entry in task type", N);
2207 ("\?only one task can be declared of this type", N);
2210 -- Entry address clauses are obsolescent
2212 Check_Restriction (No_Obsolescent_Features, N);
2214 if Warn_On_Obsolescent_Feature then
2216 ("attaching interrupt to task entry is an " &
2217 "obsolescent feature (RM J.7.1)?", N);
2219 ("\use interrupt procedure instead?", N);
2222 -- Case of an address clause for a controlled object which we
2223 -- consider to be erroneous.
2225 elsif Is_Controlled (Etype (U_Ent))
2226 or else Has_Controlled_Component (Etype (U_Ent))
2229 ("?controlled object& must not be overlaid", Nam, U_Ent);
2231 ("\?Program_Error will be raised at run time", Nam);
2232 Insert_Action (Declaration_Node (U_Ent),
2233 Make_Raise_Program_Error (Loc,
2234 Reason => PE_Overlaid_Controlled_Object));
2237 -- Case of address clause for a (non-controlled) object
2240 Ekind (U_Ent) = E_Variable
2242 Ekind (U_Ent) = E_Constant
2245 Expr : constant Node_Id := Expression (N);
2250 -- Exported variables cannot have an address clause, because
2251 -- this cancels the effect of the pragma Export.
2253 if Is_Exported (U_Ent) then
2255 ("cannot export object with address clause", Nam);
2259 Find_Overlaid_Entity (N, O_Ent, Off);
2261 -- Overlaying controlled objects is erroneous
2264 and then (Has_Controlled_Component (Etype (O_Ent))
2265 or else Is_Controlled (Etype (O_Ent)))
2268 ("?cannot overlay with controlled object", Expr);
2270 ("\?Program_Error will be raised at run time", Expr);
2271 Insert_Action (Declaration_Node (U_Ent),
2272 Make_Raise_Program_Error (Loc,
2273 Reason => PE_Overlaid_Controlled_Object));
2276 elsif Present (O_Ent)
2277 and then Ekind (U_Ent) = E_Constant
2278 and then not Is_Constant_Object (O_Ent)
2280 Error_Msg_N ("constant overlays a variable?", Expr);
2282 elsif Present (Renamed_Object (U_Ent)) then
2284 ("address clause not allowed"
2285 & " for a renaming declaration (RM 13.1(6))", Nam);
2288 -- Imported variables can have an address clause, but then
2289 -- the import is pretty meaningless except to suppress
2290 -- initializations, so we do not need such variables to
2291 -- be statically allocated (and in fact it causes trouble
2292 -- if the address clause is a local value).
2294 elsif Is_Imported (U_Ent) then
2295 Set_Is_Statically_Allocated (U_Ent, False);
2298 -- We mark a possible modification of a variable with an
2299 -- address clause, since it is likely aliasing is occurring.
2301 Note_Possible_Modification (Nam, Sure => False);
2303 -- Here we are checking for explicit overlap of one variable
2304 -- by another, and if we find this then mark the overlapped
2305 -- variable as also being volatile to prevent unwanted
2306 -- optimizations. This is a significant pessimization so
2307 -- avoid it when there is an offset, i.e. when the object
2308 -- is composite; they cannot be optimized easily anyway.
2311 and then Is_Object (O_Ent)
2314 Set_Treat_As_Volatile (O_Ent);
2317 -- Legality checks on the address clause for initialized
2318 -- objects is deferred until the freeze point, because
2319 -- a subsequent pragma might indicate that the object is
2320 -- imported and thus not initialized.
2322 Set_Has_Delayed_Freeze (U_Ent);
2324 -- If an initialization call has been generated for this
2325 -- object, it needs to be deferred to after the freeze node
2326 -- we have just now added, otherwise GIGI will see a
2327 -- reference to the variable (as actual to the IP call)
2328 -- before its definition.
2331 Init_Call : constant Node_Id := Find_Init_Call (U_Ent, N);
2333 if Present (Init_Call) then
2335 Append_Freeze_Action (U_Ent, Init_Call);
2339 if Is_Exported (U_Ent) then
2341 ("& cannot be exported if an address clause is given",
2344 ("\define and export a variable " &
2345 "that holds its address instead",
2349 -- Entity has delayed freeze, so we will generate an
2350 -- alignment check at the freeze point unless suppressed.
2352 if not Range_Checks_Suppressed (U_Ent)
2353 and then not Alignment_Checks_Suppressed (U_Ent)
2355 Set_Check_Address_Alignment (N);
2358 -- Kill the size check code, since we are not allocating
2359 -- the variable, it is somewhere else.
2361 Kill_Size_Check_Code (U_Ent);
2363 -- If the address clause is of the form:
2365 -- for Y'Address use X'Address
2369 -- Const : constant Address := X'Address;
2371 -- for Y'Address use Const;
2373 -- then we make an entry in the table for checking the size
2374 -- and alignment of the overlaying variable. We defer this
2375 -- check till after code generation to take full advantage
2376 -- of the annotation done by the back end. This entry is
2377 -- only made if the address clause comes from source.
2379 -- If the entity has a generic type, the check will be
2380 -- performed in the instance if the actual type justifies
2381 -- it, and we do not insert the clause in the table to
2382 -- prevent spurious warnings.
2384 if Address_Clause_Overlay_Warnings
2385 and then Comes_From_Source (N)
2386 and then Present (O_Ent)
2387 and then Is_Object (O_Ent)
2389 if not Is_Generic_Type (Etype (U_Ent)) then
2390 Address_Clause_Checks.Append ((N, U_Ent, O_Ent, Off));
2393 -- If variable overlays a constant view, and we are
2394 -- warning on overlays, then mark the variable as
2395 -- overlaying a constant (we will give warnings later
2396 -- if this variable is assigned).
2398 if Is_Constant_Object (O_Ent)
2399 and then Ekind (U_Ent) = E_Variable
2401 Set_Overlays_Constant (U_Ent);
2406 -- Not a valid entity for an address clause
2409 Error_Msg_N ("address cannot be given for &", Nam);
2417 -- Alignment attribute definition clause
2419 when Attribute_Alignment => Alignment : declare
2420 Align : constant Uint := Get_Alignment_Value (Expr);
2425 if not Is_Type (U_Ent)
2426 and then Ekind (U_Ent) /= E_Variable
2427 and then Ekind (U_Ent) /= E_Constant
2429 Error_Msg_N ("alignment cannot be given for &", Nam);
2431 elsif Duplicate_Clause then
2434 elsif Align /= No_Uint then
2435 Set_Has_Alignment_Clause (U_Ent);
2436 Set_Alignment (U_Ent, Align);
2438 -- For an array type, U_Ent is the first subtype. In that case,
2439 -- also set the alignment of the anonymous base type so that
2440 -- other subtypes (such as the itypes for aggregates of the
2441 -- type) also receive the expected alignment.
2443 if Is_Array_Type (U_Ent) then
2444 Set_Alignment (Base_Type (U_Ent), Align);
2453 -- Bit_Order attribute definition clause
2455 when Attribute_Bit_Order => Bit_Order : declare
2457 if not Is_Record_Type (U_Ent) then
2459 ("Bit_Order can only be defined for record type", Nam);
2461 elsif Duplicate_Clause then
2465 Analyze_And_Resolve (Expr, RTE (RE_Bit_Order));
2467 if Etype (Expr) = Any_Type then
2470 elsif not Is_Static_Expression (Expr) then
2471 Flag_Non_Static_Expr
2472 ("Bit_Order requires static expression!", Expr);
2475 if (Expr_Value (Expr) = 0) /= Bytes_Big_Endian then
2476 Set_Reverse_Bit_Order (U_Ent, True);
2482 --------------------
2483 -- Component_Size --
2484 --------------------
2486 -- Component_Size attribute definition clause
2488 when Attribute_Component_Size => Component_Size_Case : declare
2489 Csize : constant Uint := Static_Integer (Expr);
2493 New_Ctyp : Entity_Id;
2497 if not Is_Array_Type (U_Ent) then
2498 Error_Msg_N ("component size requires array type", Nam);
2502 Btype := Base_Type (U_Ent);
2503 Ctyp := Component_Type (Btype);
2505 if Duplicate_Clause then
2508 elsif Rep_Item_Too_Early (Btype, N) then
2511 elsif Csize /= No_Uint then
2512 Check_Size (Expr, Ctyp, Csize, Biased);
2514 -- For the biased case, build a declaration for a subtype that
2515 -- will be used to represent the biased subtype that reflects
2516 -- the biased representation of components. We need the subtype
2517 -- to get proper conversions on referencing elements of the
2518 -- array. Note: component size clauses are ignored in VM mode.
2520 if VM_Target = No_VM then
2523 Make_Defining_Identifier (Loc,
2525 New_External_Name (Chars (U_Ent), 'C', 0, 'T'));
2528 Make_Subtype_Declaration (Loc,
2529 Defining_Identifier => New_Ctyp,
2530 Subtype_Indication =>
2531 New_Occurrence_Of (Component_Type (Btype), Loc));
2533 Set_Parent (Decl, N);
2534 Analyze (Decl, Suppress => All_Checks);
2536 Set_Has_Delayed_Freeze (New_Ctyp, False);
2537 Set_Esize (New_Ctyp, Csize);
2538 Set_RM_Size (New_Ctyp, Csize);
2539 Init_Alignment (New_Ctyp);
2540 Set_Is_Itype (New_Ctyp, True);
2541 Set_Associated_Node_For_Itype (New_Ctyp, U_Ent);
2543 Set_Component_Type (Btype, New_Ctyp);
2544 Set_Biased (New_Ctyp, N, "component size clause");
2547 Set_Component_Size (Btype, Csize);
2549 -- For VM case, we ignore component size clauses
2552 -- Give a warning unless we are in GNAT mode, in which case
2553 -- the warning is suppressed since it is not useful.
2555 if not GNAT_Mode then
2557 ("?component size ignored in this configuration", N);
2561 -- Deal with warning on overridden size
2563 if Warn_On_Overridden_Size
2564 and then Has_Size_Clause (Ctyp)
2565 and then RM_Size (Ctyp) /= Csize
2568 ("?component size overrides size clause for&",
2572 Set_Has_Component_Size_Clause (Btype, True);
2573 Set_Has_Non_Standard_Rep (Btype, True);
2575 end Component_Size_Case;
2577 -----------------------
2578 -- Constant_Indexing --
2579 -----------------------
2581 when Attribute_Constant_Indexing =>
2582 Check_Indexing_Functions;
2584 ----------------------
2585 -- Default_Iterator --
2586 ----------------------
2588 when Attribute_Default_Iterator => Default_Iterator : declare
2592 if not Is_Tagged_Type (U_Ent) then
2594 ("aspect Default_Iterator applies to tagged type", Nam);
2597 Check_Iterator_Functions;
2601 if not Is_Entity_Name (Expr)
2602 or else Ekind (Entity (Expr)) /= E_Function
2604 Error_Msg_N ("aspect Iterator must be a function", Expr);
2606 Func := Entity (Expr);
2609 if No (First_Formal (Func))
2610 or else Etype (First_Formal (Func)) /= U_Ent
2613 ("Default Iterator must be a primitive of&", Func, U_Ent);
2615 end Default_Iterator;
2621 when Attribute_External_Tag => External_Tag :
2623 if not Is_Tagged_Type (U_Ent) then
2624 Error_Msg_N ("should be a tagged type", Nam);
2627 if Duplicate_Clause then
2631 Analyze_And_Resolve (Expr, Standard_String);
2633 if not Is_Static_Expression (Expr) then
2634 Flag_Non_Static_Expr
2635 ("static string required for tag name!", Nam);
2638 if VM_Target = No_VM then
2639 Set_Has_External_Tag_Rep_Clause (U_Ent);
2641 Error_Msg_Name_1 := Attr;
2643 ("% attribute unsupported in this configuration", Nam);
2646 if not Is_Library_Level_Entity (U_Ent) then
2648 ("?non-unique external tag supplied for &", N, U_Ent);
2650 ("?\same external tag applies to all subprogram calls", N);
2652 ("?\corresponding internal tag cannot be obtained", N);
2657 --------------------------
2658 -- Implicit_Dereference --
2659 --------------------------
2661 when Attribute_Implicit_Dereference =>
2663 -- Legality checks already performed at the point of
2664 -- the type declaration, aspect is not delayed.
2672 when Attribute_Input =>
2673 Analyze_Stream_TSS_Definition (TSS_Stream_Input);
2674 Set_Has_Specified_Stream_Input (Ent);
2676 ----------------------
2677 -- Iterator_Element --
2678 ----------------------
2680 when Attribute_Iterator_Element =>
2683 if not Is_Entity_Name (Expr)
2684 or else not Is_Type (Entity (Expr))
2686 Error_Msg_N ("aspect Iterator_Element must be a type", Expr);
2693 -- Machine radix attribute definition clause
2695 when Attribute_Machine_Radix => Machine_Radix : declare
2696 Radix : constant Uint := Static_Integer (Expr);
2699 if not Is_Decimal_Fixed_Point_Type (U_Ent) then
2700 Error_Msg_N ("decimal fixed-point type expected for &", Nam);
2702 elsif Duplicate_Clause then
2705 elsif Radix /= No_Uint then
2706 Set_Has_Machine_Radix_Clause (U_Ent);
2707 Set_Has_Non_Standard_Rep (Base_Type (U_Ent));
2711 elsif Radix = 10 then
2712 Set_Machine_Radix_10 (U_Ent);
2714 Error_Msg_N ("machine radix value must be 2 or 10", Expr);
2723 -- Object_Size attribute definition clause
2725 when Attribute_Object_Size => Object_Size : declare
2726 Size : constant Uint := Static_Integer (Expr);
2729 pragma Warnings (Off, Biased);
2732 if not Is_Type (U_Ent) then
2733 Error_Msg_N ("Object_Size cannot be given for &", Nam);
2735 elsif Duplicate_Clause then
2739 Check_Size (Expr, U_Ent, Size, Biased);
2747 UI_Mod (Size, 64) /= 0
2750 ("Object_Size must be 8, 16, 32, or multiple of 64",
2754 Set_Esize (U_Ent, Size);
2755 Set_Has_Object_Size_Clause (U_Ent);
2756 Alignment_Check_For_Size_Change (U_Ent, Size);
2764 when Attribute_Output =>
2765 Analyze_Stream_TSS_Definition (TSS_Stream_Output);
2766 Set_Has_Specified_Stream_Output (Ent);
2772 when Attribute_Read =>
2773 Analyze_Stream_TSS_Definition (TSS_Stream_Read);
2774 Set_Has_Specified_Stream_Read (Ent);
2780 -- Size attribute definition clause
2782 when Attribute_Size => Size : declare
2783 Size : constant Uint := Static_Integer (Expr);
2790 if Duplicate_Clause then
2793 elsif not Is_Type (U_Ent)
2794 and then Ekind (U_Ent) /= E_Variable
2795 and then Ekind (U_Ent) /= E_Constant
2797 Error_Msg_N ("size cannot be given for &", Nam);
2799 elsif Is_Array_Type (U_Ent)
2800 and then not Is_Constrained (U_Ent)
2803 ("size cannot be given for unconstrained array", Nam);
2805 elsif Size /= No_Uint then
2806 if VM_Target /= No_VM and then not GNAT_Mode then
2808 -- Size clause is not handled properly on VM targets.
2809 -- Display a warning unless we are in GNAT mode, in which
2810 -- case this is useless.
2813 ("?size clauses are ignored in this configuration", N);
2816 if Is_Type (U_Ent) then
2819 Etyp := Etype (U_Ent);
2822 -- Check size, note that Gigi is in charge of checking that the
2823 -- size of an array or record type is OK. Also we do not check
2824 -- the size in the ordinary fixed-point case, since it is too
2825 -- early to do so (there may be subsequent small clause that
2826 -- affects the size). We can check the size if a small clause
2827 -- has already been given.
2829 if not Is_Ordinary_Fixed_Point_Type (U_Ent)
2830 or else Has_Small_Clause (U_Ent)
2832 Check_Size (Expr, Etyp, Size, Biased);
2833 Set_Biased (U_Ent, N, "size clause", Biased);
2836 -- For types set RM_Size and Esize if possible
2838 if Is_Type (U_Ent) then
2839 Set_RM_Size (U_Ent, Size);
2841 -- For elementary types, increase Object_Size to power of 2,
2842 -- but not less than a storage unit in any case (normally
2843 -- this means it will be byte addressable).
2845 -- For all other types, nothing else to do, we leave Esize
2846 -- (object size) unset, the back end will set it from the
2847 -- size and alignment in an appropriate manner.
2849 -- In both cases, we check whether the alignment must be
2850 -- reset in the wake of the size change.
2852 if Is_Elementary_Type (U_Ent) then
2853 if Size <= System_Storage_Unit then
2854 Init_Esize (U_Ent, System_Storage_Unit);
2855 elsif Size <= 16 then
2856 Init_Esize (U_Ent, 16);
2857 elsif Size <= 32 then
2858 Init_Esize (U_Ent, 32);
2860 Set_Esize (U_Ent, (Size + 63) / 64 * 64);
2863 Alignment_Check_For_Size_Change (U_Ent, Esize (U_Ent));
2865 Alignment_Check_For_Size_Change (U_Ent, Size);
2868 -- For objects, set Esize only
2871 if Is_Elementary_Type (Etyp) then
2872 if Size /= System_Storage_Unit
2874 Size /= System_Storage_Unit * 2
2876 Size /= System_Storage_Unit * 4
2878 Size /= System_Storage_Unit * 8
2880 Error_Msg_Uint_1 := UI_From_Int (System_Storage_Unit);
2881 Error_Msg_Uint_2 := Error_Msg_Uint_1 * 8;
2883 ("size for primitive object must be a power of 2"
2884 & " in the range ^-^", N);
2888 Set_Esize (U_Ent, Size);
2891 Set_Has_Size_Clause (U_Ent);
2899 -- Small attribute definition clause
2901 when Attribute_Small => Small : declare
2902 Implicit_Base : constant Entity_Id := Base_Type (U_Ent);
2906 Analyze_And_Resolve (Expr, Any_Real);
2908 if Etype (Expr) = Any_Type then
2911 elsif not Is_Static_Expression (Expr) then
2912 Flag_Non_Static_Expr
2913 ("small requires static expression!", Expr);
2917 Small := Expr_Value_R (Expr);
2919 if Small <= Ureal_0 then
2920 Error_Msg_N ("small value must be greater than zero", Expr);
2926 if not Is_Ordinary_Fixed_Point_Type (U_Ent) then
2928 ("small requires an ordinary fixed point type", Nam);
2930 elsif Has_Small_Clause (U_Ent) then
2931 Error_Msg_N ("small already given for &", Nam);
2933 elsif Small > Delta_Value (U_Ent) then
2935 ("small value must not be greater then delta value", Nam);
2938 Set_Small_Value (U_Ent, Small);
2939 Set_Small_Value (Implicit_Base, Small);
2940 Set_Has_Small_Clause (U_Ent);
2941 Set_Has_Small_Clause (Implicit_Base);
2942 Set_Has_Non_Standard_Rep (Implicit_Base);
2950 -- Storage_Pool attribute definition clause
2952 when Attribute_Storage_Pool => Storage_Pool : declare
2957 if Ekind (U_Ent) = E_Access_Subprogram_Type then
2959 ("storage pool cannot be given for access-to-subprogram type",
2964 Ekind_In (U_Ent, E_Access_Type, E_General_Access_Type)
2967 ("storage pool can only be given for access types", Nam);
2970 elsif Is_Derived_Type (U_Ent) then
2972 ("storage pool cannot be given for a derived access type",
2975 elsif Duplicate_Clause then
2978 elsif Present (Associated_Storage_Pool (U_Ent)) then
2979 Error_Msg_N ("storage pool already given for &", Nam);
2984 (Expr, Class_Wide_Type (RTE (RE_Root_Storage_Pool)));
2986 if not Denotes_Variable (Expr) then
2987 Error_Msg_N ("storage pool must be a variable", Expr);
2991 if Nkind (Expr) = N_Type_Conversion then
2992 T := Etype (Expression (Expr));
2997 -- The Stack_Bounded_Pool is used internally for implementing
2998 -- access types with a Storage_Size. Since it only work properly
2999 -- when used on one specific type, we need to check that it is not
3000 -- hijacked improperly:
3002 -- type T is access Integer;
3003 -- for T'Storage_Size use n;
3004 -- type Q is access Float;
3005 -- for Q'Storage_Size use T'Storage_Size; -- incorrect
3007 if RTE_Available (RE_Stack_Bounded_Pool)
3008 and then Base_Type (T) = RTE (RE_Stack_Bounded_Pool)
3010 Error_Msg_N ("non-shareable internal Pool", Expr);
3014 -- If the argument is a name that is not an entity name, then
3015 -- we construct a renaming operation to define an entity of
3016 -- type storage pool.
3018 if not Is_Entity_Name (Expr)
3019 and then Is_Object_Reference (Expr)
3021 Pool := Make_Temporary (Loc, 'P', Expr);
3024 Rnode : constant Node_Id :=
3025 Make_Object_Renaming_Declaration (Loc,
3026 Defining_Identifier => Pool,
3028 New_Occurrence_Of (Etype (Expr), Loc),
3032 Insert_Before (N, Rnode);
3034 Set_Associated_Storage_Pool (U_Ent, Pool);
3037 elsif Is_Entity_Name (Expr) then
3038 Pool := Entity (Expr);
3040 -- If pool is a renamed object, get original one. This can
3041 -- happen with an explicit renaming, and within instances.
3043 while Present (Renamed_Object (Pool))
3044 and then Is_Entity_Name (Renamed_Object (Pool))
3046 Pool := Entity (Renamed_Object (Pool));
3049 if Present (Renamed_Object (Pool))
3050 and then Nkind (Renamed_Object (Pool)) = N_Type_Conversion
3051 and then Is_Entity_Name (Expression (Renamed_Object (Pool)))
3053 Pool := Entity (Expression (Renamed_Object (Pool)));
3056 Set_Associated_Storage_Pool (U_Ent, Pool);
3058 elsif Nkind (Expr) = N_Type_Conversion
3059 and then Is_Entity_Name (Expression (Expr))
3060 and then Nkind (Original_Node (Expr)) = N_Attribute_Reference
3062 Pool := Entity (Expression (Expr));
3063 Set_Associated_Storage_Pool (U_Ent, Pool);
3066 Error_Msg_N ("incorrect reference to a Storage Pool", Expr);
3075 -- Storage_Size attribute definition clause
3077 when Attribute_Storage_Size => Storage_Size : declare
3078 Btype : constant Entity_Id := Base_Type (U_Ent);
3082 if Is_Task_Type (U_Ent) then
3083 Check_Restriction (No_Obsolescent_Features, N);
3085 if Warn_On_Obsolescent_Feature then
3087 ("storage size clause for task is an " &
3088 "obsolescent feature (RM J.9)?", N);
3089 Error_Msg_N ("\use Storage_Size pragma instead?", N);
3095 if not Is_Access_Type (U_Ent)
3096 and then Ekind (U_Ent) /= E_Task_Type
3098 Error_Msg_N ("storage size cannot be given for &", Nam);
3100 elsif Is_Access_Type (U_Ent) and Is_Derived_Type (U_Ent) then
3102 ("storage size cannot be given for a derived access type",
3105 elsif Duplicate_Clause then
3109 Analyze_And_Resolve (Expr, Any_Integer);
3111 if Is_Access_Type (U_Ent) then
3112 if Present (Associated_Storage_Pool (U_Ent)) then
3113 Error_Msg_N ("storage pool already given for &", Nam);
3117 if Is_OK_Static_Expression (Expr)
3118 and then Expr_Value (Expr) = 0
3120 Set_No_Pool_Assigned (Btype);
3123 else -- Is_Task_Type (U_Ent)
3124 Sprag := Get_Rep_Pragma (Btype, Name_Storage_Size);
3126 if Present (Sprag) then
3127 Error_Msg_Sloc := Sloc (Sprag);
3129 ("Storage_Size already specified#", Nam);
3134 Set_Has_Storage_Size_Clause (Btype);
3142 when Attribute_Stream_Size => Stream_Size : declare
3143 Size : constant Uint := Static_Integer (Expr);
3146 if Ada_Version <= Ada_95 then
3147 Check_Restriction (No_Implementation_Attributes, N);
3150 if Duplicate_Clause then
3153 elsif Is_Elementary_Type (U_Ent) then
3154 if Size /= System_Storage_Unit
3156 Size /= System_Storage_Unit * 2
3158 Size /= System_Storage_Unit * 4
3160 Size /= System_Storage_Unit * 8
3162 Error_Msg_Uint_1 := UI_From_Int (System_Storage_Unit);
3164 ("stream size for elementary type must be a"
3165 & " power of 2 and at least ^", N);
3167 elsif RM_Size (U_Ent) > Size then
3168 Error_Msg_Uint_1 := RM_Size (U_Ent);
3170 ("stream size for elementary type must be a"
3171 & " power of 2 and at least ^", N);
3174 Set_Has_Stream_Size_Clause (U_Ent);
3177 Error_Msg_N ("Stream_Size cannot be given for &", Nam);
3185 -- Value_Size attribute definition clause
3187 when Attribute_Value_Size => Value_Size : declare
3188 Size : constant Uint := Static_Integer (Expr);
3192 if not Is_Type (U_Ent) then
3193 Error_Msg_N ("Value_Size cannot be given for &", Nam);
3195 elsif Duplicate_Clause then
3198 elsif Is_Array_Type (U_Ent)
3199 and then not Is_Constrained (U_Ent)
3202 ("Value_Size cannot be given for unconstrained array", Nam);
3205 if Is_Elementary_Type (U_Ent) then
3206 Check_Size (Expr, U_Ent, Size, Biased);
3207 Set_Biased (U_Ent, N, "value size clause", Biased);
3210 Set_RM_Size (U_Ent, Size);
3214 -----------------------
3215 -- Variable_Indexing --
3216 -----------------------
3218 when Attribute_Variable_Indexing =>
3219 Check_Indexing_Functions;
3225 when Attribute_Write =>
3226 Analyze_Stream_TSS_Definition (TSS_Stream_Write);
3227 Set_Has_Specified_Stream_Write (Ent);
3229 -- All other attributes cannot be set
3233 ("attribute& cannot be set with definition clause", N);
3236 -- The test for the type being frozen must be performed after any
3237 -- expression the clause has been analyzed since the expression itself
3238 -- might cause freezing that makes the clause illegal.
3240 if Rep_Item_Too_Late (U_Ent, N, FOnly) then
3243 end Analyze_Attribute_Definition_Clause;
3245 ----------------------------
3246 -- Analyze_Code_Statement --
3247 ----------------------------
3249 procedure Analyze_Code_Statement (N : Node_Id) is
3250 HSS : constant Node_Id := Parent (N);
3251 SBody : constant Node_Id := Parent (HSS);
3252 Subp : constant Entity_Id := Current_Scope;
3259 -- Analyze and check we get right type, note that this implements the
3260 -- requirement (RM 13.8(1)) that Machine_Code be with'ed, since that
3261 -- is the only way that Asm_Insn could possibly be visible.
3263 Analyze_And_Resolve (Expression (N));
3265 if Etype (Expression (N)) = Any_Type then
3267 elsif Etype (Expression (N)) /= RTE (RE_Asm_Insn) then
3268 Error_Msg_N ("incorrect type for code statement", N);
3272 Check_Code_Statement (N);
3274 -- Make sure we appear in the handled statement sequence of a
3275 -- subprogram (RM 13.8(3)).
3277 if Nkind (HSS) /= N_Handled_Sequence_Of_Statements
3278 or else Nkind (SBody) /= N_Subprogram_Body
3281 ("code statement can only appear in body of subprogram", N);
3285 -- Do remaining checks (RM 13.8(3)) if not already done
3287 if not Is_Machine_Code_Subprogram (Subp) then
3288 Set_Is_Machine_Code_Subprogram (Subp);
3290 -- No exception handlers allowed
3292 if Present (Exception_Handlers (HSS)) then
3294 ("exception handlers not permitted in machine code subprogram",
3295 First (Exception_Handlers (HSS)));
3298 -- No declarations other than use clauses and pragmas (we allow
3299 -- certain internally generated declarations as well).
3301 Decl := First (Declarations (SBody));
3302 while Present (Decl) loop
3303 DeclO := Original_Node (Decl);
3304 if Comes_From_Source (DeclO)
3305 and not Nkind_In (DeclO, N_Pragma,
3306 N_Use_Package_Clause,
3308 N_Implicit_Label_Declaration)
3311 ("this declaration not allowed in machine code subprogram",
3318 -- No statements other than code statements, pragmas, and labels.
3319 -- Again we allow certain internally generated statements.
3321 Stmt := First (Statements (HSS));
3322 while Present (Stmt) loop
3323 StmtO := Original_Node (Stmt);
3324 if Comes_From_Source (StmtO)
3325 and then not Nkind_In (StmtO, N_Pragma,
3330 ("this statement is not allowed in machine code subprogram",
3337 end Analyze_Code_Statement;
3339 -----------------------------------------------
3340 -- Analyze_Enumeration_Representation_Clause --
3341 -----------------------------------------------
3343 procedure Analyze_Enumeration_Representation_Clause (N : Node_Id) is
3344 Ident : constant Node_Id := Identifier (N);
3345 Aggr : constant Node_Id := Array_Aggregate (N);
3346 Enumtype : Entity_Id;
3353 Err : Boolean := False;
3354 -- Set True to avoid cascade errors and crashes on incorrect source code
3356 Lo : constant Uint := Expr_Value (Type_Low_Bound (Universal_Integer));
3357 Hi : constant Uint := Expr_Value (Type_High_Bound (Universal_Integer));
3358 -- Allowed range of universal integer (= allowed range of enum lit vals)
3362 -- Minimum and maximum values of entries
3365 -- Pointer to node for literal providing max value
3368 if Ignore_Rep_Clauses then
3372 -- First some basic error checks
3375 Enumtype := Entity (Ident);
3377 if Enumtype = Any_Type
3378 or else Rep_Item_Too_Early (Enumtype, N)
3382 Enumtype := Underlying_Type (Enumtype);
3385 if not Is_Enumeration_Type (Enumtype) then
3387 ("enumeration type required, found}",
3388 Ident, First_Subtype (Enumtype));
3392 -- Ignore rep clause on generic actual type. This will already have
3393 -- been flagged on the template as an error, and this is the safest
3394 -- way to ensure we don't get a junk cascaded message in the instance.
3396 if Is_Generic_Actual_Type (Enumtype) then
3399 -- Type must be in current scope
3401 elsif Scope (Enumtype) /= Current_Scope then
3402 Error_Msg_N ("type must be declared in this scope", Ident);
3405 -- Type must be a first subtype
3407 elsif not Is_First_Subtype (Enumtype) then
3408 Error_Msg_N ("cannot give enumeration rep clause for subtype", N);
3411 -- Ignore duplicate rep clause
3413 elsif Has_Enumeration_Rep_Clause (Enumtype) then
3414 Error_Msg_N ("duplicate enumeration rep clause ignored", N);
3417 -- Don't allow rep clause for standard [wide_[wide_]]character
3419 elsif Is_Standard_Character_Type (Enumtype) then
3420 Error_Msg_N ("enumeration rep clause not allowed for this type", N);
3423 -- Check that the expression is a proper aggregate (no parentheses)
3425 elsif Paren_Count (Aggr) /= 0 then
3427 ("extra parentheses surrounding aggregate not allowed",
3431 -- All tests passed, so set rep clause in place
3434 Set_Has_Enumeration_Rep_Clause (Enumtype);
3435 Set_Has_Enumeration_Rep_Clause (Base_Type (Enumtype));
3438 -- Now we process the aggregate. Note that we don't use the normal
3439 -- aggregate code for this purpose, because we don't want any of the
3440 -- normal expansion activities, and a number of special semantic
3441 -- rules apply (including the component type being any integer type)
3443 Elit := First_Literal (Enumtype);
3445 -- First the positional entries if any
3447 if Present (Expressions (Aggr)) then
3448 Expr := First (Expressions (Aggr));
3449 while Present (Expr) loop
3451 Error_Msg_N ("too many entries in aggregate", Expr);
3455 Val := Static_Integer (Expr);
3457 -- Err signals that we found some incorrect entries processing
3458 -- the list. The final checks for completeness and ordering are
3459 -- skipped in this case.
3461 if Val = No_Uint then
3463 elsif Val < Lo or else Hi < Val then
3464 Error_Msg_N ("value outside permitted range", Expr);
3468 Set_Enumeration_Rep (Elit, Val);
3469 Set_Enumeration_Rep_Expr (Elit, Expr);
3475 -- Now process the named entries if present
3477 if Present (Component_Associations (Aggr)) then
3478 Assoc := First (Component_Associations (Aggr));
3479 while Present (Assoc) loop
3480 Choice := First (Choices (Assoc));
3482 if Present (Next (Choice)) then
3484 ("multiple choice not allowed here", Next (Choice));
3488 if Nkind (Choice) = N_Others_Choice then
3489 Error_Msg_N ("others choice not allowed here", Choice);
3492 elsif Nkind (Choice) = N_Range then
3494 -- ??? should allow zero/one element range here
3496 Error_Msg_N ("range not allowed here", Choice);
3500 Analyze_And_Resolve (Choice, Enumtype);
3502 if Error_Posted (Choice) then
3507 if Is_Entity_Name (Choice)
3508 and then Is_Type (Entity (Choice))
3510 Error_Msg_N ("subtype name not allowed here", Choice);
3513 -- ??? should allow static subtype with zero/one entry
3515 elsif Etype (Choice) = Base_Type (Enumtype) then
3516 if not Is_Static_Expression (Choice) then
3517 Flag_Non_Static_Expr
3518 ("non-static expression used for choice!", Choice);
3522 Elit := Expr_Value_E (Choice);
3524 if Present (Enumeration_Rep_Expr (Elit)) then
3526 Sloc (Enumeration_Rep_Expr (Elit));
3528 ("representation for& previously given#",
3533 Set_Enumeration_Rep_Expr (Elit, Expression (Assoc));
3535 Expr := Expression (Assoc);
3536 Val := Static_Integer (Expr);
3538 if Val = No_Uint then
3541 elsif Val < Lo or else Hi < Val then
3542 Error_Msg_N ("value outside permitted range", Expr);
3546 Set_Enumeration_Rep (Elit, Val);
3556 -- Aggregate is fully processed. Now we check that a full set of
3557 -- representations was given, and that they are in range and in order.
3558 -- These checks are only done if no other errors occurred.
3564 Elit := First_Literal (Enumtype);
3565 while Present (Elit) loop
3566 if No (Enumeration_Rep_Expr (Elit)) then
3567 Error_Msg_NE ("missing representation for&!", N, Elit);
3570 Val := Enumeration_Rep (Elit);
3572 if Min = No_Uint then
3576 if Val /= No_Uint then
3577 if Max /= No_Uint and then Val <= Max then
3579 ("enumeration value for& not ordered!",
3580 Enumeration_Rep_Expr (Elit), Elit);
3583 Max_Node := Enumeration_Rep_Expr (Elit);
3587 -- If there is at least one literal whose representation is not
3588 -- equal to the Pos value, then note that this enumeration type
3589 -- has a non-standard representation.
3591 if Val /= Enumeration_Pos (Elit) then
3592 Set_Has_Non_Standard_Rep (Base_Type (Enumtype));
3599 -- Now set proper size information
3602 Minsize : Uint := UI_From_Int (Minimum_Size (Enumtype));
3605 if Has_Size_Clause (Enumtype) then
3607 -- All OK, if size is OK now
3609 if RM_Size (Enumtype) >= Minsize then
3613 -- Try if we can get by with biasing
3616 UI_From_Int (Minimum_Size (Enumtype, Biased => True));
3618 -- Error message if even biasing does not work
3620 if RM_Size (Enumtype) < Minsize then
3621 Error_Msg_Uint_1 := RM_Size (Enumtype);
3622 Error_Msg_Uint_2 := Max;
3624 ("previously given size (^) is too small "
3625 & "for this value (^)", Max_Node);
3627 -- If biasing worked, indicate that we now have biased rep
3631 (Enumtype, Size_Clause (Enumtype), "size clause");
3636 Set_RM_Size (Enumtype, Minsize);
3637 Set_Enum_Esize (Enumtype);
3640 Set_RM_Size (Base_Type (Enumtype), RM_Size (Enumtype));
3641 Set_Esize (Base_Type (Enumtype), Esize (Enumtype));
3642 Set_Alignment (Base_Type (Enumtype), Alignment (Enumtype));
3646 -- We repeat the too late test in case it froze itself!
3648 if Rep_Item_Too_Late (Enumtype, N) then
3651 end Analyze_Enumeration_Representation_Clause;
3653 ----------------------------
3654 -- Analyze_Free_Statement --
3655 ----------------------------
3657 procedure Analyze_Free_Statement (N : Node_Id) is
3659 Analyze (Expression (N));
3660 end Analyze_Free_Statement;
3662 ---------------------------
3663 -- Analyze_Freeze_Entity --
3664 ---------------------------
3666 procedure Analyze_Freeze_Entity (N : Node_Id) is
3667 E : constant Entity_Id := Entity (N);
3670 -- Remember that we are processing a freezing entity. Required to
3671 -- ensure correct decoration of internal entities associated with
3672 -- interfaces (see New_Overloaded_Entity).
3674 Inside_Freezing_Actions := Inside_Freezing_Actions + 1;
3676 -- For tagged types covering interfaces add internal entities that link
3677 -- the primitives of the interfaces with the primitives that cover them.
3678 -- Note: These entities were originally generated only when generating
3679 -- code because their main purpose was to provide support to initialize
3680 -- the secondary dispatch tables. They are now generated also when
3681 -- compiling with no code generation to provide ASIS the relationship
3682 -- between interface primitives and tagged type primitives. They are
3683 -- also used to locate primitives covering interfaces when processing
3684 -- generics (see Derive_Subprograms).
3686 if Ada_Version >= Ada_2005
3687 and then Ekind (E) = E_Record_Type
3688 and then Is_Tagged_Type (E)
3689 and then not Is_Interface (E)
3690 and then Has_Interfaces (E)
3692 -- This would be a good common place to call the routine that checks
3693 -- overriding of interface primitives (and thus factorize calls to
3694 -- Check_Abstract_Overriding located at different contexts in the
3695 -- compiler). However, this is not possible because it causes
3696 -- spurious errors in case of late overriding.
3698 Add_Internal_Interface_Entities (E);
3703 if Ekind (E) = E_Record_Type
3704 and then Is_CPP_Class (E)
3705 and then Is_Tagged_Type (E)
3706 and then Tagged_Type_Expansion
3707 and then Expander_Active
3709 if CPP_Num_Prims (E) = 0 then
3711 -- If the CPP type has user defined components then it must import
3712 -- primitives from C++. This is required because if the C++ class
3713 -- has no primitives then the C++ compiler does not added the _tag
3714 -- component to the type.
3716 pragma Assert (Chars (First_Entity (E)) = Name_uTag);
3718 if First_Entity (E) /= Last_Entity (E) then
3720 ("?'C'P'P type must import at least one primitive from C++",
3725 -- Check that all its primitives are abstract or imported from C++.
3726 -- Check also availability of the C++ constructor.
3729 Has_Constructors : constant Boolean := Has_CPP_Constructors (E);
3731 Error_Reported : Boolean := False;
3735 Elmt := First_Elmt (Primitive_Operations (E));
3736 while Present (Elmt) loop
3737 Prim := Node (Elmt);
3739 if Comes_From_Source (Prim) then
3740 if Is_Abstract_Subprogram (Prim) then
3743 elsif not Is_Imported (Prim)
3744 or else Convention (Prim) /= Convention_CPP
3747 ("?primitives of 'C'P'P types must be imported from C++"
3748 & " or abstract", Prim);
3750 elsif not Has_Constructors
3751 and then not Error_Reported
3753 Error_Msg_Name_1 := Chars (E);
3755 ("?'C'P'P constructor required for type %", Prim);
3756 Error_Reported := True;
3765 Inside_Freezing_Actions := Inside_Freezing_Actions - 1;
3767 -- If we have a type with predicates, build predicate function
3769 if Is_Type (E) and then Has_Predicates (E) then
3770 Build_Predicate_Function (E, N);
3773 -- If type has delayed aspects, this is where we do the preanalysis at
3774 -- the freeze point, as part of the consistent visibility check. Note
3775 -- that this must be done after calling Build_Predicate_Function or
3776 -- Build_Invariant_Procedure since these subprograms fix occurrences of
3777 -- the subtype name in the saved expression so that they will not cause
3778 -- trouble in the preanalysis.
3780 if Has_Delayed_Aspects (E) then
3785 -- Look for aspect specification entries for this entity
3787 Ritem := First_Rep_Item (E);
3788 while Present (Ritem) loop
3789 if Nkind (Ritem) = N_Aspect_Specification
3790 and then Entity (Ritem) = E
3791 and then Is_Delayed_Aspect (Ritem)
3792 and then Scope (E) = Current_Scope
3794 Check_Aspect_At_Freeze_Point (Ritem);
3797 Next_Rep_Item (Ritem);
3801 end Analyze_Freeze_Entity;
3803 ------------------------------------------
3804 -- Analyze_Record_Representation_Clause --
3805 ------------------------------------------
3807 -- Note: we check as much as we can here, but we can't do any checks
3808 -- based on the position values (e.g. overlap checks) until freeze time
3809 -- because especially in Ada 2005 (machine scalar mode), the processing
3810 -- for non-standard bit order can substantially change the positions.
3811 -- See procedure Check_Record_Representation_Clause (called from Freeze)
3812 -- for the remainder of this processing.
3814 procedure Analyze_Record_Representation_Clause (N : Node_Id) is
3815 Ident : constant Node_Id := Identifier (N);
3820 Hbit : Uint := Uint_0;
3824 Rectype : Entity_Id;
3826 CR_Pragma : Node_Id := Empty;
3827 -- Points to N_Pragma node if Complete_Representation pragma present
3830 if Ignore_Rep_Clauses then
3835 Rectype := Entity (Ident);
3837 if Rectype = Any_Type
3838 or else Rep_Item_Too_Early (Rectype, N)
3842 Rectype := Underlying_Type (Rectype);
3845 -- First some basic error checks
3847 if not Is_Record_Type (Rectype) then
3849 ("record type required, found}", Ident, First_Subtype (Rectype));
3852 elsif Scope (Rectype) /= Current_Scope then
3853 Error_Msg_N ("type must be declared in this scope", N);
3856 elsif not Is_First_Subtype (Rectype) then
3857 Error_Msg_N ("cannot give record rep clause for subtype", N);
3860 elsif Has_Record_Rep_Clause (Rectype) then
3861 Error_Msg_N ("duplicate record rep clause ignored", N);
3864 elsif Rep_Item_Too_Late (Rectype, N) then
3868 if Present (Mod_Clause (N)) then
3870 Loc : constant Source_Ptr := Sloc (N);
3871 M : constant Node_Id := Mod_Clause (N);
3872 P : constant List_Id := Pragmas_Before (M);
3876 pragma Warnings (Off, Mod_Val);
3879 Check_Restriction (No_Obsolescent_Features, Mod_Clause (N));
3881 if Warn_On_Obsolescent_Feature then
3883 ("mod clause is an obsolescent feature (RM J.8)?", N);
3885 ("\use alignment attribute definition clause instead?", N);
3892 -- In ASIS_Mode mode, expansion is disabled, but we must convert
3893 -- the Mod clause into an alignment clause anyway, so that the
3894 -- back-end can compute and back-annotate properly the size and
3895 -- alignment of types that may include this record.
3897 -- This seems dubious, this destroys the source tree in a manner
3898 -- not detectable by ASIS ???
3900 if Operating_Mode = Check_Semantics
3904 Make_Attribute_Definition_Clause (Loc,
3905 Name => New_Reference_To (Base_Type (Rectype), Loc),
3906 Chars => Name_Alignment,
3907 Expression => Relocate_Node (Expression (M)));
3909 Set_From_At_Mod (AtM_Nod);
3910 Insert_After (N, AtM_Nod);
3911 Mod_Val := Get_Alignment_Value (Expression (AtM_Nod));
3912 Set_Mod_Clause (N, Empty);
3915 -- Get the alignment value to perform error checking
3917 Mod_Val := Get_Alignment_Value (Expression (M));
3922 -- For untagged types, clear any existing component clauses for the
3923 -- type. If the type is derived, this is what allows us to override
3924 -- a rep clause for the parent. For type extensions, the representation
3925 -- of the inherited components is inherited, so we want to keep previous
3926 -- component clauses for completeness.
3928 if not Is_Tagged_Type (Rectype) then
3929 Comp := First_Component_Or_Discriminant (Rectype);
3930 while Present (Comp) loop
3931 Set_Component_Clause (Comp, Empty);
3932 Next_Component_Or_Discriminant (Comp);
3936 -- All done if no component clauses
3938 CC := First (Component_Clauses (N));
3944 -- A representation like this applies to the base type
3946 Set_Has_Record_Rep_Clause (Base_Type (Rectype));
3947 Set_Has_Non_Standard_Rep (Base_Type (Rectype));
3948 Set_Has_Specified_Layout (Base_Type (Rectype));
3950 -- Process the component clauses
3952 while Present (CC) loop
3956 if Nkind (CC) = N_Pragma then
3959 -- The only pragma of interest is Complete_Representation
3961 if Pragma_Name (CC) = Name_Complete_Representation then
3965 -- Processing for real component clause
3968 Posit := Static_Integer (Position (CC));
3969 Fbit := Static_Integer (First_Bit (CC));
3970 Lbit := Static_Integer (Last_Bit (CC));
3973 and then Fbit /= No_Uint
3974 and then Lbit /= No_Uint
3978 ("position cannot be negative", Position (CC));
3982 ("first bit cannot be negative", First_Bit (CC));
3984 -- The Last_Bit specified in a component clause must not be
3985 -- less than the First_Bit minus one (RM-13.5.1(10)).
3987 elsif Lbit < Fbit - 1 then
3989 ("last bit cannot be less than first bit minus one",
3992 -- Values look OK, so find the corresponding record component
3993 -- Even though the syntax allows an attribute reference for
3994 -- implementation-defined components, GNAT does not allow the
3995 -- tag to get an explicit position.
3997 elsif Nkind (Component_Name (CC)) = N_Attribute_Reference then
3998 if Attribute_Name (Component_Name (CC)) = Name_Tag then
3999 Error_Msg_N ("position of tag cannot be specified", CC);
4001 Error_Msg_N ("illegal component name", CC);
4005 Comp := First_Entity (Rectype);
4006 while Present (Comp) loop
4007 exit when Chars (Comp) = Chars (Component_Name (CC));
4013 -- Maybe component of base type that is absent from
4014 -- statically constrained first subtype.
4016 Comp := First_Entity (Base_Type (Rectype));
4017 while Present (Comp) loop
4018 exit when Chars (Comp) = Chars (Component_Name (CC));
4025 ("component clause is for non-existent field", CC);
4027 -- Ada 2012 (AI05-0026): Any name that denotes a
4028 -- discriminant of an object of an unchecked union type
4029 -- shall not occur within a record_representation_clause.
4031 -- The general restriction of using record rep clauses on
4032 -- Unchecked_Union types has now been lifted. Since it is
4033 -- possible to introduce a record rep clause which mentions
4034 -- the discriminant of an Unchecked_Union in non-Ada 2012
4035 -- code, this check is applied to all versions of the
4038 elsif Ekind (Comp) = E_Discriminant
4039 and then Is_Unchecked_Union (Rectype)
4042 ("cannot reference discriminant of Unchecked_Union",
4043 Component_Name (CC));
4045 elsif Present (Component_Clause (Comp)) then
4047 -- Diagnose duplicate rep clause, or check consistency
4048 -- if this is an inherited component. In a double fault,
4049 -- there may be a duplicate inconsistent clause for an
4050 -- inherited component.
4052 if Scope (Original_Record_Component (Comp)) = Rectype
4053 or else Parent (Component_Clause (Comp)) = N
4055 Error_Msg_Sloc := Sloc (Component_Clause (Comp));
4056 Error_Msg_N ("component clause previously given#", CC);
4060 Rep1 : constant Node_Id := Component_Clause (Comp);
4062 if Intval (Position (Rep1)) /=
4063 Intval (Position (CC))
4064 or else Intval (First_Bit (Rep1)) /=
4065 Intval (First_Bit (CC))
4066 or else Intval (Last_Bit (Rep1)) /=
4067 Intval (Last_Bit (CC))
4069 Error_Msg_N ("component clause inconsistent "
4070 & "with representation of ancestor", CC);
4071 elsif Warn_On_Redundant_Constructs then
4072 Error_Msg_N ("?redundant component clause "
4073 & "for inherited component!", CC);
4078 -- Normal case where this is the first component clause we
4079 -- have seen for this entity, so set it up properly.
4082 -- Make reference for field in record rep clause and set
4083 -- appropriate entity field in the field identifier.
4086 (Comp, Component_Name (CC), Set_Ref => False);
4087 Set_Entity (Component_Name (CC), Comp);
4089 -- Update Fbit and Lbit to the actual bit number
4091 Fbit := Fbit + UI_From_Int (SSU) * Posit;
4092 Lbit := Lbit + UI_From_Int (SSU) * Posit;
4094 if Has_Size_Clause (Rectype)
4095 and then RM_Size (Rectype) <= Lbit
4098 ("bit number out of range of specified size",
4101 Set_Component_Clause (Comp, CC);
4102 Set_Component_Bit_Offset (Comp, Fbit);
4103 Set_Esize (Comp, 1 + (Lbit - Fbit));
4104 Set_Normalized_First_Bit (Comp, Fbit mod SSU);
4105 Set_Normalized_Position (Comp, Fbit / SSU);
4107 if Warn_On_Overridden_Size
4108 and then Has_Size_Clause (Etype (Comp))
4109 and then RM_Size (Etype (Comp)) /= Esize (Comp)
4112 ("?component size overrides size clause for&",
4113 Component_Name (CC), Etype (Comp));
4116 -- This information is also set in the corresponding
4117 -- component of the base type, found by accessing the
4118 -- Original_Record_Component link if it is present.
4120 Ocomp := Original_Record_Component (Comp);
4127 (Component_Name (CC),
4133 (Comp, First_Node (CC), "component clause", Biased);
4135 if Present (Ocomp) then
4136 Set_Component_Clause (Ocomp, CC);
4137 Set_Component_Bit_Offset (Ocomp, Fbit);
4138 Set_Normalized_First_Bit (Ocomp, Fbit mod SSU);
4139 Set_Normalized_Position (Ocomp, Fbit / SSU);
4140 Set_Esize (Ocomp, 1 + (Lbit - Fbit));
4142 Set_Normalized_Position_Max
4143 (Ocomp, Normalized_Position (Ocomp));
4145 -- Note: we don't use Set_Biased here, because we
4146 -- already gave a warning above if needed, and we
4147 -- would get a duplicate for the same name here.
4149 Set_Has_Biased_Representation
4150 (Ocomp, Has_Biased_Representation (Comp));
4153 if Esize (Comp) < 0 then
4154 Error_Msg_N ("component size is negative", CC);
4165 -- Check missing components if Complete_Representation pragma appeared
4167 if Present (CR_Pragma) then
4168 Comp := First_Component_Or_Discriminant (Rectype);
4169 while Present (Comp) loop
4170 if No (Component_Clause (Comp)) then
4172 ("missing component clause for &", CR_Pragma, Comp);
4175 Next_Component_Or_Discriminant (Comp);
4178 -- If no Complete_Representation pragma, warn if missing components
4180 elsif Warn_On_Unrepped_Components then
4182 Num_Repped_Components : Nat := 0;
4183 Num_Unrepped_Components : Nat := 0;
4186 -- First count number of repped and unrepped components
4188 Comp := First_Component_Or_Discriminant (Rectype);
4189 while Present (Comp) loop
4190 if Present (Component_Clause (Comp)) then
4191 Num_Repped_Components := Num_Repped_Components + 1;
4193 Num_Unrepped_Components := Num_Unrepped_Components + 1;
4196 Next_Component_Or_Discriminant (Comp);
4199 -- We are only interested in the case where there is at least one
4200 -- unrepped component, and at least half the components have rep
4201 -- clauses. We figure that if less than half have them, then the
4202 -- partial rep clause is really intentional. If the component
4203 -- type has no underlying type set at this point (as for a generic
4204 -- formal type), we don't know enough to give a warning on the
4207 if Num_Unrepped_Components > 0
4208 and then Num_Unrepped_Components < Num_Repped_Components
4210 Comp := First_Component_Or_Discriminant (Rectype);
4211 while Present (Comp) loop
4212 if No (Component_Clause (Comp))
4213 and then Comes_From_Source (Comp)
4214 and then Present (Underlying_Type (Etype (Comp)))
4215 and then (Is_Scalar_Type (Underlying_Type (Etype (Comp)))
4216 or else Size_Known_At_Compile_Time
4217 (Underlying_Type (Etype (Comp))))
4218 and then not Has_Warnings_Off (Rectype)
4220 Error_Msg_Sloc := Sloc (Comp);
4222 ("?no component clause given for & declared #",
4226 Next_Component_Or_Discriminant (Comp);
4231 end Analyze_Record_Representation_Clause;
4233 -------------------------------
4234 -- Build_Invariant_Procedure --
4235 -------------------------------
4237 -- The procedure that is constructed here has the form
4239 -- procedure typInvariant (Ixxx : typ) is
4241 -- pragma Check (Invariant, exp, "failed invariant from xxx");
4242 -- pragma Check (Invariant, exp, "failed invariant from xxx");
4244 -- pragma Check (Invariant, exp, "failed inherited invariant from xxx");
4246 -- end typInvariant;
4248 procedure Build_Invariant_Procedure (Typ : Entity_Id; N : Node_Id) is
4249 Loc : constant Source_Ptr := Sloc (Typ);
4256 Visible_Decls : constant List_Id := Visible_Declarations (N);
4257 Private_Decls : constant List_Id := Private_Declarations (N);
4259 procedure Add_Invariants (T : Entity_Id; Inherit : Boolean);
4260 -- Appends statements to Stmts for any invariants in the rep item chain
4261 -- of the given type. If Inherit is False, then we only process entries
4262 -- on the chain for the type Typ. If Inherit is True, then we ignore any
4263 -- Invariant aspects, but we process all Invariant'Class aspects, adding
4264 -- "inherited" to the exception message and generating an informational
4265 -- message about the inheritance of an invariant.
4267 Object_Name : constant Name_Id := New_Internal_Name ('I');
4268 -- Name for argument of invariant procedure
4270 Object_Entity : constant Node_Id :=
4271 Make_Defining_Identifier (Loc, Object_Name);
4272 -- The procedure declaration entity for the argument
4274 --------------------
4275 -- Add_Invariants --
4276 --------------------
4278 procedure Add_Invariants (T : Entity_Id; Inherit : Boolean) is
4288 procedure Replace_Type_Reference (N : Node_Id);
4289 -- Replace a single occurrence N of the subtype name with a reference
4290 -- to the formal of the predicate function. N can be an identifier
4291 -- referencing the subtype, or a selected component, representing an
4292 -- appropriately qualified occurrence of the subtype name.
4294 procedure Replace_Type_References is
4295 new Replace_Type_References_Generic (Replace_Type_Reference);
4296 -- Traverse an expression replacing all occurrences of the subtype
4297 -- name with appropriate references to the object that is the formal
4298 -- parameter of the predicate function. Note that we must ensure
4299 -- that the type and entity information is properly set in the
4300 -- replacement node, since we will do a Preanalyze call of this
4301 -- expression without proper visibility of the procedure argument.
4303 ----------------------------
4304 -- Replace_Type_Reference --
4305 ----------------------------
4307 procedure Replace_Type_Reference (N : Node_Id) is
4309 -- Invariant'Class, replace with T'Class (obj)
4311 if Class_Present (Ritem) then
4313 Make_Type_Conversion (Loc,
4315 Make_Attribute_Reference (Loc,
4316 Prefix => New_Occurrence_Of (T, Loc),
4317 Attribute_Name => Name_Class),
4318 Expression => Make_Identifier (Loc, Object_Name)));
4320 Set_Entity (Expression (N), Object_Entity);
4321 Set_Etype (Expression (N), Typ);
4323 -- Invariant, replace with obj
4326 Rewrite (N, Make_Identifier (Loc, Object_Name));
4327 Set_Entity (N, Object_Entity);
4330 end Replace_Type_Reference;
4332 -- Start of processing for Add_Invariants
4335 Ritem := First_Rep_Item (T);
4336 while Present (Ritem) loop
4337 if Nkind (Ritem) = N_Pragma
4338 and then Pragma_Name (Ritem) = Name_Invariant
4340 Arg1 := First (Pragma_Argument_Associations (Ritem));
4341 Arg2 := Next (Arg1);
4342 Arg3 := Next (Arg2);
4344 Arg1 := Get_Pragma_Arg (Arg1);
4345 Arg2 := Get_Pragma_Arg (Arg2);
4347 -- For Inherit case, ignore Invariant, process only Class case
4350 if not Class_Present (Ritem) then
4354 -- For Inherit false, process only item for right type
4357 if Entity (Arg1) /= Typ then
4363 Stmts := Empty_List;
4366 Exp := New_Copy_Tree (Arg2);
4369 -- We need to replace any occurrences of the name of the type
4370 -- with references to the object, converted to type'Class in
4371 -- the case of Invariant'Class aspects.
4373 Replace_Type_References (Exp, Chars (T));
4375 -- If this invariant comes from an aspect, find the aspect
4376 -- specification, and replace the saved expression because
4377 -- we need the subtype references replaced for the calls to
4378 -- Preanalyze_Spec_Expressin in Check_Aspect_At_Freeze_Point
4379 -- and Check_Aspect_At_End_Of_Declarations.
4381 if From_Aspect_Specification (Ritem) then
4386 -- Loop to find corresponding aspect, note that this
4387 -- must be present given the pragma is marked delayed.
4389 Aitem := Next_Rep_Item (Ritem);
4390 while Present (Aitem) loop
4391 if Nkind (Aitem) = N_Aspect_Specification
4392 and then Aspect_Rep_Item (Aitem) = Ritem
4395 (Identifier (Aitem), New_Copy_Tree (Exp));
4399 Aitem := Next_Rep_Item (Aitem);
4404 -- Now we need to preanalyze the expression to properly capture
4405 -- the visibility in the visible part. The expression will not
4406 -- be analyzed for real until the body is analyzed, but that is
4407 -- at the end of the private part and has the wrong visibility.
4409 Set_Parent (Exp, N);
4410 Preanalyze_Spec_Expression (Exp, Standard_Boolean);
4412 -- Build first two arguments for Check pragma
4415 Make_Pragma_Argument_Association (Loc,
4416 Expression => Make_Identifier (Loc, Name_Invariant)),
4417 Make_Pragma_Argument_Association (Loc, Expression => Exp));
4419 -- Add message if present in Invariant pragma
4421 if Present (Arg3) then
4422 Str := Strval (Get_Pragma_Arg (Arg3));
4424 -- If inherited case, and message starts "failed invariant",
4425 -- change it to be "failed inherited invariant".
4428 String_To_Name_Buffer (Str);
4430 if Name_Buffer (1 .. 16) = "failed invariant" then
4431 Insert_Str_In_Name_Buffer ("inherited ", 8);
4432 Str := String_From_Name_Buffer;
4437 Make_Pragma_Argument_Association (Loc,
4438 Expression => Make_String_Literal (Loc, Str)));
4441 -- Add Check pragma to list of statements
4445 Pragma_Identifier =>
4446 Make_Identifier (Loc, Name_Check),
4447 Pragma_Argument_Associations => Assoc));
4449 -- If Inherited case and option enabled, output info msg. Note
4450 -- that we know this is a case of Invariant'Class.
4452 if Inherit and Opt.List_Inherited_Aspects then
4453 Error_Msg_Sloc := Sloc (Ritem);
4455 ("?info: & inherits `Invariant''Class` aspect from #",
4461 Next_Rep_Item (Ritem);
4465 -- Start of processing for Build_Invariant_Procedure
4471 Set_Etype (Object_Entity, Typ);
4473 -- Add invariants for the current type
4475 Add_Invariants (Typ, Inherit => False);
4477 -- Add invariants for parent types
4480 Current_Typ : Entity_Id;
4481 Parent_Typ : Entity_Id;
4486 Parent_Typ := Etype (Current_Typ);
4488 if Is_Private_Type (Parent_Typ)
4489 and then Present (Full_View (Base_Type (Parent_Typ)))
4491 Parent_Typ := Full_View (Base_Type (Parent_Typ));
4494 exit when Parent_Typ = Current_Typ;
4496 Current_Typ := Parent_Typ;
4497 Add_Invariants (Current_Typ, Inherit => True);
4501 -- Build the procedure if we generated at least one Check pragma
4503 if Stmts /= No_List then
4505 -- Build procedure declaration
4508 Make_Defining_Identifier (Loc,
4509 Chars => New_External_Name (Chars (Typ), "Invariant"));
4510 Set_Has_Invariants (SId);
4511 Set_Invariant_Procedure (Typ, SId);
4514 Make_Procedure_Specification (Loc,
4515 Defining_Unit_Name => SId,
4516 Parameter_Specifications => New_List (
4517 Make_Parameter_Specification (Loc,
4518 Defining_Identifier => Object_Entity,
4519 Parameter_Type => New_Occurrence_Of (Typ, Loc))));
4521 PDecl := Make_Subprogram_Declaration (Loc, Specification => Spec);
4523 -- Build procedure body
4526 Make_Defining_Identifier (Loc,
4527 Chars => New_External_Name (Chars (Typ), "Invariant"));
4530 Make_Procedure_Specification (Loc,
4531 Defining_Unit_Name => SId,
4532 Parameter_Specifications => New_List (
4533 Make_Parameter_Specification (Loc,
4534 Defining_Identifier =>
4535 Make_Defining_Identifier (Loc, Object_Name),
4536 Parameter_Type => New_Occurrence_Of (Typ, Loc))));
4539 Make_Subprogram_Body (Loc,
4540 Specification => Spec,
4541 Declarations => Empty_List,
4542 Handled_Statement_Sequence =>
4543 Make_Handled_Sequence_Of_Statements (Loc,
4544 Statements => Stmts));
4546 -- Insert procedure declaration and spec at the appropriate points.
4547 -- Skip this if there are no private declarations (that's an error
4548 -- that will be diagnosed elsewhere, and there is no point in having
4549 -- an invariant procedure set if the full declaration is missing).
4551 if Present (Private_Decls) then
4553 -- The spec goes at the end of visible declarations, but they have
4554 -- already been analyzed, so we need to explicitly do the analyze.
4556 Append_To (Visible_Decls, PDecl);
4559 -- The body goes at the end of the private declarations, which we
4560 -- have not analyzed yet, so we do not need to perform an explicit
4561 -- analyze call. We skip this if there are no private declarations
4562 -- (this is an error that will be caught elsewhere);
4564 Append_To (Private_Decls, PBody);
4567 end Build_Invariant_Procedure;
4569 ------------------------------
4570 -- Build_Predicate_Function --
4571 ------------------------------
4573 -- The procedure that is constructed here has the form
4575 -- function typPredicate (Ixxx : typ) return Boolean is
4578 -- exp1 and then exp2 and then ...
4579 -- and then typ1Predicate (typ1 (Ixxx))
4580 -- and then typ2Predicate (typ2 (Ixxx))
4582 -- end typPredicate;
4584 -- Here exp1, and exp2 are expressions from Predicate pragmas. Note that
4585 -- this is the point at which these expressions get analyzed, providing the
4586 -- required delay, and typ1, typ2, are entities from which predicates are
4587 -- inherited. Note that we do NOT generate Check pragmas, that's because we
4588 -- use this function even if checks are off, e.g. for membership tests.
4590 procedure Build_Predicate_Function (Typ : Entity_Id; N : Node_Id) is
4591 Loc : constant Source_Ptr := Sloc (Typ);
4598 -- This is the expression for the return statement in the function. It
4599 -- is build by connecting the component predicates with AND THEN.
4601 procedure Add_Call (T : Entity_Id);
4602 -- Includes a call to the predicate function for type T in Expr if T
4603 -- has predicates and Predicate_Function (T) is non-empty.
4605 procedure Add_Predicates;
4606 -- Appends expressions for any Predicate pragmas in the rep item chain
4607 -- Typ to Expr. Note that we look only at items for this exact entity.
4608 -- Inheritance of predicates for the parent type is done by calling the
4609 -- Predicate_Function of the parent type, using Add_Call above.
4611 Object_Name : constant Name_Id := New_Internal_Name ('I');
4612 -- Name for argument of Predicate procedure
4614 Object_Entity : constant Entity_Id :=
4615 Make_Defining_Identifier (Loc, Object_Name);
4616 -- The entity for the spec entity for the argument
4618 Dynamic_Predicate_Present : Boolean := False;
4619 -- Set True if a dynamic predicate is present, results in the entire
4620 -- predicate being considered dynamic even if it looks static
4622 Static_Predicate_Present : Node_Id := Empty;
4623 -- Set to N_Pragma node for a static predicate if one is encountered.
4629 procedure Add_Call (T : Entity_Id) is
4633 if Present (T) and then Present (Predicate_Function (T)) then
4634 Set_Has_Predicates (Typ);
4636 -- Build the call to the predicate function of T
4640 (T, Convert_To (T, Make_Identifier (Loc, Object_Name)));
4642 -- Add call to evolving expression, using AND THEN if needed
4649 Left_Opnd => Relocate_Node (Expr),
4653 -- Output info message on inheritance if required. Note we do not
4654 -- give this information for generic actual types, since it is
4655 -- unwelcome noise in that case in instantiations. We also
4656 -- generally suppress the message in instantiations, and also
4657 -- if it involves internal names.
4659 if Opt.List_Inherited_Aspects
4660 and then not Is_Generic_Actual_Type (Typ)
4661 and then Instantiation_Depth (Sloc (Typ)) = 0
4662 and then not Is_Internal_Name (Chars (T))
4663 and then not Is_Internal_Name (Chars (Typ))
4665 Error_Msg_Sloc := Sloc (Predicate_Function (T));
4666 Error_Msg_Node_2 := T;
4667 Error_Msg_N ("?info: & inherits predicate from & #", Typ);
4672 --------------------
4673 -- Add_Predicates --
4674 --------------------
4676 procedure Add_Predicates is
4681 procedure Replace_Type_Reference (N : Node_Id);
4682 -- Replace a single occurrence N of the subtype name with a reference
4683 -- to the formal of the predicate function. N can be an identifier
4684 -- referencing the subtype, or a selected component, representing an
4685 -- appropriately qualified occurrence of the subtype name.
4687 procedure Replace_Type_References is
4688 new Replace_Type_References_Generic (Replace_Type_Reference);
4689 -- Traverse an expression changing every occurrence of an identifier
4690 -- whose name matches the name of the subtype with a reference to
4691 -- the formal parameter of the predicate function.
4693 ----------------------------
4694 -- Replace_Type_Reference --
4695 ----------------------------
4697 procedure Replace_Type_Reference (N : Node_Id) is
4699 Rewrite (N, Make_Identifier (Loc, Object_Name));
4700 Set_Entity (N, Object_Entity);
4702 end Replace_Type_Reference;
4704 -- Start of processing for Add_Predicates
4707 Ritem := First_Rep_Item (Typ);
4708 while Present (Ritem) loop
4709 if Nkind (Ritem) = N_Pragma
4710 and then Pragma_Name (Ritem) = Name_Predicate
4712 if From_Dynamic_Predicate (Ritem) then
4713 Dynamic_Predicate_Present := True;
4714 elsif From_Static_Predicate (Ritem) then
4715 Static_Predicate_Present := Ritem;
4718 -- Acquire arguments
4720 Arg1 := First (Pragma_Argument_Associations (Ritem));
4721 Arg2 := Next (Arg1);
4723 Arg1 := Get_Pragma_Arg (Arg1);
4724 Arg2 := Get_Pragma_Arg (Arg2);
4726 -- See if this predicate pragma is for the current type or for
4727 -- its full view. A predicate on a private completion is placed
4728 -- on the partial view beause this is the visible entity that
4731 if Entity (Arg1) = Typ
4732 or else Full_View (Entity (Arg1)) = Typ
4735 -- We have a match, this entry is for our subtype
4737 -- We need to replace any occurrences of the name of the
4738 -- type with references to the object.
4740 Replace_Type_References (Arg2, Chars (Typ));
4742 -- If this predicate comes from an aspect, find the aspect
4743 -- specification, and replace the saved expression because
4744 -- we need the subtype references replaced for the calls to
4745 -- Preanalyze_Spec_Expressin in Check_Aspect_At_Freeze_Point
4746 -- and Check_Aspect_At_End_Of_Declarations.
4748 if From_Aspect_Specification (Ritem) then
4753 -- Loop to find corresponding aspect, note that this
4754 -- must be present given the pragma is marked delayed.
4756 Aitem := Next_Rep_Item (Ritem);
4758 if Nkind (Aitem) = N_Aspect_Specification
4759 and then Aspect_Rep_Item (Aitem) = Ritem
4762 (Identifier (Aitem), New_Copy_Tree (Arg2));
4766 Aitem := Next_Rep_Item (Aitem);
4771 -- Now we can add the expression
4774 Expr := Relocate_Node (Arg2);
4776 -- There already was a predicate, so add to it
4781 Left_Opnd => Relocate_Node (Expr),
4782 Right_Opnd => Relocate_Node (Arg2));
4787 Next_Rep_Item (Ritem);
4791 -- Start of processing for Build_Predicate_Function
4794 -- Initialize for construction of statement list
4798 -- Return if already built or if type does not have predicates
4800 if not Has_Predicates (Typ)
4801 or else Present (Predicate_Function (Typ))
4806 -- Add Predicates for the current type
4810 -- Add predicates for ancestor if present
4813 Atyp : constant Entity_Id := Nearest_Ancestor (Typ);
4815 if Present (Atyp) then
4820 -- If we have predicates, build the function
4822 if Present (Expr) then
4824 -- Build function declaration
4826 pragma Assert (Has_Predicates (Typ));
4828 Make_Defining_Identifier (Loc,
4829 Chars => New_External_Name (Chars (Typ), "Predicate"));
4830 Set_Has_Predicates (SId);
4831 Set_Predicate_Function (Typ, SId);
4834 Make_Function_Specification (Loc,
4835 Defining_Unit_Name => SId,
4836 Parameter_Specifications => New_List (
4837 Make_Parameter_Specification (Loc,
4838 Defining_Identifier => Object_Entity,
4839 Parameter_Type => New_Occurrence_Of (Typ, Loc))),
4840 Result_Definition =>
4841 New_Occurrence_Of (Standard_Boolean, Loc));
4843 FDecl := Make_Subprogram_Declaration (Loc, Specification => Spec);
4845 -- Build function body
4848 Make_Defining_Identifier (Loc,
4849 Chars => New_External_Name (Chars (Typ), "Predicate"));
4852 Make_Function_Specification (Loc,
4853 Defining_Unit_Name => SId,
4854 Parameter_Specifications => New_List (
4855 Make_Parameter_Specification (Loc,
4856 Defining_Identifier =>
4857 Make_Defining_Identifier (Loc, Object_Name),
4859 New_Occurrence_Of (Typ, Loc))),
4860 Result_Definition =>
4861 New_Occurrence_Of (Standard_Boolean, Loc));
4864 Make_Subprogram_Body (Loc,
4865 Specification => Spec,
4866 Declarations => Empty_List,
4867 Handled_Statement_Sequence =>
4868 Make_Handled_Sequence_Of_Statements (Loc,
4869 Statements => New_List (
4870 Make_Simple_Return_Statement (Loc,
4871 Expression => Expr))));
4873 -- Insert declaration before freeze node and body after
4875 Insert_Before_And_Analyze (N, FDecl);
4876 Insert_After_And_Analyze (N, FBody);
4878 -- Deal with static predicate case
4880 if Ekind_In (Typ, E_Enumeration_Subtype,
4881 E_Modular_Integer_Subtype,
4882 E_Signed_Integer_Subtype)
4883 and then Is_Static_Subtype (Typ)
4884 and then not Dynamic_Predicate_Present
4886 Build_Static_Predicate (Typ, Expr, Object_Name);
4888 if Present (Static_Predicate_Present)
4889 and No (Static_Predicate (Typ))
4892 ("expression does not have required form for "
4893 & "static predicate",
4894 Next (First (Pragma_Argument_Associations
4895 (Static_Predicate_Present))));
4899 end Build_Predicate_Function;
4901 ----------------------------
4902 -- Build_Static_Predicate --
4903 ----------------------------
4905 procedure Build_Static_Predicate
4910 Loc : constant Source_Ptr := Sloc (Expr);
4912 Non_Static : exception;
4913 -- Raised if something non-static is found
4915 Btyp : constant Entity_Id := Base_Type (Typ);
4917 BLo : constant Uint := Expr_Value (Type_Low_Bound (Btyp));
4918 BHi : constant Uint := Expr_Value (Type_High_Bound (Btyp));
4919 -- Low bound and high bound value of base type of Typ
4921 TLo : constant Uint := Expr_Value (Type_Low_Bound (Typ));
4922 THi : constant Uint := Expr_Value (Type_High_Bound (Typ));
4923 -- Low bound and high bound values of static subtype Typ
4928 -- One entry in a Rlist value, a single REnt (range entry) value
4929 -- denotes one range from Lo to Hi. To represent a single value
4930 -- range Lo = Hi = value.
4932 type RList is array (Nat range <>) of REnt;
4933 -- A list of ranges. The ranges are sorted in increasing order,
4934 -- and are disjoint (there is a gap of at least one value between
4935 -- each range in the table). A value is in the set of ranges in
4936 -- Rlist if it lies within one of these ranges
4938 False_Range : constant RList :=
4939 RList'(1 .. 0 => REnt'(No_Uint, No_Uint));
4940 -- An empty set of ranges represents a range list that can never be
4941 -- satisfied, since there are no ranges in which the value could lie,
4942 -- so it does not lie in any of them. False_Range is a canonical value
4943 -- for this empty set, but general processing should test for an Rlist
4944 -- with length zero (see Is_False predicate), since other null ranges
4945 -- may appear which must be treated as False.
4947 True_Range : constant RList := RList'(1 => REnt'(BLo, BHi));
4948 -- Range representing True, value must be in the base range
4950 function "and" (Left, Right : RList) return RList;
4951 -- And's together two range lists, returning a range list. This is
4952 -- a set intersection operation.
4954 function "or" (Left, Right : RList) return RList;
4955 -- Or's together two range lists, returning a range list. This is a
4956 -- set union operation.
4958 function "not" (Right : RList) return RList;
4959 -- Returns complement of a given range list, i.e. a range list
4960 -- representing all the values in TLo .. THi that are not in the
4961 -- input operand Right.
4963 function Build_Val (V : Uint) return Node_Id;
4964 -- Return an analyzed N_Identifier node referencing this value, suitable
4965 -- for use as an entry in the Static_Predicate list. This node is typed
4966 -- with the base type.
4968 function Build_Range (Lo, Hi : Uint) return Node_Id;
4969 -- Return an analyzed N_Range node referencing this range, suitable
4970 -- for use as an entry in the Static_Predicate list. This node is typed
4971 -- with the base type.
4973 function Get_RList (Exp : Node_Id) return RList;
4974 -- This is a recursive routine that converts the given expression into
4975 -- a list of ranges, suitable for use in building the static predicate.
4977 function Is_False (R : RList) return Boolean;
4978 pragma Inline (Is_False);
4979 -- Returns True if the given range list is empty, and thus represents
4980 -- a False list of ranges that can never be satisfied.
4982 function Is_True (R : RList) return Boolean;
4983 -- Returns True if R trivially represents the True predicate by having
4984 -- a single range from BLo to BHi.
4986 function Is_Type_Ref (N : Node_Id) return Boolean;
4987 pragma Inline (Is_Type_Ref);
4988 -- Returns if True if N is a reference to the type for the predicate in
4989 -- the expression (i.e. if it is an identifier whose Chars field matches
4990 -- the Nam given in the call).
4992 function Lo_Val (N : Node_Id) return Uint;
4993 -- Given static expression or static range from a Static_Predicate list,
4994 -- gets expression value or low bound of range.
4996 function Hi_Val (N : Node_Id) return Uint;
4997 -- Given static expression or static range from a Static_Predicate list,
4998 -- gets expression value of high bound of range.
5000 function Membership_Entry (N : Node_Id) return RList;
5001 -- Given a single membership entry (range, value, or subtype), returns
5002 -- the corresponding range list. Raises Static_Error if not static.
5004 function Membership_Entries (N : Node_Id) return RList;
5005 -- Given an element on an alternatives list of a membership operation,
5006 -- returns the range list corresponding to this entry and all following
5007 -- entries (i.e. returns the "or" of this list of values).
5009 function Stat_Pred (Typ : Entity_Id) return RList;
5010 -- Given a type, if it has a static predicate, then return the predicate
5011 -- as a range list, otherwise raise Non_Static.
5017 function "and" (Left, Right : RList) return RList is
5019 -- First range of result
5021 SLeft : Nat := Left'First;
5022 -- Start of rest of left entries
5024 SRight : Nat := Right'First;
5025 -- Start of rest of right entries
5028 -- If either range is True, return the other
5030 if Is_True (Left) then
5032 elsif Is_True (Right) then
5036 -- If either range is False, return False
5038 if Is_False (Left) or else Is_False (Right) then
5042 -- Loop to remove entries at start that are disjoint, and thus
5043 -- just get discarded from the result entirely.
5046 -- If no operands left in either operand, result is false
5048 if SLeft > Left'Last or else SRight > Right'Last then
5051 -- Discard first left operand entry if disjoint with right
5053 elsif Left (SLeft).Hi < Right (SRight).Lo then
5056 -- Discard first right operand entry if disjoint with left
5058 elsif Right (SRight).Hi < Left (SLeft).Lo then
5059 SRight := SRight + 1;
5061 -- Otherwise we have an overlapping entry
5068 -- Now we have two non-null operands, and first entries overlap.
5069 -- The first entry in the result will be the overlapping part of
5070 -- these two entries.
5072 FEnt := REnt'(Lo => UI_Max (Left (SLeft).Lo, Right (SRight).Lo),
5073 Hi => UI_Min (Left (SLeft).Hi, Right (SRight).Hi));
5075 -- Now we can remove the entry that ended at a lower value, since
5076 -- its contribution is entirely contained in Fent.
5078 if Left (SLeft).Hi <= Right (SRight).Hi then
5081 SRight := SRight + 1;
5084 -- Compute result by concatenating this first entry with the "and"
5085 -- of the remaining parts of the left and right operands. Note that
5086 -- if either of these is empty, "and" will yield empty, so that we
5087 -- will end up with just Fent, which is what we want in that case.
5090 FEnt & (Left (SLeft .. Left'Last) and Right (SRight .. Right'Last));
5097 function "not" (Right : RList) return RList is
5099 -- Return True if False range
5101 if Is_False (Right) then
5105 -- Return False if True range
5107 if Is_True (Right) then
5111 -- Here if not trivial case
5114 Result : RList (1 .. Right'Length + 1);
5115 -- May need one more entry for gap at beginning and end
5118 -- Number of entries stored in Result
5123 if Right (Right'First).Lo > TLo then
5125 Result (Count) := REnt'(TLo, Right (Right'First).Lo - 1);
5128 -- Gaps between ranges
5130 for J in Right'First .. Right'Last - 1 loop
5133 REnt'(Right (J).Hi + 1, Right (J + 1).Lo - 1);
5138 if Right (Right'Last).Hi < THi then
5140 Result (Count) := REnt'(Right (Right'Last).Hi + 1, THi);
5143 return Result (1 .. Count);
5151 function "or" (Left, Right : RList) return RList is
5153 -- First range of result
5155 SLeft : Nat := Left'First;
5156 -- Start of rest of left entries
5158 SRight : Nat := Right'First;
5159 -- Start of rest of right entries
5162 -- If either range is True, return True
5164 if Is_True (Left) or else Is_True (Right) then
5168 -- If either range is False (empty), return the other
5170 if Is_False (Left) then
5172 elsif Is_False (Right) then
5176 -- Initialize result first entry from left or right operand
5177 -- depending on which starts with the lower range.
5179 if Left (SLeft).Lo < Right (SRight).Lo then
5180 FEnt := Left (SLeft);
5183 FEnt := Right (SRight);
5184 SRight := SRight + 1;
5187 -- This loop eats ranges from left and right operands that
5188 -- are contiguous with the first range we are gathering.
5191 -- Eat first entry in left operand if contiguous or
5192 -- overlapped by gathered first operand of result.
5194 if SLeft <= Left'Last
5195 and then Left (SLeft).Lo <= FEnt.Hi + 1
5197 FEnt.Hi := UI_Max (FEnt.Hi, Left (SLeft).Hi);
5200 -- Eat first entry in right operand if contiguous or
5201 -- overlapped by gathered right operand of result.
5203 elsif SRight <= Right'Last
5204 and then Right (SRight).Lo <= FEnt.Hi + 1
5206 FEnt.Hi := UI_Max (FEnt.Hi, Right (SRight).Hi);
5207 SRight := SRight + 1;
5209 -- All done if no more entries to eat!
5216 -- Obtain result as the first entry we just computed, concatenated
5217 -- to the "or" of the remaining results (if one operand is empty,
5218 -- this will just concatenate with the other
5221 FEnt & (Left (SLeft .. Left'Last) or Right (SRight .. Right'Last));
5228 function Build_Range (Lo, Hi : Uint) return Node_Id is
5232 return Build_Val (Hi);
5236 Low_Bound => Build_Val (Lo),
5237 High_Bound => Build_Val (Hi));
5238 Set_Etype (Result, Btyp);
5239 Set_Analyzed (Result);
5248 function Build_Val (V : Uint) return Node_Id is
5252 if Is_Enumeration_Type (Typ) then
5253 Result := Get_Enum_Lit_From_Pos (Typ, V, Loc);
5255 Result := Make_Integer_Literal (Loc, V);
5258 Set_Etype (Result, Btyp);
5259 Set_Is_Static_Expression (Result);
5260 Set_Analyzed (Result);
5268 function Get_RList (Exp : Node_Id) return RList is
5273 -- Static expression can only be true or false
5275 if Is_OK_Static_Expression (Exp) then
5279 if Expr_Value (Exp) = 0 then
5286 -- Otherwise test node type
5294 when N_Op_And | N_And_Then =>
5295 return Get_RList (Left_Opnd (Exp))
5297 Get_RList (Right_Opnd (Exp));
5301 when N_Op_Or | N_Or_Else =>
5302 return Get_RList (Left_Opnd (Exp))
5304 Get_RList (Right_Opnd (Exp));
5309 return not Get_RList (Right_Opnd (Exp));
5311 -- Comparisons of type with static value
5313 when N_Op_Compare =>
5314 -- Type is left operand
5316 if Is_Type_Ref (Left_Opnd (Exp))
5317 and then Is_OK_Static_Expression (Right_Opnd (Exp))
5319 Val := Expr_Value (Right_Opnd (Exp));
5321 -- Typ is right operand
5323 elsif Is_Type_Ref (Right_Opnd (Exp))
5324 and then Is_OK_Static_Expression (Left_Opnd (Exp))
5326 Val := Expr_Value (Left_Opnd (Exp));
5328 -- Invert sense of comparison
5331 when N_Op_Gt => Op := N_Op_Lt;
5332 when N_Op_Lt => Op := N_Op_Gt;
5333 when N_Op_Ge => Op := N_Op_Le;
5334 when N_Op_Le => Op := N_Op_Ge;
5335 when others => null;
5338 -- Other cases are non-static
5344 -- Construct range according to comparison operation
5348 return RList'(1 => REnt'(Val, Val));
5351 return RList'(1 => REnt'(Val, BHi));
5354 return RList'(1 => REnt'(Val + 1, BHi));
5357 return RList'(1 => REnt'(BLo, Val));
5360 return RList'(1 => REnt'(BLo, Val - 1));
5363 return RList'(REnt'(BLo, Val - 1),
5364 REnt'(Val + 1, BHi));
5367 raise Program_Error;
5373 if not Is_Type_Ref (Left_Opnd (Exp)) then
5377 if Present (Right_Opnd (Exp)) then
5378 return Membership_Entry (Right_Opnd (Exp));
5380 return Membership_Entries (First (Alternatives (Exp)));
5383 -- Negative membership (NOT IN)
5386 if not Is_Type_Ref (Left_Opnd (Exp)) then
5390 if Present (Right_Opnd (Exp)) then
5391 return not Membership_Entry (Right_Opnd (Exp));
5393 return not Membership_Entries (First (Alternatives (Exp)));
5396 -- Function call, may be call to static predicate
5398 when N_Function_Call =>
5399 if Is_Entity_Name (Name (Exp)) then
5401 Ent : constant Entity_Id := Entity (Name (Exp));
5403 if Has_Predicates (Ent) then
5404 return Stat_Pred (Etype (First_Formal (Ent)));
5409 -- Other function call cases are non-static
5413 -- Qualified expression, dig out the expression
5415 when N_Qualified_Expression =>
5416 return Get_RList (Expression (Exp));
5421 return (Get_RList (Left_Opnd (Exp))
5422 and not Get_RList (Right_Opnd (Exp)))
5423 or (Get_RList (Right_Opnd (Exp))
5424 and not Get_RList (Left_Opnd (Exp)));
5426 -- Any other node type is non-static
5437 function Hi_Val (N : Node_Id) return Uint is
5439 if Is_Static_Expression (N) then
5440 return Expr_Value (N);
5442 pragma Assert (Nkind (N) = N_Range);
5443 return Expr_Value (High_Bound (N));
5451 function Is_False (R : RList) return Boolean is
5453 return R'Length = 0;
5460 function Is_True (R : RList) return Boolean is
5463 and then R (R'First).Lo = BLo
5464 and then R (R'First).Hi = BHi;
5471 function Is_Type_Ref (N : Node_Id) return Boolean is
5473 return Nkind (N) = N_Identifier and then Chars (N) = Nam;
5480 function Lo_Val (N : Node_Id) return Uint is
5482 if Is_Static_Expression (N) then
5483 return Expr_Value (N);
5485 pragma Assert (Nkind (N) = N_Range);
5486 return Expr_Value (Low_Bound (N));
5490 ------------------------
5491 -- Membership_Entries --
5492 ------------------------
5494 function Membership_Entries (N : Node_Id) return RList is
5496 if No (Next (N)) then
5497 return Membership_Entry (N);
5499 return Membership_Entry (N) or Membership_Entries (Next (N));
5501 end Membership_Entries;
5503 ----------------------
5504 -- Membership_Entry --
5505 ----------------------
5507 function Membership_Entry (N : Node_Id) return RList is
5515 if Nkind (N) = N_Range then
5516 if not Is_Static_Expression (Low_Bound (N))
5518 not Is_Static_Expression (High_Bound (N))
5522 SLo := Expr_Value (Low_Bound (N));
5523 SHi := Expr_Value (High_Bound (N));
5524 return RList'(1 => REnt'(SLo, SHi));
5527 -- Static expression case
5529 elsif Is_Static_Expression (N) then
5530 Val := Expr_Value (N);
5531 return RList'(1 => REnt'(Val, Val));
5533 -- Identifier (other than static expression) case
5535 else pragma Assert (Nkind (N) = N_Identifier);
5539 if Is_Type (Entity (N)) then
5541 -- If type has predicates, process them
5543 if Has_Predicates (Entity (N)) then
5544 return Stat_Pred (Entity (N));
5546 -- For static subtype without predicates, get range
5548 elsif Is_Static_Subtype (Entity (N)) then
5549 SLo := Expr_Value (Type_Low_Bound (Entity (N)));
5550 SHi := Expr_Value (Type_High_Bound (Entity (N)));
5551 return RList'(1 => REnt'(SLo, SHi));
5553 -- Any other type makes us non-static
5559 -- Any other kind of identifier in predicate (e.g. a non-static
5560 -- expression value) means this is not a static predicate.
5566 end Membership_Entry;
5572 function Stat_Pred (Typ : Entity_Id) return RList is
5574 -- Not static if type does not have static predicates
5576 if not Has_Predicates (Typ)
5577 or else No (Static_Predicate (Typ))
5582 -- Otherwise we convert the predicate list to a range list
5585 Result : RList (1 .. List_Length (Static_Predicate (Typ)));
5589 P := First (Static_Predicate (Typ));
5590 for J in Result'Range loop
5591 Result (J) := REnt'(Lo_Val (P), Hi_Val (P));
5599 -- Start of processing for Build_Static_Predicate
5602 -- Now analyze the expression to see if it is a static predicate
5605 Ranges : constant RList := Get_RList (Expr);
5606 -- Range list from expression if it is static
5611 -- Convert range list into a form for the static predicate. In the
5612 -- Ranges array, we just have raw ranges, these must be converted
5613 -- to properly typed and analyzed static expressions or range nodes.
5615 -- Note: here we limit ranges to the ranges of the subtype, so that
5616 -- a predicate is always false for values outside the subtype. That
5617 -- seems fine, such values are invalid anyway, and considering them
5618 -- to fail the predicate seems allowed and friendly, and furthermore
5619 -- simplifies processing for case statements and loops.
5623 for J in Ranges'Range loop
5625 Lo : Uint := Ranges (J).Lo;
5626 Hi : Uint := Ranges (J).Hi;
5629 -- Ignore completely out of range entry
5631 if Hi < TLo or else Lo > THi then
5634 -- Otherwise process entry
5637 -- Adjust out of range value to subtype range
5647 -- Convert range into required form
5650 Append_To (Plist, Build_Val (Lo));
5652 Append_To (Plist, Build_Range (Lo, Hi));
5658 -- Processing was successful and all entries were static, so now we
5659 -- can store the result as the predicate list.
5661 Set_Static_Predicate (Typ, Plist);
5663 -- The processing for static predicates put the expression into
5664 -- canonical form as a series of ranges. It also eliminated
5665 -- duplicates and collapsed and combined ranges. We might as well
5666 -- replace the alternatives list of the right operand of the
5667 -- membership test with the static predicate list, which will
5668 -- usually be more efficient.
5671 New_Alts : constant List_Id := New_List;
5676 Old_Node := First (Plist);
5677 while Present (Old_Node) loop
5678 New_Node := New_Copy (Old_Node);
5680 if Nkind (New_Node) = N_Range then
5681 Set_Low_Bound (New_Node, New_Copy (Low_Bound (Old_Node)));
5682 Set_High_Bound (New_Node, New_Copy (High_Bound (Old_Node)));
5685 Append_To (New_Alts, New_Node);
5689 -- If empty list, replace by False
5691 if Is_Empty_List (New_Alts) then
5692 Rewrite (Expr, New_Occurrence_Of (Standard_False, Loc));
5694 -- Else replace by set membership test
5699 Left_Opnd => Make_Identifier (Loc, Nam),
5700 Right_Opnd => Empty,
5701 Alternatives => New_Alts));
5703 -- Resolve new expression in function context
5705 Install_Formals (Predicate_Function (Typ));
5706 Push_Scope (Predicate_Function (Typ));
5707 Analyze_And_Resolve (Expr, Standard_Boolean);
5713 -- If non-static, return doing nothing
5718 end Build_Static_Predicate;
5720 -----------------------------------------
5721 -- Check_Aspect_At_End_Of_Declarations --
5722 -----------------------------------------
5724 procedure Check_Aspect_At_End_Of_Declarations (ASN : Node_Id) is
5725 Ent : constant Entity_Id := Entity (ASN);
5726 Ident : constant Node_Id := Identifier (ASN);
5728 Freeze_Expr : constant Node_Id := Expression (ASN);
5729 -- Expression from call to Check_Aspect_At_Freeze_Point
5731 End_Decl_Expr : constant Node_Id := Entity (Ident);
5732 -- Expression to be analyzed at end of declarations
5734 T : constant Entity_Id := Etype (Freeze_Expr);
5735 -- Type required for preanalyze call
5737 A_Id : constant Aspect_Id := Get_Aspect_Id (Chars (Ident));
5740 -- Set False if error
5742 -- On entry to this procedure, Entity (Ident) contains a copy of the
5743 -- original expression from the aspect, saved for this purpose, and
5744 -- but Expression (Ident) is a preanalyzed copy of the expression,
5745 -- preanalyzed just after the freeze point.
5748 -- Case of stream attributes, just have to compare entities
5750 if A_Id = Aspect_Input or else
5751 A_Id = Aspect_Output or else
5752 A_Id = Aspect_Read or else
5755 Analyze (End_Decl_Expr);
5756 Err := Entity (End_Decl_Expr) /= Entity (Freeze_Expr);
5758 elsif A_Id = Aspect_Variable_Indexing or else
5759 A_Id = Aspect_Constant_Indexing or else
5760 A_Id = Aspect_Default_Iterator or else
5761 A_Id = Aspect_Iterator_Element
5763 Analyze (End_Decl_Expr);
5764 Analyze (Aspect_Rep_Item (ASN));
5766 -- If the end of declarations comes before any other freeze
5767 -- point, the Freeze_Expr is not analyzed: no check needed.
5770 Analyzed (Freeze_Expr)
5771 and then not In_Instance
5772 and then Entity (End_Decl_Expr) /= Entity (Freeze_Expr);
5777 Preanalyze_Spec_Expression (End_Decl_Expr, T);
5778 Err := not Fully_Conformant_Expressions (End_Decl_Expr, Freeze_Expr);
5781 -- Output error message if error
5785 ("visibility of aspect for& changes after freeze point",
5788 ("?info: & is frozen here, aspects evaluated at this point",
5789 Freeze_Node (Ent), Ent);
5791 end Check_Aspect_At_End_Of_Declarations;
5793 ----------------------------------
5794 -- Check_Aspect_At_Freeze_Point --
5795 ----------------------------------
5797 procedure Check_Aspect_At_Freeze_Point (ASN : Node_Id) is
5798 Ident : constant Node_Id := Identifier (ASN);
5799 -- Identifier (use Entity field to save expression)
5802 -- Type required for preanalyze call
5804 A_Id : constant Aspect_Id := Get_Aspect_Id (Chars (Ident));
5807 -- On entry to this procedure, Entity (Ident) contains a copy of the
5808 -- original expression from the aspect, saved for this purpose.
5810 -- On exit from this procedure Entity (Ident) is unchanged, still
5811 -- containing that copy, but Expression (Ident) is a preanalyzed copy
5812 -- of the expression, preanalyzed just after the freeze point.
5814 -- Make a copy of the expression to be preanalyed
5816 Set_Expression (ASN, New_Copy_Tree (Entity (Ident)));
5818 -- Find type for preanalyze call
5822 -- No_Aspect should be impossible
5825 raise Program_Error;
5827 -- Library unit aspects should be impossible (never delayed)
5829 when Library_Unit_Aspects =>
5830 raise Program_Error;
5832 -- Aspects taking an optional boolean argument. Should be impossible
5833 -- since these are never delayed.
5835 when Boolean_Aspects =>
5836 raise Program_Error;
5838 -- Test_Case aspect applies to entries and subprograms, hence should
5839 -- never be delayed.
5841 when Aspect_Test_Case =>
5842 raise Program_Error;
5844 when Aspect_Attach_Handler =>
5845 T := RTE (RE_Interrupt_ID);
5847 -- Default_Value is resolved with the type entity in question
5849 when Aspect_Default_Value =>
5852 -- Default_Component_Value is resolved with the component type
5854 when Aspect_Default_Component_Value =>
5855 T := Component_Type (Entity (ASN));
5857 -- Aspects corresponding to attribute definition clauses
5859 when Aspect_Address =>
5860 T := RTE (RE_Address);
5862 when Aspect_Bit_Order =>
5863 T := RTE (RE_Bit_Order);
5865 when Aspect_External_Tag =>
5866 T := Standard_String;
5868 when Aspect_Priority | Aspect_Interrupt_Priority =>
5869 T := Standard_Integer;
5871 when Aspect_Small =>
5872 T := Universal_Real;
5874 when Aspect_Storage_Pool =>
5875 T := Class_Wide_Type (RTE (RE_Root_Storage_Pool));
5877 when Aspect_Alignment |
5878 Aspect_Component_Size |
5879 Aspect_Machine_Radix |
5880 Aspect_Object_Size |
5882 Aspect_Storage_Size |
5883 Aspect_Stream_Size |
5884 Aspect_Value_Size =>
5887 -- Stream attribute. Special case, the expression is just an entity
5888 -- that does not need any resolution, so just analyze.
5894 Analyze (Expression (ASN));
5897 -- Same for Iterator aspects, where the expression is a function
5898 -- name. Legality rules are checked separately.
5900 when Aspect_Constant_Indexing |
5901 Aspect_Default_Iterator |
5902 Aspect_Iterator_Element |
5903 Aspect_Implicit_Dereference |
5904 Aspect_Variable_Indexing =>
5905 Analyze (Expression (ASN));
5908 -- Suppress/Unsuppress/Warnings should never be delayed
5910 when Aspect_Suppress |
5913 raise Program_Error;
5915 -- Pre/Post/Invariant/Predicate take boolean expressions
5917 when Aspect_Dynamic_Predicate |
5920 Aspect_Precondition |
5922 Aspect_Postcondition |
5924 Aspect_Static_Predicate |
5925 Aspect_Type_Invariant =>
5926 T := Standard_Boolean;
5929 -- Do the preanalyze call
5931 Preanalyze_Spec_Expression (Expression (ASN), T);
5932 end Check_Aspect_At_Freeze_Point;
5934 -----------------------------------
5935 -- Check_Constant_Address_Clause --
5936 -----------------------------------
5938 procedure Check_Constant_Address_Clause
5942 procedure Check_At_Constant_Address (Nod : Node_Id);
5943 -- Checks that the given node N represents a name whose 'Address is
5944 -- constant (in the same sense as OK_Constant_Address_Clause, i.e. the
5945 -- address value is the same at the point of declaration of U_Ent and at
5946 -- the time of elaboration of the address clause.
5948 procedure Check_Expr_Constants (Nod : Node_Id);
5949 -- Checks that Nod meets the requirements for a constant address clause
5950 -- in the sense of the enclosing procedure.
5952 procedure Check_List_Constants (Lst : List_Id);
5953 -- Check that all elements of list Lst meet the requirements for a
5954 -- constant address clause in the sense of the enclosing procedure.
5956 -------------------------------
5957 -- Check_At_Constant_Address --
5958 -------------------------------
5960 procedure Check_At_Constant_Address (Nod : Node_Id) is
5962 if Is_Entity_Name (Nod) then
5963 if Present (Address_Clause (Entity ((Nod)))) then
5965 ("invalid address clause for initialized object &!",
5968 ("address for& cannot" &
5969 " depend on another address clause! (RM 13.1(22))!",
5972 elsif In_Same_Source_Unit (Entity (Nod), U_Ent)
5973 and then Sloc (U_Ent) < Sloc (Entity (Nod))
5976 ("invalid address clause for initialized object &!",
5978 Error_Msg_Node_2 := U_Ent;
5980 ("\& must be defined before & (RM 13.1(22))!",
5984 elsif Nkind (Nod) = N_Selected_Component then
5986 T : constant Entity_Id := Etype (Prefix (Nod));
5989 if (Is_Record_Type (T)
5990 and then Has_Discriminants (T))
5993 and then Is_Record_Type (Designated_Type (T))
5994 and then Has_Discriminants (Designated_Type (T)))
5997 ("invalid address clause for initialized object &!",
6000 ("\address cannot depend on component" &
6001 " of discriminated record (RM 13.1(22))!",
6004 Check_At_Constant_Address (Prefix (Nod));
6008 elsif Nkind (Nod) = N_Indexed_Component then
6009 Check_At_Constant_Address (Prefix (Nod));
6010 Check_List_Constants (Expressions (Nod));
6013 Check_Expr_Constants (Nod);
6015 end Check_At_Constant_Address;
6017 --------------------------
6018 -- Check_Expr_Constants --
6019 --------------------------
6021 procedure Check_Expr_Constants (Nod : Node_Id) is
6022 Loc_U_Ent : constant Source_Ptr := Sloc (U_Ent);
6023 Ent : Entity_Id := Empty;
6026 if Nkind (Nod) in N_Has_Etype
6027 and then Etype (Nod) = Any_Type
6033 when N_Empty | N_Error =>
6036 when N_Identifier | N_Expanded_Name =>
6037 Ent := Entity (Nod);
6039 -- We need to look at the original node if it is different
6040 -- from the node, since we may have rewritten things and
6041 -- substituted an identifier representing the rewrite.
6043 if Original_Node (Nod) /= Nod then
6044 Check_Expr_Constants (Original_Node (Nod));
6046 -- If the node is an object declaration without initial
6047 -- value, some code has been expanded, and the expression
6048 -- is not constant, even if the constituents might be
6049 -- acceptable, as in A'Address + offset.
6051 if Ekind (Ent) = E_Variable
6053 Nkind (Declaration_Node (Ent)) = N_Object_Declaration
6055 No (Expression (Declaration_Node (Ent)))
6058 ("invalid address clause for initialized object &!",
6061 -- If entity is constant, it may be the result of expanding
6062 -- a check. We must verify that its declaration appears
6063 -- before the object in question, else we also reject the
6066 elsif Ekind (Ent) = E_Constant
6067 and then In_Same_Source_Unit (Ent, U_Ent)
6068 and then Sloc (Ent) > Loc_U_Ent
6071 ("invalid address clause for initialized object &!",
6078 -- Otherwise look at the identifier and see if it is OK
6080 if Ekind_In (Ent, E_Named_Integer, E_Named_Real)
6081 or else Is_Type (Ent)
6086 Ekind (Ent) = E_Constant
6088 Ekind (Ent) = E_In_Parameter
6090 -- This is the case where we must have Ent defined before
6091 -- U_Ent. Clearly if they are in different units this
6092 -- requirement is met since the unit containing Ent is
6093 -- already processed.
6095 if not In_Same_Source_Unit (Ent, U_Ent) then
6098 -- Otherwise location of Ent must be before the location
6099 -- of U_Ent, that's what prior defined means.
6101 elsif Sloc (Ent) < Loc_U_Ent then
6106 ("invalid address clause for initialized object &!",
6108 Error_Msg_Node_2 := U_Ent;
6110 ("\& must be defined before & (RM 13.1(22))!",
6114 elsif Nkind (Original_Node (Nod)) = N_Function_Call then
6115 Check_Expr_Constants (Original_Node (Nod));
6119 ("invalid address clause for initialized object &!",
6122 if Comes_From_Source (Ent) then
6124 ("\reference to variable& not allowed"
6125 & " (RM 13.1(22))!", Nod, Ent);
6128 ("non-static expression not allowed"
6129 & " (RM 13.1(22))!", Nod);
6133 when N_Integer_Literal =>
6135 -- If this is a rewritten unchecked conversion, in a system
6136 -- where Address is an integer type, always use the base type
6137 -- for a literal value. This is user-friendly and prevents
6138 -- order-of-elaboration issues with instances of unchecked
6141 if Nkind (Original_Node (Nod)) = N_Function_Call then
6142 Set_Etype (Nod, Base_Type (Etype (Nod)));
6145 when N_Real_Literal |
6147 N_Character_Literal =>
6151 Check_Expr_Constants (Low_Bound (Nod));
6152 Check_Expr_Constants (High_Bound (Nod));
6154 when N_Explicit_Dereference =>
6155 Check_Expr_Constants (Prefix (Nod));
6157 when N_Indexed_Component =>
6158 Check_Expr_Constants (Prefix (Nod));
6159 Check_List_Constants (Expressions (Nod));
6162 Check_Expr_Constants (Prefix (Nod));
6163 Check_Expr_Constants (Discrete_Range (Nod));
6165 when N_Selected_Component =>
6166 Check_Expr_Constants (Prefix (Nod));
6168 when N_Attribute_Reference =>
6169 if Attribute_Name (Nod) = Name_Address
6171 Attribute_Name (Nod) = Name_Access
6173 Attribute_Name (Nod) = Name_Unchecked_Access
6175 Attribute_Name (Nod) = Name_Unrestricted_Access
6177 Check_At_Constant_Address (Prefix (Nod));
6180 Check_Expr_Constants (Prefix (Nod));
6181 Check_List_Constants (Expressions (Nod));
6185 Check_List_Constants (Component_Associations (Nod));
6186 Check_List_Constants (Expressions (Nod));
6188 when N_Component_Association =>
6189 Check_Expr_Constants (Expression (Nod));
6191 when N_Extension_Aggregate =>
6192 Check_Expr_Constants (Ancestor_Part (Nod));
6193 Check_List_Constants (Component_Associations (Nod));
6194 Check_List_Constants (Expressions (Nod));
6199 when N_Binary_Op | N_Short_Circuit | N_Membership_Test =>
6200 Check_Expr_Constants (Left_Opnd (Nod));
6201 Check_Expr_Constants (Right_Opnd (Nod));
6204 Check_Expr_Constants (Right_Opnd (Nod));
6206 when N_Type_Conversion |
6207 N_Qualified_Expression |
6209 Check_Expr_Constants (Expression (Nod));
6211 when N_Unchecked_Type_Conversion =>
6212 Check_Expr_Constants (Expression (Nod));
6214 -- If this is a rewritten unchecked conversion, subtypes in
6215 -- this node are those created within the instance. To avoid
6216 -- order of elaboration issues, replace them with their base
6217 -- types. Note that address clauses can cause order of
6218 -- elaboration problems because they are elaborated by the
6219 -- back-end at the point of definition, and may mention
6220 -- entities declared in between (as long as everything is
6221 -- static). It is user-friendly to allow unchecked conversions
6224 if Nkind (Original_Node (Nod)) = N_Function_Call then
6225 Set_Etype (Expression (Nod),
6226 Base_Type (Etype (Expression (Nod))));
6227 Set_Etype (Nod, Base_Type (Etype (Nod)));
6230 when N_Function_Call =>
6231 if not Is_Pure (Entity (Name (Nod))) then
6233 ("invalid address clause for initialized object &!",
6237 ("\function & is not pure (RM 13.1(22))!",
6238 Nod, Entity (Name (Nod)));
6241 Check_List_Constants (Parameter_Associations (Nod));
6244 when N_Parameter_Association =>
6245 Check_Expr_Constants (Explicit_Actual_Parameter (Nod));
6249 ("invalid address clause for initialized object &!",
6252 ("\must be constant defined before& (RM 13.1(22))!",
6255 end Check_Expr_Constants;
6257 --------------------------
6258 -- Check_List_Constants --
6259 --------------------------
6261 procedure Check_List_Constants (Lst : List_Id) is
6265 if Present (Lst) then
6266 Nod1 := First (Lst);
6267 while Present (Nod1) loop
6268 Check_Expr_Constants (Nod1);
6272 end Check_List_Constants;
6274 -- Start of processing for Check_Constant_Address_Clause
6277 -- If rep_clauses are to be ignored, no need for legality checks. In
6278 -- particular, no need to pester user about rep clauses that violate
6279 -- the rule on constant addresses, given that these clauses will be
6280 -- removed by Freeze before they reach the back end.
6282 if not Ignore_Rep_Clauses then
6283 Check_Expr_Constants (Expr);
6285 end Check_Constant_Address_Clause;
6287 ----------------------------------------
6288 -- Check_Record_Representation_Clause --
6289 ----------------------------------------
6291 procedure Check_Record_Representation_Clause (N : Node_Id) is
6292 Loc : constant Source_Ptr := Sloc (N);
6293 Ident : constant Node_Id := Identifier (N);
6294 Rectype : Entity_Id;
6299 Hbit : Uint := Uint_0;
6303 Max_Bit_So_Far : Uint;
6304 -- Records the maximum bit position so far. If all field positions
6305 -- are monotonically increasing, then we can skip the circuit for
6306 -- checking for overlap, since no overlap is possible.
6308 Tagged_Parent : Entity_Id := Empty;
6309 -- This is set in the case of a derived tagged type for which we have
6310 -- Is_Fully_Repped_Tagged_Type True (indicating that all components are
6311 -- positioned by record representation clauses). In this case we must
6312 -- check for overlap between components of this tagged type, and the
6313 -- components of its parent. Tagged_Parent will point to this parent
6314 -- type. For all other cases Tagged_Parent is left set to Empty.
6316 Parent_Last_Bit : Uint;
6317 -- Relevant only if Tagged_Parent is set, Parent_Last_Bit indicates the
6318 -- last bit position for any field in the parent type. We only need to
6319 -- check overlap for fields starting below this point.
6321 Overlap_Check_Required : Boolean;
6322 -- Used to keep track of whether or not an overlap check is required
6324 Overlap_Detected : Boolean := False;
6325 -- Set True if an overlap is detected
6327 Ccount : Natural := 0;
6328 -- Number of component clauses in record rep clause
6330 procedure Check_Component_Overlap (C1_Ent, C2_Ent : Entity_Id);
6331 -- Given two entities for record components or discriminants, checks
6332 -- if they have overlapping component clauses and issues errors if so.
6334 procedure Find_Component;
6335 -- Finds component entity corresponding to current component clause (in
6336 -- CC), and sets Comp to the entity, and Fbit/Lbit to the zero origin
6337 -- start/stop bits for the field. If there is no matching component or
6338 -- if the matching component does not have a component clause, then
6339 -- that's an error and Comp is set to Empty, but no error message is
6340 -- issued, since the message was already given. Comp is also set to
6341 -- Empty if the current "component clause" is in fact a pragma.
6343 -----------------------------
6344 -- Check_Component_Overlap --
6345 -----------------------------
6347 procedure Check_Component_Overlap (C1_Ent, C2_Ent : Entity_Id) is
6348 CC1 : constant Node_Id := Component_Clause (C1_Ent);
6349 CC2 : constant Node_Id := Component_Clause (C2_Ent);
6352 if Present (CC1) and then Present (CC2) then
6354 -- Exclude odd case where we have two tag fields in the same
6355 -- record, both at location zero. This seems a bit strange, but
6356 -- it seems to happen in some circumstances, perhaps on an error.
6358 if Chars (C1_Ent) = Name_uTag
6360 Chars (C2_Ent) = Name_uTag
6365 -- Here we check if the two fields overlap
6368 S1 : constant Uint := Component_Bit_Offset (C1_Ent);
6369 S2 : constant Uint := Component_Bit_Offset (C2_Ent);
6370 E1 : constant Uint := S1 + Esize (C1_Ent);
6371 E2 : constant Uint := S2 + Esize (C2_Ent);
6374 if E2 <= S1 or else E1 <= S2 then
6377 Error_Msg_Node_2 := Component_Name (CC2);
6378 Error_Msg_Sloc := Sloc (Error_Msg_Node_2);
6379 Error_Msg_Node_1 := Component_Name (CC1);
6381 ("component& overlaps & #", Component_Name (CC1));
6382 Overlap_Detected := True;
6386 end Check_Component_Overlap;
6388 --------------------
6389 -- Find_Component --
6390 --------------------
6392 procedure Find_Component is
6394 procedure Search_Component (R : Entity_Id);
6395 -- Search components of R for a match. If found, Comp is set.
6397 ----------------------
6398 -- Search_Component --
6399 ----------------------
6401 procedure Search_Component (R : Entity_Id) is
6403 Comp := First_Component_Or_Discriminant (R);
6404 while Present (Comp) loop
6406 -- Ignore error of attribute name for component name (we
6407 -- already gave an error message for this, so no need to
6410 if Nkind (Component_Name (CC)) = N_Attribute_Reference then
6413 exit when Chars (Comp) = Chars (Component_Name (CC));
6416 Next_Component_Or_Discriminant (Comp);
6418 end Search_Component;
6420 -- Start of processing for Find_Component
6423 -- Return with Comp set to Empty if we have a pragma
6425 if Nkind (CC) = N_Pragma then
6430 -- Search current record for matching component
6432 Search_Component (Rectype);
6434 -- If not found, maybe component of base type that is absent from
6435 -- statically constrained first subtype.
6438 Search_Component (Base_Type (Rectype));
6441 -- If no component, or the component does not reference the component
6442 -- clause in question, then there was some previous error for which
6443 -- we already gave a message, so just return with Comp Empty.
6446 or else Component_Clause (Comp) /= CC
6450 -- Normal case where we have a component clause
6453 Fbit := Component_Bit_Offset (Comp);
6454 Lbit := Fbit + Esize (Comp) - 1;
6458 -- Start of processing for Check_Record_Representation_Clause
6462 Rectype := Entity (Ident);
6464 if Rectype = Any_Type then
6467 Rectype := Underlying_Type (Rectype);
6470 -- See if we have a fully repped derived tagged type
6473 PS : constant Entity_Id := Parent_Subtype (Rectype);
6476 if Present (PS) and then Is_Fully_Repped_Tagged_Type (PS) then
6477 Tagged_Parent := PS;
6479 -- Find maximum bit of any component of the parent type
6481 Parent_Last_Bit := UI_From_Int (System_Address_Size - 1);
6482 Pcomp := First_Entity (Tagged_Parent);
6483 while Present (Pcomp) loop
6484 if Ekind_In (Pcomp, E_Discriminant, E_Component) then
6485 if Component_Bit_Offset (Pcomp) /= No_Uint
6486 and then Known_Static_Esize (Pcomp)
6491 Component_Bit_Offset (Pcomp) + Esize (Pcomp) - 1);
6494 Next_Entity (Pcomp);
6500 -- All done if no component clauses
6502 CC := First (Component_Clauses (N));
6508 -- If a tag is present, then create a component clause that places it
6509 -- at the start of the record (otherwise gigi may place it after other
6510 -- fields that have rep clauses).
6512 Fent := First_Entity (Rectype);
6514 if Nkind (Fent) = N_Defining_Identifier
6515 and then Chars (Fent) = Name_uTag
6517 Set_Component_Bit_Offset (Fent, Uint_0);
6518 Set_Normalized_Position (Fent, Uint_0);
6519 Set_Normalized_First_Bit (Fent, Uint_0);
6520 Set_Normalized_Position_Max (Fent, Uint_0);
6521 Init_Esize (Fent, System_Address_Size);
6523 Set_Component_Clause (Fent,
6524 Make_Component_Clause (Loc,
6525 Component_Name => Make_Identifier (Loc, Name_uTag),
6527 Position => Make_Integer_Literal (Loc, Uint_0),
6528 First_Bit => Make_Integer_Literal (Loc, Uint_0),
6530 Make_Integer_Literal (Loc,
6531 UI_From_Int (System_Address_Size))));
6533 Ccount := Ccount + 1;
6536 Max_Bit_So_Far := Uint_Minus_1;
6537 Overlap_Check_Required := False;
6539 -- Process the component clauses
6541 while Present (CC) loop
6544 if Present (Comp) then
6545 Ccount := Ccount + 1;
6547 -- We need a full overlap check if record positions non-monotonic
6549 if Fbit <= Max_Bit_So_Far then
6550 Overlap_Check_Required := True;
6553 Max_Bit_So_Far := Lbit;
6555 -- Check bit position out of range of specified size
6557 if Has_Size_Clause (Rectype)
6558 and then RM_Size (Rectype) <= Lbit
6561 ("bit number out of range of specified size",
6564 -- Check for overlap with tag field
6567 if Is_Tagged_Type (Rectype)
6568 and then Fbit < System_Address_Size
6571 ("component overlaps tag field of&",
6572 Component_Name (CC), Rectype);
6573 Overlap_Detected := True;
6581 -- Check parent overlap if component might overlap parent field
6583 if Present (Tagged_Parent)
6584 and then Fbit <= Parent_Last_Bit
6586 Pcomp := First_Component_Or_Discriminant (Tagged_Parent);
6587 while Present (Pcomp) loop
6588 if not Is_Tag (Pcomp)
6589 and then Chars (Pcomp) /= Name_uParent
6591 Check_Component_Overlap (Comp, Pcomp);
6594 Next_Component_Or_Discriminant (Pcomp);
6602 -- Now that we have processed all the component clauses, check for
6603 -- overlap. We have to leave this till last, since the components can
6604 -- appear in any arbitrary order in the representation clause.
6606 -- We do not need this check if all specified ranges were monotonic,
6607 -- as recorded by Overlap_Check_Required being False at this stage.
6609 -- This first section checks if there are any overlapping entries at
6610 -- all. It does this by sorting all entries and then seeing if there are
6611 -- any overlaps. If there are none, then that is decisive, but if there
6612 -- are overlaps, they may still be OK (they may result from fields in
6613 -- different variants).
6615 if Overlap_Check_Required then
6616 Overlap_Check1 : declare
6618 OC_Fbit : array (0 .. Ccount) of Uint;
6619 -- First-bit values for component clauses, the value is the offset
6620 -- of the first bit of the field from start of record. The zero
6621 -- entry is for use in sorting.
6623 OC_Lbit : array (0 .. Ccount) of Uint;
6624 -- Last-bit values for component clauses, the value is the offset
6625 -- of the last bit of the field from start of record. The zero
6626 -- entry is for use in sorting.
6628 OC_Count : Natural := 0;
6629 -- Count of entries in OC_Fbit and OC_Lbit
6631 function OC_Lt (Op1, Op2 : Natural) return Boolean;
6632 -- Compare routine for Sort
6634 procedure OC_Move (From : Natural; To : Natural);
6635 -- Move routine for Sort
6637 package Sorting is new GNAT.Heap_Sort_G (OC_Move, OC_Lt);
6643 function OC_Lt (Op1, Op2 : Natural) return Boolean is
6645 return OC_Fbit (Op1) < OC_Fbit (Op2);
6652 procedure OC_Move (From : Natural; To : Natural) is
6654 OC_Fbit (To) := OC_Fbit (From);
6655 OC_Lbit (To) := OC_Lbit (From);
6658 -- Start of processing for Overlap_Check
6661 CC := First (Component_Clauses (N));
6662 while Present (CC) loop
6664 -- Exclude component clause already marked in error
6666 if not Error_Posted (CC) then
6669 if Present (Comp) then
6670 OC_Count := OC_Count + 1;
6671 OC_Fbit (OC_Count) := Fbit;
6672 OC_Lbit (OC_Count) := Lbit;
6679 Sorting.Sort (OC_Count);
6681 Overlap_Check_Required := False;
6682 for J in 1 .. OC_Count - 1 loop
6683 if OC_Lbit (J) >= OC_Fbit (J + 1) then
6684 Overlap_Check_Required := True;
6691 -- If Overlap_Check_Required is still True, then we have to do the full
6692 -- scale overlap check, since we have at least two fields that do
6693 -- overlap, and we need to know if that is OK since they are in
6694 -- different variant, or whether we have a definite problem.
6696 if Overlap_Check_Required then
6697 Overlap_Check2 : declare
6698 C1_Ent, C2_Ent : Entity_Id;
6699 -- Entities of components being checked for overlap
6702 -- Component_List node whose Component_Items are being checked
6705 -- Component declaration for component being checked
6708 C1_Ent := First_Entity (Base_Type (Rectype));
6710 -- Loop through all components in record. For each component check
6711 -- for overlap with any of the preceding elements on the component
6712 -- list containing the component and also, if the component is in
6713 -- a variant, check against components outside the case structure.
6714 -- This latter test is repeated recursively up the variant tree.
6716 Main_Component_Loop : while Present (C1_Ent) loop
6717 if not Ekind_In (C1_Ent, E_Component, E_Discriminant) then
6718 goto Continue_Main_Component_Loop;
6721 -- Skip overlap check if entity has no declaration node. This
6722 -- happens with discriminants in constrained derived types.
6723 -- Possibly we are missing some checks as a result, but that
6724 -- does not seem terribly serious.
6726 if No (Declaration_Node (C1_Ent)) then
6727 goto Continue_Main_Component_Loop;
6730 Clist := Parent (List_Containing (Declaration_Node (C1_Ent)));
6732 -- Loop through component lists that need checking. Check the
6733 -- current component list and all lists in variants above us.
6735 Component_List_Loop : loop
6737 -- If derived type definition, go to full declaration
6738 -- If at outer level, check discriminants if there are any.
6740 if Nkind (Clist) = N_Derived_Type_Definition then
6741 Clist := Parent (Clist);
6744 -- Outer level of record definition, check discriminants
6746 if Nkind_In (Clist, N_Full_Type_Declaration,
6747 N_Private_Type_Declaration)
6749 if Has_Discriminants (Defining_Identifier (Clist)) then
6751 First_Discriminant (Defining_Identifier (Clist));
6752 while Present (C2_Ent) loop
6753 exit when C1_Ent = C2_Ent;
6754 Check_Component_Overlap (C1_Ent, C2_Ent);
6755 Next_Discriminant (C2_Ent);
6759 -- Record extension case
6761 elsif Nkind (Clist) = N_Derived_Type_Definition then
6764 -- Otherwise check one component list
6767 Citem := First (Component_Items (Clist));
6768 while Present (Citem) loop
6769 if Nkind (Citem) = N_Component_Declaration then
6770 C2_Ent := Defining_Identifier (Citem);
6771 exit when C1_Ent = C2_Ent;
6772 Check_Component_Overlap (C1_Ent, C2_Ent);
6779 -- Check for variants above us (the parent of the Clist can
6780 -- be a variant, in which case its parent is a variant part,
6781 -- and the parent of the variant part is a component list
6782 -- whose components must all be checked against the current
6783 -- component for overlap).
6785 if Nkind (Parent (Clist)) = N_Variant then
6786 Clist := Parent (Parent (Parent (Clist)));
6788 -- Check for possible discriminant part in record, this
6789 -- is treated essentially as another level in the
6790 -- recursion. For this case the parent of the component
6791 -- list is the record definition, and its parent is the
6792 -- full type declaration containing the discriminant
6795 elsif Nkind (Parent (Clist)) = N_Record_Definition then
6796 Clist := Parent (Parent ((Clist)));
6798 -- If neither of these two cases, we are at the top of
6802 exit Component_List_Loop;
6804 end loop Component_List_Loop;
6806 <<Continue_Main_Component_Loop>>
6807 Next_Entity (C1_Ent);
6809 end loop Main_Component_Loop;
6813 -- The following circuit deals with warning on record holes (gaps). We
6814 -- skip this check if overlap was detected, since it makes sense for the
6815 -- programmer to fix this illegality before worrying about warnings.
6817 if not Overlap_Detected and Warn_On_Record_Holes then
6818 Record_Hole_Check : declare
6819 Decl : constant Node_Id := Declaration_Node (Base_Type (Rectype));
6820 -- Full declaration of record type
6822 procedure Check_Component_List
6826 -- Check component list CL for holes. The starting bit should be
6827 -- Sbit. which is zero for the main record component list and set
6828 -- appropriately for recursive calls for variants. DS is set to
6829 -- a list of discriminant specifications to be included in the
6830 -- consideration of components. It is No_List if none to consider.
6832 --------------------------
6833 -- Check_Component_List --
6834 --------------------------
6836 procedure Check_Component_List
6844 Compl := Integer (List_Length (Component_Items (CL)));
6846 if DS /= No_List then
6847 Compl := Compl + Integer (List_Length (DS));
6851 Comps : array (Natural range 0 .. Compl) of Entity_Id;
6852 -- Gather components (zero entry is for sort routine)
6854 Ncomps : Natural := 0;
6855 -- Number of entries stored in Comps (starting at Comps (1))
6858 -- One component item or discriminant specification
6861 -- Starting bit for next component
6869 function Lt (Op1, Op2 : Natural) return Boolean;
6870 -- Compare routine for Sort
6872 procedure Move (From : Natural; To : Natural);
6873 -- Move routine for Sort
6875 package Sorting is new GNAT.Heap_Sort_G (Move, Lt);
6881 function Lt (Op1, Op2 : Natural) return Boolean is
6883 return Component_Bit_Offset (Comps (Op1))
6885 Component_Bit_Offset (Comps (Op2));
6892 procedure Move (From : Natural; To : Natural) is
6894 Comps (To) := Comps (From);
6898 -- Gather discriminants into Comp
6900 if DS /= No_List then
6901 Citem := First (DS);
6902 while Present (Citem) loop
6903 if Nkind (Citem) = N_Discriminant_Specification then
6905 Ent : constant Entity_Id :=
6906 Defining_Identifier (Citem);
6908 if Ekind (Ent) = E_Discriminant then
6909 Ncomps := Ncomps + 1;
6910 Comps (Ncomps) := Ent;
6919 -- Gather component entities into Comp
6921 Citem := First (Component_Items (CL));
6922 while Present (Citem) loop
6923 if Nkind (Citem) = N_Component_Declaration then
6924 Ncomps := Ncomps + 1;
6925 Comps (Ncomps) := Defining_Identifier (Citem);
6931 -- Now sort the component entities based on the first bit.
6932 -- Note we already know there are no overlapping components.
6934 Sorting.Sort (Ncomps);
6936 -- Loop through entries checking for holes
6939 for J in 1 .. Ncomps loop
6941 Error_Msg_Uint_1 := Component_Bit_Offset (CEnt) - Nbit;
6943 if Error_Msg_Uint_1 > 0 then
6945 ("?^-bit gap before component&",
6946 Component_Name (Component_Clause (CEnt)), CEnt);
6949 Nbit := Component_Bit_Offset (CEnt) + Esize (CEnt);
6952 -- Process variant parts recursively if present
6954 if Present (Variant_Part (CL)) then
6955 Variant := First (Variants (Variant_Part (CL)));
6956 while Present (Variant) loop
6957 Check_Component_List
6958 (Component_List (Variant), Nbit, No_List);
6963 end Check_Component_List;
6965 -- Start of processing for Record_Hole_Check
6972 if Is_Tagged_Type (Rectype) then
6973 Sbit := UI_From_Int (System_Address_Size);
6978 if Nkind (Decl) = N_Full_Type_Declaration
6979 and then Nkind (Type_Definition (Decl)) = N_Record_Definition
6981 Check_Component_List
6982 (Component_List (Type_Definition (Decl)),
6984 Discriminant_Specifications (Decl));
6987 end Record_Hole_Check;
6990 -- For records that have component clauses for all components, and whose
6991 -- size is less than or equal to 32, we need to know the size in the
6992 -- front end to activate possible packed array processing where the
6993 -- component type is a record.
6995 -- At this stage Hbit + 1 represents the first unused bit from all the
6996 -- component clauses processed, so if the component clauses are
6997 -- complete, then this is the length of the record.
6999 -- For records longer than System.Storage_Unit, and for those where not
7000 -- all components have component clauses, the back end determines the
7001 -- length (it may for example be appropriate to round up the size
7002 -- to some convenient boundary, based on alignment considerations, etc).
7004 if Unknown_RM_Size (Rectype) and then Hbit + 1 <= 32 then
7006 -- Nothing to do if at least one component has no component clause
7008 Comp := First_Component_Or_Discriminant (Rectype);
7009 while Present (Comp) loop
7010 exit when No (Component_Clause (Comp));
7011 Next_Component_Or_Discriminant (Comp);
7014 -- If we fall out of loop, all components have component clauses
7015 -- and so we can set the size to the maximum value.
7018 Set_RM_Size (Rectype, Hbit + 1);
7021 end Check_Record_Representation_Clause;
7027 procedure Check_Size
7031 Biased : out Boolean)
7033 UT : constant Entity_Id := Underlying_Type (T);
7039 -- Dismiss cases for generic types or types with previous errors
7042 or else UT = Any_Type
7043 or else Is_Generic_Type (UT)
7044 or else Is_Generic_Type (Root_Type (UT))
7048 -- Check case of bit packed array
7050 elsif Is_Array_Type (UT)
7051 and then Known_Static_Component_Size (UT)
7052 and then Is_Bit_Packed_Array (UT)
7060 Asiz := Component_Size (UT);
7061 Indx := First_Index (UT);
7063 Ityp := Etype (Indx);
7065 -- If non-static bound, then we are not in the business of
7066 -- trying to check the length, and indeed an error will be
7067 -- issued elsewhere, since sizes of non-static array types
7068 -- cannot be set implicitly or explicitly.
7070 if not Is_Static_Subtype (Ityp) then
7074 -- Otherwise accumulate next dimension
7076 Asiz := Asiz * (Expr_Value (Type_High_Bound (Ityp)) -
7077 Expr_Value (Type_Low_Bound (Ityp)) +
7081 exit when No (Indx);
7087 Error_Msg_Uint_1 := Asiz;
7089 ("size for& too small, minimum allowed is ^", N, T);
7090 Set_Esize (T, Asiz);
7091 Set_RM_Size (T, Asiz);
7095 -- All other composite types are ignored
7097 elsif Is_Composite_Type (UT) then
7100 -- For fixed-point types, don't check minimum if type is not frozen,
7101 -- since we don't know all the characteristics of the type that can
7102 -- affect the size (e.g. a specified small) till freeze time.
7104 elsif Is_Fixed_Point_Type (UT)
7105 and then not Is_Frozen (UT)
7109 -- Cases for which a minimum check is required
7112 -- Ignore if specified size is correct for the type
7114 if Known_Esize (UT) and then Siz = Esize (UT) then
7118 -- Otherwise get minimum size
7120 M := UI_From_Int (Minimum_Size (UT));
7124 -- Size is less than minimum size, but one possibility remains
7125 -- that we can manage with the new size if we bias the type.
7127 M := UI_From_Int (Minimum_Size (UT, Biased => True));
7130 Error_Msg_Uint_1 := M;
7132 ("size for& too small, minimum allowed is ^", N, T);
7142 -------------------------
7143 -- Get_Alignment_Value --
7144 -------------------------
7146 function Get_Alignment_Value (Expr : Node_Id) return Uint is
7147 Align : constant Uint := Static_Integer (Expr);
7150 if Align = No_Uint then
7153 elsif Align <= 0 then
7154 Error_Msg_N ("alignment value must be positive", Expr);
7158 for J in Int range 0 .. 64 loop
7160 M : constant Uint := Uint_2 ** J;
7163 exit when M = Align;
7167 ("alignment value must be power of 2", Expr);
7175 end Get_Alignment_Value;
7181 procedure Initialize is
7183 Address_Clause_Checks.Init;
7184 Independence_Checks.Init;
7185 Unchecked_Conversions.Init;
7188 -------------------------
7189 -- Is_Operational_Item --
7190 -------------------------
7192 function Is_Operational_Item (N : Node_Id) return Boolean is
7194 if Nkind (N) /= N_Attribute_Definition_Clause then
7198 Id : constant Attribute_Id := Get_Attribute_Id (Chars (N));
7200 return Id = Attribute_Input
7201 or else Id = Attribute_Output
7202 or else Id = Attribute_Read
7203 or else Id = Attribute_Write
7204 or else Id = Attribute_External_Tag;
7207 end Is_Operational_Item;
7213 function Minimum_Size
7215 Biased : Boolean := False) return Nat
7217 Lo : Uint := No_Uint;
7218 Hi : Uint := No_Uint;
7219 LoR : Ureal := No_Ureal;
7220 HiR : Ureal := No_Ureal;
7221 LoSet : Boolean := False;
7222 HiSet : Boolean := False;
7226 R_Typ : constant Entity_Id := Root_Type (T);
7229 -- If bad type, return 0
7231 if T = Any_Type then
7234 -- For generic types, just return zero. There cannot be any legitimate
7235 -- need to know such a size, but this routine may be called with a
7236 -- generic type as part of normal processing.
7238 elsif Is_Generic_Type (R_Typ)
7239 or else R_Typ = Any_Type
7243 -- Access types. Normally an access type cannot have a size smaller
7244 -- than the size of System.Address. The exception is on VMS, where
7245 -- we have short and long addresses, and it is possible for an access
7246 -- type to have a short address size (and thus be less than the size
7247 -- of System.Address itself). We simply skip the check for VMS, and
7248 -- leave it to the back end to do the check.
7250 elsif Is_Access_Type (T) then
7251 if OpenVMS_On_Target then
7254 return System_Address_Size;
7257 -- Floating-point types
7259 elsif Is_Floating_Point_Type (T) then
7260 return UI_To_Int (Esize (R_Typ));
7264 elsif Is_Discrete_Type (T) then
7266 -- The following loop is looking for the nearest compile time known
7267 -- bounds following the ancestor subtype chain. The idea is to find
7268 -- the most restrictive known bounds information.
7272 if Ancest = Any_Type or else Etype (Ancest) = Any_Type then
7277 if Compile_Time_Known_Value (Type_Low_Bound (Ancest)) then
7278 Lo := Expr_Rep_Value (Type_Low_Bound (Ancest));
7285 if Compile_Time_Known_Value (Type_High_Bound (Ancest)) then
7286 Hi := Expr_Rep_Value (Type_High_Bound (Ancest));
7292 Ancest := Ancestor_Subtype (Ancest);
7295 Ancest := Base_Type (T);
7297 if Is_Generic_Type (Ancest) then
7303 -- Fixed-point types. We can't simply use Expr_Value to get the
7304 -- Corresponding_Integer_Value values of the bounds, since these do not
7305 -- get set till the type is frozen, and this routine can be called
7306 -- before the type is frozen. Similarly the test for bounds being static
7307 -- needs to include the case where we have unanalyzed real literals for
7310 elsif Is_Fixed_Point_Type (T) then
7312 -- The following loop is looking for the nearest compile time known
7313 -- bounds following the ancestor subtype chain. The idea is to find
7314 -- the most restrictive known bounds information.
7318 if Ancest = Any_Type or else Etype (Ancest) = Any_Type then
7322 -- Note: In the following two tests for LoSet and HiSet, it may
7323 -- seem redundant to test for N_Real_Literal here since normally
7324 -- one would assume that the test for the value being known at
7325 -- compile time includes this case. However, there is a glitch.
7326 -- If the real literal comes from folding a non-static expression,
7327 -- then we don't consider any non- static expression to be known
7328 -- at compile time if we are in configurable run time mode (needed
7329 -- in some cases to give a clearer definition of what is and what
7330 -- is not accepted). So the test is indeed needed. Without it, we
7331 -- would set neither Lo_Set nor Hi_Set and get an infinite loop.
7334 if Nkind (Type_Low_Bound (Ancest)) = N_Real_Literal
7335 or else Compile_Time_Known_Value (Type_Low_Bound (Ancest))
7337 LoR := Expr_Value_R (Type_Low_Bound (Ancest));
7344 if Nkind (Type_High_Bound (Ancest)) = N_Real_Literal
7345 or else Compile_Time_Known_Value (Type_High_Bound (Ancest))
7347 HiR := Expr_Value_R (Type_High_Bound (Ancest));
7353 Ancest := Ancestor_Subtype (Ancest);
7356 Ancest := Base_Type (T);
7358 if Is_Generic_Type (Ancest) then
7364 Lo := UR_To_Uint (LoR / Small_Value (T));
7365 Hi := UR_To_Uint (HiR / Small_Value (T));
7367 -- No other types allowed
7370 raise Program_Error;
7373 -- Fall through with Hi and Lo set. Deal with biased case
7376 and then not Is_Fixed_Point_Type (T)
7377 and then not (Is_Enumeration_Type (T)
7378 and then Has_Non_Standard_Rep (T)))
7379 or else Has_Biased_Representation (T)
7385 -- Signed case. Note that we consider types like range 1 .. -1 to be
7386 -- signed for the purpose of computing the size, since the bounds have
7387 -- to be accommodated in the base type.
7389 if Lo < 0 or else Hi < 0 then
7393 -- S = size, B = 2 ** (size - 1) (can accommodate -B .. +(B - 1))
7394 -- Note that we accommodate the case where the bounds cross. This
7395 -- can happen either because of the way the bounds are declared
7396 -- or because of the algorithm in Freeze_Fixed_Point_Type.
7410 -- If both bounds are positive, make sure that both are represen-
7411 -- table in the case where the bounds are crossed. This can happen
7412 -- either because of the way the bounds are declared, or because of
7413 -- the algorithm in Freeze_Fixed_Point_Type.
7419 -- S = size, (can accommodate 0 .. (2**size - 1))
7422 while Hi >= Uint_2 ** S loop
7430 ---------------------------
7431 -- New_Stream_Subprogram --
7432 ---------------------------
7434 procedure New_Stream_Subprogram
7438 Nam : TSS_Name_Type)
7440 Loc : constant Source_Ptr := Sloc (N);
7441 Sname : constant Name_Id := Make_TSS_Name (Base_Type (Ent), Nam);
7442 Subp_Id : Entity_Id;
7443 Subp_Decl : Node_Id;
7447 Defer_Declaration : constant Boolean :=
7448 Is_Tagged_Type (Ent) or else Is_Private_Type (Ent);
7449 -- For a tagged type, there is a declaration for each stream attribute
7450 -- at the freeze point, and we must generate only a completion of this
7451 -- declaration. We do the same for private types, because the full view
7452 -- might be tagged. Otherwise we generate a declaration at the point of
7453 -- the attribute definition clause.
7455 function Build_Spec return Node_Id;
7456 -- Used for declaration and renaming declaration, so that this is
7457 -- treated as a renaming_as_body.
7463 function Build_Spec return Node_Id is
7464 Out_P : constant Boolean := (Nam = TSS_Stream_Read);
7467 T_Ref : constant Node_Id := New_Reference_To (Etyp, Loc);
7470 Subp_Id := Make_Defining_Identifier (Loc, Sname);
7472 -- S : access Root_Stream_Type'Class
7474 Formals := New_List (
7475 Make_Parameter_Specification (Loc,
7476 Defining_Identifier =>
7477 Make_Defining_Identifier (Loc, Name_S),
7479 Make_Access_Definition (Loc,
7482 Designated_Type (Etype (F)), Loc))));
7484 if Nam = TSS_Stream_Input then
7485 Spec := Make_Function_Specification (Loc,
7486 Defining_Unit_Name => Subp_Id,
7487 Parameter_Specifications => Formals,
7488 Result_Definition => T_Ref);
7493 Make_Parameter_Specification (Loc,
7494 Defining_Identifier => Make_Defining_Identifier (Loc, Name_V),
7495 Out_Present => Out_P,
7496 Parameter_Type => T_Ref));
7499 Make_Procedure_Specification (Loc,
7500 Defining_Unit_Name => Subp_Id,
7501 Parameter_Specifications => Formals);
7507 -- Start of processing for New_Stream_Subprogram
7510 F := First_Formal (Subp);
7512 if Ekind (Subp) = E_Procedure then
7513 Etyp := Etype (Next_Formal (F));
7515 Etyp := Etype (Subp);
7518 -- Prepare subprogram declaration and insert it as an action on the
7519 -- clause node. The visibility for this entity is used to test for
7520 -- visibility of the attribute definition clause (in the sense of
7521 -- 8.3(23) as amended by AI-195).
7523 if not Defer_Declaration then
7525 Make_Subprogram_Declaration (Loc,
7526 Specification => Build_Spec);
7528 -- For a tagged type, there is always a visible declaration for each
7529 -- stream TSS (it is a predefined primitive operation), and the
7530 -- completion of this declaration occurs at the freeze point, which is
7531 -- not always visible at places where the attribute definition clause is
7532 -- visible. So, we create a dummy entity here for the purpose of
7533 -- tracking the visibility of the attribute definition clause itself.
7537 Make_Defining_Identifier (Loc, New_External_Name (Sname, 'V'));
7539 Make_Object_Declaration (Loc,
7540 Defining_Identifier => Subp_Id,
7541 Object_Definition => New_Occurrence_Of (Standard_Boolean, Loc));
7544 Insert_Action (N, Subp_Decl);
7545 Set_Entity (N, Subp_Id);
7548 Make_Subprogram_Renaming_Declaration (Loc,
7549 Specification => Build_Spec,
7550 Name => New_Reference_To (Subp, Loc));
7552 if Defer_Declaration then
7553 Set_TSS (Base_Type (Ent), Subp_Id);
7555 Insert_Action (N, Subp_Decl);
7556 Copy_TSS (Subp_Id, Base_Type (Ent));
7558 end New_Stream_Subprogram;
7560 ------------------------
7561 -- Rep_Item_Too_Early --
7562 ------------------------
7564 function Rep_Item_Too_Early (T : Entity_Id; N : Node_Id) return Boolean is
7566 -- Cannot apply non-operational rep items to generic types
7568 if Is_Operational_Item (N) then
7572 and then Is_Generic_Type (Root_Type (T))
7574 Error_Msg_N ("representation item not allowed for generic type", N);
7578 -- Otherwise check for incomplete type
7580 if Is_Incomplete_Or_Private_Type (T)
7581 and then No (Underlying_Type (T))
7583 (Nkind (N) /= N_Pragma
7584 or else Get_Pragma_Id (N) /= Pragma_Import)
7587 ("representation item must be after full type declaration", N);
7590 -- If the type has incomplete components, a representation clause is
7591 -- illegal but stream attributes and Convention pragmas are correct.
7593 elsif Has_Private_Component (T) then
7594 if Nkind (N) = N_Pragma then
7598 ("representation item must appear after type is fully defined",
7605 end Rep_Item_Too_Early;
7607 -----------------------
7608 -- Rep_Item_Too_Late --
7609 -----------------------
7611 function Rep_Item_Too_Late
7614 FOnly : Boolean := False) return Boolean
7617 Parent_Type : Entity_Id;
7620 -- Output the too late message. Note that this is not considered a
7621 -- serious error, since the effect is simply that we ignore the
7622 -- representation clause in this case.
7628 procedure Too_Late is
7630 Error_Msg_N ("|representation item appears too late!", N);
7633 -- Start of processing for Rep_Item_Too_Late
7636 -- First make sure entity is not frozen (RM 13.1(9)). Exclude imported
7637 -- types, which may be frozen if they appear in a representation clause
7638 -- for a local type.
7641 and then not From_With_Type (T)
7644 S := First_Subtype (T);
7646 if Present (Freeze_Node (S)) then
7648 ("?no more representation items for }", Freeze_Node (S), S);
7653 -- Check for case of non-tagged derived type whose parent either has
7654 -- primitive operations, or is a by reference type (RM 13.1(10)).
7658 and then Is_Derived_Type (T)
7659 and then not Is_Tagged_Type (T)
7661 Parent_Type := Etype (Base_Type (T));
7663 if Has_Primitive_Operations (Parent_Type) then
7666 ("primitive operations already defined for&!", N, Parent_Type);
7669 elsif Is_By_Reference_Type (Parent_Type) then
7672 ("parent type & is a by reference type!", N, Parent_Type);
7677 -- No error, link item into head of chain of rep items for the entity,
7678 -- but avoid chaining if we have an overloadable entity, and the pragma
7679 -- is one that can apply to multiple overloaded entities.
7681 if Is_Overloadable (T)
7682 and then Nkind (N) = N_Pragma
7685 Pname : constant Name_Id := Pragma_Name (N);
7687 if Pname = Name_Convention or else
7688 Pname = Name_Import or else
7689 Pname = Name_Export or else
7690 Pname = Name_External or else
7691 Pname = Name_Interface
7698 Record_Rep_Item (T, N);
7700 end Rep_Item_Too_Late;
7702 -------------------------------------
7703 -- Replace_Type_References_Generic --
7704 -------------------------------------
7706 procedure Replace_Type_References_Generic (N : Node_Id; TName : Name_Id) is
7708 function Replace_Node (N : Node_Id) return Traverse_Result;
7709 -- Processes a single node in the traversal procedure below, checking
7710 -- if node N should be replaced, and if so, doing the replacement.
7712 procedure Replace_Type_Refs is new Traverse_Proc (Replace_Node);
7713 -- This instantiation provides the body of Replace_Type_References
7719 function Replace_Node (N : Node_Id) return Traverse_Result is
7724 -- Case of identifier
7726 if Nkind (N) = N_Identifier then
7728 -- If not the type name, all done with this node
7730 if Chars (N) /= TName then
7733 -- Otherwise do the replacement and we are done with this node
7736 Replace_Type_Reference (N);
7740 -- Case of selected component (which is what a qualification
7741 -- looks like in the unanalyzed tree, which is what we have.
7743 elsif Nkind (N) = N_Selected_Component then
7745 -- If selector name is not our type, keeping going (we might
7746 -- still have an occurrence of the type in the prefix).
7748 if Nkind (Selector_Name (N)) /= N_Identifier
7749 or else Chars (Selector_Name (N)) /= TName
7753 -- Selector name is our type, check qualification
7756 -- Loop through scopes and prefixes, doing comparison
7761 -- Continue if no more scopes or scope with no name
7763 if No (S) or else Nkind (S) not in N_Has_Chars then
7767 -- Do replace if prefix is an identifier matching the
7768 -- scope that we are currently looking at.
7770 if Nkind (P) = N_Identifier
7771 and then Chars (P) = Chars (S)
7773 Replace_Type_Reference (N);
7777 -- Go check scope above us if prefix is itself of the
7778 -- form of a selected component, whose selector matches
7779 -- the scope we are currently looking at.
7781 if Nkind (P) = N_Selected_Component
7782 and then Nkind (Selector_Name (P)) = N_Identifier
7783 and then Chars (Selector_Name (P)) = Chars (S)
7788 -- For anything else, we don't have a match, so keep on
7789 -- going, there are still some weird cases where we may
7790 -- still have a replacement within the prefix.
7798 -- Continue for any other node kind
7806 Replace_Type_Refs (N);
7807 end Replace_Type_References_Generic;
7809 -------------------------
7810 -- Same_Representation --
7811 -------------------------
7813 function Same_Representation (Typ1, Typ2 : Entity_Id) return Boolean is
7814 T1 : constant Entity_Id := Underlying_Type (Typ1);
7815 T2 : constant Entity_Id := Underlying_Type (Typ2);
7818 -- A quick check, if base types are the same, then we definitely have
7819 -- the same representation, because the subtype specific representation
7820 -- attributes (Size and Alignment) do not affect representation from
7821 -- the point of view of this test.
7823 if Base_Type (T1) = Base_Type (T2) then
7826 elsif Is_Private_Type (Base_Type (T2))
7827 and then Base_Type (T1) = Full_View (Base_Type (T2))
7832 -- Tagged types never have differing representations
7834 if Is_Tagged_Type (T1) then
7838 -- Representations are definitely different if conventions differ
7840 if Convention (T1) /= Convention (T2) then
7844 -- Representations are different if component alignments differ
7846 if (Is_Record_Type (T1) or else Is_Array_Type (T1))
7848 (Is_Record_Type (T2) or else Is_Array_Type (T2))
7849 and then Component_Alignment (T1) /= Component_Alignment (T2)
7854 -- For arrays, the only real issue is component size. If we know the
7855 -- component size for both arrays, and it is the same, then that's
7856 -- good enough to know we don't have a change of representation.
7858 if Is_Array_Type (T1) then
7859 if Known_Component_Size (T1)
7860 and then Known_Component_Size (T2)
7861 and then Component_Size (T1) = Component_Size (T2)
7863 if VM_Target = No_VM then
7866 -- In VM targets the representation of arrays with aliased
7867 -- components differs from arrays with non-aliased components
7870 return Has_Aliased_Components (Base_Type (T1))
7872 Has_Aliased_Components (Base_Type (T2));
7877 -- Types definitely have same representation if neither has non-standard
7878 -- representation since default representations are always consistent.
7879 -- If only one has non-standard representation, and the other does not,
7880 -- then we consider that they do not have the same representation. They
7881 -- might, but there is no way of telling early enough.
7883 if Has_Non_Standard_Rep (T1) then
7884 if not Has_Non_Standard_Rep (T2) then
7888 return not Has_Non_Standard_Rep (T2);
7891 -- Here the two types both have non-standard representation, and we need
7892 -- to determine if they have the same non-standard representation.
7894 -- For arrays, we simply need to test if the component sizes are the
7895 -- same. Pragma Pack is reflected in modified component sizes, so this
7896 -- check also deals with pragma Pack.
7898 if Is_Array_Type (T1) then
7899 return Component_Size (T1) = Component_Size (T2);
7901 -- Tagged types always have the same representation, because it is not
7902 -- possible to specify different representations for common fields.
7904 elsif Is_Tagged_Type (T1) then
7907 -- Case of record types
7909 elsif Is_Record_Type (T1) then
7911 -- Packed status must conform
7913 if Is_Packed (T1) /= Is_Packed (T2) then
7916 -- Otherwise we must check components. Typ2 maybe a constrained
7917 -- subtype with fewer components, so we compare the components
7918 -- of the base types.
7921 Record_Case : declare
7922 CD1, CD2 : Entity_Id;
7924 function Same_Rep return Boolean;
7925 -- CD1 and CD2 are either components or discriminants. This
7926 -- function tests whether the two have the same representation
7932 function Same_Rep return Boolean is
7934 if No (Component_Clause (CD1)) then
7935 return No (Component_Clause (CD2));
7939 Present (Component_Clause (CD2))
7941 Component_Bit_Offset (CD1) = Component_Bit_Offset (CD2)
7943 Esize (CD1) = Esize (CD2);
7947 -- Start of processing for Record_Case
7950 if Has_Discriminants (T1) then
7951 CD1 := First_Discriminant (T1);
7952 CD2 := First_Discriminant (T2);
7954 -- The number of discriminants may be different if the
7955 -- derived type has fewer (constrained by values). The
7956 -- invisible discriminants retain the representation of
7957 -- the original, so the discrepancy does not per se
7958 -- indicate a different representation.
7961 and then Present (CD2)
7963 if not Same_Rep then
7966 Next_Discriminant (CD1);
7967 Next_Discriminant (CD2);
7972 CD1 := First_Component (Underlying_Type (Base_Type (T1)));
7973 CD2 := First_Component (Underlying_Type (Base_Type (T2)));
7975 while Present (CD1) loop
7976 if not Same_Rep then
7979 Next_Component (CD1);
7980 Next_Component (CD2);
7988 -- For enumeration types, we must check each literal to see if the
7989 -- representation is the same. Note that we do not permit enumeration
7990 -- representation clauses for Character and Wide_Character, so these
7991 -- cases were already dealt with.
7993 elsif Is_Enumeration_Type (T1) then
7994 Enumeration_Case : declare
7998 L1 := First_Literal (T1);
7999 L2 := First_Literal (T2);
8001 while Present (L1) loop
8002 if Enumeration_Rep (L1) /= Enumeration_Rep (L2) then
8012 end Enumeration_Case;
8014 -- Any other types have the same representation for these purposes
8019 end Same_Representation;
8025 procedure Set_Biased
8029 Biased : Boolean := True)
8033 Set_Has_Biased_Representation (E);
8035 if Warn_On_Biased_Representation then
8037 ("?" & Msg & " forces biased representation for&", N, E);
8042 --------------------
8043 -- Set_Enum_Esize --
8044 --------------------
8046 procedure Set_Enum_Esize (T : Entity_Id) is
8054 -- Find the minimum standard size (8,16,32,64) that fits
8056 Lo := Enumeration_Rep (Entity (Type_Low_Bound (T)));
8057 Hi := Enumeration_Rep (Entity (Type_High_Bound (T)));
8060 if Lo >= -Uint_2**07 and then Hi < Uint_2**07 then
8061 Sz := Standard_Character_Size; -- May be > 8 on some targets
8063 elsif Lo >= -Uint_2**15 and then Hi < Uint_2**15 then
8066 elsif Lo >= -Uint_2**31 and then Hi < Uint_2**31 then
8069 else pragma Assert (Lo >= -Uint_2**63 and then Hi < Uint_2**63);
8074 if Hi < Uint_2**08 then
8075 Sz := Standard_Character_Size; -- May be > 8 on some targets
8077 elsif Hi < Uint_2**16 then
8080 elsif Hi < Uint_2**32 then
8083 else pragma Assert (Hi < Uint_2**63);
8088 -- That minimum is the proper size unless we have a foreign convention
8089 -- and the size required is 32 or less, in which case we bump the size
8090 -- up to 32. This is required for C and C++ and seems reasonable for
8091 -- all other foreign conventions.
8093 if Has_Foreign_Convention (T)
8094 and then Esize (T) < Standard_Integer_Size
8096 Init_Esize (T, Standard_Integer_Size);
8102 ------------------------------
8103 -- Validate_Address_Clauses --
8104 ------------------------------
8106 procedure Validate_Address_Clauses is
8108 for J in Address_Clause_Checks.First .. Address_Clause_Checks.Last loop
8110 ACCR : Address_Clause_Check_Record
8111 renames Address_Clause_Checks.Table (J);
8122 -- Skip processing of this entry if warning already posted
8124 if not Address_Warning_Posted (ACCR.N) then
8126 Expr := Original_Node (Expression (ACCR.N));
8130 X_Alignment := Alignment (ACCR.X);
8131 Y_Alignment := Alignment (ACCR.Y);
8133 -- Similarly obtain sizes
8135 X_Size := Esize (ACCR.X);
8136 Y_Size := Esize (ACCR.Y);
8138 -- Check for large object overlaying smaller one
8141 and then X_Size > Uint_0
8142 and then X_Size > Y_Size
8145 ("?& overlays smaller object", ACCR.N, ACCR.X);
8147 ("\?program execution may be erroneous", ACCR.N);
8148 Error_Msg_Uint_1 := X_Size;
8150 ("\?size of & is ^", ACCR.N, ACCR.X);
8151 Error_Msg_Uint_1 := Y_Size;
8153 ("\?size of & is ^", ACCR.N, ACCR.Y);
8155 -- Check for inadequate alignment, both of the base object
8156 -- and of the offset, if any.
8158 -- Note: we do not check the alignment if we gave a size
8159 -- warning, since it would likely be redundant.
8161 elsif Y_Alignment /= Uint_0
8162 and then (Y_Alignment < X_Alignment
8165 Nkind (Expr) = N_Attribute_Reference
8167 Attribute_Name (Expr) = Name_Address
8169 Has_Compatible_Alignment
8170 (ACCR.X, Prefix (Expr))
8171 /= Known_Compatible))
8174 ("?specified address for& may be inconsistent "
8178 ("\?program execution may be erroneous (RM 13.3(27))",
8180 Error_Msg_Uint_1 := X_Alignment;
8182 ("\?alignment of & is ^",
8184 Error_Msg_Uint_1 := Y_Alignment;
8186 ("\?alignment of & is ^",
8188 if Y_Alignment >= X_Alignment then
8190 ("\?but offset is not multiple of alignment",
8197 end Validate_Address_Clauses;
8199 ---------------------------
8200 -- Validate_Independence --
8201 ---------------------------
8203 procedure Validate_Independence is
8204 SU : constant Uint := UI_From_Int (System_Storage_Unit);
8212 procedure Check_Array_Type (Atyp : Entity_Id);
8213 -- Checks if the array type Atyp has independent components, and
8214 -- if not, outputs an appropriate set of error messages.
8216 procedure No_Independence;
8217 -- Output message that independence cannot be guaranteed
8219 function OK_Component (C : Entity_Id) return Boolean;
8220 -- Checks one component to see if it is independently accessible, and
8221 -- if so yields True, otherwise yields False if independent access
8222 -- cannot be guaranteed. This is a conservative routine, it only
8223 -- returns True if it knows for sure, it returns False if it knows
8224 -- there is a problem, or it cannot be sure there is no problem.
8226 procedure Reason_Bad_Component (C : Entity_Id);
8227 -- Outputs continuation message if a reason can be determined for
8228 -- the component C being bad.
8230 ----------------------
8231 -- Check_Array_Type --
8232 ----------------------
8234 procedure Check_Array_Type (Atyp : Entity_Id) is
8235 Ctyp : constant Entity_Id := Component_Type (Atyp);
8238 -- OK if no alignment clause, no pack, and no component size
8240 if not Has_Component_Size_Clause (Atyp)
8241 and then not Has_Alignment_Clause (Atyp)
8242 and then not Is_Packed (Atyp)
8247 -- Check actual component size
8249 if not Known_Component_Size (Atyp)
8250 or else not (Addressable (Component_Size (Atyp))
8251 and then Component_Size (Atyp) < 64)
8252 or else Component_Size (Atyp) mod Esize (Ctyp) /= 0
8256 -- Bad component size, check reason
8258 if Has_Component_Size_Clause (Atyp) then
8260 Get_Attribute_Definition_Clause
8261 (Atyp, Attribute_Component_Size);
8264 Error_Msg_Sloc := Sloc (P);
8265 Error_Msg_N ("\because of Component_Size clause#", N);
8270 if Is_Packed (Atyp) then
8271 P := Get_Rep_Pragma (Atyp, Name_Pack);
8274 Error_Msg_Sloc := Sloc (P);
8275 Error_Msg_N ("\because of pragma Pack#", N);
8280 -- No reason found, just return
8285 -- Array type is OK independence-wise
8288 end Check_Array_Type;
8290 ---------------------
8291 -- No_Independence --
8292 ---------------------
8294 procedure No_Independence is
8296 if Pragma_Name (N) = Name_Independent then
8298 ("independence cannot be guaranteed for&", N, E);
8301 ("independent components cannot be guaranteed for&", N, E);
8303 end No_Independence;
8309 function OK_Component (C : Entity_Id) return Boolean is
8310 Rec : constant Entity_Id := Scope (C);
8311 Ctyp : constant Entity_Id := Etype (C);
8314 -- OK if no component clause, no Pack, and no alignment clause
8316 if No (Component_Clause (C))
8317 and then not Is_Packed (Rec)
8318 and then not Has_Alignment_Clause (Rec)
8323 -- Here we look at the actual component layout. A component is
8324 -- addressable if its size is a multiple of the Esize of the
8325 -- component type, and its starting position in the record has
8326 -- appropriate alignment, and the record itself has appropriate
8327 -- alignment to guarantee the component alignment.
8329 -- Make sure sizes are static, always assume the worst for any
8330 -- cases where we cannot check static values.
8332 if not (Known_Static_Esize (C)
8333 and then Known_Static_Esize (Ctyp))
8338 -- Size of component must be addressable or greater than 64 bits
8339 -- and a multiple of bytes.
8341 if not Addressable (Esize (C))
8342 and then Esize (C) < Uint_64
8347 -- Check size is proper multiple
8349 if Esize (C) mod Esize (Ctyp) /= 0 then
8353 -- Check alignment of component is OK
8355 if not Known_Component_Bit_Offset (C)
8356 or else Component_Bit_Offset (C) < Uint_0
8357 or else Component_Bit_Offset (C) mod Esize (Ctyp) /= 0
8362 -- Check alignment of record type is OK
8364 if not Known_Alignment (Rec)
8365 or else (Alignment (Rec) * SU) mod Esize (Ctyp) /= 0
8370 -- All tests passed, component is addressable
8375 --------------------------
8376 -- Reason_Bad_Component --
8377 --------------------------
8379 procedure Reason_Bad_Component (C : Entity_Id) is
8380 Rec : constant Entity_Id := Scope (C);
8381 Ctyp : constant Entity_Id := Etype (C);
8384 -- If component clause present assume that's the problem
8386 if Present (Component_Clause (C)) then
8387 Error_Msg_Sloc := Sloc (Component_Clause (C));
8388 Error_Msg_N ("\because of Component_Clause#", N);
8392 -- If pragma Pack clause present, assume that's the problem
8394 if Is_Packed (Rec) then
8395 P := Get_Rep_Pragma (Rec, Name_Pack);
8398 Error_Msg_Sloc := Sloc (P);
8399 Error_Msg_N ("\because of pragma Pack#", N);
8404 -- See if record has bad alignment clause
8406 if Has_Alignment_Clause (Rec)
8407 and then Known_Alignment (Rec)
8408 and then (Alignment (Rec) * SU) mod Esize (Ctyp) /= 0
8410 P := Get_Attribute_Definition_Clause (Rec, Attribute_Alignment);
8413 Error_Msg_Sloc := Sloc (P);
8414 Error_Msg_N ("\because of Alignment clause#", N);
8418 -- Couldn't find a reason, so return without a message
8421 end Reason_Bad_Component;
8423 -- Start of processing for Validate_Independence
8426 for J in Independence_Checks.First .. Independence_Checks.Last loop
8427 N := Independence_Checks.Table (J).N;
8428 E := Independence_Checks.Table (J).E;
8429 IC := Pragma_Name (N) = Name_Independent_Components;
8431 -- Deal with component case
8433 if Ekind (E) = E_Discriminant or else Ekind (E) = E_Component then
8434 if not OK_Component (E) then
8436 Reason_Bad_Component (E);
8441 -- Deal with record with Independent_Components
8443 if IC and then Is_Record_Type (E) then
8444 Comp := First_Component_Or_Discriminant (E);
8445 while Present (Comp) loop
8446 if not OK_Component (Comp) then
8448 Reason_Bad_Component (Comp);
8452 Next_Component_Or_Discriminant (Comp);
8456 -- Deal with address clause case
8458 if Is_Object (E) then
8459 Addr := Address_Clause (E);
8461 if Present (Addr) then
8463 Error_Msg_Sloc := Sloc (Addr);
8464 Error_Msg_N ("\because of Address clause#", N);
8469 -- Deal with independent components for array type
8471 if IC and then Is_Array_Type (E) then
8472 Check_Array_Type (E);
8475 -- Deal with independent components for array object
8477 if IC and then Is_Object (E) and then Is_Array_Type (Etype (E)) then
8478 Check_Array_Type (Etype (E));
8483 end Validate_Independence;
8485 -----------------------------------
8486 -- Validate_Unchecked_Conversion --
8487 -----------------------------------
8489 procedure Validate_Unchecked_Conversion
8491 Act_Unit : Entity_Id)
8498 -- Obtain source and target types. Note that we call Ancestor_Subtype
8499 -- here because the processing for generic instantiation always makes
8500 -- subtypes, and we want the original frozen actual types.
8502 -- If we are dealing with private types, then do the check on their
8503 -- fully declared counterparts if the full declarations have been
8504 -- encountered (they don't have to be visible, but they must exist!)
8506 Source := Ancestor_Subtype (Etype (First_Formal (Act_Unit)));
8508 if Is_Private_Type (Source)
8509 and then Present (Underlying_Type (Source))
8511 Source := Underlying_Type (Source);
8514 Target := Ancestor_Subtype (Etype (Act_Unit));
8516 -- If either type is generic, the instantiation happens within a generic
8517 -- unit, and there is nothing to check. The proper check
8518 -- will happen when the enclosing generic is instantiated.
8520 if Is_Generic_Type (Source) or else Is_Generic_Type (Target) then
8524 if Is_Private_Type (Target)
8525 and then Present (Underlying_Type (Target))
8527 Target := Underlying_Type (Target);
8530 -- Source may be unconstrained array, but not target
8532 if Is_Array_Type (Target)
8533 and then not Is_Constrained (Target)
8536 ("unchecked conversion to unconstrained array not allowed", N);
8540 -- Warn if conversion between two different convention pointers
8542 if Is_Access_Type (Target)
8543 and then Is_Access_Type (Source)
8544 and then Convention (Target) /= Convention (Source)
8545 and then Warn_On_Unchecked_Conversion
8547 -- Give warnings for subprogram pointers only on most targets. The
8548 -- exception is VMS, where data pointers can have different lengths
8549 -- depending on the pointer convention.
8551 if Is_Access_Subprogram_Type (Target)
8552 or else Is_Access_Subprogram_Type (Source)
8553 or else OpenVMS_On_Target
8556 ("?conversion between pointers with different conventions!", N);
8560 -- Warn if one of the operands is Ada.Calendar.Time. Do not emit a
8561 -- warning when compiling GNAT-related sources.
8563 if Warn_On_Unchecked_Conversion
8564 and then not In_Predefined_Unit (N)
8565 and then RTU_Loaded (Ada_Calendar)
8567 (Chars (Source) = Name_Time
8569 Chars (Target) = Name_Time)
8571 -- If Ada.Calendar is loaded and the name of one of the operands is
8572 -- Time, there is a good chance that this is Ada.Calendar.Time.
8575 Calendar_Time : constant Entity_Id :=
8576 Full_View (RTE (RO_CA_Time));
8578 pragma Assert (Present (Calendar_Time));
8580 if Source = Calendar_Time
8581 or else Target = Calendar_Time
8584 ("?representation of 'Time values may change between " &
8585 "'G'N'A'T versions", N);
8590 -- Make entry in unchecked conversion table for later processing by
8591 -- Validate_Unchecked_Conversions, which will check sizes and alignments
8592 -- (using values set by the back-end where possible). This is only done
8593 -- if the appropriate warning is active.
8595 if Warn_On_Unchecked_Conversion then
8596 Unchecked_Conversions.Append
8597 (New_Val => UC_Entry'
8602 -- If both sizes are known statically now, then back end annotation
8603 -- is not required to do a proper check but if either size is not
8604 -- known statically, then we need the annotation.
8606 if Known_Static_RM_Size (Source)
8607 and then Known_Static_RM_Size (Target)
8611 Back_Annotate_Rep_Info := True;
8615 -- If unchecked conversion to access type, and access type is declared
8616 -- in the same unit as the unchecked conversion, then set the
8617 -- No_Strict_Aliasing flag (no strict aliasing is implicit in this
8620 if Is_Access_Type (Target) and then
8621 In_Same_Source_Unit (Target, N)
8623 Set_No_Strict_Aliasing (Implementation_Base_Type (Target));
8626 -- Generate N_Validate_Unchecked_Conversion node for back end in
8627 -- case the back end needs to perform special validation checks.
8629 -- Shouldn't this be in Exp_Ch13, since the check only gets done
8630 -- if we have full expansion and the back end is called ???
8633 Make_Validate_Unchecked_Conversion (Sloc (N));
8634 Set_Source_Type (Vnode, Source);
8635 Set_Target_Type (Vnode, Target);
8637 -- If the unchecked conversion node is in a list, just insert before it.
8638 -- If not we have some strange case, not worth bothering about.
8640 if Is_List_Member (N) then
8641 Insert_After (N, Vnode);
8643 end Validate_Unchecked_Conversion;
8645 ------------------------------------
8646 -- Validate_Unchecked_Conversions --
8647 ------------------------------------
8649 procedure Validate_Unchecked_Conversions is
8651 for N in Unchecked_Conversions.First .. Unchecked_Conversions.Last loop
8653 T : UC_Entry renames Unchecked_Conversions.Table (N);
8655 Eloc : constant Source_Ptr := T.Eloc;
8656 Source : constant Entity_Id := T.Source;
8657 Target : constant Entity_Id := T.Target;
8663 -- This validation check, which warns if we have unequal sizes for
8664 -- unchecked conversion, and thus potentially implementation
8665 -- dependent semantics, is one of the few occasions on which we
8666 -- use the official RM size instead of Esize. See description in
8667 -- Einfo "Handling of Type'Size Values" for details.
8669 if Serious_Errors_Detected = 0
8670 and then Known_Static_RM_Size (Source)
8671 and then Known_Static_RM_Size (Target)
8673 -- Don't do the check if warnings off for either type, note the
8674 -- deliberate use of OR here instead of OR ELSE to get the flag
8675 -- Warnings_Off_Used set for both types if appropriate.
8677 and then not (Has_Warnings_Off (Source)
8679 Has_Warnings_Off (Target))
8681 Source_Siz := RM_Size (Source);
8682 Target_Siz := RM_Size (Target);
8684 if Source_Siz /= Target_Siz then
8686 ("?types for unchecked conversion have different sizes!",
8689 if All_Errors_Mode then
8690 Error_Msg_Name_1 := Chars (Source);
8691 Error_Msg_Uint_1 := Source_Siz;
8692 Error_Msg_Name_2 := Chars (Target);
8693 Error_Msg_Uint_2 := Target_Siz;
8694 Error_Msg ("\size of % is ^, size of % is ^?", Eloc);
8696 Error_Msg_Uint_1 := UI_Abs (Source_Siz - Target_Siz);
8698 if Is_Discrete_Type (Source)
8699 and then Is_Discrete_Type (Target)
8701 if Source_Siz > Target_Siz then
8703 ("\?^ high order bits of source will be ignored!",
8706 elsif Is_Unsigned_Type (Source) then
8708 ("\?source will be extended with ^ high order " &
8709 "zero bits?!", Eloc);
8713 ("\?source will be extended with ^ high order " &
8718 elsif Source_Siz < Target_Siz then
8719 if Is_Discrete_Type (Target) then
8720 if Bytes_Big_Endian then
8722 ("\?target value will include ^ undefined " &
8727 ("\?target value will include ^ undefined " &
8734 ("\?^ trailing bits of target value will be " &
8735 "undefined!", Eloc);
8738 else pragma Assert (Source_Siz > Target_Siz);
8740 ("\?^ trailing bits of source will be ignored!",
8747 -- If both types are access types, we need to check the alignment.
8748 -- If the alignment of both is specified, we can do it here.
8750 if Serious_Errors_Detected = 0
8751 and then Ekind (Source) in Access_Kind
8752 and then Ekind (Target) in Access_Kind
8753 and then Target_Strict_Alignment
8754 and then Present (Designated_Type (Source))
8755 and then Present (Designated_Type (Target))
8758 D_Source : constant Entity_Id := Designated_Type (Source);
8759 D_Target : constant Entity_Id := Designated_Type (Target);
8762 if Known_Alignment (D_Source)
8763 and then Known_Alignment (D_Target)
8766 Source_Align : constant Uint := Alignment (D_Source);
8767 Target_Align : constant Uint := Alignment (D_Target);
8770 if Source_Align < Target_Align
8771 and then not Is_Tagged_Type (D_Source)
8773 -- Suppress warning if warnings suppressed on either
8774 -- type or either designated type. Note the use of
8775 -- OR here instead of OR ELSE. That is intentional,
8776 -- we would like to set flag Warnings_Off_Used in
8777 -- all types for which warnings are suppressed.
8779 and then not (Has_Warnings_Off (D_Source)
8781 Has_Warnings_Off (D_Target)
8783 Has_Warnings_Off (Source)
8785 Has_Warnings_Off (Target))
8787 Error_Msg_Uint_1 := Target_Align;
8788 Error_Msg_Uint_2 := Source_Align;
8789 Error_Msg_Node_1 := D_Target;
8790 Error_Msg_Node_2 := D_Source;
8792 ("?alignment of & (^) is stricter than " &
8793 "alignment of & (^)!", Eloc);
8795 ("\?resulting access value may have invalid " &
8796 "alignment!", Eloc);
8804 end Validate_Unchecked_Conversions;