1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 1992-2006, 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 2, 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 COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- GNAT was originally developed by the GNAT team at New York University. --
23 -- Extensive contributions were provided by Ada Core Technologies Inc. --
25 ------------------------------------------------------------------------------
27 with Atree; use Atree;
28 with Einfo; use Einfo;
29 with Elists; use Elists;
31 with Namet; use Namet;
32 with Nlists; use Nlists;
33 with Nmake; use Nmake;
34 with Restrict; use Restrict;
35 with Rident; use Rident;
36 with Sinfo; use Sinfo;
37 with Snames; use Snames;
38 with Stand; use Stand;
39 with Stringt; use Stringt;
40 with Uintp; use Uintp;
42 package body Tbuild is
44 -----------------------
45 -- Local Subprograms --
46 -----------------------
48 procedure Add_Unique_Serial_Number;
49 -- Add a unique serialization to the string in the Name_Buffer. This
50 -- consists of a unit specific serial number, and b/s for body/spec.
52 ------------------------------
53 -- Add_Unique_Serial_Number --
54 ------------------------------
56 Config_Serial_Number : Nat := 0;
57 -- Counter for use in config pragmas, see comment below
59 procedure Add_Unique_Serial_Number is
61 -- If we are analyzing configuration pragmas, Cunit (Main_Unit) will
62 -- not be set yet. This happens for example when analyzing static
63 -- string expressions in configuration pragmas. For this case, we
64 -- just maintain a local counter, defined above and we do not need
65 -- to add a b or s indication in this case.
67 if No (Cunit (Current_Sem_Unit)) then
68 Config_Serial_Number := Config_Serial_Number + 1;
69 Add_Nat_To_Name_Buffer (Config_Serial_Number);
72 -- Normal case, within a unit
76 Unit_Node : constant Node_Id := Unit (Cunit (Current_Sem_Unit));
79 Add_Nat_To_Name_Buffer (Increment_Serial_Number);
81 -- Add either b or s, depending on whether current unit is a spec
82 -- or a body. This is needed because we may generate the same name
83 -- in a spec and a body otherwise.
85 Name_Len := Name_Len + 1;
87 if Nkind (Unit_Node) = N_Package_Declaration
88 or else Nkind (Unit_Node) = N_Subprogram_Declaration
89 or else Nkind (Unit_Node) in N_Generic_Declaration
91 Name_Buffer (Name_Len) := 's';
93 Name_Buffer (Name_Len) := 'b';
97 end Add_Unique_Serial_Number;
103 function Checks_Off (N : Node_Id) return Node_Id is
106 Make_Unchecked_Expression (Sloc (N),
114 function Convert_To (Typ : Entity_Id; Expr : Node_Id) return Node_Id is
118 if Present (Etype (Expr))
119 and then (Etype (Expr)) = Typ
121 return Relocate_Node (Expr);
124 Make_Type_Conversion (Sloc (Expr),
125 Subtype_Mark => New_Occurrence_Of (Typ, Sloc (Expr)),
126 Expression => Relocate_Node (Expr));
128 Set_Etype (Result, Typ);
137 procedure Discard_List (L : List_Id) is
138 pragma Warnings (Off, L);
147 procedure Discard_Node (N : Node_Or_Entity_Id) is
148 pragma Warnings (Off, N);
153 -------------------------------------------
154 -- Make_Byte_Aligned_Attribute_Reference --
155 -------------------------------------------
157 function Make_Byte_Aligned_Attribute_Reference
160 Attribute_Name : Name_Id)
163 N : constant Node_Id :=
164 Make_Attribute_Reference (Sloc,
166 Attribute_Name => Attribute_Name);
169 pragma Assert (Attribute_Name = Name_Address
171 Attribute_Name = Name_Unrestricted_Access);
172 Set_Must_Be_Byte_Aligned (N, True);
174 end Make_Byte_Aligned_Attribute_Reference;
180 function Make_DT_Access
183 Typ : Entity_Id) return Node_Id
185 Full_Type : Entity_Id := Typ;
188 if Is_Private_Type (Typ) then
189 Full_Type := Underlying_Type (Typ);
193 Unchecked_Convert_To (
195 (Etype (Node (First_Elmt (Access_Disp_Table (Full_Type)))), Loc),
196 Make_Selected_Component (Loc,
197 Prefix => New_Copy (Rec),
199 New_Reference_To (First_Tag_Component (Full_Type), Loc)));
202 -------------------------------------
203 -- Make_Implicit_Exception_Handler --
204 -------------------------------------
206 function Make_Implicit_Exception_Handler
208 Choice_Parameter : Node_Id := Empty;
209 Exception_Choices : List_Id;
210 Statements : List_Id) return Node_Id
212 Handler : constant Node_Id :=
213 Make_Exception_Handler
214 (Sloc, Choice_Parameter, Exception_Choices, Statements);
216 Set_Local_Raise_Statements (Handler, No_Elist);
218 end Make_Implicit_Exception_Handler;
220 --------------------------------
221 -- Make_Implicit_If_Statement --
222 --------------------------------
224 function Make_Implicit_If_Statement
227 Then_Statements : List_Id;
228 Elsif_Parts : List_Id := No_List;
229 Else_Statements : List_Id := No_List) return Node_Id
232 Check_Restriction (No_Implicit_Conditionals, Node);
234 return Make_If_Statement (Sloc (Node),
239 end Make_Implicit_If_Statement;
241 -------------------------------------
242 -- Make_Implicit_Label_Declaration --
243 -------------------------------------
245 function Make_Implicit_Label_Declaration
247 Defining_Identifier : Node_Id;
248 Label_Construct : Node_Id) return Node_Id
250 N : constant Node_Id :=
251 Make_Implicit_Label_Declaration (Loc, Defining_Identifier);
253 Set_Label_Construct (N, Label_Construct);
255 end Make_Implicit_Label_Declaration;
257 ----------------------------------
258 -- Make_Implicit_Loop_Statement --
259 ----------------------------------
261 function Make_Implicit_Loop_Statement
263 Statements : List_Id;
264 Identifier : Node_Id := Empty;
265 Iteration_Scheme : Node_Id := Empty;
266 Has_Created_Identifier : Boolean := False;
267 End_Label : Node_Id := Empty) return Node_Id
270 Check_Restriction (No_Implicit_Loops, Node);
272 if Present (Iteration_Scheme)
273 and then Present (Condition (Iteration_Scheme))
275 Check_Restriction (No_Implicit_Conditionals, Node);
278 return Make_Loop_Statement (Sloc (Node),
279 Identifier => Identifier,
280 Iteration_Scheme => Iteration_Scheme,
281 Statements => Statements,
282 Has_Created_Identifier => Has_Created_Identifier,
283 End_Label => End_Label);
284 end Make_Implicit_Loop_Statement;
286 --------------------------
287 -- Make_Integer_Literal --
288 ---------------------------
290 function Make_Integer_Literal
292 Intval : Int) return Node_Id
295 return Make_Integer_Literal (Loc, UI_From_Int (Intval));
296 end Make_Integer_Literal;
298 --------------------------------
299 -- Make_Linker_Section_Pragma --
300 --------------------------------
302 function Make_Linker_Section_Pragma
305 Sec : String) return Node_Id
315 (Make_Pragma_Argument_Association
317 Expression => New_Occurrence_Of (Ent, Loc)),
318 Make_Pragma_Argument_Association
325 Set_Has_Gigi_Rep_Item (Ent);
327 end Make_Linker_Section_Pragma;
329 ---------------------------------
330 -- Make_Raise_Constraint_Error --
331 ---------------------------------
333 function Make_Raise_Constraint_Error
335 Condition : Node_Id := Empty;
336 Reason : RT_Exception_Code) return Node_Id
339 pragma Assert (Reason in RT_CE_Exceptions);
341 Make_Raise_Constraint_Error (Sloc,
342 Condition => Condition,
344 UI_From_Int (RT_Exception_Code'Pos (Reason)));
345 end Make_Raise_Constraint_Error;
347 ------------------------------
348 -- Make_Raise_Program_Error --
349 ------------------------------
351 function Make_Raise_Program_Error
353 Condition : Node_Id := Empty;
354 Reason : RT_Exception_Code) return Node_Id
357 pragma Assert (Reason in RT_PE_Exceptions);
359 Make_Raise_Program_Error (Sloc,
360 Condition => Condition,
362 UI_From_Int (RT_Exception_Code'Pos (Reason)));
363 end Make_Raise_Program_Error;
365 ------------------------------
366 -- Make_Raise_Storage_Error --
367 ------------------------------
369 function Make_Raise_Storage_Error
371 Condition : Node_Id := Empty;
372 Reason : RT_Exception_Code) return Node_Id
375 pragma Assert (Reason in RT_SE_Exceptions);
377 Make_Raise_Storage_Error (Sloc,
378 Condition => Condition,
380 UI_From_Int (RT_Exception_Code'Pos (Reason)));
381 end Make_Raise_Storage_Error;
383 -------------------------
384 -- Make_String_Literal --
385 -------------------------
387 function Make_String_Literal
389 Strval : String) return Node_Id
393 Store_String_Chars (Strval);
395 Make_String_Literal (Sloc,
396 Strval => End_String);
397 end Make_String_Literal;
399 ---------------------------
400 -- Make_Unsuppress_Block --
401 ---------------------------
403 -- Generates the following expansion:
406 -- pragma Suppress (<check>);
411 function Make_Unsuppress_Block
414 Stmts : List_Id) return Node_Id
418 Make_Block_Statement (Loc,
419 Declarations => New_List (
421 Chars => Name_Suppress,
422 Pragma_Argument_Associations => New_List (
423 Make_Pragma_Argument_Association (Loc,
424 Expression => Make_Identifier (Loc, Check))))),
426 Handled_Statement_Sequence =>
427 Make_Handled_Sequence_Of_Statements (Loc,
428 Statements => Stmts));
429 end Make_Unsuppress_Block;
431 --------------------------
432 -- New_Constraint_Error --
433 --------------------------
435 function New_Constraint_Error (Loc : Source_Ptr) return Node_Id is
436 Ident_Node : Node_Id;
437 Raise_Node : Node_Id;
440 Ident_Node := New_Node (N_Identifier, Loc);
441 Set_Chars (Ident_Node, Chars (Standard_Entity (S_Constraint_Error)));
442 Set_Entity (Ident_Node, Standard_Entity (S_Constraint_Error));
443 Raise_Node := New_Node (N_Raise_Statement, Loc);
444 Set_Name (Raise_Node, Ident_Node);
446 end New_Constraint_Error;
448 -----------------------
449 -- New_External_Name --
450 -----------------------
452 function New_External_Name
453 (Related_Id : Name_Id;
454 Suffix : Character := ' ';
455 Suffix_Index : Int := 0;
456 Prefix : Character := ' ') return Name_Id
459 Get_Name_String (Related_Id);
461 if Prefix /= ' ' then
462 pragma Assert (Is_OK_Internal_Letter (Prefix));
464 for J in reverse 1 .. Name_Len loop
465 Name_Buffer (J + 1) := Name_Buffer (J);
468 Name_Len := Name_Len + 1;
469 Name_Buffer (1) := Prefix;
472 if Suffix /= ' ' then
473 pragma Assert (Is_OK_Internal_Letter (Suffix));
474 Name_Len := Name_Len + 1;
475 Name_Buffer (Name_Len) := Suffix;
478 if Suffix_Index /= 0 then
479 if Suffix_Index < 0 then
480 Add_Unique_Serial_Number;
482 Add_Nat_To_Name_Buffer (Suffix_Index);
487 end New_External_Name;
489 function New_External_Name
490 (Related_Id : Name_Id;
492 Suffix_Index : Int := 0;
493 Prefix : Character := ' ') return Name_Id
496 Get_Name_String (Related_Id);
498 if Prefix /= ' ' then
499 pragma Assert (Is_OK_Internal_Letter (Prefix));
501 for J in reverse 1 .. Name_Len loop
502 Name_Buffer (J + 1) := Name_Buffer (J);
505 Name_Len := Name_Len + 1;
506 Name_Buffer (1) := Prefix;
510 Name_Buffer (Name_Len + 1 .. Name_Len + Suffix'Length) := Suffix;
511 Name_Len := Name_Len + Suffix'Length;
514 if Suffix_Index /= 0 then
515 if Suffix_Index < 0 then
516 Add_Unique_Serial_Number;
518 Add_Nat_To_Name_Buffer (Suffix_Index);
523 end New_External_Name;
525 function New_External_Name
527 Suffix_Index : Nat) return Name_Id
530 Name_Buffer (1) := Suffix;
532 Add_Nat_To_Name_Buffer (Suffix_Index);
534 end New_External_Name;
536 -----------------------
537 -- New_Internal_Name --
538 -----------------------
540 function New_Internal_Name (Id_Char : Character) return Name_Id is
542 pragma Assert (Is_OK_Internal_Letter (Id_Char));
543 Name_Buffer (1) := Id_Char;
545 Add_Unique_Serial_Number;
547 end New_Internal_Name;
549 -----------------------
550 -- New_Occurrence_Of --
551 -----------------------
553 function New_Occurrence_Of
555 Loc : Source_Ptr) return Node_Id
557 Occurrence : Node_Id;
560 Occurrence := New_Node (N_Identifier, Loc);
561 Set_Chars (Occurrence, Chars (Def_Id));
562 Set_Entity (Occurrence, Def_Id);
564 if Is_Type (Def_Id) then
565 Set_Etype (Occurrence, Def_Id);
567 Set_Etype (Occurrence, Etype (Def_Id));
571 end New_Occurrence_Of;
573 ----------------------
574 -- New_Reference_To --
575 ----------------------
577 function New_Reference_To
579 Loc : Source_Ptr) return Node_Id
581 Occurrence : Node_Id;
584 Occurrence := New_Node (N_Identifier, Loc);
585 Set_Chars (Occurrence, Chars (Def_Id));
586 Set_Entity (Occurrence, Def_Id);
588 end New_Reference_To;
590 -----------------------
591 -- New_Suffixed_Name --
592 -----------------------
594 function New_Suffixed_Name
595 (Related_Id : Name_Id;
596 Suffix : String) return Name_Id
599 Get_Name_String (Related_Id);
600 Name_Len := Name_Len + 1;
601 Name_Buffer (Name_Len) := '_';
602 Name_Buffer (Name_Len + 1 .. Name_Len + Suffix'Length) := Suffix;
603 Name_Len := Name_Len + Suffix'Length;
605 end New_Suffixed_Name;
611 function OK_Convert_To (Typ : Entity_Id; Expr : Node_Id) return Node_Id is
615 Make_Type_Conversion (Sloc (Expr),
616 Subtype_Mark => New_Occurrence_Of (Typ, Sloc (Expr)),
617 Expression => Relocate_Node (Expr));
618 Set_Conversion_OK (Result, True);
619 Set_Etype (Result, Typ);
623 --------------------------
624 -- Unchecked_Convert_To --
625 --------------------------
627 function Unchecked_Convert_To
629 Expr : Node_Id) return Node_Id
631 Loc : constant Source_Ptr := Sloc (Expr);
635 -- If the expression is already of the correct type, then nothing
636 -- to do, except for relocating the node in case this is required.
638 if Present (Etype (Expr))
639 and then (Base_Type (Etype (Expr)) = Typ
640 or else Etype (Expr) = Typ)
642 return Relocate_Node (Expr);
644 -- Cases where the inner expression is itself an unchecked conversion
645 -- to the same type, and we can thus eliminate the outer conversion.
647 elsif Nkind (Expr) = N_Unchecked_Type_Conversion
648 and then Entity (Subtype_Mark (Expr)) = Typ
650 Result := Relocate_Node (Expr);
652 elsif Nkind (Expr) = N_Null
653 and then Is_Access_Type (Typ)
655 -- No need for a conversion
657 Result := Relocate_Node (Expr);
663 Make_Unchecked_Type_Conversion (Loc,
664 Subtype_Mark => New_Occurrence_Of (Typ, Loc),
665 Expression => Relocate_Node (Expr));
668 Set_Etype (Result, Typ);
670 end Unchecked_Convert_To;