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
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830 | with Ada.Assertions; use Ada.Assertions;
with Ada.Text_IO; use Ada.Text_IO;
with GNATCOLL.GMP.Integers; use GNATCOLL.GMP.Integers;
with Langkit_Support.Text; use Langkit_Support.Text;
with Rejuvenation.Placeholders; use Rejuvenation.Placeholders;
with Rejuvenation.Utils; use Rejuvenation.Utils;
package body Rejuvenation.Match_Patterns is
-- Public: Create match --------
function Match_Full
(MP : out Match_Pattern; Pattern : Ada_Node; Instance : Ada_Node)
return Boolean
is
Pattern_Array, Instance_Array : Ada_Node_Array (1 .. 1);
begin
if Pattern.Is_Null or else Instance.Is_Null then
return False;
else
Pattern_Array (1) := Pattern;
Instance_Array (1) := Instance;
return MP.Match_Full (Pattern_Array, Instance_Array);
end if;
end Match_Full;
function Match_Full
(MP : out Match_Pattern; Pattern : Ada_Node_Array;
Instance : Ada_Node_Array) return Boolean
is
begin
return MP.Match (Pattern, Instance, Instance'First, True, True);
end Match_Full;
function Match_Prefix
(MP : out Match_Pattern; Pattern : Ada_Node_Array;
Instance : Ada_Node_Array; Instance_Start_Index : Integer) return Boolean
is
begin
return MP.Match (Pattern, Instance, Instance_Start_Index, False, True);
end Match_Prefix;
function Are_Identical
(Node1 : Ada_Node'Class; Node2 : Ada_Node'Class) return Boolean
is
MP : Match_Pattern;
Success : constant Boolean :=
MP.Match_Full (Node1.As_Ada_Node, Node2.As_Ada_Node);
begin
if not MP.Mapping_Single.Is_Empty
or else not MP.Mapping_Multiple.Is_Empty
then
raise Unsupported_Placeholder_Exception;
end if;
return Success;
end Are_Identical;
-- Public: Inspect match --------
function Get_Nodes (MP : Match_Pattern) return Node_List.Vector is
begin
return MP.Nodes;
end Get_Nodes;
function Has_Single
(MP : Match_Pattern; Placeholder_Name : String) return Boolean
is
begin
return MP.Mapping_Single.Contains (Placeholder_Name);
end Has_Single;
function Get_Single_As_Node
(MP : Match_Pattern; Placeholder_Name : String) return Ada_Node
is
begin
if not MP.Mapping_Single.Contains (Placeholder_Name) then
Dump_Partial_Match (MP);
end if;
Assert
(Check => MP.Mapping_Single.Contains (Placeholder_Name),
Message => "Mapping_Single doesn't contain " & Placeholder_Name);
return MP.Mapping_Single.Element (Placeholder_Name);
end Get_Single_As_Node;
function Get_Single_As_Raw_Signature
(MP : Match_Pattern; Placeholder_Name : String) return String
is
Node : constant Ada_Node := MP.Get_Single_As_Node (Placeholder_Name);
begin
return Raw_Signature (Node);
end Get_Single_As_Raw_Signature;
function Has_Multiple
(MP : Match_Pattern; Placeholder_Name : String) return Boolean
is
begin
return MP.Mapping_Multiple.Contains (Placeholder_Name);
end Has_Multiple;
function Get_Multiple_As_Nodes
(MP : Match_Pattern; Placeholder_Name : String) return Node_List.Vector
is
begin
return MP.Mapping_Multiple.Element (Placeholder_Name);
end Get_Multiple_As_Nodes;
function Get_Multiple_As_Raw_Signature
(MP : Match_Pattern; Placeholder_Name : String) return String
is
Nodes : constant Node_List.Vector :=
Get_Multiple_As_Nodes (MP, Placeholder_Name);
begin
if Nodes.Length = 0 then
return "";
else
declare
First_Node : constant Ada_Node := Nodes.First_Element;
Last_Node : constant Ada_Node := Nodes.Last_Element;
FirstToken : constant Token_Reference := First_Node.Token_Start;
LastToken : constant Token_Reference := Last_Node.Token_End;
Unit : constant Analysis_Unit := First_Node.Unit;
First : constant Integer := Raw_Data (FirstToken).Source_First;
Last : constant Integer := Raw_Data (LastToken).Source_Last;
begin
return Encode (Unit.Text (First .. Last), Unit.Get_Charset);
end;
end if;
end Get_Multiple_As_Raw_Signature;
function Get_Placeholder_As_Nodes
(MP : Match_Pattern; Placeholder_Name : String) return Node_List.Vector
is
begin
if Is_Single_Placeholder_Name (Placeholder_Name) then
return
Node_List.To_Vector (Get_Single_As_Node (MP, Placeholder_Name), 1);
else
Assert
(Check => Is_Multiple_Placeholder_Name (Placeholder_Name),
Message =>
"Illegal Placeholder_Name [not (single or multiple)] : " &
Placeholder_Name);
return Get_Multiple_As_Nodes (MP, Placeholder_Name);
end if;
end Get_Placeholder_As_Nodes;
function Get_Placeholder_As_Raw_Signature
(MP : Match_Pattern; Placeholder_Name : String) return String
is
begin
if Is_Single_Placeholder_Name (Placeholder_Name) then
return Get_Single_As_Raw_Signature (MP, Placeholder_Name);
else
Assert
(Check => Is_Multiple_Placeholder_Name (Placeholder_Name),
Message =>
"Illegal Placeholder_Name [not (single or multiple)] : " &
Placeholder_Name);
return Get_Multiple_As_Raw_Signature (MP, Placeholder_Name);
end if;
end Get_Placeholder_As_Raw_Signature;
-- Private: Multiple_Placeholder_Status --------
function Is_Open (MPS : Multiple_Placeholder_Status) return Boolean is
begin
return MPS.Ongoing_Multiple;
end Is_Open;
procedure Open
(MPS : in out Multiple_Placeholder_Status; MP : Match_Pattern;
Placeholder_Node : Ada_Node)
is
begin
if Is_Open (MPS) then
raise Invalid_Multiple_Placeholder_Status_Exception;
end if;
MPS.Ongoing_Multiple := True;
MPS.Multiple_PlaceHolder_Name := Placeholder_Node;
MPS.Multiple_Placeholder_Nodes.Clear;
MPS.Has_Earlier_Multiple_Placeholder_Nodes :=
MP.Mapping_Multiple.Contains
(Get_Placeholder_Name (MPS.Multiple_PlaceHolder_Name));
if MPS.Has_Earlier_Multiple_Placeholder_Nodes then
MPS.Earlier_Multiple_Placeholder_Nodes :=
MP.Mapping_Multiple.Element
(Get_Placeholder_Name (MPS.Multiple_PlaceHolder_Name));
end if;
end Open;
procedure Close
(MPS : in out Multiple_Placeholder_Status; MP : in out Match_Pattern)
is
begin
if not Is_Open (MPS) then
raise Invalid_Multiple_Placeholder_Status_Exception;
end if;
if MPS.Has_Earlier_Multiple_Placeholder_Nodes
and then MPS.Earlier_Multiple_Placeholder_Nodes.Length /=
MPS.Multiple_Placeholder_Nodes.Length
then
raise Inconsistent_Placeholder_Values_Exception
with Get_Placeholder_Name (MPS.Multiple_PlaceHolder_Name);
else
MP.Mapping_Multiple.Include
(Get_Placeholder_Name (MPS.Multiple_PlaceHolder_Name),
MPS.Multiple_Placeholder_Nodes);
MPS.Ongoing_Multiple := False;
end if;
end Close;
procedure Update
(MPS : in out Multiple_Placeholder_Status; Instance_Node : Ada_Node)
is
begin
if not Is_Open (MPS) then
raise Invalid_Multiple_Placeholder_Status_Exception;
end if;
if MPS.Has_Earlier_Multiple_Placeholder_Nodes then
declare
MP : Match_Pattern;
begin
if MPS.Earlier_Multiple_Placeholder_Nodes.Length <=
MPS.Multiple_Placeholder_Nodes.Length
or else not Match_Full
(MP,
MPS.Earlier_Multiple_Placeholder_Nodes.Element
(Integer (MPS.Multiple_Placeholder_Nodes.Length + 1)),
Instance_Node)
then
raise Inconsistent_Placeholder_Values_Exception
with Get_Placeholder_Name (MPS.Multiple_PlaceHolder_Name) &
" at " & Instance_Node.Image;
end if;
end;
end if;
MPS.Multiple_Placeholder_Nodes.Append (Instance_Node);
end Update;
-- Private: Create match --------
function Has_Nested_Match_Full
(MP : Match_Pattern; Pattern : Ada_Node; Instance : Ada_Node)
return Boolean
is
Nested_MP : Match_Pattern;
begin
for E in MP.Mapping_Single.Iterate loop
Nested_MP.Mapping_Single.Include
(Mapping_Single_Map.Key (E), Mapping_Single_Map.Element (E));
end loop;
for E in MP.Mapping_Multiple.Iterate loop
Nested_MP.Mapping_Multiple.Include
(Mapping_Multiple_Map.Key (E), Mapping_Multiple_Map.Element (E));
end loop;
return Nested_MP.Match (Pattern, Instance);
exception
when Inconsistent_Placeholder_Values_Exception =>
return False;
end Has_Nested_Match_Full;
function Match
(MP : in out Match_Pattern; Pattern : Ada_Node_Array;
Instance : Ada_Node_Array; Instance_Start_Index : Integer;
Pattern_Must_Cover_End_Of_Instance : Boolean; Store_Nodes : Boolean)
return Boolean
is
Dummy : Boolean;
Instance_Index : Integer := Instance_Start_Index;
MPS : Multiple_Placeholder_Status;
begin
for Pattern_Index in Pattern'Range loop
if Is_Multiple_Placeholder (Pattern (Pattern_Index)) then
-- CASE: current pattern node IS a multiple placeholder
if Is_Open (MPS) then
Close (MPS, MP);
end if;
Open (MPS, MP, Pattern (Pattern_Index));
else
declare
Old_Diagnose : constant Boolean := DIAGNOSE;
begin
DIAGNOSE := False;
if Is_Open (MPS) then
-- CASE: previous pattern node IS a multiple placeholder,
-- and current pattern node IS NOT a multiple placeholder
-- Interpret instance nodes that do not match the current pattern node as part
-- of the previous multiple placeholder
while Instance_Index <= Instance'Last
and then not Has_Nested_Match_Full
(MP, Pattern (Pattern_Index), Instance (Instance_Index))
loop
Update (MPS, Instance (Instance_Index));
Instance_Index := Instance_Index + 1;
end loop;
Close (MPS, MP);
else
-- CASE: previous pattern node IS NOT a multiple placeholder, and current
-- pattern node IS NOT a multiple placeholder
null;
end if;
DIAGNOSE := Old_Diagnose;
end;
if Instance_Index <= Instance'Last
and then MP.Has_Nested_Match_Full
(Pattern (Pattern_Index), Instance (Instance_Index))
then
Dummy :=
MP.Match (Pattern (Pattern_Index), Instance (Instance_Index));
Instance_Index := Instance_Index + 1;
else
if DIAGNOSE and then Instance_Index > Instance'Last then
MP.Dump_Partial_Match;
Put_Line (Standard_Error, "Superfluous node in pattern:");
Put_Line
(Standard_Error,
"* Pattern " & Pattern (Pattern_Index).Image & ": " &
Raw_Signature (Pattern (Pattern_Index)));
end if;
return False;
end if;
end if;
end loop;
if Is_Open (MPS) then
-- CASE: last pattern node IS a multiple placeholder
-- Interpret instance nodes as part of the last multiple placeholder
while Instance_Index <= Instance'Last loop
Update (MPS, Instance (Instance_Index));
Instance_Index := Instance_Index + 1;
end loop;
Close (MPS, MP);
end if;
-- Check whether the instance is longer than the pattern
if not Pattern_Must_Cover_End_Of_Instance
or else Instance_Index > Instance'Last
then
if Store_Nodes then
for Index in Instance_Start_Index .. Instance_Index - 1 loop
MP.Nodes.Append (Instance (Index));
end loop;
end if;
return True;
else
if DIAGNOSE then
MP.Dump_Partial_Match;
Put_Line (Standard_Error, "Superfluous node in instance:");
Put_Line
(Standard_Error,
"* Instance " & Instance (Instance_Index).Image & ": " &
Raw_Signature (Instance (Instance_Index)));
end if;
return False;
end if;
end Match;
function Match
(MP : in out Match_Pattern; Pattern : Ada_Node'Class;
Instance : Ada_Node'Class) return Boolean
is
begin
if Pattern.Is_Null and then Instance.Is_Null then
return True;
elsif Pattern.Is_Null then
if DIAGNOSE then
MP.Dump_Partial_Match;
Put_Line (Standard_Error, "Superfluous node in instance:");
Put_Line
(Standard_Error,
"* Instance " & Instance.Image & ": " &
Raw_Signature (Instance));
end if;
return False;
elsif Instance.Is_Null and then Is_Single_Placeholder (Pattern) then
if DIAGNOSE then
MP.Dump_Partial_Match;
Put_Line (Standard_Error, "Superfluous node in single pattern:");
Put_Line
(Standard_Error,
"* Pattern " & Pattern.Image & ": " & Raw_Signature (Pattern));
end if;
return False;
end if;
declare
Success : Boolean;
begin
if Is_Single_Placeholder (Pattern) then
Assert
(Check => not Instance.Is_Null,
Message => "For single plaeholder: Instance can't be null");
Success := MP.Match_Single_Placeholder (Pattern, Instance);
elsif Is_Multiple_Placeholder (Pattern) then
Success := MP.Match_Multiple_Placeholder (Pattern, Instance);
else
if Instance.Is_Null then
if Pattern.Kind /= Ada_Aspect_Spec then
if DIAGNOSE then
MP.Dump_Partial_Match;
Put_Line (Standard_Error, "Superfluous node in pattern:");
Put_Line
(Standard_Error,
"* Pattern " & Pattern.Image & ": " &
Raw_Signature (Pattern));
end if;
return False;
end if;
declare
A_S : constant Aspect_Spec := Pattern.As_Aspect_Spec;
Empty_Ada_Node_Array : constant Ada_Node_Array (1 .. 0) :=
(others => No_Ada_Node);
begin
Success :=
MP.Match
(A_S.F_Aspect_Assocs.Children, Empty_Ada_Node_Array, 1,
True, False);
end;
else
Success := MP.Match_Specific (Pattern, Instance);
end if;
end if;
if not Success then
if DIAGNOSE then
if Pattern.Kind = Instance.Kind then
Put_Line
(Standard_Error,
"Incompatible pattern and instance of the same kind:");
else
Put_Line
(Standard_Error,
"Incompatible pattern and instance kinds:");
end if;
Put_Line
(Standard_Error,
"* Pattern " & Pattern.Image & ": " &
Raw_Signature (Pattern));
Put_Line
(Standard_Error,
"* Instance " & Instance.Image & ": " &
Raw_Signature (Instance));
end if;
end if;
return Success;
end;
end Match;
function Match_Multiple_Placeholder
(MP : in out Match_Pattern; Pattern : Ada_Node'Class;
Instance : Ada_Node'Class) return Boolean
is
Placeholder_Name : constant String := Get_Placeholder_Name (Pattern);
Instance_Vector : constant Node_List.Vector :=
(if Instance.Is_Null then Node_List.Empty_Vector
else Node_List.To_Vector (Ada_Node (Instance), 1));
begin
if MP.Has_Multiple (Placeholder_Name) then
declare
Earlier_Mapping : constant Node_List.Vector :=
MP.Get_Multiple_As_Nodes (Placeholder_Name);
InnerMP : Match_Pattern;
begin
if Earlier_Mapping.Length /= Instance_Vector.Length
or else
(for some I in 1 .. Natural (Instance_Vector.Length) =>
not Match_Full
(InnerMP, Earlier_Mapping.Element (I),
Instance_Vector.Element (I)))
then
raise Inconsistent_Placeholder_Values_Exception;
end if;
end;
else
MP.Mapping_Multiple.Include (Placeholder_Name, Instance_Vector);
end if;
return True;
end Match_Multiple_Placeholder;
function Match_Single_Placeholder
(MP : in out Match_Pattern; Pattern : Ada_Node'Class;
Instance : Ada_Node'Class) return Boolean
is
function Disambiguate_Node (Node : Ada_Node) return Ada_Node;
-- The same Ada code can be interpreted as different Nodes
-- e.g. an defining name and an indentifier
-- for pattern matching (to match definitions to references)
-- we select a unique [shallow] representation
function Disambiguate_Node (Node : Ada_Node) return Ada_Node is
begin
if Node.Is_Null or else Node.Kind not in Ada_Defining_Name then
return Node;
else
return Node.First_Child;
end if;
end Disambiguate_Node;
Placeholder_Name : constant String := Get_Placeholder_Name (Pattern);
begin
if MP.Has_Single (Placeholder_Name) then
declare
Earlier_Mapping : constant Ada_Node :=
MP.Get_Single_As_Node (Placeholder_Name);
InnerMP : Match_Pattern;
begin
if not Match_Full
(InnerMP, Disambiguate_Node (Earlier_Mapping),
Disambiguate_Node (Instance.As_Ada_Node))
then
raise Inconsistent_Placeholder_Values_Exception;
end if;
end;
else
MP.Mapping_Single.Include (Placeholder_Name, Ada_Node (Instance));
end if;
return True;
end Match_Single_Placeholder;
function filter (Node : Ada_Node) return Ada_Node_Array;
function filter (Node : Ada_Node) return Ada_Node_Array is
begin
if Node.Kind = Ada_Composite_Constraint then
return Node.As_Composite_Constraint.F_Constraints.Children;
else
return (1 => Node);
end if;
end filter;
function Match_Specific
(MP : in out Match_Pattern; Pattern : Ada_Node'Class;
Instance : Ada_Node'Class) return Boolean
is
begin
if Pattern.Kind = Ada_Composite_Constraint
or else Instance.Kind = Ada_Composite_Constraint
then
declare
filtered_Pattern : constant Ada_Node_Array :=
filter (Pattern.As_Ada_Node);
filtered_Instance : constant Ada_Node_Array :=
filter (Instance.As_Ada_Node);
begin
return
MP.Match
(filtered_Pattern, filtered_Instance, filtered_Instance'First,
True, False);
end;
end if;
if Pattern.Kind /= Instance.Kind then
return False;
-- Begin of generated fragment using Rejuvenation_Lib_Generator --------
elsif Pattern.Kind = Ada_Protected_Type_Decl then
declare
Pattern2 : constant Protected_Type_Decl :=
Pattern.As_Protected_Type_Decl;
Instance2 : constant Protected_Type_Decl :=
Instance.As_Protected_Type_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Discriminants, Instance2.F_Discriminants)
and then MP.Match (Pattern2.F_Interfaces, Instance2.F_Interfaces)
and then MP.Match
(Pattern2.F_Definition, Instance2.F_Definition);
end;
elsif Pattern.Kind = Ada_Abstract_Formal_Subp_Decl then
declare
Pattern2 : constant Abstract_Formal_Subp_Decl :=
Pattern.As_Abstract_Formal_Subp_Decl;
Instance2 : constant Abstract_Formal_Subp_Decl :=
Instance.As_Abstract_Formal_Subp_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Overriding, Instance2.F_Overriding)
and then MP.Match (Pattern2.F_Subp_Spec, Instance2.F_Subp_Spec)
and then MP.Match
(Pattern2.F_Default_Expr, Instance2.F_Default_Expr);
end;
elsif Pattern.Kind = Ada_Variant_Part then
declare
Pattern2 : constant Variant_Part := Pattern.As_Variant_Part;
Instance2 : constant Variant_Part := Instance.As_Variant_Part;
begin
return
MP.Match (Pattern2.F_Discr_Name, Instance2.F_Discr_Name)
and then MP.Match (Pattern2.F_Variant, Instance2.F_Variant);
end;
elsif Pattern.Kind = Ada_Paren_Abstract_State_Decl then
declare
Pattern2 : constant Paren_Abstract_State_Decl :=
Pattern.As_Paren_Abstract_State_Decl;
Instance2 : constant Paren_Abstract_State_Decl :=
Instance.As_Paren_Abstract_State_Decl;
begin
return MP.Match (Pattern2.F_Decl, Instance2.F_Decl);
end;
elsif Pattern.Kind = Ada_Case_Stmt_Alternative then
declare
Pattern2 : constant Case_Stmt_Alternative :=
Pattern.As_Case_Stmt_Alternative;
Instance2 : constant Case_Stmt_Alternative :=
Instance.As_Case_Stmt_Alternative;
begin
return
MP.Match (Pattern2.F_Choices, Instance2.F_Choices)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts);
end;
elsif Pattern.Kind = Ada_Generic_Formal_Package then
declare
Pattern2 : constant Generic_Formal_Package :=
Pattern.As_Generic_Formal_Package;
Instance2 : constant Generic_Formal_Package :=
Instance.As_Generic_Formal_Package;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Decl, Instance2.F_Decl);
end;
elsif Pattern.Kind = Ada_Anonymous_Type then
declare
Pattern2 : constant Anonymous_Type := Pattern.As_Anonymous_Type;
Instance2 : constant Anonymous_Type := Instance.As_Anonymous_Type;
begin
return MP.Match (Pattern2.F_Type_Decl, Instance2.F_Type_Decl);
end;
elsif Pattern.Kind = Ada_Type_Access_Def then
declare
Pattern2 : constant Type_Access_Def := Pattern.As_Type_Access_Def;
Instance2 : constant Type_Access_Def :=
Instance.As_Type_Access_Def;
begin
return
MP.Match (Pattern2.F_Has_Not_Null, Instance2.F_Has_Not_Null)
and then MP.Match (Pattern2.F_Has_All, Instance2.F_Has_All)
and then MP.Match
(Pattern2.F_Has_Constant, Instance2.F_Has_Constant)
and then MP.Match
(Pattern2.F_Subtype_Indication,
Instance2.F_Subtype_Indication);
end;
elsif Pattern.Kind = Ada_Composite_Constraint then
declare
Pattern2 : constant Composite_Constraint :=
Pattern.As_Composite_Constraint;
Instance2 : constant Composite_Constraint :=
Instance.As_Composite_Constraint;
begin
return MP.Match (Pattern2.F_Constraints, Instance2.F_Constraints);
end;
elsif Pattern.Kind = Ada_Aggregate_Assoc then
declare
Pattern2 : constant Aggregate_Assoc := Pattern.As_Aggregate_Assoc;
Instance2 : constant Aggregate_Assoc :=
Instance.As_Aggregate_Assoc;
begin
return
MP.Match (Pattern2.F_Designators, Instance2.F_Designators)
and then MP.Match (Pattern2.F_R_Expr, Instance2.F_R_Expr);
end;
elsif Pattern.Kind = Ada_Discrete_Subtype_Name then
declare
Pattern2 : constant Discrete_Subtype_Name :=
Pattern.As_Discrete_Subtype_Name;
Instance2 : constant Discrete_Subtype_Name :=
Instance.As_Discrete_Subtype_Name;
begin
return MP.Match (Pattern2.F_Subtype, Instance2.F_Subtype);
end;
elsif Pattern.Kind = Ada_Error_Decl then
declare
Pattern2 : constant Error_Decl := Pattern.As_Error_Decl;
Instance2 : constant Error_Decl := Instance.As_Error_Decl;
begin
return MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects);
end;
elsif Pattern.Kind = Ada_Incomplete_Type_Decl then
declare
Pattern2 : constant Incomplete_Type_Decl :=
Pattern.As_Incomplete_Type_Decl;
Instance2 : constant Incomplete_Type_Decl :=
Instance.As_Incomplete_Type_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Discriminants, Instance2.F_Discriminants);
end;
elsif Pattern.Kind = Ada_Case_Expr_Alternative then
declare
Pattern2 : constant Case_Expr_Alternative :=
Pattern.As_Case_Expr_Alternative;
Instance2 : constant Case_Expr_Alternative :=
Instance.As_Case_Expr_Alternative;
begin
return
MP.Match (Pattern2.F_Choices, Instance2.F_Choices)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Anonymous_Type_Decl then
declare
Pattern2 : constant Anonymous_Type_Decl :=
Pattern.As_Anonymous_Type_Decl;
Instance2 : constant Anonymous_Type_Decl :=
Instance.As_Anonymous_Type_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Discriminants, Instance2.F_Discriminants)
and then MP.Match (Pattern2.F_Type_Def, Instance2.F_Type_Def);
end;
elsif Pattern.Kind = Ada_Synthetic_Char_Enum_Lit then
declare
Pattern2 : constant Synthetic_Char_Enum_Lit :=
Pattern.As_Synthetic_Char_Enum_Lit;
Instance2 : constant Synthetic_Char_Enum_Lit :=
Instance.As_Synthetic_Char_Enum_Lit;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_Generic_Subp_Instantiation then
declare
Pattern2 : constant Generic_Subp_Instantiation :=
Pattern.As_Generic_Subp_Instantiation;
Instance2 : constant Generic_Subp_Instantiation :=
Instance.As_Generic_Subp_Instantiation;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Overriding, Instance2.F_Overriding)
and then MP.Match (Pattern2.F_Kind, Instance2.F_Kind)
and then MP.Match (Pattern2.F_Subp_Name, Instance2.F_Subp_Name)
and then MP.Match
(Pattern2.F_Generic_Subp_Name, Instance2.F_Generic_Subp_Name)
and then MP.Match (Pattern2.F_Params, Instance2.F_Params);
end;
elsif Pattern.Kind = Ada_Decl_Expr then
declare
Pattern2 : constant Decl_Expr := Pattern.As_Decl_Expr;
Instance2 : constant Decl_Expr := Instance.As_Decl_Expr;
begin
return
MP.Match (Pattern2.F_Decls, Instance2.F_Decls)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Decimal_Fixed_Point_Def then
declare
Pattern2 : constant Decimal_Fixed_Point_Def :=
Pattern.As_Decimal_Fixed_Point_Def;
Instance2 : constant Decimal_Fixed_Point_Def :=
Instance.As_Decimal_Fixed_Point_Def;
begin
return
MP.Match (Pattern2.F_Delta, Instance2.F_Delta)
and then MP.Match (Pattern2.F_Digits, Instance2.F_Digits)
and then MP.Match (Pattern2.F_Range, Instance2.F_Range);
end;
elsif Pattern.Kind = Ada_Protected_Body then
declare
Pattern2 : constant Protected_Body := Pattern.As_Protected_Body;
Instance2 : constant Protected_Body := Instance.As_Protected_Body;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match (Pattern2.F_Decls, Instance2.F_Decls)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Call_Expr then
declare
Pattern2 : constant Call_Expr := Pattern.As_Call_Expr;
Instance2 : constant Call_Expr := Instance.As_Call_Expr;
begin
return
MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match (Pattern2.F_Suffix, Instance2.F_Suffix);
end;
elsif Pattern.Kind = Ada_Named_Stmt_Decl then
declare
Pattern2 : constant Named_Stmt_Decl := Pattern.As_Named_Stmt_Decl;
Instance2 : constant Named_Stmt_Decl :=
Instance.As_Named_Stmt_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_While_Loop_Stmt then
declare
Pattern2 : constant While_Loop_Stmt := Pattern.As_While_Loop_Stmt;
Instance2 : constant While_Loop_Stmt :=
Instance.As_While_Loop_Stmt;
begin
return
MP.Match (Pattern2.F_Spec, Instance2.F_Spec)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Concat_Operand then
declare
Pattern2 : constant Concat_Operand := Pattern.As_Concat_Operand;
Instance2 : constant Concat_Operand := Instance.As_Concat_Operand;
begin
return
MP.Match (Pattern2.F_Operator, Instance2.F_Operator)
and then MP.Match (Pattern2.F_Operand, Instance2.F_Operand);
end;
elsif Pattern.Kind = Ada_Task_Body_Stub then
declare
Pattern2 : constant Task_Body_Stub := Pattern.As_Task_Body_Stub;
Instance2 : constant Task_Body_Stub := Instance.As_Task_Body_Stub;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_Subtype_Decl then
declare
Pattern2 : constant Subtype_Decl := Pattern.As_Subtype_Decl;
Instance2 : constant Subtype_Decl := Instance.As_Subtype_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match (Pattern2.F_Subtype, Instance2.F_Subtype);
end;
elsif Pattern.Kind = Ada_Subp_Spec then
declare
Pattern2 : constant Subp_Spec := Pattern.As_Subp_Spec;
Instance2 : constant Subp_Spec := Instance.As_Subp_Spec;
begin
return
MP.Match (Pattern2.F_Subp_Kind, Instance2.F_Subp_Kind)
and then MP.Match (Pattern2.F_Subp_Name, Instance2.F_Subp_Name)
and then MP.Match
(Pattern2.F_Subp_Params, Instance2.F_Subp_Params)
and then MP.Match
(Pattern2.F_Subp_Returns, Instance2.F_Subp_Returns);
end;
elsif Pattern.Kind = Ada_Package_Body then
declare
Pattern2 : constant Package_Body := Pattern.As_Package_Body;
Instance2 : constant Package_Body := Instance.As_Package_Body;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match
(Pattern2.F_Package_Name, Instance2.F_Package_Name)
and then MP.Match (Pattern2.F_Decls, Instance2.F_Decls)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Iterated_Assoc then
declare
Pattern2 : constant Iterated_Assoc := Pattern.As_Iterated_Assoc;
Instance2 : constant Iterated_Assoc := Instance.As_Iterated_Assoc;
begin
return
MP.Match (Pattern2.F_Spec, Instance2.F_Spec)
and then MP.Match (Pattern2.F_R_Expr, Instance2.F_R_Expr);
end;
elsif Pattern.Kind = Ada_Anonymous_Type_Access_Def then
declare
Pattern2 : constant Anonymous_Type_Access_Def :=
Pattern.As_Anonymous_Type_Access_Def;
Instance2 : constant Anonymous_Type_Access_Def :=
Instance.As_Anonymous_Type_Access_Def;
begin
return
MP.Match (Pattern2.F_Has_Not_Null, Instance2.F_Has_Not_Null)
and then MP.Match (Pattern2.F_Type_Decl, Instance2.F_Type_Decl);
end;
elsif Pattern.Kind = Ada_Enum_Type_Def then
declare
Pattern2 : constant Enum_Type_Def := Pattern.As_Enum_Type_Def;
Instance2 : constant Enum_Type_Def := Instance.As_Enum_Type_Def;
begin
return
MP.Match (Pattern2.F_Enum_Literals, Instance2.F_Enum_Literals);
end;
elsif Pattern.Kind = Ada_Delta_Constraint then
declare
Pattern2 : constant Delta_Constraint :=
Pattern.As_Delta_Constraint;
Instance2 : constant Delta_Constraint :=
Instance.As_Delta_Constraint;
begin
return
MP.Match (Pattern2.F_Digits, Instance2.F_Digits)
and then MP.Match (Pattern2.F_Range, Instance2.F_Range);
end;
elsif Pattern.Kind = Ada_Interface_Type_Def then
declare
Pattern2 : constant Interface_Type_Def :=
Pattern.As_Interface_Type_Def;
Instance2 : constant Interface_Type_Def :=
Instance.As_Interface_Type_Def;
begin
return
MP.Match (Pattern2.F_Interface_Kind, Instance2.F_Interface_Kind)
and then MP.Match
(Pattern2.F_Interfaces, Instance2.F_Interfaces);
end;
elsif Pattern.Kind = Ada_Label_Decl then
declare
Pattern2 : constant Label_Decl := Pattern.As_Label_Decl;
Instance2 : constant Label_Decl := Instance.As_Label_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_Generic_Subp_Internal then
declare
Pattern2 : constant Generic_Subp_Internal :=
Pattern.As_Generic_Subp_Internal;
Instance2 : constant Generic_Subp_Internal :=
Instance.As_Generic_Subp_Internal;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Subp_Spec, Instance2.F_Subp_Spec);
end;
elsif Pattern.Kind = Ada_Delta_Aggregate then
declare
Pattern2 : constant Delta_Aggregate := Pattern.As_Delta_Aggregate;
Instance2 : constant Delta_Aggregate :=
Instance.As_Delta_Aggregate;
begin
return
MP.Match (Pattern2.F_Ancestor_Expr, Instance2.F_Ancestor_Expr)
and then MP.Match (Pattern2.F_Assocs, Instance2.F_Assocs);
end;
elsif Pattern.Kind = Ada_Entry_Spec then
declare
Pattern2 : constant Entry_Spec := Pattern.As_Entry_Spec;
Instance2 : constant Entry_Spec := Instance.As_Entry_Spec;
begin
return
MP.Match (Pattern2.F_Entry_Name, Instance2.F_Entry_Name)
and then MP.Match
(Pattern2.F_Family_Type, Instance2.F_Family_Type)
and then MP.Match
(Pattern2.F_Entry_Params, Instance2.F_Entry_Params);
end;
elsif Pattern.Kind = Ada_Param_Assoc then
declare
Pattern2 : constant Param_Assoc := Pattern.As_Param_Assoc;
Instance2 : constant Param_Assoc := Instance.As_Param_Assoc;
begin
return
MP.Match (Pattern2.F_Designator, Instance2.F_Designator)
and then MP.Match (Pattern2.F_R_Expr, Instance2.F_R_Expr);
end;
elsif Pattern.Kind = Ada_Generic_Subp_Decl then
declare
Pattern2 : constant Generic_Subp_Decl :=
Pattern.As_Generic_Subp_Decl;
Instance2 : constant Generic_Subp_Decl :=
Instance.As_Generic_Subp_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match
(Pattern2.F_Formal_Part, Instance2.F_Formal_Part)
and then MP.Match (Pattern2.F_Subp_Decl, Instance2.F_Subp_Decl);
end;
elsif Pattern.Kind = Ada_Generic_Package_Renaming_Decl then
declare
Pattern2 : constant Generic_Package_Renaming_Decl :=
Pattern.As_Generic_Package_Renaming_Decl;
Instance2 : constant Generic_Package_Renaming_Decl :=
Instance.As_Generic_Package_Renaming_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match (Pattern2.F_Renames, Instance2.F_Renames);
end;
elsif Pattern.Kind = Ada_Unconstrained_Array_Index then
declare
Pattern2 : constant Unconstrained_Array_Index :=
Pattern.As_Unconstrained_Array_Index;
Instance2 : constant Unconstrained_Array_Index :=
Instance.As_Unconstrained_Array_Index;
begin
return
MP.Match
(Pattern2.F_Subtype_Indication,
Instance2.F_Subtype_Indication);
end;
elsif Pattern.Kind = Ada_Task_Body then
declare
Pattern2 : constant Task_Body := Pattern.As_Task_Body;
Instance2 : constant Task_Body := Instance.As_Task_Body;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match (Pattern2.F_Decls, Instance2.F_Decls)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Package_Decl then
declare
Pattern2 : constant Package_Decl := Pattern.As_Package_Decl;
Instance2 : constant Package_Decl := Instance.As_Package_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match
(Pattern2.F_Package_Name, Instance2.F_Package_Name)
and then MP.Match
(Pattern2.F_Public_Part, Instance2.F_Public_Part)
and then MP.Match
(Pattern2.F_Private_Part, Instance2.F_Private_Part)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Expr_Function then
declare
Pattern2 : constant Expr_Function := Pattern.As_Expr_Function;
Instance2 : constant Expr_Function := Instance.As_Expr_Function;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Overriding, Instance2.F_Overriding)
and then MP.Match (Pattern2.F_Subp_Spec, Instance2.F_Subp_Spec)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Component_Clause then
declare
Pattern2 : constant Component_Clause :=
Pattern.As_Component_Clause;
Instance2 : constant Component_Clause :=
Instance.As_Component_Clause;
begin
return
MP.Match (Pattern2.F_Id, Instance2.F_Id)
and then MP.Match (Pattern2.F_Position, Instance2.F_Position)
and then MP.Match (Pattern2.F_Range, Instance2.F_Range);
end;
elsif Pattern.Kind = Ada_Elsif_Expr_Part then
declare
Pattern2 : constant Elsif_Expr_Part := Pattern.As_Elsif_Expr_Part;
Instance2 : constant Elsif_Expr_Part :=
Instance.As_Elsif_Expr_Part;
begin
return
MP.Match (Pattern2.F_Cond_Expr, Instance2.F_Cond_Expr)
and then MP.Match (Pattern2.F_Then_Expr, Instance2.F_Then_Expr);
end;
elsif Pattern.Kind = Ada_Protected_Def then
declare
Pattern2 : constant Protected_Def := Pattern.As_Protected_Def;
Instance2 : constant Protected_Def := Instance.As_Protected_Def;
begin
return
MP.Match (Pattern2.F_Public_Part, Instance2.F_Public_Part)
and then MP.Match
(Pattern2.F_Private_Part, Instance2.F_Private_Part)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Raise_Stmt then
declare
Pattern2 : constant Raise_Stmt := Pattern.As_Raise_Stmt;
Instance2 : constant Raise_Stmt := Instance.As_Raise_Stmt;
begin
return
MP.Match (Pattern2.F_Exception_Name, Instance2.F_Exception_Name)
and then MP.Match
(Pattern2.F_Error_Message, Instance2.F_Error_Message);
end;
elsif Pattern.Kind = Ada_Un_Op then
declare
Pattern2 : constant Un_Op := Pattern.As_Un_Op;
Instance2 : constant Un_Op := Instance.As_Un_Op;
begin
return
MP.Match (Pattern2.F_Op, Instance2.F_Op)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Null_Record_Aggregate then
declare
Pattern2 : constant Null_Record_Aggregate :=
Pattern.As_Null_Record_Aggregate;
Instance2 : constant Null_Record_Aggregate :=
Instance.As_Null_Record_Aggregate;
begin
return
MP.Match (Pattern2.F_Ancestor_Expr, Instance2.F_Ancestor_Expr)
and then MP.Match (Pattern2.F_Assocs, Instance2.F_Assocs);
end;
elsif Pattern.Kind = Ada_For_Loop_Stmt then
declare
Pattern2 : constant For_Loop_Stmt := Pattern.As_For_Loop_Stmt;
Instance2 : constant For_Loop_Stmt := Instance.As_For_Loop_Stmt;
begin
return
MP.Match (Pattern2.F_Spec, Instance2.F_Spec)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Pragma_Argument_Assoc then
declare
Pattern2 : constant Pragma_Argument_Assoc :=
Pattern.As_Pragma_Argument_Assoc;
Instance2 : constant Pragma_Argument_Assoc :=
Instance.As_Pragma_Argument_Assoc;
begin
return
MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Qual_Expr then
declare
Pattern2 : constant Qual_Expr := Pattern.As_Qual_Expr;
Instance2 : constant Qual_Expr := Instance.As_Qual_Expr;
begin
return
MP.Match (Pattern2.F_Prefix, Instance2.F_Prefix)
and then MP.Match (Pattern2.F_Suffix, Instance2.F_Suffix);
end;
elsif Pattern.Kind = Ada_Aggregate then
declare
Pattern2 : constant Aggregate := Pattern.As_Aggregate;
Instance2 : constant Aggregate := Instance.As_Aggregate;
begin
return
MP.Match (Pattern2.F_Ancestor_Expr, Instance2.F_Ancestor_Expr)
and then MP.Match (Pattern2.F_Assocs, Instance2.F_Assocs);
end;
elsif Pattern.Kind = Ada_Component_Def then
declare
Pattern2 : constant Component_Def := Pattern.As_Component_Def;
Instance2 : constant Component_Def := Instance.As_Component_Def;
begin
return
MP.Match (Pattern2.F_Has_Aliased, Instance2.F_Has_Aliased)
and then MP.Match
(Pattern2.F_Has_Constant, Instance2.F_Has_Constant)
and then MP.Match (Pattern2.F_Type_Expr, Instance2.F_Type_Expr);
end;
elsif Pattern.Kind = Ada_Generic_Formal_Part then
declare
Pattern2 : constant Generic_Formal_Part :=
Pattern.As_Generic_Formal_Part;
Instance2 : constant Generic_Formal_Part :=
Instance.As_Generic_Formal_Part;
begin
return MP.Match (Pattern2.F_Decls, Instance2.F_Decls);
end;
elsif Pattern.Kind = Ada_Generic_Formal_Subp_Decl then
declare
Pattern2 : constant Generic_Formal_Subp_Decl :=
Pattern.As_Generic_Formal_Subp_Decl;
Instance2 : constant Generic_Formal_Subp_Decl :=
Instance.As_Generic_Formal_Subp_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Decl, Instance2.F_Decl);
end;
elsif Pattern.Kind = Ada_Aspect_Assoc then
declare
Pattern2 : constant Aspect_Assoc := Pattern.As_Aspect_Assoc;
Instance2 : constant Aspect_Assoc := Instance.As_Aspect_Assoc;
begin
return
MP.Match (Pattern2.F_Id, Instance2.F_Id)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Multi_Dim_Array_Assoc then
declare
Pattern2 : constant Multi_Dim_Array_Assoc :=
Pattern.As_Multi_Dim_Array_Assoc;
Instance2 : constant Multi_Dim_Array_Assoc :=
Instance.As_Multi_Dim_Array_Assoc;
begin
return
MP.Match (Pattern2.F_Designators, Instance2.F_Designators)
and then MP.Match (Pattern2.F_R_Expr, Instance2.F_R_Expr);
end;
elsif Pattern.Kind = Ada_Anonymous_Expr_Decl then
declare
Pattern2 : constant Anonymous_Expr_Decl :=
Pattern.As_Anonymous_Expr_Decl;
Instance2 : constant Anonymous_Expr_Decl :=
Instance.As_Anonymous_Expr_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Defining_Name then
declare
Pattern2 : constant Defining_Name := Pattern.As_Defining_Name;
Instance2 : constant Defining_Name := Instance.As_Defining_Name;
begin
return MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_Membership_Expr then
declare
Pattern2 : constant Membership_Expr := Pattern.As_Membership_Expr;
Instance2 : constant Membership_Expr :=
Instance.As_Membership_Expr;
begin
return
MP.Match (Pattern2.F_Expr, Instance2.F_Expr)
and then MP.Match (Pattern2.F_Op, Instance2.F_Op)
and then MP.Match
(Pattern2.F_Membership_Exprs, Instance2.F_Membership_Exprs);
end;
elsif Pattern.Kind = Ada_Single_Protected_Decl then
declare
Pattern2 : constant Single_Protected_Decl :=
Pattern.As_Single_Protected_Decl;
Instance2 : constant Single_Protected_Decl :=
Instance.As_Single_Protected_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match (Pattern2.F_Interfaces, Instance2.F_Interfaces)
and then MP.Match
(Pattern2.F_Definition, Instance2.F_Definition);
end;
elsif Pattern.Kind = Ada_Bracket_Delta_Aggregate then
declare
Pattern2 : constant Bracket_Delta_Aggregate :=
Pattern.As_Bracket_Delta_Aggregate;
Instance2 : constant Bracket_Delta_Aggregate :=
Instance.As_Bracket_Delta_Aggregate;
begin
return
MP.Match (Pattern2.F_Ancestor_Expr, Instance2.F_Ancestor_Expr)
and then MP.Match (Pattern2.F_Assocs, Instance2.F_Assocs);
end;
elsif Pattern.Kind = Ada_Digits_Constraint then
declare
Pattern2 : constant Digits_Constraint :=
Pattern.As_Digits_Constraint;
Instance2 : constant Digits_Constraint :=
Instance.As_Digits_Constraint;
begin
return
MP.Match (Pattern2.F_Digits, Instance2.F_Digits)
and then MP.Match (Pattern2.F_Range, Instance2.F_Range);
end;
elsif Pattern.Kind = Ada_Paren_Expr then
declare
Pattern2 : constant Paren_Expr := Pattern.As_Paren_Expr;
Instance2 : constant Paren_Expr := Instance.As_Paren_Expr;
begin
return MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Component_Decl then
declare
Pattern2 : constant Component_Decl := Pattern.As_Component_Decl;
Instance2 : constant Component_Decl := Instance.As_Component_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Ids, Instance2.F_Ids)
and then MP.Match
(Pattern2.F_Component_Def, Instance2.F_Component_Def)
and then MP.Match
(Pattern2.F_Default_Expr, Instance2.F_Default_Expr);
end;
elsif Pattern.Kind = Ada_Case_Stmt then
declare
Pattern2 : constant Case_Stmt := Pattern.As_Case_Stmt;
Instance2 : constant Case_Stmt := Instance.As_Case_Stmt;
begin
return
MP.Match (Pattern2.F_Expr, Instance2.F_Expr)
and then MP.Match (Pattern2.F_Pragmas, Instance2.F_Pragmas)
and then MP.Match
(Pattern2.F_Alternatives, Instance2.F_Alternatives);
end;
elsif Pattern.Kind = Ada_Use_Type_Clause then
declare
Pattern2 : constant Use_Type_Clause := Pattern.As_Use_Type_Clause;
Instance2 : constant Use_Type_Clause :=
Instance.As_Use_Type_Clause;
begin
return
MP.Match (Pattern2.F_Has_All, Instance2.F_Has_All)
and then MP.Match (Pattern2.F_Types, Instance2.F_Types);
end;
elsif Pattern.Kind = Ada_Discriminant_Spec then
declare
Pattern2 : constant Discriminant_Spec :=
Pattern.As_Discriminant_Spec;
Instance2 : constant Discriminant_Spec :=
Instance.As_Discriminant_Spec;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Ids, Instance2.F_Ids)
and then MP.Match (Pattern2.F_Type_Expr, Instance2.F_Type_Expr)
and then MP.Match
(Pattern2.F_Default_Expr, Instance2.F_Default_Expr);
end;
elsif Pattern.Kind = Ada_Formal_Type_Decl then
declare
Pattern2 : constant Formal_Type_Decl :=
Pattern.As_Formal_Type_Decl;
Instance2 : constant Formal_Type_Decl :=
Instance.As_Formal_Type_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Discriminants, Instance2.F_Discriminants)
and then MP.Match (Pattern2.F_Type_Def, Instance2.F_Type_Def)
and then MP.Match
(Pattern2.F_Default_Type, Instance2.F_Default_Type);
end;
elsif Pattern.Kind = Ada_Number_Decl then
declare
Pattern2 : constant Number_Decl := Pattern.As_Number_Decl;
Instance2 : constant Number_Decl := Instance.As_Number_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Ids, Instance2.F_Ids)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Synthetic_Renaming_Clause then
declare
Pattern2 : constant Synthetic_Renaming_Clause :=
Pattern.As_Synthetic_Renaming_Clause;
Instance2 : constant Synthetic_Renaming_Clause :=
Instance.As_Synthetic_Renaming_Clause;
begin
return
MP.Match (Pattern2.F_Renamed_Object, Instance2.F_Renamed_Object);
end;
elsif Pattern.Kind = Ada_Enum_Literal_Decl then
declare
Pattern2 : constant Enum_Literal_Decl :=
Pattern.As_Enum_Literal_Decl;
Instance2 : constant Enum_Literal_Decl :=
Instance.As_Enum_Literal_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_Signed_Int_Type_Def then
declare
Pattern2 : constant Signed_Int_Type_Def :=
Pattern.As_Signed_Int_Type_Def;
Instance2 : constant Signed_Int_Type_Def :=
Instance.As_Signed_Int_Type_Def;
begin
return MP.Match (Pattern2.F_Range, Instance2.F_Range);
end;
elsif Pattern.Kind = Ada_Attribute_Def_Clause then
declare
Pattern2 : constant Attribute_Def_Clause :=
Pattern.As_Attribute_Def_Clause;
Instance2 : constant Attribute_Def_Clause :=
Instance.As_Attribute_Def_Clause;
begin
return
MP.Match (Pattern2.F_Attribute_Expr, Instance2.F_Attribute_Expr)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Compilation_Unit then
declare
Pattern2 : constant Compilation_Unit :=
Pattern.As_Compilation_Unit;
Instance2 : constant Compilation_Unit :=
Instance.As_Compilation_Unit;
begin
return
MP.Match (Pattern2.F_Prelude, Instance2.F_Prelude)
and then MP.Match (Pattern2.F_Body, Instance2.F_Body)
and then MP.Match (Pattern2.F_Pragmas, Instance2.F_Pragmas);
end;
elsif Pattern.Kind = Ada_Param_Spec then
declare
Pattern2 : constant Param_Spec := Pattern.As_Param_Spec;
Instance2 : constant Param_Spec := Instance.As_Param_Spec;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Ids, Instance2.F_Ids)
and then MP.Match
(Pattern2.F_Has_Aliased, Instance2.F_Has_Aliased)
and then MP.Match (Pattern2.F_Mode, Instance2.F_Mode)
and then MP.Match (Pattern2.F_Type_Expr, Instance2.F_Type_Expr)
and then MP.Match
(Pattern2.F_Default_Expr, Instance2.F_Default_Expr);
end;
elsif Pattern.Kind = Ada_Constrained_Array_Indices then
declare
Pattern2 : constant Constrained_Array_Indices :=
Pattern.As_Constrained_Array_Indices;
Instance2 : constant Constrained_Array_Indices :=
Instance.As_Constrained_Array_Indices;
begin
return MP.Match (Pattern2.F_List, Instance2.F_List);
end;
elsif Pattern.Kind = Ada_Entry_Index_Spec then
declare
Pattern2 : constant Entry_Index_Spec :=
Pattern.As_Entry_Index_Spec;
Instance2 : constant Entry_Index_Spec :=
Instance.As_Entry_Index_Spec;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Id, Instance2.F_Id)
and then MP.Match (Pattern2.F_Subtype, Instance2.F_Subtype);
end;
elsif Pattern.Kind = Ada_Multi_Abstract_State_Decl then
declare
Pattern2 : constant Multi_Abstract_State_Decl :=
Pattern.As_Multi_Abstract_State_Decl;
Instance2 : constant Multi_Abstract_State_Decl :=
Instance.As_Multi_Abstract_State_Decl;
begin
return MP.Match (Pattern2.F_Decls, Instance2.F_Decls);
end;
elsif Pattern.Kind = Ada_Renaming_Clause then
declare
Pattern2 : constant Renaming_Clause := Pattern.As_Renaming_Clause;
Instance2 : constant Renaming_Clause :=
Instance.As_Renaming_Clause;
begin
return
MP.Match (Pattern2.F_Renamed_Object, Instance2.F_Renamed_Object);
end;
elsif Pattern.Kind = Ada_Private_Type_Def then
declare
Pattern2 : constant Private_Type_Def :=
Pattern.As_Private_Type_Def;
Instance2 : constant Private_Type_Def :=
Instance.As_Private_Type_Def;
begin
return
MP.Match (Pattern2.F_Has_Abstract, Instance2.F_Has_Abstract)
and then MP.Match (Pattern2.F_Has_Tagged, Instance2.F_Has_Tagged)
and then MP.Match
(Pattern2.F_Has_Limited, Instance2.F_Has_Limited);
end;
elsif Pattern.Kind = Ada_If_Expr then
declare
Pattern2 : constant If_Expr := Pattern.As_If_Expr;
Instance2 : constant If_Expr := Instance.As_If_Expr;
begin
return
MP.Match (Pattern2.F_Cond_Expr, Instance2.F_Cond_Expr)
and then MP.Match (Pattern2.F_Then_Expr, Instance2.F_Then_Expr)
and then MP.Match
(Pattern2.F_Alternatives, Instance2.F_Alternatives)
and then MP.Match (Pattern2.F_Else_Expr, Instance2.F_Else_Expr);
end;
elsif Pattern.Kind = Ada_Declarative_Part then
declare
Pattern2 : constant Declarative_Part :=
Pattern.As_Declarative_Part;
Instance2 : constant Declarative_Part :=
Instance.As_Declarative_Part;
begin
return MP.Match (Pattern2.F_Decls, Instance2.F_Decls);
end;
elsif Pattern.Kind = Ada_Handled_Stmts then
declare
Pattern2 : constant Handled_Stmts := Pattern.As_Handled_Stmts;
Instance2 : constant Handled_Stmts := Instance.As_Handled_Stmts;
begin
return
MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts)
and then MP.Match
(Pattern2.F_Exceptions, Instance2.F_Exceptions);
end;
elsif Pattern.Kind = Ada_Params then
declare
Pattern2 : constant Params := Pattern.As_Params;
Instance2 : constant Params := Instance.As_Params;
begin
return MP.Match (Pattern2.F_Params, Instance2.F_Params);
end;
elsif Pattern.Kind = Ada_Loop_Stmt then
declare
Pattern2 : constant Loop_Stmt := Pattern.As_Loop_Stmt;
Instance2 : constant Loop_Stmt := Instance.As_Loop_Stmt;
begin
return
MP.Match (Pattern2.F_Spec, Instance2.F_Spec)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Synthetic_Formal_Param_Decl then
declare
Pattern2 : constant Synthetic_Formal_Param_Decl :=
Pattern.As_Synthetic_Formal_Param_Decl;
Instance2 : constant Synthetic_Formal_Param_Decl :=
Instance.As_Synthetic_Formal_Param_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match
(Pattern2.F_Param_Type, Instance2.F_Param_Type);
end;
elsif Pattern.Kind = Ada_Subtype_Indication then
declare
Pattern2 : constant Subtype_Indication :=
Pattern.As_Subtype_Indication;
Instance2 : constant Subtype_Indication :=
Instance.As_Subtype_Indication;
begin
return
MP.Match (Pattern2.F_Has_Not_Null, Instance2.F_Has_Not_Null)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Constraint, Instance2.F_Constraint);
end;
elsif Pattern.Kind = Ada_Classwide_Type_Decl then
declare
Pattern2 : constant Classwide_Type_Decl :=
Pattern.As_Classwide_Type_Decl;
Instance2 : constant Classwide_Type_Decl :=
Instance.As_Classwide_Type_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_Exit_Stmt then
declare
Pattern2 : constant Exit_Stmt := Pattern.As_Exit_Stmt;
Instance2 : constant Exit_Stmt := Instance.As_Exit_Stmt;
begin
return
MP.Match (Pattern2.F_Loop_Name, Instance2.F_Loop_Name)
and then MP.Match (Pattern2.F_Cond_Expr, Instance2.F_Cond_Expr);
end;
elsif Pattern.Kind = Ada_Enum_Rep_Clause then
declare
Pattern2 : constant Enum_Rep_Clause := Pattern.As_Enum_Rep_Clause;
Instance2 : constant Enum_Rep_Clause :=
Instance.As_Enum_Rep_Clause;
begin
return
MP.Match (Pattern2.F_Type_Name, Instance2.F_Type_Name)
and then MP.Match (Pattern2.F_Aggregate, Instance2.F_Aggregate);
end;
elsif Pattern.Kind = Ada_Derived_Type_Def then
declare
Pattern2 : constant Derived_Type_Def :=
Pattern.As_Derived_Type_Def;
Instance2 : constant Derived_Type_Def :=
Instance.As_Derived_Type_Def;
begin
return
MP.Match (Pattern2.F_Has_Abstract, Instance2.F_Has_Abstract)
and then MP.Match
(Pattern2.F_Has_Limited, Instance2.F_Has_Limited)
and then MP.Match
(Pattern2.F_Has_Synchronized, Instance2.F_Has_Synchronized)
and then MP.Match
(Pattern2.F_Subtype_Indication, Instance2.F_Subtype_Indication)
and then MP.Match (Pattern2.F_Interfaces, Instance2.F_Interfaces)
and then MP.Match
(Pattern2.F_Record_Extension, Instance2.F_Record_Extension)
and then MP.Match
(Pattern2.F_Has_With_Private, Instance2.F_Has_With_Private);
end;
elsif Pattern.Kind = Ada_Accept_Stmt_With_Stmts then
declare
Pattern2 : constant Accept_Stmt_With_Stmts :=
Pattern.As_Accept_Stmt_With_Stmts;
Instance2 : constant Accept_Stmt_With_Stmts :=
Instance.As_Accept_Stmt_With_Stmts;
begin
return
MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Entry_Index_Expr, Instance2.F_Entry_Index_Expr)
and then MP.Match (Pattern2.F_Params, Instance2.F_Params)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Concrete_Type_Decl then
declare
Pattern2 : constant Concrete_Type_Decl :=
Pattern.As_Concrete_Type_Decl;
Instance2 : constant Concrete_Type_Decl :=
Instance.As_Concrete_Type_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Discriminants, Instance2.F_Discriminants)
and then MP.Match (Pattern2.F_Type_Def, Instance2.F_Type_Def);
end;
elsif Pattern.Kind = Ada_Call_Stmt then
declare
Pattern2 : constant Call_Stmt := Pattern.As_Call_Stmt;
Instance2 : constant Call_Stmt := Instance.As_Call_Stmt;
begin
return MP.Match (Pattern2.F_Call, Instance2.F_Call);
end;
elsif Pattern.Kind = Ada_Reduce_Attribute_Ref then
declare
Pattern2 : constant Reduce_Attribute_Ref :=
Pattern.As_Reduce_Attribute_Ref;
Instance2 : constant Reduce_Attribute_Ref :=
Instance.As_Reduce_Attribute_Ref;
begin
return
MP.Match (Pattern2.F_Prefix, Instance2.F_Prefix)
and then MP.Match (Pattern2.F_Attribute, Instance2.F_Attribute)
and then MP.Match (Pattern2.F_Args, Instance2.F_Args);
end;
elsif Pattern.Kind = Ada_Synthetic_Type_Expr then
declare
Pattern2 : constant Synthetic_Type_Expr :=
Pattern.As_Synthetic_Type_Expr;
Instance2 : constant Synthetic_Type_Expr :=
Instance.As_Synthetic_Type_Expr;
begin
return MP.Match (Pattern2.F_Target_Type, Instance2.F_Target_Type);
end;
elsif Pattern.Kind = Ada_Pp_Elsif_Directive then
declare
Pattern2 : constant Pp_Elsif_Directive :=
Pattern.As_Pp_Elsif_Directive;
Instance2 : constant Pp_Elsif_Directive :=
Instance.As_Pp_Elsif_Directive;
begin
return
MP.Match (Pattern2.F_Expr, Instance2.F_Expr)
and then MP.Match (Pattern2.F_Then_Kw, Instance2.F_Then_Kw);
end;
elsif Pattern.Kind = Ada_Array_Type_Def then
declare
Pattern2 : constant Array_Type_Def := Pattern.As_Array_Type_Def;
Instance2 : constant Array_Type_Def := Instance.As_Array_Type_Def;
begin
return
MP.Match (Pattern2.F_Indices, Instance2.F_Indices)
and then MP.Match
(Pattern2.F_Component_Type, Instance2.F_Component_Type);
end;
elsif Pattern.Kind = Ada_Label then
declare
Pattern2 : constant Label := Pattern.As_Label;
Instance2 : constant Label := Instance.As_Label;
begin
return MP.Match (Pattern2.F_Decl, Instance2.F_Decl);
end;
elsif Pattern.Kind = Ada_For_Loop_Var_Decl then
declare
Pattern2 : constant For_Loop_Var_Decl :=
Pattern.As_For_Loop_Var_Decl;
Instance2 : constant For_Loop_Var_Decl :=
Instance.As_For_Loop_Var_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Id, Instance2.F_Id)
and then MP.Match (Pattern2.F_Id_Type, Instance2.F_Id_Type);
end;
elsif Pattern.Kind = Ada_Dotted_Name then
declare
Pattern2 : constant Dotted_Name := Pattern.As_Dotted_Name;
Instance2 : constant Dotted_Name := Instance.As_Dotted_Name;
begin
return
MP.Match (Pattern2.F_Prefix, Instance2.F_Prefix)
and then MP.Match (Pattern2.F_Suffix, Instance2.F_Suffix);
end;
elsif Pattern.Kind = Ada_Known_Discriminant_Part then
declare
Pattern2 : constant Known_Discriminant_Part :=
Pattern.As_Known_Discriminant_Part;
Instance2 : constant Known_Discriminant_Part :=
Instance.As_Known_Discriminant_Part;
begin
return MP.Match (Pattern2.F_Discr_Specs, Instance2.F_Discr_Specs);
end;
elsif Pattern.Kind = Ada_Discrete_Base_Subtype_Decl then
declare
Pattern2 : constant Discrete_Base_Subtype_Decl :=
Pattern.As_Discrete_Base_Subtype_Decl;
Instance2 : constant Discrete_Base_Subtype_Decl :=
Instance.As_Discrete_Base_Subtype_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_Protected_Body_Stub then
declare
Pattern2 : constant Protected_Body_Stub :=
Pattern.As_Protected_Body_Stub;
Instance2 : constant Protected_Body_Stub :=
Instance.As_Protected_Body_Stub;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_Package_Renaming_Decl then
declare
Pattern2 : constant Package_Renaming_Decl :=
Pattern.As_Package_Renaming_Decl;
Instance2 : constant Package_Renaming_Decl :=
Instance.As_Package_Renaming_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match (Pattern2.F_Renames, Instance2.F_Renames);
end;
elsif Pattern.Kind = Ada_Elsif_Stmt_Part then
declare
Pattern2 : constant Elsif_Stmt_Part := Pattern.As_Elsif_Stmt_Part;
Instance2 : constant Elsif_Stmt_Part :=
Instance.As_Elsif_Stmt_Part;
begin
return
MP.Match (Pattern2.F_Cond_Expr, Instance2.F_Cond_Expr)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts);
end;
elsif Pattern.Kind = Ada_Record_Type_Def then
declare
Pattern2 : constant Record_Type_Def := Pattern.As_Record_Type_Def;
Instance2 : constant Record_Type_Def :=
Instance.As_Record_Type_Def;
begin
return
MP.Match (Pattern2.F_Has_Abstract, Instance2.F_Has_Abstract)
and then MP.Match (Pattern2.F_Has_Tagged, Instance2.F_Has_Tagged)
and then MP.Match
(Pattern2.F_Has_Limited, Instance2.F_Has_Limited)
and then MP.Match
(Pattern2.F_Record_Def, Instance2.F_Record_Def);
end;
elsif Pattern.Kind = Ada_Delay_Stmt then
declare
Pattern2 : constant Delay_Stmt := Pattern.As_Delay_Stmt;
Instance2 : constant Delay_Stmt := Instance.As_Delay_Stmt;
begin
return
MP.Match (Pattern2.F_Has_Until, Instance2.F_Has_Until)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Subunit then
declare
Pattern2 : constant Subunit := Pattern.As_Subunit;
Instance2 : constant Subunit := Instance.As_Subunit;
begin
return
MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match (Pattern2.F_Body, Instance2.F_Body);
end;
elsif Pattern.Kind = Ada_Bracket_Aggregate then
declare
Pattern2 : constant Bracket_Aggregate :=
Pattern.As_Bracket_Aggregate;
Instance2 : constant Bracket_Aggregate :=
Instance.As_Bracket_Aggregate;
begin
return
MP.Match (Pattern2.F_Ancestor_Expr, Instance2.F_Ancestor_Expr)
and then MP.Match (Pattern2.F_Assocs, Instance2.F_Assocs);
end;
elsif Pattern.Kind = Ada_Return_Stmt then
declare
Pattern2 : constant Return_Stmt := Pattern.As_Return_Stmt;
Instance2 : constant Return_Stmt := Instance.As_Return_Stmt;
begin
return MP.Match (Pattern2.F_Return_Expr, Instance2.F_Return_Expr);
end;
elsif Pattern.Kind = Ada_Synthetic_Subp_Decl then
declare
Pattern2 : constant Synthetic_Subp_Decl :=
Pattern.As_Synthetic_Subp_Decl;
Instance2 : constant Synthetic_Subp_Decl :=
Instance.As_Synthetic_Subp_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Spec, Instance2.F_Spec);
end;
elsif Pattern.Kind = Ada_Exception_Handler then
declare
Pattern2 : constant Exception_Handler :=
Pattern.As_Exception_Handler;
Instance2 : constant Exception_Handler :=
Instance.As_Exception_Handler;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match
(Pattern2.F_Exception_Name, Instance2.F_Exception_Name)
and then MP.Match
(Pattern2.F_Handled_Exceptions, Instance2.F_Handled_Exceptions)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts);
end;
elsif Pattern.Kind = Ada_Update_Attribute_Ref then
declare
Pattern2 : constant Update_Attribute_Ref :=
Pattern.As_Update_Attribute_Ref;
Instance2 : constant Update_Attribute_Ref :=
Instance.As_Update_Attribute_Ref;
begin
return
MP.Match (Pattern2.F_Prefix, Instance2.F_Prefix)
and then MP.Match (Pattern2.F_Attribute, Instance2.F_Attribute)
and then MP.Match (Pattern2.F_Values, Instance2.F_Values);
end;
elsif Pattern.Kind = Ada_Record_Def then
declare
Pattern2 : constant Record_Def := Pattern.As_Record_Def;
Instance2 : constant Record_Def := Instance.As_Record_Def;
begin
return MP.Match (Pattern2.F_Components, Instance2.F_Components);
end;
elsif Pattern.Kind = Ada_Null_Record_Def then
declare
Pattern2 : constant Null_Record_Def := Pattern.As_Null_Record_Def;
Instance2 : constant Null_Record_Def :=
Instance.As_Null_Record_Def;
begin
return MP.Match (Pattern2.F_Components, Instance2.F_Components);
end;
elsif Pattern.Kind = Ada_Generic_Subp_Renaming_Decl then
declare
Pattern2 : constant Generic_Subp_Renaming_Decl :=
Pattern.As_Generic_Subp_Renaming_Decl;
Instance2 : constant Generic_Subp_Renaming_Decl :=
Instance.As_Generic_Subp_Renaming_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Kind, Instance2.F_Kind)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match (Pattern2.F_Renames, Instance2.F_Renames);
end;
elsif Pattern.Kind = Ada_Bin_Op then
declare
Pattern2 : constant Bin_Op := Pattern.As_Bin_Op;
Instance2 : constant Bin_Op := Instance.As_Bin_Op;
begin
return
MP.Match (Pattern2.F_Left, Instance2.F_Left)
and then MP.Match (Pattern2.F_Op, Instance2.F_Op)
and then MP.Match (Pattern2.F_Right, Instance2.F_Right);
end;
elsif Pattern.Kind = Ada_Abstract_State_Decl then
declare
Pattern2 : constant Abstract_State_Decl :=
Pattern.As_Abstract_State_Decl;
Instance2 : constant Abstract_State_Decl :=
Instance.As_Abstract_State_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_Record_Rep_Clause then
declare
Pattern2 : constant Record_Rep_Clause :=
Pattern.As_Record_Rep_Clause;
Instance2 : constant Record_Rep_Clause :=
Instance.As_Record_Rep_Clause;
begin
return
MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match (Pattern2.F_At_Expr, Instance2.F_At_Expr)
and then MP.Match
(Pattern2.F_Components, Instance2.F_Components);
end;
elsif Pattern.Kind = Ada_Incomplete_Formal_Type_Decl then
declare
Pattern2 : constant Incomplete_Formal_Type_Decl :=
Pattern.As_Incomplete_Formal_Type_Decl;
Instance2 : constant Incomplete_Formal_Type_Decl :=
Instance.As_Incomplete_Formal_Type_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Discriminants, Instance2.F_Discriminants)
and then MP.Match (Pattern2.F_Is_Tagged, Instance2.F_Is_Tagged)
and then MP.Match
(Pattern2.F_Default_Type, Instance2.F_Default_Type);
end;
elsif Pattern.Kind = Ada_Range_Spec then
declare
Pattern2 : constant Range_Spec := Pattern.As_Range_Spec;
Instance2 : constant Range_Spec := Instance.As_Range_Spec;
begin
return MP.Match (Pattern2.F_Range, Instance2.F_Range);
end;
elsif Pattern.Kind = Ada_Concat_Op then
declare
Pattern2 : constant Concat_Op := Pattern.As_Concat_Op;
Instance2 : constant Concat_Op := Instance.As_Concat_Op;
begin
return
MP.Match (Pattern2.F_First_Operand, Instance2.F_First_Operand)
and then MP.Match
(Pattern2.F_Other_Operands, Instance2.F_Other_Operands);
end;
elsif Pattern.Kind = Ada_With_Clause then
declare
Pattern2 : constant With_Clause := Pattern.As_With_Clause;
Instance2 : constant With_Clause := Instance.As_With_Clause;
begin
return
MP.Match (Pattern2.F_Has_Limited, Instance2.F_Has_Limited)
and then MP.Match
(Pattern2.F_Has_Private, Instance2.F_Has_Private)
and then MP.Match (Pattern2.F_Packages, Instance2.F_Packages);
end;
elsif Pattern.Kind = Ada_Composite_Constraint_Assoc then
declare
Pattern2 : constant Composite_Constraint_Assoc :=
Pattern.As_Composite_Constraint_Assoc;
Instance2 : constant Composite_Constraint_Assoc :=
Instance.As_Composite_Constraint_Assoc;
begin
return
MP.Match (Pattern2.F_Ids, Instance2.F_Ids)
and then MP.Match
(Pattern2.F_Constraint_Expr, Instance2.F_Constraint_Expr);
end;
elsif Pattern.Kind = Ada_Subp_Body then
declare
Pattern2 : constant Subp_Body := Pattern.As_Subp_Body;
Instance2 : constant Subp_Body := Instance.As_Subp_Body;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Overriding, Instance2.F_Overriding)
and then MP.Match (Pattern2.F_Subp_Spec, Instance2.F_Subp_Spec)
and then MP.Match (Pattern2.F_Decls, Instance2.F_Decls)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Private_Part then
declare
Pattern2 : constant Private_Part := Pattern.As_Private_Part;
Instance2 : constant Private_Part := Instance.As_Private_Part;
begin
return MP.Match (Pattern2.F_Decls, Instance2.F_Decls);
end;
elsif Pattern.Kind = Ada_Abstract_State_Decl_Expr then
declare
Pattern2 : constant Abstract_State_Decl_Expr :=
Pattern.As_Abstract_State_Decl_Expr;
Instance2 : constant Abstract_State_Decl_Expr :=
Instance.As_Abstract_State_Decl_Expr;
begin
return MP.Match (Pattern2.F_State_Decl, Instance2.F_State_Decl);
end;
elsif Pattern.Kind = Ada_Select_Stmt then
declare
Pattern2 : constant Select_Stmt := Pattern.As_Select_Stmt;
Instance2 : constant Select_Stmt := Instance.As_Select_Stmt;
begin
return
MP.Match (Pattern2.F_Guards, Instance2.F_Guards)
and then MP.Match (Pattern2.F_Else_Stmts, Instance2.F_Else_Stmts)
and then MP.Match
(Pattern2.F_Abort_Stmts, Instance2.F_Abort_Stmts);
end;
elsif Pattern.Kind = Ada_Synthetic_Binary_Spec then
declare
Pattern2 : constant Synthetic_Binary_Spec :=
Pattern.As_Synthetic_Binary_Spec;
Instance2 : constant Synthetic_Binary_Spec :=
Instance.As_Synthetic_Binary_Spec;
begin
return
MP.Match (Pattern2.F_Left_Param, Instance2.F_Left_Param)
and then MP.Match
(Pattern2.F_Right_Param, Instance2.F_Right_Param)
and then MP.Match
(Pattern2.F_Return_Type_Expr, Instance2.F_Return_Type_Expr);
end;
elsif Pattern.Kind = Ada_Synthetic_Unary_Spec then
declare
Pattern2 : constant Synthetic_Unary_Spec :=
Pattern.As_Synthetic_Unary_Spec;
Instance2 : constant Synthetic_Unary_Spec :=
Instance.As_Synthetic_Unary_Spec;
begin
return
MP.Match (Pattern2.F_Right_Param, Instance2.F_Right_Param)
and then MP.Match
(Pattern2.F_Return_Type_Expr, Instance2.F_Return_Type_Expr);
end;
elsif Pattern.Kind = Ada_Subp_Renaming_Decl then
declare
Pattern2 : constant Subp_Renaming_Decl :=
Pattern.As_Subp_Renaming_Decl;
Instance2 : constant Subp_Renaming_Decl :=
Instance.As_Subp_Renaming_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Overriding, Instance2.F_Overriding)
and then MP.Match (Pattern2.F_Subp_Spec, Instance2.F_Subp_Spec)
and then MP.Match (Pattern2.F_Renames, Instance2.F_Renames);
end;
elsif Pattern.Kind = Ada_Generic_Formal_Obj_Decl then
declare
Pattern2 : constant Generic_Formal_Obj_Decl :=
Pattern.As_Generic_Formal_Obj_Decl;
Instance2 : constant Generic_Formal_Obj_Decl :=
Instance.As_Generic_Formal_Obj_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Decl, Instance2.F_Decl);
end;
elsif Pattern.Kind = Ada_Discrete_Subtype_Indication then
declare
Pattern2 : constant Discrete_Subtype_Indication :=
Pattern.As_Discrete_Subtype_Indication;
Instance2 : constant Discrete_Subtype_Indication :=
Instance.As_Discrete_Subtype_Indication;
begin
return
MP.Match (Pattern2.F_Has_Not_Null, Instance2.F_Has_Not_Null)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Constraint, Instance2.F_Constraint);
end;
elsif Pattern.Kind = Ada_Package_Body_Stub then
declare
Pattern2 : constant Package_Body_Stub :=
Pattern.As_Package_Body_Stub;
Instance2 : constant Package_Body_Stub :=
Instance.As_Package_Body_Stub;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_Requeue_Stmt then
declare
Pattern2 : constant Requeue_Stmt := Pattern.As_Requeue_Stmt;
Instance2 : constant Requeue_Stmt := Instance.As_Requeue_Stmt;
begin
return
MP.Match (Pattern2.F_Call_Name, Instance2.F_Call_Name)
and then MP.Match (Pattern2.F_Has_Abort, Instance2.F_Has_Abort);
end;
elsif Pattern.Kind = Ada_Accept_Stmt then
declare
Pattern2 : constant Accept_Stmt := Pattern.As_Accept_Stmt;
Instance2 : constant Accept_Stmt := Instance.As_Accept_Stmt;
begin
return
MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Entry_Index_Expr, Instance2.F_Entry_Index_Expr)
and then MP.Match (Pattern2.F_Params, Instance2.F_Params);
end;
elsif Pattern.Kind = Ada_Task_Type_Decl then
declare
Pattern2 : constant Task_Type_Decl := Pattern.As_Task_Type_Decl;
Instance2 : constant Task_Type_Decl := Instance.As_Task_Type_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Discriminants, Instance2.F_Discriminants)
and then MP.Match
(Pattern2.F_Definition, Instance2.F_Definition);
end;
elsif Pattern.Kind = Ada_Contract_Cases then
declare
Pattern2 : constant Contract_Cases := Pattern.As_Contract_Cases;
Instance2 : constant Contract_Cases := Instance.As_Contract_Cases;
begin
return
MP.Match (Pattern2.F_Contract_Cases, Instance2.F_Contract_Cases);
end;
elsif Pattern.Kind = Ada_Decl_Block then
declare
Pattern2 : constant Decl_Block := Pattern.As_Decl_Block;
Instance2 : constant Decl_Block := Instance.As_Decl_Block;
begin
return
MP.Match (Pattern2.F_Decls, Instance2.F_Decls)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Constrained_Subtype_Indication then
declare
Pattern2 : constant Constrained_Subtype_Indication :=
Pattern.As_Constrained_Subtype_Indication;
Instance2 : constant Constrained_Subtype_Indication :=
Instance.As_Constrained_Subtype_Indication;
begin
return
MP.Match (Pattern2.F_Has_Not_Null, Instance2.F_Has_Not_Null)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Constraint, Instance2.F_Constraint);
end;
elsif Pattern.Kind = Ada_Floating_Point_Def then
declare
Pattern2 : constant Floating_Point_Def :=
Pattern.As_Floating_Point_Def;
Instance2 : constant Floating_Point_Def :=
Instance.As_Floating_Point_Def;
begin
return
MP.Match (Pattern2.F_Num_Digits, Instance2.F_Num_Digits)
and then MP.Match (Pattern2.F_Range, Instance2.F_Range);
end;
elsif Pattern.Kind = Ada_Entry_Body then
declare
Pattern2 : constant Entry_Body := Pattern.As_Entry_Body;
Instance2 : constant Entry_Body := Instance.As_Entry_Body;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Entry_Name, Instance2.F_Entry_Name)
and then MP.Match (Pattern2.F_Index_Spec, Instance2.F_Index_Spec)
and then MP.Match (Pattern2.F_Params, Instance2.F_Params)
and then MP.Match (Pattern2.F_Barrier, Instance2.F_Barrier)
and then MP.Match (Pattern2.F_Decls, Instance2.F_Decls)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Attribute_Ref then
declare
Pattern2 : constant Attribute_Ref := Pattern.As_Attribute_Ref;
Instance2 : constant Attribute_Ref := Instance.As_Attribute_Ref;
begin
return
MP.Match (Pattern2.F_Prefix, Instance2.F_Prefix)
and then MP.Match (Pattern2.F_Attribute, Instance2.F_Attribute)
and then MP.Match (Pattern2.F_Args, Instance2.F_Args);
end;
elsif Pattern.Kind = Ada_Unconstrained_Array_Indices then
declare
Pattern2 : constant Unconstrained_Array_Indices :=
Pattern.As_Unconstrained_Array_Indices;
Instance2 : constant Unconstrained_Array_Indices :=
Instance.As_Unconstrained_Array_Indices;
begin
return MP.Match (Pattern2.F_Types, Instance2.F_Types);
end;
elsif Pattern.Kind = Ada_Extended_Return_Stmt then
declare
Pattern2 : constant Extended_Return_Stmt :=
Pattern.As_Extended_Return_Stmt;
Instance2 : constant Extended_Return_Stmt :=
Instance.As_Extended_Return_Stmt;
begin
return
MP.Match (Pattern2.F_Decl, Instance2.F_Decl)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts);
end;
elsif Pattern.Kind = Ada_Mod_Int_Type_Def then
declare
Pattern2 : constant Mod_Int_Type_Def :=
Pattern.As_Mod_Int_Type_Def;
Instance2 : constant Mod_Int_Type_Def :=
Instance.As_Mod_Int_Type_Def;
begin
return MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Select_When_Part then
declare
Pattern2 : constant Select_When_Part :=
Pattern.As_Select_When_Part;
Instance2 : constant Select_When_Part :=
Instance.As_Select_When_Part;
begin
return
MP.Match (Pattern2.F_Cond_Expr, Instance2.F_Cond_Expr)
and then MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts);
end;
elsif Pattern.Kind = Ada_Explicit_Deref then
declare
Pattern2 : constant Explicit_Deref := Pattern.As_Explicit_Deref;
Instance2 : constant Explicit_Deref := Instance.As_Explicit_Deref;
begin
return MP.Match (Pattern2.F_Prefix, Instance2.F_Prefix);
end;
elsif Pattern.Kind = Ada_Entry_Completion_Formal_Params then
declare
Pattern2 : constant Entry_Completion_Formal_Params :=
Pattern.As_Entry_Completion_Formal_Params;
Instance2 : constant Entry_Completion_Formal_Params :=
Instance.As_Entry_Completion_Formal_Params;
begin
return MP.Match (Pattern2.F_Params, Instance2.F_Params);
end;
elsif Pattern.Kind = Ada_Generic_Package_Decl then
declare
Pattern2 : constant Generic_Package_Decl :=
Pattern.As_Generic_Package_Decl;
Instance2 : constant Generic_Package_Decl :=
Instance.As_Generic_Package_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match
(Pattern2.F_Formal_Part, Instance2.F_Formal_Part)
and then MP.Match
(Pattern2.F_Package_Decl, Instance2.F_Package_Decl);
end;
elsif Pattern.Kind = Ada_Subp_Decl then
declare
Pattern2 : constant Subp_Decl := Pattern.As_Subp_Decl;
Instance2 : constant Subp_Decl := Instance.As_Subp_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Overriding, Instance2.F_Overriding)
and then MP.Match (Pattern2.F_Subp_Spec, Instance2.F_Subp_Spec);
end;
elsif Pattern.Kind = Ada_Named_Stmt then
declare
Pattern2 : constant Named_Stmt := Pattern.As_Named_Stmt;
Instance2 : constant Named_Stmt := Instance.As_Named_Stmt;
begin
return
MP.Match (Pattern2.F_Decl, Instance2.F_Decl)
and then MP.Match (Pattern2.F_Stmt, Instance2.F_Stmt);
end;
elsif Pattern.Kind = Ada_At_Clause then
declare
Pattern2 : constant At_Clause := Pattern.As_At_Clause;
Instance2 : constant At_Clause := Instance.As_At_Clause;
begin
return
MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Entry_Decl then
declare
Pattern2 : constant Entry_Decl := Pattern.As_Entry_Decl;
Instance2 : constant Entry_Decl := Instance.As_Entry_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Overriding, Instance2.F_Overriding)
and then MP.Match (Pattern2.F_Spec, Instance2.F_Spec);
end;
elsif Pattern.Kind = Ada_Concrete_Formal_Subp_Decl then
declare
Pattern2 : constant Concrete_Formal_Subp_Decl :=
Pattern.As_Concrete_Formal_Subp_Decl;
Instance2 : constant Concrete_Formal_Subp_Decl :=
Instance.As_Concrete_Formal_Subp_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Overriding, Instance2.F_Overriding)
and then MP.Match (Pattern2.F_Subp_Spec, Instance2.F_Subp_Spec)
and then MP.Match
(Pattern2.F_Default_Expr, Instance2.F_Default_Expr);
end;
elsif Pattern.Kind = Ada_Single_Task_Type_Decl then
declare
Pattern2 : constant Single_Task_Type_Decl :=
Pattern.As_Single_Task_Type_Decl;
Instance2 : constant Single_Task_Type_Decl :=
Instance.As_Single_Task_Type_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Discriminants, Instance2.F_Discriminants)
and then MP.Match
(Pattern2.F_Definition, Instance2.F_Definition);
end;
elsif Pattern.Kind = Ada_Quantified_Expr then
declare
Pattern2 : constant Quantified_Expr := Pattern.As_Quantified_Expr;
Instance2 : constant Quantified_Expr :=
Instance.As_Quantified_Expr;
begin
return
MP.Match (Pattern2.F_Quantifier, Instance2.F_Quantifier)
and then MP.Match (Pattern2.F_Loop_Spec, Instance2.F_Loop_Spec)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Pragma_Node then
declare
Pattern2 : constant Pragma_Node := Pattern.As_Pragma_Node;
Instance2 : constant Pragma_Node := Instance.As_Pragma_Node;
begin
return
MP.Match (Pattern2.F_Id, Instance2.F_Id)
and then MP.Match (Pattern2.F_Args, Instance2.F_Args);
end;
elsif Pattern.Kind = Ada_Abort_Stmt then
declare
Pattern2 : constant Abort_Stmt := Pattern.As_Abort_Stmt;
Instance2 : constant Abort_Stmt := Instance.As_Abort_Stmt;
begin
return MP.Match (Pattern2.F_Names, Instance2.F_Names);
end;
elsif Pattern.Kind = Ada_Value_Sequence then
declare
Pattern2 : constant Value_Sequence := Pattern.As_Value_Sequence;
Instance2 : constant Value_Sequence := Instance.As_Value_Sequence;
begin
return MP.Match (Pattern2.F_Iter_Assoc, Instance2.F_Iter_Assoc);
end;
elsif Pattern.Kind = Ada_Generic_Package_Instantiation then
declare
Pattern2 : constant Generic_Package_Instantiation :=
Pattern.As_Generic_Package_Instantiation;
Instance2 : constant Generic_Package_Instantiation :=
Instance.As_Generic_Package_Instantiation;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Generic_Pkg_Name, Instance2.F_Generic_Pkg_Name)
and then MP.Match (Pattern2.F_Params, Instance2.F_Params);
end;
elsif Pattern.Kind = Ada_If_Stmt then
declare
Pattern2 : constant If_Stmt := Pattern.As_If_Stmt;
Instance2 : constant If_Stmt := Instance.As_If_Stmt;
begin
return
MP.Match (Pattern2.F_Cond_Expr, Instance2.F_Cond_Expr)
and then MP.Match (Pattern2.F_Then_Stmts, Instance2.F_Then_Stmts)
and then MP.Match
(Pattern2.F_Alternatives, Instance2.F_Alternatives)
and then MP.Match
(Pattern2.F_Else_Stmts, Instance2.F_Else_Stmts);
end;
elsif Pattern.Kind = Ada_Variant then
declare
Pattern2 : constant Variant := Pattern.As_Variant;
Instance2 : constant Variant := Instance.As_Variant;
begin
return
MP.Match (Pattern2.F_Choices, Instance2.F_Choices)
and then MP.Match
(Pattern2.F_Components, Instance2.F_Components);
end;
elsif Pattern.Kind = Ada_Object_Decl then
declare
Pattern2 : constant Object_Decl := Pattern.As_Object_Decl;
Instance2 : constant Object_Decl := Instance.As_Object_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Ids, Instance2.F_Ids)
and then MP.Match
(Pattern2.F_Has_Aliased, Instance2.F_Has_Aliased)
and then MP.Match
(Pattern2.F_Has_Constant, Instance2.F_Has_Constant)
and then MP.Match (Pattern2.F_Mode, Instance2.F_Mode)
and then MP.Match (Pattern2.F_Type_Expr, Instance2.F_Type_Expr)
and then MP.Match
(Pattern2.F_Default_Expr, Instance2.F_Default_Expr)
and then MP.Match
(Pattern2.F_Renaming_Clause, Instance2.F_Renaming_Clause);
end;
elsif Pattern.Kind = Ada_Goto_Stmt then
declare
Pattern2 : constant Goto_Stmt := Pattern.As_Goto_Stmt;
Instance2 : constant Goto_Stmt := Instance.As_Goto_Stmt;
begin
return MP.Match (Pattern2.F_Label_Name, Instance2.F_Label_Name);
end;
elsif Pattern.Kind = Ada_While_Loop_Spec then
declare
Pattern2 : constant While_Loop_Spec := Pattern.As_While_Loop_Spec;
Instance2 : constant While_Loop_Spec :=
Instance.As_While_Loop_Spec;
begin
return MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Access_To_Subp_Def then
declare
Pattern2 : constant Access_To_Subp_Def :=
Pattern.As_Access_To_Subp_Def;
Instance2 : constant Access_To_Subp_Def :=
Instance.As_Access_To_Subp_Def;
begin
return
MP.Match (Pattern2.F_Has_Not_Null, Instance2.F_Has_Not_Null)
and then MP.Match
(Pattern2.F_Has_Protected, Instance2.F_Has_Protected)
and then MP.Match (Pattern2.F_Subp_Spec, Instance2.F_Subp_Spec);
end;
elsif Pattern.Kind = Ada_Task_Def then
declare
Pattern2 : constant Task_Def := Pattern.As_Task_Def;
Instance2 : constant Task_Def := Instance.As_Task_Def;
begin
return
MP.Match (Pattern2.F_Interfaces, Instance2.F_Interfaces)
and then MP.Match
(Pattern2.F_Public_Part, Instance2.F_Public_Part)
and then MP.Match
(Pattern2.F_Private_Part, Instance2.F_Private_Part)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Null_Subp_Decl then
declare
Pattern2 : constant Null_Subp_Decl := Pattern.As_Null_Subp_Decl;
Instance2 : constant Null_Subp_Decl := Instance.As_Null_Subp_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Overriding, Instance2.F_Overriding)
and then MP.Match (Pattern2.F_Subp_Spec, Instance2.F_Subp_Spec);
end;
elsif Pattern.Kind = Ada_Relation_Op then
declare
Pattern2 : constant Relation_Op := Pattern.As_Relation_Op;
Instance2 : constant Relation_Op := Instance.As_Relation_Op;
begin
return
MP.Match (Pattern2.F_Left, Instance2.F_Left)
and then MP.Match (Pattern2.F_Op, Instance2.F_Op)
and then MP.Match (Pattern2.F_Right, Instance2.F_Right);
end;
elsif Pattern.Kind = Ada_Subp_Body_Stub then
declare
Pattern2 : constant Subp_Body_Stub := Pattern.As_Subp_Body_Stub;
Instance2 : constant Subp_Body_Stub := Instance.As_Subp_Body_Stub;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Overriding, Instance2.F_Overriding)
and then MP.Match (Pattern2.F_Subp_Spec, Instance2.F_Subp_Spec);
end;
elsif Pattern.Kind = Ada_Generic_Formal_Type_Decl then
declare
Pattern2 : constant Generic_Formal_Type_Decl :=
Pattern.As_Generic_Formal_Type_Decl;
Instance2 : constant Generic_Formal_Type_Decl :=
Instance.As_Generic_Formal_Type_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Decl, Instance2.F_Decl);
end;
elsif Pattern.Kind = Ada_Component_List then
declare
Pattern2 : constant Component_List := Pattern.As_Component_List;
Instance2 : constant Component_List := Instance.As_Component_List;
begin
return
MP.Match (Pattern2.F_Components, Instance2.F_Components)
and then MP.Match
(Pattern2.F_Variant_Part, Instance2.F_Variant_Part);
end;
elsif Pattern.Kind = Ada_Single_Task_Decl then
declare
Pattern2 : constant Single_Task_Decl :=
Pattern.As_Single_Task_Decl;
Instance2 : constant Single_Task_Decl :=
Instance.As_Single_Task_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Task_Type, Instance2.F_Task_Type);
end;
elsif Pattern.Kind = Ada_No_Type_Object_Renaming_Decl then
declare
Pattern2 : constant No_Type_Object_Renaming_Decl :=
Pattern.As_No_Type_Object_Renaming_Decl;
Instance2 : constant No_Type_Object_Renaming_Decl :=
Instance.As_No_Type_Object_Renaming_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Ids, Instance2.F_Ids)
and then MP.Match
(Pattern2.F_Has_Aliased, Instance2.F_Has_Aliased)
and then MP.Match
(Pattern2.F_Has_Constant, Instance2.F_Has_Constant)
and then MP.Match (Pattern2.F_Mode, Instance2.F_Mode)
and then MP.Match (Pattern2.F_Type_Expr, Instance2.F_Type_Expr)
and then MP.Match
(Pattern2.F_Default_Expr, Instance2.F_Default_Expr)
and then MP.Match
(Pattern2.F_Renaming_Clause, Instance2.F_Renaming_Clause);
end;
elsif Pattern.Kind = Ada_Exception_Decl then
declare
Pattern2 : constant Exception_Decl := Pattern.As_Exception_Decl;
Instance2 : constant Exception_Decl := Instance.As_Exception_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Ids, Instance2.F_Ids)
and then MP.Match (Pattern2.F_Renames, Instance2.F_Renames);
end;
elsif Pattern.Kind = Ada_Abstract_Subp_Decl then
declare
Pattern2 : constant Abstract_Subp_Decl :=
Pattern.As_Abstract_Subp_Decl;
Instance2 : constant Abstract_Subp_Decl :=
Instance.As_Abstract_Subp_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Overriding, Instance2.F_Overriding)
and then MP.Match (Pattern2.F_Subp_Spec, Instance2.F_Subp_Spec);
end;
elsif Pattern.Kind = Ada_Ordinary_Fixed_Point_Def then
declare
Pattern2 : constant Ordinary_Fixed_Point_Def :=
Pattern.As_Ordinary_Fixed_Point_Def;
Instance2 : constant Ordinary_Fixed_Point_Def :=
Instance.As_Ordinary_Fixed_Point_Def;
begin
return
MP.Match (Pattern2.F_Delta, Instance2.F_Delta)
and then MP.Match (Pattern2.F_Range, Instance2.F_Range);
end;
elsif Pattern.Kind = Ada_Assign_Stmt then
declare
Pattern2 : constant Assign_Stmt := Pattern.As_Assign_Stmt;
Instance2 : constant Assign_Stmt := Instance.As_Assign_Stmt;
begin
return
MP.Match (Pattern2.F_Dest, Instance2.F_Dest)
and then MP.Match (Pattern2.F_Expr, Instance2.F_Expr);
end;
elsif Pattern.Kind = Ada_Allocator then
declare
Pattern2 : constant Allocator := Pattern.As_Allocator;
Instance2 : constant Allocator := Instance.As_Allocator;
begin
return
MP.Match (Pattern2.F_Subpool, Instance2.F_Subpool)
and then MP.Match
(Pattern2.F_Type_Or_Expr, Instance2.F_Type_Or_Expr);
end;
elsif Pattern.Kind = Ada_Range_Constraint then
declare
Pattern2 : constant Range_Constraint :=
Pattern.As_Range_Constraint;
Instance2 : constant Range_Constraint :=
Instance.As_Range_Constraint;
begin
return MP.Match (Pattern2.F_Range, Instance2.F_Range);
end;
elsif Pattern.Kind = Ada_Raise_Expr then
declare
Pattern2 : constant Raise_Expr := Pattern.As_Raise_Expr;
Instance2 : constant Raise_Expr := Instance.As_Raise_Expr;
begin
return
MP.Match (Pattern2.F_Exception_Name, Instance2.F_Exception_Name)
and then MP.Match
(Pattern2.F_Error_Message, Instance2.F_Error_Message);
end;
elsif Pattern.Kind = Ada_Use_Package_Clause then
declare
Pattern2 : constant Use_Package_Clause :=
Pattern.As_Use_Package_Clause;
Instance2 : constant Use_Package_Clause :=
Instance.As_Use_Package_Clause;
begin
return MP.Match (Pattern2.F_Packages, Instance2.F_Packages);
end;
elsif Pattern.Kind = Ada_End_Name then
declare
Pattern2 : constant End_Name := Pattern.As_End_Name;
Instance2 : constant End_Name := Instance.As_End_Name;
begin
return MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_Extended_Return_Stmt_Object_Decl then
declare
Pattern2 : constant Extended_Return_Stmt_Object_Decl :=
Pattern.As_Extended_Return_Stmt_Object_Decl;
Instance2 : constant Extended_Return_Stmt_Object_Decl :=
Instance.As_Extended_Return_Stmt_Object_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Ids, Instance2.F_Ids)
and then MP.Match
(Pattern2.F_Has_Aliased, Instance2.F_Has_Aliased)
and then MP.Match
(Pattern2.F_Has_Constant, Instance2.F_Has_Constant)
and then MP.Match (Pattern2.F_Mode, Instance2.F_Mode)
and then MP.Match (Pattern2.F_Type_Expr, Instance2.F_Type_Expr)
and then MP.Match
(Pattern2.F_Default_Expr, Instance2.F_Default_Expr)
and then MP.Match
(Pattern2.F_Renaming_Clause, Instance2.F_Renaming_Clause);
end;
elsif Pattern.Kind = Ada_Public_Part then
declare
Pattern2 : constant Public_Part := Pattern.As_Public_Part;
Instance2 : constant Public_Part := Instance.As_Public_Part;
begin
return MP.Match (Pattern2.F_Decls, Instance2.F_Decls);
end;
elsif Pattern.Kind = Ada_Pp_If_Directive then
declare
Pattern2 : constant Pp_If_Directive := Pattern.As_Pp_If_Directive;
Instance2 : constant Pp_If_Directive :=
Instance.As_Pp_If_Directive;
begin
return
MP.Match (Pattern2.F_Expr, Instance2.F_Expr)
and then MP.Match (Pattern2.F_Then_Kw, Instance2.F_Then_Kw);
end;
elsif Pattern.Kind = Ada_For_Loop_Spec then
declare
Pattern2 : constant For_Loop_Spec := Pattern.As_For_Loop_Spec;
Instance2 : constant For_Loop_Spec := Instance.As_For_Loop_Spec;
begin
return
MP.Match (Pattern2.F_Var_Decl, Instance2.F_Var_Decl)
and then MP.Match (Pattern2.F_Loop_Type, Instance2.F_Loop_Type)
and then MP.Match
(Pattern2.F_Has_Reverse, Instance2.F_Has_Reverse)
and then MP.Match (Pattern2.F_Iter_Expr, Instance2.F_Iter_Expr)
and then MP.Match
(Pattern2.F_Iter_Filter, Instance2.F_Iter_Filter);
end;
elsif Pattern.Kind = Ada_Incomplete_Tagged_Type_Decl then
declare
Pattern2 : constant Incomplete_Tagged_Type_Decl :=
Pattern.As_Incomplete_Tagged_Type_Decl;
Instance2 : constant Incomplete_Tagged_Type_Decl :=
Instance.As_Incomplete_Tagged_Type_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Discriminants, Instance2.F_Discriminants)
and then MP.Match
(Pattern2.F_Has_Abstract, Instance2.F_Has_Abstract);
end;
elsif Pattern.Kind = Ada_Aspect_Spec then
declare
Pattern2 : constant Aspect_Spec := Pattern.As_Aspect_Spec;
Instance2 : constant Aspect_Spec := Instance.As_Aspect_Spec;
begin
return
MP.Match (Pattern2.F_Aspect_Assocs, Instance2.F_Aspect_Assocs);
end;
elsif Pattern.Kind = Ada_Synth_Anonymous_Type_Decl then
declare
Pattern2 : constant Synth_Anonymous_Type_Decl :=
Pattern.As_Synth_Anonymous_Type_Decl;
Instance2 : constant Synth_Anonymous_Type_Decl :=
Instance.As_Synth_Anonymous_Type_Decl;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match (Pattern2.F_Name, Instance2.F_Name)
and then MP.Match
(Pattern2.F_Discriminants, Instance2.F_Discriminants)
and then MP.Match (Pattern2.F_Type_Def, Instance2.F_Type_Def);
end;
elsif Pattern.Kind = Ada_Generic_Package_Internal then
declare
Pattern2 : constant Generic_Package_Internal :=
Pattern.As_Generic_Package_Internal;
Instance2 : constant Generic_Package_Internal :=
Instance.As_Generic_Package_Internal;
begin
return
MP.Match (Pattern2.F_Aspects, Instance2.F_Aspects)
and then MP.Match
(Pattern2.F_Package_Name, Instance2.F_Package_Name)
and then MP.Match
(Pattern2.F_Public_Part, Instance2.F_Public_Part)
and then MP.Match
(Pattern2.F_Private_Part, Instance2.F_Private_Part)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
elsif Pattern.Kind = Ada_Case_Expr then
declare
Pattern2 : constant Case_Expr := Pattern.As_Case_Expr;
Instance2 : constant Case_Expr := Instance.As_Case_Expr;
begin
return
MP.Match (Pattern2.F_Expr, Instance2.F_Expr)
and then MP.Match (Pattern2.F_Cases, Instance2.F_Cases);
end;
elsif Pattern.Kind = Ada_Library_Item then
declare
Pattern2 : constant Library_Item := Pattern.As_Library_Item;
Instance2 : constant Library_Item := Instance.As_Library_Item;
begin
return
MP.Match (Pattern2.F_Has_Private, Instance2.F_Has_Private)
and then MP.Match (Pattern2.F_Item, Instance2.F_Item);
end;
elsif Pattern.Kind = Ada_Synthetic_Defining_Name then
declare
Pattern2 : constant Synthetic_Defining_Name :=
Pattern.As_Synthetic_Defining_Name;
Instance2 : constant Synthetic_Defining_Name :=
Instance.As_Synthetic_Defining_Name;
begin
return MP.Match (Pattern2.F_Name, Instance2.F_Name);
end;
elsif Pattern.Kind = Ada_Contract_Case_Assoc then
declare
Pattern2 : constant Contract_Case_Assoc :=
Pattern.As_Contract_Case_Assoc;
Instance2 : constant Contract_Case_Assoc :=
Instance.As_Contract_Case_Assoc;
begin
return
MP.Match (Pattern2.F_Guard, Instance2.F_Guard)
and then MP.Match
(Pattern2.F_Consequence, Instance2.F_Consequence);
end;
elsif Pattern.Kind = Ada_Begin_Block then
declare
Pattern2 : constant Begin_Block := Pattern.As_Begin_Block;
Instance2 : constant Begin_Block := Instance.As_Begin_Block;
begin
return
MP.Match (Pattern2.F_Stmts, Instance2.F_Stmts)
and then MP.Match (Pattern2.F_End_Name, Instance2.F_End_Name);
end;
-- End of generated fragment --------
elsif Pattern.Kind in Ada_Ada_List then
return
MP.Match
(Pattern.Children, Instance.Children, Instance.Children'First,
True, False);
elsif Pattern.Kind in Ada_String_Literal | Ada_Char_Literal then
return Are_Equal_As_Raw_Signature (Pattern, Instance);
elsif Pattern.Kind = Ada_Int_Literal then
declare
Pattern2 : constant Int_Literal := Pattern.As_Int_Literal;
Instance2 : constant Int_Literal := Instance.As_Int_Literal;
begin
return Pattern2.P_Denoted_Value = Instance2.P_Denoted_Value;
end;
elsif Pattern.Children_Count = 0 and then Instance.Children_Count = 0
then
return
Are_Equal_Case_Insensitive_As_Raw_Signature (Pattern, Instance);
else
Put_Line
("??? Rejuvenation.Match_Pattern: Match_Specific, " &
"unknown Node type: " & Pattern.Image);
return False;
end if;
end Match_Specific;
procedure Dump_Partial_Match (MP : Match_Pattern) is
use Mapping_Single_Map;
use Mapping_Multiple_Map;
begin
Put_Line (Standard_Error, "Derived placeholder values:");
for E in MP.Mapping_Single.Iterate loop
Put_Line
(Standard_Error,
"* " & Key (E) & ": " & Raw_Signature (Element (E)));
end loop;
for E in MP.Mapping_Multiple.Iterate loop
Put_Line
(Standard_Error,
"* " & Key (E) & ": [" & Element (E).Length'Image & "]");
for N of Element (E) loop
Put_Line (Standard_Error, " - " & Raw_Signature (N));
end loop;
end loop;
end Dump_Partial_Match;
-- Private: Internal data structures --------
function Equivalent_Key (Left, Right : String) return Boolean is
begin
return Left = Right;
end Equivalent_Key;
function Equivalent_Element (Left, Right : Ada_Node) return Boolean is
begin
Put_Line
("Check on Equivalent_Element: " & Left.Image & " & " & Right.Image);
return False;
end Equivalent_Element;
function Equivalent_Element (Left, Right : Node_List.Vector) return Boolean
is
begin
Put_Line
("Check on Equivalent_Element: " & Left.Length'Image & " & " &
Right.Length'Image);
return False;
end Equivalent_Element;
end Rejuvenation.Match_Patterns;
|