1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
9 -- Copyright (C) 2004-2008, 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 ------------------------------------------------------------------------------
27 with Osint; use Osint;
28 with Output; use Output;
31 with Snames; use Snames;
34 with Ada.Command_Line; use Ada.Command_Line;
36 with GNAT.Directory_Operations; use GNAT.Directory_Operations;
38 with System.Case_Util; use System.Case_Util;
41 package body Makeutl is
43 type Mark_Key is record
44 File : File_Name_Type;
47 -- Identify either a mono-unit source (when Index = 0) or a specific unit
48 -- (index = 1's origin index of unit) in a multi-unit source.
50 -- There follow many global undocumented declarations, comments needed ???
52 Max_Mask_Num : constant := 2048;
54 subtype Mark_Num is Union_Id range 0 .. Max_Mask_Num - 1;
56 function Hash (Key : Mark_Key) return Mark_Num;
58 package Marks is new System.HTable.Simple_HTable
59 (Header_Num => Mark_Num,
65 -- A hash table to keep tracks of the marked units
67 type Linker_Options_Data is record
69 Options : String_List_Id;
72 Linker_Option_Initial_Count : constant := 20;
74 Linker_Options_Buffer : String_List_Access :=
75 new String_List (1 .. Linker_Option_Initial_Count);
77 Last_Linker_Option : Natural := 0;
79 package Linker_Opts is new Table.Table (
80 Table_Component_Type => Linker_Options_Data,
81 Table_Index_Type => Integer,
84 Table_Increment => 100,
85 Table_Name => "Make.Linker_Opts");
87 procedure Add_Linker_Option (Option : String);
94 (Option : String_Access;
95 To : in out String_List_Access;
96 Last : in out Natural)
99 if Last = To'Last then
101 New_Options : constant String_List_Access :=
102 new String_List (1 .. To'Last * 2);
104 New_Options (To'Range) := To.all;
106 -- Set all elements of the original options to null to avoid
107 -- deallocation of copies.
109 To.all := (others => null);
122 To : in out String_List_Access;
123 Last : in out Natural)
126 Add (Option => new String'(Option), To => To, Last => Last);
129 -----------------------
130 -- Add_Linker_Option --
131 -----------------------
133 procedure Add_Linker_Option (Option : String) is
135 if Option'Length > 0 then
136 if Last_Linker_Option = Linker_Options_Buffer'Last then
138 New_Buffer : constant String_List_Access :=
140 (1 .. Linker_Options_Buffer'Last +
141 Linker_Option_Initial_Count);
143 New_Buffer (Linker_Options_Buffer'Range) :=
144 Linker_Options_Buffer.all;
145 Linker_Options_Buffer.all := (others => null);
146 Free (Linker_Options_Buffer);
147 Linker_Options_Buffer := New_Buffer;
151 Last_Linker_Option := Last_Linker_Option + 1;
152 Linker_Options_Buffer (Last_Linker_Option) := new String'(Option);
154 end Add_Linker_Option;
160 function Create_Name (Name : String) return File_Name_Type is
163 Add_Str_To_Name_Buffer (Name);
167 function Create_Name (Name : String) return Name_Id is
170 Add_Str_To_Name_Buffer (Name);
174 function Create_Name (Name : String) return Path_Name_Type is
177 Add_Str_To_Name_Buffer (Name);
181 ----------------------
182 -- Delete_All_Marks --
183 ----------------------
185 procedure Delete_All_Marks is
188 end Delete_All_Marks;
190 ----------------------------
191 -- Executable_Prefix_Path --
192 ----------------------------
194 function Executable_Prefix_Path return String is
195 Exec_Name : constant String := Command_Name;
197 function Get_Install_Dir (S : String) return String;
198 -- S is the executable name preceded by the absolute or relative
199 -- path, e.g. "c:\usr\bin\gcc.exe". Returns the absolute directory
200 -- where "bin" lies (in the example "C:\usr").
201 -- If the executable is not in a "bin" directory, return "".
203 ---------------------
204 -- Get_Install_Dir --
205 ---------------------
207 function Get_Install_Dir (S : String) return String is
209 Path_Last : Integer := 0;
212 for J in reverse Exec'Range loop
213 if Exec (J) = Directory_Separator then
219 if Path_Last >= Exec'First + 2 then
220 To_Lower (Exec (Path_Last - 2 .. Path_Last));
223 if Path_Last < Exec'First + 2
224 or else Exec (Path_Last - 2 .. Path_Last) /= "bin"
225 or else (Path_Last - 3 >= Exec'First
226 and then Exec (Path_Last - 3) /= Directory_Separator)
231 return Normalize_Pathname (Exec (Exec'First .. Path_Last - 4));
234 -- Beginning of Executable_Prefix_Path
237 -- First determine if a path prefix was placed in front of the
240 for J in reverse Exec_Name'Range loop
241 if Exec_Name (J) = Directory_Separator then
242 return Get_Install_Dir (Exec_Name);
246 -- If we get here, the user has typed the executable name with no
249 return Get_Install_Dir (Locate_Exec_On_Path (Exec_Name).all);
250 end Executable_Prefix_Path;
256 function Hash (Key : Mark_Key) return Mark_Num is
258 return Union_Id (Key.File) mod Max_Mask_Num;
265 procedure Inform (N : File_Name_Type; Msg : String) is
267 Inform (Name_Id (N), Msg);
270 procedure Inform (N : Name_Id := No_Name; Msg : String) is
272 Osint.Write_Program_Name;
280 Name : constant String := Get_Name_String (N);
282 if Debug.Debug_Flag_F and then Is_Absolute_Path (Name) then
283 Write_Str (File_Name (Name));
296 ----------------------------
297 -- Is_External_Assignment --
298 ----------------------------
300 function Is_External_Assignment (Argv : String) return Boolean is
301 Start : Positive := 3;
302 Finish : Natural := Argv'Last;
305 pragma Assert (Argv'First = 1);
306 pragma Assert (Argv (1 .. 2) = "-X");
309 if Argv'Last < 5 then
312 elsif Argv (3) = '"' then
313 if Argv (Argv'Last) /= '"' or else Argv'Last < 7 then
317 Finish := Argv'Last - 1;
323 while Equal_Pos <= Finish and then Argv (Equal_Pos) /= '=' loop
324 Equal_Pos := Equal_Pos + 1;
328 or else Equal_Pos > Finish
333 (External_Name => Argv (Start .. Equal_Pos - 1),
334 Value => Argv (Equal_Pos + 1 .. Finish));
337 end Is_External_Assignment;
344 (Source_File : File_Name_Type;
345 Index : Int := 0) return Boolean
348 return Marks.Get (K => (File => Source_File, Index => Index));
351 -----------------------------
352 -- Linker_Options_Switches --
353 -----------------------------
355 function Linker_Options_Switches
356 (Project : Project_Id;
357 In_Tree : Project_Tree_Ref) return String_List
359 procedure Recursive_Add_Linker_Options (Proj : Project_Id);
360 -- The recursive routine used to add linker options
362 ----------------------------------
363 -- Recursive_Add_Linker_Options --
364 ----------------------------------
366 procedure Recursive_Add_Linker_Options (Proj : Project_Id) is
368 Linker_Package : Package_Id;
369 Options : Variable_Value;
370 Imported : Project_List;
373 if Proj /= No_Project then
374 Data := In_Tree.Projects.Table (Proj);
376 if not Data.Seen then
377 In_Tree.Projects.Table (Proj).Seen := True;
378 Imported := Data.Imported_Projects;
380 while Imported /= Empty_Project_List loop
381 Recursive_Add_Linker_Options
382 (In_Tree.Project_Lists.Table
384 Imported := In_Tree.Project_Lists.Table
388 if Proj /= Project then
391 (Name => Name_Linker,
392 In_Packages => Data.Decl.Packages,
398 Attribute_Or_Array_Name => Name_Linker_Options,
399 In_Package => Linker_Package,
402 -- If attribute is present, add the project with
403 -- the attribute to table Linker_Opts.
405 if Options /= Nil_Variable_Value then
406 Linker_Opts.Increment_Last;
407 Linker_Opts.Table (Linker_Opts.Last) :=
408 (Project => Proj, Options => Options.Values);
413 end Recursive_Add_Linker_Options;
415 -- Start of processing for Linker_Options_Switches
420 for Index in Project_Table.First ..
421 Project_Table.Last (In_Tree.Projects)
423 In_Tree.Projects.Table (Index).Seen := False;
426 Recursive_Add_Linker_Options (Project);
428 Last_Linker_Option := 0;
430 for Index in reverse 1 .. Linker_Opts.Last loop
432 Options : String_List_Id := Linker_Opts.Table (Index).Options;
433 Proj : constant Project_Id :=
434 Linker_Opts.Table (Index).Project;
438 -- If Dir_Path has not been computed for this project, do it now
440 if In_Tree.Projects.Table (Proj).Dir_Path = null then
441 In_Tree.Projects.Table (Proj).Dir_Path :=
444 (In_Tree.Projects.Table
448 while Options /= Nil_String loop
450 In_Tree.String_Elements.Table (Options).Value;
451 Get_Name_String (Option);
453 -- Do not consider empty linker options
455 if Name_Len /= 0 then
456 Add_Linker_Option (Name_Buffer (1 .. Name_Len));
458 -- Object files and -L switches specified with relative
459 -- paths must be converted to absolute paths.
461 Test_If_Relative_Path
463 Linker_Options_Buffer (Last_Linker_Option),
465 In_Tree.Projects.Table (Proj).Dir_Path,
466 Including_L_Switch => True);
470 In_Tree.String_Elements.Table (Options).Next;
475 return Linker_Options_Buffer (1 .. Last_Linker_Option);
476 end Linker_Options_Switches;
482 package body Mains is
484 package Names is new Table.Table
485 (Table_Component_Type => File_Name_Type,
486 Table_Index_Type => Integer,
487 Table_Low_Bound => 1,
489 Table_Increment => 100,
490 Table_Name => "Makeutl.Mains.Names");
491 -- The table that stores the mains
493 Current : Natural := 0;
494 -- The index of the last main retrieved from the table
500 procedure Add_Main (Name : String) is
503 Add_Str_To_Name_Buffer (Name);
504 Names.Increment_Last;
505 Names.Table (Names.Last) := Name_Find;
522 function Next_Main return String is
524 if Current >= Names.Last then
528 Current := Current + 1;
529 return Get_Name_String (Names.Table (Current));
533 ---------------------
534 -- Number_Of_Mains --
535 ---------------------
537 function Number_Of_Mains return Natural is
557 procedure Mark (Source_File : File_Name_Type; Index : Int := 0) is
559 Marks.Set (K => (File => Source_File, Index => Index), E => True);
562 -----------------------
563 -- Path_Or_File_Name --
564 -----------------------
566 function Path_Or_File_Name (Path : Path_Name_Type) return String is
567 Path_Name : constant String := Get_Name_String (Path);
569 if Debug.Debug_Flag_F then
570 return File_Name (Path_Name);
574 end Path_Or_File_Name;
576 ---------------------------
577 -- Test_If_Relative_Path --
578 ---------------------------
580 procedure Test_If_Relative_Path
581 (Switch : in out String_Access;
582 Parent : String_Access;
583 Including_L_Switch : Boolean := True;
584 Including_Non_Switch : Boolean := True)
587 if Switch /= null then
589 Sw : String (1 .. Switch'Length);
597 and then (Sw (2) = 'A'
599 or else (Including_L_Switch and then Sw (2) = 'L'))
608 and then (Sw (2 .. 3) = "aL"
609 or else Sw (2 .. 3) = "aO"
610 or else Sw (2 .. 3) = "aI")
618 -- Because relative path arguments to --RTS= may be relative
619 -- to the search directory prefix, those relative path
620 -- arguments are not converted.
622 if not Is_Absolute_Path (Sw (Start .. Sw'Last)) then
623 if Parent = null or else Parent'Length = 0 then
625 ("relative search path switches (""",
627 """) are not allowed");
632 (Sw (1 .. Start - 1) &
634 Directory_Separator &
635 Sw (Start .. Sw'Last));
639 elsif Including_Non_Switch then
640 if not Is_Absolute_Path (Sw) then
641 if Parent = null or else Parent'Length = 0 then
643 ("relative paths (""", Sw, """) are not allowed");
647 new String'(Parent.all & Directory_Separator & Sw);
653 end Test_If_Relative_Path;
659 function Unit_Index_Of (ALI_File : File_Name_Type) return Int is
665 Get_Name_String (ALI_File);
667 -- First, find the last dot
671 while Finish >= 1 and then Name_Buffer (Finish) /= '.' loop
672 Finish := Finish - 1;
679 -- Now check that the dot is preceded by digits
682 Finish := Finish - 1;
684 while Start >= 1 and then Name_Buffer (Start - 1) in '0' .. '9' loop
688 -- If there are no digits, or if the digits are not preceded by
689 -- the character that precedes a unit index, this is not the ALI file
690 -- of a unit in a multi-unit source.
694 or else Name_Buffer (Start - 1) /= Multi_Unit_Index_Character
699 -- Build the index from the digit(s)
701 while Start <= Finish loop
702 Result := Result * 10 +
703 Character'Pos (Name_Buffer (Start)) - Character'Pos ('0');