1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- L I B . L I S T --
-- --
-- B o d y --
-- --
-- $Revision: 1.31 $ --
-- --
-- Copyright (C) 1992,1993,1994,1995,1996 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
with Output; use Output;
separate (Lib)
procedure List is
Num_Units : constant Nat := Int (Units.Last) - Int (Units.First) + 1;
-- Number of units in file table
Sorted_Units : Unit_Ref_Table (1 .. Num_Units);
-- Table of unit numbers that we will sort
Unit_Node : Node_Id;
-- Compilation unit node for current unit
Unit_Hed : constant String := "Unit name ";
Unit_Und : constant String := "--------- ";
Unit_Bln : constant String := " ";
File_Hed : constant String := "File name ";
File_Und : constant String := "--------- ";
File_Bln : constant String := " ";
Time_Hed : constant String := "Time stamp";
Time_Und : constant String := "----------";
Unit_Length : constant Natural := Unit_Hed'Length;
File_Length : constant Natural := File_Hed'Length;
begin
-- First step is to make a sorted table of units
for J in 1 .. Num_Units loop
Sorted_Units (J) := Unit_Number_Type (Int (Units.First) + J - 1);
end loop;
Sort (Sorted_Units);
-- Now we can generate the unit table listing
Write_Eol;
Write_Str (Unit_Hed);
Write_Str (File_Hed);
Write_Str (Time_Hed);
Write_Eol;
Write_Str (Unit_Und);
Write_Str (File_Und);
Write_Str (Time_Und);
Write_Eol;
Write_Eol;
for R in Sorted_Units'Range loop
Unit_Node := Cunit (Sorted_Units (R));
Write_Unit_Name (Unit_Name (Sorted_Units (R)));
if Name_Len > (Unit_Length - 1) then
Write_Eol;
Write_Str (Unit_Bln);
else
for J in Name_Len + 1 .. Unit_Length loop
Write_Char (' ');
end loop;
end if;
Write_Name (Full_File_Name (Source_Index (Sorted_Units (R))));
if Name_Len > (File_Length - 1) then
Write_Eol;
Write_Str (Unit_Bln);
Write_Str (File_Bln);
else
for J in Name_Len + 1 .. File_Length loop
Write_Char (' ');
end loop;
end if;
Write_Str (String (Time_Stamp (Source_Index (Sorted_Units (R)))));
Write_Eol;
end loop;
Write_Eol;
end List;
|
