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_Dim; use Sem_Dim;
50 with Sem_Eval; use Sem_Eval;
51 with Sem_Res; use Sem_Res;
52 with Sem_Type; use Sem_Type;
53 with Sem_Util; use Sem_Util;
54 with Sem_Warn; use Sem_Warn;
55 with Sinput; use Sinput;
56 with Snames; use Snames;
57 with Stand; use Stand;
58 with Sinfo; use Sinfo;
59 with Stringt; use Stringt;
60 with Targparm; use Targparm;
61 with Ttypes; use Ttypes;
62 with Tbuild; use Tbuild;
63 with Urealp; use Urealp;
64 with Warnsw; use Warnsw;
66 with GNAT.Heap_Sort_G;
68 package body Sem_Ch13 is
70 SSU : constant Pos := System_Storage_Unit;
71 -- Convenient short hand for commonly used constant
73 -----------------------
74 -- Local Subprograms --
75 -----------------------
77 procedure Alignment_Check_For_Size_Change (Typ : Entity_Id; Size : Uint);
78 -- This routine is called after setting one of the sizes of type entity
79 -- Typ to Size. The purpose is to deal with the situation of a derived
80 -- type whose inherited alignment is no longer appropriate for the new
81 -- size value. In this case, we reset the Alignment to unknown.
83 procedure Build_Predicate_Function (Typ : Entity_Id; N : Node_Id);
84 -- If Typ has predicates (indicated by Has_Predicates being set for Typ,
85 -- then either there are pragma Invariant entries on the rep chain for the
86 -- type (note that Predicate aspects are converted to pragma Predicate), or
87 -- there are inherited aspects from a parent type, or ancestor subtypes.
88 -- This procedure builds the spec and body for the Predicate function that
89 -- tests these predicates. N is the freeze node for the type. The spec of
90 -- the function is inserted before the freeze node, and the body of the
91 -- function is inserted after the freeze node.
93 procedure Build_Static_Predicate
97 -- Given a predicated type Typ, where Typ is a discrete static subtype,
98 -- whose predicate expression is Expr, tests if Expr is a static predicate,
99 -- and if so, builds the predicate range list. Nam is the name of the one
100 -- argument to the predicate function. Occurrences of the type name in the
101 -- predicate expression have been replaced by identifier references to this
102 -- name, which is unique, so any identifier with Chars matching Nam must be
103 -- a reference to the type. If the predicate is non-static, this procedure
104 -- returns doing nothing. If the predicate is static, then the predicate
105 -- list is stored in Static_Predicate (Typ), and the Expr is rewritten as
106 -- a canonicalized membership operation.
108 function Get_Alignment_Value (Expr : Node_Id) return Uint;
109 -- Given the expression for an alignment value, returns the corresponding
110 -- Uint value. If the value is inappropriate, then error messages are
111 -- posted as required, and a value of No_Uint is returned.
113 function Is_Operational_Item (N : Node_Id) return Boolean;
114 -- A specification for a stream attribute is allowed before the full type
115 -- is declared, as explained in AI-00137 and the corrigendum. Attributes
116 -- that do not specify a representation characteristic are operational
119 procedure New_Stream_Subprogram
123 Nam : TSS_Name_Type);
124 -- Create a subprogram renaming of a given stream attribute to the
125 -- designated subprogram and then in the tagged case, provide this as a
126 -- primitive operation, or in the non-tagged case make an appropriate TSS
127 -- entry. This is more properly an expansion activity than just semantics,
128 -- but the presence of user-defined stream functions for limited types is a
129 -- legality check, which is why this takes place here rather than in
130 -- exp_ch13, where it was previously. Nam indicates the name of the TSS
131 -- function to be generated.
133 -- To avoid elaboration anomalies with freeze nodes, for untagged types
134 -- we generate both a subprogram declaration and a subprogram renaming
135 -- declaration, so that the attribute specification is handled as a
136 -- renaming_as_body. For tagged types, the specification is one of the
140 with procedure Replace_Type_Reference (N : Node_Id);
141 procedure Replace_Type_References_Generic (N : Node_Id; TName : Name_Id);
142 -- This is used to scan an expression for a predicate or invariant aspect
143 -- replacing occurrences of the name TName (the name of the subtype to
144 -- which the aspect applies) with appropriate references to the parameter
145 -- of the predicate function or invariant procedure. The procedure passed
146 -- as a generic parameter does the actual replacement of node N, which is
147 -- either a simple direct reference to TName, or a selected component that
148 -- represents an appropriately qualified occurrence of TName.
154 Biased : Boolean := True);
155 -- If Biased is True, sets Has_Biased_Representation flag for E, and
156 -- outputs a warning message at node N if Warn_On_Biased_Representation is
157 -- is True. This warning inserts the string Msg to describe the construct
160 ----------------------------------------------
161 -- Table for Validate_Unchecked_Conversions --
162 ----------------------------------------------
164 -- The following table collects unchecked conversions for validation.
165 -- Entries are made by Validate_Unchecked_Conversion and then the call
166 -- to Validate_Unchecked_Conversions does the actual error checking and
167 -- posting of warnings. The reason for this delayed processing is to take
168 -- advantage of back-annotations of size and alignment values performed by
171 -- Note: the reason we store a Source_Ptr value instead of a Node_Id is
172 -- that by the time Validate_Unchecked_Conversions is called, Sprint will
173 -- already have modified all Sloc values if the -gnatD option is set.
175 type UC_Entry is record
176 Eloc : Source_Ptr; -- node used for posting warnings
177 Source : Entity_Id; -- source type for unchecked conversion
178 Target : Entity_Id; -- target type for unchecked conversion
181 package Unchecked_Conversions is new Table.Table (
182 Table_Component_Type => UC_Entry,
183 Table_Index_Type => Int,
184 Table_Low_Bound => 1,
186 Table_Increment => 200,
187 Table_Name => "Unchecked_Conversions");
189 ----------------------------------------
190 -- Table for Validate_Address_Clauses --
191 ----------------------------------------
193 -- If an address clause has the form
195 -- for X'Address use Expr
197 -- where Expr is of the form Y'Address or recursively is a reference to a
198 -- constant of either of these forms, and X and Y are entities of objects,
199 -- then if Y has a smaller alignment than X, that merits a warning about
200 -- possible bad alignment. The following table collects address clauses of
201 -- this kind. We put these in a table so that they can be checked after the
202 -- back end has completed annotation of the alignments of objects, since we
203 -- can catch more cases that way.
205 type Address_Clause_Check_Record is record
207 -- The address clause
210 -- The entity of the object overlaying Y
213 -- The entity of the object being overlaid
216 -- Whether the address is offset within Y
219 package Address_Clause_Checks is new Table.Table (
220 Table_Component_Type => Address_Clause_Check_Record,
221 Table_Index_Type => Int,
222 Table_Low_Bound => 1,
224 Table_Increment => 200,
225 Table_Name => "Address_Clause_Checks");
227 -----------------------------------------
228 -- Adjust_Record_For_Reverse_Bit_Order --
229 -----------------------------------------
231 procedure Adjust_Record_For_Reverse_Bit_Order (R : Entity_Id) is
236 -- Processing depends on version of Ada
238 -- For Ada 95, we just renumber bits within a storage unit. We do the
239 -- same for Ada 83 mode, since we recognize the Bit_Order attribute in
240 -- Ada 83, and are free to add this extension.
242 if Ada_Version < Ada_2005 then
243 Comp := First_Component_Or_Discriminant (R);
244 while Present (Comp) loop
245 CC := Component_Clause (Comp);
247 -- If component clause is present, then deal with the non-default
248 -- bit order case for Ada 95 mode.
250 -- We only do this processing for the base type, and in fact that
251 -- is important, since otherwise if there are record subtypes, we
252 -- could reverse the bits once for each subtype, which is wrong.
255 and then Ekind (R) = E_Record_Type
258 CFB : constant Uint := Component_Bit_Offset (Comp);
259 CSZ : constant Uint := Esize (Comp);
260 CLC : constant Node_Id := Component_Clause (Comp);
261 Pos : constant Node_Id := Position (CLC);
262 FB : constant Node_Id := First_Bit (CLC);
264 Storage_Unit_Offset : constant Uint :=
265 CFB / System_Storage_Unit;
267 Start_Bit : constant Uint :=
268 CFB mod System_Storage_Unit;
271 -- Cases where field goes over storage unit boundary
273 if Start_Bit + CSZ > System_Storage_Unit then
275 -- Allow multi-byte field but generate warning
277 if Start_Bit mod System_Storage_Unit = 0
278 and then CSZ mod System_Storage_Unit = 0
281 ("multi-byte field specified with non-standard"
282 & " Bit_Order?", CLC);
284 if Bytes_Big_Endian then
286 ("bytes are not reversed "
287 & "(component is big-endian)?", CLC);
290 ("bytes are not reversed "
291 & "(component is little-endian)?", CLC);
294 -- Do not allow non-contiguous field
298 ("attempt to specify non-contiguous field "
299 & "not permitted", CLC);
301 ("\caused by non-standard Bit_Order "
304 ("\consider possibility of using "
305 & "Ada 2005 mode here", CLC);
308 -- Case where field fits in one storage unit
311 -- Give warning if suspicious component clause
313 if Intval (FB) >= System_Storage_Unit
314 and then Warn_On_Reverse_Bit_Order
317 ("?Bit_Order clause does not affect " &
318 "byte ordering", Pos);
320 Intval (Pos) + Intval (FB) /
323 ("?position normalized to ^ before bit " &
324 "order interpreted", Pos);
327 -- Here is where we fix up the Component_Bit_Offset value
328 -- to account for the reverse bit order. Some examples of
329 -- what needs to be done are:
331 -- First_Bit .. Last_Bit Component_Bit_Offset
343 -- The rule is that the first bit is is obtained by
344 -- subtracting the old ending bit from storage_unit - 1.
346 Set_Component_Bit_Offset
348 (Storage_Unit_Offset * System_Storage_Unit) +
349 (System_Storage_Unit - 1) -
350 (Start_Bit + CSZ - 1));
352 Set_Normalized_First_Bit
354 Component_Bit_Offset (Comp) mod
355 System_Storage_Unit);
360 Next_Component_Or_Discriminant (Comp);
363 -- For Ada 2005, we do machine scalar processing, as fully described In
364 -- AI-133. This involves gathering all components which start at the
365 -- same byte offset and processing them together. Same approach is still
366 -- valid in later versions including Ada 2012.
370 Max_Machine_Scalar_Size : constant Uint :=
372 (Standard_Long_Long_Integer_Size);
373 -- We use this as the maximum machine scalar size
376 SSU : constant Uint := UI_From_Int (System_Storage_Unit);
379 -- This first loop through components does two things. First it
380 -- deals with the case of components with component clauses whose
381 -- length is greater than the maximum machine scalar size (either
382 -- accepting them or rejecting as needed). Second, it counts the
383 -- number of components with component clauses whose length does
384 -- not exceed this maximum for later processing.
387 Comp := First_Component_Or_Discriminant (R);
388 while Present (Comp) loop
389 CC := Component_Clause (Comp);
393 Fbit : constant Uint :=
394 Static_Integer (First_Bit (CC));
395 Lbit : constant Uint :=
396 Static_Integer (Last_Bit (CC));
399 -- Case of component with last bit >= max machine scalar
401 if Lbit >= Max_Machine_Scalar_Size then
403 -- This is allowed only if first bit is zero, and
404 -- last bit + 1 is a multiple of storage unit size.
406 if Fbit = 0 and then (Lbit + 1) mod SSU = 0 then
408 -- This is the case to give a warning if enabled
410 if Warn_On_Reverse_Bit_Order then
412 ("multi-byte field specified with "
413 & " non-standard Bit_Order?", CC);
415 if Bytes_Big_Endian then
417 ("\bytes are not reversed "
418 & "(component is big-endian)?", CC);
421 ("\bytes are not reversed "
422 & "(component is little-endian)?", CC);
426 -- Give error message for RM 13.4.1(10) violation
430 ("machine scalar rules not followed for&",
431 First_Bit (CC), Comp);
433 Error_Msg_Uint_1 := Lbit;
434 Error_Msg_Uint_2 := Max_Machine_Scalar_Size;
436 ("\last bit (^) exceeds maximum machine "
440 if (Lbit + 1) mod SSU /= 0 then
441 Error_Msg_Uint_1 := SSU;
443 ("\and is not a multiple of Storage_Unit (^) "
448 Error_Msg_Uint_1 := Fbit;
450 ("\and first bit (^) is non-zero "
456 -- OK case of machine scalar related component clause,
457 -- For now, just count them.
460 Num_CC := Num_CC + 1;
465 Next_Component_Or_Discriminant (Comp);
468 -- We need to sort the component clauses on the basis of the
469 -- Position values in the clause, so we can group clauses with
470 -- the same Position. together to determine the relevant machine
474 Comps : array (0 .. Num_CC) of Entity_Id;
475 -- Array to collect component and discriminant entities. The
476 -- data starts at index 1, the 0'th entry is for the sort
479 function CP_Lt (Op1, Op2 : Natural) return Boolean;
480 -- Compare routine for Sort
482 procedure CP_Move (From : Natural; To : Natural);
483 -- Move routine for Sort
485 package Sorting is new GNAT.Heap_Sort_G (CP_Move, CP_Lt);
489 -- Start and stop positions in the component list of the set of
490 -- components with the same starting position (that constitute
491 -- components in a single machine scalar).
494 -- Maximum last bit value of any component in this set
497 -- Corresponding machine scalar size
503 function CP_Lt (Op1, Op2 : Natural) return Boolean is
505 return Position (Component_Clause (Comps (Op1))) <
506 Position (Component_Clause (Comps (Op2)));
513 procedure CP_Move (From : Natural; To : Natural) is
515 Comps (To) := Comps (From);
518 -- Start of processing for Sort_CC
521 -- Collect the machine scalar relevant component clauses
524 Comp := First_Component_Or_Discriminant (R);
525 while Present (Comp) loop
527 CC : constant Node_Id := Component_Clause (Comp);
530 -- Collect only component clauses whose last bit is less
531 -- than machine scalar size. Any component clause whose
532 -- last bit exceeds this value does not take part in
533 -- machine scalar layout considerations. The test for
534 -- Error_Posted makes sure we exclude component clauses
535 -- for which we already posted an error.
538 and then not Error_Posted (Last_Bit (CC))
539 and then Static_Integer (Last_Bit (CC)) <
540 Max_Machine_Scalar_Size
542 Num_CC := Num_CC + 1;
543 Comps (Num_CC) := Comp;
547 Next_Component_Or_Discriminant (Comp);
550 -- Sort by ascending position number
552 Sorting.Sort (Num_CC);
554 -- We now have all the components whose size does not exceed
555 -- the max machine scalar value, sorted by starting position.
556 -- In this loop we gather groups of clauses starting at the
557 -- same position, to process them in accordance with AI-133.
560 while Stop < Num_CC loop
565 (Last_Bit (Component_Clause (Comps (Start))));
566 while Stop < Num_CC loop
568 (Position (Component_Clause (Comps (Stop + 1)))) =
570 (Position (Component_Clause (Comps (Stop))))
578 (Component_Clause (Comps (Stop)))));
584 -- Now we have a group of component clauses from Start to
585 -- Stop whose positions are identical, and MaxL is the
586 -- maximum last bit value of any of these components.
588 -- We need to determine the corresponding machine scalar
589 -- size. This loop assumes that machine scalar sizes are
590 -- even, and that each possible machine scalar has twice
591 -- as many bits as the next smaller one.
593 MSS := Max_Machine_Scalar_Size;
595 and then (MSS / 2) >= SSU
596 and then (MSS / 2) > MaxL
601 -- Here is where we fix up the Component_Bit_Offset value
602 -- to account for the reverse bit order. Some examples of
603 -- what needs to be done for the case of a machine scalar
606 -- First_Bit .. Last_Bit Component_Bit_Offset
618 -- The rule is that the first bit is obtained by subtracting
619 -- the old ending bit from machine scalar size - 1.
621 for C in Start .. Stop loop
623 Comp : constant Entity_Id := Comps (C);
624 CC : constant Node_Id :=
625 Component_Clause (Comp);
626 LB : constant Uint :=
627 Static_Integer (Last_Bit (CC));
628 NFB : constant Uint := MSS - Uint_1 - LB;
629 NLB : constant Uint := NFB + Esize (Comp) - 1;
630 Pos : constant Uint :=
631 Static_Integer (Position (CC));
634 if Warn_On_Reverse_Bit_Order then
635 Error_Msg_Uint_1 := MSS;
637 ("info: reverse bit order in machine " &
638 "scalar of length^?", First_Bit (CC));
639 Error_Msg_Uint_1 := NFB;
640 Error_Msg_Uint_2 := NLB;
642 if Bytes_Big_Endian then
644 ("?\info: big-endian range for "
645 & "component & is ^ .. ^",
646 First_Bit (CC), Comp);
649 ("?\info: little-endian range "
650 & "for component & is ^ .. ^",
651 First_Bit (CC), Comp);
655 Set_Component_Bit_Offset (Comp, Pos * SSU + NFB);
656 Set_Normalized_First_Bit (Comp, NFB mod SSU);
663 end Adjust_Record_For_Reverse_Bit_Order;
665 -------------------------------------
666 -- Alignment_Check_For_Size_Change --
667 -------------------------------------
669 procedure Alignment_Check_For_Size_Change (Typ : Entity_Id; Size : Uint) is
671 -- If the alignment is known, and not set by a rep clause, and is
672 -- inconsistent with the size being set, then reset it to unknown,
673 -- we assume in this case that the size overrides the inherited
674 -- alignment, and that the alignment must be recomputed.
676 if Known_Alignment (Typ)
677 and then not Has_Alignment_Clause (Typ)
678 and then Size mod (Alignment (Typ) * SSU) /= 0
680 Init_Alignment (Typ);
682 end Alignment_Check_For_Size_Change;
684 -----------------------------------
685 -- Analyze_Aspect_Specifications --
686 -----------------------------------
688 procedure Analyze_Aspect_Specifications (N : Node_Id; E : Entity_Id) is
693 L : constant List_Id := Aspect_Specifications (N);
695 Ins_Node : Node_Id := N;
696 -- Insert pragmas (except Pre/Post/Invariant/Predicate) after this node
698 -- The general processing involves building an attribute definition
699 -- clause or a pragma node that corresponds to the aspect. Then one
700 -- of two things happens:
702 -- If we are required to delay the evaluation of this aspect to the
703 -- freeze point, we attach the corresponding pragma/attribute definition
704 -- clause to the aspect specification node, which is then placed in the
705 -- Rep Item chain. In this case we mark the entity by setting the flag
706 -- Has_Delayed_Aspects and we evaluate the rep item at the freeze point.
708 -- If no delay is required, we just insert the pragma or attribute
709 -- after the declaration, and it will get processed by the normal
710 -- circuit. The From_Aspect_Specification flag is set on the pragma
711 -- or attribute definition node in either case to activate special
712 -- processing (e.g. not traversing the list of homonyms for inline).
714 Delay_Required : Boolean := False;
715 -- Set True if delay is required
718 pragma Assert (Present (L));
720 -- Loop through aspects
723 Aspect_Loop : while Present (Aspect) loop
725 Loc : constant Source_Ptr := Sloc (Aspect);
726 Id : constant Node_Id := Identifier (Aspect);
727 Expr : constant Node_Id := Expression (Aspect);
728 Nam : constant Name_Id := Chars (Id);
729 A_Id : constant Aspect_Id := Get_Aspect_Id (Nam);
732 Eloc : Source_Ptr := No_Location;
733 -- Source location of expression, modified when we split PPC's. It
734 -- is set below when Expr is present.
736 procedure Check_False_Aspect_For_Derived_Type;
737 -- This procedure checks for the case of a false aspect for a
738 -- derived type, which improperly tries to cancel an aspect
739 -- inherited from the parent;
741 -----------------------------------------
742 -- Check_False_Aspect_For_Derived_Type --
743 -----------------------------------------
745 procedure Check_False_Aspect_For_Derived_Type is
747 -- We are only checking derived types
749 if not Is_Derived_Type (E) then
754 when Aspect_Atomic | Aspect_Shared =>
755 if not Is_Atomic (E) then
759 when Aspect_Atomic_Components =>
760 if not Has_Atomic_Components (E) then
764 when Aspect_Discard_Names =>
765 if not Discard_Names (E) then
770 if not Is_Packed (E) then
774 when Aspect_Unchecked_Union =>
775 if not Is_Unchecked_Union (E) then
779 when Aspect_Volatile =>
780 if not Is_Volatile (E) then
784 when Aspect_Volatile_Components =>
785 if not Has_Volatile_Components (E) then
793 -- Fall through means we are canceling an inherited aspect
795 Error_Msg_Name_1 := Nam;
797 ("derived type& inherits aspect%, cannot cancel", Expr, E);
798 end Check_False_Aspect_For_Derived_Type;
800 -- Start of processing for Aspect_Loop
803 -- Skip aspect if already analyzed (not clear if this is needed)
805 if Analyzed (Aspect) then
809 -- Set the source location of expression, used in the case of
810 -- a failed precondition/postcondition or invariant. Note that
811 -- the source location of the expression is not usually the best
812 -- choice here. For example, it gets located on the last AND
813 -- keyword in a chain of boolean expressiond AND'ed together.
814 -- It is best to put the message on the first character of the
815 -- assertion, which is the effect of the First_Node call here.
817 if Present (Expr) then
818 Eloc := Sloc (First_Node (Expr));
821 -- Check restriction No_Implementation_Aspect_Specifications
823 if Impl_Defined_Aspects (A_Id) then
825 (No_Implementation_Aspect_Specifications, Aspect);
828 -- Check restriction No_Specification_Of_Aspect
830 Check_Restriction_No_Specification_Of_Aspect (Aspect);
832 -- Analyze this aspect
834 Set_Analyzed (Aspect);
835 Set_Entity (Aspect, E);
836 Ent := New_Occurrence_Of (E, Sloc (Id));
838 -- Check for duplicate aspect. Note that the Comes_From_Source
839 -- test allows duplicate Pre/Post's that we generate internally
840 -- to escape being flagged here.
842 if No_Duplicates_Allowed (A_Id) then
844 while Anod /= Aspect loop
846 (A_Id, Get_Aspect_Id (Chars (Identifier (Anod))))
847 and then Comes_From_Source (Aspect)
849 Error_Msg_Name_1 := Nam;
850 Error_Msg_Sloc := Sloc (Anod);
852 -- Case of same aspect specified twice
854 if Class_Present (Anod) = Class_Present (Aspect) then
855 if not Class_Present (Anod) then
857 ("aspect% for & previously given#",
861 ("aspect `%''Class` for & previously given#",
865 -- Case of Pre and Pre'Class both specified
867 elsif Nam = Name_Pre then
868 if Class_Present (Aspect) then
870 ("aspect `Pre''Class` for & is not allowed here",
873 ("\since aspect `Pre` previously given#",
878 ("aspect `Pre` for & is not allowed here",
881 ("\since aspect `Pre''Class` previously given#",
886 -- Allowed case of X and X'Class both specified
893 -- Copy expression for later processing by the procedures
894 -- Check_Aspect_At_[Freeze_Point | End_Of_Declarations]
896 Set_Entity (Id, New_Copy_Tree (Expr));
898 -- Processing based on specific aspect
902 -- No_Aspect should be impossible
907 -- Aspects taking an optional boolean argument. For all of
908 -- these we just create a matching pragma and insert it, if
909 -- the expression is missing or set to True. If the expression
910 -- is False, we can ignore the aspect with the exception that
911 -- in the case of a derived type, we must check for an illegal
912 -- attempt to cancel an inherited aspect.
914 when Boolean_Aspects =>
915 Set_Is_Boolean_Aspect (Aspect);
918 and then Is_False (Static_Boolean (Expr))
920 Check_False_Aspect_For_Derived_Type;
924 -- If True, build corresponding pragma node
928 Pragma_Argument_Associations => New_List (Ent),
930 Make_Identifier (Sloc (Id), Chars (Id)));
932 -- Never need to delay for boolean aspects
934 pragma Assert (not Delay_Required);
936 -- Library unit aspects. These are boolean aspects, but we
937 -- have to do special things with the insertion, since the
938 -- pragma belongs inside the declarations of a package.
940 when Library_Unit_Aspects =>
942 and then Is_False (Static_Boolean (Expr))
947 -- Build corresponding pragma node
951 Pragma_Argument_Associations => New_List (Ent),
953 Make_Identifier (Sloc (Id), Chars (Id)));
955 -- This requires special handling in the case of a package
956 -- declaration, the pragma needs to be inserted in the list
957 -- of declarations for the associated package. There is no
958 -- issue of visibility delay for these aspects.
960 if Nkind (N) = N_Package_Declaration then
961 if Nkind (Parent (N)) /= N_Compilation_Unit then
963 ("incorrect context for library unit aspect&", Id);
966 (Aitem, Visible_Declarations (Specification (N)));
972 -- If not package declaration, no delay is required
974 pragma Assert (not Delay_Required);
976 -- Aspects related to container iterators. These aspects denote
977 -- subprograms, and thus must be delayed.
979 when Aspect_Constant_Indexing |
980 Aspect_Variable_Indexing =>
982 if not Is_Type (E) or else not Is_Tagged_Type (E) then
983 Error_Msg_N ("indexing applies to a tagged type", N);
987 Make_Attribute_Definition_Clause (Loc,
990 Expression => Relocate_Node (Expr));
992 Delay_Required := True;
993 Set_Is_Delayed_Aspect (Aspect);
995 when Aspect_Default_Iterator |
996 Aspect_Iterator_Element =>
999 Make_Attribute_Definition_Clause (Loc,
1001 Chars => Chars (Id),
1002 Expression => Relocate_Node (Expr));
1004 Delay_Required := True;
1005 Set_Is_Delayed_Aspect (Aspect);
1007 when Aspect_Implicit_Dereference =>
1009 or else not Has_Discriminants (E)
1012 ("Aspect must apply to a type with discriminants", N);
1020 Disc := First_Discriminant (E);
1021 while Present (Disc) loop
1022 if Chars (Expr) = Chars (Disc)
1023 and then Ekind (Etype (Disc)) =
1024 E_Anonymous_Access_Type
1026 Set_Has_Implicit_Dereference (E);
1027 Set_Has_Implicit_Dereference (Disc);
1031 Next_Discriminant (Disc);
1034 -- Error if no proper access discriminant.
1037 ("not an access discriminant of&", Expr, E);
1043 -- Aspects corresponding to attribute definition clauses
1045 when Aspect_Address |
1048 Aspect_Component_Size |
1049 Aspect_External_Tag |
1051 Aspect_Machine_Radix |
1052 Aspect_Object_Size |
1057 Aspect_Storage_Pool |
1058 Aspect_Storage_Size |
1059 Aspect_Stream_Size |
1063 -- Construct the attribute definition clause
1066 Make_Attribute_Definition_Clause (Loc,
1068 Chars => Chars (Id),
1069 Expression => Relocate_Node (Expr));
1071 -- A delay is required except in the common case where
1072 -- the expression is a literal, in which case it is fine
1073 -- to take care of it right away.
1075 if Nkind_In (Expr, N_Integer_Literal, N_String_Literal) then
1076 pragma Assert (not Delay_Required);
1079 Delay_Required := True;
1080 Set_Is_Delayed_Aspect (Aspect);
1083 -- Aspects corresponding to pragmas with two arguments, where
1084 -- the first argument is a local name referring to the entity,
1085 -- and the second argument is the aspect definition expression
1086 -- which is an expression that does not get analyzed.
1088 when Aspect_Suppress |
1089 Aspect_Unsuppress =>
1091 -- Construct the pragma
1095 Pragma_Argument_Associations => New_List (
1096 New_Occurrence_Of (E, Loc),
1097 Relocate_Node (Expr)),
1098 Pragma_Identifier =>
1099 Make_Identifier (Sloc (Id), Chars (Id)));
1101 -- We don't have to play the delay game here, since the only
1102 -- values are check names which don't get analyzed anyway.
1104 pragma Assert (not Delay_Required);
1106 -- Aspects corresponding to pragmas with two arguments, where
1107 -- the second argument is a local name referring to the entity,
1108 -- and the first argument is the aspect definition expression.
1110 when Aspect_Warnings =>
1112 -- Construct the pragma
1116 Pragma_Argument_Associations => New_List (
1117 Relocate_Node (Expr),
1118 New_Occurrence_Of (E, Loc)),
1119 Pragma_Identifier =>
1120 Make_Identifier (Sloc (Id), Chars (Id)),
1121 Class_Present => Class_Present (Aspect));
1123 -- We don't have to play the delay game here, since the only
1124 -- values are ON/OFF which don't get analyzed anyway.
1126 pragma Assert (not Delay_Required);
1128 -- Default_Value and Default_Component_Value aspects. These
1129 -- are specially handled because they have no corresponding
1130 -- pragmas or attributes.
1132 when Aspect_Default_Value | Aspect_Default_Component_Value =>
1133 Error_Msg_Name_1 := Chars (Id);
1135 if not Is_Type (E) then
1136 Error_Msg_N ("aspect% can only apply to a type", Id);
1139 elsif not Is_First_Subtype (E) then
1140 Error_Msg_N ("aspect% cannot apply to subtype", Id);
1143 elsif A_Id = Aspect_Default_Value
1144 and then not Is_Scalar_Type (E)
1147 ("aspect% can only be applied to scalar type", Id);
1150 elsif A_Id = Aspect_Default_Component_Value then
1151 if not Is_Array_Type (E) then
1153 ("aspect% can only be applied to array type", Id);
1155 elsif not Is_Scalar_Type (Component_Type (E)) then
1157 ("aspect% requires scalar components", Id);
1163 Delay_Required := True;
1164 Set_Is_Delayed_Aspect (Aspect);
1165 Set_Has_Default_Aspect (Base_Type (Entity (Ent)));
1167 when Aspect_Attach_Handler =>
1170 Pragma_Identifier =>
1171 Make_Identifier (Sloc (Id), Name_Attach_Handler),
1172 Pragma_Argument_Associations =>
1173 New_List (Ent, Relocate_Node (Expr)));
1175 Set_From_Aspect_Specification (Aitem, True);
1176 Set_Corresponding_Aspect (Aitem, Aspect);
1178 pragma Assert (not Delay_Required);
1180 when Aspect_Priority |
1181 Aspect_Interrupt_Priority |
1182 Aspect_Dispatching_Domain |
1188 if A_Id = Aspect_Priority then
1189 Pname := Name_Priority;
1191 elsif A_Id = Aspect_Interrupt_Priority then
1192 Pname := Name_Interrupt_Priority;
1194 elsif A_Id = Aspect_CPU then
1198 Pname := Name_Dispatching_Domain;
1203 Pragma_Identifier =>
1204 Make_Identifier (Sloc (Id), Pname),
1205 Pragma_Argument_Associations =>
1207 (Make_Pragma_Argument_Association
1209 Expression => Relocate_Node (Expr))));
1211 Set_From_Aspect_Specification (Aitem, True);
1212 Set_Corresponding_Aspect (Aitem, Aspect);
1214 pragma Assert (not Delay_Required);
1217 -- Aspects Pre/Post generate Precondition/Postcondition pragmas
1218 -- with a first argument that is the expression, and a second
1219 -- argument that is an informative message if the test fails.
1220 -- This is inserted right after the declaration, to get the
1221 -- required pragma placement. The processing for the pragmas
1222 -- takes care of the required delay.
1224 when Pre_Post_Aspects => declare
1228 if A_Id = Aspect_Pre or else A_Id = Aspect_Precondition then
1229 Pname := Name_Precondition;
1231 Pname := Name_Postcondition;
1234 -- If the expressions is of the form A and then B, then
1235 -- we generate separate Pre/Post aspects for the separate
1236 -- clauses. Since we allow multiple pragmas, there is no
1237 -- problem in allowing multiple Pre/Post aspects internally.
1238 -- These should be treated in reverse order (B first and
1239 -- A second) since they are later inserted just after N in
1240 -- the order they are treated. This way, the pragma for A
1241 -- ends up preceding the pragma for B, which may have an
1242 -- importance for the error raised (either constraint error
1243 -- or precondition error).
1245 -- We do not do this for Pre'Class, since we have to put
1246 -- these conditions together in a complex OR expression
1248 -- We do not do this in ASIS mode, as ASIS relies on the
1249 -- original node representing the complete expression, when
1250 -- retrieving it through the source aspect table.
1253 and then (Pname = Name_Postcondition
1254 or else not Class_Present (Aspect))
1256 while Nkind (Expr) = N_And_Then loop
1257 Insert_After (Aspect,
1258 Make_Aspect_Specification (Sloc (Left_Opnd (Expr)),
1259 Identifier => Identifier (Aspect),
1260 Expression => Relocate_Node (Left_Opnd (Expr)),
1261 Class_Present => Class_Present (Aspect),
1262 Split_PPC => True));
1263 Rewrite (Expr, Relocate_Node (Right_Opnd (Expr)));
1264 Eloc := Sloc (Expr);
1268 -- Build the precondition/postcondition pragma
1272 Pragma_Identifier =>
1273 Make_Identifier (Sloc (Id), Pname),
1274 Class_Present => Class_Present (Aspect),
1275 Split_PPC => Split_PPC (Aspect),
1276 Pragma_Argument_Associations => New_List (
1277 Make_Pragma_Argument_Association (Eloc,
1278 Chars => Name_Check,
1279 Expression => Relocate_Node (Expr))));
1281 -- Add message unless exception messages are suppressed
1283 if not Opt.Exception_Locations_Suppressed then
1284 Append_To (Pragma_Argument_Associations (Aitem),
1285 Make_Pragma_Argument_Association (Eloc,
1286 Chars => Name_Message,
1288 Make_String_Literal (Eloc,
1290 & Get_Name_String (Pname)
1292 & Build_Location_String (Eloc))));
1295 Set_From_Aspect_Specification (Aitem, True);
1296 Set_Corresponding_Aspect (Aitem, Aspect);
1297 Set_Is_Delayed_Aspect (Aspect);
1299 -- For Pre/Post cases, insert immediately after the entity
1300 -- declaration, since that is the required pragma placement.
1301 -- Note that for these aspects, we do not have to worry
1302 -- about delay issues, since the pragmas themselves deal
1303 -- with delay of visibility for the expression analysis.
1305 -- If the entity is a library-level subprogram, the pre/
1306 -- postconditions must be treated as late pragmas.
1308 if Nkind (Parent (N)) = N_Compilation_Unit then
1309 Add_Global_Declaration (Aitem);
1311 Insert_After (N, Aitem);
1317 -- Invariant aspects generate a corresponding pragma with a
1318 -- first argument that is the entity, a second argument that is
1319 -- the expression and a third argument that is an appropriate
1320 -- message. This is inserted right after the declaration, to
1321 -- get the required pragma placement. The pragma processing
1322 -- takes care of the required delay.
1324 when Aspect_Invariant |
1325 Aspect_Type_Invariant =>
1327 -- Analysis of the pragma will verify placement legality:
1328 -- an invariant must apply to a private type, or appear in
1329 -- the private part of a spec and apply to a completion.
1331 -- Construct the pragma
1335 Pragma_Argument_Associations =>
1336 New_List (Ent, Relocate_Node (Expr)),
1337 Class_Present => Class_Present (Aspect),
1338 Pragma_Identifier =>
1339 Make_Identifier (Sloc (Id), Name_Invariant));
1341 -- Add message unless exception messages are suppressed
1343 if not Opt.Exception_Locations_Suppressed then
1344 Append_To (Pragma_Argument_Associations (Aitem),
1345 Make_Pragma_Argument_Association (Eloc,
1346 Chars => Name_Message,
1348 Make_String_Literal (Eloc,
1349 Strval => "failed invariant from "
1350 & Build_Location_String (Eloc))));
1353 Set_From_Aspect_Specification (Aitem, True);
1354 Set_Corresponding_Aspect (Aitem, Aspect);
1355 Set_Is_Delayed_Aspect (Aspect);
1357 -- For Invariant case, insert immediately after the entity
1358 -- declaration. We do not have to worry about delay issues
1359 -- since the pragma processing takes care of this.
1361 Insert_After (N, Aitem);
1364 -- Predicate aspects generate a corresponding pragma with a
1365 -- first argument that is the entity, and the second argument
1366 -- is the expression.
1368 when Aspect_Dynamic_Predicate |
1370 Aspect_Static_Predicate =>
1372 -- Construct the pragma (always a pragma Predicate, with
1373 -- flags recording whether it is static/dynamic).
1377 Pragma_Argument_Associations =>
1378 New_List (Ent, Relocate_Node (Expr)),
1379 Class_Present => Class_Present (Aspect),
1380 Pragma_Identifier =>
1381 Make_Identifier (Sloc (Id), Name_Predicate));
1383 Set_From_Aspect_Specification (Aitem, True);
1384 Set_Corresponding_Aspect (Aitem, Aspect);
1386 -- Make sure we have a freeze node (it might otherwise be
1387 -- missing in cases like subtype X is Y, and we would not
1388 -- have a place to build the predicate function).
1390 Set_Has_Predicates (E);
1392 if Is_Private_Type (E)
1393 and then Present (Full_View (E))
1395 Set_Has_Predicates (Full_View (E));
1396 Set_Has_Delayed_Aspects (Full_View (E));
1399 Ensure_Freeze_Node (E);
1400 Set_Is_Delayed_Aspect (Aspect);
1401 Delay_Required := True;
1403 when Aspect_Test_Case => declare
1405 Comp_Expr : Node_Id;
1406 Comp_Assn : Node_Id;
1412 if Nkind (Parent (N)) = N_Compilation_Unit then
1414 ("incorrect placement of aspect `Test_Case`", E);
1418 if Nkind (Expr) /= N_Aggregate then
1420 ("wrong syntax for aspect `Test_Case` for &", Id, E);
1424 -- Make pragma expressions refer to the original aspect
1425 -- expressions through the Original_Node link. This is used
1426 -- in semantic analysis for ASIS mode, so that the original
1427 -- expression also gets analyzed.
1429 Comp_Expr := First (Expressions (Expr));
1430 while Present (Comp_Expr) loop
1431 New_Expr := Relocate_Node (Comp_Expr);
1432 Set_Original_Node (New_Expr, Comp_Expr);
1434 (Make_Pragma_Argument_Association (Sloc (Comp_Expr),
1435 Expression => New_Expr),
1440 Comp_Assn := First (Component_Associations (Expr));
1441 while Present (Comp_Assn) loop
1442 if List_Length (Choices (Comp_Assn)) /= 1
1444 Nkind (First (Choices (Comp_Assn))) /= N_Identifier
1447 ("wrong syntax for aspect `Test_Case` for &", Id, E);
1451 New_Expr := Relocate_Node (Expression (Comp_Assn));
1452 Set_Original_Node (New_Expr, Expression (Comp_Assn));
1453 Append (Make_Pragma_Argument_Association (
1454 Sloc => Sloc (Comp_Assn),
1455 Chars => Chars (First (Choices (Comp_Assn))),
1456 Expression => New_Expr),
1461 -- Build the test-case pragma
1465 Pragma_Identifier =>
1466 Make_Identifier (Sloc (Id), Name_Test_Case),
1467 Pragma_Argument_Associations =>
1470 Set_From_Aspect_Specification (Aitem, True);
1471 Set_Corresponding_Aspect (Aitem, Aspect);
1472 Set_Is_Delayed_Aspect (Aspect);
1474 -- Insert immediately after the entity declaration
1476 Insert_After (N, Aitem);
1481 when Aspect_Dimension =>
1482 Analyze_Aspect_Dimension (N, Id, Expr);
1485 when Aspect_Dimension_System =>
1486 Analyze_Aspect_Dimension_System (N, Id, Expr);
1491 -- If a delay is required, we delay the freeze (not much point in
1492 -- delaying the aspect if we don't delay the freeze!). The pragma
1493 -- or attribute clause if there is one is then attached to the
1494 -- aspect specification which is placed in the rep item list.
1496 if Delay_Required then
1497 if Present (Aitem) then
1498 Set_From_Aspect_Specification (Aitem, True);
1500 if Nkind (Aitem) = N_Pragma then
1501 Set_Corresponding_Aspect (Aitem, Aspect);
1504 Set_Is_Delayed_Aspect (Aitem);
1505 Set_Aspect_Rep_Item (Aspect, Aitem);
1508 Ensure_Freeze_Node (E);
1509 Set_Has_Delayed_Aspects (E);
1510 Record_Rep_Item (E, Aspect);
1512 -- If no delay required, insert the pragma/clause in the tree
1515 Set_From_Aspect_Specification (Aitem, True);
1517 if Nkind (Aitem) = N_Pragma then
1518 Set_Corresponding_Aspect (Aitem, Aspect);
1521 -- If this is a compilation unit, we will put the pragma in
1522 -- the Pragmas_After list of the N_Compilation_Unit_Aux node.
1524 if Nkind (Parent (Ins_Node)) = N_Compilation_Unit then
1526 Aux : constant Node_Id :=
1527 Aux_Decls_Node (Parent (Ins_Node));
1530 pragma Assert (Nkind (Aux) = N_Compilation_Unit_Aux);
1532 if No (Pragmas_After (Aux)) then
1533 Set_Pragmas_After (Aux, Empty_List);
1536 -- For Pre_Post put at start of list, otherwise at end
1538 if A_Id in Pre_Post_Aspects then
1539 Prepend (Aitem, Pragmas_After (Aux));
1541 Append (Aitem, Pragmas_After (Aux));
1545 -- Here if not compilation unit case
1550 -- For Pre/Post cases, insert immediately after the
1551 -- entity declaration, since that is the required pragma
1554 when Pre_Post_Aspects =>
1555 Insert_After (N, Aitem);
1557 -- For Priority aspects, insert into the task or
1558 -- protected definition, which we need to create if it's
1559 -- not there. The same applies to CPU and
1560 -- Dispatching_Domain but only to tasks.
1562 when Aspect_Priority |
1563 Aspect_Interrupt_Priority |
1564 Aspect_Dispatching_Domain |
1567 T : Node_Id; -- the type declaration
1568 L : List_Id; -- list of decls of task/protected
1571 if Nkind (N) = N_Object_Declaration then
1572 T := Parent (Etype (Defining_Identifier (N)));
1577 if Nkind (T) = N_Protected_Type_Declaration
1578 and then A_Id /= Aspect_Dispatching_Domain
1579 and then A_Id /= Aspect_CPU
1582 (Present (Protected_Definition (T)));
1584 L := Visible_Declarations
1585 (Protected_Definition (T));
1587 elsif Nkind (T) = N_Task_Type_Declaration then
1588 if No (Task_Definition (T)) then
1591 Make_Task_Definition
1593 Visible_Declarations => New_List,
1594 End_Label => Empty));
1597 L := Visible_Declarations (Task_Definition (T));
1600 raise Program_Error;
1603 Prepend (Aitem, To => L);
1605 -- Analyze rewritten pragma. Otherwise, its
1606 -- analysis is done too late, after the task or
1607 -- protected object has been created.
1612 -- For all other cases, insert in sequence
1615 Insert_After (Ins_Node, Aitem);
1624 end loop Aspect_Loop;
1625 end Analyze_Aspect_Specifications;
1627 -----------------------
1628 -- Analyze_At_Clause --
1629 -----------------------
1631 -- An at clause is replaced by the corresponding Address attribute
1632 -- definition clause that is the preferred approach in Ada 95.
1634 procedure Analyze_At_Clause (N : Node_Id) is
1635 CS : constant Boolean := Comes_From_Source (N);
1638 -- This is an obsolescent feature
1640 Check_Restriction (No_Obsolescent_Features, N);
1642 if Warn_On_Obsolescent_Feature then
1644 ("at clause is an obsolescent feature (RM J.7(2))?", N);
1646 ("\use address attribute definition clause instead?", N);
1649 -- Rewrite as address clause
1652 Make_Attribute_Definition_Clause (Sloc (N),
1653 Name => Identifier (N),
1654 Chars => Name_Address,
1655 Expression => Expression (N)));
1657 -- We preserve Comes_From_Source, since logically the clause still
1658 -- comes from the source program even though it is changed in form.
1660 Set_Comes_From_Source (N, CS);
1662 -- Analyze rewritten clause
1664 Analyze_Attribute_Definition_Clause (N);
1665 end Analyze_At_Clause;
1667 -----------------------------------------
1668 -- Analyze_Attribute_Definition_Clause --
1669 -----------------------------------------
1671 procedure Analyze_Attribute_Definition_Clause (N : Node_Id) is
1672 Loc : constant Source_Ptr := Sloc (N);
1673 Nam : constant Node_Id := Name (N);
1674 Attr : constant Name_Id := Chars (N);
1675 Expr : constant Node_Id := Expression (N);
1676 Id : constant Attribute_Id := Get_Attribute_Id (Attr);
1679 -- The entity of Nam after it is analyzed. In the case of an incomplete
1680 -- type, this is the underlying type.
1683 -- The underlying entity to which the attribute applies. Generally this
1684 -- is the Underlying_Type of Ent, except in the case where the clause
1685 -- applies to full view of incomplete type or private type in which case
1686 -- U_Ent is just a copy of Ent.
1688 FOnly : Boolean := False;
1689 -- Reset to True for subtype specific attribute (Alignment, Size)
1690 -- and for stream attributes, i.e. those cases where in the call
1691 -- to Rep_Item_Too_Late, FOnly is set True so that only the freezing
1692 -- rules are checked. Note that the case of stream attributes is not
1693 -- clear from the RM, but see AI95-00137. Also, the RM seems to
1694 -- disallow Storage_Size for derived task types, but that is also
1695 -- clearly unintentional.
1697 procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type);
1698 -- Common processing for 'Read, 'Write, 'Input and 'Output attribute
1699 -- definition clauses.
1701 function Duplicate_Clause return Boolean;
1702 -- This routine checks if the aspect for U_Ent being given by attribute
1703 -- definition clause N is for an aspect that has already been specified,
1704 -- and if so gives an error message. If there is a duplicate, True is
1705 -- returned, otherwise if there is no error, False is returned.
1707 procedure Check_Indexing_Functions;
1708 -- Check that the function in Constant_Indexing or Variable_Indexing
1709 -- attribute has the proper type structure. If the name is overloaded,
1710 -- check that all interpretations are legal.
1712 procedure Check_Iterator_Functions;
1713 -- Check that there is a single function in Default_Iterator attribute
1714 -- has the proper type structure.
1716 function Check_Primitive_Function (Subp : Entity_Id) return Boolean;
1717 -- Common legality check for the previous two
1719 -----------------------------------
1720 -- Analyze_Stream_TSS_Definition --
1721 -----------------------------------
1723 procedure Analyze_Stream_TSS_Definition (TSS_Nam : TSS_Name_Type) is
1724 Subp : Entity_Id := Empty;
1729 Is_Read : constant Boolean := (TSS_Nam = TSS_Stream_Read);
1730 -- True for Read attribute, false for other attributes
1732 function Has_Good_Profile (Subp : Entity_Id) return Boolean;
1733 -- Return true if the entity is a subprogram with an appropriate
1734 -- profile for the attribute being defined.
1736 ----------------------
1737 -- Has_Good_Profile --
1738 ----------------------
1740 function Has_Good_Profile (Subp : Entity_Id) return Boolean is
1742 Is_Function : constant Boolean := (TSS_Nam = TSS_Stream_Input);
1743 Expected_Ekind : constant array (Boolean) of Entity_Kind :=
1744 (False => E_Procedure, True => E_Function);
1748 if Ekind (Subp) /= Expected_Ekind (Is_Function) then
1752 F := First_Formal (Subp);
1755 or else Ekind (Etype (F)) /= E_Anonymous_Access_Type
1756 or else Designated_Type (Etype (F)) /=
1757 Class_Wide_Type (RTE (RE_Root_Stream_Type))
1762 if not Is_Function then
1766 Expected_Mode : constant array (Boolean) of Entity_Kind :=
1767 (False => E_In_Parameter,
1768 True => E_Out_Parameter);
1770 if Parameter_Mode (F) /= Expected_Mode (Is_Read) then
1778 Typ := Etype (Subp);
1781 return Base_Type (Typ) = Base_Type (Ent)
1782 and then No (Next_Formal (F));
1783 end Has_Good_Profile;
1785 -- Start of processing for Analyze_Stream_TSS_Definition
1790 if not Is_Type (U_Ent) then
1791 Error_Msg_N ("local name must be a subtype", Nam);
1795 Pnam := TSS (Base_Type (U_Ent), TSS_Nam);
1797 -- If Pnam is present, it can be either inherited from an ancestor
1798 -- type (in which case it is legal to redefine it for this type), or
1799 -- be a previous definition of the attribute for the same type (in
1800 -- which case it is illegal).
1802 -- In the first case, it will have been analyzed already, and we
1803 -- can check that its profile does not match the expected profile
1804 -- for a stream attribute of U_Ent. In the second case, either Pnam
1805 -- has been analyzed (and has the expected profile), or it has not
1806 -- been analyzed yet (case of a type that has not been frozen yet
1807 -- and for which the stream attribute has been set using Set_TSS).
1810 and then (No (First_Entity (Pnam)) or else Has_Good_Profile (Pnam))
1812 Error_Msg_Sloc := Sloc (Pnam);
1813 Error_Msg_Name_1 := Attr;
1814 Error_Msg_N ("% attribute already defined #", Nam);
1820 if Is_Entity_Name (Expr) then
1821 if not Is_Overloaded (Expr) then
1822 if Has_Good_Profile (Entity (Expr)) then
1823 Subp := Entity (Expr);
1827 Get_First_Interp (Expr, I, It);
1828 while Present (It.Nam) loop
1829 if Has_Good_Profile (It.Nam) then
1834 Get_Next_Interp (I, It);
1839 if Present (Subp) then
1840 if Is_Abstract_Subprogram (Subp) then
1841 Error_Msg_N ("stream subprogram must not be abstract", Expr);
1845 Set_Entity (Expr, Subp);
1846 Set_Etype (Expr, Etype (Subp));
1848 New_Stream_Subprogram (N, U_Ent, Subp, TSS_Nam);
1851 Error_Msg_Name_1 := Attr;
1852 Error_Msg_N ("incorrect expression for% attribute", Expr);
1854 end Analyze_Stream_TSS_Definition;
1856 ------------------------------
1857 -- Check_Indexing_Functions --
1858 ------------------------------
1860 procedure Check_Indexing_Functions is
1862 procedure Check_One_Function (Subp : Entity_Id);
1863 -- Check one possible interpretation
1865 ------------------------
1866 -- Check_One_Function --
1867 ------------------------
1869 procedure Check_One_Function (Subp : Entity_Id) is
1870 Default_Element : constant Node_Id :=
1872 (Etype (First_Formal (Subp)),
1873 Aspect_Iterator_Element);
1876 if not Check_Primitive_Function (Subp) then
1878 ("aspect Indexing requires a function that applies to type&",
1882 -- An indexing function must return either the default element of
1883 -- the container, or a reference type.
1885 if Present (Default_Element) then
1886 Analyze (Default_Element);
1887 if Is_Entity_Name (Default_Element)
1888 and then Covers (Entity (Default_Element), Etype (Subp))
1894 -- Otherwise the return type must be a reference type.
1896 if not Has_Implicit_Dereference (Etype (Subp)) then
1898 ("function for indexing must return a reference type", Subp);
1900 end Check_One_Function;
1902 -- Start of processing for Check_Indexing_Functions
1911 if not Is_Overloaded (Expr) then
1912 Check_One_Function (Entity (Expr));
1920 Get_First_Interp (Expr, I, It);
1921 while Present (It.Nam) loop
1923 -- Note that analysis will have added the interpretation
1924 -- that corresponds to the dereference. We only check the
1925 -- subprogram itself.
1927 if Is_Overloadable (It.Nam) then
1928 Check_One_Function (It.Nam);
1931 Get_Next_Interp (I, It);
1935 end Check_Indexing_Functions;
1937 ------------------------------
1938 -- Check_Iterator_Functions --
1939 ------------------------------
1941 procedure Check_Iterator_Functions is
1942 Default : Entity_Id;
1944 function Valid_Default_Iterator (Subp : Entity_Id) return Boolean;
1945 -- Check one possible interpretation for validity
1947 ----------------------------
1948 -- Valid_Default_Iterator --
1949 ----------------------------
1951 function Valid_Default_Iterator (Subp : Entity_Id) return Boolean is
1955 if not Check_Primitive_Function (Subp) then
1958 Formal := First_Formal (Subp);
1961 -- False if any subsequent formal has no default expression
1963 Formal := Next_Formal (Formal);
1964 while Present (Formal) loop
1965 if No (Expression (Parent (Formal))) then
1969 Next_Formal (Formal);
1972 -- True if all subsequent formals have default expressions
1975 end Valid_Default_Iterator;
1977 -- Start of processing for Check_Iterator_Functions
1982 if not Is_Entity_Name (Expr) then
1983 Error_Msg_N ("aspect Iterator must be a function name", Expr);
1986 if not Is_Overloaded (Expr) then
1987 if not Check_Primitive_Function (Entity (Expr)) then
1989 ("aspect Indexing requires a function that applies to type&",
1990 Entity (Expr), Ent);
1993 if not Valid_Default_Iterator (Entity (Expr)) then
1994 Error_Msg_N ("improper function for default iterator", Expr);
2004 Get_First_Interp (Expr, I, It);
2005 while Present (It.Nam) loop
2006 if not Check_Primitive_Function (It.Nam)
2007 or else not Valid_Default_Iterator (It.Nam)
2011 elsif Present (Default) then
2012 Error_Msg_N ("default iterator must be unique", Expr);
2018 Get_Next_Interp (I, It);
2022 if Present (Default) then
2023 Set_Entity (Expr, Default);
2024 Set_Is_Overloaded (Expr, False);
2027 end Check_Iterator_Functions;
2029 -------------------------------
2030 -- Check_Primitive_Function --
2031 -------------------------------
2033 function Check_Primitive_Function (Subp : Entity_Id) return Boolean is
2037 if Ekind (Subp) /= E_Function then
2041 if No (First_Formal (Subp)) then
2044 Ctrl := Etype (First_Formal (Subp));
2048 or else Ctrl = Class_Wide_Type (Ent)
2050 (Ekind (Ctrl) = E_Anonymous_Access_Type
2052 (Designated_Type (Ctrl) = Ent
2053 or else Designated_Type (Ctrl) = Class_Wide_Type (Ent)))
2062 end Check_Primitive_Function;
2064 ----------------------
2065 -- Duplicate_Clause --
2066 ----------------------
2068 function Duplicate_Clause return Boolean is
2072 -- Nothing to do if this attribute definition clause comes from
2073 -- an aspect specification, since we could not be duplicating an
2074 -- explicit clause, and we dealt with the case of duplicated aspects
2075 -- in Analyze_Aspect_Specifications.
2077 if From_Aspect_Specification (N) then
2081 -- Otherwise current clause may duplicate previous clause or a
2082 -- previously given aspect specification for the same aspect.
2084 A := Get_Rep_Item_For_Entity (U_Ent, Chars (N));
2087 if Entity (A) = U_Ent then
2088 Error_Msg_Name_1 := Chars (N);
2089 Error_Msg_Sloc := Sloc (A);
2090 Error_Msg_NE ("aspect% for & previously given#", N, U_Ent);
2096 end Duplicate_Clause;
2098 -- Start of processing for Analyze_Attribute_Definition_Clause
2101 -- The following code is a defense against recursion. Not clear that
2102 -- this can happen legitimately, but perhaps some error situations
2103 -- can cause it, and we did see this recursion during testing.
2105 if Analyzed (N) then
2108 Set_Analyzed (N, True);
2111 -- Ignore some selected attributes in CodePeer mode since they are not
2112 -- relevant in this context.
2114 if CodePeer_Mode then
2117 -- Ignore Component_Size in CodePeer mode, to avoid changing the
2118 -- internal representation of types by implicitly packing them.
2120 when Attribute_Component_Size =>
2121 Rewrite (N, Make_Null_Statement (Sloc (N)));
2129 -- Process Ignore_Rep_Clauses option
2131 if Ignore_Rep_Clauses then
2134 -- The following should be ignored. They do not affect legality
2135 -- and may be target dependent. The basic idea of -gnatI is to
2136 -- ignore any rep clauses that may be target dependent but do not
2137 -- affect legality (except possibly to be rejected because they
2138 -- are incompatible with the compilation target).
2140 when Attribute_Alignment |
2141 Attribute_Bit_Order |
2142 Attribute_Component_Size |
2143 Attribute_Machine_Radix |
2144 Attribute_Object_Size |
2146 Attribute_Stream_Size |
2147 Attribute_Value_Size =>
2148 Rewrite (N, Make_Null_Statement (Sloc (N)));
2151 -- Perhaps 'Small should not be ignored by Ignore_Rep_Clauses ???
2153 when Attribute_Small =>
2154 if Ignore_Rep_Clauses then
2155 Rewrite (N, Make_Null_Statement (Sloc (N)));
2159 -- The following should not be ignored, because in the first place
2160 -- they are reasonably portable, and should not cause problems in
2161 -- compiling code from another target, and also they do affect
2162 -- legality, e.g. failing to provide a stream attribute for a
2163 -- type may make a program illegal.
2165 when Attribute_External_Tag |
2169 Attribute_Storage_Pool |
2170 Attribute_Storage_Size |
2174 -- Other cases are errors ("attribute& cannot be set with
2175 -- definition clause"), which will be caught below.
2183 Ent := Entity (Nam);
2185 if Rep_Item_Too_Early (Ent, N) then
2189 -- Rep clause applies to full view of incomplete type or private type if
2190 -- we have one (if not, this is a premature use of the type). However,
2191 -- certain semantic checks need to be done on the specified entity (i.e.
2192 -- the private view), so we save it in Ent.
2194 if Is_Private_Type (Ent)
2195 and then Is_Derived_Type (Ent)
2196 and then not Is_Tagged_Type (Ent)
2197 and then No (Full_View (Ent))
2199 -- If this is a private type whose completion is a derivation from
2200 -- another private type, there is no full view, and the attribute
2201 -- belongs to the type itself, not its underlying parent.
2205 elsif Ekind (Ent) = E_Incomplete_Type then
2207 -- The attribute applies to the full view, set the entity of the
2208 -- attribute definition accordingly.
2210 Ent := Underlying_Type (Ent);
2212 Set_Entity (Nam, Ent);
2215 U_Ent := Underlying_Type (Ent);
2218 -- Avoid cascaded error
2220 if Etype (Nam) = Any_Type then
2223 -- Must be declared in current scope
2225 elsif Scope (Ent) /= Current_Scope then
2226 Error_Msg_N ("entity must be declared in this scope", Nam);
2229 -- Must not be a source renaming (we do have some cases where the
2230 -- expander generates a renaming, and those cases are OK, in such
2231 -- cases any attribute applies to the renamed object as well).
2233 elsif Is_Object (Ent)
2234 and then Present (Renamed_Object (Ent))
2236 -- Case of renamed object from source, this is an error
2238 if Comes_From_Source (Renamed_Object (Ent)) then
2239 Get_Name_String (Chars (N));
2240 Error_Msg_Strlen := Name_Len;
2241 Error_Msg_String (1 .. Name_Len) := Name_Buffer (1 .. Name_Len);
2243 ("~ clause not allowed for a renaming declaration "
2244 & "(RM 13.1(6))", Nam);
2247 -- For the case of a compiler generated renaming, the attribute
2248 -- definition clause applies to the renamed object created by the
2249 -- expander. The easiest general way to handle this is to create a
2250 -- copy of the attribute definition clause for this object.
2254 Make_Attribute_Definition_Clause (Loc,
2256 New_Occurrence_Of (Entity (Renamed_Object (Ent)), Loc),
2258 Expression => Duplicate_Subexpr (Expression (N))));
2261 -- If no underlying entity, use entity itself, applies to some
2262 -- previously detected error cases ???
2264 elsif No (U_Ent) then
2267 -- Cannot specify for a subtype (exception Object/Value_Size)
2269 elsif Is_Type (U_Ent)
2270 and then not Is_First_Subtype (U_Ent)
2271 and then Id /= Attribute_Object_Size
2272 and then Id /= Attribute_Value_Size
2273 and then not From_At_Mod (N)
2275 Error_Msg_N ("cannot specify attribute for subtype", Nam);
2279 Set_Entity (N, U_Ent);
2281 -- Switch on particular attribute
2289 -- Address attribute definition clause
2291 when Attribute_Address => Address : begin
2293 -- A little error check, catch for X'Address use X'Address;
2295 if Nkind (Nam) = N_Identifier
2296 and then Nkind (Expr) = N_Attribute_Reference
2297 and then Attribute_Name (Expr) = Name_Address
2298 and then Nkind (Prefix (Expr)) = N_Identifier
2299 and then Chars (Nam) = Chars (Prefix (Expr))
2302 ("address for & is self-referencing", Prefix (Expr), Ent);
2306 -- Not that special case, carry on with analysis of expression
2308 Analyze_And_Resolve (Expr, RTE (RE_Address));
2310 -- Even when ignoring rep clauses we need to indicate that the
2311 -- entity has an address clause and thus it is legal to declare
2314 if Ignore_Rep_Clauses then
2315 if Ekind_In (U_Ent, E_Variable, E_Constant) then
2316 Record_Rep_Item (U_Ent, N);
2322 if Duplicate_Clause then
2325 -- Case of address clause for subprogram
2327 elsif Is_Subprogram (U_Ent) then
2328 if Has_Homonym (U_Ent) then
2330 ("address clause cannot be given " &
2331 "for overloaded subprogram",
2336 -- For subprograms, all address clauses are permitted, and we
2337 -- mark the subprogram as having a deferred freeze so that Gigi
2338 -- will not elaborate it too soon.
2340 -- Above needs more comments, what is too soon about???
2342 Set_Has_Delayed_Freeze (U_Ent);
2344 -- Case of address clause for entry
2346 elsif Ekind (U_Ent) = E_Entry then
2347 if Nkind (Parent (N)) = N_Task_Body then
2349 ("entry address must be specified in task spec", Nam);
2353 -- For entries, we require a constant address
2355 Check_Constant_Address_Clause (Expr, U_Ent);
2357 -- Special checks for task types
2359 if Is_Task_Type (Scope (U_Ent))
2360 and then Comes_From_Source (Scope (U_Ent))
2363 ("?entry address declared for entry in task type", N);
2365 ("\?only one task can be declared of this type", N);
2368 -- Entry address clauses are obsolescent
2370 Check_Restriction (No_Obsolescent_Features, N);
2372 if Warn_On_Obsolescent_Feature then
2374 ("attaching interrupt to task entry is an " &
2375 "obsolescent feature (RM J.7.1)?", N);
2377 ("\use interrupt procedure instead?", N);
2380 -- Case of an address clause for a controlled object which we
2381 -- consider to be erroneous.
2383 elsif Is_Controlled (Etype (U_Ent))
2384 or else Has_Controlled_Component (Etype (U_Ent))
2387 ("?controlled object& must not be overlaid", Nam, U_Ent);
2389 ("\?Program_Error will be raised at run time", Nam);
2390 Insert_Action (Declaration_Node (U_Ent),
2391 Make_Raise_Program_Error (Loc,
2392 Reason => PE_Overlaid_Controlled_Object));
2395 -- Case of address clause for a (non-controlled) object
2398 Ekind (U_Ent) = E_Variable
2400 Ekind (U_Ent) = E_Constant
2403 Expr : constant Node_Id := Expression (N);
2408 -- Exported variables cannot have an address clause, because
2409 -- this cancels the effect of the pragma Export.
2411 if Is_Exported (U_Ent) then
2413 ("cannot export object with address clause", Nam);
2417 Find_Overlaid_Entity (N, O_Ent, Off);
2419 -- Overlaying controlled objects is erroneous
2422 and then (Has_Controlled_Component (Etype (O_Ent))
2423 or else Is_Controlled (Etype (O_Ent)))
2426 ("?cannot overlay with controlled object", Expr);
2428 ("\?Program_Error will be raised at run time", Expr);
2429 Insert_Action (Declaration_Node (U_Ent),
2430 Make_Raise_Program_Error (Loc,
2431 Reason => PE_Overlaid_Controlled_Object));
2434 elsif Present (O_Ent)
2435 and then Ekind (U_Ent) = E_Constant
2436 and then not Is_Constant_Object (O_Ent)
2438 Error_Msg_N ("constant overlays a variable?", Expr);
2440 -- Imported variables can have an address clause, but then
2441 -- the import is pretty meaningless except to suppress
2442 -- initializations, so we do not need such variables to
2443 -- be statically allocated (and in fact it causes trouble
2444 -- if the address clause is a local value).
2446 elsif Is_Imported (U_Ent) then
2447 Set_Is_Statically_Allocated (U_Ent, False);
2450 -- We mark a possible modification of a variable with an
2451 -- address clause, since it is likely aliasing is occurring.
2453 Note_Possible_Modification (Nam, Sure => False);
2455 -- Here we are checking for explicit overlap of one variable
2456 -- by another, and if we find this then mark the overlapped
2457 -- variable as also being volatile to prevent unwanted
2458 -- optimizations. This is a significant pessimization so
2459 -- avoid it when there is an offset, i.e. when the object
2460 -- is composite; they cannot be optimized easily anyway.
2463 and then Is_Object (O_Ent)
2466 Set_Treat_As_Volatile (O_Ent);
2469 -- Legality checks on the address clause for initialized
2470 -- objects is deferred until the freeze point, because
2471 -- a subsequent pragma might indicate that the object is
2472 -- imported and thus not initialized.
2474 Set_Has_Delayed_Freeze (U_Ent);
2476 -- If an initialization call has been generated for this
2477 -- object, it needs to be deferred to after the freeze node
2478 -- we have just now added, otherwise GIGI will see a
2479 -- reference to the variable (as actual to the IP call)
2480 -- before its definition.
2483 Init_Call : constant Node_Id := Find_Init_Call (U_Ent, N);
2485 if Present (Init_Call) then
2487 Append_Freeze_Action (U_Ent, Init_Call);
2491 if Is_Exported (U_Ent) then
2493 ("& cannot be exported if an address clause is given",
2496 ("\define and export a variable " &
2497 "that holds its address instead",
2501 -- Entity has delayed freeze, so we will generate an
2502 -- alignment check at the freeze point unless suppressed.
2504 if not Range_Checks_Suppressed (U_Ent)
2505 and then not Alignment_Checks_Suppressed (U_Ent)
2507 Set_Check_Address_Alignment (N);
2510 -- Kill the size check code, since we are not allocating
2511 -- the variable, it is somewhere else.
2513 Kill_Size_Check_Code (U_Ent);
2515 -- If the address clause is of the form:
2517 -- for Y'Address use X'Address
2521 -- Const : constant Address := X'Address;
2523 -- for Y'Address use Const;
2525 -- then we make an entry in the table for checking the size
2526 -- and alignment of the overlaying variable. We defer this
2527 -- check till after code generation to take full advantage
2528 -- of the annotation done by the back end. This entry is
2529 -- only made if the address clause comes from source.
2531 -- If the entity has a generic type, the check will be
2532 -- performed in the instance if the actual type justifies
2533 -- it, and we do not insert the clause in the table to
2534 -- prevent spurious warnings.
2536 if Address_Clause_Overlay_Warnings
2537 and then Comes_From_Source (N)
2538 and then Present (O_Ent)
2539 and then Is_Object (O_Ent)
2541 if not Is_Generic_Type (Etype (U_Ent)) then
2542 Address_Clause_Checks.Append ((N, U_Ent, O_Ent, Off));
2545 -- If variable overlays a constant view, and we are
2546 -- warning on overlays, then mark the variable as
2547 -- overlaying a constant (we will give warnings later
2548 -- if this variable is assigned).
2550 if Is_Constant_Object (O_Ent)
2551 and then Ekind (U_Ent) = E_Variable
2553 Set_Overlays_Constant (U_Ent);
2558 -- Not a valid entity for an address clause
2561 Error_Msg_N ("address cannot be given for &", Nam);
2569 -- Alignment attribute definition clause
2571 when Attribute_Alignment => Alignment : declare
2572 Align : constant Uint := Get_Alignment_Value (Expr);
2573 Max_Align : constant Uint := UI_From_Int (Maximum_Alignment);
2578 if not Is_Type (U_Ent)
2579 and then Ekind (U_Ent) /= E_Variable
2580 and then Ekind (U_Ent) /= E_Constant
2582 Error_Msg_N ("alignment cannot be given for &", Nam);
2584 elsif Duplicate_Clause then
2587 elsif Align /= No_Uint then
2588 Set_Has_Alignment_Clause (U_Ent);
2590 -- Tagged type case, check for attempt to set alignment to a
2591 -- value greater than Max_Align, and reset if so.
2593 if Is_Tagged_Type (U_Ent) and then Align > Max_Align then
2595 ("?alignment for & set to Maximum_Aligment", Nam);
2596 Set_Alignment (U_Ent, Max_Align);
2601 Set_Alignment (U_Ent, Align);
2604 -- For an array type, U_Ent is the first subtype. In that case,
2605 -- also set the alignment of the anonymous base type so that
2606 -- other subtypes (such as the itypes for aggregates of the
2607 -- type) also receive the expected alignment.
2609 if Is_Array_Type (U_Ent) then
2610 Set_Alignment (Base_Type (U_Ent), Align);
2619 -- Bit_Order attribute definition clause
2621 when Attribute_Bit_Order => Bit_Order : declare
2623 if not Is_Record_Type (U_Ent) then
2625 ("Bit_Order can only be defined for record type", Nam);
2627 elsif Duplicate_Clause then
2631 Analyze_And_Resolve (Expr, RTE (RE_Bit_Order));
2633 if Etype (Expr) = Any_Type then
2636 elsif not Is_Static_Expression (Expr) then
2637 Flag_Non_Static_Expr
2638 ("Bit_Order requires static expression!", Expr);
2641 if (Expr_Value (Expr) = 0) /= Bytes_Big_Endian then
2642 Set_Reverse_Bit_Order (U_Ent, True);
2648 --------------------
2649 -- Component_Size --
2650 --------------------
2652 -- Component_Size attribute definition clause
2654 when Attribute_Component_Size => Component_Size_Case : declare
2655 Csize : constant Uint := Static_Integer (Expr);
2659 New_Ctyp : Entity_Id;
2663 if not Is_Array_Type (U_Ent) then
2664 Error_Msg_N ("component size requires array type", Nam);
2668 Btype := Base_Type (U_Ent);
2669 Ctyp := Component_Type (Btype);
2671 if Duplicate_Clause then
2674 elsif Rep_Item_Too_Early (Btype, N) then
2677 elsif Csize /= No_Uint then
2678 Check_Size (Expr, Ctyp, Csize, Biased);
2680 -- For the biased case, build a declaration for a subtype that
2681 -- will be used to represent the biased subtype that reflects
2682 -- the biased representation of components. We need the subtype
2683 -- to get proper conversions on referencing elements of the
2684 -- array. Note: component size clauses are ignored in VM mode.
2686 if VM_Target = No_VM then
2689 Make_Defining_Identifier (Loc,
2691 New_External_Name (Chars (U_Ent), 'C', 0, 'T'));
2694 Make_Subtype_Declaration (Loc,
2695 Defining_Identifier => New_Ctyp,
2696 Subtype_Indication =>
2697 New_Occurrence_Of (Component_Type (Btype), Loc));
2699 Set_Parent (Decl, N);
2700 Analyze (Decl, Suppress => All_Checks);
2702 Set_Has_Delayed_Freeze (New_Ctyp, False);
2703 Set_Esize (New_Ctyp, Csize);
2704 Set_RM_Size (New_Ctyp, Csize);
2705 Init_Alignment (New_Ctyp);
2706 Set_Is_Itype (New_Ctyp, True);
2707 Set_Associated_Node_For_Itype (New_Ctyp, U_Ent);
2709 Set_Component_Type (Btype, New_Ctyp);
2710 Set_Biased (New_Ctyp, N, "component size clause");
2713 Set_Component_Size (Btype, Csize);
2715 -- For VM case, we ignore component size clauses
2718 -- Give a warning unless we are in GNAT mode, in which case
2719 -- the warning is suppressed since it is not useful.
2721 if not GNAT_Mode then
2723 ("?component size ignored in this configuration", N);
2727 -- Deal with warning on overridden size
2729 if Warn_On_Overridden_Size
2730 and then Has_Size_Clause (Ctyp)
2731 and then RM_Size (Ctyp) /= Csize
2734 ("?component size overrides size clause for&",
2738 Set_Has_Component_Size_Clause (Btype, True);
2739 Set_Has_Non_Standard_Rep (Btype, True);
2741 end Component_Size_Case;
2743 -----------------------
2744 -- Constant_Indexing --
2745 -----------------------
2747 when Attribute_Constant_Indexing =>
2748 Check_Indexing_Functions;
2750 ----------------------
2751 -- Default_Iterator --
2752 ----------------------
2754 when Attribute_Default_Iterator => Default_Iterator : declare
2758 if not Is_Tagged_Type (U_Ent) then
2760 ("aspect Default_Iterator applies to tagged type", Nam);
2763 Check_Iterator_Functions;
2767 if not Is_Entity_Name (Expr)
2768 or else Ekind (Entity (Expr)) /= E_Function
2770 Error_Msg_N ("aspect Iterator must be a function", Expr);
2772 Func := Entity (Expr);
2775 if No (First_Formal (Func))
2776 or else Etype (First_Formal (Func)) /= U_Ent
2779 ("Default Iterator must be a primitive of&", Func, U_Ent);
2781 end Default_Iterator;
2787 when Attribute_External_Tag => External_Tag :
2789 if not Is_Tagged_Type (U_Ent) then
2790 Error_Msg_N ("should be a tagged type", Nam);
2793 if Duplicate_Clause then
2797 Analyze_And_Resolve (Expr, Standard_String);
2799 if not Is_Static_Expression (Expr) then
2800 Flag_Non_Static_Expr
2801 ("static string required for tag name!", Nam);
2804 if VM_Target = No_VM then
2805 Set_Has_External_Tag_Rep_Clause (U_Ent);
2807 Error_Msg_Name_1 := Attr;
2809 ("% attribute unsupported in this configuration", Nam);
2812 if not Is_Library_Level_Entity (U_Ent) then
2814 ("?non-unique external tag supplied for &", N, U_Ent);
2816 ("?\same external tag applies to all subprogram calls", N);
2818 ("?\corresponding internal tag cannot be obtained", N);
2823 --------------------------
2824 -- Implicit_Dereference --
2825 --------------------------
2827 when Attribute_Implicit_Dereference =>
2829 -- Legality checks already performed at the point of
2830 -- the type declaration, aspect is not delayed.
2838 when Attribute_Input =>
2839 Analyze_Stream_TSS_Definition (TSS_Stream_Input);
2840 Set_Has_Specified_Stream_Input (Ent);
2842 ----------------------
2843 -- Iterator_Element --
2844 ----------------------
2846 when Attribute_Iterator_Element =>
2849 if not Is_Entity_Name (Expr)
2850 or else not Is_Type (Entity (Expr))
2852 Error_Msg_N ("aspect Iterator_Element must be a type", Expr);
2859 -- Machine radix attribute definition clause
2861 when Attribute_Machine_Radix => Machine_Radix : declare
2862 Radix : constant Uint := Static_Integer (Expr);
2865 if not Is_Decimal_Fixed_Point_Type (U_Ent) then
2866 Error_Msg_N ("decimal fixed-point type expected for &", Nam);
2868 elsif Duplicate_Clause then
2871 elsif Radix /= No_Uint then
2872 Set_Has_Machine_Radix_Clause (U_Ent);
2873 Set_Has_Non_Standard_Rep (Base_Type (U_Ent));
2877 elsif Radix = 10 then
2878 Set_Machine_Radix_10 (U_Ent);
2880 Error_Msg_N ("machine radix value must be 2 or 10", Expr);
2889 -- Object_Size attribute definition clause
2891 when Attribute_Object_Size => Object_Size : declare
2892 Size : constant Uint := Static_Integer (Expr);
2895 pragma Warnings (Off, Biased);
2898 if not Is_Type (U_Ent) then
2899 Error_Msg_N ("Object_Size cannot be given for &", Nam);
2901 elsif Duplicate_Clause then
2905 Check_Size (Expr, U_Ent, Size, Biased);
2913 UI_Mod (Size, 64) /= 0
2916 ("Object_Size must be 8, 16, 32, or multiple of 64",
2920 Set_Esize (U_Ent, Size);
2921 Set_Has_Object_Size_Clause (U_Ent);
2922 Alignment_Check_For_Size_Change (U_Ent, Size);
2930 when Attribute_Output =>
2931 Analyze_Stream_TSS_Definition (TSS_Stream_Output);
2932 Set_Has_Specified_Stream_Output (Ent);
2938 when Attribute_Read =>
2939 Analyze_Stream_TSS_Definition (TSS_Stream_Read);
2940 Set_Has_Specified_Stream_Read (Ent);
2946 -- Size attribute definition clause
2948 when Attribute_Size => Size : declare
2949 Size : constant Uint := Static_Integer (Expr);
2956 if Duplicate_Clause then
2959 elsif not Is_Type (U_Ent)
2960 and then Ekind (U_Ent) /= E_Variable
2961 and then Ekind (U_Ent) /= E_Constant
2963 Error_Msg_N ("size cannot be given for &", Nam);
2965 elsif Is_Array_Type (U_Ent)
2966 and then not Is_Constrained (U_Ent)
2969 ("size cannot be given for unconstrained array", Nam);
2971 elsif Size /= No_Uint then
2972 if VM_Target /= No_VM and then not GNAT_Mode then
2974 -- Size clause is not handled properly on VM targets.
2975 -- Display a warning unless we are in GNAT mode, in which
2976 -- case this is useless.
2979 ("?size clauses are ignored in this configuration", N);
2982 if Is_Type (U_Ent) then
2985 Etyp := Etype (U_Ent);
2988 -- Check size, note that Gigi is in charge of checking that the
2989 -- size of an array or record type is OK. Also we do not check
2990 -- the size in the ordinary fixed-point case, since it is too
2991 -- early to do so (there may be subsequent small clause that
2992 -- affects the size). We can check the size if a small clause
2993 -- has already been given.
2995 if not Is_Ordinary_Fixed_Point_Type (U_Ent)
2996 or else Has_Small_Clause (U_Ent)
2998 Check_Size (Expr, Etyp, Size, Biased);
2999 Set_Biased (U_Ent, N, "size clause", Biased);
3002 -- For types set RM_Size and Esize if possible
3004 if Is_Type (U_Ent) then
3005 Set_RM_Size (U_Ent, Size);
3007 -- For elementary types, increase Object_Size to power of 2,
3008 -- but not less than a storage unit in any case (normally
3009 -- this means it will be byte addressable).
3011 -- For all other types, nothing else to do, we leave Esize
3012 -- (object size) unset, the back end will set it from the
3013 -- size and alignment in an appropriate manner.
3015 -- In both cases, we check whether the alignment must be
3016 -- reset in the wake of the size change.
3018 if Is_Elementary_Type (U_Ent) then
3019 if Size <= System_Storage_Unit then
3020 Init_Esize (U_Ent, System_Storage_Unit);
3021 elsif Size <= 16 then
3022 Init_Esize (U_Ent, 16);
3023 elsif Size <= 32 then
3024 Init_Esize (U_Ent, 32);
3026 Set_Esize (U_Ent, (Size + 63) / 64 * 64);
3029 Alignment_Check_For_Size_Change (U_Ent, Esize (U_Ent));
3031 Alignment_Check_For_Size_Change (U_Ent, Size);
3034 -- For objects, set Esize only
3037 if Is_Elementary_Type (Etyp) then
3038 if Size /= System_Storage_Unit
3040 Size /= System_Storage_Unit * 2
3042 Size /= System_Storage_Unit * 4
3044 Size /= System_Storage_Unit * 8
3046 Error_Msg_Uint_1 := UI_From_Int (System_Storage_Unit);
3047 Error_Msg_Uint_2 := Error_Msg_Uint_1 * 8;
3049 ("size for primitive object must be a power of 2"
3050 & " in the range ^-^", N);
3054 Set_Esize (U_Ent, Size);
3057 Set_Has_Size_Clause (U_Ent);
3065 -- Small attribute definition clause
3067 when Attribute_Small => Small : declare
3068 Implicit_Base : constant Entity_Id := Base_Type (U_Ent);
3072 Analyze_And_Resolve (Expr, Any_Real);
3074 if Etype (Expr) = Any_Type then
3077 elsif not Is_Static_Expression (Expr) then
3078 Flag_Non_Static_Expr
3079 ("small requires static expression!", Expr);
3083 Small := Expr_Value_R (Expr);
3085 if Small <= Ureal_0 then
3086 Error_Msg_N ("small value must be greater than zero", Expr);
3092 if not Is_Ordinary_Fixed_Point_Type (U_Ent) then
3094 ("small requires an ordinary fixed point type", Nam);
3096 elsif Has_Small_Clause (U_Ent) then
3097 Error_Msg_N ("small already given for &", Nam);
3099 elsif Small > Delta_Value (U_Ent) then
3101 ("small value must not be greater then delta value", Nam);
3104 Set_Small_Value (U_Ent, Small);
3105 Set_Small_Value (Implicit_Base, Small);
3106 Set_Has_Small_Clause (U_Ent);
3107 Set_Has_Small_Clause (Implicit_Base);
3108 Set_Has_Non_Standard_Rep (Implicit_Base);
3116 -- Storage_Pool attribute definition clause
3118 when Attribute_Storage_Pool => Storage_Pool : declare
3123 if Ekind (U_Ent) = E_Access_Subprogram_Type then
3125 ("storage pool cannot be given for access-to-subprogram type",
3130 Ekind_In (U_Ent, E_Access_Type, E_General_Access_Type)
3133 ("storage pool can only be given for access types", Nam);
3136 elsif Is_Derived_Type (U_Ent) then
3138 ("storage pool cannot be given for a derived access type",
3141 elsif Duplicate_Clause then
3144 elsif Present (Associated_Storage_Pool (U_Ent)) then
3145 Error_Msg_N ("storage pool already given for &", Nam);
3150 (Expr, Class_Wide_Type (RTE (RE_Root_Storage_Pool)));
3152 if not Denotes_Variable (Expr) then
3153 Error_Msg_N ("storage pool must be a variable", Expr);
3157 if Nkind (Expr) = N_Type_Conversion then
3158 T := Etype (Expression (Expr));
3163 -- The Stack_Bounded_Pool is used internally for implementing
3164 -- access types with a Storage_Size. Since it only work properly
3165 -- when used on one specific type, we need to check that it is not
3166 -- hijacked improperly:
3168 -- type T is access Integer;
3169 -- for T'Storage_Size use n;
3170 -- type Q is access Float;
3171 -- for Q'Storage_Size use T'Storage_Size; -- incorrect
3173 if RTE_Available (RE_Stack_Bounded_Pool)
3174 and then Base_Type (T) = RTE (RE_Stack_Bounded_Pool)
3176 Error_Msg_N ("non-shareable internal Pool", Expr);
3180 -- If the argument is a name that is not an entity name, then
3181 -- we construct a renaming operation to define an entity of
3182 -- type storage pool.
3184 if not Is_Entity_Name (Expr)
3185 and then Is_Object_Reference (Expr)
3187 Pool := Make_Temporary (Loc, 'P', Expr);
3190 Rnode : constant Node_Id :=
3191 Make_Object_Renaming_Declaration (Loc,
3192 Defining_Identifier => Pool,
3194 New_Occurrence_Of (Etype (Expr), Loc),
3198 Insert_Before (N, Rnode);
3200 Set_Associated_Storage_Pool (U_Ent, Pool);
3203 elsif Is_Entity_Name (Expr) then
3204 Pool := Entity (Expr);
3206 -- If pool is a renamed object, get original one. This can
3207 -- happen with an explicit renaming, and within instances.
3209 while Present (Renamed_Object (Pool))
3210 and then Is_Entity_Name (Renamed_Object (Pool))
3212 Pool := Entity (Renamed_Object (Pool));
3215 if Present (Renamed_Object (Pool))
3216 and then Nkind (Renamed_Object (Pool)) = N_Type_Conversion
3217 and then Is_Entity_Name (Expression (Renamed_Object (Pool)))
3219 Pool := Entity (Expression (Renamed_Object (Pool)));
3222 Set_Associated_Storage_Pool (U_Ent, Pool);
3224 elsif Nkind (Expr) = N_Type_Conversion
3225 and then Is_Entity_Name (Expression (Expr))
3226 and then Nkind (Original_Node (Expr)) = N_Attribute_Reference
3228 Pool := Entity (Expression (Expr));
3229 Set_Associated_Storage_Pool (U_Ent, Pool);
3232 Error_Msg_N ("incorrect reference to a Storage Pool", Expr);
3241 -- Storage_Size attribute definition clause
3243 when Attribute_Storage_Size => Storage_Size : declare
3244 Btype : constant Entity_Id := Base_Type (U_Ent);
3248 if Is_Task_Type (U_Ent) then
3249 Check_Restriction (No_Obsolescent_Features, N);
3251 if Warn_On_Obsolescent_Feature then
3253 ("storage size clause for task is an " &
3254 "obsolescent feature (RM J.9)?", N);
3255 Error_Msg_N ("\use Storage_Size pragma instead?", N);
3261 if not Is_Access_Type (U_Ent)
3262 and then Ekind (U_Ent) /= E_Task_Type
3264 Error_Msg_N ("storage size cannot be given for &", Nam);
3266 elsif Is_Access_Type (U_Ent) and Is_Derived_Type (U_Ent) then
3268 ("storage size cannot be given for a derived access type",
3271 elsif Duplicate_Clause then
3275 Analyze_And_Resolve (Expr, Any_Integer);
3277 if Is_Access_Type (U_Ent) then
3278 if Present (Associated_Storage_Pool (U_Ent)) then
3279 Error_Msg_N ("storage pool already given for &", Nam);
3283 if Is_OK_Static_Expression (Expr)
3284 and then Expr_Value (Expr) = 0
3286 Set_No_Pool_Assigned (Btype);
3289 else -- Is_Task_Type (U_Ent)
3290 Sprag := Get_Rep_Pragma (Btype, Name_Storage_Size);
3292 if Present (Sprag) then
3293 Error_Msg_Sloc := Sloc (Sprag);
3295 ("Storage_Size already specified#", Nam);
3300 Set_Has_Storage_Size_Clause (Btype);
3308 when Attribute_Stream_Size => Stream_Size : declare
3309 Size : constant Uint := Static_Integer (Expr);
3312 if Ada_Version <= Ada_95 then
3313 Check_Restriction (No_Implementation_Attributes, N);
3316 if Duplicate_Clause then
3319 elsif Is_Elementary_Type (U_Ent) then
3320 if Size /= System_Storage_Unit
3322 Size /= System_Storage_Unit * 2
3324 Size /= System_Storage_Unit * 4
3326 Size /= System_Storage_Unit * 8
3328 Error_Msg_Uint_1 := UI_From_Int (System_Storage_Unit);
3330 ("stream size for elementary type must be a"
3331 & " power of 2 and at least ^", N);
3333 elsif RM_Size (U_Ent) > Size then
3334 Error_Msg_Uint_1 := RM_Size (U_Ent);
3336 ("stream size for elementary type must be a"
3337 & " power of 2 and at least ^", N);
3340 Set_Has_Stream_Size_Clause (U_Ent);
3343 Error_Msg_N ("Stream_Size cannot be given for &", Nam);
3351 -- Value_Size attribute definition clause
3353 when Attribute_Value_Size => Value_Size : declare
3354 Size : constant Uint := Static_Integer (Expr);
3358 if not Is_Type (U_Ent) then
3359 Error_Msg_N ("Value_Size cannot be given for &", Nam);
3361 elsif Duplicate_Clause then
3364 elsif Is_Array_Type (U_Ent)
3365 and then not Is_Constrained (U_Ent)
3368 ("Value_Size cannot be given for unconstrained array", Nam);
3371 if Is_Elementary_Type (U_Ent) then
3372 Check_Size (Expr, U_Ent, Size, Biased);
3373 Set_Biased (U_Ent, N, "value size clause", Biased);
3376 Set_RM_Size (U_Ent, Size);
3380 -----------------------
3381 -- Variable_Indexing --
3382 -----------------------
3384 when Attribute_Variable_Indexing =>
3385 Check_Indexing_Functions;
3391 when Attribute_Write =>
3392 Analyze_Stream_TSS_Definition (TSS_Stream_Write);
3393 Set_Has_Specified_Stream_Write (Ent);
3395 -- All other attributes cannot be set
3399 ("attribute& cannot be set with definition clause", N);
3402 -- The test for the type being frozen must be performed after any
3403 -- expression the clause has been analyzed since the expression itself
3404 -- might cause freezing that makes the clause illegal.
3406 if Rep_Item_Too_Late (U_Ent, N, FOnly) then
3409 end Analyze_Attribute_Definition_Clause;
3411 ----------------------------
3412 -- Analyze_Code_Statement --
3413 ----------------------------
3415 procedure Analyze_Code_Statement (N : Node_Id) is
3416 HSS : constant Node_Id := Parent (N);
3417 SBody : constant Node_Id := Parent (HSS);
3418 Subp : constant Entity_Id := Current_Scope;
3425 -- Analyze and check we get right type, note that this implements the
3426 -- requirement (RM 13.8(1)) that Machine_Code be with'ed, since that
3427 -- is the only way that Asm_Insn could possibly be visible.
3429 Analyze_And_Resolve (Expression (N));
3431 if Etype (Expression (N)) = Any_Type then
3433 elsif Etype (Expression (N)) /= RTE (RE_Asm_Insn) then
3434 Error_Msg_N ("incorrect type for code statement", N);
3438 Check_Code_Statement (N);
3440 -- Make sure we appear in the handled statement sequence of a
3441 -- subprogram (RM 13.8(3)).
3443 if Nkind (HSS) /= N_Handled_Sequence_Of_Statements
3444 or else Nkind (SBody) /= N_Subprogram_Body
3447 ("code statement can only appear in body of subprogram", N);
3451 -- Do remaining checks (RM 13.8(3)) if not already done
3453 if not Is_Machine_Code_Subprogram (Subp) then
3454 Set_Is_Machine_Code_Subprogram (Subp);
3456 -- No exception handlers allowed
3458 if Present (Exception_Handlers (HSS)) then
3460 ("exception handlers not permitted in machine code subprogram",
3461 First (Exception_Handlers (HSS)));
3464 -- No declarations other than use clauses and pragmas (we allow
3465 -- certain internally generated declarations as well).
3467 Decl := First (Declarations (SBody));
3468 while Present (Decl) loop
3469 DeclO := Original_Node (Decl);
3470 if Comes_From_Source (DeclO)
3471 and not Nkind_In (DeclO, N_Pragma,
3472 N_Use_Package_Clause,
3474 N_Implicit_Label_Declaration)
3477 ("this declaration not allowed in machine code subprogram",
3484 -- No statements other than code statements, pragmas, and labels.
3485 -- Again we allow certain internally generated statements.
3487 -- In Ada 2012, qualified expressions are names, and the code
3488 -- statement is initially parsed as a procedure call.
3490 Stmt := First (Statements (HSS));
3491 while Present (Stmt) loop
3492 StmtO := Original_Node (Stmt);
3494 -- A procedure call transformed into a code statement is OK.
3496 if Ada_Version >= Ada_2012
3497 and then Nkind (StmtO) = N_Procedure_Call_Statement
3498 and then Nkind (Name (StmtO)) = N_Qualified_Expression
3502 elsif Comes_From_Source (StmtO)
3503 and then not Nkind_In (StmtO, N_Pragma,
3508 ("this statement is not allowed in machine code subprogram",
3515 end Analyze_Code_Statement;
3517 -----------------------------------------------
3518 -- Analyze_Enumeration_Representation_Clause --
3519 -----------------------------------------------
3521 procedure Analyze_Enumeration_Representation_Clause (N : Node_Id) is
3522 Ident : constant Node_Id := Identifier (N);
3523 Aggr : constant Node_Id := Array_Aggregate (N);
3524 Enumtype : Entity_Id;
3531 Err : Boolean := False;
3532 -- Set True to avoid cascade errors and crashes on incorrect source code
3534 Lo : constant Uint := Expr_Value (Type_Low_Bound (Universal_Integer));
3535 Hi : constant Uint := Expr_Value (Type_High_Bound (Universal_Integer));
3536 -- Allowed range of universal integer (= allowed range of enum lit vals)
3540 -- Minimum and maximum values of entries
3543 -- Pointer to node for literal providing max value
3546 if Ignore_Rep_Clauses then
3550 -- First some basic error checks
3553 Enumtype := Entity (Ident);
3555 if Enumtype = Any_Type
3556 or else Rep_Item_Too_Early (Enumtype, N)
3560 Enumtype := Underlying_Type (Enumtype);
3563 if not Is_Enumeration_Type (Enumtype) then
3565 ("enumeration type required, found}",
3566 Ident, First_Subtype (Enumtype));
3570 -- Ignore rep clause on generic actual type. This will already have
3571 -- been flagged on the template as an error, and this is the safest
3572 -- way to ensure we don't get a junk cascaded message in the instance.
3574 if Is_Generic_Actual_Type (Enumtype) then
3577 -- Type must be in current scope
3579 elsif Scope (Enumtype) /= Current_Scope then
3580 Error_Msg_N ("type must be declared in this scope", Ident);
3583 -- Type must be a first subtype
3585 elsif not Is_First_Subtype (Enumtype) then
3586 Error_Msg_N ("cannot give enumeration rep clause for subtype", N);
3589 -- Ignore duplicate rep clause
3591 elsif Has_Enumeration_Rep_Clause (Enumtype) then
3592 Error_Msg_N ("duplicate enumeration rep clause ignored", N);
3595 -- Don't allow rep clause for standard [wide_[wide_]]character
3597 elsif Is_Standard_Character_Type (Enumtype) then
3598 Error_Msg_N ("enumeration rep clause not allowed for this type", N);
3601 -- Check that the expression is a proper aggregate (no parentheses)
3603 elsif Paren_Count (Aggr) /= 0 then
3605 ("extra parentheses surrounding aggregate not allowed",
3609 -- All tests passed, so set rep clause in place
3612 Set_Has_Enumeration_Rep_Clause (Enumtype);
3613 Set_Has_Enumeration_Rep_Clause (Base_Type (Enumtype));
3616 -- Now we process the aggregate. Note that we don't use the normal
3617 -- aggregate code for this purpose, because we don't want any of the
3618 -- normal expansion activities, and a number of special semantic
3619 -- rules apply (including the component type being any integer type)
3621 Elit := First_Literal (Enumtype);
3623 -- First the positional entries if any
3625 if Present (Expressions (Aggr)) then
3626 Expr := First (Expressions (Aggr));
3627 while Present (Expr) loop
3629 Error_Msg_N ("too many entries in aggregate", Expr);
3633 Val := Static_Integer (Expr);
3635 -- Err signals that we found some incorrect entries processing
3636 -- the list. The final checks for completeness and ordering are
3637 -- skipped in this case.
3639 if Val = No_Uint then
3641 elsif Val < Lo or else Hi < Val then
3642 Error_Msg_N ("value outside permitted range", Expr);
3646 Set_Enumeration_Rep (Elit, Val);
3647 Set_Enumeration_Rep_Expr (Elit, Expr);
3653 -- Now process the named entries if present
3655 if Present (Component_Associations (Aggr)) then
3656 Assoc := First (Component_Associations (Aggr));
3657 while Present (Assoc) loop
3658 Choice := First (Choices (Assoc));
3660 if Present (Next (Choice)) then
3662 ("multiple choice not allowed here", Next (Choice));
3666 if Nkind (Choice) = N_Others_Choice then
3667 Error_Msg_N ("others choice not allowed here", Choice);
3670 elsif Nkind (Choice) = N_Range then
3672 -- ??? should allow zero/one element range here
3674 Error_Msg_N ("range not allowed here", Choice);
3678 Analyze_And_Resolve (Choice, Enumtype);
3680 if Error_Posted (Choice) then
3685 if Is_Entity_Name (Choice)
3686 and then Is_Type (Entity (Choice))
3688 Error_Msg_N ("subtype name not allowed here", Choice);
3691 -- ??? should allow static subtype with zero/one entry
3693 elsif Etype (Choice) = Base_Type (Enumtype) then
3694 if not Is_Static_Expression (Choice) then
3695 Flag_Non_Static_Expr
3696 ("non-static expression used for choice!", Choice);
3700 Elit := Expr_Value_E (Choice);
3702 if Present (Enumeration_Rep_Expr (Elit)) then
3704 Sloc (Enumeration_Rep_Expr (Elit));
3706 ("representation for& previously given#",
3711 Set_Enumeration_Rep_Expr (Elit, Expression (Assoc));
3713 Expr := Expression (Assoc);
3714 Val := Static_Integer (Expr);
3716 if Val = No_Uint then
3719 elsif Val < Lo or else Hi < Val then
3720 Error_Msg_N ("value outside permitted range", Expr);
3724 Set_Enumeration_Rep (Elit, Val);
3734 -- Aggregate is fully processed. Now we check that a full set of
3735 -- representations was given, and that they are in range and in order.
3736 -- These checks are only done if no other errors occurred.
3742 Elit := First_Literal (Enumtype);
3743 while Present (Elit) loop
3744 if No (Enumeration_Rep_Expr (Elit)) then
3745 Error_Msg_NE ("missing representation for&!", N, Elit);
3748 Val := Enumeration_Rep (Elit);
3750 if Min = No_Uint then
3754 if Val /= No_Uint then
3755 if Max /= No_Uint and then Val <= Max then
3757 ("enumeration value for& not ordered!",
3758 Enumeration_Rep_Expr (Elit), Elit);
3761 Max_Node := Enumeration_Rep_Expr (Elit);
3765 -- If there is at least one literal whose representation is not
3766 -- equal to the Pos value, then note that this enumeration type
3767 -- has a non-standard representation.
3769 if Val /= Enumeration_Pos (Elit) then
3770 Set_Has_Non_Standard_Rep (Base_Type (Enumtype));
3777 -- Now set proper size information
3780 Minsize : Uint := UI_From_Int (Minimum_Size (Enumtype));
3783 if Has_Size_Clause (Enumtype) then
3785 -- All OK, if size is OK now
3787 if RM_Size (Enumtype) >= Minsize then
3791 -- Try if we can get by with biasing
3794 UI_From_Int (Minimum_Size (Enumtype, Biased => True));
3796 -- Error message if even biasing does not work
3798 if RM_Size (Enumtype) < Minsize then
3799 Error_Msg_Uint_1 := RM_Size (Enumtype);
3800 Error_Msg_Uint_2 := Max;
3802 ("previously given size (^) is too small "
3803 & "for this value (^)", Max_Node);
3805 -- If biasing worked, indicate that we now have biased rep
3809 (Enumtype, Size_Clause (Enumtype), "size clause");
3814 Set_RM_Size (Enumtype, Minsize);
3815 Set_Enum_Esize (Enumtype);
3818 Set_RM_Size (Base_Type (Enumtype), RM_Size (Enumtype));
3819 Set_Esize (Base_Type (Enumtype), Esize (Enumtype));
3820 Set_Alignment (Base_Type (Enumtype), Alignment (Enumtype));
3824 -- We repeat the too late test in case it froze itself!
3826 if Rep_Item_Too_Late (Enumtype, N) then
3829 end Analyze_Enumeration_Representation_Clause;
3831 ----------------------------
3832 -- Analyze_Free_Statement --
3833 ----------------------------
3835 procedure Analyze_Free_Statement (N : Node_Id) is
3837 Analyze (Expression (N));
3838 end Analyze_Free_Statement;
3840 ---------------------------
3841 -- Analyze_Freeze_Entity --
3842 ---------------------------
3844 procedure Analyze_Freeze_Entity (N : Node_Id) is
3845 E : constant Entity_Id := Entity (N);
3848 -- Remember that we are processing a freezing entity. Required to
3849 -- ensure correct decoration of internal entities associated with
3850 -- interfaces (see New_Overloaded_Entity).
3852 Inside_Freezing_Actions := Inside_Freezing_Actions + 1;
3854 -- For tagged types covering interfaces add internal entities that link
3855 -- the primitives of the interfaces with the primitives that cover them.
3856 -- Note: These entities were originally generated only when generating
3857 -- code because their main purpose was to provide support to initialize
3858 -- the secondary dispatch tables. They are now generated also when
3859 -- compiling with no code generation to provide ASIS the relationship
3860 -- between interface primitives and tagged type primitives. They are
3861 -- also used to locate primitives covering interfaces when processing
3862 -- generics (see Derive_Subprograms).
3864 if Ada_Version >= Ada_2005
3865 and then Ekind (E) = E_Record_Type
3866 and then Is_Tagged_Type (E)
3867 and then not Is_Interface (E)
3868 and then Has_Interfaces (E)
3870 -- This would be a good common place to call the routine that checks
3871 -- overriding of interface primitives (and thus factorize calls to
3872 -- Check_Abstract_Overriding located at different contexts in the
3873 -- compiler). However, this is not possible because it causes
3874 -- spurious errors in case of late overriding.
3876 Add_Internal_Interface_Entities (E);
3881 if Ekind (E) = E_Record_Type
3882 and then Is_CPP_Class (E)
3883 and then Is_Tagged_Type (E)
3884 and then Tagged_Type_Expansion
3885 and then Expander_Active
3887 if CPP_Num_Prims (E) = 0 then
3889 -- If the CPP type has user defined components then it must import
3890 -- primitives from C++. This is required because if the C++ class
3891 -- has no primitives then the C++ compiler does not added the _tag
3892 -- component to the type.
3894 pragma Assert (Chars (First_Entity (E)) = Name_uTag);
3896 if First_Entity (E) /= Last_Entity (E) then
3898 ("?'C'P'P type must import at least one primitive from C++",
3903 -- Check that all its primitives are abstract or imported from C++.
3904 -- Check also availability of the C++ constructor.
3907 Has_Constructors : constant Boolean := Has_CPP_Constructors (E);
3909 Error_Reported : Boolean := False;
3913 Elmt := First_Elmt (Primitive_Operations (E));
3914 while Present (Elmt) loop
3915 Prim := Node (Elmt);
3917 if Comes_From_Source (Prim) then
3918 if Is_Abstract_Subprogram (Prim) then
3921 elsif not Is_Imported (Prim)
3922 or else Convention (Prim) /= Convention_CPP
3925 ("?primitives of 'C'P'P types must be imported from C++"
3926 & " or abstract", Prim);
3928 elsif not Has_Constructors
3929 and then not Error_Reported
3931 Error_Msg_Name_1 := Chars (E);
3933 ("?'C'P'P constructor required for type %", Prim);
3934 Error_Reported := True;
3943 Inside_Freezing_Actions := Inside_Freezing_Actions - 1;
3945 -- If we have a type with predicates, build predicate function
3947 if Is_Type (E) and then Has_Predicates (E) then
3948 Build_Predicate_Function (E, N);
3951 -- If type has delayed aspects, this is where we do the preanalysis at
3952 -- the freeze point, as part of the consistent visibility check. Note
3953 -- that this must be done after calling Build_Predicate_Function or
3954 -- Build_Invariant_Procedure since these subprograms fix occurrences of
3955 -- the subtype name in the saved expression so that they will not cause
3956 -- trouble in the preanalysis.
3958 if Has_Delayed_Aspects (E) then
3963 -- Look for aspect specification entries for this entity
3965 Ritem := First_Rep_Item (E);
3966 while Present (Ritem) loop
3967 if Nkind (Ritem) = N_Aspect_Specification
3968 and then Entity (Ritem) = E
3969 and then Is_Delayed_Aspect (Ritem)
3970 and then Scope (E) = Current_Scope
3972 Check_Aspect_At_Freeze_Point (Ritem);
3975 Next_Rep_Item (Ritem);
3979 end Analyze_Freeze_Entity;
3981 ------------------------------------------
3982 -- Analyze_Record_Representation_Clause --
3983 ------------------------------------------
3985 -- Note: we check as much as we can here, but we can't do any checks
3986 -- based on the position values (e.g. overlap checks) until freeze time
3987 -- because especially in Ada 2005 (machine scalar mode), the processing
3988 -- for non-standard bit order can substantially change the positions.
3989 -- See procedure Check_Record_Representation_Clause (called from Freeze)
3990 -- for the remainder of this processing.
3992 procedure Analyze_Record_Representation_Clause (N : Node_Id) is
3993 Ident : constant Node_Id := Identifier (N);
3998 Hbit : Uint := Uint_0;
4002 Rectype : Entity_Id;
4004 CR_Pragma : Node_Id := Empty;
4005 -- Points to N_Pragma node if Complete_Representation pragma present
4008 if Ignore_Rep_Clauses then
4013 Rectype := Entity (Ident);
4015 if Rectype = Any_Type
4016 or else Rep_Item_Too_Early (Rectype, N)
4020 Rectype := Underlying_Type (Rectype);
4023 -- First some basic error checks
4025 if not Is_Record_Type (Rectype) then
4027 ("record type required, found}", Ident, First_Subtype (Rectype));
4030 elsif Scope (Rectype) /= Current_Scope then
4031 Error_Msg_N ("type must be declared in this scope", N);
4034 elsif not Is_First_Subtype (Rectype) then
4035 Error_Msg_N ("cannot give record rep clause for subtype", N);
4038 elsif Has_Record_Rep_Clause (Rectype) then
4039 Error_Msg_N ("duplicate record rep clause ignored", N);
4042 elsif Rep_Item_Too_Late (Rectype, N) then
4046 if Present (Mod_Clause (N)) then
4048 Loc : constant Source_Ptr := Sloc (N);
4049 M : constant Node_Id := Mod_Clause (N);
4050 P : constant List_Id := Pragmas_Before (M);
4054 pragma Warnings (Off, Mod_Val);
4057 Check_Restriction (No_Obsolescent_Features, Mod_Clause (N));
4059 if Warn_On_Obsolescent_Feature then
4061 ("mod clause is an obsolescent feature (RM J.8)?", N);
4063 ("\use alignment attribute definition clause instead?", N);
4070 -- In ASIS_Mode mode, expansion is disabled, but we must convert
4071 -- the Mod clause into an alignment clause anyway, so that the
4072 -- back-end can compute and back-annotate properly the size and
4073 -- alignment of types that may include this record.
4075 -- This seems dubious, this destroys the source tree in a manner
4076 -- not detectable by ASIS ???
4078 if Operating_Mode = Check_Semantics and then ASIS_Mode then
4080 Make_Attribute_Definition_Clause (Loc,
4081 Name => New_Reference_To (Base_Type (Rectype), Loc),
4082 Chars => Name_Alignment,
4083 Expression => Relocate_Node (Expression (M)));
4085 Set_From_At_Mod (AtM_Nod);
4086 Insert_After (N, AtM_Nod);
4087 Mod_Val := Get_Alignment_Value (Expression (AtM_Nod));
4088 Set_Mod_Clause (N, Empty);
4091 -- Get the alignment value to perform error checking
4093 Mod_Val := Get_Alignment_Value (Expression (M));
4098 -- For untagged types, clear any existing component clauses for the
4099 -- type. If the type is derived, this is what allows us to override
4100 -- a rep clause for the parent. For type extensions, the representation
4101 -- of the inherited components is inherited, so we want to keep previous
4102 -- component clauses for completeness.
4104 if not Is_Tagged_Type (Rectype) then
4105 Comp := First_Component_Or_Discriminant (Rectype);
4106 while Present (Comp) loop
4107 Set_Component_Clause (Comp, Empty);
4108 Next_Component_Or_Discriminant (Comp);
4112 -- All done if no component clauses
4114 CC := First (Component_Clauses (N));
4120 -- A representation like this applies to the base type
4122 Set_Has_Record_Rep_Clause (Base_Type (Rectype));
4123 Set_Has_Non_Standard_Rep (Base_Type (Rectype));
4124 Set_Has_Specified_Layout (Base_Type (Rectype));
4126 -- Process the component clauses
4128 while Present (CC) loop
4132 if Nkind (CC) = N_Pragma then
4135 -- The only pragma of interest is Complete_Representation
4137 if Pragma_Name (CC) = Name_Complete_Representation then
4141 -- Processing for real component clause
4144 Posit := Static_Integer (Position (CC));
4145 Fbit := Static_Integer (First_Bit (CC));
4146 Lbit := Static_Integer (Last_Bit (CC));
4149 and then Fbit /= No_Uint
4150 and then Lbit /= No_Uint
4154 ("position cannot be negative", Position (CC));
4158 ("first bit cannot be negative", First_Bit (CC));
4160 -- The Last_Bit specified in a component clause must not be
4161 -- less than the First_Bit minus one (RM-13.5.1(10)).
4163 elsif Lbit < Fbit - 1 then
4165 ("last bit cannot be less than first bit minus one",
4168 -- Values look OK, so find the corresponding record component
4169 -- Even though the syntax allows an attribute reference for
4170 -- implementation-defined components, GNAT does not allow the
4171 -- tag to get an explicit position.
4173 elsif Nkind (Component_Name (CC)) = N_Attribute_Reference then
4174 if Attribute_Name (Component_Name (CC)) = Name_Tag then
4175 Error_Msg_N ("position of tag cannot be specified", CC);
4177 Error_Msg_N ("illegal component name", CC);
4181 Comp := First_Entity (Rectype);
4182 while Present (Comp) loop
4183 exit when Chars (Comp) = Chars (Component_Name (CC));
4189 -- Maybe component of base type that is absent from
4190 -- statically constrained first subtype.
4192 Comp := First_Entity (Base_Type (Rectype));
4193 while Present (Comp) loop
4194 exit when Chars (Comp) = Chars (Component_Name (CC));
4201 ("component clause is for non-existent field", CC);
4203 -- Ada 2012 (AI05-0026): Any name that denotes a
4204 -- discriminant of an object of an unchecked union type
4205 -- shall not occur within a record_representation_clause.
4207 -- The general restriction of using record rep clauses on
4208 -- Unchecked_Union types has now been lifted. Since it is
4209 -- possible to introduce a record rep clause which mentions
4210 -- the discriminant of an Unchecked_Union in non-Ada 2012
4211 -- code, this check is applied to all versions of the
4214 elsif Ekind (Comp) = E_Discriminant
4215 and then Is_Unchecked_Union (Rectype)
4218 ("cannot reference discriminant of Unchecked_Union",
4219 Component_Name (CC));
4221 elsif Present (Component_Clause (Comp)) then
4223 -- Diagnose duplicate rep clause, or check consistency
4224 -- if this is an inherited component. In a double fault,
4225 -- there may be a duplicate inconsistent clause for an
4226 -- inherited component.
4228 if Scope (Original_Record_Component (Comp)) = Rectype
4229 or else Parent (Component_Clause (Comp)) = N
4231 Error_Msg_Sloc := Sloc (Component_Clause (Comp));
4232 Error_Msg_N ("component clause previously given#", CC);
4236 Rep1 : constant Node_Id := Component_Clause (Comp);
4238 if Intval (Position (Rep1)) /=
4239 Intval (Position (CC))
4240 or else Intval (First_Bit (Rep1)) /=
4241 Intval (First_Bit (CC))
4242 or else Intval (Last_Bit (Rep1)) /=
4243 Intval (Last_Bit (CC))
4245 Error_Msg_N ("component clause inconsistent "
4246 & "with representation of ancestor", CC);
4247 elsif Warn_On_Redundant_Constructs then
4248 Error_Msg_N ("?redundant component clause "
4249 & "for inherited component!", CC);
4254 -- Normal case where this is the first component clause we
4255 -- have seen for this entity, so set it up properly.
4258 -- Make reference for field in record rep clause and set
4259 -- appropriate entity field in the field identifier.
4262 (Comp, Component_Name (CC), Set_Ref => False);
4263 Set_Entity (Component_Name (CC), Comp);
4265 -- Update Fbit and Lbit to the actual bit number
4267 Fbit := Fbit + UI_From_Int (SSU) * Posit;
4268 Lbit := Lbit + UI_From_Int (SSU) * Posit;
4270 if Has_Size_Clause (Rectype)
4271 and then RM_Size (Rectype) <= Lbit
4274 ("bit number out of range of specified size",
4277 Set_Component_Clause (Comp, CC);
4278 Set_Component_Bit_Offset (Comp, Fbit);
4279 Set_Esize (Comp, 1 + (Lbit - Fbit));
4280 Set_Normalized_First_Bit (Comp, Fbit mod SSU);
4281 Set_Normalized_Position (Comp, Fbit / SSU);
4283 if Warn_On_Overridden_Size
4284 and then Has_Size_Clause (Etype (Comp))
4285 and then RM_Size (Etype (Comp)) /= Esize (Comp)
4288 ("?component size overrides size clause for&",
4289 Component_Name (CC), Etype (Comp));
4292 -- This information is also set in the corresponding
4293 -- component of the base type, found by accessing the
4294 -- Original_Record_Component link if it is present.
4296 Ocomp := Original_Record_Component (Comp);
4303 (Component_Name (CC),
4309 (Comp, First_Node (CC), "component clause", Biased);
4311 if Present (Ocomp) then
4312 Set_Component_Clause (Ocomp, CC);
4313 Set_Component_Bit_Offset (Ocomp, Fbit);
4314 Set_Normalized_First_Bit (Ocomp, Fbit mod SSU);
4315 Set_Normalized_Position (Ocomp, Fbit / SSU);
4316 Set_Esize (Ocomp, 1 + (Lbit - Fbit));
4318 Set_Normalized_Position_Max
4319 (Ocomp, Normalized_Position (Ocomp));
4321 -- Note: we don't use Set_Biased here, because we
4322 -- already gave a warning above if needed, and we
4323 -- would get a duplicate for the same name here.
4325 Set_Has_Biased_Representation
4326 (Ocomp, Has_Biased_Representation (Comp));
4329 if Esize (Comp) < 0 then
4330 Error_Msg_N ("component size is negative", CC);
4341 -- Check missing components if Complete_Representation pragma appeared
4343 if Present (CR_Pragma) then
4344 Comp := First_Component_Or_Discriminant (Rectype);
4345 while Present (Comp) loop
4346 if No (Component_Clause (Comp)) then
4348 ("missing component clause for &", CR_Pragma, Comp);
4351 Next_Component_Or_Discriminant (Comp);
4354 -- If no Complete_Representation pragma, warn if missing components
4356 elsif Warn_On_Unrepped_Components then
4358 Num_Repped_Components : Nat := 0;
4359 Num_Unrepped_Components : Nat := 0;
4362 -- First count number of repped and unrepped components
4364 Comp := First_Component_Or_Discriminant (Rectype);
4365 while Present (Comp) loop
4366 if Present (Component_Clause (Comp)) then
4367 Num_Repped_Components := Num_Repped_Components + 1;
4369 Num_Unrepped_Components := Num_Unrepped_Components + 1;
4372 Next_Component_Or_Discriminant (Comp);
4375 -- We are only interested in the case where there is at least one
4376 -- unrepped component, and at least half the components have rep
4377 -- clauses. We figure that if less than half have them, then the
4378 -- partial rep clause is really intentional. If the component
4379 -- type has no underlying type set at this point (as for a generic
4380 -- formal type), we don't know enough to give a warning on the
4383 if Num_Unrepped_Components > 0
4384 and then Num_Unrepped_Components < Num_Repped_Components
4386 Comp := First_Component_Or_Discriminant (Rectype);
4387 while Present (Comp) loop
4388 if No (Component_Clause (Comp))
4389 and then Comes_From_Source (Comp)
4390 and then Present (Underlying_Type (Etype (Comp)))
4391 and then (Is_Scalar_Type (Underlying_Type (Etype (Comp)))
4392 or else Size_Known_At_Compile_Time
4393 (Underlying_Type (Etype (Comp))))
4394 and then not Has_Warnings_Off (Rectype)
4396 Error_Msg_Sloc := Sloc (Comp);
4398 ("?no component clause given for & declared #",
4402 Next_Component_Or_Discriminant (Comp);
4407 end Analyze_Record_Representation_Clause;
4409 -------------------------------
4410 -- Build_Invariant_Procedure --
4411 -------------------------------
4413 -- The procedure that is constructed here has the form
4415 -- procedure typInvariant (Ixxx : typ) is
4417 -- pragma Check (Invariant, exp, "failed invariant from xxx");
4418 -- pragma Check (Invariant, exp, "failed invariant from xxx");
4420 -- pragma Check (Invariant, exp, "failed inherited invariant from xxx");
4422 -- end typInvariant;
4424 procedure Build_Invariant_Procedure (Typ : Entity_Id; N : Node_Id) is
4425 Loc : constant Source_Ptr := Sloc (Typ);
4432 Visible_Decls : constant List_Id := Visible_Declarations (N);
4433 Private_Decls : constant List_Id := Private_Declarations (N);
4435 procedure Add_Invariants (T : Entity_Id; Inherit : Boolean);
4436 -- Appends statements to Stmts for any invariants in the rep item chain
4437 -- of the given type. If Inherit is False, then we only process entries
4438 -- on the chain for the type Typ. If Inherit is True, then we ignore any
4439 -- Invariant aspects, but we process all Invariant'Class aspects, adding
4440 -- "inherited" to the exception message and generating an informational
4441 -- message about the inheritance of an invariant.
4443 Object_Name : constant Name_Id := New_Internal_Name ('I');
4444 -- Name for argument of invariant procedure
4446 Object_Entity : constant Node_Id :=
4447 Make_Defining_Identifier (Loc, Object_Name);
4448 -- The procedure declaration entity for the argument
4450 --------------------
4451 -- Add_Invariants --
4452 --------------------
4454 procedure Add_Invariants (T : Entity_Id; Inherit : Boolean) is
4464 procedure Replace_Type_Reference (N : Node_Id);
4465 -- Replace a single occurrence N of the subtype name with a reference
4466 -- to the formal of the predicate function. N can be an identifier
4467 -- referencing the subtype, or a selected component, representing an
4468 -- appropriately qualified occurrence of the subtype name.
4470 procedure Replace_Type_References is
4471 new Replace_Type_References_Generic (Replace_Type_Reference);
4472 -- Traverse an expression replacing all occurrences of the subtype
4473 -- name with appropriate references to the object that is the formal
4474 -- parameter of the predicate function. Note that we must ensure
4475 -- that the type and entity information is properly set in the
4476 -- replacement node, since we will do a Preanalyze call of this
4477 -- expression without proper visibility of the procedure argument.
4479 ----------------------------
4480 -- Replace_Type_Reference --
4481 ----------------------------
4483 procedure Replace_Type_Reference (N : Node_Id) is
4485 -- Invariant'Class, replace with T'Class (obj)
4487 if Class_Present (Ritem) then
4489 Make_Type_Conversion (Loc,
4491 Make_Attribute_Reference (Loc,
4492 Prefix => New_Occurrence_Of (T, Loc),
4493 Attribute_Name => Name_Class),
4494 Expression => Make_Identifier (Loc, Object_Name)));
4496 Set_Entity (Expression (N), Object_Entity);
4497 Set_Etype (Expression (N), Typ);
4499 -- Invariant, replace with obj
4502 Rewrite (N, Make_Identifier (Loc, Object_Name));
4503 Set_Entity (N, Object_Entity);
4506 end Replace_Type_Reference;
4508 -- Start of processing for Add_Invariants
4511 Ritem := First_Rep_Item (T);
4512 while Present (Ritem) loop
4513 if Nkind (Ritem) = N_Pragma
4514 and then Pragma_Name (Ritem) = Name_Invariant
4516 Arg1 := First (Pragma_Argument_Associations (Ritem));
4517 Arg2 := Next (Arg1);
4518 Arg3 := Next (Arg2);
4520 Arg1 := Get_Pragma_Arg (Arg1);
4521 Arg2 := Get_Pragma_Arg (Arg2);
4523 -- For Inherit case, ignore Invariant, process only Class case
4526 if not Class_Present (Ritem) then
4530 -- For Inherit false, process only item for right type
4533 if Entity (Arg1) /= Typ then
4539 Stmts := Empty_List;
4542 Exp := New_Copy_Tree (Arg2);
4545 -- We need to replace any occurrences of the name of the type
4546 -- with references to the object, converted to type'Class in
4547 -- the case of Invariant'Class aspects.
4549 Replace_Type_References (Exp, Chars (T));
4551 -- If this invariant comes from an aspect, find the aspect
4552 -- specification, and replace the saved expression because
4553 -- we need the subtype references replaced for the calls to
4554 -- Preanalyze_Spec_Expressin in Check_Aspect_At_Freeze_Point
4555 -- and Check_Aspect_At_End_Of_Declarations.
4557 if From_Aspect_Specification (Ritem) then
4562 -- Loop to find corresponding aspect, note that this
4563 -- must be present given the pragma is marked delayed.
4565 Aitem := Next_Rep_Item (Ritem);
4566 while Present (Aitem) loop
4567 if Nkind (Aitem) = N_Aspect_Specification
4568 and then Aspect_Rep_Item (Aitem) = Ritem
4571 (Identifier (Aitem), New_Copy_Tree (Exp));
4575 Aitem := Next_Rep_Item (Aitem);
4580 -- Now we need to preanalyze the expression to properly capture
4581 -- the visibility in the visible part. The expression will not
4582 -- be analyzed for real until the body is analyzed, but that is
4583 -- at the end of the private part and has the wrong visibility.
4585 Set_Parent (Exp, N);
4586 Preanalyze_Spec_Expression (Exp, Standard_Boolean);
4588 -- Build first two arguments for Check pragma
4591 Make_Pragma_Argument_Association (Loc,
4592 Expression => Make_Identifier (Loc, Name_Invariant)),
4593 Make_Pragma_Argument_Association (Loc, Expression => Exp));
4595 -- Add message if present in Invariant pragma
4597 if Present (Arg3) then
4598 Str := Strval (Get_Pragma_Arg (Arg3));
4600 -- If inherited case, and message starts "failed invariant",
4601 -- change it to be "failed inherited invariant".
4604 String_To_Name_Buffer (Str);
4606 if Name_Buffer (1 .. 16) = "failed invariant" then
4607 Insert_Str_In_Name_Buffer ("inherited ", 8);
4608 Str := String_From_Name_Buffer;
4613 Make_Pragma_Argument_Association (Loc,
4614 Expression => Make_String_Literal (Loc, Str)));
4617 -- Add Check pragma to list of statements
4621 Pragma_Identifier =>
4622 Make_Identifier (Loc, Name_Check),
4623 Pragma_Argument_Associations => Assoc));
4625 -- If Inherited case and option enabled, output info msg. Note
4626 -- that we know this is a case of Invariant'Class.
4628 if Inherit and Opt.List_Inherited_Aspects then
4629 Error_Msg_Sloc := Sloc (Ritem);
4631 ("?info: & inherits `Invariant''Class` aspect from #",
4637 Next_Rep_Item (Ritem);
4641 -- Start of processing for Build_Invariant_Procedure
4647 Set_Etype (Object_Entity, Typ);
4649 -- Add invariants for the current type
4651 Add_Invariants (Typ, Inherit => False);
4653 -- Add invariants for parent types
4656 Current_Typ : Entity_Id;
4657 Parent_Typ : Entity_Id;
4662 Parent_Typ := Etype (Current_Typ);
4664 if Is_Private_Type (Parent_Typ)
4665 and then Present (Full_View (Base_Type (Parent_Typ)))
4667 Parent_Typ := Full_View (Base_Type (Parent_Typ));
4670 exit when Parent_Typ = Current_Typ;
4672 Current_Typ := Parent_Typ;
4673 Add_Invariants (Current_Typ, Inherit => True);
4677 -- Build the procedure if we generated at least one Check pragma
4679 if Stmts /= No_List then
4681 -- Build procedure declaration
4684 Make_Defining_Identifier (Loc,
4685 Chars => New_External_Name (Chars (Typ), "Invariant"));
4686 Set_Has_Invariants (SId);
4687 Set_Invariant_Procedure (Typ, SId);
4690 Make_Procedure_Specification (Loc,
4691 Defining_Unit_Name => SId,
4692 Parameter_Specifications => New_List (
4693 Make_Parameter_Specification (Loc,
4694 Defining_Identifier => Object_Entity,
4695 Parameter_Type => New_Occurrence_Of (Typ, Loc))));
4697 PDecl := Make_Subprogram_Declaration (Loc, Specification => Spec);
4699 -- Build procedure body
4702 Make_Defining_Identifier (Loc,
4703 Chars => New_External_Name (Chars (Typ), "Invariant"));
4706 Make_Procedure_Specification (Loc,
4707 Defining_Unit_Name => SId,
4708 Parameter_Specifications => New_List (
4709 Make_Parameter_Specification (Loc,
4710 Defining_Identifier =>
4711 Make_Defining_Identifier (Loc, Object_Name),
4712 Parameter_Type => New_Occurrence_Of (Typ, Loc))));
4715 Make_Subprogram_Body (Loc,
4716 Specification => Spec,
4717 Declarations => Empty_List,
4718 Handled_Statement_Sequence =>
4719 Make_Handled_Sequence_Of_Statements (Loc,
4720 Statements => Stmts));
4722 -- Insert procedure declaration and spec at the appropriate points.
4723 -- Skip this if there are no private declarations (that's an error
4724 -- that will be diagnosed elsewhere, and there is no point in having
4725 -- an invariant procedure set if the full declaration is missing).
4727 if Present (Private_Decls) then
4729 -- The spec goes at the end of visible declarations, but they have
4730 -- already been analyzed, so we need to explicitly do the analyze.
4732 Append_To (Visible_Decls, PDecl);
4735 -- The body goes at the end of the private declarations, which we
4736 -- have not analyzed yet, so we do not need to perform an explicit
4737 -- analyze call. We skip this if there are no private declarations
4738 -- (this is an error that will be caught elsewhere);
4740 Append_To (Private_Decls, PBody);
4742 -- If the invariant appears on the full view of a type, the
4743 -- analysis of the private part is complete, and we must
4744 -- analyze the new body explicitly.
4746 if In_Private_Part (Current_Scope) then
4751 end Build_Invariant_Procedure;
4753 ------------------------------
4754 -- Build_Predicate_Function --
4755 ------------------------------
4757 -- The procedure that is constructed here has the form
4759 -- function typPredicate (Ixxx : typ) return Boolean is
4762 -- exp1 and then exp2 and then ...
4763 -- and then typ1Predicate (typ1 (Ixxx))
4764 -- and then typ2Predicate (typ2 (Ixxx))
4766 -- end typPredicate;
4768 -- Here exp1, and exp2 are expressions from Predicate pragmas. Note that
4769 -- this is the point at which these expressions get analyzed, providing the
4770 -- required delay, and typ1, typ2, are entities from which predicates are
4771 -- inherited. Note that we do NOT generate Check pragmas, that's because we
4772 -- use this function even if checks are off, e.g. for membership tests.
4774 procedure Build_Predicate_Function (Typ : Entity_Id; N : Node_Id) is
4775 Loc : constant Source_Ptr := Sloc (Typ);
4782 -- This is the expression for the return statement in the function. It
4783 -- is build by connecting the component predicates with AND THEN.
4785 procedure Add_Call (T : Entity_Id);
4786 -- Includes a call to the predicate function for type T in Expr if T
4787 -- has predicates and Predicate_Function (T) is non-empty.
4789 procedure Add_Predicates;
4790 -- Appends expressions for any Predicate pragmas in the rep item chain
4791 -- Typ to Expr. Note that we look only at items for this exact entity.
4792 -- Inheritance of predicates for the parent type is done by calling the
4793 -- Predicate_Function of the parent type, using Add_Call above.
4795 Object_Name : constant Name_Id := New_Internal_Name ('I');
4796 -- Name for argument of Predicate procedure
4798 Object_Entity : constant Entity_Id :=
4799 Make_Defining_Identifier (Loc, Object_Name);
4800 -- The entity for the spec entity for the argument
4802 Dynamic_Predicate_Present : Boolean := False;
4803 -- Set True if a dynamic predicate is present, results in the entire
4804 -- predicate being considered dynamic even if it looks static
4806 Static_Predicate_Present : Node_Id := Empty;
4807 -- Set to N_Pragma node for a static predicate if one is encountered.
4813 procedure Add_Call (T : Entity_Id) is
4817 if Present (T) and then Present (Predicate_Function (T)) then
4818 Set_Has_Predicates (Typ);
4820 -- Build the call to the predicate function of T
4824 (T, Convert_To (T, Make_Identifier (Loc, Object_Name)));
4826 -- Add call to evolving expression, using AND THEN if needed
4833 Left_Opnd => Relocate_Node (Expr),
4837 -- Output info message on inheritance if required. Note we do not
4838 -- give this information for generic actual types, since it is
4839 -- unwelcome noise in that case in instantiations. We also
4840 -- generally suppress the message in instantiations, and also
4841 -- if it involves internal names.
4843 if Opt.List_Inherited_Aspects
4844 and then not Is_Generic_Actual_Type (Typ)
4845 and then Instantiation_Depth (Sloc (Typ)) = 0
4846 and then not Is_Internal_Name (Chars (T))
4847 and then not Is_Internal_Name (Chars (Typ))
4849 Error_Msg_Sloc := Sloc (Predicate_Function (T));
4850 Error_Msg_Node_2 := T;
4851 Error_Msg_N ("?info: & inherits predicate from & #", Typ);
4856 --------------------
4857 -- Add_Predicates --
4858 --------------------
4860 procedure Add_Predicates is
4865 procedure Replace_Type_Reference (N : Node_Id);
4866 -- Replace a single occurrence N of the subtype name with a reference
4867 -- to the formal of the predicate function. N can be an identifier
4868 -- referencing the subtype, or a selected component, representing an
4869 -- appropriately qualified occurrence of the subtype name.
4871 procedure Replace_Type_References is
4872 new Replace_Type_References_Generic (Replace_Type_Reference);
4873 -- Traverse an expression changing every occurrence of an identifier
4874 -- whose name matches the name of the subtype with a reference to
4875 -- the formal parameter of the predicate function.
4877 ----------------------------
4878 -- Replace_Type_Reference --
4879 ----------------------------
4881 procedure Replace_Type_Reference (N : Node_Id) is
4883 Rewrite (N, Make_Identifier (Loc, Object_Name));
4884 Set_Entity (N, Object_Entity);
4886 end Replace_Type_Reference;
4888 -- Start of processing for Add_Predicates
4891 Ritem := First_Rep_Item (Typ);
4892 while Present (Ritem) loop
4893 if Nkind (Ritem) = N_Pragma
4894 and then Pragma_Name (Ritem) = Name_Predicate
4896 if Present (Corresponding_Aspect (Ritem)) then
4897 case Chars (Identifier (Corresponding_Aspect (Ritem))) is
4898 when Name_Dynamic_Predicate =>
4899 Dynamic_Predicate_Present := True;
4900 when Name_Static_Predicate =>
4901 Static_Predicate_Present := Ritem;
4907 -- Acquire arguments
4909 Arg1 := First (Pragma_Argument_Associations (Ritem));
4910 Arg2 := Next (Arg1);
4912 Arg1 := Get_Pragma_Arg (Arg1);
4913 Arg2 := Get_Pragma_Arg (Arg2);
4915 -- See if this predicate pragma is for the current type or for
4916 -- its full view. A predicate on a private completion is placed
4917 -- on the partial view beause this is the visible entity that
4920 if Entity (Arg1) = Typ
4921 or else Full_View (Entity (Arg1)) = Typ
4924 -- We have a match, this entry is for our subtype
4926 -- We need to replace any occurrences of the name of the
4927 -- type with references to the object.
4929 Replace_Type_References (Arg2, Chars (Typ));
4931 -- If this predicate comes from an aspect, find the aspect
4932 -- specification, and replace the saved expression because
4933 -- we need the subtype references replaced for the calls to
4934 -- Preanalyze_Spec_Expressin in Check_Aspect_At_Freeze_Point
4935 -- and Check_Aspect_At_End_Of_Declarations.
4937 if From_Aspect_Specification (Ritem) then
4942 -- Loop to find corresponding aspect, note that this
4943 -- must be present given the pragma is marked delayed.
4945 Aitem := Next_Rep_Item (Ritem);
4947 if Nkind (Aitem) = N_Aspect_Specification
4948 and then Aspect_Rep_Item (Aitem) = Ritem
4951 (Identifier (Aitem), New_Copy_Tree (Arg2));
4955 Aitem := Next_Rep_Item (Aitem);
4960 -- Now we can add the expression
4963 Expr := Relocate_Node (Arg2);
4965 -- There already was a predicate, so add to it
4970 Left_Opnd => Relocate_Node (Expr),
4971 Right_Opnd => Relocate_Node (Arg2));
4976 Next_Rep_Item (Ritem);
4980 -- Start of processing for Build_Predicate_Function
4983 -- Initialize for construction of statement list
4987 -- Return if already built or if type does not have predicates
4989 if not Has_Predicates (Typ)
4990 or else Present (Predicate_Function (Typ))
4995 -- Add Predicates for the current type
4999 -- Add predicates for ancestor if present
5002 Atyp : constant Entity_Id := Nearest_Ancestor (Typ);
5004 if Present (Atyp) then
5009 -- If we have predicates, build the function
5011 if Present (Expr) then
5013 -- Build function declaration
5015 pragma Assert (Has_Predicates (Typ));
5017 Make_Defining_Identifier (Loc,
5018 Chars => New_External_Name (Chars (Typ), "Predicate"));
5019 Set_Has_Predicates (SId);
5020 Set_Predicate_Function (Typ, SId);
5023 Make_Function_Specification (Loc,
5024 Defining_Unit_Name => SId,
5025 Parameter_Specifications => New_List (
5026 Make_Parameter_Specification (Loc,
5027 Defining_Identifier => Object_Entity,
5028 Parameter_Type => New_Occurrence_Of (Typ, Loc))),
5029 Result_Definition =>
5030 New_Occurrence_Of (Standard_Boolean, Loc));
5032 FDecl := Make_Subprogram_Declaration (Loc, Specification => Spec);
5034 -- Build function body
5037 Make_Defining_Identifier (Loc,
5038 Chars => New_External_Name (Chars (Typ), "Predicate"));
5041 Make_Function_Specification (Loc,
5042 Defining_Unit_Name => SId,
5043 Parameter_Specifications => New_List (
5044 Make_Parameter_Specification (Loc,
5045 Defining_Identifier =>
5046 Make_Defining_Identifier (Loc, Object_Name),
5048 New_Occurrence_Of (Typ, Loc))),
5049 Result_Definition =>
5050 New_Occurrence_Of (Standard_Boolean, Loc));
5053 Make_Subprogram_Body (Loc,
5054 Specification => Spec,
5055 Declarations => Empty_List,
5056 Handled_Statement_Sequence =>
5057 Make_Handled_Sequence_Of_Statements (Loc,
5058 Statements => New_List (
5059 Make_Simple_Return_Statement (Loc,
5060 Expression => Expr))));
5062 -- Insert declaration before freeze node and body after
5064 Insert_Before_And_Analyze (N, FDecl);
5065 Insert_After_And_Analyze (N, FBody);
5067 -- Deal with static predicate case
5069 if Ekind_In (Typ, E_Enumeration_Subtype,
5070 E_Modular_Integer_Subtype,
5071 E_Signed_Integer_Subtype)
5072 and then Is_Static_Subtype (Typ)
5073 and then not Dynamic_Predicate_Present
5075 Build_Static_Predicate (Typ, Expr, Object_Name);
5077 if Present (Static_Predicate_Present)
5078 and No (Static_Predicate (Typ))
5081 ("expression does not have required form for "
5082 & "static predicate",
5083 Next (First (Pragma_Argument_Associations
5084 (Static_Predicate_Present))));
5088 end Build_Predicate_Function;
5090 ----------------------------
5091 -- Build_Static_Predicate --
5092 ----------------------------
5094 procedure Build_Static_Predicate
5099 Loc : constant Source_Ptr := Sloc (Expr);
5101 Non_Static : exception;
5102 -- Raised if something non-static is found
5104 Btyp : constant Entity_Id := Base_Type (Typ);
5106 BLo : constant Uint := Expr_Value (Type_Low_Bound (Btyp));
5107 BHi : constant Uint := Expr_Value (Type_High_Bound (Btyp));
5108 -- Low bound and high bound value of base type of Typ
5110 TLo : constant Uint := Expr_Value (Type_Low_Bound (Typ));
5111 THi : constant Uint := Expr_Value (Type_High_Bound (Typ));
5112 -- Low bound and high bound values of static subtype Typ
5117 -- One entry in a Rlist value, a single REnt (range entry) value
5118 -- denotes one range from Lo to Hi. To represent a single value
5119 -- range Lo = Hi = value.
5121 type RList is array (Nat range <>) of REnt;
5122 -- A list of ranges. The ranges are sorted in increasing order,
5123 -- and are disjoint (there is a gap of at least one value between
5124 -- each range in the table). A value is in the set of ranges in
5125 -- Rlist if it lies within one of these ranges
5127 False_Range : constant RList :=
5128 RList'(1 .. 0 => REnt'(No_Uint, No_Uint));
5129 -- An empty set of ranges represents a range list that can never be
5130 -- satisfied, since there are no ranges in which the value could lie,
5131 -- so it does not lie in any of them. False_Range is a canonical value
5132 -- for this empty set, but general processing should test for an Rlist
5133 -- with length zero (see Is_False predicate), since other null ranges
5134 -- may appear which must be treated as False.
5136 True_Range : constant RList := RList'(1 => REnt'(BLo, BHi));
5137 -- Range representing True, value must be in the base range
5139 function "and" (Left, Right : RList) return RList;
5140 -- And's together two range lists, returning a range list. This is
5141 -- a set intersection operation.
5143 function "or" (Left, Right : RList) return RList;
5144 -- Or's together two range lists, returning a range list. This is a
5145 -- set union operation.
5147 function "not" (Right : RList) return RList;
5148 -- Returns complement of a given range list, i.e. a range list
5149 -- representing all the values in TLo .. THi that are not in the
5150 -- input operand Right.
5152 function Build_Val (V : Uint) return Node_Id;
5153 -- Return an analyzed N_Identifier node referencing this value, suitable
5154 -- for use as an entry in the Static_Predicate list. This node is typed
5155 -- with the base type.
5157 function Build_Range (Lo, Hi : Uint) return Node_Id;
5158 -- Return an analyzed N_Range node referencing this range, suitable
5159 -- for use as an entry in the Static_Predicate list. This node is typed
5160 -- with the base type.
5162 function Get_RList (Exp : Node_Id) return RList;
5163 -- This is a recursive routine that converts the given expression into
5164 -- a list of ranges, suitable for use in building the static predicate.
5166 function Is_False (R : RList) return Boolean;
5167 pragma Inline (Is_False);
5168 -- Returns True if the given range list is empty, and thus represents
5169 -- a False list of ranges that can never be satisfied.
5171 function Is_True (R : RList) return Boolean;
5172 -- Returns True if R trivially represents the True predicate by having
5173 -- a single range from BLo to BHi.
5175 function Is_Type_Ref (N : Node_Id) return Boolean;
5176 pragma Inline (Is_Type_Ref);
5177 -- Returns if True if N is a reference to the type for the predicate in
5178 -- the expression (i.e. if it is an identifier whose Chars field matches
5179 -- the Nam given in the call).
5181 function Lo_Val (N : Node_Id) return Uint;
5182 -- Given static expression or static range from a Static_Predicate list,
5183 -- gets expression value or low bound of range.
5185 function Hi_Val (N : Node_Id) return Uint;
5186 -- Given static expression or static range from a Static_Predicate list,
5187 -- gets expression value of high bound of range.
5189 function Membership_Entry (N : Node_Id) return RList;
5190 -- Given a single membership entry (range, value, or subtype), returns
5191 -- the corresponding range list. Raises Static_Error if not static.
5193 function Membership_Entries (N : Node_Id) return RList;
5194 -- Given an element on an alternatives list of a membership operation,
5195 -- returns the range list corresponding to this entry and all following
5196 -- entries (i.e. returns the "or" of this list of values).
5198 function Stat_Pred (Typ : Entity_Id) return RList;
5199 -- Given a type, if it has a static predicate, then return the predicate
5200 -- as a range list, otherwise raise Non_Static.
5206 function "and" (Left, Right : RList) return RList is
5208 -- First range of result
5210 SLeft : Nat := Left'First;
5211 -- Start of rest of left entries
5213 SRight : Nat := Right'First;
5214 -- Start of rest of right entries
5217 -- If either range is True, return the other
5219 if Is_True (Left) then
5221 elsif Is_True (Right) then
5225 -- If either range is False, return False
5227 if Is_False (Left) or else Is_False (Right) then
5231 -- Loop to remove entries at start that are disjoint, and thus
5232 -- just get discarded from the result entirely.
5235 -- If no operands left in either operand, result is false
5237 if SLeft > Left'Last or else SRight > Right'Last then
5240 -- Discard first left operand entry if disjoint with right
5242 elsif Left (SLeft).Hi < Right (SRight).Lo then
5245 -- Discard first right operand entry if disjoint with left
5247 elsif Right (SRight).Hi < Left (SLeft).Lo then
5248 SRight := SRight + 1;
5250 -- Otherwise we have an overlapping entry
5257 -- Now we have two non-null operands, and first entries overlap.
5258 -- The first entry in the result will be the overlapping part of
5259 -- these two entries.
5261 FEnt := REnt'(Lo => UI_Max (Left (SLeft).Lo, Right (SRight).Lo),
5262 Hi => UI_Min (Left (SLeft).Hi, Right (SRight).Hi));
5264 -- Now we can remove the entry that ended at a lower value, since
5265 -- its contribution is entirely contained in Fent.
5267 if Left (SLeft).Hi <= Right (SRight).Hi then
5270 SRight := SRight + 1;
5273 -- Compute result by concatenating this first entry with the "and"
5274 -- of the remaining parts of the left and right operands. Note that
5275 -- if either of these is empty, "and" will yield empty, so that we
5276 -- will end up with just Fent, which is what we want in that case.
5279 FEnt & (Left (SLeft .. Left'Last) and Right (SRight .. Right'Last));
5286 function "not" (Right : RList) return RList is
5288 -- Return True if False range
5290 if Is_False (Right) then
5294 -- Return False if True range
5296 if Is_True (Right) then
5300 -- Here if not trivial case
5303 Result : RList (1 .. Right'Length + 1);
5304 -- May need one more entry for gap at beginning and end
5307 -- Number of entries stored in Result
5312 if Right (Right'First).Lo > TLo then
5314 Result (Count) := REnt'(TLo, Right (Right'First).Lo - 1);
5317 -- Gaps between ranges
5319 for J in Right'First .. Right'Last - 1 loop
5322 REnt'(Right (J).Hi + 1, Right (J + 1).Lo - 1);
5327 if Right (Right'Last).Hi < THi then
5329 Result (Count) := REnt'(Right (Right'Last).Hi + 1, THi);
5332 return Result (1 .. Count);
5340 function "or" (Left, Right : RList) return RList is
5342 -- First range of result
5344 SLeft : Nat := Left'First;
5345 -- Start of rest of left entries
5347 SRight : Nat := Right'First;
5348 -- Start of rest of right entries
5351 -- If either range is True, return True
5353 if Is_True (Left) or else Is_True (Right) then
5357 -- If either range is False (empty), return the other
5359 if Is_False (Left) then
5361 elsif Is_False (Right) then
5365 -- Initialize result first entry from left or right operand
5366 -- depending on which starts with the lower range.
5368 if Left (SLeft).Lo < Right (SRight).Lo then
5369 FEnt := Left (SLeft);
5372 FEnt := Right (SRight);
5373 SRight := SRight + 1;
5376 -- This loop eats ranges from left and right operands that
5377 -- are contiguous with the first range we are gathering.
5380 -- Eat first entry in left operand if contiguous or
5381 -- overlapped by gathered first operand of result.
5383 if SLeft <= Left'Last
5384 and then Left (SLeft).Lo <= FEnt.Hi + 1
5386 FEnt.Hi := UI_Max (FEnt.Hi, Left (SLeft).Hi);
5389 -- Eat first entry in right operand if contiguous or
5390 -- overlapped by gathered right operand of result.
5392 elsif SRight <= Right'Last
5393 and then Right (SRight).Lo <= FEnt.Hi + 1
5395 FEnt.Hi := UI_Max (FEnt.Hi, Right (SRight).Hi);
5396 SRight := SRight + 1;
5398 -- All done if no more entries to eat!
5405 -- Obtain result as the first entry we just computed, concatenated
5406 -- to the "or" of the remaining results (if one operand is empty,
5407 -- this will just concatenate with the other
5410 FEnt & (Left (SLeft .. Left'Last) or Right (SRight .. Right'Last));
5417 function Build_Range (Lo, Hi : Uint) return Node_Id is
5421 return Build_Val (Hi);
5425 Low_Bound => Build_Val (Lo),
5426 High_Bound => Build_Val (Hi));
5427 Set_Etype (Result, Btyp);
5428 Set_Analyzed (Result);
5437 function Build_Val (V : Uint) return Node_Id is
5441 if Is_Enumeration_Type (Typ) then
5442 Result := Get_Enum_Lit_From_Pos (Typ, V, Loc);
5444 Result := Make_Integer_Literal (Loc, V);
5447 Set_Etype (Result, Btyp);
5448 Set_Is_Static_Expression (Result);
5449 Set_Analyzed (Result);
5457 function Get_RList (Exp : Node_Id) return RList is
5462 -- Static expression can only be true or false
5464 if Is_OK_Static_Expression (Exp) then
5468 if Expr_Value (Exp) = 0 then
5475 -- Otherwise test node type
5483 when N_Op_And | N_And_Then =>
5484 return Get_RList (Left_Opnd (Exp))
5486 Get_RList (Right_Opnd (Exp));
5490 when N_Op_Or | N_Or_Else =>
5491 return Get_RList (Left_Opnd (Exp))
5493 Get_RList (Right_Opnd (Exp));
5498 return not Get_RList (Right_Opnd (Exp));
5500 -- Comparisons of type with static value
5502 when N_Op_Compare =>
5503 -- Type is left operand
5505 if Is_Type_Ref (Left_Opnd (Exp))
5506 and then Is_OK_Static_Expression (Right_Opnd (Exp))
5508 Val := Expr_Value (Right_Opnd (Exp));
5510 -- Typ is right operand
5512 elsif Is_Type_Ref (Right_Opnd (Exp))
5513 and then Is_OK_Static_Expression (Left_Opnd (Exp))
5515 Val := Expr_Value (Left_Opnd (Exp));
5517 -- Invert sense of comparison
5520 when N_Op_Gt => Op := N_Op_Lt;
5521 when N_Op_Lt => Op := N_Op_Gt;
5522 when N_Op_Ge => Op := N_Op_Le;
5523 when N_Op_Le => Op := N_Op_Ge;
5524 when others => null;
5527 -- Other cases are non-static
5533 -- Construct range according to comparison operation
5537 return RList'(1 => REnt'(Val, Val));
5540 return RList'(1 => REnt'(Val, BHi));
5543 return RList'(1 => REnt'(Val + 1, BHi));
5546 return RList'(1 => REnt'(BLo, Val));
5549 return RList'(1 => REnt'(BLo, Val - 1));
5552 return RList'(REnt'(BLo, Val - 1),
5553 REnt'(Val + 1, BHi));
5556 raise Program_Error;
5562 if not Is_Type_Ref (Left_Opnd (Exp)) then
5566 if Present (Right_Opnd (Exp)) then
5567 return Membership_Entry (Right_Opnd (Exp));
5569 return Membership_Entries (First (Alternatives (Exp)));
5572 -- Negative membership (NOT IN)
5575 if not Is_Type_Ref (Left_Opnd (Exp)) then
5579 if Present (Right_Opnd (Exp)) then
5580 return not Membership_Entry (Right_Opnd (Exp));
5582 return not Membership_Entries (First (Alternatives (Exp)));
5585 -- Function call, may be call to static predicate
5587 when N_Function_Call =>
5588 if Is_Entity_Name (Name (Exp)) then
5590 Ent : constant Entity_Id := Entity (Name (Exp));
5592 if Has_Predicates (Ent) then
5593 return Stat_Pred (Etype (First_Formal (Ent)));
5598 -- Other function call cases are non-static
5602 -- Qualified expression, dig out the expression
5604 when N_Qualified_Expression =>
5605 return Get_RList (Expression (Exp));
5610 return (Get_RList (Left_Opnd (Exp))
5611 and not Get_RList (Right_Opnd (Exp)))
5612 or (Get_RList (Right_Opnd (Exp))
5613 and not Get_RList (Left_Opnd (Exp)));
5615 -- Any other node type is non-static
5626 function Hi_Val (N : Node_Id) return Uint is
5628 if Is_Static_Expression (N) then
5629 return Expr_Value (N);
5631 pragma Assert (Nkind (N) = N_Range);
5632 return Expr_Value (High_Bound (N));
5640 function Is_False (R : RList) return Boolean is
5642 return R'Length = 0;
5649 function Is_True (R : RList) return Boolean is
5652 and then R (R'First).Lo = BLo
5653 and then R (R'First).Hi = BHi;
5660 function Is_Type_Ref (N : Node_Id) return Boolean is
5662 return Nkind (N) = N_Identifier and then Chars (N) = Nam;
5669 function Lo_Val (N : Node_Id) return Uint is
5671 if Is_Static_Expression (N) then
5672 return Expr_Value (N);
5674 pragma Assert (Nkind (N) = N_Range);
5675 return Expr_Value (Low_Bound (N));
5679 ------------------------
5680 -- Membership_Entries --
5681 ------------------------
5683 function Membership_Entries (N : Node_Id) return RList is
5685 if No (Next (N)) then
5686 return Membership_Entry (N);
5688 return Membership_Entry (N) or Membership_Entries (Next (N));
5690 end Membership_Entries;
5692 ----------------------
5693 -- Membership_Entry --
5694 ----------------------
5696 function Membership_Entry (N : Node_Id) return RList is
5704 if Nkind (N) = N_Range then
5705 if not Is_Static_Expression (Low_Bound (N))
5707 not Is_Static_Expression (High_Bound (N))
5711 SLo := Expr_Value (Low_Bound (N));
5712 SHi := Expr_Value (High_Bound (N));
5713 return RList'(1 => REnt'(SLo, SHi));
5716 -- Static expression case
5718 elsif Is_Static_Expression (N) then
5719 Val := Expr_Value (N);
5720 return RList'(1 => REnt'(Val, Val));
5722 -- Identifier (other than static expression) case
5724 else pragma Assert (Nkind (N) = N_Identifier);
5728 if Is_Type (Entity (N)) then
5730 -- If type has predicates, process them
5732 if Has_Predicates (Entity (N)) then
5733 return Stat_Pred (Entity (N));
5735 -- For static subtype without predicates, get range
5737 elsif Is_Static_Subtype (Entity (N)) then
5738 SLo := Expr_Value (Type_Low_Bound (Entity (N)));
5739 SHi := Expr_Value (Type_High_Bound (Entity (N)));
5740 return RList'(1 => REnt'(SLo, SHi));
5742 -- Any other type makes us non-static
5748 -- Any other kind of identifier in predicate (e.g. a non-static
5749 -- expression value) means this is not a static predicate.
5755 end Membership_Entry;
5761 function Stat_Pred (Typ : Entity_Id) return RList is
5763 -- Not static if type does not have static predicates
5765 if not Has_Predicates (Typ)
5766 or else No (Static_Predicate (Typ))
5771 -- Otherwise we convert the predicate list to a range list
5774 Result : RList (1 .. List_Length (Static_Predicate (Typ)));
5778 P := First (Static_Predicate (Typ));
5779 for J in Result'Range loop
5780 Result (J) := REnt'(Lo_Val (P), Hi_Val (P));
5788 -- Start of processing for Build_Static_Predicate
5791 -- Now analyze the expression to see if it is a static predicate
5794 Ranges : constant RList := Get_RList (Expr);
5795 -- Range list from expression if it is static
5800 -- Convert range list into a form for the static predicate. In the
5801 -- Ranges array, we just have raw ranges, these must be converted
5802 -- to properly typed and analyzed static expressions or range nodes.
5804 -- Note: here we limit ranges to the ranges of the subtype, so that
5805 -- a predicate is always false for values outside the subtype. That
5806 -- seems fine, such values are invalid anyway, and considering them
5807 -- to fail the predicate seems allowed and friendly, and furthermore
5808 -- simplifies processing for case statements and loops.
5812 for J in Ranges'Range loop
5814 Lo : Uint := Ranges (J).Lo;
5815 Hi : Uint := Ranges (J).Hi;
5818 -- Ignore completely out of range entry
5820 if Hi < TLo or else Lo > THi then
5823 -- Otherwise process entry
5826 -- Adjust out of range value to subtype range
5836 -- Convert range into required form
5839 Append_To (Plist, Build_Val (Lo));
5841 Append_To (Plist, Build_Range (Lo, Hi));
5847 -- Processing was successful and all entries were static, so now we
5848 -- can store the result as the predicate list.
5850 Set_Static_Predicate (Typ, Plist);
5852 -- The processing for static predicates put the expression into
5853 -- canonical form as a series of ranges. It also eliminated
5854 -- duplicates and collapsed and combined ranges. We might as well
5855 -- replace the alternatives list of the right operand of the
5856 -- membership test with the static predicate list, which will
5857 -- usually be more efficient.
5860 New_Alts : constant List_Id := New_List;
5865 Old_Node := First (Plist);
5866 while Present (Old_Node) loop
5867 New_Node := New_Copy (Old_Node);
5869 if Nkind (New_Node) = N_Range then
5870 Set_Low_Bound (New_Node, New_Copy (Low_Bound (Old_Node)));
5871 Set_High_Bound (New_Node, New_Copy (High_Bound (Old_Node)));
5874 Append_To (New_Alts, New_Node);
5878 -- If empty list, replace by False
5880 if Is_Empty_List (New_Alts) then
5881 Rewrite (Expr, New_Occurrence_Of (Standard_False, Loc));
5883 -- Else replace by set membership test
5888 Left_Opnd => Make_Identifier (Loc, Nam),
5889 Right_Opnd => Empty,
5890 Alternatives => New_Alts));
5892 -- Resolve new expression in function context
5894 Install_Formals (Predicate_Function (Typ));
5895 Push_Scope (Predicate_Function (Typ));
5896 Analyze_And_Resolve (Expr, Standard_Boolean);
5902 -- If non-static, return doing nothing
5907 end Build_Static_Predicate;
5909 -----------------------------------------
5910 -- Check_Aspect_At_End_Of_Declarations --
5911 -----------------------------------------
5913 procedure Check_Aspect_At_End_Of_Declarations (ASN : Node_Id) is
5914 Ent : constant Entity_Id := Entity (ASN);
5915 Ident : constant Node_Id := Identifier (ASN);
5917 Freeze_Expr : constant Node_Id := Expression (ASN);
5918 -- Expression from call to Check_Aspect_At_Freeze_Point
5920 End_Decl_Expr : constant Node_Id := Entity (Ident);
5921 -- Expression to be analyzed at end of declarations
5923 T : constant Entity_Id := Etype (Freeze_Expr);
5924 -- Type required for preanalyze call
5926 A_Id : constant Aspect_Id := Get_Aspect_Id (Chars (Ident));
5929 -- Set False if error
5931 -- On entry to this procedure, Entity (Ident) contains a copy of the
5932 -- original expression from the aspect, saved for this purpose, and
5933 -- but Expression (Ident) is a preanalyzed copy of the expression,
5934 -- preanalyzed just after the freeze point.
5937 -- Case of stream attributes, just have to compare entities
5939 if A_Id = Aspect_Input or else
5940 A_Id = Aspect_Output or else
5941 A_Id = Aspect_Read or else
5944 Analyze (End_Decl_Expr);
5945 Err := Entity (End_Decl_Expr) /= Entity (Freeze_Expr);
5947 elsif A_Id = Aspect_Variable_Indexing or else
5948 A_Id = Aspect_Constant_Indexing or else
5949 A_Id = Aspect_Default_Iterator or else
5950 A_Id = Aspect_Iterator_Element
5952 -- Make type unfrozen before analysis, to prevent spurious errors
5953 -- about late attributes.
5955 Set_Is_Frozen (Ent, False);
5956 Analyze (End_Decl_Expr);
5957 Analyze (Aspect_Rep_Item (ASN));
5958 Set_Is_Frozen (Ent, True);
5960 -- If the end of declarations comes before any other freeze
5961 -- point, the Freeze_Expr is not analyzed: no check needed.
5964 Analyzed (Freeze_Expr)
5965 and then not In_Instance
5966 and then Entity (End_Decl_Expr) /= Entity (Freeze_Expr);
5971 -- In a generic context the aspect expressions have not been
5972 -- preanalyzed, so do it now. There are no conformance checks
5973 -- to perform in this case.
5976 Check_Aspect_At_Freeze_Point (ASN);
5979 Preanalyze_Spec_Expression (End_Decl_Expr, T);
5982 Err := not Fully_Conformant_Expressions (End_Decl_Expr, Freeze_Expr);
5985 -- Output error message if error
5989 ("visibility of aspect for& changes after freeze point",
5992 ("?info: & is frozen here, aspects evaluated at this point",
5993 Freeze_Node (Ent), Ent);
5995 end Check_Aspect_At_End_Of_Declarations;
5997 ----------------------------------
5998 -- Check_Aspect_At_Freeze_Point --
5999 ----------------------------------
6001 procedure Check_Aspect_At_Freeze_Point (ASN : Node_Id) is
6002 Ident : constant Node_Id := Identifier (ASN);
6003 -- Identifier (use Entity field to save expression)
6006 -- Type required for preanalyze call
6008 A_Id : constant Aspect_Id := Get_Aspect_Id (Chars (Ident));
6011 -- On entry to this procedure, Entity (Ident) contains a copy of the
6012 -- original expression from the aspect, saved for this purpose.
6014 -- On exit from this procedure Entity (Ident) is unchanged, still
6015 -- containing that copy, but Expression (Ident) is a preanalyzed copy
6016 -- of the expression, preanalyzed just after the freeze point.
6018 -- Make a copy of the expression to be preanalyed
6020 Set_Expression (ASN, New_Copy_Tree (Entity (Ident)));
6022 -- Find type for preanalyze call
6026 -- No_Aspect should be impossible
6029 raise Program_Error;
6031 -- Library unit aspects should be impossible (never delayed)
6033 when Library_Unit_Aspects =>
6034 raise Program_Error;
6036 -- Aspects taking an optional boolean argument. Should be impossible
6037 -- since these are never delayed.
6039 when Boolean_Aspects =>
6040 raise Program_Error;
6042 -- Test_Case aspect applies to entries and subprograms, hence should
6043 -- never be delayed.
6045 when Aspect_Test_Case =>
6046 raise Program_Error;
6048 when Aspect_Attach_Handler =>
6049 T := RTE (RE_Interrupt_ID);
6051 -- Default_Value is resolved with the type entity in question
6053 when Aspect_Default_Value =>
6056 -- Default_Component_Value is resolved with the component type
6058 when Aspect_Default_Component_Value =>
6059 T := Component_Type (Entity (ASN));
6061 -- Aspects corresponding to attribute definition clauses
6063 when Aspect_Address =>
6064 T := RTE (RE_Address);
6066 when Aspect_Bit_Order =>
6067 T := RTE (RE_Bit_Order);
6070 T := RTE (RE_CPU_Range);
6072 when Aspect_Dispatching_Domain =>
6073 T := RTE (RE_Dispatching_Domain);
6075 when Aspect_External_Tag =>
6076 T := Standard_String;
6078 when Aspect_Priority | Aspect_Interrupt_Priority =>
6079 T := Standard_Integer;
6081 when Aspect_Small =>
6082 T := Universal_Real;
6084 when Aspect_Storage_Pool =>
6085 T := Class_Wide_Type (RTE (RE_Root_Storage_Pool));
6087 when Aspect_Alignment |
6088 Aspect_Component_Size |
6089 Aspect_Machine_Radix |
6090 Aspect_Object_Size |
6092 Aspect_Storage_Size |
6093 Aspect_Stream_Size |
6094 Aspect_Value_Size =>
6097 -- Stream attribute. Special case, the expression is just an entity
6098 -- that does not need any resolution, so just analyze.
6104 Analyze (Expression (ASN));
6107 -- Same for Iterator aspects, where the expression is a function
6108 -- name. Legality rules are checked separately.
6110 when Aspect_Constant_Indexing |
6111 Aspect_Default_Iterator |
6112 Aspect_Iterator_Element |
6113 Aspect_Implicit_Dereference |
6114 Aspect_Variable_Indexing =>
6115 Analyze (Expression (ASN));
6118 -- Suppress/Unsuppress/Warnings should never be delayed
6120 when Aspect_Suppress |
6123 raise Program_Error;
6125 -- Pre/Post/Invariant/Predicate take boolean expressions
6127 when Aspect_Dynamic_Predicate |
6130 Aspect_Precondition |
6132 Aspect_Postcondition |
6134 Aspect_Static_Predicate |
6135 Aspect_Type_Invariant =>
6136 T := Standard_Boolean;
6138 when Aspect_Dimension |
6139 Aspect_Dimension_System =>
6140 raise Program_Error;
6144 -- Do the preanalyze call
6146 Preanalyze_Spec_Expression (Expression (ASN), T);
6147 end Check_Aspect_At_Freeze_Point;
6149 -----------------------------------
6150 -- Check_Constant_Address_Clause --
6151 -----------------------------------
6153 procedure Check_Constant_Address_Clause
6157 procedure Check_At_Constant_Address (Nod : Node_Id);
6158 -- Checks that the given node N represents a name whose 'Address is
6159 -- constant (in the same sense as OK_Constant_Address_Clause, i.e. the
6160 -- address value is the same at the point of declaration of U_Ent and at
6161 -- the time of elaboration of the address clause.
6163 procedure Check_Expr_Constants (Nod : Node_Id);
6164 -- Checks that Nod meets the requirements for a constant address clause
6165 -- in the sense of the enclosing procedure.
6167 procedure Check_List_Constants (Lst : List_Id);
6168 -- Check that all elements of list Lst meet the requirements for a
6169 -- constant address clause in the sense of the enclosing procedure.
6171 -------------------------------
6172 -- Check_At_Constant_Address --
6173 -------------------------------
6175 procedure Check_At_Constant_Address (Nod : Node_Id) is
6177 if Is_Entity_Name (Nod) then
6178 if Present (Address_Clause (Entity ((Nod)))) then
6180 ("invalid address clause for initialized object &!",
6183 ("address for& cannot" &
6184 " depend on another address clause! (RM 13.1(22))!",
6187 elsif In_Same_Source_Unit (Entity (Nod), U_Ent)
6188 and then Sloc (U_Ent) < Sloc (Entity (Nod))
6191 ("invalid address clause for initialized object &!",
6193 Error_Msg_Node_2 := U_Ent;
6195 ("\& must be defined before & (RM 13.1(22))!",
6199 elsif Nkind (Nod) = N_Selected_Component then
6201 T : constant Entity_Id := Etype (Prefix (Nod));
6204 if (Is_Record_Type (T)
6205 and then Has_Discriminants (T))
6208 and then Is_Record_Type (Designated_Type (T))
6209 and then Has_Discriminants (Designated_Type (T)))
6212 ("invalid address clause for initialized object &!",
6215 ("\address cannot depend on component" &
6216 " of discriminated record (RM 13.1(22))!",
6219 Check_At_Constant_Address (Prefix (Nod));
6223 elsif Nkind (Nod) = N_Indexed_Component then
6224 Check_At_Constant_Address (Prefix (Nod));
6225 Check_List_Constants (Expressions (Nod));
6228 Check_Expr_Constants (Nod);
6230 end Check_At_Constant_Address;
6232 --------------------------
6233 -- Check_Expr_Constants --
6234 --------------------------
6236 procedure Check_Expr_Constants (Nod : Node_Id) is
6237 Loc_U_Ent : constant Source_Ptr := Sloc (U_Ent);
6238 Ent : Entity_Id := Empty;
6241 if Nkind (Nod) in N_Has_Etype
6242 and then Etype (Nod) = Any_Type
6248 when N_Empty | N_Error =>
6251 when N_Identifier | N_Expanded_Name =>
6252 Ent := Entity (Nod);
6254 -- We need to look at the original node if it is different
6255 -- from the node, since we may have rewritten things and
6256 -- substituted an identifier representing the rewrite.
6258 if Original_Node (Nod) /= Nod then
6259 Check_Expr_Constants (Original_Node (Nod));
6261 -- If the node is an object declaration without initial
6262 -- value, some code has been expanded, and the expression
6263 -- is not constant, even if the constituents might be
6264 -- acceptable, as in A'Address + offset.
6266 if Ekind (Ent) = E_Variable
6268 Nkind (Declaration_Node (Ent)) = N_Object_Declaration
6270 No (Expression (Declaration_Node (Ent)))
6273 ("invalid address clause for initialized object &!",
6276 -- If entity is constant, it may be the result of expanding
6277 -- a check. We must verify that its declaration appears
6278 -- before the object in question, else we also reject the
6281 elsif Ekind (Ent) = E_Constant
6282 and then In_Same_Source_Unit (Ent, U_Ent)
6283 and then Sloc (Ent) > Loc_U_Ent
6286 ("invalid address clause for initialized object &!",
6293 -- Otherwise look at the identifier and see if it is OK
6295 if Ekind_In (Ent, E_Named_Integer, E_Named_Real)
6296 or else Is_Type (Ent)
6301 Ekind (Ent) = E_Constant
6303 Ekind (Ent) = E_In_Parameter
6305 -- This is the case where we must have Ent defined before
6306 -- U_Ent. Clearly if they are in different units this
6307 -- requirement is met since the unit containing Ent is
6308 -- already processed.
6310 if not In_Same_Source_Unit (Ent, U_Ent) then
6313 -- Otherwise location of Ent must be before the location
6314 -- of U_Ent, that's what prior defined means.
6316 elsif Sloc (Ent) < Loc_U_Ent then
6321 ("invalid address clause for initialized object &!",
6323 Error_Msg_Node_2 := U_Ent;
6325 ("\& must be defined before & (RM 13.1(22))!",
6329 elsif Nkind (Original_Node (Nod)) = N_Function_Call then
6330 Check_Expr_Constants (Original_Node (Nod));
6334 ("invalid address clause for initialized object &!",
6337 if Comes_From_Source (Ent) then
6339 ("\reference to variable& not allowed"
6340 & " (RM 13.1(22))!", Nod, Ent);
6343 ("non-static expression not allowed"
6344 & " (RM 13.1(22))!", Nod);
6348 when N_Integer_Literal =>
6350 -- If this is a rewritten unchecked conversion, in a system
6351 -- where Address is an integer type, always use the base type
6352 -- for a literal value. This is user-friendly and prevents
6353 -- order-of-elaboration issues with instances of unchecked
6356 if Nkind (Original_Node (Nod)) = N_Function_Call then
6357 Set_Etype (Nod, Base_Type (Etype (Nod)));
6360 when N_Real_Literal |
6362 N_Character_Literal =>
6366 Check_Expr_Constants (Low_Bound (Nod));
6367 Check_Expr_Constants (High_Bound (Nod));
6369 when N_Explicit_Dereference =>
6370 Check_Expr_Constants (Prefix (Nod));
6372 when N_Indexed_Component =>
6373 Check_Expr_Constants (Prefix (Nod));
6374 Check_List_Constants (Expressions (Nod));
6377 Check_Expr_Constants (Prefix (Nod));
6378 Check_Expr_Constants (Discrete_Range (Nod));
6380 when N_Selected_Component =>
6381 Check_Expr_Constants (Prefix (Nod));
6383 when N_Attribute_Reference =>
6384 if Attribute_Name (Nod) = Name_Address
6386 Attribute_Name (Nod) = Name_Access
6388 Attribute_Name (Nod) = Name_Unchecked_Access
6390 Attribute_Name (Nod) = Name_Unrestricted_Access
6392 Check_At_Constant_Address (Prefix (Nod));
6395 Check_Expr_Constants (Prefix (Nod));
6396 Check_List_Constants (Expressions (Nod));
6400 Check_List_Constants (Component_Associations (Nod));
6401 Check_List_Constants (Expressions (Nod));
6403 when N_Component_Association =>
6404 Check_Expr_Constants (Expression (Nod));
6406 when N_Extension_Aggregate =>
6407 Check_Expr_Constants (Ancestor_Part (Nod));
6408 Check_List_Constants (Component_Associations (Nod));
6409 Check_List_Constants (Expressions (Nod));
6414 when N_Binary_Op | N_Short_Circuit | N_Membership_Test =>
6415 Check_Expr_Constants (Left_Opnd (Nod));
6416 Check_Expr_Constants (Right_Opnd (Nod));
6419 Check_Expr_Constants (Right_Opnd (Nod));
6421 when N_Type_Conversion |
6422 N_Qualified_Expression |
6424 Check_Expr_Constants (Expression (Nod));
6426 when N_Unchecked_Type_Conversion =>
6427 Check_Expr_Constants (Expression (Nod));
6429 -- If this is a rewritten unchecked conversion, subtypes in
6430 -- this node are those created within the instance. To avoid
6431 -- order of elaboration issues, replace them with their base
6432 -- types. Note that address clauses can cause order of
6433 -- elaboration problems because they are elaborated by the
6434 -- back-end at the point of definition, and may mention
6435 -- entities declared in between (as long as everything is
6436 -- static). It is user-friendly to allow unchecked conversions
6439 if Nkind (Original_Node (Nod)) = N_Function_Call then
6440 Set_Etype (Expression (Nod),
6441 Base_Type (Etype (Expression (Nod))));
6442 Set_Etype (Nod, Base_Type (Etype (Nod)));
6445 when N_Function_Call =>
6446 if not Is_Pure (Entity (Name (Nod))) then
6448 ("invalid address clause for initialized object &!",
6452 ("\function & is not pure (RM 13.1(22))!",
6453 Nod, Entity (Name (Nod)));
6456 Check_List_Constants (Parameter_Associations (Nod));
6459 when N_Parameter_Association =>
6460 Check_Expr_Constants (Explicit_Actual_Parameter (Nod));
6464 ("invalid address clause for initialized object &!",
6467 ("\must be constant defined before& (RM 13.1(22))!",
6470 end Check_Expr_Constants;
6472 --------------------------
6473 -- Check_List_Constants --
6474 --------------------------
6476 procedure Check_List_Constants (Lst : List_Id) is
6480 if Present (Lst) then
6481 Nod1 := First (Lst);
6482 while Present (Nod1) loop
6483 Check_Expr_Constants (Nod1);
6487 end Check_List_Constants;
6489 -- Start of processing for Check_Constant_Address_Clause
6492 -- If rep_clauses are to be ignored, no need for legality checks. In
6493 -- particular, no need to pester user about rep clauses that violate
6494 -- the rule on constant addresses, given that these clauses will be
6495 -- removed by Freeze before they reach the back end.
6497 if not Ignore_Rep_Clauses then
6498 Check_Expr_Constants (Expr);
6500 end Check_Constant_Address_Clause;
6502 ----------------------------------------
6503 -- Check_Record_Representation_Clause --
6504 ----------------------------------------
6506 procedure Check_Record_Representation_Clause (N : Node_Id) is
6507 Loc : constant Source_Ptr := Sloc (N);
6508 Ident : constant Node_Id := Identifier (N);
6509 Rectype : Entity_Id;
6514 Hbit : Uint := Uint_0;
6518 Max_Bit_So_Far : Uint;
6519 -- Records the maximum bit position so far. If all field positions
6520 -- are monotonically increasing, then we can skip the circuit for
6521 -- checking for overlap, since no overlap is possible.
6523 Tagged_Parent : Entity_Id := Empty;
6524 -- This is set in the case of a derived tagged type for which we have
6525 -- Is_Fully_Repped_Tagged_Type True (indicating that all components are
6526 -- positioned by record representation clauses). In this case we must
6527 -- check for overlap between components of this tagged type, and the
6528 -- components of its parent. Tagged_Parent will point to this parent
6529 -- type. For all other cases Tagged_Parent is left set to Empty.
6531 Parent_Last_Bit : Uint;
6532 -- Relevant only if Tagged_Parent is set, Parent_Last_Bit indicates the
6533 -- last bit position for any field in the parent type. We only need to
6534 -- check overlap for fields starting below this point.
6536 Overlap_Check_Required : Boolean;
6537 -- Used to keep track of whether or not an overlap check is required
6539 Overlap_Detected : Boolean := False;
6540 -- Set True if an overlap is detected
6542 Ccount : Natural := 0;
6543 -- Number of component clauses in record rep clause
6545 procedure Check_Component_Overlap (C1_Ent, C2_Ent : Entity_Id);
6546 -- Given two entities for record components or discriminants, checks
6547 -- if they have overlapping component clauses and issues errors if so.
6549 procedure Find_Component;
6550 -- Finds component entity corresponding to current component clause (in
6551 -- CC), and sets Comp to the entity, and Fbit/Lbit to the zero origin
6552 -- start/stop bits for the field. If there is no matching component or
6553 -- if the matching component does not have a component clause, then
6554 -- that's an error and Comp is set to Empty, but no error message is
6555 -- issued, since the message was already given. Comp is also set to
6556 -- Empty if the current "component clause" is in fact a pragma.
6558 -----------------------------
6559 -- Check_Component_Overlap --
6560 -----------------------------
6562 procedure Check_Component_Overlap (C1_Ent, C2_Ent : Entity_Id) is
6563 CC1 : constant Node_Id := Component_Clause (C1_Ent);
6564 CC2 : constant Node_Id := Component_Clause (C2_Ent);
6567 if Present (CC1) and then Present (CC2) then
6569 -- Exclude odd case where we have two tag fields in the same
6570 -- record, both at location zero. This seems a bit strange, but
6571 -- it seems to happen in some circumstances, perhaps on an error.
6573 if Chars (C1_Ent) = Name_uTag
6575 Chars (C2_Ent) = Name_uTag
6580 -- Here we check if the two fields overlap
6583 S1 : constant Uint := Component_Bit_Offset (C1_Ent);
6584 S2 : constant Uint := Component_Bit_Offset (C2_Ent);
6585 E1 : constant Uint := S1 + Esize (C1_Ent);
6586 E2 : constant Uint := S2 + Esize (C2_Ent);
6589 if E2 <= S1 or else E1 <= S2 then
6592 Error_Msg_Node_2 := Component_Name (CC2);
6593 Error_Msg_Sloc := Sloc (Error_Msg_Node_2);
6594 Error_Msg_Node_1 := Component_Name (CC1);
6596 ("component& overlaps & #", Component_Name (CC1));
6597 Overlap_Detected := True;
6601 end Check_Component_Overlap;
6603 --------------------
6604 -- Find_Component --
6605 --------------------
6607 procedure Find_Component is
6609 procedure Search_Component (R : Entity_Id);
6610 -- Search components of R for a match. If found, Comp is set.
6612 ----------------------
6613 -- Search_Component --
6614 ----------------------
6616 procedure Search_Component (R : Entity_Id) is
6618 Comp := First_Component_Or_Discriminant (R);
6619 while Present (Comp) loop
6621 -- Ignore error of attribute name for component name (we
6622 -- already gave an error message for this, so no need to
6625 if Nkind (Component_Name (CC)) = N_Attribute_Reference then
6628 exit when Chars (Comp) = Chars (Component_Name (CC));
6631 Next_Component_Or_Discriminant (Comp);
6633 end Search_Component;
6635 -- Start of processing for Find_Component
6638 -- Return with Comp set to Empty if we have a pragma
6640 if Nkind (CC) = N_Pragma then
6645 -- Search current record for matching component
6647 Search_Component (Rectype);
6649 -- If not found, maybe component of base type that is absent from
6650 -- statically constrained first subtype.
6653 Search_Component (Base_Type (Rectype));
6656 -- If no component, or the component does not reference the component
6657 -- clause in question, then there was some previous error for which
6658 -- we already gave a message, so just return with Comp Empty.
6661 or else Component_Clause (Comp) /= CC
6665 -- Normal case where we have a component clause
6668 Fbit := Component_Bit_Offset (Comp);
6669 Lbit := Fbit + Esize (Comp) - 1;
6673 -- Start of processing for Check_Record_Representation_Clause
6677 Rectype := Entity (Ident);
6679 if Rectype = Any_Type then
6682 Rectype := Underlying_Type (Rectype);
6685 -- See if we have a fully repped derived tagged type
6688 PS : constant Entity_Id := Parent_Subtype (Rectype);
6691 if Present (PS) and then Is_Fully_Repped_Tagged_Type (PS) then
6692 Tagged_Parent := PS;
6694 -- Find maximum bit of any component of the parent type
6696 Parent_Last_Bit := UI_From_Int (System_Address_Size - 1);
6697 Pcomp := First_Entity (Tagged_Parent);
6698 while Present (Pcomp) loop
6699 if Ekind_In (Pcomp, E_Discriminant, E_Component) then
6700 if Component_Bit_Offset (Pcomp) /= No_Uint
6701 and then Known_Static_Esize (Pcomp)
6706 Component_Bit_Offset (Pcomp) + Esize (Pcomp) - 1);
6709 Next_Entity (Pcomp);
6715 -- All done if no component clauses
6717 CC := First (Component_Clauses (N));
6723 -- If a tag is present, then create a component clause that places it
6724 -- at the start of the record (otherwise gigi may place it after other
6725 -- fields that have rep clauses).
6727 Fent := First_Entity (Rectype);
6729 if Nkind (Fent) = N_Defining_Identifier
6730 and then Chars (Fent) = Name_uTag
6732 Set_Component_Bit_Offset (Fent, Uint_0);
6733 Set_Normalized_Position (Fent, Uint_0);
6734 Set_Normalized_First_Bit (Fent, Uint_0);
6735 Set_Normalized_Position_Max (Fent, Uint_0);
6736 Init_Esize (Fent, System_Address_Size);
6738 Set_Component_Clause (Fent,
6739 Make_Component_Clause (Loc,
6740 Component_Name => Make_Identifier (Loc, Name_uTag),
6742 Position => Make_Integer_Literal (Loc, Uint_0),
6743 First_Bit => Make_Integer_Literal (Loc, Uint_0),
6745 Make_Integer_Literal (Loc,
6746 UI_From_Int (System_Address_Size))));
6748 Ccount := Ccount + 1;
6751 Max_Bit_So_Far := Uint_Minus_1;
6752 Overlap_Check_Required := False;
6754 -- Process the component clauses
6756 while Present (CC) loop
6759 if Present (Comp) then
6760 Ccount := Ccount + 1;
6762 -- We need a full overlap check if record positions non-monotonic
6764 if Fbit <= Max_Bit_So_Far then
6765 Overlap_Check_Required := True;
6768 Max_Bit_So_Far := Lbit;
6770 -- Check bit position out of range of specified size
6772 if Has_Size_Clause (Rectype)
6773 and then RM_Size (Rectype) <= Lbit
6776 ("bit number out of range of specified size",
6779 -- Check for overlap with tag field
6782 if Is_Tagged_Type (Rectype)
6783 and then Fbit < System_Address_Size
6786 ("component overlaps tag field of&",
6787 Component_Name (CC), Rectype);
6788 Overlap_Detected := True;
6796 -- Check parent overlap if component might overlap parent field
6798 if Present (Tagged_Parent)
6799 and then Fbit <= Parent_Last_Bit
6801 Pcomp := First_Component_Or_Discriminant (Tagged_Parent);
6802 while Present (Pcomp) loop
6803 if not Is_Tag (Pcomp)
6804 and then Chars (Pcomp) /= Name_uParent
6806 Check_Component_Overlap (Comp, Pcomp);
6809 Next_Component_Or_Discriminant (Pcomp);
6817 -- Now that we have processed all the component clauses, check for
6818 -- overlap. We have to leave this till last, since the components can
6819 -- appear in any arbitrary order in the representation clause.
6821 -- We do not need this check if all specified ranges were monotonic,
6822 -- as recorded by Overlap_Check_Required being False at this stage.
6824 -- This first section checks if there are any overlapping entries at
6825 -- all. It does this by sorting all entries and then seeing if there are
6826 -- any overlaps. If there are none, then that is decisive, but if there
6827 -- are overlaps, they may still be OK (they may result from fields in
6828 -- different variants).
6830 if Overlap_Check_Required then
6831 Overlap_Check1 : declare
6833 OC_Fbit : array (0 .. Ccount) of Uint;
6834 -- First-bit values for component clauses, the value is the offset
6835 -- of the first bit of the field from start of record. The zero
6836 -- entry is for use in sorting.
6838 OC_Lbit : array (0 .. Ccount) of Uint;
6839 -- Last-bit values for component clauses, the value is the offset
6840 -- of the last bit of the field from start of record. The zero
6841 -- entry is for use in sorting.
6843 OC_Count : Natural := 0;
6844 -- Count of entries in OC_Fbit and OC_Lbit
6846 function OC_Lt (Op1, Op2 : Natural) return Boolean;
6847 -- Compare routine for Sort
6849 procedure OC_Move (From : Natural; To : Natural);
6850 -- Move routine for Sort
6852 package Sorting is new GNAT.Heap_Sort_G (OC_Move, OC_Lt);
6858 function OC_Lt (Op1, Op2 : Natural) return Boolean is
6860 return OC_Fbit (Op1) < OC_Fbit (Op2);
6867 procedure OC_Move (From : Natural; To : Natural) is
6869 OC_Fbit (To) := OC_Fbit (From);
6870 OC_Lbit (To) := OC_Lbit (From);
6873 -- Start of processing for Overlap_Check
6876 CC := First (Component_Clauses (N));
6877 while Present (CC) loop
6879 -- Exclude component clause already marked in error
6881 if not Error_Posted (CC) then
6884 if Present (Comp) then
6885 OC_Count := OC_Count + 1;
6886 OC_Fbit (OC_Count) := Fbit;
6887 OC_Lbit (OC_Count) := Lbit;
6894 Sorting.Sort (OC_Count);
6896 Overlap_Check_Required := False;
6897 for J in 1 .. OC_Count - 1 loop
6898 if OC_Lbit (J) >= OC_Fbit (J + 1) then
6899 Overlap_Check_Required := True;
6906 -- If Overlap_Check_Required is still True, then we have to do the full
6907 -- scale overlap check, since we have at least two fields that do
6908 -- overlap, and we need to know if that is OK since they are in
6909 -- different variant, or whether we have a definite problem.
6911 if Overlap_Check_Required then
6912 Overlap_Check2 : declare
6913 C1_Ent, C2_Ent : Entity_Id;
6914 -- Entities of components being checked for overlap
6917 -- Component_List node whose Component_Items are being checked
6920 -- Component declaration for component being checked
6923 C1_Ent := First_Entity (Base_Type (Rectype));
6925 -- Loop through all components in record. For each component check
6926 -- for overlap with any of the preceding elements on the component
6927 -- list containing the component and also, if the component is in
6928 -- a variant, check against components outside the case structure.
6929 -- This latter test is repeated recursively up the variant tree.
6931 Main_Component_Loop : while Present (C1_Ent) loop
6932 if not Ekind_In (C1_Ent, E_Component, E_Discriminant) then
6933 goto Continue_Main_Component_Loop;
6936 -- Skip overlap check if entity has no declaration node. This
6937 -- happens with discriminants in constrained derived types.
6938 -- Possibly we are missing some checks as a result, but that
6939 -- does not seem terribly serious.
6941 if No (Declaration_Node (C1_Ent)) then
6942 goto Continue_Main_Component_Loop;
6945 Clist := Parent (List_Containing (Declaration_Node (C1_Ent)));
6947 -- Loop through component lists that need checking. Check the
6948 -- current component list and all lists in variants above us.
6950 Component_List_Loop : loop
6952 -- If derived type definition, go to full declaration
6953 -- If at outer level, check discriminants if there are any.
6955 if Nkind (Clist) = N_Derived_Type_Definition then
6956 Clist := Parent (Clist);
6959 -- Outer level of record definition, check discriminants
6961 if Nkind_In (Clist, N_Full_Type_Declaration,
6962 N_Private_Type_Declaration)
6964 if Has_Discriminants (Defining_Identifier (Clist)) then
6966 First_Discriminant (Defining_Identifier (Clist));
6967 while Present (C2_Ent) loop
6968 exit when C1_Ent = C2_Ent;
6969 Check_Component_Overlap (C1_Ent, C2_Ent);
6970 Next_Discriminant (C2_Ent);
6974 -- Record extension case
6976 elsif Nkind (Clist) = N_Derived_Type_Definition then
6979 -- Otherwise check one component list
6982 Citem := First (Component_Items (Clist));
6983 while Present (Citem) loop
6984 if Nkind (Citem) = N_Component_Declaration then
6985 C2_Ent := Defining_Identifier (Citem);
6986 exit when C1_Ent = C2_Ent;
6987 Check_Component_Overlap (C1_Ent, C2_Ent);
6994 -- Check for variants above us (the parent of the Clist can
6995 -- be a variant, in which case its parent is a variant part,
6996 -- and the parent of the variant part is a component list
6997 -- whose components must all be checked against the current
6998 -- component for overlap).
7000 if Nkind (Parent (Clist)) = N_Variant then
7001 Clist := Parent (Parent (Parent (Clist)));
7003 -- Check for possible discriminant part in record, this
7004 -- is treated essentially as another level in the
7005 -- recursion. For this case the parent of the component
7006 -- list is the record definition, and its parent is the
7007 -- full type declaration containing the discriminant
7010 elsif Nkind (Parent (Clist)) = N_Record_Definition then
7011 Clist := Parent (Parent ((Clist)));
7013 -- If neither of these two cases, we are at the top of
7017 exit Component_List_Loop;
7019 end loop Component_List_Loop;
7021 <<Continue_Main_Component_Loop>>
7022 Next_Entity (C1_Ent);
7024 end loop Main_Component_Loop;
7028 -- The following circuit deals with warning on record holes (gaps). We
7029 -- skip this check if overlap was detected, since it makes sense for the
7030 -- programmer to fix this illegality before worrying about warnings.
7032 if not Overlap_Detected and Warn_On_Record_Holes then
7033 Record_Hole_Check : declare
7034 Decl : constant Node_Id := Declaration_Node (Base_Type (Rectype));
7035 -- Full declaration of record type
7037 procedure Check_Component_List
7041 -- Check component list CL for holes. The starting bit should be
7042 -- Sbit. which is zero for the main record component list and set
7043 -- appropriately for recursive calls for variants. DS is set to
7044 -- a list of discriminant specifications to be included in the
7045 -- consideration of components. It is No_List if none to consider.
7047 --------------------------
7048 -- Check_Component_List --
7049 --------------------------
7051 procedure Check_Component_List
7059 Compl := Integer (List_Length (Component_Items (CL)));
7061 if DS /= No_List then
7062 Compl := Compl + Integer (List_Length (DS));
7066 Comps : array (Natural range 0 .. Compl) of Entity_Id;
7067 -- Gather components (zero entry is for sort routine)
7069 Ncomps : Natural := 0;
7070 -- Number of entries stored in Comps (starting at Comps (1))
7073 -- One component item or discriminant specification
7076 -- Starting bit for next component
7084 function Lt (Op1, Op2 : Natural) return Boolean;
7085 -- Compare routine for Sort
7087 procedure Move (From : Natural; To : Natural);
7088 -- Move routine for Sort
7090 package Sorting is new GNAT.Heap_Sort_G (Move, Lt);
7096 function Lt (Op1, Op2 : Natural) return Boolean is
7098 return Component_Bit_Offset (Comps (Op1))
7100 Component_Bit_Offset (Comps (Op2));
7107 procedure Move (From : Natural; To : Natural) is
7109 Comps (To) := Comps (From);
7113 -- Gather discriminants into Comp
7115 if DS /= No_List then
7116 Citem := First (DS);
7117 while Present (Citem) loop
7118 if Nkind (Citem) = N_Discriminant_Specification then
7120 Ent : constant Entity_Id :=
7121 Defining_Identifier (Citem);
7123 if Ekind (Ent) = E_Discriminant then
7124 Ncomps := Ncomps + 1;
7125 Comps (Ncomps) := Ent;
7134 -- Gather component entities into Comp
7136 Citem := First (Component_Items (CL));
7137 while Present (Citem) loop
7138 if Nkind (Citem) = N_Component_Declaration then
7139 Ncomps := Ncomps + 1;
7140 Comps (Ncomps) := Defining_Identifier (Citem);
7146 -- Now sort the component entities based on the first bit.
7147 -- Note we already know there are no overlapping components.
7149 Sorting.Sort (Ncomps);
7151 -- Loop through entries checking for holes
7154 for J in 1 .. Ncomps loop
7156 Error_Msg_Uint_1 := Component_Bit_Offset (CEnt) - Nbit;
7158 if Error_Msg_Uint_1 > 0 then
7160 ("?^-bit gap before component&",
7161 Component_Name (Component_Clause (CEnt)), CEnt);
7164 Nbit := Component_Bit_Offset (CEnt) + Esize (CEnt);
7167 -- Process variant parts recursively if present
7169 if Present (Variant_Part (CL)) then
7170 Variant := First (Variants (Variant_Part (CL)));
7171 while Present (Variant) loop
7172 Check_Component_List
7173 (Component_List (Variant), Nbit, No_List);
7178 end Check_Component_List;
7180 -- Start of processing for Record_Hole_Check
7187 if Is_Tagged_Type (Rectype) then
7188 Sbit := UI_From_Int (System_Address_Size);
7193 if Nkind (Decl) = N_Full_Type_Declaration
7194 and then Nkind (Type_Definition (Decl)) = N_Record_Definition
7196 Check_Component_List
7197 (Component_List (Type_Definition (Decl)),
7199 Discriminant_Specifications (Decl));
7202 end Record_Hole_Check;
7205 -- For records that have component clauses for all components, and whose
7206 -- size is less than or equal to 32, we need to know the size in the
7207 -- front end to activate possible packed array processing where the
7208 -- component type is a record.
7210 -- At this stage Hbit + 1 represents the first unused bit from all the
7211 -- component clauses processed, so if the component clauses are
7212 -- complete, then this is the length of the record.
7214 -- For records longer than System.Storage_Unit, and for those where not
7215 -- all components have component clauses, the back end determines the
7216 -- length (it may for example be appropriate to round up the size
7217 -- to some convenient boundary, based on alignment considerations, etc).
7219 if Unknown_RM_Size (Rectype) and then Hbit + 1 <= 32 then
7221 -- Nothing to do if at least one component has no component clause
7223 Comp := First_Component_Or_Discriminant (Rectype);
7224 while Present (Comp) loop
7225 exit when No (Component_Clause (Comp));
7226 Next_Component_Or_Discriminant (Comp);
7229 -- If we fall out of loop, all components have component clauses
7230 -- and so we can set the size to the maximum value.
7233 Set_RM_Size (Rectype, Hbit + 1);
7236 end Check_Record_Representation_Clause;
7242 procedure Check_Size
7246 Biased : out Boolean)
7248 UT : constant Entity_Id := Underlying_Type (T);
7254 -- Dismiss cases for generic types or types with previous errors
7257 or else UT = Any_Type
7258 or else Is_Generic_Type (UT)
7259 or else Is_Generic_Type (Root_Type (UT))
7263 -- Check case of bit packed array
7265 elsif Is_Array_Type (UT)
7266 and then Known_Static_Component_Size (UT)
7267 and then Is_Bit_Packed_Array (UT)
7275 Asiz := Component_Size (UT);
7276 Indx := First_Index (UT);
7278 Ityp := Etype (Indx);
7280 -- If non-static bound, then we are not in the business of
7281 -- trying to check the length, and indeed an error will be
7282 -- issued elsewhere, since sizes of non-static array types
7283 -- cannot be set implicitly or explicitly.
7285 if not Is_Static_Subtype (Ityp) then
7289 -- Otherwise accumulate next dimension
7291 Asiz := Asiz * (Expr_Value (Type_High_Bound (Ityp)) -
7292 Expr_Value (Type_Low_Bound (Ityp)) +
7296 exit when No (Indx);
7302 Error_Msg_Uint_1 := Asiz;
7304 ("size for& too small, minimum allowed is ^", N, T);
7305 Set_Esize (T, Asiz);
7306 Set_RM_Size (T, Asiz);
7310 -- All other composite types are ignored
7312 elsif Is_Composite_Type (UT) then
7315 -- For fixed-point types, don't check minimum if type is not frozen,
7316 -- since we don't know all the characteristics of the type that can
7317 -- affect the size (e.g. a specified small) till freeze time.
7319 elsif Is_Fixed_Point_Type (UT)
7320 and then not Is_Frozen (UT)
7324 -- Cases for which a minimum check is required
7327 -- Ignore if specified size is correct for the type
7329 if Known_Esize (UT) and then Siz = Esize (UT) then
7333 -- Otherwise get minimum size
7335 M := UI_From_Int (Minimum_Size (UT));
7339 -- Size is less than minimum size, but one possibility remains
7340 -- that we can manage with the new size if we bias the type.
7342 M := UI_From_Int (Minimum_Size (UT, Biased => True));
7345 Error_Msg_Uint_1 := M;
7347 ("size for& too small, minimum allowed is ^", N, T);
7357 -------------------------
7358 -- Get_Alignment_Value --
7359 -------------------------
7361 function Get_Alignment_Value (Expr : Node_Id) return Uint is
7362 Align : constant Uint := Static_Integer (Expr);
7365 if Align = No_Uint then
7368 elsif Align <= 0 then
7369 Error_Msg_N ("alignment value must be positive", Expr);
7373 for J in Int range 0 .. 64 loop
7375 M : constant Uint := Uint_2 ** J;
7378 exit when M = Align;
7382 ("alignment value must be power of 2", Expr);
7390 end Get_Alignment_Value;
7396 procedure Initialize is
7398 Address_Clause_Checks.Init;
7399 Independence_Checks.Init;
7400 Unchecked_Conversions.Init;
7403 -------------------------
7404 -- Is_Operational_Item --
7405 -------------------------
7407 function Is_Operational_Item (N : Node_Id) return Boolean is
7409 if Nkind (N) /= N_Attribute_Definition_Clause then
7413 Id : constant Attribute_Id := Get_Attribute_Id (Chars (N));
7415 return Id = Attribute_Input
7416 or else Id = Attribute_Output
7417 or else Id = Attribute_Read
7418 or else Id = Attribute_Write
7419 or else Id = Attribute_External_Tag;
7422 end Is_Operational_Item;
7428 function Minimum_Size
7430 Biased : Boolean := False) return Nat
7432 Lo : Uint := No_Uint;
7433 Hi : Uint := No_Uint;
7434 LoR : Ureal := No_Ureal;
7435 HiR : Ureal := No_Ureal;
7436 LoSet : Boolean := False;
7437 HiSet : Boolean := False;
7441 R_Typ : constant Entity_Id := Root_Type (T);
7444 -- If bad type, return 0
7446 if T = Any_Type then
7449 -- For generic types, just return zero. There cannot be any legitimate
7450 -- need to know such a size, but this routine may be called with a
7451 -- generic type as part of normal processing.
7453 elsif Is_Generic_Type (R_Typ)
7454 or else R_Typ = Any_Type
7458 -- Access types. Normally an access type cannot have a size smaller
7459 -- than the size of System.Address. The exception is on VMS, where
7460 -- we have short and long addresses, and it is possible for an access
7461 -- type to have a short address size (and thus be less than the size
7462 -- of System.Address itself). We simply skip the check for VMS, and
7463 -- leave it to the back end to do the check.
7465 elsif Is_Access_Type (T) then
7466 if OpenVMS_On_Target then
7469 return System_Address_Size;
7472 -- Floating-point types
7474 elsif Is_Floating_Point_Type (T) then
7475 return UI_To_Int (Esize (R_Typ));
7479 elsif Is_Discrete_Type (T) then
7481 -- The following loop is looking for the nearest compile time known
7482 -- bounds following the ancestor subtype chain. The idea is to find
7483 -- the most restrictive known bounds information.
7487 if Ancest = Any_Type or else Etype (Ancest) = Any_Type then
7492 if Compile_Time_Known_Value (Type_Low_Bound (Ancest)) then
7493 Lo := Expr_Rep_Value (Type_Low_Bound (Ancest));
7500 if Compile_Time_Known_Value (Type_High_Bound (Ancest)) then
7501 Hi := Expr_Rep_Value (Type_High_Bound (Ancest));
7507 Ancest := Ancestor_Subtype (Ancest);
7510 Ancest := Base_Type (T);
7512 if Is_Generic_Type (Ancest) then
7518 -- Fixed-point types. We can't simply use Expr_Value to get the
7519 -- Corresponding_Integer_Value values of the bounds, since these do not
7520 -- get set till the type is frozen, and this routine can be called
7521 -- before the type is frozen. Similarly the test for bounds being static
7522 -- needs to include the case where we have unanalyzed real literals for
7525 elsif Is_Fixed_Point_Type (T) then
7527 -- The following loop is looking for the nearest compile time known
7528 -- bounds following the ancestor subtype chain. The idea is to find
7529 -- the most restrictive known bounds information.
7533 if Ancest = Any_Type or else Etype (Ancest) = Any_Type then
7537 -- Note: In the following two tests for LoSet and HiSet, it may
7538 -- seem redundant to test for N_Real_Literal here since normally
7539 -- one would assume that the test for the value being known at
7540 -- compile time includes this case. However, there is a glitch.
7541 -- If the real literal comes from folding a non-static expression,
7542 -- then we don't consider any non- static expression to be known
7543 -- at compile time if we are in configurable run time mode (needed
7544 -- in some cases to give a clearer definition of what is and what
7545 -- is not accepted). So the test is indeed needed. Without it, we
7546 -- would set neither Lo_Set nor Hi_Set and get an infinite loop.
7549 if Nkind (Type_Low_Bound (Ancest)) = N_Real_Literal
7550 or else Compile_Time_Known_Value (Type_Low_Bound (Ancest))
7552 LoR := Expr_Value_R (Type_Low_Bound (Ancest));
7559 if Nkind (Type_High_Bound (Ancest)) = N_Real_Literal
7560 or else Compile_Time_Known_Value (Type_High_Bound (Ancest))
7562 HiR := Expr_Value_R (Type_High_Bound (Ancest));
7568 Ancest := Ancestor_Subtype (Ancest);
7571 Ancest := Base_Type (T);
7573 if Is_Generic_Type (Ancest) then
7579 Lo := UR_To_Uint (LoR / Small_Value (T));
7580 Hi := UR_To_Uint (HiR / Small_Value (T));
7582 -- No other types allowed
7585 raise Program_Error;
7588 -- Fall through with Hi and Lo set. Deal with biased case
7591 and then not Is_Fixed_Point_Type (T)
7592 and then not (Is_Enumeration_Type (T)
7593 and then Has_Non_Standard_Rep (T)))
7594 or else Has_Biased_Representation (T)
7600 -- Signed case. Note that we consider types like range 1 .. -1 to be
7601 -- signed for the purpose of computing the size, since the bounds have
7602 -- to be accommodated in the base type.
7604 if Lo < 0 or else Hi < 0 then
7608 -- S = size, B = 2 ** (size - 1) (can accommodate -B .. +(B - 1))
7609 -- Note that we accommodate the case where the bounds cross. This
7610 -- can happen either because of the way the bounds are declared
7611 -- or because of the algorithm in Freeze_Fixed_Point_Type.
7625 -- If both bounds are positive, make sure that both are represen-
7626 -- table in the case where the bounds are crossed. This can happen
7627 -- either because of the way the bounds are declared, or because of
7628 -- the algorithm in Freeze_Fixed_Point_Type.
7634 -- S = size, (can accommodate 0 .. (2**size - 1))
7637 while Hi >= Uint_2 ** S loop
7645 ---------------------------
7646 -- New_Stream_Subprogram --
7647 ---------------------------
7649 procedure New_Stream_Subprogram
7653 Nam : TSS_Name_Type)
7655 Loc : constant Source_Ptr := Sloc (N);
7656 Sname : constant Name_Id := Make_TSS_Name (Base_Type (Ent), Nam);
7657 Subp_Id : Entity_Id;
7658 Subp_Decl : Node_Id;
7662 Defer_Declaration : constant Boolean :=
7663 Is_Tagged_Type (Ent) or else Is_Private_Type (Ent);
7664 -- For a tagged type, there is a declaration for each stream attribute
7665 -- at the freeze point, and we must generate only a completion of this
7666 -- declaration. We do the same for private types, because the full view
7667 -- might be tagged. Otherwise we generate a declaration at the point of
7668 -- the attribute definition clause.
7670 function Build_Spec return Node_Id;
7671 -- Used for declaration and renaming declaration, so that this is
7672 -- treated as a renaming_as_body.
7678 function Build_Spec return Node_Id is
7679 Out_P : constant Boolean := (Nam = TSS_Stream_Read);
7682 T_Ref : constant Node_Id := New_Reference_To (Etyp, Loc);
7685 Subp_Id := Make_Defining_Identifier (Loc, Sname);
7687 -- S : access Root_Stream_Type'Class
7689 Formals := New_List (
7690 Make_Parameter_Specification (Loc,
7691 Defining_Identifier =>
7692 Make_Defining_Identifier (Loc, Name_S),
7694 Make_Access_Definition (Loc,
7697 Designated_Type (Etype (F)), Loc))));
7699 if Nam = TSS_Stream_Input then
7700 Spec := Make_Function_Specification (Loc,
7701 Defining_Unit_Name => Subp_Id,
7702 Parameter_Specifications => Formals,
7703 Result_Definition => T_Ref);
7708 Make_Parameter_Specification (Loc,
7709 Defining_Identifier => Make_Defining_Identifier (Loc, Name_V),
7710 Out_Present => Out_P,
7711 Parameter_Type => T_Ref));
7714 Make_Procedure_Specification (Loc,
7715 Defining_Unit_Name => Subp_Id,
7716 Parameter_Specifications => Formals);
7722 -- Start of processing for New_Stream_Subprogram
7725 F := First_Formal (Subp);
7727 if Ekind (Subp) = E_Procedure then
7728 Etyp := Etype (Next_Formal (F));
7730 Etyp := Etype (Subp);
7733 -- Prepare subprogram declaration and insert it as an action on the
7734 -- clause node. The visibility for this entity is used to test for
7735 -- visibility of the attribute definition clause (in the sense of
7736 -- 8.3(23) as amended by AI-195).
7738 if not Defer_Declaration then
7740 Make_Subprogram_Declaration (Loc,
7741 Specification => Build_Spec);
7743 -- For a tagged type, there is always a visible declaration for each
7744 -- stream TSS (it is a predefined primitive operation), and the
7745 -- completion of this declaration occurs at the freeze point, which is
7746 -- not always visible at places where the attribute definition clause is
7747 -- visible. So, we create a dummy entity here for the purpose of
7748 -- tracking the visibility of the attribute definition clause itself.
7752 Make_Defining_Identifier (Loc, New_External_Name (Sname, 'V'));
7754 Make_Object_Declaration (Loc,
7755 Defining_Identifier => Subp_Id,
7756 Object_Definition => New_Occurrence_Of (Standard_Boolean, Loc));
7759 Insert_Action (N, Subp_Decl);
7760 Set_Entity (N, Subp_Id);
7763 Make_Subprogram_Renaming_Declaration (Loc,
7764 Specification => Build_Spec,
7765 Name => New_Reference_To (Subp, Loc));
7767 if Defer_Declaration then
7768 Set_TSS (Base_Type (Ent), Subp_Id);
7770 Insert_Action (N, Subp_Decl);
7771 Copy_TSS (Subp_Id, Base_Type (Ent));
7773 end New_Stream_Subprogram;
7775 ------------------------
7776 -- Rep_Item_Too_Early --
7777 ------------------------
7779 function Rep_Item_Too_Early (T : Entity_Id; N : Node_Id) return Boolean is
7781 -- Cannot apply non-operational rep items to generic types
7783 if Is_Operational_Item (N) then
7787 and then Is_Generic_Type (Root_Type (T))
7789 Error_Msg_N ("representation item not allowed for generic type", N);
7793 -- Otherwise check for incomplete type
7795 if Is_Incomplete_Or_Private_Type (T)
7796 and then No (Underlying_Type (T))
7798 (Nkind (N) /= N_Pragma
7799 or else Get_Pragma_Id (N) /= Pragma_Import)
7802 ("representation item must be after full type declaration", N);
7805 -- If the type has incomplete components, a representation clause is
7806 -- illegal but stream attributes and Convention pragmas are correct.
7808 elsif Has_Private_Component (T) then
7809 if Nkind (N) = N_Pragma then
7813 ("representation item must appear after type is fully defined",
7820 end Rep_Item_Too_Early;
7822 -----------------------
7823 -- Rep_Item_Too_Late --
7824 -----------------------
7826 function Rep_Item_Too_Late
7829 FOnly : Boolean := False) return Boolean
7832 Parent_Type : Entity_Id;
7835 -- Output the too late message. Note that this is not considered a
7836 -- serious error, since the effect is simply that we ignore the
7837 -- representation clause in this case.
7843 procedure Too_Late is
7845 Error_Msg_N ("|representation item appears too late!", N);
7848 -- Start of processing for Rep_Item_Too_Late
7851 -- First make sure entity is not frozen (RM 13.1(9))
7855 -- Exclude imported types, which may be frozen if they appear in a
7856 -- representation clause for a local type.
7858 and then not From_With_Type (T)
7860 -- Exclude generated entitiesa (not coming from source). The common
7861 -- case is when we generate a renaming which prematurely freezes the
7862 -- renamed internal entity, but we still want to be able to set copies
7863 -- of attribute values such as Size/Alignment.
7865 and then Comes_From_Source (T)
7868 S := First_Subtype (T);
7870 if Present (Freeze_Node (S)) then
7872 ("?no more representation items for }", Freeze_Node (S), S);
7877 -- Check for case of non-tagged derived type whose parent either has
7878 -- primitive operations, or is a by reference type (RM 13.1(10)).
7882 and then Is_Derived_Type (T)
7883 and then not Is_Tagged_Type (T)
7885 Parent_Type := Etype (Base_Type (T));
7887 if Has_Primitive_Operations (Parent_Type) then
7890 ("primitive operations already defined for&!", N, Parent_Type);
7893 elsif Is_By_Reference_Type (Parent_Type) then
7896 ("parent type & is a by reference type!", N, Parent_Type);
7901 -- No error, link item into head of chain of rep items for the entity,
7902 -- but avoid chaining if we have an overloadable entity, and the pragma
7903 -- is one that can apply to multiple overloaded entities.
7905 if Is_Overloadable (T)
7906 and then Nkind (N) = N_Pragma
7909 Pname : constant Name_Id := Pragma_Name (N);
7911 if Pname = Name_Convention or else
7912 Pname = Name_Import or else
7913 Pname = Name_Export or else
7914 Pname = Name_External or else
7915 Pname = Name_Interface
7922 Record_Rep_Item (T, N);
7924 end Rep_Item_Too_Late;
7926 -------------------------------------
7927 -- Replace_Type_References_Generic --
7928 -------------------------------------
7930 procedure Replace_Type_References_Generic (N : Node_Id; TName : Name_Id) is
7932 function Replace_Node (N : Node_Id) return Traverse_Result;
7933 -- Processes a single node in the traversal procedure below, checking
7934 -- if node N should be replaced, and if so, doing the replacement.
7936 procedure Replace_Type_Refs is new Traverse_Proc (Replace_Node);
7937 -- This instantiation provides the body of Replace_Type_References
7943 function Replace_Node (N : Node_Id) return Traverse_Result is
7948 -- Case of identifier
7950 if Nkind (N) = N_Identifier then
7952 -- If not the type name, all done with this node
7954 if Chars (N) /= TName then
7957 -- Otherwise do the replacement and we are done with this node
7960 Replace_Type_Reference (N);
7964 -- Case of selected component (which is what a qualification
7965 -- looks like in the unanalyzed tree, which is what we have.
7967 elsif Nkind (N) = N_Selected_Component then
7969 -- If selector name is not our type, keeping going (we might
7970 -- still have an occurrence of the type in the prefix).
7972 if Nkind (Selector_Name (N)) /= N_Identifier
7973 or else Chars (Selector_Name (N)) /= TName
7977 -- Selector name is our type, check qualification
7980 -- Loop through scopes and prefixes, doing comparison
7985 -- Continue if no more scopes or scope with no name
7987 if No (S) or else Nkind (S) not in N_Has_Chars then
7991 -- Do replace if prefix is an identifier matching the
7992 -- scope that we are currently looking at.
7994 if Nkind (P) = N_Identifier
7995 and then Chars (P) = Chars (S)
7997 Replace_Type_Reference (N);
8001 -- Go check scope above us if prefix is itself of the
8002 -- form of a selected component, whose selector matches
8003 -- the scope we are currently looking at.
8005 if Nkind (P) = N_Selected_Component
8006 and then Nkind (Selector_Name (P)) = N_Identifier
8007 and then Chars (Selector_Name (P)) = Chars (S)
8012 -- For anything else, we don't have a match, so keep on
8013 -- going, there are still some weird cases where we may
8014 -- still have a replacement within the prefix.
8022 -- Continue for any other node kind
8030 Replace_Type_Refs (N);
8031 end Replace_Type_References_Generic;
8033 -------------------------
8034 -- Same_Representation --
8035 -------------------------
8037 function Same_Representation (Typ1, Typ2 : Entity_Id) return Boolean is
8038 T1 : constant Entity_Id := Underlying_Type (Typ1);
8039 T2 : constant Entity_Id := Underlying_Type (Typ2);
8042 -- A quick check, if base types are the same, then we definitely have
8043 -- the same representation, because the subtype specific representation
8044 -- attributes (Size and Alignment) do not affect representation from
8045 -- the point of view of this test.
8047 if Base_Type (T1) = Base_Type (T2) then
8050 elsif Is_Private_Type (Base_Type (T2))
8051 and then Base_Type (T1) = Full_View (Base_Type (T2))
8056 -- Tagged types never have differing representations
8058 if Is_Tagged_Type (T1) then
8062 -- Representations are definitely different if conventions differ
8064 if Convention (T1) /= Convention (T2) then
8068 -- Representations are different if component alignments differ
8070 if (Is_Record_Type (T1) or else Is_Array_Type (T1))
8072 (Is_Record_Type (T2) or else Is_Array_Type (T2))
8073 and then Component_Alignment (T1) /= Component_Alignment (T2)
8078 -- For arrays, the only real issue is component size. If we know the
8079 -- component size for both arrays, and it is the same, then that's
8080 -- good enough to know we don't have a change of representation.
8082 if Is_Array_Type (T1) then
8083 if Known_Component_Size (T1)
8084 and then Known_Component_Size (T2)
8085 and then Component_Size (T1) = Component_Size (T2)
8087 if VM_Target = No_VM then
8090 -- In VM targets the representation of arrays with aliased
8091 -- components differs from arrays with non-aliased components
8094 return Has_Aliased_Components (Base_Type (T1))
8096 Has_Aliased_Components (Base_Type (T2));
8101 -- Types definitely have same representation if neither has non-standard
8102 -- representation since default representations are always consistent.
8103 -- If only one has non-standard representation, and the other does not,
8104 -- then we consider that they do not have the same representation. They
8105 -- might, but there is no way of telling early enough.
8107 if Has_Non_Standard_Rep (T1) then
8108 if not Has_Non_Standard_Rep (T2) then
8112 return not Has_Non_Standard_Rep (T2);
8115 -- Here the two types both have non-standard representation, and we need
8116 -- to determine if they have the same non-standard representation.
8118 -- For arrays, we simply need to test if the component sizes are the
8119 -- same. Pragma Pack is reflected in modified component sizes, so this
8120 -- check also deals with pragma Pack.
8122 if Is_Array_Type (T1) then
8123 return Component_Size (T1) = Component_Size (T2);
8125 -- Tagged types always have the same representation, because it is not
8126 -- possible to specify different representations for common fields.
8128 elsif Is_Tagged_Type (T1) then
8131 -- Case of record types
8133 elsif Is_Record_Type (T1) then
8135 -- Packed status must conform
8137 if Is_Packed (T1) /= Is_Packed (T2) then
8140 -- Otherwise we must check components. Typ2 maybe a constrained
8141 -- subtype with fewer components, so we compare the components
8142 -- of the base types.
8145 Record_Case : declare
8146 CD1, CD2 : Entity_Id;
8148 function Same_Rep return Boolean;
8149 -- CD1 and CD2 are either components or discriminants. This
8150 -- function tests whether the two have the same representation
8156 function Same_Rep return Boolean is
8158 if No (Component_Clause (CD1)) then
8159 return No (Component_Clause (CD2));
8163 Present (Component_Clause (CD2))
8165 Component_Bit_Offset (CD1) = Component_Bit_Offset (CD2)
8167 Esize (CD1) = Esize (CD2);
8171 -- Start of processing for Record_Case
8174 if Has_Discriminants (T1) then
8175 CD1 := First_Discriminant (T1);
8176 CD2 := First_Discriminant (T2);
8178 -- The number of discriminants may be different if the
8179 -- derived type has fewer (constrained by values). The
8180 -- invisible discriminants retain the representation of
8181 -- the original, so the discrepancy does not per se
8182 -- indicate a different representation.
8185 and then Present (CD2)
8187 if not Same_Rep then
8190 Next_Discriminant (CD1);
8191 Next_Discriminant (CD2);
8196 CD1 := First_Component (Underlying_Type (Base_Type (T1)));
8197 CD2 := First_Component (Underlying_Type (Base_Type (T2)));
8199 while Present (CD1) loop
8200 if not Same_Rep then
8203 Next_Component (CD1);
8204 Next_Component (CD2);
8212 -- For enumeration types, we must check each literal to see if the
8213 -- representation is the same. Note that we do not permit enumeration
8214 -- representation clauses for Character and Wide_Character, so these
8215 -- cases were already dealt with.
8217 elsif Is_Enumeration_Type (T1) then
8218 Enumeration_Case : declare
8222 L1 := First_Literal (T1);
8223 L2 := First_Literal (T2);
8225 while Present (L1) loop
8226 if Enumeration_Rep (L1) /= Enumeration_Rep (L2) then
8236 end Enumeration_Case;
8238 -- Any other types have the same representation for these purposes
8243 end Same_Representation;
8249 procedure Set_Biased
8253 Biased : Boolean := True)
8257 Set_Has_Biased_Representation (E);
8259 if Warn_On_Biased_Representation then
8261 ("?" & Msg & " forces biased representation for&", N, E);
8266 --------------------
8267 -- Set_Enum_Esize --
8268 --------------------
8270 procedure Set_Enum_Esize (T : Entity_Id) is
8278 -- Find the minimum standard size (8,16,32,64) that fits
8280 Lo := Enumeration_Rep (Entity (Type_Low_Bound (T)));
8281 Hi := Enumeration_Rep (Entity (Type_High_Bound (T)));
8284 if Lo >= -Uint_2**07 and then Hi < Uint_2**07 then
8285 Sz := Standard_Character_Size; -- May be > 8 on some targets
8287 elsif Lo >= -Uint_2**15 and then Hi < Uint_2**15 then
8290 elsif Lo >= -Uint_2**31 and then Hi < Uint_2**31 then
8293 else pragma Assert (Lo >= -Uint_2**63 and then Hi < Uint_2**63);
8298 if Hi < Uint_2**08 then
8299 Sz := Standard_Character_Size; -- May be > 8 on some targets
8301 elsif Hi < Uint_2**16 then
8304 elsif Hi < Uint_2**32 then
8307 else pragma Assert (Hi < Uint_2**63);
8312 -- That minimum is the proper size unless we have a foreign convention
8313 -- and the size required is 32 or less, in which case we bump the size
8314 -- up to 32. This is required for C and C++ and seems reasonable for
8315 -- all other foreign conventions.
8317 if Has_Foreign_Convention (T)
8318 and then Esize (T) < Standard_Integer_Size
8320 Init_Esize (T, Standard_Integer_Size);
8326 ------------------------------
8327 -- Validate_Address_Clauses --
8328 ------------------------------
8330 procedure Validate_Address_Clauses is
8332 for J in Address_Clause_Checks.First .. Address_Clause_Checks.Last loop
8334 ACCR : Address_Clause_Check_Record
8335 renames Address_Clause_Checks.Table (J);
8346 -- Skip processing of this entry if warning already posted
8348 if not Address_Warning_Posted (ACCR.N) then
8350 Expr := Original_Node (Expression (ACCR.N));
8354 X_Alignment := Alignment (ACCR.X);
8355 Y_Alignment := Alignment (ACCR.Y);
8357 -- Similarly obtain sizes
8359 X_Size := Esize (ACCR.X);
8360 Y_Size := Esize (ACCR.Y);
8362 -- Check for large object overlaying smaller one
8365 and then X_Size > Uint_0
8366 and then X_Size > Y_Size
8369 ("?& overlays smaller object", ACCR.N, ACCR.X);
8371 ("\?program execution may be erroneous", ACCR.N);
8372 Error_Msg_Uint_1 := X_Size;
8374 ("\?size of & is ^", ACCR.N, ACCR.X);
8375 Error_Msg_Uint_1 := Y_Size;
8377 ("\?size of & is ^", ACCR.N, ACCR.Y);
8379 -- Check for inadequate alignment, both of the base object
8380 -- and of the offset, if any.
8382 -- Note: we do not check the alignment if we gave a size
8383 -- warning, since it would likely be redundant.
8385 elsif Y_Alignment /= Uint_0
8386 and then (Y_Alignment < X_Alignment
8389 Nkind (Expr) = N_Attribute_Reference
8391 Attribute_Name (Expr) = Name_Address
8393 Has_Compatible_Alignment
8394 (ACCR.X, Prefix (Expr))
8395 /= Known_Compatible))
8398 ("?specified address for& may be inconsistent "
8402 ("\?program execution may be erroneous (RM 13.3(27))",
8404 Error_Msg_Uint_1 := X_Alignment;
8406 ("\?alignment of & is ^",
8408 Error_Msg_Uint_1 := Y_Alignment;
8410 ("\?alignment of & is ^",
8412 if Y_Alignment >= X_Alignment then
8414 ("\?but offset is not multiple of alignment",
8421 end Validate_Address_Clauses;
8423 ---------------------------
8424 -- Validate_Independence --
8425 ---------------------------
8427 procedure Validate_Independence is
8428 SU : constant Uint := UI_From_Int (System_Storage_Unit);
8436 procedure Check_Array_Type (Atyp : Entity_Id);
8437 -- Checks if the array type Atyp has independent components, and
8438 -- if not, outputs an appropriate set of error messages.
8440 procedure No_Independence;
8441 -- Output message that independence cannot be guaranteed
8443 function OK_Component (C : Entity_Id) return Boolean;
8444 -- Checks one component to see if it is independently accessible, and
8445 -- if so yields True, otherwise yields False if independent access
8446 -- cannot be guaranteed. This is a conservative routine, it only
8447 -- returns True if it knows for sure, it returns False if it knows
8448 -- there is a problem, or it cannot be sure there is no problem.
8450 procedure Reason_Bad_Component (C : Entity_Id);
8451 -- Outputs continuation message if a reason can be determined for
8452 -- the component C being bad.
8454 ----------------------
8455 -- Check_Array_Type --
8456 ----------------------
8458 procedure Check_Array_Type (Atyp : Entity_Id) is
8459 Ctyp : constant Entity_Id := Component_Type (Atyp);
8462 -- OK if no alignment clause, no pack, and no component size
8464 if not Has_Component_Size_Clause (Atyp)
8465 and then not Has_Alignment_Clause (Atyp)
8466 and then not Is_Packed (Atyp)
8471 -- Check actual component size
8473 if not Known_Component_Size (Atyp)
8474 or else not (Addressable (Component_Size (Atyp))
8475 and then Component_Size (Atyp) < 64)
8476 or else Component_Size (Atyp) mod Esize (Ctyp) /= 0
8480 -- Bad component size, check reason
8482 if Has_Component_Size_Clause (Atyp) then
8484 Get_Attribute_Definition_Clause
8485 (Atyp, Attribute_Component_Size);
8488 Error_Msg_Sloc := Sloc (P);
8489 Error_Msg_N ("\because of Component_Size clause#", N);
8494 if Is_Packed (Atyp) then
8495 P := Get_Rep_Pragma (Atyp, Name_Pack);
8498 Error_Msg_Sloc := Sloc (P);
8499 Error_Msg_N ("\because of pragma Pack#", N);
8504 -- No reason found, just return
8509 -- Array type is OK independence-wise
8512 end Check_Array_Type;
8514 ---------------------
8515 -- No_Independence --
8516 ---------------------
8518 procedure No_Independence is
8520 if Pragma_Name (N) = Name_Independent then
8522 ("independence cannot be guaranteed for&", N, E);
8525 ("independent components cannot be guaranteed for&", N, E);
8527 end No_Independence;
8533 function OK_Component (C : Entity_Id) return Boolean is
8534 Rec : constant Entity_Id := Scope (C);
8535 Ctyp : constant Entity_Id := Etype (C);
8538 -- OK if no component clause, no Pack, and no alignment clause
8540 if No (Component_Clause (C))
8541 and then not Is_Packed (Rec)
8542 and then not Has_Alignment_Clause (Rec)
8547 -- Here we look at the actual component layout. A component is
8548 -- addressable if its size is a multiple of the Esize of the
8549 -- component type, and its starting position in the record has
8550 -- appropriate alignment, and the record itself has appropriate
8551 -- alignment to guarantee the component alignment.
8553 -- Make sure sizes are static, always assume the worst for any
8554 -- cases where we cannot check static values.
8556 if not (Known_Static_Esize (C)
8557 and then Known_Static_Esize (Ctyp))
8562 -- Size of component must be addressable or greater than 64 bits
8563 -- and a multiple of bytes.
8565 if not Addressable (Esize (C))
8566 and then Esize (C) < Uint_64
8571 -- Check size is proper multiple
8573 if Esize (C) mod Esize (Ctyp) /= 0 then
8577 -- Check alignment of component is OK
8579 if not Known_Component_Bit_Offset (C)
8580 or else Component_Bit_Offset (C) < Uint_0
8581 or else Component_Bit_Offset (C) mod Esize (Ctyp) /= 0
8586 -- Check alignment of record type is OK
8588 if not Known_Alignment (Rec)
8589 or else (Alignment (Rec) * SU) mod Esize (Ctyp) /= 0
8594 -- All tests passed, component is addressable
8599 --------------------------
8600 -- Reason_Bad_Component --
8601 --------------------------
8603 procedure Reason_Bad_Component (C : Entity_Id) is
8604 Rec : constant Entity_Id := Scope (C);
8605 Ctyp : constant Entity_Id := Etype (C);
8608 -- If component clause present assume that's the problem
8610 if Present (Component_Clause (C)) then
8611 Error_Msg_Sloc := Sloc (Component_Clause (C));
8612 Error_Msg_N ("\because of Component_Clause#", N);
8616 -- If pragma Pack clause present, assume that's the problem
8618 if Is_Packed (Rec) then
8619 P := Get_Rep_Pragma (Rec, Name_Pack);
8622 Error_Msg_Sloc := Sloc (P);
8623 Error_Msg_N ("\because of pragma Pack#", N);
8628 -- See if record has bad alignment clause
8630 if Has_Alignment_Clause (Rec)
8631 and then Known_Alignment (Rec)
8632 and then (Alignment (Rec) * SU) mod Esize (Ctyp) /= 0
8634 P := Get_Attribute_Definition_Clause (Rec, Attribute_Alignment);
8637 Error_Msg_Sloc := Sloc (P);
8638 Error_Msg_N ("\because of Alignment clause#", N);
8642 -- Couldn't find a reason, so return without a message
8645 end Reason_Bad_Component;
8647 -- Start of processing for Validate_Independence
8650 for J in Independence_Checks.First .. Independence_Checks.Last loop
8651 N := Independence_Checks.Table (J).N;
8652 E := Independence_Checks.Table (J).E;
8653 IC := Pragma_Name (N) = Name_Independent_Components;
8655 -- Deal with component case
8657 if Ekind (E) = E_Discriminant or else Ekind (E) = E_Component then
8658 if not OK_Component (E) then
8660 Reason_Bad_Component (E);
8665 -- Deal with record with Independent_Components
8667 if IC and then Is_Record_Type (E) then
8668 Comp := First_Component_Or_Discriminant (E);
8669 while Present (Comp) loop
8670 if not OK_Component (Comp) then
8672 Reason_Bad_Component (Comp);
8676 Next_Component_Or_Discriminant (Comp);
8680 -- Deal with address clause case
8682 if Is_Object (E) then
8683 Addr := Address_Clause (E);
8685 if Present (Addr) then
8687 Error_Msg_Sloc := Sloc (Addr);
8688 Error_Msg_N ("\because of Address clause#", N);
8693 -- Deal with independent components for array type
8695 if IC and then Is_Array_Type (E) then
8696 Check_Array_Type (E);
8699 -- Deal with independent components for array object
8701 if IC and then Is_Object (E) and then Is_Array_Type (Etype (E)) then
8702 Check_Array_Type (Etype (E));
8707 end Validate_Independence;
8709 -----------------------------------
8710 -- Validate_Unchecked_Conversion --
8711 -----------------------------------
8713 procedure Validate_Unchecked_Conversion
8715 Act_Unit : Entity_Id)
8722 -- Obtain source and target types. Note that we call Ancestor_Subtype
8723 -- here because the processing for generic instantiation always makes
8724 -- subtypes, and we want the original frozen actual types.
8726 -- If we are dealing with private types, then do the check on their
8727 -- fully declared counterparts if the full declarations have been
8728 -- encountered (they don't have to be visible, but they must exist!)
8730 Source := Ancestor_Subtype (Etype (First_Formal (Act_Unit)));
8732 if Is_Private_Type (Source)
8733 and then Present (Underlying_Type (Source))
8735 Source := Underlying_Type (Source);
8738 Target := Ancestor_Subtype (Etype (Act_Unit));
8740 -- If either type is generic, the instantiation happens within a generic
8741 -- unit, and there is nothing to check. The proper check will happen
8742 -- when the enclosing generic is instantiated.
8744 if Is_Generic_Type (Source) or else Is_Generic_Type (Target) then
8748 if Is_Private_Type (Target)
8749 and then Present (Underlying_Type (Target))
8751 Target := Underlying_Type (Target);
8754 -- Source may be unconstrained array, but not target
8756 if Is_Array_Type (Target)
8757 and then not Is_Constrained (Target)
8760 ("unchecked conversion to unconstrained array not allowed", N);
8764 -- Warn if conversion between two different convention pointers
8766 if Is_Access_Type (Target)
8767 and then Is_Access_Type (Source)
8768 and then Convention (Target) /= Convention (Source)
8769 and then Warn_On_Unchecked_Conversion
8771 -- Give warnings for subprogram pointers only on most targets. The
8772 -- exception is VMS, where data pointers can have different lengths
8773 -- depending on the pointer convention.
8775 if Is_Access_Subprogram_Type (Target)
8776 or else Is_Access_Subprogram_Type (Source)
8777 or else OpenVMS_On_Target
8780 ("?conversion between pointers with different conventions!", N);
8784 -- Warn if one of the operands is Ada.Calendar.Time. Do not emit a
8785 -- warning when compiling GNAT-related sources.
8787 if Warn_On_Unchecked_Conversion
8788 and then not In_Predefined_Unit (N)
8789 and then RTU_Loaded (Ada_Calendar)
8791 (Chars (Source) = Name_Time
8793 Chars (Target) = Name_Time)
8795 -- If Ada.Calendar is loaded and the name of one of the operands is
8796 -- Time, there is a good chance that this is Ada.Calendar.Time.
8799 Calendar_Time : constant Entity_Id :=
8800 Full_View (RTE (RO_CA_Time));
8802 pragma Assert (Present (Calendar_Time));
8804 if Source = Calendar_Time
8805 or else Target = Calendar_Time
8808 ("?representation of 'Time values may change between " &
8809 "'G'N'A'T versions", N);
8814 -- Make entry in unchecked conversion table for later processing by
8815 -- Validate_Unchecked_Conversions, which will check sizes and alignments
8816 -- (using values set by the back-end where possible). This is only done
8817 -- if the appropriate warning is active.
8819 if Warn_On_Unchecked_Conversion then
8820 Unchecked_Conversions.Append
8821 (New_Val => UC_Entry'
8826 -- If both sizes are known statically now, then back end annotation
8827 -- is not required to do a proper check but if either size is not
8828 -- known statically, then we need the annotation.
8830 if Known_Static_RM_Size (Source)
8831 and then Known_Static_RM_Size (Target)
8835 Back_Annotate_Rep_Info := True;
8839 -- If unchecked conversion to access type, and access type is declared
8840 -- in the same unit as the unchecked conversion, then set the flag
8841 -- No_Strict_Aliasing (no strict aliasing is implicit here)
8843 if Is_Access_Type (Target) and then
8844 In_Same_Source_Unit (Target, N)
8846 Set_No_Strict_Aliasing (Implementation_Base_Type (Target));
8849 -- Generate N_Validate_Unchecked_Conversion node for back end in case
8850 -- the back end needs to perform special validation checks.
8852 -- Shouldn't this be in Exp_Ch13, since the check only gets done if we
8853 -- have full expansion and the back end is called ???
8856 Make_Validate_Unchecked_Conversion (Sloc (N));
8857 Set_Source_Type (Vnode, Source);
8858 Set_Target_Type (Vnode, Target);
8860 -- If the unchecked conversion node is in a list, just insert before it.
8861 -- If not we have some strange case, not worth bothering about.
8863 if Is_List_Member (N) then
8864 Insert_After (N, Vnode);
8866 end Validate_Unchecked_Conversion;
8868 ------------------------------------
8869 -- Validate_Unchecked_Conversions --
8870 ------------------------------------
8872 procedure Validate_Unchecked_Conversions is
8874 for N in Unchecked_Conversions.First .. Unchecked_Conversions.Last loop
8876 T : UC_Entry renames Unchecked_Conversions.Table (N);
8878 Eloc : constant Source_Ptr := T.Eloc;
8879 Source : constant Entity_Id := T.Source;
8880 Target : constant Entity_Id := T.Target;
8886 -- This validation check, which warns if we have unequal sizes for
8887 -- unchecked conversion, and thus potentially implementation
8888 -- dependent semantics, is one of the few occasions on which we
8889 -- use the official RM size instead of Esize. See description in
8890 -- Einfo "Handling of Type'Size Values" for details.
8892 if Serious_Errors_Detected = 0
8893 and then Known_Static_RM_Size (Source)
8894 and then Known_Static_RM_Size (Target)
8896 -- Don't do the check if warnings off for either type, note the
8897 -- deliberate use of OR here instead of OR ELSE to get the flag
8898 -- Warnings_Off_Used set for both types if appropriate.
8900 and then not (Has_Warnings_Off (Source)
8902 Has_Warnings_Off (Target))
8904 Source_Siz := RM_Size (Source);
8905 Target_Siz := RM_Size (Target);
8907 if Source_Siz /= Target_Siz then
8909 ("?types for unchecked conversion have different sizes!",
8912 if All_Errors_Mode then
8913 Error_Msg_Name_1 := Chars (Source);
8914 Error_Msg_Uint_1 := Source_Siz;
8915 Error_Msg_Name_2 := Chars (Target);
8916 Error_Msg_Uint_2 := Target_Siz;
8917 Error_Msg ("\size of % is ^, size of % is ^?", Eloc);
8919 Error_Msg_Uint_1 := UI_Abs (Source_Siz - Target_Siz);
8921 if Is_Discrete_Type (Source)
8922 and then Is_Discrete_Type (Target)
8924 if Source_Siz > Target_Siz then
8926 ("\?^ high order bits of source will be ignored!",
8929 elsif Is_Unsigned_Type (Source) then
8931 ("\?source will be extended with ^ high order " &
8932 "zero bits?!", Eloc);
8936 ("\?source will be extended with ^ high order " &
8941 elsif Source_Siz < Target_Siz then
8942 if Is_Discrete_Type (Target) then
8943 if Bytes_Big_Endian then
8945 ("\?target value will include ^ undefined " &
8950 ("\?target value will include ^ undefined " &
8957 ("\?^ trailing bits of target value will be " &
8958 "undefined!", Eloc);
8961 else pragma Assert (Source_Siz > Target_Siz);
8963 ("\?^ trailing bits of source will be ignored!",
8970 -- If both types are access types, we need to check the alignment.
8971 -- If the alignment of both is specified, we can do it here.
8973 if Serious_Errors_Detected = 0
8974 and then Ekind (Source) in Access_Kind
8975 and then Ekind (Target) in Access_Kind
8976 and then Target_Strict_Alignment
8977 and then Present (Designated_Type (Source))
8978 and then Present (Designated_Type (Target))
8981 D_Source : constant Entity_Id := Designated_Type (Source);
8982 D_Target : constant Entity_Id := Designated_Type (Target);
8985 if Known_Alignment (D_Source)
8986 and then Known_Alignment (D_Target)
8989 Source_Align : constant Uint := Alignment (D_Source);
8990 Target_Align : constant Uint := Alignment (D_Target);
8993 if Source_Align < Target_Align
8994 and then not Is_Tagged_Type (D_Source)
8996 -- Suppress warning if warnings suppressed on either
8997 -- type or either designated type. Note the use of
8998 -- OR here instead of OR ELSE. That is intentional,
8999 -- we would like to set flag Warnings_Off_Used in
9000 -- all types for which warnings are suppressed.
9002 and then not (Has_Warnings_Off (D_Source)
9004 Has_Warnings_Off (D_Target)
9006 Has_Warnings_Off (Source)
9008 Has_Warnings_Off (Target))
9010 Error_Msg_Uint_1 := Target_Align;
9011 Error_Msg_Uint_2 := Source_Align;
9012 Error_Msg_Node_1 := D_Target;
9013 Error_Msg_Node_2 := D_Source;
9015 ("?alignment of & (^) is stricter than " &
9016 "alignment of & (^)!", Eloc);
9018 ("\?resulting access value may have invalid " &
9019 "alignment!", Eloc);
9027 end Validate_Unchecked_Conversions;
OSDN Git Service
