1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2010, 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 Einfo
; use Einfo
;
28 with Elists
; use Elists
;
30 with Nlists
; use Nlists
;
31 with Nmake
; use Nmake
;
33 with Restrict
; use Restrict
;
34 with Rident
; use Rident
;
35 with Sem_Aux
; use Sem_Aux
;
36 with Snames
; use Snames
;
37 with Stand
; use Stand
;
38 with Stringt
; use Stringt
;
39 with Urealp
; use Urealp
;
41 package body Tbuild
is
43 -----------------------
44 -- Local Subprograms --
45 -----------------------
47 procedure Add_Unique_Serial_Number
;
48 -- Add a unique serialization to the string in the Name_Buffer. This
49 -- consists of a unit specific serial number, and b/s for body/spec.
51 ------------------------------
52 -- Add_Unique_Serial_Number --
53 ------------------------------
55 Config_Serial_Number
: Nat
:= 0;
56 -- Counter for use in config pragmas, see comment below
58 procedure Add_Unique_Serial_Number
is
60 -- If we are analyzing configuration pragmas, Cunit (Main_Unit) will
61 -- not be set yet. This happens for example when analyzing static
62 -- string expressions in configuration pragmas. For this case, we
63 -- just maintain a local counter, defined above and we do not need
64 -- to add a b or s indication in this case.
66 if No
(Cunit
(Current_Sem_Unit
)) then
67 Config_Serial_Number
:= Config_Serial_Number
+ 1;
68 Add_Nat_To_Name_Buffer
(Config_Serial_Number
);
71 -- Normal case, within a unit
75 Unit_Node
: constant Node_Id
:= Unit
(Cunit
(Current_Sem_Unit
));
78 Add_Nat_To_Name_Buffer
(Increment_Serial_Number
);
80 -- Add either b or s, depending on whether current unit is a spec
81 -- or a body. This is needed because we may generate the same name
82 -- in a spec and a body otherwise.
84 Name_Len
:= Name_Len
+ 1;
86 if Nkind
(Unit_Node
) = N_Package_Declaration
87 or else Nkind
(Unit_Node
) = N_Subprogram_Declaration
88 or else Nkind
(Unit_Node
) in N_Generic_Declaration
90 Name_Buffer
(Name_Len
) := 's';
92 Name_Buffer
(Name_Len
) := 'b';
96 end Add_Unique_Serial_Number
;
102 function Checks_Off
(N
: Node_Id
) return Node_Id
is
105 Make_Unchecked_Expression
(Sloc
(N
),
113 function Convert_To
(Typ
: Entity_Id
; Expr
: Node_Id
) return Node_Id
is
117 if Present
(Etype
(Expr
))
118 and then (Etype
(Expr
)) = Typ
120 return Relocate_Node
(Expr
);
123 Make_Type_Conversion
(Sloc
(Expr
),
124 Subtype_Mark
=> New_Occurrence_Of
(Typ
, Sloc
(Expr
)),
125 Expression
=> Relocate_Node
(Expr
));
127 Set_Etype
(Result
, Typ
);
136 procedure Discard_List
(L
: List_Id
) is
137 pragma Warnings
(Off
, L
);
146 procedure Discard_Node
(N
: Node_Or_Entity_Id
) is
147 pragma Warnings
(Off
, N
);
152 -------------------------------------------
153 -- Make_Byte_Aligned_Attribute_Reference --
154 -------------------------------------------
156 function Make_Byte_Aligned_Attribute_Reference
159 Attribute_Name
: Name_Id
)
162 N
: constant Node_Id
:=
163 Make_Attribute_Reference
(Sloc
,
165 Attribute_Name
=> Attribute_Name
);
168 pragma Assert
(Attribute_Name
= Name_Address
170 Attribute_Name
= Name_Unrestricted_Access
);
171 Set_Must_Be_Byte_Aligned
(N
, True);
173 end Make_Byte_Aligned_Attribute_Reference
;
179 function Make_DT_Access
182 Typ
: Entity_Id
) return Node_Id
184 Full_Type
: Entity_Id
:= Typ
;
187 if Is_Private_Type
(Typ
) then
188 Full_Type
:= Underlying_Type
(Typ
);
192 Unchecked_Convert_To
(
194 (Etype
(Node
(First_Elmt
(Access_Disp_Table
(Full_Type
)))), Loc
),
195 Make_Selected_Component
(Loc
,
196 Prefix
=> New_Copy
(Rec
),
198 New_Reference_To
(First_Tag_Component
(Full_Type
), Loc
)));
201 ------------------------
202 -- Make_Float_Literal --
203 ------------------------
205 function Make_Float_Literal
209 Exponent
: Uint
) return Node_Id
212 if Radix
= 2 and then abs Significand
/= 1 then
216 Significand
* Radix
**(Exponent
mod 4),
221 N
: constant Node_Id
:= New_Node
(N_Real_Literal
, Loc
);
226 (Num
=> abs Significand
,
228 Rbase
=> UI_To_Int
(Radix
),
229 Negative
=> Significand
< 0));
233 end Make_Float_Literal
;
235 -------------------------------------
236 -- Make_Implicit_Exception_Handler --
237 -------------------------------------
239 function Make_Implicit_Exception_Handler
241 Choice_Parameter
: Node_Id
:= Empty
;
242 Exception_Choices
: List_Id
;
243 Statements
: List_Id
) return Node_Id
249 -- Set the source location only when debugging the expanded code
251 -- When debugging the source code directly, we do not want the compiler
252 -- to associate this implicit exception handler with any specific source
253 -- line, because it can potentially confuse the debugger. The most
254 -- damaging situation would arise when the debugger tries to insert a
255 -- breakpoint at a certain line. If the code of the associated implicit
256 -- exception handler is generated before the code of that line, then the
257 -- debugger will end up inserting the breakpoint inside the exception
258 -- handler, rather than the code the user intended to break on. As a
259 -- result, it is likely that the program will not hit the breakpoint
262 if Debug_Generated_Code
then
269 Make_Exception_Handler
270 (Loc
, Choice_Parameter
, Exception_Choices
, Statements
);
271 Set_Local_Raise_Statements
(Handler
, No_Elist
);
273 end Make_Implicit_Exception_Handler
;
275 --------------------------------
276 -- Make_Implicit_If_Statement --
277 --------------------------------
279 function Make_Implicit_If_Statement
282 Then_Statements
: List_Id
;
283 Elsif_Parts
: List_Id
:= No_List
;
284 Else_Statements
: List_Id
:= No_List
) return Node_Id
287 Check_Restriction
(No_Implicit_Conditionals
, Node
);
289 return Make_If_Statement
(Sloc
(Node
),
294 end Make_Implicit_If_Statement
;
296 -------------------------------------
297 -- Make_Implicit_Label_Declaration --
298 -------------------------------------
300 function Make_Implicit_Label_Declaration
302 Defining_Identifier
: Node_Id
;
303 Label_Construct
: Node_Id
) return Node_Id
305 N
: constant Node_Id
:=
306 Make_Implicit_Label_Declaration
(Loc
, Defining_Identifier
);
308 Set_Label_Construct
(N
, Label_Construct
);
310 end Make_Implicit_Label_Declaration
;
312 ----------------------------------
313 -- Make_Implicit_Loop_Statement --
314 ----------------------------------
316 function Make_Implicit_Loop_Statement
318 Statements
: List_Id
;
319 Identifier
: Node_Id
:= Empty
;
320 Iteration_Scheme
: Node_Id
:= Empty
;
321 Has_Created_Identifier
: Boolean := False;
322 End_Label
: Node_Id
:= Empty
) return Node_Id
325 Check_Restriction
(No_Implicit_Loops
, Node
);
327 if Present
(Iteration_Scheme
)
328 and then Present
(Condition
(Iteration_Scheme
))
330 Check_Restriction
(No_Implicit_Conditionals
, Node
);
333 return Make_Loop_Statement
(Sloc
(Node
),
334 Identifier
=> Identifier
,
335 Iteration_Scheme
=> Iteration_Scheme
,
336 Statements
=> Statements
,
337 Has_Created_Identifier
=> Has_Created_Identifier
,
338 End_Label
=> End_Label
);
339 end Make_Implicit_Loop_Statement
;
341 --------------------------
342 -- Make_Integer_Literal --
343 ---------------------------
345 function Make_Integer_Literal
347 Intval
: Int
) return Node_Id
350 return Make_Integer_Literal
(Loc
, UI_From_Int
(Intval
));
351 end Make_Integer_Literal
;
353 --------------------------------
354 -- Make_Linker_Section_Pragma --
355 --------------------------------
357 function Make_Linker_Section_Pragma
360 Sec
: String) return Node_Id
370 (Make_Pragma_Argument_Association
372 Expression
=> New_Occurrence_Of
(Ent
, Loc
)),
373 Make_Pragma_Argument_Association
380 Set_Has_Gigi_Rep_Item
(Ent
);
382 end Make_Linker_Section_Pragma
;
391 Pragma_Argument_Associations
: List_Id
:= No_List
;
392 Debug_Statement
: Node_Id
:= Empty
) return Node_Id
397 Pragma_Argument_Associations
=> Pragma_Argument_Associations
,
398 Debug_Statement
=> Debug_Statement
,
399 Pragma_Identifier
=> Make_Identifier
(Sloc
, Chars
));
402 ---------------------------------
403 -- Make_Raise_Constraint_Error --
404 ---------------------------------
406 function Make_Raise_Constraint_Error
408 Condition
: Node_Id
:= Empty
;
409 Reason
: RT_Exception_Code
) return Node_Id
412 pragma Assert
(Reason
in RT_CE_Exceptions
);
414 Make_Raise_Constraint_Error
(Sloc
,
415 Condition
=> Condition
,
417 UI_From_Int
(RT_Exception_Code
'Pos (Reason
)));
418 end Make_Raise_Constraint_Error
;
420 ------------------------------
421 -- Make_Raise_Program_Error --
422 ------------------------------
424 function Make_Raise_Program_Error
426 Condition
: Node_Id
:= Empty
;
427 Reason
: RT_Exception_Code
) return Node_Id
430 pragma Assert
(Reason
in RT_PE_Exceptions
);
432 Make_Raise_Program_Error
(Sloc
,
433 Condition
=> Condition
,
435 UI_From_Int
(RT_Exception_Code
'Pos (Reason
)));
436 end Make_Raise_Program_Error
;
438 ------------------------------
439 -- Make_Raise_Storage_Error --
440 ------------------------------
442 function Make_Raise_Storage_Error
444 Condition
: Node_Id
:= Empty
;
445 Reason
: RT_Exception_Code
) return Node_Id
448 pragma Assert
(Reason
in RT_SE_Exceptions
);
450 Make_Raise_Storage_Error
(Sloc
,
451 Condition
=> Condition
,
453 UI_From_Int
(RT_Exception_Code
'Pos (Reason
)));
454 end Make_Raise_Storage_Error
;
456 -------------------------
457 -- Make_String_Literal --
458 -------------------------
460 function Make_String_Literal
462 Strval
: String) return Node_Id
466 Store_String_Chars
(Strval
);
468 Make_String_Literal
(Sloc
,
469 Strval
=> End_String
);
470 end Make_String_Literal
;
476 function Make_Temporary
479 Related_Node
: Node_Id
:= Empty
) return Entity_Id
481 Temp
: constant Entity_Id
:=
482 Make_Defining_Identifier
(Loc
,
483 Chars
=> New_Internal_Name
(Id
));
485 Set_Related_Expression
(Temp
, Related_Node
);
489 ---------------------------
490 -- Make_Unsuppress_Block --
491 ---------------------------
493 -- Generates the following expansion:
496 -- pragma Suppress (<check>);
501 function Make_Unsuppress_Block
504 Stmts
: List_Id
) return Node_Id
508 Make_Block_Statement
(Loc
,
509 Declarations
=> New_List
(
511 Chars
=> Name_Suppress
,
512 Pragma_Argument_Associations
=> New_List
(
513 Make_Pragma_Argument_Association
(Loc
,
514 Expression
=> Make_Identifier
(Loc
, Check
))))),
516 Handled_Statement_Sequence
=>
517 Make_Handled_Sequence_Of_Statements
(Loc
,
518 Statements
=> Stmts
));
519 end Make_Unsuppress_Block
;
521 --------------------------
522 -- New_Constraint_Error --
523 --------------------------
525 function New_Constraint_Error
(Loc
: Source_Ptr
) return Node_Id
is
526 Ident_Node
: Node_Id
;
527 Raise_Node
: Node_Id
;
530 Ident_Node
:= New_Node
(N_Identifier
, Loc
);
531 Set_Chars
(Ident_Node
, Chars
(Standard_Entity
(S_Constraint_Error
)));
532 Set_Entity
(Ident_Node
, Standard_Entity
(S_Constraint_Error
));
533 Raise_Node
:= New_Node
(N_Raise_Statement
, Loc
);
534 Set_Name
(Raise_Node
, Ident_Node
);
536 end New_Constraint_Error
;
538 -----------------------
539 -- New_External_Name --
540 -----------------------
542 function New_External_Name
543 (Related_Id
: Name_Id
;
544 Suffix
: Character := ' ';
545 Suffix_Index
: Int
:= 0;
546 Prefix
: Character := ' ') return Name_Id
549 Get_Name_String
(Related_Id
);
551 if Prefix
/= ' ' then
552 pragma Assert
(Is_OK_Internal_Letter
(Prefix
) or else Prefix
= '_');
554 for J
in reverse 1 .. Name_Len
loop
555 Name_Buffer
(J
+ 1) := Name_Buffer
(J
);
558 Name_Len
:= Name_Len
+ 1;
559 Name_Buffer
(1) := Prefix
;
562 if Suffix
/= ' ' then
563 pragma Assert
(Is_OK_Internal_Letter
(Suffix
));
564 Add_Char_To_Name_Buffer
(Suffix
);
567 if Suffix_Index
/= 0 then
568 if Suffix_Index
< 0 then
569 Add_Unique_Serial_Number
;
571 Add_Nat_To_Name_Buffer
(Suffix_Index
);
576 end New_External_Name
;
578 function New_External_Name
579 (Related_Id
: Name_Id
;
581 Suffix_Index
: Int
:= 0;
582 Prefix
: Character := ' ') return Name_Id
585 Get_Name_String
(Related_Id
);
587 if Prefix
/= ' ' then
588 pragma Assert
(Is_OK_Internal_Letter
(Prefix
));
590 for J
in reverse 1 .. Name_Len
loop
591 Name_Buffer
(J
+ 1) := Name_Buffer
(J
);
594 Name_Len
:= Name_Len
+ 1;
595 Name_Buffer
(1) := Prefix
;
599 Name_Buffer
(Name_Len
+ 1 .. Name_Len
+ Suffix
'Length) := Suffix
;
600 Name_Len
:= Name_Len
+ Suffix
'Length;
603 if Suffix_Index
/= 0 then
604 if Suffix_Index
< 0 then
605 Add_Unique_Serial_Number
;
607 Add_Nat_To_Name_Buffer
(Suffix_Index
);
612 end New_External_Name
;
614 function New_External_Name
616 Suffix_Index
: Nat
) return Name_Id
619 Name_Buffer
(1) := Suffix
;
621 Add_Nat_To_Name_Buffer
(Suffix_Index
);
623 end New_External_Name
;
625 -----------------------
626 -- New_Internal_Name --
627 -----------------------
629 function New_Internal_Name
(Id_Char
: Character) return Name_Id
is
631 pragma Assert
(Is_OK_Internal_Letter
(Id_Char
));
632 Name_Buffer
(1) := Id_Char
;
634 Add_Unique_Serial_Number
;
636 end New_Internal_Name
;
638 -----------------------
639 -- New_Occurrence_Of --
640 -----------------------
642 function New_Occurrence_Of
644 Loc
: Source_Ptr
) return Node_Id
646 Occurrence
: Node_Id
;
649 Occurrence
:= New_Node
(N_Identifier
, Loc
);
650 Set_Chars
(Occurrence
, Chars
(Def_Id
));
651 Set_Entity
(Occurrence
, Def_Id
);
653 if Is_Type
(Def_Id
) then
654 Set_Etype
(Occurrence
, Def_Id
);
656 Set_Etype
(Occurrence
, Etype
(Def_Id
));
660 end New_Occurrence_Of
;
667 (New_Node_Kind
: Node_Kind
;
668 New_Sloc
: Source_Ptr
) return Node_Id
670 type Name_Of_Type
is array (N_Op
) of Name_Id
;
671 Name_Of
: constant Name_Of_Type
:= Name_Of_Type
'(
672 N_Op_And => Name_Op_And,
673 N_Op_Or => Name_Op_Or,
674 N_Op_Xor => Name_Op_Xor,
675 N_Op_Eq => Name_Op_Eq,
676 N_Op_Ne => Name_Op_Ne,
677 N_Op_Lt => Name_Op_Lt,
678 N_Op_Le => Name_Op_Le,
679 N_Op_Gt => Name_Op_Gt,
680 N_Op_Ge => Name_Op_Ge,
681 N_Op_Add => Name_Op_Add,
682 N_Op_Subtract => Name_Op_Subtract,
683 N_Op_Concat => Name_Op_Concat,
684 N_Op_Multiply => Name_Op_Multiply,
685 N_Op_Divide => Name_Op_Divide,
686 N_Op_Mod => Name_Op_Mod,
687 N_Op_Rem => Name_Op_Rem,
688 N_Op_Expon => Name_Op_Expon,
689 N_Op_Plus => Name_Op_Add,
690 N_Op_Minus => Name_Op_Subtract,
691 N_Op_Abs => Name_Op_Abs,
692 N_Op_Not => Name_Op_Not,
694 -- We don't really need these shift operators, since they never
695 -- appear as operators in the source, but the path of least
696 -- resistance is to put them in (the aggregate must be complete).
698 N_Op_Rotate_Left => Name_Rotate_Left,
699 N_Op_Rotate_Right => Name_Rotate_Right,
700 N_Op_Shift_Left => Name_Shift_Left,
701 N_Op_Shift_Right => Name_Shift_Right,
702 N_Op_Shift_Right_Arithmetic => Name_Shift_Right_Arithmetic);
704 Nod : constant Node_Id := New_Node (New_Node_Kind, New_Sloc);
707 if New_Node_Kind in Name_Of'Range then
708 Set_Chars (Nod, Name_Of (New_Node_Kind));
714 ----------------------
715 -- New_Reference_To --
716 ----------------------
718 function New_Reference_To
720 Loc : Source_Ptr) return Node_Id
722 Occurrence : Node_Id;
724 Occurrence := New_Node (N_Identifier, Loc);
725 Set_Chars (Occurrence, Chars (Def_Id));
726 Set_Entity (Occurrence, Def_Id);
728 end New_Reference_To;
730 -----------------------
731 -- New_Suffixed_Name --
732 -----------------------
734 function New_Suffixed_Name
735 (Related_Id : Name_Id;
736 Suffix : String) return Name_Id
739 Get_Name_String (Related_Id);
740 Add_Char_To_Name_Buffer ('_
');
741 Add_Str_To_Name_Buffer (Suffix);
743 end New_Suffixed_Name;
749 function OK_Convert_To (Typ : Entity_Id; Expr : Node_Id) return Node_Id is
753 Make_Type_Conversion (Sloc (Expr),
754 Subtype_Mark => New_Occurrence_Of (Typ, Sloc (Expr)),
755 Expression => Relocate_Node (Expr));
756 Set_Conversion_OK (Result, True);
757 Set_Etype (Result, Typ);
761 --------------------------
762 -- Unchecked_Convert_To --
763 --------------------------
765 function Unchecked_Convert_To
767 Expr : Node_Id) return Node_Id
769 Loc : constant Source_Ptr := Sloc (Expr);
773 -- If the expression is already of the correct type, then nothing
774 -- to do, except for relocating the node in case this is required.
776 if Present (Etype (Expr))
777 and then (Base_Type (Etype (Expr)) = Typ
778 or else Etype (Expr) = Typ)
780 return Relocate_Node (Expr);
782 -- Cases where the inner expression is itself an unchecked conversion
783 -- to the same type, and we can thus eliminate the outer conversion.
785 elsif Nkind (Expr) = N_Unchecked_Type_Conversion
786 and then Entity (Subtype_Mark (Expr)) = Typ
788 Result := Relocate_Node (Expr);
790 elsif Nkind (Expr) = N_Null
791 and then Is_Access_Type (Typ)
793 -- No need for a conversion
795 Result := Relocate_Node (Expr);
801 Make_Unchecked_Type_Conversion (Loc,
802 Subtype_Mark => New_Occurrence_Of (Typ, Loc),
803 Expression => Relocate_Node (Expr));
806 Set_Etype (Result, Typ);
808 end Unchecked_Convert_To;