1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 2009, 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 Einfo; use Einfo;
27 with Namet; use Namet;
28 with Nlists; use Nlists;
30 with Rtsfind; use Rtsfind;
32 with Sem_Aux; use Sem_Aux;
33 with Sem_Util; use Sem_Util;
34 with Sinfo; use Sinfo;
35 with Snames; use Snames;
36 with Stand; use Stand;
38 package body Sem_SCIL is
40 ----------------------
41 -- Adjust_SCIL_Node --
42 ----------------------
44 procedure Adjust_SCIL_Node (Old_Node : Node_Id; New_Node : Node_Id) is
48 pragma Assert (Generate_SCIL);
50 -- Check cases in which no action is required. Currently the only SCIL
51 -- nodes that may require adjustment are those of dispatching calls
52 -- internally generated by the frontend.
54 if Comes_From_Source (Old_Node)
56 Nkind_In (New_Node, N_Function_Call, N_Procedure_Call_Statement)
60 -- Conditional expression associated with equality operator. Old_Node
61 -- may be part of the expansion of the predefined equality operator of
62 -- a tagged type and hence we need to check if it has a SCIL dispatching
63 -- node that needs adjustment.
65 elsif Nkind (Old_Node) = N_Conditional_Expression
66 and then (Nkind (Original_Node (Old_Node)) = N_Op_Eq
68 (Nkind (Original_Node (Old_Node)) = N_Function_Call
69 and then Chars (Name (Original_Node (Old_Node))) =
74 -- Type conversions may involve dispatching calls to functions whose
75 -- associated SCIL dispatching node needs adjustment.
77 elsif Nkind_In (Old_Node, N_Type_Conversion,
78 N_Unchecked_Type_Conversion)
82 -- Relocated subprogram call
84 elsif Nkind (Old_Node) = Nkind (New_Node)
85 and then Original_Node (Old_Node) = Original_Node (New_Node)
93 -- Search for the SCIL node and update it (if found)
95 SCIL_Node := Find_SCIL_Node (Old_Node);
97 if Present (SCIL_Node) then
98 Set_SCIL_Related_Node (SCIL_Node, New_Node);
100 end Adjust_SCIL_Node;
102 ---------------------
103 -- Check_SCIL_Node --
104 ---------------------
106 function Check_SCIL_Node (N : Node_Id) return Traverse_Result is
108 Ctrl_Typ : Entity_Id;
111 if Nkind (N) = N_SCIL_Membership_Test then
113 -- Check contents of the boolean expression associated with the
116 pragma Assert (Nkind (SCIL_Related_Node (N)) = N_Identifier
117 and then Etype (SCIL_Related_Node (N)) = Standard_Boolean);
119 -- Check the entity identifier of the associated tagged type (that
120 -- is, in testing for membership in T'Class, the entity id of the
123 -- Note: When the SCIL node is generated the private and full-view
124 -- of the tagged types may have been swapped and hence the node
125 -- referenced by attribute SCIL_Entity may be the private view.
126 -- Therefore, in order to uniformily locate the full-view we use
127 -- attribute Underlying_Type.
129 pragma Assert (Is_Tagged_Type (Underlying_Type (SCIL_Entity (N))));
131 -- Interface types are unsupported
133 pragma Assert (not Is_Interface (Underlying_Type (SCIL_Entity (N))));
135 -- Check the decoration of the expression that denotes the tag value
138 Ctrl_Tag := SCIL_Tag_Value (N);
140 case Nkind (Ctrl_Tag) is
142 -- For class-wide membership tests the SCIL tag value is the tag
143 -- of the tested object (i.e. Obj.Tag).
145 when N_Selected_Component =>
146 pragma Assert (Etype (Ctrl_Tag) = RTE (RE_Tag));
150 pragma Assert (False);
156 elsif Nkind (N) = N_SCIL_Dispatching_Call then
157 Ctrl_Tag := SCIL_Controlling_Tag (N);
159 -- SCIL_Related_Node of SCIL dispatching call nodes MUST reference
162 if not Nkind_In (SCIL_Related_Node (N), N_Function_Call,
163 N_Procedure_Call_Statement)
165 pragma Assert (False);
168 -- In simple cases the controlling tag is the tag of the controlling
169 -- argument (i.e. Obj.Tag).
171 elsif Nkind (Ctrl_Tag) = N_Selected_Component then
172 Ctrl_Typ := Etype (Ctrl_Tag);
174 -- Interface types are unsupported
176 if Is_Interface (Ctrl_Typ)
177 or else (RTE_Available (RE_Interface_Tag)
178 and then Ctrl_Typ = RTE (RE_Interface_Tag))
183 pragma Assert (Ctrl_Typ = RTE (RE_Tag));
187 -- When the controlling tag of a dispatching call is an identifier
188 -- the SCIL_Controlling_Tag attribute references the corresponding
189 -- object or parameter declaration. Interface types are still
192 elsif Nkind_In (Ctrl_Tag, N_Object_Declaration,
193 N_Parameter_Specification)
195 Ctrl_Typ := Etype (Defining_Identifier (Ctrl_Tag));
197 -- Interface types are unsupported.
199 if Is_Interface (Ctrl_Typ)
200 or else (RTE_Available (RE_Interface_Tag)
201 and then Ctrl_Typ = RTE (RE_Interface_Tag))
202 or else (Is_Access_Type (Ctrl_Typ)
206 (Base_Type (Designated_Type (Ctrl_Typ)))))
212 (Ctrl_Typ = RTE (RE_Tag)
214 (Is_Access_Type (Ctrl_Typ)
215 and then Available_View
216 (Base_Type (Designated_Type (Ctrl_Typ))) =
221 -- Interface types are unsupported
223 elsif Is_Interface (Etype (Ctrl_Tag)) then
227 pragma Assert (False);
233 -- Node is not N_SCIL_Dispatching_Call
244 function Find_SCIL_Node (Node : Node_Id) return Node_Id is
245 Found_Node : Node_Id;
246 -- This variable stores the last node found by the nested subprogram
249 function Find_SCIL_Node (L : List_Id) return Boolean;
250 -- Searches in list L for a SCIL node associated with a dispatching call
251 -- whose SCIL_Related_Node is Node. If found returns true and stores the
252 -- SCIL node in Found_Node; otherwise returns False and sets Found_Node
259 function Find_SCIL_Node (L : List_Id) return Boolean is
264 while Present (N) loop
265 if Nkind (N) in N_SCIL_Node
266 and then SCIL_Related_Node (N) = Node
283 -- Start of processing for Find_SCIL_Node
286 pragma Assert (Generate_SCIL);
288 -- Search for the SCIL node in list associated with a transient scope
290 if Scope_Is_Transient then
292 SE : Scope_Stack_Entry
293 renames Scope_Stack.Table (Scope_Stack.Last);
296 and then Present (SE.Actions_To_Be_Wrapped_Before)
297 and then Find_SCIL_Node (SE.Actions_To_Be_Wrapped_Before)
304 -- Otherwise climb up the tree searching for the SCIL node analyzing
305 -- all the lists in which Insert_Actions may have inserted it
308 while Present (P) loop
311 -- Actions associated with AND THEN or OR ELSE
313 when N_Short_Circuit =>
314 if Present (Actions (P))
315 and then Find_SCIL_Node (Actions (P))
320 -- Actions of conditional expressions
322 when N_Conditional_Expression =>
323 if (Present (Then_Actions (P))
324 and then Find_SCIL_Node (Actions (P)))
326 (Present (Else_Actions (P))
327 and then Find_SCIL_Node (Else_Actions (P)))
332 -- Actions in handled sequence of statements
335 N_Handled_Sequence_Of_Statements =>
336 if Find_SCIL_Node (Statements (P)) then
340 -- Conditions of while expression or elsif.
342 when N_Iteration_Scheme |
345 if Present (Condition_Actions (P))
346 and then Find_SCIL_Node (Condition_Actions (P))
351 -- Statements, declarations, pragmas, representation clauses
356 N_Procedure_Call_Statement |
357 N_Statement_Other_Than_Procedure_Call |
363 -- Representation_Clause
366 N_Attribute_Definition_Clause |
367 N_Enumeration_Representation_Clause |
368 N_Record_Representation_Clause |
372 N_Abstract_Subprogram_Declaration |
374 N_Exception_Declaration |
375 N_Exception_Renaming_Declaration |
376 N_Formal_Abstract_Subprogram_Declaration |
377 N_Formal_Concrete_Subprogram_Declaration |
378 N_Formal_Object_Declaration |
379 N_Formal_Type_Declaration |
380 N_Full_Type_Declaration |
381 N_Function_Instantiation |
382 N_Generic_Function_Renaming_Declaration |
383 N_Generic_Package_Declaration |
384 N_Generic_Package_Renaming_Declaration |
385 N_Generic_Procedure_Renaming_Declaration |
386 N_Generic_Subprogram_Declaration |
387 N_Implicit_Label_Declaration |
388 N_Incomplete_Type_Declaration |
389 N_Number_Declaration |
390 N_Object_Declaration |
391 N_Object_Renaming_Declaration |
393 N_Package_Body_Stub |
394 N_Package_Declaration |
395 N_Package_Instantiation |
396 N_Package_Renaming_Declaration |
397 N_Private_Extension_Declaration |
398 N_Private_Type_Declaration |
399 N_Procedure_Instantiation |
401 N_Protected_Body_Stub |
402 N_Protected_Type_Declaration |
403 N_Single_Task_Declaration |
405 N_Subprogram_Body_Stub |
406 N_Subprogram_Declaration |
407 N_Subprogram_Renaming_Declaration |
408 N_Subtype_Declaration |
411 N_Task_Type_Declaration |
413 -- Freeze entity behaves like a declaration or statement
417 -- Do not search here if the item is not a list member
419 if not Is_List_Member (P) then
422 -- Do not search if parent of P is an N_Component_Association
423 -- node (i.e. we are in the context of an N_Aggregate or
424 -- N_Extension_Aggregate node). In this case the node should
425 -- have been added before the entire aggregate.
427 elsif Nkind (Parent (P)) = N_Component_Association then
430 -- Do not search if the parent of P is either an N_Variant
431 -- node or an N_Record_Definition node. In this case the node
432 -- should have been added before the entire record.
434 elsif Nkind (Parent (P)) = N_Variant
435 or else Nkind (Parent (P)) = N_Record_Definition
439 -- Otherwise search it in the list containing this node
441 elsif Find_SCIL_Node (List_Containing (P)) then
445 -- A special case, N_Raise_xxx_Error can act either as a statement
446 -- or a subexpression. We diferentiate them by looking at the
447 -- Etype. It is set to Standard_Void_Type in the statement case.
451 if Etype (P) = Standard_Void_Type then
452 if Is_List_Member (P)
453 and then Find_SCIL_Node (List_Containing (P))
458 -- In the subexpression case, keep climbing
464 -- If a component association appears within a loop created for
465 -- an array aggregate, check if the SCIL node was added to the
466 -- the list of nodes attached to the association.
469 N_Component_Association =>
470 if Nkind (Parent (P)) = N_Aggregate
471 and then Present (Loop_Actions (P))
472 and then Find_SCIL_Node (Loop_Actions (P))
477 -- Another special case, an attribute denoting a procedure call
480 N_Attribute_Reference =>
481 if Is_Procedure_Attribute_Name (Attribute_Name (P))
482 and then Find_SCIL_Node (List_Containing (P))
486 -- In the subexpression case keep climbing
492 -- SCIL nodes do not have subtrees and hence they can never be
493 -- found climbing tree
496 N_SCIL_Dispatch_Table_Object_Init |
497 N_SCIL_Dispatch_Table_Tag_Init |
498 N_SCIL_Dispatching_Call |
499 N_SCIL_Membership_Test |
502 pragma Assert (False);
505 -- For all other node types, keep climbing tree
509 N_Accept_Alternative |
510 N_Access_Definition |
511 N_Access_Function_Definition |
512 N_Access_Procedure_Definition |
513 N_Access_To_Object_Definition |
516 N_Case_Statement_Alternative |
517 N_Character_Literal |
519 N_Compilation_Unit_Aux |
521 N_Component_Declaration |
522 N_Component_Definition |
524 N_Constrained_Array_Definition |
525 N_Decimal_Fixed_Point_Definition |
526 N_Defining_Character_Literal |
527 N_Defining_Identifier |
528 N_Defining_Operator_Symbol |
529 N_Defining_Program_Unit_Name |
530 N_Delay_Alternative |
532 N_Derived_Type_Definition |
534 N_Digits_Constraint |
535 N_Discriminant_Association |
536 N_Discriminant_Specification |
538 N_Entry_Body_Formal_Part |
539 N_Entry_Call_Alternative |
540 N_Entry_Declaration |
541 N_Entry_Index_Specification |
542 N_Enumeration_Type_Definition |
544 N_Exception_Handler |
546 N_Explicit_Dereference |
547 N_Expression_With_Actions |
548 N_Extension_Aggregate |
549 N_Floating_Point_Definition |
550 N_Formal_Decimal_Fixed_Point_Definition |
551 N_Formal_Derived_Type_Definition |
552 N_Formal_Discrete_Type_Definition |
553 N_Formal_Floating_Point_Definition |
554 N_Formal_Modular_Type_Definition |
555 N_Formal_Ordinary_Fixed_Point_Definition |
556 N_Formal_Package_Declaration |
557 N_Formal_Private_Type_Definition |
558 N_Formal_Signed_Integer_Type_Definition |
560 N_Function_Specification |
561 N_Generic_Association |
564 N_Index_Or_Discriminant_Constraint |
565 N_Indexed_Component |
569 N_Loop_Parameter_Specification |
571 N_Modular_Type_Definition |
597 N_Op_Shift_Right_Arithmetic |
601 N_Ordinary_Fixed_Point_Definition |
603 N_Package_Specification |
604 N_Parameter_Association |
605 N_Parameter_Specification |
606 N_Pop_Constraint_Error_Label |
607 N_Pop_Program_Error_Label |
608 N_Pop_Storage_Error_Label |
609 N_Pragma_Argument_Association |
610 N_Procedure_Specification |
611 N_Protected_Definition |
612 N_Push_Constraint_Error_Label |
613 N_Push_Program_Error_Label |
614 N_Push_Storage_Error_Label |
615 N_Qualified_Expression |
619 N_Real_Range_Specification |
620 N_Record_Definition |
622 N_Selected_Component |
623 N_Signed_Integer_Type_Definition |
624 N_Single_Protected_Declaration |
628 N_Subtype_Indication |
631 N_Terminate_Alternative |
632 N_Triggering_Alternative |
634 N_Unchecked_Expression |
635 N_Unchecked_Type_Conversion |
636 N_Unconstrained_Array_Definition |
639 N_Use_Package_Clause |
643 N_Validate_Unchecked_Conversion |
650 -- If we fall through above tests keep climbing tree
652 if Nkind (Parent (P)) = N_Subunit then
654 -- This is the proper body corresponding to a stub. Insertion done
655 -- at the point of the stub, which is in the declarative part of
658 P := Corresponding_Stub (Parent (P));
665 -- SCIL node not found
670 -------------------------
671 -- First_Non_SCIL_Node --
672 -------------------------
674 function First_Non_SCIL_Node (L : List_Id) return Node_Id is
679 while Nkind (N) in N_SCIL_Node loop
684 end First_Non_SCIL_Node;
686 ------------------------
687 -- Next_Non_SCIL_Node --
688 ------------------------
690 function Next_Non_SCIL_Node (N : Node_Id) return Node_Id is
695 while Nkind (Aux_N) in N_SCIL_Node loop
700 end Next_Non_SCIL_Node;