forked from robertkrimen/otto
-
Notifications
You must be signed in to change notification settings - Fork 0
/
evaluate.go
292 lines (260 loc) · 7.29 KB
/
evaluate.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
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
package otto
import (
"fmt"
"math"
"strings"
"github.com/kubeshark/otto/token"
)
func (rt *runtime) evaluateMultiply(left float64, right float64) Value { //nolint: unused
// TODO 11.5.1
return Value{}
}
func (rt *runtime) evaluateDivide(left float64, right float64) Value {
if math.IsNaN(left) || math.IsNaN(right) {
return NaNValue()
}
if math.IsInf(left, 0) && math.IsInf(right, 0) {
return NaNValue()
}
if left == 0 && right == 0 {
return NaNValue()
}
if math.IsInf(left, 0) {
if math.Signbit(left) == math.Signbit(right) {
return positiveInfinityValue()
}
return negativeInfinityValue()
}
if math.IsInf(right, 0) {
if math.Signbit(left) == math.Signbit(right) {
return positiveZeroValue()
}
return negativeZeroValue()
}
if right == 0 {
if math.Signbit(left) == math.Signbit(right) {
return positiveInfinityValue()
}
return negativeInfinityValue()
}
return float64Value(left / right)
}
func (rt *runtime) evaluateModulo(left float64, right float64) Value { //nolint: unused
// TODO 11.5.3
return Value{}
}
func (rt *runtime) calculateBinaryExpression(operator token.Token, left Value, right Value) Value {
leftValue := left.resolve()
switch operator {
// Additive
case token.PLUS:
leftValue = toPrimitiveValue(leftValue)
rightValue := right.resolve()
rightValue = toPrimitiveValue(rightValue)
if leftValue.IsString() || rightValue.IsString() {
return stringValue(strings.Join([]string{leftValue.string(), rightValue.string()}, ""))
}
return float64Value(leftValue.float64() + rightValue.float64())
case token.MINUS:
rightValue := right.resolve()
return float64Value(leftValue.float64() - rightValue.float64())
// Multiplicative
case token.MULTIPLY:
rightValue := right.resolve()
return float64Value(leftValue.float64() * rightValue.float64())
case token.SLASH:
rightValue := right.resolve()
return rt.evaluateDivide(leftValue.float64(), rightValue.float64())
case token.REMAINDER:
rightValue := right.resolve()
return float64Value(math.Mod(leftValue.float64(), rightValue.float64()))
// Logical
case token.LOGICAL_AND:
left := leftValue.bool()
if !left {
return falseValue
}
return boolValue(right.resolve().bool())
case token.LOGICAL_OR:
left := leftValue.bool()
if left {
return trueValue
}
return boolValue(right.resolve().bool())
// Bitwise
case token.AND:
rightValue := right.resolve()
return int32Value(toInt32(leftValue) & toInt32(rightValue))
case token.OR:
rightValue := right.resolve()
return int32Value(toInt32(leftValue) | toInt32(rightValue))
case token.EXCLUSIVE_OR:
rightValue := right.resolve()
return int32Value(toInt32(leftValue) ^ toInt32(rightValue))
// Shift
// (Masking of 0x1f is to restrict the shift to a maximum of 31 places)
case token.SHIFT_LEFT:
rightValue := right.resolve()
return int32Value(toInt32(leftValue) << (toUint32(rightValue) & 0x1f))
case token.SHIFT_RIGHT:
rightValue := right.resolve()
return int32Value(toInt32(leftValue) >> (toUint32(rightValue) & 0x1f))
case token.UNSIGNED_SHIFT_RIGHT:
rightValue := right.resolve()
// Shifting an unsigned integer is a logical shift
return uint32Value(toUint32(leftValue) >> (toUint32(rightValue) & 0x1f))
case token.INSTANCEOF:
rightValue := right.resolve()
if !rightValue.IsObject() {
panic(rt.panicTypeError("invalid kind %s for instanceof (expected object)", rightValue.kind))
}
return boolValue(rightValue.object().hasInstance(leftValue))
case token.IN:
rightValue := right.resolve()
if !rightValue.IsObject() {
panic(rt.panicTypeError("invalid kind %s for in (expected object)", rightValue.kind))
}
return boolValue(rightValue.object().hasProperty(leftValue.string()))
}
panic(hereBeDragons(operator))
}
type lessThanResult int
const (
lessThanFalse lessThanResult = iota
lessThanTrue
lessThanUndefined
)
func calculateLessThan(left Value, right Value, leftFirst bool) lessThanResult {
var x, y Value
if leftFirst {
x = toNumberPrimitive(left)
y = toNumberPrimitive(right)
} else {
y = toNumberPrimitive(right)
x = toNumberPrimitive(left)
}
var result bool
if x.kind != valueString || y.kind != valueString {
x, y := x.float64(), y.float64()
if math.IsNaN(x) || math.IsNaN(y) {
return lessThanUndefined
}
result = x < y
} else {
x, y := x.string(), y.string()
result = x < y
}
if result {
return lessThanTrue
}
return lessThanFalse
}
// FIXME Probably a map is not the most efficient way to do this.
var lessThanTable [4](map[lessThanResult]bool) = [4](map[lessThanResult]bool){
// <
map[lessThanResult]bool{
lessThanFalse: false,
lessThanTrue: true,
lessThanUndefined: false,
},
// >
map[lessThanResult]bool{
lessThanFalse: false,
lessThanTrue: true,
lessThanUndefined: false,
},
// <=
map[lessThanResult]bool{
lessThanFalse: true,
lessThanTrue: false,
lessThanUndefined: false,
},
// >=
map[lessThanResult]bool{
lessThanFalse: true,
lessThanTrue: false,
lessThanUndefined: false,
},
}
func (rt *runtime) calculateComparison(comparator token.Token, left Value, right Value) bool {
// FIXME Use strictEqualityComparison?
// TODO This might be redundant now (with regards to evaluateComparison)
x := left.resolve()
y := right.resolve()
var kindEqualKind bool
var negate bool
result := true
switch comparator {
case token.LESS:
result = lessThanTable[0][calculateLessThan(x, y, true)]
case token.GREATER:
result = lessThanTable[1][calculateLessThan(y, x, false)]
case token.LESS_OR_EQUAL:
result = lessThanTable[2][calculateLessThan(y, x, false)]
case token.GREATER_OR_EQUAL:
result = lessThanTable[3][calculateLessThan(x, y, true)]
case token.STRICT_NOT_EQUAL:
negate = true
fallthrough
case token.STRICT_EQUAL:
if x.kind != y.kind {
result = false
} else {
kindEqualKind = true
}
case token.NOT_EQUAL:
negate = true
fallthrough
case token.EQUAL:
switch {
case x.kind == y.kind:
kindEqualKind = true
case x.kind <= valueNull && y.kind <= valueNull:
result = true
case x.kind <= valueNull || y.kind <= valueNull:
result = false
case x.kind <= valueString && y.kind <= valueString:
result = x.float64() == y.float64()
case x.kind == valueBoolean:
result = rt.calculateComparison(token.EQUAL, float64Value(x.float64()), y)
case y.kind == valueBoolean:
result = rt.calculateComparison(token.EQUAL, x, float64Value(y.float64()))
case x.kind == valueObject:
result = rt.calculateComparison(token.EQUAL, toPrimitiveValue(x), y)
case y.kind == valueObject:
result = rt.calculateComparison(token.EQUAL, x, toPrimitiveValue(y))
default:
panic(fmt.Sprintf("unknown types for equal: %v ==? %v", x, y))
}
default:
panic(fmt.Sprintf("unknown comparator %s", comparator.String()))
}
if kindEqualKind {
switch x.kind {
case valueUndefined, valueNull:
result = true
case valueNumber:
x := x.float64()
y := y.float64()
if math.IsNaN(x) || math.IsNaN(y) {
result = false
} else {
result = x == y
}
case valueString:
result = x.string() == y.string()
case valueBoolean:
result = x.bool() == y.bool()
case valueObject:
result = x.object() == y.object()
default:
goto ERROR
}
}
if negate {
result = !result
}
return result
ERROR:
panic(hereBeDragons("%v (%v) %s %v (%v)", x, x.kind, comparator, y, y.kind))
}