porffor 0.2.0-536e463 → 0.2.0-6fd3f05
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/compiler/decompile.js +1 -1
- package/compiler/encoding.js +2 -116
- package/package.json +1 -1
package/compiler/decompile.js
CHANGED
@@ -120,7 +120,7 @@ export const highlightAsm = asm => asm
|
|
120
120
|
.replace(/(local|global|memory)\.[^\s]*/g, _ => `\x1B[31m${_}\x1B[0m`)
|
121
121
|
.replace(/(i(8|16|32|64)x[0-9]+|v128)(\.[^\s]*)?/g, _ => `\x1B[34m${_}\x1B[0m`)
|
122
122
|
.replace(/[^m](i32|i64|f32|f64|drop)(\.[^\s]*)?/g, _ => `${_[0]}\x1B[36m${_.slice(1)}\x1B[0m`)
|
123
|
-
.replace(/(return_call|call|br_if|br|return|throw
|
123
|
+
.replace(/(return_call|call|br_if|br|return|rethrow|throw)/g, _ => `\x1B[35m${_}\x1B[0m`)
|
124
124
|
.replace(/(block|loop|if|end|else|try|catch_all|catch|delegate)/g, _ => `\x1B[95m${_}\x1B[0m`)
|
125
125
|
.replace(/unreachable/g, _ => `\x1B[91m${_}\x1B[0m`)
|
126
126
|
.replace(/ \-?[0-9\.]+/g, _ => ` \x1B[33m${_.slice(1)}\x1B[0m`)
|
package/compiler/encoding.js
CHANGED
@@ -105,119 +105,5 @@ export const read_unsignedLEB128 = _input => {
|
|
105
105
|
};
|
106
106
|
|
107
107
|
// ieee 754 binary64
|
108
|
-
|
109
|
-
|
110
|
-
// BSD 3-Clause. Copyright 2008 Fair Oaks Labs, Inc. (https://github.com/feross/ieee754/blob/master/LICENSE)
|
111
|
-
export const ieee754_binary64 = value => {
|
112
|
-
return [...new Uint8Array(new Float64Array([ value ]).buffer)];
|
113
|
-
|
114
|
-
let isLE = true, mLen = 52, nBytes = 8, offset = 0;
|
115
|
-
let buffer = new Array(nBytes).fill(0);
|
116
|
-
|
117
|
-
let e, m, c
|
118
|
-
let eLen = (nBytes * 8) - mLen - 1
|
119
|
-
const eMax = (1 << eLen) - 1
|
120
|
-
const eBias = eMax >> 1
|
121
|
-
const rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)
|
122
|
-
let i = isLE ? 0 : (nBytes - 1)
|
123
|
-
const d = isLE ? 1 : -1
|
124
|
-
const s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0
|
125
|
-
|
126
|
-
value = Math.abs(value)
|
127
|
-
|
128
|
-
if (isNaN(value) || value === Infinity) {
|
129
|
-
m = isNaN(value) ? 1 : 0
|
130
|
-
e = eMax
|
131
|
-
} else {
|
132
|
-
e = Math.floor(Math.log(value) / Math.LN2)
|
133
|
-
if (value * (c = Math.pow(2, -e)) < 1) {
|
134
|
-
e--
|
135
|
-
c *= 2
|
136
|
-
}
|
137
|
-
if (e + eBias >= 1) {
|
138
|
-
value += rt / c
|
139
|
-
} else {
|
140
|
-
value += rt * Math.pow(2, 1 - eBias)
|
141
|
-
}
|
142
|
-
if (value * c >= 2) {
|
143
|
-
e++
|
144
|
-
c /= 2
|
145
|
-
}
|
146
|
-
|
147
|
-
if (e + eBias >= eMax) {
|
148
|
-
m = 0
|
149
|
-
e = eMax
|
150
|
-
} else if (e + eBias >= 1) {
|
151
|
-
m = ((value * c) - 1) * Math.pow(2, mLen)
|
152
|
-
e = e + eBias
|
153
|
-
} else {
|
154
|
-
m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)
|
155
|
-
e = 0
|
156
|
-
}
|
157
|
-
}
|
158
|
-
|
159
|
-
while (mLen >= 8) {
|
160
|
-
buffer[offset + i] = m & 0xff
|
161
|
-
i += d
|
162
|
-
m /= 256
|
163
|
-
mLen -= 8
|
164
|
-
}
|
165
|
-
|
166
|
-
e = (e << mLen) | m
|
167
|
-
eLen += mLen
|
168
|
-
while (eLen > 0) {
|
169
|
-
buffer[offset + i] = e & 0xff
|
170
|
-
i += d
|
171
|
-
e /= 256
|
172
|
-
eLen -= 8
|
173
|
-
}
|
174
|
-
|
175
|
-
buffer[offset + i - d] |= s * 128
|
176
|
-
|
177
|
-
return buffer;
|
178
|
-
};
|
179
|
-
|
180
|
-
export const read_ieee754_binary64 = buffer => {
|
181
|
-
return new Float64Array(new Uint8Array(buffer).buffer)[0];
|
182
|
-
|
183
|
-
let isLE = true, mLen = 52, nBytes = 8, offset = 0;
|
184
|
-
|
185
|
-
let e, m
|
186
|
-
const eLen = (nBytes * 8) - mLen - 1
|
187
|
-
const eMax = (1 << eLen) - 1
|
188
|
-
const eBias = eMax >> 1
|
189
|
-
let nBits = -7
|
190
|
-
let i = isLE ? (nBytes - 1) : 0
|
191
|
-
const d = isLE ? -1 : 1
|
192
|
-
let s = buffer[offset + i]
|
193
|
-
|
194
|
-
i += d
|
195
|
-
|
196
|
-
e = s & ((1 << (-nBits)) - 1)
|
197
|
-
s >>= (-nBits)
|
198
|
-
nBits += eLen
|
199
|
-
while (nBits > 0) {
|
200
|
-
e = (e * 256) + buffer[offset + i]
|
201
|
-
i += d
|
202
|
-
nBits -= 8
|
203
|
-
}
|
204
|
-
|
205
|
-
m = e & ((1 << (-nBits)) - 1)
|
206
|
-
e >>= (-nBits)
|
207
|
-
nBits += mLen
|
208
|
-
while (nBits > 0) {
|
209
|
-
m = (m * 256) + buffer[offset + i]
|
210
|
-
i += d
|
211
|
-
nBits -= 8
|
212
|
-
}
|
213
|
-
|
214
|
-
if (e === 0) {
|
215
|
-
e = 1 - eBias
|
216
|
-
} else if (e === eMax) {
|
217
|
-
return m ? NaN : ((s ? -1 : 1) * Infinity)
|
218
|
-
} else {
|
219
|
-
m = m + Math.pow(2, mLen)
|
220
|
-
e = e - eBias
|
221
|
-
}
|
222
|
-
return (s ? -1 : 1) * m * Math.pow(2, e - mLen)
|
223
|
-
};
|
108
|
+
export const ieee754_binary64 = value => [...new Uint8Array(new Float64Array([ value ]).buffer)];
|
109
|
+
export const read_ieee754_binary64 = buffer => new Float64Array(new Uint8Array(buffer).buffer)[0];
|
package/package.json
CHANGED