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 := False;
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 pragma Assert (not Delay_Required);
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 pragma Assert (not Delay_Required);
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 pragma Assert (not Delay_Required);
1052 Delay_Required := True;
1053 Set_Is_Delayed_Aspect (Aspect);
1056 -- Aspects corresponding to pragmas with two arguments, where
1057 -- the first argument is a local name referring to the entity,
1058 -- and the second argument is the aspect definition expression
1059 -- which is an expression that does not get analyzed.
1061 when Aspect_Suppress |
1062 Aspect_Unsuppress =>
1064 -- Construct the pragma
1068 Pragma_Argument_Associations => New_List (
1069 New_Occurrence_Of (E, Loc),
1070 Relocate_Node (Expr)),
1071 Pragma_Identifier =>
1072 Make_Identifier (Sloc (Id), Chars (Id)));
1074 -- We don't have to play the delay game here, since the only
1075 -- values are check names which don't get analyzed anyway.
1077 pragma Assert (not Delay_Required);
1079 -- Aspects corresponding to pragmas with two arguments, where
1080 -- the second argument is a local name referring to the entity,
1081 -- and the first argument is the aspect definition expression.
1083 when Aspect_Warnings =>
1085 -- Construct the pragma
1089 Pragma_Argument_Associations => New_List (
1090 Relocate_Node (Expr),
1091 New_Occurrence_Of (E, Loc)),
1092 Pragma_Identifier =>
1093 Make_Identifier (Sloc (Id), Chars (Id)),
1094 Class_Present => Class_Present (Aspect));
1096 -- We don't have to play the delay game here, since the only
1097 -- values are ON/OFF which don't get analyzed anyway.
1099 pragma Assert (not Delay_Required);
1101 -- Default_Value and Default_Component_Value aspects. These
1102 -- are specially handled because they have no corresponding
1103 -- pragmas or attributes.
1105 when Aspect_Default_Value | Aspect_Default_Component_Value =>
1106 Error_Msg_Name_1 := Chars (Id);
1108 if not Is_Type (E) then
1109 Error_Msg_N ("aspect% can only apply to a type", Id);
1112 elsif not Is_First_Subtype (E) then
1113 Error_Msg_N ("aspect% cannot apply to subtype", Id);
1116 elsif A_Id = Aspect_Default_Value
1117 and then not Is_Scalar_Type (E)
1120 ("aspect% can only be applied to scalar type", Id);
1123 elsif A_Id = Aspect_Default_Component_Value then
1124 if not Is_Array_Type (E) then
1126 ("aspect% can only be applied to array type", Id);
1128 elsif not Is_Scalar_Type (Component_Type (E)) then
1130 ("aspect% requires scalar components", Id);
1136 Delay_Required := True;
1137 Set_Is_Delayed_Aspect (Aspect);
1138 Set_Has_Default_Aspect (Base_Type (Entity (Ent)));
1140 when Aspect_Attach_Handler =>
1143 Pragma_Identifier =>
1144 Make_Identifier (Sloc (Id), Name_Attach_Handler),
1145 Pragma_Argument_Associations =>
1146 New_List (Ent, Relocate_Node (Expr)));
1148 Set_From_Aspect_Specification (Aitem, True);
1149 Set_Corresponding_Aspect (Aitem, Aspect);
1151 pragma Assert (not Delay_Required);
1153 when Aspect_Priority |
1154 Aspect_Interrupt_Priority |
1155 Aspect_Dispatching_Domain |
1161 if A_Id = Aspect_Priority then
1162 Pname := Name_Priority;
1164 elsif A_Id = Aspect_Interrupt_Priority then
1165 Pname := Name_Interrupt_Priority;
1167 elsif A_Id = Aspect_CPU then
1171 Pname := Name_Dispatching_Domain;
1176 Pragma_Identifier =>
1177 Make_Identifier (Sloc (Id), Pname),
1178 Pragma_Argument_Associations =>
1180 (Make_Pragma_Argument_Association
1182 Expression => Relocate_Node (Expr))));
1184 Set_From_Aspect_Specification (Aitem, True);
1185 Set_Corresponding_Aspect (Aitem, Aspect);
1187 pragma Assert (not Delay_Required);
1190 -- Aspects Pre/Post generate Precondition/Postcondition pragmas
1191 -- with a first argument that is the expression, and a second
1192 -- argument that is an informative message if the test fails.
1193 -- This is inserted right after the declaration, to get the
1194 -- required pragma placement. The processing for the pragmas
1195 -- takes care of the required delay.
1197 when Pre_Post_Aspects => declare
1201 if A_Id = Aspect_Pre or else A_Id = Aspect_Precondition then
1202 Pname := Name_Precondition;
1204 Pname := Name_Postcondition;
1207 -- If the expressions is of the form A and then B, then
1208 -- we generate separate Pre/Post aspects for the separate
1209 -- clauses. Since we allow multiple pragmas, there is no
1210 -- problem in allowing multiple Pre/Post aspects internally.
1211 -- These should be treated in reverse order (B first and
1212 -- A second) since they are later inserted just after N in
1213 -- the order they are treated. This way, the pragma for A
1214 -- ends up preceding the pragma for B, which may have an
1215 -- importance for the error raised (either constraint error
1216 -- or precondition error).
1218 -- We do not do this for Pre'Class, since we have to put
1219 -- these conditions together in a complex OR expression
1221 if Pname = Name_Postcondition
1222 or else not Class_Present (Aspect)
1224 while Nkind (Expr) = N_And_Then loop
1225 Insert_After (Aspect,
1226 Make_Aspect_Specification (Sloc (Left_Opnd (Expr)),
1227 Identifier => Identifier (Aspect),
1228 Expression => Relocate_Node (Left_Opnd (Expr)),
1229 Class_Present => Class_Present (Aspect),
1230 Split_PPC => True));
1231 Rewrite (Expr, Relocate_Node (Right_Opnd (Expr)));
1232 Eloc := Sloc (Expr);
1236 -- Build the precondition/postcondition pragma
1240 Pragma_Identifier =>
1241 Make_Identifier (Sloc (Id), Pname),
1242 Class_Present => Class_Present (Aspect),
1243 Split_PPC => Split_PPC (Aspect),
1244 Pragma_Argument_Associations => New_List (
1245 Make_Pragma_Argument_Association (Eloc,
1246 Chars => Name_Check,
1247 Expression => Relocate_Node (Expr))));
1249 -- Add message unless exception messages are suppressed
1251 if not Opt.Exception_Locations_Suppressed then
1252 Append_To (Pragma_Argument_Associations (Aitem),
1253 Make_Pragma_Argument_Association (Eloc,
1254 Chars => Name_Message,
1256 Make_String_Literal (Eloc,
1258 & Get_Name_String (Pname)
1260 & Build_Location_String (Eloc))));
1263 Set_From_Aspect_Specification (Aitem, True);
1264 Set_Corresponding_Aspect (Aitem, Aspect);
1265 Set_Is_Delayed_Aspect (Aspect);
1267 -- For Pre/Post cases, insert immediately after the entity
1268 -- declaration, since that is the required pragma placement.
1269 -- Note that for these aspects, we do not have to worry
1270 -- about delay issues, since the pragmas themselves deal
1271 -- with delay of visibility for the expression analysis.
1273 -- If the entity is a library-level subprogram, the pre/
1274 -- postconditions must be treated as late pragmas.
1276 if Nkind (Parent (N)) = N_Compilation_Unit then
1277 Add_Global_Declaration (Aitem);
1279 Insert_After (N, Aitem);
1285 -- Invariant aspects generate a corresponding pragma with a
1286 -- first argument that is the entity, a second argument that is
1287 -- the expression and a third argument that is an appropriate
1288 -- message. This is inserted right after the declaration, to
1289 -- get the required pragma placement. The pragma processing
1290 -- takes care of the required delay.
1292 when Aspect_Invariant |
1293 Aspect_Type_Invariant =>
1295 -- Analysis of the pragma will verify placement legality:
1296 -- an invariant must apply to a private type, or appear in
1297 -- the private part of a spec and apply to a completion.
1299 -- Construct the pragma
1303 Pragma_Argument_Associations =>
1304 New_List (Ent, Relocate_Node (Expr)),
1305 Class_Present => Class_Present (Aspect),
1306 Pragma_Identifier =>
1307 Make_Identifier (Sloc (Id), Name_Invariant));
1309 -- Add message unless exception messages are suppressed
1311 if not Opt.Exception_Locations_Suppressed then
1312 Append_To (Pragma_Argument_Associations (Aitem),
1313 Make_Pragma_Argument_Association (Eloc,
1314 Chars => Name_Message,
1316 Make_String_Literal (Eloc,
1317 Strval => "failed invariant from "
1318 & Build_Location_String (Eloc))));
1321 Set_From_Aspect_Specification (Aitem, True);
1322 Set_Corresponding_Aspect (Aitem, Aspect);
1323 Set_Is_Delayed_Aspect (Aspect);
1325 -- For Invariant case, insert immediately after the entity
1326 -- declaration. We do not have to worry about delay issues
1327 -- since the pragma processing takes care of this.
1329 Insert_After (N, Aitem);
1332 -- Predicate aspects generate a corresponding pragma with a
1333 -- first argument that is the entity, and the second argument
1334 -- is the expression.
1336 when Aspect_Dynamic_Predicate |
1338 Aspect_Static_Predicate =>
1340 -- Construct the pragma (always a pragma Predicate, with
1341 -- flags recording whether it is static/dynamic).
1345 Pragma_Argument_Associations =>
1346 New_List (Ent, Relocate_Node (Expr)),
1347 Class_Present => Class_Present (Aspect),
1348 Pragma_Identifier =>
1349 Make_Identifier (Sloc (Id), Name_Predicate));
1351 Set_From_Aspect_Specification (Aitem, True);
1352 Set_Corresponding_Aspect (Aitem, Aspect);
1354 -- Make sure we have a freeze node (it might otherwise be
1355 -- missing in cases like subtype X is Y, and we would not
1356 -- have a place to build the predicate function).
1358 Set_Has_Predicates (E);
1360 if Is_Private_Type (E)
1361 and then Present (Full_View (E))
1363 Set_Has_Predicates (Full_View (E));
1364 Set_Has_Delayed_Aspects (Full_View (E));
1367 Ensure_Freeze_Node (E);
1368 Set_Is_Delayed_Aspect (Aspect);
1369 Delay_Required := True;
1371 when Aspect_Test_Case => declare
1373 Comp_Expr : Node_Id;
1374 Comp_Assn : Node_Id;
1379 if Nkind (Parent (N)) = N_Compilation_Unit then
1381 ("incorrect placement of aspect `Test_Case`", E);
1385 if Nkind (Expr) /= N_Aggregate then
1387 ("wrong syntax for aspect `Test_Case` for &", Id, E);
1391 Comp_Expr := First (Expressions (Expr));
1392 while Present (Comp_Expr) loop
1393 Append (Relocate_Node (Comp_Expr), Args);
1397 Comp_Assn := First (Component_Associations (Expr));
1398 while Present (Comp_Assn) loop
1399 if List_Length (Choices (Comp_Assn)) /= 1
1401 Nkind (First (Choices (Comp_Assn))) /= N_Identifier
1404 ("wrong syntax for aspect `Test_Case` for &", Id, E);
1408 Append (Make_Pragma_Argument_Association (
1409 Sloc => Sloc (Comp_Assn),
1410 Chars => Chars (First (Choices (Comp_Assn))),
1411 Expression => Relocate_Node (Expression (Comp_Assn))),
1416 -- Build the test-case pragma
1420 Pragma_Identifier =>
1421 Make_Identifier (Sloc (Id), Name_Test_Case),
1422 Pragma_Argument_Associations =>
1425 Set_From_Aspect_Specification (Aitem, True);
1426 Set_Corresponding_Aspect (Aitem, Aspect);
1427 Set_Is_Delayed_Aspect (Aspect);
1429 -- Insert immediately after the entity declaration
1431 Insert_After (N, Aitem);
1437 -- If a delay is required, we delay the freeze (not much point in
1438 -- delaying the aspect if we don't delay the freeze!). The pragma
1439 -- or attribute clause if there is one is then attached to the
1440 -- aspect specification which is placed in the rep item list.
1442 if Delay_Required then
1443 if Present (Aitem) then
1444 Set_From_Aspect_Specification (Aitem, True);
1446 if Nkind (Aitem) = N_Pragma then
1447 Set_Corresponding_Aspect (Aitem, Aspect);
1450 Set_Is_Delayed_Aspect (Aitem);
1451 Set_Aspect_Rep_Item (Aspect, Aitem);
1454 Ensure_Freeze_Node (E);
1455 Set_Has_Delayed_Aspects (E);
1456 Record_Rep_Item (E, Aspect);
1458 -- If no delay required, insert the pragma/clause in the tree
1461 Set_From_Aspect_Specification (Aitem, True);
1463 if Nkind (Aitem) = N_Pragma then
1464 Set_Corresponding_Aspect (Aitem, Aspect);
1467 -- If this is a compilation unit, we will put the pragma in
1468 -- the Pragmas_After list of the N_Compilation_Unit_Aux node.
1470 if Nkind (Parent (Ins_Node)) = N_Compilation_Unit then
1472 Aux : constant Node_Id :=
1473 Aux_Decls_Node (Parent (Ins_Node));
1476 pragma Assert (Nkind (Aux) = N_Compilation_Unit_Aux);
1478 if No (Pragmas_After (Aux)) then
1479 Set_Pragmas_After (Aux, Empty_List);
1482 -- For Pre_Post put at start of list, otherwise at end
1484 if A_Id in Pre_Post_Aspects then
1485 Prepend (Aitem, Pragmas_After (Aux));
1487 Append (Aitem, Pragmas_After (Aux));
1491 -- Here if not compilation unit case
1496 -- For Pre/Post cases, insert immediately after the
1497 -- entity declaration, since that is the required pragma
1500 when Pre_Post_Aspects =>
1501 Insert_After (N, Aitem);
1503 -- For Priority aspects, insert into the task or
1504 -- protected definition, which we need to create if it's
1505 -- not there. The same applies to CPU and
1506 -- Dispatching_Domain but only to tasks.
1508 when Aspect_Priority |
1509 Aspect_Interrupt_Priority |
1510 Aspect_Dispatching_Domain |
1513 T : Node_Id; -- the type declaration
1514 L : List_Id; -- list of decls of task/protected
1517 if Nkind (N) = N_Object_Declaration then
1518 T := Parent (Etype (Defining_Identifier (N)));
1523 if Nkind (T) = N_Protected_Type_Declaration
1524 and then A_Id /= Aspect_Dispatching_Domain
1525 and then A_Id /= Aspect_CPU
1528 (Present (Protected_Definition (T)));
1530 L := Visible_Declarations
1531 (Protected_Definition (T));
1533 elsif Nkind (T) = N_Task_Type_Declaration then
1534 if No (Task_Definition (T)) then
1537 Make_Task_Definition
1539 Visible_Declarations => New_List,
1540 End_Label => Empty));
1543 L := Visible_Declarations (Task_Definition (T));
1546 raise Program_Error;
1549 Prepend (Aitem, To => L);
1551 -- Analyze rewritten pragma. Otherwise, its
1552 -- analysis is done too late, after the task or
1553 -- protected object has been created.
1558 -- For all other cases, insert in sequence
1561 Insert_After (Ins_Node, Aitem);
1570 end loop Aspect_Loop;
1571 end Analyze_Aspect_Specifications;
1573 -----------------------
1574 -- Analyze_At_Clause --
1575 -----------------------
1577 -- An at clause is replaced by the corresponding Address attribute
1578 -- definition clause that is the preferred approach in Ada 95.
1580 procedure Analyze_At_Clause (N : Node_Id) is
1581 CS : constant Boolean := Comes_From_Source (N);
1584 -- This is an obsolescent feature
1586 Check_Restriction (No_Obsolescent_Features, N);
1588 if Warn_On_Obsolescent_Feature then
1590 ("at clause is an obsolescent feature (RM J.7(2))?", N);
1592 ("\use address attribute definition clause instead?", N);
1595 -- Rewrite as address clause
1598 Make_Attribute_Definition_Clause (Sloc (N),
1599 Name => Identifier (N),
1600 Chars => Name_Address,
1601 Expression => Expression (N)));
1603 -- We preserve Comes_From_Source, since logically the clause still
1604 -- comes from the source program even though it is changed in form.
1606 Set_Comes_From_Source (N, CS);
1608 -- Analyze rewritten clause
1610 Analyze_Attribute_Definition_Clause (N);
1611 end Analyze_At_Clause;
1613 -----------------------------------------
1614 -- Analyze_Attribute_Definition_Clause --
1615 -----------------------------------------
1617 procedure Analyze_Attribute_Definition_Clause (N : Node_Id) is
1618 Loc : constant Source_Ptr := Sloc (N);
1619 Nam : constant Node_Id := Name (N);
1620 Attr : constant Name_Id := Chars (N);
1621 Expr : constant Node_Id := Expression (N);
1622 Id : constant Attribute_Id := Get_Attribute_Id (Attr);
1625 -- The entity of Nam after it is analyzed. In the case of an incomplete
1626 -- type, this is the underlying type.
1629 -- The underlying entity to which the attribute applies. Generally this
1630 -- is the Underlying_Type of Ent, except in the case where the clause
1631 -- applies to full view of incomplete type or private type in which case
1632 -- U_Ent is just a copy of Ent.
1634 FOnly : Boolean := False;
1635 -- Reset to True for subtype specific attribute (Alignment, Size)
1636 -- and for stream attributes, i.e. those cases where in the call
1637 -- to Rep_Item_Too_Late, FOnly is set True so that only the freezing
1638 -- rules are checked. Note that the case of stream attributes is not
1639 -- clear from the RM, but see AI95-00137. Also, the RM seems to
1640 -- disallow Storage_Size for derived task types, but that is also
1641 -- clearly unintentional.
1643 procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type);
1644 -- Common processing for 'Read, 'Write, 'Input and 'Output attribute
1645 -- definition clauses.
1647 function Duplicate_Clause return Boolean;
1648 -- This routine checks if the aspect for U_Ent being given by attribute
1649 -- definition clause N is for an aspect that has already been specified,
1650 -- and if so gives an error message. If there is a duplicate, True is
1651 -- returned, otherwise if there is no error, False is returned.
1653 procedure Check_Indexing_Functions;
1654 -- Check that the function in Constant_Indexing or Variable_Indexing
1655 -- attribute has the proper type structure. If the name is overloaded,
1656 -- check that all interpretations are legal.
1658 procedure Check_Iterator_Functions;
1659 -- Check that there is a single function in Default_Iterator attribute
1660 -- has the proper type structure.
1662 function Check_Primitive_Function (Subp : Entity_Id) return Boolean;
1663 -- Common legality check for the previous two
1665 -----------------------------------
1666 -- Analyze_Stream_TSS_Definition --
1667 -----------------------------------
1669 procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type) is
1670 Subp : Entity_Id := Empty;
1675 Is_Read : constant Boolean := (TSS_Nam = TSS_Stream_Read);
1676 -- True for Read attribute, false for other attributes
1678 function Has_Good_Profile (Subp : Entity_Id) return Boolean;
1679 -- Return true if the entity is a subprogram with an appropriate
1680 -- profile for the attribute being defined.
1682 ----------------------
1683 -- Has_Good_Profile --
1684 ----------------------
1686 function Has_Good_Profile (Subp : Entity_Id) return Boolean is
1688 Is_Function : constant Boolean := (TSS_Nam = TSS_Stream_Input);
1689 Expected_Ekind : constant array (Boolean) of Entity_Kind :=
1690 (False => E_Procedure, True => E_Function);
1694 if Ekind (Subp) /= Expected_Ekind (Is_Function) then
1698 F := First_Formal (Subp);
1701 or else Ekind (Etype (F)) /= E_Anonymous_Access_Type
1702 or else Designated_Type (Etype (F)) /=
1703 Class_Wide_Type (RTE (RE_Root_Stream_Type))
1708 if not Is_Function then
1712 Expected_Mode : constant array (Boolean) of Entity_Kind :=
1713 (False => E_In_Parameter,
1714 True => E_Out_Parameter);
1716 if Parameter_Mode (F) /= Expected_Mode (Is_Read) then
1724 Typ := Etype (Subp);
1727 return Base_Type (Typ) = Base_Type (Ent)
1728 and then No (Next_Formal (F));
1729 end Has_Good_Profile;
1731 -- Start of processing for Analyze_Stream_TSS_Definition
1736 if not Is_Type (U_Ent) then
1737 Error_Msg_N ("local name must be a subtype", Nam);
1741 Pnam := TSS (Base_Type (U_Ent), TSS_Nam);
1743 -- If Pnam is present, it can be either inherited from an ancestor
1744 -- type (in which case it is legal to redefine it for this type), or
1745 -- be a previous definition of the attribute for the same type (in
1746 -- which case it is illegal).
1748 -- In the first case, it will have been analyzed already, and we
1749 -- can check that its profile does not match the expected profile
1750 -- for a stream attribute of U_Ent. In the second case, either Pnam
1751 -- has been analyzed (and has the expected profile), or it has not
1752 -- been analyzed yet (case of a type that has not been frozen yet
1753 -- and for which the stream attribute has been set using Set_TSS).
1756 and then (No (First_Entity (Pnam)) or else Has_Good_Profile (Pnam))
1758 Error_Msg_Sloc := Sloc (Pnam);
1759 Error_Msg_Name_1 := Attr;
1760 Error_Msg_N ("% attribute already defined #", Nam);
1766 if Is_Entity_Name (Expr) then
1767 if not Is_Overloaded (Expr) then
1768 if Has_Good_Profile (Entity (Expr)) then
1769 Subp := Entity (Expr);
1773 Get_First_Interp (Expr, I, It);
1774 while Present (It.Nam) loop
1775 if Has_Good_Profile (It.Nam) then
1780 Get_Next_Interp (I, It);
1785 if Present (Subp) then
1786 if Is_Abstract_Subprogram (Subp) then
1787 Error_Msg_N ("stream subprogram must not be abstract", Expr);
1791 Set_Entity (Expr, Subp);
1792 Set_Etype (Expr, Etype (Subp));
1794 New_Stream_Subprogram (N, U_Ent, Subp, TSS_Nam);
1797 Error_Msg_Name_1 := Attr;
1798 Error_Msg_N ("incorrect expression for% attribute", Expr);
1800 end Analyze_Stream_TSS_Definition;
1802 ------------------------------
1803 -- Check_Indexing_Functions --
1804 ------------------------------
1806 procedure Check_Indexing_Functions is
1808 procedure Check_One_Function (Subp : Entity_Id);
1809 -- Check one possible interpretation
1811 ------------------------
1812 -- Check_One_Function --
1813 ------------------------
1815 procedure Check_One_Function (Subp : Entity_Id) is
1817 if not Check_Primitive_Function (Subp) then
1819 ("aspect Indexing requires a function that applies to type&",
1823 if not Has_Implicit_Dereference (Etype (Subp)) then
1825 ("function for indexing must return a reference type", Subp);
1827 end Check_One_Function;
1829 -- Start of processing for Check_Indexing_Functions
1838 if not Is_Overloaded (Expr) then
1839 Check_One_Function (Entity (Expr));
1847 Get_First_Interp (Expr, I, It);
1848 while Present (It.Nam) loop
1850 -- Note that analysis will have added the interpretation
1851 -- that corresponds to the dereference. We only check the
1852 -- subprogram itself.
1854 if Is_Overloadable (It.Nam) then
1855 Check_One_Function (It.Nam);
1858 Get_Next_Interp (I, It);
1862 end Check_Indexing_Functions;
1864 ------------------------------
1865 -- Check_Iterator_Functions --
1866 ------------------------------
1868 procedure Check_Iterator_Functions is
1869 Default : Entity_Id;
1871 function Valid_Default_Iterator (Subp : Entity_Id) return Boolean;
1872 -- Check one possible interpretation for validity
1874 ----------------------------
1875 -- Valid_Default_Iterator --
1876 ----------------------------
1878 function Valid_Default_Iterator (Subp : Entity_Id) return Boolean is
1882 if not Check_Primitive_Function (Subp) then
1885 Formal := First_Formal (Subp);
1888 -- False if any subsequent formal has no default expression
1890 Formal := Next_Formal (Formal);
1891 while Present (Formal) loop
1892 if No (Expression (Parent (Formal))) then
1896 Next_Formal (Formal);
1899 -- True if all subsequent formals have default expressions
1902 end Valid_Default_Iterator;
1904 -- Start of processing for Check_Iterator_Functions
1909 if not Is_Entity_Name (Expr) then
1910 Error_Msg_N ("aspect Iterator must be a function name", Expr);
1913 if not Is_Overloaded (Expr) then
1914 if not Check_Primitive_Function (Entity (Expr)) then
1916 ("aspect Indexing requires a function that applies to type&",
1917 Entity (Expr), Ent);
1920 if not Valid_Default_Iterator (Entity (Expr)) then
1921 Error_Msg_N ("improper function for default iterator", Expr);
1931 Get_First_Interp (Expr, I, It);
1932 while Present (It.Nam) loop
1933 if not Check_Primitive_Function (It.Nam)
1934 or else not Valid_Default_Iterator (It.Nam)
1938 elsif Present (Default) then
1939 Error_Msg_N ("default iterator must be unique", Expr);
1945 Get_Next_Interp (I, It);
1949 if Present (Default) then
1950 Set_Entity (Expr, Default);
1951 Set_Is_Overloaded (Expr, False);
1954 end Check_Iterator_Functions;
1956 -------------------------------
1957 -- Check_Primitive_Function --
1958 -------------------------------
1960 function Check_Primitive_Function (Subp : Entity_Id) return Boolean is
1964 if Ekind (Subp) /= E_Function then
1968 if No (First_Formal (Subp)) then
1971 Ctrl := Etype (First_Formal (Subp));
1975 or else Ctrl = Class_Wide_Type (Ent)
1977 (Ekind (Ctrl) = E_Anonymous_Access_Type
1979 (Designated_Type (Ctrl) = Ent
1980 or else Designated_Type (Ctrl) = Class_Wide_Type (Ent)))
1989 end Check_Primitive_Function;
1991 ----------------------
1992 -- Duplicate_Clause --
1993 ----------------------
1995 function Duplicate_Clause return Boolean is
1999 -- Nothing to do if this attribute definition clause comes from
2000 -- an aspect specification, since we could not be duplicating an
2001 -- explicit clause, and we dealt with the case of duplicated aspects
2002 -- in Analyze_Aspect_Specifications.
2004 if From_Aspect_Specification (N) then
2008 -- Otherwise current clause may duplicate previous clause or a
2009 -- previously given aspect specification for the same aspect.
2011 A := Get_Rep_Item_For_Entity (U_Ent, Chars (N));
2014 if Entity (A) = U_Ent then
2015 Error_Msg_Name_1 := Chars (N);
2016 Error_Msg_Sloc := Sloc (A);
2017 Error_Msg_NE ("aspect% for & previously given#", N, U_Ent);
2023 end Duplicate_Clause;
2025 -- Start of processing for Analyze_Attribute_Definition_Clause
2028 -- The following code is a defense against recursion. Not clear that
2029 -- this can happen legitimately, but perhaps some error situations
2030 -- can cause it, and we did see this recursion during testing.
2032 if Analyzed (N) then
2035 Set_Analyzed (N, True);
2038 -- Process Ignore_Rep_Clauses option (we also ignore rep clauses in
2039 -- CodePeer mode or Alfa mode, since they are not relevant in these
2042 if Ignore_Rep_Clauses or CodePeer_Mode or Alfa_Mode then
2045 -- The following should be ignored. They do not affect legality
2046 -- and may be target dependent. The basic idea of -gnatI is to
2047 -- ignore any rep clauses that may be target dependent but do not
2048 -- affect legality (except possibly to be rejected because they
2049 -- are incompatible with the compilation target).
2051 when Attribute_Alignment |
2052 Attribute_Bit_Order |
2053 Attribute_Component_Size |
2054 Attribute_Machine_Radix |
2055 Attribute_Object_Size |
2057 Attribute_Stream_Size |
2058 Attribute_Value_Size =>
2059 Rewrite (N, Make_Null_Statement (Sloc (N)));
2062 -- We do not want too ignore 'Small in CodePeer_Mode or Alfa_Mode,
2063 -- since it has an impact on the exact computations performed.
2065 -- Perhaps 'Small should also not be ignored by
2066 -- Ignore_Rep_Clauses ???
2068 when Attribute_Small =>
2069 if Ignore_Rep_Clauses then
2070 Rewrite (N, Make_Null_Statement (Sloc (N)));
2074 -- The following should not be ignored, because in the first place
2075 -- they are reasonably portable, and should not cause problems in
2076 -- compiling code from another target, and also they do affect
2077 -- legality, e.g. failing to provide a stream attribute for a
2078 -- type may make a program illegal.
2080 when Attribute_External_Tag |
2084 Attribute_Storage_Pool |
2085 Attribute_Storage_Size |
2089 -- Other cases are errors ("attribute& cannot be set with
2090 -- definition clause"), which will be caught below.
2098 Ent := Entity (Nam);
2100 if Rep_Item_Too_Early (Ent, N) then
2104 -- Rep clause applies to full view of incomplete type or private type if
2105 -- we have one (if not, this is a premature use of the type). However,
2106 -- certain semantic checks need to be done on the specified entity (i.e.
2107 -- the private view), so we save it in Ent.
2109 if Is_Private_Type (Ent)
2110 and then Is_Derived_Type (Ent)
2111 and then not Is_Tagged_Type (Ent)
2112 and then No (Full_View (Ent))
2114 -- If this is a private type whose completion is a derivation from
2115 -- another private type, there is no full view, and the attribute
2116 -- belongs to the type itself, not its underlying parent.
2120 elsif Ekind (Ent) = E_Incomplete_Type then
2122 -- The attribute applies to the full view, set the entity of the
2123 -- attribute definition accordingly.
2125 Ent := Underlying_Type (Ent);
2127 Set_Entity (Nam, Ent);
2130 U_Ent := Underlying_Type (Ent);
2133 -- Complete other routine error checks
2135 if Etype (Nam) = Any_Type then
2138 elsif Scope (Ent) /= Current_Scope then
2139 Error_Msg_N ("entity must be declared in this scope", Nam);
2142 elsif No (U_Ent) then
2145 elsif Is_Type (U_Ent)
2146 and then not Is_First_Subtype (U_Ent)
2147 and then Id /= Attribute_Object_Size
2148 and then Id /= Attribute_Value_Size
2149 and then not From_At_Mod (N)
2151 Error_Msg_N ("cannot specify attribute for subtype", Nam);
2155 Set_Entity (N, U_Ent);
2157 -- Switch on particular attribute
2165 -- Address attribute definition clause
2167 when Attribute_Address => Address : begin
2169 -- A little error check, catch for X'Address use X'Address;
2171 if Nkind (Nam) = N_Identifier
2172 and then Nkind (Expr) = N_Attribute_Reference
2173 and then Attribute_Name (Expr) = Name_Address
2174 and then Nkind (Prefix (Expr)) = N_Identifier
2175 and then Chars (Nam) = Chars (Prefix (Expr))
2178 ("address for & is self-referencing", Prefix (Expr), Ent);
2182 -- Not that special case, carry on with analysis of expression
2184 Analyze_And_Resolve (Expr, RTE (RE_Address));
2186 -- Even when ignoring rep clauses we need to indicate that the
2187 -- entity has an address clause and thus it is legal to declare
2190 if Ignore_Rep_Clauses then
2191 if Ekind_In (U_Ent, E_Variable, E_Constant) then
2192 Record_Rep_Item (U_Ent, N);
2198 if Duplicate_Clause then
2201 -- Case of address clause for subprogram
2203 elsif Is_Subprogram (U_Ent) then
2204 if Has_Homonym (U_Ent) then
2206 ("address clause cannot be given " &
2207 "for overloaded subprogram",
2212 -- For subprograms, all address clauses are permitted, and we
2213 -- mark the subprogram as having a deferred freeze so that Gigi
2214 -- will not elaborate it too soon.
2216 -- Above needs more comments, what is too soon about???
2218 Set_Has_Delayed_Freeze (U_Ent);
2220 -- Case of address clause for entry
2222 elsif Ekind (U_Ent) = E_Entry then
2223 if Nkind (Parent (N)) = N_Task_Body then
2225 ("entry address must be specified in task spec", Nam);
2229 -- For entries, we require a constant address
2231 Check_Constant_Address_Clause (Expr, U_Ent);
2233 -- Special checks for task types
2235 if Is_Task_Type (Scope (U_Ent))
2236 and then Comes_From_Source (Scope (U_Ent))
2239 ("?entry address declared for entry in task type", N);
2241 ("\?only one task can be declared of this type", N);
2244 -- Entry address clauses are obsolescent
2246 Check_Restriction (No_Obsolescent_Features, N);
2248 if Warn_On_Obsolescent_Feature then
2250 ("attaching interrupt to task entry is an " &
2251 "obsolescent feature (RM J.7.1)?", N);
2253 ("\use interrupt procedure instead?", N);
2256 -- Case of an address clause for a controlled object which we
2257 -- consider to be erroneous.
2259 elsif Is_Controlled (Etype (U_Ent))
2260 or else Has_Controlled_Component (Etype (U_Ent))
2263 ("?controlled object& must not be overlaid", Nam, U_Ent);
2265 ("\?Program_Error will be raised at run time", Nam);
2266 Insert_Action (Declaration_Node (U_Ent),
2267 Make_Raise_Program_Error (Loc,
2268 Reason => PE_Overlaid_Controlled_Object));
2271 -- Case of address clause for a (non-controlled) object
2274 Ekind (U_Ent) = E_Variable
2276 Ekind (U_Ent) = E_Constant
2279 Expr : constant Node_Id := Expression (N);
2284 -- Exported variables cannot have an address clause, because
2285 -- this cancels the effect of the pragma Export.
2287 if Is_Exported (U_Ent) then
2289 ("cannot export object with address clause", Nam);
2293 Find_Overlaid_Entity (N, O_Ent, Off);
2295 -- Overlaying controlled objects is erroneous
2298 and then (Has_Controlled_Component (Etype (O_Ent))
2299 or else Is_Controlled (Etype (O_Ent)))
2302 ("?cannot overlay with controlled object", Expr);
2304 ("\?Program_Error will be raised at run time", Expr);
2305 Insert_Action (Declaration_Node (U_Ent),
2306 Make_Raise_Program_Error (Loc,
2307 Reason => PE_Overlaid_Controlled_Object));
2310 elsif Present (O_Ent)
2311 and then Ekind (U_Ent) = E_Constant
2312 and then not Is_Constant_Object (O_Ent)
2314 Error_Msg_N ("constant overlays a variable?", Expr);
2316 elsif Present (Renamed_Object (U_Ent)) then
2318 ("address clause not allowed"
2319 & " for a renaming declaration (RM 13.1(6))", Nam);
2322 -- Imported variables can have an address clause, but then
2323 -- the import is pretty meaningless except to suppress
2324 -- initializations, so we do not need such variables to
2325 -- be statically allocated (and in fact it causes trouble
2326 -- if the address clause is a local value).
2328 elsif Is_Imported (U_Ent) then
2329 Set_Is_Statically_Allocated (U_Ent, False);
2332 -- We mark a possible modification of a variable with an
2333 -- address clause, since it is likely aliasing is occurring.
2335 Note_Possible_Modification (Nam, Sure => False);
2337 -- Here we are checking for explicit overlap of one variable
2338 -- by another, and if we find this then mark the overlapped
2339 -- variable as also being volatile to prevent unwanted
2340 -- optimizations. This is a significant pessimization so
2341 -- avoid it when there is an offset, i.e. when the object
2342 -- is composite; they cannot be optimized easily anyway.
2345 and then Is_Object (O_Ent)
2348 Set_Treat_As_Volatile (O_Ent);
2351 -- Legality checks on the address clause for initialized
2352 -- objects is deferred until the freeze point, because
2353 -- a subsequent pragma might indicate that the object is
2354 -- imported and thus not initialized.
2356 Set_Has_Delayed_Freeze (U_Ent);
2358 -- If an initialization call has been generated for this
2359 -- object, it needs to be deferred to after the freeze node
2360 -- we have just now added, otherwise GIGI will see a
2361 -- reference to the variable (as actual to the IP call)
2362 -- before its definition.
2365 Init_Call : constant Node_Id := Find_Init_Call (U_Ent, N);
2367 if Present (Init_Call) then
2369 Append_Freeze_Action (U_Ent, Init_Call);
2373 if Is_Exported (U_Ent) then
2375 ("& cannot be exported if an address clause is given",
2378 ("\define and export a variable " &
2379 "that holds its address instead",
2383 -- Entity has delayed freeze, so we will generate an
2384 -- alignment check at the freeze point unless suppressed.
2386 if not Range_Checks_Suppressed (U_Ent)
2387 and then not Alignment_Checks_Suppressed (U_Ent)
2389 Set_Check_Address_Alignment (N);
2392 -- Kill the size check code, since we are not allocating
2393 -- the variable, it is somewhere else.
2395 Kill_Size_Check_Code (U_Ent);
2397 -- If the address clause is of the form:
2399 -- for Y'Address use X'Address
2403 -- Const : constant Address := X'Address;
2405 -- for Y'Address use Const;
2407 -- then we make an entry in the table for checking the size
2408 -- and alignment of the overlaying variable. We defer this
2409 -- check till after code generation to take full advantage
2410 -- of the annotation done by the back end. This entry is
2411 -- only made if the address clause comes from source.
2413 -- If the entity has a generic type, the check will be
2414 -- performed in the instance if the actual type justifies
2415 -- it, and we do not insert the clause in the table to
2416 -- prevent spurious warnings.
2418 if Address_Clause_Overlay_Warnings
2419 and then Comes_From_Source (N)
2420 and then Present (O_Ent)
2421 and then Is_Object (O_Ent)
2423 if not Is_Generic_Type (Etype (U_Ent)) then
2424 Address_Clause_Checks.Append ((N, U_Ent, O_Ent, Off));
2427 -- If variable overlays a constant view, and we are
2428 -- warning on overlays, then mark the variable as
2429 -- overlaying a constant (we will give warnings later
2430 -- if this variable is assigned).
2432 if Is_Constant_Object (O_Ent)
2433 and then Ekind (U_Ent) = E_Variable
2435 Set_Overlays_Constant (U_Ent);
2440 -- Not a valid entity for an address clause
2443 Error_Msg_N ("address cannot be given for &", Nam);
2451 -- Alignment attribute definition clause
2453 when Attribute_Alignment => Alignment : declare
2454 Align : constant Uint := Get_Alignment_Value (Expr);
2459 if not Is_Type (U_Ent)
2460 and then Ekind (U_Ent) /= E_Variable
2461 and then Ekind (U_Ent) /= E_Constant
2463 Error_Msg_N ("alignment cannot be given for &", Nam);
2465 elsif Duplicate_Clause then
2468 elsif Align /= No_Uint then
2469 Set_Has_Alignment_Clause (U_Ent);
2470 Set_Alignment (U_Ent, Align);
2472 -- For an array type, U_Ent is the first subtype. In that case,
2473 -- also set the alignment of the anonymous base type so that
2474 -- other subtypes (such as the itypes for aggregates of the
2475 -- type) also receive the expected alignment.
2477 if Is_Array_Type (U_Ent) then
2478 Set_Alignment (Base_Type (U_Ent), Align);
2487 -- Bit_Order attribute definition clause
2489 when Attribute_Bit_Order => Bit_Order : declare
2491 if not Is_Record_Type (U_Ent) then
2493 ("Bit_Order can only be defined for record type", Nam);
2495 elsif Duplicate_Clause then
2499 Analyze_And_Resolve (Expr, RTE (RE_Bit_Order));
2501 if Etype (Expr) = Any_Type then
2504 elsif not Is_Static_Expression (Expr) then
2505 Flag_Non_Static_Expr
2506 ("Bit_Order requires static expression!", Expr);
2509 if (Expr_Value (Expr) = 0) /= Bytes_Big_Endian then
2510 Set_Reverse_Bit_Order (U_Ent, True);
2516 --------------------
2517 -- Component_Size --
2518 --------------------
2520 -- Component_Size attribute definition clause
2522 when Attribute_Component_Size => Component_Size_Case : declare
2523 Csize : constant Uint := Static_Integer (Expr);
2527 New_Ctyp : Entity_Id;
2531 if not Is_Array_Type (U_Ent) then
2532 Error_Msg_N ("component size requires array type", Nam);
2536 Btype := Base_Type (U_Ent);
2537 Ctyp := Component_Type (Btype);
2539 if Duplicate_Clause then
2542 elsif Rep_Item_Too_Early (Btype, N) then
2545 elsif Csize /= No_Uint then
2546 Check_Size (Expr, Ctyp, Csize, Biased);
2548 -- For the biased case, build a declaration for a subtype that
2549 -- will be used to represent the biased subtype that reflects
2550 -- the biased representation of components. We need the subtype
2551 -- to get proper conversions on referencing elements of the
2552 -- array. Note: component size clauses are ignored in VM mode.
2554 if VM_Target = No_VM then
2557 Make_Defining_Identifier (Loc,
2559 New_External_Name (Chars (U_Ent), 'C', 0, 'T'));
2562 Make_Subtype_Declaration (Loc,
2563 Defining_Identifier => New_Ctyp,
2564 Subtype_Indication =>
2565 New_Occurrence_Of (Component_Type (Btype), Loc));
2567 Set_Parent (Decl, N);
2568 Analyze (Decl, Suppress => All_Checks);
2570 Set_Has_Delayed_Freeze (New_Ctyp, False);
2571 Set_Esize (New_Ctyp, Csize);
2572 Set_RM_Size (New_Ctyp, Csize);
2573 Init_Alignment (New_Ctyp);
2574 Set_Is_Itype (New_Ctyp, True);
2575 Set_Associated_Node_For_Itype (New_Ctyp, U_Ent);
2577 Set_Component_Type (Btype, New_Ctyp);
2578 Set_Biased (New_Ctyp, N, "component size clause");
2581 Set_Component_Size (Btype, Csize);
2583 -- For VM case, we ignore component size clauses
2586 -- Give a warning unless we are in GNAT mode, in which case
2587 -- the warning is suppressed since it is not useful.
2589 if not GNAT_Mode then
2591 ("?component size ignored in this configuration", N);
2595 -- Deal with warning on overridden size
2597 if Warn_On_Overridden_Size
2598 and then Has_Size_Clause (Ctyp)
2599 and then RM_Size (Ctyp) /= Csize
2602 ("?component size overrides size clause for&",
2606 Set_Has_Component_Size_Clause (Btype, True);
2607 Set_Has_Non_Standard_Rep (Btype, True);
2609 end Component_Size_Case;
2611 -----------------------
2612 -- Constant_Indexing --
2613 -----------------------
2615 when Attribute_Constant_Indexing =>
2616 Check_Indexing_Functions;
2618 ----------------------
2619 -- Default_Iterator --
2620 ----------------------
2622 when Attribute_Default_Iterator => Default_Iterator : declare
2626 if not Is_Tagged_Type (U_Ent) then
2628 ("aspect Default_Iterator applies to tagged type", Nam);
2631 Check_Iterator_Functions;
2635 if not Is_Entity_Name (Expr)
2636 or else Ekind (Entity (Expr)) /= E_Function
2638 Error_Msg_N ("aspect Iterator must be a function", Expr);
2640 Func := Entity (Expr);
2643 if No (First_Formal (Func))
2644 or else Etype (First_Formal (Func)) /= U_Ent
2647 ("Default Iterator must be a primitive of&", Func, U_Ent);
2649 end Default_Iterator;
2655 when Attribute_External_Tag => External_Tag :
2657 if not Is_Tagged_Type (U_Ent) then
2658 Error_Msg_N ("should be a tagged type", Nam);
2661 if Duplicate_Clause then
2665 Analyze_And_Resolve (Expr, Standard_String);
2667 if not Is_Static_Expression (Expr) then
2668 Flag_Non_Static_Expr
2669 ("static string required for tag name!", Nam);
2672 if VM_Target = No_VM then
2673 Set_Has_External_Tag_Rep_Clause (U_Ent);
2675 Error_Msg_Name_1 := Attr;
2677 ("% attribute unsupported in this configuration", Nam);
2680 if not Is_Library_Level_Entity (U_Ent) then
2682 ("?non-unique external tag supplied for &", N, U_Ent);
2684 ("?\same external tag applies to all subprogram calls", N);
2686 ("?\corresponding internal tag cannot be obtained", N);
2691 --------------------------
2692 -- Implicit_Dereference --
2693 --------------------------
2695 when Attribute_Implicit_Dereference =>
2697 -- Legality checks already performed at the point of
2698 -- the type declaration, aspect is not delayed.
2706 when Attribute_Input =>
2707 Analyze_Stream_TSS_Definition (TSS_Stream_Input);
2708 Set_Has_Specified_Stream_Input (Ent);
2710 ----------------------
2711 -- Iterator_Element --
2712 ----------------------
2714 when Attribute_Iterator_Element =>
2717 if not Is_Entity_Name (Expr)
2718 or else not Is_Type (Entity (Expr))
2720 Error_Msg_N ("aspect Iterator_Element must be a type", Expr);
2727 -- Machine radix attribute definition clause
2729 when Attribute_Machine_Radix => Machine_Radix : declare
2730 Radix : constant Uint := Static_Integer (Expr);
2733 if not Is_Decimal_Fixed_Point_Type (U_Ent) then
2734 Error_Msg_N ("decimal fixed-point type expected for &", Nam);
2736 elsif Duplicate_Clause then
2739 elsif Radix /= No_Uint then
2740 Set_Has_Machine_Radix_Clause (U_Ent);
2741 Set_Has_Non_Standard_Rep (Base_Type (U_Ent));
2745 elsif Radix = 10 then
2746 Set_Machine_Radix_10 (U_Ent);
2748 Error_Msg_N ("machine radix value must be 2 or 10", Expr);
2757 -- Object_Size attribute definition clause
2759 when Attribute_Object_Size => Object_Size : declare
2760 Size : constant Uint := Static_Integer (Expr);
2763 pragma Warnings (Off, Biased);
2766 if not Is_Type (U_Ent) then
2767 Error_Msg_N ("Object_Size cannot be given for &", Nam);
2769 elsif Duplicate_Clause then
2773 Check_Size (Expr, U_Ent, Size, Biased);
2781 UI_Mod (Size, 64) /= 0
2784 ("Object_Size must be 8, 16, 32, or multiple of 64",
2788 Set_Esize (U_Ent, Size);
2789 Set_Has_Object_Size_Clause (U_Ent);
2790 Alignment_Check_For_Size_Change (U_Ent, Size);
2798 when Attribute_Output =>
2799 Analyze_Stream_TSS_Definition (TSS_Stream_Output);
2800 Set_Has_Specified_Stream_Output (Ent);
2806 when Attribute_Read =>
2807 Analyze_Stream_TSS_Definition (TSS_Stream_Read);
2808 Set_Has_Specified_Stream_Read (Ent);
2814 -- Size attribute definition clause
2816 when Attribute_Size => Size : declare
2817 Size : constant Uint := Static_Integer (Expr);
2824 if Duplicate_Clause then
2827 elsif not Is_Type (U_Ent)
2828 and then Ekind (U_Ent) /= E_Variable
2829 and then Ekind (U_Ent) /= E_Constant
2831 Error_Msg_N ("size cannot be given for &", Nam);
2833 elsif Is_Array_Type (U_Ent)
2834 and then not Is_Constrained (U_Ent)
2837 ("size cannot be given for unconstrained array", Nam);
2839 elsif Size /= No_Uint then
2840 if VM_Target /= No_VM and then not GNAT_Mode then
2842 -- Size clause is not handled properly on VM targets.
2843 -- Display a warning unless we are in GNAT mode, in which
2844 -- case this is useless.
2847 ("?size clauses are ignored in this configuration", N);
2850 if Is_Type (U_Ent) then
2853 Etyp := Etype (U_Ent);
2856 -- Check size, note that Gigi is in charge of checking that the
2857 -- size of an array or record type is OK. Also we do not check
2858 -- the size in the ordinary fixed-point case, since it is too
2859 -- early to do so (there may be subsequent small clause that
2860 -- affects the size). We can check the size if a small clause
2861 -- has already been given.
2863 if not Is_Ordinary_Fixed_Point_Type (U_Ent)
2864 or else Has_Small_Clause (U_Ent)
2866 Check_Size (Expr, Etyp, Size, Biased);
2867 Set_Biased (U_Ent, N, "size clause", Biased);
2870 -- For types set RM_Size and Esize if possible
2872 if Is_Type (U_Ent) then
2873 Set_RM_Size (U_Ent, Size);
2875 -- For elementary types, increase Object_Size to power of 2,
2876 -- but not less than a storage unit in any case (normally
2877 -- this means it will be byte addressable).
2879 -- For all other types, nothing else to do, we leave Esize
2880 -- (object size) unset, the back end will set it from the
2881 -- size and alignment in an appropriate manner.
2883 -- In both cases, we check whether the alignment must be
2884 -- reset in the wake of the size change.
2886 if Is_Elementary_Type (U_Ent) then
2887 if Size <= System_Storage_Unit then
2888 Init_Esize (U_Ent, System_Storage_Unit);
2889 elsif Size <= 16 then
2890 Init_Esize (U_Ent, 16);
2891 elsif Size <= 32 then
2892 Init_Esize (U_Ent, 32);
2894 Set_Esize (U_Ent, (Size + 63) / 64 * 64);
2897 Alignment_Check_For_Size_Change (U_Ent, Esize (U_Ent));
2899 Alignment_Check_For_Size_Change (U_Ent, Size);
2902 -- For objects, set Esize only
2905 if Is_Elementary_Type (Etyp) then
2906 if Size /= System_Storage_Unit
2908 Size /= System_Storage_Unit * 2
2910 Size /= System_Storage_Unit * 4
2912 Size /= System_Storage_Unit * 8
2914 Error_Msg_Uint_1 := UI_From_Int (System_Storage_Unit);
2915 Error_Msg_Uint_2 := Error_Msg_Uint_1 * 8;
2917 ("size for primitive object must be a power of 2"
2918 & " in the range ^-^", N);
2922 Set_Esize (U_Ent, Size);
2925 Set_Has_Size_Clause (U_Ent);
2933 -- Small attribute definition clause
2935 when Attribute_Small => Small : declare
2936 Implicit_Base : constant Entity_Id := Base_Type (U_Ent);
2940 Analyze_And_Resolve (Expr, Any_Real);
2942 if Etype (Expr) = Any_Type then
2945 elsif not Is_Static_Expression (Expr) then
2946 Flag_Non_Static_Expr
2947 ("small requires static expression!", Expr);
2951 Small := Expr_Value_R (Expr);
2953 if Small <= Ureal_0 then
2954 Error_Msg_N ("small value must be greater than zero", Expr);
2960 if not Is_Ordinary_Fixed_Point_Type (U_Ent) then
2962 ("small requires an ordinary fixed point type", Nam);
2964 elsif Has_Small_Clause (U_Ent) then
2965 Error_Msg_N ("small already given for &", Nam);
2967 elsif Small > Delta_Value (U_Ent) then
2969 ("small value must not be greater then delta value", Nam);
2972 Set_Small_Value (U_Ent, Small);
2973 Set_Small_Value (Implicit_Base, Small);
2974 Set_Has_Small_Clause (U_Ent);
2975 Set_Has_Small_Clause (Implicit_Base);
2976 Set_Has_Non_Standard_Rep (Implicit_Base);
2984 -- Storage_Pool attribute definition clause
2986 when Attribute_Storage_Pool => Storage_Pool : declare
2991 if Ekind (U_Ent) = E_Access_Subprogram_Type then
2993 ("storage pool cannot be given for access-to-subprogram type",
2998 Ekind_In (U_Ent, E_Access_Type, E_General_Access_Type)
3001 ("storage pool can only be given for access types", Nam);
3004 elsif Is_Derived_Type (U_Ent) then
3006 ("storage pool cannot be given for a derived access type",
3009 elsif Duplicate_Clause then
3012 elsif Present (Associated_Storage_Pool (U_Ent)) then
3013 Error_Msg_N ("storage pool already given for &", Nam);
3018 (Expr, Class_Wide_Type (RTE (RE_Root_Storage_Pool)));
3020 if not Denotes_Variable (Expr) then
3021 Error_Msg_N ("storage pool must be a variable", Expr);
3025 if Nkind (Expr) = N_Type_Conversion then
3026 T := Etype (Expression (Expr));
3031 -- The Stack_Bounded_Pool is used internally for implementing
3032 -- access types with a Storage_Size. Since it only work properly
3033 -- when used on one specific type, we need to check that it is not
3034 -- hijacked improperly:
3036 -- type T is access Integer;
3037 -- for T'Storage_Size use n;
3038 -- type Q is access Float;
3039 -- for Q'Storage_Size use T'Storage_Size; -- incorrect
3041 if RTE_Available (RE_Stack_Bounded_Pool)
3042 and then Base_Type (T) = RTE (RE_Stack_Bounded_Pool)
3044 Error_Msg_N ("non-shareable internal Pool", Expr);
3048 -- If the argument is a name that is not an entity name, then
3049 -- we construct a renaming operation to define an entity of
3050 -- type storage pool.
3052 if not Is_Entity_Name (Expr)
3053 and then Is_Object_Reference (Expr)
3055 Pool := Make_Temporary (Loc, 'P', Expr);
3058 Rnode : constant Node_Id :=
3059 Make_Object_Renaming_Declaration (Loc,
3060 Defining_Identifier => Pool,
3062 New_Occurrence_Of (Etype (Expr), Loc),
3066 Insert_Before (N, Rnode);
3068 Set_Associated_Storage_Pool (U_Ent, Pool);
3071 elsif Is_Entity_Name (Expr) then
3072 Pool := Entity (Expr);
3074 -- If pool is a renamed object, get original one. This can
3075 -- happen with an explicit renaming, and within instances.
3077 while Present (Renamed_Object (Pool))
3078 and then Is_Entity_Name (Renamed_Object (Pool))
3080 Pool := Entity (Renamed_Object (Pool));
3083 if Present (Renamed_Object (Pool))
3084 and then Nkind (Renamed_Object (Pool)) = N_Type_Conversion
3085 and then Is_Entity_Name (Expression (Renamed_Object (Pool)))
3087 Pool := Entity (Expression (Renamed_Object (Pool)));
3090 Set_Associated_Storage_Pool (U_Ent, Pool);
3092 elsif Nkind (Expr) = N_Type_Conversion
3093 and then Is_Entity_Name (Expression (Expr))
3094 and then Nkind (Original_Node (Expr)) = N_Attribute_Reference
3096 Pool := Entity (Expression (Expr));
3097 Set_Associated_Storage_Pool (U_Ent, Pool);
3100 Error_Msg_N ("incorrect reference to a Storage Pool", Expr);
3109 -- Storage_Size attribute definition clause
3111 when Attribute_Storage_Size => Storage_Size : declare
3112 Btype : constant Entity_Id := Base_Type (U_Ent);
3116 if Is_Task_Type (U_Ent) then
3117 Check_Restriction (No_Obsolescent_Features, N);
3119 if Warn_On_Obsolescent_Feature then
3121 ("storage size clause for task is an " &
3122 "obsolescent feature (RM J.9)?", N);
3123 Error_Msg_N ("\use Storage_Size pragma instead?", N);
3129 if not Is_Access_Type (U_Ent)
3130 and then Ekind (U_Ent) /= E_Task_Type
3132 Error_Msg_N ("storage size cannot be given for &", Nam);
3134 elsif Is_Access_Type (U_Ent) and Is_Derived_Type (U_Ent) then
3136 ("storage size cannot be given for a derived access type",
3139 elsif Duplicate_Clause then
3143 Analyze_And_Resolve (Expr, Any_Integer);
3145 if Is_Access_Type (U_Ent) then
3146 if Present (Associated_Storage_Pool (U_Ent)) then
3147 Error_Msg_N ("storage pool already given for &", Nam);
3151 if Is_OK_Static_Expression (Expr)
3152 and then Expr_Value (Expr) = 0
3154 Set_No_Pool_Assigned (Btype);
3157 else -- Is_Task_Type (U_Ent)
3158 Sprag := Get_Rep_Pragma (Btype, Name_Storage_Size);
3160 if Present (Sprag) then
3161 Error_Msg_Sloc := Sloc (Sprag);
3163 ("Storage_Size already specified#", Nam);
3168 Set_Has_Storage_Size_Clause (Btype);
3176 when Attribute_Stream_Size => Stream_Size : declare
3177 Size : constant Uint := Static_Integer (Expr);
3180 if Ada_Version <= Ada_95 then
3181 Check_Restriction (No_Implementation_Attributes, N);
3184 if Duplicate_Clause then
3187 elsif Is_Elementary_Type (U_Ent) then
3188 if Size /= System_Storage_Unit
3190 Size /= System_Storage_Unit * 2
3192 Size /= System_Storage_Unit * 4
3194 Size /= System_Storage_Unit * 8
3196 Error_Msg_Uint_1 := UI_From_Int (System_Storage_Unit);
3198 ("stream size for elementary type must be a"
3199 & " power of 2 and at least ^", N);
3201 elsif RM_Size (U_Ent) > Size then
3202 Error_Msg_Uint_1 := RM_Size (U_Ent);
3204 ("stream size for elementary type must be a"
3205 & " power of 2 and at least ^", N);
3208 Set_Has_Stream_Size_Clause (U_Ent);
3211 Error_Msg_N ("Stream_Size cannot be given for &", Nam);
3219 -- Value_Size attribute definition clause
3221 when Attribute_Value_Size => Value_Size : declare
3222 Size : constant Uint := Static_Integer (Expr);
3226 if not Is_Type (U_Ent) then
3227 Error_Msg_N ("Value_Size cannot be given for &", Nam);
3229 elsif Duplicate_Clause then
3232 elsif Is_Array_Type (U_Ent)
3233 and then not Is_Constrained (U_Ent)
3236 ("Value_Size cannot be given for unconstrained array", Nam);
3239 if Is_Elementary_Type (U_Ent) then
3240 Check_Size (Expr, U_Ent, Size, Biased);
3241 Set_Biased (U_Ent, N, "value size clause", Biased);
3244 Set_RM_Size (U_Ent, Size);
3248 -----------------------
3249 -- Variable_Indexing --
3250 -----------------------
3252 when Attribute_Variable_Indexing =>
3253 Check_Indexing_Functions;
3259 when Attribute_Write =>
3260 Analyze_Stream_TSS_Definition (TSS_Stream_Write);
3261 Set_Has_Specified_Stream_Write (Ent);
3263 -- All other attributes cannot be set
3267 ("attribute& cannot be set with definition clause", N);
3270 -- The test for the type being frozen must be performed after any
3271 -- expression the clause has been analyzed since the expression itself
3272 -- might cause freezing that makes the clause illegal.
3274 if Rep_Item_Too_Late (U_Ent, N, FOnly) then
3277 end Analyze_Attribute_Definition_Clause;
3279 ----------------------------
3280 -- Analyze_Code_Statement --
3281 ----------------------------
3283 procedure Analyze_Code_Statement (N : Node_Id) is
3284 HSS : constant Node_Id := Parent (N);
3285 SBody : constant Node_Id := Parent (HSS);
3286 Subp : constant Entity_Id := Current_Scope;
3293 -- Analyze and check we get right type, note that this implements the
3294 -- requirement (RM 13.8(1)) that Machine_Code be with'ed, since that
3295 -- is the only way that Asm_Insn could possibly be visible.
3297 Analyze_And_Resolve (Expression (N));
3299 if Etype (Expression (N)) = Any_Type then
3301 elsif Etype (Expression (N)) /= RTE (RE_Asm_Insn) then
3302 Error_Msg_N ("incorrect type for code statement", N);
3306 Check_Code_Statement (N);
3308 -- Make sure we appear in the handled statement sequence of a
3309 -- subprogram (RM 13.8(3)).
3311 if Nkind (HSS) /= N_Handled_Sequence_Of_Statements
3312 or else Nkind (SBody) /= N_Subprogram_Body
3315 ("code statement can only appear in body of subprogram", N);
3319 -- Do remaining checks (RM 13.8(3)) if not already done
3321 if not Is_Machine_Code_Subprogram (Subp) then
3322 Set_Is_Machine_Code_Subprogram (Subp);
3324 -- No exception handlers allowed
3326 if Present (Exception_Handlers (HSS)) then
3328 ("exception handlers not permitted in machine code subprogram",
3329 First (Exception_Handlers (HSS)));
3332 -- No declarations other than use clauses and pragmas (we allow
3333 -- certain internally generated declarations as well).
3335 Decl := First (Declarations (SBody));
3336 while Present (Decl) loop
3337 DeclO := Original_Node (Decl);
3338 if Comes_From_Source (DeclO)
3339 and not Nkind_In (DeclO, N_Pragma,
3340 N_Use_Package_Clause,
3342 N_Implicit_Label_Declaration)
3345 ("this declaration not allowed in machine code subprogram",
3352 -- No statements other than code statements, pragmas, and labels.
3353 -- Again we allow certain internally generated statements.
3355 Stmt := First (Statements (HSS));
3356 while Present (Stmt) loop
3357 StmtO := Original_Node (Stmt);
3358 if Comes_From_Source (StmtO)
3359 and then not Nkind_In (StmtO, N_Pragma,
3364 ("this statement is not allowed in machine code subprogram",
3371 end Analyze_Code_Statement;
3373 -----------------------------------------------
3374 -- Analyze_Enumeration_Representation_Clause --
3375 -----------------------------------------------
3377 procedure Analyze_Enumeration_Representation_Clause (N : Node_Id) is
3378 Ident : constant Node_Id := Identifier (N);
3379 Aggr : constant Node_Id := Array_Aggregate (N);
3380 Enumtype : Entity_Id;
3387 Err : Boolean := False;
3388 -- Set True to avoid cascade errors and crashes on incorrect source code
3390 Lo : constant Uint := Expr_Value (Type_Low_Bound (Universal_Integer));
3391 Hi : constant Uint := Expr_Value (Type_High_Bound (Universal_Integer));
3392 -- Allowed range of universal integer (= allowed range of enum lit vals)
3396 -- Minimum and maximum values of entries
3399 -- Pointer to node for literal providing max value
3402 if Ignore_Rep_Clauses then
3406 -- First some basic error checks
3409 Enumtype := Entity (Ident);
3411 if Enumtype = Any_Type
3412 or else Rep_Item_Too_Early (Enumtype, N)
3416 Enumtype := Underlying_Type (Enumtype);
3419 if not Is_Enumeration_Type (Enumtype) then
3421 ("enumeration type required, found}",
3422 Ident, First_Subtype (Enumtype));
3426 -- Ignore rep clause on generic actual type. This will already have
3427 -- been flagged on the template as an error, and this is the safest
3428 -- way to ensure we don't get a junk cascaded message in the instance.
3430 if Is_Generic_Actual_Type (Enumtype) then
3433 -- Type must be in current scope
3435 elsif Scope (Enumtype) /= Current_Scope then
3436 Error_Msg_N ("type must be declared in this scope", Ident);
3439 -- Type must be a first subtype
3441 elsif not Is_First_Subtype (Enumtype) then
3442 Error_Msg_N ("cannot give enumeration rep clause for subtype", N);
3445 -- Ignore duplicate rep clause
3447 elsif Has_Enumeration_Rep_Clause (Enumtype) then
3448 Error_Msg_N ("duplicate enumeration rep clause ignored", N);
3451 -- Don't allow rep clause for standard [wide_[wide_]]character
3453 elsif Is_Standard_Character_Type (Enumtype) then
3454 Error_Msg_N ("enumeration rep clause not allowed for this type", N);
3457 -- Check that the expression is a proper aggregate (no parentheses)
3459 elsif Paren_Count (Aggr) /= 0 then
3461 ("extra parentheses surrounding aggregate not allowed",
3465 -- All tests passed, so set rep clause in place
3468 Set_Has_Enumeration_Rep_Clause (Enumtype);
3469 Set_Has_Enumeration_Rep_Clause (Base_Type (Enumtype));
3472 -- Now we process the aggregate. Note that we don't use the normal
3473 -- aggregate code for this purpose, because we don't want any of the
3474 -- normal expansion activities, and a number of special semantic
3475 -- rules apply (including the component type being any integer type)
3477 Elit := First_Literal (Enumtype);
3479 -- First the positional entries if any
3481 if Present (Expressions (Aggr)) then
3482 Expr := First (Expressions (Aggr));
3483 while Present (Expr) loop
3485 Error_Msg_N ("too many entries in aggregate", Expr);
3489 Val := Static_Integer (Expr);
3491 -- Err signals that we found some incorrect entries processing
3492 -- the list. The final checks for completeness and ordering are
3493 -- skipped in this case.
3495 if Val = No_Uint then
3497 elsif Val < Lo or else Hi < Val then
3498 Error_Msg_N ("value outside permitted range", Expr);
3502 Set_Enumeration_Rep (Elit, Val);
3503 Set_Enumeration_Rep_Expr (Elit, Expr);
3509 -- Now process the named entries if present
3511 if Present (Component_Associations (Aggr)) then
3512 Assoc := First (Component_Associations (Aggr));
3513 while Present (Assoc) loop
3514 Choice := First (Choices (Assoc));
3516 if Present (Next (Choice)) then
3518 ("multiple choice not allowed here", Next (Choice));
3522 if Nkind (Choice) = N_Others_Choice then
3523 Error_Msg_N ("others choice not allowed here", Choice);
3526 elsif Nkind (Choice) = N_Range then
3528 -- ??? should allow zero/one element range here
3530 Error_Msg_N ("range not allowed here", Choice);
3534 Analyze_And_Resolve (Choice, Enumtype);
3536 if Error_Posted (Choice) then
3541 if Is_Entity_Name (Choice)
3542 and then Is_Type (Entity (Choice))
3544 Error_Msg_N ("subtype name not allowed here", Choice);
3547 -- ??? should allow static subtype with zero/one entry
3549 elsif Etype (Choice) = Base_Type (Enumtype) then
3550 if not Is_Static_Expression (Choice) then
3551 Flag_Non_Static_Expr
3552 ("non-static expression used for choice!", Choice);
3556 Elit := Expr_Value_E (Choice);
3558 if Present (Enumeration_Rep_Expr (Elit)) then
3560 Sloc (Enumeration_Rep_Expr (Elit));
3562 ("representation for& previously given#",
3567 Set_Enumeration_Rep_Expr (Elit, Expression (Assoc));
3569 Expr := Expression (Assoc);
3570 Val := Static_Integer (Expr);
3572 if Val = No_Uint then
3575 elsif Val < Lo or else Hi < Val then
3576 Error_Msg_N ("value outside permitted range", Expr);
3580 Set_Enumeration_Rep (Elit, Val);
3590 -- Aggregate is fully processed. Now we check that a full set of
3591 -- representations was given, and that they are in range and in order.
3592 -- These checks are only done if no other errors occurred.
3598 Elit := First_Literal (Enumtype);
3599 while Present (Elit) loop
3600 if No (Enumeration_Rep_Expr (Elit)) then
3601 Error_Msg_NE ("missing representation for&!", N, Elit);
3604 Val := Enumeration_Rep (Elit);
3606 if Min = No_Uint then
3610 if Val /= No_Uint then
3611 if Max /= No_Uint and then Val <= Max then
3613 ("enumeration value for& not ordered!",
3614 Enumeration_Rep_Expr (Elit), Elit);
3617 Max_Node := Enumeration_Rep_Expr (Elit);
3621 -- If there is at least one literal whose representation is not
3622 -- equal to the Pos value, then note that this enumeration type
3623 -- has a non-standard representation.
3625 if Val /= Enumeration_Pos (Elit) then
3626 Set_Has_Non_Standard_Rep (Base_Type (Enumtype));
3633 -- Now set proper size information
3636 Minsize : Uint := UI_From_Int (Minimum_Size (Enumtype));
3639 if Has_Size_Clause (Enumtype) then
3641 -- All OK, if size is OK now
3643 if RM_Size (Enumtype) >= Minsize then
3647 -- Try if we can get by with biasing
3650 UI_From_Int (Minimum_Size (Enumtype, Biased => True));
3652 -- Error message if even biasing does not work
3654 if RM_Size (Enumtype) < Minsize then
3655 Error_Msg_Uint_1 := RM_Size (Enumtype);
3656 Error_Msg_Uint_2 := Max;
3658 ("previously given size (^) is too small "
3659 & "for this value (^)", Max_Node);
3661 -- If biasing worked, indicate that we now have biased rep
3665 (Enumtype, Size_Clause (Enumtype), "size clause");
3670 Set_RM_Size (Enumtype, Minsize);
3671 Set_Enum_Esize (Enumtype);
3674 Set_RM_Size (Base_Type (Enumtype), RM_Size (Enumtype));
3675 Set_Esize (Base_Type (Enumtype), Esize (Enumtype));
3676 Set_Alignment (Base_Type (Enumtype), Alignment (Enumtype));
3680 -- We repeat the too late test in case it froze itself!
3682 if Rep_Item_Too_Late (Enumtype, N) then
3685 end Analyze_Enumeration_Representation_Clause;
3687 ----------------------------
3688 -- Analyze_Free_Statement --
3689 ----------------------------
3691 procedure Analyze_Free_Statement (N : Node_Id) is
3693 Analyze (Expression (N));
3694 end Analyze_Free_Statement;
3696 ---------------------------
3697 -- Analyze_Freeze_Entity --
3698 ---------------------------
3700 procedure Analyze_Freeze_Entity (N : Node_Id) is
3701 E : constant Entity_Id := Entity (N);
3704 -- Remember that we are processing a freezing entity. Required to
3705 -- ensure correct decoration of internal entities associated with
3706 -- interfaces (see New_Overloaded_Entity).
3708 Inside_Freezing_Actions := Inside_Freezing_Actions + 1;
3710 -- For tagged types covering interfaces add internal entities that link
3711 -- the primitives of the interfaces with the primitives that cover them.
3712 -- Note: These entities were originally generated only when generating
3713 -- code because their main purpose was to provide support to initialize
3714 -- the secondary dispatch tables. They are now generated also when
3715 -- compiling with no code generation to provide ASIS the relationship
3716 -- between interface primitives and tagged type primitives. They are
3717 -- also used to locate primitives covering interfaces when processing
3718 -- generics (see Derive_Subprograms).
3720 if Ada_Version >= Ada_2005
3721 and then Ekind (E) = E_Record_Type
3722 and then Is_Tagged_Type (E)
3723 and then not Is_Interface (E)
3724 and then Has_Interfaces (E)
3726 -- This would be a good common place to call the routine that checks
3727 -- overriding of interface primitives (and thus factorize calls to
3728 -- Check_Abstract_Overriding located at different contexts in the
3729 -- compiler). However, this is not possible because it causes
3730 -- spurious errors in case of late overriding.
3732 Add_Internal_Interface_Entities (E);
3737 if Ekind (E) = E_Record_Type
3738 and then Is_CPP_Class (E)
3739 and then Is_Tagged_Type (E)
3740 and then Tagged_Type_Expansion
3741 and then Expander_Active
3743 if CPP_Num_Prims (E) = 0 then
3745 -- If the CPP type has user defined components then it must import
3746 -- primitives from C++. This is required because if the C++ class
3747 -- has no primitives then the C++ compiler does not added the _tag
3748 -- component to the type.
3750 pragma Assert (Chars (First_Entity (E)) = Name_uTag);
3752 if First_Entity (E) /= Last_Entity (E) then
3754 ("?'C'P'P type must import at least one primitive from C++",
3759 -- Check that all its primitives are abstract or imported from C++.
3760 -- Check also availability of the C++ constructor.
3763 Has_Constructors : constant Boolean := Has_CPP_Constructors (E);
3765 Error_Reported : Boolean := False;
3769 Elmt := First_Elmt (Primitive_Operations (E));
3770 while Present (Elmt) loop
3771 Prim := Node (Elmt);
3773 if Comes_From_Source (Prim) then
3774 if Is_Abstract_Subprogram (Prim) then
3777 elsif not Is_Imported (Prim)
3778 or else Convention (Prim) /= Convention_CPP
3781 ("?primitives of 'C'P'P types must be imported from C++"
3782 & " or abstract", Prim);
3784 elsif not Has_Constructors
3785 and then not Error_Reported
3787 Error_Msg_Name_1 := Chars (E);
3789 ("?'C'P'P constructor required for type %", Prim);
3790 Error_Reported := True;
3799 Inside_Freezing_Actions := Inside_Freezing_Actions - 1;
3801 -- If we have a type with predicates, build predicate function
3803 if Is_Type (E) and then Has_Predicates (E) then
3804 Build_Predicate_Function (E, N);
3807 -- If type has delayed aspects, this is where we do the preanalysis at
3808 -- the freeze point, as part of the consistent visibility check. Note
3809 -- that this must be done after calling Build_Predicate_Function or
3810 -- Build_Invariant_Procedure since these subprograms fix occurrences of
3811 -- the subtype name in the saved expression so that they will not cause
3812 -- trouble in the preanalysis.
3814 if Has_Delayed_Aspects (E) then
3819 -- Look for aspect specification entries for this entity
3821 Ritem := First_Rep_Item (E);
3822 while Present (Ritem) loop
3823 if Nkind (Ritem) = N_Aspect_Specification
3824 and then Entity (Ritem) = E
3825 and then Is_Delayed_Aspect (Ritem)
3826 and then Scope (E) = Current_Scope
3828 Check_Aspect_At_Freeze_Point (Ritem);
3831 Next_Rep_Item (Ritem);
3835 end Analyze_Freeze_Entity;
3837 ------------------------------------------
3838 -- Analyze_Record_Representation_Clause --
3839 ------------------------------------------
3841 -- Note: we check as much as we can here, but we can't do any checks
3842 -- based on the position values (e.g. overlap checks) until freeze time
3843 -- because especially in Ada 2005 (machine scalar mode), the processing
3844 -- for non-standard bit order can substantially change the positions.
3845 -- See procedure Check_Record_Representation_Clause (called from Freeze)
3846 -- for the remainder of this processing.
3848 procedure Analyze_Record_Representation_Clause (N : Node_Id) is
3849 Ident : constant Node_Id := Identifier (N);
3854 Hbit : Uint := Uint_0;
3858 Rectype : Entity_Id;
3860 CR_Pragma : Node_Id := Empty;
3861 -- Points to N_Pragma node if Complete_Representation pragma present
3864 if Ignore_Rep_Clauses then
3869 Rectype := Entity (Ident);
3871 if Rectype = Any_Type
3872 or else Rep_Item_Too_Early (Rectype, N)
3876 Rectype := Underlying_Type (Rectype);
3879 -- First some basic error checks
3881 if not Is_Record_Type (Rectype) then
3883 ("record type required, found}", Ident, First_Subtype (Rectype));
3886 elsif Scope (Rectype) /= Current_Scope then
3887 Error_Msg_N ("type must be declared in this scope", N);
3890 elsif not Is_First_Subtype (Rectype) then
3891 Error_Msg_N ("cannot give record rep clause for subtype", N);
3894 elsif Has_Record_Rep_Clause (Rectype) then
3895 Error_Msg_N ("duplicate record rep clause ignored", N);
3898 elsif Rep_Item_Too_Late (Rectype, N) then
3902 if Present (Mod_Clause (N)) then
3904 Loc : constant Source_Ptr := Sloc (N);
3905 M : constant Node_Id := Mod_Clause (N);
3906 P : constant List_Id := Pragmas_Before (M);
3910 pragma Warnings (Off, Mod_Val);
3913 Check_Restriction (No_Obsolescent_Features, Mod_Clause (N));
3915 if Warn_On_Obsolescent_Feature then
3917 ("mod clause is an obsolescent feature (RM J.8)?", N);
3919 ("\use alignment attribute definition clause instead?", N);
3926 -- In ASIS_Mode mode, expansion is disabled, but we must convert
3927 -- the Mod clause into an alignment clause anyway, so that the
3928 -- back-end can compute and back-annotate properly the size and
3929 -- alignment of types that may include this record.
3931 -- This seems dubious, this destroys the source tree in a manner
3932 -- not detectable by ASIS ???
3934 if Operating_Mode = Check_Semantics and then ASIS_Mode then
3936 Make_Attribute_Definition_Clause (Loc,
3937 Name => New_Reference_To (Base_Type (Rectype), Loc),
3938 Chars => Name_Alignment,
3939 Expression => Relocate_Node (Expression (M)));
3941 Set_From_At_Mod (AtM_Nod);
3942 Insert_After (N, AtM_Nod);
3943 Mod_Val := Get_Alignment_Value (Expression (AtM_Nod));
3944 Set_Mod_Clause (N, Empty);
3947 -- Get the alignment value to perform error checking
3949 Mod_Val := Get_Alignment_Value (Expression (M));
3954 -- For untagged types, clear any existing component clauses for the
3955 -- type. If the type is derived, this is what allows us to override
3956 -- a rep clause for the parent. For type extensions, the representation
3957 -- of the inherited components is inherited, so we want to keep previous
3958 -- component clauses for completeness.
3960 if not Is_Tagged_Type (Rectype) then
3961 Comp := First_Component_Or_Discriminant (Rectype);
3962 while Present (Comp) loop
3963 Set_Component_Clause (Comp, Empty);
3964 Next_Component_Or_Discriminant (Comp);
3968 -- All done if no component clauses
3970 CC := First (Component_Clauses (N));
3976 -- A representation like this applies to the base type
3978 Set_Has_Record_Rep_Clause (Base_Type (Rectype));
3979 Set_Has_Non_Standard_Rep (Base_Type (Rectype));
3980 Set_Has_Specified_Layout (Base_Type (Rectype));
3982 -- Process the component clauses
3984 while Present (CC) loop
3988 if Nkind (CC) = N_Pragma then
3991 -- The only pragma of interest is Complete_Representation
3993 if Pragma_Name (CC) = Name_Complete_Representation then
3997 -- Processing for real component clause
4000 Posit := Static_Integer (Position (CC));
4001 Fbit := Static_Integer (First_Bit (CC));
4002 Lbit := Static_Integer (Last_Bit (CC));
4005 and then Fbit /= No_Uint
4006 and then Lbit /= No_Uint
4010 ("position cannot be negative", Position (CC));
4014 ("first bit cannot be negative", First_Bit (CC));
4016 -- The Last_Bit specified in a component clause must not be
4017 -- less than the First_Bit minus one (RM-13.5.1(10)).
4019 elsif Lbit < Fbit - 1 then
4021 ("last bit cannot be less than first bit minus one",
4024 -- Values look OK, so find the corresponding record component
4025 -- Even though the syntax allows an attribute reference for
4026 -- implementation-defined components, GNAT does not allow the
4027 -- tag to get an explicit position.
4029 elsif Nkind (Component_Name (CC)) = N_Attribute_Reference then
4030 if Attribute_Name (Component_Name (CC)) = Name_Tag then
4031 Error_Msg_N ("position of tag cannot be specified", CC);
4033 Error_Msg_N ("illegal component name", CC);
4037 Comp := First_Entity (Rectype);
4038 while Present (Comp) loop
4039 exit when Chars (Comp) = Chars (Component_Name (CC));
4045 -- Maybe component of base type that is absent from
4046 -- statically constrained first subtype.
4048 Comp := First_Entity (Base_Type (Rectype));
4049 while Present (Comp) loop
4050 exit when Chars (Comp) = Chars (Component_Name (CC));
4057 ("component clause is for non-existent field", CC);
4059 -- Ada 2012 (AI05-0026): Any name that denotes a
4060 -- discriminant of an object of an unchecked union type
4061 -- shall not occur within a record_representation_clause.
4063 -- The general restriction of using record rep clauses on
4064 -- Unchecked_Union types has now been lifted. Since it is
4065 -- possible to introduce a record rep clause which mentions
4066 -- the discriminant of an Unchecked_Union in non-Ada 2012
4067 -- code, this check is applied to all versions of the
4070 elsif Ekind (Comp) = E_Discriminant
4071 and then Is_Unchecked_Union (Rectype)
4074 ("cannot reference discriminant of Unchecked_Union",
4075 Component_Name (CC));
4077 elsif Present (Component_Clause (Comp)) then
4079 -- Diagnose duplicate rep clause, or check consistency
4080 -- if this is an inherited component. In a double fault,
4081 -- there may be a duplicate inconsistent clause for an
4082 -- inherited component.
4084 if Scope (Original_Record_Component (Comp)) = Rectype
4085 or else Parent (Component_Clause (Comp)) = N
4087 Error_Msg_Sloc := Sloc (Component_Clause (Comp));
4088 Error_Msg_N ("component clause previously given#", CC);
4092 Rep1 : constant Node_Id := Component_Clause (Comp);
4094 if Intval (Position (Rep1)) /=
4095 Intval (Position (CC))
4096 or else Intval (First_Bit (Rep1)) /=
4097 Intval (First_Bit (CC))
4098 or else Intval (Last_Bit (Rep1)) /=
4099 Intval (Last_Bit (CC))
4101 Error_Msg_N ("component clause inconsistent "
4102 & "with representation of ancestor", CC);
4103 elsif Warn_On_Redundant_Constructs then
4104 Error_Msg_N ("?redundant component clause "
4105 & "for inherited component!", CC);
4110 -- Normal case where this is the first component clause we
4111 -- have seen for this entity, so set it up properly.
4114 -- Make reference for field in record rep clause and set
4115 -- appropriate entity field in the field identifier.
4118 (Comp, Component_Name (CC), Set_Ref => False);
4119 Set_Entity (Component_Name (CC), Comp);
4121 -- Update Fbit and Lbit to the actual bit number
4123 Fbit := Fbit + UI_From_Int (SSU) * Posit;
4124 Lbit := Lbit + UI_From_Int (SSU) * Posit;
4126 if Has_Size_Clause (Rectype)
4127 and then RM_Size (Rectype) <= Lbit
4130 ("bit number out of range of specified size",
4133 Set_Component_Clause (Comp, CC);
4134 Set_Component_Bit_Offset (Comp, Fbit);
4135 Set_Esize (Comp, 1 + (Lbit - Fbit));
4136 Set_Normalized_First_Bit (Comp, Fbit mod SSU);
4137 Set_Normalized_Position (Comp, Fbit / SSU);
4139 if Warn_On_Overridden_Size
4140 and then Has_Size_Clause (Etype (Comp))
4141 and then RM_Size (Etype (Comp)) /= Esize (Comp)
4144 ("?component size overrides size clause for&",
4145 Component_Name (CC), Etype (Comp));
4148 -- This information is also set in the corresponding
4149 -- component of the base type, found by accessing the
4150 -- Original_Record_Component link if it is present.
4152 Ocomp := Original_Record_Component (Comp);
4159 (Component_Name (CC),
4165 (Comp, First_Node (CC), "component clause", Biased);
4167 if Present (Ocomp) then
4168 Set_Component_Clause (Ocomp, CC);
4169 Set_Component_Bit_Offset (Ocomp, Fbit);
4170 Set_Normalized_First_Bit (Ocomp, Fbit mod SSU);
4171 Set_Normalized_Position (Ocomp, Fbit / SSU);
4172 Set_Esize (Ocomp, 1 + (Lbit - Fbit));
4174 Set_Normalized_Position_Max
4175 (Ocomp, Normalized_Position (Ocomp));
4177 -- Note: we don't use Set_Biased here, because we
4178 -- already gave a warning above if needed, and we
4179 -- would get a duplicate for the same name here.
4181 Set_Has_Biased_Representation
4182 (Ocomp, Has_Biased_Representation (Comp));
4185 if Esize (Comp) < 0 then
4186 Error_Msg_N ("component size is negative", CC);
4197 -- Check missing components if Complete_Representation pragma appeared
4199 if Present (CR_Pragma) then
4200 Comp := First_Component_Or_Discriminant (Rectype);
4201 while Present (Comp) loop
4202 if No (Component_Clause (Comp)) then
4204 ("missing component clause for &", CR_Pragma, Comp);
4207 Next_Component_Or_Discriminant (Comp);
4210 -- If no Complete_Representation pragma, warn if missing components
4212 elsif Warn_On_Unrepped_Components then
4214 Num_Repped_Components : Nat := 0;
4215 Num_Unrepped_Components : Nat := 0;
4218 -- First count number of repped and unrepped components
4220 Comp := First_Component_Or_Discriminant (Rectype);
4221 while Present (Comp) loop
4222 if Present (Component_Clause (Comp)) then
4223 Num_Repped_Components := Num_Repped_Components + 1;
4225 Num_Unrepped_Components := Num_Unrepped_Components + 1;
4228 Next_Component_Or_Discriminant (Comp);
4231 -- We are only interested in the case where there is at least one
4232 -- unrepped component, and at least half the components have rep
4233 -- clauses. We figure that if less than half have them, then the
4234 -- partial rep clause is really intentional. If the component
4235 -- type has no underlying type set at this point (as for a generic
4236 -- formal type), we don't know enough to give a warning on the
4239 if Num_Unrepped_Components > 0
4240 and then Num_Unrepped_Components < Num_Repped_Components
4242 Comp := First_Component_Or_Discriminant (Rectype);
4243 while Present (Comp) loop
4244 if No (Component_Clause (Comp))
4245 and then Comes_From_Source (Comp)
4246 and then Present (Underlying_Type (Etype (Comp)))
4247 and then (Is_Scalar_Type (Underlying_Type (Etype (Comp)))
4248 or else Size_Known_At_Compile_Time
4249 (Underlying_Type (Etype (Comp))))
4250 and then not Has_Warnings_Off (Rectype)
4252 Error_Msg_Sloc := Sloc (Comp);
4254 ("?no component clause given for & declared #",
4258 Next_Component_Or_Discriminant (Comp);
4263 end Analyze_Record_Representation_Clause;
4265 -------------------------------
4266 -- Build_Invariant_Procedure --
4267 -------------------------------
4269 -- The procedure that is constructed here has the form
4271 -- procedure typInvariant (Ixxx : typ) is
4273 -- pragma Check (Invariant, exp, "failed invariant from xxx");
4274 -- pragma Check (Invariant, exp, "failed invariant from xxx");
4276 -- pragma Check (Invariant, exp, "failed inherited invariant from xxx");
4278 -- end typInvariant;
4280 procedure Build_Invariant_Procedure (Typ : Entity_Id; N : Node_Id) is
4281 Loc : constant Source_Ptr := Sloc (Typ);
4288 Visible_Decls : constant List_Id := Visible_Declarations (N);
4289 Private_Decls : constant List_Id := Private_Declarations (N);
4291 procedure Add_Invariants (T : Entity_Id; Inherit : Boolean);
4292 -- Appends statements to Stmts for any invariants in the rep item chain
4293 -- of the given type. If Inherit is False, then we only process entries
4294 -- on the chain for the type Typ. If Inherit is True, then we ignore any
4295 -- Invariant aspects, but we process all Invariant'Class aspects, adding
4296 -- "inherited" to the exception message and generating an informational
4297 -- message about the inheritance of an invariant.
4299 Object_Name : constant Name_Id := New_Internal_Name ('I');
4300 -- Name for argument of invariant procedure
4302 Object_Entity : constant Node_Id :=
4303 Make_Defining_Identifier (Loc, Object_Name);
4304 -- The procedure declaration entity for the argument
4306 --------------------
4307 -- Add_Invariants --
4308 --------------------
4310 procedure Add_Invariants (T : Entity_Id; Inherit : Boolean) is
4320 procedure Replace_Type_Reference (N : Node_Id);
4321 -- Replace a single occurrence N of the subtype name with a reference
4322 -- to the formal of the predicate function. N can be an identifier
4323 -- referencing the subtype, or a selected component, representing an
4324 -- appropriately qualified occurrence of the subtype name.
4326 procedure Replace_Type_References is
4327 new Replace_Type_References_Generic (Replace_Type_Reference);
4328 -- Traverse an expression replacing all occurrences of the subtype
4329 -- name with appropriate references to the object that is the formal
4330 -- parameter of the predicate function. Note that we must ensure
4331 -- that the type and entity information is properly set in the
4332 -- replacement node, since we will do a Preanalyze call of this
4333 -- expression without proper visibility of the procedure argument.
4335 ----------------------------
4336 -- Replace_Type_Reference --
4337 ----------------------------
4339 procedure Replace_Type_Reference (N : Node_Id) is
4341 -- Invariant'Class, replace with T'Class (obj)
4343 if Class_Present (Ritem) then
4345 Make_Type_Conversion (Loc,
4347 Make_Attribute_Reference (Loc,
4348 Prefix => New_Occurrence_Of (T, Loc),
4349 Attribute_Name => Name_Class),
4350 Expression => Make_Identifier (Loc, Object_Name)));
4352 Set_Entity (Expression (N), Object_Entity);
4353 Set_Etype (Expression (N), Typ);
4355 -- Invariant, replace with obj
4358 Rewrite (N, Make_Identifier (Loc, Object_Name));
4359 Set_Entity (N, Object_Entity);
4362 end Replace_Type_Reference;
4364 -- Start of processing for Add_Invariants
4367 Ritem := First_Rep_Item (T);
4368 while Present (Ritem) loop
4369 if Nkind (Ritem) = N_Pragma
4370 and then Pragma_Name (Ritem) = Name_Invariant
4372 Arg1 := First (Pragma_Argument_Associations (Ritem));
4373 Arg2 := Next (Arg1);
4374 Arg3 := Next (Arg2);
4376 Arg1 := Get_Pragma_Arg (Arg1);
4377 Arg2 := Get_Pragma_Arg (Arg2);
4379 -- For Inherit case, ignore Invariant, process only Class case
4382 if not Class_Present (Ritem) then
4386 -- For Inherit false, process only item for right type
4389 if Entity (Arg1) /= Typ then
4395 Stmts := Empty_List;
4398 Exp := New_Copy_Tree (Arg2);
4401 -- We need to replace any occurrences of the name of the type
4402 -- with references to the object, converted to type'Class in
4403 -- the case of Invariant'Class aspects.
4405 Replace_Type_References (Exp, Chars (T));
4407 -- If this invariant comes from an aspect, find the aspect
4408 -- specification, and replace the saved expression because
4409 -- we need the subtype references replaced for the calls to
4410 -- Preanalyze_Spec_Expressin in Check_Aspect_At_Freeze_Point
4411 -- and Check_Aspect_At_End_Of_Declarations.
4413 if From_Aspect_Specification (Ritem) then
4418 -- Loop to find corresponding aspect, note that this
4419 -- must be present given the pragma is marked delayed.
4421 Aitem := Next_Rep_Item (Ritem);
4422 while Present (Aitem) loop
4423 if Nkind (Aitem) = N_Aspect_Specification
4424 and then Aspect_Rep_Item (Aitem) = Ritem
4427 (Identifier (Aitem), New_Copy_Tree (Exp));
4431 Aitem := Next_Rep_Item (Aitem);
4436 -- Now we need to preanalyze the expression to properly capture
4437 -- the visibility in the visible part. The expression will not
4438 -- be analyzed for real until the body is analyzed, but that is
4439 -- at the end of the private part and has the wrong visibility.
4441 Set_Parent (Exp, N);
4442 Preanalyze_Spec_Expression (Exp, Standard_Boolean);
4444 -- Build first two arguments for Check pragma
4447 Make_Pragma_Argument_Association (Loc,
4448 Expression => Make_Identifier (Loc, Name_Invariant)),
4449 Make_Pragma_Argument_Association (Loc, Expression => Exp));
4451 -- Add message if present in Invariant pragma
4453 if Present (Arg3) then
4454 Str := Strval (Get_Pragma_Arg (Arg3));
4456 -- If inherited case, and message starts "failed invariant",
4457 -- change it to be "failed inherited invariant".
4460 String_To_Name_Buffer (Str);
4462 if Name_Buffer (1 .. 16) = "failed invariant" then
4463 Insert_Str_In_Name_Buffer ("inherited ", 8);
4464 Str := String_From_Name_Buffer;
4469 Make_Pragma_Argument_Association (Loc,
4470 Expression => Make_String_Literal (Loc, Str)));
4473 -- Add Check pragma to list of statements
4477 Pragma_Identifier =>
4478 Make_Identifier (Loc, Name_Check),
4479 Pragma_Argument_Associations => Assoc));
4481 -- If Inherited case and option enabled, output info msg. Note
4482 -- that we know this is a case of Invariant'Class.
4484 if Inherit and Opt.List_Inherited_Aspects then
4485 Error_Msg_Sloc := Sloc (Ritem);
4487 ("?info: & inherits `Invariant''Class` aspect from #",
4493 Next_Rep_Item (Ritem);
4497 -- Start of processing for Build_Invariant_Procedure
4503 Set_Etype (Object_Entity, Typ);
4505 -- Add invariants for the current type
4507 Add_Invariants (Typ, Inherit => False);
4509 -- Add invariants for parent types
4512 Current_Typ : Entity_Id;
4513 Parent_Typ : Entity_Id;
4518 Parent_Typ := Etype (Current_Typ);
4520 if Is_Private_Type (Parent_Typ)
4521 and then Present (Full_View (Base_Type (Parent_Typ)))
4523 Parent_Typ := Full_View (Base_Type (Parent_Typ));
4526 exit when Parent_Typ = Current_Typ;
4528 Current_Typ := Parent_Typ;
4529 Add_Invariants (Current_Typ, Inherit => True);
4533 -- Build the procedure if we generated at least one Check pragma
4535 if Stmts /= No_List then
4537 -- Build procedure declaration
4540 Make_Defining_Identifier (Loc,
4541 Chars => New_External_Name (Chars (Typ), "Invariant"));
4542 Set_Has_Invariants (SId);
4543 Set_Invariant_Procedure (Typ, SId);
4546 Make_Procedure_Specification (Loc,
4547 Defining_Unit_Name => SId,
4548 Parameter_Specifications => New_List (
4549 Make_Parameter_Specification (Loc,
4550 Defining_Identifier => Object_Entity,
4551 Parameter_Type => New_Occurrence_Of (Typ, Loc))));
4553 PDecl := Make_Subprogram_Declaration (Loc, Specification => Spec);
4555 -- Build procedure body
4558 Make_Defining_Identifier (Loc,
4559 Chars => New_External_Name (Chars (Typ), "Invariant"));
4562 Make_Procedure_Specification (Loc,
4563 Defining_Unit_Name => SId,
4564 Parameter_Specifications => New_List (
4565 Make_Parameter_Specification (Loc,
4566 Defining_Identifier =>
4567 Make_Defining_Identifier (Loc, Object_Name),
4568 Parameter_Type => New_Occurrence_Of (Typ, Loc))));
4571 Make_Subprogram_Body (Loc,
4572 Specification => Spec,
4573 Declarations => Empty_List,
4574 Handled_Statement_Sequence =>
4575 Make_Handled_Sequence_Of_Statements (Loc,
4576 Statements => Stmts));
4578 -- Insert procedure declaration and spec at the appropriate points.
4579 -- Skip this if there are no private declarations (that's an error
4580 -- that will be diagnosed elsewhere, and there is no point in having
4581 -- an invariant procedure set if the full declaration is missing).
4583 if Present (Private_Decls) then
4585 -- The spec goes at the end of visible declarations, but they have
4586 -- already been analyzed, so we need to explicitly do the analyze.
4588 Append_To (Visible_Decls, PDecl);
4591 -- The body goes at the end of the private declarations, which we
4592 -- have not analyzed yet, so we do not need to perform an explicit
4593 -- analyze call. We skip this if there are no private declarations
4594 -- (this is an error that will be caught elsewhere);
4596 Append_To (Private_Decls, PBody);
4599 end Build_Invariant_Procedure;
4601 ------------------------------
4602 -- Build_Predicate_Function --
4603 ------------------------------
4605 -- The procedure that is constructed here has the form
4607 -- function typPredicate (Ixxx : typ) return Boolean is
4610 -- exp1 and then exp2 and then ...
4611 -- and then typ1Predicate (typ1 (Ixxx))
4612 -- and then typ2Predicate (typ2 (Ixxx))
4614 -- end typPredicate;
4616 -- Here exp1, and exp2 are expressions from Predicate pragmas. Note that
4617 -- this is the point at which these expressions get analyzed, providing the
4618 -- required delay, and typ1, typ2, are entities from which predicates are
4619 -- inherited. Note that we do NOT generate Check pragmas, that's because we
4620 -- use this function even if checks are off, e.g. for membership tests.
4622 procedure Build_Predicate_Function (Typ : Entity_Id; N : Node_Id) is
4623 Loc : constant Source_Ptr := Sloc (Typ);
4630 -- This is the expression for the return statement in the function. It
4631 -- is build by connecting the component predicates with AND THEN.
4633 procedure Add_Call (T : Entity_Id);
4634 -- Includes a call to the predicate function for type T in Expr if T
4635 -- has predicates and Predicate_Function (T) is non-empty.
4637 procedure Add_Predicates;
4638 -- Appends expressions for any Predicate pragmas in the rep item chain
4639 -- Typ to Expr. Note that we look only at items for this exact entity.
4640 -- Inheritance of predicates for the parent type is done by calling the
4641 -- Predicate_Function of the parent type, using Add_Call above.
4643 Object_Name : constant Name_Id := New_Internal_Name ('I');
4644 -- Name for argument of Predicate procedure
4646 Object_Entity : constant Entity_Id :=
4647 Make_Defining_Identifier (Loc, Object_Name);
4648 -- The entity for the spec entity for the argument
4650 Dynamic_Predicate_Present : Boolean := False;
4651 -- Set True if a dynamic predicate is present, results in the entire
4652 -- predicate being considered dynamic even if it looks static
4654 Static_Predicate_Present : Node_Id := Empty;
4655 -- Set to N_Pragma node for a static predicate if one is encountered.
4661 procedure Add_Call (T : Entity_Id) is
4665 if Present (T) and then Present (Predicate_Function (T)) then
4666 Set_Has_Predicates (Typ);
4668 -- Build the call to the predicate function of T
4672 (T, Convert_To (T, Make_Identifier (Loc, Object_Name)));
4674 -- Add call to evolving expression, using AND THEN if needed
4681 Left_Opnd => Relocate_Node (Expr),
4685 -- Output info message on inheritance if required. Note we do not
4686 -- give this information for generic actual types, since it is
4687 -- unwelcome noise in that case in instantiations. We also
4688 -- generally suppress the message in instantiations, and also
4689 -- if it involves internal names.
4691 if Opt.List_Inherited_Aspects
4692 and then not Is_Generic_Actual_Type (Typ)
4693 and then Instantiation_Depth (Sloc (Typ)) = 0
4694 and then not Is_Internal_Name (Chars (T))
4695 and then not Is_Internal_Name (Chars (Typ))
4697 Error_Msg_Sloc := Sloc (Predicate_Function (T));
4698 Error_Msg_Node_2 := T;
4699 Error_Msg_N ("?info: & inherits predicate from & #", Typ);
4704 --------------------
4705 -- Add_Predicates --
4706 --------------------
4708 procedure Add_Predicates is
4713 procedure Replace_Type_Reference (N : Node_Id);
4714 -- Replace a single occurrence N of the subtype name with a reference
4715 -- to the formal of the predicate function. N can be an identifier
4716 -- referencing the subtype, or a selected component, representing an
4717 -- appropriately qualified occurrence of the subtype name.
4719 procedure Replace_Type_References is
4720 new Replace_Type_References_Generic (Replace_Type_Reference);
4721 -- Traverse an expression changing every occurrence of an identifier
4722 -- whose name matches the name of the subtype with a reference to
4723 -- the formal parameter of the predicate function.
4725 ----------------------------
4726 -- Replace_Type_Reference --
4727 ----------------------------
4729 procedure Replace_Type_Reference (N : Node_Id) is
4731 Rewrite (N, Make_Identifier (Loc, Object_Name));
4732 Set_Entity (N, Object_Entity);
4734 end Replace_Type_Reference;
4736 -- Start of processing for Add_Predicates
4739 Ritem := First_Rep_Item (Typ);
4740 while Present (Ritem) loop
4741 if Nkind (Ritem) = N_Pragma
4742 and then Pragma_Name (Ritem) = Name_Predicate
4744 if Present (Corresponding_Aspect (Ritem)) then
4745 case Chars (Identifier (Corresponding_Aspect (Ritem))) is
4746 when Name_Dynamic_Predicate =>
4747 Dynamic_Predicate_Present := True;
4748 when Name_Static_Predicate =>
4749 Static_Predicate_Present := Ritem;
4755 -- Acquire arguments
4757 Arg1 := First (Pragma_Argument_Associations (Ritem));
4758 Arg2 := Next (Arg1);
4760 Arg1 := Get_Pragma_Arg (Arg1);
4761 Arg2 := Get_Pragma_Arg (Arg2);
4763 -- See if this predicate pragma is for the current type or for
4764 -- its full view. A predicate on a private completion is placed
4765 -- on the partial view beause this is the visible entity that
4768 if Entity (Arg1) = Typ
4769 or else Full_View (Entity (Arg1)) = Typ
4772 -- We have a match, this entry is for our subtype
4774 -- We need to replace any occurrences of the name of the
4775 -- type with references to the object.
4777 Replace_Type_References (Arg2, Chars (Typ));
4779 -- If this predicate comes from an aspect, find the aspect
4780 -- specification, and replace the saved expression because
4781 -- we need the subtype references replaced for the calls to
4782 -- Preanalyze_Spec_Expressin in Check_Aspect_At_Freeze_Point
4783 -- and Check_Aspect_At_End_Of_Declarations.
4785 if From_Aspect_Specification (Ritem) then
4790 -- Loop to find corresponding aspect, note that this
4791 -- must be present given the pragma is marked delayed.
4793 Aitem := Next_Rep_Item (Ritem);
4795 if Nkind (Aitem) = N_Aspect_Specification
4796 and then Aspect_Rep_Item (Aitem) = Ritem
4799 (Identifier (Aitem), New_Copy_Tree (Arg2));
4803 Aitem := Next_Rep_Item (Aitem);
4808 -- Now we can add the expression
4811 Expr := Relocate_Node (Arg2);
4813 -- There already was a predicate, so add to it
4818 Left_Opnd => Relocate_Node (Expr),
4819 Right_Opnd => Relocate_Node (Arg2));
4824 Next_Rep_Item (Ritem);
4828 -- Start of processing for Build_Predicate_Function
4831 -- Initialize for construction of statement list
4835 -- Return if already built or if type does not have predicates
4837 if not Has_Predicates (Typ)
4838 or else Present (Predicate_Function (Typ))
4843 -- Add Predicates for the current type
4847 -- Add predicates for ancestor if present
4850 Atyp : constant Entity_Id := Nearest_Ancestor (Typ);
4852 if Present (Atyp) then
4857 -- If we have predicates, build the function
4859 if Present (Expr) then
4861 -- Build function declaration
4863 pragma Assert (Has_Predicates (Typ));
4865 Make_Defining_Identifier (Loc,
4866 Chars => New_External_Name (Chars (Typ), "Predicate"));
4867 Set_Has_Predicates (SId);
4868 Set_Predicate_Function (Typ, SId);
4871 Make_Function_Specification (Loc,
4872 Defining_Unit_Name => SId,
4873 Parameter_Specifications => New_List (
4874 Make_Parameter_Specification (Loc,
4875 Defining_Identifier => Object_Entity,
4876 Parameter_Type => New_Occurrence_Of (Typ, Loc))),
4877 Result_Definition =>
4878 New_Occurrence_Of (Standard_Boolean, Loc));
4880 FDecl := Make_Subprogram_Declaration (Loc, Specification => Spec);
4882 -- Build function body
4885 Make_Defining_Identifier (Loc,
4886 Chars => New_External_Name (Chars (Typ), "Predicate"));
4889 Make_Function_Specification (Loc,
4890 Defining_Unit_Name => SId,
4891 Parameter_Specifications => New_List (
4892 Make_Parameter_Specification (Loc,
4893 Defining_Identifier =>
4894 Make_Defining_Identifier (Loc, Object_Name),
4896 New_Occurrence_Of (Typ, Loc))),
4897 Result_Definition =>
4898 New_Occurrence_Of (Standard_Boolean, Loc));
4901 Make_Subprogram_Body (Loc,
4902 Specification => Spec,
4903 Declarations => Empty_List,
4904 Handled_Statement_Sequence =>
4905 Make_Handled_Sequence_Of_Statements (Loc,
4906 Statements => New_List (
4907 Make_Simple_Return_Statement (Loc,
4908 Expression => Expr))));
4910 -- Insert declaration before freeze node and body after
4912 Insert_Before_And_Analyze (N, FDecl);
4913 Insert_After_And_Analyze (N, FBody);
4915 -- Deal with static predicate case
4917 if Ekind_In (Typ, E_Enumeration_Subtype,
4918 E_Modular_Integer_Subtype,
4919 E_Signed_Integer_Subtype)
4920 and then Is_Static_Subtype (Typ)
4921 and then not Dynamic_Predicate_Present
4923 Build_Static_Predicate (Typ, Expr, Object_Name);
4925 if Present (Static_Predicate_Present)
4926 and No (Static_Predicate (Typ))
4929 ("expression does not have required form for "
4930 & "static predicate",
4931 Next (First (Pragma_Argument_Associations
4932 (Static_Predicate_Present))));
4936 end Build_Predicate_Function;
4938 ----------------------------
4939 -- Build_Static_Predicate --
4940 ----------------------------
4942 procedure Build_Static_Predicate
4947 Loc : constant Source_Ptr := Sloc (Expr);
4949 Non_Static : exception;
4950 -- Raised if something non-static is found
4952 Btyp : constant Entity_Id := Base_Type (Typ);
4954 BLo : constant Uint := Expr_Value (Type_Low_Bound (Btyp));
4955 BHi : constant Uint := Expr_Value (Type_High_Bound (Btyp));
4956 -- Low bound and high bound value of base type of Typ
4958 TLo : constant Uint := Expr_Value (Type_Low_Bound (Typ));
4959 THi : constant Uint := Expr_Value (Type_High_Bound (Typ));
4960 -- Low bound and high bound values of static subtype Typ
4965 -- One entry in a Rlist value, a single REnt (range entry) value
4966 -- denotes one range from Lo to Hi. To represent a single value
4967 -- range Lo = Hi = value.
4969 type RList is array (Nat range <>) of REnt;
4970 -- A list of ranges. The ranges are sorted in increasing order,
4971 -- and are disjoint (there is a gap of at least one value between
4972 -- each range in the table). A value is in the set of ranges in
4973 -- Rlist if it lies within one of these ranges
4975 False_Range : constant RList :=
4976 RList'(1 .. 0 => REnt'(No_Uint, No_Uint));
4977 -- An empty set of ranges represents a range list that can never be
4978 -- satisfied, since there are no ranges in which the value could lie,
4979 -- so it does not lie in any of them. False_Range is a canonical value
4980 -- for this empty set, but general processing should test for an Rlist
4981 -- with length zero (see Is_False predicate), since other null ranges
4982 -- may appear which must be treated as False.
4984 True_Range : constant RList := RList'(1 => REnt'(BLo, BHi));
4985 -- Range representing True, value must be in the base range
4987 function "and" (Left, Right : RList) return RList;
4988 -- And's together two range lists, returning a range list. This is
4989 -- a set intersection operation.
4991 function "or" (Left, Right : RList) return RList;
4992 -- Or's together two range lists, returning a range list. This is a
4993 -- set union operation.
4995 function "not" (Right : RList) return RList;
4996 -- Returns complement of a given range list, i.e. a range list
4997 -- representing all the values in TLo .. THi that are not in the
4998 -- input operand Right.
5000 function Build_Val (V : Uint) return Node_Id;
5001 -- Return an analyzed N_Identifier node referencing this value, suitable
5002 -- for use as an entry in the Static_Predicate list. This node is typed
5003 -- with the base type.
5005 function Build_Range (Lo, Hi : Uint) return Node_Id;
5006 -- Return an analyzed N_Range node referencing this range, suitable
5007 -- for use as an entry in the Static_Predicate list. This node is typed
5008 -- with the base type.
5010 function Get_RList (Exp : Node_Id) return RList;
5011 -- This is a recursive routine that converts the given expression into
5012 -- a list of ranges, suitable for use in building the static predicate.
5014 function Is_False (R : RList) return Boolean;
5015 pragma Inline (Is_False);
5016 -- Returns True if the given range list is empty, and thus represents
5017 -- a False list of ranges that can never be satisfied.
5019 function Is_True (R : RList) return Boolean;
5020 -- Returns True if R trivially represents the True predicate by having
5021 -- a single range from BLo to BHi.
5023 function Is_Type_Ref (N : Node_Id) return Boolean;
5024 pragma Inline (Is_Type_Ref);
5025 -- Returns if True if N is a reference to the type for the predicate in
5026 -- the expression (i.e. if it is an identifier whose Chars field matches
5027 -- the Nam given in the call).
5029 function Lo_Val (N : Node_Id) return Uint;
5030 -- Given static expression or static range from a Static_Predicate list,
5031 -- gets expression value or low bound of range.
5033 function Hi_Val (N : Node_Id) return Uint;
5034 -- Given static expression or static range from a Static_Predicate list,
5035 -- gets expression value of high bound of range.
5037 function Membership_Entry (N : Node_Id) return RList;
5038 -- Given a single membership entry (range, value, or subtype), returns
5039 -- the corresponding range list. Raises Static_Error if not static.
5041 function Membership_Entries (N : Node_Id) return RList;
5042 -- Given an element on an alternatives list of a membership operation,
5043 -- returns the range list corresponding to this entry and all following
5044 -- entries (i.e. returns the "or" of this list of values).
5046 function Stat_Pred (Typ : Entity_Id) return RList;
5047 -- Given a type, if it has a static predicate, then return the predicate
5048 -- as a range list, otherwise raise Non_Static.
5054 function "and" (Left, Right : RList) return RList is
5056 -- First range of result
5058 SLeft : Nat := Left'First;
5059 -- Start of rest of left entries
5061 SRight : Nat := Right'First;
5062 -- Start of rest of right entries
5065 -- If either range is True, return the other
5067 if Is_True (Left) then
5069 elsif Is_True (Right) then
5073 -- If either range is False, return False
5075 if Is_False (Left) or else Is_False (Right) then
5079 -- Loop to remove entries at start that are disjoint, and thus
5080 -- just get discarded from the result entirely.
5083 -- If no operands left in either operand, result is false
5085 if SLeft > Left'Last or else SRight > Right'Last then
5088 -- Discard first left operand entry if disjoint with right
5090 elsif Left (SLeft).Hi < Right (SRight).Lo then
5093 -- Discard first right operand entry if disjoint with left
5095 elsif Right (SRight).Hi < Left (SLeft).Lo then
5096 SRight := SRight + 1;
5098 -- Otherwise we have an overlapping entry
5105 -- Now we have two non-null operands, and first entries overlap.
5106 -- The first entry in the result will be the overlapping part of
5107 -- these two entries.
5109 FEnt := REnt'(Lo => UI_Max (Left (SLeft).Lo, Right (SRight).Lo),
5110 Hi => UI_Min (Left (SLeft).Hi, Right (SRight).Hi));
5112 -- Now we can remove the entry that ended at a lower value, since
5113 -- its contribution is entirely contained in Fent.
5115 if Left (SLeft).Hi <= Right (SRight).Hi then
5118 SRight := SRight + 1;
5121 -- Compute result by concatenating this first entry with the "and"
5122 -- of the remaining parts of the left and right operands. Note that
5123 -- if either of these is empty, "and" will yield empty, so that we
5124 -- will end up with just Fent, which is what we want in that case.
5127 FEnt & (Left (SLeft .. Left'Last) and Right (SRight .. Right'Last));
5134 function "not" (Right : RList) return RList is
5136 -- Return True if False range
5138 if Is_False (Right) then
5142 -- Return False if True range
5144 if Is_True (Right) then
5148 -- Here if not trivial case
5151 Result : RList (1 .. Right'Length + 1);
5152 -- May need one more entry for gap at beginning and end
5155 -- Number of entries stored in Result
5160 if Right (Right'First).Lo > TLo then
5162 Result (Count) := REnt'(TLo, Right (Right'First).Lo - 1);
5165 -- Gaps between ranges
5167 for J in Right'First .. Right'Last - 1 loop
5170 REnt'(Right (J).Hi + 1, Right (J + 1).Lo - 1);
5175 if Right (Right'Last).Hi < THi then
5177 Result (Count) := REnt'(Right (Right'Last).Hi + 1, THi);
5180 return Result (1 .. Count);
5188 function "or" (Left, Right : RList) return RList is
5190 -- First range of result
5192 SLeft : Nat := Left'First;
5193 -- Start of rest of left entries
5195 SRight : Nat := Right'First;
5196 -- Start of rest of right entries
5199 -- If either range is True, return True
5201 if Is_True (Left) or else Is_True (Right) then
5205 -- If either range is False (empty), return the other
5207 if Is_False (Left) then
5209 elsif Is_False (Right) then
5213 -- Initialize result first entry from left or right operand
5214 -- depending on which starts with the lower range.
5216 if Left (SLeft).Lo < Right (SRight).Lo then
5217 FEnt := Left (SLeft);
5220 FEnt := Right (SRight);
5221 SRight := SRight + 1;
5224 -- This loop eats ranges from left and right operands that
5225 -- are contiguous with the first range we are gathering.
5228 -- Eat first entry in left operand if contiguous or
5229 -- overlapped by gathered first operand of result.
5231 if SLeft <= Left'Last
5232 and then Left (SLeft).Lo <= FEnt.Hi + 1
5234 FEnt.Hi := UI_Max (FEnt.Hi, Left (SLeft).Hi);
5237 -- Eat first entry in right operand if contiguous or
5238 -- overlapped by gathered right operand of result.
5240 elsif SRight <= Right'Last
5241 and then Right (SRight).Lo <= FEnt.Hi + 1
5243 FEnt.Hi := UI_Max (FEnt.Hi, Right (SRight).Hi);
5244 SRight := SRight + 1;
5246 -- All done if no more entries to eat!
5253 -- Obtain result as the first entry we just computed, concatenated
5254 -- to the "or" of the remaining results (if one operand is empty,
5255 -- this will just concatenate with the other
5258 FEnt & (Left (SLeft .. Left'Last) or Right (SRight .. Right'Last));
5265 function Build_Range (Lo, Hi : Uint) return Node_Id is
5269 return Build_Val (Hi);
5273 Low_Bound => Build_Val (Lo),
5274 High_Bound => Build_Val (Hi));
5275 Set_Etype (Result, Btyp);
5276 Set_Analyzed (Result);
5285 function Build_Val (V : Uint) return Node_Id is
5289 if Is_Enumeration_Type (Typ) then
5290 Result := Get_Enum_Lit_From_Pos (Typ, V, Loc);
5292 Result := Make_Integer_Literal (Loc, V);
5295 Set_Etype (Result, Btyp);
5296 Set_Is_Static_Expression (Result);
5297 Set_Analyzed (Result);
5305 function Get_RList (Exp : Node_Id) return RList is
5310 -- Static expression can only be true or false
5312 if Is_OK_Static_Expression (Exp) then
5316 if Expr_Value (Exp) = 0 then
5323 -- Otherwise test node type
5331 when N_Op_And | N_And_Then =>
5332 return Get_RList (Left_Opnd (Exp))
5334 Get_RList (Right_Opnd (Exp));
5338 when N_Op_Or | N_Or_Else =>
5339 return Get_RList (Left_Opnd (Exp))
5341 Get_RList (Right_Opnd (Exp));
5346 return not Get_RList (Right_Opnd (Exp));
5348 -- Comparisons of type with static value
5350 when N_Op_Compare =>
5351 -- Type is left operand
5353 if Is_Type_Ref (Left_Opnd (Exp))
5354 and then Is_OK_Static_Expression (Right_Opnd (Exp))
5356 Val := Expr_Value (Right_Opnd (Exp));
5358 -- Typ is right operand
5360 elsif Is_Type_Ref (Right_Opnd (Exp))
5361 and then Is_OK_Static_Expression (Left_Opnd (Exp))
5363 Val := Expr_Value (Left_Opnd (Exp));
5365 -- Invert sense of comparison
5368 when N_Op_Gt => Op := N_Op_Lt;
5369 when N_Op_Lt => Op := N_Op_Gt;
5370 when N_Op_Ge => Op := N_Op_Le;
5371 when N_Op_Le => Op := N_Op_Ge;
5372 when others => null;
5375 -- Other cases are non-static
5381 -- Construct range according to comparison operation
5385 return RList'(1 => REnt'(Val, Val));
5388 return RList'(1 => REnt'(Val, BHi));
5391 return RList'(1 => REnt'(Val + 1, BHi));
5394 return RList'(1 => REnt'(BLo, Val));
5397 return RList'(1 => REnt'(BLo, Val - 1));
5400 return RList'(REnt'(BLo, Val - 1),
5401 REnt'(Val + 1, BHi));
5404 raise Program_Error;
5410 if not Is_Type_Ref (Left_Opnd (Exp)) then
5414 if Present (Right_Opnd (Exp)) then
5415 return Membership_Entry (Right_Opnd (Exp));
5417 return Membership_Entries (First (Alternatives (Exp)));
5420 -- Negative membership (NOT IN)
5423 if not Is_Type_Ref (Left_Opnd (Exp)) then
5427 if Present (Right_Opnd (Exp)) then
5428 return not Membership_Entry (Right_Opnd (Exp));
5430 return not Membership_Entries (First (Alternatives (Exp)));
5433 -- Function call, may be call to static predicate
5435 when N_Function_Call =>
5436 if Is_Entity_Name (Name (Exp)) then
5438 Ent : constant Entity_Id := Entity (Name (Exp));
5440 if Has_Predicates (Ent) then
5441 return Stat_Pred (Etype (First_Formal (Ent)));
5446 -- Other function call cases are non-static
5450 -- Qualified expression, dig out the expression
5452 when N_Qualified_Expression =>
5453 return Get_RList (Expression (Exp));
5458 return (Get_RList (Left_Opnd (Exp))
5459 and not Get_RList (Right_Opnd (Exp)))
5460 or (Get_RList (Right_Opnd (Exp))
5461 and not Get_RList (Left_Opnd (Exp)));
5463 -- Any other node type is non-static
5474 function Hi_Val (N : Node_Id) return Uint is
5476 if Is_Static_Expression (N) then
5477 return Expr_Value (N);
5479 pragma Assert (Nkind (N) = N_Range);
5480 return Expr_Value (High_Bound (N));
5488 function Is_False (R : RList) return Boolean is
5490 return R'Length = 0;
5497 function Is_True (R : RList) return Boolean is
5500 and then R (R'First).Lo = BLo
5501 and then R (R'First).Hi = BHi;
5508 function Is_Type_Ref (N : Node_Id) return Boolean is
5510 return Nkind (N) = N_Identifier and then Chars (N) = Nam;
5517 function Lo_Val (N : Node_Id) return Uint is
5519 if Is_Static_Expression (N) then
5520 return Expr_Value (N);
5522 pragma Assert (Nkind (N) = N_Range);
5523 return Expr_Value (Low_Bound (N));
5527 ------------------------
5528 -- Membership_Entries --
5529 ------------------------
5531 function Membership_Entries (N : Node_Id) return RList is
5533 if No (Next (N)) then
5534 return Membership_Entry (N);
5536 return Membership_Entry (N) or Membership_Entries (Next (N));
5538 end Membership_Entries;
5540 ----------------------
5541 -- Membership_Entry --
5542 ----------------------
5544 function Membership_Entry (N : Node_Id) return RList is
5552 if Nkind (N) = N_Range then
5553 if not Is_Static_Expression (Low_Bound (N))
5555 not Is_Static_Expression (High_Bound (N))
5559 SLo := Expr_Value (Low_Bound (N));
5560 SHi := Expr_Value (High_Bound (N));
5561 return RList'(1 => REnt'(SLo, SHi));
5564 -- Static expression case
5566 elsif Is_Static_Expression (N) then
5567 Val := Expr_Value (N);
5568 return RList'(1 => REnt'(Val, Val));
5570 -- Identifier (other than static expression) case
5572 else pragma Assert (Nkind (N) = N_Identifier);
5576 if Is_Type (Entity (N)) then
5578 -- If type has predicates, process them
5580 if Has_Predicates (Entity (N)) then
5581 return Stat_Pred (Entity (N));
5583 -- For static subtype without predicates, get range
5585 elsif Is_Static_Subtype (Entity (N)) then
5586 SLo := Expr_Value (Type_Low_Bound (Entity (N)));
5587 SHi := Expr_Value (Type_High_Bound (Entity (N)));
5588 return RList'(1 => REnt'(SLo, SHi));
5590 -- Any other type makes us non-static
5596 -- Any other kind of identifier in predicate (e.g. a non-static
5597 -- expression value) means this is not a static predicate.
5603 end Membership_Entry;
5609 function Stat_Pred (Typ : Entity_Id) return RList is
5611 -- Not static if type does not have static predicates
5613 if not Has_Predicates (Typ)
5614 or else No (Static_Predicate (Typ))
5619 -- Otherwise we convert the predicate list to a range list
5622 Result : RList (1 .. List_Length (Static_Predicate (Typ)));
5626 P := First (Static_Predicate (Typ));
5627 for J in Result'Range loop
5628 Result (J) := REnt'(Lo_Val (P), Hi_Val (P));
5636 -- Start of processing for Build_Static_Predicate
5639 -- Now analyze the expression to see if it is a static predicate
5642 Ranges : constant RList := Get_RList (Expr);
5643 -- Range list from expression if it is static
5648 -- Convert range list into a form for the static predicate. In the
5649 -- Ranges array, we just have raw ranges, these must be converted
5650 -- to properly typed and analyzed static expressions or range nodes.
5652 -- Note: here we limit ranges to the ranges of the subtype, so that
5653 -- a predicate is always false for values outside the subtype. That
5654 -- seems fine, such values are invalid anyway, and considering them
5655 -- to fail the predicate seems allowed and friendly, and furthermore
5656 -- simplifies processing for case statements and loops.
5660 for J in Ranges'Range loop
5662 Lo : Uint := Ranges (J).Lo;
5663 Hi : Uint := Ranges (J).Hi;
5666 -- Ignore completely out of range entry
5668 if Hi < TLo or else Lo > THi then
5671 -- Otherwise process entry
5674 -- Adjust out of range value to subtype range
5684 -- Convert range into required form
5687 Append_To (Plist, Build_Val (Lo));
5689 Append_To (Plist, Build_Range (Lo, Hi));
5695 -- Processing was successful and all entries were static, so now we
5696 -- can store the result as the predicate list.
5698 Set_Static_Predicate (Typ, Plist);
5700 -- The processing for static predicates put the expression into
5701 -- canonical form as a series of ranges. It also eliminated
5702 -- duplicates and collapsed and combined ranges. We might as well
5703 -- replace the alternatives list of the right operand of the
5704 -- membership test with the static predicate list, which will
5705 -- usually be more efficient.
5708 New_Alts : constant List_Id := New_List;
5713 Old_Node := First (Plist);
5714 while Present (Old_Node) loop
5715 New_Node := New_Copy (Old_Node);
5717 if Nkind (New_Node) = N_Range then
5718 Set_Low_Bound (New_Node, New_Copy (Low_Bound (Old_Node)));
5719 Set_High_Bound (New_Node, New_Copy (High_Bound (Old_Node)));
5722 Append_To (New_Alts, New_Node);
5726 -- If empty list, replace by False
5728 if Is_Empty_List (New_Alts) then
5729 Rewrite (Expr, New_Occurrence_Of (Standard_False, Loc));
5731 -- Else replace by set membership test
5736 Left_Opnd => Make_Identifier (Loc, Nam),
5737 Right_Opnd => Empty,
5738 Alternatives => New_Alts));
5740 -- Resolve new expression in function context
5742 Install_Formals (Predicate_Function (Typ));
5743 Push_Scope (Predicate_Function (Typ));
5744 Analyze_And_Resolve (Expr, Standard_Boolean);
5750 -- If non-static, return doing nothing
5755 end Build_Static_Predicate;
5757 -----------------------------------------
5758 -- Check_Aspect_At_End_Of_Declarations --
5759 -----------------------------------------
5761 procedure Check_Aspect_At_End_Of_Declarations (ASN : Node_Id) is
5762 Ent : constant Entity_Id := Entity (ASN);
5763 Ident : constant Node_Id := Identifier (ASN);
5765 Freeze_Expr : constant Node_Id := Expression (ASN);
5766 -- Expression from call to Check_Aspect_At_Freeze_Point
5768 End_Decl_Expr : constant Node_Id := Entity (Ident);
5769 -- Expression to be analyzed at end of declarations
5771 T : constant Entity_Id := Etype (Freeze_Expr);
5772 -- Type required for preanalyze call
5774 A_Id : constant Aspect_Id := Get_Aspect_Id (Chars (Ident));
5777 -- Set False if error
5779 -- On entry to this procedure, Entity (Ident) contains a copy of the
5780 -- original expression from the aspect, saved for this purpose, and
5781 -- but Expression (Ident) is a preanalyzed copy of the expression,
5782 -- preanalyzed just after the freeze point.
5785 -- Case of stream attributes, just have to compare entities
5787 if A_Id = Aspect_Input or else
5788 A_Id = Aspect_Output or else
5789 A_Id = Aspect_Read or else
5792 Analyze (End_Decl_Expr);
5793 Err := Entity (End_Decl_Expr) /= Entity (Freeze_Expr);
5795 elsif A_Id = Aspect_Variable_Indexing or else
5796 A_Id = Aspect_Constant_Indexing or else
5797 A_Id = Aspect_Default_Iterator or else
5798 A_Id = Aspect_Iterator_Element
5800 -- Make type unfrozen before analysis, to prevent spurious errors
5801 -- about late attributes.
5803 Set_Is_Frozen (Ent, False);
5804 Analyze (End_Decl_Expr);
5805 Analyze (Aspect_Rep_Item (ASN));
5806 Set_Is_Frozen (Ent, True);
5808 -- If the end of declarations comes before any other freeze
5809 -- point, the Freeze_Expr is not analyzed: no check needed.
5812 Analyzed (Freeze_Expr)
5813 and then not In_Instance
5814 and then Entity (End_Decl_Expr) /= Entity (Freeze_Expr);
5819 Preanalyze_Spec_Expression (End_Decl_Expr, T);
5820 Err := not Fully_Conformant_Expressions (End_Decl_Expr, Freeze_Expr);
5823 -- Output error message if error
5827 ("visibility of aspect for& changes after freeze point",
5830 ("?info: & is frozen here, aspects evaluated at this point",
5831 Freeze_Node (Ent), Ent);
5833 end Check_Aspect_At_End_Of_Declarations;
5835 ----------------------------------
5836 -- Check_Aspect_At_Freeze_Point --
5837 ----------------------------------
5839 procedure Check_Aspect_At_Freeze_Point (ASN : Node_Id) is
5840 Ident : constant Node_Id := Identifier (ASN);
5841 -- Identifier (use Entity field to save expression)
5844 -- Type required for preanalyze call
5846 A_Id : constant Aspect_Id := Get_Aspect_Id (Chars (Ident));
5849 -- On entry to this procedure, Entity (Ident) contains a copy of the
5850 -- original expression from the aspect, saved for this purpose.
5852 -- On exit from this procedure Entity (Ident) is unchanged, still
5853 -- containing that copy, but Expression (Ident) is a preanalyzed copy
5854 -- of the expression, preanalyzed just after the freeze point.
5856 -- Make a copy of the expression to be preanalyed
5858 Set_Expression (ASN, New_Copy_Tree (Entity (Ident)));
5860 -- Find type for preanalyze call
5864 -- No_Aspect should be impossible
5867 raise Program_Error;
5869 -- Library unit aspects should be impossible (never delayed)
5871 when Library_Unit_Aspects =>
5872 raise Program_Error;
5874 -- Aspects taking an optional boolean argument. Should be impossible
5875 -- since these are never delayed.
5877 when Boolean_Aspects =>
5878 raise Program_Error;
5880 -- Test_Case aspect applies to entries and subprograms, hence should
5881 -- never be delayed.
5883 when Aspect_Test_Case =>
5884 raise Program_Error;
5886 when Aspect_Attach_Handler =>
5887 T := RTE (RE_Interrupt_ID);
5889 -- Default_Value is resolved with the type entity in question
5891 when Aspect_Default_Value =>
5894 -- Default_Component_Value is resolved with the component type
5896 when Aspect_Default_Component_Value =>
5897 T := Component_Type (Entity (ASN));
5899 -- Aspects corresponding to attribute definition clauses
5901 when Aspect_Address =>
5902 T := RTE (RE_Address);
5904 when Aspect_Bit_Order =>
5905 T := RTE (RE_Bit_Order);
5908 T := RTE (RE_CPU_Range);
5910 when Aspect_Dispatching_Domain =>
5911 T := RTE (RE_Dispatching_Domain);
5913 when Aspect_External_Tag =>
5914 T := Standard_String;
5916 when Aspect_Priority | Aspect_Interrupt_Priority =>
5917 T := Standard_Integer;
5919 when Aspect_Small =>
5920 T := Universal_Real;
5922 when Aspect_Storage_Pool =>
5923 T := Class_Wide_Type (RTE (RE_Root_Storage_Pool));
5925 when Aspect_Alignment |
5926 Aspect_Component_Size |
5927 Aspect_Machine_Radix |
5928 Aspect_Object_Size |
5930 Aspect_Storage_Size |
5931 Aspect_Stream_Size |
5932 Aspect_Value_Size =>
5935 -- Stream attribute. Special case, the expression is just an entity
5936 -- that does not need any resolution, so just analyze.
5942 Analyze (Expression (ASN));
5945 -- Same for Iterator aspects, where the expression is a function
5946 -- name. Legality rules are checked separately.
5948 when Aspect_Constant_Indexing |
5949 Aspect_Default_Iterator |
5950 Aspect_Iterator_Element |
5951 Aspect_Implicit_Dereference |
5952 Aspect_Variable_Indexing =>
5953 Analyze (Expression (ASN));
5956 -- Suppress/Unsuppress/Warnings should never be delayed
5958 when Aspect_Suppress |
5961 raise Program_Error;
5963 -- Pre/Post/Invariant/Predicate take boolean expressions
5965 when Aspect_Dynamic_Predicate |
5968 Aspect_Precondition |
5970 Aspect_Postcondition |
5972 Aspect_Static_Predicate |
5973 Aspect_Type_Invariant =>
5974 T := Standard_Boolean;
5977 -- Do the preanalyze call
5979 Preanalyze_Spec_Expression (Expression (ASN), T);
5980 end Check_Aspect_At_Freeze_Point;
5982 -----------------------------------
5983 -- Check_Constant_Address_Clause --
5984 -----------------------------------
5986 procedure Check_Constant_Address_Clause
5990 procedure Check_At_Constant_Address (Nod : Node_Id);
5991 -- Checks that the given node N represents a name whose 'Address is
5992 -- constant (in the same sense as OK_Constant_Address_Clause, i.e. the
5993 -- address value is the same at the point of declaration of U_Ent and at
5994 -- the time of elaboration of the address clause.
5996 procedure Check_Expr_Constants (Nod : Node_Id);
5997 -- Checks that Nod meets the requirements for a constant address clause
5998 -- in the sense of the enclosing procedure.
6000 procedure Check_List_Constants (Lst : List_Id);
6001 -- Check that all elements of list Lst meet the requirements for a
6002 -- constant address clause in the sense of the enclosing procedure.
6004 -------------------------------
6005 -- Check_At_Constant_Address --
6006 -------------------------------
6008 procedure Check_At_Constant_Address (Nod : Node_Id) is
6010 if Is_Entity_Name (Nod) then
6011 if Present (Address_Clause (Entity ((Nod)))) then
6013 ("invalid address clause for initialized object &!",
6016 ("address for& cannot" &
6017 " depend on another address clause! (RM 13.1(22))!",
6020 elsif In_Same_Source_Unit (Entity (Nod), U_Ent)
6021 and then Sloc (U_Ent) < Sloc (Entity (Nod))
6024 ("invalid address clause for initialized object &!",
6026 Error_Msg_Node_2 := U_Ent;
6028 ("\& must be defined before & (RM 13.1(22))!",
6032 elsif Nkind (Nod) = N_Selected_Component then
6034 T : constant Entity_Id := Etype (Prefix (Nod));
6037 if (Is_Record_Type (T)
6038 and then Has_Discriminants (T))
6041 and then Is_Record_Type (Designated_Type (T))
6042 and then Has_Discriminants (Designated_Type (T)))
6045 ("invalid address clause for initialized object &!",
6048 ("\address cannot depend on component" &
6049 " of discriminated record (RM 13.1(22))!",
6052 Check_At_Constant_Address (Prefix (Nod));
6056 elsif Nkind (Nod) = N_Indexed_Component then
6057 Check_At_Constant_Address (Prefix (Nod));
6058 Check_List_Constants (Expressions (Nod));
6061 Check_Expr_Constants (Nod);
6063 end Check_At_Constant_Address;
6065 --------------------------
6066 -- Check_Expr_Constants --
6067 --------------------------
6069 procedure Check_Expr_Constants (Nod : Node_Id) is
6070 Loc_U_Ent : constant Source_Ptr := Sloc (U_Ent);
6071 Ent : Entity_Id := Empty;
6074 if Nkind (Nod) in N_Has_Etype
6075 and then Etype (Nod) = Any_Type
6081 when N_Empty | N_Error =>
6084 when N_Identifier | N_Expanded_Name =>
6085 Ent := Entity (Nod);
6087 -- We need to look at the original node if it is different
6088 -- from the node, since we may have rewritten things and
6089 -- substituted an identifier representing the rewrite.
6091 if Original_Node (Nod) /= Nod then
6092 Check_Expr_Constants (Original_Node (Nod));
6094 -- If the node is an object declaration without initial
6095 -- value, some code has been expanded, and the expression
6096 -- is not constant, even if the constituents might be
6097 -- acceptable, as in A'Address + offset.
6099 if Ekind (Ent) = E_Variable
6101 Nkind (Declaration_Node (Ent)) = N_Object_Declaration
6103 No (Expression (Declaration_Node (Ent)))
6106 ("invalid address clause for initialized object &!",
6109 -- If entity is constant, it may be the result of expanding
6110 -- a check. We must verify that its declaration appears
6111 -- before the object in question, else we also reject the
6114 elsif Ekind (Ent) = E_Constant
6115 and then In_Same_Source_Unit (Ent, U_Ent)
6116 and then Sloc (Ent) > Loc_U_Ent
6119 ("invalid address clause for initialized object &!",
6126 -- Otherwise look at the identifier and see if it is OK
6128 if Ekind_In (Ent, E_Named_Integer, E_Named_Real)
6129 or else Is_Type (Ent)
6134 Ekind (Ent) = E_Constant
6136 Ekind (Ent) = E_In_Parameter
6138 -- This is the case where we must have Ent defined before
6139 -- U_Ent. Clearly if they are in different units this
6140 -- requirement is met since the unit containing Ent is
6141 -- already processed.
6143 if not In_Same_Source_Unit (Ent, U_Ent) then
6146 -- Otherwise location of Ent must be before the location
6147 -- of U_Ent, that's what prior defined means.
6149 elsif Sloc (Ent) < Loc_U_Ent then
6154 ("invalid address clause for initialized object &!",
6156 Error_Msg_Node_2 := U_Ent;
6158 ("\& must be defined before & (RM 13.1(22))!",
6162 elsif Nkind (Original_Node (Nod)) = N_Function_Call then
6163 Check_Expr_Constants (Original_Node (Nod));
6167 ("invalid address clause for initialized object &!",
6170 if Comes_From_Source (Ent) then
6172 ("\reference to variable& not allowed"
6173 & " (RM 13.1(22))!", Nod, Ent);
6176 ("non-static expression not allowed"
6177 & " (RM 13.1(22))!", Nod);
6181 when N_Integer_Literal =>
6183 -- If this is a rewritten unchecked conversion, in a system
6184 -- where Address is an integer type, always use the base type
6185 -- for a literal value. This is user-friendly and prevents
6186 -- order-of-elaboration issues with instances of unchecked
6189 if Nkind (Original_Node (Nod)) = N_Function_Call then
6190 Set_Etype (Nod, Base_Type (Etype (Nod)));
6193 when N_Real_Literal |
6195 N_Character_Literal =>
6199 Check_Expr_Constants (Low_Bound (Nod));
6200 Check_Expr_Constants (High_Bound (Nod));
6202 when N_Explicit_Dereference =>
6203 Check_Expr_Constants (Prefix (Nod));
6205 when N_Indexed_Component =>
6206 Check_Expr_Constants (Prefix (Nod));
6207 Check_List_Constants (Expressions (Nod));
6210 Check_Expr_Constants (Prefix (Nod));
6211 Check_Expr_Constants (Discrete_Range (Nod));
6213 when N_Selected_Component =>
6214 Check_Expr_Constants (Prefix (Nod));
6216 when N_Attribute_Reference =>
6217 if Attribute_Name (Nod) = Name_Address
6219 Attribute_Name (Nod) = Name_Access
6221 Attribute_Name (Nod) = Name_Unchecked_Access
6223 Attribute_Name (Nod) = Name_Unrestricted_Access
6225 Check_At_Constant_Address (Prefix (Nod));
6228 Check_Expr_Constants (Prefix (Nod));
6229 Check_List_Constants (Expressions (Nod));
6233 Check_List_Constants (Component_Associations (Nod));
6234 Check_List_Constants (Expressions (Nod));
6236 when N_Component_Association =>
6237 Check_Expr_Constants (Expression (Nod));
6239 when N_Extension_Aggregate =>
6240 Check_Expr_Constants (Ancestor_Part (Nod));
6241 Check_List_Constants (Component_Associations (Nod));
6242 Check_List_Constants (Expressions (Nod));
6247 when N_Binary_Op | N_Short_Circuit | N_Membership_Test =>
6248 Check_Expr_Constants (Left_Opnd (Nod));
6249 Check_Expr_Constants (Right_Opnd (Nod));
6252 Check_Expr_Constants (Right_Opnd (Nod));
6254 when N_Type_Conversion |
6255 N_Qualified_Expression |
6257 Check_Expr_Constants (Expression (Nod));
6259 when N_Unchecked_Type_Conversion =>
6260 Check_Expr_Constants (Expression (Nod));
6262 -- If this is a rewritten unchecked conversion, subtypes in
6263 -- this node are those created within the instance. To avoid
6264 -- order of elaboration issues, replace them with their base
6265 -- types. Note that address clauses can cause order of
6266 -- elaboration problems because they are elaborated by the
6267 -- back-end at the point of definition, and may mention
6268 -- entities declared in between (as long as everything is
6269 -- static). It is user-friendly to allow unchecked conversions
6272 if Nkind (Original_Node (Nod)) = N_Function_Call then
6273 Set_Etype (Expression (Nod),
6274 Base_Type (Etype (Expression (Nod))));
6275 Set_Etype (Nod, Base_Type (Etype (Nod)));
6278 when N_Function_Call =>
6279 if not Is_Pure (Entity (Name (Nod))) then
6281 ("invalid address clause for initialized object &!",
6285 ("\function & is not pure (RM 13.1(22))!",
6286 Nod, Entity (Name (Nod)));
6289 Check_List_Constants (Parameter_Associations (Nod));
6292 when N_Parameter_Association =>
6293 Check_Expr_Constants (Explicit_Actual_Parameter (Nod));
6297 ("invalid address clause for initialized object &!",
6300 ("\must be constant defined before& (RM 13.1(22))!",
6303 end Check_Expr_Constants;
6305 --------------------------
6306 -- Check_List_Constants --
6307 --------------------------
6309 procedure Check_List_Constants (Lst : List_Id) is
6313 if Present (Lst) then
6314 Nod1 := First (Lst);
6315 while Present (Nod1) loop
6316 Check_Expr_Constants (Nod1);
6320 end Check_List_Constants;
6322 -- Start of processing for Check_Constant_Address_Clause
6325 -- If rep_clauses are to be ignored, no need for legality checks. In
6326 -- particular, no need to pester user about rep clauses that violate
6327 -- the rule on constant addresses, given that these clauses will be
6328 -- removed by Freeze before they reach the back end.
6330 if not Ignore_Rep_Clauses then
6331 Check_Expr_Constants (Expr);
6333 end Check_Constant_Address_Clause;
6335 ----------------------------------------
6336 -- Check_Record_Representation_Clause --
6337 ----------------------------------------
6339 procedure Check_Record_Representation_Clause (N : Node_Id) is
6340 Loc : constant Source_Ptr := Sloc (N);
6341 Ident : constant Node_Id := Identifier (N);
6342 Rectype : Entity_Id;
6347 Hbit : Uint := Uint_0;
6351 Max_Bit_So_Far : Uint;
6352 -- Records the maximum bit position so far. If all field positions
6353 -- are monotonically increasing, then we can skip the circuit for
6354 -- checking for overlap, since no overlap is possible.
6356 Tagged_Parent : Entity_Id := Empty;
6357 -- This is set in the case of a derived tagged type for which we have
6358 -- Is_Fully_Repped_Tagged_Type True (indicating that all components are
6359 -- positioned by record representation clauses). In this case we must
6360 -- check for overlap between components of this tagged type, and the
6361 -- components of its parent. Tagged_Parent will point to this parent
6362 -- type. For all other cases Tagged_Parent is left set to Empty.
6364 Parent_Last_Bit : Uint;
6365 -- Relevant only if Tagged_Parent is set, Parent_Last_Bit indicates the
6366 -- last bit position for any field in the parent type. We only need to
6367 -- check overlap for fields starting below this point.
6369 Overlap_Check_Required : Boolean;
6370 -- Used to keep track of whether or not an overlap check is required
6372 Overlap_Detected : Boolean := False;
6373 -- Set True if an overlap is detected
6375 Ccount : Natural := 0;
6376 -- Number of component clauses in record rep clause
6378 procedure Check_Component_Overlap (C1_Ent, C2_Ent : Entity_Id);
6379 -- Given two entities for record components or discriminants, checks
6380 -- if they have overlapping component clauses and issues errors if so.
6382 procedure Find_Component;
6383 -- Finds component entity corresponding to current component clause (in
6384 -- CC), and sets Comp to the entity, and Fbit/Lbit to the zero origin
6385 -- start/stop bits for the field. If there is no matching component or
6386 -- if the matching component does not have a component clause, then
6387 -- that's an error and Comp is set to Empty, but no error message is
6388 -- issued, since the message was already given. Comp is also set to
6389 -- Empty if the current "component clause" is in fact a pragma.
6391 -----------------------------
6392 -- Check_Component_Overlap --
6393 -----------------------------
6395 procedure Check_Component_Overlap (C1_Ent, C2_Ent : Entity_Id) is
6396 CC1 : constant Node_Id := Component_Clause (C1_Ent);
6397 CC2 : constant Node_Id := Component_Clause (C2_Ent);
6400 if Present (CC1) and then Present (CC2) then
6402 -- Exclude odd case where we have two tag fields in the same
6403 -- record, both at location zero. This seems a bit strange, but
6404 -- it seems to happen in some circumstances, perhaps on an error.
6406 if Chars (C1_Ent) = Name_uTag
6408 Chars (C2_Ent) = Name_uTag
6413 -- Here we check if the two fields overlap
6416 S1 : constant Uint := Component_Bit_Offset (C1_Ent);
6417 S2 : constant Uint := Component_Bit_Offset (C2_Ent);
6418 E1 : constant Uint := S1 + Esize (C1_Ent);
6419 E2 : constant Uint := S2 + Esize (C2_Ent);
6422 if E2 <= S1 or else E1 <= S2 then
6425 Error_Msg_Node_2 := Component_Name (CC2);
6426 Error_Msg_Sloc := Sloc (Error_Msg_Node_2);
6427 Error_Msg_Node_1 := Component_Name (CC1);
6429 ("component& overlaps & #", Component_Name (CC1));
6430 Overlap_Detected := True;
6434 end Check_Component_Overlap;
6436 --------------------
6437 -- Find_Component --
6438 --------------------
6440 procedure Find_Component is
6442 procedure Search_Component (R : Entity_Id);
6443 -- Search components of R for a match. If found, Comp is set.
6445 ----------------------
6446 -- Search_Component --
6447 ----------------------
6449 procedure Search_Component (R : Entity_Id) is
6451 Comp := First_Component_Or_Discriminant (R);
6452 while Present (Comp) loop
6454 -- Ignore error of attribute name for component name (we
6455 -- already gave an error message for this, so no need to
6458 if Nkind (Component_Name (CC)) = N_Attribute_Reference then
6461 exit when Chars (Comp) = Chars (Component_Name (CC));
6464 Next_Component_Or_Discriminant (Comp);
6466 end Search_Component;
6468 -- Start of processing for Find_Component
6471 -- Return with Comp set to Empty if we have a pragma
6473 if Nkind (CC) = N_Pragma then
6478 -- Search current record for matching component
6480 Search_Component (Rectype);
6482 -- If not found, maybe component of base type that is absent from
6483 -- statically constrained first subtype.
6486 Search_Component (Base_Type (Rectype));
6489 -- If no component, or the component does not reference the component
6490 -- clause in question, then there was some previous error for which
6491 -- we already gave a message, so just return with Comp Empty.
6494 or else Component_Clause (Comp) /= CC
6498 -- Normal case where we have a component clause
6501 Fbit := Component_Bit_Offset (Comp);
6502 Lbit := Fbit + Esize (Comp) - 1;
6506 -- Start of processing for Check_Record_Representation_Clause
6510 Rectype := Entity (Ident);
6512 if Rectype = Any_Type then
6515 Rectype := Underlying_Type (Rectype);
6518 -- See if we have a fully repped derived tagged type
6521 PS : constant Entity_Id := Parent_Subtype (Rectype);
6524 if Present (PS) and then Is_Fully_Repped_Tagged_Type (PS) then
6525 Tagged_Parent := PS;
6527 -- Find maximum bit of any component of the parent type
6529 Parent_Last_Bit := UI_From_Int (System_Address_Size - 1);
6530 Pcomp := First_Entity (Tagged_Parent);
6531 while Present (Pcomp) loop
6532 if Ekind_In (Pcomp, E_Discriminant, E_Component) then
6533 if Component_Bit_Offset (Pcomp) /= No_Uint
6534 and then Known_Static_Esize (Pcomp)
6539 Component_Bit_Offset (Pcomp) + Esize (Pcomp) - 1);
6542 Next_Entity (Pcomp);
6548 -- All done if no component clauses
6550 CC := First (Component_Clauses (N));
6556 -- If a tag is present, then create a component clause that places it
6557 -- at the start of the record (otherwise gigi may place it after other
6558 -- fields that have rep clauses).
6560 Fent := First_Entity (Rectype);
6562 if Nkind (Fent) = N_Defining_Identifier
6563 and then Chars (Fent) = Name_uTag
6565 Set_Component_Bit_Offset (Fent, Uint_0);
6566 Set_Normalized_Position (Fent, Uint_0);
6567 Set_Normalized_First_Bit (Fent, Uint_0);
6568 Set_Normalized_Position_Max (Fent, Uint_0);
6569 Init_Esize (Fent, System_Address_Size);
6571 Set_Component_Clause (Fent,
6572 Make_Component_Clause (Loc,
6573 Component_Name => Make_Identifier (Loc, Name_uTag),
6575 Position => Make_Integer_Literal (Loc, Uint_0),
6576 First_Bit => Make_Integer_Literal (Loc, Uint_0),
6578 Make_Integer_Literal (Loc,
6579 UI_From_Int (System_Address_Size))));
6581 Ccount := Ccount + 1;
6584 Max_Bit_So_Far := Uint_Minus_1;
6585 Overlap_Check_Required := False;
6587 -- Process the component clauses
6589 while Present (CC) loop
6592 if Present (Comp) then
6593 Ccount := Ccount + 1;
6595 -- We need a full overlap check if record positions non-monotonic
6597 if Fbit <= Max_Bit_So_Far then
6598 Overlap_Check_Required := True;
6601 Max_Bit_So_Far := Lbit;
6603 -- Check bit position out of range of specified size
6605 if Has_Size_Clause (Rectype)
6606 and then RM_Size (Rectype) <= Lbit
6609 ("bit number out of range of specified size",
6612 -- Check for overlap with tag field
6615 if Is_Tagged_Type (Rectype)
6616 and then Fbit < System_Address_Size
6619 ("component overlaps tag field of&",
6620 Component_Name (CC), Rectype);
6621 Overlap_Detected := True;
6629 -- Check parent overlap if component might overlap parent field
6631 if Present (Tagged_Parent)
6632 and then Fbit <= Parent_Last_Bit
6634 Pcomp := First_Component_Or_Discriminant (Tagged_Parent);
6635 while Present (Pcomp) loop
6636 if not Is_Tag (Pcomp)
6637 and then Chars (Pcomp) /= Name_uParent
6639 Check_Component_Overlap (Comp, Pcomp);
6642 Next_Component_Or_Discriminant (Pcomp);
6650 -- Now that we have processed all the component clauses, check for
6651 -- overlap. We have to leave this till last, since the components can
6652 -- appear in any arbitrary order in the representation clause.
6654 -- We do not need this check if all specified ranges were monotonic,
6655 -- as recorded by Overlap_Check_Required being False at this stage.
6657 -- This first section checks if there are any overlapping entries at
6658 -- all. It does this by sorting all entries and then seeing if there are
6659 -- any overlaps. If there are none, then that is decisive, but if there
6660 -- are overlaps, they may still be OK (they may result from fields in
6661 -- different variants).
6663 if Overlap_Check_Required then
6664 Overlap_Check1 : declare
6666 OC_Fbit : array (0 .. Ccount) of Uint;
6667 -- First-bit values for component clauses, the value is the offset
6668 -- of the first bit of the field from start of record. The zero
6669 -- entry is for use in sorting.
6671 OC_Lbit : array (0 .. Ccount) of Uint;
6672 -- Last-bit values for component clauses, the value is the offset
6673 -- of the last bit of the field from start of record. The zero
6674 -- entry is for use in sorting.
6676 OC_Count : Natural := 0;
6677 -- Count of entries in OC_Fbit and OC_Lbit
6679 function OC_Lt (Op1, Op2 : Natural) return Boolean;
6680 -- Compare routine for Sort
6682 procedure OC_Move (From : Natural; To : Natural);
6683 -- Move routine for Sort
6685 package Sorting is new GNAT.Heap_Sort_G (OC_Move, OC_Lt);
6691 function OC_Lt (Op1, Op2 : Natural) return Boolean is
6693 return OC_Fbit (Op1) < OC_Fbit (Op2);
6700 procedure OC_Move (From : Natural; To : Natural) is
6702 OC_Fbit (To) := OC_Fbit (From);
6703 OC_Lbit (To) := OC_Lbit (From);
6706 -- Start of processing for Overlap_Check
6709 CC := First (Component_Clauses (N));
6710 while Present (CC) loop
6712 -- Exclude component clause already marked in error
6714 if not Error_Posted (CC) then
6717 if Present (Comp) then
6718 OC_Count := OC_Count + 1;
6719 OC_Fbit (OC_Count) := Fbit;
6720 OC_Lbit (OC_Count) := Lbit;
6727 Sorting.Sort (OC_Count);
6729 Overlap_Check_Required := False;
6730 for J in 1 .. OC_Count - 1 loop
6731 if OC_Lbit (J) >= OC_Fbit (J + 1) then
6732 Overlap_Check_Required := True;
6739 -- If Overlap_Check_Required is still True, then we have to do the full
6740 -- scale overlap check, since we have at least two fields that do
6741 -- overlap, and we need to know if that is OK since they are in
6742 -- different variant, or whether we have a definite problem.
6744 if Overlap_Check_Required then
6745 Overlap_Check2 : declare
6746 C1_Ent, C2_Ent : Entity_Id;
6747 -- Entities of components being checked for overlap
6750 -- Component_List node whose Component_Items are being checked
6753 -- Component declaration for component being checked
6756 C1_Ent := First_Entity (Base_Type (Rectype));
6758 -- Loop through all components in record. For each component check
6759 -- for overlap with any of the preceding elements on the component
6760 -- list containing the component and also, if the component is in
6761 -- a variant, check against components outside the case structure.
6762 -- This latter test is repeated recursively up the variant tree.
6764 Main_Component_Loop : while Present (C1_Ent) loop
6765 if not Ekind_In (C1_Ent, E_Component, E_Discriminant) then
6766 goto Continue_Main_Component_Loop;
6769 -- Skip overlap check if entity has no declaration node. This
6770 -- happens with discriminants in constrained derived types.
6771 -- Possibly we are missing some checks as a result, but that
6772 -- does not seem terribly serious.
6774 if No (Declaration_Node (C1_Ent)) then
6775 goto Continue_Main_Component_Loop;
6778 Clist := Parent (List_Containing (Declaration_Node (C1_Ent)));
6780 -- Loop through component lists that need checking. Check the
6781 -- current component list and all lists in variants above us.
6783 Component_List_Loop : loop
6785 -- If derived type definition, go to full declaration
6786 -- If at outer level, check discriminants if there are any.
6788 if Nkind (Clist) = N_Derived_Type_Definition then
6789 Clist := Parent (Clist);
6792 -- Outer level of record definition, check discriminants
6794 if Nkind_In (Clist, N_Full_Type_Declaration,
6795 N_Private_Type_Declaration)
6797 if Has_Discriminants (Defining_Identifier (Clist)) then
6799 First_Discriminant (Defining_Identifier (Clist));
6800 while Present (C2_Ent) loop
6801 exit when C1_Ent = C2_Ent;
6802 Check_Component_Overlap (C1_Ent, C2_Ent);
6803 Next_Discriminant (C2_Ent);
6807 -- Record extension case
6809 elsif Nkind (Clist) = N_Derived_Type_Definition then
6812 -- Otherwise check one component list
6815 Citem := First (Component_Items (Clist));
6816 while Present (Citem) loop
6817 if Nkind (Citem) = N_Component_Declaration then
6818 C2_Ent := Defining_Identifier (Citem);
6819 exit when C1_Ent = C2_Ent;
6820 Check_Component_Overlap (C1_Ent, C2_Ent);
6827 -- Check for variants above us (the parent of the Clist can
6828 -- be a variant, in which case its parent is a variant part,
6829 -- and the parent of the variant part is a component list
6830 -- whose components must all be checked against the current
6831 -- component for overlap).
6833 if Nkind (Parent (Clist)) = N_Variant then
6834 Clist := Parent (Parent (Parent (Clist)));
6836 -- Check for possible discriminant part in record, this
6837 -- is treated essentially as another level in the
6838 -- recursion. For this case the parent of the component
6839 -- list is the record definition, and its parent is the
6840 -- full type declaration containing the discriminant
6843 elsif Nkind (Parent (Clist)) = N_Record_Definition then
6844 Clist := Parent (Parent ((Clist)));
6846 -- If neither of these two cases, we are at the top of
6850 exit Component_List_Loop;
6852 end loop Component_List_Loop;
6854 <<Continue_Main_Component_Loop>>
6855 Next_Entity (C1_Ent);
6857 end loop Main_Component_Loop;
6861 -- The following circuit deals with warning on record holes (gaps). We
6862 -- skip this check if overlap was detected, since it makes sense for the
6863 -- programmer to fix this illegality before worrying about warnings.
6865 if not Overlap_Detected and Warn_On_Record_Holes then
6866 Record_Hole_Check : declare
6867 Decl : constant Node_Id := Declaration_Node (Base_Type (Rectype));
6868 -- Full declaration of record type
6870 procedure Check_Component_List
6874 -- Check component list CL for holes. The starting bit should be
6875 -- Sbit. which is zero for the main record component list and set
6876 -- appropriately for recursive calls for variants. DS is set to
6877 -- a list of discriminant specifications to be included in the
6878 -- consideration of components. It is No_List if none to consider.
6880 --------------------------
6881 -- Check_Component_List --
6882 --------------------------
6884 procedure Check_Component_List
6892 Compl := Integer (List_Length (Component_Items (CL)));
6894 if DS /= No_List then
6895 Compl := Compl + Integer (List_Length (DS));
6899 Comps : array (Natural range 0 .. Compl) of Entity_Id;
6900 -- Gather components (zero entry is for sort routine)
6902 Ncomps : Natural := 0;
6903 -- Number of entries stored in Comps (starting at Comps (1))
6906 -- One component item or discriminant specification
6909 -- Starting bit for next component
6917 function Lt (Op1, Op2 : Natural) return Boolean;
6918 -- Compare routine for Sort
6920 procedure Move (From : Natural; To : Natural);
6921 -- Move routine for Sort
6923 package Sorting is new GNAT.Heap_Sort_G (Move, Lt);
6929 function Lt (Op1, Op2 : Natural) return Boolean is
6931 return Component_Bit_Offset (Comps (Op1))
6933 Component_Bit_Offset (Comps (Op2));
6940 procedure Move (From : Natural; To : Natural) is
6942 Comps (To) := Comps (From);
6946 -- Gather discriminants into Comp
6948 if DS /= No_List then
6949 Citem := First (DS);
6950 while Present (Citem) loop
6951 if Nkind (Citem) = N_Discriminant_Specification then
6953 Ent : constant Entity_Id :=
6954 Defining_Identifier (Citem);
6956 if Ekind (Ent) = E_Discriminant then
6957 Ncomps := Ncomps + 1;
6958 Comps (Ncomps) := Ent;
6967 -- Gather component entities into Comp
6969 Citem := First (Component_Items (CL));
6970 while Present (Citem) loop
6971 if Nkind (Citem) = N_Component_Declaration then
6972 Ncomps := Ncomps + 1;
6973 Comps (Ncomps) := Defining_Identifier (Citem);
6979 -- Now sort the component entities based on the first bit.
6980 -- Note we already know there are no overlapping components.
6982 Sorting.Sort (Ncomps);
6984 -- Loop through entries checking for holes
6987 for J in 1 .. Ncomps loop
6989 Error_Msg_Uint_1 := Component_Bit_Offset (CEnt) - Nbit;
6991 if Error_Msg_Uint_1 > 0 then
6993 ("?^-bit gap before component&",
6994 Component_Name (Component_Clause (CEnt)), CEnt);
6997 Nbit := Component_Bit_Offset (CEnt) + Esize (CEnt);
7000 -- Process variant parts recursively if present
7002 if Present (Variant_Part (CL)) then
7003 Variant := First (Variants (Variant_Part (CL)));
7004 while Present (Variant) loop
7005 Check_Component_List
7006 (Component_List (Variant), Nbit, No_List);
7011 end Check_Component_List;
7013 -- Start of processing for Record_Hole_Check
7020 if Is_Tagged_Type (Rectype) then
7021 Sbit := UI_From_Int (System_Address_Size);
7026 if Nkind (Decl) = N_Full_Type_Declaration
7027 and then Nkind (Type_Definition (Decl)) = N_Record_Definition
7029 Check_Component_List
7030 (Component_List (Type_Definition (Decl)),
7032 Discriminant_Specifications (Decl));
7035 end Record_Hole_Check;
7038 -- For records that have component clauses for all components, and whose
7039 -- size is less than or equal to 32, we need to know the size in the
7040 -- front end to activate possible packed array processing where the
7041 -- component type is a record.
7043 -- At this stage Hbit + 1 represents the first unused bit from all the
7044 -- component clauses processed, so if the component clauses are
7045 -- complete, then this is the length of the record.
7047 -- For records longer than System.Storage_Unit, and for those where not
7048 -- all components have component clauses, the back end determines the
7049 -- length (it may for example be appropriate to round up the size
7050 -- to some convenient boundary, based on alignment considerations, etc).
7052 if Unknown_RM_Size (Rectype) and then Hbit + 1 <= 32 then
7054 -- Nothing to do if at least one component has no component clause
7056 Comp := First_Component_Or_Discriminant (Rectype);
7057 while Present (Comp) loop
7058 exit when No (Component_Clause (Comp));
7059 Next_Component_Or_Discriminant (Comp);
7062 -- If we fall out of loop, all components have component clauses
7063 -- and so we can set the size to the maximum value.
7066 Set_RM_Size (Rectype, Hbit + 1);
7069 end Check_Record_Representation_Clause;
7075 procedure Check_Size
7079 Biased : out Boolean)
7081 UT : constant Entity_Id := Underlying_Type (T);
7087 -- Dismiss cases for generic types or types with previous errors
7090 or else UT = Any_Type
7091 or else Is_Generic_Type (UT)
7092 or else Is_Generic_Type (Root_Type (UT))
7096 -- Check case of bit packed array
7098 elsif Is_Array_Type (UT)
7099 and then Known_Static_Component_Size (UT)
7100 and then Is_Bit_Packed_Array (UT)
7108 Asiz := Component_Size (UT);
7109 Indx := First_Index (UT);
7111 Ityp := Etype (Indx);
7113 -- If non-static bound, then we are not in the business of
7114 -- trying to check the length, and indeed an error will be
7115 -- issued elsewhere, since sizes of non-static array types
7116 -- cannot be set implicitly or explicitly.
7118 if not Is_Static_Subtype (Ityp) then
7122 -- Otherwise accumulate next dimension
7124 Asiz := Asiz * (Expr_Value (Type_High_Bound (Ityp)) -
7125 Expr_Value (Type_Low_Bound (Ityp)) +
7129 exit when No (Indx);
7135 Error_Msg_Uint_1 := Asiz;
7137 ("size for& too small, minimum allowed is ^", N, T);
7138 Set_Esize (T, Asiz);
7139 Set_RM_Size (T, Asiz);
7143 -- All other composite types are ignored
7145 elsif Is_Composite_Type (UT) then
7148 -- For fixed-point types, don't check minimum if type is not frozen,
7149 -- since we don't know all the characteristics of the type that can
7150 -- affect the size (e.g. a specified small) till freeze time.
7152 elsif Is_Fixed_Point_Type (UT)
7153 and then not Is_Frozen (UT)
7157 -- Cases for which a minimum check is required
7160 -- Ignore if specified size is correct for the type
7162 if Known_Esize (UT) and then Siz = Esize (UT) then
7166 -- Otherwise get minimum size
7168 M := UI_From_Int (Minimum_Size (UT));
7172 -- Size is less than minimum size, but one possibility remains
7173 -- that we can manage with the new size if we bias the type.
7175 M := UI_From_Int (Minimum_Size (UT, Biased => True));
7178 Error_Msg_Uint_1 := M;
7180 ("size for& too small, minimum allowed is ^", N, T);
7190 -------------------------
7191 -- Get_Alignment_Value --
7192 -------------------------
7194 function Get_Alignment_Value (Expr : Node_Id) return Uint is
7195 Align : constant Uint := Static_Integer (Expr);
7198 if Align = No_Uint then
7201 elsif Align <= 0 then
7202 Error_Msg_N ("alignment value must be positive", Expr);
7206 for J in Int range 0 .. 64 loop
7208 M : constant Uint := Uint_2 ** J;
7211 exit when M = Align;
7215 ("alignment value must be power of 2", Expr);
7223 end Get_Alignment_Value;
7229 procedure Initialize is
7231 Address_Clause_Checks.Init;
7232 Independence_Checks.Init;
7233 Unchecked_Conversions.Init;
7236 -------------------------
7237 -- Is_Operational_Item --
7238 -------------------------
7240 function Is_Operational_Item (N : Node_Id) return Boolean is
7242 if Nkind (N) /= N_Attribute_Definition_Clause then
7246 Id : constant Attribute_Id := Get_Attribute_Id (Chars (N));
7248 return Id = Attribute_Input
7249 or else Id = Attribute_Output
7250 or else Id = Attribute_Read
7251 or else Id = Attribute_Write
7252 or else Id = Attribute_External_Tag;
7255 end Is_Operational_Item;
7261 function Minimum_Size
7263 Biased : Boolean := False) return Nat
7265 Lo : Uint := No_Uint;
7266 Hi : Uint := No_Uint;
7267 LoR : Ureal := No_Ureal;
7268 HiR : Ureal := No_Ureal;
7269 LoSet : Boolean := False;
7270 HiSet : Boolean := False;
7274 R_Typ : constant Entity_Id := Root_Type (T);
7277 -- If bad type, return 0
7279 if T = Any_Type then
7282 -- For generic types, just return zero. There cannot be any legitimate
7283 -- need to know such a size, but this routine may be called with a
7284 -- generic type as part of normal processing.
7286 elsif Is_Generic_Type (R_Typ)
7287 or else R_Typ = Any_Type
7291 -- Access types. Normally an access type cannot have a size smaller
7292 -- than the size of System.Address. The exception is on VMS, where
7293 -- we have short and long addresses, and it is possible for an access
7294 -- type to have a short address size (and thus be less than the size
7295 -- of System.Address itself). We simply skip the check for VMS, and
7296 -- leave it to the back end to do the check.
7298 elsif Is_Access_Type (T) then
7299 if OpenVMS_On_Target then
7302 return System_Address_Size;
7305 -- Floating-point types
7307 elsif Is_Floating_Point_Type (T) then
7308 return UI_To_Int (Esize (R_Typ));
7312 elsif Is_Discrete_Type (T) then
7314 -- The following loop is looking for the nearest compile time known
7315 -- bounds following the ancestor subtype chain. The idea is to find
7316 -- the most restrictive known bounds information.
7320 if Ancest = Any_Type or else Etype (Ancest) = Any_Type then
7325 if Compile_Time_Known_Value (Type_Low_Bound (Ancest)) then
7326 Lo := Expr_Rep_Value (Type_Low_Bound (Ancest));
7333 if Compile_Time_Known_Value (Type_High_Bound (Ancest)) then
7334 Hi := Expr_Rep_Value (Type_High_Bound (Ancest));
7340 Ancest := Ancestor_Subtype (Ancest);
7343 Ancest := Base_Type (T);
7345 if Is_Generic_Type (Ancest) then
7351 -- Fixed-point types. We can't simply use Expr_Value to get the
7352 -- Corresponding_Integer_Value values of the bounds, since these do not
7353 -- get set till the type is frozen, and this routine can be called
7354 -- before the type is frozen. Similarly the test for bounds being static
7355 -- needs to include the case where we have unanalyzed real literals for
7358 elsif Is_Fixed_Point_Type (T) then
7360 -- The following loop is looking for the nearest compile time known
7361 -- bounds following the ancestor subtype chain. The idea is to find
7362 -- the most restrictive known bounds information.
7366 if Ancest = Any_Type or else Etype (Ancest) = Any_Type then
7370 -- Note: In the following two tests for LoSet and HiSet, it may
7371 -- seem redundant to test for N_Real_Literal here since normally
7372 -- one would assume that the test for the value being known at
7373 -- compile time includes this case. However, there is a glitch.
7374 -- If the real literal comes from folding a non-static expression,
7375 -- then we don't consider any non- static expression to be known
7376 -- at compile time if we are in configurable run time mode (needed
7377 -- in some cases to give a clearer definition of what is and what
7378 -- is not accepted). So the test is indeed needed. Without it, we
7379 -- would set neither Lo_Set nor Hi_Set and get an infinite loop.
7382 if Nkind (Type_Low_Bound (Ancest)) = N_Real_Literal
7383 or else Compile_Time_Known_Value (Type_Low_Bound (Ancest))
7385 LoR := Expr_Value_R (Type_Low_Bound (Ancest));
7392 if Nkind (Type_High_Bound (Ancest)) = N_Real_Literal
7393 or else Compile_Time_Known_Value (Type_High_Bound (Ancest))
7395 HiR := Expr_Value_R (Type_High_Bound (Ancest));
7401 Ancest := Ancestor_Subtype (Ancest);
7404 Ancest := Base_Type (T);
7406 if Is_Generic_Type (Ancest) then
7412 Lo := UR_To_Uint (LoR / Small_Value (T));
7413 Hi := UR_To_Uint (HiR / Small_Value (T));
7415 -- No other types allowed
7418 raise Program_Error;
7421 -- Fall through with Hi and Lo set. Deal with biased case
7424 and then not Is_Fixed_Point_Type (T)
7425 and then not (Is_Enumeration_Type (T)
7426 and then Has_Non_Standard_Rep (T)))
7427 or else Has_Biased_Representation (T)
7433 -- Signed case. Note that we consider types like range 1 .. -1 to be
7434 -- signed for the purpose of computing the size, since the bounds have
7435 -- to be accommodated in the base type.
7437 if Lo < 0 or else Hi < 0 then
7441 -- S = size, B = 2 ** (size - 1) (can accommodate -B .. +(B - 1))
7442 -- Note that we accommodate the case where the bounds cross. This
7443 -- can happen either because of the way the bounds are declared
7444 -- or because of the algorithm in Freeze_Fixed_Point_Type.
7458 -- If both bounds are positive, make sure that both are represen-
7459 -- table in the case where the bounds are crossed. This can happen
7460 -- either because of the way the bounds are declared, or because of
7461 -- the algorithm in Freeze_Fixed_Point_Type.
7467 -- S = size, (can accommodate 0 .. (2**size - 1))
7470 while Hi >= Uint_2 ** S loop
7478 ---------------------------
7479 -- New_Stream_Subprogram --
7480 ---------------------------
7482 procedure New_Stream_Subprogram
7486 Nam : TSS_Name_Type)
7488 Loc : constant Source_Ptr := Sloc (N);
7489 Sname : constant Name_Id := Make_TSS_Name (Base_Type (Ent), Nam);
7490 Subp_Id : Entity_Id;
7491 Subp_Decl : Node_Id;
7495 Defer_Declaration : constant Boolean :=
7496 Is_Tagged_Type (Ent) or else Is_Private_Type (Ent);
7497 -- For a tagged type, there is a declaration for each stream attribute
7498 -- at the freeze point, and we must generate only a completion of this
7499 -- declaration. We do the same for private types, because the full view
7500 -- might be tagged. Otherwise we generate a declaration at the point of
7501 -- the attribute definition clause.
7503 function Build_Spec return Node_Id;
7504 -- Used for declaration and renaming declaration, so that this is
7505 -- treated as a renaming_as_body.
7511 function Build_Spec return Node_Id is
7512 Out_P : constant Boolean := (Nam = TSS_Stream_Read);
7515 T_Ref : constant Node_Id := New_Reference_To (Etyp, Loc);
7518 Subp_Id := Make_Defining_Identifier (Loc, Sname);
7520 -- S : access Root_Stream_Type'Class
7522 Formals := New_List (
7523 Make_Parameter_Specification (Loc,
7524 Defining_Identifier =>
7525 Make_Defining_Identifier (Loc, Name_S),
7527 Make_Access_Definition (Loc,
7530 Designated_Type (Etype (F)), Loc))));
7532 if Nam = TSS_Stream_Input then
7533 Spec := Make_Function_Specification (Loc,
7534 Defining_Unit_Name => Subp_Id,
7535 Parameter_Specifications => Formals,
7536 Result_Definition => T_Ref);
7541 Make_Parameter_Specification (Loc,
7542 Defining_Identifier => Make_Defining_Identifier (Loc, Name_V),
7543 Out_Present => Out_P,
7544 Parameter_Type => T_Ref));
7547 Make_Procedure_Specification (Loc,
7548 Defining_Unit_Name => Subp_Id,
7549 Parameter_Specifications => Formals);
7555 -- Start of processing for New_Stream_Subprogram
7558 F := First_Formal (Subp);
7560 if Ekind (Subp) = E_Procedure then
7561 Etyp := Etype (Next_Formal (F));
7563 Etyp := Etype (Subp);
7566 -- Prepare subprogram declaration and insert it as an action on the
7567 -- clause node. The visibility for this entity is used to test for
7568 -- visibility of the attribute definition clause (in the sense of
7569 -- 8.3(23) as amended by AI-195).
7571 if not Defer_Declaration then
7573 Make_Subprogram_Declaration (Loc,
7574 Specification => Build_Spec);
7576 -- For a tagged type, there is always a visible declaration for each
7577 -- stream TSS (it is a predefined primitive operation), and the
7578 -- completion of this declaration occurs at the freeze point, which is
7579 -- not always visible at places where the attribute definition clause is
7580 -- visible. So, we create a dummy entity here for the purpose of
7581 -- tracking the visibility of the attribute definition clause itself.
7585 Make_Defining_Identifier (Loc, New_External_Name (Sname, 'V'));
7587 Make_Object_Declaration (Loc,
7588 Defining_Identifier => Subp_Id,
7589 Object_Definition => New_Occurrence_Of (Standard_Boolean, Loc));
7592 Insert_Action (N, Subp_Decl);
7593 Set_Entity (N, Subp_Id);
7596 Make_Subprogram_Renaming_Declaration (Loc,
7597 Specification => Build_Spec,
7598 Name => New_Reference_To (Subp, Loc));
7600 if Defer_Declaration then
7601 Set_TSS (Base_Type (Ent), Subp_Id);
7603 Insert_Action (N, Subp_Decl);
7604 Copy_TSS (Subp_Id, Base_Type (Ent));
7606 end New_Stream_Subprogram;
7608 ------------------------
7609 -- Rep_Item_Too_Early --
7610 ------------------------
7612 function Rep_Item_Too_Early (T : Entity_Id; N : Node_Id) return Boolean is
7614 -- Cannot apply non-operational rep items to generic types
7616 if Is_Operational_Item (N) then
7620 and then Is_Generic_Type (Root_Type (T))
7622 Error_Msg_N ("representation item not allowed for generic type", N);
7626 -- Otherwise check for incomplete type
7628 if Is_Incomplete_Or_Private_Type (T)
7629 and then No (Underlying_Type (T))
7631 (Nkind (N) /= N_Pragma
7632 or else Get_Pragma_Id (N) /= Pragma_Import)
7635 ("representation item must be after full type declaration", N);
7638 -- If the type has incomplete components, a representation clause is
7639 -- illegal but stream attributes and Convention pragmas are correct.
7641 elsif Has_Private_Component (T) then
7642 if Nkind (N) = N_Pragma then
7646 ("representation item must appear after type is fully defined",
7653 end Rep_Item_Too_Early;
7655 -----------------------
7656 -- Rep_Item_Too_Late --
7657 -----------------------
7659 function Rep_Item_Too_Late
7662 FOnly : Boolean := False) return Boolean
7665 Parent_Type : Entity_Id;
7668 -- Output the too late message. Note that this is not considered a
7669 -- serious error, since the effect is simply that we ignore the
7670 -- representation clause in this case.
7676 procedure Too_Late is
7678 Error_Msg_N ("|representation item appears too late!", N);
7681 -- Start of processing for Rep_Item_Too_Late
7684 -- First make sure entity is not frozen (RM 13.1(9)). Exclude imported
7685 -- types, which may be frozen if they appear in a representation clause
7686 -- for a local type.
7689 and then not From_With_Type (T)
7692 S := First_Subtype (T);
7694 if Present (Freeze_Node (S)) then
7696 ("?no more representation items for }", Freeze_Node (S), S);
7701 -- Check for case of non-tagged derived type whose parent either has
7702 -- primitive operations, or is a by reference type (RM 13.1(10)).
7706 and then Is_Derived_Type (T)
7707 and then not Is_Tagged_Type (T)
7709 Parent_Type := Etype (Base_Type (T));
7711 if Has_Primitive_Operations (Parent_Type) then
7714 ("primitive operations already defined for&!", N, Parent_Type);
7717 elsif Is_By_Reference_Type (Parent_Type) then
7720 ("parent type & is a by reference type!", N, Parent_Type);
7725 -- No error, link item into head of chain of rep items for the entity,
7726 -- but avoid chaining if we have an overloadable entity, and the pragma
7727 -- is one that can apply to multiple overloaded entities.
7729 if Is_Overloadable (T)
7730 and then Nkind (N) = N_Pragma
7733 Pname : constant Name_Id := Pragma_Name (N);
7735 if Pname = Name_Convention or else
7736 Pname = Name_Import or else
7737 Pname = Name_Export or else
7738 Pname = Name_External or else
7739 Pname = Name_Interface
7746 Record_Rep_Item (T, N);
7748 end Rep_Item_Too_Late;
7750 -------------------------------------
7751 -- Replace_Type_References_Generic --
7752 -------------------------------------
7754 procedure Replace_Type_References_Generic (N : Node_Id; TName : Name_Id) is
7756 function Replace_Node (N : Node_Id) return Traverse_Result;
7757 -- Processes a single node in the traversal procedure below, checking
7758 -- if node N should be replaced, and if so, doing the replacement.
7760 procedure Replace_Type_Refs is new Traverse_Proc (Replace_Node);
7761 -- This instantiation provides the body of Replace_Type_References
7767 function Replace_Node (N : Node_Id) return Traverse_Result is
7772 -- Case of identifier
7774 if Nkind (N) = N_Identifier then
7776 -- If not the type name, all done with this node
7778 if Chars (N) /= TName then
7781 -- Otherwise do the replacement and we are done with this node
7784 Replace_Type_Reference (N);
7788 -- Case of selected component (which is what a qualification
7789 -- looks like in the unanalyzed tree, which is what we have.
7791 elsif Nkind (N) = N_Selected_Component then
7793 -- If selector name is not our type, keeping going (we might
7794 -- still have an occurrence of the type in the prefix).
7796 if Nkind (Selector_Name (N)) /= N_Identifier
7797 or else Chars (Selector_Name (N)) /= TName
7801 -- Selector name is our type, check qualification
7804 -- Loop through scopes and prefixes, doing comparison
7809 -- Continue if no more scopes or scope with no name
7811 if No (S) or else Nkind (S) not in N_Has_Chars then
7815 -- Do replace if prefix is an identifier matching the
7816 -- scope that we are currently looking at.
7818 if Nkind (P) = N_Identifier
7819 and then Chars (P) = Chars (S)
7821 Replace_Type_Reference (N);
7825 -- Go check scope above us if prefix is itself of the
7826 -- form of a selected component, whose selector matches
7827 -- the scope we are currently looking at.
7829 if Nkind (P) = N_Selected_Component
7830 and then Nkind (Selector_Name (P)) = N_Identifier
7831 and then Chars (Selector_Name (P)) = Chars (S)
7836 -- For anything else, we don't have a match, so keep on
7837 -- going, there are still some weird cases where we may
7838 -- still have a replacement within the prefix.
7846 -- Continue for any other node kind
7854 Replace_Type_Refs (N);
7855 end Replace_Type_References_Generic;
7857 -------------------------
7858 -- Same_Representation --
7859 -------------------------
7861 function Same_Representation (Typ1, Typ2 : Entity_Id) return Boolean is
7862 T1 : constant Entity_Id := Underlying_Type (Typ1);
7863 T2 : constant Entity_Id := Underlying_Type (Typ2);
7866 -- A quick check, if base types are the same, then we definitely have
7867 -- the same representation, because the subtype specific representation
7868 -- attributes (Size and Alignment) do not affect representation from
7869 -- the point of view of this test.
7871 if Base_Type (T1) = Base_Type (T2) then
7874 elsif Is_Private_Type (Base_Type (T2))
7875 and then Base_Type (T1) = Full_View (Base_Type (T2))
7880 -- Tagged types never have differing representations
7882 if Is_Tagged_Type (T1) then
7886 -- Representations are definitely different if conventions differ
7888 if Convention (T1) /= Convention (T2) then
7892 -- Representations are different if component alignments differ
7894 if (Is_Record_Type (T1) or else Is_Array_Type (T1))
7896 (Is_Record_Type (T2) or else Is_Array_Type (T2))
7897 and then Component_Alignment (T1) /= Component_Alignment (T2)
7902 -- For arrays, the only real issue is component size. If we know the
7903 -- component size for both arrays, and it is the same, then that's
7904 -- good enough to know we don't have a change of representation.
7906 if Is_Array_Type (T1) then
7907 if Known_Component_Size (T1)
7908 and then Known_Component_Size (T2)
7909 and then Component_Size (T1) = Component_Size (T2)
7911 if VM_Target = No_VM then
7914 -- In VM targets the representation of arrays with aliased
7915 -- components differs from arrays with non-aliased components
7918 return Has_Aliased_Components (Base_Type (T1))
7920 Has_Aliased_Components (Base_Type (T2));
7925 -- Types definitely have same representation if neither has non-standard
7926 -- representation since default representations are always consistent.
7927 -- If only one has non-standard representation, and the other does not,
7928 -- then we consider that they do not have the same representation. They
7929 -- might, but there is no way of telling early enough.
7931 if Has_Non_Standard_Rep (T1) then
7932 if not Has_Non_Standard_Rep (T2) then
7936 return not Has_Non_Standard_Rep (T2);
7939 -- Here the two types both have non-standard representation, and we need
7940 -- to determine if they have the same non-standard representation.
7942 -- For arrays, we simply need to test if the component sizes are the
7943 -- same. Pragma Pack is reflected in modified component sizes, so this
7944 -- check also deals with pragma Pack.
7946 if Is_Array_Type (T1) then
7947 return Component_Size (T1) = Component_Size (T2);
7949 -- Tagged types always have the same representation, because it is not
7950 -- possible to specify different representations for common fields.
7952 elsif Is_Tagged_Type (T1) then
7955 -- Case of record types
7957 elsif Is_Record_Type (T1) then
7959 -- Packed status must conform
7961 if Is_Packed (T1) /= Is_Packed (T2) then
7964 -- Otherwise we must check components. Typ2 maybe a constrained
7965 -- subtype with fewer components, so we compare the components
7966 -- of the base types.
7969 Record_Case : declare
7970 CD1, CD2 : Entity_Id;
7972 function Same_Rep return Boolean;
7973 -- CD1 and CD2 are either components or discriminants. This
7974 -- function tests whether the two have the same representation
7980 function Same_Rep return Boolean is
7982 if No (Component_Clause (CD1)) then
7983 return No (Component_Clause (CD2));
7987 Present (Component_Clause (CD2))
7989 Component_Bit_Offset (CD1) = Component_Bit_Offset (CD2)
7991 Esize (CD1) = Esize (CD2);
7995 -- Start of processing for Record_Case
7998 if Has_Discriminants (T1) then
7999 CD1 := First_Discriminant (T1);
8000 CD2 := First_Discriminant (T2);
8002 -- The number of discriminants may be different if the
8003 -- derived type has fewer (constrained by values). The
8004 -- invisible discriminants retain the representation of
8005 -- the original, so the discrepancy does not per se
8006 -- indicate a different representation.
8009 and then Present (CD2)
8011 if not Same_Rep then
8014 Next_Discriminant (CD1);
8015 Next_Discriminant (CD2);
8020 CD1 := First_Component (Underlying_Type (Base_Type (T1)));
8021 CD2 := First_Component (Underlying_Type (Base_Type (T2)));
8023 while Present (CD1) loop
8024 if not Same_Rep then
8027 Next_Component (CD1);
8028 Next_Component (CD2);
8036 -- For enumeration types, we must check each literal to see if the
8037 -- representation is the same. Note that we do not permit enumeration
8038 -- representation clauses for Character and Wide_Character, so these
8039 -- cases were already dealt with.
8041 elsif Is_Enumeration_Type (T1) then
8042 Enumeration_Case : declare
8046 L1 := First_Literal (T1);
8047 L2 := First_Literal (T2);
8049 while Present (L1) loop
8050 if Enumeration_Rep (L1) /= Enumeration_Rep (L2) then
8060 end Enumeration_Case;
8062 -- Any other types have the same representation for these purposes
8067 end Same_Representation;
8073 procedure Set_Biased
8077 Biased : Boolean := True)
8081 Set_Has_Biased_Representation (E);
8083 if Warn_On_Biased_Representation then
8085 ("?" & Msg & " forces biased representation for&", N, E);
8090 --------------------
8091 -- Set_Enum_Esize --
8092 --------------------
8094 procedure Set_Enum_Esize (T : Entity_Id) is
8102 -- Find the minimum standard size (8,16,32,64) that fits
8104 Lo := Enumeration_Rep (Entity (Type_Low_Bound (T)));
8105 Hi := Enumeration_Rep (Entity (Type_High_Bound (T)));
8108 if Lo >= -Uint_2**07 and then Hi < Uint_2**07 then
8109 Sz := Standard_Character_Size; -- May be > 8 on some targets
8111 elsif Lo >= -Uint_2**15 and then Hi < Uint_2**15 then
8114 elsif Lo >= -Uint_2**31 and then Hi < Uint_2**31 then
8117 else pragma Assert (Lo >= -Uint_2**63 and then Hi < Uint_2**63);
8122 if Hi < Uint_2**08 then
8123 Sz := Standard_Character_Size; -- May be > 8 on some targets
8125 elsif Hi < Uint_2**16 then
8128 elsif Hi < Uint_2**32 then
8131 else pragma Assert (Hi < Uint_2**63);
8136 -- That minimum is the proper size unless we have a foreign convention
8137 -- and the size required is 32 or less, in which case we bump the size
8138 -- up to 32. This is required for C and C++ and seems reasonable for
8139 -- all other foreign conventions.
8141 if Has_Foreign_Convention (T)
8142 and then Esize (T) < Standard_Integer_Size
8144 Init_Esize (T, Standard_Integer_Size);
8150 ------------------------------
8151 -- Validate_Address_Clauses --
8152 ------------------------------
8154 procedure Validate_Address_Clauses is
8156 for J in Address_Clause_Checks.First .. Address_Clause_Checks.Last loop
8158 ACCR : Address_Clause_Check_Record
8159 renames Address_Clause_Checks.Table (J);
8170 -- Skip processing of this entry if warning already posted
8172 if not Address_Warning_Posted (ACCR.N) then
8174 Expr := Original_Node (Expression (ACCR.N));
8178 X_Alignment := Alignment (ACCR.X);
8179 Y_Alignment := Alignment (ACCR.Y);
8181 -- Similarly obtain sizes
8183 X_Size := Esize (ACCR.X);
8184 Y_Size := Esize (ACCR.Y);
8186 -- Check for large object overlaying smaller one
8189 and then X_Size > Uint_0
8190 and then X_Size > Y_Size
8193 ("?& overlays smaller object", ACCR.N, ACCR.X);
8195 ("\?program execution may be erroneous", ACCR.N);
8196 Error_Msg_Uint_1 := X_Size;
8198 ("\?size of & is ^", ACCR.N, ACCR.X);
8199 Error_Msg_Uint_1 := Y_Size;
8201 ("\?size of & is ^", ACCR.N, ACCR.Y);
8203 -- Check for inadequate alignment, both of the base object
8204 -- and of the offset, if any.
8206 -- Note: we do not check the alignment if we gave a size
8207 -- warning, since it would likely be redundant.
8209 elsif Y_Alignment /= Uint_0
8210 and then (Y_Alignment < X_Alignment
8213 Nkind (Expr) = N_Attribute_Reference
8215 Attribute_Name (Expr) = Name_Address
8217 Has_Compatible_Alignment
8218 (ACCR.X, Prefix (Expr))
8219 /= Known_Compatible))
8222 ("?specified address for& may be inconsistent "
8226 ("\?program execution may be erroneous (RM 13.3(27))",
8228 Error_Msg_Uint_1 := X_Alignment;
8230 ("\?alignment of & is ^",
8232 Error_Msg_Uint_1 := Y_Alignment;
8234 ("\?alignment of & is ^",
8236 if Y_Alignment >= X_Alignment then
8238 ("\?but offset is not multiple of alignment",
8245 end Validate_Address_Clauses;
8247 ---------------------------
8248 -- Validate_Independence --
8249 ---------------------------
8251 procedure Validate_Independence is
8252 SU : constant Uint := UI_From_Int (System_Storage_Unit);
8260 procedure Check_Array_Type (Atyp : Entity_Id);
8261 -- Checks if the array type Atyp has independent components, and
8262 -- if not, outputs an appropriate set of error messages.
8264 procedure No_Independence;
8265 -- Output message that independence cannot be guaranteed
8267 function OK_Component (C : Entity_Id) return Boolean;
8268 -- Checks one component to see if it is independently accessible, and
8269 -- if so yields True, otherwise yields False if independent access
8270 -- cannot be guaranteed. This is a conservative routine, it only
8271 -- returns True if it knows for sure, it returns False if it knows
8272 -- there is a problem, or it cannot be sure there is no problem.
8274 procedure Reason_Bad_Component (C : Entity_Id);
8275 -- Outputs continuation message if a reason can be determined for
8276 -- the component C being bad.
8278 ----------------------
8279 -- Check_Array_Type --
8280 ----------------------
8282 procedure Check_Array_Type (Atyp : Entity_Id) is
8283 Ctyp : constant Entity_Id := Component_Type (Atyp);
8286 -- OK if no alignment clause, no pack, and no component size
8288 if not Has_Component_Size_Clause (Atyp)
8289 and then not Has_Alignment_Clause (Atyp)
8290 and then not Is_Packed (Atyp)
8295 -- Check actual component size
8297 if not Known_Component_Size (Atyp)
8298 or else not (Addressable (Component_Size (Atyp))
8299 and then Component_Size (Atyp) < 64)
8300 or else Component_Size (Atyp) mod Esize (Ctyp) /= 0
8304 -- Bad component size, check reason
8306 if Has_Component_Size_Clause (Atyp) then
8308 Get_Attribute_Definition_Clause
8309 (Atyp, Attribute_Component_Size);
8312 Error_Msg_Sloc := Sloc (P);
8313 Error_Msg_N ("\because of Component_Size clause#", N);
8318 if Is_Packed (Atyp) then
8319 P := Get_Rep_Pragma (Atyp, Name_Pack);
8322 Error_Msg_Sloc := Sloc (P);
8323 Error_Msg_N ("\because of pragma Pack#", N);
8328 -- No reason found, just return
8333 -- Array type is OK independence-wise
8336 end Check_Array_Type;
8338 ---------------------
8339 -- No_Independence --
8340 ---------------------
8342 procedure No_Independence is
8344 if Pragma_Name (N) = Name_Independent then
8346 ("independence cannot be guaranteed for&", N, E);
8349 ("independent components cannot be guaranteed for&", N, E);
8351 end No_Independence;
8357 function OK_Component (C : Entity_Id) return Boolean is
8358 Rec : constant Entity_Id := Scope (C);
8359 Ctyp : constant Entity_Id := Etype (C);
8362 -- OK if no component clause, no Pack, and no alignment clause
8364 if No (Component_Clause (C))
8365 and then not Is_Packed (Rec)
8366 and then not Has_Alignment_Clause (Rec)
8371 -- Here we look at the actual component layout. A component is
8372 -- addressable if its size is a multiple of the Esize of the
8373 -- component type, and its starting position in the record has
8374 -- appropriate alignment, and the record itself has appropriate
8375 -- alignment to guarantee the component alignment.
8377 -- Make sure sizes are static, always assume the worst for any
8378 -- cases where we cannot check static values.
8380 if not (Known_Static_Esize (C)
8381 and then Known_Static_Esize (Ctyp))
8386 -- Size of component must be addressable or greater than 64 bits
8387 -- and a multiple of bytes.
8389 if not Addressable (Esize (C))
8390 and then Esize (C) < Uint_64
8395 -- Check size is proper multiple
8397 if Esize (C) mod Esize (Ctyp) /= 0 then
8401 -- Check alignment of component is OK
8403 if not Known_Component_Bit_Offset (C)
8404 or else Component_Bit_Offset (C) < Uint_0
8405 or else Component_Bit_Offset (C) mod Esize (Ctyp) /= 0
8410 -- Check alignment of record type is OK
8412 if not Known_Alignment (Rec)
8413 or else (Alignment (Rec) * SU) mod Esize (Ctyp) /= 0
8418 -- All tests passed, component is addressable
8423 --------------------------
8424 -- Reason_Bad_Component --
8425 --------------------------
8427 procedure Reason_Bad_Component (C : Entity_Id) is
8428 Rec : constant Entity_Id := Scope (C);
8429 Ctyp : constant Entity_Id := Etype (C);
8432 -- If component clause present assume that's the problem
8434 if Present (Component_Clause (C)) then
8435 Error_Msg_Sloc := Sloc (Component_Clause (C));
8436 Error_Msg_N ("\because of Component_Clause#", N);
8440 -- If pragma Pack clause present, assume that's the problem
8442 if Is_Packed (Rec) then
8443 P := Get_Rep_Pragma (Rec, Name_Pack);
8446 Error_Msg_Sloc := Sloc (P);
8447 Error_Msg_N ("\because of pragma Pack#", N);
8452 -- See if record has bad alignment clause
8454 if Has_Alignment_Clause (Rec)
8455 and then Known_Alignment (Rec)
8456 and then (Alignment (Rec) * SU) mod Esize (Ctyp) /= 0
8458 P := Get_Attribute_Definition_Clause (Rec, Attribute_Alignment);
8461 Error_Msg_Sloc := Sloc (P);
8462 Error_Msg_N ("\because of Alignment clause#", N);
8466 -- Couldn't find a reason, so return without a message
8469 end Reason_Bad_Component;
8471 -- Start of processing for Validate_Independence
8474 for J in Independence_Checks.First .. Independence_Checks.Last loop
8475 N := Independence_Checks.Table (J).N;
8476 E := Independence_Checks.Table (J).E;
8477 IC := Pragma_Name (N) = Name_Independent_Components;
8479 -- Deal with component case
8481 if Ekind (E) = E_Discriminant or else Ekind (E) = E_Component then
8482 if not OK_Component (E) then
8484 Reason_Bad_Component (E);
8489 -- Deal with record with Independent_Components
8491 if IC and then Is_Record_Type (E) then
8492 Comp := First_Component_Or_Discriminant (E);
8493 while Present (Comp) loop
8494 if not OK_Component (Comp) then
8496 Reason_Bad_Component (Comp);
8500 Next_Component_Or_Discriminant (Comp);
8504 -- Deal with address clause case
8506 if Is_Object (E) then
8507 Addr := Address_Clause (E);
8509 if Present (Addr) then
8511 Error_Msg_Sloc := Sloc (Addr);
8512 Error_Msg_N ("\because of Address clause#", N);
8517 -- Deal with independent components for array type
8519 if IC and then Is_Array_Type (E) then
8520 Check_Array_Type (E);
8523 -- Deal with independent components for array object
8525 if IC and then Is_Object (E) and then Is_Array_Type (Etype (E)) then
8526 Check_Array_Type (Etype (E));
8531 end Validate_Independence;
8533 -----------------------------------
8534 -- Validate_Unchecked_Conversion --
8535 -----------------------------------
8537 procedure Validate_Unchecked_Conversion
8539 Act_Unit : Entity_Id)
8546 -- Obtain source and target types. Note that we call Ancestor_Subtype
8547 -- here because the processing for generic instantiation always makes
8548 -- subtypes, and we want the original frozen actual types.
8550 -- If we are dealing with private types, then do the check on their
8551 -- fully declared counterparts if the full declarations have been
8552 -- encountered (they don't have to be visible, but they must exist!)
8554 Source := Ancestor_Subtype (Etype (First_Formal (Act_Unit)));
8556 if Is_Private_Type (Source)
8557 and then Present (Underlying_Type (Source))
8559 Source := Underlying_Type (Source);
8562 Target := Ancestor_Subtype (Etype (Act_Unit));
8564 -- If either type is generic, the instantiation happens within a generic
8565 -- unit, and there is nothing to check. The proper check
8566 -- will happen when the enclosing generic is instantiated.
8568 if Is_Generic_Type (Source) or else Is_Generic_Type (Target) then
8572 if Is_Private_Type (Target)
8573 and then Present (Underlying_Type (Target))
8575 Target := Underlying_Type (Target);
8578 -- Source may be unconstrained array, but not target
8580 if Is_Array_Type (Target)
8581 and then not Is_Constrained (Target)
8584 ("unchecked conversion to unconstrained array not allowed", N);
8588 -- Warn if conversion between two different convention pointers
8590 if Is_Access_Type (Target)
8591 and then Is_Access_Type (Source)
8592 and then Convention (Target) /= Convention (Source)
8593 and then Warn_On_Unchecked_Conversion
8595 -- Give warnings for subprogram pointers only on most targets. The
8596 -- exception is VMS, where data pointers can have different lengths
8597 -- depending on the pointer convention.
8599 if Is_Access_Subprogram_Type (Target)
8600 or else Is_Access_Subprogram_Type (Source)
8601 or else OpenVMS_On_Target
8604 ("?conversion between pointers with different conventions!", N);
8608 -- Warn if one of the operands is Ada.Calendar.Time. Do not emit a
8609 -- warning when compiling GNAT-related sources.
8611 if Warn_On_Unchecked_Conversion
8612 and then not In_Predefined_Unit (N)
8613 and then RTU_Loaded (Ada_Calendar)
8615 (Chars (Source) = Name_Time
8617 Chars (Target) = Name_Time)
8619 -- If Ada.Calendar is loaded and the name of one of the operands is
8620 -- Time, there is a good chance that this is Ada.Calendar.Time.
8623 Calendar_Time : constant Entity_Id :=
8624 Full_View (RTE (RO_CA_Time));
8626 pragma Assert (Present (Calendar_Time));
8628 if Source = Calendar_Time
8629 or else Target = Calendar_Time
8632 ("?representation of 'Time values may change between " &
8633 "'G'N'A'T versions", N);
8638 -- Make entry in unchecked conversion table for later processing by
8639 -- Validate_Unchecked_Conversions, which will check sizes and alignments
8640 -- (using values set by the back-end where possible). This is only done
8641 -- if the appropriate warning is active.
8643 if Warn_On_Unchecked_Conversion then
8644 Unchecked_Conversions.Append
8645 (New_Val => UC_Entry'
8650 -- If both sizes are known statically now, then back end annotation
8651 -- is not required to do a proper check but if either size is not
8652 -- known statically, then we need the annotation.
8654 if Known_Static_RM_Size (Source)
8655 and then Known_Static_RM_Size (Target)
8659 Back_Annotate_Rep_Info := True;
8663 -- If unchecked conversion to access type, and access type is declared
8664 -- in the same unit as the unchecked conversion, then set the
8665 -- No_Strict_Aliasing flag (no strict aliasing is implicit in this
8668 if Is_Access_Type (Target) and then
8669 In_Same_Source_Unit (Target, N)
8671 Set_No_Strict_Aliasing (Implementation_Base_Type (Target));
8674 -- Generate N_Validate_Unchecked_Conversion node for back end in
8675 -- case the back end needs to perform special validation checks.
8677 -- Shouldn't this be in Exp_Ch13, since the check only gets done
8678 -- if we have full expansion and the back end is called ???
8681 Make_Validate_Unchecked_Conversion (Sloc (N));
8682 Set_Source_Type (Vnode, Source);
8683 Set_Target_Type (Vnode, Target);
8685 -- If the unchecked conversion node is in a list, just insert before it.
8686 -- If not we have some strange case, not worth bothering about.
8688 if Is_List_Member (N) then
8689 Insert_After (N, Vnode);
8691 end Validate_Unchecked_Conversion;
8693 ------------------------------------
8694 -- Validate_Unchecked_Conversions --
8695 ------------------------------------
8697 procedure Validate_Unchecked_Conversions is
8699 for N in Unchecked_Conversions.First .. Unchecked_Conversions.Last loop
8701 T : UC_Entry renames Unchecked_Conversions.Table (N);
8703 Eloc : constant Source_Ptr := T.Eloc;
8704 Source : constant Entity_Id := T.Source;
8705 Target : constant Entity_Id := T.Target;
8711 -- This validation check, which warns if we have unequal sizes for
8712 -- unchecked conversion, and thus potentially implementation
8713 -- dependent semantics, is one of the few occasions on which we
8714 -- use the official RM size instead of Esize. See description in
8715 -- Einfo "Handling of Type'Size Values" for details.
8717 if Serious_Errors_Detected = 0
8718 and then Known_Static_RM_Size (Source)
8719 and then Known_Static_RM_Size (Target)
8721 -- Don't do the check if warnings off for either type, note the
8722 -- deliberate use of OR here instead of OR ELSE to get the flag
8723 -- Warnings_Off_Used set for both types if appropriate.
8725 and then not (Has_Warnings_Off (Source)
8727 Has_Warnings_Off (Target))
8729 Source_Siz := RM_Size (Source);
8730 Target_Siz := RM_Size (Target);
8732 if Source_Siz /= Target_Siz then
8734 ("?types for unchecked conversion have different sizes!",
8737 if All_Errors_Mode then
8738 Error_Msg_Name_1 := Chars (Source);
8739 Error_Msg_Uint_1 := Source_Siz;
8740 Error_Msg_Name_2 := Chars (Target);
8741 Error_Msg_Uint_2 := Target_Siz;
8742 Error_Msg ("\size of % is ^, size of % is ^?", Eloc);
8744 Error_Msg_Uint_1 := UI_Abs (Source_Siz - Target_Siz);
8746 if Is_Discrete_Type (Source)
8747 and then Is_Discrete_Type (Target)
8749 if Source_Siz > Target_Siz then
8751 ("\?^ high order bits of source will be ignored!",
8754 elsif Is_Unsigned_Type (Source) then
8756 ("\?source will be extended with ^ high order " &
8757 "zero bits?!", Eloc);
8761 ("\?source will be extended with ^ high order " &
8766 elsif Source_Siz < Target_Siz then
8767 if Is_Discrete_Type (Target) then
8768 if Bytes_Big_Endian then
8770 ("\?target value will include ^ undefined " &
8775 ("\?target value will include ^ undefined " &
8782 ("\?^ trailing bits of target value will be " &
8783 "undefined!", Eloc);
8786 else pragma Assert (Source_Siz > Target_Siz);
8788 ("\?^ trailing bits of source will be ignored!",
8795 -- If both types are access types, we need to check the alignment.
8796 -- If the alignment of both is specified, we can do it here.
8798 if Serious_Errors_Detected = 0
8799 and then Ekind (Source) in Access_Kind
8800 and then Ekind (Target) in Access_Kind
8801 and then Target_Strict_Alignment
8802 and then Present (Designated_Type (Source))
8803 and then Present (Designated_Type (Target))
8806 D_Source : constant Entity_Id := Designated_Type (Source);
8807 D_Target : constant Entity_Id := Designated_Type (Target);
8810 if Known_Alignment (D_Source)
8811 and then Known_Alignment (D_Target)
8814 Source_Align : constant Uint := Alignment (D_Source);
8815 Target_Align : constant Uint := Alignment (D_Target);
8818 if Source_Align < Target_Align
8819 and then not Is_Tagged_Type (D_Source)
8821 -- Suppress warning if warnings suppressed on either
8822 -- type or either designated type. Note the use of
8823 -- OR here instead of OR ELSE. That is intentional,
8824 -- we would like to set flag Warnings_Off_Used in
8825 -- all types for which warnings are suppressed.
8827 and then not (Has_Warnings_Off (D_Source)
8829 Has_Warnings_Off (D_Target)
8831 Has_Warnings_Off (Source)
8833 Has_Warnings_Off (Target))
8835 Error_Msg_Uint_1 := Target_Align;
8836 Error_Msg_Uint_2 := Source_Align;
8837 Error_Msg_Node_1 := D_Target;
8838 Error_Msg_Node_2 := D_Source;
8840 ("?alignment of & (^) is stricter than " &
8841 "alignment of & (^)!", Eloc);
8843 ("\?resulting access value may have invalid " &
8844 "alignment!", Eloc);
8852 end Validate_Unchecked_Conversions;
OSDN Git Service
