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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062 | ------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT IMPLEMENTATION COMPONENTS --
-- --
-- A 4 G . C O N T T . U T --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-2017, Free Software Foundation, Inc. --
-- --
-- ASIS-for-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 --
-- Software Foundation; either version 3, or (at your option) any later --
-- version. ASIS-for-GNAT is distributed in the hope that it will be --
-- useful, but WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception distributed with GNAT; see --
-- the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the --
-- Software Engineering Laboratory of the Swiss Federal Institute of --
-- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the --
-- Scientific Research Computer Center of Moscow State University (SRCC --
-- MSU), Russia, with funding partially provided by grants from the Swiss --
-- National Science Foundation and the Swiss Academy of Engineering --
-- Sciences. ASIS-for-GNAT is now maintained by AdaCore --
-- (http://www.adacore.com). --
-- --
------------------------------------------------------------------------------
with Ada.Characters.Handling;
with Ada.Containers.Ordered_Sets;
with Ada.Strings.Fixed;
with GNAT.Table;
with Asis.Errors; use Asis.Errors;
with Asis.Exceptions; use Asis.Exceptions;
with Asis.Set_Get; use Asis.Set_Get;
with A4G.A_Debug; use A4G.A_Debug;
with A4G.Contt.Dp; use A4G.Contt.Dp;
with A4G.Contt.TT; use A4G.Contt.TT;
with A4G.Vcheck; use A4G.Vcheck;
with Atree; use Atree;
with Einfo; use Einfo;
with Lib;
with Namet; use Namet;
with Nlists; use Nlists;
with Output; use Output;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Snames; use Snames;
package body A4G.Contt.UT is
-----------------------------------------
-- Local Subprograms (general-purpose) --
-----------------------------------------
function Allocate_New_Entry (C : Context_Id) return Unit_Id;
-- allocates and returns a new entry in the Context Unit table
-- No setting or any other changes are done
procedure Set_Nil_Unit_Names (U : Unit_Id);
-- Sets all the fields related to Unit Name Table as indicating empty
-- strings
-- The body is in "Unit Name Table Data and Subprograms" section
procedure Set_Nil_Unit_Attributes (C : Context_Id; U : Unit_Id);
-- Sets all the attributes, dependency lists and tree lists of U as
-- if U is an ASIS Nil_Compilation_Unit.
-- The body is in "Black-Box Unit Attributes Routines" section
procedure Set_No_Source_File (U : Unit_Id);
-- Makes settings corresponding to the absence of the source file
-- name
function Same_Names return Boolean;
-- Compares the contents of the ASIS and GNAT Name Buffers.
procedure Make_Unit_Name;
-- Supposing that A_Name_Buffer contains the normalized name of a
-- nonexistent unit (with a suffix ending with 'n', this procedure
-- sets the content of A_Name_Buffer as equal to the Ada name of
-- this nonexistent unit
function Is_Spec (U : Unit_Id) return Boolean;
-- Checks if U denotes a unit that is a library_unit_declaration
function Is_Body (U : Unit_Id) return Boolean;
-- Checks if U denotes a unit that is a compilation_unit_body or a
-- subunit
function Get_Unit_Id_List (List : Elist_Id) return Unit_Id_List;
-- Transforms the unit list into one-dimensional array of unit Ids.
-- Returns Nil_Unit_Id_List for No_Elist
function Absolute_Full_File_Name return Boolean;
-- Checks that a source file name currently contained in the GNAT Name
-- Table contains directory information in an absolute form
procedure Store_Tree_For_Unit
(C : Context_Id;
U : Unit_Id;
N_U : Unit_Number_Type);
-- Provided that N_U is the unit number in the current tree that
-- corresponds to U, stores the currently accessed tree in the list of full
-- or limited view trees for the given unit.
function Is_Temp_File (Fname : String) return Boolean;
-- Checks if the argument is a name of a temporary file. This function
-- assumes that Fname may contain full path information and may end with
-- ASCII.NULL
type Top_Node_Rec is record
Tree : Tree_Id;
Top_Node : Node_Id;
end record;
package Top_Node_Cache is new GNAT.Table (
Table_Component_Type => Top_Node_Rec,
Table_Index_Type => Unit_Id,
Table_Low_Bound => First_Unit_Id,
Table_Initial => 1000,
Table_Increment => 100,
Table_Name => "Top Node Cache");
-- Used to cache the already computed results of the Top function
package Config_files_Sets is new
Ada.Containers.Ordered_Sets (Source_File_Index);
Config_Files : Config_files_Sets.Set;
-----------------------------
-- Absolute_Full_File_Name --
-----------------------------
function Absolute_Full_File_Name return Boolean is
Result : Boolean := False;
begin
if Namet.Name_Buffer (1) /= '.' then
for I in 1 .. Namet.Name_Len loop
if Namet.Name_Buffer (I) = '/'
or else
Namet.Name_Buffer (I) = '\'
then
Result := True;
exit;
end if;
end loop;
end if;
return Result;
end Absolute_Full_File_Name;
------------------------
-- Allocate_New_Entry --
------------------------
function Allocate_New_Entry (C : Context_Id) return Unit_Id is
Hash_Index : Hash_Index_Type;
-- Computed hash index
Curr_Id : Unit_Id;
-- Id of entries in hash chain, if any
New_Last : Unit_Id;
-- the Id of the new entry being allocated in the Unit Table
begin
Hash_Index := Hash;
Curr_Id := Contexts.Table (C).Hash_Table (Hash_Index);
Unit_Table.Increment_Last;
New_Last := Unit_Table.Last;
-- correcting the hash chain, if any
if Curr_Id = No_Unit_Id then
Contexts.Table (C).Hash_Table (Hash_Index) := New_Last;
-- no hash chain to correct
else
while Unit_Table.Table (Curr_Id).Hash_Link /= No_Unit_Id
loop
Curr_Id := Unit_Table.Table (Curr_Id).Hash_Link;
end loop;
-- now Curr_Id is the last entry in the hash chain
Unit_Table.Table (Curr_Id).Hash_Link := New_Last;
end if;
return New_Last;
end Allocate_New_Entry;
-------------------------------------
-- Allocate_Nonexistent_Unit_Entry --
-------------------------------------
function Allocate_Nonexistent_Unit_Entry (C : Context_Id) return Unit_Id
is
New_Unit_Id : Unit_Id;
begin
-- first we should modify the normalized unit name to make it the
-- name of a nonexistent unit:
A_Name_Len := A_Name_Len + 1;
A_Name_Buffer (A_Name_Len) := 'n';
if Debug_Flag_O or else
Debug_Lib_Model or else
Debug_Mode
then
Write_Str ("Allocating new nonexistent unit: ");
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Write_Eol;
end if;
-- DO WE REALLY NEED A SPECIAL SUFFIX FOR THE NAMES OF NONEXISTENT
-- UNITS ???
New_Unit_Id := Allocate_New_Entry (C);
Set_Nil_Unit_Names (New_Unit_Id);
Set_Nil_Unit_Attributes (C, New_Unit_Id);
Set_Norm_Ada_Name (New_Unit_Id);
if A_Name_Buffer (A_Name_Len - 1) = 'b' then
Set_Kind (C, New_Unit_Id, A_Nonexistent_Body);
else
Set_Kind (C, New_Unit_Id, A_Nonexistent_Declaration);
end if;
Make_Unit_Name;
Set_Ada_Name (New_Unit_Id);
return New_Unit_Id;
end Allocate_Nonexistent_Unit_Entry;
-------------------------
-- Allocate_Unit_Entry --
-------------------------
function Allocate_Unit_Entry (C : Context_Id) return Unit_Id is
New_Unit_Id : Unit_Id;
begin
New_Unit_Id := Allocate_New_Entry (C);
Set_Nil_Unit_Names (New_Unit_Id);
Set_Nil_Unit_Attributes (C, New_Unit_Id);
Set_Norm_Ada_Name (New_Unit_Id);
if A_Name_Buffer (A_Name_Len) = 's' then
Contexts.Table (C).Specs := Contexts.Table (C).Specs + 1;
elsif A_Name_Buffer (A_Name_Len) = 'b' then
Contexts.Table (C).Bodies := Contexts.Table (C).Bodies + 1;
end if;
if Debug_Mode then
Write_Str ("Allocate_Unit_Entry: in context ");
Write_Int (Int (C));
Write_Str (" unit ");
Write_Int (Int (New_Unit_Id));
Write_Str (" is allocated...");
Write_Eol;
end if;
return New_Unit_Id;
end Allocate_Unit_Entry;
-----------------------
-- Already_Processed --
-----------------------
function Already_Processed (C : Context_Id; U : Unit_Id) return Boolean is
begin
return Kind (C, U) /= Not_A_Unit;
end Already_Processed;
-----------------------
-- Check_Consistency --
-----------------------
procedure Check_Consistency
(C : Context_Id;
U_Id : Unit_Id;
U_Num : Unit_Number_Type)
is
Old_Stamp : Time_Stamp_Type;
New_Stamp : Time_Stamp_Type;
C_Tree_Mode : constant Tree_Mode := Tree_Processing_Mode (C);
Tmp : Elmt_Id;
Unit_Is_Older : Boolean;
begin
Old_Stamp := Time_Stamp (C, U_Id);
New_Stamp := Sinput.Time_Stamp (Lib.Source_Index (U_Num));
if not (Old_Stamp = New_Stamp) then
-- note, this is "=" explicitly defied in Types
Unit_Is_Older := New_Stamp > Old_Stamp;
if C_Tree_Mode = Incremental then
raise Inconsistent_Incremental_Context;
else
-- There is a special case that requires a specific diagnostic
-- message - (re)compilation of another version of System
-- (See D617-017)
Get_Name_String (U_Id, Norm_Ada_Name);
if A_Name_Buffer (1 .. A_Name_Len) = "system%s" then
Raise_ASIS_Failed
(Diagnosis => "Asis.Ada_Environments.Open - " &
"System is recompiled",
Stat => Use_Error);
else
-- Generate the full details about detected inconsistency.
Write_Str ("Different versions (" & String (Old_Stamp) &
" and " & String (New_Stamp) & ")");
Write_Eol;
Write_Str ("of unit ");
Get_Name_String (U_Id, Ada_Name);
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Write_Str ("(source file ");
Get_Name_String (U_Id, Ref_File_Name);
Write_Str (A_Name_Buffer (1 .. A_Name_Len) & ")");
Write_Eol;
Write_Str ("used to create the following tree files:");
Write_Eol;
if Unit_Is_Older then
Write_Str ("Older version used for:");
Write_Eol;
else
Write_Str ("Newer version used for:");
Write_Eol;
end if;
Write_Str ("Full view trees:");
Tmp := First_Elmt (Unit_Table.Table (U_Id).Full_View_Trees);
if Present (Tmp) then
Write_Eol;
while Present (Tmp) loop
A4G.Contt.TT.Get_Name_String (C, Tree_Id (Unit (Tmp)));
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Tmp := Next_Elmt (Tmp);
end loop;
else
Write_Str (" no");
Write_Eol;
end if;
Write_Str ("Limited view trees:");
Tmp := First_Elmt (Unit_Table.Table (U_Id).Limited_View_Trees);
if Present (Tmp) then
Write_Eol;
while Present (Tmp) loop
A4G.Contt.TT.Get_Name_String (C, Tree_Id (Unit (Tmp)));
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Tmp := Next_Elmt (Tmp);
end loop;
else
Write_Str (" no");
Write_Eol;
end if;
if Unit_Is_Older then
Write_Str ("Newer version used for:");
Write_Eol;
else
Write_Str ("Older version used for:");
Write_Eol;
end if;
A4G.Contt.TT.Get_Name_String (C, Current_Tree);
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Raise_ASIS_Failed
(Diagnosis => "Asis.Ada_Environments.Open - " &
"a set of tree files is inconsistent " &
"(check for existing unit)",
Stat => Use_Error);
end if;
end if;
end if;
end Check_Consistency;
------------------------------
-- Check_Source_Consistency --
------------------------------
procedure Check_Source_Consistency
(C : Context_Id;
U_Id : Unit_Id)
is
Tree_Stamp : Time_Stamp_Type;
Source_Stamp : Time_Stamp_Type;
C_Source_Mode : constant Source_Mode := Source_Processing_Mode (C);
C_Tree_Mode : constant Tree_Mode := Tree_Processing_Mode (C);
Source_Status : Source_File_Statuses := No_File_Status;
function Set_Diagnosis return String;
-- Forms the diagnosis in case when an inconsistency is detected. We
-- need this function to ensure the right order of setting and reading
-- the information in A_Name_Buffer
function Set_Diagnosis return String is
S1 : constant String := "Asis.Ada_Environments.Open - source file ";
S2 : constant String := A_Name_Buffer (1 .. A_Name_Len - 1);
S3 : constant String := " is inconsistent with a tree file ";
S4 : constant String := Get_Tree_Name (C, Current_Tree);
begin
return S1 & S2 & S3 & S4;
end Set_Diagnosis;
begin
Get_Name_String (U_Id, Source_File_Name);
A_Name_Len := A_Name_Len + 1;
A_Name_Buffer (A_Name_Len) := ASCII.NUL;
if Is_Regular_File (A_Name_Buffer) then
Source_Stamp := TS_From_OS_Time (File_Time_Stamp (A_Name_Buffer));
Tree_Stamp := Time_Stamp (C, U_Id);
if Source_Stamp > Tree_Stamp then
Source_Status := Newer;
elsif Source_Stamp < Tree_Stamp then
Source_Status := Older;
else
Source_Status := Up_To_Date;
end if;
else
Source_Status := Absent;
end if;
Set_Source_Status (C, U_Id, Source_Status);
if C_Source_Mode = All_Sources and then
Source_Status = Absent and then
Kind (C, U_Id) /= A_Configuration_Compilation
then
if C_Tree_Mode = Incremental then
raise Inconsistent_Incremental_Context;
else
Set_Error_Status
(Status => Asis.Errors.Use_Error,
Diagnosis => "Asis.Ada_Environments.Open - source file "
& A_Name_Buffer (1 .. A_Name_Len - 1)
& " does not exist");
raise ASIS_Failed;
end if;
end if;
if (C_Source_Mode = All_Sources or else C_Source_Mode = Existing_Sources)
and then
(Source_Status = Newer or else Source_Status = Older)
and then
(Check_Temporary_Files or else
not Is_Temp_File (A_Name_Buffer (1 .. A_Name_Len - 1)))
then
if C_Tree_Mode = Incremental then
raise Inconsistent_Incremental_Context;
else
Set_Error_Status
(Status => Asis.Errors.Use_Error,
Diagnosis => Set_Diagnosis);
raise ASIS_Failed;
end if;
end if;
end Check_Source_Consistency;
--------------------
-- Enclosing_Unit --
--------------------
function Enclosing_Unit
(Cont : Context_Id;
Node : Node_Id)
return Asis.Compilation_Unit
is
Current_Node : Node_Id := Node;
Result_Unit_Id : Unit_Id := Nil_Unit;
Success : Boolean := False;
Tmp : Node_Id;
begin
-- First, correct Current_Node in case if it represents the defining
-- operator of implicitly declared "/=" (as a consequence of explicit
-- "=" definition
if Nkind (Current_Node) = N_Defining_Operator_Symbol
and then
not Comes_From_Source (Current_Node)
and then
Chars (Current_Node) = Name_Op_Ne
and then
Present (Corresponding_Equality (Current_Node))
then
Current_Node := Corresponding_Equality (Current_Node);
end if;
-- Then, checking if we are or are not in the package Standard:
if Sloc (Node) <= Standard_Location then
Result_Unit_Id := Standard_Id;
else
-- we are not in the package Standard here, therefore we have to
-- find the top node of the enclosing subtree:
while not (Nkind (Current_Node) = N_Compilation_Unit) loop
pragma Assert (Present (Parent (Current_Node)));
Current_Node := Parent (Current_Node);
if Nkind (Current_Node) = N_Subprogram_Declaration
and then
No (Parent (Current_Node))
then
-- It may be the case of an implicit "/=" function that
-- corresponds to explicit redefinition of predefined "+"
Tmp := Specification (Current_Node);
Tmp := Defining_Unit_Name (Tmp);
if Nkind (Tmp) = N_Defining_Operator_Symbol
and then
Chars (Tmp) = Name_Op_Ne
and then
Present (Corresponding_Equality (Tmp))
then
Current_Node := Corresponding_Equality (Tmp);
end if;
end if;
end loop;
if Is_Rewrite_Substitution (Unit (Current_Node))
and then
Is_Rewrite_Substitution (Original_Node (Unit (Current_Node)))
and then
Nkind (Original_Node (Unit (Current_Node))) = N_Package_Body
then
-- This corresponds to the situation when a library-level
-- instantiation is a supporter of a main unit, and the expanded
-- body of this instantiation is required according to Lib (h).
-- (See 7523-A19, 7624-A06 9418-015 and 9416-A01). In this case we
-- Have to go to the compilation unit created for the
-- instantiation
Current_Node := Library_Unit (Current_Node);
end if;
-- now - getting the normalized unit name
Namet.Get_Decoded_Name_String (Lib.Unit_Name (
Lib.Get_Cunit_Unit_Number (Current_Node)));
Set_Norm_Ada_Name_String_With_Check
(Lib.Get_Cunit_Unit_Number (Current_Node), Success);
if not Success then
-- This means, that we most probably are in the unit created for
-- expanded package spec in case of library-level package
-- instantiation, ASIS skips such units and processes only
-- units rooted by expanded bodies, so let's try this
Current_Node := Unit (Current_Node);
pragma Assert
(Nkind (Current_Node) = N_Package_Declaration and then
not Comes_From_Source (Current_Node));
Current_Node := Corresponding_Body (Current_Node);
if Nkind (Parent (Current_Node)) =
N_Defining_Program_Unit_Name
then
Current_Node := Parent (Current_Node);
end if;
Current_Node := Parent (Parent (Current_Node));
Set_Norm_Ada_Name_String_With_Check
(Lib.Get_Cunit_Unit_Number (Current_Node), Success);
end if;
if Success then
Result_Unit_Id := Name_Find (Cont);
end if;
end if;
if No (Result_Unit_Id) then
raise Internal_Implementation_Error;
else
return Get_Comp_Unit (Result_Unit_Id, Cont);
end if;
end Enclosing_Unit;
----------------------
-- Form_Parent_Name --
----------------------
procedure Form_Parent_Name is
New_Len : Integer := 0;
begin
for I in reverse 1 .. A_Name_Len loop
if A_Name_Buffer (I) = '.' then
New_Len := I;
exit;
end if;
end loop;
A_Name_Len := New_Len;
if A_Name_Len = 0 then
return;
end if;
A_Name_Buffer (A_Name_Len) := '%';
A_Name_Len := A_Name_Len + 1;
A_Name_Buffer (A_Name_Len) := 's';
end Form_Parent_Name;
---------------------
-- Get_Name_String --
---------------------
procedure Get_Name_String (Id : Unit_Id; Col : Column) is
S : Int;
L : Short;
begin
case Col is
when Ada_Name =>
S := Unit_Table.Table (Id).Ada_Name_Chars_Index;
L := Unit_Table.Table (Id).Ada_Name_Len;
when Norm_Ada_Name =>
S := Unit_Table.Table (Id).Norm_Ada_Name_Chars_Index;
L := Unit_Table.Table (Id).Norm_Ada_Name_Len;
when Source_File_Name =>
S := Unit_Table.Table (Id).File_Name_Chars_Index;
L := Unit_Table.Table (Id).File_Name_Len;
when Ref_File_Name =>
S := Unit_Table.Table (Id).Ref_Name_Chars_Index;
L := Unit_Table.Table (Id).Ref_Name_Len;
end case;
A_Name_Len := Natural (L);
for I in 1 .. A_Name_Len loop
A_Name_Buffer (I) := A_Name_Chars.Table (S + Int (I));
end loop;
end Get_Name_String;
-----------------
-- Get_Subunit --
-----------------
function Get_Subunit
(Parent_Body : Asis.Compilation_Unit;
Stub_Node : Node_Id)
return Asis.Compilation_Unit
is
Def_S_Name : Node_Id;
Arg_Unit_Id : constant Unit_Id := Get_Unit_Id (Parent_Body);
Result_Unit_Id : Unit_Id;
Result_Cont_Id : constant Context_Id := Encl_Cont_Id (Parent_Body);
begin
Get_Name_String (Arg_Unit_Id, Norm_Ada_Name);
if Nkind (Stub_Node) = N_Subprogram_Body_Stub then
Def_S_Name := Defining_Unit_Name (Specification (Stub_Node));
else
Def_S_Name := Defining_Identifier (Stub_Node);
end if;
Append_Subunit_Name (Def_S_Name);
-- Now we have a name of a subunit in A_Name_Buffer. Let's try
-- to find this subunit out:
Result_Unit_Id := Name_Find (Result_Cont_Id);
return Get_Comp_Unit (Result_Unit_Id, Result_Cont_Id);
end Get_Subunit;
----------------------
-- Get_Unit_Id_List --
----------------------
function Get_Unit_Id_List (List : Elist_Id) return Unit_Id_List is
Res_Len : Natural;
Next_Element : Elmt_Id;
begin
if No (List) then
return Nil_Unit_Id_List;
end if;
Res_Len := List_Length (List);
declare
Result : Unit_Id_List (1 .. Res_Len);
begin
Next_Element := First_Elmt (List);
for I in 1 .. Res_Len loop
Result (I) := Unit (Next_Element);
Next_Element := Next_Elmt (Next_Element);
end loop;
return Result;
end;
end Get_Unit_Id_List;
-----------------------------------
-- GNAT_Compilation_Dependencies --
-----------------------------------
function GNAT_Compilation_Dependencies (U : Unit_Id) return Unit_Id_List is
begin
return Get_Unit_Id_List (Unit_Table.Table (U).Compilation_Dependencies);
end GNAT_Compilation_Dependencies;
-------------
-- Is_Body --
-------------
function Is_Body (U : Unit_Id) return Boolean is
begin
Get_Name_String (U, Norm_Ada_Name);
return A_Name_Buffer (A_Name_Len) = 'b';
end Is_Body;
-------------
-- Is_Spec --
-------------
function Is_Spec (U : Unit_Id) return Boolean is
begin
Get_Name_String (U, Norm_Ada_Name);
-- The second condition is needed to filter out
-- A_Configuration_Compiation unit having the name
-- "__configuration_compilation%s"
return A_Name_Buffer (A_Name_Len) = 's'
and then A_Name_Buffer (1) /= '_';
end Is_Spec;
------------------
-- Is_Temp_File --
------------------
function Is_Temp_File (Fname : String) return Boolean is
L_Idx : Natural;
R_Idx : Natural := Fname'Last;
begin
if Fname (R_Idx) = ASCII.NUL then
R_Idx := R_Idx - 1;
end if;
L_Idx := Ada.Strings.Fixed.Index (Fname,
(1 => Directory_Separator),
Going => Ada.Strings.Backward);
if L_Idx = 0 then
L_Idx := Fname'First;
else
L_Idx := L_Idx + 1;
end if;
return R_Idx - L_Idx + 1 > 10 and then
Fname (L_Idx .. L_Idx + 9) = "GNAT-TEMP-";
end Is_Temp_File;
--------------------
-- Length_Of_Name --
--------------------
function Length_Of_Name (Id : Unit_Id; Col : Column) return Nat is
L : Short;
begin
case Col is
when Ada_Name =>
L := Unit_Table.Table (Id).Ada_Name_Len;
when Norm_Ada_Name =>
L := Unit_Table.Table (Id).Norm_Ada_Name_Len;
when Source_File_Name =>
L := Unit_Table.Table (Id).File_Name_Len;
when Ref_File_Name =>
L := Unit_Table.Table (Id).Ref_Name_Len;
end case;
return Nat (L);
end Length_Of_Name;
--------------------
-- Make_Unit_Name --
--------------------
procedure Make_Unit_Name is
begin
-- getting rid of the suffix:
A_Name_Len := A_Name_Len - 3;
A_Name_Buffer (1) := Ada.Characters.Handling.To_Upper
(A_Name_Buffer (1));
-- "normalizing" the name:
for I in 1 .. A_Name_Len - 1 loop
if A_Name_Buffer (I) = '.' or else
A_Name_Buffer (I) = '_'
then
A_Name_Buffer (I + 1) :=
Ada.Characters.Handling.To_Upper (A_Name_Buffer (I + 1));
end if;
end loop;
end Make_Unit_Name;
---------------
-- Name_Find --
---------------
-- The code has been borrowed from the GNAT Namet package. The quick
-- search for one character names was removed and allocating of a new
-- entry in case when no name has been found is changed to returning
-- Nil_Unit
function Name_Find (C : Context_Id) return Unit_Id is
New_Id : Unit_Id;
-- Id of entry in hash search, and value to be returned
S : Int;
-- Pointer into string table
Hash_Index : Hash_Index_Type;
-- Computed hash index
begin
Hash_Index := Hash;
New_Id := Contexts.Table (C).Hash_Table (Hash_Index);
if New_Id = No_Unit_Id then
return Nil_Unit;
else
Search : loop
if A_Name_Len /=
Integer (Unit_Table.Table (New_Id).Norm_Ada_Name_Len)
then
goto No_Match;
end if;
S := Unit_Table.Table (New_Id).Norm_Ada_Name_Chars_Index;
for I in 1 .. A_Name_Len loop
if A_Name_Chars.Table (S + Int (I)) /=
A_Name_Buffer (I)
then
goto No_Match;
end if;
end loop;
return New_Id;
-- Current entry in hash chain does not match
<<No_Match>>
if Unit_Table.Table (New_Id).Hash_Link /=
No_Unit_Id
then
New_Id := Unit_Table.Table (New_Id).Hash_Link;
else
exit Search;
end if;
end loop Search;
end if;
-- We fall through here only if a matching entry was not found in the
-- hash table.
-- In the GNAT Name Table a new entry in the names table is created,
-- but we simply return Nil_Unit. Remember, we will have to
-- maintain the consistency of hash links when we will allocate
-- the new entry for the newly successfully compiled ASIS Compilation
-- Unit.
return Nil_Unit;
end Name_Find;
-----------------
-- Reset_Cache --
-----------------
procedure Reset_Cache is
begin
for U in First_Unit_Id .. Top_Node_Cache.Last loop
Top_Node_Cache.Table (U).Tree := Nil_Tree;
end loop;
end Reset_Cache;
------------------
-- Set_Ada_Name --
------------------
procedure Set_Ada_Name (Id : Unit_Id) is
begin
-- Set the values of Ada_Name_Chars_Index and Ada_Name_Len
Unit_Table.Table (Id).Ada_Name_Chars_Index :=
A_Name_Chars.Last;
Unit_Table.Table (Id).Ada_Name_Len := Short (A_Name_Len);
-- Set corresponding string entry in the Name_Chars table
for I in 1 .. A_Name_Len loop
A_Name_Chars.Increment_Last;
A_Name_Chars.
Table (A_Name_Chars.Last) := A_Name_Buffer (I);
end loop;
A_Name_Chars.Increment_Last;
A_Name_Chars.Table (A_Name_Chars.Last) :=
ASCII.NUL;
end Set_Ada_Name;
------------------------
-- Set_Nil_Unit_Names --
------------------------
procedure Set_Nil_Unit_Names (U : Unit_Id) is
Unit : constant Unit_Id := U;
begin
Unit_Table.Table (Unit).Ada_Name_Chars_Index := 0;
Unit_Table.Table (Unit).Norm_Ada_Name_Chars_Index := 0;
Unit_Table.Table (Unit).File_Name_Chars_Index := 0;
Unit_Table.Table (Unit).Ada_Name_Len := 0;
Unit_Table.Table (Unit).Norm_Ada_Name_Len := 0;
Unit_Table.Table (Unit).File_Name_Len := 0;
Unit_Table.Table (Unit).Ref_Name_Len := 0;
Unit_Table.Table (Unit).Hash_Link := No_Unit_Id;
end Set_Nil_Unit_Names;
-----------------------
-- Set_Norm_Ada_Name --
-----------------------
procedure Set_Norm_Ada_Name (Id : Unit_Id) is
begin
-- Set the values of Norm_Ada_Name_Chars_Index and Norm_Ada_Name_Len
Unit_Table.Table (Id).Norm_Ada_Name_Chars_Index :=
A_Name_Chars.Last;
Unit_Table.Table (Id).Norm_Ada_Name_Len := Short (A_Name_Len);
-- Set corresponding string entry in the Name_Chars table
for I in 1 .. A_Name_Len loop
A_Name_Chars.Increment_Last;
A_Name_Chars.
Table (A_Name_Chars.Last) := A_Name_Buffer (I);
end loop;
A_Name_Chars.Increment_Last;
A_Name_Chars.
Table (A_Name_Chars.Last) := ASCII.NUL;
end Set_Norm_Ada_Name;
------------------------------
-- Set_Norm_Ada_Name_String --
------------------------------
procedure Set_Norm_Ada_Name_String is
begin
A_Name_Len := Namet.Name_Len;
A_Name_Buffer (1 .. A_Name_Len) :=
Namet.Name_Buffer (1 .. Namet.Name_Len);
-- ??? The commented code caused problems for 7717-010
-- ??? We will keep it for a while in case of possible
-- ??? regressions (18.05.2000)
-- A_Name_Buffer (1 .. A_Name_Len) := Ada.Characters.Handling.To_Lower
-- (Namet.Name_Buffer (1 .. Namet.Name_Len));
end Set_Norm_Ada_Name_String;
-----------------------------------------
-- Set_Norm_Ada_Name_String_With_Check --
-----------------------------------------
procedure Set_Norm_Ada_Name_String_With_Check
(Unit : Unit_Number_Type;
Success : out Boolean)
is
Unit_Node : Node_Id;
Unit_Node_Kind : Node_Kind;
begin
Set_Norm_Ada_Name_String;
Success := True;
Unit_Node := Sinfo.Unit (Lib.Cunit (Unit));
Unit_Node_Kind := Nkind (Unit_Node);
if (Unit_Node_Kind = N_Package_Body or else
Unit_Node_Kind = N_Package_Declaration)
and then
Nkind (Original_Node (Unit_Node)) in N_Generic_Instantiation
then
-- Unit created for library-level package or procedure instantiation
-- It is a spec, but the compiler sets for it in the unit
-- table suffix '%b'
A_Name_Buffer (A_Name_Len) := 's';
elsif not Comes_From_Source (Unit_Node) then
-- Unit created for expanded package spec in case of
-- library-level package instantiation, we do not need it
Success := False;
end if;
end Set_Norm_Ada_Name_String_With_Check;
------------------------
-- Set_No_Source_File --
------------------------
procedure Set_No_Source_File (U : Unit_Id) is
begin
Unit_Table.Table (U).File_Name_Len := 0;
Unit_Table.Table (U).Ref_Name_Len := 0;
end Set_No_Source_File;
--------------------------
-- Set_Source_File_Name --
--------------------------
procedure Set_Source_File_Name (Id : Unit_Id; Ref : Boolean := False) is
begin
-- Set the values of File_Name_Chars_Index and File_Name_Len
if Ref then
Unit_Table.Table (Id).Ref_Name_Chars_Index :=
A_Name_Chars.Last;
Unit_Table.Table (Id).Ref_Name_Len := Short (A_Name_Len);
else
Unit_Table.Table (Id).File_Name_Chars_Index :=
A_Name_Chars.Last;
Unit_Table.Table (Id).File_Name_Len := Short (A_Name_Len);
end if;
-- Set corresponding string entry in the Name_Chars table
for I in 1 .. A_Name_Len loop
A_Name_Chars.Increment_Last;
A_Name_Chars.
Table (A_Name_Chars.Last) := A_Name_Buffer (I);
end loop;
A_Name_Chars.Increment_Last;
A_Name_Chars.
Table (A_Name_Chars.Last) := ASCII.NUL;
end Set_Source_File_Name;
---------------------------------
-- Set_Ref_File_As_Source_File --
---------------------------------
procedure Set_Ref_File_As_Source_File (U : Unit_Id) is
begin
Unit_Table.Table (U).Ref_Name_Chars_Index :=
Unit_Table.Table (U).File_Name_Chars_Index;
Unit_Table.Table (U).Ref_Name_Len :=
Unit_Table.Table (U).File_Name_Len;
end Set_Ref_File_As_Source_File;
------------------------------
-- Set_Ref_File_Name_String --
------------------------------
procedure Set_Ref_File_Name_String (U : Unit_Id) is
Last_Dir_Separator : Natural := 0;
begin
if not Absolute_Full_File_Name then
Get_Name_String (U, Source_File_Name);
for I in reverse 1 .. A_Name_Len loop
if A_Name_Buffer (I) = Directory_Separator then
Last_Dir_Separator := I;
exit;
end if;
end loop;
end if;
if Last_Dir_Separator > 0 and then
not (Last_Dir_Separator = 2 and then A_Name_Buffer (1) = '.')
then
A_Name_Len := Last_Dir_Separator;
else
A_Name_Len := 0;
end if;
A_Name_Buffer (A_Name_Len + 1 .. A_Name_Len + Namet.Name_Len) :=
Namet.Name_Buffer (1 .. Namet.Name_Len);
A_Name_Len := A_Name_Len + Namet.Name_Len;
end Set_Ref_File_Name_String;
--------------
-- Set_Unit --
--------------
function Set_Unit (C : Context_Id; U : Unit_Number_Type) return Unit_Id is
New_Unit : Unit_Id;
begin
New_Unit := Allocate_Unit_Entry (C);
Set_Time_Stamp (C, New_Unit, Sinput.Time_Stamp (Lib.Source_Index (U)));
return New_Unit;
end Set_Unit;
----------------------------------------------
-- Black-Box Unit Attributes Routines --
----------------------------------------------
-----------------------
-- Local Subprograms --
-----------------------
------------------------------------------------
-- Unit Attributes Access and Update Routines --
------------------------------------------------
function Top (U : Unit_Id) return Node_Id is
Old_Last_Cache : Unit_Id;
begin
-- First, try to get the result from the cache
if U <= Top_Node_Cache.Last
and then
Top_Node_Cache.Table (U).Tree = Get_Current_Tree
then
return Top_Node_Cache.Table (U).Top_Node;
end if;
-- we have to compute the top node of the unit on the base of the
-- currently accessed tree. We are guaranteed here, that the currently
-- accessed tree contains the subtree for a given Unit
Get_Name_String (U, Norm_Ada_Name);
-- and now we will compare it with the names of the units contained
-- in the currently accessed tree
for Current_Unit in Main_Unit .. Lib.Last_Unit loop
Namet.Get_Decoded_Name_String (Lib.Unit_Name (Current_Unit));
-- Here we have to take into account, that in case of library
-- level package instantiations, in the tree created for such
-- an instantiation the main unit (corresponding to this
-- instantiation) has suffix '%b', whereas in ASIS the corresponding
-- normalized unit name has suffix '%s'
if Current_Unit = Main_Unit and then
Nkind (Original_Node (Sinfo.Unit (Lib.Cunit (Current_Unit)))) in
N_Generic_Instantiation
then
Namet.Name_Buffer (Namet.Name_Len) := 's';
end if;
if Same_Names then
Old_Last_Cache := Top_Node_Cache.Last;
if U > Old_Last_Cache then
Top_Node_Cache.Set_Last (U);
for J in Old_Last_Cache + 1 .. U - 1 loop
Top_Node_Cache.Table (J).Tree := Nil_Tree;
end loop;
end if;
Top_Node_Cache.Table (U).Top_Node := Lib.Cunit (Current_Unit);
Top_Node_Cache.Table (U).Tree := Get_Current_Tree;
return Lib.Cunit (Current_Unit);
end if;
end loop;
-- we cannot be here! But if we are, the only cause may be some bug
-- in ASIS implementation. So:
raise Internal_Implementation_Error;
end Top;
function Kind (C : Context_Id; U : Unit_Id) return Unit_Kinds is
begin
Reset_Context (C);
return Unit_Table.Table (U).Kind;
end Kind;
function Class (C : Context_Id; U : Unit_Id) return Unit_Classes is
begin
Reset_Context (C);
return Unit_Table.Table (U).Class;
end Class;
function Origin (C : Context_Id; U : Unit_Id) return Unit_Origins is
begin
Reset_Context (C);
return Unit_Table.Table (U).Origin;
end Origin;
function Is_Main_Unit (C : Context_Id; U : Unit_Id) return Boolean is
begin
Reset_Context (C);
return Unit_Table.Table (U).Main_Unit;
end Is_Main_Unit;
function Is_Body_Required (C : Context_Id; U : Unit_Id) return Boolean is
begin
Reset_Context (C);
return Unit_Table.Table (U).Is_Body_Required;
end Is_Body_Required;
function Time_Stamp (C : Context_Id; U : Unit_Id) return Time_Stamp_Type is
begin
Reset_Context (C);
return Unit_Table.Table (U).Time_Stamp;
end Time_Stamp;
function Is_Consistent (C : Context_Id; U : Unit_Id) return Boolean is
begin
Reset_Context (C);
return Unit_Table.Table (U).Is_Consistent;
end Is_Consistent;
function Source_Status (C : Context_Id; U : Unit_Id)
return Source_File_Statuses
is
begin
Reset_Context (C);
return Unit_Table.Table (U).Source_File_Status;
end Source_Status;
function Main_Tree (C : Context_Id; U : Unit_Id) return Tree_Id is
begin
Reset_Context (C);
return Unit_Table.Table (U).Main_Tree;
end Main_Tree;
function Has_Limited_View_Only
(C : Context_Id;
U : Unit_Id)
return Boolean
is
begin
Reset_Context (C);
return No (Unit_Table.Table (U).Full_View_Trees)
or else
No (First_Elmt (Unit_Table.Table (U).Full_View_Trees));
end Has_Limited_View_Only;
--------
procedure Set_Top (C : Context_Id; U : Unit_Id; N : Node_Id) is
begin
Reset_Context (C);
Unit_Table.Table (U).Top := N;
end Set_Top;
procedure Set_Kind (C : Context_Id; U : Unit_Id; K : Unit_Kinds) is
begin
Reset_Context (C);
Unit_Table.Table (U).Kind := K;
end Set_Kind;
procedure Set_Class (C : Context_Id; U : Unit_Id; Cl : Unit_Classes) is
begin
Reset_Context (C);
Unit_Table.Table (U).Class := Cl;
end Set_Class;
procedure Set_Origin (C : Context_Id; U : Unit_Id; O : Unit_Origins) is
begin
Reset_Context (C);
Unit_Table.Table (U).Origin := O;
end Set_Origin;
procedure Set_Is_Main_Unit (C : Context_Id; U : Unit_Id; M : Boolean) is
begin
Reset_Context (C);
Unit_Table.Table (U).Main_Unit := M;
end Set_Is_Main_Unit;
procedure Set_Is_Body_Required (C : Context_Id; U : Unit_Id; B : Boolean) is
begin
Reset_Context (C);
Unit_Table.Table (U).Is_Body_Required := B;
end Set_Is_Body_Required;
procedure Set_Time_Stamp (C : Context_Id; U : Unit_Id; T : Time_Stamp_Type)
is
begin
Reset_Context (C);
Unit_Table.Table (U).Time_Stamp := T;
end Set_Time_Stamp;
procedure Set_Is_Consistent (C : Context_Id; U : Unit_Id; B : Boolean) is
begin
Reset_Context (C);
Unit_Table.Table (U).Is_Consistent := B;
end Set_Is_Consistent;
procedure Set_Source_Status
(C : Context_Id;
U : Unit_Id;
S : Source_File_Statuses)
is
begin
Reset_Context (C);
Unit_Table.Table (U).Source_File_Status := S;
end Set_Source_Status;
----------------
-- Same_Names --
----------------
function Same_Names return Boolean is
begin
if Contt.A_Name_Len /= Namet.Name_Len then
return False;
end if;
-- a small optimization for comparing the Unit names:
-- we start from comparing the spec/body sign :-)
if Contt.A_Name_Buffer (A_Name_Len) /=
Namet.Name_Buffer (A_Name_Len)
then
return False;
end if;
for I in 1 .. Contt.A_Name_Len - 1 loop
if Contt.A_Name_Buffer (I) /= Namet.Name_Buffer (I) then
return False;
end if;
end loop;
return True;
end Same_Names;
-----------------------------
-- Set_Nil_Unit_Attributes --
-----------------------------
procedure Set_Nil_Unit_Attributes (C : Context_Id; U : Unit_Id) is
begin
Set_Top (C, U, Empty);
Set_Kind (C, U, Not_A_Unit);
Set_Class (C, U, Not_A_Class);
Set_Origin (C, U, Not_An_Origin);
Set_Is_Main_Unit (C, U, False);
Set_Is_Body_Required (C, U, False);
Set_No_Source_File (U);
Set_Time_Stamp (C, U, (others => '0'));
Set_Is_Consistent (C, U, True);
Set_Source_Status (C, U, No_File_Status);
-- setting the empty dependencies lists:
Unit_Table.Table (U).Ancestors := New_Elmt_List;
Unit_Table.Table (U).Descendants := New_Elmt_List;
Unit_Table.Table (U).Direct_Supporters := New_Elmt_List;
Unit_Table.Table (U).Supporters := New_Elmt_List;
Unit_Table.Table (U).Implicit_Supporters := New_Elmt_List;
Unit_Table.Table (U).Direct_Dependents := New_Elmt_List;
Unit_Table.Table (U).Dependents := New_Elmt_List;
Unit_Table.Table (U).Subunits_Or_Childs := New_Elmt_List;
Unit_Table.Table (U).Subunits_Computed := False;
Unit_Table.Table (U).Compilation_Dependencies := New_Elmt_List;
Unit_Table.Table (U).Full_View_Trees := New_Elmt_List;
Unit_Table.Table (U).Limited_View_Trees := New_Elmt_List;
Unit_Table.Table (U).Main_Tree := Nil_Tree;
end Set_Nil_Unit_Attributes;
-------------------------
-- Store_Tree_For_Unit --
-------------------------
procedure Store_Tree_For_Unit
(C : Context_Id;
U : Unit_Id;
N_U : Unit_Number_Type)
is
begin
if Analyzed (Lib.Cunit (N_U)) then
Append_Full_View_Tree_To_Unit (C, U);
else
Append_Limited_View_Tree_To_Unit (C, U);
end if;
end Store_Tree_For_Unit;
---------------------
-- TS_From_OS_Time --
---------------------
function TS_From_OS_Time (T : OS_Time) return Time_Stamp_Type is
Y : Year_Type;
Mon : Month_Type;
D : Day_Type;
H : Hour_Type;
Min : Minute_Type;
S : Second_Type;
Res : Time_Stamp_Type;
begin
GM_Split (T, Y, Mon, D, H, Min, S);
Make_Time_Stamp
(Nat (Y), Nat (Mon), Nat (D), Nat (H), Nat (Min), Nat (S), Res);
return Res;
end TS_From_OS_Time;
----------------------------------------------------------
-- Subprograms for Semantic Dependencies Handling --
----------------------------------------------------------
--------------
-- Children --
--------------
function Children (U : Unit_Id) return Unit_Id_List is
begin
return Get_Unit_Id_List (Unit_Table.Table (U).Subunits_Or_Childs);
end Children;
--------------------------
-- Get_Nonexistent_Unit --
--------------------------
function Get_Nonexistent_Unit (C : Context_Id) return Unit_Id is
Result_Id : Unit_Id;
begin
-- A_Name_Buffer contains the normalized unit name ending with "%s"
A_Name_Len := A_Name_Len + 1;
A_Name_Buffer (A_Name_Len) := 'n';
Result_Id := Name_Find (C);
if No (Result_Id) then
-- coming back to the correct initial situation for
-- Allocate_Nonexistent_Unit_Entry:
A_Name_Len := A_Name_Len - 1;
Result_Id := Allocate_Nonexistent_Unit_Entry (C);
end if;
return Result_Id;
end Get_Nonexistent_Unit;
---------------------
-- Get_Parent_Unit --
---------------------
function Get_Parent_Unit (C : Context_Id; U : Unit_Id) return Unit_Id is
begin
if U = Standard_Id then
return Nil_Unit;
end if;
Get_Name_String (U, Norm_Ada_Name);
Form_Parent_Name;
if A_Name_Len = 0 then
return Standard_Id;
else
return Name_Find (C);
end if;
end Get_Parent_Unit;
--------------
-- Get_Body --
--------------
function Get_Body (C : Context_Id; U : Unit_Id) return Unit_Id is
begin
Get_Name_String (U, Norm_Ada_Name);
A_Name_Buffer (A_Name_Len) := 'b';
return Name_Find (C);
end Get_Body;
---------------------
-- Get_Declaration --
---------------------
function Get_Declaration (C : Context_Id; U : Unit_Id) return Unit_Id is
begin
Get_Name_String (U, Norm_Ada_Name);
A_Name_Buffer (A_Name_Len) := 's';
return Name_Find (C);
end Get_Declaration;
-------------------
-- Get_Same_Unit --
-------------------
function Get_Same_Unit
(Arg_C : Context_Id;
Arg_U : Unit_Id;
Targ_C : Context_Id)
return Unit_Id
is
Result : Unit_Id;
begin
if Arg_C = Targ_C or else Arg_U = Nil_Unit then
return Arg_U;
end if;
Reset_Context (Arg_C);
Get_Name_String (Arg_U, Norm_Ada_Name);
Reset_Context (Targ_C);
Result := Name_Find (Targ_C);
if Present (Result) and then
Time_Stamp (Arg_C, Arg_U) = Time_Stamp (Targ_C, Result)
then
return Result;
else
return Nil_Unit;
end if;
end Get_Same_Unit;
-----------------------------
-- Get_Subunit_Parent_Body --
-----------------------------
function Get_Subunit_Parent_Body
(C : Context_Id;
U : Unit_Id)
return Unit_Id
is
begin
Get_Name_String (U, Norm_Ada_Name);
Form_Parent_Name;
A_Name_Buffer (A_Name_Len) := 'b';
-- for subunits Form_Parent_Name cannot set A_Name_Len as 0, and it
-- sets A_Name_Buffer (A_Name_Len) as 's'
return Name_Find (C);
end Get_Subunit_Parent_Body;
--------------
-- Not_Root --
--------------
function Not_Root return Boolean is
begin
for I in 1 .. A_Name_Len loop
if A_Name_Buffer (I) = '.' then
return True;
end if;
end loop;
return False;
end Not_Root;
--------------
-- Subunits --
--------------
function Subunits (C : Context_Id; U : Unit_Id) return Unit_Id_List is
begin
if not Unit_Table.Table (U).Subunits_Computed then
if not Unit_In_Current_Tree (C, U) then
Reset_Tree_For_Unit (C, U);
end if;
Set_Subunits (C, U, Top (U));
end if;
return Get_Unit_Id_List (Unit_Table.Table (U).Subunits_Or_Childs);
end Subunits;
--------------------------------------------------
-- General-Purpose Unit Table Subprograms --
--------------------------------------------------
----------------------
-- Comp_Unit_Bodies --
----------------------
function Comp_Unit_Bodies (C : Context_Id) return Natural is
begin
return Contexts.Table (C).Bodies;
end Comp_Unit_Bodies;
--------------
-- Finalize --
--------------
procedure Finalize (C : Context_Id) is
begin
if not Debug_Lib_Model then
return;
end if;
for U in First_Unit_Id .. Last_Unit loop
Output_Unit (C, U);
end loop;
end Finalize;
----------------
-- First_Body --
----------------
function First_Body return Unit_Id is
Result : Unit_Id := Nil_Unit;
begin
for U in First_Unit_Id .. Last_Unit loop
if Is_Body (U) then
Result := U;
exit;
end if;
end loop;
return Result;
end First_Body;
---------------
-- Last_Unit --
---------------
function Last_Unit return Unit_Id is
begin
return Unit_Table.Last;
end Last_Unit;
--------------------
-- Lib_Unit_Decls --
--------------------
function Lib_Unit_Decls (C : Context_Id) return Natural is
begin
return Contexts.Table (C).Specs;
end Lib_Unit_Decls;
---------------
-- Next_Body --
---------------
function Next_Body (B : Unit_Id) return Unit_Id is
Result : Unit_Id := Nil_Unit;
begin
for U in B + 1 .. Last_Unit loop
if Is_Body (U) then
Result := U;
exit;
end if;
end loop;
return Result;
end Next_Body;
---------------
-- Next_Decl --
---------------
function Next_Decl (D : Unit_Id) return Unit_Id is
Result : Unit_Id := Nil_Unit;
begin
for U in D + 1 .. Last_Unit loop
if Is_Spec (U) then
Result := U;
exit;
end if;
end loop;
return Result;
end Next_Decl;
--------
-- No --
--------
function No (Unit : Unit_Id) return Boolean is
begin
return Unit = Nil_Unit;
end No;
-------------
-- Present --
-------------
function Present (Unit : Unit_Id) return Boolean is
begin
return Unit /= Nil_Unit;
end Present;
-----------------
-- Output_Unit --
-----------------
procedure Output_Unit (C : Context_Id; Unit : Unit_Id) is
begin
Write_Str ("Debug output for Unit Id ");
Write_Int (Int (Unit));
Write_Eol;
Write_Str ("----------------------------");
Write_Eol;
if Unit = Nil_Unit then
Write_Str ("This is a Nil Unit");
Write_Eol;
return;
end if;
Write_Str ("Ada Unit Name: ");
Get_Name_String (Unit, Ada_Name);
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Write_Str ("Normalized Ada Unit Name: ");
Get_Name_String (Unit, Norm_Ada_Name);
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
Write_Eol;
Write_Str ("Source File Name: ");
Get_Name_String (Unit, Source_File_Name);
if A_Name_Len = 0 then
Write_Str ("no source file available");
else
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
end if;
Write_Eol;
Write_Str ("Reference File Name: ");
Get_Name_String (Unit, Ref_File_Name);
if A_Name_Len = 0 then
Write_Str ("no reference file available");
else
Write_Str (A_Name_Buffer (1 .. A_Name_Len));
end if;
Write_Eol;
Write_Str ("Unit Kind: ");
Write_Str (Unit_Kinds'Image (Kind (C, Unit)));
Write_Eol;
Write_Str ("Unit Class: ");
Write_Str (Unit_Classes'Image (Class (C, Unit)));
Write_Eol;
Write_Str ("Unit Origin: ");
Write_Str (Unit_Origins'Image (Origin (C, Unit)));
Write_Eol;
Write_Str ("Can be a main unit: ");
Write_Str (Boolean'Image (Is_Main_Unit (C, Unit)));
Write_Eol;
Write_Str ("Is body required: ");
Write_Str (Boolean'Image (Is_Body_Required (C, Unit)));
Write_Eol;
Write_Str ("Time stamp: ");
Write_Str (String (Time_Stamp (C, Unit)));
Write_Eol;
Write_Str ("Is consistent: ");
Write_Str (Boolean'Image (Is_Consistent (C, Unit)));
Write_Eol;
Write_Str ("Source file status: ");
Write_Str (Source_File_Statuses'Image (Source_Status (C, Unit)));
Write_Eol;
Write_Str ("Full view tree set:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Full_View_Trees);
Write_Str ("Limited view tree set:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Limited_View_Trees);
Write_Str ("Main_Tree: ");
Write_Int (Int (Unit_Table.Table (Unit).Main_Tree));
Write_Eol;
Write_Str ("Dependencies:");
Write_Eol;
Write_Str ("=============");
Write_Eol;
Write_Str ("Ancestors:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Ancestors);
Write_Str ("Descendents:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Descendants);
Write_Str ("Direct_Supporters:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Direct_Supporters);
Write_Str ("Supporters:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Supporters);
Write_Str ("Implicit Supporters:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Implicit_Supporters);
Write_Str ("Direct_Dependents:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Direct_Dependents);
Write_Str ("Dependents:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Dependents);
Write_Str ("Subunits_Or_Childs:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Subunits_Or_Childs);
Write_Str ("Compilation_Dependencies:");
Write_Eol;
Print_List (Unit_Table.Table (Unit).Compilation_Dependencies);
Write_Str ("==============================================");
Write_Eol;
end Output_Unit;
-----------------
-- Print_Units --
-----------------
procedure Print_Units (C : Context_Id) is
begin
Write_Str ("Unit Table for Context number: ");
Write_Int (Int (C));
Write_Eol;
if C = Non_Associated then
Write_Str (" Nil Context, it can never contain any unit");
Write_Eol;
return;
end if;
if Is_Opened (C) then
Write_Str ("The number of the unit entries being allocated is ");
Write_Int (Int (Last_Unit - First_Unit_Id + 1));
Write_Eol;
Write_Str ("The number of existing specs is ");
Write_Int (Int (Contexts.Table (C).Specs));
Write_Eol;
Write_Str ("The number of existing bodies is ");
Write_Int (Int (Contexts.Table (C).Bodies));
Write_Eol;
Write_Str ("The number of nonexisting units is ");
Write_Int (Int (Last_Unit - First_Unit_Id + 1) -
Int (Contexts.Table (C).Specs) -
Int (Contexts.Table (C).Bodies));
Write_Eol;
for U in First_Unit_Id .. Last_Unit loop
Output_Unit (C, U);
end loop;
Write_Eol;
else
Write_Str ("This Context is closed");
Write_Eol;
end if;
end Print_Units;
--------------------
-- Register_Units --
--------------------
procedure Register_Units (Set_First_New_Unit : Boolean := False) is
Cont : constant Context_Id := Get_Current_Cont;
Current_Unit : Unit_Id;
Include_Unit : Boolean := False;
Store_First_Unit : Boolean := Set_First_New_Unit;
Conf_File : Source_File_Index;
Comf_File_Name : File_Name_Type;
Conf_Unit : Unit_Id;
Next_Conf_Pragma : Node_Id;
use Config_files_Sets;
begin
-- Processing units of A_Configuration_Compilation kind
Clear (Config_Files);
Next_Conf_Pragma := Lib.Cunit (Main_Unit);
Next_Conf_Pragma := Aux_Decls_Node (Next_Conf_Pragma);
if Present (Config_Pragmas (Next_Conf_Pragma)) then
Next_Conf_Pragma := First (Config_Pragmas (Next_Conf_Pragma));
else
Next_Conf_Pragma := Empty;
end if;
while Present (Next_Conf_Pragma) loop
Conf_File := Get_Source_File_Index (Sloc (Next_Conf_Pragma));
if not Contains (Config_Files, Conf_File) then
Comf_File_Name := Full_File_Name (Conf_File);
Namet.Get_Name_String (Comf_File_Name);
-- Set normalized name of a potential configuration compilation
-- unit. We do this by hands, because this is the only place
-- where we have to do this
Set_Name_String
(Normalize_Pathname
(Namet.Name_Buffer (1 .. Namet.Name_Len),
Resolve_Links => False));
A_Name_Len := A_Name_Len + 2;
A_Name_Buffer (A_Name_Len - 1 .. A_Name_Len) := "%c";
Conf_Unit := Name_Find (Cont);
if No (Conf_Unit) then
Conf_Unit := Allocate_Unit_Entry (Cont);
Set_Kind (Cont, Conf_Unit, A_Configuration_Compilation);
Set_Class (Cont, Conf_Unit, A_Public_Declaration);
Set_Time_Stamp
(Cont, Conf_Unit, Sinput.Time_Stamp (Conf_File));
A_Name_Len := A_Name_Len - 2;
Set_Source_File_Name (Conf_Unit);
Check_Source_Consistency (Cont, Conf_Unit);
Set_Origin (Cont, Conf_Unit, An_Application_Unit);
else
if (Check_Temporary_Files or else
not Is_Temp_File (Name_Buffer (1 .. Name_Len)))
and then
Sinput.Time_Stamp (Conf_File) /=
Time_Stamp (Cont, Conf_Unit)
then
Raise_ASIS_Failed
(Diagnosis => "Asis.Ada_Environments.Open -- " &
"a set of tree files is inconsistent " &
"(check for configuration files)",
Stat => Use_Error);
end if;
end if;
Insert (Config_Files, Conf_File);
end if;
Next_Conf_Pragma := Next (Next_Conf_Pragma);
end loop;
-- Processing units representing Ada compilation units and subunits.
First_New_Unit := Nil_Unit;
for N_Unit in Main_Unit .. Lib.Last_Unit loop
if Present (Lib.Cunit (N_Unit)) then
Namet.Get_Decoded_Name_String (Lib.Unit_Name (N_Unit));
Set_Norm_Ada_Name_String_With_Check (N_Unit, Include_Unit);
if Include_Unit then
Current_Unit := Name_Find (Cont);
if No (Current_Unit) then
Current_Unit := Set_Unit (Cont, N_Unit);
if Store_First_Unit then
First_New_Unit := Last_Unit;
Store_First_Unit := False;
end if;
end if;
Store_Tree_For_Unit (Cont, Current_Unit, N_Unit);
end if;
end if;
end loop;
end Register_Units;
begin
-- Initializing the top node cache
Reset_Cache;
end A4G.Contt.UT;
|