-
Notifications
You must be signed in to change notification settings - Fork 205
/
Copy pathinst_operators.go
123 lines (100 loc) · 2.71 KB
/
inst_operators.go
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
package vm
import . "luago/api"
/* arith */
func add(i Instruction, vm LuaVM) { _binaryArith(i, vm, LUA_OPADD) } // +
func sub(i Instruction, vm LuaVM) { _binaryArith(i, vm, LUA_OPSUB) } // -
func mul(i Instruction, vm LuaVM) { _binaryArith(i, vm, LUA_OPMUL) } // *
func mod(i Instruction, vm LuaVM) { _binaryArith(i, vm, LUA_OPMOD) } // %
func pow(i Instruction, vm LuaVM) { _binaryArith(i, vm, LUA_OPPOW) } // ^
func div(i Instruction, vm LuaVM) { _binaryArith(i, vm, LUA_OPDIV) } // /
func idiv(i Instruction, vm LuaVM) { _binaryArith(i, vm, LUA_OPIDIV) } // //
func band(i Instruction, vm LuaVM) { _binaryArith(i, vm, LUA_OPBAND) } // &
func bor(i Instruction, vm LuaVM) { _binaryArith(i, vm, LUA_OPBOR) } // |
func bxor(i Instruction, vm LuaVM) { _binaryArith(i, vm, LUA_OPBXOR) } // ~
func shl(i Instruction, vm LuaVM) { _binaryArith(i, vm, LUA_OPSHL) } // <<
func shr(i Instruction, vm LuaVM) { _binaryArith(i, vm, LUA_OPSHR) } // >>
func unm(i Instruction, vm LuaVM) { _unaryArith(i, vm, LUA_OPUNM) } // -
func bnot(i Instruction, vm LuaVM) { _unaryArith(i, vm, LUA_OPBNOT) } // ~
// R(A) := RK(B) op RK(C)
func _binaryArith(i Instruction, vm LuaVM, op ArithOp) {
a, b, c := i.ABC()
a += 1
vm.GetRK(b)
vm.GetRK(c)
vm.Arith(op)
vm.Replace(a)
}
// R(A) := op R(B)
func _unaryArith(i Instruction, vm LuaVM, op ArithOp) {
a, b, _ := i.ABC()
a += 1
b += 1
vm.PushValue(b)
vm.Arith(op)
vm.Replace(a)
}
/* compare */
func eq(i Instruction, vm LuaVM) { _compare(i, vm, LUA_OPEQ) } // ==
func lt(i Instruction, vm LuaVM) { _compare(i, vm, LUA_OPLT) } // <
func le(i Instruction, vm LuaVM) { _compare(i, vm, LUA_OPLE) } // <=
// if ((RK(B) op RK(C)) ~= A) then pc++
func _compare(i Instruction, vm LuaVM, op CompareOp) {
a, b, c := i.ABC()
vm.GetRK(b)
vm.GetRK(c)
if vm.Compare(-2, -1, op) != (a != 0) {
vm.AddPC(1)
}
vm.Pop(2)
}
/* logical */
// R(A) := not R(B)
func not(i Instruction, vm LuaVM) {
a, b, _ := i.ABC()
a += 1
b += 1
vm.PushBoolean(!vm.ToBoolean(b))
vm.Replace(a)
}
// if not (R(A) <=> C) then pc++
func test(i Instruction, vm LuaVM) {
a, _, c := i.ABC()
a += 1
if vm.ToBoolean(a) != (c != 0) {
vm.AddPC(1)
}
}
// if (R(B) <=> C) then R(A) := R(B) else pc++
func testSet(i Instruction, vm LuaVM) {
a, b, c := i.ABC()
a += 1
b += 1
if vm.ToBoolean(b) == (c != 0) {
vm.Copy(b, a)
} else {
vm.AddPC(1)
}
}
/* len & concat */
// R(A) := length of R(B)
func length(i Instruction, vm LuaVM) {
a, b, _ := i.ABC()
a += 1
b += 1
vm.Len(b)
vm.Replace(a)
}
// R(A) := R(B).. ... ..R(C)
func concat(i Instruction, vm LuaVM) {
a, b, c := i.ABC()
a += 1
b += 1
c += 1
n := c - b + 1
vm.CheckStack(n)
for i := b; i <= c; i++ {
vm.PushValue(i)
}
vm.Concat(n)
vm.Replace(a)
}