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
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- P R J . P R O C --
-- --
-- B o d y --
-- --
-- Copyright (C) 2001-2004 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. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Err_Vars; use Err_Vars;
with Namet; use Namet;
with Opt;
with Osint; use Osint;
with Output; use Output;
with Prj.Attr; use Prj.Attr;
with Prj.Com; use Prj.Com;
with Prj.Err; use Prj.Err;
with Prj.Ext; use Prj.Ext;
with Prj.Nmsc; use Prj.Nmsc;
with GNAT.Case_Util; use GNAT.Case_Util;
with GNAT.HTable;
package body Prj.Proc is
Error_Report : Put_Line_Access := null;
package Processed_Projects is new GNAT.HTable.Simple_HTable
(Header_Num => Header_Num,
Element => Project_Id,
No_Element => No_Project,
Key => Name_Id,
Hash => Hash,
Equal => "=");
-- This hash table contains all processed projects
procedure Add (To_Exp : in out Name_Id; Str : Name_Id);
-- Concatenate two strings and returns another string if both
-- arguments are not null string.
procedure Add_Attributes
(Project : Project_Id;
Decl : in out Declarations;
First : Attribute_Node_Id);
-- Add all attributes, starting with First, with their default
-- values to the package or project with declarations Decl.
function Expression
(Project : Project_Id;
From_Project_Node : Project_Node_Id;
Pkg : Package_Id;
First_Term : Project_Node_Id;
Kind : Variable_Kind) return Variable_Value;
-- From N_Expression project node From_Project_Node, compute the value
-- of an expression and return it as a Variable_Value.
function Imported_Or_Extended_Project_From
(Project : Project_Id;
With_Name : Name_Id) return Project_Id;
-- Find an imported or extended project of Project whose name is With_Name
function Package_From
(Project : Project_Id;
With_Name : Name_Id) return Package_Id;
-- Find the package of Project whose name is With_Name
procedure Process_Declarative_Items
(Project : Project_Id;
From_Project_Node : Project_Node_Id;
Pkg : Package_Id;
Item : Project_Node_Id);
-- Process declarative items starting with From_Project_Node, and put them
-- in declarations Decl. This is a recursive procedure; it calls itself for
-- a package declaration or a case construction.
procedure Recursive_Process
(Project : out Project_Id;
From_Project_Node : Project_Node_Id;
Extended_By : Project_Id);
-- Process project with node From_Project_Node in the tree.
-- Do nothing if From_Project_Node is Empty_Node.
-- If project has already been processed, simply return its project id.
-- Otherwise create a new project id, mark it as processed, call itself
-- recursively for all imported projects and a extended project, if any.
-- Then process the declarative items of the project.
procedure Check (Project : in out Project_Id; Trusted_Mode : Boolean);
-- Set all projects to not checked, then call Recursive_Check for the
-- main project Project. Project is set to No_Project if errors occurred.
-- See Prj.Nmsc.Ada_Check for information on Trusted_Mode.
procedure Recursive_Check (Project : Project_Id; Trusted_Mode : Boolean);
-- If Project is not marked as checked, mark it as checked, call
-- Check_Naming_Scheme for the project, then call itself for a
-- possible extended project and all the imported projects of Project.
-- See Prj.Nmsc.Ada_Check for information on Trusted_Mode
---------
-- Add --
---------
procedure Add (To_Exp : in out Name_Id; Str : Name_Id) is
begin
if To_Exp = Types.No_Name or else To_Exp = Empty_String then
-- To_Exp is nil or empty. The result is Str.
To_Exp := Str;
-- If Str is nil, then do not change To_Ext
elsif Str /= No_Name and then Str /= Empty_String then
declare
S : constant String := Get_Name_String (Str);
begin
Get_Name_String (To_Exp);
Add_Str_To_Name_Buffer (S);
To_Exp := Name_Find;
end;
end if;
end Add;
--------------------
-- Add_Attributes --
--------------------
procedure Add_Attributes
(Project : Project_Id;
Decl : in out Declarations;
First : Attribute_Node_Id)
is
The_Attribute : Attribute_Node_Id := First;
Attribute_Data : Attribute_Record;
begin
while The_Attribute /= Empty_Attribute loop
Attribute_Data := Attributes.Table (The_Attribute);
if Attribute_Data.Kind_2 = Single then
declare
New_Attribute : Variable_Value;
begin
case Attribute_Data.Kind_1 is
-- Undefined should not happen
when Undefined =>
pragma Assert
(False, "attribute with an undefined kind");
raise Program_Error;
-- Single attributes have a default value of empty string
when Single =>
New_Attribute :=
(Project => Project,
Kind => Single,
Location => No_Location,
Default => True,
Value => Empty_String);
-- List attributes have a default value of nil list
when List =>
New_Attribute :=
(Project => Project,
Kind => List,
Location => No_Location,
Default => True,
Values => Nil_String);
end case;
Variable_Elements.Increment_Last;
Variable_Elements.Table (Variable_Elements.Last) :=
(Next => Decl.Attributes,
Name => Attribute_Data.Name,
Value => New_Attribute);
Decl.Attributes := Variable_Elements.Last;
end;
end if;
The_Attribute := Attributes.Table (The_Attribute).Next;
end loop;
end Add_Attributes;
-----------
-- Check --
-----------
procedure Check (Project : in out Project_Id; Trusted_Mode : Boolean) is
begin
-- Make sure that all projects are marked as not checked
for Index in 1 .. Projects.Last loop
Projects.Table (Index).Checked := False;
end loop;
Recursive_Check (Project, Trusted_Mode);
end Check;
----------------
-- Expression --
----------------
function Expression
(Project : Project_Id;
From_Project_Node : Project_Node_Id;
Pkg : Package_Id;
First_Term : Project_Node_Id;
Kind : Variable_Kind) return Variable_Value
is
The_Term : Project_Node_Id := First_Term;
-- The term in the expression list
The_Current_Term : Project_Node_Id := Empty_Node;
-- The current term node id
Result : Variable_Value (Kind => Kind);
-- The returned result
Last : String_List_Id := Nil_String;
-- Reference to the last string elements in Result, when Kind is List.
begin
Result.Project := Project;
Result.Location := Location_Of (First_Term);
-- Process each term of the expression, starting with First_Term
while The_Term /= Empty_Node loop
The_Current_Term := Current_Term (The_Term);
case Kind_Of (The_Current_Term) is
when N_Literal_String =>
case Kind is
when Undefined =>
-- Should never happen
pragma Assert (False, "Undefined expression kind");
raise Program_Error;
when Single =>
Add (Result.Value, String_Value_Of (The_Current_Term));
when List =>
String_Elements.Increment_Last;
if Last = Nil_String then
-- This can happen in an expression such as
-- () & "toto"
Result.Values := String_Elements.Last;
else
String_Elements.Table (Last).Next :=
String_Elements.Last;
end if;
Last := String_Elements.Last;
String_Elements.Table (Last) :=
(Value => String_Value_Of (The_Current_Term),
Display_Value => No_Name,
Location => Location_Of (The_Current_Term),
Flag => False,
Next => Nil_String);
end case;
when N_Literal_String_List =>
declare
String_Node : Project_Node_Id :=
First_Expression_In_List (The_Current_Term);
Value : Variable_Value;
begin
if String_Node /= Empty_Node then
-- If String_Node is nil, it is an empty list,
-- there is nothing to do
Value := Expression
(Project => Project,
From_Project_Node => From_Project_Node,
Pkg => Pkg,
First_Term => Tree.First_Term (String_Node),
Kind => Single);
String_Elements.Increment_Last;
if Result.Values = Nil_String then
-- This literal string list is the first term
-- in a string list expression
Result.Values := String_Elements.Last;
else
String_Elements.Table (Last).Next :=
String_Elements.Last;
end if;
Last := String_Elements.Last;
String_Elements.Table (Last) :=
(Value => Value.Value,
Display_Value => No_Name,
Location => Value.Location,
Flag => False,
Next => Nil_String);
loop
-- Add the other element of the literal string list
-- one after the other
String_Node :=
Next_Expression_In_List (String_Node);
exit when String_Node = Empty_Node;
Value :=
Expression
(Project => Project,
From_Project_Node => From_Project_Node,
Pkg => Pkg,
First_Term => Tree.First_Term (String_Node),
Kind => Single);
String_Elements.Increment_Last;
String_Elements.Table (Last).Next :=
String_Elements.Last;
Last := String_Elements.Last;
String_Elements.Table (Last) :=
(Value => Value.Value,
Display_Value => No_Name,
Location => Value.Location,
Flag => False,
Next => Nil_String);
end loop;
end if;
end;
when N_Variable_Reference | N_Attribute_Reference =>
declare
The_Project : Project_Id := Project;
The_Package : Package_Id := Pkg;
The_Name : Name_Id := No_Name;
The_Variable_Id : Variable_Id := No_Variable;
The_Variable : Variable_Value;
Term_Project : constant Project_Node_Id :=
Project_Node_Of (The_Current_Term);
Term_Package : constant Project_Node_Id :=
Package_Node_Of (The_Current_Term);
Index : Name_Id := No_Name;
begin
if Term_Project /= Empty_Node and then
Term_Project /= From_Project_Node
then
-- This variable or attribute comes from another project
The_Name := Name_Of (Term_Project);
The_Project := Imported_Or_Extended_Project_From
(Project => Project,
With_Name => The_Name);
end if;
if Term_Package /= Empty_Node then
-- This is an attribute of a package
The_Name := Name_Of (Term_Package);
The_Package := Projects.Table (The_Project).Decl.Packages;
while The_Package /= No_Package
and then Packages.Table (The_Package).Name /= The_Name
loop
The_Package := Packages.Table (The_Package).Next;
end loop;
pragma Assert
(The_Package /= No_Package,
"package not found.");
elsif Kind_Of (The_Current_Term) = N_Attribute_Reference then
The_Package := No_Package;
end if;
The_Name := Name_Of (The_Current_Term);
if Kind_Of (The_Current_Term) = N_Attribute_Reference then
Index := Associative_Array_Index_Of (The_Current_Term);
end if;
-- If it is not an associative array attribute
if Index = No_Name then
-- It is not an associative array attribute
if The_Package /= No_Package then
-- First, if there is a package, look into the package
if
Kind_Of (The_Current_Term) = N_Variable_Reference
then
The_Variable_Id :=
Packages.Table (The_Package).Decl.Variables;
else
The_Variable_Id :=
Packages.Table (The_Package).Decl.Attributes;
end if;
while The_Variable_Id /= No_Variable
and then
Variable_Elements.Table (The_Variable_Id).Name /=
The_Name
loop
The_Variable_Id :=
Variable_Elements.Table (The_Variable_Id).Next;
end loop;
end if;
if The_Variable_Id = No_Variable then
-- If we have not found it, look into the project
if
Kind_Of (The_Current_Term) = N_Variable_Reference
then
The_Variable_Id :=
Projects.Table (The_Project).Decl.Variables;
else
The_Variable_Id :=
Projects.Table (The_Project).Decl.Attributes;
end if;
while The_Variable_Id /= No_Variable
and then
Variable_Elements.Table (The_Variable_Id).Name /=
The_Name
loop
The_Variable_Id :=
Variable_Elements.Table (The_Variable_Id).Next;
end loop;
end if;
pragma Assert (The_Variable_Id /= No_Variable,
"variable or attribute not found");
The_Variable := Variable_Elements.Table
(The_Variable_Id).Value;
else
-- It is an associative array attribute
declare
The_Array : Array_Id := No_Array;
The_Element : Array_Element_Id := No_Array_Element;
Array_Index : Name_Id := No_Name;
begin
if The_Package /= No_Package then
The_Array :=
Packages.Table (The_Package).Decl.Arrays;
else
The_Array :=
Projects.Table (The_Project).Decl.Arrays;
end if;
while The_Array /= No_Array
and then Arrays.Table (The_Array).Name /= The_Name
loop
The_Array := Arrays.Table (The_Array).Next;
end loop;
if The_Array /= No_Array then
The_Element := Arrays.Table (The_Array).Value;
Get_Name_String (Index);
if Case_Insensitive (The_Current_Term) then
To_Lower (Name_Buffer (1 .. Name_Len));
end if;
Array_Index := Name_Find;
while The_Element /= No_Array_Element
and then Array_Elements.Table (The_Element).Index
/= Array_Index
loop
The_Element :=
Array_Elements.Table (The_Element).Next;
end loop;
end if;
if The_Element /= No_Array_Element then
The_Variable :=
Array_Elements.Table (The_Element).Value;
else
if
Expression_Kind_Of (The_Current_Term) = List
then
The_Variable :=
(Project => Project,
Kind => List,
Location => No_Location,
Default => True,
Values => Nil_String);
else
The_Variable :=
(Project => Project,
Kind => Single,
Location => No_Location,
Default => True,
Value => Empty_String);
end if;
end if;
end;
end if;
case Kind is
when Undefined =>
-- Should never happen
pragma Assert (False, "undefined expression kind");
null;
when Single =>
case The_Variable.Kind is
when Undefined =>
null;
when Single =>
Add (Result.Value, The_Variable.Value);
when List =>
-- Should never happen
pragma Assert
(False,
"list cannot appear in single " &
"string expression");
null;
end case;
when List =>
case The_Variable.Kind is
when Undefined =>
null;
when Single =>
String_Elements.Increment_Last;
if Last = Nil_String then
-- This can happen in an expression such as
-- () & Var
Result.Values := String_Elements.Last;
else
String_Elements.Table (Last).Next :=
String_Elements.Last;
end if;
Last := String_Elements.Last;
String_Elements.Table (Last) :=
(Value => The_Variable.Value,
Display_Value => No_Name,
Location => Location_Of (The_Current_Term),
Flag => False,
Next => Nil_String);
when List =>
declare
The_List : String_List_Id :=
The_Variable.Values;
begin
while The_List /= Nil_String loop
String_Elements.Increment_Last;
if Last = Nil_String then
Result.Values := String_Elements.Last;
else
String_Elements.Table (Last).Next :=
String_Elements.Last;
end if;
Last := String_Elements.Last;
String_Elements.Table (Last) :=
(Value =>
String_Elements.Table
(The_List).Value,
Display_Value => No_Name,
Location => Location_Of
(The_Current_Term),
Flag => False,
Next => Nil_String);
The_List :=
String_Elements.Table (The_List).Next;
end loop;
end;
end case;
end case;
end;
when N_External_Value =>
Get_Name_String
(String_Value_Of (External_Reference_Of (The_Current_Term)));
declare
Name : constant Name_Id := Name_Find;
Default : Name_Id := No_Name;
Value : Name_Id := No_Name;
Default_Node : constant Project_Node_Id :=
External_Default_Of (The_Current_Term);
begin
if Default_Node /= Empty_Node then
Default := String_Value_Of (Default_Node);
end if;
Value := Prj.Ext.Value_Of (Name, Default);
if Value = No_Name then
if not Opt.Quiet_Output then
if Error_Report = null then
Error_Msg
("?undefined external reference",
Location_Of (The_Current_Term));
else
Error_Report
("warning: """ & Get_Name_String (Name) &
""" is an undefined external reference",
Project);
end if;
end if;
Value := Empty_String;
end if;
case Kind is
when Undefined =>
null;
when Single =>
Add (Result.Value, Value);
when List =>
String_Elements.Increment_Last;
if Last = Nil_String then
Result.Values := String_Elements.Last;
else
String_Elements.Table (Last).Next :=
String_Elements.Last;
end if;
Last := String_Elements.Last;
String_Elements.Table (Last) :=
(Value => Value,
Display_Value => No_Name,
Location => Location_Of (The_Current_Term),
Flag => False,
Next => Nil_String);
end case;
end;
when others =>
-- Should never happen
pragma Assert
(False,
"illegal node kind in an expression");
raise Program_Error;
end case;
The_Term := Next_Term (The_Term);
end loop;
return Result;
end Expression;
---------------------------------------
-- Imported_Or_Extended_Project_From --
---------------------------------------
function Imported_Or_Extended_Project_From
(Project : Project_Id;
With_Name : Name_Id) return Project_Id
is
Data : constant Project_Data := Projects.Table (Project);
List : Project_List := Data.Imported_Projects;
begin
-- First check if it is the name of a extended project
if Data.Extends /= No_Project
and then Projects.Table (Data.Extends).Name = With_Name
then
return Data.Extends;
else
-- Then check the name of each imported project
while List /= Empty_Project_List
and then
Projects.Table
(Project_Lists.Table (List).Project).Name /= With_Name
loop
List := Project_Lists.Table (List).Next;
end loop;
pragma Assert
(List /= Empty_Project_List,
"project not found");
return Project_Lists.Table (List).Project;
end if;
end Imported_Or_Extended_Project_From;
------------------
-- Package_From --
------------------
function Package_From
(Project : Project_Id;
With_Name : Name_Id) return Package_Id
is
Data : constant Project_Data := Projects.Table (Project);
Result : Package_Id := Data.Decl.Packages;
begin
-- Check the name of each existing package of Project
while Result /= No_Package
and then
Packages.Table (Result).Name /= With_Name
loop
Result := Packages.Table (Result).Next;
end loop;
if Result = No_Package then
-- Should never happen
Write_Line ("package """ & Get_Name_String (With_Name) &
""" not found");
raise Program_Error;
else
return Result;
end if;
end Package_From;
-------------
-- Process --
-------------
procedure Process
(Project : out Project_Id;
Success : out Boolean;
From_Project_Node : Project_Node_Id;
Report_Error : Put_Line_Access;
Trusted_Mode : Boolean := False)
is
Obj_Dir : Name_Id;
Extending : Project_Id;
Extending2 : Project_Id;
begin
Error_Report := Report_Error;
Success := True;
-- Make sure there is no projects in the data structure
Projects.Set_Last (No_Project);
Processed_Projects.Reset;
-- And process the main project and all of the projects it depends on,
-- recursively
Recursive_Process
(Project => Project,
From_Project_Node => From_Project_Node,
Extended_By => No_Project);
if Project /= No_Project then
Check (Project, Trusted_Mode);
end if;
-- If main project is an extending all project, set the object
-- directory of all virtual extending projects to the object directory
-- of the main project.
if Project /= No_Project
and then Is_Extending_All (From_Project_Node)
then
declare
Object_Dir : constant Name_Id :=
Projects.Table (Project).Object_Directory;
begin
for Index in Projects.First .. Projects.Last loop
if Projects.Table (Index).Virtual then
Projects.Table (Index).Object_Directory := Object_Dir;
end if;
end loop;
end;
end if;
-- Check that no extending project shares its object directory with
-- the project(s) it extends.
if Project /= No_Project then
for Proj in 1 .. Projects.Last loop
Extending := Projects.Table (Proj).Extended_By;
if Extending /= No_Project then
Obj_Dir := Projects.Table (Proj).Object_Directory;
-- Check that a project being extended does not share its
-- object directory with any project that extends it, directly
-- or indirectly, including a virtual extending project.
-- Start with the project directly extending it
Extending2 := Extending;
while Extending2 /= No_Project loop
if Projects.Table (Extending2).Sources_Present
and then
Projects.Table (Extending2).Object_Directory = Obj_Dir
then
if Projects.Table (Extending2).Virtual then
Error_Msg_Name_1 := Projects.Table (Proj).Name;
if Error_Report = null then
Error_Msg
("project % cannot be extended by a virtual " &
"project with the same object directory",
Projects.Table (Proj).Location);
else
Error_Report
("project """ &
Get_Name_String (Error_Msg_Name_1) &
""" cannot be extended by a virtual " &
"project with the same object directory",
Project);
end if;
else
Error_Msg_Name_1 :=
Projects.Table (Extending2).Name;
Error_Msg_Name_2 := Projects.Table (Proj).Name;
if Error_Report = null then
Error_Msg
("project % cannot extend project %",
Projects.Table (Extending2).Location);
Error_Msg
("\they share the same object directory",
Projects.Table (Extending2).Location);
else
Error_Report
("project """ &
Get_Name_String (Error_Msg_Name_1) &
""" cannot extend project """ &
Get_Name_String (Error_Msg_Name_2) & """",
Project);
Error_Report
("they share the same object directory",
Project);
end if;
end if;
end if;
-- Continue with the next extending project, if any
Extending2 := Projects.Table (Extending2).Extended_By;
end loop;
end if;
end loop;
end if;
Success := Total_Errors_Detected <= 0;
end Process;
-------------------------------
-- Process_Declarative_Items --
-------------------------------
procedure Process_Declarative_Items
(Project : Project_Id;
From_Project_Node : Project_Node_Id;
Pkg : Package_Id;
Item : Project_Node_Id)
is
Current_Declarative_Item : Project_Node_Id := Item;
Current_Item : Project_Node_Id := Empty_Node;
begin
-- For each declarative item
while Current_Declarative_Item /= Empty_Node loop
-- Get its data
Current_Item := Current_Item_Node (Current_Declarative_Item);
-- And set Current_Declarative_Item to the next declarative item
-- ready for the next iteration.
Current_Declarative_Item := Next_Declarative_Item
(Current_Declarative_Item);
case Kind_Of (Current_Item) is
when N_Package_Declaration =>
-- Do not process a package declaration that should be ignored
if Expression_Kind_Of (Current_Item) /= Ignored then
-- Create the new package
Packages.Increment_Last;
declare
New_Pkg : constant Package_Id := Packages.Last;
The_New_Package : Package_Element;
Project_Of_Renamed_Package : constant Project_Node_Id :=
Project_Of_Renamed_Package_Of
(Current_Item);
begin
-- Set the name of the new package
The_New_Package.Name := Name_Of (Current_Item);
-- Insert the new package in the appropriate list
if Pkg /= No_Package then
The_New_Package.Next :=
Packages.Table (Pkg).Decl.Packages;
Packages.Table (Pkg).Decl.Packages := New_Pkg;
else
The_New_Package.Next :=
Projects.Table (Project).Decl.Packages;
Projects.Table (Project).Decl.Packages := New_Pkg;
end if;
Packages.Table (New_Pkg) := The_New_Package;
if Project_Of_Renamed_Package /= Empty_Node then
-- Renamed package
declare
Project_Name : constant Name_Id :=
Name_Of
(Project_Of_Renamed_Package);
Renamed_Project : constant Project_Id :=
Imported_Or_Extended_Project_From
(Project, Project_Name);
Renamed_Package : constant Package_Id :=
Package_From
(Renamed_Project,
Name_Of (Current_Item));
begin
-- For a renamed package, set declarations to
-- the declarations of the renamed package.
Packages.Table (New_Pkg).Decl :=
Packages.Table (Renamed_Package).Decl;
end;
-- Standard package declaration, not renaming
else
-- Set the default values of the attributes
Add_Attributes
(Project,
Packages.Table (New_Pkg).Decl,
Package_Attributes.Table
(Package_Id_Of (Current_Item)).First_Attribute);
-- And process declarative items of the new package
Process_Declarative_Items
(Project => Project,
From_Project_Node => From_Project_Node,
Pkg => New_Pkg,
Item => First_Declarative_Item_Of
(Current_Item));
end if;
end;
end if;
when N_String_Type_Declaration =>
-- There is nothing to process
null;
when N_Attribute_Declaration |
N_Typed_Variable_Declaration |
N_Variable_Declaration =>
if Expression_Of (Current_Item) = Empty_Node then
-- It must be a full associative array attribute declaration
declare
Current_Item_Name : constant Name_Id :=
Name_Of (Current_Item);
-- The name of the attribute
New_Array : Array_Id;
-- The new associative array created
Orig_Array : Array_Id;
-- The associative array value
Orig_Project_Name : Name_Id := No_Name;
-- The name of the project where the associative array
-- value is.
Orig_Project : Project_Id := No_Project;
-- The id of the project where the associative array
-- value is.
Orig_Package_Name : Name_Id := No_Name;
-- The name of the package, if any, where the associative
-- array value is.
Orig_Package : Package_Id := No_Package;
-- The id of the package, if any, where the associative
-- array value is.
New_Element : Array_Element_Id := No_Array_Element;
-- Id of a new array element created
Prev_Element : Array_Element_Id := No_Array_Element;
-- Last new element id created
Orig_Element : Array_Element_Id := No_Array_Element;
-- Current array element in the original associative
-- array.
Next_Element : Array_Element_Id := No_Array_Element;
-- Id of the array element that follows the new element.
-- This is not always nil, because values for the
-- associative array attribute may already have been
-- declared, and the array elements declared are reused.
begin
-- First, find if the associative array attribute already
-- has elements declared.
if Pkg /= No_Package then
New_Array := Packages.Table (Pkg).Decl.Arrays;
else
New_Array := Projects.Table (Project).Decl.Arrays;
end if;
while New_Array /= No_Array and then
Arrays.Table (New_Array).Name /= Current_Item_Name
loop
New_Array := Arrays.Table (New_Array).Next;
end loop;
-- If the attribute has never been declared add new entry
-- in the arrays of the project/package and link it.
if New_Array = No_Array then
Arrays.Increment_Last;
New_Array := Arrays.Last;
if Pkg /= No_Package then
Arrays.Table (New_Array) :=
(Name => Current_Item_Name,
Value => No_Array_Element,
Next => Packages.Table (Pkg).Decl.Arrays);
Packages.Table (Pkg).Decl.Arrays := New_Array;
else
Arrays.Table (New_Array) :=
(Name => Current_Item_Name,
Value => No_Array_Element,
Next => Projects.Table (Project).Decl.Arrays);
Projects.Table (Project).Decl.Arrays := New_Array;
end if;
end if;
-- Find the project where the value is declared
Orig_Project_Name :=
Name_Of (Associative_Project_Of (Current_Item));
for Index in Projects.First .. Projects.Last loop
if Projects.Table (Index).Name = Orig_Project_Name then
Orig_Project := Index;
exit;
end if;
end loop;
pragma Assert (Orig_Project /= No_Project,
"original project not found");
if Associative_Package_Of (Current_Item) = Empty_Node then
Orig_Array :=
Projects.Table (Orig_Project).Decl.Arrays;
else
-- If in a package, find the package where the
-- value is declared.
Orig_Package_Name :=
Name_Of (Associative_Package_Of (Current_Item));
Orig_Package :=
Projects.Table (Orig_Project).Decl.Packages;
pragma Assert (Orig_Package /= No_Package,
"original package not found");
while Packages.Table (Orig_Package).Name /=
Orig_Package_Name
loop
Orig_Package := Packages.Table (Orig_Package).Next;
pragma Assert (Orig_Package /= No_Package,
"original package not found");
end loop;
Orig_Array :=
Packages.Table (Orig_Package).Decl.Arrays;
end if;
-- Now look for the array
while Orig_Array /= No_Array and then
Arrays.Table (Orig_Array).Name /= Current_Item_Name
loop
Orig_Array := Arrays.Table (Orig_Array).Next;
end loop;
if Orig_Array = No_Array then
if Error_Report = null then
Error_Msg
("associative array value cannot be found",
Location_Of (Current_Item));
else
Error_Report
("associative array value cannot be found",
Project);
end if;
else
Orig_Element := Arrays.Table (Orig_Array).Value;
-- Copy each array element
while Orig_Element /= No_Array_Element loop
-- If it is the first element ...
if Prev_Element = No_Array_Element then
-- And there is no array element declared yet,
-- create a new first array element.
if Arrays.Table (New_Array).Value =
No_Array_Element
then
Array_Elements.Increment_Last;
New_Element := Array_Elements.Last;
Arrays.Table (New_Array).Value := New_Element;
Next_Element := No_Array_Element;
-- Otherwise, the new element is the first
else
New_Element := Arrays.Table (New_Array).Value;
Next_Element :=
Array_Elements.Table (New_Element).Next;
end if;
-- Otherwise, reuse an existing element, or create
-- one if necessary.
else
Next_Element :=
Array_Elements.Table (Prev_Element).Next;
if Next_Element = No_Array_Element then
Array_Elements.Increment_Last;
New_Element := Array_Elements.Last;
else
New_Element := Next_Element;
Next_Element :=
Array_Elements.Table (New_Element).Next;
end if;
end if;
-- Copy the value of the element
Array_Elements.Table (New_Element) :=
Array_Elements.Table (Orig_Element);
Array_Elements.Table (New_Element).Value.Project :=
Project;
-- Adjust the Next link
Array_Elements.Table (New_Element).Next :=
Next_Element;
-- Adjust the previous id for the next element
Prev_Element := New_Element;
-- Go to the next element in the original array
Orig_Element :=
Array_Elements.Table (Orig_Element).Next;
end loop;
-- Make sure that the array ends here, in case there
-- previously a greater number of elements.
Array_Elements.Table (New_Element).Next :=
No_Array_Element;
end if;
end;
-- Declarations other that full associative arrays
else
declare
New_Value : constant Variable_Value :=
Expression
(Project => Project,
From_Project_Node => From_Project_Node,
Pkg => Pkg,
First_Term =>
Tree.First_Term (Expression_Of
(Current_Item)),
Kind =>
Expression_Kind_Of (Current_Item));
-- The expression value
The_Variable : Variable_Id := No_Variable;
Current_Item_Name : constant Name_Id :=
Name_Of (Current_Item);
begin
-- Process a typed variable declaration
if
Kind_Of (Current_Item) = N_Typed_Variable_Declaration
then
-- Report an error for an empty string
if New_Value.Value = Empty_String then
Error_Msg_Name_1 := Name_Of (Current_Item);
if Error_Report = null then
Error_Msg
("no value defined for %",
Location_Of (Current_Item));
else
Error_Report
("no value defined for " &
Get_Name_String (Error_Msg_Name_1),
Project);
end if;
else
declare
Current_String : Project_Node_Id :=
First_Literal_String
(String_Type_Of
(Current_Item));
begin
-- Loop through all the valid strings for
-- the string type and compare to the string
-- value.
while Current_String /= Empty_Node
and then String_Value_Of (Current_String) /=
New_Value.Value
loop
Current_String :=
Next_Literal_String (Current_String);
end loop;
-- Report an error if the string value is not
-- one for the string type.
if Current_String = Empty_Node then
Error_Msg_Name_1 := New_Value.Value;
Error_Msg_Name_2 := Name_Of (Current_Item);
if Error_Report = null then
Error_Msg
("value { is illegal for typed string %",
Location_Of (Current_Item));
else
Error_Report
("value """ &
Get_Name_String (Error_Msg_Name_1) &
""" is illegal for typed string """ &
Get_Name_String (Error_Msg_Name_2) &
"""",
Project);
end if;
end if;
end;
end if;
end if;
if Kind_Of (Current_Item) /= N_Attribute_Declaration
or else
Associative_Array_Index_Of (Current_Item) = No_Name
then
-- Case of a variable declaration or of a not
-- associative array attribute.
-- First, find the list where to find the variable
-- or attribute.
if
Kind_Of (Current_Item) = N_Attribute_Declaration
then
if Pkg /= No_Package then
The_Variable :=
Packages.Table (Pkg).Decl.Attributes;
else
The_Variable :=
Projects.Table (Project).Decl.Attributes;
end if;
else
if Pkg /= No_Package then
The_Variable :=
Packages.Table (Pkg).Decl.Variables;
else
The_Variable :=
Projects.Table (Project).Decl.Variables;
end if;
end if;
-- Loop through the list, to find if it has already
-- been declared.
while
The_Variable /= No_Variable
and then
Variable_Elements.Table (The_Variable).Name /=
Current_Item_Name
loop
The_Variable :=
Variable_Elements.Table (The_Variable).Next;
end loop;
-- If it has not been declared, create a new entry
-- in the list.
if The_Variable = No_Variable then
-- All single string attribute should already have
-- been declared with a default empty string value.
pragma Assert
(Kind_Of (Current_Item) /=
N_Attribute_Declaration,
"illegal attribute declaration");
Variable_Elements.Increment_Last;
The_Variable := Variable_Elements.Last;
-- Put the new variable in the appropriate list
if Pkg /= No_Package then
Variable_Elements.Table (The_Variable) :=
(Next =>
Packages.Table (Pkg).Decl.Variables,
Name => Current_Item_Name,
Value => New_Value);
Packages.Table (Pkg).Decl.Variables :=
The_Variable;
else
Variable_Elements.Table (The_Variable) :=
(Next =>
Projects.Table (Project).Decl.Variables,
Name => Current_Item_Name,
Value => New_Value);
Projects.Table (Project).Decl.Variables :=
The_Variable;
end if;
-- If the variable/attribute has already been
-- declared, just change the value.
else
Variable_Elements.Table (The_Variable).Value :=
New_Value;
end if;
else
-- Associative array attribute
-- Get the string index
Get_Name_String
(Associative_Array_Index_Of (Current_Item));
-- Put in lower case, if necessary
if Case_Insensitive (Current_Item) then
GNAT.Case_Util.To_Lower
(Name_Buffer (1 .. Name_Len));
end if;
declare
The_Array : Array_Id;
The_Array_Element : Array_Element_Id :=
No_Array_Element;
Index_Name : constant Name_Id := Name_Find;
-- The name id of the index
begin
-- Look for the array in the appropriate list
if Pkg /= No_Package then
The_Array := Packages.Table (Pkg).Decl.Arrays;
else
The_Array := Projects.Table
(Project).Decl.Arrays;
end if;
while
The_Array /= No_Array
and then Arrays.Table (The_Array).Name /=
Current_Item_Name
loop
The_Array := Arrays.Table (The_Array).Next;
end loop;
-- If the array cannot be found, create a new
-- entry in the list. As The_Array_Element is
-- initialized to No_Array_Element, a new element
-- will be created automatically later.
if The_Array = No_Array then
Arrays.Increment_Last;
The_Array := Arrays.Last;
if Pkg /= No_Package then
Arrays.Table (The_Array) :=
(Name => Current_Item_Name,
Value => No_Array_Element,
Next => Packages.Table (Pkg).Decl.Arrays);
Packages.Table (Pkg).Decl.Arrays := The_Array;
else
Arrays.Table (The_Array) :=
(Name => Current_Item_Name,
Value => No_Array_Element,
Next =>
Projects.Table (Project).Decl.Arrays);
Projects.Table (Project).Decl.Arrays :=
The_Array;
end if;
-- Otherwise, initialize The_Array_Element as the
-- head of the element list.
else
The_Array_Element :=
Arrays.Table (The_Array).Value;
end if;
-- Look in the list, if any, to find an element
-- with the same index.
while The_Array_Element /= No_Array_Element
and then
Array_Elements.Table (The_Array_Element).Index /=
Index_Name
loop
The_Array_Element :=
Array_Elements.Table (The_Array_Element).Next;
end loop;
-- If no such element were found, create a new
-- one and insert it in the element list, with
-- the propoer value.
if The_Array_Element = No_Array_Element then
Array_Elements.Increment_Last;
The_Array_Element := Array_Elements.Last;
Array_Elements.Table (The_Array_Element) :=
(Index => Index_Name,
Index_Case_Sensitive =>
not Case_Insensitive (Current_Item),
Value => New_Value,
Next => Arrays.Table (The_Array).Value);
Arrays.Table (The_Array).Value :=
The_Array_Element;
-- An element with the same index already exists,
-- just replace its value with the new one.
else
Array_Elements.Table (The_Array_Element).Value :=
New_Value;
end if;
end;
end if;
end;
end if;
when N_Case_Construction =>
declare
The_Project : Project_Id := Project;
-- The id of the project of the case variable
The_Package : Package_Id := Pkg;
-- The id of the package, if any, of the case variable
The_Variable : Variable_Value := Nil_Variable_Value;
-- The case variable
Case_Value : Name_Id := No_Name;
-- The case variable value
Case_Item : Project_Node_Id := Empty_Node;
Choice_String : Project_Node_Id := Empty_Node;
Decl_Item : Project_Node_Id := Empty_Node;
begin
declare
Variable_Node : constant Project_Node_Id :=
Case_Variable_Reference_Of
(Current_Item);
Var_Id : Variable_Id := No_Variable;
Name : Name_Id := No_Name;
begin
-- If a project were specified for the case variable,
-- get its id.
if Project_Node_Of (Variable_Node) /= Empty_Node then
Name := Name_Of (Project_Node_Of (Variable_Node));
The_Project :=
Imported_Or_Extended_Project_From (Project, Name);
end if;
-- If a package were specified for the case variable,
-- get its id.
if Package_Node_Of (Variable_Node) /= Empty_Node then
Name := Name_Of (Package_Node_Of (Variable_Node));
The_Package := Package_From (The_Project, Name);
end if;
Name := Name_Of (Variable_Node);
-- First, look for the case variable into the package,
-- if any.
if The_Package /= No_Package then
Var_Id := Packages.Table (The_Package).Decl.Variables;
Name := Name_Of (Variable_Node);
while Var_Id /= No_Variable
and then
Variable_Elements.Table (Var_Id).Name /= Name
loop
Var_Id := Variable_Elements.Table (Var_Id).Next;
end loop;
end if;
-- If not found in the package, or if there is no
-- package, look at the project level.
if Var_Id = No_Variable
and then Package_Node_Of (Variable_Node) = Empty_Node
then
Var_Id := Projects.Table (The_Project).Decl.Variables;
while Var_Id /= No_Variable
and then
Variable_Elements.Table (Var_Id).Name /= Name
loop
Var_Id := Variable_Elements.Table (Var_Id).Next;
end loop;
end if;
if Var_Id = No_Variable then
-- Should never happen, because this has already been
-- checked during parsing.
Write_Line ("variable """ &
Get_Name_String (Name) &
""" not found");
raise Program_Error;
end if;
-- Get the case variable
The_Variable := Variable_Elements.Table (Var_Id).Value;
if The_Variable.Kind /= Single then
-- Should never happen, because this has already been
-- checked during parsing.
Write_Line ("variable""" &
Get_Name_String (Name) &
""" is not a single string variable");
raise Program_Error;
end if;
-- Get the case variable value
Case_Value := The_Variable.Value;
end;
-- Now look into all the case items of the case construction
Case_Item := First_Case_Item_Of (Current_Item);
Case_Item_Loop :
while Case_Item /= Empty_Node loop
Choice_String := First_Choice_Of (Case_Item);
-- When Choice_String is nil, it means that it is
-- the "when others =>" alternative.
if Choice_String = Empty_Node then
Decl_Item := First_Declarative_Item_Of (Case_Item);
exit Case_Item_Loop;
end if;
-- Look into all the alternative of this case item
Choice_Loop :
while Choice_String /= Empty_Node loop
if
Case_Value = String_Value_Of (Choice_String)
then
Decl_Item :=
First_Declarative_Item_Of (Case_Item);
exit Case_Item_Loop;
end if;
Choice_String :=
Next_Literal_String (Choice_String);
end loop Choice_Loop;
Case_Item := Next_Case_Item (Case_Item);
end loop Case_Item_Loop;
-- If there is an alternative, then we process it
if Decl_Item /= Empty_Node then
Process_Declarative_Items
(Project => Project,
From_Project_Node => From_Project_Node,
Pkg => Pkg,
Item => Decl_Item);
end if;
end;
when others =>
-- Should never happen
Write_Line ("Illegal declarative item: " &
Project_Node_Kind'Image (Kind_Of (Current_Item)));
raise Program_Error;
end case;
end loop;
end Process_Declarative_Items;
---------------------
-- Recursive_Check --
---------------------
procedure Recursive_Check (Project : Project_Id; Trusted_Mode : Boolean) is
Data : Project_Data;
Imported_Project_List : Project_List := Empty_Project_List;
begin
-- Do nothing if Project is No_Project, or Project has already
-- been marked as checked.
if Project /= No_Project
and then not Projects.Table (Project).Checked
then
-- Mark project as checked, to avoid infinite recursion in
-- ill-formed trees, where a project imports itself.
Projects.Table (Project).Checked := True;
Data := Projects.Table (Project);
-- Call itself for a possible extended project.
-- (if there is no extended project, then nothing happens).
Recursive_Check (Data.Extends, Trusted_Mode);
-- Call itself for all imported projects
Imported_Project_List := Data.Imported_Projects;
while Imported_Project_List /= Empty_Project_List loop
Recursive_Check
(Project_Lists.Table (Imported_Project_List).Project,
Trusted_Mode);
Imported_Project_List :=
Project_Lists.Table (Imported_Project_List).Next;
end loop;
if Opt.Verbose_Mode then
Write_Str ("Checking project file """);
Write_Str (Get_Name_String (Data.Name));
Write_Line ("""");
end if;
Prj.Nmsc.Ada_Check (Project, Error_Report, Trusted_Mode);
end if;
end Recursive_Check;
-----------------------
-- Recursive_Process --
-----------------------
procedure Recursive_Process
(Project : out Project_Id;
From_Project_Node : Project_Node_Id;
Extended_By : Project_Id)
is
With_Clause : Project_Node_Id;
begin
if From_Project_Node = Empty_Node then
Project := No_Project;
else
declare
Processed_Data : Project_Data := Empty_Project;
Imported : Project_List := Empty_Project_List;
Declaration_Node : Project_Node_Id := Empty_Node;
Name : constant Name_Id :=
Name_Of (From_Project_Node);
begin
Project := Processed_Projects.Get (Name);
if Project /= No_Project then
return;
end if;
Projects.Increment_Last;
Project := Projects.Last;
Processed_Projects.Set (Name, Project);
Processed_Data.Name := Name;
Get_Name_String (Name);
-- If name starts with the virtual prefix, flag the project as
-- being a virtual extending project.
if Name_Len > Virtual_Prefix'Length
and then Name_Buffer (1 .. Virtual_Prefix'Length) =
Virtual_Prefix
then
Processed_Data.Virtual := True;
end if;
Processed_Data.Display_Path_Name :=
Path_Name_Of (From_Project_Node);
Get_Name_String (Processed_Data.Display_Path_Name);
Canonical_Case_File_Name (Name_Buffer (1 .. Name_Len));
Processed_Data.Path_Name := Name_Find;
Processed_Data.Location := Location_Of (From_Project_Node);
Processed_Data.Display_Directory :=
Directory_Of (From_Project_Node);
Get_Name_String (Processed_Data.Display_Directory);
Canonical_Case_File_Name (Name_Buffer (1 .. Name_Len));
Processed_Data.Directory := Name_Find;
Processed_Data.Extended_By := Extended_By;
Processed_Data.Naming := Standard_Naming_Data;
Add_Attributes (Project, Processed_Data.Decl, Attribute_First);
With_Clause := First_With_Clause_Of (From_Project_Node);
while With_Clause /= Empty_Node loop
declare
New_Project : Project_Id;
New_Data : Project_Data;
begin
Recursive_Process
(Project => New_Project,
From_Project_Node => Project_Node_Of (With_Clause),
Extended_By => No_Project);
New_Data := Projects.Table (New_Project);
-- If we were the first project to import it,
-- set First_Referred_By to us.
if New_Data.First_Referred_By = No_Project then
New_Data.First_Referred_By := Project;
Projects.Table (New_Project) := New_Data;
end if;
-- Add this project to our list of imported projects
Project_Lists.Increment_Last;
Project_Lists.Table (Project_Lists.Last) :=
(Project => New_Project, Next => Empty_Project_List);
-- Imported is the id of the last imported project.
-- If it is nil, then this imported project is our first.
if Imported = Empty_Project_List then
Processed_Data.Imported_Projects := Project_Lists.Last;
else
Project_Lists.Table (Imported).Next := Project_Lists.Last;
end if;
Imported := Project_Lists.Last;
With_Clause := Next_With_Clause_Of (With_Clause);
end;
end loop;
Declaration_Node := Project_Declaration_Of (From_Project_Node);
Recursive_Process
(Project => Processed_Data.Extends,
From_Project_Node => Extended_Project_Of (Declaration_Node),
Extended_By => Project);
Projects.Table (Project) := Processed_Data;
Process_Declarative_Items
(Project => Project,
From_Project_Node => From_Project_Node,
Pkg => No_Package,
Item => First_Declarative_Item_Of
(Declaration_Node));
-- If it is an extending project, inherit all packages
-- from the extended project that are not explicitely defined
-- or renamed.
if Processed_Data.Extends /= No_Project then
Processed_Data := Projects.Table (Project);
declare
Extended_Pkg : Package_Id :=
Projects.Table
(Processed_Data.Extends).Decl.Packages;
Current_Pkg : Package_Id;
Element : Package_Element;
First : constant Package_Id :=
Processed_Data.Decl.Packages;
begin
while Extended_Pkg /= No_Package loop
Element := Packages.Table (Extended_Pkg);
Current_Pkg := First;
loop
exit when Current_Pkg = No_Package
or else Packages.Table (Current_Pkg).Name
= Element.Name;
Current_Pkg := Packages.Table (Current_Pkg).Next;
end loop;
if Current_Pkg = No_Package then
Packages.Increment_Last;
Current_Pkg := Packages.Last;
Packages.Table (Current_Pkg) :=
(Name => Element.Name,
Decl => Element.Decl,
Parent => No_Package,
Next => Processed_Data.Decl.Packages);
Processed_Data.Decl.Packages := Current_Pkg;
end if;
Extended_Pkg := Element.Next;
end loop;
end;
Projects.Table (Project) := Processed_Data;
end if;
end;
end if;
end Recursive_Process;
end Prj.Proc;
|