-
Notifications
You must be signed in to change notification settings - Fork 20
Expand file tree
/
Copy pathnew_vm_parser.js
More file actions
2323 lines (2206 loc) · 98.2 KB
/
new_vm_parser.js
File metadata and controls
2323 lines (2206 loc) · 98.2 KB
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
var {JSDOM} = require("jsdom");
// 在浏览器里运行话, 更好点
var {window} = new JSDOM(`<!DOCTYPE html><p>Hello world</p>`);
global["window"] = window;
var {parse} = require("@babel/parser");
traverse = require("@babel/traverse").default;
generator = require("@babel/generator").default;
type = require("@babel/types");
fs = require("fs");
var code;
/* 保存整个js里属于window的对象 console,Object,document */
var obj = [];
var OPCODE = {
PASS: 11, // 这是个无用字节码,不作任何操作
PUSH_NUM: 12,
PUSH_STR: 13,
PUSH_NULL: 14,
PUSH_UNDEFINED: 15,
PUSH_WINDOW: 65, // 主要是this可能是构造函数,导致这个this不是window了.
PUSH_VAR: 66, // 将变量池里的变量压入栈
MOV_VAR: 67, // 对变量进行赋值
PUSH_THIS: 68, // push this => 泛指window
PUSH_CONSTANT: 69, // push 变量池
GET_OBJ: 51, // window.console , 获取对象下的属性/对象 ; 数组也是对象,同理;
SET_OBJ: 52, // window.console = xxx ; 数组也是对象,同理;
APPLY: 53, // 方法调用
COMPUTE: 54, // 运算,两个参数
SINGLE_COMPUTE: 55, // 运算,单个参数
UPDATE: 56, // a++ ++a --a a--
NEW_ARRAY: 30, //创建一个空的数组
NEW_OBJECT: 31, //创建一个空对象
NEW_FUNC: 32, // 创建一个function
NEW_CONSTRUCT: 33, // new 一个构造体
UPDATE_STACK: 20,
DECREMENT_STACK: 21,
TRY: 40,
CATCH: 41,
TRUE: 42,
FALSE: 43,
THROW: 44,
CATCH_OVER: 45,
DELETE: 46,
DEBUG: 47,
FORIN: 48,
FINALLY: 49,
RETURN: 88,
IS_TRUE: 89,
SKIP_BLOCK: 90,
GOTO: 91, // 跳转到循环头位置
BREAK: 92, // break, 正常的思路应该是break出一段代码的.
CONTINUE: 93, // continue
'*': 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,
'in': 1030,
'instanceof': 1031,
"**": 1032,
}
var OPCODE1 = {
'!': 1032,
'+': 1033,
'-': 1034,
'~': 1035,
'typeof': 1036,
'void': 1037,
}
var NEW_OPCODE = {};
var NEW_OPCODE1 = {};
/* 一个指令对应几种字节码, 也意味着vmp代码cases会翻几倍 */
var times = 2,
turn, vmp_turn;
/* 开关, 膨胀指令对应字节码以及vm代码混淆 */
turn = vmp_turn = 1;
/* 用字符串symbol函数调用来计算结果. 使用频率为 1/4 */
var use_symbol_rate = 4;
/* 新增的花指令函数名称 */
var junk_func_name = [];
/* 替换运算的概率 1/2 */
var junk_code_rate = 2;
/* 不添加花指令函数的概率 */
var not_new_junk_rate = 2;
/* vm方法复制几倍 */
var vm_copy_count = 1;
/* 是否让字符串字节码 + 66 */
var string_code = true;
// string_code = false;
/* 回填模式 */
var mode = {
backfill_identifier: "PUSH_MOV_identifier",
backfill_break: "BREAK",
backfill_continue: "CONTINUE",
backfill_member_expression: "GET_SET_OBJ",
continue_position: "插眼",
backfill_CONSTANT: "CONSTANT",
backfill_IS_TRUE: "IS_TRUE",
}
/* 保存不同变量的作用域进行数字命名,不是修改js,再作用域下添加一个id对象. 使用ast直接对js重命名变量真的很卡 */
var identifier_binding_track = [];
/* PASS的opcode 直接删了否则占用性能 */
function delete_opcode(opcode, mode) {
var index;
while (true) {
index = opcode.indexOf(mode);
if (index !== -1) {
opcode.splice(index, 1);
} else break;
}
return opcode;
}
/* 适用于回填单个指令的方法 */
function backfill_opcode(opcode, mode, replace_code) {
var index;
while (true) {
index = opcode.indexOf(mode);
if (index !== -1) {
opcode[index] = replace_code;
} else break;
}
return opcode;
}
/* 回填break */
function backfill_break(opcode) {
var index;
var len;
while (true) {
index = opcode.indexOf(mode.backfill_break);
if (index !== -1) {
opcode[index] = OPCODE.BREAK;
len = opcode.length - index - 2;
opcode[index + 1] = len;
} else break;
}
return opcode;
}
/* for 循环 continue */
function backfill_continue_for(opcode) {
var index;
var len;
var continue_postion = opcode.indexOf(mode.continue_position);
if (continue_postion === -1) {
return opcode;
}
while (true) {
index = opcode.indexOf(mode.backfill_continue);
if (index !== -1) {
opcode[index] = OPCODE.CONTINUE;
len = continue_postion - index - 2;
opcode[index + 1] = (-len);
} else break;
}
opcode.splice(continue_postion, 1);
return opcode;
}
/* 回填continue */
function backfill_continue(opcode) {
var index;
var len;
while (true) {
index = opcode.indexOf(mode.backfill_continue);
if (index !== -1) {
opcode[index] = OPCODE.CONTINUE;
len = index + 2;
opcode[index + 1] = len;
} else break;
}
return opcode;
}
/* 字符串转数字数组 */
function strToNumArr(str) {
return str.split("").map((str) => {
if (string_code) return str.charCodeAt() + 66;
else return str.charCodeAt();
});
}
/* 字符串转字节码数组 */
function strToOpcode(str) {
var opcode = [];
opcode.push(OPCODE.PUSH_STR);
var str_opcode = strToNumArr(str);
opcode.push(str_opcode.length << 6);
opcode = opcode.concat(str_opcode);
return opcode;
}
/* push update_stack 指令. */
function push_update_stack(opcode, node) {
if ("VariableDeclarator|ConditionalExpression|WhileStatement" +
"LogicalExpression|BinaryExpression|IfStatement" +
"|UnaryExpression|CallExpression|ReturnStatement|AssignmentExpression".indexOf(node.parentPath.type) !== -1) {
opcode.push(OPCODE.UPDATE_STACK);
}
return opcode;
}
/* 遍历节点 转成字节码 */
function generate(node) {
var opcode = [];
switch (node.type) {
case "DebuggerStatement":
opcode.push(OPCODE.DEBUG);
break
case "NullLiteral":
opcode.push(OPCODE.PUSH_NULL);
break
case "BooleanLiteral":
switch (node.node.value) {
case true:
opcode.push(OPCODE.TRUE);
break
case false:
opcode.push(OPCODE.FALSE);
break
}
break
case "ExpressionStatement":
opcode = generate(node.get("expression"));
break
case "VariableDeclaration":
for (var i = 0; i < node.node.declarations.length; i++) opcode = opcode.concat(generate(node.get("declarations")[i]));
break
case "VariableDeclarator":
/* 赋值主要是要从变量池里拿到对象直接进行操作,不同于把值或者对象push到堆栈里 */
opcode = opcode.concat(delete_opcode(generate(node.get("id")), mode.backfill_identifier));
// opcode = backfill_opcode(opcode, mode.backfill_identifier, OPCODE.MOV_VAR);
if (!node.node.init) {
/*没有init push null*/
opcode.push(OPCODE.PUSH_UNDEFINED);
} else {
opcode = opcode.concat(generate(node.get("init")));
opcode = backfill_opcode(opcode, mode.backfill_identifier, OPCODE.PUSH_VAR);
}
opcode.push(OPCODE.MOV_VAR);
opcode.push(OPCODE.DECREMENT_STACK);
break
case "NumericLiteral":
opcode.push(OPCODE.PUSH_NUM);
opcode.push(node.node.value);
break
case "StringLiteral":
opcode = strToOpcode(node.node.value);
break
case "ObjectExpression":
/* 主要逻辑写在 ObjectProperty 即可 */
var len = node.node.properties.length;
for (var i = len - 1; i > -1; i--) {
opcode = opcode.concat(generate(node.get("properties")[i]));
}
opcode.push(OPCODE.NEW_OBJECT);
opcode.push(len);
break
case "ObjectProperty":
/* 要不就直接提取var b = {"a":"c"} 他的key, b["a"] = "c"; 酱紫容易写 他妈的, 不写逻辑了 */
var key_opcode = generate(node.get("key"));
key_opcode = delete_opcode(key_opcode, mode.backfill_identifier);
var value_opcode = generate(node.get("value"));
opcode = opcode.concat(key_opcode);
opcode = opcode.concat(value_opcode);
break
case "BlockStatement":
var len = node.node.body.length;
for (var i = 0; i < len; i++) {
opcode = opcode.concat(generate(node.get("body")[i]));
}
break
case "ReturnStatement":
var ret_opcode = generate(node.get("argument"));
if (!!ret_opcode) {
opcode = opcode.concat(ret_opcode);
} else {
opcode.push(OPCODE.PUSH_NULL);
}
opcode.push(OPCODE.RETURN);
break
case "IfStatement":
var test_opcode = generate(node.get("test"));
opcode = opcode.concat(test_opcode);
opcode.push(OPCODE.IS_TRUE);
var csq_opcode = generate(node.get("consequent"));
if (!!node.node.alternate) {
opcode.push(csq_opcode.length + 2);
opcode = opcode.concat(csq_opcode);
/*有 else if 时, 需要在consequent里接着push 一个跳出这个if指令*/
opcode.push(OPCODE.SKIP_BLOCK);
var alternate_opcode = generate(node.get("alternate"));
opcode.push(alternate_opcode.length);
opcode = opcode.concat(alternate_opcode);
} else {
opcode.push(csq_opcode.length);
opcode = opcode.concat(csq_opcode);
}
break
case "UnaryExpression":
var operator = node.node.operator;
if (operator === "delete") {
opcode = opcode.concat(delete_opcode(generate(node.get("argument")), mode.backfill_member_expression));
opcode.push(OPCODE.DELETE)
} else {
// opcode = opcode.concat(strToOpcode(node.node.operator));
opcode = opcode.concat(generate(node.get("argument")));
// opcode.push(OPCODE.SINGLE_COMPUTE);
opcode.push(OPCODE1[operator]);
}
break
case "ThrowStatement":
opcode = opcode.concat(generate(node.get("argument")));
opcode.push(OPCODE.THROW);
break
case "TryStatement":
opcode.push(OPCODE.TRY);
var block_opcode = generate(node.get("block"));
opcode.push(block_opcode.length);
var handler_opcode = generate(node.get("handler"));
if (!handler_opcode) {
handler_opcode = [];
}
opcode = opcode.concat(block_opcode);
opcode.push(OPCODE.SKIP_BLOCK);
opcode.push(handler_opcode.length);
opcode = opcode.concat(handler_opcode);
var finalizer_opcode = [];
if (!!node.node.finalizer) {
finalizer_opcode = generate(node.get("finalizer"));
opcode.push(OPCODE.FINALLY);
opcode.push(finalizer_opcode.length);
opcode = opcode.concat(finalizer_opcode);
}
break
case "CatchClause":
/* catch(e){} */
var param_opcode = generate(node.get("param"))
var block_opcode = generate(node.get("body"));
// opcode.push(OPCODE.CATCH);
// opcode.push(param_opcode.length + block_opcode.length);
/* push e参数 */
var p_opcode = []
// p_opcode = p_opcode.concat(backfill_opcode(param_opcode, mode.backfill_identifier, OPCODE.PASS));
p_opcode = p_opcode.concat(delete_opcode(param_opcode, mode.backfill_identifier));
opcode.push(p_opcode.length);
opcode = opcode.concat(p_opcode);
opcode.push(block_opcode.length + 1);
opcode.push(OPCODE.MOV_VAR);
opcode = opcode.concat(block_opcode);
break
/* es6 语法 new a(...arg) */
// case "SpreadElement":
// break
/*比较麻烦的节点*/
case "Identifier":
/* 在window下的对象,或者是 MemberExpression.property 也就是 a[b] 这个b的key, 我们就需要把参数名称push到堆栈里 */
/* 都不是的则直接命名带上id */
var name = node.node.name;
if (name === "arguments") {
// opcode = opcode.concat(strToOpcode(name));
opcode = opcode.concat(strToOpcode("$5"));
opcode.push(OPCODE.PUSH_CONSTANT);
opcode.push(mode.backfill_identifier);
break
}
var biding;
var index;
if (node.parentPath.type === "FunctionDeclaration" && node.parentPath.get("id") === node) {
biding = node.parentPath.parentPath.scope.getBinding(name);
} else {
biding = node.scope.getBinding(name);
}
index = identifier_binding_track.indexOf(biding);
var reNameId;
if (!!biding && index !== -1) {
reNameId = identifier_binding_track[index].reNameId;
opcode.push(OPCODE.PUSH_NUM);
opcode.push(reNameId);
opcode.push(mode.backfill_CONSTANT);
opcode.push(mode.backfill_identifier);
}
if (window.hasOwnProperty(name) && !biding) {
opcode = opcode.concat(strToOpcode(name));
/* push this 或者 vm_constant 交由上层回填 */
opcode.push(mode.backfill_CONSTANT);
// opcode.push(OPCODE.PUSH_WINDOW);
opcode.push(mode.backfill_identifier);
break
} else if (node.parentPath.type === "MemberExpression" && node.parentPath.get("property") === node) {
/* 又得分情况 a.b a[b] 是完全不一样的！！！ */
if (!!biding && index !== -1) {
opcode = []; // 清除前面生成的代码
}
if (node.parentPath.node.computed) {
if (!!biding) {
if (index === -1) {
reNameId = identifier_binding_track.length + 100;
biding.reNameId = reNameId;
biding.oldName = name;
identifier_binding_track.push(biding);
} else {
reNameId = identifier_binding_track[index].reNameId;
}
opcode.push(OPCODE.PUSH_NUM);
opcode.push(reNameId);
opcode.push(mode.backfill_CONSTANT);
opcode.push(mode.backfill_identifier);
} else {
/* 直接存到this里 */
opcode = opcode.concat(strToOpcode(name));
opcode.push(OPCODE.PUSH_WINDOW);
opcode.push(mode.backfill_identifier);
}
} else {
opcode = opcode.concat(strToOpcode(name));
opcode.push(mode.backfill_identifier);
}
} else {
if (!!biding && index !== -1) {
break;
}
/* 走到这里就是普通对象 */
if (!!biding) {
if (index === -1) {
reNameId = identifier_binding_track.length + 100;
biding.reNameId = reNameId;
biding.oldName = name;
identifier_binding_track.push(biding);
} else {
reNameId = identifier_binding_track[index].reNameId;
}
opcode.push(OPCODE.PUSH_NUM);
opcode.push(reNameId);
opcode.push(mode.backfill_CONSTANT);
opcode.push(mode.backfill_identifier);
} else {
/* 直接存到this里 */
opcode = opcode.concat(strToOpcode(name));
opcode.push(OPCODE.PUSH_WINDOW);
opcode.push(mode.backfill_identifier);
}
}
break
case "ArrayExpression":
var len = node.node.elements.length;
for (var i = 0; i < len; i++) {
opcode = opcode.concat(generate(node.get("elements")[i]));
}
opcode.push(OPCODE.NEW_ARRAY);
opcode.push(len);
break
case "AssignmentExpression":
/* 主要照顾下左边的赋值对象 */
// var str_opcode = strToOpcode(node.node.operator);
var operator = node.node.operator;
var right_opcode = generate(node.get("right"));
var left_opcode = generate(node.get("left"));
if (node.get("right").type == "AssignmentExpression") {
opcode = opcode.concat(right_opcode);
opcode.push(OPCODE.DECREMENT_STACK);
switch (node.get("left").type) {
case "Identifier":
/* 要用常量池里的对象去接收值呢 */
// opcode = opcode.concat(backfill_opcode(left_opcode, mode.backfill_identifier, OPCODE.PASS));
opcode = opcode.concat(delete_opcode(left_opcode, mode.backfill_identifier));
break
case "MemberExpression":
opcode = opcode.concat(left_opcode);
/* 遍历MemberExpression 节点, 会获取到值, 把最后GET_OBJ指令替换成SET_OBJ即可*/
// opcode[opcode.lastIndexOf(mode.backfill_member_expression)] = OPCODE.PASS;
opcode.splice(opcode.lastIndexOf(mode.backfill_member_expression), 1);
/* 其余的都直接替换成 GET_OBJ,其实这里可以不写这个代码,运行到最后会自动补全get obj 指令 */
opcode = backfill_opcode(opcode, mode.backfill_member_expression, OPCODE.GET_OBJ);
break
default:
debugger;
}
opcode = opcode.concat(generate(node.get("right").get("left")));
} else {
switch (node.get("left").type) {
case "Identifier":
/* 要用常量池里的对象去接收值呢 */
// opcode = opcode.concat(backfill_opcode(generate(node.get("left")), mode.backfill_identifier, OPCODE.PASS));
opcode = opcode.concat(delete_opcode(generate(node.get("left")), mode.backfill_identifier));
break
case "MemberExpression":
opcode = opcode.concat(left_opcode);
/* 遍历MemberExpression 节点, 会获取到值, 把最后GET_OBJ指令替换成SET_OBJ即可*/
// opcode[opcode.lastIndexOf(mode.backfill_member_expression)] = OPCODE.PASS;
opcode.splice(opcode.lastIndexOf(mode.backfill_member_expression), 1);
/* 其余的都直接替换成 GET_OBJ,其实这里可以不写这个代码,运行到最后会自动补全get obj 指令 */
opcode = backfill_opcode(opcode, mode.backfill_member_expression, OPCODE.GET_OBJ);
break
default:
debugger;
}
if (node.node.operator !== "=") {
// console.log("AssignmentExpression 符号 => ", node.node.operator);
if (chance(use_symbol_rate)) {
opcode = opcode.concat(strToOpcode(operator));
opcode = opcode.concat(left_opcode);
opcode = opcode.concat(right_opcode);
opcode.push(OPCODE.COMPUTE);
} else {
opcode = opcode.concat(left_opcode);
opcode = opcode.concat(right_opcode);
opcode.push(OPCODE[operator]);
}
} else {
opcode = opcode.concat(right_opcode);
}
}
switch (node.get("left").type) {
case "Identifier":
/* 要用常量池里的对象去接收值呢 */
opcode.push(OPCODE.MOV_VAR);
break
case "MemberExpression":
opcode.push(OPCODE.SET_OBJ);
break
default:
debugger;
}
/* if ((a = 1)) 这种的 怪恶心的 , 怎么判断是否会用到这个值
* */
// opcode = push_update_stack(opcode, node);
if ("ExpressionStatement|".indexOf(node.parentPath.type) > 0) {
opcode.push(OPCODE.DECREMENT_STACK);
}
break
case "BinaryExpression":
var operator = node.node.operator;
// opcode = opcode.concat(strToOpcode(node.node.operator));
var left_opcode = generate(node.get("left"));
var right_opcode = generate(node.get("right"));
if (chance(use_symbol_rate)) {
opcode = opcode.concat(strToOpcode(operator));
opcode = opcode.concat(left_opcode);
opcode = opcode.concat(right_opcode);
opcode.push(OPCODE.COMPUTE);
} else {
if (!(operator in OPCODE)) throw "该计算符未录入 => " + operator;
opcode = opcode.concat(left_opcode);
opcode = opcode.concat(right_opcode);
opcode.push(OPCODE[operator])
}
break
case "UpdateExpression":
var str_opcode = strToOpcode(node.node.operator);
// var argument_opcode = generate(node.get("argument"));
if (node.node.prefix) {
/* ++a */
if (type.isIdentifier(node.node.argument)) {
/* 直接 push 参数名 */
// opcode = opcode.concat(backfill_opcode(generate(node.get("argument")), mode.backfill_identifier, OPCODE.PASS));
opcode = opcode.concat(delete_opcode(generate(node.get("argument")), mode.backfill_identifier));
opcode = opcode.concat(str_opcode);
opcode.push(OPCODE.UPDATE);
} else if (type.isMemberExpression(node.node.argument)) {
// opcode = opcode.concat(backfill_opcode(generate(node.get("argument")), mode.backfill_member_expression, OPCODE.PASS));
opcode = opcode.concat(delete_opcode(generate(node.get("argument")), mode.backfill_member_expression));
opcode = opcode.concat(str_opcode);
opcode.push(OPCODE.UPDATE);
} else {
debugger;
console.log("UpdateExpression argument 非正常节点 =>");
}
/*上面已经把值++完了,下面把值push到堆栈里用 */
opcode = opcode.concat(backfill_opcode(generate(node.get("argument")), mode.backfill_identifier, OPCODE.PUSH_VAR));
} else {
/* a++ */
opcode = opcode.concat(backfill_opcode(generate(node.get("argument")), mode.backfill_identifier, OPCODE.PUSH_VAR));
if (type.isIdentifier(node.node.argument)) {
/* 先把值push到堆栈里给他们用,然后++ */
// opcode = opcode.concat(backfill_opcode(generate(node.get("argument")), mode.backfill_identifier, OPCODE.PASS));
opcode = opcode.concat(delete_opcode(generate(node.get("argument")), mode.backfill_identifier));
opcode = opcode.concat(str_opcode);
opcode.push(OPCODE.UPDATE);
} else if (type.isMemberExpression(node.node.argument)) {
// opcode = opcode.concat(backfill_opcode(generate(node.get("argument")), mode.backfill_member_expression, OPCODE.PASS));
opcode = opcode.concat(delete_opcode(generate(node.get("argument")), mode.backfill_member_expression));
opcode = opcode.concat(str_opcode);
opcode.push(OPCODE.UPDATE);
} else {
debugger;
console.log("UpdateExpression argument 非正常节点 =>");
}
}
break
case "MemberExpression":
/* push key , push 对象, push GET_OBJ */
/* object 可能是MemberExpression 直接遍历就行 */
var object_opcode = generate(node.get("object"));
var property_opcode = generate(node.get("property"));
object_opcode = backfill_opcode(object_opcode, mode.backfill_identifier, OPCODE.PUSH_VAR);
/* 只push一个key */
if (node.node.computed) {
property_opcode = backfill_opcode(property_opcode, mode.backfill_identifier, OPCODE.PUSH_VAR);
} else {
// property_opcode = backfill_opcode(property_opcode, mode.backfill_identifier, OPCODE.PASS);
// property_opcode = backfill_opcode(property_opcode, mode.backfill_CONSTANT, OPCODE.PASS);
property_opcode = delete_opcode(property_opcode, mode.backfill_identifier);
property_opcode = delete_opcode(property_opcode, mode.backfill_CONSTANT);
}
// opcode = opcode.concat(object_opcode);
opcode = opcode.concat(property_opcode);
opcode = opcode.concat(object_opcode);
opcode = backfill_opcode(opcode, mode.backfill_member_expression, OPCODE.GET_OBJ);
/* push get 还是 set */
opcode.push(mode.backfill_member_expression);
break
case "CallExpression":
var len = node.node.arguments.length;
for (var i = 0; i < len; i++) {
opcode = opcode.concat(generate(node.get("arguments")[i]));
}
opcode.push(OPCODE.NEW_ARRAY);
opcode.push(len);
var callee_opcode = generate(node.get("callee"));
opcode = opcode.concat(backfill_opcode(callee_opcode, mode.backfill_member_expression, OPCODE.GET_OBJ));
switch (node.get("callee").type) {
case "MemberExpression":
/* 这里还需要把调用者push到堆栈里,这里直接让堆栈索引+1 解决掉重复获取调用者造成性能损失 */
// opcode = opcode.concat(generate(node.get("callee").get("object")));
opcode.push(OPCODE.UPDATE_STACK);
break
case "AssignmentExpression":
/* 赋值完以后堆栈++ 就得到了方法, 然后push调用者 */
opcode.push(OPCODE.PUSH_THIS);
/**
* 这里巨傻逼,判断是否赋值语句完,把e push 到堆栈里
* (e = function () {
* return r;
* })();
*/
break
default:
opcode.push(OPCODE.PUSH_NULL);
// console.log("CallExpression 这里不知道要不要管 =>", node.get("callee").type)
// debugger;
}
opcode.push(OPCODE.APPLY);
if ("ExpressionStatement".indexOf(node.parentPath.type) > 0) {
opcode.push(OPCODE.DECREMENT_STACK);
}
break
case "FunctionDeclaration":
/* 第一步先把传参push到堆栈里组成数组 */
if (type.isIdentifier(node.node.id)) {
/* 加入到变量池里 */
// opcode = opcode.concat(backfill_opcode(generate(node.get("id")), mode.backfill_identifier, OPCODE.PASS));
opcode = opcode.concat(delete_opcode(generate(node.get("id")), mode.backfill_identifier, OPCODE.PASS));
} else {
debugger;
}
var len = node.node.params.length;
var paramopcode = [];
for (var i = 0; i < len; i++) {
switch (node.get("params")[i].type) {
case "Identifier":
paramopcode = paramopcode.concat(generate(node.get("params")[i]));
break
default:
console.log("FunctionDeclaration 的 params 有非Identifier节点, 非要这样写代码吗? ");
debugger;
}
}
// paramopcode = backfill_opcode(paramopcode, mode.backfill_identifier, OPCODE.PASS);
// paramopcode = backfill_opcode(paramopcode, mode.backfill_CONSTANT, OPCODE.PASS);
paramopcode = delete_opcode(paramopcode, mode.backfill_identifier);
paramopcode = delete_opcode(paramopcode, mode.backfill_CONSTANT);
/* 把参数组成一个数组并push到堆栈里 */
paramopcode.push(OPCODE.NEW_ARRAY);
paramopcode.push(len);
opcode = opcode.concat(paramopcode);
/* 先将new function 字节码push到 opcode中去 */
opcode.push(OPCODE.NEW_FUNC);
var blockSta_opcode = generate(node.get("body"));
opcode.push(blockSta_opcode.length);
opcode = opcode.concat(blockSta_opcode);
opcode.push(OPCODE.MOV_VAR);
// debugger;
break
case "FunctionExpression":
/* 第一步先把传参push到堆栈里组成数组 */
if (!!node.node.id) {
if (type.isIdentifier(node.node.id)) {
/* 加入到变量池里 */
// opcode = opcode.concat(backfill_opcode(generate(node.get("id")), mode.backfill_identifier, OPCODE.PASS));
opcode = opcode.concat(delete_opcode(generate(node.get("id")), mode.backfill_identifier));
// 这里感觉要判断一下最好
// opcode.push(OPCODE.UPDATE_STACK);
} else {
debugger;
}
}
var len = node.node.params.length;
var paramopcode = [];
for (var i = 0; i < len; i++) {
switch (node.get("params")[i].type) {
case "Identifier":
paramopcode = paramopcode.concat(generate(node.get("params")[i]));
break
default:
console.log("FunctionDeclaration 的 params 有非Identifier节点, 非要这样写代码吗? ");
debugger;
}
}
// paramopcode = backfill_opcode(paramopcode, mode.backfill_identifier, OPCODE.PASS);
// paramopcode = backfill_opcode(paramopcode, mode.backfill_CONSTANT, OPCODE.PASS);
paramopcode = delete_opcode(paramopcode, mode.backfill_identifier);
paramopcode = delete_opcode(paramopcode, mode.backfill_CONSTANT);
/* 把参数组成一个数组并push到堆栈里 */
paramopcode.push(OPCODE.NEW_ARRAY);
paramopcode.push(len);
opcode = opcode.concat(paramopcode);
/* 先将new function 字节码push到 opcode中去 */
opcode.push(OPCODE.NEW_FUNC);
var blockSta_opcode = generate(node.get("body"));
opcode.push(blockSta_opcode.length);
opcode = opcode.concat(blockSta_opcode);
if (!!node.node.id) {
if (type.isIdentifier(node.node.id)) {
opcode.push(OPCODE.MOV_VAR);
}
}
break
case "ForStatement":
// for循环
var all_block_opcode = [];
// 这里是初始化赋值其实是可以单独拿出去的,因为他只运行一次呢~
var init_opcode = generate(node.get("init"));
if (!!init_opcode) {
opcode = opcode.concat(init_opcode);
}
// 判断
var test_opcode = generate(node.get("test"));
if (!!test_opcode) {
opcode = opcode.concat(test_opcode);
opcode.push(OPCODE.IS_TRUE);
} else {
opcode.push(OPCODE.TRUE);
opcode.push(OPCODE.IS_TRUE);
}
var block_opcode = generate(node.get("body"));
all_block_opcode = all_block_opcode.concat(block_opcode);
var update_opcode = generate(node.get("update"));
/* continue 要跳到update这里啊 */
all_block_opcode.push(mode.continue_position);
if (!!update_opcode) {
all_block_opcode = all_block_opcode.concat(update_opcode);
} else {
all_block_opcode.push(OPCODE.PASS);
// all_block_opcode.push(OPCODE.PASS);
}
all_block_opcode = backfill_continue_for(all_block_opcode);
if (!!test_opcode) {
all_block_opcode = all_block_opcode.concat(test_opcode);
all_block_opcode.push(OPCODE.IS_TRUE);
// 这里的2是后面只有2条指令了,一个是得到goto指令,一个是回滚多少个opcode的长度
all_block_opcode.push(2);
} else {
all_block_opcode.push(OPCODE.TRUE);
all_block_opcode.push(OPCODE.IS_TRUE);
all_block_opcode.push(2);
}
// 这个时候true,就要运行goto,跳到block继续运行
all_block_opcode.push(OPCODE.GOTO);
all_block_opcode.push(all_block_opcode.length);
// 到这里才确定,如果第一次判断失败,需要跳过多少条指令
opcode.push(all_block_opcode.length);
opcode = opcode.concat(all_block_opcode);
opcode = backfill_break(opcode);
break
case "ForInStatement":
/*
for(var a in b) {} 直接用AST改写成For循环即可,不想写.
转不了了 , 开写
*/
var left_opcode;
var right_opcode = generate(node.get("right"));
switch (node.get("left").type) {
case "VariableDeclaration":
// left_opcode = backfill_opcode(generate(node.get("left").get("declarations")[0].get("id")), mode.backfill_identifier,
// OPCODE.PASS);
left_opcode = delete_opcode(generate(node.get("left").get("declarations")[0].get("id")), mode.backfill_identifier);
break
case "Identifier":
// left_opcode = backfill_opcode(generate(node.get("left")), mode.backfill_identifier,
// OPCODE.PASS);
left_opcode = delete_opcode(generate(node.get("left")), mode.backfill_identifier);
break
case "MemberExpression":
// left_opcode = backfill_opcode(generate(node.get("left")), mode.backfill_member_expression,
// OPCODE.PASS);
left_opcode = delete_opcode(generate(node.get("left")), mode.backfill_member_expression);
break
}
opcode = opcode.concat(left_opcode);
opcode = opcode.concat(right_opcode);
opcode.push(OPCODE.FORIN);
var block_opcode = generate(node.get("body"));
opcode.push(block_opcode.length + 3);
switch (node.get("left").type) {
case "VariableDeclaration":
case "Identifier":
opcode.push(OPCODE.MOV_VAR);
break
case "MemberExpression":
opcode.push(OPCODE.SET_OBJ);
break
}
opcode = opcode.concat(block_opcode);
opcode.push(mode.backfill_continue);
opcode.push("占个字节数");
opcode = backfill_break(opcode);
opcode = backfill_continue(opcode);
break
case "NewExpression":
var callee_opcode = generate(node.get("callee"));
opcode = opcode.concat(callee_opcode);
var len = node.node.arguments.length;
for (var i = 0; i < len; i++) {
opcode = opcode.concat(generate(node.get("arguments")[i]));
}
opcode.push(OPCODE.NEW_ARRAY);
opcode.push(len);
opcode.push(OPCODE.NEW_CONSTRUCT);
break
case "ThisExpression":
opcode.push(OPCODE.PUSH_THIS);
break
case "WhileStatement":
var while_opcode = [];
var test_opcode = generate(node.get("test"));
var blockSta_opcode = generate(node.get("body"));
while_opcode = while_opcode.concat(test_opcode);
while_opcode.push(OPCODE.IS_TRUE);
/* +2 是还有2个指令 GOTO 和 while_opcode指令的长度 */
while_opcode.push(blockSta_opcode.length + 2);
while_opcode = while_opcode.concat(blockSta_opcode);
while_opcode.push(OPCODE.GOTO);
opcode = opcode.concat(while_opcode);
opcode.push(while_opcode.length);
opcode = backfill_break(opcode);
opcode = backfill_continue(opcode);
break
case "BreakStatement":
/* 有好几种可以break => for switch while */
/* 思路一: while for 都有一个test节点, 运行完判断test结果, 如果真的话, 就往一个数组里push一个索引.
这样如果要跳出循环,就可以到这个位置,并直接给他一个false 结束. 容易有bug. */
/* 思路二: 获取后面要跳过的字节码长度,需要回填,这个是最好的. */
// opcode.push(OPCODE.BREAK);
opcode.push(mode.backfill_break);
opcode.push("占个字节数");
break
case "ContinueStatement":
// opcode.push(OPCODE.CONTINUE);
opcode.push(mode.backfill_continue);
opcode.push("占个字节数");
break
case "SwitchStatement":
/* 恶心节点之1, 确实如果break不去找到要跳过的索引,这个就很难做 */
var SwitchCaseopcode;
var discriminant_opcode = generate(node.get("discriminant"));
var len = node.node.cases.length;
for (var i = 0; i < len; i++) {
opcode = opcode.concat(discriminant_opcode);
SwitchCaseopcode = generate(node.get("cases")[i]);
if (len > (i + 1)) {
var index = SwitchCaseopcode.indexOf(mode.backfill_IS_TRUE);
SwitchCaseopcode[index] = SwitchCaseopcode.length - index + 1;
/* 这里的skip是因为可能要执行下一个case */
SwitchCaseopcode.push(OPCODE.SKIP_BLOCK);
/* compute is_true */
var test_opcode = generate(node.get("cases")[i + 1].get("test"));
if (!test_opcode) {
/* default */
test_opcode = discriminant_opcode;
}
/* 3是 COMPUTE IS_TRUE backfill_IS_TRUE */
SwitchCaseopcode.push(test_opcode.length + discriminant_opcode.length + 3);
} else {
/* 最后一个 */
var index = SwitchCaseopcode.indexOf(mode.backfill_IS_TRUE);
SwitchCaseopcode[index] = SwitchCaseopcode.length;
}
opcode = opcode.concat(SwitchCaseopcode);
}
opcode = backfill_break(opcode);
break
case "SwitchCase":
var test_opcode = generate(node.get("test"));
var consequent_opcode = [];
if (!!test_opcode) {
opcode = opcode.concat(test_opcode);
} else {
opcode = opcode.concat(generate(node.parentPath.get("discriminant")));
}
// opcode.push(OPCODE.COMPUTE);
opcode.push(OPCODE["=="]);
opcode.push(OPCODE.IS_TRUE);
opcode.push(mode.backfill_IS_TRUE);
var len = node.node.consequent.length;
for (var i = 0; i < len; i++) {
consequent_opcode = consequent_opcode.concat(generate(node.get("consequent")[i]));
}
// opcode.push(consequent_opcode.length + 2);
opcode = opcode.concat(consequent_opcode);
break
case "SequenceExpression":
for (var i = 0; i < node.node.expressions.length; i++) {
opcode = opcode.concat(generate(node.get("expressions")[i]));
}
break
case "DoWhileStatement":
var blockSta_opcode = generate(node.get("body"));
opcode = opcode.concat(blockSta_opcode);
var test_opcode = generate(node.get("test"));
opcode = opcode.concat(test_opcode);
opcode.push(OPCODE.GOTO);
opcode.push(test_opcode.length + blockSta_opcode.length + 1);
/* 回填continue */
var index = opcode.indexOf(mode.backfill_continue);
while (index !== -1) {
var len = opcode.length - test_opcode.length - index - 4;
opcode[index] = OPCODE.CONTINUE;
opcode[index + 1] = -len;
index = opcode.indexOf(mode.backfill_continue);
}
opcode = backfill_break(opcode);
break
case "RegExpLiteral":
/**
* var patt = /runoob/i => new RegExp("runoob","i"); 用AST直接转得了
*/
console.log("RegExpLiteral 节点未实现");
break
case "ConditionalExpression":
var test_opcode = generate(node.get("test"));
var csq_opcode = generate(node.get("consequent"));