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
|
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2009 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*
* itree.c -- instance tree creation and manipulation
*
* this module provides the instance tree
*/
#include <stdio.h>
#include <ctype.h>
#include <string.h>
#include <strings.h>
#include "alloc.h"
#include "out.h"
#include "stable.h"
#include "literals.h"
#include "lut.h"
#include "tree.h"
#include "ptree.h"
#include "itree.h"
#include "ipath.h"
#include "iexpr.h"
#include "eval.h"
#include "config.h"
/*
* struct info contains the state we keep when expanding a prop statement
* as part of constructing the instance tree. state kept in struct info
* is the non-recursive stuff -- the stuff that doesn't need to be on
* the stack. the rest of the state that is passed between all the
* mutually recursive functions, is required to be on the stack since
* we need to backtrack and recurse as we do the instance tree construction.
*/
struct info {
struct lut *lut;
struct node *anp; /* arrow np */
struct lut *ex; /* dictionary of explicit iterators */
struct config *croot;
} Ninfo;
/*
* struct wildcardinfo is used to track wildcarded portions of paths.
*
* for example, if the epname of an event is "c/d" and the path "a/b/c/d"
* exists, the wildcard path ewname is filled in with the path "a/b". when
* matching is done, epname is temporarily replaced with the concatenation
* of ewname and epname.
*
* a linked list of these structs is used to track the expansion of each
* event node as it is processed in vmatch() --> vmatch_event() calls.
*/
struct wildcardinfo {
struct node *nptop; /* event node fed to vmatch */
struct node *oldepname; /* epname without the wildcard part */
struct node *ewname; /* wildcard path */
int got_wc_hz;
struct wildcardinfo *next;
};
static struct wildcardinfo *wcproot = NULL;
static void vmatch(struct info *infop, struct node *np, struct node *lnp,
struct node *anp);
static void hmatch(struct info *infop, struct node *np, struct node *nextnp);
static void hmatch_event(struct info *infop, struct node *eventnp,
struct node *epname, struct config *ncp, struct node *nextnp, int rematch);
static void itree_pbubble(int flags, struct bubble *bp);
static void itree_pruner(void *left, void *right, void *arg);
static void itree_destructor(void *left, void *right, void *arg);
static int itree_set_arrow_traits(struct arrow *ap, struct node *fromev,
struct node *toev, struct lut *ex);
static void itree_free_arrowlists(struct bubble *bubp, int arrows_too);
static void itree_prune_arrowlists(struct bubble *bubp);
static void arrow_add_within(struct arrow *ap, struct node *xpr);
static struct arrow *itree_add_arrow(struct node *apnode,
struct node *fromevent, struct node *toevent, struct lut *ex);
static struct event *find_or_add_event(struct info *infop, struct node *np);
static void add_arrow(struct bubble *bp, struct arrow *ap);
static struct constraintlist *itree_add_constraint(struct arrow *arrowp,
struct node *c);
static struct bubble *itree_add_bubble(struct event *eventp,
enum bubbletype btype, int nork, int gen);
static void itree_free_bubble(struct bubble *freeme);
static void itree_free_constraints(struct arrow *ap);
/*
* the following struct contains the state we build up during
* vertical and horizontal expansion so that generate()
* has everything it needs to construct the appropriate arrows.
* after setting up the state by calling:
* generate_arrownp()
* generate_nork()
* generate_new()
* generate_from()
* generate_to()
* the actual arrow generation is done by calling:
* generate()
*/
static struct {
int generation; /* generation number of arrow set */
int matched; /* number of matches */
struct node *arrownp; /* top-level parse tree for arrow */
int n; /* n value associated with arrow */
int k; /* k value associated with arrow */
struct node *fromnp; /* left-hand-side event in parse tree */
struct node *tonp; /* right-hand-side event in parse tree */
struct event *frome; /* left-hand-side event in instance tree */
struct event *toe; /* right-hand-side event in instance tree */
struct bubble *frombp; /* bubble arrow comes from */
struct bubble *tobp; /* bubble arrow goes to */
} G;
static void
generate_arrownp(struct node *arrownp)
{
G.arrownp = arrownp;
}
static void
generate_nork(int n, int k)
{
G.n = n;
G.k = k;
}
static void
generate_new(void)
{
G.generation++;
}
static void
generate_from(struct node *fromeventnp)
{
G.frombp = NULL;
G.fromnp = fromeventnp;
}
static void
generate_to(struct node *toeventnp)
{
G.tonp = toeventnp;
}
static void
generate(struct info *infop)
{
struct arrow *arrowp;
ASSERT(G.arrownp != NULL);
ASSERT(G.fromnp != NULL);
ASSERT(G.tonp != NULL);
out(O_ALTFP|O_VERB3|O_NONL, " Arrow \"");
ptree_name_iter(O_ALTFP|O_VERB3|O_NONL, G.fromnp);
out(O_ALTFP|O_VERB3|O_NONL, "\" -> \"");
ptree_name_iter(O_ALTFP|O_VERB3|O_NONL, G.tonp);
out(O_ALTFP|O_VERB3|O_NONL, "\" ");
arrowp = itree_add_arrow(G.arrownp, G.fromnp, G.tonp, infop->ex);
if (arrowp == NULL) {
out(O_ALTFP|O_VERB3, "(prevented by constraints)");
} else {
out(O_ALTFP|O_VERB3, "");
if (!G.frombp) {
G.frome = find_or_add_event(infop, G.fromnp);
G.frombp = itree_add_bubble(G.frome, B_FROM, G.n, 0);
}
G.toe = find_or_add_event(infop, G.tonp);
G.tobp = itree_add_bubble(G.toe, B_TO, G.k, G.generation);
arrowp->tail = G.frombp;
arrowp->head = G.tobp;
add_arrow(G.frombp, arrowp);
add_arrow(G.tobp, arrowp);
}
}
enum childnode_action {
CN_NONE,
CN_DUP
};
static struct node *
tname_dup(struct node *namep, enum childnode_action act)
{
struct node *retp = NULL;
const char *file;
int line;
if (namep == NULL)
return (NULL);
file = namep->file;
line = namep->line;
for (; namep != NULL; namep = namep->u.name.next) {
struct node *newnp = newnode(T_NAME, file, line);
newnp->u.name.t = namep->u.name.t;
newnp->u.name.s = namep->u.name.s;
newnp->u.name.last = newnp;
newnp->u.name.it = namep->u.name.it;
newnp->u.name.cp = namep->u.name.cp;
if (act == CN_DUP) {
struct node *npc;
npc = namep->u.name.child;
if (npc != NULL) {
switch (npc->t) {
case T_NUM:
newnp->u.name.child =
newnode(T_NUM, file, line);
newnp->u.name.child->u.ull =
npc->u.ull;
break;
case T_NAME:
newnp->u.name.child =
tree_name(npc->u.name.s,
npc->u.name.it, file, line);
break;
default:
out(O_DIE, "tname_dup: "
"invalid child type %s",
ptree_nodetype2str(npc->t));
}
}
}
if (retp == NULL) {
retp = newnp;
} else {
retp->u.name.last->u.name.next = newnp;
retp->u.name.last = newnp;
}
}
return (retp);
}
struct prop_wlk_data {
struct lut *props;
struct node *epname;
};
static struct lut *props2instance(struct node *, struct node *);
/*
* let oldepname be a subset of epname. return the subsection of epname
* that ends with oldepname. make each component in the path explicitly
* instanced (i.e., with a T_NUM child).
*/
static struct node *
tname_dup_to_epname(struct node *oldepname, struct node *epname)
{
struct node *npref, *npend, *np1, *np2;
struct node *ret = NULL;
int foundmatch = 0;
if (epname == NULL)
return (NULL);
/*
* search for the longest path in epname which contains
* oldnode->u.event.epname. set npend to point to just past the
* end of this path.
*/
npend = NULL;
for (npref = epname; npref; npref = npref->u.name.next) {
if (npref->u.name.s == oldepname->u.name.s) {
for (np1 = npref, np2 = oldepname;
np1 != NULL && np2 != NULL;
np1 = np1->u.name.next, np2 = np2->u.name.next) {
if (np1->u.name.s != np2->u.name.s)
break;
}
if (np2 == NULL) {
foundmatch = 1;
npend = np1;
if (np1 == NULL) {
/* oldepname matched npref up to end */
break;
}
}
}
}
if (foundmatch == 0) {
/*
* if oldepname could not be found in epname, return a
* duplicate of the former. do not try to instantize
* oldepname since it might not be a path.
*/
return (tname_dup(oldepname, CN_DUP));
}
/*
* dup (epname -- npend). all children should be T_NUMs.
*/
for (npref = epname;
! (npref == NULL || npref == npend);
npref = npref->u.name.next) {
struct node *newnp = newnode(T_NAME, oldepname->file,
oldepname->line);
newnp->u.name.t = npref->u.name.t;
newnp->u.name.s = npref->u.name.s;
newnp->u.name.last = newnp;
newnp->u.name.it = npref->u.name.it;
newnp->u.name.cp = npref->u.name.cp;
newnp->u.name.child = newnode(T_NUM, oldepname->file,
oldepname->line);
if (npref->u.name.child == NULL ||
npref->u.name.child->t != T_NUM) {
int childnum;
ASSERT(npref->u.name.cp != NULL);
config_getcompname(npref->u.name.cp, NULL, &childnum);
newnp->u.name.child->u.ull = childnum;
} else {
newnp->u.name.child->u.ull =
npref->u.name.child->u.ull;
}
if (ret == NULL) {
ret = newnp;
} else {
ret->u.name.last->u.name.next = newnp;
ret->u.name.last = newnp;
}
}
return (ret);
}
/*
* restriction: oldnode->u.event.epname has to be equivalent to or a subset
* of epname
*/
static struct node *
tevent_dup_to_epname(struct node *oldnode, struct node *epname)
{
struct node *ret;
ret = newnode(T_EVENT, oldnode->file, oldnode->line);
ret->u.event.ename = tname_dup(oldnode->u.event.ename, CN_NONE);
ret->u.event.epname = tname_dup_to_epname(oldnode->u.event.epname,
epname);
return (ret);
}
static void
nv_instantiate(void *name, void *val, void *arg)
{
struct prop_wlk_data *pd = (struct prop_wlk_data *)arg;
struct node *orhs = (struct node *)val;
struct node *nrhs;
/* handle engines by instantizing the entire engine */
if (name == L_engine) {
ASSERT(orhs->t == T_EVENT);
ASSERT(orhs->u.event.ename->u.name.t == N_SERD);
/* there are only SERD engines for now */
nrhs = newnode(T_SERD, orhs->file, orhs->line);
nrhs->u.stmt.np = tevent_dup_to_epname(orhs, pd->epname);
nrhs->u.stmt.lutp = props2instance(orhs, pd->epname);
pd->props = lut_add(pd->props, name, nrhs, NULL);
return;
}
switch (orhs->t) {
case T_NUM:
nrhs = newnode(T_NUM, orhs->file, orhs->line);
nrhs->u.ull = orhs->u.ull;
pd->props = lut_add(pd->props, name, nrhs, NULL);
break;
case T_TIMEVAL:
nrhs = newnode(T_TIMEVAL, orhs->file, orhs->line);
nrhs->u.ull = orhs->u.ull;
pd->props = lut_add(pd->props, name, nrhs, NULL);
break;
case T_NAME:
nrhs = tname_dup_to_epname(orhs, pd->epname);
pd->props = lut_add(pd->props, name, nrhs, NULL);
break;
case T_EVENT:
nrhs = tevent_dup_to_epname(orhs, pd->epname);
pd->props = lut_add(pd->props, name, nrhs, NULL);
break;
case T_GLOBID:
nrhs = newnode(T_GLOBID, orhs->file, orhs->line);
nrhs->u.globid.s = orhs->u.globid.s;
pd->props = lut_add(pd->props, name, nrhs, NULL);
break;
case T_FUNC:
/* for T_FUNC, we don't duplicate it, just point to node */
pd->props = lut_add(pd->props, name, orhs, NULL);
break;
default:
out(O_DIE, "unexpected nvpair value type %s",
ptree_nodetype2str(((struct node *)val)->t));
}
}
static struct lut *
props2instance(struct node *eventnp, struct node *epname)
{
struct prop_wlk_data pd;
pd.props = NULL;
pd.epname = epname;
ASSERT(eventnp->u.event.declp != NULL);
lut_walk(eventnp->u.event.declp->u.stmt.lutp, nv_instantiate, &pd);
return (pd.props);
}
/*ARGSUSED*/
static void
instances_destructor(void *left, void *right, void *arg)
{
struct node *dn = (struct node *)right;
if (dn->t == T_SERD) {
/* we allocated the lut during itree_create(), so free it */
lut_free(dn->u.stmt.lutp, instances_destructor, NULL);
dn->u.stmt.lutp = NULL;
}
if (dn->t != T_FUNC) /* T_FUNC pointed to original node */
tree_free(dn);
}
/*ARGSUSED*/
static void
payloadprops_destructor(void *left, void *right, void *arg)
{
FREE(right);
}
/*ARGSUSED*/
static void
serdprops_destructor(void *left, void *right, void *arg)
{
FREE(right);
}
/*
* event_cmp -- used via lut_lookup/lut_add on instance tree lut
*/
static int
event_cmp(struct event *ep1, struct event *ep2)
{
int diff;
if ((diff = ep2->enode->u.event.ename->u.name.s -
ep1->enode->u.event.ename->u.name.s) != 0)
return (diff);
if ((diff = (char *)ep2->ipp - (char *)ep1->ipp) != 0)
return (diff);
return (0);
}
struct event *
itree_lookup(struct lut *itp, const char *ename, const struct ipath *ipp)
{
struct event searchevent; /* just used for searching */
struct node searcheventnode;
struct node searchenamenode;
searchevent.enode = &searcheventnode;
searcheventnode.t = T_EVENT;
searcheventnode.u.event.ename = &searchenamenode;
searchenamenode.t = T_NAME;
searchenamenode.u.name.s = ename;
searchevent.ipp = ipp;
return (lut_lookup(itp, (void *)&searchevent, (lut_cmp)event_cmp));
}
static struct event *
find_or_add_event(struct info *infop, struct node *np)
{
struct event *ret;
struct event searchevent; /* just used for searching */
ASSERTeq(np->t, T_EVENT, ptree_nodetype2str);
searchevent.enode = np;
searchevent.ipp = ipath(np->u.event.epname);
if ((ret = lut_lookup(infop->lut, (void *)&searchevent,
(lut_cmp)event_cmp)) != NULL)
return (ret);
/* wasn't already in tree, allocate it */
ret = alloc_xmalloc(sizeof (*ret));
bzero(ret, sizeof (*ret));
ret->t = np->u.event.ename->u.name.t;
ret->enode = np;
ret->ipp = searchevent.ipp;
ret->props = props2instance(np, np->u.event.epname);
infop->lut = lut_add(infop->lut, (void *)ret, (void *)ret,
(lut_cmp)event_cmp);
return (ret);
}
/*
* Used for handling expansions where first part of oldepname is a horizontal
* expansion. Recurses through entire tree. oldepname argument is always the
* full path as in the rules. Once we find a match we go back to using
* hmatch_event to handle the rest.
*/
static void
hmatch_full_config(struct info *infop, struct node *eventnp,
struct node *oldepname, struct config *ncp, struct node *nextnp,
struct iterinfo *iterinfop)
{
char *cp_s;
int cp_num;
struct config *cp;
struct node *saved_ewname;
struct node *saved_epname;
struct config *pcp, *ocp;
struct node *cpnode;
struct node *ewlp, *ewfp;
for (cp = ncp; cp; cp = config_next(cp)) {
config_getcompname(cp, &cp_s, &cp_num);
if (cp_s == oldepname->u.name.s) {
/*
* Found one.
*/
iterinfop->num = cp_num;
/*
* Need to set ewname, epname for correct node as is
* needed by constraint path matching. This code is
* similar to that in vmatch_event.
*/
saved_ewname = eventnp->u.event.ewname;
saved_epname = eventnp->u.event.epname;
ocp = oldepname->u.name.cp;
/*
* Find correct ewname by walking back up the config
* tree adding each name portion as we go.
*/
pcp = config_parent(cp);
eventnp->u.event.ewname = NULL;
for (; pcp != infop->croot; pcp = config_parent(pcp)) {
config_getcompname(pcp, &cp_s, &cp_num);
cpnode = tree_name(cp_s, IT_NONE, NULL, 0);
cpnode->u.name.child = newnode(T_NUM, NULL, 0);
cpnode->u.name.child->u.ull = cp_num;
cpnode->u.name.cp = pcp;
if (eventnp->u.event.ewname != NULL) {
cpnode->u.name.next =
eventnp->u.event.ewname;
cpnode->u.name.last =
eventnp->u.event.ewname->
u.name.last;
}
eventnp->u.event.ewname = cpnode;
}
/*
* Now create correct epname by duping new ewname
* and appending oldepname.
*/
ewfp = tname_dup(eventnp->u.event.ewname, CN_DUP);
ewlp = ewfp->u.name.last;
ewfp->u.name.last = oldepname->u.name.last;
ewlp->u.name.next = oldepname;
oldepname->u.name.cp = cp;
eventnp->u.event.epname = ewfp;
outfl(O_ALTFP|O_VERB3|O_NONL, infop->anp->file,
infop->anp->line, "hmatch_full_config: ");
ptree_name_iter(O_ALTFP|O_VERB3|O_NONL,
eventnp->u.event.epname);
out(O_ALTFP|O_VERB3, NULL);
/*
* Now complete hmatch.
*/
hmatch_event(infop, eventnp, oldepname->u.name.next,
config_child(cp), nextnp, 1);
/*
* set everything back again
*/
oldepname->u.name.cp = ocp;
iterinfop->num = -1;
ewlp->u.name.next = NULL;
ewfp->u.name.last = ewlp;
tree_free(ewfp);
tree_free(eventnp->u.event.ewname);
eventnp->u.event.ewname = saved_ewname;
eventnp->u.event.epname = saved_epname;
}
/*
* Try the next level down.
*/
hmatch_full_config(infop, eventnp,
oldepname, config_child(cp), nextnp, iterinfop);
}
}
/*
* hmatch_event -- perform any appropriate horizontal expansion on an event
*
* this routine is used to perform horizontal expansion on both the
* left-hand-side events in a prop, and the right-hand-side events.
* when called to handle a left-side event, nextnp point to the right
* side of the prop that should be passed to hmatch() for each match
* found by horizontal expansion. when no horizontal expansion exists,
* we will still "match" one event for every event found in the list on
* the left-hand-side of the prop because vmatch() already found that
* there's at least one match during vertical expansion.
*/
static void
hmatch_event(struct info *infop, struct node *eventnp, struct node *epname,
struct config *ncp, struct node *nextnp, int rematch)
{
if (epname == NULL) {
/*
* end of pathname recursion, either we just located
* a left-hand-side event and we're ready to move on
* to the expanding the right-hand-side events, or
* we're further down the recursion and we just located
* a right-hand-side event. the passed-in parameter
* "nextnp" tells us whether we're working on the left
* side and need to move on to nextnp, or if nextnp is
* NULL, we're working on the right side.
*/
if (nextnp) {
/*
* finished a left side expansion, move on to right.
* tell generate() what event we just matched so
* it can be used at the source of any arrows
* we generate as we match events on the right side.
*/
generate_from(eventnp);
hmatch(infop, nextnp, NULL);
} else {
/*
* finished a right side expansion. tell generate
* the information about the destination and let
* it construct the arrows as appropriate.
*/
generate_to(eventnp);
generate(infop);
}
return;
}
ASSERTeq(epname->t, T_NAME, ptree_nodetype2str);
if (epname->u.name.cp == NULL)
return;
/*
* we only get here when eventnp already has a completely
* instanced epname in it already. so we first recurse
* down to the end of the name and as the recursion pops
* up, we look for opportunities to advance horizontal
* expansions on to the next match.
*/
if (epname->u.name.it == IT_HORIZONTAL || rematch) {
struct config *cp;
struct config *ocp = epname->u.name.cp;
char *cp_s;
int cp_num;
int ocp_num;
struct iterinfo *iterinfop = NULL;
const char *iters;
int hexpand = 0;
if (epname->u.name.it != IT_HORIZONTAL) {
/*
* Ancestor was horizontal though, so must rematch
* against the name/num found in vmatch.
*/
config_getcompname(ocp, NULL, &ocp_num);
} else {
iters = epname->u.name.child->u.name.s;
if ((iterinfop = lut_lookup(infop->ex,
(void *)iters, NULL)) == NULL) {
/*
* do horizontal expansion on this node
*/
hexpand = 1;
iterinfop = alloc_xmalloc(
sizeof (struct iterinfo));
iterinfop->num = -1;
iterinfop->np = epname;
infop->ex = lut_add(infop->ex, (void *)iters,
iterinfop, NULL);
} else if (iterinfop->num == -1) {
hexpand = 1;
} else {
/*
* This name has already been used in a
* horizontal expansion. This time just match it
*/
ocp_num = iterinfop->num;
}
}
/*
* handle case where this is the first section of oldepname
* and it is horizontally expanded. Instead of just looking for
* siblings, we want to scan the entire config tree for further
* matches.
*/
if (epname == eventnp->u.event.oldepname &&
epname->u.name.it == IT_HORIZONTAL) {
/*
* Run through config looking for any that match the
* name.
*/
hmatch_full_config(infop, eventnp, epname,
infop->croot, nextnp, iterinfop);
return;
}
/*
* Run through siblings looking for any that match the name.
* If hexpand not set then num must also match ocp_num.
*/
for (cp = rematch ? ncp : ocp; cp; cp = config_next(cp)) {
config_getcompname(cp, &cp_s, &cp_num);
if (cp_s == epname->u.name.s) {
if (hexpand)
iterinfop->num = cp_num;
else if (ocp_num != cp_num)
continue;
epname->u.name.cp = cp;
hmatch_event(infop, eventnp,
epname->u.name.next, config_child(cp),
nextnp, 1);
}
}
epname->u.name.cp = ocp;
if (hexpand)
iterinfop->num = -1;
} else {
hmatch_event(infop, eventnp, epname->u.name.next,
NULL, nextnp, 0);
}
}
/*
* hmatch -- check for horizontal expansion matches
*
* np points to the things we're matching (like a T_LIST or a T_EVENT)
* and if we're working on a left-side of a prop, nextnp points to
* the other side of the prop that we'll tackle next when this recursion
* bottoms out. when all the events in the entire prop arrow have been
* horizontally expanded, generate() will be called to generate the
* actualy arrow.
*/
static void
hmatch(struct info *infop, struct node *np, struct node *nextnp)
{
if (np == NULL)
return; /* all done */
/*
* for each item in the list of events (which could just
* be a single event, or it could get larger in the loop
* below due to horizontal expansion), call hmatch on
* the right side and create arrows to each element.
*/
switch (np->t) {
case T_LIST:
/* loop through the list */
if (np->u.expr.left)
hmatch(infop, np->u.expr.left, nextnp);
if (np->u.expr.right)
hmatch(infop, np->u.expr.right, nextnp);
break;
case T_EVENT:
hmatch_event(infop, np, np->u.event.epname,
NULL, nextnp, 0);
break;
default:
outfl(O_DIE, np->file, np->line,
"hmatch: unexpected type: %s",
ptree_nodetype2str(np->t));
}
}
static int
itree_np2nork(struct node *norknp)
{
if (norknp == NULL)
return (1);
else if (norknp->t == T_NAME && norknp->u.name.s == L_A)
return (-1); /* our internal version of "all" */
else if (norknp->t == T_NUM)
return ((int)norknp->u.ull);
else
outfl(O_DIE, norknp->file, norknp->line,
"itree_np2nork: internal error type %s",
ptree_nodetype2str(norknp->t));
/*NOTREACHED*/
return (1);
}
static struct iterinfo *
newiterinfo(int num, struct node *np)
{
struct iterinfo *ret = alloc_xmalloc(sizeof (*ret));
ret->num = num;
ret->np = np;
return (ret);
}
/*ARGSUSED*/
static void
iterinfo_destructor(void *left, void *right, void *arg)
{
struct iterinfo *iterinfop = (struct iterinfo *)right;
alloc_xfree(iterinfop, sizeof (*iterinfop));
}
static void
vmatch_event(struct info *infop, struct config *cp, struct node *np,
struct node *lnp, struct node *anp, struct wildcardinfo *wcp)
{
char *cp_s;
int cp_num;
struct node *ewlp, *ewfp;
struct config *pcp;
struct node *cpnode;
int newewname = 0;
/*
* handle case where the first section of the path name is horizontally
* expanded. The whole expansion is handled by hmatch on the first
* match here - so we just skip any subsequent matches here.
*/
if (wcp->got_wc_hz == 1)
return;
if (np == NULL) {
/*
* Reached the end of the name. u.name.cp pointers should be set
* up for each part of name. From this we can use config tree
* to build up the wildcard part of the name (if any).
*/
pcp = config_parent(wcp->nptop->u.event.epname->u.name.cp);
if (pcp == infop->croot) {
/*
* no wildcarding done - move on to next entry
*/
wcp->nptop->u.event.ewname = wcp->ewname;
wcp->nptop->u.event.oldepname = wcp->oldepname;
vmatch(infop, np, lnp, anp);
wcp->got_wc_hz = 0;
return;
}
if (wcp->ewname == NULL) {
/*
* ewname not yet set up - do it now
*/
newewname = 1;
for (; pcp != infop->croot; pcp = config_parent(pcp)) {
config_getcompname(pcp, &cp_s, &cp_num);
cpnode = tree_name(cp_s, IT_NONE, NULL, 0);
cpnode->u.name.child = newnode(T_NUM, NULL, 0);
cpnode->u.name.child->u.ull = cp_num;
cpnode->u.name.cp = pcp;
if (wcp->ewname != NULL) {
cpnode->u.name.next = wcp->ewname;
cpnode->u.name.last =
wcp->ewname->u.name.last;
}
wcp->ewname = cpnode;
}
}
/*
* dup ewname and append oldepname
*/
ewfp = tname_dup(wcp->ewname, CN_DUP);
ewlp = ewfp->u.name.last;
ewfp->u.name.last = wcp->oldepname->u.name.last;
ewlp->u.name.next = wcp->oldepname;
wcp->nptop->u.event.epname = ewfp;
wcp->nptop->u.event.ewname = wcp->ewname;
wcp->nptop->u.event.oldepname = wcp->oldepname;
vmatch(infop, np, lnp, anp);
wcp->got_wc_hz = 0;
wcp->nptop->u.event.epname = wcp->oldepname;
/*
* reduce duped ewname to original then free
*/
ewlp->u.name.next = NULL;
ewfp->u.name.last = ewlp;
tree_free(ewfp);
if (newewname) {
/*
* free ewname if allocated above
*/
tree_free(wcp->ewname);
wcp->ewname = NULL;
}
return;
}
/*
* We have an np. See if we can match it in this section of
* the config tree.
*/
if (cp == NULL)
return; /* no more config to match against */
for (; cp; cp = config_next(cp)) {
config_getcompname(cp, &cp_s, &cp_num);
if (cp_s == np->u.name.s) {
/* found a matching component name */
if (np->u.name.child &&
np->u.name.child->t == T_NUM) {
/*
* an explicit instance number was given
* in the source. so only consider this
* a configuration match if the number
* also matches.
*/
if (cp_num != np->u.name.child->u.ull)
continue;
} else if (np->u.name.it != IT_HORIZONTAL) {
struct iterinfo *iterinfop;
const char *iters;
/*
* vertical iterator. look it up in
* the appropriate lut and if we get
* back a value it is either one that we
* set earlier, in which case we record
* the new value for this iteration and
* keep matching, or it is one that was
* set by an earlier reference to the
* iterator, in which case we only consider
* this a configuration match if the number
* matches cp_num.
*/
ASSERT(np->u.name.child != NULL);
ASSERT(np->u.name.child->t == T_NAME);
iters = np->u.name.child->u.name.s;
if ((iterinfop = lut_lookup(infop->ex,
(void *)iters, NULL)) == NULL) {
/* we're the first use, record our np */
infop->ex = lut_add(infop->ex,
(void *)iters,
newiterinfo(cp_num, np), NULL);
} else if (np == iterinfop->np) {
/*
* we're the first use, back again
* for another iteration. so update
* the num bound to this iterator in
* the lut.
*/
iterinfop->num = cp_num;
} else if (cp_num != iterinfop->num) {
/*
* an earlier reference to this
* iterator bound it to a different
* instance number, so there's no
* match here after all.
*
* however, it's possible that this
* component should really be part of
* the wildcard. we explore this by
* forcing this component into the
* wildcarded section.
*
* for an more details of what's
* going to happen now, see
* comments block below entitled
* "forcing components into
* wildcard path".
*/
if (np == wcp->nptop->u.event.epname)
vmatch_event(infop,
config_child(cp), np, lnp,
anp, wcp);
continue;
}
}
/*
* if this was an IT_HORIZONTAL name, hmatch() will
* expand all matches horizontally into a list.
* we know the list will contain at least
* one element (the one we just matched),
* so we just let hmatch_event() do the rest.
*
* recurse on to next component. Note that
* wildcarding is now turned off.
*/
np->u.name.cp = cp;
vmatch_event(infop, config_child(cp), np->u.name.next,
lnp, anp, wcp);
np->u.name.cp = NULL;
/*
* handle case where this is the first section of the
* path name and it is horizontally expanded.
* In this case we want all matching nodes in the config
* to be expanded horizontally - so set got_wc_hz and
* leave all further processing to hmatch.
*/
if (G.matched && np == wcp->nptop->u.event.epname &&
np->u.name.it == IT_HORIZONTAL)
wcp->got_wc_hz = 1;
/*
* forcing components into wildcard path:
*
* if this component is the first match, force it
* to be part of the wildcarded path and see if we
* can get additional matches.
*
* here's an example. suppose we have the
* definition
* event foo@x/y
* and configuration
* a0/x0/y0/a1/x1/y1
*
* the code up to this point will treat "a0" as the
* wildcarded part of the path and "x0/y0" as the
* nonwildcarded part, resulting in the instanced
* event
* foo@a0/x0/y0
*
* in order to discover the next match (.../x1/y1)
* in the configuration we have to force "x0" into
* the wildcarded part of the path.
* by doing so, we discover the wildcarded part
* "a0/x0/y0/a1" and the nonwildcarded part "x1/y1"
*
* the following call to vmatch_event() is also
* needed to properly handle the configuration
* b0/x0/b1/x1/y1
*
* the recursions into vmatch_event() will start
* off uncovering "b0" as the wildcarded part and
* "x0" as the start of the nonwildcarded path.
* however, the next recursion will not result in a
* match since there is no "y" following "x0". the
* subsequent match of (wildcard = "b0/x0/b1" and
* nonwildcard = "x1/y1") will be discovered only
* if "x0" is forced to be a part of the wildcarded
* path.
*/
if (np == wcp->nptop->u.event.epname)
vmatch_event(infop, config_child(cp), np, lnp,
anp, wcp);
if (np->u.name.it == IT_HORIZONTAL) {
/*
* hmatch() finished iterating through
* the configuration as described above, so
* don't continue iterating here.
*/
return;
}
} else if (np == wcp->nptop->u.event.epname) {
/*
* no match - carry on down the tree looking for
* wildcarding
*/
vmatch_event(infop, config_child(cp), np, lnp, anp,
wcp);
}
}
}
/*
* vmatch -- find the next vertical expansion match in the config database
*
* this routine is called with three node pointers:
* np -- the parse we're matching
* lnp -- the rest of the list we're currently working on
* anp -- the rest of the arrow we're currently working on
*
* the expansion matching happens via three types of recursion:
*
* - when given an arrow, handle the left-side and then recursively
* handle the right side (which might be another cascaded arrow).
*
* - when handling one side of an arrow, recurse through the T_LIST
* to get to each event (or just move on to the event if there
* is a single event instead of a list) since the arrow parse
* trees recurse left, we actually start with the right-most
* event list in the prop statement and work our way towards
* the left-most event list.
*
* - when handling an event, recurse down each component of the
* pathname, matching in the config database and recording the
* matches in the explicit iterator dictionary as we go.
*
* when the bottom of this matching recursion is met, meaning we have
* set the "cp" pointers on all the names in the entire statement,
* we call hmatch() which does it's own recursion to handle horizontal
* expandsion and then call generate() to generate nodes, bubbles, and
* arrows in the instance tree. generate() looks at the cp pointers to
* see what instance numbers were matched in the configuration database.
*
* when horizontal expansion appears, vmatch() finds only the first match
* and hmatch() then takes the horizontal expansion through all the other
* matches when generating the arrows in the instance tree.
*
* the "infop" passed down through the recursion contains a dictionary
* of the explicit iterators (all the implicit iterators have been converted
* to explicit iterators when the parse tree was created by tree.c), which
* allows things like this to work correctly:
*
* prop error.a@x[n]/y/z -> error.b@x/y[n]/z -> error.c@x/y/z[n];
*
* during the top level call, the explicit iterator "n" will match an
* instance number in the config database, and the result will be recorded
* in the explicit iterator dictionary and passed down via "infop". so
* when the recursive call tries to match y[n] in the config database, it
* will only match the same instance number as x[n] did since the dictionary
* is consulted to see if "n" took on a value already.
*
* at any point during the recursion, match*() can return to indicate
* a match was not found in the config database and that the caller should
* move on to the next potential match, if any.
*
* constraints are completely ignored by match(), so the statement:
*
* prop error.a@x[n] -> error.b@x[n] {n != 0};
*
* might very well match x[0] if it appears in the config database. it
* is the generate() routine that takes that match and then decides what
* arrow, if any, should be generated in the instance tree. generate()
* looks at the explicit iterator dictionary to get values like "n" in
* the above example so that it can evaluate constraints.
*
*/
static void
vmatch(struct info *infop, struct node *np, struct node *lnp, struct node *anp)
{
struct node *np1, *np2, *oldepname, *oldnptop;
int epmatches;
struct config *cp;
struct wildcardinfo *wcp;
if (np == NULL) {
G.matched = 1;
if (lnp)
vmatch(infop, lnp, NULL, anp);
else if (anp)
vmatch(infop, anp, NULL, NULL);
else {
struct node *src;
struct node *dst;
/* end of vertical match recursion */
outfl(O_ALTFP|O_VERB3|O_NONL,
infop->anp->file, infop->anp->line, "vmatch: ");
ptree_name_iter(O_ALTFP|O_VERB3|O_NONL, infop->anp);
out(O_ALTFP|O_VERB3, NULL);
generate_nork(
itree_np2nork(infop->anp->u.arrow.nnp),
itree_np2nork(infop->anp->u.arrow.knp));
dst = infop->anp->u.arrow.rhs;
src = infop->anp->u.arrow.lhs;
for (;;) {
generate_new(); /* new set of arrows */
if (src->t == T_ARROW) {
hmatch(infop, src->u.arrow.rhs, dst);
generate_nork(
itree_np2nork(src->u.arrow.nnp),
itree_np2nork(src->u.arrow.knp));
dst = src->u.arrow.rhs;
src = src->u.arrow.lhs;
} else {
hmatch(infop, src, dst);
break;
}
}
}
return;
}
switch (np->t) {
case T_EVENT: {
epmatches = 0;
/*
* see if we already have a match in the wcps
*/
for (wcp = wcproot; wcp; wcp = wcp->next) {
oldepname = wcp->oldepname;
oldnptop = wcp->nptop;
for (np1 = oldepname, np2 = np->u.event.epname;
np1 != NULL && np2 != NULL; np1 = np1->u.name.next,
np2 = np2->u.name.next) {
if (strcmp(np1->u.name.s, np2->u.name.s) != 0)
break;
if (np1->u.name.child->t !=
np2->u.name.child->t)
break;
if (np1->u.name.child->t == T_NUM &&
np1->u.name.child->u.ull !=
np2->u.name.child->u.ull)
break;
if (np1->u.name.child->t == T_NAME &&
strcmp(np1->u.name.child->u.name.s,
np2->u.name.child->u.name.s) != 0)
break;
epmatches++;
}
if (epmatches)
break;
}
if (epmatches && np1 == NULL && np2 == NULL) {
/*
* complete names match, can just borrow the fields
*/
oldepname = np->u.event.epname;
np->u.event.epname = oldnptop->u.event.epname;
np->u.event.oldepname = wcp->oldepname;
np->u.event.ewname = wcp->ewname;
vmatch(infop, NULL, lnp, anp);
np->u.event.epname = oldepname;
return;
}
G.matched = 0;
if (epmatches) {
/*
* just first part of names match - do wildcarding
* by using existing wcp including ewname and also
* copying as much of pwname as is valid, then start
* vmatch_event() at start of non-matching section
*/
for (np1 = oldepname, np2 = np->u.event.epname;
epmatches != 0; epmatches--) {
cp = np1->u.name.cp;
np2->u.name.cp = cp;
np1 = np1->u.name.next;
np2 = np2->u.name.next;
}
wcp->oldepname = np->u.event.epname;
wcp->nptop = np;
vmatch_event(infop, config_child(cp), np2, lnp,
anp, wcp);
wcp->oldepname = oldepname;
wcp->nptop = oldnptop;
if (G.matched == 0) {
/*
* This list entry is NULL. Move on to next item
* in the list.
*/
vmatch(infop, NULL, lnp, anp);
}
return;
}
/*
* names do not match - allocate a new wcp
*/
wcp = MALLOC(sizeof (struct wildcardinfo));
wcp->next = wcproot;
wcproot = wcp;
wcp->nptop = np;
wcp->oldepname = np->u.event.epname;
wcp->ewname = NULL;
wcp->got_wc_hz = 0;
vmatch_event(infop, config_child(infop->croot),
np->u.event.epname, lnp, anp, wcp);
wcproot = wcp->next;
FREE(wcp);
if (G.matched == 0) {
/*
* This list entry is NULL. Move on to next item in the
* list.
*/
vmatch(infop, NULL, lnp, anp);
}
break;
}
case T_LIST:
ASSERT(lnp == NULL);
vmatch(infop, np->u.expr.right, np->u.expr.left, anp);
break;
case T_ARROW:
ASSERT(lnp == NULL && anp == NULL);
vmatch(infop, np->u.arrow.rhs, NULL, np->u.arrow.parent);
break;
default:
outfl(O_DIE, np->file, np->line,
"vmatch: unexpected type: %s",
ptree_nodetype2str(np->t));
}
}
static void
find_first_arrow(struct info *infop, struct node *anp)
{
if (anp->u.arrow.lhs->t == T_ARROW) {
anp->u.arrow.lhs->u.arrow.parent = anp;
find_first_arrow(infop, anp->u.arrow.lhs);
} else
vmatch(infop, anp->u.arrow.lhs, NULL, anp);
}
static void
cp_reset(struct node *np)
{
if (np == NULL)
return;
switch (np->t) {
case T_NAME:
np->u.name.cp = NULL;
cp_reset(np->u.name.next);
break;
case T_LIST:
cp_reset(np->u.expr.left);
cp_reset(np->u.expr.right);
break;
case T_ARROW:
cp_reset(np->u.arrow.lhs);
cp_reset(np->u.arrow.rhs);
break;
case T_EVENT:
cp_reset(np->u.event.epname);
break;
}
}
/*
* itree_create -- apply the current config to the current parse tree
*
* returns a lut mapping fully-instance-qualified names to struct events.
*
*/
struct lut *
itree_create(struct config *croot)
{
struct lut *retval;
struct node *propnp;
extern int alloc_total();
int init_size;
Ninfo.lut = NULL;
Ninfo.croot = croot;
init_size = alloc_total();
out(O_ALTFP|O_STAMP, "start itree_create using %d bytes", init_size);
for (propnp = Props; propnp; propnp = propnp->u.stmt.next) {
struct node *anp = propnp->u.stmt.np;
ASSERTeq(anp->t, T_ARROW, ptree_nodetype2str);
if (!anp->u.arrow.needed)
continue;
Ninfo.anp = anp;
Ninfo.ex = NULL;
generate_arrownp(anp);
anp->u.arrow.parent = NULL;
find_first_arrow(&Ninfo, anp);
if (Ninfo.ex) {
lut_free(Ninfo.ex, iterinfo_destructor, NULL);
Ninfo.ex = NULL;
}
cp_reset(anp);
}
out(O_ALTFP|O_STAMP, "itree_create added %d bytes",
alloc_total() - init_size);
retval = Ninfo.lut;
Ninfo.lut = NULL;
return (retval);
}
/*
* initial first pass of the rules.
* We don't use the config at all. Just check the last part of the pathname
* in the rules. If this matches the last part of the pathname in the first
* ereport, then set pathname to the pathname in the ereport. If not then
* set pathname to just the last part of pathname with instance number 0.
* Constraints are ignored and all nork values are set to 0. If after all that
* any rules can still not be associated with the ereport, then they are set
* to not needed in prune_propagations() and ignored in the real itree_create()
* which follows.
*/
static struct event *
add_event_dummy(struct node *np, const struct ipath *ipp)
{
struct event *ret;
struct event searchevent; /* just used for searching */
extern struct ipath *ipath_dummy(struct node *, struct ipath *);
struct ipath *ipp_un;
extern struct ipath *ipath_for_usednames(struct node *);
searchevent.enode = np;
searchevent.ipp = ipath_dummy(np->u.event.epname, (struct ipath *)ipp);
ipp_un = ipath_for_usednames(np->u.event.epname);
if ((ret = lut_lookup(Ninfo.lut, (void *)&searchevent,
(lut_cmp)event_cmp)) != NULL)
return (ret);
ret = alloc_xmalloc(sizeof (*ret));
bzero(ret, sizeof (*ret));
ret->t = np->u.event.ename->u.name.t;
ret->enode = np;
ret->ipp = searchevent.ipp;
ret->ipp_un = ipp_un;
Ninfo.lut = lut_add(Ninfo.lut, (void *)ret, (void *)ret,
(lut_cmp)event_cmp);
return (ret);
}
/*ARGSUSED*/
struct lut *
itree_create_dummy(const char *e0class, const struct ipath *e0ipp)
{
struct node *propnp;
struct event *frome, *toe;
struct bubble *frombp, *tobp;
struct arrow *arrowp;
struct node *src, *dst, *slst, *dlst, *arrownp, *oldarrownp;
int gen = 0;
extern int alloc_total();
int init_size;
Ninfo.lut = NULL;
init_size = alloc_total();
out(O_ALTFP|O_STAMP, "start itree_create using %d bytes", init_size);
for (propnp = Props; propnp; propnp = propnp->u.stmt.next) {
arrownp = propnp->u.stmt.np;
while (arrownp) {
gen++;
dlst = arrownp->u.arrow.rhs;
slst = arrownp->u.arrow.lhs;
oldarrownp = arrownp;
if (slst->t == T_ARROW) {
arrownp = slst;
slst = slst->u.arrow.rhs;
} else {
arrownp = NULL;
}
while (slst) {
if (slst->t == T_LIST) {
src = slst->u.expr.right;
slst = slst->u.expr.left;
} else {
src = slst;
slst = NULL;
}
frome = add_event_dummy(src, e0ipp);
frombp = itree_add_bubble(frome, B_FROM, 0, 0);
while (dlst) {
if (dlst->t == T_LIST) {
dst = dlst->u.expr.right;
dlst = dlst->u.expr.left;
} else {
dst = dlst;
dlst = NULL;
}
arrowp = alloc_xmalloc(
sizeof (struct arrow));
bzero(arrowp, sizeof (struct arrow));
arrowp->pnode = oldarrownp;
toe = add_event_dummy(dst, e0ipp);
tobp = itree_add_bubble(toe, B_TO, 0,
gen);
arrowp->tail = frombp;
arrowp->head = tobp;
add_arrow(frombp, arrowp);
add_arrow(tobp, arrowp);
arrow_add_within(arrowp,
dst->u.event.declp->u.stmt.np->
u.event.eexprlist);
arrow_add_within(arrowp,
dst->u.event.eexprlist);
}
}
}
}
out(O_ALTFP|O_STAMP, "itree_create added %d bytes",
alloc_total() - init_size);
return (Ninfo.lut);
}
void
itree_free(struct lut *lutp)
{
int init_size;
init_size = alloc_total();
out(O_ALTFP|O_STAMP, "start itree_free");
lut_free(lutp, itree_destructor, NULL);
out(O_ALTFP|O_STAMP, "itree_free freed %d bytes",
init_size - alloc_total());
}
void
itree_prune(struct lut *lutp)
{
int init_size;
init_size = alloc_total();
out(O_ALTFP|O_STAMP, "start itree_prune");
lut_walk(lutp, itree_pruner, NULL);
out(O_ALTFP|O_STAMP, "itree_prune freed %d bytes",
init_size - alloc_total());
}
void
itree_pevent_brief(int flags, struct event *ep)
{
ASSERT(ep != NULL);
ASSERT(ep->enode != NULL);
ASSERT(ep->ipp != NULL);
ipath_print(flags, ep->enode->u.event.ename->u.name.s, ep->ipp);
}
/*ARGSUSED*/
static void
itree_pevent(struct event *lhs, struct event *ep, void *arg)
{
struct plut_wlk_data propd;
struct bubble *bp;
int flags = (int)(intptr_t)arg;
itree_pevent_brief(flags, ep);
if (ep->t == N_EREPORT)
out(flags, " (count %d)", ep->count);
else
out(flags, NULL);
if (ep->props) {
propd.flags = flags;
propd.first = 1;
out(flags, "Properties:");
lut_walk(ep->props, ptree_plut, (void *)&propd);
}
for (bp = itree_next_bubble(ep, NULL); bp;
bp = itree_next_bubble(ep, bp)) {
/* Print only TO bubbles in this loop */
if (bp->t != B_TO)
continue;
itree_pbubble(flags, bp);
}
for (bp = itree_next_bubble(ep, NULL); bp;
bp = itree_next_bubble(ep, bp)) {
/* Print only INHIBIT bubbles in this loop */
if (bp->t != B_INHIBIT)
continue;
itree_pbubble(flags, bp);
}
for (bp = itree_next_bubble(ep, NULL); bp;
bp = itree_next_bubble(ep, bp)) {
/* Print only FROM bubbles in this loop */
if (bp->t != B_FROM)
continue;
itree_pbubble(flags, bp);
}
}
static void
itree_pbubble(int flags, struct bubble *bp)
{
struct constraintlist *cp;
struct arrowlist *ap;
ASSERT(bp != NULL);
out(flags|O_NONL, " ");
if (bp->mark)
out(flags|O_NONL, "*");
else
out(flags|O_NONL, " ");
if (bp->t == B_FROM)
out(flags|O_NONL, "N=%d to:", bp->nork);
else if (bp->t == B_TO)
out(flags|O_NONL, "K=%d from:", bp->nork);
else
out(flags|O_NONL, "K=%d masked from:", bp->nork);
if (bp->t == B_TO || bp->t == B_INHIBIT) {
for (ap = itree_next_arrow(bp, NULL); ap;
ap = itree_next_arrow(bp, ap)) {
ASSERT(ap->arrowp->head == bp);
ASSERT(ap->arrowp->tail != NULL);
ASSERT(ap->arrowp->tail->myevent != NULL);
out(flags|O_NONL, " ");
itree_pevent_brief(flags, ap->arrowp->tail->myevent);
}
out(flags, NULL);
return;
}
for (ap = itree_next_arrow(bp, NULL); ap;
ap = itree_next_arrow(bp, ap)) {
ASSERT(ap->arrowp->tail == bp);
ASSERT(ap->arrowp->head != NULL);
ASSERT(ap->arrowp->head->myevent != NULL);
out(flags|O_NONL, " ");
itree_pevent_brief(flags, ap->arrowp->head->myevent);
out(flags|O_NONL, " ");
ptree_timeval(flags, &ap->arrowp->mindelay);
out(flags|O_NONL, ",");
ptree_timeval(flags, &ap->arrowp->maxdelay);
/* Display anything from the propogation node? */
out(O_VERB3|O_NONL, " <%s:%d>",
ap->arrowp->pnode->file, ap->arrowp->pnode->line);
if (itree_next_constraint(ap->arrowp, NULL))
out(flags|O_NONL, " {");
for (cp = itree_next_constraint(ap->arrowp, NULL); cp;
cp = itree_next_constraint(ap->arrowp, cp)) {
ptree(flags, cp->cnode, 1, 0);
if (itree_next_constraint(ap->arrowp, cp))
out(flags|O_NONL, ", ");
}
if (itree_next_constraint(ap->arrowp, NULL))
out(flags|O_NONL, "}");
}
out(flags, NULL);
}
void
itree_ptree(int flags, struct lut *itp)
{
lut_walk(itp, (lut_cb)itree_pevent, (void *)(intptr_t)flags);
}
/*ARGSUSED*/
static void
itree_destructor(void *left, void *right, void *arg)
{
struct event *ep = (struct event *)right;
struct bubble *nextbub, *bub;
/* Free the properties */
if (ep->props)
lut_free(ep->props, instances_destructor, NULL);
/* Free the payload properties */
if (ep->payloadprops)
lut_free(ep->payloadprops, payloadprops_destructor, NULL);
/* Free the serd properties */
if (ep->serdprops)
lut_free(ep->serdprops, serdprops_destructor, NULL);
/* Free my bubbles */
for (bub = ep->bubbles; bub != NULL; ) {
nextbub = bub->next;
/*
* Free arrows if they are FROM me. Free arrowlists on
* other types of bubbles (but not the attached arrows,
* which will be freed when we free the originating
* bubble.
*/
if (bub->t == B_FROM)
itree_free_arrowlists(bub, 1);
else
itree_free_arrowlists(bub, 0);
itree_free_bubble(bub);
bub = nextbub;
}
nvlist_free(ep->nvp);
alloc_xfree(ep, sizeof (*ep));
}
/*ARGSUSED*/
static void
itree_pruner(void *left, void *right, void *arg)
{
struct event *ep = (struct event *)right;
struct bubble *nextbub, *bub;
if (ep->keep_in_tree)
return;
/* Free the properties */
lut_free(ep->props, instances_destructor, NULL);
/* Free the payload properties */
lut_free(ep->payloadprops, payloadprops_destructor, NULL);
/* Free the serd properties */
lut_free(ep->serdprops, serdprops_destructor, NULL);
/* Free my bubbles */
for (bub = ep->bubbles; bub != NULL; ) {
nextbub = bub->next;
itree_prune_arrowlists(bub);
itree_free_bubble(bub);
bub = nextbub;
}
nvlist_free(ep->nvp);
ep->props = NULL;
ep->payloadprops = NULL;
ep->serdprops = NULL;
ep->bubbles = NULL;
ep->nvp = NULL;
}
static void
itree_free_bubble(struct bubble *freeme)
{
alloc_xfree(freeme, sizeof (*freeme));
}
static struct bubble *
itree_add_bubble(struct event *eventp, enum bubbletype btype, int nork, int gen)
{
struct bubble *prev = NULL;
struct bubble *curr;
struct bubble *newb;
/* Use existing bubbles as appropriate when possible */
for (curr = eventp->bubbles;
curr != NULL;
prev = curr, curr = curr->next) {
if (btype == B_TO && curr->t == B_TO) {
/* see if an existing "to" bubble works for us */
if (gen == curr->gen)
return (curr); /* matched gen number */
else if (nork == 1 && curr->nork == 1) {
curr->gen = gen;
return (curr); /* coalesce K==1 bubbles */
}
} else if (btype == B_FROM && curr->t == B_FROM) {
/* see if an existing "from" bubble works for us */
if ((nork == N_IS_ALL && curr->nork == N_IS_ALL) ||
(nork == 0 && curr->nork == 0))
return (curr);
}
}
newb = alloc_xmalloc(sizeof (struct bubble));
newb->next = NULL;
newb->t = btype;
newb->myevent = eventp;
newb->nork = nork;
newb->mark = 0;
newb->gen = gen;
newb->arrows = NULL;
if (prev == NULL)
eventp->bubbles = newb;
else
prev->next = newb;
return (newb);
}
struct bubble *
itree_next_bubble(struct event *eventp, struct bubble *last)
{
struct bubble *next;
for (;;) {
if (last != NULL)
next = last->next;
else
next = eventp->bubbles;
if (next == NULL || next->arrows != NULL)
return (next);
/* bubble was empty, skip it */
last = next;
}
}
static void
add_arrow(struct bubble *bp, struct arrow *ap)
{
struct arrowlist *prev = NULL;
struct arrowlist *curr;
struct arrowlist *newal;
newal = alloc_xmalloc(sizeof (struct arrowlist));
bzero(newal, sizeof (struct arrowlist));
newal->arrowp = ap;
curr = itree_next_arrow(bp, NULL);
while (curr != NULL) {
prev = curr;
curr = itree_next_arrow(bp, curr);
}
if (prev == NULL)
bp->arrows = newal;
else
prev->next = newal;
}
static struct arrow *
itree_add_arrow(struct node *apnode, struct node *fromevent,
struct node *toevent, struct lut *ex)
{
struct arrow *newa;
newa = alloc_xmalloc(sizeof (struct arrow));
bzero(newa, sizeof (struct arrow));
newa->pnode = apnode;
newa->constraints = NULL;
/*
* Set default delays, then try to re-set them from
* any within() constraints.
*/
newa->mindelay = newa->maxdelay = 0ULL;
if (itree_set_arrow_traits(newa, fromevent, toevent, ex) == 0) {
alloc_xfree(newa, sizeof (struct arrow));
return (NULL);
}
return (newa);
}
/* returns false if traits show that arrow should not be added after all */
static int
itree_set_arrow_traits(struct arrow *ap, struct node *fromev,
struct node *toev, struct lut *ex)
{
struct node *events[] = { NULL, NULL, NULL };
struct node *newc = NULL;
ASSERTeq(fromev->t, T_EVENT, ptree_nodetype2str);
ASSERTeq(toev->t, T_EVENT, ptree_nodetype2str);
/*
* search for the within values first on the declaration of
* the destination event, and then on the prop. this allows
* one to specify a "default" within by putting it on the
* declaration, but then allow overriding on the prop statement.
*/
arrow_add_within(ap, toev->u.event.declp->u.stmt.np->u.event.eexprlist);
arrow_add_within(ap, toev->u.event.eexprlist);
/*
* handle any global constraints inherited from the
* "fromev" event's declaration
*/
ASSERT(fromev->u.event.declp != NULL);
ASSERT(fromev->u.event.declp->u.stmt.np != NULL);
#ifdef notdef
/* XXX not quite ready to evaluate constraints from decls yet */
if (fromev->u.event.declp->u.stmt.np->u.event.eexprlist)
(void) itree_add_constraint(ap,
fromev->u.event.declp->u.stmt.np->u.event.eexprlist);
#endif /* notdef */
/* handle constraints on the from event in the prop statement */
events[0] = fromev;
events[1] = toev;
if (eval_potential(fromev->u.event.eexprlist, ex, events, &newc,
Ninfo.croot) == 0)
return (0); /* constraint disallows arrow */
/*
* handle any global constraints inherited from the
* "toev" event's declaration
*/
ASSERT(toev->u.event.declp != NULL);
ASSERT(toev->u.event.declp->u.stmt.np != NULL);
#ifdef notdef
/* XXX not quite ready to evaluate constraints from decls yet */
if (toev->u.event.declp->u.stmt.np->u.event.eexprlist)
(void) itree_add_constraint(ap,
toev->u.event.declp->u.stmt.np->u.event.eexprlist);
#endif /* notdef */
/* handle constraints on the to event in the prop statement */
events[0] = toev;
events[1] = fromev;
if (eval_potential(toev->u.event.eexprlist, ex, events, &newc,
Ninfo.croot) == 0) {
if (newc != NULL)
tree_free(newc);
return (0); /* constraint disallows arrow */
}
/* if we came up with any deferred constraints, add them to arrow */
if (newc != NULL) {
out(O_ALTFP|O_VERB3, "(deferred constraints)");
(void) itree_add_constraint(ap, iexpr(newc));
}
return (1); /* constraints allow arrow */
}
/*
* Set within() constraint. If the constraint were set multiple times,
* the last one would "win".
*/
static void
arrow_add_within(struct arrow *ap, struct node *xpr)
{
struct node *arglist;
/* end of expressions list */
if (xpr == NULL)
return;
switch (xpr->t) {
case T_LIST:
arrow_add_within(ap, xpr->u.expr.left);
arrow_add_within(ap, xpr->u.expr.right);
return;
case T_FUNC:
if (xpr->u.func.s != L_within)
return;
arglist = xpr->u.func.arglist;
switch (arglist->t) {
case T_TIMEVAL:
ap->mindelay = 0;
ap->maxdelay = arglist->u.ull;
break;
case T_NAME:
ASSERT(arglist->u.name.s == L_infinity);
ap->mindelay = 0;
ap->maxdelay = TIMEVAL_EVENTUALLY;
break;
case T_LIST:
ASSERT(arglist->u.expr.left->t == T_TIMEVAL);
ap->mindelay = arglist->u.expr.left->u.ull;
switch (arglist->u.expr.right->t) {
case T_TIMEVAL:
ap->maxdelay = arglist->u.ull;
break;
case T_NAME:
ASSERT(arglist->u.expr.right->u.name.s ==
L_infinity);
ap->maxdelay = TIMEVAL_EVENTUALLY;
break;
default:
out(O_DIE, "within: unexpected 2nd arg type");
}
break;
default:
out(O_DIE, "within: unexpected 1st arg type");
}
break;
default:
return;
}
}
static void
itree_free_arrowlists(struct bubble *bubp, int arrows_too)
{
struct arrowlist *al, *nal;
al = bubp->arrows;
while (al != NULL) {
nal = al->next;
if (arrows_too) {
itree_free_constraints(al->arrowp);
alloc_xfree(al->arrowp, sizeof (struct arrow));
}
alloc_xfree(al, sizeof (*al));
al = nal;
}
}
static void
itree_delete_arrow(struct bubble *bubp, struct arrow *arrow)
{
struct arrowlist *al, *oal;
al = bubp->arrows;
if (al->arrowp == arrow) {
bubp->arrows = al->next;
alloc_xfree(al, sizeof (*al));
return;
}
while (al != NULL) {
oal = al;
al = al->next;
ASSERT(al != NULL);
if (al->arrowp == arrow) {
oal->next = al->next;
alloc_xfree(al, sizeof (*al));
return;
}
}
}
static void
itree_prune_arrowlists(struct bubble *bubp)
{
struct arrowlist *al, *nal;
al = bubp->arrows;
while (al != NULL) {
nal = al->next;
if (bubp->t == B_FROM)
itree_delete_arrow(al->arrowp->head, al->arrowp);
else
itree_delete_arrow(al->arrowp->tail, al->arrowp);
itree_free_constraints(al->arrowp);
alloc_xfree(al->arrowp, sizeof (struct arrow));
alloc_xfree(al, sizeof (*al));
al = nal;
}
}
struct arrowlist *
itree_next_arrow(struct bubble *bubble, struct arrowlist *last)
{
struct arrowlist *next;
if (last != NULL)
next = last->next;
else
next = bubble->arrows;
return (next);
}
static struct constraintlist *
itree_add_constraint(struct arrow *arrowp, struct node *c)
{
struct constraintlist *prev = NULL;
struct constraintlist *curr;
struct constraintlist *newc;
for (curr = arrowp->constraints;
curr != NULL;
prev = curr, curr = curr->next)
;
newc = alloc_xmalloc(sizeof (struct constraintlist));
newc->next = NULL;
newc->cnode = c;
if (prev == NULL)
arrowp->constraints = newc;
else
prev->next = newc;
return (newc);
}
struct constraintlist *
itree_next_constraint(struct arrow *arrowp, struct constraintlist *last)
{
struct constraintlist *next;
if (last != NULL)
next = last->next;
else
next = arrowp->constraints;
return (next);
}
static void
itree_free_constraints(struct arrow *ap)
{
struct constraintlist *cl, *ncl;
cl = ap->constraints;
while (cl != NULL) {
ncl = cl->next;
ASSERT(cl->cnode != NULL);
if (!iexpr_cached(cl->cnode))
tree_free(cl->cnode);
else
iexpr_free(cl->cnode);
alloc_xfree(cl, sizeof (*cl));
cl = ncl;
}
}
const char *
itree_bubbletype2str(enum bubbletype t)
{
static char buf[100];
switch (t) {
case B_FROM: return L_from;
case B_TO: return L_to;
case B_INHIBIT: return L_inhibit;
default:
(void) sprintf(buf, "[unexpected bubbletype: %d]", t);
return (buf);
}
}
/*
* itree_fini -- clean up any half-built itrees
*/
void
itree_fini(void)
{
if (Ninfo.lut != NULL) {
itree_free(Ninfo.lut);
Ninfo.lut = NULL;
}
if (Ninfo.ex) {
lut_free(Ninfo.ex, iterinfo_destructor, NULL);
Ninfo.ex = NULL;
}
}
|