1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2017, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING3. If not, go to --
19 -- http://www.gnu.org/licenses for a complete copy of the license. --
21 -- GNAT was originally developed by the GNAT team at New York University. --
22 -- Extensive contributions were provided by Ada Core Technologies Inc. --
24 ------------------------------------------------------------------------------
26 with Aspects
; use Aspects
;
27 with Atree
; use Atree
;
28 with Checks
; use Checks
;
29 with Debug
; use Debug
;
30 with Einfo
; use Einfo
;
31 with Elists
; use Elists
;
32 with Errout
; use Errout
;
33 with Expander
; use Expander
;
34 with Exp_Disp
; use Exp_Disp
;
35 with Exp_Tss
; use Exp_Tss
;
36 with Exp_Util
; use Exp_Util
;
37 with Freeze
; use Freeze
;
38 with Ghost
; use Ghost
;
40 with Lib
.Xref
; use Lib
.Xref
;
41 with Namet
; use Namet
;
42 with Nlists
; use Nlists
;
43 with Nmake
; use Nmake
;
45 with Par_SCO
; use Par_SCO
;
46 with Restrict
; use Restrict
;
47 with Rident
; use Rident
;
48 with Rtsfind
; use Rtsfind
;
50 with Sem_Aux
; use Sem_Aux
;
51 with Sem_Case
; use Sem_Case
;
52 with Sem_Ch3
; use Sem_Ch3
;
53 with Sem_Ch6
; use Sem_Ch6
;
54 with Sem_Ch7
; use Sem_Ch7
;
55 with Sem_Ch8
; use Sem_Ch8
;
56 with Sem_Dim
; use Sem_Dim
;
57 with Sem_Disp
; use Sem_Disp
;
58 with Sem_Eval
; use Sem_Eval
;
59 with Sem_Prag
; use Sem_Prag
;
60 with Sem_Res
; use Sem_Res
;
61 with Sem_Type
; use Sem_Type
;
62 with Sem_Util
; use Sem_Util
;
63 with Sem_Warn
; use Sem_Warn
;
64 with Sinfo
; use Sinfo
;
65 with Sinput
; use Sinput
;
66 with Snames
; use Snames
;
67 with Stand
; use Stand
;
68 with Targparm
; use Targparm
;
69 with Ttypes
; use Ttypes
;
70 with Tbuild
; use Tbuild
;
71 with Urealp
; use Urealp
;
72 with Warnsw
; use Warnsw
;
74 with GNAT
.Heap_Sort_G
;
76 package body Sem_Ch13
is
78 SSU
: constant Pos
:= System_Storage_Unit
;
79 -- Convenient short hand for commonly used constant
81 -----------------------
82 -- Local Subprograms --
83 -----------------------
85 procedure Adjust_Record_For_Reverse_Bit_Order_Ada_95
(R
: Entity_Id
);
86 -- Helper routine providing the original (pre-AI95-0133) behavior for
87 -- Adjust_Record_For_Reverse_Bit_Order.
89 procedure Alignment_Check_For_Size_Change
(Typ
: Entity_Id
; Size
: Uint
);
90 -- This routine is called after setting one of the sizes of type entity
91 -- Typ to Size. The purpose is to deal with the situation of a derived
92 -- type whose inherited alignment is no longer appropriate for the new
93 -- size value. In this case, we reset the Alignment to unknown.
95 procedure Build_Discrete_Static_Predicate
99 -- Given a predicated type Typ, where Typ is a discrete static subtype,
100 -- whose predicate expression is Expr, tests if Expr is a static predicate,
101 -- and if so, builds the predicate range list. Nam is the name of the one
102 -- argument to the predicate function. Occurrences of the type name in the
103 -- predicate expression have been replaced by identifier references to this
104 -- name, which is unique, so any identifier with Chars matching Nam must be
105 -- a reference to the type. If the predicate is non-static, this procedure
106 -- returns doing nothing. If the predicate is static, then the predicate
107 -- list is stored in Static_Discrete_Predicate (Typ), and the Expr is
108 -- rewritten as a canonicalized membership operation.
110 function Build_Export_Import_Pragma
112 Id
: Entity_Id
) return Node_Id
;
113 -- Create the corresponding pragma for aspect Export or Import denoted by
114 -- Asp. Id is the related entity subject to the aspect. Return Empty when
115 -- the expression of aspect Asp evaluates to False or is erroneous.
117 function Build_Predicate_Function_Declaration
118 (Typ
: Entity_Id
) return Node_Id
;
119 -- Build the declaration for a predicate function. The declaration is built
120 -- at the end of the declarative part containing the type definition, which
121 -- may be before the freeze point of the type. The predicate expression is
122 -- pre-analyzed at this point, to catch visibility errors.
124 procedure Build_Predicate_Functions
(Typ
: Entity_Id
; N
: Node_Id
);
125 -- If Typ has predicates (indicated by Has_Predicates being set for Typ),
126 -- then either there are pragma Predicate entries on the rep chain for the
127 -- type (note that Predicate aspects are converted to pragma Predicate), or
128 -- there are inherited aspects from a parent type, or ancestor subtypes.
129 -- This procedure builds body for the Predicate function that tests these
130 -- predicates. N is the freeze node for the type. The spec of the function
131 -- is inserted before the freeze node, and the body of the function is
132 -- inserted after the freeze node. If the predicate expression has a least
133 -- one Raise_Expression, then this procedure also builds the M version of
134 -- the predicate function for use in membership tests.
136 procedure Check_Pool_Size_Clash
(Ent
: Entity_Id
; SP
, SS
: Node_Id
);
137 -- Called if both Storage_Pool and Storage_Size attribute definition
138 -- clauses (SP and SS) are present for entity Ent. Issue error message.
140 procedure Freeze_Entity_Checks
(N
: Node_Id
);
141 -- Called from Analyze_Freeze_Entity and Analyze_Generic_Freeze Entity
142 -- to generate appropriate semantic checks that are delayed until this
143 -- point (they had to be delayed this long for cases of delayed aspects,
144 -- e.g. analysis of statically predicated subtypes in choices, for which
145 -- we have to be sure the subtypes in question are frozen before checking).
147 function Get_Alignment_Value
(Expr
: Node_Id
) return Uint
;
148 -- Given the expression for an alignment value, returns the corresponding
149 -- Uint value. If the value is inappropriate, then error messages are
150 -- posted as required, and a value of No_Uint is returned.
152 function Is_Operational_Item
(N
: Node_Id
) return Boolean;
153 -- A specification for a stream attribute is allowed before the full type
154 -- is declared, as explained in AI-00137 and the corrigendum. Attributes
155 -- that do not specify a representation characteristic are operational
158 function Is_Predicate_Static
160 Nam
: Name_Id
) return Boolean;
161 -- Given predicate expression Expr, tests if Expr is predicate-static in
162 -- the sense of the rules in (RM 3.2.4 (15-24)). Occurrences of the type
163 -- name in the predicate expression have been replaced by references to
164 -- an identifier whose Chars field is Nam. This name is unique, so any
165 -- identifier with Chars matching Nam must be a reference to the type.
166 -- Returns True if the expression is predicate-static and False otherwise,
167 -- but is not in the business of setting flags or issuing error messages.
169 -- Only scalar types can have static predicates, so False is always
170 -- returned for non-scalar types.
172 -- Note: the RM seems to suggest that string types can also have static
173 -- predicates. But that really makes lttle sense as very few useful
174 -- predicates can be constructed for strings. Remember that:
178 -- is not a static expression. So even though the clearly faulty RM wording
179 -- allows the following:
181 -- subtype S is String with Static_Predicate => S < "DEF"
183 -- We can't allow this, otherwise we have predicate-static applying to a
184 -- larger class than static expressions, which was never intended.
186 procedure New_Stream_Subprogram
190 Nam
: TSS_Name_Type
);
191 -- Create a subprogram renaming of a given stream attribute to the
192 -- designated subprogram and then in the tagged case, provide this as a
193 -- primitive operation, or in the untagged case make an appropriate TSS
194 -- entry. This is more properly an expansion activity than just semantics,
195 -- but the presence of user-defined stream functions for limited types
196 -- is a legality check, which is why this takes place here rather than in
197 -- exp_ch13, where it was previously. Nam indicates the name of the TSS
198 -- function to be generated.
200 -- To avoid elaboration anomalies with freeze nodes, for untagged types
201 -- we generate both a subprogram declaration and a subprogram renaming
202 -- declaration, so that the attribute specification is handled as a
203 -- renaming_as_body. For tagged types, the specification is one of the
206 procedure Resolve_Iterable_Operation
211 -- If the name of a primitive operation for an Iterable aspect is
212 -- overloaded, resolve according to required signature.
218 Biased
: Boolean := True);
219 -- If Biased is True, sets Has_Biased_Representation flag for E, and
220 -- outputs a warning message at node N if Warn_On_Biased_Representation is
221 -- is True. This warning inserts the string Msg to describe the construct
224 ---------------------------------------------------
225 -- Table for Validate_Compile_Time_Warning_Error --
226 ---------------------------------------------------
228 -- The following table collects pragmas Compile_Time_Error and Compile_
229 -- Time_Warning for validation. Entries are made by calls to subprogram
230 -- Validate_Compile_Time_Warning_Error, and the call to the procedure
231 -- Validate_Compile_Time_Warning_Errors does the actual error checking
232 -- and posting of warning and error messages. The reason for this delayed
233 -- processing is to take advantage of back-annotations of attributes size
234 -- and alignment values performed by the back end.
236 -- Note: the reason we store a Source_Ptr value instead of a Node_Id is
237 -- that by the time Validate_Unchecked_Conversions is called, Sprint will
238 -- already have modified all Sloc values if the -gnatD option is set.
240 type CTWE_Entry
is record
242 -- Source location used in warnings and error messages
245 -- Pragma Compile_Time_Error or Compile_Time_Warning
248 -- The scope which encloses the pragma
251 package Compile_Time_Warnings_Errors
is new Table
.Table
(
252 Table_Component_Type
=> CTWE_Entry
,
253 Table_Index_Type
=> Int
,
254 Table_Low_Bound
=> 1,
256 Table_Increment
=> 200,
257 Table_Name
=> "Compile_Time_Warnings_Errors");
259 ----------------------------------------------
260 -- Table for Validate_Unchecked_Conversions --
261 ----------------------------------------------
263 -- The following table collects unchecked conversions for validation.
264 -- Entries are made by Validate_Unchecked_Conversion and then the call
265 -- to Validate_Unchecked_Conversions does the actual error checking and
266 -- posting of warnings. The reason for this delayed processing is to take
267 -- advantage of back-annotations of size and alignment values performed by
270 -- Note: the reason we store a Source_Ptr value instead of a Node_Id is
271 -- that by the time Validate_Unchecked_Conversions is called, Sprint will
272 -- already have modified all Sloc values if the -gnatD option is set.
274 type UC_Entry
is record
275 Eloc
: Source_Ptr
; -- node used for posting warnings
276 Source
: Entity_Id
; -- source type for unchecked conversion
277 Target
: Entity_Id
; -- target type for unchecked conversion
278 Act_Unit
: Entity_Id
; -- actual function instantiated
281 package Unchecked_Conversions
is new Table
.Table
(
282 Table_Component_Type
=> UC_Entry
,
283 Table_Index_Type
=> Int
,
284 Table_Low_Bound
=> 1,
286 Table_Increment
=> 200,
287 Table_Name
=> "Unchecked_Conversions");
289 ----------------------------------------
290 -- Table for Validate_Address_Clauses --
291 ----------------------------------------
293 -- If an address clause has the form
295 -- for X'Address use Expr
297 -- where Expr has a value known at compile time or is of the form Y'Address
298 -- or recursively is a reference to a constant initialized with either of
299 -- these forms, and the value of Expr is not a multiple of X's alignment,
300 -- or if Y has a smaller alignment than X, then that merits a warning about
301 -- possible bad alignment. The following table collects address clauses of
302 -- this kind. We put these in a table so that they can be checked after the
303 -- back end has completed annotation of the alignments of objects, since we
304 -- can catch more cases that way.
306 type Address_Clause_Check_Record
is record
308 -- The address clause
311 -- The entity of the object subject to the address clause
314 -- The value of the address in the first case
317 -- The entity of the object being overlaid in the second case
320 -- Whether the address is offset within Y in the second case
323 package Address_Clause_Checks
is new Table
.Table
(
324 Table_Component_Type
=> Address_Clause_Check_Record
,
325 Table_Index_Type
=> Int
,
326 Table_Low_Bound
=> 1,
328 Table_Increment
=> 200,
329 Table_Name
=> "Address_Clause_Checks");
331 -----------------------------------------
332 -- Adjust_Record_For_Reverse_Bit_Order --
333 -----------------------------------------
335 procedure Adjust_Record_For_Reverse_Bit_Order
(R
: Entity_Id
) is
336 Max_Machine_Scalar_Size
: constant Uint
:=
338 (Standard_Long_Long_Integer_Size
);
339 -- We use this as the maximum machine scalar size
341 SSU
: constant Uint
:= UI_From_Int
(System_Storage_Unit
);
348 -- Processing here used to depend on Ada version: the behavior was
349 -- changed by AI95-0133. However this AI is a Binding interpretation,
350 -- so we now implement it even in Ada 95 mode. The original behavior
351 -- from unamended Ada 95 is still available for compatibility under
352 -- debugging switch -gnatd.
354 if Ada_Version
< Ada_2005
and then Debug_Flag_Dot_P
then
355 Adjust_Record_For_Reverse_Bit_Order_Ada_95
(R
);
359 -- For Ada 2005, we do machine scalar processing, as fully described In
360 -- AI-133. This involves gathering all components which start at the
361 -- same byte offset and processing them together. Same approach is still
362 -- valid in later versions including Ada 2012.
364 -- This first loop through components does two things. First it deals
365 -- with the case of components with component clauses whose length is
366 -- greater than the maximum machine scalar size (either accepting them
367 -- or rejecting as needed). Second, it counts the number of components
368 -- with component clauses whose length does not exceed this maximum for
372 Comp
:= First_Component_Or_Discriminant
(R
);
373 while Present
(Comp
) loop
374 CC
:= Component_Clause
(Comp
);
378 Fbit
: constant Uint
:= Static_Integer
(First_Bit
(CC
));
379 Lbit
: constant Uint
:= Static_Integer
(Last_Bit
(CC
));
382 -- Case of component with last bit >= max machine scalar
384 if Lbit
>= Max_Machine_Scalar_Size
then
386 -- This is allowed only if first bit is zero, and last bit
387 -- + 1 is a multiple of storage unit size.
389 if Fbit
= 0 and then (Lbit
+ 1) mod SSU
= 0 then
391 -- This is the case to give a warning if enabled
393 if Warn_On_Reverse_Bit_Order
then
395 ("info: multi-byte field specified with "
396 & "non-standard Bit_Order?V?", CC
);
398 if Bytes_Big_Endian
then
400 ("\bytes are not reversed "
401 & "(component is big-endian)?V?", CC
);
404 ("\bytes are not reversed "
405 & "(component is little-endian)?V?", CC
);
409 -- Give error message for RM 13.5.1(10) violation
413 ("machine scalar rules not followed for&",
414 First_Bit
(CC
), Comp
);
416 Error_Msg_Uint_1
:= Lbit
+ 1;
417 Error_Msg_Uint_2
:= Max_Machine_Scalar_Size
;
419 ("\last bit + 1 (^) exceeds maximum machine scalar "
420 & "size (^)", First_Bit
(CC
));
422 if (Lbit
+ 1) mod SSU
/= 0 then
423 Error_Msg_Uint_1
:= SSU
;
425 ("\and is not a multiple of Storage_Unit (^) "
426 & "(RM 13.5.1(10))", First_Bit
(CC
));
429 Error_Msg_Uint_1
:= Fbit
;
431 ("\and first bit (^) is non-zero "
432 & "(RM 13.4.1(10))", First_Bit
(CC
));
436 -- OK case of machine scalar related component clause. For now,
440 Num_CC
:= Num_CC
+ 1;
445 Next_Component_Or_Discriminant
(Comp
);
448 -- We need to sort the component clauses on the basis of the Position
449 -- values in the clause, so we can group clauses with the same Position
450 -- together to determine the relevant machine scalar size.
453 Comps
: array (0 .. Num_CC
) of Entity_Id
;
454 -- Array to collect component and discriminant entities. The data
455 -- starts at index 1, the 0'th entry is for the sort routine.
457 function CP_Lt
(Op1
, Op2
: Natural) return Boolean;
458 -- Compare routine for Sort
460 procedure CP_Move
(From
: Natural; To
: Natural);
461 -- Move routine for Sort
463 package Sorting
is new GNAT
.Heap_Sort_G
(CP_Move
, CP_Lt
);
466 -- Maximum last bit value of any component in this set
469 -- Corresponding machine scalar size
473 -- Start and stop positions in the component list of the set of
474 -- components with the same starting position (that constitute
475 -- components in a single machine scalar).
481 function CP_Lt
(Op1
, Op2
: Natural) return Boolean is
484 Position
(Component_Clause
(Comps
(Op1
))) <
485 Position
(Component_Clause
(Comps
(Op2
)));
492 procedure CP_Move
(From
: Natural; To
: Natural) is
494 Comps
(To
) := Comps
(From
);
497 -- Start of processing for Sort_CC
500 -- Collect the machine scalar relevant component clauses
503 Comp
:= First_Component_Or_Discriminant
(R
);
504 while Present
(Comp
) loop
506 CC
: constant Node_Id
:= Component_Clause
(Comp
);
509 -- Collect only component clauses whose last bit is less than
510 -- machine scalar size. Any component clause whose last bit
511 -- exceeds this value does not take part in machine scalar
512 -- layout considerations. The test for Error_Posted makes sure
513 -- we exclude component clauses for which we already posted an
517 and then not Error_Posted
(Last_Bit
(CC
))
518 and then Static_Integer
(Last_Bit
(CC
)) <
519 Max_Machine_Scalar_Size
521 Num_CC
:= Num_CC
+ 1;
522 Comps
(Num_CC
) := Comp
;
526 Next_Component_Or_Discriminant
(Comp
);
529 -- Sort by ascending position number
531 Sorting
.Sort
(Num_CC
);
533 -- We now have all the components whose size does not exceed the max
534 -- machine scalar value, sorted by starting position. In this loop we
535 -- gather groups of clauses starting at the same position, to process
536 -- them in accordance with AI-133.
539 while Stop
< Num_CC
loop
544 (Last_Bit
(Component_Clause
(Comps
(Start
))));
545 while Stop
< Num_CC
loop
547 (Position
(Component_Clause
(Comps
(Stop
+ 1)))) =
549 (Position
(Component_Clause
(Comps
(Stop
))))
557 (Component_Clause
(Comps
(Stop
)))));
563 -- Now we have a group of component clauses from Start to Stop
564 -- whose positions are identical, and MaxL is the maximum last
565 -- bit value of any of these components.
567 -- We need to determine the corresponding machine scalar size.
568 -- This loop assumes that machine scalar sizes are even, and that
569 -- each possible machine scalar has twice as many bits as the next
572 MSS
:= Max_Machine_Scalar_Size
;
574 and then (MSS
/ 2) >= SSU
575 and then (MSS
/ 2) > MaxL
580 -- Here is where we fix up the Component_Bit_Offset value to
581 -- account for the reverse bit order. Some examples of what needs
582 -- to be done for the case of a machine scalar size of 8 are:
584 -- First_Bit .. Last_Bit Component_Bit_Offset
596 -- The rule is that the first bit is obtained by subtracting the
597 -- old ending bit from machine scalar size - 1.
599 for C
in Start
.. Stop
loop
601 Comp
: constant Entity_Id
:= Comps
(C
);
602 CC
: constant Node_Id
:= Component_Clause
(Comp
);
604 LB
: constant Uint
:= Static_Integer
(Last_Bit
(CC
));
605 NFB
: constant Uint
:= MSS
- Uint_1
- LB
;
606 NLB
: constant Uint
:= NFB
+ Esize
(Comp
) - 1;
607 Pos
: constant Uint
:= Static_Integer
(Position
(CC
));
610 if Warn_On_Reverse_Bit_Order
then
611 Error_Msg_Uint_1
:= MSS
;
613 ("info: reverse bit order in machine scalar of "
614 & "length^?V?", First_Bit
(CC
));
615 Error_Msg_Uint_1
:= NFB
;
616 Error_Msg_Uint_2
:= NLB
;
618 if Bytes_Big_Endian
then
620 ("\big-endian range for component & is ^ .. ^?V?",
621 First_Bit
(CC
), Comp
);
624 ("\little-endian range for component & is ^ .. ^?V?",
625 First_Bit
(CC
), Comp
);
629 Set_Component_Bit_Offset
(Comp
, Pos
* SSU
+ NFB
);
630 Set_Normalized_First_Bit
(Comp
, NFB
mod SSU
);
635 end Adjust_Record_For_Reverse_Bit_Order
;
637 ------------------------------------------------
638 -- Adjust_Record_For_Reverse_Bit_Order_Ada_95 --
639 ------------------------------------------------
641 procedure Adjust_Record_For_Reverse_Bit_Order_Ada_95
(R
: Entity_Id
) is
646 -- For Ada 95, we just renumber bits within a storage unit. We do the
647 -- same for Ada 83 mode, since we recognize the Bit_Order attribute in
648 -- Ada 83, and are free to add this extension.
650 Comp
:= First_Component_Or_Discriminant
(R
);
651 while Present
(Comp
) loop
652 CC
:= Component_Clause
(Comp
);
654 -- If component clause is present, then deal with the non-default
655 -- bit order case for Ada 95 mode.
657 -- We only do this processing for the base type, and in fact that
658 -- is important, since otherwise if there are record subtypes, we
659 -- could reverse the bits once for each subtype, which is wrong.
661 if Present
(CC
) and then Ekind
(R
) = E_Record_Type
then
663 CFB
: constant Uint
:= Component_Bit_Offset
(Comp
);
664 CSZ
: constant Uint
:= Esize
(Comp
);
665 CLC
: constant Node_Id
:= Component_Clause
(Comp
);
666 Pos
: constant Node_Id
:= Position
(CLC
);
667 FB
: constant Node_Id
:= First_Bit
(CLC
);
669 Storage_Unit_Offset
: constant Uint
:=
670 CFB
/ System_Storage_Unit
;
672 Start_Bit
: constant Uint
:=
673 CFB
mod System_Storage_Unit
;
676 -- Cases where field goes over storage unit boundary
678 if Start_Bit
+ CSZ
> System_Storage_Unit
then
680 -- Allow multi-byte field but generate warning
682 if Start_Bit
mod System_Storage_Unit
= 0
683 and then CSZ
mod System_Storage_Unit
= 0
686 ("info: multi-byte field specified with non-standard "
687 & "Bit_Order?V?", CLC
);
689 if Bytes_Big_Endian
then
691 ("\bytes are not reversed "
692 & "(component is big-endian)?V?", CLC
);
695 ("\bytes are not reversed "
696 & "(component is little-endian)?V?", CLC
);
699 -- Do not allow non-contiguous field
703 ("attempt to specify non-contiguous field not "
706 ("\caused by non-standard Bit_Order specified in "
707 & "legacy Ada 95 mode", CLC
);
710 -- Case where field fits in one storage unit
713 -- Give warning if suspicious component clause
715 if Intval
(FB
) >= System_Storage_Unit
716 and then Warn_On_Reverse_Bit_Order
719 ("info: Bit_Order clause does not affect byte "
720 & "ordering?V?", Pos
);
722 Intval
(Pos
) + Intval
(FB
) /
725 ("info: position normalized to ^ before bit order "
726 & "interpreted?V?", Pos
);
729 -- Here is where we fix up the Component_Bit_Offset value
730 -- to account for the reverse bit order. Some examples of
731 -- what needs to be done are:
733 -- First_Bit .. Last_Bit Component_Bit_Offset
745 -- The rule is that the first bit is is obtained by
746 -- subtracting the old ending bit from storage_unit - 1.
748 Set_Component_Bit_Offset
(Comp
,
749 (Storage_Unit_Offset
* System_Storage_Unit
) +
750 (System_Storage_Unit
- 1) -
751 (Start_Bit
+ CSZ
- 1));
753 Set_Normalized_First_Bit
(Comp
,
754 Component_Bit_Offset
(Comp
) mod System_Storage_Unit
);
759 Next_Component_Or_Discriminant
(Comp
);
761 end Adjust_Record_For_Reverse_Bit_Order_Ada_95
;
763 -------------------------------------
764 -- Alignment_Check_For_Size_Change --
765 -------------------------------------
767 procedure Alignment_Check_For_Size_Change
(Typ
: Entity_Id
; Size
: Uint
) is
769 -- If the alignment is known, and not set by a rep clause, and is
770 -- inconsistent with the size being set, then reset it to unknown,
771 -- we assume in this case that the size overrides the inherited
772 -- alignment, and that the alignment must be recomputed.
774 if Known_Alignment
(Typ
)
775 and then not Has_Alignment_Clause
(Typ
)
776 and then Size
mod (Alignment
(Typ
) * SSU
) /= 0
778 Init_Alignment
(Typ
);
780 end Alignment_Check_For_Size_Change
;
782 -------------------------------------
783 -- Analyze_Aspects_At_Freeze_Point --
784 -------------------------------------
786 procedure Analyze_Aspects_At_Freeze_Point
(E
: Entity_Id
) is
787 procedure Analyze_Aspect_Default_Value
(ASN
: Node_Id
);
788 -- This routine analyzes an Aspect_Default_[Component_]Value denoted by
789 -- the aspect specification node ASN.
791 procedure Inherit_Delayed_Rep_Aspects
(ASN
: Node_Id
);
792 -- As discussed in the spec of Aspects (see Aspect_Delay declaration),
793 -- a derived type can inherit aspects from its parent which have been
794 -- specified at the time of the derivation using an aspect, as in:
796 -- type A is range 1 .. 10
797 -- with Size => Not_Defined_Yet;
801 -- Not_Defined_Yet : constant := 64;
803 -- In this example, the Size of A is considered to be specified prior
804 -- to the derivation, and thus inherited, even though the value is not
805 -- known at the time of derivation. To deal with this, we use two entity
806 -- flags. The flag Has_Derived_Rep_Aspects is set in the parent type (A
807 -- here), and then the flag May_Inherit_Delayed_Rep_Aspects is set in
808 -- the derived type (B here). If this flag is set when the derived type
809 -- is frozen, then this procedure is called to ensure proper inheritance
810 -- of all delayed aspects from the parent type. The derived type is E,
811 -- the argument to Analyze_Aspects_At_Freeze_Point. ASN is the first
812 -- aspect specification node in the Rep_Item chain for the parent type.
814 procedure Make_Pragma_From_Boolean_Aspect
(ASN
: Node_Id
);
815 -- Given an aspect specification node ASN whose expression is an
816 -- optional Boolean, this routines creates the corresponding pragma
817 -- at the freezing point.
819 ----------------------------------
820 -- Analyze_Aspect_Default_Value --
821 ----------------------------------
823 procedure Analyze_Aspect_Default_Value
(ASN
: Node_Id
) is
824 A_Id
: constant Aspect_Id
:= Get_Aspect_Id
(ASN
);
825 Ent
: constant Entity_Id
:= Entity
(ASN
);
826 Expr
: constant Node_Id
:= Expression
(ASN
);
827 Id
: constant Node_Id
:= Identifier
(ASN
);
830 Error_Msg_Name_1
:= Chars
(Id
);
832 if not Is_Type
(Ent
) then
833 Error_Msg_N
("aspect% can only apply to a type", Id
);
836 elsif not Is_First_Subtype
(Ent
) then
837 Error_Msg_N
("aspect% cannot apply to subtype", Id
);
840 elsif A_Id
= Aspect_Default_Value
841 and then not Is_Scalar_Type
(Ent
)
843 Error_Msg_N
("aspect% can only be applied to scalar type", Id
);
846 elsif A_Id
= Aspect_Default_Component_Value
then
847 if not Is_Array_Type
(Ent
) then
848 Error_Msg_N
("aspect% can only be applied to array type", Id
);
851 elsif not Is_Scalar_Type
(Component_Type
(Ent
)) then
852 Error_Msg_N
("aspect% requires scalar components", Id
);
857 Set_Has_Default_Aspect
(Base_Type
(Ent
));
859 if Is_Scalar_Type
(Ent
) then
860 Set_Default_Aspect_Value
(Base_Type
(Ent
), Expr
);
862 Set_Default_Aspect_Component_Value
(Base_Type
(Ent
), Expr
);
864 end Analyze_Aspect_Default_Value
;
866 ---------------------------------
867 -- Inherit_Delayed_Rep_Aspects --
868 ---------------------------------
870 procedure Inherit_Delayed_Rep_Aspects
(ASN
: Node_Id
) is
871 A_Id
: constant Aspect_Id
:= Get_Aspect_Id
(ASN
);
872 P
: constant Entity_Id
:= Entity
(ASN
);
873 -- Entithy for parent type
876 -- Item from Rep_Item chain
881 -- Loop through delayed aspects for the parent type
884 while Present
(N
) loop
885 if Nkind
(N
) = N_Aspect_Specification
then
886 exit when Entity
(N
) /= P
;
888 if Is_Delayed_Aspect
(N
) then
889 A
:= Get_Aspect_Id
(Chars
(Identifier
(N
)));
891 -- Process delayed rep aspect. For Boolean attributes it is
892 -- not possible to cancel an attribute once set (the attempt
893 -- to use an aspect with xxx => False is an error) for a
894 -- derived type. So for those cases, we do not have to check
895 -- if a clause has been given for the derived type, since it
896 -- is harmless to set it again if it is already set.
902 when Aspect_Alignment
=>
903 if not Has_Alignment_Clause
(E
) then
904 Set_Alignment
(E
, Alignment
(P
));
909 when Aspect_Atomic
=>
910 if Is_Atomic
(P
) then
916 when Aspect_Atomic_Components
=>
917 if Has_Atomic_Components
(P
) then
918 Set_Has_Atomic_Components
(Base_Type
(E
));
923 when Aspect_Bit_Order
=>
924 if Is_Record_Type
(E
)
925 and then No
(Get_Attribute_Definition_Clause
926 (E
, Attribute_Bit_Order
))
927 and then Reverse_Bit_Order
(P
)
929 Set_Reverse_Bit_Order
(Base_Type
(E
));
934 when Aspect_Component_Size
=>
936 and then not Has_Component_Size_Clause
(E
)
939 (Base_Type
(E
), Component_Size
(P
));
944 when Aspect_Machine_Radix
=>
945 if Is_Decimal_Fixed_Point_Type
(E
)
946 and then not Has_Machine_Radix_Clause
(E
)
948 Set_Machine_Radix_10
(E
, Machine_Radix_10
(P
));
951 -- Object_Size (also Size which also sets Object_Size)
953 when Aspect_Object_Size
956 if not Has_Size_Clause
(E
)
958 No
(Get_Attribute_Definition_Clause
959 (E
, Attribute_Object_Size
))
961 Set_Esize
(E
, Esize
(P
));
967 if not Is_Packed
(E
) then
968 Set_Is_Packed
(Base_Type
(E
));
970 if Is_Bit_Packed_Array
(P
) then
971 Set_Is_Bit_Packed_Array
(Base_Type
(E
));
972 Set_Packed_Array_Impl_Type
973 (E
, Packed_Array_Impl_Type
(P
));
977 -- Scalar_Storage_Order
979 when Aspect_Scalar_Storage_Order
=>
980 if (Is_Record_Type
(E
) or else Is_Array_Type
(E
))
981 and then No
(Get_Attribute_Definition_Clause
982 (E
, Attribute_Scalar_Storage_Order
))
983 and then Reverse_Storage_Order
(P
)
985 Set_Reverse_Storage_Order
(Base_Type
(E
));
987 -- Clear default SSO indications, since the aspect
988 -- overrides the default.
990 Set_SSO_Set_Low_By_Default
(Base_Type
(E
), False);
991 Set_SSO_Set_High_By_Default
(Base_Type
(E
), False);
997 if Is_Fixed_Point_Type
(E
)
998 and then not Has_Small_Clause
(E
)
1000 Set_Small_Value
(E
, Small_Value
(P
));
1005 when Aspect_Storage_Size
=>
1006 if (Is_Access_Type
(E
) or else Is_Task_Type
(E
))
1007 and then not Has_Storage_Size_Clause
(E
)
1009 Set_Storage_Size_Variable
1010 (Base_Type
(E
), Storage_Size_Variable
(P
));
1015 when Aspect_Value_Size
=>
1017 -- Value_Size is never inherited, it is either set by
1018 -- default, or it is explicitly set for the derived
1019 -- type. So nothing to do here.
1025 when Aspect_Volatile
=>
1026 if Is_Volatile
(P
) then
1027 Set_Is_Volatile
(E
);
1030 -- Volatile_Full_Access
1032 when Aspect_Volatile_Full_Access
=>
1033 if Is_Volatile_Full_Access
(P
) then
1034 Set_Is_Volatile_Full_Access
(E
);
1037 -- Volatile_Components
1039 when Aspect_Volatile_Components
=>
1040 if Has_Volatile_Components
(P
) then
1041 Set_Has_Volatile_Components
(Base_Type
(E
));
1044 -- That should be all the Rep Aspects
1047 pragma Assert
(Aspect_Delay
(A_Id
) /= Rep_Aspect
);
1053 N
:= Next_Rep_Item
(N
);
1055 end Inherit_Delayed_Rep_Aspects
;
1057 -------------------------------------
1058 -- Make_Pragma_From_Boolean_Aspect --
1059 -------------------------------------
1061 procedure Make_Pragma_From_Boolean_Aspect
(ASN
: Node_Id
) is
1062 Ident
: constant Node_Id
:= Identifier
(ASN
);
1063 A_Name
: constant Name_Id
:= Chars
(Ident
);
1064 A_Id
: constant Aspect_Id
:= Get_Aspect_Id
(A_Name
);
1065 Ent
: constant Entity_Id
:= Entity
(ASN
);
1066 Expr
: constant Node_Id
:= Expression
(ASN
);
1067 Loc
: constant Source_Ptr
:= Sloc
(ASN
);
1069 procedure Check_False_Aspect_For_Derived_Type
;
1070 -- This procedure checks for the case of a false aspect for a derived
1071 -- type, which improperly tries to cancel an aspect inherited from
1074 -----------------------------------------
1075 -- Check_False_Aspect_For_Derived_Type --
1076 -----------------------------------------
1078 procedure Check_False_Aspect_For_Derived_Type
is
1082 -- We are only checking derived types
1084 if not Is_Derived_Type
(E
) then
1088 Par
:= Nearest_Ancestor
(E
);
1094 if not Is_Atomic
(Par
) then
1098 when Aspect_Atomic_Components
=>
1099 if not Has_Atomic_Components
(Par
) then
1103 when Aspect_Discard_Names
=>
1104 if not Discard_Names
(Par
) then
1109 if not Is_Packed
(Par
) then
1113 when Aspect_Unchecked_Union
=>
1114 if not Is_Unchecked_Union
(Par
) then
1118 when Aspect_Volatile
=>
1119 if not Is_Volatile
(Par
) then
1123 when Aspect_Volatile_Components
=>
1124 if not Has_Volatile_Components
(Par
) then
1128 when Aspect_Volatile_Full_Access
=>
1129 if not Is_Volatile_Full_Access
(Par
) then
1137 -- Fall through means we are canceling an inherited aspect
1139 Error_Msg_Name_1
:= A_Name
;
1141 ("derived type& inherits aspect%, cannot cancel", Expr
, E
);
1142 end Check_False_Aspect_For_Derived_Type
;
1148 -- Start of processing for Make_Pragma_From_Boolean_Aspect
1151 -- Note that we know Expr is present, because for a missing Expr
1152 -- argument, we knew it was True and did not need to delay the
1153 -- evaluation to the freeze point.
1155 if Is_False
(Static_Boolean
(Expr
)) then
1156 Check_False_Aspect_For_Derived_Type
;
1161 Pragma_Identifier
=>
1162 Make_Identifier
(Sloc
(Ident
), Chars
(Ident
)),
1163 Pragma_Argument_Associations
=> New_List
(
1164 Make_Pragma_Argument_Association
(Sloc
(Ident
),
1165 Expression
=> New_Occurrence_Of
(Ent
, Sloc
(Ident
)))));
1167 Set_From_Aspect_Specification
(Prag
, True);
1168 Set_Corresponding_Aspect
(Prag
, ASN
);
1169 Set_Aspect_Rep_Item
(ASN
, Prag
);
1170 Set_Is_Delayed_Aspect
(Prag
);
1171 Set_Parent
(Prag
, ASN
);
1173 end Make_Pragma_From_Boolean_Aspect
;
1181 -- Start of processing for Analyze_Aspects_At_Freeze_Point
1184 -- Must be visible in current scope, but if this is a type from a nested
1185 -- package it may be frozen from an object declaration in the enclosing
1186 -- scope, so install the package declarations to complete the analysis
1187 -- of the aspects, if any. If the package itself is frozen the type will
1188 -- have been frozen as well.
1190 if not Scope_Within_Or_Same
(Current_Scope
, Scope
(E
)) then
1191 if Is_Type
(E
) and then From_Nested_Package
(E
) then
1193 Pack
: constant Entity_Id
:= Scope
(E
);
1197 Install_Visible_Declarations
(Pack
);
1198 Install_Private_Declarations
(Pack
);
1199 Analyze_Aspects_At_Freeze_Point
(E
);
1201 if Is_Private_Type
(E
)
1202 and then Present
(Full_View
(E
))
1204 Analyze_Aspects_At_Freeze_Point
(Full_View
(E
));
1207 End_Package_Scope
(Pack
);
1211 -- Aspects from other entities in different contexts are analyzed
1219 -- Look for aspect specification entries for this entity
1221 ASN
:= First_Rep_Item
(E
);
1222 while Present
(ASN
) loop
1223 if Nkind
(ASN
) = N_Aspect_Specification
then
1224 exit when Entity
(ASN
) /= E
;
1226 if Is_Delayed_Aspect
(ASN
) then
1227 A_Id
:= Get_Aspect_Id
(ASN
);
1231 -- For aspects whose expression is an optional Boolean, make
1232 -- the corresponding pragma at the freeze point.
1234 when Boolean_Aspects
1235 | Library_Unit_Aspects
1237 -- Aspects Export and Import require special handling.
1238 -- Both are by definition Boolean and may benefit from
1239 -- forward references, however their expressions are
1240 -- treated as static. In addition, the syntax of their
1241 -- corresponding pragmas requires extra "pieces" which
1242 -- may also contain forward references. To account for
1243 -- all of this, the corresponding pragma is created by
1244 -- Analyze_Aspect_Export_Import, but is not analyzed as
1245 -- the complete analysis must happen now.
1247 if A_Id
= Aspect_Export
or else A_Id
= Aspect_Import
then
1250 -- Otherwise create a corresponding pragma
1253 Make_Pragma_From_Boolean_Aspect
(ASN
);
1256 -- Special handling for aspects that don't correspond to
1257 -- pragmas/attributes.
1259 when Aspect_Default_Value
1260 | Aspect_Default_Component_Value
1262 -- Do not inherit aspect for anonymous base type of a
1263 -- scalar or array type, because they apply to the first
1264 -- subtype of the type, and will be processed when that
1265 -- first subtype is frozen.
1267 if Is_Derived_Type
(E
)
1268 and then not Comes_From_Source
(E
)
1269 and then E
/= First_Subtype
(E
)
1273 Analyze_Aspect_Default_Value
(ASN
);
1276 -- Ditto for iterator aspects, because the corresponding
1277 -- attributes may not have been analyzed yet.
1279 when Aspect_Constant_Indexing
1280 | Aspect_Default_Iterator
1281 | Aspect_Iterator_Element
1282 | Aspect_Variable_Indexing
1284 Analyze
(Expression
(ASN
));
1286 if Etype
(Expression
(ASN
)) = Any_Type
then
1288 ("\aspect must be fully defined before & is frozen",
1292 when Aspect_Iterable
=>
1293 Validate_Iterable_Aspect
(E
, ASN
);
1299 Ritem
:= Aspect_Rep_Item
(ASN
);
1301 if Present
(Ritem
) then
1307 Next_Rep_Item
(ASN
);
1310 -- This is where we inherit delayed rep aspects from our parent. Note
1311 -- that if we fell out of the above loop with ASN non-empty, it means
1312 -- we hit an aspect for an entity other than E, and it must be the
1313 -- type from which we were derived.
1315 if May_Inherit_Delayed_Rep_Aspects
(E
) then
1316 Inherit_Delayed_Rep_Aspects
(ASN
);
1318 end Analyze_Aspects_At_Freeze_Point
;
1320 -----------------------------------
1321 -- Analyze_Aspect_Specifications --
1322 -----------------------------------
1324 procedure Analyze_Aspect_Specifications
(N
: Node_Id
; E
: Entity_Id
) is
1325 procedure Decorate
(Asp
: Node_Id
; Prag
: Node_Id
);
1326 -- Establish linkages between an aspect and its corresponding pragma
1328 procedure Insert_Pragma
1330 Is_Instance
: Boolean := False);
1331 -- Subsidiary to the analysis of aspects
1338 -- Initial_Condition
1347 -- Insert pragma Prag such that it mimics the placement of a source
1348 -- pragma of the same kind. Flag Is_Generic should be set when the
1349 -- context denotes a generic instance.
1355 procedure Decorate
(Asp
: Node_Id
; Prag
: Node_Id
) is
1357 Set_Aspect_Rep_Item
(Asp
, Prag
);
1358 Set_Corresponding_Aspect
(Prag
, Asp
);
1359 Set_From_Aspect_Specification
(Prag
);
1360 Set_Parent
(Prag
, Asp
);
1367 procedure Insert_Pragma
1369 Is_Instance
: Boolean := False)
1375 Inserted
: Boolean := False;
1378 -- When the aspect appears on an entry, package, protected unit,
1379 -- subprogram, or task unit body, insert the generated pragma at the
1380 -- top of the body declarations to emulate the behavior of a source
1383 -- package body Pack with Aspect is
1385 -- package body Pack is
1388 if Nkind_In
(N
, N_Entry_Body
,
1394 Decls
:= Declarations
(N
);
1398 Set_Declarations
(N
, Decls
);
1401 Prepend_To
(Decls
, Prag
);
1403 -- When the aspect is associated with a [generic] package declaration
1404 -- insert the generated pragma at the top of the visible declarations
1405 -- to emulate the behavior of a source pragma.
1407 -- package Pack with Aspect is
1412 elsif Nkind_In
(N
, N_Generic_Package_Declaration
,
1413 N_Package_Declaration
)
1415 Decls
:= Visible_Declarations
(Specification
(N
));
1419 Set_Visible_Declarations
(Specification
(N
), Decls
);
1422 -- The visible declarations of a generic instance have the
1423 -- following structure:
1425 -- <renamings of generic formals>
1426 -- <renamings of internally-generated spec and body>
1427 -- <first source declaration>
1429 -- Insert the pragma before the first source declaration by
1430 -- skipping the instance "header" to ensure proper visibility of
1434 Decl
:= First
(Decls
);
1435 while Present
(Decl
) loop
1436 if Comes_From_Source
(Decl
) then
1437 Insert_Before
(Decl
, Prag
);
1445 -- The pragma is placed after the instance "header"
1447 if not Inserted
then
1448 Append_To
(Decls
, Prag
);
1451 -- Otherwise this is not a generic instance
1454 Prepend_To
(Decls
, Prag
);
1457 -- When the aspect is associated with a protected unit declaration,
1458 -- insert the generated pragma at the top of the visible declarations
1459 -- the emulate the behavior of a source pragma.
1461 -- protected [type] Prot with Aspect is
1463 -- protected [type] Prot is
1466 elsif Nkind
(N
) = N_Protected_Type_Declaration
then
1467 Def
:= Protected_Definition
(N
);
1471 Make_Protected_Definition
(Sloc
(N
),
1472 Visible_Declarations
=> New_List
,
1473 End_Label
=> Empty
);
1475 Set_Protected_Definition
(N
, Def
);
1478 Decls
:= Visible_Declarations
(Def
);
1482 Set_Visible_Declarations
(Def
, Decls
);
1485 Prepend_To
(Decls
, Prag
);
1487 -- When the aspect is associated with a task unit declaration, insert
1488 -- insert the generated pragma at the top of the visible declarations
1489 -- the emulate the behavior of a source pragma.
1491 -- task [type] Prot with Aspect is
1493 -- task [type] Prot is
1496 elsif Nkind
(N
) = N_Task_Type_Declaration
then
1497 Def
:= Task_Definition
(N
);
1501 Make_Task_Definition
(Sloc
(N
),
1502 Visible_Declarations
=> New_List
,
1503 End_Label
=> Empty
);
1505 Set_Task_Definition
(N
, Def
);
1508 Decls
:= Visible_Declarations
(Def
);
1512 Set_Visible_Declarations
(Def
, Decls
);
1515 Prepend_To
(Decls
, Prag
);
1517 -- When the context is a library unit, the pragma is added to the
1518 -- Pragmas_After list.
1520 elsif Nkind
(Parent
(N
)) = N_Compilation_Unit
then
1521 Aux
:= Aux_Decls_Node
(Parent
(N
));
1523 if No
(Pragmas_After
(Aux
)) then
1524 Set_Pragmas_After
(Aux
, New_List
);
1527 Prepend
(Prag
, Pragmas_After
(Aux
));
1529 -- Default, the pragma is inserted after the context
1532 Insert_After
(N
, Prag
);
1542 L
: constant List_Id
:= Aspect_Specifications
(N
);
1544 Ins_Node
: Node_Id
:= N
;
1545 -- Insert pragmas/attribute definition clause after this node when no
1546 -- delayed analysis is required.
1548 -- Start of processing for Analyze_Aspect_Specifications
1551 -- The general processing involves building an attribute definition
1552 -- clause or a pragma node that corresponds to the aspect. Then in order
1553 -- to delay the evaluation of this aspect to the freeze point, we attach
1554 -- the corresponding pragma/attribute definition clause to the aspect
1555 -- specification node, which is then placed in the Rep Item chain. In
1556 -- this case we mark the entity by setting the flag Has_Delayed_Aspects
1557 -- and we evaluate the rep item at the freeze point. When the aspect
1558 -- doesn't have a corresponding pragma/attribute definition clause, then
1559 -- its analysis is simply delayed at the freeze point.
1561 -- Some special cases don't require delay analysis, thus the aspect is
1562 -- analyzed right now.
1564 -- Note that there is a special handling for Pre, Post, Test_Case,
1565 -- Contract_Cases aspects. In these cases, we do not have to worry
1566 -- about delay issues, since the pragmas themselves deal with delay
1567 -- of visibility for the expression analysis. Thus, we just insert
1568 -- the pragma after the node N.
1570 pragma Assert
(Present
(L
));
1572 -- Loop through aspects
1574 Aspect
:= First
(L
);
1575 Aspect_Loop
: while Present
(Aspect
) loop
1576 Analyze_One_Aspect
: declare
1577 Expr
: constant Node_Id
:= Expression
(Aspect
);
1578 Id
: constant Node_Id
:= Identifier
(Aspect
);
1579 Loc
: constant Source_Ptr
:= Sloc
(Aspect
);
1580 Nam
: constant Name_Id
:= Chars
(Id
);
1581 A_Id
: constant Aspect_Id
:= Get_Aspect_Id
(Nam
);
1584 Delay_Required
: Boolean;
1585 -- Set False if delay is not required
1587 Eloc
: Source_Ptr
:= No_Location
;
1588 -- Source location of expression, modified when we split PPC's. It
1589 -- is set below when Expr is present.
1591 procedure Analyze_Aspect_Convention
;
1592 -- Perform analysis of aspect Convention
1594 procedure Analyze_Aspect_Export_Import
;
1595 -- Perform analysis of aspects Export or Import
1597 procedure Analyze_Aspect_External_Link_Name
;
1598 -- Perform analysis of aspects External_Name or Link_Name
1600 procedure Analyze_Aspect_Implicit_Dereference
;
1601 -- Perform analysis of the Implicit_Dereference aspects
1603 procedure Make_Aitem_Pragma
1604 (Pragma_Argument_Associations
: List_Id
;
1605 Pragma_Name
: Name_Id
);
1606 -- This is a wrapper for Make_Pragma used for converting aspects
1607 -- to pragmas. It takes care of Sloc (set from Loc) and building
1608 -- the pragma identifier from the given name. In addition the
1609 -- flags Class_Present and Split_PPC are set from the aspect
1610 -- node, as well as Is_Ignored. This routine also sets the
1611 -- From_Aspect_Specification in the resulting pragma node to
1612 -- True, and sets Corresponding_Aspect to point to the aspect.
1613 -- The resulting pragma is assigned to Aitem.
1615 -------------------------------
1616 -- Analyze_Aspect_Convention --
1617 -------------------------------
1619 procedure Analyze_Aspect_Convention
is
1628 -- Obtain all interfacing aspects that apply to the related
1631 Get_Interfacing_Aspects
1632 (Iface_Asp
=> Aspect
,
1633 Conv_Asp
=> Dummy_1
,
1640 -- The related entity is subject to aspect Export or Import.
1641 -- Do not process Convention now because it must be analysed
1642 -- as part of Export or Import.
1644 if Present
(Expo
) or else Present
(Imp
) then
1647 -- Otherwise Convention appears by itself
1650 -- The aspect specifies a particular convention
1652 if Present
(Expr
) then
1653 Conv
:= New_Copy_Tree
(Expr
);
1655 -- Otherwise assume convention Ada
1658 Conv
:= Make_Identifier
(Loc
, Name_Ada
);
1662 -- pragma Convention (<Conv>, <E>);
1665 (Pragma_Name
=> Name_Convention
,
1666 Pragma_Argument_Associations
=> New_List
(
1667 Make_Pragma_Argument_Association
(Loc
,
1668 Expression
=> Conv
),
1669 Make_Pragma_Argument_Association
(Loc
,
1670 Expression
=> New_Occurrence_Of
(E
, Loc
))));
1672 Decorate
(Aspect
, Aitem
);
1673 Insert_Pragma
(Aitem
);
1675 end Analyze_Aspect_Convention
;
1677 ----------------------------------
1678 -- Analyze_Aspect_Export_Import --
1679 ----------------------------------
1681 procedure Analyze_Aspect_Export_Import
is
1689 -- Obtain all interfacing aspects that apply to the related
1692 Get_Interfacing_Aspects
1693 (Iface_Asp
=> Aspect
,
1694 Conv_Asp
=> Dummy_1
,
1701 -- The related entity cannot be subject to both aspects Export
1704 if Present
(Expo
) and then Present
(Imp
) then
1706 ("incompatible interfacing aspects given for &", E
);
1707 Error_Msg_Sloc
:= Sloc
(Expo
);
1708 Error_Msg_N
("\aspect `Export` #", E
);
1709 Error_Msg_Sloc
:= Sloc
(Imp
);
1710 Error_Msg_N
("\aspect `Import` #", E
);
1713 -- A variable is most likely modified from the outside. Take
1714 -- the optimistic approach to avoid spurious errors.
1716 if Ekind
(E
) = E_Variable
then
1717 Set_Never_Set_In_Source
(E
, False);
1720 -- Resolve the expression of an Import or Export here, and
1721 -- require it to be of type Boolean and static. This is not
1722 -- quite right, because in general this should be delayed,
1723 -- but that seems tricky for these, because normally Boolean
1724 -- aspects are replaced with pragmas at the freeze point in
1725 -- Make_Pragma_From_Boolean_Aspect.
1727 if not Present
(Expr
)
1728 or else Is_True
(Static_Boolean
(Expr
))
1730 if A_Id
= Aspect_Import
then
1731 Set_Has_Completion
(E
);
1732 Set_Is_Imported
(E
);
1734 -- An imported object cannot be explicitly initialized
1736 if Nkind
(N
) = N_Object_Declaration
1737 and then Present
(Expression
(N
))
1740 ("imported entities cannot be initialized "
1741 & "(RM B.1(24))", Expression
(N
));
1745 pragma Assert
(A_Id
= Aspect_Export
);
1746 Set_Is_Exported
(E
);
1749 -- Create the proper form of pragma Export or Import taking
1750 -- into account Conversion, External_Name, and Link_Name.
1752 Aitem
:= Build_Export_Import_Pragma
(Aspect
, E
);
1754 -- Otherwise the expression is either False or erroneous. There
1755 -- is no corresponding pragma.
1760 end Analyze_Aspect_Export_Import
;
1762 ---------------------------------------
1763 -- Analyze_Aspect_External_Link_Name --
1764 ---------------------------------------
1766 procedure Analyze_Aspect_External_Link_Name
is
1774 -- Obtain all interfacing aspects that apply to the related
1777 Get_Interfacing_Aspects
1778 (Iface_Asp
=> Aspect
,
1779 Conv_Asp
=> Dummy_1
,
1786 -- Ensure that aspect External_Name applies to aspect Export or
1789 if A_Id
= Aspect_External_Name
then
1790 if No
(Expo
) and then No
(Imp
) then
1792 ("aspect `External_Name` requires aspect `Import` or "
1793 & "`Export`", Aspect
);
1796 -- Otherwise ensure that aspect Link_Name applies to aspect
1797 -- Export or Import.
1800 pragma Assert
(A_Id
= Aspect_Link_Name
);
1801 if No
(Expo
) and then No
(Imp
) then
1803 ("aspect `Link_Name` requires aspect `Import` or "
1804 & "`Export`", Aspect
);
1807 end Analyze_Aspect_External_Link_Name
;
1809 -----------------------------------------
1810 -- Analyze_Aspect_Implicit_Dereference --
1811 -----------------------------------------
1813 procedure Analyze_Aspect_Implicit_Dereference
is
1815 Parent_Disc
: Entity_Id
;
1818 if not Is_Type
(E
) or else not Has_Discriminants
(E
) then
1820 ("aspect must apply to a type with discriminants", Expr
);
1822 elsif not Is_Entity_Name
(Expr
) then
1824 ("aspect must name a discriminant of current type", Expr
);
1827 -- Discriminant type be an anonymous access type or an
1828 -- anonymous access to subprogram.
1830 -- Missing synchronized types???
1832 Disc
:= First_Discriminant
(E
);
1833 while Present
(Disc
) loop
1834 if Chars
(Expr
) = Chars
(Disc
)
1835 and then Ekind_In
(Etype
(Disc
),
1836 E_Anonymous_Access_Subprogram_Type
,
1837 E_Anonymous_Access_Type
)
1839 Set_Has_Implicit_Dereference
(E
);
1840 Set_Has_Implicit_Dereference
(Disc
);
1844 Next_Discriminant
(Disc
);
1847 -- Error if no proper access discriminant
1850 Error_Msg_NE
("not an access discriminant of&", Expr
, E
);
1855 -- For a type extension, check whether parent has a
1856 -- reference discriminant, to verify that use is proper.
1858 if Is_Derived_Type
(E
)
1859 and then Has_Discriminants
(Etype
(E
))
1861 Parent_Disc
:= Get_Reference_Discriminant
(Etype
(E
));
1863 if Present
(Parent_Disc
)
1864 and then Corresponding_Discriminant
(Disc
) /= Parent_Disc
1867 ("reference discriminant does not match discriminant "
1868 & "of parent type", Expr
);
1871 end Analyze_Aspect_Implicit_Dereference
;
1873 -----------------------
1874 -- Make_Aitem_Pragma --
1875 -----------------------
1877 procedure Make_Aitem_Pragma
1878 (Pragma_Argument_Associations
: List_Id
;
1879 Pragma_Name
: Name_Id
)
1881 Args
: List_Id
:= Pragma_Argument_Associations
;
1884 -- We should never get here if aspect was disabled
1886 pragma Assert
(not Is_Disabled
(Aspect
));
1888 -- Certain aspects allow for an optional name or expression. Do
1889 -- not generate a pragma with empty argument association list.
1891 if No
(Args
) or else No
(Expression
(First
(Args
))) then
1899 Pragma_Argument_Associations
=> Args
,
1900 Pragma_Identifier
=>
1901 Make_Identifier
(Sloc
(Id
), Pragma_Name
),
1902 Class_Present
=> Class_Present
(Aspect
),
1903 Split_PPC
=> Split_PPC
(Aspect
));
1905 -- Set additional semantic fields
1907 if Is_Ignored
(Aspect
) then
1908 Set_Is_Ignored
(Aitem
);
1909 elsif Is_Checked
(Aspect
) then
1910 Set_Is_Checked
(Aitem
);
1913 Set_Corresponding_Aspect
(Aitem
, Aspect
);
1914 Set_From_Aspect_Specification
(Aitem
);
1915 end Make_Aitem_Pragma
;
1917 -- Start of processing for Analyze_One_Aspect
1920 -- Skip aspect if already analyzed, to avoid looping in some cases
1922 if Analyzed
(Aspect
) then
1926 -- Skip looking at aspect if it is totally disabled. Just mark it
1927 -- as such for later reference in the tree. This also sets the
1928 -- Is_Ignored and Is_Checked flags appropriately.
1930 Check_Applicable_Policy
(Aspect
);
1932 if Is_Disabled
(Aspect
) then
1936 -- Set the source location of expression, used in the case of
1937 -- a failed precondition/postcondition or invariant. Note that
1938 -- the source location of the expression is not usually the best
1939 -- choice here. For example, it gets located on the last AND
1940 -- keyword in a chain of boolean expressiond AND'ed together.
1941 -- It is best to put the message on the first character of the
1942 -- assertion, which is the effect of the First_Node call here.
1944 if Present
(Expr
) then
1945 Eloc
:= Sloc
(First_Node
(Expr
));
1948 -- Check restriction No_Implementation_Aspect_Specifications
1950 if Implementation_Defined_Aspect
(A_Id
) then
1952 (No_Implementation_Aspect_Specifications
, Aspect
);
1955 -- Check restriction No_Specification_Of_Aspect
1957 Check_Restriction_No_Specification_Of_Aspect
(Aspect
);
1959 -- Mark aspect analyzed (actual analysis is delayed till later)
1961 Set_Analyzed
(Aspect
);
1962 Set_Entity
(Aspect
, E
);
1964 -- Build the reference to E that will be used in the built pragmas
1966 Ent
:= New_Occurrence_Of
(E
, Sloc
(Id
));
1968 if A_Id
= Aspect_Attach_Handler
1969 or else A_Id
= Aspect_Interrupt_Handler
1972 -- Treat the specification as a reference to the protected
1973 -- operation, which might otherwise appear unreferenced and
1974 -- generate spurious warnings.
1976 Generate_Reference
(E
, Id
);
1979 -- Check for duplicate aspect. Note that the Comes_From_Source
1980 -- test allows duplicate Pre/Post's that we generate internally
1981 -- to escape being flagged here.
1983 if No_Duplicates_Allowed
(A_Id
) then
1985 while Anod
/= Aspect
loop
1986 if Comes_From_Source
(Aspect
)
1987 and then Same_Aspect
(A_Id
, Get_Aspect_Id
(Anod
))
1989 Error_Msg_Name_1
:= Nam
;
1990 Error_Msg_Sloc
:= Sloc
(Anod
);
1992 -- Case of same aspect specified twice
1994 if Class_Present
(Anod
) = Class_Present
(Aspect
) then
1995 if not Class_Present
(Anod
) then
1997 ("aspect% for & previously given#",
2001 ("aspect `%''Class` for & previously given#",
2011 -- Check some general restrictions on language defined aspects
2013 if not Implementation_Defined_Aspect
(A_Id
) then
2014 Error_Msg_Name_1
:= Nam
;
2016 -- Not allowed for renaming declarations. Examine the original
2017 -- node because a subprogram renaming may have been rewritten
2020 if Nkind
(Original_Node
(N
)) in N_Renaming_Declaration
then
2022 ("aspect % not allowed for renaming declaration",
2026 -- Not allowed for formal type declarations
2028 if Nkind
(N
) = N_Formal_Type_Declaration
then
2030 ("aspect % not allowed for formal type declaration",
2035 -- Copy expression for later processing by the procedures
2036 -- Check_Aspect_At_[Freeze_Point | End_Of_Declarations]
2038 Set_Entity
(Id
, New_Copy_Tree
(Expr
));
2040 -- Set Delay_Required as appropriate to aspect
2042 case Aspect_Delay
(A_Id
) is
2043 when Always_Delay
=>
2044 Delay_Required
:= True;
2047 Delay_Required
:= False;
2051 -- If expression has the form of an integer literal, then
2052 -- do not delay, since we know the value cannot change.
2053 -- This optimization catches most rep clause cases.
2055 -- For Boolean aspects, don't delay if no expression
2057 if A_Id
in Boolean_Aspects
and then No
(Expr
) then
2058 Delay_Required
:= False;
2060 -- For non-Boolean aspects, don't delay if integer literal,
2061 -- unless the aspect is Alignment, which affects the
2062 -- freezing of an initialized object.
2064 elsif A_Id
not in Boolean_Aspects
2065 and then A_Id
/= Aspect_Alignment
2066 and then Present
(Expr
)
2067 and then Nkind
(Expr
) = N_Integer_Literal
2069 Delay_Required
:= False;
2071 -- All other cases are delayed
2074 Delay_Required
:= True;
2075 Set_Has_Delayed_Rep_Aspects
(E
);
2079 -- Processing based on specific aspect
2082 when Aspect_Unimplemented
=>
2083 null; -- ??? temp for now
2085 -- No_Aspect should be impossible
2088 raise Program_Error
;
2090 -- Case 1: Aspects corresponding to attribute definition
2096 | Aspect_Component_Size
2097 | Aspect_Constant_Indexing
2098 | Aspect_Default_Iterator
2099 | Aspect_Dispatching_Domain
2100 | Aspect_External_Tag
2103 | Aspect_Iterator_Element
2104 | Aspect_Machine_Radix
2105 | Aspect_Object_Size
2108 | Aspect_Scalar_Storage_Order
2109 | Aspect_Secondary_Stack_Size
2110 | Aspect_Simple_Storage_Pool
2113 | Aspect_Storage_Pool
2114 | Aspect_Stream_Size
2116 | Aspect_Variable_Indexing
2119 -- Indexing aspects apply only to tagged type
2121 if (A_Id
= Aspect_Constant_Indexing
2123 A_Id
= Aspect_Variable_Indexing
)
2124 and then not (Is_Type
(E
)
2125 and then Is_Tagged_Type
(E
))
2128 ("indexing aspect can only apply to a tagged type",
2133 -- For the case of aspect Address, we don't consider that we
2134 -- know the entity is never set in the source, since it is
2135 -- is likely aliasing is occurring.
2137 -- Note: one might think that the analysis of the resulting
2138 -- attribute definition clause would take care of that, but
2139 -- that's not the case since it won't be from source.
2141 if A_Id
= Aspect_Address
then
2142 Set_Never_Set_In_Source
(E
, False);
2145 -- Correctness of the profile of a stream operation is
2146 -- verified at the freeze point, but we must detect the
2147 -- illegal specification of this aspect for a subtype now,
2148 -- to prevent malformed rep_item chains.
2150 if A_Id
= Aspect_Input
or else
2151 A_Id
= Aspect_Output
or else
2152 A_Id
= Aspect_Read
or else
2155 if not Is_First_Subtype
(E
) then
2157 ("local name must be a first subtype", Aspect
);
2160 -- If stream aspect applies to the class-wide type,
2161 -- the generated attribute definition applies to the
2162 -- class-wide type as well.
2164 elsif Class_Present
(Aspect
) then
2166 Make_Attribute_Reference
(Loc
,
2168 Attribute_Name
=> Name_Class
);
2172 -- Construct the attribute definition clause
2175 Make_Attribute_Definition_Clause
(Loc
,
2177 Chars
=> Chars
(Id
),
2178 Expression
=> Relocate_Node
(Expr
));
2180 -- If the address is specified, then we treat the entity as
2181 -- referenced, to avoid spurious warnings. This is analogous
2182 -- to what is done with an attribute definition clause, but
2183 -- here we don't want to generate a reference because this
2184 -- is the point of definition of the entity.
2186 if A_Id
= Aspect_Address
then
2190 -- Case 2: Aspects corresponding to pragmas
2192 -- Case 2a: Aspects corresponding to pragmas with two
2193 -- arguments, where the first argument is a local name
2194 -- referring to the entity, and the second argument is the
2195 -- aspect definition expression.
2197 -- Linker_Section/Suppress/Unsuppress
2199 when Aspect_Linker_Section
2204 (Pragma_Argument_Associations
=> New_List
(
2205 Make_Pragma_Argument_Association
(Loc
,
2206 Expression
=> New_Occurrence_Of
(E
, Loc
)),
2207 Make_Pragma_Argument_Association
(Sloc
(Expr
),
2208 Expression
=> Relocate_Node
(Expr
))),
2209 Pragma_Name
=> Chars
(Id
));
2213 -- Corresponds to pragma Implemented, construct the pragma
2215 when Aspect_Synchronization
=>
2217 (Pragma_Argument_Associations
=> New_List
(
2218 Make_Pragma_Argument_Association
(Loc
,
2219 Expression
=> New_Occurrence_Of
(E
, Loc
)),
2220 Make_Pragma_Argument_Association
(Sloc
(Expr
),
2221 Expression
=> Relocate_Node
(Expr
))),
2222 Pragma_Name
=> Name_Implemented
);
2226 when Aspect_Attach_Handler
=>
2228 (Pragma_Argument_Associations
=> New_List
(
2229 Make_Pragma_Argument_Association
(Sloc
(Ent
),
2231 Make_Pragma_Argument_Association
(Sloc
(Expr
),
2232 Expression
=> Relocate_Node
(Expr
))),
2233 Pragma_Name
=> Name_Attach_Handler
);
2235 -- We need to insert this pragma into the tree to get proper
2236 -- processing and to look valid from a placement viewpoint.
2238 Insert_Pragma
(Aitem
);
2241 -- Dynamic_Predicate, Predicate, Static_Predicate
2243 when Aspect_Dynamic_Predicate
2245 | Aspect_Static_Predicate
2247 -- These aspects apply only to subtypes
2249 if not Is_Type
(E
) then
2251 ("predicate can only be specified for a subtype",
2255 elsif Is_Incomplete_Type
(E
) then
2257 ("predicate cannot apply to incomplete view", Aspect
);
2261 -- Construct the pragma (always a pragma Predicate, with
2262 -- flags recording whether it is static/dynamic). We also
2263 -- set flags recording this in the type itself.
2266 (Pragma_Argument_Associations
=> New_List
(
2267 Make_Pragma_Argument_Association
(Sloc
(Ent
),
2269 Make_Pragma_Argument_Association
(Sloc
(Expr
),
2270 Expression
=> Relocate_Node
(Expr
))),
2271 Pragma_Name
=> Name_Predicate
);
2273 -- Mark type has predicates, and remember what kind of
2274 -- aspect lead to this predicate (we need this to access
2275 -- the right set of check policies later on).
2277 Set_Has_Predicates
(E
);
2279 if A_Id
= Aspect_Dynamic_Predicate
then
2280 Set_Has_Dynamic_Predicate_Aspect
(E
);
2282 -- If the entity has a dynamic predicate, any inherited
2283 -- static predicate becomes dynamic as well, and the
2284 -- predicate function includes the conjunction of both.
2286 Set_Has_Static_Predicate_Aspect
(E
, False);
2288 elsif A_Id
= Aspect_Static_Predicate
then
2289 Set_Has_Static_Predicate_Aspect
(E
);
2292 -- If the type is private, indicate that its completion
2293 -- has a freeze node, because that is the one that will
2294 -- be visible at freeze time.
2296 if Is_Private_Type
(E
) and then Present
(Full_View
(E
)) then
2297 Set_Has_Predicates
(Full_View
(E
));
2299 if A_Id
= Aspect_Dynamic_Predicate
then
2300 Set_Has_Dynamic_Predicate_Aspect
(Full_View
(E
));
2301 elsif A_Id
= Aspect_Static_Predicate
then
2302 Set_Has_Static_Predicate_Aspect
(Full_View
(E
));
2305 Set_Has_Delayed_Aspects
(Full_View
(E
));
2306 Ensure_Freeze_Node
(Full_View
(E
));
2309 -- Predicate_Failure
2311 when Aspect_Predicate_Failure
=>
2313 -- This aspect applies only to subtypes
2315 if not Is_Type
(E
) then
2317 ("predicate can only be specified for a subtype",
2321 elsif Is_Incomplete_Type
(E
) then
2323 ("predicate cannot apply to incomplete view", Aspect
);
2327 -- Construct the pragma
2330 (Pragma_Argument_Associations
=> New_List
(
2331 Make_Pragma_Argument_Association
(Sloc
(Ent
),
2333 Make_Pragma_Argument_Association
(Sloc
(Expr
),
2334 Expression
=> Relocate_Node
(Expr
))),
2335 Pragma_Name
=> Name_Predicate_Failure
);
2337 Set_Has_Predicates
(E
);
2339 -- If the type is private, indicate that its completion
2340 -- has a freeze node, because that is the one that will
2341 -- be visible at freeze time.
2343 if Is_Private_Type
(E
) and then Present
(Full_View
(E
)) then
2344 Set_Has_Predicates
(Full_View
(E
));
2345 Set_Has_Delayed_Aspects
(Full_View
(E
));
2346 Ensure_Freeze_Node
(Full_View
(E
));
2349 -- Case 2b: Aspects corresponding to pragmas with two
2350 -- arguments, where the second argument is a local name
2351 -- referring to the entity, and the first argument is the
2352 -- aspect definition expression.
2356 when Aspect_Convention
=>
2357 Analyze_Aspect_Convention
;
2360 -- External_Name, Link_Name
2362 when Aspect_External_Name
2365 Analyze_Aspect_External_Link_Name
;
2368 -- CPU, Interrupt_Priority, Priority
2370 -- These three aspects can be specified for a subprogram spec
2371 -- or body, in which case we analyze the expression and export
2372 -- the value of the aspect.
2374 -- Previously, we generated an equivalent pragma for bodies
2375 -- (note that the specs cannot contain these pragmas). The
2376 -- pragma was inserted ahead of local declarations, rather than
2377 -- after the body. This leads to a certain duplication between
2378 -- the processing performed for the aspect and the pragma, but
2379 -- given the straightforward handling required it is simpler
2380 -- to duplicate than to translate the aspect in the spec into
2381 -- a pragma in the declarative part of the body.
2384 | Aspect_Interrupt_Priority
2387 if Nkind_In
(N
, N_Subprogram_Body
,
2388 N_Subprogram_Declaration
)
2390 -- Analyze the aspect expression
2392 Analyze_And_Resolve
(Expr
, Standard_Integer
);
2394 -- Interrupt_Priority aspect not allowed for main
2395 -- subprograms. RM D.1 does not forbid this explicitly,
2396 -- but RM J.15.11(6/3) does not permit pragma
2397 -- Interrupt_Priority for subprograms.
2399 if A_Id
= Aspect_Interrupt_Priority
then
2401 ("Interrupt_Priority aspect cannot apply to "
2402 & "subprogram", Expr
);
2404 -- The expression must be static
2406 elsif not Is_OK_Static_Expression
(Expr
) then
2407 Flag_Non_Static_Expr
2408 ("aspect requires static expression!", Expr
);
2410 -- Check whether this is the main subprogram. Issue a
2411 -- warning only if it is obviously not a main program
2412 -- (when it has parameters or when the subprogram is
2413 -- within a package).
2415 elsif Present
(Parameter_Specifications
2416 (Specification
(N
)))
2417 or else not Is_Compilation_Unit
(Defining_Entity
(N
))
2419 -- See RM D.1(14/3) and D.16(12/3)
2422 ("aspect applied to subprogram other than the "
2423 & "main subprogram has no effect??", Expr
);
2425 -- Otherwise check in range and export the value
2427 -- For the CPU aspect
2429 elsif A_Id
= Aspect_CPU
then
2430 if Is_In_Range
(Expr
, RTE
(RE_CPU_Range
)) then
2432 -- Value is correct so we export the value to make
2433 -- it available at execution time.
2436 (Main_Unit
, UI_To_Int
(Expr_Value
(Expr
)));
2440 ("main subprogram CPU is out of range", Expr
);
2443 -- For the Priority aspect
2445 elsif A_Id
= Aspect_Priority
then
2446 if Is_In_Range
(Expr
, RTE
(RE_Priority
)) then
2448 -- Value is correct so we export the value to make
2449 -- it available at execution time.
2452 (Main_Unit
, UI_To_Int
(Expr_Value
(Expr
)));
2454 -- Ignore pragma if Relaxed_RM_Semantics to support
2455 -- other targets/non GNAT compilers.
2457 elsif not Relaxed_RM_Semantics
then
2459 ("main subprogram priority is out of range",
2464 -- Load an arbitrary entity from System.Tasking.Stages
2465 -- or System.Tasking.Restricted.Stages (depending on
2466 -- the supported profile) to make sure that one of these
2467 -- packages is implicitly with'ed, since we need to have
2468 -- the tasking run time active for the pragma Priority to
2469 -- have any effect. Previously we with'ed the package
2470 -- System.Tasking, but this package does not trigger the
2471 -- required initialization of the run-time library.
2474 Discard
: Entity_Id
;
2476 if Restricted_Profile
then
2477 Discard
:= RTE
(RE_Activate_Restricted_Tasks
);
2479 Discard
:= RTE
(RE_Activate_Tasks
);
2483 -- Handling for these aspects in subprograms is complete
2487 -- For task and protected types pass the aspect as an
2492 Make_Attribute_Definition_Clause
(Loc
,
2494 Chars
=> Chars
(Id
),
2495 Expression
=> Relocate_Node
(Expr
));
2500 when Aspect_Warnings
=>
2502 (Pragma_Argument_Associations
=> New_List
(
2503 Make_Pragma_Argument_Association
(Sloc
(Expr
),
2504 Expression
=> Relocate_Node
(Expr
)),
2505 Make_Pragma_Argument_Association
(Loc
,
2506 Expression
=> New_Occurrence_Of
(E
, Loc
))),
2507 Pragma_Name
=> Chars
(Id
));
2509 Decorate
(Aspect
, Aitem
);
2510 Insert_Pragma
(Aitem
);
2513 -- Case 2c: Aspects corresponding to pragmas with three
2516 -- Invariant aspects have a first argument that references the
2517 -- entity, a second argument that is the expression and a third
2518 -- argument that is an appropriate message.
2520 -- Invariant, Type_Invariant
2522 when Aspect_Invariant
2523 | Aspect_Type_Invariant
2525 -- Analysis of the pragma will verify placement legality:
2526 -- an invariant must apply to a private type, or appear in
2527 -- the private part of a spec and apply to a completion.
2530 (Pragma_Argument_Associations
=> New_List
(
2531 Make_Pragma_Argument_Association
(Sloc
(Ent
),
2533 Make_Pragma_Argument_Association
(Sloc
(Expr
),
2534 Expression
=> Relocate_Node
(Expr
))),
2535 Pragma_Name
=> Name_Invariant
);
2537 -- Add message unless exception messages are suppressed
2539 if not Opt
.Exception_Locations_Suppressed
then
2540 Append_To
(Pragma_Argument_Associations
(Aitem
),
2541 Make_Pragma_Argument_Association
(Eloc
,
2542 Chars
=> Name_Message
,
2544 Make_String_Literal
(Eloc
,
2545 Strval
=> "failed invariant from "
2546 & Build_Location_String
(Eloc
))));
2549 -- For Invariant case, insert immediately after the entity
2550 -- declaration. We do not have to worry about delay issues
2551 -- since the pragma processing takes care of this.
2553 Delay_Required
:= False;
2555 -- Case 2d : Aspects that correspond to a pragma with one
2560 -- Aspect Abstract_State introduces implicit declarations for
2561 -- all state abstraction entities it defines. To emulate this
2562 -- behavior, insert the pragma at the beginning of the visible
2563 -- declarations of the related package so that it is analyzed
2566 when Aspect_Abstract_State
=> Abstract_State
: declare
2567 Context
: Node_Id
:= N
;
2570 -- When aspect Abstract_State appears on a generic package,
2571 -- it is propageted to the package instance. The context in
2572 -- this case is the instance spec.
2574 if Nkind
(Context
) = N_Package_Instantiation
then
2575 Context
:= Instance_Spec
(Context
);
2578 if Nkind_In
(Context
, N_Generic_Package_Declaration
,
2579 N_Package_Declaration
)
2582 (Pragma_Argument_Associations
=> New_List
(
2583 Make_Pragma_Argument_Association
(Loc
,
2584 Expression
=> Relocate_Node
(Expr
))),
2585 Pragma_Name
=> Name_Abstract_State
);
2587 Decorate
(Aspect
, Aitem
);
2591 Is_Generic_Instance
(Defining_Entity
(Context
)));
2595 ("aspect & must apply to a package declaration",
2602 -- Aspect Async_Readers is never delayed because it is
2603 -- equivalent to a source pragma which appears after the
2604 -- related object declaration.
2606 when Aspect_Async_Readers
=>
2608 (Pragma_Argument_Associations
=> New_List
(
2609 Make_Pragma_Argument_Association
(Loc
,
2610 Expression
=> Relocate_Node
(Expr
))),
2611 Pragma_Name
=> Name_Async_Readers
);
2613 Decorate
(Aspect
, Aitem
);
2614 Insert_Pragma
(Aitem
);
2617 -- Aspect Async_Writers is never delayed because it is
2618 -- equivalent to a source pragma which appears after the
2619 -- related object declaration.
2621 when Aspect_Async_Writers
=>
2623 (Pragma_Argument_Associations
=> New_List
(
2624 Make_Pragma_Argument_Association
(Loc
,
2625 Expression
=> Relocate_Node
(Expr
))),
2626 Pragma_Name
=> Name_Async_Writers
);
2628 Decorate
(Aspect
, Aitem
);
2629 Insert_Pragma
(Aitem
);
2632 -- Aspect Constant_After_Elaboration is never delayed because
2633 -- it is equivalent to a source pragma which appears after the
2634 -- related object declaration.
2636 when Aspect_Constant_After_Elaboration
=>
2638 (Pragma_Argument_Associations
=> New_List
(
2639 Make_Pragma_Argument_Association
(Loc
,
2640 Expression
=> Relocate_Node
(Expr
))),
2642 Name_Constant_After_Elaboration
);
2644 Decorate
(Aspect
, Aitem
);
2645 Insert_Pragma
(Aitem
);
2648 -- Aspect Default_Internal_Condition is never delayed because
2649 -- it is equivalent to a source pragma which appears after the
2650 -- related private type. To deal with forward references, the
2651 -- generated pragma is stored in the rep chain of the related
2652 -- private type as types do not carry contracts. The pragma is
2653 -- wrapped inside of a procedure at the freeze point of the
2654 -- private type's full view.
2656 when Aspect_Default_Initial_Condition
=>
2658 (Pragma_Argument_Associations
=> New_List
(
2659 Make_Pragma_Argument_Association
(Loc
,
2660 Expression
=> Relocate_Node
(Expr
))),
2662 Name_Default_Initial_Condition
);
2664 Decorate
(Aspect
, Aitem
);
2665 Insert_Pragma
(Aitem
);
2668 -- Default_Storage_Pool
2670 when Aspect_Default_Storage_Pool
=>
2672 (Pragma_Argument_Associations
=> New_List
(
2673 Make_Pragma_Argument_Association
(Loc
,
2674 Expression
=> Relocate_Node
(Expr
))),
2676 Name_Default_Storage_Pool
);
2678 Decorate
(Aspect
, Aitem
);
2679 Insert_Pragma
(Aitem
);
2684 -- Aspect Depends is never delayed because it is equivalent to
2685 -- a source pragma which appears after the related subprogram.
2686 -- To deal with forward references, the generated pragma is
2687 -- stored in the contract of the related subprogram and later
2688 -- analyzed at the end of the declarative region. See routine
2689 -- Analyze_Depends_In_Decl_Part for details.
2691 when Aspect_Depends
=>
2693 (Pragma_Argument_Associations
=> New_List
(
2694 Make_Pragma_Argument_Association
(Loc
,
2695 Expression
=> Relocate_Node
(Expr
))),
2696 Pragma_Name
=> Name_Depends
);
2698 Decorate
(Aspect
, Aitem
);
2699 Insert_Pragma
(Aitem
);
2702 -- Aspect Effecitve_Reads is never delayed because it is
2703 -- equivalent to a source pragma which appears after the
2704 -- related object declaration.
2706 when Aspect_Effective_Reads
=>
2708 (Pragma_Argument_Associations
=> New_List
(
2709 Make_Pragma_Argument_Association
(Loc
,
2710 Expression
=> Relocate_Node
(Expr
))),
2711 Pragma_Name
=> Name_Effective_Reads
);
2713 Decorate
(Aspect
, Aitem
);
2714 Insert_Pragma
(Aitem
);
2717 -- Aspect Effective_Writes is never delayed because it is
2718 -- equivalent to a source pragma which appears after the
2719 -- related object declaration.
2721 when Aspect_Effective_Writes
=>
2723 (Pragma_Argument_Associations
=> New_List
(
2724 Make_Pragma_Argument_Association
(Loc
,
2725 Expression
=> Relocate_Node
(Expr
))),
2726 Pragma_Name
=> Name_Effective_Writes
);
2728 Decorate
(Aspect
, Aitem
);
2729 Insert_Pragma
(Aitem
);
2732 -- Aspect Extensions_Visible is never delayed because it is
2733 -- equivalent to a source pragma which appears after the
2734 -- related subprogram.
2736 when Aspect_Extensions_Visible
=>
2738 (Pragma_Argument_Associations
=> New_List
(
2739 Make_Pragma_Argument_Association
(Loc
,
2740 Expression
=> Relocate_Node
(Expr
))),
2741 Pragma_Name
=> Name_Extensions_Visible
);
2743 Decorate
(Aspect
, Aitem
);
2744 Insert_Pragma
(Aitem
);
2747 -- Aspect Ghost is never delayed because it is equivalent to a
2748 -- source pragma which appears at the top of [generic] package
2749 -- declarations or after an object, a [generic] subprogram, or
2750 -- a type declaration.
2752 when Aspect_Ghost
=>
2754 (Pragma_Argument_Associations
=> New_List
(
2755 Make_Pragma_Argument_Association
(Loc
,
2756 Expression
=> Relocate_Node
(Expr
))),
2757 Pragma_Name
=> Name_Ghost
);
2759 Decorate
(Aspect
, Aitem
);
2760 Insert_Pragma
(Aitem
);
2765 -- Aspect Global is never delayed because it is equivalent to
2766 -- a source pragma which appears after the related subprogram.
2767 -- To deal with forward references, the generated pragma is
2768 -- stored in the contract of the related subprogram and later
2769 -- analyzed at the end of the declarative region. See routine
2770 -- Analyze_Global_In_Decl_Part for details.
2772 when Aspect_Global
=>
2774 (Pragma_Argument_Associations
=> New_List
(
2775 Make_Pragma_Argument_Association
(Loc
,
2776 Expression
=> Relocate_Node
(Expr
))),
2777 Pragma_Name
=> Name_Global
);
2779 Decorate
(Aspect
, Aitem
);
2780 Insert_Pragma
(Aitem
);
2783 -- Initial_Condition
2785 -- Aspect Initial_Condition is never delayed because it is
2786 -- equivalent to a source pragma which appears after the
2787 -- related package. To deal with forward references, the
2788 -- generated pragma is stored in the contract of the related
2789 -- package and later analyzed at the end of the declarative
2790 -- region. See routine Analyze_Initial_Condition_In_Decl_Part
2793 when Aspect_Initial_Condition
=> Initial_Condition
: declare
2794 Context
: Node_Id
:= N
;
2797 -- When aspect Initial_Condition appears on a generic
2798 -- package, it is propageted to the package instance. The
2799 -- context in this case is the instance spec.
2801 if Nkind
(Context
) = N_Package_Instantiation
then
2802 Context
:= Instance_Spec
(Context
);
2805 if Nkind_In
(Context
, N_Generic_Package_Declaration
,
2806 N_Package_Declaration
)
2809 (Pragma_Argument_Associations
=> New_List
(
2810 Make_Pragma_Argument_Association
(Loc
,
2811 Expression
=> Relocate_Node
(Expr
))),
2813 Name_Initial_Condition
);
2815 Decorate
(Aspect
, Aitem
);
2819 Is_Generic_Instance
(Defining_Entity
(Context
)));
2821 -- Otherwise the context is illegal
2825 ("aspect & must apply to a package declaration",
2830 end Initial_Condition
;
2834 -- Aspect Initializes is never delayed because it is equivalent
2835 -- to a source pragma appearing after the related package. To
2836 -- deal with forward references, the generated pragma is stored
2837 -- in the contract of the related package and later analyzed at
2838 -- the end of the declarative region. For details, see routine
2839 -- Analyze_Initializes_In_Decl_Part.
2841 when Aspect_Initializes
=> Initializes
: declare
2842 Context
: Node_Id
:= N
;
2845 -- When aspect Initializes appears on a generic package,
2846 -- it is propageted to the package instance. The context
2847 -- in this case is the instance spec.
2849 if Nkind
(Context
) = N_Package_Instantiation
then
2850 Context
:= Instance_Spec
(Context
);
2853 if Nkind_In
(Context
, N_Generic_Package_Declaration
,
2854 N_Package_Declaration
)
2857 (Pragma_Argument_Associations
=> New_List
(
2858 Make_Pragma_Argument_Association
(Loc
,
2859 Expression
=> Relocate_Node
(Expr
))),
2860 Pragma_Name
=> Name_Initializes
);
2862 Decorate
(Aspect
, Aitem
);
2866 Is_Generic_Instance
(Defining_Entity
(Context
)));
2868 -- Otherwise the context is illegal
2872 ("aspect & must apply to a package declaration",
2881 when Aspect_Max_Queue_Length
=>
2883 (Pragma_Argument_Associations
=> New_List
(
2884 Make_Pragma_Argument_Association
(Loc
,
2885 Expression
=> Relocate_Node
(Expr
))),
2886 Pragma_Name
=> Name_Max_Queue_Length
);
2888 Decorate
(Aspect
, Aitem
);
2889 Insert_Pragma
(Aitem
);
2894 when Aspect_Obsolescent
=> declare
2902 Make_Pragma_Argument_Association
(Sloc
(Expr
),
2903 Expression
=> Relocate_Node
(Expr
)));
2907 (Pragma_Argument_Associations
=> Args
,
2908 Pragma_Name
=> Chars
(Id
));
2913 when Aspect_Part_Of
=>
2914 if Nkind_In
(N
, N_Object_Declaration
,
2915 N_Package_Instantiation
)
2916 or else Is_Single_Concurrent_Type_Declaration
(N
)
2919 (Pragma_Argument_Associations
=> New_List
(
2920 Make_Pragma_Argument_Association
(Loc
,
2921 Expression
=> Relocate_Node
(Expr
))),
2922 Pragma_Name
=> Name_Part_Of
);
2924 Decorate
(Aspect
, Aitem
);
2925 Insert_Pragma
(Aitem
);
2929 ("aspect & must apply to package instantiation, "
2930 & "object, single protected type or single task type",
2938 when Aspect_SPARK_Mode
=>
2940 (Pragma_Argument_Associations
=> New_List
(
2941 Make_Pragma_Argument_Association
(Loc
,
2942 Expression
=> Relocate_Node
(Expr
))),
2943 Pragma_Name
=> Name_SPARK_Mode
);
2945 Decorate
(Aspect
, Aitem
);
2946 Insert_Pragma
(Aitem
);
2951 -- Aspect Refined_Depends is never delayed because it is
2952 -- equivalent to a source pragma which appears in the
2953 -- declarations of the related subprogram body. To deal with
2954 -- forward references, the generated pragma is stored in the
2955 -- contract of the related subprogram body and later analyzed
2956 -- at the end of the declarative region. For details, see
2957 -- routine Analyze_Refined_Depends_In_Decl_Part.
2959 when Aspect_Refined_Depends
=>
2961 (Pragma_Argument_Associations
=> New_List
(
2962 Make_Pragma_Argument_Association
(Loc
,
2963 Expression
=> Relocate_Node
(Expr
))),
2964 Pragma_Name
=> Name_Refined_Depends
);
2966 Decorate
(Aspect
, Aitem
);
2967 Insert_Pragma
(Aitem
);
2972 -- Aspect Refined_Global is never delayed because it is
2973 -- equivalent to a source pragma which appears in the
2974 -- declarations of the related subprogram body. To deal with
2975 -- forward references, the generated pragma is stored in the
2976 -- contract of the related subprogram body and later analyzed
2977 -- at the end of the declarative region. For details, see
2978 -- routine Analyze_Refined_Global_In_Decl_Part.
2980 when Aspect_Refined_Global
=>
2982 (Pragma_Argument_Associations
=> New_List
(
2983 Make_Pragma_Argument_Association
(Loc
,
2984 Expression
=> Relocate_Node
(Expr
))),
2985 Pragma_Name
=> Name_Refined_Global
);
2987 Decorate
(Aspect
, Aitem
);
2988 Insert_Pragma
(Aitem
);
2993 when Aspect_Refined_Post
=>
2995 (Pragma_Argument_Associations
=> New_List
(
2996 Make_Pragma_Argument_Association
(Loc
,
2997 Expression
=> Relocate_Node
(Expr
))),
2998 Pragma_Name
=> Name_Refined_Post
);
3000 Decorate
(Aspect
, Aitem
);
3001 Insert_Pragma
(Aitem
);
3006 when Aspect_Refined_State
=>
3008 -- The corresponding pragma for Refined_State is inserted in
3009 -- the declarations of the related package body. This action
3010 -- synchronizes both the source and from-aspect versions of
3013 if Nkind
(N
) = N_Package_Body
then
3015 (Pragma_Argument_Associations
=> New_List
(
3016 Make_Pragma_Argument_Association
(Loc
,
3017 Expression
=> Relocate_Node
(Expr
))),
3018 Pragma_Name
=> Name_Refined_State
);
3020 Decorate
(Aspect
, Aitem
);
3021 Insert_Pragma
(Aitem
);
3023 -- Otherwise the context is illegal
3027 ("aspect & must apply to a package body", Aspect
, Id
);
3032 -- Relative_Deadline
3034 when Aspect_Relative_Deadline
=>
3036 (Pragma_Argument_Associations
=> New_List
(
3037 Make_Pragma_Argument_Association
(Loc
,
3038 Expression
=> Relocate_Node
(Expr
))),
3039 Pragma_Name
=> Name_Relative_Deadline
);
3041 -- If the aspect applies to a task, the corresponding pragma
3042 -- must appear within its declarations, not after.
3044 if Nkind
(N
) = N_Task_Type_Declaration
then
3050 if No
(Task_Definition
(N
)) then
3051 Set_Task_Definition
(N
,
3052 Make_Task_Definition
(Loc
,
3053 Visible_Declarations
=> New_List
,
3054 End_Label
=> Empty
));
3057 Def
:= Task_Definition
(N
);
3058 V
:= Visible_Declarations
(Def
);
3059 if not Is_Empty_List
(V
) then
3060 Insert_Before
(First
(V
), Aitem
);
3063 Set_Visible_Declarations
(Def
, New_List
(Aitem
));
3070 -- Aspect Volatile_Function is never delayed because it is
3071 -- equivalent to a source pragma which appears after the
3072 -- related subprogram.
3074 when Aspect_Volatile_Function
=>
3076 (Pragma_Argument_Associations
=> New_List
(
3077 Make_Pragma_Argument_Association
(Loc
,
3078 Expression
=> Relocate_Node
(Expr
))),
3079 Pragma_Name
=> Name_Volatile_Function
);
3081 Decorate
(Aspect
, Aitem
);
3082 Insert_Pragma
(Aitem
);
3085 -- Case 2e: Annotate aspect
3087 when Aspect_Annotate
=>
3094 -- The argument can be a single identifier
3096 if Nkind
(Expr
) = N_Identifier
then
3098 -- One level of parens is allowed
3100 if Paren_Count
(Expr
) > 1 then
3101 Error_Msg_F
("extra parentheses ignored", Expr
);
3104 Set_Paren_Count
(Expr
, 0);
3106 -- Add the single item to the list
3108 Args
:= New_List
(Expr
);
3110 -- Otherwise we must have an aggregate
3112 elsif Nkind
(Expr
) = N_Aggregate
then
3114 -- Must be positional
3116 if Present
(Component_Associations
(Expr
)) then
3118 ("purely positional aggregate required", Expr
);
3122 -- Must not be parenthesized
3124 if Paren_Count
(Expr
) /= 0 then
3125 Error_Msg_F
("extra parentheses ignored", Expr
);
3128 -- List of arguments is list of aggregate expressions
3130 Args
:= Expressions
(Expr
);
3132 -- Anything else is illegal
3135 Error_Msg_F
("wrong form for Annotate aspect", Expr
);
3139 -- Prepare pragma arguments
3142 Arg
:= First
(Args
);
3143 while Present
(Arg
) loop
3145 Make_Pragma_Argument_Association
(Sloc
(Arg
),
3146 Expression
=> Relocate_Node
(Arg
)));
3151 Make_Pragma_Argument_Association
(Sloc
(Ent
),
3152 Chars
=> Name_Entity
,
3153 Expression
=> Ent
));
3156 (Pragma_Argument_Associations
=> Pargs
,
3157 Pragma_Name
=> Name_Annotate
);
3160 -- Case 3 : Aspects that don't correspond to pragma/attribute
3161 -- definition clause.
3163 -- Case 3a: The aspects listed below don't correspond to
3164 -- pragmas/attributes but do require delayed analysis.
3166 -- Default_Value can only apply to a scalar type
3168 when Aspect_Default_Value
=>
3169 if not Is_Scalar_Type
(E
) then
3171 ("aspect Default_Value must apply to a scalar type", N
);
3176 -- Default_Component_Value can only apply to an array type
3177 -- with scalar components.
3179 when Aspect_Default_Component_Value
=>
3180 if not (Is_Array_Type
(E
)
3181 and then Is_Scalar_Type
(Component_Type
(E
)))
3184 ("aspect Default_Component_Value can only apply to an "
3185 & "array of scalar components", N
);
3190 -- Case 3b: The aspects listed below don't correspond to
3191 -- pragmas/attributes and don't need delayed analysis.
3193 -- Implicit_Dereference
3195 -- For Implicit_Dereference, External_Name and Link_Name, only
3196 -- the legality checks are done during the analysis, thus no
3197 -- delay is required.
3199 when Aspect_Implicit_Dereference
=>
3200 Analyze_Aspect_Implicit_Dereference
;
3205 when Aspect_Dimension
=>
3206 Analyze_Aspect_Dimension
(N
, Id
, Expr
);
3211 when Aspect_Dimension_System
=>
3212 Analyze_Aspect_Dimension_System
(N
, Id
, Expr
);
3215 -- Case 4: Aspects requiring special handling
3217 -- Pre/Post/Test_Case/Contract_Cases whose corresponding
3218 -- pragmas take care of the delay.
3222 -- Aspects Pre/Post generate Precondition/Postcondition pragmas
3223 -- with a first argument that is the expression, and a second
3224 -- argument that is an informative message if the test fails.
3225 -- This is inserted right after the declaration, to get the
3226 -- required pragma placement. The processing for the pragmas
3227 -- takes care of the required delay.
3229 when Pre_Post_Aspects
=> Pre_Post
: declare
3233 if A_Id
= Aspect_Pre
or else A_Id
= Aspect_Precondition
then
3234 Pname
:= Name_Precondition
;
3236 Pname
:= Name_Postcondition
;
3239 -- Check that the class-wide predicate cannot be applied to
3240 -- an operation of a synchronized type. AI12-0182 forbids
3241 -- these altogether, while earlier language semantics made
3242 -- them legal on tagged synchronized types.
3244 -- Other legality checks are performed when analyzing the
3245 -- contract of the operation.
3247 if Class_Present
(Aspect
)
3248 and then Is_Concurrent_Type
(Current_Scope
)
3249 and then Ekind_In
(E
, E_Entry
, E_Function
, E_Procedure
)
3251 Error_Msg_Name_1
:= Original_Aspect_Pragma_Name
(Aspect
);
3253 ("aspect % can only be specified for a primitive "
3254 & "operation of a tagged type", Aspect
);
3259 -- If the expressions is of the form A and then B, then
3260 -- we generate separate Pre/Post aspects for the separate
3261 -- clauses. Since we allow multiple pragmas, there is no
3262 -- problem in allowing multiple Pre/Post aspects internally.
3263 -- These should be treated in reverse order (B first and
3264 -- A second) since they are later inserted just after N in
3265 -- the order they are treated. This way, the pragma for A
3266 -- ends up preceding the pragma for B, which may have an
3267 -- importance for the error raised (either constraint error
3268 -- or precondition error).
3270 -- We do not do this for Pre'Class, since we have to put
3271 -- these conditions together in a complex OR expression.
3273 -- We do not do this in ASIS mode, as ASIS relies on the
3274 -- original node representing the complete expression, when
3275 -- retrieving it through the source aspect table.
3278 and then (Pname
= Name_Postcondition
3279 or else not Class_Present
(Aspect
))
3281 while Nkind
(Expr
) = N_And_Then
loop
3282 Insert_After
(Aspect
,
3283 Make_Aspect_Specification
(Sloc
(Left_Opnd
(Expr
)),
3284 Identifier
=> Identifier
(Aspect
),
3285 Expression
=> Relocate_Node
(Left_Opnd
(Expr
)),
3286 Class_Present
=> Class_Present
(Aspect
),
3287 Split_PPC
=> True));
3288 Rewrite
(Expr
, Relocate_Node
(Right_Opnd
(Expr
)));
3289 Eloc
:= Sloc
(Expr
);
3293 -- Build the precondition/postcondition pragma
3295 -- Add note about why we do NOT need Copy_Tree here???
3298 (Pragma_Argument_Associations
=> New_List
(
3299 Make_Pragma_Argument_Association
(Eloc
,
3300 Chars
=> Name_Check
,
3301 Expression
=> Relocate_Node
(Expr
))),
3302 Pragma_Name
=> Pname
);
3304 -- Add message unless exception messages are suppressed
3306 if not Opt
.Exception_Locations_Suppressed
then
3307 Append_To
(Pragma_Argument_Associations
(Aitem
),
3308 Make_Pragma_Argument_Association
(Eloc
,
3309 Chars
=> Name_Message
,
3311 Make_String_Literal
(Eloc
,
3313 & Get_Name_String
(Pname
)
3315 & Build_Location_String
(Eloc
))));
3318 Set_Is_Delayed_Aspect
(Aspect
);
3320 -- For Pre/Post cases, insert immediately after the entity
3321 -- declaration, since that is the required pragma placement.
3322 -- Note that for these aspects, we do not have to worry
3323 -- about delay issues, since the pragmas themselves deal
3324 -- with delay of visibility for the expression analysis.
3326 Insert_Pragma
(Aitem
);
3333 when Aspect_Test_Case
=> Test_Case
: declare
3335 Comp_Expr
: Node_Id
;
3336 Comp_Assn
: Node_Id
;
3342 if Nkind
(Parent
(N
)) = N_Compilation_Unit
then
3343 Error_Msg_Name_1
:= Nam
;
3344 Error_Msg_N
("incorrect placement of aspect `%`", E
);
3348 if Nkind
(Expr
) /= N_Aggregate
then
3349 Error_Msg_Name_1
:= Nam
;
3351 ("wrong syntax for aspect `%` for &", Id
, E
);
3355 -- Make pragma expressions refer to the original aspect
3356 -- expressions through the Original_Node link. This is used
3357 -- in semantic analysis for ASIS mode, so that the original
3358 -- expression also gets analyzed.
3360 Comp_Expr
:= First
(Expressions
(Expr
));
3361 while Present
(Comp_Expr
) loop
3362 New_Expr
:= Relocate_Node
(Comp_Expr
);
3364 Make_Pragma_Argument_Association
(Sloc
(Comp_Expr
),
3365 Expression
=> New_Expr
));
3369 Comp_Assn
:= First
(Component_Associations
(Expr
));
3370 while Present
(Comp_Assn
) loop
3371 if List_Length
(Choices
(Comp_Assn
)) /= 1
3373 Nkind
(First
(Choices
(Comp_Assn
))) /= N_Identifier
3375 Error_Msg_Name_1
:= Nam
;
3377 ("wrong syntax for aspect `%` for &", Id
, E
);
3382 Make_Pragma_Argument_Association
(Sloc
(Comp_Assn
),
3383 Chars
=> Chars
(First
(Choices
(Comp_Assn
))),
3385 Relocate_Node
(Expression
(Comp_Assn
))));
3389 -- Build the test-case pragma
3392 (Pragma_Argument_Associations
=> Args
,
3393 Pragma_Name
=> Nam
);
3398 when Aspect_Contract_Cases
=>
3400 (Pragma_Argument_Associations
=> New_List
(
3401 Make_Pragma_Argument_Association
(Loc
,
3402 Expression
=> Relocate_Node
(Expr
))),
3403 Pragma_Name
=> Nam
);
3405 Decorate
(Aspect
, Aitem
);
3406 Insert_Pragma
(Aitem
);
3409 -- Case 5: Special handling for aspects with an optional
3410 -- boolean argument.
3412 -- In the delayed case, the corresponding pragma cannot be
3413 -- generated yet because the evaluation of the boolean needs
3414 -- to be delayed till the freeze point.
3416 when Boolean_Aspects
3417 | Library_Unit_Aspects
3419 Set_Is_Boolean_Aspect
(Aspect
);
3421 -- Lock_Free aspect only apply to protected objects
3423 if A_Id
= Aspect_Lock_Free
then
3424 if Ekind
(E
) /= E_Protected_Type
then
3425 Error_Msg_Name_1
:= Nam
;
3427 ("aspect % only applies to a protected object",
3431 -- Set the Uses_Lock_Free flag to True if there is no
3432 -- expression or if the expression is True. The
3433 -- evaluation of this aspect should be delayed to the
3434 -- freeze point (why???)
3437 or else Is_True
(Static_Boolean
(Expr
))
3439 Set_Uses_Lock_Free
(E
);
3442 Record_Rep_Item
(E
, Aspect
);
3447 elsif A_Id
= Aspect_Export
or else A_Id
= Aspect_Import
then
3448 Analyze_Aspect_Export_Import
;
3450 -- Disable_Controlled
3452 elsif A_Id
= Aspect_Disable_Controlled
then
3453 if Ekind
(E
) /= E_Record_Type
3454 or else not Is_Controlled
(E
)
3457 ("aspect % requires controlled record type", Aspect
);
3461 -- If we're in a generic template, we don't want to try
3462 -- to disable controlled types, because typical usage is
3463 -- "Disable_Controlled => not <some_check>'Enabled", and
3464 -- the value of Enabled is not known until we see a
3465 -- particular instance. In such a context, we just need
3466 -- to preanalyze the expression for legality.
3468 if Expander_Active
then
3469 Analyze_And_Resolve
(Expr
, Standard_Boolean
);
3471 if not Present
(Expr
)
3472 or else Is_True
(Static_Boolean
(Expr
))
3474 Set_Disable_Controlled
(E
);
3477 elsif Serious_Errors_Detected
= 0 then
3478 Preanalyze_And_Resolve
(Expr
, Standard_Boolean
);
3484 -- Library unit aspects require special handling in the case
3485 -- of a package declaration, the pragma needs to be inserted
3486 -- in the list of declarations for the associated package.
3487 -- There is no issue of visibility delay for these aspects.
3489 if A_Id
in Library_Unit_Aspects
3491 Nkind_In
(N
, N_Package_Declaration
,
3492 N_Generic_Package_Declaration
)
3493 and then Nkind
(Parent
(N
)) /= N_Compilation_Unit
3495 -- Aspect is legal on a local instantiation of a library-
3496 -- level generic unit.
3498 and then not Is_Generic_Instance
(Defining_Entity
(N
))
3501 ("incorrect context for library unit aspect&", Id
);
3505 -- Cases where we do not delay, includes all cases where the
3506 -- expression is missing other than the above cases.
3508 if not Delay_Required
or else No
(Expr
) then
3510 -- Exclude aspects Export and Import because their pragma
3511 -- syntax does not map directly to a Boolean aspect.
3513 if A_Id
/= Aspect_Export
3514 and then A_Id
/= Aspect_Import
3517 (Pragma_Argument_Associations
=> New_List
(
3518 Make_Pragma_Argument_Association
(Sloc
(Ent
),
3519 Expression
=> Ent
)),
3520 Pragma_Name
=> Chars
(Id
));
3523 Delay_Required
:= False;
3525 -- In general cases, the corresponding pragma/attribute
3526 -- definition clause will be inserted later at the freezing
3527 -- point, and we do not need to build it now.
3535 -- This is special because for access types we need to generate
3536 -- an attribute definition clause. This also works for single
3537 -- task declarations, but it does not work for task type
3538 -- declarations, because we have the case where the expression
3539 -- references a discriminant of the task type. That can't use
3540 -- an attribute definition clause because we would not have
3541 -- visibility on the discriminant. For that case we must
3542 -- generate a pragma in the task definition.
3544 when Aspect_Storage_Size
=>
3548 if Ekind
(E
) = E_Task_Type
then
3550 Decl
: constant Node_Id
:= Declaration_Node
(E
);
3553 pragma Assert
(Nkind
(Decl
) = N_Task_Type_Declaration
);
3555 -- If no task definition, create one
3557 if No
(Task_Definition
(Decl
)) then
3558 Set_Task_Definition
(Decl
,
3559 Make_Task_Definition
(Loc
,
3560 Visible_Declarations
=> Empty_List
,
3561 End_Label
=> Empty
));
3564 -- Create a pragma and put it at the start of the task
3565 -- definition for the task type declaration.
3568 (Pragma_Argument_Associations
=> New_List
(
3569 Make_Pragma_Argument_Association
(Loc
,
3570 Expression
=> Relocate_Node
(Expr
))),
3571 Pragma_Name
=> Name_Storage_Size
);
3575 Visible_Declarations
(Task_Definition
(Decl
)));
3579 -- All other cases, generate attribute definition
3583 Make_Attribute_Definition_Clause
(Loc
,
3585 Chars
=> Chars
(Id
),
3586 Expression
=> Relocate_Node
(Expr
));
3590 -- Attach the corresponding pragma/attribute definition clause to
3591 -- the aspect specification node.
3593 if Present
(Aitem
) then
3594 Set_From_Aspect_Specification
(Aitem
);
3597 -- In the context of a compilation unit, we directly put the
3598 -- pragma in the Pragmas_After list of the N_Compilation_Unit_Aux
3599 -- node (no delay is required here) except for aspects on a
3600 -- subprogram body (see below) and a generic package, for which we
3601 -- need to introduce the pragma before building the generic copy
3602 -- (see sem_ch12), and for package instantiations, where the
3603 -- library unit pragmas are better handled early.
3605 if Nkind
(Parent
(N
)) = N_Compilation_Unit
3606 and then (Present
(Aitem
) or else Is_Boolean_Aspect
(Aspect
))
3609 Aux
: constant Node_Id
:= Aux_Decls_Node
(Parent
(N
));
3612 pragma Assert
(Nkind
(Aux
) = N_Compilation_Unit_Aux
);
3614 -- For a Boolean aspect, create the corresponding pragma if
3615 -- no expression or if the value is True.
3617 if Is_Boolean_Aspect
(Aspect
) and then No
(Aitem
) then
3618 if Is_True
(Static_Boolean
(Expr
)) then
3620 (Pragma_Argument_Associations
=> New_List
(
3621 Make_Pragma_Argument_Association
(Sloc
(Ent
),
3622 Expression
=> Ent
)),
3623 Pragma_Name
=> Chars
(Id
));
3625 Set_From_Aspect_Specification
(Aitem
, True);
3626 Set_Corresponding_Aspect
(Aitem
, Aspect
);
3633 -- If the aspect is on a subprogram body (relevant aspect
3634 -- is Inline), add the pragma in front of the declarations.
3636 if Nkind
(N
) = N_Subprogram_Body
then
3637 if No
(Declarations
(N
)) then
3638 Set_Declarations
(N
, New_List
);
3641 Prepend
(Aitem
, Declarations
(N
));
3643 elsif Nkind
(N
) = N_Generic_Package_Declaration
then
3644 if No
(Visible_Declarations
(Specification
(N
))) then
3645 Set_Visible_Declarations
(Specification
(N
), New_List
);
3649 Visible_Declarations
(Specification
(N
)));
3651 elsif Nkind
(N
) = N_Package_Instantiation
then
3653 Spec
: constant Node_Id
:=
3654 Specification
(Instance_Spec
(N
));
3656 if No
(Visible_Declarations
(Spec
)) then
3657 Set_Visible_Declarations
(Spec
, New_List
);
3660 Prepend
(Aitem
, Visible_Declarations
(Spec
));
3664 if No
(Pragmas_After
(Aux
)) then
3665 Set_Pragmas_After
(Aux
, New_List
);
3668 Append
(Aitem
, Pragmas_After
(Aux
));
3675 -- The evaluation of the aspect is delayed to the freezing point.
3676 -- The pragma or attribute clause if there is one is then attached
3677 -- to the aspect specification which is put in the rep item list.
3679 if Delay_Required
then
3680 if Present
(Aitem
) then
3681 Set_Is_Delayed_Aspect
(Aitem
);
3682 Set_Aspect_Rep_Item
(Aspect
, Aitem
);
3683 Set_Parent
(Aitem
, Aspect
);
3686 Set_Is_Delayed_Aspect
(Aspect
);
3688 -- In the case of Default_Value, link the aspect to base type
3689 -- as well, even though it appears on a first subtype. This is
3690 -- mandated by the semantics of the aspect. Do not establish
3691 -- the link when processing the base type itself as this leads
3692 -- to a rep item circularity. Verify that we are dealing with
3693 -- a scalar type to prevent cascaded errors.
3695 if A_Id
= Aspect_Default_Value
3696 and then Is_Scalar_Type
(E
)
3697 and then Base_Type
(E
) /= E
3699 Set_Has_Delayed_Aspects
(Base_Type
(E
));
3700 Record_Rep_Item
(Base_Type
(E
), Aspect
);
3703 Set_Has_Delayed_Aspects
(E
);
3704 Record_Rep_Item
(E
, Aspect
);
3706 -- When delay is not required and the context is a package or a
3707 -- subprogram body, insert the pragma in the body declarations.
3709 elsif Nkind_In
(N
, N_Package_Body
, N_Subprogram_Body
) then
3710 if No
(Declarations
(N
)) then
3711 Set_Declarations
(N
, New_List
);
3714 -- The pragma is added before source declarations
3716 Prepend_To
(Declarations
(N
), Aitem
);
3718 -- When delay is not required and the context is not a compilation
3719 -- unit, we simply insert the pragma/attribute definition clause
3722 elsif Present
(Aitem
) then
3723 Insert_After
(Ins_Node
, Aitem
);
3726 end Analyze_One_Aspect
;
3730 end loop Aspect_Loop
;
3732 if Has_Delayed_Aspects
(E
) then
3733 Ensure_Freeze_Node
(E
);
3735 end Analyze_Aspect_Specifications
;
3737 ---------------------------------------------------
3738 -- Analyze_Aspect_Specifications_On_Body_Or_Stub --
3739 ---------------------------------------------------
3741 procedure Analyze_Aspect_Specifications_On_Body_Or_Stub
(N
: Node_Id
) is
3742 Body_Id
: constant Entity_Id
:= Defining_Entity
(N
);
3744 procedure Diagnose_Misplaced_Aspects
(Spec_Id
: Entity_Id
);
3745 -- Body [stub] N has aspects, but they are not properly placed. Emit an
3746 -- error message depending on the aspects involved. Spec_Id denotes the
3747 -- entity of the corresponding spec.
3749 --------------------------------
3750 -- Diagnose_Misplaced_Aspects --
3751 --------------------------------
3753 procedure Diagnose_Misplaced_Aspects
(Spec_Id
: Entity_Id
) is
3754 procedure Misplaced_Aspect_Error
3757 -- Emit an error message concerning misplaced aspect Asp. Ref_Nam is
3758 -- the name of the refined version of the aspect.
3760 ----------------------------
3761 -- Misplaced_Aspect_Error --
3762 ----------------------------
3764 procedure Misplaced_Aspect_Error
3768 Asp_Nam
: constant Name_Id
:= Chars
(Identifier
(Asp
));
3769 Asp_Id
: constant Aspect_Id
:= Get_Aspect_Id
(Asp_Nam
);
3772 -- The corresponding spec already contains the aspect in question
3773 -- and the one appearing on the body must be the refined form:
3775 -- procedure P with Global ...;
3776 -- procedure P with Global ... is ... end P;
3780 if Has_Aspect
(Spec_Id
, Asp_Id
) then
3781 Error_Msg_Name_1
:= Asp_Nam
;
3783 -- Subunits cannot carry aspects that apply to a subprogram
3786 if Nkind
(Parent
(N
)) = N_Subunit
then
3787 Error_Msg_N
("aspect % cannot apply to a subunit", Asp
);
3789 -- Otherwise suggest the refined form
3792 Error_Msg_Name_2
:= Ref_Nam
;
3793 Error_Msg_N
("aspect % should be %", Asp
);
3796 -- Otherwise the aspect must appear on the spec, not on the body
3799 -- procedure P with Global ... is ... end P;
3803 ("aspect specification must appear on initial declaration",
3806 end Misplaced_Aspect_Error
;
3813 -- Start of processing for Diagnose_Misplaced_Aspects
3816 -- Iterate over the aspect specifications and emit specific errors
3817 -- where applicable.
3819 Asp
:= First
(Aspect_Specifications
(N
));
3820 while Present
(Asp
) loop
3821 Asp_Nam
:= Chars
(Identifier
(Asp
));
3823 -- Do not emit errors on aspects that can appear on a subprogram
3824 -- body. This scenario occurs when the aspect specification list
3825 -- contains both misplaced and properly placed aspects.
3827 if Aspect_On_Body_Or_Stub_OK
(Get_Aspect_Id
(Asp_Nam
)) then
3830 -- Special diagnostics for SPARK aspects
3832 elsif Asp_Nam
= Name_Depends
then
3833 Misplaced_Aspect_Error
(Asp
, Name_Refined_Depends
);
3835 elsif Asp_Nam
= Name_Global
then
3836 Misplaced_Aspect_Error
(Asp
, Name_Refined_Global
);
3838 elsif Asp_Nam
= Name_Post
then
3839 Misplaced_Aspect_Error
(Asp
, Name_Refined_Post
);
3841 -- Otherwise a language-defined aspect is misplaced
3845 ("aspect specification must appear on initial declaration",
3851 end Diagnose_Misplaced_Aspects
;
3855 Spec_Id
: constant Entity_Id
:= Unique_Defining_Entity
(N
);
3857 -- Start of processing for Analyze_Aspects_On_Body_Or_Stub
3860 -- Language-defined aspects cannot be associated with a subprogram body
3861 -- [stub] if the subprogram has a spec. Certain implementation defined
3862 -- aspects are allowed to break this rule (for all applicable cases, see
3863 -- table Aspects.Aspect_On_Body_Or_Stub_OK).
3865 if Spec_Id
/= Body_Id
and then not Aspects_On_Body_Or_Stub_OK
(N
) then
3866 Diagnose_Misplaced_Aspects
(Spec_Id
);
3868 Analyze_Aspect_Specifications
(N
, Body_Id
);
3870 end Analyze_Aspect_Specifications_On_Body_Or_Stub
;
3872 -----------------------
3873 -- Analyze_At_Clause --
3874 -----------------------
3876 -- An at clause is replaced by the corresponding Address attribute
3877 -- definition clause that is the preferred approach in Ada 95.
3879 procedure Analyze_At_Clause
(N
: Node_Id
) is
3880 CS
: constant Boolean := Comes_From_Source
(N
);
3883 -- This is an obsolescent feature
3885 Check_Restriction
(No_Obsolescent_Features
, N
);
3887 if Warn_On_Obsolescent_Feature
then
3889 ("?j?at clause is an obsolescent feature (RM J.7(2))", N
);
3891 ("\?j?use address attribute definition clause instead", N
);
3894 -- Rewrite as address clause
3897 Make_Attribute_Definition_Clause
(Sloc
(N
),
3898 Name
=> Identifier
(N
),
3899 Chars
=> Name_Address
,
3900 Expression
=> Expression
(N
)));
3902 -- We preserve Comes_From_Source, since logically the clause still comes
3903 -- from the source program even though it is changed in form.
3905 Set_Comes_From_Source
(N
, CS
);
3907 -- Analyze rewritten clause
3909 Analyze_Attribute_Definition_Clause
(N
);
3910 end Analyze_At_Clause
;
3912 -----------------------------------------
3913 -- Analyze_Attribute_Definition_Clause --
3914 -----------------------------------------
3916 procedure Analyze_Attribute_Definition_Clause
(N
: Node_Id
) is
3917 Loc
: constant Source_Ptr
:= Sloc
(N
);
3918 Nam
: constant Node_Id
:= Name
(N
);
3919 Attr
: constant Name_Id
:= Chars
(N
);
3920 Expr
: constant Node_Id
:= Expression
(N
);
3921 Id
: constant Attribute_Id
:= Get_Attribute_Id
(Attr
);
3924 -- The entity of Nam after it is analyzed. In the case of an incomplete
3925 -- type, this is the underlying type.
3928 -- The underlying entity to which the attribute applies. Generally this
3929 -- is the Underlying_Type of Ent, except in the case where the clause
3930 -- applies to the full view of an incomplete or private type, in which
3931 -- case U_Ent is just a copy of Ent.
3933 FOnly
: Boolean := False;
3934 -- Reset to True for subtype specific attribute (Alignment, Size)
3935 -- and for stream attributes, i.e. those cases where in the call to
3936 -- Rep_Item_Too_Late, FOnly is set True so that only the freezing rules
3937 -- are checked. Note that the case of stream attributes is not clear
3938 -- from the RM, but see AI95-00137. Also, the RM seems to disallow
3939 -- Storage_Size for derived task types, but that is also clearly
3942 procedure Analyze_Stream_TSS_Definition
(TSS_Nam
: TSS_Name_Type
);
3943 -- Common processing for 'Read, 'Write, 'Input and 'Output attribute
3944 -- definition clauses.
3946 function Duplicate_Clause
return Boolean;
3947 -- This routine checks if the aspect for U_Ent being given by attribute
3948 -- definition clause N is for an aspect that has already been specified,
3949 -- and if so gives an error message. If there is a duplicate, True is
3950 -- returned, otherwise if there is no error, False is returned.
3952 procedure Check_Indexing_Functions
;
3953 -- Check that the function in Constant_Indexing or Variable_Indexing
3954 -- attribute has the proper type structure. If the name is overloaded,
3955 -- check that some interpretation is legal.
3957 procedure Check_Iterator_Functions
;
3958 -- Check that there is a single function in Default_Iterator attribute
3959 -- has the proper type structure.
3961 function Check_Primitive_Function
(Subp
: Entity_Id
) return Boolean;
3962 -- Common legality check for the previous two
3964 -----------------------------------
3965 -- Analyze_Stream_TSS_Definition --
3966 -----------------------------------
3968 procedure Analyze_Stream_TSS_Definition
(TSS_Nam
: TSS_Name_Type
) is
3969 Subp
: Entity_Id
:= Empty
;
3974 Is_Read
: constant Boolean := (TSS_Nam
= TSS_Stream_Read
);
3975 -- True for Read attribute, False for other attributes
3977 function Has_Good_Profile
3979 Report
: Boolean := False) return Boolean;
3980 -- Return true if the entity is a subprogram with an appropriate
3981 -- profile for the attribute being defined. If result is False and
3982 -- Report is True, function emits appropriate error.
3984 ----------------------
3985 -- Has_Good_Profile --
3986 ----------------------
3988 function Has_Good_Profile
3990 Report
: Boolean := False) return Boolean
3992 Expected_Ekind
: constant array (Boolean) of Entity_Kind
:=
3993 (False => E_Procedure
, True => E_Function
);
3994 Is_Function
: constant Boolean := (TSS_Nam
= TSS_Stream_Input
);
3999 if Ekind
(Subp
) /= Expected_Ekind
(Is_Function
) then
4003 F
:= First_Formal
(Subp
);
4006 or else Ekind
(Etype
(F
)) /= E_Anonymous_Access_Type
4007 or else Designated_Type
(Etype
(F
)) /=
4008 Class_Wide_Type
(RTE
(RE_Root_Stream_Type
))
4013 if not Is_Function
then
4017 Expected_Mode
: constant array (Boolean) of Entity_Kind
:=
4018 (False => E_In_Parameter
,
4019 True => E_Out_Parameter
);
4021 if Parameter_Mode
(F
) /= Expected_Mode
(Is_Read
) then
4028 -- If the attribute specification comes from an aspect
4029 -- specification for a class-wide stream, the parameter must be
4030 -- a class-wide type of the entity to which the aspect applies.
4032 if From_Aspect_Specification
(N
)
4033 and then Class_Present
(Parent
(N
))
4034 and then Is_Class_Wide_Type
(Typ
)
4040 Typ
:= Etype
(Subp
);
4043 -- Verify that the prefix of the attribute and the local name for
4044 -- the type of the formal match, or one is the class-wide of the
4045 -- other, in the case of a class-wide stream operation.
4047 if Base_Type
(Typ
) = Base_Type
(Ent
)
4048 or else (Is_Class_Wide_Type
(Typ
)
4049 and then Typ
= Class_Wide_Type
(Base_Type
(Ent
)))
4050 or else (Is_Class_Wide_Type
(Ent
)
4051 and then Ent
= Class_Wide_Type
(Base_Type
(Typ
)))
4058 if Present
(Next_Formal
(F
)) then
4061 elsif not Is_Scalar_Type
(Typ
)
4062 and then not Is_First_Subtype
(Typ
)
4063 and then not Is_Class_Wide_Type
(Typ
)
4065 if Report
and not Is_First_Subtype
(Typ
) then
4067 ("subtype of formal in stream operation must be a first "
4068 & "subtype", Parameter_Type
(Parent
(F
)));
4076 end Has_Good_Profile
;
4078 -- Start of processing for Analyze_Stream_TSS_Definition
4083 if not Is_Type
(U_Ent
) then
4084 Error_Msg_N
("local name must be a subtype", Nam
);
4087 elsif not Is_First_Subtype
(U_Ent
) then
4088 Error_Msg_N
("local name must be a first subtype", Nam
);
4092 Pnam
:= TSS
(Base_Type
(U_Ent
), TSS_Nam
);
4094 -- If Pnam is present, it can be either inherited from an ancestor
4095 -- type (in which case it is legal to redefine it for this type), or
4096 -- be a previous definition of the attribute for the same type (in
4097 -- which case it is illegal).
4099 -- In the first case, it will have been analyzed already, and we
4100 -- can check that its profile does not match the expected profile
4101 -- for a stream attribute of U_Ent. In the second case, either Pnam
4102 -- has been analyzed (and has the expected profile), or it has not
4103 -- been analyzed yet (case of a type that has not been frozen yet
4104 -- and for which the stream attribute has been set using Set_TSS).
4107 and then (No
(First_Entity
(Pnam
)) or else Has_Good_Profile
(Pnam
))
4109 Error_Msg_Sloc
:= Sloc
(Pnam
);
4110 Error_Msg_Name_1
:= Attr
;
4111 Error_Msg_N
("% attribute already defined #", Nam
);
4117 if Is_Entity_Name
(Expr
) then
4118 if not Is_Overloaded
(Expr
) then
4119 if Has_Good_Profile
(Entity
(Expr
), Report
=> True) then
4120 Subp
:= Entity
(Expr
);
4124 Get_First_Interp
(Expr
, I
, It
);
4125 while Present
(It
.Nam
) loop
4126 if Has_Good_Profile
(It
.Nam
) then
4131 Get_Next_Interp
(I
, It
);
4136 if Present
(Subp
) then
4137 if Is_Abstract_Subprogram
(Subp
) then
4138 Error_Msg_N
("stream subprogram must not be abstract", Expr
);
4141 -- A stream subprogram for an interface type must be a null
4142 -- procedure (RM 13.13.2 (38/3)). Note that the class-wide type
4143 -- of an interface is not an interface type (3.9.4 (6.b/2)).
4145 elsif Is_Interface
(U_Ent
)
4146 and then not Is_Class_Wide_Type
(U_Ent
)
4147 and then not Inside_A_Generic
4149 (Ekind
(Subp
) = E_Function
4153 (Unit_Declaration_Node
(Ultimate_Alias
(Subp
)))))
4156 ("stream subprogram for interface type must be null "
4157 & "procedure", Expr
);
4160 Set_Entity
(Expr
, Subp
);
4161 Set_Etype
(Expr
, Etype
(Subp
));
4163 New_Stream_Subprogram
(N
, U_Ent
, Subp
, TSS_Nam
);
4166 Error_Msg_Name_1
:= Attr
;
4167 Error_Msg_N
("incorrect expression for% attribute", Expr
);
4169 end Analyze_Stream_TSS_Definition
;
4171 ------------------------------
4172 -- Check_Indexing_Functions --
4173 ------------------------------
4175 procedure Check_Indexing_Functions
is
4176 Indexing_Found
: Boolean := False;
4178 procedure Check_Inherited_Indexing
;
4179 -- For a derived type, check that no indexing aspect is specified
4180 -- for the type if it is also inherited
4182 procedure Check_One_Function
(Subp
: Entity_Id
);
4183 -- Check one possible interpretation. Sets Indexing_Found True if a
4184 -- legal indexing function is found.
4186 procedure Illegal_Indexing
(Msg
: String);
4187 -- Diagnose illegal indexing function if not overloaded. In the
4188 -- overloaded case indicate that no legal interpretation exists.
4190 ------------------------------
4191 -- Check_Inherited_Indexing --
4192 ------------------------------
4194 procedure Check_Inherited_Indexing
is
4195 Inherited
: Node_Id
;
4198 if Attr
= Name_Constant_Indexing
then
4200 Find_Aspect
(Etype
(Ent
), Aspect_Constant_Indexing
);
4201 else pragma Assert
(Attr
= Name_Variable_Indexing
);
4203 Find_Aspect
(Etype
(Ent
), Aspect_Variable_Indexing
);
4206 if Present
(Inherited
) then
4207 if Debug_Flag_Dot_XX
then
4210 -- OK if current attribute_definition_clause is expansion of
4211 -- inherited aspect.
4213 elsif Aspect_Rep_Item
(Inherited
) = N
then
4216 -- Indicate the operation that must be overridden, rather than
4217 -- redefining the indexing aspect.
4221 ("indexing function already inherited from parent type");
4223 ("!override & instead",
4224 N
, Entity
(Expression
(Inherited
)));
4227 end Check_Inherited_Indexing
;
4229 ------------------------
4230 -- Check_One_Function --
4231 ------------------------
4233 procedure Check_One_Function
(Subp
: Entity_Id
) is
4234 Default_Element
: Node_Id
;
4235 Ret_Type
: constant Entity_Id
:= Etype
(Subp
);
4238 if not Is_Overloadable
(Subp
) then
4239 Illegal_Indexing
("illegal indexing function for type&");
4242 elsif Scope
(Subp
) /= Scope
(Ent
) then
4243 if Nkind
(Expr
) = N_Expanded_Name
then
4245 -- Indexing function can't be declared elsewhere
4248 ("indexing function must be declared in scope of type&");
4253 elsif No
(First_Formal
(Subp
)) then
4255 ("Indexing requires a function that applies to type&");
4258 elsif No
(Next_Formal
(First_Formal
(Subp
))) then
4260 ("indexing function must have at least two parameters");
4263 elsif Is_Derived_Type
(Ent
) then
4264 Check_Inherited_Indexing
;
4267 if not Check_Primitive_Function
(Subp
) then
4269 ("Indexing aspect requires a function that applies to type&");
4273 -- If partial declaration exists, verify that it is not tagged.
4275 if Ekind
(Current_Scope
) = E_Package
4276 and then Has_Private_Declaration
(Ent
)
4277 and then From_Aspect_Specification
(N
)
4279 List_Containing
(Parent
(Ent
)) =
4280 Private_Declarations
4281 (Specification
(Unit_Declaration_Node
(Current_Scope
)))
4282 and then Nkind
(N
) = N_Attribute_Definition_Clause
4289 First
(Visible_Declarations
4291 (Unit_Declaration_Node
(Current_Scope
))));
4293 while Present
(Decl
) loop
4294 if Nkind
(Decl
) = N_Private_Type_Declaration
4295 and then Ent
= Full_View
(Defining_Identifier
(Decl
))
4296 and then Tagged_Present
(Decl
)
4297 and then No
(Aspect_Specifications
(Decl
))
4300 ("Indexing aspect cannot be specified on full view "
4301 & "if partial view is tagged");
4310 -- An indexing function must return either the default element of
4311 -- the container, or a reference type. For variable indexing it
4312 -- must be the latter.
4315 Find_Value_Of_Aspect
4316 (Etype
(First_Formal
(Subp
)), Aspect_Iterator_Element
);
4318 if Present
(Default_Element
) then
4319 Analyze
(Default_Element
);
4321 if Is_Entity_Name
(Default_Element
)
4322 and then not Covers
(Entity
(Default_Element
), Ret_Type
)
4326 ("wrong return type for indexing function");
4331 -- For variable_indexing the return type must be a reference type
4333 if Attr
= Name_Variable_Indexing
then
4334 if not Has_Implicit_Dereference
(Ret_Type
) then
4336 ("variable indexing must return a reference type");
4339 elsif Is_Access_Constant
4340 (Etype
(First_Discriminant
(Ret_Type
)))
4343 ("variable indexing must return an access to variable");
4348 if Has_Implicit_Dereference
(Ret_Type
)
4350 Is_Access_Constant
(Etype
(First_Discriminant
(Ret_Type
)))
4353 ("constant indexing must return an access to constant");
4356 elsif Is_Access_Type
(Etype
(First_Formal
(Subp
)))
4357 and then not Is_Access_Constant
(Etype
(First_Formal
(Subp
)))
4360 ("constant indexing must apply to an access to constant");
4365 -- All checks succeeded.
4367 Indexing_Found
:= True;
4368 end Check_One_Function
;
4370 -----------------------
4371 -- Illegal_Indexing --
4372 -----------------------
4374 procedure Illegal_Indexing
(Msg
: String) is
4376 Error_Msg_NE
(Msg
, N
, Ent
);
4377 end Illegal_Indexing
;
4379 -- Start of processing for Check_Indexing_Functions
4383 Check_Inherited_Indexing
;
4388 if not Is_Overloaded
(Expr
) then
4389 Check_One_Function
(Entity
(Expr
));
4397 Indexing_Found
:= False;
4398 Get_First_Interp
(Expr
, I
, It
);
4399 while Present
(It
.Nam
) loop
4401 -- Note that analysis will have added the interpretation
4402 -- that corresponds to the dereference. We only check the
4403 -- subprogram itself. Ignore homonyms that may come from
4404 -- derived types in the context.
4406 if Is_Overloadable
(It
.Nam
)
4407 and then Comes_From_Source
(It
.Nam
)
4409 Check_One_Function
(It
.Nam
);
4412 Get_Next_Interp
(I
, It
);
4417 if not Indexing_Found
and then not Error_Posted
(N
) then
4419 ("aspect Indexing requires a local function that applies to "
4420 & "type&", Expr
, Ent
);
4422 end Check_Indexing_Functions
;
4424 ------------------------------
4425 -- Check_Iterator_Functions --
4426 ------------------------------
4428 procedure Check_Iterator_Functions
is
4429 function Valid_Default_Iterator
(Subp
: Entity_Id
) return Boolean;
4430 -- Check one possible interpretation for validity
4432 ----------------------------
4433 -- Valid_Default_Iterator --
4434 ----------------------------
4436 function Valid_Default_Iterator
(Subp
: Entity_Id
) return Boolean is
4437 Root_T
: constant Entity_Id
:= Root_Type
(Etype
(Etype
(Subp
)));
4441 if not Check_Primitive_Function
(Subp
) then
4444 -- The return type must be derived from a type in an instance
4445 -- of Iterator.Interfaces, and thus its root type must have a
4448 elsif Chars
(Root_T
) /= Name_Forward_Iterator
4449 and then Chars
(Root_T
) /= Name_Reversible_Iterator
4454 Formal
:= First_Formal
(Subp
);
4457 -- False if any subsequent formal has no default expression
4459 Formal
:= Next_Formal
(Formal
);
4460 while Present
(Formal
) loop
4461 if No
(Expression
(Parent
(Formal
))) then
4465 Next_Formal
(Formal
);
4468 -- True if all subsequent formals have default expressions
4471 end Valid_Default_Iterator
;
4473 -- Start of processing for Check_Iterator_Functions
4478 if not Is_Entity_Name
(Expr
) then
4479 Error_Msg_N
("aspect Iterator must be a function name", Expr
);
4482 if not Is_Overloaded
(Expr
) then
4483 if not Check_Primitive_Function
(Entity
(Expr
)) then
4485 ("aspect Indexing requires a function that applies to type&",
4486 Entity
(Expr
), Ent
);
4489 -- Flag the default_iterator as well as the denoted function.
4491 if not Valid_Default_Iterator
(Entity
(Expr
)) then
4492 Error_Msg_N
("improper function for default iterator!", Expr
);
4497 Default
: Entity_Id
:= Empty
;
4502 Get_First_Interp
(Expr
, I
, It
);
4503 while Present
(It
.Nam
) loop
4504 if not Check_Primitive_Function
(It
.Nam
)
4505 or else not Valid_Default_Iterator
(It
.Nam
)
4509 elsif Present
(Default
) then
4511 -- An explicit one should override an implicit one
4513 if Comes_From_Source
(Default
) =
4514 Comes_From_Source
(It
.Nam
)
4516 Error_Msg_N
("default iterator must be unique", Expr
);
4517 Error_Msg_Sloc
:= Sloc
(Default
);
4518 Error_Msg_N
("\\possible interpretation#", Expr
);
4519 Error_Msg_Sloc
:= Sloc
(It
.Nam
);
4520 Error_Msg_N
("\\possible interpretation#", Expr
);
4522 elsif Comes_From_Source
(It
.Nam
) then
4529 Get_Next_Interp
(I
, It
);
4532 if Present
(Default
) then
4533 Set_Entity
(Expr
, Default
);
4534 Set_Is_Overloaded
(Expr
, False);
4537 ("no interpretation is a valid default iterator!", Expr
);
4541 end Check_Iterator_Functions
;
4543 -------------------------------
4544 -- Check_Primitive_Function --
4545 -------------------------------
4547 function Check_Primitive_Function
(Subp
: Entity_Id
) return Boolean is
4551 if Ekind
(Subp
) /= E_Function
then
4555 if No
(First_Formal
(Subp
)) then
4558 Ctrl
:= Etype
(First_Formal
(Subp
));
4561 -- To be a primitive operation subprogram has to be in same scope.
4563 if Scope
(Ctrl
) /= Scope
(Subp
) then
4567 -- Type of formal may be the class-wide type, an access to such,
4568 -- or an incomplete view.
4571 or else Ctrl
= Class_Wide_Type
(Ent
)
4573 (Ekind
(Ctrl
) = E_Anonymous_Access_Type
4574 and then (Designated_Type
(Ctrl
) = Ent
4576 Designated_Type
(Ctrl
) = Class_Wide_Type
(Ent
)))
4578 (Ekind
(Ctrl
) = E_Incomplete_Type
4579 and then Full_View
(Ctrl
) = Ent
)
4587 end Check_Primitive_Function
;
4589 ----------------------
4590 -- Duplicate_Clause --
4591 ----------------------
4593 function Duplicate_Clause
return Boolean is
4597 -- Nothing to do if this attribute definition clause comes from
4598 -- an aspect specification, since we could not be duplicating an
4599 -- explicit clause, and we dealt with the case of duplicated aspects
4600 -- in Analyze_Aspect_Specifications.
4602 if From_Aspect_Specification
(N
) then
4606 -- Otherwise current clause may duplicate previous clause, or a
4607 -- previously given pragma or aspect specification for the same
4610 A
:= Get_Rep_Item
(U_Ent
, Chars
(N
), Check_Parents
=> False);
4613 Error_Msg_Name_1
:= Chars
(N
);
4614 Error_Msg_Sloc
:= Sloc
(A
);
4616 Error_Msg_NE
("aspect% for & previously given#", N
, U_Ent
);
4621 end Duplicate_Clause
;
4623 -- Start of processing for Analyze_Attribute_Definition_Clause
4626 -- The following code is a defense against recursion. Not clear that
4627 -- this can happen legitimately, but perhaps some error situations can
4628 -- cause it, and we did see this recursion during testing.
4630 if Analyzed
(N
) then
4633 Set_Analyzed
(N
, True);
4636 Check_Restriction_No_Use_Of_Attribute
(N
);
4638 -- Ignore some selected attributes in CodePeer mode since they are not
4639 -- relevant in this context.
4641 if CodePeer_Mode
then
4644 -- Ignore Component_Size in CodePeer mode, to avoid changing the
4645 -- internal representation of types by implicitly packing them.
4647 when Attribute_Component_Size
=>
4648 Rewrite
(N
, Make_Null_Statement
(Sloc
(N
)));
4656 -- Process Ignore_Rep_Clauses option
4658 if Ignore_Rep_Clauses
then
4661 -- The following should be ignored. They do not affect legality
4662 -- and may be target dependent. The basic idea of -gnatI is to
4663 -- ignore any rep clauses that may be target dependent but do not
4664 -- affect legality (except possibly to be rejected because they
4665 -- are incompatible with the compilation target).
4667 when Attribute_Alignment
4668 | Attribute_Bit_Order
4669 | Attribute_Component_Size
4670 | Attribute_Default_Scalar_Storage_Order
4671 | Attribute_Machine_Radix
4672 | Attribute_Object_Size
4673 | Attribute_Scalar_Storage_Order
4676 | Attribute_Stream_Size
4677 | Attribute_Value_Size
4679 Kill_Rep_Clause
(N
);
4682 -- The following should not be ignored, because in the first place
4683 -- they are reasonably portable, and should not cause problems
4684 -- in compiling code from another target, and also they do affect
4685 -- legality, e.g. failing to provide a stream attribute for a type
4686 -- may make a program illegal.
4688 when Attribute_External_Tag
4692 | Attribute_Simple_Storage_Pool
4693 | Attribute_Storage_Pool
4694 | Attribute_Storage_Size
4699 -- We do not do anything here with address clauses, they will be
4700 -- removed by Freeze later on, but for now, it works better to
4701 -- keep them in the tree.
4703 when Attribute_Address
=>
4706 -- Other cases are errors ("attribute& cannot be set with
4707 -- definition clause"), which will be caught below.
4715 Ent
:= Entity
(Nam
);
4717 if Rep_Item_Too_Early
(Ent
, N
) then
4721 -- Rep clause applies to full view of incomplete type or private type if
4722 -- we have one (if not, this is a premature use of the type). However,
4723 -- certain semantic checks need to be done on the specified entity (i.e.
4724 -- the private view), so we save it in Ent.
4726 if Is_Private_Type
(Ent
)
4727 and then Is_Derived_Type
(Ent
)
4728 and then not Is_Tagged_Type
(Ent
)
4729 and then No
(Full_View
(Ent
))
4731 -- If this is a private type whose completion is a derivation from
4732 -- another private type, there is no full view, and the attribute
4733 -- belongs to the type itself, not its underlying parent.
4737 elsif Ekind
(Ent
) = E_Incomplete_Type
then
4739 -- The attribute applies to the full view, set the entity of the
4740 -- attribute definition accordingly.
4742 Ent
:= Underlying_Type
(Ent
);
4744 Set_Entity
(Nam
, Ent
);
4747 U_Ent
:= Underlying_Type
(Ent
);
4750 -- Avoid cascaded error
4752 if Etype
(Nam
) = Any_Type
then
4755 -- Must be declared in current scope or in case of an aspect
4756 -- specification, must be visible in current scope.
4758 elsif Scope
(Ent
) /= Current_Scope
4760 not (From_Aspect_Specification
(N
)
4761 and then Scope_Within_Or_Same
(Current_Scope
, Scope
(Ent
)))
4763 Error_Msg_N
("entity must be declared in this scope", Nam
);
4766 -- Must not be a source renaming (we do have some cases where the
4767 -- expander generates a renaming, and those cases are OK, in such
4768 -- cases any attribute applies to the renamed object as well).
4770 elsif Is_Object
(Ent
)
4771 and then Present
(Renamed_Object
(Ent
))
4773 -- Case of renamed object from source, this is an error
4775 if Comes_From_Source
(Renamed_Object
(Ent
)) then
4776 Get_Name_String
(Chars
(N
));
4777 Error_Msg_Strlen
:= Name_Len
;
4778 Error_Msg_String
(1 .. Name_Len
) := Name_Buffer
(1 .. Name_Len
);
4780 ("~ clause not allowed for a renaming declaration "
4781 & "(RM 13.1(6))", Nam
);
4784 -- For the case of a compiler generated renaming, the attribute
4785 -- definition clause applies to the renamed object created by the
4786 -- expander. The easiest general way to handle this is to create a
4787 -- copy of the attribute definition clause for this object.
4789 elsif Is_Entity_Name
(Renamed_Object
(Ent
)) then
4791 Make_Attribute_Definition_Clause
(Loc
,
4793 New_Occurrence_Of
(Entity
(Renamed_Object
(Ent
)), Loc
),
4795 Expression
=> Duplicate_Subexpr
(Expression
(N
))));
4797 -- If the renamed object is not an entity, it must be a dereference
4798 -- of an unconstrained function call, and we must introduce a new
4799 -- declaration to capture the expression. This is needed in the case
4800 -- of 'Alignment, where the original declaration must be rewritten.
4804 (Nkind
(Renamed_Object
(Ent
)) = N_Explicit_Dereference
);
4808 -- If no underlying entity, use entity itself, applies to some
4809 -- previously detected error cases ???
4811 elsif No
(U_Ent
) then
4814 -- Cannot specify for a subtype (exception Object/Value_Size)
4816 elsif Is_Type
(U_Ent
)
4817 and then not Is_First_Subtype
(U_Ent
)
4818 and then Id
/= Attribute_Object_Size
4819 and then Id
/= Attribute_Value_Size
4820 and then not From_At_Mod
(N
)
4822 Error_Msg_N
("cannot specify attribute for subtype", Nam
);
4826 Set_Entity
(N
, U_Ent
);
4828 -- Switch on particular attribute
4836 -- Address attribute definition clause
4838 when Attribute_Address
=> Address
: begin
4840 -- A little error check, catch for X'Address use X'Address;
4842 if Nkind
(Nam
) = N_Identifier
4843 and then Nkind
(Expr
) = N_Attribute_Reference
4844 and then Attribute_Name
(Expr
) = Name_Address
4845 and then Nkind
(Prefix
(Expr
)) = N_Identifier
4846 and then Chars
(Nam
) = Chars
(Prefix
(Expr
))
4849 ("address for & is self-referencing", Prefix
(Expr
), Ent
);
4853 -- Not that special case, carry on with analysis of expression
4855 Analyze_And_Resolve
(Expr
, RTE
(RE_Address
));
4857 -- Even when ignoring rep clauses we need to indicate that the
4858 -- entity has an address clause and thus it is legal to declare
4859 -- it imported. Freeze will get rid of the address clause later.
4860 -- Also call Set_Address_Taken to indicate that an address clause
4861 -- was present, even if we are about to remove it.
4863 if Ignore_Rep_Clauses
then
4864 Set_Address_Taken
(U_Ent
);
4866 if Ekind_In
(U_Ent
, E_Variable
, E_Constant
) then
4867 Record_Rep_Item
(U_Ent
, N
);
4873 if Duplicate_Clause
then
4876 -- Case of address clause for subprogram
4878 elsif Is_Subprogram
(U_Ent
) then
4879 if Has_Homonym
(U_Ent
) then
4881 ("address clause cannot be given for overloaded "
4882 & "subprogram", Nam
);
4886 -- For subprograms, all address clauses are permitted, and we
4887 -- mark the subprogram as having a deferred freeze so that Gigi
4888 -- will not elaborate it too soon.
4890 -- Above needs more comments, what is too soon about???
4892 Set_Has_Delayed_Freeze
(U_Ent
);
4894 -- Case of address clause for entry
4896 elsif Ekind
(U_Ent
) = E_Entry
then
4897 if Nkind
(Parent
(N
)) = N_Task_Body
then
4899 ("entry address must be specified in task spec", Nam
);
4903 -- For entries, we require a constant address
4905 Check_Constant_Address_Clause
(Expr
, U_Ent
);
4907 -- Special checks for task types
4909 if Is_Task_Type
(Scope
(U_Ent
))
4910 and then Comes_From_Source
(Scope
(U_Ent
))
4913 ("??entry address declared for entry in task type", N
);
4915 ("\??only one task can be declared of this type", N
);
4918 -- Entry address clauses are obsolescent
4920 Check_Restriction
(No_Obsolescent_Features
, N
);
4922 if Warn_On_Obsolescent_Feature
then
4924 ("?j?attaching interrupt to task entry is an obsolescent "
4925 & "feature (RM J.7.1)", N
);
4927 ("\?j?use interrupt procedure instead", N
);
4930 -- Case of an address clause for a class-wide object, which is
4931 -- considered erroneous.
4933 elsif Is_Class_Wide_Type
(Etype
(U_Ent
)) then
4935 ("??class-wide object & must not be overlaid", Nam
, U_Ent
);
4937 ("\??Program_Error will be raised at run time", Nam
);
4938 Insert_Action
(Declaration_Node
(U_Ent
),
4939 Make_Raise_Program_Error
(Loc
,
4940 Reason
=> PE_Overlaid_Controlled_Object
));
4943 -- Case of address clause for an object
4945 elsif Ekind_In
(U_Ent
, E_Constant
, E_Variable
) then
4947 Expr
: constant Node_Id
:= Expression
(N
);
4952 -- Exported variables cannot have an address clause, because
4953 -- this cancels the effect of the pragma Export.
4955 if Is_Exported
(U_Ent
) then
4957 ("cannot export object with address clause", Nam
);
4961 Find_Overlaid_Entity
(N
, O_Ent
, Off
);
4963 if Present
(O_Ent
) then
4965 -- If the object overlays a constant object, mark it so
4967 if Is_Constant_Object
(O_Ent
) then
4968 Set_Overlays_Constant
(U_Ent
);
4971 -- If the address clause is of the form:
4973 -- for X'Address use Y'Address;
4977 -- C : constant Address := Y'Address;
4979 -- for X'Address use C;
4981 -- then we make an entry in the table to check the size
4982 -- and alignment of the overlaying variable. But we defer
4983 -- this check till after code generation to take full
4984 -- advantage of the annotation done by the back end.
4986 -- If the entity has a generic type, the check will be
4987 -- performed in the instance if the actual type justifies
4988 -- it, and we do not insert the clause in the table to
4989 -- prevent spurious warnings.
4991 -- Note: we used to test Comes_From_Source and only give
4992 -- this warning for source entities, but we have removed
4993 -- this test. It really seems bogus to generate overlays
4994 -- that would trigger this warning in generated code.
4995 -- Furthermore, by removing the test, we handle the
4996 -- aspect case properly.
4998 if Is_Object
(O_Ent
)
4999 and then not Is_Generic_Type
(Etype
(U_Ent
))
5000 and then Address_Clause_Overlay_Warnings
5002 Address_Clause_Checks
.Append
5003 ((N
, U_Ent
, No_Uint
, O_Ent
, Off
));
5006 -- If this is not an overlay, mark a variable as being
5007 -- volatile to prevent unwanted optimizations. It's a
5008 -- conservative interpretation of RM 13.3(19) for the
5009 -- cases where the compiler cannot detect potential
5010 -- aliasing issues easily and it also covers the case
5011 -- of an absolute address where the volatile aspect is
5012 -- kind of implicit.
5014 if Ekind
(U_Ent
) = E_Variable
then
5015 Set_Treat_As_Volatile
(U_Ent
);
5018 -- Make an entry in the table for an absolute address as
5019 -- above to check that the value is compatible with the
5020 -- alignment of the object.
5023 Addr
: constant Node_Id
:= Address_Value
(Expr
);
5025 if Compile_Time_Known_Value
(Addr
)
5026 and then Address_Clause_Overlay_Warnings
5028 Address_Clause_Checks
.Append
5029 ((N
, U_Ent
, Expr_Value
(Addr
), Empty
, False));
5034 -- Issue an unconditional warning for a constant overlaying
5035 -- a variable. For the reverse case, we will issue it only
5036 -- if the variable is modified.
5038 if Ekind
(U_Ent
) = E_Constant
5039 and then Present
(O_Ent
)
5040 and then not Overlays_Constant
(U_Ent
)
5041 and then Address_Clause_Overlay_Warnings
5043 Error_Msg_N
("??constant overlays a variable", Expr
);
5045 -- Imported variables can have an address clause, but then
5046 -- the import is pretty meaningless except to suppress
5047 -- initializations, so we do not need such variables to
5048 -- be statically allocated (and in fact it causes trouble
5049 -- if the address clause is a local value).
5051 elsif Is_Imported
(U_Ent
) then
5052 Set_Is_Statically_Allocated
(U_Ent
, False);
5055 -- We mark a possible modification of a variable with an
5056 -- address clause, since it is likely aliasing is occurring.
5058 Note_Possible_Modification
(Nam
, Sure
=> False);
5060 -- Legality checks on the address clause for initialized
5061 -- objects is deferred until the freeze point, because
5062 -- a subsequent pragma might indicate that the object
5063 -- is imported and thus not initialized. Also, the address
5064 -- clause might involve entities that have yet to be
5067 Set_Has_Delayed_Freeze
(U_Ent
);
5069 -- If an initialization call has been generated for this
5070 -- object, it needs to be deferred to after the freeze node
5071 -- we have just now added, otherwise GIGI will see a
5072 -- reference to the variable (as actual to the IP call)
5073 -- before its definition.
5076 Init_Call
: constant Node_Id
:=
5077 Remove_Init_Call
(U_Ent
, N
);
5080 if Present
(Init_Call
) then
5081 Append_Freeze_Action
(U_Ent
, Init_Call
);
5083 -- Reset Initialization_Statements pointer so that
5084 -- if there is a pragma Import further down, it can
5085 -- clear any default initialization.
5087 Set_Initialization_Statements
(U_Ent
, Init_Call
);
5091 -- Entity has delayed freeze, so we will generate an
5092 -- alignment check at the freeze point unless suppressed.
5094 if not Range_Checks_Suppressed
(U_Ent
)
5095 and then not Alignment_Checks_Suppressed
(U_Ent
)
5097 Set_Check_Address_Alignment
(N
);
5100 -- Kill the size check code, since we are not allocating
5101 -- the variable, it is somewhere else.
5103 Kill_Size_Check_Code
(U_Ent
);
5106 -- Not a valid entity for an address clause
5109 Error_Msg_N
("address cannot be given for &", Nam
);
5117 -- Alignment attribute definition clause
5119 when Attribute_Alignment
=> Alignment
: declare
5120 Align
: constant Uint
:= Get_Alignment_Value
(Expr
);
5121 Max_Align
: constant Uint
:= UI_From_Int
(Maximum_Alignment
);
5126 if not Is_Type
(U_Ent
)
5127 and then Ekind
(U_Ent
) /= E_Variable
5128 and then Ekind
(U_Ent
) /= E_Constant
5130 Error_Msg_N
("alignment cannot be given for &", Nam
);
5132 elsif Duplicate_Clause
then
5135 elsif Align
/= No_Uint
then
5136 Set_Has_Alignment_Clause
(U_Ent
);
5138 -- Tagged type case, check for attempt to set alignment to a
5139 -- value greater than Max_Align, and reset if so. This error
5140 -- is suppressed in ASIS mode to allow for different ASIS
5141 -- back ends or ASIS-based tools to query the illegal clause.
5143 if Is_Tagged_Type
(U_Ent
)
5144 and then Align
> Max_Align
5145 and then not ASIS_Mode
5148 ("alignment for & set to Maximum_Aligment??", Nam
);
5149 Set_Alignment
(U_Ent
, Max_Align
);
5154 Set_Alignment
(U_Ent
, Align
);
5157 -- For an array type, U_Ent is the first subtype. In that case,
5158 -- also set the alignment of the anonymous base type so that
5159 -- other subtypes (such as the itypes for aggregates of the
5160 -- type) also receive the expected alignment.
5162 if Is_Array_Type
(U_Ent
) then
5163 Set_Alignment
(Base_Type
(U_Ent
), Align
);
5172 -- Bit_Order attribute definition clause
5174 when Attribute_Bit_Order
=>
5175 if not Is_Record_Type
(U_Ent
) then
5177 ("Bit_Order can only be defined for record type", Nam
);
5179 elsif Duplicate_Clause
then
5183 Analyze_And_Resolve
(Expr
, RTE
(RE_Bit_Order
));
5185 if Etype
(Expr
) = Any_Type
then
5188 elsif not Is_OK_Static_Expression
(Expr
) then
5189 Flag_Non_Static_Expr
5190 ("Bit_Order requires static expression!", Expr
);
5193 if (Expr_Value
(Expr
) = 0) /= Bytes_Big_Endian
then
5194 Set_Reverse_Bit_Order
(Base_Type
(U_Ent
), True);
5199 --------------------
5200 -- Component_Size --
5201 --------------------
5203 -- Component_Size attribute definition clause
5205 when Attribute_Component_Size
=> Component_Size_Case
: declare
5206 Csize
: constant Uint
:= Static_Integer
(Expr
);
5210 New_Ctyp
: Entity_Id
;
5214 if not Is_Array_Type
(U_Ent
) then
5215 Error_Msg_N
("component size requires array type", Nam
);
5219 Btype
:= Base_Type
(U_Ent
);
5220 Ctyp
:= Component_Type
(Btype
);
5222 if Duplicate_Clause
then
5225 elsif Rep_Item_Too_Early
(Btype
, N
) then
5228 elsif Csize
/= No_Uint
then
5229 Check_Size
(Expr
, Ctyp
, Csize
, Biased
);
5231 -- For the biased case, build a declaration for a subtype that
5232 -- will be used to represent the biased subtype that reflects
5233 -- the biased representation of components. We need the subtype
5234 -- to get proper conversions on referencing elements of the
5239 Make_Defining_Identifier
(Loc
,
5241 New_External_Name
(Chars
(U_Ent
), 'C', 0, 'T'));
5244 Make_Subtype_Declaration
(Loc
,
5245 Defining_Identifier
=> New_Ctyp
,
5246 Subtype_Indication
=>
5247 New_Occurrence_Of
(Component_Type
(Btype
), Loc
));
5249 Set_Parent
(Decl
, N
);
5250 Analyze
(Decl
, Suppress
=> All_Checks
);
5252 Set_Has_Delayed_Freeze
(New_Ctyp
, False);
5253 Set_Esize
(New_Ctyp
, Csize
);
5254 Set_RM_Size
(New_Ctyp
, Csize
);
5255 Init_Alignment
(New_Ctyp
);
5256 Set_Is_Itype
(New_Ctyp
, True);
5257 Set_Associated_Node_For_Itype
(New_Ctyp
, U_Ent
);
5259 Set_Component_Type
(Btype
, New_Ctyp
);
5260 Set_Biased
(New_Ctyp
, N
, "component size clause");
5263 Set_Component_Size
(Btype
, Csize
);
5265 -- Deal with warning on overridden size
5267 if Warn_On_Overridden_Size
5268 and then Has_Size_Clause
(Ctyp
)
5269 and then RM_Size
(Ctyp
) /= Csize
5272 ("component size overrides size clause for&?S?", N
, Ctyp
);
5275 Set_Has_Component_Size_Clause
(Btype
, True);
5276 Set_Has_Non_Standard_Rep
(Btype
, True);
5278 end Component_Size_Case
;
5280 -----------------------
5281 -- Constant_Indexing --
5282 -----------------------
5284 when Attribute_Constant_Indexing
=>
5285 Check_Indexing_Functions
;
5291 when Attribute_CPU
=>
5293 -- CPU attribute definition clause not allowed except from aspect
5296 if From_Aspect_Specification
(N
) then
5297 if not Is_Task_Type
(U_Ent
) then
5298 Error_Msg_N
("CPU can only be defined for task", Nam
);
5300 elsif Duplicate_Clause
then
5304 -- The expression must be analyzed in the special manner
5305 -- described in "Handling of Default and Per-Object
5306 -- Expressions" in sem.ads.
5308 -- The visibility to the discriminants must be restored
5310 Push_Scope_And_Install_Discriminants
(U_Ent
);
5311 Preanalyze_Spec_Expression
(Expr
, RTE
(RE_CPU_Range
));
5312 Uninstall_Discriminants_And_Pop_Scope
(U_Ent
);
5314 if not Is_OK_Static_Expression
(Expr
) then
5315 Check_Restriction
(Static_Priorities
, Expr
);
5321 ("attribute& cannot be set with definition clause", N
);
5324 ----------------------
5325 -- Default_Iterator --
5326 ----------------------
5328 when Attribute_Default_Iterator
=> Default_Iterator
: declare
5333 -- If target type is untagged, further checks are irrelevant
5335 if not Is_Tagged_Type
(U_Ent
) then
5337 ("aspect Default_Iterator applies to tagged type", Nam
);
5341 Check_Iterator_Functions
;
5345 if not Is_Entity_Name
(Expr
)
5346 or else Ekind
(Entity
(Expr
)) /= E_Function
5348 Error_Msg_N
("aspect Iterator must be a function", Expr
);
5351 Func
:= Entity
(Expr
);
5354 -- The type of the first parameter must be T, T'class, or a
5355 -- corresponding access type (5.5.1 (8/3). If function is
5356 -- parameterless label type accordingly.
5358 if No
(First_Formal
(Func
)) then
5361 Typ
:= Etype
(First_Formal
(Func
));
5365 or else Typ
= Class_Wide_Type
(U_Ent
)
5366 or else (Is_Access_Type
(Typ
)
5367 and then Designated_Type
(Typ
) = U_Ent
)
5368 or else (Is_Access_Type
(Typ
)
5369 and then Designated_Type
(Typ
) =
5370 Class_Wide_Type
(U_Ent
))
5376 ("Default Iterator must be a primitive of&", Func
, U_Ent
);
5378 end Default_Iterator
;
5380 ------------------------
5381 -- Dispatching_Domain --
5382 ------------------------
5384 when Attribute_Dispatching_Domain
=>
5386 -- Dispatching_Domain attribute definition clause not allowed
5387 -- except from aspect specification.
5389 if From_Aspect_Specification
(N
) then
5390 if not Is_Task_Type
(U_Ent
) then
5392 ("Dispatching_Domain can only be defined for task", Nam
);
5394 elsif Duplicate_Clause
then
5398 -- The expression must be analyzed in the special manner
5399 -- described in "Handling of Default and Per-Object
5400 -- Expressions" in sem.ads.
5402 -- The visibility to the discriminants must be restored
5404 Push_Scope_And_Install_Discriminants
(U_Ent
);
5406 Preanalyze_Spec_Expression
5407 (Expr
, RTE
(RE_Dispatching_Domain
));
5409 Uninstall_Discriminants_And_Pop_Scope
(U_Ent
);
5414 ("attribute& cannot be set with definition clause", N
);
5421 when Attribute_External_Tag
=>
5422 if not Is_Tagged_Type
(U_Ent
) then
5423 Error_Msg_N
("should be a tagged type", Nam
);
5426 if Duplicate_Clause
then
5430 Analyze_And_Resolve
(Expr
, Standard_String
);
5432 if not Is_OK_Static_Expression
(Expr
) then
5433 Flag_Non_Static_Expr
5434 ("static string required for tag name!", Nam
);
5437 if not Is_Library_Level_Entity
(U_Ent
) then
5439 ("??non-unique external tag supplied for &", N
, U_Ent
);
5441 ("\??same external tag applies to all subprogram calls",
5444 ("\??corresponding internal tag cannot be obtained", N
);
5448 --------------------------
5449 -- Implicit_Dereference --
5450 --------------------------
5452 when Attribute_Implicit_Dereference
=>
5454 -- Legality checks already performed at the point of the type
5455 -- declaration, aspect is not delayed.
5463 when Attribute_Input
=>
5464 Analyze_Stream_TSS_Definition
(TSS_Stream_Input
);
5465 Set_Has_Specified_Stream_Input
(Ent
);
5467 ------------------------
5468 -- Interrupt_Priority --
5469 ------------------------
5471 when Attribute_Interrupt_Priority
=>
5473 -- Interrupt_Priority attribute definition clause not allowed
5474 -- except from aspect specification.
5476 if From_Aspect_Specification
(N
) then
5477 if not Is_Concurrent_Type
(U_Ent
) then
5479 ("Interrupt_Priority can only be defined for task and "
5480 & "protected object", Nam
);
5482 elsif Duplicate_Clause
then
5486 -- The expression must be analyzed in the special manner
5487 -- described in "Handling of Default and Per-Object
5488 -- Expressions" in sem.ads.
5490 -- The visibility to the discriminants must be restored
5492 Push_Scope_And_Install_Discriminants
(U_Ent
);
5494 Preanalyze_Spec_Expression
5495 (Expr
, RTE
(RE_Interrupt_Priority
));
5497 Uninstall_Discriminants_And_Pop_Scope
(U_Ent
);
5499 -- Check the No_Task_At_Interrupt_Priority restriction
5501 if Is_Task_Type
(U_Ent
) then
5502 Check_Restriction
(No_Task_At_Interrupt_Priority
, N
);
5508 ("attribute& cannot be set with definition clause", N
);
5515 when Attribute_Iterable
=>
5518 if Nkind
(Expr
) /= N_Aggregate
then
5519 Error_Msg_N
("aspect Iterable must be an aggregate", Expr
);
5526 Assoc
:= First
(Component_Associations
(Expr
));
5527 while Present
(Assoc
) loop
5528 if not Is_Entity_Name
(Expression
(Assoc
)) then
5529 Error_Msg_N
("value must be a function", Assoc
);
5536 ----------------------
5537 -- Iterator_Element --
5538 ----------------------
5540 when Attribute_Iterator_Element
=>
5543 if not Is_Entity_Name
(Expr
)
5544 or else not Is_Type
(Entity
(Expr
))
5546 Error_Msg_N
("aspect Iterator_Element must be a type", Expr
);
5553 -- Machine radix attribute definition clause
5555 when Attribute_Machine_Radix
=> Machine_Radix
: declare
5556 Radix
: constant Uint
:= Static_Integer
(Expr
);
5559 if not Is_Decimal_Fixed_Point_Type
(U_Ent
) then
5560 Error_Msg_N
("decimal fixed-point type expected for &", Nam
);
5562 elsif Duplicate_Clause
then
5565 elsif Radix
/= No_Uint
then
5566 Set_Has_Machine_Radix_Clause
(U_Ent
);
5567 Set_Has_Non_Standard_Rep
(Base_Type
(U_Ent
));
5572 elsif Radix
= 10 then
5573 Set_Machine_Radix_10
(U_Ent
);
5575 -- The following error is suppressed in ASIS mode to allow for
5576 -- different ASIS back ends or ASIS-based tools to query the
5579 elsif not ASIS_Mode
then
5580 Error_Msg_N
("machine radix value must be 2 or 10", Expr
);
5589 -- Object_Size attribute definition clause
5591 when Attribute_Object_Size
=> Object_Size
: declare
5592 Size
: constant Uint
:= Static_Integer
(Expr
);
5595 pragma Warnings
(Off
, Biased
);
5598 if not Is_Type
(U_Ent
) then
5599 Error_Msg_N
("Object_Size cannot be given for &", Nam
);
5601 elsif Duplicate_Clause
then
5605 Check_Size
(Expr
, U_Ent
, Size
, Biased
);
5607 -- The following errors are suppressed in ASIS mode to allow
5608 -- for different ASIS back ends or ASIS-based tools to query
5609 -- the illegal clause.
5614 elsif Is_Scalar_Type
(U_Ent
) then
5615 if Size
/= 8 and then Size
/= 16 and then Size
/= 32
5616 and then UI_Mod
(Size
, 64) /= 0
5619 ("Object_Size must be 8, 16, 32, or multiple of 64",
5623 elsif Size
mod 8 /= 0 then
5624 Error_Msg_N
("Object_Size must be a multiple of 8", Expr
);
5627 Set_Esize
(U_Ent
, Size
);
5628 Set_Has_Object_Size_Clause
(U_Ent
);
5629 Alignment_Check_For_Size_Change
(U_Ent
, Size
);
5637 when Attribute_Output
=>
5638 Analyze_Stream_TSS_Definition
(TSS_Stream_Output
);
5639 Set_Has_Specified_Stream_Output
(Ent
);
5645 when Attribute_Priority
=>
5647 -- Priority attribute definition clause not allowed except from
5648 -- aspect specification.
5650 if From_Aspect_Specification
(N
) then
5651 if not (Is_Concurrent_Type
(U_Ent
)
5652 or else Ekind
(U_Ent
) = E_Procedure
)
5655 ("Priority can only be defined for task and protected "
5658 elsif Duplicate_Clause
then
5662 -- The expression must be analyzed in the special manner
5663 -- described in "Handling of Default and Per-Object
5664 -- Expressions" in sem.ads.
5666 -- The visibility to the discriminants must be restored
5668 Push_Scope_And_Install_Discriminants
(U_Ent
);
5669 Preanalyze_Spec_Expression
(Expr
, Standard_Integer
);
5670 Uninstall_Discriminants_And_Pop_Scope
(U_Ent
);
5672 if not Is_OK_Static_Expression
(Expr
) then
5673 Check_Restriction
(Static_Priorities
, Expr
);
5679 ("attribute& cannot be set with definition clause", N
);
5686 when Attribute_Read
=>
5687 Analyze_Stream_TSS_Definition
(TSS_Stream_Read
);
5688 Set_Has_Specified_Stream_Read
(Ent
);
5690 --------------------------
5691 -- Scalar_Storage_Order --
5692 --------------------------
5694 -- Scalar_Storage_Order attribute definition clause
5696 when Attribute_Scalar_Storage_Order
=>
5697 if not (Is_Record_Type
(U_Ent
) or else Is_Array_Type
(U_Ent
)) then
5699 ("Scalar_Storage_Order can only be defined for record or "
5700 & "array type", Nam
);
5702 elsif Duplicate_Clause
then
5706 Analyze_And_Resolve
(Expr
, RTE
(RE_Bit_Order
));
5708 if Etype
(Expr
) = Any_Type
then
5711 elsif not Is_OK_Static_Expression
(Expr
) then
5712 Flag_Non_Static_Expr
5713 ("Scalar_Storage_Order requires static expression!", Expr
);
5715 elsif (Expr_Value
(Expr
) = 0) /= Bytes_Big_Endian
then
5717 -- Here for the case of a non-default (i.e. non-confirming)
5718 -- Scalar_Storage_Order attribute definition.
5720 if Support_Nondefault_SSO_On_Target
then
5721 Set_Reverse_Storage_Order
(Base_Type
(U_Ent
), True);
5724 ("non-default Scalar_Storage_Order not supported on "
5729 -- Clear SSO default indications since explicit setting of the
5730 -- order overrides the defaults.
5732 Set_SSO_Set_Low_By_Default
(Base_Type
(U_Ent
), False);
5733 Set_SSO_Set_High_By_Default
(Base_Type
(U_Ent
), False);
5736 --------------------------
5737 -- Secondary_Stack_Size --
5738 --------------------------
5740 when Attribute_Secondary_Stack_Size
=>
5742 -- Secondary_Stack_Size attribute definition clause not allowed
5743 -- except from aspect specification.
5745 if From_Aspect_Specification
(N
) then
5746 if not Is_Task_Type
(U_Ent
) then
5748 ("Secondary Stack Size can only be defined for task", Nam
);
5750 elsif Duplicate_Clause
then
5754 Check_Restriction
(No_Secondary_Stack
, Expr
);
5756 -- The expression must be analyzed in the special manner
5757 -- described in "Handling of Default and Per-Object
5758 -- Expressions" in sem.ads.
5760 -- The visibility to the discriminants must be restored
5762 Push_Scope_And_Install_Discriminants
(U_Ent
);
5763 Preanalyze_Spec_Expression
(Expr
, Any_Integer
);
5764 Uninstall_Discriminants_And_Pop_Scope
(U_Ent
);
5766 if not Is_OK_Static_Expression
(Expr
) then
5767 Check_Restriction
(Static_Storage_Size
, Expr
);
5773 ("attribute& cannot be set with definition clause", N
);
5780 -- Size attribute definition clause
5782 when Attribute_Size
=> Size
: declare
5783 Size
: constant Uint
:= Static_Integer
(Expr
);
5790 if Duplicate_Clause
then
5793 elsif not Is_Type
(U_Ent
)
5794 and then Ekind
(U_Ent
) /= E_Variable
5795 and then Ekind
(U_Ent
) /= E_Constant
5797 Error_Msg_N
("size cannot be given for &", Nam
);
5799 elsif Is_Array_Type
(U_Ent
)
5800 and then not Is_Constrained
(U_Ent
)
5803 ("size cannot be given for unconstrained array", Nam
);
5805 elsif Size
/= No_Uint
then
5806 if Is_Type
(U_Ent
) then
5809 Etyp
:= Etype
(U_Ent
);
5812 -- Check size, note that Gigi is in charge of checking that the
5813 -- size of an array or record type is OK. Also we do not check
5814 -- the size in the ordinary fixed-point case, since it is too
5815 -- early to do so (there may be subsequent small clause that
5816 -- affects the size). We can check the size if a small clause
5817 -- has already been given.
5819 if not Is_Ordinary_Fixed_Point_Type
(U_Ent
)
5820 or else Has_Small_Clause
(U_Ent
)
5822 Check_Size
(Expr
, Etyp
, Size
, Biased
);
5823 Set_Biased
(U_Ent
, N
, "size clause", Biased
);
5826 -- For types set RM_Size and Esize if possible
5828 if Is_Type
(U_Ent
) then
5829 Set_RM_Size
(U_Ent
, Size
);
5831 -- For elementary types, increase Object_Size to power of 2,
5832 -- but not less than a storage unit in any case (normally
5833 -- this means it will be byte addressable).
5835 -- For all other types, nothing else to do, we leave Esize
5836 -- (object size) unset, the back end will set it from the
5837 -- size and alignment in an appropriate manner.
5839 -- In both cases, we check whether the alignment must be
5840 -- reset in the wake of the size change.
5842 if Is_Elementary_Type
(U_Ent
) then
5843 if Size
<= System_Storage_Unit
then
5844 Init_Esize
(U_Ent
, System_Storage_Unit
);
5845 elsif Size
<= 16 then
5846 Init_Esize
(U_Ent
, 16);
5847 elsif Size
<= 32 then
5848 Init_Esize
(U_Ent
, 32);
5850 Set_Esize
(U_Ent
, (Size
+ 63) / 64 * 64);
5853 Alignment_Check_For_Size_Change
(U_Ent
, Esize
(U_Ent
));
5855 Alignment_Check_For_Size_Change
(U_Ent
, Size
);
5858 -- For objects, set Esize only
5861 -- The following error is suppressed in ASIS mode to allow
5862 -- for different ASIS back ends or ASIS-based tools to query
5863 -- the illegal clause.
5865 if Is_Elementary_Type
(Etyp
)
5866 and then Size
/= System_Storage_Unit
5867 and then Size
/= System_Storage_Unit
* 2
5868 and then Size
/= System_Storage_Unit
* 4
5869 and then Size
/= System_Storage_Unit
* 8
5870 and then not ASIS_Mode
5872 Error_Msg_Uint_1
:= UI_From_Int
(System_Storage_Unit
);
5873 Error_Msg_Uint_2
:= Error_Msg_Uint_1
* 8;
5875 ("size for primitive object must be a power of 2 in "
5876 & "the range ^-^", N
);
5879 Set_Esize
(U_Ent
, Size
);
5882 Set_Has_Size_Clause
(U_Ent
);
5890 -- Small attribute definition clause
5892 when Attribute_Small
=> Small
: declare
5893 Implicit_Base
: constant Entity_Id
:= Base_Type
(U_Ent
);
5897 Analyze_And_Resolve
(Expr
, Any_Real
);
5899 if Etype
(Expr
) = Any_Type
then
5902 elsif not Is_OK_Static_Expression
(Expr
) then
5903 Flag_Non_Static_Expr
5904 ("small requires static expression!", Expr
);
5908 Small
:= Expr_Value_R
(Expr
);
5910 if Small
<= Ureal_0
then
5911 Error_Msg_N
("small value must be greater than zero", Expr
);
5917 if not Is_Ordinary_Fixed_Point_Type
(U_Ent
) then
5919 ("small requires an ordinary fixed point type", Nam
);
5921 elsif Has_Small_Clause
(U_Ent
) then
5922 Error_Msg_N
("small already given for &", Nam
);
5924 elsif Small
> Delta_Value
(U_Ent
) then
5926 ("small value must not be greater than delta value", Nam
);
5929 Set_Small_Value
(U_Ent
, Small
);
5930 Set_Small_Value
(Implicit_Base
, Small
);
5931 Set_Has_Small_Clause
(U_Ent
);
5932 Set_Has_Small_Clause
(Implicit_Base
);
5933 Set_Has_Non_Standard_Rep
(Implicit_Base
);
5941 -- Storage_Pool attribute definition clause
5943 when Attribute_Simple_Storage_Pool
5944 | Attribute_Storage_Pool
5946 Storage_Pool
: declare
5951 if Ekind
(U_Ent
) = E_Access_Subprogram_Type
then
5953 ("storage pool cannot be given for access-to-subprogram type",
5957 elsif not Ekind_In
(U_Ent
, E_Access_Type
, E_General_Access_Type
)
5960 ("storage pool can only be given for access types", Nam
);
5963 elsif Is_Derived_Type
(U_Ent
) then
5965 ("storage pool cannot be given for a derived access type",
5968 elsif Duplicate_Clause
then
5971 elsif Present
(Associated_Storage_Pool
(U_Ent
)) then
5972 Error_Msg_N
("storage pool already given for &", Nam
);
5976 -- Check for Storage_Size previously given
5979 SS
: constant Node_Id
:=
5980 Get_Attribute_Definition_Clause
5981 (U_Ent
, Attribute_Storage_Size
);
5983 if Present
(SS
) then
5984 Check_Pool_Size_Clash
(U_Ent
, N
, SS
);
5988 -- Storage_Pool case
5990 if Id
= Attribute_Storage_Pool
then
5992 (Expr
, Class_Wide_Type
(RTE
(RE_Root_Storage_Pool
)));
5994 -- In the Simple_Storage_Pool case, we allow a variable of any
5995 -- simple storage pool type, so we Resolve without imposing an
5999 Analyze_And_Resolve
(Expr
);
6001 if not Present
(Get_Rep_Pragma
6002 (Etype
(Expr
), Name_Simple_Storage_Pool_Type
))
6005 ("expression must be of a simple storage pool type", Expr
);
6009 if not Denotes_Variable
(Expr
) then
6010 Error_Msg_N
("storage pool must be a variable", Expr
);
6014 if Nkind
(Expr
) = N_Type_Conversion
then
6015 T
:= Etype
(Expression
(Expr
));
6020 -- The Stack_Bounded_Pool is used internally for implementing
6021 -- access types with a Storage_Size. Since it only work properly
6022 -- when used on one specific type, we need to check that it is not
6023 -- hijacked improperly:
6025 -- type T is access Integer;
6026 -- for T'Storage_Size use n;
6027 -- type Q is access Float;
6028 -- for Q'Storage_Size use T'Storage_Size; -- incorrect
6030 if RTE_Available
(RE_Stack_Bounded_Pool
)
6031 and then Base_Type
(T
) = RTE
(RE_Stack_Bounded_Pool
)
6033 Error_Msg_N
("non-shareable internal Pool", Expr
);
6037 -- If the argument is a name that is not an entity name, then
6038 -- we construct a renaming operation to define an entity of
6039 -- type storage pool.
6041 if not Is_Entity_Name
(Expr
)
6042 and then Is_Object_Reference
(Expr
)
6044 Pool
:= Make_Temporary
(Loc
, 'P', Expr
);
6047 Rnode
: constant Node_Id
:=
6048 Make_Object_Renaming_Declaration
(Loc
,
6049 Defining_Identifier
=> Pool
,
6051 New_Occurrence_Of
(Etype
(Expr
), Loc
),
6055 -- If the attribute definition clause comes from an aspect
6056 -- clause, then insert the renaming before the associated
6057 -- entity's declaration, since the attribute clause has
6058 -- not yet been appended to the declaration list.
6060 if From_Aspect_Specification
(N
) then
6061 Insert_Before
(Parent
(Entity
(N
)), Rnode
);
6063 Insert_Before
(N
, Rnode
);
6067 Set_Associated_Storage_Pool
(U_Ent
, Pool
);
6070 elsif Is_Entity_Name
(Expr
) then
6071 Pool
:= Entity
(Expr
);
6073 -- If pool is a renamed object, get original one. This can
6074 -- happen with an explicit renaming, and within instances.
6076 while Present
(Renamed_Object
(Pool
))
6077 and then Is_Entity_Name
(Renamed_Object
(Pool
))
6079 Pool
:= Entity
(Renamed_Object
(Pool
));
6082 if Present
(Renamed_Object
(Pool
))
6083 and then Nkind
(Renamed_Object
(Pool
)) = N_Type_Conversion
6084 and then Is_Entity_Name
(Expression
(Renamed_Object
(Pool
)))
6086 Pool
:= Entity
(Expression
(Renamed_Object
(Pool
)));
6089 Set_Associated_Storage_Pool
(U_Ent
, Pool
);
6091 elsif Nkind
(Expr
) = N_Type_Conversion
6092 and then Is_Entity_Name
(Expression
(Expr
))
6093 and then Nkind
(Original_Node
(Expr
)) = N_Attribute_Reference
6095 Pool
:= Entity
(Expression
(Expr
));
6096 Set_Associated_Storage_Pool
(U_Ent
, Pool
);
6099 Error_Msg_N
("incorrect reference to a Storage Pool", Expr
);
6108 -- Storage_Size attribute definition clause
6110 when Attribute_Storage_Size
=> Storage_Size
: declare
6111 Btype
: constant Entity_Id
:= Base_Type
(U_Ent
);
6114 if Is_Task_Type
(U_Ent
) then
6116 -- Check obsolescent (but never obsolescent if from aspect)
6118 if not From_Aspect_Specification
(N
) then
6119 Check_Restriction
(No_Obsolescent_Features
, N
);
6121 if Warn_On_Obsolescent_Feature
then
6123 ("?j?storage size clause for task is an obsolescent "
6124 & "feature (RM J.9)", N
);
6125 Error_Msg_N
("\?j?use Storage_Size pragma instead", N
);
6132 if not Is_Access_Type
(U_Ent
)
6133 and then Ekind
(U_Ent
) /= E_Task_Type
6135 Error_Msg_N
("storage size cannot be given for &", Nam
);
6137 elsif Is_Access_Type
(U_Ent
) and Is_Derived_Type
(U_Ent
) then
6139 ("storage size cannot be given for a derived access type",
6142 elsif Duplicate_Clause
then
6146 Analyze_And_Resolve
(Expr
, Any_Integer
);
6148 if Is_Access_Type
(U_Ent
) then
6150 -- Check for Storage_Pool previously given
6153 SP
: constant Node_Id
:=
6154 Get_Attribute_Definition_Clause
6155 (U_Ent
, Attribute_Storage_Pool
);
6158 if Present
(SP
) then
6159 Check_Pool_Size_Clash
(U_Ent
, SP
, N
);
6163 -- Special case of for x'Storage_Size use 0
6165 if Is_OK_Static_Expression
(Expr
)
6166 and then Expr_Value
(Expr
) = 0
6168 Set_No_Pool_Assigned
(Btype
);
6172 Set_Has_Storage_Size_Clause
(Btype
);
6180 when Attribute_Stream_Size
=> Stream_Size
: declare
6181 Size
: constant Uint
:= Static_Integer
(Expr
);
6184 if Ada_Version
<= Ada_95
then
6185 Check_Restriction
(No_Implementation_Attributes
, N
);
6188 if Duplicate_Clause
then
6191 elsif Is_Elementary_Type
(U_Ent
) then
6193 -- The following errors are suppressed in ASIS mode to allow
6194 -- for different ASIS back ends or ASIS-based tools to query
6195 -- the illegal clause.
6200 elsif Size
/= System_Storage_Unit
6201 and then Size
/= System_Storage_Unit
* 2
6202 and then Size
/= System_Storage_Unit
* 4
6203 and then Size
/= System_Storage_Unit
* 8
6205 Error_Msg_Uint_1
:= UI_From_Int
(System_Storage_Unit
);
6207 ("stream size for elementary type must be a power of 2 "
6208 & "and at least ^", N
);
6210 elsif RM_Size
(U_Ent
) > Size
then
6211 Error_Msg_Uint_1
:= RM_Size
(U_Ent
);
6213 ("stream size for elementary type must be a power of 2 "
6214 & "and at least ^", N
);
6217 Set_Has_Stream_Size_Clause
(U_Ent
);
6220 Error_Msg_N
("Stream_Size cannot be given for &", Nam
);
6228 -- Value_Size attribute definition clause
6230 when Attribute_Value_Size
=> Value_Size
: declare
6231 Size
: constant Uint
:= Static_Integer
(Expr
);
6235 if not Is_Type
(U_Ent
) then
6236 Error_Msg_N
("Value_Size cannot be given for &", Nam
);
6238 elsif Duplicate_Clause
then
6241 elsif Is_Array_Type
(U_Ent
)
6242 and then not Is_Constrained
(U_Ent
)
6245 ("Value_Size cannot be given for unconstrained array", Nam
);
6248 if Is_Elementary_Type
(U_Ent
) then
6249 Check_Size
(Expr
, U_Ent
, Size
, Biased
);
6250 Set_Biased
(U_Ent
, N
, "value size clause", Biased
);
6253 Set_RM_Size
(U_Ent
, Size
);
6257 -----------------------
6258 -- Variable_Indexing --
6259 -----------------------
6261 when Attribute_Variable_Indexing
=>
6262 Check_Indexing_Functions
;
6268 when Attribute_Write
=>
6269 Analyze_Stream_TSS_Definition
(TSS_Stream_Write
);
6270 Set_Has_Specified_Stream_Write
(Ent
);
6272 -- All other attributes cannot be set
6276 ("attribute& cannot be set with definition clause", N
);
6279 -- The test for the type being frozen must be performed after any
6280 -- expression the clause has been analyzed since the expression itself
6281 -- might cause freezing that makes the clause illegal.
6283 if Rep_Item_Too_Late
(U_Ent
, N
, FOnly
) then
6286 end Analyze_Attribute_Definition_Clause
;
6288 ----------------------------
6289 -- Analyze_Code_Statement --
6290 ----------------------------
6292 procedure Analyze_Code_Statement
(N
: Node_Id
) is
6293 HSS
: constant Node_Id
:= Parent
(N
);
6294 SBody
: constant Node_Id
:= Parent
(HSS
);
6295 Subp
: constant Entity_Id
:= Current_Scope
;
6302 -- Accept foreign code statements for CodePeer. The analysis is skipped
6303 -- to avoid rejecting unrecognized constructs.
6305 if CodePeer_Mode
then
6310 -- Analyze and check we get right type, note that this implements the
6311 -- requirement (RM 13.8(1)) that Machine_Code be with'ed, since that is
6312 -- the only way that Asm_Insn could possibly be visible.
6314 Analyze_And_Resolve
(Expression
(N
));
6316 if Etype
(Expression
(N
)) = Any_Type
then
6318 elsif Etype
(Expression
(N
)) /= RTE
(RE_Asm_Insn
) then
6319 Error_Msg_N
("incorrect type for code statement", N
);
6323 Check_Code_Statement
(N
);
6325 -- Make sure we appear in the handled statement sequence of a subprogram
6328 if Nkind
(HSS
) /= N_Handled_Sequence_Of_Statements
6329 or else Nkind
(SBody
) /= N_Subprogram_Body
6332 ("code statement can only appear in body of subprogram", N
);
6336 -- Do remaining checks (RM 13.8(3)) if not already done
6338 if not Is_Machine_Code_Subprogram
(Subp
) then
6339 Set_Is_Machine_Code_Subprogram
(Subp
);
6341 -- No exception handlers allowed
6343 if Present
(Exception_Handlers
(HSS
)) then
6345 ("exception handlers not permitted in machine code subprogram",
6346 First
(Exception_Handlers
(HSS
)));
6349 -- No declarations other than use clauses and pragmas (we allow
6350 -- certain internally generated declarations as well).
6352 Decl
:= First
(Declarations
(SBody
));
6353 while Present
(Decl
) loop
6354 DeclO
:= Original_Node
(Decl
);
6355 if Comes_From_Source
(DeclO
)
6356 and not Nkind_In
(DeclO
, N_Pragma
,
6357 N_Use_Package_Clause
,
6359 N_Implicit_Label_Declaration
)
6362 ("this declaration not allowed in machine code subprogram",
6369 -- No statements other than code statements, pragmas, and labels.
6370 -- Again we allow certain internally generated statements.
6372 -- In Ada 2012, qualified expressions are names, and the code
6373 -- statement is initially parsed as a procedure call.
6375 Stmt
:= First
(Statements
(HSS
));
6376 while Present
(Stmt
) loop
6377 StmtO
:= Original_Node
(Stmt
);
6379 -- A procedure call transformed into a code statement is OK
6381 if Ada_Version
>= Ada_2012
6382 and then Nkind
(StmtO
) = N_Procedure_Call_Statement
6383 and then Nkind
(Name
(StmtO
)) = N_Qualified_Expression
6387 elsif Comes_From_Source
(StmtO
)
6388 and then not Nkind_In
(StmtO
, N_Pragma
,
6393 ("this statement is not allowed in machine code subprogram",
6400 end Analyze_Code_Statement
;
6402 -----------------------------------------------
6403 -- Analyze_Enumeration_Representation_Clause --
6404 -----------------------------------------------
6406 procedure Analyze_Enumeration_Representation_Clause
(N
: Node_Id
) is
6407 Ident
: constant Node_Id
:= Identifier
(N
);
6408 Aggr
: constant Node_Id
:= Array_Aggregate
(N
);
6409 Enumtype
: Entity_Id
;
6416 Err
: Boolean := False;
6417 -- Set True to avoid cascade errors and crashes on incorrect source code
6419 Lo
: constant Uint
:= Expr_Value
(Type_Low_Bound
(Universal_Integer
));
6420 Hi
: constant Uint
:= Expr_Value
(Type_High_Bound
(Universal_Integer
));
6421 -- Allowed range of universal integer (= allowed range of enum lit vals)
6425 -- Minimum and maximum values of entries
6428 -- Pointer to node for literal providing max value
6431 if Ignore_Rep_Clauses
then
6432 Kill_Rep_Clause
(N
);
6436 -- Ignore enumeration rep clauses by default in CodePeer mode,
6437 -- unless -gnatd.I is specified, as a work around for potential false
6438 -- positive messages.
6440 if CodePeer_Mode
and not Debug_Flag_Dot_II
then
6444 -- First some basic error checks
6447 Enumtype
:= Entity
(Ident
);
6449 if Enumtype
= Any_Type
6450 or else Rep_Item_Too_Early
(Enumtype
, N
)
6454 Enumtype
:= Underlying_Type
(Enumtype
);
6457 if not Is_Enumeration_Type
(Enumtype
) then
6459 ("enumeration type required, found}",
6460 Ident
, First_Subtype
(Enumtype
));
6464 -- Ignore rep clause on generic actual type. This will already have
6465 -- been flagged on the template as an error, and this is the safest
6466 -- way to ensure we don't get a junk cascaded message in the instance.
6468 if Is_Generic_Actual_Type
(Enumtype
) then
6471 -- Type must be in current scope
6473 elsif Scope
(Enumtype
) /= Current_Scope
then
6474 Error_Msg_N
("type must be declared in this scope", Ident
);
6477 -- Type must be a first subtype
6479 elsif not Is_First_Subtype
(Enumtype
) then
6480 Error_Msg_N
("cannot give enumeration rep clause for subtype", N
);
6483 -- Ignore duplicate rep clause
6485 elsif Has_Enumeration_Rep_Clause
(Enumtype
) then
6486 Error_Msg_N
("duplicate enumeration rep clause ignored", N
);
6489 -- Don't allow rep clause for standard [wide_[wide_]]character
6491 elsif Is_Standard_Character_Type
(Enumtype
) then
6492 Error_Msg_N
("enumeration rep clause not allowed for this type", N
);
6495 -- Check that the expression is a proper aggregate (no parentheses)
6497 elsif Paren_Count
(Aggr
) /= 0 then
6499 ("extra parentheses surrounding aggregate not allowed",
6503 -- All tests passed, so set rep clause in place
6506 Set_Has_Enumeration_Rep_Clause
(Enumtype
);
6507 Set_Has_Enumeration_Rep_Clause
(Base_Type
(Enumtype
));
6510 -- Now we process the aggregate. Note that we don't use the normal
6511 -- aggregate code for this purpose, because we don't want any of the
6512 -- normal expansion activities, and a number of special semantic
6513 -- rules apply (including the component type being any integer type)
6515 Elit
:= First_Literal
(Enumtype
);
6517 -- First the positional entries if any
6519 if Present
(Expressions
(Aggr
)) then
6520 Expr
:= First
(Expressions
(Aggr
));
6521 while Present
(Expr
) loop
6523 Error_Msg_N
("too many entries in aggregate", Expr
);
6527 Val
:= Static_Integer
(Expr
);
6529 -- Err signals that we found some incorrect entries processing
6530 -- the list. The final checks for completeness and ordering are
6531 -- skipped in this case.
6533 if Val
= No_Uint
then
6536 elsif Val
< Lo
or else Hi
< Val
then
6537 Error_Msg_N
("value outside permitted range", Expr
);
6541 Set_Enumeration_Rep
(Elit
, Val
);
6542 Set_Enumeration_Rep_Expr
(Elit
, Expr
);
6548 -- Now process the named entries if present
6550 if Present
(Component_Associations
(Aggr
)) then
6551 Assoc
:= First
(Component_Associations
(Aggr
));
6552 while Present
(Assoc
) loop
6553 Choice
:= First
(Choices
(Assoc
));
6555 if Present
(Next
(Choice
)) then
6557 ("multiple choice not allowed here", Next
(Choice
));
6561 if Nkind
(Choice
) = N_Others_Choice
then
6562 Error_Msg_N
("others choice not allowed here", Choice
);
6565 elsif Nkind
(Choice
) = N_Range
then
6567 -- ??? should allow zero/one element range here
6569 Error_Msg_N
("range not allowed here", Choice
);
6573 Analyze_And_Resolve
(Choice
, Enumtype
);
6575 if Error_Posted
(Choice
) then
6580 if Is_Entity_Name
(Choice
)
6581 and then Is_Type
(Entity
(Choice
))
6583 Error_Msg_N
("subtype name not allowed here", Choice
);
6586 -- ??? should allow static subtype with zero/one entry
6588 elsif Etype
(Choice
) = Base_Type
(Enumtype
) then
6589 if not Is_OK_Static_Expression
(Choice
) then
6590 Flag_Non_Static_Expr
6591 ("non-static expression used for choice!", Choice
);
6595 Elit
:= Expr_Value_E
(Choice
);
6597 if Present
(Enumeration_Rep_Expr
(Elit
)) then
6599 Sloc
(Enumeration_Rep_Expr
(Elit
));
6601 ("representation for& previously given#",
6606 Set_Enumeration_Rep_Expr
(Elit
, Expression
(Assoc
));
6608 Expr
:= Expression
(Assoc
);
6609 Val
:= Static_Integer
(Expr
);
6611 if Val
= No_Uint
then
6614 elsif Val
< Lo
or else Hi
< Val
then
6615 Error_Msg_N
("value outside permitted range", Expr
);
6619 Set_Enumeration_Rep
(Elit
, Val
);
6629 -- Aggregate is fully processed. Now we check that a full set of
6630 -- representations was given, and that they are in range and in order.
6631 -- These checks are only done if no other errors occurred.
6637 Elit
:= First_Literal
(Enumtype
);
6638 while Present
(Elit
) loop
6639 if No
(Enumeration_Rep_Expr
(Elit
)) then
6640 Error_Msg_NE
("missing representation for&!", N
, Elit
);
6643 Val
:= Enumeration_Rep
(Elit
);
6645 if Min
= No_Uint
then
6649 if Val
/= No_Uint
then
6650 if Max
/= No_Uint
and then Val
<= Max
then
6652 ("enumeration value for& not ordered!",
6653 Enumeration_Rep_Expr
(Elit
), Elit
);
6656 Max_Node
:= Enumeration_Rep_Expr
(Elit
);
6660 -- If there is at least one literal whose representation is not
6661 -- equal to the Pos value, then note that this enumeration type
6662 -- has a non-standard representation.
6664 if Val
/= Enumeration_Pos
(Elit
) then
6665 Set_Has_Non_Standard_Rep
(Base_Type
(Enumtype
));
6672 -- Now set proper size information
6675 Minsize
: Uint
:= UI_From_Int
(Minimum_Size
(Enumtype
));
6678 if Has_Size_Clause
(Enumtype
) then
6680 -- All OK, if size is OK now
6682 if RM_Size
(Enumtype
) >= Minsize
then
6686 -- Try if we can get by with biasing
6689 UI_From_Int
(Minimum_Size
(Enumtype
, Biased
=> True));
6691 -- Error message if even biasing does not work
6693 if RM_Size
(Enumtype
) < Minsize
then
6694 Error_Msg_Uint_1
:= RM_Size
(Enumtype
);
6695 Error_Msg_Uint_2
:= Max
;
6697 ("previously given size (^) is too small "
6698 & "for this value (^)", Max_Node
);
6700 -- If biasing worked, indicate that we now have biased rep
6704 (Enumtype
, Size_Clause
(Enumtype
), "size clause");
6709 Set_RM_Size
(Enumtype
, Minsize
);
6710 Set_Enum_Esize
(Enumtype
);
6713 Set_RM_Size
(Base_Type
(Enumtype
), RM_Size
(Enumtype
));
6714 Set_Esize
(Base_Type
(Enumtype
), Esize
(Enumtype
));
6715 Set_Alignment
(Base_Type
(Enumtype
), Alignment
(Enumtype
));
6719 -- We repeat the too late test in case it froze itself
6721 if Rep_Item_Too_Late
(Enumtype
, N
) then
6724 end Analyze_Enumeration_Representation_Clause
;
6726 ----------------------------
6727 -- Analyze_Free_Statement --
6728 ----------------------------
6730 procedure Analyze_Free_Statement
(N
: Node_Id
) is
6732 Analyze
(Expression
(N
));
6733 end Analyze_Free_Statement
;
6735 ---------------------------
6736 -- Analyze_Freeze_Entity --
6737 ---------------------------
6739 procedure Analyze_Freeze_Entity
(N
: Node_Id
) is
6741 Freeze_Entity_Checks
(N
);
6742 end Analyze_Freeze_Entity
;
6744 -----------------------------------
6745 -- Analyze_Freeze_Generic_Entity --
6746 -----------------------------------
6748 procedure Analyze_Freeze_Generic_Entity
(N
: Node_Id
) is
6749 E
: constant Entity_Id
:= Entity
(N
);
6752 if not Is_Frozen
(E
) and then Has_Delayed_Aspects
(E
) then
6753 Analyze_Aspects_At_Freeze_Point
(E
);
6756 Freeze_Entity_Checks
(N
);
6757 end Analyze_Freeze_Generic_Entity
;
6759 ------------------------------------------
6760 -- Analyze_Record_Representation_Clause --
6761 ------------------------------------------
6763 -- Note: we check as much as we can here, but we can't do any checks
6764 -- based on the position values (e.g. overlap checks) until freeze time
6765 -- because especially in Ada 2005 (machine scalar mode), the processing
6766 -- for non-standard bit order can substantially change the positions.
6767 -- See procedure Check_Record_Representation_Clause (called from Freeze)
6768 -- for the remainder of this processing.
6770 procedure Analyze_Record_Representation_Clause
(N
: Node_Id
) is
6771 Ident
: constant Node_Id
:= Identifier
(N
);
6776 Hbit
: Uint
:= Uint_0
;
6780 Rectype
: Entity_Id
;
6783 function Is_Inherited
(Comp
: Entity_Id
) return Boolean;
6784 -- True if Comp is an inherited component in a record extension
6790 function Is_Inherited
(Comp
: Entity_Id
) return Boolean is
6791 Comp_Base
: Entity_Id
;
6794 if Ekind
(Rectype
) = E_Record_Subtype
then
6795 Comp_Base
:= Original_Record_Component
(Comp
);
6800 return Comp_Base
/= Original_Record_Component
(Comp_Base
);
6805 Is_Record_Extension
: Boolean;
6806 -- True if Rectype is a record extension
6808 CR_Pragma
: Node_Id
:= Empty
;
6809 -- Points to N_Pragma node if Complete_Representation pragma present
6811 -- Start of processing for Analyze_Record_Representation_Clause
6814 if Ignore_Rep_Clauses
then
6815 Kill_Rep_Clause
(N
);
6820 Rectype
:= Entity
(Ident
);
6822 if Rectype
= Any_Type
or else Rep_Item_Too_Early
(Rectype
, N
) then
6825 Rectype
:= Underlying_Type
(Rectype
);
6828 -- First some basic error checks
6830 if not Is_Record_Type
(Rectype
) then
6832 ("record type required, found}", Ident
, First_Subtype
(Rectype
));
6835 elsif Scope
(Rectype
) /= Current_Scope
then
6836 Error_Msg_N
("type must be declared in this scope", N
);
6839 elsif not Is_First_Subtype
(Rectype
) then
6840 Error_Msg_N
("cannot give record rep clause for subtype", N
);
6843 elsif Has_Record_Rep_Clause
(Rectype
) then
6844 Error_Msg_N
("duplicate record rep clause ignored", N
);
6847 elsif Rep_Item_Too_Late
(Rectype
, N
) then
6851 -- We know we have a first subtype, now possibly go to the anonymous
6852 -- base type to determine whether Rectype is a record extension.
6854 Recdef
:= Type_Definition
(Declaration_Node
(Base_Type
(Rectype
)));
6855 Is_Record_Extension
:=
6856 Nkind
(Recdef
) = N_Derived_Type_Definition
6857 and then Present
(Record_Extension_Part
(Recdef
));
6859 if Present
(Mod_Clause
(N
)) then
6861 Loc
: constant Source_Ptr
:= Sloc
(N
);
6862 M
: constant Node_Id
:= Mod_Clause
(N
);
6863 P
: constant List_Id
:= Pragmas_Before
(M
);
6867 pragma Warnings
(Off
, Mod_Val
);
6870 Check_Restriction
(No_Obsolescent_Features
, Mod_Clause
(N
));
6872 if Warn_On_Obsolescent_Feature
then
6874 ("?j?mod clause is an obsolescent feature (RM J.8)", N
);
6876 ("\?j?use alignment attribute definition clause instead", N
);
6883 -- In ASIS_Mode mode, expansion is disabled, but we must convert
6884 -- the Mod clause into an alignment clause anyway, so that the
6885 -- back end can compute and back-annotate properly the size and
6886 -- alignment of types that may include this record.
6888 -- This seems dubious, this destroys the source tree in a manner
6889 -- not detectable by ASIS ???
6891 if Operating_Mode
= Check_Semantics
and then ASIS_Mode
then
6893 Make_Attribute_Definition_Clause
(Loc
,
6894 Name
=> New_Occurrence_Of
(Base_Type
(Rectype
), Loc
),
6895 Chars
=> Name_Alignment
,
6896 Expression
=> Relocate_Node
(Expression
(M
)));
6898 Set_From_At_Mod
(AtM_Nod
);
6899 Insert_After
(N
, AtM_Nod
);
6900 Mod_Val
:= Get_Alignment_Value
(Expression
(AtM_Nod
));
6901 Set_Mod_Clause
(N
, Empty
);
6904 -- Get the alignment value to perform error checking
6906 Mod_Val
:= Get_Alignment_Value
(Expression
(M
));
6911 -- For untagged types, clear any existing component clauses for the
6912 -- type. If the type is derived, this is what allows us to override
6913 -- a rep clause for the parent. For type extensions, the representation
6914 -- of the inherited components is inherited, so we want to keep previous
6915 -- component clauses for completeness.
6917 if not Is_Tagged_Type
(Rectype
) then
6918 Comp
:= First_Component_Or_Discriminant
(Rectype
);
6919 while Present
(Comp
) loop
6920 Set_Component_Clause
(Comp
, Empty
);
6921 Next_Component_Or_Discriminant
(Comp
);
6925 -- All done if no component clauses
6927 CC
:= First
(Component_Clauses
(N
));
6933 -- A representation like this applies to the base type
6935 Set_Has_Record_Rep_Clause
(Base_Type
(Rectype
));
6936 Set_Has_Non_Standard_Rep
(Base_Type
(Rectype
));
6937 Set_Has_Specified_Layout
(Base_Type
(Rectype
));
6939 -- Process the component clauses
6941 while Present
(CC
) loop
6945 if Nkind
(CC
) = N_Pragma
then
6948 -- The only pragma of interest is Complete_Representation
6950 if Pragma_Name
(CC
) = Name_Complete_Representation
then
6954 -- Processing for real component clause
6957 Posit
:= Static_Integer
(Position
(CC
));
6958 Fbit
:= Static_Integer
(First_Bit
(CC
));
6959 Lbit
:= Static_Integer
(Last_Bit
(CC
));
6962 and then Fbit
/= No_Uint
6963 and then Lbit
/= No_Uint
6966 Error_Msg_N
("position cannot be negative", Position
(CC
));
6969 Error_Msg_N
("first bit cannot be negative", First_Bit
(CC
));
6971 -- The Last_Bit specified in a component clause must not be
6972 -- less than the First_Bit minus one (RM-13.5.1(10)).
6974 elsif Lbit
< Fbit
- 1 then
6976 ("last bit cannot be less than first bit minus one",
6979 -- Values look OK, so find the corresponding record component
6980 -- Even though the syntax allows an attribute reference for
6981 -- implementation-defined components, GNAT does not allow the
6982 -- tag to get an explicit position.
6984 elsif Nkind
(Component_Name
(CC
)) = N_Attribute_Reference
then
6985 if Attribute_Name
(Component_Name
(CC
)) = Name_Tag
then
6986 Error_Msg_N
("position of tag cannot be specified", CC
);
6988 Error_Msg_N
("illegal component name", CC
);
6992 Comp
:= First_Entity
(Rectype
);
6993 while Present
(Comp
) loop
6994 exit when Chars
(Comp
) = Chars
(Component_Name
(CC
));
7000 -- Maybe component of base type that is absent from
7001 -- statically constrained first subtype.
7003 Comp
:= First_Entity
(Base_Type
(Rectype
));
7004 while Present
(Comp
) loop
7005 exit when Chars
(Comp
) = Chars
(Component_Name
(CC
));
7012 ("component clause is for non-existent field", CC
);
7014 -- Ada 2012 (AI05-0026): Any name that denotes a
7015 -- discriminant of an object of an unchecked union type
7016 -- shall not occur within a record_representation_clause.
7018 -- The general restriction of using record rep clauses on
7019 -- Unchecked_Union types has now been lifted. Since it is
7020 -- possible to introduce a record rep clause which mentions
7021 -- the discriminant of an Unchecked_Union in non-Ada 2012
7022 -- code, this check is applied to all versions of the
7025 elsif Ekind
(Comp
) = E_Discriminant
7026 and then Is_Unchecked_Union
(Rectype
)
7029 ("cannot reference discriminant of unchecked union",
7030 Component_Name
(CC
));
7032 elsif Is_Record_Extension
and then Is_Inherited
(Comp
) then
7034 ("component clause not allowed for inherited "
7035 & "component&", CC
, Comp
);
7037 elsif Present
(Component_Clause
(Comp
)) then
7039 -- Diagnose duplicate rep clause, or check consistency
7040 -- if this is an inherited component. In a double fault,
7041 -- there may be a duplicate inconsistent clause for an
7042 -- inherited component.
7044 if Scope
(Original_Record_Component
(Comp
)) = Rectype
7045 or else Parent
(Component_Clause
(Comp
)) = N
7047 Error_Msg_Sloc
:= Sloc
(Component_Clause
(Comp
));
7048 Error_Msg_N
("component clause previously given#", CC
);
7052 Rep1
: constant Node_Id
:= Component_Clause
(Comp
);
7054 if Intval
(Position
(Rep1
)) /=
7055 Intval
(Position
(CC
))
7056 or else Intval
(First_Bit
(Rep1
)) /=
7057 Intval
(First_Bit
(CC
))
7058 or else Intval
(Last_Bit
(Rep1
)) /=
7059 Intval
(Last_Bit
(CC
))
7062 ("component clause inconsistent with "
7063 & "representation of ancestor", CC
);
7065 elsif Warn_On_Redundant_Constructs
then
7067 ("?r?redundant confirming component clause "
7068 & "for component!", CC
);
7073 -- Normal case where this is the first component clause we
7074 -- have seen for this entity, so set it up properly.
7077 -- Make reference for field in record rep clause and set
7078 -- appropriate entity field in the field identifier.
7081 (Comp
, Component_Name
(CC
), Set_Ref
=> False);
7082 Set_Entity
(Component_Name
(CC
), Comp
);
7084 -- Update Fbit and Lbit to the actual bit number
7086 Fbit
:= Fbit
+ UI_From_Int
(SSU
) * Posit
;
7087 Lbit
:= Lbit
+ UI_From_Int
(SSU
) * Posit
;
7089 if Has_Size_Clause
(Rectype
)
7090 and then RM_Size
(Rectype
) <= Lbit
7093 ("bit number out of range of specified size",
7096 Set_Component_Clause
(Comp
, CC
);
7097 Set_Component_Bit_Offset
(Comp
, Fbit
);
7098 Set_Esize
(Comp
, 1 + (Lbit
- Fbit
));
7099 Set_Normalized_First_Bit
(Comp
, Fbit
mod SSU
);
7100 Set_Normalized_Position
(Comp
, Fbit
/ SSU
);
7102 if Warn_On_Overridden_Size
7103 and then Has_Size_Clause
(Etype
(Comp
))
7104 and then RM_Size
(Etype
(Comp
)) /= Esize
(Comp
)
7107 ("?S?component size overrides size clause for&",
7108 Component_Name
(CC
), Etype
(Comp
));
7111 -- This information is also set in the corresponding
7112 -- component of the base type, found by accessing the
7113 -- Original_Record_Component link if it is present.
7115 Ocomp
:= Original_Record_Component
(Comp
);
7122 (Component_Name
(CC
),
7128 (Comp
, First_Node
(CC
), "component clause", Biased
);
7130 if Present
(Ocomp
) then
7131 Set_Component_Clause
(Ocomp
, CC
);
7132 Set_Component_Bit_Offset
(Ocomp
, Fbit
);
7133 Set_Normalized_First_Bit
(Ocomp
, Fbit
mod SSU
);
7134 Set_Normalized_Position
(Ocomp
, Fbit
/ SSU
);
7135 Set_Esize
(Ocomp
, 1 + (Lbit
- Fbit
));
7137 Set_Normalized_Position_Max
7138 (Ocomp
, Normalized_Position
(Ocomp
));
7140 -- Note: we don't use Set_Biased here, because we
7141 -- already gave a warning above if needed, and we
7142 -- would get a duplicate for the same name here.
7144 Set_Has_Biased_Representation
7145 (Ocomp
, Has_Biased_Representation
(Comp
));
7148 if Esize
(Comp
) < 0 then
7149 Error_Msg_N
("component size is negative", CC
);
7160 -- Check missing components if Complete_Representation pragma appeared
7162 if Present
(CR_Pragma
) then
7163 Comp
:= First_Component_Or_Discriminant
(Rectype
);
7164 while Present
(Comp
) loop
7165 if No
(Component_Clause
(Comp
)) then
7167 ("missing component clause for &", CR_Pragma
, Comp
);
7170 Next_Component_Or_Discriminant
(Comp
);
7173 -- Give missing components warning if required
7175 elsif Warn_On_Unrepped_Components
then
7177 Num_Repped_Components
: Nat
:= 0;
7178 Num_Unrepped_Components
: Nat
:= 0;
7181 -- First count number of repped and unrepped components
7183 Comp
:= First_Component_Or_Discriminant
(Rectype
);
7184 while Present
(Comp
) loop
7185 if Present
(Component_Clause
(Comp
)) then
7186 Num_Repped_Components
:= Num_Repped_Components
+ 1;
7188 Num_Unrepped_Components
:= Num_Unrepped_Components
+ 1;
7191 Next_Component_Or_Discriminant
(Comp
);
7194 -- We are only interested in the case where there is at least one
7195 -- unrepped component, and at least half the components have rep
7196 -- clauses. We figure that if less than half have them, then the
7197 -- partial rep clause is really intentional. If the component
7198 -- type has no underlying type set at this point (as for a generic
7199 -- formal type), we don't know enough to give a warning on the
7202 if Num_Unrepped_Components
> 0
7203 and then Num_Unrepped_Components
< Num_Repped_Components
7205 Comp
:= First_Component_Or_Discriminant
(Rectype
);
7206 while Present
(Comp
) loop
7207 if No
(Component_Clause
(Comp
))
7208 and then Comes_From_Source
(Comp
)
7209 and then Present
(Underlying_Type
(Etype
(Comp
)))
7210 and then (Is_Scalar_Type
(Underlying_Type
(Etype
(Comp
)))
7211 or else Size_Known_At_Compile_Time
7212 (Underlying_Type
(Etype
(Comp
))))
7213 and then not Has_Warnings_Off
(Rectype
)
7215 -- Ignore discriminant in unchecked union, since it is
7216 -- not there, and cannot have a component clause.
7218 and then (not Is_Unchecked_Union
(Rectype
)
7219 or else Ekind
(Comp
) /= E_Discriminant
)
7221 Error_Msg_Sloc
:= Sloc
(Comp
);
7223 ("?C?no component clause given for & declared #",
7227 Next_Component_Or_Discriminant
(Comp
);
7232 end Analyze_Record_Representation_Clause
;
7234 -------------------------------------
7235 -- Build_Discrete_Static_Predicate --
7236 -------------------------------------
7238 procedure Build_Discrete_Static_Predicate
7243 Loc
: constant Source_Ptr
:= Sloc
(Expr
);
7245 Non_Static
: exception;
7246 -- Raised if something non-static is found
7248 Btyp
: constant Entity_Id
:= Base_Type
(Typ
);
7250 BLo
: constant Uint
:= Expr_Value
(Type_Low_Bound
(Btyp
));
7251 BHi
: constant Uint
:= Expr_Value
(Type_High_Bound
(Btyp
));
7252 -- Low bound and high bound value of base type of Typ
7256 -- Bounds for constructing the static predicate. We use the bound of the
7257 -- subtype if it is static, otherwise the corresponding base type bound.
7258 -- Note: a non-static subtype can have a static predicate.
7263 -- One entry in a Rlist value, a single REnt (range entry) value denotes
7264 -- one range from Lo to Hi. To represent a single value range Lo = Hi =
7267 type RList
is array (Nat
range <>) of REnt
;
7268 -- A list of ranges. The ranges are sorted in increasing order, and are
7269 -- disjoint (there is a gap of at least one value between each range in
7270 -- the table). A value is in the set of ranges in Rlist if it lies
7271 -- within one of these ranges.
7273 False_Range
: constant RList
:=
7274 RList
'(1 .. 0 => REnt'(No_Uint
, No_Uint
));
7275 -- An empty set of ranges represents a range list that can never be
7276 -- satisfied, since there are no ranges in which the value could lie,
7277 -- so it does not lie in any of them. False_Range is a canonical value
7278 -- for this empty set, but general processing should test for an Rlist
7279 -- with length zero (see Is_False predicate), since other null ranges
7280 -- may appear which must be treated as False.
7282 True_Range
: constant RList
:= RList
'(1 => REnt'(BLo
, BHi
));
7283 -- Range representing True, value must be in the base range
7285 function "and" (Left
: RList
; Right
: RList
) return RList
;
7286 -- And's together two range lists, returning a range list. This is a set
7287 -- intersection operation.
7289 function "or" (Left
: RList
; Right
: RList
) return RList
;
7290 -- Or's together two range lists, returning a range list. This is a set
7293 function "not" (Right
: RList
) return RList
;
7294 -- Returns complement of a given range list, i.e. a range list
7295 -- representing all the values in TLo .. THi that are not in the input
7298 function Build_Val
(V
: Uint
) return Node_Id
;
7299 -- Return an analyzed N_Identifier node referencing this value, suitable
7300 -- for use as an entry in the Static_Discrte_Predicate list. This node
7301 -- is typed with the base type.
7303 function Build_Range
(Lo
: Uint
; Hi
: Uint
) return Node_Id
;
7304 -- Return an analyzed N_Range node referencing this range, suitable for
7305 -- use as an entry in the Static_Discrete_Predicate list. This node is
7306 -- typed with the base type.
7308 function Get_RList
(Exp
: Node_Id
) return RList
;
7309 -- This is a recursive routine that converts the given expression into a
7310 -- list of ranges, suitable for use in building the static predicate.
7312 function Is_False
(R
: RList
) return Boolean;
7313 pragma Inline
(Is_False
);
7314 -- Returns True if the given range list is empty, and thus represents a
7315 -- False list of ranges that can never be satisfied.
7317 function Is_True
(R
: RList
) return Boolean;
7318 -- Returns True if R trivially represents the True predicate by having a
7319 -- single range from BLo to BHi.
7321 function Is_Type_Ref
(N
: Node_Id
) return Boolean;
7322 pragma Inline
(Is_Type_Ref
);
7323 -- Returns if True if N is a reference to the type for the predicate in
7324 -- the expression (i.e. if it is an identifier whose Chars field matches
7325 -- the Nam given in the call). N must not be parenthesized, if the type
7326 -- name appears in parens, this routine will return False.
7328 function Lo_Val
(N
: Node_Id
) return Uint
;
7329 -- Given an entry from a Static_Discrete_Predicate list that is either
7330 -- a static expression or static range, gets either the expression value
7331 -- or the low bound of the range.
7333 function Hi_Val
(N
: Node_Id
) return Uint
;
7334 -- Given an entry from a Static_Discrete_Predicate list that is either
7335 -- a static expression or static range, gets either the expression value
7336 -- or the high bound of the range.
7338 function Membership_Entry
(N
: Node_Id
) return RList
;
7339 -- Given a single membership entry (range, value, or subtype), returns
7340 -- the corresponding range list. Raises Static_Error if not static.
7342 function Membership_Entries
(N
: Node_Id
) return RList
;
7343 -- Given an element on an alternatives list of a membership operation,
7344 -- returns the range list corresponding to this entry and all following
7345 -- entries (i.e. returns the "or" of this list of values).
7347 function Stat_Pred
(Typ
: Entity_Id
) return RList
;
7348 -- Given a type, if it has a static predicate, then return the predicate
7349 -- as a range list, otherwise raise Non_Static.
7355 function "and" (Left
: RList
; Right
: RList
) return RList
is
7357 -- First range of result
7359 SLeft
: Nat
:= Left
'First;
7360 -- Start of rest of left entries
7362 SRight
: Nat
:= Right
'First;
7363 -- Start of rest of right entries
7366 -- If either range is True, return the other
7368 if Is_True
(Left
) then
7370 elsif Is_True
(Right
) then
7374 -- If either range is False, return False
7376 if Is_False
(Left
) or else Is_False
(Right
) then
7380 -- Loop to remove entries at start that are disjoint, and thus just
7381 -- get discarded from the result entirely.
7384 -- If no operands left in either operand, result is false
7386 if SLeft
> Left
'Last or else SRight
> Right
'Last then
7389 -- Discard first left operand entry if disjoint with right
7391 elsif Left
(SLeft
).Hi
< Right
(SRight
).Lo
then
7394 -- Discard first right operand entry if disjoint with left
7396 elsif Right
(SRight
).Hi
< Left
(SLeft
).Lo
then
7397 SRight
:= SRight
+ 1;
7399 -- Otherwise we have an overlapping entry
7406 -- Now we have two non-null operands, and first entries overlap. The
7407 -- first entry in the result will be the overlapping part of these
7410 FEnt
:= REnt
'(Lo => UI_Max (Left (SLeft).Lo, Right (SRight).Lo),
7411 Hi => UI_Min (Left (SLeft).Hi, Right (SRight).Hi));
7413 -- Now we can remove the entry that ended at a lower value, since its
7414 -- contribution is entirely contained in Fent.
7416 if Left (SLeft).Hi <= Right (SRight).Hi then
7419 SRight := SRight + 1;
7422 -- Compute result by concatenating this first entry with the "and" of
7423 -- the remaining parts of the left and right operands. Note that if
7424 -- either of these is empty, "and" will yield empty, so that we will
7425 -- end up with just Fent, which is what we want in that case.
7428 FEnt & (Left (SLeft .. Left'Last) and Right (SRight .. Right'Last));
7435 function "not" (Right : RList) return RList is
7437 -- Return True if False range
7439 if Is_False (Right) then
7443 -- Return False if True range
7445 if Is_True (Right) then
7449 -- Here if not trivial case
7452 Result : RList (1 .. Right'Length + 1);
7453 -- May need one more entry for gap at beginning and end
7456 -- Number of entries stored in Result
7461 if Right (Right'First).Lo > TLo then
7463 Result (Count) := REnt'(TLo
, Right
(Right
'First).Lo
- 1);
7466 -- Gaps between ranges
7468 for J
in Right
'First .. Right
'Last - 1 loop
7470 Result
(Count
) := REnt
'(Right (J).Hi + 1, Right (J + 1).Lo - 1);
7475 if Right (Right'Last).Hi < THi then
7477 Result (Count) := REnt'(Right
(Right
'Last).Hi
+ 1, THi
);
7480 return Result
(1 .. Count
);
7488 function "or" (Left
: RList
; Right
: RList
) return RList
is
7490 -- First range of result
7492 SLeft
: Nat
:= Left
'First;
7493 -- Start of rest of left entries
7495 SRight
: Nat
:= Right
'First;
7496 -- Start of rest of right entries
7499 -- If either range is True, return True
7501 if Is_True
(Left
) or else Is_True
(Right
) then
7505 -- If either range is False (empty), return the other
7507 if Is_False
(Left
) then
7509 elsif Is_False
(Right
) then
7513 -- Initialize result first entry from left or right operand depending
7514 -- on which starts with the lower range.
7516 if Left
(SLeft
).Lo
< Right
(SRight
).Lo
then
7517 FEnt
:= Left
(SLeft
);
7520 FEnt
:= Right
(SRight
);
7521 SRight
:= SRight
+ 1;
7524 -- This loop eats ranges from left and right operands that are
7525 -- contiguous with the first range we are gathering.
7528 -- Eat first entry in left operand if contiguous or overlapped by
7529 -- gathered first operand of result.
7531 if SLeft
<= Left
'Last
7532 and then Left
(SLeft
).Lo
<= FEnt
.Hi
+ 1
7534 FEnt
.Hi
:= UI_Max
(FEnt
.Hi
, Left
(SLeft
).Hi
);
7537 -- Eat first entry in right operand if contiguous or overlapped by
7538 -- gathered right operand of result.
7540 elsif SRight
<= Right
'Last
7541 and then Right
(SRight
).Lo
<= FEnt
.Hi
+ 1
7543 FEnt
.Hi
:= UI_Max
(FEnt
.Hi
, Right
(SRight
).Hi
);
7544 SRight
:= SRight
+ 1;
7546 -- All done if no more entries to eat
7553 -- Obtain result as the first entry we just computed, concatenated
7554 -- to the "or" of the remaining results (if one operand is empty,
7555 -- this will just concatenate with the other
7558 FEnt
& (Left
(SLeft
.. Left
'Last) or Right
(SRight
.. Right
'Last));
7565 function Build_Range
(Lo
: Uint
; Hi
: Uint
) return Node_Id
is
7570 Low_Bound
=> Build_Val
(Lo
),
7571 High_Bound
=> Build_Val
(Hi
));
7572 Set_Etype
(Result
, Btyp
);
7573 Set_Analyzed
(Result
);
7581 function Build_Val
(V
: Uint
) return Node_Id
is
7585 if Is_Enumeration_Type
(Typ
) then
7586 Result
:= Get_Enum_Lit_From_Pos
(Typ
, V
, Loc
);
7588 Result
:= Make_Integer_Literal
(Loc
, V
);
7591 Set_Etype
(Result
, Btyp
);
7592 Set_Is_Static_Expression
(Result
);
7593 Set_Analyzed
(Result
);
7601 function Get_RList
(Exp
: Node_Id
) return RList
is
7606 -- Static expression can only be true or false
7608 if Is_OK_Static_Expression
(Exp
) then
7609 if Expr_Value
(Exp
) = 0 then
7616 -- Otherwise test node type
7627 return Get_RList
(Left_Opnd
(Exp
))
7629 Get_RList
(Right_Opnd
(Exp
));
7636 return Get_RList
(Left_Opnd
(Exp
))
7638 Get_RList
(Right_Opnd
(Exp
));
7643 return not Get_RList
(Right_Opnd
(Exp
));
7645 -- Comparisons of type with static value
7647 when N_Op_Compare
=>
7649 -- Type is left operand
7651 if Is_Type_Ref
(Left_Opnd
(Exp
))
7652 and then Is_OK_Static_Expression
(Right_Opnd
(Exp
))
7654 Val
:= Expr_Value
(Right_Opnd
(Exp
));
7656 -- Typ is right operand
7658 elsif Is_Type_Ref
(Right_Opnd
(Exp
))
7659 and then Is_OK_Static_Expression
(Left_Opnd
(Exp
))
7661 Val
:= Expr_Value
(Left_Opnd
(Exp
));
7663 -- Invert sense of comparison
7666 when N_Op_Gt
=> Op
:= N_Op_Lt
;
7667 when N_Op_Lt
=> Op
:= N_Op_Gt
;
7668 when N_Op_Ge
=> Op
:= N_Op_Le
;
7669 when N_Op_Le
=> Op
:= N_Op_Ge
;
7670 when others => null;
7673 -- Other cases are non-static
7679 -- Construct range according to comparison operation
7683 return RList
'(1 => REnt'(Val
, Val
));
7686 return RList
'(1 => REnt'(Val
, BHi
));
7689 return RList
'(1 => REnt'(Val
+ 1, BHi
));
7692 return RList
'(1 => REnt'(BLo
, Val
));
7695 return RList
'(1 => REnt'(BLo
, Val
- 1));
7698 return RList
'(REnt'(BLo
, Val
- 1), REnt
'(Val + 1, BHi));
7701 raise Program_Error;
7707 if not Is_Type_Ref (Left_Opnd (Exp)) then
7711 if Present (Right_Opnd (Exp)) then
7712 return Membership_Entry (Right_Opnd (Exp));
7714 return Membership_Entries (First (Alternatives (Exp)));
7717 -- Negative membership (NOT IN)
7720 if not Is_Type_Ref (Left_Opnd (Exp)) then
7724 if Present (Right_Opnd (Exp)) then
7725 return not Membership_Entry (Right_Opnd (Exp));
7727 return not Membership_Entries (First (Alternatives (Exp)));
7730 -- Function call, may be call to static predicate
7732 when N_Function_Call =>
7733 if Is_Entity_Name (Name (Exp)) then
7735 Ent : constant Entity_Id := Entity (Name (Exp));
7737 if Is_Predicate_Function (Ent)
7739 Is_Predicate_Function_M (Ent)
7741 return Stat_Pred (Etype (First_Formal (Ent)));
7746 -- Other function call cases are non-static
7750 -- Qualified expression, dig out the expression
7752 when N_Qualified_Expression =>
7753 return Get_RList (Expression (Exp));
7755 when N_Case_Expression =>
7762 if not Is_Entity_Name (Expression (Expr))
7763 or else Etype (Expression (Expr)) /= Typ
7766 ("expression must denaote subtype", Expression (Expr));
7770 -- Collect discrete choices in all True alternatives
7772 Choices := New_List;
7773 Alt := First (Alternatives (Exp));
7774 while Present (Alt) loop
7775 Dep := Expression (Alt);
7777 if not Is_OK_Static_Expression (Dep) then
7780 elsif Is_True (Expr_Value (Dep)) then
7781 Append_List_To (Choices,
7782 New_Copy_List (Discrete_Choices (Alt)));
7788 return Membership_Entries (First (Choices));
7791 -- Expression with actions: if no actions, dig out expression
7793 when N_Expression_With_Actions =>
7794 if Is_Empty_List (Actions (Exp)) then
7795 return Get_RList (Expression (Exp));
7803 return (Get_RList (Left_Opnd (Exp))
7804 and not Get_RList (Right_Opnd (Exp)))
7805 or (Get_RList (Right_Opnd (Exp))
7806 and not Get_RList (Left_Opnd (Exp)));
7808 -- Any other node type is non-static
7819 function Hi_Val (N : Node_Id) return Uint is
7821 if Is_OK_Static_Expression (N) then
7822 return Expr_Value (N);
7824 pragma Assert (Nkind (N) = N_Range);
7825 return Expr_Value (High_Bound (N));
7833 function Is_False (R : RList) return Boolean is
7835 return R'Length = 0;
7842 function Is_True (R : RList) return Boolean is
7845 and then R (R'First).Lo = BLo
7846 and then R (R'First).Hi = BHi;
7853 function Is_Type_Ref (N : Node_Id) return Boolean is
7855 return Nkind (N) = N_Identifier
7856 and then Chars (N) = Nam
7857 and then Paren_Count (N) = 0;
7864 function Lo_Val (N : Node_Id) return Uint is
7866 if Is_OK_Static_Expression (N) then
7867 return Expr_Value (N);
7869 pragma Assert (Nkind (N) = N_Range);
7870 return Expr_Value (Low_Bound (N));
7874 ------------------------
7875 -- Membership_Entries --
7876 ------------------------
7878 function Membership_Entries (N : Node_Id) return RList is
7880 if No (Next (N)) then
7881 return Membership_Entry (N);
7883 return Membership_Entry (N) or Membership_Entries (Next (N));
7885 end Membership_Entries;
7887 ----------------------
7888 -- Membership_Entry --
7889 ----------------------
7891 function Membership_Entry (N : Node_Id) return RList is
7899 if Nkind (N) = N_Range then
7900 if not Is_OK_Static_Expression (Low_Bound (N))
7902 not Is_OK_Static_Expression (High_Bound (N))
7906 SLo := Expr_Value (Low_Bound (N));
7907 SHi := Expr_Value (High_Bound (N));
7908 return RList'(1 => REnt
'(SLo, SHi));
7911 -- Static expression case
7913 elsif Is_OK_Static_Expression (N) then
7914 Val := Expr_Value (N);
7915 return RList'(1 => REnt
'(Val, Val));
7917 -- Identifier (other than static expression) case
7919 else pragma Assert (Nkind (N) = N_Identifier);
7923 if Is_Type (Entity (N)) then
7925 -- If type has predicates, process them
7927 if Has_Predicates (Entity (N)) then
7928 return Stat_Pred (Entity (N));
7930 -- For static subtype without predicates, get range
7932 elsif Is_OK_Static_Subtype (Entity (N)) then
7933 SLo := Expr_Value (Type_Low_Bound (Entity (N)));
7934 SHi := Expr_Value (Type_High_Bound (Entity (N)));
7935 return RList'(1 => REnt
'(SLo, SHi));
7937 -- Any other type makes us non-static
7943 -- Any other kind of identifier in predicate (e.g. a non-static
7944 -- expression value) means this is not a static predicate.
7950 end Membership_Entry;
7956 function Stat_Pred (Typ : Entity_Id) return RList is
7958 -- Not static if type does not have static predicates
7960 if not Has_Static_Predicate (Typ) then
7964 -- Otherwise we convert the predicate list to a range list
7967 Spred : constant List_Id := Static_Discrete_Predicate (Typ);
7968 Result : RList (1 .. List_Length (Spred));
7972 P := First (Static_Discrete_Predicate (Typ));
7973 for J in Result'Range loop
7974 Result (J) := REnt'(Lo_Val
(P
), Hi_Val
(P
));
7982 -- Start of processing for Build_Discrete_Static_Predicate
7985 -- Establish bounds for the predicate
7987 if Compile_Time_Known_Value
(Type_Low_Bound
(Typ
)) then
7988 TLo
:= Expr_Value
(Type_Low_Bound
(Typ
));
7993 if Compile_Time_Known_Value
(Type_High_Bound
(Typ
)) then
7994 THi
:= Expr_Value
(Type_High_Bound
(Typ
));
7999 -- Analyze the expression to see if it is a static predicate
8002 Ranges
: constant RList
:= Get_RList
(Expr
);
8003 -- Range list from expression if it is static
8008 -- Convert range list into a form for the static predicate. In the
8009 -- Ranges array, we just have raw ranges, these must be converted
8010 -- to properly typed and analyzed static expressions or range nodes.
8012 -- Note: here we limit ranges to the ranges of the subtype, so that
8013 -- a predicate is always false for values outside the subtype. That
8014 -- seems fine, such values are invalid anyway, and considering them
8015 -- to fail the predicate seems allowed and friendly, and furthermore
8016 -- simplifies processing for case statements and loops.
8020 for J
in Ranges
'Range loop
8022 Lo
: Uint
:= Ranges
(J
).Lo
;
8023 Hi
: Uint
:= Ranges
(J
).Hi
;
8026 -- Ignore completely out of range entry
8028 if Hi
< TLo
or else Lo
> THi
then
8031 -- Otherwise process entry
8034 -- Adjust out of range value to subtype range
8044 -- Convert range into required form
8046 Append_To
(Plist
, Build_Range
(Lo
, Hi
));
8051 -- Processing was successful and all entries were static, so now we
8052 -- can store the result as the predicate list.
8054 Set_Static_Discrete_Predicate
(Typ
, Plist
);
8056 -- The processing for static predicates put the expression into
8057 -- canonical form as a series of ranges. It also eliminated
8058 -- duplicates and collapsed and combined ranges. We might as well
8059 -- replace the alternatives list of the right operand of the
8060 -- membership test with the static predicate list, which will
8061 -- usually be more efficient.
8064 New_Alts
: constant List_Id
:= New_List
;
8069 Old_Node
:= First
(Plist
);
8070 while Present
(Old_Node
) loop
8071 New_Node
:= New_Copy
(Old_Node
);
8073 if Nkind
(New_Node
) = N_Range
then
8074 Set_Low_Bound
(New_Node
, New_Copy
(Low_Bound
(Old_Node
)));
8075 Set_High_Bound
(New_Node
, New_Copy
(High_Bound
(Old_Node
)));
8078 Append_To
(New_Alts
, New_Node
);
8082 -- If empty list, replace by False
8084 if Is_Empty_List
(New_Alts
) then
8085 Rewrite
(Expr
, New_Occurrence_Of
(Standard_False
, Loc
));
8087 -- Else replace by set membership test
8092 Left_Opnd
=> Make_Identifier
(Loc
, Nam
),
8093 Right_Opnd
=> Empty
,
8094 Alternatives
=> New_Alts
));
8096 -- Resolve new expression in function context
8098 Install_Formals
(Predicate_Function
(Typ
));
8099 Push_Scope
(Predicate_Function
(Typ
));
8100 Analyze_And_Resolve
(Expr
, Standard_Boolean
);
8106 -- If non-static, return doing nothing
8111 end Build_Discrete_Static_Predicate
;
8113 --------------------------------
8114 -- Build_Export_Import_Pragma --
8115 --------------------------------
8117 function Build_Export_Import_Pragma
8119 Id
: Entity_Id
) return Node_Id
8121 Asp_Id
: constant Aspect_Id
:= Get_Aspect_Id
(Asp
);
8122 Expr
: constant Node_Id
:= Expression
(Asp
);
8123 Loc
: constant Source_Ptr
:= Sloc
(Asp
);
8134 Create_Pragma
: Boolean := False;
8135 -- This flag is set when the aspect form is such that it warrants the
8136 -- creation of a corresponding pragma.
8139 if Present
(Expr
) then
8140 if Error_Posted
(Expr
) then
8143 elsif Is_True
(Expr_Value
(Expr
)) then
8144 Create_Pragma
:= True;
8147 -- Otherwise the aspect defaults to True
8150 Create_Pragma
:= True;
8153 -- Nothing to do when the expression is False or is erroneous
8155 if not Create_Pragma
then
8159 -- Obtain all interfacing aspects that apply to the related entity
8161 Get_Interfacing_Aspects
8165 Expo_Asp
=> Dummy_1
,
8171 -- Handle the convention argument
8173 if Present
(Conv
) then
8174 Conv_Arg
:= New_Copy_Tree
(Expression
(Conv
));
8176 -- Assume convention "Ada' when aspect Convention is missing
8179 Conv_Arg
:= Make_Identifier
(Loc
, Name_Ada
);
8183 Make_Pragma_Argument_Association
(Loc
,
8184 Chars
=> Name_Convention
,
8185 Expression
=> Conv_Arg
));
8187 -- Handle the entity argument
8190 Make_Pragma_Argument_Association
(Loc
,
8191 Chars
=> Name_Entity
,
8192 Expression
=> New_Occurrence_Of
(Id
, Loc
)));
8194 -- Handle the External_Name argument
8196 if Present
(EN
) then
8198 Make_Pragma_Argument_Association
(Loc
,
8199 Chars
=> Name_External_Name
,
8200 Expression
=> New_Copy_Tree
(Expression
(EN
))));
8203 -- Handle the Link_Name argument
8205 if Present
(LN
) then
8207 Make_Pragma_Argument_Association
(Loc
,
8208 Chars
=> Name_Link_Name
,
8209 Expression
=> New_Copy_Tree
(Expression
(LN
))));
8213 -- pragma Export/Import
8214 -- (Convention => <Conv>/Ada,
8216 -- [External_Name => <EN>,]
8217 -- [Link_Name => <LN>]);
8221 Pragma_Identifier
=>
8222 Make_Identifier
(Loc
, Chars
(Identifier
(Asp
))),
8223 Pragma_Argument_Associations
=> Args
);
8225 -- Decorate the relevant aspect and the pragma
8227 Set_Aspect_Rep_Item
(Asp
, Prag
);
8229 Set_Corresponding_Aspect
(Prag
, Asp
);
8230 Set_From_Aspect_Specification
(Prag
);
8231 Set_Parent
(Prag
, Asp
);
8233 if Asp_Id
= Aspect_Import
and then Is_Subprogram
(Id
) then
8234 Set_Import_Pragma
(Id
, Prag
);
8238 end Build_Export_Import_Pragma
;
8240 -------------------------------
8241 -- Build_Predicate_Functions --
8242 -------------------------------
8244 -- The procedures that are constructed here have the form:
8246 -- function typPredicate (Ixxx : typ) return Boolean is
8249 -- typ1Predicate (typ1 (Ixxx))
8250 -- and then typ2Predicate (typ2 (Ixxx))
8252 -- exp1 and then exp2 and then ...
8253 -- end typPredicate;
8255 -- Here exp1, and exp2 are expressions from Predicate pragmas. Note that
8256 -- this is the point at which these expressions get analyzed, providing the
8257 -- required delay, and typ1, typ2, are entities from which predicates are
8258 -- inherited. Note that we do NOT generate Check pragmas, that's because we
8259 -- use this function even if checks are off, e.g. for membership tests.
8261 -- Note that the inherited predicates are evaluated first, as required by
8264 -- Note that Sem_Eval.Real_Or_String_Static_Predicate_Matches depends on
8265 -- the form of this return expression.
8267 -- If the expression has at least one Raise_Expression, then we also build
8268 -- the typPredicateM version of the function, in which any occurrence of a
8269 -- Raise_Expression is converted to "return False".
8271 -- WARNING: This routine manages Ghost regions. Return statements must be
8272 -- replaced by gotos which jump to the end of the routine and restore the
8275 procedure Build_Predicate_Functions
(Typ
: Entity_Id
; N
: Node_Id
) is
8276 Loc
: constant Source_Ptr
:= Sloc
(Typ
);
8279 -- This is the expression for the result of the function. It is
8280 -- is build by connecting the component predicates with AND THEN.
8283 -- This is the corresponding return expression for the Predicate_M
8284 -- function. It differs in that raise expressions are marked for
8285 -- special expansion (see Process_REs).
8287 Object_Name
: Name_Id
;
8288 -- Name for argument of Predicate procedure. Note that we use the same
8289 -- name for both predicate functions. That way the reference within the
8290 -- predicate expression is the same in both functions.
8292 Object_Entity
: Entity_Id
;
8293 -- Entity for argument of Predicate procedure
8295 Object_Entity_M
: Entity_Id
;
8296 -- Entity for argument of separate Predicate procedure when exceptions
8297 -- are present in expression.
8300 -- The function declaration
8305 Raise_Expression_Present
: Boolean := False;
8306 -- Set True if Expr has at least one Raise_Expression
8308 procedure Add_Condition
(Cond
: Node_Id
);
8309 -- Append Cond to Expr using "and then" (or just copy Cond to Expr if
8312 procedure Add_Predicates
;
8313 -- Appends expressions for any Predicate pragmas in the rep item chain
8314 -- Typ to Expr. Note that we look only at items for this exact entity.
8315 -- Inheritance of predicates for the parent type is done by calling the
8316 -- Predicate_Function of the parent type, using Add_Call above.
8318 procedure Add_Call
(T
: Entity_Id
);
8319 -- Includes a call to the predicate function for type T in Expr if T
8320 -- has predicates and Predicate_Function (T) is non-empty.
8322 function Process_RE
(N
: Node_Id
) return Traverse_Result
;
8323 -- Used in Process REs, tests if node N is a raise expression, and if
8324 -- so, marks it to be converted to return False.
8326 procedure Process_REs
is new Traverse_Proc
(Process_RE
);
8327 -- Marks any raise expressions in Expr_M to return False
8329 function Test_RE
(N
: Node_Id
) return Traverse_Result
;
8330 -- Used in Test_REs, tests one node for being a raise expression, and if
8331 -- so sets Raise_Expression_Present True.
8333 procedure Test_REs
is new Traverse_Proc
(Test_RE
);
8334 -- Tests to see if Expr contains any raise expressions
8340 procedure Add_Call
(T
: Entity_Id
) is
8344 if Present
(T
) and then Present
(Predicate_Function
(T
)) then
8345 Set_Has_Predicates
(Typ
);
8347 -- Build the call to the predicate function of T. The type may be
8348 -- derived, so use an unchecked conversion for the actual.
8354 Unchecked_Convert_To
(T
,
8355 Make_Identifier
(Loc
, Object_Name
)));
8357 -- "and"-in the call to evolving expression
8359 Add_Condition
(Exp
);
8361 -- Output info message on inheritance if required. Note we do not
8362 -- give this information for generic actual types, since it is
8363 -- unwelcome noise in that case in instantiations. We also
8364 -- generally suppress the message in instantiations, and also
8365 -- if it involves internal names.
8367 if Opt
.List_Inherited_Aspects
8368 and then not Is_Generic_Actual_Type
(Typ
)
8369 and then Instantiation_Depth
(Sloc
(Typ
)) = 0
8370 and then not Is_Internal_Name
(Chars
(T
))
8371 and then not Is_Internal_Name
(Chars
(Typ
))
8373 Error_Msg_Sloc
:= Sloc
(Predicate_Function
(T
));
8374 Error_Msg_Node_2
:= T
;
8375 Error_Msg_N
("info: & inherits predicate from & #?L?", Typ
);
8384 procedure Add_Condition
(Cond
: Node_Id
) is
8386 -- This is the first predicate expression
8391 -- Otherwise concatenate to the existing predicate expressions by
8392 -- using "and then".
8397 Left_Opnd
=> Relocate_Node
(Expr
),
8398 Right_Opnd
=> Cond
);
8402 --------------------
8403 -- Add_Predicates --
8404 --------------------
8406 procedure Add_Predicates
is
8407 procedure Add_Predicate
(Prag
: Node_Id
);
8408 -- Concatenate the expression of predicate pragma Prag to Expr by
8409 -- using a short circuit "and then" operator.
8415 procedure Add_Predicate
(Prag
: Node_Id
) is
8416 procedure Replace_Type_Reference
(N
: Node_Id
);
8417 -- Replace a single occurrence N of the subtype name with a
8418 -- reference to the formal of the predicate function. N can be an
8419 -- identifier referencing the subtype, or a selected component,
8420 -- representing an appropriately qualified occurrence of the
8423 procedure Replace_Type_References
is
8424 new Replace_Type_References_Generic
(Replace_Type_Reference
);
8425 -- Traverse an expression changing every occurrence of an
8426 -- identifier whose name matches the name of the subtype with a
8427 -- reference to the formal parameter of the predicate function.
8429 ----------------------------
8430 -- Replace_Type_Reference --
8431 ----------------------------
8433 procedure Replace_Type_Reference
(N
: Node_Id
) is
8435 Rewrite
(N
, Make_Identifier
(Sloc
(N
), Object_Name
));
8436 -- Use the Sloc of the usage name, not the defining name
8439 Set_Entity
(N
, Object_Entity
);
8441 -- We want to treat the node as if it comes from source, so
8442 -- that ASIS will not ignore it.
8444 Set_Comes_From_Source
(N
, True);
8445 end Replace_Type_Reference
;
8449 Asp
: constant Node_Id
:= Corresponding_Aspect
(Prag
);
8453 -- Start of processing for Add_Predicate
8456 -- Mark corresponding SCO as enabled
8458 Set_SCO_Pragma_Enabled
(Sloc
(Prag
));
8460 -- Extract the arguments of the pragma. The expression itself
8461 -- is copied for use in the predicate function, to preserve the
8462 -- original version for ASIS use.
8464 Arg1
:= First
(Pragma_Argument_Associations
(Prag
));
8465 Arg2
:= Next
(Arg1
);
8467 Arg1
:= Get_Pragma_Arg
(Arg1
);
8468 Arg2
:= New_Copy_Tree
(Get_Pragma_Arg
(Arg2
));
8470 -- When the predicate pragma applies to the current type or its
8471 -- full view, replace all occurrences of the subtype name with
8472 -- references to the formal parameter of the predicate function.
8474 if Entity
(Arg1
) = Typ
8475 or else Full_View
(Entity
(Arg1
)) = Typ
8477 Replace_Type_References
(Arg2
, Typ
);
8479 -- If the predicate pragma comes from an aspect, replace the
8480 -- saved expression because we need the subtype references
8481 -- replaced for the calls to Preanalyze_Spec_Expression in
8482 -- Check_Aspect_At_xxx routines.
8484 if Present
(Asp
) then
8485 Set_Entity
(Identifier
(Asp
), New_Copy_Tree
(Arg2
));
8488 -- "and"-in the Arg2 condition to evolving expression
8490 Add_Condition
(Relocate_Node
(Arg2
));
8498 -- Start of processing for Add_Predicates
8501 Ritem
:= First_Rep_Item
(Typ
);
8503 -- If the type is private, check whether full view has inherited
8506 if Is_Private_Type
(Typ
) and then No
(Ritem
) then
8507 Ritem
:= First_Rep_Item
(Full_View
(Typ
));
8510 while Present
(Ritem
) loop
8511 if Nkind
(Ritem
) = N_Pragma
8512 and then Pragma_Name
(Ritem
) = Name_Predicate
8514 Add_Predicate
(Ritem
);
8516 -- If the type is declared in an inner package it may be frozen
8517 -- outside of the package, and the generated pragma has not been
8518 -- analyzed yet, so capture the expression for the predicate
8519 -- function at this point.
8521 elsif Nkind
(Ritem
) = N_Aspect_Specification
8522 and then Present
(Aspect_Rep_Item
(Ritem
))
8523 and then Scope
(Typ
) /= Current_Scope
8526 Prag
: constant Node_Id
:= Aspect_Rep_Item
(Ritem
);
8529 if Nkind
(Prag
) = N_Pragma
8530 and then Pragma_Name
(Prag
) = Name_Predicate
8532 Add_Predicate
(Prag
);
8537 Next_Rep_Item
(Ritem
);
8545 function Process_RE
(N
: Node_Id
) return Traverse_Result
is
8547 if Nkind
(N
) = N_Raise_Expression
then
8548 Set_Convert_To_Return_False
(N
);
8559 function Test_RE
(N
: Node_Id
) return Traverse_Result
is
8561 if Nkind
(N
) = N_Raise_Expression
then
8562 Raise_Expression_Present
:= True;
8571 Saved_GM
: constant Ghost_Mode_Type
:= Ghost_Mode
;
8572 -- Save the Ghost mode to restore on exit
8574 -- Start of processing for Build_Predicate_Functions
8577 -- Return if already built or if type does not have predicates
8579 SId
:= Predicate_Function
(Typ
);
8580 if not Has_Predicates
(Typ
)
8581 or else (Present
(SId
) and then Has_Completion
(SId
))
8586 -- The related type may be subject to pragma Ghost. Set the mode now to
8587 -- ensure that the predicate functions are properly marked as Ghost.
8589 Set_Ghost_Mode
(Typ
);
8591 -- Prepare to construct predicate expression
8595 if Present
(SId
) then
8596 FDecl
:= Unit_Declaration_Node
(SId
);
8599 FDecl
:= Build_Predicate_Function_Declaration
(Typ
);
8600 SId
:= Defining_Entity
(FDecl
);
8603 -- Recover name of formal parameter of function that replaces references
8604 -- to the type in predicate expressions.
8608 (First
(Parameter_Specifications
(Specification
(FDecl
))));
8610 Object_Name
:= Chars
(Object_Entity
);
8611 Object_Entity_M
:= Make_Defining_Identifier
(Loc
, Chars
=> Object_Name
);
8613 -- Add predicates for ancestor if present. These must come before the
8614 -- ones for the current type, as required by AI12-0071-1.
8619 Atyp
:= Nearest_Ancestor
(Typ
);
8621 -- The type may be private but the full view may inherit predicates
8623 if No
(Atyp
) and then Is_Private_Type
(Typ
) then
8624 Atyp
:= Nearest_Ancestor
(Full_View
(Typ
));
8627 if Present
(Atyp
) then
8632 -- Add Predicates for the current type
8636 -- Case where predicates are present
8638 if Present
(Expr
) then
8640 -- Test for raise expression present
8644 -- If raise expression is present, capture a copy of Expr for use
8645 -- in building the predicateM function version later on. For this
8646 -- copy we replace references to Object_Entity by Object_Entity_M.
8648 if Raise_Expression_Present
then
8650 Map
: constant Elist_Id
:= New_Elmt_List
;
8651 New_V
: Entity_Id
:= Empty
;
8653 -- The unanalyzed expression will be copied and appear in
8654 -- both functions. Normally expressions do not declare new
8655 -- entities, but quantified expressions do, so we need to
8656 -- create new entities for their bound variables, to prevent
8657 -- multiple definitions in gigi.
8659 function Reset_Loop_Variable
(N
: Node_Id
)
8660 return Traverse_Result
;
8662 procedure Collect_Loop_Variables
is
8663 new Traverse_Proc
(Reset_Loop_Variable
);
8665 ------------------------
8666 -- Reset_Loop_Variable --
8667 ------------------------
8669 function Reset_Loop_Variable
(N
: Node_Id
)
8670 return Traverse_Result
8673 if Nkind
(N
) = N_Iterator_Specification
then
8674 New_V
:= Make_Defining_Identifier
8675 (Sloc
(N
), Chars
(Defining_Identifier
(N
)));
8677 Set_Defining_Identifier
(N
, New_V
);
8681 end Reset_Loop_Variable
;
8684 Append_Elmt
(Object_Entity
, Map
);
8685 Append_Elmt
(Object_Entity_M
, Map
);
8686 Expr_M
:= New_Copy_Tree
(Expr
, Map
=> Map
);
8687 Collect_Loop_Variables
(Expr_M
);
8691 -- Build the main predicate function
8694 SIdB
: constant Entity_Id
:=
8695 Make_Defining_Identifier
(Loc
,
8696 Chars
=> New_External_Name
(Chars
(Typ
), "Predicate"));
8697 -- The entity for the function body
8703 -- The predicate function is shared between views of a type
8705 if Is_Private_Type
(Typ
) and then Present
(Full_View
(Typ
)) then
8706 Set_Predicate_Function
(Full_View
(Typ
), SId
);
8709 -- Build function body
8712 Make_Function_Specification
(Loc
,
8713 Defining_Unit_Name
=> SIdB
,
8714 Parameter_Specifications
=> New_List
(
8715 Make_Parameter_Specification
(Loc
,
8716 Defining_Identifier
=>
8717 Make_Defining_Identifier
(Loc
, Object_Name
),
8719 New_Occurrence_Of
(Typ
, Loc
))),
8720 Result_Definition
=>
8721 New_Occurrence_Of
(Standard_Boolean
, Loc
));
8724 Make_Subprogram_Body
(Loc
,
8725 Specification
=> Spec
,
8726 Declarations
=> Empty_List
,
8727 Handled_Statement_Sequence
=>
8728 Make_Handled_Sequence_Of_Statements
(Loc
,
8729 Statements
=> New_List
(
8730 Make_Simple_Return_Statement
(Loc
,
8731 Expression
=> Expr
))));
8733 -- If declaration has not been analyzed yet, Insert declaration
8734 -- before freeze node. Insert body itself after freeze node.
8736 if not Analyzed
(FDecl
) then
8737 Insert_Before_And_Analyze
(N
, FDecl
);
8740 Insert_After_And_Analyze
(N
, FBody
);
8742 -- Static predicate functions are always side-effect free, and
8743 -- in most cases dynamic predicate functions are as well. Mark
8744 -- them as such whenever possible, so redundant predicate checks
8745 -- can be optimized. If there is a variable reference within the
8746 -- expression, the function is not pure.
8748 if Expander_Active
then
8750 Side_Effect_Free
(Expr
, Variable_Ref
=> True));
8751 Set_Is_Inlined
(SId
);
8755 -- Test for raise expressions present and if so build M version
8757 if Raise_Expression_Present
then
8759 SId
: constant Entity_Id
:=
8760 Make_Defining_Identifier
(Loc
,
8761 Chars
=> New_External_Name
(Chars
(Typ
), "PredicateM"));
8762 -- The entity for the function spec
8764 SIdB
: constant Entity_Id
:=
8765 Make_Defining_Identifier
(Loc
,
8766 Chars
=> New_External_Name
(Chars
(Typ
), "PredicateM"));
8767 -- The entity for the function body
8775 -- Mark any raise expressions for special expansion
8777 Process_REs
(Expr_M
);
8779 -- Build function declaration
8781 Set_Ekind
(SId
, E_Function
);
8782 Set_Is_Predicate_Function_M
(SId
);
8783 Set_Predicate_Function_M
(Typ
, SId
);
8785 -- The predicate function is shared between views of a type
8787 if Is_Private_Type
(Typ
) and then Present
(Full_View
(Typ
)) then
8788 Set_Predicate_Function_M
(Full_View
(Typ
), SId
);
8792 Make_Function_Specification
(Loc
,
8793 Defining_Unit_Name
=> SId
,
8794 Parameter_Specifications
=> New_List
(
8795 Make_Parameter_Specification
(Loc
,
8796 Defining_Identifier
=> Object_Entity_M
,
8797 Parameter_Type
=> New_Occurrence_Of
(Typ
, Loc
))),
8798 Result_Definition
=>
8799 New_Occurrence_Of
(Standard_Boolean
, Loc
));
8802 Make_Subprogram_Declaration
(Loc
,
8803 Specification
=> Spec
);
8805 -- Build function body
8808 Make_Function_Specification
(Loc
,
8809 Defining_Unit_Name
=> SIdB
,
8810 Parameter_Specifications
=> New_List
(
8811 Make_Parameter_Specification
(Loc
,
8812 Defining_Identifier
=>
8813 Make_Defining_Identifier
(Loc
, Object_Name
),
8815 New_Occurrence_Of
(Typ
, Loc
))),
8816 Result_Definition
=>
8817 New_Occurrence_Of
(Standard_Boolean
, Loc
));
8819 -- Build the body, we declare the boolean expression before
8820 -- doing the return, because we are not really confident of
8821 -- what happens if a return appears within a return.
8824 Make_Defining_Identifier
(Loc
,
8825 Chars
=> New_Internal_Name
('B'));
8828 Make_Subprogram_Body
(Loc
,
8829 Specification
=> Spec
,
8831 Declarations
=> New_List
(
8832 Make_Object_Declaration
(Loc
,
8833 Defining_Identifier
=> BTemp
,
8834 Constant_Present
=> True,
8835 Object_Definition
=>
8836 New_Occurrence_Of
(Standard_Boolean
, Loc
),
8837 Expression
=> Expr_M
)),
8839 Handled_Statement_Sequence
=>
8840 Make_Handled_Sequence_Of_Statements
(Loc
,
8841 Statements
=> New_List
(
8842 Make_Simple_Return_Statement
(Loc
,
8843 Expression
=> New_Occurrence_Of
(BTemp
, Loc
)))));
8845 -- Insert declaration before freeze node and body after
8847 Insert_Before_And_Analyze
(N
, FDecl
);
8848 Insert_After_And_Analyze
(N
, FBody
);
8852 -- See if we have a static predicate. Note that the answer may be
8853 -- yes even if we have an explicit Dynamic_Predicate present.
8860 if not Is_Scalar_Type
(Typ
) and then not Is_String_Type
(Typ
) then
8863 PS
:= Is_Predicate_Static
(Expr
, Object_Name
);
8866 -- Case where we have a predicate-static aspect
8870 -- We don't set Has_Static_Predicate_Aspect, since we can have
8871 -- any of the three cases (Predicate, Dynamic_Predicate, or
8872 -- Static_Predicate) generating a predicate with an expression
8873 -- that is predicate-static. We just indicate that we have a
8874 -- predicate that can be treated as static.
8876 Set_Has_Static_Predicate
(Typ
);
8878 -- For discrete subtype, build the static predicate list
8880 if Is_Discrete_Type
(Typ
) then
8881 Build_Discrete_Static_Predicate
(Typ
, Expr
, Object_Name
);
8883 -- If we don't get a static predicate list, it means that we
8884 -- have a case where this is not possible, most typically in
8885 -- the case where we inherit a dynamic predicate. We do not
8886 -- consider this an error, we just leave the predicate as
8887 -- dynamic. But if we do succeed in building the list, then
8888 -- we mark the predicate as static.
8890 if No
(Static_Discrete_Predicate
(Typ
)) then
8891 Set_Has_Static_Predicate
(Typ
, False);
8894 -- For real or string subtype, save predicate expression
8896 elsif Is_Real_Type
(Typ
) or else Is_String_Type
(Typ
) then
8897 Set_Static_Real_Or_String_Predicate
(Typ
, Expr
);
8900 -- Case of dynamic predicate (expression is not predicate-static)
8903 -- Again, we don't set Has_Dynamic_Predicate_Aspect, since that
8904 -- is only set if we have an explicit Dynamic_Predicate aspect
8905 -- given. Here we may simply have a Predicate aspect where the
8906 -- expression happens not to be predicate-static.
8908 -- Emit an error when the predicate is categorized as static
8909 -- but its expression is not predicate-static.
8911 -- First a little fiddling to get a nice location for the
8912 -- message. If the expression is of the form (A and then B),
8913 -- where A is an inherited predicate, then use the right
8914 -- operand for the Sloc. This avoids getting confused by a call
8915 -- to an inherited predicate with a less convenient source
8919 while Nkind
(EN
) = N_And_Then
8920 and then Nkind
(Left_Opnd
(EN
)) = N_Function_Call
8921 and then Is_Predicate_Function
8922 (Entity
(Name
(Left_Opnd
(EN
))))
8924 EN
:= Right_Opnd
(EN
);
8927 -- Now post appropriate message
8929 if Has_Static_Predicate_Aspect
(Typ
) then
8930 if Is_Scalar_Type
(Typ
) or else Is_String_Type
(Typ
) then
8932 ("expression is not predicate-static (RM 3.2.4(16-22))",
8936 ("static predicate requires scalar or string type", EN
);
8943 Restore_Ghost_Mode
(Saved_GM
);
8944 end Build_Predicate_Functions
;
8946 ------------------------------------------
8947 -- Build_Predicate_Function_Declaration --
8948 ------------------------------------------
8950 -- WARNING: This routine manages Ghost regions. Return statements must be
8951 -- replaced by gotos which jump to the end of the routine and restore the
8954 function Build_Predicate_Function_Declaration
8955 (Typ
: Entity_Id
) return Node_Id
8957 Loc
: constant Source_Ptr
:= Sloc
(Typ
);
8959 Saved_GM
: constant Ghost_Mode_Type
:= Ghost_Mode
;
8960 -- Save the Ghost mode to restore on exit
8962 Func_Decl
: Node_Id
;
8963 Func_Id
: Entity_Id
;
8967 -- The related type may be subject to pragma Ghost. Set the mode now to
8968 -- ensure that the predicate functions are properly marked as Ghost.
8970 Set_Ghost_Mode
(Typ
);
8973 Make_Defining_Identifier
(Loc
,
8974 Chars
=> New_External_Name
(Chars
(Typ
), "Predicate"));
8976 -- The predicate function requires debug info when the predicates are
8977 -- subject to Source Coverage Obligations.
8979 if Opt
.Generate_SCO
then
8980 Set_Debug_Info_Needed
(Func_Id
);
8984 Make_Function_Specification
(Loc
,
8985 Defining_Unit_Name
=> Func_Id
,
8986 Parameter_Specifications
=> New_List
(
8987 Make_Parameter_Specification
(Loc
,
8988 Defining_Identifier
=> Make_Temporary
(Loc
, 'I'),
8989 Parameter_Type
=> New_Occurrence_Of
(Typ
, Loc
))),
8990 Result_Definition
=>
8991 New_Occurrence_Of
(Standard_Boolean
, Loc
));
8993 Func_Decl
:= Make_Subprogram_Declaration
(Loc
, Specification
=> Spec
);
8995 Set_Ekind
(Func_Id
, E_Function
);
8996 Set_Etype
(Func_Id
, Standard_Boolean
);
8997 Set_Is_Internal
(Func_Id
);
8998 Set_Is_Predicate_Function
(Func_Id
);
8999 Set_Predicate_Function
(Typ
, Func_Id
);
9001 Insert_After
(Parent
(Typ
), Func_Decl
);
9002 Analyze
(Func_Decl
);
9004 Restore_Ghost_Mode
(Saved_GM
);
9007 end Build_Predicate_Function_Declaration
;
9009 -----------------------------------------
9010 -- Check_Aspect_At_End_Of_Declarations --
9011 -----------------------------------------
9013 procedure Check_Aspect_At_End_Of_Declarations
(ASN
: Node_Id
) is
9014 Ent
: constant Entity_Id
:= Entity
(ASN
);
9015 Ident
: constant Node_Id
:= Identifier
(ASN
);
9016 A_Id
: constant Aspect_Id
:= Get_Aspect_Id
(Chars
(Ident
));
9018 End_Decl_Expr
: constant Node_Id
:= Entity
(Ident
);
9019 -- Expression to be analyzed at end of declarations
9021 Freeze_Expr
: constant Node_Id
:= Expression
(ASN
);
9022 -- Expression from call to Check_Aspect_At_Freeze_Point.
9024 T
: constant Entity_Id
:= Etype
(Original_Node
(Freeze_Expr
));
9025 -- Type required for preanalyze call. We use the original expression to
9026 -- get the proper type, to prevent cascaded errors when the expression
9027 -- is constant-folded.
9030 -- Set False if error
9032 -- On entry to this procedure, Entity (Ident) contains a copy of the
9033 -- original expression from the aspect, saved for this purpose, and
9034 -- but Expression (Ident) is a preanalyzed copy of the expression,
9035 -- preanalyzed just after the freeze point.
9037 procedure Check_Overloaded_Name
;
9038 -- For aspects whose expression is simply a name, this routine checks if
9039 -- the name is overloaded or not. If so, it verifies there is an
9040 -- interpretation that matches the entity obtained at the freeze point,
9041 -- otherwise the compiler complains.
9043 ---------------------------
9044 -- Check_Overloaded_Name --
9045 ---------------------------
9047 procedure Check_Overloaded_Name
is
9049 if not Is_Overloaded
(End_Decl_Expr
) then
9050 Err
:= not Is_Entity_Name
(End_Decl_Expr
)
9051 or else Entity
(End_Decl_Expr
) /= Entity
(Freeze_Expr
);
9057 Index
: Interp_Index
;
9061 Get_First_Interp
(End_Decl_Expr
, Index
, It
);
9062 while Present
(It
.Typ
) loop
9063 if It
.Nam
= Entity
(Freeze_Expr
) then
9068 Get_Next_Interp
(Index
, It
);
9072 end Check_Overloaded_Name
;
9074 -- Start of processing for Check_Aspect_At_End_Of_Declarations
9077 -- In an instance we do not perform the consistency check between freeze
9078 -- point and end of declarations, because it was done already in the
9079 -- analysis of the generic. Furthermore, the delayed analysis of an
9080 -- aspect of the instance may produce spurious errors when the generic
9081 -- is a child unit that references entities in the parent (which might
9082 -- not be in scope at the freeze point of the instance).
9087 -- The enclosing scope may have been rewritten during expansion (.e.g. a
9088 -- task body is rewritten as a procedure) after this conformance check
9089 -- has been performed, so do not perform it again (it may not easily be
9090 -- done if full visibility of local entities is not available).
9092 elsif not Comes_From_Source
(Current_Scope
) then
9095 -- Case of aspects Dimension, Dimension_System and Synchronization
9097 elsif A_Id
= Aspect_Synchronization
then
9100 -- Case of stream attributes, just have to compare entities. However,
9101 -- the expression is just a name (possibly overloaded), and there may
9102 -- be stream operations declared for unrelated types, so we just need
9103 -- to verify that one of these interpretations is the one available at
9104 -- at the freeze point.
9106 elsif A_Id
= Aspect_Input
or else
9107 A_Id
= Aspect_Output
or else
9108 A_Id
= Aspect_Read
or else
9111 Analyze
(End_Decl_Expr
);
9112 Check_Overloaded_Name
;
9114 elsif A_Id
= Aspect_Variable_Indexing
or else
9115 A_Id
= Aspect_Constant_Indexing
or else
9116 A_Id
= Aspect_Default_Iterator
or else
9117 A_Id
= Aspect_Iterator_Element
9119 -- Make type unfrozen before analysis, to prevent spurious errors
9120 -- about late attributes.
9122 Set_Is_Frozen
(Ent
, False);
9123 Analyze
(End_Decl_Expr
);
9124 Set_Is_Frozen
(Ent
, True);
9126 -- If the end of declarations comes before any other freeze
9127 -- point, the Freeze_Expr is not analyzed: no check needed.
9129 if Analyzed
(Freeze_Expr
) and then not In_Instance
then
9130 Check_Overloaded_Name
;
9138 -- Indicate that the expression comes from an aspect specification,
9139 -- which is used in subsequent analysis even if expansion is off.
9141 Set_Parent
(End_Decl_Expr
, ASN
);
9143 -- In a generic context the aspect expressions have not been
9144 -- preanalyzed, so do it now. There are no conformance checks
9145 -- to perform in this case.
9148 Check_Aspect_At_Freeze_Point
(ASN
);
9151 -- The default values attributes may be defined in the private part,
9152 -- and the analysis of the expression may take place when only the
9153 -- partial view is visible. The expression must be scalar, so use
9154 -- the full view to resolve.
9156 elsif (A_Id
= Aspect_Default_Value
9158 A_Id
= Aspect_Default_Component_Value
)
9159 and then Is_Private_Type
(T
)
9161 Preanalyze_Spec_Expression
(End_Decl_Expr
, Full_View
(T
));
9164 Preanalyze_Spec_Expression
(End_Decl_Expr
, T
);
9167 Err
:= not Fully_Conformant_Expressions
(End_Decl_Expr
, Freeze_Expr
);
9170 -- Output error message if error. Force error on aspect specification
9171 -- even if there is an error on the expression itself.
9175 ("!visibility of aspect for& changes after freeze point",
9178 ("info: & is frozen here, aspects evaluated at this point??",
9179 Freeze_Node
(Ent
), Ent
);
9181 end Check_Aspect_At_End_Of_Declarations
;
9183 ----------------------------------
9184 -- Check_Aspect_At_Freeze_Point --
9185 ----------------------------------
9187 procedure Check_Aspect_At_Freeze_Point
(ASN
: Node_Id
) is
9188 Ident
: constant Node_Id
:= Identifier
(ASN
);
9189 -- Identifier (use Entity field to save expression)
9191 A_Id
: constant Aspect_Id
:= Get_Aspect_Id
(Chars
(Ident
));
9193 T
: Entity_Id
:= Empty
;
9194 -- Type required for preanalyze call
9197 -- On entry to this procedure, Entity (Ident) contains a copy of the
9198 -- original expression from the aspect, saved for this purpose.
9200 -- On exit from this procedure Entity (Ident) is unchanged, still
9201 -- containing that copy, but Expression (Ident) is a preanalyzed copy
9202 -- of the expression, preanalyzed just after the freeze point.
9204 -- Make a copy of the expression to be preanalyzed
9206 Set_Expression
(ASN
, New_Copy_Tree
(Entity
(Ident
)));
9208 -- Find type for preanalyze call
9212 -- No_Aspect should be impossible
9215 raise Program_Error
;
9217 -- Aspects taking an optional boolean argument
9219 when Boolean_Aspects
9220 | Library_Unit_Aspects
9222 T
:= Standard_Boolean
;
9224 -- Aspects corresponding to attribute definition clauses
9226 when Aspect_Address
=>
9227 T
:= RTE
(RE_Address
);
9229 when Aspect_Attach_Handler
=>
9230 T
:= RTE
(RE_Interrupt_ID
);
9232 when Aspect_Bit_Order
9233 | Aspect_Scalar_Storage_Order
9235 T
:= RTE
(RE_Bit_Order
);
9237 when Aspect_Convention
=>
9241 T
:= RTE
(RE_CPU_Range
);
9243 -- Default_Component_Value is resolved with the component type
9245 when Aspect_Default_Component_Value
=>
9246 T
:= Component_Type
(Entity
(ASN
));
9248 when Aspect_Default_Storage_Pool
=>
9249 T
:= Class_Wide_Type
(RTE
(RE_Root_Storage_Pool
));
9251 -- Default_Value is resolved with the type entity in question
9253 when Aspect_Default_Value
=>
9256 when Aspect_Dispatching_Domain
=>
9257 T
:= RTE
(RE_Dispatching_Domain
);
9259 when Aspect_External_Tag
=>
9260 T
:= Standard_String
;
9262 when Aspect_External_Name
=>
9263 T
:= Standard_String
;
9265 when Aspect_Link_Name
=>
9266 T
:= Standard_String
;
9268 when Aspect_Interrupt_Priority
9271 T
:= Standard_Integer
;
9273 when Aspect_Relative_Deadline
=>
9274 T
:= RTE
(RE_Time_Span
);
9276 when Aspect_Secondary_Stack_Size
=>
9277 T
:= Standard_Integer
;
9279 when Aspect_Small
=>
9280 T
:= Universal_Real
;
9282 -- For a simple storage pool, we have to retrieve the type of the
9283 -- pool object associated with the aspect's corresponding attribute
9284 -- definition clause.
9286 when Aspect_Simple_Storage_Pool
=>
9287 T
:= Etype
(Expression
(Aspect_Rep_Item
(ASN
)));
9289 when Aspect_Storage_Pool
=>
9290 T
:= Class_Wide_Type
(RTE
(RE_Root_Storage_Pool
));
9292 when Aspect_Alignment
9293 | Aspect_Component_Size
9294 | Aspect_Machine_Radix
9295 | Aspect_Object_Size
9297 | Aspect_Storage_Size
9298 | Aspect_Stream_Size
9303 when Aspect_Linker_Section
=>
9304 T
:= Standard_String
;
9306 when Aspect_Synchronization
=>
9309 -- Special case, the expression of these aspects is just an entity
9310 -- that does not need any resolution, so just analyze.
9320 Analyze
(Expression
(ASN
));
9323 -- Same for Iterator aspects, where the expression is a function
9324 -- name. Legality rules are checked separately.
9326 when Aspect_Constant_Indexing
9327 | Aspect_Default_Iterator
9328 | Aspect_Iterator_Element
9329 | Aspect_Variable_Indexing
9331 Analyze
(Expression
(ASN
));
9334 -- Ditto for Iterable, legality checks in Validate_Iterable_Aspect.
9336 when Aspect_Iterable
=>
9340 Cursor
: constant Entity_Id
:= Get_Cursor_Type
(ASN
, T
);
9345 if Cursor
= Any_Type
then
9349 Assoc
:= First
(Component_Associations
(Expression
(ASN
)));
9350 while Present
(Assoc
) loop
9351 Expr
:= Expression
(Assoc
);
9354 if not Error_Posted
(Expr
) then
9355 Resolve_Iterable_Operation
9356 (Expr
, Cursor
, T
, Chars
(First
(Choices
(Assoc
))));
9365 -- Invariant/Predicate take boolean expressions
9367 when Aspect_Dynamic_Predicate
9370 | Aspect_Static_Predicate
9371 | Aspect_Type_Invariant
9373 T
:= Standard_Boolean
;
9375 when Aspect_Predicate_Failure
=>
9376 T
:= Standard_String
;
9378 -- Here is the list of aspects that don't require delay analysis
9380 when Aspect_Abstract_State
9382 | Aspect_Async_Readers
9383 | Aspect_Async_Writers
9384 | Aspect_Constant_After_Elaboration
9385 | Aspect_Contract_Cases
9386 | Aspect_Default_Initial_Condition
9389 | Aspect_Dimension_System
9390 | Aspect_Effective_Reads
9391 | Aspect_Effective_Writes
9392 | Aspect_Extensions_Visible
9395 | Aspect_Implicit_Dereference
9396 | Aspect_Initial_Condition
9397 | Aspect_Initializes
9398 | Aspect_Max_Queue_Length
9399 | Aspect_Obsolescent
9402 | Aspect_Postcondition
9404 | Aspect_Precondition
9405 | Aspect_Refined_Depends
9406 | Aspect_Refined_Global
9407 | Aspect_Refined_Post
9408 | Aspect_Refined_State
9411 | Aspect_Unimplemented
9412 | Aspect_Volatile_Function
9414 raise Program_Error
;
9418 -- Do the preanalyze call
9420 Preanalyze_Spec_Expression
(Expression
(ASN
), T
);
9421 end Check_Aspect_At_Freeze_Point
;
9423 -----------------------------------
9424 -- Check_Constant_Address_Clause --
9425 -----------------------------------
9427 procedure Check_Constant_Address_Clause
9431 procedure Check_At_Constant_Address
(Nod
: Node_Id
);
9432 -- Checks that the given node N represents a name whose 'Address is
9433 -- constant (in the same sense as OK_Constant_Address_Clause, i.e. the
9434 -- address value is the same at the point of declaration of U_Ent and at
9435 -- the time of elaboration of the address clause.
9437 procedure Check_Expr_Constants
(Nod
: Node_Id
);
9438 -- Checks that Nod meets the requirements for a constant address clause
9439 -- in the sense of the enclosing procedure.
9441 procedure Check_List_Constants
(Lst
: List_Id
);
9442 -- Check that all elements of list Lst meet the requirements for a
9443 -- constant address clause in the sense of the enclosing procedure.
9445 -------------------------------
9446 -- Check_At_Constant_Address --
9447 -------------------------------
9449 procedure Check_At_Constant_Address
(Nod
: Node_Id
) is
9451 if Is_Entity_Name
(Nod
) then
9452 if Present
(Address_Clause
(Entity
((Nod
)))) then
9454 ("invalid address clause for initialized object &!",
9457 ("address for& cannot depend on another address clause! "
9458 & "(RM 13.1(22))!", Nod
, U_Ent
);
9460 elsif In_Same_Source_Unit
(Entity
(Nod
), U_Ent
)
9461 and then Sloc
(U_Ent
) < Sloc
(Entity
(Nod
))
9464 ("invalid address clause for initialized object &!",
9466 Error_Msg_Node_2
:= U_Ent
;
9468 ("\& must be defined before & (RM 13.1(22))!",
9472 elsif Nkind
(Nod
) = N_Selected_Component
then
9474 T
: constant Entity_Id
:= Etype
(Prefix
(Nod
));
9477 if (Is_Record_Type
(T
)
9478 and then Has_Discriminants
(T
))
9481 and then Is_Record_Type
(Designated_Type
(T
))
9482 and then Has_Discriminants
(Designated_Type
(T
)))
9485 ("invalid address clause for initialized object &!",
9488 ("\address cannot depend on component of discriminated "
9489 & "record (RM 13.1(22))!", Nod
);
9491 Check_At_Constant_Address
(Prefix
(Nod
));
9495 elsif Nkind
(Nod
) = N_Indexed_Component
then
9496 Check_At_Constant_Address
(Prefix
(Nod
));
9497 Check_List_Constants
(Expressions
(Nod
));
9500 Check_Expr_Constants
(Nod
);
9502 end Check_At_Constant_Address
;
9504 --------------------------
9505 -- Check_Expr_Constants --
9506 --------------------------
9508 procedure Check_Expr_Constants
(Nod
: Node_Id
) is
9509 Loc_U_Ent
: constant Source_Ptr
:= Sloc
(U_Ent
);
9510 Ent
: Entity_Id
:= Empty
;
9513 if Nkind
(Nod
) in N_Has_Etype
9514 and then Etype
(Nod
) = Any_Type
9525 when N_Expanded_Name
9528 Ent
:= Entity
(Nod
);
9530 -- We need to look at the original node if it is different
9531 -- from the node, since we may have rewritten things and
9532 -- substituted an identifier representing the rewrite.
9534 if Original_Node
(Nod
) /= Nod
then
9535 Check_Expr_Constants
(Original_Node
(Nod
));
9537 -- If the node is an object declaration without initial
9538 -- value, some code has been expanded, and the expression
9539 -- is not constant, even if the constituents might be
9540 -- acceptable, as in A'Address + offset.
9542 if Ekind
(Ent
) = E_Variable
9544 Nkind
(Declaration_Node
(Ent
)) = N_Object_Declaration
9546 No
(Expression
(Declaration_Node
(Ent
)))
9549 ("invalid address clause for initialized object &!",
9552 -- If entity is constant, it may be the result of expanding
9553 -- a check. We must verify that its declaration appears
9554 -- before the object in question, else we also reject the
9557 elsif Ekind
(Ent
) = E_Constant
9558 and then In_Same_Source_Unit
(Ent
, U_Ent
)
9559 and then Sloc
(Ent
) > Loc_U_Ent
9562 ("invalid address clause for initialized object &!",
9569 -- Otherwise look at the identifier and see if it is OK
9571 if Ekind_In
(Ent
, E_Named_Integer
, E_Named_Real
)
9572 or else Is_Type
(Ent
)
9576 elsif Ekind_In
(Ent
, E_Constant
, E_In_Parameter
) then
9578 -- This is the case where we must have Ent defined before
9579 -- U_Ent. Clearly if they are in different units this
9580 -- requirement is met since the unit containing Ent is
9581 -- already processed.
9583 if not In_Same_Source_Unit
(Ent
, U_Ent
) then
9586 -- Otherwise location of Ent must be before the location
9587 -- of U_Ent, that's what prior defined means.
9589 elsif Sloc
(Ent
) < Loc_U_Ent
then
9594 ("invalid address clause for initialized object &!",
9596 Error_Msg_Node_2
:= U_Ent
;
9598 ("\& must be defined before & (RM 13.1(22))!",
9602 elsif Nkind
(Original_Node
(Nod
)) = N_Function_Call
then
9603 Check_Expr_Constants
(Original_Node
(Nod
));
9607 ("invalid address clause for initialized object &!",
9610 if Comes_From_Source
(Ent
) then
9612 ("\reference to variable& not allowed"
9613 & " (RM 13.1(22))!", Nod
, Ent
);
9616 ("non-static expression not allowed"
9617 & " (RM 13.1(22))!", Nod
);
9621 when N_Integer_Literal
=>
9623 -- If this is a rewritten unchecked conversion, in a system
9624 -- where Address is an integer type, always use the base type
9625 -- for a literal value. This is user-friendly and prevents
9626 -- order-of-elaboration issues with instances of unchecked
9629 if Nkind
(Original_Node
(Nod
)) = N_Function_Call
then
9630 Set_Etype
(Nod
, Base_Type
(Etype
(Nod
)));
9633 when N_Character_Literal
9640 Check_Expr_Constants
(Low_Bound
(Nod
));
9641 Check_Expr_Constants
(High_Bound
(Nod
));
9643 when N_Explicit_Dereference
=>
9644 Check_Expr_Constants
(Prefix
(Nod
));
9646 when N_Indexed_Component
=>
9647 Check_Expr_Constants
(Prefix
(Nod
));
9648 Check_List_Constants
(Expressions
(Nod
));
9651 Check_Expr_Constants
(Prefix
(Nod
));
9652 Check_Expr_Constants
(Discrete_Range
(Nod
));
9654 when N_Selected_Component
=>
9655 Check_Expr_Constants
(Prefix
(Nod
));
9657 when N_Attribute_Reference
=>
9658 if Nam_In
(Attribute_Name
(Nod
), Name_Address
,
9660 Name_Unchecked_Access
,
9661 Name_Unrestricted_Access
)
9663 Check_At_Constant_Address
(Prefix
(Nod
));
9666 Check_Expr_Constants
(Prefix
(Nod
));
9667 Check_List_Constants
(Expressions
(Nod
));
9671 Check_List_Constants
(Component_Associations
(Nod
));
9672 Check_List_Constants
(Expressions
(Nod
));
9674 when N_Component_Association
=>
9675 Check_Expr_Constants
(Expression
(Nod
));
9677 when N_Extension_Aggregate
=>
9678 Check_Expr_Constants
(Ancestor_Part
(Nod
));
9679 Check_List_Constants
(Component_Associations
(Nod
));
9680 Check_List_Constants
(Expressions
(Nod
));
9689 Check_Expr_Constants
(Left_Opnd
(Nod
));
9690 Check_Expr_Constants
(Right_Opnd
(Nod
));
9693 Check_Expr_Constants
(Right_Opnd
(Nod
));
9696 | N_Qualified_Expression
9698 | N_Unchecked_Type_Conversion
9700 Check_Expr_Constants
(Expression
(Nod
));
9702 when N_Function_Call
=>
9703 if not Is_Pure
(Entity
(Name
(Nod
))) then
9705 ("invalid address clause for initialized object &!",
9709 ("\function & is not pure (RM 13.1(22))!",
9710 Nod
, Entity
(Name
(Nod
)));
9713 Check_List_Constants
(Parameter_Associations
(Nod
));
9716 when N_Parameter_Association
=>
9717 Check_Expr_Constants
(Explicit_Actual_Parameter
(Nod
));
9721 ("invalid address clause for initialized object &!",
9724 ("\must be constant defined before& (RM 13.1(22))!",
9727 end Check_Expr_Constants
;
9729 --------------------------
9730 -- Check_List_Constants --
9731 --------------------------
9733 procedure Check_List_Constants
(Lst
: List_Id
) is
9737 if Present
(Lst
) then
9738 Nod1
:= First
(Lst
);
9739 while Present
(Nod1
) loop
9740 Check_Expr_Constants
(Nod1
);
9744 end Check_List_Constants
;
9746 -- Start of processing for Check_Constant_Address_Clause
9749 -- If rep_clauses are to be ignored, no need for legality checks. In
9750 -- particular, no need to pester user about rep clauses that violate the
9751 -- rule on constant addresses, given that these clauses will be removed
9752 -- by Freeze before they reach the back end. Similarly in CodePeer mode,
9753 -- we want to relax these checks.
9755 if not Ignore_Rep_Clauses
and not CodePeer_Mode
then
9756 Check_Expr_Constants
(Expr
);
9758 end Check_Constant_Address_Clause
;
9760 ---------------------------
9761 -- Check_Pool_Size_Clash --
9762 ---------------------------
9764 procedure Check_Pool_Size_Clash
(Ent
: Entity_Id
; SP
, SS
: Node_Id
) is
9768 -- We need to find out which one came first. Note that in the case of
9769 -- aspects mixed with pragmas there are cases where the processing order
9770 -- is reversed, which is why we do the check here.
9772 if Sloc
(SP
) < Sloc
(SS
) then
9773 Error_Msg_Sloc
:= Sloc
(SP
);
9775 Error_Msg_NE
("Storage_Pool previously given for&#", Post
, Ent
);
9778 Error_Msg_Sloc
:= Sloc
(SS
);
9780 Error_Msg_NE
("Storage_Size previously given for&#", Post
, Ent
);
9784 ("\cannot have Storage_Size and Storage_Pool (RM 13.11(3))", Post
);
9785 end Check_Pool_Size_Clash
;
9787 ----------------------------------------
9788 -- Check_Record_Representation_Clause --
9789 ----------------------------------------
9791 procedure Check_Record_Representation_Clause
(N
: Node_Id
) is
9792 Loc
: constant Source_Ptr
:= Sloc
(N
);
9793 Ident
: constant Node_Id
:= Identifier
(N
);
9794 Rectype
: Entity_Id
;
9799 Hbit
: Uint
:= Uint_0
;
9803 Max_Bit_So_Far
: Uint
;
9804 -- Records the maximum bit position so far. If all field positions
9805 -- are monotonically increasing, then we can skip the circuit for
9806 -- checking for overlap, since no overlap is possible.
9808 Tagged_Parent
: Entity_Id
:= Empty
;
9809 -- This is set in the case of a derived tagged type for which we have
9810 -- Is_Fully_Repped_Tagged_Type True (indicating that all components are
9811 -- positioned by record representation clauses). In this case we must
9812 -- check for overlap between components of this tagged type, and the
9813 -- components of its parent. Tagged_Parent will point to this parent
9814 -- type. For all other cases Tagged_Parent is left set to Empty.
9816 Parent_Last_Bit
: Uint
;
9817 -- Relevant only if Tagged_Parent is set, Parent_Last_Bit indicates the
9818 -- last bit position for any field in the parent type. We only need to
9819 -- check overlap for fields starting below this point.
9821 Overlap_Check_Required
: Boolean;
9822 -- Used to keep track of whether or not an overlap check is required
9824 Overlap_Detected
: Boolean := False;
9825 -- Set True if an overlap is detected
9827 Ccount
: Natural := 0;
9828 -- Number of component clauses in record rep clause
9830 procedure Check_Component_Overlap
(C1_Ent
, C2_Ent
: Entity_Id
);
9831 -- Given two entities for record components or discriminants, checks
9832 -- if they have overlapping component clauses and issues errors if so.
9834 procedure Find_Component
;
9835 -- Finds component entity corresponding to current component clause (in
9836 -- CC), and sets Comp to the entity, and Fbit/Lbit to the zero origin
9837 -- start/stop bits for the field. If there is no matching component or
9838 -- if the matching component does not have a component clause, then
9839 -- that's an error and Comp is set to Empty, but no error message is
9840 -- issued, since the message was already given. Comp is also set to
9841 -- Empty if the current "component clause" is in fact a pragma.
9843 -----------------------------
9844 -- Check_Component_Overlap --
9845 -----------------------------
9847 procedure Check_Component_Overlap
(C1_Ent
, C2_Ent
: Entity_Id
) is
9848 CC1
: constant Node_Id
:= Component_Clause
(C1_Ent
);
9849 CC2
: constant Node_Id
:= Component_Clause
(C2_Ent
);
9852 if Present
(CC1
) and then Present
(CC2
) then
9854 -- Exclude odd case where we have two tag components in the same
9855 -- record, both at location zero. This seems a bit strange, but
9856 -- it seems to happen in some circumstances, perhaps on an error.
9858 if Nam_In
(Chars
(C1_Ent
), Name_uTag
, Name_uTag
) then
9862 -- Here we check if the two fields overlap
9865 S1
: constant Uint
:= Component_Bit_Offset
(C1_Ent
);
9866 S2
: constant Uint
:= Component_Bit_Offset
(C2_Ent
);
9867 E1
: constant Uint
:= S1
+ Esize
(C1_Ent
);
9868 E2
: constant Uint
:= S2
+ Esize
(C2_Ent
);
9871 if E2
<= S1
or else E1
<= S2
then
9874 Error_Msg_Node_2
:= Component_Name
(CC2
);
9875 Error_Msg_Sloc
:= Sloc
(Error_Msg_Node_2
);
9876 Error_Msg_Node_1
:= Component_Name
(CC1
);
9878 ("component& overlaps & #", Component_Name
(CC1
));
9879 Overlap_Detected
:= True;
9883 end Check_Component_Overlap
;
9885 --------------------
9886 -- Find_Component --
9887 --------------------
9889 procedure Find_Component
is
9891 procedure Search_Component
(R
: Entity_Id
);
9892 -- Search components of R for a match. If found, Comp is set
9894 ----------------------
9895 -- Search_Component --
9896 ----------------------
9898 procedure Search_Component
(R
: Entity_Id
) is
9900 Comp
:= First_Component_Or_Discriminant
(R
);
9901 while Present
(Comp
) loop
9903 -- Ignore error of attribute name for component name (we
9904 -- already gave an error message for this, so no need to
9907 if Nkind
(Component_Name
(CC
)) = N_Attribute_Reference
then
9910 exit when Chars
(Comp
) = Chars
(Component_Name
(CC
));
9913 Next_Component_Or_Discriminant
(Comp
);
9915 end Search_Component
;
9917 -- Start of processing for Find_Component
9920 -- Return with Comp set to Empty if we have a pragma
9922 if Nkind
(CC
) = N_Pragma
then
9927 -- Search current record for matching component
9929 Search_Component
(Rectype
);
9931 -- If not found, maybe component of base type discriminant that is
9932 -- absent from statically constrained first subtype.
9935 Search_Component
(Base_Type
(Rectype
));
9938 -- If no component, or the component does not reference the component
9939 -- clause in question, then there was some previous error for which
9940 -- we already gave a message, so just return with Comp Empty.
9942 if No
(Comp
) or else Component_Clause
(Comp
) /= CC
then
9943 Check_Error_Detected
;
9946 -- Normal case where we have a component clause
9949 Fbit
:= Component_Bit_Offset
(Comp
);
9950 Lbit
:= Fbit
+ Esize
(Comp
) - 1;
9954 -- Start of processing for Check_Record_Representation_Clause
9958 Rectype
:= Entity
(Ident
);
9960 if Rectype
= Any_Type
then
9963 Rectype
:= Underlying_Type
(Rectype
);
9966 -- See if we have a fully repped derived tagged type
9969 PS
: constant Entity_Id
:= Parent_Subtype
(Rectype
);
9972 if Present
(PS
) and then Is_Fully_Repped_Tagged_Type
(PS
) then
9973 Tagged_Parent
:= PS
;
9975 -- Find maximum bit of any component of the parent type
9977 Parent_Last_Bit
:= UI_From_Int
(System_Address_Size
- 1);
9978 Pcomp
:= First_Entity
(Tagged_Parent
);
9979 while Present
(Pcomp
) loop
9980 if Ekind_In
(Pcomp
, E_Discriminant
, E_Component
) then
9981 if Component_Bit_Offset
(Pcomp
) /= No_Uint
9982 and then Known_Static_Esize
(Pcomp
)
9987 Component_Bit_Offset
(Pcomp
) + Esize
(Pcomp
) - 1);
9991 -- Skip anonymous types generated for constrained array
9992 -- or record components.
9997 Next_Entity
(Pcomp
);
10002 -- All done if no component clauses
10004 CC
:= First
(Component_Clauses
(N
));
10010 -- If a tag is present, then create a component clause that places it
10011 -- at the start of the record (otherwise gigi may place it after other
10012 -- fields that have rep clauses).
10014 Fent
:= First_Entity
(Rectype
);
10016 if Nkind
(Fent
) = N_Defining_Identifier
10017 and then Chars
(Fent
) = Name_uTag
10019 Set_Component_Bit_Offset
(Fent
, Uint_0
);
10020 Set_Normalized_Position
(Fent
, Uint_0
);
10021 Set_Normalized_First_Bit
(Fent
, Uint_0
);
10022 Set_Normalized_Position_Max
(Fent
, Uint_0
);
10023 Init_Esize
(Fent
, System_Address_Size
);
10025 Set_Component_Clause
(Fent
,
10026 Make_Component_Clause
(Loc
,
10027 Component_Name
=> Make_Identifier
(Loc
, Name_uTag
),
10029 Position
=> Make_Integer_Literal
(Loc
, Uint_0
),
10030 First_Bit
=> Make_Integer_Literal
(Loc
, Uint_0
),
10032 Make_Integer_Literal
(Loc
,
10033 UI_From_Int
(System_Address_Size
))));
10035 Ccount
:= Ccount
+ 1;
10038 Max_Bit_So_Far
:= Uint_Minus_1
;
10039 Overlap_Check_Required
:= False;
10041 -- Process the component clauses
10043 while Present
(CC
) loop
10046 if Present
(Comp
) then
10047 Ccount
:= Ccount
+ 1;
10049 -- We need a full overlap check if record positions non-monotonic
10051 if Fbit
<= Max_Bit_So_Far
then
10052 Overlap_Check_Required
:= True;
10055 Max_Bit_So_Far
:= Lbit
;
10057 -- Check bit position out of range of specified size
10059 if Has_Size_Clause
(Rectype
)
10060 and then RM_Size
(Rectype
) <= Lbit
10063 ("bit number out of range of specified size",
10066 -- Check for overlap with tag component
10069 if Is_Tagged_Type
(Rectype
)
10070 and then Fbit
< System_Address_Size
10073 ("component overlaps tag field of&",
10074 Component_Name
(CC
), Rectype
);
10075 Overlap_Detected
:= True;
10078 if Hbit
< Lbit
then
10083 -- Check parent overlap if component might overlap parent field
10085 if Present
(Tagged_Parent
) and then Fbit
<= Parent_Last_Bit
then
10086 Pcomp
:= First_Component_Or_Discriminant
(Tagged_Parent
);
10087 while Present
(Pcomp
) loop
10088 if not Is_Tag
(Pcomp
)
10089 and then Chars
(Pcomp
) /= Name_uParent
10091 Check_Component_Overlap
(Comp
, Pcomp
);
10094 Next_Component_Or_Discriminant
(Pcomp
);
10102 -- Now that we have processed all the component clauses, check for
10103 -- overlap. We have to leave this till last, since the components can
10104 -- appear in any arbitrary order in the representation clause.
10106 -- We do not need this check if all specified ranges were monotonic,
10107 -- as recorded by Overlap_Check_Required being False at this stage.
10109 -- This first section checks if there are any overlapping entries at
10110 -- all. It does this by sorting all entries and then seeing if there are
10111 -- any overlaps. If there are none, then that is decisive, but if there
10112 -- are overlaps, they may still be OK (they may result from fields in
10113 -- different variants).
10115 if Overlap_Check_Required
then
10116 Overlap_Check1
: declare
10118 OC_Fbit
: array (0 .. Ccount
) of Uint
;
10119 -- First-bit values for component clauses, the value is the offset
10120 -- of the first bit of the field from start of record. The zero
10121 -- entry is for use in sorting.
10123 OC_Lbit
: array (0 .. Ccount
) of Uint
;
10124 -- Last-bit values for component clauses, the value is the offset
10125 -- of the last bit of the field from start of record. The zero
10126 -- entry is for use in sorting.
10128 OC_Count
: Natural := 0;
10129 -- Count of entries in OC_Fbit and OC_Lbit
10131 function OC_Lt
(Op1
, Op2
: Natural) return Boolean;
10132 -- Compare routine for Sort
10134 procedure OC_Move
(From
: Natural; To
: Natural);
10135 -- Move routine for Sort
10137 package Sorting
is new GNAT
.Heap_Sort_G
(OC_Move
, OC_Lt
);
10143 function OC_Lt
(Op1
, Op2
: Natural) return Boolean is
10145 return OC_Fbit
(Op1
) < OC_Fbit
(Op2
);
10152 procedure OC_Move
(From
: Natural; To
: Natural) is
10154 OC_Fbit
(To
) := OC_Fbit
(From
);
10155 OC_Lbit
(To
) := OC_Lbit
(From
);
10158 -- Start of processing for Overlap_Check
10161 CC
:= First
(Component_Clauses
(N
));
10162 while Present
(CC
) loop
10164 -- Exclude component clause already marked in error
10166 if not Error_Posted
(CC
) then
10169 if Present
(Comp
) then
10170 OC_Count
:= OC_Count
+ 1;
10171 OC_Fbit
(OC_Count
) := Fbit
;
10172 OC_Lbit
(OC_Count
) := Lbit
;
10179 Sorting
.Sort
(OC_Count
);
10181 Overlap_Check_Required
:= False;
10182 for J
in 1 .. OC_Count
- 1 loop
10183 if OC_Lbit
(J
) >= OC_Fbit
(J
+ 1) then
10184 Overlap_Check_Required
:= True;
10188 end Overlap_Check1
;
10191 -- If Overlap_Check_Required is still True, then we have to do the full
10192 -- scale overlap check, since we have at least two fields that do
10193 -- overlap, and we need to know if that is OK since they are in
10194 -- different variant, or whether we have a definite problem.
10196 if Overlap_Check_Required
then
10197 Overlap_Check2
: declare
10198 C1_Ent
, C2_Ent
: Entity_Id
;
10199 -- Entities of components being checked for overlap
10202 -- Component_List node whose Component_Items are being checked
10205 -- Component declaration for component being checked
10208 C1_Ent
:= First_Entity
(Base_Type
(Rectype
));
10210 -- Loop through all components in record. For each component check
10211 -- for overlap with any of the preceding elements on the component
10212 -- list containing the component and also, if the component is in
10213 -- a variant, check against components outside the case structure.
10214 -- This latter test is repeated recursively up the variant tree.
10216 Main_Component_Loop
: while Present
(C1_Ent
) loop
10217 if not Ekind_In
(C1_Ent
, E_Component
, E_Discriminant
) then
10218 goto Continue_Main_Component_Loop
;
10221 -- Skip overlap check if entity has no declaration node. This
10222 -- happens with discriminants in constrained derived types.
10223 -- Possibly we are missing some checks as a result, but that
10224 -- does not seem terribly serious.
10226 if No
(Declaration_Node
(C1_Ent
)) then
10227 goto Continue_Main_Component_Loop
;
10230 Clist
:= Parent
(List_Containing
(Declaration_Node
(C1_Ent
)));
10232 -- Loop through component lists that need checking. Check the
10233 -- current component list and all lists in variants above us.
10235 Component_List_Loop
: loop
10237 -- If derived type definition, go to full declaration
10238 -- If at outer level, check discriminants if there are any.
10240 if Nkind
(Clist
) = N_Derived_Type_Definition
then
10241 Clist
:= Parent
(Clist
);
10244 -- Outer level of record definition, check discriminants
10246 if Nkind_In
(Clist
, N_Full_Type_Declaration
,
10247 N_Private_Type_Declaration
)
10249 if Has_Discriminants
(Defining_Identifier
(Clist
)) then
10251 First_Discriminant
(Defining_Identifier
(Clist
));
10252 while Present
(C2_Ent
) loop
10253 exit when C1_Ent
= C2_Ent
;
10254 Check_Component_Overlap
(C1_Ent
, C2_Ent
);
10255 Next_Discriminant
(C2_Ent
);
10259 -- Record extension case
10261 elsif Nkind
(Clist
) = N_Derived_Type_Definition
then
10264 -- Otherwise check one component list
10267 Citem
:= First
(Component_Items
(Clist
));
10268 while Present
(Citem
) loop
10269 if Nkind
(Citem
) = N_Component_Declaration
then
10270 C2_Ent
:= Defining_Identifier
(Citem
);
10271 exit when C1_Ent
= C2_Ent
;
10272 Check_Component_Overlap
(C1_Ent
, C2_Ent
);
10279 -- Check for variants above us (the parent of the Clist can
10280 -- be a variant, in which case its parent is a variant part,
10281 -- and the parent of the variant part is a component list
10282 -- whose components must all be checked against the current
10283 -- component for overlap).
10285 if Nkind
(Parent
(Clist
)) = N_Variant
then
10286 Clist
:= Parent
(Parent
(Parent
(Clist
)));
10288 -- Check for possible discriminant part in record, this
10289 -- is treated essentially as another level in the
10290 -- recursion. For this case the parent of the component
10291 -- list is the record definition, and its parent is the
10292 -- full type declaration containing the discriminant
10295 elsif Nkind
(Parent
(Clist
)) = N_Record_Definition
then
10296 Clist
:= Parent
(Parent
((Clist
)));
10298 -- If neither of these two cases, we are at the top of
10302 exit Component_List_Loop
;
10304 end loop Component_List_Loop
;
10306 <<Continue_Main_Component_Loop
>>
10307 Next_Entity
(C1_Ent
);
10309 end loop Main_Component_Loop
;
10310 end Overlap_Check2
;
10313 -- The following circuit deals with warning on record holes (gaps). We
10314 -- skip this check if overlap was detected, since it makes sense for the
10315 -- programmer to fix this illegality before worrying about warnings.
10317 if not Overlap_Detected
and Warn_On_Record_Holes
then
10318 Record_Hole_Check
: declare
10319 Decl
: constant Node_Id
:= Declaration_Node
(Base_Type
(Rectype
));
10320 -- Full declaration of record type
10322 procedure Check_Component_List
10326 -- Check component list CL for holes. The starting bit should be
10327 -- Sbit. which is zero for the main record component list and set
10328 -- appropriately for recursive calls for variants. DS is set to
10329 -- a list of discriminant specifications to be included in the
10330 -- consideration of components. It is No_List if none to consider.
10332 --------------------------
10333 -- Check_Component_List --
10334 --------------------------
10336 procedure Check_Component_List
10344 Compl
:= Integer (List_Length
(Component_Items
(CL
)));
10346 if DS
/= No_List
then
10347 Compl
:= Compl
+ Integer (List_Length
(DS
));
10351 Comps
: array (Natural range 0 .. Compl
) of Entity_Id
;
10352 -- Gather components (zero entry is for sort routine)
10354 Ncomps
: Natural := 0;
10355 -- Number of entries stored in Comps (starting at Comps (1))
10358 -- One component item or discriminant specification
10361 -- Starting bit for next component
10364 -- Component entity
10369 function Lt
(Op1
, Op2
: Natural) return Boolean;
10370 -- Compare routine for Sort
10372 procedure Move
(From
: Natural; To
: Natural);
10373 -- Move routine for Sort
10375 package Sorting
is new GNAT
.Heap_Sort_G
(Move
, Lt
);
10381 function Lt
(Op1
, Op2
: Natural) return Boolean is
10383 return Component_Bit_Offset
(Comps
(Op1
))
10385 Component_Bit_Offset
(Comps
(Op2
));
10392 procedure Move
(From
: Natural; To
: Natural) is
10394 Comps
(To
) := Comps
(From
);
10398 -- Gather discriminants into Comp
10400 if DS
/= No_List
then
10401 Citem
:= First
(DS
);
10402 while Present
(Citem
) loop
10403 if Nkind
(Citem
) = N_Discriminant_Specification
then
10405 Ent
: constant Entity_Id
:=
10406 Defining_Identifier
(Citem
);
10408 if Ekind
(Ent
) = E_Discriminant
then
10409 Ncomps
:= Ncomps
+ 1;
10410 Comps
(Ncomps
) := Ent
;
10419 -- Gather component entities into Comp
10421 Citem
:= First
(Component_Items
(CL
));
10422 while Present
(Citem
) loop
10423 if Nkind
(Citem
) = N_Component_Declaration
then
10424 Ncomps
:= Ncomps
+ 1;
10425 Comps
(Ncomps
) := Defining_Identifier
(Citem
);
10431 -- Now sort the component entities based on the first bit.
10432 -- Note we already know there are no overlapping components.
10434 Sorting
.Sort
(Ncomps
);
10436 -- Loop through entries checking for holes
10439 for J
in 1 .. Ncomps
loop
10443 CBO
: constant Uint
:= Component_Bit_Offset
(CEnt
);
10446 -- Skip components with unknown offsets
10448 if CBO
/= No_Uint
and then CBO
>= 0 then
10449 Error_Msg_Uint_1
:= CBO
- Nbit
;
10451 if Error_Msg_Uint_1
> 0 then
10453 ("?H?^-bit gap before component&",
10454 Component_Name
(Component_Clause
(CEnt
)),
10458 Nbit
:= CBO
+ Esize
(CEnt
);
10463 -- Process variant parts recursively if present
10465 if Present
(Variant_Part
(CL
)) then
10466 Variant
:= First
(Variants
(Variant_Part
(CL
)));
10467 while Present
(Variant
) loop
10468 Check_Component_List
10469 (Component_List
(Variant
), Nbit
, No_List
);
10474 end Check_Component_List
;
10476 -- Start of processing for Record_Hole_Check
10483 if Is_Tagged_Type
(Rectype
) then
10484 Sbit
:= UI_From_Int
(System_Address_Size
);
10489 if Nkind
(Decl
) = N_Full_Type_Declaration
10490 and then Nkind
(Type_Definition
(Decl
)) = N_Record_Definition
10492 Check_Component_List
10493 (Component_List
(Type_Definition
(Decl
)),
10495 Discriminant_Specifications
(Decl
));
10498 end Record_Hole_Check
;
10501 -- For records that have component clauses for all components, and whose
10502 -- size is less than or equal to 32, we need to know the size in the
10503 -- front end to activate possible packed array processing where the
10504 -- component type is a record.
10506 -- At this stage Hbit + 1 represents the first unused bit from all the
10507 -- component clauses processed, so if the component clauses are
10508 -- complete, then this is the length of the record.
10510 -- For records longer than System.Storage_Unit, and for those where not
10511 -- all components have component clauses, the back end determines the
10512 -- length (it may for example be appropriate to round up the size
10513 -- to some convenient boundary, based on alignment considerations, etc).
10515 if Unknown_RM_Size
(Rectype
) and then Hbit
+ 1 <= 32 then
10517 -- Nothing to do if at least one component has no component clause
10519 Comp
:= First_Component_Or_Discriminant
(Rectype
);
10520 while Present
(Comp
) loop
10521 exit when No
(Component_Clause
(Comp
));
10522 Next_Component_Or_Discriminant
(Comp
);
10525 -- If we fall out of loop, all components have component clauses
10526 -- and so we can set the size to the maximum value.
10529 Set_RM_Size
(Rectype
, Hbit
+ 1);
10532 end Check_Record_Representation_Clause
;
10538 procedure Check_Size
10542 Biased
: out Boolean)
10544 procedure Size_Too_Small_Error
(Min_Siz
: Uint
);
10545 -- Emit an error concerning illegal size Siz. Min_Siz denotes the
10548 --------------------------
10549 -- Size_Too_Small_Error --
10550 --------------------------
10552 procedure Size_Too_Small_Error
(Min_Siz
: Uint
) is
10554 -- This error is suppressed in ASIS mode to allow for different ASIS
10555 -- back ends or ASIS-based tools to query the illegal clause.
10557 if not ASIS_Mode
then
10558 Error_Msg_Uint_1
:= Min_Siz
;
10559 Error_Msg_NE
("size for& too small, minimum allowed is ^", N
, T
);
10561 end Size_Too_Small_Error
;
10565 UT
: constant Entity_Id
:= Underlying_Type
(T
);
10568 -- Start of processing for Check_Size
10573 -- Reject patently improper size values
10575 if Is_Elementary_Type
(T
)
10576 and then Siz
> UI_From_Int
(Int
'Last)
10578 Error_Msg_N
("Size value too large for elementary type", N
);
10580 if Nkind
(Original_Node
(N
)) = N_Op_Expon
then
10582 ("\maybe '* was meant, rather than '*'*", Original_Node
(N
));
10586 -- Dismiss generic types
10588 if Is_Generic_Type
(T
)
10590 Is_Generic_Type
(UT
)
10592 Is_Generic_Type
(Root_Type
(UT
))
10596 -- Guard against previous errors
10598 elsif No
(UT
) or else UT
= Any_Type
then
10599 Check_Error_Detected
;
10602 -- Check case of bit packed array
10604 elsif Is_Array_Type
(UT
)
10605 and then Known_Static_Component_Size
(UT
)
10606 and then Is_Bit_Packed_Array
(UT
)
10614 Asiz
:= Component_Size
(UT
);
10615 Indx
:= First_Index
(UT
);
10617 Ityp
:= Etype
(Indx
);
10619 -- If non-static bound, then we are not in the business of
10620 -- trying to check the length, and indeed an error will be
10621 -- issued elsewhere, since sizes of non-static array types
10622 -- cannot be set implicitly or explicitly.
10624 if not Is_OK_Static_Subtype
(Ityp
) then
10628 -- Otherwise accumulate next dimension
10630 Asiz
:= Asiz
* (Expr_Value
(Type_High_Bound
(Ityp
)) -
10631 Expr_Value
(Type_Low_Bound
(Ityp
)) +
10635 exit when No
(Indx
);
10638 if Asiz
<= Siz
then
10642 Size_Too_Small_Error
(Asiz
);
10643 Set_Esize
(T
, Asiz
);
10644 Set_RM_Size
(T
, Asiz
);
10648 -- All other composite types are ignored
10650 elsif Is_Composite_Type
(UT
) then
10653 -- For fixed-point types, don't check minimum if type is not frozen,
10654 -- since we don't know all the characteristics of the type that can
10655 -- affect the size (e.g. a specified small) till freeze time.
10657 elsif Is_Fixed_Point_Type
(UT
) and then not Is_Frozen
(UT
) then
10660 -- Cases for which a minimum check is required
10663 -- Ignore if specified size is correct for the type
10665 if Known_Esize
(UT
) and then Siz
= Esize
(UT
) then
10669 -- Otherwise get minimum size
10671 M
:= UI_From_Int
(Minimum_Size
(UT
));
10675 -- Size is less than minimum size, but one possibility remains
10676 -- that we can manage with the new size if we bias the type.
10678 M
:= UI_From_Int
(Minimum_Size
(UT
, Biased
=> True));
10681 Size_Too_Small_Error
(M
);
10683 Set_RM_Size
(T
, M
);
10691 --------------------------
10692 -- Freeze_Entity_Checks --
10693 --------------------------
10695 procedure Freeze_Entity_Checks
(N
: Node_Id
) is
10696 procedure Hide_Non_Overridden_Subprograms
(Typ
: Entity_Id
);
10697 -- Inspect the primitive operations of type Typ and hide all pairs of
10698 -- implicitly declared non-overridden non-fully conformant homographs
10699 -- (Ada RM 8.3 12.3/2).
10701 -------------------------------------
10702 -- Hide_Non_Overridden_Subprograms --
10703 -------------------------------------
10705 procedure Hide_Non_Overridden_Subprograms
(Typ
: Entity_Id
) is
10706 procedure Hide_Matching_Homographs
10707 (Subp_Id
: Entity_Id
;
10708 Start_Elmt
: Elmt_Id
);
10709 -- Inspect a list of primitive operations starting with Start_Elmt
10710 -- and find matching implicitly declared non-overridden non-fully
10711 -- conformant homographs of Subp_Id. If found, all matches along
10712 -- with Subp_Id are hidden from all visibility.
10714 function Is_Non_Overridden_Or_Null_Procedure
10715 (Subp_Id
: Entity_Id
) return Boolean;
10716 -- Determine whether subprogram Subp_Id is implicitly declared non-
10717 -- overridden subprogram or an implicitly declared null procedure.
10719 ------------------------------
10720 -- Hide_Matching_Homographs --
10721 ------------------------------
10723 procedure Hide_Matching_Homographs
10724 (Subp_Id
: Entity_Id
;
10725 Start_Elmt
: Elmt_Id
)
10728 Prim_Elmt
: Elmt_Id
;
10731 Prim_Elmt
:= Start_Elmt
;
10732 while Present
(Prim_Elmt
) loop
10733 Prim
:= Node
(Prim_Elmt
);
10735 -- The current primitive is implicitly declared non-overridden
10736 -- non-fully conformant homograph of Subp_Id. Both subprograms
10737 -- must be hidden from visibility.
10739 if Chars
(Prim
) = Chars
(Subp_Id
)
10740 and then Is_Non_Overridden_Or_Null_Procedure
(Prim
)
10741 and then not Fully_Conformant
(Prim
, Subp_Id
)
10743 Set_Is_Hidden_Non_Overridden_Subpgm
(Prim
);
10744 Set_Is_Immediately_Visible
(Prim
, False);
10745 Set_Is_Potentially_Use_Visible
(Prim
, False);
10747 Set_Is_Hidden_Non_Overridden_Subpgm
(Subp_Id
);
10748 Set_Is_Immediately_Visible
(Subp_Id
, False);
10749 Set_Is_Potentially_Use_Visible
(Subp_Id
, False);
10752 Next_Elmt
(Prim_Elmt
);
10754 end Hide_Matching_Homographs
;
10756 -----------------------------------------
10757 -- Is_Non_Overridden_Or_Null_Procedure --
10758 -----------------------------------------
10760 function Is_Non_Overridden_Or_Null_Procedure
10761 (Subp_Id
: Entity_Id
) return Boolean
10763 Alias_Id
: Entity_Id
;
10766 -- The subprogram is inherited (implicitly declared), it does not
10767 -- override and does not cover a primitive of an interface.
10769 if Ekind_In
(Subp_Id
, E_Function
, E_Procedure
)
10770 and then Present
(Alias
(Subp_Id
))
10771 and then No
(Interface_Alias
(Subp_Id
))
10772 and then No
(Overridden_Operation
(Subp_Id
))
10774 Alias_Id
:= Alias
(Subp_Id
);
10776 if Requires_Overriding
(Alias_Id
) then
10779 elsif Nkind
(Parent
(Alias_Id
)) = N_Procedure_Specification
10780 and then Null_Present
(Parent
(Alias_Id
))
10787 end Is_Non_Overridden_Or_Null_Procedure
;
10791 Prim_Ops
: constant Elist_Id
:= Direct_Primitive_Operations
(Typ
);
10793 Prim_Elmt
: Elmt_Id
;
10795 -- Start of processing for Hide_Non_Overridden_Subprograms
10798 -- Inspect the list of primitives looking for non-overridden
10801 if Present
(Prim_Ops
) then
10802 Prim_Elmt
:= First_Elmt
(Prim_Ops
);
10803 while Present
(Prim_Elmt
) loop
10804 Prim
:= Node
(Prim_Elmt
);
10805 Next_Elmt
(Prim_Elmt
);
10807 if Is_Non_Overridden_Or_Null_Procedure
(Prim
) then
10808 Hide_Matching_Homographs
10810 Start_Elmt
=> Prim_Elmt
);
10814 end Hide_Non_Overridden_Subprograms
;
10818 E
: constant Entity_Id
:= Entity
(N
);
10820 Non_Generic_Case
: constant Boolean := Nkind
(N
) = N_Freeze_Entity
;
10821 -- True in non-generic case. Some of the processing here is skipped
10822 -- for the generic case since it is not needed. Basically in the
10823 -- generic case, we only need to do stuff that might generate error
10824 -- messages or warnings.
10826 -- Start of processing for Freeze_Entity_Checks
10829 -- Remember that we are processing a freezing entity. Required to
10830 -- ensure correct decoration of internal entities associated with
10831 -- interfaces (see New_Overloaded_Entity).
10833 Inside_Freezing_Actions
:= Inside_Freezing_Actions
+ 1;
10835 -- For tagged types covering interfaces add internal entities that link
10836 -- the primitives of the interfaces with the primitives that cover them.
10837 -- Note: These entities were originally generated only when generating
10838 -- code because their main purpose was to provide support to initialize
10839 -- the secondary dispatch tables. They are now generated also when
10840 -- compiling with no code generation to provide ASIS the relationship
10841 -- between interface primitives and tagged type primitives. They are
10842 -- also used to locate primitives covering interfaces when processing
10843 -- generics (see Derive_Subprograms).
10845 -- This is not needed in the generic case
10847 if Ada_Version
>= Ada_2005
10848 and then Non_Generic_Case
10849 and then Ekind
(E
) = E_Record_Type
10850 and then Is_Tagged_Type
(E
)
10851 and then not Is_Interface
(E
)
10852 and then Has_Interfaces
(E
)
10854 -- This would be a good common place to call the routine that checks
10855 -- overriding of interface primitives (and thus factorize calls to
10856 -- Check_Abstract_Overriding located at different contexts in the
10857 -- compiler). However, this is not possible because it causes
10858 -- spurious errors in case of late overriding.
10860 Add_Internal_Interface_Entities
(E
);
10863 -- After all forms of overriding have been resolved, a tagged type may
10864 -- be left with a set of implicitly declared and possibly erroneous
10865 -- abstract subprograms, null procedures and subprograms that require
10866 -- overriding. If this set contains fully conformant homographs, then
10867 -- one is chosen arbitrarily (already done during resolution), otherwise
10868 -- all remaining non-fully conformant homographs are hidden from
10869 -- visibility (Ada RM 8.3 12.3/2).
10871 if Is_Tagged_Type
(E
) then
10872 Hide_Non_Overridden_Subprograms
(E
);
10877 if Ekind
(E
) = E_Record_Type
10878 and then Is_CPP_Class
(E
)
10879 and then Is_Tagged_Type
(E
)
10880 and then Tagged_Type_Expansion
10882 if CPP_Num_Prims
(E
) = 0 then
10884 -- If the CPP type has user defined components then it must import
10885 -- primitives from C++. This is required because if the C++ class
10886 -- has no primitives then the C++ compiler does not added the _tag
10887 -- component to the type.
10889 if First_Entity
(E
) /= Last_Entity
(E
) then
10891 ("'C'P'P type must import at least one primitive from C++??",
10896 -- Check that all its primitives are abstract or imported from C++.
10897 -- Check also availability of the C++ constructor.
10900 Has_Constructors
: constant Boolean := Has_CPP_Constructors
(E
);
10902 Error_Reported
: Boolean := False;
10906 Elmt
:= First_Elmt
(Primitive_Operations
(E
));
10907 while Present
(Elmt
) loop
10908 Prim
:= Node
(Elmt
);
10910 if Comes_From_Source
(Prim
) then
10911 if Is_Abstract_Subprogram
(Prim
) then
10914 elsif not Is_Imported
(Prim
)
10915 or else Convention
(Prim
) /= Convention_CPP
10918 ("primitives of 'C'P'P types must be imported from C++ "
10919 & "or abstract??", Prim
);
10921 elsif not Has_Constructors
10922 and then not Error_Reported
10924 Error_Msg_Name_1
:= Chars
(E
);
10926 ("??'C'P'P constructor required for type %", Prim
);
10927 Error_Reported
:= True;
10936 -- Check Ada derivation of CPP type
10938 if Expander_Active
-- why? losing errors in -gnatc mode???
10939 and then Present
(Etype
(E
)) -- defend against errors
10940 and then Tagged_Type_Expansion
10941 and then Ekind
(E
) = E_Record_Type
10942 and then Etype
(E
) /= E
10943 and then Is_CPP_Class
(Etype
(E
))
10944 and then CPP_Num_Prims
(Etype
(E
)) > 0
10945 and then not Is_CPP_Class
(E
)
10946 and then not Has_CPP_Constructors
(Etype
(E
))
10948 -- If the parent has C++ primitives but it has no constructor then
10949 -- check that all the primitives are overridden in this derivation;
10950 -- otherwise the constructor of the parent is needed to build the
10958 Elmt
:= First_Elmt
(Primitive_Operations
(E
));
10959 while Present
(Elmt
) loop
10960 Prim
:= Node
(Elmt
);
10962 if not Is_Abstract_Subprogram
(Prim
)
10963 and then No
(Interface_Alias
(Prim
))
10964 and then Find_Dispatching_Type
(Ultimate_Alias
(Prim
)) /= E
10966 Error_Msg_Name_1
:= Chars
(Etype
(E
));
10968 ("'C'P'P constructor required for parent type %", E
);
10977 Inside_Freezing_Actions
:= Inside_Freezing_Actions
- 1;
10979 -- If we have a type with predicates, build predicate function. This is
10980 -- not needed in the generic case, nor within TSS subprograms and other
10981 -- predefined primitives.
10984 and then Non_Generic_Case
10985 and then not Within_Internal_Subprogram
10986 and then Has_Predicates
(E
)
10988 Build_Predicate_Functions
(E
, N
);
10991 -- If type has delayed aspects, this is where we do the preanalysis at
10992 -- the freeze point, as part of the consistent visibility check. Note
10993 -- that this must be done after calling Build_Predicate_Functions or
10994 -- Build_Invariant_Procedure since these subprograms fix occurrences of
10995 -- the subtype name in the saved expression so that they will not cause
10996 -- trouble in the preanalysis.
10998 -- This is also not needed in the generic case
11000 if Non_Generic_Case
11001 and then Has_Delayed_Aspects
(E
)
11002 and then Scope
(E
) = Current_Scope
11004 -- Retrieve the visibility to the discriminants in order to properly
11005 -- analyze the aspects.
11007 Push_Scope_And_Install_Discriminants
(E
);
11013 -- Look for aspect specification entries for this entity
11015 Ritem
:= First_Rep_Item
(E
);
11016 while Present
(Ritem
) loop
11017 if Nkind
(Ritem
) = N_Aspect_Specification
11018 and then Entity
(Ritem
) = E
11019 and then Is_Delayed_Aspect
(Ritem
)
11021 Check_Aspect_At_Freeze_Point
(Ritem
);
11024 Next_Rep_Item
(Ritem
);
11028 Uninstall_Discriminants_And_Pop_Scope
(E
);
11031 -- For a record type, deal with variant parts. This has to be delayed
11032 -- to this point, because of the issue of statically predicated
11033 -- subtypes, which we have to ensure are frozen before checking
11034 -- choices, since we need to have the static choice list set.
11036 if Is_Record_Type
(E
) then
11037 Check_Variant_Part
: declare
11038 D
: constant Node_Id
:= Declaration_Node
(E
);
11043 Others_Present
: Boolean;
11044 pragma Warnings
(Off
, Others_Present
);
11045 -- Indicates others present, not used in this case
11047 procedure Non_Static_Choice_Error
(Choice
: Node_Id
);
11048 -- Error routine invoked by the generic instantiation below when
11049 -- the variant part has a non static choice.
11051 procedure Process_Declarations
(Variant
: Node_Id
);
11052 -- Processes declarations associated with a variant. We analyzed
11053 -- the declarations earlier (in Sem_Ch3.Analyze_Variant_Part),
11054 -- but we still need the recursive call to Check_Choices for any
11055 -- nested variant to get its choices properly processed. This is
11056 -- also where we expand out the choices if expansion is active.
11058 package Variant_Choices_Processing
is new
11059 Generic_Check_Choices
11060 (Process_Empty_Choice
=> No_OP
,
11061 Process_Non_Static_Choice
=> Non_Static_Choice_Error
,
11062 Process_Associated_Node
=> Process_Declarations
);
11063 use Variant_Choices_Processing
;
11065 -----------------------------
11066 -- Non_Static_Choice_Error --
11067 -----------------------------
11069 procedure Non_Static_Choice_Error
(Choice
: Node_Id
) is
11071 Flag_Non_Static_Expr
11072 ("choice given in variant part is not static!", Choice
);
11073 end Non_Static_Choice_Error
;
11075 --------------------------
11076 -- Process_Declarations --
11077 --------------------------
11079 procedure Process_Declarations
(Variant
: Node_Id
) is
11080 CL
: constant Node_Id
:= Component_List
(Variant
);
11084 -- Check for static predicate present in this variant
11086 if Has_SP_Choice
(Variant
) then
11088 -- Here we expand. You might expect to find this call in
11089 -- Expand_N_Variant_Part, but that is called when we first
11090 -- see the variant part, and we cannot do this expansion
11091 -- earlier than the freeze point, since for statically
11092 -- predicated subtypes, the predicate is not known till
11093 -- the freeze point.
11095 -- Furthermore, we do this expansion even if the expander
11096 -- is not active, because other semantic processing, e.g.
11097 -- for aggregates, requires the expanded list of choices.
11099 -- If the expander is not active, then we can't just clobber
11100 -- the list since it would invalidate the ASIS -gnatct tree.
11101 -- So we have to rewrite the variant part with a Rewrite
11102 -- call that replaces it with a copy and clobber the copy.
11104 if not Expander_Active
then
11106 NewV
: constant Node_Id
:= New_Copy
(Variant
);
11108 Set_Discrete_Choices
11109 (NewV
, New_Copy_List
(Discrete_Choices
(Variant
)));
11110 Rewrite
(Variant
, NewV
);
11114 Expand_Static_Predicates_In_Choices
(Variant
);
11117 -- We don't need to worry about the declarations in the variant
11118 -- (since they were analyzed by Analyze_Choices when we first
11119 -- encountered the variant), but we do need to take care of
11120 -- expansion of any nested variants.
11122 if not Null_Present
(CL
) then
11123 VP
:= Variant_Part
(CL
);
11125 if Present
(VP
) then
11127 (VP
, Variants
(VP
), Etype
(Name
(VP
)), Others_Present
);
11130 end Process_Declarations
;
11132 -- Start of processing for Check_Variant_Part
11135 -- Find component list
11139 if Nkind
(D
) = N_Full_Type_Declaration
then
11140 T
:= Type_Definition
(D
);
11142 if Nkind
(T
) = N_Record_Definition
then
11143 C
:= Component_List
(T
);
11145 elsif Nkind
(T
) = N_Derived_Type_Definition
11146 and then Present
(Record_Extension_Part
(T
))
11148 C
:= Component_List
(Record_Extension_Part
(T
));
11152 -- Case of variant part present
11154 if Present
(C
) and then Present
(Variant_Part
(C
)) then
11155 VP
:= Variant_Part
(C
);
11160 (VP
, Variants
(VP
), Etype
(Name
(VP
)), Others_Present
);
11162 -- If the last variant does not contain the Others choice,
11163 -- replace it with an N_Others_Choice node since Gigi always
11164 -- wants an Others. Note that we do not bother to call Analyze
11165 -- on the modified variant part, since its only effect would be
11166 -- to compute the Others_Discrete_Choices node laboriously, and
11167 -- of course we already know the list of choices corresponding
11168 -- to the others choice (it's the list we're replacing).
11170 -- We only want to do this if the expander is active, since
11171 -- we do not want to clobber the ASIS tree.
11173 if Expander_Active
then
11175 Last_Var
: constant Node_Id
:=
11176 Last_Non_Pragma
(Variants
(VP
));
11178 Others_Node
: Node_Id
;
11181 if Nkind
(First
(Discrete_Choices
(Last_Var
))) /=
11184 Others_Node
:= Make_Others_Choice
(Sloc
(Last_Var
));
11185 Set_Others_Discrete_Choices
11186 (Others_Node
, Discrete_Choices
(Last_Var
));
11187 Set_Discrete_Choices
11188 (Last_Var
, New_List
(Others_Node
));
11193 end Check_Variant_Part
;
11195 end Freeze_Entity_Checks
;
11197 -------------------------
11198 -- Get_Alignment_Value --
11199 -------------------------
11201 function Get_Alignment_Value
(Expr
: Node_Id
) return Uint
is
11202 Align
: constant Uint
:= Static_Integer
(Expr
);
11205 if Align
= No_Uint
then
11208 elsif Align
<= 0 then
11210 -- This error is suppressed in ASIS mode to allow for different ASIS
11211 -- back ends or ASIS-based tools to query the illegal clause.
11213 if not ASIS_Mode
then
11214 Error_Msg_N
("alignment value must be positive", Expr
);
11220 for J
in Int
range 0 .. 64 loop
11222 M
: constant Uint
:= Uint_2
** J
;
11225 exit when M
= Align
;
11229 -- This error is suppressed in ASIS mode to allow for
11230 -- different ASIS back ends or ASIS-based tools to query the
11233 if not ASIS_Mode
then
11234 Error_Msg_N
("alignment value must be power of 2", Expr
);
11244 end Get_Alignment_Value
;
11246 -------------------------------------
11247 -- Inherit_Aspects_At_Freeze_Point --
11248 -------------------------------------
11250 procedure Inherit_Aspects_At_Freeze_Point
(Typ
: Entity_Id
) is
11251 function Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11252 (Rep_Item
: Node_Id
) return Boolean;
11253 -- This routine checks if Rep_Item is either a pragma or an aspect
11254 -- specification node whose correponding pragma (if any) is present in
11255 -- the Rep Item chain of the entity it has been specified to.
11257 --------------------------------------------------
11258 -- Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item --
11259 --------------------------------------------------
11261 function Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11262 (Rep_Item
: Node_Id
) return Boolean
11266 Nkind
(Rep_Item
) = N_Pragma
11267 or else Present_In_Rep_Item
11268 (Entity
(Rep_Item
), Aspect_Rep_Item
(Rep_Item
));
11269 end Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
;
11271 -- Start of processing for Inherit_Aspects_At_Freeze_Point
11274 -- A representation item is either subtype-specific (Size and Alignment
11275 -- clauses) or type-related (all others). Subtype-specific aspects may
11276 -- differ for different subtypes of the same type (RM 13.1.8).
11278 -- A derived type inherits each type-related representation aspect of
11279 -- its parent type that was directly specified before the declaration of
11280 -- the derived type (RM 13.1.15).
11282 -- A derived subtype inherits each subtype-specific representation
11283 -- aspect of its parent subtype that was directly specified before the
11284 -- declaration of the derived type (RM 13.1.15).
11286 -- The general processing involves inheriting a representation aspect
11287 -- from a parent type whenever the first rep item (aspect specification,
11288 -- attribute definition clause, pragma) corresponding to the given
11289 -- representation aspect in the rep item chain of Typ, if any, isn't
11290 -- directly specified to Typ but to one of its parents.
11292 -- ??? Note that, for now, just a limited number of representation
11293 -- aspects have been inherited here so far. Many of them are
11294 -- still inherited in Sem_Ch3. This will be fixed soon. Here is
11295 -- a non- exhaustive list of aspects that likely also need to
11296 -- be moved to this routine: Alignment, Component_Alignment,
11297 -- Component_Size, Machine_Radix, Object_Size, Pack, Predicates,
11298 -- Preelaborable_Initialization, RM_Size and Small.
11300 -- In addition, Convention must be propagated from base type to subtype,
11301 -- because the subtype may have been declared on an incomplete view.
11303 if Nkind
(Parent
(Typ
)) = N_Private_Extension_Declaration
then
11309 if not Has_Rep_Item
(Typ
, Name_Ada_05
, Name_Ada_2005
, False)
11310 and then Has_Rep_Item
(Typ
, Name_Ada_05
, Name_Ada_2005
)
11311 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11312 (Get_Rep_Item
(Typ
, Name_Ada_05
, Name_Ada_2005
))
11314 Set_Is_Ada_2005_Only
(Typ
);
11319 if not Has_Rep_Item
(Typ
, Name_Ada_12
, Name_Ada_2012
, False)
11320 and then Has_Rep_Item
(Typ
, Name_Ada_12
, Name_Ada_2012
)
11321 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11322 (Get_Rep_Item
(Typ
, Name_Ada_12
, Name_Ada_2012
))
11324 Set_Is_Ada_2012_Only
(Typ
);
11329 if not Has_Rep_Item
(Typ
, Name_Atomic
, Name_Shared
, False)
11330 and then Has_Rep_Pragma
(Typ
, Name_Atomic
, Name_Shared
)
11331 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11332 (Get_Rep_Item
(Typ
, Name_Atomic
, Name_Shared
))
11334 Set_Is_Atomic
(Typ
);
11335 Set_Is_Volatile
(Typ
);
11336 Set_Treat_As_Volatile
(Typ
);
11341 if Is_Record_Type
(Typ
)
11342 and then Typ
/= Base_Type
(Typ
) and then Is_Frozen
(Base_Type
(Typ
))
11344 Set_Convention
(Typ
, Convention
(Base_Type
(Typ
)));
11347 -- Default_Component_Value
11349 -- Verify that there is no rep_item declared for the type, and there
11350 -- is one coming from an ancestor.
11352 if Is_Array_Type
(Typ
)
11353 and then Is_Base_Type
(Typ
)
11354 and then not Has_Rep_Item
(Typ
, Name_Default_Component_Value
, False)
11355 and then Has_Rep_Item
(Typ
, Name_Default_Component_Value
)
11357 Set_Default_Aspect_Component_Value
(Typ
,
11358 Default_Aspect_Component_Value
11359 (Entity
(Get_Rep_Item
(Typ
, Name_Default_Component_Value
))));
11364 if Is_Scalar_Type
(Typ
)
11365 and then Is_Base_Type
(Typ
)
11366 and then not Has_Rep_Item
(Typ
, Name_Default_Value
, False)
11367 and then Has_Rep_Item
(Typ
, Name_Default_Value
)
11369 Set_Has_Default_Aspect
(Typ
);
11370 Set_Default_Aspect_Value
(Typ
,
11371 Default_Aspect_Value
11372 (Entity
(Get_Rep_Item
(Typ
, Name_Default_Value
))));
11377 if not Has_Rep_Item
(Typ
, Name_Discard_Names
, False)
11378 and then Has_Rep_Item
(Typ
, Name_Discard_Names
)
11379 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11380 (Get_Rep_Item
(Typ
, Name_Discard_Names
))
11382 Set_Discard_Names
(Typ
);
11387 if not Has_Rep_Item
(Typ
, Name_Volatile
, False)
11388 and then Has_Rep_Item
(Typ
, Name_Volatile
)
11389 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11390 (Get_Rep_Item
(Typ
, Name_Volatile
))
11392 Set_Is_Volatile
(Typ
);
11393 Set_Treat_As_Volatile
(Typ
);
11396 -- Volatile_Full_Access
11398 if not Has_Rep_Item
(Typ
, Name_Volatile_Full_Access
, False)
11399 and then Has_Rep_Pragma
(Typ
, Name_Volatile_Full_Access
)
11400 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11401 (Get_Rep_Item
(Typ
, Name_Volatile_Full_Access
))
11403 Set_Is_Volatile_Full_Access
(Typ
);
11404 Set_Is_Volatile
(Typ
);
11405 Set_Treat_As_Volatile
(Typ
);
11408 -- Inheritance for derived types only
11410 if Is_Derived_Type
(Typ
) then
11412 Bas_Typ
: constant Entity_Id
:= Base_Type
(Typ
);
11413 Imp_Bas_Typ
: constant Entity_Id
:= Implementation_Base_Type
(Typ
);
11416 -- Atomic_Components
11418 if not Has_Rep_Item
(Typ
, Name_Atomic_Components
, False)
11419 and then Has_Rep_Item
(Typ
, Name_Atomic_Components
)
11420 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11421 (Get_Rep_Item
(Typ
, Name_Atomic_Components
))
11423 Set_Has_Atomic_Components
(Imp_Bas_Typ
);
11426 -- Volatile_Components
11428 if not Has_Rep_Item
(Typ
, Name_Volatile_Components
, False)
11429 and then Has_Rep_Item
(Typ
, Name_Volatile_Components
)
11430 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11431 (Get_Rep_Item
(Typ
, Name_Volatile_Components
))
11433 Set_Has_Volatile_Components
(Imp_Bas_Typ
);
11436 -- Finalize_Storage_Only
11438 if not Has_Rep_Pragma
(Typ
, Name_Finalize_Storage_Only
, False)
11439 and then Has_Rep_Pragma
(Typ
, Name_Finalize_Storage_Only
)
11441 Set_Finalize_Storage_Only
(Bas_Typ
);
11444 -- Universal_Aliasing
11446 if not Has_Rep_Item
(Typ
, Name_Universal_Aliasing
, False)
11447 and then Has_Rep_Item
(Typ
, Name_Universal_Aliasing
)
11448 and then Is_Pragma_Or_Corr_Pragma_Present_In_Rep_Item
11449 (Get_Rep_Item
(Typ
, Name_Universal_Aliasing
))
11451 Set_Universal_Aliasing
(Imp_Bas_Typ
);
11456 if Is_Record_Type
(Typ
) then
11457 if not Has_Rep_Item
(Typ
, Name_Bit_Order
, False)
11458 and then Has_Rep_Item
(Typ
, Name_Bit_Order
)
11460 Set_Reverse_Bit_Order
(Bas_Typ
,
11461 Reverse_Bit_Order
(Entity
(Name
11462 (Get_Rep_Item
(Typ
, Name_Bit_Order
)))));
11466 -- Scalar_Storage_Order
11468 -- Note: the aspect is specified on a first subtype, but recorded
11469 -- in a flag of the base type!
11471 if (Is_Record_Type
(Typ
) or else Is_Array_Type
(Typ
))
11472 and then Typ
= Bas_Typ
11474 -- For a type extension, always inherit from parent; otherwise
11475 -- inherit if no default applies. Note: we do not check for
11476 -- an explicit rep item on the parent type when inheriting,
11477 -- because the parent SSO may itself have been set by default.
11479 if not Has_Rep_Item
(First_Subtype
(Typ
),
11480 Name_Scalar_Storage_Order
, False)
11481 and then (Is_Tagged_Type
(Bas_Typ
)
11482 or else not (SSO_Set_Low_By_Default
(Bas_Typ
)
11484 SSO_Set_High_By_Default
(Bas_Typ
)))
11486 Set_Reverse_Storage_Order
(Bas_Typ
,
11487 Reverse_Storage_Order
11488 (Implementation_Base_Type
(Etype
(Bas_Typ
))));
11490 -- Clear default SSO indications, since the inherited aspect
11491 -- which was set explicitly overrides the default.
11493 Set_SSO_Set_Low_By_Default
(Bas_Typ
, False);
11494 Set_SSO_Set_High_By_Default
(Bas_Typ
, False);
11499 end Inherit_Aspects_At_Freeze_Point
;
11505 procedure Initialize
is
11507 Address_Clause_Checks
.Init
;
11508 Compile_Time_Warnings_Errors
.Init
;
11509 Unchecked_Conversions
.Init
;
11511 if AAMP_On_Target
then
11512 Independence_Checks
.Init
;
11516 ---------------------------
11517 -- Install_Discriminants --
11518 ---------------------------
11520 procedure Install_Discriminants
(E
: Entity_Id
) is
11524 Disc
:= First_Discriminant
(E
);
11525 while Present
(Disc
) loop
11526 Prev
:= Current_Entity
(Disc
);
11527 Set_Current_Entity
(Disc
);
11528 Set_Is_Immediately_Visible
(Disc
);
11529 Set_Homonym
(Disc
, Prev
);
11530 Next_Discriminant
(Disc
);
11532 end Install_Discriminants
;
11534 -------------------------
11535 -- Is_Operational_Item --
11536 -------------------------
11538 function Is_Operational_Item
(N
: Node_Id
) return Boolean is
11540 if Nkind
(N
) /= N_Attribute_Definition_Clause
then
11545 Id
: constant Attribute_Id
:= Get_Attribute_Id
(Chars
(N
));
11548 -- List of operational items is given in AARM 13.1(8.mm/1).
11549 -- It is clearly incomplete, as it does not include iterator
11550 -- aspects, among others.
11552 return Id
= Attribute_Constant_Indexing
11553 or else Id
= Attribute_Default_Iterator
11554 or else Id
= Attribute_Implicit_Dereference
11555 or else Id
= Attribute_Input
11556 or else Id
= Attribute_Iterator_Element
11557 or else Id
= Attribute_Iterable
11558 or else Id
= Attribute_Output
11559 or else Id
= Attribute_Read
11560 or else Id
= Attribute_Variable_Indexing
11561 or else Id
= Attribute_Write
11562 or else Id
= Attribute_External_Tag
;
11565 end Is_Operational_Item
;
11567 -------------------------
11568 -- Is_Predicate_Static --
11569 -------------------------
11571 -- Note: the basic legality of the expression has already been checked, so
11572 -- we don't need to worry about cases or ranges on strings for example.
11574 function Is_Predicate_Static
11576 Nam
: Name_Id
) return Boolean
11578 function All_Static_Case_Alternatives
(L
: List_Id
) return Boolean;
11579 -- Given a list of case expression alternatives, returns True if all
11580 -- the alternatives are static (have all static choices, and a static
11583 function All_Static_Choices
(L
: List_Id
) return Boolean;
11584 -- Returns true if all elements of the list are OK static choices
11585 -- as defined below for Is_Static_Choice. Used for case expression
11586 -- alternatives and for the right operand of a membership test. An
11587 -- others_choice is static if the corresponding expression is static.
11588 -- The staticness of the bounds is checked separately.
11590 function Is_Static_Choice
(N
: Node_Id
) return Boolean;
11591 -- Returns True if N represents a static choice (static subtype, or
11592 -- static subtype indication, or static expression, or static range).
11594 -- Note that this is a bit more inclusive than we actually need
11595 -- (in particular membership tests do not allow the use of subtype
11596 -- indications). But that doesn't matter, we have already checked
11597 -- that the construct is legal to get this far.
11599 function Is_Type_Ref
(N
: Node_Id
) return Boolean;
11600 pragma Inline
(Is_Type_Ref
);
11601 -- Returns True if N is a reference to the type for the predicate in the
11602 -- expression (i.e. if it is an identifier whose Chars field matches the
11603 -- Nam given in the call). N must not be parenthesized, if the type name
11604 -- appears in parens, this routine will return False.
11606 -- The routine also returns True for function calls generated during the
11607 -- expansion of comparison operators on strings, which are intended to
11608 -- be legal in static predicates, and are converted into calls to array
11609 -- comparison routines in the body of the corresponding predicate
11612 ----------------------------------
11613 -- All_Static_Case_Alternatives --
11614 ----------------------------------
11616 function All_Static_Case_Alternatives
(L
: List_Id
) return Boolean is
11621 while Present
(N
) loop
11622 if not (All_Static_Choices
(Discrete_Choices
(N
))
11623 and then Is_OK_Static_Expression
(Expression
(N
)))
11632 end All_Static_Case_Alternatives
;
11634 ------------------------
11635 -- All_Static_Choices --
11636 ------------------------
11638 function All_Static_Choices
(L
: List_Id
) return Boolean is
11643 while Present
(N
) loop
11644 if not Is_Static_Choice
(N
) then
11652 end All_Static_Choices
;
11654 ----------------------
11655 -- Is_Static_Choice --
11656 ----------------------
11658 function Is_Static_Choice
(N
: Node_Id
) return Boolean is
11660 return Nkind
(N
) = N_Others_Choice
11661 or else Is_OK_Static_Expression
(N
)
11662 or else (Is_Entity_Name
(N
) and then Is_Type
(Entity
(N
))
11663 and then Is_OK_Static_Subtype
(Entity
(N
)))
11664 or else (Nkind
(N
) = N_Subtype_Indication
11665 and then Is_OK_Static_Subtype
(Entity
(N
)))
11666 or else (Nkind
(N
) = N_Range
and then Is_OK_Static_Range
(N
));
11667 end Is_Static_Choice
;
11673 function Is_Type_Ref
(N
: Node_Id
) return Boolean is
11675 return (Nkind
(N
) = N_Identifier
11676 and then Chars
(N
) = Nam
11677 and then Paren_Count
(N
) = 0)
11678 or else Nkind
(N
) = N_Function_Call
;
11681 -- Start of processing for Is_Predicate_Static
11684 -- Predicate_Static means one of the following holds. Numbers are the
11685 -- corresponding paragraph numbers in (RM 3.2.4(16-22)).
11687 -- 16: A static expression
11689 if Is_OK_Static_Expression
(Expr
) then
11692 -- 17: A membership test whose simple_expression is the current
11693 -- instance, and whose membership_choice_list meets the requirements
11694 -- for a static membership test.
11696 elsif Nkind
(Expr
) in N_Membership_Test
11697 and then ((Present
(Right_Opnd
(Expr
))
11698 and then Is_Static_Choice
(Right_Opnd
(Expr
)))
11700 (Present
(Alternatives
(Expr
))
11701 and then All_Static_Choices
(Alternatives
(Expr
))))
11705 -- 18. A case_expression whose selecting_expression is the current
11706 -- instance, and whose dependent expressions are static expressions.
11708 elsif Nkind
(Expr
) = N_Case_Expression
11709 and then Is_Type_Ref
(Expression
(Expr
))
11710 and then All_Static_Case_Alternatives
(Alternatives
(Expr
))
11714 -- 19. A call to a predefined equality or ordering operator, where one
11715 -- operand is the current instance, and the other is a static
11718 -- Note: the RM is clearly wrong here in not excluding string types.
11719 -- Without this exclusion, we would allow expressions like X > "ABC"
11720 -- to be considered as predicate-static, which is clearly not intended,
11721 -- since the idea is for predicate-static to be a subset of normal
11722 -- static expressions (and "DEF" > "ABC" is not a static expression).
11724 -- However, we do allow internally generated (not from source) equality
11725 -- and inequality operations to be valid on strings (this helps deal
11726 -- with cases where we transform A in "ABC" to A = "ABC).
11728 -- In fact, it appears that the intent of the ARG is to extend static
11729 -- predicates to strings, and that the extension should probably apply
11730 -- to static expressions themselves. The code below accepts comparison
11731 -- operators that apply to static strings.
11733 elsif Nkind
(Expr
) in N_Op_Compare
11734 and then ((Is_Type_Ref
(Left_Opnd
(Expr
))
11735 and then Is_OK_Static_Expression
(Right_Opnd
(Expr
)))
11737 (Is_Type_Ref
(Right_Opnd
(Expr
))
11738 and then Is_OK_Static_Expression
(Left_Opnd
(Expr
))))
11742 -- 20. A call to a predefined boolean logical operator, where each
11743 -- operand is predicate-static.
11745 elsif (Nkind_In
(Expr
, N_Op_And
, N_Op_Or
, N_Op_Xor
)
11746 and then Is_Predicate_Static
(Left_Opnd
(Expr
), Nam
)
11747 and then Is_Predicate_Static
(Right_Opnd
(Expr
), Nam
))
11749 (Nkind
(Expr
) = N_Op_Not
11750 and then Is_Predicate_Static
(Right_Opnd
(Expr
), Nam
))
11754 -- 21. A short-circuit control form where both operands are
11755 -- predicate-static.
11757 elsif Nkind
(Expr
) in N_Short_Circuit
11758 and then Is_Predicate_Static
(Left_Opnd
(Expr
), Nam
)
11759 and then Is_Predicate_Static
(Right_Opnd
(Expr
), Nam
)
11763 -- 22. A parenthesized predicate-static expression. This does not
11764 -- require any special test, since we just ignore paren levels in
11765 -- all the cases above.
11767 -- One more test that is an implementation artifact caused by the fact
11768 -- that we are analyzing not the original expression, but the generated
11769 -- expression in the body of the predicate function. This can include
11770 -- references to inherited predicates, so that the expression we are
11771 -- processing looks like:
11773 -- xxPredicate (typ (Inns)) and then expression
11775 -- Where the call is to a Predicate function for an inherited predicate.
11776 -- We simply ignore such a call, which could be to either a dynamic or
11777 -- a static predicate. Note that if the parent predicate is dynamic then
11778 -- eventually this type will be marked as dynamic, but you are allowed
11779 -- to specify a static predicate for a subtype which is inheriting a
11780 -- dynamic predicate, so the static predicate validation here ignores
11781 -- the inherited predicate even if it is dynamic.
11782 -- In all cases, a static predicate can only apply to a scalar type.
11784 elsif Nkind
(Expr
) = N_Function_Call
11785 and then Is_Predicate_Function
(Entity
(Name
(Expr
)))
11786 and then Is_Scalar_Type
(Etype
(First_Entity
(Entity
(Name
(Expr
)))))
11790 -- That's an exhaustive list of tests, all other cases are not
11791 -- predicate-static, so we return False.
11796 end Is_Predicate_Static
;
11798 ---------------------
11799 -- Kill_Rep_Clause --
11800 ---------------------
11802 procedure Kill_Rep_Clause
(N
: Node_Id
) is
11804 pragma Assert
(Ignore_Rep_Clauses
);
11806 -- Note: we use Replace rather than Rewrite, because we don't want
11807 -- ASIS to be able to use Original_Node to dig out the (undecorated)
11808 -- rep clause that is being replaced.
11810 Replace
(N
, Make_Null_Statement
(Sloc
(N
)));
11812 -- The null statement must be marked as not coming from source. This is
11813 -- so that ASIS ignores it, and also the back end does not expect bogus
11814 -- "from source" null statements in weird places (e.g. in declarative
11815 -- regions where such null statements are not allowed).
11817 Set_Comes_From_Source
(N
, False);
11818 end Kill_Rep_Clause
;
11824 function Minimum_Size
11826 Biased
: Boolean := False) return Nat
11828 Lo
: Uint
:= No_Uint
;
11829 Hi
: Uint
:= No_Uint
;
11830 LoR
: Ureal
:= No_Ureal
;
11831 HiR
: Ureal
:= No_Ureal
;
11832 LoSet
: Boolean := False;
11833 HiSet
: Boolean := False;
11836 Ancest
: Entity_Id
;
11837 R_Typ
: constant Entity_Id
:= Root_Type
(T
);
11840 -- If bad type, return 0
11842 if T
= Any_Type
then
11845 -- For generic types, just return zero. There cannot be any legitimate
11846 -- need to know such a size, but this routine may be called with a
11847 -- generic type as part of normal processing.
11849 elsif Is_Generic_Type
(R_Typ
) or else R_Typ
= Any_Type
then
11852 -- Access types (cannot have size smaller than System.Address)
11854 elsif Is_Access_Type
(T
) then
11855 return System_Address_Size
;
11857 -- Floating-point types
11859 elsif Is_Floating_Point_Type
(T
) then
11860 return UI_To_Int
(Esize
(R_Typ
));
11864 elsif Is_Discrete_Type
(T
) then
11866 -- The following loop is looking for the nearest compile time known
11867 -- bounds following the ancestor subtype chain. The idea is to find
11868 -- the most restrictive known bounds information.
11872 if Ancest
= Any_Type
or else Etype
(Ancest
) = Any_Type
then
11877 if Compile_Time_Known_Value
(Type_Low_Bound
(Ancest
)) then
11878 Lo
:= Expr_Rep_Value
(Type_Low_Bound
(Ancest
));
11885 if Compile_Time_Known_Value
(Type_High_Bound
(Ancest
)) then
11886 Hi
:= Expr_Rep_Value
(Type_High_Bound
(Ancest
));
11892 Ancest
:= Ancestor_Subtype
(Ancest
);
11894 if No
(Ancest
) then
11895 Ancest
:= Base_Type
(T
);
11897 if Is_Generic_Type
(Ancest
) then
11903 -- Fixed-point types. We can't simply use Expr_Value to get the
11904 -- Corresponding_Integer_Value values of the bounds, since these do not
11905 -- get set till the type is frozen, and this routine can be called
11906 -- before the type is frozen. Similarly the test for bounds being static
11907 -- needs to include the case where we have unanalyzed real literals for
11908 -- the same reason.
11910 elsif Is_Fixed_Point_Type
(T
) then
11912 -- The following loop is looking for the nearest compile time known
11913 -- bounds following the ancestor subtype chain. The idea is to find
11914 -- the most restrictive known bounds information.
11918 if Ancest
= Any_Type
or else Etype
(Ancest
) = Any_Type
then
11922 -- Note: In the following two tests for LoSet and HiSet, it may
11923 -- seem redundant to test for N_Real_Literal here since normally
11924 -- one would assume that the test for the value being known at
11925 -- compile time includes this case. However, there is a glitch.
11926 -- If the real literal comes from folding a non-static expression,
11927 -- then we don't consider any non- static expression to be known
11928 -- at compile time if we are in configurable run time mode (needed
11929 -- in some cases to give a clearer definition of what is and what
11930 -- is not accepted). So the test is indeed needed. Without it, we
11931 -- would set neither Lo_Set nor Hi_Set and get an infinite loop.
11934 if Nkind
(Type_Low_Bound
(Ancest
)) = N_Real_Literal
11935 or else Compile_Time_Known_Value
(Type_Low_Bound
(Ancest
))
11937 LoR
:= Expr_Value_R
(Type_Low_Bound
(Ancest
));
11944 if Nkind
(Type_High_Bound
(Ancest
)) = N_Real_Literal
11945 or else Compile_Time_Known_Value
(Type_High_Bound
(Ancest
))
11947 HiR
:= Expr_Value_R
(Type_High_Bound
(Ancest
));
11953 Ancest
:= Ancestor_Subtype
(Ancest
);
11955 if No
(Ancest
) then
11956 Ancest
:= Base_Type
(T
);
11958 if Is_Generic_Type
(Ancest
) then
11964 Lo
:= UR_To_Uint
(LoR
/ Small_Value
(T
));
11965 Hi
:= UR_To_Uint
(HiR
/ Small_Value
(T
));
11967 -- No other types allowed
11970 raise Program_Error
;
11973 -- Fall through with Hi and Lo set. Deal with biased case
11976 and then not Is_Fixed_Point_Type
(T
)
11977 and then not (Is_Enumeration_Type
(T
)
11978 and then Has_Non_Standard_Rep
(T
)))
11979 or else Has_Biased_Representation
(T
)
11985 -- Null range case, size is always zero. We only do this in the discrete
11986 -- type case, since that's the odd case that came up. Probably we should
11987 -- also do this in the fixed-point case, but doing so causes peculiar
11988 -- gigi failures, and it is not worth worrying about this incredibly
11989 -- marginal case (explicit null-range fixed-point type declarations)???
11991 if Lo
> Hi
and then Is_Discrete_Type
(T
) then
11994 -- Signed case. Note that we consider types like range 1 .. -1 to be
11995 -- signed for the purpose of computing the size, since the bounds have
11996 -- to be accommodated in the base type.
11998 elsif Lo
< 0 or else Hi
< 0 then
12002 -- S = size, B = 2 ** (size - 1) (can accommodate -B .. +(B - 1))
12003 -- Note that we accommodate the case where the bounds cross. This
12004 -- can happen either because of the way the bounds are declared
12005 -- or because of the algorithm in Freeze_Fixed_Point_Type.
12019 -- If both bounds are positive, make sure that both are represen-
12020 -- table in the case where the bounds are crossed. This can happen
12021 -- either because of the way the bounds are declared, or because of
12022 -- the algorithm in Freeze_Fixed_Point_Type.
12028 -- S = size, (can accommodate 0 .. (2**size - 1))
12031 while Hi
>= Uint_2
** S
loop
12039 ---------------------------
12040 -- New_Stream_Subprogram --
12041 ---------------------------
12043 procedure New_Stream_Subprogram
12047 Nam
: TSS_Name_Type
)
12049 Loc
: constant Source_Ptr
:= Sloc
(N
);
12050 Sname
: constant Name_Id
:= Make_TSS_Name
(Base_Type
(Ent
), Nam
);
12051 Subp_Id
: Entity_Id
;
12052 Subp_Decl
: Node_Id
;
12056 Defer_Declaration
: constant Boolean :=
12057 Is_Tagged_Type
(Ent
) or else Is_Private_Type
(Ent
);
12058 -- For a tagged type, there is a declaration for each stream attribute
12059 -- at the freeze point, and we must generate only a completion of this
12060 -- declaration. We do the same for private types, because the full view
12061 -- might be tagged. Otherwise we generate a declaration at the point of
12062 -- the attribute definition clause. If the attribute definition comes
12063 -- from an aspect specification the declaration is part of the freeze
12064 -- actions of the type.
12066 function Build_Spec
return Node_Id
;
12067 -- Used for declaration and renaming declaration, so that this is
12068 -- treated as a renaming_as_body.
12074 function Build_Spec
return Node_Id
is
12075 Out_P
: constant Boolean := (Nam
= TSS_Stream_Read
);
12078 T_Ref
: constant Node_Id
:= New_Occurrence_Of
(Etyp
, Loc
);
12081 Subp_Id
:= Make_Defining_Identifier
(Loc
, Sname
);
12083 -- S : access Root_Stream_Type'Class
12085 Formals
:= New_List
(
12086 Make_Parameter_Specification
(Loc
,
12087 Defining_Identifier
=>
12088 Make_Defining_Identifier
(Loc
, Name_S
),
12090 Make_Access_Definition
(Loc
,
12092 New_Occurrence_Of
(
12093 Designated_Type
(Etype
(F
)), Loc
))));
12095 if Nam
= TSS_Stream_Input
then
12097 Make_Function_Specification
(Loc
,
12098 Defining_Unit_Name
=> Subp_Id
,
12099 Parameter_Specifications
=> Formals
,
12100 Result_Definition
=> T_Ref
);
12104 Append_To
(Formals
,
12105 Make_Parameter_Specification
(Loc
,
12106 Defining_Identifier
=> Make_Defining_Identifier
(Loc
, Name_V
),
12107 Out_Present
=> Out_P
,
12108 Parameter_Type
=> T_Ref
));
12111 Make_Procedure_Specification
(Loc
,
12112 Defining_Unit_Name
=> Subp_Id
,
12113 Parameter_Specifications
=> Formals
);
12119 -- Start of processing for New_Stream_Subprogram
12122 F
:= First_Formal
(Subp
);
12124 if Ekind
(Subp
) = E_Procedure
then
12125 Etyp
:= Etype
(Next_Formal
(F
));
12127 Etyp
:= Etype
(Subp
);
12130 -- Prepare subprogram declaration and insert it as an action on the
12131 -- clause node. The visibility for this entity is used to test for
12132 -- visibility of the attribute definition clause (in the sense of
12133 -- 8.3(23) as amended by AI-195).
12135 if not Defer_Declaration
then
12137 Make_Subprogram_Declaration
(Loc
,
12138 Specification
=> Build_Spec
);
12140 -- For a tagged type, there is always a visible declaration for each
12141 -- stream TSS (it is a predefined primitive operation), and the
12142 -- completion of this declaration occurs at the freeze point, which is
12143 -- not always visible at places where the attribute definition clause is
12144 -- visible. So, we create a dummy entity here for the purpose of
12145 -- tracking the visibility of the attribute definition clause itself.
12149 Make_Defining_Identifier
(Loc
, New_External_Name
(Sname
, 'V'));
12151 Make_Object_Declaration
(Loc
,
12152 Defining_Identifier
=> Subp_Id
,
12153 Object_Definition
=> New_Occurrence_Of
(Standard_Boolean
, Loc
));
12156 if not Defer_Declaration
12157 and then From_Aspect_Specification
(N
)
12158 and then Has_Delayed_Freeze
(Ent
)
12160 Append_Freeze_Action
(Ent
, Subp_Decl
);
12163 Insert_Action
(N
, Subp_Decl
);
12164 Set_Entity
(N
, Subp_Id
);
12168 Make_Subprogram_Renaming_Declaration
(Loc
,
12169 Specification
=> Build_Spec
,
12170 Name
=> New_Occurrence_Of
(Subp
, Loc
));
12172 if Defer_Declaration
then
12173 Set_TSS
(Base_Type
(Ent
), Subp_Id
);
12176 if From_Aspect_Specification
(N
) then
12177 Append_Freeze_Action
(Ent
, Subp_Decl
);
12179 Insert_Action
(N
, Subp_Decl
);
12182 Copy_TSS
(Subp_Id
, Base_Type
(Ent
));
12184 end New_Stream_Subprogram
;
12186 ------------------------------------------
12187 -- Push_Scope_And_Install_Discriminants --
12188 ------------------------------------------
12190 procedure Push_Scope_And_Install_Discriminants
(E
: Entity_Id
) is
12192 if Has_Discriminants
(E
) then
12195 -- Make the discriminants visible for type declarations and protected
12196 -- type declarations, not for subtype declarations (RM 13.1.1 (12/3))
12198 if Nkind
(Parent
(E
)) /= N_Subtype_Declaration
then
12199 Install_Discriminants
(E
);
12202 end Push_Scope_And_Install_Discriminants
;
12204 ------------------------
12205 -- Rep_Item_Too_Early --
12206 ------------------------
12208 function Rep_Item_Too_Early
(T
: Entity_Id
; N
: Node_Id
) return Boolean is
12210 -- Cannot apply non-operational rep items to generic types
12212 if Is_Operational_Item
(N
) then
12216 and then Is_Generic_Type
(Root_Type
(T
))
12217 and then (Nkind
(N
) /= N_Pragma
12218 or else Get_Pragma_Id
(N
) /= Pragma_Convention
)
12220 Error_Msg_N
("representation item not allowed for generic type", N
);
12224 -- Otherwise check for incomplete type
12226 if Is_Incomplete_Or_Private_Type
(T
)
12227 and then No
(Underlying_Type
(T
))
12229 (Nkind
(N
) /= N_Pragma
12230 or else Get_Pragma_Id
(N
) /= Pragma_Import
)
12233 ("representation item must be after full type declaration", N
);
12236 -- If the type has incomplete components, a representation clause is
12237 -- illegal but stream attributes and Convention pragmas are correct.
12239 elsif Has_Private_Component
(T
) then
12240 if Nkind
(N
) = N_Pragma
then
12245 ("representation item must appear after type is fully defined",
12252 end Rep_Item_Too_Early
;
12254 -----------------------
12255 -- Rep_Item_Too_Late --
12256 -----------------------
12258 function Rep_Item_Too_Late
12261 FOnly
: Boolean := False) return Boolean
12264 Parent_Type
: Entity_Id
;
12266 procedure No_Type_Rep_Item
;
12267 -- Output message indicating that no type-related aspects can be
12268 -- specified due to some property of the parent type.
12270 procedure Too_Late
;
12271 -- Output message for an aspect being specified too late
12273 -- Note that neither of the above errors is considered a serious one,
12274 -- since the effect is simply that we ignore the representation clause
12276 -- Is this really true? In any case if we make this change we must
12277 -- document the requirement in the spec of Rep_Item_Too_Late that
12278 -- if True is returned, then the rep item must be completely ignored???
12280 ----------------------
12281 -- No_Type_Rep_Item --
12282 ----------------------
12284 procedure No_Type_Rep_Item
is
12286 Error_Msg_N
("|type-related representation item not permitted!", N
);
12287 end No_Type_Rep_Item
;
12293 procedure Too_Late
is
12295 -- Other compilers seem more relaxed about rep items appearing too
12296 -- late. Since analysis tools typically don't care about rep items
12297 -- anyway, no reason to be too strict about this.
12299 if not Relaxed_RM_Semantics
then
12300 Error_Msg_N
("|representation item appears too late!", N
);
12304 -- Start of processing for Rep_Item_Too_Late
12307 -- First make sure entity is not frozen (RM 13.1(9))
12311 -- Exclude imported types, which may be frozen if they appear in a
12312 -- representation clause for a local type.
12314 and then not From_Limited_With
(T
)
12316 -- Exclude generated entities (not coming from source). The common
12317 -- case is when we generate a renaming which prematurely freezes the
12318 -- renamed internal entity, but we still want to be able to set copies
12319 -- of attribute values such as Size/Alignment.
12321 and then Comes_From_Source
(T
)
12323 -- A self-referential aspect is illegal if it forces freezing the
12324 -- entity before the corresponding pragma has been analyzed.
12326 if Nkind_In
(N
, N_Attribute_Definition_Clause
, N_Pragma
)
12327 and then From_Aspect_Specification
(N
)
12330 ("aspect specification causes premature freezing of&", N
, T
);
12331 Set_Has_Delayed_Freeze
(T
, False);
12336 S
:= First_Subtype
(T
);
12338 if Present
(Freeze_Node
(S
)) then
12339 if not Relaxed_RM_Semantics
then
12341 ("??no more representation items for }", Freeze_Node
(S
), S
);
12347 -- Check for case of untagged derived type whose parent either has
12348 -- primitive operations, or is a by reference type (RM 13.1(10)). In
12349 -- this case we do not output a Too_Late message, since there is no
12350 -- earlier point where the rep item could be placed to make it legal.
12354 and then Is_Derived_Type
(T
)
12355 and then not Is_Tagged_Type
(T
)
12357 Parent_Type
:= Etype
(Base_Type
(T
));
12359 if Has_Primitive_Operations
(Parent_Type
) then
12362 if not Relaxed_RM_Semantics
then
12364 ("\parent type & has primitive operations!", N
, Parent_Type
);
12369 elsif Is_By_Reference_Type
(Parent_Type
) then
12372 if not Relaxed_RM_Semantics
then
12374 ("\parent type & is a by reference type!", N
, Parent_Type
);
12381 -- No error, but one more warning to consider. The RM (surprisingly)
12382 -- allows this pattern:
12385 -- primitive operations for S
12386 -- type R is new S;
12387 -- rep clause for S
12389 -- Meaning that calls on the primitive operations of S for values of
12390 -- type R may require possibly expensive implicit conversion operations.
12391 -- This is not an error, but is worth a warning.
12393 if not Relaxed_RM_Semantics
and then Is_Type
(T
) then
12395 DTL
: constant Entity_Id
:= Derived_Type_Link
(Base_Type
(T
));
12399 and then Has_Primitive_Operations
(Base_Type
(T
))
12401 -- For now, do not generate this warning for the case of aspect
12402 -- specification using Ada 2012 syntax, since we get wrong
12403 -- messages we do not understand. The whole business of derived
12404 -- types and rep items seems a bit confused when aspects are
12405 -- used, since the aspects are not evaluated till freeze time.
12407 and then not From_Aspect_Specification
(N
)
12409 Error_Msg_Sloc
:= Sloc
(DTL
);
12411 ("representation item for& appears after derived type "
12412 & "declaration#??", N
);
12414 ("\may result in implicit conversions for primitive "
12415 & "operations of&??", N
, T
);
12417 ("\to change representations when called with arguments "
12418 & "of type&??", N
, DTL
);
12423 -- No error, link item into head of chain of rep items for the entity,
12424 -- but avoid chaining if we have an overloadable entity, and the pragma
12425 -- is one that can apply to multiple overloaded entities.
12427 if Is_Overloadable
(T
) and then Nkind
(N
) = N_Pragma
then
12429 Pname
: constant Name_Id
:= Pragma_Name
(N
);
12431 if Nam_In
(Pname
, Name_Convention
, Name_Import
, Name_Export
,
12432 Name_External
, Name_Interface
)
12439 Record_Rep_Item
(T
, N
);
12441 end Rep_Item_Too_Late
;
12443 -------------------------------------
12444 -- Replace_Type_References_Generic --
12445 -------------------------------------
12447 procedure Replace_Type_References_Generic
(N
: Node_Id
; T
: Entity_Id
) is
12448 TName
: constant Name_Id
:= Chars
(T
);
12450 function Replace_Type_Ref
(N
: Node_Id
) return Traverse_Result
;
12451 -- Processes a single node in the traversal procedure below, checking
12452 -- if node N should be replaced, and if so, doing the replacement.
12454 function Visible_Component
(Comp
: Name_Id
) return Entity_Id
;
12455 -- Given an identifier in the expression, check whether there is a
12456 -- discriminant or component of the type that is directy visible, and
12457 -- rewrite it as the corresponding selected component of the formal of
12458 -- the subprogram. The entity is located by a sequential search, which
12459 -- seems acceptable given the typical size of component lists and check
12460 -- expressions. Possible optimization ???
12462 ----------------------
12463 -- Replace_Type_Ref --
12464 ----------------------
12466 function Replace_Type_Ref
(N
: Node_Id
) return Traverse_Result
is
12467 Loc
: constant Source_Ptr
:= Sloc
(N
);
12469 procedure Add_Prefix
(Ref
: Node_Id
; Comp
: Entity_Id
);
12470 -- Add the proper prefix to a reference to a component of the type
12471 -- when it is not already a selected component.
12477 procedure Add_Prefix
(Ref
: Node_Id
; Comp
: Entity_Id
) is
12480 Make_Selected_Component
(Loc
,
12481 Prefix
=> New_Occurrence_Of
(T
, Loc
),
12482 Selector_Name
=> New_Occurrence_Of
(Comp
, Loc
)));
12483 Replace_Type_Reference
(Prefix
(Ref
));
12492 -- Start of processing for Replace_Type_Ref
12495 if Nkind
(N
) = N_Identifier
then
12497 -- If not the type name, check whether it is a reference to some
12498 -- other type, which must be frozen before the predicate function
12499 -- is analyzed, i.e. before the freeze node of the type to which
12500 -- the predicate applies.
12502 if Chars
(N
) /= TName
then
12503 if Present
(Current_Entity
(N
))
12504 and then Is_Type
(Current_Entity
(N
))
12506 Freeze_Before
(Freeze_Node
(T
), Current_Entity
(N
));
12509 -- The components of the type are directly visible and can
12510 -- be referenced without a prefix.
12512 if Nkind
(Parent
(N
)) = N_Selected_Component
then
12515 -- In expression C (I), C may be a directly visible function
12516 -- or a visible component that has an array type. Disambiguate
12517 -- by examining the component type.
12519 elsif Nkind
(Parent
(N
)) = N_Indexed_Component
12520 and then N
= Prefix
(Parent
(N
))
12522 Comp
:= Visible_Component
(Chars
(N
));
12524 if Present
(Comp
) and then Is_Array_Type
(Etype
(Comp
)) then
12525 Add_Prefix
(N
, Comp
);
12529 Comp
:= Visible_Component
(Chars
(N
));
12531 if Present
(Comp
) then
12532 Add_Prefix
(N
, Comp
);
12538 -- Otherwise do the replacement and we are done with this node
12541 Replace_Type_Reference
(N
);
12545 -- Case of selected component (which is what a qualification looks
12546 -- like in the unanalyzed tree, which is what we have.
12548 elsif Nkind
(N
) = N_Selected_Component
then
12550 -- If selector name is not our type, keeping going (we might still
12551 -- have an occurrence of the type in the prefix).
12553 if Nkind
(Selector_Name
(N
)) /= N_Identifier
12554 or else Chars
(Selector_Name
(N
)) /= TName
12558 -- Selector name is our type, check qualification
12561 -- Loop through scopes and prefixes, doing comparison
12563 Scop
:= Current_Scope
;
12564 Pref
:= Prefix
(N
);
12566 -- Continue if no more scopes or scope with no name
12568 if No
(Scop
) or else Nkind
(Scop
) not in N_Has_Chars
then
12572 -- Do replace if prefix is an identifier matching the scope
12573 -- that we are currently looking at.
12575 if Nkind
(Pref
) = N_Identifier
12576 and then Chars
(Pref
) = Chars
(Scop
)
12578 Replace_Type_Reference
(N
);
12582 -- Go check scope above us if prefix is itself of the form
12583 -- of a selected component, whose selector matches the scope
12584 -- we are currently looking at.
12586 if Nkind
(Pref
) = N_Selected_Component
12587 and then Nkind
(Selector_Name
(Pref
)) = N_Identifier
12588 and then Chars
(Selector_Name
(Pref
)) = Chars
(Scop
)
12590 Scop
:= Scope
(Scop
);
12591 Pref
:= Prefix
(Pref
);
12593 -- For anything else, we don't have a match, so keep on
12594 -- going, there are still some weird cases where we may
12595 -- still have a replacement within the prefix.
12603 -- Continue for any other node kind
12608 end Replace_Type_Ref
;
12610 procedure Replace_Type_Refs
is new Traverse_Proc
(Replace_Type_Ref
);
12612 -----------------------
12613 -- Visible_Component --
12614 -----------------------
12616 function Visible_Component
(Comp
: Name_Id
) return Entity_Id
is
12620 -- Types with nameable components are records and discriminated
12623 if Ekind
(T
) = E_Record_Type
12624 or else (Is_Private_Type
(T
) and then Has_Discriminants
(T
))
12626 E
:= First_Entity
(T
);
12627 while Present
(E
) loop
12628 if Comes_From_Source
(E
) and then Chars
(E
) = Comp
then
12636 -- Nothing by that name, or the type has no components
12639 end Visible_Component
;
12641 -- Start of processing for Replace_Type_References_Generic
12644 Replace_Type_Refs
(N
);
12645 end Replace_Type_References_Generic
;
12647 --------------------------------
12648 -- Resolve_Aspect_Expressions --
12649 --------------------------------
12651 procedure Resolve_Aspect_Expressions
(E
: Entity_Id
) is
12656 function Resolve_Name
(N
: Node_Id
) return Traverse_Result
;
12657 -- Verify that all identifiers in the expression, with the exception
12658 -- of references to the current entity, denote visible entities. This
12659 -- is done only to detect visibility errors, as the expression will be
12660 -- properly analyzed/expanded during analysis of the predicate function
12661 -- body. We omit quantified expressions from this test, given that they
12662 -- introduce a local identifier that would require proper expansion to
12663 -- handle properly.
12665 -- In ASIS_Mode we preserve the entity in the source because there is
12666 -- no subsequent expansion to decorate the tree.
12672 function Resolve_Name
(N
: Node_Id
) return Traverse_Result
is
12674 if Nkind
(N
) = N_Selected_Component
then
12675 if Nkind
(Prefix
(N
)) = N_Identifier
12676 and then Chars
(Prefix
(N
)) /= Chars
(E
)
12678 Find_Selected_Component
(N
);
12683 elsif Nkind
(N
) = N_Identifier
and then Chars
(N
) /= Chars
(E
) then
12684 Find_Direct_Name
(N
);
12686 if not ASIS_Mode
then
12687 Set_Entity
(N
, Empty
);
12690 elsif Nkind
(N
) = N_Quantified_Expression
then
12697 procedure Resolve_Aspect_Expression
is new Traverse_Proc
(Resolve_Name
);
12699 -- Start of processing for Resolve_Aspect_Expressions
12702 ASN
:= First_Rep_Item
(E
);
12703 while Present
(ASN
) loop
12704 if Nkind
(ASN
) = N_Aspect_Specification
and then Entity
(ASN
) = E
then
12705 A_Id
:= Get_Aspect_Id
(ASN
);
12706 Expr
:= Expression
(ASN
);
12710 -- For now we only deal with aspects that do not generate
12711 -- subprograms, or that may mention current instances of
12712 -- types. These will require special handling (???TBD).
12714 when Aspect_Invariant
12716 | Aspect_Predicate_Failure
12720 when Aspect_Dynamic_Predicate
12721 | Aspect_Static_Predicate
12723 -- Build predicate function specification and preanalyze
12724 -- expression after type replacement.
12726 if No
(Predicate_Function
(E
)) then
12728 FDecl
: constant Node_Id
:=
12729 Build_Predicate_Function_Declaration
(E
);
12730 pragma Unreferenced
(FDecl
);
12732 Resolve_Aspect_Expression
(Expr
);
12736 when Pre_Post_Aspects
=>
12739 when Aspect_Iterable
=>
12740 if Nkind
(Expr
) = N_Aggregate
then
12745 Assoc
:= First
(Component_Associations
(Expr
));
12746 while Present
(Assoc
) loop
12747 Find_Direct_Name
(Expression
(Assoc
));
12754 if Present
(Expr
) then
12755 case Aspect_Argument
(A_Id
) is
12757 | Optional_Expression
12759 Analyze_And_Resolve
(Expression
(ASN
));
12764 if Nkind
(Expr
) = N_Identifier
then
12765 Find_Direct_Name
(Expr
);
12767 elsif Nkind
(Expr
) = N_Selected_Component
then
12768 Find_Selected_Component
(Expr
);
12775 ASN
:= Next_Rep_Item
(ASN
);
12777 end Resolve_Aspect_Expressions
;
12779 -------------------------
12780 -- Same_Representation --
12781 -------------------------
12783 function Same_Representation
(Typ1
, Typ2
: Entity_Id
) return Boolean is
12784 T1
: constant Entity_Id
:= Underlying_Type
(Typ1
);
12785 T2
: constant Entity_Id
:= Underlying_Type
(Typ2
);
12788 -- A quick check, if base types are the same, then we definitely have
12789 -- the same representation, because the subtype specific representation
12790 -- attributes (Size and Alignment) do not affect representation from
12791 -- the point of view of this test.
12793 if Base_Type
(T1
) = Base_Type
(T2
) then
12796 elsif Is_Private_Type
(Base_Type
(T2
))
12797 and then Base_Type
(T1
) = Full_View
(Base_Type
(T2
))
12802 -- Tagged types never have differing representations
12804 if Is_Tagged_Type
(T1
) then
12808 -- Representations are definitely different if conventions differ
12810 if Convention
(T1
) /= Convention
(T2
) then
12814 -- Representations are different if component alignments or scalar
12815 -- storage orders differ.
12817 if (Is_Record_Type
(T1
) or else Is_Array_Type
(T1
))
12819 (Is_Record_Type
(T2
) or else Is_Array_Type
(T2
))
12821 (Component_Alignment
(T1
) /= Component_Alignment
(T2
)
12822 or else Reverse_Storage_Order
(T1
) /= Reverse_Storage_Order
(T2
))
12827 -- For arrays, the only real issue is component size. If we know the
12828 -- component size for both arrays, and it is the same, then that's
12829 -- good enough to know we don't have a change of representation.
12831 if Is_Array_Type
(T1
) then
12832 if Known_Component_Size
(T1
)
12833 and then Known_Component_Size
(T2
)
12834 and then Component_Size
(T1
) = Component_Size
(T2
)
12840 -- Types definitely have same representation if neither has non-standard
12841 -- representation since default representations are always consistent.
12842 -- If only one has non-standard representation, and the other does not,
12843 -- then we consider that they do not have the same representation. They
12844 -- might, but there is no way of telling early enough.
12846 if Has_Non_Standard_Rep
(T1
) then
12847 if not Has_Non_Standard_Rep
(T2
) then
12851 return not Has_Non_Standard_Rep
(T2
);
12854 -- Here the two types both have non-standard representation, and we need
12855 -- to determine if they have the same non-standard representation.
12857 -- For arrays, we simply need to test if the component sizes are the
12858 -- same. Pragma Pack is reflected in modified component sizes, so this
12859 -- check also deals with pragma Pack.
12861 if Is_Array_Type
(T1
) then
12862 return Component_Size
(T1
) = Component_Size
(T2
);
12864 -- Tagged types always have the same representation, because it is not
12865 -- possible to specify different representations for common fields.
12867 elsif Is_Tagged_Type
(T1
) then
12870 -- Case of record types
12872 elsif Is_Record_Type
(T1
) then
12874 -- Packed status must conform
12876 if Is_Packed
(T1
) /= Is_Packed
(T2
) then
12879 -- Otherwise we must check components. Typ2 maybe a constrained
12880 -- subtype with fewer components, so we compare the components
12881 -- of the base types.
12884 Record_Case
: declare
12885 CD1
, CD2
: Entity_Id
;
12887 function Same_Rep
return Boolean;
12888 -- CD1 and CD2 are either components or discriminants. This
12889 -- function tests whether they have the same representation.
12895 function Same_Rep
return Boolean is
12897 if No
(Component_Clause
(CD1
)) then
12898 return No
(Component_Clause
(CD2
));
12900 -- Note: at this point, component clauses have been
12901 -- normalized to the default bit order, so that the
12902 -- comparison of Component_Bit_Offsets is meaningful.
12905 Present
(Component_Clause
(CD2
))
12907 Component_Bit_Offset
(CD1
) = Component_Bit_Offset
(CD2
)
12909 Esize
(CD1
) = Esize
(CD2
);
12913 -- Start of processing for Record_Case
12916 if Has_Discriminants
(T1
) then
12918 -- The number of discriminants may be different if the
12919 -- derived type has fewer (constrained by values). The
12920 -- invisible discriminants retain the representation of
12921 -- the original, so the discrepancy does not per se
12922 -- indicate a different representation.
12924 CD1
:= First_Discriminant
(T1
);
12925 CD2
:= First_Discriminant
(T2
);
12926 while Present
(CD1
) and then Present
(CD2
) loop
12927 if not Same_Rep
then
12930 Next_Discriminant
(CD1
);
12931 Next_Discriminant
(CD2
);
12936 CD1
:= First_Component
(Underlying_Type
(Base_Type
(T1
)));
12937 CD2
:= First_Component
(Underlying_Type
(Base_Type
(T2
)));
12938 while Present
(CD1
) loop
12939 if not Same_Rep
then
12942 Next_Component
(CD1
);
12943 Next_Component
(CD2
);
12951 -- For enumeration types, we must check each literal to see if the
12952 -- representation is the same. Note that we do not permit enumeration
12953 -- representation clauses for Character and Wide_Character, so these
12954 -- cases were already dealt with.
12956 elsif Is_Enumeration_Type
(T1
) then
12957 Enumeration_Case
: declare
12958 L1
, L2
: Entity_Id
;
12961 L1
:= First_Literal
(T1
);
12962 L2
:= First_Literal
(T2
);
12963 while Present
(L1
) loop
12964 if Enumeration_Rep
(L1
) /= Enumeration_Rep
(L2
) then
12973 end Enumeration_Case
;
12975 -- Any other types have the same representation for these purposes
12980 end Same_Representation
;
12982 --------------------------------
12983 -- Resolve_Iterable_Operation --
12984 --------------------------------
12986 procedure Resolve_Iterable_Operation
12988 Cursor
: Entity_Id
;
12997 if not Is_Overloaded
(N
) then
12998 if not Is_Entity_Name
(N
)
12999 or else Ekind
(Entity
(N
)) /= E_Function
13000 or else Scope
(Entity
(N
)) /= Scope
(Typ
)
13001 or else No
(First_Formal
(Entity
(N
)))
13002 or else Etype
(First_Formal
(Entity
(N
))) /= Typ
13004 Error_Msg_N
("iterable primitive must be local function name "
13005 & "whose first formal is an iterable type", N
);
13010 F1
:= First_Formal
(Ent
);
13011 if Nam
= Name_First
then
13013 -- First (Container) => Cursor
13015 if Etype
(Ent
) /= Cursor
then
13016 Error_Msg_N
("primitive for First must yield a curosr", N
);
13019 elsif Nam
= Name_Next
then
13021 -- Next (Container, Cursor) => Cursor
13023 F2
:= Next_Formal
(F1
);
13025 if Etype
(F2
) /= Cursor
13026 or else Etype
(Ent
) /= Cursor
13027 or else Present
(Next_Formal
(F2
))
13029 Error_Msg_N
("no match for Next iterable primitive", N
);
13032 elsif Nam
= Name_Has_Element
then
13034 -- Has_Element (Container, Cursor) => Boolean
13036 F2
:= Next_Formal
(F1
);
13037 if Etype
(F2
) /= Cursor
13038 or else Etype
(Ent
) /= Standard_Boolean
13039 or else Present
(Next_Formal
(F2
))
13041 Error_Msg_N
("no match for Has_Element iterable primitive", N
);
13044 elsif Nam
= Name_Element
then
13045 F2
:= Next_Formal
(F1
);
13048 or else Etype
(F2
) /= Cursor
13049 or else Present
(Next_Formal
(F2
))
13051 Error_Msg_N
("no match for Element iterable primitive", N
);
13056 raise Program_Error
;
13060 -- Overloaded case: find subprogram with proper signature.
13061 -- Caller will report error if no match is found.
13068 Get_First_Interp
(N
, I
, It
);
13069 while Present
(It
.Typ
) loop
13070 if Ekind
(It
.Nam
) = E_Function
13071 and then Scope
(It
.Nam
) = Scope
(Typ
)
13072 and then Etype
(First_Formal
(It
.Nam
)) = Typ
13074 F1
:= First_Formal
(It
.Nam
);
13076 if Nam
= Name_First
then
13077 if Etype
(It
.Nam
) = Cursor
13078 and then No
(Next_Formal
(F1
))
13080 Set_Entity
(N
, It
.Nam
);
13084 elsif Nam
= Name_Next
then
13085 F2
:= Next_Formal
(F1
);
13088 and then No
(Next_Formal
(F2
))
13089 and then Etype
(F2
) = Cursor
13090 and then Etype
(It
.Nam
) = Cursor
13092 Set_Entity
(N
, It
.Nam
);
13096 elsif Nam
= Name_Has_Element
then
13097 F2
:= Next_Formal
(F1
);
13100 and then No
(Next_Formal
(F2
))
13101 and then Etype
(F2
) = Cursor
13102 and then Etype
(It
.Nam
) = Standard_Boolean
13104 Set_Entity
(N
, It
.Nam
);
13105 F2
:= Next_Formal
(F1
);
13109 elsif Nam
= Name_Element
then
13110 F2
:= Next_Formal
(F1
);
13113 and then No
(Next_Formal
(F2
))
13114 and then Etype
(F2
) = Cursor
13116 Set_Entity
(N
, It
.Nam
);
13122 Get_Next_Interp
(I
, It
);
13126 end Resolve_Iterable_Operation
;
13132 procedure Set_Biased
13136 Biased
: Boolean := True)
13140 Set_Has_Biased_Representation
(E
);
13142 if Warn_On_Biased_Representation
then
13144 ("?B?" & Msg
& " forces biased representation for&", N
, E
);
13149 --------------------
13150 -- Set_Enum_Esize --
13151 --------------------
13153 procedure Set_Enum_Esize
(T
: Entity_Id
) is
13159 Init_Alignment
(T
);
13161 -- Find the minimum standard size (8,16,32,64) that fits
13163 Lo
:= Enumeration_Rep
(Entity
(Type_Low_Bound
(T
)));
13164 Hi
:= Enumeration_Rep
(Entity
(Type_High_Bound
(T
)));
13167 if Lo
>= -Uint_2
**07 and then Hi
< Uint_2
**07 then
13168 Sz
:= Standard_Character_Size
; -- May be > 8 on some targets
13170 elsif Lo
>= -Uint_2
**15 and then Hi
< Uint_2
**15 then
13173 elsif Lo
>= -Uint_2
**31 and then Hi
< Uint_2
**31 then
13176 else pragma Assert
(Lo
>= -Uint_2
**63 and then Hi
< Uint_2
**63);
13181 if Hi
< Uint_2
**08 then
13182 Sz
:= Standard_Character_Size
; -- May be > 8 on some targets
13184 elsif Hi
< Uint_2
**16 then
13187 elsif Hi
< Uint_2
**32 then
13190 else pragma Assert
(Hi
< Uint_2
**63);
13195 -- That minimum is the proper size unless we have a foreign convention
13196 -- and the size required is 32 or less, in which case we bump the size
13197 -- up to 32. This is required for C and C++ and seems reasonable for
13198 -- all other foreign conventions.
13200 if Has_Foreign_Convention
(T
)
13201 and then Esize
(T
) < Standard_Integer_Size
13203 -- Don't do this if Short_Enums on target
13205 and then not Target_Short_Enums
13207 Init_Esize
(T
, Standard_Integer_Size
);
13209 Init_Esize
(T
, Sz
);
13211 end Set_Enum_Esize
;
13213 -----------------------------
13214 -- Uninstall_Discriminants --
13215 -----------------------------
13217 procedure Uninstall_Discriminants
(E
: Entity_Id
) is
13223 -- Discriminants have been made visible for type declarations and
13224 -- protected type declarations, not for subtype declarations.
13226 if Nkind
(Parent
(E
)) /= N_Subtype_Declaration
then
13227 Disc
:= First_Discriminant
(E
);
13228 while Present
(Disc
) loop
13229 if Disc
/= Current_Entity
(Disc
) then
13230 Prev
:= Current_Entity
(Disc
);
13231 while Present
(Prev
)
13232 and then Present
(Homonym
(Prev
))
13233 and then Homonym
(Prev
) /= Disc
13235 Prev
:= Homonym
(Prev
);
13241 Set_Is_Immediately_Visible
(Disc
, False);
13243 Outer
:= Homonym
(Disc
);
13244 while Present
(Outer
) and then Scope
(Outer
) = E
loop
13245 Outer
:= Homonym
(Outer
);
13248 -- Reset homonym link of other entities, but do not modify link
13249 -- between entities in current scope, so that the back end can
13250 -- have a proper count of local overloadings.
13253 Set_Name_Entity_Id
(Chars
(Disc
), Outer
);
13255 elsif Scope
(Prev
) /= Scope
(Disc
) then
13256 Set_Homonym
(Prev
, Outer
);
13259 Next_Discriminant
(Disc
);
13262 end Uninstall_Discriminants
;
13264 -------------------------------------------
13265 -- Uninstall_Discriminants_And_Pop_Scope --
13266 -------------------------------------------
13268 procedure Uninstall_Discriminants_And_Pop_Scope
(E
: Entity_Id
) is
13270 if Has_Discriminants
(E
) then
13271 Uninstall_Discriminants
(E
);
13274 end Uninstall_Discriminants_And_Pop_Scope
;
13276 ------------------------------
13277 -- Validate_Address_Clauses --
13278 ------------------------------
13280 procedure Validate_Address_Clauses
is
13281 function Offset_Value
(Expr
: Node_Id
) return Uint
;
13282 -- Given an Address attribute reference, return the value in bits of its
13283 -- offset from the first bit of the underlying entity, or 0 if it is not
13284 -- known at compile time.
13290 function Offset_Value
(Expr
: Node_Id
) return Uint
is
13291 N
: Node_Id
:= Prefix
(Expr
);
13293 Val
: Uint
:= Uint_0
;
13296 -- Climb the prefix chain and compute the cumulative offset
13299 if Is_Entity_Name
(N
) then
13302 elsif Nkind
(N
) = N_Selected_Component
then
13303 Off
:= Component_Bit_Offset
(Entity
(Selector_Name
(N
)));
13304 if Off
/= No_Uint
and then Off
>= Uint_0
then
13311 elsif Nkind
(N
) = N_Indexed_Component
then
13312 Off
:= Indexed_Component_Bit_Offset
(N
);
13313 if Off
/= No_Uint
then
13326 -- Start of processing for Validate_Address_Clauses
13329 for J
in Address_Clause_Checks
.First
.. Address_Clause_Checks
.Last
loop
13331 ACCR
: Address_Clause_Check_Record
13332 renames Address_Clause_Checks
.Table
(J
);
13336 X_Alignment
: Uint
;
13337 Y_Alignment
: Uint
:= Uint_0
;
13340 Y_Size
: Uint
:= Uint_0
;
13345 -- Skip processing of this entry if warning already posted
13347 if not Address_Warning_Posted
(ACCR
.N
) then
13348 Expr
:= Original_Node
(Expression
(ACCR
.N
));
13350 -- Get alignments, sizes and offset, if any
13352 X_Alignment
:= Alignment
(ACCR
.X
);
13353 X_Size
:= Esize
(ACCR
.X
);
13355 if Present
(ACCR
.Y
) then
13356 Y_Alignment
:= Alignment
(ACCR
.Y
);
13357 Y_Size
:= Esize
(ACCR
.Y
);
13361 and then Nkind
(Expr
) = N_Attribute_Reference
13362 and then Attribute_Name
(Expr
) = Name_Address
13364 X_Offs
:= Offset_Value
(Expr
);
13369 -- Check for known value not multiple of alignment
13371 if No
(ACCR
.Y
) then
13372 if not Alignment_Checks_Suppressed
(ACCR
.X
)
13373 and then X_Alignment
/= 0
13374 and then ACCR
.A
mod X_Alignment
/= 0
13377 ("??specified address for& is inconsistent with "
13378 & "alignment", ACCR
.N
, ACCR
.X
);
13380 ("\??program execution may be erroneous (RM 13.3(27))",
13383 Error_Msg_Uint_1
:= X_Alignment
;
13384 Error_Msg_NE
("\??alignment of & is ^", ACCR
.N
, ACCR
.X
);
13387 -- Check for large object overlaying smaller one
13389 elsif Y_Size
> Uint_0
13390 and then X_Size
> Uint_0
13391 and then X_Offs
+ X_Size
> Y_Size
13393 Error_Msg_NE
("??& overlays smaller object", ACCR
.N
, ACCR
.X
);
13395 ("\??program execution may be erroneous", ACCR
.N
);
13397 Error_Msg_Uint_1
:= X_Size
;
13398 Error_Msg_NE
("\??size of & is ^", ACCR
.N
, ACCR
.X
);
13400 Error_Msg_Uint_1
:= Y_Size
;
13401 Error_Msg_NE
("\??size of & is ^", ACCR
.N
, ACCR
.Y
);
13403 if Y_Size
>= X_Size
then
13404 Error_Msg_Uint_1
:= X_Offs
;
13405 Error_Msg_NE
("\??but offset of & is ^", ACCR
.N
, ACCR
.X
);
13408 -- Check for inadequate alignment, both of the base object
13409 -- and of the offset, if any. We only do this check if the
13410 -- run-time Alignment_Check is active. No point in warning
13411 -- if this check has been suppressed (or is suppressed by
13412 -- default in the non-strict alignment machine case).
13414 -- Note: we do not check the alignment if we gave a size
13415 -- warning, since it would likely be redundant.
13417 elsif not Alignment_Checks_Suppressed
(ACCR
.X
)
13418 and then Y_Alignment
/= Uint_0
13420 (Y_Alignment
< X_Alignment
13423 and then Nkind
(Expr
) = N_Attribute_Reference
13424 and then Attribute_Name
(Expr
) = Name_Address
13425 and then Has_Compatible_Alignment
13426 (ACCR
.X
, Prefix
(Expr
), True) /=
13430 ("??specified address for& may be inconsistent with "
13431 & "alignment", ACCR
.N
, ACCR
.X
);
13433 ("\??program execution may be erroneous (RM 13.3(27))",
13436 Error_Msg_Uint_1
:= X_Alignment
;
13437 Error_Msg_NE
("\??alignment of & is ^", ACCR
.N
, ACCR
.X
);
13439 Error_Msg_Uint_1
:= Y_Alignment
;
13440 Error_Msg_NE
("\??alignment of & is ^", ACCR
.N
, ACCR
.Y
);
13442 if Y_Alignment
>= X_Alignment
then
13444 ("\??but offset is not multiple of alignment", ACCR
.N
);
13450 end Validate_Address_Clauses
;
13452 -----------------------------------------
13453 -- Validate_Compile_Time_Warning_Error --
13454 -----------------------------------------
13456 procedure Validate_Compile_Time_Warning_Error
(N
: Node_Id
) is
13458 Compile_Time_Warnings_Errors
.Append
13459 (New_Val
=> CTWE_Entry
'(Eloc => Sloc (N),
13460 Scope => Current_Scope,
13462 end Validate_Compile_Time_Warning_Error;
13464 ------------------------------------------
13465 -- Validate_Compile_Time_Warning_Errors --
13466 ------------------------------------------
13468 procedure Validate_Compile_Time_Warning_Errors is
13469 procedure Set_Scope (S : Entity_Id);
13470 -- Install all enclosing scopes of S along with S itself
13472 procedure Unset_Scope (S : Entity_Id);
13473 -- Uninstall all enclosing scopes of S along with S itself
13479 procedure Set_Scope (S : Entity_Id) is
13481 if S /= Standard_Standard then
13482 Set_Scope (Scope (S));
13492 procedure Unset_Scope (S : Entity_Id) is
13494 if S /= Standard_Standard then
13495 Unset_Scope (Scope (S));
13501 -- Start of processing for Validate_Compile_Time_Warning_Errors
13504 Expander_Mode_Save_And_Set (False);
13505 In_Compile_Time_Warning_Or_Error := True;
13507 for N in Compile_Time_Warnings_Errors.First ..
13508 Compile_Time_Warnings_Errors.Last
13511 T : CTWE_Entry renames Compile_Time_Warnings_Errors.Table (N);
13514 Set_Scope (T.Scope);
13515 Reset_Analyzed_Flags (T.Prag);
13516 Process_Compile_Time_Warning_Or_Error (T.Prag, T.Eloc);
13517 Unset_Scope (T.Scope);
13521 In_Compile_Time_Warning_Or_Error := False;
13522 Expander_Mode_Restore;
13523 end Validate_Compile_Time_Warning_Errors;
13525 ---------------------------
13526 -- Validate_Independence --
13527 ---------------------------
13529 procedure Validate_Independence is
13530 SU : constant Uint := UI_From_Int (System_Storage_Unit);
13538 procedure Check_Array_Type (Atyp : Entity_Id);
13539 -- Checks if the array type Atyp has independent components, and
13540 -- if not, outputs an appropriate set of error messages.
13542 procedure No_Independence;
13543 -- Output message that independence cannot be guaranteed
13545 function OK_Component (C : Entity_Id) return Boolean;
13546 -- Checks one component to see if it is independently accessible, and
13547 -- if so yields True, otherwise yields False if independent access
13548 -- cannot be guaranteed. This is a conservative routine, it only
13549 -- returns True if it knows for sure, it returns False if it knows
13550 -- there is a problem, or it cannot be sure there is no problem.
13552 procedure Reason_Bad_Component (C : Entity_Id);
13553 -- Outputs continuation message if a reason can be determined for
13554 -- the component C being bad.
13556 ----------------------
13557 -- Check_Array_Type --
13558 ----------------------
13560 procedure Check_Array_Type (Atyp : Entity_Id) is
13561 Ctyp : constant Entity_Id := Component_Type (Atyp);
13564 -- OK if no alignment clause, no pack, and no component size
13566 if not Has_Component_Size_Clause (Atyp)
13567 and then not Has_Alignment_Clause (Atyp)
13568 and then not Is_Packed (Atyp)
13573 -- Case of component size is greater than or equal to 64 and the
13574 -- alignment of the array is at least as large as the alignment
13575 -- of the component. We are definitely OK in this situation.
13577 if Known_Component_Size (Atyp)
13578 and then Component_Size (Atyp) >= 64
13579 and then Known_Alignment (Atyp)
13580 and then Known_Alignment (Ctyp)
13581 and then Alignment (Atyp) >= Alignment (Ctyp)
13586 -- Check actual component size
13588 if not Known_Component_Size (Atyp)
13589 or else not (Addressable (Component_Size (Atyp))
13590 and then Component_Size (Atyp) < 64)
13591 or else Component_Size (Atyp) mod Esize (Ctyp) /= 0
13595 -- Bad component size, check reason
13597 if Has_Component_Size_Clause (Atyp) then
13598 P := Get_Attribute_Definition_Clause
13599 (Atyp, Attribute_Component_Size);
13601 if Present (P) then
13602 Error_Msg_Sloc := Sloc (P);
13603 Error_Msg_N ("\because of Component_Size clause#", N);
13608 if Is_Packed (Atyp) then
13609 P := Get_Rep_Pragma (Atyp, Name_Pack);
13611 if Present (P) then
13612 Error_Msg_Sloc := Sloc (P);
13613 Error_Msg_N ("\because of pragma Pack#", N);
13618 -- No reason found, just return
13623 -- Array type is OK independence-wise
13626 end Check_Array_Type;
13628 ---------------------
13629 -- No_Independence --
13630 ---------------------
13632 procedure No_Independence is
13634 if Pragma_Name (N) = Name_Independent then
13635 Error_Msg_NE ("independence cannot be guaranteed for&", N, E);
13638 ("independent components cannot be guaranteed for&", N, E);
13640 end No_Independence;
13646 function OK_Component (C : Entity_Id) return Boolean is
13647 Rec : constant Entity_Id := Scope (C);
13648 Ctyp : constant Entity_Id := Etype (C);
13651 -- OK if no component clause, no Pack, and no alignment clause
13653 if No (Component_Clause (C))
13654 and then not Is_Packed (Rec)
13655 and then not Has_Alignment_Clause (Rec)
13660 -- Here we look at the actual component layout. A component is
13661 -- addressable if its size is a multiple of the Esize of the
13662 -- component type, and its starting position in the record has
13663 -- appropriate alignment, and the record itself has appropriate
13664 -- alignment to guarantee the component alignment.
13666 -- Make sure sizes are static, always assume the worst for any
13667 -- cases where we cannot check static values.
13669 if not (Known_Static_Esize (C)
13671 Known_Static_Esize (Ctyp))
13676 -- Size of component must be addressable or greater than 64 bits
13677 -- and a multiple of bytes.
13679 if not Addressable (Esize (C)) and then Esize (C) < Uint_64 then
13683 -- Check size is proper multiple
13685 if Esize (C) mod Esize (Ctyp) /= 0 then
13689 -- Check alignment of component is OK
13691 if not Known_Component_Bit_Offset (C)
13692 or else Component_Bit_Offset (C) < Uint_0
13693 or else Component_Bit_Offset (C) mod Esize (Ctyp) /= 0
13698 -- Check alignment of record type is OK
13700 if not Known_Alignment (Rec)
13701 or else (Alignment (Rec) * SU) mod Esize (Ctyp) /= 0
13706 -- All tests passed, component is addressable
13711 --------------------------
13712 -- Reason_Bad_Component --
13713 --------------------------
13715 procedure Reason_Bad_Component (C : Entity_Id) is
13716 Rec : constant Entity_Id := Scope (C);
13717 Ctyp : constant Entity_Id := Etype (C);
13720 -- If component clause present assume that's the problem
13722 if Present (Component_Clause (C)) then
13723 Error_Msg_Sloc := Sloc (Component_Clause (C));
13724 Error_Msg_N ("\because of Component_Clause#", N);
13728 -- If pragma Pack clause present, assume that's the problem
13730 if Is_Packed (Rec) then
13731 P := Get_Rep_Pragma (Rec, Name_Pack);
13733 if Present (P) then
13734 Error_Msg_Sloc := Sloc (P);
13735 Error_Msg_N ("\because of pragma Pack#", N);
13740 -- See if record has bad alignment clause
13742 if Has_Alignment_Clause (Rec)
13743 and then Known_Alignment (Rec)
13744 and then (Alignment (Rec) * SU) mod Esize (Ctyp) /= 0
13746 P := Get_Attribute_Definition_Clause (Rec, Attribute_Alignment);
13748 if Present (P) then
13749 Error_Msg_Sloc := Sloc (P);
13750 Error_Msg_N ("\because of Alignment clause#", N);
13754 -- Couldn't find a reason, so return without a message
13757 end Reason_Bad_Component;
13759 -- Start of processing for Validate_Independence
13762 for J in Independence_Checks.First .. Independence_Checks.Last loop
13763 N := Independence_Checks.Table (J).N;
13764 E := Independence_Checks.Table (J).E;
13765 IC := Pragma_Name (N) = Name_Independent_Components;
13767 -- Deal with component case
13769 if Ekind (E) = E_Discriminant or else Ekind (E) = E_Component then
13770 if not OK_Component (E) then
13772 Reason_Bad_Component (E);
13777 -- Deal with record with Independent_Components
13779 if IC and then Is_Record_Type (E) then
13780 Comp := First_Component_Or_Discriminant (E);
13781 while Present (Comp) loop
13782 if not OK_Component (Comp) then
13784 Reason_Bad_Component (Comp);
13788 Next_Component_Or_Discriminant (Comp);
13792 -- Deal with address clause case
13794 if Is_Object (E) then
13795 Addr := Address_Clause (E);
13797 if Present (Addr) then
13799 Error_Msg_Sloc := Sloc (Addr);
13800 Error_Msg_N ("\because of Address clause#", N);
13805 -- Deal with independent components for array type
13807 if IC and then Is_Array_Type (E) then
13808 Check_Array_Type (E);
13811 -- Deal with independent components for array object
13813 if IC and then Is_Object (E) and then Is_Array_Type (Etype (E)) then
13814 Check_Array_Type (Etype (E));
13819 end Validate_Independence;
13821 ------------------------------
13822 -- Validate_Iterable_Aspect --
13823 ------------------------------
13825 procedure Validate_Iterable_Aspect (Typ : Entity_Id; ASN : Node_Id) is
13830 Cursor : constant Entity_Id := Get_Cursor_Type (ASN, Typ);
13832 First_Id : Entity_Id;
13833 Next_Id : Entity_Id;
13834 Has_Element_Id : Entity_Id;
13835 Element_Id : Entity_Id;
13838 -- If previous error aspect is unusable
13840 if Cursor = Any_Type then
13846 Has_Element_Id := Empty;
13847 Element_Id := Empty;
13849 -- Each expression must resolve to a function with the proper signature
13851 Assoc := First (Component_Associations (Expression (ASN)));
13852 while Present (Assoc) loop
13853 Expr := Expression (Assoc);
13856 Prim := First (Choices (Assoc));
13858 if Nkind (Prim) /= N_Identifier or else Present (Next (Prim)) then
13859 Error_Msg_N ("illegal name in association", Prim);
13861 elsif Chars (Prim) = Name_First then
13862 Resolve_Iterable_Operation (Expr, Cursor, Typ, Name_First);
13863 First_Id := Entity (Expr);
13865 elsif Chars (Prim) = Name_Next then
13866 Resolve_Iterable_Operation (Expr, Cursor, Typ, Name_Next);
13867 Next_Id := Entity (Expr);
13869 elsif Chars (Prim) = Name_Has_Element then
13870 Resolve_Iterable_Operation (Expr, Cursor, Typ, Name_Has_Element);
13871 Has_Element_Id := Entity (Expr);
13873 elsif Chars (Prim) = Name_Element then
13874 Resolve_Iterable_Operation (Expr, Cursor, Typ, Name_Element);
13875 Element_Id := Entity (Expr);
13878 Error_Msg_N ("invalid name for iterable function", Prim);
13884 if No (First_Id) then
13885 Error_Msg_N ("match for First primitive not found", ASN);
13887 elsif No (Next_Id) then
13888 Error_Msg_N ("match for Next primitive not found", ASN);
13890 elsif No (Has_Element_Id) then
13891 Error_Msg_N ("match for Has_Element primitive not found", ASN);
13893 elsif No (Element_Id) then
13896 end Validate_Iterable_Aspect;
13898 -----------------------------------
13899 -- Validate_Unchecked_Conversion --
13900 -----------------------------------
13902 procedure Validate_Unchecked_Conversion
13904 Act_Unit : Entity_Id)
13906 Source : Entity_Id;
13907 Target : Entity_Id;
13911 -- Obtain source and target types. Note that we call Ancestor_Subtype
13912 -- here because the processing for generic instantiation always makes
13913 -- subtypes, and we want the original frozen actual types.
13915 -- If we are dealing with private types, then do the check on their
13916 -- fully declared counterparts if the full declarations have been
13917 -- encountered (they don't have to be visible, but they must exist).
13919 Source := Ancestor_Subtype (Etype (First_Formal (Act_Unit)));
13921 if Is_Private_Type (Source)
13922 and then Present (Underlying_Type (Source))
13924 Source := Underlying_Type (Source);
13927 Target := Ancestor_Subtype (Etype (Act_Unit));
13929 -- If either type is generic, the instantiation happens within a generic
13930 -- unit, and there is nothing to check. The proper check will happen
13931 -- when the enclosing generic is instantiated.
13933 if Is_Generic_Type (Source) or else Is_Generic_Type (Target) then
13937 if Is_Private_Type (Target)
13938 and then Present (Underlying_Type (Target))
13940 Target := Underlying_Type (Target);
13943 -- Source may be unconstrained array, but not target, except in relaxed
13946 if Is_Array_Type (Target)
13947 and then not Is_Constrained (Target)
13948 and then not Relaxed_RM_Semantics
13951 ("unchecked conversion to unconstrained array not allowed", N);
13955 -- Warn if conversion between two different convention pointers
13957 if Is_Access_Type (Target)
13958 and then Is_Access_Type (Source)
13959 and then Convention (Target) /= Convention (Source)
13960 and then Warn_On_Unchecked_Conversion
13962 -- Give warnings for subprogram pointers only on most targets
13964 if Is_Access_Subprogram_Type (Target)
13965 or else Is_Access_Subprogram_Type (Source)
13968 ("?z?conversion between pointers with different conventions!",
13973 -- Warn if one of the operands is Ada.Calendar.Time. Do not emit a
13974 -- warning when compiling GNAT-related sources.
13976 if Warn_On_Unchecked_Conversion
13977 and then not In_Predefined_Unit (N)
13978 and then RTU_Loaded (Ada_Calendar)
13979 and then (Chars (Source) = Name_Time
13981 Chars (Target) = Name_Time)
13983 -- If Ada.Calendar is loaded and the name of one of the operands is
13984 -- Time, there is a good chance that this is Ada.Calendar.Time.
13987 Calendar_Time : constant Entity_Id := Full_View (RTE (RO_CA_Time));
13989 pragma Assert (Present (Calendar_Time));
13991 if Source = Calendar_Time or else Target = Calendar_Time then
13993 ("?z?representation of 'Time values may change between
"
13994 & "'G'N'A
'T versions
", N);
13999 -- Make entry in unchecked conversion table for later processing by
14000 -- Validate_Unchecked_Conversions, which will check sizes and alignments
14001 -- (using values set by the back end where possible). This is only done
14002 -- if the appropriate warning is active.
14004 if Warn_On_Unchecked_Conversion then
14005 Unchecked_Conversions.Append
14006 (New_Val => UC_Entry'(Eloc => Sloc (N),
14009 Act_Unit => Act_Unit));
14011 -- If both sizes are known statically now, then back-end annotation
14012 -- is not required to do a proper check but if either size is not
14013 -- known statically, then we need the annotation.
14015 if Known_Static_RM_Size (Source)
14017 Known_Static_RM_Size (Target)
14021 Back_Annotate_Rep_Info := True;
14025 -- If unchecked conversion to access type, and access type is declared
14026 -- in the same unit as the unchecked conversion, then set the flag
14027 -- No_Strict_Aliasing (no strict aliasing is implicit here)
14029 if Is_Access_Type (Target) and then
14030 In_Same_Source_Unit (Target, N)
14032 Set_No_Strict_Aliasing (Implementation_Base_Type (Target));
14035 -- Generate N_Validate_Unchecked_Conversion node for back end in case
14036 -- the back end needs to perform special validation checks.
14038 -- Shouldn't this be in Exp_Ch13, since the check only gets done if we
14039 -- have full expansion and the back end is called ???
14042 Make_Validate_Unchecked_Conversion (Sloc (N));
14043 Set_Source_Type (Vnode, Source);
14044 Set_Target_Type (Vnode, Target);
14046 -- If the unchecked conversion node is in a list, just insert before it.
14047 -- If not we have some strange case, not worth bothering about.
14049 if Is_List_Member (N) then
14050 Insert_After (N, Vnode);
14052 end Validate_Unchecked_Conversion;
14054 ------------------------------------
14055 -- Validate_Unchecked_Conversions --
14056 ------------------------------------
14058 procedure Validate_Unchecked_Conversions is
14060 for N in Unchecked_Conversions.First .. Unchecked_Conversions.Last loop
14062 T : UC_Entry renames Unchecked_Conversions.Table (N);
14064 Act_Unit : constant Entity_Id := T.Act_Unit;
14065 Eloc : constant Source_Ptr := T.Eloc;
14066 Source : constant Entity_Id := T.Source;
14067 Target : constant Entity_Id := T.Target;
14073 -- Skip if function marked as warnings off
14075 if Warnings_Off (Act_Unit) then
14079 -- This validation check, which warns if we have unequal sizes for
14080 -- unchecked conversion, and thus potentially implementation
14081 -- dependent semantics, is one of the few occasions on which we
14082 -- use the official RM size instead of Esize. See description in
14083 -- Einfo "Handling
of Type'Size Values
" for details.
14085 if Serious_Errors_Detected = 0
14086 and then Known_Static_RM_Size (Source)
14087 and then Known_Static_RM_Size (Target)
14089 -- Don't do the check if warnings off for either type, note the
14090 -- deliberate use of OR here instead of OR ELSE to get the flag
14091 -- Warnings_Off_Used set for both types if appropriate.
14093 and then not (Has_Warnings_Off (Source)
14095 Has_Warnings_Off (Target))
14097 Source_Siz := RM_Size (Source);
14098 Target_Siz := RM_Size (Target);
14100 if Source_Siz /= Target_Siz then
14102 ("?z?types
for unchecked conversion have different sizes
!",
14105 if All_Errors_Mode then
14106 Error_Msg_Name_1 := Chars (Source);
14107 Error_Msg_Uint_1 := Source_Siz;
14108 Error_Msg_Name_2 := Chars (Target);
14109 Error_Msg_Uint_2 := Target_Siz;
14110 Error_Msg ("\size
of % is ^
, size
of % is ^?z?
", Eloc);
14112 Error_Msg_Uint_1 := UI_Abs (Source_Siz - Target_Siz);
14114 if Is_Discrete_Type (Source)
14116 Is_Discrete_Type (Target)
14118 if Source_Siz > Target_Siz then
14120 ("\?z?^ high order bits
of source will
"
14121 & "be ignored
!", Eloc);
14123 elsif Is_Unsigned_Type (Source) then
14125 ("\?z?source will be extended
with ^ high order
"
14126 & "zero bits
!", Eloc);
14130 ("\?z?source will be extended
with ^ high order
"
14131 & "sign bits
!", Eloc);
14134 elsif Source_Siz < Target_Siz then
14135 if Is_Discrete_Type (Target) then
14136 if Bytes_Big_Endian then
14138 ("\?z?target value will include ^ undefined
"
14139 & "low order bits
!", Eloc);
14142 ("\?z?target value will include ^ undefined
"
14143 & "high order bits
!", Eloc);
14148 ("\?z?^ trailing bits
of target value will be
"
14149 & "undefined
!", Eloc);
14152 else pragma Assert (Source_Siz > Target_Siz);
14153 if Is_Discrete_Type (Source) then
14154 if Bytes_Big_Endian then
14156 ("\?z?^ low order bits
of source will be
"
14157 & "ignored
!", Eloc);
14160 ("\?z?^ high order bits
of source will be
"
14161 & "ignored
!", Eloc);
14166 ("\?z?^ trailing bits
of source will be
"
14167 & "ignored
!", Eloc);
14174 -- If both types are access types, we need to check the alignment.
14175 -- If the alignment of both is specified, we can do it here.
14177 if Serious_Errors_Detected = 0
14178 and then Is_Access_Type (Source)
14179 and then Is_Access_Type (Target)
14180 and then Target_Strict_Alignment
14181 and then Present (Designated_Type (Source))
14182 and then Present (Designated_Type (Target))
14185 D_Source : constant Entity_Id := Designated_Type (Source);
14186 D_Target : constant Entity_Id := Designated_Type (Target);
14189 if Known_Alignment (D_Source)
14191 Known_Alignment (D_Target)
14194 Source_Align : constant Uint := Alignment (D_Source);
14195 Target_Align : constant Uint := Alignment (D_Target);
14198 if Source_Align < Target_Align
14199 and then not Is_Tagged_Type (D_Source)
14201 -- Suppress warning if warnings suppressed on either
14202 -- type or either designated type. Note the use of
14203 -- OR here instead of OR ELSE. That is intentional,
14204 -- we would like to set flag Warnings_Off_Used in
14205 -- all types for which warnings are suppressed.
14207 and then not (Has_Warnings_Off (D_Source)
14209 Has_Warnings_Off (D_Target)
14211 Has_Warnings_Off (Source)
14213 Has_Warnings_Off (Target))
14215 Error_Msg_Uint_1 := Target_Align;
14216 Error_Msg_Uint_2 := Source_Align;
14217 Error_Msg_Node_1 := D_Target;
14218 Error_Msg_Node_2 := D_Source;
14220 ("?z?alignment
of & (^
) is stricter than
"
14221 & "alignment
of & (^
)!", Eloc);
14223 ("\?z?resulting
access value may have invalid
"
14224 & "alignment
!", Eloc);
14235 end Validate_Unchecked_Conversions;