1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2014, 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 Atree
; use Atree
;
27 with Casing
; use Casing
;
28 with Checks
; use Checks
;
29 with Debug
; use Debug
;
30 with Einfo
; use Einfo
;
31 with Errout
; use Errout
;
32 with Exp_Ch11
; use Exp_Ch11
;
33 with Exp_Util
; use Exp_Util
;
34 with Expander
; use Expander
;
35 with Namet
; use Namet
;
36 with Nlists
; use Nlists
;
37 with Nmake
; use Nmake
;
39 with Restrict
; use Restrict
;
40 with Rident
; use Rident
;
41 with Rtsfind
; use Rtsfind
;
43 with Sem_Ch8
; use Sem_Ch8
;
44 with Sem_Util
; use Sem_Util
;
45 with Sinfo
; use Sinfo
;
46 with Sinput
; use Sinput
;
47 with Snames
; use Snames
;
48 with Stringt
; use Stringt
;
49 with Stand
; use Stand
;
50 with Tbuild
; use Tbuild
;
51 with Uintp
; use Uintp
;
52 with Validsw
; use Validsw
;
54 package body Exp_Prag
is
56 -----------------------
57 -- Local Subprograms --
58 -----------------------
60 function Arg1
(N
: Node_Id
) return Node_Id
;
61 function Arg2
(N
: Node_Id
) return Node_Id
;
62 function Arg3
(N
: Node_Id
) return Node_Id
;
63 -- Obtain specified pragma argument expression
65 procedure Expand_Pragma_Abort_Defer
(N
: Node_Id
);
66 procedure Expand_Pragma_Check
(N
: Node_Id
);
67 procedure Expand_Pragma_Common_Object
(N
: Node_Id
);
68 procedure Expand_Pragma_Import_Or_Interface
(N
: Node_Id
);
69 procedure Expand_Pragma_Inspection_Point
(N
: Node_Id
);
70 procedure Expand_Pragma_Interrupt_Priority
(N
: Node_Id
);
71 procedure Expand_Pragma_Loop_Variant
(N
: Node_Id
);
72 procedure Expand_Pragma_Psect_Object
(N
: Node_Id
);
73 procedure Expand_Pragma_Relative_Deadline
(N
: Node_Id
);
79 function Arg1
(N
: Node_Id
) return Node_Id
is
80 Arg
: constant Node_Id
:= First
(Pragma_Argument_Associations
(N
));
83 and then Nkind
(Arg
) = N_Pragma_Argument_Association
85 return Expression
(Arg
);
95 function Arg2
(N
: Node_Id
) return Node_Id
is
96 Arg1
: constant Node_Id
:= First
(Pragma_Argument_Associations
(N
));
104 Arg
: constant Node_Id
:= Next
(Arg1
);
107 and then Nkind
(Arg
) = N_Pragma_Argument_Association
109 return Expression
(Arg
);
121 function Arg3
(N
: Node_Id
) return Node_Id
is
122 Arg1
: constant Node_Id
:= First
(Pragma_Argument_Associations
(N
));
130 Arg
: Node_Id
:= Next
(Arg1
);
139 and then Nkind
(Arg
) = N_Pragma_Argument_Association
141 return Expression
(Arg
);
150 ---------------------------
151 -- Expand_Contract_Cases --
152 ---------------------------
154 -- Pragma Contract_Cases is expanded in the following manner:
157 -- Count : Natural := 0;
158 -- Flag_1 : Boolean := False;
160 -- Flag_N : Boolean := False;
161 -- Flag_N+1 : Boolean := False; -- when "others" present
166 -- <preconditions (if any)>
168 -- -- Evaluate all case guards
170 -- if Case_Guard_1 then
172 -- Count := Count + 1;
175 -- if Case_Guard_N then
177 -- Count := Count + 1;
180 -- -- Emit errors depending on the number of case guards that
181 -- -- evaluated to True.
184 -- raise Assertion_Error with "xxx contract cases incomplete";
186 -- Flag_N+1 := True; -- when "others" present
188 -- elsif Count > 1 then
190 -- Str0 : constant String :=
191 -- "contract cases overlap for subprogram ABC";
192 -- Str1 : constant String :=
194 -- Str0 & "case guard at xxx evaluates to True"
196 -- StrN : constant String :=
198 -- StrN-1 & "case guard at xxx evaluates to True"
201 -- raise Assertion_Error with StrN;
205 -- -- Evaluate all attribute 'Old prefixes found in the selected
209 -- Pref_1 := <prefix of 'Old found in Consequence_1>
212 -- Pref_M := <prefix of 'Old found in Consequence_N>
215 -- procedure _Postconditions is
217 -- <postconditions (if any)>
219 -- if Flag_1 and then not Consequence_1 then
220 -- raise Assertion_Error with "failed contract case at xxx";
223 -- if Flag_N[+1] and then not Consequence_N[+1] then
224 -- raise Assertion_Error with "failed contract case at xxx";
226 -- end _Postconditions;
231 procedure Expand_Contract_Cases
235 Stmts
: in out List_Id
)
237 Loc
: constant Source_Ptr
:= Sloc
(CCs
);
239 procedure Case_Guard_Error
242 Error_Loc
: Source_Ptr
;
243 Msg
: in out Entity_Id
);
244 -- Given a declarative list Decls, status flag Flag, the location of the
245 -- error and a string Msg, construct the following check:
246 -- Msg : constant String :=
248 -- Msg & "case guard at Error_Loc evaluates to True"
250 -- The resulting code is added to Decls
252 procedure Consequence_Error
253 (Checks
: in out Node_Id
;
256 -- Given an if statement Checks, status flag Flag and a consequence
257 -- Conseq, construct the following check:
258 -- [els]if Flag and then not Conseq then
259 -- raise Assertion_Error
260 -- with "failed contract case at Sloc (Conseq)";
262 -- The resulting code is added to Checks
264 function Declaration_Of
(Id
: Entity_Id
) return Node_Id
;
265 -- Given the entity Id of a boolean flag, generate:
266 -- Id : Boolean := False;
268 procedure Expand_Old_In_Consequence
270 Evals
: in out Node_Id
;
273 -- Perform specialized expansion of all attribute 'Old references found
274 -- in consequence Conseq such that at runtime only prefixes coming from
275 -- the selected consequence are evaluated. Any temporaries generated in
276 -- the process are added to declarative list Decls. Evals is a complex
277 -- if statement tasked with the evaluation of all prefixes coming from
278 -- a selected consequence. Flag is the corresponding case guard flag.
279 -- Conseq is the consequence expression.
281 function Increment
(Id
: Entity_Id
) return Node_Id
;
282 -- Given the entity Id of a numerical variable, generate:
285 function Set
(Id
: Entity_Id
) return Node_Id
;
286 -- Given the entity Id of a boolean variable, generate:
289 ----------------------
290 -- Case_Guard_Error --
291 ----------------------
293 procedure Case_Guard_Error
296 Error_Loc
: Source_Ptr
;
297 Msg
: in out Entity_Id
)
299 New_Line
: constant Character := Character'Val (10);
300 New_Msg
: constant Entity_Id
:= Make_Temporary
(Loc
, 'S');
304 Store_String_Char
(New_Line
);
305 Store_String_Chars
(" case guard at ");
306 Store_String_Chars
(Build_Location_String
(Error_Loc
));
307 Store_String_Chars
(" evaluates to True");
310 -- New_Msg : constant String :=
312 -- Msg & "case guard at Error_Loc evaluates to True"
316 Make_Object_Declaration
(Loc
,
317 Defining_Identifier
=> New_Msg
,
318 Constant_Present
=> True,
319 Object_Definition
=> New_Occurrence_Of
(Standard_String
, Loc
),
321 Make_If_Expression
(Loc
,
322 Expressions
=> New_List
(
323 New_Occurrence_Of
(Flag
, Loc
),
326 Left_Opnd
=> New_Occurrence_Of
(Msg
, Loc
),
327 Right_Opnd
=> Make_String_Literal
(Loc
, End_String
)),
329 New_Occurrence_Of
(Msg
, Loc
)))));
332 end Case_Guard_Error
;
334 -----------------------
335 -- Consequence_Error --
336 -----------------------
338 procedure Consequence_Error
339 (Checks
: in out Node_Id
;
348 -- Flag and then not Conseq
352 Left_Opnd
=> New_Occurrence_Of
(Flag
, Loc
),
355 Right_Opnd
=> Relocate_Node
(Conseq
)));
358 -- raise Assertion_Error
359 -- with "failed contract case at Sloc (Conseq)";
362 Store_String_Chars
("failed contract case at ");
363 Store_String_Chars
(Build_Location_String
(Sloc
(Conseq
)));
366 Make_Procedure_Call_Statement
(Loc
,
368 New_Occurrence_Of
(RTE
(RE_Raise_Assert_Failure
), Loc
),
369 Parameter_Associations
=> New_List
(
370 Make_String_Literal
(Loc
, End_String
)));
374 Make_Implicit_If_Statement
(CCs
,
376 Then_Statements
=> New_List
(Error
));
379 if No
(Elsif_Parts
(Checks
)) then
380 Set_Elsif_Parts
(Checks
, New_List
);
383 Append_To
(Elsif_Parts
(Checks
),
384 Make_Elsif_Part
(Loc
,
386 Then_Statements
=> New_List
(Error
)));
388 end Consequence_Error
;
394 function Declaration_Of
(Id
: Entity_Id
) return Node_Id
is
397 Make_Object_Declaration
(Loc
,
398 Defining_Identifier
=> Id
,
399 Object_Definition
=> New_Occurrence_Of
(Standard_Boolean
, Loc
),
400 Expression
=> New_Occurrence_Of
(Standard_False
, Loc
));
403 -------------------------------
404 -- Expand_Old_In_Consequence --
405 -------------------------------
407 procedure Expand_Old_In_Consequence
409 Evals
: in out Node_Id
;
413 Eval_Stmts
: List_Id
:= No_List
;
414 -- The evaluation sequence expressed as assignment statements of all
415 -- prefixes of attribute 'Old found in the current consequence.
417 function Expand_Old
(N
: Node_Id
) return Traverse_Result
;
418 -- Determine whether an arbitrary node denotes attribute 'Old and if
419 -- it does, perform all expansion-related actions.
425 function Expand_Old
(N
: Node_Id
) return Traverse_Result
is
431 if Nkind
(N
) = N_Attribute_Reference
432 and then Attribute_Name
(N
) = Name_Old
435 Temp
:= Make_Temporary
(Loc
, 'T', Pref
);
436 Set_Etype
(Temp
, Etype
(Pref
));
438 -- Generate a temporary to capture the value of the prefix:
439 -- Temp : <Pref type>;
440 -- Place that temporary at the beginning of declarations, to
441 -- prevent anomalies in the GNATprove flow-analysis pass in
442 -- the precondition procedure that follows.
445 Make_Object_Declaration
(Loc
,
446 Defining_Identifier
=> Temp
,
448 New_Occurrence_Of
(Etype
(Pref
), Loc
));
449 Set_No_Initialization
(Decl
);
451 Prepend_To
(Decls
, Decl
);
453 -- Evaluate the prefix, generate:
456 if No
(Eval_Stmts
) then
457 Eval_Stmts
:= New_List
;
460 Append_To
(Eval_Stmts
,
461 Make_Assignment_Statement
(Loc
,
462 Name
=> New_Occurrence_Of
(Temp
, Loc
),
463 Expression
=> Pref
));
465 -- Ensure that the prefix is valid
467 if Validity_Checks_On
and then Validity_Check_Operands
then
471 -- Replace the original attribute 'Old by a reference to the
472 -- generated temporary.
474 Rewrite
(N
, New_Occurrence_Of
(Temp
, Loc
));
480 procedure Expand_Olds
is new Traverse_Proc
(Expand_Old
);
482 -- Start of processing for Expand_Old_In_Consequence
485 -- Inspect the consequence and expand any attribute 'Old references
488 Expand_Olds
(Conseq
);
490 -- Augment the machinery to trigger the evaluation of all prefixes
491 -- found in the step above. If Eval is empty, then this is the first
492 -- consequence to yield expansion of 'Old. Generate:
495 -- <evaluation statements>
500 Make_Implicit_If_Statement
(CCs
,
501 Condition
=> New_Occurrence_Of
(Flag
, Loc
),
502 Then_Statements
=> Eval_Stmts
);
504 -- Otherwise generate:
506 -- <evaluation statements>
510 if No
(Elsif_Parts
(Evals
)) then
511 Set_Elsif_Parts
(Evals
, New_List
);
514 Append_To
(Elsif_Parts
(Evals
),
515 Make_Elsif_Part
(Loc
,
516 Condition
=> New_Occurrence_Of
(Flag
, Loc
),
517 Then_Statements
=> Eval_Stmts
));
519 end Expand_Old_In_Consequence
;
525 function Increment
(Id
: Entity_Id
) return Node_Id
is
528 Make_Assignment_Statement
(Loc
,
529 Name
=> New_Occurrence_Of
(Id
, Loc
),
532 Left_Opnd
=> New_Occurrence_Of
(Id
, Loc
),
533 Right_Opnd
=> Make_Integer_Literal
(Loc
, 1)));
540 function Set
(Id
: Entity_Id
) return Node_Id
is
543 Make_Assignment_Statement
(Loc
,
544 Name
=> New_Occurrence_Of
(Id
, Loc
),
545 Expression
=> New_Occurrence_Of
(Standard_True
, Loc
));
550 Aggr
: constant Node_Id
:=
552 (Pragma_Argument_Associations
(CCs
)));
553 Case_Guard
: Node_Id
;
557 Conseq_Checks
: Node_Id
:= Empty
;
559 Error_Decls
: List_Id
;
562 Multiple_PCs
: Boolean;
563 Old_Evals
: Node_Id
:= Empty
;
564 Others_Flag
: Entity_Id
:= Empty
;
567 -- Start of processing for Expand_Contract_Cases
570 -- Do nothing if pragma is not enabled. If pragma is disabled, it has
571 -- already been rewritten as a Null statement.
573 if Is_Ignored
(CCs
) then
576 -- Guard against malformed contract cases
578 elsif Nkind
(Aggr
) /= N_Aggregate
then
582 Multiple_PCs
:= List_Length
(Component_Associations
(Aggr
)) > 1;
584 -- Create the counter which tracks the number of case guards that
587 -- Count : Natural := 0;
589 Count
:= Make_Temporary
(Loc
, 'C');
592 Make_Object_Declaration
(Loc
,
593 Defining_Identifier
=> Count
,
594 Object_Definition
=> New_Occurrence_Of
(Standard_Natural
, Loc
),
595 Expression
=> Make_Integer_Literal
(Loc
, 0)));
597 -- Create the base error message for multiple overlapping case guards
599 -- Msg_Str : constant String :=
600 -- "contract cases overlap for subprogram Subp_Id";
603 Msg_Str
:= Make_Temporary
(Loc
, 'S');
606 Store_String_Chars
("contract cases overlap for subprogram ");
607 Store_String_Chars
(Get_Name_String
(Chars
(Subp_Id
)));
609 Error_Decls
:= New_List
(
610 Make_Object_Declaration
(Loc
,
611 Defining_Identifier
=> Msg_Str
,
612 Constant_Present
=> True,
613 Object_Definition
=> New_Occurrence_Of
(Standard_String
, Loc
),
614 Expression
=> Make_String_Literal
(Loc
, End_String
)));
617 -- Process individual post cases
619 Post_Case
:= First
(Component_Associations
(Aggr
));
620 while Present
(Post_Case
) loop
621 Case_Guard
:= First
(Choices
(Post_Case
));
622 Conseq
:= Expression
(Post_Case
);
624 -- The "others" choice requires special processing
626 if Nkind
(Case_Guard
) = N_Others_Choice
then
627 Others_Flag
:= Make_Temporary
(Loc
, 'F');
628 Prepend_To
(Decls
, Declaration_Of
(Others_Flag
));
630 -- Check possible overlap between a case guard and "others"
632 if Multiple_PCs
and Exception_Extra_Info
then
634 (Decls
=> Error_Decls
,
636 Error_Loc
=> Sloc
(Case_Guard
),
640 -- Inspect the consequence and perform special expansion of any
641 -- attribute 'Old references found within.
643 Expand_Old_In_Consequence
649 -- Check the corresponding consequence of "others"
652 (Checks
=> Conseq_Checks
,
659 -- Create the flag which tracks the state of its associated case
662 Flag
:= Make_Temporary
(Loc
, 'F');
663 Prepend_To
(Decls
, Declaration_Of
(Flag
));
665 -- The flag is set when the case guard is evaluated to True
666 -- if Case_Guard then
668 -- Count := Count + 1;
672 Make_Implicit_If_Statement
(CCs
,
673 Condition
=> Relocate_Node
(Case_Guard
),
674 Then_Statements
=> New_List
(
676 Increment
(Count
))));
678 -- Check whether this case guard overlaps with another one
680 if Multiple_PCs
and Exception_Extra_Info
then
682 (Decls
=> Error_Decls
,
684 Error_Loc
=> Sloc
(Case_Guard
),
688 -- Inspect the consequence and perform special expansion of any
689 -- attribute 'Old references found within.
691 Expand_Old_In_Consequence
697 -- The corresponding consequence of the case guard which evaluated
698 -- to True must hold on exit from the subprogram.
701 (Checks
=> Conseq_Checks
,
709 -- Raise Assertion_Error when none of the case guards evaluate to True.
710 -- The only exception is when we have "others", in which case there is
711 -- no error because "others" acts as a default True.
716 if Present
(Others_Flag
) then
717 CG_Stmts
:= New_List
(Set
(Others_Flag
));
720 -- raise Assertion_Error with "xxx contract cases incomplete";
724 Store_String_Chars
(Build_Location_String
(Loc
));
725 Store_String_Chars
(" contract cases incomplete");
727 CG_Stmts
:= New_List
(
728 Make_Procedure_Call_Statement
(Loc
,
730 New_Occurrence_Of
(RTE
(RE_Raise_Assert_Failure
), Loc
),
731 Parameter_Associations
=> New_List
(
732 Make_String_Literal
(Loc
, End_String
))));
736 Make_Implicit_If_Statement
(CCs
,
739 Left_Opnd
=> New_Occurrence_Of
(Count
, Loc
),
740 Right_Opnd
=> Make_Integer_Literal
(Loc
, 0)),
741 Then_Statements
=> CG_Stmts
);
743 -- Detect a possible failure due to several case guards evaluating to
747 -- elsif Count > 0 then
751 -- raise Assertion_Error with <Msg_Str>;
755 Set_Elsif_Parts
(CG_Checks
, New_List
(
756 Make_Elsif_Part
(Loc
,
759 Left_Opnd
=> New_Occurrence_Of
(Count
, Loc
),
760 Right_Opnd
=> Make_Integer_Literal
(Loc
, 1)),
762 Then_Statements
=> New_List
(
763 Make_Block_Statement
(Loc
,
764 Declarations
=> Error_Decls
,
765 Handled_Statement_Sequence
=>
766 Make_Handled_Sequence_Of_Statements
(Loc
,
767 Statements
=> New_List
(
768 Make_Procedure_Call_Statement
(Loc
,
771 (RTE
(RE_Raise_Assert_Failure
), Loc
),
772 Parameter_Associations
=> New_List
(
773 New_Occurrence_Of
(Msg_Str
, Loc
))))))))));
776 Append_To
(Decls
, CG_Checks
);
778 -- Once all case guards are evaluated and checked, evaluate any prefixes
779 -- of attribute 'Old founds in the selected consequence.
781 Append_To
(Decls
, Old_Evals
);
783 -- Raise Assertion_Error when the corresponding consequence of a case
784 -- guard that evaluated to True fails.
790 Append_To
(Stmts
, Conseq_Checks
);
791 end Expand_Contract_Cases
;
793 ---------------------
794 -- Expand_N_Pragma --
795 ---------------------
797 procedure Expand_N_Pragma
(N
: Node_Id
) is
798 Pname
: constant Name_Id
:= Pragma_Name
(N
);
801 -- Note: we may have a pragma whose Pragma_Identifier field is not a
802 -- recognized pragma, and we must ignore it at this stage.
804 if Is_Pragma_Name
(Pname
) then
805 case Get_Pragma_Id
(Pname
) is
807 -- Pragmas requiring special expander action
809 when Pragma_Abort_Defer
=>
810 Expand_Pragma_Abort_Defer
(N
);
813 Expand_Pragma_Check
(N
);
815 when Pragma_Common_Object
=>
816 Expand_Pragma_Common_Object
(N
);
818 when Pragma_Import
=>
819 Expand_Pragma_Import_Or_Interface
(N
);
821 when Pragma_Inspection_Point
=>
822 Expand_Pragma_Inspection_Point
(N
);
824 when Pragma_Interface
=>
825 Expand_Pragma_Import_Or_Interface
(N
);
827 when Pragma_Interrupt_Priority
=>
828 Expand_Pragma_Interrupt_Priority
(N
);
830 when Pragma_Loop_Variant
=>
831 Expand_Pragma_Loop_Variant
(N
);
833 when Pragma_Psect_Object
=>
834 Expand_Pragma_Psect_Object
(N
);
836 when Pragma_Relative_Deadline
=>
837 Expand_Pragma_Relative_Deadline
(N
);
839 -- All other pragmas need no expander action
847 -------------------------------
848 -- Expand_Pragma_Abort_Defer --
849 -------------------------------
851 -- An Abort_Defer pragma appears as the first statement in a handled
852 -- statement sequence (right after the begin). It defers aborts for
853 -- the entire statement sequence, but not for any declarations or
854 -- handlers (if any) associated with this statement sequence.
856 -- The transformation is to transform
858 -- pragma Abort_Defer;
867 -- when all others =>
868 -- Abort_Undefer.all;
871 -- Abort_Undefer_Direct;
874 procedure Expand_Pragma_Abort_Defer
(N
: Node_Id
) is
875 Loc
: constant Source_Ptr
:= Sloc
(N
);
879 Blk
: constant Entity_Id
:=
880 New_Internal_Entity
(E_Block
, Current_Scope
, Sloc
(N
), 'B');
883 Stms
:= New_List
(Build_Runtime_Call
(Loc
, RE_Abort_Defer
));
886 Stm
:= Remove_Next
(N
);
892 Make_Handled_Sequence_Of_Statements
(Loc
,
895 New_Occurrence_Of
(RTE
(RE_Abort_Undefer_Direct
), Loc
));
898 Make_Block_Statement
(Loc
,
899 Handled_Statement_Sequence
=> HSS
));
901 Set_Scope
(Blk
, Current_Scope
);
902 Set_Etype
(Blk
, Standard_Void_Type
);
903 Set_Identifier
(N
, New_Occurrence_Of
(Blk
, Sloc
(N
)));
904 Expand_At_End_Handler
(HSS
, Blk
);
906 end Expand_Pragma_Abort_Defer
;
908 --------------------------
909 -- Expand_Pragma_Check --
910 --------------------------
912 procedure Expand_Pragma_Check
(N
: Node_Id
) is
913 Cond
: constant Node_Id
:= Arg2
(N
);
914 Nam
: constant Name_Id
:= Chars
(Arg1
(N
));
917 Loc
: constant Source_Ptr
:= Sloc
(First_Node
(Cond
));
918 -- Source location used in the case of a failed assertion: point to the
919 -- failing condition, not Loc. Note that the source location of the
920 -- expression is not usually the best choice here, because it points to
921 -- the location of the topmost tree node, which may be an operator in
922 -- the middle of the source text of the expression. For example, it gets
923 -- located on the last AND keyword in a chain of boolean expressiond
924 -- AND'ed together. It is best to put the message on the first character
925 -- of the condition, which is the effect of the First_Node call here.
926 -- This source location is used to build the default exception message,
927 -- and also as the sloc of the call to the runtime subprogram raising
928 -- Assert_Failure, so that coverage analysis tools can relate the
929 -- call to the failed check.
932 -- Nothing to do if pragma is ignored
934 if Is_Ignored
(N
) then
938 -- Since this check is active, we rewrite the pragma into a
939 -- corresponding if statement, and then analyze the statement
941 -- The normal case expansion transforms:
943 -- pragma Check (name, condition [,message]);
947 -- if not condition then
948 -- System.Assertions.Raise_Assert_Failure (Str);
951 -- where Str is the message if one is present, or the default of
952 -- name failed at file:line if no message is given (the "name failed
953 -- at" is omitted for name = Assertion, since it is redundant, given
954 -- that the name of the exception is Assert_Failure.)
956 -- Also, instead of "XXX failed at", we generate slightly
957 -- different messages for some of the contract assertions (see
958 -- code below for details).
960 -- An alternative expansion is used when the No_Exception_Propagation
961 -- restriction is active and there is a local Assert_Failure handler.
962 -- This is not a common combination of circumstances, but it occurs in
963 -- the context of Aunit and the zero footprint profile. In this case we
966 -- if not condition then
967 -- raise Assert_Failure;
970 -- This will then be transformed into a goto, and the local handler will
971 -- be able to handle the assert error (which would not be the case if a
972 -- call is made to the Raise_Assert_Failure procedure).
974 -- We also generate the direct raise if the Suppress_Exception_Locations
975 -- is active, since we don't want to generate messages in this case.
977 -- Note that the reason we do not always generate a direct raise is that
978 -- the form in which the procedure is called allows for more efficient
979 -- breakpointing of assertion errors.
981 -- Generate the appropriate if statement. Note that we consider this to
982 -- be an explicit conditional in the source, not an implicit if, so we
983 -- do not call Make_Implicit_If_Statement.
985 -- Case where we generate a direct raise
987 if ((Debug_Flag_Dot_G
988 or else Restriction_Active
(No_Exception_Propagation
))
989 and then Present
(Find_Local_Handler
(RTE
(RE_Assert_Failure
), N
)))
990 or else (Opt
.Exception_Locations_Suppressed
and then No
(Arg3
(N
)))
993 Make_If_Statement
(Loc
,
994 Condition
=> Make_Op_Not
(Loc
, Right_Opnd
=> Cond
),
995 Then_Statements
=> New_List
(
996 Make_Raise_Statement
(Loc
,
997 Name
=> New_Occurrence_Of
(RTE
(RE_Assert_Failure
), Loc
)))));
999 -- Case where we call the procedure
1002 -- If we have a message given, use it
1004 if Present
(Arg3
(N
)) then
1005 Msg
:= Get_Pragma_Arg
(Arg3
(N
));
1007 -- Here we have no string, so prepare one
1011 Loc_Str
: constant String := Build_Location_String
(Loc
);
1016 -- For Assert, we just use the location
1018 if Nam
= Name_Assert
then
1021 -- For predicate, we generate the string "predicate failed
1022 -- at yyy". We prefer all lower case for predicate.
1024 elsif Nam
= Name_Predicate
then
1025 Add_Str_To_Name_Buffer
("predicate failed at ");
1027 -- For special case of Precondition/Postcondition the string is
1028 -- "failed xx from yy" where xx is precondition/postcondition
1029 -- in all lower case. The reason for this different wording is
1030 -- that the failure is not at the point of occurrence of the
1031 -- pragma, unlike the other Check cases.
1033 elsif Nam_In
(Nam
, Name_Precondition
, Name_Postcondition
) then
1034 Get_Name_String
(Nam
);
1035 Insert_Str_In_Name_Buffer
("failed ", 1);
1036 Add_Str_To_Name_Buffer
(" from ");
1038 -- For special case of Invariant, the string is "failed
1039 -- invariant from yy", to be consistent with the string that is
1040 -- generated for the aspect case (the code later on checks for
1041 -- this specific string to modify it in some cases, so this is
1042 -- functionally important).
1044 elsif Nam
= Name_Invariant
then
1045 Add_Str_To_Name_Buffer
("failed invariant from ");
1047 -- For all other checks, the string is "xxx failed at yyy"
1048 -- where xxx is the check name with current source file casing.
1051 Get_Name_String
(Nam
);
1052 Set_Casing
(Identifier_Casing
(Current_Source_File
));
1053 Add_Str_To_Name_Buffer
(" failed at ");
1056 -- In all cases, add location string
1058 Add_Str_To_Name_Buffer
(Loc_Str
);
1060 -- Build the message
1062 Msg
:= Make_String_Literal
(Loc
, Name_Buffer
(1 .. Name_Len
));
1066 -- Now rewrite as an if statement
1069 Make_If_Statement
(Loc
,
1070 Condition
=> Make_Op_Not
(Loc
, Right_Opnd
=> Cond
),
1071 Then_Statements
=> New_List
(
1072 Make_Procedure_Call_Statement
(Loc
,
1074 New_Occurrence_Of
(RTE
(RE_Raise_Assert_Failure
), Loc
),
1075 Parameter_Associations
=> New_List
(Relocate_Node
(Msg
))))));
1080 -- If new condition is always false, give a warning
1082 if Warn_On_Assertion_Failure
1083 and then Nkind
(N
) = N_Procedure_Call_Statement
1084 and then Is_RTE
(Entity
(Name
(N
)), RE_Raise_Assert_Failure
)
1086 -- If original condition was a Standard.False, we assume that this is
1087 -- indeed intended to raise assert error and no warning is required.
1089 if Is_Entity_Name
(Original_Node
(Cond
))
1090 and then Entity
(Original_Node
(Cond
)) = Standard_False
1094 elsif Nam
= Name_Assert
then
1095 Error_Msg_N
("?A?assertion will fail at run time", N
);
1098 Error_Msg_N
("?A?check will fail at run time", N
);
1101 end Expand_Pragma_Check
;
1103 ---------------------------------
1104 -- Expand_Pragma_Common_Object --
1105 ---------------------------------
1107 -- Use a machine attribute to replicate semantic effect in DEC Ada
1109 -- pragma Machine_Attribute (intern_name, "common_object", extern_name);
1111 -- For now we do nothing with the size attribute ???
1113 -- Note: Psect_Object shares this processing
1115 procedure Expand_Pragma_Common_Object
(N
: Node_Id
) is
1116 Loc
: constant Source_Ptr
:= Sloc
(N
);
1118 Internal
: constant Node_Id
:= Arg1
(N
);
1119 External
: constant Node_Id
:= Arg2
(N
);
1122 -- Psect value upper cased as string literal
1124 Iloc
: constant Source_Ptr
:= Sloc
(Internal
);
1125 Eloc
: constant Source_Ptr
:= Sloc
(External
);
1129 -- Acquire Psect value and fold to upper case
1131 if Present
(External
) then
1132 if Nkind
(External
) = N_String_Literal
then
1133 String_To_Name_Buffer
(Strval
(External
));
1135 Get_Name_String
(Chars
(External
));
1141 Make_String_Literal
(Eloc
, Strval
=> String_From_Name_Buffer
);
1144 Get_Name_String
(Chars
(Internal
));
1147 Make_String_Literal
(Iloc
, Strval
=> String_From_Name_Buffer
);
1150 Ploc
:= Sloc
(Psect
);
1152 -- Insert the pragma
1154 Insert_After_And_Analyze
(N
,
1156 Chars
=> Name_Machine_Attribute
,
1157 Pragma_Argument_Associations
=> New_List
(
1158 Make_Pragma_Argument_Association
(Iloc
,
1159 Expression
=> New_Copy_Tree
(Internal
)),
1160 Make_Pragma_Argument_Association
(Eloc
,
1162 Make_String_Literal
(Sloc
=> Ploc
,
1163 Strval
=> "common_object")),
1164 Make_Pragma_Argument_Association
(Ploc
,
1165 Expression
=> New_Copy_Tree
(Psect
)))));
1166 end Expand_Pragma_Common_Object
;
1168 ---------------------------------------
1169 -- Expand_Pragma_Import_Or_Interface --
1170 ---------------------------------------
1172 procedure Expand_Pragma_Import_Or_Interface
(N
: Node_Id
) is
1174 Init_Call
: Node_Id
;
1177 -- In Relaxed_RM_Semantics, support old Ada 83 style:
1178 -- pragma Import (Entity, "external name");
1180 if Relaxed_RM_Semantics
1181 and then List_Length
(Pragma_Argument_Associations
(N
)) = 2
1182 and then Chars
(Pragma_Identifier
(N
)) = Name_Import
1183 and then Nkind
(Arg2
(N
)) = N_String_Literal
1185 Def_Id
:= Entity
(Arg1
(N
));
1187 Def_Id
:= Entity
(Arg2
(N
));
1192 if Ekind
(Def_Id
) = E_Variable
then
1194 -- When applied to a variable, the default initialization must not be
1195 -- done. As it is already done when the pragma is found, we just get
1196 -- rid of the call the initialization procedure which followed the
1197 -- object declaration. The call is inserted after the declaration,
1198 -- but validity checks may also have been inserted and thus the
1199 -- initialization call does not necessarily appear immediately
1200 -- after the object declaration.
1202 -- We can't use the freezing mechanism for this purpose, since we
1203 -- have to elaborate the initialization expression when it is first
1204 -- seen (so this elaboration cannot be deferred to the freeze point).
1206 -- Find and remove generated initialization call for object, if any
1208 Init_Call
:= Remove_Init_Call
(Def_Id
, Rep_Clause
=> N
);
1210 -- Any default initialization expression should be removed (e.g.
1211 -- null defaults for access objects, zero initialization of packed
1212 -- bit arrays). Imported objects aren't allowed to have explicit
1213 -- initialization, so the expression must have been generated by
1216 if No
(Init_Call
) and then Present
(Expression
(Parent
(Def_Id
))) then
1217 Set_Expression
(Parent
(Def_Id
), Empty
);
1220 -- Case of exception with convention C++
1222 elsif Ekind
(Def_Id
) = E_Exception
1223 and then Convention
(Def_Id
) = Convention_CPP
1225 -- Import a C++ convention
1228 Loc
: constant Source_Ptr
:= Sloc
(N
);
1229 Rtti_Name
: constant Node_Id
:= Arg3
(N
);
1230 Dum
: constant Entity_Id
:= Make_Temporary
(Loc
, 'D');
1232 Lang_Char
: Node_Id
;
1233 Foreign_Data
: Node_Id
;
1236 Exdata
:= Component_Associations
(Expression
(Parent
(Def_Id
)));
1238 Lang_Char
:= Next
(First
(Exdata
));
1240 -- Change the one-character language designator to 'C'
1242 Rewrite
(Expression
(Lang_Char
),
1243 Make_Character_Literal
(Loc
,
1245 Char_Literal_Value
=> UI_From_Int
(Character'Pos ('C'))));
1246 Analyze
(Expression
(Lang_Char
));
1248 -- Change the value of Foreign_Data
1250 Foreign_Data
:= Next
(Next
(Next
(Next
(Lang_Char
))));
1252 Insert_Actions
(Def_Id
, New_List
(
1253 Make_Object_Declaration
(Loc
,
1254 Defining_Identifier
=> Dum
,
1255 Object_Definition
=>
1256 New_Occurrence_Of
(Standard_Character
, Loc
)),
1259 Chars
=> Name_Import
,
1260 Pragma_Argument_Associations
=> New_List
(
1261 Make_Pragma_Argument_Association
(Loc
,
1262 Expression
=> Make_Identifier
(Loc
, Name_Ada
)),
1264 Make_Pragma_Argument_Association
(Loc
,
1265 Expression
=> Make_Identifier
(Loc
, Chars
(Dum
))),
1267 Make_Pragma_Argument_Association
(Loc
,
1268 Chars
=> Name_External_Name
,
1269 Expression
=> Relocate_Node
(Rtti_Name
))))));
1271 Rewrite
(Expression
(Foreign_Data
),
1272 Unchecked_Convert_To
(Standard_A_Char
,
1273 Make_Attribute_Reference
(Loc
,
1274 Prefix
=> Make_Identifier
(Loc
, Chars
(Dum
)),
1275 Attribute_Name
=> Name_Address
)));
1276 Analyze
(Expression
(Foreign_Data
));
1279 -- No special expansion required for any other case
1284 end Expand_Pragma_Import_Or_Interface
;
1286 -------------------------------------
1287 -- Expand_Pragma_Initial_Condition --
1288 -------------------------------------
1290 procedure Expand_Pragma_Initial_Condition
(Spec_Or_Body
: Node_Id
) is
1291 Loc
: constant Source_Ptr
:= Sloc
(Spec_Or_Body
);
1294 Init_Cond
: Node_Id
;
1296 Pack_Id
: Entity_Id
;
1299 if Nkind
(Spec_Or_Body
) = N_Package_Body
then
1300 Pack_Id
:= Corresponding_Spec
(Spec_Or_Body
);
1302 if Present
(Handled_Statement_Sequence
(Spec_Or_Body
)) then
1303 List
:= Statements
(Handled_Statement_Sequence
(Spec_Or_Body
));
1305 -- The package body lacks statements, create an empty list
1310 Set_Handled_Statement_Sequence
(Spec_Or_Body
,
1311 Make_Handled_Sequence_Of_Statements
(Loc
, Statements
=> List
));
1314 elsif Nkind
(Spec_Or_Body
) = N_Package_Declaration
then
1315 Pack_Id
:= Defining_Entity
(Spec_Or_Body
);
1317 if Present
(Visible_Declarations
(Specification
(Spec_Or_Body
))) then
1318 List
:= Visible_Declarations
(Specification
(Spec_Or_Body
));
1320 -- The package lacks visible declarations, create an empty list
1325 Set_Visible_Declarations
(Specification
(Spec_Or_Body
), List
);
1328 -- This routine should not be used on anything other than packages
1331 raise Program_Error
;
1334 Init_Cond
:= Get_Pragma
(Pack_Id
, Pragma_Initial_Condition
);
1336 -- The caller should check whether the package is subject to pragma
1337 -- Initial_Condition.
1339 pragma Assert
(Present
(Init_Cond
));
1342 Get_Pragma_Arg
(First
(Pragma_Argument_Associations
(Init_Cond
)));
1344 -- The assertion expression was found to be illegal, do not generate the
1345 -- runtime check as it will repeat the illegality.
1347 if Error_Posted
(Init_Cond
) or else Error_Posted
(Expr
) then
1352 -- pragma Check (Initial_Condition, <Expr>);
1356 Chars
=> Name_Check
,
1357 Pragma_Argument_Associations
=> New_List
(
1358 Make_Pragma_Argument_Association
(Loc
,
1359 Expression
=> Make_Identifier
(Loc
, Name_Initial_Condition
)),
1361 Make_Pragma_Argument_Association
(Loc
,
1362 Expression
=> New_Copy_Tree
(Expr
))));
1364 Append_To
(List
, Check
);
1366 end Expand_Pragma_Initial_Condition
;
1368 ------------------------------------
1369 -- Expand_Pragma_Inspection_Point --
1370 ------------------------------------
1372 -- If no argument is given, then we supply a default argument list that
1373 -- includes all objects declared at the source level in all subprograms
1374 -- that enclose the inspection point pragma.
1376 procedure Expand_Pragma_Inspection_Point
(N
: Node_Id
) is
1377 Loc
: constant Source_Ptr
:= Sloc
(N
);
1384 if No
(Pragma_Argument_Associations
(N
)) then
1388 while S
/= Standard_Standard
loop
1389 E
:= First_Entity
(S
);
1390 while Present
(E
) loop
1391 if Comes_From_Source
(E
)
1392 and then Is_Object
(E
)
1393 and then not Is_Entry_Formal
(E
)
1394 and then Ekind
(E
) /= E_Component
1395 and then Ekind
(E
) /= E_Discriminant
1396 and then Ekind
(E
) /= E_Generic_In_Parameter
1397 and then Ekind
(E
) /= E_Generic_In_Out_Parameter
1400 Make_Pragma_Argument_Association
(Loc
,
1401 Expression
=> New_Occurrence_Of
(E
, Loc
)));
1410 Set_Pragma_Argument_Associations
(N
, A
);
1413 -- Expand the arguments of the pragma. Expanding an entity reference
1414 -- is a noop, except in a protected operation, where a reference may
1415 -- have to be transformed into a reference to the corresponding prival.
1416 -- Are there other pragmas that may require this ???
1418 Assoc
:= First
(Pragma_Argument_Associations
(N
));
1420 while Present
(Assoc
) loop
1421 Expand
(Expression
(Assoc
));
1424 end Expand_Pragma_Inspection_Point
;
1426 --------------------------------------
1427 -- Expand_Pragma_Interrupt_Priority --
1428 --------------------------------------
1430 -- Supply default argument if none exists (System.Interrupt_Priority'Last)
1432 procedure Expand_Pragma_Interrupt_Priority
(N
: Node_Id
) is
1433 Loc
: constant Source_Ptr
:= Sloc
(N
);
1436 if No
(Pragma_Argument_Associations
(N
)) then
1437 Set_Pragma_Argument_Associations
(N
, New_List
(
1438 Make_Pragma_Argument_Association
(Loc
,
1440 Make_Attribute_Reference
(Loc
,
1442 New_Occurrence_Of
(RTE
(RE_Interrupt_Priority
), Loc
),
1443 Attribute_Name
=> Name_Last
))));
1445 end Expand_Pragma_Interrupt_Priority
;
1447 --------------------------------
1448 -- Expand_Pragma_Loop_Variant --
1449 --------------------------------
1451 -- Pragma Loop_Variant is expanded in the following manner:
1455 -- for | while ... loop
1456 -- <preceding source statements>
1457 -- pragma Loop_Variant
1458 -- (Increases => Incr_Expr,
1459 -- Decreases => Decr_Expr);
1460 -- <succeeding source statements>
1465 -- Curr_1 : <type of Incr_Expr>;
1466 -- Curr_2 : <type of Decr_Expr>;
1467 -- Old_1 : <type of Incr_Expr>;
1468 -- Old_2 : <type of Decr_Expr>;
1469 -- Flag : Boolean := False;
1471 -- for | while ... loop
1472 -- <preceding source statements>
1479 -- Curr_1 := <Incr_Expr>;
1480 -- Curr_2 := <Decr_Expr>;
1483 -- if Curr_1 /= Old_1 then
1484 -- pragma Check (Loop_Variant, Curr_1 > Old_1);
1486 -- pragma Check (Loop_Variant, Curr_2 < Old_2);
1492 -- <succeeding source statements>
1495 procedure Expand_Pragma_Loop_Variant
(N
: Node_Id
) is
1496 Loc
: constant Source_Ptr
:= Sloc
(N
);
1498 Last_Var
: constant Node_Id
:= Last
(Pragma_Argument_Associations
(N
));
1500 Curr_Assign
: List_Id
:= No_List
;
1501 Flag_Id
: Entity_Id
:= Empty
;
1502 If_Stmt
: Node_Id
:= Empty
;
1503 Old_Assign
: List_Id
:= No_List
;
1504 Loop_Scop
: Entity_Id
;
1505 Loop_Stmt
: Node_Id
;
1508 procedure Process_Variant
(Variant
: Node_Id
; Is_Last
: Boolean);
1509 -- Process a single increasing / decreasing termination variant. Flag
1510 -- Is_Last should be set when processing the last variant.
1512 ---------------------
1513 -- Process_Variant --
1514 ---------------------
1516 procedure Process_Variant
(Variant
: Node_Id
; Is_Last
: Boolean) is
1520 Old_Val
: Node_Id
) return Node_Id
;
1521 -- Generate a comparison between Curr_Val and Old_Val depending on
1522 -- the change mode (Increases / Decreases) of the variant.
1531 Old_Val
: Node_Id
) return Node_Id
1534 if Chars
(Variant
) = Name_Increases
then
1535 return Make_Op_Gt
(Loc
, Curr_Val
, Old_Val
);
1536 else pragma Assert
(Chars
(Variant
) = Name_Decreases
);
1537 return Make_Op_Lt
(Loc
, Curr_Val
, Old_Val
);
1543 Expr
: constant Node_Id
:= Expression
(Variant
);
1544 Expr_Typ
: constant Entity_Id
:= Etype
(Expr
);
1545 Loc
: constant Source_Ptr
:= Sloc
(Expr
);
1546 Loop_Loc
: constant Source_Ptr
:= Sloc
(Loop_Stmt
);
1547 Curr_Id
: Entity_Id
;
1551 -- Start of processing for Process_Variant
1554 -- All temporaries generated in this routine must be inserted before
1555 -- the related loop statement. Ensure that the proper scope is on the
1556 -- stack when analyzing the temporaries. Note that we also use the
1557 -- Sloc of the related loop.
1559 Push_Scope
(Scope
(Loop_Scop
));
1561 -- Step 1: Create the declaration of the flag which controls the
1562 -- behavior of the assertion on the first iteration of the loop.
1564 if No
(Flag_Id
) then
1567 -- Flag : Boolean := False;
1569 Flag_Id
:= Make_Temporary
(Loop_Loc
, 'F');
1571 Insert_Action
(Loop_Stmt
,
1572 Make_Object_Declaration
(Loop_Loc
,
1573 Defining_Identifier
=> Flag_Id
,
1574 Object_Definition
=>
1575 New_Occurrence_Of
(Standard_Boolean
, Loop_Loc
),
1577 New_Occurrence_Of
(Standard_False
, Loop_Loc
)));
1579 -- Prevent an unwanted optimization where the Current_Value of
1580 -- the flag eliminates the if statement which stores the variant
1581 -- values coming from the previous iteration.
1583 -- Flag : Boolean := False;
1585 -- if Flag then -- condition rewritten to False
1586 -- Old_N := Curr_N; -- and if statement eliminated
1592 Set_Current_Value
(Flag_Id
, Empty
);
1595 -- Step 2: Create the temporaries which store the old and current
1596 -- values of the associated expression.
1599 -- Curr : <type of Expr>;
1601 Curr_Id
:= Make_Temporary
(Loc
, 'C');
1603 Insert_Action
(Loop_Stmt
,
1604 Make_Object_Declaration
(Loop_Loc
,
1605 Defining_Identifier
=> Curr_Id
,
1606 Object_Definition
=> New_Occurrence_Of
(Expr_Typ
, Loop_Loc
)));
1609 -- Old : <type of Expr>;
1611 Old_Id
:= Make_Temporary
(Loc
, 'P');
1613 Insert_Action
(Loop_Stmt
,
1614 Make_Object_Declaration
(Loop_Loc
,
1615 Defining_Identifier
=> Old_Id
,
1616 Object_Definition
=> New_Occurrence_Of
(Expr_Typ
, Loop_Loc
)));
1618 -- Restore original scope after all temporaries have been analyzed
1622 -- Step 3: Store value of the expression from the previous iteration
1624 if No
(Old_Assign
) then
1625 Old_Assign
:= New_List
;
1631 Append_To
(Old_Assign
,
1632 Make_Assignment_Statement
(Loc
,
1633 Name
=> New_Occurrence_Of
(Old_Id
, Loc
),
1634 Expression
=> New_Occurrence_Of
(Curr_Id
, Loc
)));
1636 -- Step 4: Store the current value of the expression
1638 if No
(Curr_Assign
) then
1639 Curr_Assign
:= New_List
;
1645 Append_To
(Curr_Assign
,
1646 Make_Assignment_Statement
(Loc
,
1647 Name
=> New_Occurrence_Of
(Curr_Id
, Loc
),
1648 Expression
=> Relocate_Node
(Expr
)));
1650 -- Step 5: Create corresponding assertion to verify change of value
1653 -- pragma Check (Loop_Variant, Curr <|> Old);
1657 Chars
=> Name_Check
,
1658 Pragma_Argument_Associations
=> New_List
(
1659 Make_Pragma_Argument_Association
(Loc
,
1660 Expression
=> Make_Identifier
(Loc
, Name_Loop_Variant
)),
1661 Make_Pragma_Argument_Association
(Loc
,
1664 Curr_Val
=> New_Occurrence_Of
(Curr_Id
, Loc
),
1665 Old_Val
=> New_Occurrence_Of
(Old_Id
, Loc
)))));
1668 -- if Curr /= Old then
1671 if No
(If_Stmt
) then
1673 -- When there is just one termination variant, do not compare the
1674 -- old and current value for equality, just check the pragma.
1680 Make_If_Statement
(Loc
,
1683 Left_Opnd
=> New_Occurrence_Of
(Curr_Id
, Loc
),
1684 Right_Opnd
=> New_Occurrence_Of
(Old_Id
, Loc
)),
1685 Then_Statements
=> New_List
(Prag
));
1694 Set_Else_Statements
(If_Stmt
, New_List
(Prag
));
1697 -- elsif Curr /= Old then
1701 if Elsif_Parts
(If_Stmt
) = No_List
then
1702 Set_Elsif_Parts
(If_Stmt
, New_List
);
1705 Append_To
(Elsif_Parts
(If_Stmt
),
1706 Make_Elsif_Part
(Loc
,
1709 Left_Opnd
=> New_Occurrence_Of
(Curr_Id
, Loc
),
1710 Right_Opnd
=> New_Occurrence_Of
(Old_Id
, Loc
)),
1711 Then_Statements
=> New_List
(Prag
)));
1713 end Process_Variant
;
1715 -- Start of processing for Expand_Pragma_Loop_Variant
1718 -- If pragma is not enabled, rewrite as Null statement. If pragma is
1719 -- disabled, it has already been rewritten as a Null statement.
1721 if Is_Ignored
(N
) then
1722 Rewrite
(N
, Make_Null_Statement
(Loc
));
1727 -- Locate the enclosing loop for which this assertion applies. In the
1728 -- case of Ada 2012 array iteration, we might be dealing with nested
1729 -- loops. Only the outermost loop has an identifier.
1732 while Present
(Loop_Stmt
) loop
1733 if Nkind
(Loop_Stmt
) = N_Loop_Statement
1734 and then Present
(Identifier
(Loop_Stmt
))
1739 Loop_Stmt
:= Parent
(Loop_Stmt
);
1742 Loop_Scop
:= Entity
(Identifier
(Loop_Stmt
));
1744 -- Create the circuitry which verifies individual variants
1746 Variant
:= First
(Pragma_Argument_Associations
(N
));
1747 while Present
(Variant
) loop
1748 Process_Variant
(Variant
, Is_Last
=> Variant
= Last_Var
);
1753 -- Construct the segment which stores the old values of all expressions.
1760 Make_If_Statement
(Loc
,
1761 Condition
=> New_Occurrence_Of
(Flag_Id
, Loc
),
1762 Then_Statements
=> Old_Assign
));
1764 -- Update the values of all expressions
1766 Insert_Actions
(N
, Curr_Assign
);
1768 -- Add the assertion circuitry to test all changes in expressions.
1777 Make_If_Statement
(Loc
,
1778 Condition
=> New_Occurrence_Of
(Flag_Id
, Loc
),
1779 Then_Statements
=> New_List
(If_Stmt
),
1780 Else_Statements
=> New_List
(
1781 Make_Assignment_Statement
(Loc
,
1782 Name
=> New_Occurrence_Of
(Flag_Id
, Loc
),
1783 Expression
=> New_Occurrence_Of
(Standard_True
, Loc
)))));
1785 -- Note: the pragma has been completely transformed into a sequence of
1786 -- corresponding declarations and statements. We leave it in the tree
1787 -- for documentation purposes. It will be ignored by the backend.
1789 end Expand_Pragma_Loop_Variant
;
1791 --------------------------------
1792 -- Expand_Pragma_Psect_Object --
1793 --------------------------------
1795 -- Convert to Common_Object, and expand the resulting pragma
1797 procedure Expand_Pragma_Psect_Object
(N
: Node_Id
)
1798 renames Expand_Pragma_Common_Object
;
1800 -------------------------------------
1801 -- Expand_Pragma_Relative_Deadline --
1802 -------------------------------------
1804 procedure Expand_Pragma_Relative_Deadline
(N
: Node_Id
) is
1805 P
: constant Node_Id
:= Parent
(N
);
1806 Loc
: constant Source_Ptr
:= Sloc
(N
);
1809 -- Expand the pragma only in the case of the main subprogram. For tasks
1810 -- the expansion is done in exp_ch9. Generate a call to Set_Deadline
1811 -- at Clock plus the relative deadline specified in the pragma. Time
1812 -- values are translated into Duration to allow for non-private
1813 -- addition operation.
1815 if Nkind
(P
) = N_Subprogram_Body
then
1818 Make_Procedure_Call_Statement
(Loc
,
1819 Name
=> New_Occurrence_Of
(RTE
(RE_Set_Deadline
), Loc
),
1820 Parameter_Associations
=> New_List
(
1821 Unchecked_Convert_To
(RTE
(RO_RT_Time
),
1824 Make_Function_Call
(Loc
,
1825 New_Occurrence_Of
(RTE
(RO_RT_To_Duration
), Loc
),
1826 New_List
(Make_Function_Call
(Loc
,
1827 New_Occurrence_Of
(RTE
(RE_Clock
), Loc
)))),
1829 Unchecked_Convert_To
(Standard_Duration
, Arg1
(N
)))))));
1833 end Expand_Pragma_Relative_Deadline
;