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
|
local util = require 'utility'
local error = error
local type = type
local next = next
local tostring = tostring
local print = print
local ipairs = ipairs
local tableInsert = table.insert
local tableUnpack = table.unpack
local tableRemove = table.remove
local tableMove = table.move
local pairs = pairs
_ENV = nil
local m = {}
local blockTypes = {
['while'] = true,
['in'] = true,
['loop'] = true,
['repeat'] = true,
['do'] = true,
['function'] = true,
['ifblock'] = true,
['elseblock'] = true,
['elseifblock'] = true,
['main'] = true,
}
local breakBlockTypes = {
['while'] = true,
['in'] = true,
['loop'] = true,
['repeat'] = true,
}
m.childMap = {
['main'] = {'#'},
['repeat'] = {'#', 'filter'},
['while'] = {'filter', '#'},
['in'] = {'keys', '#'},
['loop'] = {'loc', 'max', 'step', '#'},
['if'] = {'#'},
['ifblock'] = {'filter', '#'},
['elseifblock'] = {'filter', '#'},
['elseblock'] = {'#'},
['setfield'] = {'node', 'field', 'value'},
['setglobal'] = {'value'},
['local'] = {'attrs', 'value'},
['setlocal'] = {'value'},
['return'] = {'#'},
['do'] = {'#'},
['select'] = {'vararg'},
['table'] = {'#'},
['tableindex'] = {'index', 'value'},
['tablefield'] = {'field', 'value'},
['function'] = {'args', '#'},
['funcargs'] = {'#'},
['setmethod'] = {'node', 'method', 'value'},
['getmethod'] = {'node', 'method'},
['setindex'] = {'node', 'index', 'value'},
['getindex'] = {'node', 'index'},
['paren'] = {'exp'},
['call'] = {'node', 'args'},
['callargs'] = {'#'},
['getfield'] = {'node', 'field'},
['list'] = {'#'},
['binary'] = {1, 2},
['unary'] = {1}
}
m.actionMap = {
['main'] = {'#'},
['repeat'] = {'#'},
['while'] = {'#'},
['in'] = {'#'},
['loop'] = {'#'},
['if'] = {'#'},
['ifblock'] = {'#'},
['elseifblock'] = {'#'},
['elseblock'] = {'#'},
['do'] = {'#'},
['function'] = {'#'},
['funcargs'] = {'#'},
}
--- 是否是字面量
function m.isLiteral(obj)
local tp = obj.type
return tp == 'nil'
or tp == 'boolean'
or tp == 'string'
or tp == 'number'
or tp == 'table'
end
--- 获取字面量
function m.getLiteral(obj)
local tp = obj.type
if tp == 'boolean' then
return obj[1]
elseif tp == 'string' then
return obj[1]
elseif tp == 'number' then
return obj[1]
end
return nil
end
--- 寻找父函数
function m.getParentFunction(obj)
for _ = 1, 1000 do
obj = obj.parent
if not obj then
break
end
local tp = obj.type
if tp == 'function' or tp == 'main' then
return obj
end
end
return nil
end
--- 寻找所在区块
function m.getBlock(obj)
for _ = 1, 1000 do
if not obj then
return nil
end
local tp = obj.type
if blockTypes[tp] then
return obj
end
obj = obj.parent
end
error('guide.getBlock overstack')
end
--- 寻找所在父区块
function m.getParentBlock(obj)
for _ = 1, 1000 do
obj = obj.parent
if not obj then
return nil
end
local tp = obj.type
if blockTypes[tp] then
return obj
end
end
error('guide.getParentBlock overstack')
end
--- 寻找所在可break的父区块
function m.getBreakBlock(obj)
for _ = 1, 1000 do
obj = obj.parent
if not obj then
return nil
end
local tp = obj.type
if breakBlockTypes[tp] then
return obj
end
if tp == 'function' then
return nil
end
end
error('guide.getBreakBlock overstack')
end
--- 寻找根区块
function m.getRoot(obj)
for _ = 1, 1000 do
local parent = obj.parent
if not parent then
return obj
end
obj = parent
end
error('guide.getRoot overstack')
end
--- 寻找函数的不定参数,返回不定参在第几个参数上,以及该参数对象。
--- 如果函数是主函数,则返回`0, nil`。
---@return table
---@return integer
function m.getFunctionVarArgs(func)
if func.type == 'main' then
return 0, nil
end
if func.type ~= 'function' then
return nil, nil
end
local args = func.args
if not args then
return nil, nil
end
for i = 1, #args do
local arg = args[i]
if arg.type == '...' then
return i, arg
end
end
return nil, nil
end
--- 获取指定区块中可见的局部变量
---@param block table
---@param name string {comment = '变量名'}
---@param pos integer {comment = '可见位置'}
function m.getLocal(block, name, pos)
block = m.getBlock(block)
for _ = 1, 1000 do
if not block then
return nil
end
local locals = block.locals
local res
if not locals then
goto CONTINUE
end
for i = 1, #locals do
local loc = locals[i]
if loc.effect > pos then
break
end
if loc[1] == name then
if not res or res.effect < loc.effect then
res = loc
end
end
end
if res then
return res, res
end
::CONTINUE::
block = m.getParentBlock(block)
end
error('guide.getLocal overstack')
end
--- 获取指定区块中所有的可见局部变量名称
function m.getVisibleLocals(block, pos)
local result = {}
m.eachSourceContain(m.getRoot(block), pos, function (source)
local locals = source.locals
if locals then
for i = 1, #locals do
local loc = locals[i]
local name = loc[1]
if loc.effect <= pos then
result[name] = loc
end
end
end
end)
return result
end
--- 获取指定区块中可见的标签
---@param block table
---@param name string {comment = '标签名'}
function m.getLabel(block, name)
block = m.getBlock(block)
for _ = 1, 1000 do
if not block then
return nil
end
local labels = block.labels
if labels then
local label = labels[name]
if label then
return label
end
end
if block.type == 'function' then
return nil
end
block = m.getParentBlock(block)
end
error('guide.getLocal overstack')
end
--- 判断source是否包含offset
function m.isContain(source, offset)
return source.start <= offset and source.finish >= offset - 1
end
--- 判断offset在source的影响范围内
---
--- 主要针对赋值等语句时,key包含value
function m.isInRange(source, offset)
return (source.vstart or source.start) <= offset and (source.range or source.finish) >= offset - 1
end
--- 添加child
function m.addChilds(list, obj, map)
local keys = map[obj.type]
if keys then
for i = 1, #keys do
local key = keys[i]
if key == '#' then
for i = 1, #obj do
list[#list+1] = obj[i]
end
else
list[#list+1] = obj[key]
end
end
end
end
--- 遍历所有包含offset的source
function m.eachSourceContain(ast, offset, callback)
local list = { ast }
local mark = {}
while true do
local len = #list
if len == 0 then
return
end
local obj = list[len]
list[len] = nil
if not mark[obj] then
mark[obj] = true
if m.isInRange(obj, offset) then
if m.isContain(obj, offset) then
local res = callback(obj)
if res ~= nil then
return res
end
end
m.addChilds(list, obj, m.childMap)
end
end
end
end
--- 遍历所有指定类型的source
function m.eachSourceType(ast, type, callback)
local cache = ast.typeCache
if not cache then
cache = {}
ast.typeCache = cache
m.eachSource(ast, function (source)
local tp = source.type
if not tp then
return
end
local myCache = cache[tp]
if not myCache then
myCache = {}
cache[tp] = myCache
end
myCache[#myCache+1] = source
end)
end
local myCache = cache[type]
if not myCache then
return
end
for i = 1, #myCache do
callback(myCache[i])
end
end
--- 遍历所有的source
function m.eachSource(ast, callback)
local list = { ast }
local mark = {}
local index = 1
while true do
local obj = list[index]
if not obj then
return
end
list[index] = false
index = index + 1
if not mark[obj] then
mark[obj] = true
callback(obj)
m.addChilds(list, obj, m.childMap)
end
end
end
--- 获取指定的 special
function m.eachSpecialOf(ast, name, callback)
local root = m.getRoot(ast)
if not root.specials then
return
end
local specials = root.specials[name]
if not specials then
return
end
for i = 1, #specials do
callback(specials[i])
end
end
--- 获取偏移对应的坐标
---@param lines table
---@return integer {name = 'row'}
---@return integer {name = 'col'}
function m.positionOf(lines, offset)
if offset < 1 then
return 0, 0
end
local lastLine = lines[#lines]
if offset > lastLine.finish then
return #lines, lastLine.finish - lastLine.start + 1
end
local min = 1
local max = #lines
for _ = 1, 100 do
if max <= min then
local line = lines[min]
return min, offset - line.start + 1
end
local row = (max - min) // 2 + min
local line = lines[row]
if offset < line.start then
max = row - 1
elseif offset > line.finish then
min = row + 1
else
return row, offset - line.start + 1
end
end
error('Stack overflow!')
end
--- 获取坐标对应的偏移
---@param lines table
---@param row integer
---@param col integer
---@return integer {name = 'offset'}
function m.offsetOf(lines, row, col)
if row < 1 then
return 0
end
if row > #lines then
local lastLine = lines[#lines]
return lastLine.finish
end
local line = lines[row]
local len = line.finish - line.start + 1
if col < 0 then
return line.start
elseif col > len then
return line.finish
else
return line.start + col - 1
end
end
function m.lineContent(lines, text, row)
local line = lines[row]
if not line then
return ''
end
return text:sub(line.start, line.finish)
end
function m.lineRange(lines, row)
local line = lines[row]
if not line then
return 0, 0
end
return line.start, line.finish
end
function m.getNameOfLiteral(obj)
if not obj then
return nil
end
local tp = obj.type
if tp == 'string' then
return obj[1]
end
return nil
end
function m.getName(obj)
local tp = obj.type
if tp == 'getglobal'
or tp == 'setglobal' then
return obj[1]
elseif tp == 'local'
or tp == 'getlocal'
or tp == 'setlocal' then
return obj[1]
elseif tp == 'getfield'
or tp == 'setfield'
or tp == 'tablefield' then
return obj.field[1]
elseif tp == 'getmethod'
or tp == 'setmethod' then
return obj.method[1]
elseif tp == 'getindex'
or tp == 'setindex'
or tp == 'tableindex' then
return m.getNameOfLiteral(obj.index)
elseif tp == 'field'
or tp == 'method' then
return obj[1]
end
return m.getNameOfLiteral(obj)
end
function m.getKeyNameOfLiteral(obj)
if not obj then
return nil
end
local tp = obj.type
if tp == 'field'
or tp == 'method' then
return 's|' .. obj[1]
elseif tp == 'string' then
local s = obj[1]
if s then
return 's|' .. s
else
return s
end
elseif tp == 'number' then
local n = obj[1]
if n then
return ('n|%s'):format(util.viewLiteral(obj[1]))
else
return 'n'
end
elseif tp == 'boolean' then
local b = obj[1]
if b then
return 'b|' .. tostring(b)
else
return 'b'
end
end
return nil
end
function m.getKeyName(obj)
local tp = obj.type
if tp == 'getglobal'
or tp == 'setglobal' then
return 's|' .. obj[1]
elseif tp == 'local'
or tp == 'getlocal'
or tp == 'setlocal' then
return 'l|' .. obj[1]
elseif tp == 'getfield'
or tp == 'setfield'
or tp == 'tablefield' then
if obj.field then
return 's|' .. obj.field[1]
end
elseif tp == 'getmethod'
or tp == 'setmethod' then
if obj.method then
return 's|' .. obj.method[1]
end
elseif tp == 'getindex'
or tp == 'setindex'
or tp == 'tableindex' then
return m.getKeyNameOfLiteral(obj.index)
elseif tp == 'field'
or tp == 'method' then
return 's|' .. obj[1]
end
return m.getKeyNameOfLiteral(obj)
end
function m.getSimpleName(obj)
if obj.type == 'call' then
local key = obj.args[2]
return m.getKeyName(key)
end
return m.getKeyName(obj)
end
function m.getENV(ast)
if ast.type ~= 'main' then
return nil
end
return ast.locals[1]
end
--- 测试 a 到 b 的路径(不经过函数,不考虑 goto),
--- 每个路径是一个 block 。
---
--- 如果 a 在 b 的前面,返回 `"before"` 加上 2个`list<block>`
---
--- 如果 a 在 b 的后面,返回 `"after"` 加上 2个`list<block>`
---
--- 否则返回 `false`
---
--- 返回的2个 `list` 分别为基准block到达 a 与 b 的路径。
---@param a table
---@param b table
---@return string|boolean mode
---@return table|nil pathA
---@return table|nil pathB
function m.getPath(a, b, sameFunction)
--- 首先测试双方在同一个函数内
if not sameFunction and m.getParentFunction(a) ~= m.getParentFunction(b) then
return false
end
local mode
local objA
local objB
if a.finish < b.start then
mode = 'before'
objA = a
objB = b
elseif a.start > b.finish then
mode = 'after'
objA = b
objB = a
else
return 'equal', {}, {}
end
local pathA = {}
local pathB = {}
for _ = 1, 1000 do
objA = m.getParentBlock(objA)
pathA[#pathA+1] = objA
if (not sameFunction and objA.type == 'function') or objA.type == 'main' then
break
end
end
for _ = 1, 1000 do
objB = m.getParentBlock(objB)
pathB[#pathB+1] = objB
if (not sameFunction and objA.type == 'function') or objB.type == 'main' then
break
end
end
-- pathA: {1, 2, 3, 4, 5}
-- pathB: {5, 6, 2, 3}
local top = #pathB
local start
for i = #pathA, 1, -1 do
local currentBlock = pathA[i]
if currentBlock == pathB[top] then
start = i
break
end
end
if not start then
return nil
end
-- pathA: { 1, 2, 3}
-- pathB: {5, 6, 2, 3}
local extra = 0
local align = top - start
for i = start, 1, -1 do
local currentA = pathA[i]
local currentB = pathB[i+align]
if currentA ~= currentB then
extra = i
break
end
end
-- pathA: {1}
local resultA = {}
for i = extra, 1, -1 do
resultA[#resultA+1] = pathA[i]
end
-- pathB: {5, 6}
local resultB = {}
for i = extra + align, 1, -1 do
resultB[#resultB+1] = pathB[i]
end
return mode, resultA, resultB
end
-- 根据语法,单步搜索定义
local function stepRefOfLocal(loc, mode)
local results = {}
if loc.start ~= 0 then
results[#results+1] = loc
end
local refs = loc.ref
if not refs then
return results
end
for i = 1, #refs do
local ref = refs[i]
if ref.start == 0 then
goto CONTINUE
end
if mode == 'def' then
if ref.type == 'local'
or ref.type == 'setlocal' then
results[#results+1] = ref
end
else
if ref.type == 'local'
or ref.type == 'setlocal'
or ref.type == 'getlocal' then
results[#results+1] = ref
end
end
::CONTINUE::
end
return results
end
local function stepRefOfLabel(label, mode)
local results = { label }
if not label or mode == 'def' then
return results
end
local refs = label.ref
for i = 1, #refs do
local ref = refs[i]
results[#results+1] = ref
end
return results
end
local function stepRefOfGlobal(obj, mode)
local results = {}
local name = m.getKeyName(obj)
local refs = obj.node.ref
for i = 1, #refs do
local ref = refs[i]
if m.getKeyName(ref) == name then
if mode == 'def' then
if obj == 'setglobal' then
results[#results+1] = ref
end
else
results[#results+1] = ref
end
end
end
return results
end
function m.getStepRef(obj, mode)
if obj.type == 'getlocal'
or obj.type == 'setlocal' then
return stepRefOfLocal(obj.node, mode)
end
if obj.type == 'local' then
return stepRefOfLocal(obj, mode)
end
if obj.type == 'label' then
return stepRefOfLabel(obj, mode)
end
if obj.type == 'goto' then
return stepRefOfLabel(obj.node, mode)
end
if obj.type == 'getglobal'
or obj.type == 'setglobal' then
return stepRefOfGlobal(obj, mode)
end
return nil
end
-- 根据语法,单步搜索field
local function stepFieldOfLocal(loc)
local results = {}
local refs = loc.ref
for i = 1, #refs do
local ref = refs[i]
if ref.type == 'setglobal'
or ref.type == 'getglobal' then
results[#results+1] = ref
elseif ref.type == 'getlocal' then
local nxt = ref.next
if nxt then
if nxt.type == 'setfield'
or nxt.type == 'getfield'
or nxt.type == 'setmethod'
or nxt.type == 'getmethod'
or nxt.type == 'setindex'
or nxt.type == 'getindex' then
results[#results+1] = nxt
end
end
end
end
return results
end
local function stepFieldOfTable(tbl)
local result = {}
for i = 1, #tbl do
result[i] = tbl[i]
end
return result
end
function m.getStepField(obj)
if obj.type == 'getlocal'
or obj.type == 'setlocal' then
return stepFieldOfLocal(obj.node)
end
if obj.type == 'local' then
return stepFieldOfLocal(obj)
end
if obj.type == 'table' then
return stepFieldOfTable(obj)
end
end
local function convertSimpleList(list)
local simple = {}
for i = #list, 1, -1 do
local c = list[i]
if c.special == '_G' then
simple.global = true
else
simple[#simple+1] = m.getSimpleName(c)
end
if c.type == 'getglobal'
or c.type == 'setglobal' then
simple.global = true
end
if #simple <= 1 then
if simple.global then
simple.first = m.getLocal(c, '_ENV', c.start)
elseif c.type == 'setlocal'
or c.type == 'getlocal' then
simple.first = c.node
else
simple.first = c
end
end
end
return simple
end
-- 搜索 `a.b.c` 的等价表达式
local function buildSimpleList(obj, max)
local list = {}
local cur = obj
local limit = max and (max + 1) or 11
for i = 1, max or limit do
if i == limit then
return nil
end
if cur.type == 'setfield'
or cur.type == 'getfield'
or cur.type == 'setmethod'
or cur.type == 'getmethod'
or cur.type == 'setindex'
or cur.type == 'getindex' then
list[i] = cur
cur = cur.node
elseif cur.type == 'tablefield'
or cur.type == 'tableindex' then
list[i] = cur
cur = cur.parent.parent
elseif cur.type == 'getlocal'
or cur.type == 'setlocal'
or cur.type == 'local' then
list[i] = cur
break
elseif cur.type == 'setglobal'
or cur.type == 'getglobal' then
list[i] = cur
break
elseif cur.type == 'function'
or cur.type == 'return'
or cur.type == 'main' then
break
else
return nil
end
end
return convertSimpleList(list)
end
function m.getSimple(obj, max)
local simpleList
if obj.type == 'getfield'
or obj.type == 'setfield'
or obj.type == 'getmethod'
or obj.type == 'setmethod'
or obj.type == 'getindex'
or obj.type == 'setindex'
or obj.type == 'local'
or obj.type == 'getlocal'
or obj.type == 'setlocal'
or obj.type == 'setglobal'
or obj.type == 'getglobal'
or obj.type == 'tableindex' then
simpleList = buildSimpleList(obj, max)
elseif obj.type == 'field'
or obj.type == 'method' then
simpleList = buildSimpleList(obj.parent, max)
end
return simpleList
end
m.Version = 53
function m.status(parentStatus, interface)
local status = {
cache = parentStatus and parentStatus.cache or {},
depth = parentStatus and parentStatus.depth or 0,
interface = parentStatus and parentStatus.interface or {},
lock = parentStatus and parentStatus.lock or {},
results = {},
}
if interface then
for k, v in pairs(interface) do
status.interface[k] = interface[k] or v
end
end
return status
end
function m.copyStatusResults(a, b)
local ra = a.results
local rb = b.results
for i = 1, #rb do
ra[#ra+1] = rb[i]
end
end
--- 根据函数的调用参数,获取:调用,参数索引
function m.getCallAndArgIndex(callarg)
local callargs = callarg.parent
if not callargs or callargs.type ~= 'callargs' then
return nil
end
local index
for i = 1, #callargs do
if callargs[i] == callarg then
index = i
break
end
end
local call = callargs.parent
return call, index
end
--- 根据函数调用的返回值,获取:调用的函数,参数列表,自己是第几个返回值
function m.getCallValue(source)
local value = m.getObjectValue(source)
if not value then
return
end
local call, index
if value.type == 'call' then
call = value
index = 1
elseif value.type == 'select' then
call = value.vararg
index = value.index
if call.type ~= 'call' then
return
end
else
return
end
return call.node, call.args, index
end
function m.getNextRef(ref)
local nextRef = ref.next
if nextRef then
if nextRef.type == 'setfield'
or nextRef.type == 'getfield'
or nextRef.type == 'setmethod'
or nextRef.type == 'getmethod'
or nextRef.type == 'setindex'
or nextRef.type == 'getindex' then
return nextRef
end
else
-- 穿透 rawget 与 rawset
local call, index = m.getCallAndArgIndex(ref)
if call then
if call.node.special == 'rawset' and index == 1 then
return call
end
if call.node.special == 'rawget' and index == 1 then
return call
end
end
end
return nil
end
function m.checkSameSimpleInValueOfTable(status, value, start, queue)
if value.type ~= 'table' then
return
end
for i = 1, #value do
local field = value[i]
queue[#queue+1] = {
obj = field,
start = start + 1,
}
end
end
function m.searchFields(status, obj, key, interface)
if obj.type == 'table' then
local keyName = key and ('s|' .. key)
local results = {}
for i = 1, #obj do
local field = obj[i]
if not keyName or keyName == m.getSimpleName(field) then
results[#results+1] = field
end
end
return results
else
local newStatus = m.status(status, interface)
local simple = m.getSimple(obj, 1)
if not simple then
return {}
end
simple[#simple+1] = key and ('s|' .. key) or '*'
m.searchSameFields(newStatus, simple, 'field')
local results = newStatus.results
m.cleanResults(results)
return results
end
end
function m.getObjectValue(obj)
if obj.value then
return obj.value
end
if obj.type == 'field'
or obj.type == 'method' then
return obj.parent.value
end
if obj.type == 'call' then
if obj.node.special == 'rawset' then
return obj.args[3]
end
end
return nil
end
function m.checkSameSimpleInValueInMetaTable(status, mt, start, queue)
local indexes = m.searchFields(status, mt, '__index')
if not indexes then
return
end
local refsStatus = m.status(status)
for i = 1, #indexes do
local indexValue = m.getObjectValue(indexes[i])
if indexValue then
m.searchRefs(refsStatus, indexValue, 'ref')
end
end
for i = 1, #refsStatus.results do
local obj = refsStatus.results[i]
queue[#queue+1] = {
obj = obj,
start = start,
force = true,
}
end
end
function m.checkSameSimpleInValueOfSetMetaTable(status, value, start, queue)
if value.type ~= 'select' then
return
end
local vararg = value.vararg
if not vararg or vararg.type ~= 'call' then
return
end
local func = vararg.node
if not func or func.special ~= 'setmetatable' then
return
end
local args = vararg.args
local obj = args[1]
local mt = args[2]
if obj then
queue[#queue+1] = {
obj = obj,
start = start,
force = true,
}
end
if mt then
m.checkSameSimpleInValueInMetaTable(status, mt, start, queue)
end
end
function m.checkSameSimpleInArg1OfSetMetaTable(status, obj, start, queue)
local args = obj.parent
if not args or args.type ~= 'callargs' then
return
end
if args[1] ~= obj then
return
end
local mt = args[2]
if mt then
m.checkSameSimpleInValueInMetaTable(status, mt, start, queue)
end
end
function m.checkSameSimpleInBranch(status, ref, start, queue)
-- 根据赋值扩大搜索范围
local value = m.getObjectValue(ref)
if value then
-- 检查赋值是字面量表的情况
m.checkSameSimpleInValueOfTable(status, value, start, queue)
-- 检查赋值是 setmetatable 调用的情况
m.checkSameSimpleInValueOfSetMetaTable(status, value, start, queue)
end
-- 检查自己是字面量表的情况
m.checkSameSimpleInValueOfTable(status, ref, start, queue)
-- 检查自己作为 setmetatable 第一个参数的情况
m.checkSameSimpleInArg1OfSetMetaTable(status, ref, start, queue)
end
function m.searchSameMethodCrossSelf(ref, mark)
local selfNode
if ref.tag == 'self' then
selfNode = ref
else
if ref.type == 'getlocal'
or ref.type == 'setlocal' then
local node = ref.node
if node.tag == 'self' then
selfNode = node
end
end
end
if selfNode then
if mark[selfNode] then
return nil
end
mark[selfNode] = true
return selfNode.method.node
end
end
function m.searchSameMethod(ref, mark)
if mark['method'] then
return nil
end
local nxt = ref.next
if not nxt then
return nil
end
if nxt.type == 'setmethod' then
mark['method'] = true
return ref
end
return nil
end
function m.searchSameFieldsCrossMethod(status, ref, start, queue)
local mark = status.cache.crossMethodMark
if not mark then
mark = {}
status.cache.crossMethodMark = mark
end
local method = m.searchSameMethod(ref, mark)
or m.searchSameMethodCrossSelf(ref, mark)
if not method then
return
end
local methodStatus = m.status(status)
m.searchRefs(methodStatus, method, 'ref')
for _, md in ipairs(methodStatus.results) do
queue[#queue+1] = {
obj = md,
start = start,
force = true,
}
local nxt = md.next
if not nxt then
goto CONTINUE
end
if nxt.type == 'setmethod' then
local func = nxt.value
if not func then
goto CONTINUE
end
local selfNode = func.locals and func.locals[1]
if not selfNode or not selfNode.ref then
goto CONTINUE
end
if mark[selfNode] then
goto CONTINUE
end
mark[selfNode] = true
for _, selfRef in ipairs(selfNode.ref) do
queue[#queue+1] = {
obj = selfRef,
start = start,
force = true,
}
end
end
::CONTINUE::
end
end
function m.checkSameSimpleInCallInSameFile(status, func, args, index)
local newStatus = m.status(status)
m.searchRefs(newStatus, func, 'def')
local results = {}
for _, def in ipairs(newStatus.results) do
if def.type == 'function' then
local returns = def.returns
if returns then
for _, ret in ipairs(returns) do
local exp = ret[index]
if exp then
results[#results+1] = exp
end
end
end
end
end
return results
end
function m.checkSameSimpleInCall(status, ref, start, queue, mode)
local func, args, index = m.getCallValue(ref)
if not func then
return
end
local objs = m.checkSameSimpleInCallInSameFile(status, func, args, index)
if status.interface.call then
local cobjs = status.interface.call(func, args, index)
if cobjs then
for _, obj in ipairs(cobjs) do
objs[#objs+1] = obj
end
end
end
local newStatus = m.status(status)
for _, obj in ipairs(objs) do
m.searchRefs(newStatus, obj, mode)
queue[#queue+1] = {
obj = obj,
start = start,
force = true,
call = true,
}
end
for _, obj in ipairs(newStatus.results) do
queue[#queue+1] = {
obj = obj,
start = start,
force = true,
call = true,
}
end
end
function m.checkSameSimpleInGlobal(status, name, start, queue)
if not name then
return
end
if not status.interface.global then
return
end
local objs = status.interface.global(name)
if objs then
for _, obj in ipairs(objs) do
queue[#queue+1] = {
obj = obj,
start = start,
force = true,
}
end
end
end
function m.searchSameFieldsInValue(status, ref, start, queue, mode)
local value = m.getObjectValue(ref)
if not value then
return
end
if not status.cache.valueMark then
status.cache.valueMark = {}
end
if status.cache.valueMark[value] then
return
end
status.cache.valueMark[value] = true
local newStatus = m.status(status)
m.searchRefs(newStatus, value, mode)
for _, res in ipairs(newStatus.results) do
queue[#queue+1] = {
obj = res,
start = start,
force = true,
}
end
end
function m.checkSameSimpleAsTableField(status, ref, start, queue)
local parent = ref.parent
if parent.type ~= 'tablefield' then
return
end
local newStatus = m.status(status)
m.searchRefs(newStatus, parent.field, 'ref')
for _, res in ipairs(newStatus.results) do
queue[#queue+1] = {
obj = res,
start = start,
force = true,
}
end
end
function m.checkSameSimpleAsReturn(status, ref, start, queue)
if ref.parent.type ~= 'return' then
return
end
local newStatus = m.status(status)
m.searchRefsAsFunctionReturn(newStatus, ref, 'ref')
for _, res in ipairs(newStatus.results) do
queue[#queue+1] = {
obj = res,
start = start,
force = true,
}
end
end
function m.checkSameSimpleAsReturnTableField(status, ref, start, queue)
if ref.type ~= 'tablefield' then
return
end
local tbl = ref.parent
if tbl.type ~= 'table' then
return
end
local rtn = tbl.parent
if rtn.type ~= 'return' then
return
end
local newStatus = m.status(status)
m.searchRefsAsFunctionReturn(newStatus, tbl, 'ref')
for _, res in ipairs(newStatus.results) do
queue[#queue+1] = {
obj = res,
start = start-1,
force = true,
}
end
end
function m.checkSameSimpleAsSetValue(status, ref, start, queue)
if ref.type == 'select' then
return
end
local parent = ref.parent
if m.getObjectValue(parent) ~= ref then
return
end
if not status.cache.valueMark then
status.cache.valueMark = {}
end
if status.cache.valueMark[ref] then
return
end
status.cache.valueMark[ref] = true
local obj
if parent.type == 'local'
or parent.type == 'setglobal'
or parent.type == 'setlocal' then
obj = parent
elseif parent.type == 'setfield' then
obj = parent.field
elseif parent.type == 'setmethod' then
obj = parent.method
end
if not obj then
return
end
local newStatus = m.status(status)
m.searchRefs(newStatus, obj, 'ref')
for _, res in ipairs(newStatus.results) do
queue[#queue+1] = {
obj = res,
start = start,
force = true,
}
end
end
function m.checkSameSimple(status, simple, data, mode, results, queue)
local ref = data.obj
local start = data.start
local force = data.force
for i = start, #simple do
local sm = simple[i]
if sm ~= '*' and not force and m.getSimpleName(ref) ~= sm then
return
end
force = false
local cmode = mode
if i < #simple then
cmode = 'ref'
end
-- 穿透 self:func 与 mt:func
m.searchSameFieldsCrossMethod(status, ref, i, queue)
-- 穿透赋值
m.searchSameFieldsInValue(status, ref, i, queue, cmode)
-- 检查形如 a = f() 的分支情况,需要业务层传入 interface.call
m.checkSameSimpleInCall(status, ref, i, queue, mode)
if cmode ~= 'def' then
-- 检查形如 { a = f } 的情况
m.checkSameSimpleAsTableField(status, ref, i, queue)
-- 检查形如 return m 的情况
m.checkSameSimpleAsReturn(status, ref, i, queue)
-- 检查形如 return { f = 1 } 的情况
m.checkSameSimpleAsReturnTableField(status, ref, i, queue)
-- 检查形如 a = f 的情况
m.checkSameSimpleAsSetValue(status, ref, i, queue)
end
if i == #simple then
break
end
-- 检查形如 a = {} 的分支情况
m.checkSameSimpleInBranch(status, ref, i, queue)
ref = m.getNextRef(ref)
if not ref then
return
end
end
if mode == 'def' then
if ref.type == 'setglobal'
or ref.type == 'setlocal'
or ref.type == 'local' then
results[#results+1] = ref
elseif ref.type == 'setfield'
or ref.type == 'tablefield' then
results[#results+1] = ref
elseif ref.type == 'setmethod' then
results[#results+1] = ref
elseif ref.type == 'setindex'
or ref.type == 'tableindex' then
results[#results+1] = ref
elseif ref.type == 'call' then
if ref.node.special == 'rawset' then
results[#results+1] = ref
end
end
if data.call then
results[#results+1] = ref
end
elseif mode == 'ref' then
if ref.type == 'setfield'
or ref.type == 'getfield'
or ref.type == 'tablefield' then
results[#results+1] = ref
elseif ref.type == 'setmethod'
or ref.type == 'getmethod' then
results[#results+1] = ref
elseif ref.type == 'setindex'
or ref.type == 'getindex'
or ref.type == 'tableindex' then
results[#results+1] = ref
elseif ref.type == 'setglobal'
or ref.type == 'getglobal'
or ref.type == 'local'
or ref.type == 'setlocal'
or ref.type == 'getlocal' then
results[#results+1] = ref
elseif ref.type == 'function' then
results[#results+1] = ref
elseif ref.type == 'call' then
if ref.node.special == 'rawset'
or ref.node.special == 'rawget' then
results[#results+1] = ref
end
end
if data.call then
results[#results+1] = ref
end
elseif mode == 'field' then
if ref.type == 'setfield'
or ref.type == 'getfield'
or ref.type == 'tablefield' then
results[#results+1] = ref
elseif ref.type == 'setmethod'
or ref.type == 'getmethod' then
results[#results+1] = ref
elseif ref.type == 'setindex'
or ref.type == 'getindex'
or ref.type == 'tableindex' then
results[#results+1] = ref
elseif ref.type == 'setglobal'
or ref.type == 'getglobal'
or ref.type == 'local'
or ref.type == 'setlocal'
or ref.type == 'getlocal' then
results[#results+1] = ref
elseif ref.type == 'call' then
if ref.node.special == 'rawset'
or ref.node.special == 'rawget' then
results[#results+1] = ref
end
end
end
end
function m.searchSameFields(status, simple, mode)
local first = simple.first
local fref = first and first.ref
local queue = {}
if fref then
for i = 1, #fref do
local ref = fref[i]
queue[i] = {
obj = ref,
start = 1,
}
end
end
-- 防止无限递归
local mark = {}
for obj in pairs(status.lock) do
mark[obj] = true
end
--for i = 1, #queue do
-- local data = queue[i]
-- status.lock[data.obj] = true
--end
-- 对初始对象进行预处理
if simple.global then
for i = 1, #queue do
local data = queue[i]
local obj = data.obj
local nxt = m.getNextRef(obj)
if nxt and obj.special == '_G' then
data.obj = nxt
end
end
if first then
if first.tag == '_ENV' then
-- 检查全局变量的分支情况,需要业务层传入 interface.global
m.checkSameSimpleInGlobal(status, simple[1], 1, queue)
else
-- local _ENV 的情况
m.checkSameSimpleInBranch(status, first, 0, queue)
end
end
else
queue[#queue+1] = {
obj = first,
start = 1,
}
if first then
if #simple > 1 then
m.checkSameSimpleInCall(status, first, 1, queue, 'ref')
else
m.checkSameSimpleInCall(status, first, 1, queue, mode)
end
end
end
for i = 1, 999 do
local data = queue[i]
if not data then
return
end
if not mark[data.obj] then
status.lock[data.obj] = true
mark[data.obj] = true
m.checkSameSimple(status, simple, data, mode, status.results, queue)
status.lock[data.obj] = nil
end
end
end
function m.getCallerInSameFile(status, func)
-- 搜索所有所在函数的调用者
local funcRefs = m.status(status)
m.searchRefOfValue(funcRefs, func)
local calls = {}
if #funcRefs.results == 0 then
return calls
end
for _, res in ipairs(funcRefs.results) do
local call = res.parent
if call.type == 'call' then
calls[#calls+1] = call
end
end
return calls
end
function m.getCallerCrossFiles(status, main)
if status.interface.link then
return status.interface.link(main.uri)
end
return {}
end
function m.searchRefsAsFunctionReturn(status, obj, mode)
if mode == 'def' then
return
end
status.results[#status.results+1] = obj
-- 搜索所在函数
local currentFunc = m.getParentFunction(obj)
local rtn = obj.parent
if rtn.type ~= 'return' then
return
end
-- 看看他是第几个返回值
local index
for i = 1, #rtn do
if obj == rtn[i] then
index = i
break
end
end
if not index then
return
end
local calls
if currentFunc.type == 'main' then
calls = m.getCallerCrossFiles(status, currentFunc)
else
calls = m.getCallerInSameFile(status, currentFunc)
end
-- 搜索调用者的返回值
if #calls == 0 then
return
end
local selects = {}
for i = 1, #calls do
local parent = calls[i].parent
if parent.type == 'select' and parent.index == index then
selects[#selects+1] = parent.parent
end
local extParent = calls[i].extParent
if extParent then
for j = 1, #extParent do
local ext = extParent[j]
if ext.type == 'select' and ext.index == index then
selects[#selects+1] = ext.parent
end
end
end
end
-- 搜索调用者的引用
for i = 1, #selects do
m.searchRefs(status, selects[i], 'ref')
end
end
function m.searchRefsAsFunctionSet(status, obj, mode)
local parent = obj.parent
if not parent then
return
end
if parent.type == 'local'
or parent.type == 'setlocal'
or parent.type == 'setglobal'
or parent.type == 'setfield'
or parent.type == 'setmethod'
or parent.type == 'setindex'
or parent.type == 'tableindex'
or parent.type == 'tablefield' then
m.searchRefs(status, parent, mode)
end
end
function m.searchRefsAsFunction(status, obj, mode)
if obj.type ~= 'function' then
return
end
m.searchRefsAsFunctionSet(status, obj, mode)
-- 检查自己作为返回函数时的引用
m.searchRefsAsFunctionReturn(status, obj, mode)
end
function m.cleanResults(results)
local mark = {}
for i = #results, 1, -1 do
local res = results[i]
if res.tag == 'self'
or mark[res] then
results[i] = results[#results]
results[#results] = nil
else
mark[res] = true
end
end
end
function m.searchRefs(status, obj, mode)
status.depth = status.depth + 1
-- 检查单步引用
local res = m.getStepRef(obj, mode)
if res then
for i = 1, #res do
status.results[#status.results+1] = res[i]
end
end
-- 检查simple
if status.depth <= 10 then
local simple = m.getSimple(obj)
if simple then
m.searchSameFields(status, simple, mode)
end
elseif m.debugMode then
error('stack overflow')
end
status.depth = status.depth - 1
m.cleanResults(status.results)
end
function m.searchRefOfValue(status, obj)
local var = obj.parent
if var.type == 'local'
or var.type == 'set' then
return m.searchRefs(status, var, 'ref')
end
end
--- 请求对象的引用,包括 `a.b.c` 形式
--- 与 `return function` 形式。
--- 不穿透 `setmetatable` ,考虑由
--- 业务层进行反向 def 搜索。
function m.requestReference(obj, interface)
local status = m.status(nil, interface)
-- 根据 field 搜索引用
m.searchRefs(status, obj, 'ref')
m.searchRefsAsFunction(status, obj, 'ref')
return status.results
end
--- 请求对象的定义,包括 `a.b.c` 形式
--- 与 `return function` 形式。
--- 穿透 `setmetatable` 。
function m.requestDefinition(obj, interface)
local status = m.status(nil, interface)
-- 根据 field 搜索定义
m.searchRefs(status, obj, 'def')
return status.results
end
--- 请求对象的域
function m.requestFields(obj, interface)
return m.searchFields(nil, obj, nil, interface)
end
return m
|