Skip to content

Instantly share code, notes, and snippets.

@guybedford

guybedford/flavorful.js Secret

Created March 25, 2024 16:28
Show Gist options
  • Save guybedford/06abf2ec8a17238e86413ce6af51487e to your computer and use it in GitHub Desktop.
Save guybedford/06abf2ec8a17238e86413ce6af51487e to your computer and use it in GitHub Desktop.
Download ZIP
flavorful-generator-output.js
Raw
flavorful.js
import * as import0 from '../flavorful.js';
import * as import1 from '../helpers.js';
class ComponentError extends Error {
constructor (value) {
const enumerable = typeof value !== 'string';
super(enumerable ? `${String(value)} (see error.payload)` : value);
Object.defineProperty(this, 'payload', { value, enumerable });
}
}
let dv = new DataView(new ArrayBuffer());
const dataView = mem => dv.buffer === mem.buffer ? dv : dv = new DataView(mem.buffer);
function getErrorPayload(e) {
if (e && hasOwnProperty.call(e, 'payload')) return e.payload;
if (e instanceof Error) throw e;
return e;
}
const hasOwnProperty = Object.prototype.hasOwnProperty;
function throwInvalidBool() {
throw new TypeError('invalid variant discriminant for bool');
}
const utf8Decoder = new TextDecoder();
const utf8Encoder = new TextEncoder();
let utf8EncodedLen = 0;
function utf8Encode(s, realloc, memory) {
if (typeof s !== 'string') throw new TypeError('expected a string');
if (s.length === 0) {
utf8EncodedLen = 0;
return 1;
}
let allocLen = 0;
let ptr = 0;
let writtenTotal = 0;
while (s.length > 0) {
ptr = realloc(ptr, allocLen, 1, allocLen += s.length * 2);
const { read, written } = utf8Encoder.encodeInto(
s,
new Uint8Array(memory.buffer, ptr + writtenTotal, allocLen - writtenTotal),
);
writtenTotal += written;
s = s.slice(read);
}
utf8EncodedLen = writtenTotal;
return ptr;
}
function _instantiate(getCoreModule, imports, instantiateCore = WebAssembly.instantiate) {
const module0 = getCoreModule('flavorful.core.wasm');
const module1 = getCoreModule('flavorful.core2.wasm');
const module2 = getCoreModule('flavorful.core3.wasm');
const module3 = getCoreModule('flavorful.core4.wasm');
const { errnoResult, fListInRecord1, fListInRecord2, fListInRecord3, fListInRecord4, fListInVariant1, fListInVariant2, fListInVariant3, listOfVariants, listTypedefs } = imports['../flavorful.js'];
const { log, logErr } = imports['../helpers.js'];
let gen = (function* init () {
let exports0;
let exports1;
let exports2;
let memory0;
let realloc0;
function trampoline0(arg0, arg1) {
var ptr0 = arg0;
var len0 = arg1;
var result0 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr0, len0));
fListInRecord1({
a: result0,
});
}
function trampoline1(arg0) {
const ret = fListInRecord2();
var {a: v0_0 } = ret;
var ptr1 = utf8Encode(v0_0, realloc0, memory0);
var len1 = utf8EncodedLen;
dataView(memory0).setInt32(arg0 + 4, len1, true);
dataView(memory0).setInt32(arg0 + 0, ptr1, true);
}
function trampoline2(arg0, arg1, arg2) {
var ptr0 = arg0;
var len0 = arg1;
var result0 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr0, len0));
const ret = fListInRecord3({
a: result0,
});
var {a: v1_0 } = ret;
var ptr2 = utf8Encode(v1_0, realloc0, memory0);
var len2 = utf8EncodedLen;
dataView(memory0).setInt32(arg2 + 4, len2, true);
dataView(memory0).setInt32(arg2 + 0, ptr2, true);
}
function trampoline3(arg0, arg1, arg2) {
var ptr0 = arg0;
var len0 = arg1;
var result0 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr0, len0));
const ret = fListInRecord4({
a: result0,
});
var {a: v1_0 } = ret;
var ptr2 = utf8Encode(v1_0, realloc0, memory0);
var len2 = utf8EncodedLen;
dataView(memory0).setInt32(arg2 + 4, len2, true);
dataView(memory0).setInt32(arg2 + 0, ptr2, true);
}
function trampoline4(arg0, arg1, arg2, arg3, arg4, arg5) {
let variant1;
switch (arg0) {
case 0: {
variant1 = undefined;
break;
}
case 1: {
var ptr0 = arg1;
var len0 = arg2;
var result0 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr0, len0));
variant1 = result0;
break;
}
default: {
throw new TypeError('invalid variant discriminant for option');
}
}
let variant3;
switch (arg3) {
case 0: {
variant3= {
tag: 'ok',
val: undefined
};
break;
}
case 1: {
var ptr2 = arg4;
var len2 = arg5;
var result2 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr2, len2));
variant3= {
tag: 'err',
val: result2
};
break;
}
default: {
throw new TypeError('invalid variant discriminant for expected');
}
}
fListInVariant1(variant1, variant3);
}
function trampoline5(arg0) {
const ret = fListInVariant2();
var variant1 = ret;
if (variant1 === null || variant1=== undefined) {
dataView(memory0).setInt8(arg0 + 0, 0, true);
} else {
const e = variant1;
dataView(memory0).setInt8(arg0 + 0, 1, true);
var ptr0 = utf8Encode(e, realloc0, memory0);
var len0 = utf8EncodedLen;
dataView(memory0).setInt32(arg0 + 8, len0, true);
dataView(memory0).setInt32(arg0 + 4, ptr0, true);
}
}
function trampoline6(arg0, arg1, arg2, arg3) {
let variant1;
switch (arg0) {
case 0: {
variant1 = undefined;
break;
}
case 1: {
var ptr0 = arg1;
var len0 = arg2;
var result0 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr0, len0));
variant1 = result0;
break;
}
default: {
throw new TypeError('invalid variant discriminant for option');
}
}
const ret = fListInVariant3(variant1);
var variant3 = ret;
if (variant3 === null || variant3=== undefined) {
dataView(memory0).setInt8(arg3 + 0, 0, true);
} else {
const e = variant3;
dataView(memory0).setInt8(arg3 + 0, 1, true);
var ptr2 = utf8Encode(e, realloc0, memory0);
var len2 = utf8EncodedLen;
dataView(memory0).setInt32(arg3 + 8, len2, true);
dataView(memory0).setInt32(arg3 + 4, ptr2, true);
}
}
function trampoline7(arg0) {
let ret;
try {
ret = { tag: 'ok', val: errnoResult()};
} catch (e) {
ret = { tag: 'err', val: getErrorPayload(e) };
}
var variant1 = ret;
switch (variant1.tag) {
case 'ok': {
const e = variant1.val;
dataView(memory0).setInt8(arg0 + 0, 0, true);
break;
}
case 'err': {
const e = variant1.val;
dataView(memory0).setInt8(arg0 + 0, 1, true);
var val0 = e;
let enum0;
switch (val0) {
case 'success': {
enum0 = 0;
break;
}
case 'a': {
enum0 = 1;
break;
}
case 'b': {
enum0 = 2;
break;
}
default: {
if ((e) instanceof Error) {
console.error(e);
}
throw new TypeError(`"${val0}" is not one of the cases of my-errno`);
}
}
dataView(memory0).setInt8(arg0 + 1, enum0, true);
break;
}
default: {
throw new TypeError('invalid variant specified for result');
}
}
}
function trampoline8(arg0, arg1, arg2, arg3, arg4) {
var ptr0 = arg0;
var len0 = arg1;
var result0 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr0, len0));
var len2 = arg3;
var base2 = arg2;
var result2 = [];
for (let i = 0; i < len2; i++) {
const base = base2 + i * 8;
var ptr1 = dataView(memory0).getInt32(base + 0, true);
var len1 = dataView(memory0).getInt32(base + 4, true);
var result1 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr1, len1));
result2.push(result1);
}
var [ret0, ret1] = listTypedefs(result0, result2);
var val3 = ret0;
var len3 = val3.byteLength;
var ptr3 = realloc0(0, 0, 1, len3 * 1);
var src3 = new Uint8Array(val3.buffer || val3, val3.byteOffset, len3 * 1);
(new Uint8Array(memory0.buffer, ptr3, len3 * 1)).set(src3);
dataView(memory0).setInt32(arg4 + 4, len3, true);
dataView(memory0).setInt32(arg4 + 0, ptr3, true);
var vec5 = ret1;
var len5 = vec5.length;
var result5 = realloc0(0, 0, 4, len5 * 8);
for (let i = 0; i < vec5.length; i++) {
const e = vec5[i];
const base = result5 + i * 8;var ptr4 = utf8Encode(e, realloc0, memory0);
var len4 = utf8EncodedLen;
dataView(memory0).setInt32(base + 4, len4, true);
dataView(memory0).setInt32(base + 0, ptr4, true);
}
dataView(memory0).setInt32(arg4 + 12, len5, true);
dataView(memory0).setInt32(arg4 + 8, result5, true);
}
function trampoline9(arg0, arg1, arg2, arg3, arg4, arg5, arg6) {
var len1 = arg1;
var base1 = arg0;
var result1 = [];
for (let i = 0; i < len1; i++) {
const base = base1 + i * 1;
var bool0 = dataView(memory0).getUint8(base + 0, true);
result1.push(bool0 == 0 ? false : (bool0 == 1 ? true : throwInvalidBool()));
}
var len3 = arg3;
var base3 = arg2;
var result3 = [];
for (let i = 0; i < len3; i++) {
const base = base3 + i * 1;
let variant2;
switch (dataView(memory0).getUint8(base + 0, true)) {
case 0: {
variant2= {
tag: 'ok',
val: undefined
};
break;
}
case 1: {
variant2= {
tag: 'err',
val: undefined
};
break;
}
default: {
throw new TypeError('invalid variant discriminant for expected');
}
}
result3.push(variant2);
}
var len5 = arg5;
var base5 = arg4;
var result5 = [];
for (let i = 0; i < len5; i++) {
const base = base5 + i * 1;
let enum4;
switch (dataView(memory0).getUint8(base + 0, true)) {
case 0: {
enum4 = 'success';
break;
}
case 1: {
enum4 = 'a';
break;
}
case 2: {
enum4 = 'b';
break;
}
default: {
throw new TypeError('invalid discriminant specified for MyErrno');
}
}
result5.push(enum4);
}
var [ret0, ret1, ret2] = listOfVariants(result1, result3, result5);
var vec6 = ret0;
var len6 = vec6.length;
var result6 = realloc0(0, 0, 1, len6 * 1);
for (let i = 0; i < vec6.length; i++) {
const e = vec6[i];
const base = result6 + i * 1;dataView(memory0).setInt8(base + 0, e ? 1 : 0, true);
}
dataView(memory0).setInt32(arg6 + 4, len6, true);
dataView(memory0).setInt32(arg6 + 0, result6, true);
var vec8 = ret1;
var len8 = vec8.length;
var result8 = realloc0(0, 0, 1, len8 * 1);
for (let i = 0; i < vec8.length; i++) {
const e = vec8[i];
const base = result8 + i * 1;var variant7 = e;
switch (variant7.tag) {
case 'ok': {
const e = variant7.val;
dataView(memory0).setInt8(base + 0, 0, true);
break;
}
case 'err': {
const e = variant7.val;
dataView(memory0).setInt8(base + 0, 1, true);
break;
}
default: {
throw new TypeError('invalid variant specified for result');
}
}
}
dataView(memory0).setInt32(arg6 + 12, len8, true);
dataView(memory0).setInt32(arg6 + 8, result8, true);
var vec10 = ret2;
var len10 = vec10.length;
var result10 = realloc0(0, 0, 1, len10 * 1);
for (let i = 0; i < vec10.length; i++) {
const e = vec10[i];
const base = result10 + i * 1;var val9 = e;
let enum9;
switch (val9) {
case 'success': {
enum9 = 0;
break;
}
case 'a': {
enum9 = 1;
break;
}
case 'b': {
enum9 = 2;
break;
}
default: {
if ((e) instanceof Error) {
console.error(e);
}
throw new TypeError(`"${val9}" is not one of the cases of my-errno`);
}
}
dataView(memory0).setInt8(base + 0, enum9, true);
}
dataView(memory0).setInt32(arg6 + 20, len10, true);
dataView(memory0).setInt32(arg6 + 16, result10, true);
}
function trampoline10(arg0, arg1) {
var ptr0 = arg0;
var len0 = arg1;
var result0 = new Uint8Array(memory0.buffer.slice(ptr0, ptr0 + len0 * 1));
log(result0);
}
function trampoline11(arg0, arg1) {
var ptr0 = arg0;
var len0 = arg1;
var result0 = new Uint8Array(memory0.buffer.slice(ptr0, ptr0 + len0 * 1));
logErr(result0);
}
let exports3;
let postReturn0;
let postReturn1;
let postReturn2;
let postReturn3;
let postReturn4;
let postReturn5;
let postReturn6;
Promise.all([module0, module1, module2, module3]).catch(() => {});
({ exports: exports0 } = yield instantiateCore(yield module2));
({ exports: exports1 } = yield instantiateCore(yield module0, {
'test:flavorful/test': {
'errno-result': exports0['$7'],
'f-list-in-record1': exports0['$0'],
'f-list-in-record2': exports0['$1'],
'f-list-in-record3': exports0['$2'],
'f-list-in-record4': exports0['$3'],
'f-list-in-variant1': exports0['$4'],
'f-list-in-variant2': exports0['$5'],
'f-list-in-variant3': exports0['$6'],
'list-of-variants': exports0['$9'],
'list-typedefs': exports0['$8'],
},
wasi_snapshot_preview1: {
fd_close: exports0['$12'],
fd_seek: exports0['$13'],
fd_write: exports0['$14'],
},
}));
({ exports: exports2 } = yield instantiateCore(yield module1, {
env: {
memory: exports1.memory,
},
testwasi: {
log: exports0['$10'],
'log-err': exports0['$11'],
},
}));
memory0 = exports1.memory;
realloc0 = exports1.cabi_realloc;
({ exports: exports3 } = yield instantiateCore(yield module3, {
'': {
$imports: exports0.$imports,
'0': trampoline0,
'1': trampoline1,
'10': trampoline10,
'11': trampoline11,
'12': exports2.fd_close,
'13': exports2.fd_seek,
'14': exports2.fd_write,
'2': trampoline2,
'3': trampoline3,
'4': trampoline4,
'5': trampoline5,
'6': trampoline6,
'7': trampoline7,
'8': trampoline8,
'9': trampoline9,
},
}));
postReturn0 = exports1['cabi_post_test_flavorful_test_f_list_in_record2'];
postReturn1 = exports1['cabi_post_test_flavorful_test_f_list_in_record3'];
postReturn2 = exports1['cabi_post_test_flavorful_test_f_list_in_record4'];
postReturn3 = exports1['cabi_post_test_flavorful_test_f_list_in_variant2'];
postReturn4 = exports1['cabi_post_test_flavorful_test_f_list_in_variant3'];
postReturn5 = exports1['cabi_post_test_flavorful_test_list_typedefs'];
postReturn6 = exports1['cabi_post_test_flavorful_test_list_of_variants'];
function fListInRecord1$1(arg0) {
var {a: v0_0 } = arg0;
var ptr1 = utf8Encode(v0_0, realloc0, memory0);
var len1 = utf8EncodedLen;
exports1['test_flavorful_test_f_list_in_record1'](ptr1, len1);
}
function fListInRecord2$1() {
const ret = exports1['test_flavorful_test_f_list_in_record2']();
var ptr0 = dataView(memory0).getInt32(ret + 0, true);
var len0 = dataView(memory0).getInt32(ret + 4, true);
var result0 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr0, len0));
postReturn0(ret);
return {
a: result0,
};
}
function fListInRecord3$1(arg0) {
var {a: v0_0 } = arg0;
var ptr1 = utf8Encode(v0_0, realloc0, memory0);
var len1 = utf8EncodedLen;
const ret = exports1['test_flavorful_test_f_list_in_record3'](ptr1, len1);
var ptr2 = dataView(memory0).getInt32(ret + 0, true);
var len2 = dataView(memory0).getInt32(ret + 4, true);
var result2 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr2, len2));
postReturn1(ret);
return {
a: result2,
};
}
function fListInRecord4$1(arg0) {
var {a: v0_0 } = arg0;
var ptr1 = utf8Encode(v0_0, realloc0, memory0);
var len1 = utf8EncodedLen;
const ret = exports1['test_flavorful_test_f_list_in_record4'](ptr1, len1);
var ptr2 = dataView(memory0).getInt32(ret + 0, true);
var len2 = dataView(memory0).getInt32(ret + 4, true);
var result2 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr2, len2));
postReturn2(ret);
return {
a: result2,
};
}
function fListInVariant1$1(arg0, arg1) {
var variant1 = arg0;
let variant1_0;
let variant1_1;
let variant1_2;
if (variant1 === null || variant1=== undefined) {
variant1_0 = 0;
variant1_1 = 0;
variant1_2 = 0;
} else {
const e = variant1;
var ptr0 = utf8Encode(e, realloc0, memory0);
var len0 = utf8EncodedLen;
variant1_0 = 1;
variant1_1 = ptr0;
variant1_2 = len0;
}
var variant3 = arg1;
let variant3_0;
let variant3_1;
let variant3_2;
switch (variant3.tag) {
case 'ok': {
const e = variant3.val;
variant3_0 = 0;
variant3_1 = 0;
variant3_2 = 0;
break;
}
case 'err': {
const e = variant3.val;
var ptr2 = utf8Encode(e, realloc0, memory0);
var len2 = utf8EncodedLen;
variant3_0 = 1;
variant3_1 = ptr2;
variant3_2 = len2;
break;
}
default: {
throw new TypeError('invalid variant specified for result');
}
}
exports1['test_flavorful_test_f_list_in_variant1'](variant1_0, variant1_1, variant1_2, variant3_0, variant3_1, variant3_2);
}
function fListInVariant2$1() {
const ret = exports1['test_flavorful_test_f_list_in_variant2']();
let variant1;
switch (dataView(memory0).getUint8(ret + 0, true)) {
case 0: {
variant1 = undefined;
break;
}
case 1: {
var ptr0 = dataView(memory0).getInt32(ret + 4, true);
var len0 = dataView(memory0).getInt32(ret + 8, true);
var result0 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr0, len0));
variant1 = result0;
break;
}
default: {
throw new TypeError('invalid variant discriminant for option');
}
}
postReturn3(ret);
return variant1;
}
function fListInVariant3$1(arg0) {
var variant1 = arg0;
let variant1_0;
let variant1_1;
let variant1_2;
if (variant1 === null || variant1=== undefined) {
variant1_0 = 0;
variant1_1 = 0;
variant1_2 = 0;
} else {
const e = variant1;
var ptr0 = utf8Encode(e, realloc0, memory0);
var len0 = utf8EncodedLen;
variant1_0 = 1;
variant1_1 = ptr0;
variant1_2 = len0;
}
const ret = exports1['test_flavorful_test_f_list_in_variant3'](variant1_0, variant1_1, variant1_2);
let variant3;
switch (dataView(memory0).getUint8(ret + 0, true)) {
case 0: {
variant3 = undefined;
break;
}
case 1: {
var ptr2 = dataView(memory0).getInt32(ret + 4, true);
var len2 = dataView(memory0).getInt32(ret + 8, true);
var result2 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr2, len2));
variant3 = result2;
break;
}
default: {
throw new TypeError('invalid variant discriminant for option');
}
}
postReturn4(ret);
return variant3;
}
function errnoResult$1() {
const ret = exports1['test_flavorful_test_errno_result']();
let variant1;
switch (dataView(memory0).getUint8(ret + 0, true)) {
case 0: {
variant1= {
tag: 'ok',
val: undefined
};
break;
}
case 1: {
let enum0;
switch (dataView(memory0).getUint8(ret + 1, true)) {
case 0: {
enum0 = 'success';
break;
}
case 1: {
enum0 = 'a';
break;
}
case 2: {
enum0 = 'b';
break;
}
default: {
throw new TypeError('invalid discriminant specified for MyErrno');
}
}
variant1= {
tag: 'err',
val: enum0
};
break;
}
default: {
throw new TypeError('invalid variant discriminant for expected');
}
}
if (variant1.tag === 'err') {
throw new ComponentError(variant1.val);
}
return variant1.val;
}
function listTypedefs$1(arg0, arg1) {
var ptr0 = utf8Encode(arg0, realloc0, memory0);
var len0 = utf8EncodedLen;
var vec2 = arg1;
var len2 = vec2.length;
var result2 = realloc0(0, 0, 4, len2 * 8);
for (let i = 0; i < vec2.length; i++) {
const e = vec2[i];
const base = result2 + i * 8;var ptr1 = utf8Encode(e, realloc0, memory0);
var len1 = utf8EncodedLen;
dataView(memory0).setInt32(base + 4, len1, true);
dataView(memory0).setInt32(base + 0, ptr1, true);
}
const ret = exports1['test_flavorful_test_list_typedefs'](ptr0, len0, result2, len2);
var ptr3 = dataView(memory0).getInt32(ret + 0, true);
var len3 = dataView(memory0).getInt32(ret + 4, true);
var result3 = new Uint8Array(memory0.buffer.slice(ptr3, ptr3 + len3 * 1));
var len5 = dataView(memory0).getInt32(ret + 12, true);
var base5 = dataView(memory0).getInt32(ret + 8, true);
var result5 = [];
for (let i = 0; i < len5; i++) {
const base = base5 + i * 8;
var ptr4 = dataView(memory0).getInt32(base + 0, true);
var len4 = dataView(memory0).getInt32(base + 4, true);
var result4 = utf8Decoder.decode(new Uint8Array(memory0.buffer, ptr4, len4));
result5.push(result4);
}
postReturn5(ret);
return [result3, result5];
}
function listOfVariants$1(arg0, arg1, arg2) {
var vec0 = arg0;
var len0 = vec0.length;
var result0 = realloc0(0, 0, 1, len0 * 1);
for (let i = 0; i < vec0.length; i++) {
const e = vec0[i];
const base = result0 + i * 1;dataView(memory0).setInt8(base + 0, e ? 1 : 0, true);
}
var vec2 = arg1;
var len2 = vec2.length;
var result2 = realloc0(0, 0, 1, len2 * 1);
for (let i = 0; i < vec2.length; i++) {
const e = vec2[i];
const base = result2 + i * 1;var variant1 = e;
switch (variant1.tag) {
case 'ok': {
const e = variant1.val;
dataView(memory0).setInt8(base + 0, 0, true);
break;
}
case 'err': {
const e = variant1.val;
dataView(memory0).setInt8(base + 0, 1, true);
break;
}
default: {
throw new TypeError('invalid variant specified for result');
}
}
}
var vec4 = arg2;
var len4 = vec4.length;
var result4 = realloc0(0, 0, 1, len4 * 1);
for (let i = 0; i < vec4.length; i++) {
const e = vec4[i];
const base = result4 + i * 1;var val3 = e;
let enum3;
switch (val3) {
case 'success': {
enum3 = 0;
break;
}
case 'a': {
enum3 = 1;
break;
}
case 'b': {
enum3 = 2;
break;
}
default: {
if ((e) instanceof Error) {
console.error(e);
}
throw new TypeError(`"${val3}" is not one of the cases of my-errno`);
}
}
dataView(memory0).setInt8(base + 0, enum3, true);
}
const ret = exports1['test_flavorful_test_list_of_variants'](result0, len0, result2, len2, result4, len4);
var len6 = dataView(memory0).getInt32(ret + 4, true);
var base6 = dataView(memory0).getInt32(ret + 0, true);
var result6 = [];
for (let i = 0; i < len6; i++) {
const base = base6 + i * 1;
var bool5 = dataView(memory0).getUint8(base + 0, true);
result6.push(bool5 == 0 ? false : (bool5 == 1 ? true : throwInvalidBool()));
}
var len8 = dataView(memory0).getInt32(ret + 12, true);
var base8 = dataView(memory0).getInt32(ret + 8, true);
var result8 = [];
for (let i = 0; i < len8; i++) {
const base = base8 + i * 1;
let variant7;
switch (dataView(memory0).getUint8(base + 0, true)) {
case 0: {
variant7= {
tag: 'ok',
val: undefined
};
break;
}
case 1: {
variant7= {
tag: 'err',
val: undefined
};
break;
}
default: {
throw new TypeError('invalid variant discriminant for expected');
}
}
result8.push(variant7);
}
var len10 = dataView(memory0).getInt32(ret + 20, true);
var base10 = dataView(memory0).getInt32(ret + 16, true);
var result10 = [];
for (let i = 0; i < len10; i++) {
const base = base10 + i * 1;
let enum9;
switch (dataView(memory0).getUint8(base + 0, true)) {
case 0: {
enum9 = 'success';
break;
}
case 1: {
enum9 = 'a';
break;
}
case 2: {
enum9 = 'b';
break;
}
default: {
throw new TypeError('invalid discriminant specified for MyErrno');
}
}
result10.push(enum9);
}
postReturn6(ret);
return [result6, result8, result10];
}
function testImports() {
exports1['test_imports']();
}
const test = {
errnoResult: errnoResult$1,
fListInRecord1: fListInRecord1$1,
fListInRecord2: fListInRecord2$1,
fListInRecord3: fListInRecord3$1,
fListInRecord4: fListInRecord4$1,
fListInVariant1: fListInVariant1$1,
fListInVariant2: fListInVariant2$1,
fListInVariant3: fListInVariant3$1,
listOfVariants: listOfVariants$1,
listTypedefs: listTypedefs$1,
};
return { test, 'test:flavorful/test': test, testImports, };
})();
let promise, resolve, reject;
function runNext (value) {
try {
let done;
do {
({ value, done } = gen.next(value));
} while (!(value instanceof Promise) && !done);
if (done) {
if (resolve) resolve(value);
else return value;
}
if (!promise) promise = new Promise((_resolve, _reject) => (resolve = _resolve, reject = _reject));
value.then(nextVal => done ? resolve() : runNext(nextVal), reject);
}
catch (e) {
if (reject) reject(e);
else throw e;
}
}
const maybeSyncReturn = runNext(null);
return promise || maybeSyncReturn;
}
const asmInit = [function asm0(imports) {
var bufferView;
var base64ReverseLookup = new Uint8Array(123/*'z'+1*/);
for (var i = 25; i >= 0; --i) {
base64ReverseLookup[48+i] = 52+i; // '0-9'
base64ReverseLookup[65+i] = i; // 'A-Z'
base64ReverseLookup[97+i] = 26+i; // 'a-z'
}
base64ReverseLookup[43] = 62; // '+'
base64ReverseLookup[47] = 63; // '/'
/** @noinline Inlining this function would mean expanding the base64 string 4x times in the source code, which Closure seems to be happy to do. */
function base64DecodeToExistingUint8Array(uint8Array, offset, b64) {
var b1, b2, i = 0, j = offset, bLength = b64.length, end = offset + (bLength*3>>2) - (b64[bLength-2] == '=') - (b64[bLength-1] == '=');
for (; i < bLength; i += 4) {
b1 = base64ReverseLookup[b64.charCodeAt(i+1)];
b2 = base64ReverseLookup[b64.charCodeAt(i+2)];
uint8Array[j++] = base64ReverseLookup[b64.charCodeAt(i)] << 2 | b1 >> 4;
if (j < end) uint8Array[j++] = b1 << 4 | b2 >> 2;
if (j < end) uint8Array[j++] = b2 << 6 | base64ReverseLookup[b64.charCodeAt(i+3)];
}
return uint8Array;
}
function initActiveSegments(imports) {
base64DecodeToExistingUint8Array(bufferView, 1024, "LSsgICAwWDB4AC0wWCswWCAwWC0weCsweCAweABsaXN0X2luX3JlY29yZDMgb3V0cHV0AGxpc3RfaW5fcmVjb3JkMyBpbnB1dABmbGF2b3JmdWxfdGVzdF9pbXBvcnRzAGV4cG9ydHNfdGVzdF9mbGF2b3JmdWxfdGVzdF9saXN0X29mX3ZhcmlhbnRzAGV4cG9ydHNfdGVzdF9mbGF2b3JmdWxfdGVzdF9saXN0X3R5cGVkZWZzAGItPmlzX2VycgBiYXIAZm9vAG5hbgBpbmYAZS5wdHJbMF0uaXNfZXJyID09IHRydWUAZC5wdHJbMV0gPT0gdHJ1ZQBlLnB0clsxXS5pc19lcnIgPT0gZmFsc2UAZC5wdHJbMF0gPT0gZmFsc2UALi90ZXN0cy9ydW50aW1lL2ZsYXZvcmZ1bC93YXNtLmMATkFOAG1heWJlX2EgIT0gTlVMTABJTkYAZXJybm8gPT0gVEVTVF9GTEFWT1JGVUxfVEVTVF9NWV9FUlJOT19CAGYucHRyWzFdID09IFRFU1RfRkxBVk9SRlVMX1RFU1RfTVlfRVJSTk9fQgBmLnB0clswXSA9PSBURVNUX0ZMQVZPUkZVTF9URVNUX01ZX0VSUk5PX0EAaW5wdXQ0AHJlc3VsdDQAdHlwZWRlZjQAZXhwb3J0c190ZXN0X2ZsYXZvcmZ1bF90ZXN0X2ZfbGlzdF9pbl9yZWNvcmQ0AG91dHB1dDMAaW5wdXQzAGV4cG9ydHNfdGVzdF9mbGF2b3JmdWxfdGVzdF9mX2xpc3RfaW5fdmFyaWFudDMAdHlwZWRlZjMAZXhwb3J0c190ZXN0X2ZsYXZvcmZ1bF90ZXN0X2ZfbGlzdF9pbl9yZWNvcmQzAGxpc3RfaW5fdmFyaWFudDIAdHlwZWRlZjIAbGlzdF9pbl9yZWNvcmQyAGYubGVuID09IDIAZS5sZW4gPT0gMgBkLmxlbiA9PSAyAGV4cG9ydHNfdGVzdF9mbGF2b3JmdWxfdGVzdF9mX2xpc3RfaW5fdmFyaWFudDEAdHlwZWRlZjEAZXhwb3J0c190ZXN0X2ZsYXZvcmZ1bF90ZXN0X2ZfbGlzdF9pbl9yZWNvcmQxAGMtPmxlbiA9PSAxAGQubGVuID09IDEAbWVtY21wKG1heWJlX2EtPnB0ciwgImZvbyIsIG1heWJlX2EtPmxlbikgPT0gMABtZW1jbXAobWF5YmVfYS0+cHRyLCAiaW5wdXQzIiwgbWF5YmVfYS0+bGVuKSA9PSAwAG1lbWNtcChhLT5wdHIsICJ0eXBlZGVmMSIsIGEtPmxlbikgPT0gMABtZW1jbXAoYi0+dmFsLmVyci5wdHIsICJiYXIiLCBiLT52YWwuZXJyLmxlbikgPT0gMABtZW1jbXAoYy5wdHIsICJ0eXBlZGVmMyIsIGMubGVuKSA9PSAwAG1lbWNtcChiLnB0ciwgIm91dHB1dDMiLCBiLmxlbikgPT0gMABtZW1jbXAoYS0+YS5wdHIsICJsaXN0X2luX3JlY29yZDMgaW5wdXQiLCBhLT5hLmxlbikgPT0gMABtZW1jbXAoYS0+YS5wdHIsICJpbnB1dDQiLCBhLT5hLmxlbikgPT0gMABtZW1jbXAoYS0+YS5wdHIsICJsaXN0X2luX3JlY29yZDEiLCBhLT5hLmxlbikgPT0gMABtZW1jbXAoYi5hLnB0ciwgImxpc3RfaW5fcmVjb3JkMyBvdXRwdXQiLCBiLmEubGVuKSA9PSAwAG1lbWNtcChiLmEucHRyLCAicmVzdWx0NCIsIGIuYS5sZW4pID09IDAAbWVtY21wKGIuYS5wdHIsICJsaXN0X2luX3JlY29yZDIiLCBiLmEubGVuKSA9PSAwAG1lbWNtcChhLnB0ciwgImxpc3RfaW5fdmFyaWFudDIiLCBhLmxlbikgPT0gMABtZW1jbXAoYy0+cHRyWzBdLnB0ciwgInR5cGVkZWYyIiwgYy0+cHRyWzBdLmxlbikgPT0gMABtZW1jbXAoZC5wdHJbMF0ucHRyLCAidHlwZWRlZjQiLCBkLnB0clswXS5sZW4pID09IDAALgAhdGVzdF9mbGF2b3JmdWxfdGVzdF9lcnJub19yZXN1bHQoJmVycm5vKQAobnVsbCkAdGVzdF9mbGF2b3JmdWxfdGVzdF9mX2xpc3RfaW5fdmFyaWFudDMoJmEudmFsLCAmYikAdGVzdF9mbGF2b3JmdWxfdGVzdF9mX2xpc3RfaW5fdmFyaWFudDIoJmEpAFN1cHBvcnQgZm9yIGZvcm1hdHRpbmcgbG9uZyBkb3VibGUgdmFsdWVzIGlzIGN1cnJlbnRseSBkaXNhYmxlZC4KVG8gZW5hYmxlIGl0LCBhZGQgLWxjLXByaW50c2Nhbi1sb25nLWRvdWJsZSB0byB0aGUgbGluayBjb21tYW5kLgoAQXNzZXJ0aW9uIGZhaWxlZDogJXMgKCVzOiAlczogJWQpCgABAFN1Y2Nlc3MASWxsZWdhbCBieXRlIHNlcXVlbmNlAERvbWFpbiBlcnJvcgBSZXN1bHQgbm90IHJlcHJlc2VudGFibGUATm90IGEgdHR5AFBlcm1pc3Npb24gZGVuaWVkAE9wZXJhdGlvbiBub3QgcGVybWl0dGVkAE5vIHN1Y2ggZmlsZSBvciBkaXJlY3RvcnkATm8gc3VjaCBwcm9jZXNzAEZpbGUgZXhpc3RzAFZhbHVlIHRvbyBsYXJnZSBmb3IgZGF0YSB0eXBlAE5vIHNwYWNlIGxlZnQgb24gZGV2aWNlAE91dCBvZiBtZW1vcnkAUmVzb3VyY2UgYnVzeQBJbnRlcnJ1cHRlZCBzeXN0ZW0gY2FsbABSZXNvdXJjZSB0ZW1wb3JhcmlseSB1bmF2YWlsYWJsZQBJbnZhbGlkIHNlZWsAQ3Jvc3MtZGV2aWNlIGxpbmsAUmVhZC1vbmx5IGZpbGUgc3lzdGVtAERpcmVjdG9yeSBub3QgZW1wdHkAQ29ubmVjdGlvbiByZXNldCBieSBwZWVyAE9wZXJhdGlvbiB0aW1lZCBvdXQAQ29ubmVjdGlvbiByZWZ1c2VkAEhvc3QgaXMgdW5yZWFjaGFibGUAQWRkcmVzcyBpbiB1c2UAQnJva2VuIHBpcGUASS9PIGVycm9yAE5vIHN1Y2ggZGV2aWNlIG9yIGFkZHJlc3MATm8gc3VjaCBkZXZpY2UATm90IGEgZGlyZWN0b3J5AElzIGEgZGlyZWN0b3J5AFRleHQgZmlsZSBidXN5AEV4ZWMgZm9ybWF0IGVycm9yAEludmFsaWQgYXJndW1lbnQAQXJndW1lbnQgbGlzdCB0b28gbG9uZwBTeW1ib2xpYyBsaW5rIGxvb3AARmlsZW5hbWUgdG9vIGxvbmcAVG9vIG1hbnkgb3BlbiBmaWxlcyBpbiBzeXN0ZW0ATm8gZmlsZSBkZXNjcmlwdG9ycyBhdmFpbGFibGUAQmFkIGZpbGUgZGVzY3JpcHRvcgBObyBjaGlsZCBwcm9jZXNzAEJhZCBhZGRyZXNzAEZpbGUgdG9vIGxhcmdlAFRvbyBtYW55IGxpbmtzAE5vIGxvY2tzIGF2YWlsYWJsZQBSZXNvdXJjZSBkZWFkbG9jayB3b3VsZCBvY2N1cgBTdGF0ZSBub3QgcmVjb3ZlcmFibGUAUHJldmlvdXMgb3duZXIgZGllZABPcGVyYXRpb24gY2FuY2VsZWQARnVuY3Rpb24gbm90IGltcGxlbWVudGVkAE5vIG1lc3NhZ2Ugb2YgZGVzaXJlZCB0eXBlAElkZW50aWZpZXIgcmVtb3ZlZABMaW5rIGhhcyBiZWVuIHNldmVyZWQAUHJvdG9jb2wgZXJyb3IAQmFkIG1lc3NhZ2UATm90IGEgc29ja2V0AERlc3RpbmF0aW9uIGFkZHJlc3MgcmVxdWlyZWQATWVzc2FnZSB0b28gbGFyZ2UAUHJvdG9jb2wgd3JvbmcgdHlwZSBmb3Igc29ja2V0AFByb3RvY29sIG5vdCBhdmFpbGFibGUAUHJvdG9jb2wgbm90IHN1cHBvcnRlZABOb3Qgc3VwcG9ydGVkAEFkZHJlc3MgZmFtaWx5IG5vdCBzdXBwb3J0ZWQgYnkgcHJvdG9jb2wAQWRkcmVzcyBub3QgYXZhaWxhYmxlAE5ldHdvcmsgaXMgZG93bgBOZXR3b3JrIHVucmVhY2hhYmxlAENvbm5lY3Rpb24gcmVzZXQgYnkgbmV0d29yawBDb25uZWN0aW9uIGFib3J0ZWQATm8gYnVmZmVyIHNwYWNlIGF2YWlsYWJsZQBTb2NrZXQgaXMgY29ubmVjdGVkAFNvY2tldCBub3QgY29ubmVjdGVkAE9wZXJhdGlvbiBhbHJlYWR5IGluIHByb2dyZXNzAE9wZXJhdGlvbiBpbiBwcm9ncmVzcwBTdGFsZSBmaWxlIGhhbmRsZQBRdW90YSBleGNlZWRlZABNdWx0aWhvcCBhdHRlbXB0ZWQAQ2FwYWJpbGl0aWVzIGluc3VmZmljaWVudAAAAHUCTgDWAeIEuQQYAY4F7QIWBPIAlwMBAzgFrwGCAU8DLwQeANQFogASAx4DwgHeAwgArAUAAWQC8QFlBTQCjALPAi0DTATjBZ8C+AQcBQgFsQJLBRUCeABSAjwD8QPkAMMDfQTMAKoDeQUkAm4BbQMiBKsERAD7Aa4AgwNgAOUBBwSUBF4EKwBYATkBkgDCBZsBQwJGAfYFAAAAAAAAGQAKABkZGQAAAAAFAAAAAAAACQAAAAALAAAAAAAAAAAZABEKGRkZAwoHAAEbCQsYAAAJBgsAAAsABhkAAAAZGRk=");
base64DecodeToExistingUint8Array(bufferView, 4705, "DgAAAAAAAAAAGQAKDRkZGQANAAACAAkOAAAACQAOAAAO");
base64DecodeToExistingUint8Array(bufferView, 4763, "DA==");
base64DecodeToExistingUint8Array(bufferView, 4775, "EwAAAAATAAAAAAkMAAAAAAAMAAAM");
base64DecodeToExistingUint8Array(bufferView, 4821, "EA==");
base64DecodeToExistingUint8Array(bufferView, 4833, "DwAAAAQPAAAAAAkQAAAAAAAQAAAQ");
base64DecodeToExistingUint8Array(bufferView, 4879, "Eg==");
base64DecodeToExistingUint8Array(bufferView, 4891, "EQAAAAARAAAAAAkSAAAAAAASAAASAAAaAAAAGhoa");
base64DecodeToExistingUint8Array(bufferView, 4946, "GgAAABoaGgAAAAAAAAk=");
base64DecodeToExistingUint8Array(bufferView, 4995, "FA==");
base64DecodeToExistingUint8Array(bufferView, 5007, "FwAAAAAXAAAAAAkUAAAAAAAUAAAU");
base64DecodeToExistingUint8Array(bufferView, 5053, "Fg==");
base64DecodeToExistingUint8Array(bufferView, 5065, "FQAAAAAVAAAAAAkWAAAAAAAWAAAWAAAwMTIzNDU2Nzg5QUJDREVG");
base64DecodeToExistingUint8Array(bufferView, 5104, "BQ==");
base64DecodeToExistingUint8Array(bufferView, 5116, "AQ==");
base64DecodeToExistingUint8Array(bufferView, 5136, "AgAAAAMAAAB4Fg==");
base64DecodeToExistingUint8Array(bufferView, 5160, "AgAAAAAAAAD/////");
}
var scratchBuffer = new ArrayBuffer(16);
var i32ScratchView = new Int32Array(scratchBuffer);
var f32ScratchView = new Float32Array(scratchBuffer);
var f64ScratchView = new Float64Array(scratchBuffer);
function wasm2js_scratch_load_i32(index) {
return i32ScratchView[index];
}
function wasm2js_scratch_store_i32(index, value) {
i32ScratchView[index] = value;
}
function wasm2js_scratch_load_f64() {
return f64ScratchView[0];
}
function wasm2js_scratch_store_f64(value) {
f64ScratchView[0] = value;
}
function wasm2js_trap() { throw new Error('abort'); }
function wasm2js_memory_copy(dest, source, size) {
// TODO: traps on invalid things
bufferView.copyWithin(dest, source, source + size);
}
function wasm2js_memory_fill(dest, value, size) {
dest = dest >>> 0;
size = size >>> 0;
if (dest + size > bufferView.length) throw "trap: invalid memory.fill";
bufferView.fill(value, dest, dest + size);
}
var buffer = new ArrayBuffer(131072);
var HEAP8 = new Int8Array(buffer);
var HEAP16 = new Int16Array(buffer);
var HEAP32 = new Int32Array(buffer);
var HEAPU8 = new Uint8Array(buffer);
var HEAPU16 = new Uint16Array(buffer);
var HEAPU32 = new Uint32Array(buffer);
var HEAPF32 = new Float32Array(buffer);
var HEAPF64 = new Float64Array(buffer);
var Math_imul = Math.imul;
var Math_fround = Math.fround;
var Math_abs = Math.abs;
var Math_clz32 = Math.clz32;
var Math_min = Math.min;
var Math_max = Math.max;
var Math_floor = Math.floor;
var Math_ceil = Math.ceil;
var Math_trunc = Math.trunc;
var Math_sqrt = Math.sqrt;
var test_flavorful_test = imports["test:flavorful/test"];
var __wasm_import_test_flavorful_test_f_list_in_record1 = test_flavorful_test["f-list-in-record1"];
var __wasm_import_test_flavorful_test_f_list_in_record2 = test_flavorful_test["f-list-in-record2"];
var __wasm_import_test_flavorful_test_f_list_in_record3 = test_flavorful_test["f-list-in-record3"];
var __wasm_import_test_flavorful_test_f_list_in_record4 = test_flavorful_test["f-list-in-record4"];
var __wasm_import_test_flavorful_test_f_list_in_variant1 = test_flavorful_test["f-list-in-variant1"];
var __wasm_import_test_flavorful_test_f_list_in_variant2 = test_flavorful_test["f-list-in-variant2"];
var __wasm_import_test_flavorful_test_f_list_in_variant3 = test_flavorful_test["f-list-in-variant3"];
var __wasm_import_test_flavorful_test_errno_result = test_flavorful_test["errno-result"];
var __wasm_import_test_flavorful_test_list_typedefs = test_flavorful_test["list-typedefs"];
var __wasm_import_test_flavorful_test_list_of_variants = test_flavorful_test["list-of-variants"];
var wasi_snapshot_preview1 = imports.wasi_snapshot_preview1;
var __imported_wasi_snapshot_preview1_fd_close = wasi_snapshot_preview1.fd_close;
var __imported_wasi_snapshot_preview1_fd_write = wasi_snapshot_preview1.fd_write;
var legalimport$__imported_wasi_snapshot_preview1_fd_seek = wasi_snapshot_preview1.fd_seek;
var __stack_pointer = 71328;
var i64toi32_i32$HIGH_BITS = 0;
function _initialize() {
if (HEAP32[1304]) {
wasm2js_trap()
}
HEAP32[1304] = 1;
}
function __wasm_export_exports_test_flavorful_test_f_list_in_record2_post_return($0) {
$0 = $0 | 0;
var $1 = 0;
$1 = __stack_pointer - 16 | 0;
__stack_pointer = $1;
HEAP32[$1 + 12 >> 2] = $0;
if (HEAP32[HEAP32[$1 + 12 >> 2] + 4 >> 2] > 0) {
dlfree(HEAP32[HEAP32[$1 + 12 >> 2] >> 2])
}
__stack_pointer = $1 + 16 | 0;
}
function __wasm_export_exports_test_flavorful_test_f_list_in_variant2_post_return($0) {
$0 = $0 | 0;
var $1 = 0;
$1 = __stack_pointer - 16 | 0;
__stack_pointer = $1;
HEAP32[$1 + 12 >> 2] = $0;
if (HEAPU8[HEAP32[$1 + 12 >> 2]] == 1 & HEAP32[HEAP32[$1 + 12 >> 2] + 8 >> 2] > 0) {
dlfree(HEAP32[HEAP32[$1 + 12 >> 2] + 4 >> 2])
}
__stack_pointer = $1 + 16 | 0;
}
function __wasm_export_exports_test_flavorful_test_list_typedefs_post_return($0) {
$0 = $0 | 0;
var $1 = 0;
$1 = __stack_pointer - 48 | 0;
__stack_pointer = $1;
HEAP32[$1 + 44 >> 2] = $0;
HEAP32[$1 + 40 >> 2] = HEAP32[HEAP32[$1 + 44 >> 2] >> 2];
HEAP32[$1 + 36 >> 2] = HEAP32[HEAP32[$1 + 44 >> 2] + 4 >> 2];
HEAP32[$1 + 32 >> 2] = 0;
while (1) {
if (HEAP32[$1 + 32 >> 2] < HEAP32[$1 + 36 >> 2]) {
HEAP32[$1 + 28 >> 2] = HEAP32[$1 + 40 >> 2] + HEAP32[$1 + 32 >> 2];
HEAP32[$1 + 32 >> 2] = HEAP32[$1 + 32 >> 2] + 1;
continue;
}
break;
};
if (HEAP32[$1 + 36 >> 2] > 0) {
dlfree(HEAP32[$1 + 40 >> 2])
}
HEAP32[$1 + 24 >> 2] = HEAP32[HEAP32[$1 + 44 >> 2] + 8 >> 2];
HEAP32[$1 + 20 >> 2] = HEAP32[HEAP32[$1 + 44 >> 2] + 12 >> 2];
HEAP32[$1 + 16 >> 2] = 0;
while (1) {
if (HEAP32[$1 + 16 >> 2] < HEAP32[$1 + 20 >> 2]) {
HEAP32[$1 + 12 >> 2] = HEAP32[$1 + 24 >> 2] + (HEAP32[$1 + 16 >> 2] << 3);
if (HEAP32[HEAP32[$1 + 12 >> 2] + 4 >> 2] > 0) {
dlfree(HEAP32[HEAP32[$1 + 12 >> 2] >> 2])
}
HEAP32[$1 + 16 >> 2] = HEAP32[$1 + 16 >> 2] + 1;
continue;
}
break;
};
if (HEAP32[$1 + 20 >> 2] > 0) {
dlfree(HEAP32[$1 + 24 >> 2])
}
__stack_pointer = $1 + 48 | 0;
}
function __wasm_export_exports_test_flavorful_test_list_of_variants_post_return($0) {
$0 = $0 | 0;
var $1 = 0;
$1 = __stack_pointer + -64 | 0;
__stack_pointer = $1;
HEAP32[$1 + 60 >> 2] = $0;
HEAP32[$1 + 56 >> 2] = HEAP32[HEAP32[$1 + 60 >> 2] >> 2];
HEAP32[$1 + 52 >> 2] = HEAP32[HEAP32[$1 + 60 >> 2] + 4 >> 2];
HEAP32[$1 + 48 >> 2] = 0;
while (1) {
if (HEAP32[$1 + 48 >> 2] < HEAP32[$1 + 52 >> 2]) {
HEAP32[$1 + 44 >> 2] = HEAP32[$1 + 56 >> 2] + HEAP32[$1 + 48 >> 2];
HEAP32[$1 + 48 >> 2] = HEAP32[$1 + 48 >> 2] + 1;
continue;
}
break;
};
if (HEAP32[$1 + 52 >> 2] > 0) {
dlfree(HEAP32[$1 + 56 >> 2])
}
HEAP32[$1 + 40 >> 2] = HEAP32[HEAP32[$1 + 60 >> 2] + 8 >> 2];
HEAP32[$1 + 36 >> 2] = HEAP32[HEAP32[$1 + 60 >> 2] + 12 >> 2];
HEAP32[$1 + 32 >> 2] = 0;
while (1) {
if (HEAP32[$1 + 32 >> 2] < HEAP32[$1 + 36 >> 2]) {
HEAP32[$1 + 28 >> 2] = HEAP32[$1 + 40 >> 2] + HEAP32[$1 + 32 >> 2];
HEAP32[$1 + 32 >> 2] = HEAP32[$1 + 32 >> 2] + 1;
continue;
}
break;
};
if (HEAP32[$1 + 36 >> 2] > 0) {
dlfree(HEAP32[$1 + 40 >> 2])
}
HEAP32[$1 + 24 >> 2] = HEAP32[HEAP32[$1 + 60 >> 2] + 16 >> 2];
HEAP32[$1 + 20 >> 2] = HEAP32[HEAP32[$1 + 60 >> 2] + 20 >> 2];
HEAP32[$1 + 16 >> 2] = 0;
while (1) {
if (HEAP32[$1 + 16 >> 2] < HEAP32[$1 + 20 >> 2]) {
HEAP32[$1 + 12 >> 2] = HEAP32[$1 + 24 >> 2] + HEAP32[$1 + 16 >> 2];
HEAP32[$1 + 16 >> 2] = HEAP32[$1 + 16 >> 2] + 1;
continue;
}
break;
};
if (HEAP32[$1 + 20 >> 2] > 0) {
dlfree(HEAP32[$1 + 24 >> 2])
}
__stack_pointer = $1 - -64 | 0;
}
function cabi_realloc($0, $1, $2, $3) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
$3 = $3 | 0;
var $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0;
$6 = __stack_pointer - 32 | 0;
__stack_pointer = $6;
HEAP32[$6 + 24 >> 2] = $0;
HEAP32[$6 + 20 >> 2] = $1;
HEAP32[$6 + 16 >> 2] = $2;
HEAP32[$6 + 12 >> 2] = $3;
label$1 : {
if (!HEAP32[$6 + 12 >> 2]) {
HEAP32[$6 + 28 >> 2] = HEAP32[$6 + 16 >> 2];
break label$1;
}
$2 = HEAP32[$6 + 12 >> 2];
$3 = 0;
$1 = HEAP32[$6 + 24 >> 2];
__inlined_func$realloc$22 : {
if (!$1) {
$3 = dlmalloc($2);
break __inlined_func$realloc$22;
}
if ($2 >>> 0 >= 4294967232) {
HEAP32[1435] = 48;
$3 = 0;
break __inlined_func$realloc$22;
}
$4 = $2 >>> 0 < 11 ? 16 : $2 + 19 & -16;
$8 = $1 - 4 | 0;
$9 = HEAP32[$8 >> 2];
$0 = $9 & -8;
label$3 : {
label$4 : {
if (!($9 & 3)) {
if ($4 >>> 0 < 256 | $0 >>> 0 < ($4 | 4) >>> 0) {
break label$4
}
if ($0 - $4 >>> 0 <= HEAP32[1431] << 1 >>> 0) {
break label$3
}
break label$4;
}
$7 = $1 - 8 | 0;
$5 = $0 + $7 | 0;
if ($0 >>> 0 >= $4 >>> 0) {
$0 = $0 - $4 | 0;
if ($0 >>> 0 < 16) {
break label$3
}
HEAP32[$8 >> 2] = $4 | $9 & 1 | 2;
$2 = $4 + $7 | 0;
HEAP32[$2 + 4 >> 2] = $0 | 3;
HEAP32[$5 + 4 >> 2] = HEAP32[$5 + 4 >> 2] | 1;
dispose_chunk($2, $0);
$3 = $1;
break __inlined_func$realloc$22;
}
if (($5 | 0) == HEAP32[1317]) {
$0 = $0 + HEAP32[1314] | 0;
if ($0 >>> 0 <= $4 >>> 0) {
break label$4
}
HEAP32[$8 >> 2] = $4 | $9 & 1 | 2;
$2 = $4 + $7 | 0;
HEAP32[1317] = $2;
$0 = $0 - $4 | 0;
HEAP32[1314] = $0;
HEAP32[$2 + 4 >> 2] = $0 | 1;
$3 = $1;
break __inlined_func$realloc$22;
}
if (($5 | 0) == HEAP32[1316]) {
$0 = $0 + HEAP32[1313] | 0;
if ($0 >>> 0 < $4 >>> 0) {
break label$4
}
$2 = $0 - $4 | 0;
label$9 : {
if ($2 >>> 0 >= 16) {
HEAP32[$8 >> 2] = $4 | $9 & 1 | 2;
$3 = $4 + $7 | 0;
HEAP32[$3 + 4 >> 2] = $2 | 1;
$0 = $0 + $7 | 0;
HEAP32[$0 >> 2] = $2;
HEAP32[$0 + 4 >> 2] = HEAP32[$0 + 4 >> 2] & -2;
break label$9;
}
HEAP32[$8 >> 2] = $0 | $9 & 1 | 2;
$0 = $0 + $7 | 0;
HEAP32[$0 + 4 >> 2] = HEAP32[$0 + 4 >> 2] | 1;
$2 = 0;
}
HEAP32[1316] = $3;
HEAP32[1313] = $2;
$3 = $1;
break __inlined_func$realloc$22;
}
$3 = HEAP32[$5 + 4 >> 2];
if ($3 & 2) {
break label$4
}
$10 = $0 + ($3 & -8) | 0;
if ($4 >>> 0 > $10 >>> 0) {
break label$4
}
$12 = $10 - $4 | 0;
label$11 : {
if ($3 >>> 0 <= 255) {
$0 = HEAP32[$5 + 8 >> 2];
$2 = HEAP32[$5 + 12 >> 2];
if (($0 | 0) == ($2 | 0)) {
(wasm2js_i32$0 = 5244, wasm2js_i32$1 = HEAP32[1311] & __wasm_rotl_i32($3 >>> 3 | 0)), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$11;
}
HEAP32[$2 + 8 >> 2] = $0;
HEAP32[$0 + 12 >> 2] = $2;
break label$11;
}
$11 = HEAP32[$5 + 24 >> 2];
$0 = HEAP32[$5 + 12 >> 2];
label$14 : {
if (($5 | 0) != ($0 | 0)) {
$2 = HEAP32[$5 + 8 >> 2];
HEAP32[$0 + 8 >> 2] = $2;
HEAP32[$2 + 12 >> 2] = $0;
break label$14;
}
label$16 : {
$2 = $5 + 20 | 0;
$3 = HEAP32[$2 >> 2];
if ($3) {
break label$16
}
$2 = $5 + 16 | 0;
$3 = HEAP32[$2 >> 2];
if ($3) {
break label$16
}
$0 = 0;
break label$14;
}
while (1) {
$13 = $2;
$0 = $3;
$2 = $0 + 20 | 0;
$3 = HEAP32[$2 >> 2];
if ($3) {
continue
}
$2 = $0 + 16 | 0;
$3 = HEAP32[$0 + 16 >> 2];
if ($3) {
continue
}
break;
};
HEAP32[$13 >> 2] = 0;
}
if (!$11) {
break label$11
}
$2 = HEAP32[$5 + 28 >> 2];
$3 = ($2 << 2) + 5548 | 0;
label$18 : {
if (($5 | 0) == HEAP32[$3 >> 2]) {
HEAP32[$3 >> 2] = $0;
if ($0) {
break label$18
}
(wasm2js_i32$0 = 5248, wasm2js_i32$1 = HEAP32[1312] & __wasm_rotl_i32($2)), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$11;
}
HEAP32[(HEAP32[$11 + 16 >> 2] == ($5 | 0) ? 16 : 20) + $11 >> 2] = $0;
if (!$0) {
break label$11
}
}
HEAP32[$0 + 24 >> 2] = $11;
$2 = HEAP32[$5 + 16 >> 2];
if ($2) {
HEAP32[$0 + 16 >> 2] = $2;
HEAP32[$2 + 24 >> 2] = $0;
}
$2 = HEAP32[$5 + 20 >> 2];
if (!$2) {
break label$11
}
HEAP32[$0 + 20 >> 2] = $2;
HEAP32[$2 + 24 >> 2] = $0;
}
if ($12 >>> 0 <= 15) {
HEAP32[$8 >> 2] = $9 & 1 | $10 | 2;
$0 = $7 + $10 | 0;
HEAP32[$0 + 4 >> 2] = HEAP32[$0 + 4 >> 2] | 1;
$3 = $1;
break __inlined_func$realloc$22;
}
HEAP32[$8 >> 2] = $4 | $9 & 1 | 2;
$0 = $4 + $7 | 0;
HEAP32[$0 + 4 >> 2] = $12 | 3;
$2 = $7 + $10 | 0;
HEAP32[$2 + 4 >> 2] = HEAP32[$2 + 4 >> 2] | 1;
dispose_chunk($0, $12);
$3 = $1;
break __inlined_func$realloc$22;
}
$0 = dlmalloc($2);
$3 = 0;
if (!$0) {
break __inlined_func$realloc$22
}
$3 = $0;
$0 = HEAP32[$8 >> 2];
$0 = ($0 & 3 ? -4 : -8) + ($0 & -8) | 0;
$0 = memcpy($3, $1, $0 >>> 0 < $2 >>> 0 ? $0 : $2);
dlfree($1);
$1 = $0;
}
$3 = $1;
}
HEAP32[$6 + 8 >> 2] = $3;
if (!HEAP32[$6 + 8 >> 2]) {
wasm2js_trap()
}
HEAP32[$6 + 28 >> 2] = HEAP32[$6 + 8 >> 2];
}
__stack_pointer = $6 + 32 | 0;
return HEAP32[$6 + 28 >> 2];
}
function test_flavorful_test_list_in_record1_free($0) {
var $1 = 0;
$1 = __stack_pointer - 16 | 0;
__stack_pointer = $1;
HEAP32[$1 + 12 >> 2] = $0;
flavorful_string_free(HEAP32[$1 + 12 >> 2]);
__stack_pointer = $1 + 16 | 0;
}
function flavorful_string_free($0) {
var $1 = 0;
$1 = __stack_pointer - 16 | 0;
__stack_pointer = $1;
HEAP32[$1 + 12 >> 2] = $0;
if (HEAP32[HEAP32[$1 + 12 >> 2] + 4 >> 2]) {
dlfree(HEAP32[HEAP32[$1 + 12 >> 2] >> 2])
}
HEAP32[HEAP32[$1 + 12 >> 2] >> 2] = 0;
HEAP32[HEAP32[$1 + 12 >> 2] + 4 >> 2] = 0;
__stack_pointer = $1 + 16 | 0;
}
function test_flavorful_test_list_typedef2_free($0) {
var $1 = 0;
$1 = __stack_pointer - 16 | 0;
__stack_pointer = $1;
HEAP32[$1 + 12 >> 2] = $0;
if (HEAP32[HEAP32[$1 + 12 >> 2] + 4 >> 2]) {
dlfree(HEAP32[HEAP32[$1 + 12 >> 2] >> 2])
}
__stack_pointer = $1 + 16 | 0;
}
function test_flavorful_test_list_typedef3_free($0) {
var $1 = 0;
$1 = __stack_pointer - 16 | 0;
__stack_pointer = $1;
HEAP32[$1 + 12 >> 2] = $0;
HEAP32[$1 + 8 >> 2] = 0;
while (1) {
if (HEAPU32[$1 + 8 >> 2] < HEAPU32[HEAP32[$1 + 12 >> 2] + 4 >> 2]) {
flavorful_string_free(HEAP32[HEAP32[$1 + 12 >> 2] >> 2] + (HEAP32[$1 + 8 >> 2] << 3) | 0);
HEAP32[$1 + 8 >> 2] = HEAP32[$1 + 8 >> 2] + 1;
continue;
}
break;
};
if (HEAP32[HEAP32[$1 + 12 >> 2] + 4 >> 2]) {
dlfree(HEAP32[HEAP32[$1 + 12 >> 2] >> 2])
}
__stack_pointer = $1 + 16 | 0;
}
function flavorful_string_set($0, $1) {
var $2 = 0;
$2 = __stack_pointer - 16 | 0;
__stack_pointer = $2;
HEAP32[$2 + 12 >> 2] = $0;
HEAP32[$2 + 8 >> 2] = $1;
HEAP32[HEAP32[$2 + 12 >> 2] >> 2] = HEAP32[$2 + 8 >> 2];
$0 = strlen(HEAP32[$2 + 8 >> 2]);
HEAP32[HEAP32[$2 + 12 >> 2] + 4 >> 2] = $0;
__stack_pointer = $2 + 16 | 0;
}
function flavorful_string_dup($0, $1) {
var $2 = 0;
$2 = __stack_pointer - 16 | 0;
__stack_pointer = $2;
HEAP32[$2 + 12 >> 2] = $0;
HEAP32[$2 + 8 >> 2] = $1;
$0 = strlen(HEAP32[$2 + 8 >> 2]);
HEAP32[HEAP32[$2 + 12 >> 2] + 4 >> 2] = $0;
$0 = cabi_realloc(0, 0, 1, HEAP32[HEAP32[$2 + 12 >> 2] + 4 >> 2]);
HEAP32[HEAP32[$2 + 12 >> 2] >> 2] = $0;
memcpy(HEAP32[HEAP32[$2 + 12 >> 2] >> 2], HEAP32[$2 + 8 >> 2], HEAP32[HEAP32[$2 + 12 >> 2] + 4 >> 2]);
__stack_pointer = $2 + 16 | 0;
}
function test_flavorful_test_errno_result($0) {
var $1 = 0;
$1 = __stack_pointer - 32 | 0;
__stack_pointer = $1;
HEAP32[$1 + 24 >> 2] = $0;
HEAP32[$1 + 16 >> 2] = $1 + 22;
__wasm_import_test_flavorful_test_errno_result(HEAP32[$1 + 16 >> 2]);
label$1 : {
label$2 : {
switch (HEAPU8[HEAP32[$1 + 16 >> 2]]) {
case 0:
HEAP8[$1 + 8 | 0] = 0;
break label$1;
case 1:
break label$2;
default:
break label$1;
};
}
HEAP8[$1 + 8 | 0] = 1;
HEAP8[$1 + 9 | 0] = HEAPU8[HEAP32[$1 + 16 >> 2] + 1 | 0];
}
label$4 : {
if (!(HEAP8[$1 + 8 | 0] & 1)) {
HEAP8[$1 + 31 | 0] = 1;
break label$4;
}
HEAP8[HEAP32[$1 + 24 >> 2]] = HEAPU8[$1 + 9 | 0];
HEAP8[$1 + 31 | 0] = 0;
}
__stack_pointer = $1 + 32 | 0;
return HEAP8[$1 + 31 | 0] & 1;
}
function __wasm_export_flavorful_test_imports() {
var $0 = 0, $1 = 0, $2 = 0, $3 = 0, $4 = 0;
$1 = __stack_pointer - 240 | 0;
__stack_pointer = $1;
$2 = $1 + 232 | 0;
flavorful_string_set($2, 1849);
$0 = __stack_pointer - 16 | 0;
__stack_pointer = $0;
HEAP32[$0 + 12 >> 2] = $2;
__wasm_import_test_flavorful_test_f_list_in_record1(HEAP32[HEAP32[$0 + 12 >> 2] >> 2], HEAP32[HEAP32[$0 + 12 >> 2] + 4 >> 2]);
__stack_pointer = $0 + 16 | 0;
$0 = __stack_pointer - 32 | 0;
__stack_pointer = $0;
HEAP32[$0 + 28 >> 2] = $1 + 224;
HEAP32[$0 + 16 >> 2] = $0 + 20;
__wasm_import_test_flavorful_test_f_list_in_record2(HEAP32[$0 + 16 >> 2]);
$2 = HEAP32[$0 + 28 >> 2];
HEAP32[$0 + 8 >> 2] = HEAP32[HEAP32[$0 + 16 >> 2] >> 2];
HEAP32[$0 + 12 >> 2] = HEAP32[HEAP32[$0 + 16 >> 2] + 4 >> 2];
$3 = HEAP32[$0 + 12 >> 2];
HEAP32[$2 >> 2] = HEAP32[$0 + 8 >> 2];
HEAP32[$2 + 4 >> 2] = $3;
__stack_pointer = $0 + 32 | 0;
if (memcmp(HEAP32[$1 + 224 >> 2], 1714, HEAP32[$1 + 228 >> 2])) {
__assert_fail(2398, 14, 1098);
wasm2js_trap();
}
test_flavorful_test_list_in_record1_free($1 + 224 | 0);
$2 = $1 + 216 | 0;
flavorful_string_set($2, 1076);
$0 = __stack_pointer - 32 | 0;
__stack_pointer = $0;
HEAP32[$0 + 28 >> 2] = $2;
HEAP32[$0 + 24 >> 2] = $1 + 208;
HEAP32[$0 + 12 >> 2] = $0 + 16;
__wasm_import_test_flavorful_test_f_list_in_record3(HEAP32[HEAP32[$0 + 28 >> 2] >> 2], HEAP32[HEAP32[$0 + 28 >> 2] + 4 >> 2], HEAP32[$0 + 12 >> 2]);
$2 = HEAP32[$0 + 24 >> 2];
HEAP32[$0 >> 2] = HEAP32[HEAP32[$0 + 12 >> 2] >> 2];
HEAP32[$0 + 4 >> 2] = HEAP32[HEAP32[$0 + 12 >> 2] + 4 >> 2];
$3 = HEAP32[$0 + 4 >> 2];
HEAP32[$2 >> 2] = HEAP32[$0 >> 2];
HEAP32[$2 + 4 >> 2] = $3;
__stack_pointer = $0 + 32 | 0;
if (memcmp(HEAP32[$1 + 208 >> 2], 1053, HEAP32[$1 + 212 >> 2])) {
__assert_fail(2301, 22, 1098);
wasm2js_trap();
}
test_flavorful_test_list_in_record1_free($1 + 208 | 0);
$2 = $1 + 200 | 0;
flavorful_string_set($2, 1501);
$0 = __stack_pointer - 32 | 0;
__stack_pointer = $0;
HEAP32[$0 + 28 >> 2] = $2;
HEAP32[$0 + 24 >> 2] = $1 + 192;
HEAP32[$0 + 12 >> 2] = $0 + 16;
__wasm_import_test_flavorful_test_f_list_in_record4(HEAP32[HEAP32[$0 + 28 >> 2] >> 2], HEAP32[HEAP32[$0 + 28 >> 2] + 4 >> 2], HEAP32[$0 + 12 >> 2]);
$2 = HEAP32[$0 + 24 >> 2];
HEAP32[$0 >> 2] = HEAP32[HEAP32[$0 + 12 >> 2] >> 2];
HEAP32[$0 + 4 >> 2] = HEAP32[HEAP32[$0 + 12 >> 2] + 4 >> 2];
$3 = HEAP32[$0 + 4 >> 2];
HEAP32[$2 >> 2] = HEAP32[$0 >> 2];
HEAP32[$2 + 4 >> 2] = $3;
__stack_pointer = $0 + 32 | 0;
if (memcmp(HEAP32[$1 + 192 >> 2], 1508, HEAP32[$1 + 196 >> 2])) {
__assert_fail(2357, 30, 1098);
wasm2js_trap();
}
test_flavorful_test_list_in_record1_free($1 + 192 | 0);
HEAP8[$1 + 176 | 0] = 1;
$2 = $1 + 180 | 0;
flavorful_string_set($2, 1222);
HEAP8[$1 + 160 | 0] = 1;
$3 = $1 + 160 | 0;
flavorful_string_set($3 + 4 | 0, 1218);
$0 = __stack_pointer + -64 | 0;
__stack_pointer = $0;
HEAP32[$0 + 60 >> 2] = $2;
HEAP32[$0 + 56 >> 2] = $3;
HEAP8[$0 + 40 | 0] = HEAP32[$0 + 60 >> 2] != 0;
if (HEAP32[$0 + 60 >> 2]) {
$2 = HEAP32[$0 + 60 >> 2];
$3 = HEAP32[$2 >> 2];
$2 = HEAP32[$2 + 4 >> 2];
$4 = $0 + 44 | 0;
HEAP32[$4 >> 2] = $3;
HEAP32[$4 + 4 >> 2] = $2;
}
label$2 : {
if (HEAP8[$0 + 40 | 0] & 1) {
HEAP32[$0 + 24 >> 2] = $0 + 44;
HEAP32[$0 + 36 >> 2] = 1;
HEAP32[$0 + 32 >> 2] = HEAP32[HEAP32[$0 + 24 >> 2] >> 2];
HEAP32[$0 + 28 >> 2] = HEAP32[HEAP32[$0 + 24 >> 2] + 4 >> 2];
break label$2;
}
HEAP32[$0 + 36 >> 2] = 0;
HEAP32[$0 + 32 >> 2] = 0;
HEAP32[$0 + 28 >> 2] = 0;
}
label$4 : {
if (HEAP8[HEAP32[$0 + 56 >> 2]] & 1) {
HEAP32[$0 + 8 >> 2] = HEAP32[$0 + 56 >> 2] + 4;
HEAP32[$0 + 20 >> 2] = 1;
HEAP32[$0 + 16 >> 2] = HEAP32[HEAP32[$0 + 8 >> 2] >> 2];
HEAP32[$0 + 12 >> 2] = HEAP32[HEAP32[$0 + 8 >> 2] + 4 >> 2];
break label$4;
}
HEAP32[$0 + 20 >> 2] = 0;
HEAP32[$0 + 16 >> 2] = 0;
HEAP32[$0 + 12 >> 2] = 0;
}
__wasm_import_test_flavorful_test_f_list_in_variant1(HEAP32[$0 + 36 >> 2], HEAP32[$0 + 32 >> 2], HEAP32[$0 + 28 >> 2], HEAP32[$0 + 20 >> 2], HEAP32[$0 + 16 >> 2], HEAP32[$0 + 12 >> 2]);
__stack_pointer = $0 - -64 | 0;
$0 = __stack_pointer - 48 | 0;
__stack_pointer = $0;
HEAP32[$0 + 44 >> 2] = $1 + 152;
HEAP32[$0 + 28 >> 2] = $0 + 32;
__wasm_import_test_flavorful_test_f_list_in_variant2(HEAP32[$0 + 28 >> 2]);
label$1 : {
label$20 : {
switch (HEAPU8[HEAP32[$0 + 28 >> 2]]) {
case 0:
HEAP8[$0 + 16 | 0] = 0;
break label$1;
case 1:
break label$20;
default:
break label$1;
};
}
HEAP8[$0 + 16 | 0] = 1;
HEAP32[$0 + 8 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] + 4 >> 2];
HEAP32[$0 + 12 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] + 8 >> 2];
$2 = HEAP32[$0 + 12 >> 2];
$3 = $0 + 20 | 0;
HEAP32[$3 >> 2] = HEAP32[$0 + 8 >> 2];
HEAP32[$3 + 4 >> 2] = $2;
}
$2 = $0 + 20 | 0;
$3 = HEAP32[$2 >> 2];
$2 = HEAP32[$2 + 4 >> 2];
$4 = HEAP32[$0 + 44 >> 2];
HEAP32[$4 >> 2] = $3;
HEAP32[$4 + 4 >> 2] = $2;
__stack_pointer = $0 + 48 | 0;
if (!(HEAP8[$0 + 16 | 0] & 1)) {
__assert_fail(2701, 46, 1098);
wasm2js_trap();
}
if (memcmp(HEAP32[$1 + 152 >> 2], 1688, HEAP32[$1 + 156 >> 2])) {
__assert_fail(2447, 47, 1098);
wasm2js_trap();
}
flavorful_string_free($1 + 152 | 0);
HEAP8[$1 + 136 | 0] = 1;
$2 = $1 + 140 | 0;
flavorful_string_set($2, 1579);
$0 = __stack_pointer - 80 | 0;
__stack_pointer = $0;
HEAP32[$0 + 76 >> 2] = $2;
HEAP32[$0 + 72 >> 2] = $1 + 128;
HEAP8[$0 + 48 | 0] = HEAP32[$0 + 76 >> 2] != 0;
if (HEAP32[$0 + 76 >> 2]) {
$2 = HEAP32[$0 + 76 >> 2];
$3 = HEAP32[$2 >> 2];
$2 = HEAP32[$2 + 4 >> 2];
$4 = $0 + 52 | 0;
HEAP32[$4 >> 2] = $3;
HEAP32[$4 + 4 >> 2] = $2;
}
label$21 : {
if (HEAP8[$0 + 48 | 0] & 1) {
HEAP32[$0 + 32 >> 2] = $0 + 52;
HEAP32[$0 + 44 >> 2] = 1;
HEAP32[$0 + 40 >> 2] = HEAP32[HEAP32[$0 + 32 >> 2] >> 2];
HEAP32[$0 + 36 >> 2] = HEAP32[HEAP32[$0 + 32 >> 2] + 4 >> 2];
break label$21;
}
HEAP32[$0 + 44 >> 2] = 0;
HEAP32[$0 + 40 >> 2] = 0;
HEAP32[$0 + 36 >> 2] = 0;
}
HEAP32[$0 + 28 >> 2] = $0 + 60;
__wasm_import_test_flavorful_test_f_list_in_variant3(HEAP32[$0 + 44 >> 2], HEAP32[$0 + 40 >> 2], HEAP32[$0 + 36 >> 2], HEAP32[$0 + 28 >> 2]);
label$42 : {
label$5 : {
switch (HEAPU8[HEAP32[$0 + 28 >> 2]]) {
case 0:
HEAP8[$0 + 16 | 0] = 0;
break label$42;
case 1:
break label$5;
default:
break label$42;
};
}
HEAP8[$0 + 16 | 0] = 1;
HEAP32[$0 + 8 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] + 4 >> 2];
HEAP32[$0 + 12 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] + 8 >> 2];
$2 = HEAP32[$0 + 12 >> 2];
$3 = $0 + 20 | 0;
HEAP32[$3 >> 2] = HEAP32[$0 + 8 >> 2];
HEAP32[$3 + 4 >> 2] = $2;
}
$2 = $0 + 20 | 0;
$3 = HEAP32[$2 >> 2];
$2 = HEAP32[$2 + 4 >> 2];
$4 = HEAP32[$0 + 72 >> 2];
HEAP32[$4 >> 2] = $3;
HEAP32[$4 + 4 >> 2] = $2;
__stack_pointer = $0 + 80 | 0;
if (!(HEAP8[$0 + 16 | 0] & 1)) {
__assert_fail(2650, 56, 1098);
wasm2js_trap();
}
if (memcmp(HEAP32[$1 + 128 >> 2], 1571, HEAP32[$1 + 132 >> 2])) {
__assert_fail(2114, 57, 1098);
wasm2js_trap();
}
flavorful_string_free($1 + 128 | 0);
if (test_flavorful_test_errno_result($1 + 127 | 0) & 1) {
__assert_fail(2601, 63, 1098);
wasm2js_trap();
}
if (HEAPU8[$1 + 127 | 0] != 2) {
__assert_fail(1375, 64, 1098);
wasm2js_trap();
}
if (!(test_flavorful_test_errno_result($1 + 126 | 0) & 1)) {
__assert_fail(2602, 69, 1098);
wasm2js_trap();
}
$2 = $1 + 112 | 0;
flavorful_string_set($2, 1810);
$0 = $1 + 104 | 0;
flavorful_string_set($0, 1705);
HEAP32[$1 + 96 >> 2] = $0;
HEAP32[$1 + 100 >> 2] = 1;
$0 = __stack_pointer + -64 | 0;
__stack_pointer = $0;
HEAP32[$0 + 60 >> 2] = $2;
HEAP32[$0 + 56 >> 2] = $1 + 96;
HEAP32[$0 + 52 >> 2] = $1 + 88;
HEAP32[$0 + 48 >> 2] = $1 + 80;
HEAP32[$0 + 28 >> 2] = $0 + 32;
__wasm_import_test_flavorful_test_list_typedefs(HEAP32[HEAP32[$0 + 60 >> 2] >> 2], HEAP32[HEAP32[$0 + 60 >> 2] + 4 >> 2], HEAP32[HEAP32[$0 + 56 >> 2] >> 2], HEAP32[HEAP32[$0 + 56 >> 2] + 4 >> 2], HEAP32[$0 + 28 >> 2]);
$2 = HEAP32[$0 + 52 >> 2];
HEAP32[$0 + 16 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] >> 2];
HEAP32[$0 + 20 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] + 4 >> 2];
$3 = HEAP32[$0 + 20 >> 2];
HEAP32[$2 >> 2] = HEAP32[$0 + 16 >> 2];
HEAP32[$2 + 4 >> 2] = $3;
$2 = HEAP32[$0 + 48 >> 2];
HEAP32[$0 + 8 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] + 8 >> 2];
HEAP32[$0 + 12 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] + 12 >> 2];
$3 = HEAP32[$0 + 12 >> 2];
HEAP32[$2 >> 2] = HEAP32[$0 + 8 >> 2];
HEAP32[$2 + 4 >> 2] = $3;
__stack_pointer = $0 - -64 | 0;
if (memcmp(HEAP32[$1 + 88 >> 2], 1633, HEAP32[$1 + 92 >> 2])) {
__assert_fail(2076, 84, 1098);
wasm2js_trap();
}
if (HEAP32[$1 + 84 >> 2] != 1) {
__assert_fail(1877, 85, 1098);
wasm2js_trap();
}
if (memcmp(HEAP32[HEAP32[$1 + 80 >> 2] >> 2], 1516, HEAP32[HEAP32[$1 + 80 >> 2] + 4 >> 2])) {
__assert_fail(2547, 86, 1098);
wasm2js_trap();
}
test_flavorful_test_list_typedef2_free($1 + 88 | 0);
test_flavorful_test_list_typedef3_free($1 + 80 | 0);
HEAP16[$1 + 70 >> 1] = HEAPU8[2910] | HEAPU8[2911] << 8;
HEAP32[$1 + 72 >> 2] = $1 + 70;
HEAP32[$1 + 76 >> 2] = 2;
HEAP8[$1 + 48 | 0] = 0;
HEAP8[$1 + 49 | 0] = 1;
HEAP32[$1 + 56 >> 2] = $1 + 48;
HEAP32[$1 + 60 >> 2] = 2;
HEAP8[$1 + 38 | 0] = 0;
HEAP8[$1 + 39 | 0] = 1;
HEAP32[$1 + 40 >> 2] = $1 + 38;
HEAP32[$1 + 44 >> 2] = 2;
$0 = __stack_pointer - 80 | 0;
__stack_pointer = $0;
HEAP32[$0 + 76 >> 2] = $1 + 72;
HEAP32[$0 + 72 >> 2] = $1 + 56;
HEAP32[$0 + 68 >> 2] = $1 + 40;
HEAP32[$0 + 64 >> 2] = $1 + 24;
HEAP32[$0 + 60 >> 2] = $1 + 16;
HEAP32[$0 + 56 >> 2] = $1 + 8;
HEAP32[$0 + 28 >> 2] = $0 + 32;
__wasm_import_test_flavorful_test_list_of_variants(HEAP32[HEAP32[$0 + 76 >> 2] >> 2], HEAP32[HEAP32[$0 + 76 >> 2] + 4 >> 2], HEAP32[HEAP32[$0 + 72 >> 2] >> 2], HEAP32[HEAP32[$0 + 72 >> 2] + 4 >> 2], HEAP32[HEAP32[$0 + 68 >> 2] >> 2], HEAP32[HEAP32[$0 + 68 >> 2] + 4 >> 2], HEAP32[$0 + 28 >> 2]);
$2 = HEAP32[$0 + 64 >> 2];
HEAP32[$0 + 16 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] >> 2];
HEAP32[$0 + 20 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] + 4 >> 2];
$3 = HEAP32[$0 + 20 >> 2];
HEAP32[$2 >> 2] = HEAP32[$0 + 16 >> 2];
HEAP32[$2 + 4 >> 2] = $3;
$2 = HEAP32[$0 + 60 >> 2];
HEAP32[$0 + 8 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] + 8 >> 2];
HEAP32[$0 + 12 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] + 12 >> 2];
$3 = HEAP32[$0 + 12 >> 2];
HEAP32[$2 >> 2] = HEAP32[$0 + 8 >> 2];
HEAP32[$2 + 4 >> 2] = $3;
$2 = HEAP32[$0 + 56 >> 2];
HEAP32[$0 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] + 16 >> 2];
HEAP32[$0 + 4 >> 2] = HEAP32[HEAP32[$0 + 28 >> 2] + 20 >> 2];
$3 = HEAP32[$0 + 4 >> 2];
HEAP32[$2 >> 2] = HEAP32[$0 >> 2];
HEAP32[$2 + 4 >> 2] = $3;
__stack_pointer = $0 + 80 | 0;
if (HEAP32[$1 + 28 >> 2] != 2) {
__assert_fail(1752, 117, 1098);
wasm2js_trap();
}
if (HEAP8[HEAP32[$1 + 24 >> 2]] & 1) {
__assert_fail(1300, 118, 1098);
wasm2js_trap();
}
if (!(HEAP8[HEAP32[$1 + 24 >> 2] + 1 | 0] & 1)) {
__assert_fail(1258, 119, 1098);
wasm2js_trap();
}
if (HEAP32[$1 + 20 >> 2] != 2) {
__assert_fail(1741, 121, 1098);
wasm2js_trap();
}
if (!(HEAP8[HEAP32[$1 + 16 >> 2]] & 1)) {
__assert_fail(1234, 122, 1098);
wasm2js_trap();
}
if (HEAP8[HEAP32[$1 + 16 >> 2] + 1 | 0] & 1) {
__assert_fail(1275, 123, 1098);
wasm2js_trap();
}
if (HEAP32[$1 + 12 >> 2] != 2) {
__assert_fail(1730, 125, 1098);
wasm2js_trap();
}
if (HEAPU8[HEAP32[$1 + 8 >> 2]] != 1) {
__assert_fail(1458, 126, 1098);
wasm2js_trap();
}
if (HEAPU8[HEAP32[$1 + 8 >> 2] + 1 | 0] != 2) {
__assert_fail(1415, 127, 1098);
wasm2js_trap();
}
test_flavorful_test_list_typedef2_free($1 + 24 | 0);
test_flavorful_test_list_typedef2_free($1 + 16 | 0);
test_flavorful_test_list_typedef2_free($1 + 8 | 0);
__stack_pointer = $1 + 240 | 0;
}
function __wasm_export_exports_test_flavorful_test_f_list_in_record1($0, $1) {
$0 = $0 | 0;
$1 = $1 | 0;
var $2 = 0;
$2 = __stack_pointer - 16 | 0;
__stack_pointer = $2;
HEAP32[$2 + 12 >> 2] = $0;
HEAP32[$2 + 8 >> 2] = $1;
HEAP32[$2 >> 2] = HEAP32[$2 + 12 >> 2];
HEAP32[$2 + 4 >> 2] = HEAP32[$2 + 8 >> 2];
$0 = __stack_pointer - 16 | 0;
__stack_pointer = $0;
HEAP32[$0 + 12 >> 2] = $2;
if (memcmp(HEAP32[HEAP32[$0 + 12 >> 2] >> 2], 1849, HEAP32[HEAP32[$0 + 12 >> 2] + 4 >> 2])) {
__assert_fail(2250, 136, 1819);
wasm2js_trap();
}
test_flavorful_test_list_in_record1_free(HEAP32[$0 + 12 >> 2]);
__stack_pointer = $0 + 16 | 0;
__stack_pointer = $2 + 16 | 0;
}
function __wasm_export_exports_test_flavorful_test_f_list_in_record2() {
var $0 = 0, $1 = 0;
$0 = __stack_pointer - 16 | 0;
__stack_pointer = $0;
$1 = __stack_pointer - 16 | 0;
__stack_pointer = $1;
HEAP32[$1 + 12 >> 2] = $0 + 8;
flavorful_string_dup(HEAP32[$1 + 12 >> 2], 1714);
__stack_pointer = $1 + 16 | 0;
HEAP32[$0 + 4 >> 2] = 5220;
HEAP32[HEAP32[$0 + 4 >> 2] + 4 >> 2] = HEAP32[$0 + 12 >> 2];
HEAP32[HEAP32[$0 + 4 >> 2] >> 2] = HEAP32[$0 + 8 >> 2];
__stack_pointer = $0 + 16 | 0;
return HEAP32[$0 + 4 >> 2];
}
function __wasm_export_exports_test_flavorful_test_f_list_in_record3($0, $1) {
$0 = $0 | 0;
$1 = $1 | 0;
var $2 = 0;
$2 = __stack_pointer - 32 | 0;
__stack_pointer = $2;
HEAP32[$2 + 28 >> 2] = $0;
HEAP32[$2 + 24 >> 2] = $1;
HEAP32[$2 + 16 >> 2] = HEAP32[$2 + 28 >> 2];
HEAP32[$2 + 20 >> 2] = HEAP32[$2 + 24 >> 2];
$0 = __stack_pointer - 16 | 0;
__stack_pointer = $0;
HEAP32[$0 + 12 >> 2] = $2 + 16;
HEAP32[$0 + 8 >> 2] = $2 + 8;
if (memcmp(HEAP32[HEAP32[$0 + 12 >> 2] >> 2], 1076, HEAP32[HEAP32[$0 + 12 >> 2] + 4 >> 2])) {
__assert_fail(2151, 145, 1642);
wasm2js_trap();
}
test_flavorful_test_list_in_record1_free(HEAP32[$0 + 12 >> 2]);
flavorful_string_dup(HEAP32[$0 + 8 >> 2], 1053);
__stack_pointer = $0 + 16 | 0;
HEAP32[$2 + 4 >> 2] = 5220;
HEAP32[HEAP32[$2 + 4 >> 2] + 4 >> 2] = HEAP32[$2 + 12 >> 2];
HEAP32[HEAP32[$2 + 4 >> 2] >> 2] = HEAP32[$2 + 8 >> 2];
__stack_pointer = $2 + 32 | 0;
return HEAP32[$2 + 4 >> 2];
}
function __wasm_export_exports_test_flavorful_test_f_list_in_record4($0, $1) {
$0 = $0 | 0;
$1 = $1 | 0;
var $2 = 0;
$2 = __stack_pointer - 32 | 0;
__stack_pointer = $2;
HEAP32[$2 + 28 >> 2] = $0;
HEAP32[$2 + 24 >> 2] = $1;
HEAP32[$2 + 16 >> 2] = HEAP32[$2 + 28 >> 2];
HEAP32[$2 + 20 >> 2] = HEAP32[$2 + 24 >> 2];
$0 = __stack_pointer - 16 | 0;
__stack_pointer = $0;
HEAP32[$0 + 12 >> 2] = $2 + 16;
HEAP32[$0 + 8 >> 2] = $2 + 8;
if (memcmp(HEAP32[HEAP32[$0 + 12 >> 2] >> 2], 1501, HEAP32[HEAP32[$0 + 12 >> 2] + 4 >> 2])) {
__assert_fail(2208, 151, 1525);
wasm2js_trap();
}
$1 = __stack_pointer - 16 | 0;
__stack_pointer = $1;
HEAP32[$1 + 12 >> 2] = HEAP32[$0 + 12 >> 2];
test_flavorful_test_list_in_record1_free(HEAP32[$1 + 12 >> 2]);
__stack_pointer = $1 + 16 | 0;
flavorful_string_dup(HEAP32[$0 + 8 >> 2], 1508);
__stack_pointer = $0 + 16 | 0;
HEAP32[$2 + 4 >> 2] = 5220;
HEAP32[HEAP32[$2 + 4 >> 2] + 4 >> 2] = HEAP32[$2 + 12 >> 2];
HEAP32[HEAP32[$2 + 4 >> 2] >> 2] = HEAP32[$2 + 8 >> 2];
__stack_pointer = $2 + 32 | 0;
return HEAP32[$2 + 4 >> 2];
}
function __wasm_export_exports_test_flavorful_test_f_list_in_variant1($0, $1, $2, $3, $4, $5) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
$3 = $3 | 0;
$4 = $4 | 0;
$5 = $5 | 0;
var $6 = 0;
$6 = __stack_pointer - 96 | 0;
__stack_pointer = $6;
HEAP32[$6 + 92 >> 2] = $0;
HEAP32[$6 + 88 >> 2] = $1;
HEAP32[$6 + 84 >> 2] = $2;
HEAP32[$6 + 80 >> 2] = $3;
HEAP32[$6 + 76 >> 2] = $4;
HEAP32[$6 + 72 >> 2] = $5;
label$1 : {
label$2 : {
switch (HEAP32[$6 + 92 >> 2]) {
case 0:
HEAP8[$6 + 56 | 0] = 0;
break label$1;
case 1:
break label$2;
default:
break label$1;
};
}
HEAP8[$6 + 56 | 0] = 1;
HEAP32[$6 + 48 >> 2] = HEAP32[$6 + 88 >> 2];
HEAP32[$6 + 52 >> 2] = HEAP32[$6 + 84 >> 2];
$0 = HEAP32[$6 + 52 >> 2];
$1 = $6 + 60 | 0;
HEAP32[$1 >> 2] = HEAP32[$6 + 48 >> 2];
HEAP32[$1 + 4 >> 2] = $0;
}
label$4 : {
label$5 : {
switch (HEAP32[$6 + 80 >> 2]) {
case 0:
HEAP8[$6 + 32 | 0] = 0;
break label$4;
case 1:
break label$5;
default:
break label$4;
};
}
HEAP8[$6 + 32 | 0] = 1;
HEAP32[$6 + 24 >> 2] = HEAP32[$6 + 76 >> 2];
HEAP32[$6 + 28 >> 2] = HEAP32[$6 + 72 >> 2];
$0 = HEAP32[$6 + 28 >> 2];
$1 = $6 + 36 | 0;
HEAP32[$1 >> 2] = HEAP32[$6 + 24 >> 2];
HEAP32[$1 + 4 >> 2] = $0;
}
HEAP32[$6 + 16 >> 2] = HEAP32[$6 + 40 >> 2];
$0 = HEAP32[$6 + 36 >> 2];
HEAP32[$6 + 8 >> 2] = HEAP32[$6 + 32 >> 2];
HEAP32[$6 + 12 >> 2] = $0;
$0 = __stack_pointer - 16 | 0;
__stack_pointer = $0;
HEAP32[$0 + 12 >> 2] = HEAP8[$6 + 56 | 0] & 1 ? $6 + 60 | 0 : 0;
HEAP32[$0 + 8 >> 2] = $6 + 8;
if (!HEAP32[$0 + 12 >> 2]) {
__assert_fail(1355, 157, 1763);
wasm2js_trap();
}
if (memcmp(HEAP32[HEAP32[$0 + 12 >> 2] >> 2], 1222, HEAP32[HEAP32[$0 + 12 >> 2] + 4 >> 2])) {
__assert_fail(1888, 158, 1763);
wasm2js_trap();
}
flavorful_string_free(HEAP32[$0 + 12 >> 2]);
if (!(HEAP8[HEAP32[$0 + 8 >> 2]] & 1)) {
__assert_fail(1208, 161, 1763);
wasm2js_trap();
}
if (memcmp(HEAP32[HEAP32[$0 + 8 >> 2] + 4 >> 2], 1218, HEAP32[HEAP32[$0 + 8 >> 2] + 8 >> 2])) {
__assert_fail(2025, 162, 1763);
wasm2js_trap();
}
$1 = __stack_pointer - 16 | 0;
__stack_pointer = $1;
HEAP32[$1 + 12 >> 2] = HEAP32[$0 + 8 >> 2];
if (HEAP8[HEAP32[$1 + 12 >> 2]] & 1) {
flavorful_string_free(HEAP32[$1 + 12 >> 2] + 4 | 0)
}
__stack_pointer = $1 + 16 | 0;
__stack_pointer = $0 + 16 | 0;
__stack_pointer = $6 + 96 | 0;
}
function __wasm_export_exports_test_flavorful_test_f_list_in_variant2() {
var $0 = 0, $1 = 0, $2 = 0;
$0 = __stack_pointer - 32 | 0;
__stack_pointer = $0;
$1 = __stack_pointer - 16 | 0;
__stack_pointer = $1;
HEAP32[$1 + 12 >> 2] = $0 + 24;
flavorful_string_dup(HEAP32[$1 + 12 >> 2], 1688);
__stack_pointer = $1 + 16 | 0;
HEAP8[$0 + 23 | 0] = 1;
HEAP8[$0 + 8 | 0] = HEAP8[$0 + 23 | 0] & 1;
$2 = HEAP32[$0 + 28 >> 2];
$1 = $0 + 12 | 0;
HEAP32[$1 >> 2] = HEAP32[$0 + 24 >> 2];
HEAP32[$1 + 4 >> 2] = $2;
HEAP32[$0 + 4 >> 2] = 5220;
label$1 : {
if (HEAP8[$0 + 8 | 0] & 1) {
HEAP32[$0 >> 2] = $1;
HEAP8[HEAP32[$0 + 4 >> 2]] = 1;
HEAP32[HEAP32[$0 + 4 >> 2] + 8 >> 2] = HEAP32[HEAP32[$0 >> 2] + 4 >> 2];
HEAP32[HEAP32[$0 + 4 >> 2] + 4 >> 2] = HEAP32[HEAP32[$0 >> 2] >> 2];
break label$1;
}
HEAP8[HEAP32[$0 + 4 >> 2]] = 0;
}
__stack_pointer = $0 + 32 | 0;
return HEAP32[$0 + 4 >> 2];
}
function __wasm_export_exports_test_flavorful_test_f_list_in_variant3($0, $1, $2) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
var $3 = 0;
$3 = __stack_pointer + -64 | 0;
__stack_pointer = $3;
HEAP32[$3 + 60 >> 2] = $0;
HEAP32[$3 + 56 >> 2] = $1;
HEAP32[$3 + 52 >> 2] = $2;
label$1 : {
label$2 : {
switch (HEAP32[$3 + 60 >> 2]) {
case 0:
HEAP8[$3 + 40 | 0] = 0;
break label$1;
case 1:
break label$2;
default:
break label$1;
};
}
HEAP8[$3 + 40 | 0] = 1;
HEAP32[$3 + 32 >> 2] = HEAP32[$3 + 56 >> 2];
HEAP32[$3 + 36 >> 2] = HEAP32[$3 + 52 >> 2];
$0 = HEAP32[$3 + 36 >> 2];
$1 = $3 + 44 | 0;
HEAP32[$1 >> 2] = HEAP32[$3 + 32 >> 2];
HEAP32[$1 + 4 >> 2] = $0;
}
$0 = __stack_pointer - 16 | 0;
__stack_pointer = $0;
HEAP32[$0 + 12 >> 2] = HEAP8[$3 + 40 | 0] & 1 ? $3 + 44 | 0 : 0;
HEAP32[$0 + 8 >> 2] = $3 + 24;
if (!HEAP32[$0 + 12 >> 2]) {
__assert_fail(1355, 172, 1586);
wasm2js_trap();
}
if (memcmp(HEAP32[HEAP32[$0 + 12 >> 2] >> 2], 1579, HEAP32[HEAP32[$0 + 12 >> 2] + 4 >> 2])) {
__assert_fail(1935, 173, 1586);
wasm2js_trap();
}
flavorful_string_free(HEAP32[$0 + 12 >> 2]);
flavorful_string_dup(HEAP32[$0 + 8 >> 2], 1571);
__stack_pointer = $0 + 16 | 0;
HEAP8[$3 + 23 | 0] = 1;
HEAP8[$3 + 8 | 0] = HEAP8[$3 + 23 | 0] & 1;
$1 = HEAP32[$3 + 28 >> 2];
$0 = $3 + 12 | 0;
HEAP32[$0 >> 2] = HEAP32[$3 + 24 >> 2];
HEAP32[$0 + 4 >> 2] = $1;
HEAP32[$3 + 4 >> 2] = 5220;
label$6 : {
if (HEAP8[$3 + 8 | 0] & 1) {
HEAP32[$3 >> 2] = $0;
HEAP8[HEAP32[$3 + 4 >> 2]] = 1;
HEAP32[HEAP32[$3 + 4 >> 2] + 8 >> 2] = HEAP32[HEAP32[$3 >> 2] + 4 >> 2];
HEAP32[HEAP32[$3 + 4 >> 2] + 4 >> 2] = HEAP32[HEAP32[$3 >> 2] >> 2];
break label$6;
}
HEAP8[HEAP32[$3 + 4 >> 2]] = 0;
}
__stack_pointer = $3 - -64 | 0;
return HEAP32[$3 + 4 >> 2];
}
function __wasm_export_exports_test_flavorful_test_errno_result() {
var $0 = 0, $1 = 0;
$0 = __stack_pointer - 32 | 0;
__stack_pointer = $0;
$1 = __stack_pointer - 16 | 0;
HEAP32[$1 + 12 >> 2] = $0 + 23;
HEAP8[HEAP32[$1 + 12 >> 2]] = 2;
HEAP8[$0 + 24 | 0] = 1;
if (HEAP8[$0 + 24 | 0] & 1) {
HEAP8[$0 + 25 | 0] = HEAPU8[$0 + 23 | 0]
}
HEAP32[$0 + 16 >> 2] = 5220;
label$2 : {
if (HEAP8[$0 + 24 | 0] & 1) {
HEAP32[$0 + 12 >> 2] = $0 + 25;
HEAP8[HEAP32[$0 + 16 >> 2]] = 1;
HEAP8[HEAP32[$0 + 16 >> 2] + 1 | 0] = HEAPU8[HEAP32[$0 + 12 >> 2]];
break label$2;
}
HEAP8[HEAP32[$0 + 16 >> 2]] = 0;
}
__stack_pointer = $0 + 32 | 0;
return HEAP32[$0 + 16 >> 2];
}
function __wasm_export_exports_test_flavorful_test_list_typedefs($0, $1, $2, $3) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
$3 = $3 | 0;
var $4 = 0;
$4 = __stack_pointer + -64 | 0;
__stack_pointer = $4;
HEAP32[$4 + 60 >> 2] = $0;
HEAP32[$4 + 56 >> 2] = $1;
HEAP32[$4 + 52 >> 2] = $2;
HEAP32[$4 + 48 >> 2] = $3;
HEAP32[$4 + 40 >> 2] = HEAP32[$4 + 60 >> 2];
HEAP32[$4 + 44 >> 2] = HEAP32[$4 + 56 >> 2];
HEAP32[$4 + 32 >> 2] = HEAP32[$4 + 52 >> 2];
HEAP32[$4 + 36 >> 2] = HEAP32[$4 + 48 >> 2];
$0 = __stack_pointer - 16 | 0;
__stack_pointer = $0;
HEAP32[$0 + 12 >> 2] = $4 + 40;
HEAP32[$0 + 8 >> 2] = $4 + 32;
HEAP32[$0 + 4 >> 2] = $4 + 24;
HEAP32[$0 >> 2] = $4 + 16;
if (memcmp(HEAP32[HEAP32[$0 + 12 >> 2] >> 2], 1810, HEAP32[HEAP32[$0 + 12 >> 2] + 4 >> 2])) {
__assert_fail(1985, 185, 1166);
wasm2js_trap();
}
test_flavorful_test_list_in_record1_free(HEAP32[$0 + 12 >> 2]);
if (HEAP32[HEAP32[$0 + 8 >> 2] + 4 >> 2] != 1) {
__assert_fail(1865, 188, 1166);
wasm2js_trap();
}
$1 = HEAP32[HEAP32[$0 + 8 >> 2] >> 2];
if (memcmp(HEAP32[$1 >> 2], 1705, HEAP32[$1 + 4 >> 2])) {
__assert_fail(2493, 189, 1166);
wasm2js_trap();
}
test_flavorful_test_list_typedef3_free(HEAP32[$0 + 8 >> 2]);
$1 = dlmalloc(8);
HEAP32[HEAP32[$0 + 4 >> 2] >> 2] = $1;
HEAP32[HEAP32[$0 + 4 >> 2] + 4 >> 2] = 8;
$2 = HEAPU8[1637] | HEAPU8[1638] << 8 | (HEAPU8[1639] << 16 | HEAPU8[1640] << 24);
$1 = HEAP32[HEAP32[$0 + 4 >> 2] >> 2];
$3 = HEAPU8[1633] | HEAPU8[1634] << 8 | (HEAPU8[1635] << 16 | HEAPU8[1636] << 24);
HEAP8[$1 | 0] = $3;
HEAP8[$1 + 1 | 0] = $3 >>> 8;
HEAP8[$1 + 2 | 0] = $3 >>> 16;
HEAP8[$1 + 3 | 0] = $3 >>> 24;
HEAP8[$1 + 4 | 0] = $2;
HEAP8[$1 + 5 | 0] = $2 >>> 8;
HEAP8[$1 + 6 | 0] = $2 >>> 16;
HEAP8[$1 + 7 | 0] = $2 >>> 24;
$1 = dlmalloc(8);
HEAP32[HEAP32[$0 >> 2] >> 2] = $1;
HEAP32[HEAP32[$0 >> 2] + 4 >> 2] = 1;
flavorful_string_dup(HEAP32[HEAP32[$0 >> 2] >> 2], 1516);
__stack_pointer = $0 + 16 | 0;
HEAP32[$4 + 12 >> 2] = 5220;
HEAP32[HEAP32[$4 + 12 >> 2] + 4 >> 2] = HEAP32[$4 + 28 >> 2];
HEAP32[HEAP32[$4 + 12 >> 2] >> 2] = HEAP32[$4 + 24 >> 2];
HEAP32[HEAP32[$4 + 12 >> 2] + 12 >> 2] = HEAP32[$4 + 20 >> 2];
HEAP32[HEAP32[$4 + 12 >> 2] + 8 >> 2] = HEAP32[$4 + 16 >> 2];
__stack_pointer = $4 - -64 | 0;
return HEAP32[$4 + 12 >> 2];
}
function __wasm_export_exports_test_flavorful_test_list_of_variants($0, $1, $2, $3, $4, $5) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
$3 = $3 | 0;
$4 = $4 | 0;
$5 = $5 | 0;
var $6 = 0;
$6 = __stack_pointer - 80 | 0;
__stack_pointer = $6;
HEAP32[$6 + 76 >> 2] = $0;
HEAP32[$6 + 72 >> 2] = $1;
HEAP32[$6 + 68 >> 2] = $2;
HEAP32[$6 + 64 >> 2] = $3;
HEAP32[$6 + 60 >> 2] = $4;
HEAP32[$6 + 56 >> 2] = $5;
HEAP32[$6 + 48 >> 2] = HEAP32[$6 + 76 >> 2];
HEAP32[$6 + 52 >> 2] = HEAP32[$6 + 72 >> 2];
HEAP32[$6 + 40 >> 2] = HEAP32[$6 + 68 >> 2];
HEAP32[$6 + 44 >> 2] = HEAP32[$6 + 64 >> 2];
HEAP32[$6 + 32 >> 2] = HEAP32[$6 + 60 >> 2];
HEAP32[$6 + 36 >> 2] = HEAP32[$6 + 56 >> 2];
$0 = __stack_pointer - 32 | 0;
__stack_pointer = $0;
HEAP32[$0 + 28 >> 2] = $6 + 48;
HEAP32[$0 + 24 >> 2] = $6 + 40;
HEAP32[$0 + 20 >> 2] = $6 + 32;
HEAP32[$0 + 16 >> 2] = $6 + 24;
HEAP32[$0 + 12 >> 2] = $6 + 16;
HEAP32[$0 + 8 >> 2] = $6 + 8;
__assert_fail(2597, 208, 1121);
wasm2js_trap();
}
function dlmalloc($0) {
var $1 = 0, $2 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, $10 = 0, $11 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0;
$10 = __stack_pointer - 16 | 0;
__stack_pointer = $10;
$7 = HEAP32[1317];
if (!$7) {
$3 = HEAP32[1429];
if (!$3) {
HEAP32[1432] = -1;
HEAP32[1433] = -1;
HEAP32[1430] = 65536;
HEAP32[1431] = 65536;
$3 = $10 + 8 & -16 ^ 1431655768;
HEAP32[1429] = $3;
HEAP32[1434] = 0;
HEAP32[1422] = 0;
}
HEAP32[1424] = 59744;
HEAP32[1423] = 71328;
HEAP32[1315] = 71328;
HEAP32[1320] = $3;
HEAP32[1319] = -1;
while (1) {
$2 = $1 + 5292 | 0;
HEAP32[$1 + 5304 >> 2] = $2;
$4 = $1 + 5284 | 0;
HEAP32[$2 >> 2] = $4;
HEAP32[$1 + 5296 >> 2] = $4;
$4 = $1 + 5300 | 0;
HEAP32[$1 + 5312 >> 2] = $4;
HEAP32[$4 >> 2] = $2;
$2 = $1 + 5308 | 0;
HEAP32[$1 + 5320 >> 2] = $2;
HEAP32[$2 >> 2] = $4;
HEAP32[$1 + 5316 >> 2] = $2;
$1 = $1 + 32 | 0;
if (($1 | 0) != 256) {
continue
}
break;
};
HEAP32[17835] = 59681;
HEAP32[1318] = HEAP32[1433];
HEAP32[1314] = 59680;
HEAP32[1317] = 71336;
HEAP32[32755] = 56;
$7 = 71336;
}
label$5 : {
label$6 : {
label$7 : {
label$8 : {
label$9 : {
label$10 : {
label$11 : {
label$12 : {
label$13 : {
label$14 : {
label$15 : {
if ($0 >>> 0 <= 236) {
$5 = HEAP32[1311];
$6 = $0 >>> 0 < 11 ? 16 : $0 + 19 & -16;
$0 = $6 >>> 3 | 0;
$1 = $5 >>> $0 | 0;
if ($1 & 3) {
$2 = ($0 | $1 & 1) ^ 1;
$0 = $2 << 3;
$1 = $0 + 5284 | 0;
$0 = HEAP32[$0 + 5292 >> 2];
$4 = HEAP32[$0 + 8 >> 2];
label$18 : {
if (($1 | 0) == ($4 | 0)) {
(wasm2js_i32$0 = 5244, wasm2js_i32$1 = __wasm_rotl_i32($2) & $5), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$18;
}
HEAP32[$1 + 8 >> 2] = $4;
HEAP32[$4 + 12 >> 2] = $1;
}
$1 = $0 + 8 | 0;
$2 = $2 << 3;
HEAP32[$0 + 4 >> 2] = $2 | 3;
$0 = $0 + $2 | 0;
HEAP32[$0 + 4 >> 2] = HEAP32[$0 + 4 >> 2] | 1;
break label$5;
}
$8 = HEAP32[1313];
if ($8 >>> 0 >= $6 >>> 0) {
break label$15
}
if ($1) {
$2 = $1 << $0;
$0 = 2 << $0;
$0 = $2 & (0 - $0 | $0);
$0 = __wasm_ctz_i32(0 - $0 & $0);
$1 = $0 << 3;
$2 = $1 + 5284 | 0;
$1 = HEAP32[$1 + 5292 >> 2];
$4 = HEAP32[$1 + 8 >> 2];
label$21 : {
if (($2 | 0) == ($4 | 0)) {
$5 = __wasm_rotl_i32($0) & $5;
HEAP32[1311] = $5;
break label$21;
}
HEAP32[$2 + 8 >> 2] = $4;
HEAP32[$4 + 12 >> 2] = $2;
}
HEAP32[$1 + 4 >> 2] = $6 | 3;
$0 = $0 << 3;
$3 = $0 - $6 | 0;
HEAP32[$0 + $1 >> 2] = $3;
$6 = $1 + $6 | 0;
HEAP32[$6 + 4 >> 2] = $3 | 1;
if ($8) {
$0 = ($8 & -8) + 5284 | 0;
$2 = HEAP32[1316];
$4 = 1 << ($8 >>> 3);
label$24 : {
if (!($4 & $5)) {
HEAP32[1311] = $4 | $5;
$4 = $0;
break label$24;
}
$4 = HEAP32[$0 + 8 >> 2];
}
HEAP32[$4 + 12 >> 2] = $2;
HEAP32[$0 + 8 >> 2] = $2;
HEAP32[$2 + 12 >> 2] = $0;
HEAP32[$2 + 8 >> 2] = $4;
}
$1 = $1 + 8 | 0;
HEAP32[1316] = $6;
HEAP32[1313] = $3;
break label$5;
}
$11 = HEAP32[1312];
if (!$11) {
break label$15
}
$0 = HEAP32[(__wasm_ctz_i32($11 & 0 - $11) << 2) + 5548 >> 2];
$3 = (HEAP32[$0 + 4 >> 2] & -8) - $6 | 0;
$2 = $0;
while (1) {
label$26 : {
$1 = HEAP32[$2 + 16 >> 2];
if (!$1) {
$1 = HEAP32[$2 + 20 >> 2];
if (!$1) {
break label$26
}
}
$4 = (HEAP32[$1 + 4 >> 2] & -8) - $6 | 0;
$2 = $4 >>> 0 < $3 >>> 0;
$3 = $2 ? $4 : $3;
$0 = $2 ? $1 : $0;
$2 = $1;
continue;
}
break;
};
$9 = HEAP32[$0 + 24 >> 2];
$4 = HEAP32[$0 + 12 >> 2];
if (($0 | 0) != ($4 | 0)) {
$1 = HEAP32[$0 + 8 >> 2];
HEAP32[$4 + 8 >> 2] = $1;
HEAP32[$1 + 12 >> 2] = $4;
break label$6;
}
$2 = $0 + 20 | 0;
$1 = HEAP32[$2 >> 2];
if (!$1) {
$1 = HEAP32[$0 + 16 >> 2];
if (!$1) {
break label$14
}
$2 = $0 + 16 | 0;
}
while (1) {
$7 = $2;
$4 = $1;
$2 = $1 + 20 | 0;
$1 = HEAP32[$2 >> 2];
if ($1) {
continue
}
$2 = $4 + 16 | 0;
$1 = HEAP32[$4 + 16 >> 2];
if ($1) {
continue
}
break;
};
HEAP32[$7 >> 2] = 0;
break label$6;
}
$6 = -1;
if ($0 >>> 0 > 4294967231) {
break label$15
}
$0 = $0 + 19 | 0;
$6 = $0 & -16;
$9 = HEAP32[1312];
if (!$9) {
break label$15
}
$3 = 0 - $6 | 0;
$8 = 0;
label$32 : {
if ($6 >>> 0 < 256) {
break label$32
}
$8 = 31;
if ($6 >>> 0 > 16777215) {
break label$32
}
$0 = Math_clz32($0 >>> 8 | 0);
$8 = (($6 >>> 38 - $0 & 1) - ($0 << 1) | 0) + 62 | 0;
}
$2 = HEAP32[($8 << 2) + 5548 >> 2];
label$33 : {
label$34 : {
label$35 : {
if (!$2) {
$1 = 0;
$4 = 0;
break label$35;
}
$1 = 0;
$0 = $6 << (($8 | 0) != 31 ? 25 - ($8 >>> 1 | 0) | 0 : 0);
$4 = 0;
while (1) {
label$38 : {
$5 = (HEAP32[$2 + 4 >> 2] & -8) - $6 | 0;
if ($5 >>> 0 >= $3 >>> 0) {
break label$38
}
$4 = $2;
$3 = $5;
if ($3) {
break label$38
}
$3 = 0;
$1 = $2;
break label$34;
}
$5 = HEAP32[$2 + 20 >> 2];
$2 = HEAP32[(($0 >>> 29 & 4) + $2 | 0) + 16 >> 2];
$1 = $5 ? (($5 | 0) == ($2 | 0) ? $1 : $5) : $1;
$0 = $0 << 1;
if ($2) {
continue
}
break;
};
}
if (!($1 | $4)) {
$4 = 0;
$0 = 2 << $8;
$0 = (0 - $0 | $0) & $9;
if (!$0) {
break label$15
}
$1 = HEAP32[(__wasm_ctz_i32($0 & 0 - $0) << 2) + 5548 >> 2];
}
if (!$1) {
break label$33
}
}
while (1) {
$5 = (HEAP32[$1 + 4 >> 2] & -8) - $6 | 0;
$0 = $5 >>> 0 < $3 >>> 0;
$3 = $0 ? $5 : $3;
$4 = $0 ? $1 : $4;
$2 = HEAP32[$1 + 16 >> 2];
if (!$2) {
$2 = HEAP32[$1 + 20 >> 2]
}
$1 = $2;
if ($1) {
continue
}
break;
};
}
if (!$4 | HEAP32[1313] - $6 >>> 0 <= $3 >>> 0) {
break label$15
}
$7 = HEAP32[$4 + 24 >> 2];
$0 = HEAP32[$4 + 12 >> 2];
if (($0 | 0) != ($4 | 0)) {
$1 = HEAP32[$4 + 8 >> 2];
HEAP32[$0 + 8 >> 2] = $1;
HEAP32[$1 + 12 >> 2] = $0;
break label$7;
}
$2 = $4 + 20 | 0;
$1 = HEAP32[$2 >> 2];
if (!$1) {
$1 = HEAP32[$4 + 16 >> 2];
if (!$1) {
break label$13
}
$2 = $4 + 16 | 0;
}
while (1) {
$5 = $2;
$0 = $1;
$2 = $0 + 20 | 0;
$1 = HEAP32[$2 >> 2];
if ($1) {
continue
}
$2 = $0 + 16 | 0;
$1 = HEAP32[$0 + 16 >> 2];
if ($1) {
continue
}
break;
};
HEAP32[$5 >> 2] = 0;
break label$7;
}
$4 = HEAP32[1313];
if ($6 >>> 0 <= $4 >>> 0) {
$1 = HEAP32[1316];
$2 = $4 - $6 | 0;
label$46 : {
if ($2 >>> 0 >= 16) {
$0 = $1 + $6 | 0;
HEAP32[$0 + 4 >> 2] = $2 | 1;
HEAP32[$1 + $4 >> 2] = $2;
HEAP32[$1 + 4 >> 2] = $6 | 3;
break label$46;
}
HEAP32[$1 + 4 >> 2] = $4 | 3;
$0 = $1 + $4 | 0;
HEAP32[$0 + 4 >> 2] = HEAP32[$0 + 4 >> 2] | 1;
$0 = 0;
$2 = 0;
}
HEAP32[1313] = $2;
HEAP32[1316] = $0;
$1 = $1 + 8 | 0;
break label$5;
}
$0 = HEAP32[1314];
if ($6 >>> 0 < $0 >>> 0) {
$1 = $6 + $7 | 0;
$0 = $0 - $6 | 0;
HEAP32[$1 + 4 >> 2] = $0 | 1;
HEAP32[1317] = $1;
HEAP32[1314] = $0;
HEAP32[$7 + 4 >> 2] = $6 | 3;
$1 = $7 + 8 | 0;
break label$5;
}
$1 = 0;
if (HEAP32[1429]) {
$3 = HEAP32[1431]
} else {
HEAP32[1432] = -1;
HEAP32[1433] = -1;
HEAP32[1430] = 65536;
HEAP32[1431] = 65536;
HEAP32[1429] = $10 + 12 & -16 ^ 1431655768;
HEAP32[1434] = 0;
HEAP32[1422] = 0;
$3 = 65536;
}
$4 = $6 + 71 | 0;
$5 = $3 + $4 | 0;
$3 = 0 - $3 | 0;
$2 = $5 & $3;
if ($6 >>> 0 >= $2 >>> 0) {
HEAP32[1435] = 48;
break label$5;
}
label$52 : {
$8 = HEAP32[1421];
if (!$8) {
break label$52
}
$9 = HEAP32[1419];
$1 = $9 + $2 | 0;
if ($1 >>> 0 > $9 >>> 0) {
if ($1 >>> 0 <= $8 >>> 0) {
break label$52
}
}
$1 = 0;
HEAP32[1435] = 48;
break label$5;
}
if (HEAPU8[5688] & 4) {
break label$10
}
label$54 : {
label$55 : {
if ($7) {
$1 = 5692;
while (1) {
$8 = HEAP32[$1 >> 2];
if ($7 >>> 0 >= $8 >>> 0 & $8 + HEAP32[$1 + 4 >> 2] >>> 0 > $7 >>> 0) {
break label$55
}
$1 = HEAP32[$1 + 8 >> 2];
if ($1) {
continue
}
break;
};
}
$0 = sbrk(0);
if (($0 | 0) == -1) {
break label$11
}
$5 = $2;
$1 = HEAP32[1430];
$3 = $1 - 1 | 0;
if ($3 & $0) {
$5 = ($2 - $0 | 0) + ($0 + $3 & 0 - $1) | 0
}
if ($5 >>> 0 > 2147483646 | $6 >>> 0 >= $5 >>> 0) {
break label$11
}
$3 = HEAP32[1421];
if ($3) {
$7 = HEAP32[1419];
$1 = $7 + $5 | 0;
if ($1 >>> 0 <= $7 >>> 0 | $1 >>> 0 > $3 >>> 0) {
break label$11
}
}
$1 = sbrk($5);
if (($1 | 0) != ($0 | 0)) {
break label$54
}
break label$9;
}
$5 = $3 & $5 - $0;
if ($5 >>> 0 > 2147483646) {
break label$11
}
$0 = sbrk($5);
if (($0 | 0) == (HEAP32[$1 >> 2] + HEAP32[$1 + 4 >> 2] | 0)) {
break label$12
}
$1 = $0;
}
if (!(($1 | 0) == -1 | $6 + 72 >>> 0 <= $5 >>> 0)) {
$0 = HEAP32[1431];
$0 = $0 + ($4 - $5 | 0) & 0 - $0;
if ($0 >>> 0 > 2147483646) {
$0 = $1;
break label$9;
}
if ((sbrk($0) | 0) != -1) {
$5 = $0 + $5 | 0;
$0 = $1;
break label$9;
}
sbrk(0 - $5 | 0);
break label$11;
}
$0 = $1;
if (($0 | 0) != -1) {
break label$9
}
break label$11;
}
$4 = 0;
break label$6;
}
$0 = 0;
break label$7;
}
if (($0 | 0) != -1) {
break label$9
}
}
HEAP32[1422] = HEAP32[1422] | 4;
}
if ($2 >>> 0 > 2147483646) {
break label$8
}
$0 = sbrk($2);
$1 = sbrk(0);
if (($0 | 0) == -1 | ($1 | 0) == -1 | $0 >>> 0 >= $1 >>> 0) {
break label$8
}
$5 = $1 - $0 | 0;
if ($5 >>> 0 <= $6 + 56 >>> 0) {
break label$8
}
}
$1 = HEAP32[1419] + $5 | 0;
HEAP32[1419] = $1;
if (HEAPU32[1420] < $1 >>> 0) {
HEAP32[1420] = $1
}
label$65 : {
label$66 : {
label$67 : {
$3 = HEAP32[1317];
if ($3) {
$1 = 5692;
while (1) {
$2 = HEAP32[$1 >> 2];
$4 = HEAP32[$1 + 4 >> 2];
if (($2 + $4 | 0) == ($0 | 0)) {
break label$67
}
$1 = HEAP32[$1 + 8 >> 2];
if ($1) {
continue
}
break;
};
break label$66;
}
$1 = HEAP32[1315];
if (!(!!$1 & $0 >>> 0 >= $1 >>> 0)) {
HEAP32[1315] = $0
}
$1 = 0;
HEAP32[1424] = $5;
HEAP32[1423] = $0;
HEAP32[1319] = -1;
HEAP32[1320] = HEAP32[1429];
HEAP32[1426] = 0;
while (1) {
$2 = $1 + 5292 | 0;
HEAP32[$1 + 5304 >> 2] = $2;
$4 = $1 + 5284 | 0;
HEAP32[$2 >> 2] = $4;
HEAP32[$1 + 5296 >> 2] = $4;
$4 = $1 + 5300 | 0;
HEAP32[$1 + 5312 >> 2] = $4;
HEAP32[$4 >> 2] = $2;
$2 = $1 + 5308 | 0;
HEAP32[$1 + 5320 >> 2] = $2;
HEAP32[$2 >> 2] = $4;
HEAP32[$1 + 5316 >> 2] = $2;
$1 = $1 + 32 | 0;
if (($1 | 0) != 256) {
continue
}
break;
};
$1 = $0 + 8 & 15 ? -8 - $0 & 15 : 0;
$2 = $1 + $0 | 0;
$4 = $5 - 56 | 0;
$1 = $4 - $1 | 0;
HEAP32[$2 + 4 >> 2] = $1 | 1;
HEAP32[1318] = HEAP32[1433];
HEAP32[1314] = $1;
HEAP32[1317] = $2;
HEAP32[($0 + $4 | 0) + 4 >> 2] = 56;
break label$65;
}
if (HEAPU8[$1 + 12 | 0] & 8 | $2 >>> 0 > $3 >>> 0 | $0 >>> 0 <= $3 >>> 0) {
break label$66
}
$0 = $3 + 8 & 15 ? -8 - $3 & 15 : 0;
$2 = $0 + $3 | 0;
$7 = HEAP32[1314] + $5 | 0;
$0 = $7 - $0 | 0;
HEAP32[$2 + 4 >> 2] = $0 | 1;
HEAP32[$1 + 4 >> 2] = $4 + $5;
HEAP32[1318] = HEAP32[1433];
HEAP32[1314] = $0;
HEAP32[1317] = $2;
HEAP32[($3 + $7 | 0) + 4 >> 2] = 56;
break label$65;
}
if ($0 >>> 0 < HEAPU32[1315]) {
HEAP32[1315] = $0
}
$2 = $0 + $5 | 0;
$1 = 5692;
label$74 : {
label$75 : {
label$76 : {
label$77 : {
label$78 : {
label$79 : {
while (1) {
if (HEAP32[$1 >> 2] != ($2 | 0)) {
$1 = HEAP32[$1 + 8 >> 2];
if ($1) {
continue
}
break label$79;
}
break;
};
if (!(HEAPU8[$1 + 12 | 0] & 8)) {
break label$78
}
}
$1 = 5692;
while (1) {
$2 = HEAP32[$1 >> 2];
if ($3 >>> 0 >= $2 >>> 0) {
$4 = $2 + HEAP32[$1 + 4 >> 2] | 0;
if ($4 >>> 0 > $3 >>> 0) {
break label$77
}
}
$1 = HEAP32[$1 + 8 >> 2];
continue;
};
}
HEAP32[$1 >> 2] = $0;
HEAP32[$1 + 4 >> 2] = HEAP32[$1 + 4 >> 2] + $5;
$8 = ($0 + 8 & 15 ? -8 - $0 & 15 : 0) + $0 | 0;
HEAP32[$8 + 4 >> 2] = $6 | 3;
$5 = $2 + ($2 + 8 & 15 ? -8 - $2 & 15 : 0) | 0;
$6 = $6 + $8 | 0;
$1 = $5 - $6 | 0;
if (($3 | 0) == ($5 | 0)) {
HEAP32[1317] = $6;
$0 = HEAP32[1314] + $1 | 0;
HEAP32[1314] = $0;
HEAP32[$6 + 4 >> 2] = $0 | 1;
break label$75;
}
if (($5 | 0) == HEAP32[1316]) {
HEAP32[1316] = $6;
$0 = HEAP32[1313] + $1 | 0;
HEAP32[1313] = $0;
HEAP32[$6 + 4 >> 2] = $0 | 1;
HEAP32[$0 + $6 >> 2] = $0;
break label$75;
}
$3 = HEAP32[$5 + 4 >> 2];
if (($3 & 3) == 1) {
$9 = $3 & -8;
label$87 : {
if ($3 >>> 0 <= 255) {
$4 = $3 >>> 3 | 0;
$0 = HEAP32[$5 + 8 >> 2];
$2 = HEAP32[$5 + 12 >> 2];
if (($0 | 0) == ($2 | 0)) {
(wasm2js_i32$0 = 5244, wasm2js_i32$1 = HEAP32[1311] & __wasm_rotl_i32($4)), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$87;
}
HEAP32[$2 + 8 >> 2] = $0;
HEAP32[$0 + 12 >> 2] = $2;
break label$87;
}
$7 = HEAP32[$5 + 24 >> 2];
$0 = HEAP32[$5 + 12 >> 2];
label$90 : {
if (($0 | 0) != ($5 | 0)) {
$2 = HEAP32[$5 + 8 >> 2];
HEAP32[$0 + 8 >> 2] = $2;
HEAP32[$2 + 12 >> 2] = $0;
break label$90;
}
label$92 : {
$3 = $5 + 20 | 0;
$2 = HEAP32[$3 >> 2];
if ($2) {
break label$92
}
$3 = $5 + 16 | 0;
$2 = HEAP32[$3 >> 2];
if ($2) {
break label$92
}
$0 = 0;
break label$90;
}
while (1) {
$4 = $3;
$0 = $2;
$3 = $0 + 20 | 0;
$2 = HEAP32[$3 >> 2];
if ($2) {
continue
}
$3 = $0 + 16 | 0;
$2 = HEAP32[$0 + 16 >> 2];
if ($2) {
continue
}
break;
};
HEAP32[$4 >> 2] = 0;
}
if (!$7) {
break label$87
}
$2 = HEAP32[$5 + 28 >> 2];
$4 = ($2 << 2) + 5548 | 0;
label$94 : {
if (($5 | 0) == HEAP32[$4 >> 2]) {
HEAP32[$4 >> 2] = $0;
if ($0) {
break label$94
}
(wasm2js_i32$0 = 5248, wasm2js_i32$1 = HEAP32[1312] & __wasm_rotl_i32($2)), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$87;
}
HEAP32[$7 + (HEAP32[$7 + 16 >> 2] == ($5 | 0) ? 16 : 20) >> 2] = $0;
if (!$0) {
break label$87
}
}
HEAP32[$0 + 24 >> 2] = $7;
$2 = HEAP32[$5 + 16 >> 2];
if ($2) {
HEAP32[$0 + 16 >> 2] = $2;
HEAP32[$2 + 24 >> 2] = $0;
}
$2 = HEAP32[$5 + 20 >> 2];
if (!$2) {
break label$87
}
HEAP32[$0 + 20 >> 2] = $2;
HEAP32[$2 + 24 >> 2] = $0;
}
$5 = $5 + $9 | 0;
$3 = HEAP32[$5 + 4 >> 2];
$1 = $1 + $9 | 0;
}
HEAP32[$5 + 4 >> 2] = $3 & -2;
HEAP32[$1 + $6 >> 2] = $1;
HEAP32[$6 + 4 >> 2] = $1 | 1;
if ($1 >>> 0 <= 255) {
$0 = ($1 & -8) + 5284 | 0;
$2 = HEAP32[1311];
$1 = 1 << ($1 >>> 3);
label$98 : {
if (!($2 & $1)) {
HEAP32[1311] = $1 | $2;
$1 = $0;
break label$98;
}
$1 = HEAP32[$0 + 8 >> 2];
}
HEAP32[$1 + 12 >> 2] = $6;
HEAP32[$0 + 8 >> 2] = $6;
HEAP32[$6 + 12 >> 2] = $0;
HEAP32[$6 + 8 >> 2] = $1;
break label$75;
}
$3 = 31;
if ($1 >>> 0 <= 16777215) {
$0 = Math_clz32($1 >>> 8 | 0);
$3 = (($1 >>> 38 - $0 & 1) - ($0 << 1) | 0) + 62 | 0;
}
HEAP32[$6 + 28 >> 2] = $3;
HEAP32[$6 + 16 >> 2] = 0;
HEAP32[$6 + 20 >> 2] = 0;
$0 = ($3 << 2) + 5548 | 0;
$2 = HEAP32[1312];
$4 = 1 << $3;
if (!($2 & $4)) {
HEAP32[$0 >> 2] = $6;
HEAP32[1312] = $2 | $4;
HEAP32[$6 + 24 >> 2] = $0;
HEAP32[$6 + 8 >> 2] = $6;
HEAP32[$6 + 12 >> 2] = $6;
break label$75;
}
$3 = $1 << (($3 | 0) != 31 ? 25 - ($3 >>> 1 | 0) | 0 : 0);
$0 = HEAP32[$0 >> 2];
while (1) {
$2 = $0;
if ((HEAP32[$0 + 4 >> 2] & -8) == ($1 | 0)) {
break label$76
}
$0 = $3 >>> 29 | 0;
$3 = $3 << 1;
$4 = ($2 + ($0 & 4) | 0) + 16 | 0;
$0 = HEAP32[$4 >> 2];
if ($0) {
continue
}
break;
};
HEAP32[$4 >> 2] = $6;
HEAP32[$6 + 24 >> 2] = $2;
HEAP32[$6 + 12 >> 2] = $6;
HEAP32[$6 + 8 >> 2] = $6;
break label$75;
}
$1 = $0 + 8 & 15 ? -8 - $0 & 15 : 0;
$7 = $1 + $0 | 0;
$2 = $5 - 56 | 0;
$1 = $2 - $1 | 0;
HEAP32[$7 + 4 >> 2] = $1 | 1;
HEAP32[($0 + $2 | 0) + 4 >> 2] = 56;
$2 = ($4 + ($4 - 55 & 15 ? 55 - $4 & 15 : 0) | 0) - 63 | 0;
$2 = $2 >>> 0 < $3 + 16 >>> 0 ? $3 : $2;
HEAP32[$2 + 4 >> 2] = 35;
HEAP32[1318] = HEAP32[1433];
HEAP32[1314] = $1;
HEAP32[1317] = $7;
$7 = HEAP32[1426];
$1 = $2 + 16 | 0;
HEAP32[$1 >> 2] = HEAP32[1425];
HEAP32[$1 + 4 >> 2] = $7;
$1 = HEAP32[1424];
HEAP32[$2 + 8 >> 2] = HEAP32[1423];
HEAP32[$2 + 12 >> 2] = $1;
HEAP32[1425] = $2 + 8;
HEAP32[1424] = $5;
HEAP32[1423] = $0;
HEAP32[1426] = 0;
$1 = $2 + 36 | 0;
while (1) {
HEAP32[$1 >> 2] = 7;
$1 = $1 + 4 | 0;
if ($4 >>> 0 > $1 >>> 0) {
continue
}
break;
};
if (($2 | 0) == ($3 | 0)) {
break label$65
}
HEAP32[$2 + 4 >> 2] = HEAP32[$2 + 4 >> 2] & -2;
$0 = $2;
$2 = $2 - $3 | 0;
HEAP32[$0 >> 2] = $2;
HEAP32[$3 + 4 >> 2] = $2 | 1;
if ($2 >>> 0 <= 255) {
$0 = ($2 & -8) + 5284 | 0;
$1 = HEAP32[1311];
$2 = 1 << ($2 >>> 3);
label$105 : {
if (!($1 & $2)) {
HEAP32[1311] = $1 | $2;
$2 = $0;
break label$105;
}
$2 = HEAP32[$0 + 8 >> 2];
}
HEAP32[$2 + 12 >> 2] = $3;
HEAP32[$0 + 8 >> 2] = $3;
HEAP32[$3 + 12 >> 2] = $0;
HEAP32[$3 + 8 >> 2] = $2;
break label$65;
}
$1 = 31;
if ($2 >>> 0 <= 16777215) {
$0 = Math_clz32($2 >>> 8 | 0);
$1 = (($2 >>> 38 - $0 & 1) - ($0 << 1) | 0) + 62 | 0;
}
HEAP32[$3 + 28 >> 2] = $1;
HEAP32[$3 + 16 >> 2] = 0;
HEAP32[$3 + 20 >> 2] = 0;
$0 = ($1 << 2) + 5548 | 0;
$4 = HEAP32[1312];
$5 = 1 << $1;
if (!($4 & $5)) {
HEAP32[$0 >> 2] = $3;
HEAP32[1312] = $4 | $5;
HEAP32[$3 + 24 >> 2] = $0;
HEAP32[$3 + 8 >> 2] = $3;
HEAP32[$3 + 12 >> 2] = $3;
break label$65;
}
$1 = $2 << (($1 | 0) != 31 ? 25 - ($1 >>> 1 | 0) | 0 : 0);
$4 = HEAP32[$0 >> 2];
while (1) {
$0 = $4;
if (($2 | 0) == (HEAP32[$0 + 4 >> 2] & -8)) {
break label$74
}
$4 = $1 >>> 29 | 0;
$1 = $1 << 1;
$5 = ($0 + ($4 & 4) | 0) + 16 | 0;
$4 = HEAP32[$5 >> 2];
if ($4) {
continue
}
break;
};
HEAP32[$5 >> 2] = $3;
HEAP32[$3 + 24 >> 2] = $0;
HEAP32[$3 + 12 >> 2] = $3;
HEAP32[$3 + 8 >> 2] = $3;
break label$65;
}
$0 = HEAP32[$2 + 8 >> 2];
HEAP32[$0 + 12 >> 2] = $6;
HEAP32[$2 + 8 >> 2] = $6;
HEAP32[$6 + 24 >> 2] = 0;
HEAP32[$6 + 12 >> 2] = $2;
HEAP32[$6 + 8 >> 2] = $0;
}
$1 = $8 + 8 | 0;
break label$5;
}
$1 = HEAP32[$0 + 8 >> 2];
HEAP32[$1 + 12 >> 2] = $3;
HEAP32[$0 + 8 >> 2] = $3;
HEAP32[$3 + 24 >> 2] = 0;
HEAP32[$3 + 12 >> 2] = $0;
HEAP32[$3 + 8 >> 2] = $1;
}
$1 = HEAP32[1314];
if ($1 >>> 0 <= $6 >>> 0) {
break label$8
}
$0 = HEAP32[1317];
$2 = $0 + $6 | 0;
$1 = $1 - $6 | 0;
HEAP32[$2 + 4 >> 2] = $1 | 1;
HEAP32[1314] = $1;
HEAP32[1317] = $2;
HEAP32[$0 + 4 >> 2] = $6 | 3;
$1 = $0 + 8 | 0;
break label$5;
}
$1 = 0;
HEAP32[1435] = 48;
break label$5;
}
label$110 : {
if (!$7) {
break label$110
}
$1 = HEAP32[$4 + 28 >> 2];
$2 = ($1 << 2) + 5548 | 0;
label$111 : {
if (($4 | 0) == HEAP32[$2 >> 2]) {
HEAP32[$2 >> 2] = $0;
if ($0) {
break label$111
}
$9 = __wasm_rotl_i32($1) & $9;
HEAP32[1312] = $9;
break label$110;
}
HEAP32[$7 + (HEAP32[$7 + 16 >> 2] == ($4 | 0) ? 16 : 20) >> 2] = $0;
if (!$0) {
break label$110
}
}
HEAP32[$0 + 24 >> 2] = $7;
$1 = HEAP32[$4 + 16 >> 2];
if ($1) {
HEAP32[$0 + 16 >> 2] = $1;
HEAP32[$1 + 24 >> 2] = $0;
}
$1 = HEAP32[$4 + 20 >> 2];
if (!$1) {
break label$110
}
HEAP32[$0 + 20 >> 2] = $1;
HEAP32[$1 + 24 >> 2] = $0;
}
label$114 : {
if ($3 >>> 0 <= 15) {
$0 = $3 + $6 | 0;
HEAP32[$4 + 4 >> 2] = $0 | 3;
$0 = $0 + $4 | 0;
HEAP32[$0 + 4 >> 2] = HEAP32[$0 + 4 >> 2] | 1;
break label$114;
}
$2 = $4 + $6 | 0;
HEAP32[$2 + 4 >> 2] = $3 | 1;
HEAP32[$4 + 4 >> 2] = $6 | 3;
HEAP32[$2 + $3 >> 2] = $3;
if ($3 >>> 0 <= 255) {
$0 = ($3 & -8) + 5284 | 0;
$1 = HEAP32[1311];
$3 = 1 << ($3 >>> 3);
label$117 : {
if (!($1 & $3)) {
HEAP32[1311] = $1 | $3;
$3 = $0;
break label$117;
}
$3 = HEAP32[$0 + 8 >> 2];
}
HEAP32[$3 + 12 >> 2] = $2;
HEAP32[$0 + 8 >> 2] = $2;
HEAP32[$2 + 12 >> 2] = $0;
HEAP32[$2 + 8 >> 2] = $3;
break label$114;
}
$1 = 31;
if ($3 >>> 0 <= 16777215) {
$0 = Math_clz32($3 >>> 8 | 0);
$1 = (($3 >>> 38 - $0 & 1) - ($0 << 1) | 0) + 62 | 0;
}
HEAP32[$2 + 28 >> 2] = $1;
HEAP32[$2 + 16 >> 2] = 0;
HEAP32[$2 + 20 >> 2] = 0;
$0 = ($1 << 2) + 5548 | 0;
$5 = 1 << $1;
if (!($5 & $9)) {
HEAP32[$0 >> 2] = $2;
HEAP32[1312] = $5 | $9;
HEAP32[$2 + 24 >> 2] = $0;
HEAP32[$2 + 8 >> 2] = $2;
HEAP32[$2 + 12 >> 2] = $2;
break label$114;
}
$1 = $3 << (($1 | 0) != 31 ? 25 - ($1 >>> 1 | 0) | 0 : 0);
$6 = HEAP32[$0 >> 2];
label$121 : {
while (1) {
$0 = $6;
if ((HEAP32[$0 + 4 >> 2] & -8) == ($3 | 0)) {
break label$121
}
$5 = $1 >>> 29 | 0;
$1 = $1 << 1;
$5 = ($0 + ($5 & 4) | 0) + 16 | 0;
$6 = HEAP32[$5 >> 2];
if ($6) {
continue
}
break;
};
HEAP32[$5 >> 2] = $2;
HEAP32[$2 + 24 >> 2] = $0;
HEAP32[$2 + 12 >> 2] = $2;
HEAP32[$2 + 8 >> 2] = $2;
break label$114;
}
$1 = HEAP32[$0 + 8 >> 2];
HEAP32[$1 + 12 >> 2] = $2;
HEAP32[$0 + 8 >> 2] = $2;
HEAP32[$2 + 24 >> 2] = 0;
HEAP32[$2 + 12 >> 2] = $0;
HEAP32[$2 + 8 >> 2] = $1;
}
$1 = $4 + 8 | 0;
break label$5;
}
label$123 : {
if (!$9) {
break label$123
}
$1 = HEAP32[$0 + 28 >> 2];
$2 = ($1 << 2) + 5548 | 0;
label$124 : {
if (($0 | 0) == HEAP32[$2 >> 2]) {
HEAP32[$2 >> 2] = $4;
if ($4) {
break label$124
}
(wasm2js_i32$0 = 5248, wasm2js_i32$1 = __wasm_rotl_i32($1) & $11), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$123;
}
HEAP32[(HEAP32[$9 + 16 >> 2] == ($0 | 0) ? 16 : 20) + $9 >> 2] = $4;
if (!$4) {
break label$123
}
}
HEAP32[$4 + 24 >> 2] = $9;
$1 = HEAP32[$0 + 16 >> 2];
if ($1) {
HEAP32[$4 + 16 >> 2] = $1;
HEAP32[$1 + 24 >> 2] = $4;
}
$1 = HEAP32[$0 + 20 >> 2];
if (!$1) {
break label$123
}
HEAP32[$4 + 20 >> 2] = $1;
HEAP32[$1 + 24 >> 2] = $4;
}
label$127 : {
if ($3 >>> 0 <= 15) {
$1 = $3 + $6 | 0;
HEAP32[$0 + 4 >> 2] = $1 | 3;
$1 = $0 + $1 | 0;
HEAP32[$1 + 4 >> 2] = HEAP32[$1 + 4 >> 2] | 1;
break label$127;
}
$7 = $0 + $6 | 0;
HEAP32[$7 + 4 >> 2] = $3 | 1;
HEAP32[$0 + 4 >> 2] = $6 | 3;
HEAP32[$3 + $7 >> 2] = $3;
if ($8) {
$1 = ($8 & -8) + 5284 | 0;
$2 = HEAP32[1316];
$4 = 1 << ($8 >>> 3);
label$130 : {
if (!($4 & $5)) {
HEAP32[1311] = $4 | $5;
$4 = $1;
break label$130;
}
$4 = HEAP32[$1 + 8 >> 2];
}
HEAP32[$4 + 12 >> 2] = $2;
HEAP32[$1 + 8 >> 2] = $2;
HEAP32[$2 + 12 >> 2] = $1;
HEAP32[$2 + 8 >> 2] = $4;
}
HEAP32[1316] = $7;
HEAP32[1313] = $3;
}
$1 = $0 + 8 | 0;
}
__stack_pointer = $10 + 16 | 0;
return $1;
}
function dlfree($0) {
var $1 = 0, $2 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0;
label$1 : {
if (!$0) {
break label$1
}
$3 = $0 - 8 | 0;
$1 = HEAP32[$0 - 4 >> 2];
$0 = $1 & -8;
$5 = $3 + $0 | 0;
label$2 : {
if ($1 & 1) {
break label$2
}
if (!($1 & 3)) {
break label$1
}
$1 = HEAP32[$3 >> 2];
$3 = $3 - $1 | 0;
if ($3 >>> 0 < HEAPU32[1315]) {
break label$1
}
$0 = $0 + $1 | 0;
if (($3 | 0) != HEAP32[1316]) {
if ($1 >>> 0 <= 255) {
$1 = $1 >>> 3 | 0;
$4 = HEAP32[$3 + 8 >> 2];
$2 = HEAP32[$3 + 12 >> 2];
if (($4 | 0) == ($2 | 0)) {
(wasm2js_i32$0 = 5244, wasm2js_i32$1 = HEAP32[1311] & __wasm_rotl_i32($1)), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$2;
}
HEAP32[$2 + 8 >> 2] = $4;
HEAP32[$4 + 12 >> 2] = $2;
break label$2;
}
$7 = HEAP32[$3 + 24 >> 2];
$1 = HEAP32[$3 + 12 >> 2];
label$6 : {
if (($3 | 0) != ($1 | 0)) {
$2 = HEAP32[$3 + 8 >> 2];
HEAP32[$1 + 8 >> 2] = $2;
HEAP32[$2 + 12 >> 2] = $1;
break label$6;
}
label$8 : {
$4 = $3 + 20 | 0;
$2 = HEAP32[$4 >> 2];
if ($2) {
break label$8
}
$4 = $3 + 16 | 0;
$2 = HEAP32[$4 >> 2];
if ($2) {
break label$8
}
$1 = 0;
break label$6;
}
while (1) {
$6 = $4;
$1 = $2;
$4 = $1 + 20 | 0;
$2 = HEAP32[$4 >> 2];
if ($2) {
continue
}
$4 = $1 + 16 | 0;
$2 = HEAP32[$1 + 16 >> 2];
if ($2) {
continue
}
break;
};
HEAP32[$6 >> 2] = 0;
}
if (!$7) {
break label$2
}
$4 = HEAP32[$3 + 28 >> 2];
$2 = ($4 << 2) + 5548 | 0;
label$10 : {
if (($3 | 0) == HEAP32[$2 >> 2]) {
HEAP32[$2 >> 2] = $1;
if ($1) {
break label$10
}
(wasm2js_i32$0 = 5248, wasm2js_i32$1 = HEAP32[1312] & __wasm_rotl_i32($4)), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$2;
}
HEAP32[$7 + (HEAP32[$7 + 16 >> 2] == ($3 | 0) ? 16 : 20) >> 2] = $1;
if (!$1) {
break label$2
}
}
HEAP32[$1 + 24 >> 2] = $7;
$2 = HEAP32[$3 + 16 >> 2];
if ($2) {
HEAP32[$1 + 16 >> 2] = $2;
HEAP32[$2 + 24 >> 2] = $1;
}
$2 = HEAP32[$3 + 20 >> 2];
if (!$2) {
break label$2
}
HEAP32[$1 + 20 >> 2] = $2;
HEAP32[$2 + 24 >> 2] = $1;
break label$2;
}
$1 = HEAP32[$5 + 4 >> 2];
if (($1 & 3) != 3) {
break label$2
}
HEAP32[$5 + 4 >> 2] = $1 & -2;
HEAP32[1313] = $0;
HEAP32[$0 + $3 >> 2] = $0;
HEAP32[$3 + 4 >> 2] = $0 | 1;
return;
}
if ($3 >>> 0 >= $5 >>> 0) {
break label$1
}
$1 = HEAP32[$5 + 4 >> 2];
if (!($1 & 1)) {
break label$1
}
label$13 : {
if (!($1 & 2)) {
if (HEAP32[1317] == ($5 | 0)) {
HEAP32[1317] = $3;
$0 = HEAP32[1314] + $0 | 0;
HEAP32[1314] = $0;
HEAP32[$3 + 4 >> 2] = $0 | 1;
if (HEAP32[1316] != ($3 | 0)) {
break label$1
}
HEAP32[1313] = 0;
HEAP32[1316] = 0;
return;
}
if (HEAP32[1316] == ($5 | 0)) {
HEAP32[1316] = $3;
$0 = HEAP32[1313] + $0 | 0;
HEAP32[1313] = $0;
HEAP32[$3 + 4 >> 2] = $0 | 1;
HEAP32[$0 + $3 >> 2] = $0;
return;
}
$0 = ($1 & -8) + $0 | 0;
label$17 : {
if ($1 >>> 0 <= 255) {
$1 = $1 >>> 3 | 0;
$4 = HEAP32[$5 + 8 >> 2];
$2 = HEAP32[$5 + 12 >> 2];
if (($4 | 0) == ($2 | 0)) {
(wasm2js_i32$0 = 5244, wasm2js_i32$1 = HEAP32[1311] & __wasm_rotl_i32($1)), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$17;
}
HEAP32[$2 + 8 >> 2] = $4;
HEAP32[$4 + 12 >> 2] = $2;
break label$17;
}
$7 = HEAP32[$5 + 24 >> 2];
$1 = HEAP32[$5 + 12 >> 2];
label$20 : {
if (($1 | 0) != ($5 | 0)) {
$2 = HEAP32[$5 + 8 >> 2];
HEAP32[$1 + 8 >> 2] = $2;
HEAP32[$2 + 12 >> 2] = $1;
break label$20;
}
label$22 : {
$4 = $5 + 20 | 0;
$2 = HEAP32[$4 >> 2];
if ($2) {
break label$22
}
$4 = $5 + 16 | 0;
$2 = HEAP32[$4 >> 2];
if ($2) {
break label$22
}
$1 = 0;
break label$20;
}
while (1) {
$6 = $4;
$1 = $2;
$4 = $1 + 20 | 0;
$2 = HEAP32[$4 >> 2];
if ($2) {
continue
}
$4 = $1 + 16 | 0;
$2 = HEAP32[$1 + 16 >> 2];
if ($2) {
continue
}
break;
};
HEAP32[$6 >> 2] = 0;
}
if (!$7) {
break label$17
}
$4 = HEAP32[$5 + 28 >> 2];
$2 = ($4 << 2) + 5548 | 0;
label$24 : {
if (HEAP32[$2 >> 2] == ($5 | 0)) {
HEAP32[$2 >> 2] = $1;
if ($1) {
break label$24
}
(wasm2js_i32$0 = 5248, wasm2js_i32$1 = HEAP32[1312] & __wasm_rotl_i32($4)), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$17;
}
HEAP32[$7 + (($5 | 0) == HEAP32[$7 + 16 >> 2] ? 16 : 20) >> 2] = $1;
if (!$1) {
break label$17
}
}
HEAP32[$1 + 24 >> 2] = $7;
$2 = HEAP32[$5 + 16 >> 2];
if ($2) {
HEAP32[$1 + 16 >> 2] = $2;
HEAP32[$2 + 24 >> 2] = $1;
}
$2 = HEAP32[$5 + 20 >> 2];
if (!$2) {
break label$17
}
HEAP32[$1 + 20 >> 2] = $2;
HEAP32[$2 + 24 >> 2] = $1;
}
HEAP32[$0 + $3 >> 2] = $0;
HEAP32[$3 + 4 >> 2] = $0 | 1;
if (HEAP32[1316] != ($3 | 0)) {
break label$13
}
HEAP32[1313] = $0;
return;
}
HEAP32[$5 + 4 >> 2] = $1 & -2;
HEAP32[$0 + $3 >> 2] = $0;
HEAP32[$3 + 4 >> 2] = $0 | 1;
}
if ($0 >>> 0 <= 255) {
$1 = ($0 & -8) + 5284 | 0;
$2 = HEAP32[1311];
$0 = 1 << ($0 >>> 3);
label$28 : {
if (!($2 & $0)) {
HEAP32[1311] = $0 | $2;
$0 = $1;
break label$28;
}
$0 = HEAP32[$1 + 8 >> 2];
}
HEAP32[$0 + 12 >> 2] = $3;
HEAP32[$1 + 8 >> 2] = $3;
HEAP32[$3 + 12 >> 2] = $1;
HEAP32[$3 + 8 >> 2] = $0;
return;
}
$4 = 31;
if ($0 >>> 0 <= 16777215) {
$1 = Math_clz32($0 >>> 8 | 0);
$4 = (($0 >>> 38 - $1 & 1) - ($1 << 1) | 0) + 62 | 0;
}
HEAP32[$3 + 28 >> 2] = $4;
HEAP32[$3 + 16 >> 2] = 0;
HEAP32[$3 + 20 >> 2] = 0;
$6 = ($4 << 2) + 5548 | 0;
$2 = HEAP32[1312];
$1 = 1 << $4;
label$31 : {
if (!($2 & $1)) {
HEAP32[$6 >> 2] = $3;
HEAP32[1312] = $1 | $2;
HEAP32[$3 + 24 >> 2] = $6;
HEAP32[$3 + 8 >> 2] = $3;
HEAP32[$3 + 12 >> 2] = $3;
break label$31;
}
$4 = $0 << (($4 | 0) != 31 ? 25 - ($4 >>> 1 | 0) | 0 : 0);
$1 = HEAP32[$6 >> 2];
label$33 : {
while (1) {
$2 = $1;
if ((HEAP32[$1 + 4 >> 2] & -8) == ($0 | 0)) {
break label$33
}
$1 = $4 >>> 29 | 0;
$4 = $4 << 1;
$6 = ($2 + ($1 & 4) | 0) + 16 | 0;
$1 = HEAP32[$6 >> 2];
if ($1) {
continue
}
break;
};
HEAP32[$6 >> 2] = $3;
HEAP32[$3 + 24 >> 2] = $2;
HEAP32[$3 + 12 >> 2] = $3;
HEAP32[$3 + 8 >> 2] = $3;
break label$31;
}
$0 = HEAP32[$2 + 8 >> 2];
HEAP32[$0 + 12 >> 2] = $3;
HEAP32[$2 + 8 >> 2] = $3;
HEAP32[$3 + 24 >> 2] = 0;
HEAP32[$3 + 12 >> 2] = $2;
HEAP32[$3 + 8 >> 2] = $0;
}
$0 = HEAP32[1319] - 1 | 0;
HEAP32[1319] = $0 ? $0 : -1;
}
}
function dispose_chunk($0, $1) {
var $2 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0;
$5 = $0 + $1 | 0;
$2 = HEAP32[$0 + 4 >> 2];
label$1 : {
label$2 : {
if ($2 & 1) {
break label$2
}
if (!($2 & 3)) {
break label$1
}
$2 = HEAP32[$0 >> 2];
$1 = $2 + $1 | 0;
label$3 : {
$0 = $0 - $2 | 0;
if (($0 | 0) != HEAP32[1316]) {
if ($2 >>> 0 <= 255) {
$2 = $2 >>> 3 | 0;
$4 = HEAP32[$0 + 8 >> 2];
$3 = HEAP32[$0 + 12 >> 2];
if (($4 | 0) != ($3 | 0)) {
break label$3
}
(wasm2js_i32$0 = 5244, wasm2js_i32$1 = HEAP32[1311] & __wasm_rotl_i32($2)), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$2;
}
$7 = HEAP32[$0 + 24 >> 2];
$2 = HEAP32[$0 + 12 >> 2];
label$6 : {
if (($0 | 0) != ($2 | 0)) {
$3 = HEAP32[$0 + 8 >> 2];
HEAP32[$2 + 8 >> 2] = $3;
HEAP32[$3 + 12 >> 2] = $2;
break label$6;
}
label$8 : {
$4 = $0 + 20 | 0;
$3 = HEAP32[$4 >> 2];
if ($3) {
break label$8
}
$4 = $0 + 16 | 0;
$3 = HEAP32[$4 >> 2];
if ($3) {
break label$8
}
$2 = 0;
break label$6;
}
while (1) {
$6 = $4;
$2 = $3;
$4 = $2 + 20 | 0;
$3 = HEAP32[$4 >> 2];
if ($3) {
continue
}
$4 = $2 + 16 | 0;
$3 = HEAP32[$2 + 16 >> 2];
if ($3) {
continue
}
break;
};
HEAP32[$6 >> 2] = 0;
}
if (!$7) {
break label$2
}
$4 = HEAP32[$0 + 28 >> 2];
$3 = ($4 << 2) + 5548 | 0;
label$10 : {
if (($0 | 0) == HEAP32[$3 >> 2]) {
HEAP32[$3 >> 2] = $2;
if ($2) {
break label$10
}
(wasm2js_i32$0 = 5248, wasm2js_i32$1 = HEAP32[1312] & __wasm_rotl_i32($4)), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$2;
}
HEAP32[$7 + (HEAP32[$7 + 16 >> 2] == ($0 | 0) ? 16 : 20) >> 2] = $2;
if (!$2) {
break label$2
}
}
HEAP32[$2 + 24 >> 2] = $7;
$3 = HEAP32[$0 + 16 >> 2];
if ($3) {
HEAP32[$2 + 16 >> 2] = $3;
HEAP32[$3 + 24 >> 2] = $2;
}
$3 = HEAP32[$0 + 20 >> 2];
if (!$3) {
break label$2
}
HEAP32[$2 + 20 >> 2] = $3;
HEAP32[$3 + 24 >> 2] = $2;
break label$2;
}
$2 = HEAP32[$5 + 4 >> 2];
if (($2 & 3) != 3) {
break label$2
}
HEAP32[$5 + 4 >> 2] = $2 & -2;
HEAP32[1313] = $1;
HEAP32[$5 >> 2] = $1;
HEAP32[$0 + 4 >> 2] = $1 | 1;
return;
}
HEAP32[$3 + 8 >> 2] = $4;
HEAP32[$4 + 12 >> 2] = $3;
}
$2 = HEAP32[$5 + 4 >> 2];
label$13 : {
if (!($2 & 2)) {
if (HEAP32[1317] == ($5 | 0)) {
HEAP32[1317] = $0;
$1 = HEAP32[1314] + $1 | 0;
HEAP32[1314] = $1;
HEAP32[$0 + 4 >> 2] = $1 | 1;
if (HEAP32[1316] != ($0 | 0)) {
break label$1
}
HEAP32[1313] = 0;
HEAP32[1316] = 0;
return;
}
if (HEAP32[1316] == ($5 | 0)) {
HEAP32[1316] = $0;
$1 = HEAP32[1313] + $1 | 0;
HEAP32[1313] = $1;
HEAP32[$0 + 4 >> 2] = $1 | 1;
HEAP32[$0 + $1 >> 2] = $1;
return;
}
$1 = ($2 & -8) + $1 | 0;
label$17 : {
if ($2 >>> 0 <= 255) {
$2 = $2 >>> 3 | 0;
$4 = HEAP32[$5 + 8 >> 2];
$3 = HEAP32[$5 + 12 >> 2];
if (($4 | 0) == ($3 | 0)) {
(wasm2js_i32$0 = 5244, wasm2js_i32$1 = HEAP32[1311] & __wasm_rotl_i32($2)), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$17;
}
HEAP32[$3 + 8 >> 2] = $4;
HEAP32[$4 + 12 >> 2] = $3;
break label$17;
}
$7 = HEAP32[$5 + 24 >> 2];
$2 = HEAP32[$5 + 12 >> 2];
label$20 : {
if (($2 | 0) != ($5 | 0)) {
$3 = HEAP32[$5 + 8 >> 2];
HEAP32[$2 + 8 >> 2] = $3;
HEAP32[$3 + 12 >> 2] = $2;
break label$20;
}
label$22 : {
$3 = $5 + 20 | 0;
$4 = HEAP32[$3 >> 2];
if ($4) {
break label$22
}
$3 = $5 + 16 | 0;
$4 = HEAP32[$3 >> 2];
if ($4) {
break label$22
}
$2 = 0;
break label$20;
}
while (1) {
$6 = $3;
$2 = $4;
$3 = $2 + 20 | 0;
$4 = HEAP32[$3 >> 2];
if ($4) {
continue
}
$3 = $2 + 16 | 0;
$4 = HEAP32[$2 + 16 >> 2];
if ($4) {
continue
}
break;
};
HEAP32[$6 >> 2] = 0;
}
if (!$7) {
break label$17
}
$4 = HEAP32[$5 + 28 >> 2];
$3 = ($4 << 2) + 5548 | 0;
label$24 : {
if (HEAP32[$3 >> 2] == ($5 | 0)) {
HEAP32[$3 >> 2] = $2;
if ($2) {
break label$24
}
(wasm2js_i32$0 = 5248, wasm2js_i32$1 = HEAP32[1312] & __wasm_rotl_i32($4)), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
break label$17;
}
HEAP32[$7 + (($5 | 0) == HEAP32[$7 + 16 >> 2] ? 16 : 20) >> 2] = $2;
if (!$2) {
break label$17
}
}
HEAP32[$2 + 24 >> 2] = $7;
$3 = HEAP32[$5 + 16 >> 2];
if ($3) {
HEAP32[$2 + 16 >> 2] = $3;
HEAP32[$3 + 24 >> 2] = $2;
}
$3 = HEAP32[$5 + 20 >> 2];
if (!$3) {
break label$17
}
HEAP32[$2 + 20 >> 2] = $3;
HEAP32[$3 + 24 >> 2] = $2;
}
HEAP32[$0 + $1 >> 2] = $1;
HEAP32[$0 + 4 >> 2] = $1 | 1;
if (HEAP32[1316] != ($0 | 0)) {
break label$13
}
HEAP32[1313] = $1;
return;
}
HEAP32[$5 + 4 >> 2] = $2 & -2;
HEAP32[$0 + $1 >> 2] = $1;
HEAP32[$0 + 4 >> 2] = $1 | 1;
}
if ($1 >>> 0 <= 255) {
$2 = ($1 & -8) + 5284 | 0;
$3 = HEAP32[1311];
$1 = 1 << ($1 >>> 3);
label$28 : {
if (!($3 & $1)) {
HEAP32[1311] = $1 | $3;
$1 = $2;
break label$28;
}
$1 = HEAP32[$2 + 8 >> 2];
}
HEAP32[$1 + 12 >> 2] = $0;
HEAP32[$2 + 8 >> 2] = $0;
HEAP32[$0 + 12 >> 2] = $2;
HEAP32[$0 + 8 >> 2] = $1;
return;
}
$4 = 31;
if ($1 >>> 0 <= 16777215) {
$2 = Math_clz32($1 >>> 8 | 0);
$4 = (($1 >>> 38 - $2 & 1) - ($2 << 1) | 0) + 62 | 0;
}
HEAP32[$0 + 28 >> 2] = $4;
HEAP32[$0 + 16 >> 2] = 0;
HEAP32[$0 + 20 >> 2] = 0;
$6 = ($4 << 2) + 5548 | 0;
$3 = HEAP32[1312];
$2 = 1 << $4;
if (!($3 & $2)) {
HEAP32[$6 >> 2] = $0;
HEAP32[1312] = $2 | $3;
HEAP32[$0 + 24 >> 2] = $6;
HEAP32[$0 + 8 >> 2] = $0;
HEAP32[$0 + 12 >> 2] = $0;
return;
}
$4 = $1 << (($4 | 0) != 31 ? 25 - ($4 >>> 1 | 0) | 0 : 0);
$2 = HEAP32[$6 >> 2];
label$32 : {
while (1) {
$3 = $2;
if ((HEAP32[$2 + 4 >> 2] & -8) == ($1 | 0)) {
break label$32
}
$2 = $4 >>> 29 | 0;
$4 = $4 << 1;
$6 = ($3 + ($2 & 4) | 0) + 16 | 0;
$2 = HEAP32[$6 >> 2];
if ($2) {
continue
}
break;
};
HEAP32[$6 >> 2] = $0;
HEAP32[$0 + 24 >> 2] = $3;
HEAP32[$0 + 12 >> 2] = $0;
HEAP32[$0 + 8 >> 2] = $0;
return;
}
$1 = HEAP32[$3 + 8 >> 2];
HEAP32[$1 + 12 >> 2] = $0;
HEAP32[$3 + 8 >> 2] = $0;
HEAP32[$0 + 24 >> 2] = 0;
HEAP32[$0 + 12 >> 2] = $3;
HEAP32[$0 + 8 >> 2] = $1;
}
}
function sbrk($0) {
if (!$0) {
return __wasm_memory_size() << 16
}
if (!($0 & 65535 | ($0 | 0) < 0)) {
$0 = __wasm_memory_grow($0 >>> 16 | 0);
if (($0 | 0) == -1) {
HEAP32[1435] = 48;
return -1;
}
return $0 << 16;
}
wasm2js_trap();
}
function __assert_fail($0, $1, $2) {
var $3 = 0, $4 = 0;
$4 = __stack_pointer - 16 | 0;
__stack_pointer = $4;
HEAP32[$4 + 12 >> 2] = $1;
HEAP32[$4 + 8 >> 2] = $2;
HEAP32[$4 + 4 >> 2] = 1318;
HEAP32[$4 >> 2] = $0;
$2 = __stack_pointer - 16 | 0;
__stack_pointer = $2;
HEAP32[$2 + 12 >> 2] = $4;
$0 = __stack_pointer - 208 | 0;
__stack_pointer = $0;
HEAP32[$0 + 204 >> 2] = $4;
$1 = $0 + 160 | 0;
$3 = $1 + 32 | 0;
HEAP32[$3 >> 2] = 0;
HEAP32[$3 + 4 >> 2] = 0;
$3 = $0 + 184 | 0;
HEAP32[$3 >> 2] = 0;
HEAP32[$3 + 4 >> 2] = 0;
$3 = $0 + 176 | 0;
HEAP32[$3 >> 2] = 0;
HEAP32[$3 + 4 >> 2] = 0;
HEAP32[$0 + 168 >> 2] = 0;
HEAP32[$0 + 172 >> 2] = 0;
HEAP32[$0 + 160 >> 2] = 0;
HEAP32[$0 + 164 >> 2] = 0;
HEAP32[$0 + 200 >> 2] = $4;
if ((printf_core(0, $0 + 200 | 0, $0 + 80 | 0, $1) | 0) < 0) {
$1 = -1
} else {
$4 = HEAP32[1276];
if (HEAP32[1291] <= 0) {
HEAP32[1276] = $4 & -33
}
label$4 : {
label$5 : {
label$6 : {
if (!HEAP32[1287]) {
HEAP32[1287] = 80;
HEAP32[1282] = 0;
HEAP32[1280] = 0;
HEAP32[1281] = 0;
$1 = HEAP32[1286];
HEAP32[1286] = $0;
break label$6;
}
$1 = 0;
if (HEAP32[1280]) {
break label$5
}
}
$3 = -1;
if (__towrite(5104)) {
break label$4
}
}
$3 = printf_core(5104, $0 + 200 | 0, $0 + 80 | 0, $0 + 160 | 0);
}
if ($1) {
FUNCTION_TABLE[HEAP32[1284]](5104, 0, 0) | 0;
HEAP32[1287] = 0;
HEAP32[1286] = $1;
HEAP32[1282] = 0;
HEAP32[1280] = 0;
HEAP32[1281] = 0;
$3 = 0;
}
HEAP32[1276] = HEAP32[1276] | $4 & 32;
$1 = 0;
}
__stack_pointer = $0 + 208 | 0;
__stack_pointer = $2 + 16 | 0;
wasm2js_trap();
}
function __stdio_close($0) {
$0 = $0 | 0;
$0 = __imported_wasi_snapshot_preview1_fd_close(HEAP32[$0 + 56 >> 2]) & 65535;
if ($0) {
HEAP32[1435] = $0;
$0 = -1;
} else {
$0 = 0
}
return $0 | 0;
}
function writev($0, $1, $2) {
var $3 = 0, $4 = 0;
$3 = __stack_pointer - 16 | 0;
__stack_pointer = $3;
$4 = -1;
label$1 : {
if (($2 | 0) < 0) {
HEAP32[1435] = 28;
break label$1;
}
$0 = __imported_wasi_snapshot_preview1_fd_write($0 | 0, $1 | 0, $2 | 0, $3 + 12 | 0) & 65535;
if ($0) {
HEAP32[1435] = $0;
break label$1;
}
$4 = HEAP32[$3 + 12 >> 2];
}
__stack_pointer = $3 + 16 | 0;
return $4;
}
function __stdio_write($0, $1, $2) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
var $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0;
$4 = __stack_pointer - 16 | 0;
__stack_pointer = $4;
HEAP32[$4 + 12 >> 2] = $2;
HEAP32[$4 + 8 >> 2] = $1;
$1 = HEAP32[$0 + 24 >> 2];
HEAP32[$4 >> 2] = $1;
$3 = HEAP32[$0 + 20 >> 2] - $1 | 0;
HEAP32[$4 + 4 >> 2] = $3;
$6 = 2;
$1 = writev(HEAP32[$0 + 56 >> 2], $4, 2);
$7 = $2 + $3 | 0;
label$1 : {
if (($1 | 0) != ($7 | 0)) {
$3 = $4;
while (1) {
if (($1 | 0) < 0) {
HEAP32[$0 + 24 >> 2] = 0;
HEAP32[$0 + 16 >> 2] = 0;
HEAP32[$0 + 20 >> 2] = 0;
HEAP32[$0 >> 2] = HEAP32[$0 >> 2] | 32;
$1 = 0;
if (($6 | 0) == 2) {
break label$1
}
$1 = $2 - HEAP32[$3 + 4 >> 2] | 0;
break label$1;
}
$5 = HEAP32[$3 + 4 >> 2];
$8 = $5 >>> 0 < $1 >>> 0;
$9 = ($8 << 3) + $3 | 0;
$5 = $1 - ($8 ? $5 : 0) | 0;
HEAP32[$9 >> 2] = $5 + HEAP32[$9 >> 2];
$3 = ($8 ? 12 : 4) + $3 | 0;
HEAP32[$3 >> 2] = HEAP32[$3 >> 2] - $5;
$7 = $7 - $1 | 0;
$3 = $9;
$6 = $6 - $8 | 0;
$1 = writev(HEAP32[$0 + 56 >> 2], $3, $6);
if (($7 | 0) != ($1 | 0)) {
continue
}
break;
};
}
$1 = HEAP32[$0 + 40 >> 2];
HEAP32[$0 + 24 >> 2] = $1;
HEAP32[$0 + 20 >> 2] = $1;
HEAP32[$0 + 16 >> 2] = $1 + HEAP32[$0 + 44 >> 2];
$1 = $2;
}
__stack_pointer = $4 + 16 | 0;
return $1 | 0;
}
function __stdio_seek($0, $1, $2, $3) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
$3 = $3 | 0;
var $4 = 0;
$4 = __stack_pointer - 16 | 0;
__stack_pointer = $4;
$0 = legalimport$__imported_wasi_snapshot_preview1_fd_seek(HEAP32[$0 + 56 >> 2], $1 | 0, $2 | 0, $3 & 255, $4 + 8 | 0) & 65535;
label$1 : {
if ($0) {
HEAP32[1435] = ($0 | 0) == 76 ? 70 : $0;
$0 = -1;
$1 = -1;
break label$1;
}
$0 = HEAP32[$4 + 12 >> 2];
$1 = HEAP32[$4 + 8 >> 2];
}
__stack_pointer = $4 + 16 | 0;
i64toi32_i32$HIGH_BITS = $0;
return $1 | 0;
}
function __towrite($0) {
var $1 = 0;
$1 = HEAP32[$0 + 60 >> 2];
HEAP32[$0 + 60 >> 2] = $1 - 1 | $1;
$1 = HEAP32[$0 >> 2];
if ($1 & 8) {
HEAP32[$0 >> 2] = $1 | 32;
return -1;
}
HEAP32[$0 + 4 >> 2] = 0;
HEAP32[$0 + 8 >> 2] = 0;
$1 = HEAP32[$0 + 40 >> 2];
HEAP32[$0 + 24 >> 2] = $1;
HEAP32[$0 + 20 >> 2] = $1;
HEAP32[$0 + 16 >> 2] = $1 + HEAP32[$0 + 44 >> 2];
return 0;
}
function __fwritex($0, $1, $2) {
var $3 = 0, $4 = 0, $5 = 0, $6 = 0;
label$1 : {
$3 = HEAP32[$2 + 16 >> 2];
if (!$3) {
if (__towrite($2)) {
break label$1
}
$3 = HEAP32[$2 + 16 >> 2];
}
$5 = HEAP32[$2 + 20 >> 2];
if ($1 >>> 0 > $3 - $5 >>> 0) {
FUNCTION_TABLE[HEAP32[$2 + 32 >> 2]]($2, $0, $1) | 0;
return;
}
label$4 : {
if (HEAP32[$2 + 64 >> 2] < 0) {
break label$4
}
$3 = $0;
while (1) {
if (($1 | 0) == ($4 | 0)) {
break label$4
}
$4 = $4 + 1 | 0;
$3 = $3 - 1 | 0;
$6 = $3 + $1 | 0;
if (HEAPU8[$6 | 0] != 10) {
continue
}
break;
};
$3 = $0;
$0 = ($1 - $4 | 0) + 1 | 0;
if (FUNCTION_TABLE[HEAP32[$2 + 32 >> 2]]($2, $3, $0) >>> 0 < $0 >>> 0) {
break label$1
}
$1 = $4 - 1 | 0;
$0 = $6 + 1 | 0;
$5 = HEAP32[$2 + 20 >> 2];
}
memcpy($5, $0, $1);
HEAP32[$2 + 20 >> 2] = HEAP32[$2 + 20 >> 2] + $1;
}
}
function wctomb($0, $1) {
if (!$0) {
return 0
}
if ($0) {
__inlined_func$wcrtomb$42 : {
if ($1 >>> 0 <= 127) {
HEAP8[$0 | 0] = $1;
$0 = 1;
break __inlined_func$wcrtomb$42;
}
label$3 : {
if (!HEAP32[1438]) {
if (($1 & -128) != 57216) {
break label$3
}
HEAP8[$0 | 0] = $1;
$0 = 1;
break __inlined_func$wcrtomb$42;
}
if ($1 >>> 0 <= 2047) {
HEAP8[$0 + 1 | 0] = $1 & 63 | 128;
HEAP8[$0 | 0] = $1 >>> 6 | 192;
$0 = 2;
break __inlined_func$wcrtomb$42;
}
if (!(($1 & -8192) != 57344 & $1 >>> 0 >= 55296)) {
HEAP8[$0 + 2 | 0] = $1 & 63 | 128;
HEAP8[$0 | 0] = $1 >>> 12 | 224;
HEAP8[$0 + 1 | 0] = $1 >>> 6 & 63 | 128;
$0 = 3;
break __inlined_func$wcrtomb$42;
}
if ($1 - 65536 >>> 0 <= 1048575) {
HEAP8[$0 + 3 | 0] = $1 & 63 | 128;
HEAP8[$0 | 0] = $1 >>> 18 | 240;
HEAP8[$0 + 2 | 0] = $1 >>> 6 & 63 | 128;
HEAP8[$0 + 1 | 0] = $1 >>> 12 & 63 | 128;
$0 = 4;
break __inlined_func$wcrtomb$42;
}
}
HEAP32[1435] = 25;
$0 = -1;
}
} else {
$0 = 1
}
return $0;
}
function frexp($0, $1) {
var $2 = 0, $3 = 0, $4 = 0;
wasm2js_scratch_store_f64(+$0);
$3 = wasm2js_scratch_load_i32(1) | 0;
$4 = wasm2js_scratch_load_i32(0) | 0;
$2 = $3 >>> 20 & 2047;
if (($2 | 0) != 2047) {
if (!$2) {
if ($0 == 0.0) {
HEAP32[$1 >> 2] = 0;
return $0;
}
$0 = frexp($0 * 18446744073709551615.0, $1);
HEAP32[$1 >> 2] = HEAP32[$1 >> 2] + -64;
return $0;
}
HEAP32[$1 >> 2] = $2 - 1022;
wasm2js_scratch_store_i32(0, $4 | 0);
wasm2js_scratch_store_i32(1, $3 & -2146435073 | 1071644672);
$0 = +wasm2js_scratch_load_f64();
}
return $0;
}
function printf_core($0, $1, $2, $3) {
var $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0.0, $18 = 0, $19 = 0, $20 = 0, $21 = 0, $22 = 0.0, $23 = 0, $24 = 0, $25 = 0, $26 = 0, $27 = 0, $28 = 0, $29 = 0, $30 = 0, $31 = 0, $32 = 0, $33 = 0, $34 = 0, $35 = 0, $36 = 0, $37 = 0, $38 = 0, $39 = 0, $40 = 0, $41 = 0, wasm2js_i32$0 = 0, wasm2js_i32$1 = 0;
$12 = 2875;
$8 = __stack_pointer - 880 | 0;
__stack_pointer = $8;
$6 = $8 + 68 | 0;
$29 = $6 + 12 | 0;
$35 = -112 - $8 | 0;
$36 = $8 - 3988 | 0;
$37 = $8 + 55 | 0;
$4 = $8 + 80 | 0;
$38 = $4 ^ -2;
$39 = $6 + 11 | 0;
$34 = $4 | 8;
$33 = $4 | 9;
$40 = -10 - $6 | 0;
$41 = $6 + 10 | 0;
$25 = $8 + 56 | 0;
$4 = 0;
label$1 : {
label$2 : {
label$4 : while (1) {
label$3 : {
$6 = $12;
if (($21 ^ 2147483647) < ($4 | 0)) {
break label$3
}
$21 = $4 + $21 | 0;
label$5 : {
label$6 : {
label$7 : {
label$8 : {
label$9 : {
label$10 : {
label$11 : {
label$12 : {
$4 = HEAPU8[$6 | 0];
if ($4) {
while (1) {
label$15 : {
$4 = $4 & 255;
label$16 : {
if ($4) {
if (($4 | 0) != 37) {
break label$15
}
$5 = $12;
$4 = $5;
while (1) {
if (HEAPU8[$4 + 1 | 0] != 37) {
$12 = $4;
break label$16;
}
$5 = $5 + 1 | 0;
$7 = HEAPU8[$4 + 2 | 0];
$12 = $4 + 2 | 0;
$4 = $12;
if (($7 | 0) == 37) {
continue
}
break;
};
break label$16;
}
$5 = $12;
}
$4 = $5 - $6 | 0;
$19 = $21 ^ 2147483647;
if (($4 | 0) > ($19 | 0)) {
break label$3
}
if (!(!$0 | HEAPU8[$0 | 0] & 32)) {
__fwritex($6, $4, $0)
}
if ($4) {
continue label$4
}
$4 = $12 + 1 | 0;
$18 = -1;
$9 = HEAP8[$12 + 1 | 0];
$5 = $9 - 48 | 0;
if (!(HEAPU8[$12 + 2 | 0] != 36 | $5 >>> 0 > 9)) {
$9 = HEAP8[$12 + 3 | 0];
$30 = 1;
$18 = $5;
$4 = $12 + 3 | 0;
}
$13 = 0;
$5 = $9 - 32 | 0;
label$22 : {
if ($5 >>> 0 > 31) {
break label$22
}
$12 = 1 << $5;
if (!($12 & 75913)) {
break label$22
}
$7 = $4 + 1 | 0;
while (1) {
$13 = $13 | $12;
$4 = $7;
$9 = HEAP8[$4 | 0];
$5 = $9 - 32 | 0;
if ($5 >>> 0 >= 32) {
break label$22
}
$7 = $4 + 1 | 0;
$12 = 1 << $5;
if ($12 & 75913) {
continue
}
break;
};
}
if (($9 | 0) == 42) {
$5 = HEAP8[$4 + 1 | 0] - 48 | 0;
label$25 : {
if (!(HEAPU8[$4 + 2 | 0] != 36 | $5 >>> 0 > 9)) {
HEAP32[($5 << 2) + $3 >> 2] = 10;
$7 = $4 + 3 | 0;
$30 = 1;
$15 = HEAP32[((HEAP8[$4 + 1 | 0] << 3) + $2 | 0) - 384 >> 2];
break label$25;
}
if ($30) {
break label$11
}
$7 = $4 + 1 | 0;
if (!$0) {
$30 = 0;
$15 = 0;
break label$12;
}
$4 = HEAP32[$1 >> 2];
HEAP32[$1 >> 2] = $4 + 4;
$30 = 0;
$15 = HEAP32[$4 >> 2];
}
if (($15 | 0) >= 0) {
break label$12
}
$15 = 0 - $15 | 0;
$13 = $13 | 8192;
break label$12;
}
$15 = 0;
$12 = $9 - 48 | 0;
if ($12 >>> 0 > 9) {
$7 = $4;
break label$12;
}
while (1) {
if ($15 >>> 0 <= 214748364) {
$5 = Math_imul($15, 10);
$15 = ($5 ^ 2147483647) >>> 0 < $12 >>> 0 ? -1 : $5 + $12 | 0;
$5 = HEAP8[$4 + 1 | 0];
$7 = $4 + 1 | 0;
$4 = $7;
$12 = $5 - 48 | 0;
if ($12 >>> 0 < 10) {
continue
}
if (($15 | 0) < 0) {
break label$3
}
break label$12;
}
$5 = HEAP8[$4 + 1 | 0];
$15 = -1;
$4 = $4 + 1 | 0;
$12 = $5 - 48 | 0;
if ($12 >>> 0 < 10) {
continue
}
break;
};
break label$3;
}
$4 = HEAPU8[$12 + 1 | 0];
$12 = $12 + 1 | 0;
continue;
}
}
if ($0) {
break label$1
}
if (!$30) {
$21 = 0;
break label$1;
}
label$32 : {
$0 = HEAP32[$3 + 4 >> 2];
if (!$0) {
$12 = 1;
break label$32;
}
pop_arg($2 + 8 | 0, $0, $1);
$0 = HEAP32[$3 + 8 >> 2];
if (!$0) {
$12 = 2;
break label$32;
}
pop_arg($2 + 16 | 0, $0, $1);
$0 = HEAP32[$3 + 12 >> 2];
if (!$0) {
$12 = 3;
break label$32;
}
pop_arg($2 + 24 | 0, $0, $1);
$0 = HEAP32[$3 + 16 >> 2];
if (!$0) {
$12 = 4;
break label$32;
}
pop_arg($2 + 32 | 0, $0, $1);
$0 = HEAP32[$3 + 20 >> 2];
if (!$0) {
$12 = 5;
break label$32;
}
pop_arg($2 + 40 | 0, $0, $1);
$0 = HEAP32[$3 + 24 >> 2];
if (!$0) {
$12 = 6;
break label$32;
}
pop_arg($2 + 48 | 0, $0, $1);
$0 = HEAP32[$3 + 28 >> 2];
if (!$0) {
$12 = 7;
break label$32;
}
pop_arg($2 + 56 | 0, $0, $1);
$0 = HEAP32[$3 + 32 >> 2];
if (!$0) {
$12 = 8;
break label$32;
}
pop_arg($2 - -64 | 0, $0, $1);
$0 = HEAP32[$3 + 36 >> 2];
if (!$0) {
$12 = 9;
break label$32;
}
pop_arg($2 + 72 | 0, $0, $1);
$21 = 1;
break label$1;
}
$12 = $12 << 2;
while (1) {
if (HEAP32[$3 + $12 >> 2]) {
break label$11
}
$12 = $12 + 4 | 0;
if (($12 | 0) != 40) {
continue
}
break;
};
$21 = 1;
break label$1;
}
$4 = 0;
$9 = -1;
label$43 : {
if (HEAPU8[$7 | 0] != 46) {
$12 = $7;
$11 = 0;
break label$43;
}
$5 = HEAP8[$7 + 1 | 0];
if (($5 | 0) == 42) {
$5 = HEAP8[$7 + 2 | 0] - 48 | 0;
label$46 : {
if (!(HEAPU8[$7 + 3 | 0] != 36 | $5 >>> 0 > 9)) {
HEAP32[($5 << 2) + $3 >> 2] = 10;
$12 = $7 + 4 | 0;
$9 = HEAP32[((HEAP8[$7 + 2 | 0] << 3) + $2 | 0) - 384 >> 2];
break label$46;
}
if ($30) {
break label$11
}
$12 = $7 + 2 | 0;
$9 = 0;
if (!$0) {
break label$46
}
$5 = HEAP32[$1 >> 2];
HEAP32[$1 >> 2] = $5 + 4;
$9 = HEAP32[$5 >> 2];
}
$11 = ($9 ^ -1) >>> 31 | 0;
break label$43;
}
$12 = $7 + 1 | 0;
$14 = $5 - 48 | 0;
if ($14 >>> 0 > 9) {
$11 = 1;
$9 = 0;
break label$43;
}
$10 = 0;
$7 = $12;
while (1) {
$9 = -1;
$11 = 1;
if ($10 >>> 0 <= 214748364) {
$5 = Math_imul($10, 10);
$9 = ($5 ^ 2147483647) >>> 0 < $14 >>> 0 ? -1 : $5 + $14 | 0;
}
$5 = HEAP8[$7 + 1 | 0];
$10 = $9;
$12 = $7 + 1 | 0;
$7 = $12;
$14 = $5 - 48 | 0;
if ($14 >>> 0 < 10) {
continue
}
break;
};
}
while (1) {
$5 = $4;
$4 = HEAP8[$12 | 0];
if ($4 - 123 >>> 0 < 4294967238) {
break label$11
}
$12 = $12 + 1 | 0;
$4 = HEAPU8[($4 + Math_imul($5, 58) | 0) + 4559 | 0];
if ($4 - 1 >>> 0 < 8) {
continue
}
break;
};
label$53 : {
label$54 : {
if (($4 | 0) != 27) {
if (!$4) {
break label$11
}
if (($18 | 0) >= 0) {
HEAP32[($18 << 2) + $3 >> 2] = $4;
$7 = ($18 << 3) + $2 | 0;
$4 = HEAP32[$7 + 4 >> 2];
HEAP32[$8 + 56 >> 2] = HEAP32[$7 >> 2];
HEAP32[$8 + 60 >> 2] = $4;
break label$54;
}
if (!$0) {
$21 = 0;
break label$1;
}
pop_arg($8 + 56 | 0, $4, $1);
break label$53;
}
if (($18 | 0) >= 0) {
break label$11
}
}
$4 = 0;
if (!$0) {
continue
}
}
$10 = $13 & -65537;
$16 = $13 & 8192 ? $10 : $13;
label$58 : {
label$59 : {
label$60 : {
label$61 : {
label$62 : {
label$63 : {
label$64 : {
label$65 : {
label$66 : {
label$67 : {
label$68 : {
label$69 : {
label$70 : {
label$71 : {
label$72 : {
label$73 : {
label$74 : {
$4 = HEAP8[$12 - 1 | 0];
$23 = $5 ? (($4 & 15) == 3 ? $4 & -33 : $4) : $4;
switch ($23 - 65 | 0) {
case 0:
case 4:
case 5:
case 6:
case 32:
case 36:
case 37:
case 38:
break label$58;
case 2:
break label$61;
case 18:
break label$62;
case 50:
break label$64;
case 44:
break label$65;
case 34:
break label$66;
case 35:
case 40:
break label$69;
case 46:
break label$70;
case 23:
case 55:
break label$71;
case 47:
break label$72;
case 45:
break label$73;
case 52:
break label$74;
default:
break label$10;
};
}
$14 = 0;
$10 = HEAP32[$8 + 56 >> 2];
$4 = HEAP32[$8 + 60 >> 2];
$18 = 1024;
break label$68;
}
$4 = 0;
label$75 : {
switch ($5 & 255) {
case 0:
HEAP32[HEAP32[$8 + 56 >> 2] >> 2] = $21;
continue;
case 1:
HEAP32[HEAP32[$8 + 56 >> 2] >> 2] = $21;
continue;
case 2:
$6 = HEAP32[$8 + 56 >> 2];
HEAP32[$6 >> 2] = $21;
HEAP32[$6 + 4 >> 2] = $21 >> 31;
continue;
case 3:
HEAP16[HEAP32[$8 + 56 >> 2] >> 1] = $21;
continue;
case 4:
HEAP8[HEAP32[$8 + 56 >> 2]] = $21;
continue;
case 6:
HEAP32[HEAP32[$8 + 56 >> 2] >> 2] = $21;
continue;
case 7:
break label$75;
default:
continue;
};
}
$6 = HEAP32[$8 + 56 >> 2];
HEAP32[$6 >> 2] = $21;
HEAP32[$6 + 4 >> 2] = $21 >> 31;
continue;
}
$9 = $9 >>> 0 <= 8 ? 8 : $9;
$16 = $16 | 8;
$23 = 120;
}
$14 = 0;
$18 = 1024;
$10 = HEAP32[$8 + 56 >> 2];
$4 = HEAP32[$8 + 60 >> 2];
if (!($10 | $4)) {
$6 = $25;
break label$67;
}
$7 = $23 & 32;
$6 = $25;
while (1) {
$6 = $6 - 1 | 0;
HEAP8[$6 | 0] = $7 | HEAPU8[($10 & 15) + 5088 | 0];
$5 = !$4 & $10 >>> 0 > 15 | ($4 | 0) != 0;
$10 = ($4 & 15) << 28 | $10 >>> 4;
$4 = $4 >>> 4 | 0;
if ($5) {
continue
}
break;
};
if (!($16 & 8)) {
break label$67
}
$18 = ($23 >> 4) + 1024 | 0;
$14 = 2;
break label$67;
}
$6 = $25;
$10 = HEAP32[$8 + 56 >> 2];
$4 = HEAP32[$8 + 60 >> 2];
if ($10 | $4) {
while (1) {
$6 = $6 - 1 | 0;
HEAP8[$6 | 0] = $10 & 7 | 48;
$7 = !$4 & $10 >>> 0 > 7 | ($4 | 0) != 0;
$5 = $4;
$4 = $4 >>> 3 | 0;
$10 = ($5 & 7) << 29 | $10 >>> 3;
if ($7) {
continue
}
break;
}
}
$14 = 0;
$18 = 1024;
if (!($16 & 8)) {
break label$67
}
$4 = $25 - $6 | 0;
$9 = ($4 | 0) < ($9 | 0) ? $9 : $4 + 1 | 0;
break label$67;
}
$10 = HEAP32[$8 + 56 >> 2];
$4 = HEAP32[$8 + 60 >> 2];
if (($4 | 0) < 0) {
$4 = 0 - ((($10 | 0) != 0) + $4 | 0) | 0;
$10 = 0 - $10 | 0;
HEAP32[$8 + 56 >> 2] = $10;
HEAP32[$8 + 60 >> 2] = $4;
$14 = 1;
$18 = 1024;
break label$68;
}
if ($16 & 2048) {
$14 = 1;
$18 = 1025;
break label$68;
}
$14 = $16 & 1;
$18 = $14 ? 1026 : 1024;
}
label$88 : {
if (!(($4 | 0) == 1 | $4 >>> 0 > 1)) {
$6 = $25;
break label$88;
}
$6 = $25;
while (1) {
$6 = $6 - 1 | 0;
$7 = $10;
$5 = $4;
$10 = __wasm_i64_udiv($10, $4, 10);
$4 = i64toi32_i32$HIGH_BITS;
(wasm2js_i32$0 = $6, wasm2js_i32$1 = $7 - __wasm_i64_mul($10, $4, 10, 0) | 48), HEAP8[wasm2js_i32$0 | 0] = wasm2js_i32$1;
if ($5 >>> 0 > 9) {
continue
}
break;
};
}
$4 = $10;
if (!$4) {
break label$67
}
while (1) {
$6 = $6 - 1 | 0;
$5 = ($4 >>> 0) / 10 | 0;
HEAP8[$6 | 0] = $4 - Math_imul($5, 10) | 48;
$7 = $4 >>> 0 > 9;
$4 = $5;
if ($7) {
continue
}
break;
};
}
if (!!$11 & ($9 | 0) < 0) {
break label$3
}
$10 = $11 ? $16 & -65537 : $16;
label$93 : {
$5 = HEAP32[$8 + 56 >> 2];
$4 = HEAP32[$8 + 60 >> 2];
if ($5 | $4) {
break label$93
}
$13 = 0;
if ($9) {
break label$93
}
$6 = $25;
$4 = $6;
break label$9;
}
$4 = !($4 | $5) + ($25 - $6 | 0) | 0;
$13 = ($4 | 0) < ($9 | 0) ? $9 : $4;
$4 = $25;
break label$9;
}
HEAP8[$8 + 55 | 0] = HEAP32[$8 + 56 >> 2];
$14 = 0;
$18 = 1024;
$13 = 1;
$6 = $37;
$4 = $25;
break label$9;
}
$4 = HEAP32[1435];
if (!HEAP32[1444]) {
HEAP32[1444] = 5752
}
$6 = HEAPU16[(($4 >>> 0 <= 76 ? $4 : 0) << 1) + 4464 >> 1] + 2912 | 0;
break label$63;
}
$4 = HEAP32[$8 + 56 >> 2];
$6 = $4 ? $4 : 2643;
}
$14 = 0;
$18 = 1024;
$11 = $9 >>> 0 >= 2147483647 ? 2147483647 : $9;
$4 = $11;
$16 = ($4 | 0) != 0;
__inlined_func$memchr$57 : {
label$13 : {
label$24 : {
label$35 : {
if (!(!($6 & 3) | !$4)) {
if (!HEAPU8[$6 | 0]) {
$7 = $6;
$5 = $4;
break label$24;
}
$5 = $4 - 1 | 0;
$16 = ($5 | 0) != 0;
$7 = $6 + 1 | 0;
if (!($7 & 3) | !$5) {
break label$35
}
if (!HEAPU8[$7 | 0]) {
break label$24
}
$5 = $4 - 2 | 0;
$16 = ($5 | 0) != 0;
$7 = $6 + 2 | 0;
if (!($7 & 3) | !$5) {
break label$35
}
if (!HEAPU8[$7 | 0]) {
break label$24
}
$5 = $4 - 3 | 0;
$16 = ($5 | 0) != 0;
$7 = $6 + 3 | 0;
if (!($7 & 3) | !$5) {
break label$35
}
if (!HEAPU8[$7 | 0]) {
break label$24
}
$7 = $6 + 4 | 0;
$5 = $4 - 4 | 0;
$16 = ($5 | 0) != 0;
break label$35;
}
$5 = $4;
$7 = $6;
}
if (!$16) {
break label$13
}
if (!(!HEAPU8[$7 | 0] | $5 >>> 0 < 4)) {
while (1) {
$4 = HEAP32[$7 >> 2];
if (($4 ^ -1) & $4 - 16843009 & -2139062144) {
break label$24
}
$7 = $7 + 4 | 0;
$5 = $5 - 4 | 0;
if ($5 >>> 0 > 3) {
continue
}
break;
}
}
if (!$5) {
break label$13
}
}
while (1) {
$4 = $7;
if (!HEAPU8[$7 | 0]) {
break __inlined_func$memchr$57
}
$7 = $7 + 1 | 0;
$5 = $5 - 1 | 0;
if ($5) {
continue
}
break;
};
}
$4 = 0;
}
$13 = $4 ? $4 - $6 | 0 : $11;
$4 = $13 + $6 | 0;
if (!HEAPU8[$4 | 0] | ($9 | 0) >= 0) {
break label$9
}
break label$3;
}
$6 = HEAP32[$8 + 56 >> 2];
if ($9) {
break label$60
}
$4 = 0;
break label$59;
}
HEAP32[$8 + 12 >> 2] = 0;
HEAP32[$8 + 8 >> 2] = HEAP32[$8 + 56 >> 2];
$4 = $8 + 8 | 0;
HEAP32[$8 + 56 >> 2] = $4;
$9 = -1;
$6 = $4;
}
$4 = 0;
$5 = $6;
label$94 : {
while (1) {
$7 = HEAP32[$5 >> 2];
if (!$7) {
break label$94
}
$11 = wctomb($8 + 4 | 0, $7);
$7 = ($11 | 0) < 0;
if (!($7 | $11 >>> 0 > $9 - $4 >>> 0)) {
$5 = $5 + 4 | 0;
$4 = $4 + $11 | 0;
if ($9 >>> 0 > $4 >>> 0) {
continue
}
break label$94;
}
break;
};
if ($7) {
break label$2
}
}
if (($4 | 0) < 0) {
break label$3
}
}
$10 = $16 & 73728;
label$97 : {
if ($10 | ($4 | 0) >= ($15 | 0)) {
break label$97
}
$5 = $15 - $4 | 0;
$7 = $5 >>> 0 < 256;
memset($8 + 112 | 0, 32, $7 ? $5 : 256);
if (!$7) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 112 | 0, 256, $0)
}
$5 = $5 - 256 | 0;
if ($5 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$97
}
__fwritex($8 + 112 | 0, $5, $0);
}
label$101 : {
if (!$4) {
break label$101
}
$5 = 0;
while (1) {
$7 = HEAP32[$6 >> 2];
if (!$7) {
break label$101
}
$11 = $8 + 4 | 0;
$7 = wctomb($11, $7);
$5 = $7 + $5 | 0;
if ($5 >>> 0 > $4 >>> 0) {
break label$101
}
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($11, $7, $0)
}
$6 = $6 + 4 | 0;
if ($4 >>> 0 > $5 >>> 0) {
continue
}
break;
};
}
label$104 : {
if (($10 | 0) != 8192 | ($4 | 0) >= ($15 | 0)) {
break label$104
}
$5 = $15 - $4 | 0;
$6 = $5 >>> 0 < 256;
memset($8 + 112 | 0, 32, $6 ? $5 : 256);
if (!$6) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 112 | 0, 256, $0)
}
$5 = $5 - 256 | 0;
if ($5 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$104
}
__fwritex($8 + 112 | 0, $5, $0);
}
$4 = ($4 | 0) < ($15 | 0) ? $15 : $4;
continue;
}
if (!!$11 & ($9 | 0) < 0) {
break label$3
}
$17 = HEAPF64[$8 + 56 >> 3];
HEAP32[$8 + 108 >> 2] = 0;
wasm2js_scratch_store_f64(+$17);
$4 = wasm2js_scratch_load_i32(1) | 0;
wasm2js_scratch_load_i32(0) | 0;
label$109 : {
if (($4 | 0) < 0) {
$17 = -$17;
$26 = 1;
$31 = 1034;
$27 = 0;
break label$109;
}
if ($16 & 2048) {
$26 = 1;
$31 = 1037;
$27 = 0;
break label$109;
}
$26 = $16 & 1;
$31 = $26 ? 1040 : 1035;
$27 = !$26;
}
if (!(Math_abs($17) < Infinity)) {
$5 = $26 + 3 | 0;
label$113 : {
if ($16 & 8192 | ($5 | 0) >= ($15 | 0)) {
break label$113
}
$4 = $15 - $5 | 0;
$6 = $4 >>> 0 < 256;
memset($8 + 624 | 0, 32, $6 ? $4 : 256);
if (!$6) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 624 | 0, 256, $0)
}
$4 = $4 - 256 | 0;
if ($4 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$113
}
__fwritex($8 + 624 | 0, $4, $0);
}
$4 = HEAP32[$0 >> 2];
if (!($4 & 32)) {
__fwritex($31, $26, $0);
$4 = HEAP32[$0 >> 2];
}
if (!($4 & 32)) {
$4 = $23 & 32;
__fwritex($17 != $17 ? ($4 ? 1226 : 1351) : $4 ? 1230 : 1371, 3, $0);
}
label$119 : {
if (($16 & 73728) != 8192 | ($5 | 0) >= ($15 | 0)) {
break label$119
}
$4 = $15 - $5 | 0;
$6 = $4 >>> 0 < 256;
memset($8 + 624 | 0, 32, $6 ? $4 : 256);
if (!$6) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 624 | 0, 256, $0)
}
$4 = $4 - 256 | 0;
if ($4 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$119
}
__fwritex($8 + 624 | 0, $4, $0);
}
$4 = ($5 | 0) > ($15 | 0) ? $5 : $15;
continue;
}
label$123 : {
label$124 : {
$22 = frexp($17, $8 + 108 | 0);
$17 = $22 + $22;
if ($17 != 0.0) {
$4 = HEAP32[$8 + 108 >> 2];
HEAP32[$8 + 108 >> 2] = $4 - 1;
$14 = $23 | 32;
if (($14 | 0) != 97) {
break label$124
}
break label$6;
}
$14 = $23 | 32;
if (($14 | 0) == 97) {
break label$6
}
$6 = HEAP32[$8 + 108 >> 2];
$11 = ($9 | 0) < 0 ? 6 : $9;
break label$123;
}
$6 = $4 - 29 | 0;
HEAP32[$8 + 108 >> 2] = $6;
$17 = $17 * 268435456.0;
$11 = ($9 | 0) < 0 ? 6 : $9;
}
$24 = ($6 | 0) < 0;
$28 = ($24 ? 0 : 72) << 2;
$18 = $28 + ($8 + 112 | 0) | 0;
$5 = $18;
while (1) {
$4 = $17 < 4294967296.0 & $17 >= 0.0 ? ~~$17 >>> 0 : 0;
HEAP32[$5 >> 2] = $4;
$5 = $5 + 4 | 0;
$17 = ($17 - +($4 >>> 0)) * 1.0e9;
if ($17 != 0.0) {
continue
}
break;
};
label$129 : {
if (($6 | 0) <= 0) {
$4 = $5;
$7 = $18;
break label$129;
}
$7 = $18;
while (1) {
$19 = ($6 | 0) >= 29 ? 29 : $6;
$4 = $5 - 4 | 0;
label$132 : {
if ($7 >>> 0 > $4 >>> 0) {
break label$132
}
$10 = 0;
while (1) {
$6 = $4;
$9 = HEAP32[$4 >> 2];
$13 = $19 & 31;
$6 = $4;
if (($19 & 63) >>> 0 >= 32) {
$4 = $9 << $13;
$9 = 0;
} else {
$4 = (1 << $13) - 1 & $9 >>> 32 - $13;
$9 = $9 << $13;
}
$9 = $9 + $10 | 0;
$10 = __wasm_i64_udiv($9, $9 >>> 0 < $10 >>> 0 ? $4 + 1 | 0 : $4, 1e9);
(wasm2js_i32$0 = $6, wasm2js_i32$1 = $9 - __wasm_i64_mul($10, i64toi32_i32$HIGH_BITS, 1e9, 0) | 0), HEAP32[wasm2js_i32$0 >> 2] = wasm2js_i32$1;
$4 = $6 - 4 | 0;
if ($7 >>> 0 <= $4 >>> 0) {
continue
}
break;
};
if (!$10) {
break label$132
}
$7 = $7 - 4 | 0;
HEAP32[$7 >> 2] = $10;
}
while (1) {
$4 = $5;
if ($4 >>> 0 > $7 >>> 0) {
$5 = $4 - 4 | 0;
if (!HEAP32[$5 >> 2]) {
continue
}
}
break;
};
$6 = HEAP32[$8 + 108 >> 2] - $19 | 0;
HEAP32[$8 + 108 >> 2] = $6;
$5 = $4;
if (($6 | 0) > 0) {
continue
}
break;
};
}
if (($6 | 0) < 0) {
$13 = (($11 + 25 >>> 0) / 9 | 0) + 1 | 0;
while (1) {
$6 = 0 - $6 | 0;
$20 = ($6 | 0) >= 9 ? 9 : $6;
label$138 : {
if ($4 >>> 0 <= $7 >>> 0) {
$5 = HEAP32[$7 >> 2];
break label$138;
}
$19 = 1e9 >>> $20 | 0;
$9 = -1 << $20 ^ -1;
$6 = 0;
$5 = $7;
while (1) {
$10 = HEAP32[$5 >> 2];
HEAP32[$5 >> 2] = $6 + ($10 >>> $20 | 0);
$6 = Math_imul($19, $9 & $10);
$5 = $5 + 4 | 0;
if ($5 >>> 0 < $4 >>> 0) {
continue
}
break;
};
$5 = HEAP32[$7 >> 2];
if (!$6) {
break label$138
}
HEAP32[$4 >> 2] = $6;
$4 = $4 + 4 | 0;
}
$6 = $20 + HEAP32[$8 + 108 >> 2] | 0;
HEAP32[$8 + 108 >> 2] = $6;
$7 = (!$5 << 2) + $7 | 0;
$5 = ($14 | 0) == 102 ? $18 : $7;
$4 = ($13 | 0) < $4 - $5 >> 2 ? $5 + ($13 << 2) | 0 : $4;
if (($6 | 0) < 0) {
continue
}
break;
};
}
$13 = 0;
label$141 : {
if ($4 >>> 0 <= $7 >>> 0) {
break label$141
}
$13 = Math_imul($18 - $7 >> 2, 9);
$6 = HEAP32[$7 >> 2];
if ($6 >>> 0 < 10) {
break label$141
}
$5 = 10;
while (1) {
$13 = $13 + 1 | 0;
$5 = Math_imul($5, 10);
if ($6 >>> 0 >= $5 >>> 0) {
continue
}
break;
};
}
$32 = ($14 | 0) == 103;
$6 = ($11 - (($14 | 0) != 102 ? $13 : 0) | 0) - ($32 & ($11 | 0) != 0) | 0;
if (($6 | 0) < (Math_imul($4 - $18 >> 2, 9) - 9 | 0)) {
$9 = $6 + 9216 | 0;
$6 = ($9 | 0) / 9 | 0;
$20 = $6 << 2;
$19 = ($24 ? 1 : 73) << 2;
$10 = ($20 + ($19 + $8 | 0) | 0) - 3984 | 0;
$5 = 10;
$24 = $9 - Math_imul($6, 9) | 0;
label$144 : {
if (($24 | 0) > 7) {
break label$144
}
$9 = 8 - $24 | 0;
$6 = $9 & 7;
if ($24 - 1 >>> 0 >= 7) {
$9 = $9 & -8;
while (1) {
$5 = Math_imul($5, 1e8);
$9 = $9 - 8 | 0;
if ($9) {
continue
}
break;
};
}
if (!$6) {
break label$144
}
while (1) {
$5 = Math_imul($5, 10);
$6 = $6 - 1 | 0;
if ($6) {
continue
}
break;
};
}
$24 = HEAP32[$10 >> 2];
$9 = ($24 >>> 0) / ($5 >>> 0) | 0;
$14 = $24 - Math_imul($5, $9) | 0;
$6 = $10 + 4 | 0;
label$148 : {
if (!$14 & ($6 | 0) == ($4 | 0)) {
break label$148
}
label$150 : {
if (!($9 & 1)) {
$17 = 9007199254740992.0;
if (!(HEAP8[$10 - 4 | 0] & 1) | (($5 | 0) != 1e9 | $7 >>> 0 >= $10 >>> 0)) {
break label$150
}
}
$17 = 9007199254740994.0;
}
$22 = ($4 | 0) == ($6 | 0) ? 1.0 : 1.5;
$6 = $5 >>> 1 | 0;
$22 = $6 >>> 0 > $14 >>> 0 ? .5 : ($6 | 0) == ($14 | 0) ? $22 : 1.5;
if (!(HEAPU8[$31 | 0] != 45 | $27)) {
$17 = -$17;
$22 = -$22;
}
$6 = $24 - $14 | 0;
HEAP32[$10 >> 2] = $6;
if ($17 + $22 == $17) {
break label$148
}
$6 = $5 + $6 | 0;
HEAP32[$10 >> 2] = $6;
if ($6 >>> 0 >= 1e9) {
$5 = ($19 + $20 | 0) + $36 | 0;
while (1) {
HEAP32[$5 + 4 >> 2] = 0;
if ($5 >>> 0 < $7 >>> 0) {
$7 = $7 - 4 | 0;
HEAP32[$7 >> 2] = 0;
}
$6 = HEAP32[$5 >> 2] + 1 | 0;
HEAP32[$5 >> 2] = $6;
$5 = $5 - 4 | 0;
if ($6 >>> 0 > 999999999) {
continue
}
break;
};
$10 = $5 + 4 | 0;
}
$13 = Math_imul($18 - $7 >> 2, 9);
$6 = HEAP32[$7 >> 2];
if ($6 >>> 0 < 10) {
break label$148
}
$5 = 10;
while (1) {
$13 = $13 + 1 | 0;
$5 = Math_imul($5, 10);
if ($6 >>> 0 >= $5 >>> 0) {
continue
}
break;
};
}
$6 = $10 + 4 | 0;
$4 = $4 >>> 0 > $6 >>> 0 ? $6 : $4;
}
$5 = ($4 + $35 | 0) - $28 | 0;
while (1) {
label$157 : {
$6 = $5;
$19 = $4;
$10 = $7 >>> 0 >= $4 >>> 0;
if ($10) {
break label$157
}
$5 = $5 - 4 | 0;
$4 = $4 - 4 | 0;
if (!HEAP32[$4 >> 2]) {
continue
}
}
break;
};
label$159 : {
if (!$32) {
$27 = $16 & 8;
break label$159;
}
$5 = $11 ? $11 : 1;
$4 = ($5 | 0) > ($13 | 0) & ($13 | 0) > -5;
$11 = ($4 ? $13 ^ -1 : -1) + $5 | 0;
$23 = ($4 ? -1 : -2) + $23 | 0;
$27 = $16 & 8;
if ($27) {
break label$159
}
$4 = -9;
label$161 : {
if ($10) {
break label$161
}
$10 = HEAP32[$19 - 4 >> 2];
if (!$10) {
break label$161
}
$4 = 0;
if (($10 >>> 0) % 10 | 0) {
break label$161
}
$5 = 10;
while (1) {
$4 = $4 - 1 | 0;
$5 = Math_imul($5, 10);
if (!(($10 >>> 0) % ($5 >>> 0) | 0)) {
continue
}
break;
};
}
$6 = Math_imul($6 >> 2, 9) - 9 | 0;
if (($23 & -33) == 70) {
$27 = 0;
$4 = $4 + $6 | 0;
$4 = ($4 | 0) > 0 ? $4 : 0;
$11 = ($4 | 0) > ($11 | 0) ? $11 : $4;
break label$159;
}
$27 = 0;
$4 = ($6 + $13 | 0) + $4 | 0;
$4 = ($4 | 0) > 0 ? $4 : 0;
$11 = ($4 | 0) > ($11 | 0) ? $11 : $4;
}
$32 = $11 | $27;
if ((($32 ? 2147483645 : 2147483646) | 0) < ($11 | 0)) {
break label$3
}
$24 = ((($32 | 0) != 0) + $11 | 0) + 1 | 0;
$20 = ($23 & -33) != 70;
label$164 : {
if (!$20) {
if (($24 ^ 2147483647) < ($13 | 0)) {
break label$3
}
$4 = ($13 | 0) > 0 ? $13 : 0;
break label$164;
}
label$166 : {
if (!$13) {
$6 = $29;
$5 = $6;
break label$166;
}
$4 = $13 >> 31;
$4 = ($4 ^ $13) - $4 | 0;
$6 = $29;
$5 = $6;
while (1) {
$5 = $5 - 1 | 0;
$10 = ($4 >>> 0) / 10 | 0;
HEAP8[$5 | 0] = $4 - Math_imul($10, 10) | 48;
$6 = $6 - 1 | 0;
$9 = $4 >>> 0 > 9;
$4 = $10;
if ($9) {
continue
}
break;
};
}
if (($29 - $6 | 0) <= 1) {
$5 = ($41 - $6 | 0) + $5 | 0;
memset($5, 48, $6 + $40 | 0);
}
$28 = $5 - 2 | 0;
HEAP8[$28 | 0] = $23;
HEAP8[$5 - 1 | 0] = ($13 | 0) < 0 ? 45 : 43;
$4 = $29 - $28 | 0;
if (($4 | 0) > ($24 ^ 2147483647)) {
break label$3
}
}
$4 = $4 + $24 | 0;
if (($4 | 0) > ($26 ^ 2147483647)) {
break label$3
}
$13 = $16 & 73728;
$14 = $4 + $26 | 0;
label$170 : {
if ($13 | ($14 | 0) >= ($15 | 0)) {
break label$170
}
$4 = $15 - $14 | 0;
$6 = $4 >>> 0 < 256;
memset($8 + 624 | 0, 32, $6 ? $4 : 256);
if (!$6) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 624 | 0, 256, $0)
}
$4 = $4 - 256 | 0;
if ($4 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$170
}
__fwritex($8 + 624 | 0, $4, $0);
}
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($31, $26, $0)
}
label$175 : {
if (($13 | 0) != 65536 | ($15 | 0) <= ($14 | 0)) {
break label$175
}
$4 = $15 - $14 | 0;
$6 = $4 >>> 0 < 256;
memset($8 + 624 | 0, 48, $6 ? $4 : 256);
if (!$6) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 624 | 0, 256, $0)
}
$4 = $4 - 256 | 0;
if ($4 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$175
}
__fwritex($8 + 624 | 0, $4, $0);
}
if ($20) {
break label$8
}
$16 = $7 >>> 0 > $18 >>> 0 ? $18 : $7;
$9 = $16;
while (1) {
label$180 : {
label$181 : {
$4 = HEAP32[$9 >> 2];
label$182 : {
if ($4) {
$5 = 8;
while (1) {
$10 = $8 + 80 | 0;
$6 = ($4 >>> 0) / 10 | 0;
HEAP8[$10 + $5 | 0] = $4 - Math_imul($6, 10) | 48;
$5 = $5 - 1 | 0;
$7 = $4 >>> 0 > 9;
$4 = $6;
if ($7) {
continue
}
break;
};
$7 = $5 + 1 | 0;
$4 = $10 + $7 | 0;
if (($9 | 0) != ($16 | 0)) {
if (($5 + 2 | 0) < 2) {
break label$180
}
break label$181;
}
if (($5 | 0) != 8) {
break label$180
}
break label$182;
}
$7 = 9;
if (($9 | 0) != ($16 | 0)) {
break label$181
}
}
HEAP8[$8 + 88 | 0] = 48;
$4 = $34;
break label$180;
}
$5 = $8 + 80 | 0;
$6 = $5 + $7 | 0;
$4 = $6 - 1 | 0;
$4 = $4 >>> 0 > $5 >>> 0 ? $5 : $4;
memset($4, 48, $6 - $4 | 0);
}
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($4, $33 - $4 | 0, $0)
}
$9 = $9 + 4 | 0;
if ($18 >>> 0 >= $9 >>> 0) {
continue
}
break;
};
if (!(!$32 | HEAPU8[$0 | 0] & 32)) {
__fwritex(2599, 1, $0)
}
label$188 : {
if ($9 >>> 0 >= $19 >>> 0) {
$4 = $11;
break label$188;
}
if (($11 | 0) <= 0) {
$4 = $11;
break label$188;
}
while (1) {
$4 = HEAP32[$9 >> 2];
label$192 : {
label$193 : {
if (!$4) {
$5 = $33;
$7 = $5;
break label$193;
}
$7 = $33;
$5 = $7;
while (1) {
$5 = $5 - 1 | 0;
$6 = ($4 >>> 0) / 10 | 0;
HEAP8[$5 | 0] = $4 - Math_imul($6, 10) | 48;
$7 = $7 - 1 | 0;
$10 = $4 >>> 0 > 9;
$4 = $6;
if ($10) {
continue
}
break;
};
if ($8 + 80 >>> 0 >= $5 >>> 0) {
break label$192
}
}
$4 = $8 + 80 | 0;
$5 = ($4 + $5 | 0) - $7 | 0;
memset($5, 48, $7 - $4 | 0);
}
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($5, ($11 | 0) >= 9 ? 9 : $11, $0)
}
$4 = $11 - 9 | 0;
$9 = $9 + 4 | 0;
if ($19 >>> 0 <= $9 >>> 0) {
break label$188
}
$6 = ($11 | 0) > 9;
$11 = $4;
if ($6) {
continue
}
break;
};
}
pad($0, $4 + 9 | 0, 9);
break label$7;
}
HEAP32[1435] = 28;
break label$2;
}
$14 = 0;
$18 = 1024;
$4 = $25;
$10 = $16;
$13 = $9;
}
$16 = $4 - $6 | 0;
$9 = ($13 | 0) > ($16 | 0) ? $13 : $16;
if (($9 | 0) > ($14 ^ 2147483647)) {
break label$3
}
$20 = $9 + $14 | 0;
$4 = ($15 | 0) > ($20 | 0) ? $15 : $20;
if (($19 | 0) < ($4 | 0)) {
break label$3
}
$11 = $10 & 73728;
label$197 : {
if ($11 | ($15 | 0) <= ($20 | 0)) {
break label$197
}
$5 = $4 - $20 | 0;
$7 = $5 >>> 0 < 256;
memset($8 + 112 | 0, 32, $7 ? $5 : 256);
if (!$7) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 112 | 0, 256, $0)
}
$5 = $5 - 256 | 0;
if ($5 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$197
}
__fwritex($8 + 112 | 0, $5, $0);
}
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($18, $14, $0)
}
label$202 : {
if (($11 | 0) != 65536 | ($15 | 0) <= ($20 | 0)) {
break label$202
}
$5 = $4 - $20 | 0;
$7 = $5 >>> 0 < 256;
memset($8 + 112 | 0, 48, $7 ? $5 : 256);
if (!$7) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 112 | 0, 256, $0)
}
$5 = $5 - 256 | 0;
if ($5 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$202
}
__fwritex($8 + 112 | 0, $5, $0);
}
label$206 : {
if (($13 | 0) <= ($16 | 0)) {
break label$206
}
$5 = $9 - $16 | 0;
$7 = $5 >>> 0 < 256;
memset($8 + 112 | 0, 48, $7 ? $5 : 256);
if (!$7) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 112 | 0, 256, $0)
}
$5 = $5 - 256 | 0;
if ($5 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$206
}
__fwritex($8 + 112 | 0, $5, $0);
}
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($6, $16, $0)
}
if (($11 | 0) != 8192 | ($15 | 0) <= ($20 | 0)) {
continue
}
$5 = $4 - $20 | 0;
$6 = $5 >>> 0 < 256;
memset($8 + 112 | 0, 32, $6 ? $5 : 256);
if (!$6) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 112 | 0, 256, $0)
}
$5 = $5 - 256 | 0;
if ($5 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
continue
}
__fwritex($8 + 112 | 0, $5, $0);
continue;
}
label$214 : {
if (($11 | 0) < 0) {
break label$214
}
$18 = $7 >>> 0 < $19 >>> 0 ? $19 : $7 + 4 | 0;
$9 = $7;
while (1) {
label$216 : {
label$217 : {
$4 = HEAP32[$9 >> 2];
if (!$4) {
break label$217
}
$5 = 0;
while (1) {
$6 = ($4 >>> 0) / 10 | 0;
HEAP8[($5 + $8 | 0) + 88 | 0] = $4 - Math_imul($6, 10) | 48;
$5 = $5 - 1 | 0;
$10 = $4 >>> 0 > 9;
$4 = $6;
if ($10) {
continue
}
break;
};
if (!$5) {
break label$217
}
$4 = ($5 + $8 | 0) + 89 | 0;
break label$216;
}
HEAP8[$8 + 88 | 0] = 48;
$4 = $34;
}
label$219 : {
if (($7 | 0) != ($9 | 0)) {
$6 = $8 + 80 | 0;
if ($6 >>> 0 >= $4 >>> 0) {
break label$219
}
memset($6, 48, $4 - $6 | 0);
$4 = $6;
break label$219;
}
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($4, 1, $0)
}
$4 = $4 + 1 | 0;
if (!$27 & ($11 | 0) <= 0 | HEAPU8[$0 | 0] & 32) {
break label$219
}
__fwritex(2599, 1, $0);
}
$6 = $33 - $4 | 0;
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($4, ($6 | 0) > ($11 | 0) ? $11 : $6, $0)
}
$11 = $11 - $6 | 0;
$9 = $9 + 4 | 0;
if ($18 >>> 0 <= $9 >>> 0) {
break label$214
}
if (($11 | 0) >= 0) {
continue
}
break;
};
}
pad($0, $11 + 18 | 0, 18);
if (HEAPU8[$0 | 0] & 32) {
break label$7
}
__fwritex($28, $29 - $28 | 0, $0);
}
if (($13 | 0) != 8192 | ($15 | 0) <= ($14 | 0)) {
break label$5
}
$4 = $15 - $14 | 0;
$6 = $4 >>> 0 < 256;
memset($8 + 624 | 0, 32, $6 ? $4 : 256);
if (!$6) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 624 | 0, 256, $0)
}
$4 = $4 - 256 | 0;
if ($4 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$5
}
__fwritex($8 + 624 | 0, $4, $0);
break label$5;
}
$19 = ($23 << 26 >> 31 & 9) + $31 | 0;
label$227 : {
if ($9 >>> 0 > 11) {
break label$227
}
$4 = 12 - $9 | 0;
$5 = $4 & 7;
label$228 : {
if (!$5) {
$22 = 16.0;
break label$228;
}
$4 = $9 - 12 | 0;
$22 = 16.0;
while (1) {
$4 = $4 + 1 | 0;
$22 = $22 * 16.0;
$5 = $5 - 1 | 0;
if ($5) {
continue
}
break;
};
$4 = 0 - $4 | 0;
}
if ($9 - 5 >>> 0 >= 7) {
while (1) {
$22 = $22 * 16.0 * 16.0 * 16.0 * 16.0 * 16.0 * 16.0 * 16.0 * 16.0;
$4 = $4 - 8 | 0;
if ($4) {
continue
}
break;
}
}
if (HEAPU8[$19 | 0] == 45) {
$17 = -($22 + (-$17 - $22));
break label$227;
}
$17 = $17 + $22 - $22;
}
$18 = $26 | 2;
$11 = $23 & 32;
label$234 : {
label$235 : {
$13 = HEAP32[$8 + 108 >> 2];
if (!$13) {
break label$235
}
$4 = $13 >> 31;
$4 = ($4 ^ $13) - $4 | 0;
$5 = 0;
while (1) {
$6 = ($4 >>> 0) / 10 | 0;
HEAP8[($5 + $8 | 0) + 79 | 0] = $4 - Math_imul($6, 10) | 48;
$5 = $5 - 1 | 0;
$7 = $4 >>> 0 > 9;
$4 = $6;
if ($7) {
continue
}
break;
};
if (!$5) {
break label$235
}
$4 = ($5 + $8 | 0) + 80 | 0;
break label$234;
}
HEAP8[$8 + 79 | 0] = 48;
$4 = $39;
}
$10 = $4 - 2 | 0;
HEAP8[$10 | 0] = $23 + 15;
HEAP8[$4 - 1 | 0] = ($13 | 0) < 0 ? 45 : 43;
$7 = $16 & 8;
$5 = $8 + 80 | 0;
while (1) {
$4 = $5;
$6 = Math_abs($17) < 2147483648.0 ? ~~$17 : -2147483648;
HEAP8[$4 | 0] = $11 | HEAPU8[$6 + 5088 | 0];
$17 = ($17 - +($6 | 0)) * 16.0;
$5 = $4 + 1 | 0;
if (!(!(($9 | 0) > 0 | $7) & $17 == 0.0 | ($5 - ($8 + 80 | 0) | 0) != 1)) {
HEAP8[$4 + 1 | 0] = 46;
$5 = $4 + 2 | 0;
}
if ($17 != 0.0) {
continue
}
break;
};
$7 = $29 - $10 | 0;
$4 = $7 + $18 | 0;
if ((2147483645 - $4 | 0) < ($9 | 0)) {
break label$3
}
$11 = $16 & 73728;
$16 = $5 - ($8 + 80 | 0) | 0;
$6 = $9 ? (($5 + $38 | 0) < ($9 | 0) ? $9 + 2 | 0 : $16) : $16;
$14 = $6 + $4 | 0;
label$242 : {
if ($11 | ($15 | 0) <= ($14 | 0)) {
break label$242
}
$4 = $15 - $14 | 0;
$5 = $4 >>> 0 < 256;
memset($8 + 624 | 0, 32, $5 ? $4 : 256);
if (!$5) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 624 | 0, 256, $0)
}
$4 = $4 - 256 | 0;
if ($4 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$242
}
__fwritex($8 + 624 | 0, $4, $0);
}
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($19, $18, $0)
}
label$247 : {
if (($11 | 0) != 65536 | ($15 | 0) <= ($14 | 0)) {
break label$247
}
$4 = $15 - $14 | 0;
$5 = $4 >>> 0 < 256;
memset($8 + 624 | 0, 48, $5 ? $4 : 256);
if (!$5) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 624 | 0, 256, $0)
}
$4 = $4 - 256 | 0;
if ($4 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$247
}
__fwritex($8 + 624 | 0, $4, $0);
}
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 80 | 0, $16, $0)
}
$4 = $6 - $16 | 0;
label$252 : {
if (($4 | 0) <= 0) {
break label$252
}
$6 = $4 >>> 0 < 256;
memset($8 + 624 | 0, 48, $6 ? $4 : 256);
if (!$6) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 624 | 0, 256, $0)
}
$4 = $4 - 256 | 0;
if ($4 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$252
}
__fwritex($8 + 624 | 0, $4, $0);
}
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($10, $7, $0)
}
if (($11 | 0) != 8192 | ($15 | 0) <= ($14 | 0)) {
break label$5
}
$4 = $15 - $14 | 0;
$6 = $4 >>> 0 < 256;
memset($8 + 624 | 0, 32, $6 ? $4 : 256);
if (!$6) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($8 + 624 | 0, 256, $0)
}
$4 = $4 - 256 | 0;
if ($4 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$5
}
__fwritex($8 + 624 | 0, $4, $0);
}
$4 = ($15 | 0) < ($14 | 0) ? $14 : $15;
if (($4 | 0) >= 0) {
continue
}
}
break;
};
HEAP32[1435] = 61;
}
$21 = -1;
}
__stack_pointer = $8 + 880 | 0;
return $21;
}
function pop_arg($0, $1, $2) {
var $3 = 0, $4 = 0, $5 = 0;
folding_inner4 : {
folding_inner3 : {
folding_inner2 : {
switch ($1 - 9 | 0) {
case 6:
$1 = HEAP32[$2 >> 2];
HEAP32[$2 >> 2] = $1 + 4;
$1 = HEAP16[$1 >> 1];
HEAP32[$0 >> 2] = $1;
break folding_inner3;
case 7:
$1 = HEAP32[$2 >> 2];
HEAP32[$2 >> 2] = $1 + 4;
HEAP32[$0 >> 2] = HEAPU16[$1 >> 1];
break folding_inner4;
case 8:
$1 = HEAP32[$2 >> 2];
HEAP32[$2 >> 2] = $1 + 4;
$1 = HEAP8[$1 | 0];
HEAP32[$0 >> 2] = $1;
break folding_inner3;
case 9:
$1 = HEAP32[$2 >> 2];
HEAP32[$2 >> 2] = $1 + 4;
HEAP32[$0 >> 2] = HEAPU8[$1 | 0];
break folding_inner4;
case 16:
$1 = HEAP32[$2 >> 2] + 7 & -8;
HEAP32[$2 >> 2] = $1 + 8;
HEAPF64[$0 >> 3] = HEAPF64[$1 >> 3];
return;
case 17:
$2 = 2744;
$0 = strlen(2744);
$1 = HEAP32[1280];
label$10 : {
if (!$1) {
if (__towrite(5104)) {
break label$10
}
$1 = HEAP32[1280];
}
$3 = HEAP32[1281];
if ($0 >>> 0 > $1 - $3 >>> 0) {
FUNCTION_TABLE[HEAP32[1284]](5104, 2744, $0) | 0;
break label$10;
}
label$41 : {
if (HEAP32[1292] < 0) {
break label$41
}
$5 = $0 + 2744 | 0;
$1 = 0;
while (1) {
if (!($0 + $1 | 0)) {
break label$41
}
$1 = $1 - 1 | 0;
$4 = $5 + $1 | 0;
if (HEAPU8[$4 | 0] != 10) {
continue
}
break;
};
$0 = ($0 + $1 | 0) + 1 | 0;
if (FUNCTION_TABLE[HEAP32[1284]](5104, 2744, $0) >>> 0 < $0 >>> 0) {
break label$10
}
$2 = $4 + 1 | 0;
$3 = HEAP32[1281];
$0 = $1 ^ -1;
}
memcpy($3, $2, $0);
HEAP32[1281] = HEAP32[1281] + $0;
}
wasm2js_trap();
case 0:
$1 = HEAP32[$2 >> 2];
HEAP32[$2 >> 2] = $1 + 4;
HEAP32[$0 >> 2] = HEAP32[$1 >> 2];
default:
return;
case 1:
case 4:
case 14:
$1 = HEAP32[$2 >> 2];
HEAP32[$2 >> 2] = $1 + 4;
$1 = HEAP32[$1 >> 2];
HEAP32[$0 >> 2] = $1;
break folding_inner3;
case 2:
case 5:
case 11:
case 15:
$1 = HEAP32[$2 >> 2];
HEAP32[$2 >> 2] = $1 + 4;
HEAP32[$0 >> 2] = HEAP32[$1 >> 2];
break folding_inner4;
case 3:
case 10:
case 12:
case 13:
break folding_inner2;
};
}
$1 = HEAP32[$2 >> 2] + 7 & -8;
HEAP32[$2 >> 2] = $1 + 8;
$2 = HEAP32[$1 + 4 >> 2];
HEAP32[$0 >> 2] = HEAP32[$1 >> 2];
HEAP32[$0 + 4 >> 2] = $2;
return;
}
HEAP32[$0 + 4 >> 2] = $1 >> 31;
return;
}
HEAP32[$0 + 4 >> 2] = 0;
}
function pad($0, $1, $2) {
var $3 = 0, $4 = 0;
$3 = __stack_pointer - 256 | 0;
__stack_pointer = $3;
label$1 : {
if (($1 | 0) <= ($2 | 0)) {
break label$1
}
$2 = $1 - $2 | 0;
$1 = $2 >>> 0 < 256;
$4 = memset($3, 48, $1 ? $2 : 256);
if (!$1) {
while (1) {
if (!(HEAPU8[$0 | 0] & 32)) {
__fwritex($4, 256, $0)
}
$2 = $2 - 256 | 0;
if ($2 >>> 0 > 255) {
continue
}
break;
}
}
if (HEAPU8[$0 | 0] & 32) {
break label$1
}
__fwritex($4, $2, $0);
}
__stack_pointer = $3 + 256 | 0;
}
function memcmp($0, $1, $2) {
var $3 = 0, $4 = 0, $5 = 0;
label$1 : {
if (!$2) {
break label$1
}
while (1) {
$3 = HEAPU8[$0 | 0];
$4 = HEAPU8[$1 | 0];
if (($3 | 0) == ($4 | 0)) {
$1 = $1 + 1 | 0;
$0 = $0 + 1 | 0;
$2 = $2 - 1 | 0;
if ($2) {
continue
}
break label$1;
}
break;
};
$5 = $3 - $4 | 0;
}
return $5;
}
function memcpy($0, $1, $2) {
var $3 = 0, $4 = 0, $5 = 0, $6 = 0;
label$1 : {
label$2 : {
if ($2 >>> 0 <= 32) {
if (!($1 & 3) | !$2) {
break label$2
}
HEAP8[$0 | 0] = HEAPU8[$1 | 0];
$4 = $1 + 1 | 0;
$5 = $2 - 1 | 0;
$3 = $0 + 1 | 0;
if (!($4 & 3) | !$5) {
break label$1
}
HEAP8[$0 + 1 | 0] = HEAPU8[$1 + 1 | 0];
$4 = $1 + 2 | 0;
$5 = $2 - 2 | 0;
$3 = $0 + 2 | 0;
if (!($4 & 3) | !$5) {
break label$1
}
HEAP8[$0 + 2 | 0] = HEAPU8[$1 + 2 | 0];
$4 = $1 + 3 | 0;
$5 = $2 - 3 | 0;
$3 = $0 + 3 | 0;
if (!($4 & 3) | !$5) {
break label$1
}
HEAP8[$0 + 3 | 0] = HEAPU8[$1 + 3 | 0];
$5 = $2 - 4 | 0;
$4 = $1 + 4 | 0;
$3 = $0 + 4 | 0;
break label$1;
}
wasm2js_memory_copy($0, $1, $2);
return $0;
}
$5 = $2;
$4 = $1;
$3 = $0;
}
$1 = $3 & 3;
label$4 : {
if (!$1) {
label$6 : {
if ($5 >>> 0 < 16) {
$2 = $5;
break label$6;
}
$2 = $5 - 16 | 0;
if (!($2 & 16)) {
$1 = HEAP32[$4 + 4 >> 2];
HEAP32[$3 >> 2] = HEAP32[$4 >> 2];
HEAP32[$3 + 4 >> 2] = $1;
$1 = HEAP32[$4 + 12 >> 2];
HEAP32[$3 + 8 >> 2] = HEAP32[$4 + 8 >> 2];
HEAP32[$3 + 12 >> 2] = $1;
$3 = $3 + 16 | 0;
$4 = $4 + 16 | 0;
$5 = $2;
}
if ($2 >>> 0 < 16) {
break label$6
}
$2 = $5;
while (1) {
$1 = HEAP32[$4 + 4 >> 2];
HEAP32[$3 >> 2] = HEAP32[$4 >> 2];
HEAP32[$3 + 4 >> 2] = $1;
$1 = HEAP32[$4 + 12 >> 2];
HEAP32[$3 + 8 >> 2] = HEAP32[$4 + 8 >> 2];
HEAP32[$3 + 12 >> 2] = $1;
$1 = HEAP32[$4 + 20 >> 2];
HEAP32[$3 + 16 >> 2] = HEAP32[$4 + 16 >> 2];
HEAP32[$3 + 20 >> 2] = $1;
$1 = HEAP32[$4 + 28 >> 2];
HEAP32[$3 + 24 >> 2] = HEAP32[$4 + 24 >> 2];
HEAP32[$3 + 28 >> 2] = $1;
$3 = $3 + 32 | 0;
$4 = $4 + 32 | 0;
$2 = $2 - 32 | 0;
if ($2 >>> 0 > 15) {
continue
}
break;
};
}
if ($2 >>> 0 >= 8) {
$1 = HEAP32[$4 + 4 >> 2];
HEAP32[$3 >> 2] = HEAP32[$4 >> 2];
HEAP32[$3 + 4 >> 2] = $1;
$4 = $4 + 8 | 0;
$3 = $3 + 8 | 0;
}
if ($2 & 4) {
HEAP32[$3 >> 2] = HEAP32[$4 >> 2];
$4 = $4 + 4 | 0;
$3 = $3 + 4 | 0;
}
if ($2 & 2) {
$1 = HEAPU8[$4 | 0] | HEAPU8[$4 + 1 | 0] << 8;
HEAP8[$3 | 0] = $1;
HEAP8[$3 + 1 | 0] = $1 >>> 8;
$4 = $4 + 2 | 0;
$3 = $3 + 2 | 0;
}
if (!($2 & 1)) {
break label$4
}
HEAP8[$3 | 0] = HEAPU8[$4 | 0];
return $0;
}
label$13 : {
label$14 : {
label$15 : {
label$16 : {
if ($5 >>> 0 >= 32) {
label$18 : {
switch ($1 - 1 | 0) {
case 1:
$1 = HEAP32[$4 >> 2];
HEAP8[$3 | 0] = $1;
HEAP8[$3 + 1 | 0] = $1 >>> 8;
$1 = $4 + 2 | 0;
HEAP32[$3 + 2 >> 2] = HEAPU16[$1 >> 1] | HEAPU16[$1 + 2 >> 1] << 16;
$1 = $4 + 6 | 0;
$2 = HEAPU16[$1 + 4 >> 1] | HEAPU16[$1 + 6 >> 1] << 16;
HEAP32[$3 + 6 >> 2] = HEAPU16[$1 >> 1] | HEAPU16[$1 + 2 >> 1] << 16;
HEAP32[$3 + 10 >> 2] = $2;
$1 = $4 + 18 | 0;
$6 = 14;
$5 = $4 + 14 | 0;
$4 = HEAPU16[$5 >> 1] | HEAPU16[$5 + 2 >> 1] << 16;
$5 = 14;
$2 = $3 + 18 | 0;
break label$15;
case 0:
break label$16;
case 2:
break label$18;
default:
break label$4;
};
}
HEAP8[$3 | 0] = HEAP32[$4 >> 2];
$1 = $4 + 1 | 0;
HEAP32[$3 + 1 >> 2] = HEAPU8[$1 | 0] | HEAPU8[$1 + 1 | 0] << 8 | (HEAPU8[$1 + 2 | 0] << 16 | HEAPU8[$1 + 3 | 0] << 24);
$1 = $4 + 5 | 0;
$2 = HEAPU8[$1 + 4 | 0] | HEAPU8[$1 + 5 | 0] << 8 | (HEAPU8[$1 + 6 | 0] << 16 | HEAPU8[$1 + 7 | 0] << 24);
HEAP32[$3 + 5 >> 2] = HEAPU8[$1 | 0] | HEAPU8[$1 + 1 | 0] << 8 | (HEAPU8[$1 + 2 | 0] << 16 | HEAPU8[$1 + 3 | 0] << 24);
HEAP32[$3 + 9 >> 2] = $2;
$1 = $4 + 17 | 0;
$6 = 13;
$5 = $4 + 13 | 0;
$4 = HEAPU8[$5 | 0] | HEAPU8[$5 + 1 | 0] << 8 | (HEAPU8[$5 + 2 | 0] << 16 | HEAPU8[$5 + 3 | 0] << 24);
$5 = 15;
$2 = $3 + 17 | 0;
break label$15;
}
label$20 : {
if ($5 >>> 0 < 16) {
$2 = $3;
$1 = $4;
break label$20;
}
HEAP8[$3 | 0] = HEAPU8[$4 | 0];
$1 = HEAPU8[$4 + 1 | 0] | HEAPU8[$4 + 2 | 0] << 8 | (HEAPU8[$4 + 3 | 0] << 16 | HEAPU8[$4 + 4 | 0] << 24);
HEAP8[$3 + 1 | 0] = $1;
HEAP8[$3 + 2 | 0] = $1 >>> 8;
HEAP8[$3 + 3 | 0] = $1 >>> 16;
HEAP8[$3 + 4 | 0] = $1 >>> 24;
$1 = HEAPU8[$4 + 9 | 0] | HEAPU8[$4 + 10 | 0] << 8 | (HEAPU8[$4 + 11 | 0] << 16 | HEAPU8[$4 + 12 | 0] << 24);
$2 = HEAPU8[$4 + 5 | 0] | HEAPU8[$4 + 6 | 0] << 8 | (HEAPU8[$4 + 7 | 0] << 16 | HEAPU8[$4 + 8 | 0] << 24);
HEAP8[$3 + 5 | 0] = $2;
HEAP8[$3 + 6 | 0] = $2 >>> 8;
HEAP8[$3 + 7 | 0] = $2 >>> 16;
HEAP8[$3 + 8 | 0] = $2 >>> 24;
HEAP8[$3 + 9 | 0] = $1;
HEAP8[$3 + 10 | 0] = $1 >>> 8;
HEAP8[$3 + 11 | 0] = $1 >>> 16;
HEAP8[$3 + 12 | 0] = $1 >>> 24;
$1 = HEAPU8[$4 + 13 | 0] | HEAPU8[$4 + 14 | 0] << 8;
HEAP8[$3 + 13 | 0] = $1;
HEAP8[$3 + 14 | 0] = $1 >>> 8;
HEAP8[$3 + 15 | 0] = HEAPU8[$4 + 15 | 0];
$2 = $3 + 16 | 0;
$1 = $4 + 16 | 0;
}
if ($5 & 8) {
break label$14
}
break label$13;
}
$1 = HEAP32[$4 >> 2];
HEAP8[$3 | 0] = $1;
HEAP8[$3 + 2 | 0] = $1 >>> 16;
HEAP8[$3 + 1 | 0] = $1 >>> 8;
$1 = $4 + 3 | 0;
HEAP32[$3 + 3 >> 2] = HEAPU8[$1 | 0] | HEAPU8[$1 + 1 | 0] << 8 | (HEAPU8[$1 + 2 | 0] << 16 | HEAPU8[$1 + 3 | 0] << 24);
$1 = $4 + 7 | 0;
$2 = HEAPU8[$1 + 4 | 0] | HEAPU8[$1 + 5 | 0] << 8 | (HEAPU8[$1 + 6 | 0] << 16 | HEAPU8[$1 + 7 | 0] << 24);
HEAP32[$3 + 7 >> 2] = HEAPU8[$1 | 0] | HEAPU8[$1 + 1 | 0] << 8 | (HEAPU8[$1 + 2 | 0] << 16 | HEAPU8[$1 + 3 | 0] << 24);
HEAP32[$3 + 11 >> 2] = $2;
$1 = $4 + 19 | 0;
$6 = 15;
$5 = $4 + 15 | 0;
$4 = HEAPU8[$5 | 0] | HEAPU8[$5 + 1 | 0] << 8 | (HEAPU8[$5 + 2 | 0] << 16 | HEAPU8[$5 + 3 | 0] << 24);
$5 = 13;
$2 = $3 + 19 | 0;
}
HEAP32[$3 + $6 >> 2] = $4;
}
$3 = HEAPU8[$1 + 4 | 0] | HEAPU8[$1 + 5 | 0] << 8 | (HEAPU8[$1 + 6 | 0] << 16 | HEAPU8[$1 + 7 | 0] << 24);
$4 = HEAPU8[$1 | 0] | HEAPU8[$1 + 1 | 0] << 8 | (HEAPU8[$1 + 2 | 0] << 16 | HEAPU8[$1 + 3 | 0] << 24);
HEAP8[$2 | 0] = $4;
HEAP8[$2 + 1 | 0] = $4 >>> 8;
HEAP8[$2 + 2 | 0] = $4 >>> 16;
HEAP8[$2 + 3 | 0] = $4 >>> 24;
HEAP8[$2 + 4 | 0] = $3;
HEAP8[$2 + 5 | 0] = $3 >>> 8;
HEAP8[$2 + 6 | 0] = $3 >>> 16;
HEAP8[$2 + 7 | 0] = $3 >>> 24;
$2 = $2 + 8 | 0;
$1 = $1 + 8 | 0;
}
if ($5 & 4) {
$3 = HEAPU8[$1 | 0] | HEAPU8[$1 + 1 | 0] << 8 | (HEAPU8[$1 + 2 | 0] << 16 | HEAPU8[$1 + 3 | 0] << 24);
HEAP8[$2 | 0] = $3;
HEAP8[$2 + 1 | 0] = $3 >>> 8;
HEAP8[$2 + 2 | 0] = $3 >>> 16;
HEAP8[$2 + 3 | 0] = $3 >>> 24;
$2 = $2 + 4 | 0;
$1 = $1 + 4 | 0;
}
if ($5 & 2) {
$3 = HEAPU8[$1 | 0] | HEAPU8[$1 + 1 | 0] << 8;
HEAP8[$2 | 0] = $3;
HEAP8[$2 + 1 | 0] = $3 >>> 8;
$2 = $2 + 2 | 0;
$1 = $1 + 2 | 0;
}
if (!($5 & 1)) {
break label$4
}
HEAP8[$2 | 0] = HEAPU8[$1 | 0];
}
return $0;
}
function memset($0, $1, $2) {
var $3 = 0, $4 = 0, $5 = 0;
if ($2 >>> 0 >= 33) {
wasm2js_memory_fill($0, $1, $2);
return $0;
}
label$2 : {
if (!$2) {
break label$2
}
HEAP8[$0 | 0] = $1;
$3 = $0 + $2 | 0;
HEAP8[$3 - 1 | 0] = $1;
if ($2 >>> 0 < 3) {
break label$2
}
HEAP8[$0 + 2 | 0] = $1;
HEAP8[$0 + 1 | 0] = $1;
HEAP8[$3 - 3 | 0] = $1;
HEAP8[$3 - 2 | 0] = $1;
if ($2 >>> 0 < 7) {
break label$2
}
HEAP8[$0 + 3 | 0] = $1;
HEAP8[$3 - 4 | 0] = $1;
if ($2 >>> 0 < 9) {
break label$2
}
$5 = 0 - $0 & 3;
$4 = $5 + $0 | 0;
$3 = Math_imul($1 & 255, 16843009);
HEAP32[$4 >> 2] = $3;
$2 = $2 - $5 & -4;
$1 = $2 + $4 | 0;
HEAP32[$1 - 4 >> 2] = $3;
if ($2 >>> 0 < 9) {
break label$2
}
HEAP32[$4 + 8 >> 2] = $3;
HEAP32[$4 + 4 >> 2] = $3;
HEAP32[$1 - 8 >> 2] = $3;
HEAP32[$1 - 12 >> 2] = $3;
if ($2 >>> 0 < 25) {
break label$2
}
HEAP32[$4 + 24 >> 2] = $3;
HEAP32[$4 + 20 >> 2] = $3;
HEAP32[$4 + 16 >> 2] = $3;
HEAP32[$4 + 12 >> 2] = $3;
HEAP32[$1 - 16 >> 2] = $3;
HEAP32[$1 - 20 >> 2] = $3;
HEAP32[$1 - 24 >> 2] = $3;
HEAP32[$1 - 28 >> 2] = $3;
$1 = $2;
$2 = $4 & 4 | 24;
$1 = $1 - $2 | 0;
if ($1 >>> 0 < 32) {
break label$2
}
$3 = __wasm_i64_mul($3, 0, 1, 1);
$5 = i64toi32_i32$HIGH_BITS;
$2 = $2 + $4 | 0;
while (1) {
HEAP32[$2 + 24 >> 2] = $3;
HEAP32[$2 + 28 >> 2] = $5;
HEAP32[$2 + 16 >> 2] = $3;
HEAP32[$2 + 20 >> 2] = $5;
HEAP32[$2 + 8 >> 2] = $3;
HEAP32[$2 + 12 >> 2] = $5;
HEAP32[$2 >> 2] = $3;
HEAP32[$2 + 4 >> 2] = $5;
$2 = $2 + 32 | 0;
$1 = $1 - 32 | 0;
if ($1 >>> 0 > 31) {
continue
}
break;
};
}
return $0;
}
function strlen($0) {
var $1 = 0, $2 = 0;
$1 = $0;
label$1 : {
label$2 : {
if (!($1 & 3)) {
break label$2
}
if (!HEAPU8[$1 | 0]) {
break label$1
}
$1 = $1 + 1 | 0;
if (!($1 & 3)) {
break label$2
}
if (!HEAPU8[$1 | 0]) {
break label$1
}
$1 = $0 + 2 | 0;
if (!($1 & 3)) {
break label$2
}
if (!HEAPU8[$1 | 0]) {
break label$1
}
$1 = $0 + 3 | 0;
if (!($1 & 3)) {
break label$2
}
if (!HEAPU8[$1 | 0]) {
break label$1
}
$1 = $0 + 4 | 0;
}
$1 = $1 - 5 | 0;
while (1) {
$2 = $1 + 5 | 0;
$1 = $1 + 4 | 0;
$2 = HEAP32[$2 >> 2];
if (!(($2 ^ -1) & $2 - 16843009 & -2139062144)) {
continue
}
break;
};
while (1) {
$1 = $1 + 1 | 0;
if (HEAPU8[$1 | 0]) {
continue
}
break;
};
}
return $1 - $0 | 0;
}
function __wasm_ctz_i32($0) {
if ($0) {
return 31 - Math_clz32($0 - 1 ^ $0) | 0
}
return 32;
}
function __wasm_i64_mul($0, $1, $2, $3) {
var $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0;
$4 = $2 >>> 16 | 0;
$5 = $0 >>> 16 | 0;
$9 = Math_imul($4, $5);
$6 = $2 & 65535;
$7 = $0 & 65535;
$8 = Math_imul($6, $7);
$5 = ($8 >>> 16 | 0) + Math_imul($5, $6) | 0;
$4 = ($5 & 65535) + Math_imul($4, $7) | 0;
i64toi32_i32$HIGH_BITS = (Math_imul($1, $2) + $9 | 0) + Math_imul($0, $3) + ($5 >>> 16) + ($4 >>> 16) | 0;
return $8 & 65535 | $4 << 16;
}
function __wasm_i64_udiv($0, $1, $2) {
var $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, $10 = 0, $11 = 0;
__inlined_func$_ZN17compiler_builtins3int4udiv10divmod_u6417h6026910b5ed08e40E$48 : {
label$1 : {
label$2 : {
label$3 : {
label$4 : {
label$5 : {
label$6 : {
label$7 : {
label$9 : {
label$11 : {
if ($1) {
if (!$2) {
break label$11
}
break label$9;
}
i64toi32_i32$HIGH_BITS = 0;
$0 = ($0 >>> 0) / ($2 >>> 0) | 0;
break __inlined_func$_ZN17compiler_builtins3int4udiv10divmod_u6417h6026910b5ed08e40E$48;
}
if (!$0) {
break label$7
}
break label$6;
}
if (!($2 - 1 & $2)) {
break label$5
}
$6 = (Math_clz32($2) + 33 | 0) - Math_clz32($1) | 0;
$5 = 0 - $6 | 0;
break label$3;
}
i64toi32_i32$HIGH_BITS = 0;
$0 = ($1 >>> 0) / 0 | 0;
break __inlined_func$_ZN17compiler_builtins3int4udiv10divmod_u6417h6026910b5ed08e40E$48;
}
$3 = 32 - Math_clz32($1) | 0;
if ($3 >>> 0 < 31) {
break label$4
}
break label$2;
}
if (($2 | 0) == 1) {
break label$1
}
$3 = __wasm_ctz_i32($2);
$2 = $3 & 31;
if (($3 & 63) >>> 0 >= 32) {
$3 = 0;
$0 = $1 >>> $2 | 0;
} else {
$3 = $1 >>> $2 | 0;
$0 = ((1 << $2) - 1 & $1) << 32 - $2 | $0 >>> $2;
}
i64toi32_i32$HIGH_BITS = $3;
break __inlined_func$_ZN17compiler_builtins3int4udiv10divmod_u6417h6026910b5ed08e40E$48;
}
$6 = $3 + 1 | 0;
$5 = 63 - $3 | 0;
}
$3 = $6 & 63;
$4 = $3 & 31;
if ($3 >>> 0 >= 32) {
$3 = 0;
$7 = $1 >>> $4 | 0;
} else {
$3 = $1 >>> $4 | 0;
$7 = ((1 << $4) - 1 & $1) << 32 - $4 | $0 >>> $4;
}
$5 = $5 & 63;
$4 = $5 & 31;
if ($5 >>> 0 >= 32) {
$1 = $0 << $4;
$0 = 0;
} else {
$1 = (1 << $4) - 1 & $0 >>> 32 - $4 | $1 << $4;
$0 = $0 << $4;
}
if ($6) {
$5 = $2 - 1 | 0;
$11 = ($5 | 0) == -1 ? -1 : 0;
while (1) {
$8 = $3 << 1 | $7 >>> 31;
$3 = $7 << 1 | $1 >>> 31;
$4 = $11 - ($8 + ($3 >>> 0 > $5 >>> 0) | 0) >> 31;
$9 = $2 & $4;
$7 = $3 - $9 | 0;
$3 = $8 - ($3 >>> 0 < $9 >>> 0) | 0;
$1 = $1 << 1 | $0 >>> 31;
$0 = $10 | $0 << 1;
$10 = $4 & 1;
$6 = $6 - 1 | 0;
if ($6) {
continue
}
break;
};
}
i64toi32_i32$HIGH_BITS = $1 << 1 | $0 >>> 31;
$0 = $10 | $0 << 1;
break __inlined_func$_ZN17compiler_builtins3int4udiv10divmod_u6417h6026910b5ed08e40E$48;
}
$0 = 0;
$1 = 0;
}
i64toi32_i32$HIGH_BITS = $1;
}
return $0;
}
function __wasm_rotl_i32($0) {
var $1 = 0;
$1 = $0 & 31;
$0 = 0 - $0 & 31;
return (-1 >>> $1 & -2) << $1 | (-1 << $0 & -2) >>> $0;
}
bufferView = HEAPU8;
initActiveSegments(imports);
var FUNCTION_TABLE = [null, __stdio_close, __stdio_write, __stdio_seek];
function __wasm_memory_size() {
return buffer.byteLength / 65536 | 0;
}
function __wasm_memory_grow(pagesToAdd) {
pagesToAdd = pagesToAdd | 0;
var oldPages = __wasm_memory_size() | 0;
var newPages = oldPages + pagesToAdd | 0;
if ((oldPages < newPages) && (newPages < 65536)) {
var newBuffer = new ArrayBuffer(Math_imul(newPages, 65536));
var newHEAP8 = new Int8Array(newBuffer);
newHEAP8.set(HEAP8);
HEAP8 = new Int8Array(newBuffer);
HEAP16 = new Int16Array(newBuffer);
HEAP32 = new Int32Array(newBuffer);
HEAPU8 = new Uint8Array(newBuffer);
HEAPU16 = new Uint16Array(newBuffer);
HEAPU32 = new Uint32Array(newBuffer);
HEAPF32 = new Float32Array(newBuffer);
HEAPF64 = new Float64Array(newBuffer);
buffer = newBuffer;
bufferView = HEAPU8;
}
return oldPages;
}
return {
"memory": Object.create(Object.prototype, {
"grow": {
"value": __wasm_memory_grow
},
"buffer": {
"get": function () {
return buffer;
}
}
}),
"_initialize": _initialize,
"cabi_post_test_flavorful_test_f_list_in_record2": __wasm_export_exports_test_flavorful_test_f_list_in_record2_post_return,
"cabi_post_test_flavorful_test_f_list_in_record3": __wasm_export_exports_test_flavorful_test_f_list_in_record2_post_return,
"cabi_post_test_flavorful_test_f_list_in_record4": __wasm_export_exports_test_flavorful_test_f_list_in_record2_post_return,
"cabi_post_test_flavorful_test_f_list_in_variant2": __wasm_export_exports_test_flavorful_test_f_list_in_variant2_post_return,
"cabi_post_test_flavorful_test_f_list_in_variant3": __wasm_export_exports_test_flavorful_test_f_list_in_variant2_post_return,
"cabi_post_test_flavorful_test_list_typedefs": __wasm_export_exports_test_flavorful_test_list_typedefs_post_return,
"cabi_post_test_flavorful_test_list_of_variants": __wasm_export_exports_test_flavorful_test_list_of_variants_post_return,
"cabi_realloc": cabi_realloc,
"test_imports": __wasm_export_flavorful_test_imports,
"test_flavorful_test_f_list_in_record1": __wasm_export_exports_test_flavorful_test_f_list_in_record1,
"test_flavorful_test_f_list_in_record2": __wasm_export_exports_test_flavorful_test_f_list_in_record2,
"test_flavorful_test_f_list_in_record3": __wasm_export_exports_test_flavorful_test_f_list_in_record3,
"test_flavorful_test_f_list_in_record4": __wasm_export_exports_test_flavorful_test_f_list_in_record4,
"test_flavorful_test_f_list_in_variant1": __wasm_export_exports_test_flavorful_test_f_list_in_variant1,
"test_flavorful_test_f_list_in_variant2": __wasm_export_exports_test_flavorful_test_f_list_in_variant2,
"test_flavorful_test_f_list_in_variant3": __wasm_export_exports_test_flavorful_test_f_list_in_variant3,
"test_flavorful_test_errno_result": __wasm_export_exports_test_flavorful_test_errno_result,
"test_flavorful_test_list_typedefs": __wasm_export_exports_test_flavorful_test_list_typedefs,
"test_flavorful_test_list_of_variants": __wasm_export_exports_test_flavorful_test_list_of_variants
};
},
function asm1(imports) {
var bufferView;
function wasm2js_trap() { throw new Error('abort'); }
var env = imports.env;
var memory = env.memory;
var buffer = memory.buffer;
var HEAP8 = new Int8Array(buffer);
var HEAP16 = new Int16Array(buffer);
var HEAP32 = new Int32Array(buffer);
var HEAPU8 = new Uint8Array(buffer);
var HEAPU16 = new Uint16Array(buffer);
var HEAPU32 = new Uint32Array(buffer);
var HEAPF32 = new Float32Array(buffer);
var HEAPF64 = new Float64Array(buffer);
var Math_imul = Math.imul;
var Math_fround = Math.fround;
var Math_abs = Math.abs;
var Math_clz32 = Math.clz32;
var Math_min = Math.min;
var Math_max = Math.max;
var Math_floor = Math.floor;
var Math_ceil = Math.ceil;
var Math_trunc = Math.trunc;
var Math_sqrt = Math.sqrt;
var testwasi = imports.testwasi;
var _ZN22wasi_snapshot_preview18testwasi7log_err10wit_import17h4f8032c56ea3d0a1E = testwasi["log-err"];
var _ZN22wasi_snapshot_preview18testwasi3log10wit_import17h709ba6849b8281acE = testwasi.log;
function fd_write($0, $1, $2, $3) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
$3 = $3 | 0;
var $4 = 0;
label$1 : {
if ($0 - 3 >>> 0 >= 4294967294) {
label$3 : {
if ($2) {
while (1) {
$4 = HEAP32[$1 + 4 >> 2];
if ($4) {
break label$3
}
$1 = $1 + 8 | 0;
$2 = $2 - 1 | 0;
if ($2) {
continue
}
break;
}
}
HEAP32[$3 >> 2] = 0;
return 0;
}
$1 = HEAP32[$1 >> 2];
if (($0 | 0) == 1) {
break label$1
}
_ZN22wasi_snapshot_preview18testwasi7log_err10wit_import17h4f8032c56ea3d0a1E($1 | 0, $4 | 0);
HEAP32[$3 >> 2] = $4;
return 0;
}
wasm2js_trap();
}
_ZN22wasi_snapshot_preview18testwasi3log10wit_import17h709ba6849b8281acE($1 | 0, $4 | 0);
HEAP32[$3 >> 2] = $4;
return 0;
}
function fd_close($0) {
$0 = $0 | 0;
wasm2js_trap();
}
function legalstub$fd_seek($0, $1, $2, $3, $4) {
wasm2js_trap();
}
bufferView = HEAPU8;
function __wasm_memory_size() {
return buffer.byteLength / 65536 | 0;
}
function __wasm_memory_grow(pagesToAdd) {
pagesToAdd = pagesToAdd | 0;
var oldPages = __wasm_memory_size() | 0;
var newPages = oldPages + pagesToAdd | 0;
if ((oldPages < newPages) && (newPages < 65536)) {
var newBuffer = new ArrayBuffer(Math_imul(newPages, 65536));
var newHEAP8 = new Int8Array(newBuffer);
newHEAP8.set(HEAP8);
HEAP8 = new Int8Array(newBuffer);
HEAP16 = new Int16Array(newBuffer);
HEAP32 = new Int32Array(newBuffer);
HEAPU8 = new Uint8Array(newBuffer);
HEAPU16 = new Uint16Array(newBuffer);
HEAPU32 = new Uint32Array(newBuffer);
HEAPF32 = new Float32Array(newBuffer);
HEAPF64 = new Float64Array(newBuffer);
buffer = newBuffer;
memory.buffer = buffer;
bufferView = HEAPU8;
}
return oldPages;
}
return {
"fd_write": fd_write,
"fd_seek": legalstub$fd_seek,
"fd_close": fd_close
};
},
function asm2(imports) {
function Table(ret) {
// grow method not included; table is not growable
ret.set = function(i, func) {
this[i] = func;
};
ret.get = function(i) {
return this[i];
};
return ret;
}
var Math_imul = Math.imul;
var Math_fround = Math.fround;
var Math_abs = Math.abs;
var Math_clz32 = Math.clz32;
var Math_min = Math.min;
var Math_max = Math.max;
var Math_floor = Math.floor;
var Math_ceil = Math.ceil;
var Math_trunc = Math.trunc;
var Math_sqrt = Math.sqrt;
function indirect_test_flavorful_test_f_list_in_record1($0, $1) {
$0 = $0 | 0;
$1 = $1 | 0;
FUNCTION_TABLE[0]($0, $1);
}
function indirect_test_flavorful_test_f_list_in_record2($0) {
$0 = $0 | 0;
FUNCTION_TABLE[1]($0);
}
function indirect_test_flavorful_test_f_list_in_record3($0, $1, $2) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
FUNCTION_TABLE[2]($0, $1, $2);
}
function indirect_test_flavorful_test_f_list_in_record4($0, $1, $2) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
FUNCTION_TABLE[3]($0, $1, $2);
}
function indirect_test_flavorful_test_f_list_in_variant1($0, $1, $2, $3, $4, $5) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
$3 = $3 | 0;
$4 = $4 | 0;
$5 = $5 | 0;
FUNCTION_TABLE[4]($0, $1, $2, $3, $4, $5);
}
function indirect_test_flavorful_test_f_list_in_variant2($0) {
$0 = $0 | 0;
FUNCTION_TABLE[5]($0);
}
function indirect_test_flavorful_test_f_list_in_variant3($0, $1, $2, $3) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
$3 = $3 | 0;
FUNCTION_TABLE[6]($0, $1, $2, $3);
}
function indirect_test_flavorful_test_errno_result($0) {
$0 = $0 | 0;
FUNCTION_TABLE[7]($0);
}
function indirect_test_flavorful_test_list_typedefs($0, $1, $2, $3, $4) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
$3 = $3 | 0;
$4 = $4 | 0;
FUNCTION_TABLE[8]($0, $1, $2, $3, $4);
}
function indirect_test_flavorful_test_list_of_variants($0, $1, $2, $3, $4, $5, $6) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
$3 = $3 | 0;
$4 = $4 | 0;
$5 = $5 | 0;
$6 = $6 | 0;
FUNCTION_TABLE[9]($0, $1, $2, $3, $4, $5, $6);
}
function indirect_testwasi_log($0, $1) {
$0 = $0 | 0;
$1 = $1 | 0;
FUNCTION_TABLE[10]($0, $1);
}
function indirect_testwasi_log_err($0, $1) {
$0 = $0 | 0;
$1 = $1 | 0;
FUNCTION_TABLE[11]($0, $1);
}
function adapt_wasi_snapshot_preview1_fd_close($0) {
$0 = $0 | 0;
return FUNCTION_TABLE[12]($0) | 0;
}
function adapt_wasi_snapshot_preview1_fd_write($0, $1, $2, $3) {
$0 = $0 | 0;
$1 = $1 | 0;
$2 = $2 | 0;
$3 = $3 | 0;
return FUNCTION_TABLE[14]($0, $1, $2, $3) | 0;
}
function legalstub$adapt_wasi_snapshot_preview1_fd_seek($0, $1, $2, $3, $4) {
return FUNCTION_TABLE[13]($0, $1, $2, $3, $4) | 0;
}
var FUNCTION_TABLE = Table([]);
return {
"$0": indirect_test_flavorful_test_f_list_in_record1,
"$1": indirect_test_flavorful_test_f_list_in_record2,
"$2": indirect_test_flavorful_test_f_list_in_record3,
"$3": indirect_test_flavorful_test_f_list_in_record4,
"$4": indirect_test_flavorful_test_f_list_in_variant1,
"$5": indirect_test_flavorful_test_f_list_in_variant2,
"$6": indirect_test_flavorful_test_f_list_in_variant3,
"$7": indirect_test_flavorful_test_errno_result,
"$8": indirect_test_flavorful_test_list_typedefs,
"$9": indirect_test_flavorful_test_list_of_variants,
"$10": indirect_testwasi_log,
"$11": indirect_testwasi_log_err,
"$12": adapt_wasi_snapshot_preview1_fd_close,
"$13": legalstub$adapt_wasi_snapshot_preview1_fd_seek,
"$14": adapt_wasi_snapshot_preview1_fd_write,
"$imports": FUNCTION_TABLE
};
},
function asm3(imports) {
var $ = imports[""];
var FUNCTION_TABLE = $.$imports;
var Math_imul = Math.imul;
var Math_fround = Math.fround;
var Math_abs = Math.abs;
var Math_clz32 = Math.clz32;
var Math_min = Math.min;
var Math_max = Math.max;
var Math_floor = Math.floor;
var Math_ceil = Math.ceil;
var Math_trunc = Math.trunc;
var Math_sqrt = Math.sqrt;
var fimport$0 = $["0"];
var fimport$1 = $["1"];
var fimport$2 = $["2"];
var fimport$3 = $["3"];
var fimport$4 = $["4"];
var fimport$5 = $["5"];
var fimport$6 = $["6"];
var fimport$7 = $["7"];
var fimport$8 = $["8"];
var fimport$9 = $["9"];
var fimport$10 = $["10"];
var fimport$11 = $["11"];
var fimport$12 = $["12"];
var fimport$14 = $["14"];
var legalimport$fimport$13 = $["13"];
function legalfunc$fimport$13($0, $1, $2, $3, $4) {
return legalimport$fimport$13($0 | 0, $1 | 0, $2 | 0, $3 | 0, $4 | 0) | 0;
}
FUNCTION_TABLE[0] = fimport$0;
FUNCTION_TABLE[1] = fimport$1;
FUNCTION_TABLE[2] = fimport$2;
FUNCTION_TABLE[3] = fimport$3;
FUNCTION_TABLE[4] = fimport$4;
FUNCTION_TABLE[5] = fimport$5;
FUNCTION_TABLE[6] = fimport$6;
FUNCTION_TABLE[7] = fimport$7;
FUNCTION_TABLE[8] = fimport$8;
FUNCTION_TABLE[9] = fimport$9;
FUNCTION_TABLE[10] = fimport$10;
FUNCTION_TABLE[11] = fimport$11;
FUNCTION_TABLE[12] = fimport$12;
FUNCTION_TABLE[13] = legalfunc$fimport$13;
FUNCTION_TABLE[14] = fimport$14;
return {
};
}];
let _testImports;
let test;
let test_flavorful_test;
function testImports () {
return _testImports.apply(this, arguments);
}
async function instantiate(imports) {
const wasm_file_to_asm_index = {
'flavorful.core.wasm': 0,
'flavorful.core2.wasm': 1,
'flavorful.core3.wasm': 2,
'flavorful.core4.wasm': 3
};
return await _instantiate(
module_name => wasm_file_to_asm_index[module_name],
imports,
(module_index, imports) => ({ exports: asmInit[module_index](imports) })
);
}
export {
test,
test_flavorful_test as 'test:flavorful/test',
testImports,
}
async function $init() {
( {
test,
'test:flavorful/test': test_flavorful_test,
'testImports': _testImports,
} = await instantiate(
{
'../flavorful.js': import0,
'../helpers.js': import1,
}
) )
}
await $init();
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment